next 49 ext/charconv/charconv.c struct conv_guess_rec *next;
next 105 ext/charconv/charconv.c rec->next = guess.procs;
next 114 ext/charconv/charconv.c for (rec = guess.procs; rec; rec = rec->next) {
next 41 ext/charconv/guess.c unsigned int next; /* next state */
next 63 ext/charconv/guess.c dfa.state = dfa.arcs[arc__].next; \
next 247 gc/AmigaOS.c struct GC_Amiga_AllocedMemoryHeader *next;
next 320 gc/AmigaOS.c temp=gc_am->next;
next 364 gc/AmigaOS.c gc_am->next=GC_AMIGAMEM;
next 77 gc/aix_irix_threads.c struct GC_Thread_Rep * next; /* More recently allocated threads */
next 179 gc/aix_irix_threads.c result -> next = GC_threads[hv];
next 203 gc/aix_irix_threads.c p = p -> next;
next 206 gc/aix_irix_threads.c GC_threads[hv] = p -> next;
next 208 gc/aix_irix_threads.c prev -> next = p -> next;
next 228 gc/aix_irix_threads.c while (p != 0 && !pthread_equal(p -> id, id)) p = p -> next;
next 243 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 261 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 282 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 306 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 338 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 369 gc/aix_irix_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 341 gc/allchblk.c struct hblk *next = (struct hblk *)((word)h + hhdr -> hb_sz);
next 342 gc/allchblk.c hdr * nexthdr = HDR(next);
next 395 gc/allchblk.c struct hblk * h, *next;
next 405 gc/allchblk.c next = (struct hblk *)((word)h + size);
next 406 gc/allchblk.c GET_HDR(next, nexthdr);
next 414 gc/allchblk.c GC_remap((ptr_t)next, nextsize);
next 422 gc/allchblk.c GC_unmap((ptr_t)next, nextsize);
next 430 gc/allchblk.c GC_unmap_gap((ptr_t)h, size, (ptr_t)next, nexthdr -> hb_sz);
next 436 gc/allchblk.c GC_remove_header(next);
next 510 gc/allchblk.c struct hblk *next = hhdr -> hb_next;
next 514 gc/allchblk.c nhdr -> hb_next = next;
next 522 gc/allchblk.c if (0 != next) {
next 523 gc/allchblk.c HDR(next) -> hb_prev = n;
next 785 gc/allchblk.c struct hblk *next, *prev;
next 808 gc/allchblk.c next = (struct hblk *)((word)hbp + size);
next 809 gc/allchblk.c GET_HDR(next, nexthdr);
next 815 gc/allchblk.c GC_remove_header(next);
next 78 gc/cord/cordxtra.c register CORD next = va_arg(args, CORD);
next 79 gc/cord/cordxtra.c result = CORD_cat(result, next);
next 159 gc/cord/de.c size_t next;
next 171 gc/cord/de.c next = CORD_chr(current, cur, '\n');
next 172 gc/cord/de.c if (next == CORD_NOT_FOUND) next = current_len - 1;
next 173 gc/cord/de.c if (next < cur + *c) {
next 174 gc/cord/de.c *c = next - cur;
next 83 gc/darwin_stop_world.c for(p=GC_threads[i];p!=0;p=p->next) {
next 43 gc/finalize.c struct hash_chain_entry * next;
next 53 gc/finalize.c # define dl_next(x) (struct disappearing_link *)((x) -> prolog.next)
next 54 gc/finalize.c # define dl_set_next(x,y) (x) -> prolog.next = (struct hash_chain_entry *)(y)
next 73 gc/finalize.c # define fo_next(x) (struct finalizable_object *)((x) -> prolog.next)
next 74 gc/finalize.c # define fo_set_next(x,y) (x) -> prolog.next = (struct hash_chain_entry *)(y)
next 126 gc/finalize.c register struct hash_chain_entry *next = p -> next;
next 129 gc/finalize.c p -> next = new_table[new_hash];
next 131 gc/finalize.c p = next;
next 23 gc/include/private/pthread_support.h struct GC_Thread_Rep * next; /* More recently allocated threads */
next 12 gc/include/private/solaris_threads.h struct GC_Thread_Rep * next;
next 39 gc/include/private/specific.h struct thread_specific_entry *next;
next 870 gc/mark.c *next = p;
next 981 gc/mark.c mse *next;
next 428 gc/mark_rts.c struct exclusion * next;
next 432 gc/mark_rts.c next = 0;
next 434 gc/mark_rts.c next = GC_next_exclusion(start);
next 436 gc/mark_rts.c if (0 != next) {
next 437 gc/mark_rts.c if ((word)(next -> e_start) < (word) finish) {
next 441 gc/mark_rts.c if ((word)(next -> e_start) == (word) finish) {
next 443 gc/mark_rts.c next -> e_start = (ptr_t)start;
next 446 gc/mark_rts.c next_index = next - GC_excl_table;
next 465 gc/mark_rts.c struct exclusion * next;
next 469 gc/mark_rts.c next = GC_next_exclusion(bottom);
next 470 gc/mark_rts.c if (0 == next || (excl_start = next -> e_start) >= top) {
next 475 gc/mark_rts.c bottom = next -> e_end;
next 1235 gc/os_dep.c struct GC_malloc_heap_list *next;
next 1246 gc/os_dep.c q = q -> next;
next 1291 gc/os_dep.c new_l -> next = GC_malloc_heap_l;
next 244 gc/pthread_stop_world.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 315 gc/pthread_stop_world.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 426 gc/pthread_stop_world.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 298 gc/pthread_support.c ptr_t next = obj_link(my_entry);
next 300 gc/pthread_support.c *my_fl = next;
next 302 gc/pthread_support.c PREFETCH_FOR_WRITE(next);
next 538 gc/pthread_support.c for (p = GC_threads[i]; 0 != p; p = p -> next) {
next 573 gc/pthread_support.c result -> next = GC_threads[hv];
next 590 gc/pthread_support.c p = p -> next;
next 593 gc/pthread_support.c GC_threads[hv] = p -> next;
next 595 gc/pthread_support.c prev -> next = p -> next;
next 612 gc/pthread_support.c p = p -> next;
next 615 gc/pthread_support.c GC_threads[hv] = p -> next;
next 617 gc/pthread_support.c prev -> next = p -> next;
next 633 gc/pthread_support.c while (p != 0 && !pthread_equal(p -> id, id)) p = p -> next;
next 646 gc/pthread_support.c GC_thread p, next, me;
next 650 gc/pthread_support.c for (p = GC_threads[hv]; 0 != p; p = next) {
next 651 gc/pthread_support.c next = p -> next;
next 654 gc/pthread_support.c p -> next = 0;
next 681 gc/pthread_support.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 912 gc/reclaim.c ptr_t next = *flp;
next 914 gc/reclaim.c while (0 != next) {
next 916 gc/reclaim.c flp = &(obj_link(next));
next 917 gc/reclaim.c next = *flp;
next 426 gc/solaris_threads.c struct stack_head *next;
next 459 gc/solaris_threads.c GC_stack_free_lists[index] = GC_stack_free_lists[index]->next;
next 517 gc/solaris_threads.c head->next = GC_stack_free_lists[index];
next 541 gc/solaris_threads.c for (s = GC_stack_free_lists[i]; s != 0; s = s->next) {
next 588 gc/solaris_threads.c result -> next = GC_threads[hv];
next 606 gc/solaris_threads.c p = p -> next;
next 609 gc/solaris_threads.c GC_threads[hv] = p -> next;
next 611 gc/solaris_threads.c prev -> next = p -> next;
next 623 gc/solaris_threads.c while (p != 0 && p -> id != id) p = p -> next;
next 704 gc/solaris_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 727 gc/solaris_threads.c for (p = GC_threads[i]; p != 0; p = p -> next) {
next 754 gc/solaris_threads.c for (t = GC_threads[i]; t != 0; t = t -> next) {
next 866 gc/solaris_threads.c for (t = GC_threads[i]; t != 0; t = t -> next) {
next 30 gc/specific.c GC_ASSERT((unsigned long)(&invalid_tse.next) % sizeof(tse *) == 0);
next 54 gc/specific.c entry -> next = key -> hash[hash_val];
next 76 gc/specific.c link = &(entry -> next);
next 83 gc/specific.c *link = entry -> next;
next 113 gc/specific.c entry = entry -> next;
next 236 src/char.c for (r = cs->ranges; r; r = r->next) {
next 270 src/char.c for (rs = src->ranges; rs; rs = rs->next) {
next 274 src/char.c rd->next = SCM_NEW(struct ScmCharSetRange);
next 275 src/char.c rd = rd->next;
next 280 src/char.c if (rd) rd->next = NULL;
next 365 src/char.c for (rx=x->ranges, ry=y->ranges; rx && ry; rx=rx->next, ry=ry->next) {
next 383 src/char.c if (rx->lo > ry->hi) { ry = ry->next; continue; }
next 385 src/char.c rx = rx->next;
next 399 src/char.c n->next = next;
next 432 src/char.c for (lop = NULL, lo = cs->ranges; lo; lop = lo, lo = lo->next) {
next 436 src/char.c lop->next = newrange(from, to, NULL);
next 439 src/char.c for (hi = lo; hi; hi = hi->next) {
next 447 src/char.c else lop->next = newrange(from, to, lo);
next 454 src/char.c lo->next = hi;
next 458 src/char.c lo->next = hi->next;
next 464 src/char.c lo->next = hi;
next 467 src/char.c lo->next = hi->next;
next 481 src/char.c for (r = src->ranges; r; r = r->next) {
next 494 src/char.c for (p = NULL, r = cs->ranges; r; p = r, r = r->next) {
next 500 src/char.c cs->ranges = r->next;
next 506 src/char.c else p->next = newrange(last, SCM_CHAR_MAX, NULL);
next 535 src/char.c for (r = cs->ranges; r; r = r->next) {
next 571 src/char.c r = cs->ranges->next;
next 576 src/char.c for (; r; r = r->next) {
next 592 src/char.c for (r=cs->ranges; r; r=r->next)
next 1822 src/class.c void *next[3];
next 1826 src/class.c next[0] = obj;
next 1827 src/class.c next[1] = SCM_CDR(accs);
next 1828 src/class.c next[2] = initargs;
next 1829 src/class.c Scm_VMPushCC(object_initialize_cc, next, 3);
next 494 src/code.c cc_builder_chunk *next = bc->prev;
next 497 src/code.c bc = next;
next 244 src/core.c struct cleanup_handler_rec *next;
next 259 src/core.c r->next = cleanup.handlers;
next 273 src/core.c cleanup.handlers = y->next;
next 275 src/core.c x->next = y->next;
next 310 src/core.c for (ch = cleanup.handlers; ch; ch = ch->next) {
next 887 src/gauche.h struct ScmCharSetRange *next;
next 1142 src/gauche.h struct ScmDStringChainRec *next;
next 1739 src/gauche.h struct ScmHashEntryRec *next;
next 282 src/hash.c e->next = table->buckets[index];
next 300 src/hash.c f->next = newb[index];
next 314 src/hash.c if (prev) prev->next = entry->next;
next 315 src/hash.c else table->buckets[index] = entry->next;
next 333 src/hash.c for (e = table->buckets[index], p = NULL; e; p = e, e = e->next) {
next 402 src/hash.c for (e = table->buckets[index], p = NULL; e; p = e, e = e->next) {
next 459 src/hash.c for (e = table->buckets[index], p = NULL; e; p = e, e = e->next) {
next 488 src/hash.c for (e = table->buckets[index], p = NULL; e; p = e, e = e->next) {
next 648 src/hash.c if (e->next) iter->currentEntry = e->next;
next 757 src/hash.c for (; e; e = e->next) {
next 357 src/list.c ScmObj first, next, result = SCM_NIL;
next 359 src/list.c for (first = list; SCM_PAIRP(first); first = next) {
next 360 src/list.c next = SCM_CDR(first);
next 623 src/list.c ScmObj result = Scm_Cons(start, SCM_NIL), next, h;
next 641 src/list.c next = SCM_FALSE;
next 652 src/list.c next = h;
next 656 src/list.c if (SCM_FALSEP(next)) return SCM_FALSE; /* inconsistent */
next 659 src/list.c result = Scm_Cons(next, result);
next 661 src/list.c if (SCM_PAIRP(*sp) && SCM_EQ(next, SCM_CAR(*sp))) {
next 2377 src/number.c goto next;
next 2385 src/number.c next:
next 1053 src/read.c ScmChar next;
next 1056 src/read.c next = Scm_GetcUnsafe(port);
next 1057 src/read.c if (next != '(') {
next 1059 src/read.c next);
next 1661 src/regexp.c struct match_list *next;
next 1683 src/regexp.c elt->next = mlist;
next 1943 src/regexp.c for (ml = ctx->matches; ml; ml = ml->next) {
next 1418 src/string.c for (chain = dstr->anchor; chain; chain = chain->next) {
next 1456 src/string.c newchain->next = NULL;
next 1459 src/string.c dstr->tail->next = newchain;
next 1491 src/string.c for (; chain; chain = chain->next) {
next 1571 src/string.c for (i=1, chain = dstr->anchor; chain; chain = chain->next, i++) {
next 1572 src/string.c int size = (chain->next? chain->chunk->bytes : (int)(dstr->current - dstr->tail->chunk->data));
next 798 src/vm.c ScmWord *next;
next 800 src/vm.c FETCH_LOCATION(next);
next 801 src/vm.c PUSH_CONT(next);
next 2506 src/vm.c ScmEnvFrame *e = env_begin, *prev = NULL, *next, *head = NULL, *saved;
next 2527 src/vm.c next = e->up;
next 2531 src/vm.c e = next;