Lines Matching defs:that
300 static long check_treesize(struct dirtree *that, off_t *size)
304 while (that) {
305 *size += sizeof(struct ext2_dentry) + strlen(that->name);
307 if (that->child)
308 that->st.st_blocks = check_treesize(that->child, &that->st.st_size);
309 else if (S_ISREG(that->st.st_mode)) {
310 that->st.st_blocks = file_blocks_used(that->st.st_size, 0);
311 TT.treeblocks += that->st.st_blocks;
313 that = that->next;
324 // ugly n^2 way of dealing with the problem that doesn't scale well to large
330 struct dirtree *current=tree, *that;
344 for (that = tree; that; that = treenext(that)) {
345 if (current->st.st_ino == that->st.st_ino &&
346 current->st.st_dev == that->st.st_dev)
391 // allocation bitmap that fits in one block (I.E. how many bits per block)?
499 static void fill_inode(struct ext2_inode *in, struct dirtree *that)
504 file_blocks_used(that->st.st_size, fbu);
506 // If that inode needs data blocks allocated to it.
507 if (that->st.st_size) {
518 in->mode = SWAP_LE32(that->st.st_mode);
520 in->uid = SWAP_LE16(that->st.st_uid & 0xFFFF);
521 in->uid_high = SWAP_LE16(that->st.st_uid >> 16);
522 in->gid = SWAP_LE16(that->st.st_gid & 0xFFFF);
523 in->gid_high = SWAP_LE16(that->st.st_gid >> 16);
524 in->size = SWAP_LE32(that->st.st_size & 0xFFFFFFFF);
528 if (sizeof(that->st.st_size) > 4) temp = 32;
530 if (temp) in->dir_acl = SWAP_LE32(that->st.st_size >> temp);
532 in->atime = SWAP_LE32(that->st.st_atime);
533 in->ctime = SWAP_LE32(that->st.st_ctime);
534 in->mtime = SWAP_LE32(that->st.st_mtime);
536 in->links_count = SWAP_LE16(that->st.st_nlink);
537 in->blocks = SWAP_LE32(that->st.st_blocks);
543 // exists, that size will be used.
607 // needs, start with a minimal guess, find the overhead of that many
712 // Now write out stuff that every block group has.