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 Destroys a route_path
298 * @param this The route_path to be destroyed
301 route_path_destroy(struct route_path *this)
303 struct route_path_segment *c,*n;
306 if (this->path_hash) {
307 item_hash_destroy(this->path_hash);
308 this->path_hash=NULL;
320 * @brief Creates a completely new route structure
322 * @param attrs Not used
323 * @return The newly created route
326 route_new(struct attr *parent, struct attr **attrs)
328 struct route *this=g_new0(struct route, 1);
329 struct attr dest_attr;
332 printf("%s:Out of memory\n", __FUNCTION__);
336 if (attr_generic_get_attr(attrs, NULL, attr_destination_distance, &dest_attr, NULL)) {
337 this->destination_distance = dest_attr.u.num;
339 this->destination_distance = 50; // Default value
346 * @brief Sets the mapset of the route passwd
348 * @param this The route to set the mapset for
349 * @param ms The mapset to set for this route
352 route_set_mapset(struct route *this, struct mapset *ms)
358 * @brief Returns the mapset of the route passed
360 * @param this The route to get the mapset of
361 * @return The mapset of the route passed
364 route_get_mapset(struct route *this)
370 * @brief Returns the current position within the route passed
372 * @param this The route to get the position for
373 * @return The position within the route passed
376 route_get_pos(struct route *this)
382 * @brief Returns the destination of the route passed
384 * @param this The route to get the destination for
385 * @return The destination of the route passed
388 route_get_dst(struct route *this)
394 * @brief Returns the speedlist of the route passed
396 * @param this The route to get the speedlist for
397 * @return The speedlist of the route passed
400 route_get_speedlist(struct route *this)
402 return this->speedlist;
406 * @brief Checks if the path is calculated for the route passed
408 * @param this The route to check
409 * @return True if the path is calculated, false if not
412 route_get_path_set(struct route *this)
414 return this->path2 != NULL;
418 * @brief Sets the driving speed for a certain itemtype
420 * @param this The route to set the speed for
421 * @param type The itemtype to set the speed for
422 * @param value The speed that should be set
423 * @return True on success, false if the itemtype does not exist
426 route_set_speed(struct route *this, enum item_type type, int value)
428 if (type < route_item_first || type > route_item_last) {
429 dbg(0,"street type %d out of range [%d,%d]", type, route_item_first, route_item_last);
432 this->speedlist[type-route_item_first]=value;
437 * @brief Checks if the route passed contains a certain item within the route path
439 * This function checks if a certain items exists in the path that navit will guide
440 * the user to his destination. It does *not* check if this item exists in the route
443 * @param this The route to check for this item
444 * @param item The item to search for
445 * @return True if the item was found, false if the item was not found or the route was not calculated
448 route_contains(struct route *this, struct item *item)
450 if (! this->path2 || !this->path2->path_hash)
452 return (int)item_hash_lookup(this->path2->path_hash, item);
456 * @brief Checks if the current position in a route is a certain item
458 * @param this The route to check for this item
459 * @param item The item to search for
460 * @return True if the current position is this item, false otherwise
463 route_pos_contains(struct route *this, struct item *item)
467 return item_is_equal(this->pos->street->item, *item);
471 * @brief Checks if a route has reached its destination
473 * @param this The route to be checked
474 * @return True if the destination is "reached", false otherwise.
477 route_destination_reached(struct route *this)
479 struct street_data *sd = NULL;
484 sd = this->pos->street;
490 if (!item_is_equal(this->pos->street->item, this->dst->street->item)) {
494 if ((sd->flags & AF_ONEWAY) && (this->pos->lenneg >= this->dst->lenneg)) { // We would have to drive against the one-way road
497 if ((sd->flags & AF_ONEWAYREV) && (this->pos->lenpos >= this->dst->lenpos)) {
501 if (transform_distance(route_projection(this), &this->pos->c, &this->dst->lp) > this->destination_distance) {
509 * @brief Updates the route graph and the route path if something changed with the route
511 * This will update the route graph and the route path of the route if some of the
512 * route's settings (destination, position) have changed.
514 * @attention For this to work the route graph has to be destroyed if the route's
515 * @attention destination is changed somewhere!
517 * @param this The route to update
520 route_path_update(struct route *this)
522 struct route_path *oldpath = NULL;
523 if (! this->pos || ! this->dst) {
524 route_path_destroy(this->path2);
528 /* the graph is destroyed when setting the destination */
529 if (this->graph && this->pos && this->dst && this->path2) {
530 // we can try to update
531 oldpath = this->path2;
534 if (! this->graph || !(this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist))) {
536 route_graph_update(this);
537 this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist);
538 profile(1,"route_path_new");
543 /* Destroy what's left */
544 route_path_destroy(oldpath);
549 * @brief This will calculate all the distances stored in a route_info
551 * @param ri The route_info to calculate the distances for
552 * @param pro The projection used for this route
555 route_info_distances(struct route_info *ri, enum projection pro)
558 struct street_data *sd=ri->street;
559 /* 0 1 2 X 3 4 5 6 pos=2 npos=3 count=7 0,1,2 3,4,5,6*/
560 ri->lenextra=transform_distance(pro, &ri->lp, &ri->c);
561 ri->lenneg=transform_polyline_length(pro, sd->c, npos)+transform_distance(pro, &sd->c[ri->pos], &ri->lp);
562 ri->lenpos=transform_polyline_length(pro, sd->c+npos, sd->count-npos)+transform_distance(pro, &sd->c[npos], &ri->lp);
566 * @brief This sets the current position of the route passed
568 * This will set the current position of the route passed to the street that is nearest to the
569 * passed coordinates. It also automatically updates the route.
571 * @param this The route to set the position of
572 * @param pos Coordinates to set as position
575 route_set_position(struct route *this, struct pcoord *pos)
578 route_info_free(this->pos);
580 this->pos=route_find_nearest_street(this->ms, pos);
581 dbg(1,"this->pos=%p\n", this->pos);
584 route_info_distances(this->pos, pos->pro);
586 route_path_update(this);
590 * @brief Sets a route's current position based on coordinates from tracking
592 * @param this The route to set the current position of
593 * @param tracking The tracking to get the coordinates from
596 route_set_position_from_tracking(struct route *this, struct tracking *tracking)
599 struct route_info *ret;
602 c=tracking_get_pos(tracking);
603 ret=g_new0(struct route_info, 1);
605 printf("%s:Out of memory\n", __FUNCTION__);
609 route_info_free(this->pos);
615 ret->pos=tracking_get_segment_pos(tracking);
616 ret->street=street_data_dup(tracking_get_street_data(tracking));
617 route_info_distances(ret, c->pro);
618 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);
619 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);
622 route_path_update(this);
626 /* Used for debuging of route_rect, what routing sees */
627 struct map_selection *route_selection;
630 * @brief Returns a single map selection
632 struct map_selection *
633 route_rect(int order, struct coord *c1, struct coord *c2, int rel, int abs)
635 int dx,dy,sx=1,sy=1,d,m;
636 struct map_selection *sel=g_new(struct map_selection, 1);
638 printf("%s:Out of memory\n", __FUNCTION__);
642 sel->range.min=route_item_first;
643 sel->range.max=route_item_last;
644 dbg(1,"%p %p\n", c1, c2);
649 sel->u.c_rect.lu.x=c1->x;
650 sel->u.c_rect.rl.x=c2->x;
652 sel->u.c_rect.lu.x=c2->x;
653 sel->u.c_rect.rl.x=c1->x;
657 sel->u.c_rect.lu.y=c2->y;
658 sel->u.c_rect.rl.y=c1->y;
660 sel->u.c_rect.lu.y=c1->y;
661 sel->u.c_rect.rl.y=c2->y;
668 sel->u.c_rect.lu.x-=m;
669 sel->u.c_rect.rl.x+=m;
670 sel->u.c_rect.lu.y+=m;
671 sel->u.c_rect.rl.y-=m;
677 * @brief Returns a list of map selections useable to create a route graph
679 * Returns a list of map selections useable to get a map rect from which items can be
680 * retrieved to build a route graph. The selections are a rectangle with
681 * c1 and c2 as two corners.
683 * @param c1 Corner 1 of the rectangle
684 * @param c2 Corder 2 of the rectangle
686 static struct map_selection *
687 route_calc_selection(struct coord *c1, struct coord *c2)
689 struct map_selection *ret,*sel;
690 sel=route_rect(4, c1, c2, 25, 0);
692 sel->next=route_rect(8, c1, c1, 0, 40000);
694 sel->next=route_rect(18, c1, c1, 0, 10000);
696 sel->next=route_rect(8, c2, c2, 0, 40000);
698 sel->next=route_rect(18, c2, c2, 0, 10000);
699 /* route_selection=ret; */
704 * @brief Destroys a list of map selections
706 * @param sel Start of the list to be destroyed
709 route_free_selection(struct map_selection *sel)
711 struct map_selection *next;
721 * @brief Sets the destination of a route
723 * This sets the destination of a route to the street nearest to the coordinates passed
724 * and updates the route.
726 * @param this The route to set the destination for
727 * @param dst Coordinates to set as destination
730 route_set_destination(struct route *this, struct pcoord *dst)
734 route_info_free(this->dst);
737 this->dst=route_find_nearest_street(this->ms, dst);
739 route_info_distances(this->dst, dst->pro);
741 profile(1,"find_nearest_street");
743 /* The graph has to be destroyed and set to NULL, otherwise route_path_update() doesn't work */
744 route_graph_destroy(this->graph);
746 route_path_update(this);
751 * @brief Gets the route_graph_point with the specified coordinates
753 * @param this The route in which to search
754 * @param c Coordinates to search for
755 * @return The point at the specified coordinates or NULL if not found
757 static struct route_graph_point *
758 route_graph_get_point(struct route_graph *this, struct coord *c)
760 struct route_graph_point *p;
761 int hashval=HASHCOORD(c);
762 p=this->hash[hashval];
764 if (p->c.x == c->x && p->c.y == c->y)
772 * @brief Inserts a point into the route graph at the specified coordinates
774 * This will insert a point into the route graph at the coordinates passed in f.
775 * Note that the point is not yet linked to any segments.
777 * @param this The route to insert the point into
778 * @param f The coordinates at which the point should be inserted
779 * @return The point inserted or NULL on failure
781 static struct route_graph_point *
782 route_graph_add_point(struct route_graph *this, struct coord *f)
785 struct route_graph_point *p;
787 p=route_graph_get_point(this,f);
789 hashval=HASHCOORD(f);
791 printf("p (0x%x,0x%x)\n", f->x, f->y);
792 p=g_new(struct route_graph_point,1);
794 printf("%s:Out of memory\n", __FUNCTION__);
797 p->hash_next=this->hash[hashval];
798 this->hash[hashval]=p;
799 p->next=this->route_points;
806 this->route_points=p;
812 * @brief Frees all the memory used for points in the route graph passed
814 * @param this The route graph to delete all points from
817 route_graph_free_points(struct route_graph *this)
819 struct route_graph_point *curr,*next;
820 curr=this->route_points;
826 this->route_points=NULL;
827 memset(this->hash, 0, sizeof(this->hash));
831 * @brief Inserts a new segment into the route graph
833 * This function performs a check if a segment for the item specified already exists, and inserts
834 * a new segment representing this item if it does not.
836 * @param this The route graph to insert the segment into
837 * @param start The graph point which should be connected to the start of this segment
838 * @param end The graph point which should be connected to the end of this segment
839 * @param len The length of this segment
840 * @param item The item that is represented by this segment
841 * @param flags Flags for this segment
842 * @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
845 route_graph_add_segment(struct route_graph *this, struct route_graph_point *start,
846 struct route_graph_point *end, int len, struct item *item,
847 int flags, int offset)
849 struct route_graph_segment *s;
851 FIXME: commented out becouse
852 it is possible to have one item with two different
856 if (item_is_equal(*item, s->item))
861 s = g_new0(struct route_graph_segment, 1);
863 printf("%s:Out of memory\n", __FUNCTION__);
867 s->start_next=start->start;
870 s->end_next=end->end;
872 dbg_assert(len >= 0);
877 s->next=this->route_segments;
878 this->route_segments=s;
880 printf("l (0x%x,0x%x)-(0x%x,0x%x)\n", start->c.x, start->c.y, end->c.x, end->c.y);
884 * @brief Gets all the coordinates of an item
886 * This will get all the coordinates of the item i and return them in c,
887 * up to max coordinates. Additionally it is possible to limit the coordinates
888 * returned to all the coordinates of the item between the two coordinates
891 * @important Make shure that whatever c points to has enough memory allocated
892 * @important to hold max coordinates!
894 * @param i The item to get the coordinates of
895 * @param c Pointer to memory allocated for holding the coordinates
896 * @param max Maximum number of coordinates to return
897 * @param start First coordinate to get
898 * @param end Last coordinate to get
899 * @return The number of coordinates returned
901 static int get_item_seg_coords(struct item *i, struct coord *c, int max,
902 struct coord *start, struct coord *end)
908 mr=map_rect_new(i->map, NULL);
911 item = map_rect_get_item_byid(mr, i->id_hi, i->id_lo);
913 rc = item_coord_get(item, &c1, 1);
914 while (rc && (c1.x != start->x || c1.y != start->y)) {
915 rc = item_coord_get(item, &c1, 1);
917 while (rc && p < max) {
919 if (c1.x == end->x && c1.y == end->y)
921 rc = item_coord_get(item, &c1, 1);
924 map_rect_destroy(mr);
929 * @brief Returns and removes one segment from a path
931 * @param path The path to take the segment from
932 * @param item The item whose segment to remove
933 * @param offset Offset of the segment within the item to remove. If the item is not segmented this should be 1.
934 * @return The segment removed
936 static struct route_path_segment *
937 route_extract_segment_from_path(struct route_path *path, struct item *item,
940 struct route_path_segment *sp = NULL, *s;
943 if (s->offset == offset && item_is_equal(s->item,*item)) {
948 path->path = s->next;
956 item_hash_remove(path->path_hash, item);
961 * @brief Adds a segment and the end of a path
963 * @param this The path to add the segment to
964 * @param segment The segment to add
967 route_path_add_segment(struct route_path *this, struct route_path_segment *segment)
972 this->path_last->next=segment;
973 this->path_last=segment;
977 * @brief Adds a new item to a path
979 * This adds a new item to a path, creating a new segment for it. Please note that this function does not check
980 * if the item passed is segmented - it will create exactly one segment.
982 * @param this The path to add the item to
983 * @param item The item to add
984 * @param len The length of the item
985 * @param first (Optional) coordinate to add to the start of the item. If none should be added, make this NULL.
986 * @param c Pointer to count coordinates of the item.
987 * @param cound Number of coordinates in c
988 * @param last (Optional) coordinate to add to the end of the item. If none should be added, make this NULL.
989 * @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"
992 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)
994 int i,idx=0,ccount=count + (first ? 1:0) + (last ? 1:0);
995 struct route_path_segment *segment;
997 segment=g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccount);
998 segment->ncoords=ccount;
999 segment->direction=dir;
1001 segment->c[idx++]=*first;
1003 for (i = 0 ; i < count ; i++)
1004 segment->c[idx++]=c[i];
1006 for (i = 0 ; i < count ; i++)
1007 segment->c[idx++]=c[count-i-1];
1010 segment->c[idx++]=*last;
1011 segment->length=len;
1013 segment->item=*item;
1014 route_path_add_segment(this, segment);
1018 * @brief Inserts a new item into the path
1020 * This function does almost the same as "route_apth_add_item()", but identifies
1021 * the item to add by a segment from the route graph. Another difference is that it "copies" the
1022 * segment from the route graph, i.e. if the item is segmented, only the segment passed in rgs will
1023 * be added to the route path, not all segments of the item.
1025 * The function can be sped up by passing an old path already containing this segment in oldpath -
1026 * the segment will then be extracted from this old path. Please note that in this case the direction
1027 * parameter has no effect.
1029 * @param this The path to add the item to
1030 * @param oldpath Old path containing the segment to be added. Speeds up the function, but can be NULL.
1031 * @param rgs Segment of the route graph that should be "copied" to the route path
1032 * @param len Length of the item to be added
1033 * @param offset Offset of rgs within the item it represents
1034 * @param dir Order in which to add the coordinates. See route_path_add_item()
1035 * @param straight Indicates if this segment is being entered "straight". See route_check_straight().
1038 route_path_add_item_from_graph(struct route_path *this, struct route_path *oldpath,
1039 struct route_graph_segment *rgs, int len, int offset, int dir, int straight)
1041 struct route_path_segment *segment;
1043 struct coord ca[2048];
1046 ccnt = (int)item_hash_lookup(oldpath->path_hash, &rgs->item);
1048 segment = route_extract_segment_from_path(oldpath,
1049 &rgs->item, offset);
1056 ccnt = get_item_seg_coords(&rgs->item, ca, 2047, &rgs->start->c, &rgs->end->c);
1057 segment= g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccnt);
1059 printf("%s:Out of memory\n", __FUNCTION__);
1062 segment->direction=dir;
1064 for (i = 0 ; i < ccnt ; i++)
1065 segment->c[i]=ca[i];
1067 for (i = 0 ; i < ccnt ; i++)
1068 segment->c[i]=ca[ccnt-i-1];
1070 segment->ncoords = ccnt;
1071 segment->item=rgs->item;
1072 segment->offset = offset;
1074 segment->length=len;
1076 item_hash_insert(this->path_hash, &rgs->item, (void *)ccnt);
1078 route_path_add_segment(this, segment);
1082 * @brief Destroys all segments of a route graph
1084 * @param this The graph to destroy all segments from
1087 route_graph_free_segments(struct route_graph *this)
1089 struct route_graph_segment *curr,*next;
1090 curr=this->route_segments;
1096 this->route_segments=NULL;
1100 * @brief Destroys a route graph
1102 * @param this The route graph to be destroyed
1105 route_graph_destroy(struct route_graph *this)
1108 route_graph_free_points(this);
1109 route_graph_free_segments(this);
1115 * @brief Returns the time needed to drive len on item
1117 * @param speedlist The speedlist that should be used
1118 * @param item The item to be driven on
1119 * @param len The length to drive
1120 * @return The time needed to drive len on item
1123 route_time(int *speedlist, struct item *item, int len)
1125 if (item->type < route_item_first || item->type > route_item_last) {
1126 dbg(0,"street type %d out of range [%d,%d]\n", item->type, route_item_first, route_item_last);
1129 if (!speedlist[item->type-route_item_first]) {
1130 dbg(0,"street type %d speed is zero\n", item->type);
1133 return len*36/speedlist[item->type-route_item_first];
1137 * @brief Returns the "costs" of driving len on item
1139 * @param speedlist The speedlist that should be used
1140 * @param item The item to be driven on
1141 * @param len The length to drive
1142 * @return The "costs" needed to drive len on item
1145 route_value(int *speedlist, struct item *item, int len)
1149 printf("len=%d\n", len);
1151 dbg_assert(len >= 0);
1152 ret=route_time(speedlist, item, len);
1153 dbg(1, "route_value(0x%x, %d)=%d\n", item->type, len, ret);
1158 * @brief Adds an item to the route graph
1160 * This adds an item (e.g. a street) to the route graph, creating as many segments as needed for a
1163 * @param this The route graph to add to
1164 * @param item The item to add
1167 route_process_street_graph(struct route_graph *this, struct item *item)
1174 struct route_graph_point *s_pnt,*e_pnt;
1181 if (item_coord_get(item, &l, 1)) {
1182 if (item_attr_get(item, attr_flags, &attr)) {
1184 if (flags & AF_SEGMENTED)
1187 s_pnt=route_graph_add_point(this,&l);
1189 while (item_coord_get(item, &c, 1)) {
1190 len+=transform_distance(map_projection(item->map), &l, &c);
1193 e_pnt=route_graph_add_point(this,&l);
1194 dbg_assert(len >= 0);
1195 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1200 isseg = item_coord_is_node(item);
1201 rc = item_coord_get(item, &c, 1);
1203 len+=transform_distance(map_projection(item->map), &l, &c);
1206 e_pnt=route_graph_add_point(this,&l);
1207 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1209 s_pnt=route_graph_add_point(this,&l);
1214 e_pnt=route_graph_add_point(this,&l);
1215 dbg_assert(len >= 0);
1217 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1223 * @brief Compares the costs of reaching the destination from two points on
1225 * @important Do not pass anything other than route_graph_points in v1 and v2!
1229 * @return The additional costs of v1 compared to v2 (may be negative)
1232 compare(void *v1, void *v2)
1234 struct route_graph_point *p1=v1;
1235 struct route_graph_point *p2=v2;
1238 printf("compare %d (%p) vs %d (%p)\n", p1->value,p1,p2->value,p2);
1240 return p1->value-p2->value;
1244 * @brief Calculates the routing costs for each point
1246 * This function is the heart of routing. It assigns each point in the route graph a
1247 * cost at which one can reach the destination from this point on. Additionally it assigns
1248 * each point a segment one should follow from this point on to reach the destination at the
1251 * This function uses Dijkstra's algorithm to do the routing. To understand it you should have a look
1252 * at this algorithm.
1255 route_graph_flood(struct route_graph *this, struct route_info *dst, int *speedlist)
1257 struct route_graph_point *p_min,*end=NULL;
1258 struct route_graph_segment *s;
1259 int min,new,old,val;
1260 struct fibheap *heap; /* This heap will hold all points with "temporarily" calculated costs */
1261 struct street_data *sd=dst->street;
1263 heap = fh_makeheap();
1264 fh_setcmp(heap, compare);
1266 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 */
1267 end=route_graph_get_point(this, &sd->c[0]);
1268 dbg_assert(end != 0);
1269 end->value=route_value(speedlist, &sd->item, dst->lenneg);
1270 end->el=fh_insert(heap, end);
1273 if (! (sd->flags & AF_ONEWAY)) { /* If we may drive against the direction of the coordinates, the last coordinate is another starting point */
1274 end=route_graph_get_point(this, &sd->c[sd->count-1]);
1275 dbg_assert(end != 0);
1276 end->value=route_value(speedlist, &sd->item, dst->lenpos);
1277 end->el=fh_insert(heap, end);
1280 dbg(1,"0x%x,0x%x\n", end->c.x, end->c.y);
1282 p_min=fh_extractmin(heap); /* Starting Dijkstra by selecting the point with the minimum costs on the heap */
1283 if (! p_min) /* There are no more points with temporarily calculated costs, Dijkstra has finished */
1287 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);
1288 p_min->el=NULL; /* This point is permanently calculated now, we've taken it out of the heap */
1290 while (s) { /* Iterating all the segments leading away from our point to update the points at their ends */
1291 val=route_value(speedlist, &s->item, s->len);
1293 val+=val*2*street_route_contained(s->str->segid);
1297 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);
1298 if (new < s->end->value && !(s->flags & AF_ONEWAY)) { /* We've found a less costly way to reach the end of s, update it */
1303 printf("insert_end p=%p el=%p val=%d ", s->end, s->end->el, s->end->value);
1304 s->end->el=fh_insert(heap, s->end);
1306 printf("el new=%p\n", s->end->el);
1310 printf("replace_end p=%p el=%p val=%d\n", s->end, s->end->el, s->end->value);
1311 fh_replacedata(heap, s->end->el, s->end);
1319 while (s) { /* Doing the same as above with the segments leading towards our point */
1320 val=route_value(speedlist, &s->item, s->len);
1323 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);
1324 if (new < s->start->value && !(s->flags & AF_ONEWAYREV)) {
1325 old=s->start->value;
1326 s->start->value=new;
1328 if (! s->start->el) {
1330 printf("insert_start p=%p el=%p val=%d ", s->start, s->start->el, s->start->value);
1331 s->start->el=fh_insert(heap, s->start);
1333 printf("el new=%p\n", s->start->el);
1337 printf("replace_start p=%p el=%p val=%d\n", s->start, s->start->el, s->start->value);
1338 fh_replacedata(heap, s->start->el, s->start);
1346 fh_deleteheap(heap);
1350 * @brief Starts an "offroad" path
1352 * This starts a path that is not located on a street. It creates a new route path
1353 * adding only one segment, that leads from pos to dest, and which is not associated with an item.
1355 * @param this Not used
1356 * @param pos The starting position for the new path
1357 * @param dst The destination of the new path
1358 * @param dir Not used
1359 * @return The new path
1361 static struct route_path *
1362 route_path_new_offroad(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1364 struct route_path *ret;
1366 ret=g_new0(struct route_path, 1);
1367 ret->path_hash=item_hash_new();
1368 route_path_add_item(ret, NULL, pos->lenextra+dst->lenextra, &pos->c, NULL, 0, &dst->c, 1);
1374 * @brief Creates a new "trivial" route
1376 * This function creates a new "trivial" route. A trivial route is a route that starts and ends on the same street,
1377 * so there is no routing needed. Depending on pos and dst it can optionally add some "offroad" part to the route.
1379 * @param this The route graph to place the route on
1380 * @param pos The starting position for the new path
1381 * @param dst The destination of the new path
1382 * @param dir Direction of the coordinates to be added
1383 * @return The new path
1385 static struct route_path *
1386 route_path_new_trivial(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1388 struct street_data *sd=pos->street;
1389 struct route_path *ret;
1392 if (pos->lenextra + dst->lenextra + pos->lenneg-dst->lenneg > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1393 return route_path_new_offroad(this, pos, dst, dir);
1395 if (pos->lenextra + dst->lenextra + pos->lenpos-dst->lenpos > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1396 return route_path_new_offroad(this, pos, dst, dir);
1398 ret=g_new0(struct route_path, 1);
1399 ret->path_hash=item_hash_new();
1401 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1403 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);
1405 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);
1407 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1412 * @brief Creates a new route path
1414 * This creates a new non-trivial route. It therefore needs the routing information created by route_graph_flood, so
1415 * make shure to run route_graph_flood() after changing the destination before using this function.
1417 * @param this The route graph to create the route from
1418 * @param oldpath (Optional) old path which may contain parts of the new part - this speeds things up a bit. May be NULL.
1419 * @param pos The starting position of the route
1420 * @param dst The destination of the route
1421 * @param speedlist The speedlist to use
1422 * @return The new route path
1424 static struct route_path *
1425 route_path_new(struct route_graph *this, struct route_path *oldpath, struct route_info *pos, struct route_info *dst, int *speedlist)
1427 struct route_graph_point *start1=NULL,*start2=NULL,*start;
1428 struct route_graph_segment *s=NULL;
1429 struct route_graph_segment *lastseg = NULL;
1434 int time=0,hr,min,sec
1436 unsigned int val1=0xffffffff,val2=0xffffffff;
1437 struct street_data *sd=pos->street;
1438 struct route_path *ret;
1440 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 */
1441 if (!(sd->flags & AF_ONEWAY) && pos->lenneg >= dst->lenneg) {
1442 return route_path_new_trivial(this, pos, dst, -1);
1444 if (!(sd->flags & AF_ONEWAYREV) && pos->lenpos >= dst->lenpos) {
1445 return route_path_new_trivial(this, pos, dst, 1);
1448 if (! (sd->flags & AF_ONEWAY)) { /* Using the start of the current segment as one starting point */
1449 start1=route_graph_get_point(this, &sd->c[0]);
1452 val1=start1->value+route_value(speedlist, &sd->item, pos->lenneg);
1453 dbg(1,"start1: %d(route)+%d=%d\n", start1->value, val1-start1->value, val1);
1455 if (! (sd->flags & AF_ONEWAYREV)) { /* Using the start of the current segment as an alternative starting point */
1456 start2=route_graph_get_point(this, &sd->c[sd->count-1]);
1459 val2=start2->value+route_value(speedlist, &sd->item, pos->lenpos);
1460 dbg(1,"start2: %d(route)+%d=%d\n", start2->value, val2-start2->value, val2);
1462 dbg(1,"val1=%d val2=%d\n", val1, val2);
1464 val1=start1->start->start->value;
1465 val2=start2->end->end->value;
1467 ret=g_new0(struct route_path, 1);
1469 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1470 if (start1 && (val1 < val2)) {
1472 route_path_add_item(ret, &sd->item, pos->lenneg, &pos->lp, sd->c, pos->pos+1, NULL, -1);
1476 route_path_add_item(ret, &sd->item, pos->lenpos, &pos->lp, sd->c+pos->pos+1, sd->count-pos->pos-1, NULL, 1);
1478 printf("no route found, pos blocked\n");
1482 ret->path_hash=item_hash_new();
1483 while ((s=start->seg)) { /* following start->seg, which indicates the least costly way to reach our destination */
1486 printf("start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1491 if (s->start == start) {
1492 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, 1, is_straight);
1495 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, -1, is_straight);
1502 dbg(1,"start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1503 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);
1504 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 */
1505 route_path_add_item(ret, &sd->item, dst->lenneg, NULL, sd->c, dst->pos+1, &dst->lp, 1);
1506 } else if (start->c.x == sd->c[sd->count-1].x && start->c.y == sd->c[sd->count-1].y) {
1507 route_path_add_item(ret, &sd->item, dst->lenpos, NULL, sd->c+dst->pos+1, sd->count-dst->pos-1, &dst->lp, -1);
1509 printf("no route found\n");
1510 route_path_destroy(ret);
1514 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1515 dbg(1, "%d segments\n", segs);
1520 * @brief Builds a new route graph from a mapset
1522 * This function builds a new route graph from a map. Please note that this function does not
1523 * add any routing information to the route graph - this has to be done via the route_graph_flood()
1526 * The function does not create a graph covering the whole map, but only covering the rectangle
1527 * between c1 and c2.
1529 * @param ms The mapset to build the route graph from
1530 * @param c1 Corner 1 of the rectangle to use from the map
1531 * @param c2 Corner 2 of the rectangle to use from the map
1532 * @return The new route graph.
1534 static struct route_graph *
1535 route_graph_build(struct mapset *ms, struct coord *c1, struct coord *c2)
1537 struct route_graph *ret=g_new0(struct route_graph, 1);
1538 struct map_selection *sel;
1539 struct mapset_handle *h;
1540 struct map_rect *mr;
1545 printf("%s:Out of memory\n", __FUNCTION__);
1548 sel=route_calc_selection(c1, c2);
1550 while ((m=mapset_next(h,1))) {
1551 mr=map_rect_new(m, sel);
1554 while ((item=map_rect_get_item(mr))) {
1555 if (item->type >= type_street_0 && item->type <= type_ferry) {
1556 route_process_street_graph(ret, item);
1559 map_rect_destroy(mr);
1562 route_free_selection(sel);
1568 * @brief Updates the route graph
1570 * This updates the route graph after settings in the route have changed. It also
1571 * adds routing information afterwards by calling route_graph_flood().
1573 * @param this The route to update the graph for
1576 route_graph_update(struct route *this)
1578 route_graph_destroy(this->graph);
1579 profile(1,"graph_free");
1580 this->graph=route_graph_build(this->ms, &this->pos->c, &this->dst->c);
1581 profile(1,"route_graph_build");
1582 route_graph_flood(this->graph, this->dst, this->speedlist);
1583 profile(1,"route_graph_flood");
1588 * @brief Gets street data for an item
1590 * @param item The item to get the data for
1591 * @return Street data for the item
1593 struct street_data *
1594 street_get_data (struct item *item)
1597 struct street_data *ret = NULL, *ret1;
1599 const int step = 128;
1603 ret1=g_realloc(ret, sizeof(struct street_data)+(count+step)*sizeof(struct coord));
1610 c = item_coord_get(item, &ret->c[count], step);
1612 } while (c && c == step);
1614 ret1=g_realloc(ret, sizeof(struct street_data)+count*sizeof(struct coord));
1619 if (item_attr_get(item, attr_flags, &attr))
1620 ret->flags=attr.u.num;
1628 * @brief Copies street data
1630 * @param orig The street data to copy
1631 * @return The copied street data
1633 struct street_data *
1634 street_data_dup(struct street_data *orig)
1636 struct street_data *ret;
1637 int size=sizeof(struct street_data)+orig->count*sizeof(struct coord);
1640 memcpy(ret, orig, size);
1646 * @brief Frees street data
1648 * @param sd Street data to be freed
1651 street_data_free(struct street_data *sd)
1657 * @brief Finds the nearest street to a given coordinate
1659 * @param ms The mapset to search in for the street
1660 * @param pc The coordinate to find a street nearby
1661 * @return The nearest street
1663 static struct route_info *
1664 route_find_nearest_street(struct mapset *ms, struct pcoord *pc)
1666 struct route_info *ret=NULL;
1668 struct map_selection *sel;
1669 int dist,mindist=0,pos;
1670 struct mapset_handle *h;
1672 struct map_rect *mr;
1675 struct street_data *sd;
1679 ret=g_new0(struct route_info, 1);
1681 dbg(0,"Out of memory\n");
1687 while ((m=mapset_next(h,1))) {
1690 if (map_projection(m) != pc->pro) {
1691 transform_to_geo(pc->pro, &c, &g);
1692 transform_from_geo(map_projection(m), &g, &c);
1694 sel = route_rect(18, &c, &c, 0, max_dist);
1697 mr=map_rect_new(m, sel);
1699 map_selection_destroy(sel);
1702 while ((item=map_rect_get_item(mr))) {
1703 if (item->type >= type_street_0 && item->type <= type_ferry) {
1704 sd=street_get_data(item);
1707 dist=transform_distance_polyline_sq(sd->c, sd->count, &c, &lp, &pos);
1708 if (dist < mindist) {
1711 street_data_free(ret->street);
1717 dbg(1,"dist=%d id 0x%x 0x%x pos=%d\n", dist, item->id_hi, item->id_lo, pos);
1719 street_data_free(sd);
1723 map_selection_destroy(sel);
1724 map_rect_destroy(mr);
1728 if (!ret->street || mindist > max_dist*max_dist) {
1730 street_data_free(ret->street);
1731 dbg(1,"Much too far %d > %d\n", mindist, max_dist);
1741 * @brief Destroys a route_info
1743 * @param info The route info to be destroyed
1746 route_info_free(struct route_info *inf)
1749 street_data_free(inf->street);
1757 * @brief Returns street data for a route info
1759 * @param rinf The route info to return the street data for
1760 * @return Street data for the route info
1762 struct street_data *
1763 route_info_street(struct route_info *rinf)
1765 return rinf->street;
1769 struct route_crossings *
1770 route_crossings_get(struct route *this, struct coord *c)
1772 struct route_point *pnt;
1773 struct route_segment *seg;
1775 struct route_crossings *ret;
1777 pnt=route_graph_get_point(this, c);
1780 printf("start: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1782 seg=seg->start_next;
1786 printf("end: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1790 ret=g_malloc(sizeof(struct route_crossings)+crossings*sizeof(struct route_crossing));
1791 ret->count=crossings;
1797 struct map_rect_priv {
1798 struct route_info_handle *ri;
1799 enum attr_type attr_next;
1801 struct map_priv *mpriv;
1804 unsigned int last_coord;
1805 struct route_path_segment *seg,*seg_next;
1806 struct route_graph_point *point;
1807 struct route_graph_segment *rseg;
1809 struct coord *coord_sel; /**< Set this to a coordinate if you want to filter for just a single route graph point */
1810 struct route_graph_point_iterator it;
1814 rm_coord_rewind(void *priv_data)
1816 struct map_rect_priv *mr = priv_data;
1821 rm_attr_rewind(void *priv_data)
1823 struct map_rect_priv *mr = priv_data;
1824 mr->attr_next = attr_street_item;
1828 rm_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
1830 struct map_rect_priv *mr = priv_data;
1831 struct route_path_segment *seg=mr->seg;
1832 struct route *route=mr->mpriv->route;
1833 attr->type=attr_type;
1834 switch (attr_type) {
1836 while (mr->attr_next != attr_none) {
1837 if (rm_attr_get(priv_data, mr->attr_next, attr))
1841 case attr_street_item:
1842 mr->attr_next=attr_direction;
1843 if (seg && seg->item.map)
1844 attr->u.item=&seg->item;
1848 case attr_direction:
1849 mr->attr_next=attr_length;
1851 attr->u.num=seg->direction;
1857 attr->u.num=seg->length;
1859 attr->u.num=mr->length;
1860 mr->attr_next=attr_time;
1863 mr->attr_next=attr_none;
1865 attr->u.num=route_time(route->speedlist, &seg->item, seg->length);
1870 mr->attr_next=attr_none;
1873 mr->attr_next=attr_none;
1874 attr->type=attr_none;
1881 rm_coord_get(void *priv_data, struct coord *c, int count)
1883 struct map_rect_priv *mr = priv_data;
1884 struct route_path_segment *seg = mr->seg;
1886 struct route *r = mr->mpriv->route;
1887 enum projection pro = route_projection(r);
1891 for (i=0; i < count; i++) {
1892 if (mr->last_coord >= seg->ncoords)
1894 if (i >= seg->ncoords)
1896 if (pro != projection_mg)
1897 transform_from_to(&seg->c[mr->last_coord++], pro,
1898 &c[i],projection_mg);
1900 c[i] = seg->c[mr->last_coord++];
1903 dbg(1,"return %d\n",rc);
1907 static struct item_methods methods_route_item = {
1915 rp_attr_rewind(void *priv_data)
1917 struct map_rect_priv *mr = priv_data;
1918 mr->attr_next = attr_label;
1922 rp_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
1924 struct map_rect_priv *mr = priv_data;
1925 struct route_graph_point *p = mr->point;
1926 struct route_graph_segment *seg = mr->rseg;
1927 switch (attr_type) {
1928 case attr_any: // works only with rg_points for now
1929 if (mr->item.type != type_rg_point)
1931 while (mr->attr_next != attr_none) {
1932 if (rp_attr_get(priv_data, mr->attr_next, attr))
1937 if (mr->item.type != type_rg_point)
1939 attr->type = attr_label;
1942 if (p->value != INT_MAX)
1943 mr->str=g_strdup_printf("%d", p->value);
1945 mr->str=g_strdup("-");
1946 attr->u.str = mr->str;
1947 mr->attr_next=attr_none;
1949 case attr_street_item:
1950 if (mr->item.type != type_rg_segment)
1952 mr->attr_next=attr_none;
1953 if (seg && seg->item.map)
1954 attr->u.item=&seg->item;
1958 case attr_direction:
1959 // This only works if the map has been opened at a single point, and in that case indicates if the
1960 // segment returned last is connected to this point via its start (1) or its end (-1)
1961 if (!mr->coord_sel || (mr->item.type != type_rg_segment))
1963 if (seg->start == mr->point) {
1965 } else if (seg->end == mr->point) {
1972 if (mr->item.type != type_rg_point)
1974 attr->type = attr_debug;
1977 mr->str=g_strdup_printf("x=%d y=%d", p->c.x, p->c.y);
1978 attr->u.str = mr->str;
1979 mr->attr_next=attr_none;
1982 mr->attr_next=attr_none;
1983 attr->type=attr_none;
1989 * @brief Returns the coordinates of a route graph item
1991 * @param priv_data The route graph item's private data
1992 * @param c Pointer where to store the coordinates
1993 * @param count How many coordinates to get at a max?
1994 * @return The number of coordinates retrieved
1997 rp_coord_get(void *priv_data, struct coord *c, int count)
1999 struct map_rect_priv *mr = priv_data;
2000 struct route_graph_point *p = mr->point;
2001 struct route_graph_segment *seg = mr->rseg;
2003 struct route *r = mr->mpriv->route;
2004 enum projection pro = route_projection(r);
2006 for (i=0; i < count; i++) {
2007 if (mr->item.type == type_rg_point) {
2008 if (mr->last_coord >= 1)
2010 if (pro != projection_mg)
2011 transform_from_to(&p->c, pro,
2012 &c[i],projection_mg);
2016 if (mr->last_coord >= 2)
2019 if (seg->end->seg == seg)
2024 if (pro != projection_mg)
2025 transform_from_to(&seg->end->c, pro,
2026 &c[i],projection_mg);
2030 if (pro != projection_mg)
2031 transform_from_to(&seg->start->c, pro,
2032 &c[i],projection_mg);
2034 c[i] = seg->start->c;
2043 static struct item_methods methods_point_item = {
2051 rp_destroy(struct map_priv *priv)
2057 rm_destroy(struct map_priv *priv)
2062 static struct map_rect_priv *
2063 rm_rect_new(struct map_priv *priv, struct map_selection *sel)
2065 struct map_rect_priv * mr;
2067 if (! route_get_pos(priv->route))
2069 if (! route_get_dst(priv->route))
2071 if (! priv->route->path2)
2073 mr=g_new0(struct map_rect_priv, 1);
2075 mr->item.priv_data = mr;
2076 mr->item.type = type_street_route;
2077 mr->item.meth = &methods_route_item;
2078 mr->seg_next=priv->route->path2->path;
2083 * @brief Opens a new map rectangle on the route graph's map
2085 * This function opens a new map rectangle on the route graph's map.
2086 * The "sel" parameter enables you to only search for a single route graph
2087 * point on this map (or exactly: open a map rectangle that only contains
2088 * this one point). To do this, pass here a single map selection, whose
2089 * c_rect has both coordinates set to the same point. Otherwise this parameter
2092 * @param priv The route graph map's private data
2093 * @param sel Here it's possible to specify a point for which to search. Please read the function's description.
2094 * @return A new map rect's private data
2096 static struct map_rect_priv *
2097 rp_rect_new(struct map_priv *priv, struct map_selection *sel)
2099 struct map_rect_priv * mr;
2102 if (! priv->route->graph || ! priv->route->graph->route_points)
2104 mr=g_new0(struct map_rect_priv, 1);
2106 mr->item.priv_data = mr;
2107 mr->item.type = type_rg_point;
2108 mr->item.meth = &methods_point_item;
2110 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)) {
2111 mr->coord_sel = g_malloc(sizeof(struct coord));
2112 *(mr->coord_sel) = sel->u.c_rect.lu;
2119 rm_rect_destroy(struct map_rect_priv *mr)
2123 if (mr->coord_sel) {
2124 g_free(mr->coord_sel);
2130 static struct item *
2131 rp_get_item(struct map_rect_priv *mr)
2133 struct route *r = mr->mpriv->route;
2134 struct route_graph_point *p = mr->point;
2135 struct route_graph_segment *seg = mr->rseg;
2137 if (mr->item.type == type_rg_point) {
2138 if (mr->coord_sel) {
2139 // We are supposed to return only the point at one specified coordinate...
2141 p = r->graph->hash[HASHCOORD(mr->coord_sel)];
2142 while ((p) && ((p->c.x != mr->coord_sel->x) || (p->c.y != mr->coord_sel->y))) {
2145 if ((!p) || !((p->c.x == mr->coord_sel->x) && (p->c.y == mr->coord_sel->y))) {
2146 mr->point = NULL; // This indicates that no point has been found
2148 mr->it = rp_iterator_new(p);
2155 p = r->graph->route_points;
2162 rm_coord_rewind(mr);
2166 mr->item.type = type_rg_segment;
2169 if (mr->coord_sel) {
2170 if (!mr->point) { // This means that no point has been found
2173 seg = rp_iterator_next(&(mr->it));
2176 seg=r->graph->route_segments;
2184 rm_coord_rewind(mr);
2192 static struct item *
2193 rp_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2195 struct item *ret=NULL;
2197 ret=rp_get_item(mr);
2202 static struct item *
2203 rm_get_item(struct map_rect_priv *mr)
2205 dbg(1,"enter\n", mr->pos);
2207 mr->seg=mr->seg_next;
2210 mr->seg_next=mr->seg->next;
2217 static struct item *
2218 rm_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2220 struct item *ret=NULL;
2222 ret=rm_get_item(mr);
2226 static struct map_methods route_meth = {
2239 static struct map_methods route_graph_meth = {
2253 route_toggle_routegraph_display(struct route *route)
2255 if (route->flags & RF_SHOWGRAPH) {
2256 route->flags &= ~RF_SHOWGRAPH;
2258 route->flags |= RF_SHOWGRAPH;
2262 static struct map_priv *
2263 route_map_new_helper(struct map_methods *meth, struct attr **attrs, int graph)
2265 struct map_priv *ret;
2266 struct attr *route_attr;
2268 route_attr=attr_search(attrs, NULL, attr_route);
2271 ret=g_new0(struct map_priv, 1);
2273 *meth=route_graph_meth;
2276 ret->route=route_attr->u.route;
2281 static struct map_priv *
2282 route_map_new(struct map_methods *meth, struct attr **attrs)
2284 return route_map_new_helper(meth, attrs, 0);
2287 static struct map_priv *
2288 route_graph_map_new(struct map_methods *meth, struct attr **attrs)
2290 return route_map_new_helper(meth, attrs, 1);
2294 route_get_map_helper(struct route *this_, struct map **map, char *type, char *description)
2297 *map=map_new(NULL, (struct attr*[]){
2298 &(struct attr){attr_type,{type}},
2299 &(struct attr){attr_route,.u.route=this_},
2300 &(struct attr){attr_data,{""}},
2301 &(struct attr){attr_description,{description}},
2308 * @brief Returns a new map containing the route path
2310 * This function returns a new map containing the route path.
2312 * @important Do not map_destroy() this!
2314 * @param this_ The route to get the map of
2315 * @return A new map containing the route path
2318 route_get_map(struct route *this_)
2320 return route_get_map_helper(this_, &this_->map, "route","Route");
2325 * @brief Returns a new map containing the route graph
2327 * This function returns a new map containing the route graph.
2329 * @important Do not map_destroy() this!
2331 * @param this_ The route to get the map of
2332 * @return A new map containing the route graph
2335 route_get_graph_map(struct route *this_)
2337 return route_get_map_helper(this_, &this_->graph_map, "route_graph","Route Graph");
2341 route_set_projection(struct route *this_, enum projection pro)
2348 plugin_register_map_type("route", route_map_new);
2349 plugin_register_map_type("route_graph", route_graph_map_new);