| /fs/nilfs2/ |
| D | btree.c | 37 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_alloc_path() local
43 for (; level < NILFS_BTREE_LEVEL_MAX; level++) { in nilfs_btree_alloc_path()
44 path[level].bp_bh = NULL; in nilfs_btree_alloc_path()
45 path[level].bp_sib_bh = NULL; in nilfs_btree_alloc_path()
46 path[level].bp_index = 0; in nilfs_btree_alloc_path()
47 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
48 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
49 path[level].bp_op = NULL; in nilfs_btree_alloc_path()
58 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_free_path() local
60 for (; level < NILFS_BTREE_LEVEL_MAX; level++) in nilfs_btree_free_path()
[all …]
|
| /fs/xfs/ |
| D | xfs_btree.c | 55 int level, /* level of the btree block */ in xfs_btree_check_lblock() argument
64 be16_to_cpu(block->bb_level) == level && in xfs_btree_check_lblock()
66 cur->bc_ops->get_maxrecs(cur, level) && in xfs_btree_check_lblock()
91 int level, /* level of the btree block */ in xfs_btree_check_sblock() argument
104 be16_to_cpu(block->bb_level) == level && in xfs_btree_check_sblock()
106 cur->bc_ops->get_maxrecs(cur, level) && in xfs_btree_check_sblock()
132 int level, /* level of the btree block */ in xfs_btree_check_block() argument
136 return xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_block()
138 return xfs_btree_check_sblock(cur, block, level, bp); in xfs_btree_check_block()
148 int level) /* btree block level */ in xfs_btree_check_lptr() argument
[all …]
|
| D | xfs_error.c | 156 int level, in xfs_error_report() argument
162 if (level <= xfs_error_level) { in xfs_error_report()
174 int level, in xfs_corruption_error() argument
181 if (level <= xfs_error_level) in xfs_corruption_error()
183 xfs_error_report(tag, level, mp, filename, linenum, ra); in xfs_corruption_error()
|
| D | xfs_bmap_btree.c | 612 int level) in xfs_bmbt_get_minrecs() argument
614 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()
621 ifp->if_broot_bytes, level == 0) / 2; in xfs_bmbt_get_minrecs()
624 return cur->bc_mp->m_bmap_dmnr[level != 0]; in xfs_bmbt_get_minrecs()
630 int level) in xfs_bmbt_get_maxrecs() argument
632 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()
639 ifp->if_broot_bytes, level == 0); in xfs_bmbt_get_maxrecs()
642 return cur->bc_mp->m_bmap_dmxr[level != 0]; in xfs_bmbt_get_maxrecs()
658 int level) in xfs_bmbt_get_dmaxrecs() argument
660 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()
[all …]
|
| D | xfs_da_btree.c | 103 xfs_da_node_create(xfs_da_args_t *args, xfs_dablk_t blkno, int level, in xfs_da_node_create() argument
124 node->hdr.level = cpu_to_be16(level); in xfs_da_node_create()
349 be16_to_cpu(node->hdr.level) + 1, &bp, args->whichfork); in xfs_da_root_split()
713 xfs_da_blkinfo_onlychild_validate(struct xfs_da_blkinfo *blkinfo, __u16 level) in xfs_da_blkinfo_onlychild_validate() argument
717 if (level == 1) { in xfs_da_blkinfo_onlychild_validate()
726 #define xfs_da_blkinfo_onlychild_validate(blkinfo, level) argument
770 be16_to_cpu(oldroot->hdr.level)); in xfs_da_root_join()
916 int level, count; in xfs_da_fixhashpath() local
918 level = path->active-1; in xfs_da_fixhashpath()
919 blk = &path->blk[ level ]; in xfs_da_fixhashpath()
[all …]
|
| D | xfs_message.c | 33 const char *level, in __xfs_printk() argument
38 printk("%sXFS (%s): %pV\n", level, mp->m_fsname, vaf); in __xfs_printk()
41 printk("%sXFS: %pV\n", level, vaf); in __xfs_printk()
|
| D | xfs_btree.h | 171 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
172 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
175 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level);
275 int level, /* level of the btree block */
285 int level); /* btree block level */
333 int level); /* level to check */
|
| /fs/btrfs/ |
| D | ctree.c | 28 *root, struct btrfs_path *path, int level);
40 struct btrfs_path *path, int level, int slot);
243 int level; in btrfs_copy_root() local
250 level = btrfs_header_level(buf); in btrfs_copy_root()
251 if (level == 0) in btrfs_copy_root()
257 new_root_objectid, &disk_key, level, in btrfs_copy_root()
439 int level, ret; in __btrfs_cow_block() local
453 level = btrfs_header_level(buf); in __btrfs_cow_block()
455 if (level == 0) in __btrfs_cow_block()
470 level, search_start, empty_size, 1); in __btrfs_cow_block()
[all …]
|
| D | relocation.c | 64 unsigned int level:8; member
143 unsigned int level:8; member
479 int level = 0; in update_backref_cache() local
512 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
513 list_for_each_entry(node, &cache->pending[level], list) { in update_backref_cache()
665 int level, u64 bytenr) argument
705 node->level = level;
845 upper->level = cur->level + 1;
876 if (btrfs_root_level(&root->root_item) == cur->level) {
887 level = cur->level + 1;
[all …]
|
| D | extent-tree.c | 93 int level, struct btrfs_key *ins);
97 static int find_next_key(struct btrfs_path *path, int level,
1408 static int find_next_key(struct btrfs_path *path, int level, in find_next_key() argument
1412 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
1413 if (!path->nodes[level]) in find_next_key()
1415 if (path->slots[level] + 1 >= in find_next_key()
1416 btrfs_header_nritems(path->nodes[level])) in find_next_key()
1418 if (level == 0) in find_next_key()
1419 btrfs_item_key_to_cpu(path->nodes[level], key, in find_next_key()
1420 path->slots[level] + 1); in find_next_key()
[all …]
|
| D | tree-log.c | 1669 int level; in replay_one_buffer() local
1675 level = btrfs_header_level(eb); in replay_one_buffer()
1677 if (level != 0) in replay_one_buffer()
1749 struct btrfs_path *path, int *level, in walk_down_log_tree() argument
1761 WARN_ON(*level < 0); in walk_down_log_tree()
1762 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
1764 while (*level > 0) { in walk_down_log_tree()
1765 WARN_ON(*level < 0); in walk_down_log_tree()
1766 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
1767 cur = path->nodes[*level]; in walk_down_log_tree()
[all …]
|
| D | print-tree.c | 305 int level; in btrfs_print_tree() local
310 level = btrfs_header_level(c); in btrfs_print_tree()
311 if (level == 0) { in btrfs_print_tree()
317 level, nr, in btrfs_print_tree()
331 btrfs_level_size(root, level - 1), in btrfs_print_tree()
334 level != 1) in btrfs_print_tree()
337 level - 1) in btrfs_print_tree()
|
| D | backref.c | 34 int level; member
41 struct btrfs_key *key, int level, u64 parent, in __add_prelim_ref() argument
57 ref->level = level; in __add_prelim_ref()
68 struct extent_buffer *eb, int level, in add_all_parents() argument
82 if (level != 0) in add_all_parents()
131 int level = ref->level; in __resolve_indirect_ref() local
151 if (root_level + 1 == level) in __resolve_indirect_ref()
154 path->lowest_level = level; in __resolve_indirect_ref()
158 (unsigned long long)ref->root_id, level, ref->count, ret, in __resolve_indirect_ref()
164 eb = path->nodes[level]; in __resolve_indirect_ref()
[all …]
|
| D | reada.c | 104 struct btrfs_key *top, int level, u64 generation);
111 int level = 0; in __readahead_hook() local
123 level = btrfs_header_level(eb); in __readahead_hook()
146 nritems = level ? btrfs_header_nritems(eb) : 0; in __readahead_hook()
201 level - 1, n_gen); in __readahead_hook()
320 struct btrfs_key *top, int level) in reada_find_extent() argument
349 blocksize = btrfs_level_size(root, level); in reada_find_extent()
535 struct btrfs_key *top, int level, u64 generation) in reada_add_block() argument
541 re = reada_find_extent(root, logical, top, level); /* takes one ref */ in reada_add_block()
891 int level; in btrfs_reada_add() local
[all …]
|
| D | tree-defrag.c | 38 int level; in btrfs_defrag_leaves() local
65 level = btrfs_header_level(root->node); in btrfs_defrag_leaves()
67 if (level == 0) in btrfs_defrag_leaves()
|
| /fs/logfs/ |
| D | readwrite.c | 23 static u64 adjust_bix(u64 bix, level_t level) in adjust_bix() argument
25 switch (level) { in adjust_bix()
67 pgoff_t logfs_pack_index(u64 bix, level_t level) in logfs_pack_index() argument
72 if (level == 0) in logfs_pack_index()
76 index |= (__force long)level << LEVEL_SHIFT; in logfs_pack_index()
77 index |= bix >> ((__force u8)level * LOGFS_BLOCK_BITS); in logfs_pack_index()
81 void logfs_unpack_index(pgoff_t index, u64 *bix, level_t *level) in logfs_unpack_index() argument
87 *level = 0; in logfs_unpack_index()
92 *level = LEVEL(__level); in logfs_unpack_index()
94 *bix = adjust_bix(*bix, *level); in logfs_unpack_index()
[all …]
|
| D | logfs.h | 97 #define LEVEL(level) ((__force level_t)(level)) argument
100 #define SUBLEVEL(level) ( (void)((level) == LEVEL(1)), \ argument
101 (__force level_t)((__force u8)(level) - 1) )
300 level_t level; member
312 level_t level, int child_no, __be64 val);
539 level_t level, int child_no, __be64 val);
543 pgoff_t logfs_pack_index(u64 bix, level_t level);
544 void logfs_unpack_index(pgoff_t index, u64 *bix, level_t *level);
573 u64 ino, u64 bix, level_t level);
588 level_t level);
[all …]
|
| D | segment.c | 167 level_t level) in alias_tree_lookup() argument
170 pgoff_t index = logfs_pack_index(bix, level); in alias_tree_lookup()
176 level_t level, void *val) in alias_tree_insert() argument
179 pgoff_t index = logfs_pack_index(bix, level); in alias_tree_insert()
192 block->level, item->child_no, item->val); in btree_write_alias()
212 level_t level; in logfs_load_object_aliases() local
229 level = LEVEL(oa[i].level); in logfs_load_object_aliases()
232 ino, bix, level, item->child_no, in logfs_load_object_aliases()
234 block = alias_tree_lookup(sb, ino, bix, level); in logfs_load_object_aliases()
236 block = __alloc_block(sb, ino, bix, level); in logfs_load_object_aliases()
[all …]
|
| /fs/ocfs2/dlmfs/ |
| D | userdlm.c | 115 static inline int user_highest_compat_lock_level(int level) in user_highest_compat_lock_level() argument
119 if (level == DLM_LOCK_EX) in user_highest_compat_lock_level()
121 else if (level == DLM_LOCK_PR) in user_highest_compat_lock_level()
214 static void user_bast(struct ocfs2_dlm_lksb *lksb, int level) in user_bast() argument
219 lockres->l_namelen, lockres->l_name, level, lockres->l_level); in user_bast()
223 if (level > lockres->l_blocking) in user_bast()
224 lockres->l_blocking = level; in user_bast()
399 int level) in user_dlm_inc_holders() argument
401 switch(level) { in user_dlm_inc_holders()
426 int level, in user_dlm_cluster_lock() argument
[all …]
|
| D | dlmfs.c | 118 int *level, in dlmfs_decode_open_flags() argument
122 *level = DLM_LOCK_EX; in dlmfs_decode_open_flags()
124 *level = DLM_LOCK_PR; in dlmfs_decode_open_flags()
136 int status, level, flags; in dlmfs_file_open() local
146 status = dlmfs_decode_open_flags(file->f_flags, &level, &flags); in dlmfs_file_open()
159 fp->fp_lock_level = level; in dlmfs_file_open()
163 status = user_dlm_cluster_lock(&ip->ip_lockres, level, flags); in dlmfs_file_open()
183 int level, status; in dlmfs_file_release() local
194 level = fp->fp_lock_level; in dlmfs_file_release()
195 if (level != DLM_LOCK_IV) in dlmfs_file_release()
[all …]
|
| /fs/ubifs/ |
| D | tnc_misc.c | 43 int level, iip, level_search = 0; in ubifs_tnc_levelorder_next() local
52 if (znode->level == 0) in ubifs_tnc_levelorder_next()
57 level = znode->level; in ubifs_tnc_levelorder_next()
61 ubifs_assert(znode->level <= zr->level); in ubifs_tnc_levelorder_next()
75 level -= 1; in ubifs_tnc_levelorder_next()
76 if (level_search || level < 0) in ubifs_tnc_levelorder_next()
100 while (zn->level != level) { in ubifs_tnc_levelorder_next()
114 ubifs_assert(zn->level >= 0); in ubifs_tnc_levelorder_next()
184 while (znode->level > 0) { in ubifs_tnc_postorder_first()
240 if (zn->level > 0 && in ubifs_destroy_tnc_subtree()
[all …]
|
| D | tnc.c | 229 if (znode->level != 0) { in copy_znode()
632 while (znode->level != 0) { in tnc_next()
676 while (znode->level != 0) { in tnc_prev()
1104 if (c->zroot.znode->level > BOTTOM_UP_HEIGHT) { in dirty_cow_bottom_up()
1106 c->bottom_up_buf = kmalloc(c->zroot.znode->level * sizeof(int), in dirty_cow_bottom_up()
1112 if (c->zroot.znode->level) { in dirty_cow_bottom_up()
1121 ubifs_assert(p < c->zroot.znode->level); in dirty_cow_bottom_up()
1199 if (znode->level == 0) in ubifs_lookup_level0()
1220 dbg_tnc("found %d, lvl %d, n %d", exact, znode->level, *n); in ubifs_lookup_level0()
1269 dbg_tnc("found 0, lvl %d, n -1", znode->level); in ubifs_lookup_level0()
[all …]
|
| D | tnc_commit.c | 46 idx->level = cpu_to_le16(znode->level); in make_idx_node()
206 int level, int lnum, int offs) in is_idx_node_in_use() argument
210 ret = is_idx_node_in_tnc(c, key, level, lnum, offs); in is_idx_node_in_use()
260 int in_use, level; in layout_leb_in_gaps() local
265 level = le16_to_cpu(idx->level); in layout_leb_in_gaps()
267 in_use = is_idx_node_in_use(c, &snod->key, level, lnum, in layout_leb_in_gaps()
585 if (znode->level == 0) { in find_first_dirty()
856 idx->level = cpu_to_le16(znode->level); in write_index()
1073 dbg_cmt("TNC height is %d", c->zroot.znode->level + 1); in ubifs_tnc_end_commit()
|
| /fs/ocfs2/ |
| D | dlmglue.c | 122 static void ocfs2_dump_meta_lvb_info(u64 level, in ocfs2_dump_meta_lvb_info() argument
129 mlog(level, "LVB information for %s (called from %s:%u):\n", in ocfs2_dump_meta_lvb_info()
131 mlog(level, "version: %u, clusters: %u, generation: 0x%x\n", in ocfs2_dump_meta_lvb_info()
134 mlog(level, "size: %llu, uid %u, gid %u, mode 0x%x\n", in ocfs2_dump_meta_lvb_info()
138 mlog(level, "nlink %u, atime_packed 0x%llx, ctime_packed 0x%llx, " in ocfs2_dump_meta_lvb_info()
342 int level,
348 int level, unsigned long caller_ip);
351 int level) in ocfs2_cluster_unlock() argument
353 __ocfs2_cluster_unlock(osb, lockres, level, _RET_IP_); in ocfs2_cluster_unlock()
359 static int ocfs2_generic_handle_bast(struct ocfs2_lock_res *lockres, int level);
[all …]
|
| D | locks.c | 41 int ret = 0, level = 0, trylock = 0; in ocfs2_do_flock() local
46 level = 1; in ocfs2_do_flock()
59 if (level == old_level) in ocfs2_do_flock()
75 ret = ocfs2_file_lock(file, level, trylock); in ocfs2_do_flock()
|