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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
//===- bolt/Passes/DataflowAnalysis.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
//
//===----------------------------------------------------------------------===//
//
// This file implements functions and classes used for data-flow analysis.
//
//===----------------------------------------------------------------------===//
#include "bolt/Passes/DataflowAnalysis.h"
#include "llvm/MC/MCRegisterInfo.h"
#define DEBUG_TYPE "dataflow"
namespace llvm {
raw_ostream &operator<<(raw_ostream &OS, const BitVector &State) {
LLVM_DEBUG({
OS << "BitVector(";
const char *Sep = "";
if (State.count() > (State.size() >> 1)) {
OS << "all, except: ";
BitVector BV = State;
BV.flip();
for (int I : BV.set_bits()) {
OS << Sep << I;
Sep = " ";
}
OS << ")";
return OS;
}
for (int I : State.set_bits()) {
OS << Sep << I;
Sep = " ";
}
OS << ")";
return OS;
});
OS << "BitVector";
return OS;
}
namespace bolt {
void doForAllPreds(const BinaryBasicBlock &BB,
std::function<void(ProgramPoint)> Task) {
MCPlusBuilder *MIB = BB.getFunction()->getBinaryContext().MIB.get();
for (BinaryBasicBlock *Pred : BB.predecessors()) {
if (Pred->isValid())
Task(ProgramPoint::getLastPointAt(*Pred));
}
if (!BB.isLandingPad())
return;
for (BinaryBasicBlock *Thrower : BB.throwers()) {
for (MCInst &Inst : *Thrower) {
if (!MIB->isInvoke(Inst))
continue;
const std::optional<MCPlus::MCLandingPad> EHInfo = MIB->getEHInfo(Inst);
if (!EHInfo || EHInfo->first != BB.getLabel())
continue;
Task(ProgramPoint(&Inst));
}
}
}
/// Operates on all successors of a basic block.
void doForAllSuccs(const BinaryBasicBlock &BB,
std::function<void(ProgramPoint)> Task) {
for (BinaryBasicBlock *Succ : BB.successors())
if (Succ->isValid())
Task(ProgramPoint::getFirstPointAt(*Succ));
}
void RegStatePrinter::print(raw_ostream &OS, const BitVector &State) const {
if (State.all()) {
OS << "(all)";
return;
}
if (State.count() > (State.size() >> 1)) {
OS << "all, except: ";
BitVector BV = State;
BV.flip();
for (int I : BV.set_bits())
OS << BC.MRI->getName(I) << " ";
return;
}
for (int I : State.set_bits())
OS << BC.MRI->getName(I) << " ";
}
} // namespace bolt
} // namespace llvm
|
