org.graalvm.compiler.core.match

Annotation Type MatchRule

@Retention(value=RUNTIME)
 @Target(value=METHOD)
 @Repeatable(value=MatchRules.class)
public @interface MatchRule

This annotation declares a textual pattern for matching an HIR tree. The format is a LISP style s-expression with node types and/or names that are matched against the HIR. Node types are always uppercase and the names of nodes are always lowercase. Named nodes can be used to match trees where a node is used multiple times but only as an input to the full match.

   <node-name>    := [a-z][a-zA-Z0-9]*
   <node-type>    := [A-Z][a-zA-Z0-9]*
   <node-spec>    := <node-type> { '=' <node-name> }
   <node-or-name> := <node-spec> | <node-name>
   <argument>     := <node-or-name> | <match-rule>
   <match-rule>   := '(' <node-spec> <argument>+ ')'
 

All matched nodes except the root of the match and ConstantNodes must have a single user. All matched nodes must be in the same block.

Required Element Summary

Required Elements

Modifier and Type	Required Element and Description
String	value

Element Detail

value

public abstract String value