src/hotspot/share/opto/escape.hpp

*** 370,10 ***
--- 370,12 ---
    void add_arraycopy(Node* n, PointsToNode::EscapeState es, PointsToNode* src, PointsToNode* dst);
  
    // Compute the escape state for arguments to a call.
    void process_call_arguments(CallNode *call);
  
+   bool returns_an_argument(CallNode* call);
+ 
    // Add PointsToNode node corresponding to a call
    void add_call_node(CallNode* call);
  
    // Create PointsToNode node and add it to Connection Graph.
    void add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist);

*** 483,10 ***
--- 485,12 ---
    void find_scalar_replaceable_allocs(GrowableArray<JavaObjectNode*>& jobj_worklist, Unique_Node_List &reducible_merges);
  
    // Optimize ideal graph.
    void optimize_ideal_graph(GrowableArray<Node*>& ptr_cmp_worklist,
                              GrowableArray<MemBarStoreStoreNode*>& storestore_worklist);
+   // Expand flat accesses to accesses to each component if the object does not escape
+   void optimize_flat_accesses(GrowableArray<SafePointNode*>& sfn_worklist);
    // Optimize objects compare.
    const TypeInt* optimize_ptr_compare(Node* left, Node* right);
  
    // Returns unique corresponding java object or null.
    JavaObjectNode* unique_java_object(Node *n) const;

*** 656,14 ***
--- 660,17 ---
  
    bool can_eliminate_lock(AbstractLockNode* alock);
  
    // To be used by, e.g., BarrierSetC2 impls
    Node* get_addp_base(Node* addp);
+   DEBUG_ONLY(static bool is_load_array_klass_related(const Node* uncast_base));
  
    // Utility function for nodes that load an object
    void add_objload_to_connection_graph(Node* n, Unique_Node_List* delayed_worklist);
  
+   void add_proj(Node* n, Unique_Node_List* delayed_worklist);
+ 
    // Add LocalVar node and edge if possible
    void add_local_var_and_edge(Node* n, PointsToNode::EscapeState es, Node* to,
                                Unique_Node_List *delayed_worklist) {
      PointsToNode* ptn = ptnode_adr(to->_idx);
      if (delayed_worklist != nullptr) { // First iteration of CG construction

*** 685,10 ***
--- 692,12 ---
    }
  
    void add_to_congraph_unsafe_access(Node* n, uint opcode, Unique_Node_List* delayed_worklist);
    bool add_final_edges_unsafe_access(Node* n, uint opcode);
  
+   bool compatible_return(CallJavaNode* call, uint k);
+ 
  #ifndef PRODUCT
    static int _no_escape_counter;
    static int _arg_escape_counter;
    static int _global_escape_counter;
    void dump(GrowableArray<PointsToNode*>& ptnodes_worklist);