| /dalvik/vm/compiler/codegen/mips/ |
| CodegenCommon.cpp | 343 * If the next instruction is a move-result or move-result-long,
344 * return the target Dalvik sReg[s] and convert the next to a
350 if (mir->next &&
351 ((mir->next->dalvikInsn.opcode == OP_MOVE_RESULT) ||
352 (mir->next->dalvikInsn.opcode == OP_MOVE_RESULT_OBJECT))) {
353 mir->next->dalvikInsn.opcode = OP_NOP;
354 return dvmCompilerGetDest(cUnit, mir->next, 0);
375 newValue->generic.next = *constantListP;
388 if (mir->next &&
389 (mir->next->dalvikInsn.opcode == OP_MOVE_RESULT_WIDE))
[all...] |
| /development/tools/apkcheck/src/com/android/apkcheck/ |
| ApkCheck.java | 232 PackageInfo pubPkgInfo = pkgIter.next();
236 ClassInfo pubClassInfo = classIter.next();
254 PackageInfo apkPkgInfo = pkgIter.next();
266 ClassInfo apkClassInfo = classIter.next();
318 FieldInfo apkFieldInfo = fieldIter.next();
334 MethodInfo apkMethodInfo = methodIter.next();
395 PackageInfo pkgInfo = iter.next();
404 ClassInfo classInfo = iter.next();
413 FieldInfo fieldInfo = fieldIter.next();
418 MethodInfo methInfo = methIter.next();
[all...] |
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| schemasInternals.h | 151 struct _xmlSchemaAnnot *next; member in struct:_xmlSchemaAnnot
250 struct _xmlSchemaAttribute *next; /* the next attribute (not used?) */ member in struct:_xmlSchemaAttribute
279 struct _xmlSchemaAttributeLink *next;/* the next attribute link ... */ member in struct:_xmlSchemaAttributeLink
297 struct _xmlSchemaWildcardNs *next;/* the next constraint link ... */ member in struct:_xmlSchemaWildcardNs
363 struct _xmlSchemaAttribute *next;/* the next attribute if in a group ... */ member in struct:_xmlSchemaAttributeGroup
388 struct _xmlSchemaTypeLink *next;/* the next type link ... * member in struct:_xmlSchemaTypeLink
399 struct _xmlSchemaFacetLink *next;\/* the next facet link ... *\/ member in struct:_xmlSchemaFacetLink
604 struct _xmlSchemaType *next; \/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaType
767 struct _xmlSchemaType *next; \/* Not used? *\/ member in struct:_xmlSchemaElement
825 struct _xmlSchemaFacet *next;\/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaFacet
[all...] |
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 76 struct writeout_fn_node *next; member in struct:writeout_fn_node
89 struct flush_fn_node *next; member in struct:flush_fn_node
424 new_node->next = NULL;
429 writeout_fn_tail->next = new_node;
439 curr = curr->next;
446 writeout_fn_head = writeout_fn_head->next;
456 new_node->next = NULL;
461 flush_fn_tail->next = new_node;
471 curr = curr->next;
478 flush_fn_head = flush_fn_head->next;
[all...] |
| /external/libsepol/src/ |
| nodes.c | 156 for (c = head; c != NULL; c = c->next)
160 for (c = head; c != NULL; c = c->next)
187 for (c = head; c; c = c->next) {
203 for (c = head; c; c = c->next) {
247 for (c = head; c; c = c->next) {
266 for (c = head; c; c = c->next) {
317 node->next = policydb->ocontexts[OCON_NODE];
324 node->next = policydb->ocontexts[OCON_NODE6];
357 for (c = head; c; c = c->next) {
376 for (c = head; c; c = c->next) {
[all...] |
| /external/libxml2/include/libxml/ |
| schemasInternals.h | 151 struct _xmlSchemaAnnot *next; member in struct:_xmlSchemaAnnot
250 struct _xmlSchemaAttribute *next; /* the next attribute (not used?) */ member in struct:_xmlSchemaAttribute
279 struct _xmlSchemaAttributeLink *next;/* the next attribute link ... */ member in struct:_xmlSchemaAttributeLink
297 struct _xmlSchemaWildcardNs *next;/* the next constraint link ... */ member in struct:_xmlSchemaWildcardNs
363 struct _xmlSchemaAttribute *next;/* the next attribute if in a group ... */ member in struct:_xmlSchemaAttributeGroup
388 struct _xmlSchemaTypeLink *next;/* the next type link ... * member in struct:_xmlSchemaTypeLink
399 struct _xmlSchemaFacetLink *next;\/* the next facet link ... *\/ member in struct:_xmlSchemaFacetLink
604 struct _xmlSchemaType *next; \/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaType
767 struct _xmlSchemaType *next; \/* Not used? *\/ member in struct:_xmlSchemaElement
825 struct _xmlSchemaFacet *next;\/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaFacet
[all...] |
| /external/openssh/ |
| nchan.c | 91 chan_set_istate(Channel *c, u_int next)
93 if (c->istate > CHAN_INPUT_CLOSED || next > CHAN_INPUT_CLOSED)
94 fatal("chan_set_istate: bad state %d -> %d", c->istate, next);
96 istates[next]);
97 c->istate = next;
100 chan_set_ostate(Channel *c, u_int next)
102 if (c->ostate > CHAN_OUTPUT_CLOSED || next > CHAN_OUTPUT_CLOSED)
103 fatal("chan_set_ostate: bad state %d -> %d", c->ostate, next);
105 ostates[next]);
106 c->ostate = next;
[all...] |
| /external/qemu/android/ |
| config.c | 39 for(node = root->first_child; node; node = node->next) {
49 root->last_child->next = node;
135 char next; member in struct:__anon27403
147 if(cs->next != 0) {
148 c = cs->next;
149 cs->next = 0;
240 cs->next = *data;
323 cs.next = 0;
454 for (child = node->first_child; child; child = child->next)
472 for (child = root->first_child; child; child = child->next)
[all...] |
| /external/valgrind/main/callgrind/ |
| context.c | 94 Context **new_table, *curr, *next; local
111 next = curr->next;
115 curr->next = new_table[new_idx];
117 if (curr->next) {
119 if (curr->next->next)
123 curr = next;
221 cxt->next = cxts.table[idx];
263 cxt = cxt->next;
[all...] |
| /external/zlib/src/examples/ |
| zran.c | 95 struct point *next; local
113 next = realloc(index->list, sizeof(struct point) * index->size);
114 if (next == NULL) {
118 index->list = next;
122 next = index->list + index->have;
123 next->bits = bits;
124 next->in = in;
125 next->out = out;
127 memcpy(next->window, window + WINSIZE - left, left);
129 memcpy(next->window + left, window, WINSIZE - left)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| AbstractList.java | 52 public E next() { method in class:AbstractList.SimpleListIterator
199 public E next() { method in class:AbstractList.SubAbstractList.SubAbstractListIterator
201 return iterator.next();
451 add(location++, it.next());
493 Object e1 = it1.next(), e2 = it2.next();
527 Object object = it.next();
546 if (object.equals(it.next())) {
552 if (it.next() == null) {
657 it.next();
[all...] |
| /system/core/sh/ |
| var.c | 173 vp->next = *vpp;
183 vps1.next = *vpp;
308 vp->next = *vpp;
325 for (lp = list ; lp ; lp = lp->next) {
336 for (lp = list ; lp ; lp = lp->next)
370 for (sp = cmdenviron ; sp ; sp = sp->next) {
400 for (vp = *vpp ; vp ; vp = vp->next)
406 for (vp = *vpp ; vp ; vp = vp->next)
438 *prev = vp->next;
448 prev = &vp->next;
[all...] |
| /external/dnsmasq/src/ |
| option.c | 508 /* find next comma, split string with zero and eliminate spaces.
587 r->next = daemon->txt;
727 new->netid->next = np;
958 new->netid->next)
962 new->next = daemon->dhcp_match;
968 new->next = daemon->dhcp_opts;
1037 struct list *next; member in struct:list
2540 struct fileread *next; member in struct:fileread
2750 struct dhcp_netid *id, *next; local
[all...] |
| /external/doclava/src/com/google/doclava/ |
| InfoBuilder.java | 136 TypeInfo outerType = it.next();
457 ParseTree child = it.next();
462 it.next();
463 child = it.next();
471 child = it.next();
476 child = it.next();
482 child = it.next();
494 child = it.next();
501 child = it.next();
505 child = it.next();
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseIterators.java | 257 * returned (starting point for the next() search); for single-node
263 * Remembers the current node for the next call to gotoMark().
292 * i.e. subsequent call to next() should return END.
320 * Get the next node in the iteration.
322 * @return The next node handle in the iteration, or END if no more
325 public int next() method in class:DTMDefaultBaseIterators.ChildrenIterator
350 * i.e. subsequent call to next() should return END.
391 * Get the next node in the iteration. In this case, we return
394 * @return The next node handle in the iteration, or END.
396 public int next() method in class:DTMDefaultBaseIterators.ParentIterator
470 public int next() method in class:DTMDefaultBaseIterators.TypedChildrenIterator
559 public int next() method in class:DTMDefaultBaseIterators.NamespaceChildrenIterator
625 public int next() method in class:DTMDefaultBaseIterators.NamespaceIterator
664 public int next() method in class:DTMDefaultBaseIterators.TypedNamespaceIterator
728 public int next() method in class:DTMDefaultBaseIterators.RootIterator
765 public int next() method in class:DTMDefaultBaseIterators.TypedRootIterator
849 public int next() method in class:DTMDefaultBaseIterators.NamespaceAttributeIterator
896 public int next() method in class:DTMDefaultBaseIterators.FollowingSiblingIterator
930 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingSiblingIterator
1002 public int next() method in class:DTMDefaultBaseIterators.AttributeIterator
1065 public int next() method in class:DTMDefaultBaseIterators.TypedAttributeIterator
1150 public int next() method in class:DTMDefaultBaseIterators.PrecedingSiblingIterator
1194 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingSiblingIterator
1349 public int next() method in class:DTMDefaultBaseIterators.PrecedingIterator
1425 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingIterator
1529 public int next() method in class:DTMDefaultBaseIterators.FollowingIterator
1565 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingIterator
1709 public int next() method in class:DTMDefaultBaseIterators.AncestorIterator
1712 int next = _currentNode; local
1872 public int next() method in class:DTMDefaultBaseIterators.DescendantIterator
1944 public int next() method in class:DTMDefaultBaseIterators.TypedDescendantIterator
1998 public int next() method in class:DTMDefaultBaseIterators.NthDescendantIterator
2134 public int next() method in class:DTMDefaultBaseIterators.SingletonIterator
2170 public int next() method in class:DTMDefaultBaseIterators.TypedSingletonIterator
[all...] |
| /external/ipsec-tools/src/racoon/ |
| handler.c | 412 struct ph1handle *p, *next; local
414 for (p = LIST_FIRST(&ph1tree); p; p = next) {
415 next = LIST_NEXT(p, chain);
551 pr = pr->next) {
559 pr = pr->next) {
608 for (pr = iph2->proposal->head; pr != NULL; pr = pr->next)
709 struct ph2handle *p, *next; local
714 for (p = LIST_FIRST(&ph2tree); p; p = next) {
715 next = LIST_NEXT(p, chain);
744 struct ph2handle *iph2, *next; local
1014 struct recvdpkt *r, *next; local
1320 struct ph1handle *p, *next; local
1488 struct ph1handle *p, *next; local
1504 struct ph2handle *p, *next; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/dga/ |
| SDL_dgavideo.c | 604 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
615 if ( bucket->next ) {
616 if ( bucket->next->base != bucket->base+bucket->size ) {
617 printf("Warning, corrupt bucket list! (next)\n");
643 bucket->next = NULL;
653 surfaces.next = bucket;
661 bucket = surfaces.next;
664 bucket = bucket->next;
667 surfaces.next = NULL;
688 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| bind.hpp | 32 typedef Arg next; typedef in struct:boost::mpl::aux::replace_unnamed_arg
41 typedef typename Arg::next next; typedef in struct:boost::mpl::aux::replace_unnamed_arg
80 typedef typename r0::next n1;
132 typedef typename r0::next n1;
137 typedef typename r1::next n2;
190 typedef typename r0::next n1;
195 typedef typename r1::next n2;
200 typedef typename r2::next n3;
253 typedef typename r0::next n1
[all...] |
| /external/chromium_org/third_party/zlib/ |
| inflate.c | 38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
251 static code *next; local
259 next = fixed;
260 lenfix = next;
262 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
267 distfix = next;
269 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
442 next = strm->next_in; \
453 strm->next_in = next; \
594 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| inflate.c | 38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
216 static code *next; local
224 next = fixed;
225 lenfix = next;
227 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
232 distfix = next;
234 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
407 next = strm->next_in; \
418 strm->next_in = next; \
559 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/zlib/src/ |
| inflate.c | 38 * - Use local copies of stream next and avail values, as well as local bit
122 state->lencode = state->distcode = state->next = state->codes;
272 static code *next; local
280 next = fixed;
281 lenfix = next;
283 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
288 distfix = next;
290 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
463 next = strm->next_in; \
474 strm->next_in = next; \
610 z_const unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /bootable/recovery/minadbd/ |
| sockets.c | 49 .next = &local_socket_list,
58 .next = &local_socket_closing_list,
68 for (s = local_socket_list.next; s != &local_socket_list; s = s->next) {
82 s->next = list;
83 s->prev = s->next->prev;
84 s->prev->next = s;
85 s->next->prev = s;
102 if (s->prev && s->next)
104 s->prev->next = s->next
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| SelectorQuery.cpp | 45 virtual Node* next() = 0;
54 Node* next() function in class:WebCore::SingleNodeList
74 Node* next() function in class:WebCore::ClassRootNodeList
85 for (; element; element = ElementTraversal::next(*element, &m_rootNode)) {
106 Node* next() function in class:WebCore::ClassElementList
110 m_currentElement = nextInternal(ElementTraversal::next(*m_currentElement, &m_rootNode));
117 for (; element; element = ElementTraversal::next(*element, &m_rootNode)) {
134 for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
138 for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
183 for (Element* element = ElementTraversal::firstWithin(rootNode); element; element = ElementTraversal::next(*element, &rootNode))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 84 for (IteratorRef it = cfg->iteratorDFS(true); !it->end(); it->next(), ++i) {
101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
193 for (IteratorRef dtIt = iteratorDFS(false); !dtIt->end(); dtIt->next()) {
199 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
205 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) {
209 for (; !dfIt.end(); dfIt.next()) {
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
244 for (Instruction *i = bb->getEntry(); i; i = i->next) {
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 84 for (IteratorRef it = cfg->iteratorDFS(true); !it->end(); it->next(), ++i) {
101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
193 for (IteratorRef dtIt = iteratorDFS(false); !dtIt->end(); dtIt->next()) {
199 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
205 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) {
209 for (; !dfIt.end(); dfIt.next()) {
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
244 for (Instruction *i = bb->getEntry(); i; i = i->next) {
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
[all...] |
