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 attr **attrs; /**< Attributes of this route path segment */
133 struct coord c[0]; /**< Pointer to the ncoords coordinates of this segment */
134 /* WARNING: There will be coordinates following here, so do not create new fields after c! */
138 * @brief Usually represents a destination or position
140 * This struct usually represents a destination or position
143 struct coord c; /**< The actual destination / position */
144 struct coord lp; /**< The nearest point on a street to c */
145 int pos; /**< The position of lp within the coords of the street */
146 int lenpos; /**< Distance between lp and the end of the street */
147 int lenneg; /**< Distance between lp and the start of the street */
148 int lenextra; /**< Distance between lp and c */
150 struct street_data *street; /**< The street lp is on */
154 * @brief A complete route path
156 * This structure describes a whole routing path
159 struct route_path_segment *path; /**< The first segment in the path, i.e. the segment one should
161 struct route_path_segment *path_last; /**< The last segment in the path */
162 /* XXX: path_hash is not necessery now */
163 struct item_hash *path_hash; /**< A hashtable of all the items represented by this route's segements */
166 #define RF_FASTEST (1<<0)
167 #define RF_SHORTEST (1<<1)
168 #define RF_AVOIDHW (1<<2)
169 #define RF_AVOIDPAID (1<<3)
170 #define RF_LOCKONROAD (1<<4)
171 #define RF_SHOWGRAPH (1<<5)
174 * @brief A complete route
176 * This struct holds all information about a route.
179 int version; /**< Counts how many times this route got updated */
180 struct mapset *ms; /**< The mapset this route is built upon */
182 struct route_info *pos; /**< Current position within this route */
183 struct route_info *dst; /**< Destination of the route */
185 struct route_graph *graph; /**< Pointer to the route graph */
186 struct route_path *path2; /**< Pointer to the route path */
188 struct map *graph_map;
189 int destination_distance; /**< Distance to the destination at which the destination is considered "reached" */
190 int speedlist[route_item_last-route_item_first+1]; /**< The speedlist for this route */
194 * @brief A complete route graph
196 * This structure describes a whole routing graph
199 struct route_graph_point *route_points; /**< Pointer to the first route_graph_point in the linked list of all points */
200 struct route_graph_segment *route_segments; /**< Pointer to the first route_graph_segment in the linked list of all segments */
201 #define HASH_SIZE 8192
202 struct route_graph_point *hash[HASH_SIZE]; /**< A hashtable containing all route_graph_points in this graph */
205 #define HASHCOORD(c) ((((c)->x +(c)->y) * 2654435761UL) & (HASH_SIZE-1))
207 static struct route_info * route_find_nearest_street(struct mapset *ms, struct pcoord *c);
208 static struct route_graph_point *route_graph_get_point(struct route_graph *this, struct coord *c);
209 static void route_graph_update(struct route *this);
210 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);
211 static void route_process_street_graph(struct route_graph *this, struct item *item);
212 static void route_graph_destroy(struct route_graph *this);
213 static void route_path_update(struct route *this);
216 * @brief Returns the projection used for this route
218 * @param route The route to return the projection for
219 * @return The projection used for this route
221 static enum projection route_projection(struct route *route)
223 struct street_data *street;
224 street = route->pos ? route->pos->street : route->dst->street;
225 return map_projection(street->item.map);
229 * @brief Destroys a route_path
231 * @param this The route_path to be destroyed
234 route_path_destroy(struct route_path *this)
236 struct route_path_segment *c,*n;
239 if (this->path_hash) {
240 item_hash_destroy(this->path_hash);
241 this->path_hash=NULL;
247 attr_list_free(c->attrs);
256 * @brief Creates a completely new route structure
258 * @param attrs Not used
259 * @return The newly created route
262 route_new(struct attr **attrs)
264 struct route *this=g_new0(struct route, 1);
265 struct attr dest_attr;
268 printf("%s:Out of memory\n", __FUNCTION__);
272 if (attr_generic_get_attr(attrs, NULL, attr_destination_distance, &dest_attr, NULL)) {
273 this->destination_distance = dest_attr.u.num;
275 this->destination_distance = 50; // Default value
282 * @brief Sets the mapset of the route passwd
284 * @param this The route to set the mapset for
285 * @param ms The mapset to set for this route
288 route_set_mapset(struct route *this, struct mapset *ms)
294 * @brief Returns the mapset of the route passed
296 * @param this The route to get the mapset of
297 * @return The mapset of the route passed
300 route_get_mapset(struct route *this)
306 * @brief Returns the current position within the route passed
308 * @param this The route to get the position for
309 * @return The position within the route passed
312 route_get_pos(struct route *this)
318 * @brief Returns the destination of the route passed
320 * @param this The route to get the destination for
321 * @return The destination of the route passed
324 route_get_dst(struct route *this)
330 * @brief Returns the speedlist of the route passed
332 * @param this The route to get the speedlist for
333 * @return The speedlist of the route passed
336 route_get_speedlist(struct route *this)
338 return this->speedlist;
342 * @brief Checks if the path is calculated for the route passed
344 * @param this The route to check
345 * @return True if the path is calculated, false if not
348 route_get_path_set(struct route *this)
350 return this->path2 != NULL;
354 * @brief Sets the driving speed for a certain itemtype
356 * @param this The route to set the speed for
357 * @param type The itemtype to set the speed for
358 * @param value The speed that should be set
359 * @return True on success, false if the itemtype does not exist
362 route_set_speed(struct route *this, enum item_type type, int value)
364 if (type < route_item_first || type > route_item_last) {
365 dbg(0,"street type %d out of range [%d,%d]", type, route_item_first, route_item_last);
368 this->speedlist[type-route_item_first]=value;
373 * @brief Checks if the route passed contains a certain item within the route path
375 * This function checks if a certain items exists in the path that navit will guide
376 * the user to his destination. It does *not* check if this item exists in the route
379 * @param this The route to check for this item
380 * @param item The item to search for
381 * @return True if the item was found, false if the item was not found or the route was not calculated
384 route_contains(struct route *this, struct item *item)
386 if (! this->path2 || !this->path2->path_hash)
388 return (int)item_hash_lookup(this->path2->path_hash, item);
392 * @brief Checks if the current position in a route is a certain item
394 * @param this The route to check for this item
395 * @param item The item to search for
396 * @return True if the current position is this item, false otherwise
399 route_pos_contains(struct route *this, struct item *item)
403 return item_is_equal(this->pos->street->item, *item);
407 * @brief Checks if a route has reached its destination
409 * @param this The route to be checked
410 * @return True if the destination is "reached", false otherwise.
413 route_destination_reached(struct route *this)
415 struct street_data *sd = NULL;
420 sd = this->pos->street;
426 if (!item_is_equal(this->pos->street->item, this->dst->street->item)) {
430 if ((sd->flags & AF_ONEWAY) && (this->pos->lenneg >= this->dst->lenneg)) { // We would have to drive against the one-way road
433 if ((sd->flags & AF_ONEWAYREV) && (this->pos->lenpos >= this->dst->lenpos)) {
437 if (transform_distance(route_projection(this), &this->pos->c, &this->dst->lp) > this->destination_distance) {
445 * @brief Updates the route graph and the route path if something changed with the route
447 * This will update the route graph and the route path of the route if some of the
448 * route's settings (destination, position) have changed.
450 * @attention For this to work the route graph has to be destroyed if the route's
451 * @attention destination is changed somewhere!
453 * @param this The route to update
456 route_path_update(struct route *this)
458 struct route_path *oldpath = NULL;
459 if (! this->pos || ! this->dst) {
460 route_path_destroy(this->path2);
464 /* the graph is destroyed when setting the destination */
465 if (this->graph && this->pos && this->dst && this->path2) {
466 // we can try to update
467 oldpath = this->path2;
470 if (! this->graph || !(this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist))) {
472 route_graph_update(this);
473 this->path2=route_path_new(this->graph, oldpath, this->pos, this->dst, this->speedlist);
474 profile(1,"route_path_new");
479 /* Destroy what's left */
480 route_path_destroy(oldpath);
485 * @brief This will calculate all the distances stored in a route_info
487 * @param ri The route_info to calculate the distances for
488 * @param pro The projection used for this route
491 route_info_distances(struct route_info *ri, enum projection pro)
494 struct street_data *sd=ri->street;
495 /* 0 1 2 X 3 4 5 6 pos=2 npos=3 count=7 0,1,2 3,4,5,6*/
496 ri->lenextra=transform_distance(pro, &ri->lp, &ri->c);
497 ri->lenneg=transform_polyline_length(pro, sd->c, npos)+transform_distance(pro, &sd->c[ri->pos], &ri->lp);
498 ri->lenpos=transform_polyline_length(pro, sd->c+npos, sd->count-npos)+transform_distance(pro, &sd->c[npos], &ri->lp);
502 * @brief This sets the current position of the route passed
504 * This will set the current position of the route passed to the street that is nearest to the
505 * passed coordinates. It also automatically updates the route.
507 * @param this The route to set the position of
508 * @param pos Coordinates to set as position
511 route_set_position(struct route *this, struct pcoord *pos)
514 route_info_free(this->pos);
516 this->pos=route_find_nearest_street(this->ms, pos);
517 dbg(1,"this->pos=%p\n", this->pos);
520 route_info_distances(this->pos, pos->pro);
522 route_path_update(this);
526 * @brief Sets a route's current position based on coordinates from tracking
528 * @param this The route to set the current position of
529 * @param tracking The tracking to get the coordinates from
532 route_set_position_from_tracking(struct route *this, struct tracking *tracking)
535 struct route_info *ret;
538 c=tracking_get_pos(tracking);
539 ret=g_new0(struct route_info, 1);
541 printf("%s:Out of memory\n", __FUNCTION__);
545 route_info_free(this->pos);
549 ret->pos=tracking_get_segment_pos(tracking);
550 ret->street=street_data_dup(tracking_get_street_data(tracking));
551 route_info_distances(ret, projection_mg);
552 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);
553 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);
556 route_path_update(this);
560 /* Used for debuging of route_rect, what routing sees */
561 struct map_selection *route_selection;
564 * @brief Returns a single map selection
566 struct map_selection *
567 route_rect(int order, struct coord *c1, struct coord *c2, int rel, int abs)
569 int dx,dy,sx=1,sy=1,d,m;
570 struct map_selection *sel=g_new(struct map_selection, 1);
572 printf("%s:Out of memory\n", __FUNCTION__);
575 sel->order[layer_town]=0;
576 sel->order[layer_poly]=0;
577 sel->order[layer_street]=order;
578 dbg(1,"%p %p\n", c1, c2);
583 sel->u.c_rect.lu.x=c1->x;
584 sel->u.c_rect.rl.x=c2->x;
586 sel->u.c_rect.lu.x=c2->x;
587 sel->u.c_rect.rl.x=c1->x;
591 sel->u.c_rect.lu.y=c2->y;
592 sel->u.c_rect.rl.y=c1->y;
594 sel->u.c_rect.lu.y=c1->y;
595 sel->u.c_rect.rl.y=c2->y;
602 sel->u.c_rect.lu.x-=m;
603 sel->u.c_rect.rl.x+=m;
604 sel->u.c_rect.lu.y+=m;
605 sel->u.c_rect.rl.y-=m;
611 * @brief Returns a list of map selections useable to create a route graph
613 * Returns a list of map selections useable to get a map rect from which items can be
614 * retrieved to build a route graph. The selections are a rectangle with
615 * c1 and c2 as two corners.
617 * @param c1 Corner 1 of the rectangle
618 * @param c2 Corder 2 of the rectangle
620 static struct map_selection *
621 route_calc_selection(struct coord *c1, struct coord *c2)
623 struct map_selection *ret,*sel;
624 sel=route_rect(4, c1, c2, 25, 0);
626 sel->next=route_rect(8, c1, c1, 0, 40000);
628 sel->next=route_rect(18, c1, c1, 0, 10000);
630 sel->next=route_rect(8, c2, c2, 0, 40000);
632 sel->next=route_rect(18, c2, c2, 0, 10000);
633 /* route_selection=ret; */
638 * @brief Destroys a list of map selections
640 * @param sel Start of the list to be destroyed
643 route_free_selection(struct map_selection *sel)
645 struct map_selection *next;
655 * @brief Sets the destination of a route
657 * This sets the destination of a route to the street nearest to the coordinates passed
658 * and updates the route.
660 * @param this The route to set the destination for
661 * @param dst Coordinates to set as destination
664 route_set_destination(struct route *this, struct pcoord *dst)
668 route_info_free(this->dst);
671 this->dst=route_find_nearest_street(this->ms, dst);
673 route_info_distances(this->dst, dst->pro);
675 profile(1,"find_nearest_street");
677 /* The graph has to be destroyed and set to NULL, otherwise route_path_update() doesn't work */
678 route_graph_destroy(this->graph);
680 route_path_update(this);
685 * @brief Gets the route_graph_point with the specified coordinates
687 * @param this The route in which to search
688 * @param c Coordinates to search for
689 * @return The point at the specified coordinates or NULL if not found
691 static struct route_graph_point *
692 route_graph_get_point(struct route_graph *this, struct coord *c)
694 struct route_graph_point *p;
695 int hashval=HASHCOORD(c);
696 p=this->hash[hashval];
698 if (p->c.x == c->x && p->c.y == c->y)
706 * @brief Inserts a point into the route graph at the specified coordinates
708 * This will insert a point into the route graph at the coordinates passed in f.
709 * Note that the point is not yet linked to any segments.
711 * @param this The route to insert the point into
712 * @param f The coordinates at which the point should be inserted
713 * @return The point inserted or NULL on failure
715 static struct route_graph_point *
716 route_graph_add_point(struct route_graph *this, struct coord *f)
719 struct route_graph_point *p;
721 p=route_graph_get_point(this,f);
723 hashval=HASHCOORD(f);
725 printf("p (0x%x,0x%x)\n", f->x, f->y);
726 p=g_new(struct route_graph_point,1);
728 printf("%s:Out of memory\n", __FUNCTION__);
731 p->hash_next=this->hash[hashval];
732 this->hash[hashval]=p;
733 p->next=this->route_points;
740 this->route_points=p;
746 * @brief Frees all the memory used for points in the route graph passed
748 * @param this The route graph to delete all points from
751 route_graph_free_points(struct route_graph *this)
753 struct route_graph_point *curr,*next;
754 curr=this->route_points;
760 this->route_points=NULL;
761 memset(this->hash, 0, sizeof(this->hash));
765 * @brief Inserts a new segment into the route graph
767 * This function performs a check if a segment for the item specified already exists, and inserts
768 * a new segment representing this item if it does not.
770 * @param this The route graph to insert the segment into
771 * @param start The graph point which should be connected to the start of this segment
772 * @param end The graph point which should be connected to the end of this segment
773 * @param len The length of this segment
774 * @param item The item that is represented by this segment
775 * @param flags Flags for this segment
776 * @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
779 route_graph_add_segment(struct route_graph *this, struct route_graph_point *start,
780 struct route_graph_point *end, int len, struct item *item,
781 int flags, int offset)
783 struct route_graph_segment *s;
785 FIXME: commented out becouse
786 it is possible to have one item with two different
790 if (item_is_equal(*item, s->item))
795 s = g_new0(struct route_graph_segment, 1);
797 printf("%s:Out of memory\n", __FUNCTION__);
801 s->start_next=start->start;
804 s->end_next=end->end;
806 dbg_assert(len >= 0);
811 s->next=this->route_segments;
812 this->route_segments=s;
814 printf("l (0x%x,0x%x)-(0x%x,0x%x)\n", start->c.x, start->c.y, end->c.x, end->c.y);
818 * @brief Gets all the coordinates of an item
820 * This will get all the coordinates of the item i and return them in c,
821 * up to max coordinates. Additionally it is possible to limit the coordinates
822 * returned to all the coordinates of the item between the two coordinates
825 * @important Make shure that whatever c points to has enough memory allocated
826 * @important to hold max coordinates!
828 * @param i The item to get the coordinates of
829 * @param c Pointer to memory allocated for holding the coordinates
830 * @param max Maximum number of coordinates to return
831 * @param start First coordinate to get
832 * @param end Last coordinate to get
834 static int get_item_seg_coords(struct item *i, struct coord *c, int max,
835 struct coord *start, struct coord *end)
841 mr=map_rect_new(i->map, NULL);
844 item = map_rect_get_item_byid(mr, i->id_hi, i->id_lo);
846 rc = item_coord_get(item, &c1, 1);
847 while (rc && (c1.x != start->x || c1.y != start->y)) {
848 rc = item_coord_get(item, &c1, 1);
850 while (rc && p < max) {
852 if (c1.x == end->x && c1.y == end->y)
854 rc = item_coord_get(item, &c1, 1);
857 map_rect_destroy(mr);
862 * @brief Returns and removes one segment from a path
864 * @param path The path to take the segment from
865 * @param item The item whose segment to remove
866 * @param offset Offset of the segment within the item to remove. If the item is not segmented this should be 1.
867 * @return The segment removed
869 static struct route_path_segment *
870 route_extract_segment_from_path(struct route_path *path, struct item *item,
873 struct route_path_segment *sp = NULL, *s;
876 if (s->offset == offset && item_is_equal(s->item,*item)) {
881 path->path = s->next;
889 item_hash_remove(path->path_hash, item);
894 * @brief Adds a segment and the end of a path
896 * @param this The path to add the segment to
897 * @param segment The segment to add
900 route_path_add_segment(struct route_path *this, struct route_path_segment *segment)
905 this->path_last->next=segment;
906 this->path_last=segment;
910 * @brief Adds a new item to a path
912 * This adds a new item to a path, creating a new segment for it. Please note that this function does not check
913 * if the item passed is segmented - it will create exactly one segment.
915 * @param this The path to add the item to
916 * @param item The item to add
917 * @param len The length of the item
918 * @param first (Optional) coordinate to add to the start of the item. If none should be added, make this NULL.
919 * @param c Pointer to count coordinates of the item.
920 * @param cound Number of coordinates in c
921 * @param last (Optional) coordinate to add to the end of the item. If none should be added, make this NULL.
922 * @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"
925 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)
927 int i,idx=0,ccount=count + (first ? 1:0) + (last ? 1:0);
928 struct route_path_segment *segment;
930 segment=g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccount);
931 segment->ncoords=ccount;
932 segment->direction=dir;
934 segment->c[idx++]=*first;
936 for (i = 0 ; i < count ; i++)
937 segment->c[idx++]=c[i];
939 for (i = 0 ; i < count ; i++)
940 segment->c[idx++]=c[count-i-1];
943 segment->c[idx++]=*last;
947 route_path_add_segment(this, segment);
951 * @brief Inserts a new item into the path
953 * This function does almost the same as "route_apth_add_item()", but identifies
954 * the item to add by a segment from the route graph. Another difference is that it "copies" the
955 * segment from the route graph, i.e. if the item is segmented, only the segment passed in rgs will
956 * be added to the route path, not all segments of the item.
958 * The function can be sped up by passing an old path already containing this segment in oldpath -
959 * the segment will then be extracted from this old path. Please note that in this case the direction
960 * parameter has no effect.
962 * @param this The path to add the item to
963 * @param oldpath Old path containing the segment to be added. Speeds up the function, but can be NULL.
964 * @param rgs Segment of the route graph that should be "copied" to the route path
965 * @param len Length of the item to be added
966 * @param offset Offset of rgs within the item it represents
967 * @param dir Order in which to add the coordinates. See route_path_add_item()
968 * @param straight Indicates if this segment is being entered "straight". See route_check_straight().
971 route_path_add_item_from_graph(struct route_path *this, struct route_path *oldpath,
972 struct route_graph_segment *rgs, int len, int offset, int dir, int straight)
974 struct route_path_segment *segment;
976 struct coord ca[2048];
977 struct attr straight_attr;
980 ccnt = (int)item_hash_lookup(oldpath->path_hash, &rgs->item);
982 segment = route_extract_segment_from_path(oldpath,
990 ccnt = get_item_seg_coords(&rgs->item, ca, 2047, &rgs->start->c, &rgs->end->c);
991 segment= g_malloc0(sizeof(*segment) + sizeof(struct coord) * ccnt);
993 printf("%s:Out of memory\n", __FUNCTION__);
996 segment->direction=dir;
998 for (i = 0 ; i < ccnt ; i++)
1001 for (i = 0 ; i < ccnt ; i++)
1002 segment->c[i]=ca[ccnt-i-1];
1004 segment->ncoords = ccnt;
1005 segment->item=rgs->item;
1006 segment->offset = offset;
1008 segment->length=len;
1010 item_hash_insert(this->path_hash, &rgs->item, (void *)ccnt);
1012 straight_attr.type = attr_route_follow_straight;
1013 straight_attr.u.num = straight;
1015 segment->attrs = attr_generic_set_attr(segment->attrs, &straight_attr);
1017 route_path_add_segment(this, segment);
1021 * @brief Destroys all segments of a route graph
1023 * @param this The graph to destroy all segments from
1026 route_graph_free_segments(struct route_graph *this)
1028 struct route_graph_segment *curr,*next;
1029 curr=this->route_segments;
1035 this->route_segments=NULL;
1039 * @brief Destroys a route graph
1041 * @param this The route graph to be destroyed
1044 route_graph_destroy(struct route_graph *this)
1047 route_graph_free_points(this);
1048 route_graph_free_segments(this);
1054 * @brief Returns the time needed to drive len on item
1056 * @param speedlist The speedlist that should be used
1057 * @param item The item to be driven on
1058 * @param len The length to drive
1059 * @return The time needed to drive len on item
1062 route_time(int *speedlist, struct item *item, int len)
1064 if (item->type < route_item_first || item->type > route_item_last) {
1065 dbg(0,"street type %d out of range [%d,%d]\n", item->type, route_item_first, route_item_last);
1068 if (!speedlist[item->type-route_item_first]) {
1069 dbg(0,"street type %d speed is zero\n", item->type);
1072 return len*36/speedlist[item->type-route_item_first];
1076 * @brief Returns the "costs" of driving len on item
1078 * @param speedlist The speedlist that should be used
1079 * @param item The item to be driven on
1080 * @param len The length to drive
1081 * @return The "costs" needed to drive len on item
1084 route_value(int *speedlist, struct item *item, int len)
1088 printf("len=%d\n", len);
1090 dbg_assert(len >= 0);
1091 ret=route_time(speedlist, item, len);
1092 dbg(1, "route_value(0x%x, %d)=%d\n", item->type, len, ret);
1097 * @brief Adds an item to the route graph
1099 * This adds an item (e.g. a street) to the route graph, creating as many segments as needed for a
1102 * @param this The route graph to add to
1103 * @param item The item to add
1106 route_process_street_graph(struct route_graph *this, struct item *item)
1113 struct route_graph_point *s_pnt,*e_pnt;
1120 if (item_coord_get(item, &l, 1)) {
1121 if (item_attr_get(item, attr_flags, &attr)) {
1123 if (flags & AF_SEGMENTED)
1126 s_pnt=route_graph_add_point(this,&l);
1128 while (item_coord_get(item, &c, 1)) {
1129 len+=transform_distance(map_projection(item->map), &l, &c);
1132 e_pnt=route_graph_add_point(this,&l);
1133 dbg_assert(len >= 0);
1134 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1139 isseg = item_coord_is_node(item);
1140 rc = item_coord_get(item, &c, 1);
1142 len+=transform_distance(map_projection(item->map), &l, &c);
1145 e_pnt=route_graph_add_point(this,&l);
1146 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1148 s_pnt=route_graph_add_point(this,&l);
1153 e_pnt=route_graph_add_point(this,&l);
1154 dbg_assert(len >= 0);
1156 route_graph_add_segment(this, s_pnt, e_pnt, len, item, flags, offset);
1162 * @brief Compares the costs of reaching the destination from two points on
1164 * @important Do not pass anything other than route_graph_points in v1 and v2!
1168 * @return The additional costs of v1 compared to v2 (may be negative)
1171 compare(void *v1, void *v2)
1173 struct route_graph_point *p1=v1;
1174 struct route_graph_point *p2=v2;
1177 printf("compare %d (%p) vs %d (%p)\n", p1->value,p1,p2->value,p2);
1179 return p1->value-p2->value;
1183 * @brief Calculates the routing costs for each point
1185 * This function is the heart of routing. It assigns each point in the route graph a
1186 * cost at which one can reach the destination from this point on. Additionally it assigns
1187 * each point a segment one should follow from this point on to reach the destination at the
1190 * This function uses Dijkstra's algorithm to do the routing. To understand it you should have a look
1191 * at this algorithm.
1194 route_graph_flood(struct route_graph *this, struct route_info *dst, int *speedlist)
1196 struct route_graph_point *p_min,*end=NULL;
1197 struct route_graph_segment *s;
1198 int min,new,old,val;
1199 struct fibheap *heap; /* This heap will hold all points with "temporarily" calculated costs */
1200 struct street_data *sd=dst->street;
1202 heap = fh_makeheap();
1203 fh_setcmp(heap, compare);
1205 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 */
1206 end=route_graph_get_point(this, &sd->c[0]);
1207 dbg_assert(end != 0);
1208 end->value=route_value(speedlist, &sd->item, dst->lenneg);
1209 end->el=fh_insert(heap, end);
1212 if (! (sd->flags & AF_ONEWAY)) { /* If we may drive against the direction of the coordinates, the last coordinate is another starting point */
1213 end=route_graph_get_point(this, &sd->c[sd->count-1]);
1214 dbg_assert(end != 0);
1215 end->value=route_value(speedlist, &sd->item, dst->lenpos);
1216 end->el=fh_insert(heap, end);
1219 dbg(1,"0x%x,0x%x\n", end->c.x, end->c.y);
1221 p_min=fh_extractmin(heap); /* Starting Dijkstra by selecting the point with the minimum costs on the heap */
1222 if (! p_min) /* There are no more points with temporarily calculated costs, Dijkstra has finished */
1226 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);
1227 p_min->el=NULL; /* This point is permanently calculated now, we've taken it out of the heap */
1229 while (s) { /* Iterating all the segments leading away from our point to update the points at their ends */
1230 val=route_value(speedlist, &s->item, s->len);
1232 val+=val*2*street_route_contained(s->str->segid);
1236 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);
1237 if (new < s->end->value && !(s->flags & AF_ONEWAY)) { /* We've found a less costly way to reach the end of s, update it */
1242 printf("insert_end p=%p el=%p val=%d ", s->end, s->end->el, s->end->value);
1243 s->end->el=fh_insert(heap, s->end);
1245 printf("el new=%p\n", s->end->el);
1249 printf("replace_end p=%p el=%p val=%d\n", s->end, s->end->el, s->end->value);
1250 fh_replacedata(heap, s->end->el, s->end);
1258 while (s) { /* Doing the same as above with the segments leading towards our point */
1259 val=route_value(speedlist, &s->item, s->len);
1262 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);
1263 if (new < s->start->value && !(s->flags & AF_ONEWAYREV)) {
1264 old=s->start->value;
1265 s->start->value=new;
1267 if (! s->start->el) {
1269 printf("insert_start p=%p el=%p val=%d ", s->start, s->start->el, s->start->value);
1270 s->start->el=fh_insert(heap, s->start);
1272 printf("el new=%p\n", s->start->el);
1276 printf("replace_start p=%p el=%p val=%d\n", s->start, s->start->el, s->start->value);
1277 fh_replacedata(heap, s->start->el, s->start);
1285 fh_deleteheap(heap);
1289 * @brief Starts an "offroad" path
1291 * This starts a path that is not located on a street. It creates a new route path
1292 * adding only one segment, that leads from pos to dest, and which is not associated with an item.
1294 * @param this Not used
1295 * @param pos The starting position for the new path
1296 * @param dst The destination of the new path
1297 * @param dir Not used
1298 * @return The new path
1300 static struct route_path *
1301 route_path_new_offroad(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1303 struct route_path *ret;
1305 ret=g_new0(struct route_path, 1);
1306 ret->path_hash=item_hash_new();
1307 route_path_add_item(ret, NULL, pos->lenextra+dst->lenextra, &pos->c, NULL, 0, &dst->c, 1);
1313 * @brief Creates a new "trivial" route
1315 * This function creates a new "trivial" route. A trivial route is a route that starts and ends on the same street,
1316 * so there is no routing needed. Depending on pos and dst it can optionally add some "offroad" part to the route.
1318 * @param this The route graph to place the route on
1319 * @param pos The starting position for the new path
1320 * @param dst The destination of the new path
1321 * @param dir Direction of the coordinates to be added
1322 * @return The new path
1324 static struct route_path *
1325 route_path_new_trivial(struct route_graph *this, struct route_info *pos, struct route_info *dst, int dir)
1327 struct street_data *sd=pos->street;
1328 struct route_path *ret;
1331 if (pos->lenextra + dst->lenextra + pos->lenneg-dst->lenneg > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1332 return route_path_new_offroad(this, pos, dst, dir);
1334 if (pos->lenextra + dst->lenextra + pos->lenpos-dst->lenpos > transform_distance(map_projection(sd->item.map), &pos->c, &dst->c))
1335 return route_path_new_offroad(this, pos, dst, dir);
1337 ret=g_new0(struct route_path, 1);
1338 ret->path_hash=item_hash_new();
1340 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1342 route_path_add_item(ret, &sd->item, pos->lenneg-dst->lenneg, &pos->lp, sd->c+pos->pos+1, dst->pos+pos->pos, &dst->lp, 1);
1344 route_path_add_item(ret, &sd->item, pos->lenpos-dst->lenpos, &pos->lp, sd->c+dst->pos+1, pos->pos-dst->pos, &dst->lp, -1);
1346 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1351 * @brief Calculates of two coordinates' connection
1353 * This function calculates the angle between coordinates, with north = 0
1356 * %FIXME This is a duplicate of road_angle() in navigation.c - combine them?
1358 * @param c1 Coordinate 1
1359 * @param c2 Coordinate 2
1360 * @param dir Set to true if c1 is the prior, and c2 the later coordinate.
1361 * @return The angle of the coordinate's connection
1364 route_road_angle(struct coord *c1, struct coord *c2, int dir)
1366 int ret=transform_get_angle_delta(c1, c2, dir);
1367 dbg(1, "road_angle(0x%x,0x%x - 0x%x,0x%x)=%d\n", c1->x, c1->y, c2->x, c2->y, ret);
1372 * @brief Checks if entering one segment from another is a "straight" road
1374 * This checks if one can enter seg_to from seg_from by driving "straight" - i.e.
1375 * if seg_to is the segment you can drive to from seg_from by steering less than
1376 * all to all other segments.
1378 * This function returns true on failure, so we don't create maneuvers on every error.
1380 * @param seg_from Segment we are driving from
1381 * @param seg_to Segment we are driving to
1382 * @return True if driving from seg_from to seg_to is "straight", false otherwise
1385 route_check_straight(struct route_graph_segment *seg_from, struct route_graph_segment *seg_to)
1387 struct route_graph_segment *curr;
1388 struct route_graph_point *conn;
1389 int from_angle, to_angle, curr_angle, angle_diff;
1391 struct coord ca[2048];
1393 if ((seg_from->end == seg_to->start) || (seg_from->end == seg_to->end)) {
1394 ccnt = get_item_seg_coords(&seg_from->item, ca, 2047, &seg_from->start->c, &seg_from->end->c);
1395 from_angle = route_road_angle(&ca[ccnt-2], &ca[ccnt-1],1);
1397 conn = seg_from->end;
1398 } else if ((seg_from->start == seg_to->start) || (seg_from->start == seg_to->end)) {
1399 ccnt = get_item_seg_coords(&seg_from->item, ca, 2, &seg_from->start->c, &seg_from->end->c);
1400 from_angle = route_road_angle(&ca[1], &ca[0],1);
1402 conn = seg_from->start;
1409 if (seg_to->end == conn) {
1410 ccnt = get_item_seg_coords(&seg_to->item, ca, 2047, &seg_to->start->c, &seg_to->end->c);
1411 to_angle = route_road_angle(&ca[ccnt-1], &ca[ccnt-2],1);
1413 ccnt = get_item_seg_coords(&seg_to->item, ca, 2, &seg_to->start->c, &seg_to->end->c);
1414 to_angle = route_road_angle(&ca[0], &ca[1],1);
1418 angle_diff = from_angle - to_angle;
1419 if (angle_diff < 0) {
1425 while (curr != NULL) {
1427 curr = curr->start_next;
1431 ccnt = get_item_seg_coords(&curr->item, ca, 2, &curr->start->c, &curr->end->c);
1432 curr_angle = route_road_angle(&ca[0], &ca[1], 1);
1434 curr_angle = from_angle - curr_angle;
1436 if (curr_angle < 0) {
1441 if (curr_angle < angle_diff) {
1445 curr = curr->start_next;
1449 while (curr != NULL) {
1451 curr = curr->end_next;
1455 ccnt = get_item_seg_coords(&curr->item, ca, 2047, &curr->start->c, &curr->end->c);
1456 curr_angle = route_road_angle(&ca[ccnt-1], &ca[ccnt-2], 1);
1458 curr_angle = from_angle - curr_angle;
1460 if (curr_angle < 0) {
1464 if (curr_angle < angle_diff) {
1468 curr = curr->end_next;
1475 * @brief Creates a new route path
1477 * This creates a new non-trivial route. It therefore needs the routing information created by route_graph_flood, so
1478 * make shure to run route_graph_flood() after changing the destination before using this function.
1480 * @param this The route graph to create the route from
1481 * @param oldpath (Optional) old path which may contain parts of the new part - this speeds things up a bit. May be NULL.
1482 * @param pos The starting position of the route
1483 * @param dst The destination of the route
1484 * @param speedlist The speedlist to use
1485 * @return The new route path
1487 static struct route_path *
1488 route_path_new(struct route_graph *this, struct route_path *oldpath, struct route_info *pos, struct route_info *dst, int *speedlist)
1490 struct route_graph_point *start1=NULL,*start2=NULL,*start;
1491 struct route_graph_segment *s=NULL;
1492 struct route_graph_segment *lastseg = NULL;
1497 int time=0,hr,min,sec
1499 unsigned int val1=0xffffffff,val2=0xffffffff;
1500 struct street_data *sd=pos->street;
1501 struct route_path *ret;
1503 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 */
1504 if (!(sd->flags & AF_ONEWAY) && pos->lenneg >= dst->lenneg) {
1505 return route_path_new_trivial(this, pos, dst, -1);
1507 if (!(sd->flags & AF_ONEWAYREV) && pos->lenpos >= dst->lenpos) {
1508 return route_path_new_trivial(this, pos, dst, 1);
1511 if (! (sd->flags & AF_ONEWAY)) { /* Using the start of the current segment as one starting point */
1512 start1=route_graph_get_point(this, &sd->c[0]);
1515 val1=start1->value+route_value(speedlist, &sd->item, pos->lenneg);
1516 dbg(1,"start1: %d(route)+%d=%d\n", start1->value, val1-start1->value, val1);
1518 if (! (sd->flags & AF_ONEWAYREV)) { /* Using the start of the current segment as an alternative starting point */
1519 start2=route_graph_get_point(this, &sd->c[sd->count-1]);
1522 val2=start2->value+route_value(speedlist, &sd->item, pos->lenpos);
1523 dbg(1,"start2: %d(route)+%d=%d\n", start2->value, val2-start2->value, val2);
1525 dbg(1,"val1=%d val2=%d\n", val1, val2);
1527 val1=start1->start->start->value;
1528 val2=start2->end->end->value;
1530 ret=g_new0(struct route_path, 1);
1532 route_path_add_item(ret, NULL, pos->lenextra, &pos->c, NULL, 0, &pos->lp, 1);
1533 if (start1 && (val1 < val2)) {
1535 route_path_add_item(ret, &sd->item, pos->lenneg, &pos->lp, sd->c, pos->pos+1, NULL, -1);
1539 route_path_add_item(ret, &sd->item, pos->lenpos, &pos->lp, sd->c+pos->pos+1, sd->count-pos->pos-1, NULL, 1);
1541 printf("no route found, pos blocked\n");
1545 ret->path_hash=item_hash_new();
1546 while ((s=start->seg)) { /* following start->seg, which indicates the least costly way to reach our destination */
1549 printf("start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1555 is_straight = route_check_straight(lastseg,s);
1560 if (s->start == start) {
1561 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, 1, is_straight);
1564 route_path_add_item_from_graph(ret, oldpath, s, seg_len, s->offset, -1, is_straight);
1571 dbg(1,"start->value=%d 0x%x,0x%x\n", start->value, start->c.x, start->c.y);
1572 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);
1573 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 */
1574 route_path_add_item(ret, &sd->item, dst->lenneg, &dst->lp, sd->c, dst->pos+1, NULL, -1);
1575 } else if (start->c.x == sd->c[sd->count-1].x && start->c.y == sd->c[sd->count-1].y) {
1576 route_path_add_item(ret, &sd->item, dst->lenpos, &dst->lp, sd->c+dst->pos+1, sd->count-dst->pos-1, NULL, 1);
1578 printf("no route found\n");
1579 route_path_destroy(ret);
1583 route_path_add_item(ret, NULL, dst->lenextra, &dst->lp, NULL, 0, &dst->c, 1);
1584 dbg(1, "%d segments\n", segs);
1589 * @brief Builds a new route graph from a mapset
1591 * This function builds a new route graph from a map. Please note that this function does not
1592 * add any routing information to the route graph - this has to be done via the route_graph_flood()
1595 * The function does not create a graph covering the whole map, but only covering the rectangle
1596 * between c1 and c2.
1598 * @param ms The mapset to build the route graph from
1599 * @param c1 Corner 1 of the rectangle to use from the map
1600 * @param c2 Corner 2 of the rectangle to use from the map
1601 * @return The new route graph.
1603 static struct route_graph *
1604 route_graph_build(struct mapset *ms, struct coord *c1, struct coord *c2)
1606 struct route_graph *ret=g_new0(struct route_graph, 1);
1607 struct map_selection *sel;
1608 struct mapset_handle *h;
1609 struct map_rect *mr;
1614 printf("%s:Out of memory\n", __FUNCTION__);
1617 sel=route_calc_selection(c1, c2);
1619 while ((m=mapset_next(h,1))) {
1620 mr=map_rect_new(m, sel);
1623 while ((item=map_rect_get_item(mr))) {
1624 if (item->type >= type_street_0 && item->type <= type_ferry) {
1625 route_process_street_graph(ret, item);
1628 map_rect_destroy(mr);
1631 route_free_selection(sel);
1637 * @brief Updates the route graph
1639 * This updates the route graph after settings in the route have changed. It also
1640 * adds routing information afterwards by calling route_graph_flood().
1642 * @param this The route to update the graph for
1645 route_graph_update(struct route *this)
1647 route_graph_destroy(this->graph);
1648 profile(1,"graph_free");
1649 this->graph=route_graph_build(this->ms, &this->pos->c, &this->dst->c);
1650 profile(1,"route_graph_build");
1651 route_graph_flood(this->graph, this->dst, this->speedlist);
1652 profile(1,"route_graph_flood");
1657 * @brief Gets street data for an item
1659 * @param item The item to get the data for
1660 * @return Street data for the item
1662 struct street_data *
1663 street_get_data (struct item *item)
1666 struct street_data *ret = NULL, *ret1;
1668 const int step = 128;
1672 ret1=g_realloc(ret, sizeof(struct street_data)+(count+step)*sizeof(struct coord));
1679 c = item_coord_get(item, &ret->c[count], step);
1681 } while (c && c == step);
1686 ret1=g_realloc(ret, sizeof(struct street_data)+count*sizeof(struct coord));
1691 if (item_attr_get(item, attr_flags, &attr))
1692 ret->flags=attr.u.num;
1700 * @brief Copies street data
1702 * @param orig The street data to copy
1703 * @return The copied street data
1705 struct street_data *
1706 street_data_dup(struct street_data *orig)
1708 struct street_data *ret;
1709 int size=sizeof(struct street_data)+orig->count*sizeof(struct coord);
1712 memcpy(ret, orig, size);
1718 * @brief Frees street data
1720 * @param sd Street data to be freed
1723 street_data_free(struct street_data *sd)
1729 * @brief Finds the nearest street to a given coordinate
1731 * @param ms The mapset to search in for the street
1732 * @param pc The coordinate to find a street nearby
1733 * @return The nearest street
1735 static struct route_info *
1736 route_find_nearest_street(struct mapset *ms, struct pcoord *pc)
1738 struct route_info *ret=NULL;
1740 struct map_selection *sel;
1741 int dist,mindist=0,pos;
1742 struct mapset_handle *h;
1744 struct map_rect *mr;
1747 struct street_data *sd;
1754 * This is not correct for two reasons:
1755 * - You may need to go back first
1756 * - Currently we allow mixing of mapsets
1758 sel = route_rect(18, &c, &c, 0, max_dist);
1760 while ((m=mapset_next(h,1))) {
1763 if (map_projection(m) != pc->pro) {
1764 transform_to_geo(pc->pro, &c, &g);
1765 transform_from_geo(map_projection(m), &g, &c);
1767 mr=map_rect_new(m, sel);
1770 while ((item=map_rect_get_item(mr))) {
1771 if (item->type >= type_street_0 && item->type <= type_ferry) {
1772 sd=street_get_data(item);
1773 dist=transform_distance_polyline_sq(sd->c, sd->count, &c, &lp, &pos);
1774 if (!ret || dist < mindist) {
1776 street_data_free(ret->street);
1779 ret=g_new(struct route_info, 1);
1781 printf("%s:Out of memory\n", __FUNCTION__);
1789 dbg(1,"dist=%d id 0x%x 0x%x pos=%d\n", dist, item->id_hi, item->id_lo, pos);
1791 street_data_free(sd);
1794 map_rect_destroy(mr);
1797 map_selection_destroy(sel);
1803 * @brief Destroys a route_info
1805 * @param info The route info to be destroyed
1808 route_info_free(struct route_info *inf)
1811 street_data_free(inf->street);
1819 * @brief Returns street data for a route info
1821 * @param rinf The route info to return the street data for
1822 * @return Street data for the route info
1824 struct street_data *
1825 route_info_street(struct route_info *rinf)
1827 return rinf->street;
1831 struct route_crossings *
1832 route_crossings_get(struct route *this, struct coord *c)
1834 struct route_point *pnt;
1835 struct route_segment *seg;
1837 struct route_crossings *ret;
1839 pnt=route_graph_get_point(this, c);
1842 printf("start: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1844 seg=seg->start_next;
1848 printf("end: 0x%x 0x%x\n", seg->item.id_hi, seg->item.id_lo);
1852 ret=g_malloc(sizeof(struct route_crossings)+crossings*sizeof(struct route_crossing));
1853 ret->count=crossings;
1859 struct map_rect_priv {
1860 struct route_info_handle *ri;
1861 enum attr_type attr_next;
1863 struct map_priv *mpriv;
1866 unsigned int last_coord;
1867 struct route_path_segment *seg,*seg_next;
1868 struct route_graph_point *point;
1869 struct route_graph_segment *rseg;
1874 rm_coord_rewind(void *priv_data)
1876 struct map_rect_priv *mr = priv_data;
1881 rm_attr_rewind(void *priv_data)
1883 struct map_rect_priv *mr = priv_data;
1884 mr->attr_next = attr_street_item;
1888 rm_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
1890 struct map_rect_priv *mr = priv_data;
1891 struct route_path_segment *seg=mr->seg;
1892 struct route *route=mr->mpriv->route;
1893 attr->type=attr_type;
1894 switch (attr_type) {
1896 while (mr->attr_next != attr_none) {
1897 if (rm_attr_get(priv_data, mr->attr_next, attr))
1901 case attr_street_item:
1902 mr->attr_next=attr_route_follow_straight;
1903 if (seg && seg->item.map)
1904 attr->u.item=&seg->item;
1908 case attr_route_follow_straight:
1909 mr->attr_next=attr_direction;
1911 return attr_generic_get_attr(seg->attrs,NULL,attr_route_follow_straight,attr,NULL);
1914 case attr_direction:
1915 mr->attr_next=attr_length;
1917 attr->u.num=seg->direction;
1923 attr->u.num=seg->length;
1925 attr->u.num=mr->length;
1926 mr->attr_next=attr_time;
1929 mr->attr_next=attr_none;
1931 attr->u.num=route_time(route->speedlist, &seg->item, seg->length);
1936 mr->attr_next=attr_none;
1939 mr->attr_next=attr_none;
1940 attr->type=attr_none;
1947 rm_coord_get(void *priv_data, struct coord *c, int count)
1949 struct map_rect_priv *mr = priv_data;
1950 struct route_path_segment *seg = mr->seg;
1952 struct route *r = mr->mpriv->route;
1953 enum projection pro = route_projection(r);
1957 for (i=0; i < count; i++) {
1958 if (mr->last_coord >= seg->ncoords)
1960 if (i >= seg->ncoords)
1962 if (pro != projection_mg)
1963 transform_from_to(&seg->c[mr->last_coord++], pro,
1964 &c[i],projection_mg);
1966 c[i] = seg->c[mr->last_coord++];
1969 dbg(1,"return %d\n",rc);
1973 static struct item_methods methods_route_item = {
1981 rp_attr_rewind(void *priv_data)
1983 struct map_rect_priv *mr = priv_data;
1984 mr->attr_next = attr_label;
1988 rp_attr_get(void *priv_data, enum attr_type attr_type, struct attr *attr)
1990 struct map_rect_priv *mr = priv_data;
1991 struct route_graph_point *p = mr->point;
1992 if (mr->item.type != type_rg_point)
1994 switch (attr_type) {
1996 while (mr->attr_next != attr_none) {
1997 if (rp_attr_get(priv_data, mr->attr_next, attr))
2002 attr->type = attr_label;
2005 if (p->value != INT_MAX)
2006 mr->str=g_strdup_printf("%d", p->value);
2008 mr->str=g_strdup("-");
2009 attr->u.str = mr->str;
2010 mr->attr_next=attr_none;
2013 attr->type = attr_debug;
2016 mr->str=g_strdup_printf("x=%d y=%d", p->c.x, p->c.y);
2017 attr->u.str = mr->str;
2018 mr->attr_next=attr_none;
2021 mr->attr_next=attr_none;
2022 attr->type=attr_none;
2028 rp_coord_get(void *priv_data, struct coord *c, int count)
2030 struct map_rect_priv *mr = priv_data;
2031 struct route_graph_point *p = mr->point;
2032 struct route_graph_segment *seg = mr->rseg;
2034 struct route *r = mr->mpriv->route;
2035 enum projection pro = route_projection(r);
2037 for (i=0; i < count; i++) {
2038 if (mr->item.type == type_rg_point) {
2039 if (mr->last_coord >= 1)
2041 if (pro != projection_mg)
2042 transform_from_to(&p->c, pro,
2043 &c[i],projection_mg);
2047 if (mr->last_coord >= 2)
2050 if (seg->end->seg == seg)
2055 if (pro != projection_mg)
2056 transform_from_to(&seg->end->c, pro,
2057 &c[i],projection_mg);
2061 if (pro != projection_mg)
2062 transform_from_to(&seg->start->c, pro,
2063 &c[i],projection_mg);
2065 c[i] = seg->start->c;
2074 static struct item_methods methods_point_item = {
2082 rm_destroy(struct map_priv *priv)
2087 static struct map_rect_priv *
2088 rm_rect_new(struct map_priv *priv, struct map_selection *sel)
2090 struct map_rect_priv * mr;
2092 if (! route_get_pos(priv->route))
2094 if (! route_get_dst(priv->route))
2096 if (! priv->route->path2)
2098 mr=g_new0(struct map_rect_priv, 1);
2100 mr->item.priv_data = mr;
2101 mr->item.type = type_street_route;
2102 mr->item.meth = &methods_route_item;
2103 mr->seg_next=priv->route->path2->path;
2107 static struct map_rect_priv *
2108 rp_rect_new(struct map_priv *priv, struct map_selection *sel)
2110 struct map_rect_priv * mr;
2112 if (! priv->route->graph || ! priv->route->graph->route_points)
2114 mr=g_new0(struct map_rect_priv, 1);
2116 mr->item.priv_data = mr;
2117 mr->item.type = type_rg_point;
2118 mr->item.meth = &methods_point_item;
2123 rm_rect_destroy(struct map_rect_priv *mr)
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) {
2139 p = r->graph->route_points;
2145 rm_coord_rewind(mr);
2149 mr->item.type = type_rg_segment;
2152 seg=r->graph->route_segments;
2158 rm_coord_rewind(mr);
2166 static struct item *
2167 rp_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2169 struct item *ret=NULL;
2171 ret=rp_get_item(mr);
2176 static struct item *
2177 rm_get_item(struct map_rect_priv *mr)
2179 struct route *r = mr->mpriv->route;
2180 struct route_path_segment *seg = mr->seg;
2181 dbg(1,"enter\n", mr->pos);
2183 mr->seg=mr->seg_next;
2186 mr->seg_next=mr->seg->next;
2193 static struct item *
2194 rm_get_item_byid(struct map_rect_priv *mr, int id_hi, int id_lo)
2196 struct item *ret=NULL;
2198 ret=rm_get_item(mr);
2202 static struct map_methods route_meth = {
2215 static struct map_methods route_graph_meth = {
2229 route_toggle_routegraph_display(struct route *route)
2231 if (route->flags & RF_SHOWGRAPH) {
2232 route->flags &= ~RF_SHOWGRAPH;
2234 route->flags |= RF_SHOWGRAPH;
2238 static struct map_priv *
2239 route_map_new_helper(struct map_methods *meth, struct attr **attrs, int graph)
2241 struct map_priv *ret;
2242 struct attr *route_attr;
2244 route_attr=attr_search(attrs, NULL, attr_route);
2247 ret=g_new0(struct map_priv, 1);
2249 *meth=route_graph_meth;
2252 ret->route=route_attr->u.route;
2257 static struct map_priv *
2258 route_map_new(struct map_methods *meth, struct attr **attrs)
2260 return route_map_new_helper(meth, attrs, 0);
2263 static struct map_priv *
2264 route_graph_map_new(struct map_methods *meth, struct attr **attrs)
2266 return route_map_new_helper(meth, attrs, 1);
2270 route_get_map_helper(struct route *this_, struct map **map, char *type, char *description)
2273 *map=map_new((struct attr*[]){
2274 &(struct attr){attr_type,{type}},
2275 &(struct attr){attr_route,.u.route=this_},
2276 &(struct attr){attr_data,{""}},
2277 &(struct attr){attr_description,{description}},
2283 route_get_map(struct route *this_)
2285 return route_get_map_helper(this_, &this_->map, "route","Route");
2290 route_get_graph_map(struct route *this_)
2292 return route_get_map_helper(this_, &this_->graph_map, "route_graph","Route Graph");
2296 route_set_projection(struct route *this_, enum projection pro)
2303 plugin_register_map_type("route", route_map_new);
2304 plugin_register_map_type("route_graph", route_graph_map_new);