| /tools/perf/util/ |
| D | block-range.c | 23 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug() local
25 assert(old < entry->start); in block_range__debug()
26 assert(entry->start <= entry->end); /* single instruction block; jump to a jump */ in block_range__debug()
28 old = entry->end; in block_range__debug()
37 struct block_range *entry; in block_range__find() local
41 entry = rb_entry(parent, struct block_range, node); in block_range__find()
43 if (addr < entry->start) in block_range__find()
45 else if (addr > entry->end) in block_range__find()
48 return entry; in block_range__find()
85 struct block_range *next, *entry = NULL; in block_range__create() local
[all …]
|
| D | probe-file.c | 354 static void probe_cache_entry__delete(struct probe_cache_entry *entry) in probe_cache_entry__delete() argument
356 if (entry) { in probe_cache_entry__delete()
357 BUG_ON(!list_empty(&entry->node)); in probe_cache_entry__delete()
359 strlist__delete(entry->tevlist); in probe_cache_entry__delete()
360 clear_perf_probe_event(&entry->pev); in probe_cache_entry__delete()
361 zfree(&entry->spev); in probe_cache_entry__delete()
362 free(entry); in probe_cache_entry__delete()
369 struct probe_cache_entry *entry = zalloc(sizeof(*entry)); in probe_cache_entry__new() local
371 if (entry) { in probe_cache_entry__new()
372 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()
121 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/objtool/ |
| D | special.c | 65 static int get_alt_entry(struct elf *elf, struct special_entry *entry, in get_alt_entry() argument
72 offset = idx * entry->size; in get_alt_entry()
74 alt->group = entry->group; in get_alt_entry()
75 alt->jump_or_nop = entry->jump_or_nop; in get_alt_entry()
79 entry->orig_len); in get_alt_entry()
81 entry->new_len); in get_alt_entry()
84 if (entry->feature) { in get_alt_entry()
88 entry->feature); in get_alt_entry()
92 orig_reloc = find_reloc_by_dest(elf, sec, offset + entry->orig); in get_alt_entry()
94 WARN_FUNC("can't find orig reloc", sec, offset + entry->orig); in get_alt_entry()
[all …]
|
| D | orc_gen.c | 118 struct orc_list_entry *entry = malloc(sizeof(*entry)); in orc_list_add() local
120 if (!entry) { in orc_list_add()
125 entry->orc = *orc; in orc_list_add()
126 entry->insn_sec = sec; in orc_list_add()
127 entry->insn_off = offset; in orc_list_add()
129 list_add_tail(&entry->list, orc_list); in orc_list_add()
144 struct orc_list_entry *entry; in orc_create() local
234 list_for_each_entry(entry, &orc_list, list) { in orc_create()
236 entry->insn_sec, entry->insn_off, in orc_create()
237 &entry->orc)) in orc_create()
|
| /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/testing/selftests/kvm/x86_64/ |
| D | hyperv_cpuid.c | 64 struct kvm_cpuid_entry2 *entry = &hv_cpuid_entries->entries[i]; in test_hv_cpuid() local
66 TEST_ASSERT((entry->function >= 0x40000000) && in test_hv_cpuid()
67 (entry->function <= 0x40000082), in test_hv_cpuid()
69 entry->function); in test_hv_cpuid()
71 TEST_ASSERT(evmcs_enabled || (entry->function != 0x4000000A), in test_hv_cpuid()
74 TEST_ASSERT(entry->index == 0, in test_hv_cpuid()
77 TEST_ASSERT(entry->flags == 0, in test_hv_cpuid()
80 TEST_ASSERT(!entry->padding[0] && !entry->padding[1] && in test_hv_cpuid()
81 !entry->padding[2], "padding should be zero"); in test_hv_cpuid()
83 switch (entry->function) { in test_hv_cpuid()
[all …]
|
| D | xss_msr_test.c | 40 struct kvm_cpuid_entry2 *entry; in main() local
50 entry = kvm_get_supported_cpuid_index(0xd, 1); in main()
51 xss_supported = entry && !!(entry->eax & X86_FEATURE_XSAVES); in main()
|
| /tools/testing/selftests/bpf/prog_tests/ |
| D | hashmap.c | 45 struct hashmap_entry *entry, *tmp; in test_hashmap_generic() local
94 hashmap__for_each_entry(map, entry, bkt) { in test_hashmap_generic()
95 long k = (long)entry->key; in test_hashmap_generic()
96 long v = (long)entry->value; in test_hashmap_generic()
142 hashmap__for_each_entry_safe(map, entry, tmp, bkt) { in test_hashmap_generic()
143 long k = (long)entry->key; in test_hashmap_generic()
144 long v = (long)entry->value; in test_hashmap_generic()
156 hashmap__for_each_key_entry(map, entry, (void *)0) { in test_hashmap_generic()
165 hashmap__for_each_key_entry_safe(map, entry, tmp, (void *)0) { in test_hashmap_generic()
169 k = entry->key; in test_hashmap_generic()
[all …]
|
| /tools/testing/selftests/vm/ |
| D | compaction_test.c | 164 struct map_list *list, *entry; in main() local
202 entry = malloc(sizeof(struct map_list)); in main()
203 if (!entry) { in main()
207 entry->map = map; in main()
208 entry->next = list; in main()
209 list = entry; in main()
220 for (entry = list; entry != NULL; entry = entry->next) { in main()
221 munmap(entry->map, MAP_SIZE); in main()
222 if (!entry->next) in main()
224 entry = entry->next; in main()
|
| /tools/usb/ |
| D | testusb.c | 237 struct testdev *entry; in find_testdev() local
255 entry = calloc(1, sizeof *entry); in find_testdev()
256 if (!entry) in find_testdev()
259 entry->name = strdup(name); in find_testdev()
260 if (!entry->name) { in find_testdev()
261 free(entry); in find_testdev()
267 entry->ifnum = ifnum; in find_testdev()
268 entry->next = testdevs; in find_testdev()
269 testdevs = entry; in find_testdev()
369 struct testdev *entry; in main() local
[all …]
|
| /tools/testing/selftests/kvm/lib/s390x/ |
| D | processor.c | 58 uint64_t *entry; in virt_pg_map() local
78 entry = addr_gpa2hva(vm, vm->pgd); in virt_pg_map()
81 if (entry[idx] & REGION_ENTRY_INVALID) in virt_pg_map()
82 entry[idx] = virt_alloc_region(vm, ri, memslot); in virt_pg_map()
83 entry = addr_gpa2hva(vm, entry[idx] & REGION_ENTRY_ORIGIN); in virt_pg_map()
88 if (!(entry[idx] & PAGE_INVALID)) in virt_pg_map()
91 entry[idx] = gpa; in virt_pg_map()
97 uint64_t *entry; in addr_gva2gpa() local
102 entry = addr_gpa2hva(vm, vm->pgd); in addr_gva2gpa()
105 TEST_ASSERT(!(entry[idx] & REGION_ENTRY_INVALID), in addr_gva2gpa()
[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 | 441 int procfs__read_str(const char *entry, char **buf, size_t *sizep) in procfs__read_str() argument
449 snprintf(path, sizeof(path), "%s/%s", procfs, entry); in procfs__read_str()
454 static int sysfs__read_ull_base(const char *entry, in sysfs__read_ull_base() argument
463 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_ull_base()
468 int sysfs__read_xll(const char *entry, unsigned long long *value) in sysfs__read_xll() argument
470 return sysfs__read_ull_base(entry, value, 16); in sysfs__read_xll()
473 int sysfs__read_ull(const char *entry, unsigned long long *value) in sysfs__read_ull() argument
475 return sysfs__read_ull_base(entry, value, 0); in sysfs__read_ull()
478 int sysfs__read_int(const char *entry, int *value) in sysfs__read_int() argument
486 snprintf(path, sizeof(path), "%s/%s", sysfs, entry); in sysfs__read_int()
[all …]
|
| /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/testing/kunit/ |
| D | kunit_config.py | 39 def add_entry(self, entry: KconfigEntry) -> None:
40 self._entries.append(entry)
57 for entry in self.entries():
58 f.write(str(entry) + '\n')
72 entry = KconfigEntry(match.group(1), match.group(2))
73 self.add_entry(entry)
78 entry = KconfigEntry(empty_match.group(1), 'n')
79 self.add_entry(entry)
|
| /tools/usb/usbip/libsrc/ |
| D | list.h | 86 static inline void __list_del_entry(struct list_head *entry) in __list_del_entry() argument
88 __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/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/rcutorture/formal/srcu-cbmc/src/ |
| D | workqueues.h | 23 struct list_head entry; member
31 struct hlist_node entry; member
86 .entry = { &(n).entry, &(n).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()
|
| /tools/testing/radix-tree/ |
| D | regression4.c | 21 void *entry; in reader_fn() local
28 entry = radix_tree_lookup(&mt_tree, 0); in reader_fn()
30 if (entry != &obj0) { in reader_fn()
31 printf("iteration %d bad entry = %p\n", i, entry); in reader_fn()
|
| /tools/perf/scripts/python/ |
| D | stackcollapse.py | 99 for entry in param_dict['callchain']:
100 entry.setdefault('sym', dict())
101 entry['sym'].setdefault('name', None)
102 entry.setdefault('dso', None)
103 stack.append(tidy_function_name(entry['sym']['name'],
104 entry['dso']))
|