| /fs/hfs/ |
| D | bnode.c | 18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, in hfs_bnode_read() argument
23 off += node->page_offset; in hfs_bnode_read()
24 page = node->page[0]; in hfs_bnode_read()
30 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
34 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
38 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
42 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
46 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
51 tree = node->tree; in hfs_bnode_read_key()
52 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
|
| D | brec.c | 19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
25 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
38 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
[all …]
|
| D | btree.c | 139 struct hfs_bnode *node; in hfs_btree_close() local
146 while ((node = tree->node_hash[i])) { in hfs_btree_close()
147 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
148 if (atomic_read(&node->refcnt)) in hfs_btree_close()
150 node->tree->cnid, node->this, in hfs_btree_close()
151 atomic_read(&node->refcnt)); in hfs_btree_close()
152 hfs_bnode_free(node); in hfs_btree_close()
163 struct hfs_bnode *node; in hfs_btree_write() local
166 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
167 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /fs/hfsplus/ |
| D | bnode.c | 22 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
27 off += node->page_offset; in hfs_bnode_read()
28 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
43 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
47 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
51 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
55 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
59 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
64 tree = node->tree; in hfs_bnode_read_key()
65 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
|
| D | brec.c | 20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
26 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
39 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
44 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen()
[all …]
|
| D | btree.c | 260 struct hfs_bnode *node; in hfs_btree_close() local
267 while ((node = tree->node_hash[i])) { in hfs_btree_close()
268 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
269 if (atomic_read(&node->refcnt)) in hfs_btree_close()
272 node->tree->cnid, node->this, in hfs_btree_close()
273 atomic_read(&node->refcnt)); in hfs_btree_close()
274 hfs_bnode_free(node); in hfs_btree_close()
285 struct hfs_bnode *node; in hfs_btree_write() local
288 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
289 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /fs/unicode/ |
| D | mkutf8data.c | 361 struct node { struct
366 struct node *parent; argument
382 struct node *node; in lookup() argument
385 node = tree->root; in lookup()
386 while (!leaf && node) { in lookup()
387 if (node->nextbyte) in lookup()
389 if (*key & (1 << (node->bitnum & 7))) { in lookup()
391 if (node->rightnode == NODE) { in lookup()
392 node = node->right; in lookup()
393 } else if (node->rightnode == LEAF) { in lookup()
[all …]
|
| /fs/ocfs2/cluster/ |
| D | quorum.c | 164 static void o2quo_set_hold(struct o2quo_state *qs, u8 node) in o2quo_set_hold() argument
168 if (!test_and_set_bit(node, qs->qs_hold_bm)) { in o2quo_set_hold()
171 "node %u\n", node); in o2quo_set_hold()
172 mlog(0, "node %u, %d total\n", node, qs->qs_holds); in o2quo_set_hold()
176 static void o2quo_clear_hold(struct o2quo_state *qs, u8 node) in o2quo_clear_hold() argument
180 if (test_and_clear_bit(node, qs->qs_hold_bm)) { in o2quo_clear_hold()
181 mlog(0, "node %u, %d total\n", node, qs->qs_holds - 1); in o2quo_clear_hold()
189 node, qs->qs_holds); in o2quo_clear_hold()
197 void o2quo_hb_up(u8 node) in o2quo_hb_up() argument
205 "node %u\n", node); in o2quo_hb_up()
[all …]
|
| D | nodemanager.c | 34 struct o2nm_node *node = NULL; in o2nm_get_node_by_num() local
40 node = o2nm_single_cluster->cl_nodes[node_num]; in o2nm_get_node_by_num()
41 if (node) in o2nm_get_node_by_num()
42 config_item_get(&node->nd_item); in o2nm_get_node_by_num()
45 return node; in o2nm_get_node_by_num()
73 struct o2nm_node *node, *ret = NULL; in o2nm_node_ip_tree_lookup() local
79 node = rb_entry(parent, struct o2nm_node, nd_ip_node); in o2nm_node_ip_tree_lookup()
81 cmp = memcmp(&ip_needle, &node->nd_ipv4_address, in o2nm_node_ip_tree_lookup()
88 ret = node; in o2nm_node_ip_tree_lookup()
103 struct o2nm_node *node = NULL; in o2nm_get_node_by_ip() local
[all …]
|
| /fs/xfs/libxfs/ |
| D | xfs_iext_tree.c | 161 struct xfs_iext_node *node = ifp->if_u1.if_root; in xfs_iext_find_first_leaf() local
168 node = node->ptrs[0]; in xfs_iext_find_first_leaf()
169 ASSERT(node); in xfs_iext_find_first_leaf()
172 return node; in xfs_iext_find_first_leaf()
179 struct xfs_iext_node *node = ifp->if_u1.if_root; in xfs_iext_find_last_leaf() local
187 if (!node->ptrs[i]) in xfs_iext_find_last_leaf()
189 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
190 ASSERT(node); in xfs_iext_find_last_leaf()
193 return node; in xfs_iext_find_last_leaf()
277 struct xfs_iext_node *node, in xfs_iext_key_cmp() argument
[all …]
|
| /fs/btrfs/ |
| D | delayed-inode.c | 70 struct btrfs_delayed_node *node; in btrfs_get_delayed_node() local
72 node = READ_ONCE(btrfs_inode->delayed_node); in btrfs_get_delayed_node()
73 if (node) { in btrfs_get_delayed_node()
74 refcount_inc(&node->refs); in btrfs_get_delayed_node()
75 return node; in btrfs_get_delayed_node()
79 node = radix_tree_lookup(&root->delayed_nodes_tree, ino); in btrfs_get_delayed_node()
81 if (node) { in btrfs_get_delayed_node()
83 refcount_inc(&node->refs); /* can be accessed */ in btrfs_get_delayed_node()
84 BUG_ON(btrfs_inode->delayed_node != node); in btrfs_get_delayed_node()
86 return node; in btrfs_get_delayed_node()
[all …]
|
| D | ulist.c | 63 struct ulist_node *node; in ulist_release() local
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
67 kfree(node); in ulist_release()
135 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase() argument
137 rb_erase(&node->rb_node, &ulist->root); in ulist_rbtree_erase()
138 list_del(&node->list); in ulist_rbtree_erase()
139 kfree(node); in ulist_rbtree_erase()
195 struct ulist_node *node; in ulist_add_merge() local
197 node = ulist_rbtree_search(ulist, val); in ulist_add_merge()
198 if (node) { in ulist_add_merge()
[all …]
|
| D | relocation.c | 83 struct backref_node *node[2]; member
190 struct backref_node *node);
192 struct backref_node *node);
213 struct backref_node *node; in backref_cache_cleanup() local
217 node = list_entry(cache->detached.next, in backref_cache_cleanup()
219 remove_backref_node(cache, node); in backref_cache_cleanup()
223 node = list_entry(cache->leaves.next, in backref_cache_cleanup()
225 remove_backref_node(cache, node); in backref_cache_cleanup()
241 struct backref_node *node; in alloc_backref_node() local
243 node = kzalloc(sizeof(*node), GFP_NOFS); in alloc_backref_node()
[all …]
|
| D | ordered-data.c | 32 struct rb_node *node) in tree_insert() argument
50 rb_link_node(node, parent, p); in tree_insert()
51 rb_insert_color(node, root); in tree_insert()
181 struct rb_node *node; in __btrfs_add_ordered_extent() local
219 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
221 if (node) in __btrfs_add_ordered_extent()
308 struct rb_node *node; in btrfs_dec_test_first_ordered_pending() local
318 node = tree_search(tree, *file_offset); in btrfs_dec_test_first_ordered_pending()
319 if (!node) { in btrfs_dec_test_first_ordered_pending()
324 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_first_ordered_pending()
[all …]
|
| /fs/nilfs2/ |
| D | btree.c | 73 static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node) in nilfs_btree_node_get_flags() argument
75 return node->bn_flags; in nilfs_btree_node_get_flags()
79 nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags) in nilfs_btree_node_set_flags() argument
81 node->bn_flags = flags; in nilfs_btree_node_set_flags()
84 static int nilfs_btree_node_root(const struct nilfs_btree_node *node) in nilfs_btree_node_root() argument
86 return nilfs_btree_node_get_flags(node) & NILFS_BTREE_NODE_ROOT; in nilfs_btree_node_root()
89 static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node) in nilfs_btree_node_get_level() argument
91 return node->bn_level; in nilfs_btree_node_get_level()
95 nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) in nilfs_btree_node_set_level() argument
97 node->bn_level = level; in nilfs_btree_node_set_level()
[all …]
|
| /fs/befs/ |
| D | btree.c | 100 struct befs_btree_node *node,
103 static int befs_leafnode(struct befs_btree_node *node);
105 static fs16 *befs_bt_keylen_index(struct befs_btree_node *node);
107 static fs64 *befs_bt_valarray(struct befs_btree_node *node);
109 static char *befs_bt_keydata(struct befs_btree_node *node);
112 struct befs_btree_node *node,
116 struct befs_btree_node *node,
192 struct befs_btree_node *node, befs_off_t node_off) in befs_bt_read_node() argument
198 if (node->bh) in befs_bt_read_node()
199 brelse(node->bh); in befs_bt_read_node()
[all …]
|
| /fs/jffs2/ |
| D | nodelist.c | 93 if (frag->node && (frag->ofs & (PAGE_SIZE - 1)) == 0) { in jffs2_truncate_fragtree()
96 frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE; in jffs2_truncate_fragtree()
104 if (this->node) { in jffs2_obsolete_node_frag()
105 this->node->frags--; in jffs2_obsolete_node_frag()
106 if (!this->node->frags) { in jffs2_obsolete_node_frag()
109 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); in jffs2_obsolete_node_frag()
110 jffs2_mark_node_obsolete(c, this->node->raw); in jffs2_obsolete_node_frag()
111 jffs2_free_full_dnode(this->node); in jffs2_obsolete_node_frag()
114 …ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); in jffs2_obsolete_node_frag()
115 mark_ref_normal(this->node->raw); in jffs2_obsolete_node_frag()
[all …]
|
| D | debug.c | 81 struct jffs2_full_dnode *fn = frag->node; in __jffs2_dbg_fragtree_paranoia_check_nolock()
99 && frag_prev(frag)->size < PAGE_SIZE && frag_prev(frag)->node) { in __jffs2_dbg_fragtree_paranoia_check_nolock()
106 && frag_next(frag)->size < PAGE_SIZE && frag_next(frag)->node) { in __jffs2_dbg_fragtree_paranoia_check_nolock()
711 if (this->node) in __jffs2_dbg_dump_fragtree_nolock()
713 this->ofs, this->ofs+this->size, ref_offset(this->node->raw), in __jffs2_dbg_dump_fragtree_nolock()
714 ref_flags(this->node->raw), this, frag_left(this), frag_right(this), in __jffs2_dbg_dump_fragtree_nolock()
775 union jffs2_node_union node; in __jffs2_dbg_dump_node() local
783 ret = jffs2_flash_read(c, ofs, len, &retlen, (unsigned char *)&node); in __jffs2_dbg_dump_node()
790 printk(JFFS2_DBG "magic:\t%#04x\n", je16_to_cpu(node.u.magic)); in __jffs2_dbg_dump_node()
791 printk(JFFS2_DBG "nodetype:\t%#04x\n", je16_to_cpu(node.u.nodetype)); in __jffs2_dbg_dump_node()
[all …]
|
| D | scan.c | 364 raw->next_in_ino = xd->node->next_in_ino; in jffs2_scan_xattr_node()
365 xd->node->next_in_ino = raw; in jffs2_scan_xattr_node()
444 struct jffs2_unknown_node *node; in jffs2_scan_eraseblock() local
638 if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
642 sizeof(*node)); in jffs2_scan_eraseblock()
648 if (buf_ofs + buf_len < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
659 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; in jffs2_scan_eraseblock()
721 if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { in jffs2_scan_eraseblock()
729 if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { in jffs2_scan_eraseblock()
736 if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { in jffs2_scan_eraseblock()
[all …]
|
| /fs/ext4/ |
| D | extents_status.c | 181 struct rb_node *node; in ext4_es_print_tree() local
185 node = rb_first(&tree->root); in ext4_es_print_tree()
186 while (node) { in ext4_es_print_tree()
188 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
192 node = rb_next(node); in ext4_es_print_tree()
213 struct rb_node *node = root->rb_node; in __es_tree_search() local
216 while (node) { in __es_tree_search()
217 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
219 node = node->rb_left; in __es_tree_search()
221 node = node->rb_right; in __es_tree_search()
[all …]
|
| D | block_validity.c | 24 struct rb_node node; member
58 &system_blks->root, node) in release_system_zone()
72 struct rb_node **n = &system_blks->root.rb_node, *node; in add_system_zone() local
77 entry = rb_entry(parent, struct ext4_system_zone, node); in add_system_zone()
89 node); in add_system_zone()
101 new_node = &new_entry->node; in add_system_zone()
108 node = rb_prev(new_node); in add_system_zone()
109 if (node) { in add_system_zone()
110 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
114 rb_erase(node, &system_blks->root); in add_system_zone()
[all …]
|
| /fs/ocfs2/dlm/ |
| D | dlmdomain.c | 490 unsigned int node; in dlm_begin_exit_domain_handler() local
496 node = exit_msg->node_idx; in dlm_begin_exit_domain_handler()
497 mlog(0, "%s: Node %u sent a begin exit domain message\n", dlm->name, node); in dlm_begin_exit_domain_handler()
500 set_bit(node, dlm->exit_domain_map); in dlm_begin_exit_domain_handler()
533 int node = -1, num = 0; in __dlm_print_nodes() local
538 while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES, in __dlm_print_nodes()
539 node + 1)) < O2NM_MAX_NODES) { in __dlm_print_nodes()
540 printk("%d ", node); in __dlm_print_nodes()
550 unsigned int node; in dlm_exit_domain_handler() local
558 node = exit_msg->node_idx; in dlm_exit_domain_handler()
[all …]
|
| /fs/nfs/ |
| D | pnfs_dev.c | 83 hlist_for_each_entry_rcu(d, &nfs4_deviceid_cache[hash], node) in _lookup_deviceid()
208 hlist_add_head_rcu(&new->node, &nfs4_deviceid_cache[hash]); in nfs4_find_get_deviceid()
238 hlist_del_init_rcu(&d->node); in nfs4_delete_deviceid()
251 INIT_HLIST_NODE(&d->node); in nfs4_init_deviceid_node()
287 nfs4_mark_deviceid_available(struct nfs4_deviceid_node *node) in nfs4_mark_deviceid_available() argument
289 if (test_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags)) { in nfs4_mark_deviceid_available()
290 clear_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags); in nfs4_mark_deviceid_available()
297 nfs4_mark_deviceid_unavailable(struct nfs4_deviceid_node *node) in nfs4_mark_deviceid_unavailable() argument
299 node->timestamp_unavailable = jiffies; in nfs4_mark_deviceid_unavailable()
301 set_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags); in nfs4_mark_deviceid_unavailable()
[all …]
|
| /fs/ubifs/ |
| D | auth.c | 30 int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_calc_hash() argument
33 const struct ubifs_ch *ch = node; in __ubifs_node_calc_hash()
39 err = crypto_shash_digest(shash, node, le32_to_cpu(ch->len), hash); in __ubifs_node_calc_hash()
78 int ubifs_prepare_auth_node(struct ubifs_info *c, void *node, in ubifs_prepare_auth_node() argument
81 struct ubifs_auth_node *auth = node; in ubifs_prepare_auth_node()
161 void ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, in ubifs_bad_hash() argument
170 __ubifs_node_calc_hash(c, node, calc); in ubifs_bad_hash()
187 int __ubifs_node_check_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_check_hash() argument
193 err = __ubifs_node_calc_hash(c, node, calc); in __ubifs_node_check_hash()
243 signode = snod->node; in ubifs_sb_verify_signature()
[all …]
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 13 ext_node(struct rb_node *node) in ext_node() argument
15 return rb_entry(node, struct pnfs_block_extent, be_node); in ext_node()
21 struct rb_node *node = rb_first(root); in ext_tree_first() local
22 return node ? ext_node(node) : NULL; in ext_tree_first()
28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev() local
29 return node ? ext_node(node) : NULL; in ext_tree_prev()
35 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next() local
36 return node ? ext_node(node) : NULL; in ext_tree_next()
48 struct rb_node *node = root->rb_node; in __ext_tree_search() local
51 while (node) { in __ext_tree_search()
[all …]
|