two methods for generating a reach graph at any desired program point, one is a dummy...

[IRC.git] / Robust / src / IR / Tree / AtomicNode.java

diff --git a/Robust/src/IR/Tree/AtomicNode.java b/Robust/src/IR/Tree/AtomicNode.java
index 465bb2c4603a45bb709f081fb54c5b6e64c4d190..066a4942ed2020688243eff1a2e0bbdb9b684d9a 100644 (file)
--- a/Robust/src/IR/Tree/AtomicNode.java
+++ b/Robust/src/IR/Tree/AtomicNode.java
@@ -1,20 +1,20 @@
 package IR.Tree;
 
 public class AtomicNode extends BlockStatementNode {
-    BlockNode bn;
-    public AtomicNode(BlockNode bn) {
-        this.bn=bn;
-    }
-    
-    public String printNode(int indent) {
-        return printSpace(indent)+"atomic {\n"+bn.printNode(indent)+"\n"+printSpace(indent)+"}";
-    }
+  BlockNode bn;
+  public AtomicNode(BlockNode bn) {
+    this.bn=bn;
+  }
 
-    public BlockNode getBlockNode() {
-        return bn;
-    }
+  public String printNode(int indent) {
+    return printSpace(indent)+"atomic {\n"+bn.printNode(indent)+"\n"+printSpace(indent)+"}";
+  }
 
-    public int kind() {
-        return Kind.AtomicNode;
-    }
+  public BlockNode getBlockNode() {
+    return bn;
+  }
+
+  public int kind() {
+    return Kind.AtomicNode;
+  }
 }