Lines Matching refs:next
64 (*planp) = (*planp)->next;
65 node->next = NULL;
78 PLAN *next; /* temp node holding subexpression results */
95 if ((next = yankexpr(planp)) == NULL)
104 if (next->execute == f_closeparen) {
112 tail = subplan = next;
114 tail->next = next;
115 tail = next;
117 tail->next = NULL;
130 PLAN *expr; /* pointer to next expression */
152 tail->next = expr;
155 tail->next = NULL;
167 PLAN *next; /* next node being processed */
174 while ((next = yanknode(&plan))) {
179 if (next->execute == f_expr)
180 next->p_data[0] = not_squish(next->p_data[0]);
183 * if we encounter a not, then snag the next node and place
187 if (next->execute == f_not) {
206 next = node;
208 next->p_data[0] = node;
213 tail = result = next;
215 tail->next = next;
216 tail = next;
218 tail->next = NULL;
230 PLAN *next; /* next node being processed */
234 tail = result = next = NULL;
236 while ((next = yanknode(&plan)) != NULL) {
241 if (next->execute == f_expr)
242 next->p_data[0] = or_squish(next->p_data[0]);
245 if (next->execute == f_not)
246 next->p_data[0] = or_squish(next->p_data[0]);
253 if (next->execute == f_or) {
256 next->p_data[0] = result;
257 next->p_data[1] = or_squish(plan);
258 if (next->p_data[1] == NULL)
260 return (next);
265 tail = result = next;
267 tail->next = next;
268 tail = next;
270 tail->next = NULL;