@@ -1496,33 +1496,13 @@ static void dom_libxml_reconcile_ensure_namespaces_are_declared(xmlNodePtr nodep
1496
1496
xmlDOMWrapReconcileNamespaces (& dummy_ctxt , nodep , /* options */ 0 );
1497
1497
}
1498
1498
1499
- static bool dom_must_replace_namespace_by_empty_default (xmlDocPtr doc , xmlNodePtr nodep )
1500
- {
1501
- xmlNsPtr default_ns = xmlSearchNs (doc , nodep -> parent , NULL );
1502
- return default_ns != NULL && default_ns -> href != NULL && default_ns -> href [0 ] != '\0' ;
1503
- }
1504
-
1505
- static void dom_replace_namespace_by_empty_default (xmlDocPtr doc , xmlNodePtr nodep )
1506
- {
1507
- ZEND_ASSERT (nodep -> ns == NULL );
1508
- /* The node uses the default empty namespace, but the current default namespace is non-empty.
1509
- * We can't unconditionally do this because otherwise libxml2 creates an xmlns="" declaration.
1510
- * Note: there's no point searching the oldNs list, because we haven't found it in the tree anyway.
1511
- * Ideally this would be pre-allocated but unfortunately libxml2 doesn't offer such a functionality. */
1512
- xmlSetNs (nodep , xmlNewNs (nodep , (const xmlChar * ) "" , NULL ));
1513
- }
1514
-
1515
1499
void dom_reconcile_ns (xmlDocPtr doc , xmlNodePtr nodep ) /* {{{ */
1516
1500
{
1517
1501
/* Although the node type will be checked by the libxml2 API,
1518
1502
* we still want to do the internal reconciliation conditionally. */
1519
1503
if (nodep -> type == XML_ELEMENT_NODE ) {
1520
1504
dom_reconcile_ns_internal (doc , nodep , nodep -> parent );
1521
1505
dom_libxml_reconcile_ensure_namespaces_are_declared (nodep );
1522
- /* Check nodep->ns first to avoid an expensive lookup. */
1523
- if (nodep -> ns == NULL && dom_must_replace_namespace_by_empty_default (doc , nodep )) {
1524
- dom_replace_namespace_by_empty_default (doc , nodep );
1525
- }
1526
1506
}
1527
1507
}
1528
1508
/* }}} */
@@ -1546,30 +1526,12 @@ static void dom_reconcile_ns_list_internal(xmlDocPtr doc, xmlNodePtr nodep, xmlN
1546
1526
1547
1527
void dom_reconcile_ns_list (xmlDocPtr doc , xmlNodePtr nodep , xmlNodePtr last )
1548
1528
{
1549
- bool did_compute_must_replace_namespace_by_empty_default = false;
1550
- bool must_replace_namespace_by_empty_default = false;
1551
-
1552
1529
dom_reconcile_ns_list_internal (doc , nodep , last , nodep -> parent );
1553
-
1554
1530
/* The loop is outside of the recursion in the above call because
1555
1531
* dom_libxml_reconcile_ensure_namespaces_are_declared() performs its own recursion. */
1556
1532
while (true) {
1557
1533
/* The internal libxml2 call will already check the node type, no need for us to do it here. */
1558
1534
dom_libxml_reconcile_ensure_namespaces_are_declared (nodep );
1559
-
1560
- /* We don't have to handle the children, because if their ns's are NULL they'll just take on the default
1561
- * which should've been reconciled before. */
1562
- if (nodep -> ns == NULL ) {
1563
- /* This is an optimistic approach: we assume that most of the time we don't need the result of the computation. */
1564
- if (!did_compute_must_replace_namespace_by_empty_default ) {
1565
- did_compute_must_replace_namespace_by_empty_default = true;
1566
- must_replace_namespace_by_empty_default = dom_must_replace_namespace_by_empty_default (doc , nodep );
1567
- }
1568
- if (must_replace_namespace_by_empty_default ) {
1569
- dom_replace_namespace_by_empty_default (doc , nodep );
1570
- }
1571
- }
1572
-
1573
1535
if (nodep == last ) {
1574
1536
break ;
1575
1537
}
0 commit comments