| /external/bcc/libbpf-tools/ |
| D | runqlat.c | 142 __u32 lookup_key = -2, next_key; in print_log2_hists() local
145 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
146 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_log2_hists()
152 printf("\npid = %d %s\n", next_key, hist.comm); in print_log2_hists()
154 printf("\ntid = %d %s\n", next_key, hist.comm); in print_log2_hists()
156 printf("\npidns = %u %s\n", next_key, hist.comm); in print_log2_hists()
158 lookup_key = next_key; in print_log2_hists()
162 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
163 err = bpf_map_delete_elem(fd, &next_key); in print_log2_hists()
168 lookup_key = next_key; in print_log2_hists()
|
| D | biostacks.c | 101 struct rqinfo lookup_key = {}, next_key; in print_map() local
107 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
108 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_map()
113 partition = partitions__get_by_dev(partitions, next_key.dev); in print_map()
115 next_key.comm, next_key.pid, in print_map()
117 num_stack = next_key.kern_stack_size / in print_map()
118 sizeof(next_key.kern_stack[0]); in print_map()
120 ksym = ksyms__map_addr(ksyms, next_key.kern_stack[i]); in print_map()
125 lookup_key = next_key; in print_map()
|
| D | hardirqs.c | 122 struct irq_key lookup_key = {}, next_key; in print_map() local
135 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
136 err = bpf_map_lookup_elem(fd, &next_key, &info); in print_map()
142 printf("%-26s %11llu\n", next_key.name, info.count); in print_map()
146 printf("hardirq = %s\n", next_key.name); in print_map()
149 lookup_key = next_key; in print_map()
154 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
155 err = bpf_map_delete_elem(fd, &next_key); in print_map()
160 lookup_key = next_key; in print_map()
|
| D | cpudist.c | 153 __u32 lookup_key = -2, next_key; in print_log2_hists() local
157 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
158 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_log2_hists()
164 printf("\npid = %d %s\n", next_key, hist.comm); in print_log2_hists()
166 printf("\ntid = %d %s\n", next_key, hist.comm); in print_log2_hists()
168 lookup_key = next_key; in print_log2_hists()
172 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
173 err = bpf_map_delete_elem(fd, &next_key); in print_log2_hists()
178 lookup_key = next_key; in print_log2_hists()
|
| D | llcstat.c | 133 __u64 lookup_key = -1, next_key; in print_map() local
138 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
139 err = bpf_map_lookup_elem(fd, &next_key, &info); in print_map()
145 pid = next_key >> 32; in print_map()
146 cpu = next_key; in print_map()
152 lookup_key = next_key; in print_map()
160 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
161 err = bpf_map_delete_elem(fd, &next_key); in print_map()
166 lookup_key = next_key; in print_map()
|
| D | bitesize.c | 122 struct hist_key lookup_key, next_key; in print_log2_hists() local
127 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
128 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_log2_hists()
133 printf("\nProcess Name = %s\n", next_key.comm); in print_log2_hists()
135 lookup_key = next_key; in print_log2_hists()
139 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
140 err = bpf_map_delete_elem(fd, &next_key); in print_log2_hists()
145 lookup_key = next_key; in print_log2_hists()
|
| D | biopattern.c | 114 __u32 total, lookup_key = -1, next_key; in print_map() local
122 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
123 err = bpf_map_lookup_elem(fd, &next_key, &counter); in print_map()
128 lookup_key = next_key; in print_map()
138 partition = partitions__get_by_dev(partitions, next_key); in print_map()
147 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
148 err = bpf_map_delete_elem(fd, &next_key); in print_map()
153 lookup_key = next_key; in print_map()
|
| D | tcpsynbl.c | 143 __u64 lookup_key = -1, next_key; in print_log2_hists() local
147 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
148 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_log2_hists()
153 printf("backlog_max = %lld\n", next_key); in print_log2_hists()
155 lookup_key = next_key; in print_log2_hists()
159 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
160 err = bpf_map_delete_elem(fd, &next_key); in print_log2_hists()
165 lookup_key = next_key; in print_log2_hists()
|
| D | offcputime.c | 193 struct key_t lookup_key = {}, next_key; in print_map() local
209 while (!bpf_map_get_next_key(ifd, &lookup_key, &next_key)) { in print_map()
210 err = bpf_map_lookup_elem(ifd, &next_key, &val); in print_map()
215 lookup_key = next_key; in print_map()
218 if (bpf_map_lookup_elem(sfd, &next_key.kern_stack_id, ip) != 0) { in print_map()
228 if (next_key.user_stack_id == -1) in print_map()
231 if (bpf_map_lookup_elem(sfd, &next_key.user_stack_id, ip) != 0) { in print_map()
236 syms = syms_cache__get_syms(syms_cache, next_key.tgid); in print_map()
250 printf(" %-16s %s (%d)\n", "-", val.comm, next_key.pid); in print_map()
|
| D | tcprtt.c | 172 __u64 lookup_key = -1, next_key; in print_map() local
176 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
177 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_map()
183 struct in_addr addr = {.s_addr = next_key }; in print_map()
194 lookup_key = next_key; in print_map()
198 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_map()
199 err = bpf_map_delete_elem(fd, &next_key); in print_map()
204 lookup_key = next_key; in print_map()
|
| D | biolatency.c | 199 struct hist_key lookup_key = { .cmd_flags = -1 }, next_key; in print_log2_hists() local
205 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
206 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_log2_hists()
213 next_key.dev); in print_log2_hists()
218 print_cmd_flags(next_key.cmd_flags); in print_log2_hists()
221 lookup_key = next_key; in print_log2_hists()
225 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_log2_hists()
226 err = bpf_map_delete_elem(fd, &next_key); in print_log2_hists()
231 lookup_key = next_key; in print_log2_hists()
|
| D | map_helpers.c | 18 __u8 key[key_size], next_key[key_size]; in dump_hash_iter() local
25 err = bpf_map_get_next_key(map_fd, key, next_key); in dump_hash_iter()
31 __builtin_memcpy(key, next_key, key_size); in dump_hash_iter()
32 __builtin_memcpy(keys + key_size * n, next_key, key_size); in dump_hash_iter()
|
| D | cpufreq.c | 158 struct hkey lookup_key = {}, next_key; in print_linear_hists() local
162 while (!bpf_map_get_next_key(fd, &lookup_key, &next_key)) { in print_linear_hists()
163 err = bpf_map_lookup_elem(fd, &next_key, &hist); in print_linear_hists()
169 next_key.comm); in print_linear_hists()
171 lookup_key = next_key; in print_linear_hists()
|
| D | syscount.c | 228 __u32 next_key; in read_vals() local
246 err = bpf_map_get_next_key(fd, &key, &next_key); in read_vals()
253 key = keys[i++] = next_key; in read_vals()
|
| /external/linux-kselftest/tools/testing/selftests/bpf/ |
| D | test_maps.c | 39 long long key, next_key, first_key, value; in test_hashmap() local
102 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
103 (next_key == first_key)); in test_hashmap()
104 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_hashmap()
105 (next_key == 1 || next_key == 2) && in test_hashmap()
106 (next_key != first_key)); in test_hashmap()
107 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && in test_hashmap()
119 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && in test_hashmap()
121 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && in test_hashmap()
151 long long key, next_key, first_key; in test_hashmap_percpu() local
[all …]
|
| D | test_progs.c | 217 __u32 key, next_key; in compare_map_keys() local
229 while (bpf_map_get_next_key(map1_fd, &key, &next_key) == 0) { in compare_map_keys()
230 err = bpf_map_lookup_elem(map2_fd, &next_key, val_buf); in compare_map_keys()
234 key = next_key; in compare_map_keys()
244 __u32 key, next_key, *cur_key_p, *next_key_p; in compare_stack_ips() local
267 next_key_p = &next_key; in compare_stack_ips()
|
| D | test_lru_map.c | 106 unsigned long long next_key = 0; in map_subset() local
110 while (!bpf_map_get_next_key(map1, &next_key, &next_key)) { in map_subset()
111 assert(!bpf_map_lookup_elem(map1, &next_key, value1)); in map_subset()
112 ret = bpf_map_lookup_elem(map0, &next_key, value0); in map_subset()
115 next_key, strerror(errno), errno); in map_subset()
120 next_key, value0[0], value1[0]); in map_subset()
|
| /external/libdrm/tests/ |
| D | drmsl.c | 114 unsigned long next_key = 0; in print_neighbors() local
121 &next_key, &next_value); in print_neighbors()
123 key, retval, prev_key, next_key); in print_neighbors()
129 if (next_key != expected_next) { in print_neighbors()
131 next_key, expected_next); in print_neighbors()
|
| /external/musl/src/thread/ |
| D | pthread_key_create.c | 10 static pthread_key_t next_key; variable
35 pthread_key_t j = next_key; in __pthread_key_create()
38 keys[next_key = *k = j] = dtor; in __pthread_key_create()
42 } while ((j=(j+1)%PTHREAD_KEYS_MAX) != next_key); in __pthread_key_create()
|
| /external/igt-gpu-tools/scripts/ |
| D | trace.pl | 601 my $next_key = ${$timeline}[++$next];
602 if ($ctx == $db{$next_key}->{'ctx'} and
603 exists $db{$next_key}->{'end'}) {
604 $last_ctx = $db{$next_key}->{'ctx'};
606 $complete = $next_key;
727 my $next_key;
736 $next_key = ${$timeline}[$pos + 1];
739 $db{$next_key}->{'engine-start'} = $db{$next_key}->{'start'};
740 $db{$next_key}->{'start'} = $db{$key}->{'notify'};
|
| /external/mesa3d/src/gallium/frontends/nine/ |
| D | vertexshader9.h | 76 uint64_t next_key; member
121 vs->next_key = key; in NineVertexShader9_UpdateKey()
|
| D | pixelshader9.h | 66 uint64_t next_key; member
129 ps->next_key = key; in NinePixelShader9_UpdateKey()
|
| /external/rust/crates/serde_cbor/src/value/ |
| D | ser.rs | 221 next_key: None, in serialize_map()
263 next_key: Option<Value>, field
349 self.next_key = Some(to_value(&key)?); in serialize_key()
357 let key = self.next_key.take(); in serialize_value()
|
| /external/libdrm/ |
| D | xf86drmSL.c | 233 unsigned long *next_key, void **next_value) in drmSLLookupNeighbors() argument
241 *prev_key = *next_key = key; in drmSLLookupNeighbors()
249 *next_key = update[0]->forward[0]->key; in drmSLLookupNeighbors()
|
| /external/toybox/toys/posix/ |
| D | sort.c | 76 struct sort_key *next_key; // linked list member
166 while (*pkey) pkey = &((*pkey)->next_key); in add_key()
246 for (key=(void *)TT.key_list; !retval && key; key = key->next_key) { in compare_keys()
|