| 1 |
/* This testcase would cause a hang in PTA solving due to a complex copy |
| 2 |
constraint and marking the wrong variable as changed. */ |
| 3 |
|
| 4 |
typedef struct RExC_state_t |
| 5 |
{ |
| 6 |
char *end; |
| 7 |
char *parse; |
| 8 |
} RExC_state_t; |
| 9 |
|
| 10 |
struct regnode_string |
| 11 |
{ |
| 12 |
unsigned char str_len; |
| 13 |
char string[1]; |
| 14 |
}; |
| 15 |
|
| 16 |
int regcurly (char *); |
| 17 |
void reguni (RExC_state_t *, unsigned, unsigned char *, unsigned long *); |
| 18 |
|
| 19 |
static void *regatom (RExC_state_t * pRExC_state, int *flagp); |
| 20 |
|
| 21 |
static void * |
| 22 |
regpiece (RExC_state_t * pRExC_state, int *flagp) |
| 23 |
{ |
| 24 |
return regatom (0, 0); |
| 25 |
} |
| 26 |
|
| 27 |
static void * |
| 28 |
regbranch (RExC_state_t * pRExC_state, int *flagp, int first) |
| 29 |
{ |
| 30 |
return regpiece (0, 0); |
| 31 |
} |
| 32 |
|
| 33 |
static void * |
| 34 |
reg (RExC_state_t * pRExC_state, int paren, int *flagp) |
| 35 |
{ |
| 36 |
return regbranch (0, 0, 1); |
| 37 |
} |
| 38 |
|
| 39 |
void * |
| 40 |
Perl_pregcomp (char *exp, char *xend, void *pm) |
| 41 |
{ |
| 42 |
return reg (0, 0, 0); |
| 43 |
} |
| 44 |
|
| 45 |
static void * |
| 46 |
regatom (RExC_state_t * pRExC_state, int *flagp) |
| 47 |
{ |
| 48 |
register void *ret = 0; |
| 49 |
int flags; |
| 50 |
|
| 51 |
tryagain: |
| 52 |
switch (*(pRExC_state->parse)) |
| 53 |
{ |
| 54 |
case '(': |
| 55 |
ret = reg (pRExC_state, 1, &flags); |
| 56 |
if (flags & 0x8) |
| 57 |
{ |
| 58 |
goto tryagain; |
| 59 |
} |
| 60 |
break; |
| 61 |
default: |
| 62 |
{ |
| 63 |
register unsigned long len; |
| 64 |
register unsigned ender; |
| 65 |
register char *p; |
| 66 |
char *oldp, *s; |
| 67 |
unsigned long numlen; |
| 68 |
unsigned long foldlen; |
| 69 |
unsigned char tmpbuf[6 + 1], *foldbuf; |
| 70 |
|
| 71 |
defchar: |
| 72 |
s = (((struct regnode_string *) ret)->string); |
| 73 |
for (len = 0, p = (pRExC_state->parse) - 1; |
| 74 |
len < 127 && p < (pRExC_state->end); len++) |
| 75 |
{ |
| 76 |
if (((*p) == '*' || (*p) == '+' || (*p) == '?' |
| 77 |
|| ((*p) == '{' && regcurly (p)))) |
| 78 |
{ |
| 79 |
unsigned long unilen; |
| 80 |
for (foldbuf = tmpbuf; foldlen; foldlen -= numlen) |
| 81 |
{ |
| 82 |
reguni (pRExC_state, ender, s, &unilen); |
| 83 |
s += unilen; |
| 84 |
} |
| 85 |
break; |
| 86 |
} |
| 87 |
unsigned long unilen; |
| 88 |
|
| 89 |
reguni (pRExC_state, ender, s, &unilen); |
| 90 |
s += unilen; |
| 91 |
} |
| 92 |
|
| 93 |
}; |
| 94 |
break; |
| 95 |
} |
| 96 |
return (ret); |
| 97 |
} |