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

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

Public Member Functions
	CallEpiNode (Node... nodes)

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 ()

CallNode	call ()

boolean	check_and_wire ()

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)

Node	get_mem_writer ()

int	hashCode ()

Node	ideal_grow ()

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)

TV2	new_tvar (String alloc_site)

int	nwired ()

byte	op_prec ()

Node	pop ()

Node	remove (int idx)

void	replace (Node old, Node nnn)

void	set_dead ()

Node	set_def (int idx, Node n)

Type	sharptr (Node mem)

boolean	should_con (Type t)

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)

RetNode	wired (int x)

Node	xliv (GVNGCM.Mode opt_mode)

String	xstr ()

Type	xval ()

Static Public Member Functions
static Node	con (Type t)

static void	init0 ()

static void	reset_to_init0 ()

static void	roll_back_CNT ()

Public Attributes
Ary< Node >	_defs

boolean	_elock

boolean	_is_copy

byte	_keep

TypeMem	_live

int	_uid

Ary< Node >	_uses

Type	_val

Static Public Attributes
static int	_INIT0_CNT

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

Package Functions
Node	_elock ()

boolean	check_solo_mem_writer (Node memw)

BitsAlias	escapees ()

boolean	is_CFG ()

Node	is_pure_call ()

public< N extends Node > N	keep ()

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

int	newuid ()

boolean	sane_wiring ()

String	str ()

public< N extends Node > N	unhook ()

public< N extends Node > N	unkeep ()

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

CallEpiNode	unwire (CallNode call, RetNode ret)

Node	walk_dom_last (Predicate< Node > P)

void	wire0 (CallNode call, Node fun)

void	wire1 (CallNode call, Node fun, Node ret)

Static Package Functions
	[static initializer]

static BitsAlias	esc_out (TypeMem tmem, Type trez)

Package Attributes
final byte	_op

TV2	_tvar

Static Package Attributes
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
Node	_do_reduce ()

void	adderr (HashSet< ErrMsg > errs)

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)

boolean	is_multi_tail ()

Node	merge (Node x)

int	more_flow (boolean lifting, int errs)

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

CallEpiNode	set_is_copy (Node ctl, Node mem, Node rez)

Node	unuse (Node old)

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

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 24 of file CallEpiNode.java.

Constructor & Destructor Documentation

◆ CallEpiNode()

com.cliffc.aa.node.CallEpiNode.CallEpiNode ( Node... nodes )

Definition at line 26 of file CallEpiNode.java.

                                       {
     super(OP_CALLEPI,nodes);
     assert nodes[1] instanceof DefMemNode;
   }

References com.cliffc.aa.node.Node.OP_CALLEPI.

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.Node.add_flow_def_extra ( Node chg )

inherited

Reimplemented in com.cliffc.aa.node.CallNode, com.cliffc.aa.node.NewNode< T extends TypeObj< T >, com.cliffc.aa.node.RegionNode, com.cliffc.aa.node.MrgProjNode, and com.cliffc.aa.node.MemJoinNode.

Definition at line 515 of file Node.java.

515 { }

Referenced by com.cliffc.aa.node.ScopeNode.set_mem(), and com.cliffc.aa.node.Node.unuse().

Here is the caller 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.CallEpiNode.add_flow_use_extra ( Node chg )

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

Definition at line 369 of file CallEpiNode.java.

                                                      {
     if( chg instanceof CallNode ) { // If the Call changes value
       Env.GVN.add_flow(chg.in(MEM_IDX));       // The called memory   changes liveness
       Env.GVN.add_flow(((CallNode)chg).fdx()); // The called function changes liveness
       for( int i=0; i<nwired(); i++ )          // Called returns change liveness
         Env.GVN.add_flow(wired(i));
     }
   }

References com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.CallEpiNode.nwired(), and com.cliffc.aa.node.CallEpiNode.wired().

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.CallEpiNode.all_live ( )

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

Definition at line 437 of file CallEpiNode.java.

437 { return TypeMem.ALLMEM; }

References com.cliffc.aa.type.TypeMem.ALLMEM.

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

Here is the caller graph for this function:

◆ call()

CallNode com.cliffc.aa.node.CallEpiNode.call ( )

Definition at line 35 of file CallEpiNode.java.

35 { return (CallNode)in(0); }

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ check_and_wire()

boolean com.cliffc.aa.node.CallEpiNode.check_and_wire ( )

