forked from babel/babel
/
context.ts
320 lines (260 loc) · 7.87 KB
/
context.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
// This file contains methods responsible for maintaining a TraversalContext.
import { traverseNode } from "../traverse-node";
import { SHOULD_SKIP, SHOULD_STOP } from "./index";
import type TraversalContext from "../context";
import type NodePath from "./index";
import type * as t from "@babel/types";
export function call(this: NodePath, key: string): boolean {
const opts = this.opts;
this.debug(key);
if (this.node) {
if (this._call(opts[key])) return true;
}
if (this.node) {
return this._call(opts[this.node.type] && opts[this.node.type][key]);
}
return false;
}
export function _call(this: NodePath, fns?: Array<Function>): boolean {
if (!fns) return false;
for (const fn of fns) {
if (!fn) continue;
const node = this.node;
if (!node) return true;
const ret = fn.call(this.state, this, this.state);
if (ret && typeof ret === "object" && typeof ret.then === "function") {
throw new Error(
`You appear to be using a plugin with an async traversal visitor, ` +
`which your current version of Babel does not support. ` +
`If you're using a published plugin, you may need to upgrade ` +
`your @babel/core version.`,
);
}
if (ret) {
throw new Error(`Unexpected return value from visitor method ${fn}`);
}
// node has been replaced, it will have been requeued
if (this.node !== node) return true;
// this.shouldSkip || this.shouldStop || this.removed
if (this._traverseFlags > 0) return true;
}
return false;
}
export function isDenylisted(this: NodePath): boolean {
const denylist = this.opts.denylist ?? this.opts.blacklist;
return denylist && denylist.indexOf(this.node.type) > -1;
}
// TODO: Remove in Babel 8
export { isDenylisted as isBlacklisted };
function restoreContext(path: NodePath, context: TraversalContext) {
if (path.context !== context) {
path.context = context;
path.state = context.state;
path.opts = context.opts;
}
}
export function visit(this: NodePath): boolean {
if (!this.node) {
return false;
}
if (this.isDenylisted()) {
return false;
}
if (this.opts.shouldSkip && this.opts.shouldSkip(this)) {
return false;
}
const currentContext = this.context;
// Note: We need to check "this.shouldSkip" first because
// another visitor can set it to true. Usually .shouldSkip is false
// before calling the enter visitor, but it can be true in case of
// a requeued node (e.g. by .replaceWith()) that is then marked
// with .skip().
if (this.shouldSkip || this.call("enter")) {
this.debug("Skip...");
return this.shouldStop;
}
restoreContext(this, currentContext);
this.debug("Recursing into...");
this.shouldStop = traverseNode(
this.node,
this.opts,
this.scope,
this.state,
this,
this.skipKeys,
);
restoreContext(this, currentContext);
this.call("exit");
return this.shouldStop;
}
export function skip(this: NodePath) {
this.shouldSkip = true;
}
export function skipKey(this: NodePath, key: string) {
if (this.skipKeys == null) {
this.skipKeys = {};
}
this.skipKeys[key] = true;
}
export function stop(this: NodePath) {
// this.shouldSkip = true; this.shouldStop = true;
this._traverseFlags |= SHOULD_SKIP | SHOULD_STOP;
}
export function setScope(this: NodePath) {
if (this.opts && this.opts.noScope) return;
let path = this.parentPath;
if (
// Skip method scope if is computed method key or decorator expression
((this.key === "key" || this.listKey === "decorators") &&
path.isMethod()) ||
// Skip switch scope if for discriminant (`x` in `switch (x) {}`).
(this.key === "discriminant" && path.isSwitchStatement())
) {
path = path.parentPath;
}
let target;
while (path && !target) {
if (path.opts && path.opts.noScope) return;
target = path.scope;
path = path.parentPath;
}
this.scope = this.getScope(target);
if (this.scope) this.scope.init();
}
export function setContext<S = unknown>(
this: NodePath,
context?: TraversalContext<S>,
) {
if (this.skipKeys != null) {
this.skipKeys = {};
}
// this.shouldSkip = false; this.shouldStop = false; this.removed = false;
this._traverseFlags = 0;
if (context) {
this.context = context;
this.state = context.state;
this.opts = context.opts;
}
this.setScope();
return this;
}
/**
* Here we resync the node paths `key` and `container`. If they've changed according
* to what we have stored internally then we attempt to resync by crawling and looking
* for the new values.
*/
export function resync(this: NodePath) {
if (this.removed) return;
this._resyncParent();
this._resyncList();
this._resyncKey();
//this._resyncRemoved();
}
export function _resyncParent(this: NodePath) {
if (this.parentPath) {
this.parent = this.parentPath.node;
}
}
export function _resyncKey(this: NodePath) {
if (!this.container) return;
if (
this.node ===
// @ts-expect-error this.key should present in this.container
this.container[this.key]
) {
return;
}
// grrr, path key is out of sync. this is likely due to a modification to the AST
// not done through our path APIs
if (Array.isArray(this.container)) {
for (let i = 0; i < this.container.length; i++) {
if (this.container[i] === this.node) {
return this.setKey(i);
}
}
} else {
for (const key of Object.keys(this.container)) {
// @ts-expect-error this.key should present in this.container
if (this.container[key] === this.node) {
return this.setKey(key);
}
}
}
// ¯\_(ツ)_/¯ who knows where it's gone lol
this.key = null;
}
export function _resyncList(this: NodePath) {
if (!this.parent || !this.inList) return;
const newContainer =
// @ts-expect-error this.listKey should present in this.parent
this.parent[this.listKey];
if (this.container === newContainer) return;
// container is out of sync. this is likely the result of it being reassigned
this.container = newContainer || null;
}
export function _resyncRemoved(this: NodePath) {
if (
this.key == null ||
!this.container ||
// @ts-expect-error this.key should present in this.container
this.container[this.key] !== this.node
) {
this._markRemoved();
}
}
export function popContext(this: NodePath) {
this.contexts.pop();
if (this.contexts.length > 0) {
this.setContext(this.contexts[this.contexts.length - 1]);
} else {
this.setContext(undefined);
}
}
export function pushContext(this: NodePath, context: TraversalContext) {
this.contexts.push(context);
this.setContext(context);
}
export function setup(
this: NodePath,
parentPath: NodePath | undefined,
container: t.Node,
listKey: string,
key: string | number,
) {
this.listKey = listKey;
this.container = container;
this.parentPath = parentPath || this.parentPath;
this.setKey(key);
}
export function setKey(this: NodePath, key: string | number) {
this.key = key;
this.node =
// @ts-expect-error this.key must present in this.container
this.container[this.key];
this.type = this.node?.type;
}
export function requeue(this: NodePath, pathToQueue = this) {
if (pathToQueue.removed) return;
// If a path is skipped, and then replaced with a
// new one, the new one shouldn't probably be skipped.
if (process.env.BABEL_8_BREAKING) {
pathToQueue.shouldSkip = false;
}
// TODO(loganfsmyth): This should be switched back to queue in parent contexts
// automatically once #2892 and #4135 have been resolved. See #4140.
// let contexts = this._getQueueContexts();
const contexts = this.contexts;
for (const context of contexts) {
context.maybeQueue(pathToQueue);
}
}
export function _getQueueContexts(this: NodePath) {
let path = this;
let contexts = this.contexts;
while (!contexts.length) {
path = path.parentPath;
if (!path) break;
contexts = path.contexts;
}
return contexts;
}