escape.cpp revision 3932
2842N/A * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved. 2842N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 2842N/A * This code is free software; you can redistribute it and/or modify it 2842N/A * under the terms of the GNU General Public License version 2 only, as 2842N/A * published by the Free Software Foundation. 2842N/A * This code is distributed in the hope that it will be useful, but WITHOUT 2842N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 2842N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 2842N/A * version 2 for more details (a copy is included in the LICENSE file that 2842N/A * You should have received a copy of the GNU General Public License version 2842N/A * 2 along with this work; if not, write to the Free Software Foundation, 2842N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2842N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA // Add unknown java object. // Add ConP(#NULL) and ConN(#NULL) nodes. // EA brings benefits only when the code has allocations and/or locks which // are represented by ideal Macro nodes. for(
int i=0; i <
cnt; i++ ) {
// Add ConP#NULL and ConN#NULL nodes before ConnectionGraph construction // to create space for them in ConnectionGraph::_nodes[]. // Perform escape analysis // There are non escaping objects. // 1. Populate Connection Graph (CG) with PointsTo nodes. // Create PointsTo nodes and add them to Connection Graph. Called // only once per ideal node since ideal_nodes is Unique_Node list. // Only allocations and java static calls results are interesting. // Collect all MergeMem nodes to add memory slices for // scalar replaceable objects in split_unique_types(). // Collect compare pointers nodes. // Collect all MemBarStoreStore nodes so that depending on the // escape status of the associated Allocate node some of them // Collect address nodes for graph verification. return false;
// Nothing to do. // Add final simple edges to graph. // Verify that no new simple edges could be created and all // 2. Finish Graph construction by propagating references to all // java objects through graph. // All objects escaped or hit time or iterations limits. // 3. Adjust scalar_replaceable state of nonescaping objects and push // scalar replaceable allocations on alloc_worklist for processing // in split_unique_types(). // Verify that graph is complete - no new edges could be added or needed. }
// TracePhase t3("connectionGraph") // 4. Optimize ideal graph based on EA information. // 5. Separate memory graph for scalar replaceable allcations. // Now use the escape information to create unique types for // scalar replaceable objects. tty->
print(
"=== No allocations eliminated for ");
tty->
print(
" since EliminateAllocations is off ===");
tty->
print(
" since there are no scalar replaceable candidates ===");
tty->
print(
" since AliasLevel < 3 ===");
// Populate Connection Graph with PointsTo nodes and create simple // connection graph edges. assert(!
_verify,
"this method sould not be called for verification");
return;
// No need to redefine PointsTo node during first iteration. // Arguments to allocation and locking don't escape. // Put Lock and Unlock nodes on IGVN worklist to process them during // first IGVN optimization when escape information is still available. return;
// Skip uncommon traps // Don't mark as processed since call's arguments have to be processed. // Check if a call returns an object. // Put this check here to process call arguments since some call nodes return;
// Skip predefined nodes. // Field nodes are created for all field types. They are used in // adjust_scalar_replaceable_state() and split_unique_types(). // Note, non-oop fields will have only base edges in Connection // Graph because such fields are not used for oop loads and stores. // Do not add edges during first iteration because some could be // assume all oop constants globally escape except for null // assume that all exception objects globally escape // Unknown class is loaded // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because // ThreadLocal has RawPrt type. // Produces Null or notNull and is used in only in CmpP so // phantom_obj could be used. // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because // ThreadLocal has RawPrt type. // Do not add edges during first iteration because some could be // we are only interested in the oop result projection from a call // Treat Return value as LocalVar with GlobalEscape escape state. // Verify a raw address for a store captured by Initialize node. // Ignore copy the displaced header to the BoxNode (OSR compilation). // Stored value escapes in unsafe access. // Pointer stores in G1 barriers looks like unsafe access. // Ignore such stores to be able scalar replace non-escaping break;
// G1 pre barier previous oop value store. break;
// G1 post barier card address store. assert(
false,
"not unsafe or G1 barrier raw StoreP");
;
// Do nothing for nodes not related to EA. /* Should not be called for not pointer type. */ \
// Add final simple edges to graph. return;
// This method does not change graph for JavaObject. "node should be registered already");
continue;
// ignore top or inputs which go back this node // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because // ThreadLocal has RawPrt type. // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because // ThreadLocal has RawPrt type. for (
uint i =
1; i < n->
req(); i++) {
continue;
// ignore top or inputs which go back this node // we are only interested in the oop result projection from a call // Treat Return value as LocalVar with GlobalEscape escape state. // Point Address to Value // Stored value escapes in unsafe access. // Add edge to object for unsafe access with offset. // char[] arrays passed to string intrinsic do not escape but // they are not scalar replaceable. Adjust escape state for them. // Start from in(2) edge since in(1) is memory edge. for (
uint i =
2; i < n->
req(); i++) {
// This method should be called only for EA specific nodes which may // miss some edges when they were created. // Not scalar replaceable if the length is not constant or too big. }
else {
// Allocate instance // Call nodes could be different types: // 1. CallDynamicJavaNode (what happened during call is unknown): // - mapped to GlobalEscape JavaObject node if oop is returned; // - all oop arguments are escaping globally; // 2. CallStaticJavaNode (execute bytecode analysis if possible): // - the same as CallDynamicJavaNode if can't do bytecode analysis; // - mapped to GlobalEscape JavaObject node if unknown oop is returned; // - mapped to NoEscape JavaObject node if non-escaping object allocated // during call is returned; // - mapped to ArgEscape LocalVar node pointed to object arguments // which are returned and does not escape during call; // - oop arguments escaping status is defined by bytecode analysis; // For a static call, we know exactly what method is being called. // Use bytecode estimator to record whether the call's return value escapes. // Returns a newly allocated unescaped object. // Returns a newly allocated unescaped object, simply // update dependency information. // Mark it as NoEscape so that objects referenced by // it's fields will be marked as NoEscape at least. // Determine whether any arguments are returned. // Returns unknown object. // An other type of call, assume the worst case: // returned value is unknown and globally escapes. assert(
false,
"should be done already");
// Stub calls, objects do not escape but they are not scale replaceable. // Adjust escape state for outgoing arguments. // The inline_native_clone() case when the arraycopy stub is called // after the allocation before Initialize and CheckCastPP nodes. // Or normal arraycopy for object arrays case. // Set AddP's base (Allocate) as not scalar replaceable since // pointer to the base (with offset) is passed as argument. // src or dst could be j.l.Object when other is basic type array: // arraycopy(char[],0,Object*,0,size); // arraycopy(Object*,0,char[],0,size); // Don't add edges in such cases. assert(
false,
"EA: unexpected CallLeaf");
// Always process arraycopy's destination object since // we need to add all possible edges to references in // Special arraycopy edge: // A destination object's field can't have the source object // as base since objects escape states are not related. // Only escape state of destination object's fields affects // escape state of fields in source object. // For a static call, we know exactly what method is being called. // Use bytecode estimator to record the call's escape affects // fall-through if not a Java method or no analyzer information // The call returns arguments. // The argument global escapes // The argument itself doesn't escape, but any fields might // The call returns arguments. // Returns also unknown object. // Fall-through here if not a Java method or no analyzer information // or some other type of call, assume the worst case: all arguments // Finish Graph construction. // Normally only 1-3 passes needed to build Connection Graph depending // on graph complexity. Observed 8 passes in jvm2008 compiler.compiler. // Set limit to 20 to catch situation when something did go wrong and // bailout Escape Analysis. // Also limit build time to 30 sec (60 in debug VM). // Propagate GlobalEscape and ArgEscape escape states and check that // we still have non-escaping objects. The method pushs on _worklist // Field nodes which reference phantom_object. return false;
// Nothing to do. // Now propagate references to all JavaObject nodes. // Propagate references to phantom_object for nodes pushed on _worklist // by find_non_escaped_objects() and find_field_value(). // Update escape states on each iteration if graph was updated. return false;
// Nothing to do. // Find fields which have unknown value. // This code may added new edges to phantom_object. // Need an other cycle to propagate references to phantom_object. // Bailout if passed limits. C->
log()->
begin_elem(
"connectionGraph_bailout reason='reached ");
assert(
false,
err_msg(
"infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d",
// Possible infinite build_connection_graph loop, // bailout (no changes to ideal graph were made). tty->
print_cr(
"EA: %d iterations to build connection graph with %d nodes and worklist size %d",
// Find fields initialized by NULL for non-escaping Allocations. // Adding references to NULL object does not change escape states // since it does not escape. Also no fields are added to NULL object. // The object allocated by this Allocate node will never be // seen by an other thread. Mark it so that when it is // expanded no MemBarStoreStore is added. return true;
// Finished graph construction. // Propagate GlobalEscape and ArgEscape escape states to all nodes // and check that we still have non-escaping java objects. // First, put all nodes with GlobalEscape and ArgEscape states on worklist. // Set escape states to referenced nodes (edges list). // GlobalEscape or ArgEscape state of field means it has unknown value. // Propagate only fields escape state through arraycopy edge. // fields_escape_state is also set to 'es' if it is less than 'es'. // Propagate field escape state. // Change escape state of referenced fileds. // Remove escaped objects from non_escaped list. // Find fields in non-escaped allocations which have unknown value. // Add all references to JavaObject node by walking over all uses. // Populate _worklist by uses of jobj's uses. // Put on worklist all field's uses (loads) and // related field nodes (same base and offset). // Add reference from jobj to field and from field to jobj (field's base). if (
jobj ==
null_obj)
// NULL object does not have field edges // Added edge from Arraycopy node to arraycopy's source java object continue;
// No new edge added, there was such edge already. if (
jobj ==
null_obj)
// NULL object does not have field edges // Add edge from arraycopy's destination java object to Arraycopy node. // Added new edge to stored in field values. // Put on worklist all field's uses (loads) and // related field nodes (same base and offset). // Put on worklist all related field nodes. // Loop over all bases of this field and push on worklist Field nodes // with the same offset and base (since they may reference the same field). // Check if the base was source object of arraycopy and go over arraycopy's // destination objects since values stored to a field of source object are // accessable by uses (loads) of fields of destination objects. // Look for the same arracopy reference. // Put on worklist all related field nodes. if (
// Skip phantom_object since it is only used to indicate that // this field's content globally escapes. // NULL object node does not have fields. // Skip arraycopy edge since store to destination object field // does not update value in source object field. // Find fields which have unknown value. // Escaped fields should have init value already. // Skip Allocate's fields which will be processed later. // Find fields initializing values for allocations. // Do nothing for Allocate nodes since its fields values are "known". // Non-escaped allocation returned from Java or runtime call have // unknown values in fields. // Do nothing for Call nodes since its fields values are unknown. // Check if an oop field's initializing value is recorded and add // a corresponding NULL if field's value if it is not recorded. // Connection Graph does not record a default initialization by NULL // captured by Initialize node. continue;
// Not oop field // OffsetBot is used to reference array's element, // always add reference to NULL to all Field nodes since we don't // known which element is referenced. // Check only oop fields. // Raw pointers are used for initializing stores so skip it // since it should be recorded already // There could be initializing stores which follow allocation. // For example, a volatile field store is not collected // Need to check for dependent loads to separate such stores from // stores which follow loads. For now, add initial value NULL so // that compare pointers optimization works correctly. // A field's initializing value was not recorded. Add NULL. // Adjust scalar_replaceable state after Connection Graph is built. // Search for non-escaping objects which are not scalar replaceable // and mark them to propagate the state to referenced objects. // 1. An object is not scalar replaceable if the field into which it is // stored has unknown offset (stored into unknown element of an array). // 2. An object is not scalar replaceable if it is merged with other objects. // Non-escaping object node should point only to field nodes. // 3. An object is not scalar replaceable if it has a field with unknown // offset (array's element is accessed in loop). // 4. Currently an object is not scalar replaceable if a LoadStore node // access its field since the field value is unknown after it. // 5. Or the address may point to more then one object. This may produce // the false positive result (set not scalar replaceable) // since the flow-insensitive escape analysis can't separate // the case when stores overwrite the field's value from the case // when stores happened on different control branches. // Note: it will disable scalar replacement in some cases: // Point p[] = new Point[1]; // p[0] = new Point(); // Will be not scalar replaced // but it will save us from incorrect optimizations in next cases: // Point p[] = new Point[1]; // if ( x ) p[0] = new Point(); // Will be not scalar replaced // Don't take into account LocalVar nodes which // may point to only one object which should be also // this field's base by now. // Verify that graph is complete - no new edges could be added. // Verify that escape state is final. // Verify fields information. // Verify that field has all bases // Verify that all fields have initializing values. // Mark locks before changing ideal graph. for(
int i=0; i <
cnt; i++ ) {
// The lock could be marked eliminated by lock coarsening // code during first IGVN before EA. Replace coarsened flag // Add ConI(#CC_GT) and ConI(#CC_EQ). // Optimize objects compare. // escape status of associated AllocateNode and optimize out // MemBarStoreStore node if the allocated object never escapes. // Optimize objects compare. // Check simple cases first. // Comparing the same not escaping object. // Comparing not escaping allocation. return _pcmp_neq;
// This includes nullness check. // Comparing not escaping allocation. return _pcmp_neq;
// This includes nullness check. // Klass or String constants compare. Need to be careful with // compressed pointers - compare types of ConN and ConP instead of nodes. return NULL;
// Sets are not disjoint // Check nullness of unknown object. // Disjointness by itself is not sufficient since // alias analysis is not complete for escaped objects. // Disjoint sets are definitely unrelated only when // at least one set has only not escaping allocations. // Connection Graph constuction functions. // Add edge from arraycopy node to source object. // Add edge from destination object to arraycopy node. // Check only oop fields. // OffsetBot is used to reference array's element. Ignore first AddP. // Check for unsafe oop field access // Ignore array length load. // Allocation initialization, ThreadLocal field access, unsafe access // Returns unique pointed java object or NULL. // If the node was created after the escape computation we can't answer. // Check all java objects it points to. // Return true if this node points only to non-escaping allocations. // Check all java objects it points to. // Return true if we know the node does not escape globally. // If the node was created after the escape computation we can't answer. // If we have already computed a value, return it. return true;
// (es < PointsToNode::GlobalEscape); // Check all java objects it points to. // Return true if this node points to specified node or nodes it points to. // Return true if one node points to an other. // Return true if bases point to this java object. // We are computing a raw address for a store captured by an Initialize // compute an appropriate address type. AddP cases #3 and #5 (see below). "offset must be a constant or it is initialization of array");
// AddP cases for Base and Address inputs: // case #1. Direct object's field reference: // Proj #5 ( oop result ) // CheckCastPP (cast to instance type) // AddP ( base == address ) // case #2. Indirect object's field reference: // CastPP (cast to instance type) // AddP ( base == address ) // case #3. Raw object's field reference for Initialize node: // Proj #5 ( oop result ) // case #4. Array's element reference: // {CheckCastPP | CastPP} // | AddP ( array's element offset ) // AddP ( array's offset ) // case #5. Raw object's field reference for arraycopy stub call: // The inline_native_clone() case when the arraycopy stub is called // after the allocation before Initialize and CheckCastPP nodes. // Proj #5 ( oop result ) // AddP ( base == address ) // case #6. Constant Pool, ThreadLocal, CastX2P or // Raw object's field reference: // {ConP, ThreadLocal, CastX2P, raw Load} // case #7. Klass's field reference. // AddP ( base == address ) // case #8. narrow Klass's field reference. // AddP ( base == address ) // Case #6 (unsafe access) may have several chained AddP nodes. // Find array's offset to push it on worklist first and // as result process an array's element offset first (pushed second) // to avoid CastPP for the array's offset. // Otherwise the inserted CastPP (LocalVar) will point to what // the AddP (Field) points to. Which would be wrong since // the algorithm expects the CastPP has the same point as // as AddP's base CheckCastPP (LocalVar). // memProj (from ArrayAllocation CheckCastPP) // | || Int (element index) // | || | ConI (log(element size)) // | AddP (array's element offset) // | | ConI (array's offset: #12(32-bits) or #24(64-bits)) // Load/Store (memory operation on array's element) // Adjust the type and inputs of an AddP which computes the // address of a field of an instance // We are computing a raw address for a store captured by an Initialize // compute an appropriate address type (cases #3 and #5). "old type must be non-instance or match new type");
// The type 't' could be subclass of 'base_t'. // As result t->offset() could be large then base_t's size and it will // cause the failure in add_offset() with narrow oops since TypeOopPtr() // constructor verifies correctness of the offset. // It could happened on subclass's branch (from the type profiling // inlining) which was not eliminated during parsing since the exactness // of the allocation type was not propagated to the subclass type check. // Or the type 't' could be not related to 'base_t' at all. // It could happened when CHA type is different from MDO type on a dead path // (for example, from instanceof check) which is not collapsed during parsing. // Do nothing for such AddP node and don't process its users since // this code branch will go away. return false;
// bail out // Do NOT remove the next line: ensure a new alias index is allocated // for the instance type. Note: C++ will not remove it since the call // record the allocation in the node map // Set addp's Base and Address to 'base'. // Skip AddP cases #3 and #5. // AddP case #4 (adr is array's element offset AddP node) // Put on IGVN worklist since at least addp's type was changed above. // Create a new version of orig_phi if necessary. Returns either the newly // created phi or an existing phi. Sets create_new to indicate whether a new // phi was created. Cache the last newly created phi in the node map. // nothing to do if orig_phi is bottom memory or matches alias_idx // Have we recently created a Phi for this alias index? // Previous check may fail when the same wide memory Phi was split into Phis // for different memory slices. Search all Phis for this region. // Retry compilation without escape analysis. // If this is the first failure, the sentinel string will "stick" // to the Compile object, and the C2Compiler will see it and retry. // Return a new version of Memory Phi "orig_phi" with the inputs having the // specified alias index. // found an phi for which we created a new split, push current one on worklist and begin // verify that the new Phi has an input for each input of the original // Check if all new phi's inputs have specified alias index. // Otherwise use old phi. // we have finished processing a Phi, see if there are any more to do // The next methods are derived from methods in MemNode. // TypeOopPtr::NOTNULL+any is an OOP with unknown offset - generally // means an array I have not precisely typed yet. Do not do any // alias stuff with it any time soon. // Update input if it is progress over what we have now // Move memory users to their memory slices. continue;
// Nothing to do // Replace previous general reference to mem node. // Don't move related membars. continue;
// Nothing to do // Move to general memory slice. // Don't move related cardmark. // Memory nodes should have new memory input. "Following memory nodes should have new memory input or be on the same memory slice");
// Phi nodes should be split and moved already. assert(
false,
"should not be here");
// Search memory chain of "mem" to find a MemNode whose address // is the specified alias index. break;
// hit one of our sentinels break;
// Do not skip store to general memory slice. continue;
// don't search further for non-instance types // skip over a call which does not affect this memory slice break;
// hit one of our sentinels // Stop if this is the initialization for the object instance which // which contains this memory slice, otherwise skip over it. // Didn't find instance memory, search through general slice recursively. // Can not bypass initialization of the instance // Otherwise skip it (the call updated 'result' value). assert(
idx !=
alias_idx,
"Object is not scalar replaceable if a LoadStore node access its field");
// Push all non-instance Phis on the orig_phis worklist to update inputs // during Phase 4 if needed. // Create a new Phi with the specified alias index type. // the result is either MemNode, PhiNode, InitializeNode. // Convert the types of unescaped object to instance types where possible, // propagate the new type information through the graph, and update memory // edges and MergeMem inputs to reflect the new type. // We start with allocations (and calls which may be allocations) on alloc_worklist. // The processing is done in 4 phases: // Phase 1: Process possible allocations from alloc_worklist. Create instance // types for the CheckCastPP for allocations where possible. // Propagate the the new types through users as follows: // casts and Phi: push users on alloc_worklist // AddP: cast Base and Address inputs to the instance type // push any AddP users on alloc_worklist and push any memnode // users onto memnode_worklist. // Phase 2: Process MemNode's from memnode_worklist. compute new address type and // search the Memory chain for a store with the appropriate type // address type. If a Phi is found, create a new version with // the appropriate memory slices from each of the Phi inputs. // For stores, process the users as follows: // MemNode: push on memnode_worklist // MergeMem: push on mergemem_worklist // Phase 3: Process MergeMem nodes from mergemem_worklist. Walk each memory slice // moving the first node encountered of each instance type to the // the input corresponding to its alias index. // appropriate memory slice. // Phase 4: Update the inputs of non-instance memory Phis and the Memory input of memnodes. // In the following example, the CheckCastPP nodes are the cast of allocation // results and the allocation of node 29 is unescaped and eligible to be an // 20 AddP _ 19 19 10 Foo+12 alias_index=4 // 30 AddP _ 29 29 10 Foo+12 alias_index=4 // 40 StoreP 25 7 20 ... alias_index=4 // 50 StoreP 35 40 30 ... alias_index=4 // 60 StoreP 45 50 20 ... alias_index=4 // 70 LoadP _ 60 30 ... alias_index=4 // 80 Phi 75 50 60 Memory alias_index=4 // 90 LoadP _ 80 30 ... alias_index=4 // 100 LoadP _ 80 20 ... alias_index=4 // Phase 1 creates an instance type for node 29 assigning it an instance id of 24 // and creating a new alias index for node 30. This gives: // 20 AddP _ 19 19 10 Foo+12 alias_index=4 // 29 CheckCastPP "Foo" iid=24 // 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 // 40 StoreP 25 7 20 ... alias_index=4 // 50 StoreP 35 40 30 ... alias_index=6 // 60 StoreP 45 50 20 ... alias_index=4 // 70 LoadP _ 60 30 ... alias_index=6 // 80 Phi 75 50 60 Memory alias_index=4 // 90 LoadP _ 80 30 ... alias_index=6 // 100 LoadP _ 80 20 ... alias_index=4 // In phase 2, new memory inputs are computed for the loads and stores, // And a new version of the phi is created. In phase 4, the inputs to // node 80 are updated and then the memory nodes are updated with the // values computed in phase 2. This results in: // 20 AddP _ 19 19 10 Foo+12 alias_index=4 // 29 CheckCastPP "Foo" iid=24 // 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 // 40 StoreP 25 7 20 ... alias_index=4 // 50 StoreP 35 7 30 ... alias_index=6 // 60 StoreP 45 40 20 ... alias_index=4 // 70 LoadP _ 50 30 ... alias_index=6 // 80 Phi 75 40 60 Memory alias_index=4 // 120 Phi 75 50 50 Memory alias_index=6 // 90 LoadP _ 120 30 ... alias_index=6 // 100 LoadP _ 80 20 ... alias_index=4 // Phase 1: Process possible allocations from alloc_worklist. // Create instance types for the CheckCastPP for allocations where possible. // (Note: don't forget to change the order of the second AddP node on // the alloc_worklist if the order of the worklist processing is changed, // see the comment in find_second_addp().) // copy escape information to call node // We have an allocation or call which returns a Java object, // see if it is unescaped. // Find CheckCastPP for the allocate or for the return value of a call if (n ==
NULL) {
// No uses except Initialize node // Set the scalar_replaceable flag for allocation // so it could be eliminated if it has no uses. // The inline code for Object.clone() casts the allocation result to // java.lang.Object and then to the actual type of the allocated // object. Detect this case and use the second cast. // Also detect j.l.reflect.Array.newInstance(jobject, jint) case when // the allocation result is cast to java.lang.Object and then // to the actual Array type. // Non-scalar replaceable if the allocation type is unknown statically // (reflection allocation), the object can't be restored during // deoptimization without precise type. // Set the scalar_replaceable flag for allocation // so it could be eliminated. // in order for an object to be scalar-replaceable, it must be: // - a direct allocation (not a call returning an object) // - eligible to be a unique type // - not determined to be ineligible by escape analysis continue;
// not a TypeOopPtr // First, put on the worklist all Field edges from Connection Graph // which is more accurate then putting immediate users from Ideal Graph. "only AddP nodes are Field edges in CG");
if (
use->
outcnt() > 0) {
// Don't process dead nodes // An allocation may have an Initialize which has raw stores. Scan // the users of the raw allocation result and push AddP users continue;
// already processed continue;
// Skip dead path with different type assert(
false,
"EA: unexpected node");
// push allocation's users on appropriate worklist // Look for MergeMem nodes for calls which reference unique allocation // (through CheckCastPP nodes) even for debug info. assert(
false,
"EA: missing allocation reference path");
// New alias types were created in split_AddP(). // Phase 2: Process MemNode's from memnode_worklist. compute new address type and // compute new values for Memory inputs (the Memory inputs are not // actually updated until phase 4.) // we don't need to do anything, but the users must be pushed }
else if (n->
is_MemBar()) {
// Initialize, MemBar nodes // we don't need to do anything, but the users must be pushed // We delay the memory edge update since we need old one in // MergeMem code below when instances memory slices are separated. continue;
// don't push users // get the memory projection // push user on appropriate worklist assert(
false,
"EA: missing memory path");
// Phase 3: Process MergeMem nodes from mergemem_worklist. // Walk each memory slice moving the first node encountered of each // instance type to the the input corresponding to its alias index. // Note: we don't want to use MergeMemStream here because we only want to // scan inputs which exist at the start, not ones we add during processing. // Note 2: MergeMem may already contains instance memory slices added // during find_inst_mem() call when memory nodes were processed above. // First, update mergemem by moving memory nodes to corresponding slices // if their type became more precise since this mergemem was created. // Find any instance of the current type if we haven't encountered // already a memory slice of the instance along the memory chain. // Find the rest of instances values // Didn't find instance memory, search through general slice recursively. // Phase 4: Update the inputs of non-instance memory Phis and // the Memory input of memnodes // First update the inputs of any non-instance Phi's from // which we split out an instance Phi. Note we don't have // to recursively process Phi's encounted on the input memory // chains as is done in split_memory_phi() since they will // also be processed here. // Update the memory inputs of MemNodes with the value we computed // in Phase 2 and move stores memory users to corresponding memory slices. // Disable memory split verification code until the fix for 6984348. // Currently it produces false negative results since it does not cover all cases. // Move memory users of a store first. // Now update memory input // Verify that memory was split correctly tty->
print(
"======== Connection graph for ");
// Print all locals and fields which reference this allocation