Home
last modified time | relevance | path

Searched refs:top (Results 1 – 25 of 112) sorted by path

12345

/PHP-5.5/
H A DINSTALL2024 phpinfo(). Near the top, there will be a listing called
H A DNEWS3207 'interactive' execution of a single top-level op-array.
6243 - Fixed bug #46048 (SimpleXML top-level @attributes not part of iterator).
H A DREADME.EXT_SKEL30 change back up to PHP sources top directory, and do
H A DREADME.MAILINGLIST_RULES67 3. Do not top post. Place your answer underneath anyone you wish to quote
H A DREADME.STREAMS196 FILE* on top of any stream, which is useful for SSL sockets, memory based
H A DREADME.UNIX-BUILD-SYSTEM95 absolute paths or relative ones to the top build-directory.
H A Dacinclude.m4193 dnl the path is interpreted relative to the top build-directory.
/PHP-5.5/Zend/
H A DZEND_CHANGES491 compared with the classtype of each catch block from top to bottom
H A Dzend.c1001 if (CG(stack).top) { \
1003 CG(stack).top = CG(stack).max = 0; \
1006 stack.top = 0; \
1011 if (stack.top) { \
H A Dzend_execute.c1641 EG(argument_stack)->top = zend_vm_stack_frame_base(execute_data); in i_create_execute_data_from_op_array()
H A Dzend_execute.h160 void **top; member
179 page->top = ZEND_VM_STACK_ELEMETS(page); in zend_vm_stack_new_page()
180 page->end = page->top + count; in zend_vm_stack_new_page()
210 return EG(argument_stack)->top; in zend_vm_stack_top()
215 *(EG(argument_stack)->top++) = ptr; in zend_vm_stack_push()
241 EG(argument_stack)->top += extra; in zend_vm_stack_alloc()
249 ret = (void*)EG(argument_stack)->top; in zend_vm_stack_alloc()
250 EG(argument_stack)->top += size; in zend_vm_stack_alloc()
268 EG(argument_stack)->top = (void**)ptr; in zend_vm_stack_free_int()
292 void **p = EG(argument_stack)->top - 1; in zend_vm_stack_clear_multiple()
[all …]
H A Dzend_execute_API.c834 if (i || UNEXPECTED(ZEND_VM_STACK_ELEMETS(EG(argument_stack)) == (EG(argument_stack)->top))) { in zend_call_function()
H A Dzend_generators.c80 void **ptr = generator->stack->top - 1; in zend_generator_cleanup_unfinished_execution()
H A Dzend_objects_API.c33 objects->top = 1; /* Skip 0 so that handles are true */ in zend_objects_store_init()
49 for (i = 1; i < objects->top ; i++) { in zend_objects_store_call_destructors()
78 for (i = 1; i < objects->top ; i++) { in zend_objects_store_mark_destructed()
89 for (i = 1; i < objects->top ; i++) { in zend_objects_store_free_object_storage()
116 if (EG(objects_store).top == EG(objects_store).size) { in zend_objects_store_put()
120 handle = EG(objects_store).top++; in zend_objects_store_put()
H A Dzend_objects_API.h53 zend_uint top; member
H A Dzend_ptr_stack.c31 stack->top = stack->max = 0; in zend_ptr_stack_init_ex()
51 stack->top++; in zend_ptr_stack_n_push()
68 stack->top--; in zend_ptr_stack_n_pop()
86 int i = stack->top; in zend_ptr_stack_apply()
98 int i = stack->top; in zend_ptr_stack_clean()
104 stack->top = 0; in zend_ptr_stack_clean()
111 return stack->top; in zend_ptr_stack_num_elements()
H A Dzend_ptr_stack.h26 int top, max; member
47 if (stack->top+count > stack->max) { \ in END_EXTERN_C()
51 } while (stack->top+count > stack->max); \ in END_EXTERN_C()
53 stack->top_element = stack->elements+stack->top; \ in END_EXTERN_C()
64 stack->top += ZEND_PTR_STACK_NUM_ARGS;
78 stack->top += ZEND_PTR_STACK_NUM_ARGS; in zend_ptr_stack_2_push()
90 stack->top -= 3; in zend_ptr_stack_3_pop()
97 stack->top -= 2; in zend_ptr_stack_2_pop()
104 stack->top++; in zend_ptr_stack_push()
110 stack->top--; in zend_ptr_stack_pop()
[all …]
H A Dzend_stack.c27 stack->top = 0; in zend_stack_init()
44 return stack->top++; in zend_stack_push()
50 if (stack->top > 0) { in zend_stack_top()
62 if (stack->top > 0) { in zend_stack_del_top()
83 if (stack->top == 0) { in zend_stack_is_empty()
96 for (i = 0; i < stack->top; i++) { in zend_stack_destroy()
115 return stack->top; in zend_stack_count()
125 for (i=stack->top-1; i>=0; i--) { in zend_stack_apply()
132 for (i=0; i<stack->top; i++) { in zend_stack_apply()
148 for (i=stack->top-1; i>=0; i--) { in zend_stack_apply_with_argument()
[all …]
H A Dzend_stack.h26 int top, max; member
/PHP-5.5/Zend/tests/
H A Dbug63635.phpt24 $top = new Node();
26 $ci = new Node($top);
/PHP-5.5/ext/date/lib/
H A Dparse_date.c320 if((s->top - s->lim) < BSIZE){
328 s->top = &s->lim[BSIZE];
H A Dparse_date.re318 if((s->top - s->lim) < BSIZE){
326 s->top = &s->lim[BSIZE];
/PHP-5.5/ext/ereg/regex/
H A Dregcomp.c1068 register cset *top = &p->g->sets[p->g->ncsets]; local
1073 if (cs == top-1) /* recover only the easy case */
1094 register cset *top = &p->g->sets[p->g->ncsets]; local
1099 for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
1109 if (cs2 < top) { /* found one */
/PHP-5.5/ext/exif/
H A Dtest.txt270 …if ( !$fast_output) echo "<tr><td rowspan='$rows' valign='top'>$num</td><th colspan='2'>$file</th>…
340 $tab2 .= "<tr><td rowspan='$len' valign='top'>$num</td></tr>\n";
/PHP-5.5/ext/fileinfo/tests/
H A Dmagic1343 # categories" and "left to right, top to bottom," respectively; the D and R
1595 # Yes, the top two "cpio archive" formats *are* supposed to just be "short".
8934 # It has to be duplicated above because the top-level pattern
10518 >768 beshort 0 left to right/top to bottom
10519 >768 beshort 1 right to left/top to bottom
10520 >768 beshort 2 left to right/bottom to top
10521 >768 beshort 3 right to left/bottom to top
10522 >768 beshort 4 top to bottom/left to right
10523 >768 beshort 5 top to bottom/right to left
10524 >768 leshort 6 bottom to top/left to right
[all …]

Completed in 127 milliseconds

12345