Emily Bernier | 958fae7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 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/common-operator.h" |
| 6 | #include "src/compiler/graph.h" |
| 7 | #include "src/compiler/machine-operator.h" |
| 8 | #include "src/compiler/node.h" |
| 9 | #include "src/compiler/node-matchers.h" |
| 10 | #include "src/compiler/opcodes.h" |
| 11 | |
| 12 | #include "test/unittests/compiler/graph-unittest.h" |
| 13 | #include "test/unittests/test-utils.h" |
| 14 | |
| 15 | namespace v8 { |
| 16 | namespace internal { |
| 17 | namespace compiler { |
| 18 | |
| 19 | class NodeMatcherTest : public GraphTest { |
| 20 | public: |
| 21 | NodeMatcherTest() : machine_(zone()) {} |
| 22 | ~NodeMatcherTest() OVERRIDE {} |
| 23 | |
| 24 | MachineOperatorBuilder* machine() { return &machine_; } |
| 25 | |
| 26 | private: |
| 27 | MachineOperatorBuilder machine_; |
| 28 | }; |
| 29 | |
| 30 | namespace { |
| 31 | |
| 32 | template <class Matcher> |
| 33 | void CheckBaseWithIndexAndDisplacement(Matcher* matcher, Node* index, int scale, |
| 34 | Node* base, Node* displacement) { |
| 35 | EXPECT_TRUE(matcher->matches()); |
| 36 | EXPECT_EQ(index, matcher->index()); |
| 37 | EXPECT_EQ(scale, matcher->scale()); |
| 38 | EXPECT_EQ(base, matcher->base()); |
| 39 | EXPECT_EQ(displacement, matcher->displacement()); |
| 40 | } |
| 41 | }; |
| 42 | |
| 43 | |
| 44 | TEST_F(NodeMatcherTest, ScaledWithOffset32Matcher) { |
| 45 | graph()->SetStart(graph()->NewNode(common()->Start(0))); |
| 46 | |
| 47 | const Operator* d0_op = common()->Int32Constant(0); |
| 48 | Node* d0 = graph()->NewNode(d0_op); |
| 49 | USE(d0); |
| 50 | const Operator* d1_op = common()->Int32Constant(1); |
| 51 | Node* d1 = graph()->NewNode(d1_op); |
| 52 | USE(d1); |
| 53 | const Operator* d2_op = common()->Int32Constant(2); |
| 54 | Node* d2 = graph()->NewNode(d2_op); |
| 55 | USE(d2); |
| 56 | const Operator* d3_op = common()->Int32Constant(3); |
| 57 | Node* d3 = graph()->NewNode(d3_op); |
| 58 | USE(d3); |
| 59 | const Operator* d4_op = common()->Int32Constant(4); |
| 60 | Node* d4 = graph()->NewNode(d4_op); |
| 61 | USE(d4); |
| 62 | const Operator* d5_op = common()->Int32Constant(5); |
| 63 | Node* d5 = graph()->NewNode(d5_op); |
| 64 | USE(d5); |
| 65 | const Operator* d7_op = common()->Int32Constant(7); |
| 66 | Node* d7 = graph()->NewNode(d7_op); |
| 67 | USE(d4); |
| 68 | const Operator* d8_op = common()->Int32Constant(8); |
| 69 | Node* d8 = graph()->NewNode(d8_op); |
| 70 | USE(d8); |
| 71 | const Operator* d9_op = common()->Int32Constant(9); |
| 72 | Node* d9 = graph()->NewNode(d9_op); |
| 73 | USE(d9); |
| 74 | const Operator* d15_op = common()->Int32Constant(15); |
| 75 | Node* d15 = graph()->NewNode(d15_op); |
| 76 | USE(d15); |
| 77 | |
| 78 | const Operator* b0_op = common()->Parameter(0); |
| 79 | Node* b0 = graph()->NewNode(b0_op, graph()->start()); |
| 80 | USE(b0); |
| 81 | const Operator* b1_op = common()->Parameter(1); |
| 82 | Node* b1 = graph()->NewNode(b1_op, graph()->start()); |
| 83 | USE(b0); |
| 84 | |
| 85 | const Operator* p1_op = common()->Parameter(3); |
| 86 | Node* p1 = graph()->NewNode(p1_op, graph()->start()); |
| 87 | USE(p1); |
| 88 | |
| 89 | const Operator* a_op = machine()->Int32Add(); |
| 90 | USE(a_op); |
| 91 | |
| 92 | const Operator* m_op = machine()->Int32Mul(); |
| 93 | Node* m1 = graph()->NewNode(m_op, p1, d1); |
| 94 | Node* m2 = graph()->NewNode(m_op, p1, d2); |
| 95 | Node* m3 = graph()->NewNode(m_op, p1, d3); |
| 96 | Node* m4 = graph()->NewNode(m_op, p1, d4); |
| 97 | Node* m5 = graph()->NewNode(m_op, p1, d5); |
| 98 | Node* m7 = graph()->NewNode(m_op, p1, d7); |
| 99 | Node* m8 = graph()->NewNode(m_op, p1, d8); |
| 100 | Node* m9 = graph()->NewNode(m_op, p1, d9); |
| 101 | USE(m1); |
| 102 | USE(m2); |
| 103 | USE(m3); |
| 104 | USE(m4); |
| 105 | USE(m5); |
| 106 | USE(m7); |
| 107 | USE(m8); |
| 108 | USE(m9); |
| 109 | |
| 110 | const Operator* s_op = machine()->Word32Shl(); |
| 111 | Node* s0 = graph()->NewNode(s_op, p1, d0); |
| 112 | Node* s1 = graph()->NewNode(s_op, p1, d1); |
| 113 | Node* s2 = graph()->NewNode(s_op, p1, d2); |
| 114 | Node* s3 = graph()->NewNode(s_op, p1, d3); |
| 115 | Node* s4 = graph()->NewNode(s_op, p1, d4); |
| 116 | USE(s0); |
| 117 | USE(s1); |
| 118 | USE(s2); |
| 119 | USE(s3); |
| 120 | USE(s4); |
| 121 | |
| 122 | // 1 INPUT |
| 123 | |
| 124 | // Only relevant test dases is Checking for non-match. |
| 125 | BaseWithIndexAndDisplacement32Matcher match0(d15); |
| 126 | EXPECT_FALSE(match0.matches()); |
| 127 | |
| 128 | // 2 INPUT |
| 129 | |
| 130 | // (B0 + B1) -> [B0, 0, B1, NULL] |
| 131 | BaseWithIndexAndDisplacement32Matcher match1(graph()->NewNode(a_op, b0, b1)); |
| 132 | CheckBaseWithIndexAndDisplacement(&match1, b1, 0, b0, NULL); |
| 133 | |
| 134 | // (B0 + D15) -> [NULL, 0, B0, D15] |
| 135 | BaseWithIndexAndDisplacement32Matcher match2(graph()->NewNode(a_op, b0, d15)); |
| 136 | CheckBaseWithIndexAndDisplacement(&match2, NULL, 0, b0, d15); |
| 137 | |
| 138 | // (D15 + B0) -> [NULL, 0, B0, D15] |
| 139 | BaseWithIndexAndDisplacement32Matcher match3(graph()->NewNode(a_op, d15, b0)); |
| 140 | CheckBaseWithIndexAndDisplacement(&match3, NULL, 0, b0, d15); |
| 141 | |
| 142 | // (B0 + M1) -> [p1, 0, B0, NULL] |
| 143 | BaseWithIndexAndDisplacement32Matcher match4(graph()->NewNode(a_op, b0, m1)); |
| 144 | CheckBaseWithIndexAndDisplacement(&match4, p1, 0, b0, NULL); |
| 145 | |
| 146 | // (M1 + B0) -> [p1, 0, B0, NULL] |
| 147 | m1 = graph()->NewNode(m_op, p1, d1); |
| 148 | BaseWithIndexAndDisplacement32Matcher match5(graph()->NewNode(a_op, m1, b0)); |
| 149 | CheckBaseWithIndexAndDisplacement(&match5, p1, 0, b0, NULL); |
| 150 | |
| 151 | // (D15 + M1) -> [P1, 0, NULL, D15] |
| 152 | m1 = graph()->NewNode(m_op, p1, d1); |
| 153 | BaseWithIndexAndDisplacement32Matcher match6(graph()->NewNode(a_op, d15, m1)); |
| 154 | CheckBaseWithIndexAndDisplacement(&match6, p1, 0, NULL, d15); |
| 155 | |
| 156 | // (M1 + D15) -> [P1, 0, NULL, D15] |
| 157 | m1 = graph()->NewNode(m_op, p1, d1); |
| 158 | BaseWithIndexAndDisplacement32Matcher match7(graph()->NewNode(a_op, m1, d15)); |
| 159 | CheckBaseWithIndexAndDisplacement(&match7, p1, 0, NULL, d15); |
| 160 | |
| 161 | // (B0 + S0) -> [p1, 0, B0, NULL] |
| 162 | BaseWithIndexAndDisplacement32Matcher match8(graph()->NewNode(a_op, b0, s0)); |
| 163 | CheckBaseWithIndexAndDisplacement(&match8, p1, 0, b0, NULL); |
| 164 | |
| 165 | // (S0 + B0) -> [p1, 0, B0, NULL] |
| 166 | s0 = graph()->NewNode(s_op, p1, d0); |
| 167 | BaseWithIndexAndDisplacement32Matcher match9(graph()->NewNode(a_op, s0, b0)); |
| 168 | CheckBaseWithIndexAndDisplacement(&match9, p1, 0, b0, NULL); |
| 169 | |
| 170 | // (D15 + S0) -> [P1, 0, NULL, D15] |
| 171 | s0 = graph()->NewNode(s_op, p1, d0); |
| 172 | BaseWithIndexAndDisplacement32Matcher match10( |
| 173 | graph()->NewNode(a_op, d15, s0)); |
| 174 | CheckBaseWithIndexAndDisplacement(&match10, p1, 0, NULL, d15); |
| 175 | |
| 176 | // (S0 + D15) -> [P1, 0, NULL, D15] |
| 177 | s0 = graph()->NewNode(s_op, p1, d0); |
| 178 | BaseWithIndexAndDisplacement32Matcher match11( |
| 179 | graph()->NewNode(a_op, s0, d15)); |
| 180 | CheckBaseWithIndexAndDisplacement(&match11, p1, 0, NULL, d15); |
| 181 | |
| 182 | // (B0 + M2) -> [p1, 1, B0, NULL] |
| 183 | BaseWithIndexAndDisplacement32Matcher match12(graph()->NewNode(a_op, b0, m2)); |
| 184 | CheckBaseWithIndexAndDisplacement(&match12, p1, 1, b0, NULL); |
| 185 | |
| 186 | // (M2 + B0) -> [p1, 1, B0, NULL] |
| 187 | m2 = graph()->NewNode(m_op, p1, d2); |
| 188 | BaseWithIndexAndDisplacement32Matcher match13(graph()->NewNode(a_op, m2, b0)); |
| 189 | CheckBaseWithIndexAndDisplacement(&match13, p1, 1, b0, NULL); |
| 190 | |
| 191 | // (D15 + M2) -> [P1, 1, NULL, D15] |
| 192 | m2 = graph()->NewNode(m_op, p1, d2); |
| 193 | BaseWithIndexAndDisplacement32Matcher match14( |
| 194 | graph()->NewNode(a_op, d15, m2)); |
| 195 | CheckBaseWithIndexAndDisplacement(&match14, p1, 1, NULL, d15); |
| 196 | |
| 197 | // (M2 + D15) -> [P1, 1, NULL, D15] |
| 198 | m2 = graph()->NewNode(m_op, p1, d2); |
| 199 | BaseWithIndexAndDisplacement32Matcher match15( |
| 200 | graph()->NewNode(a_op, m2, d15)); |
| 201 | CheckBaseWithIndexAndDisplacement(&match15, p1, 1, NULL, d15); |
| 202 | |
| 203 | // (B0 + S1) -> [p1, 1, B0, NULL] |
| 204 | BaseWithIndexAndDisplacement32Matcher match16(graph()->NewNode(a_op, b0, s1)); |
| 205 | CheckBaseWithIndexAndDisplacement(&match16, p1, 1, b0, NULL); |
| 206 | |
| 207 | // (S1 + B0) -> [p1, 1, B0, NULL] |
| 208 | s1 = graph()->NewNode(s_op, p1, d1); |
| 209 | BaseWithIndexAndDisplacement32Matcher match17(graph()->NewNode(a_op, s1, b0)); |
| 210 | CheckBaseWithIndexAndDisplacement(&match17, p1, 1, b0, NULL); |
| 211 | |
| 212 | // (D15 + S1) -> [P1, 1, NULL, D15] |
| 213 | s1 = graph()->NewNode(s_op, p1, d1); |
| 214 | BaseWithIndexAndDisplacement32Matcher match18( |
| 215 | graph()->NewNode(a_op, d15, s1)); |
| 216 | CheckBaseWithIndexAndDisplacement(&match18, p1, 1, NULL, d15); |
| 217 | |
| 218 | // (S1 + D15) -> [P1, 1, NULL, D15] |
| 219 | s1 = graph()->NewNode(s_op, p1, d1); |
| 220 | BaseWithIndexAndDisplacement32Matcher match19( |
| 221 | graph()->NewNode(a_op, s1, d15)); |
| 222 | CheckBaseWithIndexAndDisplacement(&match19, p1, 1, NULL, d15); |
| 223 | |
| 224 | // (B0 + M4) -> [p1, 2, B0, NULL] |
| 225 | BaseWithIndexAndDisplacement32Matcher match20(graph()->NewNode(a_op, b0, m4)); |
| 226 | CheckBaseWithIndexAndDisplacement(&match20, p1, 2, b0, NULL); |
| 227 | |
| 228 | // (M4 + B0) -> [p1, 2, B0, NULL] |
| 229 | m4 = graph()->NewNode(m_op, p1, d4); |
| 230 | BaseWithIndexAndDisplacement32Matcher match21(graph()->NewNode(a_op, m4, b0)); |
| 231 | CheckBaseWithIndexAndDisplacement(&match21, p1, 2, b0, NULL); |
| 232 | |
| 233 | // (D15 + M4) -> [p1, 2, NULL, D15] |
| 234 | m4 = graph()->NewNode(m_op, p1, d4); |
| 235 | BaseWithIndexAndDisplacement32Matcher match22( |
| 236 | graph()->NewNode(a_op, d15, m4)); |
| 237 | CheckBaseWithIndexAndDisplacement(&match22, p1, 2, NULL, d15); |
| 238 | |
| 239 | // (M4 + D15) -> [p1, 2, NULL, D15] |
| 240 | m4 = graph()->NewNode(m_op, p1, d4); |
| 241 | BaseWithIndexAndDisplacement32Matcher match23( |
| 242 | graph()->NewNode(a_op, m4, d15)); |
| 243 | CheckBaseWithIndexAndDisplacement(&match23, p1, 2, NULL, d15); |
| 244 | |
| 245 | // (B0 + S2) -> [p1, 2, B0, NULL] |
| 246 | BaseWithIndexAndDisplacement32Matcher match24(graph()->NewNode(a_op, b0, s2)); |
| 247 | CheckBaseWithIndexAndDisplacement(&match24, p1, 2, b0, NULL); |
| 248 | |
| 249 | // (S2 + B0) -> [p1, 2, B0, NULL] |
| 250 | s2 = graph()->NewNode(s_op, p1, d2); |
| 251 | BaseWithIndexAndDisplacement32Matcher match25(graph()->NewNode(a_op, s2, b0)); |
| 252 | CheckBaseWithIndexAndDisplacement(&match25, p1, 2, b0, NULL); |
| 253 | |
| 254 | // (D15 + S2) -> [p1, 2, NULL, D15] |
| 255 | s2 = graph()->NewNode(s_op, p1, d2); |
| 256 | BaseWithIndexAndDisplacement32Matcher match26( |
| 257 | graph()->NewNode(a_op, d15, s2)); |
| 258 | CheckBaseWithIndexAndDisplacement(&match26, p1, 2, NULL, d15); |
| 259 | |
| 260 | // (S2 + D15) -> [p1, 2, NULL, D15] |
| 261 | s2 = graph()->NewNode(s_op, p1, d2); |
| 262 | BaseWithIndexAndDisplacement32Matcher match27( |
| 263 | graph()->NewNode(a_op, s2, d15)); |
| 264 | CheckBaseWithIndexAndDisplacement(&match27, p1, 2, NULL, d15); |
| 265 | |
| 266 | // (B0 + M8) -> [p1, 2, B0, NULL] |
| 267 | BaseWithIndexAndDisplacement32Matcher match28(graph()->NewNode(a_op, b0, m8)); |
| 268 | CheckBaseWithIndexAndDisplacement(&match28, p1, 3, b0, NULL); |
| 269 | |
| 270 | // (M8 + B0) -> [p1, 2, B0, NULL] |
| 271 | m8 = graph()->NewNode(m_op, p1, d8); |
| 272 | BaseWithIndexAndDisplacement32Matcher match29(graph()->NewNode(a_op, m8, b0)); |
| 273 | CheckBaseWithIndexAndDisplacement(&match29, p1, 3, b0, NULL); |
| 274 | |
| 275 | // (D15 + M8) -> [p1, 2, NULL, D15] |
| 276 | m8 = graph()->NewNode(m_op, p1, d8); |
| 277 | BaseWithIndexAndDisplacement32Matcher match30( |
| 278 | graph()->NewNode(a_op, d15, m8)); |
| 279 | CheckBaseWithIndexAndDisplacement(&match30, p1, 3, NULL, d15); |
| 280 | |
| 281 | // (M8 + D15) -> [p1, 2, NULL, D15] |
| 282 | m8 = graph()->NewNode(m_op, p1, d8); |
| 283 | BaseWithIndexAndDisplacement32Matcher match31( |
| 284 | graph()->NewNode(a_op, m8, d15)); |
| 285 | CheckBaseWithIndexAndDisplacement(&match31, p1, 3, NULL, d15); |
| 286 | |
| 287 | // (B0 + S3) -> [p1, 2, B0, NULL] |
| 288 | BaseWithIndexAndDisplacement32Matcher match32(graph()->NewNode(a_op, b0, s3)); |
| 289 | CheckBaseWithIndexAndDisplacement(&match32, p1, 3, b0, NULL); |
| 290 | |
| 291 | // (S3 + B0) -> [p1, 2, B0, NULL] |
| 292 | s3 = graph()->NewNode(s_op, p1, d3); |
| 293 | BaseWithIndexAndDisplacement32Matcher match33(graph()->NewNode(a_op, s3, b0)); |
| 294 | CheckBaseWithIndexAndDisplacement(&match33, p1, 3, b0, NULL); |
| 295 | |
| 296 | // (D15 + S3) -> [p1, 2, NULL, D15] |
| 297 | s3 = graph()->NewNode(s_op, p1, d3); |
| 298 | BaseWithIndexAndDisplacement32Matcher match34( |
| 299 | graph()->NewNode(a_op, d15, s3)); |
| 300 | CheckBaseWithIndexAndDisplacement(&match34, p1, 3, NULL, d15); |
| 301 | |
| 302 | // (S3 + D15) -> [p1, 2, NULL, D15] |
| 303 | s3 = graph()->NewNode(s_op, p1, d3); |
| 304 | BaseWithIndexAndDisplacement32Matcher match35( |
| 305 | graph()->NewNode(a_op, s3, d15)); |
| 306 | CheckBaseWithIndexAndDisplacement(&match35, p1, 3, NULL, d15); |
| 307 | |
| 308 | // 2 INPUT - NEGATIVE CASES |
| 309 | |
| 310 | // (M3 + B1) -> [B0, 0, M3, NULL] |
| 311 | BaseWithIndexAndDisplacement32Matcher match36(graph()->NewNode(a_op, b1, m3)); |
| 312 | CheckBaseWithIndexAndDisplacement(&match36, m3, 0, b1, NULL); |
| 313 | |
| 314 | // (S4 + B1) -> [B0, 0, S4, NULL] |
| 315 | BaseWithIndexAndDisplacement32Matcher match37(graph()->NewNode(a_op, b1, s4)); |
| 316 | CheckBaseWithIndexAndDisplacement(&match37, s4, 0, b1, NULL); |
| 317 | |
| 318 | // 3 INPUT |
| 319 | |
| 320 | // (D15 + S3) + B0 -> [p1, 2, b0, d15] |
| 321 | s3 = graph()->NewNode(s_op, p1, d3); |
| 322 | BaseWithIndexAndDisplacement32Matcher match38( |
| 323 | graph()->NewNode(a_op, graph()->NewNode(a_op, d15, s3), b0)); |
| 324 | CheckBaseWithIndexAndDisplacement(&match38, p1, 3, b0, d15); |
| 325 | |
| 326 | // (B0 + D15) + S3 -> [p1, 2, b0, d15] |
| 327 | s3 = graph()->NewNode(s_op, p1, d3); |
| 328 | BaseWithIndexAndDisplacement32Matcher match39( |
| 329 | graph()->NewNode(a_op, graph()->NewNode(a_op, b0, d15), s3)); |
| 330 | CheckBaseWithIndexAndDisplacement(&match39, p1, 3, b0, d15); |
| 331 | |
| 332 | // (S3 + B0) + D15 -> [p1, 2, b0, d15] |
| 333 | s3 = graph()->NewNode(s_op, p1, d3); |
| 334 | BaseWithIndexAndDisplacement32Matcher match40( |
| 335 | graph()->NewNode(a_op, graph()->NewNode(a_op, s3, b0), d15)); |
| 336 | CheckBaseWithIndexAndDisplacement(&match40, p1, 3, b0, d15); |
| 337 | |
| 338 | // D15 + (S3 + B0) -> [p1, 2, b0, d15] |
| 339 | s3 = graph()->NewNode(s_op, p1, d3); |
| 340 | BaseWithIndexAndDisplacement32Matcher match41( |
| 341 | graph()->NewNode(a_op, d15, graph()->NewNode(a_op, s3, b0))); |
| 342 | CheckBaseWithIndexAndDisplacement(&match41, p1, 3, b0, d15); |
| 343 | |
| 344 | // B0 + (D15 + S3) -> [p1, 2, b0, d15] |
| 345 | s3 = graph()->NewNode(s_op, p1, d3); |
| 346 | BaseWithIndexAndDisplacement32Matcher match42( |
| 347 | graph()->NewNode(a_op, b0, graph()->NewNode(a_op, d15, s3))); |
| 348 | CheckBaseWithIndexAndDisplacement(&match42, p1, 3, b0, d15); |
| 349 | |
| 350 | // S3 + (B0 + D15) -> [p1, 2, b0, d15] |
| 351 | s3 = graph()->NewNode(s_op, p1, d3); |
| 352 | BaseWithIndexAndDisplacement32Matcher match43( |
| 353 | graph()->NewNode(a_op, s3, graph()->NewNode(a_op, b0, d15))); |
| 354 | CheckBaseWithIndexAndDisplacement(&match43, p1, 3, b0, d15); |
| 355 | |
| 356 | // Check that scales that require using the base address work dorrectly. |
| 357 | } |
| 358 | |
| 359 | |
| 360 | TEST_F(NodeMatcherTest, ScaledWithOffset64Matcher) { |
| 361 | graph()->SetStart(graph()->NewNode(common()->Start(0))); |
| 362 | |
| 363 | const Operator* d0_op = common()->Int64Constant(0); |
| 364 | Node* d0 = graph()->NewNode(d0_op); |
| 365 | USE(d0); |
| 366 | const Operator* d1_op = common()->Int64Constant(1); |
| 367 | Node* d1 = graph()->NewNode(d1_op); |
| 368 | USE(d1); |
| 369 | const Operator* d2_op = common()->Int64Constant(2); |
| 370 | Node* d2 = graph()->NewNode(d2_op); |
| 371 | USE(d2); |
| 372 | const Operator* d3_op = common()->Int64Constant(3); |
| 373 | Node* d3 = graph()->NewNode(d3_op); |
| 374 | USE(d3); |
| 375 | const Operator* d4_op = common()->Int64Constant(4); |
| 376 | Node* d4 = graph()->NewNode(d4_op); |
| 377 | USE(d4); |
| 378 | const Operator* d5_op = common()->Int64Constant(5); |
| 379 | Node* d5 = graph()->NewNode(d5_op); |
| 380 | USE(d5); |
| 381 | const Operator* d7_op = common()->Int64Constant(7); |
| 382 | Node* d7 = graph()->NewNode(d7_op); |
| 383 | USE(d7); |
| 384 | const Operator* d8_op = common()->Int64Constant(8); |
| 385 | Node* d8 = graph()->NewNode(d8_op); |
| 386 | USE(d8); |
| 387 | const Operator* d9_op = common()->Int64Constant(9); |
| 388 | Node* d9 = graph()->NewNode(d9_op); |
| 389 | USE(d8); |
| 390 | const Operator* d15_op = common()->Int64Constant(15); |
| 391 | Node* d15 = graph()->NewNode(d15_op); |
| 392 | USE(d15); |
| 393 | const Operator* d15_32_op = common()->Int32Constant(15); |
| 394 | Node* d15_32 = graph()->NewNode(d15_32_op); |
| 395 | USE(d15_32); |
| 396 | |
| 397 | const Operator* b0_op = common()->Parameter(0); |
| 398 | Node* b0 = graph()->NewNode(b0_op, graph()->start()); |
| 399 | USE(b0); |
| 400 | const Operator* b1_op = common()->Parameter(1); |
| 401 | Node* b1 = graph()->NewNode(b1_op, graph()->start()); |
| 402 | USE(b0); |
| 403 | |
| 404 | const Operator* p1_op = common()->Parameter(3); |
| 405 | Node* p1 = graph()->NewNode(p1_op, graph()->start()); |
| 406 | USE(p1); |
| 407 | |
| 408 | const Operator* a_op = machine()->Int64Add(); |
| 409 | USE(a_op); |
| 410 | |
| 411 | const Operator* m_op = machine()->Int64Mul(); |
| 412 | Node* m1 = graph()->NewNode(m_op, p1, d1); |
| 413 | Node* m2 = graph()->NewNode(m_op, p1, d2); |
| 414 | Node* m3 = graph()->NewNode(m_op, p1, d3); |
| 415 | Node* m4 = graph()->NewNode(m_op, p1, d4); |
| 416 | Node* m5 = graph()->NewNode(m_op, p1, d5); |
| 417 | Node* m7 = graph()->NewNode(m_op, p1, d7); |
| 418 | Node* m8 = graph()->NewNode(m_op, p1, d8); |
| 419 | Node* m9 = graph()->NewNode(m_op, p1, d9); |
| 420 | USE(m1); |
| 421 | USE(m2); |
| 422 | USE(m3); |
| 423 | USE(m4); |
| 424 | USE(m5); |
| 425 | USE(m7); |
| 426 | USE(m8); |
| 427 | USE(m9); |
| 428 | |
| 429 | const Operator* s_op = machine()->Word64Shl(); |
| 430 | Node* s0 = graph()->NewNode(s_op, p1, d0); |
| 431 | Node* s1 = graph()->NewNode(s_op, p1, d1); |
| 432 | Node* s2 = graph()->NewNode(s_op, p1, d2); |
| 433 | Node* s3 = graph()->NewNode(s_op, p1, d3); |
| 434 | Node* s4 = graph()->NewNode(s_op, p1, d4); |
| 435 | USE(s0); |
| 436 | USE(s1); |
| 437 | USE(s2); |
| 438 | USE(s3); |
| 439 | USE(s4); |
| 440 | |
| 441 | // 1 INPUT |
| 442 | |
| 443 | // Only relevant test dases is Checking for non-match. |
| 444 | BaseWithIndexAndDisplacement64Matcher match0(d15); |
| 445 | EXPECT_FALSE(match0.matches()); |
| 446 | |
| 447 | // 2 INPUT |
| 448 | |
| 449 | // (B0 + B1) -> [B0, 0, B1, NULL] |
| 450 | BaseWithIndexAndDisplacement64Matcher match1(graph()->NewNode(a_op, b0, b1)); |
| 451 | CheckBaseWithIndexAndDisplacement(&match1, b1, 0, b0, NULL); |
| 452 | |
| 453 | // (B0 + D15) -> [NULL, 0, B0, D15] |
| 454 | BaseWithIndexAndDisplacement64Matcher match2(graph()->NewNode(a_op, b0, d15)); |
| 455 | CheckBaseWithIndexAndDisplacement(&match2, NULL, 0, b0, d15); |
| 456 | |
| 457 | BaseWithIndexAndDisplacement64Matcher match2_32( |
| 458 | graph()->NewNode(a_op, b0, d15_32)); |
| 459 | CheckBaseWithIndexAndDisplacement(&match2_32, NULL, 0, b0, d15_32); |
| 460 | |
| 461 | // (D15 + B0) -> [NULL, 0, B0, D15] |
| 462 | BaseWithIndexAndDisplacement64Matcher match3(graph()->NewNode(a_op, d15, b0)); |
| 463 | CheckBaseWithIndexAndDisplacement(&match3, NULL, 0, b0, d15); |
| 464 | |
| 465 | // (B0 + M1) -> [p1, 0, B0, NULL] |
| 466 | BaseWithIndexAndDisplacement64Matcher match4(graph()->NewNode(a_op, b0, m1)); |
| 467 | CheckBaseWithIndexAndDisplacement(&match4, p1, 0, b0, NULL); |
| 468 | |
| 469 | // (M1 + B0) -> [p1, 0, B0, NULL] |
| 470 | m1 = graph()->NewNode(m_op, p1, d1); |
| 471 | BaseWithIndexAndDisplacement64Matcher match5(graph()->NewNode(a_op, m1, b0)); |
| 472 | CheckBaseWithIndexAndDisplacement(&match5, p1, 0, b0, NULL); |
| 473 | |
| 474 | // (D15 + M1) -> [P1, 0, NULL, D15] |
| 475 | m1 = graph()->NewNode(m_op, p1, d1); |
| 476 | BaseWithIndexAndDisplacement64Matcher match6(graph()->NewNode(a_op, d15, m1)); |
| 477 | CheckBaseWithIndexAndDisplacement(&match6, p1, 0, NULL, d15); |
| 478 | |
| 479 | // (M1 + D15) -> [P1, 0, NULL, D15] |
| 480 | m1 = graph()->NewNode(m_op, p1, d1); |
| 481 | BaseWithIndexAndDisplacement64Matcher match7(graph()->NewNode(a_op, m1, d15)); |
| 482 | CheckBaseWithIndexAndDisplacement(&match7, p1, 0, NULL, d15); |
| 483 | |
| 484 | // (B0 + S0) -> [p1, 0, B0, NULL] |
| 485 | BaseWithIndexAndDisplacement64Matcher match8(graph()->NewNode(a_op, b0, s0)); |
| 486 | CheckBaseWithIndexAndDisplacement(&match8, p1, 0, b0, NULL); |
| 487 | |
| 488 | // (S0 + B0) -> [p1, 0, B0, NULL] |
| 489 | s0 = graph()->NewNode(s_op, p1, d0); |
| 490 | BaseWithIndexAndDisplacement64Matcher match9(graph()->NewNode(a_op, s0, b0)); |
| 491 | CheckBaseWithIndexAndDisplacement(&match9, p1, 0, b0, NULL); |
| 492 | |
| 493 | // (D15 + S0) -> [P1, 0, NULL, D15] |
| 494 | s0 = graph()->NewNode(s_op, p1, d0); |
| 495 | BaseWithIndexAndDisplacement64Matcher match10( |
| 496 | graph()->NewNode(a_op, d15, s0)); |
| 497 | CheckBaseWithIndexAndDisplacement(&match10, p1, 0, NULL, d15); |
| 498 | |
| 499 | // (S0 + D15) -> [P1, 0, NULL, D15] |
| 500 | s0 = graph()->NewNode(s_op, p1, d0); |
| 501 | BaseWithIndexAndDisplacement64Matcher match11( |
| 502 | graph()->NewNode(a_op, s0, d15)); |
| 503 | CheckBaseWithIndexAndDisplacement(&match11, p1, 0, NULL, d15); |
| 504 | |
| 505 | // (B0 + M2) -> [p1, 1, B0, NULL] |
| 506 | BaseWithIndexAndDisplacement64Matcher match12(graph()->NewNode(a_op, b0, m2)); |
| 507 | CheckBaseWithIndexAndDisplacement(&match12, p1, 1, b0, NULL); |
| 508 | |
| 509 | // (M2 + B0) -> [p1, 1, B0, NULL] |
| 510 | m2 = graph()->NewNode(m_op, p1, d2); |
| 511 | BaseWithIndexAndDisplacement64Matcher match13(graph()->NewNode(a_op, m2, b0)); |
| 512 | CheckBaseWithIndexAndDisplacement(&match13, p1, 1, b0, NULL); |
| 513 | |
| 514 | // (D15 + M2) -> [P1, 1, NULL, D15] |
| 515 | m2 = graph()->NewNode(m_op, p1, d2); |
| 516 | BaseWithIndexAndDisplacement64Matcher match14( |
| 517 | graph()->NewNode(a_op, d15, m2)); |
| 518 | CheckBaseWithIndexAndDisplacement(&match14, p1, 1, NULL, d15); |
| 519 | |
| 520 | // (M2 + D15) -> [P1, 1, NULL, D15] |
| 521 | m2 = graph()->NewNode(m_op, p1, d2); |
| 522 | BaseWithIndexAndDisplacement64Matcher match15( |
| 523 | graph()->NewNode(a_op, m2, d15)); |
| 524 | CheckBaseWithIndexAndDisplacement(&match15, p1, 1, NULL, d15); |
| 525 | |
| 526 | // (B0 + S1) -> [p1, 1, B0, NULL] |
| 527 | BaseWithIndexAndDisplacement64Matcher match16(graph()->NewNode(a_op, b0, s1)); |
| 528 | CheckBaseWithIndexAndDisplacement(&match16, p1, 1, b0, NULL); |
| 529 | |
| 530 | // (S1 + B0) -> [p1, 1, B0, NULL] |
| 531 | s1 = graph()->NewNode(s_op, p1, d1); |
| 532 | BaseWithIndexAndDisplacement64Matcher match17(graph()->NewNode(a_op, s1, b0)); |
| 533 | CheckBaseWithIndexAndDisplacement(&match17, p1, 1, b0, NULL); |
| 534 | |
| 535 | // (D15 + S1) -> [P1, 1, NULL, D15] |
| 536 | s1 = graph()->NewNode(s_op, p1, d1); |
| 537 | BaseWithIndexAndDisplacement64Matcher match18( |
| 538 | graph()->NewNode(a_op, d15, s1)); |
| 539 | CheckBaseWithIndexAndDisplacement(&match18, p1, 1, NULL, d15); |
| 540 | |
| 541 | // (S1 + D15) -> [P1, 1, NULL, D15] |
| 542 | s1 = graph()->NewNode(s_op, p1, d1); |
| 543 | BaseWithIndexAndDisplacement64Matcher match19( |
| 544 | graph()->NewNode(a_op, s1, d15)); |
| 545 | CheckBaseWithIndexAndDisplacement(&match19, p1, 1, NULL, d15); |
| 546 | |
| 547 | // (B0 + M4) -> [p1, 2, B0, NULL] |
| 548 | BaseWithIndexAndDisplacement64Matcher match20(graph()->NewNode(a_op, b0, m4)); |
| 549 | CheckBaseWithIndexAndDisplacement(&match20, p1, 2, b0, NULL); |
| 550 | |
| 551 | // (M4 + B0) -> [p1, 2, B0, NULL] |
| 552 | m4 = graph()->NewNode(m_op, p1, d4); |
| 553 | BaseWithIndexAndDisplacement64Matcher match21(graph()->NewNode(a_op, m4, b0)); |
| 554 | CheckBaseWithIndexAndDisplacement(&match21, p1, 2, b0, NULL); |
| 555 | |
| 556 | // (D15 + M4) -> [p1, 2, NULL, D15] |
| 557 | m4 = graph()->NewNode(m_op, p1, d4); |
| 558 | BaseWithIndexAndDisplacement64Matcher match22( |
| 559 | graph()->NewNode(a_op, d15, m4)); |
| 560 | CheckBaseWithIndexAndDisplacement(&match22, p1, 2, NULL, d15); |
| 561 | |
| 562 | // (M4 + D15) -> [p1, 2, NULL, D15] |
| 563 | m4 = graph()->NewNode(m_op, p1, d4); |
| 564 | BaseWithIndexAndDisplacement64Matcher match23( |
| 565 | graph()->NewNode(a_op, m4, d15)); |
| 566 | CheckBaseWithIndexAndDisplacement(&match23, p1, 2, NULL, d15); |
| 567 | |
| 568 | // (B0 + S2) -> [p1, 2, B0, NULL] |
| 569 | BaseWithIndexAndDisplacement64Matcher match24(graph()->NewNode(a_op, b0, s2)); |
| 570 | CheckBaseWithIndexAndDisplacement(&match24, p1, 2, b0, NULL); |
| 571 | |
| 572 | // (S2 + B0) -> [p1, 2, B0, NULL] |
| 573 | s2 = graph()->NewNode(s_op, p1, d2); |
| 574 | BaseWithIndexAndDisplacement64Matcher match25(graph()->NewNode(a_op, s2, b0)); |
| 575 | CheckBaseWithIndexAndDisplacement(&match25, p1, 2, b0, NULL); |
| 576 | |
| 577 | // (D15 + S2) -> [p1, 2, NULL, D15] |
| 578 | s2 = graph()->NewNode(s_op, p1, d2); |
| 579 | BaseWithIndexAndDisplacement64Matcher match26( |
| 580 | graph()->NewNode(a_op, d15, s2)); |
| 581 | CheckBaseWithIndexAndDisplacement(&match26, p1, 2, NULL, d15); |
| 582 | |
| 583 | // (S2 + D15) -> [p1, 2, NULL, D15] |
| 584 | s2 = graph()->NewNode(s_op, p1, d2); |
| 585 | BaseWithIndexAndDisplacement64Matcher match27( |
| 586 | graph()->NewNode(a_op, s2, d15)); |
| 587 | CheckBaseWithIndexAndDisplacement(&match27, p1, 2, NULL, d15); |
| 588 | |
| 589 | // (B0 + M8) -> [p1, 2, B0, NULL] |
| 590 | BaseWithIndexAndDisplacement64Matcher match28(graph()->NewNode(a_op, b0, m8)); |
| 591 | CheckBaseWithIndexAndDisplacement(&match28, p1, 3, b0, NULL); |
| 592 | |
| 593 | // (M8 + B0) -> [p1, 2, B0, NULL] |
| 594 | m8 = graph()->NewNode(m_op, p1, d8); |
| 595 | BaseWithIndexAndDisplacement64Matcher match29(graph()->NewNode(a_op, m8, b0)); |
| 596 | CheckBaseWithIndexAndDisplacement(&match29, p1, 3, b0, NULL); |
| 597 | |
| 598 | // (D15 + M8) -> [p1, 2, NULL, D15] |
| 599 | m8 = graph()->NewNode(m_op, p1, d8); |
| 600 | BaseWithIndexAndDisplacement64Matcher match30( |
| 601 | graph()->NewNode(a_op, d15, m8)); |
| 602 | CheckBaseWithIndexAndDisplacement(&match30, p1, 3, NULL, d15); |
| 603 | |
| 604 | // (M8 + D15) -> [p1, 2, NULL, D15] |
| 605 | m8 = graph()->NewNode(m_op, p1, d8); |
| 606 | BaseWithIndexAndDisplacement64Matcher match31( |
| 607 | graph()->NewNode(a_op, m8, d15)); |
| 608 | CheckBaseWithIndexAndDisplacement(&match31, p1, 3, NULL, d15); |
| 609 | |
| 610 | // (B0 + S3) -> [p1, 2, B0, NULL] |
| 611 | BaseWithIndexAndDisplacement64Matcher match64(graph()->NewNode(a_op, b0, s3)); |
| 612 | CheckBaseWithIndexAndDisplacement(&match64, p1, 3, b0, NULL); |
| 613 | |
| 614 | // (S3 + B0) -> [p1, 2, B0, NULL] |
| 615 | s3 = graph()->NewNode(s_op, p1, d3); |
| 616 | BaseWithIndexAndDisplacement64Matcher match33(graph()->NewNode(a_op, s3, b0)); |
| 617 | CheckBaseWithIndexAndDisplacement(&match33, p1, 3, b0, NULL); |
| 618 | |
| 619 | // (D15 + S3) -> [p1, 2, NULL, D15] |
| 620 | s3 = graph()->NewNode(s_op, p1, d3); |
| 621 | BaseWithIndexAndDisplacement64Matcher match34( |
| 622 | graph()->NewNode(a_op, d15, s3)); |
| 623 | CheckBaseWithIndexAndDisplacement(&match34, p1, 3, NULL, d15); |
| 624 | |
| 625 | // (S3 + D15) -> [p1, 2, NULL, D15] |
| 626 | s3 = graph()->NewNode(s_op, p1, d3); |
| 627 | BaseWithIndexAndDisplacement64Matcher match35( |
| 628 | graph()->NewNode(a_op, s3, d15)); |
| 629 | CheckBaseWithIndexAndDisplacement(&match35, p1, 3, NULL, d15); |
| 630 | |
| 631 | // 2 INPUT - NEGATIVE CASES |
| 632 | |
| 633 | // (M3 + B1) -> [B0, 0, M3, NULL] |
| 634 | BaseWithIndexAndDisplacement64Matcher match36(graph()->NewNode(a_op, b1, m3)); |
| 635 | CheckBaseWithIndexAndDisplacement(&match36, m3, 0, b1, NULL); |
| 636 | |
| 637 | // (S4 + B1) -> [B0, 0, S4, NULL] |
| 638 | BaseWithIndexAndDisplacement64Matcher match37(graph()->NewNode(a_op, b1, s4)); |
| 639 | CheckBaseWithIndexAndDisplacement(&match37, s4, 0, b1, NULL); |
| 640 | |
| 641 | // 3 INPUT |
| 642 | |
| 643 | // (D15 + S3) + B0 -> [p1, 2, b0, d15] |
| 644 | s3 = graph()->NewNode(s_op, p1, d3); |
| 645 | BaseWithIndexAndDisplacement64Matcher match38( |
| 646 | graph()->NewNode(a_op, graph()->NewNode(a_op, d15, s3), b0)); |
| 647 | CheckBaseWithIndexAndDisplacement(&match38, p1, 3, b0, d15); |
| 648 | |
| 649 | // (B0 + D15) + S3 -> [p1, 2, b0, d15] |
| 650 | s3 = graph()->NewNode(s_op, p1, d3); |
| 651 | BaseWithIndexAndDisplacement64Matcher match39( |
| 652 | graph()->NewNode(a_op, graph()->NewNode(a_op, b0, d15), s3)); |
| 653 | CheckBaseWithIndexAndDisplacement(&match39, p1, 3, b0, d15); |
| 654 | |
| 655 | // (S3 + B0) + D15 -> [p1, 2, b0, d15] |
| 656 | s3 = graph()->NewNode(s_op, p1, d3); |
| 657 | BaseWithIndexAndDisplacement64Matcher match40( |
| 658 | graph()->NewNode(a_op, graph()->NewNode(a_op, s3, b0), d15)); |
| 659 | CheckBaseWithIndexAndDisplacement(&match40, p1, 3, b0, d15); |
| 660 | |
| 661 | // D15 + (S3 + B0) -> [p1, 2, b0, d15] |
| 662 | s3 = graph()->NewNode(s_op, p1, d3); |
| 663 | BaseWithIndexAndDisplacement64Matcher match41( |
| 664 | graph()->NewNode(a_op, d15, graph()->NewNode(a_op, s3, b0))); |
| 665 | CheckBaseWithIndexAndDisplacement(&match41, p1, 3, b0, d15); |
| 666 | |
| 667 | // B0 + (D15 + S3) -> [p1, 2, b0, d15] |
| 668 | s3 = graph()->NewNode(s_op, p1, d3); |
| 669 | BaseWithIndexAndDisplacement64Matcher match42( |
| 670 | graph()->NewNode(a_op, b0, graph()->NewNode(a_op, d15, s3))); |
| 671 | CheckBaseWithIndexAndDisplacement(&match42, p1, 3, b0, d15); |
| 672 | |
| 673 | // S3 + (B0 + D15) -> [p1, 2, b0, d15] |
| 674 | s3 = graph()->NewNode(s_op, p1, d3); |
| 675 | BaseWithIndexAndDisplacement64Matcher match43( |
| 676 | graph()->NewNode(a_op, s3, graph()->NewNode(a_op, b0, d15))); |
| 677 | CheckBaseWithIndexAndDisplacement(&match43, p1, 3, b0, d15); |
| 678 | |
| 679 | // 2 INPUT with non-power of 2 scale |
| 680 | |
| 681 | // (M3 + D15) -> [p1, 1, p1, D15] |
| 682 | m3 = graph()->NewNode(m_op, p1, d3); |
| 683 | BaseWithIndexAndDisplacement64Matcher match44( |
| 684 | graph()->NewNode(a_op, m3, d15)); |
| 685 | CheckBaseWithIndexAndDisplacement(&match44, p1, 1, p1, d15); |
| 686 | |
| 687 | // (M5 + D15) -> [p1, 2, p1, D15] |
| 688 | m5 = graph()->NewNode(m_op, p1, d5); |
| 689 | BaseWithIndexAndDisplacement64Matcher match45( |
| 690 | graph()->NewNode(a_op, m5, d15)); |
| 691 | CheckBaseWithIndexAndDisplacement(&match45, p1, 2, p1, d15); |
| 692 | |
| 693 | // (M9 + D15) -> [p1, 3, p1, D15] |
| 694 | m9 = graph()->NewNode(m_op, p1, d9); |
| 695 | BaseWithIndexAndDisplacement64Matcher match46( |
| 696 | graph()->NewNode(a_op, m9, d15)); |
| 697 | CheckBaseWithIndexAndDisplacement(&match46, p1, 3, p1, d15); |
| 698 | |
| 699 | // 3 INPUT negative cases: non-power of 2 scale but with a base |
| 700 | |
| 701 | // ((M3 + B0) + D15) -> [m3, 0, b0, D15] |
| 702 | m3 = graph()->NewNode(m_op, p1, d3); |
| 703 | Node* temp = graph()->NewNode(a_op, m3, b0); |
| 704 | BaseWithIndexAndDisplacement64Matcher match47( |
| 705 | graph()->NewNode(a_op, temp, d15)); |
| 706 | CheckBaseWithIndexAndDisplacement(&match47, m3, 0, b0, d15); |
| 707 | |
| 708 | // (M3 + (B0 + D15)) -> [m3, 0, b0, D15] |
| 709 | m3 = graph()->NewNode(m_op, p1, d3); |
| 710 | temp = graph()->NewNode(a_op, d15, b0); |
| 711 | BaseWithIndexAndDisplacement64Matcher match48( |
| 712 | graph()->NewNode(a_op, m3, temp)); |
| 713 | CheckBaseWithIndexAndDisplacement(&match48, m3, 0, b0, d15); |
| 714 | |
| 715 | // ((B0 + M3) + D15) -> [m3, 0, b0, D15] |
| 716 | m3 = graph()->NewNode(m_op, p1, d3); |
| 717 | temp = graph()->NewNode(a_op, b0, m3); |
| 718 | BaseWithIndexAndDisplacement64Matcher match49( |
| 719 | graph()->NewNode(a_op, temp, d15)); |
| 720 | CheckBaseWithIndexAndDisplacement(&match49, m3, 0, b0, d15); |
| 721 | |
| 722 | // (M3 + (D15 + B0)) -> [m3, 0, b0, D15] |
| 723 | m3 = graph()->NewNode(m_op, p1, d3); |
| 724 | temp = graph()->NewNode(a_op, b0, d15); |
| 725 | BaseWithIndexAndDisplacement64Matcher match50( |
| 726 | graph()->NewNode(a_op, m3, temp)); |
| 727 | CheckBaseWithIndexAndDisplacement(&match50, m3, 0, b0, d15); |
| 728 | } |
| 729 | |
| 730 | |
| 731 | } // namespace compiler |
| 732 | } // namespace internal |
| 733 | } // namespace v8 |