Home
last modified time | relevance | path

Searched refs:lists (Results 1 – 15 of 15) sorted by relevance

/tools/bpf/bpftool/Documentation/
A Dbpftool-struct_ops.rst42 struct_ops. Otherwise, it lists all struct_ops currently existing in the
A Dbpftool-feature.rst73 (**helpers**). The command does not probe the system, but simply lists the
/tools/perf/util/
A Dthread.h25 struct list_head lists; member
A Dmachine.c2444 list_for_each_entry(stitch_node, &lbr_stitch->lists, node) { in lbr_callchain_add_stitched_lbr_ip()
2544 list_add(&stitch_node->node, &lbr_stitch->lists); in has_stitched_lbr()
2546 list_add_tail(&stitch_node->node, &lbr_stitch->lists); in has_stitched_lbr()
2568 INIT_LIST_HEAD(&thread__lbr_stitch(thread)->lists); in alloc_lbr_stitch()
2623 if (!stitched_lbr && !list_empty(&lbr_stitch->lists)) { in resolve_lbr_callchain_sample()
2626 list_for_each_entry(stitch_node, &lbr_stitch->lists, node) in resolve_lbr_callchain_sample()
2629 list_splice_init(&lbr_stitch->lists, &lbr_stitch->free_lists); in resolve_lbr_callchain_sample()
A Dthread.c581 list_for_each_entry_safe(pos, tmp, &lbr_stitch->lists, node) { in thread__free_stitch_list()
/tools/perf/
A Dbuiltin-trace.c5148 char *sep = NULL, *lists[2] = { NULL, NULL, }; in trace__parse_events_option() local
5184 if (lists[list]) { in trace__parse_events_option()
5185 sprintf(lists[list] + strlen(lists[list]), ",%s", s); in trace__parse_events_option()
5187 lists[list] = malloc(len); in trace__parse_events_option()
5188 if (lists[list] == NULL) in trace__parse_events_option()
5190 strcpy(lists[list], s); in trace__parse_events_option()
5200 if (lists[1] != NULL) { in trace__parse_events_option()
5218 if (lists[0]) { in trace__parse_events_option()
5225 err = parse_events_option(&o, lists[0], 0); in trace__parse_events_option()
5229 free(lists[0]); in trace__parse_events_option()
[all …]
/tools/lib/perf/Documentation/
A Dlibperf.txt75 *API to handle event lists:*
/tools/build/Documentation/
A DBuild.txt71 ex-y += b.o # duplicates in the lists are allowed
/tools/testing/selftests/bpf/
A DREADME.rst38 These files are organized in three columns. The first column lists the test in
55 that deny lists are not automatically honored.
/tools/memory-model/Documentation/
A Dlitmus-tests.txt228 following paragraph lists them for the benefit of readers possessed of
234 lead-in to line 8's "Positive: 0 Negative: 3", which lists the number
303 (try it!). See the section below on linked lists to learn more about
371 spin loops, handling trivial linked lists, adding comments to litmus tests,
681 LKMM can handle linked lists, but only linked lists in which each node
718 and circular singly linked lists can also be created and manipulated.
A Dordering.txt8 This section lists LKMM's three top-level categories of memory-ordering
/tools/memory-model/
A DREADME173 More formally, this file (1) lists the subtypes of the various
/tools/power/pm-graph/
A DREADME653 # (optional) get the log, which just lists some test times for comparison
/tools/perf/Documentation/
A Dperf-script-python.txt28 provides more details on each step and lists the library functions
/tools/power/cpupower/po/
A Dcs.po15 "Language-Team: Czech <diskuze@lists.l10n.cz>\n"

Completed in 32 milliseconds