/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/skia/src/images/ |
H A D | SkImageEncoder_Factory.cpp | 20 curr = curr->next();
|
/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/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/chromium_org/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 87 QueueNode<E>* next = node->next(); local 90 node = next; 92 next = node->next(); [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions 83 /* triangle is not culled, pass to next stage */ 84 stage->next->tri( stage->next, header ); 106 stage->next->flush( stage->next, flags ); 112 stage->next->reset_stipple_counter( stage->next ); 134 cull->stage.next = NULL;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | free_list.h | 68 inline void EnsureNonLoop(void* node, void* next) { argument 71 if (node != next) return; 72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next); 92 // Returns value of the |next| pointer w/out running a sanity check. 116 void *next = FL_Next_No_Check(t); local 117 if (next) { 118 FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__); 120 return next; 124 // |*list|, and updates |*list| to point to the next element in the
|
/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/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions 83 /* triangle is not culled, pass to next stage */ 84 stage->next->tri( stage->next, header ); 106 stage->next->flush( stage->next, flags ); 112 stage->next->reset_stipple_counter( stage->next ); 134 cull->stage.next = NULL;
|
/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/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | ElementTraversal.h | 40 Element* next(const Node&); 41 Element* next(const Node&, const Node* stayWithin); 42 Element* next(const ContainerNode&); 43 Element* next(const ContainerNode&, const Node* stayWithin); 45 // Like next, but skips children. 74 Node* node = NodeTraversal::next(current); 79 inline Element* next(const ContainerNode& current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal 80 inline Element* next(const Node& current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal 85 Node* node = NodeTraversal::next(current, stayWithin); 90 inline Element* next(cons function in namespace:WebCore::ElementTraversal 91 inline Element* next(const Node& current, const Node* stayWithin) { return traverseNextElementTemplate(current, stayWithin); } function in namespace:WebCore::ElementTraversal [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/UglifyJS/ |
H A D | parse-js.js | 17 function to fetch the next token. 272 function next(signal_eof) { 324 next(); 330 ret += next(); 375 var ch = next(true); 393 var digit = parseInt(next(true), 16); 403 var quote = next(), ret = ""; 405 var ch = next(true); 415 next(); 428 next(); [all...] |
/external/chromium_org/third_party/libaddressinput/chromium/cpp/src/ |
H A D | address_field_util.cc | 74 next = format.begin() + 1; 75 current != format.end() && next != format.end(); 76 ++current, ++next) { 77 if (IsTokenPrefix(*current) && IsToken(*next)) { 78 fields->push_back(ParseToken(*next));
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | io_manager.c | 25 char *next, *ptr, *options, *arg; local 42 next = strchr(ptr, '&'); 43 if (next) 44 *next++ = 0; 53 ptr = next;
|