bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "precompiled.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "libadt/vectset.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "memory/allocation.inline.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/block.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/c2compiler.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/callnode.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/cfgnode.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/machnode.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/opcodes.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/phaseX.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/rootnode.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "opto/runtime.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#include "runtime/deoptimization.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TARGET_ARCH_MODEL_x86_32

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift# include "adfiles/ad_x86_32.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TARGET_ARCH_MODEL_x86_64

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift# include "adfiles/ad_x86_64.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TARGET_ARCH_MODEL_sparc

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift# include "adfiles/ad_sparc.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TARGET_ARCH_MODEL_zero

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift# include "adfiles/ad_zero.hpp"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift#ifdef TARGET_ARCH_MODEL_arm

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift# include "adfiles/ad_arm.hpp"

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift#endif

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift#ifdef TARGET_ARCH_MODEL_ppc

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift# include "adfiles/ad_ppc.hpp"

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift#endif

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift#define MIN_BLOCK_FREQUENCY 1.e-35f

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swiftvoid PhaseCFG::schedule_node_into_block( Node *n, Block *b ) {

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift // Set basic block of n, Add n to b,

2e334e4f58d7760ed0788f5db5524d87934d6869matthew_swift _bbs.map(n->_idx, b);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift b->add_inst(n);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // After Matching, nearly any old Node may have projections trailing it.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // These are usually machine-dependent flags. In any case, they might

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // float to another block below this one. Move them up.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* use = n->fast_out(i);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (use->is_Proj()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* buse = _bbs[use->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (buse != b) { // In wrong block?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (buse != NULL)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift buse->find_remove(use); // Remove from wrong block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _bbs.map(use->_idx, b); // Re-insert in this block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift b->add_inst(use);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftvoid PhaseCFG::replace_block_proj_ctrl( Node *n ) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const Node *in0 = n->in(0);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(in0 != NULL, "Only control-dependent");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const Node *p = in0->is_block_proj();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (p != NULL && p != n) { // Control from a block projection?

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift assert(!n->pinned() || n->is_MachConstantBase(), "only pinned MachConstantBase node is expected here");

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift // Find trailing Region

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift Block *pb = _bbs[in0->_idx]; // Block-projection already has basic block

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift uint j = 0;

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift if (pb->_num_succs != 1) { // More then 1 successor?

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift // Search for successor

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift uint max = pb->_nodes.size();

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift assert( max > 1, "" );

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift uint start = max - pb->_num_succs;

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift // Find which output path belongs to projection

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift for (j = start; j < max; j++) {

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift if( pb->_nodes[j] == in0 )

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift break;

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift }

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift assert( j < max, "must find" );

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift // Change control to match head of successor basic block

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift j -= start;

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift }

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift n->set_req(0, pb->_succs[j]->head());

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift }

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift}

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift

