database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-06-30 21:42:05 +03:00
Code Activity

Refactor hash_agg_entry_size().

Browse Source 
Consolidate the calculations for hash table size estimation. This will
help with upcoming Hash Aggregation work that will add additional call
sites.
This commit is contained in:
Jeff Davis
2020-02-06 11:49:56 -08:00
parent c02fdc9223
commit 7d4395d0a1
4 changed files with 14 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
src/backend/executor/nodeAgg.c
View File

@ -1422,24 +1422,17 @@ find_hash_columns(AggState *aggstate)
}
/*
* Estimate per-hash-table-entry overhead for the planner.
*
* Note that the estimate does not include space for pass-by-reference
* transition data values, nor for the representative tuple of each group.
* Nor does this account of the target fill-factor and growth policy of the
* hash table.
* Estimate per-hash-table-entry overhead.
*/
Size
hash_agg_entry_size(int numAggs)
hash_agg_entry_size(int numAggs, Size tupleWidth, Size transitionSpace)
{
Size entrysize;
/* This must match build_hash_table */
entrysize = sizeof(TupleHashEntryData) +
numAggs * sizeof(AggStatePerGroupData);
entrysize = MAXALIGN(entrysize);
return entrysize;
return
MAXALIGN(SizeofMinimalTupleHeader) +
MAXALIGN(tupleWidth) +
MAXALIGN(sizeof(TupleHashEntryData) +
numAggs * sizeof(AggStatePerGroupData)) +
transitionSpace;
}
/*