- 31 10月, 2008 7 次提交
-
-
由 Heikki Linnakangas 提交于
functions into one ReadBufferExtended function, that takes the strategy and mode as argument. There's three modes, RBM_NORMAL which is the default used by plain ReadBuffer(), RBM_ZERO, which replaces ZeroOrReadBuffer, and a new mode RBM_ZERO_ON_ERROR, which allows callers to read corrupt pages without throwing an error. The FSM needs the new mode to recover from corrupt pages, which could happend if we crash after extending an FSM file, and the new page is "torn". Add fork number to some error messages in bufmgr.c, that still lacked it.
-
由 Peter Eisentraut 提交于
BSD sed. So write it in Perl, which is more portable and a bit faster, too. We already use Perl for standard documentation builds, so this imposes no additional requirement.
-
由 Heikki Linnakangas 提交于
-
由 Heikki Linnakangas 提交于
-
由 Peter Eisentraut 提交于
(also backported to 8.3)
-
由 Tom Lane 提交于
-
由 Magnus Hagander 提交于
in the Global\ namespace, because it caused permission errors on a lot of platforms. We need to come up with something better for 8.4, but for now revert to the pre-8.3.4 behaviour.
-
- 30 10月, 2008 5 次提交
-
-
由 Tom Lane 提交于
Argentina, Brazil, Mauritius, Syria).
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
Per gripe from Kevin Grittner. Backpatch to 8.3, where the bug was introduced.
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
This basically takes some build system code that was previously labeled "Solaris" and ties it to the compiler rather than the operating system. Author: Julius Stroffek <Julius.Stroffek@Sun.COM>
-
- 29 10月, 2008 8 次提交
-
-
由 Bruce Momjian 提交于
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
been optional.
-
由 Peter Eisentraut 提交于
align strings in the --help output. Do this through our abstraction layer to eliminate redundancy and randomness in configure.in.
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
backwards scan could actually happen. In particular, pass a flag to materialize-mode SRFs that tells them whether they need to require random access. In passing, also suppress unneeded backward-scan overhead for a Portal's holdStore tuplestore. Per my proposal about reducing I/O costs for tuplestores.
-
由 Tom Lane 提交于
via a tuplestore instead of value-per-call. Refactor a few things to reduce ensuing code duplication with nodeFunctionscan.c. This represents the reasonably noncontroversial part of my proposed patch to switch SQL functions over to returning tuplestores. For the moment, SQL functions still do things the old way. However, this change enables PL SRFs to be called in targetlists (observe changes in plperl regression results).
-
由 Tom Lane 提交于
didn't actually work, because nodeRecursiveunion.c creates the underlying tuplestore with backward scan disabled; which is a decision that we shouldn't reverse because of performance cost. We could imagine adding signaling from WorkTableScan to RecursiveUnion about whether backward scan is needed ... but in practice it'd be a waste of effort, because there simply isn't any current or plausible future scenario where WorkTableScan would be called on to scan backward. So just dike out the code that claims to support it.
-
- 28 10月, 2008 7 次提交
-
-
由 Tom Lane 提交于
written to temp files by tuplesort.c and tuplestore.c. This saves 2 bytes per row for 32-bit machines, and 6 bytes per row for 64-bit machines, which seems worth the slight additional uglification of the tuple read/write routines.
-
由 Peter Eisentraut 提交于
Also, since WITH is now a reserved word, simplify the token merging code to only deal with WITH_TIME. by Tom Lane and myself
-
由 Magnus Hagander 提交于
This breaks compatibility with pre-7.2 versions.
-
由 Alvaro Herrera 提交于
-
由 Alvaro Herrera 提交于
they are freezing a nonzero amount anyway.
-
由 Magnus Hagander 提交于
-
由 Tom Lane 提交于
recursion when we are unable to convert a localized error message to the client's encoding. We've been over this ground before, but as reported by Ibrar Ahmed, it still didn't work in the case of conversion failures for the conversion-failure message itself :-(. Fix by installing a "circuit breaker" that disables attempts to localize this message once we get into recursion trouble. Patch all supported branches, because it is in fact broken in all of them; though I had to add some missing translations to the older branches in order to expose the failure in the particular test case I was using.
-
- 27 10月, 2008 5 次提交
-
-
由 Magnus Hagander 提交于
after each other (since we already add a newline on each, this makes them multiline). Previously a new error would just overwrite the old one, so for example any error caused when trying to connect with SSL enabled would be overwritten by the error message form the non-SSL connection when using sslmode=prefer.
-
由 Peter Eisentraut 提交于
-
由 Magnus Hagander 提交于
libpq events code. Hiroshi Saito
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
- 26 10月, 2008 3 次提交
-
-
由 Tom Lane 提交于
treat Var and non-Var IN-list items differently. Only non-Var items are candidates to go into an ANY(ARRAY) construct --- we put all Vars as separate OR conditions on the grounds that that leaves more scope for optimization. Per suggestion from Robert Haas.
-
由 Tom Lane 提交于
only the outer side can be pushed down rather than having to be evaluated at the join.
-
由 Tom Lane 提交于
into an OR of equality comparisons, rather than x = ANY(ARRAY[...]), when there are Vars in the right-hand side. This avoids a performance regression compared to pre-8.2 releases, in cases where the OR form can be optimized into scans of multiple indexes. Limit the possible downside by preferring this form only when the list isn't very long (I set the cutoff at 32 elements, which is a bit arbitrary but in the right ballpark). Per discussion with Jim Nasby. In passing, also make it try the OR form if it cannot select a common type for the array elements; we've seen a complaint or two about how the OR form worked for such cases and ARRAY doesn't.
-
- 25 10月, 2008 1 次提交
-
-
由 Tom Lane 提交于
recent proposal. In typical cases, we now need 12 bytes per insert or delete event and 16 bytes per update event; previously we needed 40 bytes per event on 32-bit hardware and 80 bytes per event on 64-bit hardware. Even in the worst case usage pattern with a large number of distinct triggers being fired in one query, usage is at most 32 bytes per event. It seems to be a bit faster than the old code as well, due to reduction of palloc overhead. This commit doesn't address the TODO item of allowing the event list to spill to disk; rather it's trying to stave off the need for that. However, it probably makes that task a bit easier by reducing the data structure's dependency on pointers. It would now be practical to dump an event list to disk by "chunks" instead of individual events.
-
- 24 10月, 2008 4 次提交
-
-
由 Magnus Hagander 提交于
-
由 Magnus Hagander 提交于
end-user documentation that lives in the actual documentation.
-
由 Magnus Hagander 提交于
to the old set of SSL patches. Hasn't been updated since, and we keep the TODOs in the "real" TODO list, really...
-
由 Magnus Hagander 提交于
of copy/paste:d emails. Much of the contents had already been migrated into the main documentation, some was out of date and some just plain wrong. Keep the "protocol-flowchart" which can still be useful.
-