Lines Matching refs:leaf

1342 The mappings point to leaf blocks, remote value blocks, or dabtree blocks.
1346 Names are always stored elsewhere in the same leaf block.
1348 elsewhere in the same leaf block.
1349 Remote value blocks contain values that are too large to fit inside a leaf.
1350 If the leaf information exceeds a single filesystem block, a dabtree (also
1351 rooted at block 0) is created to map hashes of the attribute names to leaf
1356 Scrub must read each block mapped by the attr fork and ignore the non-leaf
1361    attr leaf blocks.
1363 2. Walk the blocks of the attr fork looking for leaf blocks.
1364    For each entry inside a leaf:
1446 The format of leaf and node records are the same -- each entry points to the
1448 leaf blocks, and dabtree leaf records pointing to non-dabtree blocks elsewhere
1467 - Do leaf pointers within the dabtree point to valid fork offsets for directory
1468   or attr leaf blocks?
1477 - For each dabtree leaf record, does the record key accurate reflect the
2372 will fit in a leaf block from the size of a btree block and the size of the
2387 newly rebuilt leaf block will cause a tree split, which causes a noticeable
2406 Once that's done, the number of leaf blocks required to store the record set
2483 rest of the block with records, and adds the new leaf block to a list of
2487   │leaf│
2494   │leaf│→│leaf│→│leaf│→│leaf│
2498 When it finishes writing the record leaf blocks, it moves on to the node
2509   │leaf│→│leaf│→│leaf│→│leaf│
2526   │leaf│→│leaf│→│leaf│→│leaf│
4338 structure is always in logical block zero, but attribute leaf blocks, dabtree
4340 Attribute leaf blocks contain variable-sized records that associate
4343 If the leaf information expands beyond a single block, a directory/attribute
4350    leaf blocks.
4353    a. Walk the attr leaf block to find candidate keys.