| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 47 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
48 this->entry.setPointer(BB);
52 void RegionBase<Tr>::replaceExit(BlockT *BB) {
54 exit = BB;
95 BlockT *BB = const_cast<BlockT *>(B);
97 if (!DT->getNode(BB))
106 return (DT->dominates(entry, BB) &&
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
124 for (BlockT *BB : ExitingBlocks) {
125 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 47 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
48 this->entry.setPointer(BB);
52 void RegionBase<Tr>::replaceExit(BlockT *BB) {
54 exit = BB;
95 BlockT *BB = const_cast<BlockT *>(B);
97 if (!DT->getNode(BB))
106 return (DT->dominates(entry, BB) &&
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
124 for (BlockT *BB : ExitingBlocks) {
125 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 47 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
48 this->entry.setPointer(BB);
52 void RegionBase<Tr>::replaceExit(BlockT *BB) {
54 exit = BB;
95 BlockT *BB = const_cast<BlockT *>(B);
97 if (!DT->getNode(BB))
106 return (DT->dominates(entry, BB) &&
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
124 for (BlockT *BB : ExitingBlocks) {
125 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 57 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
58 this->entry.setPointer(BB);
62 void RegionBase<Tr>::replaceExit(BlockT *BB) {
64 exit = BB;
105 BlockT *BB = const_cast<BlockT *>(B);
107 if (!DT->getNode(BB))
116 return (DT->dominates(entry, BB) &&
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
134 for (BlockT *BB : ExitingBlocks) {
135 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Scalar/ |
| GVN.h | 119 uint32_t phiTranslateImpl(const BasicBlock *BB, const BasicBlock *PhiBlock,
122 bool areAllValsInBB(uint32_t num, const BasicBlock *BB, GVN &Gvn);
134 uint32_t phiTranslate(const BasicBlock *BB, const BasicBlock *PhiBlock,
166 const BasicBlock *BB;
192 void addToLeaderTable(uint32_t N, Value *V, const BasicBlock *BB) {
196 Curr.BB = BB;
202 Node->BB = BB;
209 void removeFromLeaderTable(uint32_t N, Instruction *I, BasicBlock *BB) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Vectorize/ |
| SLPVectorizer.h | 92 void collectSeedInstructions(BasicBlock *BB);
113 bool vectorizeGEPIndices(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
117 bool vectorizeRootInstruction(PHINode *P, Value *V, BasicBlock *BB,
122 bool vectorizeInsertValueInst(InsertValueInst *IVI, BasicBlock *BB,
126 bool vectorizeInsertElementInst(InsertElementInst *IEI, BasicBlock *BB,
130 bool vectorizeCmpInst(CmpInst *CI, BasicBlock *BB, slpvectorizer::BoUpSLP &R);
135 BasicBlock *BB, slpvectorizer::BoUpSLP &R);
139 bool vectorizeChainsInBlock(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 57 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
58 this->entry.setPointer(BB);
62 void RegionBase<Tr>::replaceExit(BlockT *BB) {
64 exit = BB;
105 BlockT *BB = const_cast<BlockT *>(B);
107 if (!DT->getNode(BB))
116 return (DT->dominates(entry, BB) &&
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
134 for (BlockT *BB : ExitingBlocks) {
135 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Scalar/ |
| GVN.h | 119 uint32_t phiTranslateImpl(const BasicBlock *BB, const BasicBlock *PhiBlock,
122 bool areAllValsInBB(uint32_t num, const BasicBlock *BB, GVN &Gvn);
134 uint32_t phiTranslate(const BasicBlock *BB, const BasicBlock *PhiBlock,
166 const BasicBlock *BB;
192 void addToLeaderTable(uint32_t N, Value *V, const BasicBlock *BB) {
196 Curr.BB = BB;
202 Node->BB = BB;
209 void removeFromLeaderTable(uint32_t N, Instruction *I, BasicBlock *BB) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Vectorize/ |
| SLPVectorizer.h | 92 void collectSeedInstructions(BasicBlock *BB);
113 bool vectorizeGEPIndices(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
117 bool vectorizeRootInstruction(PHINode *P, Value *V, BasicBlock *BB,
122 bool vectorizeInsertValueInst(InsertValueInst *IVI, BasicBlock *BB,
126 bool vectorizeInsertElementInst(InsertElementInst *IEI, BasicBlock *BB,
130 bool vectorizeCmpInst(CmpInst *CI, BasicBlock *BB, slpvectorizer::BoUpSLP &R);
135 BasicBlock *BB, slpvectorizer::BoUpSLP &R);
139 bool vectorizeChainsInBlock(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 57 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
58 this->entry.setPointer(BB);
62 void RegionBase<Tr>::replaceExit(BlockT *BB) {
64 exit = BB;
105 BlockT *BB = const_cast<BlockT *>(B);
107 if (!DT->getNode(BB))
116 return (DT->dominates(entry, BB) &&
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
134 for (BlockT *BB : ExitingBlocks) {
135 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Scalar/ |
| GVN.h | 119 uint32_t phiTranslateImpl(const BasicBlock *BB, const BasicBlock *PhiBlock,
122 bool areAllValsInBB(uint32_t num, const BasicBlock *BB, GVN &Gvn);
134 uint32_t phiTranslate(const BasicBlock *BB, const BasicBlock *PhiBlock,
166 const BasicBlock *BB;
192 void addToLeaderTable(uint32_t N, Value *V, const BasicBlock *BB) {
196 Curr.BB = BB;
202 Node->BB = BB;
209 void removeFromLeaderTable(uint32_t N, Instruction *I, BasicBlock *BB) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Vectorize/ |
| SLPVectorizer.h | 92 void collectSeedInstructions(BasicBlock *BB);
113 bool vectorizeGEPIndices(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
117 bool vectorizeRootInstruction(PHINode *P, Value *V, BasicBlock *BB,
122 bool vectorizeInsertValueInst(InsertValueInst *IVI, BasicBlock *BB,
126 bool vectorizeInsertElementInst(InsertElementInst *IEI, BasicBlock *BB,
130 bool vectorizeCmpInst(CmpInst *CI, BasicBlock *BB, slpvectorizer::BoUpSLP &R);
135 BasicBlock *BB, slpvectorizer::BoUpSLP &R);
139 bool vectorizeChainsInBlock(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 57 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
58 this->entry.setPointer(BB);
62 void RegionBase<Tr>::replaceExit(BlockT *BB) {
64 exit = BB;
105 BlockT *BB = const_cast<BlockT *>(B);
107 if (!DT->getNode(BB))
116 return (DT->dominates(entry, BB) &&
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
134 for (BlockT *BB : ExitingBlocks) {
135 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Scalar/ |
| GVN.h | 119 uint32_t phiTranslateImpl(const BasicBlock *BB, const BasicBlock *PhiBlock,
122 bool areAllValsInBB(uint32_t num, const BasicBlock *BB, GVN &Gvn);
134 uint32_t phiTranslate(const BasicBlock *BB, const BasicBlock *PhiBlock,
166 const BasicBlock *BB;
192 void addToLeaderTable(uint32_t N, Value *V, const BasicBlock *BB) {
196 Curr.BB = BB;
202 Node->BB = BB;
209 void removeFromLeaderTable(uint32_t N, Instruction *I, BasicBlock *BB) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Vectorize/ |
| SLPVectorizer.h | 92 void collectSeedInstructions(BasicBlock *BB);
113 bool vectorizeGEPIndices(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
117 bool vectorizeRootInstruction(PHINode *P, Value *V, BasicBlock *BB,
122 bool vectorizeInsertValueInst(InsertValueInst *IVI, BasicBlock *BB,
126 bool vectorizeInsertElementInst(InsertElementInst *IEI, BasicBlock *BB,
130 bool vectorizeCmpInst(CmpInst *CI, BasicBlock *BB, slpvectorizer::BoUpSLP &R);
135 BasicBlock *BB, slpvectorizer::BoUpSLP &R);
139 bool vectorizeChainsInBlock(BasicBlock *BB, slpvectorizer::BoUpSLP &R);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
| RegionInfoImpl.h | 47 void RegionBase<Tr>::replaceEntry(BlockT *BB) {
48 this->entry.setPointer(BB);
52 void RegionBase<Tr>::replaceExit(BlockT *BB) {
54 exit = BB;
95 BlockT *BB = const_cast<BlockT *>(B);
97 if (!DT->getNode(BB))
106 return (DT->dominates(entry, BB) &&
107 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
124 for (BlockT *BB : ExitingBlocks) {
125 if (!contains(BB))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LoopIterator.h | 144 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
147 bool hasPostorder(BasicBlock *BB) const {
148 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
153 unsigned getPostorder(BasicBlock *BB) const {
154 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
161 unsigned getRPO(BasicBlock *BB) const {
162 return 1 + PostBlocks.size() - getPostorder(BB);
178 void finishPostorder(BasicBlock *BB);
213 bool visitPreorder(BasicBlock *BB) {
[all...] |
