leptris 1.9.304.0-ppc64le-linux → 1.9.306.0-ppc64le-linux

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 785d9b7e66ab4d337f9002a5d4bc39d67c681a74e1dc04967990279e866e034c
-  data.tar.gz: e804fd26e2b9ab2d42cbdcd1e0af3972f5d1fc8dda4c6c690c0308bb9b0030ae
+  metadata.gz: b52c3a85fab2e17ea780a4a42824f5f5ef0a1e76de6e9785d9f1bf61f0a4e2a7
+  data.tar.gz: 8c493949121bf7418a97beabd4fee8329b1f2ee9ee0dc8219b7ec07bc2cf74ef
 SHA512:
-  metadata.gz: 36067b9300f15de58055ce88d04ba035410585c79134270ce26fb54ff177f6366e904e248554548c23c7670666f6e90045cf6f756c51a037e5ccddb334770de4
-  data.tar.gz: 37873702eb98d9aa34dddbd8b876e650a0b1a9abb6a84798922161007a548953df1c3565bf624476862540bd76ff9716b6374ee73a424005182cf71ef79512eb
+  metadata.gz: d3aaf0027ab03316068eabb5173873cfb76f7c851f716270f5fb25355a31421309f33b7c9af262fba85f14b25688ac660c93e06b9a56e81c9484c7f16b2a262a
+  data.tar.gz: 2ae6b417a8f8a62d820d7af559e3a7f873b65f49da35739daae899187441b6b54e81ea6a0d01a27be5dc6089cb15d11ea5f7dd54ec63e37e3f7f23843dd29767

data/CHANGELOG.md

