mirror of
https://github.com/postgres/postgres.git
synced 2025-09-06 13:46:51 +03:00
pgindent run for 9.4
This includes removing tabs after periods in C comments, which was applied to back branches, so this change should not effect backpatching.
This commit is contained in:
@@ -40,7 +40,7 @@ static List *remove_rel_from_joinlist(List *joinlist, int relid, int *nremoved);
|
||||
* Check for relations that don't actually need to be joined at all,
|
||||
* and remove them from the query.
|
||||
*
|
||||
* We are passed the current joinlist and return the updated list. Other
|
||||
* We are passed the current joinlist and return the updated list. Other
|
||||
* data structures that have to be updated are accessible via "root".
|
||||
*/
|
||||
List *
|
||||
@@ -90,7 +90,7 @@ restart:
|
||||
* Restart the scan. This is necessary to ensure we find all
|
||||
* removable joins independently of ordering of the join_info_list
|
||||
* (note that removal of attr_needed bits may make a join appear
|
||||
* removable that did not before). Also, since we just deleted the
|
||||
* removable that did not before). Also, since we just deleted the
|
||||
* current list cell, we'd have to have some kluge to continue the
|
||||
* list scan anyway.
|
||||
*/
|
||||
@@ -107,7 +107,7 @@ restart:
|
||||
* We already know that the clause is a binary opclause referencing only the
|
||||
* rels in the current join. The point here is to check whether it has the
|
||||
* form "outerrel_expr op innerrel_expr" or "innerrel_expr op outerrel_expr",
|
||||
* rather than mixing outer and inner vars on either side. If it matches,
|
||||
* rather than mixing outer and inner vars on either side. If it matches,
|
||||
* we set the transient flag outer_is_left to identify which side is which.
|
||||
*/
|
||||
static inline bool
|
||||
@@ -154,7 +154,7 @@ join_is_removable(PlannerInfo *root, SpecialJoinInfo *sjinfo)
|
||||
|
||||
/*
|
||||
* Currently, we only know how to remove left joins to a baserel with
|
||||
* unique indexes. We can check most of these criteria pretty trivially
|
||||
* unique indexes. We can check most of these criteria pretty trivially
|
||||
* to avoid doing useless extra work. But checking whether any of the
|
||||
* indexes are unique would require iterating over the indexlist, so for
|
||||
* now we just make sure there are indexes of some sort or other. If none
|
||||
@@ -203,7 +203,7 @@ join_is_removable(PlannerInfo *root, SpecialJoinInfo *sjinfo)
|
||||
* actually references some inner-rel attributes; but the correct check
|
||||
* for that is relatively expensive, so we first check against ph_eval_at,
|
||||
* which must mention the inner rel if the PHV uses any inner-rel attrs as
|
||||
* non-lateral references. Note that if the PHV's syntactic scope is just
|
||||
* non-lateral references. Note that if the PHV's syntactic scope is just
|
||||
* the inner rel, we can't drop the rel even if the PHV is variable-free.
|
||||
*/
|
||||
foreach(l, root->placeholder_list)
|
||||
|
Reference in New Issue
Block a user