| /openbmc/linux/fs/xfs/ |
| H A 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 …]
|
| H A D | xfs_trace.h | 1697 __field(__u32, longest)
1715 __entry->longest = be32_to_cpu(agf->agf_longest);
1733 __entry->longest,
|
| /openbmc/linux/tools/lib/subcmd/ |
| H A 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()
|
| /openbmc/linux/lib/lz4/ |
| H A 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()
|
| /openbmc/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
|
| /openbmc/linux/tools/perf/ |
| H A 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()
|
| /openbmc/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.
|
| /openbmc/linux/fs/ocfs2/dlm/ |
| H A 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()
|
| /openbmc/linux/fs/xfs/scrub/ |
| H A D | agheader_repair.c | 83 xfs_agblock_t longest; member
100 if (rec->ar_blockcount > raa->longest) in xrep_agf_walk_allocbt()
101 raa->longest = rec->ar_blockcount; in xrep_agf_walk_allocbt()
275 agf->agf_longest = cpu_to_be32(raa.longest); in xrep_agf_calc_from_btrees()
|
| /openbmc/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
|
| /openbmc/linux/fs/xfs/libxfs/ |
| H A 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()
|
| H A D | xfs_ialloc.c | 1611 xfs_extlen_t longest = 0; in xfs_dialloc_good_ag() local
1664 longest = pag->pagf_longest; in xfs_dialloc_good_ag()
1665 if (!longest) in xfs_dialloc_good_ag()
1666 longest = pag->pagf_flcount > 0; in xfs_dialloc_good_ag()
1669 if (pag->pagf_freeblks < needspace + ineed || longest < ineed) in xfs_dialloc_good_ag()
|
| H A D | xfs_alloc.c | 2326 xfs_extlen_t alloc_len, longest; in xfs_alloc_space_available() local
2338 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation); in xfs_alloc_space_available()
2339 if (longest < alloc_len) in xfs_alloc_space_available()
|
| H A D | xfs_bmap.c | 3189 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()
|
| /openbmc/linux/tools/net/ynl/ |
| H A D | ynl-gen-c.py | 1200 longest = 0
1202 if len(define[0]) > longest:
1203 longest = len(define[0])
1204 longest = ((longest + 8) // 8) * 8
1207 line += '\t' * ((longest - len(define[0]) + 7) // 8)
1215 longest = max([len(x[0]) for x in members])
1216 longest += 1 # because we prepend a .
1217 longest = ((longest + 8) // 8) * 8
1220 line += '\t' * ((longest - len(one[0]) - 1 + 7) // 8)
|
| /openbmc/linux/drivers/remoteproc/ |
| H A D | remoteproc_core.c | 2697 unsigned int longest = 0; in rproc_panic_handler() local
2711 longest = max(longest, d); in rproc_panic_handler()
2721 mdelay(longest); in rproc_panic_handler()
|
| /openbmc/linux/tools/perf/util/ |
| H A D | parse-events.c | 335 int *longest) in parse_aliases() argument
337 *longest = -1; in parse_aliases()
342 if (n > *longest && !strncasecmp(str, names[i][j], n)) in parse_aliases()
343 *longest = n; in parse_aliases()
345 if (*longest > 0) in parse_aliases()
|
| /openbmc/linux/Documentation/ABI/testing/ |
| H A D | configfs-usb-gadget-uvc | 278 dwMinBitRate the minimum bit rate at the longest
337 dwMinBitRate the minimum bit rate at the longest
|
| /openbmc/linux/lib/ |
| H A D | vsprintf.c | 1363 int longest = 1; in ip6_compressed_string() local
1391 if (zerolength[i] > longest) { in ip6_compressed_string()
1392 longest = zerolength[i]; in ip6_compressed_string()
1396 if (longest == 1) /* don't compress a single 0 */ in ip6_compressed_string()
1406 i += longest - 1; in ip6_compressed_string()
|
| /openbmc/linux/Documentation/networking/devlink/ |
| H A D | devlink-dpipe.rst | 15 For example, the routing longest prefix match (LPM) algorithm used by the
|
| /openbmc/docs/designs/ |
| H A D | binarystore-via-blobs.md | 73 longest matching prefix is considered reserved as a binary blob in the storage
|
| /openbmc/linux/Documentation/userspace-api/netlink/ |
| H A D | specs.rst | 449 ``max-len`` in ``checks`` indicates the longest possible string,
|
| /openbmc/linux/arch/arm/boot/dts/samsung/ |
| H A D | exynos5420-peach-pit.dts | 1117 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| H A D | exynos5800-peach-pi.dts | 1099 * Use longest HW watchdog in SoC (32 seconds) since the hardware
|
| /openbmc/linux/Documentation/process/ |
| H A D | maintainer-netdev.rst | 366 Order the variable declaration lines longest to shortest, e.g.::
|