| /linux/Documentation/mm/ |
| H A D | index.rst | 27 Unsorted Documentation
30 This is a collection of unsorted documents about the Linux memory management
|
| /linux/drivers/md/dm-vdo/indexer/ |
| H A D | radix-sort.c | 71 /* 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/Documentation/devicetree/bindings/mtd/partitions/ |
| H A D | linux,ubi.yaml | 7 title: Unsorted Block Images
10 UBI ("Unsorted Block Images") is a volume management system for raw
|
| /linux/Documentation/ |
| H A D | index.rst | 108 There are several unsorted documents that don't seem to fit on other parts
115 Unsorted documentation <staging/index>
|
| /linux/Documentation/staging/ |
| H A D | index.rst | 3 Unsorted Documentation
|
| /linux/drivers/cpufreq/ |
| H A D | freq_table.c | 314 pr_debug("Freq table is unsorted\n"); in set_freq_table_sorted()
324 pr_debug("Freq table is unsorted\n"); in set_freq_table_sorted()
|
| /linux/tools/bpf/bpftool/Documentation/ |
| H A D | bpftool-btf.rst | 31 | *FORMAT* := { **raw** | **c** [**unsorted**] }
67 formatting, the output is sorted by default. Use the **unsorted** option
|
| /linux/drivers/mtd/ubi/ |
| H A D | Kconfig | 3 tristate "Enable UBI - Unsorted block images"
|
| /linux/include/uapi/linux/ |
| H A D | vbox_err.h | 133 /* misc. unsorted codes */
|
| /linux/Documentation/cpu-freq/ |
| H A D | cpufreq-stats.rst | 99 and so can be sorted (ascending or descending) or unsorted. The output here
|
| /linux/tools/include/linux/ |
| H A D | btf_ids.h | 62 * The BTF_ID_LIST macro defines pure (unsorted) list
|
| /linux/Documentation/filesystems/ |
| H A D | ubifs.rst | 10 UBIFS file-system stands for UBI File System. UBI stands for "Unsorted
|
| /linux/drivers/net/ethernet/netronome/nfp/nfpcore/ |
| H A D | nfp_hwinfo.c | 80 * Unsorted.
|
| /linux/kernel/kcsan/ |
| H A D | debugfs.c | 111 /* Sort array if it is unsorted, and then do a binary search. */ in kcsan_skip_report_debugfs()
|
| /linux/lib/zstd/compress/ |
| H A D | zstd_lazy.c | 70 * sort one already inserted but unsorted position
95 … /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *larg… in ZSTD_insertDUBT1()
276 /* reach end of unsorted candidates list */ in ZSTD_DUBT_findBestMatch()
280 DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted", in ZSTD_DUBT_findBestMatch()
290 /* nullify last candidate if it's still unsorted in ZSTD_DUBT_findBestMatch()
294 DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u", in ZSTD_DUBT_findBestMatch()
|
| /linux/scripts/dtc/ |
| H A D | dtx_diff | 34 -u unsorted, do not sort DTx
|
| /linux/fs/xfs/scrub/ |
| H A D | xfarray.c | 751 * 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/mm/ |
| H A D | dmapool.c | 17 * least 'size' bytes. Free blocks are tracked in an unsorted singly-linked
|
| /linux/drivers/iio/test/ |
| H A D | iio-test-gts.c | 73 /* Keep the gain and time tables unsorted to test the sorting */
|
| /linux/tools/bpf/bpftool/ |
| H A D | btf.c | 1032 } else if (is_prefix(*argv, "unsorted")) { in do_dump()
1449 " FORMAT := { raw | c [unsorted] }\n" in do_help()
|
| /linux/Documentation/userspace-api/ |
| H A D | dma-buf-alloc-exchange.rst | 225 The resulting modifier list is unsorted; the order is not significant.
|
| /linux/include/media/drv-intf/ |
| H A D | saa7146.h | 188 /* unsorted defines */
|
| /linux/drivers/thermal/ |
| H A D | cpufreq_cooling.c | 575 pr_err("%s: unsorted frequency tables are not supported\n", in __cpufreq_cooling_register()
|
| /linux/tools/perf/Documentation/ |
| H A D | perf-script.txt | 82 --dump-unsorted-raw-trace=::
|
| /linux/arch/powerpc/kernel/ |
| H A D | cacheinfo.c | 112 * A cache object is on two lists: an unsorted global list
|