Searched refs:child (Results 1 - 25 of 40) sorted by relevance

12

/PHP_TRUNK/ext/tidy/examples/
H A Ddumpit5.php84 foreach($node->child as $child) {
85 dump_tree($child, $indent + 3);
H A Durlgrab5.php27 foreach($node->child as $c) {
/PHP_TRUNK/sapi/fpm/fpm/
H A Dfpm_children.h15 int fpm_children_free(struct fpm_child_s *child);
H A Dfpm_stdio.h13 int fpm_stdio_prepare_pipes(struct fpm_child_s *child);
14 void fpm_stdio_child_use_pipes(struct fpm_child_s *child);
15 int fpm_stdio_parent_use_pipes(struct fpm_child_s *child);
16 int fpm_stdio_discard_pipes(struct fpm_child_s *child);
H A Dfpm_children.c59 static void fpm_child_free(struct fpm_child_s *child) /* {{{ */ argument
61 free(child);
65 static void fpm_child_close(struct fpm_child_s *child, int in_event_loop) /* {{{ */ argument
67 if (child->fd_stdout != -1) {
69 fpm_event_fire(&child->ev_stdout);
71 if (child->fd_stdout != -1) {
72 close(child->fd_stdout);
76 if (child->fd_stderr != -1) {
78 fpm_event_fire(&child->ev_stderr);
80 if (child
89 fpm_child_link(struct fpm_child_s *child) argument
105 fpm_child_unlink(struct fpm_child_s *child) argument
125 struct fpm_child_s *child = 0; local
164 fpm_children_free(struct fpm_child_s *child) argument
181 struct fpm_child_s *child; local
330 fpm_resources_discard(struct fpm_child_s *child) argument
338 fpm_child_resources_use(struct fpm_child_s *child) argument
354 fpm_parent_resources_use(struct fpm_child_s *child) argument
364 struct fpm_child_s *child; local
[all...]
H A Dfpm_stdio.c90 /* Notice: child cannot use master error_log
102 zlog(ZLOG_SYSERROR, "failed to init child stdio: dup2()");
115 struct fpm_child_s *child; local
126 child = (struct fpm_child_s *)arg;
127 is_stdout = (fd == child->fd_stdout);
129 event = &child->ev_stdout;
131 event = &child->ev_stderr;
144 zlog(ZLOG_SYSERROR, "unable to read what child say");
151 close(child->fd_stdout);
152 child
207 fpm_stdio_prepare_pipes(struct fpm_child_s *child) argument
237 fpm_stdio_parent_use_pipes(struct fpm_child_s *child) argument
258 fpm_stdio_discard_pipes(struct fpm_child_s *child) argument
273 fpm_stdio_child_use_pipes(struct fpm_child_s *child) argument
[all...]
H A Dfpm_php_trace.c43 static int fpm_php_trace_dump(struct fpm_child_s *child, FILE *slowlog) /* {{{ */ argument
48 pid_t pid = child->pid;
59 fprintf(slowlog, "\n%s [pool %s] pid %d\n", buf, child->wp->config->name, (int) pid);
141 void fpm_php_trace(struct fpm_child_s *child) /* {{{ */ argument
143 fpm_scoreboard_update(0, 0, 0, 0, 0, 0, 1, FPM_SCOREBOARD_ACTION_INC, child->wp->scoreboard);
146 zlog(ZLOG_NOTICE, "about to trace %d", (int) child->pid);
148 slowlog = fopen(child->wp->config->slowlog, "a+");
151 zlog(ZLOG_SYSERROR, "unable to open slowlog (%s)", child->wp->config->slowlog);
155 if (0 > fpm_trace_ready(child->pid)) {
159 if (0 > fpm_php_trace_dump(child, slowlo
[all...]
H A Dfpm_request.h18 void fpm_request_check_timed_out(struct fpm_child_s *child, struct timeval *tv, int terminate_timeout, int slowlog_timeout);
19 int fpm_request_is_idle(struct fpm_child_s *child);
21 int fpm_request_last_activity(struct fpm_child_s *child, struct timeval *tv);
H A Dfpm_process_ctl.c152 struct fpm_child_s *child; local
154 for (child = wp->children; child; child = child->next) {
155 int res = kill(child->pid, signo);
157 zlog(ZLOG_DEBUG, "[pool %s] sending signal %d %s to child %d",
158 child->wp->config->name, signo,
159 fpm_signal_names[signo] ? fpm_signal_names[signo] : "", (int) child->pid);
168 zlog(ZLOG_DEBUG, "%d child(re
299 struct fpm_child_s *child; local
315 struct fpm_child_s *child; local
499 struct fpm_child_s *child; local
[all...]
H A Dfpm_request.c226 void fpm_request_check_timed_out(struct fpm_child_s *child, struct timeval *now, int terminate_timeout, int slowlog_timeout) /* {{{ */ argument
230 proc_p = fpm_scoreboard_proc_acquire(child->wp->scoreboard, child->scoreboard_i, 1);
240 if (child->slow_logged.tv_sec) {
241 if (child->slow_logged.tv_sec != proc.accepted.tv_sec || child->slow_logged.tv_usec != proc.accepted.tv_usec) {
242 child->slow_logged.tv_sec = 0;
243 child->slow_logged.tv_usec = 0;
255 if (child->slow_logged.tv_sec == 0 && slowlog_timeout &&
260 child
283 fpm_request_is_idle(struct fpm_child_s *child) argument
297 fpm_request_last_activity(struct fpm_child_s *child, struct timeval *tv) argument
[all...]
/PHP_TRUNK/sapi/phpdbg/
H A Dzend_mm_structs.h50 struct _zend_mm_free_block *child[2]; member in struct:_zend_mm_free_block
/PHP_TRUNK/sapi/fpm/tests/
H A Dinclude.inc35 $fpm = proc_open('killit () { kill $child; }; trap killit TERM; '.get_fpm_path().' -F -O -y '.$cfg.' '.$extra_args.' 2>&1 & child=$!; wait', $desc, $pipes);
/PHP_TRUNK/ext/spl/internal/
H A Drecursivecachingiterator.inc55 $child = $this->it->getChildren();
60 $this->getChildren = $ref->newInstance($child, $this->flags);
/PHP_TRUNK/ext/intl/resourcebundle/
H A Dresourcebundle_class.h31 UResourceBundle *child; member in struct:__anon115
H A Dresourcebundle.c38 restype = ures_getType( source->child );
42 ufield = ures_getString( source->child, &ilen, &INTL_DATA_ERROR_CODE(source) );
48 bfield = ures_getBinary( source->child, &ilen, &INTL_DATA_ERROR_CODE(source) );
54 lfield = ures_getInt( source->child, &INTL_DATA_ERROR_CODE(source) );
60 vfield = ures_getIntVector( source->child, &ilen, &INTL_DATA_ERROR_CODE(source) );
72 newrb->me = source->child;
73 source->child = NULL;
H A Dresourcebundle_iterator.c37 rb->child = ures_getByIndex( rb->me, iterator->i, rb->child, &icuerror );
40 /* ATTN: key extraction must be the first thing to do... rb->child might be reset in read! */
42 iterator->currentkey = estrdup( ures_getKey( rb->child ) );
H A Dresourcebundle_class.c49 if (rb->child) {
50 ures_close( rb->child );
69 rb->child = NULL;
186 rb->child = ures_getByIndex( rb->me, meindex, rb->child, &INTL_DATA_ERROR_CODE(rb) );
189 rb->child = ures_getByKey(rb->me, mekey, rb->child, &INTL_DATA_ERROR_CODE(rb) );
/PHP_TRUNK/ext/dom/
H A Dnode.c920 xmlNodePtr child, new_child, parentp, refp; local
934 DOM_GET_OBJ(child, node, xmlNodePtr, childobj);
941 (child->parent != NULL && dom_node_is_read_only(child->parent) == SUCCESS)) {
946 if (dom_hierarchy(parentp, child) == FAILURE) {
951 if (child->doc != parentp->doc && child->doc != NULL) {
956 if (child->type == XML_DOCUMENT_FRAG_NODE && child->children == NULL) {
961 if (child
1169 xmlNodePtr children, child, nodep; local
1220 xmlNodePtr child, nodep, new_child = NULL; local
[all...]
/PHP_TRUNK/ext/standard/
H A Dproc_open.h42 php_process_id_t child; member in struct:php_process_handle
/PHP_TRUNK/ext/simplexml/
H A Dsxe.c88 Get name of current child element */
133 php_sxe_object *child; local
143 child = Z_SXEOBJ_P(&sxe->iter.data);
145 GET_NODE(child, node);
157 Get child element iterator */
/PHP_TRUNK/Zend/
H A Dzend_generators.h34 * The solution to this problem is a doubly-linked tree, which all Generators referenced in maintain a reference to. It should be impossible to avoid walking the tree in all cases. This way, we only need tree walks from leaf to root in case where some part of the `yield from` chain is passed to another `yield from`. (Update of leaf node pointer and list of multi-children nodes needed when leaf gets a child in direct path from leaf to root node.) But only in that case, which should be a fairly rare case (which is then possible, but not totally cheap).
35 * The root of the tree is then the currently executed Generator. The subnodes of the tree (all except the root node) are all Generators which do `yield from`. Each node of the tree knows a pointer to one leaf descendant node. Each node with multiple children needs a list of all leaf descendant nodes paired with pointers to their respective child node. (The stack is determined by leaf node pointers) Nodes with only one child just don't need a list, there it is enough to just have a pointer to the child node. Further, leaf nodes store a pointer to the root node.
36 * That way, when we advance any generator, we just need to look up a leaf node (which all have a reference to a root node). Then we can see at the root node whether current Generator is finished. If it isn't, all is fine and we can just continue. If the Generator finished, there will be two cases. Either it is a simple node with just one child, then go down to child node. Or it has multiple children and we now will remove the current leaf node from the list of nodes (unnecessary, is microoptimization) and go down to the child node whose reference was paired with current leaf node. Child node is then removed its parent reference and becomes new top node. Or the current node references the Generator we're currently executing, then we can continue from the YIELD_FROM opcode. When a node referenced as root node in a leaf node has a parent, then we go the way up until we find a root node without parent.
38 * When a Generator referenced by a node of the tree is added to `yield from`, that node now gets a list of children (we need to walk the descendants of that node and nodes of the tree of the other Generator down to the first multi-children node and copy all the leaf node pointers from there). In case there was no multi-children node (linear tree), we just add a pair (pointer to leaf node, pointer to child node), with the child node being in a direct path from leaf to this node.
48 zend_generator *child; member in struct:_zend_generator_node::__anon1::__anon2
50 } child; member in struct:_zend_generator_node
[all...]
H A Dzend_ast.c86 ast->child[0] = child0;
87 ast->child[1] = child1;
88 ast->child[2] = child2;
89 ast->child[3] = child3;
104 ast->child[i] = va_arg(va, zend_ast *);
105 if (ast->child[i] != NULL) {
106 uint32_t lineno = zend_ast_get_lineno(ast->child[i]);
176 list->child[list->children++] = op;
219 if (UNEXPECTED(zend_ast_evaluate(&op1, ast->child[0], scope) != SUCCESS)) {
221 } else if (UNEXPECTED(zend_ast_evaluate(&op2, ast->child[
[all...]
H A Dzend_generators.c201 zend_hash_destroy(&generator->node.child.ht);
336 return node->child.array[0].child;
339 if (node->child.array[x].leaf == leaf) { \
340 return node->child.array[x].child; \
349 ZEND_ASSERT(0); // we never should have no matching child
352 return zend_hash_index_find_ptr(&node->child.ht, (zend_ulong) leaf);
358 node = &node->child.array[0].child
363 zend_generator_add_single_child(zend_generator_node *node, zend_generator *child, zend_generator *leaf) argument
373 zend_generator *child; member in struct:__anon1
388 zend_generator_merge_child_nodes(zend_generator_node *dest, zend_generator_node *src, zend_generator *child) argument
404 zend_generator_add_child(zend_generator *generator, zend_generator *child) argument
419 zend_generator *child = zend_hash_index_find_ptr(&next->node.child.ht, (zend_ulong) generator); local
[all...]
H A Dzend_inheritance.c504 static void do_inheritance_check_on_method(zend_function *child, zend_function *parent) /* {{{ */ argument
511 && parent->common.scope != (child->common.prototype ? child->common.prototype->common.scope : child->common.scope)
512 && child->common.fn_flags & (ZEND_ACC_ABSTRACT|ZEND_ACC_IMPLEMENTED_ABSTRACT)) {
515 child->common.function_name->val,
516 child->common.prototype ? child->common.prototype->common.scope->name->val : child->common.scope->name->val);
520 zend_error_noreturn(E_COMPILE_ERROR, "Cannot override final method %s::%s()", ZEND_FN_SCOPE_NAME(parent), child
578 zval *child = zend_hash_find(&ce->function_table, key); local
595 zval *child = zend_hash_find(&ce->properties_info, key); local
[all...]
H A Dzend_compile.c2011 ast = ast->child[0];
2093 zend_ast *name_ast = ast->child[0];
2120 zend_ast *name_ast = ast->child[0];
2197 zend_ast *var_ast = ast->child[0];
2198 zend_ast *dim_ast = ast->child[1];
2239 if (ast->kind == ZEND_AST_VAR && ast->child[0]->kind == ZEND_AST_ZVAL) {
2240 zval *name = zend_ast_get_zval(ast->child[0]);
2250 zend_ast *obj_ast = ast->child[0];
2251 zend_ast *prop_ast = ast->child[1];
2291 zend_ast *class_ast = ast->child[
[all...]

Completed in 47 milliseconds

12