Manuel Ung e63350e726 Use more efficient hash map for deadlock detection
Summary:
Currently, deadlock cycles are held in std::unordered_map. The problem with it is that it allocates/deallocates memory on every insertion/deletion. This limits throughput since we're doing this expensive operation while holding a global mutex. Fix this by using a vector which caches memory instead.

Running the deadlock stress test, this change increased throughput from 39k txns/s -> 49k txns/s. The effect is more noticeable in MyRocks.
Closes https://github.com/facebook/rocksdb/pull/1545

Differential Revision: D4205662

Pulled By: lth

fbshipit-source-id: ff990e4
2016-11-19 11:39:15 -08:00
..
2016-08-19 12:28:19 -07:00
2016-08-31 08:56:34 -07:00
2016-08-19 12:28:19 -07:00
2016-11-14 22:54:17 -08:00
2016-09-13 12:08:22 -07:00
2016-05-06 17:42:50 -07:00
2016-03-11 22:56:25 -08:00
2016-03-15 11:38:15 -07:00
2016-11-09 15:09:18 -08:00
2016-02-17 20:22:40 +08:00
2016-10-29 16:09:18 -07:00
2016-09-01 13:50:39 -07:00
2016-09-01 13:50:39 -07:00
2016-06-10 16:37:36 -07:00
2016-04-01 11:06:06 -07:00
2016-09-02 17:10:28 -07:00