@mosaic-code/prisma-deadlock-avoidance-tests 0.1.0

package/LICENSE

@@ -0,0 +1,207 @@
+# Do No Harm License
+
+## 1. Preamble
+
+Most software today is developed with little to no thought of how it will be used, or the
+consequences for our society and planet.
+
+As software developers, we engineer the infrastructure of the 21st century. We recognise that our
+infrastructure has great power to shape the world and the lives of those we share it with, and we
+choose to consciously take responsibility for the social and environmental impacts of what we build.
+
+We envisage a world free from injustice, inequality, and the reckless destruction of lives and our
+planet. We reject slavery in all its forms, whether by force, indebtedness, or by algorithms that
+hack human vulnerabilities. We seek a world where humankind is at peace with our neighbours, nature,
+and ourselves. We want our work to enrich the physical, mental and spiritual wellbeing of all
+society.
+
+We build software to further this vision of a just world, or at the very least, to not put that
+vision further from reach.
+
+## 2. Definitions
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by
+Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is
+granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are
+controlled by, or are under common control with that entity. For the purposes of this definition,
+"control" means (i) the power, direct or indirect, to cause the direction or management of such
+entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the
+outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this
+License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to
+software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a
+Source form, including but not limited to compiled object code, generated documentation, and
+conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the
+License, as indicated by a copyright notice that is included in or attached to the work (an example
+is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or
+derived from) the Work and for which the editorial revisions, annotations, elaborations, or other
+modifications represent, as a whole, an original work of authorship. For the purposes of this
+License, Derivative Works shall not include works that remain separable from, or merely link (or
+bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any
+modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted
+to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity
+authorized to submit on behalf of the copyright owner. For the purposes of this definition,
+"submitted" means any form of electronic, verbal, or written communication sent to the Licensor or
+its representatives, including but not limited to communication on electronic mailing lists, source
+code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor
+for the purpose of discussing and improving the Work, but excluding communication that is
+conspicuously marked or otherwise designated in writing by the copyright owner as "Not a
+Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a
+Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+"Forests" shall mean 0.5 or more hectares of trees that were either planted more than 50 years ago
+or were not planted by humans or human made equipment.
+
+"Deforestation" shall mean the clearing, burning or destruction of 0.5 or more hectares of forests
+within a 1 year period.
+
+## 3. Grant of Copyright License
+
+Subject to the terms and conditions of this License, each Contributor hereby grants to You a
+perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to
+reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and
+distribute the Work and such Derivative Works in Source or Object form.
+
+## 4. Grant of Patent License
+
+Subject to the terms and conditions of this License, each Contributor hereby grants to You a
+perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this
+section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer
+the Work, where such license applies only to those patent claims licensable by such Contributor that
+are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s)
+with the Work to which such Contribution(s) was submitted. If You institute patent litigation
+against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or
+a Contribution incorporated within the Work constitutes direct or contributory patent infringement,
+then any patent licenses granted to You under this License for that Work shall terminate as of the
+date such litigation is filed.
+
+## 5. Redistribution
+
+You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with
+or without modifications, and in Source or Object form, provided that You meet the following
+conditions:
+
+1. You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+2. You must cause any modified files to carry prominent notices stating that You changed the
+   files; and
+
+3. You must retain, in the Source form of any Derivative Works that You distribute, all copyright,
+   patent, trademark, and attribution notices from the Source form of the Work, excluding those
+   notices that do not pertain to any part of the Derivative Works; and
+
+4. Neither the name of the copyright holder nor the names of its contributors may be used to endorse
+   or promote products derived from this software without specific prior written permission; and
+
+5. This software must not be used by any organisation, website, product, or service that:
+   1. promotes, lobbies for or derives a majority of income from:
+         1. **abuses of human rights**:
+            * human trafficking
+            * sex trafficking
+            * slavery or indentured servitude
+            * discrimination based on age, gender, gender identity, race, sexuality, religion, nationality
+            * hate speech
+         2. **environmental destruction**:
+            * the extraction or sale of fossil fuels
+            * the destruction of habitats for threatened or endangered species, including through deforestation or burning of forests
+            * the abuse, inhumane killing or neglect of animals under human control
+            * industrial processes that generate waste products that threaten life
+         3. **conflict and war**:
+            * warfare
+            * war crimes
+            * weapons manufacturing
+            * violence (except when required to protect public safety)
+         4. **addictive or destructive products and services**:
+            * gambling
+            * tobacco
+            * products that encourage adversely addictive behaviours
+
+   2. dissuades, lobbies against, or derives a majority of income from actions that discourage or frustrate:
+      * peace
+      * access to the rights set out in the Universal Declaration of Human Rights and the Convention on the Rights of the Child
+      * democratic processes
+      * peaceful assembly and association (including worker associations)
+      * a sustainable environment
+   ; and
+
+5. If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative
+   Works that You distribute must include a readable copy of the attribution notices contained
+   within such NOTICE file, excluding those notices that do not pertain to any part of the
+   Derivative Works, in at least one of the following places: within a NOTICE text file
+   distributed as part of the Derivative Works; within the Source form or documentation, if
+   provided along with the Derivative Works; or, within a display generated by the Derivative
+   Works, if and wherever such third-party notices normally appear. The contents of the NOTICE
+   file are for informational purposes only and do not modify the License. You may add Your own
+   attribution notices within Derivative Works that You distribute, alongside or as an addendum to
+   the NOTICE text from the Work, provided that such additional attribution notices cannot be
+   construed as modifying the License.
+
+You may add Your own copyright statement to Your modifications and may provide additional or
+different license terms and conditions for use, reproduction, or distribution of Your modifications,
+or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of
+the Work otherwise complies with the conditions stated in this License.
+
+## 6. Submission of Contributions
+
+Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the
+Work by You to the Licensor shall be under the terms and conditions of this License, without any
+additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify
+the terms of any separate license agreement you may have executed with Licensor regarding such
+Contributions.
+
+## 7. Trademarks
+
+This License does not grant permission to use the trade names, trademarks, service marks, or product
+names of the Licensor, except as required for reasonable and customary use in describing the origin
+of the Work and reproducing the content of the NOTICE file.
+
+## 8. Disclaimer of Warranty
+
+Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each
+Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+KIND, either express or implied, including, without limitation, any warranties or conditions of
+TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely
+responsible for determining the appropriateness of using or redistributing the Work and assume any
+risks associated with Your exercise of permissions under this License.
+
+## 9. Limitation of Liability
+
+In no event and under no legal theory, whether in tort (including negligence), contract, or
+otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or
+agreed to in writing, shall any Contributor be liable to You for damages, including any direct,
+indirect, special, incidental, or consequential damages of any character arising as a result of this
+License or out of the use or inability to use the Work (including but not limited to damages for
+loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial
+damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+## 10. Accepting Warranty or Additional Liability
+
+While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee
+for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights
+consistent with this License. However, in accepting such obligations, You may act only on Your own
+behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You
+agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or
+claims asserted against, such Contributor by reason of your accepting any such warranty or
+additional liability.
+
+## Attribution
+
+Do No Harm License [Contributor Covenant], (pre 1.0),
+available at https://github.com/raisely/NoHarm

package/README.md

@@ -0,0 +1,248 @@
+# @mosaic-code/prisma-deadlock-avoidance-tests
+
+A Prisma extension for detecting deadlock risks by tracking table and row locking order across transactions. Intended for use in test suites only.
+
+## Purpose
+
+Database deadlocks are a structural problem that occur when different code paths lock resources in conflicting orders. In a real application, deadlocks often emerge from the interaction between multiple unrelated parts of the codebase—each following its own locking pattern—that only reveal themselves when those paths execute concurrently under load.
+
+This library helps ensure your codebase applies deadlock-prevention best practices before these issues become production problems. It does this by building a holistic graph of every table and row lock ordering across your entire test suite. By accumulating data from all tests, it can detect when different parts of your application would lock resources in ways that could deadlock.
+
+**NOTE**: The library only works effectively when allowed to collect data continuously through your whole test suite. Configure it before your first test runs, check the risks its identified at the end of all tests.
+
+The library detects two types of deadlock risk:
+
+1. **Table ordering detection** - Identifies when different code paths lock tables in inconsistent orders
+2. **Row ordering detection** - Identifies when rows within a table are locked in inconsistent orders
+
+## Installation
+
+```bash
+npm install @mosaic-code/prisma-deadlock-avoidance-tests
+```
+
+## Quick Start
+
+```typescript
+import { PrismaClient } from '@prisma/client'
+import {
+  withDeadlockDetection,
+  assertNoDeadlockRisk,
+  resetDeadlockDetection,
+} from '@mosaic-code/prisma-deadlock-avoidance-tests'
+
+// Wrap your Prisma client - transactions are tracked automatically
+const prisma = withDeadlockDetection(new PrismaClient())
+
+// At the start of your test run, clear any previous data
+beforeAll(() => {
+  resetDeadlockDetection()
+})
+
+// Your transactions are tracked automatically
+await prisma.$transaction(async (tx) => {
+  await tx.user.update({ where: { id: 1 }, data: { name: 'Updated' } })
+  await tx.post.create({ data: { title: 'New Post', authorId: 1 } })
+})
+
+// At the end of your test suite, check for deadlock risks
+afterAll(() => {
+  assertNoDeadlockRisk()
+})
+```
+
+## API
+
+### Extension
+
+#### `withDeadlockDetection(client, config?)`
+
+Wraps a Prisma client with deadlock detection. All transactions are automatically tracked.
+
+```typescript
+const prisma = withDeadlockDetection(new PrismaClient())
+
+// Optional: disable tracking
+const prisma = withDeadlockDetection(new PrismaClient(), { enabled: false })
+```
+
+### Tracking Functions
+
+#### `trackForUpdate(model, fn)`
+
+Wrapper for integrating with [@mosaic-code/prisma-select-for-update](https://github.com/mosaic-code-coop/prisma-select-for-update). Use this to track SELECT FOR UPDATE operations.
+
+```typescript
+await prisma.$transaction(async (tx) => {
+  const user = await trackForUpdate('User', () =>
+    tx.user.findUniqueForUpdate({ where: { id: 1 } })
+  )
+  await tx.post.update({ where: { id: postId }, data: { ... } })
+})
+```
+
+### Assertion Functions
+
+#### `assertConsistentTableLocking()`
+
+Checks that tables have been locked in a consistent order across all tracked transactions. Throws `TableLockingAssertionError` if a cycle is detected.
+
+```typescript
+assertConsistentTableLocking()
+// Throws if Transaction A locks User->Post but Transaction B locks Post->User
+```
+
+#### `assertConsistentRowLocking(options?)`
+
+Checks that rows within tables have been locked in a consistent order. Throws `RowLockingAssertionError` if violations are detected.
+
+Options:
+- `tables?: string[]` - Specific tables to check (defaults to all)
+- `strict?: StrictMode` - Ordering strictness
+
+StrictMode values:
+- `false` (default) - Only cycles are violations
+- `true` - Must be consistently ascending OR descending
+- `'ASC'` - Must always be ascending order
+- `'DESC'` - Must always be descending order
+
+```typescript
+// Only check for cycles
+assertConsistentRowLocking({ strict: false })
+
+// Require consistent ordering direction
+assertConsistentRowLocking({ strict: true })
+
+// Require specific ordering
+assertConsistentRowLocking({ tables: ['User'], strict: 'ASC' })
+```
+
+#### `assertNoDeadlockRisk(rowOptions?)`
+
+Convenience function that calls both `assertConsistentTableLocking()` and `assertConsistentRowLocking()`.
+
+```typescript
+assertNoDeadlockRisk()
+assertNoDeadlockRisk({ strict: 'ASC' })
+```
+
+### Utility Functions
+
+#### `resetDeadlockDetection()`
+
+Clears all tracked state. Use this to start fresh when beginning a new test run (e.g., in CI or when manually re-running tests).
+
+**Important**: Do NOT call this between test files. The library needs to accumulate data across your entire test suite to detect cross-file deadlock risks.
+
+```typescript
+beforeAll(() => {
+  resetDeadlockDetection()
+})
+```
+
+## Error Types
+
+### `TableLockingAssertionError`
+
+Thrown when inconsistent table locking order is detected.
+
+```typescript
+try {
+  assertConsistentTableLocking()
+} catch (error) {
+  if (error instanceof TableLockingAssertionError) {
+    console.log(error.cycleInfo.tables)  // ['User', 'Post']
+    console.log(error.cycleInfo.callers) // Caller locations
+  }
+}
+```
+
+### `RowLockingAssertionError`
+
+Thrown when inconsistent row locking order is detected.
+
+```typescript
+try {
+  assertConsistentRowLocking({ strict: 'ASC' })
+} catch (error) {
+  if (error instanceof RowLockingAssertionError) {
+    console.log(error.issues) // Array of violations by table
+  }
+}
+```
+
+## How It Works
+
+### Table Ordering
+
+The library builds a directed graph of table lock ordering:
+- Each node is a table name
+- Each edge represents "Table A was locked before Table B" within a transaction
+- A cycle in this graph indicates potential deadlock risk
+
+### Row Ordering
+
+For each table, a separate directed graph tracks row lock ordering:
+- Each node is a primary key value
+- Edges represent the order rows were locked within operations
+- Cycles indicate potential deadlock risk
+- Strict mode can enforce ascending/descending order
+
+### What Gets Tracked
+
+Locking operations tracked:
+- `create`, `createMany`, `createManyAndReturn`
+- `update`, `updateMany`
+- `delete`, `deleteMany`
+- `upsert`
+- Raw queries (best-effort table inference from SQL)
+- `trackForUpdate()` calls
+
+## Best Practices
+
+1. **Don't reset between test files** - The library needs to accumulate data across your entire test suite to detect cross-file deadlock risks. Only reset when starting a completely fresh test run (e.g., in CI or when manually re-running tests).
+
+2. **Assert at end of suite** - Call `assertNoDeadlockRisk()` in a global `afterAll`
+
+3. **Use with prisma-lock-for-update** - Wrap forUpdate calls with `trackForUpdate()`
+
+## Example: Full Test Setup
+
+```typescript
+import { describe, it, beforeAll, afterAll } from 'vitest'
+import { PrismaClient } from '@prisma/client'
+import {
+  withDeadlockDetection,
+  assertNoDeadlockRisk,
+  resetDeadlockDetection,
+} from '@mosaic-code/prisma-deadlock-avoidance-tests'
+
+const prisma = withDeadlockDetection(new PrismaClient())
+
+beforeAll(() => {
+  resetDeadlockDetection()
+})
+
+afterAll(() => {
+  assertNoDeadlockRisk()
+})
+
+describe('User operations', () => {
+  it('updates user and creates post', async () => {
+    await prisma.$transaction(async (tx) => {
+      await tx.user.update({ where: { id: 1 }, data: { name: 'New' } })
+      await tx.post.create({ data: { title: 'Post', authorId: 1 } })
+    })
+  })
+})
+```
+
+## Requirements
+
+- Node.js >= 18.18.0
+- Prisma >= 7.0.0
+- PostgreSQL (for raw query parsing)
+
+## License
+
+[Do No Harm](https://github.com/raisely/NoHarm)

package/dist/assertions/row-assertion.d.ts

@@ -0,0 +1,18 @@
+import type { RowCycleInfo, RowLockingOptions } from '../types.js';
+import type { RowLockGraphs } from '../graphs/row-graph.js';
+/**
+ * Error thrown when inconsistent row locking order is detected.
+ */
+export declare class RowLockingAssertionError extends Error {
+    readonly issues: RowCycleInfo[];
+    constructor(issues: RowCycleInfo[]);
+}
+/**
+ * Assert that row locking has been consistent within tables.
+ *
+ * @param rowGraphs The row lock graphs to check
+ * @param options Options controlling which tables to check and strictness mode
+ * @throws RowLockingAssertionError if violations are detected
+ */
+export declare function assertConsistentRowLocking(rowGraphs: RowLockGraphs, options?: RowLockingOptions): void;
+//# sourceMappingURL=row-assertion.d.ts.map

package/dist/assertions/row-assertion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"row-assertion.d.ts","sourceRoot":"","sources":["../../src/assertions/row-assertion.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,iBAAiB,EAAc,MAAM,aAAa,CAAA;AAC9E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAA;AAG3D;;GAEG;AACH,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,SAAgB,MAAM,EAAE,YAAY,EAAE,CAAA;gBAE1B,MAAM,EAAE,YAAY,EAAE;CA0BnC;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,aAAa,EACxB,OAAO,GAAE,iBAAsB,GAC9B,IAAI,CAkBN"}

package/dist/assertions/row-assertion.js

@@ -0,0 +1,53 @@
+import { formatCaller } from '../utils/caller-extractor.js';
+/**
+ * Error thrown when inconsistent row locking order is detected.
+ */
+export class RowLockingAssertionError extends Error {
+    issues;
+    constructor(issues) {
+        const details = issues
+            .map((issue) => {
+            let msg = `Table "${issue.table}": `;
+            if (issue.message) {
+                msg += issue.message;
+            }
+            else if (issue.primaryKeys.length > 0) {
+                msg += `keys [${issue.primaryKeys.join(', ')}] form a cycle`;
+            }
+            if (issue.callers.length > 0) {
+                msg +=
+                    '\n  Callers:\n' +
+                        issue.callers.map((c) => `    - ${formatCaller(c)}`).join('\n');
+            }
+            return msg;
+        })
+            .join('\n\n');
+        const message = `Inconsistent row locking order detected!\n\n${details}`;
+        super(message);
+        this.name = 'RowLockingAssertionError';
+        this.issues = issues;
+    }
+}
+/**
+ * Assert that row locking has been consistent within tables.
+ *
+ * @param rowGraphs The row lock graphs to check
+ * @param options Options controlling which tables to check and strictness mode
+ * @throws RowLockingAssertionError if violations are detected
+ */
+export function assertConsistentRowLocking(rowGraphs, options = {}) {
+    const { tables, strict = false } = options;
+    // Determine which tables to check
+    const tablesToCheck = tables ?? rowGraphs.getAllTables();
+    const issues = [];
+    for (const table of tablesToCheck) {
+        const issue = rowGraphs.checkStrictOrdering(table, strict);
+        if (issue) {
+            issues.push(issue);
+        }
+    }
+    if (issues.length > 0) {
+        throw new RowLockingAssertionError(issues);
+    }
+}
+//# sourceMappingURL=row-assertion.js.map

package/dist/assertions/row-assertion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"row-assertion.js","sourceRoot":"","sources":["../../src/assertions/row-assertion.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA;AAE3D;;GAEG;AACH,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjC,MAAM,CAAgB;IAEtC,YAAY,MAAsB;QAChC,MAAM,OAAO,GAAG,MAAM;aACnB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACb,IAAI,GAAG,GAAG,UAAU,KAAK,CAAC,KAAK,KAAK,CAAA;YACpC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,GAAG,IAAI,KAAK,CAAC,OAAO,CAAA;YACtB,CAAC;iBAAM,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxC,GAAG,IAAI,SAAS,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAA;YAC9D,CAAC;YAED,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,GAAG;oBACD,gBAAgB;wBAChB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnE,CAAC;YAED,OAAO,GAAG,CAAA;QACZ,CAAC,CAAC;aACD,IAAI,CAAC,MAAM,CAAC,CAAA;QAEf,MAAM,OAAO,GAAG,+CAA+C,OAAO,EAAE,CAAA;QAExE,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAA;QACtC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACtB,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,UAAU,0BAA0B,CACxC,SAAwB,EACxB,UAA6B,EAAE;IAE/B,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,OAAO,CAAA;IAE1C,kCAAkC;IAClC,MAAM,aAAa,GAAG,MAAM,IAAI,SAAS,CAAC,YAAY,EAAE,CAAA;IAExD,MAAM,MAAM,GAAmB,EAAE,CAAA;IAEjC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,SAAS,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC1D,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAA;IAC5C,CAAC;AACH,CAAC"}

package/dist/assertions/table-assertion.d.ts

@@ -0,0 +1,17 @@
+import type { TableCycleInfo } from '../types.js';
+import type { TableLockGraph } from '../graphs/table-graph.js';
+/**
+ * Error thrown when inconsistent table locking order is detected.
+ */
+export declare class TableLockingAssertionError extends Error {
+    readonly cycleInfo: TableCycleInfo;
+    constructor(cycleInfo: TableCycleInfo);
+}
+/**
+ * Assert that table locking has been consistent (no cycles in the table lock graph).
+ *
+ * @param tableGraph The table lock graph to check
+ * @throws TableLockingAssertionError if a cycle is detected
+ */
+export declare function assertConsistentTableLocking(tableGraph: TableLockGraph): void;
+//# sourceMappingURL=table-assertion.d.ts.map

package/dist/assertions/table-assertion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"table-assertion.d.ts","sourceRoot":"","sources":["../../src/assertions/table-assertion.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAc,MAAM,aAAa,CAAA;AAC7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AAG9D;;GAEG;AACH,qBAAa,0BAA2B,SAAQ,KAAK;IACnD,SAAgB,SAAS,EAAE,cAAc,CAAA;gBAE7B,SAAS,EAAE,cAAc;CAgBtC;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAAC,UAAU,EAAE,cAAc,GAAG,IAAI,CAO7E"}

package/dist/assertions/table-assertion.js

@@ -0,0 +1,33 @@
+import { formatCaller } from '../utils/caller-extractor.js';
+/**
+ * Error thrown when inconsistent table locking order is detected.
+ */
+export class TableLockingAssertionError extends Error {
+    cycleInfo;
+    constructor(cycleInfo) {
+        const cycleStr = [...cycleInfo.tables, cycleInfo.tables[0]].join(' -> ');
+        const callerDetails = cycleInfo.callers
+            .map((c) => `  ${c.table}: ${formatCaller(c.caller)}`)
+            .join('\n');
+        const message = `Inconsistent table locking order detected!\n\n` +
+            `Cycle: ${cycleStr}\n\n` +
+            `Callers involved:\n${callerDetails}`;
+        super(message);
+        this.name = 'TableLockingAssertionError';
+        this.cycleInfo = cycleInfo;
+    }
+}
+/**
+ * Assert that table locking has been consistent (no cycles in the table lock graph).
+ *
+ * @param tableGraph The table lock graph to check
+ * @throws TableLockingAssertionError if a cycle is detected
+ */
+export function assertConsistentTableLocking(tableGraph) {
+    const cycles = tableGraph.findCyclesWithCallers();
+    if (cycles.length > 0) {
+        // Report only the first cycle (as per requirements)
+        throw new TableLockingAssertionError(cycles[0]);
+    }
+}
+//# sourceMappingURL=table-assertion.js.map

package/dist/assertions/table-assertion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"table-assertion.js","sourceRoot":"","sources":["../../src/assertions/table-assertion.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA;AAE3D;;GAEG;AACH,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IACnC,SAAS,CAAgB;IAEzC,YAAY,SAAyB;QACnC,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAExE,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;aACrD,IAAI,CAAC,IAAI,CAAC,CAAA;QAEb,MAAM,OAAO,GACX,gDAAgD;YAChD,UAAU,QAAQ,MAAM;YACxB,sBAAsB,aAAa,EAAE,CAAA;QAEvC,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,4BAA4B,CAAA;QACxC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAAC,UAA0B;IACrE,MAAM,MAAM,GAAG,UAAU,CAAC,qBAAqB,EAAE,CAAA;IAEjD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,oDAAoD;QACpD,MAAM,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACjD,CAAC;AACH,CAAC"}

package/dist/extension.d.ts

@@ -0,0 +1,60 @@
+import { PrismaClient } from '@prisma/client';
+import type { DeadlockDetectionConfig, RowLockingOptions } from './types.js';
+import { TableLockingAssertionError } from './assertions/table-assertion.js';
+import { RowLockingAssertionError } from './assertions/row-assertion.js';
+/**
+ * Wrap a Prisma client with deadlock detection.
+ * Automatically tracks table and row locking order across all transactions.
+ *
+ * Usage:
+ * ```typescript
+ * const prisma = withDeadlockDetection(new PrismaClient())
+ * ```
+ *
+ * @param client The PrismaClient instance to wrap
+ * @param config Optional configuration
+ * @returns A wrapped client with automatic transaction tracking
+ */
+export declare function withDeadlockDetection<T extends PrismaClient>(client: T, config?: DeadlockDetectionConfig): T;
+/**
+ * Assert that table locking has been consistent across all tracked operations.
+ * Throws TableLockingAssertionError if a cycle is detected.
+ */
+export declare function assertConsistentTableLocking(): void;
+/**
+ * Assert that row locking has been consistent within tables.
+ * Throws RowLockingAssertionError if violations are detected.
+ *
+ * @param options Options controlling which tables to check and strictness mode
+ */
+export declare function assertConsistentRowLocking(options?: RowLockingOptions): void;
+/**
+ * Assert no deadlock risk exists by checking both table and row locking consistency.
+ * This is a convenience function that calls both assertions.
+ *
+ * @param rowOptions Options for the row locking assertion
+ */
+export declare function assertNoDeadlockRisk(rowOptions?: RowLockingOptions): void;
+/**
+ * Reset all deadlock detection state.
+ * Call this between test runs if needed.
+ */
+export declare function resetDeadlockDetection(): void;
+/**
+ * Wrapper function for tracking operations from prisma-lock-for-update.
+ * Use this to wrap forUpdate calls so they're tracked in the deadlock detection graph.
+ *
+ * @param model The model name (e.g., 'User', 'Post')
+ * @param fn The async function that performs the forUpdate operation
+ * @returns The result of the operation
+ *
+ * @example
+ * ```typescript
+ * const user = await trackForUpdate('User', () =>
+ *   tx.user.findUniqueForUpdate({ where: { id: 1 } })
+ * )
+ * ```
+ */
+export declare function trackForUpdate<T>(model: string, fn: () => Promise<T>): Promise<T>;
+export { TableLockingAssertionError, RowLockingAssertionError };
+//# sourceMappingURL=extension.d.ts.map

package/dist/extension.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extension.d.ts","sourceRoot":"","sources":["../src/extension.ts"],"names":[],"mappings":"AAAA,OAAO,EAAU,YAAY,EAAE,MAAM,gBAAgB,CAAA;AACrD,OAAO,KAAK,EAAE,uBAAuB,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAA;AAM5E,OAAO,EAEL,0BAA0B,EAC3B,MAAM,iCAAiC,CAAA;AACxC,OAAO,EAEL,wBAAwB,EACzB,MAAM,+BAA+B,CAAA;AAoQtC;;;;;;;;;;;;GAYG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,YAAY,EAC1D,MAAM,EAAE,CAAC,EACT,MAAM,CAAC,EAAE,uBAAuB,GAC/B,CAAC,CAyCH;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,IAAI,IAAI,CAGnD;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,CAAC,EAAE,iBAAiB,GAAG,IAAI,CAG5E;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI,CAGzE;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,IAAI,IAAI,CAE7C;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,cAAc,CAAC,CAAC,EACpC,KAAK,EAAE,MAAM,EACb,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACnB,OAAO,CAAC,CAAC,CAAC,CAeZ;AAGD,OAAO,EAAE,0BAA0B,EAAE,wBAAwB,EAAE,CAAA"}