/linux-master/drivers/gpu/drm/nouveau/ |
H A D | nouveau_svm.c | 36 #include <linux/sort.h> 753 sort(buffer->fault, buffer->fault_nr, sizeof(*buffer->fault),
|
/linux-master/drivers/acpi/ |
H A D | processor_idle.c | 19 #include <linux/sort.h> 452 sort(&pr->power.states[1], max_cstate,
|
/linux-master/arch/mips/ |
H A D | Makefile | 476 for board in $(sort $(BOARDS)); do echo " $${board}"; done 487 $(foreach cfg,$(sort $(legacy_defconfigs)),
|
/linux-master/drivers/mtd/spi-nor/ |
H A D | sfdp.c | 10 #include <linux/sort.h> 336 * Comparison function used in the sort() call to sort in ascending order the 350 * spi_nor_sort_erase_mask() - sort erase mask 354 * Replicate the sort done for the map's erase types in BFPT: sort the erase 369 /* Replicate the sort done for the map's erase types. */ 378 * spi_nor_regions_sort_erase_types() - sort erase types in each region 383 * member in the erase_type array. It replicates the sort done for the map's 545 sort(erase_typ [all...] |
/linux-master/drivers/memory/tegra/ |
H A D | tegra20-emc.c | 25 #include <linux/sort.h> 444 sort(emc->timings, emc->num_timings, sizeof(*timing), cmp_timings,
|
/linux-master/fs/ubifs/ |
H A D | find.c | 17 #include <linux/sort.h> 756 sort(c->dirty_idx.arr, c->dirty_idx.cnt, sizeof(void *),
|
/linux-master/arch/x86/kernel/ |
H A D | e820.c | 17 #include <linux/sort.h> 363 sort(change_point, chg_nr, sizeof(*change_point), cpcompare, NULL);
|
/linux-master/fs/bcachefs/ |
H A D | btree_write_buffer.c | 14 #include <linux/sort.h> 279 * We first sort so that we can detect and skip redundant updates, and 379 sort(wb->flushing.keys.data,
|
H A D | recovery.c | 31 #include <linux/sort.h> 243 sort(keys_sorted.data, keys_sorted.nr,
|
/linux-master/arch/x86/kvm/ |
H A D | pmu.c | 18 #include <linux/sort.h> 963 sort(&filter->events, filter->nevents, sizeof(filter->events[0]),
|
/linux-master/drivers/crypto/marvell/octeontx/ |
H A D | otx_cptvf_algs.c | 21 #include <linux/sort.h> 1657 sort(se_devices.desc, count, sizeof(struct cpt_device_desc), 1672 sort(ae_devices.desc, count, sizeof(struct cpt_device_desc),
|
/linux-master/fs/gfs2/ |
H A D | quota.c | 44 #include <linux/sort.h> 943 sort(qda, num_qd, sizeof(struct gfs2_quota_data *), sort_qd, NULL); 1107 sort(ip->i_qadata->qa_qd, ip->i_qadata->qa_qd_num,
|
/linux-master/tools/perf/util/ |
H A D | callchain.c | 6 * sort them in an rbtree. 28 #include "sort.h" 353 if (!strcmp(var, "sort-key")){ 357 pr_err("Invalid callchain sort key: %s\n", value); 440 * sort them by hit 512 param->sort = sort_chain_graph_abs; 515 param->sort = sort_chain_graph_rel; 519 param->sort = sort_chain_flat; 710 * binary but with some sort of address randomization technique, thus we need
|
H A D | hist.h | 291 int64_t (*sort)(struct perf_hpp_fmt *fmt, member in struct:perf_hpp_fmt
|
H A D | block-info.c | 6 #include "sort.h" 355 fmt->sort = block_total_cycles_pct_sort;
|
/linux-master/arch/m68k/math-emu/ |
H A D | fp_scan.S | 106 | sort out fmovecr, keep data size in %d1
|
/linux-master/scripts/ |
H A D | get_dvb_firmware | 924 @components = sort @components;
|
H A D | sphinx-pre-install | 92 foreach my $prog (sort keys %missing) { 711 @activates = sort {$b cmp $a} @activates;
|
/linux-master/drivers/net/wireless/rsi/ |
H A D | rsi_mgmt.h | 20 #include <linux/sort.h>
|
/linux-master/tools/perf/scripts/python/ |
H A D | netdev-times.py | 180 all_event_list.sort(key=cmp_to_key(lambda a,b :a[EINFO_IDX_TIME] < b[EINFO_IDX_TIME]))
|
/linux-master/drivers/md/bcache/ |
H A D | btree.c | 18 * as keys are inserted we only sort the pages that have not yet been written. 114 /* If not a leaf node, always sort */ 116 bch_btree_sort(&b->keys, &b->c->sort); 118 bch_btree_sort_lazy(&b->keys, &b->c->sort); 214 bch_btree_sort_and_fix_extents(&b->keys, iter, &b->c->sort); 444 * sort) and we sorted down to a single set: 1178 bch_btree_sort_into(&b->keys, &n->keys, &b->c->sort);
|
H A D | bcache.h | 11 * it's about 95% plumbed through. A cache set and its cache devices is sort of 695 struct bset_sort_state sort; member in struct:cache_set
|
/linux-master/tools/testing/selftests/cgroup/ |
H A D | test_cpuset_prs.sh | 375 sort | uniq -u)
|
/linux-master/fs/btrfs/ |
H A D | volumes.h | 12 #include <linux/sort.h>
|
/linux-master/tools/testing/selftests/rcutorture/bin/ |
H A D | torture.sh | 635 sort $T/xz-todo-all $T/xz-todo-copy | uniq -u > $T/xz-todo
|