/external/clang/include/clang/AST/ |
H A D | DeclGroup.h | 103 iterator begin() { function in class:clang::DeclGroup 116 const_iterator begin() const { function in class:clang::DeclGroup
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 84 iterator begin() { return Blocks.rbegin(); } function in class:clang::PostOrderCFGView 87 const_iterator begin() const { return Blocks.rbegin(); } function in class:clang::PostOrderCFGView 90 bool empty() const { return begin() == end(); }
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | Environment.h | 72 iterator begin() const { return ExprBindings.begin(); } function in class:clang::ento::Environment
|
/external/clang/test/CodeGenCXX/ |
H A D | cxx0x-initializer-stdinitializerlist-pr12086.cpp | 41 const _E* begin() const {return __begin_;} function in class:std::initializer_list 47 const _E* begin() const {return __begin_;} function in class:std::initializer_list
|
H A D | cxx0x-initializer-stdinitializerlist-startend.cpp | 30 const _E* begin() const {return __begin_;} function in class:std::initializer_list
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.hpp | 49 inline bool contains (const I& begin, const I& end, const K& item) argument 51 const I it = std::find(begin, end, item); 59 std::set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), 60 std::insert_iterator<C>(ret, ret.begin())); 68 std::set_union(s1.begin(), s1.end(), s2.begin(), s2.end(), 69 std::insert_iterator<C>(ret, ret.begin()));
|
/external/deqp/modules/gles31/functional/ |
H A D | es31fTessellationTests.cpp | 93 static string elemsStr (const IterT& begin, const IterT& end, int wrapLengthParam = 0, int numIndentationSpaces = 0) argument 98 const int length = (int)std::distance(begin, end); 107 for (IterT it = begin; it != end; ++it) 109 if (it != begin) 125 return elemsStr(c.begin(), c.end(), wrapLengthParam, numIndentationSpaces); 1079 const vector<Vec3>::const_iterator first = std::lower_bound(sorted.begin(), sorted.end(), ref, vec3XLessThan); 1082 return (int)std::distance(sorted.begin(), first); 1089 std::sort(result.begin(), result.end(), pred); 1097 std::sort(result.begin(), result.end()); 1484 TriangleSet::const_iterator aIt = trianglesA.begin(); [all...] |
/external/elfutils/0.153/libdw/ |
H A D | dwarf_entry_breakpoints.c | 144 Dwarf_Addr begin; local 146 ptrdiff_t offset = INTUSE(dwarf_ranges) (die, 0, &base, &begin, &end); 152 return search_range (begin, end, true, true) ?: entrypc_bkpt (); 159 if (search_range (begin, end, true, false) < 0) 162 if (begin < lowpc) 164 lowpc = begin; 168 offset = INTUSE(dwarf_ranges) (die, offset, &base, &begin, &end);
|
H A D | dwarf_ranges.c | 58 /* Read up begin/end pair and increment read pointer. 71 Dwarf_Addr begin; local 75 bool begin_relocated = READ_AND_RELOCATE (__libdw_relocate_address, begin); 79 /* Unrelocated escape for begin means base address selection. */ 80 if (begin == escape && !begin_relocated) 94 if (begin == 0 && end == 0 && !begin_relocated && !end_relocated) 99 *beginp = begin; 189 Dwarf_Addr begin; 194 &begin, &end, basep)) 207 *startp = *basep + begin; [all...] |
/external/icu/icu4c/source/common/unicode/ |
H A D | chariter.h | 383 * This can be used to begin an iteration with next(). 402 * This can be used to begin an iteration with next32(). 422 * iteration range. This can be used to begin a forward 432 * This can be used to begin an iteration with previous(). 441 * This can be used to begin an iteration with previous32(). 449 * the last code unit or code point. This can be used to begin a backward 677 int32_t begin; member in class:CharacterIterator 703 return begin;
|
/external/lldb/source/Core/ |
H A D | VMRange.cpp | 25 pos = std::find_if( coll.begin(), end, in_range_predicate ); 37 pos = std::find_if( coll.begin(), end, in_range_predicate ); 47 VMRange::const_iterator begin = coll.begin(); local 49 VMRange::const_iterator pos = std::find_if (begin, end, in_range_predicate); 51 return std::distance (begin, pos);
|
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugRanges.cpp | 45 // Range::iterator pos = ranges.begin(); 47 // for (pos = ranges.begin(); pos != end_pos; ++pos) 63 // Range::iterator pos = ranges.begin(); 65 // for (pos = ranges.begin(); pos != end_pos; ++pos) 95 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); local 97 if (!begin && !end) 107 if (begin == 0xFFFFull) 108 begin = LLDB_INVALID_ADDRESS; 112 if (begin == 0xFFFFFFFFull) 113 begin 143 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); local [all...] |
/external/lldb/source/Symbol/ |
H A D | UnwindTable.cpp | 86 if ((pos == m_unwinds.end ()) || (pos != m_unwinds.begin() && pos->second->GetFunctionStartAddress() != addr)) 139 const_iterator begin = m_unwinds.begin(); local 141 for (const_iterator pos = begin; pos != end; ++pos) 143 s.Printf ("[%u] 0x%16.16" PRIx64 "\n", (unsigned)std::distance (begin, pos), pos->first);
|
/external/llvm/include/llvm/ADT/ |
H A D | SetVector.h | 69 iterator begin() { function in class:llvm::SetVector 70 return vector_.begin(); 74 const_iterator begin() const { function in class:llvm::SetVector 75 return vector_.begin(); 121 std::find(vector_.begin(), vector_.end(), X); 135 /// V.erase(std::remove_if(V.begin(), V.end(), P), V.end()); 145 = std::remove_if(vector_.begin(), vector_.end(),
|
/external/llvm/include/llvm/CodeGen/ |
H A D | LivePhysRegs.h | 129 const_iterator begin() const { return LiveRegs.begin(); } function in class:llvm::LivePhysRegs
|
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
|
/external/llvm/include/llvm/IR/ |
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());
|
/external/llvm/include/llvm/Support/ |
H A D | StringPool.h | 116 inline const char *begin() const { function in class:llvm::PooledStringPtr 131 inline const char *operator*() const { return begin(); }
|
/external/llvm/include/llvm/Target/ |
H A D | TargetSubtargetInfo.h | 85 MachineInstr *begin, 84 overrideSchedPolicy(MachineSchedPolicy &Policy, MachineInstr *begin, MachineInstr *end, unsigned NumRegionInstrs) const argument
|
/external/llvm/lib/DebugInfo/ |
H A D | DWARFDebugAranges.cpp | 81 std::sort(Endpoints.begin(), Endpoints.end()); 92 Aranges.emplace_back(PrevAddress, E.Address, *ValidCUs.begin()); 115 RangeCollIterator begin = Aranges.begin(); local 118 std::lower_bound(begin, end, range); 122 } else if (pos != begin) {
|
/external/llvm/lib/Object/ |
H A D | RecordStreamer.cpp | 62 RecordStreamer::const_iterator RecordStreamer::begin() { function in class:RecordStreamer 63 return Symbols.begin();
|
/external/llvm/lib/Support/ |
H A D | TargetRegistry.cpp | 22 TargetRegistry::iterator TargetRegistry::begin() { function in class:TargetRegistry 34 for (TargetRegistry::iterator it = TargetRegistry::begin(), 70 if (begin() == end()) { 76 for (iterator it = begin(), ie = end(); it != ie; ++it) { 127 for (TargetRegistry::iterator I = TargetRegistry::begin(), 133 array_pod_sort(Targets.begin(), Targets.end(), TargetArraySortFn);
|
/external/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();
|
/external/mesa3d/src/gallium/auxiliary/gallivm/ |
H A D | lp_bld_flow.h | 139 LLVMBasicBlockRef begin; member in struct:lp_build_for_loop_state
|
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | stroker.h | 38 void (*begin)(struct stroker *stroker); member in struct:stroker
|