Collaboration diagram for com.cliffc.aa.HM.HM3:

[legend]

Classes
class	Apply

class	Con

class	HMType

class	HMVar

class	Ident

class	Lambda

class	Let

class	Oper

class	Syntax

class	VStack

class	Worklist

Static Public Member Functions
static HMType	hm (Syntax prog)

Static Package Functions
static void	reset ()

Static Package Attributes
static final HashMap< String, HMType >	ENV = new HashMap<>()

Detailed Description

Definition at line 31 of file HM3.java.

Member Function Documentation

◆ hm()

static HMType com.cliffc.aa.HM.HM3.hm ( Syntax prog )

static

Definition at line 34 of file HM3.java.

                                         {
     // Simple types
     HMVar bool  = new HMVar(TypeInt.BOOL);
     HMVar int64 = new HMVar(TypeInt.INT64);
     HMVar flt64 = new HMVar(TypeFlt.FLT64);
     HMVar strp  = new HMVar(TypeMemPtr.STRPTR);
  
     // Primitives
     HMVar var1 = new HMVar();
     HMVar var2 = new HMVar();
     ENV.put("pair",Oper.fun(var1, Oper.fun(var2, new Oper("pair",var1,var2))));
  
     // { pred:bool lhs:var3 rhs:var3 -> var3 }
     HMVar var3 = new HMVar();
     ENV.put("if/else",Oper.fun(bool,Oper.fun(var3,Oper.fun(var3,var3))));
  
     ENV.put("dec",Oper.fun(int64,int64));
     ENV.put("*",Oper.fun(int64,Oper.fun(int64,int64)));
     ENV.put("==0",Oper.fun(int64,bool));
  
     // Print a string; int->str
     ENV.put("str",Oper.fun(int64,strp));
     // Factor
     ENV.put("factor",Oper.fun(flt64,new Oper("pair",flt64,flt64)));
  
  
     // Prep for SSA: pre-gather all the (unique) ids.  Store a linked-list of
     // non-generative IDs (those mid-definition in Lambda & Let, or in the old
     // "nongen" HashSet), for use by Ident.hm.
     final Worklist work = new Worklist();
     prog.get_ids(null,work);
  
     // Worklist:
     int cnt=0;
     while( work.len()>0 ) {     // While not empty
       Syntax s = work.pop();    // Get work
       HMType nnn = s.hm(work);
       if( nnn!=null ) {             // If progress
         s._hm = nnn;                // Move progress state
         s.add_neighbors(work);      // Neighbors get reinspected for progress
       }
       assert prog.check_progress(work); // Everything that can make progress is on the worklist
       cnt++;                            // Which iter count, for debug only
     }
     return prog._hm;
   }