prev 750 Zend/zend_alloc.c zend_mm_free_block *prev = *p;
prev 752 Zend/zend_alloc.c if (ZEND_MM_FREE_BLOCK_SIZE(prev) != size) {
prev 753 Zend/zend_alloc.c p = &prev->child[(m >> (ZEND_MM_NUM_BUCKETS-1)) & 1];
prev 761 Zend/zend_alloc.c zend_mm_free_block *next = prev->next_free_block;
prev 763 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block;
prev 765 Zend/zend_alloc.c mm_block->prev_free_block = prev;
prev 772 Zend/zend_alloc.c zend_mm_free_block *prev, *next;
prev 776 Zend/zend_alloc.c prev = ZEND_MM_SMALL_FREE_BUCKET(heap, index);
prev 777 Zend/zend_alloc.c if (prev->prev_free_block == prev) {
prev 780 Zend/zend_alloc.c next = prev->next_free_block;
prev 782 Zend/zend_alloc.c mm_block->prev_free_block = prev;
prev 784 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block;
prev 790 Zend/zend_alloc.c zend_mm_free_block *prev = mm_block->prev_free_block;
prev 795 Zend/zend_alloc.c if (EXPECTED(prev == mm_block)) {
prev 805 Zend/zend_alloc.c prev = *rp;
prev 806 Zend/zend_alloc.c if (EXPECTED(prev == NULL)) {
prev 815 Zend/zend_alloc.c while (*(cp = &(prev->child[prev->child[1] != NULL])) != NULL) {
prev 816 Zend/zend_alloc.c prev = *cp;
prev 823 Zend/zend_alloc.c *mm_block->parent = prev;
prev 824 Zend/zend_alloc.c prev->parent = mm_block->parent;
prev 825 Zend/zend_alloc.c if ((prev->child[0] = mm_block->child[0])) {
prev 826 Zend/zend_alloc.c ZEND_MM_CHECK_TREE(prev->child[0]);
prev 827 Zend/zend_alloc.c prev->child[0]->parent = &prev->child[0];
prev 829 Zend/zend_alloc.c if ((prev->child[1] = mm_block->child[1])) {
prev 830 Zend/zend_alloc.c ZEND_MM_CHECK_TREE(prev->child[1]);
prev 831 Zend/zend_alloc.c prev->child[1]->parent = &prev->child[1];
prev 837 Zend/zend_alloc.c if (UNEXPECTED(prev->next_free_block != mm_block) || UNEXPECTED(next->prev_free_block != mm_block)) {
prev 842 Zend/zend_alloc.c prev->next_free_block = next;
prev 843 Zend/zend_alloc.c next->prev_free_block = prev;
prev 846 Zend/zend_alloc.c if (EXPECTED(prev == next)) {
prev 863 Zend/zend_alloc.c zend_mm_free_block *prev, *next;
prev 871 Zend/zend_alloc.c prev = p->prev_free_block;
prev 873 Zend/zend_alloc.c prev->next_free_block = next;
prev 874 Zend/zend_alloc.c next->prev_free_block = prev;
prev 885 Zend/zend_alloc.c prev = heap->rest_buckets[0];
prev 886 Zend/zend_alloc.c next = prev->next_free_block;
prev 887 Zend/zend_alloc.c mm_block->prev_free_block = prev;
prev 889 Zend/zend_alloc.c prev->next_free_block = next->prev_free_block = mm_block;
prev 1605 Zend/zend_alloc.c zend_mm_segment *prev;
prev 1681 Zend/zend_alloc.c prev = segment;
prev 1683 Zend/zend_alloc.c ZEND_MM_STORAGE_FREE(prev);
prev 1695 Zend/zend_alloc.c prev = segment;
prev 1697 Zend/zend_alloc.c ZEND_MM_STORAGE_FREE(prev);
prev 1703 Zend/zend_alloc.c prev = segment;
prev 1705 Zend/zend_alloc.c ZEND_MM_STORAGE_FREE(prev);
prev 2209 Zend/zend_builtin_functions.c zend_execute_data *prev = skip->prev_execute_data;
prev 2211 Zend/zend_builtin_functions.c while (prev) {
prev 2212 Zend/zend_builtin_functions.c if (prev->function_state.function &&
prev 2213 Zend/zend_builtin_functions.c prev->function_state.function->common.type != ZEND_USER_FUNCTION) {
prev 2214 Zend/zend_builtin_functions.c prev = NULL;
prev 2217 Zend/zend_builtin_functions.c if (prev->op_array) {
prev 2218 Zend/zend_builtin_functions.c zend_printf(") called at [%s:%d]\n", prev->op_array->filename, prev->opline->lineno);
prev 2221 Zend/zend_builtin_functions.c prev = prev->prev_execute_data;
prev 2223 Zend/zend_builtin_functions.c if (!prev) {
prev 2288 Zend/zend_builtin_functions.c zend_execute_data *prev = skip->prev_execute_data;
prev 2290 Zend/zend_builtin_functions.c while (prev) {
prev 2291 Zend/zend_builtin_functions.c if (prev->function_state.function &&
prev 2292 Zend/zend_builtin_functions.c prev->function_state.function->common.type != ZEND_USER_FUNCTION &&
prev 2293 Zend/zend_builtin_functions.c !(prev->function_state.function->common.type == ZEND_INTERNAL_FUNCTION &&
prev 2294 Zend/zend_builtin_functions.c (prev->function_state.function->common.fn_flags & ZEND_ACC_CALL_VIA_HANDLER))) {
prev 2297 Zend/zend_builtin_functions.c if (prev->op_array) {
prev 2298 Zend/zend_builtin_functions.c add_assoc_string_ex(stack_frame, "file", sizeof("file"), (char*)prev->op_array->filename, 1);
prev 2299 Zend/zend_builtin_functions.c add_assoc_long_ex(stack_frame, "line", sizeof("line"), prev->opline->lineno);
prev 2302 Zend/zend_builtin_functions.c prev = prev->prev_execute_data;
prev 1652 Zend/zend_execute.c EG(argument_stack)->prev = NULL;
prev 1750 Zend/zend_execute.c EG(argument_stack)->prev = p->prev;
prev 1751 Zend/zend_execute.c p = p->prev;
prev 172 Zend/zend_execute.h zend_vm_stack prev;
prev 191 Zend/zend_execute.h page->prev = NULL;
prev 205 Zend/zend_execute.h zend_vm_stack p = stack->prev;
prev 214 Zend/zend_execute.h p->prev = EG(argument_stack);
prev 275 Zend/zend_execute.h EG(argument_stack) = p->prev;
prev 287 Zend/zend_execute.h EG(argument_stack) = p->prev;
prev 49 Zend/zend_gc.c gc_globals->roots.prev = &gc_globals->roots;
prev 107 Zend/zend_gc.c GC_G(roots).prev = &GC_G(roots);
prev 154 Zend/zend_gc.c GC_G(unused) = newRoot->prev;
prev 169 Zend/zend_gc.c GC_G(unused) = newRoot->prev;
prev 174 Zend/zend_gc.c newRoot->prev = &GC_G(roots);
prev 175 Zend/zend_gc.c GC_G(roots).next->prev = newRoot;
prev 207 Zend/zend_gc.c GC_G(unused) = newRoot->prev;
prev 223 Zend/zend_gc.c GC_G(unused) = newRoot->prev;
prev 228 Zend/zend_gc.c newRoot->prev = &GC_G(roots);
prev 229 Zend/zend_gc.c GC_G(roots).next->prev = newRoot;
prev 82 Zend/zend_gc.h struct _gc_root_buffer *prev; /* double-linked list */
prev 189 Zend/zend_gc.h root->next->prev = root->prev;
prev 190 Zend/zend_gc.h root->prev->next = root->next;
prev 191 Zend/zend_gc.h root->prev = GC_G(unused);
prev 41 Zend/zend_llist.c tmp->prev = l->tail;
prev 60 Zend/zend_llist.c tmp->prev = NULL;
prev 62 Zend/zend_llist.c l->head->prev = tmp;
prev 74 Zend/zend_llist.c if ((current)->prev) {\
prev 75 Zend/zend_llist.c (current)->prev->next = (current)->next;\
prev 80 Zend/zend_llist.c (current)->next->prev = (current)->prev;\
prev 82 Zend/zend_llist.c (l)->tail = (current)->prev;\
prev 135 Zend/zend_llist.c if (old_tail->prev) {
prev 136 Zend/zend_llist.c old_tail->prev->next = NULL;
prev 143 Zend/zend_llist.c l->tail = old_tail->prev;
prev 217 Zend/zend_llist.c elements[0]->prev = NULL;
prev 220 Zend/zend_llist.c elements[i]->prev = elements[i-1];
prev 303 Zend/zend_llist.c *current = (*current)->prev;
prev 27 Zend/zend_llist.h struct _zend_llist_element *prev;
prev 78 ext/dom/dom_iterators.c ret->prev = NULL;
prev 559 ext/dom/node.c prevsib = nodep->prev;
prev 965 ext/dom/node.c newchild->prev = prevsib;
prev 970 ext/dom/node.c nextsib->prev = fragment->last;
prev 1063 ext/dom/node.c (refp->prev != NULL && refp->prev->type == XML_TEXT_NODE))) {
prev 1070 ext/dom/node.c new_child->prev = refp->prev;
prev 1071 ext/dom/node.c refp->prev = new_child;
prev 1072 ext/dom/node.c if (new_child->prev != NULL) {
prev 1073 ext/dom/node.c new_child->prev->next = new_child;
prev 1098 ext/dom/node.c new_child = _php_dom_insert_fragment(parentp, refp->prev, refp, child, intern, childobj TSRMLS_CC);
prev 1120 ext/dom/node.c new_child->prev = child;
prev 1220 ext/dom/node.c prevsib = oldchild->prev;
prev 1365 ext/dom/node.c new_child->prev = child;
prev 118 ext/dom/text.c while (node->prev && ((node->prev->type == XML_TEXT_NODE) || (node->prev->type == XML_CDATA_SECTION_NODE))) {
prev 119 ext/dom/text.c node = node->prev;
prev 52 ext/enchant/enchant.c enchant_dict *prev;
prev 565 ext/enchant/enchant.c dict->prev = pos ? pbroker->dict[pos-1] : NULL;
prev 621 ext/enchant/enchant.c dict->prev = pos?pbroker->dict[pos-1]:NULL;
prev 381 ext/fileinfo/libmagic/apprentice.c mlp->prev->next = ml;
prev 382 ext/fileinfo/libmagic/apprentice.c ml->prev = mlp->prev;
prev 384 ext/fileinfo/libmagic/apprentice.c mlp->prev = ml;
prev 523 ext/fileinfo/libmagic/apprentice.c mlist->next = mlist->prev = mlist;
prev 354 ext/fileinfo/libmagic/file.h struct mlist *next, *prev;
prev 78 ext/gd/gdcache.c gdCache_element_t *elem, *prev;
prev 83 ext/gd/gdcache.c prev = elem;
prev 85 ext/gd/gdcache.c pefree((char *)prev, 1);
prev 94 ext/gd/gdcache.c gdCache_element_t *elem, *prev = NULL, *prevprev = NULL;
prev 107 ext/gd/gdcache.c prev->next = elem->next;
prev 113 ext/gd/gdcache.c prevprev = prev;
prev 114 ext/gd/gdcache.c prev = elem;
prev 129 ext/gd/gdcache.c elem = prev;
prev 77 ext/gd/libgd/gdcache.c gdCache_element_t *elem, *prev;
prev 83 ext/gd/libgd/gdcache.c prev = elem;
prev 85 ext/gd/libgd/gdcache.c gdPFree ((char *) prev);
prev 94 ext/gd/libgd/gdcache.c gdCache_element_t *elem, *prev = NULL, *prevprev = NULL;
prev 105 ext/gd/libgd/gdcache.c prev->next = elem->next;
prev 111 ext/gd/libgd/gdcache.c prevprev = prev;
prev 112 ext/gd/libgd/gdcache.c prev = elem;
prev 130 ext/gd/libgd/gdcache.c elem = prev;
prev 347 ext/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 462 ext/mbstring/oniguruma/regcomp.c UChar *p, *prev;
prev 471 ext/mbstring/oniguruma/regcomp.c p = prev = sn->s;
prev 483 ext/mbstring/oniguruma/regcomp.c r = add_compile_string_length(prev, prev_len, slen, reg, ambig);
prev 485 ext/mbstring/oniguruma/regcomp.c prev = p;
prev 491 ext/mbstring/oniguruma/regcomp.c r = add_compile_string_length(prev, prev_len, slen, reg, ambig);
prev 510 ext/mbstring/oniguruma/regcomp.c UChar *p, *prev, *end;
prev 520 ext/mbstring/oniguruma/regcomp.c p = prev = sn->s;
prev 531 ext/mbstring/oniguruma/regcomp.c r = add_compile_string(prev, prev_len, slen, reg, ambig);
prev 534 ext/mbstring/oniguruma/regcomp.c prev = p;
prev 541 ext/mbstring/oniguruma/regcomp.c return add_compile_string(prev, prev_len, slen, reg, ambig);
prev 1162 ext/mbstring/oniguruma/regcomp.c OnigOptionType prev = reg->options;
prev 1166 ext/mbstring/oniguruma/regcomp.c reg->options = prev;
prev 1170 ext/mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1182 ext/mbstring/oniguruma/regcomp.c OnigOptionType prev = reg->options;
prev 1184 ext/mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1187 ext/mbstring/oniguruma/regcomp.c r = add_opcode_option(reg, OP_SET_OPTION, prev);
prev 1195 ext/mbstring/oniguruma/regcomp.c reg->options = prev;
prev 1197 ext/mbstring/oniguruma/regcomp.c if (IS_DYNAMIC_OPTION(prev ^ node->option)) {
prev 1199 ext/mbstring/oniguruma/regcomp.c r = add_opcode_option(reg, OP_SET_OPTION, prev);
prev 3520 ext/mbstring/oniguruma/regcomp.c Node* prev = NULL_NODE;
prev 3523 ext/mbstring/oniguruma/regcomp.c prev = NCAR(node);
prev 3664 ext/mbstring/oniguruma/regcomp.c Node* prev = NULL_NODE;
prev 3667 ext/mbstring/oniguruma/regcomp.c if (IS_NOT_NULL(prev) && r == 0) {
prev 3668 ext/mbstring/oniguruma/regcomp.c r = next_setup(prev, NCAR(node), reg);
prev 3670 ext/mbstring/oniguruma/regcomp.c prev = NCAR(node);
prev 5239 ext/mbstring/oniguruma/regcomp.c regex_t *head, *prev;
prev 5241 ext/mbstring/oniguruma/regcomp.c prev = reg;
prev 5242 ext/mbstring/oniguruma/regcomp.c head = prev->chain;
prev 5246 ext/mbstring/oniguruma/regcomp.c prev = head;
prev 5249 ext/mbstring/oniguruma/regcomp.c prev->chain = (regex_t* )NULL;
prev 70 ext/mbstring/oniguruma/regenc.c if (prev) *prev = (const UChar* )p;
prev 74 ext/mbstring/oniguruma/regenc.c if (prev) *prev = (const UChar* )NULL; /* Sorry */
prev 3053 ext/mbstring/oniguruma/regexec.c UChar *prev;
prev 3100 ext/mbstring/oniguruma/regexec.c prev = (UChar* )onigenc_get_prev_char_head(reg->enc, str, at);
prev 3105 ext/mbstring/oniguruma/regexec.c at, prev, &msa);
prev 3167 ext/mbstring/oniguruma/regexec.c UChar* prev;
prev 3172 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc,
prev 3174 ext/mbstring/oniguruma/regexec.c if (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end))
prev 3182 ext/mbstring/oniguruma/regexec.c prev = (UChar* )onigenc_get_prev_char_head(reg->enc,
prev 3184 ext/mbstring/oniguruma/regexec.c if (prev && ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end))
prev 3290 ext/mbstring/oniguruma/regexec.c UChar* prev;
prev 3295 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, p);
prev 3296 ext/mbstring/oniguruma/regexec.c if (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end)) {
prev 3297 ext/mbstring/oniguruma/regexec.c p = prev;
prev 3306 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, adjrange, p);
prev 3307 ext/mbstring/oniguruma/regexec.c if (IS_NULL(prev)) goto fail;
prev 3308 ext/mbstring/oniguruma/regexec.c if (ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end)) {
prev 3309 ext/mbstring/oniguruma/regexec.c p = prev;
prev 3354 ext/mbstring/oniguruma/regexec.c UChar *s, *prev;
prev 3407 ext/mbstring/oniguruma/regexec.c r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
prev 3418 ext/mbstring/oniguruma/regexec.c r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
prev 3429 ext/mbstring/oniguruma/regexec.c r = match_at(reg, str, end, s, prev, &msa);\
prev 3440 ext/mbstring/oniguruma/regexec.c r = match_at(reg, str, end, s, prev, &msa);\
prev 3548 ext/mbstring/oniguruma/regexec.c prev = (UChar* )NULL;
prev 3577 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3579 ext/mbstring/oniguruma/regexec.c prev = (UChar* )NULL;
prev 3603 ext/mbstring/oniguruma/regexec.c prev = low_prev;
prev 3607 ext/mbstring/oniguruma/regexec.c prev = s;
prev 3620 ext/mbstring/oniguruma/regexec.c prev = s;
prev 3623 ext/mbstring/oniguruma/regexec.c while (!ONIGENC_IS_MBC_NEWLINE(reg->enc, prev, end) && s < range) {
prev 3624 ext/mbstring/oniguruma/regexec.c prev = s;
prev 3635 ext/mbstring/oniguruma/regexec.c prev = s;
prev 3670 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3672 ext/mbstring/oniguruma/regexec.c s = prev;
prev 3698 ext/mbstring/oniguruma/regexec.c prev = onigenc_get_prev_char_head(reg->enc, str, s);
prev 3700 ext/mbstring/oniguruma/regexec.c s = prev;
prev 2361 ext/mbstring/oniguruma/regparse.c UChar* prev = p;
prev 2367 ext/mbstring/oniguruma/regparse.c if (p == prev) {
prev 2914 ext/mbstring/oniguruma/regparse.c UChar* prev;
prev 3011 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3022 ext/mbstring/oniguruma/regparse.c if (p > prev + enclen(enc, prev) && !PEND && (PPEEK_IS('}'))) {
prev 3030 ext/mbstring/oniguruma/regparse.c p = prev;
prev 3036 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3048 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3052 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3065 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3068 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3132 ext/mbstring/oniguruma/regparse.c UChar* prev;
prev 3352 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3362 ext/mbstring/oniguruma/regparse.c if ((p > prev + enclen(enc, prev)) && !PEND && PPEEK_IS('}')) {
prev 3369 ext/mbstring/oniguruma/regparse.c p = prev;
prev 3375 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3387 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3391 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3403 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3429 ext/mbstring/oniguruma/regparse.c p = prev; PINC;
prev 3433 ext/mbstring/oniguruma/regparse.c p = prev;
prev 3437 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3440 ext/mbstring/oniguruma/regparse.c if (p == prev) { /* can't read nothing. */
prev 3461 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3492 ext/mbstring/oniguruma/regparse.c num = onig_name_to_group_numbers(env->reg, prev, name_end, &backs);
prev 3495 ext/mbstring/oniguruma/regparse.c ONIGERR_UNDEFINED_NAME_REFERENCE, prev, name_end);
prev 3533 ext/mbstring/oniguruma/regparse.c prev = p;
prev 3538 ext/mbstring/oniguruma/regparse.c tok->u.call.name = prev;
prev 3793 ext/mbstring/oniguruma/regparse.c OnigCodePoint prev = 0;
prev 3796 ext/mbstring/oniguruma/regparse.c for (j = prev;
prev 3803 ext/mbstring/oniguruma/regparse.c prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
prev 3805 ext/mbstring/oniguruma/regparse.c for (j = prev; j < sb_out; j++) {
prev 3810 ext/mbstring/oniguruma/regparse.c prev = sb_out;
prev 3813 ext/mbstring/oniguruma/regparse.c if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) {
prev 3814 ext/mbstring/oniguruma/regparse.c r = add_code_range_to_buf(&(cc->mbuf), prev,
prev 3818 ext/mbstring/oniguruma/regparse.c prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
prev 3820 ext/mbstring/oniguruma/regparse.c if (prev < 0x7fffffff) {
prev 3821 ext/mbstring/oniguruma/regparse.c r = add_code_range_to_buf(&(cc->mbuf), prev, 0x7fffffff);
prev 3994 ext/mbstring/oniguruma/regparse.c UChar *prev, *start, *p = *src;
prev 3997 ext/mbstring/oniguruma/regparse.c start = prev = p;
prev 4000 ext/mbstring/oniguruma/regparse.c prev = p;
prev 4003 ext/mbstring/oniguruma/regparse.c r = ONIGENC_PROPERTY_NAME_TO_CTYPE(enc, start, prev);
prev 4015 ext/mbstring/oniguruma/regparse.c onig_scan_env_set_error_string(env, r, *src, prev);
prev 4691 ext/mbstring/oniguruma/regparse.c OnigOptionType prev = env->option;
prev 4697 ext/mbstring/oniguruma/regparse.c env->option = prev;
prev 5062 ext/mbstring/oniguruma/regparse.c OnigOptionType prev = env->option;
prev 5068 ext/mbstring/oniguruma/regparse.c env->option = prev;
prev 78 ext/mysqli/mysqli_warning.c MYSQLI_WARNING *w, *first = NULL, *prev = NULL;
prev 93 ext/mysqli/mysqli_warning.c if (prev) {
prev 94 ext/mysqli/mysqli_warning.c prev->next = w;
prev 96 ext/mysqli/mysqli_warning.c prev = w;
prev 128 ext/mysqli/mysqli_warning.c MYSQLI_WARNING *w, *first = NULL, *prev = NULL;
prev 170 ext/mysqli/mysqli_warning.c if (prev) {
prev 171 ext/mysqli/mysqli_warning.c prev->next = (void *)w;
prev 173 ext/mysqli/mysqli_warning.c prev = w;
prev 1440 ext/opcache/Optimizer/block_pass.c zend_code_block *prev = blocks;
prev 1442 ext/opcache/Optimizer/block_pass.c while (prev->next != block->op1_to) {
prev 1443 ext/opcache/Optimizer/block_pass.c prev = prev->next;
prev 1445 ext/opcache/Optimizer/block_pass.c prev->next = next->next;
prev 324 ext/opcache/zend_accelerator_util_funcs.c Bucket *p, *q, **prev;
prev 354 ext/opcache/zend_accelerator_util_funcs.c prev = &ht->pListHead;
prev 393 ext/opcache/zend_accelerator_util_funcs.c *prev = q;
prev 394 ext/opcache/zend_accelerator_util_funcs.c prev = &q->pListNext;
prev 451 ext/opcache/zend_accelerator_util_funcs.c Bucket *p, *q, **prev;
prev 481 ext/opcache/zend_accelerator_util_funcs.c prev = &ht->pListHead;
prev 520 ext/opcache/zend_accelerator_util_funcs.c *prev = q;
prev 521 ext/opcache/zend_accelerator_util_funcs.c prev = &q->pListNext;
prev 563 ext/opcache/zend_accelerator_util_funcs.c Bucket *p, *q, **prev;
prev 592 ext/opcache/zend_accelerator_util_funcs.c prev = &ht->pListHead;
prev 631 ext/opcache/zend_accelerator_util_funcs.c *prev = q;
prev 632 ext/opcache/zend_accelerator_util_funcs.c prev = &q->pListNext;
prev 1784 ext/pcre/pcrelib/pcre_compile.c for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
prev 1787 ext/pcre/pcrelib/pcre_compile.c this_recurse.prev = recurses;
prev 2436 ext/pcre/pcrelib/pcre_compile.c for (r = recurses; r != NULL; r = r->prev)
prev 2445 ext/pcre/pcrelib/pcre_compile.c this_recurse.prev = recurses;
prev 629 ext/pcre/pcrelib/pcre_exec.c const pcre_uchar *prev;
prev 874 ext/pcre/pcrelib/pcre_exec.c prev = ecode;
prev 930 ext/pcre/pcrelib/pcre_exec.c ecode = prev;
prev 935 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM66);
prev 1913 ext/pcre/pcrelib/pcre_exec.c prev = ecode - GET(ecode, 1);
prev 1919 ext/pcre/pcrelib/pcre_exec.c if (*prev >= OP_SBRA || *prev == OP_ONCE)
prev 1931 ext/pcre/pcrelib/pcre_exec.c if ((*prev >= OP_ASSERT && *prev <= OP_ASSERTBACK_NOT) ||
prev 1932 ext/pcre/pcrelib/pcre_exec.c *prev == OP_ONCE_NC)
prev 1948 ext/pcre/pcrelib/pcre_exec.c if (*prev == OP_CBRA || *prev == OP_SCBRA ||
prev 1949 ext/pcre/pcrelib/pcre_exec.c *prev == OP_CBRAPOS || *prev == OP_SCBRAPOS)
prev 1951 ext/pcre/pcrelib/pcre_exec.c number = GET2(prev, 1+LINK_SIZE);
prev 2023 ext/pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 2027 ext/pcre/pcrelib/pcre_exec.c md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
prev 2044 ext/pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 2046 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM8);
prev 2048 ext/pcre/pcrelib/pcre_exec.c md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
prev 2051 ext/pcre/pcrelib/pcre_exec.c if (*prev >= OP_SBRA) /* Could match an empty string */
prev 2053 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM50);
prev 2056 ext/pcre/pcrelib/pcre_exec.c ecode = prev;
prev 2061 ext/pcre/pcrelib/pcre_exec.c RMATCH(eptr, prev, offset_top, md, eptrb, RM13);
prev 2062 ext/pcre/pcrelib/pcre_exec.c if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;
prev 2064 ext/pcre/pcrelib/pcre_exec.c if (*prev == OP_ONCE)
prev 2068 ext/pcre/pcrelib/pcre_exec.c md->once_target = prev;
prev 2470 ext/pcre/pcrelib/pcre_internal.h struct recurse_check *prev;
prev 225 ext/pcre/pcrelib/pcre_jit_compile.c struct backtrack_common *prev;
prev 5899 ext/pcre/pcrelib/pcre_jit_compile.c backtrack->prev = parent->top; \
prev 5912 ext/pcre/pcrelib/pcre_jit_compile.c backtrack->prev = parent->top; \
prev 6258 ext/pcre/pcrelib/pcre_jit_compile.c recurse_entry *prev = NULL;
prev 6278 ext/pcre/pcrelib/pcre_jit_compile.c prev = entry;
prev 6292 ext/pcre/pcrelib/pcre_jit_compile.c if (prev != NULL)
prev 6293 ext/pcre/pcrelib/pcre_jit_compile.c prev->next = entry;
prev 6996 ext/pcre/pcrelib/pcre_jit_compile.c parent->top = backtrack->prev;
prev 9617 ext/pcre/pcrelib/pcre_jit_compile.c current = current->prev;
prev 10110 ext/pcre/pcrelib/pcre_jit_compile.c SLJIT_ASSERT(rootbacktrack.prev == NULL);
prev 406 ext/pcre/pcrelib/pcre_study.c for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
prev 416 ext/pcre/pcrelib/pcre_study.c this_recurse.prev = recurses;
prev 444 ext/pcre/pcrelib/pcre_study.c for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
prev 452 ext/pcre/pcrelib/pcre_study.c this_recurse.prev = recurses;
prev 509 ext/pcre/pcrelib/pcre_study.c for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
prev 514 ext/pcre/pcrelib/pcre_study.c this_recurse.prev = recurses;
prev 135 ext/pcre/pcrelib/sljit/sljitExecAllocator.c struct free_block *prev;
prev 156 ext/pcre/pcrelib/sljit/sljitExecAllocator.c free_block->prev = 0;
prev 158 ext/pcre/pcrelib/sljit/sljitExecAllocator.c free_blocks->prev = free_block;
prev 165 ext/pcre/pcrelib/sljit/sljitExecAllocator.c free_block->next->prev = free_block->prev;
prev 167 ext/pcre/pcrelib/sljit/sljitExecAllocator.c if (free_block->prev)
prev 168 ext/pcre/pcrelib/sljit/sljitExecAllocator.c free_block->prev->next = free_block->next;
prev 543 ext/pcre/pcrelib/sljit/sljitLir.c struct sljit_memory_fragment *prev = NULL;
prev 548 ext/pcre/pcrelib/sljit/sljitLir.c buf->next = prev;
prev 549 ext/pcre/pcrelib/sljit/sljitLir.c prev = buf;
prev 553 ext/pcre/pcrelib/sljit/sljitLir.c compiler->buf = prev;
prev 1067 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c sljit_si i, tmp, offs, prev, saved_regs_size;
prev 1094 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1096 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev == -1) {
prev 1097 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = i;
prev 1100 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, STP | RT(prev) | RT2(i) | RN(TMP_SP) | offs));
prev 1102 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1106 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev == -1) {
prev 1107 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = i;
prev 1110 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, STP | RT(prev) | RT2(i) | RN(TMP_SP) | offs));
prev 1112 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1115 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev != -1)
prev 1116 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, STRI | RT(prev) | RN(TMP_SP) | (offs >> 5)));
prev 1158 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c sljit_si i, tmp, offs, prev, saved_regs_size;
prev 1188 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1190 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev == -1) {
prev 1191 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = i;
prev 1194 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, LDP | RT(prev) | RT2(i) | RN(TMP_SP) | offs));
prev 1196 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1200 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev == -1) {
prev 1201 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = i;
prev 1204 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, LDP | RT(prev) | RT2(i) | RN(TMP_SP) | offs));
prev 1206 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c prev = -1;
prev 1209 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c if (prev != -1)
prev 1210 ext/pcre/pcrelib/sljit/sljitNativeARM_64.c FAIL_IF(push_inst(compiler, LDRI | RT(prev) | RN(TMP_SP) | (offs >> 5)));
prev 166 ext/session/mod_mm.c ps_sd *prev;
prev 169 ext/session/mod_mm.c for (prev = data->hash[slot]; prev->next != sd; prev = prev->next);
prev 170 ext/session/mod_mm.c prev->next = sd->next;
prev 185 ext/session/mod_mm.c ps_sd *ret, *prev;
prev 190 ext/session/mod_mm.c for (prev = NULL, ret = data->hash[slot]; ret; prev = ret, ret = ret->next) {
prev 198 ext/session/mod_mm.c if (prev) {
prev 199 ext/session/mod_mm.c prev->next = ret->next;
prev 1305 ext/session/session.c if (current->prev) {
prev 1306 ext/session/session.c current->prev->next = next;
prev 1311 ext/session/session.c next->prev = current->prev;
prev 1313 ext/session/session.c l->tail = current->prev;
prev 1145 ext/simplexml/simplexml.c if (node->children != NULL || node->prev != NULL || node->next != NULL) {
prev 3265 ext/soap/php_encoding.c ret->prev = parent->last;
prev 114 ext/soap/soap.c while (EG(argument_stack)->prev != NULL && \
prev 117 ext/soap/soap.c zend_vm_stack tmp = EG(argument_stack)->prev; \
prev 65 ext/spl/spl_dllist.c struct _spl_ptr_llist_element *prev;
prev 176 ext/spl/spl_dllist.c current = current->prev;
prev 192 ext/spl/spl_dllist.c elem->prev = NULL;
prev 196 ext/spl/spl_dllist.c llist->head->prev = elem;
prev 216 ext/spl/spl_dllist.c elem->prev = llist->tail;
prev 243 ext/spl/spl_dllist.c if (tail->prev) {
prev 244 ext/spl/spl_dllist.c tail->prev->next = NULL;
prev 249 ext/spl/spl_dllist.c llist->tail = tail->prev;
prev 299 ext/spl/spl_dllist.c head->next->prev = NULL;
prev 893 ext/spl/spl_dllist.c if (element->prev) {
prev 894 ext/spl/spl_dllist.c element->prev->next = element->next;
prev 898 ext/spl/spl_dllist.c element->next->prev = element->prev;
prev 907 ext/spl/spl_dllist.c llist->tail = element->prev;
prev 967 ext/spl/spl_dllist.c *traverse_pointer_ptr = old->prev;
prev 971 ext/spl/spl_dllist.c zval *prev = (zval *)spl_ptr_llist_pop(llist TSRMLS_CC);
prev 973 ext/spl/spl_dllist.c if (prev) {
prev 974 ext/spl/spl_dllist.c zval_ptr_dtor((zval **)&prev);
prev 981 ext/spl/spl_dllist.c zval *prev = (zval *)spl_ptr_llist_shift(llist TSRMLS_CC);
prev 983 ext/spl/spl_dllist.c if (prev) {
prev 984 ext/spl/spl_dllist.c zval_ptr_dtor((zval **)&prev);
prev 1275 ext/spl/spl_dllist.c elem->prev = element->prev;
prev 1278 ext/spl/spl_dllist.c if (elem->prev == NULL) {
prev 1281 ext/spl/spl_dllist.c element->prev->next = elem;
prev 1283 ext/spl/spl_dllist.c element->prev = elem;
prev 1389 ext/spl/spl_dllist.c SPL_ME(SplDoublyLinkedList, prev, arginfo_dllist_void, ZEND_ACC_PUBLIC)
prev 8616 ext/sqlite3/libsqlite/sqlite3.c HashElem *next, *prev; /* Next and previous elements in the table */
prev 17927 ext/sqlite3/libsqlite/sqlite3.c u32 prev; /* Index in mem3.aPool[] of previous free chunk */
prev 17987 ext/sqlite3/libsqlite/sqlite3.c u32 prev = mem3.aPool[i].u.list.prev;
prev 17989 ext/sqlite3/libsqlite/sqlite3.c if( prev==0 ){
prev 17992 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[prev].u.list.next = next;
prev 17995 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[next].u.list.prev = prev;
prev 17998 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.prev = 0;
prev 18028 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[i].u.list.prev = 0;
prev 18030 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[*pRoot].u.list.prev = i;
prev 18154 ext/sqlite3/libsqlite/sqlite3.c u32 iNext, prev, size, i, x;
prev 18164 ext/sqlite3/libsqlite/sqlite3.c prev = i - mem3.aPool[i-1].u.hdr.prevSize;
prev 18165 ext/sqlite3/libsqlite/sqlite3.c if( prev==iNext ){
prev 18166 ext/sqlite3/libsqlite/sqlite3.c iNext = mem3.aPool[prev].u.list.next;
prev 18168 ext/sqlite3/libsqlite/sqlite3.c memsys3Unlink(prev);
prev 18169 ext/sqlite3/libsqlite/sqlite3.c size = i + size/4 - prev;
prev 18170 ext/sqlite3/libsqlite/sqlite3.c x = mem3.aPool[prev-1].u.hdr.size4x & 2;
prev 18171 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[prev-1].u.hdr.size4x = size*4 | x;
prev 18172 ext/sqlite3/libsqlite/sqlite3.c mem3.aPool[prev+size-1].u.hdr.prevSize = size;
prev 18173 ext/sqlite3/libsqlite/sqlite3.c memsys3Link(prev);
prev 18174 ext/sqlite3/libsqlite/sqlite3.c i = prev;
prev 18597 ext/sqlite3/libsqlite/sqlite3.c int prev; /* Index of previous free chunk */
prev 18675 ext/sqlite3/libsqlite/sqlite3.c int next, prev;
prev 18681 ext/sqlite3/libsqlite/sqlite3.c prev = MEM5LINK(i)->prev;
prev 18682 ext/sqlite3/libsqlite/sqlite3.c if( prev<0 ){
prev 18685 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(prev)->next = next;
prev 18688 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(next)->prev = prev;
prev 18704 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(i)->prev = -1;
prev 18707 ext/sqlite3/libsqlite/sqlite3.c MEM5LINK(x)->prev = i;
prev 24886 ext/sqlite3/libsqlite/sqlite3.c pNew->prev = pHead->prev;
prev 24887 ext/sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
prev 24889 ext/sqlite3/libsqlite/sqlite3.c pHead->prev = pNew;
prev 24892 ext/sqlite3/libsqlite/sqlite3.c if( pH->first ){ pH->first->prev = pNew; }
prev 24893 ext/sqlite3/libsqlite/sqlite3.c pNew->prev = 0;
prev 24985 ext/sqlite3/libsqlite/sqlite3.c if( elem->prev ){
prev 24986 ext/sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
prev 24991 ext/sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
prev 61666 ext/sqlite3/libsqlite/sqlite3.c u32 x, prev = 0;
prev 61866 ext/sqlite3/libsqlite/sqlite3.c btreeHeapPull(heap,&prev);
prev 61868 ext/sqlite3/libsqlite/sqlite3.c if( (prev&0xffff)+1>(x>>16) ){
prev 61873 ext/sqlite3/libsqlite/sqlite3.c cnt += (x>>16) - (prev&0xffff) - 1;
prev 61874 ext/sqlite3/libsqlite/sqlite3.c prev = x;
prev 61877 ext/sqlite3/libsqlite/sqlite3.c cnt += usableSize - (prev&0xffff) - 1;
prev 132653 ext/sqlite3/libsqlite/sqlite3.c Fts3HashElem *next, *prev; /* Next and previous elements in the table */
prev 140899 ext/sqlite3/libsqlite/sqlite3.c pNew->prev = pHead->prev;
prev 140900 ext/sqlite3/libsqlite/sqlite3.c if( pHead->prev ){ pHead->prev->next = pNew; }
prev 140902 ext/sqlite3/libsqlite/sqlite3.c pHead->prev = pNew;
prev 140905 ext/sqlite3/libsqlite/sqlite3.c if( pH->first ){ pH->first->prev = pNew; }
prev 140906 ext/sqlite3/libsqlite/sqlite3.c pNew->prev = 0;
prev 140978 ext/sqlite3/libsqlite/sqlite3.c if( elem->prev ){
prev 140979 ext/sqlite3/libsqlite/sqlite3.c elem->prev->next = elem->next;
prev 140984 ext/sqlite3/libsqlite/sqlite3.c elem->next->prev = elem->prev;
prev 147466 ext/sqlite3/libsqlite/sqlite3.c Blob prev = {0, 0, 0}; /* Previous term written to new node */
prev 147487 ext/sqlite3/libsqlite/sqlite3.c pNew, &prev, reader.term.a, reader.term.n,
prev 147499 ext/sqlite3/libsqlite/sqlite3.c sqlite3_free(prev.a);
prev 3275 ext/standard/basic_functions.c PHP_FE(prev, arginfo_prev)
prev 27 ext/xml/compat.c void *prev;
prev 299 ext/xmlrpc/libxmlrpc/queue.c q->head->prev = NULL;
prev 307 ext/xmlrpc/libxmlrpc/queue.c n->prev = q->head;
prev 352 ext/xmlrpc/libxmlrpc/queue.c q->tail->prev = NULL;
prev 356 ext/xmlrpc/libxmlrpc/queue.c q->tail->prev = (datanode *)p;
prev 408 ext/xmlrpc/libxmlrpc/queue.c q->head->prev = NULL;
prev 442 ext/xmlrpc/libxmlrpc/queue.c p = q->tail->prev;
prev 512 ext/xmlrpc/libxmlrpc/queue.c if(q->cursor->prev == NULL)
prev 515 ext/xmlrpc/libxmlrpc/queue.c q->cursor = (node *)q->cursor->prev;
prev 539 ext/xmlrpc/libxmlrpc/queue.c p = ((node*)iter)->prev;
prev 557 ext/xmlrpc/libxmlrpc/queue.c n->prev = p;
prev 969 ext/xmlrpc/libxmlrpc/queue.c return qi ? (q_iter)((node*)qi)->prev : NULL;
prev 31 ext/xmlrpc/libxmlrpc/queue.h datanode *prev, *next ;
prev 86 ext/xmlrpc/libxmlrpc/queue.h #define Q_Iter_Prev_F(qi) (qi ? (q_iter)((node*)qi)->prev : NULL)
prev 47 ext/zip/lib/zip_extra_field.c struct zip_extra_field *head, *prev, *def;
prev 49 ext/zip/lib/zip_extra_field.c head = prev = NULL;
prev 60 ext/zip/lib/zip_extra_field.c if (prev)
prev 61 ext/zip/lib/zip_extra_field.c prev->next = def;
prev 62 ext/zip/lib/zip_extra_field.c prev = def;
prev 74 ext/zip/lib/zip_extra_field.c struct zip_extra_field *head, *prev;
prev 79 ext/zip/lib/zip_extra_field.c prev = NULL;
prev 80 ext/zip/lib/zip_extra_field.c for (; ef; ef=(prev ? prev->next : head)) {
prev 85 ext/zip/lib/zip_extra_field.c if (prev)
prev 86 ext/zip/lib/zip_extra_field.c prev->next = ef->next;
prev 101 ext/zip/lib/zip_extra_field.c prev = ef;
prev 264 ext/zip/lib/zip_extra_field.c struct zip_extra_field *prev, *next;
prev 267 ext/zip/lib/zip_extra_field.c prev = NULL;
prev 276 ext/zip/lib/zip_extra_field.c if (prev)
prev 277 ext/zip/lib/zip_extra_field.c prev->next = next;
prev 281 ext/zip/lib/zip_extra_field.c prev = ef;
prev 615 main/SAPI.c if (current->prev) {
prev 616 main/SAPI.c current->prev->next = next;
prev 621 main/SAPI.c next->prev = current->prev;
prev 623 main/SAPI.c l->tail = current->prev;
prev 84 main/streams/filter.c bucket->next = bucket->prev = NULL;
prev 195 main/streams/filter.c bucket->prev = NULL;
prev 198 main/streams/filter.c brigade->head->prev = bucket;
prev 212 main/streams/filter.c bucket->prev = brigade->tail;
prev 226 main/streams/filter.c if (bucket->prev) {
prev 227 main/streams/filter.c bucket->prev->next = bucket->next;
prev 232 main/streams/filter.c bucket->next->prev = bucket->prev;
prev 234 main/streams/filter.c bucket->brigade->tail = bucket->prev;
prev 237 main/streams/filter.c bucket->next = bucket->prev = NULL;
prev 319 main/streams/filter.c filter->prev = NULL;
prev 322 main/streams/filter.c chain->head->prev = filter;
prev 341 main/streams/filter.c filter->prev = chain->tail;
prev 425 main/streams/filter.c filter->prev->next = NULL;
prev 426 main/streams/filter.c chain->tail = filter->prev;
prev 515 main/streams/filter.c if (filter->prev) {
prev 516 main/streams/filter.c filter->prev->next = filter->next;
prev 521 main/streams/filter.c filter->next->prev = filter->prev;
prev 523 main/streams/filter.c filter->chain->tail = filter->prev;
prev 45 main/streams/php_stream_filter_api.h php_stream_bucket *next, *prev;
prev 112 main/streams/php_stream_filter_api.h php_stream_filter *prev;
prev 448 sapi/apache/php_apache.c if(r->prev) r = r->prev;
prev 238 sapi/apache2filter/php_functions.c while(ctx->f->r->prev) {
prev 239 sapi/apache2filter/php_functions.c ctx->f->r = ctx->f->r->prev;
prev 267 sapi/apache2filter/php_functions.c while(ctx->f->r->prev) {
prev 268 sapi/apache2filter/php_functions.c ctx->f->r = ctx->f->r->prev;
prev 271 sapi/apache2handler/php_functions.c while(r->prev) {
prev 272 sapi/apache2handler/php_functions.c r = r->prev;
prev 307 sapi/apache2handler/php_functions.c while(r->prev) {
prev 308 sapi/apache2handler/php_functions.c r = r->prev;
prev 1821 sapi/apache_hooks/php_apache.c if (r->prev) {
prev 1822 sapi/apache_hooks/php_apache.c r = r->prev;
prev 98 sapi/fpm/fpm/fpm_children.c child->next->prev = child;
prev 100 sapi/fpm/fpm/fpm_children.c child->prev = 0;
prev 110 sapi/fpm/fpm/fpm_children.c if (child->prev) {
prev 111 sapi/fpm/fpm/fpm_children.c child->prev->next = child->next;
prev 117 sapi/fpm/fpm/fpm_children.c child->next->prev = child->prev;
prev 23 sapi/fpm/fpm/fpm_children.h struct fpm_child_s *prev, *next;
prev 159 sapi/fpm/fpm/fpm_events.c elt->prev = NULL;
prev 164 sapi/fpm/fpm/fpm_events.c (*queue)->prev = elt;
prev 187 sapi/fpm/fpm/fpm_events.c if (q->prev) {
prev 188 sapi/fpm/fpm/fpm_events.c q->prev->next = q->next;
prev 191 sapi/fpm/fpm/fpm_events.c q->next->prev = q->prev;
prev 196 sapi/fpm/fpm/fpm_events.c (*queue)->prev = NULL;
prev 437 sapi/fpm/fpm/fpm_events.c if (q->prev) {
prev 438 sapi/fpm/fpm/fpm_events.c q->prev->next = q->next;
prev 441 sapi/fpm/fpm/fpm_events.c q->next->prev = q->prev;
prev 446 sapi/fpm/fpm/fpm_events.c fpm_event_queue_timer->prev = NULL;
prev 27 sapi/fpm/fpm/fpm_events.h struct fpm_event_queue_s *prev;
prev 631 sapi/thttpd/thttpd.c qreq_t *m, *prev = NULL;
prev 637 sapi/thttpd/thttpd.c if (prev)
prev 638 sapi/thttpd/thttpd.c if (!(prev->next = m->next))
prev 639 sapi/thttpd/thttpd.c last_qr = prev;
prev 648 sapi/thttpd/thttpd.c prev = m;