Definition at line 179 of file CallEpiNode.java.

                                    {
     if( !(_val instanceof TypeTuple) ) return false; // Collapsing
     CallNode call = call();
     Type tcall = call._val;
     if( !(tcall instanceof TypeTuple) ) return false;
     BitsFun fidxs = CallNode.ttfp(tcall)._fidxs;
     if( fidxs.above_center() )  return false; // Still choices to be made during GCP.
  
     // Check all fidxs for being wirable
     boolean progress = false;
     for( int fidx : fidxs ) {                 // For all fidxs
       if( BitsFun.is_parent(fidx) ) continue; // Do not wire parents, as they will eventually settle out
       FunNode fun = FunNode.find_fidx(fidx);  // Lookup, even if not wired
       if( fun.is_dead() ) continue;           // Already dead, stale fidx
       if( fun.is_forward_ref() ) continue;    // Not forward refs, which at GCP just means a syntax error
       RetNode ret = fun.ret();
       if( ret==null ) continue;               // Mid-death
       if( _defs.find(ret) != -1 ) continue;   // Wired already
       if( !CEProjNode.good_call(tcall,fun) ) continue; // Args fail basic sanity
       progress=true;
       wire1(call,fun,ret);      // Wire Call->Fun, Ret->CallEpi
     }
     return progress;
   }

Referenced by com.cliffc.aa.GVNGCM.check_and_wire(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), and com.cliffc.aa.node.CallNode.ideal_reduce().

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.Node.copy ( boolean copy_edges )

inherited

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

