Searched refs:begin (Results 151 - 175 of 2269) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_libignore.h60 uptr begin; member in struct:__sanitizer::LibIgnore::LibCodeRange
65 return (pc >= range.begin && pc < range.end);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DDebugCrossExSubsection.h39 Iterator begin() const { return References.begin(); } function in class:llvm::codeview::final
H A DDebugCrossImpSubsection.h62 Iterator begin() const { return References.begin(); } function in class:llvm::codeview::final
H A DDebugFrameDataSubsection.h31 FixedStreamArray<FrameData>::Iterator begin() const { return Frames.begin(); } function in class:llvm::codeview::final
H A DDebugStringTableSubsection.h78 StringMap<uint32_t>::const_iterator begin() const { function in class:llvm::codeview::DebugStringTableSubsection
79 return StringToId.begin();
H A DDebugSymbolRVASubsection.h36 ArrayType::Iterator begin() const { return RVAs.begin(); } function in class:llvm::codeview::final
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/
H A DThreadCollection.cpp37 std::upper_bound(m_threads.begin(), m_threads.end(), thread_sp,
49 m_threads.insert(m_threads.begin() + idx, thread_sp);
H A DThreadPlanStepUntil.cpp91 for (pos = m_until_points.begin(); pos != end; pos++) {
110 (uint64_t)(*m_until_points.begin()).first,
111 (*m_until_points.begin()).second);
116 for (pos = m_until_points.begin(); pos != end; pos++) {
138 for (pos = m_until_points.begin(); pos != end; pos++) {
196 for (pos = m_until_points.begin(); pos != end; pos++) {
291 for (pos = m_until_points.begin(); pos != end; pos++) {
314 for (pos = m_until_points.begin(); pos != end; pos++) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A Diterator_range.h9 /// This provides a very simple, boring adaptor for a begin and end iterator
39 //TODO: Consider ADL/non-member begin/end calls.
40 : begin_iterator(c.begin()), end_iterator(c.end()) {}
45 IteratorT begin() const { return begin_iterator; } function in class:llvm::iterator_range
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/
H A DEnvironment.cpp20 Next = std::copy(Key.begin(), Key.end(), Next);
22 Next = std::copy(Value.begin(), Value.end(), Next);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFContext.h139 return unit_iterator_range(NormalUnits.begin(),
140 NormalUnits.begin() +
148 NormalUnits.begin() + NormalUnits.getNumInfoUnits(), NormalUnits.end());
160 return unit_iterator_range(NormalUnits.begin(), NormalUnits.end());
166 return unit_iterator_range(DWOUnits.begin(),
167 DWOUnits.begin() + DWOUnits.getNumInfoUnits());
173 return unit_iterator_range(DWOUnits.begin() + DWOUnits.getNumInfoUnits(),
186 return unit_iterator_range(DWOUnits.begin(), DWOUnits.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DRandomNumberGenerator.cpp47 llvm::copy(Salt, Data.begin() + 2);
49 std::seed_seq SeedSeq(Data.begin(), Data.end());
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DAnalysisManager.cpp53 for (PathDiagnosticConsumers::iterator I = PathConsumers.begin(),
61 for (PathDiagnosticConsumers::iterator I = PathConsumers.begin(),
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/
H A DModuleFile.cpp35 if (Map.begin() == Map.end())
41 for (typename MapType::const_iterator I = Map.begin(), IEnd = Map.end();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/Stages/
H A DInstructionTables.cpp34 Masks.begin(), std::find(Masks.begin(), Masks.end(), Resource.first));
H A DEntryStage.cpp66 NumRetired = std::distance(Instructions.begin(), It);
69 Instructions.erase(Instructions.begin(), It);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreFrameToArgsOffsetElim.cpp51 for (MachineFunction::iterator MFI = MF.begin(), E = MF.end(); MFI != E;
54 for (MachineBasicBlock::iterator MBBI = MBB.begin(), EE = MBB.end();
/freebsd-11-stable/contrib/llvm-project/lld/ELF/
H A DScriptLexer.cpp92 StringRef begin = s; local
107 size_t lineno = begin.substr(0, s.data() - begin.data()).count('\n');
140 tokens.insert(tokens.begin() + pos, vec.begin(), vec.end());
227 tokens.erase(tokens.begin() + pos);
228 tokens.insert(tokens.begin() + pos, v.begin(), v.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
77 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
93 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
122 std::vector<SUnit *>::iterator Best = Queue.begin();
123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()),
H A DLiveIntervalUnion.cpp35 LiveRange::const_iterator RegPos = Range.begin();
62 LiveRange::const_iterator RegPos = Range.begin();
87 for (LiveSegments::const_iterator SI = Segments.begin(); SI.valid(); ++SI) {
97 for (SegmentIter SI = Segments.begin(); SI.valid(); ++SI)
134 LRI = LR->begin();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsAnalyzeImmediate.cpp28 for (InstSeqLs::iterator Iter = SeqLs.begin(); Iter != SeqLs.end(); ++Iter)
78 SeqLs.append(std::make_move_iterator(SeqLsORi.begin()),
106 Seq.erase(Seq.begin() + 1);
114 for (InstSeqLs::iterator S = SeqLs.begin(); S != SeqLs.end(); ++S) {
125 Insts.append(ShortestSeq->begin(), ShortestSeq->end());
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DGetElementPtrTypeIterator.h43 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { function
129 return gep_type_iterator::begin(
140 return gep_type_iterator::begin(
152 return generic_gep_type_iterator<const T *>::begin(Op0, A.begin());
/freebsd-11-stable/contrib/llvm-project/llvm/tools/bugpoint/
H A DListReducer.h95 std::shuffle(ShuffledList.begin(), ShuffledList.end(), randomness);
120 std::vector<ElTy> Prefix(TheList.begin(), TheList.begin() + Mid);
121 std::vector<ElTy> Suffix(TheList.begin() + Mid, TheList.end());
184 TestList.erase(TestList.begin() + i);
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/
H A DUnwindTable.cpp127 (pos != m_unwinds.begin() &&
165 const_iterator begin = m_unwinds.begin(); local
167 for (const_iterator pos = begin; pos != end; ++pos) {
168 s.Printf("[%u] 0x%16.16" PRIx64 "\n", (unsigned)std::distance(begin, pos),
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DUnresolvedSet.h83 iterator begin() { return iterator(decls().begin()); } function in class:clang::UnresolvedSetImpl
86 const_iterator begin() const { return const_iterator(decls().begin()); } function in class:clang::UnresolvedSetImpl
103 for (DeclsTy::iterator I = decls().begin(), E = decls().end(); I != E; ++I)

Completed in 238 milliseconds

1234567891011>>