| /tools/testing/selftests/vm/ |
| D | compaction_test.c | 158 struct map_list *list, *entry; in main() local
196 entry = malloc(sizeof(struct map_list)); in main()
197 if (!entry) { in main()
201 entry->map = map; in main()
202 entry->next = list; in main()
203 list = entry; in main()
214 for (entry = list; entry != NULL; entry = entry->next) { in main()
215 munmap(entry->map, MAP_SIZE); in main()
216 if (!entry->next) in main()
218 entry = entry->next; in main()
|
| /tools/usb/ |
| D | testusb.c | 250 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()
281 entry->next = testdevs; in find_testdev()
282 testdevs = entry; in find_testdev()
382 struct testdev *entry; in main() local
[all …]
|
| /tools/lib/api/ |
| D | cpu.c | 8 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/ |
| D | list.h | 85 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/perf/util/ |
| D | strlist.c | 15 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 …]
|
| D | rblist.c | 52 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()
|
| D | rblist.h | 25 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);
|
| D | strlist.h | 32 struct str_node *strlist__find(struct strlist *slist, const char *entry);
34 static inline bool strlist__has_entry(struct strlist *slist, const char *entry) in strlist__has_entry() argument
36 return strlist__find(slist, entry) != NULL; in strlist__has_entry()
|
| D | intlist.c | 15 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()
|
| D | auxtrace.c | 1326 struct auxtrace_cache_entry *entry; in auxtrace_cache__drop() local
1334 hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) { in auxtrace_cache__drop()
1335 hlist_del(&entry->hash); in auxtrace_cache__drop()
1336 auxtrace_cache__free_entry(c, entry); in auxtrace_cache__drop()
1359 void *entry) in auxtrace_cache__free_entry() argument
1361 free(entry); in auxtrace_cache__free_entry()
1365 struct auxtrace_cache_entry *entry) in auxtrace_cache__add() argument
1370 entry->key = key; in auxtrace_cache__add()
1371 hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]); in auxtrace_cache__add()
1378 struct auxtrace_cache_entry *entry; in auxtrace_cache__lookup() local
[all …]
|
| D | unwind.h | 15 typedef int (*unwind_entry_cb_t)(struct unwind_entry *entry, void *arg);
|
| D | dwarf-aux.c | 1039 Dwarf_Addr entry; in die_get_var_innermost_scope() local
1044 ret = die_entrypc(sp_die, &entry); in die_get_var_innermost_scope()
1062 start -= entry; in die_get_var_innermost_scope()
1063 end -= entry; in die_get_var_innermost_scope()
1097 Dwarf_Addr entry; in die_get_var_range() local
1105 ret = die_entrypc(sp_die, &entry); in die_get_var_range()
1126 start -= entry; in die_get_var_range()
1127 end -= entry; in die_get_var_range()
|
| D | sort.c | 1301 struct sort_entry *entry; member
1305 #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
1324 #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }
1339 #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }
1490 hse->se = sd->entry; in __sort_dimension__alloc_hpp()
1491 hse->hpp.name = sd->entry->se_header; in __sort_dimension__alloc_hpp()
1494 hse->hpp.entry = __sort__hpp_entry; in __sort_dimension__alloc_hpp()
1545 if (sd->entry->se_collapse) in __sort_dimension__add()
1601 if (sd->entry == &sort_parent) { in sort_dimension__add()
1611 } else if (sd->entry == &sort_sym) { in sort_dimension__add()
[all …]
|
| /tools/perf/tests/ |
| D | dwarf-unwind.c | 40 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()
62 entry->ip); in unwind_entry()
66 pr_debug("got: %s 0x%" PRIx64 "\n", symbol, entry->ip); in unwind_entry()
|
| /tools/lib/api/fs/ |
| D | fs.h | 31 int sysfs__read_int(const char *entry, int *value);
32 int sysfs__read_ull(const char *entry, unsigned long long *value);
|
| D | fs.c | 305 int sysfs__read_ull(const char *entry, unsigned long long *value) in sysfs__read_ull() argument
313 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_ull()
318 int sysfs__read_int(const char *entry, int *value) in sysfs__read_int() argument
326 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_int()
|
| /tools/testing/selftests/powerpc/pmu/ebb/ |
| D | ebb.c | 135 u64 entry; in setup_ebb_handler() local
138 entry = (u64)ebb_handler; in setup_ebb_handler()
142 u64 entry; in setup_ebb_handler() member
147 entry = opd->entry; in setup_ebb_handler()
149 printf("EBB Handler is at %#llx\n", entry); in setup_ebb_handler()
155 mtspr(SPRN_EBBHR, entry); in setup_ebb_handler()
|
| /tools/perf/ui/browsers/ |
| D | header.c | 12 void *entry, int row) in ui_browser__argv_write() argument
14 char **arg = entry; in ui_browser__argv_write()
|
| D | scripts.c | 76 void *entry, int row) in script_browser__write() argument
78 struct script_line *sline = list_entry(entry, struct script_line, node); in script_browser__write()
|
| D | hists.c | 756 struct hist_entry *entry, in hist_browser__show_entry() argument
764 off_t row_offset = entry->row_offset; in hist_browser__show_entry()
769 browser->he_selection = entry; in hist_browser__show_entry()
770 browser->selection = &entry->ms; in hist_browser__show_entry()
774 hist_entry__init_have_children(entry); in hist_browser__show_entry()
775 folded_sign = hist_entry__folded(entry); in hist_browser__show_entry()
817 width -= fmt->color(fmt, &hpp, entry); in hist_browser__show_entry()
819 width -= fmt->entry(fmt, &hpp, entry); in hist_browser__show_entry()
836 u64 total = hists__total_period(entry->hists); in hist_browser__show_entry()
844 total = entry->stat_acc->period; in hist_browser__show_entry()
[all …]
|
| /tools/perf/Documentation/ |
| D | perf-diff.txt | 120 baseline entry, are displayed with empty space within baseline column
174 - A/B being matching hist entry from data/baseline file specified
177 - period_percent being the % of the hist entry period value within
191 - A/B being matching hist entry from data/baseline file specified
194 - period being the hist entry period value
202 - A/B being matching hist entry from data/baseline file specified
205 - period being the hist entry period value
|
| /tools/testing/selftests/networking/timestamping/ |
| D | txtimestamp.c | 235 struct iovec entry; in recv_errmsg() local
244 memset(&entry, 0, sizeof(entry)); in recv_errmsg()
247 entry.iov_base = data; in recv_errmsg()
248 entry.iov_len = cfg_payload_len; in recv_errmsg()
249 msg.msg_iov = &entry; in recv_errmsg()
|
| D | timestamping.c | 283 struct iovec entry; in recvpacket() local
292 msg.msg_iov = &entry; in recvpacket()
294 entry.iov_base = data; in recvpacket()
295 entry.iov_len = sizeof(data); in recvpacket()
|
| /tools/perf/ui/ |
| D | browser.h | 24 void (*write)(struct ui_browser *browser, void *entry, int row);
26 bool (*filter)(struct ui_browser *browser, void *entry);
|
| /tools/perf/ui/tui/ |
| D | util.c | 17 void *entry, int row) in ui_browser__argv_write() argument
19 char **arg = entry; in ui_browser__argv_write()
|