Lines Matching refs:nodes
470 * no_more_nodes - determine if there are no more nodes in a buffer.
520 if (!list_empty(&sleb->nodes)) {
523 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
577 * drop_last_group - drop the last group of nodes.
579 * @offs: offset of dropped nodes is returned here
582 * group of nodes of the scanned LEB.
586 while (!list_empty(&sleb->nodes)) {
590 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
607 * @offs: offset of dropped nodes is returned here
616 if (!list_empty(&sleb->nodes)) {
617 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
754 * If nodes are grouped, always drop the incomplete group at
763 * middle of the same min. I/O unit keep dropping nodes. So
766 * with all the uncorrupted nodes which may possibly sit there.
771 * contains valid nodes or the end of a valid node, and the
779 * So what is the problem, why we need to drop those nodes? Why
786 * moving valid nodes from LEB X to LEB Y (obviously, LEB Y is
793 * And a power cut happens when nodes are moved from LEB X to
799 * does not match because the amount of valid nodes there does
931 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);
1033 * checks the nodes, and writes the result back to the flash, thereby cleaning
1285 * @d_size: maximum size based on data nodes
1303 * @d_size: maximum size based on data nodes
1401 * 1) to ensure there are no data nodes that fall outside the inode size
1402 * 2) to ensure there are no data nodes for inodes that do not exist
1409 * Note that there is still the possibility that there are data nodes that have
1488 * was calculated from nodes in the journal then don't change the inode.
1624 /* Remove data nodes that have no inode */