- 31 8月, 2012 12 次提交
-
-
由 Alvaro Herrera 提交于
This reduces unnecessary exposure of other headers through htup.h, which is very widely included by many files. I have chosen to move the function prototypes to the new file as well, because that means htup.h no longer needs to include tupdesc.h. In itself this doesn't have much effect in indirect inclusion of tupdesc.h throughout the tree, because it's also required by execnodes.h; but it's something to explore in the future, and it seemed best to do the htup.h change now while I'm busy with it.
-
由 Bruce Momjian 提交于
port. The last use was QNX, per Peter Eisentraut.
-
由 Robert Haas 提交于
Jeff Janes
-
由 Bruce Momjian 提交于
autovacuum activity. Per report from Marc Mamin
-
由 Tom Lane 提交于
Given a query such as SELECT * FROM foo JOIN LATERAL (SELECT foo.var1) ss(x) ON ss.x = foo.var2 the existence of the join clause "ss.x = foo.var2" encourages indxpath.c to build a parameterized path for foo using any index available for foo.var2. This is completely useless activity, though, since foo has got to be on the outside not the inside of any nestloop join with ss. It's reasonably inexpensive to add tests that prevent creation of such paths, so let's do that.
-
由 Robert Haas 提交于
The existing documentation in Linux Memory Overcommit seemed to assume that PostgreSQL itself could never be the problem, or at least it didn't tell you what to do about it. Per discussion with Craig Ringer and Kevin Grittner.
-
由 Heikki Linnakangas 提交于
Report and analysis by Matthias.
-
由 Robert Haas 提交于
Per note from Peter Eisentraut.
-
由 Robert Haas 提交于
As suggested by Etsuro Fujita, but with somewhat different wording.
-
由 Bruce Momjian 提交于
-
由 Robert Haas 提交于
Every time the best-tuple-found-so-far changes, we need to reset all the penalty values in which_grow[] to the penalties for the new best tuple. The old code failed to do this, resulting in inferior index quality. The original patch from Alexander Korotkov was just two lines; I took the liberty of fleshing that out by adding a bunch of comments that I hope will make this logic easier for others to understand than it was for me.
-
由 Tom Lane 提交于
push_child_plan/pop_child_plan didn't bother to adjust the "ancestors" list of parent plan nodes when descending to a child plan node. I think this was okay when it was written, but it's not okay in the presence of LATERAL references, since a subplan node could easily be returning a LATERAL value back up to the same nestloop node that provides the value. Per changed regression test results, the omission led to failure to interpret Param nodes that have perfectly good interpretations.
-
- 30 8月, 2012 6 次提交
-
-
由 Robert Haas 提交于
Jeff Davis, somewhat edited by me
-
由 Robert Haas 提交于
-
由 Peter Eisentraut 提交于
Python can be built to have two separate include directories: one for platform-independent files and one for platform-specific files. So far, this has apparently never mattered for a PL/Python build. But with the new multi-arch Python packages in Debian and Ubuntu, this is becoming the standard configuration on these platforms, so we must check these directories separately to be able to build there. Also add a bit of reporting in configure to be able to see better what is going on with this.
-
由 Tom Lane 提交于
In the initial cut at LATERAL, I kept the rule that cheapest_total_path was always unparameterized, which meant it had to be NULL if the relation has no unparameterized paths. It turns out to work much more nicely if we always have *some* path nominated as cheapest-total for each relation. In particular, let's still say it's the cheapest unparameterized path if there is one; if not, take the cheapest-total-cost path among those of the minimum available parameterization. (The first rule is actually a special case of the second.) This allows reversion of some temporary lobotomizations I'd put in place. In particular, the planner can now consider hash and merge joins for joins below a parameter-supplying nestloop, even if there aren't any unparameterized paths available. This should bring planning of LATERAL-containing queries to the same level as queries not using that feature. Along the way, simplify management of parameterized paths in add_path() and friends. In the original coding for parameterized paths in 9.2, I tried to minimize the logic changes in add_path(), so it just treated parameterization as yet another dimension of comparison for paths. We later made it ignore pathkeys (sort ordering) of parameterized paths, on the grounds that ordering isn't a useful property for the path on the inside of a nestloop, so we might as well get rid of useless parameterized paths as quickly as possible. But we didn't take that reasoning as far as we should have. Startup cost isn't a useful property inside a nestloop either, so add_path() ought to discount startup cost of parameterized paths as well. Having done that, the secondary sorting I'd implemented (in add_parameterized_path) is no longer needed --- any parameterized path that survives add_path() at all is worth considering at higher levels. So this should be a bit faster as well as simpler.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
reporting in contains invalid data.
-
- 29 8月, 2012 12 次提交
-
-
由 Heikki Linnakangas 提交于
This includes two micro-optimizations to the tight inner loop in descending the SP-GiST tree: 1. avoid an extra function call to index_getprocinfo when calling user-defined choose function, and 2. avoid a useless palloc+pfree when node labels are not used.
-
由 Alvaro Herrera 提交于
Evidently I failed to test a compile after my earlier header shuffling.
-
由 Peter Eisentraut 提交于
-
由 Alvaro Herrera 提交于
The heapam XLog functions are used by other modules, not all of which are interested in the rest of the heapam API. With this, we let them get just the XLog stuff in which they are interested and not pollute them with unrelated includes. Also, since heapam.h no longer requires xlog.h, many files that do include heapam.h no longer get xlog.h automatically, including a few headers. This is useful because heapam.h is getting pulled in by execnodes.h, which is in turn included by a lot of files.
-
由 Alvaro Herrera 提交于
Instead, place a forward struct declaration for struct catclist in syscache.h. This reduces header proliferation somewhat.
-
由 Alvaro Herrera 提交于
This lets files that are mere users of ResourceOwner not automatically include the headers for stuff that is managed by the resowner mechanism.
-
由 Alvaro Herrera 提交于
-
由 Tom Lane 提交于
Per Peter Geoghegan.
-
由 Tom Lane 提交于
Since we're not installing this file anymore, it has no reason to exist, other than as historical reference; but we have an SCM for that.
-
由 Bruce Momjian 提交于
percentage column before count column. Docs updated.
-
由 Bruce Momjian 提交于
has no space before it. Report by Erik Rijkers
-
由 Bruce Momjian 提交于
Lane's correction.
-
- 28 8月, 2012 10 次提交
-
-
由 Alvaro Herrera 提交于
-
由 Peter Eisentraut 提交于
-
由 Bruce Momjian 提交于
David E. Wheeler
-
由 Tom Lane 提交于
Clarify the compatibility notes about EXTRACT() and about statistics timing columns.
-
由 Tom Lane 提交于
This is so that these sections will have stable HTML tags that one can link to, rather than things like "AEN1902". Perhaps we should mount a campaign to do this everywhere, but I've found myself pointing at syntax.sgml subsections often enough to be sure it's useful here.
-
由 Bruce Momjian 提交于
pg_restore.
-
由 Alvaro Herrera 提交于
The previous signature made it very easy to pass something other than the printf-format specifier in the corresponding position, without any warning from the compiler. While at it, move some of the escaping, redirecting and quoting responsibilities from the callers into exec_prog() itself. This makes the callsites cleaner.
-
由 Alvaro Herrera 提交于
It was confusing symlinks with hard links.
-
由 Alvaro Herrera 提交于
-