database/postgres
database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-04-22 23:02:54 +03:00
Code

Fix misbehavior in contrib/pg_trgm with an unsatisfiable regex.

Browse Source 
If the regex compiler can see that a regex is unsatisfiable
(for example, '$foo') then it may emit an NFA having no arcs.
pg_trgm's packGraph function did the wrong thing in this case;
it would access off the end of a work array, and with bad luck
could produce a corrupted output data structure causing more
problems later.  This could end with wrong answers or crashes
in queries using a pg_trgm GIN or GiST index with such a regex.

Fix by not trying to de-duplicate if there aren't at least 2 arcs.

Per bug #17830 from Alexander Lakhin.  Back-patch to all supported
branches.

Discussion: https://postgr.es/m/17830-57ff5f89bdb02b09@postgresql.org
This commit is contained in:
Tom Lane 2023-03-11 12:15:41 -05:00
parent 866fd004d9
commit bc436e4a91
3 changed files with 25 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
contrib/pg_trgm/expected/pg_word_trgm.out
View File

@ -1044,3 +1044,9 @@ select t,word_similarity('Kabankala',t) as sml from test_trgm2 where t %> 'Kaban
Waikala | 0.3 Waikala | 0.3
(89 rows) (89 rows)
-- test unsatisfiable pattern
select * from test_trgm2 where t ~ '.*$x';
t
---
(0 rows)

3
contrib/pg_trgm/sql/pg_word_trgm.sql
View File

@ -43,3 +43,6 @@ select t,word_similarity('Baykal',t) as sml from test_trgm2 where 'Baykal' <% t
select t,word_similarity('Kabankala',t) as sml from test_trgm2 where 'Kabankala' <% t order by sml desc, t; select t,word_similarity('Kabankala',t) as sml from test_trgm2 where 'Kabankala' <% t order by sml desc, t;
select t,word_similarity('Baykal',t) as sml from test_trgm2 where t %> 'Baykal' order by sml desc, t; select t,word_similarity('Baykal',t) as sml from test_trgm2 where t %> 'Baykal' order by sml desc, t;
select t,word_similarity('Kabankala',t) as sml from test_trgm2 where t %> 'Kabankala' order by sml desc, t; select t,word_similarity('Kabankala',t) as sml from test_trgm2 where t %> 'Kabankala' order by sml desc, t;
-- test unsatisfiable pattern
select * from test_trgm2 where t ~ '.*$x';

26
contrib/pg_trgm/trgm_regexp.c
View File

@ -1929,9 +1929,7 @@ packGraph(TrgmNFA *trgmNFA, MemoryContext rcontext)
arcsCount; arcsCount;
HASH_SEQ_STATUS scan_status; HASH_SEQ_STATUS scan_status;
TrgmState *state; TrgmState *state;
TrgmPackArcInfo *arcs, TrgmPackArcInfo *arcs;
*p1,
*p2;
TrgmPackedArc *packedArcs; TrgmPackedArc *packedArcs;
TrgmPackedGraph *result; TrgmPackedGraph *result;
int i, int i,
@ -2003,17 +2001,25 @@ packGraph(TrgmNFA *trgmNFA, MemoryContext rcontext)
qsort(arcs, arcIndex, sizeof(TrgmPackArcInfo), packArcInfoCmp); qsort(arcs, arcIndex, sizeof(TrgmPackArcInfo), packArcInfoCmp);
/* We could have duplicates because states were merged. Remove them. */ /* We could have duplicates because states were merged. Remove them. */
/* p1 is probe point, p2 is last known non-duplicate. */ if (arcIndex > 1)
p2 = arcs;
for (p1 = arcs + 1; p1 < arcs + arcIndex; p1++)
{ {
if (packArcInfoCmp(p1, p2) > 0) /* p1 is probe point, p2 is last known non-duplicate. */
TrgmPackArcInfo *p1,
*p2;
p2 = arcs;
for (p1 = arcs + 1; p1 < arcs + arcIndex; p1++)
{ {
p2++; if (packArcInfoCmp(p1, p2) > 0)
*p2 = *p1; {
p2++;
*p2 = *p1;
}
} }
arcsCount = (p2 - arcs) + 1;
} }
arcsCount = (p2 - arcs) + 1; else
arcsCount = arcIndex;
/* Create packed representation */ /* Create packed representation */
result = (TrgmPackedGraph *) result = (TrgmPackedGraph *)