2016-01-02 11:13:44 -05:00
|
|
|
#include "engine/search_engine_data.hpp"
|
2013-06-24 14:11:53 -04:00
|
|
|
|
2016-01-02 11:13:44 -05:00
|
|
|
#include "util/binary_heap.hpp"
|
2014-06-11 06:25:57 -04:00
|
|
|
|
2016-01-05 10:51:13 -05:00
|
|
|
namespace osrm
|
|
|
|
{
|
|
|
|
namespace engine
|
|
|
|
{
|
|
|
|
|
2016-01-28 10:28:44 -05:00
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::forward_heap_1;
|
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::reverse_heap_1;
|
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::forward_heap_2;
|
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::reverse_heap_2;
|
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::forward_heap_3;
|
|
|
|
SearchEngineData::SearchEngineHeapPtr SearchEngineData::reverse_heap_3;
|
|
|
|
|
2014-03-17 09:55:33 -04:00
|
|
|
void SearchEngineData::InitializeOrClearFirstThreadLocalStorage(const unsigned number_of_nodes)
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
if (forward_heap_1.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_1->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_1.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
|
|
|
|
2015-03-02 05:55:55 -05:00
|
|
|
if (reverse_heap_1.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_1->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_1.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
|
|
|
|
2014-03-17 09:55:33 -04:00
|
|
|
void SearchEngineData::InitializeOrClearSecondThreadLocalStorage(const unsigned number_of_nodes)
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
if (forward_heap_2.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_2->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_2.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
|
|
|
|
2015-03-02 05:55:55 -05:00
|
|
|
if (reverse_heap_2.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_2->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_2.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
|
|
|
|
2014-03-17 09:55:33 -04:00
|
|
|
void SearchEngineData::InitializeOrClearThirdThreadLocalStorage(const unsigned number_of_nodes)
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
if (forward_heap_3.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_3->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
forward_heap_3.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
|
|
|
|
2015-03-02 05:55:55 -05:00
|
|
|
if (reverse_heap_3.get())
|
2014-03-17 09:55:33 -04:00
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_3->Clear();
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2014-03-17 09:55:33 -04:00
|
|
|
else
|
|
|
|
{
|
2015-03-02 05:55:55 -05:00
|
|
|
reverse_heap_3.reset(new QueryHeap(number_of_nodes));
|
2014-03-17 09:55:33 -04:00
|
|
|
}
|
2013-06-24 14:11:53 -04:00
|
|
|
}
|
2016-01-05 10:51:13 -05:00
|
|
|
}
|
|
|
|
}
|