Searched defs:child (Results 1 - 20 of 20) sorted by relevance

/PHP_TRUNK/sapi/fpm/fpm/
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_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...]
H A Dfpm_php_trace.c43 static int fpm_php_trace_dump(struct fpm_child_s *child, FILE *slowlog) /* {{{ */ argument
46 pid_t pid = child->pid;
58 fprintf(slowlog, "\n%s [pool %s] pid %d\n", buf, child->wp->config->name, (int) pid);
197 void fpm_php_trace(struct fpm_child_s *child) /* {{{ */ argument
199 fpm_scoreboard_update(0, 0, 0, 0, 0, 0, 1, FPM_SCOREBOARD_ACTION_INC, child->wp->scoreboard);
202 zlog(ZLOG_NOTICE, "about to trace %d", (int) child->pid);
204 slowlog = fopen(child->wp->config->slowlog, "a+");
207 zlog(ZLOG_SYSERROR, "unable to open slowlog (%s)", child->wp->config->slowlog);
211 if (0 > fpm_trace_ready(child->pid)) {
215 if (0 > fpm_php_trace_dump(child, slowlo
[all...]
/PHP_TRUNK/ext/intl/resourcebundle/
H A Dresourcebundle_class.h31 UResourceBundle *child; member in struct:__anon115
/PHP_TRUNK/ext/mbstring/oniguruma/
H A Dregexec.c98 history_tree_add_child(OnigCaptureTreeNode* parent, OnigCaptureTreeNode* child) argument
123 parent->childs[parent->num_childs] = child;
132 OnigCaptureTreeNode *clone, *child; local
140 child = history_tree_clone(node->childs[i]);
141 if (IS_NULL(child)) {
145 history_tree_add_child(clone, child);
1041 OnigCaptureTreeNode* child; local
1049 child = history_node_new();
1050 CHECK_NULL_RETURN_MEMERR(child);
1051 child
[all...]
/PHP_TRUNK/Zend/
H A Dzend_ast.h62 /* 0 child nodes */
66 /* 1 child node */
100 /* 2 child nodes */
137 /* 3 child nodes */
146 /* 4 child nodes */
158 zend_ast *child[1]; /* Array of children (using struct hack) */ member in struct:_zend_ast
167 zend_ast *child[1]; member in struct:_zend_ast_list
187 zend_ast *child[4]; member in struct:_zend_ast_decl
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::__anon2::__anon3
50 } child; member in struct:_zend_generator_node
[all...]
H A Dzend_compile.c2084 ast = ast->child[0];
2160 zend_ast *name_ast = ast->child[0];
2187 zend_ast *name_ast = ast->child[0];
2264 zend_ast *var_ast = ast->child[0];
2265 zend_ast *dim_ast = ast->child[1];
2306 if (ast->kind == ZEND_AST_VAR && ast->child[0]->kind == ZEND_AST_ZVAL) {
2307 zval *name = zend_ast_get_zval(ast->child[0]);
2317 zend_ast *obj_ast = ast->child[0];
2318 zend_ast *prop_ast = ast->child[1];
2358 zend_ast *class_ast = ast->child[
3081 zend_ast *child = (zend_ast_is_list(ast) ? zend_ast_get_list(ast)->child : ast->child)[i]; local
7355 zend_ast **child, *child_ast; local
[all...]
H A Dzend_generators.c182 zend_hash_destroy(&generator->node.child.ht);
317 return node->child.array[0].child;
320 if (node->child.array[x].leaf == leaf) { \
321 return node->child.array[x].child; \
330 ZEND_ASSERT(0); // we never should have no matching child
333 return zend_hash_index_find_ptr(&node->child.ht, (zend_ulong) leaf);
339 node = &node->child.array[0].child
344 zend_generator_add_single_child(zend_generator_node *node, zend_generator *child, zend_generator *leaf) argument
354 zend_generator *child; member in struct:__anon1
369 zend_generator_merge_child_nodes(zend_generator_node *dest, zend_generator_node *src, zend_generator *child) argument
385 zend_generator_add_child(zend_generator *generator, zend_generator *child) argument
400 zend_generator *child = zend_hash_index_find_ptr(&next->node.child.ht, (zend_ulong) generator); local
[all...]
H A Dzend_inheritance.c507 static void do_inheritance_check_on_method(zend_function *child, zend_function *parent) /* {{{ */ argument
514 && parent->common.scope != (child->common.prototype ? child->common.prototype->common.scope : child->common.scope)
515 && child->common.fn_flags & (ZEND_ACC_ABSTRACT|ZEND_ACC_IMPLEMENTED_ABSTRACT)) {
518 ZSTR_VAL(child->common.function_name),
519 child->common.prototype ? ZSTR_VAL(child->common.prototype->common.scope->name) : ZSTR_VAL(child->common.scope->name));
523 zend_error_noreturn(E_COMPILE_ERROR, "Cannot override final method %s::%s()", ZEND_FN_SCOPE_NAME(parent), ZSTR_VAL(child
585 zval *child = zend_hash_find(&ce->function_table, key); local
602 zval *child = zend_hash_find(&ce->properties_info, key); local
[all...]
/PHP_TRUNK/ext/standard/
H A Dproc_open.h40 php_process_id_t child; member in struct:php_process_handle
H A Dproc_open.c228 wait_pid = waitpid(proc->child, &wstatus, waitpid_options);
281 if (kill(proc->child, sig_no) == 0) {
338 add_assoc_long(return_value, "pid", (zend_long) proc->child);
350 wait_pid = waitpid(proc->child, &wstatus, WNOHANG|WUNTRACED);
352 if (wait_pid == proc->child) {
415 int index; /* desired fd number in child process */
416 php_file_descriptor_t parentend, childend; /* fds for pipes in parent/child */
458 php_process_id_t child; local
519 /* we use this to allow the child to inherit handles */
602 /* don't let the child inheri
[all...]
/PHP_TRUNK/ext/simplexml/
H A Dsxe.c91 Get name of current child element */
136 php_sxe_object *child; local
146 child = Z_SXEOBJ_P(&sxe->iter.data);
148 GET_NODE(child, node);
160 Get child element iterator */
/PHP_TRUNK/ext/dom/
H A Dphp_dom.c1303 /* {{{ int dom_hierarchy(xmlNodePtr parent, xmlNodePtr child) */
1304 int dom_hierarchy(xmlNodePtr parent, xmlNodePtr child) argument
1308 if (parent == NULL || child == NULL || child->doc != parent->doc) {
1315 if (nodep == child) {
1369 xmlNodePtr child, nextp, newnextp; local
1373 child = nodep->children;
1374 while(child != NULL) {
1375 switch (child->type) {
1377 nextp = child
[all...]
H A Dxpath.c141 zval child; local
161 php_dom_create_object(node, &child, &intern->dom);
162 add_next_index_zval(&fci.params[i], &child);
442 zval child; local
462 php_dom_create_object(node, &child, &intern->dom);
463 add_next_index_zval(&retval, &child);
H A Dnode.c918 xmlNodePtr child, new_child, parentp, refp; local
932 DOM_GET_OBJ(child, node, xmlNodePtr, childobj);
939 (child->parent != NULL && dom_node_is_read_only(child->parent) == SUCCESS)) {
944 if (dom_hierarchy(parentp, child) == FAILURE) {
949 if (child->doc != parentp->doc && child->doc != NULL) {
954 if (child->type == XML_DOCUMENT_FRAG_NODE && child->children == NULL) {
959 if (child
1167 xmlNodePtr children, child, nodep; local
1218 xmlNodePtr child, nodep, new_child = NULL; local
[all...]
/PHP_TRUNK/ext/spl/
H A Dspl_iterators.c240 zval retval, child; local
332 zend_call_method_with_0_params(zthis, object->ce, &object->callGetChildren, "callGetChildren", &child);
334 zend_call_method_with_0_params(zobject, ce, NULL, "getchildren", &child);
342 zval_ptr_dtor(&child);
348 if (Z_TYPE(child) == IS_UNDEF || Z_TYPE(child) != IS_OBJECT ||
349 !((ce = Z_OBJCE(child)) && instanceof_function(ce, spl_ce_RecursiveIterator))) {
350 zval_ptr_dtor(&child);
361 sub_iter = ce->get_iterator(ce, &child, 0);
362 ZVAL_COPY_VALUE(&object->iterators[object->level].zobject, &child);
[all...]
/PHP_TRUNK/ext/xsl/
H A Dxsltprocessor.c257 zval child; local
280 php_dom_create_object(node, &child, domintern);
281 add_next_index_zval(&args[i], &child);

Completed in 45 milliseconds