/macosx-10.10.1/emacs-93/emacs/oldXMenu/ |
H A D | XDestAssoc.c | 24 Entry = bucket->next; 28 entry_next = Entry->next;
|
/macosx-10.10.1/ICU-531.30/icuSources/layout/ |
H A D | LEInsertionList.cpp | 17 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.10.1/JavaScriptCore-7600.1.17/heap/ |
H A D | WeakSet.cpp | 37 WeakBlock* next = 0; local 38 for (WeakBlock* block = m_blocks.head(); block; block = next) { 39 next = block->next(); 47 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 65 m_nextAllocator = m_nextAllocator->next();
|
/macosx-10.10.1/Libc-1044.1.2/stdlib/FreeBSD/ |
H A D | rand.c | 95 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.10.1/ksh-23/ksh/src/lib/libast/comp/ |
H A D | atexit.c | 55 struct list* next; 70 p->next = funclist; 82 funclist = p->next;
|
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | SentinelLinkedList.h | 35 // Node* next(); 60 void setNext(BasicRawSentinelNode* next) { m_next = next; } argument 63 T* next() { return static_cast<T*>(m_next); } function in class:WTF::BasicRawSentinelNode 117 return static_cast<T*>(m_headSentinel.next()); 129 ASSERT(!node->next()); 132 RawNode* next = m_headSentinel.next(); local 135 node->setNext(next); 138 next 148 RawNode* next = node->next(); local [all...] |
/macosx-10.10.1/emacs-93/emacs/src/ |
H A D | atimer.c | 49 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.10.1/ntp-92/ntpd/ |
H A D | ntp_restrict.c | 113 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.10.1/BerkeleyDB-21/db/os/ |
H A D | os_addrinfo.c | 163 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.10.1/WebInspectorUI-7600.1.17/UserInterface/External/CodeMirror/ |
H A D | sass.js | 31 stream.next(); 35 stream.next(); 40 state.tokenizer = buildStringTokenizer(stream.next()); 49 stream.next(); 50 stream.next(); 53 stream.next(); 63 var nextChar = stream.next(); 77 if (nextChar !== quote && greedy) { stream.next(); } 82 stream.next(); 95 stream.next(); [all...] |
/macosx-10.10.1/groff-38/groff/src/libs/libxutil/ |
H A D | DviChar.c | 17 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.10.1/ksh-23/ksh/src/lib/libast/sfio/ |
H A D | sfputr.c | 52 if((f->flags&SF_STRING) && f->next >= f->endb ) 78 f->next = ps; 103 f->next = ps; 111 else ps = f->next+p; 112 s += ps - f->next; 118 w += ps - f->next; 119 f->next = ps; 127 else if((f->flags&SF_LINE) && !(f->flags&SF_STRING) && (n = f->next-f->data) > 0) 130 f->next -= n; 131 (void)SFWRITE(f,(Void_t*)f->next, [all...] |
H A D | sfmove.c | 43 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.10.1/libxml2-26/libxml2/ |
H A D | list.c | 33 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.10.1/pyobjc-45/2.5/pyobjc/pyobjc-core/Modules/objc/ |
H A D | closure_pool.m | 10 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.10.1/pyobjc-45/2.6/pyobjc/pyobjc-core/Modules/objc/ |
H A D | closure_pool.m | 10 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.10.1/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/ |
H A D | list.c | 33 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.10.1/pyobjc-45/pyobjc/pyobjc-core-2.5.1/Modules/objc/ |
H A D | closure_pool.m | 10 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.10.1/gnudiff-19/diffutils/src/ |
H A D | context.c | 207 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.10.1/apache-793/httpd/modules/slotmem/ |
H A D | mod_slotmem_plain.c | 33 struct ap_slotmem_instance_t *next; /* location of next allocated segment */ member in struct:ap_slotmem_instance_t 69 ap_slotmem_instance_t *next = globallistmem; local 81 if (next) { 83 if (strcmp(next->name, fname) == 0) { 85 *new = next; 88 if (!next->next) { 91 next = next 122 ap_slotmem_instance_t *next = globallistmem; local [all...] |
/macosx-10.10.1/less-25/less/ |
H A D | linenum.c | 44 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.10.1/gnutar-453/gnutar/lib/ |
H A D | hash.c | 184 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.10.1/Chess-310.6/sjeng/ |
H A D | learn.c | 42 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.10.1/groff-38/groff/src/libs/libbib/ |
H A D | search.cpp | 48 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)
|
/macosx-10.10.1/postfix-255/postfix/src/qmgr/ |
H A D | qmgr.h | 51 head.next->peers.prev = head.prev; \ 52 head.prev->peers.next = head.next; \ 53 head.next = object->peers.next; \ 54 head.next->peers.prev = 0; \ 56 object->peers.next = 0; \ 60 type _next = object->peers.next; \ 62 if (_prev) _prev->peers.next = _next; \ 63 else head.next 110 QMGR_TRANSPORT *next; member in struct:QMGR_TRANSPORT_LIST 160 QMGR_QUEUE *next; member in struct:QMGR_QUEUE_LIST 165 QMGR_JOB *next; member in struct:QMGR_JOB_LIST 230 QMGR_ENTRY *next; member in struct:QMGR_ENTRY_LIST 400 QMGR_PEER *next; member in struct:QMGR_PEER_LIST [all...] |