Searched defs:top (Results 1 - 18 of 18) sorted by relevance

/PHP_5_4/ext/ereg/regex/
H A Dregcomp.c188 - p_ere - ERE parser top level, concatenation and alternation
396 - p_bre - BRE parser top level, anchoring and concatenation
1060 register cset *top = &p->g->sets[p->g->ncsets]; local
1065 if (cs == top-1) /* recover only the easy case */
1086 register cset *top = &p->g->sets[p->g->ncsets]; local
1091 for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
1101 if (cs2 < top) { /* found one */
/PHP_5_4/ext/gd/libgd/
H A Dgd_gif_in.c185 int top, left; local
217 top = LM_to_uint(buf[2], buf[3]);
221 if (left + width > screen_width || top + height > screen_height) {
/PHP_5_4/ext/pcre/pcrelib/
H A Dpcre_get.c81 int top, bot; local
85 if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
87 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
95 if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
97 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
105 if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
107 if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
116 while (top > bot)
118 int mid = (top + bot) / 2;
123 if (c > 0) bot = mid + 1; else top
164 int top, bot; local
[all...]
H A Dpcre_compile.c1218 int i, bot, top; local
1261 top = PRIV(utt_size);
1263 while (bot < top)
1266 i = (bot + top) >> 1;
1274 if (r > 0) bot = i + 1; else top = i;
1363 top-level call starts at the beginning of the pattern. All other calls must
4046 they are encountered at the top level, so we'll do that too. */
6471 during the pre-compile. However, this can happen only at top level - if
/PHP_5_4/ext/sqlite3/libsqlite/
H A Dsqlite3.c2167 ** evaluated outside of any trigger. This is the "top level"
2168 ** trigger context. If a trigger fires from the top level, a
2179 ** ^Thus, when called from the top level, this function returns the
2181 ** that also occurred at the top level. ^(Within the body of a trigger,
2803 ** top-level SQL code.
12501 ** VDBE. This information used to all be at the top of the single
48672 int top; /* First byte of cell content area */ local
48838 int top; local
48910 int top; /* First byte of the cell content area */ local
[all...]
/PHP_5_4/ext/json/
H A DJSON_parser.h15 int top; member in struct:JSON_parser_struct
/PHP_5_4/ext/mbstring/oniguruma/
H A Dregexec.c1141 , StackType* top, StackType* stk_base
1150 k = top;
1140 backref_match_at_nested_level(regex_t* reg , StackType* top, StackType* stk_base , int ignore_case, int ambig_flag , int nest, int mem_num, UChar* memp, UChar** s, const UChar* send) argument
H A Dregparse.c4387 static int parse_subexp(Node** top, OnigToken* tok, int term,
5164 parse_branch(Node** top, OnigToken* tok, int term, argument
5170 *top = NULL;
5175 *top = node;
5178 *top = node_new_list(node, NULL);
5179 headp = &(NCONS(*top).right);
5201 parse_subexp(Node** top, OnigToken* tok, int term, argument
5207 *top = NULL;
5215 *top = node;
5218 *top
5245 parse_regexp(Node** top, UChar** src, UChar* end, ScanEnv* env) argument
[all...]
/PHP_5_4/ext/spl/
H A Dspl_heap.c278 spl_ptr_heap_element top; local
285 top = heap->elements[0];
310 heap->dtor(top TSRMLS_CC);
311 return top;
640 extract the element out of the top of the heap */
702 extract the element out of the top of the priority queue */
744 /* {{{ proto mixed SplPriorityQueue::top() U
745 Peek at the top element of the priority queue */
746 SPL_METHOD(SplPriorityQueue, top)
831 /* {{{ proto mixed SplHeap::top()
[all...]
/PHP_5_4/sapi/apache/
H A Dphp_apache.c439 zend_bool top=0; local
443 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "ss|b", &var, &var_len, &val, &val_len, &top) == FAILURE) {
447 while(top) {
/PHP_5_4/sapi/apache_hooks/
H A Dmod_php5.c58 int top, max, persistent; member in struct:_sapi_stack
117 stack->top = 0;
129 if (stack->top >= stack->max) { /* we need to allocate more memory */
136 stack->elements[stack->top] = (void *) element;
137 return stack->top++;
140 if(stack->top == 0) {
144 return stack->elements[--stack->top];
159 for (i=stack->top-1; i>=0; i--) {
164 for (i=0; i<stack->top; i++) {
179 for (i=stack->top
[all...]
H A Dphp_apache.c1812 zend_bool top=0; local
1816 if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "ss|b", &var, &var_len, &val, &val_len, &top) == FAILURE) {
1820 while(top) {
/PHP_5_4/Zend/
H A Dzend_execute.h167 void **top; member in struct:_zend_vm_stack
178 EG(argument_stack)->end - EG(argument_stack)->top)) { \
186 page->top = ZEND_VM_STACK_ELEMETS(page);
187 page->end = page->top + count;
217 return EG(argument_stack)->top;
223 *(EG(argument_stack)->top++) = ptr;
228 *(EG(argument_stack)->top++) = ptr;
233 void *el = *(--EG(argument_stack)->top);
235 if (UNEXPECTED(EG(argument_stack)->top == ZEND_VM_STACK_ELEMETS(EG(argument_stack)))) {
251 int extra = (ZEND_MM_ALIGNMENT - ((zend_uintptr_t)EG(argument_stack)->top
[all...]
H A Dzend_objects_API.h53 zend_uint top; member in struct:_zend_objects_store
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.h26 int top, max; member in struct:_zend_stack
/PHP_5_4/ext/imap/
H A Dphp_imap.c911 options and the value for this one conflicts, simply make PHP_EXPUNGE higher at the top of
4693 static int build_thread_tree(THREADNODE *top, zval **tree) argument
4700 build_thread_tree_helper(top, *tree, &numNodes, buf);
4714 THREADNODE *top; local
4725 top = mail_thread(imap_le_struct->imap_stream, "REFERENCES", NIL, pgm, flags);
4730 if(top == NIL) {
4736 if(build_thread_tree(top, &return_value) == FAILURE) {
4737 mail_free_threadnode(&top);
4740 mail_free_threadnode(&top);
/PHP_5_4/ext/wddx/
H A Dwddx.c96 int top, max; member in struct:__anon3
177 stack->top = 0;
191 if (stack->top >= stack->max) { /* we need to allocate more memory */
195 stack->elements[stack->top] = (void *) emalloc(size);
196 memcpy(stack->elements[stack->top], element, size);
197 return stack->top++;
205 if (stack->top > 0) {
206 *element = stack->elements[stack->top - 1];
219 if (stack->top == 0) {
234 for (i = 0; i < stack->top;
[all...]

Completed in 213 milliseconds