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 118 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
129 #define WILL_BE_USING_PRE_FINALIZER(Class, method) | 129 #define WILL_BE_USING_PRE_FINALIZER(Class, method) |
130 #endif | 130 #endif |
131 | 131 |
132 // List of typed heaps. The list is used to generate the implementation | 132 // List of typed heaps. The list is used to generate the implementation |
133 // of typed heap related methods. | 133 // of typed heap related methods. |
134 // | 134 // |
135 // To create a new typed heap add a H(<ClassName>) to the | 135 // To create a new typed heap add a H(<ClassName>) to the |
136 // FOR_EACH_TYPED_HEAP macro below. | 136 // FOR_EACH_TYPED_HEAP macro below. |
137 #define FOR_EACH_TYPED_HEAP(H) \ | 137 #define FOR_EACH_TYPED_HEAP(H) \ |
138 H(Node) \ | 138 H(Node) \ |
139 H(CSSValue) | 139 H(CSSValueObject) |
140 | 140 |
141 #define TypedHeapEnumName(Type) Type##HeapIndex, | 141 #define TypedHeapEnumName(Type) Type##HeapIndex, |
142 | 142 |
143 #if ENABLE(GC_PROFILING) | 143 #if ENABLE(GC_PROFILING) |
144 const size_t numberOfGenerationsToTrack = 8; | 144 const size_t numberOfGenerationsToTrack = 8; |
145 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; | 145 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; |
146 | 146 |
147 struct AgeCounts { | 147 struct AgeCounts { |
148 int ages[numberOfGenerationsToTrack]; | 148 int ages[numberOfGenerationsToTrack]; |
149 AgeCounts() { std::fill(ages, ages + numberOfGenerationsToTrack, 0); } | 149 AgeCounts() { std::fill(ages, ages + numberOfGenerationsToTrack, 0); } |
(...skipping 641 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
791 }; | 791 }; |
792 | 792 |
793 template<> class ThreadStateFor<AnyThread> { | 793 template<> class ThreadStateFor<AnyThread> { |
794 public: | 794 public: |
795 static ThreadState* state() { return ThreadState::current(); } | 795 static ThreadState* state() { return ThreadState::current(); } |
796 }; | 796 }; |
797 | 797 |
798 } // namespace blink | 798 } // namespace blink |
799 | 799 |
800 #endif // ThreadState_h | 800 #endif // ThreadState_h |
OLD | NEW |