Searched refs:top (Results 1 - 25 of 44) sorted by relevance

12

/PHP_TRUNK/ext/spl/internal/
H A Drecursiveiteratoriterator.inc60 /** Rewind to top iterator as set in constructor
H A Dspldoublylinkedlist.inc90 public function top()
143 /** Rewind to top iterator as set in constructor
H A Dsplobjectstorage.inc28 /** Rewind to top iterator as set in constructor
/PHP_TRUNK/ext/pcre/pcrelib/
H A Dpcre_get.c79 int top, bot; local
83 if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
85 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
93 if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
95 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
103 if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
105 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
114 while (top > bot)
116 int mid = (top + bot) / 2;
121 if (c > 0) bot = mid + 1; else top
162 int top, bot; local
[all...]
/PHP_TRUNK/main/
H A Dmergesort.c248 #define reverse(bot, top) { \
249 s = top; \
/PHP_TRUNK/ext/gd/libgd/
H A Dgd_gif_in.c187 int top, left; local
219 top = LM_to_uint(buf[2], buf[3]);
223 if (left + width > screen_width || top + height > screen_height) {
/PHP_TRUNK/Zend/
H A Dzend_ptr_stack.c31 stack->top = stack->max = 0;
51 stack->top++;
68 stack->top--;
86 int i = stack->top;
98 int i = stack->top;
104 stack->top = 0;
111 return stack->top;
H A Dzend_ptr_stack.h26 int top, max; member in struct:_zend_ptr_stack
47 if (stack->top+count > stack->max) { \
51 } while (stack->top+count > stack->max); \
53 stack->top_element = stack->elements+stack->top; \
64 stack->top += ZEND_PTR_STACK_NUM_ARGS;
78 stack->top += ZEND_PTR_STACK_NUM_ARGS;
90 stack->top -= 3;
97 stack->top -= 2;
104 stack->top++;
110 stack->top
[all...]
H A Dzend_stack.c30 stack->top = 0;
39 if (stack->top >= stack->max) {
43 memcpy(ZEND_STACK_ELEMENT(stack, stack->top), element, stack->size);
44 return stack->top++;
50 if (stack->top > 0) {
51 return ZEND_STACK_ELEMENT(stack, stack->top - 1);
60 --stack->top;
78 return stack->top == 0;
101 return stack->top;
111 for (i=stack->top
[all...]
H A Dzend_stack.h26 int size, top, max; member in struct:_zend_stack
H A Dzend_objects_API.h45 uint32_t top; member in struct:_zend_objects_store
H A Dzend_generators.c50 original_stack->top = EG(vm_stack_top);
51 EG(vm_stack_top) = generator->stack->top;
58 generator->stack->top = EG(vm_stack_top);
59 EG(vm_stack_top) = original_stack->top;
235 current_stack->top = EG(vm_stack_top);
253 generator->stack->top = EG(vm_stack_top);
254 EG(vm_stack_top) = current_stack->top;
665 original_stack->top = EG(vm_stack_top);
670 EG(vm_stack_top) = generator->stack->top;
694 generator->stack->top
[all...]
H A Dzend_execute.h140 zval *top; member in struct:_zend_vm_stack
159 # define ZEND_ASSERT_VM_STACK(stack) ZEND_ASSERT(stack->top > (zval *) stack && stack->end > (zval *) stack && stack->top <= stack->end)
266 EG(vm_stack_top) = prev->top;
H A Dzend_objects_API.c32 objects->top = 1; /* Skip 0 so that handles are true */
46 if (objects->top > 1) {
48 zend_object **end = objects->object_buckets + objects->top;
68 if (objects->object_buckets && objects->top > 1) {
70 zend_object **end = objects->object_buckets + objects->top;
87 if (objects->top <= 1) {
93 obj_ptr = objects->object_buckets + objects->top;
122 if (EG(objects_store).top == EG(objects_store).size) {
126 handle = EG(objects_store).top++;
H A Dzend.c1014 if (CG(stack).top) { \
1016 CG(stack).top = CG(stack).max = 0; \
1019 stack.top = 0; \
1024 if (stack.top) { \
/PHP_TRUNK/build/
H A Dbuild2.mk33 SUPPRESS_WARNINGS ?= 2>&1 | (egrep -v '(AC_TRY_RUN called without default to allow cross compiling|AC_PROG_CXXCPP was called before AC_PROG_CXX|defined in acinclude.m4 but never used|AC_PROG_LEX invoked multiple times|AC_DECL_YYTEXT is expanded from...|the top level)'||true)
/PHP_TRUNK/sapi/phpdbg/
H A Dphpdbg_cmd.h68 phpdbg_param_t *top; member in struct:_phpdbg_param
82 (v)->top = NULL; \
123 * 2) the commands at the top of the stack are resolved sensibly using aliases, abbreviations and case insensitive matching
125 * 4) the handler is called passing the top of the stack as the only parameter
140 PHPDBG_API const phpdbg_command_t *phpdbg_stack_resolve(const phpdbg_command_t *commands, const phpdbg_command_t *parent, phpdbg_param_t **top);
H A Dphpdbg_sigio_win32.c35 top:
43 goto top;
61 goto top;
H A Dphpdbg_parser.c1002 about the unexpected token YYTOKEN for the state stack whose top is
1904 const phpdbg_param_t *top = PHPDBG_G(parser_stack); local
1906 while (top) {
1907 phpdbg_param_debug(top, "--> ");
1908 top = top->next;
H A Dphpdbg_parser.y176 const phpdbg_param_t *top = PHPDBG_G(parser_stack);
178 while (top) {
179 phpdbg_param_debug(top, "--> ");
180 top = top->next;
H A Dphpdbg_cmd.c444 if (stack->top == NULL) {
445 stack->top = next;
446 next->top = NULL;
449 stack->top->next = next;
450 next->top = stack->top;
451 stack->top = next;
460 const phpdbg_param_t *top = (stack != NULL) ? *stack : NULL; local
469 if (!top) {
518 case 'i': verify_arg("raw input", top, STR_PARA
555 phpdbg_stack_resolve(const phpdbg_command_t *commands, const phpdbg_command_t *parent, phpdbg_param_t **top) argument
649 phpdbg_param_t *top = NULL; local
[all...]
/PHP_TRUNK/ext/pcre/pcrelib/sljit/
H A DsljitUtils.c273 stack->top = stack->base;
/PHP_TRUNK/ext/json/
H A Djson_parser.y1 %code top {
/PHP_TRUNK/ext/spl/
H A Dspl_heap.c608 extract the element out of the top of the heap */
665 extract the element out of the top of the priority queue */
703 /* {{{ proto mixed SplPriorityQueue::top()
704 Peek at the top element of the priority queue */
705 SPL_METHOD(SplPriorityQueue, top)
824 /* {{{ proto mixed SplHeap::top()
825 Peek at the top element of the heap */
826 SPL_METHOD(SplHeap, top)
893 /* do nothing, the iterator always points to the top element */
1020 /* do nothing, the iterator always points to the top elemen
[all...]
/PHP_TRUNK/ext/wddx/
H A Dwddx.c96 int top, max; member in struct:__anon3
175 stack->top = 0;
189 if (stack->top >= stack->max) { /* we need to allocate more memory */
193 stack->elements[stack->top] = (void *) emalloc(size);
194 memcpy(stack->elements[stack->top], element, size);
195 return stack->top++;
203 if (stack->top > 0) {
204 *element = stack->elements[stack->top - 1];
217 if (stack->top == 0) {
232 for (i = 0; i < stack->top;
[all...]

Completed in 36 milliseconds

12