From patchwork Mon Aug 31 08:54:35 2015 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Qu Wenruo X-Patchwork-Id: 7109061 Return-Path: X-Original-To: patchwork-linux-btrfs@patchwork.kernel.org Delivered-To: patchwork-parsemail@patchwork2.web.kernel.org Received: from mail.kernel.org (mail.kernel.org [198.145.29.136]) by patchwork2.web.kernel.org (Postfix) with ESMTP id 697E3BF036 for ; Wed, 2 Sep 2015 07:51:24 +0000 (UTC) Received: from mail.kernel.org (localhost [127.0.0.1]) by mail.kernel.org (Postfix) with ESMTP id 7321F20645 for ; Wed, 2 Sep 2015 07:51:23 +0000 (UTC) Received: from vger.kernel.org (vger.kernel.org [209.132.180.67]) by mail.kernel.org (Postfix) with ESMTP id 6581520644 for ; Wed, 2 Sep 2015 07:51:22 +0000 (UTC) Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1752189AbbIBHvS (ORCPT ); Wed, 2 Sep 2015 03:51:18 -0400 Received: from cn.fujitsu.com ([222.73.24.84]:42571 "EHLO song.cn.fujitsu.com" rhost-flags-OK-FAIL-OK-OK) by vger.kernel.org with ESMTP id S1752006AbbIBHvR (ORCPT ); Wed, 2 Sep 2015 03:51:17 -0400 X-Greylist: delayed 152915 seconds by postgrey-1.27 at vger.kernel.org; Wed, 02 Sep 2015 03:51:12 EDT Received: from unknown (HELO tang.cn.fujitsu.com) ([10.167.250.3]) by song.cn.fujitsu.com with ESMTP; 31 Aug 2015 16:55:41 +0800 Received: from localhost.localdomain (tang.cn.fujitsu.com [127.0.0.1]) by tang.cn.fujitsu.com (8.14.3/8.13.1) with ESMTP id t7V8udC0031126 for ; Mon, 31 Aug 2015 16:56:47 +0800 From: Qu Wenruo To: linux-btrfs@vger.kernel.org Subject: [PATCH RFC 04/14] btrfs: qgroup: Introduce function to insert non-overlap reserve range Date: Mon, 31 Aug 2015 16:54:35 +0800 Message-Id: <1441011286-23733-5-git-send-email-quwenruo@cn.fujitsu.com> X-Mailer: git-send-email 2.5.0 In-Reply-To: <1441011286-23733-1-git-send-email-quwenruo@cn.fujitsu.com> References: <1441011286-23733-1-git-send-email-quwenruo@cn.fujitsu.com> Sender: linux-btrfs-owner@vger.kernel.org Precedence: bulk List-ID: X-Mailing-List: linux-btrfs@vger.kernel.org X-Spam-Status: No, score=-6.9 required=5.0 tests=BAYES_00, RCVD_IN_DNSWL_HI, T_RP_MATCHES_RCVD, UNPARSEABLE_RELAY autolearn=ham version=3.3.1 X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on mail.kernel.org X-Virus-Scanned: ClamAV using ClamSMTP New function insert_data_ranges() will insert non-overlap reserve ranges into reserve map. It provides the basis for later qgroup reserve map implement. Signed-off-by: Qu Wenruo --- fs/btrfs/qgroup.c | 123 ++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 123 insertions(+) diff --git a/fs/btrfs/qgroup.c b/fs/btrfs/qgroup.c index e19fe6a..90f5c4b 100644 --- a/fs/btrfs/qgroup.c +++ b/fs/btrfs/qgroup.c @@ -2549,6 +2549,129 @@ find_reserve_range(struct btrfs_qgroup_data_rsv_map *map, u64 start) } /* + * Insert one data range + * [start,len) here won't overflap with each other. + * + * Return 0 if range is inserted and tmp is not used. + * Return > 0 if range is inserted and tmp is used. + * No catchable error case. Only possible error will cause BUG_ON() as + * that's logical error. + */ +static int insert_data_range(struct btrfs_qgroup_data_rsv_map *map, + struct data_rsv_range *tmp, + u64 start, u64 len) +{ + struct rb_node **p = &map->root.rb_node; + struct rb_node *parent = NULL; + struct rb_node *tmp_node = NULL; + struct data_rsv_range *range = NULL; + struct data_rsv_range *prev_range = NULL; + struct data_rsv_range *next_range = NULL; + int prev_merged = 0; + int next_merged = 0; + int ret = 0; + + while (*p) { + parent = *p; + range = rb_entry(parent, struct data_rsv_range, node); + if (range->start < start) + p = &(*p)->rb_right; + else if (range->start > start) + p = &(*p)->rb_left; + else + BUG_ON(1); + } + + /* Empty tree, goto isolated case */ + if (!range) + goto insert_isolated; + + /* get adjusted ranges */ + if (range->start < start) { + prev_range = range; + tmp_node = rb_next(parent); + if (tmp) + next_range = rb_entry(tmp_node, struct data_rsv_range, + node); + } else { + next_range = range; + tmp_node = rb_prev(parent); + if (tmp) + prev_range = rb_entry(tmp_node, struct data_rsv_range, + node); + } + + /* try to merge with previous and next ranges */ + if (prev_range) { + if (prev_range->start + prev_range->len == start) { + prev_range->len += len; + prev_merged = 1; + } + } + if (next_range) { + /* prev and next with start,len can be merged */ + if (prev_merged && start + len == next_range->start) { + prev_range->len += next_range->len; + next_merged = 1; + } else if (start + len == next_range->start) { + next_range->start = start; + next_range->len += len; + rb_erase(&next_range->node, &map->root); + kfree(next_range); + next_merged = 1; + } + } + +insert_isolated: + /* isolated case, need to insert range now */ + if (!next_merged && !prev_merged) { + BUG_ON(!tmp); + + tmp->start = start; + tmp->len = len; + rb_link_node(&tmp->node, parent, p); + rb_insert_color(&tmp->node, &map->root); + ret = 1; + } + return ret; +} + +/* + * insert reserve range and merge them if possible + * + * Return 0 if all inserted and tmp not used + * Return > 0 if all inserted and tmp used + * No catchable error return value. + */ +static int insert_data_ranges(struct btrfs_qgroup_data_rsv_map *map, + struct data_rsv_range *tmp, + struct ulist *insert_list) +{ + struct ulist_node *unode; + struct ulist_iterator uiter; + int tmp_used = 0; + int ret = 0; + + ULIST_ITER_INIT(&uiter); + while ((unode = ulist_next(insert_list, &uiter))) { + ret = insert_data_range(map, tmp, unode->val, unode->aux); + + /* + * insert_data_range() won't return error return value, + * no need to hanle <0 case. + * + * Also tmp should be used at most one time, so clear it to + * NULL to cooperate with sanity check in insert_data_range(). + */ + if (ret > 0) { + tmp_used = 1; + tmp = NULL; + } + } + return tmp_used; +} + +/* * Init data_rsv_map for a given inode. * * This is needed at write time as quota can be disabled and then enabled