diff options
author | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2011-05-15 11:37:17 +0300 |
---|---|---|
committer | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2011-05-16 10:31:40 +0300 |
commit | 074bcb9b5ce698bd7b02ddb469da9cba21fe83fd (patch) | |
tree | 98a46a995a17e7199116a9c3970f9299a16effcc /fs/ubifs/ubifs.h | |
parent | af1dd412646a58b29522f93f7befa944d7d361c0 (diff) | |
download | op-kernel-dev-074bcb9b5ce698bd7b02ddb469da9cba21fe83fd.zip op-kernel-dev-074bcb9b5ce698bd7b02ddb469da9cba21fe83fd.tar.gz |
UBIFS: simplify replay
This patch simplifies the replay code and makes it smaller. First of all, we
can notice that we do not really need to create bud replay entries and insert
them to the replay tree, because the only reason we do this is to set buds
lprops correctly at the end. Instead, we can just walk the list of buds at the
very end and set lprops for each bud. This allows us to get rid of whole
'insert_ref_node()' function, the 'REPLAY_REF' flag, and several fields in
'struct replay_entry'. Then we can also notice that we do not need the 'flags'
'struct replay_entry' field, because there is only one flag -
'REPLAY_DELETION'. Instead, we can just add a 'deletion' bit fields. As a
result, this patch deletes much more lines that in adds.
Signed-off-by: Artem Bityutskiy <Artem.Bityutskiy@nokia.com>
Diffstat (limited to 'fs/ubifs/ubifs.h')
0 files changed, 0 insertions, 0 deletions