summaryrefslogtreecommitdiff
path: root/src/passes/OptimizeInstructions.cpp
blob: 368b483ad15bf6d3971bc9897a0d67158a0ae723 (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
/*
 * Copyright 2016 WebAssembly Community Group participants
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

//
// Optimize combinations of instructions
//

#include <algorithm>

#include <wasm.h>
#include <pass.h>

namespace wasm {

struct OptimizeInstructions : public WalkerPass<PostWalker<OptimizeInstructions, Visitor<OptimizeInstructions>>> {
  bool isFunctionParallel() { return true; }

  void visitIf(If* curr) {
    // flip branches to get rid of an i32.eqz
    if (curr->ifFalse) {
      auto condition = curr->condition->dynCast<Unary>();
      if (condition && condition->op == EqZ && condition->value->type == i32) {
        curr->condition = condition->value;
        std::swap(curr->ifTrue, curr->ifFalse);
      }
    }
  }
  void visitUnary(Unary* curr) {
    if (curr->op == EqZ) {
      // fold comparisons that flow into an EqZ
      auto* child = curr->value->dynCast<Binary>();
      if (child && (child->type == i32 || child->type == i64)) {
        switch (child->op) {
          case Eq:  child->op = Ne; break;
          case Ne:  child->op = Eq; break;
          case LtS: child->op = GeS; break;
          case LtU: child->op = GeU; break;
          case LeS: child->op = GtS; break;
          case LeU: child->op = GtU; break;
          case GtS: child->op = LeS; break;
          case GtU: child->op = LeU; break;
          case GeS: child->op = LtS; break;
          case GeU: child->op = LtU; break;
          default: return;
        }
        replaceCurrent(child);
      }
    }
  }
};

static RegisterPass<OptimizeInstructions> registerPass("optimize-instructions", "optimizes instruction combinations");

} // namespace wasm