Lines Matching defs:compile_stack
2148 # define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
2149 # define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
2152 # define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
2263 static boolean group_in_compile_stack (compile_stack_type compile_stack,
2288 return (free(pattern), free(mbs_offset), free(is_binary), free (compile_stack.stack), value)
2291 return (free (compile_stack.stack), value)
2323 compile_stack_type compile_stack;
2398 compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
2399 if (compile_stack.stack == NULL)
2409 compile_stack.size = INIT_COMPILE_STACK_SIZE;
2410 compile_stack.avail = 0;
3675 RETALLOC (compile_stack.stack, compile_stack.size << 1,
3677 if (compile_stack.stack == NULL) return REG_ESPACE;
3679 compile_stack.size <<= 1;
3703 compile_stack.avail++;
3750 assert (compile_stack.avail != 0);
3757 compile_stack.avail--;
4080 if (group_in_compile_stack (compile_stack, (regnum_t) c1))
4175 free (compile_stack.stack);
4340 group_in_compile_stack (compile_stack_type compile_stack, regnum_t regnum)
4344 for (this_element = compile_stack.avail - 1;
4347 if (compile_stack.stack[this_element].regnum == regnum)