bit-vector.h 6 KB
Newer Older
1
// Copyright 2012 the V8 project authors. All rights reserved.
2 3
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
4 5 6 7

#ifndef V8_DATAFLOW_H_
#define V8_DATAFLOW_H_

8
#include "src/allocation.h"
9
#include "src/zone.h"
10 11 12 13

namespace v8 {
namespace internal {

14
class BitVector : public ZoneObject {
15
 public:
16 17 18 19 20 21 22 23
  // Iterator for the elements of this BitVector.
  class Iterator BASE_EMBEDDED {
   public:
    explicit Iterator(BitVector* target)
        : target_(target),
          current_index_(0),
          current_value_(target->data_[0]),
          current_(-1) {
24
      DCHECK(target->data_length_ > 0);
25 26
      Advance();
    }
27
    ~Iterator() {}
28 29 30 31 32

    bool Done() const { return current_index_ >= target_->data_length_; }
    void Advance();

    int Current() const {
33
      DCHECK(!Done());
34 35 36 37
      return current_;
    }

   private:
38
    uintptr_t SkipZeroBytes(uintptr_t val) {
39 40 41 42 43 44
      while ((val & 0xFF) == 0) {
        val >>= 8;
        current_ += 8;
      }
      return val;
    }
45
    uintptr_t SkipZeroBits(uintptr_t val) {
46 47 48 49 50 51
      while ((val & 0x1) == 0) {
        val >>= 1;
        current_++;
      }
      return val;
    }
52

53 54
    BitVector* target_;
    int current_index_;
55
    uintptr_t current_value_;
56 57 58 59 60
    int current_;

    friend class BitVector;
  };

61 62 63 64
  static const int kDataBits = kPointerSize * 8;
  static const int kDataBitShift = kPointerSize == 8 ? 6 : 5;
  static const uintptr_t kOne = 1;  // This saves some static_casts.

65
  BitVector(int length, Zone* zone)
66 67
      : length_(length),
        data_length_(SizeFor(length)),
68
        data_(zone->NewArray<uintptr_t>(data_length_)) {
69
    DCHECK_LE(0, length);
70
    Clear();
71 72
  }

73
  BitVector(const BitVector& other, Zone* zone)
74
      : length_(other.length()),
75
        data_length_(SizeFor(length_)),
76
        data_(zone->NewArray<uintptr_t>(data_length_)) {
77 78 79
    CopyFrom(other);
  }

80 81 82 83
  static int SizeFor(int length) {
    if (length == 0) return 1;
    return 1 + ((length - 1) / kDataBits);
  }
84

85
  void CopyFrom(const BitVector& other) {
86
    DCHECK(other.length() <= length());
87
    for (int i = 0; i < other.data_length_; i++) {
88
      data_[i] = other.data_[i];
89
    }
90 91 92
    for (int i = other.data_length_; i < data_length_; i++) {
      data_[i] = 0;
    }
93 94
  }

95
  bool Contains(int i) const {
96
    DCHECK(i >= 0 && i < length());
97 98
    uintptr_t block = data_[i / kDataBits];
    return (block & (kOne << (i % kDataBits))) != 0;
99 100 101
  }

  void Add(int i) {
102
    DCHECK(i >= 0 && i < length());
103
    data_[i / kDataBits] |= (kOne << (i % kDataBits));
104 105
  }

106 107
  void AddAll() { memset(data_, -1, sizeof(uintptr_t) * data_length_); }

108
  void Remove(int i) {
109
    DCHECK(i >= 0 && i < length());
110
    data_[i / kDataBits] &= ~(kOne << (i % kDataBits));
111 112 113
  }

