Lines Matching refs:nodes
447 * no_more_nodes - determine if there are no more nodes in a buffer.
497 if (!list_empty(&sleb->nodes)) {
500 snod = list_entry(sleb->nodes.prev,
555 * drop_last_group - drop the last group of nodes.
557 * @offs: offset of dropped nodes is returned here
560 * group of nodes of the scanned LEB.
564 while (!list_empty(&sleb->nodes)) {
568 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node,
586 * @offs: offset of dropped nodes is returned here
595 if (!list_empty(&sleb->nodes)) {
596 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node,
705 * If nodes are grouped, always drop the incomplete group at
713 * middle of the same min. I/O unit keep dropping nodes. So
716 * with all the uncorrupted nodes which may possibly sit there.
721 * contains valid nodes or the end of a valid node, and the
729 * So what is the problem, why we need to drop those nodes? Why
736 * moving valid nodes from LEB X to LEB Y (obviously, LEB Y is
743 * And a power cut happens when nodes are moved from LEB X to
749 * does not match because the amount of valid nodes there does
878 snod = list_entry(sleb->nodes.next,
977 * checks the nodes, and writes the result back to the flash, thereby cleaning
1225 * @d_size: maximum size based on data nodes
1243 * @d_size: maximum size based on data nodes
1337 * 1) to ensure there are no data nodes that fall outside the inode size
1338 * 2) to ensure there are no data nodes for inodes that do not exist
1345 * Note that there is still the possibility that there are data nodes that have
1418 * was calculated from nodes in the journal then don't change the inode.
1548 /* Remove data nodes that have no inode */