Searched refs:sorted (Results 1 - 25 of 56) sorted by last modified time

123

/linux-master/mm/
H A Dvmscan.c4353 int sorted = 0; local
4386 sorted += delta;
4412 __count_vm_events(PGREFILL, sorted);
4415 __count_memcg_events(memcg, PGREFILL, sorted);
/linux-master/fs/ext4/
H A Dxattr.c42 * entry descriptors are kept sorted. In inodes, they are unsorted. The
324 void *end, int name_index, const char *name, int sorted)
344 if (cmp <= 0 && (sorted || cmp == 0))
323 xattr_find_entry(struct inode *inode, struct ext4_xattr_entry **pentry, void *end, int name_index, const char *name, int sorted) argument
/linux-master/drivers/gpu/drm/amd/display/dc/dml2/
H A Ddml2_dc_resource_mgmt.c453 bool sorted, swapped; local
463 sorted = true;
465 sorted = false;
469 while (!sorted) {
484 sorted = false;
486 sorted = true;
/linux-master/tools/net/ynl/
H A Dynl-gen-rst.py417 for filename in sorted(os.listdir(index_dir)):
H A Dynl-gen-c.py739 self.inherited = [c_lower(x) for x in sorted(self._inherited)]
1025 # Dicts are sorted, this will make struct last
1642 for anest in sorted(all_multi):
1658 for anest in sorted(all_multi):
1677 for anest in sorted(array_nests):
1694 for anest in sorted(multi_attrs):
2713 for _, struct in sorted(parsed.pure_nested_structs.items()):
2717 for attr_set, struct in sorted(parsed.pure_nested_structs.items()):
2742 for _, struct in sorted(parsed.pure_nested_structs.items()):
2746 for attr_set, struct in sorted(parse
[all...]
H A Dethtool.py233 for f in sorted(available):
/linux-master/fs/bcachefs/
H A Dbtree_types.h90 * Sets of sorted keys - the real btree node - plus a binary search tree
471 btree_path_idx_t *sorted;
406 btree_path_idx_t *sorted; member in struct:btree_trans
H A Dbtree_io.c484 * Returns true if we sorted (i.e. invalidated iterators
993 struct btree_node *sorted;
1199 sorted = btree_bounce_alloc(c, btree_buf_bytes(b), &used_mempool);
1200 sorted->keys.u64s = 0;
1204 b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter);
1206 u64s = le16_to_cpu(sorted->keys.u64s);
1207 *sorted = *b->data;
1208 sorted->keys.u64s = cpu_to_le16(u64s);
1209 swap(sorted, b->data);
1215 btree_bounce_free(c, btree_buf_bytes(b), used_mempool, sorted);
980 struct btree_node *sorted; local
[all...]
H A Dbtree_write_buffer.c217 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 Dbtree_iter.h125 ? trans->paths + trans->sorted[idx]
134 ? trans->paths + trans->sorted[idx - 1]
140 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
151 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
158 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
H A Ddebug.c39 struct bset *sorted, *inmemory = &b->data->keys; local
67 sorted = &n_sorted->keys;
69 if (inmemory->u64s != sorted->u64s ||
71 sorted->start,
83 bch2_dump_bset(c, v, sorted, 0);
106 if (inmemory->_data[j] != sorted->_data[j])
H A Dbtree_iter.c1018 btree_path_idx_t idx = trans->sorted[i];
1638 btree_path_idx_t *sorted = p;
1639 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t));
1649 rcu_assign_pointer(trans->sorted, sorted);
2738 BUG_ON(trans->sorted[path->sorted_idx] != i);
2742 unsigned idx = trans->sorted[i];
2782 * mostly sorted.
2790 if (btree_path_cmp(trans->paths + trans->sorted[
1552 btree_path_idx_t *sorted = p; local
[all...]
/linux-master/tools/perf/util/
H A Dannotate.c852 static bool sorted; local
854 if (!sorted) {
856 sorted = true;
H A Dsymbol-elf.c337 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...]
H A Drb_resort.h15 * 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...]
/linux-master/fs/cramfs/
H A Dinode.c761 int sorted; local
764 sorted = CRAMFS_SB(dir->i_sb)->flags & CRAMFS_FLAG_SORTED_DIRS;
774 /* Try to take advantage of sorted directories */
775 if (sorted && (dentry->d_name.name[0] < name[0]))
804 if (sorted)
/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/gr/
H A Dgf100.c1921 bool sorted; local
1947 sorted = false;
1949 while (!sorted) {
1950 for (sorted = true, i = 0; i < gr->gpc_nr - 1; i++) {
1956 sorted = false;
/linux-master/tools/perf/pmu-events/
H A Djevents.py141 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):
/linux-master/tools/testing/kunit/
H A Dkunit_kernel.py198 raise ConfigError(arch + ' is not a valid arch, options are ' + str(sorted(options)))
/linux-master/scripts/clang-tools/
H A Dgen_compile_commands.py224 json.dump(sorted(compile_commands, key=lambda x: x["file"]), f, indent=2, sort_keys=True)
/linux-master/tools/perf/scripts/python/
H A Dexported-sql-viewer.py1428 return sorted(cpus)
1927 self.child_items = sorted(collection.hregions.values(), key=GraphDataRegionOrdinal)
3851 indexes = sorted(view.selectedIndexes(), key=RowColumnKey)
4455 immediately. More records can be fetched using the Fetch bar provided. Columns can be sorted,
H A Darm-cs-trace-disasm.py127 print(' '.join(['%s=%s'%(k,str(v))for k,v in sorted(event_fields_dict.items())]))
/linux-master/tools/perf/
H A Dbuiltin-lock.c286 static struct rb_root sorted; /* place to store intermediate data */ variable in typeref:struct:rb_root
287 static struct rb_root result; /* place to store sorted data */
399 struct rb_node **rb = &sorted.rb_node;
438 rb_insert_color(&st->rb, &sorted);
/linux-master/Documentation/sphinx/
H A Dautomarkup.py107 sorted_matches = sorted(chain(*match_iterators), key=lambda m: m.start())
H A Dcdomain.py114 matches = sorted(chain(*match_iterators), key=lambda m: m.start())

Completed in 359 milliseconds

123