| OLD | NEW |
| 1 /* | 1 /* |
| 2 Copyright (C) 2005 Apple Inc. All rights reserved. | 2 Copyright (C) 2005 Apple Inc. All rights reserved. |
| 3 | 3 |
| 4 This library is free software; you can redistribute it and/or | 4 This library is free software; you can redistribute it and/or |
| 5 modify it under the terms of the GNU Library General Public | 5 modify it under the terms of the GNU Library General Public |
| 6 License as published by the Free Software Foundation; either | 6 License as published by the Free Software Foundation; either |
| 7 version 2 of the License, or (at your option) any later version. | 7 version 2 of the License, or (at your option) any later version. |
| 8 | 8 |
| 9 This library is distributed in the hope that it will be useful, | 9 This library is distributed in the hope that it will be useful, |
| 10 but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 but WITHOUT ANY WARRANTY; without even the implied warranty of |
| (...skipping 16 matching lines...) Expand all Loading... |
| 27 #if DUMP_HASHTABLE_STATS | 27 #if DUMP_HASHTABLE_STATS |
| 28 | 28 |
| 29 int HashTableStats::numAccesses; | 29 int HashTableStats::numAccesses; |
| 30 int HashTableStats::numCollisions; | 30 int HashTableStats::numCollisions; |
| 31 int HashTableStats::collisionGraph[4096]; | 31 int HashTableStats::collisionGraph[4096]; |
| 32 int HashTableStats::maxCollisions; | 32 int HashTableStats::maxCollisions; |
| 33 int HashTableStats::numRehashes; | 33 int HashTableStats::numRehashes; |
| 34 int HashTableStats::numRemoves; | 34 int HashTableStats::numRemoves; |
| 35 int HashTableStats::numReinserts; | 35 int HashTableStats::numReinserts; |
| 36 | 36 |
| 37 static Mutex& hashTableStatsMutex() | 37 static Mutex& hashTableStatsMutex() { |
| 38 { | 38 AtomicallyInitializedStaticReference(Mutex, mutex, new Mutex); |
| 39 AtomicallyInitializedStaticReference(Mutex, mutex, new Mutex); | 39 return mutex; |
| 40 return mutex; | |
| 41 } | 40 } |
| 42 | 41 |
| 43 void HashTableStats::recordCollisionAtCount(int count) | 42 void HashTableStats::recordCollisionAtCount(int count) { |
| 44 { | 43 MutexLocker lock(hashTableStatsMutex()); |
| 45 MutexLocker lock(hashTableStatsMutex()); | 44 if (count > maxCollisions) |
| 46 if (count > maxCollisions) | 45 maxCollisions = count; |
| 47 maxCollisions = count; | 46 numCollisions++; |
| 48 numCollisions++; | 47 collisionGraph[count]++; |
| 49 collisionGraph[count]++; | |
| 50 } | 48 } |
| 51 | 49 |
| 52 void HashTableStats::dumpStats() | 50 void HashTableStats::dumpStats() { |
| 53 { | 51 MutexLocker lock(hashTableStatsMutex()); |
| 54 MutexLocker lock(hashTableStatsMutex()); | |
| 55 | 52 |
| 56 dataLogF("\nWTF::HashTable statistics\n\n"); | 53 dataLogF("\nWTF::HashTable statistics\n\n"); |
| 57 dataLogF("%d accesses\n", numAccesses); | 54 dataLogF("%d accesses\n", numAccesses); |
| 58 dataLogF("%d total collisions, average %.2f probes per access\n", numCollisi
ons, 1.0 * (numAccesses + numCollisions) / numAccesses); | 55 dataLogF("%d total collisions, average %.2f probes per access\n", numCollision
s, 1.0 * (numAccesses + numCollisions) / numAccesses); |
| 59 dataLogF("longest collision chain: %d\n", maxCollisions); | 56 dataLogF("longest collision chain: %d\n", maxCollisions); |
| 60 for (int i = 1; i <= maxCollisions; i++) { | 57 for (int i = 1; i <= maxCollisions; i++) { |
| 61 dataLogF(" %d lookups with exactly %d collisions (%.2f%% , %.2f%% with
this many or more)\n", collisionGraph[i], i, 100.0 * (collisionGraph[i] - collis
ionGraph[i+1]) / numAccesses, 100.0 * collisionGraph[i] / numAccesses); | 58 dataLogF(" %d lookups with exactly %d collisions (%.2f%% , %.2f%% with this
many or more)\n", collisionGraph[i], i, 100.0 * (collisionGraph[i] - collisionG
raph[i + 1]) / numAccesses, 100.0 * collisionGraph[i] / numAccesses); |
| 62 } | 59 } |
| 63 dataLogF("%d rehashes\n", numRehashes); | 60 dataLogF("%d rehashes\n", numRehashes); |
| 64 dataLogF("%d reinserts\n", numReinserts); | 61 dataLogF("%d reinserts\n", numReinserts); |
| 65 } | 62 } |
| 66 | 63 |
| 67 #endif | 64 #endif |
| 68 | 65 |
| 69 } // namespace WTF | 66 } // namespace WTF |
| OLD | NEW |