block-range.h 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. #ifndef __PERF_BLOCK_RANGE_H
  2. #define __PERF_BLOCK_RANGE_H
  3. #include "symbol.h"
  4. /*
  5. * struct block_range - non-overlapping parts of basic blocks
  6. * @node: treenode
  7. * @start: inclusive start of range
  8. * @end: inclusive end of range
  9. * @is_target: @start is a jump target
  10. * @is_branch: @end is a branch instruction
  11. * @coverage: number of blocks that cover this range
  12. * @taken: number of times the branch is taken (requires @is_branch)
  13. * @pred: number of times the taken branch was predicted
  14. */
  15. struct block_range {
  16. struct rb_node node;
  17. struct symbol *sym;
  18. u64 start;
  19. u64 end;
  20. int is_target, is_branch;
  21. u64 coverage;
  22. u64 entry;
  23. u64 taken;
  24. u64 pred;
  25. };
  26. static inline struct block_range *block_range__next(struct block_range *br)
  27. {
  28. struct rb_node *n = rb_next(&br->node);
  29. if (!n)
  30. return NULL;
  31. return rb_entry(n, struct block_range, node);
  32. }
  33. struct block_range_iter {
  34. struct block_range *start;
  35. struct block_range *end;
  36. };
  37. static inline struct block_range *block_range_iter(struct block_range_iter *iter)
  38. {
  39. return iter->start;
  40. }
  41. static inline bool block_range_iter__next(struct block_range_iter *iter)
  42. {
  43. if (iter->start == iter->end)
  44. return false;
  45. iter->start = block_range__next(iter->start);
  46. return true;
  47. }
  48. static inline bool block_range_iter__valid(struct block_range_iter *iter)
  49. {
  50. if (!iter->start || !iter->end)
  51. return false;
  52. return true;
  53. }
  54. extern struct block_range *block_range__find(u64 addr);
  55. extern struct block_range_iter block_range__create(u64 start, u64 end);
  56. extern double block_range__coverage(struct block_range *br);
  57. #endif /* __PERF_BLOCK_RANGE_H */