HomeSort by relevance Sort by last modified time
    Searched defs:BB (Results 51 - 75 of 166) sorted by null

1 23 4 5 6 7

  /external/clang/test/SemaCXX/
MicrosoftExtensions.cpp 136 class BB {
142 void BB<T>::f(int g = 0) { } // expected-warning {{redefinition of default argument}}
  /external/llvm/examples/BrainF/
BrainF.cpp 82 BasicBlock* BB = builder->GetInsertBlock();
87 ptr_arr = CallInst::CreateMalloc(BB, IntPtrTy, Int8Ty, allocsize, val_mem,
89 BB->getInstList().push_back(cast<Instruction>(ptr_arr));
  /external/llvm/examples/ParallelJIT/
ParallelJIT.cpp 45 BasicBlock *BB = BasicBlock::Create(M->getContext(), "EntryBlock", Add1F);
55 // Create the add instruction, inserting it into the end of BB.
56 Instruction *Add = BinaryOperator::CreateAdd(One, ArgX, "addresult", BB);
59 ReturnInst::Create(M->getContext(), Add, BB);
75 BasicBlock *BB = BasicBlock::Create(M->getContext(), "EntryBlock", FibF);
91 Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
92 BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
  /external/llvm/include/llvm/Analysis/
BlockFrequencyImpl.h 53 std::string getBlockName(BasicBlock *BB) const {
54 return BB->getName().str();
60 ss << "BB#" << MBB->getNumber();
62 if (const BasicBlock *BB = MBB->getBasicBlock())
63 ss << " derived from LLVM BB " << BB->getName();
68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) {
69 Freqs[BB] = Freq;
70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n");
80 /// incBlockFreq - Increase BB block frequency by FREQ
    [all...]
LoopInfoImpl.h 260 BlockT *BB = *BI;
267 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB);
275 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB);
284 if (BB == getHeader()) {
290 BlockT *EntryBB = BB->getParent()->begin();
299 assert(BB != getHeader()->getParent()->begin() &&
344 BlockT *BB = getBlocks()[i];
345 WriteAsOperand(OS, BB, false)
    [all...]
MemoryDependenceAnalysis.h 189 /// each BasicBlock (the BB entry) it keeps a MemDepResult.
191 BasicBlock *BB;
194 NonLocalDepEntry(BasicBlock *bb, MemDepResult result)
195 : BB(bb), Result(result) {}
198 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {}
200 // BB is the sort key, it can't be changed.
201 BasicBlock *getBB() const { return BB; }
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 99 MachineBasicBlock *BB;
107 /// The index in BB of RegionEnd.
172 virtual void startBlock(MachineBasicBlock *BB);
178 virtual void enterRegion(MachineBasicBlock *bb,
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 45 BlkT *BB; // Back-pointer to the corresponding block.
55 : BB(ThisBB), AvailableVal(V), DefBB(V ? this : 0), BlkNum(0), IDom(0),
75 /// BB and if so, return it. If not, construct SSA form by first
78 ValT GetValue(BlkT *BB) {
80 BBInfo *PseudoEntry = BuildBlockList(BB, &BlockList);
82 // Special case: bail out if BB is unreachable.
84 ValT V = Traits::GetUndefVal(BB, Updater);
85 (*AvailableVals)[BB] = V;
93 return BBMap[BB]->DefBB->AvailableVal;
100 BBInfo *BuildBlockList(BlkT *BB, BlockListTy *BlockList)
    [all...]
  /external/llvm/lib/Analysis/
AliasAnalysis.cpp 394 BasicBlock *BB = I->getParent();
397 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
403 !hasPath(BB, BeforeHere->getParent()))
410 BasicBlock *BB = I->getParent();
412 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
415 !hasPath(BB, BeforeHere->getParent()))
506 bool AliasAnalysis::canBasicBlockModify(const BasicBlock &BB,
508 return canInstructionRangeModify(BB.front(), BB.back(), Loc);
LoopInfo.cpp 182 BasicBlock *BB = *BI;
183 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;++I)
195 if (UserBB != BB &&
254 for (block_iterator BB = block_begin(), BE = block_end(); BB != BE; ++BB) {
255 for (BasicBlock::iterator II = (*BB)->begin(), EE = (*BB)->end();
411 Loop *getNearestLoop(BasicBlock *BB, Loop *BBLoop)
    [all...]
ProfileEstimatorPass.cpp 69 virtual void recurseBasicBlock(BasicBlock *BB);
119 void ProfileEstimatorPass::recurseBasicBlock(BasicBlock *BB) {
122 if (BBToVisit.find(BB) == BBToVisit.end()) return;
125 bool BBisHeader = LI->isLoopHeader(BB);
126 Loop* BBLoop = LI->getLoopFor(BB);
131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
134 Edge edge = getEdge(*bbi,BB);
153 if (getExecutionCount(BB) != MissingValue) {
154 BBWeight = getExecutionCount(BB);
    [all...]
ProfileVerifierPass.cpp 39 const BType *BB;
58 void printDebugInfo(const BType *BB);
93 void ProfileVerifierPassT<FType, BType>::printDebugInfo(const BType *BB) {
95 if (BBisPrinted.find(BB) != BBisPrinted.end()) return;
97 double BBWeight = PI->getExecutionCount(BB);
102 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
105 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
117 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
FunctionLoweringInfo.cpp 48 const BasicBlock *BB = I->getParent();
52 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U))
77 Function::const_iterator BB = Fn->begin(), EB = Fn->end();
78 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
102 for (; BB != EB; ++BB)
103 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
144 for (BB = Fn->begin(); BB != EB; ++BB)
    [all...]
  /external/llvm/lib/Target/Mips/
MipsLongBranch.cpp 246 const BasicBlock *BB = MBB->getBasicBlock();
248 MachineBasicBlock *LongBrMBB = MF->CreateMachineBasicBlock(BB);
255 MachineBasicBlock *BalTgtMBB = MF->CreateMachineBasicBlock(BB);
  /external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp 66 bool isTopOfStack(BasicBlock *BB);
70 void push(BasicBlock *BB, Value *Saved);
84 void closeControlFlow(BasicBlock *BB);
148 /// \brief Is BB the last block saved on the stack ?
149 bool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) {
150 return !Stack.empty() && Stack.back().first == BB;
158 /// \brief Push a BB and saved value to the control flow stack
159 void SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) {
160 Stack.push_back(std::make_pair(BB, Saved));
270 BasicBlock *BB = Term->getParent()
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
ThreadSanitizer.cpp 253 // - read-before-write (within same BB, no calls between)
260 // 'Local' is a vector of insns within the same BB (no calls between).
318 BasicBlock &BB = *FI;
319 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end();
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCContract.cpp 241 BasicBlock *BB = Release->getParent();
242 if (Load->getParent() != BB) return;
245 BasicBlock::iterator I = Load, End = BB->end();
284 BasicBlock::iterator Begin = BB->begin();
304 CallInst::Create(getStoreStrongCallee(BB->getParent()->getParent()),
489 BasicBlock *BB = PHI->getIncomingBlock(ValNo);
492 &BB->back());
497 if (PHI->getIncomingBlock(i) == BB) {
  /external/llvm/lib/Transforms/Scalar/
LoopRotation.cpp 474 BasicBlock *BB = Node->getBlock();
476 pred_iterator PI = pred_begin(BB);
478 for (pred_iterator PE = pred_end(BB); PI != PE; ++PI)
483 DT->changeImmediateDominator(BB, NearestDom);
TailRecursionElimination.cpp 102 bool FoldReturnAndProcessPred(BasicBlock *BB,
144 static bool CheckForEscapingAllocas(BasicBlock *BB,
147 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
154 if (BB != &BB->getParent()->getEntryBlock() ||
181 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
186 CheckForEscapingAllocas(BB, CannotTCETailMarkedCall)
    [all...]
  /external/llvm/lib/Transforms/Utils/
CloneFunction.cpp 37 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB,
41 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F);
42 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix);
47 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end();
68 BB != &BB->getParent()->getEntryBlock();
117 const BasicBlock &BB = *BI;
120 BasicBlock *CBB = CloneBasicBlock(&BB, VMap, NameSuffix, NewFunc, CodeInfo)
    [all...]
LowerSwitch.cpp 52 BasicBlock* BB;
54 CaseRange(Constant *low = 0, Constant *high = 0, BasicBlock *bb = 0) :
55 Low(low), High(high), BB(bb) { }
201 BasicBlock* Succ = Leaf.BB;
  /external/llvm/tools/bugpoint/
ExtractFunction.cpp 101 Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB
387 BasicBlock *BB = *I;
388 // If the BB doesn't have a name, give it one so we have something to key
390 if (!BB->hasName()) BB->setName("tmpbb");
391 BlocksToNotExtractFile.os() << BB->getParent()->getName() << " "
392 << BB->getName() << "\n";
  /external/llvm/unittests/ExecutionEngine/MCJIT/
MCJITTestBase.h 113 BasicBlock *BB = BasicBlock::Create(Context, Name, Result);
114 Builder.SetInsertPoint(BB);
  /frameworks/compile/slang/
slang_rs_backend.cpp 360 llvm::BasicBlock *BB =
362 llvm::IRBuilder<> *IB = new llvm::IRBuilder<>(BB);
  /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
TerrainPatch.java 327 VertexBuffer BB = mesh.getBuffer(Type.Binormal);
330 BufferUtils.setInBuffer(binormal, (FloatBuffer)BB.getData(), index);
333 BB.setUpdateNeeded();
    [all...]

Completed in 597 milliseconds

1 23 4 5 6 7