blob: ab5a68533165f09e4a4a5da4286f1cce4b269740 (
plain)
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
61
62
63
64
65
66
67
|
/* { dg-options "-O2 -fdump-tree-graphite-all" } */
typedef struct _IO_FILE FILE;
struct _IO_marker {
};
enum __codecvt_result
{
__codecvt_noconv
};
struct _IO_FILE {
};
extern struct _IO_FILE *stderr;
typedef
struct {
unsigned int avail_in;
unsigned int avail_out;
void *state;
void *(*bzalloc)(void *,int,int);
void *opaque;
}
bz_stream;
extern int BZ2_bzCompressInit (
bz_stream* strm,
int blockSize100k,
int verbosity,
int workFactor
);
typedef unsigned char Bool;
typedef int Int32;
typedef unsigned int UInt32;
typedef
struct {
Int32 mode;
Int32 state;
UInt32* arr1;
UInt32* arr2;
UInt32* ftab;
Int32 nblock;
Int32 nblockMAX;
Bool inUse[256];
Int32 blockNo;
}
EState;
void prepare_new_block ( EState* s )
{
Int32 i;
for (i = 0; i < 256; i++) s->inUse[i] = ((Bool)0);
s->blockNo++;
}
int BZ2_bzCompressInit
( bz_stream* strm,
int blockSize100k,
int verbosity,
int workFactor )
{
EState* s;
s = (strm->bzalloc)(strm->opaque,(sizeof(EState)),1);
if (s->arr1 == ((void *)0) || s->arr2 == ((void *)0) || s->ftab == ((void *)0)) {
}
prepare_new_block ( s );
}
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
