Lines Matching +defs:outer +defs:s +defs:b

97 	bool outer;
199 #define	SEETWO(a, b)	(MORE() && MORE2() && PEEK() == (a) && PEEK2() == (b))
202 #define	EATTWO(a, b)	((SEETWO(a, b)) ? (NEXT2(), 1) : 0)
225 #define MIN(a,b)	((a)<(b)?(a):(b))
539 			case 'b':
545 			case 's':
651 		ASTERN(OOR1, pos);		/* this one's right */
780 	else if ((ate > 1 || (bc->outer && !MORE())) && !p_branch_empty(p, bc))
840 		bc.outer = true;
842 		bc.outer = false;
864 		 * p_branch_do's return value indicates whether we should
919 			case BACKSL|'b':
925 			case BACKSL|'s':
1257  - p_b_pseudoclass - parse a pseudo-class (\w, \W, \s, \S)
1280 	case 's':
1436 	 * special meaning, e.g. \b, \B, \w, \W, \s, \S.
1740 	wint_t i, s, n;
1745 			s = i;
1748 		return (s);
1869  * hard-case backup, but it's just too big and messy unless there are
1889 	/* finally, it's all reduced to the easy case */
1901 	sop s;
1913 	s = p->strip[sn];
1928 	p->strip[pos] = s;
2009 	sop s;
2023 	 * It's not generally safe to do a ``char'' substring search on
2024 	 * multibyte character strings, but it's safe for at least
2038 		s = *scan++;
2039 		switch (OP(s)) {
2047 			size_t clen = wcrtomb(buf, (int)OPND(s), &mbs);
2064 				scan += OPND(s);
2065 				s = *scan;
2067 				if (OP(s) != O_QUEST &&
2068 				    OP(s) != O_CH && OP(s) != OOR2) {
2072 			} while (OP(s) != O_QUEST && OP(s) != O_CH);
2155 	} while (OP(s) != OEND);
2173 		while (OP(s = *scan++) != OCHAR)
2176 		size_t clen = wcrtomb(cp, (int)OPND(s), &mbs);
2180 		*cp++ = OPND(s);
2199 	sop s;
2209 	s = *scan++;
2210 	while (OP(s) != O_QUEST && OP(s) != O_CH) {
2211 		switch (OP(s)) {
2224 				scan += OPND(s);
2225 				s = *scan;
2226 				if (OP(s) != O_QUEST &&
2227 				    OP(s) != O_CH && OP(s) != OOR2)
2229 			} while (OP(s) != O_QUEST && OP(s) != O_CH);
2254 		s = *scan++;
2268  * zero. It's based on the algorithm found on Computer Algorithms by
2313  * zero. It's based on the algorithm found on Computer Algorithms by
2375 	 * it's own suffix.
2403 	sop s;
2415 		s = *scan++;
2416 		switch (OP(s)) {
2426 	} while (OP(s) != OEND);