| /external/llvm/include/llvm-c/ |
| Object.h | 50 void LLVMDisposeSectionIterator(LLVMSectionIteratorRef SI);
52 LLVMSectionIteratorRef SI);
53 void LLVMMoveToNextSection(LLVMSectionIteratorRef SI);
59 void LLVMDisposeSymbolIterator(LLVMSymbolIteratorRef SI);
61 LLVMSymbolIteratorRef SI);
62 void LLVMMoveToNextSymbol(LLVMSymbolIteratorRef SI);
65 const char *LLVMGetSectionName(LLVMSectionIteratorRef SI);
66 uint64_t LLVMGetSectionSize(LLVMSectionIteratorRef SI);
67 const char *LLVMGetSectionContents(LLVMSectionIteratorRef SI);
68 uint64_t LLVMGetSectionAddress(LLVMSectionIteratorRef SI);
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SetOperations.h | 26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
27 SI != SE; ++SI)
28 if (S1.insert(*SI).second)
53 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end();
54 SI != SE; ++SI)
55 if (!S2.count(*SI)) // if the element is not in set2
56 Result.insert(*SI);
64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end()
[all...] |
| /external/clang/test/CodeGenCXX/ |
| 2009-06-16-DebugInfoCrash.cpp | 8 template <class SI> short ReplaceExistingElement(K2Vector<SI*>& v);
|
| /external/llvm/lib/Object/ |
| Object.cpp | 32 section_iterator SI = unwrap(ObjectFile)->begin_sections();
33 return wrap(new section_iterator(SI));
36 void LLVMDisposeSectionIterator(LLVMSectionIteratorRef SI) {
37 delete unwrap(SI);
41 LLVMSectionIteratorRef SI) {
42 return (*unwrap(SI) == unwrap(ObjectFile)->end_sections()) ? 1 : 0;
45 void LLVMMoveToNextSection(LLVMSectionIteratorRef SI) {
47 unwrap(SI)->increment(ec);
59 symbol_iterator SI = unwrap(ObjectFile)->begin_symbols();
60 return wrap(new symbol_iterator(SI));
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 127 succ_iterator SI = succ_begin(BB), E = succ_end(BB);
130 for (; SI != E && PlacedBlocks.count(*SI); ++SI)
132 if (SI == E) return; // No more successors to place.
134 double MaxExecutionCount = PI->getExecutionCount(*SI);
135 BasicBlock *MaxSuccessor = *SI;
138 for (; SI != E; ++SI)
139 if (!PlacedBlocks.count(*SI)) {
[all...] |
| SimplifyCFGPass.cpp | 68 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
69 (*SI)->removePredecessor(BB);
142 if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
144 if (SI->isVolatile()) continue;
146 Value *Ptr = SI->getOperand(1);
150 SI->getPointerAddressSpace() == 0)) {
151 changeToUnreachable(SI, true);
177 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI
[all...] |
| CorrelatedValuePropagation.cpp | 37 bool processSelect(SelectInst *SI);
41 bool processSwitch(SwitchInst *SI);
186 bool CorrelatedValuePropagation::processSwitch(SwitchInst *SI) {
187 Value *Cond = SI->getCondition();
188 BasicBlock *BB = SI->getParent();
202 for (SwitchInst::CaseIt CI = SI->case_end(), CE = SI->case_begin(); CI-- != CE;
237 SI->removeCase(CI); // Does not invalidate the iterator.
244 SI->setCondition(Case);
245 NumDeadCases += SI->getNumCases()
[all...] |
| LoopIdiomRecognize.cpp | 82 bool processLoopStore(StoreInst *SI, const SCEV *BECount);
90 bool processLoopStoreOfLoopLoad(StoreInst *SI, unsigned StoreSize,
240 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
242 if (!processLoopStore(SI, BECount)) continue;
271 bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
272 if (!SI->isSimple()) return false;
274 Value *StoredVal = SI->getValueOperand();
275 Value *StorePtr = SI->getPointerOperand();
300 dbgs() << "NEGATIVE STRIDE: " << *SI << "\n";
301 dbgs() << "BB: " << *SI->getParent()
[all...] |
| /external/llvm/lib/CodeGen/ |
| EdgeBundles.cpp | 49 for (MachineBasicBlock::const_succ_iterator SI = MBB.succ_begin(),
50 SE = MBB.succ_end(); SI != SE; ++SI)
51 EC.join(OutE, 2 * (*SI)->getNumber());
90 for (MachineBasicBlock::const_succ_iterator SI = I->succ_begin(),
91 SE = I->succ_end(); SI != SE; ++SI)
92 O << "\t\"BB#" << BB << "\" -> \"BB#" << (*SI)->getNumber()
|
| MachineBlockPlacement.cpp | 292 for (MachineBasicBlock::succ_iterator SI = (*CBI)->succ_begin(),
294 SI != SE; ++SI) {
295 if (BlockFilter && !BlockFilter->count(*SI))
297 BlockChain &SuccChain = *BlockToChain[*SI];
299 if (&Chain == &SuccChain || *SI == LoopHeaderBB)
335 for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(),
337 SI != SE; ++SI) {
338 if (BlockFilter && !BlockFilter->count(*SI))
[all...] |
| LiveIntervalUnion.cpp | 88 for (LiveSegments::const_iterator SI = Segments.begin(); SI.valid(); ++SI) {
89 OS << " [" << SI.start() << ' ' << SI.stop() << "):"
90 << PrintReg(SI.value()->reg, TRI);
98 for (SegmentIter SI = Segments.begin(); SI.valid(); ++SI)
99 VisitedVRegs.set(SI.value()->reg)
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSelect.cpp | 26 SelectInst *SI = dyn_cast<SelectInst>(V);
27 if (SI == 0) return SPF_UNKNOWN;
29 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition());
36 if (SI->getTrueValue() == ICI->getOperand(0) &&
37 SI->getFalseValue() == ICI->getOperand(1)) {
52 if (SI->getTrueValue() == ICI->getOperand(1) &&
53 SI->getFalseValue() == ICI->getOperand(0)) {
124 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
134 Type *CondTy = SI.getCondition()->getType();
143 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0)
[all...] |
| InstCombineLoadStoreAlloca.cpp | 425 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
428 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI, Align, TD) &&
429 isSafeToLoadUnconditionally(SI->getOperand(2), SI, Align, TD)) {
430 LoadInst *V1 = Builder->CreateLoad(SI->getOperand(1),
431 SI->getOperand(1)->getName()+".val");
432 LoadInst *V2 = Builder->CreateLoad(SI->getOperand(2),
433 SI->getOperand(2)->getName()+".val");
436 return SelectInst::Create(SI->getCondition(), V1, V2)
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonRemoveSZExtArgs.cpp | 60 SExtInst* SI = new SExtInst(Arg, Use->getType());
61 assert (EVT::getEVT(SI->getType()) ==
64 Use->replaceAllUsesWith(SI);
66 SI->insertBefore(First);
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerExpectIntrinsic.cpp | 45 bool HandleSwitchExpect(SwitchInst *SI);
60 bool LowerExpectIntrinsic::HandleSwitchExpect(SwitchInst *SI) {
61 CallInst *CI = dyn_cast<CallInst>(SI->getCondition());
74 SwitchInst::CaseIt Case = SI->findCaseValue(ExpectedValue);
75 unsigned n = SI->getNumCases(); // +1 for default case.
78 Weights[0] = Case == SI->case_default() ? LikelyBranchWeight
84 SI->setMetadata(LLVMContext::MD_prof,
87 SI->setCondition(ArgValue);
143 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator())) {
144 if (HandleSwitchExpect(SI))
[all...] |
| LowerSwitch.cpp | 61 void processSwitchInst(SwitchInst *SI);
67 unsigned Clusterify(CaseVector& Cases, SwitchInst *SI);
88 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
90 processSwitchInst(SI);
224 unsigned LowerSwitch::Clusterify(CaseVector& Cases, SwitchInst *SI) {
229 for (SwitchInst::CaseIt i = SI->case_begin(), e = SI->case_end();
258 void LowerSwitch::processSwitchInst(SwitchInst *SI) {
259 BasicBlock *CurBlock = SI->getParent();
262 Value *Val = SI->getCondition(); // The value we are switching on..
[all...] |
| SimplifyCFG.cpp | 90 bool SimplifySwitch(SwitchInst *SI, IRBuilder<> &Builder);
495 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
496 Cond = dyn_cast<Instruction>(SI->getCondition());
512 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
515 if (SI->getNumSuccessors()*std::distance(pred_begin(SI->getParent()),
516 pred_end(SI->getParent())) <= 128)
517 CV = SI->getCondition();
539 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
540 Cases.reserve(SI->getNumCases())
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| BitcodeWriterPass.cpp | 53 SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator());
54 if (SI == NULL) {
58 for (SwitchInst::CaseIt i = SI->case_begin(), e = SI->case_end();
68 Type *IntTy = SI->getCondition()->getType();
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| BitcodeWriterPass.cpp | 53 SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator());
54 if (SI == NULL) {
58 for (SwitchInst::CaseIt i = SI->case_begin(), e = SI->case_end();
68 Type *IntTy = SI->getCondition()->getType();
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 197 for (std::set<unsigned>::iterator SI = stateInfo.begin();
198 SI != stateInfo.end(); ++SI) {
199 unsigned thisState = *SI;
242 for (std::set<unsigned>::const_iterator SI = stateInfo.begin();
243 SI != stateInfo.end(); ++SI) {
244 if (~*SI & InsnClass)
282 DFA::StateSet::iterator SI = states.begin();
293 for (unsigned i = 0; i < states.size(); ++i, ++SI) {
[all...] |
| SequenceToOffsetTable.h | 116 for (typename SeqT::const_iterator SI = I->first.begin(),
117 SE = I->first.end(); SI != SE; ++SI) {
118 Print(OS, *SI);
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 60 for (succ_iterator SI = succ_begin(entryBlock), SE = succ_end(entryBlock);
61 SI != SE; ++SI)
62 if (isa<ReturnInst>((*SI)->getTerminator())) {
63 returnBlock = *SI;
66 nonReturnBlock = *SI;
|
| /external/clang/tools/diagtool/ |
| TreeView.cpp | 81 for (GroupRecord::subgroup_iterator SI = I->subgroup_begin(),
83 SI != SE; ++SI) {
84 NonRootGroupIDs.insert((unsigned)SI.getID());
|
| /external/llvm/lib/Analysis/ |
| Loads.cpp | 144 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
145 if (AreEquivalentAddressValues(SI->getOperand(1), V)) return true;
205 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
209 if (AreEquivalentAddressValues(SI->getOperand(1), Ptr)) {
210 if (TBAATag) *TBAATag = SI->getMetadata(LLVMContext::MD_tbaa);
211 return SI->getOperand(0);
218 (isa<AllocaInst>(SI->getOperand(1)) ||
219 isa<GlobalVariable>(SI->getOperand(1))))
225 (AA->getModRefInfo(SI, Ptr, AccessSize) & AliasAnalysis::Mod) == 0)
|
| RegionInfo.cpp | 211 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
212 if (!contains(*SI) && exit != *SI)
216 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI)
217 if (!contains(*SI))
228 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI
[all...] |
