forked from github/codeql
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.java
More file actions
247 lines (221 loc) · 5.19 KB
/
C.java
File metadata and controls
247 lines (221 loc) · 5.19 KB
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
import java.util.*;
public class C {
public void ex1(long[][][] a1, int ix, int len) {
long[][] a2 = null;
boolean haveA2 = ix < len && (a2 = a1[ix]) != null;
long[] a3 = null;
final boolean haveA3 = haveA2 && (a3 = a2[ix]) != null; // NPE - false positive
if (haveA3) a3[0] = 0; // NPE - false positive
}
public void ex2(boolean x, boolean y) {
String s1 = x ? null : "";
String s2 = (s1 == null) ? null : "";
if (s2 == null) {
s1 = y ? null : "";
s2 = (s1 == null) ? null : "";
}
if (s2 != null)
s1.hashCode(); // NPE - false positive
}
public void ex3(List<String> ss) {
String last = null;
for (String s : new String[] { "aa", "bb" }) {
last = s;
}
last.hashCode(); // OK
last = null;
if (!ss.isEmpty()) {
for (String s : ss) {
last = s;
}
last.hashCode(); // OK
}
}
public void ex4(Iterable<String> list, int step) {
int index = 0;
List<List<String>> result = new ArrayList<>();
List<String> slice = null;
Iterator<String> iter = list.iterator();
while (iter.hasNext()) {
String str = iter.next();
if (index % step == 0) {
slice = new ArrayList<>();
result.add(slice);
}
slice.add(str); // NPE - false positive
++index;
iter.remove();
}
}
public void ex5(boolean hasArr, int[] arr) {
int arrLen = 0;
if (hasArr) {
arrLen = arr == null ? 0 : arr.length;
}
if (arrLen > 0) {
arr[0] = 0; // NPE - false positive
}
}
public final int MY_CONST_A = 1;
public final int MY_CONST_B = 2;
public final int MY_CONST_C = 3;
public void ex6(int[] vals, boolean b1, boolean b2) {
final int switchguard;
if (vals != null && b1) {
switchguard = MY_CONST_A;
} else if (vals != null && b2) {
switchguard = MY_CONST_B;
} else {
switchguard = MY_CONST_C;
}
switch (switchguard) {
case MY_CONST_A:
vals[0] = 0; // OK
break;
case MY_CONST_C:
break;
case MY_CONST_B:
vals[0] = 0; // OK
break;
default:
throw new RuntimeException();
}
}
public void ex7(int[] arr1) {
int[] arr2 = null;
if (arr1.length > 0) {
arr2 = new int[arr1.length];
}
for (int i = 0; i < arr1.length; i++)
arr2[i] = arr1[i]; // NPE - false positive
}
public void ex8(int x, int lim) {
boolean stop = x < 1;
int i = 0;
Object obj = new Object();
while (!stop) {
int j = 0;
while (!stop && j < lim) {
int step = (j * obj.hashCode()) % 10; // NPE - false positive
if (step == 0) {
obj.hashCode();
i += 1;
stop = i >= x;
if (!stop) {
obj = new Object();
} else {
obj = null;
}
continue;
}
j += step;
}
}
}
public void ex9(boolean cond, Object obj1) {
if (cond) {
return;
}
Object obj2 = obj1;
if (obj2 != null && obj2.hashCode() % 5 > 2) {
obj2.hashCode();
cond = true;
}
if (cond) {
obj2.hashCode(); // NPE - false positive
}
}
public void ex10(int[] a) {
int n = a == null ? 0 : a.length;
for (int i = 0; i < n; i++) {
int x = a[i]; // NPE - false positive
if (x > 7)
a = new int[n];
}
}
public void ex11(Object obj, Boolean b1) {
Boolean b2 = obj == null ? Boolean.FALSE : b1;
if (b2 == null) {
obj.hashCode(); // OK
}
if (obj == null) {
b1 = Boolean.TRUE;
}
if (b1 == null) {
obj.hashCode(); // OK
}
}
private final Object finalObj = new Object();
public void ex12() {
finalObj.hashCode(); // OK
if (finalObj != null) {
finalObj.hashCode(); // OK
}
}
private void verifyBool(boolean b) {
if (!b) {
throw new Error();
}
}
public void ex13(int[] a) {
int i = 0;
boolean b = false;
Object obj = null;
while (a[++i] != 0) {
if (a[i] == 1) {
obj = new Object();
b = true;
} else if (a[i] == 2) {
verifyBool(b);
obj.hashCode(); // NPE - false positive
}
}
}
private void verifyNotNull(Object obj) {
if (obj == null) {
throw new Error();
}
}
public void ex14(int[] a) {
int i = 0;
Object obj = null;
while (a[++i] != 0) {
if (a[i] == 1) {
obj = new Object();
} else if (a[i] == 2) {
verifyNotNull(obj);
obj.hashCode(); // NPE - false positive
}
}
}
public void ex15(Object o1, Object o2) {
if (o1 == null && o2 != null) {
return;
}
if (o1 == o2) {
return;
}
if (o1.equals(o2)) { // NPE - false positive
return;
}
}
private Object foo16;
private Object getFoo16() {
return this.foo16;
}
public static void ex16(C c) {
int[] xs = c.getFoo16() != null ? new int[5] : null;
if (c.getFoo16() != null) {
xs[0]++; // NPE - false positive
}
}
public static final int MAXLEN = 1024;
public void ex17() {
int[] xs = null;
// loop executes at least once
for (int i = 32; i <= MAXLEN; i *= 2) {
xs = new int[5];
}
xs[0]++; // OK
}
}