/freebsd-12-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | RangeMap.h | 175 typename Collection::iterator pos; 176 typename Collection::iterator end; 177 typename Collection::iterator prev; 232 typename Collection::iterator pos, end; 407 typename Collection::iterator pos; 408 typename Collection::iterator end; 409 typename Collection::iterator prev; 464 typename Collection::iterator pos, end; 564 void CombinePrevAndNext(typename Collection::iterator pos) { 648 typename Collection::iterator po [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 62 #include <iterator> 233 using iterator = SmallInstructionVector::iterator; 236 iterator begin() { 246 iterator end() { return Instructions.end(); } 299 DenseMap<Instruction *, int>::iterator J1I = PossibleRedIdx.find(J1); 301 DenseMap<Instruction *, int>::iterator J2I = PossibleRedIdx.find(J2); 420 UsesTy::iterator nextInstr(int Val, UsesTy &In, 422 UsesTy::iterator *StartI=nullptr); 426 UsesTy::iterator Star [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ArrayRef.h | 22 #include <iterator> 43 using iterator = const T *; 46 using reverse_iterator = std::reverse_iterator<iterator>; 146 iterator begin() const { return Data; } 147 iterator end() const { return Data + Length; } 302 using iterator = T *; 303 using reverse_iterator = std::reverse_iterator<iterator>; 340 iterator begin() const { return data(); } 341 iterator end() const { return data() + this->size(); }
|
H A D | FoldingSet.h | 19 #include "llvm/ADT/iterator.h" 410 using iterator = FoldingSetIterator<T>; 412 iterator begin() { return iterator(Buckets); } 413 iterator end() { return iterator(Buckets+NumBuckets); } 565 using iterator = pointee_iterator<typename VectorT::iterator>; 567 iterator begin() { return Vector.begin(); } 568 iterator en [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachinePipeliner.h | 271 DenseMap<SUnit *, std::pair<unsigned, int64_t>>::iterator It = 328 using iterator = SetVector<SUnit *>::const_iterator; 331 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { 341 void insert(iterator S, iterator E) { Nodes.insert(S, E); } 415 iterator begin() { return Nodes.begin(); } 416 iterator end() { return Nodes.end(); } 543 using sched_iterator = DenseMap<int, std::deque<SUnit *>>::iterator;
|
H A D | ScheduleDAG.h | 22 #include "llvm/ADT/iterator.h" 28 #include <iterator> 259 typedef SmallVectorImpl<SDep>::iterator pred_iterator; 260 typedef SmallVectorImpl<SDep>::iterator succ_iterator; 617 class SUnitIterator : public std::iterator<std::forward_iterator_tag, 676 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator; 761 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort 763 iterator begin() { return Index2Node.begin(); } 765 iterator en [all...] |
H A D | FastISel.h | 230 MachineBasicBlock::iterator LastFlushPoint; 314 void removeDeadCode(MachineBasicBlock::iterator I, 315 MachineBasicBlock::iterator E); 318 MachineBasicBlock::iterator InsertPt; 581 MachineBasicBlock::iterator LastFlushPoint); 590 MachineBasicBlock::iterator SavedInsertPt;
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/Edit/ |
H A D | EditedSource.cpp | 75 FileEditsTy::iterator FA = getActionForOffset(Offs); 151 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); 205 FileEditsTy::iterator I = FileEdits.upper_bound(BeginOffs); 222 FileEditsTy::iterator 232 FileEditsTy::iterator 418 FileEditsTy::iterator I = FileEdits.begin(); 425 for (FileEditsTy::iterator E = FileEdits.end(); I != E; ++I) { 467 EditedSource::FileEditsTy::iterator 469 FileEditsTy::iterator I = FileEdits.upper_bound(Offs);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNIterativeScheduler.cpp | 28 #include <iterator> 61 MachineBasicBlock::iterator Begin, 62 MachineBasicBlock::iterator End, 92 MachineBasicBlock::iterator Begin, 93 MachineBasicBlock::iterator End, 248 GCNIterativeScheduler::getRegionPressure(MachineBasicBlock::iterator Begin, 249 MachineBasicBlock::iterator End) 300 MachineBasicBlock::iterator Begin, 301 MachineBasicBlock::iterator End,
|
H A D | SIInsertSkips.cpp | 37 #include <iterator> 64 MachineBasicBlock::iterator I) const; 165 MachineBasicBlock::iterator Insert = SkipBB->begin(); 307 MachineBasicBlock &MBB, MachineBasicBlock::iterator I) const { 311 MachineFunction::iterator MBBI(MBB); 329 MachineBasicBlock::iterator InsPt = std::next(MI.getIterator()); 441 MachineFunction::iterator NextBB; 445 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); 462 MachineBasicBlock::iterator I, Next;
|
H A D | SILoadStoreOptimizer.cpp | 86 #include <iterator> 117 MachineBasicBlock::iterator I; 181 void setMI(MachineBasicBlock::iterator MI, const SIInstrInfo &TII, 226 MachineBasicBlock::iterator mergeRead2Pair(CombineInfo &CI, CombineInfo &Paired); 230 MachineBasicBlock::iterator mergeWrite2Pair(CombineInfo &CI, CombineInfo &Paired); 231 MachineBasicBlock::iterator mergeImagePair(CombineInfo &CI, CombineInfo &Paired); 232 MachineBasicBlock::iterator mergeSBufferLoadImmPair(CombineInfo &CI, CombineInfo &Paired); 233 MachineBasicBlock::iterator mergeBufferLoadPair(CombineInfo &CI, CombineInfo &Paired); 234 MachineBasicBlock::iterator mergeBufferStorePair(CombineInfo &CI, CombineInfo &Paired); 235 MachineBasicBlock::iterator mergeTBufferLoadPai [all...] |
H A D | SIMachineScheduler.cpp | 325 void SIScheduleBlock::initRegPressure(MachineBasicBlock::iterator BeginBlock, 326 MachineBasicBlock::iterator EndBlock) { 398 void SIScheduleBlock::schedule(MachineBasicBlock::iterator BeginBlock, 399 MachineBasicBlock::iterator EndBlock) { 502 std::vector<SUnit *>::iterator I = llvm::find(TopReadySUs, SU); 517 std::map<unsigned, unsigned>::iterator I = 626 std::map<SISchedulerBlockCreatorVariant, SIScheduleBlocks>::iterator B = 834 std::map<std::set<unsigned>, unsigned>::iterator Pos = 876 std::map<std::set<unsigned>, unsigned>::iterator Pos = 907 std::map<std::pair<unsigned, unsigned>, unsigned>::iterator Po [all...] |
H A D | AMDILCFGStructurizer.cpp | 42 #include <iterator> 197 for (MachineLoop::iterator iter = LoopInfo.begin(), 216 void reversePredicateSetter(MachineBasicBlock::iterator I, 226 MachineInstr *insertInstrBefore(MachineBasicBlock::iterator I, int NewOpcode); 227 void insertCondBranchBefore(MachineBasicBlock::iterator I, int NewOpcode, 230 MachineBasicBlock::iterator I, int NewOpcode, 329 MachineBasicBlock *DstMBB, MachineBasicBlock::iterator I); 430 MachineBasicBlock::iterator I, MachineBasicBlock &MBB) { 431 assert(I.isValid() && "Expected valid iterator"); 479 MachineBasicBlock::iterator [all...] |
H A D | R600ControlFlowFinalizer.cpp | 332 MakeFetchClause(MachineBasicBlock &MBB, MachineBasicBlock::iterator &I) 334 MachineBasicBlock::iterator ClauseHead = I; 339 for (MachineBasicBlock::iterator E = MBB.end(); I != E; ++I) { 372 std::vector<MachineOperand *>::iterator It = 394 MachineBasicBlock::iterator insertLiterals( 395 MachineBasicBlock::iterator InsertPos, 410 MakeALUClause(MachineBasicBlock &MBB, MachineBasicBlock::iterator &I) 468 void EmitFetchClause(MachineBasicBlock::iterator InsertPos, 480 void EmitALUClause(MachineBasicBlock::iterator InsertPos, const DebugLoc &DL, 516 for (MachineFunction::iterator M [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | Overload.h | 446 using iterator = ConversionSet::iterator; 448 iterator begin() { return conversions().begin(); } 449 iterator end() { return conversions().end(); } 1053 using iterator = SmallVectorImpl<OverloadCandidate>::iterator; 1055 iterator begin() { return Candidates.begin(); } 1056 iterator end() { return Candidates.end(); } 1092 OverloadCandidateSet::iterator& Best);
|
H A D | ParsedAttr.h | 751 struct iterator : llvm::iterator_adaptor_base<iterator, VecTy::iterator, 754 iterator() : iterator_adaptor_base(nullptr) {} 755 iterator(VecTy::iterator I) : iterator_adaptor_base(I) {} 770 void addAll(iterator B, iterator E) { 778 void addAllAtEnd(iterator B, iterator [all...] |
/freebsd-12-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_stats.h | 763 class iterator; 764 kmp_stats_list::iterator begin(); 765 kmp_stats_list::iterator end(); 767 class iterator { class in class:kmp_stats_list 769 friend kmp_stats_list::iterator kmp_stats_list::begin(); 770 friend kmp_stats_list::iterator kmp_stats_list::end(); 773 iterator(); 774 ~iterator(); 775 iterator operator++(); 776 iterator operato [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/XCore/ |
H A D | XCoreFrameLowering.cpp | 61 MachineBasicBlock::iterator MBBI, 71 MachineBasicBlock::iterator MBBI, 82 MachineBasicBlock::iterator MBBI, const DebugLoc &dl, 99 MachineBasicBlock::iterator MBBI, const DebugLoc &dl, 122 MachineBasicBlock::iterator MBBI, const DebugLoc &dl, 191 MachineBasicBlock::iterator MBBI, 226 MachineBasicBlock::iterator MBBI = MBB.begin(); 316 MachineBasicBlock::iterator Pos = SpillLabel.first; 346 MachineBasicBlock::iterator MBBI = MBB.getLastNonDebugInstr(); 417 MachineBasicBlock::iterator M [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/Rewrite/ |
H A D | Rewriter.cpp | 29 #include <iterator> 39 // character iterator. 79 iterator curLineStart = begin(); 81 iterator posI = begin(); 223 RewriteBuffer::iterator Start = RB.begin(); 225 RewriteBuffer::iterator End = Start; 241 std::map<FileID, RewriteBuffer>::iterator I =
|
/freebsd-12-stable/contrib/llvm-project/llvm/tools/bugpoint/ |
H A D | ExtractFunction.cpp | 92 Module::iterator RFI = Clone->begin(); // Get iterator to corresponding fn 96 Function::iterator RBI = RFI->begin(); // Get iterator to corresponding BB 99 BasicBlock::iterator RI = RBI->begin(); // Get iterator to corresponding inst 132 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) 171 Module::iterator MI = NewM->begin(); 310 for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchTree.h | 156 std::vector<GIMatchTree>::iterator children_begin() { 159 std::vector<GIMatchTree>::iterator children_end() { return Children.end(); } 160 iterator_range<std::vector<GIMatchTree>::iterator> children() { 183 LeafVector::iterator possible_leaves_begin() { 186 LeafVector::iterator possible_leaves_end() { 189 iterator_range<LeafVector::iterator> possible_leaves() {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Sparc/ |
H A D | SparcFrameLowering.cpp | 42 MachineBasicBlock::iterator MBBI, 96 MachineBasicBlock::iterator MBBI = MBB.begin(); 204 MachineBasicBlock::iterator SparcFrameLowering:: 206 MachineBasicBlock::iterator I) const { 223 MachineBasicBlock::iterator MBBI = MBB.getLastNonDebugInstr(); 353 for (MachineFunction::iterator MBB = MF.begin(), E = MF.end();
|
/freebsd-12-stable/sys/kern/ |
H A D | tty_inq.c | 447 ttyinq_line_iterator_t *iterator, void *data, 456 /* Iterate all characters and call the iterator function. */ 461 /* Call back the iterator function. */ 462 iterator(data, tib->tib_data[boff], GETBIT(tib, boff)); 473 ttyinq_line_iterator_t *iterator, void *data) 476 ttyinq_line_iterate(ti, iterator, data, 482 ttyinq_line_iterator_t *iterator, void *data) 485 ttyinq_line_iterate(ti, iterator, data, 446 ttyinq_line_iterate(struct ttyinq *ti, ttyinq_line_iterator_t *iterator, void *data, unsigned int offset, struct ttyinq_block *tib) argument 472 ttyinq_line_iterate_from_linestart(struct ttyinq *ti, ttyinq_line_iterator_t *iterator, void *data) argument 481 ttyinq_line_iterate_from_reprintpos(struct ttyinq *ti, ttyinq_line_iterator_t *iterator, void *data) argument
|
/freebsd-12-stable/usr.bin/dtc/ |
H A D | fdt.hh | 358 typedef std::vector<property_value>::iterator value_iterator; 360 * Returns an iterator referring to the first value in this property. 367 * Returns an iterator referring to the last value in this property. 448 typedef std::vector<node_ptr>::iterator child_iterator; 486 property_vector::iterator begin() { return n.property_begin(); } 487 property_vector::iterator end() { return n.property_end(); } 563 * Returns an iterator for the first child of this node. 570 * Returns an iterator after the last child of this node. 607 * Returns an iterator after the last property of this node. 609 inline property_vector::iterator property_begi [all...] |
/freebsd-12-stable/contrib/googletest/googletest/include/gtest/internal/ |
H A D | gtest-param-util-generated.h | 3592 const typename ParamGenerator<T1>::iterator& current1, 3594 const typename ParamGenerator<T2>::iterator& current2) 3622 // iterator is of the same type and we can downcast. 3654 // We must report iterator past the end of the range when either of the 3666 // current[i]_ is the actual traversing iterator. 3667 const typename ParamGenerator<T1>::iterator begin1_; 3668 const typename ParamGenerator<T1>::iterator end1_; 3669 typename ParamGenerator<T1>::iterator current1_; 3670 const typename ParamGenerator<T2>::iterator begin2_; 3671 const typename ParamGenerator<T2>::iterator end2 [all...] |