Home
last modified time | relevance | path

Searched refs:longest (Results 1 – 24 of 24) sorted by relevance

/linux/tools/lib/subcmd/
H A Dhelp.c133 static void pretty_print_string_list(struct cmdnames *cmds, int longest) in pretty_print_string_list() argument
136 int space = longest + 1; /* min 1 SP between words */ in pretty_print_string_list()
261 unsigned int i, longest = 0; in list_commands() local
264 if (longest < main_cmds->names[i]->len) in list_commands()
265 longest = main_cmds->names[i]->len; in list_commands()
267 if (longest < other_cmds->names[i]->len) in list_commands()
268 longest = other_cmds->names[i]->len; in list_commands()
276 pretty_print_string_list(main_cmds, longest); in list_commands()
286 pretty_print_string_list(other_cmds, longest); in list_commands()
/linux/Documentation/bpf/
H A Dmap_lpm_trie.rst11 ``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/fs/xfs/scrub/
H A Dalloc_repair.c127 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()
H A Dagheader_repair.c89 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 Dfib_trie.rst131 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 Dswitchdev.rst346 does a longest prefix match (LPM) on FIB entries matching route prefix and
/linux/Documentation/locking/
H A Dlockstat.rst58 - longest time we ever had to wait for a lock
71 - longest time we ever held the lock
/linux/fs/xfs/libxfs/
H A Dxfs_alloc.c498 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()
H A Dxfs_ialloc.c1730 xfs_extlen_t longest = 0; in xfs_dialloc_good_ag() local
1783 longest = pag->pagf_longest; in xfs_dialloc_good_ag()
1784 if (!longest) in xfs_dialloc_good_ag()
1785 longest = pag->pagf_flcount > 0; in xfs_dialloc_good_ag()
1788 if (pag->pagf_freeblks < needspace + ineed || longest < ineed) in xfs_dialloc_good_ag()
H A Dxfs_bmap.c3154 xfs_extlen_t longest; in xfs_bmap_longest_free_extent() local
3164 longest = xfs_alloc_longest_free_extent(pag, in xfs_bmap_longest_free_extent()
3167 if (*blen < longest) in xfs_bmap_longest_free_extent()
3168 *blen = longest; in xfs_bmap_longest_free_extent()
/linux/tools/net/ynl/pyynl/
H A Dynl_gen_c.py1800 longest = 0
1802 if len(define[0]) > longest:
1803 longest = len(define[0])
1804 longest = ((longest + 8) // 8) * 8
1807 line += '\t' * ((longest - len(define[0]) + 7) // 8)
1815 longest = max([len(x[0]) for x in members])
1816 longest += 1 # because we prepend a .
1817 longest = ((longest + 8) // 8) * 8
1820 line += '\t' * ((longest - len(one[0]) - 1 + 7) // 8)
/linux/drivers/remoteproc/
H A Dremoteproc_core.c2717 unsigned int longest = 0; in rproc_panic_handler() local
2731 longest = max(longest, d); in rproc_panic_handler()
2741 mdelay(longest); in rproc_panic_handler()
/linux/tools/perf/util/
H A Dparse-events.c328 int *longest) in parse_aliases() argument
330 *longest = -1; in parse_aliases()
335 if (n > *longest && !strncasecmp(str, names[i][j], n)) in parse_aliases()
336 *longest = n; in parse_aliases()
338 if (*longest > 0) in parse_aliases()
/linux/lib/
H A Dvsprintf.c1400 int longest = 1; in ip6_compressed_string() local
1428 if (zerolength[i] > longest) { in ip6_compressed_string()
1429 longest = zerolength[i]; in ip6_compressed_string()
1433 if (longest == 1) /* don't compress a single 0 */ in ip6_compressed_string()
1443 i += longest - 1; in ip6_compressed_string()
H A DKconfig.debug2935 tristate "Test the longest symbol possible" if !KUNIT_ALL_TESTS
2940 Tests the longest symbol possible
/linux/Documentation/networking/devlink/
H A Ddevlink-dpipe.rst15 For example, the routing longest prefix match (LPM) algorithm used by the
/linux/arch/arm/boot/dts/samsung/
H A Dexynos5420-peach-pit.dts1118 * Use longest HW watchdog in SoC (32 seconds) since the hardware
H A Dexynos5800-peach-pi.dts1100 * Use longest HW watchdog in SoC (32 seconds) since the hardware
/linux/arch/arm/boot/compressed/
H A Dhead.S1316 bic r1, r1, #63 @ align to longest cache line
/linux/Documentation/admin-guide/LSM/
H A DSmack.rst723 Entries in the /sys/fs/smackfs/netlabel file are matched by longest mask
/linux/Documentation/trace/
H A Dftrace.rst841 the trace with the longest max latency.
1814 preemption disabled for the longest times is helpful. But
2066 That is the longest latency it takes for something to happen,
/linux/Documentation/RCU/Design/Data-Structures/
H A DData-Structures.rst333 The ``->gp_max`` field tracks the duration of the longest grace period
/linux/Documentation/RCU/Design/Requirements/
H A DRequirements.rst1215 addition to the duration of the longest RCU read-side critical section.
/linux/Documentation/virt/kvm/
H A Dapi.rst6035 of items in a hash table bucket, the longest time waited and so on.