Home
last modified time | relevance | path

Searched refs:it (Results 1 – 25 of 186) sorted by relevance

12345678

/tools/lib/bpf/
A Dbtf_iter.c19 it->p = NULL; in btf_field_iter_init()
20 it->m_idx = -1; in btf_field_iter_init()
22 it->vlen = 0; in btf_field_iter_init()
141 it->p = t; in btf_field_iter_init()
147 if (!it->p) in btf_field_iter_next()
151 if (it->off_idx < it->desc.t_off_cnt) in btf_field_iter_next()
152 return it->p + it->desc.t_offs[it->off_idx++]; in btf_field_iter_next()
165 if (it->off_idx >= it->desc.m_off_cnt) { in btf_field_iter_next()
168 it->p += it->desc.m_sz; in btf_field_iter_next()
172 if (it->m_idx < it->vlen) in btf_field_iter_next()
[all …]
A Dbtf_relocate.c69 struct btf_field_iter it; in btf_relocate_rewrite_type_id() local
73 err = btf_field_iter_init(&it, t, BTF_FIELD_ITER_IDS); in btf_relocate_rewrite_type_id()
77 while ((id = btf_field_iter_next(&it))) in btf_relocate_rewrite_type_id()
135 struct btf_field_iter it; in btf_mark_embedded_composite_type_ids() local
142 err = btf_field_iter_init(&it, t, BTF_FIELD_ITER_IDS); in btf_mark_embedded_composite_type_ids()
146 while ((id = btf_field_iter_next(&it))) { in btf_mark_embedded_composite_type_ids()
415 struct btf_field_iter it; in btf_relocate_rewrite_strs() local
419 err = btf_field_iter_init(&it, t, BTF_FIELD_ITER_STRS); in btf_relocate_rewrite_strs()
423 while ((str_off = btf_field_iter_next(&it))) { in btf_relocate_rewrite_strs()
/tools/testing/selftests/bpf/progs/
A Diters.c33 struct bpf_iter_num it; in iter_err_unsafe_c_loop() local
42 bpf_iter_num_destroy(&it); in iter_err_unsafe_c_loop()
53 struct bpf_iter_num it; in iter_err_unsafe_asm_loop() local
79 : [it]"r"(&it), in iter_err_unsafe_asm_loop()
95 struct bpf_iter_num it; in iter_while_loop() local
131 struct bpf_iter_num it; in iter_for_loop() local
137 for (v = bpf_iter_num_next(&it); v; v = bpf_iter_num_next(&it)) { in iter_for_loop()
179 struct bpf_iter_num it; in iter_pragma_unroll_loop() local
199 struct bpf_iter_num it; in iter_manual_unroll_loop() local
222 struct bpf_iter_num it; in iter_multiple_sequential_loops() local
[all …]
A Diters_testmod_seq.c85 struct bpf_iter_testmod_seq it; in testmod_seq_getter_before_bad() local
87 return bpf_iter_testmod_seq_value(0, &it); in testmod_seq_getter_before_bad()
95 struct bpf_iter_testmod_seq it; in testmod_seq_getter_after_bad() local
98 bpf_iter_testmod_seq_new(&it, 100, 100); in testmod_seq_getter_after_bad()
100 while ((v = bpf_iter_testmod_seq_next(&it))) { in testmod_seq_getter_after_bad()
104 bpf_iter_testmod_seq_destroy(&it); in testmod_seq_getter_after_bad()
113 struct bpf_iter_testmod_seq it; in testmod_seq_getter_good() local
116 bpf_iter_testmod_seq_new(&it, 100, 100); in testmod_seq_getter_good()
118 while ((v = bpf_iter_testmod_seq_next(&it))) { in testmod_seq_getter_good()
122 sum *= bpf_iter_testmod_seq_value(0, &it); in testmod_seq_getter_good()
[all …]
A Diters_num.c142 struct bpf_iter_num it; in num_invalid_range() local
145 bpf_iter_num_destroy(&it); in num_invalid_range()
156 struct bpf_iter_num it; in num_max_range() local
159 bpf_iter_num_destroy(&it); in num_max_range()
170 struct bpf_iter_num it; in num_e2big_range() local
173 bpf_iter_num_destroy(&it); in num_e2big_range()
184 struct bpf_iter_num it; in num_succ_elem_cnt() local
191 bpf_iter_num_destroy(&it); in num_succ_elem_cnt()
204 struct bpf_iter_num it; in num_overfetched_elem_cnt() local
213 bpf_iter_num_destroy(&it); in num_overfetched_elem_cnt()
[all …]
A Dverifier_bits_iter.c13 int bpf_iter_bits_new(struct bpf_iter_bits *it, const u64 *unsafe_ptr__ign,
15 int *bpf_iter_bits_next(struct bpf_iter_bits *it) __ksym __weak;
16 void bpf_iter_bits_destroy(struct bpf_iter_bits *it) __ksym __weak;
25 struct bpf_iter_bits it; in BPF_PROG() local
28 bpf_iter_bits_new(&it, &data, 1); in BPF_PROG()
29 bpf_iter_bits_next(&it); in BPF_PROG()
38 struct bpf_iter_bits it = {}; in BPF_PROG() local
40 bpf_iter_bits_next(&it); in BPF_PROG()
49 struct bpf_iter_bits it = {}; in BPF_PROG() local
51 bpf_iter_bits_destroy(&it); in BPF_PROG()
A Dverifier_iterating_callbacks.c558 struct bpf_iter_num it; in __flag() local
562 bpf_iter_num_new(&it, 0, ARR2_SZ); in __flag()
563 while ((v = bpf_iter_num_next(&it))) { in __flag()
567 bpf_iter_num_destroy(&it); in __flag()
575 struct bpf_iter_num it; in __flag() local
579 bpf_iter_num_new(&it, 0, ARR2_SZ); in __flag()
580 while ((v = bpf_iter_num_next(&it))) { in __flag()
584 bpf_iter_num_destroy(&it); in __flag()
594 struct bpf_iter_num it; in __flag() local
598 bpf_iter_num_new(&it, 0, ARR2_SZ); in __flag()
[all …]
A Dirq.c353 struct bpf_iter_num it; in irq_restore_iter() local
355 bpf_iter_num_new(&it, 0, 42); in irq_restore_iter()
356 bpf_local_irq_restore((unsigned long *)&it); in irq_restore_iter()
364 struct bpf_iter_num it; in irq_save_iter() local
369 _Static_assert(sizeof(it) == sizeof(unsigned long), "broken iterator size"); in irq_save_iter()
371 bpf_iter_num_new(&it, 0, 42); in irq_save_iter()
372 bpf_local_irq_save((unsigned long *)&it); in irq_save_iter()
373 bpf_local_irq_restore((unsigned long *)&it); in irq_save_iter()
/tools/testing/selftests/kvm/lib/
A Dlru_gen_util.c45 char *ret = strtok_r(it->str, " \t\n\r", &it->save); in split_next()
47 it->str = NULL; in split_next()
56 char *prefix = split_next(&it); in memcg_stats_handle_searching()
57 char *memcg_id = split_next(&it); in memcg_stats_handle_searching()
58 char *memcg_name = split_next(&it); in memcg_stats_handle_searching()
87 char *prefix = split_next(&it); in memcg_stats_handle_in_memcg()
88 char *id = split_next(&it); in memcg_stats_handle_in_memcg()
135 gen = split_next(&it); in memcg_stats_handle_in_node()
155 age = split_next(&it); in memcg_stats_handle_in_node()
156 nr_anon = split_next(&it); in memcg_stats_handle_in_node()
[all …]
/tools/testing/selftests/bpf/
A Dbpf_experimental.h164 extern int bpf_iter_task_vma_new(struct bpf_iter_task_vma *it,
168 extern void bpf_iter_task_vma_destroy(struct bpf_iter_task_vma *it) __ksym;
564 extern int bpf_iter_css_task_new(struct bpf_iter_css_task *it,
567 extern void bpf_iter_css_task_destroy(struct bpf_iter_css_task *it) __weak __ksym;
570 extern int bpf_iter_task_new(struct bpf_iter_task *it,
573 extern void bpf_iter_task_destroy(struct bpf_iter_task *it) __weak __ksym;
576 extern int bpf_iter_css_new(struct bpf_iter_css *it,
579 extern void bpf_iter_css_destroy(struct bpf_iter_css *it) __weak __ksym;
590 extern int bpf_iter_kmem_cache_new(struct bpf_iter_kmem_cache *it) __weak __ksym;
595 extern int bpf_iter_dmabuf_new(struct bpf_iter_dmabuf *it) __weak __ksym;
[all …]
A Dbpf_arena_list.h28 static inline void *bpf_iter_num_new(struct bpf_iter_num *it, int i, int j) { return NULL; } in bpf_iter_num_new() argument
29 static inline void bpf_iter_num_destroy(struct bpf_iter_num *it) {} in bpf_iter_num_destroy() argument
30 static inline bool bpf_iter_num_next(struct bpf_iter_num *it) { return true; } in bpf_iter_num_next() argument
/tools/testing/selftests/sync/
A Dsync_stress_consumer.c108 int fence, merged, tmp, valid, it, i; in mpcs_consumer_thread() local
114 for (it = 1; it <= iterations; it++) { in mpcs_consumer_thread()
115 fence = sw_sync_fence_create(producer_timelines[0], "name", it); in mpcs_consumer_thread()
118 "name", it); in mpcs_consumer_thread()
140 ASSERT(test_data_mpsc.counter == n * it, in mpcs_consumer_thread()
/tools/perf/Documentation/
A Dguest-files.txt4 Guest OS /proc/kallsyms file copy. perf reads it to get guest
5 kernel symbols. Users copy it out from guest OS.
8 Guest OS /proc/modules file copy. perf reads it to get guest
9 kernel module information. Users copy it out from guest OS.
A Dperf-lock.txt56 Don't complain, do it.
75 Output fields. By default it shows all the fields but users can
131 Output fields. By default it shows all but the wait_min fields
204 Note that it matches the substring so 'rq' would match both 'raw_spin_rq_lock'
209 Show results using a CSV-style output to make it easy to import directly
226 The 'time' is specified in nsec but it can have a unit suffix. Available
227 units are "ms", "us" and "ns". Currently it accepts up to 10ms of delays
230 Note that it will busy-wait after it gets the lock. Delaying locks can
232 use it at your own risk.
/tools/sched_ext/include/scx/
A Dcommon.bpf.h68 void bpf_iter_scx_dsq_destroy(struct bpf_iter_scx_dsq *it) __ksym __weak;
330 extern int bpf_iter_css_new(struct bpf_iter_css *it,
334 bpf_iter_css_next(struct bpf_iter_css *it) __weak __ksym;
368 int *bpf_iter_bits_next(struct bpf_iter_bits *it) __ksym;
369 void bpf_iter_bits_destroy(struct bpf_iter_bits *it) __ksym;
373 struct bpf_iter_bits it; \
381 it->bitmap = scx_bpf_get_##name##_cpumask(); \
382 return bpf_iter_bits_new(&it->it, (const u64 *)it->bitmap, \
388 return bpf_iter_bits_next(&it->it); \
393 scx_bpf_put_cpumask(it->bitmap); \
[all …]
/tools/testing/selftests/pidfd/
A Dpidfd_xattr_test.c77 for (char *it = list; it < list + ret; it += strlen(it) + 1) { in TEST_F() local
78 if (strcmp(it, xattr_name)) in TEST_F()
/tools/usb/usbip/
A DCOPYING7 of this license document, but changing it is not allowed.
12 freedom to share and change it. By contrast, the GNU General Public
18 the GNU Library General Public License instead.) You can apply it to
25 if you want it, that you can change the software or use pieces of it
31 distribute copies of the software, or if you modify it.
67 that is to say, a work containing the Program or a portion of it,
80 source code as you receive it, in any medium, provided that you
91 of it, thus forming a work based on the Program, and copy and
104 when run, you must cause it, when started running for such
187 the Program or works based on it.
[all …]
A DINSTALL8 unlimited permission to copy, distribute and modify it.
22 definitions. Finally, it creates a shell script `config.status' that
38 may remove or edit it.
42 you want to change it or regenerate `configure' using a newer version
50 Running `configure' might take a while. While running, it prints
51 some messages telling which features it is checking for.
98 With a non-GNU `make', it is safer to compile the package for one
147 architectures, `configure' can figure that out, but if it prints a
148 message saying it cannot guess the machine type, give it the
177 `configure' looks for `PREFIX/share/config.site' if it exists, then
[all …]
/tools/testing/selftests/net/packetdrill/
A Dtcp_validate_validate-established-no-flags.pkt18 // Receive a segment with no flags set, verify that it's not enqueued.
22 // Receive a segment with ACK flag set, verify that it is enqueued.
A Dtcp_user_timeout_user_timeout.pkt18 // We set TCP_USER_TIMEOUT to 3 seconds because really it is not worth
29 // We finally receive something from the peer, but it is way too late
/tools/bpf/bpftool/Documentation/
A Dbpftool-struct_ops.rst41 *STRUCT_OPS_MAP* is specified, it shows information only for the given
42 struct_ops. Otherwise, it lists all struct_ops currently existing in the
50 *STRUCT_OPS_MAP* is specified, it dumps information only for the given
51 struct_ops. Otherwise, it dumps all struct_ops currently existing in the
/tools/testing/selftests/net/forwarding/
A DREADME64 influence its behavior and tools it invokes, and how it invokes them, in
79 The variable NETIFS is special. Since it is an array variable, there is no
80 way to pass it through the environment. Its value can instead be given as
87 present, so it can contain any shell code. Typically it will contain
/tools/memory-model/litmus-tests/
A DWRC+pooncerelease+fencermbonceonce+Once.litmus7 * the first write is moved to a separate process. Because it features
8 * a release and a read memory barrier, it should be forbidden. More
/tools/testing/selftests/arm64/signal/
A DREADME16 by receiving some kind of fatal signal from the Kernel, so it's safer
38 kind of tests it is extremely easy in fact to end-up injecting other
39 unrelated SEGV bugs in the testcases, it becomes extremely tricky to
47 and verify if it is indeed GOOD or BAD (depending on what we were
52 default it takes care to verify that the test-execution had at least
/tools/testing/ktest/examples/
A DREADME2 The configs still need to be customized for your environment, but it
3 is broken up by task which makes it easier to understand how to set up
12 it easy to compile test different archs. You can download the arch

Completed in 25 milliseconds

12345678