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

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

Public Member Functions
	CallNode (boolean unpacked, Parse[] badargs, Node... defs)

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

CallEpiNode	cepi ()

CallNode	copy (boolean copy_edges)

Node	ctl ()

void	del (int idx)

Node	do_flow ()

Node	do_grow ()

Node	do_mono ()

Node	do_reduce ()

Node	dsp ()

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

BitsFun	fidxs ()

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

FunPtrNode	least_cost (BitsFun choices, Node unk)

int	len ()

TypeMem	live (GVNGCM.Mode opt_mode)

TypeMem	live_use (GVNGCM.Mode opt_mode, Node def)

boolean	live_uses ()

Node	mem ()

final int	more_flow (boolean lifting)

final boolean	more_ideal (VBitSet bs)

TV2	new_tvar (String alloc_site)

byte	op_prec ()

Node[]	parms ()

Node	pop ()

Node	remove (int idx)

void	replace (Node old, Node nnn)

void	set_dead ()

Node	set_def (int idx, Node n)

Node	set_dsp (Node dsp)

Node	set_fdx (Node fun)

void	set_mem (Node mem)

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)

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

static TypeFunPtr	ttfp (Type tcall)

static TypeFunPtr	ttfpx (Type tcall)

Public Attributes
Ary< Node >	_defs

boolean	_elock

byte	_keep

TypeMem	_live

boolean	_not_resolved_by_gcp

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

Node	arg (int x)

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)

TypeMem	live_use_call (int dfidx)

int	nargs ()

int	newuid ()

Node	set_arg (int idx, Node arg)

void	set_rpc (int rpc)

String	str ()

public< N extends Node > N	unhook ()

public< N extends Node > N	unkeep ()

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

Node	walk_dom_last (Predicate< Node > P)

Static Package Functions
	[static initializer]

static TypeMem	emem (Type tcall)

static TypeMem	emem (Type[] ts)

static TypeTuple	set_ttfp (TypeTuple tcall, TypeFunPtr nfptr)

static Type	targ (Type tcall, int x)

static Type	targ (Type[] ts, int x)

static Type	tctl (Type tcall)

static TypeMemPtr	tesc (Type tcall)

Package Attributes
Parse[]	_badargs

boolean	_is_copy

final byte	_op

int	_rpc

TV2	_tvar

boolean	_unpacked

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

Node	_ideal_grow (MrgProjNode mem, ProjNode cepim, ProjNode cepid, BitsAlias escs, int i)

void	adderr (HashSet< ErrMsg > errs)

boolean	all_fcns_wired ()

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)

BitsAlias	get_alias (Type t)

boolean	is_multi_tail ()

Node	merge (Node x)

int	more_flow (boolean lifting, int errs)

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

Node	swap_new (Node cepim, MrgProjNode mrg)

Node	unuse (Node old)

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

static FunPtrNode	get_fptr (FunNode fun, Node unk)

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 86 of file CallNode.java.

Constructor & Destructor Documentation

◆ CallNode()

com.cliffc.aa.node.CallNode.CallNode	(	boolean	unpacked,
		Parse[]	badargs,
		Node...	defs
	)

Definition at line 95 of file CallNode.java.

                                                                      {
     super(OP_CALL,defs);
     assert defs[DSP_IDX]==null || defs[DSP_IDX]._val==Type.ALL || defs[DSP_IDX]._val==Type.ANY || defs[DSP_IDX]._val instanceof TypeMemPtr; // Temp; not required
     assert defs.length > DSP_IDX+1;
     _rpc = BitsRPC.new_rpc(BitsRPC.ALL); // Unique call-site index
     _unpacked=unpacked;         // Arguments are typically packed into a tuple and need unpacking, but not always
     _badargs = badargs;
   }

References com.cliffc.aa.node.CallNode._badargs, com.cliffc.aa.node.CallNode._rpc, com.cliffc.aa.node.CallNode._unpacked, com.cliffc.aa.type.BitsRPC.ALL, com.cliffc.aa.type.Type< T extends Type< T >.ALL, com.cliffc.aa.type.Type< T extends Type< T >.ANY, com.cliffc.aa.type.BitsRPC.new_rpc(), and com.cliffc.aa.node.Node.OP_CALL.

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

Here is the call graph for this function:

Here is the caller graph for this function:

Member Function Documentation

◆ [static initializer]()

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

staticpackageinherited

◆ _do_reduce()

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

privateinherited

Definition at line 570 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _elock()

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

packageinherited

Definition at line 137 of file Node.java.

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

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

Here is the call graph for this function:

◆ _header()

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

staticprivateinherited

Definition at line 380 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _ideal_grow()

Node com.cliffc.aa.node.CallNode._ideal_grow	(	MrgProjNode	mem,
		ProjNode	cepim,
		ProjNode	cepid,
		BitsAlias	escs,
		int	i
	)

private

Definition at line 373 of file CallNode.java.

                                                                                                    {
     // No alias overlaps
     int alias = mem.nnn()._alias;
     if( escs.test_recur(alias) ) return null;
     // No other readers or writers.  Expect the Call (or Join) and optionally DEFMEM
     if( mem._uses._len>2 ) return null;
     if( mem._uses._len==2 && mem._uses.find(Env.DEFMEM)==-1 ) return null; // Something other than DEFMEM
  
     // If call returns same as new (via recursion), cannot split, but CAN swap.
     TypeMem tmcepi = (TypeMem) cepim._val;
     BitsAlias esc_out = CallEpiNode.esc_out(tmcepi,cepid==null ? Type.XNIL : cepid._val);
     BitsAlias escs2 = escs.meet(esc_out);
     Node jn = mem();
     if( !escs2.is_empty() && !esc_out.test_recur(alias) ) { // No return conflict, so parallelize memory
       if( jn==mem )             // Bare Call/New; add a Split/Join.
         return MemSplitNode.insert_split(cepim,escs2,this,mem,mem);
       return null; // TODO: allow Call to move into existing JOIN
     } else {                    // Else move New below Call.
       if( jn!=mem ) {           // Move New below Join
         Node pre = mem.mem();
         jn.set_def(i,pre);
         mem.set_def(MEM_IDX,jn);
         set_mem(mem);
         Env.GVN.add_unuse(jn);
         Env.GVN.add_unuse(mem);
       }
       return swap_new(cepim,mem); // Move New below Call
     }
   }

