Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 216) sorted by relevance

123456789

/fs/hfs/
A Dbnode.c27 node->this, node->type, node->height, in is_bnode_offset_valid()
51 node->this, node->type, node->height, in check_and_correct_requested_length()
74 node->this, node->type, node->height, in hfs_bnode_read()
146 node->this, node->type, node->height, in hfs_bnode_write()
184 node->this, node->type, node->height, in hfs_bnode_clear()
307 if (!node->prev && !node->next) { in hfs_bnode_unlink()
334 node; node = node->next_hash) { in hfs_bnode_findhash()
365 node->tree->cnid, node->this); in __hfs_bnode_create()
405 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
550 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
A Dbrec.c35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
79 if (IS_ERR(node)) in hfs_brec_insert()
81 fd->bnode = node; in hfs_brec_insert()
91 node = fd->bnode; in hfs_brec_insert()
111 node->num_recs++; in hfs_brec_insert()
184 node = fd->bnode; in hfs_brec_remove()
246 node->this, new_node->this, node->next); in hfs_bnode_split()
253 if (node->next) in hfs_bnode_split()
423 node = parent; in hfs_brec_update_parent()
465 node = NULL; in hfs_btree_inc_height()
[all …]
A Dbtree.c187 node->tree->cnid, node->this, in hfs_btree_close()
204 if (IS_ERR(node)) in hfs_btree_write()
234 if (IS_ERR(node)) in hfs_bmap_new_bmap()
235 return node; in hfs_bmap_new_bmap()
258 return node; in hfs_bmap_new_bmap()
302 if (IS_ERR(node)) in hfs_bmap_alloc()
303 return node; in hfs_bmap_alloc()
378 i = node->next; in hfs_bmap_free()
382 node->this); in hfs_bmap_free()
393 node->this, node->type); in hfs_bmap_free()
[all …]
/fs/dlm/
A Dmidcomms.c354 node = kmalloc(sizeof(*node), GFP_NOFS); in dlm_midcomms_addr()
482 node->nodeid, dlm_state_str(node->state)); in dlm_pas_fin_ack_rcv()
539 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_receive_buffer()
681 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_receive_buffer_3_2()
1025 mh->node = node; in dlm_midcomms_get_mhandle()
1187 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1193 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1198 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1229 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_add_member()
1356 node->nodeid, dlm_state_str(node->state)); in midcomms_shutdown()
[all …]
/fs/hfsplus/
A Dbnode.c30 node->this, node->type, node->height, in is_bnode_offset_valid()
54 node->this, node->type, node->height, in check_and_correct_requested_length()
76 node->this, node->type, node->height, in hfs_bnode_read()
147 node->this, node->type, node->height, in hfs_bnode_write()
189 node->this, node->type, node->height, in hfs_bnode_clear()
458 if (!node->prev && !node->next) in hfs_bnode_unlink()
485 node; node = node->next_hash) in hfs_bnode_findhash()
515 node->tree->cnid, node->this); in __hfs_bnode_create()
555 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
701 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
A Dbrec.c36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
77 if (IS_ERR(node)) in hfs_brec_insert()
79 fd->bnode = node; in hfs_brec_insert()
89 node = fd->bnode; in hfs_brec_insert()
109 node->num_recs++; in hfs_brec_insert()
113 node->num_recs); in hfs_brec_insert()
250 node->this, new_node->this, node->next); in hfs_bnode_split()
257 if (node->next) in hfs_bnode_split()
427 node = parent; in hfs_brec_update_parent()
469 node = NULL; in hfs_btree_inc_height()
[all …]
A Dbtree.c273 node->tree->cnid, node->this, in hfs_btree_close()
290 if (IS_ERR(node)) in hfs_btree_write()
321 if (IS_ERR(node)) in hfs_bmap_new_bmap()
322 return node; in hfs_bmap_new_bmap()
343 return node; in hfs_bmap_new_bmap()
391 if (IS_ERR(node)) in hfs_bmap_alloc()
392 return node; in hfs_bmap_alloc()
469 i = node->next; in hfs_bmap_free()
474 node->this); in hfs_bmap_free()
486 node->this, node->type); in hfs_bmap_free()
[all …]
/fs/unicode/
A Dmkutf8data.c382 struct node *node; in lookup() argument
401 node = node->left; in lookup()
419 struct node *node; in tree_walk() local
494 struct node *node; in alloc_node() local
535 struct node *node; in insert() local
656 struct node *node; in prune() local
795 node = node->left; in prune()
817 struct node *node; in mark_nodes() local
944 struct node *node; in index_nodes() local
1051 struct node *node; in size_nodes() local
[all …]
/fs/ocfs2/cluster/
A Dquorum.c187 node, qs->qs_holds); in o2quo_clear_hold()
195 void o2quo_hb_up(u8 node) in o2quo_hb_up() argument
204 mlog_bug_on_msg(test_bit(node, qs->qs_hb_bm), "node %u\n", node); in o2quo_hb_up()
210 o2quo_set_hold(qs, node); in o2quo_hb_up()
219 void o2quo_hb_down(u8 node) in o2quo_hb_down() argument
229 mlog_bug_on_msg(!test_bit(node, qs->qs_hb_bm), "node %u\n", node); in o2quo_hb_down()
234 o2quo_clear_hold(qs, node); in o2quo_hb_down()
250 mlog(0, "node %u\n", node); in o2quo_hb_still_up()
263 void o2quo_conn_up(u8 node) in o2quo_conn_up() argument
272 mlog_bug_on_msg(test_bit(node, qs->qs_conn_bm), "node %u\n", node); in o2quo_conn_up()
[all …]
A Dnodemanager.c39 if (node) in o2nm_get_node_by_num()
43 return node; in o2nm_get_node_by_num()
86 ret = node; in o2nm_node_ip_tree_lookup()
109 if (node) in o2nm_get_node_by_ip()
114 return node; in o2nm_get_node_by_ip()
159 kfree(node); in o2nm_node_release()
222 node->nd_num = tmp; in o2nm_node_num_store()
372 node->nd_local = tmp; in o2nm_node_local_store()
590 if (node == NULL) in o2nm_node_group_make_item()
608 if (cluster->cl_nodes[node->nd_num] == node) { in o2nm_node_group_drop_item()
[all …]
/fs/btrfs/
A Dulist.c70 kfree(node); in ulist_release()
147 struct rb_node *node; in ulist_rbtree_search() local
157 kfree(node); in ulist_rbtree_erase()
174 if (node) in ulist_rbtree_insert()
212 if (node) { in ulist_add_merge()
222 node = kmalloc(sizeof(*node), gfp_mask); in ulist_add_merge()
223 if (!node) in ulist_add_merge()
227 node->val = val; in ulist_add_merge()
228 node->aux = aux; in ulist_add_merge()
255 if (!node) in ulist_del()
[all …]
A Ddelayed-inode.c75 if (node) { in btrfs_get_delayed_node()
77 return node; in btrfs_get_delayed_node()
83 if (node) { in btrfs_get_delayed_node()
115 return node; in btrfs_get_delayed_node()
139 if (node) in btrfs_get_or_create_delayed_node()
143 if (!node) in btrfs_get_or_create_delayed_node()
172 return node; in btrfs_get_or_create_delayed_node()
224 if (node) in btrfs_first_delayed_node()
228 return node; in btrfs_first_delayed_node()
302 if (node) { in btrfs_first_prepared_delayed_node()
[all …]
A Dmisc.h73 struct rb_node *node = root->rb_node; in rb_simple_search() local
76 while (node) { in rb_simple_search()
80 node = node->rb_left; in rb_simple_search()
82 node = node->rb_right; in rb_simple_search()
84 return node; in rb_simple_search()
101 struct rb_node *node = root->rb_node, *ret = NULL; in rb_simple_search_first() local
104 while (node) { in rb_simple_search_first()
109 ret = node; in rb_simple_search_first()
113 node = node->rb_left; in rb_simple_search_first()
115 node = node->rb_right; in rb_simple_search_first()
[all …]
A Dref-verify.c25 struct rb_node node; member
39 struct rb_node node; member
103 node = rb_find_add(&be->node, root, block_entry_bytenr_cmp); in insert_block_entry()
104 return rb_entry_safe(node, struct block_entry, node); in insert_block_entry()
112 return rb_entry_safe(node, struct block_entry, node); in lookup_block_entry()
140 node = rb_find_add(&re->node, root, root_entry_root_objectid_cmp); in insert_root_entry()
141 return rb_entry_safe(node, struct root_entry, node); in insert_root_entry()
178 node = rb_find_add(&ref->node, root, ref_entry_cmp); in insert_ref_entry()
179 return rb_entry_safe(node, struct ref_entry, node); in insert_ref_entry()
187 return rb_entry_safe(node, struct root_entry, node); in lookup_root_entry()
[all …]
A Dordered-data.c499 if (!node) in btrfs_mark_ordered_io_finished()
510 node = rb_next(node); in btrfs_mark_ordered_io_finished()
512 if (!node) in btrfs_mark_ordered_io_finished()
586 if (!node) in btrfs_dec_test_ordered_pending()
978 if (!node) in btrfs_lookup_ordered_extent()
1006 if (!node) in btrfs_lookup_ordered_range()
1020 node = rb_next(node); in btrfs_lookup_ordered_range()
1021 if (!node) in btrfs_lookup_ordered_range()
1073 if (!node) in btrfs_lookup_first_ordered_extent()
1114 node = node->rb_left; in btrfs_lookup_first_ordered_range()
[all …]
A Drelocation.c212 node = edge->node[UPPER]; in walk_up_backref()
216 return node; in walk_up_backref()
433 cur = node; in build_backref_tree()
469 ASSERT(!node || !node->detached); in build_backref_tree()
485 node = kmalloc(sizeof(*node), GFP_NOFS); in __add_reloc_root()
486 if (!node) in __add_reloc_root()
570 if (!node) in __update_reloc_root()
575 node->bytenr = root->node->start; in __update_reloc_root()
2225 rc->backref_cache.path[node->level] = node; in do_relocation()
2541 node->new_bytenr = root->node->start; in relocate_tree_block()
[all …]
/fs/xfs/libxfs/
A Dxfs_iext_tree.c168 node = node->ptrs[0]; in xfs_iext_find_first_leaf()
172 return node; in xfs_iext_find_first_leaf()
189 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
193 return node; in xfs_iext_find_last_leaf()
320 node = node->ptrs[i - 1]; in xfs_iext_find_level()
321 if (!node) in xfs_iext_find_level()
450 node = node->ptrs[i - 1]; in xfs_iext_update_node()
532 node->keys[i] = node->keys[i - 1]; in xfs_iext_insert_node()
533 node->ptrs[i] = node->ptrs[i - 1]; in xfs_iext_insert_node()
759 node->keys[i] = node->keys[i + 1]; in xfs_iext_remove_node()
[all …]
/fs/nilfs2/
A Dbtree.c76 return node->bn_flags; in nilfs_btree_node_get_flags()
82 node->bn_flags = flags; in nilfs_btree_node_set_flags()
92 return node->bn_level; in nilfs_btree_node_get_level()
98 node->bn_level = level; in nilfs_btree_node_set_level()
438 struct nilfs_btree_node *node; in nilfs_btree_get_node() local
447 return node; in nilfs_btree_get_node()
552 struct nilfs_btree_node *node; in nilfs_btree_do_lookup() local
613 struct nilfs_btree_node *node; in nilfs_btree_do_lookup_last() local
1668 node = root; in nilfs_btree_check_delete()
1707 node = root; in nilfs_btree_gather_data()
[all …]
/fs/btrfs/tests/
A Ddelayed-refs-tests.c218 if (!node) { in simple_test()
421 if (node) { in merge_tests()
473 if (!node) { in merge_tests()
488 if (node) { in merge_tests()
537 if (!node) { in merge_tests()
552 if (node) { in merge_tests()
606 if (!node) { in merge_tests()
621 if (node) { in merge_tests()
677 if (!node) { in merge_tests()
692 if (node) { in merge_tests()
[all …]
/fs/befs/
A Dbtree.c100 struct befs_btree_node *node,
112 struct befs_btree_node *node,
198 if (node->bh) in befs_bt_read_node()
199 brelse(node->bh); in befs_bt_read_node()
202 if (!node->bh) { in befs_bt_read_node()
209 node->od_node = in befs_bt_read_node()
214 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
215 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
216 node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow); in befs_bt_read_node()
217 node->head.all_key_count = in befs_bt_read_node()
[all …]
/fs/jffs2/
A Dnodelist.c104 if (this->node) { 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()
114 …ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); in jffs2_obsolete_node_frag()
241 if (this->node) in jffs2_add_frag_to_fragtree()
249 if (this->node) in jffs2_add_frag_to_fragtree()
252 ref_offset(this->node->raw), ref_flags(this->node->raw)); in jffs2_add_frag_to_fragtree()
266 if (this->node) in jffs2_add_frag_to_fragtree()
273 if (this->node) in jffs2_add_frag_to_fragtree()
352 if (this->node) in jffs2_add_frag_to_fragtree()
390 if (prev->node) in jffs2_add_full_dnode_to_inode()
[all …]
A Ddebug.c81 struct jffs2_full_dnode *fn = frag->node; in __jffs2_dbg_fragtree_paranoia_check_nolock()
711 if (this->node) in __jffs2_dbg_dump_fragtree_nolock()
775 union jffs2_node_union node; in __jffs2_dbg_dump_node() local
795 crc = crc32(0, &node.u, sizeof(node.u) - 4); in __jffs2_dbg_dump_node()
796 if (crc != je32_to_cpu(node.u.hdr_crc)) { in __jffs2_dbg_dump_node()
809 switch(je16_to_cpu(node.u.nodetype)) { in __jffs2_dbg_dump_node()
832 crc = crc32(0, &node.i, sizeof(node.i) - 8); in __jffs2_dbg_dump_node()
833 if (crc != je32_to_cpu(node.i.node_crc)) { in __jffs2_dbg_dump_node()
851 node.d.name[node.d.nsize] = '\0'; in __jffs2_dbg_dump_node()
854 crc = crc32(0, &node.d, sizeof(node.d) - 8); in __jffs2_dbg_dump_node()
[all …]
A Dscan.c370 xd->node->next_in_ino = raw; in jffs2_scan_xattr_node()
449 struct jffs2_unknown_node *node; in jffs2_scan_eraseblock() local
647 sizeof(*node)); in jffs2_scan_eraseblock()
754 je16_to_cpu(node->magic)); in jffs2_scan_eraseblock()
761 crcnode.magic = node->magic; in jffs2_scan_eraseblock()
763 crcnode.totlen = node->totlen; in jffs2_scan_eraseblock()
771 je32_to_cpu(node->totlen), in jffs2_scan_eraseblock()
812 node = (void *)buf; in jffs2_scan_eraseblock()
829 node = (void *)buf; in jffs2_scan_eraseblock()
847 node = (void *)buf; in jffs2_scan_eraseblock()
[all …]
/fs/ext4/
A Dextents_status.c224 node = rb_next(node); in ext4_es_print_tree()
251 node = node->rb_left; in __es_tree_search()
253 node = node->rb_right; in __es_tree_search()
1062 node = node->rb_left; in ext4_es_lookup_extent()
1064 node = node->rb_right; in ext4_es_lookup_extent()
1253 node = node->rb_left; in __pr_tree_search()
1255 node = node->rb_right; in __pr_tree_search()
1899 node = rb_next(node); in ext4_clear_inode_es()
1922 node = rb_next(node); in ext4_print_pending_tree()
1970 node = node->rb_left; in __get_pending()
[all …]
A Dblock_validity.c24 struct rb_node node; member
101 node = rb_prev(new_node); in add_system_zone()
102 if (node) { in add_system_zone()
103 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
113 node = rb_next(new_node); in add_system_zone()
114 if (node) { in add_system_zone()
115 entry = rb_entry(node, struct ext4_system_zone, node); in add_system_zone()
127 struct rb_node *node; in debug_print_tree() local
136 while (node) { in debug_print_tree()
137 entry = rb_entry(node, struct ext4_system_zone, node); in debug_print_tree()
[all …]

Completed in 82 milliseconds

123456789