/fs/jfs/ |
D | jfs_btree.h | 119 struct btframe *top; member 125 (btstack)->top = (btstack)->stack 128 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1])) 133 (BTSTACK)->top->bn = BN;\ 134 (BTSTACK)->top->index = INDEX;\ 135 ++(BTSTACK)->top;\ 139 ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top ) 142 ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top ) 169 if (! BT_IS_ROOT((BTSTACK)->top->mp))\ 170 release_metapage((BTSTACK)->top->mp);\
|
D | jfs_xtree.c | 190 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtLookup() 296 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtLookupList() 619 btsp = btstack->top; in xtSearch() 666 btsp = btstack->top; in xtSearch() 724 btsp = btstack->top; in xtSearch() 829 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtInsert() 1644 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtExtend() 1811 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtTailgate() 1993 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0); in xtUpdate() 2307 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0); in xtUpdate() [all …]
|
D | jfs_dtree.c | 703 btsp = btstack->top; in dtSearch() 752 btsp = btstack->top; in dtSearch() 842 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtInsert() 2107 DT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in dtDelete() 2476 DT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index); in dtRelocate() 2704 btsp = btstack->top; in dtSearchNode() 3117 DT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in jfs_readdir() 3167 DT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in jfs_readdir() 3360 btsp = btstack->top; in dtReadFirst() 3429 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtReadNext() [all …]
|
D | jfs_txnmgr.c | 1150 ino_t top; in txCommit() local 1206 top = (cd.iplist[k])->i_ino; in txCommit() 1209 if (ip->i_ino > top) { in txCommit() 1210 top = ip->i_ino; in txCommit()
|
/fs/autofs4/ |
D | expire.c | 50 struct dentry *top = dentry; in autofs4_mount_busy() local 79 struct autofs_info *ino = autofs4_dentry_ino(top); in autofs4_mount_busy() 120 struct dentry *top, in autofs4_direct_busy() argument 125 top, (int) top->d_name.len, top->d_name.name); in autofs4_direct_busy() 129 struct autofs_info *ino = autofs4_dentry_ino(top); in autofs4_direct_busy() 136 if (!autofs4_can_expire(top, timeout, do_now)) in autofs4_direct_busy() 146 struct dentry *top, in autofs4_tree_busy() argument 150 struct autofs_info *top_ino = autofs4_dentry_ino(top); in autofs4_tree_busy() 154 top, (int)top->d_name.len, top->d_name.name); in autofs4_tree_busy() 157 if (!simple_positive(top)) in autofs4_tree_busy() [all …]
|
/fs/gfs2/ |
D | bmap.c | 41 struct buffer_head *bh, __be64 *top, 687 __be64 *top, *bottom; in recursive_scan() local 698 top = (__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)) + mp->mp_list[0]; in recursive_scan() 705 top = (__be64 *)(bh->b_data + mh_size) + in recursive_scan() 711 error = bc(ip, dibh, bh, top, bottom, height, data); in recursive_scan() 716 for (; top < bottom; top++, first = 0) { in recursive_scan() 717 if (!*top) in recursive_scan() 720 bn = be64_to_cpu(*top); in recursive_scan() 747 struct buffer_head *bh, __be64 *top, __be64 *bottom, in do_strip() argument 762 if (!*top) in do_strip() [all …]
|
/fs/ext3/ |
D | namei.c | 572 struct ext3_dir_entry_2 *de, *top; in htree_dirblock_to_tree() local 580 top = (struct ext3_dir_entry_2 *) ((char *) de + in htree_dirblock_to_tree() 583 for (; de < top; de = ext3_next_entry(de)) { in htree_dirblock_to_tree() 738 struct dx_map_entry *p, *q, *top = map + count - 1; in dx_sort_map() local 746 for (p = top, q = p - count; q >= map; p--, q--) in dx_sort_map() 753 q = top; in dx_sort_map() 968 struct ext3_dir_entry_2 *de, *top; in ext3_dx_find_entry() local 992 top = (struct ext3_dir_entry_2 *) ((char *) de + sb->s_blocksize - in ext3_dx_find_entry() 994 for (; de < top; de = ext3_next_entry(de)) { in ext3_dx_find_entry() 1263 char *top; in add_dirent_to_buf() local [all …]
|
D | inode.c | 1985 int offsets[4], Indirect chain[4], __le32 *top) in ext3_find_shared() argument 1990 *top = 0; in ext3_find_shared() 2016 *top = *p->p; in ext3_find_shared()
|
/fs/ext4/ |
D | namei.c | 576 struct ext4_dir_entry_2 *de, *top; in htree_dirblock_to_tree() local 585 top = (struct ext4_dir_entry_2 *) ((char *) de + in htree_dirblock_to_tree() 588 for (; de < top; de = ext4_next_entry(de)) { in htree_dirblock_to_tree() 743 struct dx_map_entry *p, *q, *top = map + count - 1; in dx_sort_map() local 750 for (p = top, q = p - count; q >= map; p--, q--) in dx_sort_map() 757 q = top; in dx_sort_map() 973 struct ext4_dir_entry_2 *de, *top; in ext4_dx_find_entry() local 997 top = (struct ext4_dir_entry_2 *) ((char *) de + sb->s_blocksize - in ext4_dx_find_entry() 999 for (; de < top; de = ext4_next_entry(de)) { in ext4_dx_find_entry() 1273 char *top; in add_dirent_to_buf() local [all …]
|
D | inode.c | 3477 ext4_lblk_t offsets[4], Indirect chain[4], __le32 *top) in ext4_find_shared() argument 3482 *top = 0; in ext4_find_shared() 3508 *top = *p->p; in ext4_find_shared()
|
/fs/minix/ |
D | itree_common.c | 220 block_t *top) in find_shared() argument 225 *top = 0; in find_shared() 242 *top = *p->p; in find_shared()
|
/fs/sysv/ |
D | itree.c | 280 sysv_zone_t *top) in find_shared() argument 285 *top = 0; in find_shared() 312 *top = *p->p; in find_shared()
|
/fs/ubifs/ |
D | Kconfig | 12 UBIFS is a file system for flash devices which works on top of UBI.
|
/fs/yaffs2/ |
D | yaffs_guts.c | 1398 yaffs_Tnode *tn = fStruct->top; in yaffs_FindLevel0Tnode() 1483 tn->internal[0] = fStruct->top; in yaffs_AddOrFindLevel0Tnode() 1484 fStruct->top = tn; in yaffs_AddOrFindLevel0Tnode() 1497 tn = fStruct->top; in yaffs_AddOrFindLevel0Tnode() 1743 obj->variant.fileVariant.top); in yaffs_SoftDeleteFile() 1744 obj->variant.fileVariant.top = NULL; in yaffs_SoftDeleteFile() 1751 obj->variant.fileVariant.top, in yaffs_SoftDeleteFile() 1813 fStruct->top = in yaffs_PruneFileStructure() 1814 yaffs_PruneWorker(dev, fStruct->top, fStruct->topLevel, 0); in yaffs_PruneFileStructure() 1824 tn = fStruct->top; in yaffs_PruneFileStructure() [all …]
|
D | yaffs_guts.h | 385 yaffs_Tnode *top; member
|
/fs/hfs/ |
D | hfs.h | 98 __be16 top; member
|
/fs/ |
D | binfmt_elf_fdpic.c | 918 unsigned long load_addr, base = ULONG_MAX, top = 0, maddr = 0, mflags; in elf_fdpic_map_file_constdisp_on_uclinux() local 934 if (top < phdr->p_vaddr + phdr->p_memsz) in elf_fdpic_map_file_constdisp_on_uclinux() 935 top = phdr->p_vaddr + phdr->p_memsz; in elf_fdpic_map_file_constdisp_on_uclinux() 944 maddr = do_mmap(NULL, load_addr, top - base, in elf_fdpic_map_file_constdisp_on_uclinux() 951 load_addr += PAGE_ALIGN(top - base); in elf_fdpic_map_file_constdisp_on_uclinux()
|
D | compat_ioctl.c | 732 void __user *top = compat_alloc_user_space(0); in sg_ioctl_trans() local 735 if (new > top) in sg_ioctl_trans()
|
/fs/hfsplus/ |
D | hfsplus_raw.h | 211 __be16 top; member
|
/fs/ntfs/ |
D | Kconfig | 73 on top of any DOS/Microsoft Windows system without partitioning your
|
/fs/ext2/ |
D | inode.c | 873 __le32 *top) in ext2_find_shared() argument 878 *top = 0; in ext2_find_shared() 904 *top = *p->p; in ext2_find_shared()
|
/fs/cifs/ |
D | TODO | 43 opens on top of each other by incrementing reference count rather
|
D | README | 24 and change directory into the top of the kernel directory 43 and change directory into the top of the kernel directory tree
|
D | CHANGES | 17 top of the share. Fix problem in 2.6.28 resolving DFS paths to
|
/fs/ocfs2/dlm/ |
D | dlmmaster.c | 3197 top: in dlm_clean_master_list() 3305 goto top; in dlm_clean_master_list()
|