Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix Lineage and Scope Meta Data #35

Merged
merged 4 commits into from
Dec 17, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
80 changes: 49 additions & 31 deletions src/flast.js
Original file line number Diff line number Diff line change
Expand Up @@ -153,31 +153,35 @@ function extractNodesFromRoot(rootNode, opts) {
node.nodeId = nodeId++;
typeMap[node.type] = typeMap[node.type] || [];
typeMap[node.type].push(node);
node.lineage = [...node.parentNode?.lineage || []];
if (node.parentNode) {
node.lineage.push(node.parentNode.start);
if (opts.detailed) {
node.scope = matchScopeToNode(node, scopes);
node.lineage = [...node.parentNode?.lineage || []];
if (!node.lineage.includes(node.scope.scopeId)) {
node.lineage.push(node.scope.scopeId);
}
}
// Add a getter for the node's source code
if (opts.includeSrc && !node.src) Object.defineProperty(node, 'src', {
get() {return rootNode.srcClosure(node.start, node.end);},
});
if (opts.detailed) injectScopeToNode(node, scopes);
}
if (opts.detailed) {
const identifiers = typeMap.Identifier || [];
for (let i = 0; i < identifiers.length; i++) {
mapIdentifierRelations(identifiers[i]);
}
}
if (allNodes?.length) allNodes[0].typeMap = typeMap;
return allNodes;
}

