| /external/srec/config/en.us/dictionary/ |
| cmu2nuance.cpp | 78 const char* next = 0; local
80 (next=xlate(p, "AA1 R", ")r")) || // odd AA D
81 (next=xlate(p, "AA0", "o")) || // odd AA D
82 (next=xlate(p, "AA1", "o")) || // odd AA D
83 (next=xlate(p, "AA2", "o")) || // odd AA D
85 (next=xlate(p, "AE0", "a")) || // at AE T
86 (next=xlate(p, "AE1", "a")) || // at AE T
87 (next=xlate(p, "AE2", "a")) || // at AE T
89 // (next=xlate(p, "AH0 L", "L")) || // drops accuracy by 1%
90 (next=xlate(p, "AH0 N", "~")) || // hut HH AH T - from jea
[all...] |
| /bionic/libc/kernel/arch-sh/asm/ |
| system_64.h | 19 struct task_struct *next,
22 #define switch_to(prev,next,last) do { if (last_task_used_math != next) { struct pt_regs *regs = next->thread.uregs; if (regs) regs->sr |= SR_FD; } last = sh64_switch_to(prev, &prev->thread, next, &next->thread); } while (0)
|
| /external/webkit/WebCore/rendering/style/ |
| ShadowData.cpp | 35 next = o.next ? new ShadowData(*o.next) : 0;
40 if ((next && !o.next) || (!next && o.next) ||
41 (next && o.next && *next != *o.next)
[all...] |
| /frameworks/base/telephony/java/com/android/internal/telephony/ |
| ATResponseParser.java | 27 private int next = 0; field in class:ATResponseParser
92 return next < line.length();
100 if (next == 0) {
104 if (next >= len) {
111 char c = line.charAt(next++);
117 if (next >= len) {
120 c = line.charAt(next++);
121 tokStart = next - 1;
122 while (c != '"' && next < len) {
123 c = line.charAt(next++)
[all...] |
| /external/iptables/libiptc/ |
| linux_list.h | 48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
[all...] |
| /bionic/libc/stdio/ |
| glue.h | 40 struct glue *next; member in struct:glue
|
| /dalvik/dx/src/com/android/dx/util/ |
| IntIterator.java | 25 * Checks to see if the iterator has a next value.
27 * @return true if next() will succeed
32 * Returns the next value in the iterator.
34 * @return next value
35 * @throws java.util.NoSuchElementException if no next element exists
37 int next(); method in interface:IntIterator
|
| /libcore/luni/src/main/java/java/util/ |
| Iterator.java | 24 * methods {@code next} and {@code hasNext()} may throw a {@code ConcurrentModificationException}.
38 * @see #next
43 * Returns the next object and advances the iterator.
45 * @return the next object.
50 public E next(); method in interface:Iterator
53 * Removes the last object returned by {@code next} from the collection.
54 * This method can only be called once between each call to {@code next}.
60 * if {@code next} has not been called, or {@code remove} has
61 * already been called after the last call to {@code next}.
|
| /libcore/luni/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 38 * nodeHandle=myTraverser.next(myContext,nodeHandle))
61 return next(context, context);
80 return next(context, context, extendedTypeID);
84 * Traverse to the next node after the current node.
94 * @return the next node in the iteration, or DTM.NULL.
97 public abstract int next(int context, int current); method in class:DTMAxisTraverser
100 * Traverse to the next node after the current node that is matched
112 * @return the next node in the iteration, or DTM.NULL.
115 public abstract int next(int context, int current, int extendedTypeID); method in class:DTMAxisTraverser
|
| /external/libvpx/nestegg/halloc/src/ |
| hlist.h | 32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
[all...] |
| /external/elfutils/lib/ |
| list.h | 21 assert (_newp->next == NULL); \
24 (first) = _newp->next = _newp->previous = _newp; \
27 _newp->next = (first); \
29 _newp->previous->next = _newp->next->previous = _newp; \
40 || ({ __typeof (elem) _runp = first->next; \
45 _runp = _runp->next; \
47 if (unlikely (_elem->next == _elem)) \
51 _elem->next->previous = _elem->previous; \
52 _elem->previous->next = _elem->next;
[all...] |
| /external/kernel-headers/original/linux/ |
| list.h | 16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev; member in struct:list_head
32 list->next = list;
40 * the prev/next entries already!
44 struct list_head *next)
46 next->prev = new;
47 new->next = next;
49 prev->next = new;
62 __list_add(new, head, head->next);
302 struct list_head *next = head->next; local
597 struct hlist_node *next, **pprev; member in struct:hlist_node
621 struct hlist_node *next = n->next; local
678 struct hlist_node *next = old->next; local
[all...] |
| /packages/apps/Calendar/src/com/android/calendar/ |
| CalendarApplication.java | 31 * coming earlier in the list. The "next" pointer of the head node
37 public Screen next; field in class:CalendarApplication.Screen
42 next = this;
48 node.next = next;
50 next.previous = node;
51 next = node;
56 next.previous = previous;
57 previous.next = next;
[all...] |
| /external/openssl/crypto/pqueue/ |
| pqueue.c | 79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > item *
170 pitem *next, *prev = NULL; local
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
[all...] |
| /external/oprofile/libutil/ |
| op_list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
[all...] |
| /external/expat/xmlwf/ |
| ct.c | 86 const char *next, *p; local
89 next = buf;
90 p = getTok(&next);
91 if (matchkey(p, next, "text"))
93 else if (!matchkey(p, next, "application"))
95 p = getTok(&next);
98 p = getTok(&next);
99 if (matchkey(p, next, "xml"))
101 p = getTok(&next);
104 p = getTok(&next);
[all...] |
| 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:__anon7007
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...] |
| /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 | 158 long next = current + 1; local
159 if (compareAndSet(current, next))
172 long next = current - 1; local
173 if (compareAndSet(current, next))
187 long next = current + delta; local
188 if (compareAndSet(current, next))
201 long next = current + 1; local
202 if (compareAndSet(current, next))
203 return next;
215 long next = current - 1 local
230 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;
|
