| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_SPACES_H_ | 5 #ifndef V8_SPACES_H_ |
| 6 #define V8_SPACES_H_ | 6 #define V8_SPACES_H_ |
| 7 | 7 |
| 8 #include "src/allocation.h" | 8 #include "src/allocation.h" |
| 9 #include "src/base/atomicops.h" | 9 #include "src/base/atomicops.h" |
| 10 #include "src/hashmap.h" | 10 #include "src/hashmap.h" |
| (...skipping 1985 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1996 | 1996 |
| 1997 // Expands the space by allocating a fixed number of pages. Returns false if | 1997 // Expands the space by allocating a fixed number of pages. Returns false if |
| 1998 // it cannot allocate requested number of pages from OS, or if the hard heap | 1998 // it cannot allocate requested number of pages from OS, or if the hard heap |
| 1999 // size limit has been hit. | 1999 // size limit has been hit. |
| 2000 bool Expand(); | 2000 bool Expand(); |
| 2001 | 2001 |
| 2002 // Generic fast case allocation function that tries linear allocation at the | 2002 // Generic fast case allocation function that tries linear allocation at the |
| 2003 // address denoted by top in allocation_info_. | 2003 // address denoted by top in allocation_info_. |
| 2004 inline HeapObject* AllocateLinearly(int size_in_bytes); | 2004 inline HeapObject* AllocateLinearly(int size_in_bytes); |
| 2005 | 2005 |
| 2006 MUST_USE_RESULT HeapObject* |
| 2007 WaitForSweeperThreadsAndRetryAllocation(int size_in_bytes); |
| 2008 |
| 2006 // Slow path of AllocateRaw. This function is space-dependent. | 2009 // Slow path of AllocateRaw. This function is space-dependent. |
| 2007 MUST_USE_RESULT virtual HeapObject* SlowAllocateRaw(int size_in_bytes); | 2010 MUST_USE_RESULT HeapObject* SlowAllocateRaw(int size_in_bytes); |
| 2008 | 2011 |
| 2009 friend class PageIterator; | 2012 friend class PageIterator; |
| 2010 friend class MarkCompactCollector; | 2013 friend class MarkCompactCollector; |
| 2011 }; | 2014 }; |
| 2012 | 2015 |
| 2013 | 2016 |
| 2014 class NumberAndSizeInfo BASE_EMBEDDED { | 2017 class NumberAndSizeInfo BASE_EMBEDDED { |
| 2015 public: | 2018 public: |
| 2016 NumberAndSizeInfo() : number_(0), bytes_(0) {} | 2019 NumberAndSizeInfo() : number_(0), bytes_(0) {} |
| 2017 | 2020 |
| (...skipping 982 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3000 } | 3003 } |
| 3001 // Must be small, since an iteration is used for lookup. | 3004 // Must be small, since an iteration is used for lookup. |
| 3002 static const int kMaxComments = 64; | 3005 static const int kMaxComments = 64; |
| 3003 }; | 3006 }; |
| 3004 #endif | 3007 #endif |
| 3005 | 3008 |
| 3006 | 3009 |
| 3007 } } // namespace v8::internal | 3010 } } // namespace v8::internal |
| 3008 | 3011 |
| 3009 #endif // V8_SPACES_H_ | 3012 #endif // V8_SPACES_H_ |
| OLD | NEW |