insert_node(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’… insert_node(9) β€” Kernel API Manual, bestie edition ✨

okay so this is the insert_node(9) page from the Kernel API Manual, and we are about to make the replay list make sense. no cap. 🫢

πŸŽ€ NAME πŸŽ€

insert_node β€” insert a node to the replay list

⭐ SYNOPSIS ⭐

       int insert_node (struct ubifs_info *c , int lnum , int offs , int len ,
       const u8 *hash , union ubifs_key *key , unsigned long long sqnum , int
       deletion , int *used , loff_t old_size , loff_t new_size );

πŸ“Œ ARGUMENTS πŸ“Œ

  • c β€” the UBIFS file-system description object, literally the whole context bestie.
  • lnum β€” node logical eraseblock number.
  • offs β€” node offset.
  • len β€” node length.
  • hash β€” node hash.
  • key β€” node key.
  • sqnum β€” sequence number.
  • deletion β€” non-zero if this is a deletion.
  • used β€” number of bytes in use in a LEB.
  • old_size β€” truncation old size.
  • new_size β€” truncation new size.

πŸ’– DESCRIPTION πŸ’–

So bestie, this function inserts a scanned non-direntry node to the replay list. The replay list contains struct replay_entry elements, and we sort this list in sequence number order before applying it. The replay list is applied at the very end of the replay process. Since the list is sorted in sequence number order, the older modifications are applied first. This function returns zero in case of success and a negative error code in case of failure. slay. πŸ’…

πŸ”₯ SEE ALSO πŸ”₯


mwah πŸ’‹ β€” this cutie came from source/version ./fs/ubifs, it is dated October 2026, and the manual page is insert_node(9). periodt. 🌈

πŸ“¦ where this page comes from