Lines Matching refs:subplan
82 PLAN *tail; /* pointer to tail of subplan */
83 PLAN *subplan; /* pointer to head of ( ) expression */
96 for (tail = subplan = NULL;;) {
101 * subplan in our '(' node and convert the node to
104 * subplan.
107 if (subplan == NULL)
109 node->p_data[0] = subplan;
114 if (subplan == NULL)
115 tail = subplan = next;
180 * the expr subplan.
187 * it in the not's subplan. As an optimization we compress
238 * the expr subplan.
243 /* if we encounter a not then look for not's in the subplan */
249 * or's first subplan and then recursively collect the
250 * remaining stuff into the second subplan and return the or.