| /Linux-v6.1/tools/lib/subcmd/ |
| D | help.c | 106 static void pretty_print_string_list(struct cmdnames *cmds, int longest) in pretty_print_string_list() argument
109 int space = longest + 1; /* min 1 SP between words */ in pretty_print_string_list()
234 unsigned int i, longest = 0; in list_commands() local
237 if (longest < main_cmds->names[i]->len) in list_commands()
238 longest = main_cmds->names[i]->len; in list_commands()
240 if (longest < other_cmds->names[i]->len) in list_commands()
241 longest = other_cmds->names[i]->len; in list_commands()
249 pretty_print_string_list(main_cmds, longest); in list_commands()
259 pretty_print_string_list(other_cmds, longest); in list_commands()
|
| /Linux-v6.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-v6.1/tools/perf/ |
| D | builtin-help.c | 302 unsigned int i, longest = 0; in list_common_cmds_help() local
305 if (longest < strlen(common_cmds[i].name)) in list_common_cmds_help()
306 longest = strlen(common_cmds[i].name); in list_common_cmds_help()
311 printf(" %-*s ", longest, common_cmds[i].name); in list_common_cmds_help()
|
| /Linux-v6.1/fs/xfs/ |
| D | xfs_filestream.c | 108 xfs_extlen_t longest, free = 0, minfree, maxfree = 0; in xfs_filestream_pick_ag() local
157 longest = xfs_alloc_longest_free_extent(pag, in xfs_filestream_pick_ag()
160 if (((minlen && longest >= minlen) || in xfs_filestream_pick_ag()
|
| D | xfs_trace.h | 1700 __field(__u32, longest)
1718 __entry->longest = be32_to_cpu(agf->agf_longest);
1736 __entry->longest,
|
| /Linux-v6.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.
|
| D | switchdev.rst | 346 does a longest prefix match (LPM) on FIB entries matching route prefix and
|
| /Linux-v6.1/fs/xfs/scrub/ |
| D | agheader_repair.c | 78 xfs_agblock_t longest; member
95 if (rec->ar_blockcount > raa->longest) in xrep_agf_walk_allocbt()
96 raa->longest = rec->ar_blockcount; in xrep_agf_walk_allocbt()
269 agf->agf_longest = cpu_to_be32(raa.longest); in xrep_agf_calc_from_btrees()
|
| /Linux-v6.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-v6.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-v6.1/fs/xfs/libxfs/ |
| D | xfs_dir2_node.c | 1186 int longest) in xfs_dir3_data_block_free() argument
1198 freehdr.bests[findex] = cpu_to_be16(longest); in xfs_dir3_data_block_free()
1276 int longest; /* longest data free entry */ in xfs_dir2_leafn_remove() local
1323 longest = be16_to_cpu(bf[0].length); in xfs_dir2_leafn_remove()
1341 if (longest < be16_to_cpu(bf[0].length)) { in xfs_dir2_leafn_remove()
1371 longest = be16_to_cpu(bf[0].length); in xfs_dir2_leafn_remove()
1376 if (longest == geo->blksize - geo->data_entry_offset) { in xfs_dir2_leafn_remove()
1398 fdb, findex, fbp, longest); in xfs_dir2_leafn_remove()
|
| D | xfs_ialloc.c | 1605 xfs_extlen_t longest = 0; in xfs_dialloc_good_ag() local
1656 longest = pag->pagf_longest; in xfs_dialloc_good_ag()
1657 if (!longest) in xfs_dialloc_good_ag()
1658 longest = pag->pagf_flcount > 0; in xfs_dialloc_good_ag()
1661 if (pag->pagf_freeblks < needspace + ineed || longest < ineed) in xfs_dialloc_good_ag()
|
| D | xfs_alloc.c | 2303 xfs_extlen_t alloc_len, longest; in xfs_alloc_space_available() local
2315 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation); in xfs_alloc_space_available()
2316 if (longest < alloc_len) in xfs_alloc_space_available()
|
| D | xfs_bmap.c | 3182 xfs_extlen_t longest; in xfs_bmap_longest_free_extent() local
3199 longest = xfs_alloc_longest_free_extent(pag, in xfs_bmap_longest_free_extent()
3202 if (*blen < longest) in xfs_bmap_longest_free_extent()
3203 *blen = longest; in xfs_bmap_longest_free_extent()
|
| /Linux-v6.1/Documentation/ABI/testing/ |
| D | configfs-usb-gadget-uvc | 231 dwMinBitRate the minimum bit rate at the longest
290 dwMinBitRate the minimum bit rate at the longest
|
| /Linux-v6.1/drivers/remoteproc/ |
| D | remoteproc_core.c | 2683 unsigned int longest = 0; in rproc_panic_handler() local
2697 longest = max(longest, d); in rproc_panic_handler()
2707 mdelay(longest); in rproc_panic_handler()
|
| /Linux-v6.1/lib/ |
| D | vsprintf.c | 1366 int longest = 1; in ip6_compressed_string() local
1394 if (zerolength[i] > longest) { in ip6_compressed_string()
1395 longest = zerolength[i]; in ip6_compressed_string()
1399 if (longest == 1) /* don't compress a single 0 */ in ip6_compressed_string()
1409 i += longest - 1; in ip6_compressed_string()
|
| /Linux-v6.1/tools/perf/util/ |
| D | parse-events.c | 331 int n, longest = -1; in parse_aliases() local
336 if (n > longest && !strncasecmp(str, names[i][j], n)) in parse_aliases()
337 longest = n; in parse_aliases()
339 if (longest > 0) in parse_aliases()
|
| /Linux-v6.1/Documentation/networking/devlink/ |
| D | devlink-dpipe.rst | 15 For example, the routing longest prefix match (LPM) algorithm used by the
|
| /Linux-v6.1/tools/lib/traceevent/ |
| D | event-parse.c | 4681 int longest = 1; in print_ip6c_addr() local
4709 if (zerolength[i] > longest) { in print_ip6c_addr()
4710 longest = zerolength[i]; in print_ip6c_addr()
4714 if (longest == 1) /* don't compress a single 0 */ in print_ip6c_addr()
4724 i += longest - 1; in print_ip6c_addr()
|
| /Linux-v6.1/arch/arm/boot/dts/ |
| D | exynos5420-peach-pit.dts | 1113 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| D | exynos5800-peach-pi.dts | 1095 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| /Linux-v6.1/Documentation/process/ |
| D | maintainer-netdev.rst | 213 Order the variable declaration lines longest to shortest, e.g.::
|
| /Linux-v6.1/arch/arm/boot/compressed/ |
| D | head.S | 1316 bic r1, r1, #63 @ align to longest cache line
|
| /Linux-v6.1/Documentation/trace/ |
| D | ftrace.rst | 760 the trace with the longest max latency.
1688 preemption disabled for the longest times is helpful. But
1940 That is the longest latency it takes for something to happen,
|
