2011-07-12 17:58:59 +02:00
|
|
|
<?php
|
|
|
|
|
|
|
|
class PHPParser_NodeTraverser
|
|
|
|
{
|
2011-08-09 09:27:47 +02:00
|
|
|
/**
|
2011-09-24 23:37: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
|
|
|
*
|
2011-09-24 23:37:47 +02:00
|
|
|
* @param PHPParser_NodeVisitor $visitor Visitor to add
|
2011-07-12 17:58:59 +02:00
|
|
|
*/
|
2011-09-24 23:37:47 +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
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2011-09-24 23:37:47 +02:00
|
|
|
* Traverses an array of nodes using the registered visitors.
|
2011-07-12 17:58:59 +02:00
|
|
|
*
|
2011-09-24 23:37:47 +02:00
|
|
|
* @param PHPParser_Node[] $nodes Array of nodes
|
|
|
|
*
|
|
|
|
* @return PHPParser_Node[] Traversed array of nodes
|
2011-07-12 17:58:59 +02:00
|
|
|
*/
|
2011-09-24 23:37:47 +02:00
|
|
|
public function traverse(array $nodes) {
|
2011-08-09 09:27:47 +02:00
|
|
|
foreach ($this->visitors as $visitor) {
|
2011-09-24 23:37:47 +02:00
|
|
|
if (null !== $return = $visitor->beforeTraverse($nodes)) {
|
|
|
|
$nodes = $return;
|
|
|
|
}
|
2011-08-09 09:27:47 +02:00
|
|
|
}
|
|
|
|
|
2011-10-28 23:12:32 +02:00
|
|
|
$nodes = $this->traverseArray($nodes);
|
2011-08-09 09:27:47 +02:00
|
|
|
|
|
|
|
foreach ($this->visitors as $visitor) {
|
2011-09-24 23:37:47 +02:00
|
|
|
if (null !== $return = $visitor->afterTraverse($nodes)) {
|
|
|
|
$nodes = $return;
|
|
|
|
}
|
2011-08-09 09:27:47 +02:00
|
|
|
}
|
2011-09-24 23:37:47 +02:00
|
|
|
|
|
|
|
return $nodes;
|
2011-08-09 09:27:47 +02:00
|
|
|
}
|
|
|
|
|
2011-10-28 23:12:32 +02:00
|
|
|
protected function traverseNode(PHPParser_Node $node) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$node = clone $node;
|
|
|
|
|
|
|
|
foreach ($node->getSubNodeNames() as $name) {
|
|
|
|
$subNode =& $node->$name;
|
|
|
|
|
2011-08-31 21:19:31 +02:00
|
|
|
if (is_array($subNode)) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$subNode = $this->traverseArray($subNode);
|
2011-09-21 21:43:19 +02:00
|
|
|
} elseif ($subNode instanceof PHPParser_Node) {
|
2011-09-24 23:37:47 +02:00
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
if (null !== $return = $visitor->enterNode($subNode)) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$subNode = $return;
|
2011-10-28 23:12:32 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-12-02 17:52:03 +01:00
|
|
|
$subNode = $this->traverseNode($subNode);
|
2011-10-28 23:12:32 +02:00
|
|
|
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
if (null !== $return = $visitor->leaveNode($subNode)) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$subNode = $return;
|
2011-10-28 23:12:32 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return $node;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected function traverseArray(array $nodes) {
|
|
|
|
$doNodes = array();
|
|
|
|
|
2011-12-02 17:52:03 +01:00
|
|
|
foreach ($nodes as $i => &$node) {
|
2011-10-28 23:12:32 +02:00
|
|
|
if (is_array($node)) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$node = $this->traverseArray($node);
|
2011-10-28 23:12:32 +02:00
|
|
|
} elseif ($node instanceof PHPParser_Node) {
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
if (null !== $return = $visitor->enterNode($node)) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$node = $return;
|
2011-09-24 23:37:47 +02:00
|
|
|
}
|
2011-08-09 12:32:18 +02:00
|
|
|
}
|
|
|
|
|
2011-12-02 17:52:03 +01:00
|
|
|
$node = $this->traverseNode($node);
|
2011-08-09 12:32:18 +02:00
|
|
|
|
2012-03-03 17:01:28 +01:00
|
|
|
foreach ($this->visitors as $visitor) {
|
2011-10-28 23:12:32 +02:00
|
|
|
$return = $visitor->leaveNode($node);
|
2011-08-09 12:32:18 +02:00
|
|
|
|
|
|
|
if (false === $return) {
|
2011-10-28 23:12:32 +02:00
|
|
|
$doNodes[] = array($i, array());
|
2011-08-19 17:19:27 +02:00
|
|
|
break;
|
2011-08-09 12:32:18 +02:00
|
|
|
} elseif (is_array($return)) {
|
2011-10-28 23:12:32 +02:00
|
|
|
$doNodes[] = array($i, $return);
|
2011-08-19 17:19:27 +02:00
|
|
|
break;
|
2011-09-24 23:37:47 +02:00
|
|
|
} elseif (null !== $return) {
|
2011-12-02 17:52:03 +01:00
|
|
|
$node = $return;
|
2011-08-09 12:32:18 +02:00
|
|
|
}
|
|
|
|
}
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-19 17:19:27 +02:00
|
|
|
if (!empty($doNodes)) {
|
2011-10-28 23:12:32 +02:00
|
|
|
while (list($i, $replace) = array_pop($doNodes)) {
|
|
|
|
array_splice($nodes, $i, 1, $replace);
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
}
|
2011-09-24 23:37:47 +02:00
|
|
|
|
2011-10-28 23:12:32 +02:00
|
|
|
return $nodes;
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
}
|