mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
021983017a
The induction variable analysis derives from the SCC visitor CRTP-style and uses it to drive analysis to find the IVs of a function. The current definition of induction variable is very weak, but enough to use for very basic bounds-check elimination. This is not quite ready for real use. There is an assert that I've commented out that is firing but should not be, and that will require some more investigation. Swift SVN r19845
61 lines
1.8 KiB
C++
61 lines
1.8 KiB
C++
//===----- Analysis.cpp - Swift Analysis ----------------------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See http://swift.org/LICENSE.txt for license information
|
|
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#define DEBUG_TYPE "sil-analysis"
|
|
#include "swift/SILAnalysis/Analysis.h"
|
|
#include "swift/SILAnalysis/DominanceAnalysis.h"
|
|
#include "swift/SILAnalysis/IVAnalysis.h"
|
|
#include "swift/AST/Module.h"
|
|
#include "swift/AST/SILOptions.h"
|
|
#include "swift/SIL/SILModule.h"
|
|
#include "swift/SIL/SILFunction.h"
|
|
#include "llvm/ADT/Statistic.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "swift/SILPasses/Utils/Local.h"
|
|
|
|
using namespace swift;
|
|
|
|
// anchor for virtual D'tor
|
|
CompleteFunctions::~CompleteFunctions() {}
|
|
|
|
void CompleteFunctions::setComplete() {
|
|
CompleteFuncs.clear();
|
|
if (!IsModulePending)
|
|
for (auto &F : *M)
|
|
if (!PendingFuncs.count(&F))
|
|
CompleteFuncs.insert(&F);
|
|
|
|
PendingFuncs.clear();
|
|
IsModulePending = false;
|
|
}
|
|
|
|
/// \brief return a bottom-up function order.
|
|
const std::vector<SILFunction*> &CallGraphAnalysis::bottomUpCallGraphOrder() {
|
|
// If we haven't calculated the order before do it now.
|
|
if (!BottomUpFunctionOrder.size())
|
|
swift::bottomUpCallGraphOrder(M, BottomUpFunctionOrder);
|
|
|
|
return BottomUpFunctionOrder;
|
|
}
|
|
|
|
SILAnalysis *swift::createCallGraphAnalysis(SILModule *M) {
|
|
return new CallGraphAnalysis(M);
|
|
}
|
|
|
|
SILAnalysis *swift::createDominanceAnalysis(SILModule *M) {
|
|
return new DominanceAnalysis(M);
|
|
}
|
|
|
|
SILAnalysis *swift::createInductionVariableAnalysis(SILModule *M) {
|
|
return new IVAnalysis(M);
|
|
}
|