* query_or_expression_tree_walker --- hybrid form * * This routine will invoke query_tree_walker if called on a Query node, * else will invoke the walker directly. This is a useful way of starting * the recursion when the walker's normal change of state is not appropriate * for the outermost Query node. */
| 3769 | * for the outermost Query node. |
| 3770 | */ |
| 3771 | bool |
| 3772 | query_or_expression_tree_walker(Node *node, |
| 3773 | bool (*walker) (), |
| 3774 | void *context, |
| 3775 | int flags) |
| 3776 | { |
| 3777 | if (node && IsA(node, Query)) |
| 3778 | return query_tree_walker((Query *) node, |
| 3779 | walker, |
| 3780 | context, |
| 3781 | flags); |
| 3782 | else |
| 3783 | return walker(node, context); |
| 3784 | } |
| 3785 | |
| 3786 | /* |
| 3787 | * query_or_expression_tree_mutator --- hybrid form |
no test coverage detected