| Commit message (Collapse) | Author | Age |
... | |
|
|
|
| |
Add a few encodings that were not documented.
|
|
|
|
|
|
|
|
|
|
|
| |
database's datallowconn and datfrozenxid to the current transaction ID
instead of copying the source database's values. This is OK because we
assume the source DB contains no normal transaction IDs whatsoever.
This keeps VACUUM from immediately starting to complain about unvacuumed
databases in the situation where we are more than 2 billion transactions
out from the XID stamp of template0. Per discussion with Milen Radev
(although his complaint turned out to be due to something else, but the
problem is real anyway).
|
|
|
|
|
| |
who for some reason isn't marked usecreatedb. Per report from Alexander
Pravking. Also fix sloppy coding in have_createdb_privilege().
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
can tell whether it is being used as an aggregate or not. This allows
such a function to avoid re-pallocing a pass-by-reference transition
value; normally it would be unsafe for a function to scribble on an input,
but in the aggregate case it's safe to reuse the old transition value.
Make int8inc() do this. This gets a useful improvement in the speed of
COUNT(*), at least on narrow tables (it seems to be swamped by I/O when
the table rows are wide). Per a discussion in early December with
Neil Conway. I also fixed int_aggregate.c to check this, thereby
turning it into something approaching a supportable technique instead
of being a crude hack.
|
|
|
|
| |
Andrew Dunstan
|
|
|
|
|
|
|
| |
"max_fsm_relations" for vacuums. Also improve VACUUM VERBOSE final
message text.
Ron Mayer
|
| |
|
|
|
|
|
|
|
|
| |
elog if the former has trouble writing its file. Code review for
Magnus' patch to redirect stderr to syslog on Windows (Bruce's version
seems right, but did some minor prettification).
Backpatch both changes to 8.0 branch.
|
|
|
|
|
|
|
| |
Document use of macros for pg_printf functions.
Bump major versions of all interfaces to handle movement of get_progname
from libpq to libpgport in 8.0, and probably other libpgport changes in 8.1.
|
|
|
|
|
| |
implementation doesn't export out via libpq and get used by a user
application.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
| |
Formerly, if such a clause contained no aggregate functions we mistakenly
treated it as equivalent to WHERE. Per spec it must cause the query to
be treated as a grouped query of a single group, the same as appearance
of aggregate functions would do. Also, the HAVING filter must execute
after aggregate function computation even if it itself contains no
aggregate functions.
|
|
|
|
| |
Vikram Kalsi
|
|
|
|
|
|
|
|
|
|
| |
before we can invoke fork() -- flush stdio buffers, save and restore the
profiling timer on Linux with LINUX_PROFILE, and handle BeOS stuff. This
patch moves that code into a single function, fork_process(), instead of
duplicating it at the various callsites of fork().
This patch doesn't address the EXEC_BACKEND case; there is room for
further cleanup there.
|
| |
|
| |
|
|
|
|
| |
feature for Win32 and bcc.
|
|
|
|
|
|
| |
number of palloc calls. This has a salutory impact on plpgsql operations
with record variables (which create and destroy tupdescs constantly)
and probably helps a bit in some other cases too.
|
|
|
|
|
|
|
|
|
| |
UNICODE => UTF8
ALT => WIN866
WIN => WIN1251
TCVN => WIN1258
The old codes continue to work.
|
|
|
|
|
|
|
|
| |
Too much space is allocated for tablespace file path, I guess the
directory name used to be "pg_tablespaces" instead of "pg_tblspc" at
some point.
Heikki Linnakangas
|
|
|
|
|
|
|
| |
on-the-fly, and thereby avoid blowing out memory when the planner has
underestimated the hash table size. Hash join will now obey the
work_mem limit with some faithfulness. Per my recent proposal
(hash aggregate part isn't done yet though).
|
|
|
|
|
|
|
|
| |
the freelist, plus per-buffer spinlocks that protect access to individual
shared buffer headers. This requires abandoning a global freelist (since
the freelist is a global contention point), which shoots down ARC and 2Q
as well as plain LRU management. Adopt a clock sweep algorithm instead.
Preliminary results show substantial improvement in multi-backend situations.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Allocated size based on format string.
|
|
|
|
|
|
|
|
|
|
| |
of AND and OR clauses. The key point here is that an OR on the
predicate side has to be treated gingerly: we may be able to prove
that the OR is implied even when no one of its components is implied.
For example (x OR y) implies (x OR y OR z) even though no one of x,
y, or z can be individually proven. This code handles both the
example shown recently by Sergey Koshcheyev and the one shown last
October by Dawid Kuroczko.
|
|
|
|
|
| |
* If vsnprintf() is not before snprintf() in this file, snprintf()
* will call the system vsnprintf() on MinGW.
|
| |
|
|
|
|
|
|
| |
no held locks. This maintains the invariant that proclocks are present
only for procs that are holding or awaiting a lock; when this is not
true, LockRelease will fail. Per report from Stephen Clouse.
|
|
|
|
| |
representation of not wanting tracing to be limited by object OID.
|
|
|
|
| |
defining its own.
|
|
|
|
|
|
| |
indexscans involving partial indexes. These would always be dominated
by a simple indexscan on such an index, so there's no point in considering
them. Fixes overoptimism in a patch I applied last October.
|
|
|
|
|
|
|
| |
changes to make snprintf() vsnprintf() and printf()
functions in src/port/snprintf.c thread-safe.
Nicolai Tufar
|
|
|
|
|
|
| |
it was in 7.4, and add some comments explaining why it has to be this way.
I broke it for OR'd index predicates in a fit of code cleanup last summer.
Per example from Sergey Koshcheyev.
|
|
|
|
| |
Magnus Hagander
|
|
|
|
|
| |
Iijima, reviewed by Neil Conway. Catalog version number bumped,
regression tests updated.
|
|
|
|
|
|
| |
follows:
Magnus Hagander
|
|
|
|
| |
consistency. Backpatch only bcc32.mak to 8.0.X.
|
|
|
|
| |
editorializing by Neil Conway. Catalog version bumped.
|
|
|
|
| |
Magnus Hagander
|
|
|
|
| |
Magnus Hagander
|
|
|
|
|
|
|
|
|
|
|
| |
in favor of looking at the flat file copy of pg_database during backend
startup. This should finally eliminate the various corner cases in which
backend startup fails unexpectedly because it isn't able to distinguish
live and dead tuples in pg_database. Simplify locking on pg_database
to be similar to the rules used with pg_shadow and pg_group, and eliminate
FlushRelationBuffers operations that were used only to reduce the odds
of failure of GetRawDatabaseInfo.
initdb forced due to addition of a trigger to pg_database.
|
|
|
|
|
|
|
|
| |
http://www.pgsql.ru/db/mw/msg.html?mid=2045361
change TimeATD to/from Datum macros.
Re-initdb is needed.
|
| |
|
| |
|
|
|
|
|
|
|
| |
subsequently referenced.
Found by: Coverity
Fixed by: Sean Chittenden
|