heap/HandleStack.cpp

   1 /*
   2  * Copyright (C) 2010 Apple Inc. All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions
   6  * are met:
   7  * 1. Redistributions of source code must retain the above copyright
   8  *    notice, this list of conditions and the following disclaimer.
   9  * 2. Redistributions in binary form must reproduce the above copyright
  10  *    notice, this list of conditions and the following disclaimer in the
  11  *    documentation and/or other materials provided with the distribution.
  12  *
  13  * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
  14  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
  15  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  16  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
  17  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  18  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  19  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  20  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  21  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  22  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  23  * THE POSSIBILITY OF SUCH DAMAGE.
  24  */
  25
  26 #include "config.h"
  27 #include "HandleStack.h"
  28
  29 #include "HeapRootVisitor.h"
  30 #include "JSObject.h"
  31 #include "JSCInlines.h"
  32
  33 namespace JSC {
  34
  35 HandleStack::HandleStack()
  36 #ifndef NDEBUG
  37     : m_scopeDepth(0)
  38 #endif
  39 {
  40     grow();
  41 }
  42
  43 void HandleStack::visit(HeapRootVisitor& heapRootVisitor)
  44 {
  45     const Vector<HandleSlot>& blocks = m_blockStack.blocks();
  46     size_t blockLength = m_blockStack.blockLength;
  47
  48     int end = blocks.size() - 1;
  49     for (int i = 0; i < end; ++i) {
  50         HandleSlot block = blocks[i];
  51         heapRootVisitor.visit(block, blockLength);
  52     }
  53     HandleSlot block = blocks[end];
  54     heapRootVisitor.visit(block, m_frame.m_next - block);
  55 }
  56
  57 void HandleStack::grow()
  58 {
  59     HandleSlot block = m_blockStack.grow();
  60     m_frame.m_next = block;
  61     m_frame.m_end = block + m_blockStack.blockLength;
  62 }
  63
  64 }