Received: from malur.postgresql.org ([217.196.149.56]) by arkaria.postgresql.org with esmtps (TLS1.3) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (Exim 4.94.2) (envelope-from ) id 1rXuQQ-00DFQ4-Ff for pgsql-hackers@arkaria.postgresql.org; Thu, 08 Feb 2024 02:46:07 +0000 Received: from localhost ([127.0.0.1] helo=malur.postgresql.org) by malur.postgresql.org with esmtp (Exim 4.94.2) (envelope-from ) id 1rXuQO-00ET8J-F3 for pgsql-hackers@arkaria.postgresql.org; Thu, 08 Feb 2024 02:46:04 +0000 Received: from makus.postgresql.org ([2001:4800:3e1:1::229]) by malur.postgresql.org with esmtps (TLS1.3) tls TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 (Exim 4.94.2) (envelope-from ) id 1rXuQO-00ET6n-13 for pgsql-hackers@lists.postgresql.org; Thu, 08 Feb 2024 02:46:04 +0000 Received: from mail-il1-x12f.google.com ([2607:f8b0:4864:20::12f]) by makus.postgresql.org with esmtps (TLS1.3) tls TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 (Exim 4.94.2) (envelope-from ) id 1rXuQL-005dj5-4o for pgsql-hackers@lists.postgresql.org; Thu, 08 Feb 2024 02:46:02 +0000 Received: by mail-il1-x12f.google.com with SMTP id e9e14a558f8ab-363c9e3f814so4026975ab.0 for ; Wed, 07 Feb 2024 18:46:00 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20230601; t=1707360360; x=1707965160; darn=lists.postgresql.org; h=in-reply-to:content-disposition:mime-version:references:message-id :subject:cc:to:from:date:from:to:cc:subject:date:message-id:reply-to; bh=cift3frLz6jshFb8hqw8eXTAI6jZcJD/esGv3gs8Kgo=; b=KZX+MznvZpO54H+442FsMeNslhwwm6qBBKeCGB1JiFjYTx30ajIEwECfKZpm1CDbuv STCRWFst/HD3+fOXUlSl73qE+x9uIfmwFKk1WCqFVOgzk5YU9PJisLRDvl1Ql6KJY9i8 QcxFuuGRe1zdVnoQm7BCLCUL2KRhyjefay8dDtU9MnKLspip40r2vokr63IN+VtEfwSU TIbDj/eYkq8P0qKGst+yqJU3vp9jwMb1VhKnaYqGuqOaZ2z/Ll5ik5lcrCdSugDE8ePw 9WLl+cxUhTCbMx5Fyy0ktLohcA79ELX/e9QwTpjvmDIDqfA62dJXwSm/IB7Befe2QntC kFIQ== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20230601; t=1707360360; x=1707965160; h=in-reply-to:content-disposition:mime-version:references:message-id :subject:cc:to:from:date:x-gm-message-state:from:to:cc:subject:date :message-id:reply-to; bh=cift3frLz6jshFb8hqw8eXTAI6jZcJD/esGv3gs8Kgo=; b=RXgkfP/kuTeRC/hMreL9MumsVfUIbCV0dDdqEYPl2yWM+nLqJCeqy3h13l8u9AlEMw QsMvUYZI0HWp4tgtOmUt6lnQSM0qjfPleZ8jArAOHWZQ3QKKpsgMbD4X6y+cURc+X8n9 ueKkeJ45+rGx72cVVI30dL8s75grhiDbnEbMOPpHyQx9Xkjk7MFh5aNwV8ra2aWv99W2 GYlF5ubBIPF/0kpym+VK2dVl0FEmb3BhoAMc5H2RNqlS5O+EEQMSL9wKmyPg39fc4JjL 3lU6dsviDobUf8BcY25yPONXWE3UKOr+/lqkD39LpefbkByJX90FPpVteQh0rmgpBxYZ yJgA== X-Forwarded-Encrypted: i=1; AJvYcCXAiRemWvS2rS4O8lvs0GwyP51uRhX4/dNW1/juuwv/m7APcwkiZjkVcbyfcI4ubv2sBwz5wL80IQEEPD+HBqvUuC/+fO3oIZv5ISAr/cYtqD2i X-Gm-Message-State: AOJu0Ywchr2+1ztE0eHntS5Xc4ANjkyLJKXv9ufUGNxiGmF4QKNaDZcW kzxaI7efrOvzs5ED0k5MNmvN3idzJ/3fD6FoCe6jTn9ll0OoVqmU X-Google-Smtp-Source: AGHT+IGpmOiNqgO/tl0iI4A0vmygfP10Ox02q272tHgiyw8RuD2NyX7zaWFA9HEv2FaKnJWg3lIOwA== X-Received: by 2002:a92:d184:0:b0:363:b5bc:e8ee with SMTP id z4-20020a92d184000000b00363b5bce8eemr7897942ilz.7.1707360360256; Wed, 07 Feb 2024 18:46:00 -0800 (PST) X-Forwarded-Encrypted: i=1; AJvYcCWr/LoTI11a2DUXTg1Y/Ia33obNZtDFuMhN66x3ws2+EXz26mg5AKpUtCh14LNKJ8RfPCZ21wnARm/MyB3B8q+0qj8EmUz19YYHIMeBDUHL2qPsVh1Vxub4gEklMsHheP+j2CzgIGk9o7nUenTy9J4hyZGn4eEIFiHA Received: from nathanxps13 (162-195-168-172.lightspeed.stlsmo.sbcglobal.net. [162.195.168.172]) by smtp.gmail.com with ESMTPSA id u16-20020a92da90000000b0036287013d01sm739643iln.36.2024.02.07.18.45.59 (version=TLS1_3 cipher=TLS_AES_256_GCM_SHA384 bits=256/256); Wed, 07 Feb 2024 18:45:59 -0800 (PST) Date: Wed, 7 Feb 2024 20:45:58 -0600 From: Nathan Bossart To: Andres Freund Cc: Heikki Linnakangas , Mats Kindahl , Tom Lane , pgsql-hackers@lists.postgresql.org Subject: Re: glibc qsort() vulnerability Message-ID: <20240208024558.GB445153@nathanxps13> References: <508821.1707232276@sss.pgh.pa.us> <20240206205305.GB3891538@nathanxps13> <642084.1707252958@sss.pgh.pa.us> <20240207214857.rjqkutiaapka2xyp@awork3.anarazel.de> <20240207222124.GA382832@nathanxps13> <20240208004207.aoyrtv577nmhrivy@awork3.anarazel.de> <20240208015211.GA445153@nathanxps13> <20240208020637.3irwi5vph4fbxw2f@awork3.anarazel.de> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="T4sUOijqQbZv57TR" Content-Disposition: inline In-Reply-To: <20240208020637.3irwi5vph4fbxw2f@awork3.anarazel.de> List-Id: List-Help: List-Subscribe: List-Post: List-Owner: List-Archive: Archived-At: Precedence: bulk --T4sUOijqQbZv57TR Content-Type: text/plain; charset=us-ascii Content-Disposition: inline On Wed, Feb 07, 2024 at 06:06:37PM -0800, Andres Freund wrote: > Another branchless variant is (a > b) - (a < b). It seems to get a similar > improvement as the overflow-checking version. Well, that's certainly more elegant. I updated the patch to that approach for now. -- Nathan Bossart Amazon Web Services: https://aws.amazon.com --T4sUOijqQbZv57TR Content-Type: text/x-diff; charset=us-ascii Content-Disposition: attachment; filename="v3-0001-remove-direct-calls-to-pg_qsort.patch" From 8668a0dd83ecbdd356c76416b8398138407ef829 Mon Sep 17 00:00:00 2001 From: Nathan Bossart Date: Wed, 7 Feb 2024 14:29:04 -0600 Subject: [PATCH v3 1/2] remove direct calls to pg_qsort() --- contrib/pg_prewarm/autoprewarm.c | 4 ++-- src/backend/access/brin/brin_minmax_multi.c | 2 +- src/backend/storage/buffer/bufmgr.c | 4 ++-- src/backend/utils/cache/syscache.c | 10 +++++----- 4 files changed, 10 insertions(+), 10 deletions(-) diff --git a/contrib/pg_prewarm/autoprewarm.c b/contrib/pg_prewarm/autoprewarm.c index 06ee21d496..248b9914a3 100644 --- a/contrib/pg_prewarm/autoprewarm.c +++ b/contrib/pg_prewarm/autoprewarm.c @@ -346,8 +346,8 @@ apw_load_buffers(void) FreeFile(file); /* Sort the blocks to be loaded. */ - pg_qsort(blkinfo, num_elements, sizeof(BlockInfoRecord), - apw_compare_blockinfo); + qsort(blkinfo, num_elements, sizeof(BlockInfoRecord), + apw_compare_blockinfo); /* Populate shared memory state. */ apw_state->block_info_handle = dsm_segment_handle(seg); diff --git a/src/backend/access/brin/brin_minmax_multi.c b/src/backend/access/brin/brin_minmax_multi.c index 3ffaad3e42..2c29aa3d4e 100644 --- a/src/backend/access/brin/brin_minmax_multi.c +++ b/src/backend/access/brin/brin_minmax_multi.c @@ -1369,7 +1369,7 @@ build_distances(FmgrInfo *distanceFn, Oid colloid, * Sort the distances in descending order, so that the longest gaps are at * the front. */ - pg_qsort(distances, ndistances, sizeof(DistanceValue), compare_distances); + qsort(distances, ndistances, sizeof(DistanceValue), compare_distances); return distances; } diff --git a/src/backend/storage/buffer/bufmgr.c b/src/backend/storage/buffer/bufmgr.c index eb1ec3b86d..07575ef312 100644 --- a/src/backend/storage/buffer/bufmgr.c +++ b/src/backend/storage/buffer/bufmgr.c @@ -3915,7 +3915,7 @@ DropRelationsAllBuffers(SMgrRelation *smgr_reln, int nlocators) /* sort the list of rlocators if necessary */ if (use_bsearch) - pg_qsort(locators, n, sizeof(RelFileLocator), rlocator_comparator); + qsort(locators, n, sizeof(RelFileLocator), rlocator_comparator); for (i = 0; i < NBuffers; i++) { @@ -4269,7 +4269,7 @@ FlushRelationsAllBuffers(SMgrRelation *smgrs, int nrels) /* sort the list of SMgrRelations if necessary */ if (use_bsearch) - pg_qsort(srels, nrels, sizeof(SMgrSortArray), rlocator_comparator); + qsort(srels, nrels, sizeof(SMgrSortArray), rlocator_comparator); for (i = 0; i < NBuffers; i++) { diff --git a/src/backend/utils/cache/syscache.c b/src/backend/utils/cache/syscache.c index 162855b158..662f930864 100644 --- a/src/backend/utils/cache/syscache.c +++ b/src/backend/utils/cache/syscache.c @@ -146,14 +146,14 @@ InitCatalogCache(void) Assert(SysCacheSupportingRelOidSize <= lengthof(SysCacheSupportingRelOid)); /* Sort and de-dup OID arrays, so we can use binary search. */ - pg_qsort(SysCacheRelationOid, SysCacheRelationOidSize, - sizeof(Oid), oid_compare); + qsort(SysCacheRelationOid, SysCacheRelationOidSize, + sizeof(Oid), oid_compare); SysCacheRelationOidSize = qunique(SysCacheRelationOid, SysCacheRelationOidSize, sizeof(Oid), oid_compare); - pg_qsort(SysCacheSupportingRelOid, SysCacheSupportingRelOidSize, - sizeof(Oid), oid_compare); + qsort(SysCacheSupportingRelOid, SysCacheSupportingRelOidSize, + sizeof(Oid), oid_compare); SysCacheSupportingRelOidSize = qunique(SysCacheSupportingRelOid, SysCacheSupportingRelOidSize, sizeof(Oid), oid_compare); @@ -668,7 +668,7 @@ RelationSupportsSysCache(Oid relid) /* - * OID comparator for pg_qsort + * OID comparator for qsort */ static int oid_compare(const void *a, const void *b) -- 2.25.1 --T4sUOijqQbZv57TR Content-Type: text/x-diff; charset=us-ascii Content-Disposition: attachment; filename="v3-0002-Ensure-comparison-functions-are-transitive.patch" From a74708f14d6e862b836b2d5106491a8db3114433 Mon Sep 17 00:00:00 2001 From: Mats Kindahl Date: Tue, 6 Feb 2024 14:53:53 +0100 Subject: [PATCH v3 2/2] Ensure comparison functions are transitive There are a few comparison functions to qsort() that are non-transitive because they can cause an overflow. Fix these functions to instead use normal comparisons and return -1, 0, or 1 explicitly. --- src/backend/access/spgist/spgtextproc.c | 2 +- src/backend/utils/cache/relcache.c | 9 ++++++--- src/bin/pg_upgrade/function.c | 10 ++++++---- src/bin/psql/crosstabview.c | 5 ++++- 4 files changed, 17 insertions(+), 9 deletions(-) diff --git a/src/backend/access/spgist/spgtextproc.c b/src/backend/access/spgist/spgtextproc.c index b8fd0c2ad8..e561bde63e 100644 --- a/src/backend/access/spgist/spgtextproc.c +++ b/src/backend/access/spgist/spgtextproc.c @@ -325,7 +325,7 @@ cmpNodePtr(const void *a, const void *b) const spgNodePtr *aa = (const spgNodePtr *) a; const spgNodePtr *bb = (const spgNodePtr *) b; - return aa->c - bb->c; + return (aa->c > bb->c) - (aa->c < bb->c); } Datum diff --git a/src/backend/utils/cache/relcache.c b/src/backend/utils/cache/relcache.c index ac106b40e3..54682a0e60 100644 --- a/src/backend/utils/cache/relcache.c +++ b/src/backend/utils/cache/relcache.c @@ -4517,10 +4517,13 @@ AttrDefaultFetch(Relation relation, int ndef) static int AttrDefaultCmp(const void *a, const void *b) { - const AttrDefault *ada = (const AttrDefault *) a; - const AttrDefault *adb = (const AttrDefault *) b; + AttrNumber ana = ((const AttrDefault *) a)->adnum; + AttrNumber anb = ((const AttrDefault *) b)->adnum; - return ada->adnum - adb->adnum; + /* ensure upcasting approach is transitive */ + Assert(sizeof(AttrNumber) == 2); + + return (int) ana - (int) anb; } /* diff --git a/src/bin/pg_upgrade/function.c b/src/bin/pg_upgrade/function.c index af998f74d3..b421500bbb 100644 --- a/src/bin/pg_upgrade/function.c +++ b/src/bin/pg_upgrade/function.c @@ -32,14 +32,16 @@ library_name_compare(const void *p1, const void *p2) int slen1 = strlen(str1); int slen2 = strlen(str2); int cmp = strcmp(str1, str2); + int p1db = ((const LibraryInfo *) p1)->dbnum; + int p2db = ((const LibraryInfo *) p2)->dbnum; if (slen1 != slen2) - return slen1 - slen2; + return (slen1 > slen2) - (slen1 < slen2); + if (cmp != 0) return cmp; - else - return ((const LibraryInfo *) p1)->dbnum - - ((const LibraryInfo *) p2)->dbnum; + + return (p1db > p2db) - (p1db < p2db); } diff --git a/src/bin/psql/crosstabview.c b/src/bin/psql/crosstabview.c index c6116b7238..7660f0ed4b 100644 --- a/src/bin/psql/crosstabview.c +++ b/src/bin/psql/crosstabview.c @@ -709,5 +709,8 @@ pivotFieldCompare(const void *a, const void *b) static int rankCompare(const void *a, const void *b) { - return *((const int *) a) - *((const int *) b); + const int an = *(const int *) a; + const int bn = *(const int *) b; + + return (an > bn) - (an < bn); } -- 2.25.1 --T4sUOijqQbZv57TR--