408b8eb145348cb8f251a8abfec96e7e4e80f630matthew_swift

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swiftvoid PhaseCFG::schedule_pinned_nodes( VectorSet &visited ) {

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift // Allocate node stack of size C->unique()+8 to avoid frequent realloc

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift GrowableArray <Node *> spstack(C->unique()+8);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift spstack.push(_root);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift while ( spstack.is_nonempty() ) {

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Node *n = spstack.pop();

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if( n->pinned() && !_bbs.lookup(n->_idx) ) { // Pinned? Nail it down!

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift assert( n->in(0), "pinned Node must have Control" );

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift // Before setting block replace block_proj control edge

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift replace_block_proj_ctrl(n);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Node *input = n->in(0);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift while( !input->is_block_start() )

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift input = input->in(0);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Block *b = _bbs[input->_idx]; // Basic block of controlling input

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift schedule_node_into_block(n, b);

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift }

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift for( int i = n->req() - 1; i >= 0; --i ) { // For all inputs

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if( n->in(i) != NULL )

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift spstack.push(n->in(i));

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift }

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift }

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift }

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift}

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift#ifdef ASSERT

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swiftstatic void assert_dom(Block* b1, Block* b2, Node* n, Block_Array &bbs) {

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if (b1 == NULL) return;

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift assert(b1->_dom_depth < b2->_dom_depth, "sanity");

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Block* tmp = b2;

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift while (tmp != b1 && tmp != NULL) {

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift tmp = tmp->_idom;

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift }

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if (tmp != b1) {

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift // Detected an unschedulable graph. Print some nice stuff and die.

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift tty->print_cr("!!! Unschedulable graph !!!");

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift for (uint j=0; j<n->len(); j++) { // For all inputs

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Node* inn = n->in(j); // Get input

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift if (inn == NULL) continue; // Ignore NULL, missing inputs

0c45338572f2f6593fea8fc9e70bcb9ef3a6d2f8matthew_swift Block* inb = bbs[inn->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("B%d idom=B%d depth=%2d ",inb->_pre_order,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift inb->_idom ? inb->_idom->_pre_order : 0, inb->_dom_depth);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift inn->dump();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("Failing node: ");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift n->dump();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(false, "unscheduable graph");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftstatic Block* find_deepest_input(Node* n, Block_Array &bbs) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Find the last input dominated by all other inputs.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* deepb = NULL; // Deepest block so far

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int deepb_dom_depth = 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (uint k = 0; k < n->len(); k++) { // For all inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* inn = n->in(k); // Get input

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (inn == NULL) continue; // Ignore NULL, missing inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* inb = bbs[inn->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(inb != NULL, "must already have scheduled this input");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (deepb_dom_depth < (int) inb->_dom_depth) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // The new inb must be dominated by the previous deepb.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // The various inputs must be linearly ordered in the dom

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // tree, or else there will not be a unique deepest block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift DEBUG_ONLY(assert_dom(deepb, inb, n, bbs));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift deepb = inb; // Save deepest block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift deepb_dom_depth = deepb->_dom_depth;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(deepb != NULL, "must be at least one input to n");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return deepb;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftbool PhaseCFG::schedule_early(VectorSet &visited, Node_List &roots) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Allocate stack with enough space to avoid frequent realloc

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node_Stack nstack(roots.Size() + 8); // (unique >> 1) + 24 from Java2D stats

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // roots.push(_root); _root will be processed among C->top() inputs

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift roots.push(C->top());

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift visited.set(C->top()->_idx);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift while (roots.size() != 0) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Use local variables nstack_top_n & nstack_top_i to cache values

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // on stack's top.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node *nstack_top_n = roots.pop();

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift uint nstack_top_i = 0;

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift while (true) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Get parent node and next input's index from stack's top.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node *n = nstack_top_n;

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift uint i = nstack_top_i;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (i == 0) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Fixup some control. Constants without control get attached

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to root and nodes that use is_block_proj() nodes should be attached

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to the region that starts their block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const Node *in0 = n->in(0);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (in0 != NULL) { // Control-dependent?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift replace_block_proj_ctrl(n);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else { // n->in(0) == NULL

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (n->req() == 1) { // This guy is a constant with NO inputs?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift n->set_req(0, _root);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // First, visit all inputs and force them to get a block. If an

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // input is already in a block we quit following inputs (to avoid

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // cycles). Instead we put that Node on a worklist to be handled

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // later (since IT'S inputs may not have a block yet).

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift bool done = true; // Assume all n's inputs will be processed

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (i < n->len()) { // For all inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node *in = n->in(i); // Get input

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift ++i;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (in == NULL) continue; // Ignore NULL, missing inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int is_visited = visited.test_set(in->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!_bbs.lookup(in->_idx)) { // Missing block selection?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (is_visited) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // assert( !visited.test(in->_idx), "did not schedule early" );

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return false;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack.push(n, i); // Save parent node and next input's index.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack_top_n = in; // Process current input now.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack_top_i = 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift done = false; // Not all n's inputs processed.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break; // continue while_nstack_nonempty;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else if (!is_visited) { // Input not yet visited?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift roots.push(in); // Visit this guy later, using worklist

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (done) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // All of n's inputs have been processed, complete post-processing.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Some instructions are pinned into a block. These include Region,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Phi, Start, Return, and other control-dependent instructions and

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // any projections which depend on them.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!n->pinned()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Set earliest legal block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _bbs.map(n->_idx, find_deepest_input(n, _bbs));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(_bbs[n->_idx] == _bbs[n->in(0)->_idx], "Pinned Node should be at the same block as its control edge");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (nstack.is_empty()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Finished all nodes on stack.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Process next node on the worklist 'roots'.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Get saved parent node and next input's index.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack_top_n = nstack.node();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack_top_i = nstack.index();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nstack.pop();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } // if (done)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } // while (true)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } // while (roots.size() != 0)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return true;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftBlock* Block::dom_lca(Block* LCA) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == NULL || LCA == this) return this;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* anc = this;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (anc->_dom_depth > LCA->_dom_depth)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift anc = anc->_idom; // Walk up till anc is as high as LCA

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (LCA->_dom_depth > anc->_dom_depth)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = LCA->_idom; // Walk up till LCA is as high as anc

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (LCA != anc) { // Walk both up till they are the same

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = LCA->_idom;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift anc = anc->_idom;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftstatic Block* raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* buse = bbs[use->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (buse == NULL) return LCA; // Unused killing Projs have no use block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!use->is_Phi()) return buse->dom_lca(LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint pmax = use->req(); // Number of Phi inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Why does not this loop just break after finding the matching input to

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // the Phi? Well...it's like this. I do not have true def-use/use-def

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // chains. Means I cannot distinguish, from the def-use direction, which

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // of many use-defs lead from the same use to the same def. That is, this

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Phi might have several uses of the same def. Each use appears in a

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // different predecessor block. But when I enter here, I cannot distinguish

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // which use-def edge I should find the predecessor block for. So I find

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // them all. Means I do a little extra work if a Phi uses the same value

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // more than once.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (uint j=1; j<pmax; j++) { // For all inputs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (use->in(j) == def) { // Found matching input?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* pred = bbs[buse->pred(j)->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = pred->dom_lca(LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftstatic Block* raise_LCA_above_marks(Block* LCA, node_idx_t mark,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* early, Block_Array &bbs) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block_List worklist;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift worklist.push(LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (worklist.size() > 0) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* mid = worklist.pop();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mid == early) continue; // stop searching here

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Test and set the visited bit.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mid->raise_LCA_visited() == mark) continue; // already visited

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Don't process the current LCA, otherwise the search may terminate early

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mid != LCA && mid->raise_LCA_mark() == mark) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Raise the LCA.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = mid->dom_lca(LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == early) break; // stop searching everywhere

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(early->dominates(LCA), "early is high enough");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Resume searching at that point, skipping intermediate levels.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift worklist.push(LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == mid)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue; // Don't mark as visited to avoid early termination.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Keep searching through this block's predecessors.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (uint j = 1, jmax = mid->num_preds(); j < jmax; j++) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* mid_parent = bbs[ mid->pred(j)->_idx ];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift worklist.push(mid_parent);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift mid->set_raise_LCA_visited(mark);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftstatic Block* memory_early_block(Node* load, Block* early, Block_Array &bbs) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* base;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* index;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* store = load->in(MemNode::Memory);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift load->as_Mach()->memory_inputs(base, index);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(base != NodeSentinel && index != NodeSentinel,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift "unexpected base/index inputs");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node* mem_inputs[4];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int mem_inputs_length = 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (base != NULL) mem_inputs[mem_inputs_length++] = base;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (index != NULL) mem_inputs[mem_inputs_length++] = index;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (store != NULL) mem_inputs[mem_inputs_length++] = store;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // In the comparision below, add one to account for the control input,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // which may be null, but always takes up a spot in the in array.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mem_inputs_length + 1 < (int) load->req()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // This "load" has more inputs than just the memory, base and index inputs.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // For purposes of checking anti-dependences, we need to start

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // from the early block of only the address portion of the instruction,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // and ignore other blocks that may have factored into the wider

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // schedule_early calculation.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (load->in(0) != NULL) mem_inputs[mem_inputs_length++] = load->in(0);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* deepb = NULL; // Deepest block so far

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int deepb_dom_depth = 0;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift for (int i = 0; i < mem_inputs_length; i++) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift Block* inb = bbs[mem_inputs[i]->_idx];

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift if (deepb_dom_depth < (int) inb->_dom_depth) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // The new inb must be dominated by the previous deepb.

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // The various inputs must be linearly ordered in the dom

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // tree, or else there will not be a unique deepest block.

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift DEBUG_ONLY(assert_dom(deepb, inb, load, bbs));

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift deepb = inb; // Save deepest block

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift deepb_dom_depth = deepb->_dom_depth;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift early = deepb;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift return early;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift}

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftBlock* PhaseCFG::insert_anti_dependences(Block* LCA, Node* load, bool verify) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(load->needs_anti_dependence_check(), "must be a load of some sort");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(LCA != NULL, "");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift DEBUG_ONLY(Block* LCA_orig = LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Compute the alias index. Loads and stores with different alias indices

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // do not need anti-dependence edges.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint load_alias_idx = C->get_alias_index(load->adr_type());

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef ASSERT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (load_alias_idx == Compile::AliasIdxBot && C->AliasLevel() > 0 &&

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift (PrintOpto || VerifyAliases ||

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift PrintMiscellaneous && (WizardMode || Verbose))) {

ce307551b126a6b551358fb063614b80b9355907matthew_swift // Load nodes should not consume all of memory.

ce307551b126a6b551358fb063614b80b9355907matthew_swift // Reporting a bottom type indicates a bug in adlc.

ce307551b126a6b551358fb063614b80b9355907matthew_swift // If some particular type of node validly consumes all of memory,

ce307551b126a6b551358fb063614b80b9355907matthew_swift // sharpen the preceding "if" to exclude it, so we can catch bugs here.

ce307551b126a6b551358fb063614b80b9355907matthew_swift tty->print_cr("*** Possible Anti-Dependence Bug: Load consumes all of memory.");

ce307551b126a6b551358fb063614b80b9355907matthew_swift load->dump(2);

ce307551b126a6b551358fb063614b80b9355907matthew_swift if (VerifyAliases) assert(load_alias_idx != Compile::AliasIdxBot, "");

ce307551b126a6b551358fb063614b80b9355907matthew_swift }

ce307551b126a6b551358fb063614b80b9355907matthew_swift#endif

ce307551b126a6b551358fb063614b80b9355907matthew_swift assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrComp),

ce307551b126a6b551358fb063614b80b9355907matthew_swift "String compare is only known 'load' that does not conflict with any stores");

ce307551b126a6b551358fb063614b80b9355907matthew_swift assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrEquals),

ce307551b126a6b551358fb063614b80b9355907matthew_swift "String equals is a 'load' that does not conflict with any stores");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrIndexOf),

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift "String indexOf is a 'load' that does not conflict with any stores");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_AryEq),

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift "Arrays equals is a 'load' that do not conflict with any stores");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!C->alias_type(load_alias_idx)->is_rewritable()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // It is impossible to spoil this load by putting stores before it,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // because we know that the stores will never update the value

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // which 'load' must witness.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift node_idx_t load_index = load->_idx;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Note the earliest legal placement of 'load', as determined by

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // by the unique point in the dom tree where all memory effects

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // and other inputs are first available. (Computed by schedule_early.)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // For normal loads, 'early' is the shallowest place (dom graph wise)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to look for anti-deps between this load and any store.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* early = _bbs[load_index];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If we are subsuming loads, compute an "early" block that only considers

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // memory or address inputs. This block may be different than the

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // schedule_early block in that it could be at an even shallower depth in the

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // dominator tree, and allow for a broader discovery of anti-dependences.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (C->subsume_loads()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift early = memory_early_block(load, early, _bbs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift ResourceArea *area = Thread::current()->resource_area();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_List worklist_mem(area); // prior memory state to store

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_List worklist_store(area); // possible-def to explore

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_List worklist_visited(area); // visited mergemem nodes

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_List non_early_stores(area); // all relevant stores outside of early

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift bool must_raise_LCA = false;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TRACK_PHI_INPUTS

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // %%% This extra checking fails because MergeMem nodes are not GVNed.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Provide "phi_inputs" to check if every input to a PhiNode is from the

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // original memory state. This indicates a PhiNode for which should not

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // prevent the load from sinking. For such a block, set_raise_LCA_mark

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // may be overly conservative.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Mechanism: count inputs seen for each Phi encountered in worklist_store.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift DEBUG_ONLY(GrowableArray<uint> phi_inputs(area, C->unique(),0,0));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // 'load' uses some memory state; look for users of the same state.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Recurse through MergeMem nodes to the stores that use them.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Each of these stores is a possible definition of memory

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // that 'load' needs to use. We need to force 'load'

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to occur before each such store. When the store is in

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // the same block as 'load', we insert an anti-dependence

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // edge load->store.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // The relevant stores "nearby" the load consist of a tree rooted

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // at initial_mem, with internal nodes of type MergeMem.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Therefore, the branches visited by the worklist are of this form:

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // initial_mem -> (MergeMem ->)* store

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // The anti-dependence constraints apply only to the fringe of this tree.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node* initial_mem = load->in(MemNode::Memory);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_store.push(initial_mem);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_visited.push(initial_mem);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_mem.push(NULL);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift while (worklist_store.size() > 0) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Examine a nearby store to see if it might interfere with our load.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node* mem = worklist_mem.pop();

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift Node* store = worklist_store.pop();

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift uint op = store->Opcode();

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // MergeMems do not directly have anti-deps.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Treat them as internal nodes in a forward tree of memory states,

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // the leaves of which are each a 'possible-def'.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (store == initial_mem // root (exclusive) of tree we are searching

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift || op == Op_MergeMem // internal node of tree we are searching

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift ) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift mem = store; // It's not a possibly interfering store.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (store == initial_mem)

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift initial_mem = NULL; // only process initial memory once

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift for (DUIterator_Fast imax, i = mem->fast_outs(imax); i < imax; i++) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift store = mem->fast_out(i);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (store->is_MergeMem()) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Be sure we don't get into combinatorial problems.

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // (Allow phis to be repeated; they can merge two relevant states.)

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift uint j = worklist_visited.size();

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift for (; j > 0; j--) {

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (worklist_visited.at(j-1) == store) break;

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift }

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (j > 0) continue; // already on work list; do not repeat

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_visited.push(store);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift }

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_mem.push(mem);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift worklist_store.push(store);

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift }

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift continue;

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift }

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (op == Op_MachProj || op == Op_Catch) continue;

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift if (store->needs_anti_dependence_check()) continue; // not really a store

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // Compute the alias index. Loads and stores with different alias

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // indices do not need anti-dependence edges. Wide MemBar's are

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift // anti-dependent on everything (except immutable memories).

