OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #ifndef MemoryInstrumentationHashSet_h | |
32 #define MemoryInstrumentationHashSet_h | |
33 | |
34 #include <wtf/HashSet.h> | |
35 #include <wtf/MemoryInstrumentationSequence.h> | |
36 | |
37 namespace WTF { | |
38 | |
39 template<typename ValueArg, typename HashArg, typename TraitsArg> | |
40 void reportMemoryUsage(const HashSet<ValueArg, HashArg, TraitsArg>* hashSet, Mem
oryObjectInfo* memoryObjectInfo) | |
41 { | |
42 MemoryClassInfo info(memoryObjectInfo, hashSet); | |
43 info.addPrivateBuffer(sizeof(typename HashTable<ValueArg, ValueArg, Identity
Extractor, HashArg, TraitsArg, TraitsArg>::ValueType) * hashSet->capacity(), 0,
"ValueType[]", "data"); | |
44 SequenceMemoryInstrumentationTraits<ValueArg>::reportMemoryUsage(hashSet->be
gin(), hashSet->end(), info); | |
45 } | |
46 | |
47 } | |
48 | |
49 #endif // !defined(MemoryInstrumentationHashSet_h) | |
OLD | NEW |