fs/ubifs/ubifs.h

757  * How much memory is needed for a buffer where we compress a data node.
817  * SCANNED_A_NODE: scanned a valid node
818  * SCANNED_A_CORRUPT_NODE: scanned a corrupted node
819  * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length
848  * LTAB_DIRTY: ltab node is dirty
849  * LSAVE_DIRTY: lsave node is dirty
869  * struct ubifs_old_idx - index node obsoleted since last commit start.
870  * @rb: rb-tree node
871  * @lnum: LEB number of obsoleted index node
872  * @offs: offset of obsoleted index node
889  * struct ubifs_scan_node - UBIFS scanned node information.
891  * @key: key of node scanned (if it has one)
893  * @type: type of node scanned
894  * @offs: offset with LEB of node scanned
895  * @len: length of node scanned
896  * @node: raw node
905 	void *node;  member
1138  * struct ubifs_cnode - LEB Properties Tree common node.
1144  * @num: node number
1156  * struct ubifs_pnode - LEB Properties Tree leaf node.
1162  * @num: node number
1176  * struct ubifs_nbranch - LEB Properties Tree internal node branch.
1194  * struct ubifs_nnode - LEB Properties Tree internal node.
1200  * @num: node number
1336  * @lnum: LEB number of the target node (indexing node or data node)
1337  * @offs: target node offset within @lnum
1338  * @len: target node length
1352  * struct ubifs_znode - in-memory representation of an indexing node.
1361  * @lnum: LEB number of the corresponding indexing node
1362  * @offs: offset of the corresponding indexing node
1363  * @len: length  of the corresponding indexing node
1386  * @key: first data node key
1407  * struct ubifs_node_range - node length range description data structure.
1408  * @len: fixed node length
1409  * @min_len: minimum possible node length
1410  * @max_len: maximum possible node length
1412  * If @max_len is %0, the node has fixed length @len.
1474  * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to
1508  * @rb: rb-tree node of rb-tree of orphans sorted by inode number
1634  * @tnc_mutex: protects the Tree Node Cache (TNC), @zroot, @cnext, @enext, and
1636  * @zroot: zbranch which points to the root index node and znode
1651  * @mst_node: master node
1652  * @mst_offs: offset of valid master node
1680  * @fanout: fanout of the index tree (number of links per indexing node)
1710  * @ref_node_alsz: size of the LEB reference node aligned to the min. flash
1712  * @mst_node_alsz: master node aligned size
1713  * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary
1714  * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary
1724  * @ranges: UBIFS node length ranges
1788  * @lpt_cnext: next LPT node to commit
1823  * @cs_sqnum: sequence number of first node in the log (commit start node)
1824  * @replay_sqnum: sequence number of node currently being replayed
1827  * @rcvrd_mst_node: recovered master node to write when re-mounting R/O mounted
2100 int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum,
2105 void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last);
2189 			void *node, const struct qstr *nm);
2191 		     void *node, int *lnum, int *offs);
2233 			void *node);