Lines Matching refs:U8

692 	if (PL_regkind[(U8)OP(scan)] == EXACT) {
703 ( PL_regkind[(U8)OP(n)] == NOTHING ||
709 if (PL_regkind[(U8)OP(n)] == NOTHING) {
773 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
774 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
783 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
804 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
915 UV uc = *((U8*)STRING(scan));
917 U8 *s = (U8*)STRING(scan);
936 mg->mg_len += utf8_length((U8*)STRING(scan),
937 (U8*)STRING(scan)+STR_LEN(scan));
975 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
977 UV uc = *((U8*)STRING(scan));
983 U8 *s = (U8 *)STRING(scan);
1029 switch (PL_regkind[(U8)OP(scan)]) {
1167 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1177 oscan->flags = (U8)ARG(nxt);
1213 oscan->flags = (U8)ARG(nxt);
1257 PREVOPER(nxt)->flags = (U8)(data->whilem_c
1291 old = utf8_hop((U8*)s, old) - (U8*)s;
1352 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1382 switch (PL_regkind[(U8)OP(scan)]) {
1569 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1574 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1609 scan->flags = (U8)minnext;
1683 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1689 New(1208, RExC_rx->data->what, n, U8);
1692 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1783 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1803 exp = (char*)Perl_bytes_to_utf8(aTHX_ (U8*)exp, &len);
1862 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1898 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1902 first += regarglen[(U8)OP(first)];
1908 if (PL_regkind[(U8)OP(first)] == EXACT) {
1916 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1917 PL_regkind[(U8)OP(first)] == NBOUND)
1919 else if (PL_regkind[(U8)OP(first)] == BOL) {
1934 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
2529 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2949 ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM));
2955 ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM));
2963 ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND));
2971 ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND));
2977 ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE));
2983 ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE));
3010 U8 c = (U8)*RExC_parse;
3061 (U8)(FOLD ? (LOC ? REFFL : REFF) : REF),
3100 U8 tmpbuf[UTF8_MAXLEN_FOLD+1], *foldbuf;
3109 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
3229 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3344 if (PL_encoding && PL_regkind[(U8)OP(ret)] == EXACT) {
3612 value = utf8n_to_uvchr((U8*)RExC_parse,
3624 value = utf8n_to_uvchr((U8*)RExC_parse,
3646 vFAIL2("Empty \\%c{}", (U8)value);
3648 U8 c = (U8)value;
4170 U8 foldbuf[UTF8_MAXLEN_FOLD+1];
4319 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
4355 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4394 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4403 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4408 register int offset = regarglen[(U8)op];
4410 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4495 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4498 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4532 register U8 op = EXACT; /* Arbitrary non-END op. */
4555 if (PL_regkind[(U8)op] == BRANCHJ) {
4563 else if (PL_regkind[(U8)op] == BRANCH) {
4570 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4583 else if (PL_regkind[(U8)op] == EXACT) {
4590 node += regarglen[(U8)op];
4732 k = PL_regkind[(U8)OP(o)];
4739 bool do_utf8 = is_utf8_string((U8*)STRING(o), STR_LEN(o));
4741 pv_uni_display(dsv, (U8*)STRING(o), STR_LEN(o), 60,
4765 U8 flags = ANYOF_FLAGS(o);
4840 U8 s[UTF8_MAXLEN+1];
4843 U8 *e = uvchr_to_utf8(s, i);
4849 U8 *p;
4937 s = (r->reganch & ROPT_UTF8) ? pv_uni_display(dsv, (U8*)r->precomp,