Lines Matching refs:node
30 * @lnum: logical eraseblock number of the node
31 * @offs: node offset
32 * @len: node length
33 * @deletion: non-zero if this entry corresponds to a node deletion
34 * @sqnum: node sequence number
36 * @key: node key
67 * @sqnum: reference node sequence number
364 * insert_node - insert a node to the replay list
366 * @lnum: node logical eraseblock number
367 * @offs: node offset
368 * @len: node length
369 * @key: node key
376 * This function inserts a scanned non-direntry node to the replay list. The
416 * insert_dent - insert a directory entry node into the replay list.
418 * @lnum: node logical eraseblock number
419 * @offs: node offset
420 * @len: node length
421 * @key: node key
428 * This function inserts a scanned directory entry node or an extended
473 * ubifs_validate_entry - validate directory or extended attribute entry node.
475 * @dent: the node to validate
477 * This function validates directory or extended attribute entry node @dent.
478 * Returns zero if the node is all right and a %-EINVAL if not.
491 ubifs_err(c, "bad %s node", key_type == UBIFS_DENT_KEY ?
538 * log reference node for the new bud (B), and only after this it
584 * after some buds and contain a HMAC covering the authentication node itself
585 * and the buds between the last authentication node and the current
586 * authentication node. It can happen that the last buds cannot be authenticated
588 * corresponding authentication node. This function returns the number of nodes
609 struct ubifs_auth_node *auth = snod->node;
627 err = crypto_shash_update(log_hash, snod->node,
637 * the corresponding authentication node. This may only happen on
732 ubifs_node_calc_hash(c, snod->node, hash);
740 struct ubifs_ino_node *ino = snod->node;
752 struct ubifs_data_node *dn = snod->node;
765 struct ubifs_dent_node *dent = snod->node;
779 struct ubifs_trun_node *trun = snod->node;
784 /* Validate truncation node */
788 ubifs_err(c, "bad truncation node");
805 ubifs_err(c, "unexpected node type %d in bud LEB %d:%d",
832 ubifs_err(c, "bad node is at LEB %d:%d", lnum, snod->offs);
833 ubifs_dump_node(c, snod->node, c->leb_size - snod->offs);
884 * @sqnum: reference node sequence number
934 * validate_ref - validate a reference node.
936 * @ref: the reference node to validate
939 * returned if the reference node is new, otherwise %-EINVAL is returned if
951 * to the end of LEB and we write reference node for it during commit.
987 const struct ubifs_cs_node *node;
1009 node = sleb->buf;
1014 * the first node is a commit start node. Also record its
1020 ubifs_err(c, "first log node at LEB %d:%d is not CS node",
1024 if (le64_to_cpu(node->cmt_no) != c->cmt_no) {
1025 ubifs_err(c, "first CS node at LEB %d:%d has wrong commit number %llu expected %llu",
1027 (unsigned long long)le64_to_cpu(node->cmt_no),
1032 c->cs_sqnum = le64_to_cpu(node->ch.sqnum);
1039 err = ubifs_shash_update(c, c->log_hash, node, UBIFS_CS_NODE_SZ);
1056 /* Make sure the first node sits at offset zero of the LEB */
1058 ubifs_err(c, "first node is not at zero offset");
1081 const struct ubifs_ref_node *ref = snod->node;
1106 ubifs_err(c, "unexpected node in log");
1111 ubifs_err(c, "unexpected node in log");
1129 ubifs_dump_node(c, snod->node, c->leb_size - snod->offs);
1207 * "commit start" node on a properly formatted UBIFS.