Searched refs:root (Results 1 - 25 of 27) sorted by relevance

12

/PHP_TRUNK/ext/tidy/examples/
H A Ddumpit5.php21 $tree = $tidy->root();
/PHP_TRUNK/ext/xmlrpc/libxmlrpc/
H A Dxml_element.c79 * root element should not have a parent. patch from anon SF user
184 * void xml_elem_free_non_recurse(xml_element* root)
188 * root - the element to free
197 void xml_elem_free_non_recurse(xml_element* root) { argument
198 if(root) {
199 xml_element_attr* attrs = Q_Head(&root->attrs);
204 attrs = Q_Next(&root->attrs);
207 Q_Destroy(&root->children);
208 Q_Destroy(&root->attrs);
209 if(root
236 xml_elem_free(xml_element* root) argument
587 xml_element* root; member in struct:_xml_elem_data
[all...]
H A Dxml_element.h159 void xml_elem_free(xml_element* root);
160 void xml_elem_free_non_recurse(xml_element* root);
H A Dxml_to_dandarpc.c173 xml_element* root = NULL; local
270 root = elem_val;
272 return root;
281 xml_element* root = NULL; local
301 root = xml_elem_new();
302 root->name = strdup(ELEM_ROOT);
303 Q_PushTail(&root->attrs, version);
304 Q_PushTail(&root->children, wrapper);
317 return root;
H A Dxml_to_soap.c583 xml_element* root = xml_elem_new(); local
586 if (root) {
588 root->name = strdup("SOAP-ENV:Envelope");
591 Q_PushTail(&root->attrs, new_attr("xmlns:SOAP-ENV", "http://schemas.xmlsoap.org/soap/envelope/"));
592 Q_PushTail(&root->attrs, new_attr("xmlns:xsi", "http://www.w3.org/1999/XMLSchema-instance"));
593 Q_PushTail(&root->attrs, new_attr("xmlns:xsd", "http://www.w3.org/1999/XMLSchema"));
594 Q_PushTail(&root->attrs, new_attr("xmlns:SOAP-ENC", "http://schemas.xmlsoap.org/soap/encoding/"));
595 Q_PushTail(&root->attrs, new_attr("xmlns:si", "http://soapinterop.org/xsd"));
596 Q_PushTail(&root->attrs, new_attr("xmlns:ns6", "http://testuri.org"));
597 Q_PushTail(&root
[all...]
H A Dxml_to_xmlrpc.c192 xml_element* root = NULL; local
199 /* special case for when root element is not an array */
311 root = value;
319 root = param;
338 root = member;
347 root = value;
351 root = elem_val;
360 root = value;
364 return root;
H A Dxmlrpc_introspection.c460 xml_element* root = xml_elem_parse_buf(xml, 0, 0, err ? &err->xml_elem_error : NULL); local
462 if(root) {
463 xReturn = xml_element_to_method_description(root, err);
465 xml_elem_free(root);
/PHP_TRUNK/ext/pdo/
H A Dphp_pdo_int.h30 PDO_API zend_class_entry *php_pdo_get_exception_base(int root);
H A Dpdo.c80 PDO_API zend_class_entry *php_pdo_get_exception_base(int root) /* {{{ */ argument
83 if (!root) {
/PHP_TRUNK/travis/ext/imap/
H A Ddovecot.conf15 user = root
/PHP_TRUNK/ext/mbstring/oniguruma/
H A Dregcomp.c1894 disable_noname_group_capture(Node** root, regex_t* reg, ScanEnv* env) argument
1906 r = noname_disable_map(root, map, &counter);
1909 r = renumber_by_map(*root, map);
3371 Node *top_root, *root, *snode, *prev_node; local
3382 top_root = root = prev_node = snode = NULL_NODE;
3397 if (IS_NULL(root) && IS_NOT_NULL(prev_node)) {
3398 top_root = root = onig_node_list_add(NULL_NODE, prev_node);
3399 if (IS_NULL(root)) {
3407 if (IS_NOT_NULL(root)) {
3408 if (IS_NULL(onig_node_list_add(root, snod
5268 Node* root; local
[all...]
H A Dregparse.c5522 onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end, argument
5541 *root = NULL;
5543 r = parse_regexp(root, &p, (UChar* )end, env);
H A Dregparse.h342 extern int onig_parse_make_tree P_((Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env));
/PHP_TRUNK/ext/fileinfo/libmagic/
H A Dcdf.c711 const cdf_directory_t **root)
716 *root = NULL;
725 *root = d;
1273 "user stream", "lockbytes", "property", "root storage" };
1446 const cdf_directory_t *root; local
1480 if (cdf_read_short_stream(&info, &h, &sat, &dir, &sst, &root)
709 cdf_read_short_stream(const cdf_info_t *info, const cdf_header_t *h, const cdf_sat_t *sat, const cdf_dir_t *dir, cdf_stream_t *scn, const cdf_directory_t **root) argument
/PHP_TRUNK/ext/mysqlnd/
H A Dmysqlnd_structs.h96 char *root; member in struct:st_mysqlnd_field
H A Dmysqlnd_result_meta.c36 if (meta->root) {
37 mnd_pefree(meta->root, persistent);
38 meta->root = NULL;
69 if (meta->fields[i].root) {
71 mnd_pefree(meta->fields[i].root, meta->persistent);
72 meta->fields[i].root = NULL;
214 This will copy also the strings and the root, which we will have
219 /* First copy the root, then field by field adjust the pointers */
220 new_fields[i].root = mnd_pemalloc(orig_fields[i].root_len, persistent);
222 if (!new_fields[i].root) {
[all...]
/PHP_TRUNK/Zend/
H A Dzend_gc.c117 static zend_always_inline void gc_remove_from_roots(gc_root_buffer *root) argument
119 root->next->prev = root->prev;
120 root->prev->next = root->next;
121 root->prev = GC_G(unused);
122 GC_G(unused) = root;
249 fprintf(stderr, "GC: no space to record new root candidate\n");
274 gc_root_buffer *root; local
281 root
873 gc_remove_nested_data_from_buffer(zend_refcounted *ref, gc_root_buffer *root) argument
[all...]
H A Dzend_generators.c192 zend_generator *root = generator->node.ptr.root, *next; local
193 while (root != generator) {
194 next = zend_generator_get_child(&root->node, generator);
195 OBJ_RELEASE(&root->std);
196 root = next;
218 generator->node.ptr.root = generator;
279 zend_generator *root = (generator->node.children < 1 ? generator : generator->node.ptr.leaf)->node.ptr.root; local
281 if (generator->node.parent != root) {
478 zend_generator *root, *old_root; local
789 zend_generator *generator, *root; local
813 zend_generator *generator, *root; local
856 zend_generator *generator, *root; local
908 zend_generator *root = zend_generator_get_current(generator); local
998 zend_generator *generator = (zend_generator*)Z_OBJ(iterator->data), *root; local
1010 zend_generator *generator = (zend_generator*)Z_OBJ(iterator->data), *root; local
[all...]
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.
37 * In case we go into a new `yield from` level, a node is created on top of current root an
53 zend_generator *root; /* if 0 children */ member in union:_zend_generator_node::__anon4
[all...]
/PHP_TRUNK/ext/dom/
H A Dnode.c1378 xmlNodePtr root = node; local
1380 while (root->parent != NULL) {
1381 root = root->parent;
1383 node->ns = xmlNewNs(root, ns->href, ns->prefix);
H A Ddocument.c287 xmlNode *root; local
294 root = xmlDocGetRootElement(docp);
295 if (!root) {
300 php_dom_create_object(root, retval, obj);
1010 xmlNodePtr root = xmlDocGetRootElement(docp); local
1012 nsptr = xmlSearchNsByHref (nodep->doc, root, nodep->ns->href);
1015 nsptr = dom_get_ns(root, (char *) nodep->ns->href, &errorcode, (char *) nodep->ns->prefix);
1097 xmlNodePtr nodep = NULL, root; local
1112 root = xmlDocGetRootElement(docp);
1113 if (root !
1714 xmlNodePtr root; local
[all...]
/PHP_TRUNK/ext/soap/
H A Dphp_sdl.c321 xmlNodePtr root, definitions, trav; local
344 root = wsdl->children;
345 definitions = get_node_ex(root, "definitions", WSDL_NAMESPACE);
348 xmlNodePtr schema = get_node_ex(root, "schema", XSD_NAMESPACE);
/PHP_TRUNK/ext/snmp/
H A Dsnmp.c708 oid root[MAX_NAME_LEN]; local
724 if (st & SNMP_CMD_WALK) { /* remember root OID */
725 memmove((char *)root, (char *)(objid_query->vars[0].name), (objid_query->vars[0].name_length) * sizeof(oid));
817 (vars->name_length < rootlen || memcmp(root, vars->name, rootlen * sizeof(oid)))) { /* not part of this subtree */
856 if (rootlen <= vars->name_length && snmp_oid_compare(root, rootlen, vars->name, rootlen) == 0) {
/PHP_TRUNK/ext/ldap/tests/
H A Dconnect.inc25 // Create root if not there
/PHP_TRUNK/ext/tidy/
H A Dtidy.c423 TIDY_METHOD_MAP(root, tidy_get_root, NULL)
1647 Returns a TidyNode Object representing the root of the tidy parse tree */

Completed in 67 milliseconds

12