Searched refs:children (Results 1 - 25 of 43) sorted by relevance

12

/PHP_5_5/ext/dom/examples/
H A Ddom1.php12 // children() of of document would result in a memleak
13 //$children = $dom->children();
14 //print_node_list($children);
20 echo "--------- children of root\n";
21 $children = $rootnode->childNodes; variable
22 print_node_list($children);
24 // The last node should be identical with the last entry in the children array
34 // The children of this parent are the same children a
36 $children = $parent->childNodes; variable
63 $children = $attrs->item(0)->childNodes; variable
75 $children = $dom->getElementsByTagname("Silly"); variable
79 $children = $rootnode->getElementsByTagName("Silly"); variable
[all...]
/PHP_5_5/ext/spl/examples/
H A Drecursivedualiterator.inc33 /** @return whether both LHS and RHS have children
41 * iterators current children.
/PHP_5_5/ext/spl/internal/
H A Dparentiterator.inc20 * children.
24 /** @return whetehr the current element has children
H A Drecursivearrayiterator.inc32 /** @return whether the current element has children
39 /** @return an iterator for the current elements children
H A Drecursivecachingiterator.inc80 /** @return whether the current element has children
81 * @note The check whether the Iterator for the children can be created was
84 * not try to access those children.
91 /** @return An Iterator for the children
H A Drecursivefilteriterator.inc39 /** @return whether the current element has children
46 /** @return an iterator for the current elements children
H A Drecursiveiterator.inc20 /** @return whether the current element has children
H A Drecursiveiteratoriterator.inc26 /** Mode: Show parents prior to their children */
28 /** Mode: Show all children prior to their parent */
46 * - CHILD_FIRST show all children prior to their parent
182 /** @return whether current sub iterators current element has children
190 /** @return current sub iterators current children
H A Drecursiveregexiterator.inc38 /** @return whether the current element has children
45 /** @return an iterator for the current elements children
/PHP_5_5/ext/xmlrpc/libxmlrpc/
H A Dxml_element.c207 Q_Destroy(&root->children);
238 xml_element* kids = Q_Head(&root->children);
241 kids = Q_Next(&root->children);
268 Q_Init(&elem->children);
438 /* if no text and no children, use abbreviated form, eg: <foo/> */
439 if(!el->text.len && !Q_Size(&el->children)) {
474 xml_element *kids = Q_Head(&el->children);
483 kids = Q_Next(&el->children);
628 Q_PushTail(&mydata->current->parent->children, mydata->current);
754 xReturn = (xml_element*)Q_Head(&mydata.root->children);
[all...]
H A Dxml_element.h155 queue children; /* child element list */ member in struct:_xml_element
185 #define xml_elem_next_element(el) ((el) ? (xml_element *)Q_Next(&el->children) : NULL)
186 #define xml_elem_head_element(el) ((el) ? (xml_element *)Q_Head(&el->children) : NULL)
H A Dxml_to_dandarpc.c113 xml_element* iter = (xml_element*)Q_Head(&el->children);
128 iter = (xml_element*)Q_Next(&el->children);
132 xml_element* iter = (xml_element*)Q_Head(&el->children);
135 iter = (xml_element*)Q_Next(&el->children);
258 Q_PushTail(&elem_val->children, next_el);
304 Q_PushTail(&root->children, wrapper);
312 Q_PushTail(&wrapper->children, method);
314 Q_PushTail(&wrapper->children,
H A Dxml_to_xmlrpc.c80 xml_element* fault_value = (xml_element*)Q_Head(&el->children);
84 xml_element* fault_struct = (xml_element*)Q_Head(&fault_value->children);
86 xml_element* iter = (xml_element*)Q_Head(&fault_struct->children);
92 iter = (xml_element*)Q_Next(&fault_struct->children);
100 xml_element* iter = (xml_element*)Q_Head(&el->children);
107 iter = (xml_element*)Q_Next(&el->children);
111 xml_element* iter = (xml_element*)Q_Head(&el->children);
118 iter = (xml_element*)Q_Next(&el->children);
122 (!strcmp(el->name, ELEM_VALUE) && Q_Size(&el->children) == 0)) {
165 iter = (xml_element*)Q_Head(&el->children);
[all...]
H A Dxmlrpc_introspection.c351 if(Q_Size(&el->children) &&
356 xml_element* elem_iter = Q_Head(&el->children);
360 elem_iter = Q_Next(&el->children);
372 if(Q_Size(&el->children)) {
373 xml_element* elem_iter = Q_Head(&el->children);
380 elem_iter = Q_Next(&el->children);
387 xml_element* elem_iter = Q_Head(&el->children);
395 elem_iter = Q_Next(&el->children);
404 /* sure. we'll let any ol element with children through */
405 else if(Q_Size(&el->children)) {
[all...]
H A Dxml_to_soap.c340 /* Next, we begin to convert actual values. if no children, then must be a scalar value. */
341 if (!Q_Size(&el->children)) {
371 /* Element has children, thus a vector, or "compound type" in soap-speak. */
374 xml_element* iter = (xml_element*)Q_Head(&el->children);
381 this is passed down as we recurse, so our children have access to the info. */
406 iter = (xml_element*)Q_Next(&el->children);
487 Q_PushTail(&elem_val->children, next_el);
610 Q_PushTail(&body->children, el_serialized);
642 if(Q_Size(&el_serialized->children) && rtype == xmlrpc_request_call) {
643 xml_element* iter = (xml_element*)Q_Head(&el_serialized->children);
[all...]
/PHP_5_5/sapi/fpm/fpm/
H A Dfpm_worker_pool.c43 fpm_children_free(wp->children);
H A Dfpm_worker_pool.h31 struct fpm_child_s *children; member in struct:fpm_worker_pool_s
/PHP_5_5/ext/soap/
H A Dphp_encoding.c320 id = (char*)attr->children->content;
337 id = (char*)attr->children->content;
563 parse_namespace(type_attr->children->content, &cptype, &ns);
597 encodePtr enc = get_encoder_from_prefix(SOAP_GLOBAL(sdl), data, type_attr->children->content);
633 if (doc && doc->children) {
634 ret = xmlDocCopyNode(doc->children, parent->doc, 1);
687 if (data && data->children) {
688 if (data->children->type == XML_TEXT_NODE && data->children->next == NULL) {
690 xmlBufferPtr in = xmlBufferCreateStatic(data->children
[all...]
H A Dphp_packet_soap.c57 trav = response->children;
93 } else if (strcmp((char*)attr->children->content, SOAP_1_1_ENC_NAMESPACE) != 0) {
104 trav = env->children;
143 } else if (strcmp((char*)attr->children->content, SOAP_1_1_ENC_NAMESPACE) != 0) {
169 } else if (strcmp((char*)attr->children->content, SOAP_1_1_ENC_NAMESPACE) != 0) {
180 fault = get_node_ex(body->children,"Fault",envelope_ns);
187 tmp = get_node(fault->children, "faultcode");
188 if (tmp != NULL && tmp->children != NULL) {
189 faultcode = (char*)tmp->children->content;
192 tmp = get_node(fault->children, "faultstrin
[all...]
H A Dphp_schema.c112 schema = get_node(doc->children, "schema");
119 if (ns != NULL && (new_tns == NULL || xmlStrcmp(ns->children->content, new_tns->children->content) != 0)) {
121 soap_error2(E_ERROR, "Parsing Schema: can't import schema from '%s', unexpected 'targetNamespace'='%s'", location, ns->children->content);
125 soap_error2(E_ERROR, "Parsing Schema: can't import schema from '%s', unexpected 'targetNamespace'='%s'", location, new_tns->children->content);
131 xmlSetProp(schema, BAD_CAST("targetNamespace"), tns->children->content);
133 } else if (tns != NULL && xmlStrcmp(tns->children->content, new_tns->children->content) != 0) {
187 trav = schema->children;
200 uri = xmlBuildURI(location->children
[all...]
H A Dphp_sdl.c219 attr->children && attr->children->content &&
220 (strcmp((char*)attr->children->content, "1") == 0 ||
221 strcmp((char*)attr->children->content, "true") == 0)) {
348 root = wsdl->children;
364 tmpsdl->target_ns = estrdup((char*)targetNamespace->children->content);
368 trav = definitions->children;
376 xmlNodePtr trav2 = trav->children;
394 uri = xmlBuildURI(tmp->children->content, trav->doc->URL);
396 uri = xmlBuildURI(tmp->children
[all...]
H A Dphp_xml.c47 trav = node->children;
61 } else if (trav->children != NULL) {
263 } else if (node->children != NULL) {
264 xmlNodePtr tmp = get_node_recurisve_ex(node->children, name, ns);
287 if (attr != NULL && strcmp((char*)attr->children->content, value) == 0) {
300 if (attr != NULL && strcmp((char*)attr->children->content, value) == 0) {
304 if (node->children != NULL) {
305 xmlNodePtr tmp = get_node_with_attribute_recursive_ex(node->children, name, name_ns, attribute, value, attr_ns);
/PHP_5_5/ext/dom/
H A Ddocumentfragment.c99 if (prop->children) {
100 cur = prop->children;
109 if (tree->children != NULL) {
110 cur = tree->children;
H A Dnode.c311 str = xmlNodeGetContent(nodep->children);
348 if (nodep->children) {
349 node_list_unlink(nodep->children TSRMLS_CC);
491 first = nodep->children;
954 newchild = fragment->children;
958 nodep->children = newchild;
987 fragment->children = NULL;
1038 if (child->type == XML_DOCUMENT_FRAG_NODE && child->children == NULL) {
1073 if (new_child->parent->children == refp) {
1074 new_child->parent->children
1163 xmlNodePtr children, newchild, oldchild, nodep; local
1251 xmlNodePtr children, child, nodep; local
[all...]
H A Dnodelist.c73 curnode = nodep->children;
85 nodep = nodep->children;
146 curnode = nodep->children;
156 nodep = nodep->children;

Completed in 31 milliseconds

12