Home
last modified time | relevance | path

Searched refs:be_state (Results 1 – 3 of 3) sorted by relevance

/fs/nfs/blocklayout/
A Dextent_tree.c76 if (be1->be_state != be2->be_state) in ext_can_merge()
84 if (be1->be_state != PNFS_BLOCK_NONE_DATA && in ext_can_merge()
88 if (be1->be_state == PNFS_BLOCK_INVALID_DATA && in ext_can_merge()
150 if (be->be_state != PNFS_BLOCK_NONE_DATA) in __ext_tree_insert()
211 if (be->be_state != PNFS_BLOCK_NONE_DATA) { in __ext_tree_remove()
216 new->be_state = be->be_state; in __ext_tree_remove()
223 if (be->be_state != PNFS_BLOCK_NONE_DATA) { in __ext_tree_remove()
246 if (be->be_state != PNFS_BLOCK_NONE_DATA) in __ext_tree_remove()
262 switch (new->be_state) { in ext_tree_insert()
394 if (be->be_state != PNFS_BLOCK_NONE_DATA) in ext_tree_split()
[all …]
A Dblocklayout.c54 switch (be->be_state) { in is_hole()
509 if (be->be_state == PNFS_BLOCK_READWRITE_DATA || in verify_extent()
510 be->be_state == PNFS_BLOCK_INVALID_DATA) in verify_extent()
518 if (be->be_state == PNFS_BLOCK_READWRITE_DATA) { in verify_extent()
526 } else if (be->be_state == PNFS_BLOCK_INVALID_DATA) { in verify_extent()
531 } else if (be->be_state == PNFS_BLOCK_READ_DATA) { in verify_extent()
647 be->be_state = be32_to_cpup(p++); in bl_alloc_extent()
A Dblocklayout.h137 enum pnfs_block_extent_state be_state; /* the state of this extent */ member

Completed in 10 milliseconds