<commit_before>//===- ConstantFold.cpp - Pass that does constant folding -----------------===//
//
// Copyright 2019 The MLIR Authors.
//
// 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.
// =============================================================================

#include "mlir/IR/Builders.h"
#include "mlir/IR/CFGFunction.h"
#include "mlir/IR/StandardOps.h"
#include "mlir/Transforms/Pass.h"
#include "mlir/Transforms/Passes.h"
using namespace mlir;

namespace {
/// Simple constant folding pass.
struct ConstantFold : public FunctionPass {
  typedef std::function<SSAValue *(Attribute *, Type *)> ConstantFactoryType;

  bool foldOperation(Operation *op,
                     SmallVectorImpl<SSAValue *> &existingConstants,
                     ConstantFactoryType constantFactory);
  void foldStmtBlock(StmtBlock &block,
                     SmallVectorImpl<SSAValue *> &existingConstants);
  PassResult runOnCFGFunction(CFGFunction *f) override;
  PassResult runOnMLFunction(MLFunction *f) override;
};
} // end anonymous namespace

/// Attempt to fold the specified operation, updating the IR to match.  If
/// constants are found, we keep track of them in the existingConstants list.
///
/// This returns false if the operation was successfully folded.
bool ConstantFold::foldOperation(Operation *op,
                                 SmallVectorImpl<SSAValue *> &existingConstants,
                                 ConstantFactoryType constantFactory) {

  // If this operation is already a constant, just remember it for cleanup
  // later, and don't try to fold it.
  if (op->is<ConstantOp>()) {
    existingConstants.push_back(op->getResult(0));
    return true;
  }

  // Check to see if each of the operands is a trivial constant.  If so, get
  // the value.  If not, ignore the instruction.
  SmallVector<Attribute *, 8> operandConstants;
  for (auto *operand : op->getOperands()) {
    if (auto *operandOp = operand->getDefiningOperation()) {
      if (auto operandCst = operandOp->getAs<ConstantOp>()) {
        operandConstants.push_back(operandCst->getValue());
        continue;
      }
    }
    // If one of the operands was non-constant, then we can't fold it.
    return true;
  }

  // Attempt to constant fold the operation.
  SmallVector<Attribute *, 8> resultConstants;
  if (op->constantFold(operandConstants, resultConstants))
    return true;

  // Ok, if everything succeeded, then we can create constants corresponding
  // to the result of the call.
  // TODO: We can try to reuse existing constants if we see them laying
  // around.
  assert(resultConstants.size() == op->getNumResults() &&
         "constant folding produced the wrong number of results");

  for (unsigned i = 0, e = op->getNumResults(); i != e; ++i) {
    auto *res = op->getResult(i);
    if (res->use_empty()) // ignore dead uses.
      continue;

    auto *cst = constantFactory(resultConstants[i], res->getType());
    existingConstants.push_back(cst);
    res->replaceAllUsesWith(cst);
  }

  return false;
}

// For now, we do a simple top-down pass over a function folding constants.  We
// don't handle conditional control flow, constant PHI nodes, folding
// conditional branches, or anything else fancy.
PassResult ConstantFold::runOnCFGFunction(CFGFunction *f) {
  SmallVector<SSAValue *, 8> existingConstants;
  CFGFuncBuilder builder(f);

  for (auto &bb : *f) {
    for (auto instIt = bb.begin(), e = bb.end(); instIt != e;) {
      auto &inst = *instIt++;

      auto constantFactory = [&](Attribute *value, Type *type) -> SSAValue * {
        builder.setInsertionPoint(&inst);
        return builder.create<ConstantOp>(inst.getLoc(), value, type)
            ->getResult();
      };

      if (!foldOperation(&inst, existingConstants, constantFactory)) {
        // At this point the operation is dead, remove it.
        // TODO: This is assuming that all constant foldable operations have no
        // side effects.  When we have side effect modeling, we should verify
        // that the operation is effect-free before we remove it.  Until then
        // this is close enough.
        inst.eraseFromBlock();
      }
    }
  }

  // By the time we are done, we may have simplified a bunch of code, leaving
  // around dead constants.  Check for them now and remove them.
  for (auto *cst : existingConstants) {
    if (cst->use_empty())
      cst->getDefiningInst()->eraseFromBlock();
  }

  return success();
}

