1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/* { dg-do compile } */
/* { dg-options "-O2 -fsplit-paths -fdump-tree-split-paths-details -w" } */
const extern char *__ctype_ptr__;
typedef unsigned char uchar;
static int patlen;
static int skip[(0x7f * 2 + 1) + 1];
static uchar *pat = ((void *) 0);
void
bmhi_init (const char *pattern)
{
int i, lastpatchar;
patlen = strlen (pattern);
for (i = 0; i < patlen; i++)
pat[i] = (
{
__typeof__ (pattern[i]) __x = (pattern[i]);
((((__ctype_ptr__ +
sizeof (""[__x]))[(int) (__x)]) & (01 | 02))
== 02) ? (int) __x - 'a' + 'A' : (int) __x;
});
for (i = 0; i < patlen - 1; ++i)
{
skip[(
{
__typeof__ (pat[i]) __x = (pat[i]);
((((__ctype_ptr__ +
sizeof (""[__x]))[(int) (__x)]) & (01 | 02)) ==
01) ? (int) __x - 'A' + 'a' : (int) __x;
})] = patlen - i - 1;
}
skip[(
{
__typeof__ (lastpatchar) __x = (lastpatchar);
((((__ctype_ptr__ +
sizeof (""[__x]))[(int) (__x)]) & (01 | 02)) ==
01) ? (int) __x - 'A' + 'a' : (int) __x;
})] = 32767;
for (i = 0; i < patlen - 1; ++i)
{
}
}
char *
bmhi_search (const char *string, const int stringlen)
{
int i, j;
char *s;
for (;;)
{
while (--j >= 0 && (
{
__typeof__ (s[j]) __x = (s[j]);
((((__ctype_ptr__ +
sizeof (""[__x]))[(int) (__x)]) &
(01 | 02)) ==
02) ? (int) __x - 'a' +
'A' : (int) __x;}) == pat[j]);
}}
/* { dg-final { scan-tree-dump-times "Duplicating join block" 2 "split-paths" } } */
|
