Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "src/compiler/js-graph.h" | |
| 6 #include "src/compiler/simplified-operator.h" | |
| 7 #include "src/compiler/simplified-operator-reducer.h" | |
| 8 #include "src/compiler/typer.h" | |
| 9 #include "src/conversions.h" | |
| 10 #include "test/compiler-unittests/graph-unittest.h" | |
| 11 | |
| 12 namespace v8 { | |
| 13 namespace internal { | |
| 14 namespace compiler { | |
| 15 | |
| 16 class SimplifiedOperatorReducerTest : public GraphTest { | |
| 17 public: | |
| 18 explicit SimplifiedOperatorReducerTest(int num_parameters = 1) | |
| 19 : GraphTest(num_parameters), simplified_(zone()) {} | |
| 20 virtual ~SimplifiedOperatorReducerTest() {} | |
| 21 | |
| 22 protected: | |
| 23 Reduction Reduce(Node* node) { | |
| 24 Typer typer(zone()); | |
| 25 MachineOperatorBuilder machine(zone()); | |
| 26 JSGraph jsgraph(graph(), common(), &typer); | |
| 27 SimplifiedOperatorReducer reducer(&jsgraph, &machine); | |
| 28 return reducer.Reduce(node); | |
| 29 } | |
| 30 | |
| 31 SimplifiedOperatorBuilder* simplified() { return &simplified_; } | |
| 32 | |
| 33 private: | |
| 34 SimplifiedOperatorBuilder simplified_; | |
| 35 }; | |
| 36 | |
| 37 | |
| 38 namespace { | |
| 39 | |
| 40 static const double kFloat64Values[] = { | |
| 41 -V8_INFINITY, -6.52696e+290, -1.05768e+290, -5.34203e+268, -1.01997e+268, | |
| 42 -8.22758e+266, -1.58402e+261, -5.15246e+241, -5.92107e+226, -1.21477e+226, | |
| 43 -1.67913e+188, -1.6257e+184, -2.60043e+170, -2.52941e+168, -3.06033e+116, | |
| 44 -4.56201e+52, -3.56788e+50, -9.9066e+38, -3.07261e+31, -2.1271e+09, | |
| 45 -1.91489e+09, -1.73053e+09, -9.30675e+08, -26030, -20453, | |
| 46 -15790, -11699, -111, -97, -78, | |
| 47 -63, -58, -1.53858e-06, -2.98914e-12, -1.14741e-39, | |
| 48 -8.20347e-57, -1.48932e-59, -3.17692e-66, -8.93103e-81, -3.91337e-83, | |
| 49 -6.0489e-92, -8.83291e-113, -4.28266e-117, -1.92058e-178, -2.0567e-192, | |
| 50 -1.68167e-194, -1.51841e-214, -3.98738e-234, -7.31851e-242, -2.21875e-253, | |
| 51 -1.11612e-293, -0.0, 0.0, 2.22507e-308, 1.06526e-307, | |
| 52 4.16643e-227, 6.76624e-223, 2.0432e-197, 3.16254e-184, 1.37315e-173, | |
| 53 2.88603e-172, 1.54155e-99, 4.42923e-81, 1.40539e-73, 5.4462e-73, | |
| 54 1.24064e-58, 3.11167e-58, 2.75826e-39, 0.143815, 58, | |
| 55 67, 601, 7941, 11644, 13697, | |
| 56 25680, 29882, 1.32165e+08, 1.62439e+08, 4.16837e+08, | |
| 57 9.59097e+08, 1.32491e+09, 1.8728e+09, 1.0672e+17, 2.69606e+46, | |
| 58 1.98285e+79, 1.0098e+82, 7.93064e+88, 3.67444e+121, 9.36506e+123, | |
| 59 7.27954e+162, 3.05316e+168, 1.16171e+175, 1.64771e+189, 1.1622e+202, | |
| 60 2.00748e+239, 2.51778e+244, 3.90282e+306, 1.79769e+308, V8_INFINITY}; | |
| 61 | |
| 62 | |
| 63 static const int32_t kInt32Values[] = { | |
| 64 -2147483647 - 1, -2104508227, -2103151830, -1435284490, -1378926425, | |
| 65 -1318814539, -1289388009, -1287537572, -1279026536, -1241605942, | |
| 66 -1226046939, -941837148, -779818051, -413830641, -245798087, | |
| 67 -184657557, -127145950, -105483328, -32325, -26653, | |
| 68 -23858, -23834, -22363, -19858, -19044, | |
| 69 -18744, -15528, -5309, -3372, -2093, | |
| 70 -104, -98, -97, -93, -84, | |
| 71 -80, -78, -76, -72, -58, | |
| 72 -57, -56, -55, -45, -40, | |
| 73 -34, -32, -25, -24, -5, | |
| 74 -2, 0, 3, 10, 24, | |
| 75 34, 42, 46, 47, 48, | |
| 76 52, 56, 64, 65, 71, | |
| 77 76, 79, 81, 82, 97, | |
| 78 102, 103, 104, 106, 107, | |
| 79 109, 116, 122, 3653, 4485, | |
| 80 12405, 16504, 26262, 28704, 29755, | |
| 81 30554, 16476817, 605431957, 832401070, 873617242, | |
| 82 914205764, 1062628108, 1087581664, 1488498068, 1534668023, | |
| 83 1661587028, 1696896187, 1866841746, 2032089723, 2147483647}; | |
| 84 | |
| 85 | |
| 86 static const uint32_t kUint32Values[] = { | |
| 87 0x0, 0x5, 0x8, 0xc, 0xd, 0x26, | |
| 88 0x28, 0x29, 0x30, 0x34, 0x3e, 0x42, | |
| 89 0x50, 0x5b, 0x63, 0x71, 0x77, 0x7c, | |
| 90 0x83, 0x88, 0x96, 0x9c, 0xa3, 0xfa, | |
| 91 0x7a7, 0x165d, 0x234d, 0x3acb, 0x43a5, 0x4573, | |
| 92 0x5b4f, 0x5f14, 0x6996, 0x6c6e, 0x7289, 0x7b9a, | |
| 93 0x7bc9, 0x86bb, 0xa839, 0xaa41, 0xb03b, 0xc942, | |
| 94 0xce68, 0xcf4c, 0xd3ad, 0xdea3, 0xe90c, 0xed86, | |
| 95 0xfba5, 0x172dcc6, 0x114d8fc1, 0x182d6c9d, 0x1b1e3fad, 0x1db033bf, | |
| 96 0x1e1de755, 0x1f625c80, 0x28f6cf00, 0x2acb6a94, 0x2c20240e, 0x2f0fe54e, | |
| 97 0x31863a7c, 0x33325474, 0x3532fae3, 0x3bab82ea, 0x4c4b83a2, 0x4cd93d1e, | |
| 98 0x4f7331d4, 0x5491b09b, 0x57cc6ff9, 0x60d3b4dc, 0x653f5904, 0x690ae256, | |
| 99 0x69fe3276, 0x6bebf0ba, 0x6e2c69a3, 0x73b84ff7, 0x7b3a1924, 0x7ed032d9, | |
| 100 0x84dd734b, 0x8552ea53, 0x8680754f, 0x8e9660eb, 0x94fe2b9c, 0x972d30cf, | |
| 101 0x9b98c482, 0xb158667e, 0xb432932c, 0xb5b70989, 0xb669971a, 0xb7c359d1, | |
| 102 0xbeb15c0d, 0xc171c53d, 0xc743dd38, 0xc8e2af50, 0xc98e2df0, 0xd9d1cdf9, | |
| 103 0xdcc91049, 0xe46f396d, 0xee991950, 0xef64e521, 0xf7aeefc9, 0xffffffff}; | |
| 104 | |
| 105 | |
| 106 MATCHER(IsNaN, std::string(negation ? "isn't" : "is") + " NaN") { | |
| 107 return std::isnan(arg); | |
| 108 } | |
| 109 | |
| 110 } // namespace | |
| 111 | |
| 112 | |
| 113 // ----------------------------------------------------------------------------- | |
| 114 // BooleanNot | |
| 115 | |
| 116 | |
| 117 TEST_F(SimplifiedOperatorReducerTest, BooleanNotWithBooleanNot) { | |
| 118 Node* param0 = Parameter(0); | |
| 119 Reduction reduction = Reduce( | |
| 120 graph()->NewNode(simplified()->BooleanNot(), | |
| 121 graph()->NewNode(simplified()->BooleanNot(), param0))); | |
| 122 ASSERT_TRUE(reduction.Changed()); | |
| 123 EXPECT_EQ(param0, reduction.replacement()); | |
| 124 } | |
| 125 | |
| 126 | |
| 127 TEST_F(SimplifiedOperatorReducerTest, BooleanNotWithConstant) { | |
| 128 // BooleanNot(false) => true | |
| 129 Reduction reduction0 = | |
| 130 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); | |
| 131 ASSERT_TRUE(reduction0.Changed()); | |
| 132 EXPECT_THAT(reduction0.replacement(), IsTrueConstant()); | |
| 133 | |
| 134 // BooleanNot(true) => false | |
|
Jarin
2014/08/21 20:11:24
Is there a reason why these are not two separate t
Benedikt Meurer
2014/08/22 04:44:32
Done. Refactored those tests.
| |
| 135 Reduction reduction1 = | |
| 136 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); | |
| 137 ASSERT_TRUE(reduction1.Changed()); | |
| 138 EXPECT_THAT(reduction1.replacement(), IsFalseConstant()); | |
| 139 } | |
| 140 | |
| 141 | |
| 142 TEST_F(SimplifiedOperatorReducerTest, BooleanNotWithParameter) { | |
| 143 EXPECT_FALSE(Reduce(graph()->NewNode(simplified()->BooleanNot(), | |
| 144 Parameter(0))).Changed()); | |
| 145 } | |
| 146 | |
| 147 | |
| 148 // ----------------------------------------------------------------------------- | |
| 149 // ChangeBoolToBit | |
| 150 | |
| 151 | |
| 152 TEST_F(SimplifiedOperatorReducerTest, ChangeBitToBoolWithChangeBoolToBit) { | |
| 153 Node* param0 = Parameter(0); | |
| 154 Reduction reduction = Reduce(graph()->NewNode( | |
| 155 simplified()->ChangeBitToBool(), | |
| 156 graph()->NewNode(simplified()->ChangeBoolToBit(), param0))); | |
| 157 ASSERT_TRUE(reduction.Changed()); | |
| 158 EXPECT_EQ(param0, reduction.replacement()); | |
| 159 } | |
| 160 | |
| 161 | |
| 162 TEST_F(SimplifiedOperatorReducerTest, ChangeBitToBoolWithConstant) { | |
| 163 // ChangeBitToBool(0) => false | |
| 164 Reduction reduction0 = Reduce( | |
| 165 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(0))); | |
| 166 ASSERT_TRUE(reduction0.Changed()); | |
| 167 EXPECT_THAT(reduction0.replacement(), IsFalseConstant()); | |
| 168 | |
| 169 // ChangeBitToBool(1) => true | |
| 170 Reduction reduction1 = Reduce( | |
| 171 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(1))); | |
| 172 ASSERT_TRUE(reduction1.Changed()); | |
| 173 EXPECT_THAT(reduction1.replacement(), IsTrueConstant()); | |
| 174 } | |
| 175 | |
| 176 | |
| 177 TEST_F(SimplifiedOperatorReducerTest, ChangeBitToBoolWithParameter) { | |
| 178 Reduction reduction = | |
| 179 Reduce(graph()->NewNode(simplified()->ChangeBitToBool(), Parameter(0))); | |
| 180 EXPECT_FALSE(reduction.Changed()); | |
| 181 } | |
| 182 | |
| 183 | |
| 184 // ----------------------------------------------------------------------------- | |
| 185 // ChangeBoolToBit | |
| 186 | |
| 187 | |
| 188 TEST_F(SimplifiedOperatorReducerTest, ChangeBoolToBitWithConstant) { | |
| 189 // ChangeBoolToBit(false) => 0 | |
| 190 Reduction reduction0 = Reduce( | |
| 191 graph()->NewNode(simplified()->ChangeBoolToBit(), FalseConstant())); | |
| 192 ASSERT_TRUE(reduction0.Changed()); | |
| 193 EXPECT_THAT(reduction0.replacement(), IsInt32Constant(0)); | |
| 194 | |
| 195 // ChangeBoolToBit(true) => 1 | |
| 196 Reduction reduction1 = | |
| 197 Reduce(graph()->NewNode(simplified()->ChangeBoolToBit(), TrueConstant())); | |
| 198 ASSERT_TRUE(reduction1.Changed()); | |
| 199 EXPECT_THAT(reduction1.replacement(), IsInt32Constant(1)); | |
| 200 } | |
| 201 | |
| 202 | |
| 203 TEST_F(SimplifiedOperatorReducerTest, ChangeBoolToBitWithParameter) { | |
| 204 Reduction reduction = | |
| 205 Reduce(graph()->NewNode(simplified()->ChangeBoolToBit(), Parameter(0))); | |
| 206 EXPECT_FALSE(reduction.Changed()); | |
| 207 } | |
| 208 | |
| 209 | |
| 210 TEST_F(SimplifiedOperatorReducerTest, ChangeBoolToBitWithChangeBitToBool) { | |
| 211 Node* param0 = Parameter(0); | |
| 212 Reduction reduction = Reduce(graph()->NewNode( | |
| 213 simplified()->ChangeBoolToBit(), | |
| 214 graph()->NewNode(simplified()->ChangeBitToBool(), param0))); | |
| 215 ASSERT_TRUE(reduction.Changed()); | |
| 216 EXPECT_EQ(param0, reduction.replacement()); | |
| 217 } | |
| 218 | |
| 219 | |
| 220 // ----------------------------------------------------------------------------- | |
| 221 // ChangeFloat64ToTagged | |
| 222 | |
| 223 | |
| 224 TEST_F(SimplifiedOperatorReducerTest, ChangeFloat64ToTaggedWithConstant) { | |
| 225 TRACED_FOREACH(double, n, kFloat64Values) { | |
| 226 Reduction reduction = Reduce(graph()->NewNode( | |
| 227 simplified()->ChangeFloat64ToTagged(), Float64Constant(n))); | |
| 228 ASSERT_TRUE(reduction.Changed()); | |
| 229 EXPECT_THAT(reduction.replacement(), IsNumberConstant(n)); | |
| 230 } | |
| 231 } | |
| 232 | |
| 233 | |
| 234 TEST_F(SimplifiedOperatorReducerTest, ChangeFloat64ToTaggedWithParameter) { | |
| 235 EXPECT_FALSE(Reduce(graph()->NewNode(simplified()->ChangeFloat64ToTagged(), | |
| 236 Parameter(0))).Changed()); | |
| 237 } | |
| 238 | |
| 239 | |
| 240 // ----------------------------------------------------------------------------- | |
| 241 // ChangeInt32ToTagged | |
| 242 | |
| 243 | |
| 244 TEST_F(SimplifiedOperatorReducerTest, ChangeInt32ToTaggedWithConstant) { | |
| 245 TRACED_FOREACH(int32_t, n, kInt32Values) { | |
| 246 Reduction reduction = Reduce(graph()->NewNode( | |
| 247 simplified()->ChangeInt32ToTagged(), Int32Constant(n))); | |
| 248 ASSERT_TRUE(reduction.Changed()); | |
| 249 EXPECT_THAT(reduction.replacement(), IsNumberConstant(FastI2D(n))); | |
| 250 } | |
| 251 } | |
| 252 | |
| 253 | |
| 254 TEST_F(SimplifiedOperatorReducerTest, ChangeInt32ToTaggedWithParameter) { | |
| 255 Reduction reduction = Reduce( | |
| 256 graph()->NewNode(simplified()->ChangeInt32ToTagged(), Parameter(0))); | |
| 257 EXPECT_FALSE(reduction.Changed()); | |
| 258 } | |
| 259 | |
| 260 | |
| 261 // ----------------------------------------------------------------------------- | |
| 262 // ChangeTaggedToFloat64 | |
| 263 | |
| 264 | |
| 265 TEST_F(SimplifiedOperatorReducerTest, | |
| 266 ChangeTaggedToFloat64WithChangeFloat64ToTagged) { | |
| 267 Node* param0 = Parameter(0); | |
| 268 Reduction reduction = Reduce(graph()->NewNode( | |
| 269 simplified()->ChangeTaggedToFloat64(), | |
| 270 graph()->NewNode(simplified()->ChangeFloat64ToTagged(), param0))); | |
| 271 ASSERT_TRUE(reduction.Changed()); | |
| 272 EXPECT_EQ(param0, reduction.replacement()); | |
| 273 } | |
| 274 | |
| 275 | |
| 276 TEST_F(SimplifiedOperatorReducerTest, | |
| 277 ChangeTaggedToFloat64WithChangeInt32ToTagged) { | |
| 278 Node* param0 = Parameter(0); | |
| 279 Reduction reduction = Reduce(graph()->NewNode( | |
| 280 simplified()->ChangeTaggedToFloat64(), | |
| 281 graph()->NewNode(simplified()->ChangeInt32ToTagged(), param0))); | |
| 282 ASSERT_TRUE(reduction.Changed()); | |
| 283 EXPECT_THAT(reduction.replacement(), IsChangeInt32ToFloat64(param0)); | |
| 284 } | |
| 285 | |
| 286 | |
| 287 TEST_F(SimplifiedOperatorReducerTest, | |
| 288 ChangeTaggedToFloat64WithChangeUint32ToTagged) { | |
| 289 Node* param0 = Parameter(0); | |
| 290 Reduction reduction = Reduce(graph()->NewNode( | |
| 291 simplified()->ChangeTaggedToFloat64(), | |
| 292 graph()->NewNode(simplified()->ChangeUint32ToTagged(), param0))); | |
| 293 ASSERT_TRUE(reduction.Changed()); | |
| 294 EXPECT_THAT(reduction.replacement(), IsChangeUint32ToFloat64(param0)); | |
| 295 } | |
| 296 | |
| 297 | |
| 298 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToFloat64WithConstant) { | |
| 299 TRACED_FOREACH(double, n, kFloat64Values) { | |
| 300 Reduction reduction = Reduce(graph()->NewNode( | |
| 301 simplified()->ChangeTaggedToFloat64(), NumberConstant(n))); | |
| 302 ASSERT_TRUE(reduction.Changed()); | |
| 303 EXPECT_THAT(reduction.replacement(), IsFloat64Constant(n)); | |
| 304 } | |
| 305 | |
| 306 // ChangeTaggedToFloat64(-NaN) => NaN | |
| 307 Reduction reduction0 = | |
| 308 Reduce(graph()->NewNode(simplified()->ChangeTaggedToFloat64(), | |
| 309 NumberConstant(-base::OS::nan_value()))); | |
| 310 ASSERT_TRUE(reduction0.Changed()); | |
| 311 EXPECT_THAT(reduction0.replacement(), IsFloat64Constant(IsNaN())); | |
| 312 | |
| 313 // ChangeTaggedToFloat64(+NaN) => NaN | |
| 314 Reduction reduction1 = | |
| 315 Reduce(graph()->NewNode(simplified()->ChangeTaggedToFloat64(), | |
| 316 NumberConstant(base::OS::nan_value()))); | |
| 317 ASSERT_TRUE(reduction1.Changed()); | |
| 318 EXPECT_THAT(reduction1.replacement(), IsFloat64Constant(IsNaN())); | |
| 319 } | |
| 320 | |
| 321 | |
| 322 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToFloat64WithParameter) { | |
| 323 EXPECT_FALSE(Reduce(graph()->NewNode(simplified()->ChangeTaggedToFloat64(), | |
| 324 Parameter(0))).Changed()); | |
| 325 } | |
| 326 | |
| 327 | |
| 328 // ----------------------------------------------------------------------------- | |
| 329 // ChangeTaggedToInt32 | |
| 330 | |
| 331 | |
| 332 TEST_F(SimplifiedOperatorReducerTest, | |
| 333 ChangeTaggedToInt32WithChangeFloat64ToTagged) { | |
| 334 Node* param0 = Parameter(0); | |
| 335 Reduction reduction = Reduce(graph()->NewNode( | |
| 336 simplified()->ChangeTaggedToInt32(), | |
| 337 graph()->NewNode(simplified()->ChangeFloat64ToTagged(), param0))); | |
| 338 ASSERT_TRUE(reduction.Changed()); | |
| 339 EXPECT_THAT(reduction.replacement(), IsTruncateFloat64ToInt32(param0)); | |
| 340 } | |
| 341 | |
| 342 | |
| 343 TEST_F(SimplifiedOperatorReducerTest, | |
| 344 ChangeTaggedToInt32WithChangeInt32ToTagged) { | |
| 345 Node* param0 = Parameter(0); | |
| 346 Reduction reduction = Reduce(graph()->NewNode( | |
| 347 simplified()->ChangeTaggedToInt32(), | |
| 348 graph()->NewNode(simplified()->ChangeInt32ToTagged(), param0))); | |
| 349 ASSERT_TRUE(reduction.Changed()); | |
| 350 EXPECT_EQ(param0, reduction.replacement()); | |
| 351 } | |
| 352 | |
| 353 | |
| 354 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToInt32WithConstant) { | |
| 355 TRACED_FOREACH(double, n, kFloat64Values) { | |
| 356 Reduction reduction = Reduce(graph()->NewNode( | |
| 357 simplified()->ChangeTaggedToInt32(), NumberConstant(n))); | |
| 358 ASSERT_TRUE(reduction.Changed()); | |
| 359 EXPECT_THAT(reduction.replacement(), IsInt32Constant(DoubleToInt32(n))); | |
| 360 } | |
| 361 | |
| 362 // ChangeTaggedToInt32(-NaN) => 0 | |
| 363 Reduction reduction0 = | |
| 364 Reduce(graph()->NewNode(simplified()->ChangeTaggedToInt32(), | |
| 365 NumberConstant(-base::OS::nan_value()))); | |
| 366 ASSERT_TRUE(reduction0.Changed()); | |
| 367 EXPECT_THAT(reduction0.replacement(), IsInt32Constant(0)); | |
| 368 | |
| 369 // ChangeTaggedToInt32(+NaN) => 0 | |
| 370 Reduction reduction1 = | |
| 371 Reduce(graph()->NewNode(simplified()->ChangeTaggedToInt32(), | |
| 372 NumberConstant(base::OS::nan_value()))); | |
| 373 ASSERT_TRUE(reduction1.Changed()); | |
| 374 EXPECT_THAT(reduction1.replacement(), IsInt32Constant(0)); | |
| 375 } | |
| 376 | |
| 377 | |
| 378 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToInt32WithParameter) { | |
| 379 Reduction reduction = Reduce( | |
| 380 graph()->NewNode(simplified()->ChangeTaggedToInt32(), Parameter(0))); | |
| 381 EXPECT_FALSE(reduction.Changed()); | |
| 382 } | |
| 383 | |
| 384 | |
| 385 // ----------------------------------------------------------------------------- | |
| 386 // ChangeTaggedToUint32 | |
| 387 | |
| 388 | |
| 389 TEST_F(SimplifiedOperatorReducerTest, | |
| 390 ChangeTaggedToUint32WithChangeFloat64ToTagged) { | |
| 391 Node* param0 = Parameter(0); | |
| 392 Reduction reduction = Reduce(graph()->NewNode( | |
| 393 simplified()->ChangeTaggedToUint32(), | |
| 394 graph()->NewNode(simplified()->ChangeFloat64ToTagged(), param0))); | |
| 395 ASSERT_TRUE(reduction.Changed()); | |
| 396 EXPECT_THAT(reduction.replacement(), IsTruncateFloat64ToInt32(param0)); | |
| 397 } | |
| 398 | |
| 399 | |
| 400 TEST_F(SimplifiedOperatorReducerTest, | |
| 401 ChangeTaggedToUint32WithChangeUint32ToTagged) { | |
| 402 Node* param0 = Parameter(0); | |
| 403 Reduction reduction = Reduce(graph()->NewNode( | |
| 404 simplified()->ChangeTaggedToUint32(), | |
| 405 graph()->NewNode(simplified()->ChangeUint32ToTagged(), param0))); | |
| 406 ASSERT_TRUE(reduction.Changed()); | |
| 407 EXPECT_EQ(param0, reduction.replacement()); | |
| 408 } | |
| 409 | |
| 410 | |
| 411 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToUint32WithConstant) { | |
| 412 TRACED_FOREACH(double, n, kFloat64Values) { | |
| 413 Reduction reduction = Reduce(graph()->NewNode( | |
| 414 simplified()->ChangeTaggedToUint32(), NumberConstant(n))); | |
| 415 ASSERT_TRUE(reduction.Changed()); | |
| 416 EXPECT_THAT(reduction.replacement(), | |
| 417 IsInt32Constant(BitCast<int32_t>(DoubleToUint32(n)))); | |
| 418 } | |
| 419 | |
| 420 // ChangeTaggedToUint32(-NaN) => 0 | |
| 421 Reduction reduction0 = | |
| 422 Reduce(graph()->NewNode(simplified()->ChangeTaggedToUint32(), | |
| 423 NumberConstant(-base::OS::nan_value()))); | |
| 424 ASSERT_TRUE(reduction0.Changed()); | |
| 425 EXPECT_THAT(reduction0.replacement(), IsInt32Constant(0)); | |
| 426 | |
| 427 // ChangeTaggedToUint32(+NaN) => 0 | |
| 428 Reduction reduction1 = | |
| 429 Reduce(graph()->NewNode(simplified()->ChangeTaggedToUint32(), | |
| 430 NumberConstant(base::OS::nan_value()))); | |
| 431 ASSERT_TRUE(reduction1.Changed()); | |
| 432 EXPECT_THAT(reduction1.replacement(), IsInt32Constant(0)); | |
| 433 } | |
| 434 | |
| 435 | |
| 436 TEST_F(SimplifiedOperatorReducerTest, ChangeTaggedToUint32WithParameter) { | |
| 437 Reduction reduction = Reduce( | |
| 438 graph()->NewNode(simplified()->ChangeTaggedToUint32(), Parameter(0))); | |
| 439 EXPECT_FALSE(reduction.Changed()); | |
| 440 } | |
| 441 | |
| 442 | |
| 443 // ----------------------------------------------------------------------------- | |
| 444 // ChangeUint32ToTagged | |
| 445 | |
| 446 | |
| 447 TEST_F(SimplifiedOperatorReducerTest, ChangeUint32ToTagged) { | |
| 448 TRACED_FOREACH(uint32_t, n, kUint32Values) { | |
| 449 Reduction reduction = | |
| 450 Reduce(graph()->NewNode(simplified()->ChangeUint32ToTagged(), | |
| 451 Int32Constant(BitCast<int32_t>(n)))); | |
| 452 ASSERT_TRUE(reduction.Changed()); | |
| 453 EXPECT_THAT(reduction.replacement(), IsNumberConstant(FastUI2D(n))); | |
| 454 } | |
| 455 } | |
| 456 | |
| 457 | |
| 458 TEST_F(SimplifiedOperatorReducerTest, ChangeUint32ToTaggedWithParameter) { | |
| 459 Reduction reduction = Reduce( | |
| 460 graph()->NewNode(simplified()->ChangeUint32ToTagged(), Parameter(0))); | |
| 461 EXPECT_FALSE(reduction.Changed()); | |
| 462 } | |
| 463 | |
| 464 } // namespace compiler | |
| 465 } // namespace internal | |
| 466 } // namespace v8 | |
| OLD | NEW |