summaryrefslogtreecommitdiff
path: root/src/include/nodes/relation.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/include/nodes/relation.h')
-rw-r--r--src/include/nodes/relation.h12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h
index e085cefb7ba..05fc9a3f485 100644
--- a/src/include/nodes/relation.h
+++ b/src/include/nodes/relation.h
@@ -1423,14 +1423,14 @@ typedef JoinPath NestPath;
* mergejoin. If it is not NIL then it is a PathKeys list describing
* the ordering that must be created by an explicit Sort node.
*
- * skip_mark_restore is TRUE if the executor need not do mark/restore calls.
+ * skip_mark_restore is true if the executor need not do mark/restore calls.
* Mark/restore overhead is usually required, but can be skipped if we know
* that the executor need find only one match per outer tuple, and that the
* mergeclauses are sufficient to identify a match. In such cases the
* executor can immediately advance the outer relation after processing a
* match, and therefoere it need never back up the inner relation.
*
- * materialize_inner is TRUE if a Material node should be placed atop the
+ * materialize_inner is true if a Material node should be placed atop the
* inner input. This may appear with or without an inner Sort step.
*/
@@ -1834,15 +1834,15 @@ typedef struct RestrictInfo
Expr *clause; /* the represented clause of WHERE or JOIN */
- bool is_pushed_down; /* TRUE if clause was pushed down in level */
+ bool is_pushed_down; /* true if clause was pushed down in level */
- bool outerjoin_delayed; /* TRUE if delayed by lower outer join */
+ bool outerjoin_delayed; /* true if delayed by lower outer join */
bool can_join; /* see comment above */
bool pseudoconstant; /* see comment above */
- bool leakproof; /* TRUE if known to contain no leaked Vars */
+ bool leakproof; /* true if known to contain no leaked Vars */
Index security_level; /* see comment above */
@@ -1973,7 +1973,7 @@ typedef struct PlaceHolderVar
* syntactically below this special join. (These are needed to help compute
* min_lefthand and min_righthand for higher joins.)
*
- * delay_upper_joins is set TRUE if we detect a pushed-down clause that has
+ * delay_upper_joins is set true if we detect a pushed-down clause that has
* to be evaluated after this join is formed (because it references the RHS).
* Any outer joins that have such a clause and this join in their RHS cannot
* commute with this join, because that would leave noplace to check the