markus/lifo-dijkstraserv
1
0
Fork 0
Code Issues 3 Pull Requests Releases Wiki Activity

Handle possible NULL-pointers for paths when rehashing the route

Browse Source
This commit is contained in:
Markus Koch 2021-03-13 12:08:43 +01:00
parent 50c39a52bb
commit b12da0e421
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/dijkstrasearch.c
View File

@ -254,6 +254,14 @@ int dijkstra_search_route_to_geojson(struct dijkstra_search *search,
if (node_last) { if (node_last) {
path_to_this = search->states[node_last->uid]->cheapest_path; path_to_this = search->states[node_last->uid]->cheapest_path;
path_to_next = search->states[node->uid]->cheapest_path; path_to_next = search->states[node->uid]->cheapest_path;
if (!path_to_next) {
report(LL_CRITICAL, "INTERNAL ERROR: path_to_next is NULL");
break;
}
if (!path_to_this) {
// This happens at the very beginning.
path_to_this = path_to_next; // Pretend we were already where we started.
}
heading = atan2f((node->position.y - node_last->position.y), (node->position.x - node_last->position.x)) / (M_PI * 2) * 360; heading = atan2f((node->position.y - node_last->position.y), (node->position.x - node_last->position.x)) / (M_PI * 2) * 360;
if (heading < 0.0) if (heading < 0.0)