From: Jan Kara <jack@suse.cz> To: Sascha Hauer <s.hauer@pengutronix.de> Cc: Jan Kara <jack@suse.cz>, Dongsheng Yang <yangds.fnst@cn.fujitsu.com>, Richard Weinberger <richard@nod.at>, linux-mtd@lists.infradead.org, kernel@pengutronix.de, Jan Kara <jack@suse.com>, linux-fsdevel@vger.kernel.org Subject: Re: [PATCH 7/7] ubifs: Add quota support Date: Mon, 11 Nov 2019 17:34:46 +0100 [thread overview] Message-ID: <20191111163446.GF13307@quack2.suse.cz> (raw) In-Reply-To: <20191111085745.t6qbckcxt6byaoxq@pengutronix.de> Hi Sascha! On Mon 11-11-19 09:57:45, Sascha Hauer wrote: > On Wed, Nov 06, 2019 at 11:14:28AM +0100, Jan Kara wrote: > > > +/** > > > + * ubifs_dqblk_find_next - find the next qid > > > + * @c: UBIFS file-system description object > > > + * @qid: The qid to look for > > > + * > > > + * Find the next dqblk entry with a qid that is bigger or equally big than the > > > + * given qid. Returns the next dqblk entry if found or NULL if no dqblk exists > > > + * with a qid that is at least equally big. > > > + */ > > > +static struct ubifs_dqblk *ubifs_dqblk_find_next(struct ubifs_info *c, > > > + struct kqid qid) > > > +{ > > > + struct rb_node *node = c->dqblk_tree[qid.type].rb_node; > > > + struct ubifs_dqblk *next = NULL; > > > + > > > + while (node) { > > > + struct ubifs_dqblk *ud = rb_entry(node, struct ubifs_dqblk, rb); > > > + > > > + if (qid_eq(qid, ud->kqid)) > > > + return ud; > > > + > > > + if (qid_lt(qid, ud->kqid)) { > > > + if (!next || qid_lt(ud->kqid, next->kqid)) ^^^ This condition looks superfluous as it should be always true. The last node where you went left should be the least greater node if you didn't find the exact match... > > > + next = ud; > > > + > > > + node = node->rb_left; > > > + } else { > > > + node = node->rb_right; > > > + } > > > + } > > > + > > > + return next; > > > +} > > > > Why not use rb_next() here? It should do what you need, shouldn't it? > > I could use rb_next(), but it defeats the purpose of a tree to iterate > over the whole tree to find an entry. If I wanted that I would have used > a list. I wasn't quite clear in my suggestion and now that I look at it it was actually misleading. I'm sorry for that. So a second try :): You have ubifs_dqblk_find() and ubifs_dqblk_find_next() doing very similar rbtree traversal. I think you could remove that duplication by using ubifs_dqblk_find_next() from ubifs_dqblk_find()? Honza -- Jan Kara <jack@suse.com> SUSE Labs, CR
WARNING: multiple messages have this Message-ID (diff)
From: Jan Kara <jack@suse.cz> To: Sascha Hauer <s.hauer@pengutronix.de> Cc: Dongsheng Yang <yangds.fnst@cn.fujitsu.com>, Jan Kara <jack@suse.cz>, Richard Weinberger <richard@nod.at>, linux-mtd@lists.infradead.org, kernel@pengutronix.de, Jan Kara <jack@suse.com>, linux-fsdevel@vger.kernel.org Subject: Re: [PATCH 7/7] ubifs: Add quota support Date: Mon, 11 Nov 2019 17:34:46 +0100 [thread overview] Message-ID: <20191111163446.GF13307@quack2.suse.cz> (raw) In-Reply-To: <20191111085745.t6qbckcxt6byaoxq@pengutronix.de> Hi Sascha! On Mon 11-11-19 09:57:45, Sascha Hauer wrote: > On Wed, Nov 06, 2019 at 11:14:28AM +0100, Jan Kara wrote: > > > +/** > > > + * ubifs_dqblk_find_next - find the next qid > > > + * @c: UBIFS file-system description object > > > + * @qid: The qid to look for > > > + * > > > + * Find the next dqblk entry with a qid that is bigger or equally big than the > > > + * given qid. Returns the next dqblk entry if found or NULL if no dqblk exists > > > + * with a qid that is at least equally big. > > > + */ > > > +static struct ubifs_dqblk *ubifs_dqblk_find_next(struct ubifs_info *c, > > > + struct kqid qid) > > > +{ > > > + struct rb_node *node = c->dqblk_tree[qid.type].rb_node; > > > + struct ubifs_dqblk *next = NULL; > > > + > > > + while (node) { > > > + struct ubifs_dqblk *ud = rb_entry(node, struct ubifs_dqblk, rb); > > > + > > > + if (qid_eq(qid, ud->kqid)) > > > + return ud; > > > + > > > + if (qid_lt(qid, ud->kqid)) { > > > + if (!next || qid_lt(ud->kqid, next->kqid)) ^^^ This condition looks superfluous as it should be always true. The last node where you went left should be the least greater node if you didn't find the exact match... > > > + next = ud; > > > + > > > + node = node->rb_left; > > > + } else { > > > + node = node->rb_right; > > > + } > > > + } > > > + > > > + return next; > > > +} > > > > Why not use rb_next() here? It should do what you need, shouldn't it? > > I could use rb_next(), but it defeats the purpose of a tree to iterate > over the whole tree to find an entry. If I wanted that I would have used > a list. I wasn't quite clear in my suggestion and now that I look at it it was actually misleading. I'm sorry for that. So a second try :): You have ubifs_dqblk_find() and ubifs_dqblk_find_next() doing very similar rbtree traversal. I think you could remove that duplication by using ubifs_dqblk_find_next() from ubifs_dqblk_find()? Honza -- Jan Kara <jack@suse.com> SUSE Labs, CR ______________________________________________________ Linux MTD discussion mailing list http://lists.infradead.org/mailman/listinfo/linux-mtd/
next prev parent reply other threads:[~2019-11-11 16:34 UTC|newest] Thread overview: 44+ messages / expand[flat|nested] mbox.gz Atom feed top 2019-11-06 9:15 [PATCH v3 0/7] Add quota support to UBIFS Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2019-11-06 9:15 ` [PATCH 1/7] quota: Allow to pass mount path to quotactl Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2019-11-06 10:05 ` Jan Kara 2019-11-06 10:05 ` Jan Kara 2019-11-06 10:15 ` Sascha Hauer 2019-11-06 10:15 ` Sascha Hauer 2019-11-06 9:15 ` [PATCH 2/7] ubifs: move checks and preparation into setflags() Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2020-01-19 19:56 ` Richard Weinberger 2020-01-19 19:56 ` Richard Weinberger 2019-11-06 9:15 ` [PATCH 3/7] ubifs: Add support for FS_IOC_FS[SG]ETXATTR ioctls Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2020-01-19 19:55 ` Richard Weinberger 2020-01-19 19:55 ` Richard Weinberger 2019-11-06 9:15 ` [PATCH 4/7] ubifs: do not ubifs_inode() on potentially NULL pointer Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2020-01-19 19:58 ` Richard Weinberger 2020-01-19 19:58 ` Richard Weinberger 2019-11-06 9:15 ` [PATCH 5/7] ubifs: Add support for project id Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2020-01-19 20:09 ` Richard Weinberger 2020-01-19 20:09 ` Richard Weinberger 2020-01-24 8:05 ` Sascha Hauer 2020-01-24 8:05 ` Sascha Hauer 2019-11-06 9:15 ` [PATCH 6/7] ubifs: export get_znode Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2019-11-06 9:15 ` [PATCH 7/7] ubifs: Add quota support Sascha Hauer 2019-11-06 9:15 ` Sascha Hauer 2019-11-06 10:14 ` Jan Kara 2019-11-06 10:14 ` Jan Kara 2019-11-11 8:57 ` Sascha Hauer 2019-11-11 8:57 ` Sascha Hauer 2019-11-11 16:34 ` Jan Kara [this message] 2019-11-11 16:34 ` Jan Kara 2019-11-12 8:59 ` Sascha Hauer 2019-11-12 8:59 ` Sascha Hauer 2019-11-12 9:31 ` Jan Kara 2019-11-12 9:31 ` Jan Kara 2019-11-08 14:47 ` kbuild test robot 2019-11-08 14:47 ` kbuild test robot 2019-11-08 14:47 ` kbuild test robot 2021-03-30 10:43 [PATCH v5 0/7] Add quota support to UBIFS Sascha Hauer 2021-03-30 10:43 ` [PATCH 7/7] ubifs: Add quota support Sascha Hauer
Reply instructions: You may reply publicly to this message via plain-text email using any one of the following methods: * Save the following mbox file, import it into your mail client, and reply-to-all from there: mbox Avoid top-posting and favor interleaved quoting: https://en.wikipedia.org/wiki/Posting_style#Interleaved_style * Reply using the --to, --cc, and --in-reply-to switches of git-send-email(1): git send-email \ --in-reply-to=20191111163446.GF13307@quack2.suse.cz \ --to=jack@suse.cz \ --cc=jack@suse.com \ --cc=kernel@pengutronix.de \ --cc=linux-fsdevel@vger.kernel.org \ --cc=linux-mtd@lists.infradead.org \ --cc=richard@nod.at \ --cc=s.hauer@pengutronix.de \ --cc=yangds.fnst@cn.fujitsu.com \ /path/to/YOUR_REPLY https://kernel.org/pub/software/scm/git/docs/git-send-email.html * If your mail client supports setting the In-Reply-To header via mailto: links, try the mailto: linkBe sure your reply has a Subject: header at the top and a blank line before the message body.
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.