| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef HeapLinkedStack_h | 31 #ifndef HeapLinkedStack_h |
| 32 #define HeapLinkedStack_h | 32 #define HeapLinkedStack_h |
| 33 | 33 |
| 34 #include "platform/heap/Heap.h" | 34 #include "platform/heap/Heap.h" |
| 35 #include "platform/heap/Visitor.h" | 35 #include "platform/heap/Visitor.h" |
| 36 #include "wtf/Allocator.h" | 36 #include "platform/wtf/Allocator.h" |
| 37 | 37 |
| 38 namespace blink { | 38 namespace blink { |
| 39 | 39 |
| 40 // HeapLinkedStack<> is an Oilpan-managed stack that avoids pre-allocation | 40 // HeapLinkedStack<> is an Oilpan-managed stack that avoids pre-allocation |
| 41 // of memory and heap fragmentation. | 41 // of memory and heap fragmentation. |
| 42 // | 42 // |
| 43 // The API was originally implemented on the call stack by LinkedStack<> | 43 // The API was originally implemented on the call stack by LinkedStack<> |
| 44 // (now removed: https://codereview.chromium.org/2761853003/). | 44 // (now removed: https://codereview.chromium.org/2761853003/). |
| 45 // See https://codereview.chromium.org/17314010 for the original use-case. | 45 // See https://codereview.chromium.org/17314010 for the original use-case. |
| 46 template <typename T> | 46 template <typename T> |
| (...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 112 class TraceEagerlyTrait<HeapLinkedStack<T>> { | 112 class TraceEagerlyTrait<HeapLinkedStack<T>> { |
| 113 STATIC_ONLY(TraceEagerlyTrait); | 113 STATIC_ONLY(TraceEagerlyTrait); |
| 114 | 114 |
| 115 public: | 115 public: |
| 116 static const bool value = TraceEagerlyTrait<T>::value; | 116 static const bool value = TraceEagerlyTrait<T>::value; |
| 117 }; | 117 }; |
| 118 | 118 |
| 119 } // namespace blink | 119 } // namespace blink |
| 120 | 120 |
| 121 #endif // HeapLinkedStack_h | 121 #endif // HeapLinkedStack_h |
| OLD | NEW |