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