fail_stack 1195 libglibc/regex.c #define FAIL_STACK_EMPTY() (fail_stack.avail == 0) fail_stack 1197 libglibc/regex.c #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size) fail_stack 1206 libglibc/regex.c fail_stack.stack = (fail_stack_elt_t *) \ fail_stack 1209 libglibc/regex.c if (fail_stack.stack == NULL) \ fail_stack 1212 libglibc/regex.c fail_stack.size = INIT_FAILURE_ALLOC; \ fail_stack 1213 libglibc/regex.c fail_stack.avail = 0; \ fail_stack 1216 libglibc/regex.c # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack) fail_stack 1220 libglibc/regex.c fail_stack.avail = 0; \ fail_stack 1234 libglibc/regex.c #define DOUBLE_FAIL_STACK(fail_stack) \ fail_stack 1235 libglibc/regex.c ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \ fail_stack 1237 libglibc/regex.c : ((fail_stack).stack = (fail_stack_elt_t *) \ fail_stack 1238 libglibc/regex.c REGEX_REALLOCATE_STACK ((fail_stack).stack, \ fail_stack 1239 libglibc/regex.c (fail_stack).size * sizeof (fail_stack_elt_t), \ fail_stack 1240 libglibc/regex.c ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \ fail_stack 1242 libglibc/regex.c (fail_stack).stack == NULL \ fail_stack 1244 libglibc/regex.c : ((fail_stack).size <<= 1, \ fail_stack 1262 libglibc/regex.c fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item) fail_stack 1268 libglibc/regex.c fail_stack.stack[fail_stack.avail++].integer = (item) fail_stack 1274 libglibc/regex.c fail_stack.stack[fail_stack.avail++] = (item) fail_stack 1278 libglibc/regex.c #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer fail_stack 1279 libglibc/regex.c #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer fail_stack 1280 libglibc/regex.c #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail] fail_stack 1314 libglibc/regex.c DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\ fail_stack 1315 libglibc/regex.c DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\ fail_stack 1323 libglibc/regex.c if (!DOUBLE_FAIL_STACK (fail_stack)) \ fail_stack 1327 libglibc/regex.c (fail_stack).size); \ fail_stack 1405 libglibc/regex.c #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail) fail_stack 1430 libglibc/regex.c DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \ fail_stack 1431 libglibc/regex.c DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \ fail_stack 1433 libglibc/regex.c assert (fail_stack.avail >= NUM_NONREG_ITEMS); \ fail_stack 1815 libglibc/regex.c static fail_stack_type fail_stack; fail_stack 2959 libglibc/regex.c if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS)) fail_stack 2961 libglibc/regex.c fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS); fail_stack 2964 libglibc/regex.c if (! fail_stack.stack) fail_stack 2965 libglibc/regex.c fail_stack.stack fail_stack 2966 libglibc/regex.c = (fail_stack_elt_t *) xmalloc (fail_stack.size fail_stack 2969 libglibc/regex.c fail_stack.stack fail_stack 2970 libglibc/regex.c = (fail_stack_elt_t *) xrealloc (fail_stack.stack, fail_stack 2971 libglibc/regex.c (fail_stack.size fail_stack 2974 libglibc/regex.c if (! fail_stack.stack) fail_stack 2975 libglibc/regex.c fail_stack.stack fail_stack 2976 libglibc/regex.c = (fail_stack_elt_t *) malloc (fail_stack.size fail_stack 2979 libglibc/regex.c fail_stack.stack fail_stack 2980 libglibc/regex.c = (fail_stack_elt_t *) realloc (fail_stack.stack, fail_stack 2981 libglibc/regex.c (fail_stack.size fail_stack 3202 libglibc/regex.c fail_stack_type fail_stack; fail_stack 3247 libglibc/regex.c p = fail_stack.stack[--fail_stack.avail].pointer; fail_stack 3399 libglibc/regex.c && fail_stack.stack[fail_stack.avail - 1].pointer == p) fail_stack 3400 libglibc/regex.c fail_stack.avail--; fail_stack 3419 libglibc/regex.c if (!PUSH_PATTERN_OP (p + j, fail_stack)) fail_stack 3763 libglibc/regex.c REGEX_FREE_STACK (fail_stack.stack); \ fail_stack 3907 libglibc/regex.c fail_stack_type fail_stack;