| /external/expat/xmlwf/ |
| xmlmime.c | 90 const char *next, *p; local
93 next = buf;
94 p = getTok(&next);
95 if (matchkey(p, next, "text"))
97 else if (!matchkey(p, next, "application"))
99 p = getTok(&next);
102 p = getTok(&next);
104 if (!matchkey(p, next, "xml") && charset[0] == '\0')
107 p = getTok(&next);
110 p = getTok(&next);
[all...] |
| /external/tcpdump/ |
| cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than
59 u_int8_t *next; local
62 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize);
65 if (next - cs->c_buf + wordsize > cs->c_len)
68 return next;
87 u_int8_t *next; local
89 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL)
92 *u = EXTRACT_LE_64BITS(next);
95 cs->c_next = next + sizeof(*u);
103 u_int8_t *next; local
119 u_int8_t *next; local
[all...] |
| /external/quake/quake/src/WinQuake/ |
| net_vcr.cpp | 37 } next; variable in typeref:struct:__anon10656
52 Sys_FileRead(vcrFile, &next, sizeof(next));
58 if (Sys_FileRead(vcrFile, &next, sizeof(next)) == 0)
60 next.op = 255;
63 if (next.op < 1 || next.op > VCR_MAX_MESSAGE)
87 if (host_time != next.time || next.op != VCR_OP_GETMESSAGE || next.session != getDriverDataAsLong(sock)
[all...] |
| /external/blktrace/btt/ |
| list.h | 35 struct list_head *next, *prev; member in struct:list_head
45 list->next = list;
53 * the prev/next entries already!
57 struct list_head *next)
59 next->prev = new;
60 new->next = next;
62 prev->next = new;
75 __list_add(new, head, head->next);
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
79 struct exec_node *next; member in struct:exec_node
102 exec_node() : next(NULL), prev(NULL)
109 return next;
114 return next;
233 void next() function in class:iterator
255 void next() function in class:exec_list_iterator
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicInteger.java | 133 int next = current + 1; local
134 if (compareAndSet(current, next))
147 int next = current - 1; local
148 if (compareAndSet(current, next))
162 int next = current + delta; local
163 if (compareAndSet(current, next))
176 int next = current + 1; local
177 if (compareAndSet(current, next))
178 return next;
190 int next = current - 1 local
205 int next = current + delta; local
[all...] |
| AtomicLong.java | 147 long next = current + 1; local
148 if (compareAndSet(current, next))
161 long next = current - 1; local
162 if (compareAndSet(current, next))
176 long next = current + delta; local
177 if (compareAndSet(current, next))
190 long next = current + 1; local
191 if (compareAndSet(current, next))
192 return next;
204 long next = current - 1 local
219 long next = current + delta; local
[all...] |
| /bootable/bootloader/legacy/libc/ |
| sprintf.c | 36 char *next; member in struct:snprintf_ctxt
45 *ctxt->next++ = n;
58 ctxt.next = str;
64 *ctxt.next = 0;
65 return ctxt.next - str;
|
| /external/libnl-headers/netlink/ |
| list.h | 17 struct nl_list_head * next; member in struct:nl_list_head
23 list->next = list;
29 struct nl_list_head *next)
31 prev->next = obj;
33 next->prev = obj;
34 obj->next = next;
46 __nl_list_add(obj, head, head->next);
51 obj->next->prev = obj->prev;
52 obj->prev->next = obj->next
[all...] |
| /external/bluetooth/glib/glib/ |
| glist.c | 65 g_slice_free_chain (GList, list, next);
124 new_list->next = NULL;
130 last->next = new_list;
171 new_list->next = list;
177 list->prev->next = new_list;
219 tmp_list->prev->next = new_list;
220 new_list->next = tmp_list;
259 node->next = sibling;
263 node->prev->next = node;
277 while (last->next)
382 GList *next = tmp->next; local
788 GList *next = list->next; local
[all...] |
| gslist.c | 60 g_slice_free_chain (GSList, list, next);
119 new_list->next = NULL;
125 last->next = new_list;
162 new_list->next = list;
199 new_list->next = NULL;
209 tmp_list = tmp_list->next;
214 new_list->next = prev_list->next;
215 prev_list->next = new_list;
219 new_list->next = list
361 GSList *next = tmp->next; local
506 GSList *next = list->next; local
742 GSList *next = list->next; local
[all...] |
| /system/extras/fatblock/ |
| fdpool.c | 31 .next = &fdpool_head
38 struct pooled_fd *next = prev->next; local
42 prev->next = node;
44 node->next = next;
45 next->prev = node;
53 struct pooled_fd *next = node->next; local
56 assert(next);
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.cpp | 37 mir->prev = mir->next = NULL;
39 bb->lastMIRInsn->next = mir;
41 mir->next = NULL;
52 mir->prev = mir->next = NULL;
55 mir->next = bb->firstMIRInsn;
65 newMIR->next = currentMIR->next;
66 currentMIR->next = newMIR;
68 if (newMIR->next) {
70 newMIR->next->prev = newMIR
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 22 struct dl_list *next; member in struct:dl_list
28 list->next = list;
34 item->next = list->next;
36 list->next->prev = item;
37 list->next = item;
47 item->next->prev = item->prev;
48 item->prev->next = item->next;
49 item->next = NULL
[all...] |
| /external/yaffs2/yaffs2/ |
| devextras.h | 49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
77 struct list_head *next)
79 next->prev = new;
80 new->next = next;
82 prev->next = new;
95 __list_add(new, head, head->next);
[all...] |
| /hardware/msm7k/libgralloc/ |
| allocator.h | 48 newNode->next = node->next;
49 if (node->next == 0) mLast = newNode;
50 else node->next->prev = newNode;
51 node->next = newNode;
56 newNode->next = node;
58 else node->prev->next = newNode;
65 newNode->prev = newNode->next = 0;
68 newNode->next = mFirst;
79 newNode->next = 0
117 mutable chunk_t* next; member in struct:SimpleBestFitAllocator::chunk_t
[all...] |
| /hardware/msm7k/libgralloc-qsd8k/ |
| allocator.h | 49 newNode->next = node->next;
50 if (node->next == 0) mLast = newNode;
51 else node->next->prev = newNode;
52 node->next = newNode;
57 newNode->next = node;
59 else node->prev->next = newNode;
66 newNode->prev = newNode->next = 0;
69 newNode->next = mFirst;
80 newNode->next = 0
118 mutable chunk_t* next; member in struct:SimpleBestFitAllocator::chunk_t
[all...] |
| /libcore/luni/src/main/java/java/lang/ref/ |
| FinalizerReference.java | 31 private FinalizerReference next; field in class:FinalizerReference
51 reference.next = head;
61 FinalizerReference next = reference.next; local
63 reference.next = null;
66 prev.next = next;
68 head = next;
70 if (next != null) {
71 next.prev = prev
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Random.java | 89 protected synchronized int next(int bits) { method in class:Random
98 return next(1) != 0;
123 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53));
131 return (next(24) / 16777216f);
168 return next(32);
178 return (int) ((n * (long) next(31)) >> 31);
182 bits = next(31);
194 return ((long) next(32) << 32) + next(32)
[all...] |
| AbstractSet.java | 79 Object next = it.next(); local
80 result += next == null ? 0 : next.hashCode();
102 if (collection.contains(it.next())) {
110 result = remove(it.next()) || result;
|
| /libcore/luni/src/test/java/libcore/xml/ |
| PullParserDtdTest.java | 41 while (parser.next() != XmlPullParser.END_DOCUMENT) {
64 assertEquals(XmlPullParser.START_TAG, parser.next());
65 assertEquals(XmlPullParser.TEXT, parser.next());
67 assertEquals(XmlPullParser.END_TAG, parser.next());
68 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
76 assertEquals(XmlPullParser.START_TAG, parser.next());
77 assertEquals(XmlPullParser.TEXT, parser.next());
79 assertEquals(XmlPullParser.END_TAG, parser.next());
80 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
86 assertEquals(XmlPullParser.START_TAG, parser.next());
[all...] |
| /external/mksh/src/ |
| lalloc.c | 40 ap->next = NULL;
59 while (ap->next != lp)
60 if ((ap = ap->next) == NULL) {
79 pp->next = lp->next;
91 lp->next = ap->next;
92 ap->next = lp;
105 pp->next = lp->next;
[all...] |
| /external/skia/src/views/ |
| SkTagList.cpp | 46 SkTagList* next = rec->fNext;
51 prev->fNext = next;
53 *head = next;
58 rec = next;
66 SkTagList* next = rec->fNext;
68 rec = next;
|
| /system/core/include/cutils/ |
| list.h | 24 struct listnode *next; member in struct:listnode
33 .next = &name, \
38 for (node = (list)->next; node != (list); node = node->next)
47 #define list_empty(list) ((list) == (list)->next)
48 #define list_head(list) ((list)->next)
|
| /dalvik/vm/mterp/x86-atom/ |
| OP_CONST_16.S | 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
34 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
|
