Andres Freund d1aac29987 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 d4c62a6b62 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		2018-01-29 11:24:57 -08:00
..
binaryheap.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
bipartite_match.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
hyperloglog.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
ilist.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
knapsack.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
pairingheap.h	Phase 3 of pgindent updates.	2017-06-21 15:35:54 -04:00
rbtree.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00
simplehash.h	Prevent growth of simplehash tables when they're "too empty".	2018-01-29 11:24:57 -08:00
stringinfo.h	Phase 2 of pgindent updates.	2017-06-21 15:19:25 -04:00