@@ -1,3 +1,12 @@
+## 1.9.306.0 — 2026-10-05
+
+Rides libleptris v1.9.306 (pin 1.9.304 -> 1.9.306): the Lane 18
+mutation-path cycle — the adoption gate's mut-block fast bail
+(#1531), cross-document splice adoption (#1528), and the Lane 18
+gate bench made honest (warm both sides of the append row;
+create/append split, leptris/leptris#1533). No binding-surface
+change; the spec suite runs against the 1.9.306 engine.
+
 ## [1.9.304.0] - 2026-10-05
 
 ### Fixed

data/Rakefile

@@ -8,7 +8,7 @@ RSpec::Core::RakeTask.new(:spec)
 # Pin for `rake compile` and the platform-gem builds. Keep in lockstep
 # with .github/workflows/build.yml (which calls `rake compile`) and the
 # CHANGELOG when libleptris releases.
-LIBLEPTRIS_VERSION = "1.9.304"
+LIBLEPTRIS_VERSION = "1.9.306"
 # Vendored alongside libleptris for fn:normalize-unicode (TODO
 # .restructure/20): built per platform with a RELOCATABLE @rpath
 # install name, loaded by ffi.rb before libleptris so the

data/lib/leptris/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Leptris
-  VERSION = "1.9.304.0"
+  VERSION = "1.9.306.0"
 end

data/vendor-src/README.md

@@ -1,7 +1,7 @@
 Sources vendored in this gem (recompile rights; the ruby
 variant builds them at install via extconf.rb):
 
-- libleptris v1.9.304
+- libleptris v1.9.306
 - utf8proc v2.11.0
 
 Rebuild by hand:

data/vendor-src/libleptris/CHANGELOG.md

@@ -1,5 +1,38 @@
 ## [Unreleased]
 
+## [1.9.306] - 2026-10-05
+
+<!-- Edit this section with the actual release notes. -->
+<!-- See https://keepachangelog.com for format guidance. -->
+
+### Changed
+
+- (describe changes here)
+
+
+## [1.9.305] - 2026-10-05
+
+### Performance
+
+- **DOM: the #1528 adoption gate no longer taxes the append hot
+  path** — the first cut called `get_document` per splice, whose
+  namebp fast-out resolves the name slot before the check: append
+  measured 21.5 → 30.3 ns/child (+40%, 1.5x pugixml) and the
+  document build/free cycle +51% on the Lane 18 bench. `append_child`
+  now proves same-document in two hot loads — a child inside the
+  document's CURRENT mut-block extent was carved from this
+  document's own malloc by the create call just executed, so
+  nothing foreign can alias into it. Rolled-over-block children and
+  every other shape take the full adoption check; `prepend`/
+  `insert` keep it unconditionally. Measured paired-interleaved on
+  fresh Release trees: append 21.5 → 22.4 ns/child median (+0.8 ns,
+  +4%, the floor for a sound O(1) check), mutcycle +0.4 ns,
+  attr-parse within run noise. `CrossDocumentAdoption` stays green
+  on normal and ASAN builds; the binding fast paths all forward to
+  these public seams, so every route is covered.
+
+
+
 ## [1.9.304] - 2026-10-05
 
 ### Fixed

data/vendor-src/libleptris/CMakeLists.txt

@@ -3,7 +3,7 @@
 cmake_minimum_required(VERSION 3.20)
 
 project(leptris
-    VERSION 1.9.304
+    VERSION 1.9.306
     DESCRIPTION "Fast XML parser and XPath evaluator in pure C"
     LANGUAGES C CXX
 )

data/vendor-src/libleptris/benchmarks/CMakeLists.txt

@@ -210,6 +210,8 @@ endif()
 # ----------------------------------------------------------------------------
 leptris_add_benchmark(bench_serialize        serialization/bench_leptris_serialize.c)
 leptris_add_benchmark(bench_modify_leptris    modification/bench_leptris_modify.c)
+# Lane 18 (#1179 tail): the create/append split behind the gate row.
+leptris_add_benchmark(bench_append_split      modification/bench_append_split.cpp)
 
 # Lane 18 (#1179): append + attr-parse vs pugixml (the lane bar is
 # <=1x on both shapes). Needs C++ (pugixml.hpp) and the pugixml

data/vendor-src/libleptris/benchmarks/modification/bench_append_attr_pugixml.cpp

@@ -19,6 +19,22 @@ int main(void) {
     const int N_PARSE = 20000;
 
     /* ---- append: 200k element children on one root ---- */
+    {
+        /* Warmup pass, untimed: the leptris row runs first in this
+         * bench, and its first-touch page faults (mut blocks + name
+         * blocks, ~9 MB at 200k children) landed in the timed row
+         * while pugixml's row ran second on a warm allocator — a
+         * systematic order bias. Both sides get the same warmup
+         * treatment; the timed rows below are steady-state. */
+        LeptrisDocument d = leptris_document_create();
+        LeptrisElement root = leptris_element_create(d, "root");
+        leptris_document_set_root(d, root);
+        for (int i = 0; i < N_APPEND; i++) {
+            LeptrisElement c = leptris_element_create(d, "c");
+            leptris_element_append_child(root, c);
+        }
+        leptris_document_free(d);
+    }
     {
         double t0 = now_ns();
         LeptrisDocument d = leptris_document_create();
@@ -101,6 +117,26 @@ int main(void) {
         printf("attrparse leptris: %7.1f ns/doc (%zu bytes)\n",
                (t1 - t0) / N_PARSE, xml.size());
     }
+    {
+        /* Door A (leptris#1436, shipped v1.9.272): the opt-in fast
+         * path — duplicate detection and source positions off. The
+         * default row above carries full conformance work pugixml
+         * does none of; this row shows the speed callers can opt
+         * into when their pipeline guarantees uniqueness and skips
+         * position reporting. */
+        LeptrisParseFlags flags = static_cast<LeptrisParseFlags>(
+            LEPTRIS_PARSE_SKIP_DUP_DETECTION |
+            LEPTRIS_PARSE_SKIP_SOURCE_POSITIONS);
+        double t0 = now_ns();
+        for (int i = 0; i < N_PARSE; i++) {
+            LeptrisDocument d = leptris_parse_string_flags(
+                xml.data(), xml.size(), flags, NULL);
+            leptris_document_free(d);
+        }
+        double t1 = now_ns();
+        printf("attrparse leptris+flags: %7.1f ns/doc (Door A)\n",
+               (t1 - t0) / N_PARSE);
+    }
     {
         double t0 = now_ns();
         for (int i = 0; i < N_PARSE; i++) {

data/vendor-src/libleptris/benchmarks/modification/bench_append_split.cpp

@@ -0,0 +1,59 @@
+/* bench_append_split — Lane 18 (#1179 tail): where does the
+ * create+append ns/child go? Three rows over the same shape:
+ * create only, append only (children pre-created), and the
+ * create+append pair the gate bench measures. The split decides
+ * which half a lever belongs to. */
+#include "leptris.h"
+#include <chrono>
+#include <cstdio>
+
+static double now_ns() {
+    return (double)std::chrono::duration_cast<std::chrono::nanoseconds>(
+               std::chrono::steady_clock::now().time_since_epoch())
+        .count();
+}
+
+int main(void) {
+    const int N = 200000;
+
+    {
+        LeptrisDocument d = leptris_document_create();
+        LeptrisElement root = leptris_element_create(d, "root");
+        leptris_document_set_root(d, root);
+        double t0 = now_ns();
+        for (int i = 0; i < N; i++)
+            leptris_element_create(d, "c");
+        double t1 = now_ns();
+        printf("create only : %6.1f ns/elem\n", (t1 - t0) / N);
+        leptris_document_free(d);
+    }
+    {
+        LeptrisDocument d = leptris_document_create();
+        LeptrisElement root = leptris_element_create(d, "root");
+        leptris_document_set_root(d, root);
+        LeptrisElement* kids = new LeptrisElement[N];
+        for (int i = 0; i < N; i++)
+            kids[i] = leptris_element_create(d, "c");
+        double t0 = now_ns();
+        for (int i = 0; i < N; i++)
+            leptris_element_append_child(root, kids[i]);
+        double t1 = now_ns();
+        printf("append only : %6.1f ns/elem\n", (t1 - t0) / N);
+        delete[] kids;
+        leptris_document_free(d);
+    }
+    {
+        LeptrisDocument d = leptris_document_create();
+        LeptrisElement root = leptris_element_create(d, "root");
+        leptris_document_set_root(d, root);
+        double t0 = now_ns();
+        for (int i = 0; i < N; i++) {
+            LeptrisElement c = leptris_element_create(d, "c");
+            leptris_element_append_child(root, c);
+        }
+        double t1 = now_ns();
+        printf("create+app  : %6.1f ns/elem\n", (t1 - t0) / N);
+        leptris_document_free(d);
+    }
+    return 0;
+}

data/vendor-src/libleptris/src/leptris/dom/element_modify.c

@@ -273,6 +273,17 @@ LeptrisElement leptris_element_create_child(LeptrisElement parent, const char* n
     return elem;
 }
 
+/* #1528 hot bail: the child was carved from THIS document's
+ * current mut block — the live extent [end - BLOCK_COUNT, cursor)
+ * is this doc's own malloc, so nothing foreign can alias into it.
+ * Two loads off the doc struct the create call just touched. */
+static int node_in_current_mut_block(struct leptris_document* doc,
+                                     LeptrisElement child) {
+    return doc && doc->mut_elem_cursor &&
+           child >= doc->mut_elem_end - MUT_ELEM_BLOCK_COUNT &&
+           child < doc->mut_elem_cursor;
+}
+
 /* #1528: a node arriving from a DIFFERENT document is adopted by
  * deep copy (the set_root precedent, #371). Splicing the raw
  * pointer leaves the tree holding nodes — and text content — from
@@ -285,7 +296,17 @@ LeptrisElement leptris_element_create_child(LeptrisElement parent, const char* n
 static LeptrisNode* adopt_for_splice(LeptrisNode* node,
                                      struct leptris_document* target) {
     if (!node || !target) return node;
-    /* Type-safe walk to the chain top: get_document reads
+    /* Hot bail (Lane 18 bar): an UNATTACHED namebp element is
+     * authoritatively stamped with its create-time document
+     * (#1189) — the freshly-created-then-appended shape. Two loads
+     * and a pointer compare, no name-slot resolution (get_document
+     * computes elem_name before its fast-out, which cost the
+     * append bench +40%). */
+    if (node->type == LEPTRIS_NODE_TYPE_ELEMENT &&
+        !leptris_elem_parent((LeptrisElement)node) &&
+        leptris_elem_has_namebp((LeptrisElement)node) &&
+        leptris_elem_namebp_doc((LeptrisElement)node) == target)
+        return node;    /* Type-safe walk to the chain top: get_document reads
      * element-form fields and misreads non-element structs. */
     LeptrisNode* top = node;
     for (;;) {
@@ -311,9 +332,17 @@ LeptrisStatus leptris_element_append_child(LeptrisElement parent, LeptrisElement
     struct leptris_document* doc = leptris_element_get_document(parent);
 
     /* #1528: a foreign document's node is adopted by copy, never
-     * spliced raw. */
-    child = (LeptrisElement)adopt_for_splice((LeptrisNode*)child, doc);
-    if (!child) return LEPTRIS_ERROR_MEMORY;
+     * spliced raw. The freshly-created-then-appended shape proves
+     * same-doc in two hot loads: a child inside the CURRENT mut
+     * block extent [end - BLOCK_COUNT, cursor) was carved from
+     * THIS document's block by the create call just executed — no
+     * foreign allocation can live inside it. Everything else takes
+     * the full check (Lane 18 append bar). */
+    if (!(node_in_current_mut_block(doc, child))) {
+        child = (LeptrisElement)adopt_for_splice((LeptrisNode*)child,
+                                                 doc);
+        if (!child) return LEPTRIS_ERROR_MEMORY;
+    }
 
     /* Call internal void function, assume success */
     leptris_element_append_child_internal_doc(parent, (LeptrisNode*)child, doc);

data/vendor-src/libleptris/vcpkg.json

@@ -1,7 +1,7 @@
 {
   "$schema": "https://raw.githubusercontent.com/microsoft/vcpkg/master/scripts/vcpkg.schema.json",
   "name": "leptris",
-  "version": "1.9.304",
+  "version": "1.9.306",
   "description": "High-performance XML parser and XPath 1.0 engine in C (libleptris)",
   "homepage": "https://github.com/leptris/leptris",
   "license": "MIT",

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: leptris
 version: !ruby/object:Gem::Version
-  version: 1.9.304.0
+  version: 1.9.306.0
 platform: ppc64le-linux
 authors:
 - Ribose Inc.
@@ -425,6 +425,7 @@ files:
 - vendor-src/libleptris/benchmarks/matrix/bench2html.rb
 - vendor-src/libleptris/benchmarks/matrix/bench_matrix.cpp
 - vendor-src/libleptris/benchmarks/modification/bench_append_attr_pugixml.cpp
+- vendor-src/libleptris/benchmarks/modification/bench_append_split.cpp
 - vendor-src/libleptris/benchmarks/modification/bench_leptris_modify.c
 - vendor-src/libleptris/benchmarks/modification/bench_node_creation.c
 - vendor-src/libleptris/benchmarks/parse/bench_parse_ab.cpp