Software zum Installieren eines Smart-Mirror Frameworks , zum Nutzen von hochschulrelevanten Informationen, auf einem Raspberry-Pi.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

visitor.js 20KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683
  1. "use strict";
  2. Object.defineProperty(exports, "__esModule", {
  3. value: true
  4. });
  5. exports.default = void 0;
  6. var _crypto = require("crypto");
  7. var _core = require("@babel/core");
  8. var _schema = require("@istanbuljs/schema");
  9. var _sourceCoverage = require("./source-coverage");
  10. var _constants = require("./constants");
  11. // pattern for istanbul to ignore a section
  12. const COMMENT_RE = /^\s*istanbul\s+ignore\s+(if|else|next)(?=\W|$)/; // pattern for istanbul to ignore the whole file
  13. const COMMENT_FILE_RE = /^\s*istanbul\s+ignore\s+(file)(?=\W|$)/; // source map URL pattern
  14. const SOURCE_MAP_RE = /[#@]\s*sourceMappingURL=(.*)\s*$/m; // generate a variable name from hashing the supplied file path
  15. function genVar(filename) {
  16. const hash = (0, _crypto.createHash)(_constants.SHA);
  17. hash.update(filename);
  18. return 'cov_' + parseInt(hash.digest('hex').substr(0, 12), 16).toString(36);
  19. } // VisitState holds the state of the visitor, provides helper functions
  20. // and is the `this` for the individual coverage visitors.
  21. class VisitState {
  22. constructor(types, sourceFilePath, inputSourceMap, ignoreClassMethods = []) {
  23. this.varName = genVar(sourceFilePath);
  24. this.attrs = {};
  25. this.nextIgnore = null;
  26. this.cov = new _sourceCoverage.SourceCoverage(sourceFilePath);
  27. if (typeof inputSourceMap !== 'undefined') {
  28. this.cov.inputSourceMap(inputSourceMap);
  29. }
  30. this.ignoreClassMethods = ignoreClassMethods;
  31. this.types = types;
  32. this.sourceMappingURL = null;
  33. } // should we ignore the node? Yes, if specifically ignoring
  34. // or if the node is generated.
  35. shouldIgnore(path) {
  36. return this.nextIgnore || !path.node.loc;
  37. } // extract the ignore comment hint (next|if|else) or null
  38. hintFor(node) {
  39. let hint = null;
  40. if (node.leadingComments) {
  41. node.leadingComments.forEach(c => {
  42. const v = (c.value ||
  43. /* istanbul ignore next: paranoid check */
  44. '').trim();
  45. const groups = v.match(COMMENT_RE);
  46. if (groups) {
  47. hint = groups[1];
  48. }
  49. });
  50. }
  51. return hint;
  52. } // extract a source map URL from comments and keep track of it
  53. maybeAssignSourceMapURL(node) {
  54. const extractURL = comments => {
  55. if (!comments) {
  56. return;
  57. }
  58. comments.forEach(c => {
  59. const v = (c.value ||
  60. /* istanbul ignore next: paranoid check */
  61. '').trim();
  62. const groups = v.match(SOURCE_MAP_RE);
  63. if (groups) {
  64. this.sourceMappingURL = groups[1];
  65. }
  66. });
  67. };
  68. extractURL(node.leadingComments);
  69. extractURL(node.trailingComments);
  70. } // for these expressions the statement counter needs to be hoisted, so
  71. // function name inference can be preserved
  72. counterNeedsHoisting(path) {
  73. return path.isFunctionExpression() || path.isArrowFunctionExpression() || path.isClassExpression();
  74. } // all the generic stuff that needs to be done on enter for every node
  75. onEnter(path) {
  76. const n = path.node;
  77. this.maybeAssignSourceMapURL(n); // if already ignoring, nothing more to do
  78. if (this.nextIgnore !== null) {
  79. return;
  80. } // check hint to see if ignore should be turned on
  81. const hint = this.hintFor(n);
  82. if (hint === 'next') {
  83. this.nextIgnore = n;
  84. return;
  85. } // else check custom node attribute set by a prior visitor
  86. if (this.getAttr(path.node, 'skip-all') !== null) {
  87. this.nextIgnore = n;
  88. } // else check for ignored class methods
  89. if (path.isFunctionExpression() && this.ignoreClassMethods.some(name => path.node.id && name === path.node.id.name)) {
  90. this.nextIgnore = n;
  91. return;
  92. }
  93. if (path.isClassMethod() && this.ignoreClassMethods.some(name => name === path.node.key.name)) {
  94. this.nextIgnore = n;
  95. return;
  96. }
  97. } // all the generic stuff on exit of a node,
  98. // including reseting ignores and custom node attrs
  99. onExit(path) {
  100. // restore ignore status, if needed
  101. if (path.node === this.nextIgnore) {
  102. this.nextIgnore = null;
  103. } // nuke all attributes for the node
  104. delete path.node.__cov__;
  105. } // set a node attribute for the supplied node
  106. setAttr(node, name, value) {
  107. node.__cov__ = node.__cov__ || {};
  108. node.__cov__[name] = value;
  109. } // retrieve a node attribute for the supplied node or null
  110. getAttr(node, name) {
  111. const c = node.__cov__;
  112. if (!c) {
  113. return null;
  114. }
  115. return c[name];
  116. } //
  117. increase(type, id, index) {
  118. const T = this.types;
  119. const wrap = index !== null ? // If `index` present, turn `x` into `x[index]`.
  120. x => T.memberExpression(x, T.numericLiteral(index), true) : x => x;
  121. return T.updateExpression('++', wrap(T.memberExpression(T.memberExpression(T.callExpression(T.identifier(this.varName), []), T.identifier(type)), T.numericLiteral(id), true)));
  122. }
  123. insertCounter(path, increment) {
  124. const T = this.types;
  125. if (path.isBlockStatement()) {
  126. path.node.body.unshift(T.expressionStatement(increment));
  127. } else if (path.isStatement()) {
  128. path.insertBefore(T.expressionStatement(increment));
  129. } else if (this.counterNeedsHoisting(path) && T.isVariableDeclarator(path.parentPath)) {
  130. // make an attempt to hoist the statement counter, so that
  131. // function names are maintained.
  132. const parent = path.parentPath.parentPath;
  133. if (parent && T.isExportNamedDeclaration(parent.parentPath)) {
  134. parent.parentPath.insertBefore(T.expressionStatement(increment));
  135. } else if (parent && (T.isProgram(parent.parentPath) || T.isBlockStatement(parent.parentPath))) {
  136. parent.insertBefore(T.expressionStatement(increment));
  137. } else {
  138. path.replaceWith(T.sequenceExpression([increment, path.node]));
  139. }
  140. }
  141. /* istanbul ignore else: not expected */
  142. else if (path.isExpression()) {
  143. path.replaceWith(T.sequenceExpression([increment, path.node]));
  144. } else {
  145. console.error('Unable to insert counter for node type:', path.node.type);
  146. }
  147. }
  148. insertStatementCounter(path) {
  149. /* istanbul ignore if: paranoid check */
  150. if (!(path.node && path.node.loc)) {
  151. return;
  152. }
  153. const index = this.cov.newStatement(path.node.loc);
  154. const increment = this.increase('s', index, null);
  155. this.insertCounter(path, increment);
  156. }
  157. insertFunctionCounter(path) {
  158. const T = this.types;
  159. /* istanbul ignore if: paranoid check */
  160. if (!(path.node && path.node.loc)) {
  161. return;
  162. }
  163. const n = path.node;
  164. let dloc = null; // get location for declaration
  165. switch (n.type) {
  166. case 'FunctionDeclaration':
  167. /* istanbul ignore else: paranoid check */
  168. if (n.id) {
  169. dloc = n.id.loc;
  170. }
  171. break;
  172. case 'FunctionExpression':
  173. if (n.id) {
  174. dloc = n.id.loc;
  175. }
  176. break;
  177. }
  178. if (!dloc) {
  179. dloc = {
  180. start: n.loc.start,
  181. end: {
  182. line: n.loc.start.line,
  183. column: n.loc.start.column + 1
  184. }
  185. };
  186. }
  187. const name = path.node.id ? path.node.id.name : path.node.name;
  188. const index = this.cov.newFunction(name, dloc, path.node.body.loc);
  189. const increment = this.increase('f', index, null);
  190. const body = path.get('body');
  191. /* istanbul ignore else: not expected */
  192. if (body.isBlockStatement()) {
  193. body.node.body.unshift(T.expressionStatement(increment));
  194. } else {
  195. console.error('Unable to process function body node type:', path.node.type);
  196. }
  197. }
  198. getBranchIncrement(branchName, loc) {
  199. const index = this.cov.addBranchPath(branchName, loc);
  200. return this.increase('b', branchName, index);
  201. }
  202. insertBranchCounter(path, branchName, loc) {
  203. const increment = this.getBranchIncrement(branchName, loc || path.node.loc);
  204. this.insertCounter(path, increment);
  205. }
  206. findLeaves(node, accumulator, parent, property) {
  207. if (!node) {
  208. return;
  209. }
  210. if (node.type === 'LogicalExpression') {
  211. const hint = this.hintFor(node);
  212. if (hint !== 'next') {
  213. this.findLeaves(node.left, accumulator, node, 'left');
  214. this.findLeaves(node.right, accumulator, node, 'right');
  215. }
  216. } else {
  217. accumulator.push({
  218. node,
  219. parent,
  220. property
  221. });
  222. }
  223. }
  224. } // generic function that takes a set of visitor methods and
  225. // returns a visitor object with `enter` and `exit` properties,
  226. // such that:
  227. //
  228. // * standard entry processing is done
  229. // * the supplied visitors are called only when ignore is not in effect
  230. // This relieves them from worrying about ignore states and generated nodes.
  231. // * standard exit processing is done
  232. //
  233. function entries(...enter) {
  234. // the enter function
  235. const wrappedEntry = function (path, node) {
  236. this.onEnter(path);
  237. if (this.shouldIgnore(path)) {
  238. return;
  239. }
  240. enter.forEach(e => {
  241. e.call(this, path, node);
  242. });
  243. };
  244. const exit = function (path, node) {
  245. this.onExit(path, node);
  246. };
  247. return {
  248. enter: wrappedEntry,
  249. exit
  250. };
  251. }
  252. function coverStatement(path) {
  253. this.insertStatementCounter(path);
  254. }
  255. /* istanbul ignore next: no node.js support */
  256. function coverAssignmentPattern(path) {
  257. const n = path.node;
  258. const b = this.cov.newBranch('default-arg', n.loc);
  259. this.insertBranchCounter(path.get('right'), b);
  260. }
  261. function coverFunction(path) {
  262. this.insertFunctionCounter(path);
  263. }
  264. function coverVariableDeclarator(path) {
  265. this.insertStatementCounter(path.get('init'));
  266. }
  267. function coverClassPropDeclarator(path) {
  268. this.insertStatementCounter(path.get('value'));
  269. }
  270. function makeBlock(path) {
  271. const T = this.types;
  272. if (!path.node) {
  273. path.replaceWith(T.blockStatement([]));
  274. }
  275. if (!path.isBlockStatement()) {
  276. path.replaceWith(T.blockStatement([path.node]));
  277. path.node.loc = path.node.body[0].loc;
  278. path.node.body[0].leadingComments = path.node.leadingComments;
  279. path.node.leadingComments = undefined;
  280. }
  281. }
  282. function blockProp(prop) {
  283. return function (path) {
  284. makeBlock.call(this, path.get(prop));
  285. };
  286. }
  287. function makeParenthesizedExpressionForNonIdentifier(path) {
  288. const T = this.types;
  289. if (path.node && !path.isIdentifier()) {
  290. path.replaceWith(T.parenthesizedExpression(path.node));
  291. }
  292. }
  293. function parenthesizedExpressionProp(prop) {
  294. return function (path) {
  295. makeParenthesizedExpressionForNonIdentifier.call(this, path.get(prop));
  296. };
  297. }
  298. function convertArrowExpression(path) {
  299. const n = path.node;
  300. const T = this.types;
  301. if (!T.isBlockStatement(n.body)) {
  302. const bloc = n.body.loc;
  303. if (n.expression === true) {
  304. n.expression = false;
  305. }
  306. n.body = T.blockStatement([T.returnStatement(n.body)]); // restore body location
  307. n.body.loc = bloc; // set up the location for the return statement so it gets
  308. // instrumented
  309. n.body.body[0].loc = bloc;
  310. }
  311. }
  312. function coverIfBranches(path) {
  313. const n = path.node;
  314. const hint = this.hintFor(n);
  315. const ignoreIf = hint === 'if';
  316. const ignoreElse = hint === 'else';
  317. const branch = this.cov.newBranch('if', n.loc);
  318. if (ignoreIf) {
  319. this.setAttr(n.consequent, 'skip-all', true);
  320. } else {
  321. this.insertBranchCounter(path.get('consequent'), branch, n.loc);
  322. }
  323. if (ignoreElse) {
  324. this.setAttr(n.alternate, 'skip-all', true);
  325. } else {
  326. this.insertBranchCounter(path.get('alternate'), branch, n.loc);
  327. }
  328. }
  329. function createSwitchBranch(path) {
  330. const b = this.cov.newBranch('switch', path.node.loc);
  331. this.setAttr(path.node, 'branchName', b);
  332. }
  333. function coverSwitchCase(path) {
  334. const T = this.types;
  335. const b = this.getAttr(path.parentPath.node, 'branchName');
  336. /* istanbul ignore if: paranoid check */
  337. if (b === null) {
  338. throw new Error('Unable to get switch branch name');
  339. }
  340. const increment = this.getBranchIncrement(b, path.node.loc);
  341. path.node.consequent.unshift(T.expressionStatement(increment));
  342. }
  343. function coverTernary(path) {
  344. const n = path.node;
  345. const branch = this.cov.newBranch('cond-expr', path.node.loc);
  346. const cHint = this.hintFor(n.consequent);
  347. const aHint = this.hintFor(n.alternate);
  348. if (cHint !== 'next') {
  349. this.insertBranchCounter(path.get('consequent'), branch);
  350. }
  351. if (aHint !== 'next') {
  352. this.insertBranchCounter(path.get('alternate'), branch);
  353. }
  354. }
  355. function coverLogicalExpression(path) {
  356. const T = this.types;
  357. if (path.parentPath.node.type === 'LogicalExpression') {
  358. return; // already processed
  359. }
  360. const leaves = [];
  361. this.findLeaves(path.node, leaves);
  362. const b = this.cov.newBranch('binary-expr', path.node.loc);
  363. for (let i = 0; i < leaves.length; i += 1) {
  364. const leaf = leaves[i];
  365. const hint = this.hintFor(leaf.node);
  366. if (hint === 'next') {
  367. continue;
  368. }
  369. const increment = this.getBranchIncrement(b, leaf.node.loc);
  370. if (!increment) {
  371. continue;
  372. }
  373. leaf.parent[leaf.property] = T.sequenceExpression([increment, leaf.node]);
  374. }
  375. }
  376. const codeVisitor = {
  377. ArrowFunctionExpression: entries(convertArrowExpression, coverFunction),
  378. AssignmentPattern: entries(coverAssignmentPattern),
  379. BlockStatement: entries(),
  380. // ignore processing only
  381. ExportDefaultDeclaration: entries(),
  382. // ignore processing only
  383. ExportNamedDeclaration: entries(),
  384. // ignore processing only
  385. ClassMethod: entries(coverFunction),
  386. ClassDeclaration: entries(parenthesizedExpressionProp('superClass')),
  387. ClassProperty: entries(coverClassPropDeclarator),
  388. ClassPrivateProperty: entries(coverClassPropDeclarator),
  389. ObjectMethod: entries(coverFunction),
  390. ExpressionStatement: entries(coverStatement),
  391. BreakStatement: entries(coverStatement),
  392. ContinueStatement: entries(coverStatement),
  393. DebuggerStatement: entries(coverStatement),
  394. ReturnStatement: entries(coverStatement),
  395. ThrowStatement: entries(coverStatement),
  396. TryStatement: entries(coverStatement),
  397. VariableDeclaration: entries(),
  398. // ignore processing only
  399. VariableDeclarator: entries(coverVariableDeclarator),
  400. IfStatement: entries(blockProp('consequent'), blockProp('alternate'), coverStatement, coverIfBranches),
  401. ForStatement: entries(blockProp('body'), coverStatement),
  402. ForInStatement: entries(blockProp('body'), coverStatement),
  403. ForOfStatement: entries(blockProp('body'), coverStatement),
  404. WhileStatement: entries(blockProp('body'), coverStatement),
  405. DoWhileStatement: entries(blockProp('body'), coverStatement),
  406. SwitchStatement: entries(createSwitchBranch, coverStatement),
  407. SwitchCase: entries(coverSwitchCase),
  408. WithStatement: entries(blockProp('body'), coverStatement),
  409. FunctionDeclaration: entries(coverFunction),
  410. FunctionExpression: entries(coverFunction),
  411. LabeledStatement: entries(coverStatement),
  412. ConditionalExpression: entries(coverTernary),
  413. LogicalExpression: entries(coverLogicalExpression)
  414. };
  415. const globalTemplateAlteredFunction = (0, _core.template)(`
  416. var Function = (function(){}).constructor;
  417. var global = (new Function(GLOBAL_COVERAGE_SCOPE))();
  418. `);
  419. const globalTemplateFunction = (0, _core.template)(`
  420. var global = (new Function(GLOBAL_COVERAGE_SCOPE))();
  421. `);
  422. const globalTemplateVariable = (0, _core.template)(`
  423. var global = GLOBAL_COVERAGE_SCOPE;
  424. `); // the template to insert at the top of the program.
  425. const coverageTemplate = (0, _core.template)(`
  426. function COVERAGE_FUNCTION () {
  427. var path = PATH;
  428. var hash = HASH;
  429. GLOBAL_COVERAGE_TEMPLATE
  430. var gcv = GLOBAL_COVERAGE_VAR;
  431. var coverageData = INITIAL;
  432. var coverage = global[gcv] || (global[gcv] = {});
  433. if (!coverage[path] || coverage[path].hash !== hash) {
  434. coverage[path] = coverageData;
  435. }
  436. var actualCoverage = coverage[path];
  437. {
  438. // @ts-ignore
  439. COVERAGE_FUNCTION = function () {
  440. return actualCoverage;
  441. }
  442. }
  443. return actualCoverage;
  444. }
  445. `, {
  446. preserveComments: true
  447. }); // the rewire plugin (and potentially other babel middleware)
  448. // may cause files to be instrumented twice, see:
  449. // https://github.com/istanbuljs/babel-plugin-istanbul/issues/94
  450. // we should only instrument code for coverage the first time
  451. // it's run through istanbul-lib-instrument.
  452. function alreadyInstrumented(path, visitState) {
  453. return path.scope.hasBinding(visitState.varName);
  454. }
  455. function shouldIgnoreFile(programNode) {
  456. return programNode.parent && programNode.parent.comments.some(c => COMMENT_FILE_RE.test(c.value));
  457. }
  458. /**
  459. * programVisitor is a `babel` adaptor for instrumentation.
  460. * It returns an object with two methods `enter` and `exit`.
  461. * These should be assigned to or called from `Program` entry and exit functions
  462. * in a babel visitor.
  463. * These functions do not make assumptions about the state set by Babel and thus
  464. * can be used in a context other than a Babel plugin.
  465. *
  466. * The exit function returns an object that currently has the following keys:
  467. *
  468. * `fileCoverage` - the file coverage object created for the source file.
  469. * `sourceMappingURL` - any source mapping URL found when processing the file.
  470. *
  471. * @param {Object} types - an instance of babel-types
  472. * @param {string} sourceFilePath - the path to source file
  473. * @param {Object} opts - additional options
  474. * @param {string} [opts.coverageVariable=__coverage__] the global coverage variable name.
  475. * @param {string} [opts.coverageGlobalScope=this] the global coverage variable scope.
  476. * @param {boolean} [opts.coverageGlobalScopeFunc=true] use an evaluated function to find coverageGlobalScope.
  477. * @param {Array} [opts.ignoreClassMethods=[]] names of methods to ignore by default on classes.
  478. * @param {object} [opts.inputSourceMap=undefined] the input source map, that maps the uninstrumented code back to the
  479. * original code.
  480. */
  481. function programVisitor(types, sourceFilePath = 'unknown.js', opts = {}) {
  482. const T = types;
  483. opts = { ..._schema.defaults.instrumentVisitor,
  484. ...opts
  485. };
  486. const visitState = new VisitState(types, sourceFilePath, opts.inputSourceMap, opts.ignoreClassMethods);
  487. return {
  488. enter(path) {
  489. if (shouldIgnoreFile(path.find(p => p.isProgram()))) {
  490. return;
  491. }
  492. if (alreadyInstrumented(path, visitState)) {
  493. return;
  494. }
  495. path.traverse(codeVisitor, visitState);
  496. },
  497. exit(path) {
  498. if (alreadyInstrumented(path, visitState)) {
  499. return;
  500. }
  501. visitState.cov.freeze();
  502. const coverageData = visitState.cov.toJSON();
  503. if (shouldIgnoreFile(path.find(p => p.isProgram()))) {
  504. return {
  505. fileCoverage: coverageData,
  506. sourceMappingURL: visitState.sourceMappingURL
  507. };
  508. }
  509. coverageData[_constants.MAGIC_KEY] = _constants.MAGIC_VALUE;
  510. const hash = (0, _crypto.createHash)(_constants.SHA).update(JSON.stringify(coverageData)).digest('hex');
  511. coverageData.hash = hash;
  512. const coverageNode = T.valueToNode(coverageData);
  513. delete coverageData[_constants.MAGIC_KEY];
  514. delete coverageData.hash;
  515. let gvTemplate;
  516. if (opts.coverageGlobalScopeFunc) {
  517. if (path.scope.getBinding('Function')) {
  518. gvTemplate = globalTemplateAlteredFunction({
  519. GLOBAL_COVERAGE_SCOPE: T.stringLiteral('return ' + opts.coverageGlobalScope)
  520. });
  521. } else {
  522. gvTemplate = globalTemplateFunction({
  523. GLOBAL_COVERAGE_SCOPE: T.stringLiteral('return ' + opts.coverageGlobalScope)
  524. });
  525. }
  526. } else {
  527. gvTemplate = globalTemplateVariable({
  528. GLOBAL_COVERAGE_SCOPE: opts.coverageGlobalScope
  529. });
  530. }
  531. const cv = coverageTemplate({
  532. GLOBAL_COVERAGE_VAR: T.stringLiteral(opts.coverageVariable),
  533. GLOBAL_COVERAGE_TEMPLATE: gvTemplate,
  534. COVERAGE_FUNCTION: T.identifier(visitState.varName),
  535. PATH: T.stringLiteral(sourceFilePath),
  536. INITIAL: coverageNode,
  537. HASH: T.stringLiteral(hash)
  538. }); // explicitly call this.varName to ensure coverage is always initialized
  539. path.node.body.unshift(T.expressionStatement(T.callExpression(T.identifier(visitState.varName), [])));
  540. path.node.body.unshift(cv);
  541. return {
  542. fileCoverage: coverageData,
  543. sourceMappingURL: visitState.sourceMappingURL
  544. };
  545. }
  546. };
  547. }
  548. var _default = programVisitor;
  549. exports.default = _default;