| Commit message (Collapse) | Author | Age |
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
if the OS supports it. Code will still compile on non-IPv6-aware
machines (feature added by Bruce).
Nigel Kukard
|
| |
|
|
|
|
| |
the rationale.
|
|
|
|
|
|
| |
match parent table. This used to work, but was broken in 7.3 by
rearrangement of code that handles targetlist sorting. Add a regression
test to catch future breakage.
|
|
|
|
|
|
|
|
| |
patches of 9-Dec (permissions fix) and 13-Dec (performance) as well as
a partial fix for locking issues: concurrent DROP COLUMN should not
create trouble anymore. But concurrent DROP TABLE is still a risk, and
there is no protection at all against creating a column of a domain while
we are altering the domain.
|
|
|
|
| |
reload the type.
|
| |
|
|
|
|
|
|
|
|
|
| |
columns in DefineIndex. So, ALTER TABLE ... PRIMARY KEY will now
automatically add the NOT NULL constraint. It appeared the alter_table
regression test wanted this to occur, as after the change the regression
test better matched in inline 'fails'/'succeeds' comments.
Rod Taylor
|
|
|
|
| |
Backpatch to 7.3.X.
|
|
|
|
|
| |
target function. Also, move SetQuerySnapshot() call to avoid assert
failure when a fastpath call is attempted in an aborted transaction.
|
|
|
|
|
| |
it diverged from netbsd.h and openbsd.h. This has now been confirmed.
Accordingly, make all three exactly alike.
|
|
|
|
| |
needed). Some desultory const-ification of SPI interface to support this.
|
|
|
|
|
|
|
| |
of the libpq interface static and dynamic libraries with the freely
downloadable Borland C++ compiler version 5.5 and/or C++ Builder.
Lester Godwin
|
| |
|
|
|
|
| |
stop/start nesting, other infelicities.
|
|
|
|
| |
it took 'em this long to realize it's needed...)
|
|
|
|
|
|
|
|
|
|
|
|
| |
beginning/end of cursor.
Have MOVE return 0/1 depending on cursor position.
Matches SQL spec.
Pass cursor counter from parser as a long rather than int.
Doc updates.
|
|
|
|
|
|
|
| |
computation: reduce the bucket number mod nbatch. This changes the
association between original bucket numbers and batches, but that
doesn't matter. Minor other cleanups in hashjoin code to help
centralize decisions.
|
| |
|
|
|
|
| |
Kenji Sugita
|
|
|
|
|
| |
ExecHashJoinGetBatch(). Fixes core dump on large hash joins, as in
example from Rae Stiening.
|
|
|
|
| |
Per report from Ian Barwick.
|
|
|
|
| |
core dump in pg_dump when dumping views having comments. See bug #855.
|
|
|
|
| |
Philip Warner
|
|
|
|
| |
per example from Bruno Wolff in which it produced a silly result.
|
|
|
|
| |
EXPLAIN ANALYZE. (Premature optimization is the root of all evil?)
|
| |
|
| |
|
|
|
|
|
|
| |
Also, tweak -C option (emit CREATE DATABASE command) to emit encoding
name rather than encoding number, for consistency with pg_dumpall
and better cross-version portability.
|
|
|
|
|
|
| |
a result of at most 128 chars, but that could be more than 128 bytes.
Also ensure we don't try to pfree uninitialized pointers during error
cleanup.
|
| |
|
| |
|
|
|
|
| |
plan node. Not sure why this oversight has persisted so long ...
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
"SSLv23_method(void), SSLv23_server_method(void), SSLv23_client_method(void)
A TLS/SSL connection established with these methods will understand the SSLv2,
SSLv3, and TLSv1 protocol. A client will send out SSLv2 client hello messages
and will indicate that it also understands SSLv3 and TLSv1. A server will
understand SSLv2, SSLv3, and TLSv1 client hello messages. This is the best
choice when compatibility is a concern."
This will maintain backwards compatibility for those us that don't use
TLS connections ...
|
|
|
|
| |
It doesn't leak memory anymore ...
|
|
|
|
|
| |
retrieved. This cannot happen in ordinary execution, but it can happen
under EvalPlanQual().
|
|
|
|
| |
executor.
|
| |
|
|
|
|
|
| |
the cons cell it's deleting from the list. Do this, and fix a few callers
that were bogusly assuming it wouldn't free the cons cell.
|
|
|
|
|
|
|
|
|
|
|
| |
allocation in best_inner_indexscan(). While at it, simplify GEQO's
interface to the main planner --- make_join_rel() offers exactly the
API it really wants, whereas calling make_rels_by_clause_joins() and
make_rels_by_clauseless_joins() required jumping through hoops.
Rewrite gimme_tree for clarity (sometimes iteration is much better than
recursion), and approximately halve GEQO's runtime by recognizing that
tours of the forms (a,b,c,d,...) and (b,a,c,d,...) are equivalent
because of symmetry in make_join_rel().
|
|
|
|
|
|
|
|
| |
disallowed by CREATE TABLE (eg, pseudo-types); also disallow these types
from being introduced by the range-function syntax. While at it, allow
CREATE TABLE to create zero-column tables, per recent pghackers discussion.
I am back-patching this into 7.3 since failure to disallow pseudo-types
is arguably a security hole.
|
|
|
|
|
|
|
|
| |
practice of evaluating MemSet's arguments multiple times, except for
the special case of newNode(), where we can assume the argument is
a constant sizeof() operator.
Also, add GetMemoryChunkContext() to mcxt.c's API, in preparation for
fixing recent GEQO breakage.
|
|
|
|
|
|
|
|
|
| |
given any malloc block until something is first allocated in it; but
thereafter, MemoryContextReset won't release that first malloc block.
This preserves the quick-reset property of the original policy, without
forcing 8K to be allocated to every context whether any of it is ever
used or not. Also, remove some more no-longer-needed explicit freeing
during ExecEndPlan.
|
|
|
|
|
|
| |
a per-query memory context created by CreateExecutorState --- and destroyed
by FreeExecutorState. This provides a final solution to the longstanding
problem of memory leaked by various ExecEndNode calls.
|