mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-30 05:26:06 +00:00

So we don't over count the number of chunks and do unnecessary work reducing more chunks than exist. This lowers some random reduction I tested with locally from 250s to 232s. Reviewed By: arsenm Differential Revision: https://reviews.llvm.org/D136127
50 lines
1.5 KiB
C++
50 lines
1.5 KiB
C++
//===- SimplifyInstructions.cpp - Specialized Delta Pass ------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements a function which calls the Generic Delta pass in order
|
|
// to simplify Instructions in defined functions.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "SimplifyInstructions.h"
|
|
#include "llvm/Analysis/InstructionSimplify.h"
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
using namespace llvm;
|
|
|
|
/// Calls simplifyInstruction in each instruction in functions, and replaces
|
|
/// their values.
|
|
static void extractInstrFromModule(Oracle &O, Module &Program) {
|
|
std::vector<Instruction *> InstsToDelete;
|
|
|
|
const DataLayout &DL = Program.getDataLayout();
|
|
|
|
std::vector<Instruction *> InstToDelete;
|
|
for (auto &F : Program) {
|
|
for (auto &BB : F) {
|
|
for (auto &Inst : BB) {
|
|
|
|
SimplifyQuery Q(DL, &Inst);
|
|
if (Value *Simplified = simplifyInstruction(&Inst, Q)) {
|
|
if (O.shouldKeep())
|
|
continue;
|
|
Inst.replaceAllUsesWith(Simplified);
|
|
InstToDelete.push_back(&Inst);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
for (Instruction *I : InstToDelete)
|
|
I->eraseFromParent();
|
|
}
|
|
|
|
void llvm::simplifyInstructionsDeltaPass(TestRunner &Test) {
|
|
runDeltaPass(Test, extractInstrFromModule, "Simplifying Instructions");
|
|
}
|