1/*
2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25#ifndef SHARE_VM_C1_C1_VALUESET_HPP
26#define SHARE_VM_C1_C1_VALUESET_HPP
27
28#include "c1/c1_Instruction.hpp"
29#include "memory/allocation.hpp"
30#include "utilities/bitMap.inline.hpp"
31
32// A ValueSet is a simple abstraction on top of a BitMap representing
33// a set of Instructions. Currently it assumes that the number of
34// instructions is fixed during its lifetime; should make it
35// automatically resizable.
36
37class ValueSet: public CompilationResourceObj {
38 private:
39  ResourceBitMap _map;
40
41 public:
42  ValueSet();
43
44  ValueSet* copy();
45  bool contains(Value x);
46  void put     (Value x);
47  void remove  (Value x);
48  bool set_intersect(ValueSet* other);
49  void set_union(ValueSet* other);
50  void clear   ();
51  void set_from(ValueSet* other);
52  bool equals  (ValueSet* other);
53};
54
55inline ValueSet::ValueSet() : _map(Instruction::number_of_instructions()) {
56}
57
58
59inline ValueSet* ValueSet::copy() {
60  ValueSet* res = new ValueSet();
61  res->_map.set_from(_map);
62  return res;
63}
64
65
66inline bool ValueSet::contains(Value x) {
67  return _map.at(x->id());
68}
69
70
71inline void ValueSet::put(Value x) {
72  _map.set_bit(x->id());
73}
74
75
76inline void ValueSet::remove(Value x) {
77  _map.clear_bit(x->id());
78}
79
80
81inline bool ValueSet::set_intersect(ValueSet* other) {
82  return _map.set_intersection_with_result(other->_map);
83}
84
85
86inline void ValueSet::set_union(ValueSet* other) {
87  _map.set_union(other->_map);
88}
89
90
91inline void ValueSet::clear() {
92  _map.clear();
93}
94
95inline void ValueSet::set_from(ValueSet* other) {
96  _map.set_from(other->_map);
97}
98
99inline bool ValueSet::equals(ValueSet* other) {
100  return _map.is_same(other->_map);
101}
102
103#endif // SHARE_VM_C1_C1_VALUESET_HPP
104