Inheritance diagram for com.cliffc.aa.node.FunNode:

Collaboration diagram for com.cliffc.aa.node.FunNode:

Public Member Functions
	FunNode (NewNode.NewPrimNode prim)

	FunNode (PrimNode prim)

	FunNode (String[] flds, Type[] ts)

Node	add_def (Node n)

void	add_flow_def_extra (Node chg)

void	add_flow_extra (Type old)

void	add_flow_use_extra (Node chg)

void	add_reduce_extra ()

TypeMem	all_live ()

void	bind (String tok)

Node	copy (boolean copy_edges)

void	del (int idx)

Node	do_flow ()

Node	do_grow ()

Node	do_mono ()

Node	do_reduce ()

String	dump (int max)

String	dump (int max, boolean prims, boolean plive)

String	dumprpo (boolean prims, boolean plive)

boolean	equals (Object o)

ErrMsg	err (boolean fast)

Node	find (int uid)

FunPtrNode	fptr ()

Node	get_mem_writer ()

int	hashCode ()

Node	ideal_grow ()

Node	ideal_inline (boolean check_progress)

Node	ideal_mono ()

Node	ideal_reduce ()

Node	in (int i)

Node	init1 ()

Node	insert (int idx, Node n)

void	insert (Node nnn)

Node	is_copy (int idx)

boolean	is_dead ()

boolean	is_forward_ref ()

boolean	is_mem ()

boolean	is_multi_head ()

boolean	is_prim ()

Node	kill ()

int	len ()

TypeMem	live (GVNGCM.Mode opt_mode)

TypeMem	live_use (GVNGCM.Mode opt_mode, Node def)

boolean	live_uses ()

final int	more_flow (boolean lifting)

final boolean	more_ideal (VBitSet bs)

String	name (boolean debug)

int	nargs ()

TV2	new_tvar (String alloc_site)

boolean	noinline ()

byte	op_prec ()

ParmNode	parm (int idx)

Node[]	parms ()

Node	pop ()

Node	remove (int idx)

void	replace (Node old, Node nnn)

RetNode	ret ()

void	set_dead ()

Node	set_def (int idx, Node n)

void	set_nongens (TV2[] nongens)

Type	sharptr (Node mem)

boolean	should_con (Type t)

String	str ()

Node	subsume (Node nnn)

String	toString ()

TV2	tvar ()

TV2	tvar (int x)

void	unelock ()

boolean	unify (boolean test)

Type	val (int idx)

Type	value (GVNGCM.Mode opt_mode)

final void	walk_initype (GVNGCM gvn, VBitSet bs)

void	walk_opt (VBitSet visit)

void	walkerr_def (HashSet< ErrMsg > errs, VBitSet bs)

Node	xliv (GVNGCM.Mode opt_mode)

String	xstr ()

Type	xval ()

Static Public Member Functions
static Node	con (Type t)

static FunNode	find_fidx (int fidx)

static void	init0 ()

static SB	names (BitsFun fidxs, SB sb, boolean debug)

static void	reset ()

static void	reset_to_init0 ()

static void	roll_back_CNT ()

Public Attributes
String	_bal_close

Ary< Node >	_defs

boolean	_elock

int	_fidx

byte	_keep

TypeMem	_live

String	_name

final byte	_op_prec

TypeFunSig	_sig

final boolean	_thunk_rhs

int	_uid

Ary< Node >	_uses

Type	_val

Static Public Attributes
static int	_INIT0_CNT

static int	_must_inline

static final ConcurrentHashMap< Node, Node >	VALS = new ConcurrentHashMap<>()

Package Functions
	FunNode (String name)

	FunNode (String name, TypeFunSig sig, int op_prec, boolean thunk_rhs)

Node	_elock ()

boolean	check_solo_mem_writer (Node memw)

BitsAlias	escapees ()

int	fidx ()

Type	formal (int idx)

boolean	has_unknown_callers ()

boolean	is_CFG ()

Node	is_pure_call ()

public< N extends Node > N	keep ()

public< N extends Node > N	keep (int d)

String	name ()

int	newuid ()

void	set_is_copy ()

Node	stacked_region ()

public< N extends Node > N	unhook ()

public< N extends Node > N	unkeep ()

public< N extends Node > N	unkeep (int d)

void	unwire (int idx)

Node	walk_dom_last (Predicate< Node > P)

Static Package Functions
	[static initializer]

static String	name (String name, String bal, int fidx, int op_prec, boolean fref, boolean debug)

Package Attributes
final byte	_op

TV2	_tvar

Static Package Attributes
static Ary< FunNode >	FUNS = new Ary<>(new FunNode[]{null,})

static final byte	OP_CALL = 1

static final byte	OP_CALLEPI = 2

static final byte	OP_CAST = 3

static final byte	OP_CON = 4

static final byte	OP_CONTYPE = 5

static final byte	OP_CPROJ = 6

static final byte	OP_DEFMEM = 7

static final byte	OP_ERR = 8

static final byte	OP_FP2DISP =10

static final byte	OP_FRESH = 9

static final byte	OP_FUN =11

static final byte	OP_FUNPTR =12

static final byte	OP_IF =13

static final byte	OP_JOIN =14

static final byte	OP_LOAD =15

static final byte	OP_LOOP =16

static final byte	OP_MAX =36

static final byte	OP_NAME =17

static final byte	OP_NEWARY =19

static final byte	OP_NEWOBJ =18

static final byte	OP_NEWSTR =20

static final byte	OP_PARM =21

static final byte	OP_PHI =22

static final byte	OP_PRIM =23

static final byte	OP_PROJ =24

static final byte	OP_REGION =25

static final byte	OP_RET =26

static final byte	OP_SCOPE =27

static final byte	OP_SPLIT =28

static final byte	OP_START =29

static final byte	OP_STMEM =30

static final byte	OP_STORE =31

static final byte	OP_THRET =32

static final byte	OP_THUNK =33

static final byte	OP_TYPE =34

static final byte	OP_UNR =35

Private Member Functions
	FunNode (String name, TypeFunSig sig, int op_prec, boolean thunk_rhs, int fidx)

Node	_do_reduce ()

void	adderr (HashSet< ErrMsg > errs)

boolean	check_callers ()

boolean	check_vals ()

SB	dump (int d, SB sb, boolean plive)

SB	dump (int d, SB sb, int max, VBitSet bs, boolean prims, boolean plive)

void	dump (int d, SB sb, VBitSet bs, boolean plive)

Node	find (int uid, VBitSet bs)

Ary< Node >	find_body (RetNode ret)

Type[]	find_type_split (Node[] parms)

int	find_type_split_index (Node[] parms)

boolean	is_multi_tail ()

FunNode	make_new_fun (RetNode ret, TypeTuple new_formals)

Node	merge (Node x)

int	more_flow (boolean lifting, int errs)

void	postorder (Ary< Node > nodes, VBitSet bs)

void	split_callers (RetNode oldret, FunNode fun, Ary< Node > body, int path)

int	split_size (Ary< Node > body, Node[] parms)

TypeTuple	type_special (Node[] parms)

Node	unuse (Node old)

Static Private Member Functions
static void	_header (FunNode fun, SB sb)

static boolean	bad_mem_use (Node n, TypeObj to)

static String	name (int fidx, boolean debug)

Private Attributes
byte	_cnt_size_inlines

TV2[]	_nongens

Static Private Attributes
static int	CNT =1

static final VBitSet	FLOW_VISIT = new VBitSet()

static final VBitSet	LIVE = new VBitSet()

static final String[]	STRS = new String[] { null, "Call", "CallEpi", "Cast", "Con", "ConType", "CProj", "DefMem", "Err", "Fresh", "FP2Disp", "Fun", "FunPtr", "If", "Join", "Load", "Loop", "Name", "NewObj", "NewAry", "NewStr", "Parm", "Phi", "Prim", "Proj", "Region", "Return", "Scope","Split", "Start", "StartMem", "Store", "Thret", "Thunk", "Type", "Unresolved" }

Detailed Description

Definition at line 58 of file FunNode.java.

Constructor & Destructor Documentation

◆ FunNode() [1/6]

com.cliffc.aa.node.FunNode.FunNode ( PrimNode prim )

Definition at line 78 of file FunNode.java.

78 { this(prim._name,prim._sig,prim._op_prec,prim._thunk_rhs); }

References com.cliffc.aa.node.PrimNode._name, com.cliffc.aa.node.PrimNode._op_prec, com.cliffc.aa.node.PrimNode._sig, and com.cliffc.aa.node.PrimNode._thunk_rhs.

Referenced by com.cliffc.aa.node.FunNode.make_new_fun().

Here is the caller graph for this function:

◆ FunNode() [2/6]

com.cliffc.aa.node.FunNode.FunNode ( NewNode.NewPrimNode prim )

Definition at line 79 of file FunNode.java.

79 { this(prim._name,prim._sig,prim._op_prec,false); }

◆ FunNode() [3/6]

com.cliffc.aa.node.FunNode.FunNode	(	String[]	flds,
		Type[]	ts
	)

Definition at line 81 of file FunNode.java.

81 { this(null,TypeFunSig.make(flds,TypeTuple.make_args(ts),TypeTuple.RET),-1,false); }

References com.cliffc.aa.type.TypeFunSig.make(), com.cliffc.aa.type.TypeTuple.make_args(), and com.cliffc.aa.type.TypeTuple.RET.

Here is the call graph for this function:

◆ FunNode() [4/6]

com.cliffc.aa.node.FunNode.FunNode ( String name )

package

Definition at line 83 of file FunNode.java.

83 { this(name,TypeFunSig.make(TypeTuple.RET,TypeTuple.NO_ARGS),-2,false); add_def(Env.ALL_CTRL); }

