escape.cpp revision 1841
1472N/A * Copyright (c) 2005, 2009, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 0N/A * published by the Free Software Foundation. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 0N/A#
include "incls/_precompiled.incl" 0N/A "P",
// PointsToEdge 0N/A "D",
// DeferredEdge 253N/A // Add ConP(#NULL) and ConN(#NULL) nodes. 0N/A // don't add a self-referential edge, this can occur during removal of 65N/A // We are computing a raw address for a store captured by an Initialize 65N/A // compute an appropriate address type. AddP cases #3 and #5 (see below). 65N/A "offset must be a constant or it is initialization of array");
65N/A // inline set_escape_state(idx, es); 65N/A // If we are still collecting or there were no non-escaping allocations 65N/A // we don't know the answer yet 0N/A // if the node was created after the escape computation, return 0N/A // if we have already computed a value, return it 244N/A // PointsTo() calls n->uncast() which can return a new ideal node. 0N/A // compute max escape state of anything this node could point to 1554N/A // cache the computed escape state 1554N/A }
// orig_es could be PointsToNode::UnknownEscape 0N/A // If we have a JavaObject, return just that object 244N/A // ensure that all inputs of a Phi have been processed 244N/A assert(
false,
"neither PointsToEdge or DeferredEdge");
244N/A // no deferred or pointsto edges found. Assume the value was set 244N/A // outside this method. Add the phantom object to the pointsto set. 101N/A // This method is most expensive during ConnectionGraph construction. 101N/A // Reuse vectorSet and an additional growable array for deferred edges. 101N/A // Mark current edges as visited and move deferred edges to separate array. 244N/A // Special case - field set outside (globally escaping). 0N/A// Add an edge to node given by "to_i" from any field of adr_i whose offset 0N/A// matches "offset" A deferred edge is added if to_i is a LocalVar, and 0N/A// a pointsto edge is added if it is a JavaObject 65N/A// Add a deferred edge from node given by "from_i" to any field of adr_i 65N/A// whose offset matches "offset". 0N/A // we have not seen any stores to this field, assume it was set outside this method 65N/A // AddP cases for Base and Address inputs: 65N/A // case #1. Direct object's field reference: 65N/A // Proj #5 ( oop result ) 65N/A // CheckCastPP (cast to instance type) 65N/A // AddP ( base == address ) 65N/A // case #2. Indirect object's field reference: 65N/A // CastPP (cast to instance type) 65N/A // AddP ( base == address ) 65N/A // case #3. Raw object's field reference for Initialize node: 65N/A // Proj #5 ( oop result ) 65N/A // AddP ( base == top ) 65N/A // case #4. Array's element reference: 65N/A // {CheckCastPP | CastPP} 65N/A // | AddP ( array's element offset ) 65N/A // AddP ( array's offset ) 65N/A // case #5. Raw object's field reference for arraycopy stub call: 65N/A // The inline_native_clone() case when the arraycopy stub is called 65N/A // after the allocation before Initialize and CheckCastPP nodes. 65N/A // Proj #5 ( oop result ) 65N/A // AddP ( base == address ) 77N/A // case #6. Constant Pool, ThreadLocal, CastX2P or 77N/A // Raw object's field reference: 77N/A // {ConP, ThreadLocal, CastX2P, raw Load} 65N/A // AddP ( base == top ) 77N/A // case #7. Klass's field reference. 77N/A // AddP ( base == address ) 164N/A // case #8. narrow Klass's field reference. 164N/A // AddP ( base == address ) 957N/A // Case #6 (unsafe access) may have several chained AddP nodes. 65N/A // Find array's offset to push it on worklist first and 65N/A // as result process an array's element offset first (pushed second) 65N/A // to avoid CastPP for the array's offset. 65N/A // Otherwise the inserted CastPP (LocalVar) will point to what 65N/A // the AddP (Field) points to. Which would be wrong since 65N/A // the algorithm expects the CastPP has the same point as 65N/A // as AddP's base CheckCastPP (LocalVar). 65N/A // memProj (from ArrayAllocation CheckCastPP) 65N/A // | || Int (element index) 65N/A // | || | ConI (log(element size)) 65N/A // | AddP (array's element offset) 65N/A // | | ConI (array's offset: #12(32-bits) or #24(64-bits)) 65N/A // AddP (array's offset) 0N/A// Adjust the type and inputs of an AddP which computes the 0N/A// address of a field of an instance 65N/A // We are computing a raw address for a store captured by an Initialize 293N/A // compute an appropriate address type (cases #3 and #5). 0N/A "old type must be non-instance or match new type");
293N/A // The type 't' could be subclass of 'base_t'. 293N/A // As result t->offset() could be large then base_t's size and it will 293N/A // cause the failure in add_offset() with narrow oops since TypeOopPtr() 293N/A // constructor verifies correctness of the offset. 605N/A // It could happened on subclass's branch (from the type profiling 293N/A // inlining) which was not eliminated during parsing since the exactness 293N/A // of the allocation type was not propagated to the subclass type check. 988N/A // Or the type 't' could be not related to 'base_t' at all. 988N/A // It could happened when CHA type is different from MDO type on a dead path 988N/A // (for example, from instanceof check) which is not collapsed during parsing. 293N/A // Do nothing for such AddP node and don't process its users since 293N/A // this code branch will go away. 293N/A return false;
// bail out 1062N/A // Do NOT remove the next line: ensure a new alias index is allocated 1062N/A // for the instance type. Note: C++ will not remove it since the call 0N/A // record the allocation in the node map 253N/A // Set addp's Base and Address to 'base'. 253N/A // Skip AddP cases #3 and #5. 253N/A // AddP case #4 (adr is array's element offset AddP node) 65N/A // Put on IGVN worklist since at least addp's type was changed above. 0N/A// Create a new version of orig_phi if necessary. Returns either the newly 0N/A// created phi or an existing phi. Sets create_new to indicate wheter a new 0N/A// phi was created. Cache the last newly created phi in the node map. 0N/A // nothing to do if orig_phi is bottom memory or matches alias_idx 851N/A // Have we recently created a Phi for this alias index? 851N/A // Previous check may fail when the same wide memory Phi was split into Phis 851N/A // for different memory slices. Search all Phis for this region. 38N/A // Retry compilation without escape analysis. 38N/A // If this is the first failure, the sentinel string will "stick" 38N/A // to the Compile object, and the C2Compiler will see it and retry. 0N/A// Return a new version of Memory Phi "orig_phi" with the inputs having the 0N/A// specified alias index. 0N/A // found an phi for which we created a new split, push current one on worklist and begin 0N/A // processing new one 0N/A // verify that the new Phi has an input for each input of the original 65N/A // Check if all new phi's inputs have specified alias index. 65N/A // Otherwise use old phi. 0N/A // we have finished processing a Phi, see if there are any more to do 65N/A// The next methods are derived from methods in MemNode. 1735N/A // TypeOopPtr::NOTNULL+any is an OOP with unknown offset - generally 65N/A // means an array I have not precisely typed yet. Do not do any 65N/A // alias stuff with it any time soon. 65N/A // Update input if it is progress over what we have now 1101N/A// Move memory users to their memory slices. 1101N/A // Replace previous general reference to mem node. 1101N/A // Don't move related membars. 1101N/A // Move to general memory slice. 1101N/A // Don't move related cardmark. 1101N/A // Memory nodes should have new memory input. 1101N/A "Following memory nodes should have new memory input or be on the same memory slice");
1101N/A // Phi nodes should be split and moved already. 65N/A// Search memory chain of "mem" to find a MemNode whose address 65N/A// is the specified alias index. 605N/A break;
// hit one of our sentinels 65N/A continue;
// don't search further for non-instance types 65N/A // skip over a call which does not affect this memory slice 605N/A break;
// hit one of our sentinels 65N/A // Stop if this is the initialization for the object instance which 65N/A // which contains this memory slice, otherwise skip over it. 65N/A // Didn't find instance memory, search through general slice recursively. 1100N/A // Can not bypass initialization of the instance 1100N/A // Otherwise skip it (the call updated 'result' value). 247N/A // Create a new Phi with the specified alias index type. 247N/A // Push all non-instance Phis on the orig_phis worklist to update inputs 247N/A // during Phase 4 if needed. 65N/A // the result is either MemNode, PhiNode, InitializeNode. 0N/A// Convert the types of unescaped object to instance types where possible, 0N/A// propagate the new type information through the graph, and update memory 0N/A// edges and MergeMem inputs to reflect the new type. 0N/A// We start with allocations (and calls which may be allocations) on alloc_worklist. 0N/A// The processing is done in 4 phases: 0N/A// Phase 1: Process possible allocations from alloc_worklist. Create instance 0N/A// types for the CheckCastPP for allocations where possible. 0N/A// Propagate the the new types through users as follows: 0N/A// casts and Phi: push users on alloc_worklist 0N/A// AddP: cast Base and Address inputs to the instance type 0N/A// push any AddP users on alloc_worklist and push any memnode 0N/A// users onto memnode_worklist. 0N/A// Phase 2: Process MemNode's from memnode_worklist. compute new address type and 0N/A// search the Memory chain for a store with the appropriate type 0N/A// address type. If a Phi is found, create a new version with 605N/A// the appropriate memory slices from each of the Phi inputs. 0N/A// For stores, process the users as follows: 0N/A// MemNode: push on memnode_worklist 0N/A// MergeMem: push on mergemem_worklist 0N/A// Phase 3: Process MergeMem nodes from mergemem_worklist. Walk each memory slice 0N/A// moving the first node encountered of each instance type to the 0N/A// the input corresponding to its alias index. 0N/A// appropriate memory slice. 0N/A// Phase 4: Update the inputs of non-instance memory Phis and the Memory input of memnodes. 0N/A// In the following example, the CheckCastPP nodes are the cast of allocation 0N/A// results and the allocation of node 29 is unescaped and eligible to be an 0N/A// 19 CheckCastPP "Foo" 0N/A// 20 AddP _ 19 19 10 Foo+12 alias_index=4 0N/A// 29 CheckCastPP "Foo" 0N/A// 30 AddP _ 29 29 10 Foo+12 alias_index=4 0N/A// 40 StoreP 25 7 20 ... alias_index=4 0N/A// 50 StoreP 35 40 30 ... alias_index=4 0N/A// 60 StoreP 45 50 20 ... alias_index=4 0N/A// 70 LoadP _ 60 30 ... alias_index=4 0N/A// 80 Phi 75 50 60 Memory alias_index=4 0N/A// 90 LoadP _ 80 30 ... alias_index=4 0N/A// 100 LoadP _ 80 20 ... alias_index=4 0N/A// Phase 1 creates an instance type for node 29 assigning it an instance id of 24 0N/A// and creating a new alias index for node 30. This gives: 0N/A// 19 CheckCastPP "Foo" 0N/A// 20 AddP _ 19 19 10 Foo+12 alias_index=4 0N/A// 29 CheckCastPP "Foo" iid=24 0N/A// 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 0N/A// 40 StoreP 25 7 20 ... alias_index=4 0N/A// 50 StoreP 35 40 30 ... alias_index=6 0N/A// 60 StoreP 45 50 20 ... alias_index=4 0N/A// 70 LoadP _ 60 30 ... alias_index=6 0N/A// 80 Phi 75 50 60 Memory alias_index=4 0N/A// 90 LoadP _ 80 30 ... alias_index=6 0N/A// 100 LoadP _ 80 20 ... alias_index=4 0N/A// In phase 2, new memory inputs are computed for the loads and stores, 0N/A// And a new version of the phi is created. In phase 4, the inputs to 0N/A// node 80 are updated and then the memory nodes are updated with the 0N/A// values computed in phase 2. This results in: 0N/A// 19 CheckCastPP "Foo" 0N/A// 20 AddP _ 19 19 10 Foo+12 alias_index=4 0N/A// 29 CheckCastPP "Foo" iid=24 0N/A// 30 AddP _ 29 29 10 Foo+12 alias_index=6 iid=24 0N/A// 40 StoreP 25 7 20 ... alias_index=4 0N/A// 50 StoreP 35 7 30 ... alias_index=6 0N/A// 60 StoreP 45 40 20 ... alias_index=4 0N/A// 70 LoadP _ 50 30 ... alias_index=6 0N/A// 80 Phi 75 40 60 Memory alias_index=4 0N/A// 120 Phi 75 50 50 Memory alias_index=6 0N/A// 90 LoadP _ 120 30 ... alias_index=6 0N/A// 100 LoadP _ 80 20 ... alias_index=4 65N/A // Phase 1: Process possible allocations from alloc_worklist. 65N/A // Create instance types for the CheckCastPP for allocations where possible. 244N/A // (Note: don't forget to change the order of the second AddP node on 244N/A // the alloc_worklist if the order of the worklist processing is changed, 244N/A // see the comment in find_second_addp().) 0N/A // copy escape information to call node 65N/A // We have an allocation or call which returns a Java object, 65N/A // see if it is unescaped. 784N/A // Find CheckCastPP for the allocate or for the return value of a call 784N/A if (n ==
NULL) {
// No uses except Initialize node 784N/A // Set the scalar_replaceable flag for allocation 784N/A // so it could be eliminated if it has no uses. 65N/A // The inline code for Object.clone() casts the allocation result to 247N/A // java.lang.Object and then to the actual type of the allocated 65N/A // object. Detect this case and use the second cast. 247N/A // Also detect j.l.reflect.Array.newInstance(jobject, jint) case when 247N/A // the allocation result is cast to java.lang.Object and then 247N/A // to the actual Array type. 784N/A // Non-scalar replaceable if the allocation type is unknown statically 784N/A // (reflection allocation), the object can't be restored during 784N/A // deoptimization without precise type. 784N/A // Set the scalar_replaceable flag for allocation 784N/A // so it could be eliminated. 247N/A // in order for an object to be scalar-replaceable, it must be: 65N/A // - a direct allocation (not a call returning an object) 65N/A // - eligible to be a unique type 65N/A // - not determined to be ineligible by escape analysis 0N/A continue;
// not a TypeInstPtr 163N/A // First, put on the worklist all Field edges from Connection Graph 163N/A // which is more accurate then putting immediate users from Ideal Graph. 163N/A "only AddP nodes are Field edges in CG");
65N/A // An allocation may have an Initialize which has raw stores. Scan 65N/A // the users of the raw allocation result and push AddP users 65N/A // on alloc_worklist. 65N/A continue;
// Assume the value was set outside this method. 0N/A continue;
// already processed 65N/A continue;
// Assume the value was set outside this method. 1100N/A continue;
// Skip dead path with different type 1100N/A // push allocation's users on appropriate worklist 1100N/A // Look for MergeMem nodes for calls which reference unique allocation 1100N/A // (through CheckCastPP nodes) even for debug info. 65N/A // New alias types were created in split_AddP(). 0N/A // Phase 2: Process MemNode's from memnode_worklist. compute new address type and 0N/A // compute new values for Memory inputs (the Memory inputs are not 0N/A // actually updated until phase 4.) 0N/A return;
// nothing to do 1100N/A // we don't need to do anything, but the users must be pushed 1100N/A // we don't need to do anything, but the users must be pushed 1101N/A // We delay the memory edge update since we need old one in 1101N/A // MergeMem code below when instances memory slices are separated. 0N/A continue;
// don't push users 0N/A // get the memory projection 0N/A // push user on appropriate worklist 65N/A // Phase 3: Process MergeMem nodes from mergemem_worklist. 1100N/A // Walk each memory slice moving the first node encountered of each 65N/A // instance type to the the input corresponding to its alias index. 0N/A // Note: we don't want to use MergeMemStream here because we only want to 1100N/A // scan inputs which exist at the start, not ones we add during processing. 1100N/A // Note 2: MergeMem may already contains instance memory slices added 1100N/A // during find_inst_mem() call when memory nodes were processed above. 1101N/A // First, update mergemem by moving memory nodes to corresponding slices 1101N/A // if their type became more precise since this mergemem was created. 65N/A // Find any instance of the current type if we haven't encountered 1101N/A // already a memory slice of the instance along the memory chain. 65N/A // Find the rest of instances values 65N/A // Didn't find instance memory, search through general slice recursively. 65N/A // Phase 4: Update the inputs of non-instance memory Phis and 65N/A // the Memory input of memnodes 0N/A // First update the inputs of any non-instance Phi's from 0N/A // which we split out an instance Phi. Note we don't have 0N/A // to recursively process Phi's encounted on the input memory 0N/A // chains as is done in split_memory_phi() since they will 0N/A // also be processed here. 0N/A // Update the memory inputs of MemNodes with the value we computed 1101N/A // in Phase 2 and move stores memory users to corresponding memory slices. 1101N/A // Move memory users of a store first. 1101N/A // Verify that memory was split correctly 244N/A // EA brings benefits only when the code has allocations and/or locks which 244N/A // are represented by ideal Macro nodes. 1554N/A // Add ConP#NULL and ConN#NULL nodes before ConnectionGraph construction 1554N/A // to create space for them in ConnectionGraph::_nodes[]. 1554N/A // There are non escaping objects. 163N/A // 1. Populate Connection Graph (CG) with Ideal nodes. 65N/A // Initialize worklist 65N/A // Push all useful nodes onto CG list and set their type. 244N/A // Only allocations and java static calls results are checked 244N/A // for an escape status. See process_call_result() below. 1841N/A // Collect address nodes. Use them during stage 3 below 1841N/A // to build initial connection graph field edges. 1100N/A // Collect all MergeMem nodes to add memory slices for 1100N/A // scalar replaceable objects in split_unique_types(). 244N/A return false;
// Nothing to do. 65N/A // 2. First pass to create simple CG edges (doesn't require to walk CG). 1841N/A // 3. Pass to create initial fields edges (JavaObject -F-> AddP) 1841N/A // to reduce number of iterations during stage 4 below. 65N/A // 4. Build Connection Graph which need 65N/A // to walk the connection graph. 65N/A if (n !=
NULL) {
// Call, AddP, LoadP, StoreP 1841N/A // After IGVN user nodes may have smaller _idx than 1841N/A // their inputs so they will be processed first in 1841N/A // previous loop. Because of that not all Graph 1841N/A // edges will be created. Walk over interesting 1841N/A // nodes again until no new edges are created. 1841N/A // Normally only 1-3 passes needed to build 1841N/A // Connection Graph depending on graph complexity. 1841N/A // Set limit to 10 to catch situation when something 1841N/A // did go wrong and recompile the method without EA. 1841N/A err_msg(
"infinite EA connection graph build with %d nodes and worklist size %d",
1841N/A // Possible infinite build_connection_graph loop, 1841N/A // retry compilation without escape analysis. 1100N/A // 5. Remove deferred edges from the graph and adjust 1100N/A // escape state of nonescaping objects. 1100N/A // Search for objects which are not scalar replaceable 1100N/A // and adjust their escape state. 244N/A // 6. Propagate escape states. 0N/A // push all GlobalEscape nodes on the worklist 244N/A // mark all nodes reachable from GlobalEscape nodes 0N/A // push all ArgEscape nodes on the worklist 244N/A // mark all nodes reachable from ArgEscape nodes 65N/A // push all NoEscape nodes on the worklist 244N/A // mark all nodes reachable from NoEscape nodes 605N/A // Push scalar replaceable allocations on alloc_worklist 244N/A // for processing in split_unique_types(). 244N/A // Now use the escape information to create unique types for 244N/A // scalar replaceable objects. 244N/A tty->
print(
" since there are no scalar replaceable candidates ===");
1100N/A// Search for objects which are not scalar replaceable. 1100N/A // Search for objects which are not scalar replaceable. 1100N/A // Mark their escape state as ArgEscape to propagate the state 1100N/A // Note: currently there are no difference in compiler optimizations 1100N/A // for ArgEscape objects and NoEscape objects which are not 1100N/A // Check if a oop field's initializing value is recorded and add 1100N/A // a corresponding NULL field's value if it is not recorded. 1100N/A // Connection Graph does not record a default initialization by NULL 1100N/A // captured by Initialize node. 1100N/A // Note: it will disable scalar replacement in some cases: 1100N/A // Point p[] = new Point[1]; 1100N/A // p[0] = new Point(); // Will be not scalar replaced 1100N/A // but it will save us from incorrect optimizations in next cases: 1100N/A // Point p[] = new Point[1]; 1100N/A // if ( x ) p[0] = new Point(); // Will be not scalar replaced 1100N/A // Do a simple control flow analysis to distinguish above cases. 1100N/A // It does not matter if it is not Allocation node since 1100N/A // only non-escaping allocations are scalar replaced. 1100N/A // Ignore non field load (for example, klass load) 1100N/A // Raw pointers are used for initializing stores so skip it. 1100N/A // Check for a store which follows allocation without branches. 1100N/A // For example, a volatile field store is not collected 1100N/A // by Initialize node. TODO: it would be nice to use idom() here. 1100N/A // A field's initializing value was not recorded. Add NULL. 1100N/A // An object is not scalar replaceable if the field which may point 1100N/A // to it has unknown offset (unknown element of an array of objects). 1100N/A // Currently an object is not scalar replaceable if a LoadStore node 1100N/A // access its field since the field value is unknown after it. 1100N/A // An object is not scalar replaceable if the address points 1100N/A // to unknown field (unknown element for arrays, offset is OffsetBot). 1100N/A // Or the address may point to more then one object. This may produce 1100N/A // the false positive result (set scalar_replaceable to false) 1100N/A // since the flow-insensitive escape analysis can't separate 1100N/A // the case when stores overwrite the field's value from the case 1100N/A // when stores happened on different control branches. 65N/A // Stub calls, objects do not escape but they are not scale replaceable. 65N/A // Adjust escape state for outgoing arguments. 65N/A // The inline_native_clone() case when the arraycopy stub is called 65N/A // after the allocation before Initialize and CheckCastPP nodes. 65N/A // Set AddP's base (Allocate) as not scalar replaceable since 65N/A // pointer to the base (with offset) is passed as argument. 0N/A // For a static call, we know exactly what method is being called. 0N/A // Use bytecode estimator to record the call's escape affects 65N/A // fall-through if not a Java method or no analyzer information 65N/A // The argument global escapes, mark everything it could point to 65N/A // The argument itself doesn't escape, but any fields might 65N/A //The argument global escapes, mark everything it could point to 65N/A // The argument itself doesn't escape, but any fields might 65N/A // Fall-through here if not a Java method or no analyzer information 65N/A // or some other type of call, assume the worst case: all arguments 0N/A // adjust escape state for outgoing arguments 1459N/A // Not scalar replaceable if the length is not constant or too big. 0N/A // For a static call, we know exactly what method is being called. 0N/A // Use bytecode estimator to record whether the call's return value escapes 0N/A // Note: we use isa_ptr() instead of isa_oopptr() here because the 0N/A // _multianewarray functions return a TypeRawPtr. 0N/A break;
// doesn't return a pointer type 0N/A // not a Java method, assume global escape 65N/A // Returns a newly allocated unescaped object, simply 65N/A // update dependency information. 65N/A // Mark it as NoEscape so that objects referenced by 65N/A // it's fields will be marked as NoEscape at least. 0N/A // determine whether any arguments are returned 307N/A // Returns unknown object. 0N/A // Some other type of call, assume the worst case that the 0N/A // returned value, if any, globally escapes. 0N/A // Note: we use isa_ptr() instead of isa_oopptr() here because the 0N/A // _multianewarray functions return a TypeRawPtr. 65N/A// Populate Connection Graph with Ideal nodes and create simple 65N/A// connection graph edges (do not need to check the node_type of inputs 65N/A// or to call PointsTo() to walk the connection graph). 65N/A return;
// No need to redefine node's state. 65N/A // Arguments to allocation and locking don't escape. 65N/A // Put Lock and Unlock nodes on IGVN worklist to process them during 65N/A // the first IGVN optimization when escape information is still available. 1100N/A // Don't mark as processed since call's arguments have to be processed. 65N/A // Check if a call returns an object. 1100N/A // Since the called mathod is statically unknown assume 1100N/A // the worst case that the returned value globally escapes. 65N/A // Using isa_ptr() instead of isa_oopptr() for LoadP and Phi because 65N/A // ThreadLocal has RawPrt type. 65N/A {
// "Unsafe" memory access. 65N/A // assume all pointer constants globally escape except for null 113N/A // assume all narrow oop constants globally escape except for null 124N/A // assume that all exception objects globally escape 65N/A // We have to assume all input parameters globally escape 65N/A // (Note: passing 'false' since _processed is already set). 253N/A // nothing to do if not an oop or narrow oop 65N/A continue;
// ignore NULL 65N/A continue;
// ignore top or inputs which go back this node 1100N/A // we are only interested in the oop result projection from a call 1100N/A // The call may not be registered yet (since not all its inputs are registered) 1100N/A // if this is the projection from backbranch edge of Phi. 1100N/A // The call's result may need to be processed later if the call 1100N/A // returns it's argument and the argument is not processed yet. 65N/A // Treat Return value as LocalVar with GlobalEscape escape state. 65N/A // We are computing a raw address for a store captured 65N/A // by an Initialize compute an appropriate address type. 1100N/A // char[] arrays passed to string intrinsics are not scalar replaceable. 65N/A // Don't set processed bit for AddP, LoadP, StoreP since 65N/A // they may need more then one pass to process. 1841N/A // Also don't mark as processed Call nodes since their 1841N/A // arguments may need more then one pass to process. 65N/A return;
// No need to redefine node's state. 65N/A // Create a field edge to this node from everything base could point to. 65N/A // For everything "adr_base" could point to, create a deferred edge from 65N/A // this node to each field with the same offset. 65N/A continue;
// ignore NULL 65N/A continue;
// ignore top or inputs which go back this node 1100N/A // we are only interested in the oop result projection from a call 1100N/A "all nodes should be registered");
65N/A // For everything "adr_base" could point to, create a deferred edge 65N/A // to "val" from each field with the same offset. 1100N/A // char[] arrays passed to string intrinsic do not escape but 1100N/A // they are not scalar replaceable. Adjust escape state for them. 1100N/A // Start from in(2) edge since in(1) is memory edge. 1100N/A // Mark as ArgEscape everything "adr" could point to. 1100N/A // This method should be called only for EA specific nodes. 65N/A // Print all locals which reference this allocation 65N/A // Print all fields which reference this allocation