Searched refs:sort (Results 1 - 25 of 318) sorted by last modified time
1234567891011>>
/linux-master/kernel/bpf/ |
H A D | verifier.c | 20 #include <linux/sort.h> 2492 sort(env->subprog_info, env->subprog_cnt, 2687 sort(tab->descs, tab->nr_descs, sizeof(tab->descs[0]), 2843 sort(tab->descs, tab->nr_descs, sizeof(tab->descs[0]), 2868 sort(tab->descs, tab->nr_descs, sizeof(tab->descs[0]),
|
H A D | syscall.c | 33 #include <linux/sort.h>
|
/linux-master/fs/btrfs/ |
H A D | volumes.c | 5195 * sort the devices in descending order by max_avail, total_avail 5411 * now sort the devices by hole size / available space 5413 sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
|
H A D | extent-tree.c | 11 #include <linux/sort.h>
|
/linux-master/arch/x86/net/ |
H A D | bpf_jit_comp.c | 13 #include <linux/sort.h> 3142 sort(funcs, num_funcs, sizeof(funcs[0]), cmp_ips, NULL);
|
/linux-master/fs/bcachefs/ |
H A D | btree_node_scan.c | 15 #include <linux/sort.h> 355 sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_cookie, NULL); 375 sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_pos, NULL);
|
H A D | recovery.c | 31 #include <linux/sort.h> 243 sort(keys_sorted.data, keys_sorted.nr,
|
H A D | sysfs.c | 40 #include <linux/sort.h>
|
H A D | super-io.c | 25 #include <linux/sort.h>
|
H A D | ec.c | 26 #include <linux/sort.h> 1556 sort(sizes, nr, sizeof(unsigned), unsigned_cmp, NULL);
|
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 | btree_journal_iter.c | 10 #include <linux/sort.h> 497 /* sort and dedup all keys in the journal: */ 546 sort(keys->data, keys->nr, sizeof(keys->data[0]), journal_sort_key_cmp, NULL);
|
H A D | replicas.c | 9 #include <linux/sort.h>
|
H A D | alloc_background.c | 30 #include <linux/sort.h>
|
/linux-master/scripts/ |
H A D | Makefile.build | 45 # $(sort ...) is used here to remove duplicated words and excessive spaces. 46 hostprogs := $(sort $(hostprogs)) 52 # $(sort ...) is used here to remove duplicated words and excessive spaces. 53 userprogs := $(sort $(userprogs)) 71 # subdir-builtin and subdir-modorder may contain duplications. Use $(sort ...) 72 subdir-builtin := $(sort $(filter %/built-in.a, $(real-obj-y))) 73 subdir-modorder := $(sort $(filter %/modules.order, $(obj-m))) 74 subdir-dtbslist := $(sort $(filter %/dtbs-list, $(dtb-y))) 505 existing-targets := $(wildcard $(sort $(targets))) 510 obj-dirs := $(sort [all...] |
/linux-master/ |
H A D | Makefile | 1102 clean-dirs := $(sort . Documentation \ 1164 $(sort $(KBUILD_LDS) $(KBUILD_VMLINUX_OBJS) $(KBUILD_VMLINUX_LIBS)): . ; 1547 boards := $(sort $(notdir $(boards))) 1549 board-dirs := $(sort $(notdir $(board-dirs:/=))) 1687 boards-per-dir = $(sort $(notdir $(wildcard $(srctree)/arch/$(SRCARCH)/configs/$*/*_defconfig))) 1888 single-ko := $(sort $(filter %.ko, $(MAKECMDGOALS))) 2002 -name '*.[hcS]' -type f -print | sort \ 2007 -name '*.[hcS]' -type f -print | sort \ 2049 existing-targets := $(wildcard $(sort $(targets)))
|
/linux-master/virt/kvm/ |
H A D | kvm_main.c | 49 #include <linux/sort.h>
|
/linux-master/fs/smb/client/ |
H A D | smb2ops.c | 13 #include <linux/sort.h>
|
/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/vhost/ |
H A D | vhost.c | 26 #include <linux/sort.h>
|
/linux-master/kernel/trace/ |
H A D | trace_events.c | 22 #include <linux/sort.h>
|
H A D | bpf_trace.c | 23 #include <linux/sort.h>
|
/linux-master/drivers/gpu/drm/msm/disp/dpu1/ |
H A D | dpu_core_perf.c | 11 #include <linux/sort.h>
|
/linux-master/tools/testing/selftests/net/mptcp/ |
H A D | mptcp_join.sh | 472 done | sort -n
|
/linux-master/arch/riscv/kernel/vdso/ |
H A D | Makefile | 65 cmd_vdsosym = $(NM) $< | $(gen-vdsosym) | LC_ALL=C sort > $@
|
Completed in 427 milliseconds
1234567891011>>