/external/nist-sip/java/gov/nist/javax/sip/address/ |
H A D | NetObjectList.java | 111 /** returns the next element 114 public GenericObject next() { method in class:NetObjectList 115 return (NetObject) super.next(); 118 /** returns the next element 122 public GenericObject next(ListIterator li) { method in class:NetObjectList 123 return (NetObject) super.next(li);
|
/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/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/oprofile/module/x86/ |
H A D | op_rtc.c | 172 static int rtc_add_sysctls(ctl_table * next) argument 174 *next = ((ctl_table) { 1, "rtc_value", &sysctl_parms.ctr[0].count, sizeof(int), 0600, NULL, lproc_dointvec, NULL, }); 178 static void rtc_remove_sysctls(ctl_table * next) argument
|
/external/oprofile/opjitconv/ |
H A D | opjitconv.h | 42 struct jitentry * next; member in struct:jitentry 64 struct jitentry_debug_line * next; member in struct:jitentry_debug_line
|
/external/ppp/pppd/ |
H A D | chap-new.h | 111 struct chap_digest_type *next; member in struct:chap_digest_type
|
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 47 // type E and a pointer to the next node. 56 // Gets the next node in the queue. 57 QueueNode * next() { return next_; } function in class:QueueNode 58 const QueueNode * next() const { return next_; } function in class:QueueNode 61 // Creates a node with a given element value. The next pointer is 88 QueueNode<E> * next = node->next(); local 91 node = next; 93 next = node->next(); [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the 54 code FAR *next; /* next available space in table */ local 151 filled is at next and has curr index bits. The code being used is huff 204 next = *table; /* current table to fill in */ 235 min = fill; /* save offset to next table */ 238 next[(huff >> drop) + fill] = this; 252 /* go to next symbol, update count, len */ 266 next += min; /* here min is 1 << curr */ 268 /* determine length of next tabl [all...] |
/external/qemu/slirp/ |
H A D | misc.h | 63 struct emu_t *next; member in struct:emu_t
|
/external/qemu/slirp-android/ |
H A D | misc.h | 63 struct emu_t *next; member in struct:emu_t
|
/external/quake/quake/src/QW/client/ |
H A D | d_local.h | 39 struct surfcache_s *next; member in struct:surfcache_s
|
/external/quake/quake/src/WinQuake/ |
H A D | common.h | 59 struct link_s *prev, *next; member in struct:link_s
|
H A D | d_local.h | 39 struct surfcache_s *next;
member in struct:surfcache_s
|
H A D | net_vcr.cpp | 37 } next; variable in typeref:struct:__anon10446 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...] |
/external/skia/include/core/ |
H A D | SkTDStack.h | 27 Rec* next = rec->fNext; local 29 rec = next;
|
/external/skia/src/core/ |
H A D | SkChunkAlloc.cpp | 25 Block* next = block->fNext; local 27 block = next; 35 Block* next = block->fNext; local 36 if (NULL == next) { 39 block = next;
|
/external/skia/src/effects/ |
H A D | SkBitmapCache.cpp | 48 Entry* next = entry->fNext; local 50 entry = next;
|
/external/skia/src/gpu/ |
H A D | GrAllocPool.cpp | 21 static Block* Create(size_t size, Block* next) { argument 25 block->fNext = next; 72 Block* next = block->fNext; local 74 block = next; 97 Block* next = fBlock->fNext; local 99 fBlock = next;
|
H A D | GrAtlas.h | 36 GrAtlas* next = atlas->fNext; local 38 atlas = next;
|
/external/skia/src/utils/ |
H A D | SkOSFile.cpp | 118 bool SkOSFile::Iter::next(SkString* name, bool getDir) function in class:SkOSFile::Iter 190 bool SkOSFile::Iter::next(SkString* name, bool getDir) function in class:SkOSFile::Iter
|
/external/skia/third_party/glu/libtess/ |
H A D | dict-list.h | 86 #define __gl_dictListSucc(n) ((n)->next) 88 #define __gl_dictListMin(d) ((d)->head.next) 97 DictNode *next; member in struct:DictNode
|
H A D | dict.h | 88 #define __gl_dictListSucc(n) ((n)->next) 90 #define __gl_dictListMin(d) ((d)->head.next) 99 DictNode *next; member in struct:DictNode
|
/external/sqlite/android/ |
H A D | PhonebookIndex.cpp | 168 UChar next = len > 2 ? out[1] : 0; local 169 c = android::GetNormalizedCodePoint(c, next, NULL);
|
/external/srec/srec/Semproc/include/ |
H A D | SR_ExpressionParser.h | 53 * Equal sign required next 58 * Identifier (const or rule property reference) required next 63 * Any operand other than equal sign required next 119 * pointer to the appropriate buffer (above) for storing the next token encountered 140 * Pointer to the next available function callback slot in the array 142 FunctionCallback *next; member in struct:ExpressionParser_t
|
/external/svox/pico/lib/ |
H A D | picorsrc.h | 160 picorsrc_Voice next; member in struct:picorsrc_voice
|