Searched full:sorted (Results 1 – 25 of 275) sorted by relevance
1234567891011
| /linux-3.3/lib/ |
| D | extable.c | 19 * The exception table needs to be sorted so that the binary
45 * If the exception table is sorted, any referring to the module init
69 * already sorted.
|
| D | bsearch.c | 24 * contents of the array should already be in ascending sorted order
|
| D | list_sort.c | 101 struct list_head *part[MAX_LIST_LENGTH_BITS+1]; /* sorted partial lists in list_sort()
255 "sorted\n"); in list_sort_test()
|
| /linux-3.3/arch/sh/kernel/ |
| D | unwinder.c | 42 * "unwinder_list" is a linked-list of all available unwinders, sorted
80 * Enqueue the stack unwinder sorted by rating.
105 * Install the new stack unwinder on the unwinder list, which is sorted
|
| /linux-3.3/drivers/acpi/acpica/ |
| D | nsrepair2.c | 126 * Names that must be packages, but cannot be sorted:
129 * be moved or sorted. These index values are used for _BQC and _BCM.
561 * Entries (sub-packages) in the _PSS Package must be sorted by power in acpi_ns_repair_PSS()
563 * incorrectly sorted, sort it. We sort by cpu_frequency, since this in acpi_ns_repair_PSS()
574 * We now know the list is correctly sorted by CPU frequency. Check if in acpi_ns_repair_PSS()
610 * RETURN: Status. AE_OK if the list is valid and is sorted correctly or
613 * DESCRIPTION: Check if the package list is valid and sorted correctly by the
680 * The list must be sorted in the specified order. If we detect a in acpi_ns_check_sorted_list()
694 "%s: Repaired unsorted list - now sorted by %s\n", in acpi_ns_check_sorted_list()
|
| /linux-3.3/arch/arm/mach-pxa/ |
| D | Kconfig | 9 comment "Marvell Dev Platforms (sorted by hardware release time)"
26 comment "Intel/Marvell Dev Platforms (sorted by hardware release time)"
70 comment "Third Party Dev Platforms (sorted by vendor name)"
280 comment "End-user Products (sorted by vendor name)"
|
| /linux-3.3/arch/powerpc/platforms/powernv/ |
| D | pci.h | 125 /* Sorted list of used PE's, sorted at
|
| /linux-3.3/fs/xfs/ |
| D | xfs_alloc_btree.h | 30 * There are two on-disk btrees, one sorted by blockno and one sorted
|
| /linux-3.3/fs/jfs/ |
| D | jfs_dtree.h | 156 s8 stbl[8]; /* 8: sorted entry index table */
175 * sorted entry slot index table (stbl):
233 /* get sorted entry table of the page */
|
| /linux-3.3/fs/cramfs/ |
| D | inode.c | 426 int sorted; in cramfs_lookup() local
429 sorted = CRAMFS_SB(dir->i_sb)->flags & CRAMFS_FLAG_SORTED_DIRS; in cramfs_lookup()
439 /* Try to take advantage of sorted directories */ in cramfs_lookup()
440 if (sorted && (dentry->d_name.name[0] < name[0])) in cramfs_lookup()
469 if (sorted) in cramfs_lookup()
|
| /linux-3.3/include/linux/ |
| D | plist.h | 2 * Descending-priority-sorted double-linked list
19 * This is a priority-sorted list of nodes; each node has a
46 * The nodes on the prio_list list are sorted by priority to simplify
|
| D | gpio-fan.h | 30 * This array _must_ be sorted in ascending rpm order.
|
| /linux-3.3/tools/power/cpupower/ |
| D | ToDo | 1 ToDos sorted by priority:
|
| /linux-3.3/lib/zlib_inflate/ |
| D | inftrees.c | 79 The codes are sorted by computing a count of codes for each length, in zlib_inflate_table()
81 sorted table, and then entering the symbols in order in the sorted in zlib_inflate_table()
82 table. The sorted table is work[], with that space being provided by in zlib_inflate_table()
|
| /linux-3.3/scripts/ |
| D | profile2linkerlist.pl | 4 # Takes a (sorted) output of readprofile and turns it into a list suitable for
|
| /linux-3.3/Documentation/networking/ |
| D | fib_trie.txt | 7 with 'hlist' with routing table entries sorted by prefix length.
121 the fib_semantic_match in the leaf's sorted prefix hlist.
|
| /linux-3.3/tools/perf/util/ |
| D | help.h | 23 /* Here we require that excludes is a sorted list. */
|
| /linux-3.3/net/mac80211/ |
| D | rc80211_pid.h | 230 /* Map sorted rates to rates in ieee80211_hw_mode. */
233 /* Map rates in ieee80211_hw_mode to sorted rates. */
|
| /linux-3.3/fs/ubifs/ |
| D | gc.c | 165 * first and sorted by length in descending order. Directory entry nodes go
166 * after inode nodes and are sorted in ascending hash valuer order.
231 * Data nodes are then sorted in block number order - this is important for
236 * Non-data nodes are sorted as follows.
237 * o First go inode nodes - they are sorted in descending length order.
238 * o Then go directory entry nodes - they are sorted in hash order, which
|
| /linux-3.3/fs/squashfs/ |
| D | namei.c | 42 * Directories are sorted, and can contain a directory index to speed up
45 * in each metadata block. Directories are sorted in alphabetical order,
|
| /linux-3.3/tools/perf/scripts/python/ |
| D | syscall-counts.py | 57 for id, val in sorted(syscalls.iteritems(), key = lambda(k, v): (v, k), \
|
| D | sctop.py | 68 for id, val in sorted(syscalls.iteritems(), key = lambda(k, v): (v, k), \
|
| D | syscall-counts-by-pid.py | 67 for id, val in sorted(syscalls[comm][pid].iteritems(), \
|
| /linux-3.3/drivers/uwb/ |
| D | est.c | 236 * right position (entries are sorted by type, event_high, vendor and
249 * table is sorted by growing type-event_high-vendor-product, a zero
298 * to fill in the gap. This is needed to keep the list sorted; no
|
| /linux-3.3/include/media/ |
| D | v4l2-common.h | 96 0-terminated array of control IDs. Each array must be sorted low to high
98 be sorted, from low class IDs to high class IDs. */
|
1234567891011