Loading fs/btrfs/tree-log.c +12 −8 Original line number Diff line number Diff line Loading @@ -24,10 +24,12 @@ * LOG_INODE_EXISTS means to log just enough to recreate the inode * during log replay */ #define LOG_INODE_ALL 0 #define LOG_INODE_EXISTS 1 #define LOG_OTHER_INODE 2 #define LOG_OTHER_INODE_ALL 3 enum { LOG_INODE_ALL, LOG_INODE_EXISTS, LOG_OTHER_INODE, LOG_OTHER_INODE_ALL, }; /* * directory trouble cases Loading Loading @@ -81,10 +83,12 @@ * The last stage is to deal with directories and links and extents * and all the other fun semantics */ #define LOG_WALK_PIN_ONLY 0 #define LOG_WALK_REPLAY_INODES 1 #define LOG_WALK_REPLAY_DIR_INDEX 2 #define LOG_WALK_REPLAY_ALL 3 enum { LOG_WALK_PIN_ONLY, LOG_WALK_REPLAY_INODES, LOG_WALK_REPLAY_DIR_INDEX, LOG_WALK_REPLAY_ALL, }; static int btrfs_log_inode(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_inode *inode, Loading Loading
fs/btrfs/tree-log.c +12 −8 Original line number Diff line number Diff line Loading @@ -24,10 +24,12 @@ * LOG_INODE_EXISTS means to log just enough to recreate the inode * during log replay */ #define LOG_INODE_ALL 0 #define LOG_INODE_EXISTS 1 #define LOG_OTHER_INODE 2 #define LOG_OTHER_INODE_ALL 3 enum { LOG_INODE_ALL, LOG_INODE_EXISTS, LOG_OTHER_INODE, LOG_OTHER_INODE_ALL, }; /* * directory trouble cases Loading Loading @@ -81,10 +83,12 @@ * The last stage is to deal with directories and links and extents * and all the other fun semantics */ #define LOG_WALK_PIN_ONLY 0 #define LOG_WALK_REPLAY_INODES 1 #define LOG_WALK_REPLAY_DIR_INDEX 2 #define LOG_WALK_REPLAY_ALL 3 enum { LOG_WALK_PIN_ONLY, LOG_WALK_REPLAY_INODES, LOG_WALK_REPLAY_DIR_INDEX, LOG_WALK_REPLAY_ALL, }; static int btrfs_log_inode(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_inode *inode, Loading