/**
* @param {ASTNode} node
* @param {ASTScope[]} scopes
*/
function injectScopeToNode(node, scopes) {
let parentNode = node.parentNode;
// Acquire scope
node.scope = matchScopeToNode(node, scopes);
if (node.type === 'Identifier' && !(!parentNode.computed && ['property', 'key'].includes(node.parentKey))) {
// Track references and declarations
// Prevent assigning declNode to member expression properties or object keys
function mapIdentifierRelations(node) {
// Track references and declarations
// Prevent assigning declNode to member expression properties or object keys
if (node.type === 'Identifier' && !(!node.parentNode.computed && ['property', 'key'].includes(node.parentKey))) {
const variables = [];
for (let i = 0; i < node.scope.variables.length; i++) {
if (node.scope.variables[i].name === node.name) variables.push(node.scope.variables[i]);
Expand All @@ -194,8 +198,7 @@ function injectScopeToNode(node, scopes) {
break;
}
}
}
else {
} else {
for (let i = 0; i < node.scope.references.length; i++) {
if (node.scope.references[i].identifier.name === node.name) {
decls = node.scope.references[i].resolved?.identifiers || [];
Expand Down Expand Up @@ -247,40 +250,55 @@ function getAllScopes(rootNode) {
optimistic: true,
ecmaVersion: currentYear,
sourceType}).acquireAll(rootNode)[0];
let scopeId = 0;
const allScopes = {};
const stack = [globalScope];
while (stack.length) {
let scope = stack.shift();
const scopeId = scope.block.start;
scope.block.isScopeBlock = true;
allScopes[scopeId] = allScopes[scopeId] || scope;
stack.unshift(...scope.childScopes);
// A single global scope is enough, so if there are variables in a module scope, add them to the global scope
if (scope.type === 'module' && scope.upper === globalScope && scope.variables?.length) {
const scope = stack.shift();
if (scope.type !== 'module') {
scope.scopeId = scopeId++;
scope.block.scopeId = scope.scopeId;
allScopes[scope.scopeId] = allScopes[scope.scopeId] || scope;

for (let i = 0; i < scope.variables.length; i++) {
const v = scope.variables[i];
for (let j = 0; j < v.identifiers.length; j++) {
v.identifiers[j].scope = scope;
v.identifiers[j].references = [];
}
}
} else if (scope.upper === globalScope && scope.variables?.length) {
// A single global scope is enough, so if there are variables in a module scope, add them to the global scope
for (let i = 0; i < scope.variables.length; i++) {
const v = scope.variables[i];
if (!globalScope.variables.includes(v)) globalScope.variables.push(v);
}
}
stack.unshift(...scope.childScopes);
}
rootNode.allScopes = allScopes;
return allScopes;
return rootNode.allScopes = allScopes;
}

/**
* @param {ASTNode} node
* @param {ASTScope[]} allScopes
* @param {{number: ASTScope}} allScopes
* @return {ASTScope}
*/
function matchScopeToNode(node, allScopes) {
let scopeBlock = node;
while (scopeBlock && !scopeBlock.isScopeBlock) {
scopeBlock = scopeBlock.parentNode;
let scope = node.scope;
if (!scope) {
let scopeBlock = node;
while (scopeBlock && scopeBlock.scopeId === undefined) {
scopeBlock = scopeBlock.parentNode;
}
if (scopeBlock) {
scope = allScopes[scopeBlock.scopeId];
}
}
let scope;
if (scopeBlock) {
scope = allScopes[scopeBlock.start];
if (scope) {
if (scope.type.includes('-name') && scope?.childScopes?.length === 1) scope = scope.childScopes[0];
if (node === scope.block && scope.upper) scope = scope.upper;
if (scope.type === 'module') scope = scope.upper;
} else scope = allScopes[0]; // Global scope - this should never be reached
return scope;
}
Expand All @@ -290,6 +308,6 @@ export {
generateCode,
generateFlatAST,
generateRootNode,
injectScopeToNode,
mapIdentifierRelations,
parseCode,
};
2 changes: 1 addition & 1 deletion src/types.js
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,6 @@ import {Scope} from 'eslint-scope';
* @property {ASTNode} [init]
* @property {boolean} [isEmpty] True when the node is set for deletion but should be replced with an Empty Statement instead
* @property {boolean} [isMarked] True when the node has already been marked for replacement or deletion
* @property {boolean} [isScopeBlock] Marks the node as a scope block to allow iterations to quickly find a surrounding block
* @property {ASTNode} [key]
* @property {string} [kind]
* @property {ASTNode} [label]
Expand All @@ -60,6 +59,7 @@ import {Scope} from 'eslint-scope';
* @property {ASTNode} [regex]
* @property {ASTNode} [right]
* @property {ASTScope} [scope]
* @property {number} [scopeId] For nodes which are also a scope's block
* @property {string} [scriptHash]
* @property {boolean} [shorthand]
* @property {ASTNode} [source]
Expand Down
33 changes: 32 additions & 1 deletion tests/parsing.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@ describe('Parsing tests', () => {
const expectedScopeType = 'function';
// ast.slice(-1)[0].type is the last identifier in the code and should have the expected scope type
assert.equal(ast.slice(-1)[0].scope.type, expectedScopeType, `Unexpected scope`);
assert.equal(testedScope.type, expectedParentScopeType, `Tested scope is not the child of the correct scope`);
assert.equal(testedScope.upper.type, expectedParentScopeType, `Tested scope is not the child of the correct scope`);
});
it('Verify declNode references the local declaration correctly', () => {
const innerScopeVal = 'inner';
Expand Down Expand Up @@ -73,4 +73,35 @@ describe('Parsing tests', () => {
const result = ast[0].typeMap;
assert.deepEqual(result, expected);
});
it(`Verify node relations are parsed correctly`, () => {
const code = `for (var i = 0; i < 10; i++);\nfor (var i = 0; i < 10; i++);`;
try {
generateFlatAST(code);
} catch (e) {
assert.fail(`Parsing failed: ${e.message}`);
}
});
it(`Verify the module scope is ignored`, () => {
const code = `function a() {return [1];}\nconst b = a();`;
const ast = generateFlatAST(code);
ast.forEach(n => assert.ok(n.scope.type !== 'module', `Module scope was not ignored`));
});
it(`Verify the lineage is correct`, () => {
const code = `(function() {var a; function b() {var c;}})();`;
const ast = generateFlatAST(code);
function extractLineage(node) {
const lineage = [];
let currentNode = node;
while (currentNode) {
lineage.push(currentNode.scope.scopeId);
if (!currentNode.scope.scopeId) break;
currentNode = currentNode.parentNode;
}
return [...new Set(lineage)].reverse();
}
ast[0].typeMap.Identifier.forEach(n => {
const extractedLineage = extractLineage(n);
assert.deepEqual(n.lineage, extractedLineage);
});
});
});
Loading