binutils/libiberty/regex.c

812    the START pointer into it and ending just before the pointer END.  */
1452   UCHAR_T *pointer;
1479   UCHAR_T *pointer;
1549 /* Push pointer POINTER on FAIL_STACK.
1556    : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER,	\
1559 /* Push a pointer value onto the failure stack.
1563   fail_stack.stack[fail_stack.avail++].pointer = (UCHAR_T *) (item)
1579 # define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1608        is wide enough to hold a value of something to which pointer can	\
1649 			reg_info[this_reg].word.pointer);		\
1769 		      reg_info[this_reg].word.pointer);			\
2707 	    /* Save b as laststart. And We use laststart as the pointer
2777 		    /* Update the pointer to indicate end of buffer.  */
2792 		    /* Update the pointer to indicate end of buffer.  */
2846 			/* Update the pointer to indicate end of buffer.  */
3056 			/* Update the pointer to indicate end of buffer.  */
4439   /* Have to increment the pointer into the pattern string, so the
4476   /* Have to increment the pointer into the pattern string, so the
4582   /* This holds the pointer to the failure stack, when
4615 	      p = fail_stack.stack[--fail_stack.avail].pointer;
4787 	      && fail_stack.stack[fail_stack.avail - 1].pointer == p)
5272 /* This converts PTR, a pointer into one of the search wchar_t strings
5282 /* This converts PTR, a pointer into one of the search strings `string1'
5624   /* This holds the pointer to the failure stack, when
5641      regnum-th regstart pointer points to where in the pattern we began
6038               /* Convert the pointer data in `regstart' and `regend' to