| /fs/hfs/ |
| D | bnode.c | 17 void hfs_bnode_read(struct hfs_bnode *node, void *buf, in hfs_bnode_read() argument
22 off += node->page_offset; in hfs_bnode_read()
23 page = node->page[0]; in hfs_bnode_read()
29 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
33 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
37 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
41 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
45 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
50 tree = node->tree; in hfs_bnode_read_key()
51 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
|
| D | brec.c | 18 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
23 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
24 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
30 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
34 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
37 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
38 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
39 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
40 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
[all …]
|
| D | btree.c | 138 struct hfs_bnode *node; in hfs_btree_close() local
145 while ((node = tree->node_hash[i])) { in hfs_btree_close()
146 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
147 if (atomic_read(&node->refcnt)) in hfs_btree_close()
149 node->tree->cnid, node->this, in hfs_btree_close()
150 atomic_read(&node->refcnt)); in hfs_btree_close()
151 hfs_bnode_free(node); in hfs_btree_close()
162 struct hfs_bnode *node; in hfs_btree_write() local
165 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
166 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /fs/hfsplus/ |
| D | bnode.c | 21 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
26 off += node->page_offset; in hfs_bnode_read()
27 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
42 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
46 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
50 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
54 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
58 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
63 tree = node->tree; in hfs_bnode_read_key()
64 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 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen()
[all …]
|
| D | btree.c | 259 struct hfs_bnode *node; in hfs_btree_close() local
266 while ((node = tree->node_hash[i])) { in hfs_btree_close()
267 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
268 if (atomic_read(&node->refcnt)) in hfs_btree_close()
271 node->tree->cnid, node->this, in hfs_btree_close()
272 atomic_read(&node->refcnt)); in hfs_btree_close()
273 hfs_bnode_free(node); in hfs_btree_close()
284 struct hfs_bnode *node; in hfs_btree_write() local
287 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
288 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /fs/ocfs2/cluster/ |
| D | quorum.c | 177 static void o2quo_set_hold(struct o2quo_state *qs, u8 node) in o2quo_set_hold() argument
181 if (!test_and_set_bit(node, qs->qs_hold_bm)) { in o2quo_set_hold()
184 "node %u\n", node); in o2quo_set_hold()
185 mlog(0, "node %u, %d total\n", node, qs->qs_holds); in o2quo_set_hold()
189 static void o2quo_clear_hold(struct o2quo_state *qs, u8 node) in o2quo_clear_hold() argument
193 if (test_and_clear_bit(node, qs->qs_hold_bm)) { in o2quo_clear_hold()
194 mlog(0, "node %u, %d total\n", node, qs->qs_holds - 1); in o2quo_clear_hold()
202 node, qs->qs_holds); in o2quo_clear_hold()
210 void o2quo_hb_up(u8 node) in o2quo_hb_up() argument
218 "node %u\n", node); in o2quo_hb_up()
[all …]
|
| D | nodemanager.c | 45 struct o2nm_node *node = NULL; in o2nm_get_node_by_num() local
51 node = o2nm_single_cluster->cl_nodes[node_num]; in o2nm_get_node_by_num()
52 if (node) in o2nm_get_node_by_num()
53 config_item_get(&node->nd_item); in o2nm_get_node_by_num()
56 return node; in o2nm_get_node_by_num()
84 struct o2nm_node *node, *ret = NULL; in o2nm_node_ip_tree_lookup() local
90 node = rb_entry(parent, struct o2nm_node, nd_ip_node); in o2nm_node_ip_tree_lookup()
92 cmp = memcmp(&ip_needle, &node->nd_ipv4_address, in o2nm_node_ip_tree_lookup()
99 ret = node; in o2nm_node_ip_tree_lookup()
114 struct o2nm_node *node = NULL; in o2nm_get_node_by_ip() local
[all …]
|
| /fs/btrfs/ |
| D | ulist.c | 63 struct ulist_node *node; in ulist_fini() local
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_fini()
67 kfree(node); in ulist_fini()
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 | delayed-inode.c | 86 struct btrfs_delayed_node *node; in btrfs_get_delayed_node() local
88 node = ACCESS_ONCE(btrfs_inode->delayed_node); in btrfs_get_delayed_node()
89 if (node) { in btrfs_get_delayed_node()
90 atomic_inc(&node->refs); in btrfs_get_delayed_node()
91 return node; in btrfs_get_delayed_node()
95 node = radix_tree_lookup(&root->delayed_nodes_tree, ino); in btrfs_get_delayed_node()
96 if (node) { in btrfs_get_delayed_node()
98 atomic_inc(&node->refs); /* can be accessed */ in btrfs_get_delayed_node()
99 BUG_ON(btrfs_inode->delayed_node != node); in btrfs_get_delayed_node()
101 return node; in btrfs_get_delayed_node()
[all …]
|
| D | relocation.c | 93 struct backref_node *node[2]; member
198 struct backref_node *node);
200 struct backref_node *node);
221 struct backref_node *node; in backref_cache_cleanup() local
225 node = list_entry(cache->detached.next, in backref_cache_cleanup()
227 remove_backref_node(cache, node); in backref_cache_cleanup()
231 node = list_entry(cache->leaves.next, in backref_cache_cleanup()
233 remove_backref_node(cache, node); in backref_cache_cleanup()
249 struct backref_node *node; in alloc_backref_node() local
251 node = kzalloc(sizeof(*node), GFP_NOFS); in alloc_backref_node()
[all …]
|
| D | delayed-ref.h | 92 struct btrfs_delayed_ref_node node; member
143 struct btrfs_delayed_ref_node node; member
150 struct btrfs_delayed_ref_node node; member
283 static int btrfs_delayed_ref_is_head(struct btrfs_delayed_ref_node *node) in btrfs_delayed_ref_is_head() argument
285 return node->is_head; in btrfs_delayed_ref_is_head()
292 btrfs_delayed_node_to_tree_ref(struct btrfs_delayed_ref_node *node) in btrfs_delayed_node_to_tree_ref() argument
294 WARN_ON(btrfs_delayed_ref_is_head(node)); in btrfs_delayed_node_to_tree_ref()
295 return container_of(node, struct btrfs_delayed_tree_ref, node); in btrfs_delayed_node_to_tree_ref()
299 btrfs_delayed_node_to_data_ref(struct btrfs_delayed_ref_node *node) in btrfs_delayed_node_to_data_ref() argument
301 WARN_ON(btrfs_delayed_ref_is_head(node)); in btrfs_delayed_node_to_data_ref()
[all …]
|
| D | ordered-data.c | 43 struct rb_node *node) in tree_insert() argument
61 rb_link_node(node, parent, p); in tree_insert()
62 rb_insert_color(node, root); in tree_insert()
191 struct rb_node *node; in __btrfs_add_ordered_extent() local
226 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
228 if (node) in __btrfs_add_ordered_extent()
307 struct rb_node *node; in btrfs_dec_test_first_ordered_pending() local
317 node = tree_search(tree, *file_offset); in btrfs_dec_test_first_ordered_pending()
318 if (!node) { in btrfs_dec_test_first_ordered_pending()
323 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_first_ordered_pending()
[all …]
|
| D | backref.c | 87 struct ref_node *node; in ref_root_fini() local
91 node = rb_entry(next, struct ref_node, rb_node); in ref_root_fini()
93 kfree(node); in ref_root_fini()
214 static void ref_tree_remove(struct ref_root *ref_tree, struct ref_node *node) in ref_tree_remove() argument
216 rb_erase(&node->rb_node, &ref_tree->rb_root); in ref_tree_remove()
217 kfree(node); in ref_tree_remove()
249 struct ref_node *node = NULL; in ref_tree_add() local
258 node = __ref_tree_search(ref_tree, &pos, &pos_parent, root_id, in ref_tree_add()
260 if (node == NULL) { in ref_tree_add()
261 node = kmalloc(sizeof(*node), GFP_NOFS); in ref_tree_add()
[all …]
|
| /fs/nilfs2/ |
| D | btree.c | 82 static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node) in nilfs_btree_node_get_flags() argument
84 return node->bn_flags; in nilfs_btree_node_get_flags()
88 nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags) in nilfs_btree_node_set_flags() argument
90 node->bn_flags = flags; in nilfs_btree_node_set_flags()
93 static int nilfs_btree_node_root(const struct nilfs_btree_node *node) in nilfs_btree_node_root() argument
95 return nilfs_btree_node_get_flags(node) & NILFS_BTREE_NODE_ROOT; in nilfs_btree_node_root()
98 static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node) in nilfs_btree_node_get_level() argument
100 return node->bn_level; in nilfs_btree_node_get_level()
104 nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level) in nilfs_btree_node_set_level() argument
106 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,
195 struct befs_btree_node *node, befs_off_t node_off) in befs_bt_read_node() argument
201 if (node->bh) in befs_bt_read_node()
202 brelse(node->bh); in befs_bt_read_node()
[all …]
|
| /fs/ext4/ |
| D | block_validity.c | 23 struct rb_node node; member
61 struct rb_node **n = &sbi->system_blks.rb_node, *node; in add_system_zone() local
66 entry = rb_entry(parent, struct ext4_system_zone, node); in add_system_zone()
78 node); in add_system_zone()
90 new_node = &new_entry->node; in add_system_zone()
97 node = rb_prev(new_node); in add_system_zone()
98 if (node) { in add_system_zone()
99 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
103 rb_erase(node, &sbi->system_blks); in add_system_zone()
109 node = rb_next(new_node); in add_system_zone()
[all …]
|
| D | extents_status.c | 178 struct rb_node *node; in ext4_es_print_tree() local
182 node = rb_first(&tree->root); in ext4_es_print_tree()
183 while (node) { in ext4_es_print_tree()
185 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
189 node = rb_next(node); in ext4_es_print_tree()
210 struct rb_node *node = root->rb_node; in __es_tree_search() local
213 while (node) { in __es_tree_search()
214 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
216 node = node->rb_left; in __es_tree_search()
218 node = node->rb_right; in __es_tree_search()
[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
635 if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
639 sizeof(*node)); in jffs2_scan_eraseblock()
645 if (buf_ofs + buf_len < ofs + sizeof(*node)) { in jffs2_scan_eraseblock()
656 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; in jffs2_scan_eraseblock()
718 if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { in jffs2_scan_eraseblock()
726 if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { in jffs2_scan_eraseblock()
733 if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { in jffs2_scan_eraseblock()
[all …]
|
| /fs/ocfs2/dlm/ |
| D | dlmdomain.c | 493 unsigned int node; in dlm_begin_exit_domain_handler() local
499 node = exit_msg->node_idx; in dlm_begin_exit_domain_handler()
500 mlog(0, "%s: Node %u sent a begin exit domain message\n", dlm->name, node); in dlm_begin_exit_domain_handler()
503 set_bit(node, dlm->exit_domain_map); in dlm_begin_exit_domain_handler()
536 int node = -1, num = 0; in __dlm_print_nodes() local
541 while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES, in __dlm_print_nodes()
542 node + 1)) < O2NM_MAX_NODES) { in __dlm_print_nodes()
543 printk("%d ", node); in __dlm_print_nodes()
553 unsigned int node; in dlm_exit_domain_handler() local
561 node = exit_msg->node_idx; in dlm_exit_domain_handler()
[all …]
|
| /fs/xfs/libxfs/ |
| D | xfs_da_btree.c | 308 struct xfs_da_intnode *node; in xfs_da3_node_create() local
324 node = bp->b_addr; in xfs_da3_node_create()
339 dp->d_ops->node_hdr_to_disk(node, &ichdr); in xfs_da3_node_create()
341 XFS_DA_LOGRANGE(node, &node->hdr, dp->d_ops->node_hdr_size)); in xfs_da3_node_create()
358 struct xfs_da_intnode *node; in xfs_da3_split() local
479 node = oldblk->bp->b_addr; in xfs_da3_split()
480 if (node->hdr.info.forw) { in xfs_da3_split()
481 ASSERT(be32_to_cpu(node->hdr.info.forw) == addblk->blkno); in xfs_da3_split()
482 node = addblk->bp->b_addr; in xfs_da3_split()
483 node->hdr.info.back = cpu_to_be32(oldblk->blkno); in xfs_da3_split()
[all …]
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 12 ext_node(struct rb_node *node) in ext_node() argument
14 return rb_entry(node, struct pnfs_block_extent, be_node); in ext_node()
20 struct rb_node *node = rb_first(root); in ext_tree_first() local
21 return node ? ext_node(node) : NULL; in ext_tree_first()
27 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev() local
28 return node ? ext_node(node) : NULL; in ext_tree_prev()
34 struct rb_node *node = rb_next(&be->be_node); in ext_tree_next() local
35 return node ? ext_node(node) : NULL; in ext_tree_next()
47 struct rb_node *node = root->rb_node; in __ext_tree_search() local
50 while (node) { in __ext_tree_search()
[all …]
|
| /fs/nfs/ |
| D | pnfs_dev.c | 84 hlist_for_each_entry_rcu(d, &nfs4_deviceid_cache[hash], node) in _lookup_deviceid()
209 hlist_add_head_rcu(&new->node, &nfs4_deviceid_cache[hash]); in nfs4_find_get_deviceid()
239 hlist_del_init_rcu(&d->node); in nfs4_delete_deviceid()
252 INIT_HLIST_NODE(&d->node); in nfs4_init_deviceid_node()
288 nfs4_mark_deviceid_unavailable(struct nfs4_deviceid_node *node) in nfs4_mark_deviceid_unavailable() argument
290 node->timestamp_unavailable = jiffies; in nfs4_mark_deviceid_unavailable()
291 set_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags); in nfs4_mark_deviceid_unavailable()
296 nfs4_test_deviceid_unavailable(struct nfs4_deviceid_node *node) in nfs4_test_deviceid_unavailable() argument
298 if (test_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags)) { in nfs4_test_deviceid_unavailable()
303 if (time_in_range(node->timestamp_unavailable, start, end)) in nfs4_test_deviceid_unavailable()
[all …]
|