/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTraverse.h | 269 void enterBasicBlock(BasicBlock &BB) {} argument 270 void exitBasicBlock(BasicBlock &BB) {} argument 397 void enterBasicBlock(BasicBlock &BB) {} argument 398 void exitBasicBlock(BasicBlock &BB) {} argument 547 void printBlockLabel(StreamType & SS, BasicBlock *BB, unsigned index) { argument 548 if (!BB) { 553 SS << BB->blockID();
|
/external/clang/include/clang/Analysis/ |
H A D | CFG.h | 651 OS << "BB#" << getBlockID(); 1006 static NodeType* getEntryNode(::clang::CFGBlock *BB) argument 1007 { return BB; } 1020 static NodeType* getEntryNode(const clang::CFGBlock *BB) argument 1021 { return BB; }
|
/external/clang/lib/CodeGen/ |
H A D | CGStmt.cpp | 279 void CodeGenFunction::SimplifyForwardingBlocks(llvm::BasicBlock *BB) { argument 280 llvm::BranchInst *BI = dyn_cast<llvm::BranchInst>(BB->getTerminator()); 293 if (BI != BB->begin()) 296 BB->replaceAllUsesWith(BI->getSuccessor(0)); 298 BB->eraseFromParent(); 301 void CodeGenFunction::EmitBlock(llvm::BasicBlock *BB, bool IsFinished) { argument 305 EmitBranch(BB); 307 if (IsFinished && BB->use_empty()) { 308 delete BB; 315 CurFn->getBasicBlockList().insertAfter(CurBB, BB); [all...] |
H A D | CodeGenFunction.cpp | 187 static void EmitIfUsed(CodeGenFunction &CGF, llvm::BasicBlock *BB) { argument 188 if (!BB) return; 189 if (!BB->use_empty()) 190 return CGF.CurFn->getBasicBlockList().push_back(BB); 191 delete BB; 710 void CodeGenFunction::EmitBlockWithFallThrough(llvm::BasicBlock *BB, argument 720 EmitBlock(BB); 1271 llvm::BasicBlock *BB = getJumpDestForLabel(L).getBlock(); local 1274 IndirectBranch->addDestination(BB); 1275 return llvm::BlockAddress::get(CurFn, BB); 1640 InsertHelper(llvm::Instruction *I, const llvm::Twine &Name, llvm::BasicBlock *BB, llvm::BasicBlock::iterator InsertPt) const argument 1648 InsertHelper( llvm::Instruction *I, const llvm::Twine &Name, llvm::BasicBlock *BB, llvm::BasicBlock::iterator InsertPt) const argument [all...] |
/external/eigen/blas/testing/ |
H A D | cblat3.f | 73 $ BB( NMAX*NMAX ), BET( NBEMAX ), 288 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 294 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 300 $ AA, AS, AB( 1, NMAX + 1 ), BB, BS, CT, G, C ) 305 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 311 $ NMAX, AB, AA, AS, BB, BS, C, CC, CS, CT, G, W ) 368 $ A, AA, AS, B, BB, BS, C, CC, CS, CT, G ) 393 $ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ), 495 CALL CMAKE( 'GE', ' ', ' ', MB, NB, B, NMAX, BB, 525 BS( I ) = BB( 72 $ ALF( NALMAX ), AS( NMAX*NMAX ), variable in program:CBLAT3 392 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:CCHK1 677 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:CCHK2 956 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:CCHK3 1266 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:CCHK4 1598 $ ALF( NALF ), AS( NMAX*NMAX ), BB local in subroutine:CCHK5 [all...] |
H A D | dblat3.f | 68 $ BB( NMAX*NMAX ), BET( NBEMAX ), 280 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 286 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 292 $ AA, AS, AB( 1, NMAX + 1 ), BB, BS, CT, G, C ) 297 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 303 $ NMAX, AB, AA, AS, BB, BS, C, CC, CS, CT, G, W ) 358 $ A, AA, AS, B, BB, BS, C, CC, CS, CT, G ) 381 $ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ), 481 CALL DMAKE( 'GE', ' ', ' ', MB, NB, B, NMAX, BB, 511 BS( I ) = BB( 67 $ ALF( NALMAX ), AS( NMAX*NMAX ), variable in program:DBLAT3 380 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:DCHK1 661 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:DCHK2 931 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:DCHK3 1236 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:DCHK4 1511 $ ALF( NALF ), AS( NMAX*NMAX ), BB local in subroutine:DCHK5 [all...] |
H A D | sblat3.f | 68 $ BB( NMAX*NMAX ), BET( NBEMAX ), 280 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 286 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 292 $ AA, AS, AB( 1, NMAX + 1 ), BB, BS, CT, G, C ) 297 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 303 $ NMAX, AB, AA, AS, BB, BS, C, CC, CS, CT, G, W ) 358 $ A, AA, AS, B, BB, BS, C, CC, CS, CT, G ) 381 $ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ), 481 CALL SMAKE( 'GE', ' ', ' ', MB, NB, B, NMAX, BB, 511 BS( I ) = BB( 67 $ ALF( NALMAX ), AS( NMAX*NMAX ), variable in program:SBLAT3 380 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:SCHK1 661 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:SCHK2 931 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:SCHK3 1236 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:SCHK4 1511 $ ALF( NALF ), AS( NMAX*NMAX ), BB local in subroutine:SCHK5 [all...] |
H A D | zblat3.f | 74 $ BB( NMAX*NMAX ), BET( NBEMAX ), 289 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 295 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 301 $ AA, AS, AB( 1, NMAX + 1 ), BB, BS, CT, G, C ) 306 $ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C, 312 $ NMAX, AB, AA, AS, BB, BS, C, CC, CS, CT, G, W ) 369 $ A, AA, AS, B, BB, BS, C, CC, CS, CT, G ) 394 $ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ), 496 CALL ZMAKE( 'GE', ' ', ' ', MB, NB, B, NMAX, BB, 526 BS( I ) = BB( 73 $ ALF( NALMAX ), AS( NMAX*NMAX ), variable in program:ZBLAT3 393 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:ZCHK1 678 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:ZCHK2 958 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:ZCHK3 1268 $ AS( NMAX*NMAX ), B( NMAX, NMAX ), local in subroutine:ZCHK4 1601 $ ALF( NALF ), AS( NMAX*NMAX ), BB local in subroutine:ZCHK5 [all...] |
/external/libyuv/files/source/ |
H A D | row_common.cc | 437 #define BB UB * 128 + VB * 128 macro 453 uint32 b = Clip(static_cast<int32>((u * UB + v * VB) - (BB) + y1) >> 6); 465 *b = Clip(static_cast<int32>((u * UB + v * VB) - (BB) + y1) >> 6);
|
H A D | row_posix.cc | 1285 #define BB UB * 128 + VB * 128 macro 1307 { BB, BB, BB, BB, BB, BB, BB, BB },
|
H A D | row_win.cc | 1487 #define BB UB * 128 + VB * 128 macro 1517 static const vec16 kUVBiasB = { BB, BB, BB, BB, BB, BB, BB, BB };
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 812 // current BB. Note that we ignore the value computed by the body, but don't 974 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 975 Builder.SetInsertPoint(BB);
|
/external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
H A D | toy-jit.cpp | 839 // current BB. Note that we ignore the value computed by the body, but don't 998 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 999 Builder.SetInsertPoint(BB);
|
H A D | toy.cpp | 1203 // current BB. Note that we ignore the value computed by the body, but don't 1369 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 1370 Builder.SetInsertPoint(BB);
|
/external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
H A D | toy.cpp | 1381 // current BB. Note that we ignore the value computed by the body, but don't 1550 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 1551 Builder.SetInsertPoint(BB);
|
/external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
H A D | toy.cpp | 1061 // current BB. Note that we ignore the value computed by the body, but don't 1227 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 1228 Builder.SetInsertPoint(BB);
|
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
H A D | toy-jit.cpp | 821 // current BB. Note that we ignore the value computed by the body, but don't 980 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 981 Builder.SetInsertPoint(BB);
|
H A D | toy.cpp | 1101 // current BB. Note that we ignore the value computed by the body, but don't 1267 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction); local 1268 Builder.SetInsertPoint(BB);
|
/external/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 508 template <class BlockT> std::string getBlockName(const BlockT *BB) { argument 509 assert(BB && "Unexpected nullptr"); 510 auto MachineName = "BB" + Twine(BB->getNumber()); 511 if (BB->getBasicBlock()) 512 return (MachineName + "[" + BB->getName() + "]").str(); 516 template <> inline std::string getBlockName(const BasicBlock *BB) { argument 517 assert(BB && "Unexpected nullptr"); 518 return BB->getName().str(); 804 BlockNode getNode(const BlockT *BB) cons 1114 const BlockT *BB = BFI.RPOT[Irr.Node.Index]; local 1155 const BlockT *BB = getBlock(Node); local [all...] |
/external/llvm/lib/Bitcode/Reader/ |
H A D | BitcodeReader.cpp | 993 BasicBlock *BB = getBasicBlock(Record[0]); 994 if (!BB) 997 BB->setName(StringRef(ValueName.data(), ValueName.size())); 2836 BasicBlock *BB = getBasicBlock(Record[2+i]); local 2837 if (!V || !BB) 2839 PN->addIncoming(V, BB); 3114 // Add instruction to end of current BB. If there is no current BB, reject 3385 return "Invalid instruction with no BB";
|
/external/llvm/lib/CodeGen/ |
H A D | IfConversion.cpp | 76 ICNotClassfied, // BB data valid, but not classified. 78 ICSimple, // BB is entry of an one split, no rejoin sub-CFG. 82 ICTriangle, // BB is entry of a triangle sub-CFG. 83 ICDiamond // BB is entry of a diamond sub-CFG. 93 /// IsDone - True if BB is not to be considered for ifcvt. 94 /// IsBeingAnalyzed - True if BB is currently being analyzed. 95 /// IsAnalyzed - True if BB has been analyzed (info is still valid). 96 /// IsEnqueued - True if BB has been enqueued to be ifcvt'ed. 98 /// HasFallThrough - True if BB may fallthrough to the following BB 122 MachineBasicBlock *BB; member in struct:__anon25750::IfConverter::BBInfo 216 MeetIfcvtSizeLimit(MachineBasicBlock &BB, unsigned Cycle, unsigned Extra, const BranchProbability &Prediction) const argument 435 findFalseBlock(MachineBasicBlock *BB, MachineBasicBlock *TrueBB) argument 461 getNextBlock(MachineBasicBlock *BB) argument 757 AnalyzeBlock(MachineBasicBlock *BB, std::vector<IfcvtToken*> &Tokens) argument 913 MachineBasicBlock *BB = I; local 924 canFallThroughTo(MachineBasicBlock *BB, MachineBasicBlock *ToBB) argument 942 InvalidatePreds(MachineBasicBlock *BB) argument 955 InsertUncondBranch(MachineBasicBlock *BB, MachineBasicBlock *ToBB, const TargetInstrInfo *TII) argument [all...] |
H A D | MachineVerifier.cpp | 393 *OS << "- basic block: BB#" << MBB->getNumber() 529 *OS << "MBB is not in the predecessor list of the successor BB#" 541 *OS << "MBB is not in the successor list of the predecessor BB#" 547 const BasicBlock *BB = MBB->getBasicBlock(); local 551 BB && isa<SwitchInst>(BB->getTerminator()))) 1248 *OS << "BB#" << (*PrI)->getNumber() 1384 << ", not at the beginning of BB#" << MBB->getNumber() << '\n'; 1570 *OS << "Valno #" << VNI->id << " live into BB#" << MFI->getNumber() 1579 *OS << "Valno #" << PVNI->id << " live out of BB#" [all...] |
H A D | ScheduleDAGInstrs.cpp | 177 BB = bb; 182 BB = nullptr; 193 assert(bb == BB && "startBlock should set BB"); 214 MachineInstr *ExitMI = RegionEnd != BB->end() ? &*RegionEnd : nullptr; 239 for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(), 240 SE = BB->succ_end(); SI != SE; ++SI) 1055 void ScheduleDAGInstrs::startBlockForKills(MachineBasicBlock *BB) { argument 1060 for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(), 1061 SE = BB [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGBuilder.h | 135 MachineBasicBlock* BB; member in struct:llvm::SelectionDAGBuilder::Case 138 Case() : Low(nullptr), High(nullptr), BB(nullptr), ExtraWeight(0) { } 140 uint32_t extraweight) : Low(low), High(high), BB(bb), 152 MachineBasicBlock* BB; member in struct:llvm::SelectionDAGBuilder::CaseBits 158 Mask(mask), BB(bb), Bits(bits), ExtraWeight(Weight) { } 359 /// protector check code at the end of the BB. 371 /// protector is required/which BB we insert the stack protector check 374 /// intrinsic called llvm.stackprotectorcheck right before the BB's 378 /// b. Then when a BB with said intrinsic is processed, we codegen the BB 411 initialize(const BasicBlock *BB, MachineBasicBlock *MBB, const CallInst &StackProtCheckCall) argument [all...] |
H A D | SelectionDAGISel.cpp | 377 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 378 PHINode *PN = dyn_cast<PHINode>(BB->begin()); 386 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I) 400 GetSuccessorNumber(Pred, BB), SDISel, true); 665 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber 676 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber 690 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber 706 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumbe 1315 FindSplitPointForStackProtector(MachineBasicBlock *BB, DebugLoc DL) argument [all...] |