@prisma/param-graph-builder 7.4.0-integration-parameterization.19 → 7.4.0-integration-parameterization.20

package/dist/dmmf-traverser.d.ts

@@ -23,10 +23,14 @@ export declare class DMMFTraverser {
     buildInputNodeFromArgs(args: readonly DMMF.SchemaArg[]): NodeId | undefined;
     /**
      * Builds an input node for a named input type.
+     * Node allocation happens immediately, but field processing is deferred
+     * to avoid deep recursion.
      */
     buildInputTypeNode(typeName: string): NodeId | undefined;
     /**
      * Builds a union node for multiple input types.
+     * Node allocation happens immediately, but field processing is deferred
+     * to avoid deep recursion.
      */
     buildUnionNode(typeNames: string[]): NodeId | undefined;
     /**

package/dist/dmmf-traverser.js

@@ -27,6 +27,8 @@ class DMMFTraverser {
   #builder;
   #inputTypeMap;
   #outputTypeMap;
+  #pendingInputNodes = [];
+  #pendingUnionNodes = [];
   constructor(builder, dmmf) {
     this.#builder = builder;
     this.#inputTypeMap = /* @__PURE__ */ new Map();
@@ -77,6 +79,23 @@ class DMMFTraverser {
         });
       }
     }
+    this.#drainPendingWork();
+  }
+  /**
+   * Iteratively processes all pending input and union nodes.
+   * This avoids deep recursion that can cause stack overflow on complex schemas.
+   */
+  #drainPendingWork() {
+    while (this.#pendingInputNodes.length > 0 || this.#pendingUnionNodes.length > 0) {
+      while (this.#pendingInputNodes.length > 0) {
+        const pending = this.#pendingInputNodes.pop();
+        this.#processInputNodeFields(pending.nodeId, pending.fields);
+      }
+      while (this.#pendingUnionNodes.length > 0) {
+        const pending = this.#pendingUnionNodes.pop();
+        this.#processUnionNodeFields(pending.nodeId, pending.typeNames);
+      }
+    }
   }
   #findRootField(fieldName) {
     const queryType = this.#outputTypeMap.get("prisma.Query");
@@ -114,6 +133,8 @@ class DMMFTraverser {
   }
   /**
    * Builds an input node for a named input type.
+   * Node allocation happens immediately, but field processing is deferred
+   * to avoid deep recursion.
    */
   buildInputTypeNode(typeName) {
     if (this.#builder.hasInputTypeNode(typeName)) {
@@ -126,9 +147,16 @@ class DMMFTraverser {
     }
     const nodeId = this.#builder.allocateInputNode();
     this.#builder.setInputTypeNode(typeName, nodeId);
+    this.#pendingInputNodes.push({ nodeId, fields: inputType.fields });
+    return nodeId;
+  }
+  /**
+   * Process fields for an input node (called from drainPendingWork).
+   */
+  #processInputNodeFields(nodeId, fields) {
     const edges = {};
     let hasAnyEdge = false;
-    for (const field of inputType.fields) {
+    for (const field of fields) {
       const edge = this.#mergeFieldVariants([field]);
       if (edge) {
         const stringIndex = this.#builder.internString(field.name);
@@ -139,10 +167,11 @@ class DMMFTraverser {
     if (hasAnyEdge) {
       this.#builder.setInputNodeEdges(nodeId, edges);
     }
-    return nodeId;
   }
   /**
    * Builds a union node for multiple input types.
+   * Node allocation happens immediately, but field processing is deferred
+   * to avoid deep recursion.
    */
   buildUnionNode(typeNames) {
     const sortedNames = [...typeNames].sort();
@@ -152,6 +181,13 @@ class DMMFTraverser {
     }
     const nodeId = this.#builder.allocateInputNode();
     this.#builder.setUnionNode(cacheKey, nodeId);
+    this.#pendingUnionNodes.push({ nodeId, typeNames });
+    return nodeId;
+  }
+  /**
+   * Process fields for a union node (called from drainPendingWork).
+   */
+  #processUnionNodeFields(nodeId, typeNames) {
     const fieldsByName = /* @__PURE__ */ new Map();
     for (const typeName of typeNames) {
       const inputType = this.#inputTypeMap.get(typeName);
@@ -178,7 +214,6 @@ class DMMFTraverser {
     if (hasAnyEdge) {
       this.#builder.setInputNodeEdges(nodeId, mergedEdges);
     }
-    return nodeId;
   }
   /**
    * Merges field variants to produce a single edge descriptor.

package/dist/dmmf-traverser.mjs

@@ -4,6 +4,8 @@ class DMMFTraverser {
   #builder;
   #inputTypeMap;
   #outputTypeMap;
+  #pendingInputNodes = [];
+  #pendingUnionNodes = [];
   constructor(builder, dmmf) {
     this.#builder = builder;
     this.#inputTypeMap = /* @__PURE__ */ new Map();
@@ -54,6 +56,23 @@ class DMMFTraverser {
         });
       }
     }
+    this.#drainPendingWork();
+  }
+  /**
+   * Iteratively processes all pending input and union nodes.
+   * This avoids deep recursion that can cause stack overflow on complex schemas.
+   */
+  #drainPendingWork() {
+    while (this.#pendingInputNodes.length > 0 || this.#pendingUnionNodes.length > 0) {
+      while (this.#pendingInputNodes.length > 0) {
+        const pending = this.#pendingInputNodes.pop();
+        this.#processInputNodeFields(pending.nodeId, pending.fields);
+      }
+      while (this.#pendingUnionNodes.length > 0) {
+        const pending = this.#pendingUnionNodes.pop();
+        this.#processUnionNodeFields(pending.nodeId, pending.typeNames);
+      }
+    }
   }
   #findRootField(fieldName) {
     const queryType = this.#outputTypeMap.get("prisma.Query");
