f20ff991f7
Not used in Crankshaft anymore. Review URL: http://codereview.chromium.org/6849023 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@7619 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
67 lines
2.2 KiB
C++
67 lines
2.2 KiB
C++
// Copyright 2010 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#include "v8.h"
|
|
|
|
#include "data-flow.h"
|
|
#include "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_++;
|
|
uint32_t val = current_value_;
|
|
while (val == 0) {
|
|
current_index_++;
|
|
if (Done()) return;
|
|
val = target_->data_[current_index_];
|
|
current_ = current_index_ << 5;
|
|
}
|
|
val = SkipZeroBytes(val);
|
|
val = SkipZeroBits(val);
|
|
current_value_ = val >> 1;
|
|
}
|
|
|
|
} } // namespace v8::internal
|