| /external/libvncserver/libvncserver/ |
| main.c | 269 rfbClientIteratorPtr iterator; local
272 iterator=rfbGetClientIterator(rfbScreen);
273 while((cl=rfbClientIteratorNext(iterator))) {
353 rfbReleaseClientIterator(iterator);
401 rfbClientIteratorPtr iterator; local
404 iterator=rfbGetClientIterator(screen);
405 while((cl=rfbClientIteratorNext(iterator))) {
412 rfbReleaseClientIterator(iterator);
638 rfbClientIteratorPtr iterator; local
653 iterator = rfbGetClientIterator(s)
947 rfbClientIteratorPtr iterator; local
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SmallVector.h | 28 #include <iterator>
100 typedef T *iterator; typedef in class:llvm::SmallVectorTemplateCommon
104 typedef std::reverse_iterator<iterator> reverse_iterator;
111 // forward iterator creation methods.
113 iterator begin() { return (iterator)this->BeginX; }
117 iterator end() { return (iterator)this->EndX; }
121 iterator capacity_ptr() { return (iterator)this->CapacityX;
323 typedef typename SuperClass::iterator iterator; typedef in class:llvm::SmallVectorImpl
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 44 #include "llvm/ADT/iterator.h"
52 #include <iterator>
267 /// A lazy iterator used for both the entry nodes and child nodes.
269 /// When this iterator is dereferenced, if not yet available, a function will
274 : public iterator_adaptor_base<edge_iterator, EdgeVectorImplT::iterator,
279 EdgeVectorImplT::iterator E;
281 // Build the iterator for a specific position in the edge list.
282 edge_iterator(EdgeVectorImplT::iterator BaseI,
283 EdgeVectorImplT::iterator E)
301 /// A lazy iterator over specifically call edges
404 typedef pointee_iterator<SmallVectorImpl<Node *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::SCC
498 typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::RefSCC
[all...] |
| LoopInfo.h | 129 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
132 iterator begin() const { return SubLoops.begin(); }
133 iterator end() const { return SubLoops.end(); }
274 LoopT *removeChildLoop(iterator I) {
275 assert(I != SubLoops.end() && "Cannot remove end iterator!");
522 /// iterator/begin/end - The interface to the top-level loops in the current
525 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
528 iterator begin() const { return TopLevelLoops.begin(); }
529 iterator end() const { return TopLevelLoops.end(); }
559 LoopT *removeLoop(iterator I)
[all...] |
| RegionInfo.h | 543 /// These iterators iterator over all subregions of this Region.
545 typedef typename RegionSet::iterator iterator; typedef in class:llvm::RegionBase
548 iterator begin() { return children.begin(); }
549 iterator end() { return children.end(); }
558 /// Region. The iterator also iterates over BasicBlocks that are elements of
559 /// a subregion of this Region. It is therefore called a flat iterator.
572 // Construct the begin iterator.
581 // Construct the end iterator.
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| DIE.h | 448 class iterator class in class:llvm::IntrusiveBackList
449 : public iterator_facade_base<iterator, std::forward_iterator_tag, T> {
454 iterator() = default;
455 explicit iterator(T *N) : N(N) {} function in class:llvm::IntrusiveBackList::iterator
457 iterator &operator++() {
465 bool operator==(const iterator &X) const { return N == X.N; }
466 bool operator!=(const iterator &X) const { return N != X.N; }
476 // Placate MSVC by explicitly scoping 'iterator'.
477 const_iterator(typename IntrusiveBackList<T>::iterator X) : N(X.N) {}
492 iterator begin()
[all...] |
| /external/llvm/include/llvm/IR/ |
| Function.h | 47 typedef BasicBlockListType::iterator iterator; typedef in class:llvm::Function
50 typedef ArgumentListType::iterator arg_iterator;
502 // BasicBlock iterator forwarding functions
504 iterator begin() { return BasicBlocks.begin(); }
506 iterator end () { return BasicBlocks.end(); }
|
| /external/llvm/include/llvm/MC/ |
| MCAssembler.h | 16 #include "llvm/ADT/iterator.h"
64 typedef pointee_iterator<SectionListType::iterator> iterator; typedef in class:llvm::MCAssembler
68 typedef pointee_iterator<SymbolDataListType::iterator> symbol_iterator;
75 typedef std::vector<IndirectSymbolData>::iterator indirect_symbol_iterator;
79 typedef std::vector<DataRegionData>::iterator data_region_iterator;
303 iterator begin() { return Sections.begin(); }
306 iterator end() { return Sections.end(); }
|
| MCRegisterInfo.h | 32 typedef const MCPhysReg* iterator; typedef in class:llvm::MCRegisterClass
35 const iterator RegsBegin;
51 iterator begin() const { return RegsBegin; }
52 iterator end() const { return RegsBegin + RegsSize; }
188 /// DiffListIterator - Base iterator class that can traverse the
197 /// Create an invalid iterator. Call init() to point to something useful.
200 /// init - Point the iterator to InitVal, decoding subsequent values from
201 /// DiffList. The iterator will initially point to InitVal, sub-classes are
220 /// isValid - returns true if this iterator is not yet at the end.
223 /// Dereference the iterator to get the value at the current position
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 79 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator; typedef in class:llvm::DomTreeNodeBase
83 iterator begin() { return Children.begin(); }
84 iterator end() { return Children.end(); }
128 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
590 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
|
| OnDiskHashTable.h | 321 class iterator { class in class:llvm::OnDiskChainedHashTable
328 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
329 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
338 bool operator==(const iterator &X) const { return X.Data == Data; }
339 bool operator!=(const iterator &X) const { return X.Data != Data; }
343 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
350 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
363 return iterator(); // Empty bucket.
397 return iterator(X, Items + L.first, L.second, InfoPtr);
400 return iterator();
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| MemorySSA.h | 81 #include "llvm/ADT/iterator.h"
101 #include <iterator>
142 typedef user_iterator iterator; typedef in class:llvm::MemoryAccess
145 /// \brief This iterator walks over all of the defs in a given
368 // Block iterator interface. This provides access to the list of incoming
412 assert(this == U.getUser() && "Iterator doesn't point to PHI's Uses?");
417 /// to value use iterator.
767 /// \brief Iterator base class used to implement const and non-const iterators
786 // iterator to avoid callers having to linear walk to get the block.
794 typename BaseT::iterator::pointer operator*() const
[all...] |
| /external/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-param-util.h | 37 #include <iterator>
73 // Used only for the purposes of iterator comparison
76 // Advances iterator to point to the next element
78 // for not calling Advance() on an iterator equal to
81 // Clones the iterator object. Used for implementing copy semantics
84 // Dereferences the current iterator and provides (read-only) access
86 // Current() on an iterator equal to BaseGenerator()->End().
89 // Determines whether the given iterator and other point to the same
97 // and implements the const forward iterator concept.
161 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator
[all...] |
| /external/mesa3d/src/gtest/include/gtest/internal/ |
| gtest-param-util.h | 37 #include <iterator>
73 // Used only for the purposes of iterator comparison
76 // Advances iterator to point to the next element
78 // for not calling Advance() on an iterator equal to
81 // Clones the iterator object. Used for implementing copy semantics
84 // Dereferences the current iterator and provides (read-only) access
86 // Current() on an iterator equal to BaseGenerator()->End().
89 // Determines whether the given iterator and other point to the same
97 // and implements the const forward iterator concept.
161 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator
[all...] |
| /external/opencv/cxcore/src/ |
| cxarithm.cpp | 305 CvNArrayIterator iterator; local
311 CV_CALL( cvInitNArrayIterator( 3, arrs, 0, stubs, &iterator ));
313 type = iterator.hdr[0]->type;
314 iterator.size.width *= CV_MAT_CN(type);
331 IPPI_CALL( func_sfs( iterator.ptr[0], CV_STUB_STEP,
332 iterator.ptr[1], CV_STUB_STEP,
333 iterator.ptr[2], CV_STUB_STEP,
334 iterator.size, 0 ));
336 while( cvNextNArraySlice( &iterator ));
346 IPPI_CALL( func( iterator.ptr[0], CV_STUB_STEP
581 CvNArrayIterator iterator; local
777 CvNArrayIterator iterator; local
1053 CvNArrayIterator iterator; local
1373 CvNArrayIterator iterator; local
1731 CvNArrayIterator iterator; local
[all...] |
| cxconvert.cpp | 1545 CvNArrayIterator iterator; local
[all...] |
| cxsumpixels.cpp | 417 CvNArrayIterator iterator; local
420 CV_CALL( cvInitNArrayIterator( 1, &matnd, 0, &nstub, &iterator ));
422 type = CV_MAT_TYPE(iterator.hdr[0]->type);
437 IPPI_CALL( func( iterator.ptr[0], CV_STUB_STEP,
438 iterator.size, temp.val ));
444 while( cvNextNArraySlice( &iterator ));
455 IPPI_CALL( func( iterator.ptr[0], CV_STUB_STEP,
456 iterator.size, temp.val, cvAlgHintAccurate ));
462 while( cvNextNArraySlice( &iterator ));
608 CvNArrayIterator iterator; local
[all...] |
| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| CssTokens.java | 32 import java.util.Iterator;
83 public TokenIterator iterator() { return start(); } method in class:CssTokens
92 public final class TokenIterator implements Iterator<String> {
[all...] |
| /external/protobuf/gtest/include/gtest/internal/ |
| gtest-param-util.h | 37 #include <iterator>
72 // Used only for the purposes of iterator comparison
75 // Advances iterator to point to the next element
77 // for not calling Advance() on an iterator equal to
80 // Clones the iterator object. Used for implementing copy semantics
83 // Dereferences the current iterator and provides (read-only) access
85 // Current() on an iterator equal to BaseGenerator()->End().
88 // Determines whether the given iterator and other point to the same
96 // and implements the const forward iterator concept.
160 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator
[all...] |
| /external/python/cpython3/Lib/xml/etree/ |
| ElementTree.py | 391 """Create tree iterator.
393 The iterator loops over the element and all subelements in document
398 list() function on the iterator, and loop over the resulting list.
402 Return an iterator containing all the matching elements.
423 """Create text iterator.
425 The iterator loops over the element and all subelements in document
611 """Create and return tree iterator for the root element.
613 The iterator loops over all elements in this tree, in document order.
1218 def iterator(): function in function:iterparse
[all...] |
| /external/python/cpython3/Modules/ |
| signalmodule.c | 736 PyObject *iterator, *item; local
742 iterator = PyObject_GetIter(iterable);
743 if (iterator == NULL)
748 item = PyIter_Next(iterator);
773 Py_XDECREF(iterator);
[all...] |
| /external/snakeyaml/src/test/java/org/pyyaml/ |
| PyStructureTest.java | 23 import java.util.Iterator;
51 Iterator<Event> iter1 = events1.iterator();
52 Iterator<Event> iter2 = events2.iterator();
137 Iterator<Node> iter2 = seq2.getValue().iterator();
147 Iterator<NodeTuple> iter2 = seq2.getValue().iterator();
172 Iterator<Node> iter1 = events1.iterator()
244 private Iterator<Object> iterator; field in class:PyStructureTest.CanonicalLoader.YamlIterable
250 public Iterator<Object> iterator() { method in class:PyStructureTest.CanonicalLoader.YamlIterable
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallVector.h | 23 #include <iterator>
110 typedef T *iterator; typedef in class:llvm::SmallVectorTemplateCommon
114 typedef std::reverse_iterator<iterator> reverse_iterator;
121 // forward iterator creation methods.
122 iterator begin() { return (iterator)this->BeginX; }
124 iterator end() { return (iterator)this->EndX; }
127 iterator capacity_ptr() { return (iterator)this->CapacityX;
270 typedef typename SuperClass::iterator iterator; typedef in class:llvm::SmallVectorTemplateCommon::SmallVectorImpl
[all...] |
| ilist.h | 44 #include <iterator>
141 // ilist_iterator<Node> - Iterator for intrusive list.
145 : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> {
149 typedef std::iterator<std::bidirectional_iterator_tag,
159 // ilist_iterator is not a random-access iterator, but it has an
179 // This is templated so that we can allow constructing a const iterator from
180 // a nonconst iterator...
185 // This is templated so that we can allow assigning to a const iterator from
186 // a nonconst iterator...
249 // the iterator, which could very likely be pointing to end()
343 typedef ilist_iterator<NodeTy> iterator; typedef in class:llvm::iplist
624 typedef typename iplist<NodeTy>::iterator iterator; typedef in struct:llvm::ilist
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| LoopInfo.h | 51 typename std::vector<T*>::iterator I = std::find(V.begin(), V.end(), N);
123 /// iterator/begin/end - Return the loops contained entirely within this loop.
126 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
127 iterator begin() const { return SubLoops.begin(); }
128 iterator end() const { return SubLoops.end(); }
356 typename std::vector<LoopT *>::iterator I =
376 LoopT *removeChildLoop(iterator I) {
377 assert(I != SubLoops.end() && "Cannot remove end iterator!");
470 for (iterator I = begin(), E = end(); I != E; ++I)
493 for (iterator I = begin(), E = end(); I != E; ++I
665 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
968 typedef LoopInfoBase<BasicBlock, Loop>::iterator iterator; typedef in class:llvm::LoopInfo
[all...] |
