next 48 bcmath/libbcmath/src/output.c struct stk_rec *next;
next 158 bcmath/libbcmath/src/output.c temp->next = digits;
next 170 bcmath/libbcmath/src/output.c digits = digits->next;
next 407 com_dotnet/com_wrapper.c ulong next = id+1;
next 410 com_dotnet/com_wrapper.c while(!zend_hash_index_exists(disp->dispid_to_name, next))
next 411 com_dotnet/com_wrapper.c next++;
next 413 com_dotnet/com_wrapper.c if (zend_hash_index_exists(disp->dispid_to_name, next)) {
next 414 com_dotnet/com_wrapper.c *pid = next;
next 1498 curl/interface.c for(slist = ci->certinfo[i]; slist; slist = slist->next) {
next 86 dba/libcdb/cdb_make.c head->next = c->head;
next 153 dba/libcdb/cdb_make.c for (x = c->head; x; x = x->next) {
next 186 dba/libcdb/cdb_make.c for (x = c->head; x; x = x->next) {
next 225 dba/libcdb/cdb_make.c x = x->next;
next 38 dba/libcdb/cdb_make.h struct cdb_hplist *next;
next 106 dba/libinifile/inifile.c inifile_line_free(&dba->next);
next 250 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 dba/libinifile/inifile.c php_stream_seek(dba->fp, dba->next.pos, SEEK_SET);
next 257 dba/libinifile/inifile.c inifile_line_free(&dba->next);
next 267 dba/libinifile/inifile.c inifile_line_free(&dba->next);
next 268 dba/libinifile/inifile.c dba->next = ln;
next 269 dba/libinifile/inifile.c dba->next.pos = php_stream_tell(dba->fp);
next 281 dba/libinifile/inifile.c dba->next.pos = php_stream_tell(dba->fp);
next 335 dba/libinifile/inifile.c inifile_line_free(&dba->next);
next 45 dba/libinifile/inifile.h line_type next;
next 1860 dom/document.c cur = cur->next;
next 1880 dom/document.c cur = cur->next;
next 1890 dom/document.c cur = cur->next;
next 1921 dom/document.c root = root->next;
next 103 dom/documentfragment.c cur = cur->next;
next 106 dom/documentfragment.c prop = prop->next;
next 113 dom/documentfragment.c cur = cur->next;
next 227 dom/dom_iterators.c curnode = curnode->next;
next 297 dom/element.c ns = ns->next;
next 316 dom/element.c nsPtr = nsPtr->next;
next 794 dom/element.c tmpnsptr = nsptr->next;
next 801 dom/element.c tmpnsptr = tmpnsptr->next;
next 107 dom/namednodemap.c while (curnode->next != NULL) {
next 109 dom/namednodemap.c curnode = curnode->next;
next 238 dom/namednodemap.c curnode = (xmlNodePtr)curnode->next;
next 171 dom/node.c nsdftptr = curns->next;
next 175 dom/node.c curns->next = NULL;
next 179 dom/node.c prevns->next = nsdftptr;
next 598 dom/node.c nextsib = nodep->next;
next 821 dom/node.c curns = curns->next;
next 960 dom/node.c prevsib->next = newchild;
next 966 dom/node.c fragment->last->next = nextsib;
next 984 dom/node.c node = node->next;
next 1066 dom/node.c new_child->next = refp;
next 1070 dom/node.c new_child->prev->next = new_child;
next 1116 dom/node.c child->next = new_child;
next 1211 dom/node.c children = children->next;
next 1218 dom/node.c nextsib = oldchild->next;
next 1287 dom/node.c children = children->next;
next 1361 dom/node.c child->next = new_child;
next 76 dom/nodelist.c while (curnode->next != NULL) {
next 78 dom/nodelist.c curnode = curnode->next;
next 149 dom/nodelist.c curnode = curnode->next;
next 1054 dom/php_dom.c node = node->next;
next 1496 dom/php_dom.c nodep = nodep->next;
next 1514 dom/php_dom.c nextp = child->next;
next 1517 dom/php_dom.c newnextp = nextp->next;
next 1534 dom/php_dom.c attr = attr->next;
next 1543 dom/php_dom.c child = child->next;
next 1568 dom/php_dom.c while (cur->next != NULL) {
next 1569 dom/php_dom.c cur = cur->next;
next 1571 dom/php_dom.c cur->next = ns;
next 1657 dom/php_dom.c cur = cur->next;
next 1666 dom/php_dom.c cur = cur->next;
next 125 dom/text.c node = node->next;
next 51 enchant/enchant.c enchant_dict *next;
next 275 enchant/enchant.c pdict->pbroker->dict[pdict->id-1]->next = NULL;
next 567 enchant/enchant.c dict->next = NULL;
next 571 enchant/enchant.c pbroker->dict[pos-1]->next = dict;
next 623 enchant/enchant.c dict->next = NULL;
next 626 enchant/enchant.c pbroker->dict[pos-1]->next = dict;
next 22 ereg/regex/regcomp.c unsigned char *next; /* next character in RE */
next 43 ereg/regex/regcomp.c #define PEEK() (*p->next)
next 44 ereg/regex/regcomp.c #define PEEK2() (*(p->next+1))
next 45 ereg/regex/regcomp.c #define MORE() (p->next < p->end)
next 46 ereg/regex/regcomp.c #define MORE2() (p->next+1 < p->end)
next 51 ereg/regex/regcomp.c #define NEXT() (p->next++)
next 52 ereg/regex/regcomp.c #define NEXT2() (p->next += 2)
next 53 ereg/regex/regcomp.c #define NEXTn(n) (p->next += (n))
next 54 ereg/regex/regcomp.c #define GETNEXT() (*p->next++)
next 130 ereg/regex/regcomp.c p->next = (unsigned char *)pattern; /* convenience; we do not modify it */
next 131 ereg/regex/regcomp.c p->end = p->next + len;
next 589 ereg/regex/regcomp.c if (p->next + 5 < p->end && strncmp(p->next, "[:<:]]", 6) == 0) {
next 594 ereg/regex/regcomp.c if (p->next + 5 < p->end && strncmp(p->next, "[:>:]]", 6) == 0) {
next 726 ereg/regex/regcomp.c register unsigned char *sp = p->next;
next 734 ereg/regex/regcomp.c len = p->next - sp;
next 797 ereg/regex/regcomp.c register unsigned char *sp = p->next;
next 807 ereg/regex/regcomp.c len = p->next - sp;
next 845 ereg/regex/regcomp.c register unsigned char *oldnext = p->next;
next 850 ereg/regex/regcomp.c p->next = bracket;
next 856 ereg/regex/regcomp.c assert(p->next == bracket+2);
next 857 ereg/regex/regcomp.c p->next = oldnext;
next 891 ereg/regex/regcomp.c register unsigned char *oldnext = p->next;
next 895 ereg/regex/regcomp.c p->next = bracket;
next 902 ereg/regex/regcomp.c assert(p->next == bracket+3);
next 903 ereg/regex/regcomp.c p->next = oldnext;
next 990 ereg/regex/regcomp.c p->next = nuls; /* try to bring things to a halt */
next 292 fileinfo/libmagic/apprentice.c mlist->prev->next = ml;
next 294 fileinfo/libmagic/apprentice.c ml->next = mlist;
next 349 fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist;
next 358 fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist;
next 546 fileinfo/libmagic/apprentice.c for (ml = mlist->next; ml != mlist; ml = ml->next) {
next 338 fileinfo/libmagic/file.h struct mlist *next, *prev;
next 256 fileinfo/libmagic/magic.c for (ml = mlist->next; ml != mlist;) {
next 257 fileinfo/libmagic/magic.c struct mlist *next = ml->next;
next 261 fileinfo/libmagic/magic.c ml = next;
next 79 fileinfo/libmagic/softmagic.c for (ml = ms->mlist->next; ml != ms->mlist; ml = ml->next)
next 84 gd/gdcache.c elem = elem->next;
next 102 gd/gdcache.c prev->next = elem->next;
next 103 gd/gdcache.c elem->next = head->mru;
next 110 gd/gdcache.c elem = elem->next;
next 123 gd/gdcache.c prevprev->next = NULL;
next 128 gd/gdcache.c elem->next = head->mru;
next 60 gd/gdcache.h gdCache_element_t *next;
next 410 gd/libgd/gd_jpeg.c marker = marker->next;
next 84 gd/libgd/gdcache.c elem = elem->next;
next 105 gd/libgd/gdcache.c prev->next = elem->next;
next 106 gd/libgd/gdcache.c elem->next = head->mru;
next 113 gd/libgd/gdcache.c elem = elem->next;
next 129 gd/libgd/gdcache.c prevprev->next = NULL;
next 134 gd/libgd/gdcache.c elem->next = head->mru;
next 59 gd/libgd/gdcache.h gdCache_element_t *next;
next 791 gd/libgd/gdft.c char *next;
next 916 gd/libgd/gdft.c next = tmpstr;
next 919 gd/libgd/gdft.c next = string;
next 924 gd/libgd/gdft.c while (*next) {
next 925 gd/libgd/gdft.c ch = *next;
next 934 gd/libgd/gdft.c next++;
next 939 gd/libgd/gdft.c if (!*(++next)) break;
next 964 gd/libgd/gdft.c len = gdTcl_UtfToUniChar (next, &ch);
next 966 gd/libgd/gdft.c next += len;
next 975 gd/libgd/gdft.c len = gdTcl_UtfToUniChar(next, &ch);
next 976 gd/libgd/gdft.c next += len;
next 983 gd/libgd/gdft.c c = *next;
next 985 gd/libgd/gdft.c next++;
next 986 gd/libgd/gdft.c jiscode = 0x100 * (c & 0x7F) + ((*next) & 0x7F);
next 1009 gd/libgd/gdft.c if (*next) next++;
next 1018 gd/libgd/gdft.c ch = (*next) & 0xFF; /* don't extend sign */
next 1019 gd/libgd/gdft.c next++;
next 1021 gd/libgd/gdft.c && *next) { /* don't advance past '\0' */
next 1023 gd/libgd/gdft.c ch = (ch * 256) + ((*next) & 255);
next 1024 gd/libgd/gdft.c next++;
next 674 imap/php_imap.c FOBJECTLIST *cur, *next;
next 676 imap/php_imap.c for (cur=*foblist, next=cur->next; cur; cur=next) {
next 677 imap/php_imap.c next = cur->next;
next 714 imap/php_imap.c mail_free_errorlist (&(*errlist)->next);
next 740 imap/php_imap.c MESSAGELIST *cur, *next;
next 742 imap/php_imap.c for (cur = *msglist, next = cur->next; cur; cur = next) {
next 743 imap/php_imap.c next = cur->next;
next 768 imap/php_imap.c for(; qlist; qlist = qlist->next) {
next 795 imap/php_imap.c for(; alist; alist = alist->next) {
next 1084 imap/php_imap.c ecur = ecur->next;
next 1096 imap/php_imap.c acur = acur->next;
next 1486 imap/php_imap.c limits.next = NIL;
next 1867 imap/php_imap.c cur=cur->next;
next 1918 imap/php_imap.c cur=cur->next;
next 1952 imap/php_imap.c cur=cur->next;
next 2174 imap/php_imap.c cur=cur->next;
next 2224 imap/php_imap.c cur=cur->next;
next 2624 imap/php_imap.c addr->next=NIL;
next 2678 imap/php_imap.c } while ((addresstmp = addresstmp->next));
next 3130 imap/php_imap.c mypgm->next = NIL;
next 3350 imap/php_imap.c } while ((dpar = dpar->next));
next 3373 imap/php_imap.c } while ((par = par->next));
next 3428 imap/php_imap.c env->from->next=NULL;
next 3435 imap/php_imap.c env->to->next = NULL;
next 3551 imap/php_imap.c custom_headers_param->next = tmp_param;
next 3580 imap/php_imap.c tmp_param->next = bod->parameter;
next 3594 imap/php_imap.c disp_param->next = tmp_param;
next 3628 imap/php_imap.c disp_param->next = tmp_param;
next 3673 imap/php_imap.c mypart->next = mail_newbody_part();
next 3674 imap/php_imap.c mypart = mypart->next;
next 3693 imap/php_imap.c tmp_param->next = bod->parameter;
next 3707 imap/php_imap.c disp_param->next = tmp_param;
next 3741 imap/php_imap.c disp_param->next = tmp_param;
next 3773 imap/php_imap.c if (bod && bod->type == TYPEMULTIPART && (!bod->nested.part || !bod->nested.part->next)) {
next 3801 imap/php_imap.c } while ((custom_headers_param = custom_headers_param->next));
next 3823 imap/php_imap.c for (param = bod->parameter; param && !cookie; param = param->next) {
next 3856 imap/php_imap.c } while ((part = part->next)); /* until done */
next 3937 imap/php_imap.c addr = addr->next;
next 3966 imap/php_imap.c addr = addr->next;
next 3992 imap/php_imap.c addr = addr->next;
next 4125 imap/php_imap.c cur = cur->next;
next 4152 imap/php_imap.c cur = cur->next;
next 4179 imap/php_imap.c cur = cur->next;
next 4203 imap/php_imap.c if (cur->next == NIL) {
next 4206 imap/php_imap.c cur = cur->next;
next 4390 imap/php_imap.c } while ((tmp = tmp->next));
next 4441 imap/php_imap.c } while ((addresstmp = addresstmp->next));
next 4602 imap/php_imap.c } while ((dpar = dpar->next));
next 4625 imap/php_imap.c } while ((par = par->next));
next 4637 imap/php_imap.c for (part = body->CONTENT_PART; part; part = part->next) {
next 4673 imap/php_imap.c if(cur->next) {
next 4676 imap/php_imap.c build_thread_tree_helper(cur->next, tree, numNodes, buf);
next 4859 imap/php_imap.c IMAPG(imap_messages)->next = NIL;
next 4863 imap/php_imap.c cur->next = mail_newmessagelist();
next 4864 imap/php_imap.c cur = cur->next;
next 4866 imap/php_imap.c cur->next = NIL;
next 4893 imap/php_imap.c IMAPG(imap_alertstack)->next = NIL;
next 4896 imap/php_imap.c while (cur->next != NIL) {
next 4897 imap/php_imap.c cur = cur->next;
next 4899 imap/php_imap.c cur->next = mail_newstringlist ();
next 4900 imap/php_imap.c cur = cur->next;
next 4902 imap/php_imap.c cur->next = NIL;
next 4921 imap/php_imap.c IMAPG(imap_folder_objects)->next = NIL;
next 4925 imap/php_imap.c ocur->next=mail_newfolderobjectlist();
next 4926 imap/php_imap.c ocur=ocur->next;
next 4930 imap/php_imap.c ocur->next = NIL;
next 4940 imap/php_imap.c IMAPG(imap_folders)->next=NIL;
next 4944 imap/php_imap.c cur->next=mail_newstringlist ();
next 4945 imap/php_imap.c cur=cur->next;
next 4947 imap/php_imap.c cur->next = NIL;
next 4968 imap/php_imap.c IMAPG(imap_sfolder_objects)->next = NIL;
next 4972 imap/php_imap.c ocur->next=mail_newfolderobjectlist();
next 4973 imap/php_imap.c ocur=ocur->next;
next 4977 imap/php_imap.c ocur->next = NIL;
next 4985 imap/php_imap.c IMAPG(imap_sfolders)->next=NIL;
next 4989 imap/php_imap.c cur->next=mail_newstringlist ();
next 4990 imap/php_imap.c cur=cur->next;
next 4992 imap/php_imap.c cur->next = NIL;
next 5031 imap/php_imap.c IMAPG(imap_errorstack)->next = NIL;
next 5034 imap/php_imap.c while (cur->next != NIL) {
next 5035 imap/php_imap.c cur = cur->next;
next 5037 imap/php_imap.c cur->next = mail_newerrorlist();
next 5038 imap/php_imap.c cur = cur->next;
next 5041 imap/php_imap.c cur->next = NIL;
next 84 imap/php_imap.h struct php_imap_mailbox_struct *next;
next 90 imap/php_imap.h struct php_imap_error_struct *next;
next 95 imap/php_imap.h struct _php_imap_message_struct *next;
next 906 interbase/ibase_query.c ib_query->link->tr_list->next = NULL;
next 910 interbase/ibase_query.c for (l = &ib_query->link->tr_list; *l != NULL; l = &(*l)->next);
next 913 interbase/ibase_query.c (*l)->next = NULL;
next 619 interbase/interbase.c l = l->next;
next 686 interbase/interbase.c for (l = &trans->db_link[i]->tr_list; *l != NULL; l = &(*l)->next) {
next 689 interbase/interbase.c *l = p->next;
next 1112 interbase/interbase.c for (l = ib_link->tr_list; l != NULL; l = l->next) {
next 1261 interbase/interbase.c ib_link[i]->tr_list->next = NULL;
next 1265 interbase/interbase.c for (l = &ib_link[i]->tr_list; *l != NULL; l = &(*l)->next);
next 1268 interbase/interbase.c (*l)->next = NULL;
next 1286 interbase/interbase.c ib_link->tr_list->next = NULL;
next 89 interbase/php_ibase_includes.h struct tr_list *next;
next 806 intl/grapheme/grapheme_string.c zval *next = NULL; /* return offset of next part of the string */
next 808 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 816 intl/grapheme/grapheme_string.c if ( NULL != next ) {
next 817 intl/grapheme/grapheme_string.c if ( !PZVAL_IS_REF(next) ) {
next 825 intl/grapheme/grapheme_string.c zval_dtor(next);
next 826 intl/grapheme/grapheme_string.c ZVAL_LONG(next, lstart);
next 879 intl/grapheme/grapheme_string.c if ( NULL != next ) {
next 880 intl/grapheme/grapheme_string.c ZVAL_LONG(next, start+nsize);
next 922 intl/grapheme/grapheme_string.c if ( NULL != next ) {
next 923 intl/grapheme/grapheme_string.c ZVAL_LONG(next, start+ret_pos);
next 254 libxml/libxml.c curnode = node->next;
next 998 mbstring/oniguruma/regparse.c struct _FreeNode* next;
next 1029 mbstring/oniguruma/regparse.c n->next = FreeNodeList;
next 1080 mbstring/oniguruma/regparse.c n->next = FreeNodeList;
next 1098 mbstring/oniguruma/regparse.c FreeNodeList = FreeNodeList->next;
next 1115 mbstring/oniguruma/regparse.c FreeNodeList = FreeNodeList->next;
next 2698 mbstring/oniguruma/regparse.c if (IS_NOT_NULL(next))
next 2699 mbstring/oniguruma/regparse.c *next = q;
next 38 mbstring/oniguruma/st.c st_table_entry *next;
next 219 mbstring/oniguruma/st.c register st_table_entry *ptr, *next;
next 225 mbstring/oniguruma/st.c next = ptr->next;
next 227 mbstring/oniguruma/st.c ptr = next;
next 248 mbstring/oniguruma/st.c while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\
next 249 mbstring/oniguruma/st.c ptr = ptr->next;\
next 251 mbstring/oniguruma/st.c ptr = ptr->next;\
next 289 mbstring/oniguruma/st.c entry->next = table->bins[bin_pos];\
next 333 mbstring/oniguruma/st.c register st_table_entry *ptr, *next, **new_bins;
next 343 mbstring/oniguruma/st.c next = ptr->next;
next 345 mbstring/oniguruma/st.c ptr->next = new_bins[hash_val];
next 347 mbstring/oniguruma/st.c ptr = next;
next 388 mbstring/oniguruma/st.c entry->next = new_table->bins[i];
next 390 mbstring/oniguruma/st.c ptr = ptr->next;
next 415 mbstring/oniguruma/st.c table->bins[hash_val] = ptr->next;
next 423 mbstring/oniguruma/st.c for(; ptr->next != 0; ptr = ptr->next) {
next 424 mbstring/oniguruma/st.c if (EQUAL(table, ptr->next->key, *key)) {
next 425 mbstring/oniguruma/st.c tmp = ptr->next;
next 426 mbstring/oniguruma/st.c ptr->next = ptr->next->next;
next 456 mbstring/oniguruma/st.c for(; ptr != 0; ptr = ptr->next) {
next 506 mbstring/oniguruma/st.c for (tmp = table->bins[i]; tmp; tmp=tmp->next) {
next 517 mbstring/oniguruma/st.c ptr = ptr->next;
next 524 mbstring/oniguruma/st.c table->bins[i] = ptr->next;
next 527 mbstring/oniguruma/st.c last->next = ptr->next;
next 529 mbstring/oniguruma/st.c ptr = ptr->next;
next 48 mysqli/mysqli_warning.c w = w->next;
next 94 mysqli/mysqli_warning.c prev->next = w;
next 171 mysqli/mysqli_warning.c prev->next = (void *)w;
next 200 mysqli/mysqli_warning.c if (w && w->next) {
next 201 mysqli/mysqli_warning.c w = w->next;
next 333 mysqli/mysqli_warning.c PHP_ME(mysqli_warning, next, NULL, ZEND_ACC_PUBLIC)
next 157 mysqli/php_mysqli_structs.h MYSQLI_WARNING *next;
next 521 pcntl/pcntl.c PCNTL_G(head) = sig->next;
next 526 pcntl/pcntl.c PCNTL_G(spares) = sig->next;
next 865 pcntl/pcntl.c psig->next = PCNTL_G(spares);
next 1214 pcntl/pcntl.c PCNTL_G(spares) = psig->next;
next 1217 pcntl/pcntl.c psig->next = NULL;
next 1222 pcntl/pcntl.c PCNTL_G(tail)->next = psig;
next 1232 pcntl/pcntl.c struct php_pcntl_pending_signal *queue, *next;
next 1269 pcntl/pcntl.c next = queue->next;
next 1270 pcntl/pcntl.c queue->next = PCNTL_G(spares);
next 1272 pcntl/pcntl.c queue = next;
next 63 pcntl/php_pcntl.h struct php_pcntl_pending_signal *next;
next 2889 pcre/pcrelib/pcre_compile.c unsigned int c, othercase, next;
next 2897 pcre/pcrelib/pcre_compile.c next = othercase + 1;
next 2901 pcre/pcrelib/pcre_compile.c if (UCD_OTHERCASE(c) != next) break;
next 2902 pcre/pcrelib/pcre_compile.c next++;
next 2905 pcre/pcrelib/pcre_compile.c *odptr = next - 1;
next 2999 pcre/pcrelib/pcre_compile.c pcre_int32 c, next;
next 3031 pcre/pcrelib/pcre_compile.c next = check_escape(&ptr, &temperrorcode, cd->bracount, options, FALSE);
next 3038 pcre/pcrelib/pcre_compile.c if (utf) { GETCHARINC(next, ptr); } else
next 3040 pcre/pcrelib/pcre_compile.c next = *ptr++;
next 3076 pcre/pcrelib/pcre_compile.c if (next >= 0) switch(op_code)
next 3084 pcre/pcrelib/pcre_compile.c return c != next;
next 3096 pcre/pcrelib/pcre_compile.c if (c == next) return FALSE;
next 3101 pcre/pcrelib/pcre_compile.c if (next < 128) othercase = cd->fcc[next]; else
next 3103 pcre/pcrelib/pcre_compile.c othercase = UCD_OTHERCASE((unsigned int)next);
next 3111 pcre/pcrelib/pcre_compile.c return (c != TABLE_GET((unsigned int)next, cd->fcc, next)); /* Non-UTF-8 mode */
next 3119 pcre/pcrelib/pcre_compile.c return c == next;
next 3127 pcre/pcrelib/pcre_compile.c if (c == next) return TRUE;
next 3132 pcre/pcrelib/pcre_compile.c if (next < 128) othercase = cd->fcc[next]; else
next 3134 pcre/pcrelib/pcre_compile.c othercase = UCD_OTHERCASE((unsigned int)next);
next 3142 pcre/pcrelib/pcre_compile.c return (c == TABLE_GET((unsigned int)next, cd->fcc, next)); /* Non-UTF-8 mode */
next 3148 pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_digit) == 0;
next 3151 pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_digit) != 0;
next 3154 pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_space) == 0;
next 3157 pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_space) != 0;
next 3160 pcre/pcrelib/pcre_compile.c return next > 255 || (cd->ctypes[next] & ctype_word) == 0;
next 3163 pcre/pcrelib/pcre_compile.c return next <= 255 && (cd->ctypes[next] & ctype_word) != 0;
next 3167 pcre/pcrelib/pcre_compile.c switch(next)
next 3196 pcre/pcrelib/pcre_compile.c switch(next)
next 3212 pcre/pcrelib/pcre_compile.c return check_char_prop(next, previous[0], previous[1], FALSE);
next 3215 pcre/pcrelib/pcre_compile.c return check_char_prop(next, previous[0], previous[1], TRUE);
next 3238 pcre/pcrelib/pcre_compile.c switch(-next)
next 3281 pcre/pcrelib/pcre_compile.c return -next != ESC_h;
next 3283 pcre/pcrelib/pcre_compile.c return -next == ESC_h;
next 3297 pcre/pcrelib/pcre_compile.c return -next != ESC_v;
next 3299 pcre/pcrelib/pcre_compile.c return -next == ESC_v;
next 3315 pcre/pcrelib/pcre_compile.c ptr = substitutes[-next - ESC_DU];
next 3316 pcre/pcrelib/pcre_compile.c next = check_escape(&ptr, &temperrorcode, 0, options, FALSE);
next 3343 pcre/pcrelib/pcre_compile.c return check_char_prop(c, ptype, pdata, (next == -ESC_P) != negated);
next 3358 pcre/pcrelib/pcre_compile.c return next == -ESC_D || next == -ESC_s || next == -ESC_W ||
next 3359 pcre/pcrelib/pcre_compile.c next == -ESC_h || next == -ESC_v || next == -ESC_R;
next 3362 pcre/pcrelib/pcre_compile.c return next == -ESC_d;
next 3365 pcre/pcrelib/pcre_compile.c return next == -ESC_S || next == -ESC_d || next == -ESC_w;
next 3368 pcre/pcrelib/pcre_compile.c return next == -ESC_s || next == -ESC_h || next == -ESC_v || next == -ESC_R;
next 3371 pcre/pcrelib/pcre_compile.c return next == -ESC_S || next == -ESC_H || next == -ESC_d ||
next 3372 pcre/pcrelib/pcre_compile.c next == -ESC_w || next == -ESC_v || next == -ESC_R;
next 3375 pcre/pcrelib/pcre_compile.c return next == -ESC_h;
next 3380 pcre/pcrelib/pcre_compile.c return next == -ESC_V || next == -ESC_d || next == -ESC_w;
next 3383 pcre/pcrelib/pcre_compile.c return next == -ESC_v || next == -ESC_R;
next 3386 pcre/pcrelib/pcre_compile.c return next == -ESC_W || next == -ESC_s || next == -ESC_h ||
next 3387 pcre/pcrelib/pcre_compile.c next == -ESC_v || next == -ESC_R;
next 3390 pcre/pcrelib/pcre_compile.c return next == -ESC_w || next == -ESC_d;
next 5649 pcre/pcrelib/pcre_compile.c for (oc = cd->open_caps; oc != NULL; oc = oc->next)
next 6834 pcre/pcrelib/pcre_compile.c for (oc = cd->open_caps; oc != NULL; oc = oc->next)
next 7072 pcre/pcrelib/pcre_compile.c capitem.next = cd->open_caps;
next 7242 pcre/pcrelib/pcre_compile.c cd->open_caps = cd->open_caps->next;
next 593 pcre/pcrelib/pcre_exec.c const pcre_uchar *next;
next 859 pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1);
next 860 pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next &&
next 861 pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT))
next 972 pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1);
next 973 pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next &&
next 974 pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT))
next 1059 pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1);
next 1060 pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next &&
next 1061 pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT))
next 1152 pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1);
next 1153 pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next &&
next 1154 pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT))
next 1223 pcre/pcrelib/pcre_exec.c next = ecode + GET(ecode,1);
next 1224 pcre/pcrelib/pcre_exec.c if (md->start_match_ptr < next &&
next 1225 pcre/pcrelib/pcre_exec.c (*ecode == OP_ALT || *next == OP_ALT))
next 1835 pcre/pcrelib/pcre_exec.c next = ecode + 1;
next 1836 pcre/pcrelib/pcre_exec.c RMATCH(eptr, next, offset_top, md, eptrb, RM10);
next 1838 pcre/pcrelib/pcre_exec.c do next += GET(next, 1); while (*next == OP_ALT);
next 1839 pcre/pcrelib/pcre_exec.c ecode = next + 1 + LINK_SIZE;
next 1843 pcre/pcrelib/pcre_exec.c next = ecode + 1;
next 1844 pcre/pcrelib/pcre_exec.c do next += GET(next, 1); while (*next == OP_ALT);
next 1845 pcre/pcrelib/pcre_exec.c RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, eptrb, RM11);
next 1851 pcre/pcrelib/pcre_exec.c next = ecode+1;
next 1852 pcre/pcrelib/pcre_exec.c do next += GET(next,1); while (*next == OP_ALT);
next 1853 pcre/pcrelib/pcre_exec.c ecode = next + 1 + LINK_SIZE;
next 2013 pcre/pcrelib/pcre_internal.h struct open_capitem *next; /* Chain link */
next 409 pdo/pdo_sql_parser.c struct placeholder *next;
next 445 pdo/pdo_sql_parser.c plc->next = NULL;
next 451 pdo/pdo_sql_parser.c placetail->next = plc;
next 500 pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) {
next 522 pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) {
next 621 pdo/pdo_sql_parser.c plc = plc->next;
next 648 pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) {
next 689 pdo/pdo_sql_parser.c for (plc = placeholders; plc; plc = plc->next) {
next 706 pdo/pdo_sql_parser.c placeholders = plc->next;
next 39 pdo_sqlite/php_pdo_sqlite_int.h struct pdo_sqlite_func *next;
next 50 pdo_sqlite/php_pdo_sqlite_int.h struct pdo_sqlite_collation *next;
next 108 pdo_sqlite/sqlite_driver.c H->funcs = func->next;
next 136 pdo_sqlite/sqlite_driver.c H->collations = collation->next;
next 575 pdo_sqlite/sqlite_driver.c func->next = H->funcs;
next 655 pdo_sqlite/sqlite_driver.c func->next = H->funcs;
next 705 pdo_sqlite/sqlite_driver.c collation->next = H->collations;
next 48 session/mod_mm.c struct ps_sd *next;
next 91 session/mod_mm.c ps_sd *ps, *next;
next 103 session/mod_mm.c for (ps = *ohash; ps; ps = next) {
next 104 session/mod_mm.c next = ps->next;
next 105 session/mod_mm.c ps->next = nhash[ps->hv & nmax];
next 141 session/mod_mm.c sd->next = data->hash[slot];
next 146 session/mod_mm.c if (!sd->next) {
next 164 session/mod_mm.c data->hash[slot] = sd->next;
next 169 session/mod_mm.c for (prev = data->hash[slot]; prev->next != sd; prev = prev->next);
next 170 session/mod_mm.c prev->next = sd->next;
next 190 session/mod_mm.c for (prev = NULL, ret = data->hash[slot]; ret; prev = ret, ret = ret->next) {
next 199 session/mod_mm.c prev->next = ret->next;
next 202 session/mod_mm.c ret->next = data->hash[slot];
next 239 session/mod_mm.c ps_sd *sd, *next;
next 249 session/mod_mm.c for (sd = data->hash[h]; sd; sd = next) {
next 250 session/mod_mm.c next = sd->next;
next 417 session/mod_mm.c ps_sd *sd, *next;
next 430 session/mod_mm.c for (sd = *ohash; sd; sd = next) {
next 431 session/mod_mm.c next = sd->next;
next 169 simplexml/simplexml.c node = node->next;
next 190 simplexml/simplexml.c node = node->next;
next 232 simplexml/simplexml.c node = node->next;
next 316 simplexml/simplexml.c attr = attr->next;
next 324 simplexml/simplexml.c attr = attr->next;
next 576 simplexml/simplexml.c attr = attr->next;
next 585 simplexml/simplexml.c attr = attr->next;
next 622 simplexml/simplexml.c node = node->next;
next 791 simplexml/simplexml.c attr = attr->next;
next 800 simplexml/simplexml.c attr = attr->next;
next 821 simplexml/simplexml.c nnext = node->next;
next 831 simplexml/simplexml.c (!node->children || (node->children->type == XML_TEXT_NODE && !node->children->next &&
next 922 simplexml/simplexml.c attr = attr->next;
next 926 simplexml/simplexml.c anext = attr->next;
next 950 simplexml/simplexml.c nnext = node->next;
next 1116 simplexml/simplexml.c attr = attr->next;
next 1132 simplexml/simplexml.c if ( !node->children || !node->parent || node->children->next || node->children->children || node->parent->children == node->parent->last ) {
next 1145 simplexml/simplexml.c if (node->children != NULL || node->prev != NULL || node->next != NULL) {
next 1180 simplexml/simplexml.c node = php_sxe_iterator_fetch(sxe, node->next, 0 TSRMLS_CC);
next 1182 simplexml/simplexml.c node = node->next;
next 1461 simplexml/simplexml.c attr = attr->next;
next 1470 simplexml/simplexml.c node = node->next;
next 1511 simplexml/simplexml.c ns = ns->next;
next 1517 simplexml/simplexml.c node = node->next;
next 1883 simplexml/simplexml.c node = php_sxe_iterator_fetch(sxe, node->next, 0 TSRMLS_CC);
next 2293 simplexml/simplexml.c node = node->next;
next 2418 simplexml/simplexml.c php_sxe_iterator_fetch(sxe, node->next, 1 TSRMLS_CC);
next 149 simplexml/sxe.c node = node->next;
next 181 simplexml/sxe.c PHP_ME(ce_SimpleXMLIterator, next, arginfo_simplexmliterator__void, ZEND_ACC_PUBLIC)
next 317 soap/php_encoding.c attr = attr->next;
next 688 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 704 soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) {
next 721 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 738 soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) {
next 755 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 772 soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) {
next 792 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 799 soap/php_encoding.c } else if (data->children->type == XML_CDATA_SECTION_NODE && data->children->next == NULL) {
next 824 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 826 soap/php_encoding.c } else if (data->children->type != XML_CDATA_SECTION_NODE || data->children->next != NULL) {
next 1029 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 1070 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 1161 soap/php_encoding.c if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
next 1313 soap/php_encoding.c while (node->next != NULL) {
next 1314 soap/php_encoding.c zval* val2 = master_to_zval(get_conversion(XSD_ANYXML), node->next TSRMLS_CC);
next 1320 soap/php_encoding.c node = node->next;
next 1363 soap/php_encoding.c node = node->next;
next 1400 soap/php_encoding.c if ((node = get_node(node->next, model->u.element->name)) != NULL) {
next 1426 soap/php_encoding.c } while ((node = get_node(node->next, model->u.element->name)) != NULL);
next 1652 soap/php_encoding.c if (!trav->next || !get_node(trav->next, (char*)trav->name)) {
next 1679 soap/php_encoding.c trav = trav->next;
next 2774 soap/php_encoding.c trav = trav->next;
next 2953 soap/php_encoding.c trav = trav->next;
next 3140 soap/php_encoding.c char *str, *start, *next;
next 3155 soap/php_encoding.c next = strchr(start,' ');
next 3156 soap/php_encoding.c if (next != NULL) {
next 3157 soap/php_encoding.c *next = '\0';
next 3158 soap/php_encoding.c next++;
next 3173 soap/php_encoding.c start = next;
next 3270 soap/php_encoding.c ret->next = NULL;
next 3272 soap/php_encoding.c parent->last->next = ret;
next 3426 soap/php_encoding.c href = href->next;
next 3496 soap/php_encoding.c cur = cur->next;
next 74 soap/php_packet_soap.c trav = trav->next;
next 99 soap/php_packet_soap.c attr = attr->next;
next 106 soap/php_packet_soap.c trav = trav->next;
next 110 soap/php_packet_soap.c trav = trav->next;
next 116 soap/php_packet_soap.c trav = trav->next;
next 120 soap/php_packet_soap.c trav = trav->next;
next 123 soap/php_packet_soap.c trav = trav->next;
next 149 soap/php_packet_soap.c attr = attr->next;
next 175 soap/php_packet_soap.c attr = attr->next;
next 253 soap/php_packet_soap.c resp = resp->next;
next 309 soap/php_packet_soap.c if (val == NULL && cur->children && cur->children->next == NULL) {
next 346 soap/php_packet_soap.c val = val->next;
next 357 soap/php_packet_soap.c } else if (val->next && get_node(val->next, (char*)val->name)) {
next 372 soap/php_packet_soap.c val = val->next;
next 420 soap/php_packet_soap.c trav = trav->next;
next 268 soap/php_schema.c trav = trav->next;
next 291 soap/php_schema.c trav = trav->next;
next 376 soap/php_schema.c trav = trav->next;
next 381 soap/php_schema.c trav = trav->next;
next 385 soap/php_schema.c trav = trav->next;
next 389 soap/php_schema.c trav = trav->next;
next 447 soap/php_schema.c trav = trav->next;
next 477 soap/php_schema.c trav = trav->next;
next 500 soap/php_schema.c char *str, *start, *end, *next;
next 510 soap/php_schema.c next = NULL;
next 513 soap/php_schema.c next = end+1;
next 538 soap/php_schema.c start = next;
next 546 soap/php_schema.c trav = trav->next;
next 576 soap/php_schema.c trav = trav->next;
next 598 soap/php_schema.c trav = trav->next;
next 604 soap/php_schema.c trav = trav->next;
next 608 soap/php_schema.c trav = trav->next;
next 665 soap/php_schema.c trav = trav->next;
next 669 soap/php_schema.c trav = trav->next;
next 708 soap/php_schema.c trav = trav->next;
next 718 soap/php_schema.c trav = trav->next;
next 723 soap/php_schema.c trav = trav->next;
next 765 soap/php_schema.c trav = trav->next;
next 770 soap/php_schema.c trav = trav->next;
next 773 soap/php_schema.c trav = trav->next;
next 776 soap/php_schema.c trav = trav->next;
next 779 soap/php_schema.c trav = trav->next;
next 789 soap/php_schema.c trav = trav->next;
next 794 soap/php_schema.c trav = trav->next;
next 890 soap/php_schema.c trav = trav->next;
next 899 soap/php_schema.c trav = trav->next;
next 904 soap/php_schema.c trav = trav->next;
next 945 soap/php_schema.c trav = trav->next;
next 950 soap/php_schema.c trav = trav->next;
next 953 soap/php_schema.c trav = trav->next;
next 956 soap/php_schema.c trav = trav->next;
next 959 soap/php_schema.c trav = trav->next;
next 969 soap/php_schema.c trav = trav->next;
next 974 soap/php_schema.c trav = trav->next;
next 1033 soap/php_schema.c trav = trav->next;
next 1041 soap/php_schema.c trav = trav->next;
next 1139 soap/php_schema.c trav = trav->next;
next 1148 soap/php_schema.c trav = trav->next;
next 1155 soap/php_schema.c trav = trav->next;
next 1162 soap/php_schema.c trav = trav->next;
next 1201 soap/php_schema.c trav = trav->next;
next 1217 soap/php_schema.c trav = trav->next;
next 1251 soap/php_schema.c trav = trav->next;
next 1267 soap/php_schema.c trav = trav->next;
next 1313 soap/php_schema.c trav = trav->next;
next 1319 soap/php_schema.c trav = trav->next;
next 1323 soap/php_schema.c trav = trav->next;
next 1414 soap/php_schema.c trav = trav->next;
next 1419 soap/php_schema.c trav = trav->next;
next 1422 soap/php_schema.c trav = trav->next;
next 1426 soap/php_schema.c trav = trav->next;
next 1429 soap/php_schema.c trav = trav->next;
next 1432 soap/php_schema.c trav = trav->next;
next 1435 soap/php_schema.c trav = trav->next;
next 1444 soap/php_schema.c trav = trav->next;
next 1449 soap/php_schema.c trav = trav->next;
next 1661 soap/php_schema.c trav = trav->next;
next 1671 soap/php_schema.c trav = trav->next;
next 1679 soap/php_schema.c trav = trav->next;
next 1692 soap/php_schema.c trav = trav->next;
next 1864 soap/php_schema.c attr = attr->next;
next 1888 soap/php_schema.c trav = trav->next;
next 1912 soap/php_schema.c trav = trav->next;
next 1992 soap/php_schema.c trav = trav->next;
next 2010 soap/php_schema.c trav = trav->next;
next 2015 soap/php_schema.c trav = trav->next;
next 371 soap/php_sdl.c trav = trav->next;
next 384 soap/php_sdl.c trav2 = trav2->next;
next 445 soap/php_sdl.c trav = trav->next;
next 555 soap/php_sdl.c trav = trav->next;
next 660 soap/php_sdl.c trav = trav->next;
next 693 soap/php_sdl.c trav = trav->next;
next 726 soap/php_sdl.c trav = trav->next;
next 772 soap/php_sdl.c trav = trav->next;
next 817 soap/php_sdl.c trav2 = trav2->next;
next 820 soap/php_sdl.c if (has_soap_port || trav->next || i < n-1) {
next 822 soap/php_sdl.c trav = trav->next;
next 873 soap/php_sdl.c trav = trav->next;
next 913 soap/php_sdl.c trav2 = trav2->next;
next 938 soap/php_sdl.c trav3 = trav3->next;
next 1116 soap/php_sdl.c trav = trav->next;
next 1128 soap/php_sdl.c fault = fault->next;
next 1152 soap/php_sdl.c trav2 = trav2->next;
next 1161 soap/php_sdl.c trav= trav->next;
next 63 soap/php_xml.c trav = trav->next;
next 231 soap/php_xml.c node = node->next;
next 242 soap/php_xml.c node = node->next;
next 258 soap/php_xml.c node = node->next;
next 279 soap/php_xml.c node = node->next;
next 299 soap/php_xml.c node = node->next;
next 77 soap/php_xml.h } while ((n = n->next));
next 45 soap/soap.c struct _soapHeader *next;
next 1739 soap/soap.c header = header->next;
next 1929 soap/soap.c soap_headers = soap_headers->next;
next 2006 soap/soap.c p = &(*p)->next;
next 3296 soap/soap.c trav = trav->next;
next 3329 soap/soap.c trav = trav->next;
next 3397 soap/soap.c trav = trav->next;
next 3414 soap/soap.c attr = attr->next;
next 3421 soap/soap.c trav = trav->next;
next 3425 soap/soap.c trav = trav->next;
next 3431 soap/soap.c trav = trav->next;
next 3435 soap/soap.c trav = trav->next;
next 3438 soap/soap.c trav = trav->next;
next 3456 soap/soap.c attr = attr->next;
next 3475 soap/soap.c trav = trav->next;
next 3522 soap/soap.c attr = attr->next;
next 3607 soap/soap.c last->next = h;
next 3612 soap/soap.c trav = trav->next;
next 4051 soap/soap.c h = h->next;
next 4476 soap/soap.c node = node->next;
next 1919 spl/spl_array.c SPL_ME(Array, next, arginfo_array_void, ZEND_ACC_PUBLIC)
next 1994 spl/spl_directory.c SPL_ME(DirectoryIterator, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC)
next 2016 spl/spl_directory.c SPL_ME(DirectoryIterator, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC)
next 2973 spl/spl_directory.c SPL_ME(SplFileObject, next, arginfo_splfileinfo_void, ZEND_ACC_PUBLIC)
next 68 spl/spl_dllist.c struct _spl_ptr_llist_element *next;
next 147 spl/spl_dllist.c spl_ptr_llist_element *current = llist->head, *next;
next 151 spl/spl_dllist.c next = current->next;
next 156 spl/spl_dllist.c current = next;
next 180 spl/spl_dllist.c current = current->next;
next 195 spl/spl_dllist.c elem->next = llist->head;
next 219 spl/spl_dllist.c elem->next = NULL;
next 222 spl/spl_dllist.c llist->tail->next = elem;
next 246 spl/spl_dllist.c tail->prev->next = NULL;
next 300 spl/spl_dllist.c if (head->next) {
next 301 spl/spl_dllist.c head->next->prev = NULL;
next 306 spl/spl_dllist.c llist->head = head->next;
next 323 spl/spl_dllist.c spl_ptr_llist_element *current = from->head, *next;
next 327 spl/spl_dllist.c next = current->next;
next 334 spl/spl_dllist.c current = next;
next 511 spl/spl_dllist.c spl_ptr_llist_element *current = intern->llist->head, *next;
next 541 spl/spl_dllist.c next = current->next;
next 547 spl/spl_dllist.c current = next;
next 896 spl/spl_dllist.c element->prev->next = element->next;
next 899 spl/spl_dllist.c if (element->next) {
next 900 spl/spl_dllist.c element->next->prev = element->prev;
next 905 spl/spl_dllist.c llist->head = element->next;
next 975 spl/spl_dllist.c *traverse_pointer_ptr = old->next;
next 1141 spl/spl_dllist.c spl_ptr_llist_element *current = intern->llist->head, *next;
next 1160 spl/spl_dllist.c next = current->next;
next 1164 spl/spl_dllist.c current = next;
next 1329 spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, next, arginfo_dllist_void, ZEND_ACC_PUBLIC)
next 1092 spl/spl_fixedarray.c SPL_ME(SplFixedArray, next, arginfo_splfixedarray_void, ZEND_ACC_PUBLIC)
next 1191 spl/spl_heap.c SPL_ME(SplHeap, next, arginfo_splheap_void, ZEND_ACC_PUBLIC)
next 1206 spl/spl_heap.c SPL_ME(SplHeap, next, arginfo_splheap_void, ZEND_ACC_PUBLIC)
next 968 spl/spl_iterators.c SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 1247 spl/spl_iterators.c SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 2329 spl/spl_iterators.c SPL_ME(FilterIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 2569 spl/spl_iterators.c SPL_ME(LimitIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 2992 spl/spl_iterators.c SPL_ME(CachingIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 3077 spl/spl_iterators.c SPL_ME(dual_it, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 3186 spl/spl_iterators.c SPL_ME(NoRewindIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 3223 spl/spl_iterators.c SPL_ME(InfiniteIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 3280 spl/spl_iterators.c SPL_ME(EmptyIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 3455 spl/spl_iterators.c SPL_ME(AppendIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
next 975 spl/spl_observer.c SPL_ME(SplObjectStorage, next, arginfo_splobject_void,0)
next 1299 spl/spl_observer.c SPL_ME(MultipleIterator, next, arginfo_splobject_void, 0)
next 7343 sqlite3/libsqlite/sqlite3.c HashElem *next, *prev; /* Next and previous elements in the table */
next 7369 sqlite3/libsqlite/sqlite3.c #define sqliteHashNext(E) ((E)->next)
next 15500 sqlite3/libsqlite/sqlite3.c u32 next; /* Index in mem3.aPool[] of next free chunk */
next 15560 sqlite3/libsqlite/sqlite3.c u32 next = mem3.aPool[i].u.list.next;
next 15564 sqlite3/libsqlite/sqlite3.c *pRoot = next;
next 15566 sqlite3/libsqlite/sqlite3.c mem3.aPool[prev].u.list.next = next;
next 15568 sqlite3/libsqlite/sqlite3.c if( next ){
next 15569 sqlite3/libsqlite/sqlite3.c mem3.aPool[next].u.list.prev = prev;
next 15571 sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.next = 0;
next 15601 sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.next = *pRoot;
next 15732 sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[i].u.list.next;
next 15740 sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[prev].u.list.next;
next 15793 sqlite3/libsqlite/sqlite3.c for(i=mem3.aiHash[hash]; i>0; i=mem3.aPool[i].u.list.next){
next 16045 sqlite3/libsqlite/sqlite3.c for(j = mem3.aiSmall[i]; j>0; j=mem3.aPool[j].u.list.next){
next 16054 sqlite3/libsqlite/sqlite3.c for(j = mem3.aiHash[i]; j>0; j=mem3.aPool[j].u.list.next){
next 16170 sqlite3/libsqlite/sqlite3.c int next; /* Index of next free chunk */
next 16249 sqlite3/libsqlite/sqlite3.c int next, prev;
next 16254 sqlite3/libsqlite/sqlite3.c next = MEM5LINK(i)->next;
next 16257 sqlite3/libsqlite/sqlite3.c mem5.aiFreelist[iLogsize] = next;
next 16259 sqlite3/libsqlite/sqlite3.c MEM5LINK(prev)->next = next;
next 16261 sqlite3/libsqlite/sqlite3.c if( next>=0 ){
next 16262 sqlite3/libsqlite/sqlite3.c MEM5LINK(next)->prev = prev;
next 16277 sqlite3/libsqlite/sqlite3.c x = MEM5LINK(i)->next = mem5.aiFreelist[iLogsize];
next 16326 sqlite3/libsqlite/sqlite3.c i = MEM5LINK(i)->next;
next 16643 sqlite3/libsqlite/sqlite3.c for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){}
next 21745 sqlite3/libsqlite/sqlite3.c HashElem *next_elem = elem->next;
next 21783 sqlite3/libsqlite/sqlite3.c pNew->next = pHead;
next 21785 sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
next 21789 sqlite3/libsqlite/sqlite3.c pNew->next = pH->first;
next 21829 sqlite3/libsqlite/sqlite3.c next_elem = elem->next;
next 21860 sqlite3/libsqlite/sqlite3.c elem = elem->next;
next 21875 sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
next 21877 sqlite3/libsqlite/sqlite3.c pH->first = elem->next;
next 21879 sqlite3/libsqlite/sqlite3.c if( elem->next ){
next 21880 sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
next 21885 sqlite3/libsqlite/sqlite3.c pEntry->chain = elem->next;
next 48968 sqlite3/libsqlite/sqlite3.c u16 next, size;
next 48973 sqlite3/libsqlite/sqlite3.c next = get2byte(&data[pc]);
next 48975 sqlite3/libsqlite/sqlite3.c if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){
next 48981 sqlite3/libsqlite/sqlite3.c pc = next;
next 51233 sqlite3/libsqlite/sqlite3.c Pgno next = 0;
next 51259 sqlite3/libsqlite/sqlite3.c next = iGuess;
next 51266 sqlite3/libsqlite/sqlite3.c assert( next==0 || rc==SQLITE_DONE );
next 51271 sqlite3/libsqlite/sqlite3.c next = get4byte(pPage->aData);
next 51275 sqlite3/libsqlite/sqlite3.c *pPgnoNext = next;
next 111736 sqlite3/libsqlite/sqlite3.c Fts3HashElem *next, *prev; /* Next and previous elements in the table */
next 111787 sqlite3/libsqlite/sqlite3.c #define fts3HashNext(E) ((E)->next)
next 117956 sqlite3/libsqlite/sqlite3.c Fts3HashElem *next_elem = elem->next;
next 118046 sqlite3/libsqlite/sqlite3.c pNew->next = pHead;
next 118048 sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
next 118052 sqlite3/libsqlite/sqlite3.c pNew->next = pH->first;
next 118082 sqlite3/libsqlite/sqlite3.c next_elem = elem->next;
next 118111 sqlite3/libsqlite/sqlite3.c elem = elem->next;
next 118127 sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
next 118129 sqlite3/libsqlite/sqlite3.c pH->first = elem->next;
next 118131 sqlite3/libsqlite/sqlite3.c if( elem->next ){
next 118132 sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
next 118136 sqlite3/libsqlite/sqlite3.c pEntry->chain = elem->next;
next 56 sqlite3/php_sqlite3_structs.h struct _php_sqlite3_func *next;
next 67 sqlite3/php_sqlite3_structs.h struct _php_sqlite3_collation *next;
next 947 sqlite3/sqlite3.c func->next = db_obj->funcs;
next 1007 sqlite3/sqlite3.c func->next = db_obj->funcs;
next 1054 sqlite3/sqlite3.c collation->next = db_obj->collations;
next 2026 sqlite3/sqlite3.c intern->funcs = func->next;
next 2047 sqlite3/sqlite3.c intern->collations = collation->next;
next 3285 standard/basic_functions.c PHP_FE(next, arginfo_next)
next 3449 standard/basic_functions.c BG(next) = NULL;
next 194 standard/basic_functions.h php_uint32 *next; /* next random value is computed from here */
next 1227 standard/filestat.c bucket = bucket->next;
next 183 standard/html.c unsigned char next;
next 187 standard/html.c next = str[pos + 1];
next 189 standard/html.c if ((next >= 0x40 && next <= 0x7E) ||
next 190 standard/html.c (next >= 0xA1 && next <= 0xFE)) {
next 191 standard/html.c this_char = (c << 8) | next;
next 207 standard/html.c unsigned char next;
next 211 standard/html.c next = str[pos + 1];
next 213 standard/html.c if ((next >= 0x40 && next <= 0x7E) ||
next 214 standard/html.c (next >= 0xA1 && next <= 0xFE)) {
next 215 standard/html.c this_char = (c << 8) | next;
next 216 standard/html.c } else if (next != 0x80 && next != 0xFF) {
next 233 standard/html.c unsigned char next;
next 237 standard/html.c next = str[pos + 1];
next 239 standard/html.c if (gb2312_trail(next)) {
next 240 standard/html.c this_char = (c << 8) | next;
next 241 standard/html.c } else if (gb2312_lead(next)) {
next 260 standard/html.c unsigned char next;
next 264 standard/html.c next = str[pos + 1];
next 266 standard/html.c if (sjis_trail(next)) {
next 267 standard/html.c this_char = (c << 8) | next;
next 268 standard/html.c } else if (sjis_lead(next)) {
next 288 standard/html.c unsigned next;
next 291 standard/html.c next = str[pos + 1];
next 293 standard/html.c if (next >= 0xA1 && next <= 0xFE) {
next 295 standard/html.c this_char = (c << 8) | next;
next 297 standard/html.c MB_FAILURE(pos, (next != 0xA0 && next != 0xFF) ? 1 : 2);
next 301 standard/html.c unsigned next;
next 305 standard/html.c next = str[pos + 1];
next 306 standard/html.c if (next >= 0xA1 && next <= 0xDF) {
next 308 standard/html.c this_char = (c << 8) | next;
next 310 standard/html.c MB_FAILURE(pos, (next != 0xA0 && next != 0xFF) ? 1 : 2);
next 944 standard/html.c const char *next = NULL; /* when set, next > p, otherwise possible inf loop */
next 961 standard/html.c next = &p[2];
next 962 standard/html.c if (process_numeric_entity(&next, &code) == FAILURE)
next 982 standard/html.c next = &p[1];
next 983 standard/html.c start = next;
next 985 standard/html.c if (process_named_entity_html(&next, &start, &ent_len) == FAILURE)
next 1000 standard/html.c assert(*next == ';');
next 1021 standard/html.c p = next + 1;
next 1025 standard/html.c for (; p < next; p++) {
next 1394 standard/html.c *next = start;
next 1397 standard/html.c if (process_named_entity_html(&next, &start, &ent_len) == FAILURE)
next 190 standard/rand.c BG(next) = state;
next 221 standard/rand.c s1 = *BG(next)++;
next 515 standard/streamsfuncs.c for (filter = stream->filterhead; filter != NULL; filter = filter->next) {
next 32 standard/var_unserializer.c void *next;
next 45 standard/var_unserializer.c var_hash->next = 0;
next 50 standard/var_unserializer.c ((var_entries *) (*var_hashx)->last)->next = var_hash;
next 69 standard/var_unserializer.c var_hash->next = 0;
next 74 standard/var_unserializer.c ((var_entries *) (*var_hashx)->last_dtor)->next = var_hash;
next 99 standard/var_unserializer.c var_hash = var_hash->next;
next 111 standard/var_unserializer.c var_hash = var_hash->next;
next 126 standard/var_unserializer.c void *next;
next 134 standard/var_unserializer.c next = var_hash->next;
next 136 standard/var_unserializer.c var_hash = next;
next 145 standard/var_unserializer.c next = var_hash->next;
next 147 standard/var_unserializer.c var_hash = next;
next 43 sysvshm/php_sysvshm.h long next;
next 378 sysvshm/sysvshm.c shm_var->next = total_size;
next 403 sysvshm/sysvshm.c pos += shm_var->next;
next 405 sysvshm/sysvshm.c if (shm_var->next <= 0 || pos < ptr->start) {
next 421 sysvshm/sysvshm.c next_chunk_ptr = (sysvshm_chunk *) ((char *) ptr + shm_varpos + chunk_ptr->next);
next 423 sysvshm/sysvshm.c memcpy_len = ptr->end-shm_varpos - chunk_ptr->next;
next 424 sysvshm/sysvshm.c ptr->free += chunk_ptr->next;
next 425 sysvshm/sysvshm.c ptr->end -= chunk_ptr->next;
next 26 xml/compat.c void *next;
next 204 xml/compat.c _namespace_handler(parser, nsptr->next);
next 1294 xmlreader/php_xmlreader.c PHP_ME(xmlreader, next, arginfo_xmlreader_next, ZEND_ACC_PUBLIC)
next 302 xmlrpc/libxmlrpc/queue.c q->head->next = NULL;
next 306 xmlrpc/libxmlrpc/queue.c q->head->next = (datanode*)n;
next 357 xmlrpc/libxmlrpc/queue.c p->next = q->tail;
next 360 xmlrpc/libxmlrpc/queue.c q->tail->next = NULL;
next 399 xmlrpc/libxmlrpc/queue.c n = q->head->next;
next 450 xmlrpc/libxmlrpc/queue.c q->tail->next = NULL;
next 482 xmlrpc/libxmlrpc/queue.c if(!q->cursor || q->cursor->next == NULL)
next 485 xmlrpc/libxmlrpc/queue.c q->cursor = (node *)q->cursor->next;
next 538 xmlrpc/libxmlrpc/queue.c n = ((node*)iter)->next;
next 545 xmlrpc/libxmlrpc/queue.c p->next = n;
next 822 xmlrpc/libxmlrpc/queue.c dn = dn->next;
next 965 xmlrpc/libxmlrpc/queue.c return qi ? (q_iter)((node*)qi)->next : NULL;
next 31 xmlrpc/libxmlrpc/queue.h datanode *prev, *next ;
next 85 xmlrpc/libxmlrpc/queue.h #define Q_Iter_Next_F(qi) (qi ? (q_iter)((node*)qi)->next : NULL)
next 456 xsl/xsltprocessor.c nodep = nodep->next;