References com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.Env.ALL_CTRL, com.cliffc.aa.type.TypeFunSig.make(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.type.TypeTuple.NO_ARGS, and com.cliffc.aa.type.TypeTuple.RET.

Here is the call graph for this function:

◆ FunNode() [5/6]

com.cliffc.aa.node.FunNode.FunNode	(	String	name,
		TypeFunSig	sig,
		int	op_prec,
		boolean	thunk_rhs
	)

package

Definition at line 85 of file FunNode.java.

85 { this(name,sig,op_prec,thunk_rhs,BitsFun.new_fidx()); }

References com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.type.BitsFun.new_fidx(), and com.cliffc.aa.node.Node.op_prec().

Here is the call graph for this function:

◆ FunNode() [6/6]

com.cliffc.aa.node.FunNode.FunNode	(	String	name,
		TypeFunSig	sig,
		int	op_prec,
		boolean	thunk_rhs,
		int	fidx
	)

private

Definition at line 87 of file FunNode.java.

                                                                                          {
     super(OP_FUN);
     _name = name;
     _fidx = fidx;
     _sig = sig;
     _op_prec = (byte)op_prec;
     _thunk_rhs = thunk_rhs;
     FUNS.setX(fidx(),this); // Track FunNode by fidx; assert single-bit fidxs
     keep();                 // Always keep, until RetNode is constructed
   }

References com.cliffc.aa.node.FunNode._fidx, com.cliffc.aa.node.FunNode._name, com.cliffc.aa.node.FunNode._op_prec, com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.node.FunNode._thunk_rhs, com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.FUNS, com.cliffc.aa.node.Node.keep(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.Node.OP_FUN, and com.cliffc.aa.node.Node.op_prec().

Here is the call graph for this function:

Member Function Documentation

◆ [static initializer]()

com.cliffc.aa.node.Node.[static initializer]

staticpackageinherited

◆ _do_reduce()

Node com.cliffc.aa.node.Node._do_reduce ( )

privateinherited

Definition at line 570 of file Node.java.

                             {
     // Replace with a constant, if possible
     if( should_con(_val) )
       return con(_val);
  
     // Try CSE
     if( !_elock ) {             // Not in VALS
       Node x = VALS.get(this);  // Try VALS
       if( x != null )           // Hit
         return merge(x);        // Graph replace with x
     }
  
     // Try general ideal call
     Node x = ideal_reduce();    // Try the general reduction
     if( x != null )
       return merge(x);          // Graph replace with x
  
     return null;                // No change
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.Node.ideal_reduce(), com.cliffc.aa.node.Node.merge(), com.cliffc.aa.node.Node.should_con(), and com.cliffc.aa.node.Node.VALS.

Referenced by com.cliffc.aa.node.Node.do_reduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _elock()

Node com.cliffc.aa.node.Node._elock ( )

packageinherited

Definition at line 137 of file Node.java.

                 {               // No assert version, used for new nodes
     assert check_vals();        // elock & VALs match
     if( !_elock && VALS.get(this)==null ) { _elock = true; VALS.put(this,this); }
     return this;
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node.check_vals(), and com.cliffc.aa.node.Node.VALS.

Here is the call graph for this function:

◆ _header()

static void com.cliffc.aa.node.Node._header	(	FunNode	fun,
		SB	sb
	)

staticprivateinherited

Definition at line 380 of file Node.java.

                                                   {
     sb.p("============ ").p(fun==null?"null":fun.name()).p(" ============").nl();
   }

References com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.util.SB.nl(), and com.cliffc.aa.util.SB.p().

Referenced by com.cliffc.aa.node.Node.dumprpo().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ add_def()

Node com.cliffc.aa.node.Node.add_def ( Node n )

inherited

Definition at line 152 of file Node.java.

152 { unelock(); _defs.add(n); if( n!=null ) n._uses.add(this); return this; }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.Node.unelock().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ add_flow_def_extra()

void com.cliffc.aa.node.RegionNode.add_flow_def_extra ( Node chg )

inherited

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 70 of file RegionNode.java.

                                                      {
     if( chg.is_CFG() ) {           // If losing an extra CFG user
       for( Node use : _uses )
         if( use._op == OP_REGION ) // Then stacked regions can fold
           Env.GVN.add_reduce(use); // Put lower region of stack on worklist
       if( this instanceof FunNode && ((FunNode)this).ret()==null )
         Env.GVN.add_reduce(this);
     }
   }

References com.cliffc.aa.node.Node._uses, com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.is_CFG(), and com.cliffc.aa.node.Node.OP_REGION.

Here is the call graph for this function:

◆ add_flow_extra()

void com.cliffc.aa.node.Node.add_flow_extra ( Type old )

inherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.CastNode, and com.cliffc.aa.node.FreshNode.

Definition at line 513 of file Node.java.

513 { }

Referenced by com.cliffc.aa.node.Node.do_flow(), and com.cliffc.aa.GVNGCM.gcp().

Here is the caller graph for this function:

◆ add_flow_use_extra()

void com.cliffc.aa.node.RegionNode.add_flow_use_extra ( Node chg )

inherited

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 131 of file RegionNode.java.

                                                      {
     Env.GVN.add_reduce(this);
     for( Node phi : _uses )
       if( phi instanceof PhiNode ) {
         Env.GVN.add_flow(phi);
         Env.GVN.add_flow_defs(phi); // Inputs to Phi change liveness
       }
   }

References com.cliffc.aa.node.Node._uses, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_flow_defs(), com.cliffc.aa.GVNGCM.add_reduce(), and com.cliffc.aa.Env.GVN.

Here is the call graph for this function:

◆ add_reduce_extra()

void com.cliffc.aa.node.Node.add_reduce_extra ( )

inherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.NewNode< T extends TypeObj< T >, and com.cliffc.aa.node.MemSplitNode.

Definition at line 517 of file Node.java.

517 { }

Referenced by com.cliffc.aa.node.Node.do_reduce().

Here is the caller graph for this function:

◆ adderr()

void com.cliffc.aa.node.Node.adderr ( HashSet< ErrMsg > errs )

privateinherited

Definition at line 789 of file Node.java.

                                               {
     ErrMsg msg = err(false);
     if( msg==null ) return;
     msg._order = errs.size();
     errs.add(msg);
   }

References com.cliffc.aa.node.Node.ErrMsg._order, and com.cliffc.aa.node.Node.err().

Referenced by com.cliffc.aa.node.Node.walkerr_def().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ all_live()

TypeMem com.cliffc.aa.node.RegionNode.all_live ( )

inherited

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 140 of file RegionNode.java.

140 { return TypeMem.ALIVE; }

References com.cliffc.aa.type.TypeMem.ALIVE.

◆ bad_mem_use()

static boolean com.cliffc.aa.node.FunNode.bad_mem_use	(	Node	n,
		TypeObj	to
	)

staticprivate

Definition at line 407 of file FunNode.java.

                                                           {
     for( Node use : n._uses ) {
       switch( use._op ) {
       case OP_NEWOBJ: break; // Field use is like store.value use
       case OP_IF: break;     // Zero check is ok
       case OP_CAST:          // Cast propagates check
       case OP_FRESH:         // No value change
         if( bad_mem_use(use, to) ) return true;
         break;
       case OP_LOAD:
         if( !(to instanceof TypeStruct) ||
             ((LoadNode)use).find((TypeStruct)to)== -1 )
           return true;          // Did not find field
         break;
       case OP_STORE:
         if( ((StoreNode)use).rez()==n) break; // Storing as value is ok
         if( !(to instanceof TypeStruct) ||    // Address needs to find field
             ((StoreNode)use).find((TypeStruct)to)== -1 )
           return true;          // Did not find field
         break;
       case OP_CALL: break; // Argument pass-thru probably needs to check formals
       case OP_RET: break;  // Return pass-thru should be ok
       case OP_NEWSTR:
         TypeFunSig sig = ((NewStrNode)use)._sig;
         Type formal = sig._formals.at(use._defs.find(n)-2);
         if( !TypeMemPtr.OOP0.dual().isa(formal) )
           return true;
         break;
       case OP_NAME: break; // Pointer to a nameable struct
       case OP_PRIM:
         if( use instanceof PrimNode.EQ_OOP ) break;
         if( use instanceof PrimNode.NE_OOP ) break;
         if( use instanceof MemPrimNode.LValueLength ) break;
         if( use instanceof MemPrimNode.LValueRead )
           if( ((MemPrimNode)use).idx() == n ) return true; // Use as index is broken
           else break;   // Use for array base is fine
         if( use instanceof MemPrimNode.LValueWrite || use instanceof MemPrimNode.LValueWriteFinal )
           if( ((MemPrimNode)use).idx() == n ) return true; // Use as index is broken
           else break;   // Use for array base or value is fine
         if( use instanceof PrimNode.MulF64 ) return true;
         if( use instanceof PrimNode.MulI64 ) return true;
         if( use instanceof PrimNode.AndI64 ) return true;
         if( use instanceof PrimNode.EQ_F64 ) return true;
         if( use instanceof PrimNode.EQ_I64 ) return true;
         throw unimpl();
       default: throw unimpl();
       }
     }
     return false;
   }

Referenced by com.cliffc.aa.node.FunNode.find_type_split().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ bind()

void com.cliffc.aa.node.FunNode.bind ( String tok )

Definition at line 172 of file FunNode.java.

                                  {
     if( _name==null ) _name = tok;
     if( !_name.equals(tok) ) // Attempt to double-bind
       _name = _name+":"+tok;
   }

References com.cliffc.aa.node.FunNode._name.

Referenced by com.cliffc.aa.node.FunPtrNode.bind().

Here is the caller graph for this function:

◆ check_callers()

boolean com.cliffc.aa.node.FunNode.check_callers ( )

private

Definition at line 311 of file FunNode.java.

                                    {
     // No dead input paths
     for( int i=1; i<_defs._len; i++ ) if( val(i)==Type.XCTRL && !in(i).is_prim() ) return false;
     // Gather the ParmNodes and the RetNode.  Ignore other (control) uses
     Node ret=null;
     for( Node use : _uses )
       if( use instanceof RetNode ) {
         if( ret!=null && ret!=use ) return false;
         ret = use;
       }
     return true;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.is_prim(), com.cliffc.aa.node.FunNode.ret(), com.cliffc.aa.node.Node.val(), and com.cliffc.aa.type.Type< T extends Type< T >.XCTRL.

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ check_solo_mem_writer()

boolean com.cliffc.aa.node.Node.check_solo_mem_writer ( Node memw )

packageinherited

Definition at line 845 of file Node.java.

                                            {
     if( is_prim() ) return true; // Several top-level memory primitives, including top scope & defmem blow this
     boolean found=false;
     for( Node use : _uses )
       if( use == memw ) found=true; // Only memw mem-writer follows
       else if( use.is_mem() ) return false; // Found a 2nd mem-writer
     return found;
   }

References com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.Node.is_prim().

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_above(), com.cliffc.aa.node.MemSplitNode.check_split(), com.cliffc.aa.node.StoreNode.ideal_grow(), and com.cliffc.aa.node.MemJoinNode.ideal_mono().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ check_vals()

boolean com.cliffc.aa.node.Node.check_vals ( )

privateinherited

Definition at line 143 of file Node.java.

                                 {
     Node x = VALS.get(this), old=null;
     if( x == this ) old=this;   // Found in table quickly
     // Hunt the hard way
     else for( Node o : VALS.keySet() ) if( o._uid == _uid ) { old=o; break; }
     return (old!=null) == _elock;
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._uid, and com.cliffc.aa.node.Node.VALS.

Referenced by com.cliffc.aa.node.Node._elock(), com.cliffc.aa.node.Node.do_reduce(), and com.cliffc.aa.node.Node.unelock().

Here is the caller graph for this function:

◆ con()

static Node com.cliffc.aa.node.Node.con ( Type t )

staticinherited

Definition at line 670 of file Node.java.

                                             {
     assert t==t.simple_ptr();
     Node con;
     if( t instanceof TypeFunPtr && ((TypeFunPtr)t)._fidxs.abit()!=-1 )
       con = new FunPtrNode(FunNode.find_fidx(((TypeFunPtr)t).fidx()).ret(),Env.ANY);
     else
       con = new ConNode<>(t);
     Node con2 = VALS.get(con);
     if( con2 != null ) {        // Found a prior constant
       con.kill();               // Kill the just-made one
       con = con2;
       con._live = TypeMem.LIVE_BOT; // Adding more liveness
     } else {                        // New constant
       con._val = t;                 // Typed
       con._elock(); // Put in VALS, since if Con appears once, probably appears again in the same XFORM call
     }
     Env.GVN.add_flow(con);      // Updated live flows
     return con;
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._live, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.Env.ANY, com.cliffc.aa.node.FunNode.find_fidx(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.kill(), com.cliffc.aa.type.TypeMem.LIVE_BOT, com.cliffc.aa.node.FunNode.ret(), com.cliffc.aa.type.Type< T extends Type< T >.simple_ptr(), and com.cliffc.aa.node.Node.VALS.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ copy()

Node com.cliffc.aa.node.FunNode.copy ( boolean copy_edges )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 182 of file FunNode.java.

182 { throw unimpl(); }

◆ del()

void com.cliffc.aa.node.Node.del ( int idx )

inherited

Definition at line 169 of file Node.java.

                              {
     unelock();
     Node n = _defs.del(idx);
     if( n != null ) n._uses.del(this);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.Node.unelock().

Referenced by com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.CallEpiNode.unwire().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ do_flow()

Node com.cliffc.aa.node.Node.do_flow ( )

inherited

Definition at line 592 of file Node.java.

                         {
     Node progress=null;
     // Compute live bits.  If progress, push the defs on the flow worklist.
     // This is a reverse flow computation.  Always assumed live if keep.
     if( _keep==0 ) {
       TypeMem oliv = _live;
       TypeMem nliv = live(Env.GVN._opt_mode);
       if( oliv != nliv ) {        // Progress?
         progress = this;          // Progress!
         assert nliv.isa(oliv);    // Monotonically improving
         _live = nliv;             // Record progress
         for( Node def : _defs )   // Put defs on worklist... liveness flows uphill
           if( def != null ) Env.GVN.add_flow(def).add_flow_def_extra(this);
         add_flow_extra(oliv);
       }
     }
  
     // Compute best value.  If progress, push uses on the flow worklist.
     // This is a forward flow computation.
     Type oval = _val; // Get old type
     Type nval = value(Env.GVN._opt_mode);// Get best type
     if( nval!=oval ) {
       progress = this;          // Progress!
       assert nval.isa(oval);    // Monotonically improving
       _val = nval;
       // If becoming a constant, check for replacing with a ConNode
       if( !oval.may_be_con() && nval.may_be_con() ) {
         Env.GVN.add_reduce(this);
         Env.GVN.add_flow_defs(this); // Since a constant, inputs are no longer live
       }
       // Put uses on worklist... values flows downhill
       for( Node use : _uses )
         Env.GVN.add_flow(use).add_flow_use_extra(this);
       // Progressing on CFG can mean CFG paths go dead
       if( is_CFG() ) for( Node use : _uses ) if( use.is_CFG() ) Env.GVN.add_reduce(use);
       add_flow_extra(oval);
     }
     return progress;
   }

Referenced by com.cliffc.aa.node.DefMemNode.make_mem(), and com.cliffc.aa.GVNGCM.xreduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ do_grow()

Node com.cliffc.aa.node.Node.do_grow ( )

inherited

Definition at line 639 of file Node.java.

                         {
     Node nnn = ideal_grow();
     if( nnn==null || nnn==this || is_dead() ) return nnn;
     assert _keep<=1;
     if( _keep==1 ) { _keep--; nnn._keep++; Env.GVN.add_dead(this); } // Doing an arbitrary replacement
     return Env.GVN.add_flow(Env.GVN.add_reduce(nnn));
   }

References com.cliffc.aa.node.Node._keep, com.cliffc.aa.GVNGCM.add_dead(), com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.ideal_grow(), and com.cliffc.aa.node.Node.is_dead().

Referenced by com.cliffc.aa.node.Node.more_ideal().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ do_mono()

Node com.cliffc.aa.node.Node.do_mono ( )

inherited

Definition at line 632 of file Node.java.

                         {
     Node x= ideal_mono();
     if( x==null ) return null;
     assert x==this;
     return Env.GVN.add_mono(Env.GVN.add_flow(Env.GVN.add_reduce(x)));
   }

References com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_mono(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.ideal_mono().

Referenced by com.cliffc.aa.node.Node.more_ideal().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ do_reduce()

Node com.cliffc.aa.node.Node.do_reduce ( )

inherited

Definition at line 545 of file Node.java.

                           {
     assert check_vals();
     Node nnn = _do_reduce();
     if( nnn!=null ) {                   // Something happened
       if( nnn!=this ) {                 // Replacement
         assert _keep<=1;                // Can only replace if zero or one
         Env.GVN.add_flow_uses(this);    // Visit users
         add_reduce_extra();
         if( _keep==1 ) { _keep--; nnn._keep++; } // Move keep bits over
         subsume(nnn);                   // Replace
         for( Node use : nnn._uses ) {
           use.add_reduce_extra();
           use.add_flow_use_extra(nnn);
         }
       }
       Env.GVN.add_reduce(nnn);  // Rerun the replacement
       return nnn._elock();      // After putting in VALS
     }
     // No progress; put in VALS and return
     _elock();
     return null;
   }

References com.cliffc.aa.node.Node._do_reduce(), com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.add_flow_use_extra(), com.cliffc.aa.GVNGCM.add_flow_uses(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.node.Node.add_reduce_extra(), com.cliffc.aa.node.Node.check_vals(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.subsume().

Referenced by com.cliffc.aa.node.Node.more_ideal(), com.cliffc.aa.GVNGCM.Build< N extends Node >.xform(), and com.cliffc.aa.GVNGCM.xreduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dump() [1/5]

SB com.cliffc.aa.node.Node.dump	(	int	d,
		SB	sb,
		boolean	plive
	)

privateinherited

Definition at line 290 of file Node.java.

                                                  {
     String xs = String.format("%s%4d: %-7.7s ",plive ? _live : "",_uid,xstr());
     sb.i(d).p(xs);
     if( is_dead() ) return sb.p("DEAD");
     for( Node n : _defs ) sb.p(n == null ? "____ " : String.format("%4d ",n._uid));
     sb.p(" [[");
     for( Node n : _uses ) sb.p(String.format("%4d ",n._uid));
     sb.p("]]  ");
     sb.p(str()).s();
     if( _val==null ) sb.p("----");
     else _val.str(sb,new VBitSet(),null,true);
  
     return sb;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._live, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.util.SB.i(), com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.util.SB.p(), com.cliffc.aa.util.SB.s(), com.cliffc.aa.type.Type< T extends Type< T >.str(), com.cliffc.aa.node.Node.str(), and com.cliffc.aa.node.Node.xstr().

Here is the call graph for this function:

◆ dump() [2/5]

SB com.cliffc.aa.node.Node.dump	(	int	d,
		SB	sb,
		int	max,
		VBitSet	bs,
		boolean	prims,
		boolean	plive
	)

privateinherited

Definition at line 310 of file Node.java.

                                                                                      {
     if( bs.tset(_uid) ) return sb;
     if( d < max ) {    // Limit at depth
       // Print parser scopes first (deepest)
       for( Node n : _defs ) if( n instanceof ScopeNode ) n.dump(d+1,sb,max,bs,prims,plive);
       // Print constants early
       for( Node n : _defs ) if( n instanceof ConNode ) n.dump(d+1,sb,max,bs,prims,plive);
       // Do not recursively print root Scope, nor Unresolved of primitives.
       // These are too common, and uninteresting.
       for( Node n : _defs ) if( n != null && (!prims && n.is_prim() && n._defs._len > 3) ) bs.set(n._uid);
       // Recursively print most of the rest, just not the multi-node combos and
       // Unresolve & FunPtrs.
       for( Node n : _defs )
         if( n != null && !n.is_multi_head() && !n.is_multi_tail() &&
             !(n instanceof UnresolvedNode) && !(n instanceof FunPtrNode) )
           n.dump(d+1,sb,max,bs,prims,plive);
       // Print Unresolved and FunPtrs, which typically catch whole functions.
       for( Node n : _defs )
         if( (n instanceof UnresolvedNode) || (n instanceof FunPtrNode) )
           n.dump(d+1,sb,max,bs,prims,plive);
       // Print anything not yet printed, including multi-node combos
       for( Node n : _defs ) if( n != null && !n.is_multi_head() ) n.dump(d+1,sb,max,bs,prims,plive);
       for( Node n : _defs ) if( n != null ) n.dump(d+1,sb,max,bs,prims,plive);
     }
     // Print multi-node combos all-at-once, including all tails even if they
     // exceed the depth limit by 1.
     Node x = is_multi_tail() ? in(0) : this;
     if( x != null && x.is_multi_head() ) {
       int dx = d+(x==this?0:1);
       // Print all tails paths, all at once - nothing recursively below the tail
       for( Node n : x._uses )
         if( n.is_multi_tail() )
           for( Node m : n._defs )
             if( dx<max) m.dump(dx+1,sb,max,bs,prims,plive);
       if( x==this ) bs.clear(_uid); // Reset for self, so prints right now
       x.dump(dx,sb,bs,plive); // Conditionally print head of combo
       // Print all combo tails, if not already printed
       if( x!=this ) bs.clear(_uid); // Reset for self, so prints in the mix below
       for( Node n : x._uses ) if( n.is_multi_tail() ) n.dump(dx-1,sb,bs,plive);
       return sb;
     } else { // Neither combo head nor tail, just print
       return dump(d,sb,plive).nl();
     }
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.dump(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.Node.is_multi_tail(), and com.cliffc.aa.util.VBitSet.tset().

Here is the call graph for this function:

◆ dump() [3/5]

void com.cliffc.aa.node.Node.dump	(	int	d,
		SB	sb,
		VBitSet	bs,
		boolean	plive
	)

privateinherited

Definition at line 305 of file Node.java.

                                                              {
     if( bs.tset(_uid) ) return;
     dump(d,sb,plive).nl();
   }

References com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node.dump(), and com.cliffc.aa.util.VBitSet.tset().

Here is the call graph for this function:

◆ dump() [4/5]

String com.cliffc.aa.node.Node.dump ( int max )

inherited

Definition at line 286 of file Node.java.

286 { return dump(max,is_prim(),false); }

References com.cliffc.aa.node.Node.dump(), and com.cliffc.aa.node.Node.is_prim().

Referenced by com.cliffc.aa.Parse.dump(), com.cliffc.aa.node.Node.dump(), com.cliffc.aa.node.Node.dumprpo(), com.cliffc.aa.node.Node.more_flow(), and com.cliffc.aa.node.Node.toString().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dump() [5/5]

String com.cliffc.aa.node.Node.dump	(	int	max,
		boolean	prims,
		boolean	plive
	)

inherited

Definition at line 288 of file Node.java.

288 { return dump(0, new SB(),max,new VBitSet(),prims,plive).toString(); }

References com.cliffc.aa.node.Node.dump().

Referenced by com.cliffc.aa.node.Node.dump().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dumprpo()

String com.cliffc.aa.node.Node.dumprpo	(	boolean	prims,
		boolean	plive
	)

inherited

Definition at line 358 of file Node.java.

                                                         {
     Ary<Node> nodes = new Ary<>(new Node[1],0);
     postorder(nodes,new VBitSet());
     // Dump in reverse post order
     SB sb = new SB();
     Node prior = null;
     for( int i=nodes._len-1; i>=0; i-- ) {
       Node n = nodes.at(i);
       if( !(n._uid <= Env.ALL_CTRL._uid || !n.is_prim() || prims) )
         continue;               // Visited, but do not print
       // Add a nl after the last of a multi-tail sequence.
       if( (prior != null && prior.is_multi_tail() && !n.is_multi_tail()) ||
           // Add a nl before the start of a multi-head sequence.
           n.is_multi_head() )
         sb.nl();
       if( n._op==OP_FUN ) _header((FunNode)n,sb);
       n.dump(0,sb,plive).nl();
       if( n._op==OP_RET && n.in(4) instanceof FunNode ) _header((FunNode)n.in(4),sb);
       prior = n;
     }
     return sb.toString();
   }

References com.cliffc.aa.node.Node._header(), com.cliffc.aa.util.Ary< E >._len, com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node._uid, com.cliffc.aa.Env.ALL_CTRL, com.cliffc.aa.util.Ary< E >.at(), com.cliffc.aa.node.Node.dump(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.Node.is_multi_tail(), com.cliffc.aa.node.Node.is_prim(), com.cliffc.aa.util.SB.nl(), com.cliffc.aa.node.Node.OP_FUN, com.cliffc.aa.node.Node.OP_RET, com.cliffc.aa.node.Node.postorder(), and com.cliffc.aa.util.SB.toString().

Referenced by com.cliffc.aa.Parse.dumprpo().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ equals()

boolean com.cliffc.aa.node.FunNode.equals ( Object o )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 917 of file FunNode.java.

917 { return this==o; } // Only one

◆ err()

ErrMsg com.cliffc.aa.node.Node.err ( boolean fast )

inherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.LoadNode, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.MemPrimNode.LValueWriteFinal, com.cliffc.aa.node.PrimNode.ConvertTypeName, com.cliffc.aa.node.PrimNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.IntrinsicNode, com.cliffc.aa.node.AssertNode, com.cliffc.aa.node.ParmNode, com.cliffc.aa.node.PhiNode, com.cliffc.aa.node.ErrNode, and com.cliffc.aa.node.MemPrimNode.

Definition at line 526 of file Node.java.

526 { return null; }

Referenced by com.cliffc.aa.node.Node.adderr(), com.cliffc.aa.node.ScopeNode.IfScope.check(), com.cliffc.aa.node.Node.ErrMsg.equals(), com.cliffc.aa.node.Node.live_uses(), and com.cliffc.aa.node.Node.should_con().

Here is the caller graph for this function:

◆ escapees()

BitsAlias com.cliffc.aa.node.Node.escapees ( )

packageinherited

Reimplemented in com.cliffc.aa.node.CallEpiNode, com.cliffc.aa.node.CallNode, com.cliffc.aa.node.MemJoinNode, com.cliffc.aa.node.MemSplitNode, com.cliffc.aa.node.MemPrimNode.WritePrimNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.IntrinsicNode, com.cliffc.aa.node.NewNode< T extends TypeObj< T >, com.cliffc.aa.node.PhiNode, com.cliffc.aa.node.MrgProjNode, and com.cliffc.aa.node.MProjNode.

Definition at line 859 of file Node.java.

859 { throw unimpl("graph error"); }

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_above(), com.cliffc.aa.node.MemJoinNode.add_alias_below_new(), com.cliffc.aa.node.MemSplitNode.check_split(), com.cliffc.aa.node.MProjNode.escapees(), com.cliffc.aa.node.MrgProjNode.escapees(), com.cliffc.aa.node.IntrinsicNode.escapees(), and com.cliffc.aa.node.MemSplitNode.insert_split().

Here is the caller graph for this function:

◆ fidx()

int com.cliffc.aa.node.FunNode.fidx ( )

package

Definition at line 102 of file FunNode.java.

102 { return _fidx; }

References com.cliffc.aa.node.FunNode._fidx.

Referenced by com.cliffc.aa.node.FunNode.find_fidx(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.names(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.FunNode.split_size().

Here is the caller graph for this function:

◆ find() [1/2]

Node com.cliffc.aa.node.Node.find ( int uid )

inherited

Definition at line 427 of file Node.java.

427 { return find(uid,new VBitSet()); }

References com.cliffc.aa.node.Node.find().

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), and com.cliffc.aa.node.Node.find().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find() [2/2]

Node com.cliffc.aa.node.Node.find	(	int	uid,
		VBitSet	bs
	)

privateinherited

Definition at line 428 of file Node.java.

                                            {
     if( _uid==uid ) return this;
     if( bs.tset(_uid) || is_dead() ) return null;
     Node m;
     for( Node n : _defs ) if( n!=null && (m=n.find(uid,bs)) !=null ) return m;
     for( Node n : _uses ) if(            (m=n.find(uid,bs)) !=null ) return m;
     return null;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.find(), com.cliffc.aa.node.Node.is_dead(), and com.cliffc.aa.util.VBitSet.tset().

Here is the call graph for this function:

◆ find_body()

Ary<Node> com.cliffc.aa.node.FunNode.find_body ( RetNode ret )

private

Definition at line 478 of file FunNode.java.

                                              {
     // Find the function body.  Do a forwards walk first, stopping at the
     // obvious function exit.  If function does not expose its display then
     // this is the complete function body with nothing extra walked.  If it has
     // a nested function or returns a nested function then its display is may
     // be reached by loads & stores from outside the function.
     //
     // Then do a backwards walk, intersecting with the forwards walk.  A
     // backwards walk will find upwards-exposed values, typically constants and
     // display references - could be a lot of them.  Minor opt to do the
     // forward walk first.
     VBitSet freached = new VBitSet(); // Forwards reached
     Ary<Node> work = new Ary<>(new Node[1],0);
     work.add(this);             // Prime worklist
     while( !work.isEmpty() ) {  // While have work
       Node n = work.pop();      // Get work
       int op = n._op;           // opcode
       if( op == OP_FUN  && n       != this ) continue; // Call to other function, not part of inlining
       if( op == OP_PARM && n.in(0) != this ) continue; // Arg  to other function, not part of inlining
       if( op == OP_DEFMEM ) continue;       // Never part of body, but reachable from all allocations
       if( op == OP_RET && n != ret ) continue; // Return (of other function)
       // OP_FUNPTR: Can be reached from an internal NewObjNode/display, or
       // following the local Return.  The local FunPtrs are added below.
       // Adding the reached FunPtrs here clones them, making new FunPtrs using
       // either the old or new display.
       if( freached.tset(n._uid) ) continue; // Already visited?
       if( op == OP_RET ) continue;          // End of this function
       if( n instanceof ProjNode && n.in(0) instanceof CallNode ) continue; // Wired call; all projs lead to other functions
       work.addAll(n._uses);   // Visit all uses
     }
  
     // Backwards walk, trimmed to reachable from forwards
     VBitSet breached = new VBitSet(); // Backwards and forwards reached
     Ary<Node> body = new Ary<>(new Node[1],0);
     for( Node use : ret._uses ) // Include all FunPtrs as part of body
       if( use instanceof FunPtrNode )
         body.push(use);
     work.add(ret);
     while( !work.isEmpty() ) {  // While have work
       Node n = work.pop();      // Get work
       if( n==null ) continue;   // Defs can be null
       if( !freached.get (n._uid) ) continue; // Not reached from fcn top
       if(  breached.tset(n._uid) ) continue; // Already visited?
       body.push(n);                          // Part of body
       work.addAll(n._defs);                  // Visit all defs
       if( n.is_multi_head() )                // Multi-head?
         work.addAll(n._uses);                // All uses are ALSO part, even if not reachable in this fcn
     }
     return body;
   }

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find_fidx()

static FunNode com.cliffc.aa.node.FunNode.find_fidx ( int fidx )

static

Definition at line 101 of file FunNode.java.

101 { return FUNS.atX(fidx); }

References com.cliffc.aa.node.FunNode.fidx(), and com.cliffc.aa.node.FunNode.FUNS.

Referenced by com.cliffc.aa.node.CallEpiNode.check_and_wire(), com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.type.TypeFunPtr.is_forward_ref(), com.cliffc.aa.node.CallNode.least_cost(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.names(), com.cliffc.aa.node.RetNode.xstr(), and com.cliffc.aa.node.FunPtrNode.xstr().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find_type_split()

Type [] com.cliffc.aa.node.FunNode.find_type_split ( Node[] parms )

private

Definition at line 354 of file FunNode.java.

                                                  {
     assert has_unknown_callers(); // Only overly-wide calls.
  
     // Look for splitting to help an Unresolved Call.
     int idx = find_type_split_index(parms);
     if( idx != -1 ) {           // Found; split along a specific input path using widened types
       Type[] sig = Types.get(parms.length);
       sig[CTL_IDX] = Type.CTRL;
       sig[MEM_IDX] = TypeMem.MEM;
       sig[DSP_IDX] = parms[DSP_IDX]==null
         ? _sig.display().simple_ptr()
         : parms[DSP_IDX].val(idx);
       for( int i=ARG_IDX; i<parms.length; i++ )
         sig[i] = parms[i]==null ? Type.ALL : parms[i].val(idx).widen();
       return sig;
     }
  
     // Look for splitting to help a pointer from an unspecialized type
     boolean progress = false;
     Type[] sig = new Type[parms.length];
     Type tmem = parms[MEM_IDX]._val;
     sig[CTL_IDX] = Type.CTRL;
     sig[MEM_IDX] = TypeMem.MEM;
     if( tmem instanceof TypeMem ) {
       for( int i=DSP_IDX; i<parms.length; i++ ) { // For all parms
         Node parm = parms[i];
         if( parm == null ) { sig[i]=Type.ALL; continue; } // (some can be dead)
         if( parm._val==Type.ALL ) return null;            // No split with error args
         sig[i] = parm._val;                               // Current type
         if( i==DSP_IDX ) continue; // No split on the display
         // Best possible type
         Type tp = Type.ALL;
         for( Node def : parm._defs )
           if( def != this )
             tp = tp.join(def._val);
         if( !(tp instanceof TypeMemPtr) ) continue; // Not a pointer
         TypeObj to = ((TypeMem)tmem).ld((TypeMemPtr)tp).widen(); //
         // Are all the uses of parm compatible with this TMP?
         // Also, flag all used fields.
         if( bad_mem_use(parm, to) )
           continue;               // So bad usage
  
         sig[i] = TypeMemPtr.make(BitsAlias.FULL,to); // Signature takes any alias but has sharper guts
         progress = true;
       }
     }
     if( progress ) return sig;
  
     return null;
   }

Referenced by com.cliffc.aa.node.FunNode.type_special().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find_type_split_index()

int com.cliffc.aa.node.FunNode.find_type_split_index ( Node[] parms )

private

Definition at line 326 of file FunNode.java.

                                                     {
     assert has_unknown_callers();// Only overly-wide calls.
     for( Node parm : parms )     // For all parms
       if( parm != null )         // (some can be dead)
         for( Node use : parm._uses ) { // See if a parm-user needs a type-specialization split
           if( use instanceof CallNode ) {
             CallNode call = (CallNode)use;
             Node fdx = call.fdx();
             if( fdx instanceof FreshNode ) fdx = ((FreshNode)fdx).id();
             if( (fdx==parm && !parm._val.isa(TypeFunPtr.GENERIC_FUNPTR) ) ||
                 fdx instanceof UnresolvedNode ) { // Call overload not resolved
               Type t0 = parm.val(1);                   // Generic type in slot#1
               for( int i=2; i<parm._defs._len; i++ ) { // For all other inputs
                 Type tp = parm.val(i);
                 if( tp.above_center() ) continue; // This parm input is in-error
                 Type ti = tp.widen();             // Get the widen'd type
                 if( !ti.isa(t0) ) continue; // Must be isa-generic type, or else type-error
                 if( ti != t0 ) return i; // Sharpens?  Then splitting here should help
               }
             }
             // Else no split will help this call, look for other calls to help
           }
         }
  
     return -1; // No unresolved calls; no point in type-specialization
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.type.Type< T extends Type< T >.above_center(), com.cliffc.aa.node.CallNode.fdx(), com.cliffc.aa.type.TypeFunPtr.GENERIC_FUNPTR, com.cliffc.aa.node.FunNode.has_unknown_callers(), com.cliffc.aa.type.Type< T extends Type< T >.isa(), com.cliffc.aa.node.FunNode.parm(), com.cliffc.aa.node.FunNode.parms(), com.cliffc.aa.node.Node.val(), and com.cliffc.aa.type.Type< T extends Type< T >.widen().

Referenced by com.cliffc.aa.node.FunNode.find_type_split().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ formal()

Type com.cliffc.aa.node.FunNode.formal ( int idx )

package

Definition at line 187 of file FunNode.java.

                        {
     return idx == -1 ? TypeRPC.ALL_CALL : _sig.arg(idx);
   }

References com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.type.TypeRPC.ALL_CALL, and com.cliffc.aa.type.TypeFunSig.arg().

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.TestNodeSmall.check(), com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.FunNode.split_callers(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.node.ParmNode.valid_args(), and com.cliffc.aa.node.ParmNode.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fptr()

FunPtrNode com.cliffc.aa.node.FunNode.fptr ( )

Definition at line 908 of file FunNode.java.

                            {
     RetNode ret = ret();
     if( ret==null ) return null;
     for( Node fptr : ret._uses )
       if( fptr instanceof FunPtrNode )
         return (FunPtrNode)fptr;
     return null;
   }

References com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.FunNode.ret().

Referenced by com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.FunNode.ideal_reduce(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.names(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.Parse.term().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ get_mem_writer()

Node com.cliffc.aa.node.Node.get_mem_writer ( )

inherited

Definition at line 840 of file Node.java.

                                {
     for( Node use : _uses ) if( use.is_mem() ) return use;
     return null;
   }

References com.cliffc.aa.node.Node._uses.

Referenced by com.cliffc.aa.node.StoreNode.ideal_reduce().

Here is the caller graph for this function:

◆ has_unknown_callers()

boolean com.cliffc.aa.node.FunNode.has_unknown_callers ( )

package

Definition at line 185 of file FunNode.java.

185 { return _defs._len > 1 && in(1) == Env.ALL_CTRL; }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.Env.ALL_CTRL, and com.cliffc.aa.node.Node.in().

Referenced by com.cliffc.aa.node.FunNode.find_type_split(), com.cliffc.aa.node.FunNode.find_type_split_index(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.FunNode.ideal_reduce(), com.cliffc.aa.node.RetNode.live(), com.cliffc.aa.node.FunNode.split_callers(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.node.FunNode.type_special(), and com.cliffc.aa.node.ParmNode.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ hashCode()

int com.cliffc.aa.node.Node.hashCode ( )

inherited

Definition at line 105 of file Node.java.

                                   {
     int sum = _op;
     for( int i=0; i<_defs._len; i++ ) if( _defs._es[i] != null ) sum ^= _defs._es[i]._uid;
     return sum;
   }

References com.cliffc.aa.node.Node._defs, and com.cliffc.aa.node.Node._op.

◆ ideal_grow()

Node com.cliffc.aa.node.Node.ideal_grow ( )

inherited

Reimplemented in com.cliffc.aa.node.PrimNode.OrElse, com.cliffc.aa.node.PrimNode.AndThen, com.cliffc.aa.node.CallNode, com.cliffc.aa.node.LoadNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.MrgProjNode, and com.cliffc.aa.node.AssertNode.

Definition at line 450 of file Node.java.

450 { return null; }

Referenced by com.cliffc.aa.node.Node.do_grow().

Here is the caller graph for this function:

◆ ideal_inline()

Node com.cliffc.aa.node.FunNode.ideal_inline ( boolean check_progress )

Definition at line 231 of file FunNode.java.

                                                    {
     // If no trailing RetNode and hence no FunPtr... function is uncallable
     // from the unknown caller.
     RetNode ret = ret();
     if( has_unknown_callers() && ret == null && Env.GVN._opt_mode != GVNGCM.Mode.Parse ) // Dead after construction?
       return null;
  
     if( is_forward_ref() ) return null; // No mods on a forward ref
     Node[] parms = parms();
     Node rpc_parm = parms[0];
     if( rpc_parm == null ) return null; // Single caller const-folds the RPC, but also inlines in CallNode
     if( !check_callers() ) return null;
     if( _defs._len <= 2  ) return null; // No need to split callers if only 1
  
     // Every input path is wired to an output path
     for( int i=1+(has_unknown_callers() ? 1 : 0); i<_defs._len; i++ ) {
       Node c = in(i);
       if( !(c.in(0) instanceof CallNode) ) return null; // If this is not a CallNode, just bail
       CallNode call = (CallNode)c.in(0);
       CallEpiNode cepi = call.cepi();
       if( cepi==null ) return null;
       assert cepi._defs.find(ret)!= -1;  // If this is not wired, just bail
     }
     // Memory is not 'lifted' by DefMem, a sign that a bad-memory-arg is being
     // passed in.
     if( has_unknown_callers() ) {
       Node mem = parms[MEM_IDX];
       if( mem!=null && !mem._val.isa(Env.DEFMEM._val) )
         return null; // Do not inline a bad memory type
     }
  
     // Look for appropriate type-specialize callers
     TypeTuple formals = _thunk_rhs ? null : type_special(parms);
     Ary<Node> body = find_body(ret);
     int path = -1;              // Paths will split according to type
     if( formals == null ) {     // No type-specialization to do
       formals = _sig._formals;  // Use old args
       if( _cnt_size_inlines >= 10 && !is_prim() ) return null;
       // Large code-expansion allowed; can inline for other reasons
       path = _thunk_rhs ? 2 : split_size(body,parms); // Forcible size-splitting first path
       if( path == -1 ) return null;
       assert CallNode.ttfp(in(path).val(0)).fidx()!=-1; // called by a single-target call
       if( !is_prim() ) _cnt_size_inlines++; // Disallow infinite size-inlining of recursive non-primitives
     }
  
     // Check for dups (already done this but failed to resolve all calls, so trying again).
     TypeTuple fformals = formals;
     if( path == -1 && FUNS.find(fun -> fun != null && !fun.is_dead() &&
                                 fun._sig._formals==fformals && fun._sig._ret == _sig._ret &&
                                 fun.in(1)==in(1)) != -1 )
       return null;              // Done this before
     if( noinline() ) return null;
  
     assert _must_inline==0; // Failed to inline a prior inline?
     if( path > 0 ) _must_inline = in(path).in(0)._uid;
     assert !check_progress;     // Not expecting progress
  
     // --------------
     // Split the callers according to the new 'fun'.
     FunNode fun = make_new_fun(ret, formals);
     split_callers(ret,fun,body,path);
     assert Env.START.more_flow(true)==0; // Initial conditions are correct
     return this;
   }

References com.cliffc.aa.node.FunNode._cnt_size_inlines, com.cliffc.aa.node.Node._defs, com.cliffc.aa.type.TypeFunSig._formals, com.cliffc.aa.node.FunNode._must_inline, com.cliffc.aa.GVNGCM._opt_mode, com.cliffc.aa.type.TypeFunSig._ret, com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.node.FunNode._thunk_rhs, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.FunNode.check_callers(), com.cliffc.aa.Env.DEFMEM, com.cliffc.aa.type.TypeFunPtr.fidx(), com.cliffc.aa.node.FunNode.find_body(), com.cliffc.aa.node.FunNode.FUNS, com.cliffc.aa.Env.GVN, com.cliffc.aa.node.FunNode.has_unknown_callers(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.FunNode.is_forward_ref(), com.cliffc.aa.node.Node.is_prim(), com.cliffc.aa.type.Type< T extends Type< T >.isa(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunNode.noinline(), com.cliffc.aa.node.FunNode.parms(), com.cliffc.aa.GVNGCM.Mode.Parse, com.cliffc.aa.node.FunNode.ret(), com.cliffc.aa.node.FunNode.split_callers(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.Env.START, com.cliffc.aa.node.CallNode.ttfp(), com.cliffc.aa.node.FunNode.type_special(), and com.cliffc.aa.node.Node.val().

Here is the call graph for this function:

◆ ideal_mono()

Node com.cliffc.aa.node.Node.ideal_mono ( )

inherited

Reimplemented in com.cliffc.aa.node.RetNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.MemJoinNode, com.cliffc.aa.node.LoadNode, com.cliffc.aa.node.MrgProjNode, and com.cliffc.aa.node.CastNode.

Definition at line 445 of file Node.java.

445 { return null; }

Referenced by com.cliffc.aa.node.Node.do_mono().

Here is the caller graph for this function:

◆ ideal_reduce()

Node com.cliffc.aa.node.FunNode.ideal_reduce ( )

Reimplemented from com.cliffc.aa.node.RegionNode.

Definition at line 197 of file FunNode.java.

                                        {
     Node rez = super.ideal_reduce();
     if( rez != null ) return rez;
     // Check for FunPtr/Ret dead/gone, and the function is no longer callable
     // from anybody.
     RetNode ret = ret();
     if( has_unknown_callers() && ret==null && _keep==0 ) {
       assert !is_prim();
       assert in(1)==Env.ALL_CTRL;
       return set_def(1,Env.XCTRL);
     }
  
     // Update _sig if parms are unused.  SIG falls during Iter and lifts during
     // GCP.  If parm is missing or not-live, then the corresponding SIG
     // argument can be ALL (all args allowed, including errors).
     if( !is_forward_ref() && !is_prim() && _keep==0 ) {
       Node[] parms = parms();
       TypeFunSig progress = _sig;
       for( int i=1; i<parms.length; i++ )
         if( (parms[i]==null || parms[i]._live==TypeMem.DEAD) && _sig._formals.at(i)!=Type.ALL )
           _sig = _sig.make_from_arg(i,Type.ALL);
       // Can resolve some least_cost choices
       if( progress != _sig ) {
         FunPtrNode fptr = fptr();
         if( fptr != null )
           for( Node use : fptr()._uses )
             if( use instanceof UnresolvedNode )
               Env.GVN.add_reduce_uses(use);
       }
     }
  
     return null;
   }

Here is the call graph for this function:

◆ in()

Node com.cliffc.aa.node.Node.in ( int i )

inherited

Definition at line 126 of file Node.java.

126 { return _defs.at(i); }

References com.cliffc.aa.node.Node._defs.

Here is the caller graph for this function:

◆ init0()

static void com.cliffc.aa.node.Node.init0 ( )

staticinherited

Definition at line 70 of file Node.java.

                              {
     assert LIVE.get(CNT-1) && !LIVE.get(CNT);
     _INIT0_CNT=CNT;
   }

References com.cliffc.aa.node.Node._INIT0_CNT, com.cliffc.aa.node.Node.CNT, and com.cliffc.aa.node.Node.LIVE.

Referenced by com.cliffc.aa.Env.record_for_top_reset2().

Here is the caller graph for this function:

◆ init1()

Node com.cliffc.aa.node.Node.init1 ( )

inherited

Definition at line 708 of file Node.java.

                        {
     Node x = VALS.get(this);
     if( Env.GVN._opt_mode == GVNGCM.Mode.Opto ) _live = TypeMem.DEAD;
     if( x!=null ) {             // Hit in GVN table
       merge(x);
       kill();                                 // Kill just-init'd
       return x;                               // Return old
     }
     _elock();
     _val = value(Env.GVN._opt_mode);
     return Env.GVN.add_work_all(this);
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._live, com.cliffc.aa.GVNGCM._opt_mode, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_work_all(), com.cliffc.aa.type.TypeMem.DEAD, com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.kill(), com.cliffc.aa.node.Node.merge(), com.cliffc.aa.GVNGCM.Mode.Opto, com.cliffc.aa.node.Node.VALS, and com.cliffc.aa.node.Node.value().

Referenced by com.cliffc.aa.node.CallEpiNode.wire0().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ insert() [1/2]

Node com.cliffc.aa.node.Node.insert	(	int	idx,
		Node	n
	)

inherited

Definition at line 165 of file Node.java.

165 { unelock(); _defs.insert(idx,n); if( n!=null ) n._uses.add(this); return this; }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.Node.unelock().

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_above(), com.cliffc.aa.node.MemJoinNode.add_alias_below(), com.cliffc.aa.Parse.remove_unknown_callers(), com.cliffc.aa.node.FunNode.split_callers(), com.cliffc.aa.node.Node.subsume(), com.cliffc.aa.node.CallNode.swap_new(), and com.cliffc.aa.node.RetNode.tail_recursive().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ insert() [2/2]

void com.cliffc.aa.node.Node.insert ( Node nnn )

inherited

Definition at line 191 of file Node.java.

                                  {
     if( _uses._len>0 ) unelock(); // Hacking edges
     while( _uses._len > 0 ) {
       Node u = _uses.del(0);  // Old use
       u.replace(this,nnn);    // was this now nnn
       nnn._uses.add(u);
     }
   }

References com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.replace(), and com.cliffc.aa.node.Node.unelock().

Here is the call graph for this function:

◆ is_CFG()

boolean com.cliffc.aa.node.Node.is_CFG ( )

packageinherited

Definition at line 356 of file Node.java.

356 { return _op==OP_CALL || _op==OP_CALLEPI || _op==OP_FUN || _op==OP_RET || _op==OP_IF || _op==OP_LOOP || _op==OP_REGION || _op==OP_START || _op==OP_CPROJ || _op==OP_SCOPE; }

References com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node.OP_CALL, com.cliffc.aa.node.Node.OP_CALLEPI, com.cliffc.aa.node.Node.OP_CPROJ, com.cliffc.aa.node.Node.OP_FUN, com.cliffc.aa.node.Node.OP_IF, com.cliffc.aa.node.Node.OP_LOOP, com.cliffc.aa.node.Node.OP_REGION, com.cliffc.aa.node.Node.OP_RET, com.cliffc.aa.node.Node.OP_SCOPE, and com.cliffc.aa.node.Node.OP_START.

Referenced by com.cliffc.aa.node.RegionNode.add_flow_def_extra(), com.cliffc.aa.node.Node.do_flow(), com.cliffc.aa.node.Node.postorder(), com.cliffc.aa.node.RegionNode.stacked_region(), and com.cliffc.aa.node.RetNode.tail_recursive().

Here is the caller graph for this function:

◆ is_copy()

Node com.cliffc.aa.node.FunNode.is_copy ( int idx )

Reimplemented from com.cliffc.aa.node.RegionNode.

Definition at line 918 of file FunNode.java.

918 { return in(0)==this ? in(1) : null; }

References com.cliffc.aa.node.Node.in().

Here is the call graph for this function:

◆ is_dead()

boolean com.cliffc.aa.node.Node.is_dead ( )

inherited

Definition at line 820 of file Node.java.

820 { return _uses == null; }

References com.cliffc.aa.node.Node._uses.

Here is the caller graph for this function:

◆ is_forward_ref()

boolean com.cliffc.aa.node.FunNode.is_forward_ref ( )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 886 of file FunNode.java.

886 { return _op_prec==-2; }

References com.cliffc.aa.node.FunNode._op_prec.

Referenced by com.cliffc.aa.node.CallEpiNode.check_and_wire(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.FunNode.ideal_reduce(), com.cliffc.aa.type.TypeFunPtr.is_forward_ref(), com.cliffc.aa.node.RetNode.is_forward_ref(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.str(), and com.cliffc.aa.node.FunNode.value().

Here is the caller graph for this function:

◆ is_mem()

boolean com.cliffc.aa.node.Node.is_mem ( )

inherited

Reimplemented in com.cliffc.aa.node.MemPrimNode.WritePrimNode, com.cliffc.aa.node.CallNode, com.cliffc.aa.node.ScopeNode, com.cliffc.aa.node.CallEpiNode, com.cliffc.aa.node.RetNode, com.cliffc.aa.node.MemSplitNode, com.cliffc.aa.node.StoreNode, com.cliffc.aa.node.IntrinsicNode, com.cliffc.aa.node.PhiNode, com.cliffc.aa.node.MemJoinNode, com.cliffc.aa.node.MProjNode, com.cliffc.aa.node.MrgProjNode, and com.cliffc.aa.node.StartMemNode.

Definition at line 838 of file Node.java.

838 { return false; }

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_below(), com.cliffc.aa.node.StoreNode.ideal_grow(), com.cliffc.aa.node.MemSplitNode.insert_split(), and com.cliffc.aa.GVNGCM.retype_mem().

Here is the caller graph for this function:

◆ is_multi_head()

boolean com.cliffc.aa.node.Node.is_multi_head ( )

inherited

Definition at line 354 of file Node.java.

354 { return _op==OP_CALL || _op==OP_CALLEPI || _op==OP_FUN || _op==OP_IF || _op==OP_LOOP || _op==OP_NEWOBJ || _op==OP_NEWSTR || _op==OP_REGION || _op==OP_SPLIT || _op==OP_START; }

References com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node.OP_CALL, com.cliffc.aa.node.Node.OP_CALLEPI, com.cliffc.aa.node.Node.OP_FUN, com.cliffc.aa.node.Node.OP_IF, com.cliffc.aa.node.Node.OP_LOOP, com.cliffc.aa.node.Node.OP_NEWOBJ, com.cliffc.aa.node.Node.OP_NEWSTR, com.cliffc.aa.node.Node.OP_REGION, com.cliffc.aa.node.Node.OP_SPLIT, and com.cliffc.aa.node.Node.OP_START.

Referenced by com.cliffc.aa.node.Node.dump(), com.cliffc.aa.node.Node.dumprpo(), com.cliffc.aa.node.FunNode.find_body(), and com.cliffc.aa.node.Node.postorder().

Here is the caller graph for this function:

◆ is_multi_tail()

boolean com.cliffc.aa.node.Node.is_multi_tail ( )

privateinherited

Definition at line 355 of file Node.java.

355 { return _op==OP_PARM || _op==OP_PHI || _op==OP_PROJ || _op==OP_CPROJ; }

References com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node.OP_CPROJ, com.cliffc.aa.node.Node.OP_PARM, com.cliffc.aa.node.Node.OP_PHI, and com.cliffc.aa.node.Node.OP_PROJ.

Referenced by com.cliffc.aa.node.Node.dump(), com.cliffc.aa.node.Node.dumprpo(), and com.cliffc.aa.node.Node.postorder().

Here is the caller graph for this function:

◆ is_prim()

boolean com.cliffc.aa.node.Node.is_prim ( )

inherited

Definition at line 260 of file Node.java.

260 { return _INIT0_CNT==0 || _uid<_INIT0_CNT; }

References com.cliffc.aa.node.Node._INIT0_CNT, and com.cliffc.aa.node.Node._uid.

Here is the caller graph for this function:

◆ is_pure_call()

Node com.cliffc.aa.node.Node.is_pure_call ( )

packageinherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.CallEpiNode, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.UnresolvedNode, and com.cliffc.aa.node.FreshNode.

Definition at line 834 of file Node.java.

834 { return null; }

Referenced by com.cliffc.aa.node.FreshNode.is_pure_call(), and com.cliffc.aa.node.CallNode.is_pure_call().

Here is the caller graph for this function:

◆ keep() [1/2]

public<N extends Node> N com.cliffc.aa.node.Node.keep ( )

packageinherited

Definition at line 228 of file Node.java.

228 { return keep(1); }

References com.cliffc.aa.node.Node.keep().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ keep() [2/2]

public<N extends Node> N com.cliffc.aa.node.Node.keep ( int d )

packageinherited

Definition at line 230 of file Node.java.

230 { _keep+=d; return (N)this; }

References com.cliffc.aa.node.Node._keep.

◆ kill()

Node com.cliffc.aa.node.Node.kill ( )

inherited

Definition at line 211 of file Node.java.

                       {
     if( is_dead() ) return null;
     assert _uses._len==0 && _keep==0;
     // Similar to unelock(), except do not put on any worklist
     if( _elock ) { _elock = false; Node x = VALS.remove(this); assert x == this; }
     while( _defs._len > 0 ) unuse(_defs.pop());
     set_dead();                 // officially dead now
     LIVE.clear(_uid);           // Off the LIVE set.  CNT cannot roll back unless the GVN worklists are also clear
     return this;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.node.Node.LIVE, com.cliffc.aa.node.Node.set_dead(), com.cliffc.aa.node.Node.unuse(), and com.cliffc.aa.node.Node.VALS.

Referenced by com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.Node.init1(), com.cliffc.aa.Parse.kill(), com.cliffc.aa.node.Node.subsume(), and com.cliffc.aa.node.TestNodeSmall.testCallNodeResolve().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ len()

int com.cliffc.aa.node.Node.len ( )

inherited

Definition at line 125 of file Node.java.

125 { return _defs._len; }

References com.cliffc.aa.node.Node._defs.

Referenced by com.cliffc.aa.node.MemPrimNode.err(), com.cliffc.aa.node.CallNode.ideal_reduce(), and com.cliffc.aa.node.CallEpiNode.value().

Here is the caller graph for this function:

◆ live()

TypeMem com.cliffc.aa.node.Node.live ( GVNGCM.Mode opt_mode )

inherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.RetNode, com.cliffc.aa.node.MemJoinNode, com.cliffc.aa.node.ScopeNode, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.ConNode< T extends Type >, com.cliffc.aa.node.ThretNode, and com.cliffc.aa.node.StartNode.

Definition at line 478 of file Node.java.

                                               {
     if( _keep>0 ) return all_live();
     // Compute meet/union of all use livenesses
     TypeMem live = TypeMem.DEAD; // Start at lattice top
     for( Node use : _uses )      // Computed across all uses
       if( use.live_uses() ) {
         TypeMem ulive = use.live_use(opt_mode, this);
         live = (TypeMem)live.meet(ulive); // Make alive used fields
       }
     assert live==TypeMem.DEAD || live.basic_live()==all_live().basic_live();
     assert live!=TypeMem.LIVE_BOT || (_val !=Type.CTRL && _val !=Type.XCTRL);
     return live;
   }

References com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.all_live(), com.cliffc.aa.type.TypeMem.basic_live(), com.cliffc.aa.type.Type< T extends Type< T >.CTRL, com.cliffc.aa.type.TypeMem.DEAD, com.cliffc.aa.type.TypeMem.LIVE_BOT, com.cliffc.aa.type.Type< T extends Type< T >.meet(), and com.cliffc.aa.type.Type< T extends Type< T >.XCTRL.

Referenced by com.cliffc.aa.node.Node.do_flow(), com.cliffc.aa.GVNGCM.gcp(), com.cliffc.aa.node.PhiNode.ideal_reduce(), com.cliffc.aa.node.MemPrimNode.LValueLength.live_use(), com.cliffc.aa.node.LoadNode.live_use(), com.cliffc.aa.node.Node.more_flow(), com.cliffc.aa.node.Node.more_ideal(), com.cliffc.aa.GVNGCM.revalive(), and com.cliffc.aa.node.Node.xliv().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ live_use()

TypeMem com.cliffc.aa.node.RegionNode.live_use	(	GVNGCM.Mode	opt_mode,
		Node	def
	)

inherited

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 141 of file RegionNode.java.

141 { return TypeMem.ALIVE; }

References com.cliffc.aa.type.TypeMem.ALIVE.

◆ live_uses()

boolean com.cliffc.aa.node.Node.live_uses ( )

inherited

Definition at line 491 of file Node.java.

                              {
     return _live != TypeMem.DEAD &&    // Only live uses make more live
       // And no chance use turns into a constant (which then does not use anything)
       !(_live.basic_live() && _val.may_be_con() && !is_prim() && err(true)==null &&
         // FunPtrs still use their Rets, even if constant
         !(this instanceof FunPtrNode));
   }

References com.cliffc.aa.node.Node._live, com.cliffc.aa.node.Node._val, com.cliffc.aa.type.TypeMem.basic_live(), com.cliffc.aa.type.TypeMem.DEAD, com.cliffc.aa.node.Node.err(), com.cliffc.aa.node.Node.is_prim(), and com.cliffc.aa.type.Type< T extends Type< T >.may_be_con().

Here is the call graph for this function:

◆ make_new_fun()

FunNode com.cliffc.aa.node.FunNode.make_new_fun	(	RetNode	ret,
		TypeTuple	new_formals
	)

private

Definition at line 619 of file FunNode.java.

                                                                    {
     // Make a prototype new function header split from the original.
     int oldfidx = fidx();
     FunNode fun = new FunNode(_name,TypeFunSig.make(_sig._args,new_formals,_sig._ret),_op_prec,_thunk_rhs,BitsFun.new_fidx(oldfidx));
     fun._bal_close = _bal_close;
     fun.pop();                  // Remove null added by RegionNode, will be added later
     fun.unkeep();               // Ret will clone and not construct
     // Renumber the original as well; the original _fidx is now a *class* of 2
     // fidxs.  Each FunNode fidx is only ever a constant, so the original Fun
     // becomes the other child fidx.
     int newfidx = _fidx = BitsFun.new_fidx(oldfidx);
     FUNS.setX(newfidx,this);    // Track FunNode by fidx
     FUNS.clear(oldfidx);        // Old fidx no longer refers to a single FunNode
     ret.set_fidx(newfidx);      // Renumber in the old RetNode
     // Right now, force the type upgrade on old_fptr.  old_fptr carries the old
     // parent FIDX and is on the worklist.  Eventually, it comes off and the
     // value() call lifts to the child fidx.  Meanwhile its value can be used
     // to wire a size-split to itself (e.g. fib()), which defeats the purpose
     // of a size-split (single caller only, so inlines).
     for( Node old_fptr : ret._uses )
       if( old_fptr instanceof FunPtrNode ) // Can be many old funptrs with different displays
         old_fptr.xval();                   // Upgrade FIDX
     Env.GVN.add_flow(ret);
     Env.GVN.add_flow(this);
     Env.GVN.add_flow_uses(this);
     return fun;
   }

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ merge()

Node com.cliffc.aa.node.Node.merge ( Node x )

privateinherited

Definition at line 702 of file Node.java.

                              {
     x._live = (TypeMem)x._live.meet(_live);
     return Env.GVN.add_flow(x);
   }

References com.cliffc.aa.node.Node._live, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.type.Type< T extends Type< T >.meet().

Referenced by com.cliffc.aa.node.Node._do_reduce(), and com.cliffc.aa.node.Node.init1().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ more_flow() [1/2]

final int com.cliffc.aa.node.Node.more_flow ( boolean lifting )

inherited

Definition at line 747 of file Node.java.

747 { FLOW_VISIT.clear(); return more_flow(lifting,0); }

References com.cliffc.aa.node.Node.FLOW_VISIT, and com.cliffc.aa.node.Node.more_flow().

Referenced by com.cliffc.aa.GVNGCM.check_and_wire(), com.cliffc.aa.GVNGCM.gcp(), com.cliffc.aa.node.Node.more_flow(), and com.cliffc.aa.GVNGCM.remove_ambi().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ more_flow() [2/2]

int com.cliffc.aa.node.Node.more_flow	(	boolean	lifting,
		int	errs
	)

privateinherited

Definition at line 748 of file Node.java.

                                                      {
     if( FLOW_VISIT.tset(_uid) ) return errs; // Been there, done that
     if( Env.GVN.on_dead(this) ) return errs; // Do not check dying nodes
     // Check for only forwards flow, and if possible then also on worklist
     Type    oval= _val, nval = value(Env.GVN._opt_mode);
     TypeMem oliv=_live, nliv = live (Env.GVN._opt_mode);
     boolean hm = false;
     if( nval != oval || nliv != oliv || hm ) {
       boolean ok = lifting
         ? nval.isa(oval) && nliv.isa(oliv)
         : oval.isa(nval) && oliv.isa(nliv);
       if( !ok || (!Env.GVN.on_flow(this) && !Env.GVN.on_dead(this) && _keep==0) ) { // Still-to-be-computed?
         FLOW_VISIT.clear(_uid); // Pop-frame & re-run in debugger
         System.err.println(dump(0,new SB(),true)); // Rolling backwards not allowed
         errs++;
       }
     }
     for( Node def : _defs ) if( def != null ) errs = def.more_flow(lifting,errs);
     for( Node use : _uses ) if( use != null ) errs = use.more_flow(lifting,errs);
     return errs;
   }

Here is the call graph for this function:

◆ more_ideal()

final boolean com.cliffc.aa.node.Node.more_ideal ( VBitSet bs )

inherited

Definition at line 722 of file Node.java.

                                               {
     if( bs.tset(_uid) ) return false; // Been there, done that
     if( _keep == 0 && _live.is_live() ) { // Only non-keeps, which is just top-level scope and prims
       Type t = value(Env.GVN._opt_mode);
       if( _val != t )
         return true;            // Found a value improvement
       TypeMem live = live(Env.GVN._opt_mode);
       if( _live != live )
         return true;            // Found a liveness improvement
       Node x;
       x = do_reduce(); if( x != null )
                          return true; // Found an ideal call
       x = do_mono(); if( x != null )
                        return true; // Found an ideal call
       x = do_grow(); if( x != null )
                        return true; // Found an ideal call
       if( this instanceof FunNode ) ((FunNode)this).ideal_inline(true);
     }
     for( Node def : _defs ) if( def != null && def.more_ideal(bs) ) return true;
     for( Node use : _uses ) if( use != null && use.more_ideal(bs) ) return true;
     return false;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._live, com.cliffc.aa.GVNGCM._opt_mode, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.do_grow(), com.cliffc.aa.node.Node.do_mono(), com.cliffc.aa.node.Node.do_reduce(), com.cliffc.aa.Env.GVN, com.cliffc.aa.type.TypeMem.is_live(), com.cliffc.aa.node.Node.live(), com.cliffc.aa.util.VBitSet.tset(), and com.cliffc.aa.node.Node.value().

Referenced by com.cliffc.aa.GVNGCM.iter().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ name() [1/4]

String com.cliffc.aa.node.FunNode.name ( )

package

Definition at line 114 of file FunNode.java.

114 { return name(true); }

References com.cliffc.aa.node.FunNode.name().

Referenced by com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.names(), com.cliffc.aa.node.FunNode.noinline(), and com.cliffc.aa.node.FunNode.xstr().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ name() [2/4]

String com.cliffc.aa.node.FunNode.name ( boolean debug )

Definition at line 115 of file FunNode.java.

                                     {
     String name = _name;
     if( name==null ) {
       FunPtrNode fptr = fptr();
       name=fptr==null ? null : fptr._name;
     }
     return name(name,_bal_close,fidx(),_op_prec,is_forward_ref(),debug);
   }

References com.cliffc.aa.node.FunNode._bal_close, com.cliffc.aa.node.FunPtrNode._name, com.cliffc.aa.node.FunNode._name, com.cliffc.aa.node.FunNode._op_prec, com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.fptr(), com.cliffc.aa.node.FunNode.is_forward_ref(), and com.cliffc.aa.node.FunNode.name().

Here is the call graph for this function:

◆ name() [3/4]

static String com.cliffc.aa.node.FunNode.name	(	int	fidx,
		boolean	debug
	)

staticprivate

Definition at line 109 of file FunNode.java.

                                                        {
     FunNode fun = find_fidx(fidx);
     return fun==null ? name(null,null,fidx,-1,false,debug) : fun.name(debug);
   }

References com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.find_fidx(), and com.cliffc.aa.node.FunNode.name().

Referenced by com.cliffc.aa.node.Node._header(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.RetNode.xstr(), and com.cliffc.aa.node.FunPtrNode.xstr().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ name() [4/4]

static String com.cliffc.aa.node.FunNode.name	(	String	name,
		String	bal,
		int	fidx,
		int	op_prec,
		boolean	fref,
		boolean	debug
	)

staticpackage

Definition at line 123 of file FunNode.java.

                                                                                                   {
     if( op_prec >= 0 && name != null ) name = '{'+name+(bal==null?"":bal)+'}'; // Primitives wrap
     if( name==null ) name="";
     if( debug ) name = name + "["+fidx+"]"; // FIDX in debug
     return fref ? "?"+name : name;          // Leading '?'
   }

References com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.name(), and com.cliffc.aa.node.Node.op_prec().

Here is the call graph for this function:

◆ names()

static SB com.cliffc.aa.node.FunNode.names	(	BitsFun	fidxs,
		SB	sb,
		boolean	debug
	)

static

Definition at line 131 of file FunNode.java.

                                                                {
     int fidx = fidxs.abit();
     if( fidx >= 0 ) return sb.p(name(fidx,debug));
     if( fidxs==BitsFun.EMPTY ) return sb.p("[]");
     // See if this is just one common name, common for overloaded functions
     String s=null;
     boolean prim=false;
     for( Integer ii : fidxs ) {
       FunNode fun = find_fidx(ii);
       if( fun!=null ) {
         prim |= fun._op_prec >= 0;
         if( fun._name != null ) s = fun._name;
         else if( !fun.is_dead() )
           for( Node fptr : fun.ret()._uses ) // For all displays for this fun
             if( fptr instanceof FunPtrNode ) {
               String name = ((FunPtrNode)fptr)._name; // Get debug name
               if( s==null ) s=name;                   // Capture debug name
               else if( !Util.eq(s,name) )             // Same name is OK
                 { s=null; break; } // Too many different names
             }
         if( s==null ) break; // Unnamed fidx
       }
     }
     if( s!=null )
       if( prim ) sb.p('{').p(s).p('}'); else sb.p(s);
     // Make a list of the fidxs
     if( debug ) {
       int cnt = 0;
       sb.p('[');
       for( Integer ii : fidxs ) {
         if( ++cnt == 5 ) break;
         sb.p(ii).p(fidxs.above_center() ? '+' : ',');
       }
       if( cnt >= 5 ) sb.p("...");
       else sb.unchar();
       sb.p(']');
     }
     return sb;
   }

References com.cliffc.aa.node.FunNode._name, com.cliffc.aa.node.FunNode._op_prec, com.cliffc.aa.node.Node._uses, com.cliffc.aa.type.Bits< B extends Bits< B >.abit(), com.cliffc.aa.type.BitsFun.EMPTY, com.cliffc.aa.util.Util.eq(), com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.find_fidx(), com.cliffc.aa.node.FunNode.fptr(), com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.util.SB.p(), com.cliffc.aa.node.FunNode.ret(), and com.cliffc.aa.util.SB.unchar().

Referenced by com.cliffc.aa.type.TypeFunPtr.names().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ nargs()

int com.cliffc.aa.node.FunNode.nargs ( )

Definition at line 190 of file FunNode.java.

190 { return _sig.nargs(); }

References com.cliffc.aa.node.FunNode._sig, and com.cliffc.aa.type.TypeFunSig.nargs().

Referenced by com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.least_cost(), com.cliffc.aa.node.FunNode.parms(), com.cliffc.aa.node.RetNode.RetNode(), com.cliffc.aa.node.FunNode.split_size(), and com.cliffc.aa.Parse.term().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ new_tvar()

TV2 com.cliffc.aa.node.Node.new_tvar ( String alloc_site )

inherited

Definition at line 101 of file Node.java.

101 { return TV2.make_leaf(this,alloc_site); }

References com.cliffc.aa.tvar.TV2.make_leaf().

Referenced by com.cliffc.aa.node.Node.copy(), and com.cliffc.aa.node.Node.Node().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ newuid()

int com.cliffc.aa.node.Node.newuid ( )

packageinherited

Definition at line 61 of file Node.java.

                {
     assert CNT < 100000 : "infinite node create loop";
     if( CNT==AA.UID )
       System.out.print("");
     LIVE.set(CNT);
     return CNT++;
   }

References com.cliffc.aa.node.Node.CNT, com.cliffc.aa.node.Node.LIVE, and com.cliffc.aa.AA.UID.

Referenced by com.cliffc.aa.node.Node.copy(), and com.cliffc.aa.node.Node.Node().

Here is the caller graph for this function:

◆ noinline()

boolean com.cliffc.aa.node.FunNode.noinline ( )

Definition at line 179 of file FunNode.java.

179 { return in(0)==null && name(false).startsWith("noinline"); }

References com.cliffc.aa.node.Node.in(), and com.cliffc.aa.node.FunNode.name().

Referenced by com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.PhiNode.ideal_reduce(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), and com.cliffc.aa.node.FunPtrNode.is_pure_call().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ op_prec()

byte com.cliffc.aa.node.Node.op_prec ( )

inherited

Reimplemented in com.cliffc.aa.node.MemPrimNode.LValueWriteFinal, com.cliffc.aa.node.MemPrimNode.LValueWrite, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.MemPrimNode.LValueRead, com.cliffc.aa.node.UnresolvedNode, com.cliffc.aa.node.ProjNode, com.cliffc.aa.node.FreshNode, and com.cliffc.aa.node.CProjNode.

Definition at line 533 of file Node.java.

533 { return -1; }

Referenced by com.cliffc.aa.Parse.bal_open(), com.cliffc.aa.Parse.fact(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.Env.lookup_filter_fresh(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.NewNode< T extends TypeObj< T >.NewPrimNode< TypeAry >.NewPrimNode(), com.cliffc.aa.node.FreshNode.op_prec(), com.cliffc.aa.node.ProjNode.op_prec(), and com.cliffc.aa.Parse.term().

Here is the caller graph for this function:

◆ parm()

ParmNode com.cliffc.aa.node.FunNode.parm ( int idx )

Definition at line 887 of file FunNode.java.

                                   {
     for( Node use : _uses )
       if( use instanceof ParmNode && ((ParmNode)use)._idx==idx )
         return (ParmNode)use;
     return null;
   }

References com.cliffc.aa.node.Node._uses.

Referenced by com.cliffc.aa.node.RetNode.check_phi_type(), com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.FunNode.find_type_split(), com.cliffc.aa.node.FunNode.find_type_split_index(), com.cliffc.aa.node.FunNode.split_callers(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.node.RetNode.tail_recursive(), and com.cliffc.aa.node.ParmNode.value().

Here is the caller graph for this function:

◆ parms()

Node [] com.cliffc.aa.node.FunNode.parms ( )

Definition at line 893 of file FunNode.java.

                         {
     Node[] parms = new Node[nargs()];
     for( Node use : _uses )
       if( use instanceof ParmNode )
         parms[((ParmNode)use)._idx] = use;
     return parms;
   }

References com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.FunNode.nargs().

Referenced by com.cliffc.aa.node.FunNode.find_type_split(), com.cliffc.aa.node.FunNode.find_type_split_index(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.FunNode.ideal_reduce(), com.cliffc.aa.node.FunNode.split_size(), and com.cliffc.aa.node.FunNode.type_special().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pop()

Node com.cliffc.aa.node.Node.pop ( )

inherited

Definition at line 174 of file Node.java.

174 { unelock(); Node n = _defs.pop(); unuse(n); return n; }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node.unelock(), and com.cliffc.aa.node.Node.unuse().

Referenced by com.cliffc.aa.node.ScopeNode.early_kill(), com.cliffc.aa.node.PrimNode.AndThen.ideal_grow(), com.cliffc.aa.node.PrimNode.OrElse.ideal_grow(), com.cliffc.aa.node.UnresolvedNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.NewNode< TypeStruct >.kill2(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.CallEpiNode.set_is_copy(), and com.cliffc.aa.node.FunNode.split_callers().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ postorder()

void com.cliffc.aa.node.Node.postorder	(	Ary< Node >	nodes,
		VBitSet	bs
	)

privateinherited

Definition at line 383 of file Node.java.

                                                         {
     if( bs.tset(_uid) ) return;
     // If CFG, walk the CFG first.  Do not walk thru Returns (into Calls) as
     // this breaks up the whole- functions-at-once.
     if( is_CFG() && _op!=OP_RET ) {
       // Walk any CProj first.
       for( Node use : _uses )
         if( use._op == OP_CPROJ )
           use.postorder(nodes,bs);
       // Walk the CFG, walking CallEpis last
       for( Node use : _uses )
         if( !(use instanceof CallEpiNode) && use.is_CFG() )
           use.postorder(nodes,bs);
       for( Node use : _uses )
         if(  (use instanceof CallEpiNode) && use.is_CFG() )
           use.postorder(nodes,bs);
     }
  
     // Walk the rest (especially data).  Since visit bits are set on the CFGs
     // its OK to walk them also.  Calls are special, since their Proj's feed
     // into a Fun's Parms.  We want the Fun to walk its own Parms, in order so
     // ignore these edges.  Since the Parms are all reachable from the Fun they
     // get walked eventually.
     if( _op != OP_CALL && _op!=OP_RET ) {
       if( _op!=OP_SPLIT || _uses._len!=2 )
         for( Node use : _uses )
           use.postorder(nodes,bs);
       else {                    // For MemSplit, walk the "busy" side first
         Node p0 = _uses.at(0), p1 = _uses.at(1);
         if( ((ProjNode)p0)._idx==1 ) { p0=p1; p1=_uses.at(0); } // Swap
         p1.postorder(nodes,bs);
         p0.postorder(nodes,bs);
       }
     }
  
     // Slight PO tweak: heads and tails together.
     if( is_multi_head() )
       for( Node use : _uses )
         if( use.is_multi_tail() )
           nodes.push(use);
     if( !is_multi_tail() ) nodes.push(this);
   }

References com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.Node.is_multi_tail(), com.cliffc.aa.node.Node.OP_CALL, com.cliffc.aa.node.Node.OP_CPROJ, com.cliffc.aa.node.Node.OP_RET, com.cliffc.aa.node.Node.OP_SPLIT, com.cliffc.aa.node.Node.postorder(), com.cliffc.aa.util.Ary< E >.push(), and com.cliffc.aa.util.VBitSet.tset().

Referenced by com.cliffc.aa.node.Node.dumprpo(), and com.cliffc.aa.node.Node.postorder().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ remove()

Node com.cliffc.aa.node.Node.remove ( int idx )

inherited

Definition at line 176 of file Node.java.

176 { unelock(); return unuse(_defs.remove(idx)); }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node.unelock(), and com.cliffc.aa.node.Node.unuse().

Referenced by com.cliffc.aa.node.RegionNode.stacked_region().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ replace()

void com.cliffc.aa.node.Node.replace	(	Node	old,
		Node	nnn
	)

inherited

Definition at line 163 of file Node.java.

163 { unelock(); _defs.replace(old,nnn); }

References com.cliffc.aa.node.Node._defs, and com.cliffc.aa.node.Node.unelock().

Referenced by com.cliffc.aa.node.Node.insert().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ reset()

static void com.cliffc.aa.node.FunNode.reset ( )

static

Definition at line 100 of file FunNode.java.

100 { FUNS.clear(); _must_inline=0; }

References com.cliffc.aa.node.FunNode._must_inline, and com.cliffc.aa.node.FunNode.FUNS.

Referenced by com.cliffc.aa.Env.top_reset().

Here is the caller graph for this function:

◆ reset_to_init0()

static void com.cliffc.aa.node.Node.reset_to_init0 ( )

staticinherited

Definition at line 77 of file Node.java.

                                       {
     CNT = 0;
     LIVE.clear();
     VALS.clear();
   }

References com.cliffc.aa.node.Node.CNT, com.cliffc.aa.node.Node.LIVE, and com.cliffc.aa.node.Node.VALS.

Referenced by com.cliffc.aa.Env.top_reset().

Here is the caller graph for this function:

◆ ret()

RetNode com.cliffc.aa.node.FunNode.ret ( )

Definition at line 900 of file FunNode.java.

                        {
     if( is_dead() ) return null;
     for( Node use : _uses )
       if( use instanceof RetNode && use._defs._len==5 && !((RetNode)use).is_copy() && ((RetNode)use).fun()==this )
         return (RetNode)use;
     return null;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, and com.cliffc.aa.node.Node.is_dead().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ roll_back_CNT()

static void com.cliffc.aa.node.Node.roll_back_CNT ( )

staticinherited

Definition at line 222 of file Node.java.

222 { while( !LIVE.get(CNT-1) ) CNT--; }

References com.cliffc.aa.node.Node.CNT, and com.cliffc.aa.node.Node.LIVE.

Referenced by com.cliffc.aa.GVNGCM.iter().

Here is the caller graph for this function:

◆ set_dead()

void com.cliffc.aa.node.Node.set_dead ( )

inherited

Definition at line 821 of file Node.java.

821 { _defs = _uses = null; } // TODO: Poor-mans indication of a dead node, probably needs to recycle these...

References com.cliffc.aa.node.Node._defs, and com.cliffc.aa.node.Node._uses.

Referenced by com.cliffc.aa.node.Node.kill().

Here is the caller graph for this function:

◆ set_def()

Node com.cliffc.aa.node.Node.set_def	(	int	idx,
		Node	n
	)

inherited

Definition at line 154 of file Node.java.

                                          {
     unelock();
     Node old = _defs.at(idx);  // Get old value
     // Add edge to new guy before deleting old, in case old goes dead and
     // recursively makes new guy go dead also
     if( (_defs._es[idx] = n) != null ) n._uses.add(this);
     return unuse(old);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.unelock(), and com.cliffc.aa.node.Node.unuse().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_is_copy()

void com.cliffc.aa.node.FunNode.set_is_copy ( )

package

Definition at line 919 of file FunNode.java.

919 { set_def(0,this); Env.GVN.add_reduce_uses(this); }

References com.cliffc.aa.GVNGCM.add_reduce_uses(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.set_def().

Referenced by com.cliffc.aa.node.CallEpiNode.ideal_reduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_nongens()

void com.cliffc.aa.node.FunNode.set_nongens ( TV2[] nongens )

Definition at line 192 of file FunNode.java.

192 { _nongens = nongens; }

References com.cliffc.aa.node.FunNode._nongens.

Referenced by com.cliffc.aa.Parse.func().

Here is the caller graph for this function:

◆ sharptr()

Type com.cliffc.aa.node.Node.sharptr ( Node mem )

inherited

Definition at line 855 of file Node.java.

855 { return mem._val.sharptr(_val); }

References com.cliffc.aa.node.Node._val, and com.cliffc.aa.type.Type< T extends Type< T >.sharptr().

Referenced by com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.Parse.get_display_ptr(), com.cliffc.aa.node.AssertNode.ideal_reduce(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.node.ParmNode.valid_args(), com.cliffc.aa.node.ParmNode.value(), com.cliffc.aa.node.MemPrimNode.LValueLength.value(), com.cliffc.aa.node.AssertNode.value(), and com.cliffc.aa.node.MemPrimNode.LValueRead.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ should_con()

boolean com.cliffc.aa.node.Node.should_con ( Type t )

inherited

Definition at line 651 of file Node.java.

                                     {
     if( this instanceof ConNode || // Already a constant
         (this instanceof FunPtrNode && _val.is_con()) || // Already a constant
         this instanceof ErrNode || // Never touch an ErrNode
         this instanceof FreshNode ||// These modify the TVars but not the constant flows
         is_prim() )                // Never touch a Primitive
       return false; // Already a constant, or never touch an ErrNode
     // Constant argument to call: keep for call resolution.
     // Call can always inline to fold constant.
     if( this instanceof ProjNode && in(0) instanceof CallNode && ((ProjNode)this)._idx>0 )
       return false;
     // Is in-error; do not remove the error.
     if( err(true) != null )
       return false;
     // Is a constant
     return t.is_con();
   }

References com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.err(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.type.Type< T extends Type< T >.is_con(), and com.cliffc.aa.node.Node.is_prim().

Referenced by com.cliffc.aa.node.Node._do_reduce(), and com.cliffc.aa.node.Node.walk_opt().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ split_callers()

void com.cliffc.aa.node.FunNode.split_callers	(	RetNode	oldret,
		FunNode	fun,
		Ary< Node >	body,
		int	path
	)

private

Definition at line 661 of file FunNode.java.

                                                                                       {
     // Unwire this function and collect unwired calls.  Leave the
     // unknown-caller, if any.
     CallNode path_call = path < 0 ? null : (CallNode)in(path).in(0);
     Ary<CallEpiNode> unwireds = new Ary<>(new CallEpiNode[1],0);
     final int zlen = has_unknown_callers() ? 2 : 1;
     while( _defs._len > zlen ) {             // For all paths (except unknown-caller)
       Node ceproj = pop();
       CallNode call = (CallNode)ceproj.in(0); // Unhook without removal
       CallEpiNode cepi = call.cepi();
       cepi.del(cepi._defs.find(oldret));
       unwireds.add(cepi);
       Env.GVN.add_reduce(cepi); // Visit for inlining later
       // And remove path from all Parms
       for( Node parm : _uses )
         if( parm instanceof ParmNode )
           parm.pop();
     }
  
     // Map from old to cloned function body
     HashMap<Node,Node> map = new HashMap<>();
     // Collect aliases that are cloning.
     BitSet aliases = new BitSet();
     // Clone the function body
     map.put(this,fun);
     for( Node n : body ) {
       if( n==this ) continue;   // Already cloned the FunNode
       int old_alias = n instanceof NewNode ? ((NewNode)n)._alias : -1;
       Node c = n.copy(false);     // Make a blank copy with no edges
       map.put(n,c);               // Map from old to new
       if( old_alias != -1 )       // Was a NewNode?
         aliases.set(old_alias);   // Record old alias before copy/split
       // Slightly better error message when cloning constructors
       if( path > 0 ) {
         if( n instanceof IntrinsicNode ) ((IntrinsicNode)c)._badargs = path_call._badargs[1];
         if( n instanceof   MemPrimNode ) ((  MemPrimNode)c)._badargs = path_call._badargs;
       }
     }
  
     // Fill in edges.  New Nodes point to New instead of Old; everybody
     // shares old nodes not in the function (and not cloned).
     for( Node n : map.keySet() ) {
       Node c = map.get(n);
       assert c._defs._len==0;
       for( Node def : n._defs ) {
         Node newdef = map.get(def);// Map old to new
         c.add_def(newdef==null ? def : newdef);
       }
     }
  
     // Keep around the old body, even as the FunPtrs get shuffled from Call to Call
     for( Node use : oldret._uses ) if( use instanceof FunPtrNode ) use.keep();
  
     // Collect the old/new returns and funptrs and add to map also.  The old
     // Ret has a set (not 1!) of FunPtrs, one per unique Display.
     RetNode newret = (RetNode)map.get(oldret);
     newret._fidx = fun.fidx();
     if( path < 0 ) {            // Type split
       for( Node use : oldret._uses )
         if( use instanceof FunPtrNode ) { // Old-return FunPtrs; varies by Display & by internal/external
           // Make an Unresolved choice of the old and new functions, to be used
           // by everything except mutually recursive calls; including
           // external/top-level calls, storing to memory, external merges, etc.
           Node old_funptr = use;
           Node new_funptr = map.get(old_funptr);
           new_funptr.insert(old_funptr);
           new_funptr.xval(); // Build type so Unresolved can compute type
           UnresolvedNode new_unr = new UnresolvedNode(null,new_funptr);
           old_funptr.insert(new_unr);
           new_unr.add_def(old_funptr);
           new_unr._val = new_unr.value(GVNGCM.Mode.PesiNoCG);
         }
     } else {                         // Path split
       Node old_funptr = fptr();      // Find the funptr for the path split
       Node new_funptr = map.get(old_funptr);
       new_funptr.insert(old_funptr); // Make cloned recursive calls, call the old version not the new version
       TypeFunPtr ofptr = (TypeFunPtr) old_funptr._val;
       path_call.set_fdx(new_funptr); // Force new_funptr, will re-wire later
       TypeFunPtr nfptr = TypeFunPtr.make(BitsFun.make0(newret._fidx),ofptr._nargs,ofptr._disp);
       path_call._val = CallNode.set_ttfp((TypeTuple) path_call._val,nfptr);
       for( Node use : oldret._uses ) // Check extra FunPtrs are dead
         if( use instanceof FunPtrNode ) Env.GVN.add_dead(map.get(use));
  
     } // Else other funptr/displays on unrelated path, dead, can be ignored
  
     // For all aliases split in this pass, update in-node both old and new.
     // This changes their hash, and afterwards the keys cannot be looked up.
     for( Map.Entry<Node,Node> e : map.entrySet() )
       if( e.getKey() instanceof MemSplitNode )
         ((MemSplitNode)e.getKey()).split_alias(e.getValue(),aliases);
  
     // Wired Call Handling:
     if( has_unknown_callers() ) { // Not called by any unknown caller
       if( path < 0 ) {            // Type Split
         // Change the unknown caller parm types to match the new sig.  Default
         // memory includes the other half of alias splits, which might be
         // passed in from recursive calls.
         for( Node p : fun._uses )
           if( p instanceof ParmNode ) {
             ParmNode parm = (ParmNode)p;
             Node defx;
             if( parm._idx==0 ) defx = Node.con(TypeRPC.ALL_CALL);
             else if( parm._idx==MEM_IDX ) defx = Env.DEFMEM;
             else {
               Type tx = fun.formal(parm._idx).simple_ptr();
               defx = Node.con(tx);
             }
             parm.set_def(1,defx);
           }
       } else                     // Path Split
         fun.set_def(1,Env.XCTRL);
     }
  
     // Put all new nodes into the GVN tables and worklist
     boolean split_alias=false;
     for( Map.Entry<Node,Node> e : map.entrySet() ) {
       Node oo = e.getKey();     // Old node
       Node nn = e.getValue();   // New node
       Type nt = oo._val;        // Generally just copy type from original nodes
       if( nn instanceof MrgProjNode ) { // Cloned allocations registers with default memory
         MrgProjNode nnrg = (MrgProjNode)nn;
         MrgProjNode oorg = (MrgProjNode)oo;
         Env.DEFMEM.make_mem(nnrg.nnn()._alias,nnrg);
         Env.DEFMEM.make_mem(oorg.nnn()._alias,oorg);
         int oldalias = BitsAlias.parent(oorg.nnn()._alias);
         Env.DEFMEM.set_def(oldalias,Node.con(TypeObj.UNUSED));
         Env.GVN.add_mono(oorg.nnn());
         Env.GVN.add_flow_uses(oorg);
         split_alias=true;
       }
  
       if( nn instanceof FunPtrNode ) { // FunPtrs pick up the new fidx
         TypeFunPtr ofptr = (TypeFunPtr)nt;
         if( ofptr.fidx()==oldret._fidx )
           nt = TypeFunPtr.make(BitsFun.make0(newret._fidx),ofptr._nargs,ofptr._disp);
       }
       nn._val = nt;             // Values
       nn._elock();              // In GVN table
     }
     if( split_alias ) {
       Env.DEFMEM.xval();
     }
  
     // Eagerly lift any Unresolved types, so they quit propagating the parent
     // (and both children) to all targets.
     for( Node fptr : oldret._uses )
       if( fptr instanceof FunPtrNode )
         for( Node unr : fptr._uses )
           if( unr instanceof UnresolvedNode )
             unr._val = unr.value(GVNGCM.Mode.PesiCG);
  
     // Rewire all unwired calls.
     for( CallEpiNode cepi : unwireds ) {
       CallNode call = cepi.call();
       CallEpiNode cepi2 = (CallEpiNode)map.get(cepi);
       if( path < 0 ) {          // Type-split, wire both & resolve later
         BitsFun call_fidxs = ((TypeFunPtr) call.fdx()._val).fidxs();
         assert call_fidxs.test_recur(    fidx()) ;  cepi.wire1(call,this,oldret);
         if(    call_fidxs.test_recur(fun.fidx()) )  cepi.wire1(call, fun,newret);
         if( cepi2!=null ) {
           // Found an unwired call in original: musta been a recursive self-
           // call.  wire the clone, same as the original was wired, so the
           // clone keeps knowledge about its return type.
           CallNode call2 = cepi2.call();
           BitsFun call_fidxs2 = ((TypeFunPtr) call2.fdx()._val).fidxs();
           if(    call_fidxs2.test_recur(    fidx()) )  cepi2.wire1(call2,this,oldret);
           assert call_fidxs2.test_recur(fun.fidx()) ;  cepi2.wire1(call2, fun,newret);
         }
       } else {                  // Non-type split, wire left or right
         if( call==path_call ) cepi.wire1(call, fun,newret);
         else                  cepi.wire1(call,this,oldret);
         if( cepi2!=null && cepi2.call()!=path_call ) {
           CallNode call2 = cepi2.call();
           // Found an unwired call in original: musta been a recursive
           // self-call.  wire the clone, same as the original was wired, so the
           // clone keeps knowledge about its return type.
           //call2.set_fdx(call.fdx());
           cepi2.wire1(call2,this,oldret);
           call2.xval();
           Env.GVN.add_flow_uses(this); // This gets wired, that gets wired, revisit all
         }
         Env.GVN.add_unuse(cepi);
       }
     }
  
     // Look for wired new not-recursive CallEpis; these will have an outgoing
     // edge to some other RetNode, but the Call will not be wired.  Wire.
     for( Node nn : map.values() ) {
       if( nn instanceof CallEpiNode ) {
         CallEpiNode ncepi = (CallEpiNode)nn;
         for( int i=0; i<ncepi.nwired(); i++ ) {
           RetNode xxxret = ncepi.wired(i); // Neither newret nor oldret
           if( xxxret != newret && xxxret != oldret ) { // Not self-recursive
             ncepi.wire0(ncepi.call(),xxxret.fun());
           }
         }
       }
     }
  
     // Retype memory, so we can everywhere lift the split-alias parents "up and out".
     GVNGCM.retype_mem(aliases,this.parm(MEM_IDX), oldret, true);
     GVNGCM.retype_mem(aliases,fun .parm(MEM_IDX), newret, true);
  
     // Unhook the hooked FunPtrs
     for( Node use : oldret._uses ) if( use instanceof FunPtrNode ) use.unkeep();
   }

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ split_size()

int com.cliffc.aa.node.FunNode.split_size	(	Ary< Node >	body,
		Node[]	parms
	)

private

Definition at line 536 of file FunNode.java.

                                                          {
     if( _defs._len <= 1 ) return -1; // No need to split callers if only 2
     boolean self_recursive=false;
  
     // Count function body size.  Requires walking the function body and
     // counting opcodes.  Some opcodes are ignored, because they manage
     // dependencies but make no code.
     int call_indirect=0, call_thunk=0; // Count of calls to e.g. loads/args/parms
     int[] cnts = new int[OP_MAX];
     for( Node n : body ) {
       int op = n._op;           // opcode
       if( op == OP_CALL ) {     // Call-of-primitive?
         Node n1 = ((CallNode)n).fdx();
         if( !(n1._val instanceof TypeFunPtr) ) return -1; // Calling an unknown function, await GCP
         TypeFunPtr tfp = (TypeFunPtr)n1._val;
         if( tfp._fidxs.test(_fidx) ) self_recursive = true; // May be self-recursive
         Node n2 = n1 instanceof UnOrFunPtrNode ? ((UnOrFunPtrNode)n1).funptr() : n1;
         if( n2 instanceof FunPtrNode ) {
           FunPtrNode fpn = (FunPtrNode) n2;
           if( fpn.ret().rez() instanceof PrimNode )
             op = OP_PRIM;       // Treat as primitive for inlining purposes
         } else if( n2!=null && n2._val==TypeTuple.RET ) { // Thunks are encouraged to inline
           call_thunk++;
         } else
           call_indirect++;
       }
       cnts[op]++;               // Histogram ops
     }
     assert cnts[OP_FUN]==1 && cnts[OP_RET]==1;
     assert cnts[OP_SCOPE]==0;
     assert cnts[OP_REGION] <= cnts[OP_IF];
  
     // Specifically ignoring constants, parms, phis, rpcs, types,
     // unresolved, and casts.  These all track & control values, but actually
     // do not generate any code.
     if( cnts[OP_CALL] > 2 || // Careful inlining more calls; leads to exponential growth
         cnts[OP_LOAD] > 4 ||
         cnts[OP_STORE]> 2 ||
         cnts[OP_PRIM] > 6 ||   // Allow small-ish primitive counts to inline
         cnts[OP_NEWOBJ]>2 ||   // Display and return is OK
         (cnts[OP_NEWOBJ]>1 && self_recursive) ||
         call_indirect > 0 )
       return -1;
  
     if( !Env.GVN._opt_mode._CG && self_recursive ) return -1; // Await GCP & call-graph discovery before inlining self-recursive functions
  
     // Pick which input to inline.  Only based on having some constant inputs
     // right now.
     Node mem = parms[MEM_IDX];  // Memory, used to sharpen input ptrs
     int m=-1, mncons = -1;
     for( int i=has_unknown_callers() ? 2 : 1; i<_defs._len; i++ ) {
       Node call = in(i).in(0);
       if( !(call instanceof CallNode) ) continue; // Not well formed
       if( ((CallNode)call).nargs() != nargs() ) continue; // Will not inline
       if( call._val == Type.ALL ) continue; // Otherwise in-error
       TypeFunPtr tfp = CallNode.ttfp(call._val);
       int fidx = tfp.fidxs().abit();
       if( fidx < 0 || BitsFun.is_parent(fidx) ) continue;    // Call must only target one fcn
       if( self_recursive && body.find(call)!=-1 ) continue; // Self-recursive; amounts to unrolling
       int ncon=0;
       // Count constant inputs on non-error paths
       for( int j=MEM_IDX; j<parms.length; j++ ) {
         Node parm = parms[j];
         if( parm != null ) {    // Some can be dead
           Type actual = parm.in(i).sharptr(mem.in(i));
           Type formal = formal(j);
           if( !actual.isa(formal) ) // Path is in-error?
             { ncon = -2; break; }   // This path is in-error, cannot inline even if small & constants
           if( actual.is_con() ) ncon++; // Count constants along each path
         }
       }
       if( ncon > mncons )
         { mncons = ncon; m = i; } // Path with the most constants
     }
     if( m == -1 )               // No paths are not in-error? (All paths have an error-parm)
       return -1;                // No inline
  
     if( cnts[OP_IF] > 1+mncons) // Allow some trivial filtering to inline
       return -1;
  
     return m;                   // Return path to split on
   }

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ stacked_region()

Node com.cliffc.aa.node.RegionNode.stacked_region ( )

packageinherited

Definition at line 81 of file RegionNode.java.

                         {
     if( _op != OP_REGION ) return null; // Does not apply to e.g. functions & loops
     int idx = _defs.find( e -> e !=null && e._op==OP_REGION );
     if( idx== -1 ) return null; // No stacked region
     Node r = in(idx);
     if( r == this ) return null; // Dying code
     int cfgs=0;
     for( Node use : r._uses ) cfgs += use.is_CFG() ? 1 : 0;
     if( cfgs != 1 ) return null;
     // Every 'r' Phi is pointed *at* by exactly a 'this' Phi
     for( Node rphi : r._uses )
       if( rphi._op == OP_PHI ) {
         if( rphi._uses._len != 1 ) return null; // Busy rphi
         Node phi = rphi._uses.at(0);            // Exactly a this.phi
         if( phi._op != OP_PHI ||                // Not a Phi
             phi.in(0) != this ||                // Control to this
             phi.in(idx) != rphi )               // Matching along idx
           return null;                          // Not exact shape
       }
  
     // Collapse stacked Phis
     for( Node phi : _uses )
       if( phi._op == OP_PHI ) {
         Node rphi = phi.in(idx);
         boolean stacked_phi = rphi._op == OP_PHI && rphi.in(0)==r;
         for( int i = 1; i<r._defs._len; i++ )
           phi.add_def(stacked_phi ? rphi.in(i) : rphi);
         phi.remove(idx);
         assert !stacked_phi || rphi._uses._len==0;
       }
  
     // Collapse stacked Region
     for( int i = 1; i<r._defs._len; i++ )
       add_def(r.in(i));
     remove(idx);
     return this;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._op, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.OP_PHI, com.cliffc.aa.node.Node.OP_REGION, and com.cliffc.aa.node.Node.remove().

Referenced by com.cliffc.aa.node.RegionNode.ideal_reduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ str()

String com.cliffc.aa.node.FunNode.str ( )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 107 of file FunNode.java.

107 { return is_forward_ref() ? xstr() : _sig.str(new SB(),new VBitSet(),null,false).toString(); }

References com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.node.FunNode.is_forward_ref(), com.cliffc.aa.type.TypeFunSig.str(), com.cliffc.aa.util.SB.toString(), and com.cliffc.aa.node.FunNode.xstr().

Referenced by com.cliffc.aa.node.FunPtrNode.str().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ subsume()

Node com.cliffc.aa.node.Node.subsume ( Node nnn )

inherited

Definition at line 201 of file Node.java.

                                   {
     assert !nnn.is_dead();
     insert(nnn);                // Change graph shape
     nnn.keep();                 // Keep-alive
     kill();                     // Delete the old, and anything it uses
     return nnn.unkeep();        // Remove keep-alive
   }

References com.cliffc.aa.node.Node.insert(), com.cliffc.aa.node.Node.is_dead(), com.cliffc.aa.node.Node.keep(), com.cliffc.aa.node.Node.kill(), and com.cliffc.aa.node.Node.unkeep().

Referenced by com.cliffc.aa.node.MemJoinNode.combine_splits(), com.cliffc.aa.node.CallNode.copy(), com.cliffc.aa.node.Node.do_reduce(), com.cliffc.aa.node.IfNode.flip(), and com.cliffc.aa.node.Node.walk_opt().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ toString()

String com.cliffc.aa.node.Node.toString ( )

inherited

Reimplemented in com.cliffc.aa.node.ConNode< T extends Type >.

Definition at line 284 of file Node.java.

284 { return dump(0,new SB(),false).toString(); }

References com.cliffc.aa.node.Node.dump().

Here is the call graph for this function:

◆ tvar() [1/2]

TV2 com.cliffc.aa.node.Node.tvar ( )

inherited

Definition at line 96 of file Node.java.

                     {
     TV2 tv = _tvar.find();     // Do U-F step
     return tv == _tvar ? tv : (_tvar = tv); // Update U-F style in-place.
   }

References com.cliffc.aa.node.Node._tvar, and com.cliffc.aa.tvar.TV2.find().

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_below(), com.cliffc.aa.Parse.func(), com.cliffc.aa.node.Node.tvar(), com.cliffc.aa.node.ProjNode.unify(), com.cliffc.aa.node.FreshNode.unify(), com.cliffc.aa.node.MemSplitNode.unify(), com.cliffc.aa.node.CastNode.unify(), com.cliffc.aa.node.MemJoinNode.unify(), com.cliffc.aa.node.StoreNode.unify(), and com.cliffc.aa.node.LoadNode.unify().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ tvar() [2/2]

TV2 com.cliffc.aa.node.Node.tvar ( int x )

inherited

Definition at line 100 of file Node.java.

100 { return in(x).tvar(); } // nth TV2

References com.cliffc.aa.node.Node.in(), and com.cliffc.aa.node.Node.tvar().

Here is the call graph for this function:

◆ type_special()

TypeTuple com.cliffc.aa.node.FunNode.type_special ( Node[] parms )

private

Definition at line 466 of file FunNode.java.

                                                  {
     if( !has_unknown_callers() ) return null; // Only overly-wide calls.
     Type[] sig = find_type_split(parms);
     if( sig == null ) return null; // No unresolved calls; no point in type-specialization
     // Make a new function header with new signature
     TypeTuple formals = TypeTuple.make_args(sig);
     if( !formals.isa(_sig._formals) ) return null;    // Fails in error cases
     return formals == _sig._formals ? null : formals; // Must see improvement
   }

References com.cliffc.aa.type.TypeFunSig._formals, com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.node.FunNode.find_type_split(), com.cliffc.aa.node.FunNode.has_unknown_callers(), com.cliffc.aa.type.Type< T extends Type< T >.isa(), com.cliffc.aa.type.TypeTuple.make_args(), and com.cliffc.aa.node.FunNode.parms().

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unelock()

void com.cliffc.aa.node.Node.unelock ( )

inherited

Definition at line 128 of file Node.java.

                         {
     assert check_vals();        // elock & VALs match
     if( _elock ) {              // Edge-locked
       _elock=false;             // Unlock
       Node x = VALS.remove(this);
       assert x==this;           // Got the right node out
       Env.GVN.add_reduce(Env.GVN.add_flow(this));
     }
   }

References com.cliffc.aa.node.Node._elock, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.node.Node.check_vals(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.VALS.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unhook()

public<N extends Node> N com.cliffc.aa.node.Node.unhook ( )

packageinherited

Definition at line 239 of file Node.java.

                                      {
     if( _keep==1 ) Env.GVN.add_work_all(this);
     return unkeep();
   }

References com.cliffc.aa.node.Node._keep, com.cliffc.aa.GVNGCM.add_work_all(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.unkeep().

Referenced by com.cliffc.aa.Parse.apply(), com.cliffc.aa.Parse.func(), and com.cliffc.aa.Parse.term().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unify()

boolean com.cliffc.aa.node.FunNode.unify ( boolean test )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 883 of file FunNode.java.

883 { return false; }

◆ unkeep() [1/2]

public<N extends Node> N com.cliffc.aa.node.Node.unkeep ( )

packageinherited

Definition at line 232 of file Node.java.

232 { return unkeep(1); }

References com.cliffc.aa.node.Node.unkeep().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unkeep() [2/2]

public<N extends Node> N com.cliffc.aa.node.Node.unkeep ( int d )

packageinherited

Definition at line 234 of file Node.java.

                                           {
     assert _keep >= d; _keep-=d;
     return (N)this;
   }

References com.cliffc.aa.node.Node._keep.

◆ unuse()

Node com.cliffc.aa.node.Node.unuse ( Node old )

privateinherited

Definition at line 178 of file Node.java.

                                  {
     if( old == null ) return this;
     old._uses.del(this);
     // Either last use of old & goes dead, or at least 1 fewer uses & changes liveness
     Env.GVN.add_unuse(old);
     if( old._uses._len!=0 && old._keep ==0 ) old.add_flow_def_extra(this);
     return this;
   }

References com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.add_flow_def_extra(), com.cliffc.aa.GVNGCM.add_unuse(), and com.cliffc.aa.Env.GVN.

Referenced by com.cliffc.aa.node.Node.kill(), com.cliffc.aa.node.Node.pop(), com.cliffc.aa.node.Node.remove(), and com.cliffc.aa.node.Node.set_def().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unwire()

void com.cliffc.aa.node.FunNode.unwire ( int idx )

package

Reimplemented from com.cliffc.aa.node.RegionNode.

Definition at line 296 of file FunNode.java.

                                  {
     Node ctl = in(idx);
     if( !(ctl instanceof ConNode) ) {
       if( ctl.in(0)._op != OP_CALL ) return;
       CallNode call = (CallNode)ctl.in(0);
       CallEpiNode cepi = call.cepi();
       if( cepi != null ) {
         int ridx = cepi._defs.find(ret());
         if( ridx != -1 ) Env.GVN.add_flow(cepi).remove(ridx);
       }
     }
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._op, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.OP_CALL, and com.cliffc.aa.node.FunNode.ret().

Here is the call graph for this function:

◆ val()

Type com.cliffc.aa.node.Node.val ( int idx )

inherited

Definition at line 470 of file Node.java.

470 { return in(idx)._val; }

References com.cliffc.aa.node.Node._val, and com.cliffc.aa.node.Node.in().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ value()

Type com.cliffc.aa.node.FunNode.value ( GVNGCM.Mode opt_mode )

Reimplemented from com.cliffc.aa.node.RegionNode.

Definition at line 869 of file FunNode.java.

                                                     {
     // Will be an error eventually, but act like its executed so the trailing
     // EpilogNode gets visited during GCP
     if( is_forward_ref() ) return Type.CTRL;
     if( _defs._len==2 && in(1)==this ) return Type.XCTRL; // Dead self-loop
     if( in(0)==this ) return _defs._len>=2 ? val(1) : Type.XCTRL; // is_copy
     for( int i=1; i<_defs._len; i++ ) {
       Type c = val(i);
       if( c == Type.CTRL || c == Type.ALL ) return Type.CTRL; // Valid path
     }
     return Type.XCTRL;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.type.Type< T extends Type< T >.ALL, com.cliffc.aa.type.Type< T extends Type< T >.CTRL, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.FunNode.is_forward_ref(), com.cliffc.aa.node.Node.val(), and com.cliffc.aa.type.Type< T extends Type< T >.XCTRL.

Here is the call graph for this function:

◆ walk_dom_last()

Node com.cliffc.aa.node.RegionNode.walk_dom_last ( Predicate< Node > P )

packageinherited

Reimplemented from com.cliffc.aa.node.Node.

Reimplemented in com.cliffc.aa.node.LoopNode.

Definition at line 157 of file RegionNode.java.

                                                   {
     // Allow moving up simple diamonds
     if( _defs._len==3 && in(1) instanceof ProjNode && in(1).in(0) instanceof IfNode &&
         in(1).in(0) == in(2).in(0) ) {
       Node n = in(1).in(0).walk_dom_last(P);
       if( n != null ) return n;
     }
     // Experimental stronger version
     if( _defs._len==3 && !(this instanceof FunNode) ) {
       Node n1 = in(1).walk_dom_last(P);
       Node n2 = in(2).walk_dom_last(P);
       if( n1 != null && n1==n2 ) return n1;
     }
     return P.test(this) ? this : null;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node.in(), and com.cliffc.aa.node.Node.walk_dom_last().

Here is the call graph for this function:

◆ walk_initype()

final void com.cliffc.aa.node.Node.walk_initype	(	GVNGCM	gvn,
		VBitSet	bs
	)

inherited

Definition at line 691 of file Node.java.

                                                            {
     if( bs.tset(_uid) ) return;    // Been there, done that
     _val = Type.ANY;               // Highest value
     _live = TypeMem.DEAD;          // Not alive
     // Walk reachable graph
     gvn.add_flow(this);
     for( Node use : _uses ) use.walk_initype(gvn,bs);
     for( Node def : _defs ) if( def != null ) def.walk_initype(gvn,bs);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._live, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.type.Type< T extends Type< T >.ANY, com.cliffc.aa.type.TypeMem.DEAD, and com.cliffc.aa.util.VBitSet.tset().

Referenced by com.cliffc.aa.GVNGCM.gcp().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ walk_opt()

void com.cliffc.aa.node.Node.walk_opt ( VBitSet visit )

inherited

Definition at line 797 of file Node.java.

                                         {
     assert !is_dead();
     if( visit.tset(_uid) ) return; // Been there, done that
  
     // Replace any constants.  Since the node computes a constant, its inputs
     // were never marked live, and so go dead and so go to ANY and so are not
     // available to recompute the constant later.
     Type val = _val;
     TypeFunPtr tfp;
     if( val instanceof TypeFunPtr &&
         _live.live_no_disp() &&
         (tfp=(TypeFunPtr)val)._disp!=TypeMemPtr.NO_DISP )
       val = tfp.make_no_disp();
     if( should_con(val) )
       subsume(con(val)).xliv(GVNGCM.Mode.Opto);
  
     // Walk reachable graph
     if( is_dead() ) return;
     Env.GVN.add_work_all(this);
     for( Node def : _defs )  if( def != null )  def.walk_opt(visit);
     for( Node use : _uses )                     use.walk_opt(visit);
   }

Referenced by com.cliffc.aa.GVNGCM.gcp(), and com.cliffc.aa.node.Node.walk_opt().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ walkerr_def()

void com.cliffc.aa.node.Node.walkerr_def	(	HashSet< ErrMsg >	errs,
		VBitSet	bs
	)

inherited

Definition at line 771 of file Node.java.

                                                               {
     if( bs.tset(_uid) ) return; // Been there, done that
     for( int i=0; i<_defs._len; i++ ) {
       Node def = _defs.at(i);   // Walk data defs for more errors
       if( def == null || def._val == Type.XCTRL ) continue;
       // Walk function bodies that are wired, but not bare FunPtrs.
       if( def instanceof FunPtrNode && !def.is_forward_ref() )
         continue;
       def.walkerr_def(errs,bs);
     }
     if( is_prim() ) return;
     // Skip reporting if any input is 'all', as the input should report instead.
     for( Node def : _defs )
       if( def !=null && def._val ==Type.ALL )
         return;                 // Skip reporting.
     adderr(errs);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.adderr(), com.cliffc.aa.type.Type< T extends Type< T >.ALL, com.cliffc.aa.node.Node.is_forward_ref(), com.cliffc.aa.node.Node.is_prim(), com.cliffc.aa.util.VBitSet.tset(), com.cliffc.aa.node.Node.walkerr_def(), and com.cliffc.aa.type.Type< T extends Type< T >.XCTRL.

Referenced by com.cliffc.aa.Parse.gather_errors(), and com.cliffc.aa.node.Node.walkerr_def().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ xliv()

Node com.cliffc.aa.node.Node.xliv ( GVNGCM.Mode opt_mode )

inherited

Definition at line 500 of file Node.java.

500 { _live = live(opt_mode); return this; }

References com.cliffc.aa.node.Node._live, and com.cliffc.aa.node.Node.live().

Referenced by com.cliffc.aa.TestLive.testBasic(), com.cliffc.aa.TestLive.testNewObj(), and com.cliffc.aa.node.Node.walk_opt().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ xstr()

String com.cliffc.aa.node.FunNode.xstr ( )

Reimplemented from com.cliffc.aa.node.Node.

Definition at line 105 of file FunNode.java.

105 { return name(); }

References com.cliffc.aa.node.FunNode.name().

Referenced by com.cliffc.aa.node.FunNode.str(), and com.cliffc.aa.node.UnresolvedNode.xstr().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ xval()

Type com.cliffc.aa.node.Node.xval ( )

inherited

Definition at line 460 of file Node.java.

                       {
     Type oval = _val;                     // Get old type
     Type nval = value(Env.GVN._opt_mode); // Get best type
     if( nval!=oval ) {
       _val = nval;
       Env.GVN.add_flow_uses(this); // Put uses on worklist... values flows downhill
     }
     return nval;
   }

References com.cliffc.aa.GVNGCM._opt_mode, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_flow_uses(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.Node.value().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ _bal_close

String com.cliffc.aa.node.FunNode._bal_close

Definition at line 60 of file FunNode.java.

Referenced by com.cliffc.aa.node.MemPrimNode.ReadPrimNode.as_fun(), com.cliffc.aa.node.MemPrimNode.WritePrimNode.as_fun(), com.cliffc.aa.node.NewNode< T extends TypeObj< T >.NewPrimNode< TypeAry >.as_fun(), com.cliffc.aa.Parse.bfact(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunNode.name(), and com.cliffc.aa.Parse.term().

◆ _cnt_size_inlines

byte com.cliffc.aa.node.FunNode._cnt_size_inlines

private

Definition at line 72 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.ideal_inline().

◆ _defs

Ary<Node> com.cliffc.aa.node.Node._defs

inherited

Definition at line 124 of file Node.java.

◆ _elock

boolean com.cliffc.aa.node.Node._elock

inherited

Definition at line 87 of file Node.java.

Referenced by com.cliffc.aa.node.Node._do_reduce(), com.cliffc.aa.node.Node._elock(), com.cliffc.aa.node.NewNode< TypeStruct >._init(), com.cliffc.aa.node.Node.check_vals(), com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.Node.copy(), com.cliffc.aa.node.Node.do_reduce(), com.cliffc.aa.node.Node.init1(), com.cliffc.aa.node.Node.kill(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.Node.unelock().

◆ _fidx

int com.cliffc.aa.node.FunNode._fidx

Definition at line 61 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.fidx(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.CEProjNode.good_call(), com.cliffc.aa.node.RetNode.is_copy(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunPtrNode.merge_ref_def(), com.cliffc.aa.node.RetNode.RetNode(), and com.cliffc.aa.node.FunNode.split_size().

◆ _INIT0_CNT

int com.cliffc.aa.node.Node._INIT0_CNT

staticinherited

Definition at line 58 of file Node.java.

Referenced by com.cliffc.aa.node.Node.init0(), com.cliffc.aa.node.Node.is_prim(), and com.cliffc.aa.TestLive.testNewObj().

◆ _keep

byte com.cliffc.aa.node.Node._keep

inherited

Definition at line 86 of file Node.java.

◆ _live

TypeMem com.cliffc.aa.node.Node._live

inherited

Definition at line 89 of file Node.java.

◆ _must_inline

int com.cliffc.aa.node.FunNode._must_inline

static

Definition at line 73 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.FunNode.reset(), and com.cliffc.aa.node.CallEpiNode.set_is_copy().

◆ _name

String com.cliffc.aa.node.FunNode._name

Definition at line 59 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.bind(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunNode.name(), and com.cliffc.aa.node.FunNode.names().

◆ _nongens

TV2 [] com.cliffc.aa.node.FunNode._nongens

private

Definition at line 70 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.set_nongens().

◆ _op

final byte com.cliffc.aa.node.Node._op

packageinherited

Definition at line 85 of file Node.java.

◆ _op_prec

final byte com.cliffc.aa.node.FunNode._op_prec

Definition at line 65 of file FunNode.java.

Referenced by com.cliffc.aa.Parse._expr(), com.cliffc.aa.node.UnresolvedNode.add_def_unresolved(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.FunNode.is_forward_ref(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunNode.name(), com.cliffc.aa.node.FunNode.names(), com.cliffc.aa.node.FunPtrNode.op_prec(), and com.cliffc.aa.Parse.term().

◆ _sig

TypeFunSig com.cliffc.aa.node.FunNode._sig

Definition at line 62 of file FunNode.java.

◆ _thunk_rhs

final boolean com.cliffc.aa.node.FunNode._thunk_rhs

Definition at line 68 of file FunNode.java.

Referenced by com.cliffc.aa.Parse._expr(), com.cliffc.aa.node.UnresolvedNode.add_def_unresolved(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.CEProjNode.good_call(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.FunNode.make_new_fun(), and com.cliffc.aa.node.ParmNode.valid_args().

◆ _tvar

TV2 com.cliffc.aa.node.Node._tvar

packageinherited

Definition at line 94 of file Node.java.

Referenced by com.cliffc.aa.node.MemJoinNode.add_alias_below(), com.cliffc.aa.node.Node.copy(), com.cliffc.aa.node.Node.Node(), and com.cliffc.aa.node.Node.tvar().

◆ _uid

int com.cliffc.aa.node.Node._uid

inherited

Definition at line 84 of file Node.java.

◆ _uses

Ary<Node> com.cliffc.aa.node.Node._uses

inherited

Definition at line 245 of file Node.java.

◆ _val

Type com.cliffc.aa.node.Node._val

inherited

Definition at line 88 of file Node.java.

◆ CNT

int com.cliffc.aa.node.Node.CNT =1

staticprivateinherited

Definition at line 59 of file Node.java.

Referenced by com.cliffc.aa.node.Node.init0(), com.cliffc.aa.node.Node.newuid(), com.cliffc.aa.node.Node.reset_to_init0(), and com.cliffc.aa.node.Node.roll_back_CNT().

◆ FLOW_VISIT

final VBitSet com.cliffc.aa.node.Node.FLOW_VISIT = new VBitSet()

staticprivateinherited

Definition at line 746 of file Node.java.

Referenced by com.cliffc.aa.node.Node.more_flow().

◆ FUNS

Ary<FunNode> com.cliffc.aa.node.FunNode.FUNS = new Ary<>(new FunNode[]{null,})

staticpackage

Definition at line 99 of file FunNode.java.

Referenced by com.cliffc.aa.node.FunNode.find_fidx(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.FunNode.make_new_fun(), com.cliffc.aa.node.FunPtrNode.merge_ref_def(), and com.cliffc.aa.node.FunNode.reset().

◆ LIVE

final VBitSet com.cliffc.aa.node.Node.LIVE = new VBitSet()

staticprivateinherited

Definition at line 60 of file Node.java.

Referenced by com.cliffc.aa.node.Node.init0(), com.cliffc.aa.node.Node.kill(), com.cliffc.aa.node.Node.newuid(), com.cliffc.aa.node.Node.reset_to_init0(), and com.cliffc.aa.node.Node.roll_back_CNT().

◆ OP_CALL

final byte com.cliffc.aa.node.Node.OP_CALL = 1

staticpackageinherited

Definition at line 17 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.CallNode.CallNode(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.Node.postorder(), com.cliffc.aa.node.FunNode.split_size(), and com.cliffc.aa.node.FunNode.unwire().

◆ OP_CALLEPI

final byte com.cliffc.aa.node.Node.OP_CALLEPI = 2

staticpackageinherited

Definition at line 18 of file Node.java.

Referenced by com.cliffc.aa.node.CallEpiNode.CallEpiNode(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.RetNode.tail_recursive().

◆ OP_CAST

final byte com.cliffc.aa.node.Node.OP_CAST = 3

staticpackageinherited

Definition at line 19 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), and com.cliffc.aa.node.CastNode.CastNode().

◆ OP_CON

final byte com.cliffc.aa.node.Node.OP_CON = 4

staticpackageinherited

Definition at line 20 of file Node.java.

Referenced by com.cliffc.aa.node.ConNode< T extends Type >.ConNode().

◆ OP_CONTYPE

final byte com.cliffc.aa.node.Node.OP_CONTYPE = 5

staticpackageinherited

Definition at line 21 of file Node.java.

Referenced by com.cliffc.aa.node.ConTypeNode.ConTypeNode().

◆ OP_CPROJ

final byte com.cliffc.aa.node.Node.OP_CPROJ = 6

staticpackageinherited

Definition at line 22 of file Node.java.

Referenced by com.cliffc.aa.node.CProjNode.CProjNode(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_tail(), com.cliffc.aa.node.Node.postorder(), and com.cliffc.aa.node.RetNode.tail_recursive().

◆ OP_DEFMEM

final byte com.cliffc.aa.node.Node.OP_DEFMEM = 7

staticpackageinherited

Definition at line 23 of file Node.java.

Referenced by com.cliffc.aa.node.DefMemNode.DefMemNode(), and com.cliffc.aa.node.FunNode.find_body().

◆ OP_ERR

final byte com.cliffc.aa.node.Node.OP_ERR = 8

staticpackageinherited

Definition at line 24 of file Node.java.

Referenced by com.cliffc.aa.node.ErrNode.ErrNode().

◆ OP_FP2DISP

final byte com.cliffc.aa.node.Node.OP_FP2DISP =10

staticpackageinherited

Definition at line 26 of file Node.java.

Referenced by com.cliffc.aa.node.FP2DispNode.FP2DispNode().

◆ OP_FRESH

final byte com.cliffc.aa.node.Node.OP_FRESH = 9

staticpackageinherited

Definition at line 25 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), and com.cliffc.aa.node.FreshNode.FreshNode().

◆ OP_FUN

final byte com.cliffc.aa.node.Node.OP_FUN =11

staticpackageinherited

Definition at line 27 of file Node.java.

Referenced by com.cliffc.aa.node.Node.dumprpo(), com.cliffc.aa.node.FunNode.find_body(), com.cliffc.aa.node.FunNode.FunNode(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_FUNPTR

final byte com.cliffc.aa.node.Node.OP_FUNPTR =12

staticpackageinherited

Definition at line 28 of file Node.java.

Referenced by com.cliffc.aa.node.FunPtrNode.FunPtrNode(), and com.cliffc.aa.node.RetNode.tail_recursive().

◆ OP_IF

final byte com.cliffc.aa.node.Node.OP_IF =13

staticpackageinherited

Definition at line 29 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.IfNode.IfNode(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_JOIN

final byte com.cliffc.aa.node.Node.OP_JOIN =14

staticpackageinherited

Definition at line 30 of file Node.java.

Referenced by com.cliffc.aa.node.MemJoinNode.MemJoinNode().

◆ OP_LOAD

final byte com.cliffc.aa.node.Node.OP_LOAD =15

staticpackageinherited

Definition at line 31 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.LoadNode.LoadNode(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_LOOP

final byte com.cliffc.aa.node.Node.OP_LOOP =16

staticpackageinherited

Definition at line 32 of file Node.java.

Referenced by com.cliffc.aa.node.LoadNode.ideal_grow(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.LoopNode.LoopNode().

◆ OP_MAX

final byte com.cliffc.aa.node.Node.OP_MAX =36

staticpackageinherited

Definition at line 52 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.split_size().

◆ OP_NAME

final byte com.cliffc.aa.node.Node.OP_NAME =17

staticpackageinherited

Definition at line 33 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), and com.cliffc.aa.node.IntrinsicNode.IntrinsicNode().

◆ OP_NEWARY

final byte com.cliffc.aa.node.Node.OP_NEWARY =19

staticpackageinherited

Definition at line 35 of file Node.java.

◆ OP_NEWOBJ

final byte com.cliffc.aa.node.Node.OP_NEWOBJ =18

staticpackageinherited

Definition at line 34 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_NEWSTR

final byte com.cliffc.aa.node.Node.OP_NEWSTR =20

staticpackageinherited

Definition at line 36 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), and com.cliffc.aa.node.Node.is_multi_head().

◆ OP_PARM

final byte com.cliffc.aa.node.Node.OP_PARM =21

staticpackageinherited

Definition at line 37 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.find_body(), com.cliffc.aa.node.Node.is_multi_tail(), and com.cliffc.aa.node.ParmNode.ParmNode().

◆ OP_PHI

final byte com.cliffc.aa.node.Node.OP_PHI =22

staticpackageinherited

Definition at line 38 of file Node.java.

Referenced by com.cliffc.aa.node.LoadNode.ideal_grow(), com.cliffc.aa.node.Node.is_multi_tail(), com.cliffc.aa.node.PhiNode.PhiNode(), com.cliffc.aa.node.RegionNode.stacked_region(), and com.cliffc.aa.node.RetNode.tail_recursive().

◆ OP_PRIM

final byte com.cliffc.aa.node.Node.OP_PRIM =23

staticpackageinherited

Definition at line 39 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.PrimNode.PrimNode(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_PROJ

final byte com.cliffc.aa.node.Node.OP_PROJ =24

staticpackageinherited

Definition at line 40 of file Node.java.

Referenced by com.cliffc.aa.node.Node.is_multi_tail(), and com.cliffc.aa.node.ProjNode.ProjNode().

◆ OP_REGION

final byte com.cliffc.aa.node.Node.OP_REGION =25

staticpackageinherited

Definition at line 41 of file Node.java.

Referenced by com.cliffc.aa.node.RegionNode.add_flow_def_extra(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.RegionNode.RegionNode(), com.cliffc.aa.node.FunNode.split_size(), com.cliffc.aa.node.RegionNode.stacked_region(), and com.cliffc.aa.node.RetNode.tail_recursive().

◆ OP_RET

final byte com.cliffc.aa.node.Node.OP_RET =26

staticpackageinherited

Definition at line 42 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.Node.dumprpo(), com.cliffc.aa.node.FunNode.find_body(), com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.postorder(), com.cliffc.aa.node.RetNode.RetNode(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_SCOPE

final byte com.cliffc.aa.node.Node.OP_SCOPE =27

staticpackageinherited

Definition at line 43 of file Node.java.

Referenced by com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.ScopeNode.ScopeNode(), and com.cliffc.aa.node.FunNode.split_size().

◆ OP_SPLIT

final byte com.cliffc.aa.node.Node.OP_SPLIT =28

staticpackageinherited

Definition at line 44 of file Node.java.

Referenced by com.cliffc.aa.node.Node.is_multi_head(), com.cliffc.aa.node.MemSplitNode.MemSplitNode(), and com.cliffc.aa.node.Node.postorder().

◆ OP_START

final byte com.cliffc.aa.node.Node.OP_START =29

staticpackageinherited

Definition at line 45 of file Node.java.

Referenced by com.cliffc.aa.node.Node.is_CFG(), com.cliffc.aa.node.Node.is_multi_head(), and com.cliffc.aa.node.StartNode.StartNode().

◆ OP_STMEM

final byte com.cliffc.aa.node.Node.OP_STMEM =30

staticpackageinherited

Definition at line 46 of file Node.java.

Referenced by com.cliffc.aa.node.StartMemNode.StartMemNode().

◆ OP_STORE

final byte com.cliffc.aa.node.Node.OP_STORE =31

staticpackageinherited

Definition at line 47 of file Node.java.

Referenced by com.cliffc.aa.node.FunNode.bad_mem_use(), com.cliffc.aa.node.FunNode.split_size(), and com.cliffc.aa.node.StoreNode.StoreNode().

◆ OP_THRET

final byte com.cliffc.aa.node.Node.OP_THRET =32

staticpackageinherited

Definition at line 48 of file Node.java.

Referenced by com.cliffc.aa.node.ThretNode.ThretNode().

◆ OP_THUNK

final byte com.cliffc.aa.node.Node.OP_THUNK =33

staticpackageinherited

Definition at line 49 of file Node.java.

Referenced by com.cliffc.aa.node.ThunkNode.ThunkNode().

◆ OP_TYPE

final byte com.cliffc.aa.node.Node.OP_TYPE =34

staticpackageinherited

Definition at line 50 of file Node.java.

Referenced by com.cliffc.aa.node.AssertNode.AssertNode().

◆ OP_UNR

final byte com.cliffc.aa.node.Node.OP_UNR =35

staticpackageinherited

Definition at line 51 of file Node.java.

Referenced by com.cliffc.aa.node.UnresolvedNode.UnresolvedNode().

◆ STRS

final String [] com.cliffc.aa.node.Node.STRS = new String[] { null, "Call", "CallEpi", "Cast", "Con", "ConType", "CProj", "DefMem", "Err", "Fresh", "FP2Disp", "Fun", "FunPtr", "If", "Join", "Load", "Loop", "Name", "NewObj", "NewAry", "NewStr", "Parm", "Phi", "Prim", "Proj", "Region", "Return", "Scope","Split", "Start", "StartMem", "Store", "Thret", "Thunk", "Type", "Unresolved" }

staticprivateinherited

Definition at line 54 of file Node.java.

Referenced by com.cliffc.aa.node.Node.xstr().

◆ VALS

final ConcurrentHashMap<Node,Node> com.cliffc.aa.node.Node.VALS = new ConcurrentHashMap<>()

staticinherited

Definition at line 537 of file Node.java.

Referenced by com.cliffc.aa.node.Node._do_reduce(), com.cliffc.aa.node.Node._elock(), com.cliffc.aa.node.Node.check_vals(), com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.Node.init1(), com.cliffc.aa.node.Node.kill(), com.cliffc.aa.node.Node.reset_to_init0(), and com.cliffc.aa.node.Node.unelock().

The documentation for this class was generated from the following file:

FunNode.java

Public Member Functions

Static Public Member Functions

Public Attributes

Static Public Attributes

Package Functions

Static Package Functions

Package Attributes

Static Package Attributes

Private Member Functions

Static Private Member Functions

Private Attributes

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ FunNode() [1/6]

◆ FunNode() [2/6]

◆ FunNode() [3/6]

◆ FunNode() [4/6]

◆ FunNode() [5/6]

◆ FunNode() [6/6]

Member Function Documentation

◆ [static initializer]()

◆ _do_reduce()

◆ _elock()

◆ _header()

◆ add_def()

◆ add_flow_def_extra()

◆ add_flow_extra()

◆ add_flow_use_extra()

◆ add_reduce_extra()

◆ adderr()

◆ all_live()

◆ bad_mem_use()

◆ bind()

◆ check_callers()

◆ check_solo_mem_writer()

◆ check_vals()

◆ con()

◆ copy()

◆ del()

◆ do_flow()

◆ do_grow()

◆ do_mono()

◆ do_reduce()

◆ dump() [1/5]

◆ dump() [2/5]

◆ dump() [3/5]

◆ dump() [4/5]

◆ dump() [5/5]

◆ dumprpo()

◆ equals()

◆ err()

◆ escapees()

◆ fidx()

◆ find() [1/2]

◆ find() [2/2]

◆ find_body()

◆ find_fidx()

◆ find_type_split()

◆ find_type_split_index()

◆ formal()

◆ fptr()

◆ get_mem_writer()

◆ has_unknown_callers()

◆ hashCode()

◆ ideal_grow()

◆ ideal_inline()

◆ ideal_mono()

◆ ideal_reduce()

◆ in()

◆ init0()

◆ init1()

◆ insert() [1/2]

◆ insert() [2/2]

◆ is_CFG()

◆ is_copy()

◆ is_dead()

◆ is_forward_ref()

◆ is_mem()

◆ is_multi_head()