| /tools/testing/radix-tree/ |
| D | tag_check.c | 14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks() argument
19 item_check_absent(tree, index); in __simple_checks()
20 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
22 item_insert(tree, index); in __simple_checks()
23 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
24 item_tag_set(tree, index, tag); in __simple_checks()
25 ret = item_tag_get(tree, index, tag); in __simple_checks()
29 ret = item_tag_get(tree, index, !tag); in __simple_checks()
31 ret = item_delete(tree, index); in __simple_checks()
33 item_insert(tree, index); in __simple_checks()
[all …]
|
| D | regression3.c | 45 printv(2, "tagged %ld %p\n", iter.index, *slot); in regression3_test()
52 printv(2, "retry at %ld\n", iter.index); in regression3_test()
61 printv(2, "slot %ld %p\n", iter.index, *slot); in regression3_test()
67 printv(2, "retry at %ld\n", iter.index); in regression3_test()
76 printv(2, "contig %ld %p\n", iter.index, *slot); in regression3_test()
82 printv(2, "retry at %ld\n", iter.index); in regression3_test()
89 printv(2, "slot %ld %p\n", iter.index, *slot); in regression3_test()
90 if (!iter.index) { in regression3_test()
91 printv(2, "next at %ld\n", iter.index); in regression3_test()
97 printv(2, "contig %ld %p\n", iter.index, *slot); in regression3_test()
[all …]
|
| D | test.c | 12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_set() argument
14 return radix_tree_tag_set(root, index, tag); in item_tag_set()
18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_clear() argument
20 return radix_tree_tag_clear(root, index, tag); in item_tag_clear()
23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_get() argument
25 return radix_tree_tag_get(root, index, tag); in item_tag_get()
30 return __radix_tree_insert(root, item->index, item->order, item); in __item_insert()
33 struct item *item_create(unsigned long index, unsigned int order) in item_create() argument
37 ret->index = index; in item_create()
42 int item_insert_order(struct radix_tree_root *root, unsigned long index, in item_insert_order() argument
[all …]
|
| D | test.h | 8 unsigned long index; member
12 struct item *item_create(unsigned long index, unsigned int order);
14 int item_insert(struct radix_tree_root *root, unsigned long index);
15 int item_insert_order(struct radix_tree_root *root, unsigned long index,
17 int item_delete(struct radix_tree_root *root, unsigned long index);
18 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
20 void item_check_present(struct radix_tree_root *root, unsigned long index);
21 void item_check_absent(struct radix_tree_root *root, unsigned long index);
43 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
45 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag);
[all …]
|
| D | multiorder.c | 25 static void __multiorder_tag_test(int index, int order) in __multiorder_tag_test() argument
31 base = index & ~((1 << order) - 1); in __multiorder_tag_test()
34 index, base); in __multiorder_tag_test()
36 err = item_insert_order(&tree, index, order); in __multiorder_tag_test()
55 assert(radix_tree_tag_set(&tree, index, 0)); in __multiorder_tag_test()
63 assert(radix_tree_tag_clear(&tree, index, 0)); in __multiorder_tag_test()
70 assert(radix_tree_tag_clear(&tree, index, 1)); in __multiorder_tag_test()
81 unsigned long index = (1 << order); in __multiorder_tag_test2() local
82 index2 += index; in __multiorder_tag_test2()
144 static void multiorder_check(unsigned long index, int order) in multiorder_check() argument
[all …]
|
| D | benchmark.c | 67 unsigned long index; in benchmark_insert() local
72 for (index = 0 ; index < size ; index += step) in benchmark_insert()
73 item_insert_order(root, index, order); in benchmark_insert()
88 unsigned long index; in benchmark_tagging() local
93 for (index = 0 ; index < size ; index += step) in benchmark_tagging()
94 radix_tree_tag_set(root, index, 0); in benchmark_tagging()
109 unsigned long index, i; in benchmark_delete() local
114 for (index = 0 ; index < size ; index += step) in benchmark_delete()
115 for_each_index(i, index, order) in benchmark_delete()
149 static long long __benchmark_split(unsigned long index, in __benchmark_split() argument
[all …]
|
| D | main.c | 237 static void __locate_check(struct radix_tree_root *tree, unsigned long index, in __locate_check() argument
243 item_insert_order(tree, index, order); in __locate_check()
244 item = item_lookup(tree, index); in __locate_check()
246 if (index != index2) { in __locate_check()
248 index, order, index2); in __locate_check()
268 unsigned long offset, index; in locate_check() local
275 for (index = 0; index < (1UL << (order + 5)); in locate_check()
276 index += (1UL << order)) { in locate_check()
277 __locate_check(&tree, index + offset, order); in locate_check()
|
| D | regression2.c | 64 unsigned long index; member
71 p->index = page_count++; in page_alloc()
|
| /tools/virtio/ringtest/ |
| D | ring.c | 35 unsigned short index; member
100 .index = i, in alloc_ring()
116 unsigned head, index; in add_inbuf() local
135 index = ring[head].index; in add_inbuf()
136 data[index].buf = buf; in add_inbuf()
137 data[index].data = datap; in add_inbuf()
148 unsigned index; in get_buf() local
156 index = ring[head].index & (ring_size - 1); in get_buf()
157 datap = data[index].data; in get_buf()
158 *bufp = data[index].buf; in get_buf()
[all …]
|
| D | virtio_ring_0_9.c | 155 unsigned index; in get_buf() local
160 index = ring.used->ring[head].id; in get_buf()
161 if ((index ^ guest.last_used_idx ^ 0x8000) & ~(ring_size - 1)) in get_buf()
165 index &= ring_size - 1; in get_buf()
173 index = head; in get_buf()
176 index = ring.used->ring[head].id; in get_buf()
181 *lenp = ring.desc[index].len; in get_buf()
185 datap = data[index].data; in get_buf()
186 *bufp = (void*)(unsigned long)ring.desc[index].addr; in get_buf()
187 data[index].data = NULL; in get_buf()
[all …]
|
| /tools/vm/ |
| D | page-types.c | 257 unsigned long index, in do_u64_read() argument
262 if (index > ULONG_MAX / 8) in do_u64_read()
263 fatal("index overflow: %lu\n", index); in do_u64_read()
265 bytes = pread(fd, buf, count * 8, (off_t)index * 8); in do_u64_read()
277 unsigned long index, in kpageflags_read() argument
280 return do_u64_read(kpageflags_fd, PROC_KPAGEFLAGS, buf, index, pages); in kpageflags_read()
284 unsigned long index, in kpagecgroup_read() argument
290 return do_u64_read(kpagecgroup_fd, PROC_KPAGEFLAGS, buf, index, pages); in kpagecgroup_read()
294 unsigned long index, in pagemap_read() argument
297 return do_u64_read(pagemap_fd, "/proc/pid/pagemap", buf, index, pages); in pagemap_read()
[all …]
|
| /tools/testing/selftests/x86/ |
| D | mpx-hw.h | 96 unsigned long index = __vaddr_bounds_directory_index(vaddr); in mpx_vaddr_to_bd_entry() local
97 return &bounds_dir->entries[index]; in mpx_vaddr_to_bd_entry()
120 unsigned long index = __vaddr_bounds_table_index(vaddr); in mpx_vaddr_to_bt_entry() local
121 return &bt->entries[index]; in mpx_vaddr_to_bt_entry()
|
| D | mpx-mini-test.c | 202 static inline uint64_t xgetbv(uint32_t index) in xgetbv() argument
208 : "c" (index)); in xgetbv()
953 void mkbnd_shadow(uint8_t *ptr, int index, long offset) in mkbnd_shadow() argument
955 uint64_t *lower = (uint64_t *)&(shadow_plb[index][0]); in mkbnd_shadow()
956 uint64_t *upper = (uint64_t *)&(shadow_plb[index][1]); in mkbnd_shadow()
961 void check_lowerbound_shadow(uint8_t *ptr, int index) in check_lowerbound_shadow() argument
963 uint64_t *lower = (uint64_t *)&(shadow_plb[index][0]); in check_lowerbound_shadow()
970 void check_upperbound_shadow(uint8_t *ptr, int index) in check_upperbound_shadow() argument
972 uint64_t upper = *(uint64_t *)&(shadow_plb[index][1]); in check_upperbound_shadow()
1001 __always_inline void stdsc_shadow(int index, uint8_t *ptr, uint8_t *ptr_val) in stdsc_shadow() argument
[all …]
|
| D | ldt_gdt.c | 63 static void check_invalid_segment(uint16_t index, int ldt) in check_invalid_segment() argument
66 uint32_t selector = (index << 3) | (ldt << 2) | 3; in check_invalid_segment()
83 (ldt ? "LDT" : "GDT"), index); in check_invalid_segment()
87 (ldt ? "LDT" : "GDT"), index); in check_invalid_segment()
91 static void check_valid_segment(uint16_t index, int ldt, in check_valid_segment() argument
96 uint32_t selector = (index << 3) | (ldt << 2) | 3; in check_valid_segment()
113 (ldt ? "LDT" : "GDT"), index); in check_valid_segment()
127 (ldt ? "LDT" : "GDT"), index, ar, expected_ar); in check_valid_segment()
131 (ldt ? "LDT" : "GDT"), index, limit, expected_limit); in check_valid_segment()
135 (ldt ? "LDT" : "GDT"), index, ar, limit); in check_valid_segment()
|
| /tools/testing/selftests/ptp/ |
| D | testptp.c | 173 int index = 0; in main() local
214 index = atoi(optarg); in main()
355 extts_request.index = index; in main()
369 printf("event index %u at %lld.%09u\n", event.index, in main()
388 desc.index = i; in main()
394 desc.name, desc.index, desc.func, desc.chan); in main()
447 perout_request.index = index; in main()
461 desc.index = pin_index; in main()
463 desc.chan = index; in main()
|
| /tools/testing/selftests/tc-testing/ |
| D | tdc_batch.py | 48 index = 0 variable
59 index += 1
60 if index >= number:
|
| /tools/lib/traceevent/ |
| D | kbuffer-parse.c | 64 unsigned int index; member
325 kbuf->index = kbuf->size; in old_update_pointers()
339 kbuf->index = calc_index(kbuf, ptr); in old_update_pointers()
340 kbuf->next = kbuf->index + length; in old_update_pointers()
416 kbuf->index = calc_index(kbuf, ptr); in update_pointers()
417 kbuf->next = kbuf->index + length; in update_pointers()
508 return kbuf->data + kbuf->index; in kbuffer_next_event()
556 kbuf->index = 0; in kbuffer_load_subbuffer()
582 return kbuf->data + kbuf->index; in kbuffer_read_event()
686 return kbuf->next - kbuf->index; in kbuffer_event_size()
|
| D | plugin_function.c | 133 int index = 0; in function_handler() local
146 index = add_and_get_index(parent, func, record->cpu); in function_handler()
148 trace_seq_printf(s, "%*s", index*3, ""); in function_handler()
|
| /tools/perf/ui/ |
| D | browser.c | 182 return browser->top_idx + row == browser->index; in ui_browser__is_current_entry()
248 browser->index = browser->top_idx = 0; in ui_browser__reset_index()
307 pct = ((browser->index * (browser->height - 1)) / in ui_browser__scrollbar_set()
366 browser->index += offset; in ui_browser__update_nr_entries()
412 if (browser->index == browser->nr_entries - 1) in ui_browser__run()
414 ++browser->index; in ui_browser__run()
415 if (browser->index == browser->top_idx + browser->rows) { in ui_browser__run()
421 if (browser->index == 0) in ui_browser__run()
423 --browser->index; in ui_browser__run()
424 if (browser->index < browser->top_idx) { in ui_browser__run()
[all …]
|
| /tools/perf/arch/x86/tests/ |
| D | gen-insn-x86-dat.awk | 36 colon_pos = index($0, ":")
62 expecting_pos = index($0, expecting_str)
|
| /tools/include/uapi/linux/ |
| D | vhost.h | 21 unsigned int index; member
26 unsigned int index; member
32 unsigned int index; member
|
| /tools/virtio/linux/ |
| D | virtio.h | 23 unsigned int index; member
56 struct virtqueue *vring_new_virtqueue(unsigned int index,
|
| /tools/perf/arch/arm64/util/ |
| D | dwarf-regs.c | 28 #define DWARFNUM2OFFSET(index) \ argument
29 (index * sizeof((struct user_pt_regs *)0)->regs[0])
|
| /tools/perf/Documentation/ |
| D | Makefile | 21 API_DOCS = $(patsubst %.txt,%,$(filter-out technical/api-index-skel.txt technical/api-index.txt, $(…
23 SP_ARTICLES += technical/api-index
259 $(OUTPUT)howto-index.txt $(OUTPUT)howto/*.html $(OUTPUT)doc.dep \
260 $(OUTPUT)technical/api-*.html $(OUTPUT)technical/api-index.txt \
318 howto-index.txt: howto-index.sh $(wildcard howto/*.txt)
320 '$(SHELL_PATH_SQ)' ./howto-index.sh $(wildcard howto/*.txt) >$@+ && \
|
| /tools/testing/selftests/bpf/ |
| D | test_xdp_redirect.sh | 38 ip link add veth1 index 111 type veth peer name veth11
39 ip link add veth2 index 222 type veth peer name veth22
|