3cace296ee
additionally rename data-flow.* to bit-vector.* as at some point these file became very inaccurately named BUG= R=svenpanne@chromium.org Review URL: https://codereview.chromium.org/683243005 Cr-Commit-Position: refs/heads/master@{#25030} git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@25030 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
59 lines
1.2 KiB
C++
59 lines
1.2 KiB
C++
// Copyright 2010 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "src/bit-vector.h"
|
|
|
|
#include "src/base/bits.h"
|
|
#include "src/scopes.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
#ifdef DEBUG
|
|
void BitVector::Print() {
|
|
bool first = true;
|
|
PrintF("{");
|
|
for (int i = 0; i < length(); i++) {
|
|
if (Contains(i)) {
|
|
if (!first) PrintF(",");
|
|
first = false;
|
|
PrintF("%d", i);
|
|
}
|
|
}
|
|
PrintF("}");
|
|
}
|
|
#endif
|
|
|
|
|
|
void BitVector::Iterator::Advance() {
|
|
current_++;
|
|
uintptr_t val = current_value_;
|
|
while (val == 0) {
|
|
current_index_++;
|
|
if (Done()) return;
|
|
val = target_->data_[current_index_];
|
|
current_ = current_index_ << kDataBitShift;
|
|
}
|
|
val = SkipZeroBytes(val);
|
|
val = SkipZeroBits(val);
|
|
current_value_ = val >> 1;
|
|
}
|
|
|
|
|
|
int BitVector::Count() const {
|
|
int count = 0;
|
|
for (int i = 0; i < data_length_; i++) {
|
|
uintptr_t data = data_[i];
|
|
if (sizeof(data) == 8) {
|
|
count += base::bits::CountPopulation64(data);
|
|
} else {
|
|
count += base::bits::CountPopulation32(static_cast<uint32_t>(data));
|
|
}
|
|
}
|
|
return count;
|
|
}
|
|
|
|
} // namespace internal
|
|
} // namespace v8
|