Home
last modified time | relevance | path

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

/linux/fs/xfs/
H A Dxfs_filestream.c61 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/tools/lib/subcmd/
H A Dhelp.c135 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/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/tools/perf/
H A Dbuiltin-help.c345 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 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/tools/net/ynl/pyynl/
H A Dynl_gen_c.py1823 longest = 0
1825 longest = max(len(define[0]), longest)
1826 longest = ((longest + 8) // 8) * 8
1829 line += '\t' * ((longest - len(define[0]) + 7) // 8)
1837 longest = max(len(x[0]) for x in members)
1838 longest += 1 # because we prepend a .
1839 longest = ((longest
[all...]
/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.c327 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()
/linux/fs/xfs/libxfs/
H A Dxfs_ialloc.c1731 xfs_extlen_t longest = 0; in xfs_dialloc_good_ag() local
1784 longest = pag->pagf_longest; in xfs_dialloc_good_ag()
1785 if (!longest) in xfs_dialloc_good_ag()
1786 longest = pag->pagf_flcount > 0; in xfs_dialloc_good_ag()
1789 if (pag->pagf_freeblks < needspace + ineed || longest < ineed) in xfs_dialloc_good_ag()
/linux/lib/
H A Dvsprintf.c1401 int longest = 1; in ip6_compressed_string()
1420 /* find position of longest 0 run */ in ip6_compressed_string()
1429 if (zerolength[i] > longest) { in ip6_compressed_string()
1430 longest = zerolength[i]; in ip6_compressed_string()
1434 if (longest == 1) /* don't compress a single 0 */ in ip6_compressed_string()
1444 i += longest - 1; in ip6_compressed_string()
1400 int longest = 1; ip6_compressed_string() local
H A DKconfig.debug3042 tristate "Test the longest symbol possible" if !KUNIT_ALL_TESTS
3047 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/process/
H A Dmaintainer-netdev.rst384 Order the variable declaration lines longest to shortest, e.g.::
/linux/Documentation/admin-guide/LSM/
H A DSmack.rst723 Entries in the /sys/fs/smackfs/netlabel file are matched by longest mask
/linux/Documentation/RCU/Design/Data-Structures/
H A DData-Structures.rst333 The ``->gp_max`` field tracks the duration of the longest grace period
/linux/
H A DCREDITS4370 D: Author of the longest-living linux bug
/linux/Documentation/virt/kvm/
H A Dapi.rst6034 of items in a hash table bucket, the longest time waited and so on.