1
0
mirror of https://github.com/danog/PHP-Parser.git synced 2024-12-02 09:17:58 +01:00
PHP-Parser/lib/PHPParser/NodeTraverser.php

120 lines
3.5 KiB
PHP
Raw Normal View History

2011-07-12 17:58:59 +02:00
<?php
class PHPParser_NodeTraverser
{
2011-08-09 09:27:47 +02:00
/**
* @var PHPParser_NodeVisitor[] Visitors
2011-08-09 09:27:47 +02:00
*/
protected $visitors;
2011-07-12 17:58:59 +02:00
/**
* Constructs a node traverser.
*/
public function __construct() {
2011-08-09 09:27:47 +02:00
$this->visitors = array();
2011-07-12 17:58:59 +02:00
}
/**
2011-08-09 09:27:47 +02:00
* Adds a visitor.
2011-07-12 17:58:59 +02:00
*
* @param PHPParser_NodeVisitor $visitor Visitor to add
2011-07-12 17:58:59 +02:00
*/
public function addVisitor(PHPParser_NodeVisitor $visitor) {
2011-08-09 09:27:47 +02:00
$this->visitors[] = $visitor;
2011-07-12 17:58:59 +02:00
}
/**
* Traverses an array of nodes using the registered visitors.
2011-07-12 17:58:59 +02:00
*
* @param PHPParser_Node[] $nodes Array of nodes
*
* @return PHPParser_Node[] Traversed array of nodes
2011-07-12 17:58:59 +02:00
*/
public function traverse(array $nodes) {
2011-08-09 09:27:47 +02:00
foreach ($this->visitors as $visitor) {
if (null !== $return = $visitor->beforeTraverse($nodes)) {
$nodes = $return;
}
2011-08-09 09:27:47 +02:00
}
$nodes = $this->traverseArray($nodes);
2011-08-09 09:27:47 +02:00
foreach ($this->visitors as $visitor) {
if (null !== $return = $visitor->afterTraverse($nodes)) {
$nodes = $return;
}
2011-08-09 09:27:47 +02:00
}
return $nodes;
2011-08-09 09:27:47 +02:00
}
protected function traverseNode(PHPParser_Node $node) {
foreach ($node as $name => $subNode) {
if (is_array($subNode)) {
$node->$name = $this->traverseArray($subNode);
2011-09-21 21:43:19 +02:00
} elseif ($subNode instanceof PHPParser_Node) {
foreach ($this->visitors as $visitor) {
if (null !== $return = $visitor->enterNode($subNode)) {
$node->$name = $return;
}
}
$node->$name = $this->traverseNode($subNode);
foreach ($this->visitors as $visitor) {
if (null !== $return = $visitor->leaveNode($subNode)) {
$node->$name = $return;
}
}
}
}
return $node;
}
protected function traverseArray(array $nodes) {
$doNodes = array();
foreach ($nodes as $i => $node) {
if (is_array($node)) {
$nodes[$i] = $this->traverseArray($node);
} elseif ($node instanceof PHPParser_Node) {
foreach ($this->visitors as $visitor) {
if (null !== $return = $visitor->enterNode($node)) {
$nodes[$i] = $return;
}
}
$nodes[$i] = $this->traverseNode($node);
foreach ($this->visitors as $j => $visitor) {
$return = $visitor->leaveNode($node);
if (false === $return) {
$doNodes[] = array($i, array());
break;
} elseif (is_array($return)) {
// traverse replacement nodes using all visitors apart from the one that
// did the change
unset($this->visitors[$j]);
$return = $this->traverseArray($return);
$this->visitors[$j] = $visitor;
$doNodes[] = array($i, $return);
break;
} elseif (null !== $return) {
$nodes[$i] = $return;
}
}
2011-07-12 17:58:59 +02:00
}
}
if (!empty($doNodes)) {
while (list($i, $replace) = array_pop($doNodes)) {
array_splice($nodes, $i, 1, $replace);
2011-07-12 17:58:59 +02:00
}
}
return $nodes;
2011-07-12 17:58:59 +02:00
}
}