Lines Matching full:node
143 return "padding node"; in dbg_ntype()
145 return "superblock node"; in dbg_ntype()
147 return "master node"; in dbg_ntype()
149 return "reference node"; in dbg_ntype()
151 return "inode node"; in dbg_ntype()
153 return "direntry node"; in dbg_ntype()
155 return "xentry node"; in dbg_ntype()
157 return "data node"; in dbg_ntype()
159 return "truncate node"; in dbg_ntype()
161 return "indexing node"; in dbg_ntype()
163 return "commit start node"; in dbg_ntype()
165 return "orphan node"; in dbg_ntype()
167 return "unknown node"; in dbg_ntype()
175 return "no node group"; in dbg_gtype()
177 return "in node group"; in dbg_gtype()
179 return "last of node group"; in dbg_gtype()
302 void ubifs_dump_node(const struct ubifs_info *c, const void *node) in ubifs_dump_node() argument
306 const struct ubifs_ch *ch = node; in ubifs_dump_node()
311 pr_err("Not a node, first %zu bytes:", UBIFS_CH_SZ); in ubifs_dump_node()
313 (void *)node, UBIFS_CH_SZ, 1); in ubifs_dump_node()
318 dump_ch(node); in ubifs_dump_node()
323 const struct ubifs_pad_node *pad = node; in ubifs_dump_node()
330 const struct ubifs_sb_node *sup = node; in ubifs_dump_node()
367 const struct ubifs_mst_node *mst = node; in ubifs_dump_node()
409 const struct ubifs_ref_node *ref = node; in ubifs_dump_node()
418 const struct ubifs_ino_node *ino = node; in ubifs_dump_node()
452 const struct ubifs_dent_node *dent = node; in ubifs_dump_node()
465 pr_err("(bad name length, not printing, bad or corrupted node)"); in ubifs_dump_node()
476 const struct ubifs_data_node *dn = node; in ubifs_dump_node()
493 const struct ubifs_trun_node *trun = node; in ubifs_dump_node()
504 const struct ubifs_idx_node *idx = node; in ubifs_dump_node()
528 const struct ubifs_orph_node *orph = node; in ubifs_dump_node()
533 pr_err("\tlast node flag %llu\n", in ubifs_dump_node()
543 pr_err("node type %d was not recognized\n", in ubifs_dump_node()
813 pr_err("Dumping node at LEB %d:%d len %d\n", in ubifs_dump_sleb()
815 ubifs_dump_node(c, snod->node); in ubifs_dump_sleb()
844 pr_err("Dumping node at LEB %d:%d len %d\n", lnum, in ubifs_dump_leb()
846 ubifs_dump_node(c, snod->node); in ubifs_dump_leb()
1214 /* Make sure node keys are the same as in zbranch */ in dbg_check_key_order()
1254 ubifs_msg(c, "first node at %d:%d\n", zbr1->lnum, zbr1->offs); in dbg_check_key_order()
1256 ubifs_msg(c, "second node at %d:%d\n", zbr2->lnum, zbr2->offs); in dbg_check_key_order()
1594 * @leaf_cb: called for each leaf node
1595 * @znode_cb: called for each indexing node
1599 * node and @znode_cb for each indexing node. Returns zero in case of success
1614 /* If the root indexing node is not in TNC - pull it */ in dbg_walk_index()
1626 * Go down and find the leftmost indexing node where we are going to in dbg_walk_index()
1735 * every indexing node and adds its size to the 'long long' variable pointed to
1881 * 3. 'check_leaf()' fails because it hits a data node beyond inode in add_inode()
1941 * read_add_inode - read inode node and add it to RB-tree of inodes.
1946 * This is a helper function for 'check_leaf()' which finds inode node @inum in
1978 ubifs_err(c, "bad node %lu node length %d", in read_add_inode()
1989 ubifs_err(c, "cannot read inode node at LEB %d:%d, error %d", in read_add_inode()
1998 ubifs_err(c, "error %ld while adding inode %lu node", in read_add_inode()
2007 * check_leaf - check leaf node.
2009 * @zbr: zbranch of the leaf node to check
2013 * every single leaf node while walking the indexing tree. It checks that the
2014 * leaf node referred from the indexing tree exists, has correct CRC, and does
2026 void *node; in check_leaf() local
2037 node = kmalloc(zbr->len, GFP_NOFS); in check_leaf()
2038 if (!node) in check_leaf()
2041 err = ubifs_tnc_read_node(c, zbr, node); in check_leaf()
2043 ubifs_err(c, "cannot read leaf node at LEB %d:%d, error %d", in check_leaf()
2048 /* If this is an inode node, add it to RB-tree of inodes */ in check_leaf()
2050 fscki = add_inode(c, priv, node); in check_leaf()
2053 ubifs_err(c, "error %d while adding inode node", err); in check_leaf()
2061 ubifs_err(c, "unexpected node type %d at LEB %d:%d", in check_leaf()
2067 ch = node; in check_leaf()
2077 struct ubifs_data_node *dn = node; in check_leaf()
2082 * Search the inode node this data node belongs to and insert in check_leaf()
2089 ubifs_err(c, "error %d while processing data node and trying to find inode node %lu", in check_leaf()
2094 /* Make sure the data node is within inode size */ in check_leaf()
2099 ubifs_err(c, "data node at LEB %d:%d is not within inode size %lld", in check_leaf()
2106 struct ubifs_dent_node *dent = node; in check_leaf()
2116 * Search the inode node this entry refers to and the parent in check_leaf()
2117 * inode node and insert them to the RB-tree of inodes. in check_leaf()
2123 ubifs_err(c, "error %d while processing entry node and trying to find inode node %lu", in check_leaf()
2135 ubifs_err(c, "error %d while processing entry node and trying to find parent inode node %lu", in check_leaf()
2154 kfree(node); in check_leaf()
2158 ubifs_msg(c, "dump of node at LEB %d:%d", zbr->lnum, zbr->offs); in check_leaf()
2159 ubifs_dump_node(c, node); in check_leaf()
2161 kfree(node); in check_leaf()
2284 ubifs_err(c, "cannot read inode node at LEB %d:%d, error %d", in check_inodes()
2362 ubifs_err(c, "bad node type %d", sa->type); in dbg_check_data_nodes_order()
2363 ubifs_dump_node(c, sa->node); in dbg_check_data_nodes_order()
2367 ubifs_err(c, "bad node type %d", sb->type); in dbg_check_data_nodes_order()
2368 ubifs_dump_node(c, sb->node); in dbg_check_data_nodes_order()
2399 ubifs_dump_node(c, sa->node); in dbg_check_data_nodes_order()
2400 ubifs_dump_node(c, sb->node); in dbg_check_data_nodes_order()
2430 ubifs_err(c, "bad node type %d", sa->type); in dbg_check_nondata_nodes_order()
2431 ubifs_dump_node(c, sa->node); in dbg_check_nondata_nodes_order()
2436 ubifs_err(c, "bad node type %d", sb->type); in dbg_check_nondata_nodes_order()
2437 ubifs_dump_node(c, sb->node); in dbg_check_nondata_nodes_order()
2442 ubifs_err(c, "non-inode node goes before inode node"); in dbg_check_nondata_nodes_order()
2452 ubifs_err(c, "smaller inode node goes first"); in dbg_check_nondata_nodes_order()
2486 ubifs_msg(c, "dumping first node"); in dbg_check_nondata_nodes_order()
2487 ubifs_dump_node(c, sa->node); in dbg_check_nondata_nodes_order()
2488 ubifs_msg(c, "dumping second node"); in dbg_check_nondata_nodes_order()
2489 ubifs_dump_node(c, sb->node); in dbg_check_nondata_nodes_order()