• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/c1/c1_ValueSet.hpp@9f4457a14b58 (annotated)

src/share/vm/c1/c1_ValueSet.hpp

Wed, 09 Apr 2008 15:10:22 -0700

author

rasbold

date

Wed, 09 Apr 2008 15:10:22 -0700

changeset 544

9f4457a14b58

parent 435

a61af66fc99e

child 1907

c18cbe5936b8

permissions

-rw-r--r--

Merge

duke@435	1	/*
duke@435	2	* Copyright 2001-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	// A ValueSet is a simple abstraction on top of a BitMap representing
duke@435	26	// a set of Instructions. Currently it assumes that the number of
duke@435	27	// instructions is fixed during its lifetime; should make it
duke@435	28	// automatically resizable.
duke@435	29
duke@435	30	class ValueSet: public CompilationResourceObj {
duke@435	31	private:
duke@435	32	BitMap _map;
duke@435	33
duke@435	34	public:
duke@435	35	ValueSet();
duke@435	36
duke@435	37	ValueSet* copy();
duke@435	38	bool contains(Value x);
duke@435	39	void put (Value x);
duke@435	40	void remove (Value x);
duke@435	41	bool set_intersect(ValueSet* other);
duke@435	42	void set_union(ValueSet* other);
duke@435	43	void clear ();
duke@435	44	void set_from(ValueSet* other);
duke@435	45	bool equals (ValueSet* other);
duke@435	46	};
duke@435	47
duke@435	48	inline ValueSet::ValueSet() : _map(Instruction::number_of_instructions()) {
duke@435	49	_map.clear();
duke@435	50	}
duke@435	51
duke@435	52
duke@435	53	inline ValueSet* ValueSet::copy() {
duke@435	54	ValueSet* res = new ValueSet();
duke@435	55	res->_map.set_from(_map);
duke@435	56	return res;
duke@435	57	}
duke@435	58
duke@435	59
duke@435	60	inline bool ValueSet::contains(Value x) {
duke@435	61	return _map.at(x->id());
duke@435	62	}
duke@435	63
duke@435	64
duke@435	65	inline void ValueSet::put(Value x) {
duke@435	66	_map.set_bit(x->id());
duke@435	67	}
duke@435	68
duke@435	69
duke@435	70	inline void ValueSet::remove(Value x) {
duke@435	71	_map.clear_bit(x->id());
duke@435	72	}
duke@435	73
duke@435	74
duke@435	75	inline bool ValueSet::set_intersect(ValueSet* other) {
duke@435	76	return _map.set_intersection_with_result(other->_map);
duke@435	77	}
duke@435	78
duke@435	79
duke@435	80	inline void ValueSet::set_union(ValueSet* other) {
duke@435	81	_map.set_union(other->_map);
duke@435	82	}
duke@435	83
duke@435	84
duke@435	85	inline void ValueSet::clear() {
duke@435	86	_map.clear();
duke@435	87	}
duke@435	88
duke@435	89	inline void ValueSet::set_from(ValueSet* other) {
duke@435	90	_map.set_from(other->_map);
duke@435	91	}
duke@435	92
duke@435	93	inline bool ValueSet::equals(ValueSet* other) {
duke@435	94	return _map.is_same(other->_map);
duke@435	95	}