| /linux-6.12.1/tools/perf/util/ |
| D | rb_resort.h | 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); \
108 if (sorted) { \
109 sorted->entries = RB_ROOT; \
[all …]
|
| D | dsos.c | 22 dsos->sorted = true; in dsos__init()
39 dsos->sorted = true; in dsos__purge()
170 if (!dsos->sorted) { in __dsos__find_by_longname_id()
184 dsos->sorted = true; in __dsos__find_by_longname_id()
209 if (!dsos->sorted) { in __dsos__add()
|
| D | symbol-elf.c | 337 u32 *sorted; member
346 idx = ri->sorted ? ri->sorted[idx] : idx; in get_rel_symidx()
381 size_t sz = sizeof(ri->sorted[0]); in sort_rel()
384 ri->sorted = calloc(ri->nr_entries, sz); in sort_rel()
385 if (!ri->sorted) in sort_rel()
388 ri->sorted[i] = i; in sort_rel()
389 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); in sort_rel()
431 zfree(&ri->sorted); in exit_rel()
491 struct rela_dyn *sorted; member
499 zfree(&di->sorted); in exit_rela_dyn()
[all …]
|
| D | dsos.h | 25 bool sorted; member
|
| /linux-6.12.1/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()
|
| /linux-6.12.1/fs/bcachefs/ |
| D | btree_write_buffer.c | 232 darray_resize(&wb->sorted, wb->flushing.keys.size); in move_keys_from_inc_to_flushing()
234 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { in move_keys_from_inc_to_flushing()
240 wb->sorted.size - wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
266 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
292 wb->sorted.data[i].idx = i; in bch2_btree_write_buffer_flush_locked()
293 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree; in bch2_btree_write_buffer_flush_locked()
294 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos)); in bch2_btree_write_buffer_flush_locked()
296 wb->sorted.nr = wb->flushing.keys.nr; in bch2_btree_write_buffer_flush_locked()
312 wb_sort(wb->sorted.data, wb->sorted.nr); in bch2_btree_write_buffer_flush_locked()
314 darray_for_each(wb->sorted, i) { in bch2_btree_write_buffer_flush_locked()
[all …]
|
| D | disk_groups.c | 26 struct bch_disk_group *g, *sorted = NULL; in bch2_sb_disk_groups_validate() local
68 sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL); in bch2_sb_disk_groups_validate()
69 if (!sorted) in bch2_sb_disk_groups_validate()
72 memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted)); in bch2_sb_disk_groups_validate()
73 sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL); in bch2_sb_disk_groups_validate()
75 for (g = sorted; g + 1 < sorted + nr_groups; g++) in bch2_sb_disk_groups_validate()
85 kfree(sorted); in bch2_sb_disk_groups_validate()
|
| D | btree_iter.c | 1019 btree_path_idx_t idx = trans->sorted[i]; in bch2_btree_path_traverse_all()
1656 btree_path_idx_t *sorted = p; in btree_paths_realloc() local
1657 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t)); in btree_paths_realloc()
1667 rcu_assign_pointer(trans->sorted, sorted); in btree_paths_realloc()
2767 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2771 unsigned idx = trans->sorted[i]; in btree_trans_verify_sorted_refs()
2819 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
2820 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
2821 swap(trans->sorted[i], trans->sorted[i + 1]); in __bch2_btree_trans_sort_paths()
2822 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()
[all …]
|
| D | btree_write_buffer_types.h | 51 DARRAY(struct wb_key_ref) sorted;
|
| /linux-6.12.1/kernel/kcsan/ |
| D | debugfs.c | 47 bool sorted; /* if elements are sorted */ member
53 .sorted = false,
118 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
121 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
186 report_filterlist.sorted = false; in insert_report_filterlist()
|
| /linux-6.12.1/Documentation/admin-guide/mm/damon/ |
| D | lru_sort.rst | 16 systems, LRU lists are normally not proactively sorted but partially and
17 reactively sorted for special events including specific user requests, system
225 Number of hot memory regions that tried to be LRU-sorted.
230 Total bytes of hot memory regions that tried to be LRU-sorted.
235 Number of hot memory regions that successfully be LRU-sorted.
240 Total bytes of hot memory regions that successfully be LRU-sorted.
250 Number of cold memory regions that tried to be LRU-sorted.
255 Total bytes of cold memory regions that tried to be LRU-sorted.
260 Number of cold memory regions that successfully be LRU-sorted.
265 Total bytes of cold memory regions that successfully be LRU-sorted.
|
| /linux-6.12.1/drivers/gpu/drm/i915/gt/uc/ |
| D | selftest_guc_multi_lrc.c | 15 struct intel_engine_cs *sorted[MAX_ENGINE_INSTANCE + 1]; in logical_sort() local
21 sorted[i] = engines[j]; in logical_sort()
26 memcpy(*engines, *sorted, in logical_sort()
|
| /linux-6.12.1/scripts/ |
| D | checkkconfigsymbols.py | 162 for symbol in sorted(undefined_b):
165 files = sorted(undefined_b.get(symbol))
169 files = sorted(undefined_b.get(symbol) -
182 for symbol in sorted(undefined):
185 files = sorted(undefined.get(symbol))
362 for symbol in sorted(referenced_symbols):
|
| /linux-6.12.1/drivers/comedi/drivers/ni_routing/tools/ |
| D | convert_csv_to_c.py | 40 D0 = sorted(D0.items(), key=lambda i: eval(i[0], comedi_h.__dict__, Locals))
43 D1 = sorted(D1_D.items(), key=lambda i: eval(i[0], comedi_h.__dict__, Locals))
89 D0 = sorted(D0.items(), key=lambda i: eval(i[0], comedi_h.__dict__, Locals))
233 sheets = sorted(self.items(), key=lambda i : tuple(i[0].split('-')[::-1]) )
421 sheets = sorted(self.items(), key=lambda i : i[0] )
|
| D | convert_py_to_csv.py | 23 fieldnames = [value_to_name[i] for i in sorted(D.keys())]
31 S = sorted(S.items(), key = lambda src_destD : src_destD[0])
|
| D | make_blank_csv.py | 20 fieldnames = [sig for sig_val, sig in sorted(value_to_name.items())]
|
| /linux-6.12.1/tools/hv/ |
| D | lsvmbus | 71 chn_vp_mapping = sorted(
91 vmbus_dev_list = sorted(vmbus_dev_list, key=lambda d: int(d.vmbus_id))
|
| /linux-6.12.1/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.
|
| /linux-6.12.1/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']):
|
| /linux-6.12.1/tools/perf/pmu-events/ |
| D | jevents.py | 141 sorted_reversed_strings = sorted([x[::-1] for x in self.strings])
178 for s in sorted(self.strings, key=string_cmp_key):
508 for event in sorted(_pending_events, key=event_cmp_key):
530 for (pmu, tbl_pmu) in sorted(pmus):
566 for metric in sorted(_pending_metrics, key=metric_cmp_key):
585 for (pmu, tbl_pmu) in sorted(pmus):
1197 for mgroup in sorted(_metricgroups):
1238 for item in sorted(os.scandir(path), key=lambda e: e.name):
|
| /linux-6.12.1/tools/verification/dot2/ |
| D | automata.py | 107 states = sorted(set(states))
140 return sorted(set(events))
|
| /linux-6.12.1/drivers/gpu/drm/hisilicon/ |
| D | Kconfig | 4 # Please keep this list sorted alphabetically
|
| /linux-6.12.1/tools/power/pm-graph/ |
| D | sleepgraph.py | 457 for name in sorted(out):
584 for i in sorted(self.tracefuncs):
637 for arg in sorted(args):
668 for i in sorted(args):
682 for name in sorted(self.kprobes):
1008 for dev in sorted(props):
1044 for dev in sorted(props):
1121 for key in sorted(before):
1522 return sorted(self.dmesg, key=lambda k:self.dmesg[k]['order'])
1525 for phase in sorted(self.dmesg.keys()):
[all …]
|
| /linux-6.12.1/Documentation/kbuild/ |
| D | kconfig.rst | 185 When searching, symbols are sorted thus:
187 - first, exact matches, sorted alphabetically (an exact match
189 - then, other matches, sorted alphabetically.
196 of which only ATH5K and ATH9K match exactly and so are sorted
198 sorted in alphabetical order.
|
| /linux-6.12.1/tools/perf/scripts/python/ |
| D | syscall-counts.py | 63 for id, val in sorted(syscalls.items(),
|