| /dalvik/vm/mterp/x86-atom/ |
| OP_RSUB_INT_LIT8.S | 36 FINISH 2 # jump to next instruction
|
| binopD2addr.S | 55 #FFETCH_ADV 1, %edx # %ecx<- next instruction hi; fetch, advance
56 #FGETOP_JMP 1, %edx # jump to next instruction; getop, jmp
66 FFETCH_ADV 1, %edx # %ecx<- next instruction hi; fetch, advance
67 FGETOP_JMP 1, %edx # jump to next instruction; getop, jmp
|
| stub.S | 25 FINISH_A # jump to next instruction
|
| /external/elfutils/libelf/ |
| elf_end.c | 80 parent->state.ar.children = elf->next;
85 while (child->next != elf)
86 child = child->next;
88 child->next = elf->next;
141 runp = scn->data_list.next;
145 runp = runp->next;
153 list = list->next;
|
| /external/iproute2/lib/ |
| ll_map.c | 29 struct idxmap * next; member in struct:idxmap
62 for (imp=&idxmap[h]; (im=*imp)!=NULL; imp = &im->next)
70 im->next = *imp;
97 for (im = idxmap[idx&0xF]; im; im = im->next)
118 for (im = idxmap[idx&0xF]; im; im = im->next)
131 for (im = idxmap[idx&0xF]; im; im = im->next)
145 for (im = idxmap[idx&0xF]; im; im = im->next) {
171 for (im = idxmap[i]; im; im = im->next) {
|
| /external/libxml2/ |
| hash.c | 40 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
200 xmlHashEntryPtr iter, next; local
238 table->table[key].next = NULL;
242 iter = oldtable[i].next;
244 next = iter->next;
254 table->table[key].next = NULL;
257 iter->next = table->table[key].next;
258 table->table[key].next = iter
291 xmlHashEntryPtr next; local
833 xmlHashEntryPtr next; local
907 xmlHashEntryPtr next; local
947 xmlHashEntryPtr next; local
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| AllowEventsList.java | 82 AllowEvents allowEvents = (AllowEvents) li.next();
107 allowEvents.setEventType((String) it.next());
|
| AllowList.java | 83 Allow a = (Allow)it.next();
109 allow.setMethod((String) it.next());
|
| RouteList.java | 80 Route route = (Route) it.next();
81 Route route1 = (Route) it1.next();
|
| /external/qemu/ |
| qlist.h | 22 QTAILQ_ENTRY(QListEntry) next; member in struct:QListEntry
36 (var) = ((var)->next.tqe_next))
|
| /external/skia/src/images/ |
| SkImageDecoder_Factory.cpp | 44 curr = curr->next();
70 curr = curr->next();
|
| /external/valgrind/main/memcheck/tests/ |
| badjump2.stderr.exp | 1 Jump to the invalid address stated on the next line
|
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| symbols.c | 65 if (scope->next)
66 scope->next->prev = scope->prev;
68 scope->prev->next = scope->next;
70 ScopeList = scope->next;
90 if ((lScope->next = ScopeList))
121 lScope = lScope->next;
160 lSymb->next = NULL;
|
| tokens.h | 58 struct TokenStream_Rec *next; member in struct:TokenStream_Rec
65 TokenBlock *next; member in struct:TokenBlock_Rec
|
| /external/webkit/Source/WebCore/editing/qt/ |
| SmartReplaceQt.cpp | 56 const char next[] = ")].,;:?\'!\"%*-/}\0"; local
57 const char* str = (isPreviousCharacter) ? prev : next;
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| FontFamily.h | 47 const FontFamily* next() const;
71 inline const FontFamily* FontFamily::next() const function in class:WebCore::FontFamily
|
| /libcore/luni/src/main/java/java/lang/reflect/ |
| Proxy.java | 96 Class<?> next = interfaces[i]; local
97 if (next == null) {
100 String name = next.getName();
101 if (!next.isInterface()) {
104 if (loader != next.getClassLoader()) {
106 if (next != Class.forName(name, false, loader)) {
115 if (next == interfaces[j]) {
119 if (!Modifier.isPublic(next.getModifiers())) {
|
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 25 * ordering priority of the next character or sequence of characters in the
51 * {@code next()} and {@code previous()} when the end or the
70 * call to either the {@link #next()} or {@link #previous()}
81 * next collation element. This value could be any of:
84 * the value of the next collation element. This means that if
99 * will be returned by the next invocation of the {@link #next()}
107 * Obtains the next collation element in the source string.
109 * @return the next collation element or {@code NULLORDER} if the end
112 public int next() { method in class:CollationElementIterator
[all...] |
| /libcore/luni/src/test/java/libcore/java/text/ |
| OldCollationElementIteratorTest.java | 34 int order = iterator.next();
38 order = iterator.next();
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| AbstractPromoter.java | 27 protected AbstractPromoter(SuggestionFilter filter, Promoter next, Config config) {
29 mNext = next;
|
| /sdk/ddms/libs/ddmuilib/src/com/android/ddmuilib/heap/ |
| NativeHeapDataImporter.java | 120 String kw = sc.next();
128 kw = sc.next();
136 kw = sc.next();
150 kw = sc.next();
163 String library = sc.next();
164 sc.next(); // ignore "---"
169 filename = sc.next();
187 String token = sc.next();
|
| /system/core/sh/ |
| alias.c | 70 for (ap = *app; ap; ap = ap->next) {
85 * alias value off the input before processing the next alias, we
95 * resulting token(s) is next checked for further alias sub. The
111 ap->next = *app;
123 for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
136 *app = ap->next;
171 ap = ap->next;
183 for (; ap; ap = ap->next) {
219 for (ap = atab[i]; ap; ap = ap->next) {
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| ieee802_11_auth.c | 39 struct hostapd_cached_radius_acl *next; member in struct:hostapd_cached_radius_acl
52 struct hostapd_acl_query_data *next; member in struct:hostapd_acl_query_data
63 acl_cache = acl_cache->next;
95 entry = entry->next;
262 query = query->next;
292 query->next = hapd->acl_queries;
318 prev->next = entry->next;
320 hapd->acl_cache = entry->next;
323 entry = entry->next;
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| tree-flow-inline.h | 135 /* Advance the hashtable iterator pointed to by HTI to the next element of the
169 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
238 /* Get the number of the next statement uid to be allocated. */
245 /* Set the number of the next statement uid to be allocated. */
252 /* Set the number of the next statement uid to be allocated. */
299 linknode->prev->next = linknode->next;
300 linknode->next->prev = linknode->prev;
302 linknode->next = NULL;
312 linknode->next = list->next
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| tree-flow-inline.h | 135 /* Advance the hashtable iterator pointed to by HTI to the next element of the
169 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
238 /* Get the number of the next statement uid to be allocated. */
245 /* Set the number of the next statement uid to be allocated. */
252 /* Set the number of the next statement uid to be allocated. */
299 linknode->prev->next = linknode->next;
300 linknode->next->prev = linknode->prev;
302 linknode->next = NULL;
312 linknode->next = list->next
[all...] |
