Home
last modified time | relevance | path

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

123456

/linux/drivers/md/bcache/
H A Ddebug.c34 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/fs/bcachefs/
H A Dbtree_write_buffer.c233 darray_resize(&wb->sorted, wb->flushing.keys.size); in move_keys_from_inc_to_flushing()
235 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { in move_keys_from_inc_to_flushing()
241 wb->sorted.size - wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
267 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
308 wb->sorted.data[i].idx = i; in bch2_btree_write_buffer_flush_locked()
309 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree; in bch2_btree_write_buffer_flush_locked()
310 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos)); in bch2_btree_write_buffer_flush_locked()
312 wb->sorted.nr = wb->flushing.keys.nr; in bch2_btree_write_buffer_flush_locked()
316 * then we attempt to flush in sorted btree order, as this is most in bch2_btree_write_buffer_flush_locked()
328 wb_sort(wb->sorted in bch2_btree_write_buffer_flush_locked()
[all...]
H A Ddisk_groups.c26 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 in bch2_sb_disk_groups_validate()
[all...]
H A Dbtree_write_buffer_types.h51 DARRAY(struct wb_key_ref) sorted;
/linux/kernel/kcsan/
H A Ddebugfs.c47 bool sorted; /* if elements are sorted */ member
112 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
115 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
183 report_filterlist.sorted = false; in insert_report_filterlist()
/linux/drivers/gpu/drm/i915/gt/uc/
H A Dselftest_guc_multi_lrc.c15 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/Documentation/admin-guide/mm/damon/
H A Dlru_sort.rst16 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
[all...]
/linux/scripts/
H A Dcheckkconfigsymbols.py162 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):
H A Dtest_doc_build.py370 for cur_ver in sorted(vers):
395 for ver, elapsed_time in sorted(self.built_time.items()):
502 sphinx_versions = sorted(list(SPHINX_REQUIREMENTS.keys()))
/linux/drivers/comedi/drivers/ni_routing/tools/
H A Dconvert_csv_to_c.py40 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] )
H A Dconvert_py_to_csv.py23 fieldnames = [value_to_name[i] for i in sorted(D.keys())]
31 S = sorted(S.items(), key = lambda src_destD : src_destD[0])
H A Dmake_blank_csv.py20 fieldnames = [sig for sig_val, sig in sorted(value_to_name.items())]
/linux/tools/verification/rvgen/rvgen/
H A Dltl2k.py31 for label in sorted(node.labels):
84 for a in sorted(self.atoms):
146 for o in sorted(node.outgoing):
158 for o in sorted(node.outgoing):
H A Dautomata.py108 states = sorted(set(states))
141 return sorted(set(events))
/linux/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/
H A DCore.py35 for idx in sorted(flag_fields[event_name][field_name]['values']):
52 for idx in sorted(symbolic_fields[event_name][field_name]['values']):
/linux/tools/perf/util/
H A Ddsos.c22 dsos->sorted = true; in dsos__init()
39 dsos->sorted = true; in dsos__purge()
172 if (!dsos->sorted) { in __dsos__find_by_longname_id()
186 dsos->sorted = true; in __dsos__find_by_longname_id()
211 if (!dsos->sorted) { in __dsos__add()
335 * the array isn't sorted. in __dsos__addnew_id()
H A Dsymbol-elf.c280 u32 *sorted; member
289 idx = ri->sorted ? ri->sorted[idx] : idx; in get_rel_symidx()
324 size_t sz = sizeof(ri->sorted[0]); in sort_rel()
327 ri->sorted = calloc(ri->nr_entries, sz); in sort_rel()
328 if (!ri->sorted) in sort_rel()
331 ri->sorted[i] = i; in sort_rel()
332 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); in sort_rel()
374 zfree(&ri->sorted); in exit_rel()
434 struct rela_dyn *sorted; member
[all...]
H A Ddsos.h17 * Collection of DSOs as an array for iteration speed, but sorted for O(n)
25 bool sorted; member
/linux/tools/perf/pmu-events/
H A Djevents.py144 sorted_reversed_strings = sorted([x[::-1] for x in self.strings])
180 # Emit all strings that aren't folded in a sorted manner.
181 for s in sorted(self.strings, key=string_cmp_key):
527 for event in sorted(_pending_events, key=event_cmp_key):
549 for (pmu, tbl_pmu) in sorted(pmus):
585 for metric in sorted(_pending_metrics, key=metric_cmp_key):
604 for (pmu, tbl_pmu) in sorted(pmus):
1300 for mgroup in sorted(_metricgroups):
1341 for item in sorted(os.scandir(path), key=lambda e: e.name):
/linux/drivers/gpu/drm/hisilicon/
H A DKconfig4 # Please keep this list sorted alphabetically
/linux/scripts/lib/abi/
H A Dabi_regex.py197 for t in sorted(self.data.items(), key=lambda x: x[0]):
228 biggestd_keys = sorted(self.regex_group.keys(),
/linux/tools/power/pm-graph/
H A Dsleepgraph.py468 for name in sorted(out):
595 for i in sorted(self.tracefuncs):
648 for arg in sorted(args):
679 for i in sorted(args):
693 for name in sorted(self.kprobes):
1031 for dev in sorted(props):
1067 for dev in sorted(props):
1144 for key in sorted(before):
1545 return sorted(self.dmesg, key=lambda k:self.dmesg[k]['order'])
1548 for phase in sorted(sel
[all...]
/linux/tools/perf/scripts/python/
H A Dsyscall-counts.py63 for id, val in sorted(syscalls.items(),
H A Dsctop.py81 for id, val in sorted(syscalls.items(),
/linux/Documentation/kbuild/
H A Dkconfig.rst185 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.

123456