Tom Lane b11123b675 Fix parameter recalculation for Limit nodes: during a ReScan call we must ... recompute the limit/offset immediately, so that the updated values are available when the child's ReScan function is invoked. Add a regression test for this, too. Bug is new in HEAD (due to the bounded-sorting patch) so no need for back-patch. I did not do anything about merging this signaling with chgParam processing, but if we were to do that we'd still need to compute the updated values at this point rather than during the first ProcNode call. Per observation and test case from Greg Stark, though I didn't use his patch.		2007-05-17 19:35:08 +00:00
..
bitmapset.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
execnodes.h	Fix parameter recalculation for Limit nodes: during a ReScan call we must	2007-05-17 19:35:08 +00:00
makefuncs.h	Fix up the remaining places where the expression node structure would lose	2007-03-17 00:11:05 +00:00
memnodes.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
nodeFuncs.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
nodes.h	Rename the newly-added commands for discarding session state.	2007-04-26 16:13:15 +00:00
params.h	First phase of plan-invalidation project: create a plan cache management	2007-03-13 00:33:44 +00:00
parsenodes.h	Modify processing of DECLARE CURSOR and EXPLAIN so that they can resolve the	2007-04-27 22:05:49 +00:00
pg_list.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
plannodes.h	Modify processing of DECLARE CURSOR and EXPLAIN so that they can resolve the	2007-04-27 22:05:49 +00:00
primnodes.h	Fix array coercion expressions to ensure that the correct volatility is	2007-03-27 23:21:12 +00:00
print.h	Turn the rangetable used by the executor into a flat list, and avoid storing	2007-02-22 22:00:26 +00:00
readfuncs.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
relation.h	Some further performance tweaks for planning large inheritance trees that	2007-04-21 21:01:45 +00:00
tidbitmap.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
value.h	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00