Home
last modified time | relevance | path

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

/fs/xfs/
Dxfs_filestream.c108 xfs_extlen_t longest, free = 0, minfree, maxfree = 0; in xfs_filestream_pick_ag() local
157 longest = xfs_alloc_longest_free_extent(pag, in xfs_filestream_pick_ag()
160 if (((minlen && longest >= minlen) || in xfs_filestream_pick_ag()
Dxfs_trace.h1565 __field(__u32, longest)
1583 __entry->longest = be32_to_cpu(agf->agf_longest);
1601 __entry->longest,
/fs/xfs/scrub/
Dagheader_repair.c65 xfs_agblock_t longest; member
82 if (rec->ar_blockcount > raa->longest) in xrep_agf_walk_allocbt()
83 raa->longest = rec->ar_blockcount; in xrep_agf_walk_allocbt()
259 agf->agf_longest = cpu_to_be32(raa.longest); in xrep_agf_calc_from_btrees()
/fs/nfsd/
Dfilecache.c1063 unsigned int i, count = 0, longest = 0; in nfsd_file_cache_stats_show() local
1075 longest = max(longest, nfsd_file_hashtbl[i].nfb_count); in nfsd_file_cache_stats_show()
1084 seq_printf(m, "longest chain: %u\n", longest); in nfsd_file_cache_stats_show()
/fs/ocfs2/dlm/
Ddlmdebug.c411 unsigned long total = 0, longest = 0, bucket_count = 0; in debug_mle_print() local
426 longest = max(longest, bucket_count); in debug_mle_print()
432 "Total: %lu, Longest: %lu\n", total, longest); in debug_mle_print()
/fs/xfs/libxfs/
Dxfs_dir2_node.c1186 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()
Dxfs_ialloc.c939 xfs_extlen_t longest = 0; /* longest extent available */ in xfs_ialloc_ag_select() local
1015 longest = pag->pagf_longest; in xfs_ialloc_ag_select()
1016 if (!longest) in xfs_ialloc_ag_select()
1017 longest = pag->pagf_flcount > 0; in xfs_ialloc_ag_select()
1020 longest >= ineed) { in xfs_ialloc_ag_select()
Dxfs_alloc.c2288 xfs_extlen_t alloc_len, longest; in xfs_alloc_space_available() local
2300 longest = xfs_alloc_longest_free_extent(pag, min_free, reservation); in xfs_alloc_space_available()
2301 if (longest < alloc_len) in xfs_alloc_space_available()
Dxfs_bmap.c3286 xfs_extlen_t longest; in xfs_bmap_longest_free_extent() local
3302 longest = xfs_alloc_longest_free_extent(pag, in xfs_bmap_longest_free_extent()
3305 if (*blen < longest) in xfs_bmap_longest_free_extent()
3306 *blen = longest; in xfs_bmap_longest_free_extent()