Lines Matching defs:node
141 * How much memory is needed for a buffer where we compress a data node.
217 * SCANNED_A_NODE: scanned a valid node
218 * SCANNED_A_CORRUPT_NODE: scanned a corrupted node
219 * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length
248 * LTAB_DIRTY: ltab node is dirty
249 * LSAVE_DIRTY: lsave node is dirty
281 * struct ubifs_old_idx - index node obsoleted since last commit start.
282 * @rb: rb-tree node
283 * @lnum: LEB number of obsoleted index node
284 * @offs: offset of obsoleted index node
301 * struct ubifs_scan_node - UBIFS scanned node information.
303 * @key: key of node scanned (if it has one)
305 * @type: type of node scanned
306 * @offs: offset with LEB of node scanned
307 * @len: length of node scanned
308 * @node: raw node
317 void *node;
552 * struct ubifs_cnode - LEB Properties Tree common node.
558 * @num: node number
570 * struct ubifs_pnode - LEB Properties Tree leaf node.
576 * @num: node number
590 * struct ubifs_nbranch - LEB Properties Tree internal node branch.
608 * struct ubifs_nnode - LEB Properties Tree internal node.
614 * @num: node number
718 * @log_hash: the log hash from the commit start node up to this bud
734 * @log_hash: the log hash from the commit start node up to this journal head
749 * @lnum: LEB number of the target node (indexing node or data node)
750 * @offs: target node offset within @lnum
751 * @len: target node length
752 * @hash: the hash of the target node
767 * struct ubifs_znode - in-memory representation of an indexing node.
770 * @cparent: parent node for this commit
778 * @lnum: LEB number of the corresponding indexing node
779 * @offs: offset of the corresponding indexing node
780 * @len: length of the corresponding indexing node
805 * @key: first data node key
826 * struct ubifs_node_range - node length range description data structure.
827 * @len: fixed node length
828 * @min_len: minimum possible node length
829 * @max_len: maximum possible node length
831 * If @max_len is %0, the node has fixed length @len.
889 * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to
923 * @rb: rb-tree node of rb-tree of orphans sorted by inode number
1020 * @sup_node: The super block node as read from the device
1070 * @zroot: zbranch which points to the root index node and znode
1085 * @mst_node: master node
1086 * @mst_offs: offset of valid master node
1114 * @hash_len: The length of the index node hashes
1115 * @fanout: fanout of the index tree (number of links per indexing node)
1144 * @ref_node_alsz: size of the LEB reference node aligned to the min. flash
1146 * @mst_node_alsz: master node aligned size
1147 * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary
1148 * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary
1158 * @ranges: UBIFS node length ranges
1222 * @lpt_cnext: next LPT node to commit
1255 * @log_hash: the log hash from the commit start node up to the latest reference
1256 * node.
1266 * @cs_sqnum: sequence number of first node in the log (commit start node)
1269 * @rcvrd_mst_node: recovered master node to write when re-mounting R/O mounted
1593 int ubifs_prepare_auth_node(struct ubifs_info *c, void *node,
1627 void ubifs_bad_hash(const struct ubifs_info *c, const void *node,
1630 static inline void ubifs_bad_hash(const struct ubifs_info *c, const void *node,
1705 * ubifs_auth_node_sz - returns the size of an authentication node
1708 * This function returns the size of an authentication node which can
1709 * be 0 for unauthenticated filesystems or the real size of an auth node
1754 int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum,
1763 int ubifs_prepare_node_hmac(struct ubifs_info *c, void *node, int len,
1765 void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last);
1858 void *node, const struct fscrypt_name *nm);
1860 void *node, uint32_t secondary_hash);
1862 void *node, int *lnum, int *offs);
1910 void *node);