| /kernel/linux/linux-5.10/fs/xfs/ |
| H A D | xfs_extfree_item.c | 443 bool sort) in xfs_extent_free_create_intent()
452 if (sort) in xfs_extent_free_create_intent()
439 xfs_extent_free_create_intent( struct xfs_trans *tp, struct list_head *items, unsigned int count, bool sort) xfs_extent_free_create_intent() argument
|
| /kernel/linux/linux-5.10/drivers/memory/tegra/ |
| H A D | tegra20-emc.c | 19 #include <linux/sort.h>
366 sort(emc->timings, emc->num_timings, sizeof(*timing), cmp_timings, in tegra_emc_load_timings_from_dt()
|
| /kernel/linux/linux-5.10/drivers/platform/chrome/ |
| H A D | cros_ec_sensorhub_ring.c | 17 #include <linux/sort.h>
152 * For now it's implemented using an inefficient > O(n) sort then return
161 sort(array, length, sizeof(s64), cros_ec_sensor_ring_median_cmp, NULL); in cros_ec_sensor_ring_median()
|
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_extfree_item.c | 476 bool sort) in xfs_extent_free_create_intent()
485 if (sort) in xfs_extent_free_create_intent()
472 xfs_extent_free_create_intent( struct xfs_trans *tp, struct list_head *items, unsigned int count, bool sort) xfs_extent_free_create_intent() argument
|
| H A D | xfs_bmap_item.c | 341 bool sort) in xfs_bmap_update_create_intent()
350 if (sort) in xfs_bmap_update_create_intent()
337 xfs_bmap_update_create_intent( struct xfs_trans *tp, struct list_head *items, unsigned int count, bool sort) xfs_bmap_update_create_intent() argument
|
| H A D | xfs_rmap_item.c | 367 bool sort) in xfs_rmap_update_create_intent()
376 if (sort) in xfs_rmap_update_create_intent()
363 xfs_rmap_update_create_intent( struct xfs_trans *tp, struct list_head *items, unsigned int count, bool sort) xfs_rmap_update_create_intent() argument
|
| /kernel/linux/linux-6.6/fs/ext4/ |
| H A D | fsmap.c | 11 #include <linux/sort.h>
656 sort(handlers, EXT4_GETFSMAP_DEVS, sizeof(struct ext4_getfsmap_dev), in ext4_getfsmap()
|
| /kernel/linux/linux-6.6/drivers/platform/chrome/ |
| H A D | cros_ec_sensorhub_ring.c | 17 #include <linux/sort.h>
152 * For now it's implemented using an inefficient > O(n) sort then return
161 sort(array, length, sizeof(s64), cros_ec_sensor_ring_median_cmp, NULL); in cros_ec_sensor_ring_median()
|
| /kernel/linux/linux-6.6/kernel/ |
| H A D | jump_label.c | 14 #include <linux/sort.h>
90 sort(start, size, sizeof(struct jump_entry), jump_label_cmp, swapfn); in jump_label_sort_entries()
|
| /kernel/linux/linux-6.6/kernel/locking/ |
| H A D | lockdep_proc.c | 21 #include <linux/sort.h>
407 * sort on absolute number of contentions
664 sort(data->stats, data->iter_end - data->stats, in lock_stat_open()
|
| /kernel/linux/linux-6.6/drivers/firmware/arm_scmi/ |
| H A D | clock.c | 10 #include <linux/sort.h>
320 sort(clk->list.rates, clk->list.num_rates, in scmi_clock_describe_rates_get()
|
| /kernel/linux/linux-6.6/drivers/net/wireless/intel/iwlwifi/mvm/ |
| H A D | tt.c | 7 #include <linux/sort.h>
588 /*sort cmd array*/ in iwl_mvm_send_temp_report_ths_cmd()
589 sort(cmd.thresholds, idx, sizeof(s16), compare_temps, NULL); in iwl_mvm_send_temp_report_ths_cmd()
591 /* we should save the indexes of trips because we sort in iwl_mvm_send_temp_report_ths_cmd()
|
| /kernel/linux/linux-6.6/arch/x86/mm/ |
| H A D | numa.c | 14 #include <linux/sort.h>
1007 sort(&blk[0], count, sizeof(blk[0]), cmp_memblk, NULL); in numa_fill_memblks()
|
| /kernel/linux/linux-6.6/arch/x86/kernel/ |
| H A D | unwind_orc.c | 4 #include <linux/sort.h>
308 sort(orc_ip, num_entries, sizeof(int), orc_sort_cmp, orc_sort_swap); in unwind_module_init()
335 * It's ready for binary search straight away, no need to sort it. in unwind_init()
|
| /kernel/linux/linux-6.6/drivers/iio/ |
| H A D | industrialio-gts-helper.c | 14 #include <linux/sort.h>
179 sort(gains[i], gts->num_hwgain, sizeof(int), iio_gts_gain_cmp, in gain_to_scaletables()
|
| /kernel/linux/linux-6.6/tools/testing/selftests/net/ |
| H A D | xfrm_policy.sh | 299 for j in $(seq 0 16 255 | sort -R); do
312 for j in $(seq 0 16 255 | sort -R); do
|
| /test/testfwk/arkxtest/uitest/test/ |
| H A D | ui_driver_test.cpp | 625 std::sort(modelVec.begin(), modelVec.end(), WindowCacheCompareGreater()); in TEST_F()
666 std::sort(modelVec.begin(), modelVec.end(), WindowCacheCompareGreater()); in TEST_F()
|
| /third_party/alsa-utils/alsa-info/ |
| H A D | alsa-info.sh | 38 REQUIRES=(mktemp grep pgrep awk date uname cat sort dmesg amixer alsactl)
128 awk '{print $1}' < /proc/modules | sort >> "$FILE"
|
| /third_party/gn/src/gn/ |
| H A D | ninja_build_writer.cc | 404 std::sort(sorted_pools.begin(), sorted_pools.end(), in WriteAllPools()
422 std::sort(sorted_settings.begin(), sorted_settings.end(), in WriteSubninjas()
|
| /third_party/node/test/fixtures/wpt/WebCryptoAPI/wrapKey_unwrapKey/ |
| H A D | wrapKey_unwrapKey.https.any.js | 322 Object.keys(obj).sort().forEach(function(keyName) {
334 Object.keys(obj).sort().forEach(function(keyName) {
|
| /third_party/node/deps/npm/lib/commands/ |
| H A D | view.js | 48 pckmnt.versions = Object.keys(pckmnt.versions).sort(semver.compareLoose)
220 }).sort(semver.compareLoose)
|
| /third_party/python/Lib/idlelib/ |
| H A D | tree.py | 42 list.sort()
429 names.sort(key = os.path.normcase)
|
| /third_party/python/Lib/ |
| H A D | modulefinder.py | 575 missing.sort()
576 maybe.sort()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 437 llvm::sort(CBV, [](const CaseBits &a, const CaseBits &b) { in buildBitTests()
467 llvm::sort(Clusters, [](const CaseCluster &a, const CaseCluster &b) { in sortAndRangeify()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | EHFrameSupport.cpp | 47 llvm::sort(*Caches[B], [](const Symbol *LHS, const Symbol *RHS) { in operator ()()
156 llvm::sort(EHFrameBlocks, [](const Block *LHS, const Block *RHS) { in operator ()()
|