Lines Matching full:node
26 * size, or min. UBIFS node size, depending on what is greater. Indeed, UBIFS
109 * @a: first data node
110 * @a: second data node
151 * @a: first node
152 * @a: second node
215 * @min: minimum node size is returned here
257 /* Probably truncation node, zap it */ in sort_nodes()
274 /* The node is obsolete, remove it from the list */ in sort_nodes()
301 * move_node - move a node.
305 * @wbuf: write-buffer to move node to
307 * This function moves node @snod to @wbuf, changes TNC correspondingly, and
317 err = ubifs_wbuf_write_nolock(wbuf, snod->node, snod->len); in move_node()
428 * be in a write-buffer instead. That is, a node could be written to a
429 * write-buffer, obsoleting another node in a LEB that is GC'd. If that LEB is
431 * unmount, then an existing node is lost. To avoid this, we sync all
519 struct ubifs_idx_node *idx = snod->node; in ubifs_garbage_collect_leb()
771 * 1. pick another LEB in a hope it'll contain a small node in ubifs_garbage_collect()