aboutsummaryrefslogtreecommitdiff
path: root/src/backend
Commit message (Collapse)AuthorAge
...
* ExecReScanGroup() forgot to clear grpstate->grp_firstTuple,Tom Lane1999-07-11
| | | | thereby guaranteeing wrong results from a rescanned Group node.
* Fix tuplecmp() to ensure repeatable sort ordering of tuplesTom Lane1999-07-10
| | | | | | that contain null fields. Old code would produce erratic sort results because comparisons of tuples containing nulls could produce inconsistent answers.
* cleanup of long long int atoi test.Bruce Momjian1999-07-10
|
* Make ^ precidence greater than *.Bruce Momjian1999-07-09
|
* Re-apply range check patch after fixing LIMIT_H test and defines.Bruce Momjian1999-07-09
|
* Another place that HAVE_LIMITS_H was misspelled.Tom Lane1999-07-09
|
* cleanupBruce Momjian1999-07-09
|
* Fix for ACL length problem on different platforms.Bruce Momjian1999-07-09
|
* Backup pg_atoi patch for long checking. Caused initdb problems.Bruce Momjian1999-07-09
|
* > In both datetime_trunc() and timespan_trunc() in dt.c,Bruce Momjian1999-07-08
| | | | | | | | | > the DTK_MICROSEC case is just like the DTK_MILLISEC case. > I think this is wrong and it ought to look like > fsec = rint(fsec * 1000000) / 1000000; > no? Tom Lane.
* Rename pg_temp to pg_sorttemp so it does not conflict with temp table names.Bruce Momjian1999-07-08
|
* pg_atoi() does range check on int4 data only ifBruce Momjian1999-07-08
| | | | | | | | | | | | "HAS_LONG_LONG" is defined based on the assumption that strtol() would return ERANGE if a platform does not support 64-bit integers. In current PostgreSQL 6.5 (and 6.4.2) distribution, "HAS_LONG_LONG" is defined only if platform is "alpha". (See include/port/alpha.h) I think the int4 range check should apply to linux_alpha as well. (I have not tested yet but I guess this might be applicable to newer Linux/i386 distributions which includes new GCC which implements long int as 64-bit int.)
* Add ^ precidence.Bruce Momjian1999-07-08
|
* Allow port numbers 32k - 64k.Bruce Momjian1999-07-07
|
* Fix for \do and ceil()/float.Bruce Momjian1999-07-07
|
* Fix spelling of variable name.Bruce Momjian1999-07-07
|
* Cleanup of min tuple size.Bruce Momjian1999-07-07
|
* Fix misspelling.Bruce Momjian1999-07-07
|
* Clean up maximum rewrite tuple length.Bruce Momjian1999-07-04
|
* Clarify maximum tuple and max attribute lengths.Bruce Momjian1999-07-04
|
* Add abortcurrent trans to temp table fix.Bruce Momjian1999-07-03
|
* Update tuple size check.Bruce Momjian1999-07-03
|
* Fix for insertion of tuple too large.Bruce Momjian1999-07-03
|
* Fix to prevent too large tuple from being created.Bruce Momjian1999-07-03
|
* Fix for removal of temp tables if last transaction was aborted.Bruce Momjian1999-07-02
|
* typo fix.Bruce Momjian1999-07-02
|
* Avoid disk writes for read-only transactions.Vadim B. Mikheev1999-06-29
|
* Add var defines for no testandsetBruce Momjian1999-06-26
|
* Replace rewriter's checkQueryHasAggs and checkQueryHasSubLinkTom Lane1999-06-21
| | | | | | | | with expression_tree_walker-based code. The former failed to cope with expressions containing SubLinks, and the latter returned TRUE for both SubLinks and Aggrefs (cut-and-paste bug?). There is a lot more scope for using expression_tree_walker in this module, but I'll restrain myself until the 6.6 split occurs from touching not-demonstrably-broken code.
* Clean up problems with sublinks + grouping in planner. NotTom Lane1999-06-21
| | | | | sure if they are all fixed, because rewriter is now the stumbling block, but at least some cases work that did not work before.
* On second thought, expression_tree_walker should handle bareTom Lane1999-06-21
| | | | SubLink nodes after all ...
* I have a small patch for 6.5.Bruce Momjian1999-06-19
| | | | | | aclchk.c: heap_close() is not called after calling heap_openr(). Atsushi Ogawa
* Rename to vararg_format().Bruce Momjian1999-06-19
|
* Change form() to varargform() to prevent portability problems.Bruce Momjian1999-06-19
|
* My first chosen victim for expression_tree_walker conversionTom Lane1999-06-19
| | | | | | | | | | | | is parse_aggs.c. This fixes its failure to cope with (at least) CaseExpr and ArrayRef nodes, which is the reason why both of these fail in 6.5: select coalesce(f1,0) from int4_tbl group by f1; ERROR: Illegal use of aggregates or non-group column in target list select sentence.words[0] from sentence group by sentence.words[0]; ERROR: Illegal use of aggregates or non-group column in target list The array case still fails, but at least it's not parse_agg's fault anymore ... considering that we now support CASE officially, I think it's important to fix the first example ...
* Create a generic expression-tree-walker subroutine, whichTom Lane1999-06-19
| | | | | | will gradually replace all of the boilerplate tree-walk-recursion code that currently exists in O(N) slightly different forms in N subroutines. I've had it with adding missing cases to these subroutines...
* Temporarily disable error checks for missing selectivityTom Lane1999-06-19
| | | | | functions, in order to work around oversight in 6.5 release: rtree index functions haven't got any. Mea culpa ...
* Patch to allow vacuum on multi-segment tables, from Hiroshi InoueBruce Momjian1999-06-18
|
* Explain didn't handle inheritance correctly (it didn'tTom Lane1999-06-17
| | | | manipulate rtable the same way executor does).
* Defend against function calls with more than 8 arguments (codeTom Lane1999-06-17
| | | | | used to overrun its fixed-size arrays before detecting error; not cool). Also, replace uses of magic constant '8' with 'MAXFARGS'.
* Remove QUERY_LIMIT and documenation on same. Change _ALIGN to TYPEALIGNBruce Momjian1999-06-17
| | | | for Irix.
* CleanupBruce Momjian1999-06-16
|
* Move default NBuffers setting into config.h, and rename itTom Lane1999-06-12
| | | | | to DEF_NBUFFERS for readability. Make sure the default value is OK according to postmaster.c's new sanity check for -B values.
* Fix critical error noticed by Massimo: copy.c used to have aTom Lane1999-06-12
| | | | | | | | | special hack to ensure it would close its output file even after failure due to elog(ERROR) partway through the copy. This is now unnecessary because fd.c takes care of cleaning up open files at transaction abort; worse, after fd.c closed the file copy.c would try to do so *again* at the start of the next COPY command. This would result in havoc in most implementations of stdio library.
* Remove query_planner's overhasty rejection of cases whereTom Lane1999-06-12
| | | | | | | | | | | | tlist and qual are NULL. It ought to handle these the same as the cases where tlist contains only constant expressions, ie, be willing to generate a Result-node plan. This did not use to matter, but it does now because union_planner will flatten the tlist when aggregates are present. Thus, 'select count(1) from table' now causes query_planner to be given a null tlist, and to duplicate 6.4's behavior we need it to give back a Result plan rather than refusing the query. 6.4 was arguably doing the Wrong Thing for this query, but I'm not going to open a semantics issue right before 6.5 release ... can revisit that problem later.
* Plug hole in dike: planner would coredump if query_plannerTom Lane1999-06-12
| | | | | | | | returned NULL, which it will do in some cases where an elog(ERROR) would probably be more appropriate. For the moment, generate a not-very- informative error message rather than proceeding to certain coredump. Probably ought to think about making query_planner elog instead of returning NULL, but this is at least a safe change for now.
* When targetlist is NULL, ExecTargetList was passing back aTom Lane1999-06-12
| | | | | | | | pointer to palloc'd but uninitialized memory. This is not cool; anyone looking at the returned 'tuple' would at best coredump and at worst behave in a bizarre and irreproducible way. Fix it to return a predictable value, namely a correctly-set-up palloc'd tuple containing zero attributes. I believe this fix is both safe and critical.
* Reversed out Massimo patch.Bruce Momjian1999-06-12
|
* I don't like last minute patches before the final freeze, but I believe thatBruce Momjian1999-06-12
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | this one could be useful for people experiencing out-of-memory crashes while executing queries which retrieve or use a very large number of tuples. The problem happens when storage is allocated for functions results used in a large query, for example: select upper(name) from big_table; select big_table.array[1] from big_table; select count(upper(name)) from big_table; This patch is a dirty hack that fixes the out-of-memory problem for the most common cases, like the above ones. It is not the final solution for the problem but it can work for some people, so I'm posting it. The patch should be safe because all changes are under #ifdef. Furthermore the feature can be enabled or disabled at runtime by the `free_tuple_memory' options in the pg_options file. The option is disabled by default and must be explicitly enabled at runtime to have any effect. To enable the patch add the follwing line to Makefile.custom: CUSTOM_COPT += -DFREE_TUPLE_MEMORY To enable the option at runtime add the following line to pg_option: free_tuple_memory=1 Massimo
* Change Assert(Ptp.t_data->t_xmax == tp.t_data->t_xmin) to :Vadim B. Mikheev1999-06-11
| | | | | | | | | | | | | | | | | /* * Read above about cases when !ItemIdIsUsed(Citemid) * (child item is removed)... Due to the fact that * at the moment we don't remove unuseful part of * update-chain, it's possible to get too old * parent row here. Like as in the case which * caused this problem, we stop shrinking here. * I could try to find real parent row but want * not to do it because of real solution will * be implemented anyway, latter, and we are too * close to 6.5 release. - vadim 06/11/99 */ if (Ptp.t_data->t_xmax != tp.t_data->t_xmin) ...