*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/executor/execQual.c,v 1.94 2002/06/20 20:29:27 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/executor/execQual.c,v 1.95 2002/07/04 15:23:29 thomas Exp $
*
*-------------------------------------------------------------------------
*/
static Datum ExecEvalVar(Var *variable, ExprContext *econtext, bool *isNull);
static Datum ExecEvalOper(Expr *opClause, ExprContext *econtext,
bool *isNull, ExprDoneCond *isDone);
+static Datum ExecEvalDistinct(Expr *opClause, ExprContext *econtext,
+ bool *isNull, ExprDoneCond *isDone);
static Datum ExecEvalFunc(Expr *funcClause, ExprContext *econtext,
bool *isNull, ExprDoneCond *isDone);
static ExprDoneCond ExecEvalFuncArgs(FunctionCallInfo fcinfo,
/* ----------------------------------------------------------------
* ExecEvalOper
+ * ExecEvalDistinct
* ExecEvalFunc
*
* Evaluate the functional result of a list of arguments by calling the
isNull, isDone);
}
+/* ----------------------------------------------------------------
+ * ExecEvalDistinct
+ *
+ * IS DISTINCT FROM must evaluate arguments to determine whether
+ * they are NULL; if either is NULL then the result is already
+ * known. If neither is NULL, then proceed to evaluate the
+ * function. Note that this is *always* derived from the equals
+ * operator, but since we've already evaluated the arguments
+ * we can not simply reuse ExecEvalOper() or ExecEvalFunc().
+ * ----------------------------------------------------------------
+ */
+static Datum
+ExecEvalDistinct(Expr *opClause,
+ ExprContext *econtext,
+ bool *isNull,
+ ExprDoneCond *isDone)
+{
+ bool result;
+ FunctionCachePtr fcache;
+ FunctionCallInfoData fcinfo;
+ ExprDoneCond argDone;
+ Oper *op;
+ List *argList;
+
+ /*
+ * we extract the oid of the function associated with the op and then
+ * pass the work onto ExecMakeFunctionResult which evaluates the
+ * arguments and returns the result of calling the function on the
+ * evaluated arguments.
+ */
+ op = (Oper *) opClause->oper;
+ argList = opClause->args;
+
+ /*
+ * get the fcache from the Oper node. If it is NULL, then initialize
+ * it
+ */
+ fcache = op->op_fcache;
+ if (fcache == NULL)
+ {
+ fcache = init_fcache(op->opid, length(argList),
+ econtext->ecxt_per_query_memory);
+ op->op_fcache = fcache;
+ }
+ Assert(fcache->func.fn_retset == FALSE);
+
+ /* Need to prep callinfo structure */
+ MemSet(&fcinfo, 0, sizeof(fcinfo));
+ fcinfo.flinfo = &(fcache->func);
+ argDone = ExecEvalFuncArgs(&fcinfo, argList, econtext);
+ Assert(fcinfo->nargs == 2);
+
+ if (fcinfo.argnull[0] && fcinfo.argnull[1])
+ {
+ /* Both NULL? Then is not distinct... */
+ result = FALSE;
+ }
+ else if (fcinfo.argnull[0] || fcinfo.argnull[1])
+ {
+ /* One is NULL? Then is distinct... */
+ result = TRUE;
+ }
+ else
+ {
+ fcinfo.isnull = false;
+ result = FunctionCallInvoke(&fcinfo);
+ *isNull = fcinfo.isnull;
+
+ result = (!DatumGetBool(result));
+ }
+
+ return BoolGetDatum(result);
+}
+
/* ----------------------------------------------------------------
* ExecEvalFunc
* ----------------------------------------------------------------
case NOT_EXPR:
retDatum = ExecEvalNot(expr, econtext, isNull);
break;
+ case DISTINCT_EXPR:
+ retDatum = ExecEvalDistinct(expr, econtext,
+ isNull, isDone);
+ break;
case SUBPLAN_EXPR:
retDatum = ExecSubPlan((SubPlan *) expr->oper,
expr->args, econtext,
*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/optimizer/util/clauses.c,v 1.101 2002/06/20 20:29:31 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/optimizer/util/clauses.c,v 1.102 2002/07/04 15:23:58 thomas Exp $
*
* HISTORY
* AUTHOR DATE MAJOR EVENT
expr->typeOid = BOOLOID;
break;
case OP_EXPR:
+ case DISTINCT_EXPR:
expr->typeOid = ((Oper *) oper)->opresulttype;
break;
case FUNC_EXPR:
{
return (clause != NULL &&
IsA(clause, Expr) &&
- ((Expr *) clause)->opType == OP_EXPR);
+ ((((Expr *) clause)->opType == OP_EXPR) ||
+ ((Expr *) clause)->opType == DISTINCT_EXPR));
}
/*
/*
* expression_returns_set
- * Test whethe an expression returns a set result.
+ * Test whether an expression returns a set result.
*
* Because we use expression_tree_walker(), this can also be applied to
* whole targetlists; it'll produce TRUE if any one of the tlist items
switch (expr->opType)
{
case OP_EXPR:
+ case DISTINCT_EXPR:
if (((Oper *) expr->oper)->opretset)
return true;
/* else fall through to check args */
switch (expr->opType)
{
case OP_EXPR:
+ case DISTINCT_EXPR:
if (op_volatile(((Oper *) expr->oper)->opno) != PROVOLATILE_IMMUTABLE)
return true;
break;
switch (expr->opType)
{
case OP_EXPR:
+ case DISTINCT_EXPR:
if (op_volatile(((Oper *) expr->oper)->opno) == PROVOLATILE_VOLATILE)
return true;
break;
* expression_tree_mutator directly rather than recursing to self.
*/
args = (List *) expression_tree_mutator((Node *) expr->args,
- eval_const_expressions_mutator,
+ eval_const_expressions_mutator,
(void *) context);
switch (expr->opType)
* args
*/
break;
+ case DISTINCT_EXPR:
+ {
+ List *arg;
+ bool has_null_input = false;
+ bool all_null_input = true;
+ bool has_nonconst_input = false;
+
+ /*
+ * Check for constant inputs and especially constant-NULL inputs.
+ */
+ Assert(length(args) == 2);
+ foreach(arg, args)
+ {
+ if (IsA(lfirst(arg), Const))
+ {
+ has_null_input |= ((Const *) lfirst(arg))->constisnull;
+ all_null_input &= ((Const *) lfirst(arg))->constisnull;
+ }
+ else
+ {
+ has_nonconst_input = true;
+ }
+ }
+ /* all nulls? then not distinct */
+ if (all_null_input)
+ return MAKEBOOLCONST(false, false);
+
+ /* one null? then distinct */
+ if (has_null_input)
+ return MAKEBOOLCONST(true, false);
+
+ /* all constants? then optimize this out */
+ if (!has_nonconst_input)
+ {
+ Oid result_typeid;
+ int16 resultTypLen;
+ bool resultTypByVal;
+ ExprContext *econtext;
+ Datum const_val;
+ bool const_is_null;
+
+ Oper *oper = (Oper *) expr->oper;
+ replace_opid(oper); /* OK to scribble on input to this extent */
+ result_typeid = oper->opresulttype;
+
+ /*
+ * OK, looks like we can simplify this operator/function.
+ *
+ * We use the executor's routine ExecEvalExpr() to avoid duplication of
+ * code and ensure we get the same result as the executor would get.
+ *
+ * Build a new Expr node containing the already-simplified arguments. The
+ * only other setup needed here is the replace_opid() that we already
+ * did for the OP_EXPR case.
+ */
+ newexpr = makeNode(Expr);
+ newexpr->typeOid = expr->typeOid;
+ newexpr->opType = expr->opType;
+ newexpr->oper = expr->oper;
+ newexpr->args = args;
+
+ /* Get info needed about result datatype */
+ get_typlenbyval(result_typeid, &resultTypLen, &resultTypByVal);
+
+ /*
+ * It is OK to pass a dummy econtext because none of the
+ * ExecEvalExpr() code used in this situation will use econtext. That
+ * might seem fortuitous, but it's not so unreasonable --- a constant
+ * expression does not depend on context, by definition, n'est ce pas?
+ */
+ econtext = MakeExprContext(NULL, CurrentMemoryContext);
+
+ const_val = ExecEvalExprSwitchContext((Node *) newexpr, econtext,
+ &const_is_null, NULL);
+
+ /* Must copy result out of sub-context used by expression eval */
+ if (!const_is_null)
+ const_val = datumCopy(const_val, resultTypByVal, resultTypLen);
+
+ FreeExprContext(econtext);
+ pfree(newexpr);
+
+ /*
+ * Make the constant result node.
+ */
+ return (Node *) makeConst(result_typeid, resultTypLen,
+ const_val, const_is_null,
+ resultTypByVal, false, false);
+ }
+ break;
+ }
case OR_EXPR:
{
*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/parser/gram.y,v 2.335 2002/07/01 15:27:55 tgl Exp $
+ * $Header: /cvsroot/pgsql/src/backend/parser/gram.y,v 2.336 2002/07/04 15:23:59 thomas Exp $
*
* HISTORY
* AUTHOR DATE MAJOR EVENT
static Node *makeFloatConst(char *str);
static Node *makeAConst(Value *v);
static Node *makeRowExpr(List *opr, List *largs, List *rargs);
+static Node *makeDistinctExpr(List *largs, List *rargs);
+static Node *makeRowNullTest(NullTestType test, List *args);
static DefElem *makeDefElem(char *name, Node *arg);
+static A_Const *makeBoolConst(bool state);
+static FuncCall *makeOverlaps(List *largs, List *rargs);
static SelectStmt *findLeftmostSelect(SelectStmt *node);
static void insertSelectOptions(SelectStmt *stmt,
List *sortClause, List *forUpdate,
%type columnDef
%type def_elem
%type def_arg, columnElem, where_clause, insert_column_item,
- a_expr, b_expr, c_expr, AexprConst,
+ a_expr, b_expr, c_expr, r_expr, AexprConst,
in_expr, having_clause, func_table
-%type row_descriptor, row_list, in_expr_nodes
-%type row_expr
+%type row, row_descriptor, row_list, in_expr_nodes
%type case_expr, case_arg, when_clause, case_default
%type when_clause_list
%type sub_type
SYSID,
TABLE, TEMP, TEMPLATE, TEMPORARY, THEN, TIME, TIMESTAMP,
- TO, TOAST, TRAILING, TRANSACTION, TRIGGER, TRIM, TRUE_P,
+ TO, TOAST, TRAILING, TRANSACTION, TREAT, TRIGGER, TRIM, TRUE_P,
TRUNCATE, TRUSTED, TYPE_P,
UNENCRYPTED, UNION, UNIQUE, UNKNOWN, UNLISTEN, UNTIL,
%nonassoc LIKE ILIKE SIMILAR
%nonassoc ESCAPE
%nonassoc OVERLAPS
-%nonassoc BETWEEN
+%nonassoc BETWEEN DISTINCT
%nonassoc IN_P
%left POSTFIXOP /* dummy for postfix Op rules */
%left Op OPERATOR /* multi-character ops and user-defined operators */
/* Expressions using row descriptors
* Define row_descriptor to allow yacc to break the reduce/reduce conflict
- * with singleton expressions.
+ * with singleton expressions. Use SQL99's ROW keyword to allow rows of
+ * one element.
*/
-row_expr: '(' row_descriptor ')' IN_P select_with_parens
+r_expr: row IN_P select_with_parens
{
SubLink *n = makeNode(SubLink);
- n->lefthand = $2;
+ n->lefthand = $1;
n->oper = (List *) makeSimpleA_Expr(OP, "=", NULL, NULL);
n->useor = FALSE;
n->subLinkType = ANY_SUBLINK;
- n->subselect = $5;
+ n->subselect = $3;
$$ = (Node *)n;
}
- | '(' row_descriptor ')' NOT IN_P select_with_parens
+ | row NOT IN_P select_with_parens
{
SubLink *n = makeNode(SubLink);
- n->lefthand = $2;
+ n->lefthand = $1;
n->oper = (List *) makeSimpleA_Expr(OP, "<>", NULL, NULL);
n->useor = TRUE;
n->subLinkType = ALL_SUBLINK;
- n->subselect = $6;
+ n->subselect = $4;
$$ = (Node *)n;
}
- | '(' row_descriptor ')' qual_all_Op sub_type select_with_parens
+ | row qual_all_Op sub_type select_with_parens
%prec Op
{
SubLink *n = makeNode(SubLink);
- n->lefthand = $2;
- n->oper = (List *) makeA_Expr(OP, $4, NULL, NULL);
- if (strcmp(strVal(llast($4)), "<>") == 0)
+ n->lefthand = $1;
+ n->oper = (List *) makeA_Expr(OP, $2, NULL, NULL);
+ if (strcmp(strVal(llast($2)), "<>") == 0)
n->useor = TRUE;
else
n->useor = FALSE;
- n->subLinkType = $5;
- n->subselect = $6;
+ n->subLinkType = $3;
+ n->subselect = $4;
$$ = (Node *)n;
}
- | '(' row_descriptor ')' qual_all_Op select_with_parens
+ | row qual_all_Op select_with_parens
%prec Op
{
SubLink *n = makeNode(SubLink);
- n->lefthand = $2;
- n->oper = (List *) makeA_Expr(OP, $4, NULL, NULL);
- if (strcmp(strVal(llast($4)), "<>") == 0)
+ n->lefthand = $1;
+ n->oper = (List *) makeA_Expr(OP, $2, NULL, NULL);
+ if (strcmp(strVal(llast($2)), "<>") == 0)
n->useor = TRUE;
else
n->useor = FALSE;
n->subLinkType = MULTIEXPR_SUBLINK;
- n->subselect = $5;
+ n->subselect = $3;
$$ = (Node *)n;
}
- | '(' row_descriptor ')' qual_all_Op '(' row_descriptor ')'
+ | row qual_all_Op row
%prec Op
{
- $$ = makeRowExpr($4, $2, $6);
+ $$ = makeRowExpr($2, $1, $3);
}
- | '(' row_descriptor ')' OVERLAPS '(' row_descriptor ')'
+ | row IS NULL_P
{
- FuncCall *n = makeNode(FuncCall);
- List *largs = $2;
- List *rargs = $6;
- n->funcname = SystemFuncName("overlaps");
- if (length(largs) == 1)
- largs = lappend(largs, $2);
- else if (length(largs) != 2)
- elog(ERROR, "Wrong number of parameters"
- " on left side of OVERLAPS expression");
- if (length(rargs) == 1)
- rargs = lappend(rargs, $6);
- else if (length(rargs) != 2)
- elog(ERROR, "Wrong number of parameters"
- " on right side of OVERLAPS expression");
- n->args = nconc(largs, rargs);
- n->agg_star = FALSE;
- n->agg_distinct = FALSE;
- $$ = (Node *)n;
+ $$ = makeRowNullTest(IS_NULL, $1);
+ }
+ | row IS NOT NULL_P
+ {
+ $$ = makeRowNullTest(IS_NOT_NULL, $1);
+ }
+ | row OVERLAPS row
+ {
+ $$ = (Node *)makeOverlaps($1, $3);
+ }
+ | row IS DISTINCT FROM row
+ {
+ /* IS DISTINCT FROM has the following rules for non-array types:
+ * a) the row lengths must be equal
+ * b) if both rows are zero-length, then they are not distinct
+ * c) if any element is distinct, the rows are distinct
+ * The rules for an element being distinct:
+ * a) if the elements are both NULL, then they are not distinct
+ * b) if the elements compare to be equal, then they are not distinct
+ * c) otherwise, they are distinct
+ */
+ List *largs = $1;
+ List *rargs = $5;
+ /* lengths don't match? then complain */
+ if (length(largs) != length(rargs))
+ {
+ elog(ERROR, "Unequal number of entries in row expression");
+ }
+ /* both are zero-length rows? then they are not distinct */
+ else if (length(largs) <= 0)
+ {
+ $$ = (Node *)makeBoolConst(FALSE);
+ }
+ /* otherwise, we need to compare each element */
+ else
+ {
+ $$ = (Node *)makeDistinctExpr(largs, rargs);
+ }
}
;
+/* Explicit row production.
+ * SQL99 allows an optional ROW keyword, so we can now do single-element productions
+ * without conflicting with the parenthesized a_expr production.
+ */
+row: ROW '(' row_descriptor ')' { $$ = $3; }
+ | ROW '(' a_expr ')' { $$ = makeList1($3); }
+ | ROW '(' ')' { $$ = NULL; }
+ | '(' row_descriptor ')' { $$ = $2; }
+;
+
row_descriptor:
row_list ',' a_expr { $$ = lappend($1, $3); }
;
* Allow two SQL extensions
* a ISNULL
* a NOTNULL
- * NOTE: this is not yet fully SQL-compatible, since SQL92
- * allows a row constructor as argument, not just a scalar.
*/
| a_expr ISNULL
{
n->nulltesttype = IS_NOT_NULL;
$$ = (Node *)n;
}
- /* IS TRUE, IS FALSE, etc used to be function calls
- * but let's make them expressions to allow the optimizer
- * a chance to eliminate them if a_expr is a constant string.
- * - thomas 1997-12-22
- *
- * Created BooleanTest Node type, and changed handling
- * for NULL inputs
- * - jec 2001-06-18
- */
| a_expr IS TRUE_P
{
BooleanTest *b = makeNode(BooleanTest);
b->booltesttype = IS_NOT_UNKNOWN;
$$ = (Node *)b;
}
+ | a_expr IS DISTINCT FROM a_expr %prec DISTINCT
+ { $$ = (Node *) makeSimpleA_Expr(DISTINCT, "=", $1, $5); }
| a_expr BETWEEN b_expr AND b_expr %prec BETWEEN
{
$$ = (Node *) makeA_Expr(AND, NIL,
{
SubLink *n = (SubLink *)$3;
n->lefthand = makeList1($1);
- n->oper = (List *) makeSimpleA_Expr(OP, "=",
- NULL, NULL);
+ n->oper = (List *) makeSimpleA_Expr(OP, "=", NULL, NULL);
n->useor = FALSE;
n->subLinkType = ANY_SUBLINK;
$$ = (Node *)n;
foreach(l, (List *) $3)
{
Node *cmp;
- cmp = (Node *) makeSimpleA_Expr(OP, "=",
- $1, lfirst(l));
+ cmp = (Node *) makeSimpleA_Expr(OP, "=", $1, lfirst(l));
if (n == NULL)
n = cmp;
else
{
SubLink *n = (SubLink *)$4;
n->lefthand = makeList1($1);
- n->oper = (List *) makeSimpleA_Expr(OP, "<>",
- NULL, NULL);
+ n->oper = (List *) makeSimpleA_Expr(OP, "<>", NULL, NULL);
n->useor = FALSE;
n->subLinkType = ALL_SUBLINK;
$$ = (Node *)n;
foreach(l, (List *) $4)
{
Node *cmp;
- cmp = (Node *) makeSimpleA_Expr(OP, "<>",
- $1, lfirst(l));
+ cmp = (Node *) makeSimpleA_Expr(OP, "<>", $1, lfirst(l));
if (n == NULL)
n = cmp;
else
n->subselect = $4;
$$ = (Node *)n;
}
- | row_expr
+ | r_expr
{ $$ = $1; }
;
{ $$ = (Node *) makeA_Expr(OP, $1, NULL, $2); }
| b_expr qual_Op %prec POSTFIXOP
{ $$ = (Node *) makeA_Expr(OP, $2, $1, NULL); }
+ | b_expr IS DISTINCT FROM b_expr %prec Op
+ { $$ = (Node *) makeSimpleA_Expr(DISTINCT, "=", $1, $5); }
;
/*
n->indirection = $5;
$$ = (Node *)n;
}
- | CAST '(' a_expr AS Typename ')'
- { $$ = makeTypeCast($3, $5); }
| case_expr
{ $$ = $1; }
| func_name '(' ')'
n->agg_distinct = FALSE;
$$ = (Node *)n;
}
+ | CAST '(' a_expr AS Typename ')'
+ { $$ = makeTypeCast($3, $5); }
| EXTRACT '(' extract_list ')'
{
FuncCall *n = makeNode(FuncCall);
n->agg_distinct = FALSE;
$$ = (Node *)n;
}
+ | TREAT '(' a_expr AS Typename ')'
+ {
+ /* TREAT(expr AS target) converts expr of a particular type to target,
+ * which is defined to be a subtype of the original expression.
+ * In SQL99, this is intended for use with structured UDTs,
+ * but let's make this a generally useful form allowing stronger
+ * coersions than are handled by implicit casting.
+ */
+ FuncCall *n = makeNode(FuncCall);
+ /* Convert SystemTypeName() to SystemFuncName() even though
+ * at the moment they result in the same thing.
+ */
+ n->funcname = SystemFuncName(((Value *)llast($5->names))->val.str);
+ n->args = makeList1($3);
+ $$ = (Node *)n;
+ }
| TRIM '(' BOTH trim_list ')'
{
/* various trim expressions are defined in SQL92
}
| TRUE_P
{
- A_Const *n = makeNode(A_Const);
- n->val.type = T_String;
- n->val.val.str = "t";
- n->typename = SystemTypeName("bool");
- $$ = (Node *)n;
+ $$ = (Node *)makeBoolConst(TRUE);
}
| FALSE_P
{
- A_Const *n = makeNode(A_Const);
- n->val.type = T_String;
- n->val.val.str = "f";
- n->typename = SystemTypeName("bool");
- $$ = (Node *)n;
+ $$ = (Node *)makeBoolConst(FALSE);
}
| NULL_P
{
| RETURNS
| REVOKE
| ROLLBACK
- | ROW
| RULE
| SCHEMA
| SCROLL
| OVERLAY
| POSITION
| REAL
+ | ROW
| SETOF
| SMALLINT
| SUBSTRING
| THEN
| TO
| TRAILING
+ | TREAT
| TRUE_P
| UNION
| UNIQUE
return f;
}
+/* makeBoolConst()
+ * Create an A_Const node and initialize to a boolean constant.
+ */
+static A_Const *
+makeBoolConst(bool state)
+{
+ A_Const *n = makeNode(A_Const);
+ n->val.type = T_String;
+ n->val.val.str = (state? "t": "f");
+ n->typename = SystemTypeName("bool");
+ return n;
+}
+
/* makeRowExpr()
* Generate separate operator nodes for a single row descriptor expression.
* Perhaps this should go deeper in the parser someday...
return expr;
}
+/* makeDistinctExpr()
+ * Generate separate operator nodes for a single row descriptor expression.
+ * Same comments as for makeRowExpr().
+ */
+static Node *
+makeDistinctExpr(List *largs, List *rargs)
+{
+ Node *expr = NULL;
+ Node *larg, *rarg;
+
+ if (length(largs) != length(rargs))
+ elog(ERROR, "Unequal number of entries in row expression");
+
+ if (lnext(largs) != NIL)
+ expr = makeDistinctExpr(lnext(largs), lnext(rargs));
+
+ larg = lfirst(largs);
+ rarg = lfirst(rargs);
+
+ if (expr == NULL)
+ expr = (Node *) makeSimpleA_Expr(DISTINCT, "=", larg, rarg);
+ else
+ expr = (Node *) makeA_Expr(OR, NIL, expr,
+ (Node *) makeSimpleA_Expr(DISTINCT, "=",
+ larg, rarg));
+
+ return expr;
+}
+
+/* makeRowNullTest()
+ * Generate separate operator nodes for a single row descriptor test.
+ */
+static Node *
+makeRowNullTest(NullTestType test, List *args)
+{
+ Node *expr = NULL;
+ Node *arg;
+ NullTest *n;
+
+ if (lnext(args) != NIL)
+ expr = makeRowNullTest(test, lnext(args));
+
+ arg = lfirst(args);
+
+ n = makeNode(NullTest);
+ n->arg = arg;
+ n->nulltesttype = test;
+
+ if (expr == NULL)
+ expr = (Node *)n;
+ else if (test == IS_NOT_NULL)
+ expr = (Node *) makeA_Expr(OR, NIL, expr, (Node *)n);
+ else
+ expr = (Node *) makeA_Expr(AND, NIL, expr, (Node *)n);
+
+ return expr;
+}
+
+/* makeOverlaps()
+ * Create and populate a FuncCall node to support the OVERLAPS operator.
+ */
+static FuncCall *
+makeOverlaps(List *largs, List *rargs)
+{
+ FuncCall *n = makeNode(FuncCall);
+ n->funcname = SystemFuncName("overlaps");
+ if (length(largs) == 1)
+ largs = lappend(largs, largs);
+ else if (length(largs) != 2)
+ elog(ERROR, "Wrong number of parameters"
+ " on left side of OVERLAPS expression");
+ if (length(rargs) == 1)
+ rargs = lappend(rargs, rargs);
+ else if (length(rargs) != 2)
+ elog(ERROR, "Wrong number of parameters"
+ " on right side of OVERLAPS expression");
+ n->args = nconc(largs, rargs);
+ n->agg_star = FALSE;
+ n->agg_distinct = FALSE;
+ return n;
+}
+
/* findLeftmostSelect()
- * Find the leftmost component SelectStmt in a set-operation parsetree.
+ * Find the leftmost component SelectStmt in a set-operation parsetree.
*/
static SelectStmt *
findLeftmostSelect(SelectStmt *node)
}
/* insertSelectOptions()
- * Insert ORDER BY, etc into an already-constructed SelectStmt.
+ * Insert ORDER BY, etc into an already-constructed SelectStmt.
*
* This routine is just to avoid duplicating code in SelectStmt productions.
*/
}
/* SystemFuncName()
- * Build a properly-qualified reference to a built-in function.
+ * Build a properly-qualified reference to a built-in function.
*/
List *
SystemFuncName(char *name)
}
/* SystemTypeName()
- * Build a properly-qualified reference to a built-in type.
+ * Build a properly-qualified reference to a built-in type.
*
* typmod is defaulted, but may be changed afterwards by caller.
*/
return n;
}
-/*
+/* parser_init()
* Initialize to parse one query string
*/
void
pfunc_num_args = nargs;
}
-/*
+/* param_type()
* Fetch a parameter type previously passed to parser_init
*/
Oid
return param_type_info[t - 1];
}
-/*
+/* exprIsNullConstant()
* Test whether an a_expr is a plain NULL constant or not.
*/
bool
return FALSE;
}
-/*
- * doNegate --- handle negation of a numeric constant.
+/* doNegate()
+ * Handle negation of a numeric constant.
*
* Formerly, we did this here because the optimizer couldn't cope with
* indexquals that looked like "var = -4" --- it wants "var = const"
projects / postgresql.git / commitdiff