diff options
| author | Andres Freund <andres@anarazel.de> | 2018-01-29 11:02:09 -0800 |
|---|---|---|
| committer | Andres Freund <andres@anarazel.de> | 2018-01-29 11:24:57 -0800 |
| commit | ab9f2c429d8fbd3580cd2ae5f2054ba6956b1f60 (patch) | |
| tree | b75c0239b09ce35238ffb00b3533d8f4171add30 /src/backend/utils/adt/json.c | |
| parent | c068f87723ca9cded1f2aceb956ede49de651690 (diff) | |
| download | postgresql-ab9f2c429d8fbd3580cd2ae5f2054ba6956b1f60.tar.gz postgresql-ab9f2c429d8fbd3580cd2ae5f2054ba6956b1f60.zip | |
Prevent growth of simplehash tables when they're "too empty".
In cases where simplehash tables where filled with either a lot of
conflicting hash-values, or values that hash to consecutive
values (i.e. build "chains") the growth heuristics in
d4c62a6b623d6eef88218158e9fa3cf974c6c7e5 could trigger rather
explosively.
To fix that, address some of the reasons (see previous commit) of why
the growth heuristics where needed, and only allow growth when the
table isn't too empty. While that means there's a few cases of bad
input that can be slower, that seems a lot better than running very
quickly out of memory.
Author: Tomas Vondra and Andres Freund, with additional input by
Thomas Munro, Tom Lane Todd A. Cook
Reported-By: Todd A. Cook, Tomas Vondra, Thomas Munro
Discussion: https://postgr.es/m/20171127185700.1470.20362@wrigleys.postgresql.org
Backpatch: 10, where simplehash was introduced
Diffstat (limited to 'src/backend/utils/adt/json.c')
0 files changed, 0 insertions, 0 deletions