Lines Matching defs:leaf
37 * beginning of the leaf block. The dirents reside in leaves when
44 * used as an array of 64-bit block pointers pointing to the leaf blocks. The
46 * block pointer in the array that points to the same leaf. In fact, when a
48 * point to the same leaf.
50 * When a leaf is completely full, the size of the hash table can be
77 #define IS_LEAF 1 /* Hashed (leaf) directory */
536 * return first dirent whether bh points to leaf or stuffed dinode
710 * get_leaf_nr - Get a leaf number associated with the index
759 struct gfs2_leaf *leaf;
777 leaf = (struct gfs2_leaf *)bh->b_data;
778 ln = be64_to_cpu(leaf->lf_next);
808 struct gfs2_leaf *leaf;
816 leaf = (struct gfs2_leaf *)bh->b_data;
817 leaf->lf_depth = cpu_to_be16(depth);
818 leaf->lf_entries = 0;
819 leaf->lf_dirent_format = cpu_to_be32(GFS2_FORMAT_DE);
820 leaf->lf_next = 0;
821 memset(leaf->lf_reserved, 0, sizeof(leaf->lf_reserved));
822 dent = (struct gfs2_dirent *)(leaf+1);
825 return leaf;
842 struct gfs2_leaf *leaf;
853 /* Turn over a new leaf */
855 leaf = new_leaf(inode, &bh, 0);
856 if (!leaf)
861 leaf->lf_entries = cpu_to_be16(dip->i_di.di_entries);
896 /* We're done with the new leaf block, now setup the new
923 * dir_split_leaf - Split a leaf block into two
949 /* Get the old leaf block */
969 /* Compute the start and len of leaf pointers in the hash table. */
1253 current leaf */
1273 int leaf = 0;
1296 * zone in case the number of entries in the leaf is corrupt.
1298 * leaf block.
1323 "leaf %llu, entries2 (%u) != "
1332 larr[leaf++] = bh;
1342 for(i = 0; i < leaf; i++)
1515 struct gfs2_leaf *leaf, *oleaf;
1537 leaf = new_leaf(inode, &bh, be16_to_cpu(oleaf->lf_depth));
1538 if (!leaf) {
1573 struct gfs2_leaf *leaf;
1586 leaf = (struct gfs2_leaf *)bh->b_data;
1587 leaf->lf_entries = cpu_to_be16(be16_to_cpu(leaf->lf_entries) + 1);
1665 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data;
1666 u16 entries = be16_to_cpu(leaf->lf_entries);
1669 leaf->lf_entries = cpu_to_be16(--entries);
1736 * foreach_leaf - call a function for each leaf in a directory
1748 struct gfs2_leaf *leaf;
1787 leaf = (struct gfs2_leaf *)bh->b_data;
1788 len = 1 << (dip->i_di.di_depth - be16_to_cpu(leaf->lf_depth));
1812 * leaf_dealloc - Deallocate a directory leaf
1815 * @len: the number of pointers to this leaf
1816 * @leaf_no: the leaf number
1930 * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory