leptris 1.9.413.0-aarch64-linux → 1.9.414.0-aarch64-linux

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: e60857aa5e368bfc42a65dc3674052fe7e339c997f0b7bc09ce6b42df569a2c2
4
- data.tar.gz: 9b76e1513c3d6a05f04d90f913daf1d31eb38af8949db26f956d54514be02c62
3
+ metadata.gz: 3c7b8ebdea1ff210305a8a97b15ac279bc307b7c1ed68fe651e90fa1b9fbb5b0
4
+ data.tar.gz: f476ab25fcb358578327caead84dc673d262c4beafb39f9178478fe86976e266
5
5
  SHA512:
6
- metadata.gz: df70ad3f5ed4d100d7723f3ce61fccfed9272cea0e3f5d4cf9e58f84411961d3a2d28813ccc818aff33fb833cced81edc50da53bf04ff63d9a9e46d0253c2ed8
7
- data.tar.gz: b2e3db8c95fbe295ed7a04dd3ad6d2b92b77f8cbe2565a2df9c6ef6223cc3d477a2017fe658779462dc3199fe54ad85ffdaf99e31feccb2b17dcaa61bb73495a
6
+ metadata.gz: 5f3e20b48eb25996b3aa6b4d52cb16cf420e407214b88299b70a6be7abefd522ac5ec2ac8ae068949391b65d40d9de8b8c2694a53c0b56e3cf73d82e0f15bd2a
7
+ data.tar.gz: fd3faa51db9459b45186a3974f74b1484f05b04ad653f89e6da149ff75b7f9648a45a4cf48682f97a69db1ddb98b54d5432c104fe62322a31912c1e6e7c2c6fc
data/Rakefile CHANGED
@@ -8,7 +8,7 @@ RSpec::Core::RakeTask.new(:spec)
8
8
  # Pin for `rake compile` and the platform-gem builds. Keep in lockstep
9
9
  # with .github/workflows/build.yml (which calls `rake compile`) and the
10
10
  # CHANGELOG when libleptris releases.
11
- LIBLEPTRIS_VERSION = "1.9.413"
11
+ LIBLEPTRIS_VERSION = "1.9.414"
12
12
  # Vendored alongside libleptris for fn:normalize-unicode (TODO
13
13
  # .restructure/20): built per platform with a RELOCATABLE @rpath
14
14
  # install name, loaded by ffi.rb before libleptris so the
@@ -1,5 +1,5 @@
1
1
  # frozen_string_literal: true
2
2
 
3
3
  module Leptris
4
- VERSION = "1.9.413.0"
4
+ VERSION = "1.9.414.0"
5
5
  end
data/lib/libleptris.so CHANGED
Binary file
data/vendor-src/README.md CHANGED
@@ -1,7 +1,7 @@
1
1
  Sources vendored in this gem (recompile rights; the ruby
2
2
  variant builds them at install via extconf.rb):
3
3
 
4
- - libleptris v1.9.413
4
+ - libleptris v1.9.414
5
5
  - utf8proc v2.11.0
6
6
 
7
7
  Rebuild by hand:
@@ -1,5 +1,14 @@
1
1
  ## [Unreleased]
2
2
 
