| Commit message (Collapse) | Author | Age |
|---|
| ... | |
| |
|
|
| |
compiler warnings about an unused variable.
|
| |
|
|
|
|
|
|
|
|
| |
lists are now plain old garden-variety Lists, allocated with palloc,
rather than specialized expansible-array data allocated with malloc.
This substantially simplifies their handling and eliminates several
sources of memory leakage.
Several basic types of erroneous queries (syntax error, attempt to
insert a duplicate key into a unique index) now demonstrably leak
zero bytes per query.
|
| |
|
|
|
|
|
| |
in Resdom and GroupClause so changing of resno's doesn't confuse
the grouping any more.
Jan
|
| |
|
|
|
| |
including the following in your Makefile.custom:
CFLAGS+= -DENABLE_OUTER_JOINS -DEXEC_MERGEJOINDEBUG
|
| | |
|
| |
|
|
|
|
|
| |
when parsestate in makeRangeTable() already contains an
opened p_target_relation.
Jan
|
| |
|
|
| |
Remove _all_ PARSEDEBUG print statements.
|
| | |
|
| |
|
|
|
| |
rewrite system. Restructure parse_target to make it easier to
understand.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
I have attached a patch to allow GROUP BY and/or ORDER BY function or
expressions. Note worthy items:
1. The expression or function need not be in the target list.
Example:
SELECT name FROM foo GROUP BY lower(name);
2. Simplified the grammar to use expressions only.
3. Cleaned up earlier patch in this area to make use of existing
utility functions.
3. Reduced some of the members in the SortGroupBy parse node. The
original data members were redundant with the new expression node.
(MUST do a "make clean" now)
4. Added a new parse node "JoinUsing". The JOIN USING clause was
overloading this SortGroupBy structure. With the afore mentioned
reduction of members, the two clauses lost all their commonality.
5. A bug still exist where, if a function or expression is GROUPed BY,
and an aggregate function does not include a attribute from the
expression or function, the backend crashes. (or something like
that) The bug pre-dates this patch. Example:
SELECT lower(a) AS lowcase, count(b) FROM foo GROUP BY lowcase;
*** BOOM ***
--Also when not in target list
SELECT count(b) FROM foo GROUP BY lower(a);
*** BOOM AGAIN ***
|
| |
|
|
|
|
|
|
|
|
| |
There are three or four cases in transformSortClause() and I had fixed
only one case for UNION. A second case is now fixed, in the same way; I
assigned INT4OID to the column type for the "won't actually happen"
sort. Didn't want to skip the code entirely, since the backend needs to
_try_ a sort to get the NULLs right. I'm not certain under what
circumstances the other cases are invoked and these are not yet
fixed up, though perhaps they don't need to be...
|
| |
|
|
| |
SELECT 1 UNION SELECT NULL;
|
| | |
|
| |
|
|
|
|
| |
Used in the generic "CREATE xxx" parsing.
Do some automatic type conversion for inserts from other columns.
Previous trouble with "resjunk" regression test remains for now.
|
| |
|
|
| |
condition where the target label is ambiguous.
|
| |
|
|
|
|
|
|
|
|
|
| |
Currently force the type to match the _first_ select in the union.
Move oper_select_candidate() from parse_func.c to parse_oper.c.
Throw error inside of oper_inexact() if no match for binary operators.
Check more carefully that types can be coerced
even if there is only one candidate operator in oper_inexact().
Fix up error messages for more uniform look.
Remove unused code.
Fix up comments.
|
| |
|
|
|
| |
Here is a patch to remove the requirement that ORDER/GROUP BY clause
identifiers be included in the target list.
|
| |
|
|
| |
or ORDER BY bug.
|
| |
|
|
| |
and SELECT manual pages and psql help.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Add lock to i386 asm.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
