/src/3rdparty/webkit/Source/JavaScriptCore/heap/HandleStack.cpp

https://bitbucket.org/ultra_iter/qt-vtl · C++ · 63 lines · 30 code · 9 blank · 24 comment · 1 complexity · e3576e07603a107d827901e4ac906c98 MD5 · raw file

  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. #include "config.h"
  26. #include "HandleStack.h"
  27. #include "MarkStack.h"
  28. namespace JSC {
  29. HandleStack::HandleStack()
  30. #ifndef NDEBUG
  31. : m_scopeDepth(0)
  32. #endif
  33. {
  34. grow();
  35. }
  36. void HandleStack::mark(HeapRootVisitor& heapRootMarker)
  37. {
  38. const Vector<HandleSlot>& blocks = m_blockStack.blocks();
  39. size_t blockLength = m_blockStack.blockLength;
  40. int end = blocks.size() - 1;
  41. for (int i = 0; i < end; ++i) {
  42. HandleSlot block = blocks[i];
  43. heapRootMarker.mark(block, blockLength);
  44. }
  45. HandleSlot block = blocks[end];
  46. heapRootMarker.mark(block, m_frame.m_next - block);
  47. }
  48. void HandleStack::grow()
  49. {
  50. HandleSlot block = m_blockStack.grow();
  51. m_frame.m_next = block;
  52. m_frame.m_end = block + m_blockStack.blockLength;
  53. }
  54. }