blob: de28deefa6d7ab090730e84c7377316f3a751fa7 (
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
static int foo(int bar);
static int foo(int bar)
{
for (;;)
{
break;
}
if (a)
{
foo();
}
if (b)
if (c)
bar();
else
;
else
{
foo();
}
switch (a)
{
case 1: break;
case 2: break;
default: break;
}
while (b-->0)
{
bar();
}
do
{
bar();
} while (b-->0 );
}
enum FPP {
FPP_ONE = 1,
FPP_TWO = 2,
};
struct narg {
int abc;
char def;
const char *ghi;
};
class CFooRun {
long stick();
int bar() {
m_ick++;
}
CFooRun();
~CFooRun() {
}
};
void f()
{
if (tmp[0] == "disk")
{
tmp = split (tmp[1], ",");
DiskEntry entry = { tmp[0], tmp[2],
stxxl::int64 (str2int (tmp[1])) *
stxxl::int64 (1024 * 1024) };
disks_props.push_back (entry);
}
}
template < class > struct type;
template < class T >
class X {
typedef type < T > base;
void f () {
( base :: operator * () );
}
};
namespace N
{
class C
{
#define NOP(x) { \
}
};
}
namespace N
{
class C
{
};
}
void deallocate2(S **s_ptr)
{
{
void *stopper_for_apply = (int[]){0};
void **list_for_apply = (void *[]){(*s_ptr)->arr, *s_ptr, stopper_for_apply};
for (int i = 0;list_for_apply[i] != stopper_for_apply;i++) {
saferFree((void *) &(list_for_apply[i]));
}
}
}
|
