From eaa8a51394dc0d91d0060bf783c54cf0181f21a3 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Fri, 17 Oct 2008 20:23:45 +0000 Subject: [PATCH] Improve comments about RelOptInfo.reltargetlist. --- src/include/nodes/relation.h | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index 9dc0184da1..39a42c0790 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -244,8 +244,10 @@ typedef struct PlannerInfo * width - avg. number of bytes per tuple in the relation after the * appropriate projections have been done (ie, output width) * reltargetlist - List of Var nodes for the attributes we need to - * output from this relation (in no particular order) - * NOTE: in a child relation, may contain RowExprs + * output from this relation (in no particular order, + * but all rels of an appendrel set must use same order) + * NOTE: in a child relation, may contain RowExpr or + * ConvertRowtypeExpr representing a whole-row Var * pathlist - List of Path nodes, one for each potentially useful * method of generating the relation * cheapest_startup_path - the pathlist member with lowest startup cost @@ -337,7 +339,7 @@ typedef struct RelOptInfo int width; /* estimated avg width of result tuples */ /* materialization information */ - List *reltargetlist; /* needed Vars */ + List *reltargetlist; /* Vars to be output by scan of relation */ List *pathlist; /* Path structures */ struct Path *cheapest_startup_path; struct Path *cheapest_total_path; @@ -350,7 +352,7 @@ typedef struct RelOptInfo AttrNumber max_attr; /* largest attrno of rel */ Relids *attr_needed; /* array indexed [min_attr .. max_attr] */ int32 *attr_widths; /* array indexed [min_attr .. max_attr] */ - List *indexlist; + List *indexlist; /* list of IndexOptInfo */ BlockNumber pages; double tuples; struct Plan *subplan; /* if subquery */ -- 2.39.5