/linux-6.12.1/fs/xfs/ |
D | xfs_filestream.c | 61 xfs_extlen_t *longest) in xfs_filestream_pick_ag() argument 66 xfs_extlen_t minlen = *longest; in xfs_filestream_pick_ag() 80 *longest = 0; in xfs_filestream_pick_ag() 81 err = xfs_bmap_longest_free_extent(pag, NULL, longest); in xfs_filestream_pick_ag() 110 if (((minlen && *longest >= minlen) || in xfs_filestream_pick_ag() 207 xfs_extlen_t *longest) in xfs_filestream_lookup_association() argument 214 *longest = 0; in xfs_filestream_lookup_association() 239 *longest = 1; in xfs_filestream_lookup_association() 243 error = xfs_bmap_longest_free_extent(pag, args->tp, longest); in xfs_filestream_lookup_association() 246 if (error || *longest < args->maxlen) { in xfs_filestream_lookup_association() [all …]
|
/linux-6.12.1/tools/lib/subcmd/ |
D | help.c | 128 static void pretty_print_string_list(struct cmdnames *cmds, int longest) in pretty_print_string_list() argument 131 int space = longest + 1; /* min 1 SP between words */ in pretty_print_string_list() 256 unsigned int i, longest = 0; in list_commands() local 259 if (longest < main_cmds->names[i]->len) in list_commands() 260 longest = main_cmds->names[i]->len; in list_commands() 262 if (longest < other_cmds->names[i]->len) in list_commands() 263 longest = other_cmds->names[i]->len; in list_commands() 271 pretty_print_string_list(main_cmds, longest); in list_commands() 281 pretty_print_string_list(other_cmds, longest); in list_commands()
|
/linux-6.12.1/lib/lz4/ |
D | lz4hc_compress.c | 173 int longest, in LZ4HC_InsertAndGetWiderMatch() argument 201 if (*(iLowLimit + longest) in LZ4HC_InsertAndGetWiderMatch() 202 == *(matchPtr - delta + longest)) { in LZ4HC_InsertAndGetWiderMatch() 217 if (mlt > longest) { in LZ4HC_InsertAndGetWiderMatch() 218 longest = (int)mlt; in LZ4HC_InsertAndGetWiderMatch() 248 if ((int)mlt > longest) { in LZ4HC_InsertAndGetWiderMatch() 249 longest = (int)mlt; in LZ4HC_InsertAndGetWiderMatch() 259 return longest; in LZ4HC_InsertAndGetWiderMatch()
|
/linux-6.12.1/Documentation/bpf/ |
D | map_lpm_trie.rst | 11 ``BPF_MAP_TYPE_LPM_TRIE`` provides a longest prefix match algorithm that 45 The longest prefix entry for a given data value can be found using the 47 value associated with the longest matching ``key``, or ``NULL`` if no 51 performing longest prefix lookups. For example, when searching for the 52 longest prefix match for an IPv4 address, ``prefixlen`` should be set to
|
/linux-6.12.1/tools/perf/ |
D | builtin-help.c | 304 unsigned int i, longest = 0; in list_common_cmds_help() local 307 if (longest < strlen(common_cmds[i].name)) in list_common_cmds_help() 308 longest = strlen(common_cmds[i].name); in list_common_cmds_help() 313 printf(" %-*s ", longest, common_cmds[i].name); in list_common_cmds_help()
|
/linux-6.12.1/fs/xfs/scrub/ |
D | alloc_repair.c | 127 xfs_agblock_t longest; member 622 ra->longest = max(ra->longest, arec->ar_blockcount); in xrep_abt_get_records() 674 agf->agf_longest = cpu_to_be32(ra->longest); in xrep_abt_reset_counters() 774 ra->longest = 0; in xrep_abt_build_new_trees()
|
D | agheader_repair.c | 89 xfs_agblock_t longest; member 106 if (rec->ar_blockcount > raa->longest) in xrep_agf_walk_allocbt() 107 raa->longest = rec->ar_blockcount; in xrep_agf_walk_allocbt() 273 agf->agf_longest = cpu_to_be32(raa.longest); in xrep_agf_calc_from_btrees()
|
/linux-6.12.1/Documentation/networking/ |
D | fib_trie.rst | 131 and we backtrack upwards through the trie trying to find a longest matching 135 Inside each tnode, the search for longest matching prefix consists of searching 141 chop off part of the key in order to find the longest matching prefix.
|
/linux-6.12.1/fs/ocfs2/dlm/ |
D | dlmdebug.c | 409 unsigned long total = 0, longest = 0, bucket_count = 0; in debug_mle_print() local 424 longest = max(longest, bucket_count); in debug_mle_print() 430 "Total: %lu, Longest: %lu\n", total, longest); in debug_mle_print()
|
/linux-6.12.1/Documentation/locking/ |
D | lockstat.rst | 58 - longest time we ever had to wait for a lock 71 - longest time we ever held the lock
|
/linux-6.12.1/fs/xfs/libxfs/ |
D | xfs_dir2_node.c | 1196 int longest) in xfs_dir3_data_block_free() argument 1208 freehdr.bests[findex] = cpu_to_be16(longest); in xfs_dir3_data_block_free() 1286 int longest; /* longest data free entry */ in xfs_dir2_leafn_remove() local 1333 longest = be16_to_cpu(bf[0].length); in xfs_dir2_leafn_remove() 1351 if (longest < be16_to_cpu(bf[0].length)) { in xfs_dir2_leafn_remove() 1381 longest = be16_to_cpu(bf[0].length); in xfs_dir2_leafn_remove() 1386 if (longest == geo->blksize - geo->data_entry_offset) { in xfs_dir2_leafn_remove() 1408 fdb, findex, fbp, longest); in xfs_dir2_leafn_remove()
|
D | xfs_alloc.c | 499 xfs_extlen_t *longest) in xfs_cntbt_longest() argument 512 *longest = 0; in xfs_cntbt_longest() 525 *longest = irec.ar_blockcount; in xfs_cntbt_longest() 545 xfs_extlen_t longest = 0; in xfs_alloc_fixup_longest() local 549 error = xfs_cntbt_longest(cnt_cur, &longest); in xfs_alloc_fixup_longest() 553 pag->pagf_longest = longest; in xfs_alloc_fixup_longest() 2500 xfs_extlen_t alloc_len, longest; in xfs_alloc_space_available() local 2512 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation); in xfs_alloc_space_available() 2513 if (longest < alloc_len) in xfs_alloc_space_available()
|
D | xfs_ialloc.c | 1732 xfs_extlen_t longest = 0; in xfs_dialloc_good_ag() local 1785 longest = pag->pagf_longest; in xfs_dialloc_good_ag() 1786 if (!longest) in xfs_dialloc_good_ag() 1787 longest = pag->pagf_flcount > 0; in xfs_dialloc_good_ag() 1790 if (pag->pagf_freeblks < needspace + ineed || longest < ineed) in xfs_dialloc_good_ag()
|
D | xfs_bmap.c | 3272 xfs_extlen_t longest; in xfs_bmap_longest_free_extent() local 3282 longest = xfs_alloc_longest_free_extent(pag, in xfs_bmap_longest_free_extent() 3285 if (*blen < longest) in xfs_bmap_longest_free_extent() 3286 *blen = longest; in xfs_bmap_longest_free_extent()
|
/linux-6.12.1/tools/net/ynl/ |
D | ynl-gen-c.py | 1359 longest = 0 1361 if len(define[0]) > longest: 1362 longest = len(define[0]) 1363 longest = ((longest + 8) // 8) * 8 1366 line += '\t' * ((longest - len(define[0]) + 7) // 8) 1374 longest = max([len(x[0]) for x in members]) 1375 longest += 1 # because we prepend a . 1376 longest = ((longest + 8) // 8) * 8 1379 line += '\t' * ((longest - len(one[0]) - 1 + 7) // 8)
|
/linux-6.12.1/drivers/remoteproc/ |
D | remoteproc_core.c | 2722 unsigned int longest = 0; in rproc_panic_handler() local 2736 longest = max(longest, d); in rproc_panic_handler() 2746 mdelay(longest); in rproc_panic_handler()
|
/linux-6.12.1/tools/perf/util/ |
D | parse-events.c | 342 int *longest) in parse_aliases() argument 344 *longest = -1; in parse_aliases() 349 if (n > *longest && !strncasecmp(str, names[i][j], n)) in parse_aliases() 350 *longest = n; in parse_aliases() 352 if (*longest > 0) in parse_aliases()
|
/linux-6.12.1/Documentation/ABI/testing/ |
D | configfs-usb-gadget-uvc | 278 dwMinBitRate the minimum bit rate at the longest 337 dwMinBitRate the minimum bit rate at the longest
|
/linux-6.12.1/lib/ |
D | vsprintf.c | 1364 int longest = 1; in ip6_compressed_string() local 1392 if (zerolength[i] > longest) { in ip6_compressed_string() 1393 longest = zerolength[i]; in ip6_compressed_string() 1397 if (longest == 1) /* don't compress a single 0 */ in ip6_compressed_string() 1407 i += longest - 1; in ip6_compressed_string()
|
/linux-6.12.1/Documentation/networking/devlink/ |
D | devlink-dpipe.rst | 15 For example, the routing longest prefix match (LPM) algorithm used by the
|
/linux-6.12.1/Documentation/userspace-api/netlink/ |
D | specs.rst | 458 ``max-len`` in ``checks`` indicates the longest possible string,
|
/linux-6.12.1/arch/arm/boot/dts/samsung/ |
D | exynos5420-peach-pit.dts | 1118 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
D | exynos5800-peach-pi.dts | 1100 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
/linux-6.12.1/Documentation/process/ |
D | maintainer-netdev.rst | 364 Order the variable declaration lines longest to shortest, e.g.::
|
/linux-6.12.1/arch/arm/boot/compressed/ |
D | head.S | 1316 bic r1, r1, #63 @ align to longest cache line
|