- 01 Mar, 2006 1 commit
-
-
Bruce Momjian authored
-
- 28 Feb, 2006 11 commits
-
-
Neil Conway authored
-
Tom Lane authored
creation of a shell type. This allows a less hacky way of dealing with the mutual dependency between a datatype and its I/O functions: make a shell type, then make the functions, then define the datatype fully. We should fix pg_dump to handle things this way, but this commit just deals with the backend. Martijn van Oosterhout, with some corrections by Tom Lane.
-
Bruce Momjian authored
-
Bruce Momjian authored
-
Bruce Momjian authored
-
Neil Conway authored
does not return None, per suggestion from Tom.
-
Neil Conway authored
(I didn't use his patch, however). A void-returning PL/Python function must return None (from Python), which is translated into a void datum (and *not* NULL) for Postgres. I also added some regression tests for this functionality.
-
Bruce Momjian authored
* Split out libpq pgpass and environment documentation sections to make it easier for non-developers to find
-
Bruce Momjian authored
backend version in C using > and < comparisons.
-
Tom Lane authored
when the passed-down eflags indicate they can. Simon Riggs and Tom Lane
-
Tom Lane authored
bits indicating which optional capabilities can actually be exercised at runtime. This will allow Sort and Material nodes, and perhaps later other nodes, to avoid unnecessary overhead in common cases. This commit just adds the infrastructure and arranges to pass the correct flag values down to plan nodes; none of the actual optimizations are here yet. I'm committing this separately in case anyone wants to measure the added overhead. (It should be negligible.) Simon Riggs and Tom Lane
-
- 27 Feb, 2006 3 commits
-
-
Peter Eisentraut authored
particular get rid of single quotes around language names and old WITH () construct.
-
Peter Eisentraut authored
by David Fetter
-
Bruce Momjian authored
-
- 26 Feb, 2006 7 commits
-
-
Tom Lane authored
each tuple, as per my proposal of several days ago. Also, clean up sort memory management by keeping all working data in a separate memory context, and refine the handling of low-memory conditions.
-
Neil Conway authored
-
Bruce Momjian authored
> * -Add 'tid != tid ' operator for use in corruption recovery
-
Neil Conway authored
Kirkwood, minor improvements by Neil Conway. The regression tests have been updated and the catversion has been bumped.
-
Neil Conway authored
-
Neil Conway authored
-
Neil Conway authored
- "Add ON COMMIT capability to CREATE TABLE AS ... SELECT" is done - "Allow PREPARE to automatically determine parameter types" is done - "Clean up compiler warnings (especially with gcc version 4)" is done: AFAIK there are no remaining gcc4 compiler warnings to be fixed. - Creating rules to do view updates is *not* an easy TODO item
-
- 25 Feb, 2006 4 commits
-
-
-
Bruce Momjian authored
> o Allow infinite dates and intervals just like infinite timestamps
-
Bruce Momjian authored
-
Bruce Momjian authored
< o %Disallow dropping of an inherited constraint
-
- 24 Feb, 2006 5 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
-
Peter Eisentraut authored
the script is not executable as UCS_to_most.pl is in CVS. It also won't pick up any custom setting of the perl version/location to use. This patch calls perl scripts like $(PERL) $(srcdir)/script.pl. Kris Jurka
-
Andrew Dunstan authored
Make restricted_exec feature for Windows more robust by using the environment to pass the flag instead of the command line - some implementations of getopt fail if getopt arguments are present after non-getopt arguments.
-
Andrew Dunstan authored
make initdb -U username work as advertised; back out bogus patch at rev 1.42 and supply real fix for problem it tried to address.
-
- 23 Feb, 2006 1 commit
-
-
Tom Lane authored
Per Michael Fuhr.
-
- 21 Feb, 2006 3 commits
-
-
Neil Conway authored
possible ScanDirection alternatives rather than magic numbers (-1, 0, 1). Also, use the ScanDirection macros in a few places rather than directly checking whether `dir == ForwardScanDirection' and the like. Per patch from James William Pye. His patch also changed ScanDirection to be a "char" rather than an enum, which I haven't applied.
-
Tom Lane authored
by decompiling the typdefaultbin expression, not just printing the typdefault text which may be out-of-date or assume the wrong schema search path. (It's the same hazard as for adbin vs adsrc in column defaults.) The catalogs.sgml spec for pg_type implies that the correct procedure is to look to typdefaultbin first and consider typdefault only if typdefaultbin is NULL. I made dumping of both domains and base types do that, even though in the current backend code typdefaultbin is always correct for domains and typdefault for base types --- might as well try to future-proof it a little. Per bug report from Alexander Galler.
-
Tom Lane authored
as Tru64's. Per previous discussion.
-
- 20 Feb, 2006 2 commits
-
-
Neil Conway authored
in leaking memory when invoking a PL/Python procedure that raises an exception. Unfortunately this still leaks memory, but at least the largest leak has been plugged. This patch also fixes a reference counting mistake in PLy_modify_tuple() for 8.0, 8.1 and HEAD: we don't actually own a reference to `platt', so we shouldn't Py_DECREF() it.
-
Teodor Sigaev authored
previous version iwthout recreating tsvector fields... Thanks to Alexander Presber <aljoscha@weisshuhn.de> to discover a problem.
-
- 19 Feb, 2006 3 commits
-
-
Tom Lane authored
-
Tom Lane authored
allocates the control data. The per-tape buffers are allocated only on first use. This saves memory in situations where tuplesort.c overestimates the number of tapes needed (ie, there are fewer runs than tapes). Also, this makes legitimate the coding in inittapes() that includes tape buffer space in the maximum-memory calculation: when inittapes runs, we've already expended the whole allowed memory on tuple storage, and so we'd better not allocate all the tape buffers until we've flushed some tuples out of memory.
-
Tom Lane authored
with fixed merge order (fixed number of "tapes") was based on obsolete assumptions, namely that tape drives are expensive. Since our "tapes" are really just a couple of buffers, we can have a lot of them given adequate workspace. This allows reduction of the number of merge passes with consequent savings of I/O during large sorts. Simon Riggs with some rework by Tom Lane
-