prev 78 dom/dom_iterators.c ret->prev = NULL;
prev 566 dom/node.c prevsib = nodep->prev;
prev 962 dom/node.c newchild->prev = prevsib;
prev 967 dom/node.c nextsib->prev = fragment->last;
prev 1060 dom/node.c (refp->prev != NULL && refp->prev->type == XML_TEXT_NODE))) {
prev 1067 dom/node.c new_child->prev = refp->prev;
prev 1068 dom/node.c refp->prev = new_child;
prev 1069 dom/node.c if (new_child->prev != NULL) {
prev 1070 dom/node.c new_child->prev->next = new_child;
prev 1095 dom/node.c new_child = _php_dom_insert_fragment(parentp, refp->prev, refp, child, intern, childobj TSRMLS_CC);
prev 1117 dom/node.c new_child->prev = child;
prev 1217 dom/node.c prevsib = oldchild->prev;
prev 1362 dom/node.c new_child->prev = child;
prev 118 dom/text.c while (node->prev && ((node->prev->type == XML_TEXT_NODE) || (node->prev->type == XML_CDATA_SECTION_NODE))) {
prev 119 dom/text.c node = node->prev;
prev 52 enchant/enchant.c enchant_dict *prev;
prev 566 enchant/enchant.c dict->prev = pos ? pbroker->dict[pos-1] : NULL;
prev 622 enchant/enchant.c dict->prev = pos?pbroker->dict[pos-1]:NULL;
prev 292 fileinfo/libmagic/apprentice.c mlist->prev->next = ml;
prev 293 fileinfo/libmagic/apprentice.c ml->prev = mlist->prev;
prev 295 fileinfo/libmagic/apprentice.c mlist->prev = ml;
prev 349 fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist;
prev 358 fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist;
prev 338 fileinfo/libmagic/file.h struct mlist *next, *prev;
prev 78 gd/gdcache.c gdCache_element_t *elem, *prev;
prev 83 gd/gdcache.c prev = elem;
prev 85 gd/gdcache.c pefree((char *)prev, 1);
prev 94 gd/gdcache.c gdCache_element_t *elem, *prev = NULL, *prevprev = NULL;
prev 102 gd/gdcache.c prev->next = elem->next;
prev 108 gd/gdcache.c prevprev = prev;
prev 109 gd/gdcache.c prev = elem;
prev 124 gd/gdcache.c elem = prev;
prev 77 gd/libgd/gdcache.c gdCache_element_t *elem, *prev;
prev 83 gd/libgd/gdcache.c prev = elem;
prev 85 gd/libgd/gdcache.c gdPFree ((char *) prev);
prev 94 gd/libgd/gdcache.c gdCache_element_t *elem, *prev = NULL, *prevprev = NULL;
prev 105 gd/libgd/gdcache.c prev->next = elem->next;
prev 111 gd/libgd/gdcache.c prevprev = prev;
prev 112 gd/libgd/gdcache.c prev = elem;
prev 130 gd/libgd/gdcache.c elem = prev;
prev 432 mbstring/oniguruma/oniguruma.h OnigUChar* onigenc_get_right_adjust_char_head_with_prev P_((OnigEncoding enc, const OnigUChar* start, const OnigUChar* s, const OnigUChar** prev));
prev 440 mbstring/oniguruma/regcomp.c UChar *p, *prev;
prev 449 mbstring/oniguruma/regcomp.c p = prev = sn->s;
prev 461 mbstring/oniguruma/regcomp.c r = add_compile_string_length(prev, prev_len, slen, reg, ambig);
prev 463 mbstring/oniguruma/regcomp.c prev = p;
prev 469 mbstring/oniguruma/regcomp.c r = add_compile_string_length(prev, prev_len, slen, reg, ambig);
prev 488 mbstring/oniguruma/regcomp.c UChar *p, *prev, *end;
prev 498 mbstring/oniguruma/regcomp.c p = prev = sn->s;
prev 509 mbstring/oniguruma/regcomp.c r = add_compile_string(prev, prev_len, slen, reg, ambig);
prev 512 mbstring/oniguruma/regcomp.c prev = p;
prev 519 mbstring/oniguruma/regcomp.c return add_compile_string(prev, prev_len, slen, reg, ambig);
prev 1142 mbstring/oniguruma/regcomp.c OnigOptionType prev = reg->options;
prev 1146 mbstring/oniguruma/regcomp.c reg->options = prev;
prev 1150 mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1162 mbstring/oniguruma/regcomp.c OnigOptionType prev = reg->options;
prev 1164 mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1167 mbstring/oniguruma/regcomp.c r = add_opcode_option(reg, OP_SET_OPTION, prev);
prev 1175 mbstring/oniguruma/regcomp.c reg->options = prev;
prev 1177 mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1179 mbstring/oniguruma/regcomp.c r = add_opcode_option(reg, OP_SET_OPTION, prev);
prev 3207 mbstring/oniguruma/regcomp.c while (tmp < prev) {
prev 3214 mbstring/oniguruma/regcomp.c if (wp != prev) NSTRING_SET_AMBIG_REDUCE(snode);
prev 3217 mbstring/oniguruma/regcomp.c snode = onig_node_new_str(prev_start, prev);
prev 3240 mbstring/oniguruma/regcomp.c UChar *prev, *p, *end, *prev_start, *start, *tmp, *wp;
prev 3252 mbstring/oniguruma/regcomp.c prev = p;
prev 3256 mbstring/oniguruma/regcomp.c r = divide_ambig_string_node_sub(reg, prev_ambig, prev_start, prev,
prev 3261 mbstring/oniguruma/regcomp.c prev_start = prev;
prev 3310 mbstring/oniguruma/regcomp.c Node* prev = NULL_NODE;
prev 3313 mbstring/oniguruma/regcomp.c prev = NCONS(node).left;
prev 3454 mbstring/oniguruma/regcomp.c Node* prev = NULL_NODE;
prev 3457 mbstring/oniguruma/regcomp.c if (IS_NOT_NULL(prev) && r == 0) {
prev 3458 mbstring/oniguruma/regcomp.c r = next_setup(prev, NCONS(node).left, reg);
prev 3460 mbstring/oniguruma/regcomp.c prev = NCONS(node).left;
prev 5031 mbstring/oniguruma/regcomp.c regex_t *head, *prev;
prev 5033 mbstring/oniguruma/regcomp.c prev = reg;
prev 5034 mbstring/oniguruma/regcomp.c head = prev->chain;
prev 5038 mbstring/oniguruma/regcomp.c prev = head;
prev 5041 mbstring/oniguruma/regcomp.c prev->chain = (regex_t* )NULL;
prev 70 mbstring/oniguruma/regenc.c if (prev) *prev = (const UChar* )p;
prev 74 mbstring/oniguruma/regenc.c if (prev) *prev = (const UChar* )NULL; /* Sorry */
prev 3241 mbstring/oniguruma/regexec.c UChar *prev;
prev 3288 mbstring/oniguruma/regexec.c prev = (UChar* )onigenc_get_prev_char_head(reg->enc, str, at);
prev 3289 mbstring/oniguruma/regexec.c r = match_at(reg, str, end, at, prev, &msa);
prev 3351 mbstring/oniguruma/regexec.c UChar* prev;
prev 3356 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc,
prev 3358 mbstring/oniguruma/regexec.c if (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end))
prev 3365 mbstring/oniguruma/regexec.c prev = (UChar* )onigenc_get_prev_char_head(reg->enc,
prev 3367 mbstring/oniguruma/regexec.c if (prev && ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end))
prev 3472 mbstring/oniguruma/regexec.c UChar* prev;
prev 3477 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, p);
prev 3478 mbstring/oniguruma/regexec.c if (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end)) {
prev 3479 mbstring/oniguruma/regexec.c p = prev;
prev 3487 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, adjrange, p);
prev 3488 mbstring/oniguruma/regexec.c if (IS_NULL(prev)) goto fail;
prev 3489 mbstring/oniguruma/regexec.c if (ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end)) {
prev 3490 mbstring/oniguruma/regexec.c p = prev;
prev 3534 mbstring/oniguruma/regexec.c UChar *s, *prev;
prev 3582 mbstring/oniguruma/regexec.c r = match_at(reg, str, end, s, prev, &msa);\
prev 3593 mbstring/oniguruma/regexec.c r = match_at(reg, str, end, s, prev, &msa);\
prev 3699 mbstring/oniguruma/regexec.c prev = (UChar* )NULL;
prev 3728 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3730 mbstring/oniguruma/regexec.c prev = (UChar* )NULL;
prev 3754 mbstring/oniguruma/regexec.c prev = low_prev;
prev 3758 mbstring/oniguruma/regexec.c prev = s;
prev 3771 mbstring/oniguruma/regexec.c prev = s;
prev 3774 mbstring/oniguruma/regexec.c while (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end) && s < range) {
prev 3775 mbstring/oniguruma/regexec.c prev = s;
prev 3786 mbstring/oniguruma/regexec.c prev = s;
prev 3816 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3818 mbstring/oniguruma/regexec.c s = prev;
prev 3844 mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3846 mbstring/oniguruma/regexec.c s = prev;
prev 2325 mbstring/oniguruma/regparse.c UChar* prev = p;
prev 2331 mbstring/oniguruma/regparse.c if (p == prev) {
prev 2753 mbstring/oniguruma/regparse.c UChar* prev;
prev 2842 mbstring/oniguruma/regparse.c prev = p;
prev 2853 mbstring/oniguruma/regparse.c if (p > prev + enc_len(enc, prev) && !PEND && (PPEEK_IS('}'))) {
prev 2861 mbstring/oniguruma/regparse.c p = prev;
prev 2867 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 2879 mbstring/oniguruma/regparse.c prev = p;
prev 2883 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 2896 mbstring/oniguruma/regparse.c prev = p;
prev 2899 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 2963 mbstring/oniguruma/regparse.c UChar* prev;
prev 3175 mbstring/oniguruma/regparse.c prev = p;
prev 3185 mbstring/oniguruma/regparse.c if ((p > prev + enc_len(enc, prev)) && !PEND && PPEEK_IS('}')) {
prev 3192 mbstring/oniguruma/regparse.c p = prev;
prev 3198 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3210 mbstring/oniguruma/regparse.c prev = p;
prev 3214 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3226 mbstring/oniguruma/regparse.c prev = p;
prev 3252 mbstring/oniguruma/regparse.c p = prev; PINC;
prev 3256 mbstring/oniguruma/regparse.c p = prev;
prev 3260 mbstring/oniguruma/regparse.c prev = p;
prev 3263 mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3283 mbstring/oniguruma/regparse.c prev = p;
prev 3295 mbstring/oniguruma/regparse.c num = onig_name_to_group_numbers(env->reg, prev, name_end, &backs);
prev 3298 mbstring/oniguruma/regparse.c ONIGERR_UNDEFINED_NAME_REFERENCE, prev, name_end);
prev 3334 mbstring/oniguruma/regparse.c prev = p;
prev 3339 mbstring/oniguruma/regparse.c tok->u.call.name = prev;
prev 3581 mbstring/oniguruma/regparse.c OnigCodePoint prev = 0;
prev 3585 mbstring/oniguruma/regparse.c for (j = prev;
prev 3589 mbstring/oniguruma/regparse.c prev = ONIGENC_CODE_RANGE_TO(sbr, i) + 1;
prev 3591 mbstring/oniguruma/regparse.c if (prev < 0x7f) {
prev 3592 mbstring/oniguruma/regparse.c for (j = prev; j < 0x7f; j++) {
prev 3597 mbstring/oniguruma/regparse.c prev = 0x80;
prev 3601 mbstring/oniguruma/regparse.c if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) {
prev 3602 mbstring/oniguruma/regparse.c r = add_code_range_to_buf(&(cc->mbuf), prev,
prev 3606 mbstring/oniguruma/regparse.c prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
prev 3608 mbstring/oniguruma/regparse.c if (prev < 0x7fffffff) {
prev 3609 mbstring/oniguruma/regparse.c r = add_code_range_to_buf(&(cc->mbuf), prev, 0x7fffffff);
prev 3865 mbstring/oniguruma/regparse.c UChar *prev, *start, *p = *src;
prev 3884 mbstring/oniguruma/regparse.c start = prev = p;
prev 3887 mbstring/oniguruma/regparse.c prev = p;
prev 3890 mbstring/oniguruma/regparse.c ctype = property_name_to_ctype(start, prev, enc);
prev 3901 mbstring/oniguruma/regparse.c *src, prev);
prev 4553 mbstring/oniguruma/regparse.c OnigOptionType prev = env->option;
prev 4559 mbstring/oniguruma/regparse.c env->option = prev;
prev 4811 mbstring/oniguruma/regparse.c OnigOptionType prev = env->option;
prev 4817 mbstring/oniguruma/regparse.c env->option = prev;
prev 78 mysqli/mysqli_warning.c MYSQLI_WARNING *w, *first = NULL, *prev = NULL;
prev 93 mysqli/mysqli_warning.c if (prev) {
prev 94 mysqli/mysqli_warning.c prev->next = w;
prev 96 mysqli/mysqli_warning.c prev = w;
prev 128 mysqli/mysqli_warning.c MYSQLI_WARNING *w, *first = NULL, *prev = NULL;
prev 170 mysqli/mysqli_warning.c if (prev) {
prev 171 mysqli/mysqli_warning.c prev->next = (void *)w;
prev 173 mysqli/mysqli_warning.c prev = w;
prev 595 pcre/pcrelib/pcre_exec.c const pcre_uchar *prev;
prev 846 pcre/pcrelib/pcre_exec.c prev = ecode;
prev 902 pcre/pcrelib/pcre_exec.c ecode = prev;
prev 907 pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM66);
prev 1871 pcre/pcrelib/pcre_exec.c prev = ecode - GET(ecode, 1);
prev 1877 pcre/pcrelib/pcre_exec.c if (*prev >= OP_SBRA || *prev == OP_ONCE)
prev 1889 pcre/pcrelib/pcre_exec.c if ((*prev >= OP_ASSERT && *prev <= OP_ASSERTBACK_NOT) ||
prev 1890 pcre/pcrelib/pcre_exec.c *prev == OP_ONCE_NC)
prev 1906 pcre/pcrelib/pcre_exec.c if (*prev == OP_CBRA || *prev == OP_SCBRA ||
prev 1907 pcre/pcrelib/pcre_exec.c *prev == OP_CBRAPOS || *prev == OP_SCBRAPOS)
prev 1909 pcre/pcrelib/pcre_exec.c number = GET2(prev, 1+LINK_SIZE);
prev 1968 pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 1972 pcre/pcrelib/pcre_exec.c md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
prev 2000 pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 2002 pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM8);
prev 2004 pcre/pcrelib/pcre_exec.c md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
prev 2007 pcre/pcrelib/pcre_exec.c if (*prev >= OP_SBRA) /* Could match an empty string */
prev 2009 pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM50);
prev 2012 pcre/pcrelib/pcre_exec.c ecode = prev;
prev 2017 pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM13);
prev 2018 pcre/pcrelib/pcre_exec.c if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;
prev 2020 pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 2024 pcre/pcrelib/pcre_exec.c md->once_target = prev;
prev 166 session/mod_mm.c ps_sd *prev;
prev 169 session/mod_mm.c for (prev = data->hash[slot]; prev->next != sd; prev = prev->next);
prev 170 session/mod_mm.c prev->next = sd->next;
prev 185 session/mod_mm.c ps_sd *ret, *prev;
prev 190 session/mod_mm.c for (prev = NULL, ret = data->hash[slot]; ret; prev = ret, ret = ret->next) {
prev 198 session/mod_mm.c if (prev) {
prev 199 session/mod_mm.c prev->next = ret->next;
prev 1145 simplexml/simplexml.c if (node->children != NULL || node->prev != NULL || node->next != NULL) {
prev 3269 soap/php_encoding.c ret->prev = parent->last;
prev 114 soap/soap.c while (EG(argument_stack)->prev != NULL && \
prev 117 soap/soap.c zend_vm_stack tmp = EG(argument_stack)->prev; \
prev 67 spl/spl_dllist.c struct _spl_ptr_llist_element *prev;
prev 178 spl/spl_dllist.c current = current->prev;
prev 194 spl/spl_dllist.c elem->prev = NULL;
prev 198 spl/spl_dllist.c llist->head->prev = elem;
prev 218 spl/spl_dllist.c elem->prev = llist->tail;
prev 245 spl/spl_dllist.c if (tail->prev) {
prev 246 spl/spl_dllist.c tail->prev->next = NULL;
prev 251 spl/spl_dllist.c llist->tail = tail->prev;
prev 301 spl/spl_dllist.c head->next->prev = NULL;
prev 895 spl/spl_dllist.c if (element->prev) {
prev 896 spl/spl_dllist.c element->prev->next = element->next;
prev 900 spl/spl_dllist.c element->next->prev = element->prev;
prev 909 spl/spl_dllist.c llist->tail = element->prev;
prev 964 spl/spl_dllist.c *traverse_pointer_ptr = old->prev;
prev 968 spl/spl_dllist.c zval *prev = (zval *)spl_ptr_llist_pop(llist TSRMLS_CC);
prev 970 spl/spl_dllist.c if (prev) {
prev 971 spl/spl_dllist.c zval_ptr_dtor((zval **)&prev);
prev 978 spl/spl_dllist.c zval *prev = (zval *)spl_ptr_llist_shift(llist TSRMLS_CC);
prev 980 spl/spl_dllist.c if (prev) {
prev 981 spl/spl_dllist.c zval_ptr_dtor((zval **)&prev);
prev 1330 spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, prev, arginfo_dllist_void, ZEND_ACC_PUBLIC)
prev 7343 sqlite3/libsqlite/sqlite3.c HashElem *next, *prev; /* Next and previous elements in the table */
prev 15501 sqlite3/libsqlite/sqlite3.c u32 prev; /* Index in mem3.aPool[] of previous free chunk */
prev 15561 sqlite3/libsqlite/sqlite3.c u32 prev = mem3.aPool[i].u.list.prev;
prev 15563 sqlite3/libsqlite/sqlite3.c if( prev==0 ){
prev 15566 sqlite3/libsqlite/sqlite3.c mem3.aPool[prev].u.list.next = next;
prev 15569 sqlite3/libsqlite/sqlite3.c mem3.aPool[next].u.list.prev = prev;
prev 15572 sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.prev = 0;
prev 15602 sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.prev = 0;
prev 15604 sqlite3/libsqlite/sqlite3.c mem3.aPool[*pRoot].u.list.prev = i;
prev 15728 sqlite3/libsqlite/sqlite3.c u32 iNext, prev, size, i, x;
prev 15738 sqlite3/libsqlite/sqlite3.c prev = i - mem3.aPool[i-1].u.hdr.prevSize;
prev 15739 sqlite3/libsqlite/sqlite3.c if( prev==iNext ){
prev 15740 sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[prev].u.list.next;
prev 15742 sqlite3/libsqlite/sqlite3.c memsys3Unlink(prev);
prev 15743 sqlite3/libsqlite/sqlite3.c size = i + size/4 - prev;
prev 15744 sqlite3/libsqlite/sqlite3.c x = mem3.aPool[prev-1].u.hdr.size4x & 2;
prev 15745 sqlite3/libsqlite/sqlite3.c mem3.aPool[prev-1].u.hdr.size4x = size*4 | x;
prev 15746 sqlite3/libsqlite/sqlite3.c mem3.aPool[prev+size-1].u.hdr.prevSize = size;
prev 15747 sqlite3/libsqlite/sqlite3.c memsys3Link(prev);
prev 15748 sqlite3/libsqlite/sqlite3.c i = prev;
prev 16171 sqlite3/libsqlite/sqlite3.c int prev; /* Index of previous free chunk */
prev 16249 sqlite3/libsqlite/sqlite3.c int next, prev;
prev 16255 sqlite3/libsqlite/sqlite3.c prev = MEM5LINK(i)->prev;
prev 16256 sqlite3/libsqlite/sqlite3.c if( prev<0 ){
prev 16259 sqlite3/libsqlite/sqlite3.c MEM5LINK(prev)->next = next;
prev 16262 sqlite3/libsqlite/sqlite3.c MEM5LINK(next)->prev = prev;
prev 16278 sqlite3/libsqlite/sqlite3.c MEM5LINK(i)->prev = -1;
prev 16281 sqlite3/libsqlite/sqlite3.c MEM5LINK(x)->prev = i;
prev 21784 sqlite3/libsqlite/sqlite3.c pNew->prev = pHead->prev;
prev 21785 sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
prev 21787 sqlite3/libsqlite/sqlite3.c pHead->prev = pNew;
prev 21790 sqlite3/libsqlite/sqlite3.c if( pH->first ){ pH->first->prev = pNew; }
prev 21791 sqlite3/libsqlite/sqlite3.c pNew->prev = 0;
prev 21874 sqlite3/libsqlite/sqlite3.c if( elem->prev ){
prev 21875 sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
prev 21880 sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
prev 111736 sqlite3/libsqlite/sqlite3.c Fts3HashElem *next, *prev; /* Next and previous elements in the table */
prev 118047 sqlite3/libsqlite/sqlite3.c pNew->prev = pHead->prev;
prev 118048 sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
prev 118050 sqlite3/libsqlite/sqlite3.c pHead->prev = pNew;
prev 118053 sqlite3/libsqlite/sqlite3.c if( pH->first ){ pH->first->prev = pNew; }
prev 118054 sqlite3/libsqlite/sqlite3.c pNew->prev = 0;
prev 118126 sqlite3/libsqlite/sqlite3.c if( elem->prev ){
prev 118127 sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
prev 118132 sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
prev 3284 standard/basic_functions.c PHP_FE(prev, arginfo_prev)
prev 27 xml/compat.c void *prev;
prev 299 xmlrpc/libxmlrpc/queue.c q->head->prev = NULL;
prev 307 xmlrpc/libxmlrpc/queue.c n->prev = q->head;
prev 352 xmlrpc/libxmlrpc/queue.c q->tail->prev = NULL;
prev 356 xmlrpc/libxmlrpc/queue.c q->tail->prev = (datanode *)p;
prev 408 xmlrpc/libxmlrpc/queue.c q->head->prev = NULL;
prev 442 xmlrpc/libxmlrpc/queue.c p = q->tail->prev;
prev 512 xmlrpc/libxmlrpc/queue.c if(q->cursor->prev == NULL)
prev 515 xmlrpc/libxmlrpc/queue.c q->cursor = (node *)q->cursor->prev;
prev 539 xmlrpc/libxmlrpc/queue.c p = ((node*)iter)->prev;
prev 557 xmlrpc/libxmlrpc/queue.c n->prev = p;
prev 969 xmlrpc/libxmlrpc/queue.c return qi ? (q_iter)((node*)qi)->prev : NULL;
prev 31 xmlrpc/libxmlrpc/queue.h datanode *prev, *next ;
prev 86 xmlrpc/libxmlrpc/queue.h #define Q_Iter_Prev_F(qi) (qi ? (q_iter)((node*)qi)->prev : NULL)