Cross Reference: /external/toybox/toys/pending/mke2fs.c

Lines Matching refs:that
164 static long check_treesize(struct dirtree *that, off_t *size)
168   while (that) {
169     *size += sizeof(struct ext2_dentry) + strlen(that->name);
171     if (that->child)
172       that->st.st_blocks = check_treesize(that->child, &that->st.st_size);
173     else if (S_ISREG(that->st.st_mode)) {
174        that->st.st_blocks = file_blocks_used(that->st.st_size, 0);
175        TT.treeblocks += that->st.st_blocks;
177     that = that->next;
188 // ugly n^2 way of dealing with the problem that doesn't scale well to large
194   struct dirtree *current=tree, *that;
208       for (that = tree; that; that = treenext(that)) {
209         if (current->st.st_ino == that->st.st_ino &&
210           current->st.st_dev == that->st.st_dev)
280   // allocation bitmap that fits in one block (I.E. how many bits per block)?
388 static void fill_inode(struct ext2_inode *in, struct dirtree *that)
393   file_blocks_used(that->st.st_size, fbu);
395   // If that inode needs data blocks allocated to it.
396   if (that->st.st_size) {
407   in->mode = SWAP_LE32(that->st.st_mode);
409   in->uid = SWAP_LE16(that->st.st_uid & 0xFFFF);
410   in->uid_high = SWAP_LE16(that->st.st_uid >> 16);
411   in->gid = SWAP_LE16(that->st.st_gid & 0xFFFF);
412   in->gid_high = SWAP_LE16(that->st.st_gid >> 16);
413   in->size = SWAP_LE32(that->st.st_size & 0xFFFFFFFF);
417   if (sizeof(that->st.st_size) > 4) temp = 32;
419   if (temp) in->dir_acl = SWAP_LE32(that->st.st_size >> temp);
421   in->atime = SWAP_LE32(that->st.st_atime);
422   in->ctime = SWAP_LE32(that->st.st_ctime);
423   in->mtime = SWAP_LE32(that->st.st_mtime);
425   in->links_count = SWAP_LE16(that->st.st_nlink);
426   in->blocks = SWAP_LE32(that->st.st_blocks);
432 // exists, that size will be used.
495   // needs, start with a minimal guess, find the overhead of that many
600     // Now write out stuff that every block group has.