Lines Matching refs:next
87 mod_ptr = mod_ptr->next) {
238 * match, then walk further so that the next iteration
296 * in preparation for the next iteration.
490 /* Parse next token */
516 rp = rp->next) {
526 /* Parse next token */
574 for (this_rule = rule; this_rule != NULL; this_rule = this_rule->next) {
581 new_mod_ptr->next = this_rule->modifiers;
587 while (curr_mod_ptr->next != NULL)
588 curr_mod_ptr = curr_mod_ptr->next;
590 curr_mod_ptr->next = new_mod_ptr;
602 * generated and run it through again, this time looking at the next component.
688 * add the path to the next linked list, which
689 * will be matched on the next iteration.
702 * examined on the next iteration.
716 /* Add to the next lined list */
728 current_level = current_level->next;
733 * OK, done with this level. Move to the next level and
761 current_level = current_level->next;
772 current_level = current_level->next;
796 * If the rules list does exist, then traverse the next element.
802 current_rule->next = gen_rulestruct();
803 current_rule->next->prev = current_rule;
804 current_rule = current_rule->next;
832 /* read the next input line, with all continuations */
912 struct dir_component *next;
915 next = dir->next;
917 dir = next;
938 while (next_dir->next != NULL)
939 next_dir = next_dir->next;
941 next_dir->next = new;
959 if (curr_root->next == NULL)
962 curr_root = curr_root->next;
980 * Traverse the next entry, used by 'bart create' to iterate through
986 return (entry->next);