From patchwork Wed May 10 06:10:48 2023 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Peng Zhang X-Patchwork-Id: 13236478 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.4.0 (2014-02-07) on aws-us-west-2-korg-lkml-1.web.codeaurora.org Received: from kanga.kvack.org (kanga.kvack.org [205.233.56.17]) by smtp.lore.kernel.org (Postfix) with ESMTP id D8863C77B7D for ; Wed, 10 May 2023 06:11:35 +0000 (UTC) Received: by kanga.kvack.org (Postfix) id 415086B0071; Wed, 10 May 2023 02:11:35 -0400 (EDT) Received: by kanga.kvack.org (Postfix, from userid 40) id 3C3636B0072; Wed, 10 May 2023 02:11:35 -0400 (EDT) X-Delivered-To: int-list-linux-mm@kvack.org Received: by kanga.kvack.org (Postfix, from userid 63042) id 28BB16B0074; Wed, 10 May 2023 02:11:35 -0400 (EDT) X-Delivered-To: linux-mm@kvack.org Received: from relay.hostedemail.com (smtprelay0015.hostedemail.com [216.40.44.15]) by kanga.kvack.org (Postfix) with ESMTP id 17C5C6B0071 for ; Wed, 10 May 2023 02:11:35 -0400 (EDT) Received: from smtpin18.hostedemail.com (a10.router.float.18 [10.200.18.1]) by unirelay07.hostedemail.com (Postfix) with ESMTP id CFA811604F2 for ; Wed, 10 May 2023 06:11:34 +0000 (UTC) X-FDA: 80773323708.18.FF723FE Received: from mail-pf1-f178.google.com (mail-pf1-f178.google.com [209.85.210.178]) by imf16.hostedemail.com (Postfix) with ESMTP id 0322818000F for ; Wed, 10 May 2023 06:11:31 +0000 (UTC) Authentication-Results: imf16.hostedemail.com; dkim=pass header.d=bytedance.com header.s=google header.b=gpLKjC+P; dmarc=pass (policy=quarantine) header.from=bytedance.com; spf=pass (imf16.hostedemail.com: domain of zhangpeng.00@bytedance.com designates 209.85.210.178 as permitted sender) smtp.mailfrom=zhangpeng.00@bytedance.com ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=hostedemail.com; s=arc-20220608; t=1683699092; h=from:from:sender:reply-to:subject:subject:date:date: message-id:message-id:to:to:cc:cc:mime-version:mime-version: content-type:content-transfer-encoding:content-transfer-encoding: in-reply-to:references:dkim-signature; bh=EveqtihCJt7fcxXdeINag7+zgOnp1O/guDL1F4v1dKU=; b=hBuCr/s7dEeEKK1Jmi6tjz+PtMiY+oHUqkuE0xJ2vdQe0nSi9wlLMRaGxB5vLrr0+cqXmG 51p+HPSilt7UNs/miVV+Bt721KO65B4T04fbSIkfc4nDDBg/1UU3kONFSob0zoizxZ+7Ec NEjs+/1iSdz+0L67ca2kAOdaWE7k5RA= ARC-Authentication-Results: i=1; imf16.hostedemail.com; dkim=pass header.d=bytedance.com header.s=google header.b=gpLKjC+P; dmarc=pass (policy=quarantine) header.from=bytedance.com; spf=pass (imf16.hostedemail.com: domain of zhangpeng.00@bytedance.com designates 209.85.210.178 as permitted sender) smtp.mailfrom=zhangpeng.00@bytedance.com ARC-Seal: i=1; s=arc-20220608; d=hostedemail.com; t=1683699092; a=rsa-sha256; cv=none; b=dReiviqH1k/Iklk6TBnPvraAGfqC8X3Icr0a3ygB6kiT1+aKVqNZxyjL5w4jXwWc5bkSIQ UHnPhYBs1FPv6dNDyTTnS9DEDIAP8xXAaLOdlB8dT+hPebYM6k1E1QihL2CjbmCNSBYXzl zPQ+DTKgtrc65gSpq/hhWkF4Px9DIcM= Received: by mail-pf1-f178.google.com with SMTP id d2e1a72fcca58-643912bca6fso5450490b3a.0 for ; Tue, 09 May 2023 23:11:31 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=bytedance.com; s=google; t=1683699090; x=1686291090; h=content-transfer-encoding:mime-version:message-id:date:subject:cc :to:from:from:to:cc:subject:date:message-id:reply-to; bh=EveqtihCJt7fcxXdeINag7+zgOnp1O/guDL1F4v1dKU=; b=gpLKjC+Pc646aikfwZbwfDgLcMm2FVJTiwwnMi35Hm39czV66fS8SZyARAVBeAditt OKSU+eQ6aRBnSjX/1XexuoIw4bRyUHN8bP7vdZejG43/PLnwlTaEQgp2PhUkvubZ0LO1 MBx9Q4oMHxNxES4P02pTtK67PajIYvYqHNKvmy0kaUMkSlX8+hGL/7gG7pBcRONzshXK iC+KU0Qy/dhgta1s8bv1ZfFg38KunrwTdgMaOxNk8ThUD/tXUl3Xp05/MXB8Sak4kMpO kIzhZMVMc3jnTvCF9n8lWbHnEtRgZwQMkPVc/iUcu+xfouov/z2r0pTS8jt5LGGbgbNS kRNg== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20221208; t=1683699090; x=1686291090; h=content-transfer-encoding:mime-version:message-id:date:subject:cc :to:from:x-gm-message-state:from:to:cc:subject:date:message-id :reply-to; bh=EveqtihCJt7fcxXdeINag7+zgOnp1O/guDL1F4v1dKU=; b=RUu/JE31yRRZAw5i7XmfRMGTSCrlUnA4DNyqQEN5eguel96Kk+ZbhtXbgpoaSbs9Op LTL3T6jnegtUTM4qrl6xFriDhdZGmyYBoOr7S2enMX3ZsWuqjpyarUTxqm4VByaVRiM0 JA6+cql4GUqkoxW3c0bHuTolDIJNHtwv3HGkfxRxYKtAzRi8jvB3CtInEXbEjJIX2ry8 ipCf8PEkiJCxVeIG91/vVuS6wWaNaB/74LhxXd5mbhL9S93e08mKXVbxssE0+6ZhGi00 tD/P1jp5QS/r54d1jipYhLCIIIc2AHisbkpgMLmUhSb708YIDdNhiUhn95KNwyQPZPCK CkZQ== X-Gm-Message-State: AC+VfDzNpo6PxaPDA7WMuZVB8kOGdlZIRZYTZQKJWVGxpSt8qNOzz8Vd drnGwOpnYvPePA7Rebok4n+xpw== X-Google-Smtp-Source: ACHHUZ5QSywcpJ5O3jaJ11tCgkSKwr+Gndk6lCkOLy5F76/5CkfUopM2LHjM1ujS2nKfM2hXonYGpw== X-Received: by 2002:a17:902:ce8d:b0:1ac:2c8b:a0da with SMTP id f13-20020a170902ce8d00b001ac2c8ba0damr21092890plg.51.1683699090367; Tue, 09 May 2023 23:11:30 -0700 (PDT) Received: from GL4FX4PXWL.bytedance.net ([139.177.225.232]) by smtp.gmail.com with ESMTPSA id j2-20020a170902da8200b001ab19724f64sm2814159plx.38.2023.05.09.23.11.26 (version=TLS1_3 cipher=TLS_CHACHA20_POLY1305_SHA256 bits=256/256); Tue, 09 May 2023 23:11:30 -0700 (PDT) From: Peng Zhang To: Liam.Howlett@oracle.com Cc: akpm@linux-foundation.org, linux-mm@kvack.org, linux-kernel@vger.kernel.org, maple-tree@lists.infradead.org, Peng Zhang Subject: [PATCH 1/2] maple_tree: Drop the test code for mtree_alloc_{range,rrange}() Date: Wed, 10 May 2023 14:10:48 +0800 Message-Id: <20230510061049.53977-1-zhangpeng.00@bytedance.com> X-Mailer: git-send-email 2.37.0 (Apple Git-136) MIME-Version: 1.0 X-Stat-Signature: qkdua7qjiafk9j1afmpw81yho39w6qhu X-Rspam-User: X-Rspamd-Queue-Id: 0322818000F X-Rspamd-Server: rspam07 X-HE-Tag: 1683699091-642624 X-HE-Meta: U2FsdGVkX1+kc/z/h7vlnX6+NB2esiap3x338g0FPDVNjP3NrxEpW1cXR4LV5fVzIdnO54bYeIpSd3lnsXmM66nmybV/p5g9/zikbo0dSIB5DGQq/ofB/dIopu+hDn6sfgh1VZ4e6iuMWxaSDSfDy2AjTe6N8Ce28cz6CxM5KjECXK7l8zezLh0eSCNOzEv5jKc7tqqhpAsVZZCBiD1XyKvFZUczEJ/twxM/nenwfPmdubioYZFOy4Vu13ppiEt72bDZpTGzDH0Qj3F59Gw2PRj/i+3WEogDb/+N0TVyOFk4cftR8Gsfo/5DEOHNxK9BEboABcd9DvAWc3Y2jTr2O9ZUEn59O7Xc3uK/6OE8qVDXoyMj2XogC7kVZUt6LkoDQQNH2dAxQZ+hRhyTIEynHlYtcpi9LRRUe8t1m4RPEzqE0D9a/EmQ5rwtUFIXtKJJk/FsCPtZvTlBEdtGyw00RjF+WQ3N/yEjVV64TiVV3mhzzoK2r0uKJl2qPMompx/99bpn4CUi30RLv+/NxzYmtiRx6dlqQWAq705t34LrPrF3kysNch65FXQ5f/Vp310BQaLEQYxYWyOC9gdqQ09lDSqqTRX8EEpS6FEjHU9uvMogvUwZ3acpnPo9jQouteaqYyX+XoPTTKyDzwFUr3xE2ovm6FUw0mUZLKSLlrAsjUvP+aesOiiADWQMUTDC0x2KKieQI+Sj8vSwXLGow/awc3VnDoOCsKA08BKCW5W+Rwk48S+ALNjA2uL4AyPubBarFw+Fm/7sSNYAvcW4xDkF3Hmt/2L1rq/8gVU3VGS64A5+F3+qNvG8uQ3jc0NdSITDv0L/ndk9jhhQcZ8FPAv9vgaWOCQ5w3+kxbkOl4Bu3UrscMBwLX/UKS4Tjd3AwNUdhC3fRexTjIgGWqFB0JwH9V1Tnidvqo/W/DRVCV+7ObZ1DWRU0SNG4SRL2ri3L0cnGDg8SvN9g6DCb72P7+Z xn23fcKF 26E42smxepJco+IHsP5uYyBmMW75EKSxiKxaBc7Q5r+FbOGLYUME8YTmdz6G3CEJKt/sVZNr/tBQNWpTcbmytLKheYByb4TsvKNzs0sCcGvo/unYAuPGH5Lq+ugJ5fXjzuEkq3OYwPOh1hjhkx6eFqVzlZPD9yIkRONDOaWODSF9JkgWPUcGOIXjl6S1cVKVJpdzs3ldKPGu4lu6AuTaOUEHNcLXueNc/ZgJKAFVsJIfE4d0Q660lge1RkVTn6iH+1mNqwSfM0ZMxsETgErLx8MJy74OoNILAyGJSTsT34bwgqtOTP7HAErijFvqHPlaOjnqYQS1TvJ3p0N3eW4PspKi7aoEfOnbBtlL5wT6tJXPd98fsGW4rV0sUnon78+8LjyCL6OD4E5tHTlcwEt9PajYhFSG66GUQzYsEW0J4M0kNn5qVQ7p6HvGKQZ2tFBd4cSW0rAgdWTnqqHI= X-Bogosity: Ham, tests=bogofilter, spamicity=0.000000, version=1.2.4 Sender: owner-linux-mm@kvack.org Precedence: bulk X-Loop: owner-majordomo@kvack.org List-ID: Drop the test code for mtree_alloc_{range,rrange}() because we are going to drop them. Signed-off-by: Peng Zhang --- lib/test_maple_tree.c | 389 ------------------------------------------ 1 file changed, 389 deletions(-) diff --git a/lib/test_maple_tree.c b/lib/test_maple_tree.c index 9939be34e516e..86d7f742d243e 100644 --- a/lib/test_maple_tree.c +++ b/lib/test_maple_tree.c @@ -97,42 +97,6 @@ static void __init *mtree_test_erase(struct maple_tree *mt, unsigned long index) return mtree_erase(mt, index); } -#if defined(CONFIG_64BIT) -static noinline void __init check_mtree_alloc_range(struct maple_tree *mt, - unsigned long start, unsigned long end, unsigned long size, - unsigned long expected, int eret, void *ptr) -{ - - unsigned long result = expected + 1; - int ret; - - ret = mtree_alloc_range(mt, &result, ptr, size, start, end, - GFP_KERNEL); - MT_BUG_ON(mt, ret != eret); - if (ret) - return; - - MT_BUG_ON(mt, result != expected); -} - -static noinline void __init check_mtree_alloc_rrange(struct maple_tree *mt, - unsigned long start, unsigned long end, unsigned long size, - unsigned long expected, int eret, void *ptr) -{ - - unsigned long result = expected + 1; - int ret; - - ret = mtree_alloc_rrange(mt, &result, ptr, size, start, end, - GFP_KERNEL); - MT_BUG_ON(mt, ret != eret); - if (ret) - return; - - MT_BUG_ON(mt, result != expected); -} -#endif - static noinline void __init check_load(struct maple_tree *mt, unsigned long index, void *ptr) { @@ -635,348 +599,6 @@ static noinline void __init check_find_2(struct maple_tree *mt) /*MT_BUG_ON(mt, !mtree_empty(mt)); */ } - -#if defined(CONFIG_64BIT) -static noinline void __init check_alloc_rev_range(struct maple_tree *mt) -{ - /* - * Generated by: - * cat /proc/self/maps | awk '{print $1}'| - * awk -F "-" '{printf "0x%s, 0x%s, ", $1, $2}' - */ - - static const unsigned long range[] = { - /* Inclusive , Exclusive. */ - 0x565234af2000, 0x565234af4000, - 0x565234af4000, 0x565234af9000, - 0x565234af9000, 0x565234afb000, - 0x565234afc000, 0x565234afd000, - 0x565234afd000, 0x565234afe000, - 0x565235def000, 0x565235e10000, - 0x7f36d4bfd000, 0x7f36d4ee2000, - 0x7f36d4ee2000, 0x7f36d4f04000, - 0x7f36d4f04000, 0x7f36d504c000, - 0x7f36d504c000, 0x7f36d5098000, - 0x7f36d5098000, 0x7f36d5099000, - 0x7f36d5099000, 0x7f36d509d000, - 0x7f36d509d000, 0x7f36d509f000, - 0x7f36d509f000, 0x7f36d50a5000, - 0x7f36d50b9000, 0x7f36d50db000, - 0x7f36d50db000, 0x7f36d50dc000, - 0x7f36d50dc000, 0x7f36d50fa000, - 0x7f36d50fa000, 0x7f36d5102000, - 0x7f36d5102000, 0x7f36d5103000, - 0x7f36d5103000, 0x7f36d5104000, - 0x7f36d5104000, 0x7f36d5105000, - 0x7fff5876b000, 0x7fff5878d000, - 0x7fff5878e000, 0x7fff58791000, - 0x7fff58791000, 0x7fff58793000, - }; - - static const unsigned long holes[] = { - /* - * Note: start of hole is INCLUSIVE - * end of hole is EXCLUSIVE - * (opposite of the above table.) - * Start of hole, end of hole, size of hole (+1) - */ - 0x565234afb000, 0x565234afc000, 0x1000, - 0x565234afe000, 0x565235def000, 0x12F1000, - 0x565235e10000, 0x7f36d4bfd000, 0x28E49EDED000, - }; - - /* - * req_range consists of 4 values. - * 1. min index - * 2. max index - * 3. size - * 4. number that should be returned. - * 5. return value - */ - static const unsigned long req_range[] = { - 0x565234af9000, /* Min */ - 0x7fff58791000, /* Max */ - 0x1000, /* Size */ - 0x7fff5878d << 12, /* First rev hole of size 0x1000 */ - 0, /* Return value success. */ - - 0x0, /* Min */ - 0x565234AF0 << 12, /* Max */ - 0x3000, /* Size */ - 0x565234AEE << 12, /* max - 3. */ - 0, /* Return value success. */ - - 0x0, /* Min */ - -1, /* Max */ - 0x1000, /* Size */ - 562949953421311 << 12,/* First rev hole of size 0x1000 */ - 0, /* Return value success. */ - - 0x0, /* Min */ - 0x7F36D5109 << 12, /* Max */ - 0x4000, /* Size */ - 0x7F36D5106 << 12, /* First rev hole of size 0x4000 */ - 0, /* Return value success. */ - - /* Ascend test. */ - 0x0, - 34148798628 << 12, - 19 << 12, - 34148797418 << 12, - 0x0, - - /* Too big test. */ - 0x0, - 18446744073709551615UL, - 562915594369134UL << 12, - 0x0, - -EBUSY, - - /* Single space test. */ - 34148798725 << 12, - 34148798725 << 12, - 1 << 12, - 34148798725 << 12, - 0, - }; - - int i, range_count = ARRAY_SIZE(range); - int req_range_count = ARRAY_SIZE(req_range); - unsigned long min = 0; - - MA_STATE(mas, mt, 0, 0); - - mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY, - GFP_KERNEL); -#define DEBUG_REV_RANGE 0 - for (i = 0; i < range_count; i += 2) { - /* Inclusive, Inclusive (with the -1) */ - -#if DEBUG_REV_RANGE - pr_debug("\t%s: Insert %lu-%lu\n", __func__, range[i] >> 12, - (range[i + 1] >> 12) - 1); -#endif - check_insert_range(mt, range[i] >> 12, (range[i + 1] >> 12) - 1, - xa_mk_value(range[i] >> 12), 0); - mt_validate(mt); - } - - - mas_lock(&mas); - for (i = 0; i < ARRAY_SIZE(holes); i += 3) { -#if DEBUG_REV_RANGE - pr_debug("Search from %lu-%lu for gap %lu should be at %lu\n", - min, holes[i+1]>>12, holes[i+2]>>12, - holes[i] >> 12); -#endif - MT_BUG_ON(mt, mas_empty_area_rev(&mas, min, - holes[i+1] >> 12, - holes[i+2] >> 12)); -#if DEBUG_REV_RANGE - pr_debug("Found %lu %lu\n", mas.index, mas.last); - pr_debug("gap %lu %lu\n", (holes[i] >> 12), - (holes[i+1] >> 12)); -#endif - MT_BUG_ON(mt, mas.last + 1 != (holes[i+1] >> 12)); - MT_BUG_ON(mt, mas.index != (holes[i+1] >> 12) - (holes[i+2] >> 12)); - min = holes[i+1] >> 12; - mas_reset(&mas); - } - - mas_unlock(&mas); - for (i = 0; i < req_range_count; i += 5) { -#if DEBUG_REV_RANGE - pr_debug("\tReverse request %d between %lu-%lu size %lu, should get %lu\n", - i, req_range[i] >> 12, - (req_range[i + 1] >> 12), - req_range[i+2] >> 12, - req_range[i+3] >> 12); -#endif - check_mtree_alloc_rrange(mt, - req_range[i] >> 12, /* start */ - req_range[i+1] >> 12, /* end */ - req_range[i+2] >> 12, /* size */ - req_range[i+3] >> 12, /* expected address */ - req_range[i+4], /* expected return */ - xa_mk_value(req_range[i] >> 12)); /* pointer */ - mt_validate(mt); - } - - mt_set_non_kernel(1); - mtree_erase(mt, 34148798727); /* create a deleted range. */ - mtree_erase(mt, 34148798725); - check_mtree_alloc_rrange(mt, 0, 34359052173, 210253414, - 34148798725, 0, mt); - - mtree_destroy(mt); -} - -static noinline void __init check_alloc_range(struct maple_tree *mt) -{ - /* - * Generated by: - * cat /proc/self/maps|awk '{print $1}'| - * awk -F "-" '{printf "0x%s, 0x%s, ", $1, $2}' - */ - - static const unsigned long range[] = { - /* Inclusive , Exclusive. */ - 0x565234af2000, 0x565234af4000, - 0x565234af4000, 0x565234af9000, - 0x565234af9000, 0x565234afb000, - 0x565234afc000, 0x565234afd000, - 0x565234afd000, 0x565234afe000, - 0x565235def000, 0x565235e10000, - 0x7f36d4bfd000, 0x7f36d4ee2000, - 0x7f36d4ee2000, 0x7f36d4f04000, - 0x7f36d4f04000, 0x7f36d504c000, - 0x7f36d504c000, 0x7f36d5098000, - 0x7f36d5098000, 0x7f36d5099000, - 0x7f36d5099000, 0x7f36d509d000, - 0x7f36d509d000, 0x7f36d509f000, - 0x7f36d509f000, 0x7f36d50a5000, - 0x7f36d50b9000, 0x7f36d50db000, - 0x7f36d50db000, 0x7f36d50dc000, - 0x7f36d50dc000, 0x7f36d50fa000, - 0x7f36d50fa000, 0x7f36d5102000, - 0x7f36d5102000, 0x7f36d5103000, - 0x7f36d5103000, 0x7f36d5104000, - 0x7f36d5104000, 0x7f36d5105000, - 0x7fff5876b000, 0x7fff5878d000, - 0x7fff5878e000, 0x7fff58791000, - 0x7fff58791000, 0x7fff58793000, - }; - static const unsigned long holes[] = { - /* Start of hole, end of hole, size of hole (+1) */ - 0x565234afb000, 0x565234afc000, 0x1000, - 0x565234afe000, 0x565235def000, 0x12F1000, - 0x565235e10000, 0x7f36d4bfd000, 0x28E49EDED000, - }; - - /* - * req_range consists of 4 values. - * 1. min index - * 2. max index - * 3. size - * 4. number that should be returned. - * 5. return value - */ - static const unsigned long req_range[] = { - 0x565234af9000, /* Min */ - 0x7fff58791000, /* Max */ - 0x1000, /* Size */ - 0x565234afb000, /* First hole in our data of size 1000. */ - 0, /* Return value success. */ - - 0x0, /* Min */ - 0x7fff58791000, /* Max */ - 0x1F00, /* Size */ - 0x0, /* First hole in our data of size 2000. */ - 0, /* Return value success. */ - - /* Test ascend. */ - 34148797436 << 12, /* Min */ - 0x7fff587AF000, /* Max */ - 0x3000, /* Size */ - 34148798629 << 12, /* Expected location */ - 0, /* Return value success. */ - - /* Test failing. */ - 34148798623 << 12, /* Min */ - 34148798683 << 12, /* Max */ - 0x15000, /* Size */ - 0, /* Expected location */ - -EBUSY, /* Return value failed. */ - - /* Test filling entire gap. */ - 34148798623 << 12, /* Min */ - 0x7fff587AF000, /* Max */ - 0x10000, /* Size */ - 34148798632 << 12, /* Expected location */ - 0, /* Return value success. */ - - /* Test walking off the end of root. */ - 0, /* Min */ - -1, /* Max */ - -1, /* Size */ - 0, /* Expected location */ - -EBUSY, /* Return value failure. */ - - /* Test looking for too large a hole across entire range. */ - 0, /* Min */ - -1, /* Max */ - 4503599618982063UL << 12, /* Size */ - 34359052178 << 12, /* Expected location */ - -EBUSY, /* Return failure. */ - - /* Test a single entry */ - 34148798648 << 12, /* Min */ - 34148798648 << 12, /* Max */ - 4096, /* Size of 1 */ - 34148798648 << 12, /* Location is the same as min/max */ - 0, /* Success */ - }; - int i, range_count = ARRAY_SIZE(range); - int req_range_count = ARRAY_SIZE(req_range); - unsigned long min = 0x565234af2000; - MA_STATE(mas, mt, 0, 0); - - mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY, - GFP_KERNEL); - for (i = 0; i < range_count; i += 2) { -#define DEBUG_ALLOC_RANGE 0 -#if DEBUG_ALLOC_RANGE - pr_debug("\tInsert %lu-%lu\n", range[i] >> 12, - (range[i + 1] >> 12) - 1); - mt_dump(mt, mt_dump_hex); -#endif - check_insert_range(mt, range[i] >> 12, (range[i + 1] >> 12) - 1, - xa_mk_value(range[i] >> 12), 0); - mt_validate(mt); - } - - - - mas_lock(&mas); - for (i = 0; i < ARRAY_SIZE(holes); i += 3) { - -#if DEBUG_ALLOC_RANGE - pr_debug("\tGet empty %lu-%lu size %lu (%lx-%lx)\n", min >> 12, - holes[i+1] >> 12, holes[i+2] >> 12, - min, holes[i+1]); -#endif - MT_BUG_ON(mt, mas_empty_area(&mas, min >> 12, - holes[i+1] >> 12, - holes[i+2] >> 12)); - MT_BUG_ON(mt, mas.index != holes[i] >> 12); - min = holes[i+1]; - mas_reset(&mas); - } - mas_unlock(&mas); - for (i = 0; i < req_range_count; i += 5) { -#if DEBUG_ALLOC_RANGE - pr_debug("\tTest %d: %lu-%lu size %lu expected %lu (%lu-%lu)\n", - i/5, req_range[i] >> 12, req_range[i + 1] >> 12, - req_range[i + 2] >> 12, req_range[i + 3] >> 12, - req_range[i], req_range[i+1]); -#endif - check_mtree_alloc_range(mt, - req_range[i] >> 12, /* start */ - req_range[i+1] >> 12, /* end */ - req_range[i+2] >> 12, /* size */ - req_range[i+3] >> 12, /* expected address */ - req_range[i+4], /* expected return */ - xa_mk_value(req_range[i] >> 12)); /* pointer */ - mt_validate(mt); -#if DEBUG_ALLOC_RANGE - mt_dump(mt, mt_dump_hex); -#endif - } - - mtree_destroy(mt); -} -#endif - static noinline void __init check_ranges(struct maple_tree *mt) { int i, val, val2; @@ -3448,17 +3070,6 @@ static int __init maple_tree_seed(void) check_ranges(&tree); mtree_destroy(&tree); -#if defined(CONFIG_64BIT) - /* These tests have ranges outside of 4GB */ - mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); - check_alloc_range(&tree); - mtree_destroy(&tree); - - mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); - check_alloc_rev_range(&tree); - mtree_destroy(&tree); -#endif - mt_init_flags(&tree, 0); check_load(&tree, set[0], NULL); /* See if 5015 -> NULL */ From patchwork Wed May 10 06:10:49 2023 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Peng Zhang X-Patchwork-Id: 13236479 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.4.0 (2014-02-07) on aws-us-west-2-korg-lkml-1.web.codeaurora.org Received: from kanga.kvack.org (kanga.kvack.org [205.233.56.17]) by smtp.lore.kernel.org (Postfix) with ESMTP id EFF41C7EE24 for ; Wed, 10 May 2023 06:11:37 +0000 (UTC) Received: by kanga.kvack.org (Postfix) id 8CE2F6B0072; Wed, 10 May 2023 02:11:37 -0400 (EDT) Received: by kanga.kvack.org (Postfix, from userid 40) id 87E806B0074; Wed, 10 May 2023 02:11:37 -0400 (EDT) X-Delivered-To: int-list-linux-mm@kvack.org Received: by kanga.kvack.org (Postfix, from userid 63042) id 76DAE6B0075; Wed, 10 May 2023 02:11:37 -0400 (EDT) X-Delivered-To: linux-mm@kvack.org Received: from relay.hostedemail.com (smtprelay0017.hostedemail.com [216.40.44.17]) by kanga.kvack.org (Postfix) with ESMTP id 69EEC6B0072 for ; Wed, 10 May 2023 02:11:37 -0400 (EDT) Received: from smtpin03.hostedemail.com (a10.router.float.18 [10.200.18.1]) by unirelay02.hostedemail.com (Postfix) with ESMTP id 43C35120582 for ; Wed, 10 May 2023 06:11:37 +0000 (UTC) X-FDA: 80773323834.03.4B51DFA Received: from mail-pl1-f172.google.com (mail-pl1-f172.google.com [209.85.214.172]) by imf21.hostedemail.com (Postfix) with ESMTP id 669C01C0007 for ; Wed, 10 May 2023 06:11:35 +0000 (UTC) Authentication-Results: imf21.hostedemail.com; dkim=pass header.d=bytedance.com header.s=google header.b=fcgifp2z; spf=pass (imf21.hostedemail.com: domain of zhangpeng.00@bytedance.com designates 209.85.214.172 as permitted sender) smtp.mailfrom=zhangpeng.00@bytedance.com; dmarc=pass (policy=quarantine) header.from=bytedance.com ARC-Seal: i=1; s=arc-20220608; d=hostedemail.com; t=1683699095; a=rsa-sha256; cv=none; b=TE9CWUJNlNhuQXPSPZKBC2A0xT2Tp4xGn0bSGxycR5cbnUuHyLkCUKNJoXFG7AWKUyP85A /OnJBVSvbYv+jFhq4Lc8ifnC9pQOt/JtK+HhCz1S2lfFWXwpshZ4DCSkeRr1J8CPFa4+pX 3S6/sMOwFFvMczbtgW0Kc5dN4JThBEs= ARC-Authentication-Results: i=1; imf21.hostedemail.com; dkim=pass header.d=bytedance.com header.s=google header.b=fcgifp2z; spf=pass (imf21.hostedemail.com: domain of zhangpeng.00@bytedance.com designates 209.85.214.172 as permitted sender) smtp.mailfrom=zhangpeng.00@bytedance.com; dmarc=pass (policy=quarantine) header.from=bytedance.com ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=hostedemail.com; s=arc-20220608; t=1683699095; h=from:from:sender:reply-to:subject:subject:date:date: message-id:message-id:to:to:cc:cc:mime-version:mime-version: content-type:content-transfer-encoding:content-transfer-encoding: in-reply-to:in-reply-to:references:references:dkim-signature; bh=Vx0UmPiglxMBycN8p78aITZtdcFTRru0fYxYXq+j1cE=; b=wmhqJdPx7ZszEjhO/s+whkhtg7BEEBRohPOyA0OEpQaBpIBylrzyloUcdrgKSYVwsninS7 aI/qQ/GRhZZ4RirNXVnXv3PlPJWHykzAdraeFanlychDoF1wbMDWc8VCuVOKwBiQx5UHuK CQ/VOHCby38Ws+uyCLzFmmesvjikM9s= Received: by mail-pl1-f172.google.com with SMTP id d9443c01a7336-1aaf706768cso52272785ad.0 for ; Tue, 09 May 2023 23:11:34 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=bytedance.com; s=google; t=1683699094; x=1686291094; h=content-transfer-encoding:mime-version:references:in-reply-to :message-id:date:subject:cc:to:from:from:to:cc:subject:date :message-id:reply-to; bh=Vx0UmPiglxMBycN8p78aITZtdcFTRru0fYxYXq+j1cE=; b=fcgifp2zw/Gegdr5FvAbRDbAp0tmxTchx+/eA/Wy9E8eRmA/NBtx58jxefDu9Ya5TH F3O5wY3AtCcG6R7i5nNQ+/bW6nGu76pxmEnV46lTl3q/EWYSCHSEIZTExV5yqZTt3rh1 QLqUQ7obM00S5II8+1gmjinCGePCq3juH60BWi26ECtAuQ3UweDnmbBn83dY1SWSuTDF Qnf7ptsn0rM75J80a+52lmH2yskaNlhY292ccYIx4lmSmU27s5g6lwKYbxKBey+Xq9/y dRZjDTAe/1itAX7BhqCvuiV6EWBL3MIXjZKxNbww9qxkqrCgUtjKOFev+PZEtHmm/35I +3FA== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20221208; t=1683699094; x=1686291094; h=content-transfer-encoding:mime-version:references:in-reply-to :message-id:date:subject:cc:to:from:x-gm-message-state:from:to:cc :subject:date:message-id:reply-to; bh=Vx0UmPiglxMBycN8p78aITZtdcFTRru0fYxYXq+j1cE=; b=fX5dPl3GCkzlFngVM2m2z9GMt6z6pB0qC4e0PaOAUFnRI3flKX0xxbLMpA/Aj3zVbM lHY2KZqcJXa+b4oMQrQ9q+Z1v0z0pZzHIQKwNduMxSZTEQQ9y2XHi3waK3pdx8iUXsbC S2i6klvKCH2itdiH9dbnZD1qrf1kFSjGM9Zosku/3Wjhbasrd84BJIWCQpUqd83HC6Ij lkvraM3ltbpqD1XcOuqIgPkAD++xzl5wueDNucZ+tTKIjsb+1rsoeKD0lgCAkazK9079 D5jwOggolse/D07qoAVTfo+891j07Yu9v7XZM1S76YuDtXVB5w1i872ekofIW9f+Be8m QyDg== X-Gm-Message-State: AC+VfDyKIuZD0GtVwc4t0AhBNMP0HY3gVaEXDQE2YelMDADN4IbP9Jda 6X9+93nl6TrezeHbxVByG40kNQX7OkoBi+WfpMA= X-Google-Smtp-Source: ACHHUZ5iVcElk2cXd3OtYV7Z3xTYwHOT3YAAuCTv7qM94caK3lAekZCLwZlAEKUBgPsPx0AN1CQZKQ== X-Received: by 2002:a17:902:f683:b0:1ac:8148:8c40 with SMTP id l3-20020a170902f68300b001ac81488c40mr11127867plg.53.1683699094081; Tue, 09 May 2023 23:11:34 -0700 (PDT) Received: from GL4FX4PXWL.bytedance.net ([139.177.225.232]) by smtp.gmail.com with ESMTPSA id j2-20020a170902da8200b001ab19724f64sm2814159plx.38.2023.05.09.23.11.31 (version=TLS1_3 cipher=TLS_CHACHA20_POLY1305_SHA256 bits=256/256); Tue, 09 May 2023 23:11:33 -0700 (PDT) From: Peng Zhang To: Liam.Howlett@oracle.com Cc: akpm@linux-foundation.org, linux-mm@kvack.org, linux-kernel@vger.kernel.org, maple-tree@lists.infradead.org, Peng Zhang Subject: [PATCH 2/2] maple_tree: Drop mtree_alloc_{range,rrange}() and related functions. Date: Wed, 10 May 2023 14:10:49 +0800 Message-Id: <20230510061049.53977-2-zhangpeng.00@bytedance.com> X-Mailer: git-send-email 2.37.0 (Apple Git-136) In-Reply-To: <20230510061049.53977-1-zhangpeng.00@bytedance.com> References: <20230510061049.53977-1-zhangpeng.00@bytedance.com> MIME-Version: 1.0 X-Rspam-User: X-Stat-Signature: zsjyxm1t7if3ycibf8bzmy984bmxcjfw X-Rspamd-Server: rspam08 X-Rspamd-Queue-Id: 669C01C0007 X-HE-Tag: 1683699095-507372 X-HE-Meta: U2FsdGVkX19egp+JVb+tzw3qSmF9li8rpqd7XjgfVvuZBLnzfhjoWytYyZ/lZ9Qizgwy09reDH+0LJujDybUA73d2n+Hq2Si7En7BpBrCRCcYcQQEg4xi6+1DWYYl7FEjmwp18Trq2I6DJlgZO0br6ZTIO98PnSA/vI3qaqoOU/NKDT0dOndFJahr80fIPjp7JMqQLE2kbKuKAyxCvY1NtWnpDbb8v37J9ie/wXV8EVaZXbZcJ3FYN4fFLryyCmW2qQ79uNwWilRINs2aDT6eKJibf8ziSqKXkGEfH3fYef2Sot276/IJ3cy3/9kMvwVRHGCJiyxaYrhrcSk8DzaYwCSwYM+6YMS7zig2ZmQqVjWKRLf6TFWIn/P7hSKL670iytz1KuqeNOU/WnT1GVl6a6iE4Y4kYxewQahayf/78eQzHrPIpu0qgqmjgDf4JYjKO5MbR4a0GZFDDVWWGbXeFKTuU76EYnUcpGaH6Upl0RetRkPtmtKSXarXuYIiGp5eWi2urLB4a7k8ymIG5YodgbNP7CyBPfE/18oiPeSfq6WjRewKlFIgxX2R6/nqxnnM9Urow1zIP+deBFcPzkfBAcR7+zTpo+2Fz1x5rnhq1e0Hp2jhjop5VZEtXlGV/0XzyOiTmCijS+9/5HOIHBo5K0prOVKIxVA4ghBHHbnBmAwbEJsRsz++X0IRzradnr1n3HOe/liHmLDiCJ21VjtkWCeX4qu/TXhJrAS/jtRLm3RkCtrTTx5c+8+ZLbSpmjXpWqwRnCNX6McUKOnNNYYp3c2sjHamAH+DIueuIt/srO2a8G93cG2T8oZU3mGBb4sIArpSD1poJR0t1USyT0Hjt1oGgu+27yY/VKNvd2GO8clkrZS+/uyeo9Z352F+/ZdHAaDwQAC/cHMPHuFbz/0OFWNcO3+53EchT3S59szezSbb+soFpYz9XHu3lEs344TILBinGDTEsmP/ypLxh2 6VkYHES2 P1WYq0NdAwkHsuPAh0+GfPeEMFwBRzytF7pFC1ILMh7tzLytVgBPc5pAaGR4ORgXoqO64Hl1lJA9LirzSOVSrv6uAmVBjjq6hQ+V2DpoeTGta5A7ucOSlwfVGIBJvnECndgY9kx65rqgtWbXobMvr9bdxHfAsEH6uJeQKcH8TxCUk2WAExELAyaHP0W34EVMLmp+G7VS1pf+xTfQIOLrLYd62+oB9Xz8PGupODxif3x8wxEkgG5OD3+0udoc1BuiwzXDgKq2LizipDroUTP+4841hyyJ7/e4z5I11PurmP5Noo9m9BrvqgAfwlKQH7n9p/m21LjOD1qAnqpbD1hnDzBmTgzsawTflQJpdCEJEXTnvTE9MfDcfqkw8aex5pEdYVD35PRsbPBYhIf6w2FGrdXDacUg3iA+K+IXj8e9GqijV0qqugnRtDFNSvhZwhU0cYpN1O6olHX4e+is= X-Bogosity: Ham, tests=bogofilter, spamicity=0.000000, version=1.2.4 Sender: owner-linux-mm@kvack.org Precedence: bulk X-Loop: owner-majordomo@kvack.org List-ID: Drop mtree_alloc_{range,rrange}(), mas_alloc() and mas_fill_gap(). mtree_alloc_{range,rrange}() currently have no users and can be easily implemented with mas_empty_area{_rev}(). mas_alloc() and mas_fill_gap() are just their internal functions, drop them together. Signed-off-by: Peng Zhang --- include/linux/maple_tree.h | 7 -- lib/maple_tree.c | 177 ------------------------------------- 2 files changed, 184 deletions(-) diff --git a/include/linux/maple_tree.h b/include/linux/maple_tree.h index 542b09118a09f..3dd6edccf83af 100644 --- a/include/linux/maple_tree.h +++ b/include/linux/maple_tree.h @@ -306,13 +306,6 @@ int mtree_insert(struct maple_tree *mt, unsigned long index, void *entry, gfp_t gfp); int mtree_insert_range(struct maple_tree *mt, unsigned long first, unsigned long last, void *entry, gfp_t gfp); -int mtree_alloc_range(struct maple_tree *mt, unsigned long *startp, - void *entry, unsigned long size, unsigned long min, - unsigned long max, gfp_t gfp); -int mtree_alloc_rrange(struct maple_tree *mt, unsigned long *startp, - void *entry, unsigned long size, unsigned long min, - unsigned long max, gfp_t gfp); - int mtree_store_range(struct maple_tree *mt, unsigned long first, unsigned long last, void *entry, gfp_t gfp); int mtree_store(struct maple_tree *mt, unsigned long index, diff --git a/lib/maple_tree.c b/lib/maple_tree.c index b37065a6f570d..49dfe81dfa1b6 100644 --- a/lib/maple_tree.c +++ b/lib/maple_tree.c @@ -5120,46 +5120,6 @@ static inline void mas_awalk(struct ma_state *mas, unsigned long size) } } -/* - * mas_fill_gap() - Fill a located gap with @entry. - * @mas: The maple state - * @entry: The value to store - * @slot: The offset into the node to store the @entry - * @size: The size of the entry - * @index: The start location - */ -static inline void mas_fill_gap(struct ma_state *mas, void *entry, - unsigned char slot, unsigned long size, unsigned long *index) -{ - MA_WR_STATE(wr_mas, mas, entry); - unsigned char pslot = mte_parent_slot(mas->node); - struct maple_enode *mn = mas->node; - unsigned long *pivots; - enum maple_type ptype; - /* - * mas->index is the start address for the search - * which may no longer be needed. - * mas->last is the end address for the search - */ - - *index = mas->index; - mas->last = mas->index + size - 1; - - /* - * It is possible that using mas->max and mas->min to correctly - * calculate the index and last will cause an issue in the gap - * calculation, so fix the ma_state here - */ - mas_ascend(mas); - ptype = mte_node_type(mas->node); - pivots = ma_pivots(mas_mn(mas), ptype); - mas->max = mas_safe_pivot(mas, pivots, pslot, ptype); - mas->min = mas_safe_min(mas, pivots, pslot); - mas->node = mn; - mas->offset = slot; - mas_wr_store_entry(&wr_mas); -} - /* * mas_sparse_area() - Internal function. Return upper or lower limit when * searching for a gap in an empty tree. @@ -5307,74 +5267,6 @@ int mas_empty_area_rev(struct ma_state *mas, unsigned long min, } EXPORT_SYMBOL_GPL(mas_empty_area_rev); -static inline int mas_alloc(struct ma_state *mas, void *entry, - unsigned long size, unsigned long *index) -{ - unsigned long min; - - mas_start(mas); - if (mas_is_none(mas) || mas_is_ptr(mas)) { - mas_root_expand(mas, entry); - if (mas_is_err(mas)) - return xa_err(mas->node); - - if (!mas->index) - return mas_pivot(mas, 0); - return mas_pivot(mas, 1); - } - - /* Must be walking a tree. */ - mas_awalk(mas, size); - if (mas_is_err(mas)) - return xa_err(mas->node); - - if (mas->offset == MAPLE_NODE_SLOTS) - goto no_gap; - - /* - * At this point, mas->node points to the right node and we have an - * offset that has a sufficient gap. - */ - min = mas->min; - if (mas->offset) - min = mas_pivot(mas, mas->offset - 1) + 1; - - if (mas_is_err(mas)) - return xa_err(mas->node); - - if (mas->index < min) - mas->index = min; - - mas_fill_gap(mas, entry, mas->offset, size, index); - return 0; - -no_gap: - return -EBUSY; -} - -static inline int mas_rev_alloc(struct ma_state *mas, unsigned long min, - unsigned long max, void *entry, - unsigned long size, unsigned long *index) -{ - int ret = 0; - - ret = mas_empty_area_rev(mas, min, max, size); - if (ret) - return ret; - - if (mas_is_err(mas)) - return xa_err(mas->node); - - if (mas->offset == MAPLE_NODE_SLOTS) - goto no_gap; - - mas_fill_gap(mas, entry, mas->offset, size, index); - return 0; - -no_gap: - return -EBUSY; -} - /* * mte_dead_leaves() - Mark all leaves of a node as dead. * @mas: The maple state @@ -6481,75 +6373,6 @@ int mtree_insert(struct maple_tree *mt, unsigned long index, void *entry, } EXPORT_SYMBOL(mtree_insert); -int mtree_alloc_range(struct maple_tree *mt, unsigned long *startp, - void *entry, unsigned long size, unsigned long min, - unsigned long max, gfp_t gfp) -{ - int ret = 0; - - MA_STATE(mas, mt, min, min); - if (!mt_is_alloc(mt)) - return -EINVAL; - - if (WARN_ON_ONCE(mt_is_reserved(entry))) - return -EINVAL; - - if (min > max) - return -EINVAL; - - if (max < size) - return -EINVAL; - - if (!size) - return -EINVAL; - - mtree_lock(mt); -retry: - mas.offset = 0; - mas.index = min; - mas.last = max - size + 1; - ret = mas_alloc(&mas, entry, size, startp); - if (mas_nomem(&mas, gfp)) - goto retry; - - mtree_unlock(mt); - return ret; -} -EXPORT_SYMBOL(mtree_alloc_range); - -int mtree_alloc_rrange(struct maple_tree *mt, unsigned long *startp, - void *entry, unsigned long size, unsigned long min, - unsigned long max, gfp_t gfp) -{ - int ret = 0; - - MA_STATE(mas, mt, min, max - size + 1); - if (!mt_is_alloc(mt)) - return -EINVAL; - - if (WARN_ON_ONCE(mt_is_reserved(entry))) - return -EINVAL; - - if (min > max) - return -EINVAL; - - if (max < size - 1) - return -EINVAL; - - if (!size) - return -EINVAL; - - mtree_lock(mt); -retry: - ret = mas_rev_alloc(&mas, min, max, entry, size, startp); - if (mas_nomem(&mas, gfp)) - goto retry; - - mtree_unlock(mt); - return ret; -} -EXPORT_SYMBOL(mtree_alloc_rrange); - /** * mtree_erase() - Find an index and erase the entire range. * @mt: The maple tree