diff options
| author | Peter Eisentraut <peter@eisentraut.org> | 2021-07-19 08:01:40 +0200 |
|---|---|---|
| committer | Peter Eisentraut <peter@eisentraut.org> | 2021-07-19 08:20:24 +0200 |
| commit | 2b00db4fb0c7f02f000276bfadaab65a14059168 (patch) | |
| tree | be8cdeaa98656fe52c7bbd47e68a221b16840308 /src/backend/parser | |
| parent | 29abde637bbb4b8fcdc96e049813890afa5ab671 (diff) | |
| download | postgresql-2b00db4fb0c7f02f000276bfadaab65a14059168.tar.gz postgresql-2b00db4fb0c7f02f000276bfadaab65a14059168.zip | |
Use l*_node() family of functions where appropriate
Instead of castNode(…, lfoo(…))
Author: Dagfinn Ilmari Mannsåker <ilmari@ilmari.org>
Discussion: https://www.postgresql.org/message-id/flat/87eecahraj.fsf@wibble.ilmari.org
Diffstat (limited to 'src/backend/parser')
| -rw-r--r-- | src/backend/parser/parse_clause.c | 2 | ||||
| -rw-r--r-- | src/backend/parser/parse_utilcmd.c | 8 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/backend/parser/parse_clause.c b/src/backend/parser/parse_clause.c index 71c360bea58..b3f151d33b5 100644 --- a/src/backend/parser/parse_clause.c +++ b/src/backend/parser/parse_clause.c @@ -2807,7 +2807,7 @@ transformWindowDefinitions(ParseState *pstate, (errcode(ERRCODE_WINDOWING_ERROR), errmsg("RANGE with offset PRECEDING/FOLLOWING requires exactly one ORDER BY column"), parser_errposition(pstate, windef->location))); - sortcl = castNode(SortGroupClause, linitial(wc->orderClause)); + sortcl = linitial_node(SortGroupClause, wc->orderClause); sortkey = get_sortgroupclause_expr(sortcl, *targetlist); /* Find the sort operator in pg_amop */ if (!get_ordering_op_properties(sortcl->sortop, diff --git a/src/backend/parser/parse_utilcmd.c b/src/backend/parser/parse_utilcmd.c index 9edd1f8d51b..675e400839f 100644 --- a/src/backend/parser/parse_utilcmd.c +++ b/src/backend/parser/parse_utilcmd.c @@ -2424,7 +2424,7 @@ transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt) /* Make sure referenced column exists. */ foreach(columns, cxt->columns) { - column = castNode(ColumnDef, lfirst(columns)); + column = lfirst_node(ColumnDef, columns); if (strcmp(column->colname, key) == 0) { found = true; @@ -2462,7 +2462,7 @@ transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt) foreach(inher, cxt->inhRelations) { - RangeVar *inh = castNode(RangeVar, lfirst(inher)); + RangeVar *inh = lfirst_node(RangeVar, inher); Relation rel; int count; @@ -4088,7 +4088,7 @@ transformPartitionBound(ParseState *pstate, Relation parent, duplicate = false; foreach(cell2, result_spec->listdatums) { - Const *value2 = castNode(Const, lfirst(cell2)); + Const *value2 = lfirst_node(Const, cell2); if (equal(value, value2)) { @@ -4267,7 +4267,7 @@ validateInfiniteBounds(ParseState *pstate, List *blist) foreach(lc, blist) { - PartitionRangeDatum *prd = castNode(PartitionRangeDatum, lfirst(lc)); + PartitionRangeDatum *prd = lfirst_node(PartitionRangeDatum, lc); if (kind == prd->kind) continue; |