| Index: src/compiler/generic-algorithm.h
|
| diff --git a/src/compiler/generic-algorithm.h b/src/compiler/generic-algorithm.h
|
| index c23190e9d7d6d52c3b16aa11355e6807c4fca9e3..cd4984f68cef8c97d75c2e0ba81d3861607ff1db 100644
|
| --- a/src/compiler/generic-algorithm.h
|
| +++ b/src/compiler/generic-algorithm.h
|
| @@ -8,6 +8,7 @@
|
| #include <stack>
|
|
|
| #include "src/compiler/generic-graph.h"
|
| +#include "src/compiler/generic-node.h"
|
| #include "src/zone-containers.h"
|
|
|
| namespace v8 {
|
| @@ -98,12 +99,12 @@ class GenericGraphVisit {
|
| Visit<Visitor, Traits>(graph, zone, &array[0], &array[1], visitor);
|
| }
|
|
|
| - template <class Node>
|
| + template <class B, class S>
|
| struct NullNodeVisitor {
|
| - Control Pre(Node* node) { return CONTINUE; }
|
| - Control Post(Node* node) { return CONTINUE; }
|
| - void PreEdge(Node* from, int index, Node* to) {}
|
| - void PostEdge(Node* from, int index, Node* to) {}
|
| + Control Pre(GenericNode<B, S>* node) { return CONTINUE; }
|
| + Control Post(GenericNode<B, S>* node) { return CONTINUE; }
|
| + void PreEdge(GenericNode<B, S>* from, int index, GenericNode<B, S>* to) {}
|
| + void PostEdge(GenericNode<B, S>* from, int index, GenericNode<B, S>* to) {}
|
| };
|
|
|
| private:
|
|
|