Searched refs:fail_stack (Results 1 – 3 of 3) sorted by relevance
1077 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)1079 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)1088 fail_stack.stack = (fail_stack_elt_t *) \1091 if (fail_stack.stack == NULL) \1094 fail_stack.size = INIT_FAILURE_ALLOC; \1095 fail_stack.avail = 0; \1098 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)1102 fail_stack.avail = 0; \1116 #define DOUBLE_FAIL_STACK(fail_stack) \ argument1117 ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \[all …]
1164 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)1166 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)1175 fail_stack.stack = (fail_stack_elt_t *) \1179 if (fail_stack.stack == NULL) \1182 fail_stack.size = INIT_FAILURE_ALLOC; \1183 fail_stack.avail = 0; \1186 #define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)1190 fail_stack.avail = 0; \1212 #define GROW_FAIL_STACK(fail_stack) \ argument1213 (((fail_stack).size * sizeof (fail_stack_elt_t) \[all …]
1483 # define FAIL_STACK_EMPTY() (fail_stack.avail == 0)1485 # define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)1495 fail_stack.stack = (PREFIX(fail_stack_elt_t) *) \1498 if (fail_stack.stack == NULL) \1501 fail_stack.size = INIT_FAILURE_ALLOC; \1502 fail_stack.avail = 0; \1505 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)1509 fail_stack.avail = 0; \1523 # define DOUBLE_FAIL_STACK(fail_stack) \ argument1524 ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \[all …]