| /linux/tools/perf/util/ |
| H A D | rb_resort.h | |
| H A D | dsos.c | 22 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()
|
| H A D | symbol-elf.c | 280 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
442 zfree(&di->sorted); in exit_rela_dyn()
[all …]
|
| /linux/drivers/md/bcache/ |
| H A 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/fs/bcachefs/ |
| H A D | btree_write_buffer.c | 233 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()
328 wb_sort(wb->sorted.data, wb->sorted.nr); in bch2_btree_write_buffer_flush_locked()
330 darray_for_each(wb->sorted, i) { in bch2_btree_write_buffer_flush_locked()
[all …]
|
| H A 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()
|
| H A D | btree_iter.c | 1039 btree_path_idx_t idx = trans->sorted[i]; in bch2_btree_path_traverse_all()
1683 btree_path_idx_t *sorted = p; in btree_paths_realloc() local
1684 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t)); in btree_paths_realloc()
1694 rcu_assign_pointer(trans->sorted, sorted); in btree_paths_realloc()
2990 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2994 unsigned idx = trans->sorted[i]; in btree_trans_verify_sorted_refs()
3042 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
3043 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
3044 swap(trans->sorted[i], trans->sorted[i + 1]); in __bch2_btree_trans_sort_paths()
3045 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()
[all …]
|
| H A D | btree_write_buffer_types.h | 51 DARRAY(struct wb_key_ref) sorted;
|
| H A D | debug.c | 43 struct bset *sorted, *inmemory = &b->data->keys; in bch2_btree_verify_replica() local
73 sorted = &n_sorted->keys; in bch2_btree_verify_replica()
75 if (inmemory->u64s != sorted->u64s || in bch2_btree_verify_replica()
77 sorted->start, in bch2_btree_verify_replica()
89 bch2_dump_bset(c, v, sorted, 0); in bch2_btree_verify_replica()
112 if (inmemory->_data[j] != sorted->_data[j]) in bch2_btree_verify_replica()
|
| /linux/kernel/kcsan/ |
| H A D | debugfs.c | 47 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/Documentation/admin-guide/mm/damon/ |
| H A 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/scripts/ |
| H A 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/drivers/gpu/drm/i915/gt/uc/ |
| H A 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/drivers/comedi/drivers/ni_routing/tools/ |
| H A 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] )
|
| H A 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])
|
| H A D | make_blank_csv.py | 20 fieldnames = [sig for sig_val, sig in sorted(value_to_name.items())]
|
| /linux/tools/verification/rvgen/rvgen/ |
| H A D | ltl2k.py | 31 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 D | automata.py | 108 states = sorted(set(states))
141 return sorted(set(events))
|
| /linux/tools/hv/ |
| H A D | lsvmbus | 71 chn_vp_mapping = sorted(
91 vmbus_dev_list = sorted(vmbus_dev_list, key=lambda d: int(d.vmbus_id))
|
| /linux/tools/perf/pmu-events/ |
| H A D | jevents.py | 144 sorted_reversed_strings = sorted([x[::-1] for x in self.strings])
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/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/ |
| H A 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/tools/power/pm-graph/ |
| H A D | sleepgraph.py | 468 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(self.dmesg.keys()):
[all …]
|
| /linux/drivers/gpu/drm/hisilicon/ |
| H A D | Kconfig | 4 # Please keep this list sorted alphabetically
|
| /linux/Documentation/kbuild/ |
| H A 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/tools/perf/scripts/python/ |
| H A D | syscall-counts.py | 63 for id, val in sorted(syscalls.items(),
|