Lines Matching defs:next
971 bin_tree_storage_t *storage, *next;
972 for (storage = dfa->str_tree_storage; storage; storage = next)
974 next = storage->next;
1003 Then we add epsilon closures of the nodes which are the next nodes of
1150 /* Analyze the structure tree, and calculate "first", "next", "edest",
1399 node->left->next = node;
1402 node->left->next = node->right->first;
1403 node->right->next = node->next;
1407 node->left->next = node->next;
1409 node->right->next = node->next;
1429 assert (node->next == NULL);
1440 left = node->next->node_idx;
1444 right = node->next->node_idx;
1454 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
1458 dfa->nexts[idx] = node->next->node_idx;
1465 dfa->nexts[idx] = node->next->node_idx;
1999 re_token_t next;
2001 peek_token (&next, input, syntax);
2003 if (next.type != OP_ALT && next.type != OP_CLOSE_SUBEXP)
3146 /* Get information about the next token. We need it in any case. */
3799 storage->next = dfa->str_tree_storage;
3812 tree->next = NULL;