Open GoogleCodeExporter opened 9 years ago
[deleted comment]
in TableCache::FindTable
*handle = cache_->Lookup(key);
..............
*handle = cache_->Insert(key, tf, 1, &DeleteEntry);
if there are two threads A, and B,they Get the same key,
A lookup(key) failed ,but haven't Insert(key)in cache_,
B lookup(key) failed also, but when B Insert(key) ,A has Insert(key) already.
so, when program free the memory ,there is an error。
does the time between lookup(key)and insert(key) need a lock?
Original comment by veryd...@gmail.com
on 27 Mar 2014 at 8:46
Original issue reported on code.google.com by
jovec...@gmail.com
on 1 Mar 2014 at 3:26