equal
deleted
inserted
replaced
1210 Node *n = block->get_node(j); |
1210 Node *n = block->get_node(j); |
1211 assert(get_block_for_node(n) == block, ""); |
1211 assert(get_block_for_node(n) == block, ""); |
1212 if (j >= 1 && n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_CreateEx) { |
1212 if (j >= 1 && n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_CreateEx) { |
1213 assert(j == 1 || block->get_node(j-1)->is_Phi(), "CreateEx must be first instruction in block"); |
1213 assert(j == 1 || block->get_node(j-1)->is_Phi(), "CreateEx must be first instruction in block"); |
1214 } |
1214 } |
|
1215 if (n->needs_anti_dependence_check()) { |
|
1216 verify_anti_dependences(block, n); |
|
1217 } |
1215 for (uint k = 0; k < n->req(); k++) { |
1218 for (uint k = 0; k < n->req(); k++) { |
1216 Node *def = n->in(k); |
1219 Node *def = n->in(k); |
1217 if (def && def != n) { |
1220 if (def && def != n) { |
1218 assert(get_block_for_node(def) || def->is_Con(), "must have block; constants for debug info ok"); |
1221 assert(get_block_for_node(def) || def->is_Con(), "must have block; constants for debug info ok"); |
1219 // Verify that instructions in the block is in correct order. |
1222 // Verify that instructions in the block is in correct order. |