Mercurial > jdk8-mips64-public > hotspot / file diff

     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/share/vm/c1/c1_ValueSet.hpp	Sat Dec 01 00:00:00 2007 +0000
     1.3 @@ -0,0 +1,95 @@
     1.4 +/*
     1.5 + * Copyright 2001-2005 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 +// A ValueSet is a simple abstraction on top of a BitMap representing
    1.29 +// a set of Instructions. Currently it assumes that the number of
    1.30 +// instructions is fixed during its lifetime; should make it
    1.31 +// automatically resizable.
    1.32 +
    1.33 +class ValueSet: public CompilationResourceObj {
    1.34 + private:
    1.35 +  BitMap _map;
    1.36 +
    1.37 + public:
    1.38 +  ValueSet();
    1.39 +
    1.40 +  ValueSet* copy();
    1.41 +  bool contains(Value x);
    1.42 +  void put     (Value x);
    1.43 +  void remove  (Value x);
    1.44 +  bool set_intersect(ValueSet* other);
    1.45 +  void set_union(ValueSet* other);
    1.46 +  void clear   ();
    1.47 +  void set_from(ValueSet* other);
    1.48 +  bool equals  (ValueSet* other);
    1.49 +};
    1.50 +
    1.51 +inline ValueSet::ValueSet() : _map(Instruction::number_of_instructions()) {
    1.52 +  _map.clear();
    1.53 +}
    1.54 +
    1.55 +
    1.56 +inline ValueSet* ValueSet::copy() {
    1.57 +  ValueSet* res = new ValueSet();
    1.58 +  res->_map.set_from(_map);
    1.59 +  return res;
    1.60 +}
    1.61 +
    1.62 +
    1.63 +inline bool ValueSet::contains(Value x) {
    1.64 +  return _map.at(x->id());
    1.65 +}
    1.66 +
    1.67 +
    1.68 +inline void ValueSet::put(Value x) {
    1.69 +  _map.set_bit(x->id());
    1.70 +}
    1.71 +
    1.72 +
    1.73 +inline void ValueSet::remove(Value x) {
    1.74 +  _map.clear_bit(x->id());
    1.75 +}
    1.76 +
    1.77 +
    1.78 +inline bool ValueSet::set_intersect(ValueSet* other) {
    1.79 +  return _map.set_intersection_with_result(other->_map);
    1.80 +}
    1.81 +
    1.82 +
    1.83 +inline void ValueSet::set_union(ValueSet* other) {
    1.84 +  _map.set_union(other->_map);
    1.85 +}
    1.86 +
    1.87 +
    1.88 +inline void ValueSet::clear() {
    1.89 +  _map.clear();
    1.90 +}
    1.91 +
    1.92 +inline void ValueSet::set_from(ValueSet* other) {
    1.93 +  _map.set_from(other->_map);
    1.94 +}
    1.95 +
    1.96 +inline bool ValueSet::equals(ValueSet* other) {
    1.97 +  return _map.is_same(other->_map);
    1.98 +}