References com.cliffc.aa.node.Node._uses, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_unuse(), com.cliffc.aa.Env.DEFMEM, com.cliffc.aa.node.CallEpiNode.esc_out(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.MemSplitNode.insert_split(), com.cliffc.aa.type.Bits.is_empty(), com.cliffc.aa.type.Bits.meet(), com.cliffc.aa.node.CallNode.mem(), com.cliffc.aa.node.Node.set_def(), com.cliffc.aa.node.CallNode.set_mem(), com.cliffc.aa.node.CallNode.swap_new(), com.cliffc.aa.type.Bits.test_recur(), and com.cliffc.aa.type.Type< T extends Type< T >.XNIL.

Referenced by com.cliffc.aa.node.CallNode.ideal_grow().

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

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

Definition at line 493 of file CallNode.java.

                                                      {
     // Projections live after a call alter liveness of incoming args
     if( chg instanceof ProjNode )
       Env.GVN.add_flow(in(((ProjNode)chg)._idx));
   }

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

Here is the call graph for this function:

◆ add_flow_extra()

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

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

Definition at line 481 of file CallNode.java.

                                                  {
     if( old==Type.ANY || _val==Type.ANY ||
         (old instanceof TypeTuple && ttfp(old).above_center()) )
       Env.GVN.add_flow_defs(this); // Args can be more-alive or more-dead
     // If Call flips to being in-error, all incoming args forced live/escape
     for( Node def : _defs )
       if( def!=null && def._live!=TypeMem.ESCAPE && err(true)!=null )
         Env.GVN.add_flow(def);
     // If not resolved, might now resolve
     if( _val instanceof TypeTuple && ttfp(_val)._fidxs.abit()==-1 )
       Env.GVN.add_reduce(this);
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.Node._val, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_flow_defs(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.type.Type< T extends Type< T >.ANY, com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.type.TypeMem.ESCAPE, com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.CallNode.ttfp().

Here is the call graph for this function:

◆ add_flow_use_extra()

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

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

Definition at line 498 of file CallNode.java.

                                                      {
     CallEpiNode cepi = cepi();
     if( chg == fdx() ) {           // FIDX falls to sane from too-high
       Env.GVN.add_flow_defs(this); // All args become alive
       if( cepi!=null ) {
         Env.GVN.add_work_all(cepi);  // FDX gets stable, might wire, might unify_lift
         Env.GVN.add_flow_defs(cepi); // Wired Rets might no longer be alive (might unwire)
       }
     } else if( chg == mem() ) {
       if( cepi != null ) Env.GVN.add_flow(cepi);
     } else {                    // Args lifted, may resolve
       if( fdx() instanceof UnresolvedNode )
         Env.GVN.add_reduce(this);
       if( Env.GVN._opt_mode._CG && err(true)==null )
         Env.GVN.add_flow(mem()); // Call not-in-error, memory may lift
     }
   }

References com.cliffc.aa.GVNGCM.Mode._CG, com.cliffc.aa.GVNGCM._opt_mode, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_flow_defs(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.GVNGCM.add_work_all(), com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallNode.fdx(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.CallNode.mem().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ add_reduce_extra()

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

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

Definition at line 331 of file CallNode.java.

                                            {
     Node cepi = cepi();
     if( !_is_copy && cepi!=null )
       Env.GVN.add_reduce(cepi);
     if( mem() instanceof MrgProjNode )
       Env.GVN.add_reduce(this);
     Env.GVN.add_flow(mem()); // Dead pointer args reduced to ANY, so mem() liveness lifts
   }

References com.cliffc.aa.node.CallNode._is_copy, com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_reduce(), com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.Env.GVN, and com.cliffc.aa.node.CallNode.mem().

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

boolean com.cliffc.aa.node.CallNode.all_fcns_wired ( )

private

Definition at line 601 of file CallNode.java.

                                    {
     BitsFun fidxs = fidxs();
     if( _is_copy || fidxs==null ) return true;
     CallEpiNode cepi = cepi();
     return cepi != null && fidxs.bitCount() <= cepi.nwired();
   }

References com.cliffc.aa.node.CallNode._is_copy, com.cliffc.aa.type.Bits.bitCount(), com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.CallNode.fidxs(), and com.cliffc.aa.node.CallEpiNode.nwired().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ all_live()

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

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

Definition at line 536 of file CallNode.java.

536 { return TypeMem.ALLMEM; }

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

◆ arg()

Node com.cliffc.aa.node.CallNode.arg ( int x )

package

Definition at line 127 of file CallNode.java.

127 { assert x>=0; return _defs.at(x); }

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

Referenced by com.cliffc.aa.node.RetNode.check_phi_type(), com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.least_cost(), com.cliffc.aa.node.CallNode.set_arg(), com.cliffc.aa.node.RetNode.tail_recursive(), and com.cliffc.aa.node.CallNode.value().

Here is the caller graph for this function:

◆ cepi()

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

Definition at line 769 of file CallNode.java.

                             {
     for( Node cepi : _uses )    // Find CallEpi for bypass aliases
       if( cepi instanceof CallEpiNode )
         return (CallEpiNode)cepi;
     return null;
   }

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

Referenced by com.cliffc.aa.node.CallNode.add_flow_use_extra(), com.cliffc.aa.node.CallNode.add_reduce_extra(), com.cliffc.aa.node.CallNode.all_fcns_wired(), com.cliffc.aa.node.CallNode.escapees(), com.cliffc.aa.node.CallNode.ideal_grow(), com.cliffc.aa.node.FunNode.ideal_inline(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.is_mem(), com.cliffc.aa.node.CallNode.live(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.FunNode.unwire().

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

CallNode com.cliffc.aa.node.CallNode.copy ( boolean copy_edges )

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

Definition at line 176 of file CallNode.java.

                                                                {
     CallNode call = (CallNode)super.copy(copy_edges);
     Node old_rpc = Node.con(TypeRPC.make(_rpc));
     call._rpc = BitsRPC.new_rpc(_rpc); // Children RPC
     set_rpc(BitsRPC.new_rpc(_rpc)); // New child RPC for 'this' as well.
     // Swap out the existing old rpc users for the new.
     // Might be no users of either.
     Node new_rpc = Node.con(TypeRPC.make(_rpc));
     old_rpc.subsume(new_rpc);
     return call;
   }

References com.cliffc.aa.node.CallNode._rpc, com.cliffc.aa.node.CallNode.CallNode(), com.cliffc.aa.node.Node.con(), com.cliffc.aa.node.CallNode.copy(), com.cliffc.aa.type.TypeRPC.make(), com.cliffc.aa.type.BitsRPC.new_rpc(), com.cliffc.aa.node.CallNode.set_rpc(), and com.cliffc.aa.node.Node.subsume().

Referenced by com.cliffc.aa.node.CallNode.copy().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ ctl()

Node com.cliffc.aa.node.CallNode.ctl ( )

Definition at line 118 of file CallNode.java.

118 { return in(CTL_IDX); }

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

Referenced by com.cliffc.aa.GVNGCM.gcp(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.live(), com.cliffc.aa.node.CallNode.live_use(), com.cliffc.aa.node.RetNode.tail_recursive(), and com.cliffc.aa.node.CallNode.value().

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:

◆ dsp()

Node com.cliffc.aa.node.CallNode.dsp ( )

Definition at line 120 of file CallNode.java.

120 { return in(DSP_IDX); } // Display

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

Referenced by com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.live_use(), and com.cliffc.aa.node.CallNode.set_dsp().

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:

◆ emem() [1/2]

static TypeMem com.cliffc.aa.node.CallNode.emem ( Type tcall )

staticpackage

Definition at line 149 of file CallNode.java.

149 { return emem( ((TypeTuple)tcall)._ts ); }

References com.cliffc.aa.node.CallNode.emem().

Referenced by com.cliffc.aa.node.CallNode.emem(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), and com.cliffc.aa.node.CallNode.live_use().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ emem() [2/2]

static TypeMem com.cliffc.aa.node.CallNode.emem ( Type[] ts )

staticpackage

Definition at line 150 of file CallNode.java.

150 { return (TypeMem ) ts[MEM_IDX]; } // callee memory passed into function

◆ equals()

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

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

Definition at line 778 of file CallNode.java.

                                             {
     if( this==o ) return true;
     if( !super.equals(o) ) return false;
     if( !(o instanceof CallNode) ) return false;
     CallNode call = (CallNode)o;
     return _rpc==call._rpc;
   }

References com.cliffc.aa.node.CallNode._rpc, and com.cliffc.aa.node.CallNode.CallNode().

Here is the call graph for this function:

◆ err()

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

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

Definition at line 694 of file CallNode.java.

                                               {
     // Fail for passed-in unknown references directly.
     for( int j=ARG_IDX; j<nargs(); j++ )
       if( arg(j)!=null && arg(j).is_forward_ref() )
         return fast ? ErrMsg.FAST : ErrMsg.forward_ref(_badargs[j-ARG_IDX+1], FunNode.find_fidx(((FunPtrNode)arg(j)).ret()._fidx).fptr());
     // Expect a function pointer
     TypeFunPtr tfp = ttfpx(_val);
     if( tfp==null ) {
       if( fast ) return ErrMsg.FAST;
       Type t = _val;
       if( t instanceof TypeTuple ) t = ((TypeTuple)t).at(DSP_IDX);
       return ErrMsg.unresolved(_badargs[0],"A function is being called, but "+t+" is not a function type");
     }
  
     // Indirectly, forward-ref for function type
     if( tfp.is_forward_ref() ) // Forward ref on incoming function
       return fast ? ErrMsg.FAST : ErrMsg.forward_ref(_badargs[0], FunNode.find_fidx(tfp.fidx()).fptr());
  
     BitsFun fidxs = tfp.fidxs();
     if( fidxs.above_center() ) return null; // Not resolved (yet)
     // bad-arg-count
     if( tfp._nargs != nargs() )
       return fast ? ErrMsg.FAST : ErrMsg.syntax(_badargs[0],"Passing "+(nargs()-ARG_IDX)+" arguments to "+tfp.names(false)+" which takes "+(tfp._nargs-ARG_IDX)+" arguments");
  
     // Call did not resolve.
     if( fidxs.is_empty() ) // This is an unresolved call
       return fast ? ErrMsg.FAST : ErrMsg.unresolved(_badargs[0],"Unable to resolve call");
  
     // Also happens if more than one FIDX shares the same Unresolved.
     // Basically means we did not clone enough to remove a choice amongst primitives.
     // Bail out here if we see more than one Unresolved.
     Node munr = null;
     for( int fidx : fidxs ) {                    // All fidxs to Call
       FunNode fun = FunNode.find_fidx(fidx);
       if( fun==null || fun.is_dead() || fun.ret()==null ) continue; // No such function (probably dead and mid-cleanup)
       outer:
       for( Node fptrs : fun.ret()._uses )      // FunPtrs for each fidx (typically 1)
         if( fptrs instanceof FunPtrNode )
           for( Node unr : fptrs._uses )          // Unresolved behind each FunPtr (typically 1)
             if( unr instanceof UnresolvedNode && // Unresolved includes fdxs in this Call FDX set?
                 unr._val instanceof TypeFunPtr &&
                 ((TypeFunPtr)(tfp.join(unr._val)))._fidxs.abit() == -1 ) {
               if( munr == null || munr._val==unr._val ) { munr = unr; continue outer; }
               return fast ? ErrMsg.FAST : ErrMsg.unresolved(_badargs[0],"Unable to resolve call");
             }
     }
  
     // Now do an arg-check.  No more than 1 unresolved, so the error message is
     // more sensible.
     BitsFun.Tree<BitsFun> tree = fidxs.tree();
     for( int j=ARG_IDX; j<nargs(); j++ ) {
       Type actual = arg(j).sharptr(mem());
       Ary<Type> ts=null;
       for( int fidx : fidxs ) {
         if( fidx==0 ) continue;
         for( int kid=fidx; kid!=0; kid = tree.next_kid(fidx,kid) ) {
           FunNode fun = FunNode.find_fidx(kid);
           if( fun==null || fun.is_dead() ) continue;
           TypeTuple formals = fun._sig._formals; // Type of each argument
           if( fun.parm(j)==null ) continue;  // Formal is dead
           Type formal = formals.at(j);
           if( actual.isa(formal) ) continue; // Actual is a formal
           if( fast ) return ErrMsg.FAST;     // Fail-fast
           if( ts==null ) ts = new Ary<>(new Type[1],0);
           if( ts.find(formal) == -1 ) // Dup filter
             ts.push(formal);          // Add broken type
         }
       }
       if( ts!=null )
         return ErrMsg.typerr(_badargs[j-ARG_IDX+1],actual, mem()._val,ts.asAry());
     }
  
     return null;
   }

Referenced by com.cliffc.aa.node.CallNode.add_flow_extra(), com.cliffc.aa.node.CallNode.add_flow_use_extra(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), and com.cliffc.aa.node.CallNode.live_use().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ escapees()

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

package

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

Definition at line 472 of file CallNode.java.

                                  {
     BitsAlias esc_in  = tesc(_val)._aliases;
     CallEpiNode cepi = cepi();
     TypeTuple tcepi = cepi._val instanceof TypeTuple ? (TypeTuple) cepi._val : (TypeTuple) cepi._val.oob(TypeTuple.CALLE);
     BitsAlias esc_out = CallEpiNode.esc_out((TypeMem)tcepi.at(1),tcepi.at(2));
     TypeMem precall = (TypeMem) mem()._val;
     BitsAlias esc_out2 = precall.and_unused(esc_out); // Filter by unused pre-call
     return esc_out2.meet(esc_in);
   }

References com.cliffc.aa.type.TypeMemPtr._aliases, com.cliffc.aa.node.Node._val, com.cliffc.aa.type.TypeMem.and_unused(), com.cliffc.aa.type.TypeTuple.at(), com.cliffc.aa.type.TypeTuple.CALLE, com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.CallEpiNode.esc_out(), com.cliffc.aa.type.Bits.meet(), com.cliffc.aa.node.CallNode.mem(), com.cliffc.aa.type.Type< T extends Type< T >.oob(), and com.cliffc.aa.node.CallNode.tesc().

Referenced by com.cliffc.aa.node.CallNode.ideal_grow().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fdx()

Node com.cliffc.aa.node.CallNode.fdx ( )

Definition at line 121 of file CallNode.java.

121 { return _defs.last(); } // FIDX

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

Referenced by com.cliffc.aa.node.CallNode.add_flow_use_extra(), com.cliffc.aa.node.CallNode.fidxs(), com.cliffc.aa.node.FunNode.find_type_split_index(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.is_pure_call(), com.cliffc.aa.node.CallNode.live_use(), com.cliffc.aa.node.CallNode.live_use_call(), com.cliffc.aa.GVNGCM.remove_ambi(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.CallNode.value().

Here is the caller graph for this function:

◆ fidxs()

BitsFun com.cliffc.aa.node.CallNode.fidxs ( )

Definition at line 133 of file CallNode.java.

                          {
     Type tf = fdx()._val;
     return tf instanceof TypeFunPtr ? ((TypeFunPtr)tf).fidxs() : null;
   }

References com.cliffc.aa.node.Node._val, com.cliffc.aa.node.CallNode.fdx(), and com.cliffc.aa.type.TypeFunPtr.fidxs().

Referenced by com.cliffc.aa.node.CallNode.all_fcns_wired(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.live(), com.cliffc.aa.node.CallNode.live_use_call(), and com.cliffc.aa.node.CallNode.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find() [1/2]

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

inherited

Definition at line 427 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find() [2/2]

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

privateinherited

Definition at line 428 of file Node.java.

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

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

Here is the call graph for this function:

◆ get_alias()

BitsAlias com.cliffc.aa.node.CallNode.get_alias ( Type t )

private

Definition at line 466 of file CallNode.java.

                                         {
     if( t instanceof TypeMemPtr ) return ((TypeMemPtr)t)._aliases;
     if( TypeMemPtr.OOP.isa(t)   ) return BitsAlias.FULL;
     return BitsAlias.EMPTY;
   }

References com.cliffc.aa.type.BitsAlias.EMPTY, com.cliffc.aa.type.BitsAlias.FULL, com.cliffc.aa.type.Type< T extends Type< T >.isa(), and com.cliffc.aa.type.TypeMemPtr.OOP.

Referenced by com.cliffc.aa.node.CallNode.value().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ get_fptr()

static FunPtrNode com.cliffc.aa.node.CallNode.get_fptr	(	FunNode	fun,
		Node	unk
	)

staticprivate

Definition at line 678 of file CallNode.java.

                                                             {
     RetNode ret = fun.ret();
     FunPtrNode fptr = ret.funptr();
     if( fptr != null ) return fptr; // Only one choice
     if( !(unk instanceof UnresolvedNode) ) return null; // No selection of fptrs to pick from
     for( Node def : unk._defs )
       if( ((FunPtrNode)def).ret()== ret )
         return (FunPtrNode)def;
     return null;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.RetNode.funptr(), and com.cliffc.aa.node.FunNode.ret().

Referenced by com.cliffc.aa.node.CallNode.least_cost().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ get_mem_writer()

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

inherited

Definition at line 840 of file Node.java.

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

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

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

Here is the caller graph for this function:

◆ hashCode()

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

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

Definition at line 777 of file CallNode.java.

777 { return super.hashCode()+_rpc; }

References com.cliffc.aa.node.CallNode._rpc.

◆ ideal_grow()

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

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

Definition at line 340 of file CallNode.java.

                                      {
     // Check for a prior New and move past the call (pushes a store-like
     // behavior down).  The New address must not be reachable from the Call
     // arguments transitively, which is detected in the escape-in set.
  
     // Inserting a MemSplit is a ideal_grow, and swap_new could be an
     // ideal_mono, but they both use the same large correctness tests, so both
     // go under ideal_grow to avoid recomputing the test.
     Node mem = mem();
     CallEpiNode cepi = cepi();
     if( _keep>0 || cepi==null || !(mem._val instanceof TypeMem) ) return null;
     ProjNode cepim = ProjNode.proj(cepi,MEM_IDX); // Memory projection from CEPI
     ProjNode cepid = ProjNode.proj(cepi,REZ_IDX); // Return projection from CEPI
     if( cepim == null ) return null;
     if( !(cepim._val instanceof TypeMem) ) return null;
     TypeMem tmcepi = (TypeMem) cepim._val;
     if( !mem._val.isa(tmcepi) ) return null; // Call entry stale relative to exit
     BitsAlias escs = escapees();
     // Check for prior      MrgProj/New
     if( mem instanceof MrgProjNode )
       return _ideal_grow((MrgProjNode)mem,cepim,cepid,escs,-1);
     // Check for prior Join/MrgProj/New
     if( mem instanceof MemJoinNode ) {
       for( int i=1; i<mem._defs._len; i++ )
         if( mem.in(i) instanceof MrgProjNode ) {
           Node x = _ideal_grow((MrgProjNode)mem.in(i),cepim,cepid,escs,i);
           if( x!=null ) return x;
         }
     }
     return null;
   }

References com.cliffc.aa.node.Node._defs, com.cliffc.aa.node.CallNode._ideal_grow(), com.cliffc.aa.node.Node._keep, com.cliffc.aa.node.Node._val, com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.CallNode.escapees(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.type.Type< T extends Type< T >.isa(), com.cliffc.aa.node.CallNode.mem(), and com.cliffc.aa.node.ProjNode.proj().

Here is the call graph for this function:

◆ ideal_mono()

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

inherited

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

Definition at line 445 of file Node.java.

445 { return null; }

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

Here is the caller graph for this function:

◆ ideal_reduce()

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

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

Definition at line 188 of file CallNode.java.

                                        {
     Node cc = in(0).is_copy(0);
     if( cc!=null ) return set_def(0,cc);
     // When do I do 'pattern matching'?  For the moment, right here: if not
     // already unpacked a tuple, and can see the NewNode, unpack it right now.
     if( !_unpacked ) {          // Not yet unpacked a tuple
       assert nargs()==ARG_IDX+1;// Memory, Display plus the arg tuple
       Node arg = arg(ARG_IDX);
       Type tadr = arg._val;
       if( tadr instanceof TypeMemPtr && arg instanceof ProjNode ) {
         int alias = ((TypeMemPtr)tadr)._aliases.abit();
         if( alias == -1 ) throw unimpl(); // Handle multiple aliases, handle all/empty
         Node mem = mem();
         if( mem instanceof FreshNode ) mem = ((FreshNode)mem).id();
         // Bypass a MemJoin
         if( mem instanceof MemJoinNode ) {
           int jdx = ((MemJoinNode)mem).msp().find_alias_index(alias);
           if( jdx!=0 ) mem = mem.in(jdx);
         }
         // Find a tuple being passed in directly; unpack
         if( mem instanceof MrgProjNode && mem.in(0)==arg.in(0) ) {
           NewNode nnn = (NewNode)arg.in(0);
           Node fdx = pop();
           remove(_defs._len-1); // Pop off the NewNode tuple
           int len = nnn._defs._len;
           for( int i=1; NewNode.def_idx(i)<len; i++ ) // Push the args; unpacks the tuple
             add_def( nnn.fld(i));
           add_def(fdx);          // FIDX is last
           _unpacked = true;      // Only do it once
           keep().xval();         // Recompute value, this is not monotonic since replacing tuple with args
           GVN.add_work_all(unkeep());// Revisit after unpacking
           return this;
         }
       }
     }
  
     Type tc = _val;
     if( !(tc instanceof TypeTuple) ) return null;
     TypeTuple tcall = (TypeTuple)tc;
  
     // Dead, do nothing
     if( tctl(tcall)!=Type.CTRL ) { // Dead control (NOT dead self-type, which happens if we do not resolve)
       if( (ctl() instanceof ConNode) ) return null;
       // Kill all inputs with type-safe dead constants
       set_mem(Node.con(TypeMem.XMEM));
       set_dsp(Node.con(TypeFunPtr.GENERIC_FUNPTR.dual()));
       if( is_dead() ) return this;
       for( int i=ARG_IDX; i<_defs._len; i++ )
         set_def(i,Env.ANY);
       //gvn.add_work_defs(this);
       //return set_def(0,Env.XCTRL,gvn);
       throw unimpl();
     }
  
     // Have some sane function choices?
     TypeFunPtr tfp  = ttfp(tcall);
     BitsFun fidxs = tfp.fidxs();
     if( fidxs==BitsFun.EMPTY ) // TODO: zap function to empty function constant
       return null;             // Zero choices
  
     // If we have a single function allowed, force the function constant.
     Node fdx = fdx();           // Function epilog/function pointer
     int fidx = fidxs.abit();    // Check for single target
     if( fidx != -1 && !(fdx instanceof FunPtrNode) ) {
       // Check that the single target is well-formed
       FunNode fun = FunNode.find_fidx(Math.abs(fidx));
       if( fun != null && !fun.is_dead() ) {
         RetNode ret = fun.ret();
         if( ret != null ) {
           // The same function might be called with different displays; make
           // sure we get the right one.  See if there is a single un-escaped
           // FunPtr.  Common for non-upwardsly exposed targets.
           FunPtrNode fptr = ret.funptr();
           if( fptr != null && !fptr.display()._live.live().is_escape() )
             return set_dsp(fptr);
           // See if FunPtr is available just above an Unresolved.
           if( fdx instanceof UnresolvedNode ) {
             fptr = ((UnresolvedNode)fdx).find_fidx(fidx);
             if( fptr != null ) { // Gonna improve
               if( dsp() instanceof FP2DispNode && dsp().in(0)==fdx )
                 set_dsp(fptr.display());
               return set_fdx(fptr);
             }
           }
         }
       }
     }
  
     // If the function is unresolved, see if we can resolve it now.
     // Fidxs are typically low during iter, but can be high during
     // iter post-GCP on error calls where nothing resolves.
     CallEpiNode cepi = cepi();
     if( fidx == -1 && !fidxs.above_center() && !fidxs.test(1)) {
       FunPtrNode fptr = least_cost(fidxs, fdx); // Check for least-cost target
       if( fptr != null ) {
         if( cepi!=null ) Env.GVN.add_reduce(cepi); // Might unwire
         if( fptr.display()._val.isa(dsp()._val) )
           set_dsp(fptr.display());
         set_fdx(fptr);          // Resolve to 1 choice
         xval();                 // Force value update; least-cost LOWERS types (by removing a choice)
         add_flow_use_extra(fptr);
         if( cepi!=null ) Env.GVN.add_reduce(cepi); // Might unwire
         return this;
       }
     }
  
     // See if the display is always dead; common for Unresolved of primitives.
     UnresolvedNode unk;
     if( fdx instanceof UnOrFunPtrNode && (unk=((UnOrFunPtrNode)fdx).unk())!=null &&
         !(dsp() instanceof ConNode && dsp()._val==Type.ANY) ) {
       boolean dsp_nil=true;
       for( Node fptr : unk._defs )
         if( !(fptr instanceof FunPtrNode) || ((FunPtrNode)fptr).display()._val!=TypeMemPtr.NO_DISP )
           { dsp_nil=false; break; }
       if( dsp_nil ) {           // Display is unused by any Unresolved
         set_dsp(Env.ANY);
         return this;
       }
     }
  
  
     // Wire valid targets.
     if( cepi!=null && cepi.check_and_wire() )
       return this;              // Some wiring happened
  
     // Check for dead args and trim; must be after all wiring is done because
     // unknown call targets can appear during GCP and use the args.  After GCP,
     // still must verify all called functions have the arg as dead, because
     // alive args still need to resolve.  Constants are an issue, because they
     // fold into the Parm and the Call can lose the matching DProj while the
     // arg is still alive.
     if( GVN._opt_mode._CG && err(true)==null ) {
       Node progress = null;
       for( int i=DSP_IDX; i<nargs(); i++ )
         if( ProjNode.proj(this,i)==null &&
             !(arg(i) instanceof ConNode) ) // Not already folded
           progress = set_arg(i,Env.ANY);   // Kill dead arg
       if( progress != null ) return this;
     }
  
     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.CallNode.is_copy ( int idx )

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

Definition at line 775 of file CallNode.java.

775 { return _is_copy ? (_val==Type.ANY ? Env.ANY : in(idx)) : null; }

References com.cliffc.aa.node.CallNode._is_copy, com.cliffc.aa.node.Node._val, com.cliffc.aa.Env.ANY, com.cliffc.aa.type.Type< T extends Type< T >.ANY, 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.CallNode.is_mem ( )

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

Definition at line 106 of file CallNode.java.

                                     {    // Some calls are known to not write memory
     CallEpiNode cepi = cepi();
     return cepi!=null && ProjNode.proj(cepi,MEM_IDX)!=null;
   }

References com.cliffc.aa.node.CallNode.cepi(), and com.cliffc.aa.node.ProjNode.proj().

Here is the call graph for this function:

◆ is_multi_head()

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

inherited

Definition at line 354 of file Node.java.

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

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

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

Here is the caller graph for this function:

◆ is_multi_tail()

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

privateinherited

Definition at line 355 of file Node.java.

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

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

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

Here is the caller graph for this function:

◆ is_prim()

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

inherited

Definition at line 260 of file Node.java.

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

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

Here is the caller graph for this function:

◆ is_pure_call()

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

package

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

Definition at line 785 of file CallNode.java.

785 { return fdx().is_pure_call()==null ? null : mem(); }

References com.cliffc.aa.node.CallNode.fdx(), com.cliffc.aa.node.Node.is_pure_call(), and com.cliffc.aa.node.CallNode.mem().

Referenced by com.cliffc.aa.node.CallEpiNode.ideal_reduce(), and com.cliffc.aa.node.CallEpiNode.is_pure_call().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ keep() [1/2]

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

packageinherited

Definition at line 228 of file Node.java.

228 { return keep(1); }

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ keep() [2/2]

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

packageinherited

Definition at line 230 of file Node.java.

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

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

◆ kill()

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

inherited

Definition at line 211 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ least_cost()

FunPtrNode com.cliffc.aa.node.CallNode.least_cost	(	BitsFun	choices,
		Node	unk
	)

Definition at line 624 of file CallNode.java.

                                                           {
     if( choices==BitsFun.EMPTY ) return null;
     assert choices.bitCount() > 0; // Must be some choices
     assert choices.abit()!= -1 || (choices.above_center() == (GVN._opt_mode==GVNGCM.Mode.Opto));
     int best_cvts=99999;           // Too expensive
     FunPtrNode best_fptr=null;     //
     TypeTuple best_formals=null;  //
     boolean tied=false;            // Ties not allowed
     for( int fidx : choices ) {
       // Parent/kids happen during inlining
       for( int kidx=fidx; kidx!=0; kidx=BitsFun.next_kid(fidx,kidx) ) {
         if( BitsFun.is_parent(kidx) )
           continue;
  
         FunNode fun = FunNode.find_fidx(kidx);
         if( fun.nargs()!=nargs() || fun.in(0)==fun ) continue; // BAD/dead
         TypeTuple formals = fun._sig._formals; // Type of each argument
         int cvts=0;                        // Arg conversion cost
         for( int j=DSP_IDX; j<nargs(); j++ ) {
           Type actual = arg(j)._val;
           Type formal = formals.at(j);
           if( actual==formal ) continue;
           if( Type.ALL==formal ) continue; // Allows even error arguments
           byte cvt = actual.isBitShape(formal); // +1 needs convert, 0 no-cost convert, -1 unknown, 99 never
           if( cvt == -1 ) return null; // Might be the best choice, or only choice, dunno
           cvts += cvt;
         }
  
         if( cvts < best_cvts ) {
           best_cvts = cvts;
           best_fptr = get_fptr(fun,unk); // This can be null, if function is run-time computed & has multiple displays.
           best_formals = formals;
           tied=false;
         } else if( cvts==best_cvts ) {
           // Look for monotonic formals
           int fcnt=0, bcnt=0;
           for( int i=0; i<formals._ts.length; i++ ) {
             Type ff = formals.at(i), bf = best_formals.at(i);
             if( ff==bf ) continue;
             Type mt = ff.meet(bf);
             if( ff==mt ) bcnt++;       // Best formal is higher than new
             else if( bf==mt ) fcnt++;  // New  formal is higher than best
             else { fcnt=bcnt=-1; break; } // Not monotonic, no obvious winner
           }
           // If one is monotonically higher than the other, take it
           if( fcnt > 0 && bcnt==0 ) { best_fptr = get_fptr(fun,unk); best_formals = formals; }
           else if( fcnt==0 && bcnt > 0 ) {} // Keep current
           else tied=true;                   // Tied, ambiguous
         }
       }
     }
     if( best_cvts >= 99 ) return null; // No valid functions
     return tied ? null : best_fptr; // Ties need to have the ambiguity broken another way
   }

References com.cliffc.aa.type.TypeFunSig._formals, com.cliffc.aa.node.FunNode._sig, com.cliffc.aa.type.TypeTuple._ts, com.cliffc.aa.node.Node._val, com.cliffc.aa.type.Bits.abit(), com.cliffc.aa.type.Bits.above_center(), com.cliffc.aa.type.Type< T extends Type< T >.ALL, com.cliffc.aa.node.CallNode.arg(), com.cliffc.aa.type.TypeTuple.at(), com.cliffc.aa.type.Bits.bitCount(), com.cliffc.aa.type.BitsFun.EMPTY, com.cliffc.aa.node.FunNode.find_fidx(), com.cliffc.aa.node.CallNode.get_fptr(), com.cliffc.aa.node.Node.in(), com.cliffc.aa.type.BitsFun.is_parent(), com.cliffc.aa.type.Type< T extends Type< T >.isBitShape(), com.cliffc.aa.type.Type< T extends Type< T >.meet(), com.cliffc.aa.node.CallNode.nargs(), com.cliffc.aa.node.FunNode.nargs(), com.cliffc.aa.type.BitsFun.next_kid(), and com.cliffc.aa.GVNGCM.Mode.Opto.

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

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.CallNode.live ( GVNGCM.Mode opt_mode )

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

Definition at line 518 of file CallNode.java.

                                                       {
     if( !opt_mode._CG ) {
       BitsFun fidxs = fidxs();
       if( fidxs == null ) return TypeMem.ALLMEM; // Assume Something Good will yet happen
       if( fidxs.above_center() ) return _live; // Got choices, dunno which one will stick
       CallEpiNode cepi = cepi();
       if( cepi==null ) return _live; // Collapsing
       if( ctl()._val == Type.XCTRL ) return _live; // Unreachable
       // Expand (actually fail) if any parents
       BitSet bs = fidxs.tree().plus_kids(fidxs);
       if( bs.cardinality() > cepi.nwired() ) // More things to call
         return _live; // Cannot improve
     }
     // All choices discovered during GCP.  If the call is in-error it may not
     // resolve and so will have no uses other than the CallEpi - which is good
     // enough to declare this live, so it exists for errors.
     return super.live(opt_mode);
   }

References com.cliffc.aa.node.Node._live, com.cliffc.aa.node.Node._val, com.cliffc.aa.type.Bits.above_center(), com.cliffc.aa.type.TypeMem.ALLMEM, com.cliffc.aa.node.CallNode.cepi(), com.cliffc.aa.node.CallNode.ctl(), com.cliffc.aa.node.CallNode.fidxs(), com.cliffc.aa.type.TypeMem.live(), com.cliffc.aa.node.CallEpiNode.nwired(), com.cliffc.aa.type.BitsFun.tree(), and com.cliffc.aa.type.Type< T extends Type< T >.XCTRL.

Here is the call graph for this function:

◆ live_use()

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

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

Definition at line 537 of file CallNode.java.

                                                                      {
     if( def==fdx() ) {                         // Function argument
       if( def instanceof ThretNode ) return TypeMem.ALLMEM; // Always inlines eagerly, so this is always temporary
       if( !opt_mode._CG ) return TypeMem.ESCAPE; // Prior to GCP, assume all fptrs are alive and display escapes
       // During GCP, unresolved calls might resolve & remove this use.  Keep dead till resolve fails.
       // If we have a fidx directly, use it more precisely.
       int dfidx = def instanceof FunPtrNode ? ((FunPtrNode)def).ret()._fidx : -1;
       return live_use_call(dfidx);
     }
     if( def==ctl() ) return TypeMem.ALIVE;
     if( def!=mem() ) {         // Some argument
       // Check that all fidxs are wired; an unwired fidx might be in-error
       // and we want the argument alive for errors.  This is a value turn-
       // around point (high fidxs need to fall)
  
       // Pre GCP, might not wire (yet), assume fully used by unwired valid fcn
       // target, so ESCAPE.
  
       // 1st GCP, wiring appears over time, if not wired assume it will be and
       // do the optimistic proj test.
  
       // Post GCP, if not wired, then Call is in error, so ESCAPE.
       if( opt_mode._CG && _val==Type.ANY ) return TypeMem.DEAD;
       if( opt_mode._CG &&       // Either mid-GCP or post-GCP
           (def==dsp() ||        // Display is not a user-visible arg, so if unused can go away
            (err(true)==null &&  // Not in-error
             // And fully wired (no new users will wire)
             (opt_mode==GVNGCM.Mode.Opto || all_fcns_wired()) )) ) {
         int argn = _defs.find(def);
         ProjNode proj = ProjNode.proj(this, argn);
         if( proj == null || proj._live == TypeMem.DEAD )
           return TypeMem.DEAD; // Arg not used
       }
       if( def instanceof ThretNode ) return TypeMem.ALLMEM;
       assert def.all_live().basic_live();
       return TypeMem.ESCAPE;    // Args always alive and escape
     }
  
     // After we have the exact callers, use liveness directly.  True if we have
     // the Call Graph, or the callers are known directly.  If the call is
     // in-error, act as-if we do not known the Call Graph.
     if( !(_val instanceof TypeTuple) ) // No type to sharpen
       return _val.oob(TypeMem.ALLMEM);
     if( opt_mode._CG || fdx() instanceof FunPtrNode ) // All callers known
       return err(true)==null ? _live : TypeMem.ALLMEM; // Use live directly (unless in error)
  
     // Unknown future callees act as-if all available aliases are read from and
     // thus live.
     BitsAlias aliases = BitsAlias.EMPTY;
     for( int i=DSP_IDX; i<nargs(); i++ ) {
       Type targ = targ(_val,i);
       if( TypeMemPtr.OOP.isa(targ) )
         { aliases=BitsAlias.FULL; break; } // All possible pointers, so all memory is alive
       if( !(targ instanceof TypeMemPtr) ) continue; // Not a pointer, does not need memory to sharpen
       if( targ.above_center() ) continue; // Have infinite choices still, no memory
       aliases = aliases.meet(((TypeMemPtr)targ)._aliases);
     }
     // Conservative too strong; need only memories that go as deep as the
     // formal types.
     TypeMem caller_mem = emem(_val);
     TypeMem tmem2 = caller_mem.slice_reaching_aliases(caller_mem.all_reaching_aliases(aliases));
     return (TypeMem)tmem2.meet(_live);
   }

Here is the call graph for this function:

◆ live_use_call()

TypeMem com.cliffc.aa.node.CallNode.live_use_call ( int dfidx )

package

Definition at line 608 of file CallNode.java.

                                      {
     Type tcall = _val;
     if( !(tcall instanceof TypeTuple) )
       return tcall.above_center() ? TypeMem.DEAD : TypeMem.LNO_DISP;
     TypeFunPtr tfp = ttfp(tcall);
     // If resolve has chosen this dfidx, then the FunPtr is alive.
     BitsFun fidxs = tfp.fidxs();
     if( fidxs.above_center() ) return TypeMem.DEAD; // Nothing above-center is chosen
     if( dfidx != -1 && !fidxs.test_recur(dfidx) ) return TypeMem.DEAD; // Not in the fidx set.
     if( tfp.is_con() && !(fdx() instanceof FunPtrNode) )
       return TypeMem.DEAD; // Will be replaced by a constant
     // Otherwise the FIDX is alive
     return TypeMem.LNO_DISP;
   }

References com.cliffc.aa.node.Node._val, com.cliffc.aa.type.Bits.above_center(), com.cliffc.aa.type.Type< T extends Type< T >.above_center(), com.cliffc.aa.type.TypeMem.DEAD, com.cliffc.aa.node.CallNode.fdx(), com.cliffc.aa.type.TypeFunPtr.fidxs(), com.cliffc.aa.node.CallNode.fidxs(), com.cliffc.aa.type.TypeFunPtr.is_con(), com.cliffc.aa.type.TypeMem.LNO_DISP, com.cliffc.aa.type.Bits.test_recur(), and com.cliffc.aa.node.CallNode.ttfp().

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

Here is the call graph for this function:

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

◆ mem()

Node com.cliffc.aa.node.CallNode.mem ( )

Definition at line 119 of file CallNode.java.

119 { return in(MEM_IDX); }

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ merge()

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

privateinherited

Definition at line 702 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ more_flow() [1/2]

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

inherited

Definition at line 747 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ more_flow() [2/2]

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

privateinherited

Definition at line 748 of file Node.java.

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

Here is the call graph for this function:

◆ more_ideal()

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

inherited

Definition at line 722 of file Node.java.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ nargs()

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

package

Definition at line 125 of file CallNode.java.

125 { return _defs._len-1; }

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

Referenced by com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.node.CallNode.least_cost(), com.cliffc.aa.node.CallNode.live_use(), com.cliffc.aa.node.CallNode.set_arg(), com.cliffc.aa.node.RetNode.tail_recursive(), com.cliffc.aa.node.CallNode.value(), and com.cliffc.aa.node.CallEpiNode.wire0().

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:

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

◆ parms()

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

Definition at line 786 of file CallNode.java.

                         {
     return _defs._len>= DSP_IDX ? Arrays.copyOf(_defs._es,_defs._len-1) : new Node[0]; // All defs, except the FIDX.
   }

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

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

◆ set_arg()

Node com.cliffc.aa.node.CallNode.set_arg	(	int	idx,
		Node	arg
	)

package

Definition at line 129 of file CallNode.java.

129 { assert idx>=DSP_IDX && idx <nargs(); return set_def(idx,arg); }

References com.cliffc.aa.node.CallNode.arg(), com.cliffc.aa.node.CallNode.nargs(), and com.cliffc.aa.node.Node.set_def().

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

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

Node com.cliffc.aa.node.CallNode.set_dsp ( Node dsp )

Definition at line 130 of file CallNode.java.

130 { return set_def(DSP_IDX, dsp); }

References com.cliffc.aa.node.CallNode.dsp(), and com.cliffc.aa.node.Node.set_def().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_fdx()

Node com.cliffc.aa.node.CallNode.set_fdx ( Node fun )

Definition at line 132 of file CallNode.java.

132 { return set_def(_defs._len-1,fun); }

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

Referenced by com.cliffc.aa.node.CallNode.ideal_reduce(), com.cliffc.aa.GVNGCM.remove_ambi(), com.cliffc.aa.node.FunNode.split_callers(), and com.cliffc.aa.node.TestNodeSmall.testCallNodeResolve().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_mem()

void com.cliffc.aa.node.CallNode.set_mem ( Node mem )

Definition at line 131 of file CallNode.java.

131 { set_def(MEM_IDX, mem); }

References com.cliffc.aa.node.CallNode.mem(), and com.cliffc.aa.node.Node.set_def().

Referenced by com.cliffc.aa.node.CallNode._ideal_grow(), and com.cliffc.aa.node.CallNode.ideal_reduce().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_rpc()

void com.cliffc.aa.node.CallNode.set_rpc ( int rpc )

package

Definition at line 776 of file CallNode.java.

776 { unelock(); _rpc=rpc; } // Unlock before changing hash

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

Referenced by com.cliffc.aa.node.CallNode.copy().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_ttfp()

static TypeTuple com.cliffc.aa.node.CallNode.set_ttfp	(	TypeTuple	tcall,
		TypeFunPtr	nfptr
	)

staticpackage

Definition at line 168 of file CallNode.java.

168 { return tcall.set(tcall.len()-2,nfptr); }

References com.cliffc.aa.type.TypeTuple.len(), and com.cliffc.aa.type.TypeTuple.set().

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

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.CallNode.str ( )

package

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

Definition at line 105 of file CallNode.java.

105 { return xstr(); } // Inline short name

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

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

◆ swap_new()

Node com.cliffc.aa.node.CallNode.swap_new	(	Node	cepim,
		MrgProjNode	mrg
	)

private

Definition at line 404 of file CallNode.java.

                                                       {
     cepim.keep();
     cepim.insert(mrg);
     set_def(1,mrg.mem());
     mrg.set_def(1,cepim.unkeep());
     Env.GVN.revalive(mrg);
     Env.GVN.add_flow_uses(mrg);
     Env.GVN.add_flow(this);
     Env.GVN.add_flow(cepim.in(0));
     return this;
   }

References com.cliffc.aa.GVNGCM.add_flow(), com.cliffc.aa.GVNGCM.add_flow_uses(), com.cliffc.aa.Env.GVN, com.cliffc.aa.node.Node.in(), com.cliffc.aa.node.Node.insert(), com.cliffc.aa.node.Node.keep(), com.cliffc.aa.node.MrgProjNode.mem(), com.cliffc.aa.GVNGCM.revalive(), com.cliffc.aa.node.Node.set_def(), and com.cliffc.aa.node.Node.unkeep().

Referenced by com.cliffc.aa.node.CallNode._ideal_grow().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ targ() [1/2]

static Type com.cliffc.aa.node.CallNode.targ	(	Type	tcall,
		int	x
	)

staticpackage

Definition at line 169 of file CallNode.java.

169 { return targ(((TypeTuple)tcall)._ts,x); }

References com.cliffc.aa.node.CallNode.targ().

Referenced by com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallNode.live_use(), and com.cliffc.aa.node.CallNode.targ().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ targ() [2/2]

static Type com.cliffc.aa.node.CallNode.targ	(	Type[]	ts,
		int	x
	)

staticpackage

Definition at line 170 of file CallNode.java.

170 { return ts[x]; }

◆ tctl()

static Type com.cliffc.aa.node.CallNode.tctl ( Type tcall )

staticpackage

Definition at line 148 of file CallNode.java.

148 { return ((TypeTuple)tcall).at(CTL_IDX); }

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

Here is the caller graph for this function:

◆ tesc()

static TypeMemPtr com.cliffc.aa.node.CallNode.tesc ( Type tcall )

staticpackage

Definition at line 151 of file CallNode.java.

                                               {
     if( !(tcall instanceof TypeTuple) ) return tcall.oob(TypeMemPtr.OOP);
     TypeTuple tt = (TypeTuple)tcall;
     return (TypeMemPtr)tt.at(tt.len()-1);
   }

References com.cliffc.aa.type.TypeTuple.at(), com.cliffc.aa.type.TypeTuple.len(), com.cliffc.aa.type.Type< T extends Type< T >.oob(), and com.cliffc.aa.type.TypeMemPtr.OOP.

Referenced by com.cliffc.aa.node.LoadNode._find_previous_store_call(), 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:

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

◆ ttfp()

static TypeFunPtr com.cliffc.aa.node.CallNode.ttfp ( Type tcall )

static

Definition at line 157 of file CallNode.java.

                                               {
     TypeTuple tt = (TypeTuple)tcall;
     return (TypeFunPtr)tt.at(tt.len()-2); // 2nd-to-last type
   }

References com.cliffc.aa.type.TypeTuple.at(), and com.cliffc.aa.type.TypeTuple.len().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ ttfpx()

static TypeFunPtr com.cliffc.aa.node.CallNode.ttfpx ( Type tcall )

static

Definition at line 162 of file CallNode.java.

                                               {
     if( !(tcall instanceof TypeTuple) ) return null;
     TypeTuple tt = (TypeTuple)tcall;
     Type t = tt.at(tt.len()-2);
     return t instanceof TypeFunPtr ? (TypeFunPtr)t : null;
   }

References com.cliffc.aa.type.TypeTuple.at(), and com.cliffc.aa.type.TypeTuple.len().

Referenced by com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.GVNGCM.remove_ambi(), and com.cliffc.aa.node.CallEpiNode.value().

Here is the call graph for this function:

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

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

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

Definition at line 421 of file CallNode.java.

                                                     {
     // Pinch to XCTRL/CTRL
     Type ctl = ctl()._val;
     if( ctl != Type.CTRL ) return ctl.oob();
  
     // Not a memory to the call?
     Type mem = mem()==null ? TypeMem.ANYMEM : mem()._val;
     TypeMem tmem = mem instanceof TypeMem ? (TypeMem)mem : TypeMem.ANYMEM;
  
     // Result type includes a type-per-input and an extra roll-up type of all
     // escaping aliases.
     final Type[] ts = Types.get(_defs._len+1);
     ts[CTL_IDX] = Type.CTRL;
     ts[MEM_IDX] = tmem;         // Memory into the callee, not caller
  
     // Copy args for called functions.  FIDX is refined below.
     // Also gather all aliases from all args.
     BitsAlias as = BitsAlias.EMPTY;
     for( int i=DSP_IDX; i<nargs(); i++ )
       as = as.meet(get_alias(ts[i] = arg(i)==null ? Type.XSCALAR : arg(i)._val));
     // Recursively search memory for aliases; compute escaping aliases
     BitsAlias as2 = tmem.all_reaching_aliases(as);
     ts[_defs._len] = TypeMemPtr.make(as2,TypeObj.ISUSED); // Set escapes as last type
     // Only pass along escaping aliases; others are not available to the call
     // body.  In the case of recursive calls, aliases made new in the body may
     // not be passed into the recursive calls, and thus not into the call head
     // and thus avoids self-merging.  Once we decide to inline, keep the entire
     // alias set since this filtering by the CallNode goes away as we inline.
     if( !_is_copy ) ts[MEM_IDX] = tmem.slice_reaching_aliases(as2);
  
     // Not a function to call?
     Type tfx = fdx()==null ? TypeFunPtr.GENERIC_FUNPTR : fdx()._val;
     if( !(tfx instanceof TypeFunPtr) )
       tfx = tfx.oob(TypeFunPtr.GENERIC_FUNPTR);
     TypeFunPtr tfp = (TypeFunPtr)tfx;
     BitsFun fidxs = tfp.fidxs();
     if( _not_resolved_by_gcp && // If overloads not resolvable, then take them all and we are in-error
         fidxs.above_center() && tfp!=TypeFunPtr.GENERIC_FUNPTR.dual() )
       tfp = tfp.make_from(fidxs.dual()); // Force FIDXS low (take all), and we are in-error
  
     ts[_defs._len-1] = tfp;    // FIDX is the last _def, 2nd-to-last type in ts
  
     return TypeTuple.make(ts);
   }

Referenced by com.cliffc.aa.node.TestNodeSmall.testCallNodeResolve2().

Here is the call graph for this function:

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

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

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

Definition at line 104 of file CallNode.java.

104 { return _is_copy ? "CopyCall" : (is_dead() ? "Xall" : "Call"); } // Self short name

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ xval()

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

inherited

Definition at line 460 of file Node.java.

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ _badargs

Parse [] com.cliffc.aa.node.CallNode._badargs

package

Definition at line 94 of file CallNode.java.

Referenced by com.cliffc.aa.node.CallNode.CallNode(), com.cliffc.aa.node.ParmNode.err(), com.cliffc.aa.node.CallNode.err(), com.cliffc.aa.node.CallEpiNode.ideal_reduce(), com.cliffc.aa.node.CallEpiNode.set_is_copy(), and com.cliffc.aa.node.FunNode.split_callers().

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

package

Definition at line 89 of file CallNode.java.

Referenced by com.cliffc.aa.node.CallNode.add_reduce_extra(), com.cliffc.aa.node.CallNode.all_fcns_wired(), com.cliffc.aa.node.CallNode.is_copy(), com.cliffc.aa.node.CallEpiNode.set_is_copy(), com.cliffc.aa.node.CallNode.value(), and com.cliffc.aa.node.CallNode.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.

◆ _not_resolved_by_gcp

boolean com.cliffc.aa.node.CallNode._not_resolved_by_gcp

Definition at line 90 of file CallNode.java.

Referenced by com.cliffc.aa.GVNGCM.remove_ambi(), and com.cliffc.aa.node.CallNode.value().

◆ _op

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

packageinherited

Definition at line 85 of file Node.java.

◆ _rpc

int com.cliffc.aa.node.CallNode._rpc

package

Definition at line 87 of file CallNode.java.

Referenced by com.cliffc.aa.node.CallNode.CallNode(), com.cliffc.aa.node.CallNode.copy(), com.cliffc.aa.node.CallNode.equals(), com.cliffc.aa.node.CallNode.hashCode(), com.cliffc.aa.node.CallNode.set_rpc(), and com.cliffc.aa.node.CallEpiNode.wire0().

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

◆ _unpacked

boolean com.cliffc.aa.node.CallNode._unpacked

package

Definition at line 88 of file CallNode.java.

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

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

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

◆ CallNode()

Member Function Documentation

◆ [static initializer]()

◆ _do_reduce()

◆ _elock()

◆ _header()

◆ _ideal_grow()

◆ add_def()

◆ add_flow_def_extra()

◆ add_flow_extra()

◆ add_flow_use_extra()

◆ add_reduce_extra()

◆ adderr()

◆ all_fcns_wired()

◆ all_live()

◆ arg()

◆ cepi()

◆ check_solo_mem_writer()

◆ check_vals()

◆ con()

◆ copy()

◆ ctl()

◆ del()

◆ do_flow()

◆ do_grow()

◆ do_mono()

◆ do_reduce()

◆ dsp()

◆ dump() [1/5]

◆ dump() [2/5]

◆ dump() [3/5]

◆ dump() [4/5]

◆ dump() [5/5]

◆ dumprpo()

◆ emem() [1/2]

◆ emem() [2/2]

◆ equals()

◆ err()

◆ escapees()

◆ fdx()

◆ fidxs()

◆ find() [1/2]

◆ find() [2/2]

◆ get_alias()

◆ get_fptr()

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