Manfred Koizar

< 	o Allow COPY FROM ... CVS to interpret newlines and carriage
> 	o Allow COPY FROM ... CSV to interpret newlines and carriage

> * Add xpath_array() to /contrib/xml2 to return results as an array

non-HAVE_SIGPROCMASK cases in pqinitmask().

non-HAVE_SIGPROCMASK cases in pqinitmask().

> * Allow the creation of indexes with mixed ascending/descending specifiers

> * Make src/port/snprintf.c thread-safe

Backpatch to 8.0.X.

DEBUG.

< * Add IP address to pg_stat_activity
> * Add the client IP address to pg_stat_activity

> * Add IP address to pg_stat_activity

DEBUG.

Fix a few places where DEBUG1 crept in that should have been DEBUG2.

works (and max_stack_depth is not set too high for the platform).
Inspired by trouble report from Brian Betts.

	SELECT CURRENT_TIMESTAMP;
	SELECT now();
	SELECT TIMESTAMP 'now';  -- incorrect for use with DEFAULT

more variables can be found in the libpq manual section.

Mention .pgpass in the psql manual page section dealing with connection
parameters and point to the libpq section for more details.

Backpatch to 8.0.X.

as valid input (it was previously treated as 0). This input was deprecated
in 8.0 (and a warning was emitted). Regression tests updated.

Per gripes from Mike Mascari and Bernd Heller.

that return tuples (such as EXPLAIN).  Per gripe from Michael Fuhr.
Side effect: fix an old bug that unintentionally disabled backward scans
for all SPI-created cursors.

Yutaka <tanida@sra.co.jp>.

suggestion from Rainer Brandt.

FreeBSD. From Mark Kirkwood, editorializing by Neil Conway.

Fetter and Ben Calvert.

Backpatch to 8.0.X.

column with a default expression. In that situation, we need to rewrite
the heap relation. To evaluate the new default expression, we use
ExecEvalExpr(); however, this can allocate memory in the current memory
context, and ATRewriteTable() does not switch out of the active portal's
heap memory context. The end result is a rather large memory leak (on
the order of gigabytes for a reasonably sized table).

This patch changes ATRewriteTable() to switch to the per-tuple memory
context before beginning the per-tuple loop. It also removes an explicit
heap_freetuple() in the loop, since that is no longer needed.

In an unrelated change, I noticed the code was scanning through the
attributes of the new tuple descriptor for each tuple of the old table.
I changed this to use precomputation, which should slightly speed up
the loop.

Thanks to steve@deefs.net for reporting the leak.

< *  Allow the PITR process to be debugged and data examined
> * Allow the PITR process to be debugged and data examined

the item:

< 	o Automatic failover
<
< 	  The proper solution to this will probably the use of a master/slave
< 	  replication solution like Sloney and a connection pooling tool like
< 	  pgpool.
<

"incompatibilities" section of the release notes.

there are corner cases involving dropping toasted columns in which the
previous coding would fail, too: the new version of the table might not
have any TOAST table, but we'd still propagate possibly-wide values of
dropped columns forward.

now depends on.

ReleaseAndReadBuffer during GIST index searches.  We already did this
in btree and rtree, might as well do it here too.

from LockRelease() and LockReleaseAll() into it. From Heikki Linnakangas.

database: aggregates should be dumped in the same pass as operators,
not in the same pass as functions.