Searched refs:next (Results 76 - 100 of 4047) sorted by relevance

1234567891011>>

/macosx-10.9.5/ksh-20/ksh/src/lib/libast/hash/
H A Dhashfree.c73 b = b->next;
111 for (; tp; tp = tp->next)
112 if (tp->next == tab)
114 tp->next = tab->next;
118 else if (!(tab->root->references = tp->next))
122 for (; rp; rp = rp->next)
123 if (rp->next == tab->root)
125 rp->next = tab->root->next;
[all...]
/macosx-10.9.5/BerkeleyDB-21/db/java/src/com/sleepycat/persist/
H A DForwardCursor.java33 * Moves the cursor to the next value and returns it, or returns null
39 * @return the next value, or null if there are no more values in the
42 V next() method in interface:ForwardCursor
46 * Moves the cursor to the next value and returns it, or returns null
53 * @return the next value, or null if there are no more values in the
56 V next(LockMode lockMode) method in interface:ForwardCursor
/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/
H A DWeakSet.h82 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) {
97 for (WeakBlock* block = m_blocks.head(); block; block = block->next())
103 for (WeakBlock* block = m_blocks.head(); block; block = block->next())
109 for (WeakBlock* block = m_blocks.head(); block; block = block->next())
115 WeakBlock* next; local
116 for (WeakBlock* block = m_blocks.head(); block; block = next) {
117 next = block->next();
H A DWeakSet.cpp36 WeakBlock* next = 0; local
37 for (WeakBlock* block = m_blocks.head(); block; block = next) {
38 next = block->next();
46 for (WeakBlock* block = m_blocks.head(); block; block = block->next())
64 m_nextAllocator = m_nextAllocator->next();
/macosx-10.9.5/bind9-45.100/bind9/contrib/idn/idnkit-1.0-src/lib/tests/
H A Dsetenv.c62 myenv_t *next; member in struct:myenv
83 for (mye = myenvs; mye != NULL; mye = mye->next) {
85 if (mye->next != NULL)
86 mye->next->prev = mye->prev;
88 mye->prev->next = mye->next;
89 if (mye->next == NULL && mye->prev == NULL)
125 mye->next = myenvs;
/macosx-10.9.5/emacs-92/emacs/oldXMenu/
H A DXDestAssoc.c24 Entry = bucket->next;
28 entry_next = Entry->next;
/macosx-10.9.5/ICU-511.35/icuSources/layout/
H A DLEInsertionList.cpp17 InsertionRecord *next; member in struct:InsertionRecord
41 head = head->next;
73 insertion->next = NULL;
74 tail->next = insertion;
78 insertion->next = head;
87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {
/macosx-10.9.5/Libc-997.90.3/stdlib/FreeBSD/
H A Drand.c95 static u_long next = 1; variable
100 return (do_rand(&next));
107 next = seed;
126 if (_read(fd, (void *) &next, sizeof(next)) == sizeof(next))
153 printf("next random number = %d\n", rand());
160 printf("next random number = %d\n", rand_r(&myseed));
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/comp/
H A Datexit.c55 struct list* next;
70 p->next = funclist;
82 funclist = p->next;
/macosx-10.9.5/emacs-92/emacs/src/
H A Datimer.c49 will become ripe next is always at the front of this list. */
55 functions are not called until the next UNBLOCK_INPUT because timer
102 /* Round TIME up to the next full second if we don't have
117 free_atimers = t->next;
153 /* Arrange for a SIGALRM at the time the next atimer is ripe. */
176 for (t = *list, prev = NULL; t && t != timer; prev = t, t = t->next)
185 prev->next = t->next;
187 *list = t->next;
189 t->next
266 struct atimer *next; local
[all...]
/macosx-10.9.5/WebCore-7537.78.1/rendering/
H A DCounterNode.cpp104 CounterNode* next; local
105 while (!(next = current->m_nextSibling)) {
110 return next;
115 if (CounterNode* next = m_firstChild)
116 return next;
211 m_rootRenderer->invalidate(); // This makes m_rootRenderer point to the next renderer if any since it disconnects the m_rootRenderer from this.
251 CounterNode* next; local
254 next = refChild->m_nextSibling;
257 next = m_firstChild;
264 if (next) {
328 CounterNode* next = oldChild->m_nextSibling; local
[all...]
/macosx-10.9.5/ntp-88/ntpd/
H A Dntp_restrict.c113 resinit[i].next = resfree;
114 resinit6[i].next = resfree6;
191 for (rl = match->next; rl != 0 && rl->addr <= hostaddr;
192 rl = rl->next)
230 for (rl6 = match6->next; rl6 != 0 &&
232 sizeof(hostaddr6)) <= 0); rl6 = rl6->next) {
299 rl = rlprev->next;
323 rl = rl->next;
337 rl6 = rlprev6->next;
366 rl6 = rl6->next;
[all...]
/macosx-10.9.5/BerkeleyDB-21/db/os/
H A Dos_addrinfo.c163 ADDRINFO *next, *tmpaddr;
165 for (next = ai; next != NULL; next = tmpaddr) {
166 if (next->ai_canonname != NULL)
167 __os_free(env, next->ai_canonname);
169 if (next->ai_addr != NULL)
170 __os_free(env, next->ai_addr);
172 tmpaddr = next->ai_next;
173 __os_free(env, next);
[all...]
/macosx-10.9.5/groff-38/groff/src/libs/libxutil/
H A DDviChar.c17 struct map_list *next; member in struct:map_list
36 for (m = world; m; m=m->next)
49 for (m = world; m; m = m->next)
54 m->next = world;
66 DviCharNameHash *h, *next; local
71 for (h = buckets[i]; h; h=next) {
72 next = h->next;
106 h->next = buckets[i];
121 for (h = map->buckets[i]; h; h=h->next)
[all...]
/macosx-10.9.5/libxml2-26/libxml2/
H A Dlist.c33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)
430 xmlLinkPtr next = lk->next; local
[all...]
/macosx-10.9.5/pyobjc-42/2.5/pyobjc/pyobjc-core/Modules/objc/
H A Dclosure_pool.m10 struct freelist* next;
32 ((freelist*)(((ffi_closure*)newblock)+i))->next =
36 ((freelist*)(((ffi_closure*)newblock)+(BLOCKSIZE-1)))->next = NULL;
52 closure_freelist = closure_freelist->next;
59 ((freelist*)cl)->next = closure_freelist;
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/Modules/objc/
H A Dclosure_pool.m10 struct freelist* next;
32 ((freelist*)(((ffi_closure*)newblock)+i))->next =
36 ((freelist*)(((ffi_closure*)newblock)+(BLOCKSIZE-1)))->next = NULL;
52 closure_freelist = closure_freelist->next;
59 ((freelist*)cl)->next = closure_freelist;
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Dlist.c33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)
430 xmlLinkPtr next = lk->next; local
[all...]
/macosx-10.9.5/gnudiff-19/diffutils/src/
H A Dcontext.c207 struct change *next = hunk;
214 while (next && next->line0 + next->deleted <= i)
215 next = next->link;
220 if (next && next->line0 <= i)
224 prefix = (next->inserted > 0 ? "!" : "-");
236 struct change *next
204 struct change *next = hunk; local
233 struct change *next = hunk; local
291 struct change *next; local
428 struct change *next = script->link; local
[all...]
/macosx-10.9.5/WebCore-7537.78.1/platform/text/
H A DBidiRunList.h105 Run* next = m_firstRun; local
106 while (next != run) {
107 current = next;
108 next = current->next();
112 m_firstRun = run->next();
129 Run* next = current->next(); local
130 while (next != run) {
131 current = next;
231 Run* next = curr->next(); local
[all...]
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/sfio/
H A Dsfmove.c43 reg uchar *cp, *next; local
91 if(fw->next >= fw->endb ||
92 (fw->next > fw->data && fr->extent < 0 &&
116 if((r = fr->endb - (next = fr->next)) <= 0)
134 if(fw && fw->extent >= 0 && w <= (fw->endb-fw->next) )
135 { w = fw->endb - (next = fw->next);
146 { next = rbuf;
162 next
[all...]
/macosx-10.9.5/less-23/less/
H A Dlinenum.c44 struct linenum_info *next; /* Link to next in the list */ member in struct:linenum_info
47 POSITION gap; /* Gap between prev and next */
52 * is the distance between the previous one and the next one in the list.
87 p->next = p+1;
88 pool[NPOOL-2].next = NULL;
96 anchor.next = anchor.prev = &anchor;
115 if (p == &anchor || p->next == &anchor)
117 p->gap = p->next->pos - p->prev->pos;
140 for (p = anchor.next;
[all...]
/macosx-10.9.5/gnutar-452/gnutar/lib/
H A Dhash.c184 while (cursor = cursor->next, cursor)
216 while (cursor = cursor->next, cursor)
260 for (cursor = bucket; cursor; cursor = cursor->next)
305 /* Find next entry in the same bucket. */
306 for (cursor = bucket; cursor; cursor = cursor->next)
307 if (cursor->data == entry && cursor->next)
308 return cursor->next->data;
335 for (cursor = bucket; cursor; cursor = cursor->next)
367 for (cursor = bucket; cursor; cursor = cursor->next)
612 struct hash_entry *next; local
650 struct hash_entry *next; local
767 struct hash_entry *next = bucket->next; local
792 struct hash_entry *next = cursor->next; local
822 struct hash_entry *next; local
[all...]
/macosx-10.9.5/Chess-310.5/sjeng/
H A Dlearn.c42 int number = 0, next = 0; local
69 fread(&next, sizeof(int), 1, *lrnfile);
76 next++;
77 if (next == 50000) next = 1;
79 fwrite(&next, sizeof(int), 1, *lrnfile);
81 fseek(*lrnfile, (2*sizeof(int)) + ((next-1)*sizeof(LearnType)), SEEK_SET);
/macosx-10.9.5/groff-38/groff/src/libs/libbib/
H A Dsearch.cpp48 search_item *tem = list->next;
68 for (pp = &list; *pp; pp = &(*pp)->next)
78 for (search_item *ptr = list; ptr; ptr = ptr->next)
97 int search_list_iterator::next(const char **pp, int *lenp, reference_id *ridp) function in class:search_list_iterator
102 if (iter->next(searcher, pp, lenp, ridp))
106 ptr = ptr->next;
112 : name(strsave(nm)), filename_id(fid), next(0)

Completed in 201 milliseconds

1234567891011>>