From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-pl1-x635.google.com (mail-pl1-x635.google.com [IPv6:2607:f8b0:4864:20::635]) by sourceware.org (Postfix) with ESMTPS id 4E0B33856DF4 for ; Wed, 3 May 2023 06:02:13 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.4.2 sourceware.org 4E0B33856DF4 Authentication-Results: sourceware.org; dmarc=pass (p=none dis=none) header.from=gmail.com Authentication-Results: sourceware.org; spf=pass smtp.mailfrom=gmail.com Received: by mail-pl1-x635.google.com with SMTP id d9443c01a7336-1ab01bf474aso21282675ad.1 for ; Tue, 02 May 2023 23:02:13 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20221208; t=1683093732; x=1685685732; h=content-disposition:mime-version:message-id:subject:to:from:date :from:to:cc:subject:date:message-id:reply-to; bh=wiFE9s361u3ymD7IkoEZgvvjMlyf2x3i0D4osXVMHlg=; b=svInkgLaaZ8OAyYsFcEJBIlHU5gdufYVgrCzDUOTN3feIxNgLdP9yMgP3HxevOd4Pp 1JRxpWvACajo0q1QY08e2QsPb52tWNFkH7YzRPwCCGNyQyYieoxCGkkpRCzRB54+G3Rb 809aHfDvYgsO41hyaIf3PDPjkMPE+uZzkgAyzjhy7IU8uS1Yn9Og3xwFgj2+ltoFdzQF bx7ImE/7GLbgjEJQ8YqhtHOn8yQYS0sfOOXG7405bkd33fA07Im3xEY244PAv6q8pdnh qJ+LGn3g8m6tLkbZ6VxG+vKVrOTGa5HIcfOixvfcehkBIlO1jMaDShPOombpIdLu75gz FmxA== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20221208; t=1683093732; x=1685685732; h=content-disposition:mime-version:message-id:subject:to:from:date :x-gm-message-state:from:to:cc:subject:date:message-id:reply-to; bh=wiFE9s361u3ymD7IkoEZgvvjMlyf2x3i0D4osXVMHlg=; b=V4WZx/b+bReSqTlGD/z84TGk7FAVhZAJZz3tNe1DdmzSmO/19p7NU3vlxf3NT8+VMs xehgLXg7zeDrk+MQlwxm4dO74i6dC42C1A9MfbzvArdK0oEtr77UYO5W8GvDEkXVpnWZ BeGiQXKklrUybXEgWsXkohut3SheuXJXOmtcP0Ud3Y1IW5C2Xj214We7X2OB+Wvk7Rvg kKNkvQlCpWUAXtcngBcQZb6C/jLwJAtTXeTQ7icgQOhJFcYTvt4HEl9Hc1B8efMFSiry TY7kzyvwbPhrAVd7LM/H8cphRIKKXA4BAbrPkQ0cjQRKFnbg/j1OSKMNdsGqQGIhpoBT iCvA== X-Gm-Message-State: AC+VfDwEP7EqLNYxCqCtQvw7TK0CJYQKg0gBdtvjpvpTEtmJVrFyZILg +vhelfdZQ8H+rbAUyyWHmbSSkWemJYQ= X-Google-Smtp-Source: ACHHUZ793ofw3HY85j+PsDVhGUMh1h5HcgmQ2X4FZye1WLkq4x9/mp7Koi5sDyieKbuBIex9S6A3RA== X-Received: by 2002:a17:903:1d0:b0:1a9:6bd4:236a with SMTP id e16-20020a17090301d000b001a96bd4236amr888578plh.69.1683093731879; Tue, 02 May 2023 23:02:11 -0700 (PDT) Received: from squeak.grove.modra.org ([2406:3400:51d:8cc0:e289:4864:2d83:727f]) by smtp.gmail.com with ESMTPSA id bd2-20020a170902830200b001a68d45e52dsm20763000plb.249.2023.05.02.23.02.11 for (version=TLS1_3 cipher=TLS_AES_256_GCM_SHA384 bits=256/256); Tue, 02 May 2023 23:02:11 -0700 (PDT) Received: by squeak.grove.modra.org (Postfix, from userid 1000) id 424C41142C83; Wed, 3 May 2023 15:32:09 +0930 (ACST) Date: Wed, 3 May 2023 15:32:09 +0930 From: Alan Modra To: binutils@sourceware.org Subject: hash.c: replace some unsigned long with unsigned int Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline X-Spam-Status: No, score=-3034.4 required=5.0 tests=BAYES_00,DKIM_SIGNED,DKIM_VALID,DKIM_VALID_AU,DKIM_VALID_EF,FREEMAIL_FROM,GIT_PATCH_0,RCVD_IN_DNSWL_NONE,SPF_HELO_NONE,SPF_PASS,TXREP,T_SCC_BODY_TEXT_LINE autolearn=ham autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on server2.sourceware.org List-Id: * hash.c (higher_prime_number): Use uint32_t param, return value, tables and variables. (bfd_default_hash_table_size): Make it an unsigned int. (bfd_hash_set_default_size): Use unsigned int param and return. * bfd-in.h (bfd_hash_set_default_size): Update prototype. * bfd-in2.h: Regenerate. diff --git a/bfd/bfd-in.h b/bfd/bfd-in.h index de7285626cd..0a4da9aa407 100644 --- a/bfd/bfd-in.h +++ b/bfd/bfd-in.h @@ -333,7 +333,7 @@ extern void bfd_hash_traverse /* Allows the default size of a hash table to be configured. New hash tables allocated using bfd_hash_table_init will be created with this size. */ -extern unsigned long bfd_hash_set_default_size (unsigned long); +extern unsigned int bfd_hash_set_default_size (unsigned int); /* This structure is used to keep track of stabs in sections information while linking. */ diff --git a/bfd/bfd-in2.h b/bfd/bfd-in2.h index c7bcd5f51fb..f5e1c1380c0 100644 --- a/bfd/bfd-in2.h +++ b/bfd/bfd-in2.h @@ -340,7 +340,7 @@ extern void bfd_hash_traverse /* Allows the default size of a hash table to be configured. New hash tables allocated using bfd_hash_table_init will be created with this size. */ -extern unsigned long bfd_hash_set_default_size (unsigned long); +extern unsigned int bfd_hash_set_default_size (unsigned int); /* This structure is used to keep track of stabs in sections information while linking. */ diff --git a/bfd/hash.c b/bfd/hash.c index 6e60bedc05b..add7d10ecb3 100644 --- a/bfd/hash.c +++ b/bfd/hash.c @@ -304,50 +304,49 @@ SUBSUBSECTION greater than N, and near a power of two. Copied from libiberty. Returns zero for ridiculously large N to signify an error. */ -static unsigned long -higher_prime_number (unsigned long n) +static uint32_t +higher_prime_number (uint32_t n) { /* These are primes that are near, but slightly smaller than, a power of two. */ - static const unsigned long primes[] = + static const uint32_t primes[] = { - (unsigned long) 31, - (unsigned long) 61, - (unsigned long) 127, - (unsigned long) 251, - (unsigned long) 509, - (unsigned long) 1021, - (unsigned long) 2039, - (unsigned long) 4093, - (unsigned long) 8191, - (unsigned long) 16381, - (unsigned long) 32749, - (unsigned long) 65521, - (unsigned long) 131071, - (unsigned long) 262139, - (unsigned long) 524287, - (unsigned long) 1048573, - (unsigned long) 2097143, - (unsigned long) 4194301, - (unsigned long) 8388593, - (unsigned long) 16777213, - (unsigned long) 33554393, - (unsigned long) 67108859, - (unsigned long) 134217689, - (unsigned long) 268435399, - (unsigned long) 536870909, - (unsigned long) 1073741789, - (unsigned long) 2147483647, - /* 4294967291L */ - ((unsigned long) 2147483647) + ((unsigned long) 2147483644), + UINT32_C (31), + UINT32_C (61), + UINT32_C (127), + UINT32_C (251), + UINT32_C (509), + UINT32_C (1021), + UINT32_C (2039), + UINT32_C (4093), + UINT32_C (8191), + UINT32_C (16381), + UINT32_C (32749), + UINT32_C (65521), + UINT32_C (131071), + UINT32_C (262139), + UINT32_C (524287), + UINT32_C (1048573), + UINT32_C (2097143), + UINT32_C (4194301), + UINT32_C (8388593), + UINT32_C (16777213), + UINT32_C (33554393), + UINT32_C (67108859), + UINT32_C (134217689), + UINT32_C (268435399), + UINT32_C (536870909), + UINT32_C (1073741789), + UINT32_C (2147483647), + UINT32_C (4294967291) }; - const unsigned long *low = &primes[0]; - const unsigned long *high = &primes[sizeof (primes) / sizeof (primes[0])]; + const uint32_t *low = &primes[0]; + const uint32_t *high = &primes[sizeof (primes) / sizeof (primes[0])]; while (low != high) { - const unsigned long *mid = low + (high - low) / 2; + const uint32_t *mid = low + (high - low) / 2; if (n >= *mid) low = mid + 1; else @@ -360,7 +359,7 @@ higher_prime_number (unsigned long n) return *low; } -static unsigned long bfd_default_hash_table_size = DEFAULT_SIZE; +static unsigned int bfd_default_hash_table_size = DEFAULT_SIZE; /* Create a new hash table, given a number of entries. */ @@ -660,15 +659,15 @@ bfd_hash_traverse (struct bfd_hash_table *table, out: table->frozen = 0; } - -unsigned long -bfd_hash_set_default_size (unsigned long hash_size) + +unsigned int +bfd_hash_set_default_size (unsigned int hash_size) { /* These silly_size values result in around 1G and 32M of memory being allocated for the table of pointers. Note that the number of elements allocated will be almost twice the size of any power of two chosen here. */ - unsigned long silly_size = sizeof (size_t) > 4 ? 0x4000000 : 0x400000; + unsigned int silly_size = sizeof (size_t) > 4 ? 0x4000000 : 0x400000; if (hash_size > silly_size) hash_size = silly_size; else if (hash_size != 0) -- Alan Modra Australia Development Lab, IBM