Home
last modified time | relevance | path

Searched refs:entry (Results 1 – 25 of 73) sorted by relevance

123

/tools/perf/util/
Dblock-range.c20 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug() local
22 assert(old < entry->start); in block_range__debug()
23 assert(entry->start <= entry->end); /* single instruction block; jump to a jump */ in block_range__debug()
25 old = entry->end; in block_range__debug()
34 struct block_range *entry; in block_range__find() local
38 entry = rb_entry(parent, struct block_range, node); in block_range__find()
40 if (addr < entry->start) in block_range__find()
42 else if (addr > entry->end) in block_range__find()
45 return entry; in block_range__find()
82 struct block_range *next, *entry = NULL; in block_range__create() local
[all …]
Dprobe-file.c346 static void probe_cache_entry__delete(struct probe_cache_entry *entry) in probe_cache_entry__delete() argument
348 if (entry) { in probe_cache_entry__delete()
349 BUG_ON(!list_empty(&entry->node)); in probe_cache_entry__delete()
351 strlist__delete(entry->tevlist); in probe_cache_entry__delete()
352 clear_perf_probe_event(&entry->pev); in probe_cache_entry__delete()
353 zfree(&entry->spev); in probe_cache_entry__delete()
354 free(entry); in probe_cache_entry__delete()
361 struct probe_cache_entry *entry = zalloc(sizeof(*entry)); in probe_cache_entry__new() local
363 if (entry) { in probe_cache_entry__new()
364 INIT_LIST_HEAD(&entry->node); in probe_cache_entry__new()
[all …]
Dstrlist.c15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) in strlist__node_new() argument
17 const char *s = entry; in strlist__node_new()
55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) in strlist__node_cmp() argument
57 const char *str = entry; in strlist__node_cmp()
70 char entry[1024]; in strlist__load() local
77 while (fgets(entry, sizeof(entry), fp) != NULL) { in strlist__load()
78 const size_t len = strlen(entry); in strlist__load()
82 entry[len - 1] = '\0'; in strlist__load()
84 err = strlist__add(slist, entry); in strlist__load()
100 struct str_node *strlist__find(struct strlist *slist, const char *entry) in strlist__find() argument
[all …]
Drblist.c52 const void *entry, in __rblist__findnew() argument
63 rc = rblist->node_cmp(parent, entry); in __rblist__findnew()
73 new_node = rblist->node_new(rblist, entry); in __rblist__findnew()
84 struct rb_node *rblist__find(struct rblist *rblist, const void *entry) in rblist__find() argument
86 return __rblist__findnew(rblist, entry, false); in rblist__find()
89 struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry) in rblist__findnew() argument
91 return __rblist__findnew(rblist, entry, true); in rblist__findnew()
Drblist.h25 int (*node_cmp)(struct rb_node *rbn, const void *entry);
34 struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
35 struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry);
Dprobe-file.h33 #define for_each_probe_cache_entry(entry, pcache) \ argument
34 list_for_each_entry(entry, &pcache->entries, node)
48 int probe_cache_entry__get_event(struct probe_cache_entry *entry,
Dstrlist.h39 struct str_node *strlist__find(struct strlist *slist, const char *entry);
41 static inline bool strlist__has_entry(struct strlist *slist, const char *entry) in strlist__has_entry() argument
43 return strlist__find(slist, entry) != NULL; in strlist__has_entry()
Dintlist.c15 const void *entry) in intlist__node_new() argument
17 int i = (int)((long)entry); in intlist__node_new()
43 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) in intlist__node_cmp() argument
45 int i = (int)((long)entry); in intlist__node_cmp()
/tools/objtool/
Dspecial.c81 static int get_alt_entry(struct elf *elf, struct special_entry *entry, in get_alt_entry() argument
88 offset = idx * entry->size; in get_alt_entry()
90 alt->group = entry->group; in get_alt_entry()
91 alt->jump_or_nop = entry->jump_or_nop; in get_alt_entry()
95 entry->orig_len); in get_alt_entry()
97 entry->new_len); in get_alt_entry()
100 if (entry->feature) { in get_alt_entry()
104 entry->feature); in get_alt_entry()
115 orig_rela = find_rela_by_dest(sec, offset + entry->orig); in get_alt_entry()
117 WARN_FUNC("can't find orig rela", sec, offset + entry->orig); in get_alt_entry()
[all …]
/tools/usb/
Dtestusb.c250 struct testdev *entry; in find_testdev() local
268 entry = calloc(1, sizeof *entry); in find_testdev()
269 if (!entry) in find_testdev()
272 entry->name = strdup(name); in find_testdev()
273 if (!entry->name) { in find_testdev()
274 free(entry); in find_testdev()
280 entry->ifnum = ifnum; in find_testdev()
285 speed(entry->speed), entry->name, entry->ifnum); in find_testdev()
287 entry->next = testdevs; in find_testdev()
288 testdevs = entry; in find_testdev()
[all …]
/tools/testing/selftests/vm/
Dcompaction_test.c160 struct map_list *list, *entry; in main() local
198 entry = malloc(sizeof(struct map_list)); in main()
199 if (!entry) { in main()
203 entry->map = map; in main()
204 entry->next = list; in main()
205 list = entry; in main()
216 for (entry = list; entry != NULL; entry = entry->next) { in main()
217 munmap(entry->map, MAP_SIZE); in main()
218 if (!entry->next) in main()
220 entry = entry->next; in main()
/tools/lib/api/
Dcpu.c8 char entry[PATH_MAX]; in cpu__get_max_freq() local
14 snprintf(entry, sizeof(entry), in cpu__get_max_freq()
17 return sysfs__read_ull(entry, freq); in cpu__get_max_freq()
/tools/usb/usbip/libsrc/
Dlist.h85 static inline void __list_del_entry(struct list_head *entry) in __list_del_entry() argument
87 __list_del(entry->prev, entry->next); in __list_del_entry()
90 static inline void list_del(struct list_head *entry) in list_del() argument
92 __list_del(entry->prev, entry->next); in list_del()
93 entry->next = LIST_POISON1; in list_del()
94 entry->prev = LIST_POISON2; in list_del()
/tools/testing/radix-tree/
Diteration_check.c58 void *entry; in tagged_iteration_fn() local
65 entry = radix_tree_deref_slot(slot); in tagged_iteration_fn()
66 if (unlikely(!entry)) in tagged_iteration_fn()
69 if (radix_tree_deref_retry(entry)) { in tagged_iteration_fn()
98 void *entry; in untagged_iteration_fn() local
105 entry = radix_tree_deref_slot(slot); in untagged_iteration_fn()
106 if (unlikely(!entry)) in untagged_iteration_fn()
109 if (radix_tree_deref_retry(entry)) { in untagged_iteration_fn()
/tools/lib/api/fs/
Dfs.h33 int procfs__read_str(const char *entry, char **buf, size_t *sizep);
36 int sysfs__read_int(const char *entry, int *value);
37 int sysfs__read_ull(const char *entry, unsigned long long *value);
38 int sysfs__read_str(const char *entry, char **buf, size_t *sizep);
Dfs.c374 int procfs__read_str(const char *entry, char **buf, size_t *sizep) in procfs__read_str() argument
382 snprintf(path, sizeof(path), "%s/%s", procfs, entry); in procfs__read_str()
387 int sysfs__read_ull(const char *entry, unsigned long long *value) in sysfs__read_ull() argument
395 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_ull()
400 int sysfs__read_int(const char *entry, int *value) in sysfs__read_int() argument
408 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_int()
413 int sysfs__read_str(const char *entry, char **buf, size_t *sizep) in sysfs__read_str() argument
421 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_str()
/tools/perf/scripts/python/
Dstackcollapse.py96 for entry in param_dict['callchain']:
97 entry.setdefault('sym', dict())
98 entry['sym'].setdefault('name', None)
99 entry.setdefault('dso', None)
100 stack.append(tidy_function_name(entry['sym']['name'],
101 entry['dso']))
/tools/perf/arch/x86/entry/syscalls/
Dsyscalltbl.sh15 entry="$2"
17 syscall_macro "$nr" "$entry"
26 while read nr abi name entry compat; do
/tools/include/linux/
Dlist.h99 static inline void __list_del_entry(struct list_head *entry) in __list_del_entry() argument
101 __list_del(entry->prev, entry->next); in __list_del_entry()
104 static inline void list_del(struct list_head *entry) in list_del() argument
106 __list_del(entry->prev, entry->next); in list_del()
107 entry->next = LIST_POISON1; in list_del()
108 entry->prev = LIST_POISON2; in list_del()
111 extern void __list_del_entry(struct list_head *entry);
112 extern void list_del(struct list_head *entry);
142 static inline void list_del_init(struct list_head *entry) in list_del_init() argument
144 __list_del_entry(entry); in list_del_init()
[all …]
/tools/perf/
Dbuiltin-annotate.c81 struct block_range *entry; in process_basic_block() local
96 entry = block_range_iter(&iter); in process_basic_block()
97 assert(entry->is_target); in process_basic_block()
98 entry->entry++; in process_basic_block()
101 entry = block_range_iter(&iter); in process_basic_block()
103 entry->coverage++; in process_basic_block()
104 entry->sym = sym; in process_basic_block()
107 notes->max_coverage = max(notes->max_coverage, entry->coverage); in process_basic_block()
114 entry = block_range_iter(&iter); in process_basic_block()
115 assert(entry->is_branch); in process_basic_block()
[all …]
/tools/perf/arch/x86/
DMakefile14 sys := $(srctree)/tools/perf/arch/x86/entry/syscalls
22 …(diff -B arch/x86/entry/syscalls/syscall_64.tbl ../../arch/x86/entry/syscalls/syscall_64.tbl >/dev…
/tools/perf/tests/
Ddwarf-unwind.c40 static int unwind_entry(struct unwind_entry *entry, void *arg) in unwind_entry() argument
43 char *symbol = entry->sym ? entry->sym->name : NULL; in unwind_entry()
68 entry->ip); in unwind_entry()
74 symbol, entry->ip, funcs[idx]); in unwind_entry()
/tools/testing/selftests/powerpc/pmu/ebb/
Debb.c133 u64 entry; in setup_ebb_handler() local
136 entry = (u64)ebb_handler; in setup_ebb_handler()
140 u64 entry; in setup_ebb_handler() member
145 entry = opd->entry; in setup_ebb_handler()
147 printf("EBB Handler is at %#llx\n", entry); in setup_ebb_handler()
153 mtspr(SPRN_EBBHR, entry); in setup_ebb_handler()
/tools/perf/ui/browsers/
Dhists.c1040 struct hist_entry *entry, int level, in hist_browser__show_callchain() argument
1046 u64 total = hists__total_period(entry->hists); in hist_browser__show_callchain()
1051 parent_total = entry->stat_acc->period; in hist_browser__show_callchain()
1053 parent_total = entry->stat.period; in hist_browser__show_callchain()
1057 &entry->sorted_chain, row, in hist_browser__show_callchain()
1062 &entry->sorted_chain, row, in hist_browser__show_callchain()
1067 &entry->sorted_chain, level, row, in hist_browser__show_callchain()
1073 browser->he_selection = entry; in hist_browser__show_callchain()
1170 struct hist_entry *entry, in hist_browser__show_entry() argument
1177 off_t row_offset = entry->row_offset; in hist_browser__show_entry()
[all …]
Dheader.c12 void *entry, int row) in ui_browser__argv_write() argument
14 char **arg = entry; in ui_browser__argv_write()

123