/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | InstructionNamer.cpp | 40 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 44 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | CXXInheritance.h | 185 paths_iterator begin() { return Paths.begin(); } function in class:clang::CXXBasePaths 187 const_paths_iterator begin() const { return Paths.begin(); } function in class:clang::CXXBasePaths 282 iterator begin() { return Overrides.begin(); } function in class:clang::OverridingMethods 283 const_iterator begin() const { return Overrides.begin(); } function in class:clang::OverridingMethods
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | StmtViz.cpp | 47 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin()); 53 OutStr.insert(OutStr.begin()+i+1, 'l');
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | TinyPtrVector.h | 132 iterator begin() { function in class:llvm::TinyPtrVector 136 return Val.template get<VecTy *>()->begin(); 141 return begin() + (Val.isNull() ? 0 : 1); 146 const_iterator begin() const { function in class:llvm::TinyPtrVector 147 return (const_iterator)const_cast<TinyPtrVector*>(this)->begin(); 219 assert(I >= begin() && "Iterator to erase is out of bounds."); 224 if (I == begin()) 235 assert(S >= begin() && "Range to erase is out of bounds."); 240 if (S == begin() && S != E) 249 assert(I >= this->begin() [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
H A D | Trace.h | 91 iterator begin() { return BasicBlocks.begin(); } function in class:llvm::Trace 92 const_iterator begin() const { return BasicBlocks.begin(); } function in class:llvm::Trace
|
H A D | CallGraph.h | 114 inline iterator begin() { return FunctionMap.begin(); } function in class:llvm::CallGraph 116 inline const_iterator begin() const { return FunctionMap.begin(); } function in class:llvm::CallGraph 214 inline iterator begin() { return CalledFunctions.begin(); } function in class:llvm::CallGraphNode 216 inline const_iterator begin() const { return CalledFunctions.begin(); } function in class:llvm::CallGraphNode 321 return map_iterator(N->begin(), CGNDerefFun(CGNDeref)); 338 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | LiveStackAnalysis.h | 50 const_iterator begin() const { return S2IMap.begin(); } function in class:llvm::LiveStacks 52 iterator begin() { return S2IMap.begin(); } function in class:llvm::LiveStacks
|
H A D | GCMetadata.h | 142 /// begin/end - Iterators for safe points. 144 iterator begin() { return SafePoints.begin(); } function in class:llvm::GCFunctionInfo 150 roots_iterator roots_begin() { return Roots.begin(); } 188 /// begin/end - Iterators for used strategies. 190 iterator begin() const { return StrategyList.begin(); } function in class:llvm::GCModuleInfo
|
/freebsd-9.3-release/contrib/llvm/include/llvm/MC/ |
H A D | MCModule.h | 40 /// \brief Atoms in this module, sorted by begin address. 99 /// \name Access to the owned atom list, ordered by begin address. 108 const_atom_iterator atom_begin() const { return Atoms.begin(); } 109 atom_iterator atom_begin() { return Atoms.begin(); } 121 const_func_iterator func_begin() const { return Functions.begin(); } 122 func_iterator func_begin() { return Functions.begin(); }
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | ValueSymbolTable.cpp | 26 for (iterator VI = vmap.begin(), VE = vmap.end(); VI != VE; ++VI) 46 SmallString<256> UniqueName(V->getName().begin(), V->getName().end()); 89 SmallString<256> UniqueName(Name.begin(), Name.end()); 112 for (const_iterator I = begin(), E = end(); I != E; ++I) {
|
/freebsd-9.3-release/contrib/llvm/lib/MC/ |
H A D | MCFunction.cpp | 24 for (iterator I = begin(), E = end(); I != E; ++I) 35 for (const_iterator I = begin(), E = end(); I != E; ++I) 58 return std::find(Successors.begin(), Successors.end(), 68 return std::find(Predecessors.begin(), Predecessors.end(),
|
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | StringPool.cpp | 30 entry_t *S = entry_t::Create(Key.begin(), Key.end());
|
/freebsd-9.3-release/contrib/llvm/lib/Target/X86/ |
H A D | X86COFFMachineModuleInfo.h | 38 externals_iterator externals_begin() const { return Externals.begin(); }
|
/freebsd-9.3-release/sys/contrib/ngatm/netnatm/msg/ |
H A D | genmsgh.awk | 33 function begin() { function
|
/freebsd-9.3-release/sys/contrib/ngatm/netnatm/sig/ |
H A D | genmsgcpyc.awk | 33 function begin() { function
|
/freebsd-9.3-release/contrib/llvm/include/llvm/Support/ |
H A D | UnicodeCharRanges.h | 59 return std::binary_search(Ranges.begin(), Ranges.end(), C); 67 for (CharRanges::const_iterator I = Ranges.begin(), E = Ranges.end(); 69 if (I != Ranges.begin() && Prev >= I->Lower) {
|
H A D | GetElementPtrTypeIterator.h | 33 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { function in class:llvm::generic_gep_type_iterator 86 return gep_type_iterator::begin 93 return gep_type_iterator::begin 103 return generic_gep_type_iterator<const T *>::begin(Op0, A.begin());
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | ExpandISelPseudos.cpp | 51 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) { 53 for (MachineBasicBlock::iterator MBBI = MBB->begin(), MBBE = MBB->end(); 66 MBBI = NewMBB->begin();
|
H A D | MachineBlockPlacement.cpp | 110 iterator begin() { return Blocks.begin(); } function in class:__anon2134::BlockChain 133 assert(BB == *Chain->begin()); 134 assert(Chain->begin() != Chain->end()); 138 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end(); 149 for (iterator I = begin(), E = end(); I != E; ++I) 292 for (BlockChain::iterator CBI = Chain.begin(), CBE = Chain.end(); 311 BlockWorkList.push_back(*SuccChain.begin()); 351 if (*SI != *SuccChain.begin()) { 438 WorkList.erase(std::remove_if(WorkList.begin(), WorkLis [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 71 iterator begin() { return FunctionMap.begin(); } function in class:clang::CallGraph 73 const_iterator begin() const { return FunctionMap.begin(); } function in class:clang::CallGraph 151 inline iterator begin() { return CalledFunctions.begin(); } function in class:clang::CallGraphNode 153 inline const_iterator begin() const { return CalledFunctions.begin(); } function in class:clang::CallGraphNode 181 return map_iterator(N->begin(), CGNDerefFun(CGNDeref)); 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Frontend/ |
H A D | CreateInvocationFromCommandLine.cpp | 43 Args.insert(Args.end(), ArgList.begin(), ArgList.end()); 66 if (Jobs.size() != 1 || !isa<driver::Command>(*Jobs.begin())) { 74 const driver::Command *Cmd = cast<driver::Command>(*Jobs.begin());
|
/freebsd-9.3-release/contrib/llvm/utils/TableGen/ |
H A D | SetTheory.h | 128 void evaluate(Iter begin, Iter end, RecSet &Elts, ArrayRef<SMLoc> Loc) { argument 129 while (begin != end) 130 evaluate(*begin++, Elts, Loc);
|
/freebsd-9.3-release/contrib/llvm/lib/DebugInfo/ |
H A D | DWARFDebugLoc.cpp | 18 for (LocationLists::const_iterator I = Locations.begin(), E = Locations.end(); I != E; ++I) { 21 for (SmallVectorImpl<Entry>::const_iterator I2 = I->Entries.begin(), E2 = I->Entries.end(); I2 != E2; ++I2) { 22 if (I2 != I->Entries.begin()) 29 for (SmallVectorImpl<unsigned char>::const_iterator I3 = I2->Loc.begin(), E3 = I2->Loc.end(); I3 != E3; ++I3) { 70 std::copy(str.begin(), str.end(), std::back_inserter(E.Loc));
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | MaximumSpanningTree.h | 72 std::stable_sort(EdgeVector.begin(), EdgeVector.end(), EdgeWeightCompare()); 78 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), 87 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), 100 typename MaxSpanTree::iterator begin() { function in class:llvm::MaximumSpanningTree 101 return MST.begin();
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCAPElim.cpp | 74 for (Function::const_iterator I = Callee->begin(), E = Callee->end(); 77 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end(); 97 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) { 168 if (llvm::next(F->begin()) != F->end()) 171 Changed |= OptimizeBB(F->begin());
|