Lines Matching refs:blocks
58 Since LFS is based on out-of-place writes, it produces so many obsolete blocks
60 needs to reclaim these obsolete blocks seamlessly to users. This job is called
66 segment summary blocks.
86 - Use a term, “node”, that represents inodes as well as various pointer blocks
88 blocks; this will cut off the update propagation.
203 commands that consist small blocks less than 2MB.
358 validity of all the blocks.
361 : It is composed of a block address table for all the node blocks stored in
366 data and node blocks stored in Main area.
412 data blocks, and one indirect node block contains also 1018 node blocks. Thus,
429 Note that, all the node blocks are mapped by NAT which means the location of
471 "A(2B)" means a bucket includes 2 data blocks.
489 The number of blocks and buckets are determined by,
492 # of blocks in level #n = |
534 - Hot node contains direct node blocks of directories.
535 - Warm node contains direct node blocks except hot node blocks.
536 - Cold node contains indirect node blocks
537 - Hot data contains dentry blocks
538 - Warm data contains data blocks except hot and cold data blocks
539 - Cold data contains multimedia data or migrated data blocks
568 of valid blocks. In the cost-benefit algorithm, F2FS selects a victim segment
569 according to the segment age and the number of valid blocks in order to address
576 bitmap is composed of a bit stream covering whole blocks in main area.