aboutsummaryrefslogtreecommitdiff
path: root/src/backend/commands/async.c
diff options
context:
space:
mode:
authorThomas G. Lockhart <lockhart@fourpalms.org>2002-06-15 02:49:47 +0000
committerThomas G. Lockhart <lockhart@fourpalms.org>2002-06-15 02:49:47 +0000
commitbad5fe9797f6935715f2423859336debce76b13b (patch)
tree0c153d99c408bdcb18a266081b70c53f29a8947e /src/backend/commands/async.c
parente62660080c23beeffa2b3caec44cc9ac4d8c242c (diff)
downloadpostgresql-bad5fe9797f6935715f2423859336debce76b13b.tar.gz
postgresql-bad5fe9797f6935715f2423859336debce76b13b.zip
Search the existing regular expression cache as a ring buffer.
Will optimize the case for repeated calls for the same expression, which seems to be the most common case. Formerly, always searched from the first entry. May want to look at the least-recently-used algorithm to make sure it is identifying the right slots to reclaim. Seems silly to do math when it seems that we could simply use an incrementing counter...
Diffstat (limited to 'src/backend/commands/async.c')
0 files changed, 0 insertions, 0 deletions