| /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()
97 if (fda->entries[fd].revents & revents) { in fdarray__filter()
105 fda->entries[nr] = fda->entries[fd]; in fdarray__filter()
[all …]
|
| /tools/perf/tests/ |
| D | fdarray.c | 14 fda->entries[fd].fd = fda->nr - fd; in fdarray__init_revents()
15 fda->entries[fd].revents = revents; in fdarray__init_revents()
57 fda->entries[2].revents = POLLIN; in test__fdarray__filter()
58 expected_fd[0] = fda->entries[2].fd; in test__fdarray__filter()
69 if (fda->entries[0].fd != expected_fd[0]) { in test__fdarray__filter()
71 fda->entries[0].fd, expected_fd[0]); in test__fdarray__filter()
76 fda->entries[0].revents = POLLIN; in test__fdarray__filter()
77 expected_fd[0] = fda->entries[0].fd; in test__fdarray__filter()
78 fda->entries[3].revents = POLLIN; in test__fdarray__filter()
79 expected_fd[1] = fda->entries[3].fd; in test__fdarray__filter()
[all …]
|
| /tools/perf/util/ |
| D | pstack.c | 17 void *entries[0]; member
44 if (pstack->entries[i] == key) { in pstack__remove()
46 memmove(pstack->entries + i, in pstack__remove()
47 pstack->entries + i + 1, in pstack__remove()
62 pstack->entries[pstack->top++] = key; in pstack__push()
74 ret = pstack->entries[--pstack->top]; in pstack__pop()
75 pstack->entries[pstack->top] = NULL; in pstack__pop()
83 return pstack->entries[pstack->top - 1]; in pstack__peek()
|
| D | rb_resort.h | 72 struct rb_root entries; \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
92 struct rb_root *entries) \
96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
109 sorted->entries = RB_ROOT; \
110 __name##_sorted__sort(sorted, entries); \
128 for (__nd = rb_first(&__name->entries); \
143 DECLARE_RESORT_RB(__name)(&__ilist->rblist.entries, \
|
| D | syscalltbl.c | 54 struct syscall *entries; in syscalltbl__init_native() local
60 entries = tbl->syscalls.entries = malloc(sizeof(struct syscall) * nr_entries); in syscalltbl__init_native()
61 if (tbl->syscalls.entries == NULL) in syscalltbl__init_native()
66 entries[j].name = syscalltbl_native[i]; in syscalltbl__init_native()
67 entries[j].id = i; in syscalltbl__init_native()
72 qsort(tbl->syscalls.entries, nr_entries, sizeof(struct syscall), syscallcmp); in syscalltbl__init_native()
91 zfree(&tbl->syscalls.entries); in syscalltbl__delete()
102 struct syscall *sc = bsearch(name, tbl->syscalls.entries, in syscalltbl__id()
112 struct syscall *syscalls = tbl->syscalls.entries; in syscalltbl__strglobmatch_next()
|
| 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 | 15 xy->entries = xlen * ylen; in xyarray__new()
25 size_t n = xy->entries * xy->entry_size; in xyarray__reset()
|
| D | evlist.h | 77 struct list_head entries; member
271 return list_empty(&evlist->entries); in perf_evlist__empty()
276 return list_entry(evlist->entries.next, struct perf_evsel, node); in perf_evlist__first()
281 return list_entry(evlist->entries.prev, struct perf_evsel, node); in perf_evlist__last()
326 __evlist__for_each_entry(&(evlist)->entries, evsel)
342 __evlist__for_each_entry_continue(&(evlist)->entries, evsel)
358 __evlist__for_each_entry_reverse(&(evlist)->entries, evsel)
376 __evlist__for_each_entry_safe(&(evlist)->entries, tmp, evsel)
|
| D | probe-file.h | 21 struct list_head entries; member
36 list_for_each_entry(entry, &pcache->entries, node)
|
| D | unwind-libdw.h | 23 struct unwind_entry entries[]; member
|
| D | syscalltbl.h | 10 void *entries; member
|
| D | unwind-libdw.c | 73 struct unwind_entry *e = &ui->entries[ui->idx++]; in entry()
221 ui = zalloc(sizeof(ui_buf) + sizeof(ui_buf.entries[0]) * max_stack); in unwind__get_entries()
256 err = ui->entries[j].ip ? ui->cb(&ui->entries[j], ui->arg) : 0; in unwind__get_entries()
|
| D | xyarray.h | 11 size_t entries; member
|
| /tools/perf/trace/beauty/ |
| D | ioctl.c | 41 if (nr < strarray__ioctl_tty_cmd.nr_entries && strarray__ioctl_tty_cmd.entries[nr] != NULL) in ioctl__scnprintf_tty_cmd()
42 return scnprintf(bf, size, "%s", strarray__ioctl_tty_cmd.entries[nr]); in ioctl__scnprintf_tty_cmd()
52 if (nr < strarray__drm_ioctl_cmds.nr_entries && strarray__drm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_drm_cmd()
53 return scnprintf(bf, size, "DRM_%s", strarray__drm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_drm_cmd()
63 …if (nr < strarray__sndrv_pcm_ioctl_cmds.nr_entries && strarray__sndrv_pcm_ioctl_cmds.entries[nr] !… in ioctl__scnprintf_sndrv_pcm_cmd()
64 return scnprintf(bf, size, "SNDRV_PCM_%s", strarray__sndrv_pcm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_pcm_cmd()
74 …if (nr < strarray__sndrv_ctl_ioctl_cmds.nr_entries && strarray__sndrv_ctl_ioctl_cmds.entries[nr] !… in ioctl__scnprintf_sndrv_ctl_cmd()
75 return scnprintf(bf, size, "SNDRV_CTL_%s", strarray__sndrv_ctl_ioctl_cmds.entries[nr]); in ioctl__scnprintf_sndrv_ctl_cmd()
85 if (nr < strarray__kvm_ioctl_cmds.nr_entries && strarray__kvm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_kvm_cmd()
86 return scnprintf(bf, size, "KVM_%s", strarray__kvm_ioctl_cmds.entries[nr]); in ioctl__scnprintf_kvm_cmd()
[all …]
|
| D | pkey_alloc.c | 21 const char *s = strarray__pkey_alloc_access_rights.entries[0]; in pkey_alloc__scnprintf_access_rights()
36 if (strarray__pkey_alloc_access_rights.entries[i] != NULL) in pkey_alloc__scnprintf_access_rights()
37 …ed += scnprintf(bf + printed, size - printed, "%s", strarray__pkey_alloc_access_rights.entries[i]); in pkey_alloc__scnprintf_access_rights()
|
| D | beauty.h | 11 const char **entries; member
16 .entries = array, \
22 .entries = array, \
|
| /tools/build/feature/ |
| D | test-backtrace.c | 8 size_t entries; in main() local
10 entries = backtrace(backtrace_fns, 10); in main()
11 backtrace_symbols_fd(backtrace_fns, entries, 1); in main()
|
| /tools/include/linux/ |
| D | stacktrace.h | 9 unsigned long *entries; member
15 backtrace_symbols_fd((void **)trace->entries, trace->nr_entries, 1); in print_stack_trace()
20 backtrace((void **)(trace)->entries, (trace)->max_entries))
|
| /tools/testing/selftests/x86/ |
| D | mpx-hw.h | 67 struct mpx_bd_entry entries[MPX_BOUNDS_DIR_NR_ENTRIES]; member
71 struct mpx_bt_entry entries[MPX_BOUNDS_TABLE_NR_ENTRIES]; member
97 return &bounds_dir->entries[index]; in mpx_vaddr_to_bd_entry()
121 return &bt->entries[index]; in mpx_vaddr_to_bt_entry()
|
| /tools/perf/ui/browsers/ |
| D | scripts.c | 28 struct list_head entries; member
128 INIT_LIST_HEAD(&script.entries); in script_browse()
164 list_add_tail(&sline->node, &script.entries); in script_browse()
182 script.b.entries = &script.entries; in script_browse()
|
| /tools/perf/Documentation/ |
| D | itrace.txt | 11 l synthesize last branch entries (use with i or x)
28 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
99 Show period values for both compared hist entries.
114 Determine how to display the overhead percentage of filtered entries.
117 "relative" means it's relative to filtered entries only so that the
118 sum of shown entries will be always 100%. "absolute" means it retains
190 relative to how entries are filtered. Use --percentage=absolute to
|
| D | perf-top.txt | 45 -E <entries>::
46 --entries=<entries>::
189 Do not show entries which have an overhead under that percent.
193 Determine how to display the overhead percentage of filtered entries.
197 "relative" means it's relative to filtered entries only so that the
198 sum of shown entries will be always 100%. "absolute" means it retains
251 Number of entries to display.
|
| /tools/perf/ |
| D | builtin-script.c | 581 from = br->entries[i].from; in print_sample_brstack()
582 to = br->entries[i].to; in print_sample_brstack()
606 mispred_str( br->entries + i), in print_sample_brstack()
607 br->entries[i].flags.in_tx? 'X' : '-', in print_sample_brstack()
608 br->entries[i].flags.abort? 'A' : '-', in print_sample_brstack()
609 br->entries[i].flags.cycles); in print_sample_brstack()
628 from = br->entries[i].from; in print_sample_brstacksym()
629 to = br->entries[i].to; in print_sample_brstacksym()
653 mispred_str( br->entries + i), in print_sample_brstacksym()
654 br->entries[i].flags.in_tx? 'X' : '-', in print_sample_brstacksym()
[all …]
|
| /tools/perf/ui/ |
| D | browser.c | 76 } while (pos != browser->entries); in ui_browser__list_head_filter_entries()
89 } while (pos != browser->entries); in ui_browser__list_head_filter_prev_entries()
96 struct list_head *head = browser->entries; in ui_browser__list_head_seek()
131 struct rb_root *root = browser->entries; in ui_browser__rb_tree_seek()
165 browser->top = rb_first(browser->entries); in ui_browser__rb_tree_refresh()
489 struct list_head *head = browser->entries; in ui_browser__list_head_refresh()
492 if (browser->top == NULL || browser->top == browser->entries) in ui_browser__list_head_refresh()
600 browser->top = browser->entries; in ui_browser__argv_seek()
619 browser->top = browser->entries; in ui_browser__argv_refresh()
|