avail 1165 libglibc/regex.c unsigned long int avail; /* Offset of next open position. */
avail 1190 libglibc/regex.c unsigned avail; /* Offset of next open position. */
avail 1195 libglibc/regex.c #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)
avail 1196 libglibc/regex.c #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
avail 1197 libglibc/regex.c #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
avail 1213 libglibc/regex.c fail_stack.avail = 0; \
avail 1220 libglibc/regex.c fail_stack.avail = 0; \
avail 1255 libglibc/regex.c : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \
avail 1262 libglibc/regex.c fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
avail 1268 libglibc/regex.c fail_stack.stack[fail_stack.avail++].integer = (item)
avail 1274 libglibc/regex.c fail_stack.stack[fail_stack.avail++] = (item)
avail 1278 libglibc/regex.c #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
avail 1279 libglibc/regex.c #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
avail 1280 libglibc/regex.c #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
avail 1314 libglibc/regex.c DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\
avail 1405 libglibc/regex.c #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
avail 1430 libglibc/regex.c DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \
avail 1433 libglibc/regex.c assert (fail_stack.avail >= NUM_NONREG_ITEMS); \
avail 1742 libglibc/regex.c unsigned avail; /* Offset of next open position. */
avail 1748 libglibc/regex.c #define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
avail 1749 libglibc/regex.c #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
avail 1752 libglibc/regex.c #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
avail 1954 libglibc/regex.c compile_stack.avail = 0;
avail 2475 libglibc/regex.c compile_stack.avail++;
avail 2522 libglibc/regex.c assert (compile_stack.avail != 0);
avail 2529 libglibc/regex.c compile_stack.avail--;
avail 3113 libglibc/regex.c for (this_element = compile_stack.avail - 1;
avail 3247 libglibc/regex.c p = fail_stack.stack[--fail_stack.avail].pointer;
avail 3399 libglibc/regex.c && fail_stack.stack[fail_stack.avail - 1].pointer == p)
avail 3400 libglibc/regex.c fail_stack.avail--;