Open alexeyr opened 9 years ago
We can formulate expectations about transformations using graph matching in a form of the method of ProgramGraph
def contains[T](pattern: PatternGraph[T]): Option[Subst]
Where PatternGraph is similar to RRewrite[T]
with only lhs
defined.
Similar to how Rewrite rules now work.
Add
TestPass
which should wrap a graph pass with a test on it, andAbstractGraphPassSuite
(name?) which allowsProgramGraph
tests in simple terms. RewriteSelectiveInvokeTest
using it and see where else it can be used.