void ConstantFold::foldStmtBlock(
    StmtBlock &block, SmallVectorImpl<SSAValue *> &existingConstants) {
  for (auto stmtIt = block.begin(), e = block.end(); stmtIt != e;) {
    auto *stmt = &*stmtIt++;

    // Fold the bodies of if and for statements.
    // TODO: fold the conditions as well.
    if (auto *ifStmt = dyn_cast<IfStmt>(stmt)) {
      foldStmtBlock(*ifStmt->getThen(), existingConstants);
      if (auto *elseBlock = ifStmt->getElse())
        foldStmtBlock(*elseBlock, existingConstants);
      continue;
    }

    // TODO: Fold constant operands of mappings into the mapping itself.
    if (auto *forStmt = dyn_cast<ForStmt>(stmt)) {
      foldStmtBlock(*forStmt, existingConstants);
      continue;
    }

    // Otherwise, if this is an operation stmt, try to fold it.
    auto *opStmt = dyn_cast<OperationStmt>(stmt);
    if (!opStmt)
      continue;

    auto constantFactory = [&](Attribute *value, Type *type) -> SSAValue * {
      MLFuncBuilder builder(stmt);
      return builder.create<ConstantOp>(stmt->getLoc(), value, type)
          ->getResult();
    };

    if (!foldOperation(opStmt, existingConstants, constantFactory)) {
      // At this point the operation is dead, remove it.
      // TODO: This is assuming that all constant foldable operations have no
      // side effects.  When we have side effect modeling, we should verify that
      // the operation is effect-free before we remove it.  Until then this is
      // close enough.
      opStmt->eraseFromBlock();
    }
  }
}

PassResult ConstantFold::runOnMLFunction(MLFunction *f) {
  SmallVector<SSAValue *, 8> existingConstants;

  foldStmtBlock(*f, existingConstants);

  // By the time we are done, we may have simplified a bunch of code, leaving
  // around dead constants.  Check for them now and remove them.
  for (auto *cst : existingConstants) {
    if (cst->use_empty())
      cst->getDefiningStmt()->eraseFromBlock();
  }

  return success();
}

/// Creates a constant folding pass.
FunctionPass *mlir::createConstantFoldPass() { return new ConstantFold(); }<commit_msg>Use statement walker for constant folding.<commit_after>//===- ConstantFold.cpp - Pass that does constant folding -----------------===//
//
// Copyright 2019 The MLIR Authors.
//
// 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.
// =============================================================================

#include "mlir/IR/Builders.h"
#include "mlir/IR/CFGFunction.h"
#include "mlir/IR/StandardOps.h"
#include "mlir/IR/StmtVisitor.h"
#include "mlir/Transforms/Pass.h"
#include "mlir/Transforms/Passes.h"
using namespace mlir;

namespace {
/// Simple constant folding pass.
struct ConstantFold : public FunctionPass, StmtWalker<ConstantFold> {
  // All constants in the function post folding.
  SmallVector<SSAValue *, 8> existingConstants;
  // Operation statements that were folded and that need to be erased.
  std::vector<OperationStmt *> opStmtsToErase;
  typedef std::function<SSAValue *(Attribute *, Type *)> ConstantFactoryType;

  bool foldOperation(Operation *op,
                     SmallVectorImpl<SSAValue *> &existingConstants,
                     ConstantFactoryType constantFactory);
  void visitOperationStmt(OperationStmt *stmt);
  PassResult runOnCFGFunction(CFGFunction *f) override;
  PassResult runOnMLFunction(MLFunction *f) override;
};
} // end anonymous namespace

