|
| 1 | +import assert from "node:assert/strict"; |
| 2 | +import { mock } from "node:test"; |
| 3 | +import type { Tree, TreeCursor } from "web-tree-sitter"; |
| 4 | +import { Node } from "web-tree-sitter"; |
| 5 | +import { FakeIDE, InMemoryTextEditor } from "@cursorless/lib-common"; |
| 6 | +import { getChildNodesForFieldName } from "../languages/TreeSitterQuery/getChildNodesForFieldName"; |
| 7 | +import { isEven } from "../languages/TreeSitterQuery/isEven"; |
| 8 | +import { TestTreeSitter } from "../testUtil/TestTreeSitter"; |
| 9 | +import { getChildNodesForFieldName as getChildren } from "./treeSitterUtils"; |
| 10 | + |
| 11 | +suite("Tree-sitter cursor lifetime", () => { |
| 12 | + const treeSitter = new TestTreeSitter(); |
| 13 | + let tree: Tree; |
| 14 | + const deletions: { |
| 15 | + cursor: TreeCursor; |
| 16 | + deletion: ReturnType<typeof mock.method>; |
| 17 | + }[] = []; |
| 18 | + |
| 19 | + suiteSetup(async () => { |
| 20 | + await treeSitter.loadLanguage("clojure"); |
| 21 | + }); |
| 22 | + |
| 23 | + setup(() => { |
| 24 | + const { document } = new InMemoryTextEditor({ |
| 25 | + ide: new FakeIDE(), |
| 26 | + content: "{:a 1 :b 2}", |
| 27 | + languageId: "clojure", |
| 28 | + }); |
| 29 | + tree = treeSitter.getTree(document); |
| 30 | + const walk = Node.prototype.walk; |
| 31 | + mock.method(Node.prototype, "walk", function (this: Node) { |
| 32 | + const cursor = walk.call(this); |
| 33 | + deletions.push({ cursor, deletion: mock.method(cursor, "delete") }); |
| 34 | + return cursor; |
| 35 | + }); |
| 36 | + }); |
| 37 | + |
| 38 | + teardown(() => { |
| 39 | + try { |
| 40 | + assert.ok(deletions.length > 0, "Expected traversal to create a cursor"); |
| 41 | + for (const { deletion } of deletions) { |
| 42 | + assert.equal(deletion.mock.callCount(), 1); |
| 43 | + } |
| 44 | + } finally { |
| 45 | + // Also clean up cursors if a regression leaves them unfreed. Their WASM |
| 46 | + // finalizers can crash the process, obscuring the assertion failure. |
| 47 | + for (const { cursor, deletion } of deletions) { |
| 48 | + if (deletion.mock.callCount() === 0) { |
| 49 | + cursor.delete(); |
| 50 | + } |
| 51 | + } |
| 52 | + deletions.length = 0; |
| 53 | + mock.restoreAll(); |
| 54 | + tree.delete(); |
| 55 | + } |
| 56 | + }); |
| 57 | + |
| 58 | + test("releases the cursor on an early return from isEven", () => { |
| 59 | + const node = tree.rootNode.descendantsOfType("kwd_lit")[0]; |
| 60 | + assert.equal(isEven(node, "value"), true); |
| 61 | + }); |
| 62 | + |
| 63 | + test("releases the cursor when isEven throws for a missing field", () => { |
| 64 | + const node = tree.rootNode.descendantsOfType("kwd_lit")[0]; |
| 65 | + assert.throws(() => isEven(node, "missing"), /Node not found in parent/u); |
| 66 | + }); |
| 67 | + |
| 68 | + for (const [name, getNodes] of [ |
| 69 | + ["query", getChildNodesForFieldName], |
| 70 | + ["utility", getChildren], |
| 71 | + ] as const) { |
| 72 | + test(`${name} traversal releases the cursor after collecting children`, () => { |
| 73 | + const node = tree.rootNode.descendantsOfType("map_lit")[0]; |
| 74 | + assert.deepEqual( |
| 75 | + getNodes(node, "value").map((child) => child.text), |
| 76 | + [":a", "1", ":b", "2"], |
| 77 | + ); |
| 78 | + }); |
| 79 | + |
| 80 | + test(`${name} traversal releases the cursor for a leaf`, () => { |
| 81 | + const node = tree.rootNode.descendantsOfType("num_lit")[0]; |
| 82 | + assert.deepEqual(getNodes(node, "value"), []); |
| 83 | + }); |
| 84 | + } |
| 85 | +}); |
0 commit comments