Wed, 09 Dec 2009 16:40:45 -0800
6895383: JCK test throws NPE for method compiled with Escape Analysis
Summary: Add missing checks for MemBar nodes in EA.
Reviewed-by: never
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2000-2005 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | class Arena; |
duke@435 | 26 | class Bundle; |
duke@435 | 27 | class Block; |
duke@435 | 28 | class Block_Array; |
duke@435 | 29 | class Node; |
duke@435 | 30 | class Node_Array; |
duke@435 | 31 | class Node_List; |
duke@435 | 32 | class PhaseCFG; |
duke@435 | 33 | class PhaseChaitin; |
duke@435 | 34 | class Pipeline_Use_Element; |
duke@435 | 35 | class Pipeline_Use; |
duke@435 | 36 | |
duke@435 | 37 | #ifndef PRODUCT |
duke@435 | 38 | #define DEBUG_ARG(x) , x |
duke@435 | 39 | #else |
duke@435 | 40 | #define DEBUG_ARG(x) |
duke@435 | 41 | #endif |
duke@435 | 42 | |
duke@435 | 43 | // Define the initial sizes for allocation of the resizable code buffer |
duke@435 | 44 | enum { |
duke@435 | 45 | initial_code_capacity = 16 * 1024, |
duke@435 | 46 | initial_stub_capacity = 4 * 1024, |
duke@435 | 47 | initial_const_capacity = 4 * 1024, |
duke@435 | 48 | initial_locs_capacity = 3 * 1024 |
duke@435 | 49 | }; |
duke@435 | 50 | |
duke@435 | 51 | //------------------------------Scheduling---------------------------------- |
duke@435 | 52 | // This class contains all the information necessary to implement instruction |
duke@435 | 53 | // scheduling and bundling. |
duke@435 | 54 | class Scheduling { |
duke@435 | 55 | |
duke@435 | 56 | private: |
duke@435 | 57 | // Arena to use |
duke@435 | 58 | Arena *_arena; |
duke@435 | 59 | |
duke@435 | 60 | // Control-Flow Graph info |
duke@435 | 61 | PhaseCFG *_cfg; |
duke@435 | 62 | |
duke@435 | 63 | // Register Allocation info |
duke@435 | 64 | PhaseRegAlloc *_regalloc; |
duke@435 | 65 | |
duke@435 | 66 | // Number of nodes in the method |
duke@435 | 67 | uint _node_bundling_limit; |
duke@435 | 68 | |
duke@435 | 69 | // List of scheduled nodes. Generated in reverse order |
duke@435 | 70 | Node_List _scheduled; |
duke@435 | 71 | |
duke@435 | 72 | // List of nodes currently available for choosing for scheduling |
duke@435 | 73 | Node_List _available; |
duke@435 | 74 | |
duke@435 | 75 | // Mapping from node (index) to basic block |
duke@435 | 76 | Block_Array& _bbs; |
duke@435 | 77 | |
duke@435 | 78 | // For each instruction beginning a bundle, the number of following |
duke@435 | 79 | // nodes to be bundled with it. |
duke@435 | 80 | Bundle *_node_bundling_base; |
duke@435 | 81 | |
duke@435 | 82 | // Mapping from register to Node |
duke@435 | 83 | Node_List _reg_node; |
duke@435 | 84 | |
duke@435 | 85 | // Free list for pinch nodes. |
duke@435 | 86 | Node_List _pinch_free_list; |
duke@435 | 87 | |
duke@435 | 88 | // Latency from the beginning of the containing basic block (base 1) |
duke@435 | 89 | // for each node. |
duke@435 | 90 | unsigned short *_node_latency; |
duke@435 | 91 | |
duke@435 | 92 | // Number of uses of this node within the containing basic block. |
duke@435 | 93 | short *_uses; |
duke@435 | 94 | |
duke@435 | 95 | // Schedulable portion of current block. Skips Region/Phi/CreateEx up |
duke@435 | 96 | // front, branch+proj at end. Also skips Catch/CProj (same as |
duke@435 | 97 | // branch-at-end), plus just-prior exception-throwing call. |
duke@435 | 98 | uint _bb_start, _bb_end; |
duke@435 | 99 | |
duke@435 | 100 | // Latency from the end of the basic block as scheduled |
duke@435 | 101 | unsigned short *_current_latency; |
duke@435 | 102 | |
duke@435 | 103 | // Remember the next node |
duke@435 | 104 | Node *_next_node; |
duke@435 | 105 | |
duke@435 | 106 | // Use this for an unconditional branch delay slot |
duke@435 | 107 | Node *_unconditional_delay_slot; |
duke@435 | 108 | |
duke@435 | 109 | // Pointer to a Nop |
duke@435 | 110 | MachNopNode *_nop; |
duke@435 | 111 | |
duke@435 | 112 | // Length of the current bundle, in instructions |
duke@435 | 113 | uint _bundle_instr_count; |
duke@435 | 114 | |
duke@435 | 115 | // Current Cycle number, for computing latencies and bundling |
duke@435 | 116 | uint _bundle_cycle_number; |
duke@435 | 117 | |
duke@435 | 118 | // Bundle information |
duke@435 | 119 | Pipeline_Use_Element _bundle_use_elements[resource_count]; |
duke@435 | 120 | Pipeline_Use _bundle_use; |
duke@435 | 121 | |
duke@435 | 122 | // Dump the available list |
duke@435 | 123 | void dump_available() const; |
duke@435 | 124 | |
duke@435 | 125 | public: |
duke@435 | 126 | Scheduling(Arena *arena, Compile &compile); |
duke@435 | 127 | |
duke@435 | 128 | // Destructor |
duke@435 | 129 | NOT_PRODUCT( ~Scheduling(); ) |
duke@435 | 130 | |
duke@435 | 131 | // Step ahead "i" cycles |
duke@435 | 132 | void step(uint i); |
duke@435 | 133 | |
duke@435 | 134 | // Step ahead 1 cycle, and clear the bundle state (for example, |
duke@435 | 135 | // at a branch target) |
duke@435 | 136 | void step_and_clear(); |
duke@435 | 137 | |
duke@435 | 138 | Bundle* node_bundling(const Node *n) { |
duke@435 | 139 | assert(valid_bundle_info(n), "oob"); |
duke@435 | 140 | return (&_node_bundling_base[n->_idx]); |
duke@435 | 141 | } |
duke@435 | 142 | |
duke@435 | 143 | bool valid_bundle_info(const Node *n) const { |
duke@435 | 144 | return (_node_bundling_limit > n->_idx); |
duke@435 | 145 | } |
duke@435 | 146 | |
duke@435 | 147 | bool starts_bundle(const Node *n) const { |
duke@435 | 148 | return (_node_bundling_limit > n->_idx && _node_bundling_base[n->_idx].starts_bundle()); |
duke@435 | 149 | } |
duke@435 | 150 | |
duke@435 | 151 | // Do the scheduling |
duke@435 | 152 | void DoScheduling(); |
duke@435 | 153 | |
duke@435 | 154 | // Compute the local latencies walking forward over the list of |
duke@435 | 155 | // nodes for a basic block |
duke@435 | 156 | void ComputeLocalLatenciesForward(const Block *bb); |
duke@435 | 157 | |
duke@435 | 158 | // Compute the register antidependencies within a basic block |
duke@435 | 159 | void ComputeRegisterAntidependencies(Block *bb); |
duke@435 | 160 | void verify_do_def( Node *n, OptoReg::Name def, const char *msg ); |
duke@435 | 161 | void verify_good_schedule( Block *b, const char *msg ); |
duke@435 | 162 | void anti_do_def( Block *b, Node *def, OptoReg::Name def_reg, int is_def ); |
duke@435 | 163 | void anti_do_use( Block *b, Node *use, OptoReg::Name use_reg ); |
duke@435 | 164 | |
duke@435 | 165 | // Add a node to the current bundle |
duke@435 | 166 | void AddNodeToBundle(Node *n, const Block *bb); |
duke@435 | 167 | |
duke@435 | 168 | // Add a node to the list of available nodes |
duke@435 | 169 | void AddNodeToAvailableList(Node *n); |
duke@435 | 170 | |
duke@435 | 171 | // Compute the local use count for the nodes in a block, and compute |
duke@435 | 172 | // the list of instructions with no uses in the block as available |
duke@435 | 173 | void ComputeUseCount(const Block *bb); |
duke@435 | 174 | |
duke@435 | 175 | // Choose an instruction from the available list to add to the bundle |
duke@435 | 176 | Node * ChooseNodeToBundle(); |
duke@435 | 177 | |
duke@435 | 178 | // See if this Node fits into the currently accumulating bundle |
duke@435 | 179 | bool NodeFitsInBundle(Node *n); |
duke@435 | 180 | |
duke@435 | 181 | // Decrement the use count for a node |
duke@435 | 182 | void DecrementUseCounts(Node *n, const Block *bb); |
duke@435 | 183 | |
duke@435 | 184 | // Garbage collect pinch nodes for reuse by other blocks. |
duke@435 | 185 | void garbage_collect_pinch_nodes(); |
duke@435 | 186 | // Clean up a pinch node for reuse (helper for above). |
duke@435 | 187 | void cleanup_pinch( Node *pinch ); |
duke@435 | 188 | |
duke@435 | 189 | // Information for statistics gathering |
duke@435 | 190 | #ifndef PRODUCT |
duke@435 | 191 | private: |
duke@435 | 192 | // Gather information on size of nops relative to total |
duke@435 | 193 | uint _branches, _unconditional_delays; |
duke@435 | 194 | |
duke@435 | 195 | static uint _total_nop_size, _total_method_size; |
duke@435 | 196 | static uint _total_branches, _total_unconditional_delays; |
duke@435 | 197 | static uint _total_instructions_per_bundle[Pipeline::_max_instrs_per_cycle+1]; |
duke@435 | 198 | |
duke@435 | 199 | public: |
duke@435 | 200 | static void print_statistics(); |
duke@435 | 201 | |
duke@435 | 202 | static void increment_instructions_per_bundle(uint i) { |
duke@435 | 203 | _total_instructions_per_bundle[i]++; |
duke@435 | 204 | } |
duke@435 | 205 | |
duke@435 | 206 | static void increment_nop_size(uint s) { |
duke@435 | 207 | _total_nop_size += s; |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | static void increment_method_size(uint s) { |
duke@435 | 211 | _total_method_size += s; |
duke@435 | 212 | } |
duke@435 | 213 | #endif |
duke@435 | 214 | |
duke@435 | 215 | }; |