/external/srec/config/en.us/dictionary/ |
H A D | 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 [all...] |
/external/clang/test/CodeGen/ |
H A D | pragma-pack-1.c | 6 struct ref *next; member in struct:ref
|
H A D | debug-info-var-location.c | 9 struct s *next; member in struct:s 16 struct s *sp = s->next;
|
/external/libusb-compat/libusb/ |
H A D | usbi.h | 28 ent->next = begin; \ 29 ent->next->prev = ent; \ 31 ent->next = NULL; \ 39 ent->prev->next = ent->next; \ 41 begin = ent->next; \ 42 if (ent->next) \ 43 ent->next->prev = ent->prev; \ 45 ent->next = NULL; \
|
/external/elfutils/libdwfl/ |
H A D | dwfl_end.c | 62 Dwfl_Module *next = dwfl->modulelist; local 63 while (next != NULL) 65 Dwfl_Module *dead = next; 66 next = dead->next;
|
/external/qemu/android/utils/ |
H A D | list.h | 19 * - List entries contain references to the next, and the previous entry in the 22 * in its 'next' reference, and the "list head" references the "last" entry in 24 * - The list is empty if its 'next' and 'previous' references are addressing the 30 ACList* next; member in struct:ACList 39 list->next = list->prev = list; 46 return list->next == list; 53 ACList* const next = list->next; local 54 entry->next = next; 75 ACList* const next = entry->next; local [all...] |
/external/iptables/libiptc/ |
H A D | 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); 72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument 174 __list_del(struct list_head * prev, struct list_head * next) argument 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 626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
H A D | 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/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | 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
|
/external/linux-tools-perf/util/include/linux/ |
H A D | list.h | 26 begin->prev->next = end->next; 27 end->next->prev = begin->prev; 36 for (; pos != (head); pos = pos->next)
|
/external/clang/test/CodeGenCXX/ |
H A D | function-template-specialization.cpp | 3 T* next(T* ptr, const U& diff); 6 T* next(T* ptr, const U& diff) { function 12 iptr = next(iptr, diff); 15 fptr = next(fptr, diff); 19 T* next(T* ptr, const U& diff); 22 iptr = next(iptr, diff); 25 dptr = next(dptr, diff);
|
/external/libvpx/nestegg/halloc/src/ |
H A D | 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/webkit/Source/JavaScriptCore/wtf/ |
H A D | DecimalNumber.cpp | 108 UChar* next = buffer; local 116 *next++ = '-'; 117 *next++ = '0'; 118 *next++ = '.'; 120 *next++ = '0'; 122 *next++ = m_significand[i]; 124 return next - buffer; 134 *next++ = '-'; 136 *next++ = m_significand[i]; 138 *next 164 UChar* next = buffer; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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); 37 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument 70 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/elfutils/lib/ |
H A D | list.h | 57 assert (_newp->next == NULL); \ 60 (first) = _newp->next = _newp->previous = _newp; \ 63 _newp->next = (first); \ 65 _newp->previous->next = _newp->next->previous = _newp; \ 76 || ({ __typeof (elem) _runp = first->next; \ 81 _runp = _runp->next; \ 83 if (unlikely (_elem->next == _elem)) \ 87 _elem->next->previous = _elem->previous; \ 88 _elem->previous->next [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | simple_list.h | 41 struct simple_node *next; member in struct:simple_node 52 (elem)->next->prev = (elem)->prev; \ 53 (elem)->prev->next = (elem)->next; \ 65 (elem)->next = (list)->next; \ 66 (list)->next->prev = elem; \ 67 (list)->next = elem; \ 78 (elem)->next = list; \ 80 (list)->prev->next [all...] |
/external/kernel-headers/original/linux/ |
H A D | 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); 42 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 84 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument 144 __list_del(struct list_head * prev, struct list_head * next) argument 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 732 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 741 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument 770 hlist_add_before_rcu(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/e2fsprogs/lib/blkid/ |
H A D | 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); 43 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument 86 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/oprofile/libutil/ |
H A D | 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); 46 __list_add(struct list_head * new_entry, struct list_head * prev, struct list_head * next) argument 89 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/v8/tools/ |
H A D | consarray.js | 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null); 72 * Returns the current item, moves to the next one. 74 ConsArray.prototype.next = function() { 77 this.currCell_ = this.currCell_.next; 89 ConsArray.Cell = function(data, next) { 91 this.next = next;
|
/external/openssl/crypto/pqueue/ |
H A D | 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 > ite 170 pitem *next; local [all...] |
/external/expat/xmlwf/ |
H A D | 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...] |
H A D | 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/ |
H A D | 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/ |
H A D | net_vcr.cpp | 37 } next; variable in typeref:struct:__anon11791 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 [all...] |