next 29 TSRM/TSRM.c tsrm_tls_entry *next; next 176 TSRM/TSRM.c next_p = p->next; next 260 TSRM/TSRM.c p = p->next; next 279 TSRM/TSRM.c (*thread_resources_ptr)->next = NULL; next 358 TSRM/TSRM.c if (thread_resources->next) { next 359 TSRM/TSRM.c thread_resources = thread_resources->next; next 361 TSRM/TSRM.c allocate_new_resource(&thread_resources->next, thread_id); next 385 TSRM/TSRM.c tsrm_tls_entry *next, *thread_resources = (tsrm_tls_entry*)context; next 389 TSRM/TSRM.c next = thread_resources->next; next 401 TSRM/TSRM.c thread_resources = next; next 466 TSRM/TSRM.c last->next = thread_resources->next; next 468 TSRM/TSRM.c tsrm_tls_table[hash_value] = thread_resources->next; next 474 TSRM/TSRM.c if (thread_resources->next) { next 477 TSRM/TSRM.c thread_resources = thread_resources->next; next 508 TSRM/TSRM.c last->next = thread_resources->next; next 510 TSRM/TSRM.c tsrm_tls_table[hash_value] = thread_resources->next; next 514 TSRM/TSRM.c thread_resources = last->next; next 519 TSRM/TSRM.c if (thread_resources->next) { next 522 TSRM/TSRM.c thread_resources = thread_resources->next; next 551 TSRM/TSRM.c p = p->next; next 600 TSRM/tsrm_virtual_cwd.c p = p->next; next 623 TSRM/tsrm_virtual_cwd.c *bucket = (*bucket)->next; next 635 TSRM/tsrm_virtual_cwd.c bucket = &(*bucket)->next; next 684 TSRM/tsrm_virtual_cwd.c bucket->next = CWDG(realpath_cache)[n]; next 705 TSRM/tsrm_virtual_cwd.c *bucket = (*bucket)->next; next 718 TSRM/tsrm_virtual_cwd.c bucket = &(*bucket)->next; next 225 TSRM/tsrm_virtual_cwd.h struct _realpath_cache_bucket *next; next 761 Zend/zend_alloc.c zend_mm_free_block *next = prev->next_free_block; next 763 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block; next 764 Zend/zend_alloc.c mm_block->next_free_block = next; next 772 Zend/zend_alloc.c zend_mm_free_block *prev, *next; next 780 Zend/zend_alloc.c next = prev->next_free_block; next 783 Zend/zend_alloc.c mm_block->next_free_block = next; next 784 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block; next 791 Zend/zend_alloc.c zend_mm_free_block *next = mm_block->next_free_block; next 799 Zend/zend_alloc.c if (UNEXPECTED(next != mm_block)) { next 837 Zend/zend_alloc.c if (UNEXPECTED(prev->next_free_block != mm_block) || UNEXPECTED(next->prev_free_block != mm_block)) { next 842 Zend/zend_alloc.c prev->next_free_block = next; next 843 Zend/zend_alloc.c next->prev_free_block = prev; next 846 Zend/zend_alloc.c if (EXPECTED(prev == next)) { next 863 Zend/zend_alloc.c zend_mm_free_block *prev, *next; next 872 Zend/zend_alloc.c next = p->next_free_block; next 873 Zend/zend_alloc.c prev->next_free_block = next; next 874 Zend/zend_alloc.c next->prev_free_block = prev; next 886 Zend/zend_alloc.c next = prev->next_free_block; next 888 Zend/zend_alloc.c mm_block->next_free_block = next; next 889 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block; next 1267 Zend/zend_compile.c for (le=jmp_list_ptr->head; le; le = le->next) { next 1326 Zend/zend_compile.c le = le->next; next 1344 Zend/zend_compile.c le = le->next; next 1383 Zend/zend_compile.c le = le->next; next 5888 Zend/zend_compile.c dimension = dimension->next; next 5894 Zend/zend_compile.c le = le->next; next 234 Zend/zend_extensions.c for (element = zend_extensions.head; element; element = element->next) { next 48 Zend/zend_gc.c gc_globals->roots.next = &gc_globals->roots; next 106 Zend/zend_gc.c GC_G(roots).next = &GC_G(roots); next 176 Zend/zend_gc.c newRoot->next = GC_G(roots).next; next 178 Zend/zend_gc.c GC_G(roots).next->prev = newRoot; next 179 Zend/zend_gc.c GC_G(roots).next = newRoot; next 232 Zend/zend_gc.c newRoot->next = GC_G(roots).next; next 234 Zend/zend_gc.c GC_G(roots).next->prev = newRoot; next 235 Zend/zend_gc.c GC_G(roots).next = newRoot; next 260 Zend/zend_gc.c GC_G(next_to_free) = ((zval_gc_info*)zv)->u.next; next 480 Zend/zend_gc.c gc_root_buffer *current = GC_G(roots).next; next 507 Zend/zend_gc.c current = current->next; next 616 Zend/zend_gc.c gc_root_buffer *current = GC_G(roots).next; next 629 Zend/zend_gc.c current = current->next; next 659 Zend/zend_gc.c ((zval_gc_info*)pz)->u.next = GC_G(zval_to_free); next 692 Zend/zend_gc.c ((zval_gc_info*)pz)->u.next = GC_G(zval_to_free); next 756 Zend/zend_gc.c gc_root_buffer *current = GC_G(roots).next; next 776 Zend/zend_gc.c current = current->next; next 786 Zend/zend_gc.c if (GC_G(roots).next != &GC_G(roots)) { next 821 Zend/zend_gc.c p = p->u.next; next 827 Zend/zend_gc.c GC_G(next_to_free) = p->u.next; next 850 Zend/zend_gc.c q = p->u.next; next 83 Zend/zend_gc.h struct _gc_root_buffer *next; next 95 Zend/zend_gc.h struct _zval_gc_info *next; next 189 Zend/zend_gc.h root->next->prev = root->prev; next 190 Zend/zend_gc.h root->prev->next = root->next; next 724 Zend/zend_generators.c ZEND_ME(Generator, next, arginfo_generator_void, ZEND_ACC_PUBLIC) next 499 Zend/zend_interfaces.c ZEND_ABSTRACT_ME(iterator, next, NULL) next 42 Zend/zend_llist.c tmp->next = NULL; next 44 Zend/zend_llist.c l->tail->next = tmp; next 59 Zend/zend_llist.c tmp->next = l->head; next 75 Zend/zend_llist.c (current)->prev->next = (current)->next;\ next 77 Zend/zend_llist.c (l)->head = (current)->next;\ next 79 Zend/zend_llist.c if ((current)->next) {\ next 80 Zend/zend_llist.c (current)->next->prev = (current)->prev;\ next 100 Zend/zend_llist.c current = current->next; next 107 Zend/zend_llist.c zend_llist_element *current=l->head, *next; next 110 Zend/zend_llist.c next = current->next; next 115 Zend/zend_llist.c current = next; next 136 Zend/zend_llist.c old_tail->prev->next = NULL; next 166 Zend/zend_llist.c ptr = ptr->next; next 173 Zend/zend_llist.c zend_llist_element *element, *next; next 177 Zend/zend_llist.c next = element->next; next 181 Zend/zend_llist.c element = next; next 190 Zend/zend_llist.c for (element=l->head; element; element=element->next) { next 210 Zend/zend_llist.c for (element=l->head; element; element=element->next) { next 221 Zend/zend_llist.c elements[i-1]->next = elements[i]; next 223 Zend/zend_llist.c elements[i-1]->next = NULL; next 233 Zend/zend_llist.c for (element=l->head; element; element=element->next) { next 245 Zend/zend_llist.c for (element=l->head; element; element=element->next) { next 289 Zend/zend_llist.c *current = (*current)->next; next 26 Zend/zend_llist.h struct _zend_llist_element *next; next 114 Zend/zend_objects_API.c EG(objects_store).free_list_head = EG(objects_store).object_buckets[handle].bucket.free_list.next; next 167 Zend/zend_objects_API.c EG(objects_store).object_buckets[handle].bucket.free_list.next = EG(objects_store).free_list_head; \ next 46 Zend/zend_objects_API.h int next; next 93 Zend/zend_signal.c qtmp = queue->next; next 94 Zend/zend_signal.c queue->next = SIGG(pavail); next 105 Zend/zend_signal.c SIGG(pavail) = queue->next; next 109 Zend/zend_signal.c queue->next = NULL; next 112 Zend/zend_signal.c SIGG(ptail)->next = queue; next 142 Zend/zend_signal.c SIGG(phead) = queue->next; next 144 Zend/zend_signal.c queue->next = SIGG(pavail); next 333 Zend/zend_signal.c queue->next = zend_signal_globals->pavail; next 52 Zend/zend_signal.h struct _zend_signal_queue_t *next; next 419 Zend/zend_strtod.c struct Bigint *next; next 487 Zend/zend_strtod.c freelist[k] = rv->next; next 507 Zend/zend_strtod.c v->next = freelist[v->k]; next 805 Zend/zend_strtod.c p5->next = 0; next 816 Zend/zend_strtod.c if (!(p51 = p5->next)) { next 817 Zend/zend_strtod.c if (!(p51 = p5->next)) { next 818 Zend/zend_strtod.c p51 = p5->next = mult(p5,p5); next 819 Zend/zend_strtod.c p51->next = 0; next 1391 Zend/zend_strtod.c *listp = tmp->next; next 2021 Zend/zend_strtod.c p5s = p5s->next; next 2578 Zend/zend_strtod.c p5s = p5s->next; next 48 ext/bcmath/libbcmath/src/output.c struct stk_rec *next; next 158 ext/bcmath/libbcmath/src/output.c temp->next = digits; next 170 ext/bcmath/libbcmath/src/output.c digits = digits->next; next 407 ext/com_dotnet/com_wrapper.c ulong next = id+1; next 410 ext/com_dotnet/com_wrapper.c while(!zend_hash_index_exists(disp->dispid_to_name, next)) next 411 ext/com_dotnet/com_wrapper.c next++; next 413 ext/com_dotnet/com_wrapper.c if (zend_hash_index_exists(disp->dispid_to_name, next)) { next 414 ext/com_dotnet/com_wrapper.c *pid = next; next 1848 ext/curl/interface.c for(slist = ci->certinfo[i]; slist; slist = slist->next) { next 3169 ext/curl/interface.c slist = slist->next; next 86 ext/dba/libcdb/cdb_make.c head->next = c->head; next 153 ext/dba/libcdb/cdb_make.c for (x = c->head; x; x = x->next) { next 186 ext/dba/libcdb/cdb_make.c for (x = c->head; x; x = x->next) { next 225 ext/dba/libcdb/cdb_make.c x = x->next; next 38 ext/dba/libcdb/cdb_make.h struct cdb_hplist *next; next 106 ext/dba/libinifile/inifile.c inifile_line_free(&dba->next); next 250 ext/dba/libinifile/inifile.c if (skip == -1 && dba->next.key.group && dba->next.key.name && !inifile_key_cmp(&dba->next.key, key TSRMLS_CC)) { next 252 ext/dba/libinifile/inifile.c php_stream_seek(dba->fp, dba->next.pos, SEEK_SET); next 257 ext/dba/libinifile/inifile.c inifile_line_free(&dba->next); next 267 ext/dba/libinifile/inifile.c inifile_line_free(&dba->next); next 268 ext/dba/libinifile/inifile.c dba->next = ln; next 269 ext/dba/libinifile/inifile.c dba->next.pos = php_stream_tell(dba->fp); next 281 ext/dba/libinifile/inifile.c dba->next.pos = php_stream_tell(dba->fp); next 335 ext/dba/libinifile/inifile.c inifile_line_free(&dba->next); next 45 ext/dba/libinifile/inifile.h line_type next; next 1860 ext/dom/document.c cur = cur->next; next 1880 ext/dom/document.c cur = cur->next; next 1890 ext/dom/document.c cur = cur->next; next 1921 ext/dom/document.c root = root->next; next 2338 ext/dom/document.c for (node = node->children; node; node = node->next) { next 103 ext/dom/documentfragment.c cur = cur->next; next 106 ext/dom/documentfragment.c prop = prop->next; next 113 ext/dom/documentfragment.c cur = cur->next; next 214 ext/dom/dom_iterators.c curnode = curnode->next; next 297 ext/dom/element.c ns = ns->next; next 316 ext/dom/element.c nsPtr = nsPtr->next; next 794 ext/dom/element.c tmpnsptr = nsptr->next; next 801 ext/dom/element.c tmpnsptr = tmpnsptr->next; next 107 ext/dom/namednodemap.c while (curnode->next != NULL) { next 109 ext/dom/namednodemap.c curnode = curnode->next; next 238 ext/dom/namednodemap.c curnode = (xmlNodePtr)curnode->next; next 171 ext/dom/node.c nsdftptr = curns->next; next 175 ext/dom/node.c curns->next = NULL; next 179 ext/dom/node.c prevns->next = nsdftptr; next 598 ext/dom/node.c nextsib = nodep->next; next 821 ext/dom/node.c curns = curns->next; next 960 ext/dom/node.c prevsib->next = newchild; next 966 ext/dom/node.c fragment->last->next = nextsib; next 984 ext/dom/node.c node = node->next; next 1066 ext/dom/node.c new_child->next = refp; next 1070 ext/dom/node.c new_child->prev->next = new_child; next 1116 ext/dom/node.c child->next = new_child; next 1211 ext/dom/node.c children = children->next; next 1218 ext/dom/node.c nextsib = oldchild->next; next 1287 ext/dom/node.c children = children->next; next 1361 ext/dom/node.c child->next = new_child; next 76 ext/dom/nodelist.c while (curnode->next != NULL) { next 78 ext/dom/nodelist.c curnode = curnode->next; next 149 ext/dom/nodelist.c curnode = curnode->next; next 1054 ext/dom/php_dom.c node = node->next; next 1500 ext/dom/php_dom.c nodep = nodep->next; next 1518 ext/dom/php_dom.c nextp = child->next; next 1521 ext/dom/php_dom.c newnextp = nextp->next; next 1538 ext/dom/php_dom.c attr = attr->next; next 1547 ext/dom/php_dom.c child = child->next; next 1572 ext/dom/php_dom.c while (cur->next != NULL) { next 1573 ext/dom/php_dom.c cur = cur->next; next 1575 ext/dom/php_dom.c cur->next = ns; next 1661 ext/dom/php_dom.c cur = cur->next; next 1670 ext/dom/php_dom.c cur = cur->next; next 125 ext/dom/text.c node = node->next; next 51 ext/enchant/enchant.c enchant_dict *next; next 275 ext/enchant/enchant.c pdict->pbroker->dict[pdict->id-1]->next = NULL; next 567 ext/enchant/enchant.c dict->next = NULL; next 571 ext/enchant/enchant.c pbroker->dict[pos-1]->next = dict; next 623 ext/enchant/enchant.c dict->next = NULL; next 626 ext/enchant/enchant.c pbroker->dict[pos-1]->next = dict; next 22 ext/ereg/regex/regcomp.c unsigned char *next; /* next character in RE */ next 43 ext/ereg/regex/regcomp.c #define PEEK() (*p->next) next 44 ext/ereg/regex/regcomp.c #define PEEK2() (*(p->next+1)) next 45 ext/ereg/regex/regcomp.c #define MORE() (p->next < p->end) next 46 ext/ereg/regex/regcomp.c #define MORE2() (p->next+1 < p->end) next 51 ext/ereg/regex/regcomp.c #define NEXT() (p->next++) next 52 ext/ereg/regex/regcomp.c #define NEXT2() (p->next += 2) next 53 ext/ereg/regex/regcomp.c #define NEXTn(n) (p->next += (n)) next 54 ext/ereg/regex/regcomp.c #define GETNEXT() (*p->next++) next 130 ext/ereg/regex/regcomp.c p->next = (unsigned char *)pattern; /* convenience; we do not modify it */ next 131 ext/ereg/regex/regcomp.c p->end = p->next + len; next 589 ext/ereg/regex/regcomp.c if (p->next + 5 < p->end && strncmp(p->next, "[:<:]]", 6) == 0) { next 594 ext/ereg/regex/regcomp.c if (p->next + 5 < p->end && strncmp(p->next, "[:>:]]", 6) == 0) { next 726 ext/ereg/regex/regcomp.c register unsigned char *sp = p->next; next 734 ext/ereg/regex/regcomp.c len = p->next - sp; next 797 ext/ereg/regex/regcomp.c register unsigned char *sp = p->next; next 807 ext/ereg/regex/regcomp.c len = p->next - sp; next 845 ext/ereg/regex/regcomp.c register unsigned char *oldnext = p->next; next 850 ext/ereg/regex/regcomp.c p->next = bracket; next 856 ext/ereg/regex/regcomp.c assert(p->next == bracket+2); next 857 ext/ereg/regex/regcomp.c p->next = oldnext; next 891 ext/ereg/regex/regcomp.c register unsigned char *oldnext = p->next; next 895 ext/ereg/regex/regcomp.c p->next = bracket; next 902 ext/ereg/regex/regcomp.c assert(p->next == bracket+3); next 903 ext/ereg/regex/regcomp.c p->next = oldnext; next 990 ext/ereg/regex/regcomp.c p->next = nuls; /* try to bring things to a halt */ next 375 ext/fileinfo/libmagic/apprentice.c mlp->prev->next = ml; next 377 ext/fileinfo/libmagic/apprentice.c ml->next = mlp; next 515 ext/fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist; next 527 ext/fileinfo/libmagic/apprentice.c for (ml = mlist->next; ml != mlist;) { next 528 ext/fileinfo/libmagic/apprentice.c struct mlist *next = ml->next; next 532 ext/fileinfo/libmagic/apprentice.c ml = next; next 799 ext/fileinfo/libmagic/apprentice.c for (ml = mlist->next; ml != mlist; ml = ml->next) { next 3009 ext/fileinfo/libmagic/apprentice.c for (ml = mlist->next; ml != mlist; ml = ml->next) { next 354 ext/fileinfo/libmagic/file.h struct mlist *next, *prev; next 81 ext/fileinfo/libmagic/softmagic.c for (ml = ms->mlist[0]->next; ml != ms->mlist[0]; ml = ml->next) next 84 ext/gd/gdcache.c elem = elem->next; next 107 ext/gd/gdcache.c prev->next = elem->next; next 108 ext/gd/gdcache.c elem->next = head->mru; next 115 ext/gd/gdcache.c elem = elem->next; next 128 ext/gd/gdcache.c prevprev->next = NULL; next 133 ext/gd/gdcache.c elem->next = head->mru; next 60 ext/gd/gdcache.h gdCache_element_t *next; next 425 ext/gd/libgd/gd_jpeg.c marker = marker->next; next 84 ext/gd/libgd/gdcache.c elem = elem->next; next 105 ext/gd/libgd/gdcache.c prev->next = elem->next; next 106 ext/gd/libgd/gdcache.c elem->next = head->mru; next 113 ext/gd/libgd/gdcache.c elem = elem->next; next 129 ext/gd/libgd/gdcache.c prevprev->next = NULL; next 134 ext/gd/libgd/gdcache.c elem->next = head->mru; next 59 ext/gd/libgd/gdcache.h gdCache_element_t *next; next 791 ext/gd/libgd/gdft.c char *next; next 916 ext/gd/libgd/gdft.c next = tmpstr; next 919 ext/gd/libgd/gdft.c next = string; next 924 ext/gd/libgd/gdft.c while (*next) { next 925 ext/gd/libgd/gdft.c ch = *next; next 934 ext/gd/libgd/gdft.c next++; next 939 ext/gd/libgd/gdft.c if (!*(++next)) break; next 964 ext/gd/libgd/gdft.c len = gdTcl_UtfToUniChar (next, &ch); next 966 ext/gd/libgd/gdft.c next += len; next 975 ext/gd/libgd/gdft.c len = gdTcl_UtfToUniChar(next, &ch); next 976 ext/gd/libgd/gdft.c next += len; next 983 ext/gd/libgd/gdft.c c = *next; next 985 ext/gd/libgd/gdft.c next++; next 986 ext/gd/libgd/gdft.c jiscode = 0x100 * (c & 0x7F) + ((*next) & 0x7F); next 1009 ext/gd/libgd/gdft.c if (*next) next++; next 1018 ext/gd/libgd/gdft.c ch = (*next) & 0xFF; /* don't extend sign */ next 1019 ext/gd/libgd/gdft.c next++; next 1021 ext/gd/libgd/gdft.c && *next) { /* don't advance past '\0' */ next 1023 ext/gd/libgd/gdft.c ch = (ch * 256) + ((*next) & 255); next 1024 ext/gd/libgd/gdft.c next++; next 674 ext/imap/php_imap.c FOBJECTLIST *cur, *next; next 676 ext/imap/php_imap.c for (cur=*foblist, next=cur->next; cur; cur=next) { next 677 ext/imap/php_imap.c next = cur->next; next 714 ext/imap/php_imap.c mail_free_errorlist (&(*errlist)->next); next 740 ext/imap/php_imap.c MESSAGELIST *cur, *next; next 742 ext/imap/php_imap.c for (cur = *msglist, next = cur->next; cur; cur = next) { next 743 ext/imap/php_imap.c next = cur->next; next 768 ext/imap/php_imap.c for(; qlist; qlist = qlist->next) { next 795 ext/imap/php_imap.c for(; alist; alist = alist->next) { next 1084 ext/imap/php_imap.c ecur = ecur->next; next 1096 ext/imap/php_imap.c acur = acur->next; next 1485 ext/imap/php_imap.c limits.next = NIL; next 1866 ext/imap/php_imap.c cur=cur->next; next 1917 ext/imap/php_imap.c cur=cur->next; next 1951 ext/imap/php_imap.c cur=cur->next; next 2173 ext/imap/php_imap.c cur=cur->next; next 2223 ext/imap/php_imap.c cur=cur->next; next 2623 ext/imap/php_imap.c addr->next=NIL; next 2677 ext/imap/php_imap.c } while ((addresstmp = addresstmp->next)); next 3129 ext/imap/php_imap.c mypgm->next = NIL; next 3349 ext/imap/php_imap.c } while ((dpar = dpar->next)); next 3372 ext/imap/php_imap.c } while ((par = par->next)); next 3427 ext/imap/php_imap.c env->from->next=NULL; next 3434 ext/imap/php_imap.c env->to->next = NULL; next 3550 ext/imap/php_imap.c custom_headers_param->next = tmp_param; next 3579 ext/imap/php_imap.c tmp_param->next = bod->parameter; next 3593 ext/imap/php_imap.c disp_param->next = tmp_param; next 3627 ext/imap/php_imap.c disp_param->next = tmp_param; next 3672 ext/imap/php_imap.c mypart->next = mail_newbody_part(); next 3673 ext/imap/php_imap.c mypart = mypart->next; next 3692 ext/imap/php_imap.c tmp_param->next = bod->parameter; next 3706 ext/imap/php_imap.c disp_param->next = tmp_param; next 3740 ext/imap/php_imap.c disp_param->next = tmp_param; next 3772 ext/imap/php_imap.c if (bod && bod->type == TYPEMULTIPART && (!bod->nested.part || !bod->nested.part->next)) { next 3800 ext/imap/php_imap.c } while ((custom_headers_param = custom_headers_param->next)); next 3822 ext/imap/php_imap.c for (param = bod->parameter; param && !cookie; param = param->next) { next 3855 ext/imap/php_imap.c } while ((part = part->next)); /* until done */ next 3936 ext/imap/php_imap.c addr = addr->next; next 3965 ext/imap/php_imap.c addr = addr->next; next 3991 ext/imap/php_imap.c addr = addr->next; next 4124 ext/imap/php_imap.c cur = cur->next; next 4151 ext/imap/php_imap.c cur = cur->next; next 4178 ext/imap/php_imap.c cur = cur->next; next 4202 ext/imap/php_imap.c if (cur->next == NIL) { next 4205 ext/imap/php_imap.c cur = cur->next; next 4389 ext/imap/php_imap.c } while ((tmp = tmp->next)); next 4440 ext/imap/php_imap.c } while ((addresstmp = addresstmp->next)); next 4601 ext/imap/php_imap.c } while ((dpar = dpar->next)); next 4624 ext/imap/php_imap.c } while ((par = par->next)); next 4636 ext/imap/php_imap.c for (part = body->CONTENT_PART; part; part = part->next) { next 4672 ext/imap/php_imap.c if(cur->next) { next 4675 ext/imap/php_imap.c build_thread_tree_helper(cur->next, tree, numNodes, buf); next 4858 ext/imap/php_imap.c IMAPG(imap_messages)->next = NIL; next 4862 ext/imap/php_imap.c cur->next = mail_newmessagelist(); next 4863 ext/imap/php_imap.c cur = cur->next; next 4865 ext/imap/php_imap.c cur->next = NIL; next 4892 ext/imap/php_imap.c IMAPG(imap_alertstack)->next = NIL; next 4895 ext/imap/php_imap.c while (cur->next != NIL) { next 4896 ext/imap/php_imap.c cur = cur->next; next 4898 ext/imap/php_imap.c cur->next = mail_newstringlist (); next 4899 ext/imap/php_imap.c cur = cur->next; next 4901 ext/imap/php_imap.c cur->next = NIL; next 4920 ext/imap/php_imap.c IMAPG(imap_folder_objects)->next = NIL; next 4924 ext/imap/php_imap.c ocur->next=mail_newfolderobjectlist(); next 4925 ext/imap/php_imap.c ocur=ocur->next; next 4929 ext/imap/php_imap.c ocur->next = NIL; next 4939 ext/imap/php_imap.c IMAPG(imap_folders)->next=NIL; next 4943 ext/imap/php_imap.c cur->next=mail_newstringlist (); next 4944 ext/imap/php_imap.c cur=cur->next; next 4946 ext/imap/php_imap.c cur->next = NIL; next 4967 ext/imap/php_imap.c IMAPG(imap_sfolder_objects)->next = NIL; next 4971 ext/imap/php_imap.c ocur->next=mail_newfolderobjectlist(); next 4972 ext/imap/php_imap.c ocur=ocur->next; next 4976 ext/imap/php_imap.c ocur->next = NIL; next 4984 ext/imap/php_imap.c IMAPG(imap_sfolders)->next=NIL; next 4988 ext/imap/php_imap.c cur->next=mail_newstringlist (); next 4989 ext/imap/php_imap.c cur=cur->next; next 4991 ext/imap/php_imap.c cur->next = NIL; next 5030 ext/imap/php_imap.c IMAPG(imap_errorstack)->next = NIL; next 5033 ext/imap/php_imap.c while (cur->next != NIL) { next 5034 ext/imap/php_imap.c cur = cur->next; next 5036 ext/imap/php_imap.c cur->next = mail_newerrorlist(); next 5037 ext/imap/php_imap.c cur = cur->next; next 5040 ext/imap/php_imap.c cur->next = NIL; next 84 ext/imap/php_imap.h struct php_imap_mailbox_struct *next; next 90 ext/imap/php_imap.h struct php_imap_error_struct *next; next 95 ext/imap/php_imap.h struct _php_imap_message_struct *next; next 906 ext/interbase/ibase_query.c ib_query->link->tr_list->next = NULL; next 910 ext/interbase/ibase_query.c for (l = &ib_query->link->tr_list; *l != NULL; l = &(*l)->next); next 913 ext/interbase/ibase_query.c (*l)->next = NULL; next 619 ext/interbase/interbase.c l = l->next; next 686 ext/interbase/interbase.c for (l = &trans->db_link[i]->tr_list; *l != NULL; l = &(*l)->next) { next 689 ext/interbase/interbase.c *l = p->next; next 1112 ext/interbase/interbase.c for (l = ib_link->tr_list; l != NULL; l = l->next) { next 1261 ext/interbase/interbase.c ib_link[i]->tr_list->next = NULL; next 1265 ext/interbase/interbase.c for (l = &ib_link[i]->tr_list; *l != NULL; l = &(*l)->next); next 1268 ext/interbase/interbase.c (*l)->next = NULL; next 1286 ext/interbase/interbase.c ib_link->tr_list->next = NULL; next 89 ext/interbase/php_ibase_includes.h struct tr_list *next; next 294 ext/intl/breakiterator/breakiterator_class.cpp PHP_ME_MAPPING(next, breakiter_next, ainfo_biter_next, ZEND_ACC_PUBLIC) next 69 ext/intl/breakiterator/breakiterator_iterators.cpp int32_t pos = biter->next(); next 156 ext/intl/breakiterator/breakiterator_iterators.cpp next; next 162 ext/intl/breakiterator/breakiterator_iterators.cpp next = bio->biter->next(); next 163 ext/intl/breakiterator/breakiterator_iterators.cpp if (next == BreakIterator::DONE) { next 170 ext/intl/breakiterator/breakiterator_iterators.cpp iter->index = next; next 180 ext/intl/breakiterator/breakiterator_iterators.cpp if (next == BreakIterator::DONE) { next 181 ext/intl/breakiterator/breakiterator_iterators.cpp next = slen; next 183 ext/intl/breakiterator/breakiterator_iterators.cpp assert(next <= slen && next >= cur); next 184 ext/intl/breakiterator/breakiterator_iterators.cpp len = next - cur; next 290 ext/intl/breakiterator/breakiterator_methods.cpp &BreakIterator::next, next 294 ext/intl/breakiterator/breakiterator_methods.cpp &BreakIterator::next, next 61 ext/intl/breakiterator/codepointiterator_internal.h virtual int32_t next(void); next 71 ext/intl/breakiterator/codepointiterator_internal.h virtual int32_t next(int32_t n); next 91 ext/intl/common/common_enum.cpp const char *result = ((StringEnumeration*)iter->data)->next( next 316 ext/intl/common/common_enum.cpp PHP_ME(IntlIterator, next, ainfo_se_void, ZEND_ACC_PUBLIC) next 822 ext/intl/grapheme/grapheme_string.c zval *next = NULL; /* return offset of next part of the string */ next 824 ext/intl/grapheme/grapheme_string.c if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "sl|llz", (char **)&str, &str_len, &size, &extract_type, &lstart, &next) == FAILURE) { next 832 ext/intl/grapheme/grapheme_string.c if ( NULL != next ) { next 833 ext/intl/grapheme/grapheme_string.c if ( !PZVAL_IS_REF(next) ) { next 841 ext/intl/grapheme/grapheme_string.c zval_dtor(next); next 842 ext/intl/grapheme/grapheme_string.c ZVAL_LONG(next, lstart); next 895 ext/intl/grapheme/grapheme_string.c if ( NULL != next ) { next 896 ext/intl/grapheme/grapheme_string.c ZVAL_LONG(next, start+nsize); next 938 ext/intl/grapheme/grapheme_string.c if ( NULL != next ) { next 939 ext/intl/grapheme/grapheme_string.c ZVAL_LONG(next, start+ret_pos); next 255 ext/libxml/libxml.c curnode = node->next; next 991 ext/mbstring/oniguruma/regparse.c struct _FreeNode* next; next 1022 ext/mbstring/oniguruma/regparse.c n->next = FreeNodeList; next 1070 ext/mbstring/oniguruma/regparse.c n->next = FreeNodeList; next 1088 ext/mbstring/oniguruma/regparse.c FreeNodeList = FreeNodeList->next; next 1105 ext/mbstring/oniguruma/regparse.c FreeNodeList = FreeNodeList->next; next 2854 ext/mbstring/oniguruma/regparse.c if (IS_NOT_NULL(next)) next 2855 ext/mbstring/oniguruma/regparse.c *next = q; next 22 ext/mbstring/oniguruma/st.c st_table_entry *next; next 203 ext/mbstring/oniguruma/st.c register st_table_entry *ptr, *next; next 209 ext/mbstring/oniguruma/st.c next = ptr->next; next 211 ext/mbstring/oniguruma/st.c ptr = next; next 232 ext/mbstring/oniguruma/st.c while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\ next 233 ext/mbstring/oniguruma/st.c ptr = ptr->next;\ next 235 ext/mbstring/oniguruma/st.c ptr = ptr->next;\ next 273 ext/mbstring/oniguruma/st.c entry->next = table->bins[bin_pos];\ next 317 ext/mbstring/oniguruma/st.c register st_table_entry *ptr, *next, **new_bins; next 327 ext/mbstring/oniguruma/st.c next = ptr->next; next 329 ext/mbstring/oniguruma/st.c ptr->next = new_bins[hash_val]; next 331 ext/mbstring/oniguruma/st.c ptr = next; next 372 ext/mbstring/oniguruma/st.c entry->next = new_table->bins[i]; next 374 ext/mbstring/oniguruma/st.c ptr = ptr->next; next 399 ext/mbstring/oniguruma/st.c table->bins[hash_val] = ptr->next; next 407 ext/mbstring/oniguruma/st.c for(; ptr->next != 0; ptr = ptr->next) { next 408 ext/mbstring/oniguruma/st.c if (EQUAL(table, ptr->next->key, *key)) { next 409 ext/mbstring/oniguruma/st.c tmp = ptr->next; next 410 ext/mbstring/oniguruma/st.c ptr->next = ptr->next->next; next 440 ext/mbstring/oniguruma/st.c for(; ptr != 0; ptr = ptr->next) { next 495 ext/mbstring/oniguruma/st.c for (tmp = table->bins[i]; tmp; tmp=tmp->next) { next 506 ext/mbstring/oniguruma/st.c ptr = ptr->next; next 513 ext/mbstring/oniguruma/st.c table->bins[i] = ptr->next; next 516 ext/mbstring/oniguruma/st.c last->next = ptr->next; next 518 ext/mbstring/oniguruma/st.c ptr = ptr->next; next 48 ext/mysqli/mysqli_warning.c w = w->next; next 94 ext/mysqli/mysqli_warning.c prev->next = w; next 171 ext/mysqli/mysqli_warning.c prev->next = (void *)w; next 200 ext/mysqli/mysqli_warning.c if (w && w->next) { next 201 ext/mysqli/mysqli_warning.c w = w->next; next 333 ext/mysqli/mysqli_warning.c PHP_ME(mysqli_warning, next, NULL, ZEND_ACC_PUBLIC) next 151 ext/mysqli/php_mysqli_structs.h MYSQLI_WARNING *next; next 67 ext/opcache/Optimizer/block_pass.c bs = bs->next; next 242 ext/opcache/Optimizer/block_pass.c cur_block->next = &blocks[opno]; next 304 ext/opcache/Optimizer/block_pass.c cur_block = cur_block->next; next 308 ext/opcache/Optimizer/block_pass.c cur_block->next = &blocks[op_array->last + 1]; next 318 ext/opcache/Optimizer/block_pass.c while (__s && __s->from != fromb) __s = __s->next; \ next 321 ext/opcache/Optimizer/block_pass.c __t->next = tob->sources; \ next 328 ext/opcache/Optimizer/block_pass.c zend_block_source *__ns = (*cs)->next; \ next 340 ext/opcache/Optimizer/block_pass.c for (cs = &list; *cs; cs = &((*cs)->next)) { next 375 ext/opcache/Optimizer/block_pass.c cs = &((*cs)->next); next 384 ext/opcache/Optimizer/block_pass.c if (to->sources->next == NULL) { next 452 ext/opcache/Optimizer/block_pass.c bs = bs->next; next 500 ext/opcache/Optimizer/block_pass.c zend_block_source *n = cs->next; next 505 ext/opcache/Optimizer/block_pass.c b = b->next; next 1201 ext/opcache/Optimizer/block_pass.c zend_code_block *next; next 1202 ext/opcache/Optimizer/block_pass.c next = cur_block->next; next 1203 ext/opcache/Optimizer/block_pass.c while (next && !next->access) { next 1204 ext/opcache/Optimizer/block_pass.c next = next->next; next 1206 ext/opcache/Optimizer/block_pass.c if (next && next == cur_block->op1_to) { next 1228 ext/opcache/Optimizer/block_pass.c cur_block = cur_block->next; next 1276 ext/opcache/Optimizer/block_pass.c for (cur_block = blocks; cur_block; cur_block = cur_block->next) { next 1330 ext/opcache/Optimizer/block_pass.c zend_code_block *next = block->next; next 1332 ext/opcache/Optimizer/block_pass.c while (next && !next->access) { next 1334 ext/opcache/Optimizer/block_pass.c next = next->next; next 1338 ext/opcache/Optimizer/block_pass.c if (block->op1_to == next) { next 1426 ext/opcache/Optimizer/block_pass.c cs = cs->next; next 1429 ext/opcache/Optimizer/block_pass.c next = block->op1_to; next 1431 ext/opcache/Optimizer/block_pass.c while (next->follow_to != NULL) { next 1432 ext/opcache/Optimizer/block_pass.c if (next->follow_to == block) { next 1436 ext/opcache/Optimizer/block_pass.c next = next->follow_to; next 1441 ext/opcache/Optimizer/block_pass.c while (prev->next != block->op1_to) { next 1442 ext/opcache/Optimizer/block_pass.c prev = prev->next; next 1444 ext/opcache/Optimizer/block_pass.c prev->next = next->next; next 1445 ext/opcache/Optimizer/block_pass.c next->next = block->next; next 1446 ext/opcache/Optimizer/block_pass.c block->next = block->op1_to; next 1724 ext/opcache/Optimizer/block_pass.c zend_code_block *next = block->next; next 1726 ext/opcache/Optimizer/block_pass.c while (next && !next->access) { next 1728 ext/opcache/Optimizer/block_pass.c next = next->next; next 1768 ext/opcache/Optimizer/block_pass.c } else if (block->op2_to == next) { next 1773 ext/opcache/Optimizer/block_pass.c block->follow_to = next; next 1776 ext/opcache/Optimizer/block_pass.c } else if (block->ext_to == next) { next 1780 ext/opcache/Optimizer/block_pass.c block->follow_to = next; next 1868 ext/opcache/Optimizer/block_pass.c zend_code_block *next_block = block->next; next 1885 ext/opcache/Optimizer/block_pass.c next_block = next_block->next; next 1906 ext/opcache/Optimizer/block_pass.c next_block = next_block->next; next 1922 ext/opcache/Optimizer/block_pass.c block = block->next; next 2015 ext/opcache/Optimizer/block_pass.c block = block->next; next 2056 ext/opcache/Optimizer/block_pass.c for (cur_block = cfg.blocks; cur_block; cur_block = cur_block->next) { next 2064 ext/opcache/Optimizer/block_pass.c for (cur_block = cfg.blocks; cur_block; cur_block = cur_block->next) { next 2081 ext/opcache/Optimizer/block_pass.c for (cur_block = cfg.blocks; cur_block; cur_block = cur_block->next) { next 2084 ext/opcache/Optimizer/block_pass.c zend_block_source *n = cs->next; next 67 ext/opcache/Optimizer/zend_optimizer_internal.h zend_code_block *next; next 83 ext/opcache/Optimizer/zend_optimizer_internal.h zend_block_source *next; next 55 ext/opcache/zend_accelerator_blacklist.c zend_regexp_list *next; next 194 ext/opcache/zend_accelerator_blacklist.c it->next = NULL; next 202 ext/opcache/zend_accelerator_blacklist.c regexp_list_it = &it->next; next 226 ext/opcache/zend_accelerator_blacklist.c it = it->next; next 369 ext/opcache/zend_accelerator_blacklist.c regexp_list_it = regexp_list_it->next; next 115 ext/opcache/zend_accelerator_hash.c entry = entry->next; next 135 ext/opcache/zend_accelerator_hash.c entry->next = accel_hash->hash_table[index]; next 163 ext/opcache/zend_accelerator_hash.c entry = entry->next; next 191 ext/opcache/zend_accelerator_hash.c entry = entry->next; next 214 ext/opcache/zend_accelerator_hash.c last_entry->next = entry->next; next 216 ext/opcache/zend_accelerator_hash.c accel_hash->hash_table[index] = entry->next; next 221 ext/opcache/zend_accelerator_hash.c entry = entry->next; next 51 ext/opcache/zend_accelerator_hash.h zend_accel_hash_entry *next; next 496 ext/opcache/zend_accelerator_module.c for (cache_entry = ZCSG(hash).hash_table[i]; cache_entry; cache_entry = cache_entry->next) { next 521 ext/pcntl/pcntl.c PCNTL_G(head) = sig->next; next 526 ext/pcntl/pcntl.c PCNTL_G(spares) = sig->next; next 865 ext/pcntl/pcntl.c psig->next = PCNTL_G(spares); next 1214 ext/pcntl/pcntl.c PCNTL_G(spares) = psig->next; next 1217 ext/pcntl/pcntl.c psig->next = NULL; next 1222 ext/pcntl/pcntl.c PCNTL_G(tail)->next = psig; next 1232 ext/pcntl/pcntl.c struct php_pcntl_pending_signal *queue, *next; next 1269 ext/pcntl/pcntl.c next = queue->next; next 1270 ext/pcntl/pcntl.c queue->next = PCNTL_G(spares); next 1272 ext/pcntl/pcntl.c queue = next; next 63 ext/pcntl/php_pcntl.h struct php_pcntl_pending_signal *next; next 2925 ext/pcre/pcrelib/pcre_compile.c pcre_uint32 c, othercase, next; next 2945 ext/pcre/pcrelib/pcre_compile.c next = othercase + 1; next 2949 ext/pcre/pcrelib/pcre_compile.c if (UCD_OTHERCASE(c) != next) break; next 2950 ext/pcre/pcrelib/pcre_compile.c next++; next 2953 ext/pcre/pcrelib/pcre_compile.c *odptr = next - 1; /* End of othercase range */ next 3064 ext/pcre/pcrelib/pcre_compile.c pcre_uint32 next; next 3097 ext/pcre/pcrelib/pcre_compile.c escape = check_escape(&ptr, &next, &temperrorcode, cd->bracount, options, FALSE); next 3105 ext/pcre/pcrelib/pcre_compile.c if (utf) { GETCHARINC(next, ptr); } else next 3107 ext/pcre/pcrelib/pcre_compile.c next = *ptr++; next 3163 ext/pcre/pcrelib/pcre_compile.c unsigned int ocs = UCD_CASESET(next); next 3171 ext/pcre/pcrelib/pcre_compile.c return c != next; next 3179 ext/pcre/pcrelib/pcre_compile.c if (c == next) return FALSE; next 3184 ext/pcre/pcrelib/pcre_compile.c if (next < 128) othercase = cd->fcc[next]; else next 3186 ext/pcre/pcrelib/pcre_compile.c othercase = UCD_OTHERCASE(next); next 3194 ext/pcre/pcrelib/pcre_compile.c return (c != TABLE_GET(next, cd->fcc, next)); /* Not UTF */ next 3197 ext/pcre/pcrelib/pcre_compile.c return c == next; next 3200 ext/pcre/pcrelib/pcre_compile.c if (c == next) return TRUE; next 3205 ext/pcre/pcrelib/pcre_compile.c if (next < 128) othercase = cd->fcc[next]; else next 3207 ext/pcre/pcrelib/pcre_compile.c othercase = UCD_OTHERCASE(next); next 3215 ext/pcre/pcrelib/pcre_compile.c return (c == TABLE_GET(next, cd->fcc, next)); /* Not UTF */ next 3221 ext/pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_digit) == 0; next 3224 ext/pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_digit) != 0; next 3227 ext/pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_space) == 0; next 3230 ext/pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_space) != 0; next 3233 ext/pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_word) == 0; next 3236 ext/pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_word) != 0; next 3240 ext/pcre/pcrelib/pcre_compile.c switch(next) next 3252 ext/pcre/pcrelib/pcre_compile.c switch(next) next 3263 ext/pcre/pcrelib/pcre_compile.c return check_char_prop(next, previous[0], previous[1], FALSE); next 3266 ext/pcre/pcrelib/pcre_compile.c return check_char_prop(next, previous[0], previous[1], TRUE); next 3340 ext/pcre/pcrelib/pcre_compile.c escape = check_escape(&ptr, &next, &temperrorcode, 0, options, FALSE); next 5650 ext/pcre/pcrelib/pcre_compile.c for (oc = cd->open_caps; oc != NULL; oc = oc->next) next 6870 ext/pcre/pcrelib/pcre_compile.c for (oc = cd->open_caps; oc != NULL; oc = oc->next) next 7149 ext/pcre/pcrelib/pcre_compile.c capitem.next = cd->open_caps; next 7334 ext/pcre/pcrelib/pcre_compile.c cd->open_caps = cd->open_caps->next; next 611 ext/pcre/pcrelib/pcre_exec.c const pcre_uchar *next; next 877 ext/pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1); next 878 ext/pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next && next 879 ext/pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT)) next 990 ext/pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1); next 991 ext/pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next && next 992 ext/pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT)) next 1077 ext/pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1); next 1078 ext/pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next && next 1079 ext/pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT)) next 1170 ext/pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1); next 1171 ext/pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next && next 1172 ext/pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT)) next 1241 ext/pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1); next 1242 ext/pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next && next 1243 ext/pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT)) next 1857 ext/pcre/pcrelib/pcre_exec.c next = ecode + 1; next 1858 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, next, offset_top, md, eptrb, RM10); next 1860 ext/pcre/pcrelib/pcre_exec.c do next += GET(next, 1); while (*next == OP_ALT); next 1861 ext/pcre/pcrelib/pcre_exec.c ecode = next + 1 + LINK_SIZE; next 1865 ext/pcre/pcrelib/pcre_exec.c next = ecode + 1; next 1866 ext/pcre/pcrelib/pcre_exec.c do next += GET(next, 1); while (*next == OP_ALT); next 1867 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, eptrb, RM11); next 1873 ext/pcre/pcrelib/pcre_exec.c next = ecode+1; next 1874 ext/pcre/pcrelib/pcre_exec.c do next += GET(next,1); while (*next == OP_ALT); next 1875 ext/pcre/pcrelib/pcre_exec.c ecode = next + 1 + LINK_SIZE; next 2380 ext/pcre/pcrelib/pcre_internal.h struct open_capitem *next; /* Chain link */ next 414 ext/pdo/pdo_sql_parser.c struct placeholder *next; next 450 ext/pdo/pdo_sql_parser.c plc->next = NULL; next 456 ext/pdo/pdo_sql_parser.c placetail->next = plc; next 505 ext/pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) { next 527 ext/pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) { next 629 ext/pdo/pdo_sql_parser.c plc = plc->next; next 656 ext/pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) { next 697 ext/pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) { next 714 ext/pdo/pdo_sql_parser.c placeholders = plc->next; next 39 ext/pdo_sqlite/php_pdo_sqlite_int.h struct pdo_sqlite_func *next; next 50 ext/pdo_sqlite/php_pdo_sqlite_int.h struct pdo_sqlite_collation *next; next 108 ext/pdo_sqlite/sqlite_driver.c H->funcs = func->next; next 136 ext/pdo_sqlite/sqlite_driver.c H->collations = collation->next; next 575 ext/pdo_sqlite/sqlite_driver.c func->next = H->funcs; next 655 ext/pdo_sqlite/sqlite_driver.c func->next = H->funcs; next 705 ext/pdo_sqlite/sqlite_driver.c collation->next = H->collations; next 48 ext/session/mod_mm.c struct ps_sd *next; next 91 ext/session/mod_mm.c ps_sd *ps, *next; next 103 ext/session/mod_mm.c for (ps = *ohash; ps; ps = next) { next 104 ext/session/mod_mm.c next = ps->next; next 105 ext/session/mod_mm.c ps->next = nhash[ps->hv & nmax]; next 141 ext/session/mod_mm.c sd->next = data->hash[slot]; next 146 ext/session/mod_mm.c if (!sd->next) { next 164 ext/session/mod_mm.c data->hash[slot] = sd->next; next 169 ext/session/mod_mm.c for (prev = data->hash[slot]; prev->next != sd; prev = prev->next); next 170 ext/session/mod_mm.c prev->next = sd->next; next 190 ext/session/mod_mm.c for (prev = NULL, ret = data->hash[slot]; ret; prev = ret, ret = ret->next) { next 199 ext/session/mod_mm.c prev->next = ret->next; next 202 ext/session/mod_mm.c ret->next = data->hash[slot]; next 253 ext/session/mod_mm.c ps_sd *sd, *next; next 263 ext/session/mod_mm.c for (sd = data->hash[h]; sd; sd = next) { next 264 ext/session/mod_mm.c next = sd->next; next 451 ext/session/mod_mm.c ps_sd *sd, *next; next 464 ext/session/mod_mm.c for (sd = *ohash; sd; sd = next) { next 465 ext/session/mod_mm.c next = sd->next; next 169 ext/simplexml/simplexml.c node = node->next; next 190 ext/simplexml/simplexml.c node = node->next; next 232 ext/simplexml/simplexml.c node = node->next; next 316 ext/simplexml/simplexml.c attr = attr->next; next 324 ext/simplexml/simplexml.c attr = attr->next; next 576 ext/simplexml/simplexml.c attr = attr->next; next 585 ext/simplexml/simplexml.c attr = attr->next; next 622 ext/simplexml/simplexml.c node = node->next; next 791 ext/simplexml/simplexml.c attr = attr->next; next 800 ext/simplexml/simplexml.c attr = attr->next; next 821 ext/simplexml/simplexml.c nnext = node->next; next 831 ext/simplexml/simplexml.c (!node->children || (node->children->type == XML_TEXT_NODE && !node->children->next && next 922 ext/simplexml/simplexml.c attr = attr->next; next 926 ext/simplexml/simplexml.c anext = attr->next; next 950 ext/simplexml/simplexml.c nnext = node->next; next 1116 ext/simplexml/simplexml.c attr = attr->next; next 1132 ext/simplexml/simplexml.c if ( !node->children || !node->parent || node->children->next || node->children->children || node->parent->children == node->parent->last ) { next 1145 ext/simplexml/simplexml.c if (node->children != NULL || node->prev != NULL || node->next != NULL) { next 1180 ext/simplexml/simplexml.c node = php_sxe_iterator_fetch(sxe, node->next, 0 TSRMLS_CC); next 1182 ext/simplexml/simplexml.c node = node->next; next 1461 ext/simplexml/simplexml.c attr = attr->next; next 1470 ext/simplexml/simplexml.c node = node->next; next 1511 ext/simplexml/simplexml.c ns = ns->next; next 1517 ext/simplexml/simplexml.c node = node->next; next 1883 ext/simplexml/simplexml.c node = php_sxe_iterator_fetch(sxe, node->next, 0 TSRMLS_CC); next 2293 ext/simplexml/simplexml.c node = node->next; next 2411 ext/simplexml/simplexml.c php_sxe_iterator_fetch(sxe, node->next, 1 TSRMLS_CC); next 149 ext/simplexml/sxe.c node = node->next; next 181 ext/simplexml/sxe.c PHP_ME(ce_SimpleXMLIterator, next, arginfo_simplexmliterator__void, ZEND_ACC_PUBLIC) next 317 ext/soap/php_encoding.c attr = attr->next; next 688 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 704 ext/soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) { next 721 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 738 ext/soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) { next 755 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 772 ext/soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) { next 792 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 799 ext/soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) { next 824 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 826 ext/soap/php_encoding.c } else if (data->children->type != XML_CDATA_SECTION_NODE || data->children->next != NULL) { next 1029 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 1070 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 1161 ext/soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) { next 1313 ext/soap/php_encoding.c while (node->next != NULL) { next 1314 ext/soap/php_encoding.c zval* val2 = master_to_zval(get_conversion(XSD_ANYXML), node->next TSRMLS_CC); next 1320 ext/soap/php_encoding.c node = node->next; next 1363 ext/soap/php_encoding.c node = node->next; next 1400 ext/soap/php_encoding.c if ((node = get_node(node->next, model->u.element->name)) != NULL) { next 1426 ext/soap/php_encoding.c } while ((node = get_node(node->next, model->u.element->name)) != NULL); next 1652 ext/soap/php_encoding.c if (!trav->next || !get_node(trav->next, (char*)trav->name)) { next 1679 ext/soap/php_encoding.c trav = trav->next; next 2765 ext/soap/php_encoding.c trav = trav->next; next 2944 ext/soap/php_encoding.c trav = trav->next; next 3131 ext/soap/php_encoding.c char *str, *start, *next; next 3146 ext/soap/php_encoding.c next = strchr(start,' '); next 3147 ext/soap/php_encoding.c if (next != NULL) { next 3148 ext/soap/php_encoding.c *next = '\0'; next 3149 ext/soap/php_encoding.c next++; next 3164 ext/soap/php_encoding.c start = next; next 3261 ext/soap/php_encoding.c ret->next = NULL; next 3263 ext/soap/php_encoding.c parent->last->next = ret; next 3417 ext/soap/php_encoding.c href = href->next; next 3487 ext/soap/php_encoding.c cur = cur->next; next 74 ext/soap/php_packet_soap.c trav = trav->next; next 99 ext/soap/php_packet_soap.c attr = attr->next; next 106 ext/soap/php_packet_soap.c trav = trav->next; next 110 ext/soap/php_packet_soap.c trav = trav->next; next 116 ext/soap/php_packet_soap.c trav = trav->next; next 120 ext/soap/php_packet_soap.c trav = trav->next; next 123 ext/soap/php_packet_soap.c trav = trav->next; next 149 ext/soap/php_packet_soap.c attr = attr->next; next 175 ext/soap/php_packet_soap.c attr = attr->next; next 253 ext/soap/php_packet_soap.c resp = resp->next; next 309 ext/soap/php_packet_soap.c if (val == NULL && cur->children && cur->children->next == NULL) { next 346 ext/soap/php_packet_soap.c val = val->next; next 357 ext/soap/php_packet_soap.c } else if (val->next && get_node(val->next, (char*)val->name)) { next 372 ext/soap/php_packet_soap.c val = val->next; next 420 ext/soap/php_packet_soap.c trav = trav->next; next 268 ext/soap/php_schema.c trav = trav->next; next 291 ext/soap/php_schema.c trav = trav->next; next 376 ext/soap/php_schema.c trav = trav->next; next 381 ext/soap/php_schema.c trav = trav->next; next 385 ext/soap/php_schema.c trav = trav->next; next 389 ext/soap/php_schema.c trav = trav->next; next 447 ext/soap/php_schema.c trav = trav->next; next 477 ext/soap/php_schema.c trav = trav->next; next 500 ext/soap/php_schema.c char *str, *start, *end, *next; next 510 ext/soap/php_schema.c next = NULL; next 513 ext/soap/php_schema.c next = end+1; next 538 ext/soap/php_schema.c start = next; next 546 ext/soap/php_schema.c trav = trav->next; next 576 ext/soap/php_schema.c trav = trav->next; next 598 ext/soap/php_schema.c trav = trav->next; next 604 ext/soap/php_schema.c trav = trav->next; next 608 ext/soap/php_schema.c trav = trav->next; next 665 ext/soap/php_schema.c trav = trav->next; next 669 ext/soap/php_schema.c trav = trav->next; next 708 ext/soap/php_schema.c trav = trav->next; next 718 ext/soap/php_schema.c trav = trav->next; next 723 ext/soap/php_schema.c trav = trav->next; next 765 ext/soap/php_schema.c trav = trav->next; next 770 ext/soap/php_schema.c trav = trav->next; next 773 ext/soap/php_schema.c trav = trav->next; next 776 ext/soap/php_schema.c trav = trav->next; next 779 ext/soap/php_schema.c trav = trav->next; next 789 ext/soap/php_schema.c trav = trav->next; next 794 ext/soap/php_schema.c trav = trav->next; next 890 ext/soap/php_schema.c trav = trav->next; next 899 ext/soap/php_schema.c trav = trav->next; next 904 ext/soap/php_schema.c trav = trav->next; next 945 ext/soap/php_schema.c trav = trav->next; next 950 ext/soap/php_schema.c trav = trav->next; next 953 ext/soap/php_schema.c trav = trav->next; next 956 ext/soap/php_schema.c trav = trav->next; next 959 ext/soap/php_schema.c trav = trav->next; next 969 ext/soap/php_schema.c trav = trav->next; next 974 ext/soap/php_schema.c trav = trav->next; next 1033 ext/soap/php_schema.c trav = trav->next; next 1041 ext/soap/php_schema.c trav = trav->next; next 1147 ext/soap/php_schema.c trav = trav->next; next 1156 ext/soap/php_schema.c trav = trav->next; next 1163 ext/soap/php_schema.c trav = trav->next; next 1170 ext/soap/php_schema.c trav = trav->next; next 1209 ext/soap/php_schema.c trav = trav->next; next 1225 ext/soap/php_schema.c trav = trav->next; next 1259 ext/soap/php_schema.c trav = trav->next; next 1275 ext/soap/php_schema.c trav = trav->next; next 1321 ext/soap/php_schema.c trav = trav->next; next 1327 ext/soap/php_schema.c trav = trav->next; next 1331 ext/soap/php_schema.c trav = trav->next; next 1422 ext/soap/php_schema.c trav = trav->next; next 1427 ext/soap/php_schema.c trav = trav->next; next 1430 ext/soap/php_schema.c trav = trav->next; next 1434 ext/soap/php_schema.c trav = trav->next; next 1437 ext/soap/php_schema.c trav = trav->next; next 1440 ext/soap/php_schema.c trav = trav->next; next 1443 ext/soap/php_schema.c trav = trav->next; next 1452 ext/soap/php_schema.c trav = trav->next; next 1457 ext/soap/php_schema.c trav = trav->next; next 1677 ext/soap/php_schema.c trav = trav->next; next 1687 ext/soap/php_schema.c trav = trav->next; next 1695 ext/soap/php_schema.c trav = trav->next; next 1708 ext/soap/php_schema.c trav = trav->next; next 1888 ext/soap/php_schema.c attr = attr->next; next 1912 ext/soap/php_schema.c trav = trav->next; next 1936 ext/soap/php_schema.c trav = trav->next; next 2016 ext/soap/php_schema.c trav = trav->next; next 2034 ext/soap/php_schema.c trav = trav->next; next 2039 ext/soap/php_schema.c trav = trav->next; next 371 ext/soap/php_sdl.c trav = trav->next; next 384 ext/soap/php_sdl.c trav2 = trav2->next; next 445 ext/soap/php_sdl.c trav = trav->next; next 555 ext/soap/php_sdl.c trav = trav->next; next 660 ext/soap/php_sdl.c trav = trav->next; next 693 ext/soap/php_sdl.c trav = trav->next; next 726 ext/soap/php_sdl.c trav = trav->next; next 772 ext/soap/php_sdl.c trav = trav->next; next 817 ext/soap/php_sdl.c trav2 = trav2->next; next 820 ext/soap/php_sdl.c if (has_soap_port || trav->next || i < n-1) { next 822 ext/soap/php_sdl.c trav = trav->next; next 873 ext/soap/php_sdl.c trav = trav->next; next 913 ext/soap/php_sdl.c trav2 = trav2->next; next 938 ext/soap/php_sdl.c trav3 = trav3->next; next 1116 ext/soap/php_sdl.c trav = trav->next; next 1128 ext/soap/php_sdl.c fault = fault->next; next 1152 ext/soap/php_sdl.c trav2 = trav2->next; next 1161 ext/soap/php_sdl.c trav= trav->next; next 64 ext/soap/php_xml.c trav = trav->next; next 242 ext/soap/php_xml.c node = node->next; next 253 ext/soap/php_xml.c node = node->next; next 269 ext/soap/php_xml.c node = node->next; next 290 ext/soap/php_xml.c node = node->next; next 310 ext/soap/php_xml.c node = node->next; next 77 ext/soap/php_xml.h } while ((n = n->next)); next 45 ext/soap/soap.c struct _soapHeader *next; next 1775 ext/soap/soap.c header = header->next; next 1965 ext/soap/soap.c soap_headers = soap_headers->next; next 2042 ext/soap/soap.c p = &(*p)->next; next 3347 ext/soap/soap.c trav = trav->next; next 3380 ext/soap/soap.c trav = trav->next; next 3448 ext/soap/soap.c trav = trav->next; next 3465 ext/soap/soap.c attr = attr->next; next 3472 ext/soap/soap.c trav = trav->next; next 3476 ext/soap/soap.c trav = trav->next; next 3482 ext/soap/soap.c trav = trav->next; next 3486 ext/soap/soap.c trav = trav->next; next 3489 ext/soap/soap.c trav = trav->next; next 3507 ext/soap/soap.c attr = attr->next; next 3526 ext/soap/soap.c trav = trav->next; next 3573 ext/soap/soap.c attr = attr->next; next 3658 ext/soap/soap.c last->next = h; next 3663 ext/soap/soap.c trav = trav->next; next 4150 ext/soap/soap.c h = h->next; next 4544 ext/soap/soap.c node = node->next; next 1911 ext/spl/spl_array.c SPL_ME(Array, next, arginfo_array_void, ZEND_ACC_PUBLIC) next 2002 ext/spl/spl_directory.c SPL_ME(DirectoryIterator, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC) next 2024 ext/spl/spl_directory.c SPL_ME(DirectoryIterator, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC) next 2981 ext/spl/spl_directory.c SPL_ME(SplFileObject, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC) next 68 ext/spl/spl_dllist.c struct _spl_ptr_llist_element *next; next 147 ext/spl/spl_dllist.c spl_ptr_llist_element *current = llist->head, *next; next 151 ext/spl/spl_dllist.c next = current->next; next 156 ext/spl/spl_dllist.c current = next; next 180 ext/spl/spl_dllist.c current = current->next; next 195 ext/spl/spl_dllist.c elem->next = llist->head; next 219 ext/spl/spl_dllist.c elem->next = NULL; next 222 ext/spl/spl_dllist.c llist->tail->next = elem; next 246 ext/spl/spl_dllist.c tail->prev->next = NULL; next 300 ext/spl/spl_dllist.c if (head->next) { next 301 ext/spl/spl_dllist.c head->next->prev = NULL; next 306 ext/spl/spl_dllist.c llist->head = head->next; next 323 ext/spl/spl_dllist.c spl_ptr_llist_element *current = from->head, *next; next 327 ext/spl/spl_dllist.c next = current->next; next 334 ext/spl/spl_dllist.c current = next; next 511 ext/spl/spl_dllist.c spl_ptr_llist_element *current = intern->llist->head, *next; next 541 ext/spl/spl_dllist.c next = current->next; next 547 ext/spl/spl_dllist.c current = next; next 896 ext/spl/spl_dllist.c element->prev->next = element->next; next 899 ext/spl/spl_dllist.c if (element->next) { next 900 ext/spl/spl_dllist.c element->next->prev = element->prev; next 905 ext/spl/spl_dllist.c llist->head = element->next; next 975 ext/spl/spl_dllist.c *traverse_pointer_ptr = old->next; next 1140 ext/spl/spl_dllist.c spl_ptr_llist_element *current = intern->llist->head, *next; next 1159 ext/spl/spl_dllist.c next = current->next; next 1163 ext/spl/spl_dllist.c current = next; next 1272 ext/spl/spl_dllist.c elem->next = element; next 1279 ext/spl/spl_dllist.c element->prev->next = elem; next 1386 ext/spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, next, arginfo_dllist_void, ZEND_ACC_PUBLIC) next 1132 ext/spl/spl_fixedarray.c SPL_ME(SplFixedArray, next, arginfo_splfixedarray_void, ZEND_ACC_PUBLIC) next 1190 ext/spl/spl_heap.c SPL_ME(SplHeap, next, arginfo_splheap_void, ZEND_ACC_PUBLIC) next 1205 ext/spl/spl_heap.c SPL_ME(SplHeap, next, arginfo_splheap_void, ZEND_ACC_PUBLIC) next 959 ext/spl/spl_iterators.c SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 1248 ext/spl/spl_iterators.c SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 2314 ext/spl/spl_iterators.c SPL_ME(FilterIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 2554 ext/spl/spl_iterators.c SPL_ME(LimitIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 2973 ext/spl/spl_iterators.c SPL_ME(CachingIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 3058 ext/spl/spl_iterators.c SPL_ME(dual_it, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 3155 ext/spl/spl_iterators.c SPL_ME(NoRewindIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 3192 ext/spl/spl_iterators.c SPL_ME(InfiniteIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 3249 ext/spl/spl_iterators.c SPL_ME(EmptyIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 3424 ext/spl/spl_iterators.c SPL_ME(AppendIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC) next 975 ext/spl/spl_observer.c SPL_ME(SplObjectStorage, next, arginfo_splobject_void,0) next 1299 ext/spl/spl_observer.c SPL_ME(MultipleIterator, next, arginfo_splobject_void, 0) next 7343 ext/sqlite3/libsqlite/sqlite3.c HashElem *next, *prev; /* Next and previous elements in the table */ next 7369 ext/sqlite3/libsqlite/sqlite3.c #define sqliteHashNext(E) ((E)->next) next 15500 ext/sqlite3/libsqlite/sqlite3.c u32 next; /* Index in mem3.aPool[] of next free chunk */ next 15560 ext/sqlite3/libsqlite/sqlite3.c u32 next = mem3.aPool[i].u.list.next; next 15564 ext/sqlite3/libsqlite/sqlite3.c *pRoot = next; next 15566 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[prev].u.list.next = next; next 15568 ext/sqlite3/libsqlite/sqlite3.c if( next ){ next 15569 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[next].u.list.prev = prev; next 15571 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.next = 0; next 15601 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.next = *pRoot; next 15732 ext/sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[i].u.list.next; next 15740 ext/sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[prev].u.list.next; next 15793 ext/sqlite3/libsqlite/sqlite3.c for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){ next 16045 ext/sqlite3/libsqlite/sqlite3.c for(j = mem3.aiSmall[i]; j>0; j=mem3.aPool[j].u.list.next){ next 16054 ext/sqlite3/libsqlite/sqlite3.c for(j = mem3.aiHash[i]; j>0; j=mem3.aPool[j].u.list.next){ next 16170 ext/sqlite3/libsqlite/sqlite3.c int next; /* Index of next free chunk */ next 16249 ext/sqlite3/libsqlite/sqlite3.c int next, prev; next 16254 ext/sqlite3/libsqlite/sqlite3.c next = MEM5LINK(i)->next; next 16257 ext/sqlite3/libsqlite/sqlite3.c mem5.aiFreelist[iLogsize] = next; next 16259 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(prev)->next = next; next 16261 ext/sqlite3/libsqlite/sqlite3.c if( next>=0 ){ next 16262 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(next)->prev = prev; next 16277 ext/sqlite3/libsqlite/sqlite3.c x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize]; next 16326 ext/sqlite3/libsqlite/sqlite3.c i = MEM5LINK(i)->next; next 16643 ext/sqlite3/libsqlite/sqlite3.c for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){} next 21745 ext/sqlite3/libsqlite/sqlite3.c HashElem *next_elem = elem->next; next 21783 ext/sqlite3/libsqlite/sqlite3.c pNew->next = pHead; next 21785 ext/sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; } next 21789 ext/sqlite3/libsqlite/sqlite3.c pNew->next = pH->first; next 21829 ext/sqlite3/libsqlite/sqlite3.c next_elem = elem->next; next 21860 ext/sqlite3/libsqlite/sqlite3.c elem = elem->next; next 21875 ext/sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next; next 21877 ext/sqlite3/libsqlite/sqlite3.c pH->first = elem->next; next 21879 ext/sqlite3/libsqlite/sqlite3.c if( elem->next ){ next 21880 ext/sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev; next 21885 ext/sqlite3/libsqlite/sqlite3.c pEntry->chain = elem->next; next 48968 ext/sqlite3/libsqlite/sqlite3.c u16 next, size; next 48973 ext/sqlite3/libsqlite/sqlite3.c next = get2byte(&data[pc]); next 48975 ext/sqlite3/libsqlite/sqlite3.c if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){ next 48981 ext/sqlite3/libsqlite/sqlite3.c pc = next; next 51233 ext/sqlite3/libsqlite/sqlite3.c Pgno next = 0; next 51259 ext/sqlite3/libsqlite/sqlite3.c next = iGuess; next 51266 ext/sqlite3/libsqlite/sqlite3.c assert( next==0 || rc==SQLITE_DONE ); next 51271 ext/sqlite3/libsqlite/sqlite3.c next = get4byte(pPage->aData); next 51275 ext/sqlite3/libsqlite/sqlite3.c *pPgnoNext = next; next 111736 ext/sqlite3/libsqlite/sqlite3.c Fts3HashElem *next, *prev; /* Next and previous elements in the table */ next 111787 ext/sqlite3/libsqlite/sqlite3.c #define fts3HashNext(E) ((E)->next) next 117956 ext/sqlite3/libsqlite/sqlite3.c Fts3HashElem *next_elem = elem->next; next 118046 ext/sqlite3/libsqlite/sqlite3.c pNew->next = pHead; next 118048 ext/sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; } next 118052 ext/sqlite3/libsqlite/sqlite3.c pNew->next = pH->first; next 118082 ext/sqlite3/libsqlite/sqlite3.c next_elem = elem->next; next 118111 ext/sqlite3/libsqlite/sqlite3.c elem = elem->next; next 118127 ext/sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next; next 118129 ext/sqlite3/libsqlite/sqlite3.c pH->first = elem->next; next 118131 ext/sqlite3/libsqlite/sqlite3.c if( elem->next ){ next 118132 ext/sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev; next 118136 ext/sqlite3/libsqlite/sqlite3.c pEntry->chain = elem->next; next 56 ext/sqlite3/php_sqlite3_structs.h struct _php_sqlite3_func *next; next 67 ext/sqlite3/php_sqlite3_structs.h struct _php_sqlite3_collation *next; next 955 ext/sqlite3/sqlite3.c func->next = db_obj->funcs; next 1015 ext/sqlite3/sqlite3.c func->next = db_obj->funcs; next 1062 ext/sqlite3/sqlite3.c collation->next = db_obj->collations; next 2038 ext/sqlite3/sqlite3.c intern->funcs = func->next; next 2059 ext/sqlite3/sqlite3.c intern->collations = collation->next; next 3305 ext/standard/basic_functions.c PHP_FE(next, arginfo_next) next 3470 ext/standard/basic_functions.c BG(next) = NULL; next 194 ext/standard/basic_functions.h php_uint32 *next; /* next random value is computed from here */ next 1227 ext/standard/filestat.c bucket = bucket->next; next 183 ext/standard/html.c unsigned char next; next 187 ext/standard/html.c next = str[pos + 1]; next 189 ext/standard/html.c if ((next >= 0x40 && next <= 0x7E) || next 190 ext/standard/html.c (next >= 0xA1 && next <= 0xFE)) { next 191 ext/standard/html.c this_char = (c << 8) | next; next 207 ext/standard/html.c unsigned char next; next 211 ext/standard/html.c next = str[pos + 1]; next 213 ext/standard/html.c if ((next >= 0x40 && next <= 0x7E) || next 214 ext/standard/html.c (next >= 0xA1 && next <= 0xFE)) { next 215 ext/standard/html.c this_char = (c << 8) | next; next 216 ext/standard/html.c } else if (next != 0x80 && next != 0xFF) { next 233 ext/standard/html.c unsigned char next; next 237 ext/standard/html.c next = str[pos + 1]; next 239 ext/standard/html.c if (gb2312_trail(next)) { next 240 ext/standard/html.c this_char = (c << 8) | next; next 241 ext/standard/html.c } else if (gb2312_lead(next)) { next 260 ext/standard/html.c unsigned char next; next 264 ext/standard/html.c next = str[pos + 1]; next 266 ext/standard/html.c if (sjis_trail(next)) { next 267 ext/standard/html.c this_char = (c << 8) | next; next 268 ext/standard/html.c } else if (sjis_lead(next)) { next 288 ext/standard/html.c unsigned next; next 291 ext/standard/html.c next = str[pos + 1]; next 293 ext/standard/html.c if (next >= 0xA1 && next <= 0xFE) { next 295 ext/standard/html.c this_char = (c << 8) | next; next 297 ext/standard/html.c MB_FAILURE(pos, (next != 0xA0 && next != 0xFF) ? 1 : 2); next 301 ext/standard/html.c unsigned next; next 305 ext/standard/html.c next = str[pos + 1]; next 306 ext/standard/html.c if (next >= 0xA1 && next <= 0xDF) { next 308 ext/standard/html.c this_char = (c << 8) | next; next 310 ext/standard/html.c MB_FAILURE(pos, (next != 0xA0 && next != 0xFF) ? 1 : 2); next 944 ext/standard/html.c const char *next = NULL; /* when set, next > p, otherwise possible inf loop */ next 961 ext/standard/html.c next = &p[2]; next 962 ext/standard/html.c if (process_numeric_entity(&next, &code) == FAILURE) next 982 ext/standard/html.c next = &p[1]; next 983 ext/standard/html.c start = next; next 985 ext/standard/html.c if (process_named_entity_html(&next, &start, &ent_len) == FAILURE) next 1000 ext/standard/html.c assert(*next == ';'); next 1021 ext/standard/html.c p = next + 1; next 1025 ext/standard/html.c for (; p < next; p++) { next 1394 ext/standard/html.c *next = start; next 1397 ext/standard/html.c if (process_named_entity_html(&next, &start, &ent_len) == FAILURE) next 190 ext/standard/rand.c BG(next) = state; next 221 ext/standard/rand.c s1 = *BG(next)++; next 515 ext/standard/streamsfuncs.c for (filter = stream->filterhead; filter != NULL; filter = filter->next) { next 33 ext/standard/var_unserializer.c void *next; next 46 ext/standard/var_unserializer.c var_hash->next = 0; next 51 ext/standard/var_unserializer.c ((var_entries *) (*var_hashx)->last)->next = var_hash; next 70 ext/standard/var_unserializer.c var_hash->next = 0; next 75 ext/standard/var_unserializer.c ((var_entries *) (*var_hashx)->last_dtor)->next = var_hash; next 95 ext/standard/var_unserializer.c var_hash->next = 0; next 100 ext/standard/var_unserializer.c ((var_entries *) (*var_hashx)->last_dtor)->next = var_hash; next 124 ext/standard/var_unserializer.c var_hash = var_hash->next; next 136 ext/standard/var_unserializer.c var_hash = var_hash->next; next 151 ext/standard/var_unserializer.c void *next; next 159 ext/standard/var_unserializer.c next = var_hash->next; next 161 ext/standard/var_unserializer.c var_hash = next; next 170 ext/standard/var_unserializer.c next = var_hash->next; next 172 ext/standard/var_unserializer.c var_hash = next; next 43 ext/sysvshm/php_sysvshm.h long next; next 378 ext/sysvshm/sysvshm.c shm_var->next = total_size; next 403 ext/sysvshm/sysvshm.c pos += shm_var->next; next 405 ext/sysvshm/sysvshm.c if (shm_var->next <= 0 || pos < ptr->start) { next 421 ext/sysvshm/sysvshm.c next_chunk_ptr = (sysvshm_chunk *) ((char *) ptr + shm_varpos + chunk_ptr->next); next 423 ext/sysvshm/sysvshm.c memcpy_len = ptr->end-shm_varpos - chunk_ptr->next; next 424 ext/sysvshm/sysvshm.c ptr->free += chunk_ptr->next; next 425 ext/sysvshm/sysvshm.c ptr->end -= chunk_ptr->next; next 26 ext/xml/compat.c void *next; next 204 ext/xml/compat.c _namespace_handler(parser, nsptr->next); next 1292 ext/xmlreader/php_xmlreader.c PHP_ME(xmlreader, next, arginfo_xmlreader_next, ZEND_ACC_PUBLIC) next 302 ext/xmlrpc/libxmlrpc/queue.c q->head->next = NULL; next 306 ext/xmlrpc/libxmlrpc/queue.c q->head->next = (datanode*)n; next 357 ext/xmlrpc/libxmlrpc/queue.c p->next = q->tail; next 360 ext/xmlrpc/libxmlrpc/queue.c q->tail->next = NULL; next 399 ext/xmlrpc/libxmlrpc/queue.c n = q->head->next; next 450 ext/xmlrpc/libxmlrpc/queue.c q->tail->next = NULL; next 482 ext/xmlrpc/libxmlrpc/queue.c if(!q->cursor || q->cursor->next == NULL) next 485 ext/xmlrpc/libxmlrpc/queue.c q->cursor = (node *)q->cursor->next; next 538 ext/xmlrpc/libxmlrpc/queue.c n = ((node*)iter)->next; next 545 ext/xmlrpc/libxmlrpc/queue.c p->next = n; next 822 ext/xmlrpc/libxmlrpc/queue.c dn = dn->next; next 965 ext/xmlrpc/libxmlrpc/queue.c return qi ? (q_iter)((node*)qi)->next : NULL; next 31 ext/xmlrpc/libxmlrpc/queue.h datanode *prev, *next ; next 85 ext/xmlrpc/libxmlrpc/queue.h #define Q_Iter_Next_F(qi) (qi ? (q_iter)((node*)qi)->next : NULL) next 459 ext/xsl/xsltprocessor.c nodep = nodep->next; next 596 main/SAPI.c zend_llist_element *next; next 601 main/SAPI.c next = current->next; next 605 main/SAPI.c current->prev->next = next; next 607 main/SAPI.c l->head = next; next 609 main/SAPI.c if (next) { next 610 main/SAPI.c next->prev = current->prev; next 618 main/SAPI.c current = next; next 143 main/alloca.c union hdr *next; /* For chaining headers. */ next 183 main/alloca.c register header *np = hp->h.next; next 211 main/alloca.c ((header *) new)->h.next = last_alloca_header; next 680 main/php_ini.c for (element = scanned_ini_list.head; element; element = element->next) { next 685 main/php_ini.c strlcat(php_ini_scanned_files, element->next ? ",\n" : "\n", total_l); next 84 main/streams/filter.c bucket->next = bucket->prev = NULL; next 194 main/streams/filter.c bucket->next = brigade->head; next 213 main/streams/filter.c bucket->next = NULL; next 216 main/streams/filter.c brigade->tail->next = bucket; next 227 main/streams/filter.c bucket->prev->next = bucket->next; next 229 main/streams/filter.c bucket->brigade->head = bucket->next; next 231 main/streams/filter.c if (bucket->next) { next 232 main/streams/filter.c bucket->next->prev = bucket->prev; next 237 main/streams/filter.c bucket->next = bucket->prev = NULL; next 318 main/streams/filter.c filter->next = chain->head; next 342 main/streams/filter.c filter->next = NULL; next 344 main/streams/filter.c chain->tail->next = filter; next 425 main/streams/filter.c filter->prev->next = NULL; next 449 main/streams/filter.c for(current = filter; current; current = current->next) { next 474 main/streams/filter.c for(bucket = inp->head; bucket; bucket = bucket->next) { next 516 main/streams/filter.c filter->prev->next = filter->next; next 518 main/streams/filter.c filter->chain->head = filter->next; next 520 main/streams/filter.c if (filter->next) { next 521 main/streams/filter.c filter->next->prev = filter->prev; next 45 main/streams/php_stream_filter_api.h php_stream_bucket *next, *prev; next 111 main/streams/php_stream_filter_api.h php_stream_filter *next; next 609 main/streams/streams.c for (filter = stream->readfilters.head; filter; filter = filter->next) { next 1169 main/streams/streams.c for (filter = stream->writefilters.head; filter; filter = filter->next) { next 2225 run-tests.php $k1 = next($old1) ? key($old1) : null; next 2229 run-tests.php $k2 = next($old2) ? key($old2) : null; next 2233 run-tests.php $k1 = next($old1) ? key($old1) : null; next 2237 run-tests.php $k2 = next($old2) ? key($old2) : null; next 225 sapi/apache/php_apache.c for(modp = top_module; modp; modp = modp->next) { next 231 sapi/apache/php_apache.c if (modp->next) { next 55 sapi/apache2filter/php_functions.c return ap_sub_req_lookup_uri(filename, ctx->f->r, ctx->f->next); next 86 sapi/apache2filter/sapi_apache2.c if (ap_pass_brigade(f->next, bb) != APR_SUCCESS || ctx->r->connection->aborted) { next 280 sapi/apache2filter/sapi_apache2.c if (ap_pass_brigade(f->next, bb) != APR_SUCCESS || ctx->r->connection->aborted) { next 371 sapi/apache2filter/sapi_apache2.c return ap_get_brigade(f->next, bb, mode, block, readbytes); next 381 sapi/apache2filter/sapi_apache2.c if ((rv = ap_get_brigade(f->next, bb, mode, block, readbytes)) != APR_SUCCESS) { next 474 sapi/apache2filter/sapi_apache2.c return ap_pass_brigade(f->next, bb); next 482 sapi/apache2filter/sapi_apache2.c return ap_pass_brigade(f->next, bb); next 524 sapi/apache2filter/sapi_apache2.c ctx->f = f->next; /* save whatever filters are after us in the chain. */ next 530 sapi/apache2filter/sapi_apache2.c return ap_pass_brigade(f->next, bb); next 566 sapi/apache2filter/sapi_apache2.c return ap_pass_brigade(f->next, pbb->bb); next 654 sapi/apache2filter/sapi_apache2.c f = f->next; next 1636 sapi/apache_hooks/php_apache.c for(modp = top_module; modp; modp = modp->next) { next 1642 sapi/apache_hooks/php_apache.c if (modp->next) { next 74 sapi/caudium/caudium.c for(KEY=md->data->hash[COUNT];KEY;KEY=KEY->next) next 156 sapi/cgi/fastcgi.c struct _fcgi_hash_bucket *next; next 162 sapi/cgi/fastcgi.c struct _fcgi_hash_buckets *next; next 169 sapi/cgi/fastcgi.c struct _fcgi_data_seg *next; next 186 sapi/cgi/fastcgi.c h->buckets->next = NULL; next 190 sapi/cgi/fastcgi.c h->data->next = NULL; next 201 sapi/cgi/fastcgi.c b = b->next; next 207 sapi/cgi/fastcgi.c p = p->next; next 217 sapi/cgi/fastcgi.c while (h->buckets->next) { next 220 sapi/cgi/fastcgi.c h->buckets = h->buckets->next; next 225 sapi/cgi/fastcgi.c while (h->data->next) { next 228 sapi/cgi/fastcgi.c h->data = h->data->next; next 244 sapi/cgi/fastcgi.c p->next = h->data; next 268 sapi/cgi/fastcgi.c p = p->next; next 274 sapi/cgi/fastcgi.c b->next = h->buckets; next 279 sapi/cgi/fastcgi.c p->next = h->hash_table[idx]; next 303 sapi/cgi/fastcgi.c *p = (*p)->next; next 306 sapi/cgi/fastcgi.c p = &(*p)->next; next 322 sapi/cgi/fastcgi.c p = p->next; next 145 sapi/cli/php_cli_server.c struct php_cli_server_chunk *next; next 991 sapi/cli/php_cli_server.c php_cli_server_chunk *chunk, *next; next 992 sapi/cli/php_cli_server.c for (chunk = buffer->first; chunk; chunk = next) { next 993 sapi/cli/php_cli_server.c next = chunk->next; next 1008 sapi/cli/php_cli_server.c for (last = chunk; last->next; last = last->next); next 1012 sapi/cli/php_cli_server.c buffer->last->next = chunk; next 1020 sapi/cli/php_cli_server.c for (last = chunk; last->next; last = last->next); next 1021 sapi/cli/php_cli_server.c last->next = buffer->first; next 1032 sapi/cli/php_cli_server.c for (chunk = buffer->first; chunk; chunk = chunk->next) { next 1046 sapi/cli/php_cli_server.c chunk->next = NULL; next 1060 sapi/cli/php_cli_server.c chunk->next = NULL; next 1075 sapi/cli/php_cli_server.c chunk->next = NULL; next 1094 sapi/cli/php_cli_server.c php_cli_server_chunk *chunk, *next; next 1097 sapi/cli/php_cli_server.c for (chunk = sender->buffer.first; chunk; chunk = next) { next 1099 sapi/cli/php_cli_server.c next = chunk->next; next 1110 sapi/cli/php_cli_server.c sender->buffer.first = next; next 1111 sapi/cli/php_cli_server.c if (!next) { next 1129 sapi/cli/php_cli_server.c sender->buffer.first = next; next 1130 sapi/cli/php_cli_server.c if (!next) { next 190 sapi/fpm/fpm/events/devpoll.c q = q->next; /* iterate */ next 175 sapi/fpm/fpm/events/poll.c q = q->next; /* iterate */ next 131 sapi/fpm/fpm/events/select.c q = q->next; /* iterate */ next 96 sapi/fpm/fpm/fpm.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 96 sapi/fpm/fpm/fpm_children.c child->next = wp->children; next 97 sapi/fpm/fpm/fpm_children.c if (child->next) { next 98 sapi/fpm/fpm/fpm_children.c child->next->prev = child; next 111 sapi/fpm/fpm/fpm_children.c child->prev->next = child->next; next 113 sapi/fpm/fpm/fpm_children.c child->wp->children = child->next; next 116 sapi/fpm/fpm/fpm_children.c if (child->next) { next 117 sapi/fpm/fpm/fpm_children.c child->next->prev = child->prev; next 127 sapi/fpm/fpm/fpm_children.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 129 sapi/fpm/fpm/fpm_children.c for (child = wp->children; child; child = child->next) { next 166 sapi/fpm/fpm/fpm_children.c struct fpm_child_s *next; next 168 sapi/fpm/fpm/fpm_children.c for (; child; child = next) { next 169 sapi/fpm/fpm/fpm_children.c next = child->next; next 341 sapi/fpm/fpm/fpm_children.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 23 sapi/fpm/fpm/fpm_children.h struct fpm_child_s *prev, *next; next 579 sapi/fpm/fpm/fpm_conf.c kv->next = **parent; next 612 sapi/fpm/fpm/fpm_conf.c if (!tmp->next) { next 613 sapi/fpm/fpm/fpm_conf.c tmp->next = wp; next 616 sapi/fpm/fpm/fpm_conf.c tmp = tmp->next; next 649 sapi/fpm/fpm/fpm_conf.c kv_next = kv->next; next 655 sapi/fpm/fpm/fpm_conf.c kv_next = kv->next; next 661 sapi/fpm/fpm/fpm_conf.c kv_next = kv->next; next 740 sapi/fpm/fpm/fpm_conf.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1062 sapi/fpm/fpm/fpm_conf.c for (kv = wp->config->php_values; kv; kv = kv->next) { next 1069 sapi/fpm/fpm/fpm_conf.c for (kv = wp->config->php_admin_values; kv; kv = kv->next) { next 1080 sapi/fpm/fpm/fpm_conf.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1081 sapi/fpm/fpm/fpm_conf.c for (wp2 = fpm_worker_all_pools; wp2; wp2 = wp2->next) { next 1203 sapi/fpm/fpm/fpm_conf.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1300 sapi/fpm/fpm/fpm_conf.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1565 sapi/fpm/fpm/fpm_conf.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1605 sapi/fpm/fpm/fpm_conf.c for (kv = wp->config->env; kv; kv = kv->next) { next 1609 sapi/fpm/fpm/fpm_conf.c for (kv = wp->config->php_values; kv; kv = kv->next) { next 1613 sapi/fpm/fpm/fpm_conf.c for (kv = wp->config->php_admin_values; kv; kv = kv->next) { next 18 sapi/fpm/fpm/fpm_conf.h struct key_value_s *next; next 148 sapi/fpm/fpm/fpm_env.c for (kv = wp->config->env; kv; kv = kv->next) { next 168 sapi/fpm/fpm/fpm_env.c for (kv = wp->config->env; kv; kv = kv->next) { next 205 sapi/fpm/fpm/fpm_env.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 136 sapi/fpm/fpm/fpm_events.c queue = queue->next; next 160 sapi/fpm/fpm/fpm_events.c elt->next = NULL; next 165 sapi/fpm/fpm/fpm_events.c elt->next = *queue; next 188 sapi/fpm/fpm/fpm_events.c q->prev->next = q->next; next 190 sapi/fpm/fpm/fpm_events.c if (q->next) { next 191 sapi/fpm/fpm/fpm_events.c q->next->prev = q->prev; next 194 sapi/fpm/fpm/fpm_events.c *queue = q->next; next 208 sapi/fpm/fpm/fpm_events.c q = q->next; next 229 sapi/fpm/fpm/fpm_events.c q = q->next; next 325 sapi/fpm/fpm/fpm_events.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 400 sapi/fpm/fpm/fpm_events.c q = q->next; next 438 sapi/fpm/fpm/fpm_events.c q->prev->next = q->next; next 440 sapi/fpm/fpm/fpm_events.c if (q->next) { next 441 sapi/fpm/fpm/fpm_events.c q->next->prev = q->prev; next 444 sapi/fpm/fpm/fpm_events.c fpm_event_queue_timer = q->next; next 449 sapi/fpm/fpm/fpm_events.c q = q->next; next 455 sapi/fpm/fpm/fpm_events.c q = q->next; next 28 sapi/fpm/fpm/fpm_events.h struct fpm_event_queue_s *next; next 39 sapi/fpm/fpm/fpm_log.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 87 sapi/fpm/fpm/fpm_log.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 1435 sapi/fpm/fpm/fpm_main.c kv.next = NULL; next 121 sapi/fpm/fpm/fpm_php.c for (kv = wp->config->php_values; kv; kv = kv->next) { next 127 sapi/fpm/fpm/fpm_php.c for (kv = wp->config->php_admin_values; kv; kv = kv->next) { next 151 sapi/fpm/fpm/fpm_process_ctl.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 154 sapi/fpm/fpm/fpm_process_ctl.c for (child = wp->children; child; child = child->next) { next 296 sapi/fpm/fpm/fpm_process_ctl.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 302 sapi/fpm/fpm/fpm_process_ctl.c for (child = wp->children; child; child = child->next) { next 314 sapi/fpm/fpm/fpm_process_ctl.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 324 sapi/fpm/fpm/fpm_process_ctl.c for (child = wp->children; child; child = child->next) { next 522 sapi/fpm/fpm/fpm_process_ctl.c for (child = wp->children; child; child = child->next) { next 44 sapi/fpm/fpm/fpm_scoreboard.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 346 sapi/fpm/fpm/fpm_sockets.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 22 sapi/fpm/fpm/fpm_systemd.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 358 sapi/fpm/fpm/fpm_unix.c for (wp = fpm_worker_all_pools; wp; wp = wp->next) { next 41 sapi/fpm/fpm/fpm_worker_pool.c wp_next = wp->next; next 22 sapi/fpm/fpm/fpm_worker_pool.h struct fpm_worker_pool_s *next; next 418 sapi/nsapi/nsapi.c entry=entry->next; next 442 sapi/nsapi/nsapi.c entry=entry->next; next 694 sapi/nsapi/nsapi.c entry=entry->next; next 867 sapi/nsapi/nsapi.c entry=entry->next; next 495 sapi/thttpd/thttpd.c struct qreq *next; next 550 sapi/thttpd/thttpd.c if (!(queued_requests = m->next)) next 579 sapi/thttpd/thttpd.c m->next = NULL; next 591 sapi/thttpd/thttpd.c last_qr->next = m; next 638 sapi/thttpd/thttpd.c if (!(prev->next = m->next)) next 641 sapi/thttpd/thttpd.c if (!(queued_requests = m->next)) next 649 sapi/thttpd/thttpd.c m = m->next;