| /tools/testing/radix-tree/ |
| D | regression3.c | 33 struct radix_tree_iter iter; in regression3_test() local
43 radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { in regression3_test()
44 printf("tagged %ld %p\n", iter.index, *slot); in regression3_test()
51 printf("retry at %ld\n", iter.index); in regression3_test()
52 slot = radix_tree_iter_retry(&iter); in regression3_test()
59 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
60 printf("slot %ld %p\n", iter.index, *slot); in regression3_test()
66 printk("retry at %ld\n", iter.index); in regression3_test()
67 slot = radix_tree_iter_retry(&iter); in regression3_test()
74 radix_tree_for_each_contig(slot, &root, &iter, 0) { in regression3_test()
[all …]
|
| D | iteration_check.c | 52 struct radix_tree_iter iter; in tagged_iteration_fn() local
57 radix_tree_for_each_tagged(slot, &tree, &iter, 0, TAG) { in tagged_iteration_fn()
70 slot = radix_tree_iter_retry(&iter); in tagged_iteration_fn()
75 slot = radix_tree_iter_next(&iter); in tagged_iteration_fn()
92 struct radix_tree_iter iter; in untagged_iteration_fn() local
97 radix_tree_for_each_slot(slot, &tree, &iter, 0) { in untagged_iteration_fn()
110 slot = radix_tree_iter_retry(&iter); in untagged_iteration_fn()
115 slot = radix_tree_iter_next(&iter); in untagged_iteration_fn()
|
| D | multiorder.c | 211 struct radix_tree_iter iter; in multiorder_iteration() local
231 radix_tree_for_each_slot(slot, &tree, &iter, j) { in multiorder_iteration()
236 assert(iter.index >= (index[i] &~ mask)); in multiorder_iteration()
237 assert(iter.index <= (index[i] | mask)); in multiorder_iteration()
238 assert(iter.shift == shift); in multiorder_iteration()
249 struct radix_tree_iter iter; in multiorder_tagged_iteration() local
281 radix_tree_for_each_tagged(slot, &tree, &iter, j, 1) { in multiorder_tagged_iteration()
286 assert(iter.index >= (tag_index[i] &~ mask)); in multiorder_tagged_iteration()
287 assert(iter.index <= (tag_index[i] | mask)); in multiorder_tagged_iteration()
305 radix_tree_for_each_tagged(slot, &tree, &iter, j, 2) { in multiorder_tagged_iteration()
[all …]
|
| /tools/perf/util/ |
| D | block-range.h | 46 static inline struct block_range *block_range_iter(struct block_range_iter *iter) in block_range_iter() argument
48 return iter->start; in block_range_iter()
51 static inline bool block_range_iter__next(struct block_range_iter *iter) in block_range_iter__next() argument
53 if (iter->start == iter->end) in block_range_iter__next()
56 iter->start = block_range__next(iter->start); in block_range_iter__next()
60 static inline bool block_range_iter__valid(struct block_range_iter *iter) in block_range_iter__valid() argument
62 if (!iter->start || !iter->end) in block_range_iter__valid()
|
| D | block-range.c | 83 struct block_range_iter iter = { NULL, NULL }; in block_range__create() local
119 return iter; in block_range__create()
132 iter.start = head; in block_range__create()
142 return iter; in block_range__create()
155 iter.start = entry; in block_range__create()
156 iter.end = entry; in block_range__create()
166 return iter; in block_range__create()
189 iter.start = entry; in block_range__create()
196 entry = iter.start; in block_range__create()
204 return iter; in block_range__create()
[all …]
|
| D | hist.c | 634 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, in iter_next_nop_entry()
641 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, in iter_add_next_nop_entry()
648 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_prepare_mem_entry() argument
650 struct perf_sample *sample = iter->sample; in iter_prepare_mem_entry()
657 iter->priv = mi; in iter_prepare_mem_entry()
662 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_add_single_mem_entry() argument
665 struct mem_info *mi = iter->priv; in iter_add_single_mem_entry()
666 struct hists *hists = evsel__hists(iter->evsel); in iter_add_single_mem_entry()
667 struct perf_sample *sample = iter->sample; in iter_add_single_mem_entry()
686 he = hists__add_entry(hists, al, iter->parent, NULL, mi, in iter_add_single_mem_entry()
[all …]
|
| D | comm.c | 55 struct comm_str *iter, *new; in comm_str__findnew() local
60 iter = rb_entry(parent, struct comm_str, rb_node); in comm_str__findnew()
62 cmp = strcmp(str, iter->str); in comm_str__findnew()
64 return iter; in comm_str__findnew()
|
| D | ordered-events.c | 189 struct ordered_event *tmp, *iter; in __ordered_events__flush() local
202 list_for_each_entry_safe(iter, tmp, head, list) { in __ordered_events__flush()
206 if (iter->timestamp > limit) in __ordered_events__flush()
208 ret = oe->deliver(oe, iter); in __ordered_events__flush()
212 ordered_events__delete(oe, iter); in __ordered_events__flush()
213 oe->last_flush = iter->timestamp; in __ordered_events__flush()
|
| D | annotate.c | 1443 struct source_line *iter; in insert_source_line() local
1450 iter = rb_entry(parent, struct source_line, node); in insert_source_line()
1452 ret = strcmp(iter->path, src_line->path); in insert_source_line()
1455 iter->samples[i].percent_sum += src_line->samples[i].percent; in insert_source_line()
1487 struct source_line *iter; in __resort_source_line() local
1493 iter = rb_entry(parent, struct source_line, node); in __resort_source_line()
1495 if (cmp_source_line(src_line, iter)) in __resort_source_line()
|
| D | hist.h | 115 int (*add_entry_cb)(struct hist_entry_iter *iter,
141 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 101 GtkTreeIter iter, new_parent; in perf_gtk__add_callchain_flat() local
114 gtk_tree_store_append(store, &iter, &new_parent); in perf_gtk__add_callchain_flat()
117 gtk_tree_store_set(store, &iter, 0, buf, -1); in perf_gtk__add_callchain_flat()
120 gtk_tree_store_set(store, &iter, col, buf, -1); in perf_gtk__add_callchain_flat()
127 new_parent = iter; in perf_gtk__add_callchain_flat()
135 gtk_tree_store_append(store, &iter, &new_parent); in perf_gtk__add_callchain_flat()
138 gtk_tree_store_set(store, &iter, 0, buf, -1); in perf_gtk__add_callchain_flat()
141 gtk_tree_store_set(store, &iter, col, buf, -1); in perf_gtk__add_callchain_flat()
148 new_parent = iter; in perf_gtk__add_callchain_flat()
163 GtkTreeIter iter; in perf_gtk__add_callchain_folded() local
[all …]
|
| D | annotate.c | 121 GtkTreeIter iter; in perf_gtk__annotate_symbol() local
124 gtk_list_store_append(store, &iter); in perf_gtk__annotate_symbol()
140 gtk_list_store_set(store, &iter, ANN_COL__PERCENT, s, -1); in perf_gtk__annotate_symbol()
142 gtk_list_store_set(store, &iter, ANN_COL__OFFSET, s, -1); in perf_gtk__annotate_symbol()
144 gtk_list_store_set(store, &iter, ANN_COL__LINE, s, -1); in perf_gtk__annotate_symbol()
|
| /tools/perf/ |
| D | builtin-annotate.c | 80 struct block_range_iter iter; in process_basic_block() local
89 iter = block_range__create(start->addr, end->addr); in process_basic_block()
90 if (!block_range_iter__valid(&iter)) in process_basic_block()
96 entry = block_range_iter(&iter); in process_basic_block()
101 entry = block_range_iter(&iter); in process_basic_block()
109 } while (block_range_iter__next(&iter)); in process_basic_block()
114 entry = block_range_iter(&iter); in process_basic_block()
|
| D | builtin-report.c | 100 static int hist_iter__report_callback(struct hist_entry_iter *iter, in hist_iter__report_callback() argument
106 struct hist_entry *he = iter->he; in hist_iter__report_callback()
107 struct perf_evsel *evsel = iter->evsel; in hist_iter__report_callback()
114 hist__account_cycles(iter->sample->branch_stack, al, iter->sample, in hist_iter__report_callback()
153 struct hist_entry_iter iter = { in process_sample_event() local
180 iter.ops = &hist_iter_branch; in process_sample_event()
182 iter.ops = &hist_iter_mem; in process_sample_event()
184 iter.ops = &hist_iter_cumulative; in process_sample_event()
186 iter.ops = &hist_iter_normal; in process_sample_event()
192 ret = hist_entry_iter__add(&iter, &al, rep->max_stack, rep); in process_sample_event()
|
| D | builtin-top.c | 665 static int hist_iter__top_callback(struct hist_entry_iter *iter, in hist_iter__top_callback() argument
670 struct hist_entry *he = iter->he; in hist_iter__top_callback()
671 struct perf_evsel *evsel = iter->evsel; in hist_iter__top_callback()
676 hist__account_cycles(iter->sample->branch_stack, al, iter->sample, in hist_iter__top_callback()
765 struct hist_entry_iter iter = { in perf_event__process_sample() local
772 iter.ops = &hist_iter_cumulative; in perf_event__process_sample()
774 iter.ops = &hist_iter_normal; in perf_event__process_sample()
778 err = hist_entry_iter__add(&iter, &al, top->max_stack, top); in perf_event__process_sample()
|
| /tools/perf/tests/ |
| D | hists_cumulate.c | 84 struct hist_entry_iter iter = { in add_hist_entries() local
91 iter.ops = &hist_iter_cumulative; in add_hist_entries()
93 iter.ops = &hist_iter_normal; in add_hist_entries()
104 if (hist_entry_iter__add(&iter, &al, sysctl_perf_event_max_stack, in add_hist_entries()
|
| D | hists_filter.c | 61 struct hist_entry_iter iter = { in add_hist_entries() local
83 if (hist_entry_iter__add(&iter, &al, in add_hist_entries()
|
| D | hists_output.c | 54 struct hist_entry_iter iter = { in add_hist_entries() local
70 if (hist_entry_iter__add(&iter, &al, sysctl_perf_event_max_stack, in add_hist_entries()
|