diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2015-09-18 13:55:17 -0400 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2015-09-18 13:55:17 -0400 |
| commit | 28c396134e0640e21610a984b89393825753b30d (patch) | |
| tree | dc9cca887e097255d5014b30ee2f4dccf332eb9b /src/backend/regex/regexec.c | |
| parent | dad7ea7e4dcc9ebdfb5480aa91cd1424135214e9 (diff) | |
| download | postgresql-28c396134e0640e21610a984b89393825753b30d.tar.gz postgresql-28c396134e0640e21610a984b89393825753b30d.zip | |
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/regex/regexec.c')
| -rw-r--r-- | src/backend/regex/regexec.c | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/src/backend/regex/regexec.c b/src/backend/regex/regexec.c index ee9984d6c07..7b98b18da7e 100644 --- a/src/backend/regex/regexec.c +++ b/src/backend/regex/regexec.c @@ -326,7 +326,11 @@ find(struct vars * v, (chr **) NULL, &hitend); else end = longest(v, d, begin, v->stop, &hitend); - NOERR(); + if (ISERR()) + { + freedfa(d); + return v->err; + } if (hitend && cold == NULL) cold = begin; if (end != NULL) |