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 19 matching lines...) Expand all Loading... |
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 "wtf/Allocator.h" |
37 | 37 |
38 namespace blink { | 38 namespace blink { |
39 | 39 |
| 40 // HeapLinkedStack<> is an Oilpan-managed stack that avoids pre-allocation |
| 41 // of memory and heap fragmentation. |
| 42 // |
| 43 // The API was originally implemented on the call stack by LinkedStack<> |
| 44 // (now removed: https://codereview.chromium.org/2761853003/). |
| 45 // See https://codereview.chromium.org/17314010 for the original use-case. |
40 template <typename T> | 46 template <typename T> |
41 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T>> { | 47 class HeapLinkedStack : public GarbageCollected<HeapLinkedStack<T>> { |
42 public: | 48 public: |
43 HeapLinkedStack() : m_size(0) {} | 49 HeapLinkedStack() : m_size(0) {} |
44 | 50 |
45 bool isEmpty(); | 51 bool isEmpty(); |
46 | 52 |
47 void push(const T&); | 53 void push(const T&); |
48 const T& peek(); | 54 const T& peek(); |
49 void pop(); | 55 void pop(); |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
106 class TraceEagerlyTrait<HeapLinkedStack<T>> { | 112 class TraceEagerlyTrait<HeapLinkedStack<T>> { |
107 STATIC_ONLY(TraceEagerlyTrait); | 113 STATIC_ONLY(TraceEagerlyTrait); |
108 | 114 |
109 public: | 115 public: |
110 static const bool value = TraceEagerlyTrait<T>::value; | 116 static const bool value = TraceEagerlyTrait<T>::value; |
111 }; | 117 }; |
112 | 118 |
113 } // namespace blink | 119 } // namespace blink |
114 | 120 |
115 #endif // HeapLinkedStack_h | 121 #endif // HeapLinkedStack_h |
OLD | NEW |