NodeTraverser.php 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  1. <?php
  2. class PHPParser_NodeTraverser implements PHPParser_NodeTraverserInterface
  3. {
  4. /**
  5. * @var PHPParser_NodeVisitor[] Visitors
  6. */
  7. protected $visitors;
  8. /**
  9. * Constructs a node traverser.
  10. */
  11. public function __construct() {
  12. $this->visitors = array();
  13. }
  14. /**
  15. * Adds a visitor.
  16. *
  17. * @param PHPParser_NodeVisitor $visitor Visitor to add
  18. */
  19. public function addVisitor(PHPParser_NodeVisitor $visitor) {
  20. $this->visitors[] = $visitor;
  21. }
  22. /**
  23. * Removes an added visitor.
  24. *
  25. * @param PHPParser_NodeVisitor $visitor
  26. */
  27. public function removeVisitor(PHPParser_NodeVisitor $visitor) {
  28. foreach ($this->visitors as $index => $storedVisitor) {
  29. if ($storedVisitor === $visitor) {
  30. unset($this->visitors[$index]);
  31. break;
  32. }
  33. }
  34. }
  35. /**
  36. * Traverses an array of nodes using the registered visitors.
  37. *
  38. * @param PHPParser_Node[] $nodes Array of nodes
  39. *
  40. * @return PHPParser_Node[] Traversed array of nodes
  41. */
  42. public function traverse(array $nodes) {
  43. foreach ($this->visitors as $visitor) {
  44. if (null !== $return = $visitor->beforeTraverse($nodes)) {
  45. $nodes = $return;
  46. }
  47. }
  48. $nodes = $this->traverseArray($nodes);
  49. foreach ($this->visitors as $visitor) {
  50. if (null !== $return = $visitor->afterTraverse($nodes)) {
  51. $nodes = $return;
  52. }
  53. }
  54. return $nodes;
  55. }
  56. protected function traverseNode(PHPParser_Node $node) {
  57. $node = clone $node;
  58. foreach ($node->getSubNodeNames() as $name) {
  59. $subNode =& $node->$name;
  60. if (is_array($subNode)) {
  61. $subNode = $this->traverseArray($subNode);
  62. } elseif ($subNode instanceof PHPParser_Node) {
  63. foreach ($this->visitors as $visitor) {
  64. if (null !== $return = $visitor->enterNode($subNode)) {
  65. $subNode = $return;
  66. }
  67. }
  68. $subNode = $this->traverseNode($subNode);
  69. foreach ($this->visitors as $visitor) {
  70. if (null !== $return = $visitor->leaveNode($subNode)) {
  71. $subNode = $return;
  72. }
  73. }
  74. }
  75. }
  76. return $node;
  77. }
  78. protected function traverseArray(array $nodes) {
  79. $doNodes = array();
  80. foreach ($nodes as $i => &$node) {
  81. if (is_array($node)) {
  82. $node = $this->traverseArray($node);
  83. } elseif ($node instanceof PHPParser_Node) {
  84. foreach ($this->visitors as $visitor) {
  85. if (null !== $return = $visitor->enterNode($node)) {
  86. $node = $return;
  87. }
  88. }
  89. $node = $this->traverseNode($node);
  90. foreach ($this->visitors as $visitor) {
  91. $return = $visitor->leaveNode($node);
  92. if (false === $return) {
  93. $doNodes[] = array($i, array());
  94. break;
  95. } elseif (is_array($return)) {
  96. $doNodes[] = array($i, $return);
  97. break;
  98. } elseif (null !== $return) {
  99. $node = $return;
  100. }
  101. }
  102. }
  103. }
  104. if (!empty($doNodes)) {
  105. while (list($i, $replace) = array_pop($doNodes)) {
  106. array_splice($nodes, $i, 1, $replace);
  107. }
  108. }
  109. return $nodes;
  110. }
  111. }