summaryrefslogtreecommitdiff
path: root/src/backend/utils/adt/numeric.c
diff options
context:
space:
mode:
authorTom Lane2015-09-18 17:55:17 +0000
committerTom Lane2015-09-18 17:55:17 +0000
commit28c396134e0640e21610a984b89393825753b30d (patch)
treedc9cca887e097255d5014b30ee2f4dccf332eb9b /src/backend/utils/adt/numeric.c
parentdad7ea7e4dcc9ebdfb5480aa91cd1424135214e9 (diff)
Fix low-probability memory leak in regex execution.
After an internal failure in shortest() or longest() while pinning down the exact location of a match, find() forgot to free the DFA structure before returning. This is pretty unlikely to occur, since we just successfully ran the "search" variant of the DFA; but it could happen, and it would result in a session-lifespan memory leak since this code uses malloc() directly. Problem seems to have been aboriginal in Spencer's library, so back-patch all the way. In passing, correct a thinko in a comment I added awhile back about the meaning of the "ntree" field. I happened across these issues while comparing our code to Tcl's version of the library.
Diffstat (limited to 'src/backend/utils/adt/numeric.c')
0 files changed, 0 insertions, 0 deletions