OLD | NEW |
| (Empty) |
1 /* | |
2 Copyright (C) 2005 Apple Inc. All rights reserved. | |
3 | |
4 This library is free software; you can redistribute it and/or | |
5 modify it under the terms of the GNU Library General Public | |
6 License as published by the Free Software Foundation; either | |
7 version 2 of the License, or (at your option) any later version. | |
8 | |
9 This library is distributed in the hope that it will be useful, | |
10 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
12 Library General Public License for more details. | |
13 | |
14 You should have received a copy of the GNU Library General Public License | |
15 along with this library; see the file COPYING.LIB. If not, write to | |
16 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | |
17 Boston, MA 02110-1301, USA. | |
18 */ | |
19 | |
20 #include "wtf/HashTable.h" | |
21 | |
22 #if DUMP_HASHTABLE_STATS | |
23 | |
24 #include "wtf/DataLog.h" | |
25 #include "wtf/ThreadingPrimitives.h" | |
26 | |
27 namespace WTF { | |
28 | |
29 static Mutex& hashTableStatsMutex() { | |
30 DEFINE_THREAD_SAFE_STATIC_LOCAL(Mutex, mutex, new Mutex); | |
31 return mutex; | |
32 } | |
33 | |
34 HashTableStats& HashTableStats::instance() { | |
35 DEFINE_THREAD_SAFE_STATIC_LOCAL(HashTableStats, stats, new HashTableStats); | |
36 return stats; | |
37 } | |
38 | |
39 void HashTableStats::copy(const HashTableStats* other) { | |
40 numAccesses = other->numAccesses; | |
41 numRehashes = other->numRehashes; | |
42 numRemoves = other->numRemoves; | |
43 numReinserts = other->numReinserts; | |
44 | |
45 maxCollisions = other->maxCollisions; | |
46 numCollisions = other->numCollisions; | |
47 memcpy(collisionGraph, other->collisionGraph, sizeof(collisionGraph)); | |
48 } | |
49 | |
50 void HashTableStats::recordCollisionAtCount(int count) { | |
51 // The global hash table singleton needs to be atomically updated. | |
52 bool isGlobalSingleton = this == &instance(); | |
53 if (isGlobalSingleton) | |
54 hashTableStatsMutex().lock(); | |
55 | |
56 if (count > maxCollisions) | |
57 maxCollisions = count; | |
58 numCollisions++; | |
59 collisionGraph[count]++; | |
60 | |
61 if (isGlobalSingleton) | |
62 hashTableStatsMutex().unlock(); | |
63 } | |
64 | |
65 void HashTableStats::dumpStats() { | |
66 // Lock the global hash table singleton while dumping. | |
67 bool isGlobalSingleton = this == &instance(); | |
68 if (isGlobalSingleton) | |
69 hashTableStatsMutex().lock(); | |
70 | |
71 dataLogF("\nWTF::HashTable statistics\n\n"); | |
72 dataLogF("%d accesses\n", numAccesses); | |
73 dataLogF("%d total collisions, average %.2f probes per access\n", | |
74 numCollisions, 1.0 * (numAccesses + numCollisions) / numAccesses); | |
75 dataLogF("longest collision chain: %d\n", maxCollisions); | |
76 for (int i = 1; i <= maxCollisions; i++) { | |
77 dataLogF( | |
78 " %d lookups with exactly %d collisions (%.2f%% , %.2f%% with this " | |
79 "many or more)\n", | |
80 collisionGraph[i], i, | |
81 100.0 * (collisionGraph[i] - collisionGraph[i + 1]) / numAccesses, | |
82 100.0 * collisionGraph[i] / numAccesses); | |
83 } | |
84 dataLogF("%d rehashes\n", numRehashes); | |
85 dataLogF("%d reinserts\n", numReinserts); | |
86 | |
87 if (isGlobalSingleton) | |
88 hashTableStatsMutex().unlock(); | |
89 } | |
90 | |
91 } // namespace WTF | |
92 | |
93 #endif | |
OLD | NEW |