X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=Robust%2Fsrc%2FAnalysis%2FPointer%2FPointer.java;h=184cf6511cd3c9b93228fd1f51175512e4c70b70;hb=2c9fc049afee82726ae47ec7ea2630cfe1623f21;hp=8b0ce00bfac302c3987be65ed739192fd9236ab1;hpb=e94f955167b58e9356e2258eac3e66564084129b;p=IRC.git

diff --git a/Robust/src/Analysis/Pointer/Pointer.java b/Robust/src/Analysis/Pointer/Pointer.java
index 8b0ce00b..184cf651 100644
--- a/Robust/src/Analysis/Pointer/Pointer.java
+++ b/Robust/src/Analysis/Pointer/Pointer.java
@@ -468,7 +468,11 @@ nextdelta:
 
     case FKind.FlatCall:
       return processFlatCall(bblock, index, (FlatCall) node, delta, newgraph);
-
+    
+     /* yonghun - 
+      * Pointer Analysis does not care about a flat literal node, just ignores it.
+      * Right now(2011/05/01) we do not attempt to model a flat literal node 
+      * for checking runtime pointers. 
     case FKind.FlatLiteralNode:
       // jjenista - the heap analysis abstraction---when used to verify points-to
       // analysis results against runtime pointers---will eventually need this to
@@ -476,7 +480,8 @@ nextdelta:
       // allocated string.  For now it will pass through like Pointer used to, but
       // the checks versus runtime pointers will fail for string literals.
       return delta;
-
+     */
+      
     default:
       throw new Error("Unrecognized node:"+node + " of kind " + node.kind());
     }