| /minix3/external/bsd/bind/dist/lib/dns/ |
| H A D | dbiterator.c | 46 dns_dbiterator_first(dns_dbiterator_t *iterator) { in dns_dbiterator_first() argument 51 REQUIRE(DNS_DBITERATOR_VALID(iterator)); in dns_dbiterator_first() 53 return (iterator->methods->first(iterator)); in dns_dbiterator_first() 57 dns_dbiterator_last(dns_dbiterator_t *iterator) { in dns_dbiterator_last() argument 62 REQUIRE(DNS_DBITERATOR_VALID(iterator)); in dns_dbiterator_last() 64 return (iterator->methods->last(iterator)); in dns_dbiterator_last() 68 dns_dbiterator_seek(dns_dbiterator_t *iterator, dns_name_t *name) { in dns_dbiterator_seek() argument 73 REQUIRE(DNS_DBITERATOR_VALID(iterator)); in dns_dbiterator_seek() 75 return (iterator->methods->seek(iterator, name)); in dns_dbiterator_seek() 79 dns_dbiterator_prev(dns_dbiterator_t *iterator) { in dns_dbiterator_prev() argument [all …]
|
| H A D | rdatasetiter.c | 48 dns_rdatasetiter_first(dns_rdatasetiter_t *iterator) { in dns_rdatasetiter_first() argument 53 REQUIRE(DNS_RDATASETITER_VALID(iterator)); in dns_rdatasetiter_first() 55 return (iterator->methods->first(iterator)); in dns_rdatasetiter_first() 59 dns_rdatasetiter_next(dns_rdatasetiter_t *iterator) { in dns_rdatasetiter_next() argument 64 REQUIRE(DNS_RDATASETITER_VALID(iterator)); in dns_rdatasetiter_next() 66 return (iterator->methods->next(iterator)); in dns_rdatasetiter_next() 70 dns_rdatasetiter_current(dns_rdatasetiter_t *iterator, in dns_rdatasetiter_current() argument 77 REQUIRE(DNS_RDATASETITER_VALID(iterator)); in dns_rdatasetiter_current() 81 iterator->methods->current(iterator, rdataset); in dns_rdatasetiter_current()
|
| /minix3/crypto/external/bsd/openssl/dist/crypto/engine/ |
| H A D | eng_list.c | 89 ENGINE *iterator = engine_list_head; in engine_list_cleanup() local 91 while (iterator != NULL) { in engine_list_cleanup() 92 ENGINE_remove(iterator); in engine_list_cleanup() 93 iterator = engine_list_head; in engine_list_cleanup() 105 ENGINE *iterator = NULL; in engine_list_add() local 111 iterator = engine_list_head; in engine_list_add() 112 while (iterator && !conflict) { in engine_list_add() 113 conflict = (strcmp(iterator->id, e->id) == 0); in engine_list_add() 114 iterator = iterator->next; in engine_list_add() 154 ENGINE *iterator; in engine_list_remove() local [all …]
|
| /minix3/external/bsd/bind/dist/lib/dns/include/dns/ |
| H A D | dbiterator.h | 79 isc_result_t (*first)(dns_dbiterator_t *iterator); 80 isc_result_t (*last)(dns_dbiterator_t *iterator); 81 isc_result_t (*seek)(dns_dbiterator_t *iterator, dns_name_t *name); 82 isc_result_t (*prev)(dns_dbiterator_t *iterator); 83 isc_result_t (*next)(dns_dbiterator_t *iterator); 84 isc_result_t (*current)(dns_dbiterator_t *iterator, 86 isc_result_t (*pause)(dns_dbiterator_t *iterator); 87 isc_result_t (*origin)(dns_dbiterator_t *iterator, 129 dns_dbiterator_first(dns_dbiterator_t *iterator); 144 dns_dbiterator_last(dns_dbiterator_t *iterator); [all …]
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/Lex/ |
| H A D | PreprocessingRecord.h | 382 class iterator { 406 iterator() : Self(nullptr), Position(0) { } in iterator() function 408 iterator(PreprocessingRecord *Self, int Position) in iterator() function 423 iterator &operator++() { 428 iterator operator++(int) { 429 iterator Prev(*this); 434 iterator &operator--() { 439 iterator operator--(int) { 440 iterator Prev(*this); 445 friend bool operator==(const iterator &X, const iterator &Y) { [all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/Analysis/inlining/ |
| H A D | containers.cpp | 113 struct iterator { struct in MySet 116 iterator(int *p) : impl(p) {} in iterator() function 119 iterator begin() { in begin() 124 return iterator(storage); in begin() 127 iterator end() { in end() 132 return iterator(storage+size); in end() 162 void useIterator(iterator i) { in useIterator() 174 MySet::iterator impl; 177 IterImpl(MySet::iterator i) : impl(i) { in IterImpl() 214 typedef MySet::iterator iterator; typedef in IteratorTypedefOnlySet [all …]
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86FixupLEAs.cpp | 40 bool processBasicBlock(MachineFunction &MF, MachineFunction::iterator MFI); 49 void seekLEAFixup(MachineOperand &p, MachineBasicBlock::iterator &I, 50 MachineFunction::iterator MFI); 56 void processInstruction(MachineBasicBlock::iterator &I, 57 MachineFunction::iterator MFI); 61 void processInstructionForSLM(MachineBasicBlock::iterator &I, 62 MachineFunction::iterator MFI); 66 RegUsageState usesRegister(MachineOperand &p, MachineBasicBlock::iterator I); 71 MachineBasicBlock::iterator searchBackwards(MachineOperand &p, 72 MachineBasicBlock::iterator &I, [all …]
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/Sema/ |
| H A D | IdentifierResolver.h | 45 inline DeclsTy::iterator decls_begin() { return Decls.begin(); } in decls_begin() 46 inline DeclsTy::iterator decls_end() { return Decls.end(); } in decls_end() 55 void InsertDecl(DeclsTy::iterator Pos, NamedDecl *D) { in InsertDecl() 68 class iterator { 83 typedef IdDeclInfo::DeclsTy::iterator BaseIter; 86 iterator(NamedDecl *D) { in iterator() function 92 iterator(BaseIter I) { in iterator() function 107 iterator() : Ptr(0) {} in iterator() function 116 bool operator==(const iterator &RHS) const { 119 bool operator!=(const iterator &RHS) const { [all …]
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/AST/ |
| H A D | ExternalASTSource.h | 481 class iterator { 507 iterator() : Self(0), Position(0) { } 509 iterator(LazyVector *Self, int Position) 529 iterator &operator++() { 534 iterator operator++(int) { 535 iterator Prev(*this); 540 iterator &operator--() { 545 iterator operator--(int) { 546 iterator Prev(*this); 551 friend bool operator==(const iterator &X, const iterator &Y) { [all …]
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/Mips/ |
| H A D | MipsSEInstrInfo.h | 47 MachineBasicBlock::iterator MI, DebugLoc DL, 52 MachineBasicBlock::iterator MI, 59 MachineBasicBlock::iterator MI, 65 bool expandPostRAPseudo(MachineBasicBlock::iterator MI) const override; 71 MachineBasicBlock::iterator I) const; 77 MachineBasicBlock::iterator II, DebugLoc DL, 83 void expandRetRA(MachineBasicBlock &MBB, MachineBasicBlock::iterator I) const; 88 void expandPseudoMFHiLo(MachineBasicBlock &MBB, MachineBasicBlock::iterator I, 91 void expandPseudoMTLoHi(MachineBasicBlock &MBB, MachineBasicBlock::iterator I, 105 void expandCvtFPInt(MachineBasicBlock &MBB, MachineBasicBlock::iterator I, [all …]
|
| H A D | Mips16InstrInfo.h | 47 MachineBasicBlock::iterator MI, DebugLoc DL, 52 MachineBasicBlock::iterator MBBI, 59 MachineBasicBlock::iterator MBBI, 65 bool expandPostRAPseudo(MachineBasicBlock::iterator MI) const override; 71 MachineBasicBlock::iterator I) const; 75 MachineBasicBlock::iterator I) const; 80 MachineBasicBlock::iterator I) const; 88 MachineBasicBlock::iterator II, DebugLoc DL, 104 (MachineBasicBlock &MBB, MachineBasicBlock::iterator I, int64_t Imm) const; 111 void ExpandRetRA16(MachineBasicBlock &MBB, MachineBasicBlock::iterator I, [all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/Analysis/ |
| H A D | cxx-for-range.cpp | 25 using iterator = int *; typedef in MagicVector 27 iterator begin() const; 28 iterator end() const; 56 class iterator { class in MagicVector2 59 iterator &operator++(); 60 bool operator==(const iterator &); 61 bool operator!=(const iterator &); 64 iterator begin() const; 65 iterator end() const;
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| H A D | erase_iter_iter.invalidation.pass.cpp | 25 typename C::iterator first = c.begin(); in del_at_start() 26 typename C::iterator last = first + num; in del_at_start() 27 typename C::iterator it1 = last; in del_at_start() 28 typename C::iterator it2 = c.end() - 1; in del_at_start() 32 typename C::iterator it3 = c.begin(); in del_at_start() 33 typename C::iterator it4 = c.end() - 1; in del_at_start() 45 typename C::iterator last = c.end(); in del_at_end() 46 typename C::iterator first = last - num; in del_at_end() 47 typename C::iterator it1 = c.begin(); in del_at_end() 48 typename C::iterator it2 = first - 1; in del_at_end() [all …]
|
| H A D | erase_iter.invalidation.pass.cpp | 23 typename C::iterator first = c.begin(); in del_at_start() 24 typename C::iterator it1 = first + 1; in del_at_start() 25 typename C::iterator it2 = c.end() - 1; in del_at_start() 29 typename C::iterator it3 = c.begin(); in del_at_start() 30 typename C::iterator it4 = c.end() - 1; in del_at_start() 42 typename C::iterator first = c.end() - 1; in del_at_end() 43 typename C::iterator it1 = c.begin(); in del_at_end() 44 typename C::iterator it2 = first - 1; in del_at_end() 48 typename C::iterator it3 = c.begin(); in del_at_end() 49 typename C::iterator it4 = c.end() - 1; in del_at_end()
|
| /minix3/external/bsd/llvm/dist/clang/test/Parser/ |
| H A D | cxx0x-for-range.cpp | 8 typedef pair<T,U> *iterator; typedef 9 iterator begin(); 10 iterator end(); 34 struct iterator { struct 36 iterator &operator++(); 37 iterator &operator++(int); 38 bool operator==(const iterator &) const; 40 iterator begin(); 41 iterator end();
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | SparseMultiSet.h | 218 class iterator_base : public std::iterator<std::bidirectional_iterator_tag, 247 typedef std::iterator<std::bidirectional_iterator_tag, ValueT> super; 307 typedef iterator_base<SparseMultiSet *> iterator; typedef 311 typedef std::pair<iterator, iterator> RangePair; 315 iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); } in end() 350 iterator findIndex(unsigned Idx) { in findIndex() 358 return iterator(this, i, Idx); in findIndex() 371 iterator find(const KeyT &Key) { in find() 376 iterator I = const_cast<SparseMultiSet*>(this)->findIndex(KeyIndexOf(Key)); in find() 396 iterator getHead(const KeyT &Key) { return find(Key); } in getHead() [all …]
|
| H A D | ImmutableMap.h | 206 class iterator { 207 typename TreeTy::iterator itr; 209 iterator() {} in iterator() function 210 iterator(TreeTy* t) : itr(t) {} in iterator() function 217 typedef typename iterator::value_type *pointer; 220 typename iterator::reference operator*() const { return itr->getValue(); } 221 typename iterator::pointer operator->() const { return &itr->getValue(); } 226 iterator& operator++() { ++itr; return *this; } 227 iterator operator++(int) { iterator tmp(*this); ++itr; return tmp; } 228 iterator& operator--() { --itr; return *this; } [all …]
|
| H A D | ilist.h | 146 : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> { 150 typedef std::iterator<std::bidirectional_iterator_tag, 344 typedef ilist_iterator<NodeTy> iterator; 349 typedef std::reverse_iterator<iterator> reverse_iterator; 359 iterator begin() { 361 return iterator(Head); 367 iterator end() { 369 return iterator(getTail()); 412 iterator insert(iterator where, NodeTy *New) { 428 iterator insertAfter(iterator where, NodeTy *New) { [all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 116 class iterator 117 : public iterator_adaptor_base<iterator, NodeVectorImplT::iterator, 123 NodeVectorImplT::iterator E; 126 iterator(LazyCallGraph &G, NodeVectorImplT::iterator NI, in iterator() function 127 NodeVectorImplT::iterator E) in iterator() 134 iterator() {} in iterator() function 137 iterator &operator++() { 189 typedef LazyCallGraph::iterator iterator; typedef 195 iterator begin() const { in begin() 196 return iterator(*G, Callees.begin(), Callees.end()); in begin() [all …]
|
| H A D | DominanceFrontier.h | 71 typedef typename DomSetMapType::iterator iterator; typedef 73 iterator begin() { return Frontiers.begin(); } in begin() 75 iterator end() { return Frontiers.end(); } in end() 77 iterator find(BlockT *B) { return Frontiers.find(B); } in find() 80 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) { in addBasicBlock() 88 void addToFrontier(iterator I, BlockT *Node); 90 void removeFromFrontier(iterator I, BlockT *Node); 143 typedef DominanceFrontierBase<BasicBlock>::iterator iterator; typedef 160 iterator begin() { return Base.begin(); } in begin() 164 iterator end() { return Base.end(); } in end() [all …]
|
| H A D | Trace.h | 86 typedef BasicBlockListType::iterator iterator; typedef 89 typedef std::reverse_iterator<iterator> reverse_iterator; 91 iterator begin() { return BasicBlocks.begin(); } in begin() 93 iterator end () { return BasicBlocks.end(); } in end() 104 iterator erase(iterator q) { return BasicBlocks.erase (q); } in erase() 105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } in erase()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/Sparc/ |
| H A D | DelaySlotFiller.cpp | 65 for (MachineFunction::iterator FI = F.begin(), FE = F.end(); in runOnMachineFunction() 71 void insertCallDefsUses(MachineBasicBlock::iterator MI, 75 void insertDefsUses(MachineBasicBlock::iterator MI, 82 bool delayHasHazard(MachineBasicBlock::iterator candidate, 87 MachineBasicBlock::iterator 88 findDelayInstr(MachineBasicBlock &MBB, MachineBasicBlock::iterator slot); 90 bool needsUnimp(MachineBasicBlock::iterator I, unsigned &StructSize); 93 MachineBasicBlock::iterator MBBI); 115 for (MachineBasicBlock::iterator I = MBB.begin(); I != MBB.end(); ) { in runOnMachineBasicBlock() 116 MachineBasicBlock::iterator MI = I; in runOnMachineBasicBlock() [all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | GCMetadata.h | 86 typedef std::vector<GCPoint>::iterator iterator; typedef 87 typedef std::vector<GCRoot>::iterator roots_iterator; 145 iterator begin() { return SafePoints.begin(); } in begin() 146 iterator end() { return SafePoints.end(); } in end() 157 live_iterator live_begin(const iterator &p) { return roots_begin(); } in live_begin() 158 live_iterator live_end (const iterator &p) { return roots_end(); } in live_end() 159 size_t live_size(const iterator &p) const { return roots_size(); } in live_size() 179 FuncInfoVec::iterator funcinfo_begin() { return Functions.begin(); } in funcinfo_begin() 180 FuncInfoVec::iterator funcinfo_end() { return Functions.end(); } in funcinfo_end() 193 typedef list_type::const_iterator iterator; typedef [all …]
|
| H A D | MachineBasicBlock.h | 78 typedef std::vector<uint32_t>::iterator weight_iterator; 145 : public std::iterator<std::bidirectional_iterator_tag, Ty, ptrdiff_t> { 205 typedef Instructions::iterator instr_iterator; 212 bundle_iterator<MachineInstr,instr_iterator> iterator; 216 typedef std::reverse_iterator<iterator> reverse_iterator; 241 iterator begin() { return instr_begin(); } 243 iterator end () { return instr_end(); } 250 inline iterator_range<iterator> terminators() { 251 return iterator_range<iterator>(getFirstTerminator(), end()); 258 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator; [all …]
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/AArch64/ |
| H A D | AArch64LoadStoreOptimizer.cpp | 66 MachineBasicBlock::iterator findMatchingInsn(MachineBasicBlock::iterator I, 73 MachineBasicBlock::iterator 74 mergePairedInsns(MachineBasicBlock::iterator I, 75 MachineBasicBlock::iterator Paired, bool MergeForward); 80 MachineBasicBlock::iterator 81 findMatchingUpdateInsnForward(MachineBasicBlock::iterator I, unsigned Limit, 87 MachineBasicBlock::iterator 88 findMatchingUpdateInsnBackward(MachineBasicBlock::iterator I, unsigned Limit); 91 MachineBasicBlock::iterator 92 mergePreIdxUpdateInsn(MachineBasicBlock::iterator I, [all …]
|