OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:succ_size
(Results
1 - 25
of
61
) sorted by relevancy
1
2
3
/src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDILCFGStructurizer.cpp
248
/// return true iff src1Blk->
succ_size
() == 0 && src1Blk and src2Blk are in
369
while (SrcMBB && SrcMBB->
succ_size
() == 1) {
376
if (SrcMBB && SrcMBB->
succ_size
()==0)
541
assert(MBB->
succ_size
() == 2);
620
bool IsReturn = (MBB->
succ_size
() == 0);
717
assert(MBB->
succ_size
() <= 2);
811
if (EntryMBB->
succ_size
() == 0) {
899
if (MBB->
succ_size
() != 1)
913
if (MBB->
succ_size
() != 2)
935
if (TrueMBB->
succ_size
() == 1 && FalseMBB->succ_size() ==
[
all
...]
SIOptimizeExecMaskingPreRA.cpp
397
if (Pred->
succ_size
() == 1)
SILowerControlFlow.cpp
440
if (B->
succ_size
() != 1)
740
assert(MBB.
succ_size
() == 1 && "MBB has more than one successor");
/src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonCFGOptimizer.cpp
158
unsigned NumSuccs = MBB->
succ_size
();
200
JumpAroundTarget->
succ_size
() == 1;
HexagonEarlyIfConv.cpp
231
if (B->
succ_size
() != 1)
287
unsigned TNS = TB->
succ_size
(), FNS = FB->
succ_size
();
367
if (B->
succ_size
() == 0)
573
if (FP.TrueB && FP.TrueB->
succ_size
() > 0) {
578
if (FP.FalseB && FP.FalseB->
succ_size
() > 0) {
880
while (FP.SplitB->
succ_size
() > 0) {
973
while (B->
succ_size
() > 0)
1034
if (FP.SplitB->
succ_size
() != 1)
/src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp
89
if (node->pred_size() != 1 || node->
succ_size
() != 1)
93
if (pred->
succ_size
() != 1)
159
assert(node->pred_size() == 1 || node->
succ_size
() == 1);
286
return pred_size() == 1 &&
succ_size
() == 1 &&
288
getFirstPred()->
succ_size
() == 1;
CoreEngine.cpp
88
assert(Entry->
succ_size
() == 1 && "Entry block must have 1 successor.");
364
assert(B->
succ_size
() == 1);
412
assert(B->
succ_size
() == 1 &&
426
assert(B->
succ_size
() == 2);
438
assert(B->
succ_size
() == 2);
449
assert(B->
succ_size
() == 2);
LoopUnrolling.cpp
244
if (N->
succ_size
() > 1)
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineBlockPlacement.cpp
735
if (BB.
succ_size
() != Successors.size())
755
if (BB->
succ_size
() == 1)
938
if (BB->
succ_size
() != 2 || ViableSuccs.size() != 2)
1188
if (Succ->
succ_size
() == 0)
1212
if ((NumDup > Succ->
succ_size
()) || !Duplicate)
1264
if (BB.
succ_size
() != 2)
1351
if (BB->
succ_size
() == 2) {
1882
if (Pred->
succ_size
() != 2)
2065
<< Pred->
succ_size
() << " successors, ";
2067
if (Pred->
succ_size
() > 2
[
all
...]
TailDuplicator.cpp
682
if (TailBB->
succ_size
() != 1)
703
if (PredBB->
succ_size
() > 1)
779
assert(PredBB->
succ_size
() <= 1);
799
if (PredBB->
succ_size
() > 1)
919
// This has to check PrevBB->
succ_size
() because EH edges are ignored by
921
if (PrevBB->
succ_size
() == 1 &&
1001
if (PredBB->
succ_size
() != 1)
BranchFolding.cpp
583
(!AfterPlacement || MBB1->
succ_size
() == 1)) {
614
if (MBB->
succ_size
() != 0 && !MBB->canFallThrough())
631
(MBB1->
succ_size
() == 1 || !AfterPlacement) &&
740
const BasicBlock *BB = (SuccBB && MBB->
succ_size
() == 1) ?
1146
SmallVector<BlockFrequency, 2> EdgeFreqLs(TailMBB.
succ_size
());
1159
if (TailMBB.
succ_size
() <= 1)
1171
if (TailMBB.
succ_size
() <= 1)
1308
if (PredBB->
succ_size
() == 1)
1408
// This has to check PrevBB->
succ_size
() because EH edges are ignored by
1411
PrevBB.
succ_size
() == 1 &
[
all
...]
EarlyIfConversion.cpp
438
if (Head->
succ_size
() != 2)
447
if (Succ0->pred_size() != 1 || Succ0->
succ_size
() != 1)
455
if (Succ1->pred_size() != 1 || Succ1->
succ_size
() != 1 ||
MIRPrinter.cpp
599
if (MBB.
succ_size
() <= 1)
627
if (GuessedSuccs.size() != MBB.
succ_size
())
/src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineRegionInfo.h
45
return BB->
succ_size
();
/src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h
293
DstOrSplit->pred_size() == 1 && DstOrSplit->
succ_size
() == 1 &&
305
return Src.
succ_size
() > 1 && DstOrSplit->pred_size() > 1;
/src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h
199
unsigned
succ_size
() const { return Succs.size(); }
function in class:clang::ento::ExplodedNode
521
return N->
succ_size
() == 1 && N->getFirstSucc()->isTrivial();
/src/external/apache2/llvm/dist/llvm/include/llvm/IR/
CFG.h
259
inline unsigned
succ_size
(const Instruction *I) {
function in namespace:llvm
284
inline unsigned
succ_size
(const BasicBlock *BB) {
function in namespace:llvm
/src/external/apache2/llvm/dist/clang/lib/Analysis/
UninitializedValues.cpp
563
SuccsVisited[block->getBlockID()] = block->
succ_size
();
625
if (++SV == Pred->
succ_size
())
637
if (SuccsVisited[BlockID] && SuccsVisited[BlockID] < Block->
succ_size
() &&
645
if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->
succ_size
() &&
ReachableCode.cpp
118
assert(Current->
succ_size
() == 2);
120
} else if (!Current->getTerminatorStmt() && Current->
succ_size
() == 1) {
Consumed.cpp
70
if (Block->
succ_size
() == 1 && *Block->succ_begin())
91
if (Block->
succ_size
() == 1 && *Block->succ_begin())
1380
if (CurrBlock->
succ_size
() > 1 ||
1381
(CurrBlock->
succ_size
() == 1 &&
CalledOnceCheck.cpp
556
assert(Parent->
succ_size
() == 2 &&
947
assert(Parent->
succ_size
() >= 2 &&
/src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ConditionalCompares.cpp
442
if (Head->
succ_size
() != 2)
452
if (Succ0->pred_size() != 1 || Succ0->
succ_size
() != 2)
AArch64RedundantCopyElimination.cpp
287
if (PredMBB->
succ_size
() != 2)
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
BranchProbabilityInfo.cpp
885
assert(SuccWeights.size() ==
succ_size
(BB) && "Missed successor?");
1144
return {1, static_cast<uint32_t>(
succ_size
(Src))};
1159
return BranchProbability(llvm::count(successors(Src), Dst),
succ_size
(Src));
/src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCBranchCoalescing.cpp
289
if (Cand.BranchBlock->
succ_size
() != 2) {
Completed in 93 milliseconds
1
2
3
Indexes created Fri Jun 19 00:25:02 UTC 2026