Searched refs:sorted (Results 1 - 200 of 323) sorted by relevance

12

/linux-4.4.14/drivers/gpu/drm/vc4/
H A DMakefile3 # Please keep these build lists sorted!
/linux-4.4.14/include/linux/
H A Dutil_macros.h18 * find_closest - locate the closest element in a sorted array
20 * @a: The array in which to look for the closest element. Must be sorted
29 * find_closest_descending - locate the closest element in a sorted array
31 * @a: The array in which to look for the closest element. Must be sorted
35 * Similar to find_closest() but 'a' is expected to be sorted in descending
H A Dgpio-fan.h30 * This array _must_ be sorted in ascending rpm order.
H A Dplist.h2 * 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
H A Dvmalloc.h46 struct rb_node rb_node; /* address sorted rbtree */
47 struct list_head list; /* address sorted list */
H A Dpxa2xx_ssp.h198 LPSS_LPT_SSP, /* Keep LPSS types sorted with lpss_platforms[] */
H A Dmm_types.h304 /* linked list of VM areas per task, sorted by address */
/linux-4.4.14/drivers/md/bcache/
H A Ddebug.c33 struct bset *ondisk, *sorted, *inmemory; bch_btree_verify() local
43 sorted = b->c->verify_data->keys.set->data; bch_btree_verify()
55 bch_bio_map(bio, sorted); bch_btree_verify()
60 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); bch_btree_verify()
63 sorted = v->keys.set->data; bch_btree_verify()
65 if (inmemory->keys != sorted->keys || bch_btree_verify()
67 sorted->start, bch_btree_verify()
78 bch_dump_bset(&v->keys, sorted, 0); bch_btree_verify()
92 if (inmemory->d[j] != sorted->d[j])
H A Dbset.h39 * A bset is an array of bkeys laid out contiguously in memory in sorted order,
53 * to search entire btree nodes and iterate over them in sorted order.
56 * in a btree node in sorted order, starting from either keys after a specific
184 /* The actual btree node, with pointers to each sorted set */
217 * Sets of sorted keys - the real btree node - plus a binary search tree
H A Dextents.c8 * Buckets containing cached data are kept on a heap sorted by priority;
16 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
H A Dbcache.h122 * means each set of keys we write is sorted, but the node is not.
124 * We maintain this log structure in memory - keeping 1Mb of keys sorted would
127 * each sorted set. But we do merge written sets together lazily, so the cost of
H A Dbset.c2 * Code for working with individual keys, and sorted sets of keys with in a
1176 pr_debug("sorted %i keys", out->keys); btree_mergesort()
H A Dbtree.c8 * Buckets containing cached data are kept on a heap sorted by priority;
16 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
487 * sort) and we sorted down to a single set: bch_btree_node_write()
/linux-4.4.14/arch/s390/mm/
H A Dextable.c10 * already sorted.
34 * The exception table needs to be sorted so that the binary
69 * If the exception table is sorted, any referring to the module init
/linux-4.4.14/lib/
H A Dextable.c19 * 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.
H A Dbsearch.c24 * contents of the array should already be in ascending sorted order
H A Dtimerqueue.c36 * Adds the timer node to the timerqueue, sorted by the
H A Dlist_sort.c108 struct list_head *part[MAX_LIST_LENGTH_BITS+1]; /* sorted partial lists list_sort()
256 pr_err("error: list is not sorted\n"); list_sort_test()
H A Dplist.c4 * Descending-priority-sorted double-linked list
/linux-4.4.14/arch/xtensa/include/asm/
H A Dsysmem.h22 * Bank array is sorted by .start.
/linux-4.4.14/tools/perf/util/
H A Dhelp.h23 /* Here we require that excludes is a sorted list. */
H A Dannotate.h115 * lines is allocated, percentages calculated and all sorted by percentage
H A Dcallchain.h60 struct rb_root rb_root; /* sorted output tree of children */
H A Ddwarf-aux.h104 /* Walker on lines (Note: line number will not be sorted) */
H A Ddso.h128 struct rb_root root; /* rbtree root sorted by long name */
137 struct rb_node rb_node; /* rbtree node sorted by long name */
/linux-4.4.14/arch/x86/mm/
H A Dextable.c79 * already sorted.
103 * The exception table needs to be sorted so that the binary
153 * If the exception table is sorted, any referring to the module init
H A Damdtopology.c160 pr_err("Node map not sorted %Lx,%Lx\n", amd_numa_init()
/linux-4.4.14/drivers/gpu/drm/i915/
H A DMakefile5 # Please keep these build lists sorted!
H A Di915_cmd_parser.c397 * Register whitelists, sorted by increasing register offset.
574 DRM_ERROR("CMD: table not sorted ring=%d table=%d entry=%d cmd=0x%08X prev=0x%08X\n", validate_cmds_sorted()
598 DRM_ERROR("CMD: table not sorted ring=%d entry=%d reg=0x%08X prev=0x%08X\n", check_sorted()
/linux-4.4.14/tools/vm/
H A Dslabinfo-gnuplot.sh21 # and generate graphs (totals, slabs sorted by size, slabs sorted
159 `cat "$in" | grep -A "$lines" 'Slabs sorted by loss' |\
168 `cat "$in" | grep -A "$lines" 'Slabs sorted by size' |\
H A Dslabinfo.c1307 printf("\nSlabs sorted by size\n"); xtotals()
1314 printf("\nSlabs sorted by loss\n"); xtotals()
/linux-4.4.14/net/mac80211/
H A Drc80211_minstrel_ht.h58 /* sorted rate set within a MCS group*/
76 /* overall sorted rate set */
/linux-4.4.14/arch/sh/kernel/
H A Dunwinder.c42 * "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
H A Dtraps_32.c532 return; /* sorted */ do_address_error()
/linux-4.4.14/scripts/
H A Dcheckkconfigsymbols.py137 for feature in sorted(undefined_b):
140 files = sorted(undefined_b.get(feature))
147 files = sorted(undefined_b.get(feature) -
161 for feature in sorted(undefined):
162 files = sorted(undefined.get(feature))
251 for feature in sorted(referenced_features):
H A Ddiffconfig17 distracting information. This utility produces sorted output with only the
127 new = sorted(b.keys())
H A Dsortextable.h209 /* We sorted it, clear the flag. */ do_func()
/linux-4.4.14/drivers/power/
H A Dab8500_bmdata.c11 * Note that the res_to_temp table must be strictly sorted by falling resistance
132 * Note that the res_to_temp table must be strictly sorted by falling
154 * Note that the batres_vs_temp table must be strictly sorted by falling
168 * Note that the batres_vs_temp table must be strictly sorted by falling
/linux-4.4.14/drivers/clk/samsung/
H A Dclk-pll.h90 /* NOTE: Rate table should be kept sorted in descending order. */
H A Dclk-exynos5250.c287 * NOTE: Following table is sorted by (clock domain, register address,
383 * NOTE: Following table is sorted by (clock domain, register address,
475 * NOTE: Following table is sorted by (clock domain, register address,
702 /* sorted in descending order */
711 /* sorted in descending order */
725 /* sorted in descending order */
H A Dclk-exynos3250.c242 * NOTE: Following table is sorted by register address in ascending
329 * NOTE: Following table is sorted by register address in ascending
426 * NOTE: Following table is sorted by register address in ascending
864 * NOTE: Following table is sorted by register address in ascending
883 * NOTE: Following table is sorted by register address in ascending
937 * NOTE: Following table is sorted by register address in ascending
957 * NOTE: Following table is sorted by register address in ascending
H A Dclk-s3c2410.c163 /* sorted in descending order */
231 /* sorted in descending order */
H A Dclk-exynos4415.c282 * NOTE: Following table is sorted by register address in ascending
432 * NOTE: Following table is sorted by register address in ascending
571 * NOTE: Following table is sorted by register address in ascending
/linux-4.4.14/arch/alpha/mm/
H A Dextable.c27 * The exception table needs to be sorted so that the binary
/linux-4.4.14/arch/arm/kvm/
H A Dcoproc_a15.c31 * Important: Must be sorted ascending by CRn, CRM, Op1, Op2 and with 64-bit
H A Dcoproc_a7.c34 * Important: Must be sorted ascending by CRn, CRM, Op1, Op2 and with 64-bit
/linux-4.4.14/tools/perf/scripts/python/
H A Dfailed-syscalls-by-pid.py77 for ret, val in sorted(syscalls[comm][pid][id].iteritems(), key = lambda(k, v): (v, k), reverse = True):
H A Dsctop.py73 for id, val in sorted(syscalls.iteritems(), key = lambda(k, v): (v, k), \
H A Dsyscall-counts-by-pid.py72 for id, val in sorted(syscalls[comm][pid].iteritems(), \
H A Dsyscall-counts.py62 for id, val in sorted(syscalls.iteritems(), key = lambda(k, v): (v, k), \
H A Devent_analyzing_sample.py189 print ' '.join(['%s=%s'%(k,str(v))for k,v in sorted(event_fields_dict.items())])
/linux-4.4.14/drivers/staging/lustre/lnet/selftest/
H A Dtimer.c46 * Timers are implemented as a sorted queue of expiry times. The queue
49 * sorted by increasing expiry time. The number of slots is 2**7 (128),
/linux-4.4.14/drivers/staging/lustre/lustre/fld/
H A Dfld_internal.h76 * fld cache entries are sorted on range->lsr_start field. */
104 * sorted fld entries. */
/linux-4.4.14/include/uapi/linux/
H A Dcramfs_fs.h72 #define CRAMFS_FLAG_SORTED_DIRS 0x00000002 /* sorted dirs */
H A Dmedia-bus-format.h25 * per pixel and order of subsamples. Numerical values are sorted using generic
H A Dbcache.h346 * sorted
H A Dfdreg.h128 * Beware: the fdc type list is roughly sorted by increasing features.
H A Dzorro_ids.h4 * Please keep sorted.
/linux-4.4.14/arch/ia64/mm/
H A Dextable.c40 * Sort the exception table. It's usually already sorted, but there
/linux-4.4.14/arch/arm64/kvm/
H A Dsys_regs_generic_v8.c54 * Important: Must be sorted ascending by Op0, Op1, CRn, CRm, Op2
/linux-4.4.14/tools/testing/selftests/
H A DMakefile30 #Please keep the TARGETS list alphabetically sorted
/linux-4.4.14/fs/jfs/
H A Djfs_dtree.h156 s8 stbl[8]; /* 8: sorted entry index table */
175 * sorted entry slot index table (stbl):
233 /* get sorted entry table of the page */
H A Djfs_dtree.c37 * each directory page maintains a sorted entry index table
38 * which stores the start slot index of sorted entries
639 /* get sorted entry table of the page */ dtSearch()
1420 /* compute sorted entry table at start of extent data area */ dtSplitPage()
1443 * reverse sorted data, that is, split the tree left, dtSplitPage()
4072 s8 *sstbl, *dstbl; /* sorted entry table */ dtMoveEntry()
/linux-4.4.14/fs/cramfs/
H A Dinode.c437 int sorted; cramfs_lookup() local
440 sorted = CRAMFS_SB(dir->i_sb)->flags & CRAMFS_FLAG_SORTED_DIRS; cramfs_lookup()
450 /* Try to take advantage of sorted directories */ cramfs_lookup()
451 if (sorted && (dentry->d_name.name[0] < name[0])) cramfs_lookup()
480 if (sorted) cramfs_lookup()
/linux-4.4.14/drivers/acpi/acpica/
H A Dnsrepair2.c141 * Names that must be packages, but cannot be sorted:
144 * be moved or sorted. These index values are used for _BQC and _BCM.
496 * Entries (subpackages) in the _CST Package must be sorted by the acpi_ns_repair_CST()
689 * Entries (subpackages) in the _PSS Package must be sorted by power acpi_ns_repair_PSS()
691 * incorrectly sorted, sort it. We sort by cpu_frequency, since this acpi_ns_repair_PSS()
702 * We now know the list is correctly sorted by CPU frequency. Check if acpi_ns_repair_PSS()
783 * RETURN: Status. AE_OK if the list is valid and is sorted correctly or
786 * DESCRIPTION: Check if the package list is valid and sorted correctly by the
856 * The list must be sorted in the specified order. If we detect a acpi_ns_check_sorted_list()
871 "%s: Repaired unsorted list - now sorted by %s\n", acpi_ns_check_sorted_list()
H A Dnspredef.c183 * objects are sorted correctly (if required) or buffer objects have acpi_ns_check_return_value()
/linux-4.4.14/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.h79 * {root}) in diff_set sorted ascendingly
/linux-4.4.14/drivers/media/rc/keymaps/
H A Drc-imon-mce.c17 /* keys sorted mostly by frequency of use to optimize lookups */
H A Drc-imon-pad.c22 /* keys sorted mostly by frequency of use to optimize lookups */
/linux-4.4.14/drivers/gpu/drm/msm/mdp/mdp4/
H A Dmdp4_lvds_pll.c44 /* NOTE: keep sorted highest freq to lowest: */
/linux-4.4.14/lib/zlib_inflate/
H A Dinftrees.c79 The codes are sorted by computing a count of codes for each length, zlib_inflate_table()
81 sorted table, and then entering the symbols in order in the sorted zlib_inflate_table()
82 table. The sorted table is work[], with that space being provided by zlib_inflate_table()
/linux-4.4.14/kernel/events/
H A Dcallchain.c68 * until that gets sorted out. alloc_callchain_buffers()
/linux-4.4.14/arch/arm/mach-omap2/
H A Dsdrc.c81 * Note 1: the sdrc_init_params_cs[01] must be sorted rate descending.
H A Dopp2420_data.c53 * Note: This table needs to be sorted, fastest to slowest.
H A Dopp2430_data.c51 * Note: This table needs to be sorted, fastest to slowest.
/linux-4.4.14/sound/pci/hda/
H A Dhda_auto_parser.h66 /* sorted in the order of Front/Surr/CLFE/Side */
/linux-4.4.14/tools/power/cpupower/utils/helpers/
H A Dtopology.c63 * Array is sorted after ->pkg, ->core, then ->cpu
/linux-4.4.14/drivers/misc/mic/scif/
H A Dscif_rma_list.c25 * Insert a temp window to the temp registration list sorted by va_for_temp.
55 * Insert a window to the self registration list sorted by offset.
/linux-4.4.14/fs/squashfs/
H A Dnamei.c42 * Directories are sorted, and can contain a directory index to speed up
45 * in each metadata block. Directories are sorted in alphabetical order,
/linux-4.4.14/drivers/uwb/
H A Dest.c236 * right position (entries are sorted by type, event_high, vendor and
249 * table is sorted by growing type-event_high-vendor-product, a zero
296 * to fill in the gap. This is needed to keep the list sorted; no
/linux-4.4.14/arch/arm/
H A DMakefile141 # Text offset. This list is sorted numerically by address in order to
155 # Machine directory name. This list is sorted alphanumerically
226 # Platform directory name. This list is sorted alphanumerically
/linux-4.4.14/drivers/hwmon/
H A Dab8500.c54 * and res_to_temp table is strictly sorted by falling resistance values.
H A Dlm75.c39 enum lm75_type { /* keep sorted in alphabetical order */
H A Dntc_thermistor.c61 * A compensation table should be sorted by the values of .ohm
/linux-4.4.14/arch/um/kernel/
H A Ddyn.lds.S131 from the crtend.o file until after the sorted ctors.
/linux-4.4.14/fs/nfsd/
H A Dnfs4acl.c376 int sorted = 0, i; sort_pacl_range() local
380 while (!sorted) { sort_pacl_range()
381 sorted = 1; sort_pacl_range()
385 sorted = 0; sort_pacl_range()
/linux-4.4.14/net/dccp/
H A Dackvec.h93 * The list as a whole is sorted in descending order by @avr_ack_seqno.
H A Dfeat.c429 * - list is sorted in increasing order of feature number (faster lookup)
981 * the sorted list until after the traversal. dccp_feat_finalise_settings()
/linux-4.4.14/kernel/
H A Dextable.c38 /* Cleared by build time tools if the table is already sorted. */
H A Dkallsyms.c225 /* Do a binary search on the sorted kallsyms_addresses array. */ get_symbol_pos()
/linux-4.4.14/include/net/
H A Dprotocol.h20 * Alan Cox : Cleaned up, and sorted types.
/linux-4.4.14/fs/ubifs/
H A Dgc.c165 * 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
H A Ddebug.c1167 * In UBIFS indexing B-tree colliding keys has to be sorted in binary order of
2294 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2298 * This function returns zero if the list of data nodes is sorted correctly,
2361 * dbg_check_nondata_nodes_order - check that list of data nodes is sorted.
2365 * This function returns zero if the list of non-data nodes is sorted correctly,
2406 /* Inode nodes are sorted in descending size order */ dbg_check_nondata_nodes_order()
2415 * This is either a dentry or xentry, which should be sorted in dbg_check_nondata_nodes_order()
/linux-4.4.14/drivers/usb/host/
H A Dehci-timer.c51 * Rather than implementing a sorted list or tree of all pending events,
66 * Keep this list sorted by delay length, in the same order as
/linux-4.4.14/drivers/staging/lustre/lustre/ptlrpc/
H A Dpinger.c135 /* The timeout list is a increase order sorted list */ pinger_check_timeout()
424 * Note: the timeout list is an sorted list with increased timeout value.
/linux-4.4.14/arch/avr32/kernel/
H A Dsetup.c65 * struct resource and are kept sorted at all times.
456 * fact that all lists have been sorted. find_bootmap_pfn()
/linux-4.4.14/drivers/regulator/
H A D88pm800.c144 /* Ranges are sorted in ascending order. */
H A Dhi6421-regulator.c130 /* Ranges are sorted in ascending order. */
/linux-4.4.14/drivers/video/fbdev/aty/
H A Dradeon_accel.c275 * that when we have sorted things out on X side. radeonfb_engine_init()
/linux-4.4.14/drivers/video/fbdev/core/
H A Dfb_defio.c128 to keep the pagelist sorted */ fb_deferred_io_mkwrite()
/linux-4.4.14/drivers/isdn/mISDN/
H A Ddsp_audio.c197 /* generate alaw table, sorted by the linear value */ dsp_audio_generate_seven()
/linux-4.4.14/drivers/infiniband/hw/mthca/
H A Dmthca_profile.c134 * using the sorted order. mthca_make_profile()
/linux-4.4.14/drivers/gpu/host1x/
H A Dintr.c44 * add a waiter to a waiter queue, sorted by threshold
/linux-4.4.14/drivers/net/ethernet/mellanox/mlx4/
H A Dprofile.c147 * using the sorted order. mlx4_make_profile()
/linux-4.4.14/drivers/parport/
H A Dprobe.c160 * bytes short. Construct a sorted array of lengths to try. */ parport_read_device_id()
/linux-4.4.14/drivers/pinctrl/vt8500/
H A Dpinctrl-wm8650.c43 /* Please keep sorted by bank/bit */
H A Dpinctrl-vt8500.c42 /* Please keep sorted by bank/bit */
H A Dpinctrl-wm8750.c46 /* Please keep sorted by bank/bit */
H A Dpinctrl-wm8850.c46 /* Please keep sorted by bank/bit */
H A Dpinctrl-wm8505.c46 /* Please keep sorted by bank/bit */
/linux-4.4.14/drivers/gpu/drm/
H A Ddrm_info.c174 /* dev->filelist is sorted youngest first, but we want to present drm_clients_info()
/linux-4.4.14/drivers/acpi/
H A Dglue.c195 * Keep the list sorted by node_id so that the IDs of removed nodes can acpi_bind_one()
/linux-4.4.14/arch/x86/kernel/
H A Dvmlinux.lds.S251 * It is an array of IOMMUs which during run time gets sorted depending
H A De820.c76 * Note: this function only works correct if the e820 table is sorted and
680 * This function requires the e820 map to be sorted and without any
/linux-4.4.14/arch/alpha/kernel/
H A Dmodule.c161 /* The small sections were sorted to the end of the segment. apply_relocate_add()
/linux-4.4.14/fs/nfs_common/
H A Dnfsacl.c19 * - ACL entries in the kernel are kept sorted in ascending order
/linux-4.4.14/net/tipc/
H A Dnode.h99 * @list: links to adjacent nodes in sorted list of cluster's nodes
/linux-4.4.14/sound/core/
H A Ddevice.c62 /* insert the entry in an incrementally sorted list */ snd_device_new()
/linux-4.4.14/fs/dlm/
H A Ddir.c32 * offset into the sorted list of nodeid's to give the particular nodeid.
/linux-4.4.14/fs/xfs/libxfs/
H A Dxfs_bmap.h63 * The list is kept sorted on xbf_startblock.
H A Dxfs_da_format.h660 typedef struct xfs_attr_leaf_entry { /* sorted on key, not name */
682 xfs_attr_leaf_entry_t entries[1]; /* sorted on key, not name */
H A Dxfs_format.h1189 * There are two on-disk btrees, one sorted by blockno and one sorted
/linux-4.4.14/include/uapi/drm/
H A Dmsm_drm.h119 * NOTE that reloc's must be sorted by order of increasing submit_offset,
/linux-4.4.14/arch/powerpc/platforms/powernv/
H A Dpci.h181 /* Sorted list of used PE's, sorted at
/linux-4.4.14/net/ipv6/
H A Dsyncookies.c35 * one that accounts for common encap (PPPoe) overhead. Table must be sorted.
H A Dicmp.c802 /* until the v6 path can be better sorted assume failure and icmpv6_rcv()
/linux-4.4.14/tools/perf/tests/
H A Dvmlinux-kallsyms.c66 * kallsyms will be internally on demand sorted by name so that we can test__vmlinux_matches_kallsyms()
/linux-4.4.14/drivers/video/fbdev/matrox/
H A Dg450_pll.c466 sorted equally good frequencies from lower VCO __g450_setclk()
/linux-4.4.14/drivers/gpu/drm/ttm/
H A Dttm_bo_vm.c341 * bad for performance. Until that has been sorted out, use ttm_bo_mmap()
/linux-4.4.14/drivers/hid/usbhid/
H A Dhid-quirks.c25 * Alphabetically sorted blacklist by quirk type.
/linux-4.4.14/drivers/net/wireless/hostap/
H A Dhostap_info.c183 /* ScanResults are sorted: first ESS results in decreasing signal prism2_host_roaming()
/linux-4.4.14/drivers/net/wireless/ath/
H A Ddfs_pri_detector.c241 /* stop on too large pri (sorted list) */ pseq_handler_create_sequences()
/linux-4.4.14/drivers/cpufreq/
H A Dimx6q-cpufreq.c321 * freq_table initialised from OPP is therefore sorted in the imx6q_cpufreq_probe()
H A Dspeedstep-lib.c301 * The latter need to be sorted out as they don't speedstep_detect_processor()
/linux-4.4.14/drivers/block/drbd/
H A Ddrbd_vli.h125 * sorted ascending by number of total bits.
/linux-4.4.14/drivers/gpu/drm/msm/hdmi/
H A Dhdmi_phy_8960.c54 /* NOTE: keep sorted highest freq to lowest: */
/linux-4.4.14/arch/unicore32/mm/
H A Dinit.c353 * The banks are sorted previously in bootmem_init(). free_unused_memmap()
/linux-4.4.14/block/
H A Ddeadline-iosched.c63 * get the request after `rq' in sector-sorted order
H A Delevator.c295 * in a sorted RB tree.
/linux-4.4.14/net/sched/
H A Dsch_hfsc.c129 struct rb_root vt_tree; /* active children sorted by cl_vt */
131 struct rb_root cf_tree; /* active children sorted by cl_f */
189 * eligible tree holds backlogged classes being sorted by their eligible times.
255 * vttree holds holds backlogged child classes being sorted by their virtual
/linux-4.4.14/net/sunrpc/auth_gss/
H A Dgss_mech_switch.c252 * The returned array is not sorted by any policy. Callers should not
/linux-4.4.14/arch/powerpc/include/asm/
H A Dppc-opcode.h131 /* sorted alphabetically */
/linux-4.4.14/arch/powerpc/kernel/
H A Deeh_cache.c34 * PCI device address resources into a red-black tree, sorted
/linux-4.4.14/arch/powerpc/sysdev/xics/
H A Dxics-common.c89 * to be sorted properly for bare metal
/linux-4.4.14/arch/sparc/kernel/
H A Dcpumap.c181 * assumed to be sorted in ascending order based on node, core_id, and
/linux-4.4.14/arch/m68k/include/asm/
H A Doplib.h89 * These lists are returned pre-sorted, this should make your life easier
/linux-4.4.14/net/l2tp/
H A Dl2tp_core.h149 * sessions so incoming packets can be sorted out
/linux-4.4.14/tools/power/cpupower/utils/idle_monitor/
H A Dcpupower-monitor.c212 * Monitors get sorted in the same order the user passes them
/linux-4.4.14/tools/testing/selftests/rcutorture/bin/
H A Dkvm.sh177 # Create a file of test-name/#cpus pairs, sorted by decreasing #cpus.
/linux-4.4.14/net/sctp/
H A Dulpqueue.c426 /* The chunks are held in the reasm queue sorted by TSN. sctp_ulpq_retrieve_reassembled()
524 /* The chunks are held in the reasm queue sorted by TSN. sctp_ulpq_retrieve_partial()
623 /* The chunks are held in the reasm queue sorted by TSN. sctp_ulpq_retrieve_first()
/linux-4.4.14/arch/arm64/kernel/
H A Dcpufeature.c303 * sys_reg() encoding. With the array arm64_ftr_regs sorted in the
365 /* Keep the array sorted so that we can do the binary search */ sort_ftr_regs()
399 /* Before we start using the tables, make sure it is sorted */ init_cpu_features()
/linux-4.4.14/drivers/scsi/
H A Du14-34f.c147 * At initialization time "sorted/unsorted" is displayed instead
379 * commands in this queue are sorted by sector address. The sort is chosen
382 * command in the list to be sorted.
386 * distance between two adjacent requests is S/((Q-1) + 1), so the sorted
722 link_suffix = ", sorted"; u14_34f_slave_configure()
H A Deata.c191 * At initialization time "sorted/unsorted" is displayed instead
438 * commands in this queue are sorted by sector address. The sort is chosen
441 * command in the list to be sorted.
445 * distance between two adjacent requests is S/((Q-1) + 1), so the sorted
965 link_suffix = ", sorted"; eata2x_slave_configure()
/linux-4.4.14/drivers/media/radio/si4713/
H A Dsi4713.c118 * Values for limiter release time (sorted by second column)
146 * Values for audio compression release time (sorted by second column)
159 * Values for preemphasis (sorted by second column)
/linux-4.4.14/fs/ext4/
H A Dxattr.c41 * entry descriptors are kept sorted. In inodes, they are unsorted. The
248 const char *name, size_t size, int sorted) ext4_xattr_find_entry()
264 if (cmp <= 0 && (sorted || cmp == 0)) ext4_xattr_find_entry()
247 ext4_xattr_find_entry(struct ext4_xattr_entry **pentry, int name_index, const char *name, size_t size, int sorted) ext4_xattr_find_entry() argument
/linux-4.4.14/drivers/thermal/
H A Ddevfreq_cooling.c43 * @freq_table: Pointer to a table with the frequencies sorted in descending
H A Dcpu_cooling.c82 * conversion, sorted in ascending order.
/linux-4.4.14/drivers/video/fbdev/geode/
H A Dlxfb_core.c33 /* Most of these modes are sorted in ascending order, but
/linux-4.4.14/drivers/gpu/drm/rcar-du/
H A Drcar_du_crtc.c224 /* Insert the plane in the sorted planes array. */ rcar_du_crtc_update_planes()
/linux-4.4.14/drivers/pinctrl/sh-pfc/
H A Dcore.c400 * be sorted by pin numbers, and pins without a GPIO port must come sh_pfc_init_ranges()
/linux-4.4.14/fs/btrfs/
H A Dvolumes.h318 * The last one or two are p/q. These are sorted,
/linux-4.4.14/fs/xfs/
H A Dxfs_attr_list.c63 * Shortform attribute lists are not stored in hashval sorted order.
/linux-4.4.14/arch/powerpc/xmon/
H A Dppc.h53 /* The table itself is sorted by major opcode number, and is otherwise
/linux-4.4.14/arch/arm/kernel/
H A Dunwind.c109 * guaranteed to be sorted in ascending order by the linker.
/linux-4.4.14/Documentation/DocBook/media/
H A DMakefile396 # but we only want data types, all types, and sorted please.
/linux-4.4.14/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_device.c60 /* Please keep this sorted by increasing device id. */
/linux-4.4.14/net/ipv4/
H A Dsyncookies.c165 * on monitor location). Table must be sorted.
/linux-4.4.14/tools/thermal/tmon/
H A Dtui.c642 /* reverse the order here since trips are sorted show_sensors_w()
/linux-4.4.14/drivers/staging/wlan-ng/
H A Dprism2fw.c486 * a new chunk list. Assumes the s3data items are in sorted order.
803 * Note that data records are expected to be sorted into
/linux-4.4.14/drivers/net/wan/
H A Dhdlc_fr.c185 return NULL; /* the list is sorted */ find_pvc()
202 break; /* the list is sorted */ add_pvc()
/linux-4.4.14/lib/zlib_deflate/
H A Ddeftree.c401 * above are the tree nodes sorted by increasing frequency.
592 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ build_tree()
/linux-4.4.14/net/bridge/
H A Dbr_private.h91 * @vlist: sorted list of VLAN entries
120 * @vlan_list: sorted VLAN entry list
/linux-4.4.14/drivers/media/i2c/
H A Dadv7604.c224 /* sorted by DMT ID */
281 /* sorted by number of lines */
296 /* sorted by number of lines */
324 /* sorted by number of lines */
338 /* sorted by number of lines */
H A Dadv7842.c169 /* sorted by number of lines */
184 /* sorted by number of lines */
212 /* sorted by number of lines */
226 /* sorted by number of lines */
/linux-4.4.14/fs/ntfs/
H A Dlayout.h584 * Entries are sorted by attribute type. The flags describe whether the
951 * itself. The list is sorted: first by attribute type, second by attribute
1809 * data attribute. The $SII index is sorted by ascending security_id.
1814 * The $SDH index is sorted by security descriptor hash and is stored in a B+
1849 * boundaries, sorted by security_id in a B+ tree. Security descriptors cannot
1879 * The index entry key used in the $SDH index. The keys are sorted first by
2085 * The index entries are sorted by the index key file_id. The collation rule is
/linux-4.4.14/drivers/pci/hotplug/
H A Dibmphp_res.c184 * are not sorted. (no need since use mem node). To not change the entire code, we
383 * This function adds a range into a sorted list of ranges per bus for a particular
590 * based on their resource type and sorted by their starting addresses. It assigns
/linux-4.4.14/drivers/staging/lustre/lustre/osc/
H A Dosc_cl_internal.h649 /** list of pending oap pages. Pages in this list are NOT sorted. */
/linux-4.4.14/drivers/isdn/hardware/eicon/
H A Ddivasmain.c111 This table should be sorted by PCI device ID
/linux-4.4.14/drivers/gpu/drm/radeon/
H A Dradeon_cs.c69 /* Connect the sorted buckets in the output list. */ radeon_cs_buckets_get_list()
/linux-4.4.14/drivers/net/wireless/p54/
H A Deeprom.c241 * usually all lists in the eeprom are mostly sorted. p54_update_channel_param()
/linux-4.4.14/drivers/gpu/drm/msm/mdp/mdp5/
H A Dmdp5_crtc.c412 /* assign a stage based on sorted zpos property */
/linux-4.4.14/arch/x86/pci/
H A Dmmconfig-shared.c55 /* keep list sorted by segment and starting bus number */ list_add_sorted()
/linux-4.4.14/arch/arm/boot/dts/
H A DMakefile7 # Keep at91 dtb files sorted alphabetically for each SoC
/linux-4.4.14/fs/jffs2/
H A Ddir.c73 /* We keep the dirent list sorted in increasing order of name hash,
/linux-4.4.14/net/sunrpc/
H A Dauth.c210 * The returned array is not sorted by any policy. Callers should not
/linux-4.4.14/fs/notify/
H A Dmark.c266 * inodes and vfsmounts are sorted so that priorities of corresponding groups
/linux-4.4.14/arch/powerpc/perf/
H A Dpower8-pmu.c521 /* Table of alternatives, sorted by column 0 */
/linux-4.4.14/arch/arm/mm/
H A Dinit.c370 * The banks are sorted previously in bootmem_init(). free_unused_memmap()
/linux-4.4.14/tools/iio/
H A Diio_utils.c285 * @ci_array: the iio_channel_info array to be sorted
/linux-4.4.14/tools/perf/
H A Dbuiltin-lock.c244 static struct rb_root result; /* place to store sorted data */
/linux-4.4.14/drivers/pci/
H A Dsetup-bus.c14 * PCI-PCI bridges cleanup, sorted resource allocation.
424 * The "head" list is sorted by the alignment to make sure list_for_each_entry_safe()
/linux-4.4.14/drivers/net/wimax/i2400m/
H A Drx.c651 * If these fail, then we have to do a sorted insertion in the queue,
695 * are not going to be the last ones. The list is sorted, so __i2400m_roq_queue()
/linux-4.4.14/include/media/
H A Dv4l2-ctrls.h226 * @node: List node for the sorted list.
232 * keep a sorted-by-control-ID list of all controls, while the next pointer
/linux-4.4.14/block/partitions/
H A Dldm.c1227 * The VBLKs are sorted into categories. Partitions are also sorted by offset.
/linux-4.4.14/drivers/staging/lustre/lustre/include/
H A Dcl_object.h1147 * cl_lock::cll_linkage. Currently this list is not sorted in any way. We can
1284 * - once locks for all layers were collected, they are sorted to avoid
2064 * sorted and enqueued in the proper order.
2254 * order. To this end, all locks are first collected, then sorted, and then
/linux-4.4.14/drivers/s390/block/
H A Ddasd_int.h561 * The static memory in ccw_mem and erp_mem is managed by a sorted
/linux-4.4.14/drivers/s390/char/
H A Draw3270.c763 /* Keep the list sorted. */ raw3270_setup_device()
H A Dtape_core.c327 * Add device into the sorted list, giving it the first
/linux-4.4.14/drivers/s390/cio/
H A Dcmf.c524 * remains sorted by ->cmb->hw_data pointers. alloc_cmb_single()
/linux-4.4.14/drivers/staging/android/
H A Dashmem.c156 * @prev_range: The previous ashmem_range in the sorted asma->unpinned list

Completed in 7643 milliseconds

12