mirror of
https://github.com/RPCS3/llvm.git
synced 2025-05-14 17:36:29 +00:00

to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@351636 91177308-0d34-0410-b5e6-96231b3b80d8
99 lines
3.3 KiB
C++
99 lines
3.3 KiB
C++
//===-- CGProfile.cpp -----------------------------------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Transforms/Instrumentation/CGProfile.h"
|
|
|
|
#include "llvm/ADT/MapVector.h"
|
|
#include "llvm/Analysis/BlockFrequencyInfo.h"
|
|
#include "llvm/Analysis/TargetTransformInfo.h"
|
|
#include "llvm/IR/CallSite.h"
|
|
#include "llvm/IR/Constants.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
#include "llvm/IR/MDBuilder.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
#include "llvm/ProfileData/InstrProf.h"
|
|
#include "llvm/Transforms/Instrumentation.h"
|
|
|
|
#include <array>
|
|
|
|
using namespace llvm;
|
|
|
|
PreservedAnalyses CGProfilePass::run(Module &M, ModuleAnalysisManager &MAM) {
|
|
MapVector<std::pair<Function *, Function *>, uint64_t> Counts;
|
|
FunctionAnalysisManager &FAM =
|
|
MAM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager();
|
|
InstrProfSymtab Symtab;
|
|
auto UpdateCounts = [&](TargetTransformInfo &TTI, Function *F,
|
|
Function *CalledF, uint64_t NewCount) {
|
|
if (!CalledF || !TTI.isLoweredToCall(CalledF))
|
|
return;
|
|
uint64_t &Count = Counts[std::make_pair(F, CalledF)];
|
|
Count = SaturatingAdd(Count, NewCount);
|
|
};
|
|
// Ignore error here. Indirect calls are ignored if this fails.
|
|
(void)(bool)Symtab.create(M);
|
|
for (auto &F : M) {
|
|
if (F.isDeclaration())
|
|
continue;
|
|
auto &BFI = FAM.getResult<BlockFrequencyAnalysis>(F);
|
|
if (BFI.getEntryFreq() == 0)
|
|
continue;
|
|
TargetTransformInfo &TTI = FAM.getResult<TargetIRAnalysis>(F);
|
|
for (auto &BB : F) {
|
|
Optional<uint64_t> BBCount = BFI.getBlockProfileCount(&BB);
|
|
if (!BBCount)
|
|
continue;
|
|
for (auto &I : BB) {
|
|
CallSite CS(&I);
|
|
if (!CS)
|
|
continue;
|
|
if (CS.isIndirectCall()) {
|
|
InstrProfValueData ValueData[8];
|
|
uint32_t ActualNumValueData;
|
|
uint64_t TotalC;
|
|
if (!getValueProfDataFromInst(*CS.getInstruction(),
|
|
IPVK_IndirectCallTarget, 8, ValueData,
|
|
ActualNumValueData, TotalC))
|
|
continue;
|
|
for (const auto &VD :
|
|
ArrayRef<InstrProfValueData>(ValueData, ActualNumValueData)) {
|
|
UpdateCounts(TTI, &F, Symtab.getFunction(VD.Value), VD.Count);
|
|
}
|
|
continue;
|
|
}
|
|
UpdateCounts(TTI, &F, CS.getCalledFunction(), *BBCount);
|
|
}
|
|
}
|
|
}
|
|
|
|
addModuleFlags(M, Counts);
|
|
|
|
return PreservedAnalyses::all();
|
|
}
|
|
|
|
void CGProfilePass::addModuleFlags(
|
|
Module &M,
|
|
MapVector<std::pair<Function *, Function *>, uint64_t> &Counts) const {
|
|
if (Counts.empty())
|
|
return;
|
|
|
|
LLVMContext &Context = M.getContext();
|
|
MDBuilder MDB(Context);
|
|
std::vector<Metadata *> Nodes;
|
|
|
|
for (auto E : Counts) {
|
|
Metadata *Vals[] = {ValueAsMetadata::get(E.first.first),
|
|
ValueAsMetadata::get(E.first.second),
|
|
MDB.createConstant(ConstantInt::get(
|
|
Type::getInt64Ty(Context), E.second))};
|
|
Nodes.push_back(MDNode::get(Context, Vals));
|
|
}
|
|
|
|
M.addModuleFlag(Module::Append, "CG Profile", MDNode::get(Context, Nodes));
|
|
}
|