/external/tcpdump/ |
H A D | print-igrp.c | 84 u_int nint, nsys, next; local 94 next = EXTRACT_16BITS(&hdr->ig_nx); 103 next); 115 } else if (next > 0) { 118 --next; 126 if (nint == 0 && nsys == 0 && next == 0)
|
/external/valgrind/main/memcheck/tests/ |
H A D | leak-cases.c | 42 struct _Node* next; member in struct:_Node 48 Node* mk(Node* next) argument 53 x->next = next; 82 (p6->next)++; // 16/1 possibly lost 88 (p8->next)++; // 16/1 possibly lost 92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
H A D | wrap5.c | 12 struct _Lard* next; member in struct:_Lard 26 p->next = lard; 90 p_next = p->next;
|
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | pmksa_cache_auth.h | 18 struct rsn_pmksa_cache_entry *next, *hnext; member in struct:rsn_pmksa_cache_entry
|
/external/wpa_supplicant_8/hostapd/src/tls/ |
H A D | asn1.c | 124 const u8 **next) 137 *next = hdr.payload + hdr.length; 123 asn1_get_oid(const u8 *buf, size_t len, struct asn1_oid *oid, const u8 **next) argument
|
/external/wpa_supplicant_8/src/ap/ |
H A D | pmksa_cache_auth.h | 18 struct rsn_pmksa_cache_entry *next, *hnext; member in struct:rsn_pmksa_cache_entry
|
/external/wpa_supplicant_8/src/tls/ |
H A D | asn1.c | 124 const u8 **next) 137 *next = hdr.payload + hdr.length; 123 asn1_get_oid(const u8 *buf, size_t len, struct asn1_oid *oid, const u8 **next) argument
|
/external/wpa_supplicant_8/wpa_supplicant/src/ap/ |
H A D | pmksa_cache_auth.h | 18 struct rsn_pmksa_cache_entry *next, *hnext; member in struct:rsn_pmksa_cache_entry
|
/external/wpa_supplicant_8/wpa_supplicant/src/tls/ |
H A D | asn1.c | 124 const u8 **next) 137 *next = hdr.payload + hdr.length; 123 asn1_get_oid(const u8 *buf, size_t len, struct asn1_oid *oid, const u8 **next) argument
|
/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/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3rewritestreams.h | 52 /// Once you start next()ing, do not try to add more elements. It will 65 /// Cursor 0..n-1. If singleElement!=NULL, cursor is 0 until you next(), 95 /// If dirty, then next() always returns a dup. 114 /// Return the next element in the stream. If out of elements, throw 117 void * (*next) (struct ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct * stream); member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct 133 /// Returns ANTLR3_TRUE if there is a next element available 137 /// Treat next element as a single node even if it's a subtree. 138 /// This is used instead of next() when the result has to be a
|
/external/apache-http/src/org/apache/http/conn/ |
H A D | ManagedClientConnection.java | 152 * @param next the proxy to which the tunnel was established. 164 void tunnelProxy(HttpHost next, boolean secure, HttpParams params) argument 194 * the next checkpoint has been reached.
|
/external/apache-http/src/org/apache/http/impl/conn/ |
H A D | AbstractPoolEntry.java | 229 * @param next the proxy to which the tunnel was established. 239 public void tunnelProxy(HttpHost next, boolean secure, HttpParams params) argument 242 if (next == null) { 258 this.connection.update(null, next, secure, params); 259 this.tracker.tunnelProxy(next, secure);
|
H A D | AbstractPooledConnAdapter.java | 133 public void tunnelProxy(HttpHost next, boolean secure, HttpParams params) argument 137 poolEntry.tunnelProxy(next, secure, params);
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
H A D | DTMAxisIterator.java | 33 * Get the next node in the iteration. 35 * @return The next node handle in the iteration, or END. 37 public int next(); method in interface:DTMAxisIterator 60 * Remembers the current node for the next call to gotoMark(). 71 * i.e. subsequent call to next() should return END. 81 * i.e. subsequent call to next() should return END.
|
/external/bison/src/ |
H A D | nullable.c | 38 struct rule_list *next; member in struct:rule_list 96 p->next = rsets[*rp - ntokens]; 117 for (p = rsets[*s1++ - ntokens]; p; p = p->next)
|
H A D | symlist.c | 53 res->next = NULL; 72 res->next = NULL; 90 res->next = NULL; 108 res->next = NULL; 121 for (/* Nothing. */; l && l->content.sym; l = l->next) 138 node->next = list; 150 symbol_list *node, *next; local 151 for (node = list; node; node = next) 153 next = node->next; [all...] |
H A D | symlist.h | 81 struct symbol_list *next; member in struct:symbol_list
|
/external/bluetooth/bluedroid/btif/src/ |
H A D | btif_profile_queue.c | 129 ** Description Add a new connection to the queue and trigger the next 152 ** Description Clear the queue's busy status and advance to the next 180 connect_node_t *next = current->p_next; local 182 current = next;
|
/external/chromium/base/ |
H A D | linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers). 38 // node = node->next()) { 72 // A. Doubly-linked lists are made up of nodes that contain "next" and 76 // space for the "next" and "previous" pointers (base::LinkNode<T>*). 78 // needs to glue on the "next" and "previous" pointers using 87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next) argument 88 : previous_(previous), next_(next) {} 116 LinkNode<T>* next() const { function in class:base::LinkNode 132 void set(LinkNode<T>* prev, LinkNode<T>* next) { argument 133 previous_ = prev; next_ = next; [all...] |
/external/chromium/chrome/browser/policy/ |
H A D | configuration_policy_store_interface.h | 58 ConfigurationPolicyStoreInterface* next) 59 : next_(next), 80 FilteringPolicyStoreInterface(ConfigurationPolicyStoreInterface* next, argument 82 : next_(next), 57 ObservingPolicyStoreInterface( ConfigurationPolicyStoreInterface* next) argument
|
/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/chromium_org/base/android/java/src/org/chromium/base/ |
H A D | ObserverList.java | 103 E el = it.next(); 153 public E next() { method in class:ObserverList.ObserverListIterator
|
/external/chromium_org/base/containers/ |
H A D | mru_cache_unittest.cc | 95 Cache::reverse_iterator next = cache.Erase(cache.rbegin()); local 99 EXPECT_TRUE(next == cache.rbegin()); 100 EXPECT_EQ(kItem1Key, next->first); 101 EXPECT_EQ(item1.value, next->second.value);
|
/external/chromium_org/base/debug/ |
H A D | trace_event_impl.cc | 129 size_t next = oldest_event_index_; variable 131 return GetEventAt(next);
|