aboutsummaryrefslogtreecommitdiff
path: root/src/backend/access/gist/gistvalidate.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2021-10-31 15:31:29 -0400
committerTom Lane <tgl@sss.pgh.pa.us>2021-10-31 15:31:29 -0400
commit6301c3adabd947394682e37c933b0f3f83353b28 (patch)
treed3bdec1e15b99b407367c7d1cb0e7306862e4014 /src/backend/access/gist/gistvalidate.c
parentacb2d7d5d2301f07d5857ee252995e62ce9e7055 (diff)
downloadpostgresql-6301c3adabd947394682e37c933b0f3f83353b28.tar.gz
postgresql-6301c3adabd947394682e37c933b0f3f83353b28.zip
Avoid O(N^2) behavior when the standby process releases many locks.
When replaying a transaction that held many exclusive locks on the primary, a standby server's startup process would expend O(N^2) effort on manipulating the list of locks. This code was fine when written, but commit 1cff1b95a made repetitive list_delete_first() calls inefficient, as explained in its commit message. Fix by just iterating the list normally, and releasing storage only when done. (This'd be inadequate if we needed to recover from an error occurring partway through; but we don't.) Back-patch to v13 where 1cff1b95a came in. Nathan Bossart Discussion: https://postgr.es/m/CD2F0E7F-9822-45EC-A411-AE56F14DEA9F@amazon.com
Diffstat (limited to 'src/backend/access/gist/gistvalidate.c')
0 files changed, 0 insertions, 0 deletions