1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/src/share/vm/c1/c1_ValueMap.hpp Sat Dec 01 00:00:00 2007 +0000 1.3 @@ -0,0 +1,204 @@ 1.4 +/* 1.5 + * Copyright 1999-2006 Sun Microsystems, Inc. All Rights Reserved. 1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1.7 + * 1.8 + * This code is free software; you can redistribute it and/or modify it 1.9 + * under the terms of the GNU General Public License version 2 only, as 1.10 + * published by the Free Software Foundation. 1.11 + * 1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT 1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1.15 + * version 2 for more details (a copy is included in the LICENSE file that 1.16 + * accompanied this code). 1.17 + * 1.18 + * You should have received a copy of the GNU General Public License version 1.19 + * 2 along with this work; if not, write to the Free Software Foundation, 1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1.21 + * 1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or 1.24 + * have any questions. 1.25 + * 1.26 + */ 1.27 + 1.28 +class ValueMapEntry: public CompilationResourceObj { 1.29 + private: 1.30 + intx _hash; 1.31 + Value _value; 1.32 + int _nesting; 1.33 + ValueMapEntry* _next; 1.34 + 1.35 + public: 1.36 + ValueMapEntry(intx hash, Value value, int nesting, ValueMapEntry* next) 1.37 + : _hash(hash) 1.38 + , _value(value) 1.39 + , _nesting(nesting) 1.40 + , _next(next) 1.41 + { 1.42 + } 1.43 + 1.44 + intx hash() { return _hash; } 1.45 + Value value() { return _value; } 1.46 + int nesting() { return _nesting; } 1.47 + ValueMapEntry* next() { return _next; } 1.48 + 1.49 + void set_next(ValueMapEntry* next) { _next = next; } 1.50 +}; 1.51 + 1.52 +define_array(ValueMapEntryArray, ValueMapEntry*) 1.53 +define_stack(ValueMapEntryList, ValueMapEntryArray) 1.54 + 1.55 +// ValueMap implements nested hash tables for value numbering. It 1.56 +// maintains a set _killed_values which represents the instructions 1.57 +// which have been killed so far and an array of linked lists of 1.58 +// ValueMapEntries names _entries. Each ValueMapEntry has a nesting 1.59 +// which indicates what ValueMap nesting it belongs to. Higher 1.60 +// nesting values are always before lower values in the linked list. 1.61 +// This allows cloning of parent ValueMaps by simply copying the heads 1.62 +// of the list. _entry_count represents the number of reachable 1.63 +// entries in the ValueMap. A ValueMap is only allowed to mutate 1.64 +// ValueMapEntries with the same nesting level. Adding or removing 1.65 +// entries at the current nesting level requires updating 1.66 +// _entry_count. Elements in the parent's list that get killed can be 1.67 +// skipped if they are at the head of the list by simply moving to the 1.68 +// next element in the list and decrementing _entry_count. 1.69 + 1.70 +class ValueMap: public CompilationResourceObj { 1.71 + private: 1.72 + int _nesting; 1.73 + ValueMapEntryArray _entries; 1.74 + ValueSet _killed_values; 1.75 + int _entry_count; 1.76 + 1.77 + int nesting() { return _nesting; } 1.78 + bool is_local_value_numbering() { return _nesting == 0; } 1.79 + bool is_global_value_numbering() { return _nesting > 0; } 1.80 + 1.81 + int entry_count() { return _entry_count; } 1.82 + int size() { return _entries.length(); } 1.83 + ValueMapEntry* entry_at(int i) { return _entries.at(i); } 1.84 + 1.85 + // calculates the index of a hash value in a hash table of size n 1.86 + int entry_index(intx hash, int n) { return (unsigned int)hash % n; } 1.87 + 1.88 + // if entry_count > size_threshold, the size of the hash table is increased 1.89 + int size_threshold() { return size(); } 1.90 + 1.91 + // management of the killed-bitset for global value numbering 1.92 + void kill_value(Value v) { if (is_global_value_numbering()) _killed_values.put(v); } 1.93 + bool is_killed(Value v) { if (is_global_value_numbering()) return _killed_values.contains(v); else return false; } 1.94 + 1.95 + // helper functions 1.96 + void increase_table_size(); 1.97 + 1.98 +#ifndef PRODUCT 1.99 + static int _number_of_finds; 1.100 + static int _number_of_hits; 1.101 + static int _number_of_kills; 1.102 +#endif // PRODUCT 1.103 + 1.104 + public: 1.105 + // creation 1.106 + ValueMap(); // empty value map 1.107 + ValueMap(ValueMap* old); // value map with increased nesting 1.108 + 1.109 + // manipulation 1.110 + Value find_insert(Value x); 1.111 + 1.112 + void kill_memory(); 1.113 + void kill_field(ciField* field); 1.114 + void kill_array(ValueType* type); 1.115 + void kill_exception(); 1.116 + void kill_map(ValueMap* map); 1.117 + void kill_all(); 1.118 + 1.119 +#ifndef PRODUCT 1.120 + // debugging/printing 1.121 + void print(); 1.122 + 1.123 + static void reset_statistics(); 1.124 + static void print_statistics(); 1.125 +#endif 1.126 +}; 1.127 + 1.128 +define_array(ValueMapArray, ValueMap*) 1.129 + 1.130 + 1.131 +class ValueNumberingVisitor: public InstructionVisitor { 1.132 + protected: 1.133 + // called by visitor functions for instructions that kill values 1.134 + virtual void kill_memory() = 0; 1.135 + virtual void kill_field(ciField* field) = 0; 1.136 + virtual void kill_array(ValueType* type) = 0; 1.137 + 1.138 + // visitor functions 1.139 + void do_StoreField (StoreField* x) { kill_field(x->field()); }; 1.140 + void do_StoreIndexed (StoreIndexed* x) { kill_array(x->type()); }; 1.141 + void do_MonitorEnter (MonitorEnter* x) { kill_memory(); }; 1.142 + void do_MonitorExit (MonitorExit* x) { kill_memory(); }; 1.143 + void do_Invoke (Invoke* x) { kill_memory(); }; 1.144 + void do_UnsafePutRaw (UnsafePutRaw* x) { kill_memory(); }; 1.145 + void do_UnsafePutObject(UnsafePutObject* x) { kill_memory(); }; 1.146 + void do_Intrinsic (Intrinsic* x) { if (!x->preserves_state()) kill_memory(); }; 1.147 + 1.148 + void do_Phi (Phi* x) { /* nothing to do */ }; 1.149 + void do_Local (Local* x) { /* nothing to do */ }; 1.150 + void do_Constant (Constant* x) { /* nothing to do */ }; 1.151 + void do_LoadField (LoadField* x) { /* nothing to do */ }; 1.152 + void do_ArrayLength (ArrayLength* x) { /* nothing to do */ }; 1.153 + void do_LoadIndexed (LoadIndexed* x) { /* nothing to do */ }; 1.154 + void do_NegateOp (NegateOp* x) { /* nothing to do */ }; 1.155 + void do_ArithmeticOp (ArithmeticOp* x) { /* nothing to do */ }; 1.156 + void do_ShiftOp (ShiftOp* x) { /* nothing to do */ }; 1.157 + void do_LogicOp (LogicOp* x) { /* nothing to do */ }; 1.158 + void do_CompareOp (CompareOp* x) { /* nothing to do */ }; 1.159 + void do_IfOp (IfOp* x) { /* nothing to do */ }; 1.160 + void do_Convert (Convert* x) { /* nothing to do */ }; 1.161 + void do_NullCheck (NullCheck* x) { /* nothing to do */ }; 1.162 + void do_NewInstance (NewInstance* x) { /* nothing to do */ }; 1.163 + void do_NewTypeArray (NewTypeArray* x) { /* nothing to do */ }; 1.164 + void do_NewObjectArray (NewObjectArray* x) { /* nothing to do */ }; 1.165 + void do_NewMultiArray (NewMultiArray* x) { /* nothing to do */ }; 1.166 + void do_CheckCast (CheckCast* x) { /* nothing to do */ }; 1.167 + void do_InstanceOf (InstanceOf* x) { /* nothing to do */ }; 1.168 + void do_BlockBegin (BlockBegin* x) { /* nothing to do */ }; 1.169 + void do_Goto (Goto* x) { /* nothing to do */ }; 1.170 + void do_If (If* x) { /* nothing to do */ }; 1.171 + void do_IfInstanceOf (IfInstanceOf* x) { /* nothing to do */ }; 1.172 + void do_TableSwitch (TableSwitch* x) { /* nothing to do */ }; 1.173 + void do_LookupSwitch (LookupSwitch* x) { /* nothing to do */ }; 1.174 + void do_Return (Return* x) { /* nothing to do */ }; 1.175 + void do_Throw (Throw* x) { /* nothing to do */ }; 1.176 + void do_Base (Base* x) { /* nothing to do */ }; 1.177 + void do_OsrEntry (OsrEntry* x) { /* nothing to do */ }; 1.178 + void do_ExceptionObject(ExceptionObject* x) { /* nothing to do */ }; 1.179 + void do_RoundFP (RoundFP* x) { /* nothing to do */ }; 1.180 + void do_UnsafeGetRaw (UnsafeGetRaw* x) { /* nothing to do */ }; 1.181 + void do_UnsafeGetObject(UnsafeGetObject* x) { /* nothing to do */ }; 1.182 + void do_UnsafePrefetchRead (UnsafePrefetchRead* x) { /* nothing to do */ }; 1.183 + void do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) { /* nothing to do */ }; 1.184 + void do_ProfileCall (ProfileCall* x) { /* nothing to do */ }; 1.185 + void do_ProfileCounter (ProfileCounter* x) { /* nothing to do */ }; 1.186 +}; 1.187 + 1.188 + 1.189 +class GlobalValueNumbering: public ValueNumberingVisitor { 1.190 + private: 1.191 + ValueMap* _current_map; // value map of current block 1.192 + ValueMapArray _value_maps; // list of value maps for all blocks 1.193 + 1.194 + public: 1.195 + // accessors 1.196 + ValueMap* current_map() { return _current_map; } 1.197 + ValueMap* value_map_of(BlockBegin* block) { return _value_maps.at(block->linear_scan_number()); } 1.198 + void set_value_map_of(BlockBegin* block, ValueMap* map) { assert(value_map_of(block) == NULL, ""); _value_maps.at_put(block->linear_scan_number(), map); } 1.199 + 1.200 + // implementation for abstract methods of ValueNumberingVisitor 1.201 + void kill_memory() { current_map()->kill_memory(); } 1.202 + void kill_field(ciField* field) { current_map()->kill_field(field); } 1.203 + void kill_array(ValueType* type) { current_map()->kill_array(type); } 1.204 + 1.205 + // main entry point that performs global value numbering 1.206 + GlobalValueNumbering(IR* ir); 1.207 +};