Searched refs:longest (Results 1 - 17 of 17) sorted by relevance

/linux-master/fs/xfs/
H A Dxfs_filestream.c61 xfs_extlen_t *longest)
66 xfs_extlen_t minlen = *longest;
78 *longest = 0;
79 err = xfs_bmap_longest_free_extent(pag, NULL, longest);
104 if (((minlen && *longest >= minlen) ||
156 *longest = 0;
202 * destroy it, return with longest = 0 to tell the caller to create a new
210 xfs_extlen_t *longest)
217 *longest = 0;
242 *longest
56 xfs_filestream_pick_ag( struct xfs_alloc_arg *args, xfs_ino_t pino, xfs_agnumber_t start_agno, int flags, xfs_extlen_t *longest) argument
206 xfs_filestream_lookup_association( struct xfs_bmalloca *ap, struct xfs_alloc_arg *args, xfs_ino_t pino, xfs_extlen_t *longest) argument
262 xfs_filestream_create_association( struct xfs_bmalloca *ap, struct xfs_alloc_arg *args, xfs_ino_t pino, xfs_extlen_t *longest) argument
345 xfs_filestream_select_ag( struct xfs_bmalloca *ap, struct xfs_alloc_arg *args, xfs_extlen_t *longest) argument
[all...]
H A Dxfs_trace.h1709 __field(__u32, longest)
1725 __entry->longest = be32_to_cpu(agf->agf_longest);
1730 "freeblks %u longest %u caller %pS",
1743 __entry->longest,
/linux-master/tools/lib/subcmd/
H A Dhelp.c128 static void pretty_print_string_list(struct cmdnames *cmds, int longest) argument
131 int space = longest + 1; /* min 1 SP between words */
256 unsigned int i, longest = 0; local
259 if (longest < main_cmds->names[i]->len)
260 longest = main_cmds->names[i]->len;
262 if (longest < other_cmds->names[i]->len)
263 longest = other_cmds->names[i]->len;
271 pretty_print_string_list(main_cmds, longest);
281 pretty_print_string_list(other_cmds, longest);
/linux-master/lib/lz4/
H A Dlz4hc_compress.c173 int longest,
201 if (*(iLowLimit + longest)
202 == *(matchPtr - delta + longest)) {
217 if (mlt > longest) {
218 longest = (int)mlt;
248 if ((int)mlt > longest) {
249 longest = (int)mlt;
259 return longest;
168 LZ4HC_InsertAndGetWiderMatch( LZ4HC_CCtx_internal *hc4, const BYTE * const ip, const BYTE * const iLowLimit, const BYTE * const iHighLimit, int longest, const BYTE **matchpos, const BYTE **startpos, const int maxNbAttempts) argument
/linux-master/tools/perf/
H A Dbuiltin-help.c304 unsigned int i, longest = 0; local
307 if (longest < strlen(common_cmds[i].name))
308 longest = strlen(common_cmds[i].name);
313 printf(" %-*s ", longest, common_cmds[i].name);
/linux-master/fs/xfs/scrub/
H A Dalloc_repair.c127 xfs_agblock_t longest; member in struct:xrep_abt
622 ra->longest = max(ra->longest, arec->ar_blockcount);
674 agf->agf_longest = cpu_to_be32(ra->longest);
774 ra->longest = 0;
H A Dagheader_repair.c84 xfs_agblock_t longest; member in struct:xrep_agf_allocbt
101 if (rec->ar_blockcount > raa->longest)
102 raa->longest = rec->ar_blockcount;
268 agf->agf_longest = cpu_to_be32(raa.longest);
/linux-master/fs/ocfs2/dlm/
H A Ddlmdebug.c409 unsigned long total = 0, longest = 0, bucket_count = 0; local
424 longest = max(longest, bucket_count);
430 "Total: %lu, Longest: %lu\n", total, longest);
/linux-master/fs/xfs/libxfs/
H A Dxfs_dir2_node.c1192 int longest)
1204 freehdr.bests[findex] = cpu_to_be16(longest);
1282 int longest; /* longest data free entry */ local
1322 * Make the data entry free. Keep track of the longest freespace
1329 longest = be16_to_cpu(bf[0].length);
1344 * If the longest data block freespace changes, need to update
1347 if (longest < be16_to_cpu(bf[0].length)) {
1377 longest = be16_to_cpu(bf[0].length);
1382 if (longest
1185 xfs_dir3_data_block_free( xfs_da_args_t *args, struct xfs_dir2_data_hdr *hdr, struct xfs_dir2_free *free, xfs_dir2_db_t fdb, int findex, struct xfs_buf *fbp, int longest) argument
[all...]
H A Dxfs_ialloc.c1692 xfs_extlen_t longest = 0; local
1722 * of inode chunks when checking the longest contiguous free space in
1745 longest = pag->pagf_longest;
1746 if (!longest)
1747 longest = pag->pagf_flcount > 0;
1750 if (pag->pagf_freeblks < needspace + ineed || longest < ineed)
H A Dxfs_bmap.c3272 xfs_extlen_t longest; local
3282 longest = xfs_alloc_longest_free_extent(pag,
3285 if (*blen < longest)
3286 *blen = longest;
3507 * Unlike the longest extent available in an AG, we don't track
H A Dxfs_alloc.c2286 * Find the length of the longest extent in an AG. The 'need' parameter
2301 * longest extent.
2308 * not-longest freesp extents, we'll have to subtract /that/ from
2309 * the longest extent too.
2315 * If the longest extent is long enough to satisfy all the
2387 xfs_extlen_t alloc_len, longest; local
2399 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation);
2400 if (longest < alloc_len)
/linux-master/tools/net/ynl/
H A Dynl-gen-c.py1356 longest = 0
1358 if len(define[0]) > longest:
1359 longest = len(define[0])
1360 longest = ((longest + 8) // 8) * 8
1363 line += '\t' * ((longest - len(define[0]) + 7) // 8)
1371 longest = max([len(x[0]) for x in members])
1372 longest += 1 # because we prepend a .
1373 longest = ((longest
[all...]
/linux-master/drivers/remoteproc/
H A Dremoteproc_core.c2722 unsigned int longest = 0; local
2736 longest = max(longest, d);
2741 * Delay for the longest requested duration before returning. This can
2746 mdelay(longest);
/linux-master/lib/
H A Dvsprintf.c1364 int longest = 1; local
1383 /* find position of longest 0 run */
1392 if (zerolength[i] > longest) {
1393 longest = zerolength[i];
1397 if (longest == 1) /* don't compress a single 0 */
1407 i += longest - 1;
/linux-master/tools/perf/util/
H A Dparse-events.c329 * case. If mutliple entries in names match str then the longest
334 * @longest: Out argument giving the length of the matching entry.
337 int *longest)
339 *longest = -1;
344 if (n > *longest && !strncasecmp(str, names[i][j], n))
345 *longest = n;
347 if (*longest > 0)
372 * contain hyphens and the longest name
2737 /* "no-overwrite" is the longest name */
336 parse_aliases(const char *str, const char *const names[][EVSEL__MAX_ALIASES], int size, int *longest) argument
/linux-master/arch/arm/boot/compressed/
H A Dhead.S1316 bic r1, r1, #63 @ align to longest cache line

Completed in 389 milliseconds