All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.checkerframework.dataflow.cfg.node.AssignmentNode Maven / Gradle / Ivy

Go to download

dataflow-shaded is a dataflow framework based on the javac compiler. It differs from the org.checkerframework:dataflow artifact in two ways. First, the packages in this artifact have been renamed to org.checkerframework.shaded.*. Second, unlike the dataflow artifact, this artifact contains the dependencies it requires.

There is a newer version: 3.42.0-eisop5
Show newest version
package org.checkerframework.dataflow.cfg.node;

import com.sun.source.tree.AssignmentTree;
import com.sun.source.tree.CompoundAssignmentTree;
import com.sun.source.tree.Tree;
import com.sun.source.tree.UnaryTree;
import com.sun.source.tree.VariableTree;

import org.checkerframework.checker.nullness.qual.Nullable;
import org.checkerframework.dataflow.qual.Pure;
import org.checkerframework.dataflow.qual.SideEffectFree;
import org.checkerframework.javacutil.TreeUtils;

import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;

/**
 * A node for an assignment:
 *
 * 
 *   variable = expression
 *   variable += expression
 *   expression . field = expression
 *   expression [ index ] = expression
 * 
* * We allow assignments without corresponding AST {@link Tree}s. * *

Some desugarings create additional assignments to synthetic local variables. Such assignment * nodes are marked as synthetic to allow special handling in transfer functions. * *

String concatenation compound assignments are desugared to an assignment and a string * concatenation. * *

Numeric compound assignments are desugared to an assignment and a numeric operation. */ public class AssignmentNode extends Node { /** The underlying assignment tree. */ protected final Tree tree; /** The node for the LHS of the assignment tree. */ protected final Node lhs; /** The node for the RHS of the assignment tree. */ protected final Node rhs; /** Whether the assignment node is synthetic */ protected final boolean synthetic; /** * Create a (non-synthetic) AssignmentNode. * * @param tree the {@code AssignmentTree} corresponding to the {@code AssignmentNode} * @param target the lhs of {@code tree} * @param expression the rhs of {@code tree} */ public AssignmentNode(Tree tree, Node target, Node expression) { this(tree, target, expression, false); } /** * Create an AssignmentNode. * * @param tree the {@code AssignmentTree} corresponding to the {@code AssignmentNode} * @param target the lhs of {@code tree} * @param expression the rhs of {@code tree} * @param synthetic whether the assignment node is synthetic */ public AssignmentNode(Tree tree, Node target, Node expression, boolean synthetic) { super(TreeUtils.typeOf(tree)); assert tree instanceof AssignmentTree || tree instanceof VariableTree || tree instanceof CompoundAssignmentTree || tree instanceof UnaryTree; assert target instanceof FieldAccessNode || target instanceof LocalVariableNode || target instanceof ArrayAccessNode; this.tree = tree; this.lhs = target; this.rhs = expression; this.synthetic = synthetic; } /** * Returns the left-hand-side of the assignment. * * @return the left-hand-side of the assignment */ @Pure public Node getTarget() { return lhs; } /** * Returns the right-hand-side of the assignment. * * @return the right-hand-side of the assignment */ @Pure public Node getExpression() { return rhs; } @Override @Pure public Tree getTree() { return tree; } /** * Check if the assignment node is synthetic, e.g. the synthetic assignment in a ternary * expression. * * @return true if the assignment node is synthetic */ @Pure public boolean isSynthetic() { return synthetic; } @Override public R accept(NodeVisitor visitor, P p) { return visitor.visitAssignment(this, p); } @Override @Pure public String toString() { return getTarget() + " = " + getExpression() + (synthetic ? " (synthetic)" : ""); } @Override @Pure public boolean equals(@Nullable Object obj) { if (!(obj instanceof AssignmentNode)) { return false; } AssignmentNode other = (AssignmentNode) obj; return getTarget().equals(other.getTarget()) && getExpression().equals(other.getExpression()); } @Override @Pure public int hashCode() { return Objects.hash(getTarget(), getExpression()); } @Override @SideEffectFree public Collection getOperands() { return Arrays.asList(getTarget(), getExpression()); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy