OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:InEdges
(Results
1 - 7
of
7
) sorted by null
/external/swiftshader/third_party/subzero/src/
IceCfgNode.h
71
const NodeList &getInEdges() const { return
InEdges
; }
92
/// Add a predecessor edge to the
InEdges
list for each of this node's
120
void addInEdge(CfgNode *In) {
InEdges
.push_back(In); }
144
NodeList
InEdges
; /// in no particular order
IceCfgNode.cpp
55
for (SizeT i = 0; i <
InEdges
.size(); ++i) {
56
if (
InEdges
[i] == Old) {
57
InEdges
[i] = New;
92
// When a node is created, the OutEdges are immediately known, but the
InEdges
94
// computePredecessors() pass finalizes it by creating the
InEdges
list.
97
Succ->
InEdges
.push_back(this);
102
InEdges
.clear();
304
NewNode->
InEdges
.push_back(Pred);
313
for (CfgNode *&I :
InEdges
) {
475
for (CfgNode *Pred :
InEdges
) {
[
all
...]
IceCfg.cpp
281
const auto &
InEdges
= Node->getInEdges();
285
for (SizeT i = 0; i <
InEdges
.size(); ++i) {
286
Phi->setLabel(i,
InEdges
[i]);
[
all
...]
WasmTranslator.cpp
334
const auto &
InEdges
= Control.toCfgNode()->getInEdges();
335
assert(Count ==
InEdges
.size());
349
Phi->addArgument(Op,
InEdges
[i]);
[
all
...]
/external/swiftshader/third_party/LLVM/lib/Analysis/
BranchProbabilityInfo.cpp
268
SmallPtrSet<BasicBlock *, 8>
InEdges
; // Edges from header to the loop.
280
InEdges
.insert(Succ);
295
if (uint32_t numInEdges =
InEdges
.size()) {
300
for (SmallPtrSet<BasicBlock *, 8>::iterator EI =
InEdges
.begin(),
301
EE =
InEdges
.end(); EI != EE; ++EI) {
/external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp
353
SmallVector<unsigned, 8>
InEdges
; // Edges from header to the loop.
361
InEdges
.push_back(I.getSuccessorIndex());
373
(
InEdges
.empty() ? 0 : LBH_TAKEN_WEIGHT) +
377
if (!
InEdges
.empty())
388
if (uint32_t numInEdges =
InEdges
.size()) {
390
for (unsigned SuccIdx :
InEdges
)
/external/llvm/lib/Transforms/Instrumentation/
PGOInstrumentation.cpp
423
DirectEdges
InEdges
;
647
DestInfo.
InEdges
.push_back(E.get());
673
Count.CountValue = sumEdgeCount(Count.
InEdges
);
685
uint64_t Total = Count.CountValue - sumEdgeCount(Count.
InEdges
);
686
setEdgeCount(Count.
InEdges
, Total);
[
all
...]
Completed in 1031 milliseconds