Therefore it is not "simple", and should not be compiled as such,
causing things like the test added herein to fail.
goto finish_meta_pat;
case 'R':
ret = reg_node(pRExC_state, LNBREAK);
- *flagp |= HASWIDTH|SIMPLE;
+ *flagp |= HASWIDTH;
goto finish_meta_pat;
case 'h':
ret = reg_node(pRExC_state, HORIZWS);
}
break;
case LNBREAK:
- if (utf8_target) {
- loceol = PL_regeol;
- while (hardcount < max && scan < loceol &&
- (c=is_LNBREAK_utf8_safe(scan, loceol))) {
- scan += c;
- hardcount++;
- }
- } else {
- /*
- LNBREAK can match two latin chars, which is ok,
- because we have a null terminated string, but we
- have to use hardcount in this situation
- */
- while (scan < loceol && (c=is_LNBREAK_latin1_safe(scan, loceol))) {
- scan+=c;
- hardcount++;
- }
- }
- break;
+ Perl_croak(aTHX_ "panic: regrepeat() should not be called with non-simple: LNBREAK");
+ assert(0); /* NOTREACHED */
case HORIZWS:
if (utf8_target) {
loceol = PL_regeol;
(\x{100}) \x{2000}\x{2000}\x{2000}\x{100} y $-[0]:$-[1]:$+[0]:$+[1] 3:3:4:4
+^\R{2}$ \r\n\r\n y $& \r\n\r\n
+
# vim: softtabstop=0 noexpandtab