Lines Matching refs:subplan
74 PLAN *tail; /* pointer to tail of subplan */
75 PLAN *subplan; /* pointer to head of ( ) expression */
88 for (tail = subplan = NULL;;) {
93 * subplan in our '(' node and convert the node to
96 * subplan.
99 if (subplan == NULL)
101 node->p_data[0] = subplan;
105 if (subplan == NULL)
106 tail = subplan = next;
171 * the expr subplan.
178 * it in the not's subplan. As an optimization we compress
195 * the expr subplan.
233 * the expr subplan.
238 /* if we encounter a not then look for or's in the subplan */
244 * or's first subplan and then recursively collect the
245 * remaining stuff into the second subplan and return the or.