Searched refs:begin (Results 176 - 200 of 1275) sorted by relevance

1234567891011>>

/freebsd-9.3-release/contrib/llvm/include/llvm/IR/
H A DBasicBlock.h193 inline iterator begin() { return InstList.begin(); } function in class:llvm::BasicBlock
194 inline const_iterator begin() const { return InstList.begin(); } function in class:llvm::BasicBlock
/freebsd-9.3-release/contrib/llvm/include/llvm/Object/
H A DArchive.h65 return Data.begin() == other.Data.begin();
69 return Data.begin() < other.Data.begin();
/freebsd-9.3-release/contrib/llvm/include/llvm/Support/
H A DInstIterator.h59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
61 BI = BB->begin();
94 while (BB == BBs->end() || BI == BB->begin()) {
114 BI = BB->begin();
H A DPredIteratorCache.h52 std::copy(PredCache.begin(), PredCache.end(), Entry);
H A DStringPool.h115 inline const char *begin() const { function in class:llvm::PooledStringPtr
130 inline const char *operator*() const { return begin(); }
/freebsd-9.3-release/contrib/llvm/lib/Analysis/
H A DDominanceFrontier.cpp79 for (DomTreeNode::const_iterator NI = currentNode->begin(),
99 DomSetType::const_iterator CDFI = S.begin(), CDFE = S.end();
114 for (const_iterator I = begin(), E = end(); I != E; ++I) {
124 for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
H A DIntervalPartition.cpp48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
60 for (Interval::succ_iterator I = Int->Successors.begin(),
/freebsd-9.3-release/contrib/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp39 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I) {
64 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
76 for (Module::const_iterator F = M->begin(), E = M->end(); F != E; ++F) {
82 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
83 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E;++I){
151 for (ValueMapType::const_iterator I = Map.begin(),
198 std::stable_sort(Values.begin()+CstStart, Values.begin()+CstEnd, P);
203 std::partition(Values.begin()+CstStart, Values.begin()
[all...]
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DAllocationOrder.cpp49 assert(std::find(Order.begin(), Order.end(), Hints[I]) != Order.end() &&
H A DAllocationOrder.h79 return std::find(Hints.begin(), Hints.end(), PhysReg) != Hints.end();
H A DScheduleDAG.cpp67 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
80 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),
135 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(),
275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
302 SUnit::pred_iterator BestI = Preds.begin();
309 if (BestI != Preds.begin())
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Target/PowerPC/
H A DPPCBranchSelector.cpp73 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
78 for (MachineBasicBlock::iterator MBBI = MBB->begin(), EE = MBB->end();
109 for (MachineFunction::iterator MFI = Fn.begin(), E = Fn.end(); MFI != E;
113 for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end();
/freebsd-9.3-release/contrib/llvm/lib/Transforms/IPO/
H A DInternalize.cpp80 ExternalNames.insert(APIList.begin(), APIList.end());
86 for(ArrayRef<const char *>::const_iterator itr = ExportList.begin();
146 for (SmallPtrSet<GlobalValue *, 8>::iterator I = Used.begin(), E = Used.end();
154 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
H A DStripDeadPrototypes.cpp48 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DFlattenCFGPass.cpp60 for (Function::iterator BBIt = F.begin(); BBIt != F.end();) {
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Lex/
H A DPreprocessorOptions.h148 return RemappedFiles.begin();
151 return RemappedFiles.begin();
165 return RemappedFileBuffers.begin();
168 return RemappedFileBuffers.begin();
/freebsd-9.3-release/contrib/llvm/utils/TableGen/
H A DAsmWriterEmitter.cpp73 OpsToPrint.erase(OpsToPrint.begin()+i-1);
101 Insts.erase(Insts.begin()+i-1);
130 std::reverse(OpsToPrint.begin(), OpsToPrint.end());
193 std::find(InstIdxs.begin(), InstIdxs.end(), CommandIdx);
199 getAsmWriterInstByID(NIT-InstIdxs.begin());
216 getAsmWriterInstByID(NIT-InstIdxs.begin());
243 Instrs.erase(Instrs.begin()+70, Instrs.end());
272 Str.erase(Str.begin()+i+1);
337 AWI->Operands.erase(AWI->Operands.begin());
388 Inst->Operands.erase(Inst->Operands.begin(),
[all...]
H A DAsmWriterInst.cpp153 std::string VarName(AsmString.begin()+DollarPos+1,
154 AsmString.begin()+VarEnd);
179 Modifier = std::string(AsmString.begin()+ModifierStart,
180 AsmString.begin()+VarEnd);
H A DCodeGenTarget.cpp216 std::sort(RegAltNameIndices.begin(), RegAltNameIndices.end(), LessRecord());
238 Result.insert(Result.end(), InVTs.begin(), InVTs.end());
243 array_pod_sort(Result.begin(), Result.end());
244 Result.erase(std::unique(Result.begin(), Result.end()), Result.end());
256 std::sort(LegalValueTypes.begin(), LegalValueTypes.end());
257 LegalValueTypes.erase(std::unique(LegalValueTypes.begin(),
338 I = Insts.begin(), E = Insts.end(); I != E; ++I) {
348 std::sort(InstrsByEnum.begin()+EndOfPredefines, InstrsByEnum.end(),
435 std::string(DefName.begin(), DefName.begin()
[all...]
H A DCodeGenRegisters.cpp95 for (CompMap::iterator I = Composed.begin(), E = Composed.end(); I != E; ++I)
160 RegI(Regs.begin()), RegE(Regs.end()), UnitI(), UnitE() {
163 UnitI = (*RegI)->getRegUnits().begin();
187 UnitI = (*RegI)->getRegUnits().begin();
200 std::set_union(LRU.begin(), LRU.end(), RRU.begin(), RRU.end(),
206 return std::count(RegUnits.begin(), RegUnits.end(), Unit);
213 for (SubRegMap::const_iterator I = SubRegs.begin(), E = SubRegs.end();
250 for (SubRegMap::const_iterator SI = Map.begin(), SE = Map.end(); SI != SE;
270 for (CodeGenSubRegIndex::CompMap::const_iterator I = Comps.begin(),
[all...]
/freebsd-9.3-release/sys/contrib/ngatm/netnatm/msg/
H A Dgeniec.awk35 function begin() { function
/freebsd-9.3-release/contrib/llvm/lib/Target/R600/
H A DR600OptimizeVectorRegisters.cpp147 for (DenseMap<unsigned, unsigned>::iterator It = ToMerge->RegToChan.begin(),
187 for (DenseMap<unsigned, unsigned>::iterator It = RSI->RegToChan.begin(),
201 std::find(UpdatedUndef.begin(), UpdatedUndef.end(), Chan);
204 assert(std::find(UpdatedUndef.begin(), UpdatedUndef.end(), Chan) ==
233 for (InstructionSetMap::iterator It = PreviousRegSeqByReg.begin(),
236 MIs.erase(std::find(MIs.begin(), MIs.end(), MI), MIs.end());
238 for (InstructionSetMap::iterator It = PreviousRegSeqByUndefCount.begin(),
241 MIs.erase(std::find(MIs.begin(), MIs.end(), MI), MIs.end());
308 It = RSI.RegToChan.begin(), E = RSI.RegToChan.end(); It != E; ++It) {
318 for (MachineFunction::iterator MBB = Fn.begin(), MBB
[all...]
/freebsd-9.3-release/contrib/llvm/tools/bugpoint/
H A DExtractFunction.cpp97 Module::iterator RFI = Clone->begin(); // Get iterator to corresponding fn
98 std::advance(RFI, std::distance(PF->getParent()->begin(),
101 Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB
102 std::advance(RBI, std::distance(PF->begin(), Function::const_iterator(PBB)));
104 BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst
105 std::advance(RI, std::distance(PBB->begin(), BasicBlock::const_iterator(I)));
140 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
185 Module::iterator MI = NewM->begin();
295 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
320 for (Module::iterator I = New->begin(),
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/utils/TableGen/
H A DClangSACheckersEmitter.cpp87 I = checkers.begin(), E = checkers.end(); I != E; ++I)
92 I = subGroups.begin(), E = subGroups.end(); I != E; ++I)
184 I = sortedGroups.begin(), E = sortedGroups.end(); I != E; ++I) {
203 I = sortedPackages.begin(), E = sortedPackages.end(); I != E; ++I) {
252 I = groupInfoByName.begin(), E = groupInfoByName.end(); I != E; ++I)
261 I = groupInfoByName.begin(), E = groupInfoByName.end(); I != E; ++I) {
270 I = checkers.begin(), E = checkers.end(); I != E; ++I)
274 I = sorted.begin(), E = sorted.end(); I != E; ++I)
285 I = subGroups.begin(), E = subGroups.end(); I != E; ++I)
289 I = sorted.begin(),
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Analysis/IPA/
H A DFindUsedTypes.cpp70 for (Module::iterator MI = m.begin(), ME = m.end(); MI != ME; ++MI) {
97 for (SetVector<Type *>::const_iterator I = UsedTypes.begin(),

Completed in 116 milliseconds

1234567891011>>