Home
last modified time | relevance | path

Searched full:unsorted (Results 1 – 25 of 48) sorted by relevance

12

/linux-6.12.1/Documentation/mm/
Dindex.rst27 Unsorted Documentation
30 This is a collection of unsorted documents about the Linux memory management
/linux-6.12.1/Documentation/devicetree/bindings/mtd/partitions/
Dlinux,ubi.yaml7 title: Unsorted Block Images
10 UBI ("Unsorted Block Images") is a volume management system for raw
/linux-6.12.1/drivers/md/dm-vdo/indexer/
Dradix-sort.c71 /* Insert the next unsorted key into an array of sorted keys. */
74 /* Pull the unsorted key out, freeing up the array slot. */ in insert_key()
75 sort_key_t unsorted = *next; in insert_key() local
79 (compare(unsorted, next[0], task.offset, task.length) < 0)) in insert_key()
83 next[1] = unsorted; in insert_key()
/linux-6.12.1/Documentation/
Dindex.rst108 There are several unsorted documents that don't seem to fit on other parts
115 Unsorted documentation <staging/index>
/linux-6.12.1/Documentation/staging/
Dindex.rst3 Unsorted Documentation
/linux-6.12.1/drivers/cpufreq/
Dfreq_table.c323 pr_debug("Freq table is unsorted\n"); in set_freq_table_sorted()
333 pr_debug("Freq table is unsorted\n"); in set_freq_table_sorted()
/linux-6.12.1/tools/bpf/bpftool/Documentation/
Dbpftool-btf.rst31 | *FORMAT* := { **raw** | **c** [**unsorted**] }
67 formatting, the output is sorted by default. Use the **unsorted** option
/linux-6.12.1/drivers/mtd/ubi/
DKconfig3 tristate "Enable UBI - Unsorted block images"
/linux-6.12.1/include/uapi/linux/
Dvbox_err.h133 /* misc. unsorted codes */
/linux-6.12.1/tools/include/linux/
Dbtf_ids.h62 * The BTF_ID_LIST macro defines pure (unsorted) list
/linux-6.12.1/Documentation/cpu-freq/
Dcpufreq-stats.rst99 and so can be sorted (ascending or descending) or unsorted. The output here
/linux-6.12.1/Documentation/filesystems/
Dubifs.rst10 UBIFS file-system stands for UBI File System. UBI stands for "Unsorted
/linux-6.12.1/include/linux/
Dbtf_ids.h75 * The BTF_ID_LIST macro defines pure (unsorted) list
/linux-6.12.1/kernel/kcsan/
Ddebugfs.c117 /* Sort array if it is unsorted, and then do a binary search. */ in kcsan_skip_report_debugfs()
/linux-6.12.1/drivers/net/ethernet/netronome/nfp/nfpcore/
Dnfp_hwinfo.c80 * Unsorted.
/linux-6.12.1/lib/zstd/compress/
Dzstd_lazy.c60 * sort one already inserted but unsorted position
84 … /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *larg… in ZSTD_insertDUBT1()
263 /* reach end of unsorted candidates list */ in ZSTD_DUBT_findBestMatch()
267 DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted", in ZSTD_DUBT_findBestMatch()
277 /* nullify last candidate if it's still unsorted in ZSTD_DUBT_findBestMatch()
281 DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u", in ZSTD_DUBT_findBestMatch()
/linux-6.12.1/scripts/dtc/
Ddtx_diff34 -u unsorted, do not sort DTx
/linux-6.12.1/drivers/video/fbdev/core/
Dfb_defio.c107 * unsorted page lists instead. in fb_deferred_io_pageref_get()
/linux-6.12.1/fs/nfs_common/
Dnfsacl.c21 * of (e_tag, e_id). Solaris ACLs are unsorted.
/linux-6.12.1/fs/xfs/scrub/
Dxfarray.c751 * the unsorted values between a[lo + 1] and a[end[i]], and we tweak the
752 * current stack frame to point to the unsorted values between a[beg[i]] and
/linux-6.12.1/mm/
Ddmapool.c17 * least 'size' bytes. Free blocks are tracked in an unsorted singly-linked
/linux-6.12.1/drivers/iio/test/
Diio-test-gts.c73 /* Keep the gain and time tables unsorted to test the sorting */
/linux-6.12.1/tools/bpf/bpftool/
Dbtf.c917 } else if (is_prefix(*argv, "unsorted")) { in do_dump()
1320 " FORMAT := { raw | c [unsorted] }\n" in do_help()
/linux-6.12.1/Documentation/userspace-api/
Ddma-buf-alloc-exchange.rst225 The resulting modifier list is unsorted; the order is not significant.
/linux-6.12.1/include/media/drv-intf/
Dsaa7146.h188 /* unsorted defines */

12