2 * Navit, a modular navigation system.
3 * Copyright (C) 2005-2008 Navit Team
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * version 2 as published by the Free Software Foundation.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the
16 * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
17 * Boston, MA 02110-1301, USA.
21 * @brief Contains code related to finding a route from a position to a destination
23 * Routing uses segments, points and items. Items are items from the map: Streets, highways, etc.
24 * Segments represent such items, or parts of it. Generally, a segment is a driveable path. An item
25 * can be represented by more than one segment - in that case it is "segmented". Each segment has an
26 * "offset" associated, that indicates at which position in a segmented item this segment is - a
27 * segment representing a not-segmented item always has the offset 1.
28 * A point is located at the end of segments, often connecting several segments.
30 * The code in this file will make navit find a route between a position and a destination.
31 * It accomplishes this by first building a "route graph". This graph contains segments and
34 * After building this graph in route_graph_build(), the function route_graph_flood() assigns every
35 * point and segment a "value" which represents the "costs" of traveling from this point to the
36 * destination. This is done by Dijkstra's algorithm.
38 * When the graph is built a "route path" is created, which is a path in this graph from a given
39 * position to the destination determined at time of building the graph.
56 #include "projection.h"
64 #include "transform.h"
76 * @brief A point in the route graph
78 * This represents a point in the route graph. A point usually connects two or more segments,
79 * but there are also points which don't do that (e.g. at the end of a dead-end).
81 struct route_graph_point {
82 struct route_graph_point *next; /**< Linked-list pointer to a list of all route_graph_points */
83 struct route_graph_point *hash_next; /**< Pointer to a chained hashlist of all route_graph_points with this hash */
84 struct route_graph_segment *start; /**< Pointer to a list of segments of which this point is the start. The links
85 * of this linked-list are in route_graph_segment->start_next.*/
86 struct route_graph_segment *end; /**< Pointer to a list of segments of which this pointer is the end. The links
87 * of this linked-list are in route_graph_segment->end_next. */
88 struct route_graph_segment *seg; /**< Pointer to the segment one should use to reach the destination at
90 struct fibheap_el *el; /**< When this point is put on a Fibonacci heap, this is a pointer
91 * to this point's heap-element */
92 int value; /**< The cost at which one can reach the destination from this point on */
93 struct coord c; /**< Coordinates of this point */
97 * @brief A segment in the route graph
99 * This is a segment in the route graph. A segment represents a driveable way.
101 struct route_graph_segment {
102 struct route_graph_segment *next; /**< Linked-list pointer to a list of all route_graph_segments */
103 struct route_graph_segment *start_next; /**< Pointer to the next element in the list of segments that start at the
104 * same point. Start of this list is in route_graph_point->start. */
105 struct route_graph_segment *end_next; /**< Pointer to the next element in the list of segments that end at the
106 * same point. Start of this list is in route_graph_point->end. */
107 struct route_graph_point *start; /**< Pointer to the point this segment starts at. */
108 struct route_graph_point *end; /**< Pointer to the point this segment ends at. */
109 struct item item; /**< The item (e.g. street) that this segment represents. */
111 int len; /**< Length of this segment */
112 int offset; /**< If the item represented by this segment is "segmented" (i.e.
113 * is represented by several segments instead of just one), this
114 * indicates the position of this segment in the item - for items
115 * that are not segmented this should always be 1 */
119 * @brief A segment in the route path
121 * This is a segment in the route path.
123 struct route_path_segment {
124 struct route_path_segment *next; /**< Pointer to the next segment in the path */
125 struct item item; /**< The item (e.g. street) this segment represents */
126 int length; /**< Length of the segment */
127 int offset; /**< Same as in route_graph_segment->offset */
128 int direction; /**< Order in which the coordinates are ordered. >0 means "First
129 * coordinate of the segment is the first coordinate of the item", <=0
131 unsigned ncoords; /**< How many coordinates does this segment have? */
132 struct coord c[0]; /**< Pointer to the ncoords coordinates of this segment */
133 /* WARNING: There will be coordinates following here, so do not create new fields after c! */
137 * @brief Usually represents a destination or position
139 * This struct usually represents a destination or position
142 struct coord c; /**< The actual destination / position */
143 struct coord lp; /**< The nearest point on a street to c */
144 int pos; /**< The position of lp within the coords of the street */
145 int lenpos; /**< Distance between lp and the end of the street */
146 int lenneg; /**< Distance between lp and the start of the street */
147 int lenextra; /**< Distance between lp and c */
149 struct street_data *street; /**< The street lp is on */
153 * @brief A complete route path
155 * This structure describes a whole routing path
158 struct route_path_segment *path; /**< The first segment in the path, i.e. the segment one should
160 struct route_path_segment *path_last; /**< The last segment in the path */
161 /* XXX: path_hash is not necessery now */
162 struct item_hash *path_hash; /**< A hashtable of all the items represented by this route's segements */
165 #define RF_FASTEST (1<<0)
166 #define RF_SHORTEST (1<<1)
167 #define RF_AVOIDHW (1<<2)
168 #define RF_AVOIDPAID (1<<3)
169 #define RF_LOCKONROAD (1<<4)
170 #define RF_SHOWGRAPH (1<<5)
173 * @brief A complete route
175 * This struct holds all information about a route.
178 int version; /**< Counts how many times this route got updated */
179 struct mapset *ms; /**< The mapset this route is built upon */
181 struct route_info *pos; /**< Current position within this route */
182 struct route_info *dst; /**< Destination of the route */
184 struct route_graph *graph; /**< Pointer to the route graph */
185 struct route_path *path2; /**< Pointer to the route path */
187 struct map *graph_map;
188 int destination_distance; /**< Distance to the destination at which the destination is considered "reached" */
189 int speedlist[route_item_last-route_item_first+1]; /**< The speedlist for this route */
193 * @brief A complete route graph
195 * This structure describes a whole routing graph
198 struct route_graph_point *route_points; /**< Pointer to the first route_graph_point in the linked list of all points */
199 struct route_graph_segment *route_segments; /**< Pointer to the first route_graph_segment in the linked list of all segments */
200 #define HASH_SIZE 8192
201 struct route_graph_point *hash[HASH_SIZE]; /**< A hashtable containing all route_graph_points in this graph */
204 #define HASHCOORD(c) ((((c)->x +(c)->y) * 2654435761UL) & (HASH_SIZE-1))
207 * @brief Iterator to iterate through all route graph segments in a route graph point
209 * This structure can be used to iterate through all route graph segments connected to a
210 * route graph point. Use this with the rp_iterator_* functions.
212 struct route_graph_point_iterator {
213 struct route_graph_point *p; /**< The route graph point whose segments should be iterated */
214 int end; /**< Indicates if we have finished iterating through the "start" segments */
215 struct route_graph_segment *next; /**< The next segment to be returned */
218 static struct route_info * route_find_nearest_street(struct mapset *ms, struct pcoord *c);
219 static struct route_graph_point *route_graph_get_point(struct route_graph *this, struct coord *c);
220 static void route_graph_update(struct route *this);
221 static struct route_path *route_path_new(struct route_graph *this, struct route_path *oldpath, struct route_info *pos, struct route_info *dst, int *speedlist);
222 static void route_process_street_graph(struct route_graph *this, struct item *item);
223 static void route_graph_destroy(struct route_graph *this);
224 static void route_path_update(struct route *this);
227 * @brief Returns the projection used for this route
229 * @param route The route to return the projection for
230 * @return The projection used for this route
232 static enum projection route_projection(struct route *route)
234 struct street_data *street;
235 street = route->pos ? route->pos->street : route->dst->street;
236 return map_projection(street->item.map);
240 * @brief Creates a new graph point iterator
242 * This function creates a new route graph point iterator, that can be used to
243 * iterate through all segments connected to the point.
245 * @param p The route graph point to create the iterator from
246 * @return A new iterator.
248 static struct route_graph_point_iterator
249 rp_iterator_new(struct route_graph_point *p)
251 struct route_graph_point_iterator it;
266 * @brief Gets the next segment connected to a route graph point from an iterator
268 * @param it The route graph point iterator to get the segment from
269 * @return The next segment or NULL if there are no more segments
271 static struct route_graph_segment
272 *rp_iterator_next(struct route_graph_point_iterator *it)
274 struct route_graph_segment *ret;
282 if (ret->start_next) {
283 it->next = ret->start_next;
285 it->next = it->p->end;
289 it->next = ret->end_next;
296 * @brief Checks if the last segment returned from a route_graph_point_iterator comes from the end
298 * @param it The route graph point iterator to be checked
299 * @return 1 if the last segment returned comes from the end of the route graph point, 0 otherwise
302 rp_iterator_end(struct route_graph_point_iterator *it) {
303 if (it->end && (it->next != it->p->end)) {
311 * @brief Destroys a route_path
313 * @param this The route_path to be destroyed
316 route_path_destroy(struct route_path *this)
318 struct route_path_segment *c,*n;
321 if (this->path_hash) {
322 item_hash_destroy(this->path_hash);
323 this->path_hash=NULL;
335 * @brief Creates a completely new route structure
337 * @param attrs Not used
338 * @return The newly created route
341 route_new(struct attr *parent, struct attr **attrs)
343 struct route *this=g_new0(struct route, 1);
344 struct attr dest_attr;
347 printf("%s:Out of memory\n", __FUNCTION__);
351 if (attr_generic_get_attr(attrs, NULL, attr_destination_distance, &dest_attr, NULL)) {
352 this->destination_distance = dest_attr.u.num;
354 this->destination_distance = 50; // Default value
361 * @brief Checks if a segment is part of a roundabout
363 * This function checks if a segment is part of a roundabout.
365 * @param seg The segment to be checked
366 * @param level How deep to scan the route graph
367 * @param direction Set this to 1 if we're entering the segment through its end, to 0 otherwise
368 * @param origin Used internally, set to NULL
369 * @return 1 If a roundabout was detected, 0 otherwise
372 route_check_roundabout(struct route_graph_segment *seg, int level, int direction, struct route_graph_segment *origin)
374 struct route_graph_point_iterator it,it2;
375 struct route_graph_segment *cur;
381 if (!direction && !(seg->flags & AF_ONEWAY)) {
384 if (direction && !(seg->flags & AF_ONEWAYREV)) {
393 it = rp_iterator_new(seg->end);
395 it = rp_iterator_new(seg->start);
399 while ((cur = rp_iterator_next(&it2)))
404 cur = rp_iterator_next(&it);
407 cur = rp_iterator_next(&it);
412 seg->flags |= AF_ROUNDABOUT;
416 if (route_check_roundabout(cur, (level-1), rp_iterator_end(&it), origin)) {
417 seg->flags |= AF_ROUNDABOUT;
421 cur = rp_iterator_next(&it);
428 * @brief Sets the mapset of the route passwd
430 * @param this The route to set the mapset for
431 * @param ms The mapset to set for this route
434 route_set_mapset(struct route *this, struct mapset *ms)
440 * @brief Returns the mapset of the route passed
442 * @param this The route to get the mapset of
443 * @return The mapset of the route passed
446 route_get_mapset(struct route *this)
452 * @brief Returns the current position within the route passed
454 * @param this The route to get the position for
455 * @return The position within the route passed
458 route_get_pos(struct route *this)
464 * @brief Returns the destination of the route passed
466 * @param this The route to get the destination for
467 * @return The destination of the route passed
470 route_get_dst(struct route *this)
476 * @brief Returns the speedlist of the route passed
478 * @param this The route to get the speedlist for
479 * @return The speedlist of the route passed
482 route_get_speedlist(struct route *this)
484 return this->speedlist;
488 * @brief Checks if the path is calculated for the route passed
490 * @param this The route to check
491 * @return True if the path is calculated, false if not
494 route_get_path_set(struct route *this)
496 return this->path2 != NULL;
500 * @brief Sets the driving speed for a certain itemtype
502 * @param this The route to set the speed for
503 * @param type The itemtype to set the speed for
504 * @param value The speed that should be set
505 * @return True on success, false if the itemtype does not exist
508 route_set_speed(struct route *this, enum item_type type, int value)
510 if (type < route_item_first || type > route_item_last) {
511 dbg(0,"street type %d out of range [%d,%d]", type, route_item_first, route_item_last);
514 this->speedlist[type-route_item_first]=value;
519 * @brief Checks if the route passed contains a certain item within the route path
521 * This function checks if a certain items exists in the path that navit will guide
522 * the user to his destination. It does *not* check if this item exists in the route
525 * @param this The route to check for this item
526 * @param item The item to search for
527 * @return True if the item was found, false if the item was not found or the route was not calculated
530 route_contains(struct route *this, struct item *item)
532 if (! this->path2 || !this->path2->path_hash)
534 return (int)item_hash_lookup(this->path2->path_hash, item);
538 * @brief Checks if the current position in a route is a certain item
540 * @param this The route to check for this item
541 * @param item The item to search for
542 * @return True if the current position is this item, false otherwise
545 route_pos_contains(struct route *this, struct item *item)
549 return item_is_equal(this->pos->street->item, *item);
553 * @brief Checks if a route has reached its destination
555 * @param this The route to be checked
556 * @return True if the destination is "reached", false otherwise.
559 route_destination_reached(struct route *this)
561 struct street_data *sd = NULL;
566 sd = this->pos->street;
572 if (!item_is_equal(this->pos->street->item, this->dst->street->item)) {
576 if ((sd->flags & AF_ONEWAY) && (this->pos->lenneg >= this->dst->lenneg)) { // We would have to drive against the one-way road
579 if ((sd->flags & AF_ONEWAYREV) && (this->pos->lenpos >= this->dst->lenpos)) {
583 if (transform_distance(route_projection(this), &this->pos->c, &this->dst->lp) > this->destination_distance) {
591 * @brief Updates the route graph and the route path if something changed with the route
593 * This will update the route graph and the route path of the route if some of the
594 * route's settings (destination, position) have changed.
596 * @attention For this to work the route graph has to be destroyed if the route's
597 * @attention destination is changed somewhere!
599 * @param this The route to update
602 route_path_update(struct route *this)
604 struct route_path *oldpath = NULL;
605 if (! this->pos || ! this->dst) {
606 route_path_destroy(this->path2);
610 /* the graph is destroyed when setting the destination */
611 if (this->graph && this->pos && this->dst && this->path2) {
612 // we can try to update
613 oldpath = this->path2;
616 if (! this->graph || !(this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist))) {
618 route_graph_update(this);
619 this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist);
620 profile(1,"route_path_new");
625 /* Destroy what's left */
626 route_path_destroy(oldpath);
631 * @brief This will calculate all the distances stored in a route_info
633 * @param ri The route_info to calculate the distances for
634 * @param pro The projection used for this route
637 route_info_distances(struct route_info *ri, enum projection pro)
640 struct street_data *sd=ri->street;
641 /* 0 1 2 X 3 4 5 6 pos=2 npos=3 count=7 0,1,2 3,4,5,6*/
642 ri->lenextra=transform_distance(pro, &ri->lp, &ri->c);
643 ri->lenneg=transform_polyline_length(pro, sd->c, npos)+transform_distance(pro, &sd->c[ri->pos], &ri->lp);
644 ri->lenpos=transform_polyline_length(pro, sd->c+npos, sd->count-npos)+transform_distance(pro, &sd->c[npos], &ri->lp);
648 * @brief This sets the current position of the route passed
650 * This will set the current position of the route passed to the street that is nearest to the
651 * passed coordinates. It also automatically updates the route.
653 * @param this The route to set the position of
654 * @param pos Coordinates to set as position
657 route_set_position(struct route *this, struct pcoord *pos)
660 route_info_free(this->pos);
662 this->pos=route_find_nearest_street(this->ms, pos);
663 dbg(1,"this->pos=%p\n", this->pos);
666 route_info_distances(this->pos, pos->pro);
668 route_path_update(this);
672 * @brief Sets a route's current position based on coordinates from tracking
674 * @param this The route to set the current position of
675 * @param tracking The tracking to get the coordinates from
678 route_set_position_from_tracking(struct route *this, struct tracking *tracking)
681 struct route_info *ret;
684 c=tracking_get_pos(tracking);
685 ret=g_new0(struct route_info, 1);
687 printf("%s:Out of memory\n", __FUNCTION__);
691 route_info_free(this->pos);
697 ret->pos=tracking_get_segment_pos(tracking);
698 ret->street=street_data_dup(tracking_get_street_data(tracking));
699 route_info_distances(ret, c->pro);
700 dbg(3,"c->x=0x%x, c->y=0x%x pos=%d item=(0x%x,0x%x)\n", c->x, c->y, ret->pos, ret->street->item.id_hi, ret->street->item.id_lo);
701 dbg(3,"street 0=(0x%x,0x%x) %d=(0x%x,0x%x)\n", ret->street->c[0].x, ret->street->c[0].y, ret->street->count-1, ret->street->c[ret->street->count-1].x, ret->street->c[ret->street->count-1].y);
704 route_path_update(this);
708 /* Used for debuging of route_rect, what routing sees */
709 struct map_selection *route_selection;
712 * @brief Returns a single map selection
714 struct map_selection *
715 route_rect(int order, struct coord *c1, struct coord *c2, int rel, int abs)
717 int dx,dy,sx=1,sy=1,d,m;
718 struct map_selection *sel=g_new(struct map_selection, 1);
720 printf("%s:Out of memory\n", __FUNCTION__);
724 sel->range.min=route_item_first;
725 sel->range.max=route_item_last;
726 dbg(1,"%p %p\n", c1, c2);
731 sel->u.c_rect.lu.x=c1->x;
732 sel->u.c_rect.rl.x=c2->x;
734 sel->u.c_rect.lu.x=c2->x;
735 sel->u.c_rect.rl.x=c1->x;
739 sel->u.c_rect.lu.y=c2->y;
740 sel->u.c_rect.rl.y=c1->y;
742 sel->u.c_rect.lu.y=c1->y;
743 sel->u.c_rect.rl.y=c2->y;
750 sel->u.c_rect.lu.x-=m;
751 sel->u.c_rect.rl.x+=m;
752 sel->u.c_rect.lu.y+=m;
753 sel->u.c_rect.rl.y-=m;
759 * @brief Returns a list of map selections useable to create a route graph
761 * Returns a list of map selections useable to get a map rect from which items can be
762 * retrieved to build a route graph. The selections are a rectangle with
763 * c1 and c2 as two corners.
765 * @param c1 Corner 1 of the rectangle
766 * @param c2 Corder 2 of the rectangle
768 static struct map_selection *
769 route_calc_selection(struct coord *c1, struct coord *c2)
771 struct map_selection *ret,*sel;
772 sel=route_rect(4, c1, c2, 25, 0);
774 sel->next=route_rect(8, c1, c1, 0, 40000);
776 sel->next=route_rect(18, c1, c1, 0, 10000);
778 sel->next=route_rect(8, c2, c2, 0, 40000);
780 sel->next=route_rect(18, c2, c2, 0, 10000);
781 /* route_selection=ret; */
786 * @brief Destroys a list of map selections
788 * @param sel Start of the list to be destroyed
791 route_free_selection(struct map_selection *sel)
793 struct map_selection *next;
803 * @brief Sets the destination of a route
805 * This sets the destination of a route to the street nearest to the coordinates passed
806 * and updates the route.
808 * @param this The route to set the destination for
809 * @param dst Coordinates to set as destination
812 route_set_destination(struct route *this, struct pcoord *dst)
816 route_info_free(this->dst);
819 this->dst=route_find_nearest_street(this->ms, dst);
821 route_info_distances(this->dst, dst->pro);
823 profile(1,"find_nearest_street");
825 /* The graph has to be destroyed and set to NULL, otherwise route_path_update() doesn't work */
826 route_graph_destroy(this->graph);
828 route_path_update(this);
833 * @brief Gets the route_graph_point with the specified coordinates
835 * @param this The route in which to search
836 * @param c Coordinates to search for
837 * @return The point at the specified coordinates or NULL if not found
839 static struct route_graph_point *
840 route_graph_get_point(struct route_graph *this, struct coord *c)
842 struct route_graph_point *p;
843 int hashval=HASHCOORD(c);
844 p=this->hash[hashval];
846 if (p->c.x == c->x && p->c.y == c->y)
854 * @brief Inserts a point into the route graph at the specified coordinates
856 * This will insert a point into the route graph at the coordinates passed in f.
857 * Note that the point is not yet linked to any segments.
859 * @param this The route to insert the point into
860 * @param f The coordinates at which the point should be inserted
861 * @return The point inserted or NULL on failure
863 static struct route_graph_point *
864 route_graph_add_point(struct route_graph *this, struct coord *f)
867 struct route_graph_point *p;
869 p=route_graph_get_point(this,f);
871 hashval=HASHCOORD(f);
873 printf("p (0x%x,0x%x)\n", f->x, f->y);
874 p=g_new(struct route_graph_point,1);
876 printf("%s:Out of memory\n", __FUNCTION__);
879 p->hash_next=this->hash[hashval];
880 this->hash[hashval]=p;
881 p->next=this->route_points;
888 this->route_points=p;
894 * @brief Frees all the memory used for points in the route graph passed
896 * @param this The route graph to delete all points from
899 route_graph_free_points(struct route_graph *this)
901 struct route_graph_point *curr,*next;
902 curr=this->route_points;
908 this->route_points=NULL;
909 memset(this->hash, 0, sizeof(this->hash));
913 * @brief Inserts a new segment into the route graph
915 * This function performs a check if a segment for the item specified already exists, and inserts
916 * a new segment representing this item if it does not.
918 * @param this The route graph to insert the segment into
919 * @param start The graph point which should be connected to the start of this segment
920 * @param end The graph point which should be connected to the end of this segment
921 * @param len The length of this segment
922 * @param item The item that is represented by this segment
923 * @param flags Flags for this segment
924 * @param offset If the item passed in "item" is segmented (i.e. divided into several segments), this indicates the position of this segment within the item
927 route_graph_add_segment(struct route_graph *this, struct route_graph_point *start,
928 struct route_graph_point *end, int len, struct item *item,
929 int flags, int offset)
931 struct route_graph_segment *s;
935 if (item_is_equal(*item, s->item) && (s->offset == offset))
940 s = g_new0(struct route_graph_segment, 1);
942 printf("%s:Out of memory\n", __FUNCTION__);
946 s->start_next=start->start;
949 s->end_next=end->end;
951 dbg_assert(len >= 0);
956 s->next=this->route_segments;
957 this->route_segments=s;
959 printf("l (0x%x,0x%x)-(0x%x,0x%x)\n", start->c.x, start->c.y, end->c.x, end->c.y);
963 * @brief Gets all the coordinates of an item
965 * This will get all the coordinates of the item i and return them in c,
966 * up to max coordinates. Additionally it is possible to limit the coordinates
967 * returned to all the coordinates of the item between the two coordinates
970 * @important Make shure that whatever c points to has enough memory allocated
971 * @important to hold max coordinates!
973 * @param i The item to get the coordinates of
974 * @param c Pointer to memory allocated for holding the coordinates
975 * @param max Maximum number of coordinates to return
976 * @param start First coordinate to get
977 * @param end Last coordinate to get
978 * @return The number of coordinates returned
980 static int get_item_seg_coords(struct item *i, struct coord *c, int max,
981 struct coord *start, struct coord *end)
987 mr=map_rect_new(i->map, NULL);
990 item = map_rect_get_item_byid(mr, i->id_hi, i->id_lo);
992 rc = item_coord_get(item, &c1, 1);
993 while (rc && (c1.x != start->x || c1.y != start->y)) {
994 rc = item_coord_get(item, &c1, 1);
996 while (rc && p < max) {
998 if (c1.x == end->x && c1.y == end->y)
1000 rc = item_coord_get(item, &c1, 1);
1003 map_rect_destroy(mr);
1008 * @brief Returns and removes one segment from a path
1010 * @param path The path to take the segment from
1011 * @param item The item whose segment to remove
1012 * @param offset Offset of the segment within the item to remove. If the item is not segmented this should be 1.
1013 * @return The segment removed
1015 static struct route_path_segment *
1016 route_extract_segment_from_path(struct route_path *path, struct item *item,
1019 struct route_path_segment *sp = NULL, *s;
1022 if (s->offset == offset && item_is_equal(s->item,*item)) {
1027 path->path = s->next;
1035 item_hash_remove(path->path_hash, item);
1040 * @brief Adds a segment and the end of a path
1042 * @param this The path to add the segment to
1043 * @param segment The segment to add
1046 route_path_add_segment(struct route_path *this, struct route_path_segment *segment)
1050 if (this->path_last)
1051 this->path_last->next=segment;
1052 this->path_last=segment;
1056 * @brief Adds a new item to a path
1058 * This adds a new item to a path, creating a new segment for it. Please note that this function does not check
1059 * if the item passed is segmented - it will create exactly one segment.
1061 * @param this The path to add the item to
1062 * @param item The item to add
1063 * @param len The length of the item
1064 * @param first (Optional) coordinate to add to the start of the item. If none should be added, make this NULL.
1065 * @param c Pointer to count coordinates of the item.
1066 * @param cound Number of coordinates in c
1067 * @param last (Optional) coordinate to add to the end of the item. If none should be added, make this NULL.
1068 * @param dir Direction to add the coordinates in. Greater than zero means "start with the first coordinate in c", all other values mean "start with the last coordinate in c"
1071 route_path_add_item(struct route_path *this, struct item *item, int len, struct coord *first, struct coord *c, int count, struct coord *last, int dir)
1073 int i,idx=0,ccount=count + (first ? 1:0) + (last ? 1:0);
1074 struct route_path_segment *segment;
1076 segment=g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccount);
1077 segment->ncoords=ccount;
1078 segment->direction=dir;
1080 segment->c[idx++]=*first;
1082 for (i = 0 ; i < count ; i++)
1083 segment->c[idx++]=c[i];
1085 for (i = 0 ; i < count ; i++)
1086 segment->c[idx++]=c[count-i-1];
1089 segment->c[idx++]=*last;
1090 segment->length=len;
1092 segment->item=*item;
1093 route_path_add_segment(this, segment);
1097 * @brief Inserts a new item into the path
1099 * This function does almost the same as "route_apth_add_item()", but identifies
1100 * the item to add by a segment from the route graph. Another difference is that it "copies" the
1101 * segment from the route graph, i.e. if the item is segmented, only the segment passed in rgs will
1102 * be added to the route path, not all segments of the item.
1104 * The function can be sped up by passing an old path already containing this segment in oldpath -
1105 * the segment will then be extracted from this old path. Please note that in this case the direction
1106 * parameter has no effect.
1108 * @param this The path to add the item to
1109 * @param oldpath Old path containing the segment to be added. Speeds up the function, but can be NULL.
1110 * @param rgs Segment of the route graph that should be "copied" to the route path
1111 * @param len Length of the item to be added
1112 * @param offset Offset of rgs within the item it represents
1113 * @param dir Order in which to add the coordinates. See route_path_add_item()
1114 * @param straight Indicates if this segment is being entered "straight". See route_check_straight().
1117 route_path_add_item_from_graph(struct route_path *this, struct route_path *oldpath,
1118 struct route_graph_segment *rgs, int len, int offset, int dir, int straight)
1120 struct route_path_segment *segment;
1122 struct coord ca[2048];
1125 ccnt = (int)item_hash_lookup(oldpath->path_hash, &rgs->item);
1127 segment = route_extract_segment_from_path(oldpath,
1128 &rgs->item, offset);
1135 ccnt = get_item_seg_coords(&rgs->item, ca, 2047, &rgs->start->c, &rgs->end->c);
1136 segment= g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccnt);
1138 printf("%s:Out of memory\n", __FUNCTION__);
1141 segment->direction=dir;
1143 for (i = 0 ; i < ccnt ; i++)
1144 segment->c[i]=ca[i];
1146 for (i = 0 ; i < ccnt ; i++)
1147 segment->c[i]=ca[ccnt-i-1];
1149 segment->ncoords = ccnt;
1151 /* We check if the route graph segment is part of a roundabout here, because this
1152 * only matters for route graph segments which form parts of the route path */
1153 if (!(rgs->flags & AF_ROUNDABOUT)) { // We identified this roundabout earlier
1154 route_check_roundabout(rgs, 10, (dir < 1), NULL);
1157 segment->item=rgs->item;
1158 segment->offset = offset;
1160 segment->length=len;
1162 item_hash_insert(this->path_hash, &rgs->item, (void *)ccnt);
1164 route_path_add_segment(this, segment);
1168 * @brief Destroys all segments of a route graph
1170 * @param this The graph to destroy all segments from
1173 route_graph_free_segments(struct route_graph *this)
1175 struct route_graph_segment *curr,*next;
1176 curr=this->route_segments;
1182 this->route_segments=NULL;
1186 * @brief Destroys a route graph
1188 * @param this The route graph to be destroyed
1191 route_graph_destroy(struct route_graph *this)
1194 route_graph_free_points(this);
1195 route_graph_free_segments(this);
1201 * @brief Returns the time needed to drive len on item
1203 * @param speedlist The speedlist that should be used
1204 * @param item The item to be driven on
1205 * @param len The length to drive
1206 * @return The time needed to drive len on item
1209 route_time(int *speedlist, struct item *item, int len)
1211 if (item->type < route_item_first || item->type > route_item_last) {
1212 dbg(0,"street type %d out of range [%d,%d]\n", item->type, route_item_first, route_item_last);
1215 if (!speedlist[item->type-route_item_first]) {
1216 dbg(0,"street type %d speed is zero\n", item->type);
1219 return len*36/speedlist[item->type-route_item_first];
1223 * @brief Returns the "costs" of driving len on item
1225 * @param speedlist The speedlist that should be used
1226 * @param item The item to be driven on
1227 * @param len The length to drive
1228 * @return The "costs" needed to drive len on item
1231 route_value(int *speedlist, struct item *item, int len)
1235 printf("len=%d\n", len);
1237 dbg_assert(len >= 0);
1238 ret=route_time(speedlist, item, len);
1239 dbg(1, "route_value(0x%x, %d)=%d\n", item->type, len, ret);
1244 * @brief Adds an item to the route graph
1246 * This adds an item (e.g. a street) to the route graph, creating as many segments as needed for a
1249 * @param this The route graph to add to
1250 * @param item The item to add
1253 route_process_street_graph(struct route_graph *this, struct item *item)
1260 struct route_graph_point *s_pnt,*e_pnt;
1267 if (item_coord_get(item, &l, 1)) {
1268 if (item_attr_get(item, attr_flags, &attr)) {
1270 if (flags & AF_SEGMENTED)
1273 s_pnt=route_graph_add_point(this,&l);
1275 while (item_coord_get(item, &c, 1)) {
1276 len+=transform_distance(map_projection(item->map), &l, &c);
1279 e_pnt=route_graph_add_point(this,&l);
1280 dbg_assert(len >= 0);
1281 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1286 isseg = item_coord_is_node(item);
1287 rc = item_coord_get(item, &c, 1);
1289 len+=transform_distance(map_projection(item->map), &l, &c);
1292 e_pnt=route_graph_add_point(this,&l);
1293 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1295 s_pnt=route_graph_add_point(this,&l);
1300 e_pnt=route_graph_add_point(this,&l);
1301 dbg_assert(len >= 0);
1303 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1309 * @brief Compares the costs of reaching the destination from two points on
1311 * @important Do not pass anything other than route_graph_points in v1 and v2!
1315 * @return The additional costs of v1 compared to v2 (may be negative)
1318 compare(void *v1, void *v2)
1320 struct route_graph_point *p1=v1;
1321 struct route_graph_point *p2=v2;
1324 printf("compare %d (%p) vs %d (%p)\n", p1->value,p1,p2->value,p2);
1326 return p1->value-p2->value;
1330 * @brief Calculates the routing costs for each point
1332 * This function is the heart of routing. It assigns each point in the route graph a
1333 * cost at which one can reach the destination from this point on. Additionally it assigns
1334 * each point a segment one should follow from this point on to reach the destination at the
1337 * This function uses Dijkstra's algorithm to do the routing. To understand it you should have a look
1338 * at this algorithm.
1341 route_graph_flood(struct route_graph *this, struct route_info *dst, int *speedlist)
1343 struct route_graph_point *p_min,*end=NULL;
1344 struct route_graph_segment *s;
1345 int min,new,old,val;
1346 struct fibheap *heap; /* This heap will hold all points with "temporarily" calculated costs */
1347 struct street_data *sd=dst->street;
1349 heap = fh_makeheap();
1350 fh_setcmp(heap, compare);
1352 if (! (sd->flags & AF_ONEWAYREV)) { /* If we may drive in the direction of the coordinates of the item, the first coordinate is one starting point */
1353 end=route_graph_get_point(this, &sd->c[0]);
1354 dbg_assert(end != 0);
1355 end->value=route_value(speedlist, &sd->item, dst->lenneg);
1356 end->el=fh_insert(heap, end);
1359 if (! (sd->flags & AF_ONEWAY)) { /* If we may drive against the direction of the coordinates, the last coordinate is another starting point */
1360 end=route_graph_get_point(this, &sd->c[sd->count-1]);
1361 dbg_assert(end != 0);
1362 end->value=route_value(speedlist, &sd->item, dst->lenpos);
1363 end->el=fh_insert(heap, end);
1366 dbg(1,"0x%x,0x%x\n", end->c.x, end->c.y);
1368 p_min=fh_extractmin(heap); /* Starting Dijkstra by selecting the point with the minimum costs on the heap */
1369 if (! p_min) /* There are no more points with temporarily calculated costs, Dijkstra has finished */
1373 printf("extract p=%p free el=%p min=%d, 0x%x, 0x%x\n", p_min, p_min->el, min, p_min->c.x, p_min->c.y);
1374 p_min->el=NULL; /* This point is permanently calculated now, we've taken it out of the heap */
1376 while (s) { /* Iterating all the segments leading away from our point to update the points at their ends */
1377 val=route_value(speedlist, &s->item, s->len);
1379 val+=val*2*street_route_contained(s->str->segid);
1383 printf("begin %d len %d vs %d (0x%x,0x%x)\n",new,val,s->end->value, s->end->c.x, s->end->c.y);
1384 if (new < s->end->value && !(s->flags & AF_ONEWAY)) { /* We've found a less costly way to reach the end of s, update it */
1389 printf("insert_end p=%p el=%p val=%d ", s->end, s->end->el, s->end->value);
1390 s->end->el=fh_insert(heap, s->end);
1392 printf("el new=%p\n", s->end->el);
1396 printf("replace_end p=%p el=%p val=%d\n", s->end, s->end->el, s->end->value);
1397 fh_replacedata(heap, s->end->el, s->end);
1405 while (s) { /* Doing the same as above with the segments leading towards our point */
1406 val=route_value(speedlist, &s->item, s->len);
1409 printf("end %d len %d vs %d (0x%x,0x%x)\n",new,val,s->start->value,s->start->c.x, s->start->c.y);
1410 if (new < s->start->value && !(s->flags & AF_ONEWAYREV)) {
1411 old=s->start->value;
1412 s->start->value=new;
1414 if (! s->start->el) {
1416 printf("insert_start p=%p el=%p val=%d ", s->start, s->start->el, s->start->value);
1417 s->start->el=fh_insert(heap, s->start);
1419 printf("el new=%p\n", s->start->el);
1423 printf("replace_start p=%p el=%p val=%d\n", s->start, s->start->el, s->start->value);
1424 fh_replacedata(heap, s->start->el, s->start);
1432 fh_deleteheap(heap);
1436 * @brief Starts an "offroad" path
1438 * This starts a path that is not located on a street. It creates a new route path
1439 * adding only one segment, that leads from pos to dest, and which is not associated with an item.
1441 * @param this Not used
1442 * @param pos The starting position for the new path
1443 * @param dst The destination of the new path
1444 * @param dir Not used
1445 * @return The new path
1447 static struct route_path *
1448 route_path_new_offroad(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1450 struct route_path *ret;
1452 ret=g_new0(struct route_path, 1);
1453 ret->path_hash=item_hash_new();
1454 route_path_add_item(ret, NULL, pos->lenextra+dst->lenextra, &pos->c, NULL, 0, &dst->c, 1);
1460 * @brief Creates a new "trivial" route
1462 * This function creates a new "trivial" route. A trivial route is a route that starts and ends on the same street,
1463 * so there is no routing needed. Depending on pos and dst it can optionally add some "offroad" part to the route.
1465 * @param this The route graph to place the route on
1466 * @param pos The starting position for the new path
1467 * @param dst The destination of the new path
1468 * @param dir Direction of the coordinates to be added
1469 * @return The new path
1471 static struct route_path *
1472 route_path_new_trivial(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1474 struct street_data *sd=pos->street;
1475 struct route_path *ret;
1478 if (pos->lenextra + dst->lenextra + pos->lenneg-dst->lenneg > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1479 return route_path_new_offroad(this, pos, dst, dir);
1481 if (pos->lenextra + dst->lenextra + pos->lenpos-dst->lenpos > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1482 return route_path_new_offroad(this, pos, dst, dir);
1484 ret=g_new0(struct route_path, 1);
1485 ret->path_hash=item_hash_new();
1487 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1489 route_path_add_item(ret, &sd->item, pos->lenpos-dst->lenpos, &pos->lp, sd->c+pos->pos+1, dst->pos+pos->pos, &dst->lp, 1);
1491 route_path_add_item(ret, &sd->item, pos->lenneg-dst->lenneg, &pos->lp, sd->c+dst->pos+1, pos->pos-dst->pos, &dst->lp, -1);
1493 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1498 * @brief Creates a new route path
1500 * This creates a new non-trivial route. It therefore needs the routing information created by route_graph_flood, so
1501 * make shure to run route_graph_flood() after changing the destination before using this function.
1503 * @param this The route graph to create the route from
1504 * @param oldpath (Optional) old path which may contain parts of the new part - this speeds things up a bit. May be NULL.
1505 * @param pos The starting position of the route
1506 * @param dst The destination of the route
1507 * @param speedlist The speedlist to use
1508 * @return The new route path
1510 static struct route_path *
1511 route_path_new(struct route_graph *this, struct route_path *oldpath, struct route_info *pos, struct route_info *dst, int *speedlist)
1513 struct route_graph_point *start1=NULL,*start2=NULL,*start;
1514 struct route_graph_segment *s=NULL;
1515 struct route_graph_segment *lastseg = NULL;
1520 int time=0,hr,min,sec
1522 unsigned int val1=0xffffffff,val2=0xffffffff;
1523 struct street_data *sd=pos->street;
1524 struct route_path *ret;
1526 if (item_is_equal(pos->street->item, dst->street->item)) { /* We probably don't have to leave this street and can use a trivial route */
1527 if (!(sd->flags & AF_ONEWAY) && pos->lenneg >= dst->lenneg) {
1528 return route_path_new_trivial(this, pos, dst, -1);
1530 if (!(sd->flags & AF_ONEWAYREV) && pos->lenpos >= dst->lenpos) {
1531 return route_path_new_trivial(this, pos, dst, 1);
1534 if (! (sd->flags & AF_ONEWAY)) { /* Using the start of the current segment as one starting point */
1535 start1=route_graph_get_point(this, &sd->c[0]);
1538 val1=start1->value+route_value(speedlist, &sd->item, pos->lenneg);
1539 dbg(1,"start1: %d(route)+%d=%d\n", start1->value, val1-start1->value, val1);
1541 if (! (sd->flags & AF_ONEWAYREV)) { /* Using the start of the current segment as an alternative starting point */
1542 start2=route_graph_get_point(this, &sd->c[sd->count-1]);
1545 val2=start2->value+route_value(speedlist, &sd->item, pos->lenpos);
1546 dbg(1,"start2: %d(route)+%d=%d\n", start2->value, val2-start2->value, val2);
1548 dbg(1,"val1=%d val2=%d\n", val1, val2);
1550 val1=start1->start->start->value;
1551 val2=start2->end->end->value;
1553 ret=g_new0(struct route_path, 1);
1555 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1556 if (start1 && (val1 < val2)) {
1558 route_path_add_item(ret, &sd->item, pos->lenneg, &pos->lp, sd->c, pos->pos+1, NULL, -1);
1562 route_path_add_item(ret, &sd->item, pos->lenpos, &pos->lp, sd->c+pos->pos+1, sd->count-pos->pos-1, NULL, 1);
1564 printf("no route found, pos blocked\n");
1568 ret->path_hash=item_hash_new();
1569 while ((s=start->seg)) { /* following start->seg, which indicates the least costly way to reach our destination */
1572 printf("start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1577 if (s->start == start) {
1578 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, 1, is_straight);
1581 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, -1, is_straight);
1588 dbg(1,"start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1589 dbg(1,"dst sd->flags=%d sd->c[0]=0x%x,0x%x sd->c[sd->count-1]=0x%x,0x%x\n", sd->flags, sd->c[0].x,sd->c[0].y, sd->c[sd->count-1].x, sd->c[sd->count-1].y);
1590 if (start->c.x == sd->c[0].x && start->c.y == sd->c[0].y) { /* Adding a final segment to reach the destination within the destination street */
1591 route_path_add_item(ret, &sd->item, dst->lenneg, NULL, sd->c, dst->pos+1, &dst->lp, 1);
1592 } else if (start->c.x == sd->c[sd->count-1].x && start->c.y == sd->c[sd->count-1].y) {
1593 route_path_add_item(ret, &sd->item, dst->lenpos, NULL, sd->c+dst->pos+1, sd->count-dst->pos-1, &dst->lp, -1);
1595 printf("no route found\n");
1596 route_path_destroy(ret);
1600 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1601 dbg(1, "%d segments\n", segs);
1606 * @brief Builds a new route graph from a mapset
1608 * This function builds a new route graph from a map. Please note that this function does not
1609 * add any routing information to the route graph - this has to be done via the route_graph_flood()
1612 * The function does not create a graph covering the whole map, but only covering the rectangle
1613 * between c1 and c2.
1615 * @param ms The mapset to build the route graph from
1616 * @param c1 Corner 1 of the rectangle to use from the map
1617 * @param c2 Corner 2 of the rectangle to use from the map
1618 * @return The new route graph.
1620 static struct route_graph *
1621 route_graph_build(struct mapset *ms, struct coord *c1, struct coord *c2)
1623 struct route_graph *ret=g_new0(struct route_graph, 1);
1624 struct map_selection *sel;
1625 struct mapset_handle *h;
1626 struct map_rect *mr;
1631 printf("%s:Out of memory\n", __FUNCTION__);
1634 sel=route_calc_selection(c1, c2);
1636 while ((m=mapset_next(h,1))) {
1637 mr=map_rect_new(m, sel);
1640 while ((item=map_rect_get_item(mr))) {
1641 if (item->type >= type_street_0 && item->type <= type_ferry) {
1642 route_process_street_graph(ret, item);
1645 map_rect_destroy(mr);
1648 route_free_selection(sel);
1654 * @brief Updates the route graph
1656 * This updates the route graph after settings in the route have changed. It also
1657 * adds routing information afterwards by calling route_graph_flood().
1659 * @param this The route to update the graph for
1662 route_graph_update(struct route *this)
1664 route_graph_destroy(this->graph);
1665 profile(1,"graph_free");
1666 this->graph=route_graph_build(this->ms, &this->pos->c, &this->dst->c);
1667 profile(1,"route_graph_build");
1668 route_graph_flood(this->graph, this->dst, this->speedlist);
1669 profile(1,"route_graph_flood");
1674 * @brief Gets street data for an item
1676 * @param item The item to get the data for
1677 * @return Street data for the item
1679 struct street_data *
1680 street_get_data (struct item *item)
1683 struct street_data *ret = NULL, *ret1;
1685 const int step = 128;
1689 ret1=g_realloc(ret, sizeof(struct street_data)+(count+step)*sizeof(struct coord));
1696 c = item_coord_get(item, &ret->c[count], step);
1698 } while (c && c == step);
1700 ret1=g_realloc(ret, sizeof(struct street_data)+count*sizeof(struct coord));
1705 if (item_attr_get(item, attr_flags, &attr))
1706 ret->flags=attr.u.num;
1714 * @brief Copies street data
1716 * @param orig The street data to copy
1717 * @return The copied street data
1719 struct street_data *
1720 street_data_dup(struct street_data *orig)
1722 struct street_data *ret;
1723 int size=sizeof(struct street_data)+orig->count*sizeof(struct coord);
1726 memcpy(ret, orig, size);
1732 * @brief Frees street data
1734 * @param sd Street data to be freed
1737 street_data_free(struct street_data *sd)
1743 * @brief Finds the nearest street to a given coordinate
1745 * @param ms The mapset to search in for the street
1746 * @param pc The coordinate to find a street nearby
1747 * @return The nearest street
1749 static struct route_info *
1750 route_find_nearest_street(struct mapset *ms, struct pcoord *pc)
1752 struct route_info *ret=NULL;
1754 struct map_selection *sel;
1755 int dist,mindist=0,pos;
1756 struct mapset_handle *h;
1758 struct map_rect *mr;
1761 struct street_data *sd;
1765 ret=g_new0(struct route_info, 1);
1767 dbg(0,"Out of memory\n");
1773 while ((m=mapset_next(h,1))) {
1776 if (map_projection(m) != pc->pro) {
1777 transform_to_geo(pc->pro, &c, &g);
1778 transform_from_geo(map_projection(m), &g, &c);
1780 sel = route_rect(18, &c, &c, 0, max_dist);
1783 mr=map_rect_new(m, sel);
1785 map_selection_destroy(sel);
1788 while ((item=map_rect_get_item(mr))) {
1789 if (item->type >= type_street_0 && item->type <= type_ferry) {
1790 sd=street_get_data(item);
1793 dist=transform_distance_polyline_sq(sd->c, sd->count, &c, &lp, &pos);
1794 if (dist < mindist) {
1797 street_data_free(ret->street);
1803 dbg(1,"dist=%d id 0x%x 0x%x pos=%d\n", dist, item->id_hi, item->id_lo, pos);
1805 street_data_free(sd);
1809 map_selection_destroy(sel);
1810 map_rect_destroy(mr);
1814 if (!ret->street || mindist > max_dist*max_dist) {
1816 street_data_free(ret->street);
1817 dbg(1,"Much too far %d > %d\n", mindist, max_dist);
1827 * @brief Destroys a route_info
1829 * @param info The route info to be destroyed
1832 route_info_free(struct route_info *inf)
1835 street_data_free(inf->street);
1843 * @brief Returns street data for a route info
1845 * @param rinf The route info to return the street data for
1846 * @return Street data for the route info
1848 struct street_data *
1849 route_info_street(struct route_info *rinf)
1851 return rinf->street;
1855 struct route_crossings *
1856 route_crossings_get(struct route *this, struct coord *c)
1858 struct route_point *pnt;
1859 struct route_segment *seg;
1861 struct route_crossings *ret;
1863 pnt=route_graph_get_point(this, c);
1866 printf("start: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1868 seg=seg->start_next;
1872 printf("end: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1876 ret=g_malloc(sizeof(struct route_crossings)+crossings*sizeof(struct route_crossing));
1877 ret->count=crossings;
1883 struct map_rect_priv {
1884 struct route_info_handle *ri;
1885 enum attr_type attr_next;
1887 struct map_priv *mpriv;
1890 unsigned int last_coord;
1891 struct route_path_segment *seg,*seg_next;
1892 struct route_graph_point *point;
1893 struct route_graph_segment *rseg;
1895 struct coord *coord_sel; /**< Set this to a coordinate if you want to filter for just a single route graph point */
1896 struct route_graph_point_iterator it;
1900 rm_coord_rewind(void *priv_data)
1902 struct map_rect_priv *mr = priv_data;
1907 rm_attr_rewind(void *priv_data)
1909 struct map_rect_priv *mr = priv_data;
1910 mr->attr_next = attr_street_item;
1914 rm_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
1916 struct map_rect_priv *mr = priv_data;
1917 struct route_path_segment *seg=mr->seg;
1918 struct route *route=mr->mpriv->route;
1919 attr->type=attr_type;
1920 switch (attr_type) {
1922 while (mr->attr_next != attr_none) {
1923 if (rm_attr_get(priv_data, mr->attr_next, attr))
1927 case attr_street_item:
1928 mr->attr_next=attr_direction;
1929 if (seg && seg->item.map)
1930 attr->u.item=&seg->item;
1934 case attr_direction:
1935 mr->attr_next=attr_route;
1937 attr->u.num=seg->direction;
1942 mr->attr_next=attr_length;
1943 attr->u.route = mr->mpriv->route;
1947 attr->u.num=seg->length;
1949 attr->u.num=mr->length;
1950 mr->attr_next=attr_time;
1953 mr->attr_next=attr_none;
1955 attr->u.num=route_time(route->speedlist, &seg->item, seg->length);
1960 mr->attr_next=attr_none;
1963 mr->attr_next=attr_none;
1964 attr->type=attr_none;
1971 rm_coord_get(void *priv_data, struct coord *c, int count)
1973 struct map_rect_priv *mr = priv_data;
1974 struct route_path_segment *seg = mr->seg;
1976 struct route *r = mr->mpriv->route;
1977 enum projection pro = route_projection(r);
1981 for (i=0; i < count; i++) {
1982 if (mr->last_coord >= seg->ncoords)
1984 if (i >= seg->ncoords)
1986 if (pro != projection_mg)
1987 transform_from_to(&seg->c[mr->last_coord++], pro,
1988 &c[i],projection_mg);
1990 c[i] = seg->c[mr->last_coord++];
1993 dbg(1,"return %d\n",rc);
1997 static struct item_methods methods_route_item = {
2005 rp_attr_rewind(void *priv_data)
2007 struct map_rect_priv *mr = priv_data;
2008 mr->attr_next = attr_label;
2012 rp_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
2014 struct map_rect_priv *mr = priv_data;
2015 struct route_graph_point *p = mr->point;
2016 struct route_graph_segment *seg = mr->rseg;
2017 switch (attr_type) {
2018 case attr_any: // works only with rg_points for now
2019 if (mr->item.type != type_rg_point)
2021 while (mr->attr_next != attr_none) {
2022 if (rp_attr_get(priv_data, mr->attr_next, attr))
2027 if (mr->item.type != type_rg_point)
2029 attr->type = attr_label;
2032 if (p->value != INT_MAX)
2033 mr->str=g_strdup_printf("%d", p->value);
2035 mr->str=g_strdup("-");
2036 attr->u.str = mr->str;
2037 mr->attr_next=attr_none;
2039 case attr_street_item:
2040 if (mr->item.type != type_rg_segment)
2042 mr->attr_next=attr_none;
2043 if (seg && seg->item.map)
2044 attr->u.item=&seg->item;
2049 if (mr->item.type != type_rg_segment)
2051 mr->attr_next = attr_none;
2053 attr->u.num = seg->flags;
2058 case attr_direction:
2059 // This only works if the map has been opened at a single point, and in that case indicates if the
2060 // segment returned last is connected to this point via its start (1) or its end (-1)
2061 if (!mr->coord_sel || (mr->item.type != type_rg_segment))
2063 if (seg->start == mr->point) {
2065 } else if (seg->end == mr->point) {
2072 if (mr->item.type != type_rg_point)
2074 attr->type = attr_debug;
2077 mr->str=g_strdup_printf("x=%d y=%d", p->c.x, p->c.y);
2078 attr->u.str = mr->str;
2079 mr->attr_next=attr_none;
2082 mr->attr_next=attr_none;
2083 attr->type=attr_none;
2089 * @brief Returns the coordinates of a route graph item
2091 * @param priv_data The route graph item's private data
2092 * @param c Pointer where to store the coordinates
2093 * @param count How many coordinates to get at a max?
2094 * @return The number of coordinates retrieved
2097 rp_coord_get(void *priv_data, struct coord *c, int count)
2099 struct map_rect_priv *mr = priv_data;
2100 struct route_graph_point *p = mr->point;
2101 struct route_graph_segment *seg = mr->rseg;
2103 struct route *r = mr->mpriv->route;
2104 enum projection pro = route_projection(r);
2106 for (i=0; i < count; i++) {
2107 if (mr->item.type == type_rg_point) {
2108 if (mr->last_coord >= 1)
2110 if (pro != projection_mg)
2111 transform_from_to(&p->c, pro,
2112 &c[i],projection_mg);
2116 if (mr->last_coord >= 2)
2119 if (seg->end->seg == seg)
2124 if (pro != projection_mg)
2125 transform_from_to(&seg->end->c, pro,
2126 &c[i],projection_mg);
2130 if (pro != projection_mg)
2131 transform_from_to(&seg->start->c, pro,
2132 &c[i],projection_mg);
2134 c[i] = seg->start->c;
2143 static struct item_methods methods_point_item = {
2151 rp_destroy(struct map_priv *priv)
2157 rm_destroy(struct map_priv *priv)
2162 static struct map_rect_priv *
2163 rm_rect_new(struct map_priv *priv, struct map_selection *sel)
2165 struct map_rect_priv * mr;
2167 if (! route_get_pos(priv->route))
2169 if (! route_get_dst(priv->route))
2171 if (! priv->route->path2)
2173 mr=g_new0(struct map_rect_priv, 1);
2175 mr->item.priv_data = mr;
2176 mr->item.type = type_street_route;
2177 mr->item.meth = &methods_route_item;
2178 mr->seg_next=priv->route->path2->path;
2183 * @brief Opens a new map rectangle on the route graph's map
2185 * This function opens a new map rectangle on the route graph's map.
2186 * The "sel" parameter enables you to only search for a single route graph
2187 * point on this map (or exactly: open a map rectangle that only contains
2188 * this one point). To do this, pass here a single map selection, whose
2189 * c_rect has both coordinates set to the same point. Otherwise this parameter
2192 * @param priv The route graph map's private data
2193 * @param sel Here it's possible to specify a point for which to search. Please read the function's description.
2194 * @return A new map rect's private data
2196 static struct map_rect_priv *
2197 rp_rect_new(struct map_priv *priv, struct map_selection *sel)
2199 struct map_rect_priv * mr;
2202 if (! priv->route->graph || ! priv->route->graph->route_points)
2204 mr=g_new0(struct map_rect_priv, 1);
2206 mr->item.priv_data = mr;
2207 mr->item.type = type_rg_point;
2208 mr->item.meth = &methods_point_item;
2210 if ((sel->u.c_rect.lu.x == sel->u.c_rect.rl.x) && (sel->u.c_rect.lu.y == sel->u.c_rect.rl.y)) {
2211 mr->coord_sel = g_malloc(sizeof(struct coord));
2212 *(mr->coord_sel) = sel->u.c_rect.lu;
2219 rm_rect_destroy(struct map_rect_priv *mr)
2223 if (mr->coord_sel) {
2224 g_free(mr->coord_sel);
2230 static struct item *
2231 rp_get_item(struct map_rect_priv *mr)
2233 struct route *r = mr->mpriv->route;
2234 struct route_graph_point *p = mr->point;
2235 struct route_graph_segment *seg = mr->rseg;
2237 if (mr->item.type == type_rg_point) {
2238 if (mr->coord_sel) {
2239 // We are supposed to return only the point at one specified coordinate...
2241 p = r->graph->hash[HASHCOORD(mr->coord_sel)];
2242 while ((p) && ((p->c.x != mr->coord_sel->x) || (p->c.y != mr->coord_sel->y))) {
2245 if ((!p) || !((p->c.x == mr->coord_sel->x) && (p->c.y == mr->coord_sel->y))) {
2246 mr->point = NULL; // This indicates that no point has been found
2248 mr->it = rp_iterator_new(p);
2255 p = r->graph->route_points;
2262 rm_coord_rewind(mr);
2266 mr->item.type = type_rg_segment;
2269 if (mr->coord_sel) {
2270 if (!mr->point) { // This means that no point has been found
2273 seg = rp_iterator_next(&(mr->it));
2276 seg=r->graph->route_segments;
2284 rm_coord_rewind(mr);
2292 static struct item *
2293 rp_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2295 struct item *ret=NULL;
2297 ret=rp_get_item(mr);
2302 static struct item *
2303 rm_get_item(struct map_rect_priv *mr)
2305 dbg(1,"enter\n", mr->pos);
2307 mr->seg=mr->seg_next;
2310 mr->seg_next=mr->seg->next;
2317 static struct item *
2318 rm_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2320 struct item *ret=NULL;
2322 ret=rm_get_item(mr);
2326 static struct map_methods route_meth = {
2339 static struct map_methods route_graph_meth = {
2353 route_toggle_routegraph_display(struct route *route)
2355 if (route->flags & RF_SHOWGRAPH) {
2356 route->flags &= ~RF_SHOWGRAPH;
2358 route->flags |= RF_SHOWGRAPH;
2362 static struct map_priv *
2363 route_map_new_helper(struct map_methods *meth, struct attr **attrs, int graph)
2365 struct map_priv *ret;
2366 struct attr *route_attr;
2368 route_attr=attr_search(attrs, NULL, attr_route);
2371 ret=g_new0(struct map_priv, 1);
2373 *meth=route_graph_meth;
2376 ret->route=route_attr->u.route;
2381 static struct map_priv *
2382 route_map_new(struct map_methods *meth, struct attr **attrs)
2384 return route_map_new_helper(meth, attrs, 0);
2387 static struct map_priv *
2388 route_graph_map_new(struct map_methods *meth, struct attr **attrs)
2390 return route_map_new_helper(meth, attrs, 1);
2394 route_get_map_helper(struct route *this_, struct map **map, char *type, char *description)
2397 *map=map_new(NULL, (struct attr*[]){
2398 &(struct attr){attr_type,{type}},
2399 &(struct attr){attr_route,.u.route=this_},
2400 &(struct attr){attr_data,{""}},
2401 &(struct attr){attr_description,{description}},
2408 * @brief Returns a new map containing the route path
2410 * This function returns a new map containing the route path.
2412 * @important Do not map_destroy() this!
2414 * @param this_ The route to get the map of
2415 * @return A new map containing the route path
2418 route_get_map(struct route *this_)
2420 return route_get_map_helper(this_, &this_->map, "route","Route");
2425 * @brief Returns a new map containing the route graph
2427 * This function returns a new map containing the route graph.
2429 * @important Do not map_destroy() this!
2431 * @param this_ The route to get the map of
2432 * @return A new map containing the route graph
2435 route_get_graph_map(struct route *this_)
2437 return route_get_map_helper(this_, &this_->graph_map, "route_graph","Route Graph");
2441 route_set_projection(struct route *this_, enum projection pro)
2448 plugin_register_map_type("route", route_map_new);
2449 plugin_register_map_type("route_graph", route_graph_map_new);