contrib/less/regexp.c

161 static char *regparse;		/* Input-scan pointer. */
214 	register char *scan;
256 	scan = r->program+1;			/* First BRANCH. */
257 	if (OP(regnext(scan)) == END) {		/* Only one top-level choice. */
258 		scan = OPERAND(scan);
261 		if (OP(scan) == EXACTLY)
262 			r->regstart = *OPERAND(scan);
263 		else if (OP(scan) == BOL)
277 			for (; scan != NULL; scan = regnext(scan))
278 				if (OP(scan) == EXACTLY && ((int) strlen(OPERAND(scan))) >= len) {
279 					longest = OPERAND(scan);
280 					len = (int) strlen(OPERAND(scan));
659 	register char *scan;
667 	scan = p;
669 		temp = regnext(scan);
672 		scan = temp;
675 	if (OP(scan) == BACK)
676 		offset = (int) (scan - val);
678 		offset = (int) (val - scan);
679 	*(scan+1) = (offset>>8)&0377;
680 	*(scan+2) = offset&0377;
839 	register char *scan;	/* Current node. */
842 	scan = prog;
844 	if (scan != NULL && regnarrate)
845 		fprintf(stderr, "%s(\n", regprop(scan));
847 	while (scan != NULL) {
850 			fprintf(stderr, "%s...\n", regprop(scan));
852 		next = regnext(scan);
854 		switch (OP(scan)) {
872 				opnd = OPERAND(scan);
883  			if (*reginput == '\0' || strchr(OPERAND(scan), *reginput) == NULL)
888  			if (*reginput == '\0' || strchr(OPERAND(scan), *reginput) != NULL)
908 				no = OP(scan) - OPEN;
937 				no = OP(scan) - CLOSE;
958 					next = OPERAND(scan);	/* Avoid recursion. */
962 						if (regmatch(OPERAND(scan)))
965 						scan = regnext(scan);
966 					} while (scan != NULL && OP(scan) == BRANCH);
987 				min = (OP(scan) == STAR) ? 0 : 1;
989 				no = regrepeat(OPERAND(scan));
1014 		scan = next;
1033 	register char *scan;
1036 	scan = reginput;
1040 		count = (int) strlen(scan);
1041 		scan += count;
1044 		while (*opnd == *scan) {
1046 			scan++;
1050 		while (*scan != '\0' && strchr(opnd, *scan) != NULL) {
1052 			scan++;
1056 		while (*scan != '\0' && strchr(opnd, *scan) == NULL) {
1058 			scan++;
1066 	reginput = scan;