| /tools/power/cpupower/ |
| D | cpupower-completion.sh | 11 local cur="${COMP_WORDS[COMP_CWORD]}"
13 frequency-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
21 local cur="${COMP_WORDS[COMP_CWORD]}"
25 …s -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_frequencies)' -- "$cur"))
29 …(ls -d /sys/devices/system/cpu/cpufreq/policy* | head -1)/scaling_available_governors)' -- "$cur"))
31 frequency-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
39 local cur="${COMP_WORDS[COMP_CWORD]}"
41 idle-info) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
49 local cur="${COMP_WORDS[COMP_CWORD]}"
51 idle-set) COMPREPLY=($(compgen -W "$flags" -- "$cur")) ;;
[all …]
|
| /tools/perf/util/ |
| D | hashmap.h | 155 #define hashmap__for_each_entry(map, cur, bkt) \ argument
157 for (cur = map->buckets[bkt]; cur; cur = cur->next)
167 #define hashmap__for_each_entry_safe(map, cur, tmp, bkt) \ argument
169 for (cur = map->buckets[bkt]; \
170 cur && ({tmp = cur->next; true; }); \
171 cur = tmp)
179 #define hashmap__for_each_key_entry(map, cur, _key) \ argument
180 for (cur = map->buckets \
183 cur; \
184 cur = cur->next) \
[all …]
|
| D | strfilter.c | 84 struct strfilter_node root, *cur, *last_op; in strfilter_node__new() local
91 last_op = cur = &root; in strfilter_node__new()
97 if (!cur->r || !last_op->r) in strfilter_node__new()
99 cur = strfilter_node__alloc(OP_and, last_op->r, NULL); in strfilter_node__new()
100 if (!cur) in strfilter_node__new()
102 last_op->r = cur; in strfilter_node__new()
103 last_op = cur; in strfilter_node__new()
106 if (!cur->r || !root.r) in strfilter_node__new()
108 cur = strfilter_node__alloc(OP_or, root.r, NULL); in strfilter_node__new()
109 if (!cur) in strfilter_node__new()
[all …]
|
| D | hashmap.c | 65 struct hashmap_entry *cur, *tmp; in hashmap__clear() local
68 hashmap__for_each_entry_safe(map, cur, tmp, bkt) { in hashmap__clear()
69 free(cur); in hashmap__clear()
104 struct hashmap_entry *cur, *tmp; in hashmap_grow() local
117 hashmap__for_each_entry_safe(map, cur, tmp, bkt) { in hashmap_grow()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
119 hashmap_add_entry(&new_buckets[h], cur); in hashmap_grow()
135 struct hashmap_entry *cur, **prev_ptr; in hashmap_find_entry() local
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
141 cur; in hashmap_find_entry()
[all …]
|
| D | genelf_debug.c | 193 ubyte cur = data & 0x7F; in emit_unsigned_LEB128() local
196 cur |= 0x80; in emit_unsigned_LEB128()
197 buffer_ext_add(be, &cur, 1); in emit_unsigned_LEB128()
207 ubyte cur = data & 0x7F; in emit_signed_LEB128() local
211 if ((data == 0 && !(cur & 0x40)) || in emit_signed_LEB128()
212 (data == -1l && (cur & 0x40))) in emit_signed_LEB128()
215 cur |= 0x80; in emit_signed_LEB128()
216 buffer_ext_add(be, &cur, 1); in emit_signed_LEB128()
|
| D | expr.c | 221 struct hashmap_entry *cur; in expr__ctx_clear() local
224 hashmap__for_each_entry((&ctx->ids), cur, bkt) { in expr__ctx_clear()
225 free((char *)cur->key); in expr__ctx_clear()
226 free(cur->value); in expr__ctx_clear()
|
| /tools/lib/bpf/ |
| D | hashmap.h | 155 #define hashmap__for_each_entry(map, cur, bkt) \ argument
157 for (cur = map->buckets[bkt]; cur; cur = cur->next)
167 #define hashmap__for_each_entry_safe(map, cur, tmp, bkt) \ argument
169 for (cur = map->buckets[bkt]; \
170 cur && ({tmp = cur->next; true; }); \
171 cur = tmp)
179 #define hashmap__for_each_key_entry(map, cur, _key) \ argument
180 for (cur = map->buckets \
183 cur; \
184 cur = cur->next) \
[all …]
|
| D | hashmap.c | 65 struct hashmap_entry *cur, *tmp; in hashmap__clear() local
68 hashmap__for_each_entry_safe(map, cur, tmp, bkt) { in hashmap__clear()
69 free(cur); in hashmap__clear()
104 struct hashmap_entry *cur, *tmp; in hashmap_grow() local
117 hashmap__for_each_entry_safe(map, cur, tmp, bkt) { in hashmap_grow()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
119 hashmap_add_entry(&new_buckets[h], cur); in hashmap_grow()
135 struct hashmap_entry *cur, **prev_ptr; in hashmap_find_entry() local
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
141 cur; in hashmap_find_entry()
[all …]
|
| /tools/perf/ |
| D | perf-completion.sh | 71 cur)
72 cur=$cur_
118 __ltrim_colon_completions $cur
120 __perf__ltrim_colon_completions $cur
156 if [[ $cur == --* ]]; then
161 __perfcomp "$cmds" "$cur"
206 __perfcomp_colon "$subcmds" "$cur"
209 if [[ $cur == --* ]]; then
214 __perfcomp "$opts" "$cur"
245 local cur_="${2-$cur}"
[all …]
|
| /tools/bpf/bpftool/bash-completion/ |
| D | bpftool | 22 COMPREPLY+=( $( compgen -W "$w" -- "$cur" ) )
44 COMPREPLY+=( $( compgen -W "$*" -- "$cur" ) )
50 command sed -n 's/.*"id": \(.*\),$/\1/p' )" -- "$cur" ) )
59 command sed -n 's/.*"id": \(.*\),$/\1/p' )" -- "$cur" ) )
65 command sed -n 's/.*"name": \(.*\),$/\1/p' )" -- "$cur" ) )
74 command sed -n 's/.*"name": \(.*\),$/\1/p' )" -- "$cur" ) )
80 command sed -n 's/.*"id": \(.*\),$/\1/p' )" -- "$cur" ) )
86 command sed -n 's/.*"tag": "\(.*\)",$/\1/p' )" -- "$cur" ) )
92 command sed -n 's/.*"name": "\(.*\)",$/\1/p' )" -- "$cur" ) )
98 command sed -n 's/.*"id": \(.*\),$/\1/p' )" -- "$cur" ) )
[all …]
|
| /tools/lib/ |
| D | bitmap.c | 35 unsigned int cur, rbot, rtop; in bitmap_scnprintf() local
39 rbot = cur = find_first_bit(bitmap, nbits); in bitmap_scnprintf()
40 while (cur < nbits) { in bitmap_scnprintf()
41 rtop = cur; in bitmap_scnprintf()
42 cur = find_next_bit(bitmap, nbits, cur + 1); in bitmap_scnprintf()
43 if (cur < nbits && cur <= rtop + 1) in bitmap_scnprintf()
55 rbot = cur; in bitmap_scnprintf()
|
| /tools/testing/selftests/vm/ |
| D | mlock-random-test.c | 143 struct rlimit cur; in test_mlock_within_limit() local
146 getrlimit(RLIMIT_MEMLOCK, &cur); in test_mlock_within_limit()
147 if (cur.rlim_cur < alloc_size) { in test_mlock_within_limit()
149 alloc_size, (unsigned int)cur.rlim_cur); in test_mlock_within_limit()
220 struct rlimit cur; in test_mlock_outof_limit() local
222 getrlimit(RLIMIT_MEMLOCK, &cur); in test_mlock_outof_limit()
223 if (cur.rlim_cur >= alloc_size) { in test_mlock_outof_limit()
225 alloc_size, (unsigned int)cur.rlim_cur); in test_mlock_outof_limit()
233 int lock_size = (rand() % (alloc_size - cur.rlim_cur)) in test_mlock_outof_limit()
234 + cur.rlim_cur; in test_mlock_outof_limit()
|
| /tools/testing/radix-tree/ |
| D | main.c | 160 unsigned long start, end, count = 0, tagged, cur, tmp; in copy_tag_check() local
167 cur = start; in copy_tag_check()
169 end = cur; in copy_tag_check()
173 cur = rand(); in copy_tag_check()
174 if (cur & 1) { in copy_tag_check()
176 if (cur & 2) { in copy_tag_check()
182 if (cur & 4) { in copy_tag_check()
184 if (cur & 8) in copy_tag_check()
187 if (cur & 16) { in copy_tag_check()
189 if (cur & 32) { in copy_tag_check()
[all …]
|
| /tools/bpf/bpftool/ |
| D | cfg.c | 131 static bool cfg_partition_funcs(struct cfg *cfg, struct bpf_insn *cur, in cfg_partition_funcs() argument
136 func = cfg_append_func(cfg, cur); in cfg_partition_funcs()
140 for (; cur < end; cur++) { in cfg_partition_funcs()
141 if (cur->code != (BPF_JMP | BPF_CALL)) in cfg_partition_funcs()
143 if (cur->src_reg != BPF_PSEUDO_CALL) in cfg_partition_funcs()
145 func = cfg_append_func(cfg, cur + cur->off + 1); in cfg_partition_funcs()
167 struct bpf_insn *cur, *end; in func_partition_bb_head() local
170 cur = func->start; in func_partition_bb_head()
173 bb = func_append_bb(func, cur); in func_partition_bb_head()
177 for (; cur <= end; cur++) { in func_partition_bb_head()
[all …]
|
| D | xlated_dumper.c | 371 struct bpf_insn *cur = insn_start; in dump_xlated_for_graph() local
374 for (; cur <= insn_end; cur++) { in dump_xlated_for_graph()
379 double_insn = cur->code == (BPF_LD | BPF_IMM | BPF_DW); in dump_xlated_for_graph()
381 printf("% 4d: ", (int)(cur - insn_start + start_idx)); in dump_xlated_for_graph()
382 print_bpf_insn(&cbs, cur, true); in dump_xlated_for_graph()
383 if (cur != insn_end) in dump_xlated_for_graph()
|
| /tools/power/cpupower/utils/helpers/ |
| D | bitmask.c | 279 unsigned int cur, rbot, rtop; in bitmask_displaylist() local
283 rbot = cur = bitmask_first(bmp); in bitmask_displaylist()
284 while (cur < bmp->size) { in bitmask_displaylist()
285 rtop = cur; in bitmask_displaylist()
286 cur = bitmask_next(bmp, cur+1); in bitmask_displaylist()
287 if (cur >= bmp->size || cur > rtop + 1) { in bitmask_displaylist()
289 rbot = cur; in bitmask_displaylist()
|
| /tools/testing/selftests/net/ |
| D | txtimestamp.c | 154 static void validate_timestamp(struct timespec *cur, int min_delay) in validate_timestamp() argument
159 cur64 = timespec_to_us64(cur); in validate_timestamp()
178 static void __print_timestamp(const char *name, struct timespec *cur, in __print_timestamp() argument
183 if (!(cur->tv_sec | cur->tv_nsec)) in __print_timestamp()
188 name, cur->tv_sec, cur->tv_nsec, in __print_timestamp()
192 name, cur->tv_sec, cur->tv_nsec / NSEC_PER_USEC, in __print_timestamp()
195 if (cur != &ts_usr) { in __print_timestamp()
196 ts_delta = timespec_to_ns64(cur) - timespec_to_ns64(&ts_usr); in __print_timestamp()
809 struct addrinfo *addrs, *cur; in resolve_hostname() local
816 cur = addrs; in resolve_hostname()
[all …]
|
| D | udpgso_bench_rx.c | 194 char cur = data[0]; in do_verify_udp() local
198 if (cur < 'a' || cur > 'z') in do_verify_udp()
202 if (cur == 'z') in do_verify_udp()
203 cur = 'a'; in do_verify_udp()
205 cur++; in do_verify_udp()
207 if (data[i] != cur) in do_verify_udp()
211 sanitized_char(cur), cur); in do_verify_udp()
|
| /tools/testing/selftests/powerpc/nx-gzip/ |
| D | gunz_test.c | 75 #define fifo_free_first_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \ argument
76 ? (len)-((cur)+(used)) : 0)
77 #define fifo_free_last_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \ argument
78 ? (cur) : (len)-(used))
80 #define fifo_used_first_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \ argument
81 ? (used) : (len)-(cur))
82 #define fifo_used_last_bytes(cur, used, len) ((((cur)+(used)) <= (len)) \ argument
83 ? 0 : ((used)+(cur))-(len))
85 #define fifo_free_first_offset(cur, used) ((cur)+(used)) argument
86 #define fifo_free_last_offset(cur, used, len) \ argument
[all …]
|
| /tools/testing/selftests/drivers/net/mlxsw/ |
| D | sch_red_ets.sh | 71 local cur=$(busywait 1100 until_counter_is "> 0" \
73 (( cur == 0 ))
74 check_err $? "backlog of $cur observed on non-busy qdisc"
|
| /tools/perf/tests/ |
| D | pmu-events.c | 776 struct hashmap_entry *cur, *cur_tmp; in resolve_metric_simple() local
784 hashmap__for_each_entry_safe((&pctx->ids), cur, cur_tmp, bkt) { in resolve_metric_simple()
788 pe = metricgroup__find_metric(cur->key, map); in resolve_metric_simple()
792 if (!strcmp(metric_name, (char *)cur->key)) { in resolve_metric_simple()
801 expr__del_id(pctx, cur->key); in resolve_metric_simple()
849 struct hashmap_entry *cur; in test_parsing() local
879 hashmap__for_each_entry((&ctx.ids), cur, bkt) in test_parsing()
880 expr__add_id_val(&ctx, strdup(cur->key), k++); in test_parsing()
882 hashmap__for_each_entry((&ctx.ids), cur, bkt) { in test_parsing()
883 if (check_parse_cpu(cur->key, map == cpus_map, in test_parsing()
[all …]
|
| /tools/testing/selftests/ftrace/test.d/ftrace/ |
| D | func_event_triggers.tc | 76 cur=`cat set_ftrace_filter`
78 if [ "$cur" = "$top" ]; then
|
| D | func_traceonoff_triggers.tc | 66 cur=`cat set_ftrace_filter`
68 if [ "$cur" = "$top" ]; then
|
| /tools/testing/selftests/kvm/ |
| D | dirty_log_test.c | 299 struct kvm_dirty_gfn *cur; in dirty_ring_collect_one() local
303 cur = &dirty_gfns[*fetch_index % test_dirty_ring_count]; in dirty_ring_collect_one()
304 if (!dirty_gfn_is_dirtied(cur)) in dirty_ring_collect_one()
306 TEST_ASSERT(cur->slot == slot, "Slot number didn't match: " in dirty_ring_collect_one()
307 "%u != %u", cur->slot, slot); in dirty_ring_collect_one()
308 TEST_ASSERT(cur->offset < num_pages, "Offset overflow: " in dirty_ring_collect_one()
309 "0x%llx >= 0x%x", cur->offset, num_pages); in dirty_ring_collect_one()
311 set_bit_le(cur->offset, bitmap); in dirty_ring_collect_one()
312 dirty_ring_last_page = cur->offset; in dirty_ring_collect_one()
313 dirty_gfn_set_collected(cur); in dirty_ring_collect_one()
|
| /tools/testing/selftests/net/forwarding/ |
| D | sch_red.sh | 201 local cur=$(get_qdisc_backlog)
202 local diff=$((size - cur))
205 if ((cur >= size)); then
206 echo $cur
209 echo $cur
|