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 2390 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2401 struct GCInfoTrait<HeapLinkedHashSet<T, U, V> > : public GCInfoTrait<LinkedHashS
et<T, U, V, HeapAllocator> > { }; | 2401 struct GCInfoTrait<HeapLinkedHashSet<T, U, V> > : public GCInfoTrait<LinkedHashS
et<T, U, V, HeapAllocator> > { }; |
2402 template<typename T, size_t inlineCapacity, typename U> | 2402 template<typename T, size_t inlineCapacity, typename U> |
2403 struct GCInfoTrait<HeapListHashSet<T, inlineCapacity, U> > : public GCInfoTrait<
ListHashSet<T, inlineCapacity, U, HeapListHashSetAllocator<T, inlineCapacity> >
> { }; | 2403 struct GCInfoTrait<HeapListHashSet<T, inlineCapacity, U> > : public GCInfoTrait<
ListHashSet<T, inlineCapacity, U, HeapListHashSetAllocator<T, inlineCapacity> >
> { }; |
2404 template<typename T, size_t inlineCapacity> | 2404 template<typename T, size_t inlineCapacity> |
2405 struct GCInfoTrait<HeapVector<T, inlineCapacity> > : public GCInfoTrait<Vector<T
, inlineCapacity, HeapAllocator> > { }; | 2405 struct GCInfoTrait<HeapVector<T, inlineCapacity> > : public GCInfoTrait<Vector<T
, inlineCapacity, HeapAllocator> > { }; |
2406 template<typename T, size_t inlineCapacity> | 2406 template<typename T, size_t inlineCapacity> |
2407 struct GCInfoTrait<HeapDeque<T, inlineCapacity> > : public GCInfoTrait<Deque<T,
inlineCapacity, HeapAllocator> > { }; | 2407 struct GCInfoTrait<HeapDeque<T, inlineCapacity> > : public GCInfoTrait<Deque<T,
inlineCapacity, HeapAllocator> > { }; |
2408 template<typename T, typename U, typename V> | 2408 template<typename T, typename U, typename V> |
2409 struct GCInfoTrait<HeapHashCountedSet<T, U, V> > : public GCInfoTrait<HashCounte
dSet<T, U, V, HeapAllocator> > { }; | 2409 struct GCInfoTrait<HeapHashCountedSet<T, U, V> > : public GCInfoTrait<HashCounte
dSet<T, U, V, HeapAllocator> > { }; |
2410 | 2410 |
2411 template<typename T> | |
2412 struct IfWeakMember; | |
2413 | |
2414 template<typename T> | |
2415 struct IfWeakMember { | |
2416 template<typename U> | |
2417 static bool isDead(Visitor*, const U&) { return false; } | |
2418 }; | |
2419 | |
2420 template<typename T> | |
2421 struct IfWeakMember<WeakMember<T> > { | |
2422 static bool isDead(Visitor* visitor, const WeakMember<T>& t) { return !visit
or->isAlive(t.get()); } | |
2423 }; | |
2424 | |
2425 } // namespace blink | 2411 } // namespace blink |
2426 | 2412 |
2427 #endif // Heap_h | 2413 #endif // Heap_h |
OLD | NEW |