| /external/llvm/lib/CodeGen/ |
| IfConversion.cpp | 138 /// BBI - Corresponding BBInfo.
149 BBInfo &BBI;
155 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {}
198 bool ReverseBranchCondition(BBInfo &BBI);
206 void ScanInstructions(BBInfo &BBI);
209 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
214 void RemoveExtraEdges(BBInfo &BBI);
215 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
216 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
217 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind
[all...] |
| LiveVariables.cpp | 712 for (const auto &BBI : MBB) {
713 if (!BBI.isPHI())
715 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
716 if (BBI.getOperand(i).readsReg())
717 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()]
718 .push_back(BBI.getOperand(i).getReg());
772 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end();
773 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
[all...] |
| PHIElimination.cpp | 538 for (const auto &BBI : MBB) {
539 if (!BBI.isPHI())
541 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
542 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(),
543 BBI.getOperand(i).getReg())];
557 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
558 BBI != BBE && BBI->isPHI(); ++BBI) {
559 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| IfConversion.cpp | 128 /// BBI - Corresponding BBInfo.
139 BBInfo &BBI;
145 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {}
175 bool ReverseBranchCondition(BBInfo &BBI);
183 void ScanInstructions(BBInfo &BBI);
186 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
190 void RemoveExtraEdges(BBInfo &BBI);
191 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
192 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
193 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind
[all...] |
| StrongPHIElimination.cpp | 242 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
243 BBI != BBE && BBI->isPHI(); ++BBI) {
244 unsigned DestReg = BBI->getOperand(0).getReg();
246 PHISrcDefs[I].push_back(BBI);
248 for (unsigned i = 1; i < BBI->getNumOperands(); i += 2) {
249 MachineOperand &SrcMO = BBI->getOperand(i);
275 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
276 BBI != BBE && BBI->isPHI(); ++BBI)
[all...] |
| PHIElimination.cpp | 398 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
399 BBI != BBE && BBI->isPHI(); ++BBI)
400 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
401 ++VRegPHIUseCount[BBVRegPair(BBI->getOperand(i+1).getMBB()->getNumber(),
402 BBI->getOperand(i).getReg())];
413 for (MachineBasicBlock::const_iterator BBI = MBB.begin(), BBE = MBB.end();
414 BBI != BBE && BBI->isPHI(); ++BBI)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
132 bbi != bbe; ++bbi ) {
134 Edge edge = getEdge(*bbi,BB);
136 if (ProcessedPreds.insert(*bbi).second) {
142 if (BBisHeader && BBLoop->contains(*bbi)) {
263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
266 if (bbi == bbe) {
271 for ( ; bbi != bbe; ++bbi ) {
[all...] |
| ProfileVerifierPass.cpp | 101 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
102 bbi != bbe; ++bbi ) {
103 if (ProcessedPreds.insert(*bbi).second) {
104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
116 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
117 bbi != bbe; ++bbi ) {
118 if (ProcessedSuccs.insert(*bbi).second) {
119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi);
262 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
[all...] |
| Loads.cpp | 130 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
132 while (BBI != E) {
133 --BBI;
137 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
138 !isa<DbgInfoIntrinsic>(BBI))
141 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
143 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
| ProfileInfoLoaderPass.cpp | 117 for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
118 bbi != bbe; ++bbi) {
119 recurseBasicBlock(*bbi);
121 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
122 bbi != bbe; ++bbi) {
123 recurseBasicBlock(*bbi);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 173 BasicBlock::iterator BBI = &LI;
174 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6))
408 BasicBlock::iterator BBI = &SI;
409 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
411 --BBI;
414 if (isa<DbgInfoIntrinsic>(BBI) ||
415 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) {
420 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
425 ++BBI;
[all...] |
| /external/llvm/unittests/Analysis/ |
| UnrollAnalyzer.cpp | 102 BasicBlock::iterator BBI = Header->begin();
103 std::advance(BBI, 4);
104 Instruction *Y1 = &*BBI++;
105 Instruction *Y2 = &*BBI++;
165 BasicBlock::iterator BBI = Header->begin();
166 BBI++;
167 Instruction *Y1 = &*BBI;
168 BBI = InnerBody->begin();
169 BBI++;
170 Instruction *Y2 = &*BBI;
[all...] |
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 37 BasicBlock::iterator BBI = BB0->begin();
38 Instruction *Y1 = &*BBI++;
39 Instruction *Y2 = &*BBI++;
40 Instruction *Y3 = &*BBI++;
43 BBI = BB1->begin();
44 Instruction *Y4 = &*BBI++;
47 BBI = BB2->begin();
48 Instruction *Y5 = &*BBI++;
51 BBI = BB3->begin();
52 Instruction *Y6 = &*BBI++
[all...] |
| PassManagerTest.cpp | 35 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI)
36 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 82 BasicBlock::iterator BBI = I, BBE = BB->end();
83 while (BBI != BBE) {
84 if (!BBI->use_empty())
85 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType()));
86 BB->getInstList().erase(BBI++);
124 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){
125 if (CallInst *CI = dyn_cast<CallInst>(BBI)) {
[all...] |
| DeadStoreElimination.cpp | 427 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
428 Instruction *Inst = BBI++;
456 // DeleteDeadInstruction can delete the current instruction. Save BBI
458 WeakVH NextInst(BBI);
463 BBI = BB.begin();
464 else if (BBI != BB.begin()) // Revisit this instruction if possible.
465 --BBI;
508 // cases, reset BBI.
509 BBI = Inst
[all...] |
| TailRecursionElimination.cpp | 309 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) {
310 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator());
371 BasicBlock::iterator BBI = TI;
373 CI = dyn_cast<CallInst>(BBI);
377 if (BBI == BB->begin())
379 --BBI;
432 BasicBlock::iterator BBI = CI;
433 for (++BBI; &*BBI != Ret; ++BBI)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 68 deleteDeadInstruction(Instruction *I, BasicBlock::iterator *BBI,
78 BasicBlock::iterator NewIter = *BBI;
110 *BBI = NewIter;
616 BasicBlock::iterator BBI(Dependency);
617 deleteDeadInstruction(Dependency, &BBI, *MD, *TLI);
626 Dep = MD->getPointerDependencyFrom(Loc, false, BBI, BB);
700 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){
701 --BBI;
704 if (hasMemoryWrite(&*BBI, *TLI) && isRemovable(&*BBI))
[all...] |
| TailRecursionElimination.cpp | 396 for (BasicBlock &BBI : *F) {
397 ReturnInst *RI = dyn_cast<ReturnInst>(BBI.getTerminator());
456 BasicBlock::iterator BBI(TI);
458 CI = dyn_cast<CallInst>(BBI);
462 if (BBI == BB->begin())
464 --BBI;
517 BasicBlock::iterator BBI(CI);
518 for (++BBI; &*BBI != Ret; ++BBI) {
[all...] |
| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 457 bool solveBlockValueBinaryOp(LVILatticeVal &BBLV, Instruction *BBI,
459 bool solveBlockValueCast(LVILatticeVal &BBLV, Instruction *BBI,
462 Instruction *BBI);
607 static LVILatticeVal getFromRangeMetadata(Instruction *BBI) {
608 switch (BBI->getOpcode()) {
613 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range))
614 if (isa<IntegerType>(BBI->getType())) {
642 Instruction *BBI = dyn_cast<Instruction>(Val);
643 if (!BBI || BBI->getParent() != BB)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LCSSA.cpp | 137 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end();
138 BBI != E; ++BBI) {
139 BasicBlock *BB = *BBI;
217 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(),
218 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) {
219 BasicBlock *ExitBB = *BBI;
|
| /packages/apps/Dialer/java/com/android/dialer/calllog/ui/res/values-hu/ |
| strings.xml | 23 <string name="new_call_log_header_older" msgid="5879512250610285872">"Korábbi"</string>
|
| /packages/apps/Launcher3/quickstep/res/values-hu/ |
| strings.xml | 28 <string name="accessibility_recent_apps" msgid="4058661986695117371">"Legutóbbi alkalmazások"</string>
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 820 BasicBlock::iterator BBI(LI);
824 FindAvailableLoadedValue(&LI, LI.getParent(), BBI,
[all...] |
| /external/llvm/include/llvm/Transforms/Scalar/ |
| MemCpyOptimizer.h | 51 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
52 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
|
