Lines Matching defs:node
139 * How much memory is needed for a buffer where we compress a data node.
208 * SCANNED_A_NODE: scanned a valid node
209 * SCANNED_A_CORRUPT_NODE: scanned a corrupted node
210 * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length
239 * LTAB_DIRTY: ltab node is dirty
240 * LSAVE_DIRTY: lsave node is dirty
272 * struct ubifs_old_idx - index node obsoleted since last commit start.
273 * @rb: rb-tree node
274 * @lnum: LEB number of obsoleted index node
275 * @offs: offset of obsoleted index node
292 * struct ubifs_scan_node - UBIFS scanned node information.
294 * @key: key of node scanned (if it has one)
296 * @type: type of node scanned
297 * @offs: offset with LEB of node scanned
298 * @len: length of node scanned
299 * @node: raw node
308 void *node;
543 * struct ubifs_cnode - LEB Properties Tree common node.
549 * @num: node number
561 * struct ubifs_pnode - LEB Properties Tree leaf node.
567 * @num: node number
581 * struct ubifs_nbranch - LEB Properties Tree internal node branch.
599 * struct ubifs_nnode - LEB Properties Tree internal node.
605 * @num: node number
709 * @log_hash: the log hash from the commit start node up to this bud
725 * @log_hash: the log hash from the commit start node up to this journal head
740 * @lnum: LEB number of the target node (indexing node or data node)
741 * @offs: target node offset within @lnum
742 * @len: target node length
743 * @hash: the hash of the target node
758 * struct ubifs_znode - in-memory representation of an indexing node.
761 * @cparent: parent node for this commit
769 * @lnum: LEB number of the corresponding indexing node
770 * @offs: offset of the corresponding indexing node
771 * @len: length of the corresponding indexing node
796 * @key: first data node key
817 * struct ubifs_node_range - node length range description data structure.
818 * @len: fixed node length
819 * @min_len: minimum possible node length
820 * @max_len: maximum possible node length
822 * If @max_len is %0, the node has fixed length @len.
880 * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to
914 * @rb: rb-tree node of rb-tree of orphans sorted by inode number
999 * @sup_node: The super block node as read from the device
1049 * @zroot: zbranch which points to the root index node and znode
1064 * @mst_node: master node
1065 * @mst_offs: offset of valid master node
1093 * @hash_len: The length of the index node hashes
1094 * @fanout: fanout of the index tree (number of links per indexing node)
1123 * @ref_node_alsz: size of the LEB reference node aligned to the min. flash
1125 * @mst_node_alsz: master node aligned size
1126 * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary
1127 * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary
1137 * @ranges: UBIFS node length ranges
1201 * @lpt_cnext: next LPT node to commit
1234 * @log_hash: the log hash from the commit start node up to the latest reference
1235 * node.
1245 * @cs_sqnum: sequence number of first node in the log (commit start node)
1248 * @rcvrd_mst_node: recovered master node to write when re-mounting R/O mounted
1564 int ubifs_prepare_auth_node(struct ubifs_info *c, void *node,
1598 void ubifs_bad_hash(const struct ubifs_info *c, const void *node,
1601 static inline void ubifs_bad_hash(const struct ubifs_info *c, const void *node,
1676 * ubifs_auth_node_sz - returns the size of an authentication node
1679 * This function returns the size of an authentication node which can
1680 * be 0 for unauthenticated filesystems or the real size of an auth node
1725 int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum,
1734 int ubifs_prepare_node_hmac(struct ubifs_info *c, void *node, int len,
1736 void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last);
1829 void *node, const struct fscrypt_name *nm);
1831 void *node, uint32_t secondary_hash);
1833 void *node, int *lnum, int *offs);
1881 void *node);