|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 155 -> decltype(begin(std::forward<ContainerTy>(container))) {
163 -> decltype(end(std::forward<ContainerTy>(container))) {
179 -> decltype(adl_detail::adl_begin(std::forward<ContainerTy>(container))) {
185 -> decltype(adl_detail::adl_end(std::forward<ContainerTy>(container))) {
include/llvm/Analysis/RegionInfoImpl.h 588 for (typename DST::iterator SI = entrySuccs->begin(),
include/llvm/CodeGen/RegAllocPBQP.h 434 NodeSet::iterator NItr = OptimallyReducibleNodes.begin();
456 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin();
462 NodeSet::iterator NItr =
lib/CodeGen/LiveInterval.cpp 309 CalcLiveRangeUtilBase<CalcLiveRangeUtilSet, LiveRange::SegmentSet::iterator,
lib/CodeGen/RegAllocPBQP.cpp 346 IntervalSet::iterator RetireItr = Active.begin();
lib/Support/DAGDeltaAlgorithm.cpp 60 typedef std::set<change_ty>::iterator pred_closure_iterator_ty;
61 typedef std::set<change_ty>::iterator succ_closure_iterator_ty;
lib/Target/AMDGPU/SIMachineScheduler.cpp 1473 std::set<unsigned>::iterator RegPos = PredOutRegs.find(Reg);
1537 std::set<unsigned>::iterator RegPos = PredOutRegs.find(Reg);
1704 std::set<unsigned>::iterator Pos = LiveRegs.find(Reg);
lib/Target/Hexagon/HexagonCommonGEP.cpp 474 for (NodeSymRel::iterator I = Rel.begin(), E = Rel.end(); I != E; ++I)
506 NodePairSet::iterator FEq = Eq.find(NP);
509 NodePairSet::iterator FNe = Ne.find(NP);
554 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
564 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
571 std::pair<NodeSymRel::iterator, bool> Ins = EqRel.insert(C);
599 for (NodeSymRel::iterator I = EqRel.begin(), E = EqRel.end(); I != E; ++I) {
609 for (NodeSet::iterator J = S.begin(), F = S.end(); J != F; ++J) {
1012 for (NodeSet::iterator I = Ns.begin(), E = Ns.end(); I != E; ++I) {
lib/Target/Hexagon/HexagonGenPredicate.cpp 508 for (SetOfReg::iterator I = PredGPRs.begin(), E = PredGPRs.end(); I != E; ++I)
lib/Target/Hexagon/HexagonHardwareLoops.cpp 1746 for (RegisterInductionSet::iterator I = IndRegs.begin(), E = IndRegs.end();
lib/Target/Hexagon/HexagonSplitDouble.cpp 299 for (USet::iterator J = Asc.begin(), F = Asc.end(); J != F; ++J)
lib/Target/Hexagon/MCTargetDesc/HexagonMCChecker.h 52 using SoftDefsIterator = std::set<unsigned>::iterator;
56 using TmpDefsIterator = std::set<unsigned>::iterator;
60 using NewPredsIterator = std::set<unsigned>::iterator;
68 using UsesIterator = std::set<unsigned>::iterator;
72 using ReadOnlyIterator = std::set<unsigned>::iterator;
lib/Transforms/IPO/ArgumentPromotion.cpp 450 for (ScalarizeTable::iterator It = ArgIndices.begin();
517 std::set<IndicesVector>::iterator Low;
536 std::set<IndicesVector>::iterator Low;
557 std::set<IndicesVector>::iterator End = Safe.end();
559 std::set<IndicesVector>::iterator Remove = Low;
lib/Transforms/IPO/MergeFunctions.cpp 297 DenseMap<AssertingVH<Function>, FnTreeType::iterator> FNodesInTree;
873 FnTreeType::iterator IterToFNInFnTree = I->second;
903 std::pair<FnTreeType::iterator, bool> Result =
tools/lldb/source/Commands/CommandCompletions.cpp 472 collection::iterator pos = m_match_set.begin(), end = m_match_set.end();
tools/lldb/source/Commands/CommandObjectThread.cpp 225 std::set<UniqueStack>::iterator matching_stack =
tools/lldb/source/Interpreter/Options.cpp 90 OptionSet::iterator pos_union;
tools/lldb/source/Utility/Broadcaster.cpp 410 listener_collection::iterator iter = m_listeners.begin(),
462 listener_collection::iterator end_iter = m_listeners.end();
464 for (listener_collection::iterator iter = m_listeners.begin();
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
58 begin(const _Container& __cont) -> decltype(__cont.begin())
68 end(_Container& __cont) -> decltype(__cont.end())
78 end(const _Container& __cont) -> decltype(__cont.end())
usr/include/c++/7.4.0/bits/stl_iterator.h 647 typename _Container::iterator iter;
657 insert_iterator(_Container& __x, typename _Container::iterator __i)
usr/include/c++/7.4.0/bits/stl_set.h 333 iterator
342 iterator
370 iterator
379 iterator
451 std::pair<iterator, bool>
477 iterator
498 std::pair<iterator, bool>
507 std::pair<iterator, bool>
535 iterator
540 iterator
643 iterator
695 iterator
764 iterator
776 -> decltype(iterator{_M_t._M_find_tr(__x)})
776 -> decltype(iterator{_M_t._M_find_tr(__x)})
799 iterator
811 -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
811 -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
829 iterator
841 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
841 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
847 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
847 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
868 std::pair<iterator, iterator>
868 std::pair<iterator, iterator>
880 -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
880 -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
886 -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
886 -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
utils/unittest/googlemock/include/gmock/gmock-matchers.h 3361 typedef decltype(std::begin(
3471 typedef decltype(std::begin(
utils/unittest/googletest/include/gtest/internal/gtest-internal.h 933 typename C::iterator* /* it */ = NULL,