1// Copyright 2010 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28#include "v8.h" 29 30#include "data-flow.h" 31#include "scopes.h" 32 33namespace v8 { 34namespace internal { 35 36#ifdef DEBUG 37void BitVector::Print() { 38 bool first = true; 39 PrintF("{"); 40 for (int i = 0; i < length(); i++) { 41 if (Contains(i)) { 42 if (!first) PrintF(","); 43 first = false; 44 PrintF("%d", i); 45 } 46 } 47 PrintF("}"); 48} 49#endif 50 51 52void BitVector::Iterator::Advance() { 53 current_++; 54 uint32_t val = current_value_; 55 while (val == 0) { 56 current_index_++; 57 if (Done()) return; 58 val = target_->data_[current_index_]; 59 current_ = current_index_ << 5; 60 } 61 val = SkipZeroBytes(val); 62 val = SkipZeroBits(val); 63 current_value_ = val >> 1; 64} 65 66} } // namespace v8::internal 67