|
Linux Kernel
3.7.1
|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
|
Linux Kernel
3.7.1
|
Data Fields | |
| int | lnum |
| int | offs |
| int | len |
| unsigned int | deletion:1 |
| unsigned long long | sqnum |
| struct list_head | list |
| union ubifs_key | key |
| union { | |
| struct qstr nm | |
| struct { | |
| loff_t old_size | |
| loff_t new_size | |
| } | |
| }; | |
struct replay_entry - replay list entry. : logical eraseblock number of the node : node offset : node length : non-zero if this entry corresponds to a node deletion : node sequence number : links the replay list : node key : directory entry name : truncation old size : truncation new size
The replay process first scans all buds and builds the replay list, then sorts the replay list in nodes sequence number order, and then inserts all the replay entries to the TNC.
insert_node - insert a node to the replay list : UBIFS file-system description object : node logical eraseblock number : node offset : node length : node key : sequence number : non-zero if this is a deletion : number of bytes in use in a LEB : truncation old size : truncation new size
This function inserts a scanned non-direntry node to the replay list. The replay list contains 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.
| union { ... } |
1.8.2