OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
126 #else | 126 #else |
127 #define WILL_BE_USING_PRE_FINALIZER(Class, method) | 127 #define WILL_BE_USING_PRE_FINALIZER(Class, method) |
128 #endif | 128 #endif |
129 | 129 |
130 // List of typed heaps. The list is used to generate the implementation | 130 // List of typed heaps. The list is used to generate the implementation |
131 // of typed heap related methods. | 131 // of typed heap related methods. |
132 // | 132 // |
133 // To create a new typed heap add a H(<ClassName>) to the | 133 // To create a new typed heap add a H(<ClassName>) to the |
134 // FOR_EACH_TYPED_HEAP macro below. | 134 // FOR_EACH_TYPED_HEAP macro below. |
135 #define FOR_EACH_TYPED_HEAP(H) \ | 135 #define FOR_EACH_TYPED_HEAP(H) \ |
136 H(Node) \ | |
137 H(CSSValue) | 136 H(CSSValue) |
138 | 137 |
139 #define TypedHeapEnumName(Type) Type##HeapIndex, | 138 #define TypedHeapEnumName(Type) Type##HeapIndex, |
140 | 139 |
141 #if ENABLE(GC_PROFILING) | 140 #if ENABLE(GC_PROFILING) |
142 const size_t numberOfGenerationsToTrack = 8; | 141 const size_t numberOfGenerationsToTrack = 8; |
143 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; | 142 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; |
144 | 143 |
145 struct AgeCounts { | 144 struct AgeCounts { |
146 int ages[numberOfGenerationsToTrack]; | 145 int ages[numberOfGenerationsToTrack]; |
(...skipping 678 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
825 }; | 824 }; |
826 | 825 |
827 template<> class ThreadStateFor<AnyThread> { | 826 template<> class ThreadStateFor<AnyThread> { |
828 public: | 827 public: |
829 static ThreadState* state() { return ThreadState::current(); } | 828 static ThreadState* state() { return ThreadState::current(); } |
830 }; | 829 }; |
831 | 830 |
832 } // namespace blink | 831 } // namespace blink |
833 | 832 |
834 #endif // ThreadState_h | 833 #endif // ThreadState_h |
OLD | NEW |