Home
last modified time | relevance | path

Searched refs:nodesc (Results 1 – 2 of 2) sorted by relevance

/PHP-8.3/ext/dom/
H A Dparentnode.c129 for (uint32_t i = 0; i < nodesc; i++) { in dom_is_node_in_list()
180 for (uint32_t i = 0; i < nodesc; i++) { in dom_zvals_to_fragment()
260 for (uint32_t i = 0; i < nodesc; i++) { in dom_sanity_check_node_list_for_insertion()
317 void dom_parent_node_append(dom_object *context, zval *nodes, uint32_t nodesc) in dom_parent_node_append() argument
362 dom_parent_node_append(context, nodes, nodesc); in dom_parent_node_prepend()
393 void dom_parent_node_after(dom_object *context, zval *nodes, uint32_t nodesc) in dom_parent_node_after() argument
413 if (!dom_is_node_in_list(nodes, nodesc, viable_next_sibling)) { in dom_parent_node_after()
445 void dom_parent_node_before(dom_object *context, zval *nodes, uint32_t nodesc) in dom_parent_node_before() argument
465 if (!dom_is_node_in_list(nodes, nodesc, viable_previous_sibling)) { in dom_parent_node_before()
545 void dom_child_replace_with(dom_object *context, zval *nodes, uint32_t nodesc) in dom_child_replace_with() argument
[all …]
H A Dphp_dom.h159 void dom_parent_node_prepend(dom_object *context, zval *nodes, uint32_t nodesc);
160 void dom_parent_node_append(dom_object *context, zval *nodes, uint32_t nodesc);
161 void dom_parent_node_after(dom_object *context, zval *nodes, uint32_t nodesc);
162 void dom_parent_node_before(dom_object *context, zval *nodes, uint32_t nodesc);
163 void dom_parent_node_replace_children(dom_object *context, zval *nodes, uint32_t nodesc);
165 void dom_child_replace_with(dom_object *context, zval *nodes, uint32_t nodesc);

Completed in 7 milliseconds