3
+ ## [1.9.414] - 2026-11-08
4
+ ## Performance
5
+
6
+ - **parse: the pool string_cache is lazy** (#1842 A4). direct_parse created a 128-bucket hash table eagerly for every >=256-byte document, but the scanner stores borrowed views and most documents never intern anything through that path — the eager create cost ~70 ns/doc (5.6% of the parse on the attribute-dense attrparse shape, line-level profiled). The intern path now creates the table on first use; the OOM path falls back to direct allocation exactly as before. Users-doc parse +2%, attribute-dense shape +1%, one 128-bucket pool block saved per document.
7
+
8
+ ## Benchmarks
9
+
10
+ - **The attrparse comparison rows are honest now.** They measured parse-WITHOUT-tree-access: pugixml's `load_buffer` parses eagerly while leptris defers until first tree access, so the old rows compared handle-setup against parsing (apples to oranges) under loaded-machine wall timing. The rows now measure parse + walk + read every attribute name and value on BOTH engines with a min-of-5-reps statistic — on this machine leptris ~1600 ns/doc vs pugixml ~1420, and the CPU-clock head-to-head with the tree walk shows parity (the previously reported 2.0x deficit was the methodology artifact; full post-mortem on #1842).
11
+
3
12
  ## [1.9.413] - 2026-11-08
4
13
  ## Performance
5
14
 
@@ -3,7 +3,7 @@
3
3
  cmake_minimum_required(VERSION 3.20)
4
4
 
5
5
  project(leptris
6
- VERSION 1.9.413
6
+ VERSION 1.9.414
7
7
  DESCRIPTION "Fast XML parser and XPath evaluator in pure C"
8
8
  LANGUAGES C CXX
9
9
  )
@@ -15,6 +15,8 @@ static double now_ns() {
15
15
  }
16
16
 
17
17
  int main(void) {
18
+ volatile size_t sink = 0;
19
+ (void)sink;
18
20
  const int N_APPEND = 200000;
19
21
  const int N_PARSE = 20000;
20
22
 
@@ -106,46 +108,104 @@ int main(void) {
106
108
  xml += "/>";
107
109
  }
108
110
  xml += "</r>";
111
+ /* #1842 attr-parse methodology (corrected 2026-11-09): the old
112
+ * rows measured parse-without-access — apples to oranges, since
113
+ * pugixml's load_buffer parses EAGERLY while leptris defers
114
+ * until first tree access (the no-access loop completed at
115
+ * handle-setup cost and the row compared setup vs parse). The
116
+ * honest workload: parse + walk + read every attribute name and
117
+ * value on BOTH engines. Statistic: MIN of 5 repetitions — the
118
+ * standard noise-robust estimator for microbenchmarks (max
119
+ * responsiveness, min scheduler noise). */
109
120
  {
110
- double t0 = now_ns();
111
- for (int i = 0; i < N_PARSE; i++) {
112
- LeptrisDocument d =
113
- leptris_parse_string(xml.data(), xml.size(), NULL);
114
- leptris_document_free(d);
115
- }
116
- double t1 = now_ns();
117
- printf("attrparse leptris: %7.1f ns/doc (%zu bytes)\n",
118
- (t1 - t0) / N_PARSE, xml.size());
119
- }
120
- {
121
- /* Door A (leptris#1436, shipped v1.9.272): the opt-in fast
122
- * path — duplicate detection and source positions off. The
123
- * default row above carries full conformance work pugixml
124
- * does none of; this row shows the speed callers can opt
125
- * into when their pipeline guarantees uniqueness and skips
126
- * position reporting. */
127
- LeptrisParseFlags flags = static_cast<LeptrisParseFlags>(
128
- LEPTRIS_PARSE_SKIP_DUP_DETECTION |
129
- LEPTRIS_PARSE_SKIP_SOURCE_POSITIONS);
130
- double t0 = now_ns();
131
- for (int i = 0; i < N_PARSE; i++) {
132
- LeptrisDocument d = leptris_parse_string_flags(
133
- xml.data(), xml.size(), flags, NULL);
134
- leptris_document_free(d);
135
- }
136
- double t1 = now_ns();
137
- printf("attrparse leptris+flags: %7.1f ns/doc (Door A)\n",
138
- (t1 - t0) / N_PARSE);
139
- }
140
- {
141
- double t0 = now_ns();
142
- for (int i = 0; i < N_PARSE; i++) {
143
- pugi::xml_document d;
144
- d.load_buffer((void*)xml.data(), xml.size());
121
+ const int REPS = 5;
122
+ double best_lx = 1e18, best_lx_a = 1e18, best_pugi = 1e18;
123
+ for (int rep = 0; rep < REPS; rep++) {
124
+ {
125
+ double t0 = now_ns();
126
+ for (int i = 0; i < N_PARSE; i++) {
127
+ LeptrisDocument d = leptris_parse_string(
128
+ xml.data(), xml.size(), NULL);
129
+ if (!d) return 4;
130
+ LeptrisElement r = leptris_document_root(d);
131
+ if (!r) return 5;
132
+ for (LeptrisElement c =
133
+ leptris_element_first_child_any(r);
134
+ c;
135
+ c = leptris_element_next_sibling_any(c)) {
136
+ const char* names[32]; const char* vals[32];
137
+ size_t na = leptris_element_attributes_raw(
138
+ c, names, vals, 32);
139
+ for (size_t k = 0; k < na; k++) {
140
+ sink += strlen(names[k]);
141
+ sink += strlen(vals[k]);
142
+ }
143
+ }
144
+ leptris_document_free(d);
145
+ }
146
+ double t1 = now_ns();
147
+ double ns = (t1 - t0) / N_PARSE;
148
+ if (ns < best_lx) best_lx = ns;
149
+ }
150
+ {
151
+ /* Door A (leptris#1436, shipped v1.9.272): the opt-in
152
+ * fast path — duplicate detection and source positions
153
+ * off. Full conformance work pugixml does none of. */
154
+ LeptrisParseFlags flags = static_cast<LeptrisParseFlags>(
155
+ LEPTRIS_PARSE_SKIP_DUP_DETECTION |
156
+ LEPTRIS_PARSE_SKIP_SOURCE_POSITIONS);
157
+ double t0 = now_ns();
158
+ for (int i = 0; i < N_PARSE; i++) {
159
+ LeptrisDocument d = leptris_parse_string_flags(
160
+ xml.data(), xml.size(), flags, NULL);
161
+ if (!d) return 6;
162
+ LeptrisElement r = leptris_document_root(d);
163
+ if (!r) return 7;
164
+ for (LeptrisElement c =
165
+ leptris_element_first_child_any(r);
166
+ c;
167
+ c = leptris_element_next_sibling_any(c)) {
168
+ const char* names[32]; const char* vals[32];
169
+ size_t na = leptris_element_attributes_raw(
170
+ c, names, vals, 32);
171
+ for (size_t k = 0; k < na; k++) {
172
+ sink += strlen(names[k]);
173
+ sink += strlen(vals[k]);
174
+ }
175
+ }
176
+ leptris_document_free(d);
177
+ }
178
+ double t1 = now_ns();
179
+ double ns = (t1 - t0) / N_PARSE;
180
+ if (ns < best_lx_a) best_lx_a = ns;
181
+ }
182
+ {
183
+ double t0 = now_ns();
184
+ for (int i = 0; i < N_PARSE; i++) {
185
+ pugi::xml_document d;
186
+ pugi::xml_parse_result res =
187
+ d.load_buffer((void*)xml.data(), xml.size());
188
+ if (!res) return 8;
189
+ for (pugi::xml_node c = d.first_child().first_child();
190
+ c; c = c.next_sibling()) {
191
+ for (pugi::xml_attribute a = c.first_attribute();
192
+ a; a = a.next_attribute()) {
193
+ sink += strlen(a.name());
194
+ sink += strlen(a.value());
195
+ }
196
+ }
197
+ }
198
+ double t1 = now_ns();
199
+ double ns = (t1 - t0) / N_PARSE;
200
+ if (ns < best_pugi) best_pugi = ns;
201
+ }
145
202
  }
146
- double t1 = now_ns();
147
- printf("attrparse pugixml: %7.1f ns/doc\n",
148
- (t1 - t0) / N_PARSE);
203
+ printf("attrparse leptris: %7.1f ns/doc (%zu bytes, min of %d)\n",
204
+ best_lx, xml.size(), REPS);
205
+ printf("attrparse leptris+flags: %7.1f ns/doc (Door A, min of %d)\n",
206
+ best_lx_a, REPS);
207
+ printf("attrparse pugixml: %7.1f ns/doc (min of %d)\n",
208
+ best_pugi, REPS);
149
209
  }
150
210
  return 0;
151
211
  }
@@ -1568,10 +1568,6 @@ static struct leptris_document* direct_parse_internal(char* buf, size_t len,
1568
1568
  leptris_arena_destroy(arena);
1569
1569
  return NULL;
1570
1570
  }
1571
- if (len >= 256) {
1572
- pool->string_cache = leptris_hash_table_create(pool, 128);
1573
- }
1574
-
1575
1571
  /* Round 8 carve: scratch first, then the pristine copy for
1576
1572
  * const inputs — the first pool bumps, so the scanner's buffers
1577
1573
  * sit at the front of the document-owned span. doc_free skips
@@ -780,13 +780,23 @@ char* leptris_pool_intern_string(LeptrisMemoryPool* pool, const LeptrisStringVie
780
780
  return NULL;
781
781
  }
782
782
 
783
- /* If no hash table, fall back to direct allocation (no deduplication) */
783
+ /* The table is created LAZILY on the first intern (#1842 A4):
784
+ * direct_parse created a 128-bucket table eagerly for every
785
+ * >=256-byte document, but the scanner stores borrowed views and
786
+ * most documents never intern anything through this path — the
787
+ * eager create cost ~70 ns/doc on the attrparse shape (5.6% of
788
+ * the parse, line-level profiled). Callers that intern pay the
789
+ * create once, on first use. */
784
790
  if (!pool->string_cache) {
785
- char* str = (char*)leptris_pool_alloc(pool, sv->length + 1);
786
- if (!str) return NULL;
787
- memcpy(str, sv->data, sv->length);
788
- str[sv->length] = '\0';
789
- return str;
791
+ pool->string_cache = leptris_hash_table_create(pool, 128);
792
+ if (!pool->string_cache) {
793
+ /* cold-path OOM: fall back to direct allocation */
794
+ char* str = (char*)leptris_pool_alloc(pool, sv->length + 1);
795
+ if (!str) return NULL;
796
+ memcpy(str, sv->data, sv->length);
797
+ str[sv->length] = '\0';
798
+ return str;
799
+ }
790
800
  }
791
801
 
792
802
  StringHashTable* table = pool->string_cache;
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "$schema": "https://raw.githubusercontent.com/microsoft/vcpkg/master/scripts/vcpkg.schema.json",
3
3
  "name": "leptris",
4
- "version": "1.9.413",
4
+ "version": "1.9.414",
5
5
  "description": "High-performance XML parser and XPath 1.0 engine in C (libleptris)",
6
6
  "homepage": "https://github.com/leptris/leptris",
7
7
  "license": "MIT",
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: leptris
3
3
  version: !ruby/object:Gem::Version
4
- version: 1.9.413.0
4
+ version: 1.9.414.0
5
5
  platform: aarch64-linux
6
6
  authors:
7
7
  - Ribose Inc.