| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | rb_resort.h | 15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
[all …]
|
| /kernel/linux/linux-4.19/tools/perf/util/ |
| D | rb_resort.h | 15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
[all …]
|
| /kernel/linux/linux-4.19/include/linux/ |
| D | util_macros.h | 19 * find_closest - locate the closest element in a sorted array
21 * @a: The array in which to look for the closest element. Must be sorted
30 * find_closest_descending - locate the closest element in a sorted array
32 * @a: The array in which to look for the closest element. Must be sorted
36 * Similar to find_closest() but 'a' is expected to be sorted in descending
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | util_macros.h | 19 * find_closest - locate the closest element in a sorted array
21 * @a: The array in which to look for the closest element. Must be sorted
30 * find_closest_descending - locate the closest element in a sorted array
32 * @a: The array in which to look for the closest element. Must be sorted
36 * Similar to find_closest() but 'a' is expected to be sorted in descending
|
| /kernel/linux/linux-4.19/drivers/md/bcache/ |
| D | debug.c | 34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
|
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| D | debug.c | 34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
|
| /kernel/linux/linux-5.10/tools/lib/traceevent/Documentation/ |
| D | libtraceevent-event_list.txt | 7 Get list of events, sorted by given criteria.
28 sorted by the _sort_type_ criteria. The last element of the array is NULL.
68 /* Failed to get the events, sorted by ID */
71 /* walk through the list of the events, sorted by ID */
79 /* Failed to get the events, sorted by name */
82 /* walk through the list of the events, sorted by name */
|
| /kernel/linux/linux-4.19/net/ceph/ |
| D | striper.c | 48 * Return the last extent with given objno (@object_extents is sorted
93 * Map a file extent to a sorted list of object extents.
104 * To keep @object_extents sorted, successive calls to this function
106 * are mapped using the same @object_extents must be sorted).
160 WARN(1, "%s: object_extents list not sorted!\n", in ceph_file_to_extents()
205 * Reverse map an object extent to a sorted list of file extents.
|
| /kernel/linux/linux-5.10/kernel/kcsan/ |
| D | debugfs.c | 42 bool sorted; /* if elements are sorted */ member
48 .sorted = false,
113 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
116 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
181 report_filterlist.sorted = false; in insert_report_filterlist()
|
| /kernel/linux/linux-5.10/net/ceph/ |
| D | striper.c | 48 * Return the last extent with given objno (@object_extents is sorted
93 * Map a file extent to a sorted list of object extents.
104 * To keep @object_extents sorted, successive calls to this function
106 * are mapped using the same @object_extents must be sorted).
160 WARN(1, "%s: object_extents list not sorted!\n", in ceph_file_to_extents()
205 * Reverse map an object extent to a sorted list of file extents.
|
| /kernel/linux/linux-5.10/tools/vm/ |
| D | slabinfo-gnuplot.sh | 14 # and generate graphs (totals, slabs sorted by size, slabs sorted
152 `cat "$in" | grep -A "$lines" 'Slabs sorted by loss' |\
161 `cat "$in" | grep -A "$lines" 'Slabs sorted by size' |\
|
| /kernel/linux/linux-5.10/lib/ |
| D | extable.c | 47 * The exception table needs to be sorted so that the binary
73 * If the exception table is sorted, any referring to the module init
113 * already sorted.
|
| /kernel/linux/linux-4.19/lib/ |
| D | extable.c | 50 * The exception table needs to be sorted so that the binary
76 * If the exception table is sorted, any referring to the module init
116 * already sorted.
|
| /kernel/linux/linux-4.19/tools/vm/ |
| D | slabinfo-gnuplot.sh | 21 # and generate graphs (totals, slabs sorted by size, slabs sorted
159 `cat "$in" | grep -A "$lines" 'Slabs sorted by loss' |\
168 `cat "$in" | grep -A "$lines" 'Slabs sorted by size' |\
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/spi/ |
| D | spi-sprd.txt | 11 - clocks: List of clock input name strings sorted in the same order
20 sorted in the same order as the dma-names property.
|
| /kernel/linux/linux-5.10/arch/sh/kernel/ |
| D | unwinder.c | 43 * "unwinder_list" is a linked-list of all available unwinders, sorted
81 * Enqueue the stack unwinder sorted by rating.
106 * Install the new stack unwinder on the unwinder list, which is sorted
|
| /kernel/linux/linux-4.19/arch/sh/kernel/ |
| D | unwinder.c | 42 * "unwinder_list" is a linked-list of all available unwinders, sorted
80 * Enqueue the stack unwinder sorted by rating.
105 * Install the new stack unwinder on the unwinder list, which is sorted
|
| /kernel/linux/linux-5.10/drivers/staging/comedi/drivers/ni_routing/tools/ |
| D | convert_py_to_csv.py | 24 fieldnames = [value_to_name[i] for i in sorted(D.keys())]
32 S = sorted(S.items(), key = lambda src_destD : src_destD[0])
|
| /kernel/linux/linux-4.19/scripts/ |
| D | checkkconfigsymbols.py | 160 for symbol in sorted(undefined_b):
163 files = sorted(undefined_b.get(symbol))
167 files = sorted(undefined_b.get(symbol) -
180 for symbol in sorted(undefined):
183 files = sorted(undefined.get(symbol))
360 for symbol in sorted(referenced_symbols):
|
| /kernel/linux/linux-5.10/scripts/ |
| D | checkkconfigsymbols.py | 160 for symbol in sorted(undefined_b):
163 files = sorted(undefined_b.get(symbol))
167 files = sorted(undefined_b.get(symbol) -
180 for symbol in sorted(undefined):
183 files = sorted(undefined.get(symbol))
360 for symbol in sorted(referenced_symbols):
|
| /kernel/linux/linux-5.10/net/mac80211/ |
| D | rc80211_minstrel_ht.h | 46 /* sorted rate set within a MCS group*/
70 /* overall sorted rate set */
|
| /kernel/linux/linux-5.10/Documentation/kbuild/ |
| D | kconfig.rst | 190 When searching, symbols are sorted thus:
192 - first, exact matches, sorted alphabetically (an exact match
194 - then, other matches, sorted alphabetically.
201 of which only ATH5K and ATH9K match exactly and so are sorted
203 sorted in alphabetical order.
|
| /kernel/linux/linux-4.19/arch/x86/include/asm/ |
| D | intel-family.h | 12 * group to keep logically sorted out in chronological order. Within
13 * that group keep the CPUID for the variants sorted by model number.
|
| /kernel/linux/linux-4.19/net/mac80211/ |
| D | rc80211_minstrel_ht.h | 55 /* sorted rate set within a MCS group*/
73 /* overall sorted rate set */
|
| /kernel/linux/linux-5.10/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/ |
| D | Core.py | 35 for idx in sorted(flag_fields[event_name][field_name]['values']):
52 for idx in sorted(symbolic_fields[event_name][field_name]['values']):
|