| /external/dropbear/libtomcrypt/src/pk/asn1/der/sequence/ |
| der_decode_sequence_flexi.c | 96 l->next = XCALLOC(1, sizeof(*l));
97 if (l->next == NULL) {
101 l->next->prev = l;
102 l = l->next;
320 /* now if it's > 127 the next bytes are the length of the length */
347 XFREE(l->next);
348 l->next = NULL;
|
| /external/e2fsprogs/lib/ext2fs/ |
| inode_io.c | 41 struct inode_private_data *next; member in struct:inode_private_data
102 data->next = top_intern;
126 prev = data, data = data->next)
132 prev->next = data->next;
134 top_intern = data->next;
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedLongs.java | 87 long next = flip(array[i]); local
88 if (next < min) {
89 min = next;
107 long next = flip(array[i]); local
108 if (next > max) {
109 max = next;
|
| /external/harfbuzz_ng/src/ |
| hb-common.cc | 175 struct hb_language_item_t *next; member in struct:hb_language_item_t
202 hb_language_item_t *next = langs->next; local
205 langs = next;
215 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next)
223 lang->next = first_lang;
|
| /external/icu4c/common/unicode/ |
| stringtriebuilder.h | 283 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); }
288 Node *next; member in class:StringTrieBuilder::IntermediateValueNode
298 length(len), next(nextNode) {}
303 Node *next; member in class:StringTrieBuilder::LinearMatchNode
372 length(len), next(subNode) {}
378 Node *next; // A branch sub-node. member in class:StringTrieBuilder::BranchHeadNode
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| TLSMessageProcessor.java | 204 TLSMessageChannel next = (TLSMessageChannel) it.next(); local
205 next.close();
209 TLSMessageChannel next = (TLSMessageChannel) incomingMCIterator.next(); local
210 next.close();
|
| /external/objenesis/tck/src/org/objenesis/tck/ |
| TextReporter.java | 107 objenesisResults.put(it.next(), new HashMap());
163 String desc = (String) it.next();
172 String candidateDesc = (String) it.next();
176 String instDesc = (String) itInst.next();
198 Result element = (Result) it.next();
235 result = Math.max(result, ((String) it.next()).length());
|
| /external/skia/src/core/ |
| SkWriter32.cpp | 34 Block* next = block->fNext; local
36 block = next;
133 Block* next = block->fNext; local
136 block = next;
138 Block* next = block->fNext; local
140 block = next;
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPIteratorImpl.java | 151 * @see java.util.Iterator#next()
153 public Object next() method in class:XMPIteratorImpl
155 return nodeIterator.next();
260 * Prepares the next node to return if not already done.
272 // find next node
307 * Sets the returnProperty as next item or recurses into <code>hasNext()</code>.
308 * @return Returns if there is a next item to return.
344 XMPNode child = (XMPNode) iterator.next();
351 returnProperty = (XMPPropertyInfo) subIterator.next();
363 * The existance of returnProperty indicates if there is a next node, otherwis
368 public Object next() method in class:XMPIteratorImpl.NodeIterator
[all...] |
| /frameworks/base/tests/AccessoryDisplay/common/src/com/android/accessorydisplay/common/ |
| Transport.java | 330 int next = length; local
334 remaining = position - next;
339 contentSize = buffer.getInt(next + 4);
348 next += length;
356 buffer.limit(next);
368 System.arraycopy(oldBuffer.array(), next, buffer.array(), 0, remaining); local
|
| /libcore/luni/src/test/java/tests/java/sql/ |
| UpdateFunctionalityTest2.java | 69 while (userTab.next()) {
191 r.next();
195 r.next();
234 r.next();
255 r.next();
278 while (r.next()) {
|
| /packages/apps/Gallery/src/com/android/camera/gallery/ |
| ImageListUber.java | 67 if (slot.next()) mQueue.add(slot);
136 if (slot.next()) mQueue.add(slot);
139 if (slot.next()) mQueue.add(slot);
234 if (slot.next()) mQueue.add(slot);
237 if (slot.next()) mQueue.add(slot);
282 public boolean next() { method in class:ImageListUber.MergeSlot
|
| /system/core/libcorkscrew/ |
| map_info.c | 82 mi->next = milist;
146 mi->next = milist;
159 map_info_t* next = milist->next; local
161 milist = next;
168 mi = mi->next;
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| markup.cpp | 101 for (Element* element = ElementTraversal::firstWithin(fragment); element; element = ElementTraversal::next(*element, &fragment)) {
346 Node* next; local
348 for (Node* n = startNode; n != pastEnd; n = next) {
357 next = NodeTraversal::next(*n);
360 if (isBlock(n) && canHaveChildrenForEditing(n) && next == pastEnd)
365 next = NodeTraversal::nextSkippingChildren(*n);
368 next = pastEnd;
387 if (!openedTag && (!n->nextSibling() || next == pastEnd)) {
391 if (next != pastEnd && next->isDescendantOf(ancestor)
472 VisiblePosition next = v.next(); local
674 RefPtr<Node> next; local
1080 Node* next = node->nextSibling(); local
[all...] |
| /external/chromium/third_party/libevent/ |
| evdns.c | 178 struct request *next, *prev; member in struct:request
219 struct nameserver *next, *prev; member in struct:nameserver
221 /* when we next probe this server. */
247 struct server_reply_item *next; /* next item in sequence. */ member in struct:server_reply_item
260 /* Pointers to the next and previous entries on the list of replies */
439 req = req->next;
459 /* and wait longer to send the next probe packet. */
527 req = req->next;
556 if (req->next == req)
1777 struct server_reply_item *victim, *next, **list; local
2062 struct nameserver *next = server->next; local
2077 struct request *next = req->next; local
2379 struct search_domain *next; member in struct:search_domain
2397 struct search_domain *next, *dom; local
2454 struct search_domain *cur, *prev = NULL, *next; local
[all...] |
| /external/chromium_org/third_party/libevent/ |
| evdns.c | 178 struct request *next, *prev; member in struct:request
219 struct nameserver *next, *prev; member in struct:nameserver
221 /* when we next probe this server. */
247 struct server_reply_item *next; /* next item in sequence. */ member in struct:server_reply_item
260 /* Pointers to the next and previous entries on the list of replies */
439 req = req->next;
459 /* and wait longer to send the next probe packet. */
527 req = req->next;
556 if (req->next == req)
1777 struct server_reply_item *victim, *next, **list; local
2062 struct nameserver *next = server->next; local
2077 struct request *next = req->next; local
2379 struct search_domain *next; member in struct:search_domain
2397 struct search_domain *next, *dom; local
2454 struct search_domain *cur, *prev = NULL, *next; local
[all...] |
| /external/chromium_org/third_party/skia/src/views/ |
| SkView.cpp | 139 while ((child = iter.next()) != NULL)
225 while ((child = iter.next()) != NULL)
233 while ((child = iter.next()) != NULL)
381 while ((child = iter.next()) != NULL)
530 SkView* next = NULL; local
535 next = fNextSibling;
539 fParent->fFirstChild = next;
702 while ((child = iter.next()) != NULL)
740 SkView* SkView::F2BIter::next() { function in class:SkView::F2BIter
758 SkView* SkView::B2FIter::next() { function in class:SkView::B2FIter
762 SkView* next = fChild->fNextSibling; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| mem3.c | 88 u32 next; /* Index in mem3.aPool[] of next free chunk */ member in struct:Mem3Block::__anon17053::__anon17055
148 u32 next = mem3.aPool[i].u.list.next; local
152 *pRoot = next;
154 mem3.aPool[prev].u.list.next = next;
156 if( next ){
157 mem3.aPool[next].u.list.prev = prev;
159 mem3.aPool[i].u.list.next = 0
[all...] |
| /external/libmtp/src/ |
| playlist-spl.c | 60 struct text_struct *next; // Link to next line, NULL if end of list member in struct:text_struct
229 f->next = NULL;
402 tail->next = malloc(sizeof(text_t));
403 tail = tail->next;
434 // set the next pointer at the end
437 tail->next = NULL;
497 // advance to the next line
498 p = p->next;
515 p = p->next;
[all...] |
| /external/skia/src/views/ |
| SkView.cpp | 139 while ((child = iter.next()) != NULL)
225 while ((child = iter.next()) != NULL)
233 while ((child = iter.next()) != NULL)
381 while ((child = iter.next()) != NULL)
530 SkView* next = NULL; local
535 next = fNextSibling;
539 fParent->fFirstChild = next;
702 while ((child = iter.next()) != NULL)
740 SkView* SkView::F2BIter::next() { function in class:SkView::F2BIter
758 SkView* SkView::B2FIter::next() { function in class:SkView::B2FIter
762 SkView* next = fChild->fNextSibling; local
[all...] |
| /external/srec/portable/src/ |
| pstream.c | 66 struct FileBufferFrame *next; member in struct:FileBufferFrame
117 fb->next = NULL;
144 FileBufferFrame *next, *curr; local
151 next = curr->next;
155 curr = next;
157 while (next != NULL);
314 curFrame = curFrame->next;
406 /* go to next frame */
407 curFrame = PortFile->curFrame = curFrame->next;
[all...] |
| /ndk/sources/host-tools/make-3.81/ |
| implicit.c | 73 struct idep *next; /* struct dep -compatible interface */
88 n = p->next;
106 /* Scans the BUFFER for the next word with whitespace as a separator.
310 for (rule = pattern_rules; rule != 0; rule = rule->next)
490 for (dep = rule->deps; dep != 0; dep = dep->next)
596 for (; *id_ptr; id_ptr = &(*id_ptr)->next)
614 for (d = *id_ptr; d != 0; d = d->next)
658 for (d = deps; d != 0; d = d->next)
687 for (expl_d = file->deps; expl_d != 0; expl_d = expl_d->next)
815 struct dep *next = dep->next
71 struct idep *next; \/* struct dep -compatible interface *\/ member in struct:idep
813 struct dep *next = dep->next; local
[all...] |
| /system/core/adb/ |
| usb_linux.c | 53 usb_handle *next; member in struct:usb_handle
82 .next = &handle_list,
90 for(usb = handle_list.next; usb != &handle_list; usb = usb->next){
108 for(usb = handle_list.next; usb != &handle_list; usb = usb->next){
199 // should have config descriptor next
547 h->next->prev = h->prev;
548 h->prev->next = h->next;
[all...] |
| /external/chromium_org/third_party/freetype/src/pshinter/ |
| pshalgo.c | 1053 end = end->next;
1096 after = after->next;
1114 start = start->next;
1281 FT_UInt first = 0, next, n; local
1700 FT_UInt next; local
2045 PSH_Point first, next, point; local
[all...] |
| /external/chromium_org/third_party/libxslt/libxslt/ |
| variables.c | 81 ctxt->cache->RVT = (xmlDocPtr) container->next;
83 container->next = NULL;
131 RVT->next = (xmlNodePtr) XSLT_TCTXT_VARIABLE(ctxt)->fragment;
136 RVT->next = (xmlNodePtr) ctxt->tmpRVT;
171 RVT->next = (xmlNodePtr) XSLT_TCTXT_VARIABLE(ctxt)->fragment;
180 RVT->next = (xmlNodePtr) ctxt->localRVT;
224 cur = (xmlDocPtr) cur->next;
269 * the ns->next field.
271 if ((((xmlNsPtr) cur)->next != NULL) &&
272 (((xmlNsPtr) cur)->next->type == XML_ELEMENT_NODE)
412 xmlDocPtr cur, next; local
604 xsltStackElemPtr next; local
[all...] |
