Tom Lane d7d81aa813 In predtest.c, install a limit on the number of branches we will process in ... AND, OR, or equivalent clauses: if there are too many (more than 100) just exit without proving anything. This ensures that we don't spend O(N^2) time trying (and most likely failing) to prove anything about very long IN lists and similar cases. Also, install a couple of CHECK_FOR_INTERRUPTS calls to ensure that a long proof attempt can be interrupted. Per gripe from Sergey Konoplev. Back-patch the whole patch to 8.2 and just the CHECK_FOR_INTERRUPTS addition to 8.1. (The rest of the patch doesn't apply cleanly, and since 8.1 doesn't show the complained-of behavior anyway, it doesn't seem necessary to work hard on it.)		2008-11-12 23:08:55 +00:00
..
clauses.c	Ensure that the result of evaluating a function during constant-expression	2007-10-11 21:28:12 +00:00
joininfo.c	Simplify the planner's join clause management by storing join clauses	2005-06-09 04:19:00 +00:00
Makefile	Separate predicate-testing code out of indxpath.c, making it a module	2005-06-10 22:25:37 +00:00
pathnode.c	Standard pgindent run for 8.1.	2005-10-15 02:49:52 +00:00
plancat.c	Re-run pgindent, fixing a problem where comment lines after a blank	2005-11-22 18:23:31 +00:00
predtest.c	In predtest.c, install a limit on the number of branches we will process in	2008-11-12 23:08:55 +00:00
relnode.c	Fix a bug in the original implementation of redundant-join-clause removal:	2007-07-31 19:54:01 +00:00
restrictinfo.c	Fix a bug in the original implementation of redundant-join-clause removal:	2007-07-31 19:54:01 +00:00
tlist.c	Standard pgindent run for 8.1.	2005-10-15 02:49:52 +00:00
var.c	Standard pgindent run for 8.1.	2005-10-15 02:49:52 +00:00