/// Attempt to fold the specified operation, updating the IR to match.  If
/// constants are found, we keep track of them in the existingConstants list.
///
/// This returns 0 if the operation was successfully folded.
bool ConstantFold::foldOperation(Operation *op,
                                 SmallVectorImpl<SSAValue *> &existingConstants,
                                 ConstantFactoryType constantFactory) {

  // If this operation is already a constant, just remember it for cleanup
  // later, and don't try to fold it.
  if (op->is<ConstantOp>()) {
    existingConstants.push_back(op->getResult(0));
    return 1;
  }

  // Check to see if each of the operands is a trivial constant.  If so, get
  // the value.  If not, ignore the instruction.
  SmallVector<Attribute *, 8> operandConstants;
  for (auto *operand : op->getOperands()) {
    if (auto *operandOp = operand->getDefiningOperation()) {
      if (auto operandCst = operandOp->getAs<ConstantOp>()) {
        operandConstants.push_back(operandCst->getValue());
        continue;
      }
    }
    // If one of the operands was non-constant, then we can't fold it.
    return true;
  }

  // Attempt to constant fold the operation.
  SmallVector<Attribute *, 8> resultConstants;
  if (op->constantFold(operandConstants, resultConstants))
    return true;

  // Ok, if everything succeeded, then we can create constants corresponding
  // to the result of the call.
  // TODO: We can try to reuse existing constants if we see them laying
  // around.
  assert(resultConstants.size() == op->getNumResults() &&
         "constant folding produced the wrong number of results");

  for (unsigned i = 0, e = op->getNumResults(); i != e; ++i) {
    auto *res = op->getResult(i);
    if (res->use_empty()) // ignore dead uses.
      continue;

    auto *cst = constantFactory(resultConstants[i], res->getType());
    existingConstants.push_back(cst);
    res->replaceAllUsesWith(cst);
  }

  return false;
}

// For now, we do a simple top-down pass over a function folding constants.  We
// don't handle conditional control flow, constant PHI nodes, folding
// conditional branches, or anything else fancy.
PassResult ConstantFold::runOnCFGFunction(CFGFunction *f) {
  existingConstants.clear();
  CFGFuncBuilder builder(f);

  for (auto &bb : *f) {
    for (auto instIt = bb.begin(), e = bb.end(); instIt != e;) {
      auto &inst = *instIt++;

      auto constantFactory = [&](Attribute *value, Type *type) -> SSAValue * {
        builder.setInsertionPoint(&inst);
        return builder.create<ConstantOp>(inst.getLoc(), value, type)
            ->getResult();
      };

      if (!foldOperation(&inst, existingConstants, constantFactory)) {
        // At this point the operation is dead, remove it.
        // TODO: This is assuming that all constant foldable operations have no
        // side effects.  When we have side effect modeling, we should verify
        // that the operation is effect-free before we remove it.  Until then
        // this is close enough.
        inst.eraseFromBlock();
      }
    }
  }

  // By the time we are done, we may have simplified a bunch of code, leaving
  // around dead constants.  Check for them now and remove them.
  for (auto *cst : existingConstants) {
    if (cst->use_empty())
      cst->getDefiningInst()->eraseFromBlock();
  }

  return success();
}

// Override the walker's operation statement visit for constant folding.
void ConstantFold::visitOperationStmt(OperationStmt *stmt) {
  auto constantFactory = [&](Attribute *value, Type *type) -> SSAValue * {
    MLFuncBuilder builder(stmt);
    return builder.create<ConstantOp>(stmt->getLoc(), value, type)->getResult();
  };
  if (!ConstantFold::foldOperation(stmt, existingConstants, constantFactory)) {
    opStmtsToErase.push_back(stmt);
  }
}

PassResult ConstantFold::runOnMLFunction(MLFunction *f) {
  existingConstants.clear();
  opStmtsToErase.clear();

  walk(f);
  // At this point, these operations are dead, remove them.
  // TODO: This is assuming that all constant foldable operations have no
  // side effects.  When we have side effect modeling, we should verify that
  // the operation is effect-free before we remove it.  Until then this is
  // close enough.
  for (auto *stmt : opStmtsToErase) {
    stmt->eraseFromBlock();
  }

  // By the time we are done, we may have simplified a bunch of code, leaving
  // around dead constants.  Check for them now and remove them.
  for (auto *cst : existingConstants) {
    if (cst->use_empty())
      cst->getDefiningStmt()->eraseFromBlock();
  }

  return success();
}

/// Creates a constant folding pass.
FunctionPass *mlir::createConstantFoldPass() { return new ConstantFold(); }
{'fraction_non_alphanumeric': 0.12266587940069378, 'fraction_numerical': 0.0021403793637906855, 'mean_word_length': 3.193748065614361, 'pattern_counts': {'":': 0, '<': 31, '<?xml version=': 0, '>': 83, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7636071', 'n_tokens_mistral': 3800, 'n_tokens_neox': 3738, 'n_words': 1327}