| /linux/tools/lib/subcmd/ |
| H A D | help.c | 135 static void pretty_print_string_list(struct cmdnames *cmds, int longest) in pretty_print_string_list() argument
138 int space = longest + 1; /* min 1 SP between words */ in pretty_print_string_list()
263 unsigned int i, longest = 0; in list_commands() local
266 if (longest < main_cmds->names[i]->len) in list_commands()
267 longest = main_cmds->names[i]->len; in list_commands()
269 if (longest < other_cmds->names[i]->len) in list_commands()
270 longest = other_cmds->names[i]->len; in list_commands()
278 pretty_print_string_list(main_cmds, longest); in list_commands()
288 pretty_print_string_list(other_cmds, longest); in list_commands()
|
| /linux/Documentation/ABI/testing/ |
| H A D | procfs-nfsd-reply_cache_stats | 24 longest chain len u32 Longest hash chain observed
25 cachesize at longest u32 Cache size when longest
|
| /linux/Documentation/bpf/ |
| H A 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/tools/perf/ |
| H A D | builtin-help.c | 345 size_t longest = 0; in list_common_cmds_help() local
348 if (longest < strlen(common_cmds[i].name)) in list_common_cmds_help()
349 longest = strlen(common_cmds[i].name); in list_common_cmds_help()
354 printf(" %-*s ", (int)longest, common_cmds[i].name); in list_common_cmds_help()
|
| /linux/fs/xfs/scrub/ |
| H A D | alloc_repair.c | 127 xfs_agblock_t longest; member
627 ra->longest = max(ra->longest, arec->ar_blockcount); in xrep_abt_get_records()
679 agf->agf_longest = cpu_to_be32(ra->longest); in xrep_abt_reset_counters()
779 ra->longest = 0; in xrep_abt_build_new_trees()
|
| H A 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/Documentation/networking/ |
| H A 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.
|
| H A D | switchdev.rst | 346 does a longest prefix match (LPM) on FIB entries matching route prefix and
|
| /linux/Documentation/locking/ |
| H A D | lockstat.rst | 58 - longest time we ever had to wait for a lock
71 - longest time we ever held the lock
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_alloc.c | 498 xfs_extlen_t *longest) in xfs_cntbt_longest() argument
511 *longest = 0; in xfs_cntbt_longest()
524 *longest = irec.ar_blockcount; in xfs_cntbt_longest()
544 xfs_extlen_t longest = 0; in xfs_alloc_fixup_longest() local
548 error = xfs_cntbt_longest(cnt_cur, &longest); in xfs_alloc_fixup_longest()
552 pag->pagf_longest = longest; in xfs_alloc_fixup_longest()
2501 xfs_extlen_t alloc_len, longest; in xfs_alloc_space_available() local
2513 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation); in xfs_alloc_space_available()
2514 if (longest < alloc_len) in xfs_alloc_space_available()
|
| /linux/tools/net/ynl/pyynl/ |
| H A D | ynl_gen_c.py | 1831 longest = 0
1833 longest = max(len(define[0]), longest)
1834 longest = ((longest + 8) // 8) * 8
1837 line += '\t' * ((longest - len(define[0]) + 7) // 8)
1845 longest = max(len(x[0]) for x in members)
1846 longest += 1 # because we prepend a .
1847 longest = ((longest + 8) // 8) * 8
1850 line += '\t' * ((longest - len(one[0]) - 1 + 7) // 8)
|
| /linux/tools/perf/util/ |
| H A D | parse-events.c | 319 * case. If mutliple entries in names match str then the longest
324 * @longest: Out argument giving the length of the matching entry.
327 int *longest) in parse_aliases() argument
329 *longest = -1; in parse_aliases()
334 if (n > *longest && !strncasecmp(str, names[i][j], n)) in parse_aliases()
335 *longest = n; in parse_aliases()
337 if (*longest > 0) in parse_aliases()
362 * contain hyphens and the longest name
2941 /* "no-overwrite" is the longest name */
|
| /linux/Documentation/networking/devlink/ |
| H A D | devlink-dpipe.rst | 15 For example, the routing longest prefix match (LPM) algorithm used by the
|
| /linux/arch/arm/boot/dts/samsung/ |
| H A D | exynos5420-peach-pit.dts | 1118 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| H A D | exynos5800-peach-pi.dts | 1100 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| /linux/arch/arm/boot/compressed/ |
| H A D | head.S | 1316 bic r1, r1, #63 @ align to longest cache line
|
| /linux/Documentation/process/ |
| H A D | maintainer-netdev.rst | 404 Order the variable declaration lines longest to shortest, e.g.::
|
| /linux/fs/xfs/ |
| H A D | xfs_trace.h | 2123 __field(__u32, longest)
2139 __entry->longest = be32_to_cpu(agf->agf_longest);
2157 __entry->longest,
|
| /linux/Documentation/admin-guide/LSM/ |
| H A D | Smack.rst | 723 Entries in the /sys/fs/smackfs/netlabel file are matched by longest mask
|
| /linux/Documentation/RCU/Design/Data-Structures/ |
| H A D | Data-Structures.rst | 333 The ``->gp_max`` field tracks the duration of the longest grace period
|
| /linux/lib/ |
| H A D | Kconfig.debug | 3072 tristate "Test the longest symbol possible" if !KUNIT_ALL_TESTS
3077 Tests the longest symbol possible
|
| /linux/Documentation/RCU/Design/Requirements/ |
| H A D | Requirements.rst | 1215 addition to the duration of the longest RCU read-side critical section.
|
| /linux/ |
| H A D | CREDITS | 4450 D: Author of the longest-living linux bug
|