@@ -1447,33 +1447,13 @@ static void dom_libxml_reconcile_ensure_namespaces_are_declared(xmlNodePtr nodep
14471447 xmlDOMWrapReconcileNamespaces (& dummy_ctxt , nodep , /* options */ 0 );
14481448}
14491449
1450- static bool dom_must_replace_namespace_by_empty_default (xmlDocPtr doc , xmlNodePtr nodep )
1451- {
1452- xmlNsPtr default_ns = xmlSearchNs (doc , nodep -> parent , NULL );
1453- return default_ns != NULL && default_ns -> href != NULL && default_ns -> href [0 ] != '\0' ;
1454- }
1455-
1456- static void dom_replace_namespace_by_empty_default (xmlDocPtr doc , xmlNodePtr nodep )
1457- {
1458- ZEND_ASSERT (nodep -> ns == NULL );
1459- /* The node uses the default empty namespace, but the current default namespace is non-empty.
1460- * We can't unconditionally do this because otherwise libxml2 creates an xmlns="" declaration.
1461- * Note: there's no point searching the oldNs list, because we haven't found it in the tree anyway.
1462- * Ideally this would be pre-allocated but unfortunately libxml2 doesn't offer such a functionality. */
1463- xmlSetNs (nodep , xmlNewNs (nodep , (const xmlChar * ) "" , NULL ));
1464- }
1465-
14661450void dom_reconcile_ns (xmlDocPtr doc , xmlNodePtr nodep ) /* {{{ */
14671451{
14681452 /* Although the node type will be checked by the libxml2 API,
14691453 * we still want to do the internal reconciliation conditionally. */
14701454 if (nodep -> type == XML_ELEMENT_NODE ) {
14711455 dom_reconcile_ns_internal (doc , nodep , nodep -> parent );
14721456 dom_libxml_reconcile_ensure_namespaces_are_declared (nodep );
1473- /* Check nodep->ns first to avoid an expensive lookup. */
1474- if (nodep -> ns == NULL && dom_must_replace_namespace_by_empty_default (doc , nodep )) {
1475- dom_replace_namespace_by_empty_default (doc , nodep );
1476- }
14771457 }
14781458}
14791459/* }}} */
@@ -1497,30 +1477,12 @@ static void dom_reconcile_ns_list_internal(xmlDocPtr doc, xmlNodePtr nodep, xmlN
14971477
14981478void dom_reconcile_ns_list (xmlDocPtr doc , xmlNodePtr nodep , xmlNodePtr last )
14991479{
1500- bool did_compute_must_replace_namespace_by_empty_default = false;
1501- bool must_replace_namespace_by_empty_default = false;
1502-
15031480 dom_reconcile_ns_list_internal (doc , nodep , last , nodep -> parent );
1504-
15051481 /* The loop is outside of the recursion in the above call because
15061482 * dom_libxml_reconcile_ensure_namespaces_are_declared() performs its own recursion. */
15071483 while (true) {
15081484 /* The internal libxml2 call will already check the node type, no need for us to do it here. */
15091485 dom_libxml_reconcile_ensure_namespaces_are_declared (nodep );
1510-
1511- /* We don't have to handle the children, because if their ns's are NULL they'll just take on the default
1512- * which should've been reconciled before. */
1513- if (nodep -> ns == NULL ) {
1514- /* This is an optimistic approach: we assume that most of the time we don't need the result of the computation. */
1515- if (!did_compute_must_replace_namespace_by_empty_default ) {
1516- did_compute_must_replace_namespace_by_empty_default = true;
1517- must_replace_namespace_by_empty_default = dom_must_replace_namespace_by_empty_default (doc , nodep );
1518- }
1519- if (must_replace_namespace_by_empty_default ) {
1520- dom_replace_namespace_by_empty_default (doc , nodep );
1521- }
1522- }
1523-
15241486 if (nodep == last ) {
15251487 break ;
15261488 }
0 commit comments