Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Map leaf nodes to RAM and iterate over them potentially in parallel

Browse Source
This commit is contained in:
Daniel J. Hofmann 2016-05-17 15:09:54 -04:00 committed by Patrick Niklaus
parent 9d7714c714
commit d9a5c79ea6
No known key found for this signature in database
GPG Key ID: E426891B5F978B1B
1 changed files with 16 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
src/contractor/contractor.cpp
View File

@ -21,10 +21,13 @@
#include <boost/assert.hpp> #include <boost/assert.hpp>
#include <boost/filesystem/fstream.hpp> #include <boost/filesystem/fstream.hpp>
#include <boost/functional/hash.hpp> #include <boost/functional/hash.hpp>
#include <boost/interprocess/file_mapping.hpp>
#include <boost/interprocess/mapped_region.hpp>
#include <tbb/blocked_range.h> #include <tbb/blocked_range.h>
#include <tbb/concurrent_unordered_map.h> #include <tbb/concurrent_unordered_map.h>
#include <tbb/parallel_for.h> #include <tbb/parallel_for.h>
#include <tbb/parallel_for_each.h>
#include <tbb/parallel_invoke.h> #include <tbb/parallel_invoke.h>
#include <tbb/parallel_sort.h> #include <tbb/parallel_sort.h>
@ -363,23 +366,22 @@ std::size_t Contractor::LoadEdgeExpandedGraph(
// update the RTree itself, we just use the leaf nodes to iterate over all segments) // update the RTree itself, we just use the leaf nodes to iterate over all segments)
using LeafNode = util::StaticRTree<extractor::EdgeBasedNode>::LeafNode; using LeafNode = util::StaticRTree<extractor::EdgeBasedNode>::LeafNode;
std::ifstream leaf_node_file(rtree_leaf_filename, using boost::interprocess::file_mapping;
std::ios::binary | std::ios::in | std::ios::ate); using boost::interprocess::mapped_region;
if (!leaf_node_file) using boost::interprocess::read_only;
{
throw util::exception("Failed to open " + rtree_leaf_filename);
}
std::size_t leaf_nodes_count = leaf_node_file.tellg() / sizeof(LeafNode);
leaf_node_file.seekg(0, std::ios::beg);
LeafNode current_node; const file_mapping mapping{rtree_leaf_filename.c_str(), read_only};
for(; leaf_nodes_count > 0; --leaf_nodes_count) mapped_region region{mapping, read_only};
{ region.advise(mapped_region::advice_willneed);
leaf_node_file.read(reinterpret_cast<char *>(&current_node), sizeof(current_node));
const auto bytes = region.get_size();
const auto first = static_cast<const LeafNode *>(region.get_address());
const auto last = first + (bytes / sizeof(LeafNode));
tbb::parallel_for_each(first, last, [&](const LeafNode &current_node) {
for (size_t i = 0; i < current_node.object_count; i++) for (size_t i = 0; i < current_node.object_count; i++)
{ {
auto &leaf_object = current_node.objects[i]; const auto &leaf_object = current_node.objects[i];
extractor::QueryNode *u; extractor::QueryNode *u;
extractor::QueryNode *v; extractor::QueryNode *v;
@ -465,7 +467,7 @@ std::size_t Contractor::LoadEdgeExpandedGraph(
} }
} }
} }
} }); // parallel_for_each
} }
const auto maybe_save_geometries = [&] { const auto maybe_save_geometries = [&] {