/linux-master/tools/perf/util/ |
H A 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 [all...] |
H A D | symbol-elf.c | 337 u32 *sorted; member in struct:rel_info 346 idx = ri->sorted ? ri->sorted[idx] : idx; 381 size_t sz = sizeof(ri->sorted[0]); 384 ri->sorted = calloc(ri->nr_entries, sz); 385 if (!ri->sorted) 388 ri->sorted[i] = i; 389 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); 431 zfree(&ri->sorted); 491 struct rela_dyn *sorted; member in struct:rela_dyn_info [all...] |
/linux-master/drivers/comedi/drivers/ni_routing/tools/ |
H A D | make_blank_csv.py | 20 fieldnames = [sig for sig_val, sig in sorted(value_to_name.items())]
|
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 | 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] )
|
/linux-master/drivers/md/bcache/ |
H A D | debug.c | 34 struct bset *ondisk, *sorted, *inmemory; local 44 sorted = b->c->verify_data->keys.set->data; 57 bch_bio_map(bio, sorted); 62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); 65 sorted = v->keys.set->data; 67 if (inmemory->keys != sorted->keys || 69 sorted->start, 81 bch_dump_bset(&v->keys, sorted, 0); 95 if (inmemory->d[j] != sorted->d[j])
|
/linux-master/tools/perf/scripts/python/ |
H A D | syscall-counts.py | 63 for id, val in sorted(syscalls.items(),
|
H A D | syscall-counts-by-pid.py | 73 for id, val in sorted(syscalls[comm][pid].items(),
|
H A D | sctop.py | 81 for id, val in sorted(syscalls.items(),
|
H A D | failed-syscalls-by-pid.py | 78 for ret, val in sorted(syscalls[comm][pid][id].items(), key = lambda kv: (kv[1], kv[0]), reverse = True):
|
H A D | mem-phys-addr.py | 49 for mem_type, count in sorted(load_mem_type_cnt.most_common(), \ 63 #/proc/iomem is sorted
|
H A D | stackcollapse.py | 10 # The file is sorted according to the first field. 125 list = sorted(lines)
|
H A D | event_analyzing_sample.py | 192 print (' '.join(['%s=%s'%(k,str(v))for k,v in sorted(event_fields_dict.items())]))
|
/linux-master/fs/bcachefs/ |
H A D | btree_write_buffer_types.h | 51 DARRAY(struct wb_key_ref) sorted; member in struct:btree_write_buffer
|
H A D | btree_write_buffer.c | 217 darray_resize(&wb->sorted, wb->flushing.keys.size); 219 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { 225 wb->sorted.size - wb->flushing.keys.nr); 251 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); 272 wb->sorted.data[i].idx = i; 273 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree; 274 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos)); 276 wb->sorted.nr = wb->flushing.keys.nr; 280 * then we attempt to flush in sorted btree order, as this is most 292 wb_sort(wb->sorted [all...] |
H A D | disk_groups.c | 27 struct bch_disk_group *g, *sorted = NULL; local 69 sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL); 70 if (!sorted) 73 memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted)); 74 sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL); 76 for (g = sorted; g + 1 < sorted [all...] |
/linux-master/kernel/kcsan/ |
H A D | debugfs.c | 47 bool sorted; /* if elements are sorted */ member in struct:__anon502 53 .sorted = false, 118 if (!report_filterlist.sorted) { 121 report_filterlist.sorted = true; 186 report_filterlist.sorted = false;
|
/linux-master/drivers/gpu/drm/i915/gt/uc/ |
H A D | selftest_guc_multi_lrc.c | 15 struct intel_engine_cs *sorted[MAX_ENGINE_INSTANCE + 1]; local 21 sorted[i] = engines[j]; 26 memcpy(*engines, *sorted,
|
/linux-master/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-master/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-master/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):
|
H A D | parse-maintainers.pl | 34 --output => sorted MAINTAINERS file to write (default: MAINTAINERS.new) 35 --section => new sorted MAINTAINERS file to write to (default: SECTION.new)
|
H A D | diffconfig | 18 distracting information. This utility produces sorted output with only the 128 new = sorted(b.keys())
|
/linux-master/tools/verification/dot2/ |
H A D | automata.py | 107 states = sorted(set(states)) 140 return sorted(set(events))
|
/linux-master/tools/perf/pmu-events/ |
H A D | jevents.py | 141 sorted_reversed_strings = sorted([x[::-1] for x in self.strings]) 177 # Emit all strings that aren't folded in a sorted manner. 178 for s in sorted(self.strings, key=string_cmp_key): 506 for event in sorted(_pending_events, key=event_cmp_key): 525 for (pmu, tbl_pmu) in sorted(pmus): 561 for metric in sorted(_pending_metrics, key=metric_cmp_key): 580 for (pmu, tbl_pmu) in sorted(pmus): 1189 for mgroup in sorted(_metricgroups): 1230 for item in sorted(os.scandir(path), key=lambda e: e.name):
|