Lines Matching refs:node
133 return "padding node";
135 return "superblock node";
137 return "master node";
139 return "reference node";
141 return "inode node";
143 return "direntry node";
145 return "xentry node";
147 return "data node";
149 return "truncate node";
151 return "indexing node";
153 return "commit start node";
155 return "orphan node";
157 return "auth node";
159 return "unknown node";
167 return "no node group";
169 return "in node group";
171 return "last of node group";
294 void ubifs_dump_node(const struct ubifs_info *c, const void *node, int node_len)
298 const struct ubifs_ch *ch = node;
303 pr_err("Not a node, first %zu bytes:", UBIFS_CH_SZ);
305 (void *)node, UBIFS_CH_SZ, 1);
309 /* Skip dumping unknown type node */
312 pr_err("node type %d was not recognized\n", type);
317 dump_ch(node);
329 pr_err("node len(%d) is too short for %s, left %d bytes:\n",
335 (void *)node + UBIFS_CH_SZ,
340 pr_err("\ttruncated node length %d\n", safe_len);
345 const struct ubifs_pad_node *pad = node;
352 const struct ubifs_sb_node *sup = node;
389 const struct ubifs_mst_node *mst = node;
431 const struct ubifs_ref_node *ref = node;
440 const struct ubifs_ino_node *ino = node;
474 const struct ubifs_dent_node *dent = node;
488 pr_err("(bad name length, not printing, bad or corrupted node)");
500 const struct ubifs_data_node *dn = node;
519 const struct ubifs_trun_node *trun = node;
530 const struct ubifs_idx_node *idx = node;
557 const struct ubifs_orph_node *orph = node;
562 pr_err("\tlast node flag %llu\n",
576 pr_err("node type %d was not recognized\n", type);
856 pr_err("Dumping node at LEB %d:%d len %d\n", lnum,
858 ubifs_dump_node(c, snod->node, c->leb_size - snod->offs);
1226 /* Make sure node keys are the same as in zbranch */
1266 ubifs_msg(c, "first node at %d:%d\n", zbr1->lnum, zbr1->offs);
1268 ubifs_msg(c, "second node at %d:%d\n", zbr2->lnum, zbr2->offs);
1571 * @leaf_cb: called for each leaf node
1572 * @znode_cb: called for each indexing node
1576 * node and @znode_cb for each indexing node. Returns zero in case of success
1591 /* If the root indexing node is not in TNC - pull it */
1603 * Go down and find the leftmost indexing node where we are going to
1711 * every indexing node and adds its size to the 'long long' variable pointed to
1856 * 3. 'check_leaf()' fails because it hits a data node beyond inode
1916 * read_add_inode - read inode node and add it to RB-tree of inodes.
1921 * This is a helper function for 'check_leaf()' which finds inode node @inum in
1953 ubifs_err(c, "bad node %lu node length %d",
1964 ubifs_err(c, "cannot read inode node at LEB %d:%d, error %d",
1973 ubifs_err(c, "error %ld while adding inode %lu node",
1982 * check_leaf - check leaf node.
1984 * @zbr: zbranch of the leaf node to check
1988 * every single leaf node while walking the indexing tree. It checks that the
1989 * leaf node referred from the indexing tree exists, has correct CRC, and does
2001 void *node;
2012 node = kmalloc(zbr->len, GFP_NOFS);
2013 if (!node)
2016 err = ubifs_tnc_read_node(c, zbr, node);
2018 ubifs_err(c, "cannot read leaf node at LEB %d:%d, error %d",
2023 /* If this is an inode node, add it to RB-tree of inodes */
2025 fscki = add_inode(c, priv, node);
2028 ubifs_err(c, "error %d while adding inode node", err);
2036 ubifs_err(c, "unexpected node type %d at LEB %d:%d",
2042 ch = node;
2052 struct ubifs_data_node *dn = node;
2057 * Search the inode node this data node belongs to and insert
2064 ubifs_err(c, "error %d while processing data node and trying to find inode node %lu",
2069 /* Make sure the data node is within inode size */
2074 ubifs_err(c, "data node at LEB %d:%d is not within inode size %lld",
2081 struct ubifs_dent_node *dent = node;
2091 * Search the inode node this entry refers to and the parent
2092 * inode node and insert them to the RB-tree of inodes.
2098 ubifs_err(c, "error %d while processing entry node and trying to find inode node %lu",
2110 ubifs_err(c, "error %d while processing entry node and trying to find parent inode node %lu",
2129 kfree(node);
2133 ubifs_msg(c, "dump of node at LEB %d:%d", zbr->lnum, zbr->offs);
2134 ubifs_dump_node(c, node, zbr->len);
2136 kfree(node);
2259 ubifs_err(c, "cannot read inode node at LEB %d:%d, error %d",
2337 ubifs_err(c, "bad node type %d", sa->type);
2338 ubifs_dump_node(c, sa->node, c->leb_size - sa->offs);
2342 ubifs_err(c, "bad node type %d", sb->type);
2343 ubifs_dump_node(c, sb->node, c->leb_size - sb->offs);
2374 ubifs_dump_node(c, sa->node, c->leb_size - sa->offs);
2375 ubifs_dump_node(c, sb->node, c->leb_size - sb->offs);
2405 ubifs_err(c, "bad node type %d", sa->type);
2406 ubifs_dump_node(c, sa->node, c->leb_size - sa->offs);
2411 ubifs_err(c, "bad node type %d", sb->type);
2412 ubifs_dump_node(c, sb->node, c->leb_size - sb->offs);
2417 ubifs_err(c, "non-inode node goes before inode node");
2427 ubifs_err(c, "smaller inode node goes first");
2461 ubifs_msg(c, "dumping first node");
2462 ubifs_dump_node(c, sa->node, c->leb_size - sa->offs);
2463 ubifs_msg(c, "dumping second node");
2464 ubifs_dump_node(c, sb->node, c->leb_size - sb->offs);