Received: by 2002:a05:6a10:f347:0:0:0:0 with SMTP id d7csp9585534pxu; Mon, 28 Dec 2020 22:25:05 -0800 (PST) X-Google-Smtp-Source: ABdhPJwhVu1TuVZjuOHqGoWQzgPrT+e1P2IozBf1wOhctSOwqb7R+e4iWKqdA6iscmPsGHaXP9Pq X-Received: by 2002:a05:6402:d08:: with SMTP id eb8mr45811021edb.271.1609223105349; Mon, 28 Dec 2020 22:25:05 -0800 (PST) ARC-Seal: i=1; a=rsa-sha256; t=1609223105; cv=none; d=google.com; s=arc-20160816; b=fIK0292KSPR2hNd10kyG9dC+5e5WCKF/Na6Zk5kOfYBslID+O2EKJ2H5/xVWr2nCVH JmG3/LfqpeX3FG20lWaoZQv6FVUpv9C1YWAxTWxG9d4BHtBe2lFOVchwJth8QpPWcHdS BamTrK1SKrsYelm68ASJX09iEt+f+wsPZionyIRFD1nxnjTEIWqgq0dh8crnORQGjbSW a05pP8uvQZN4NfgfBx7B4m9yOLNHXN/apr/sZeUt71iMb/1j4I6lTTjHrCaQmcMkoybe H1fSEUnjWwg4rSvlDhssoj9Tiy2zl8M+vbDuM7QQrtp36eSeHCIhjeYRsA/pWqkENo19 8zxw== ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=arc-20160816; h=list-id:precedence:mime-version:message-id:date:subject:cc:to:from :dkim-signature; bh=ROVUYILnVzqcz4E3LVoA3VuJn1nyEJeIrPUlHBkrVPs=; b=bDQW7fJnuL8oaDjbcvimRDoDRZ/0HMgtzbupuQEhPDodLh3wRz0gvFqOebS2wvhx1y 1CKhkFc4ZcMU7cJffVrRQ520SDo54UHrTck8QjTo2RVWFnYToIUHM9mVzDVdEpq0U3tN kPsV42ayYjKhJ40BtWX454T4mNlSWRPg3CT2/EE+cdLPown5KW19M51fZzyLc7ybyQ9s CShqlbLGozkZJb65k5NVQP9HrbD5gzn0VWn6GIIf+sziUFwJlJrMk1OoTo4vrBadVsbQ uQKPy2TazGEN/K+aYE8Bp8g1RK+cOTRLEAu9ncQW96H9b1ZyJzQ/VSsyWjBFt6Hlk7jH MulQ== ARC-Authentication-Results: i=1; mx.google.com; dkim=pass header.i=@iluvatar.ai header.s=key_2018 header.b=Rtb1kY4l; spf=pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 23.128.96.18 as permitted sender) smtp.mailfrom=linux-kernel-owner@vger.kernel.org; dmarc=pass (p=QUARANTINE sp=QUARANTINE dis=NONE) header.from=iluvatar.ai Return-Path: Received: from vger.kernel.org (vger.kernel.org. [23.128.96.18]) by mx.google.com with ESMTP id cf6si20382849edb.557.2020.12.28.22.24.43; Mon, 28 Dec 2020 22:25:05 -0800 (PST) Received-SPF: pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 23.128.96.18 as permitted sender) client-ip=23.128.96.18; Authentication-Results: mx.google.com; dkim=pass header.i=@iluvatar.ai header.s=key_2018 header.b=Rtb1kY4l; spf=pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 23.128.96.18 as permitted sender) smtp.mailfrom=linux-kernel-owner@vger.kernel.org; dmarc=pass (p=QUARANTINE sp=QUARANTINE dis=NONE) header.from=iluvatar.ai Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1726190AbgL2GXs (ORCPT + 99 others); Tue, 29 Dec 2020 01:23:48 -0500 Received: from owa.iluvatar.ai ([103.91.158.24]:7948 "EHLO smg.iluvatar.ai" rhost-flags-OK-OK-OK-FAIL) by vger.kernel.org with ESMTP id S1725832AbgL2GXr (ORCPT ); Tue, 29 Dec 2020 01:23:47 -0500 X-Greylist: delayed 947 seconds by postgrey-1.27 at vger.kernel.org; Tue, 29 Dec 2020 01:23:45 EST X-AuditID: 0a650161-e69ff70000001043-aa-5feac78f81d4 Received: from owa.iluvatar.ai (s-10-101-1-102.iluvatar.local [10.101.1.102]) by smg.iluvatar.ai (Symantec Messaging Gateway) with SMTP id 68.D9.04163.F87CAEF5; Tue, 29 Dec 2020 14:07:11 +0800 (HKT) Content-Type: text/plain DKIM-Signature: v=1; a=rsa-sha256; d=iluvatar.ai; s=key_2018; c=relaxed/relaxed; t=1609222031; h=from:subject:to:date:message-id; bh=ROVUYILnVzqcz4E3LVoA3VuJn1nyEJeIrPUlHBkrVPs=; b=Rtb1kY4lGIb+zpfhxUk//d03eCXgOmjB8uOGZtQLaXkijQ12GEs6GBp5pAVqvjJsefhW+kio3gJ xlmsIs9lRtcXH2QwGwURCIZF09izVBRvdlB8Kd8COLfdTOYIs4Oc21AQ9JU+IiZgagIiFMAPrHmTe S19aamotzfvO2nRA4k8= Received: from hsj-Precision-5520.iluvatar.local (10.101.199.252) by S-10-101-1-102.iluvatar.local (10.101.1.102) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256_P256) id 15.1.1415.2; Tue, 29 Dec 2020 14:07:11 +0800 From: Huang Shijie To: CC: , , Huang Shijie Subject: [PATCH] lib/genalloc: fix the overflow when size is too big Date: Tue, 29 Dec 2020 14:06:57 +0800 Message-ID: <20201229060657.3389-1-sjhuang@iluvatar.ai> X-Mailer: git-send-email 2.17.1 MIME-Version: 1.0 X-Originating-IP: [10.101.199.252] X-ClientProxiedBy: S-10-101-1-105.iluvatar.local (10.101.1.105) To S-10-101-1-102.iluvatar.local (10.101.1.102) Precedence: bulk List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Some graphic card has very big memory on chip, such as 32G bytes. In the following case, it will cause overflow: -------------------------------------------- pool = gen_pool_create(PAGE_SHIFT, NUMA_NO_NODE); ret = gen_pool_add(pool, 0x1000000, SZ_32G, NUMA_NO_NODE); va = gen_pool_alloc(pool, SZ_4G); -------------------------------------------- The overflow occurs in gen_pool_alloc_algo_owner(): -------------------------------------------- .... size = nbits << order; .... -------------------------------------------- The @nbits is "int" type, so it will overflow. Then the gen_pool_avail() will return the wrong value. This patch converts some "int" to "unsigned long", and changes the compare code in while. Reported-by: Shi Jiasheng Signed-off-by: Huang Shijie --- lib/genalloc.c | 25 +++++++++++++------------ 1 file changed, 13 insertions(+), 12 deletions(-) diff --git a/lib/genalloc.c b/lib/genalloc.c index 7f1244b5294a..dab97bb69df6 100644 --- a/lib/genalloc.c +++ b/lib/genalloc.c @@ -81,14 +81,14 @@ static int clear_bits_ll(unsigned long *addr, unsigned long mask_to_clear) * users set the same bit, one user will return remain bits, otherwise * return 0. */ -static int bitmap_set_ll(unsigned long *map, int start, int nr) +static int bitmap_set_ll(unsigned long *map, unsigned long start, unsigned long nr) { unsigned long *p = map + BIT_WORD(start); - const int size = start + nr; + const unsigned long size = start + nr; int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start); - while (nr - bits_to_set >= 0) { + while (nr >= bits_to_set) { if (set_bits_ll(p, mask_to_set)) return nr; nr -= bits_to_set; @@ -116,14 +116,15 @@ static int bitmap_set_ll(unsigned long *map, int start, int nr) * users clear the same bit, one user will return remain bits, * otherwise return 0. */ -static int bitmap_clear_ll(unsigned long *map, int start, int nr) +static unsigned long +bitmap_clear_ll(unsigned long *map, unsigned long start, unsigned long nr) { unsigned long *p = map + BIT_WORD(start); - const int size = start + nr; + const unsigned long size = start + nr; int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start); - while (nr - bits_to_clear >= 0) { + while (nr >= bits_to_clear) { if (clear_bits_ll(p, mask_to_clear)) return nr; nr -= bits_to_clear; @@ -183,8 +184,8 @@ int gen_pool_add_owner(struct gen_pool *pool, unsigned long virt, phys_addr_t ph size_t size, int nid, void *owner) { struct gen_pool_chunk *chunk; - int nbits = size >> pool->min_alloc_order; - int nbytes = sizeof(struct gen_pool_chunk) + + unsigned long nbits = size >> pool->min_alloc_order; + unsigned long nbytes = sizeof(struct gen_pool_chunk) + BITS_TO_LONGS(nbits) * sizeof(long); chunk = vzalloc_node(nbytes, nid); @@ -242,7 +243,7 @@ void gen_pool_destroy(struct gen_pool *pool) struct list_head *_chunk, *_next_chunk; struct gen_pool_chunk *chunk; int order = pool->min_alloc_order; - int bit, end_bit; + unsigned long bit, end_bit; list_for_each_safe(_chunk, _next_chunk, &pool->chunks) { chunk = list_entry(_chunk, struct gen_pool_chunk, next_chunk); @@ -278,7 +279,7 @@ unsigned long gen_pool_alloc_algo_owner(struct gen_pool *pool, size_t size, struct gen_pool_chunk *chunk; unsigned long addr = 0; int order = pool->min_alloc_order; - int nbits, start_bit, end_bit, remain; + unsigned long nbits, start_bit, end_bit, remain; #ifndef CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG BUG_ON(in_nmi()); @@ -487,7 +488,7 @@ void gen_pool_free_owner(struct gen_pool *pool, unsigned long addr, size_t size, { struct gen_pool_chunk *chunk; int order = pool->min_alloc_order; - int start_bit, nbits, remain; + unsigned long start_bit, nbits, remain; #ifndef CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG BUG_ON(in_nmi()); @@ -755,7 +756,7 @@ unsigned long gen_pool_best_fit(unsigned long *map, unsigned long size, index = bitmap_find_next_zero_area(map, size, start, nr, 0); while (index < size) { - int next_bit = find_next_bit(map, size, index + nr); + unsigned long next_bit = find_next_bit(map, size, index + nr); if ((next_bit - index) < len) { len = next_bit - index; start_bit = index; -- 2.17.1