Lines Matching refs:node
126 // only once per ideal node since ideal_nodes is Unique_Node list.
152 // escape status of the associated Allocate node some of them
313 return; // No need to redefine PointsTo node during first iteration.
479 // Verify a raw address for a store captured by Initialize node.
565 "node should be registered already");
590 continue; // ignore top or inputs which go back this node
592 assert(ptn != NULL, "node should be registered");
621 continue; // ignore top or inputs which go back this node
623 assert(ptn != NULL, "node should be registered");
663 assert(adr_type != NULL, "dead node should not be on list");
678 adr_ptn->as_Field()->is_oop(), "node should be registered");
681 assert(ptn != NULL, "node should be registered");
688 assert(ptn != NULL, "node should be registered");
692 assert(adr_ptn != NULL, "node should be registered");
718 assert(ptn != NULL, "node should be registered");
730 guarantee(false, "unknown node");
773 // - mapped to GlobalEscape JavaObject node if oop is returned;
781 // - mapped to GlobalEscape JavaObject node if unknown oop is returned;
782 // - mapped to NoEscape JavaObject node if non-escaping object allocated
784 // - mapped to ArgEscape LocalVar node pointed to object arguments
958 assert(call_ptn->is_LocalVar(), "node should be registered");
959 assert(arg_ptn != NULL, "node should be registered");
1118 // The object allocated by this Allocate node will never be
1208 // Add all references to JavaObject node by walking over all uses.
1239 // Added edge from Arraycopy node to arraycopy's source java object
1258 // Add edge from arraycopy's destination java object to Arraycopy node.
1327 // NULL object node does not have fields.
1413 // captured by Initialize node.
1500 // by Initialize node.
1557 // Non-escaping object node should point only to field nodes.
1567 // 4. Currently an object is not scalar replaceable if a LoadStore node
1735 // MemBarStoreStore node if the allocated object never escapes.
1884 // Add edge from arraycopy node to source object.
1887 // Add edge from destination object to arraycopy node.
1949 // If the node was created after the escape computation we can't answer.
1974 // Return true if this node points only to non-escaping allocations.
1999 // Return true if we know the node does not escape globally.
2002 // If the node was created after the escape computation we can't answer.
2027 // Return true if this node points to specified node or nodes it points to.
2040 // Return true if one node points to an other.
2110 // case #3. Raw object's field reference for Initialize node:
2246 // Do nothing for such AddP node and don't process its users since
2259 // record the allocation in the node map
2275 // AddP case #4 (adr is array's element offset AddP node)
2293 // phi was created. Cache the last newly created phi in the node map.
2445 // Replace previous general reference to mem node.
2588 assert(idx != alias_idx, "Object is not scalar replaceable if a LoadStore node access its field");
2634 // moving the first node encountered of each instance type to the
2640 // results and the allocation of node 29 is unescaped and eligible to be an
2661 // Phase 1 creates an instance type for node 29 assigning it an instance id of 24
2662 // and creating a new alias index for node 30. This gives:
2681 // node 80 are updated and then the memory nodes are updated with the
2713 // (Note: don't forget to change the order of the second AddP node on
2722 // copy escape information to call node
2731 if (n == NULL) { // No uses except Initialize node
2841 Node *base = get_map(jobj->idx()); // CheckCastPP node
2861 Node *val = get_map(jobj->idx()); // CheckCastPP node
2894 assert(false, "EA: unexpected node");
2921 assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist");
2927 assert(_mergemem_worklist.contains(m->as_MergeMem()), "EA: missing MergeMem node in the worklist");
2965 assert(n->is_Mem(), "memory node required.");
3011 assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist");
3029 // Walk each memory slice moving the first node encountered of each
3154 n->is_AddP() || n->is_Phi(), "unknown node used for set_map()");
3160 Node* old_mem = old_mems.node();