Lines Matching refs:next
58 (*planp) = (*planp)->next;
59 node->next = NULL;
72 PLAN *next; /* temp node holding subexpression results */
89 if ((next = yankexpr(planp)) == NULL)
98 if (next->execute == f_closeparen) {
106 tail = subplan = next;
108 tail->next = next;
109 tail = next;
111 tail->next = NULL;
124 PLAN *expr; /* pointer to next expression */
146 tail->next = expr;
149 tail->next = NULL;
161 PLAN *next; /* next node being processed */
168 while ((next = yanknode(&plan))) {
173 if (next->execute == f_expr)
174 next->p_data[0] = not_squish(next->p_data[0]);
177 * if we encounter a not, then snag the next node and place
181 if (next->execute == f_not) {
200 next = node;
202 next->p_data[0] = node;
207 tail = result = next;
209 tail->next = next;
210 tail = next;
212 tail->next = NULL;
224 PLAN *next; /* next node being processed */
228 tail = result = next = NULL;
230 while ((next = yanknode(&plan)) != NULL) {
235 if (next->execute == f_expr)
236 next->p_data[0] = or_squish(next->p_data[0]);
239 if (next->execute == f_not)
240 next->p_data[0] = or_squish(next->p_data[0]);
247 if (next->execute == f_or) {
250 next->p_data[0] = result;
251 next->p_data[1] = or_squish(plan);
252 if (next->p_data[1] == NULL)
254 return (next);
259 tail = result = next;
261 tail->next = next;
262 tail = next;
264 tail->next = NULL;