binutils/libiberty/regex.c

810    the START pointer into it and ending just before the pointer END.  */
1450   UCHAR_T *pointer;
1477   UCHAR_T *pointer;
1547 /* Push pointer POINTER on FAIL_STACK.
1554    : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER,	\
1557 /* Push a pointer value onto the failure stack.
1561   fail_stack.stack[fail_stack.avail++].pointer = (UCHAR_T *) (item)
1577 # define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1606        is wide enough to hold a value of something to which pointer can	\
1647 			reg_info[this_reg].word.pointer);		\
1767 		      reg_info[this_reg].word.pointer);			\
2704 	    /* Save b as laststart. And We use laststart as the pointer
2774 		    /* Update the pointer to indicate end of buffer.  */
2789 		    /* Update the pointer to indicate end of buffer.  */
2843 			/* Update the pointer to indicate end of buffer.  */
3053 			/* Update the pointer to indicate end of buffer.  */
4436   /* Have to increment the pointer into the pattern string, so the
4473   /* Have to increment the pointer into the pattern string, so the
4579   /* This holds the pointer to the failure stack, when
4612 	      p = fail_stack.stack[--fail_stack.avail].pointer;
4784 	      && fail_stack.stack[fail_stack.avail - 1].pointer == p)
5269 /* This converts PTR, a pointer into one of the search wchar_t strings
5279 /* This converts PTR, a pointer into one of the search strings `string1'
5621   /* This holds the pointer to the failure stack, when
5638      regnum-th regstart pointer points to where in the pattern we began
6032               /* Convert the pointer data in `regstart' and `regend' to