9231335eef
TBB has a global task scheduler (that's one of the reason TBB is not
linked statically but dyanmically instead). This allows control over all
running threads, enabling us to use nested parallelism and the scheduler
doing all the task allocation itself.
That is, nested parallel execution such as in
parallel_for(seq, [](const auto& rng){
parallel_sort(rng);
});
is no problem at all, as the scheduler still claims control over the
global environment.
Therefore, use `parallel_sort` Range overload where possible.
References:
- https://www.threadingbuildingblocks.org/docs/help/hh_goto.htm#reference/algorithms.htm
- https://www.threadingbuildingblocks.org/docs/help/hh_goto.htm#reference/algorithms/parallel_sort_func.htm
- https://www.threadingbuildingblocks.org/docs/help/hh_goto.htm#reference/task_scheduler.htm
- https://www.threadingbuildingblocks.org/docs/help/hh_goto.htm#reference/task_scheduler/task_scheduler_init_cls.htm
- https://www.threadingbuildingblocks.org/docs/help/hh_goto.htm#tbb_userguide/Initializing_and_Terminating_the_Library.htm
261 lines
9.4 KiB
C++
261 lines
9.4 KiB
C++
/*
|
|
|
|
Copyright (c) 2015, Project OSRM contributors
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
Redistributions of source code must retain the above copyright notice, this list
|
|
of conditions and the following disclaimer.
|
|
Redistributions in binary form must reproduce the above copyright notice, this
|
|
list of conditions and the following disclaimer in the documentation and/or
|
|
other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#include "../typedefs.h"
|
|
#include "../algorithms/tarjan_scc.hpp"
|
|
#include "../algorithms/coordinate_calculation.hpp"
|
|
#include "../data_structures/dynamic_graph.hpp"
|
|
#include "../data_structures/static_graph.hpp"
|
|
#include "../util/fingerprint.hpp"
|
|
#include "../util/graph_loader.hpp"
|
|
#include "../util/make_unique.hpp"
|
|
#include "../util/osrm_exception.hpp"
|
|
#include "../util/simple_logger.hpp"
|
|
|
|
#include <boost/filesystem.hpp>
|
|
|
|
#if defined(__APPLE__) || defined(_WIN32)
|
|
#include <gdal.h>
|
|
#include <ogrsf_frmts.h>
|
|
#else
|
|
#include <gdal/gdal.h>
|
|
#include <gdal/ogrsf_frmts.h>
|
|
#endif
|
|
|
|
#include <osrm/coordinate.hpp>
|
|
|
|
#include <fstream>
|
|
#include <memory>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
namespace
|
|
{
|
|
|
|
struct TarjanEdgeData
|
|
{
|
|
TarjanEdgeData() : distance(INVALID_EDGE_WEIGHT), name_id(INVALID_NAMEID) {}
|
|
TarjanEdgeData(unsigned distance, unsigned name_id) : distance(distance), name_id(name_id) {}
|
|
unsigned distance;
|
|
unsigned name_id;
|
|
};
|
|
|
|
using TarjanGraph = StaticGraph<TarjanEdgeData>;
|
|
using TarjanEdge = TarjanGraph::InputEdge;
|
|
|
|
void DeleteFileIfExists(const std::string &file_name)
|
|
{
|
|
if (boost::filesystem::exists(file_name))
|
|
{
|
|
boost::filesystem::remove(file_name);
|
|
}
|
|
}
|
|
}
|
|
|
|
std::size_t LoadGraph(const char* path,
|
|
std::vector<QueryNode>& coordinate_list,
|
|
std::vector<TarjanEdge>& graph_edge_list)
|
|
{
|
|
std::ifstream input_stream(path, std::ifstream::in | std::ifstream::binary);
|
|
if (!input_stream.is_open())
|
|
{
|
|
throw osrm::exception("Cannot open osrm file");
|
|
}
|
|
|
|
// load graph data
|
|
std::vector<NodeBasedEdge> edge_list;
|
|
std::vector<NodeID> traffic_light_node_list;
|
|
std::vector<NodeID> barrier_node_list;
|
|
|
|
auto number_of_nodes = loadNodesFromFile(input_stream, barrier_node_list,
|
|
traffic_light_node_list,
|
|
coordinate_list);
|
|
|
|
loadEdgesFromFile(input_stream, edge_list);
|
|
|
|
traffic_light_node_list.clear();
|
|
traffic_light_node_list.shrink_to_fit();
|
|
|
|
// Building an node-based graph
|
|
for (const auto &input_edge : edge_list)
|
|
{
|
|
if (input_edge.source == input_edge.target)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
if (input_edge.forward)
|
|
{
|
|
graph_edge_list.emplace_back(input_edge.source, input_edge.target,
|
|
(std::max)(input_edge.weight, 1), input_edge.name_id);
|
|
}
|
|
if (input_edge.backward)
|
|
{
|
|
graph_edge_list.emplace_back(input_edge.target, input_edge.source,
|
|
(std::max)(input_edge.weight, 1), input_edge.name_id);
|
|
}
|
|
}
|
|
|
|
return number_of_nodes;
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
std::vector<QueryNode> coordinate_list;
|
|
|
|
LogPolicy::GetInstance().Unmute();
|
|
try
|
|
{
|
|
// enable logging
|
|
if (argc < 3)
|
|
{
|
|
SimpleLogger().Write(logWARNING) << "usage:\n" << argv[0]
|
|
<< " <osrm>";
|
|
return -1;
|
|
}
|
|
|
|
SimpleLogger().Write() << "Using restrictions from file: " << argv[2];
|
|
|
|
std::vector<TarjanEdge> graph_edge_list;
|
|
auto number_of_nodes = LoadGraph(argv[1], coordinate_list, graph_edge_list);
|
|
|
|
tbb::parallel_sort(graph_edge_list);
|
|
const auto graph = std::make_shared<TarjanGraph>(number_of_nodes, graph_edge_list);
|
|
graph_edge_list.clear();
|
|
graph_edge_list.shrink_to_fit();
|
|
|
|
SimpleLogger().Write() << "Starting SCC graph traversal";
|
|
|
|
auto tarjan = osrm::make_unique<TarjanSCC<TarjanGraph>>(graph);
|
|
tarjan->run();
|
|
SimpleLogger().Write() << "identified: " << tarjan->get_number_of_components()
|
|
<< " many components";
|
|
SimpleLogger().Write() << "identified " << tarjan->get_size_one_count() << " size 1 SCCs";
|
|
|
|
// output
|
|
TIMER_START(SCC_RUN_SETUP);
|
|
|
|
// remove files from previous run if exist
|
|
DeleteFileIfExists("component.dbf");
|
|
DeleteFileIfExists("component.shx");
|
|
DeleteFileIfExists("component.shp");
|
|
|
|
Percent percentage(graph->GetNumberOfNodes());
|
|
|
|
OGRRegisterAll();
|
|
|
|
const char *pszDriverName = "ESRI Shapefile";
|
|
OGRSFDriver *poDriver =
|
|
OGRSFDriverRegistrar::GetRegistrar()->GetDriverByName(pszDriverName);
|
|
if (nullptr == poDriver)
|
|
{
|
|
throw osrm::exception("ESRI Shapefile driver not available");
|
|
}
|
|
OGRDataSource *poDS = poDriver->CreateDataSource("component.shp", nullptr);
|
|
|
|
if (nullptr == poDS)
|
|
{
|
|
throw osrm::exception("Creation of output file failed");
|
|
}
|
|
|
|
OGRSpatialReference *poSRS = new OGRSpatialReference();
|
|
poSRS->importFromEPSG(4326);
|
|
|
|
OGRLayer *poLayer = poDS->CreateLayer("component", poSRS, wkbLineString, nullptr);
|
|
|
|
if (nullptr == poLayer)
|
|
{
|
|
throw osrm::exception("Layer creation failed.");
|
|
}
|
|
TIMER_STOP(SCC_RUN_SETUP);
|
|
SimpleLogger().Write() << "shapefile setup took " << TIMER_MSEC(SCC_RUN_SETUP) / 1000.
|
|
<< "s";
|
|
|
|
uint64_t total_network_length = 0;
|
|
percentage.reinit(graph->GetNumberOfNodes());
|
|
TIMER_START(SCC_OUTPUT);
|
|
for (const NodeID source : osrm::irange(0u, graph->GetNumberOfNodes()))
|
|
{
|
|
percentage.printIncrement();
|
|
for (const auto current_edge : graph->GetAdjacentEdgeRange(source))
|
|
{
|
|
const TarjanGraph::NodeIterator target = graph->GetTarget(current_edge);
|
|
|
|
if (source < target || SPECIAL_EDGEID == graph->FindEdge(target, source))
|
|
{
|
|
total_network_length +=
|
|
100 * coordinate_calculation::euclidean_distance(
|
|
coordinate_list[source].lat, coordinate_list[source].lon,
|
|
coordinate_list[target].lat, coordinate_list[target].lon);
|
|
|
|
BOOST_ASSERT(current_edge != SPECIAL_EDGEID);
|
|
BOOST_ASSERT(source != SPECIAL_NODEID);
|
|
BOOST_ASSERT(target != SPECIAL_NODEID);
|
|
|
|
const unsigned size_of_containing_component = std::min(
|
|
tarjan->get_component_size(tarjan->get_component_id(source)), tarjan->get_component_size(tarjan->get_component_id(target)));
|
|
|
|
// edges that end on bollard nodes may actually be in two distinct components
|
|
if (size_of_containing_component < 1000)
|
|
{
|
|
OGRLineString lineString;
|
|
lineString.addPoint(coordinate_list[source].lon / COORDINATE_PRECISION,
|
|
coordinate_list[source].lat / COORDINATE_PRECISION);
|
|
lineString.addPoint(coordinate_list[target].lon / COORDINATE_PRECISION,
|
|
coordinate_list[target].lat / COORDINATE_PRECISION);
|
|
|
|
OGRFeature *poFeature = OGRFeature::CreateFeature(poLayer->GetLayerDefn());
|
|
|
|
poFeature->SetGeometry(&lineString);
|
|
if (OGRERR_NONE != poLayer->CreateFeature(poFeature))
|
|
{
|
|
throw osrm::exception("Failed to create feature in shapefile.");
|
|
}
|
|
OGRFeature::DestroyFeature(poFeature);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
OGRSpatialReference::DestroySpatialReference(poSRS);
|
|
OGRDataSource::DestroyDataSource(poDS);
|
|
TIMER_STOP(SCC_OUTPUT);
|
|
SimpleLogger().Write() << "generating output took: " << TIMER_MSEC(SCC_OUTPUT) / 1000.
|
|
<< "s";
|
|
|
|
SimpleLogger().Write() << "total network distance: "
|
|
<< static_cast<uint64_t>(total_network_length / 100 / 1000.)
|
|
<< " km";
|
|
|
|
SimpleLogger().Write() << "finished component analysis";
|
|
}
|
|
catch (const std::exception &e)
|
|
{
|
|
SimpleLogger().Write(logWARNING) << "[exception] " << e.what();
|
|
}
|
|
return 0;
|
|
}
|