Definition at line 264 of file Node.java.

                                                  {
     try {
       Node n = (Node)clone();
       n._uid = newuid();                  // A new UID
       n._defs = new Ary<>(new Node[1],0); // New empty defs
       n._uses = new Ary<>(new Node[1],0); // New empty uses
       n._tvar = n.new_tvar("copy_constructor");
       n._keep = 0;              // Not keeping, even if cloning a mid-keeper operation
       n._elock=false;           // Not in GVN
       if( copy_edges )
         for( Node def : _defs )
           n.add_def(def);
       Env.GVN.add_work_all(n);
       return n;
     } catch( CloneNotSupportedException cns ) { throw new RuntimeException(cns); }
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._elock, com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._tvar, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.GVNGCM.add_work_all(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.new_tvar(), com.cliffc.aa.node.Node.newuid(), and com.cliffc.aa.node.Node.Node().

Referenced by com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.TestNode.test1monotonic_prim().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ 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.Node.equals ( Object o )

inherited

Definition at line 112 of file Node.java.

                                             {
     if( this==o ) return true;
     if( !(o instanceof Node) ) return false;
     Node n = (Node)o;
     if( _op != n._op ) return false;
     if( n._defs==null || _defs._len != n._defs._len ) return false;
     // Note pointer-equality
     for( int i=0; i<_defs._len; i++ ) if( _defs._es[i] != n._defs._es[i] ) return false;
     return true;
   }

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

Here is the call graph for this function:

◆ 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:

◆ esc_out()

static BitsAlias com.cliffc.aa.node.CallEpiNode.esc_out	(	TypeMem	tmem,
		Type	trez
	)

staticpackage

Definition at line 361 of file CallEpiNode.java.

                                                       {
     if( trez == Type.XNIL || trez == Type.NIL ) return BitsAlias.EMPTY;
     if( trez instanceof TypeFunPtr ) trez = ((TypeFunPtr)trez)._disp;
     if( trez instanceof TypeMemPtr )
       return tmem.all_reaching_aliases(((TypeMemPtr)trez)._aliases);
     return TypeMemPtr.OOP0.dual().isa(trez) ? BitsAlias.NZERO : BitsAlias.EMPTY;
   }

References com.cliffc.aa.type.TypeMem.all_reaching_aliases(), com.cliffc.aa.type.Type< T extends Type< T >.dual(), com.cliffc.aa.type.BitsAlias.EMPTY, com.cliffc.aa.type.Type< T extends Type< T >.NIL, com.cliffc.aa.type.BitsAlias.NZERO, com.cliffc.aa.type.TypeMemPtr.OOP0, and com.cliffc.aa.type.Type< T extends Type< T >.XNIL.

Referenced by com.cliffc.aa.node.CallNode._ideal_grow(), com.cliffc.aa.node.CallNode.escapees(), and com.cliffc.aa.node.CallEpiNode.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ escapees()

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

package

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

Definition at line 509 of file CallEpiNode.java.

509 { return BitsAlias.FULL; }

References com.cliffc.aa.type.BitsAlias.FULL.

◆ 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:

◆ 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:

◆ 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_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.CallEpiNode.ideal_reduce ( )

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

Definition at line 40 of file CallEpiNode.java.

                                        {
     if( _is_copy ) return null;
     CallNode call = call();
     Type tc = call._val;
     if( !(tc instanceof TypeTuple) ) return null;
     TypeTuple tcall = (TypeTuple)tc;
     if( CallNode.tctl(tcall) != Type.CTRL ) return null; // Call not executable
     // Get calls resolved function.
     BitsFun fidxs = CallNode.ttfp(tcall).fidxs();
  
     // If the call's allowed functions excludes any wired, remove the extras
     if( !fidxs.test(BitsFun.ALL) ) { // Shortcut
       for( int i = 0; i < nwired(); i++ ) {
         RetNode ret = wired(i);
         if( !fidxs.test_recur(ret.fidx()) ) { // Wired call not in execution set?
           assert !BitsFun.is_parent(ret.fidx());
           // Remove the edge.  Pre-GCP all CG edges are virtual, and are lazily
           // and pessimistically filled in by ideal calls.  During the course
           // of lifting types some of the manifested CG edges are killed.
           // Post-GCP all CG edges are manifest, but types can keep lifting
           // and so CG edges can still be killed.
           unwire(call,ret);
           return this; // Return with progress
         }
       }
     }
  
     // See if we can wire any new fidxs directly between Call/Fun and Ret/CallEpi.
     // This *adds* edges, but enables a lot of shrinking via inlining.
     if( check_and_wire() ) return this;
  
     // The one allowed function is already wired?  Then directly inline.
     // Requires this calls 1 target, and the 1 target is only called by this.
     if( nwired()==1 && fidxs.abit() != -1 ) { // Wired to 1 target
       RetNode ret = wired(0);                 // One wired return
       FunNode fun = ret.fun();
       Type tdef = Env.DEFMEM._uses._len==0 ? null : Env.DEFMEM._val;
       TypeTuple tret = ret._val instanceof TypeTuple ? (TypeTuple) ret._val : (TypeTuple)ret._val.oob(TypeTuple.RET);
       Type tretmem = tret.at(1);
       if( fun != null && fun._defs._len==2 && // Function is only called by 1 (and not the unknown caller)
           (call.err(true)==null || fun._thunk_rhs) &&       // And args are ok
           (tdef==null || CallNode.emem(tcall).isa(tdef)) && // Pre-GCP, call memory has to be as good as the default
           (tdef==null || tretmem.isa(tdef)) &&  // Call and return memory at least as good as default
           call.mem().in(0) != call &&   // Dead self-recursive
           fun.in(1)._uses._len==1 &&    // And only calling fun
           ret._live.isa(_live) &&       // Call and return liveness compatible
           !fun.noinline() ) {           // And not turned off
         assert fun.in(1).in(0)==call;   // Just called by us
         fun.set_is_copy();              // Collapse the FunNode into the Call
         return set_is_copy(ret.ctl(), ret.mem(), ret.rez()); // Collapse the CallEpi into the Ret
       }
     }
  
     // Parser thunks eagerly inline
     if( call.fdx() instanceof ThretNode ) {
       ThretNode tret = (ThretNode)call.fdx();
       wire1(call,tret.thunk(),tret);
       return set_is_copy(tret.ctrl(), tret.mem(), tret.rez()); // Collapse the CallEpi into the Thret
     }
  
     // Only inline wired single-target function with valid args.  CallNode wires.
     if( nwired()!=1 ) return null; // More than 1 wired, inline only via FunNode
     int fidx = fidxs.abit();       // Could be 1 or multi
     if( fidx == -1 ) return null;  // Multi choices, only 1 wired at the moment.
     if( fidxs.above_center() ) return null; // Can be unresolved yet
     if( BitsFun.is_parent(fidx) ) return null; // Parent, only 1 child wired
  
     if( call.err(true)!=null ) return null; // CallNode claims args in-error, do not inline
  
     // Call allows 1 function not yet inlined, sanity check it.
     int cnargs = call.nargs();
     FunNode fun = FunNode.find_fidx(fidx);
     assert !fun.is_forward_ref() && !fun.is_dead()
       && fun.nargs() == cnargs; // All checked by call.err
     if( fun._val != Type.CTRL ) return null;
     RetNode ret = fun.ret();    // Return from function
     if( ret==null ) return null;
  
     // Single choice; check no conversions needed.
     TypeTuple formals = fun._sig._formals;
     for( Node parm : fun._uses ) {
       if( parm instanceof ParmNode && parm.in(0)==fun ) {
         int idx = ((ParmNode)parm)._idx;
         if( idx < 0 ) continue; // RPC
         Type actual = CallNode.targ(tcall,idx);
         if( actual.isBitShape(formals.at(idx)) == 99 ) // Requires user-specified conversion
           return null;
       }
     }
  
  
     // Check for several trivial cases that can be fully inlined immediately.
     Node cctl = call.ctl();
     Node cmem = call.mem();
     Node rctl = ret.ctl();      // Control being returned
     Node rmem = ret.mem();      // Memory  being returned
     Node rrez = ret.rez();      // Result  being returned
     boolean inline = !fun.noinline();
     // If the function does nothing with memory, then use the call memory directly.
     if( (rmem instanceof ParmNode && rmem.in(CTL_IDX) == fun) || rmem._val ==TypeMem.XMEM )
       rmem = cmem;
     // Check that function return memory and post-call memory are compatible
     if( !(_val instanceof TypeTuple) ) return null;
     Type selfmem = ((TypeTuple) _val).at(MEM_IDX);
     if( !rmem._val.isa( selfmem ) && !(selfmem==TypeMem.ANYMEM && call.is_pure_call()!=null) )
       return null;
  
     // Check for zero-op body (id function)
     if( rrez instanceof ParmNode && rrez.in(CTL_IDX) == fun && cmem == rmem && inline )
       return unwire(call,ret).set_is_copy(cctl,cmem,call.arg(((ParmNode)rrez)._idx)); // Collapse the CallEpi
  
     // Check for constant body
     Type trez = rrez._val;
     if( trez.is_con() && rctl==fun && cmem == rmem && inline )
       return unwire(call,ret).set_is_copy(cctl,cmem,Node.con(trez));
  
     // Check for a 1-op body using only constants or parameters and no memory effects
     boolean can_inline=!(rrez instanceof ParmNode) && rmem==cmem && inline;
     for( Node parm : rrez._defs )
       if( parm != null && parm != fun &&
           !(parm instanceof ParmNode && parm.in(0) == fun) &&
           !(parm instanceof ConNode) )
         can_inline=false;       // Not trivial
     if( can_inline ) {
       Node irez = rrez.copy(false); // Copy the entire function body
       ProjNode proj = ProjNode.proj(this,REZ_IDX);
       irez._live = proj==null ? TypeMem.ESCAPE : proj._live;
       for( Node parm : rrez._defs )
         irez.add_def((parm instanceof ParmNode && parm.in(CTL_IDX) == fun) ? call.arg(((ParmNode)parm)._idx) : parm);
       if( irez instanceof PrimNode ) ((PrimNode)irez)._badargs = call._badargs;
       GVN.add_work_all(irez);
       return unwire(call,ret).set_is_copy(cctl,cmem,irez);
     }
  
     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.CallEpiNode.is_copy ( int idx )

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

Definition at line 394 of file CallEpiNode.java.

394 { return _is_copy ? in(idx) : null; }

References com.cliffc.aa.node.CallEpiNode._is_copy, and 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.Node.is_forward_ref ( )

inherited

Reimplemented in com.cliffc.aa.node.FunNode, com.cliffc.aa.node.FunPtrNode, com.cliffc.aa.node.RetNode, and com.cliffc.aa.node.ConTypeNode.

Definition at line 830 of file Node.java.

830 { return false; }

Referenced by com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.StoreNode.ideal_reduce(), com.cliffc.aa.Parse.inc(), com.cliffc.aa.node.NewObjNode.promote_forward(), com.cliffc.aa.Parse.stmt(), and com.cliffc.aa.node.Node.walkerr_def().

Here is the caller graph for this function:

◆ is_mem()

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

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

Definition at line 36 of file CallEpiNode.java.

36 { return true; }

◆ 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.CallEpiNode.is_pure_call ( )

package

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

Definition at line 503 of file CallEpiNode.java.

503 { return in(0) instanceof CallNode ? call().is_pure_call() : null; }

References com.cliffc.aa.node.CallEpiNode.call(), com.cliffc.aa.node.Node.in(), and com.cliffc.aa.node.CallNode.is_pure_call().

Here is the call 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.CallEpiNode.live_use	(	GVNGCM.Mode	opt_mode,
		Node	def
	)

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

Definition at line 440 of file CallEpiNode.java.

                                                                      {
     assert _keep==0 || _live==all_live();
     if( _is_copy ) return def._live; // A copy
     // Not a copy
     if( def==in(0) ) return _live; // The Call
     if( def==in(1) ) return opt_mode._CG ? TypeMem.DEAD : _live; // The DefMem
     // Wired return.
     // The given function is alive, only if the Call will Call it.
     Type tcall = call()._val;
     if( !(tcall instanceof TypeTuple) ) return tcall.above_center() ? TypeMem.DEAD : _live;
     BitsFun fidxs = CallNode.ttfp(tcall).fidxs();
     int fidx = ((RetNode)def).fidx();
     if( fidxs.above_center() || !fidxs.test_recur(fidx) )
       return TypeMem.DEAD;    // Call does not call this, so not alive.
     return _live;
   }

Here is the call graph for this function:

◆ 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:

◆ 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:

◆ 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:

◆ nwired()

int com.cliffc.aa.node.CallEpiNode.nwired ( )

Definition at line 37 of file CallEpiNode.java.

37 { return _defs._len-2; }

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

Referenced by com.cliffc.aa.node.CallEpiNode.add_flow_use_extra(), com.cliffc.aa.node.CallNode.all_fcns_wired(), com.cliffc.aa.Parse.do_call0(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.live(), com.cliffc.aa.node.CallEpiNode.sane_wiring(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.CallEpiNode.value().

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:

◆ 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_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:

◆ 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:

◆ sane_wiring()

boolean com.cliffc.aa.node.CallEpiNode.sane_wiring ( )

package

Definition at line 379 of file CallEpiNode.java.

                         {
     CallNode call = call();
     for( int i=0; i<nwired(); i++ ) {
       RetNode ret = wired(i);
       if( ret.is_copy() ) return true; // Abort check, will be misaligned until dead path removed
       FunNode fun = ret.fun();
       boolean found=false;
       for( Node def : fun._defs )
         if( def instanceof CEProjNode && def.in(0)==call )
           { found=true; break; }
       if( !found ) return false;
     }
     return true;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.CallEpiNode.call(), com.cliffc.aa.node.RetNode.fun(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.RetNode.is_copy(), com.cliffc.aa.node.CallEpiNode.nwired(), and com.cliffc.aa.node.CallEpiNode.wired().

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

Here is the call graph for this function:

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()

CallEpiNode com.cliffc.aa.node.CallEpiNode.set_is_copy	(	Node	ctl,
		Node	mem,
		Node	rez
	)

private

Definition at line 396 of file CallEpiNode.java.

                                                                   {
     CallNode call = call();
     if( FunNode._must_inline == call._uid ) // Assert an expected inlining happens
       FunNode._must_inline = 0;
     if( mem instanceof IntrinsicNode ) // Better error message for Intrinsic if Call args are bad
       ((IntrinsicNode)mem)._badargs = call._badargs[1];
     call._is_copy=_is_copy=true;
     // Memory was split at the Call, according to the escapes aliases, and
     // rejoined at the CallEpi.  We need to make that explicit here.
     GVNGCM.retype_mem(null,call,this,false);
  
     Env.GVN.add_reduce_uses(call);
     Env.GVN.add_reduce_uses(this);
     while( _defs._len>0 ) pop();
     add_def(ctl);
     add_def(mem);
     add_def(rez);
     return this;
   }

References com.cliffc.aa.node.CallNode._badargs, com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.CallEpiNode._is_copy, com.cliffc.aa.node.CallNode._is_copy, com.cliffc.aa.node.FunNode._must_inline, com.cliffc.aa.node.Node._uid, com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.GVNGCM.add_reduce_uses(), com.cliffc.aa.node.CallEpiNode.call(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.pop(), and com.cliffc.aa.GVNGCM.retype_mem().

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:

◆ 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:

◆ str()

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

packageinherited

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

Definition at line 283 of file Node.java.

283 { return xstr(); } // Inline longer name

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

Referenced by com.cliffc.aa.node.Node.dump(), and com.cliffc.aa.node.ConNode< T extends Type >.toString().

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:

◆ 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.Node.unify ( boolean test )

inherited

Definition at line 523 of file Node.java.

523 { 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()

CallEpiNode com.cliffc.aa.node.CallEpiNode.unwire	(	CallNode	call,
		RetNode	ret
	)

package

Definition at line 416 of file CallEpiNode.java.

                                                  {
     assert sane_wiring();
     if( !ret.is_copy() ) {
       FunNode fun = ret.fun();
       for( int i = 1; i < fun._defs._len; i++ ) // Unwire
         if( fun.in(i).in(0) == call ) {
           fun.set_def(i, Env.XCTRL);
           Env.GVN.add_flow(fun);
           for( Node use : fun._uses ) {
             Env.GVN.add_flow(use); // Dead path, all Phis can lift
             Env.GVN.add_flow_defs(use); // All Phi uses lose a use
           }
           break;
         }
     }
     del(_defs.find(ret));
     Env.GVN.add_reduce(ret);
     assert sane_wiring();
     return this;
   }

References com.cliffc.aa.node.Node._defs, 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(), com.cliffc.aa.node.CallEpiNode.call(), com.cliffc.aa.node.Node.del(), com.cliffc.aa.node.RetNode.fun(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.RetNode.is_copy(), com.cliffc.aa.node.CallEpiNode.sane_wiring(), com.cliffc.aa.node.Node.set_def(), and com.cliffc.aa.Env.XCTRL.

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:

◆ 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.CallEpiNode.value ( GVNGCM.Mode opt_mode )

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

Definition at line 254 of file CallEpiNode.java.

                                                     {
     if( _is_copy ) return _val; // A copy
     Type tin0 = val(0);
     if( !(tin0 instanceof TypeTuple) )
       return tin0.oob();     // Weird stuff?
     TypeTuple tcall = (TypeTuple)tin0;
     if( tcall._ts.length < ARG_IDX ) return tcall.oob(); // Weird stuff
  
     // Get Call result.  If the Call args are in-error, then the Call is called
     // and we flow types to the post-call.... BUT the bad args are NOT passed
     // along to the function being called.
     // tcall[0] = Control
     // tcall[1] = Memory passed around the functions.
     // tcall[2] = TypeFunPtr passed to FP2Closure
     // tcall[3+]= Arg types
     Type ctl = CallNode.tctl(tcall); // Call is reached or not?
     if( ctl != Type.CTRL && ctl != Type.ALL )
       return TypeTuple.CALLE.dual();
     TypeFunPtr tfptr= CallNode.ttfpx(tcall); // Peel apart Call tuple
     TypeMemPtr tescs= CallNode.tesc(tcall);  // Peel apart Call tuple
  
     // Fidxes; if still in the parser, assuming calling everything
     BitsFun fidxs = tfptr==null || tfptr.is_forward_ref() ? BitsFun.FULL : tfptr.fidxs();
     // NO fidxs, means we're not calling anything.
     if( fidxs==BitsFun.EMPTY ) return TypeTuple.CALLE.dual();
     if( fidxs.above_center() ) return TypeTuple.CALLE.dual(); // Not resolved yet
  
     // Default memory: global worse-case scenario
     TypeMem defmem = Env.DEFMEM._val instanceof TypeMem
       ? (TypeMem)Env.DEFMEM._val
       : Env.DEFMEM._val.oob(TypeMem.ALLMEM);
  
     // Any not-wired unknown call targets?
     if( fidxs!=BitsFun.FULL ) {
       // If fidxs includes a parent fidx, then it was split - currently exactly
       // in two.  If both children are wired, then proceed to merge both
       // children as expected; same if the parent is still wired (perhaps with
       // some children).  If only 1 child is wired, then we have an extra fidx
       // for a not-wired child.  If this fidx is really some unknown caller we
       // would have to get super conservative; but its actually just a recently
       // split child fidx.  If we get the RetNode via FunNode.find_fidx we suffer
       // the non-local progress curse.  If we get super conservative, we end up
       // rolling backwards (original fidx returned int; each split will only
       // ever return int-or-better).  So instead we "freeze in place".
       outerloop:
       for( int fidx : fidxs ) {
         int kids=0;
         for( int i=0; i<nwired(); i++ ) {
           int rfidx = wired(i)._fidx;
           if( fidx == rfidx ) continue outerloop; // Directly wired is always OK
           if( fidx == BitsFun.parent(rfidx) ) kids++; // Count wired kids of a parent fidx
         }
         if( BitsFun.is_parent(fidx) ) { // Child of a split parent, need both kids wired
           if( kids==2 ) continue;       // Both kids wired, this is ok
           return _val;                  // "Freeze in place"
         }
         if( !opt_mode._CG ) // Before GCP?  Fidx is an unwired unknown call target
           { fidxs = BitsFun.FULL; break; }
       }
     }
  
     // Compute call-return value from all callee returns
     Type trez = Type   .ANY   ;
     Type tmem = TypeMem.ANYMEM;
     if( fidxs == BitsFun.FULL ) { // Called something unknown
       trez = Type.ALL;            // Unknown target does worst thing
       tmem = defmem;
     } else {                      // All targets are known & wired
       for( int i=0; i<nwired(); i++ ) {
         RetNode ret = wired(i);
         if( fidxs.test_recur(ret._fidx) ) { // Can be wired, but later fidx is removed
           Type tret = ret._val;
           if( !(tret instanceof TypeTuple) ) tret = tret.oob(TypeTuple.RET);
           tmem = tmem.meet(((TypeTuple)tret).at(MEM_IDX));
           trez = trez.meet(((TypeTuple)tret).at(REZ_IDX));
         }
       }
     }
     TypeMem post_call = (TypeMem)tmem;
  
     // If no memory projection, then do not compute memory
     if( (_keep==0 && ProjNode.proj(this,MEM_IDX)==null) || call().mem()==null )
       return TypeTuple.make(Type.CTRL,TypeMem.ANYMEM,trez);
     Type premem = call().mem()._val;
  
     // Build epilog memory.
  
     // Approximate "live out of call", includes things that are alive before
     // the call but not flowing in.  Catches all the "new in call" returns.
     BitsAlias esc_out = esc_out(post_call,trez);
     TypeMem caller_mem = premem instanceof TypeMem ? (TypeMem)premem : premem.oob(TypeMem.ALLMEM);
     int len = opt_mode._CG ? Math.max(caller_mem.len(),post_call.len()) : defmem.len();
     TypeObj[] pubs = new TypeObj[len];
     for( int i=1; i<pubs.length; i++ ) {
       boolean ein  = tescs._aliases.test_recur(i);
       boolean eout = esc_out       .test_recur(i);
       TypeObj pre = caller_mem.at(i);
       TypeObj obj = ein || eout ? (TypeObj)(pre.meet(post_call.at(i))) : pre;
       if( !opt_mode._CG )       // Before GCP, must use DefMem to keeps types strong as the Parser
         obj = (TypeObj)obj.join(defmem.at(i));
       pubs[i] = obj;
     }
     TypeMem tmem3 = TypeMem.make0(pubs);
  
     return TypeTuple.make(Type.CTRL,tmem3,trez);
   }

Here is the call graph for this function:

◆ walk_dom_last()

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

packageinherited

Reimplemented in com.cliffc.aa.node.ScopeNode, com.cliffc.aa.node.RegionNode, com.cliffc.aa.node.ConNode< T extends Type >, com.cliffc.aa.node.ThunkNode, com.cliffc.aa.node.StartNode, and com.cliffc.aa.node.LoopNode.

Definition at line 863 of file Node.java.

                                         {
     assert in(0) != null;       // All default control nodes pass ctrl in slot 0
     Node n = in(0).walk_dom_last(P);
     if( n != null ) return n;   // Take last answer first
     return P.test(this) ? this : null;
   }

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

Referenced by com.cliffc.aa.node.CastNode.ideal_mono(), com.cliffc.aa.node.LoopNode.walk_dom_last(), com.cliffc.aa.node.ThunkNode.walk_dom_last(), com.cliffc.aa.node.RegionNode.walk_dom_last(), and com.cliffc.aa.node.Node.walk_dom_last().

Here is the call graph for this function:

Here is the caller 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:

◆ wire0()

void com.cliffc.aa.node.CallEpiNode.wire0	(	CallNode	call,
		Node	fun
	)

package

Definition at line 218 of file CallEpiNode.java.

                                       {
     // Wire.  Bulk parallel function argument path add
  
     // Add an input path to all incoming arg ParmNodes from the Call.  Cannot
     // assert finding all args, because dead args may already be removed - and
     // so there's no Parm/Phi to attach the incoming arg to.
     for( Node arg : fun._uses ) {
       if( arg.in(0) != fun || !(arg instanceof ParmNode) ) continue;
       Node actual;
       int idx = ((ParmNode)arg)._idx;
       switch( idx ) {
       case 0: actual = new ConNode<>(TypeRPC.make(call._rpc)); break; // Always RPC is a constant
       case MEM_IDX: actual = new MProjNode(call,(Env.DEFMEM._uses._len==0) ? Env.ANY : Env.DEFMEM); break;    // Memory into the callee
       default: actual = idx >= call.nargs()              // Check for args present
           ? new ConNode<>(Type.ALL) // Missing args, still wire (to keep FunNode neighbors) but will error out later.
           : new ProjNode(call,idx); // Normal args
         break;
       }
       actual._live = arg._live; // Set it before CSE during init1
       arg.add_def(actual.init1());
       if( arg._val.is_con() ) // Added an edge, value may change or go in-error
         GVN.add_flow_defs(arg); // So use-liveness changes
     }
  
     // Add matching control to function via a CallGraph edge.
     fun.add_def(new CEProjNode(call,fun instanceof FunNode && !((FunNode) fun)._thunk_rhs ? ((FunNode)fun)._sig : null).init1());
     GVN.add_flow(fun);
     GVN.add_flow_uses(fun);
     if( fun instanceof ThunkNode ) GVN.add_reduce_uses(fun);
     if( fun instanceof FunNode ) GVN.add_inline((FunNode)fun);
   }

References com.cliffc.aa.node.Node._live, com.cliffc.aa.node.CallNode._rpc, com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.type.Type< T extends Type< T >.ALL, com.cliffc.aa.Env.ANY, com.cliffc.aa.node.CallEpiNode.call(), com.cliffc.aa.Env.DEFMEM, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.init1(), com.cliffc.aa.type.Type< T extends Type< T >.is_con(), com.cliffc.aa.type.TypeRPC.make(), and com.cliffc.aa.node.CallNode.nargs().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ wire1()

void com.cliffc.aa.node.CallEpiNode.wire1	(	CallNode	call,
		Node	fun,
		Node	ret
	)

package

Definition at line 207 of file CallEpiNode.java.

                                                   {
     assert _defs.find(ret)==-1; // No double wiring
     wire0(call,fun);
     // Wire self to the return
     add_def(ret);
     GVN.add_flow(this);
     GVN.add_flow(call);
     GVN.add_flow_defs(call);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node.add_def(), com.cliffc.aa.node.CallEpiNode.call(), and com.cliffc.aa.node.CallEpiNode.wire0().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ wired()

RetNode com.cliffc.aa.node.CallEpiNode.wired ( int x )

Definition at line 38 of file CallEpiNode.java.

38 { return (RetNode)in(x+2); }

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

Referenced by com.cliffc.aa.node.CallEpiNode.add_flow_use_extra(), com.cliffc.aa.Parse.do_call0(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallEpiNode.sane_wiring(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.CallEpiNode.value().

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.CallEpiNode.xstr ( )

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

Definition at line 30 of file CallEpiNode.java.

                                  {// Self short name
     if( _is_copy ) return "CopyEpi";
     if( is_dead() ) return "XallEpi";
     return "CallEpi";
   }

References com.cliffc.aa.node.CallEpiNode._is_copy, and com.cliffc.aa.node.Node.is_dead().

Here is the call 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

◆ _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().

◆ _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().

◆ _is_copy

boolean com.cliffc.aa.node.CallEpiNode._is_copy

Definition at line 25 of file CallEpiNode.java.

Referenced by com.cliffc.aa.Parse.do_call0(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallEpiNode.is_copy(), com.cliffc.aa.node.CallEpiNode.live_use(), com.cliffc.aa.node.CallEpiNode.set_is_copy(), com.cliffc.aa.node.CallEpiNode.value(), and com.cliffc.aa.node.CallEpiNode.xstr().

◆ _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.

◆ _op

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

packageinherited

Definition at line 85 of file Node.java.

◆ _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().

◆ 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:

CallEpiNode.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

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ CallEpiNode()

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()

◆ call()

◆ check_and_wire()

◆ 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()

◆ esc_out()

◆ escapees()

◆ find() [1/2]

◆ find() [2/2]

◆ get_mem_writer()

◆ hashCode()

◆ ideal_grow()

◆ 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()

◆ is_multi_tail()

◆ is_prim()

◆ is_pure_call()

◆ keep() [1/2]

◆ keep() [2/2]

◆ kill()

◆ len()

◆ live()

◆ live_use()

◆ live_uses()

◆ merge()

◆ more_flow() [1/2]

◆ more_flow() [2/2]

◆ more_ideal()

◆ new_tvar()