91940c5122d22be4fd20bc41db2ffc4a9ba4ce59matthew_swift const TypePtr* adr_type = store->adr_type();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!C->can_alias(adr_type, load_alias_idx)) continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // Most slow-path runtime calls do NOT modify Java memory, but

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // they can block and so write Raw memory.

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift if (store->is_Mach()) {

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift MachNode* mstore = store->as_Mach();

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift if (load_alias_idx != Compile::AliasIdxRaw) {

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // Check for call into the runtime using the Java calling

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // convention (and from there into a wrapper); it has no

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // _method. Can't do this optimization for Native calls because

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift // they CAN write to Java memory.

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift if (mstore->ideal_Opcode() == Op_CallStaticJava) {

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift assert(mstore->is_MachSafePoint(), "");

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift MachSafePointNode* ms = (MachSafePointNode*) mstore;

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift assert(ms->is_MachCallJava(), "");

188a85993cf1cf9925338176e5f27b95a5891c50matthew_swift MachCallJavaNode* mcj = (MachCallJavaNode*) ms;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mcj->_method == NULL) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // These runtime calls do not write to Java visible memory

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // (other than Raw) and so do not require anti-dependence edges.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift continue;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Same for SafePoints: they read/write Raw but only read otherwise.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // This is basically a workaround for SafePoints only defining control

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // instead of control + memory.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (mstore->ideal_Opcode() == Op_SafePoint)

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift continue;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift } else {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Some raw memory, such as the load of "top" at an allocation,

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // can be control dependent on the previous safepoint. See

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // comments in GraphKit::allocate_heap() about control input.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Inserting an anti-dep between such a safepoint and a use

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // creates a cycle, and will cause a subsequent failure in

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // local scheduling. (BugId 4919904)

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // (%%% How can a control input be a safepoint and not a projection??)

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (mstore->ideal_Opcode() == Op_SafePoint && load->in(0) == mstore)

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift continue;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Identify a block that the current load must be above,

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // or else observe that 'store' is all the way up in the

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // earliest legal block for 'load'. In the latter case,

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // immediately insert an anti-dependence edge.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Block* store_block = _bbs[store->_idx];

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift assert(store_block != NULL, "unused killing projections skipped above");

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (store->is_Phi()) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // 'load' uses memory which is one (or more) of the Phi's inputs.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // It must be scheduled not before the Phi, but rather before

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // each of the relevant Phi inputs.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift //

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Instead of finding the LCA of all inputs to a Phi that match 'mem',

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // we mark each corresponding predecessor block and do a combined

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // hoisting operation later (raise_LCA_above_marks).

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift //

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Do not assert(store_block != early, "Phi merging memory after access")

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // PhiNode may be at start of block 'early' with backedge to 'early'

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift DEBUG_ONLY(bool found_match = false);

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift for (uint j = PhiNode::Input, jmax = store->req(); j < jmax; j++) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (store->in(j) == mem) { // Found matching input?

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift DEBUG_ONLY(found_match = true);

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Block* pred_block = _bbs[store_block->pred(j)->_idx];

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (pred_block != early) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // If any predecessor of the Phi matches the load's "early block",

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // we do not need a precedence edge between the Phi and 'load'

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // since the load will be forced into a block preceding the Phi.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift pred_block->set_raise_LCA_mark(load_index);

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift assert(!LCA_orig->dominates(pred_block) ||

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift early->dominates(pred_block), "early is high enough");

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift must_raise_LCA = true;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift } else {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // anti-dependent upon PHI pinned below 'early', no edge needed

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift LCA = early; // but can not schedule below 'early'

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(found_match, "no worklist bug");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef TRACK_PHI_INPUTS

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef ASSERT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // This assert asks about correct handling of PhiNodes, which may not

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // have all input edges directly from 'mem'. See BugId 4621264

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int num_mem_inputs = phi_inputs.at_grow(store->_idx,0) + 1;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Increment by exactly one even if there are multiple copies of 'mem'

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // coming into the phi, because we will run this block several times

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // if there are several copies of 'mem'. (That's how DU iterators work.)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift phi_inputs.at_put(store->_idx, num_mem_inputs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(PhiNode::Input + num_mem_inputs < store->req(),

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift "Expect at least one phi input will not be from original memory state");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif //ASSERT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif //TRACK_PHI_INPUTS

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else if (store_block != early) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // 'store' is between the current LCA and earliest possible block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Label its block, and decide later on how to raise the LCA

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to include the effect on LCA of this store.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If this store's block gets chosen as the raised LCA, we

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // will find him on the non_early_stores list and stick him

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // with a precedence edge.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // (But, don't bother if LCA is already raised all the way.)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA != early) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift store_block->set_raise_LCA_mark(load_index);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift must_raise_LCA = true;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift non_early_stores.push(store);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Found a possibly-interfering store in the load's 'early' block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // This means 'load' cannot sink at all in the dominator tree.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Add an anti-dep edge, and squeeze 'load' into the highest block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(store != load->in(0), "dependence cycle found");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (verify) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(store->find_edge(load) != -1, "missing precedence edge");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift store->add_prec(load);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = early;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // This turns off the process of gathering non_early_stores.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // (Worklist is now empty; all nearby stores have been visited.)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Finished if 'load' must be scheduled in its 'early' block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If we found any stores there, they have already been given

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // precedence edges.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == early) return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // We get here only if there are no possibly-interfering stores

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // in the load's 'early' block. Move LCA up above all predecessors

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // which contain stores we have noted.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift //

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // The raised LCA block can be a home to such interfering stores,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // but its predecessors must not contain any such stores.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift //

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // The raised LCA will be a lower bound for placing the load,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // preventing the load from sinking past any block containing

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // a store that may invalidate the memory state required by 'load'.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (must_raise_LCA)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = raise_LCA_above_marks(LCA, load->_idx, early, _bbs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == early) return LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Insert anti-dependence edges from 'load' to each store

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // in the non-early LCA block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Mine the non_early_stores list for such stores.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (LCA->raise_LCA_mark() == load_index) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift while (non_early_stores.size() > 0) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Node* store = non_early_stores.pop();

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Block* store_block = _bbs[store->_idx];

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (store_block == LCA) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // add anti_dependence from store to load in its own block

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift assert(store != load->in(0), "dependence cycle found");

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if (verify) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift assert(store->find_edge(load) != -1, "missing precedence edge");

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift } else {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift store->add_prec(load);

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift } else {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift assert(store_block->raise_LCA_mark() == load_index, "block was marked");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Any other stores we found must be either inside the new LCA

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // or else outside the original LCA. In the latter case, they

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // did not interfere with any use of 'load'.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(LCA->dominates(store_block)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift || !LCA_orig->dominates(store_block), "no stray stores");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Return the highest block containing stores; any stores

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // within that block have been given anti-dependence edges.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift return LCA;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift}

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swiftclass Node_Backward_Iterator {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swiftprivate:

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Node_Backward_Iterator();

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swiftpublic:

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Constructor for the iterator

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_Backward_Iterator(Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Postincrement operator to iterate over the nodes

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node *next();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftprivate:

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift VectorSet &_visited;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_List &_stack;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Block_Array &_bbs;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift};

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swiftNode_Backward_Iterator::Node_Backward_Iterator( Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs )

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift : _visited(visited), _stack(stack), _bbs(bbs) {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // The stack should contain exactly the root

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift stack.clear();

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift stack.push(root);

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Clear the visited bits

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift visited.Clear();

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift}

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swiftNode *Node_Backward_Iterator::next() {

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // If the _stack is empty, then just return NULL: finished.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift if ( !_stack.size() )

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift return NULL;

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // '_stack' is emulating a real _stack. The 'visit-all-users' loop has been

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // made stateless, so I do not need to record the index 'i' on my _stack.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // Instead I visit all users each time, scanning for unvisited users.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // I visit unvisited not-anti-dependence users first, then anti-dependent

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // children next.

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift Node *self = _stack.pop();

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift

7edb1a6332a5678c67bfa236b629d47cab1525c1matthew_swift // I cycle here when I am entering a deeper level of recursion.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // The key variable 'self' was set prior to jumping here.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while( 1 ) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _visited.set(self->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Now schedule all uses as late as possible.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint src = self->is_Proj() ? self->in(0)->_idx : self->_idx;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint src_rpo = _bbs[src]->_rpo;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Schedule all nodes in a post-order visit

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift Node *unvisited = NULL; // Unvisited anti-dependent Node, if any

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift // Scan for unvisited nodes

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift for (DUIterator_Fast imax, i = self->fast_outs(imax); i < imax; i++) {

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift // For all uses, schedule late

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift Node* n = self->fast_out(i); // Use

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift // Skip already visited children

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift if ( _visited.test(n->_idx) )

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift continue;

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift // do not traverse backward control edges

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift Node *use = n->is_Proj() ? n->in(0) : n;

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift uint use_rpo = _bbs[use->_idx]->_rpo;

c9020c301eada7085bb81da1821cac5533a1f20fmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if ( use_rpo < src_rpo )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Phi nodes always precede uses in a basic block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if ( use_rpo == src_rpo && use->is_Phi() )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift unvisited = n; // Found unvisited

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Check for possible-anti-dependent

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if( !n->needs_anti_dependence_check() )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break; // Not visited, not anti-dep; schedule it NOW

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Did I find an unvisited not-anti-dependent Node?

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if ( !unvisited )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break; // All done with children; post-visit 'self'

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Visit the unvisited Node. Contains the obvious push to

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // indicate I'm entering a deeper level of recursion. I push the

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // old state onto the _stack and set a new state and loop (recurse).

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _stack.push(self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift self = unvisited;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } // End recursion loop

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return self;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftvoid PhaseCFG::ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining())

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("\n#---- ComputeLatenciesBackwards ----\n");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node *n;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Walk over all the nodes from last to first

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (n = iter.next()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Set the latency for the definitions of this instruction

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift partial_latency_of_defs(n);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift} // end ComputeLatenciesBackwards

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftvoid PhaseCFG::partial_latency_of_defs(Node *n) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Set the latency for this instruction

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift tty->print("# latency_to_inputs: node_latency[%d] = %d for node",

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift n->_idx, _node_latency->at_grow(n->_idx));

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift dump();

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift }

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift#endif

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift if (n->is_Proj())

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift n = n->in(0);

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift

9355c1819517672f3cfe09356402fe0257c96facmatthew_swift if (n->is_Root())

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift return;

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift uint nlen = n->len();

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift uint use_latency = _node_latency->at_grow(n->_idx);

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift uint use_pre_order = _bbs[n->_idx]->_pre_order;

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift for ( uint j=0; j<nlen; j++ ) {

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift Node *def = n->in(j);

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift if (!def || def == n)

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift continue;

cd827d0bd7c904782575c994f30982ffe6e696d5matthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Walk backwards thru projections

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (def->is_Proj())

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift def = def->in(0);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("# in(%2d): ", j);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift def->dump();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If the defining block is not known, assume it is ok

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block *def_block = _bbs[def->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint def_pre_order = def_block ? def_block->_pre_order : 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if ( (use_pre_order < def_pre_order) ||

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift (use_pre_order == def_pre_order && n->is_Phi()) )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint delta_latency = n->latency(j);

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint current_latency = delta_latency + use_latency;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (_node_latency->at_grow(def->_idx) < current_latency) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _node_latency->at_put_grow(def->_idx, current_latency);

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift#ifndef PRODUCT

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (trace_opto_pipelining()) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift tty->print_cr("# %d + edge_latency(%d) == %d -> %d, node_latency[%d] = %d",

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift use_latency, j, delta_latency, current_latency, def->_idx,

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift _node_latency->at_grow(def->_idx));

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift#endif

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift}

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swiftint PhaseCFG::latency_from_use(Node *n, const Node *def, Node *use) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift // If self-reference, return no latency

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (use == n || use->is_Root())

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift return 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint def_pre_order = _bbs[def->_idx]->_pre_order;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint latency = 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If the use is not a projection, then it is simple...

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!use->is_Proj()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift tty->print("# out(): ");

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift use->dump();

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift#endif

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint use_pre_order = _bbs[use->_idx]->_pre_order;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (use_pre_order < def_pre_order)

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift return 0;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (use_pre_order == def_pre_order && use->is_Phi())

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift return 0;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint nlen = use->len();

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint nl = _node_latency->at_grow(use->_idx);

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift for ( uint j=0; j<nlen; j++ ) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (use->in(j) == n) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift // Change this if we want local latencies

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint ul = use->latency(j);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint l = ul + nl;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (latency < l) latency = l;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print_cr("# %d + edge_latency(%d) == %d -> %d, latency = %d",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift nl, j, ul, l, latency);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift } else {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift // This is a projection, just grab the latency of the use(s)

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift for (DUIterator_Fast jmax, j = use->fast_outs(jmax); j < jmax; j++) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift uint l = latency_from_use(use, def, use->fast_out(j));

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (latency < l) latency = l;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift }

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift return latency;

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift}

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swiftvoid PhaseCFG::latency_from_uses(Node *n) {

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift // Set the latency for this instruction

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift#ifndef PRODUCT

3cbc49fe5e6d8a00a69fe1859874ed5dcff85aebmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("# latency_from_outputs: node_latency[%d] = %d for node",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift n->_idx, _node_latency->at_grow(n->_idx));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift dump();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint latency=0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const Node *def = n->is_Proj() ? n->in(0): n;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint l = latency_from_use(n, def, n->fast_out(i));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (latency < l) latency = l;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _node_latency->at_put_grow(n->_idx, latency);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftBlock* PhaseCFG::hoist_to_cheaper_block(Block* LCA, Block* early, Node* self) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const double delta = 1+PROB_UNLIKELY_MAG(4);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* least = LCA;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift double least_freq = least->_freq;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint target = _node_latency->at_grow(self->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint start_latency = _node_latency->at_grow(LCA->_nodes[0]->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint end_latency = _node_latency->at_grow(LCA->_nodes[LCA->end_idx()]->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift bool in_latency = (target <= start_latency);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift const Block* root_block = _bbs[_root->_idx];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Turn off latency scheduling if scheduling is just plain off

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (!C->do_scheduling())

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift in_latency = true;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Do not hoist (to cover latency) instructions which target a

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // single register. Hoisting stretches the live range of the

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // single register and may force spilling.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mach && mach->out_RegMask().is_bound1() && mach->out_RegMask().is_NotEmpty())

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift in_latency = true;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("# Find cheaper block for latency %d: ",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _node_latency->at_grow(self->_idx));

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift self->dump();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print_cr("# B%d: start latency for [%4d]=%d, end latency for [%4d]=%d, freq=%g",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA->_pre_order,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA->_nodes[0]->_idx,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift start_latency,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA->_nodes[LCA->end_idx()]->_idx,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift end_latency,

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift least_freq);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Walk up the dominator tree from LCA (Lowest common ancestor) to

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // the earliest legal location. Capture the least execution frequency.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (LCA != early) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = LCA->_idom; // Follow up the dominator tree

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA == NULL) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Bailout without retry

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift C->record_method_not_compilable("late schedule failed: LCA == NULL");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return least;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Don't hoist machine instructions to the root basic block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mach && LCA == root_block)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint start_lat = _node_latency->at_grow(LCA->_nodes[0]->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint end_idx = LCA->end_idx();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift uint end_lat = _node_latency->at_grow(LCA->_nodes[end_idx]->_idx);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift double LCA_freq = LCA->_freq;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print_cr("# B%d: start latency for [%4d]=%d, end latency for [%4d]=%d, freq=%g",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA->_pre_order, LCA->_nodes[0]->_idx, start_lat, end_idx, end_lat, LCA_freq);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (LCA_freq < least_freq || // Better Frequency

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift ( !in_latency && // No block containing latency

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA_freq < least_freq * delta && // No worse frequency

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift target >= end_lat && // within latency range

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift !self->is_iteratively_computed() ) // But don't hoist IV increments

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // because they may end up above other uses of their phi forcing

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // their result register to be different from their input.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift ) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift least = LCA; // Found cheaper block

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift least_freq = LCA_freq;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift start_latency = start_lat;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift end_latency = end_lat;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (target <= start_lat)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift in_latency = true;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print_cr("# Choose block B%d with start latency=%d and freq=%g",

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift least->_pre_order, start_latency, least_freq);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // See if the latency needs to be updated

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (target < end_latency) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print_cr("# Change latency for [%4d] from %d to %d", self->_idx, target, end_latency);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _node_latency->at_put_grow(self->_idx, end_latency);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift partial_latency_of_defs(self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return least;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift}

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftextern const char must_clone[];

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swiftvoid PhaseCFG::schedule_late(VectorSet &visited, Node_List &stack) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining())

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("\n#---- schedule_late ----\n");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node *self;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Walk over all the nodes from last to first

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift while (self = iter.next()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Block* early = _bbs[self->_idx]; // Earliest legal placement

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (self->is_top()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Top node goes in bb #2 with other constants.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // It must be special-cased, because it has no out edges.

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift early->add_inst(self);

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift continue;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // No uses, just terminate

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift if (self->outcnt() == 0) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift assert(self->is_MachProj(), "sanity");

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift continue; // Must be a dead machine projection

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // If node is pinned in the block, then no scheduling can be done.

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift if( self->pinned() ) // Pinned in block?

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift continue;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift if (mach) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift switch (mach->ideal_Opcode()) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift case Op_CreateEx:

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // Don't move exception creation

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift early->add_inst(self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift case Op_CheckCastPP:

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Don't move CheckCastPP nodes away from their input, if the input

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // is a rawptr (5071820).

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift Node *def = self->in(1);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (def != NULL && def->bottom_type()->base() == Type::RawPtr) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift early->add_inst(self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifdef ASSERT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _raw_oops.push(def);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift break;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Gather LCA of all uses

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift Block *LCA = NULL;

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift for (DUIterator_Fast imax, i = self->fast_outs(imax); i < imax; i++) {

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift // For all uses, find LCA

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift Node* use = self->fast_out(i);

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift LCA = raise_LCA_above_use(LCA, use, self, _bbs);

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift }

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift } // (Hide defs of imax, i from rest of block.)

e32b0f1464ea290b749a43d5ee7a6085b14532c9matthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Place temps in the block of their use. This isn't a

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // requirement for correctness but it reduces useless

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // interference between temps and other nodes.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (mach != NULL && mach->is_MachTemp()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift _bbs.map(self->_idx, LCA);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA->add_inst(self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift continue;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Check if 'self' could be anti-dependent on memory

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (self->needs_anti_dependence_check()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Hoist LCA above possible-defs and insert anti-dependences to

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // defs in new LCA block.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift LCA = insert_anti_dependences(LCA, self);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (early->_dom_depth > LCA->_dom_depth) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Somehow the LCA has moved above the earliest legal point.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // (One way this can happen is via memory_early_block.)

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (C->subsume_loads() == true && !C->failing()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Retry with subsume_loads == false

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // If this is the first failure, the sentinel string will "stick"

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // to the Compile object, and the C2Compiler will see it and retry.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift C->record_failure(C2Compiler::retry_no_subsuming_loads());

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift } else {

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Bailout without retry when (early->_dom_depth > LCA->_dom_depth)

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift C->record_method_not_compilable("late schedule failed: incorrect graph");

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift }

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift return;

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift }

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // If there is no opportunity to hoist, then we're done.

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift bool try_to_hoist = (LCA != early);

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Must clone guys stay next to use; no hoisting allowed.

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Also cannot hoist guys that alter memory or are otherwise not

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // allocatable (hoisting can make a value live longer, leading to

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // anti and output dependency problems which are normally resolved

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // by the register allocator giving everyone a different register).

9860f501d4514087515a9b3af4aded9876092276matthew_swift if (mach != NULL && must_clone[mach->ideal_Opcode()])

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift try_to_hoist = false;

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift

9860f501d4514087515a9b3af4aded9876092276matthew_swift Block* late = NULL;

9860f501d4514087515a9b3af4aded9876092276matthew_swift if (try_to_hoist) {

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift // Now find the block with the least execution frequency.

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift // Start at the latest schedule and work up to the earliest schedule

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift // in the dominator tree. Thus the Node will dominate all its uses.

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift late = hoist_to_cheaper_block(LCA, early, self);

9860f501d4514087515a9b3af4aded9876092276matthew_swift } else {

9860f501d4514087515a9b3af4aded9876092276matthew_swift // Just use the LCA of the uses.

9860f501d4514087515a9b3af4aded9876092276matthew_swift late = LCA;

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift }

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift // Put the node into target block

9860f501d4514087515a9b3af4aded9876092276matthew_swift schedule_node_into_block(self, late);

9860f501d4514087515a9b3af4aded9876092276matthew_swift

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift#ifdef ASSERT

9860f501d4514087515a9b3af4aded9876092276matthew_swift if (self->needs_anti_dependence_check()) {

9860f501d4514087515a9b3af4aded9876092276matthew_swift // since precedence edges are only inserted when we're sure they

9860f501d4514087515a9b3af4aded9876092276matthew_swift // are needed make sure that after placement in a block we don't

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift // need any new precedence edges.

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift verify_anti_dependences(late, self);

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift }

9860f501d4514087515a9b3af4aded9876092276matthew_swift#endif

9860f501d4514087515a9b3af4aded9876092276matthew_swift } // Loop until all nodes have been visited

9860f501d4514087515a9b3af4aded9876092276matthew_swift

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift} // end ScheduleLate

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swiftvoid PhaseCFG::GlobalCodeMotion( Matcher &matcher, uint unique, Node_List &proj_list ) {

f65733ef5ab8cedafc18f3f1fb55892fb4a6ad24matthew_swift ResourceMark rm;

9860f501d4514087515a9b3af4aded9876092276matthew_swift

9860f501d4514087515a9b3af4aded9876092276matthew_swift#ifndef PRODUCT

9860f501d4514087515a9b3af4aded9876092276matthew_swift if (trace_opto_pipelining()) {

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift tty->print("\n---- Start GlobalCodeMotion ----\n");

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift }

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift#endif

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Initialize the bbs.map for things on the proj_list

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift uint i;

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift for( i=0; i < proj_list.size(); i++ )

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift _bbs.map(proj_list[i]->_idx, NULL);

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Set the basic block for Nodes pinned into blocks

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift Arena *a = Thread::current()->resource_area();

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift VectorSet visited(a);

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift schedule_pinned_nodes( visited );

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Find the earliest Block any instruction can be placed in. Some

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // instructions are pinned into Blocks. Unpinned instructions can

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // appear in last block in which all their inputs occur.

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift visited.Clear();

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift Node_List stack(a);

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift stack.map( (unique >> 1) + 16, NULL); // Pre-grow the list

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift if (!schedule_early(visited, stack)) {

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Bailout without retry

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift C->record_method_not_compilable("early schedule failed");

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift return;

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift }

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Build Def-Use edges.

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift proj_list.push(_root); // Add real root as another root

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift proj_list.pop();

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Compute the latency information (via backwards walk) for all the

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // instructions in the graph

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift _node_latency = new GrowableArray<uint>(); // resource_area allocation

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift if( C->do_scheduling() )

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift ComputeLatenciesBackwards(visited, stack);

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // Now schedule all codes as LATE as possible. This is the LCA in the

6268e3d1b165bc72bbab62862e9b3b30e8883c97matthew_swift // dominator tree of all USES of a value. Pick the block with the least

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // loop nesting depth that is lowest in the dominator tree.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // ( visited.Clear() called in schedule_late()->Node_Backward_Iterator() )

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift schedule_late(visited, stack);

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if( C->failing() ) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // schedule_late fails only when graph is incorrect.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift assert(!VerifyGraphEdges, "verification should have failed");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift return;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift unique = C->unique();

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#ifndef PRODUCT

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (trace_opto_pipelining()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift tty->print("\n---- Detect implicit null checks ----\n");

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift }

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift#endif

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Detect implicit-null-check opportunities. Basically, find NULL checks

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // with suitable memory ops nearby. Use the memory op to do the NULL check.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // I can generate a memory op if there is not one nearby.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift if (C->is_method_compilation()) {

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // Don't do it for natives, adapters, or runtime stubs

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift int allowed_reasons = 0;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift // ...and don't do it when there have been too many traps, globally.

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift for (int reason = (int)Deoptimization::Reason_none+1;

bb8874d71cdd8e5288297b9727703437c6dfcfedmatthew_swift reason < Compile::trapHistLength; reason++) {