  void Union(const BitVector& other) {
114
    DCHECK(other.length() == length());
115 116
    for (int i = 0; i < data_length_; i++) {
      data_[i] |= other.data_[i];
117 118 119
    }
  }

120
  bool UnionIsChanged(const BitVector& other) {
121
    DCHECK(other.length() == length());
122 123
    bool changed = false;
    for (int i = 0; i < data_length_; i++) {
124
      uintptr_t old_data = data_[i];
125 126 127 128 129 130
      data_[i] |= other.data_[i];
      if (data_[i] != old_data) changed = true;
    }
    return changed;
  }

131
  void Intersect(const BitVector& other) {
132
    DCHECK(other.length() == length());
133 134
    for (int i = 0; i < data_length_; i++) {
      data_[i] &= other.data_[i];
135 136 137
    }
  }

138 139 140 141
  bool IntersectIsChanged(const BitVector& other) {
    DCHECK(other.length() == length());
    bool changed = false;
    for (int i = 0; i < data_length_; i++) {
142
      uintptr_t old_data = data_[i];
143 144 145 146 147 148
      data_[i] &= other.data_[i];
      if (data_[i] != old_data) changed = true;
    }
    return changed;
  }

149
  void Subtract(const BitVector& other) {
150
    DCHECK(other.length() == length());
151 152 153 154 155
    for (int i = 0; i < data_length_; i++) {
      data_[i] &= ~other.data_[i];
    }
  }

156
  void Clear() {
157 158
    for (int i = 0; i < data_length_; i++) {
      data_[i] = 0;
159 160 161
    }
  }

162 163 164
  bool IsEmpty() const {
    for (int i = 0; i < data_length_; i++) {
      if (data_[i] != 0) return false;
165 166 167 168
    }
    return true;
  }

169 170 171 172 173 174 175
  bool Equals(const BitVector& other) {
    for (int i = 0; i < data_length_; i++) {
      if (data_[i] != other.data_[i]) return false;
    }
    return true;
  }

176
  int Count() const;
177

178 179
  int length() const { return length_; }

180 181 182 183
#ifdef DEBUG
  void Print();
#endif

184
 private:
185 186 187 188 189
  const int length_;
  const int data_length_;
  uintptr_t* const data_;

  DISALLOW_COPY_AND_ASSIGN(BitVector);
190 191
};

192

193 194
class GrowableBitVector BASE_EMBEDDED {
 public:
195 196 197
  class Iterator BASE_EMBEDDED {
   public:
    Iterator(const GrowableBitVector* target, Zone* zone)
198 199
        : it_(target->bits_ == NULL ? new (zone) BitVector(1, zone)
                                    : target->bits_) {}
200 201 202
    bool Done() const { return it_.Done(); }
    void Advance() { it_.Advance(); }
    int Current() const { return it_.Current(); }
203

204 205 206 207
   private:
    BitVector::Iterator it_;
  };

208
  GrowableBitVector() : bits_(NULL) {}
209
  GrowableBitVector(int length, Zone* zone)
210
      : bits_(new (zone) BitVector(length, zone)) {}
211 212 213 214 215 216 217 218 219 220 221

  bool Contains(int value) const {
    if (!InBitsRange(value)) return false;
    return bits_->Contains(value);
  }

  void Add(int value, Zone* zone) {
    EnsureCapacity(value, zone);
    bits_->Add(value);
  }

222 223 224 225 226 227
  void Union(const GrowableBitVector& other, Zone* zone) {
    for (Iterator it(&other, zone); !it.Done(); it.Advance()) {
      Add(it.Current(), zone);
    }
  }

228 229 230
  void Clear() {
    if (bits_ != NULL) bits_->Clear();
  }
231

232 233 234 235 236 237 238 239 240 241 242
 private:
  static const int kInitialLength = 1024;

  bool InBitsRange(int value) const {
    return bits_ != NULL && bits_->length() > value;
  }

  void EnsureCapacity(int value, Zone* zone) {
    if (InBitsRange(value)) return;
    int new_length = bits_ == NULL ? kInitialLength : bits_->length();
    while (new_length <= value) new_length *= 2;
243
    BitVector* new_bits = new (zone) BitVector(new_length, zone);
244 245 246 247 248 249 250
    if (bits_ != NULL) new_bits->CopyFrom(*bits_);
    bits_ = new_bits;
  }

  BitVector* bits_;
};

251 252
}  // namespace internal
}  // namespace v8
253

254
#endif  // V8_DATAFLOW_H_