| /tools/lib/api/fd/ |
| D | array.c | 15 fda->entries = NULL; in fdarray__init()
27 struct pollfd *entries = realloc(fda->entries, size); in fdarray__grow() local
29 if (entries == NULL) in fdarray__grow()
34 free(entries); in fdarray__grow()
39 fda->entries = entries; in fdarray__grow()
62 free(fda->entries); in fdarray__exit()
81 fda->entries[fda->nr].fd = fd; in fdarray__add()
82 fda->entries[fda->nr].events = revents; in fdarray__add()
96 if (fda->entries[fd].revents & revents) { in fdarray__filter()
104 fda->entries[nr] = fda->entries[fd]; in fdarray__filter()
[all …]
|
| D | array.h | 22 struct pollfd *entries; member
|
| /tools/perf/tests/ |
| D | fdarray.c | 12 fda->entries[fd].fd = fda->nr - fd; in fdarray__init_revents()
13 fda->entries[fd].revents = revents; in fdarray__init_revents()
55 fda->entries[2].revents = POLLIN; in test__fdarray__filter()
56 expected_fd[0] = fda->entries[2].fd; in test__fdarray__filter()
67 if (fda->entries[0].fd != expected_fd[0]) { in test__fdarray__filter()
69 fda->entries[0].fd, expected_fd[0]); in test__fdarray__filter()
74 fda->entries[0].revents = POLLIN; in test__fdarray__filter()
75 expected_fd[0] = fda->entries[0].fd; in test__fdarray__filter()
76 fda->entries[3].revents = POLLIN; in test__fdarray__filter()
77 expected_fd[1] = fda->entries[3].fd; in test__fdarray__filter()
[all …]
|
| D | hists_output.c | 105 root_out = &hists->entries; in del_hist_entries()
166 root = &hists->entries; in test1()
266 root = &hists->entries; in test2()
320 root = &hists->entries; in test3()
398 root = &hists->entries; in test4()
501 root = &hists->entries; in test5()
|
| /tools/perf/util/ |
| D | pstack.c | 16 void *entries[0]; member
43 if (pstack->entries[i] == key) { in pstack__remove()
45 memmove(pstack->entries + i, in pstack__remove()
46 pstack->entries + i + 1, in pstack__remove()
61 pstack->entries[pstack->top++] = key; in pstack__push()
73 ret = pstack->entries[--pstack->top]; in pstack__pop()
74 pstack->entries[pstack->top] = NULL; in pstack__pop()
82 return pstack->entries[pstack->top - 1]; in pstack__peek()
|
| D | rblist.c | 16 struct rb_node **p = &rblist->entries.rb_node; in rblist__add_node()
38 rb_insert_color(new_node, &rblist->entries); in rblist__add_node()
46 rb_erase(rb_node, &rblist->entries); in rblist__remove_node()
55 struct rb_node **p = &rblist->entries.rb_node; in __rblist__findnew()
76 rb_insert_color(new_node, &rblist->entries); in __rblist__findnew()
97 rblist->entries = RB_ROOT; in rblist__init()
107 struct rb_node *pos, *next = rb_first(&rblist->entries); in rblist__delete()
122 for (node = rb_first(&rblist->entries); node; node = rb_next(node)) { in rblist__entry()
|
| D | xyarray.c | 12 xy->entries = xlen * ylen; in xyarray__new()
20 size_t n = xy->entries * xy->entry_size; in xyarray__reset()
|
| D | evlist.h | 38 struct list_head entries; member
189 return list_entry(evlist->entries.next, struct perf_evsel, node); in perf_evlist__first()
194 return list_entry(evlist->entries.prev, struct perf_evsel, node); in perf_evlist__last()
239 __evlist__for_each(&(evlist)->entries, evsel)
255 __evlist__for_each_continue(&(evlist)->entries, evsel)
271 __evlist__for_each_reverse(&(evlist)->entries, evsel)
289 __evlist__for_each_safe(&(evlist)->entries, tmp, evsel)
|
| D | xyarray.h | 9 size_t entries; member
|
| D | map.c | 462 maps->entries = RB_ROOT; in maps__init()
478 struct rb_root *root = &maps->entries; in __maps__purge()
564 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__find_symbol_by_name()
617 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__fprintf()
661 root = &maps->entries; in maps__fixup_overlappings()
757 struct rb_node **p = &maps->entries.rb_node; in __maps__insert()
772 rb_insert_color(&map->rb_node, &maps->entries); in __maps__insert()
785 rb_erase_init(&map->rb_node, &maps->entries); in __maps__remove()
803 p = &maps->entries.rb_node; in maps__find()
823 struct rb_node *first = rb_first(&maps->entries); in maps__first()
|
| D | rblist.h | 22 struct rb_root entries; member
|
| D | hist.c | 186 struct rb_node *next = rb_first(&hists->entries); in hists__output_recalc_col_len()
271 rb_erase(&he->rb_node, &hists->entries); in hists__delete_entry()
285 struct rb_node *next = rb_first(&hists->entries); in hists__decay_entries()
301 struct rb_node *next = rb_first(&hists->entries); in hists__delete_entries()
1131 static void __hists__insert_output_entry(struct rb_root *entries, in __hists__insert_output_entry() argument
1136 struct rb_node **p = &entries->rb_node; in __hists__insert_output_entry()
1155 rb_insert_color(&he->rb_node, entries); in __hists__insert_output_entry()
1180 hists->entries = RB_ROOT; in hists__output_resort()
1189 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain); in hists__output_resort()
1240 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { in hists__filter_by_dso()
[all …]
|
| D | strlist.h | 52 struct rb_node *rn = rb_first(&slist->rblist.entries); in strlist__first()
|
| D | intlist.h | 47 struct rb_node *rn = rb_first(&ilist->rblist.entries); in intlist__first()
|
| D | auxtrace.c | 629 auxtrace_index->entries[nr].file_offset = file_offset; in auxtrace_index__auxtrace_event()
630 auxtrace_index->entries[nr].sz = event->header.size; in auxtrace_index__auxtrace_event()
643 ent.file_offset = auxtrace_index->entries[i].file_offset; in auxtrace_index__do_write()
644 ent.sz = auxtrace_index->entries[i].sz; in auxtrace_index__do_write()
688 auxtrace_index->entries[nr].file_offset = in auxtrace_index__process_entry()
690 auxtrace_index->entries[nr].sz = bswap_64(ent.sz); in auxtrace_index__process_entry()
692 auxtrace_index->entries[nr].file_offset = ent.file_offset; in auxtrace_index__process_entry()
693 auxtrace_index->entries[nr].sz = ent.sz; in auxtrace_index__process_entry()
745 ent = &auxtrace_index->entries[i]; in auxtrace_queues__process_index()
|
| /tools/build/feature/ |
| D | test-backtrace.c | 7 size_t entries; in main() local
9 entries = backtrace(backtrace_fns, 10); in main()
10 backtrace_symbols_fd(backtrace_fns, entries, 1); in main()
|
| /tools/lib/lockdep/uinclude/linux/ |
| D | stacktrace.h | 8 unsigned long *entries; member
14 backtrace_symbols_fd((void **)trace->entries, trace->nr_entries, 1); in print_stack_trace()
19 backtrace((void **)(trace)->entries, (trace)->max_entries))
|
| /tools/perf/ui/browsers/ |
| D | scripts.c | 27 struct list_head entries; member
127 INIT_LIST_HEAD(&script.entries); in script_browse()
163 list_add_tail(&sline->node, &script.entries); in script_browse()
181 script.b.entries = &script.entries; in script_browse()
|
| D | map.c | 104 .entries = &map->dso->symbols[map->type], in map__browse()
115 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
|
| D | header.c | 84 .entries = (void *)argv, in ui__list_menu()
|
| /tools/perf/Documentation/ |
| D | itrace.txt | 9 l synthesize last branch entries (use with i or x)
25 Also the number of last branch entries (default 64, max. 1024) for
|
| D | perf-diff.txt | 44 file://filename entries. This option will affect the percentage
50 file://filename entries. This option will affect the percentage
56 file://filename entries. This option will affect the percentage
94 Show period values for both compared hist entries.
105 Determine how to display the overhead percentage of filtered entries.
108 "relative" means it's relative to filtered entries only so that the
109 sum of shown entries will be always 100%. "absolute" means it retains
181 relative to how entries are filtered. Use --percentage=absolute to
|
| D | perf-top.txt | 45 -E <entries>::
46 --entries=<entries>::
188 Do not show entries which have an overhead under that percent.
192 Determine how to display the overhead percentage of filtered entries.
196 "relative" means it's relative to filtered entries only so that the
197 sum of shown entries will be always 100%. "absolute" means it retains
240 Number of entries to display.
|
| D | perf-report.txt | 42 file://filename entries. This option will affect the percentage of
52 file://filename entries. This option will affect the percentage of
57 file://filename entries. This option will affect the percentage of
65 Only display entries resolved to a symbol.
69 Sort histogram entries by given key(s) - multiple keys can be specified
80 entries are displayed as "[other]".
155 Only display entries with parent-match.
190 number of call graph entries in a single hist entry. Note that it needs
323 Do not show entries which have an overhead under that percent.
327 Determine how to display the overhead percentage of filtered entries.
[all …]
|
| /tools/perf/ui/ |
| D | browser.c | 72 } while (pos != browser->entries); in ui_browser__list_head_filter_entries()
85 } while (pos != browser->entries); in ui_browser__list_head_filter_prev_entries()
92 struct list_head *head = browser->entries; in ui_browser__list_head_seek()
127 struct rb_root *root = browser->entries; in ui_browser__rb_tree_seek()
161 browser->top = rb_first(browser->entries); in ui_browser__rb_tree_refresh()
485 struct list_head *head = browser->entries; in ui_browser__list_head_refresh()
488 if (browser->top == NULL || browser->top == browser->entries) in ui_browser__list_head_refresh()
596 browser->top = browser->entries; in ui_browser__argv_seek()
615 browser->top = browser->entries; in ui_browser__argv_refresh()
|