| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 56 BasicBlock* BB;
59 BasicBlock *bb = nullptr) :
68 BasicBlock *switchConvert(CaseItr Begin, CaseItr End,
70 Value *Val, BasicBlock *OrigBlock,
71 BasicBlock *Default);
72 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
73 BasicBlock *Default);
105 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks
139 BasicBlock *LowerSwitch::switchConvert(CaseItr Begin, CaseItr End
[all...] |
| BasicBlockUtils.cpp | 1 //===-- BasicBlockUtils.cpp - BasicBlock Utilities -------------------------==//
36 void llvm::DeleteDeadBlock(BasicBlock *BB) {
68 void llvm::FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P) {
98 bool llvm::DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI) {
102 for (BasicBlock::iterator I = BB->begin();
116 bool llvm::MergeBlockIntoPredecessor(BasicBlock *BB, Pass *P) {
121 BasicBlock *PredBB = BB->getUniquePredecessor();
130 BasicBlock *OnlySucc = BB;
141 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; ++BI) {
199 void llvm::ReplaceInstWithValue(BasicBlock::InstListType &BIL
[all...] |
| CloneFunction.cpp | 38 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB,
42 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F);
48 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end();
121 const BasicBlock &BB = *BI;
124 BasicBlock *CBB = CloneBasicBlock(&BB, VMap, NameSuffix, NewFunc, CodeInfo);
137 const_cast<BasicBlock*>(&BB));
148 for (Function::iterator BB = cast<BasicBlock>(VMap[OldFunc->begin()]),
151 for (BasicBlock::iterator II = BB->begin(); II != BB->end(); ++II
[all...] |
| BreakCriticalEdges.cpp | 92 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
93 BasicBlock *SplitBB,
94 BasicBlock *DestBB) {
100 for (BasicBlock::iterator I = DestBB->begin();
141 BasicBlock *llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
150 BasicBlock *TIBB = TI->getParent();
151 BasicBlock *DestBB = TI->getSuccessor(SuccNum);
158 BasicBlock *NewBB = BasicBlock::Create(TI->getContext(),
176 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I)
[all...] |
| LCSSA.cpp | 51 static bool isExitBlock(BasicBlock *BB,
52 const SmallVectorImpl<BasicBlock *> &ExitBlocks) {
63 const SmallVectorImpl<BasicBlock *> &ExitBlocks,
67 BasicBlock *InstBB = Inst.getParent();
71 BasicBlock *UserBB = User->getParent();
90 BasicBlock *DomBB = Inst.getParent();
103 for (SmallVectorImpl<BasicBlock *>::const_iterator BBI = ExitBlocks.begin(),
106 BasicBlock *ExitBB = *BBI;
118 for (BasicBlock **PI = PredCache.GetPreds(ExitBB); *PI; ++PI) {
144 BasicBlock *UserBB = User->getParent()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 67 delete reinterpret_cast<BasicBlock *>(BBs.get());
70 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn)
85 BasicBlock::~BasicBlock()
90 BasicBlock *
91 BasicBlock::clone(ClonePolicy<Function>& pol) const
93 BasicBlock *bb = new BasicBlock(pol.context());
103 BasicBlock *obb = BasicBlock::get(it.getNode())
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 67 delete reinterpret_cast<BasicBlock *>(BBs.get());
70 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn)
85 BasicBlock::~BasicBlock()
90 BasicBlock *
91 BasicBlock::clone(ClonePolicy<Function>& pol) const
93 BasicBlock *bb = new BasicBlock(pol.context());
103 BasicBlock *obb = BasicBlock::get(it.getNode())
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 19 import com.android.dx.rop.code.BasicBlock;
62 BasicBlock b = blocks.get(bindex);
76 BasicBlock iBlock = blocks.labelToBlock(iLabel);
90 BasicBlock jBlock = blocks.labelToBlock(jLabel);
123 private static boolean compareInsns(BasicBlock a, BasicBlock b) {
140 BasicBlock bb = blocks.labelToBlock(betaLabel);
145 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j));
153 * an updated BasicBlock instance and places it in {@code newBlocks}.
159 private void replaceSucc(BasicBlock block, int oldLabel, int newLabel)
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 19 import com.android.dx.rop.code.BasicBlock;
67 BasicBlock b = blocks.get(bindex);
81 BasicBlock iBlock = blocks.labelToBlock(iLabel);
95 BasicBlock jBlock = blocks.labelToBlock(jLabel);
128 private static boolean compareInsns(BasicBlock a, BasicBlock b) {
145 BasicBlock bb = blocks.labelToBlock(betaLabel);
150 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j));
158 * an updated BasicBlock instance and places it in {@code newBlocks}.
164 private void replaceSucc(BasicBlock block, int oldLabel, int newLabel)
[all...] |
| /external/llvm/lib/Analysis/ |
| DominanceFrontier.cpp | 26 DFCalculateWorkObject(BasicBlock *B, BasicBlock *P,
30 BasicBlock *currentBB;
31 BasicBlock *parentBB;
42 BasicBlock *BB = Node->getBlock();
46 SmallPtrSet<BasicBlock *, 32> visited;
53 BasicBlock *currentBB = currentW->currentBB;
54 BasicBlock *parentBB = currentW->parentBB;
81 BasicBlock *childBB = IDominee->getBlock();
121 const std::set<BasicBlock*> &BBs = I->second
[all...] |
| RegionInfo.cpp | 54 Region::Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RInfo,
69 void Region::replaceEntry(BasicBlock *BB) {
73 void Region::replaceExit(BasicBlock *BB) {
78 void Region::replaceEntryRecursive(BasicBlock *NewEntry) {
80 BasicBlock *OldEntry = getEntry();
94 void Region::replaceExitRecursive(BasicBlock *NewExit) {
96 BasicBlock *OldExit = getExit();
110 bool Region::contains(const BasicBlock *B) const {
111 BasicBlock *BB = const_cast<BasicBlock*>(B)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 55 bool isLoopDead(Loop *L, SmallVectorImpl<BasicBlock *> &exitingBlocks,
56 SmallVectorImpl<BasicBlock *> &exitBlocks,
57 bool &Changed, BasicBlock *Preheader);
81 SmallVectorImpl<BasicBlock *> &exitingBlocks,
82 SmallVectorImpl<BasicBlock *> &exitBlocks,
83 bool &Changed, BasicBlock *Preheader) {
84 BasicBlock *exitBlock = exitBlocks[0];
91 BasicBlock::iterator BI = exitBlock->begin();
117 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
139 BasicBlock *preheader = L->getLoopPreheader()
[all...] |
| /art/compiler/dex/portable/ |
| mir_to_gbc.h | 21 #include <llvm/IR/BasicBlock.h>
37 struct BasicBlock;
86 ::llvm::BasicBlock* GetLLVMBlock(int id);
93 ::llvm::BasicBlock* FindCaseTarget(uint32_t vaddr);
94 void ConvertPackedSwitch(BasicBlock* bb, int32_t table_offset,
96 void ConvertSparseSwitch(BasicBlock* bb, int32_t table_offset,
117 void ConvertCompareAndBranch(BasicBlock* bb, MIR* mir, ConditionCode cc,
119 void ConvertCompareZeroAndBranch(BasicBlock* bb, MIR* mir, ConditionCode cc,
135 void ConvertInvoke(BasicBlock* bb, MIR* mir, InvokeType invoke_type,
168 bool ConvertMIRNode(MIR* mir, BasicBlock* bb, ::llvm::BasicBlock* llvm_bb)
[all...] |
| /external/llvm/include/llvm/IR/ |
| Function.h | 24 #include "llvm/IR/BasicBlock.h"
35 template<> struct ilist_traits<BasicBlock>
36 : public SymbolTableListTraits<BasicBlock, Function> {
40 BasicBlock *createSentinel() const {
41 return static_cast<BasicBlock*>(&Sentinel);
43 static void destroySentinel(BasicBlock*) {}
45 BasicBlock *provideInitialHead() const { return createSentinel(); }
46 BasicBlock *ensureHead(BasicBlock*) const { return createSentinel(); }
47 static void noteHead(BasicBlock*, BasicBlock*) {
[all...] |
| /external/llvm/unittests/Bitcode/ |
| BitReaderTest.cpp | 33 BasicBlock* Entry = BasicBlock::Create(Mod->getContext(), "entry", Func);
36 BasicBlock* BB = BasicBlock::Create(Mod->getContext(), "bb", Func);
|
| /external/llvm/unittests/IR/ |
| VerifierTest.cpp | 29 BasicBlock *Entry = BasicBlock::Create(C, "entry", F);
30 BasicBlock *Exit = BasicBlock::Create(C, "exit", F);
|
| /external/llvm/unittests/Transforms/Utils/ |
| Local.cpp | 11 #include "llvm/IR/BasicBlock.h"
25 BasicBlock *bb0 = BasicBlock::Create(C);
26 BasicBlock *bb1 = BasicBlock::Create(C);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| Local.h | 26 class BasicBlock;
57 bool ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions = false,
90 bool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = nullptr,
97 /// RemovePredecessorAndSimplify - Like BasicBlock::removePredecessor, this
108 void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
116 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = nullptr);
123 bool TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB);
130 bool EliminateDuplicatePHINodes(BasicBlock *BB);
138 bool SimplifyCFG(BasicBlock *BB, const TargetTransformInfo &TTI
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| BlockAddresses.java | 19 import com.android.dexgen.rop.code.BasicBlock;
66 public CodeAddress getStart(BasicBlock block) {
86 public CodeAddress getLast(BasicBlock block) {
108 public CodeAddress getEnd(BasicBlock block) {
131 BasicBlock one = blocks.get(i);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| BlockAddresses.java | 19 import com.android.dx.rop.code.BasicBlock;
66 public CodeAddress getStart(BasicBlock block) {
86 public CodeAddress getLast(BasicBlock block) {
108 public CodeAddress getEnd(BasicBlock block) {
131 BasicBlock one = blocks.get(i);
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| BlockAddresses.java | 19 import com.android.dx.rop.code.BasicBlock;
66 public CodeAddress getStart(BasicBlock block) {
86 public CodeAddress getLast(BasicBlock block) {
108 public CodeAddress getEnd(BasicBlock block) {
131 BasicBlock one = blocks.get(i);
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlockList.java | 26 * List of {@link BasicBlock} instances.
66 public BasicBlock get(int n) {
67 return (BasicBlock) get0(n);
76 public void set(int n, BasicBlock bb) {
86 * instance's instructions (indirectly through {@link BasicBlock}
112 BasicBlock one = (BasicBlock) getOrNull0(i);
132 BasicBlock one = (BasicBlock) getOrNull0(i);
158 public BasicBlock labelToBlock(int label)
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlockList.java | 26 * List of {@link BasicBlock} instances.
66 public BasicBlock get(int n) {
67 return (BasicBlock) get0(n);
76 public void set(int n, BasicBlock bb) {
86 * instance's instructions (indirectly through {@link BasicBlock}
112 BasicBlock one = (BasicBlock) getOrNull0(i);
132 BasicBlock one = (BasicBlock) getOrNull0(i);
157 public BasicBlock labelToBlock(int label)
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| BasicBlockList.java | 26 * List of {@link BasicBlock} instances.
66 public BasicBlock get(int n) {
67 return (BasicBlock) get0(n);
76 public void set(int n, BasicBlock bb) {
86 * instance's instructions (indirectly through {@link BasicBlock}
112 BasicBlock one = (BasicBlock) getOrNull0(i);
132 BasicBlock one = (BasicBlock) getOrNull0(i);
157 public BasicBlock labelToBlock(int label)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| MemoryDependenceAnalysis.h | 21 #include "llvm/IR/BasicBlock.h"
188 /// each BasicBlock (the BB entry) it keeps a MemDepResult.
190 BasicBlock *BB;
193 NonLocalDepEntry(BasicBlock *bb, MemDepResult result)
197 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {}
200 BasicBlock *getBB() const { return BB; }
212 /// For each BasicBlock (the BB entry) it keeps a MemDepResult and the
218 NonLocalDepResult(BasicBlock *bb, MemDepResult result, Value *address)
222 BasicBlock *getBB() const { return Entry.getBB(); }
272 typedef PointerIntPair<BasicBlock*, 1, bool> BBSkipFirstBlockPair
[all...] |
