| 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 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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) \ | 136 H(Node) \ |
| 137 H(CSSValue) | 137 H(CSSValueObject) |
| 138 | 138 |
| 139 #define TypedHeapEnumName(Type) Type##HeapIndex, | 139 #define TypedHeapEnumName(Type) Type##HeapIndex, |
| 140 | 140 |
| 141 #if ENABLE(GC_PROFILING) | 141 #if ENABLE(GC_PROFILING) |
| 142 const size_t numberOfGenerationsToTrack = 8; | 142 const size_t numberOfGenerationsToTrack = 8; |
| 143 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; | 143 const size_t maxHeapObjectAge = numberOfGenerationsToTrack - 1; |
| 144 | 144 |
| 145 struct AgeCounts { | 145 struct AgeCounts { |
| 146 int ages[numberOfGenerationsToTrack]; | 146 int ages[numberOfGenerationsToTrack]; |
| 147 AgeCounts() { std::fill(ages, ages + numberOfGenerationsToTrack, 0); } | 147 AgeCounts() { std::fill(ages, ages + numberOfGenerationsToTrack, 0); } |
| (...skipping 636 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 784 }; | 784 }; |
| 785 | 785 |
| 786 template<> class ThreadStateFor<AnyThread> { | 786 template<> class ThreadStateFor<AnyThread> { |
| 787 public: | 787 public: |
| 788 static ThreadState* state() { return ThreadState::current(); } | 788 static ThreadState* state() { return ThreadState::current(); } |
| 789 }; | 789 }; |
| 790 | 790 |
| 791 } // namespace blink | 791 } // namespace blink |
| 792 | 792 |
| 793 #endif // ThreadState_h | 793 #endif // ThreadState_h |
| OLD | NEW |