mirror of
https://github.com/postgres/postgres.git
synced 2025-06-26 12:21:12 +03:00
Add const qualifiers to node inspection functions
Thomas Munro
This commit is contained in:
@ -32,7 +32,7 @@ static int leftmostLoc(int loc1, int loc2);
|
||||
* returns the Oid of the type of the expression's result.
|
||||
*/
|
||||
Oid
|
||||
exprType(Node *expr)
|
||||
exprType(const Node *expr)
|
||||
{
|
||||
Oid type;
|
||||
|
||||
@ -42,23 +42,23 @@ exprType(Node *expr)
|
||||
switch (nodeTag(expr))
|
||||
{
|
||||
case T_Var:
|
||||
type = ((Var *) expr)->vartype;
|
||||
type = ((const Var *) expr)->vartype;
|
||||
break;
|
||||
case T_Const:
|
||||
type = ((Const *) expr)->consttype;
|
||||
type = ((const Const *) expr)->consttype;
|
||||
break;
|
||||
case T_Param:
|
||||
type = ((Param *) expr)->paramtype;
|
||||
type = ((const Param *) expr)->paramtype;
|
||||
break;
|
||||
case T_Aggref:
|
||||
type = ((Aggref *) expr)->aggtype;
|
||||
type = ((const Aggref *) expr)->aggtype;
|
||||
break;
|
||||
case T_WindowFunc:
|
||||
type = ((WindowFunc *) expr)->wintype;
|
||||
type = ((const WindowFunc *) expr)->wintype;
|
||||
break;
|
||||
case T_ArrayRef:
|
||||
{
|
||||
ArrayRef *arrayref = (ArrayRef *) expr;
|
||||
const ArrayRef *arrayref = (const ArrayRef *) expr;
|
||||
|
||||
/* slice and/or store operations yield the array type */
|
||||
if (arrayref->reflowerindexpr || arrayref->refassgnexpr)
|
||||
@ -68,19 +68,19 @@ exprType(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_FuncExpr:
|
||||
type = ((FuncExpr *) expr)->funcresulttype;
|
||||
type = ((const FuncExpr *) expr)->funcresulttype;
|
||||
break;
|
||||
case T_NamedArgExpr:
|
||||
type = exprType((Node *) ((NamedArgExpr *) expr)->arg);
|
||||
type = exprType((Node *) ((const NamedArgExpr *) expr)->arg);
|
||||
break;
|
||||
case T_OpExpr:
|
||||
type = ((OpExpr *) expr)->opresulttype;
|
||||
type = ((const OpExpr *) expr)->opresulttype;
|
||||
break;
|
||||
case T_DistinctExpr:
|
||||
type = ((DistinctExpr *) expr)->opresulttype;
|
||||
type = ((const DistinctExpr *) expr)->opresulttype;
|
||||
break;
|
||||
case T_NullIfExpr:
|
||||
type = ((NullIfExpr *) expr)->opresulttype;
|
||||
type = ((const NullIfExpr *) expr)->opresulttype;
|
||||
break;
|
||||
case T_ScalarArrayOpExpr:
|
||||
type = BOOLOID;
|
||||
@ -90,7 +90,7 @@ exprType(Node *expr)
|
||||
break;
|
||||
case T_SubLink:
|
||||
{
|
||||
SubLink *sublink = (SubLink *) expr;
|
||||
const SubLink *sublink = (const SubLink *) expr;
|
||||
|
||||
if (sublink->subLinkType == EXPR_SUBLINK ||
|
||||
sublink->subLinkType == ARRAY_SUBLINK)
|
||||
@ -124,7 +124,7 @@ exprType(Node *expr)
|
||||
break;
|
||||
case T_SubPlan:
|
||||
{
|
||||
SubPlan *subplan = (SubPlan *) expr;
|
||||
const SubPlan *subplan = (const SubPlan *) expr;
|
||||
|
||||
if (subplan->subLinkType == EXPR_SUBLINK ||
|
||||
subplan->subLinkType == ARRAY_SUBLINK)
|
||||
@ -150,58 +150,58 @@ exprType(Node *expr)
|
||||
break;
|
||||
case T_AlternativeSubPlan:
|
||||
{
|
||||
AlternativeSubPlan *asplan = (AlternativeSubPlan *) expr;
|
||||
const AlternativeSubPlan *asplan = (const AlternativeSubPlan *) expr;
|
||||
|
||||
/* subplans should all return the same thing */
|
||||
type = exprType((Node *) linitial(asplan->subplans));
|
||||
}
|
||||
break;
|
||||
case T_FieldSelect:
|
||||
type = ((FieldSelect *) expr)->resulttype;
|
||||
type = ((const FieldSelect *) expr)->resulttype;
|
||||
break;
|
||||
case T_FieldStore:
|
||||
type = ((FieldStore *) expr)->resulttype;
|
||||
type = ((const FieldStore *) expr)->resulttype;
|
||||
break;
|
||||
case T_RelabelType:
|
||||
type = ((RelabelType *) expr)->resulttype;
|
||||
type = ((const RelabelType *) expr)->resulttype;
|
||||
break;
|
||||
case T_CoerceViaIO:
|
||||
type = ((CoerceViaIO *) expr)->resulttype;
|
||||
type = ((const CoerceViaIO *) expr)->resulttype;
|
||||
break;
|
||||
case T_ArrayCoerceExpr:
|
||||
type = ((ArrayCoerceExpr *) expr)->resulttype;
|
||||
type = ((const ArrayCoerceExpr *) expr)->resulttype;
|
||||
break;
|
||||
case T_ConvertRowtypeExpr:
|
||||
type = ((ConvertRowtypeExpr *) expr)->resulttype;
|
||||
type = ((const ConvertRowtypeExpr *) expr)->resulttype;
|
||||
break;
|
||||
case T_CollateExpr:
|
||||
type = exprType((Node *) ((CollateExpr *) expr)->arg);
|
||||
type = exprType((Node *) ((const CollateExpr *) expr)->arg);
|
||||
break;
|
||||
case T_CaseExpr:
|
||||
type = ((CaseExpr *) expr)->casetype;
|
||||
type = ((const CaseExpr *) expr)->casetype;
|
||||
break;
|
||||
case T_CaseTestExpr:
|
||||
type = ((CaseTestExpr *) expr)->typeId;
|
||||
type = ((const CaseTestExpr *) expr)->typeId;
|
||||
break;
|
||||
case T_ArrayExpr:
|
||||
type = ((ArrayExpr *) expr)->array_typeid;
|
||||
type = ((const ArrayExpr *) expr)->array_typeid;
|
||||
break;
|
||||
case T_RowExpr:
|
||||
type = ((RowExpr *) expr)->row_typeid;
|
||||
type = ((const RowExpr *) expr)->row_typeid;
|
||||
break;
|
||||
case T_RowCompareExpr:
|
||||
type = BOOLOID;
|
||||
break;
|
||||
case T_CoalesceExpr:
|
||||
type = ((CoalesceExpr *) expr)->coalescetype;
|
||||
type = ((const CoalesceExpr *) expr)->coalescetype;
|
||||
break;
|
||||
case T_MinMaxExpr:
|
||||
type = ((MinMaxExpr *) expr)->minmaxtype;
|
||||
type = ((const MinMaxExpr *) expr)->minmaxtype;
|
||||
break;
|
||||
case T_XmlExpr:
|
||||
if (((XmlExpr *) expr)->op == IS_DOCUMENT)
|
||||
if (((const XmlExpr *) expr)->op == IS_DOCUMENT)
|
||||
type = BOOLOID;
|
||||
else if (((XmlExpr *) expr)->op == IS_XMLSERIALIZE)
|
||||
else if (((const XmlExpr *) expr)->op == IS_XMLSERIALIZE)
|
||||
type = TEXTOID;
|
||||
else
|
||||
type = XMLOID;
|
||||
@ -213,19 +213,19 @@ exprType(Node *expr)
|
||||
type = BOOLOID;
|
||||
break;
|
||||
case T_CoerceToDomain:
|
||||
type = ((CoerceToDomain *) expr)->resulttype;
|
||||
type = ((const CoerceToDomain *) expr)->resulttype;
|
||||
break;
|
||||
case T_CoerceToDomainValue:
|
||||
type = ((CoerceToDomainValue *) expr)->typeId;
|
||||
type = ((const CoerceToDomainValue *) expr)->typeId;
|
||||
break;
|
||||
case T_SetToDefault:
|
||||
type = ((SetToDefault *) expr)->typeId;
|
||||
type = ((const SetToDefault *) expr)->typeId;
|
||||
break;
|
||||
case T_CurrentOfExpr:
|
||||
type = BOOLOID;
|
||||
break;
|
||||
case T_PlaceHolderVar:
|
||||
type = exprType((Node *) ((PlaceHolderVar *) expr)->phexpr);
|
||||
type = exprType((Node *) ((const PlaceHolderVar *) expr)->phexpr);
|
||||
break;
|
||||
default:
|
||||
elog(ERROR, "unrecognized node type: %d", (int) nodeTag(expr));
|
||||
@ -241,7 +241,7 @@ exprType(Node *expr)
|
||||
* if it can be determined. In many cases, it can't and we return -1.
|
||||
*/
|
||||
int32
|
||||
exprTypmod(Node *expr)
|
||||
exprTypmod(const Node *expr)
|
||||
{
|
||||
if (!expr)
|
||||
return -1;
|
||||
@ -249,14 +249,14 @@ exprTypmod(Node *expr)
|
||||
switch (nodeTag(expr))
|
||||
{
|
||||
case T_Var:
|
||||
return ((Var *) expr)->vartypmod;
|
||||
return ((const Var *) expr)->vartypmod;
|
||||
case T_Const:
|
||||
return ((Const *) expr)->consttypmod;
|
||||
return ((const Const *) expr)->consttypmod;
|
||||
case T_Param:
|
||||
return ((Param *) expr)->paramtypmod;
|
||||
return ((const Param *) expr)->paramtypmod;
|
||||
case T_ArrayRef:
|
||||
/* typmod is the same for array or element */
|
||||
return ((ArrayRef *) expr)->reftypmod;
|
||||
return ((const ArrayRef *) expr)->reftypmod;
|
||||
case T_FuncExpr:
|
||||
{
|
||||
int32 coercedTypmod;
|
||||
@ -267,21 +267,21 @@ exprTypmod(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_NamedArgExpr:
|
||||
return exprTypmod((Node *) ((NamedArgExpr *) expr)->arg);
|
||||
return exprTypmod((Node *) ((const NamedArgExpr *) expr)->arg);
|
||||
case T_NullIfExpr:
|
||||
{
|
||||
/*
|
||||
* Result is either first argument or NULL, so we can report
|
||||
* first argument's typmod if known.
|
||||
*/
|
||||
NullIfExpr *nexpr = (NullIfExpr *) expr;
|
||||
const NullIfExpr *nexpr = (const NullIfExpr *) expr;
|
||||
|
||||
return exprTypmod((Node *) linitial(nexpr->args));
|
||||
}
|
||||
break;
|
||||
case T_SubLink:
|
||||
{
|
||||
SubLink *sublink = (SubLink *) expr;
|
||||
const SubLink *sublink = (const SubLink *) expr;
|
||||
|
||||
if (sublink->subLinkType == EXPR_SUBLINK ||
|
||||
sublink->subLinkType == ARRAY_SUBLINK)
|
||||
@ -302,7 +302,7 @@ exprTypmod(Node *expr)
|
||||
break;
|
||||
case T_SubPlan:
|
||||
{
|
||||
SubPlan *subplan = (SubPlan *) expr;
|
||||
const SubPlan *subplan = (const SubPlan *) expr;
|
||||
|
||||
if (subplan->subLinkType == EXPR_SUBLINK ||
|
||||
subplan->subLinkType == ARRAY_SUBLINK)
|
||||
@ -320,27 +320,27 @@ exprTypmod(Node *expr)
|
||||
break;
|
||||
case T_AlternativeSubPlan:
|
||||
{
|
||||
AlternativeSubPlan *asplan = (AlternativeSubPlan *) expr;
|
||||
const AlternativeSubPlan *asplan = (const AlternativeSubPlan *) expr;
|
||||
|
||||
/* subplans should all return the same thing */
|
||||
return exprTypmod((Node *) linitial(asplan->subplans));
|
||||
}
|
||||
break;
|
||||
case T_FieldSelect:
|
||||
return ((FieldSelect *) expr)->resulttypmod;
|
||||
return ((const FieldSelect *) expr)->resulttypmod;
|
||||
case T_RelabelType:
|
||||
return ((RelabelType *) expr)->resulttypmod;
|
||||
return ((const RelabelType *) expr)->resulttypmod;
|
||||
case T_ArrayCoerceExpr:
|
||||
return ((ArrayCoerceExpr *) expr)->resulttypmod;
|
||||
return ((const ArrayCoerceExpr *) expr)->resulttypmod;
|
||||
case T_CollateExpr:
|
||||
return exprTypmod((Node *) ((CollateExpr *) expr)->arg);
|
||||
return exprTypmod((Node *) ((const CollateExpr *) expr)->arg);
|
||||
case T_CaseExpr:
|
||||
{
|
||||
/*
|
||||
* If all the alternatives agree on type/typmod, return that
|
||||
* typmod, else use -1
|
||||
*/
|
||||
CaseExpr *cexpr = (CaseExpr *) expr;
|
||||
const CaseExpr *cexpr = (const CaseExpr *) expr;
|
||||
Oid casetype = cexpr->casetype;
|
||||
int32 typmod;
|
||||
ListCell *arg;
|
||||
@ -366,14 +366,14 @@ exprTypmod(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_CaseTestExpr:
|
||||
return ((CaseTestExpr *) expr)->typeMod;
|
||||
return ((const CaseTestExpr *) expr)->typeMod;
|
||||
case T_ArrayExpr:
|
||||
{
|
||||
/*
|
||||
* If all the elements agree on type/typmod, return that
|
||||
* typmod, else use -1
|
||||
*/
|
||||
ArrayExpr *arrayexpr = (ArrayExpr *) expr;
|
||||
const ArrayExpr *arrayexpr = (const ArrayExpr *) expr;
|
||||
Oid commontype;
|
||||
int32 typmod;
|
||||
ListCell *elem;
|
||||
@ -405,7 +405,7 @@ exprTypmod(Node *expr)
|
||||
* If all the alternatives agree on type/typmod, return that
|
||||
* typmod, else use -1
|
||||
*/
|
||||
CoalesceExpr *cexpr = (CoalesceExpr *) expr;
|
||||
const CoalesceExpr *cexpr = (const CoalesceExpr *) expr;
|
||||
Oid coalescetype = cexpr->coalescetype;
|
||||
int32 typmod;
|
||||
ListCell *arg;
|
||||
@ -433,7 +433,7 @@ exprTypmod(Node *expr)
|
||||
* If all the alternatives agree on type/typmod, return that
|
||||
* typmod, else use -1
|
||||
*/
|
||||
MinMaxExpr *mexpr = (MinMaxExpr *) expr;
|
||||
const MinMaxExpr *mexpr = (const MinMaxExpr *) expr;
|
||||
Oid minmaxtype = mexpr->minmaxtype;
|
||||
int32 typmod;
|
||||
ListCell *arg;
|
||||
@ -456,13 +456,13 @@ exprTypmod(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_CoerceToDomain:
|
||||
return ((CoerceToDomain *) expr)->resulttypmod;
|
||||
return ((const CoerceToDomain *) expr)->resulttypmod;
|
||||
case T_CoerceToDomainValue:
|
||||
return ((CoerceToDomainValue *) expr)->typeMod;
|
||||
return ((const CoerceToDomainValue *) expr)->typeMod;
|
||||
case T_SetToDefault:
|
||||
return ((SetToDefault *) expr)->typeMod;
|
||||
return ((const SetToDefault *) expr)->typeMod;
|
||||
case T_PlaceHolderVar:
|
||||
return exprTypmod((Node *) ((PlaceHolderVar *) expr)->phexpr);
|
||||
return exprTypmod((Node *) ((const PlaceHolderVar *) expr)->phexpr);
|
||||
default:
|
||||
break;
|
||||
}
|
||||
@ -481,7 +481,7 @@ exprTypmod(Node *expr)
|
||||
* length coercion by this routine.
|
||||
*/
|
||||
bool
|
||||
exprIsLengthCoercion(Node *expr, int32 *coercedTypmod)
|
||||
exprIsLengthCoercion(const Node *expr, int32 *coercedTypmod)
|
||||
{
|
||||
if (coercedTypmod != NULL)
|
||||
*coercedTypmod = -1; /* default result on failure */
|
||||
@ -492,7 +492,7 @@ exprIsLengthCoercion(Node *expr, int32 *coercedTypmod)
|
||||
*/
|
||||
if (expr && IsA(expr, FuncExpr))
|
||||
{
|
||||
FuncExpr *func = (FuncExpr *) expr;
|
||||
const FuncExpr *func = (const FuncExpr *) expr;
|
||||
int nargs;
|
||||
Const *second_arg;
|
||||
|
||||
@ -529,7 +529,7 @@ exprIsLengthCoercion(Node *expr, int32 *coercedTypmod)
|
||||
|
||||
if (expr && IsA(expr, ArrayCoerceExpr))
|
||||
{
|
||||
ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) expr;
|
||||
const ArrayCoerceExpr *acoerce = (const ArrayCoerceExpr *) expr;
|
||||
|
||||
/* It's not a length coercion unless there's a nondefault typmod */
|
||||
if (acoerce->resulttypmod < 0)
|
||||
@ -632,7 +632,7 @@ expression_returns_set_walker(Node *node, void *context)
|
||||
* or vice versa, the two are different.
|
||||
*/
|
||||
Oid
|
||||
exprCollation(Node *expr)
|
||||
exprCollation(const Node *expr)
|
||||
{
|
||||
Oid coll;
|
||||
|
||||
@ -642,37 +642,37 @@ exprCollation(Node *expr)
|
||||
switch (nodeTag(expr))
|
||||
{
|
||||
case T_Var:
|
||||
coll = ((Var *) expr)->varcollid;
|
||||
coll = ((const Var *) expr)->varcollid;
|
||||
break;
|
||||
case T_Const:
|
||||
coll = ((Const *) expr)->constcollid;
|
||||
coll = ((const Const *) expr)->constcollid;
|
||||
break;
|
||||
case T_Param:
|
||||
coll = ((Param *) expr)->paramcollid;
|
||||
coll = ((const Param *) expr)->paramcollid;
|
||||
break;
|
||||
case T_Aggref:
|
||||
coll = ((Aggref *) expr)->aggcollid;
|
||||
coll = ((const Aggref *) expr)->aggcollid;
|
||||
break;
|
||||
case T_WindowFunc:
|
||||
coll = ((WindowFunc *) expr)->wincollid;
|
||||
coll = ((const WindowFunc *) expr)->wincollid;
|
||||
break;
|
||||
case T_ArrayRef:
|
||||
coll = ((ArrayRef *) expr)->refcollid;
|
||||
coll = ((const ArrayRef *) expr)->refcollid;
|
||||
break;
|
||||
case T_FuncExpr:
|
||||
coll = ((FuncExpr *) expr)->funccollid;
|
||||
coll = ((const FuncExpr *) expr)->funccollid;
|
||||
break;
|
||||
case T_NamedArgExpr:
|
||||
coll = exprCollation((Node *) ((NamedArgExpr *) expr)->arg);
|
||||
coll = exprCollation((Node *) ((const NamedArgExpr *) expr)->arg);
|
||||
break;
|
||||
case T_OpExpr:
|
||||
coll = ((OpExpr *) expr)->opcollid;
|
||||
coll = ((const OpExpr *) expr)->opcollid;
|
||||
break;
|
||||
case T_DistinctExpr:
|
||||
coll = ((DistinctExpr *) expr)->opcollid;
|
||||
coll = ((const DistinctExpr *) expr)->opcollid;
|
||||
break;
|
||||
case T_NullIfExpr:
|
||||
coll = ((NullIfExpr *) expr)->opcollid;
|
||||
coll = ((const NullIfExpr *) expr)->opcollid;
|
||||
break;
|
||||
case T_ScalarArrayOpExpr:
|
||||
coll = InvalidOid; /* result is always boolean */
|
||||
@ -682,7 +682,7 @@ exprCollation(Node *expr)
|
||||
break;
|
||||
case T_SubLink:
|
||||
{
|
||||
SubLink *sublink = (SubLink *) expr;
|
||||
const SubLink *sublink = (const SubLink *) expr;
|
||||
|
||||
if (sublink->subLinkType == EXPR_SUBLINK ||
|
||||
sublink->subLinkType == ARRAY_SUBLINK)
|
||||
@ -708,7 +708,7 @@ exprCollation(Node *expr)
|
||||
break;
|
||||
case T_SubPlan:
|
||||
{
|
||||
SubPlan *subplan = (SubPlan *) expr;
|
||||
const SubPlan *subplan = (const SubPlan *) expr;
|
||||
|
||||
if (subplan->subLinkType == EXPR_SUBLINK ||
|
||||
subplan->subLinkType == ARRAY_SUBLINK)
|
||||
@ -726,41 +726,41 @@ exprCollation(Node *expr)
|
||||
break;
|
||||
case T_AlternativeSubPlan:
|
||||
{
|
||||
AlternativeSubPlan *asplan = (AlternativeSubPlan *) expr;
|
||||
const AlternativeSubPlan *asplan = (const AlternativeSubPlan *) expr;
|
||||
|
||||
/* subplans should all return the same thing */
|
||||
coll = exprCollation((Node *) linitial(asplan->subplans));
|
||||
}
|
||||
break;
|
||||
case T_FieldSelect:
|
||||
coll = ((FieldSelect *) expr)->resultcollid;
|
||||
coll = ((const FieldSelect *) expr)->resultcollid;
|
||||
break;
|
||||
case T_FieldStore:
|
||||
coll = InvalidOid; /* result is always composite */
|
||||
break;
|
||||
case T_RelabelType:
|
||||
coll = ((RelabelType *) expr)->resultcollid;
|
||||
coll = ((const RelabelType *) expr)->resultcollid;
|
||||
break;
|
||||
case T_CoerceViaIO:
|
||||
coll = ((CoerceViaIO *) expr)->resultcollid;
|
||||
coll = ((const CoerceViaIO *) expr)->resultcollid;
|
||||
break;
|
||||
case T_ArrayCoerceExpr:
|
||||
coll = ((ArrayCoerceExpr *) expr)->resultcollid;
|
||||
coll = ((const ArrayCoerceExpr *) expr)->resultcollid;
|
||||
break;
|
||||
case T_ConvertRowtypeExpr:
|
||||
coll = InvalidOid; /* result is always composite */
|
||||
break;
|
||||
case T_CollateExpr:
|
||||
coll = ((CollateExpr *) expr)->collOid;
|
||||
coll = ((const CollateExpr *) expr)->collOid;
|
||||
break;
|
||||
case T_CaseExpr:
|
||||
coll = ((CaseExpr *) expr)->casecollid;
|
||||
coll = ((const CaseExpr *) expr)->casecollid;
|
||||
break;
|
||||
case T_CaseTestExpr:
|
||||
coll = ((CaseTestExpr *) expr)->collation;
|
||||
coll = ((const CaseTestExpr *) expr)->collation;
|
||||
break;
|
||||
case T_ArrayExpr:
|
||||
coll = ((ArrayExpr *) expr)->array_collid;
|
||||
coll = ((const ArrayExpr *) expr)->array_collid;
|
||||
break;
|
||||
case T_RowExpr:
|
||||
coll = InvalidOid; /* result is always composite */
|
||||
@ -769,10 +769,10 @@ exprCollation(Node *expr)
|
||||
coll = InvalidOid; /* result is always boolean */
|
||||
break;
|
||||
case T_CoalesceExpr:
|
||||
coll = ((CoalesceExpr *) expr)->coalescecollid;
|
||||
coll = ((const CoalesceExpr *) expr)->coalescecollid;
|
||||
break;
|
||||
case T_MinMaxExpr:
|
||||
coll = ((MinMaxExpr *) expr)->minmaxcollid;
|
||||
coll = ((const MinMaxExpr *) expr)->minmaxcollid;
|
||||
break;
|
||||
case T_XmlExpr:
|
||||
|
||||
@ -781,7 +781,7 @@ exprCollation(Node *expr)
|
||||
* collation is always default. The other cases return boolean or
|
||||
* XML, which are non-collatable.
|
||||
*/
|
||||
if (((XmlExpr *) expr)->op == IS_XMLSERIALIZE)
|
||||
if (((const XmlExpr *) expr)->op == IS_XMLSERIALIZE)
|
||||
coll = DEFAULT_COLLATION_OID;
|
||||
else
|
||||
coll = InvalidOid;
|
||||
@ -793,19 +793,19 @@ exprCollation(Node *expr)
|
||||
coll = InvalidOid; /* result is always boolean */
|
||||
break;
|
||||
case T_CoerceToDomain:
|
||||
coll = ((CoerceToDomain *) expr)->resultcollid;
|
||||
coll = ((const CoerceToDomain *) expr)->resultcollid;
|
||||
break;
|
||||
case T_CoerceToDomainValue:
|
||||
coll = ((CoerceToDomainValue *) expr)->collation;
|
||||
coll = ((const CoerceToDomainValue *) expr)->collation;
|
||||
break;
|
||||
case T_SetToDefault:
|
||||
coll = ((SetToDefault *) expr)->collation;
|
||||
coll = ((const SetToDefault *) expr)->collation;
|
||||
break;
|
||||
case T_CurrentOfExpr:
|
||||
coll = InvalidOid; /* result is always boolean */
|
||||
break;
|
||||
case T_PlaceHolderVar:
|
||||
coll = exprCollation((Node *) ((PlaceHolderVar *) expr)->phexpr);
|
||||
coll = exprCollation((Node *) ((const PlaceHolderVar *) expr)->phexpr);
|
||||
break;
|
||||
default:
|
||||
elog(ERROR, "unrecognized node type: %d", (int) nodeTag(expr));
|
||||
@ -822,7 +822,7 @@ exprCollation(Node *expr)
|
||||
* Result is InvalidOid if the node type doesn't store this information.
|
||||
*/
|
||||
Oid
|
||||
exprInputCollation(Node *expr)
|
||||
exprInputCollation(const Node *expr)
|
||||
{
|
||||
Oid coll;
|
||||
|
||||
@ -832,28 +832,28 @@ exprInputCollation(Node *expr)
|
||||
switch (nodeTag(expr))
|
||||
{
|
||||
case T_Aggref:
|
||||
coll = ((Aggref *) expr)->inputcollid;
|
||||
coll = ((const Aggref *) expr)->inputcollid;
|
||||
break;
|
||||
case T_WindowFunc:
|
||||
coll = ((WindowFunc *) expr)->inputcollid;
|
||||
coll = ((const WindowFunc *) expr)->inputcollid;
|
||||
break;
|
||||
case T_FuncExpr:
|
||||
coll = ((FuncExpr *) expr)->inputcollid;
|
||||
coll = ((const FuncExpr *) expr)->inputcollid;
|
||||
break;
|
||||
case T_OpExpr:
|
||||
coll = ((OpExpr *) expr)->inputcollid;
|
||||
coll = ((const OpExpr *) expr)->inputcollid;
|
||||
break;
|
||||
case T_DistinctExpr:
|
||||
coll = ((DistinctExpr *) expr)->inputcollid;
|
||||
coll = ((const DistinctExpr *) expr)->inputcollid;
|
||||
break;
|
||||
case T_NullIfExpr:
|
||||
coll = ((NullIfExpr *) expr)->inputcollid;
|
||||
coll = ((const NullIfExpr *) expr)->inputcollid;
|
||||
break;
|
||||
case T_ScalarArrayOpExpr:
|
||||
coll = ((ScalarArrayOpExpr *) expr)->inputcollid;
|
||||
coll = ((const ScalarArrayOpExpr *) expr)->inputcollid;
|
||||
break;
|
||||
case T_MinMaxExpr:
|
||||
coll = ((MinMaxExpr *) expr)->inputcollid;
|
||||
coll = ((const MinMaxExpr *) expr)->inputcollid;
|
||||
break;
|
||||
default:
|
||||
coll = InvalidOid;
|
||||
@ -1078,7 +1078,7 @@ exprSetInputCollation(Node *expr, Oid inputcollation)
|
||||
* known and unknown locations in a tree.
|
||||
*/
|
||||
int
|
||||
exprLocation(Node *expr)
|
||||
exprLocation(const Node *expr)
|
||||
{
|
||||
int loc;
|
||||
|
||||
@ -1087,32 +1087,32 @@ exprLocation(Node *expr)
|
||||
switch (nodeTag(expr))
|
||||
{
|
||||
case T_RangeVar:
|
||||
loc = ((RangeVar *) expr)->location;
|
||||
loc = ((const RangeVar *) expr)->location;
|
||||
break;
|
||||
case T_Var:
|
||||
loc = ((Var *) expr)->location;
|
||||
loc = ((const Var *) expr)->location;
|
||||
break;
|
||||
case T_Const:
|
||||
loc = ((Const *) expr)->location;
|
||||
loc = ((const Const *) expr)->location;
|
||||
break;
|
||||
case T_Param:
|
||||
loc = ((Param *) expr)->location;
|
||||
loc = ((const Param *) expr)->location;
|
||||
break;
|
||||
case T_Aggref:
|
||||
/* function name should always be the first thing */
|
||||
loc = ((Aggref *) expr)->location;
|
||||
loc = ((const Aggref *) expr)->location;
|
||||
break;
|
||||
case T_WindowFunc:
|
||||
/* function name should always be the first thing */
|
||||
loc = ((WindowFunc *) expr)->location;
|
||||
loc = ((const WindowFunc *) expr)->location;
|
||||
break;
|
||||
case T_ArrayRef:
|
||||
/* just use array argument's location */
|
||||
loc = exprLocation((Node *) ((ArrayRef *) expr)->refexpr);
|
||||
loc = exprLocation((Node *) ((const ArrayRef *) expr)->refexpr);
|
||||
break;
|
||||
case T_FuncExpr:
|
||||
{
|
||||
FuncExpr *fexpr = (FuncExpr *) expr;
|
||||
const FuncExpr *fexpr = (const FuncExpr *) expr;
|
||||
|
||||
/* consider both function name and leftmost arg */
|
||||
loc = leftmostLoc(fexpr->location,
|
||||
@ -1121,7 +1121,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_NamedArgExpr:
|
||||
{
|
||||
NamedArgExpr *na = (NamedArgExpr *) expr;
|
||||
const NamedArgExpr *na = (const NamedArgExpr *) expr;
|
||||
|
||||
/* consider both argument name and value */
|
||||
loc = leftmostLoc(na->location,
|
||||
@ -1132,7 +1132,7 @@ exprLocation(Node *expr)
|
||||
case T_DistinctExpr: /* struct-equivalent to OpExpr */
|
||||
case T_NullIfExpr: /* struct-equivalent to OpExpr */
|
||||
{
|
||||
OpExpr *opexpr = (OpExpr *) expr;
|
||||
const OpExpr *opexpr = (const OpExpr *) expr;
|
||||
|
||||
/* consider both operator name and leftmost arg */
|
||||
loc = leftmostLoc(opexpr->location,
|
||||
@ -1141,7 +1141,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_ScalarArrayOpExpr:
|
||||
{
|
||||
ScalarArrayOpExpr *saopexpr = (ScalarArrayOpExpr *) expr;
|
||||
const ScalarArrayOpExpr *saopexpr = (const ScalarArrayOpExpr *) expr;
|
||||
|
||||
/* consider both operator name and leftmost arg */
|
||||
loc = leftmostLoc(saopexpr->location,
|
||||
@ -1150,7 +1150,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_BoolExpr:
|
||||
{
|
||||
BoolExpr *bexpr = (BoolExpr *) expr;
|
||||
const BoolExpr *bexpr = (const BoolExpr *) expr;
|
||||
|
||||
/*
|
||||
* Same as above, to handle either NOT or AND/OR. We can't
|
||||
@ -1163,7 +1163,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_SubLink:
|
||||
{
|
||||
SubLink *sublink = (SubLink *) expr;
|
||||
const SubLink *sublink = (const SubLink *) expr;
|
||||
|
||||
/* check the testexpr, if any, and the operator/keyword */
|
||||
loc = leftmostLoc(exprLocation(sublink->testexpr),
|
||||
@ -1172,15 +1172,15 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_FieldSelect:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((FieldSelect *) expr)->arg);
|
||||
loc = exprLocation((Node *) ((const FieldSelect *) expr)->arg);
|
||||
break;
|
||||
case T_FieldStore:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((FieldStore *) expr)->arg);
|
||||
loc = exprLocation((Node *) ((const FieldStore *) expr)->arg);
|
||||
break;
|
||||
case T_RelabelType:
|
||||
{
|
||||
RelabelType *rexpr = (RelabelType *) expr;
|
||||
const RelabelType *rexpr = (const RelabelType *) expr;
|
||||
|
||||
/* Much as above */
|
||||
loc = leftmostLoc(rexpr->location,
|
||||
@ -1189,7 +1189,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_CoerceViaIO:
|
||||
{
|
||||
CoerceViaIO *cexpr = (CoerceViaIO *) expr;
|
||||
const CoerceViaIO *cexpr = (const CoerceViaIO *) expr;
|
||||
|
||||
/* Much as above */
|
||||
loc = leftmostLoc(cexpr->location,
|
||||
@ -1198,7 +1198,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_ArrayCoerceExpr:
|
||||
{
|
||||
ArrayCoerceExpr *cexpr = (ArrayCoerceExpr *) expr;
|
||||
const ArrayCoerceExpr *cexpr = (const ArrayCoerceExpr *) expr;
|
||||
|
||||
/* Much as above */
|
||||
loc = leftmostLoc(cexpr->location,
|
||||
@ -1207,7 +1207,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_ConvertRowtypeExpr:
|
||||
{
|
||||
ConvertRowtypeExpr *cexpr = (ConvertRowtypeExpr *) expr;
|
||||
const ConvertRowtypeExpr *cexpr = (const ConvertRowtypeExpr *) expr;
|
||||
|
||||
/* Much as above */
|
||||
loc = leftmostLoc(cexpr->location,
|
||||
@ -1216,39 +1216,39 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_CollateExpr:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((CollateExpr *) expr)->arg);
|
||||
loc = exprLocation((Node *) ((const CollateExpr *) expr)->arg);
|
||||
break;
|
||||
case T_CaseExpr:
|
||||
/* CASE keyword should always be the first thing */
|
||||
loc = ((CaseExpr *) expr)->location;
|
||||
loc = ((const CaseExpr *) expr)->location;
|
||||
break;
|
||||
case T_CaseWhen:
|
||||
/* WHEN keyword should always be the first thing */
|
||||
loc = ((CaseWhen *) expr)->location;
|
||||
loc = ((const CaseWhen *) expr)->location;
|
||||
break;
|
||||
case T_ArrayExpr:
|
||||
/* the location points at ARRAY or [, which must be leftmost */
|
||||
loc = ((ArrayExpr *) expr)->location;
|
||||
loc = ((const ArrayExpr *) expr)->location;
|
||||
break;
|
||||
case T_RowExpr:
|
||||
/* the location points at ROW or (, which must be leftmost */
|
||||
loc = ((RowExpr *) expr)->location;
|
||||
loc = ((const RowExpr *) expr)->location;
|
||||
break;
|
||||
case T_RowCompareExpr:
|
||||
/* just use leftmost argument's location */
|
||||
loc = exprLocation((Node *) ((RowCompareExpr *) expr)->largs);
|
||||
loc = exprLocation((Node *) ((const RowCompareExpr *) expr)->largs);
|
||||
break;
|
||||
case T_CoalesceExpr:
|
||||
/* COALESCE keyword should always be the first thing */
|
||||
loc = ((CoalesceExpr *) expr)->location;
|
||||
loc = ((const CoalesceExpr *) expr)->location;
|
||||
break;
|
||||
case T_MinMaxExpr:
|
||||
/* GREATEST/LEAST keyword should always be the first thing */
|
||||
loc = ((MinMaxExpr *) expr)->location;
|
||||
loc = ((const MinMaxExpr *) expr)->location;
|
||||
break;
|
||||
case T_XmlExpr:
|
||||
{
|
||||
XmlExpr *xexpr = (XmlExpr *) expr;
|
||||
const XmlExpr *xexpr = (const XmlExpr *) expr;
|
||||
|
||||
/* consider both function name and leftmost arg */
|
||||
loc = leftmostLoc(xexpr->location,
|
||||
@ -1257,15 +1257,15 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_NullTest:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((NullTest *) expr)->arg);
|
||||
loc = exprLocation((Node *) ((const NullTest *) expr)->arg);
|
||||
break;
|
||||
case T_BooleanTest:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((BooleanTest *) expr)->arg);
|
||||
loc = exprLocation((Node *) ((const BooleanTest *) expr)->arg);
|
||||
break;
|
||||
case T_CoerceToDomain:
|
||||
{
|
||||
CoerceToDomain *cexpr = (CoerceToDomain *) expr;
|
||||
const CoerceToDomain *cexpr = (const CoerceToDomain *) expr;
|
||||
|
||||
/* Much as above */
|
||||
loc = leftmostLoc(cexpr->location,
|
||||
@ -1273,18 +1273,18 @@ exprLocation(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_CoerceToDomainValue:
|
||||
loc = ((CoerceToDomainValue *) expr)->location;
|
||||
loc = ((const CoerceToDomainValue *) expr)->location;
|
||||
break;
|
||||
case T_SetToDefault:
|
||||
loc = ((SetToDefault *) expr)->location;
|
||||
loc = ((const SetToDefault *) expr)->location;
|
||||
break;
|
||||
case T_TargetEntry:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((TargetEntry *) expr)->expr);
|
||||
loc = exprLocation((Node *) ((const TargetEntry *) expr)->expr);
|
||||
break;
|
||||
case T_IntoClause:
|
||||
/* use the contained RangeVar's location --- close enough */
|
||||
loc = exprLocation((Node *) ((IntoClause *) expr)->rel);
|
||||
loc = exprLocation((Node *) ((const IntoClause *) expr)->rel);
|
||||
break;
|
||||
case T_List:
|
||||
{
|
||||
@ -1292,7 +1292,7 @@ exprLocation(Node *expr)
|
||||
ListCell *lc;
|
||||
|
||||
loc = -1; /* just to suppress compiler warning */
|
||||
foreach(lc, (List *) expr)
|
||||
foreach(lc, (const List *) expr)
|
||||
{
|
||||
loc = exprLocation((Node *) lfirst(lc));
|
||||
if (loc >= 0)
|
||||
@ -1302,7 +1302,7 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_A_Expr:
|
||||
{
|
||||
A_Expr *aexpr = (A_Expr *) expr;
|
||||
const A_Expr *aexpr = (const A_Expr *) expr;
|
||||
|
||||
/* use leftmost of operator or left operand (if any) */
|
||||
/* we assume right operand can't be to left of operator */
|
||||
@ -1311,17 +1311,17 @@ exprLocation(Node *expr)
|
||||
}
|
||||
break;
|
||||
case T_ColumnRef:
|
||||
loc = ((ColumnRef *) expr)->location;
|
||||
loc = ((const ColumnRef *) expr)->location;
|
||||
break;
|
||||
case T_ParamRef:
|
||||
loc = ((ParamRef *) expr)->location;
|
||||
loc = ((const ParamRef *) expr)->location;
|
||||
break;
|
||||
case T_A_Const:
|
||||
loc = ((A_Const *) expr)->location;
|
||||
loc = ((const A_Const *) expr)->location;
|
||||
break;
|
||||
case T_FuncCall:
|
||||
{
|
||||
FuncCall *fc = (FuncCall *) expr;
|
||||
const FuncCall *fc = (const FuncCall *) expr;
|
||||
|
||||
/* consider both function name and leftmost arg */
|
||||
/* (we assume any ORDER BY nodes must be to right of name) */
|
||||
@ -1331,15 +1331,15 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_A_ArrayExpr:
|
||||
/* the location points at ARRAY or [, which must be leftmost */
|
||||
loc = ((A_ArrayExpr *) expr)->location;
|
||||
loc = ((const A_ArrayExpr *) expr)->location;
|
||||
break;
|
||||
case T_ResTarget:
|
||||
/* we need not examine the contained expression (if any) */
|
||||
loc = ((ResTarget *) expr)->location;
|
||||
loc = ((const ResTarget *) expr)->location;
|
||||
break;
|
||||
case T_TypeCast:
|
||||
{
|
||||
TypeCast *tc = (TypeCast *) expr;
|
||||
const TypeCast *tc = (const TypeCast *) expr;
|
||||
|
||||
/*
|
||||
* This could represent CAST(), ::, or TypeName 'literal', so
|
||||
@ -1352,34 +1352,34 @@ exprLocation(Node *expr)
|
||||
break;
|
||||
case T_CollateClause:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation(((CollateClause *) expr)->arg);
|
||||
loc = exprLocation(((const CollateClause *) expr)->arg);
|
||||
break;
|
||||
case T_SortBy:
|
||||
/* just use argument's location (ignore operator, if any) */
|
||||
loc = exprLocation(((SortBy *) expr)->node);
|
||||
loc = exprLocation(((const SortBy *) expr)->node);
|
||||
break;
|
||||
case T_WindowDef:
|
||||
loc = ((WindowDef *) expr)->location;
|
||||
loc = ((const WindowDef *) expr)->location;
|
||||
break;
|
||||
case T_TypeName:
|
||||
loc = ((TypeName *) expr)->location;
|
||||
loc = ((const TypeName *) expr)->location;
|
||||
break;
|
||||
case T_Constraint:
|
||||
loc = ((Constraint *) expr)->location;
|
||||
loc = ((const Constraint *) expr)->location;
|
||||
break;
|
||||
case T_XmlSerialize:
|
||||
/* XMLSERIALIZE keyword should always be the first thing */
|
||||
loc = ((XmlSerialize *) expr)->location;
|
||||
loc = ((const XmlSerialize *) expr)->location;
|
||||
break;
|
||||
case T_WithClause:
|
||||
loc = ((WithClause *) expr)->location;
|
||||
loc = ((const WithClause *) expr)->location;
|
||||
break;
|
||||
case T_CommonTableExpr:
|
||||
loc = ((CommonTableExpr *) expr)->location;
|
||||
loc = ((const CommonTableExpr *) expr)->location;
|
||||
break;
|
||||
case T_PlaceHolderVar:
|
||||
/* just use argument's location */
|
||||
loc = exprLocation((Node *) ((PlaceHolderVar *) expr)->phexpr);
|
||||
loc = exprLocation((Node *) ((const PlaceHolderVar *) expr)->phexpr);
|
||||
break;
|
||||
default:
|
||||
/* for any other node type it's just unknown... */
|
||||
|
Reference in New Issue
Block a user