Dashboard sipadu mbip
Você não pode selecionar mais de 25 tópicos Os tópicos devem começar com uma letra ou um número, podem incluir traços ('-') e podem ter até 35 caracteres.

meta.js 2.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104
  1. /**
  2. * Copyright (c) 2014-present, Facebook, Inc.
  3. *
  4. * This source code is licensed under the MIT license found in the
  5. * LICENSE file in the root directory of this source tree.
  6. */
  7. import assert from "assert";
  8. import { getTypes } from "./util.js";
  9. import { makeAccessor } from "private";
  10. let m = makeAccessor();
  11. let hasOwn = Object.prototype.hasOwnProperty;
  12. function makePredicate(propertyName, knownTypes) {
  13. function onlyChildren(node) {
  14. const t = getTypes();
  15. t.assertNode(node);
  16. // Assume no side effects until we find out otherwise.
  17. let result = false;
  18. function check(child) {
  19. if (result) {
  20. // Do nothing.
  21. } else if (Array.isArray(child)) {
  22. child.some(check);
  23. } else if (t.isNode(child)) {
  24. assert.strictEqual(result, false);
  25. result = predicate(child);
  26. }
  27. return result;
  28. }
  29. let keys = t.VISITOR_KEYS[node.type];
  30. if (keys) {
  31. for (let i = 0; i < keys.length; i++) {
  32. let key = keys[i];
  33. let child = node[key];
  34. check(child);
  35. }
  36. }
  37. return result;
  38. }
  39. function predicate(node) {
  40. getTypes().assertNode(node);
  41. let meta = m(node);
  42. if (hasOwn.call(meta, propertyName))
  43. return meta[propertyName];
  44. // Certain types are "opaque," which means they have no side
  45. // effects or leaps and we don't care about their subexpressions.
  46. if (hasOwn.call(opaqueTypes, node.type))
  47. return meta[propertyName] = false;
  48. if (hasOwn.call(knownTypes, node.type))
  49. return meta[propertyName] = true;
  50. return meta[propertyName] = onlyChildren(node);
  51. }
  52. predicate.onlyChildren = onlyChildren;
  53. return predicate;
  54. }
  55. let opaqueTypes = {
  56. FunctionExpression: true,
  57. ArrowFunctionExpression: true
  58. };
  59. // These types potentially have side effects regardless of what side
  60. // effects their subexpressions have.
  61. let sideEffectTypes = {
  62. CallExpression: true, // Anything could happen!
  63. ForInStatement: true, // Modifies the key variable.
  64. UnaryExpression: true, // Think delete.
  65. BinaryExpression: true, // Might invoke .toString() or .valueOf().
  66. AssignmentExpression: true, // Side-effecting by definition.
  67. UpdateExpression: true, // Updates are essentially assignments.
  68. NewExpression: true // Similar to CallExpression.
  69. };
  70. // These types are the direct cause of all leaps in control flow.
  71. let leapTypes = {
  72. YieldExpression: true,
  73. BreakStatement: true,
  74. ContinueStatement: true,
  75. ReturnStatement: true,
  76. ThrowStatement: true
  77. };
  78. // All leap types are also side effect types.
  79. for (let type in leapTypes) {
  80. if (hasOwn.call(leapTypes, type)) {
  81. sideEffectTypes[type] = leapTypes[type];
  82. }
  83. }
  84. exports.hasSideEffects = makePredicate("hasSideEffects", sideEffectTypes);
  85. exports.containsLeap = makePredicate("containsLeap", leapTypes);