/external/libppp/src/ |
H A D | timer.h | 41 struct pppTimer *next; /* Link to next timer */ member in struct:pppTimer 42 struct pppTimer *enext; /* Link to next expired timer */
|
/external/libvpx/libvpx/vpx_mem/memory_manager/ |
H A D | hmm_base.c | 31 to_remove->prev->next = to_remove->next; 33 if (to_remove->next) 34 to_remove->next->prev = to_remove->prev; 61 ptr_rec_ptr->next = bin_front_ptr->next; 62 bin_front_ptr->next = ptr_rec_ptr; 64 if (ptr_rec_ptr->next) 65 ptr_rec_ptr->next->prev = ptr_rec_ptr; 69 ptr_rec_ptr->next 162 ptr_record *next = ptr_rec_ptr->next; variable [all...] |
/external/nist-sip/java/gov/nist/javax/sip/header/ |
H A D | SIPObjectList.java | 90 GenericObject outerObj = (GenericObject) it1.next(); 92 Object innerObj = it2.next(); 125 * Get the next object of this list (assumes that first() has been 129 public GenericObject next() { method in class:SIPObjectList 130 return (SIPObject) super.next();
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
H A D | PUserDatabaseParser.java | 100 char next = this.lexer.getNextChar(); 101 if (next!='>'&&next!='\n') 103 dbname.append(next);
|
/external/openssh/ |
H A D | auth-options.h | 20 struct envstring *next; member in struct:envstring
|
/external/qemu/android/ |
H A D | cmdline-option.h | 19 struct ParamList* next; member in struct:ParamList
|
/external/qemu/hw/ |
H A D | boards.h | 20 struct QEMUMachine *next; member in struct:QEMUMachine
|
/external/smack/src/org/jivesoftware/smack/util/collections/ |
H A D | MapIterator.java | 32 * to <code>next()</code>, the <code>getValue()</code> method provides direct 37 * Object key = it.next(); 57 * Gets the next <em>key</em> from the <code>Map</code>. 59 * @return the next key in the iteration 63 K next(); method in interface:MapIterator 68 * to <code>next()</code>. 71 * @throws IllegalStateException if <code>next()</code> has not yet been called 77 * returned by <code>next()</code>. 80 * @throws IllegalStateException if <code>next()</code> has not yet been called 88 * This method can be called once per call to <code>next()</cod [all...] |
/external/smack/src/org/jivesoftware/smackx/pubsub/provider/ |
H A D | SubscriptionProvider.java | 37 int tag = parser.next();
41 tag = parser.next();
46 while (parser.next() != XmlPullParser.END_TAG && parser.getName() != "subscribe-options");
48 while (parser.getEventType() != XmlPullParser.END_TAG) parser.next();
|
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 22 /* each node stores pointer to data, and pointer to next node */ 25 struct LNode *next; member in struct:LNode
|
/external/valgrind/main/callgrind/ |
H A D | costs.h | 25 CostChunk *next, *prev; member in struct:_CostChunk
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | DoublyLinkedList.h | 85 node->prev()->setNext(node->next()); 88 m_head = node->next(); 91 if (node->next()) { 93 node->next()->setPrev(node->prev());
|
/external/webkit/Source/WebCore/loader/cache/ |
H A D | CachedResourceClientWalker.h | 36 // Just keep calling next() on this. It's safe from deletions of items. 40 CachedResourceClient* next();
|
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | blacklist.h | 13 struct wpa_blacklist *next; member in struct:wpa_blacklist
|
/external/zlib/src/contrib/infback9/ |
H A D | inflate9.h | 43 code FAR *next; /* next available space in codes[] */ member in struct:inflate_state
|
/external/ant-glob/src/org/apache/tools/ant/util/ |
H A D | FileUtils.java | 161 int next = colon + 1; 162 root = path.substring(0, next); 166 next = (ca[next] == sep) ? next + 1 : next; 170 for (int i = next; i < ca.length; i++) {
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | BasicTestIterator.java | 31 * Base for iterators that handle predicates. Does the basic next 33 * next node. 120 * Get the next node via getNextXXX. Bottlenecked for derived class override. 121 * @return The next node on the axis, or DTM.NULL. 126 * Returns the next node in the set and advances the position of the 130 * @return The next <code>Node</code> in the set being iterated over, or 146 int next; 170 next = getNextNode(); 172 if (DTM.NULL != next) 174 if(DTMIterator.FILTER_ACCEPT == acceptNode(next)) [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/ |
H A D | DHDomainParameters.java | 76 ASN1Encodable next = getNext(e); 78 if (next != null && next instanceof ASN1Integer) 80 this.j = ASN1Integer.getInstance(next); 81 next = getNext(e); 84 if (next != null) 86 this.validationParms = DHValidationParms.getInstance(next.toASN1Primitive());
|
/external/chromium/testing/gtest/samples/ |
H A D | sample3-inl.h | 47 // type E and a pointer to the next node. 56 // Gets the next node in the queue. 57 QueueNode* next() { return next_; } function in class:QueueNode 58 const QueueNode* next() const { return next_; } function in class:QueueNode 61 // Creates a node with a given element value. The next pointer is 88 QueueNode<E>* next = node->next(); local 91 node = next; 93 next = node->next(); [all...] |
/external/gtest/samples/ |
H A D | sample3-inl.h | 47 // type E and a pointer to the next node. 56 // Gets the next node in the queue. 57 QueueNode* next() { return next_; } function in class:QueueNode 58 const QueueNode* next() const { return next_; } function in class:QueueNode 61 // Creates a node with a given element value. The next pointer is 88 QueueNode<E>* next = node->next(); local 91 node = next; 93 next = node->next(); [all...] |
/external/libvpx/libvpx/third_party/googletest/src/samples/ |
H A D | sample3-inl.h | 47 // type E and a pointer to the next node. 56 // Gets the next node in the queue. 57 QueueNode* next() { return next_; } function in class:QueueNode 58 const QueueNode* next() const { return next_; } function in class:QueueNode 61 // Creates a node with a given element value. The next pointer is 88 QueueNode<E>* next = node->next(); local 91 node = next; 93 next = node->next(); [all...] |
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 47 // type E and a pointer to the next node. 56 // Gets the next node in the queue. 57 QueueNode * next() { return next_; } function in class:QueueNode 58 const QueueNode * next() const { return next_; } function in class:QueueNode 61 // Creates a node with a given element value. The next pointer is 88 QueueNode<E> * next = node->next(); local 91 node = next; 93 next = node->next(); [all...] |
/external/srec/srec/crec/ |
H A D | astar_pphash.c | 56 while (parp1->next && parp2->next) 63 parp1 = parp1->next; 64 parp2 = parp2->next; 66 diff = (int)parp1->next - (int)parp2->next; 84 while ((parp = parp->next) != NULL)
|
/external/webkit/Source/JavaScriptCore/runtime/ |
H A D | ScopeChain.h | 38 ScopeChainNode(ScopeChainNode* next, JSObject* object, JSGlobalData* globalData, JSGlobalObject* globalObject, JSObject* globalThis) argument 41 , next(*globalData, this, next) 51 WriteBarrier<ScopeChainNode> next; member in class:JSC::ScopeChainNode 83 ASSERT(next); 84 return next.get(); 97 ScopeChainIterator& operator++() { m_node = m_node->next.get(); return *this; }
|
/external/webkit/Source/WebCore/dom/ |
H A D | ContainerNodeAlgorithms.h | 50 GenericNode* next; local 54 next = n->nextSibling(); 57 head = next; 58 if (next == 0) 117 GenericNode* next = 0; local 118 for (GenericNode* n = container->firstChild(); n != 0; n = next) { 121 next = n->nextSibling();
|