postgres.git / summary / log / commit / refs
commit 227de22095c8101905ce41e1ebf425239feed079
Author: David Rowley <drowley@postgresql.org>
Date: Tue Oct 27 22:42:22 2026 +0000
First released in: 19.0
Fix broken indentation caused by 34d52e6d3
Per buildfarm member koel
Backpatch to 19 to avoid unnecessary variations.
Backpatch-through: 19
src/backend/executor/execGrouping.c | 20 ++++++++++----------
1 file changed, 10 insertions(+), 10 deletions(-)
diff --git a/src/backend/executor/execGrouping.c b/src/backend/executor/execGrouping.c
index 2296506e4ee..3d20523e0a0 100644
--- a/src/backend/executor/execGrouping.c
+++ b/src/backend/executor/execGrouping.c
@@ -206,16 +206,16 @@ BuildTupleHashTable(PlanState *parent,
* clamp the given nelements to fit in that. We'd also better do
* something sane when faced with a zero or NaN estimate. There are
* various reasons why the planner might not be able to provide a good
- * estimate here; for example, recursive CTEs don't base their estimate
- * on anything reliable and can yield some rather large estimates. Here
- * we cap nbuckets to hash_mem to help prevent insane memory allocations.
- * The hash table can still grow when the bucket count is insufficient.
- * That will make the query a little slower, but that's better than
- * outright failing due to OOM if we were to request an insane bucket
- * count. Queries being slightly slower with smaller work_mem values is
- * also aligned to user expectations. We purposefully don't include the
- * tuple width in this calculation, as that would make the cap depend on
- * planner estimates for the tuple width, which could also be unreliable.
+ * estimate here; for example, recursive CTEs don't base their estimate on
+ * anything reliable and can yield some rather large estimates. Here we
+ * cap nbuckets to hash_mem to help prevent insane memory allocations. The
+ * hash table can still grow when the bucket count is insufficient. That
+ * will make the query a little slower, but that's better than outright
+ * failing due to OOM if we were to request an insane bucket count.
+ * Queries being slightly slower with smaller work_mem values is also
+ * aligned to user expectations. We purposefully don't include the tuple
+ * width in this calculation, as that would make the cap depend on planner
+ * estimates for the tuple width, which could also be unreliable.
*/
if (isnan(nelements) || nelements <= 0)
nbuckets = 1;
[parent: d2adf339b06b]