Lines Matching refs:nodes
697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (",
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum,
854 list_for_each_entry(snod, &sleb->nodes, list) {
1261 ubifs_err(c, "2 xent/dent nodes with the same name");
1305 /* Only dirty zbranch may have no on-flash nodes */
1621 /* Iterate over all indexing nodes */
2277 * o makes sure that all leaf nodes exist and their CRCs are correct;
2281 * The function reads whole indexing tree and all nodes, so it is pretty
2313 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2315 * @head: the list of nodes ('struct ubifs_scan_node' objects)
2317 * This function returns zero if the list of data nodes is sorted correctly,
2366 ubifs_err(c, "two data nodes for the same block");
2380 * dbg_check_nondata_nodes_order - check that list of data nodes is sorted.
2382 * @head: the list of nodes ('struct ubifs_scan_node' objects)
2384 * This function returns zero if the list of non-data nodes is sorted correctly,
2425 /* Inode nodes are sorted in descending size order */