@@ -91,6 +110,8 @@ class DMMFTraverser {
   }
   /**
    * Builds an input node for a named input type.
+   * Node allocation happens immediately, but field processing is deferred
+   * to avoid deep recursion.
    */
   buildInputTypeNode(typeName) {
     if (this.#builder.hasInputTypeNode(typeName)) {
@@ -103,9 +124,16 @@ class DMMFTraverser {
     }
     const nodeId = this.#builder.allocateInputNode();
     this.#builder.setInputTypeNode(typeName, nodeId);
+    this.#pendingInputNodes.push({ nodeId, fields: inputType.fields });
+    return nodeId;
+  }
+  /**
+   * Process fields for an input node (called from drainPendingWork).
+   */
+  #processInputNodeFields(nodeId, fields) {
     const edges = {};
     let hasAnyEdge = false;
-    for (const field of inputType.fields) {
+    for (const field of fields) {
       const edge = this.#mergeFieldVariants([field]);
       if (edge) {
         const stringIndex = this.#builder.internString(field.name);
@@ -116,10 +144,11 @@ class DMMFTraverser {
     if (hasAnyEdge) {
       this.#builder.setInputNodeEdges(nodeId, edges);
     }
-    return nodeId;
   }
   /**
    * Builds a union node for multiple input types.
+   * Node allocation happens immediately, but field processing is deferred
+   * to avoid deep recursion.
    */
   buildUnionNode(typeNames) {
     const sortedNames = [...typeNames].sort();
@@ -129,6 +158,13 @@ class DMMFTraverser {
     }
     const nodeId = this.#builder.allocateInputNode();
     this.#builder.setUnionNode(cacheKey, nodeId);
+    this.#pendingUnionNodes.push({ nodeId, typeNames });
+    return nodeId;
+  }
+  /**
+   * Process fields for a union node (called from drainPendingWork).
+   */
+  #processUnionNodeFields(nodeId, typeNames) {
     const fieldsByName = /* @__PURE__ */ new Map();
     for (const typeName of typeNames) {
       const inputType = this.#inputTypeMap.get(typeName);
@@ -155,7 +191,6 @@ class DMMFTraverser {
     if (hasAnyEdge) {
       this.#builder.setInputNodeEdges(nodeId, mergedEdges);
     }
-    return nodeId;
   }
   /**
    * Merges field variants to produce a single edge descriptor.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@prisma/param-graph-builder",
-  "version": "7.4.0-integration-parameterization.19",
+  "version": "7.4.0-integration-parameterization.20",
   "description": "This package is intended for Prisma's internal use",
   "main": "dist/index.js",
   "module": "dist/index.mjs",
@@ -24,8 +24,8 @@
   },
   "license": "Apache-2.0",
   "dependencies": {
-    "@prisma/dmmf": "7.4.0-integration-parameterization.19",
-    "@prisma/param-graph": "7.4.0-integration-parameterization.19"
+    "@prisma/dmmf": "7.4.0-integration-parameterization.20",
+    "@prisma/param-graph": "7.4.0-integration-parameterization.20"
   },
   "files": [
     "dist"