[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-id: <007e01cfab20$7319fd60$594df820$@samsung.com>
Date: Tue, 29 Jul 2014 19:29:24 +0800
From: Chao Yu <chao2.yu@...sung.com>
To: 'Jaegeuk Kim' <jaegeuk@...nel.org>
Cc: linux-kernel@...r.kernel.org, linux-fsdevel@...r.kernel.org,
linux-f2fs-devel@...ts.sourceforge.net
Subject: RE: [f2fs-dev] [PATCH 02/11] f2fs: punch the core function for inode
management
> -----Original Message-----
> From: Jaegeuk Kim [mailto:jaegeuk@...nel.org]
> Sent: Saturday, July 26, 2014 6:47 AM
> To: linux-kernel@...r.kernel.org; linux-fsdevel@...r.kernel.org;
> linux-f2fs-devel@...ts.sourceforge.net
> Cc: Jaegeuk Kim
> Subject: [f2fs-dev] [PATCH 02/11] f2fs: punch the core function for inode management
>
> This patch punches out the core functions to manage the inode numbers.
>
> Signed-off-by: Jaegeuk Kim <jaegeuk@...nel.org>
Reviewed-by: Chao Yu <chao2.yu@...sung.com>
> ---
> fs/f2fs/checkpoint.c | 81 ++++++++++++++++++++++++++++------------------------
> 1 file changed, 44 insertions(+), 37 deletions(-)
>
> diff --git a/fs/f2fs/checkpoint.c b/fs/f2fs/checkpoint.c
> index 0b4710c..3e3c2c3 100644
> --- a/fs/f2fs/checkpoint.c
> +++ b/fs/f2fs/checkpoint.c
> @@ -282,6 +282,47 @@ const struct address_space_operations f2fs_meta_aops = {
> .set_page_dirty = f2fs_set_meta_page_dirty,
> };
>
> +static void __add_ino_entry(struct f2fs_sb_info *sbi, nid_t ino)
> +{
> + struct list_head *head;
> + struct ino_entry *new, *e;
> +
> + new = f2fs_kmem_cache_alloc(orphan_entry_slab, GFP_ATOMIC);
> + new->ino = ino;
> +
> + spin_lock(&sbi->orphan_inode_lock);
> + list_for_each_entry(e, &sbi->orphan_inode_list, list) {
> + if (e->ino == ino) {
> + spin_unlock(&sbi->orphan_inode_lock);
> + kmem_cache_free(orphan_entry_slab, new);
> + return;
> + }
> + if (e->ino > ino)
> + break;
> + }
> +
> + /* add new entry into list which is sorted by inode number */
> + list_add_tail(&new->list, &e->list);
> + spin_unlock(&sbi->orphan_inode_lock);
> +}
> +
> +static void __remove_ino_entry(struct f2fs_sb_info *sbi, nid_t ino)
> +{
> + struct ino_entry *e;
> +
> + spin_lock(&sbi->orphan_inode_lock);
> + list_for_each_entry(e, &sbi->orphan_inode_list, list) {
> + if (e->ino == ino) {
> + list_del(&e->list);
> + sbi->n_orphans--;
> + spin_unlock(&sbi->orphan_inode_lock);
> + kmem_cache_free(orphan_entry_slab, e);
> + return;
> + }
> + }
> + spin_unlock(&sbi->orphan_inode_lock);
> +}
> +
> int acquire_orphan_inode(struct f2fs_sb_info *sbi)
> {
> int err = 0;
> @@ -306,48 +347,14 @@ void release_orphan_inode(struct f2fs_sb_info *sbi)
>
> void add_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
> {
> - struct list_head *head;
> - struct orphan_inode_entry *new, *orphan;
> -
> - new = f2fs_kmem_cache_alloc(orphan_entry_slab, GFP_ATOMIC);
> - new->ino = ino;
> -
> - spin_lock(&sbi->orphan_inode_lock);
> - head = &sbi->orphan_inode_list;
> - list_for_each_entry(orphan, head, list) {
> - if (orphan->ino == ino) {
> - spin_unlock(&sbi->orphan_inode_lock);
> - kmem_cache_free(orphan_entry_slab, new);
> - return;
> - }
> -
> - if (orphan->ino > ino)
> - break;
> - }
> -
> /* add new orphan entry into list which is sorted by inode number */
> - list_add_tail(&new->list, &orphan->list);
> - spin_unlock(&sbi->orphan_inode_lock);
> + __add_ino_entry(sbi, ino);
> }
>
> void remove_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
> {
> - struct list_head *head;
> - struct orphan_inode_entry *orphan;
> -
> - spin_lock(&sbi->orphan_inode_lock);
> - head = &sbi->orphan_inode_list;
> - list_for_each_entry(orphan, head, list) {
> - if (orphan->ino == ino) {
> - list_del(&orphan->list);
> - f2fs_bug_on(sbi->n_orphans == 0);
> - sbi->n_orphans--;
> - spin_unlock(&sbi->orphan_inode_lock);
> - kmem_cache_free(orphan_entry_slab, orphan);
> - return;
> - }
> - }
> - spin_unlock(&sbi->orphan_inode_lock);
> + /* remove orphan entry from orphan list */
> + __remove_ino_entry(sbi, ino);
> }
>
> static void recover_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
> --
> 1.8.5.2 (Apple Git-48)
>
>
> ------------------------------------------------------------------------------
> Want fast and easy access to all the code in your enterprise? Index and
> search up to 200,000 lines of code with a free copy of Black Duck
> Code Sight - the same software that powers the world's largest code
> search on Ohloh, the Black Duck Open Hub! Try it now.
> http://p.sf.net/sfu/bds
> _______________________________________________
> Linux-f2fs-devel mailing list
> Linux-f2fs-devel@...ts.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/linux-f2fs-devel
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists