- 29 10月, 2008 1 次提交
-
-
由 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 5 次提交
-
-
由 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.
-
由 Magnus Hagander 提交于
-
- 23 10月, 2008 7 次提交
-
-
由 Tom Lane 提交于
in their targetlists had better reset ps_TupFromTlist during ReScan calls. There's no need to back-patch here since nodeAgg and nodeGroup didn't even pretend to support SRFs in prior releases.
-
由 Tom Lane 提交于
used long ago, but in the current code the ecxt_outertuple field of ExprContext is doing all the work. Spotted by Ran Tang.
-
由 Magnus Hagander 提交于
* make LDAP use this instead of the hacky previous method to specify the DN to bind as * make all auth options behave the same when they are not compiled into the server * rename "ident maps" to "user name maps", and support them for all auth methods that provide an external username This makes a backwards incompatible change in the format of pg_hba.conf for the ident, PAM and LDAP authentication methods.
-
由 Peter Eisentraut 提交于
(INCLUDING/EXCLUDING DEFAULTS)
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
inputs is unique or nearly so), make eqjoinsel() clamp the ndistinct estimates to be not more than the estimated number of rows coming from the input relations. This allows the estimate to change in response to the selectivity of restriction conditions on the inputs. This is a pretty narrow patch and maybe we should be more aggressive about similarly clamping ndistinct in other cases; but I'm worried about double-counting the effects of the restriction conditions. However, it seems to help for the case exhibited by Grzegorz Jaskiewicz (antijoin against a small subset of a relation), so let's try this for awhile.
-
由 Tom Lane 提交于
until vars are distributed to rels during query_planner() startup. We don't really need it before that, and not building it early has some advantages. First, we don't need to put it through the various preprocessing steps, which saves some cycles and eliminates the need for a number of routines to support PlaceHolderInfo nodes at all. Second, this means one less unused plan for any sub-SELECT appearing in a placeholder's expression, since we don't build placeholder_list until after sublink expansion is complete.
-
- 22 10月, 2008 3 次提交
-
-
由 Teodor Sigaev 提交于
correctly set. As result, killtuple() marks as dead wrong tuple on page. Bug was introduced by me while fixing possible duplicates during GiST index scan.
-
由 Peter Eisentraut 提交于
OFFSET num {ROW|ROWS} FETCH {FIRST|NEXT} [num] {ROW|ROWS} ONLY
-
由 Tom Lane 提交于
that represent some expression that we desire to compute below the top level of the plan, and then let that value "bubble up" as though it were a plain Var (ie, a column value). The immediate application is to allow sub-selects to be flattened even when they are below an outer join and have non-nullable output expressions. Formerly we couldn't flatten because such an expression wouldn't properly go to NULL when evaluated above the outer join. Now, we wrap it in a PlaceHolderVar and arrange for the actual evaluation to occur below the outer join. When the resulting Var bubbles up through the join, it will be set to NULL if necessary, yielding the correct results. This fixes a planner limitation that's existed since 7.1. In future we might want to use this mechanism to re-introduce some form of Hellerstein's "expensive functions" optimization, ie place the evaluation of an expensive function at the most suitable point in the plan tree.
-
- 21 10月, 2008 7 次提交
-
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
error messages where the type existence is established.
-
由 Peter Eisentraut 提交于
alongside our traditional syntax.
-
由 Alvaro Herrera 提交于
knowledge of page layout. Stolen from Jonah Harris' CRC patch
-
由 Alvaro Herrera 提交于
Zdenek Kotala.
-
由 Alvaro Herrera 提交于
This patch eliminates the marking of subtransactions as SUBCOMMITTED in pg_clog during their commit; instead they remain in-progress until main transaction commit. At main transaction commit, the commit protocol is atomic-by-page instead of one transaction at a time. To avoid a race condition with some subtransactions appearing committed before others in the case where they span more than one pg_clog page, we conserve the logic that marks them subcommitted before marking the parent committed. Simon Riggs with minor help from me
-
- 20 10月, 2008 1 次提交
-
-
由 Peter Eisentraut 提交于
-