From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1751181AbdBUHQV (ORCPT ); Tue, 21 Feb 2017 02:16:21 -0500 Received: from mga03.intel.com ([134.134.136.65]:45477 "EHLO mga03.intel.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1750912AbdBUHQP (ORCPT ); Tue, 21 Feb 2017 02:16:15 -0500 X-ExtLoop1: 1 X-IronPort-AV: E=Sophos;i="5.35,188,1484035200"; d="scan'208";a="936304463" From: "Reshetova, Elena" To: Paul Moore CC: "linux-kernel@vger.kernel.org" , "cgroups@vger.kernel.org" , "linux-audit@redhat.com" , "linux-fsdevel@vger.kernel.org" , "peterz@infradead.org" , "gregkh@linuxfoundation.org" , "viro@zeniv.linux.org.uk" , "tj@kernel.org" , "mingo@redhat.com" , "hannes@cmpxchg.org" , "lizefan@huawei.com" , "acme@kernel.org" , "alexander.shishkin@linux.intel.com" , Eric Paris , "akpm@linux-foundation.org" , "arnd@arndb.de" , "luto@kernel.org" , Hans Liljestrand , Kees Cook , David Windsor Subject: RE: [PATCH 15/19] kernel: convert audit_tree.count from atomic_t to refcount_t Thread-Topic: [PATCH 15/19] kernel: convert audit_tree.count from atomic_t to refcount_t Thread-Index: AQHSi2OyWcwNjBKyxUGAIiRh3TjHfqFydKeAgACYa+A= Date: Tue, 21 Feb 2017 07:15:53 +0000 Message-ID: <2236FBA76BA1254E88B949DDB74E612B41C4DE27@IRSMSX102.ger.corp.intel.com> References: <1487585948-6401-1-git-send-email-elena.reshetova@intel.com> <1487585948-6401-16-git-send-email-elena.reshetova@intel.com> In-Reply-To: Accept-Language: en-US Content-Language: en-US X-MS-Has-Attach: X-MS-TNEF-Correlator: x-originating-ip: [163.33.239.182] Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from base64 to 8bit by mail.home.local id v1L7GQDQ004665 > On Mon, Feb 20, 2017 at 5:19 AM, Elena Reshetova > wrote: > > refcount_t type and corresponding API should be > > used instead of atomic_t when the variable is used as > > a reference counter. This allows to avoid accidental > > refcounter overflows that might lead to use-after-free > > situations. > > > > Signed-off-by: Elena Reshetova > > Signed-off-by: Hans Liljestrand > > Signed-off-by: Kees Cook > > Signed-off-by: David Windsor > > --- > > kernel/audit_tree.c | 8 ++++---- > > 1 file changed, 4 insertions(+), 4 deletions(-) > > No objection on my end, same for patch 16/19. > > I have no problem merging both these patches into the audit/next > branch after the merge window, is that your goal or are you merging > these via a different tree? Thank you Paul! I think it is better if they go through the trees they supposed to go through since this way they would get more testing and etc. So, please take the relevant ones to your tree when the time is right. After the first round, I guess we will see what patches are not propagating and then maybe take them via Kees tree. Best Regards, Elena. > > > diff --git a/kernel/audit_tree.c b/kernel/audit_tree.c > > index 7b44195..7ed617b 100644 > > --- a/kernel/audit_tree.c > > +++ b/kernel/audit_tree.c > > @@ -9,7 +9,7 @@ struct audit_tree; > > struct audit_chunk; > > > > struct audit_tree { > > - atomic_t count; > > + refcount_t count; > > int goner; > > struct audit_chunk *root; > > struct list_head chunks; > > @@ -77,7 +77,7 @@ static struct audit_tree *alloc_tree(const char *s) > > > > tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); > > if (tree) { > > - atomic_set(&tree->count, 1); > > + refcount_set(&tree->count, 1); > > tree->goner = 0; > > INIT_LIST_HEAD(&tree->chunks); > > INIT_LIST_HEAD(&tree->rules); > > @@ -91,12 +91,12 @@ static struct audit_tree *alloc_tree(const char *s) > > > > static inline void get_tree(struct audit_tree *tree) > > { > > - atomic_inc(&tree->count); > > + refcount_inc(&tree->count); > > } > > > > static inline void put_tree(struct audit_tree *tree) > > { > > - if (atomic_dec_and_test(&tree->count)) > > + if (refcount_dec_and_test(&tree->count)) > > kfree_rcu(tree, head); > > } > > > > -- > paul moore > www.paul-moore.com