meta.js 2.8 KB

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