diff options
Diffstat (limited to 'src/backend')
| -rw-r--r-- | src/backend/optimizer/util/clauses.c | 4 | ||||
| -rw-r--r-- | src/backend/utils/cache/relcache.c | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/src/backend/optimizer/util/clauses.c b/src/backend/optimizer/util/clauses.c index 42bba543e93..a578867cced 100644 --- a/src/backend/optimizer/util/clauses.c +++ b/src/backend/optimizer/util/clauses.c @@ -354,8 +354,8 @@ make_and_qual(Node *qual1, Node *qual2) } /* - * Sometimes (such as in the input of ExecQual), we use lists of expression - * nodes with implicit AND semantics. + * The planner frequently prefers to represent qualification expressions + * as lists of boolean expressions with implicit AND semantics. * * These functions convert between an AND-semantics expression list and the * ordinary representation of a boolean expression. diff --git a/src/backend/utils/cache/relcache.c b/src/backend/utils/cache/relcache.c index a6b60c67caa..bc52183bfb0 100644 --- a/src/backend/utils/cache/relcache.c +++ b/src/backend/utils/cache/relcache.c @@ -4743,7 +4743,7 @@ RelationGetIndexExpressions(Relation relation) * RelationGetIndexPredicate -- get the index predicate for an index * * We cache the result of transforming pg_index.indpred into an implicit-AND - * node tree (suitable for ExecQual). + * node tree (suitable for use in planning). * If the rel is not an index or has no predicate, we return NIL. * Otherwise, the returned tree is copied into the caller's memory context. * (We don't want to return a pointer to the relcache copy, since it could |