| Commit message (Collapse) | Author | Age |
... | |
|
|
|
|
| |
implementation doesn't export out via libpq and get used by a user
application.
|
| |
|
| |
|
|
|
|
| |
Hashem Masoud
|
|
|
|
| |
Robert Treat
|
|
|
|
| |
Robert Treat
|
| |
|
| |
|
|
|
|
| |
> * Fix cross-compiling of time zone database via 'zic'
|
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
by non-default planner parameter settings.
|
|
|
|
|
|
|
| |
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.
|
|
|
|
| |
> * -Make src/port/snprintf.c thread-safe
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
|
| |
its output can be used to select the proper printf outputs.
|
|
|
|
| |
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.
|