1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/src/share/vm/c1/c1_ValueSet.hpp Wed Apr 27 01:25:04 2016 +0800 1.3 @@ -0,0 +1,104 @@ 1.4 +/* 1.5 + * Copyright (c) 2001, 2010, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 1.23 + * or visit www.oracle.com if you need additional information or have any 1.24 + * questions. 1.25 + * 1.26 + */ 1.27 + 1.28 +#ifndef SHARE_VM_C1_C1_VALUESET_HPP 1.29 +#define SHARE_VM_C1_C1_VALUESET_HPP 1.30 + 1.31 +#include "c1/c1_Instruction.hpp" 1.32 +#include "memory/allocation.hpp" 1.33 +#include "utilities/bitMap.inline.hpp" 1.34 + 1.35 +// A ValueSet is a simple abstraction on top of a BitMap representing 1.36 +// a set of Instructions. Currently it assumes that the number of 1.37 +// instructions is fixed during its lifetime; should make it 1.38 +// automatically resizable. 1.39 + 1.40 +class ValueSet: public CompilationResourceObj { 1.41 + private: 1.42 + BitMap _map; 1.43 + 1.44 + public: 1.45 + ValueSet(); 1.46 + 1.47 + ValueSet* copy(); 1.48 + bool contains(Value x); 1.49 + void put (Value x); 1.50 + void remove (Value x); 1.51 + bool set_intersect(ValueSet* other); 1.52 + void set_union(ValueSet* other); 1.53 + void clear (); 1.54 + void set_from(ValueSet* other); 1.55 + bool equals (ValueSet* other); 1.56 +}; 1.57 + 1.58 +inline ValueSet::ValueSet() : _map(Instruction::number_of_instructions()) { 1.59 + _map.clear(); 1.60 +} 1.61 + 1.62 + 1.63 +inline ValueSet* ValueSet::copy() { 1.64 + ValueSet* res = new ValueSet(); 1.65 + res->_map.set_from(_map); 1.66 + return res; 1.67 +} 1.68 + 1.69 + 1.70 +inline bool ValueSet::contains(Value x) { 1.71 + return _map.at(x->id()); 1.72 +} 1.73 + 1.74 + 1.75 +inline void ValueSet::put(Value x) { 1.76 + _map.set_bit(x->id()); 1.77 +} 1.78 + 1.79 + 1.80 +inline void ValueSet::remove(Value x) { 1.81 + _map.clear_bit(x->id()); 1.82 +} 1.83 + 1.84 + 1.85 +inline bool ValueSet::set_intersect(ValueSet* other) { 1.86 + return _map.set_intersection_with_result(other->_map); 1.87 +} 1.88 + 1.89 + 1.90 +inline void ValueSet::set_union(ValueSet* other) { 1.91 + _map.set_union(other->_map); 1.92 +} 1.93 + 1.94 + 1.95 +inline void ValueSet::clear() { 1.96 + _map.clear(); 1.97 +} 1.98 + 1.99 +inline void ValueSet::set_from(ValueSet* other) { 1.100 + _map.set_from(other->_map); 1.101 +} 1.102 + 1.103 +inline bool ValueSet::equals(ValueSet* other) { 1.104 + return _map.is_same(other->_map); 1.105 +} 1.106 + 1.107 +#endif // SHARE_VM_C1_C1_VALUESET_HPP