| /tools/perf/util/ |
| D | block-range.c | 19 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug() local
21 assert(old < entry->start); in block_range__debug()
22 assert(entry->start <= entry->end); /* single instruction block; jump to a jump */ in block_range__debug()
24 old = entry->end; in block_range__debug()
33 struct block_range *entry; in block_range__find() local
37 entry = rb_entry(parent, struct block_range, node); in block_range__find()
39 if (addr < entry->start) in block_range__find()
41 else if (addr > entry->end) in block_range__find()
44 return entry; in block_range__find()
81 struct block_range *next, *entry = NULL; in block_range__create() local
[all …]
|
| D | probe-file.c | 389 static void probe_cache_entry__delete(struct probe_cache_entry *entry) in probe_cache_entry__delete() argument
391 if (entry) { in probe_cache_entry__delete()
392 BUG_ON(!list_empty(&entry->node)); in probe_cache_entry__delete()
394 strlist__delete(entry->tevlist); in probe_cache_entry__delete()
395 clear_perf_probe_event(&entry->pev); in probe_cache_entry__delete()
396 zfree(&entry->spev); in probe_cache_entry__delete()
397 free(entry); in probe_cache_entry__delete()
404 struct probe_cache_entry *entry = zalloc(sizeof(*entry)); in probe_cache_entry__new() local
406 if (entry) { in probe_cache_entry__new()
407 INIT_LIST_HEAD(&entry->node); in probe_cache_entry__new()
[all …]
|
| D | hashmap.c | 25 struct hashmap_entry *entry) in hashmap_add_entry() argument
27 entry->next = *pprev; in hashmap_add_entry()
28 *pprev = entry; in hashmap_add_entry()
32 struct hashmap_entry *entry) in hashmap_del_entry() argument
34 *pprev = entry->next; in hashmap_del_entry()
35 entry->next = NULL; in hashmap_del_entry()
133 struct hashmap_entry **entry) in hashmap_find_entry() argument
146 *entry = cur; in hashmap_find_entry()
158 struct hashmap_entry *entry; in hashmap_insert() local
169 hashmap_find_entry(map, key, h, NULL, &entry)) { in hashmap_insert()
[all …]
|
| D | mem2node.c | 18 static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root) in phys_entry__insert() argument
28 if (entry->start < e->start) in phys_entry__insert()
34 rb_link_node(&entry->rb_node, parent, p); in phys_entry__insert()
35 rb_insert_color(&entry->rb_node, root); in phys_entry__insert()
39 phys_entry__init(struct phys_entry *entry, u64 start, u64 bsize, u64 node) in phys_entry__init() argument
41 entry->start = start; in phys_entry__init()
42 entry->end = start + bsize; in phys_entry__init()
43 entry->node = node; in phys_entry__init()
44 RB_CLEAR_NODE(&entry->rb_node); in phys_entry__init()
122 struct phys_entry *entry; in mem2node__node() local
[all …]
|
| 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 | 54 const void *entry, in __rblist__findnew() argument
66 rc = rblist->node_cmp(parent, entry); in __rblist__findnew()
78 new_node = rblist->node_new(rblist, entry); in __rblist__findnew()
90 struct rb_node *rblist__find(struct rblist *rblist, const void *entry) in rblist__find() argument
92 return __rblist__findnew(rblist, entry, false); in rblist__find()
95 struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry) in rblist__findnew() argument
97 return __rblist__findnew(rblist, entry, true); in rblist__findnew()
|
| /tools/perf/ui/browsers/ |
| D | annotate-data.c | 52 struct browser_entry *entry, in get_member_overhead() argument
55 struct annotated_member *member = entry->data; in get_member_overhead()
70 update_hist_entry(&entry->hists[k++], &h->addr[offset]); in get_member_overhead()
83 struct browser_entry *entry; in add_child_entries() local
86 entry = zalloc(sizeof(*entry)); in add_child_entries()
87 if (entry == NULL) in add_child_entries()
90 entry->hists = calloc(browser->nr_events, sizeof(*entry->hists)); in add_child_entries()
91 if (entry->hists == NULL) { in add_child_entries()
92 free(entry); in add_child_entries()
96 entry->data = member; in add_child_entries()
[all …]
|
| /tools/objtool/ |
| D | special.c | 68 static int get_alt_entry(struct elf *elf, const struct special_entry *entry, in get_alt_entry() argument
75 offset = idx * entry->size; in get_alt_entry()
77 alt->group = entry->group; in get_alt_entry()
78 alt->jump_or_nop = entry->jump_or_nop; in get_alt_entry()
82 entry->orig_len); in get_alt_entry()
84 entry->new_len); in get_alt_entry()
87 orig_reloc = find_reloc_by_dest(elf, sec, offset + entry->orig); in get_alt_entry()
89 WARN_FUNC("can't find orig reloc", sec, offset + entry->orig); in get_alt_entry()
95 if (entry->feature) { in get_alt_entry()
101 entry->feature)); in get_alt_entry()
[all …]
|
| D | orc_gen.c | 27 struct orc_list_entry *entry = malloc(sizeof(*entry)); in orc_list_add() local
29 if (!entry) { in orc_list_add()
34 entry->orc = *orc; in orc_list_add()
35 entry->insn_sec = sec; in orc_list_add()
36 entry->insn_off = offset; in orc_list_add()
38 list_add_tail(&entry->list, orc_list); in orc_list_add()
53 struct orc_list_entry *entry; in orc_create() local
139 list_for_each_entry(entry, &orc_list, list) { in orc_create()
141 entry->insn_sec, entry->insn_off, in orc_create()
142 &entry->orc)) in orc_create()
|
| /tools/testing/selftests/kvm/x86_64/ |
| D | hyperv_cpuid.c | 57 const struct kvm_cpuid_entry2 *entry = &hv_cpuid_entries->entries[i]; in test_hv_cpuid() local
59 TEST_ASSERT((entry->function >= 0x40000000) && in test_hv_cpuid()
60 (entry->function <= 0x40000082), in test_hv_cpuid()
62 entry->function); in test_hv_cpuid()
64 TEST_ASSERT(entry->index == 0, in test_hv_cpuid()
67 TEST_ASSERT(entry->flags == 0, in test_hv_cpuid()
70 TEST_ASSERT(!entry->padding[0] && !entry->padding[1] && in test_hv_cpuid()
71 !entry->padding[2], "padding should be zero"); in test_hv_cpuid()
73 switch (entry->function) { in test_hv_cpuid()
77 TEST_ASSERT(entry->eax == test_val, in test_hv_cpuid()
[all …]
|
| /tools/lib/bpf/ |
| D | hashmap.c | 25 struct hashmap_entry *entry) in hashmap_add_entry() argument
27 entry->next = *pprev; in hashmap_add_entry()
28 *pprev = entry; in hashmap_add_entry()
32 struct hashmap_entry *entry) in hashmap_del_entry() argument
34 *pprev = entry->next; in hashmap_del_entry()
35 entry->next = NULL; in hashmap_del_entry()
133 struct hashmap_entry **entry) in hashmap_find_entry() argument
146 *entry = cur; in hashmap_find_entry()
158 struct hashmap_entry *entry; in hashmap_insert() local
169 hashmap_find_entry(map, key, h, NULL, &entry)) { in hashmap_insert()
[all …]
|
| /tools/perf/util/bpf_skel/ |
| D | sample_filter.bpf.c | 75 struct perf_bpf_filter_entry *entry) in perf_get_sample() argument
103 if (entry->term >= PBF_TERM_SAMPLE_START && entry->term <= PBF_TERM_SAMPLE_END && in perf_get_sample()
104 (data->sample_flags & (1 << (entry->term - PBF_TERM_SAMPLE_START))) == 0) in perf_get_sample()
107 switch (entry->term) { in perf_get_sample()
113 if (entry->part) in perf_get_sample()
128 if (entry->part == 1) in perf_get_sample()
130 if (entry->part == 2) in perf_get_sample()
132 if (entry->part == 3) in perf_get_sample()
146 if (entry->part == 1) in perf_get_sample()
148 if (entry->part == 2) in perf_get_sample()
[all …]
|
| /tools/testing/selftests/kvm/lib/s390x/ |
| D | processor.c | 53 uint64_t *entry; in virt_arch_pg_map() local
73 entry = addr_gpa2hva(vm, vm->pgd); in virt_arch_pg_map()
76 if (entry[idx] & REGION_ENTRY_INVALID) in virt_arch_pg_map()
77 entry[idx] = virt_alloc_region(vm, ri); in virt_arch_pg_map()
78 entry = addr_gpa2hva(vm, entry[idx] & REGION_ENTRY_ORIGIN); in virt_arch_pg_map()
83 if (!(entry[idx] & PAGE_INVALID)) in virt_arch_pg_map()
86 entry[idx] = gpa; in virt_arch_pg_map()
92 uint64_t *entry; in addr_arch_gva2gpa() local
97 entry = addr_gpa2hva(vm, vm->pgd); in addr_arch_gva2gpa()
100 TEST_ASSERT(!(entry[idx] & REGION_ENTRY_INVALID), in addr_arch_gva2gpa()
[all …]
|
| /tools/usb/ |
| D | testusb.c | 243 struct testdev *entry; in find_testdev() local
261 entry = calloc(1, sizeof *entry); in find_testdev()
262 if (!entry) in find_testdev()
265 entry->name = strdup(name); in find_testdev()
266 if (!entry->name) { in find_testdev()
267 free(entry); in find_testdev()
273 entry->ifnum = ifnum; in find_testdev()
274 entry->next = testdevs; in find_testdev()
275 testdevs = entry; in find_testdev()
375 struct testdev *entry; in main() local
[all …]
|
| /tools/lib/api/fs/ |
| D | fs.h | 52 int procfs__read_str(const char *entry, char **buf, size_t *sizep);
55 int sysfs__read_int(const char *entry, int *value);
56 int sysfs__read_ull(const char *entry, unsigned long long *value);
57 int sysfs__read_xll(const char *entry, unsigned long long *value);
58 int sysfs__read_str(const char *entry, char **buf, size_t *sizep);
59 int sysfs__read_bool(const char *entry, bool *value);
61 int sysfs__write_int(const char *entry, int value);
|
| D | fs.c | 385 int procfs__read_str(const char *entry, char **buf, size_t *sizep) in procfs__read_str() argument
393 snprintf(path, sizeof(path), "%s/%s", procfs, entry); in procfs__read_str()
398 static int sysfs__read_ull_base(const char *entry, in sysfs__read_ull_base() argument
407 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_ull_base()
412 int sysfs__read_xll(const char *entry, unsigned long long *value) in sysfs__read_xll() argument
414 return sysfs__read_ull_base(entry, value, 16); in sysfs__read_xll()
417 int sysfs__read_ull(const char *entry, unsigned long long *value) in sysfs__read_ull() argument
419 return sysfs__read_ull_base(entry, value, 0); in sysfs__read_ull()
422 int sysfs__read_int(const char *entry, int *value) in sysfs__read_int() argument
430 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_int()
[all …]
|
| /tools/testing/selftests/bpf/prog_tests/ |
| D | hashmap.c | 46 struct hashmap_entry *entry, *tmp; in test_hashmap_generic() local
92 hashmap__for_each_entry(map, entry, bkt) { in test_hashmap_generic()
93 long k = entry->key; in test_hashmap_generic()
94 long v = entry->value; in test_hashmap_generic()
140 hashmap__for_each_entry_safe(map, entry, tmp, bkt) { in test_hashmap_generic()
141 long k = entry->key; in test_hashmap_generic()
142 long v = entry->value; in test_hashmap_generic()
154 hashmap__for_each_key_entry(map, entry, 0) { in test_hashmap_generic()
163 hashmap__for_each_key_entry_safe(map, entry, tmp, 0) { in test_hashmap_generic()
167 k = entry->key; in test_hashmap_generic()
[all …]
|
| /tools/testing/selftests/mm/ |
| D | compaction_test.c | 209 struct map_list *list = NULL, *entry; in main() local
246 entry = malloc(sizeof(struct map_list)); in main()
247 if (!entry) { in main()
251 entry->map = map; in main()
252 entry->next = list; in main()
253 list = entry; in main()
264 for (entry = list; entry != NULL; entry = entry->next) { in main()
265 munmap(entry->map, MAP_SIZE); in main()
266 if (!entry->next) in main()
268 entry = entry->next; in main()
|
| /tools/lib/api/ |
| D | cpu.c | 9 char entry[PATH_MAX]; in cpu__get_max_freq() local
15 snprintf(entry, sizeof(entry), in cpu__get_max_freq()
18 return sysfs__read_ull(entry, freq); in cpu__get_max_freq()
|
| /tools/usb/usbip/libsrc/ |
| D | list.h | 80 static inline void __list_del_entry(struct list_head *entry) in __list_del_entry() argument
82 __list_del(entry->prev, entry->next); in __list_del_entry()
91 static inline void list_del(struct list_head *entry) in list_del() argument
93 __list_del(entry->prev, entry->next); in list_del()
94 entry->next = LIST_POISON1; in list_del()
95 entry->prev = LIST_POISON2; in list_del()
|
| /tools/testing/selftests/kvm/ |
| D | coalesced_io_test.c | 128 struct kvm_coalesced_mmio *entry = &ring->coalesced_mmio[idx]; in vcpu_run_and_verify_coalesced_io() local
132 TEST_ASSERT(entry->phys_addr == io->pio_port && in vcpu_run_and_verify_coalesced_io()
133 entry->len == 4 && entry->pio && in vcpu_run_and_verify_coalesced_io()
134 *(uint32_t *)entry->data == io->pio_port + i, in vcpu_run_and_verify_coalesced_io()
137 entry->len, entry->pio ? "PIO" : "MMIO", in vcpu_run_and_verify_coalesced_io()
138 entry->phys_addr, *(uint32_t *)entry->data); in vcpu_run_and_verify_coalesced_io()
141 TEST_ASSERT(entry->phys_addr == io->mmio_gpa && in vcpu_run_and_verify_coalesced_io()
142 entry->len == 8 && !entry->pio, in vcpu_run_and_verify_coalesced_io()
145 entry->len, entry->pio ? "PIO" : "MMIO", in vcpu_run_and_verify_coalesced_io()
146 entry->phys_addr, *(uint64_t *)entry->data); in vcpu_run_and_verify_coalesced_io()
|
| /tools/bpf/bpftool/ |
| D | pids.c | 33 struct hashmap_entry *entry; in add_ref() local
39 hashmap__for_each_key_entry(map, entry, e->id) { in add_ref()
40 refs = entry->pvalue; in add_ref()
184 struct hashmap_entry *entry; in delete_obj_refs_table() local
190 hashmap__for_each_entry(map, entry, bkt) { in delete_obj_refs_table()
191 struct obj_refs *refs = entry->pvalue; in delete_obj_refs_table()
203 struct hashmap_entry *entry; in emit_obj_refs_json() local
208 hashmap__for_each_key_entry(map, entry, id) { in emit_obj_refs_json()
209 struct obj_refs *refs = entry->pvalue; in emit_obj_refs_json()
235 struct hashmap_entry *entry; in emit_obj_refs_plain() local
[all …]
|
| /tools/testing/selftests/powerpc/primitives/ |
| D | load_unaligned_zeropad.c | 74 struct extbl_entry *entry = (struct extbl_entry *)__start___ex_table; in segv_handler() local
76 while (entry < (struct extbl_entry *)__stop___ex_table) { in segv_handler()
79 insn = (unsigned long)&entry->insn + entry->insn; in segv_handler()
80 fixup = (unsigned long)&entry->fixup + entry->fixup; in segv_handler()
|
| /tools/testing/selftests/drivers/net/ |
| D | stats.py | 90 for entry in stats:
91 ifindexes[entry['ifindex']] = [entry, None, None]
94 entry = netfam.qstats_get({"ifindex": ifindex}, dump=True)
95 ksft_eq(len(entry), 1)
96 ifindexes[entry[0]['ifindex']][1] = entry[0]
99 for entry in stats:
100 ifindexes[entry['ifindex']][2] = entry
|
| /tools/testing/selftests/ptrace/ |
| D | get_syscall_info.c | 118 (void *) &info.entry - (void *) &info; in TEST()
120 (void *) &info.entry.args[6] - (void *) &info; in TEST()
203 ASSERT_EQ(exp_args[0], info.entry.nr) { in TEST()
206 ASSERT_EQ(exp_args[1], info.entry.args[0]) { in TEST()
209 ASSERT_EQ(exp_args[2], info.entry.args[1]) { in TEST()
212 ASSERT_EQ(exp_args[3], info.entry.args[2]) { in TEST()
215 ASSERT_EQ(exp_args[4], info.entry.args[3]) { in TEST()
218 ASSERT_EQ(exp_args[5], info.entry.args[4]) { in TEST()
221 ASSERT_EQ(exp_args[6], info.entry.args[5]) { in TEST()
|