diff options
Diffstat (limited to 'src/include/nodes/relation.h')
| -rw-r--r-- | src/include/nodes/relation.h | 11 |
1 files changed, 7 insertions, 4 deletions
diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index ee7007aace..26417291e6 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -845,6 +845,7 @@ typedef struct Path double rows; /* estimated number of result tuples */ Cost startup_cost; /* cost expended before fetching any tuples */ Cost total_cost; /* total cost (assuming all tuples fetched) */ + Cost serial_cost; /* non-parallelizable portion of total cost */ List *pathkeys; /* sort ordering of path's output */ /* pathkeys is a List of PathKey nodes; see above */ @@ -900,10 +901,11 @@ typedef struct Path * NoMovementScanDirection for an indexscan, but the planner wants to * distinguish ordered from unordered indexes for building pathkeys.) * - * 'indextotalcost' and 'indexselectivity' are saved in the IndexPath so that - * we need not recompute them when considering using the same index in a - * bitmap index/heap scan (see BitmapHeapPath). The costs of the IndexPath - * itself represent the costs of an IndexScan or IndexOnlyScan plan type. + * 'indextotalcost', 'indexserialcost', and 'indexselectivity' are saved in + * the IndexPath so that we need not recompute them when considering using the + * same index in a * bitmap index/heap scan (see BitmapHeapPath). The costs + * of the IndexPath itself represent the costs of an IndexScan or IndexOnlyScan + * plan type. *---------- */ typedef struct IndexPath @@ -917,6 +919,7 @@ typedef struct IndexPath List *indexorderbycols; ScanDirection indexscandir; Cost indextotalcost; + Cost indexserialcost; Selectivity indexselectivity; } IndexPath; |