-
Notifications
You must be signed in to change notification settings - Fork 392
/
LongAndAsRotateTest.cpp
522 lines (420 loc) · 22.5 KB
/
LongAndAsRotateTest.cpp
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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
/*******************************************************************************
* Copyright (c) 2017, 2021 IBM Corp. and others
*
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which accompanies this
* distribution and is available at http://eclipse.org/legal/epl-2.0
* or the Apache License, Version 2.0 which accompanies this distribution
* and is available at https://www.apache.org/licenses/LICENSE-2.0.
*
* This Source Code may also be made available under the following Secondary
* Licenses when the conditions for such availability set forth in the
* Eclipse Public License, v. 2.0 are satisfied: GNU General Public License,
* version 2 with the GNU Classpath Exception [1] and GNU General Public
* License, version 2 with the OpenJDK Assembly Exception [2].
*
* [1] https://www.gnu.org/software/classpath/license.html
* [2] http://openjdk.java.net/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0 WITH Classpath-exception-2.0 OR LicenseRef-GPL-2.0 WITH Assembly-exception
*******************************************************************************/
#include "JitTest.hpp"
#include "default_compiler.hpp"
// these two arrays hold the value loaded by the iload node.
int32_t i2lInput [] = {0x0, 0x1, 0x0000FFFF, 0x2, 0x3E, (int32_t)0x80000000, (int32_t)0xFFFF0000,
0x40000000, 0x7C000000, (int32_t)0xFFFFFFFF, 0x0003C000, 0x40000001};
uint32_t iu2lInput [] = {0x0,0x1,0x0000FFFF,0x2,0x3E,0x80000000,0xFFFF0000,0x40000000,0x7C000000,
0xFFFFFFFF,0x0003C000,0x40000001};
// This array consists of all cases where contiguous 1's appear at most once in the binary value
// ex: 001111000, 1111111, 011110, 1110000, 00001111
uint64_t lconstInput_zerosAroundOnes [] = { 0x7000000000000000,
0x0,
0x1, //00000..00001
0x00000000FFFFFFFF, //00000..11111
0x2, //00000..00010
0x3E, //00...0111110
0x8000000000000000, //10000000..00
0xFFFFFFFF00000000, //111111..0000
0x4000000000000000, //010000..0000
0x7C00000000000000, //0111100..000
0xFFFFFFFFFFFFFFFF, //1111111..111
0x00000003C0000000, //0..011110..0
0x00007FFFFFFFFFFF,
0x0000FFFFFFFFFFFF,
0x000000000000FFFF,
0xFFFFFFFFFFFE0000,
0xFFFFFFFFFFFF0000,
0xFFFF000000000000
};
// this array is for tests where contiguous zeros only appear once in the binary value.
// ex: 11100001111, 1000001, 0000000
uint64_t lconstInput_onesAroundZeros [] = {0x0, 0x8000000000000001, 0xE000000000000003, 0xFFFFFFF00FFFFFFF,
0xFFFFFFFEFFFFFFFF, 0xFFFFFFFE7FFFFFFF, 0xF0FFFFFFFFFFFFFF,
0xFFFFFFFFFFFFFF0F, 0XFFFF000000000001, 0x8000FFFFFFFFFFFF};
// These input values cannot be handled by a RISBG instruction
uint64_t lconstInput_invalidPatterns [] = {0x4000000000000001, 0xF0F0F0F0F0F0F0F0, 0x8000000000000002};
template <typename VarType, typename ConstType>
class LongAndAsRotateTest : public TRTest::TestWithPortLib, public ::testing::WithParamInterface<std::tuple<VarType, ConstType, ConstType (*) (VarType, ConstType)>>
{
public:
static void SetUpTestCase()
{
const char *options = "-Xjit:disableTreeSimplification,disableAsyncCompilation,acceptHugeMethods,enableBasicBlockHoisting,"
"omitFramePointer,useIlValidator,paranoidoptcheck";
auto initSuccess = initializeJitWithOptions(const_cast<char*>(options));
ASSERT_TRUE(initSuccess) << "Failed to initialize JIT.";
}
static void TearDownTestCase()
{
shutdownJit();
}
};
template <typename VarType, typename ConstType>
struct LongAndAsRotateParamStruct
{
VarType variableValue; //not known at compile time
ConstType constantValue; //known at compile time
ConstType (*oracle)(VarType, ConstType);
};
template <typename VarType, typename ConstType>
LongAndAsRotateParamStruct<VarType, ConstType> to_struct(const std::tuple<VarType, ConstType, ConstType (*) (VarType, ConstType)> ¶m)
{
LongAndAsRotateParamStruct<VarType, ConstType> s;
s.variableValue = std::get<0>(param);
s.constantValue = std::get<1>(param);
s.oracle = std::get<2>(param);
return s;
}
template <typename VarType, typename ConstType>
static ConstType longAndAsRotateOracle(VarType a, ConstType b)
{
return ((ConstType)a & b);
}
class i2lLongAndAsRotateTest : public LongAndAsRotateTest<int32_t, uint64_t> {};
TEST_P(i2lLongAndAsRotateTest, SimpleTest)
{
auto param = to_struct(GetParam());
char inputTrees[512] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method return=Int64 args=[Int32] "
" (block "
" (lreturn "
" (land "
" (i2l (iload parm=0)) "
" (lconst %" OMR_PRIu64 "))))) ",
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(int32_t)>();
ASSERT_EQ(param.oracle(param.variableValue, param.constantValue), entry_point(param.variableValue));
}
TEST_P(i2lLongAndAsRotateTest, iConstTest)
{
auto param = to_struct(GetParam());
// this is an arbitrary value that will be used to create
// a tree where the optimizer will set the highWordZero
// flag on an i2l node. Since treeSimplification is
// disabled for these google tests, such a tree is required
// for basic block extension to set the highWordZero flag.
const int32_t constValue = 0x4321;
char inputTrees[512] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method return=Int64 args=[Int32] "
" (block "
" (lreturn "
" (land "
" (i2l "
" (iand "
" (iload parm=0) "
" (iconst %d) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 "))))) ",
constValue,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(int32_t)>();
ASSERT_EQ(param.oracle((param.variableValue & constValue), param.constantValue), entry_point(param.variableValue));
}
TEST_P(i2lLongAndAsRotateTest, GreaterThanOneRefCount1)
{
auto param = to_struct(GetParam());
// this is an arbitrary value that will be used to create
// a tree where an i2l node has reference count greater than 1.
// The actual value doesn't really matter for constLongValue (as long
// as it's not simple enough to get optimized away).
const uint64_t constLongValue = 0xFFFFFFFFFFFF0000;
char inputTrees[2048] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method name=\"AddAndLand\" return=Int64 args=[Int32]"
" (block "
" (lstore temp=\"x\" "
" (land "
" (i2l id=\"myNode\" "
" (iload parm=0) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" (lreturn "
" (land "
" (@id \"myNode\") "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" ) "
") ",
constLongValue,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(int32_t)>();
ASSERT_EQ(param.oracle(param.variableValue, param.constantValue), entry_point(param.variableValue));
}
TEST_P(i2lLongAndAsRotateTest, GreaterThanOneRefCount2)
{
auto param = to_struct(GetParam());
// these are arbitrary values that will be used to create
// a tree where an i2l node has reference count greater than 1.
// The actual value doesn't really matter for constLongValue and constValue1
// (as long as it's not simple enough to get optimized away).
const uint64_t constLongValue = 0xFFFFFFFFFFFF0000;
const int32_t constValue1 = 0x4321;
const int32_t constValue2 = 0x1234;
char inputTrees[2048] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method name=\"AddAndLand\" return=Int64 args=[Int32]"
" (block "
" (lstore temp=\"x\" "
" (land "
" (i2l "
" (iand "
" (iload parm=0 id=\"myNode\") "
" (iconst %d) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" (lreturn "
" (land "
" (i2l "
" (iand "
" (@id \"myNode\") "
" (iconst %d) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" ) "
") ",
constValue1,
constLongValue,
constValue2,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(int32_t)>();
ASSERT_EQ(param.oracle((param.variableValue & constValue2), param.constantValue), entry_point(param.variableValue));
}
//iu2l test class
class iu2lLongAndAsRotateTest : public LongAndAsRotateTest<uint32_t, uint64_t> {};
TEST_P(iu2lLongAndAsRotateTest, SimpleTest)
{
SKIP_ON_RISCV(KnownBug);
auto param = to_struct(GetParam());
char inputTrees[512] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method return=Int64 args=[Int32] "
" (block "
" (lreturn "
" (land "
" (iu2l (iload parm=0)) "
" (lconst %" OMR_PRIu64 "))))) ",
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(uint32_t)>();
ASSERT_EQ(param.oracle(param.variableValue, param.constantValue), entry_point(param.variableValue));
}
TEST_P(iu2lLongAndAsRotateTest, iConstTest)
{
SKIP_ON_RISCV(KnownBug);
auto param = to_struct(GetParam());
// this is an arbitrary value that will be used to create
// a tree where the optimizer will set the highWordZero
// flag on an i2l node. Since treeSimplification is
// disabled for these google tests, such a tree is required
// for basic block extension to set the highWordZero flag.
const uint32_t constValue = 0x4321;
char inputTrees[512] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method return=Int64 args=[Int32] "
" (block "
" (lreturn "
" (land "
" (iu2l "
" (iand "
" (iload parm=0) "
" (iconst %u) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 "))))) ",
constValue,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(uint32_t)>();
ASSERT_EQ(param.oracle((param.variableValue & constValue), param.constantValue), entry_point(param.variableValue));
}
TEST_P(iu2lLongAndAsRotateTest, GreaterThanOneRefCount1)
{
SKIP_ON_RISCV(KnownBug);
auto param = to_struct(GetParam());
// this is an arbitrary value that will be used to create
// a tree where an i2l node has reference count greater than 1.
// The actual value doesn't really matter for constLongValue (as long
// as it's not simple enough to get optimized away).
const uint64_t constLongValue = 0xFFFFFFFFFFFF0000;
char inputTrees[2048] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method name=\"AddAndLand\" return=Int64 args=[Int32]"
" (block "
" (lstore temp=\"x\" "
" (land "
" (iu2l id=\"myNode\" "
" (iload parm=0) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" (lreturn "
" (land "
" (@id \"myNode\") "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" ) "
") ",
constLongValue,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(uint32_t)>();
ASSERT_EQ(param.oracle(param.variableValue, param.constantValue), entry_point(param.variableValue));
}
TEST_P(iu2lLongAndAsRotateTest, GreaterThanOneRefCount2)
{
SKIP_ON_RISCV(KnownBug);
auto param = to_struct(GetParam());
// these are arbitrary values that will be used to create
// a tree where an i2l node has reference count greater than 1.
// The actual value doesn't really matter for constLongValue and constValue1
// (as long as it's not simple enough to get optimized away).
const uint64_t constLongValue = 0xFFFFFFFFFFFF0000;
const uint32_t constValue1 = 0x4321;
const uint32_t constValue2 = 0x1234;
char inputTrees[2048] = {0};
std::snprintf(inputTrees, sizeof(inputTrees),
"(method name=\"AddAndLand\" return=Int64 args=[Int32]"
" (block "
" (lstore temp=\"x\" "
" (land "
" (iu2l "
" (iand "
" (iload parm=0 id=\"myNode\") "
" (iconst %u) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" (lreturn "
" (land "
" (iu2l "
" (iand "
" (@id \"myNode\") "
" (iconst %u) "
" ) "
" ) "
" (lconst %" OMR_PRIu64 ") "
" ) "
" ) "
" ) "
") ",
constValue1,
constLongValue,
constValue2,
param.constantValue
);
auto trees = parseString(inputTrees);
ASSERT_NOTNULL(trees);
Tril::DefaultCompiler compiler(trees);
ASSERT_EQ(0, compiler.compile()) << "Compilation failed unexpectedly\nInput trees: " << inputTrees;
auto entry_point = compiler.getEntryPoint<uint64_t (*)(uint32_t)>();
ASSERT_EQ(param.oracle((param.variableValue & constValue2), param.constantValue), entry_point(param.variableValue));
}
// for cases where contiguous ones only appear once in the binary value
// ex: 00011110000, 0111110, 1111111
// i2l case
INSTANTIATE_TEST_CASE_P(i2lZerosAroundOnes, i2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(i2lInput),
::testing::ValuesIn(lconstInput_zerosAroundOnes),
::testing::Values(static_cast<uint64_t (*) (int32_t, uint64_t)> (longAndAsRotateOracle))));
//iu2l case
INSTANTIATE_TEST_CASE_P(iu2lZerosAroundOnes, iu2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(iu2lInput),
::testing::ValuesIn(lconstInput_zerosAroundOnes),
::testing::Values(static_cast<uint64_t (*) (uint32_t, uint64_t)> (longAndAsRotateOracle))));
// for cases where contiguous zeros only appear once in the binary value
// ex: 11100001111, 1000001, 0000000
// i2l case
INSTANTIATE_TEST_CASE_P(i2lOnesAroundZeros, i2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(i2lInput),
::testing::ValuesIn(lconstInput_onesAroundZeros),
::testing::Values(static_cast<uint64_t (*) (int32_t, uint64_t)> (longAndAsRotateOracle))));
// iu2l case
INSTANTIATE_TEST_CASE_P(iu2lOnesAroundZeros, iu2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(iu2lInput),
::testing::ValuesIn(lconstInput_onesAroundZeros),
::testing::Values(static_cast<uint64_t (*) (uint32_t, uint64_t)> (longAndAsRotateOracle))));
// none of the tests in this group should generate a RISBG instruction
// i2l case
INSTANTIATE_TEST_CASE_P(i2lInvalidPatterns, i2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(i2lInput),
::testing::ValuesIn(lconstInput_invalidPatterns),
::testing::Values(static_cast<uint64_t (*) (int32_t, uint64_t)> (longAndAsRotateOracle))));
// iu2l case
INSTANTIATE_TEST_CASE_P(iu2lInvalidPatterns, iu2lLongAndAsRotateTest,
::testing::Combine(
::testing::ValuesIn(iu2lInput),
::testing::ValuesIn(lconstInput_invalidPatterns),
::testing::Values(static_cast<uint64_t (*) (uint32_t, uint64_t)> (longAndAsRotateOracle))));