binutils/libiberty/regex.c

1460   unsigned long int avail;		/* Offset of next open position.  */
1487   unsigned avail;			/* Offset of next open position.  */
1493 #  define FAIL_STACK_EMPTY()     (fail_stack.avail == 0)
1494 #  define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
1495 #  define FAIL_STACK_FULL()      (fail_stack.avail == fail_stack.size)
1512     fail_stack.avail = 0;					\
1519     fail_stack.avail = 0;					\
1554    : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER,	\
1561   fail_stack.stack[fail_stack.avail++].pointer = (UCHAR_T *) (item)
1567   fail_stack.stack[fail_stack.avail++].integer = (item)
1573   fail_stack.stack[fail_stack.avail++] =  (item)
1577 # define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1578 # define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
1579 # define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
1613     DEBUG_PRINT2 ("  Before push, next avail: %d\n", (fail_stack).avail);\
1705 #  define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
1730   DEBUG_PRINT2 ("  Before pop, next avail: %d\n", fail_stack.avail);	\
1733   assert (fail_stack.avail >= NUM_NONREG_ITEMS);			\
2142   unsigned avail;			/* Offset of next open position.  */
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])
2410   compile_stack.avail = 0;
3703               compile_stack.avail++;
3750               assert (compile_stack.avail != 0);
3757                 compile_stack.avail--;
4344   for (this_element = compile_stack.avail - 1;
4612 	      p = fail_stack.stack[--fail_stack.avail].pointer;
4784 	      && fail_stack.stack[fail_stack.avail - 1].pointer == p)
4785             fail_stack.avail--;