src/regex/regcomp.c

173 	tre_iteration_t *iter;
175 	iter = tre_mem_calloc(mem, sizeof *iter);
176 	node = tre_ast_new_node(mem, ITERATION, iter);
179 	iter->arg = arg;
180 	iter->min = min;
181 	iter->max = max;
182 	iter->minimal = minimal;
1391 		tre_iteration_t *iter = node->obj;
1395 		    STACK_PUSHX(stack, int, regset[0] >= 0 || iter->minimal);
1400 		    STACK_PUSHX(stack, int, iter->minimal);
1405 		STACK_PUSHX(stack, voidptr, iter->arg);
1409 		if (regset[0] >= 0 || iter->minimal)
1415 			if (iter->minimal)
1788 		tre_iteration_t *iter = node->obj;
1789 		STACK_PUSHX(stack, voidptr, iter->arg);
1791 		*result = tre_ast_new_iter(mem, iter->arg, iter->min,
1792 					   iter->max, iter->minimal);
1798 		iter = (*result)->obj;
1799 		result = &iter->arg;
1879 		tre_iteration_t *iter = node->obj;
1883 		STACK_PUSHX(stack, voidptr, iter->arg);
1888 		if (iter->min > 1 || iter->max > 1)
1900 	    tre_iteration_t *iter = node->obj;
1904 	    if (iter->min > 1 || iter->max > 1)
1911 		for (j = 0; j < iter->min; j++)
1915 		    int flags = ((j + 1 < iter->min)
1919 		    status = tre_copy_ast(mem, stack, iter->arg, flags,
1932 		if (iter->max == -1)
1936 		    status = tre_copy_ast(mem, stack, iter->arg, 0,
1946 		    for (j = iter->min; j < iter->max; j++)
1950 			status = tre_copy_ast(mem, stack, iter->arg, 0,
2126   tre_iteration_t *iter;
2204 	  iter = (tre_iteration_t *)node->obj;
2205 	  if (iter->arg->nullable)
2206 	    STACK_PUSHX(stack, voidptr, iter->arg);
2350 	    tre_iteration_t *iter = (tre_iteration_t *)node->obj;
2352 	    if (iter->min == 0 || iter->arg->nullable)
2356 	    node->firstpos = iter->arg->firstpos;
2357 	    node->lastpos = iter->arg->lastpos;
2615   tre_iteration_t *iter;
2646       iter = (tre_iteration_t *)node->obj;
2647       assert(iter->max == -1 || iter->max == 1);
2649       if (iter->max == -1)
2651 	  assert(iter->min == 0 || iter->min == 1);
2654 	  errcode = tre_make_trans(iter->arg->lastpos, iter->arg->firstpos,
2659       errcode = tre_ast_to_tnfa(iter->arg, transitions, counts, offs);