leptris 1.9.366.1-aarch64-linux → 1.9.366.2-aarch64-linux

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: d847172247048f7d9acb3898a3a63e61bd4744632e7b5213ca7c13694fee85e9
-  data.tar.gz: 48c6b128d630e278ca1a747509b9403bb8c335fbf91a01764869c0298fb1c719
+  metadata.gz: d2beb0d74159e7544c95208f0c8dc275285f81eea018ff8b919fccca7cf07676
+  data.tar.gz: 495665533e501bc90cb1ebe0327f40c3de43e6f40b0c33c0093e978e8d300eb4
 SHA512:
-  metadata.gz: 3f0ace5e75d874349929f02f71f3dc685d34e4a42966c024112e7480a031a5cb77b93ab6dca92616ae78bc4dbf9c02a8dab9ce1def4321230867be0ecd631f1c
-  data.tar.gz: f372629ba2782ee782c405bddb40766bef226eab32cb2f763ffd681b0f31766d21a32e61e5dc1db28759096a3942baae380d7ab923013e954a2e3e8c2ead336b
+  metadata.gz: fd7f95412d8c80bfe1423b5fe29948c8dfd9991f7294eb14ebc5dc3bcdae08919ff02be836ab0345d0543e36b0c4a7d00c949654b073f70c373eda643c69fee2
+  data.tar.gz: fab1e86554a44009b390ede1de80865b5fd945f159fd864d3dcbe901501d9087bb3dc67ee5e5c51e10989bc5c7b56e745c5d04e0958512013b0348448e1ca201

data/lib/leptris/version.rb

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

data/lib/leptris/xml/descriptor.rb

@@ -126,7 +126,7 @@ class Leptris::XML::Descriptor
         "descriptor ABI v#{abi} != binding v#{Leptris::XML::FFI::PLAN_ABI_VERSION}"
     end
     plans = []
-    root_index = flatten_plan(tree, plans)
+    root_index = flatten_plan(tree, plans, {})
     spec, plans_pointer, anchors = pack_plans(plans)
     spec[:abi_version] = abi
     spec[:plan_count] = plans.size
@@ -143,13 +143,32 @@ class Leptris::XML::Descriptor
   # Flattens the nested hash tree into the engine's flat plans
   # array (child rows reference plans by index). Returns the root
   # plan's index — always 0 for a single root.
-  def self.flatten_plan(tree, plans)
-    tree = tree.dup
-    plans << tree
+  #
+  # Identity-memoized (leptris#1743): lutaml-model's PlanCompiler
+  # (0.8.107+) feeds recursive content models as a DAG — the SAME
+  # plan Hash reachable from many parents. Without the memo each
+  # shared subtree re-flattened once per path (2^depth visits: the
+  # STS runaway — 28+ CPU-min, 14 GB RSS) and the duplicated index
+  # graph even mis-walked. Memoize on the ARGUMENT's identity
+  # (object_id, read before the dup) so each unique plan object is
+  # flattened once and shared rows reference one index.
+  def self.flatten_plan(tree, plans, memo = {})
+    key = tree.object_id
+    hit = memo[key]
+    return hit if hit
+
+    raise Leptris::XML::Error,
+          "plan tree contains a cycle at #{tree[:name].inspect} — "           "the plan graph must be a DAG" if hit == false
+
+    memo[key] = false # in-progress; a finished entry is an Integer index
+    duped = tree.dup
+    plans << duped
     tree_index = plans.size - 1
-    tree[:children] = (tree[:children] || []).map do |row|
+    memo[key] = tree_index
+    duped[:children] = (duped[:children] || []).map do |row|
       if row[:kind] == :nested
-        row.merge(child_plan_index: flatten_plan(row.fetch(:plan), plans))
+        row.merge(child_plan_index: flatten_plan(row.fetch(:plan), plans,
+                                                 memo))
       else
         row
       end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: leptris
 version: !ruby/object:Gem::Version
-  version: 1.9.366.1
+  version: 1.9.366.2
 platform: aarch64-linux
 authors:
 - Ribose Inc.