Lines Matching refs:fail_stack
1207 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)
1209 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
1218 fail_stack.stack = (fail_stack_elt_t *) \
1221 if (fail_stack.stack == NULL) \
1224 fail_stack.size = INIT_FAILURE_ALLOC; \
1225 fail_stack.avail = 0; \
1228 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
1232 fail_stack.avail = 0; \
1246 #define DOUBLE_FAIL_STACK(fail_stack) \
1247 ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \
1249 : ((fail_stack).stack = (fail_stack_elt_t *) \
1250 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
1251 (fail_stack).size * sizeof (fail_stack_elt_t), \
1252 ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \
1254 (fail_stack).stack == NULL \
1256 : ((fail_stack).size <<= 1, \
1271 Assumes the variable `fail_stack'. Probably should only
1274 fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
1277 Assumes the variable `fail_stack'. Probably should only
1280 fail_stack.stack[fail_stack.avail++].integer = (item)
1283 Assumes the variable `fail_stack'. Probably should only
1286 fail_stack.stack[fail_stack.avail++] = (item)
1289 All assume that `fail_stack' is nonempty. */
1290 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1291 #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
1292 #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
1307 Requires variables fail_stack, regstart, regend, reg_info, and
1326 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\
1327 DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\
1335 if (!DOUBLE_FAIL_STACK (fail_stack)) \
1339 (fail_stack).size); \
1417 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
1429 Also assumes the variables `fail_stack' and (if debugging), `bufp',
1442 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \
1443 DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \
1445 assert (fail_stack.avail >= NUM_NONREG_ITEMS); \
1830 static fail_stack_type fail_stack;
2970 if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS))
2972 fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS);
2975 if (! fail_stack.stack)
2976 fail_stack.stack
2977 = (fail_stack_elt_t *) xmalloc (fail_stack.size
2980 fail_stack.stack
2981 = (fail_stack_elt_t *) xrealloc (fail_stack.stack,
2982 (fail_stack.size
2985 if (! fail_stack.stack)
2986 fail_stack.stack
2987 = (fail_stack_elt_t *) malloc (fail_stack.size
2990 fail_stack.stack
2991 = (fail_stack_elt_t *) realloc (fail_stack.stack,
2992 (fail_stack.size
3212 fail_stack_type fail_stack;
3257 p = fail_stack.stack[--fail_stack.avail].pointer;
3409 && fail_stack.stack[fail_stack.avail - 1].pointer == p)
3410 fail_stack.avail--;
3429 if (!PUSH_PATTERN_OP (p + j, fail_stack))
3776 REGEX_FREE_STACK (fail_stack.stack); \
3921 fail_stack_type fail_stack;