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 #define _FILE_OFFSET_BITS 64
22 #define _LARGEFILE_SOURCE
23 #define _LARGEFILE64_SOURCE
39 #ifdef HAVE_POSTGRESQL
43 #define BUFFER_SIZE 1280
45 #define GENERATE_INDEX
48 #define debug_tile(x) 0
50 #define debug_tile(x) (!strcmp(x,"bcdbd") || !strcmp(x,"bcdbd") || !strcmp(x,"bcdbda") || !strcmp(x,"bcdbdb") || !strcmp(x,"bcdbdba") || !strcmp(x,"bcdbdbb") || !strcmp(x,"bcdbdbba") || !strcmp(x,"bcdbdbaa") || !strcmp(x,"bcdbdbacaa") || !strcmp(x,"bcdbdbacab") || !strcmp(x,"bcdbdbacaba") || !strcmp(x,"bcdbdbacabaa") || !strcmp(x,"bcdbdbacabab") || !strcmp(x,"bcdbdbacababb") || !strcmp(x,"bcdbdbacababba") || !strcmp(x,"bcdbdbacababbb") || !strcmp(x,"bcdbdbacababbd") || !strcmp(x,"bcdbdbacababaa") || !strcmp(x,"bcdbdbacababab") || !strcmp(x,"bcdbdbacababac") || !strcmp(x,"bcdbdbacababad") || !strcmp(x,"bcdbdbacabaaa") || !strcmp(x,"bcdbdbacabaaba") || !strcmp(x,"bcdbdbacabaabb") || !strcmp(x,"bcdbdbacabaabc") || !strcmp(x,"bcdbdbacabaabd") || !strcmp(x,"bcdbdbacabaaaa") || !strcmp(x,"bcdbdbacabaaab") || !strcmp(x,"bcdbdbacabaaac") || !strcmp(x,"bcdbdbacabaaad") || 0)
54 static GHashTable *dedupe_ways_hash;
56 static int attr_debug_level=1;
57 static int nodeid,wayid;
58 static int report,phase;
59 static int ignore_unkown = 0, coverage=0;
61 static char *attrmap={
63 "n amenity=hospital poi_hospital\n"
64 "n amenity=atm poi_bank\n"
65 "n amenity=bank poi_bank\n"
66 "n amenity=pub poi_bar\n"
67 "n amenity=cafe poi_cafe\n"
68 "n amenity=bus_station poi_bus_station\n"
69 "n amenity=parking poi_car_parking\n"
70 "n amenity=cinema poi_cinema\n"
71 "n amenity=fire_station poi_firebrigade\n"
72 "n amenity=fuel poi_fuel\n"
73 "n amenity=courthouse poi_justice\n"
74 "n amenity=library poi_library\n"
75 "n amenity=pharmacy poi_pharmacy\n"
76 "n amenity=place_of_worship,religion=christian poi_church\n"
77 "n amenity=police poi_police\n"
78 "n amenity=post_office poi_post\n"
79 "n amenity=post_box poi_post\n"
80 "n amenity=public_building poi_public_office\n"
81 "n amenity=restaurant poi_restaurant\n"
82 "n amenity=fast_food poi_fastfood\n"
83 "n amenity=toilets poi_restroom\n"
84 "n amenity=school poi_school\n"
85 "n amenity=university poi_school\n"
86 "n amenity=college poi_school\n"
87 "n amenity=telephone poi_telephone\n"
88 "n amenity=theatre poi_theater\n"
89 "n amenity=townhall poi_townhall\n"
90 "n highway=bus_stop poi_bus_stop\n"
91 "n highway=mini_roundabout mini_roundabout\n"
92 "n highway=motorway_junction highway_exit\n"
93 "n highway=traffic_signals traffic_signals\n"
94 "n highway=turning_circle turning_circle\n"
95 "n leisure=slipway poi_boat_ramp\n"
96 "n leisure=fishing poi_fish\n"
97 "n sport=golf poi_golf\n"
98 "n leisure=golf_course poi_golf\n"
99 "n leisure=marina poi_marine\n"
100 "n leisure=sports_centre poi_sport\n"
101 "n leisure=stadium poi_stadium\n"
102 "n shop=supermarket poi_shopping\n"
103 "n shop=convenience poi_shop_grocery\n"
104 "n tourism=attraction poi_attraction\n"
105 "n tourism=camp_site poi_camp_rv\n"
106 "n tourism=caravan_site poi_camp_rv\n"
107 "n tourism=hotel poi_hotel\n"
108 "n tourism=motel poi_hotel\n"
109 "n tourism=guest_house poi_hotel\n"
110 "n tourism=hostel poi_hotel\n"
111 "n tourism=information poi_information\n"
112 "n tourism=museum poi_museum_history\n"
113 "n tourism=picnic_site poi_picnic\n"
114 "n tourism=theme_park poi_resort\n"
115 "n tourism=zoo poi_zoo\n"
116 "n amenity=grave_yard poi_cemetery\n"
117 "n landuse=cemetery poi_cemetery\n"
118 "n military=airfield poi_military\n"
119 "n military=bunker poi_military\n"
120 "n military=barracks poi_military\n"
121 "n military=range poi_military\n"
122 "n military=danger_area poi_danger_area\n"
123 "n sport=swimming poi_swimming\n"
124 "n sport=skiing poi_skiing\n"
125 "n aeroway=aerodrome poi_airport\n"
126 "n aeroway=airport poi_airport\n"
127 "n aeroway=terminal poi_airport\n"
128 "n aeroway=helipad poi_heliport\n"
129 "n man_made=tower poi_tower\n"
130 "n natural=bay poi_bay\n"
131 "n natural=peak poi_peak\n"
132 "n place=suburb district_label\n"
133 "n place=city town_label_2e5\n"
134 "n place=town town_label_2e4\n"
135 "n place=village town_label_2e3\n"
136 "n place=hamlet town_label_2e2\n"
137 "n place=locality town_label_2e0\n"
138 "n railway=halt poi_rail_halt\n"
139 "n railway=level_crossing poi_level_crossing\n"
140 "n railway=station poi_rail_station\n"
141 "n railway=tram_stop poi_rail_tram_stop\n"
142 "n amenity=park_bench poi_bench\n"
143 "n amenity=bench poi_bench\n"
144 "n amenity=biergarten poi_biergarten\n"
145 "n historic=boundary_stone poi_boundary_stone\n"
146 "n historic=castle poi_castle\n"
147 "n Annehmlichkeit=Hochsitz poi_hunting_stand\n"
148 "n amenity=hunting_stand poi_hunting_stand\n"
149 "n historic=memorial poi_memorial\n"
150 "n historic=monument poi_monument\n"
151 "n amenity=shelter poi_shelter\n"
152 "n amenity=fountain poi_fountain\n"
153 "n amenity=drinking_water poi_potable_water\n"
154 "n amenity=toilets poi_toilets\n"
155 "n tourism=viewpoint poi_viewpoint\n"
156 "w *=* street_unkn\n"
157 "w amenity=place_of_worship poly_building\n"
158 "w building=* poly_building\n"
159 "w aeroway=aerodrome poly_airport\n"
160 "w aeroway=apron poly_apron\n"
161 "w aeroway=runway aeroway_runway\n"
162 "w aeroway=taxiway aeroway_taxiway\n"
163 "w aeroway=terminal poly_terminal\n"
164 "w highway=bridleway bridleway\n"
165 "w highway=path,horse=designated bridleway\n"
166 "w highway=cycleway cycleway\n"
167 "w highway=cyclepath cycleway\n"
168 "w highway=path,bicycle=designated cycleway\n"
169 "w highway=footway footway\n"
170 "w piste:type=nordic piste_nordic\n"
171 "w route=ski piste_nordic\n"
172 "w piste:type=downhill,piste:difficulty=novice piste_downhill_novice\n"
173 "w piste:type=downhill,piste:difficulty=easy piste_downhill_easy\n"
174 "w piste:type=downhill,piste:difficulty=intermediate piste_downhill_intermediate\n"
175 "w piste:type=downhill,piste:difficulty=advanced piste_downhill_advanced\n"
176 "w piste:type=downhill,piste:difficulty=expert piste_downhill_expert\n"
177 "w piste:type=downhill,piste:difficulty=freeride piste_downhill_freeride\n"
178 "w highway=path,foot=designated footway\n"
179 "w highway=steps steps\n"
180 "w highway=path path\n"
181 "w highway=path,sac_scale=hiking hiking\n"
182 "w highway=path,sac_scale=mountain_hiking hiking_mountain\n"
183 "w highway=path,sac_scale=demanding_mountain_hiking hiking_mountain_demanding\n"
184 "w highway=path,sac_scale=alpine_hiking hiking_alpine\n"
185 "w highway=path,sac_scale=demanding_alpine_hiking hiking_alpine_demanding\n"
186 "w highway=path,sac_scale=difficult_alpine_hiking hiking_alpine_difficult\n"
187 "w highway=unsurfaced track_gravelled\n"
188 "w highway=track track_gravelled\n"
189 "w highway=track,tracktype=grade1 track_paved\n"
190 "w highway=track,surface=paved track_paved\n"
191 "w highway=track,tracktype=grade2 track_gravelled\n"
192 "w highway=track,surface=gravel track_gravelled\n"
193 "w highway=track,tracktype=grade3 track_unpaved\n"
194 "w highway=track,surface=unpaved track_unpaved\n"
195 "w highway=track,tracktype=grade4 track_ground\n"
196 "w highway=track,surface=ground track_ground\n"
197 "w highway=track,tracktype=grade5 track_grass\n"
198 "w highway=track,surface=grass track_grass\n"
199 "w highway=parking_lane street_parking_lane\n"
200 "w highway=service street_service\n"
201 "w highway=service,area=1 poly_service\n"
202 "w highway=construction street_construction\n"
203 "w highway=pedestrian street_pedestrian\n"
204 "w highway=pedestrian,area=1 poly_pedestrian\n"
205 "w highway=plaza poly_plaza\n"
206 "w landuse=plaza poly_plaza\n"
207 "w highway=residential street_1_city\n"
208 "w highway=residential,area=1 poly_street_1\n"
209 "w highway=living_street living_street\n"
210 "w highway=unclassified street_1_city\n"
211 "w highway=unclassified,area=1 poly_street_1\n"
212 "w highway=road street_1_city\n"
213 "w highway=minor street_1_land\n"
214 "w highway=tertiary street_2_city\n"
215 "w highway=tertiary,area=1 poly_street_2\n"
216 "w highway=tertiary_link ramp\n"
217 "w highway=secondary street_3_city\n"
218 "w highway=secondary,area=1 poly_street_3\n"
219 "w highway=secondary_link ramp\n"
220 "w highway=primary street_4_city\n"
221 "w highway=primary_link ramp\n"
222 "w highway=trunk street_4_city\n"
223 "w highway=trunk_link ramp\n"
224 "w highway=motorway highway_city\n"
225 "w highway=motorway_link ramp\n"
226 "w historic=town gate poly_building\n"
227 "w cycleway=track cycleway\n"
228 "w amenity=parking poly_car_parking\n"
229 "w landuse=allotments poly_allotments\n"
230 "w landuse=cemetery poly_cemetery\n"
231 "w amenity=grave_yard poly_cemetery\n"
232 "w landuse=forest poly_wood\n"
233 "w landuse=industrial poly_industry\n"
234 "w landuse=residential poly_town\n"
235 "w landuse=residential,area=1 poly_town\n"
236 "w landuse=farmyard poly_town\n"
237 "w amenity=college poly_college\n"
238 "w amenity=university poly_university\n"
239 "w tourism=camp_site poly_camp_site\n"
240 "w tourism=caravan_site poly_caravan_site\n"
241 "w tourism=picnic_site poly_picnic_site\n"
242 "w tourism=theme_park poly_theme_park\n"
243 "w tourism=attraction poly_attraction\n"
244 "w tourism=zoo poly_zoo\n"
245 "w tourism=artwork poly_artwork\n"
246 "w historic=archaeological_site poly_archaeological_site\n"
247 "w historic=ruins poly_ruins\n"
248 "w historic=battlefield poly_battlefield\n"
249 "w landuse=quarry poly_quarry\n"
250 "w landuse=landfill poly_landfill\n"
251 "w landuse=retail poly_retail\n"
252 "w landuse=commercial poly_commercial\n"
253 "w landuse=brownfield poly_brownfield\n"
254 "w landuse=greenfield poly_greenfield\n"
255 "w landuse=construction poly_construction\n"
256 "w landuse=railway poly_railway\n"
257 "w natural=glacier poly_glacier\n"
258 "w natural=scree poly_scree\n"
259 "w natural=scrub poly_scrub\n"
260 "w natural=fell poly_fell\n"
261 "w natural=heath poly_heath\n"
262 "w natural=marsh poly_marsh\n"
263 "w natural=mud poly_mud\n"
264 "w natural=beach poly_beach\n"
265 "w natural=land poly_land\n"
266 "w landuse=basin poly_basin\n"
267 "w landuse=reservoir poly_reservoir\n"
268 "w landuse=farm poly_farm\n"
269 "w landuse=farmland poly_farm\n"
270 "w landuse=vineyard poly_farm\n"
271 "w leisure=park poly_park\n"
272 "w landuse=village_green poly_village_green\n"
273 "w landuse=recreation_ground poly_recreation_ground\n"
274 "w natural=wood poly_wood\n"
275 "w natural=water poly_water\n"
276 "w natural=coastline water_line\n"
277 "w place=suburb poly_town\n"
278 "w place=town poly_town\n"
279 "w landuse=military poly_military\n"
280 "w military=airfield poly_airfield\n"
281 "w military=barracks poly_barracks\n"
282 "w military=danger_area poly_danger_area\n"
283 "w military=range poly_range\n"
284 "w military=naval_base poly_naval_base\n"
285 "w power=line powerline\n"
286 "w railway=rail rail\n"
287 "w railway=narrow_gauge rail_narrow_gauge\n"
288 "w railway=light_rail rail_light\n"
289 "w railway=subway rail_subway\n"
290 "w railway=tram rail_tram\n"
291 "w railway=monorail rail_mono\n"
292 "w railway=preserved rail_preserved\n"
293 "w railway=disused rail_disused\n"
294 "w railway=abandoned rail_abandoned\n"
295 "w aerialway=cable_car lift_cable_car\n"
296 "w aerialway=chair_lift lift_chair\n"
297 "w aerialway=drag_lift lift_drag\n"
298 "w leisure=golf_course poly_golf_course\n"
299 "w sport=* poly_sport\n"
300 "w leisure=sports_centre poly_sport\n"
301 "w leisure=stadium poly_sports_stadium\n"
302 "w leisure=track poly_sports_track\n"
303 "w leisure=pitch poly_sports_pitch\n"
304 "w leisure=water_park poly_water_park\n"
305 "w leisure=marina poly_marina\n"
306 "w leisure=fishing poly_fishing\n"
307 "w leisure=garden poly_garden\n"
308 "w leisure=common poly_common\n"
309 "w leisure=playground poly_playground\n"
310 "w leisure=nature_reserve poly_nature_reserve\n"
311 "w waterway=canal water_canal\n"
312 "w waterway=river water_river\n"
313 "w waterway=stream water_stream\n"
314 "w waterway=drain water_drain\n"
315 "w waterway=riverbank poly_water\n"
316 "w boundary=administrative border_country\n"
317 "w boundary=civil border_civil\n"
318 "w boundary=political border_political\n"
319 "w boundary=national_park border_national_park\n"
320 "w route=ferry ferry\n"
321 "w highway=bus_guideway bus_guideway\n"
327 } coord_buffer[65536];
329 #define IS_REF(c) ((c).x >= (1 << 30))
330 #define REF(c) ((c).y)
331 #define SET_REF(c,ref) do { (c).x = 1 << 30; (c).y = ref ; } while(0)
337 static void bbox_extend(struct coord *c, struct rect *r);
339 #ifdef GENERATE_INDEX
341 static GHashTable *aux_tile_hash;
342 GList *aux_tile_list;
344 struct country_table {
351 } country_table[] = {
352 { 40,"Austria,Österreich,AUT"},
354 {208,"Denmark,Danmark,DK"},
355 {246,"Finland,Suomi"},
356 {250,"France,République française,FR"},
357 {276,"Germany,Deutschland,Bundesrepublik Deutschland"},
358 {380,"Italy,Italia"},
359 {578,"Norway,Norge,Noreg,NO"},
360 {752,"Sweden,Sverige,Konungariket Sverige,SE"},
361 {528,"Nederland,The Netherlands,Niederlande,NL"},
362 {724,"Spain,Espana,Espana,Reino de Espana"},
367 static GHashTable *country_table_hash;
370 struct attr_mapping {
372 int attr_present_idx_count;
373 int attr_present_idx[0];
376 static struct attr_mapping **attr_mapping_node;
377 static int attr_mapping_node_count;
378 static struct attr_mapping **attr_mapping_way;
379 static int attr_mapping_way_count;
381 static char *attr_present;
382 static int attr_present_count;
383 static GHashTable *attr_hash;
386 static GHashTable *strings_hash = NULL;
389 static char* string_hash_lookup( const char* key )
391 char* key_ptr = NULL;
393 if ( strings_hash == NULL ) {
394 strings_hash = g_hash_table_new(g_str_hash, g_str_equal);
397 if ( ( key_ptr = g_hash_table_lookup(strings_hash, key )) == NULL ) {
398 key_ptr = g_strdup( key );
399 g_hash_table_insert(strings_hash, key_ptr, (gpointer)key_ptr );
406 build_attrmap_line(char *line)
408 char *t=NULL,*kvl=NULL,*i=NULL,*p,*kv;
409 struct attr_mapping ***attr_mapping_curr,*attr_mapping=g_malloc0(sizeof(struct attr_mapping));
410 int idx,attr_mapping_count=0,*attr_mapping_curr_count;
427 attr_mapping_curr=&attr_mapping_way;
428 attr_mapping_curr_count=&attr_mapping_way_count;
432 attr_mapping_curr=&attr_mapping_node;
433 attr_mapping_curr_count=&attr_mapping_node_count;
435 attr_mapping->type=item_from_name(i);
436 while ((kv=strtok(kvl, ","))) {
438 if (!(idx=(int)g_hash_table_lookup(attr_hash, kv))) {
439 idx=attr_present_count++;
440 g_hash_table_insert(attr_hash, kv, (gpointer) idx);
442 attr_mapping=g_realloc(attr_mapping, sizeof(struct attr_mapping)+(attr_mapping_count+1)*sizeof(int));
443 attr_mapping->attr_present_idx[attr_mapping_count++]=idx;
444 attr_mapping->attr_present_idx_count=attr_mapping_count;
446 *attr_mapping_curr=g_realloc(*attr_mapping_curr, sizeof(**attr_mapping_curr)*(*attr_mapping_curr_count+1));
447 (*attr_mapping_curr)[(*attr_mapping_curr_count)++]=attr_mapping;
451 build_attrmap(char *map)
454 attr_hash=g_hash_table_new(g_str_hash, g_str_equal);
455 attr_present_count=1;
461 build_attrmap_line(map);
464 attr_present=g_malloc0(sizeof(*attr_present)*attr_present_count);
467 #ifdef GENERATE_INDEX
469 build_countrytable(void)
472 char *names,*str,*tok;
473 country_table_hash=g_hash_table_new(g_str_hash, g_str_equal);
474 for (i = 0 ; i < sizeof(country_table)/sizeof(struct country_table) ; i++) {
475 names=g_strdup(country_table[i].names);
477 while ((tok=strtok(str, ","))) {
479 g_hash_table_insert(country_table_hash, tok, (gpointer)&country_table[i]);
487 static int processed_nodes, processed_nodes_out, processed_ways, processed_relations, processed_tiles;
488 static int in_way, in_node, in_relation;
494 signal(SIGALRM, sig_alrm);
497 fprintf(stderr,"PROGRESS%d: Processed %d nodes (%d out) %d ways %d relations %d tiles\n", phase, processed_nodes, processed_nodes_out, processed_ways, processed_relations, processed_tiles);
511 struct attr_bin label_attr = {
514 char label_attr_buffer[BUFFER_SIZE];
516 struct attr_bin town_name_attr = {
520 struct attr_bin street_name_attr = {
524 struct attr_bin street_name_systematic_attr = {
525 0, attr_street_name_systematic
527 char street_name_systematic_attr_buffer[BUFFER_SIZE];
529 struct attr_bin debug_attr = {
532 char debug_attr_buffer[BUFFER_SIZE];
534 struct attr_bin flags_attr = {
537 int flags_attr_value;
539 char is_in_buffer[BUFFER_SIZE];
542 static void write_zipmember(FILE *out, FILE *dir_out, char *name, int filelen, char *data, int data_size, int compression_level);
545 pad_text_attr(struct attr_bin *a, char *buffer)
548 if (buffer && buffer[0]) {
558 xml_get_attribute(char *xml, char *attribute, char *buffer, int buffer_size)
560 int len=strlen(attribute);
561 char *pos,*i,s,attr[len+2];
562 strcpy(attr, attribute);
563 strcpy(attr+len, "=");
564 pos=strstr(xml, attr);
574 if (i - pos > buffer_size) {
575 fprintf(stderr,"Buffer overflow %d vs %d\n", i-pos, buffer_size);
578 strncpy(buffer, pos, i-pos);
583 static int node_is_tagged;
586 add_tag(char *k, char *v)
588 GHashTable *value_hash;
591 char buffer[BUFFER_SIZE*2+2];
592 if (! strcmp(k,"ele"))
594 if (! strcmp(k,"time"))
596 if (! strcmp(k,"created_by"))
598 if (! strncmp(k,"tiger:",6) || !strcmp(k,"AND_nodes"))
600 if (! strcmp(k,"converted_by") || ! strcmp(k,"source"))
602 if (! strncmp(k,"osmarender:",11) || !strncmp(k,"svg:",4))
604 if (! strcmp(k,"layer"))
606 if (! strcasecmp(v,"true") || ! strcasecmp(v,"yes"))
608 if (! strcmp(k,"oneway")) {
609 if (!strcmp(v,"1")) {
610 flags_attr_value=AF_ONEWAY;
613 if (! strcmp(v,"-1")) {
614 flags_attr_value=AF_ONEWAYREV;
622 if (! strcmp(k,"junction")) {
623 if (! strcmp(v,"roundabout")) {
624 flags_attr_value=AF_ONEWAY;
628 if (! strcmp(k,"maxspeed")) {
631 if (! strcmp(k,"bicycle")) {
634 if (! strcmp(k,"foot")) {
637 if (! strcmp(k,"note"))
639 if (! strcmp(k,"name")) {
640 strcpy(label_attr_buffer, v);
641 pad_text_attr(&label_attr, label_attr_buffer);
644 if (! strcmp(k,"ref")) {
646 strcpy(street_name_systematic_attr_buffer, v);
647 pad_text_attr(&street_name_systematic_attr, street_name_systematic_attr_buffer);
651 if (! strcmp(k,"is_in")) {
652 strcpy(is_in_buffer, v);
655 if (! strcmp(k,"gnis:ST_alpha")) {
656 /* assume a gnis tag means it is part of the USA:
657 http://en.wikipedia.org/wiki/Geographic_Names_Information_System
658 many US towns do not have is_in tags
660 strcpy(is_in_buffer, "USA");
663 if (! strcmp(k,"lanes")) {
666 if (attr_debug_level >= level) {
667 int bytes_left = sizeof( debug_attr_buffer ) - strlen(debug_attr_buffer) - 1;
668 if ( bytes_left > 0 )
670 snprintf(debug_attr_buffer+strlen(debug_attr_buffer), bytes_left, " %s=%s", k, v);
671 debug_attr_buffer[ sizeof( debug_attr_buffer ) - 1 ] = '\0';
680 strcpy(buffer,"*=*");
681 if ((idx=(int)g_hash_table_lookup(attr_hash, buffer)))
684 sprintf(buffer,"%s=*", k);
685 if ((idx=(int)g_hash_table_lookup(attr_hash, buffer)))
688 sprintf(buffer,"*=%s", v);
689 if ((idx=(int)g_hash_table_lookup(attr_hash, buffer)))
692 sprintf(buffer,"%s=%s", k, v);
693 if ((idx=(int)g_hash_table_lookup(attr_hash, buffer)))
709 decode_entities(char *buffer)
714 while ((pos=strchr(pos, '&'))) {
716 for (i = 0 ; i < sizeof(entities)/sizeof(struct entity); i++) {
717 len=strlen(entities[i].entity);
718 if (!strncmp(pos, entities[i].entity, len)) {
720 memmove(pos+1, pos+len, strlen(pos+len)+1);
732 char k_buffer[BUFFER_SIZE];
733 char v_buffer[BUFFER_SIZE];
734 if (!xml_get_attribute(p, "k", k_buffer, BUFFER_SIZE))
736 if (!xml_get_attribute(p, "v", v_buffer, BUFFER_SIZE))
738 decode_entities(v_buffer);
739 add_tag(k_buffer, v_buffer);
751 static struct tile_head {
759 struct tile_head *next;
775 static struct buffer node_buffer = {
780 static char** th_get_subtile( const struct tile_head* th, int idx )
782 char* subtile_ptr = NULL;
783 subtile_ptr = (char*)th + sizeof( struct tile_head ) + idx * sizeof( char *);
784 return (char**)subtile_ptr;
788 extend_buffer(struct buffer *b)
790 b->malloced+=b->malloced_step;
791 b->base=realloc(b->base, b->malloced);
792 if (b->base == NULL) {
793 fprintf(stderr,"realloc of %d bytes failed\n",b->malloced);
800 GHashTable *node_hash;
803 node_buffer_to_hash(void)
805 int i,count=node_buffer.size/sizeof(struct node_item);
806 struct node_item *ni=(struct node_item *)node_buffer.base;
807 for (i = 0 ; i < count ; i++)
808 g_hash_table_insert(node_hash, (gpointer)(ni[i].id), (gpointer)i);
811 static struct node_item *ni;
814 add_node(int id, double lat, double lon)
816 if (node_buffer.size + sizeof(struct node_item) > node_buffer.malloced)
817 extend_buffer(&node_buffer);
820 item.type=type_point_unkn;
822 town_name_attr.len=0;
824 is_in_buffer[0]='\0';
825 sprintf(debug_attr_buffer,"nodeid=%d", nodeid);
826 ni=(struct node_item *)(node_buffer.base+node_buffer.size);
832 ni->c.x=lon*6371000.0*M_PI/180;
833 ni->c.y=log(tan(M_PI_4+lat*M_PI/360))*6371000.0;
834 node_buffer.size+=sizeof(struct node_item);
836 if (ni->id > nodeid_last) {
839 fprintf(stderr,"INFO: Nodes out of sequence (new %d vs old %d), adding hash\n", ni->id, nodeid_last);
840 node_hash=g_hash_table_new(NULL, NULL);
841 node_buffer_to_hash();
844 if (!g_hash_table_lookup(node_hash, (gpointer)(ni->id)))
845 g_hash_table_insert(node_hash, (gpointer)(ni->id), (gpointer)(ni-(struct node_item *)node_buffer.base));
847 node_buffer.size-=sizeof(struct node_item);
856 char id_buffer[BUFFER_SIZE];
857 char lat_buffer[BUFFER_SIZE];
858 char lon_buffer[BUFFER_SIZE];
859 if (!xml_get_attribute(p, "id", id_buffer, BUFFER_SIZE))
861 if (!xml_get_attribute(p, "lat", lat_buffer, BUFFER_SIZE))
863 if (!xml_get_attribute(p, "lon", lon_buffer, BUFFER_SIZE))
865 add_node(atoi(id_buffer), atof(lat_buffer), atof(lon_buffer));
870 static struct node_item *
871 node_item_get(int id)
873 struct node_item *ni=(struct node_item *)(node_buffer.base);
874 int count=node_buffer.size/sizeof(struct node_item);
875 int interval=count/4;
879 i=(int)(g_hash_table_lookup(node_hash, (gpointer)id));
882 while (ni[p].id != id) {
884 fprintf(stderr,"p=%d count=%d interval=%d id=%d ni[p].id=%d\n", p, count, interval, id, ni[p].id);
919 struct node_item *ni=node_item_get(id);
921 fprintf(stderr,"WARNING: node id %d not found\n", id);
933 item.type=type_street_unkn;
935 street_name_attr.len=0;
936 street_name_systematic_attr.len=0;
939 sprintf(debug_attr_buffer,"wayid=%d", wayid);
945 char id_buffer[BUFFER_SIZE];
946 if (!xml_get_attribute(p, "id", id_buffer, BUFFER_SIZE))
948 add_way(atoi(id_buffer));
953 parse_relation(char *p)
955 debug_attr_buffer[0]='\0';
960 write_attr(FILE *out, struct attr_bin *attr, void *buffer)
963 fwrite(attr, sizeof(*attr), 1, out);
964 fwrite(buffer, (attr->len-1)*4, 1, out);
969 attr_longest_match(struct attr_mapping **mapping, int mapping_count, enum item_type *types, int types_count)
971 int i,j,longest=0,ret=0,sum,val;
972 struct attr_mapping *curr;
973 for (i = 0 ; i < mapping_count ; i++) {
976 for (j = 0 ; j < curr->attr_present_idx_count ; j++) {
977 val=attr_present[curr->attr_present_idx[j]];
989 if (sum > 0 && sum == longest && ret < types_count)
990 types[ret++]=curr->type;
992 memset(attr_present, 0, sizeof(*attr_present)*attr_present_count);
1000 enum item_type types[5];
1004 if (dedupe_ways_hash) {
1005 if (g_hash_table_lookup(dedupe_ways_hash, (gpointer)wayid))
1007 g_hash_table_insert(dedupe_ways_hash, (gpointer)wayid, (gpointer)1);
1009 count=attr_longest_match(attr_mapping_way, attr_mapping_way_count, types, sizeof(types)/sizeof(enum item_type));
1010 pad_text_attr(&debug_attr, debug_attr_buffer);
1012 alen+=label_attr.len+1;
1013 if (street_name_systematic_attr.len)
1014 alen+=street_name_systematic_attr.len+1;
1016 alen+=debug_attr.len+1;
1018 alen+=flags_attr.len+1;
1022 item.type=type_street_unkn;
1023 if (coverage && item_is_street(item))
1024 item.type=type_coverage;
1025 item.clen=coord_count*2;
1026 item.len=item.clen+2+alen;
1027 fwrite(&item, sizeof(item), 1, out);
1028 fwrite(coord_buffer, coord_count*sizeof(struct coord), 1, out);
1029 if (item_is_street(item)) {
1030 street_name_attr.len=label_attr.len;
1031 write_attr(out, &street_name_attr, label_attr_buffer);
1033 write_attr(out, &label_attr, label_attr_buffer);
1034 write_attr(out, &street_name_systematic_attr, street_name_systematic_attr_buffer);
1035 write_attr(out, &debug_attr, debug_attr_buffer);
1036 write_attr(out, &flags_attr, &flags_attr_value);
1042 int alen=0,conflict=0,count;
1043 enum item_type types[5];
1044 struct country_table *result=NULL, *lookup;
1045 if (!out || ! node_is_tagged || ! nodeid)
1047 count=attr_longest_match(attr_mapping_node, attr_mapping_node_count, types, sizeof(types)/sizeof(enum item_type));
1048 pad_text_attr(&debug_attr, debug_attr_buffer);
1050 alen+=label_attr.len+1;
1052 alen+=debug_attr.len+1;
1056 item.type=type_point_unkn;
1058 item.len=item.clen+2+alen;
1059 fwrite(&item, sizeof(item), 1, out);
1060 fwrite(&ni->c, 1*sizeof(struct coord), 1, out);
1061 if (item_is_town(item)) {
1062 town_name_attr.len=label_attr.len;
1063 write_attr(out, &town_name_attr, label_attr_buffer);
1065 write_attr(out, &label_attr, label_attr_buffer);
1066 write_attr(out, &debug_attr, debug_attr_buffer);
1067 #ifdef GENERATE_INDEX
1068 if (item_is_town(item) && town_name_attr.len) {
1069 char *tok,*buf=is_in_buffer;
1070 while ((tok=strtok(buf, ","))) {
1073 lookup=g_hash_table_lookup(country_table_hash,tok);
1075 if (result && result->countryid != lookup->countryid) {
1076 fprintf(stderr,"conflict for %s %s country %d vs %d\n", label_attr_buffer, debug_attr_buffer, lookup->countryid, result->countryid);
1083 if (result && !conflict) {
1084 if (!result->file) {
1085 char *name=g_strdup_printf("country_%d.bin.unsorted", result->countryid);
1086 result->file=fopen(name,"w");
1091 item.len=item.clen+2+label_attr.len+1;
1092 fwrite(&item, sizeof(item), 1, result->file);
1093 fwrite(&ni->c, 1*sizeof(struct coord), 1, result->file);
1094 write_attr(result->file, &town_name_attr, label_attr_buffer);
1096 result->size+=(item.clen+3+label_attr.len+1)*4;
1102 processed_nodes_out++;
1106 sort_countries_compare(const void *p1, const void *p2)
1108 struct item_bin *ib1=*((struct item_bin **)p1),*ib2=*((struct item_bin **)p2);
1109 struct attr_bin *attr1,*attr2;
1111 assert(ib1->clen==2);
1112 assert(ib2->clen==2);
1113 attr1=(struct attr_bin *)((int *)(ib1+1)+ib1->clen);
1114 attr2=(struct attr_bin *)((int *)(ib2+1)+ib1->clen);
1115 assert(attr1->type == attr_town_name);
1116 assert(attr2->type == attr_town_name);
1117 s1=(char *)(attr1+1);
1118 s2=(char *)(attr2+1);
1119 return strcmp(s1, s2);
1121 fprintf(stderr,"sort_countries_compare p1=%p p2=%p %s %s\n",p1,p2,s1,s2);
1126 #ifdef GENERATE_INDEX
1128 sort_countries(void)
1131 struct country_table *co;
1133 struct item_bin *ib;
1135 char *p,*buffer,**idx,*name;
1136 for (i = 0 ; i < sizeof(country_table)/sizeof(struct country_table) ; i++) {
1137 co=&country_table[i];
1143 buffer=malloc(co->size);
1144 assert(buffer != NULL);
1145 idx=malloc(co->count*sizeof(void *));
1146 assert(idx != NULL);
1147 name=g_strdup_printf("country_%d.bin.unsorted", co->countryid);
1150 fread(buffer, co->size, 1, f);
1155 for (j = 0 ; j < co->count ; j++) {
1157 p+=(*((int *)p)+1)*4;
1159 qsort(idx, co->count, sizeof(void *), sort_countries_compare);
1160 name=g_strdup_printf("country_%d.bin", co->countryid);
1162 for (j = 0 ; j < co->count ; j++) {
1163 ib=(struct item_bin *)(idx[j]);
1164 c=(struct coord *)(ib+1);
1165 fwrite(ib, (ib->len+1)*4, 1, f);
1167 bbox_extend(c, &co->r);
1179 add_nd(char *p, int ref)
1182 struct node_item *ni;
1183 ni=node_item_get(ref);
1186 coord_buffer[coord_count++]=ni->c;
1188 SET_REF(coord_buffer[coord_count], ref);
1194 if (len > 0 && p[len-1]=='\n')
1196 fprintf(stderr,"WARNING: way %d: node %d not found (%s)\n",wayid,ref,p);
1198 if (coord_count > 65536) {
1199 fprintf(stderr,"ERROR: Overflow\n");
1207 char ref_buffer[BUFFER_SIZE];
1208 if (!xml_get_attribute(p, "ref", ref_buffer, BUFFER_SIZE))
1210 add_nd(p, atoi(ref_buffer));
1216 save_buffer(char *filename, struct buffer *b)
1219 f=fopen(filename,"wb+");
1220 fwrite(b->base, b->size, 1, f);
1225 load_buffer(char *filename, struct buffer *b)
1231 f=fopen(filename,"rb");
1232 fseek(f, 0, SEEK_END);
1233 b->size=b->malloced=ftell(f);
1234 fprintf(stderr,"reading %d bytes from %s\n", b->size, filename);
1235 fseek(f, 0, SEEK_SET);
1236 b->base=malloc(b->size);
1237 assert(b->base != NULL);
1238 fread(b->base, b->size, 1, f);
1243 phase1(FILE *in, FILE *out_ways, FILE *out_nodes)
1249 while (fgets(buffer, size, in)) {
1250 p=strchr(buffer,'<');
1252 fprintf(stderr,"WARNING: wrong line %s\n", buffer);
1255 if (!strncmp(p, "<?xml ",6)) {
1256 } else if (!strncmp(p, "<osm ",5)) {
1257 } else if (!strncmp(p, "<bound ",7)) {
1258 } else if (!strncmp(p, "<node ",6)) {
1260 fprintf(stderr,"WARNING: failed to parse %s\n", buffer);
1263 } else if (!strncmp(p, "<tag ",5)) {
1265 fprintf(stderr,"WARNING: failed to parse %s\n", buffer);
1266 } else if (!strncmp(p, "<way ",5)) {
1269 fprintf(stderr,"WARNING: failed to parse %s\n", buffer);
1271 } else if (!strncmp(p, "<nd ",4)) {
1273 fprintf(stderr,"WARNING: failed to parse %s\n", buffer);
1274 } else if (!strncmp(p, "<relation ",10)) {
1276 if (!parse_relation(p))
1277 fprintf(stderr,"WARNING: failed to parse %s\n", buffer);
1278 processed_relations++;
1279 } else if (!strncmp(p, "<member ",8)) {
1280 } else if (!strncmp(p, "</node>",7)) {
1282 end_node(out_nodes);
1283 } else if (!strncmp(p, "</way>",6)) {
1286 } else if (!strncmp(p, "</relation>",11)) {
1288 } else if (!strncmp(p, "</osm>",6)) {
1290 fprintf(stderr,"WARNING: unknown tag in %s\n", buffer);
1298 #ifdef HAVE_POSTGRESQL
1300 phase1_db(char *dbstr, FILE *out_ways, FILE *out_nodes)
1303 PGresult *res,*node,*way,*tag;
1304 int count,tagged,i,j,k;
1305 long min, max, id, tag_id, node_id;
1309 conn=PQconnectdb(dbstr);
1311 fprintf(stderr,"Failed to connect to database with '%s'\n",dbstr);
1314 res=PQexec(conn, "begin");
1316 fprintf(stderr, "Cannot begin transaction: %s\n", PQerrorMessage(conn));
1320 res=PQexec(conn, "set transaction isolation level serializable");
1322 fprintf(stderr, "Cannot set isolation level: %s\n", PQerrorMessage(conn));
1326 res=PQexec(conn, "declare node cursor for select id,x(coordinate),y(coordinate) from node order by id");
1328 fprintf(stderr, "Cannot setup cursor for nodes: %s\n", PQerrorMessage(conn));
1332 res=PQexec(conn, "declare way cursor for select id from way order by id");
1334 fprintf(stderr, "Cannot setup cursor for nodes: %s\n", PQerrorMessage(conn));
1338 res=PQexec(conn, "declare relation cursor for select id from relation order by id");
1340 fprintf(stderr, "Cannot setup cursor for nodes: %s\n", PQerrorMessage(conn));
1345 node=PQexec(conn, "fetch 100000 from node");
1347 fprintf(stderr, "Cannot setup cursor for nodes: %s\n", PQerrorMessage(conn));
1351 count=PQntuples(node);
1354 min=atol(PQgetvalue(node, 0, 0));
1355 max=atol(PQgetvalue(node, count-1, 0));
1356 sprintf(query,"select node_id,name,value from node_tag where node_id >= %ld and node_id <= %ld order by node_id", min, max);
1357 tag=PQexec(conn, query);
1359 fprintf(stderr, "Cannot query node_tag: %s\n", PQerrorMessage(conn));
1363 for (i = 0 ; i < count ; i++) {
1364 id=atol(PQgetvalue(node, i, 0));
1365 add_node(id, atof(PQgetvalue(node, i, 1)), atof(PQgetvalue(node, i, 2)));
1369 while (j < PQntuples(tag)) {
1370 tag_id=atol(PQgetvalue(tag, j, 0));
1372 add_tag(PQgetvalue(tag, j, 1), PQgetvalue(tag, j, 2));
1382 end_node(out_nodes);
1389 way=PQexec(conn, "fetch 100000 from way");
1391 fprintf(stderr, "Cannot setup cursor for ways: %s\n", PQerrorMessage(conn));
1395 count=PQntuples(way);
1398 min=atol(PQgetvalue(way, 0, 0));
1399 max=atol(PQgetvalue(way, count-1, 0));
1400 sprintf(query,"select way_id,node_id from way_node where way_id >= %ld and way_id <= %ld order by way_id,sequence_id", min, max);
1401 node=PQexec(conn, query);
1403 fprintf(stderr, "Cannot query way_node: %s\n", PQerrorMessage(conn));
1406 sprintf(query,"select way_id,name,value from way_tag where way_id >= %ld and way_id <= %ld order by way_id", min, max);
1407 tag=PQexec(conn, query);
1409 fprintf(stderr, "Cannot query way_tag: %s\n", PQerrorMessage(conn));
1414 for (i = 0 ; i < count ; i++) {
1415 id=atol(PQgetvalue(way, i, 0));
1420 while (k < PQntuples(node)) {
1421 node_id=atol(PQgetvalue(node, k, 0));
1422 if (node_id == id) {
1423 add_nd("",atol(PQgetvalue(node, k, 1)));
1432 while (j < PQntuples(tag)) {
1433 tag_id=atol(PQgetvalue(tag, j, 0));
1435 add_tag(PQgetvalue(tag, j, 1), PQgetvalue(tag, j, 2));
1453 res=PQexec(conn, "commit");
1455 fprintf(stderr, "Cannot commit transaction: %s\n", PQerrorMessage(conn));
1465 static char buffer[150000];
1469 static struct item_bin *
1472 struct item_bin *ib=(struct item_bin *) buffer;
1474 r=fread(ib, sizeof(*ib), 1, in);
1478 assert((ib->len+1) < sizeof(buffer));
1479 s=(ib->len+1)*4-sizeof(*ib);
1480 r=fread(ib+1, s, 1, in);
1488 bbox_extend(struct coord *c, struct rect *r)
1501 bbox(struct coord *c, int count, struct rect *r)
1514 contains_bbox(int xl, int yl, int xh, int yh, struct rect *r)
1516 if (r->h.x < xl || r->h.x > xh) {
1519 if (r->l.x > xh || r->l.x < xl) {
1522 if (r->h.y < yl || r->h.y > yh) {
1525 if (r->l.y > yh || r->l.y < yl) {
1531 struct rect world_bbox = {
1532 { -20000000, -20000000},
1533 { 20000000, 20000000},
1537 tile(struct rect *r, char *ret, int max)
1546 for (i = 0 ; i < max ; i++) {
1553 if ( contains_bbox(x0,y0,x2,y2,r)) {
1557 } else if (contains_bbox(x2,y0,x4,y2,r)) {
1561 } else if (contains_bbox(x0,y2,x2,y4,r)) {
1565 } else if (contains_bbox(x2,y2,x4,y4,r)) {
1575 tile_bbox(char *tile, struct rect *r)
1580 c.x=(r->l.x+r->h.x)/2;
1581 c.y=(r->l.y+r->h.y)/2;
1604 GHashTable *tile_hash;
1605 GHashTable *tile_hash2;
1608 tile_extend(char *tile, struct item_bin *ib, GList **tiles_list)
1610 struct tile_head *th=NULL;
1611 if (debug_tile(tile))
1612 fprintf(stderr,"Tile:Writing %d bytes to '%s' (%p,%p)\n", (ib->len+1)*4, tile, g_hash_table_lookup(tile_hash, tile), tile_hash2 ? g_hash_table_lookup(tile_hash2, tile) : NULL);
1614 th=g_hash_table_lookup(tile_hash2, tile);
1616 th=g_hash_table_lookup(tile_hash, tile);
1618 th=malloc(sizeof(struct tile_head)+ sizeof( char* ) );
1620 // strcpy(th->subtiles, tile);
1623 th->total_size_used=0;
1626 th->name=string_hash_lookup(tile);
1627 *th_get_subtile( th, 0 ) = th->name;
1630 g_hash_table_insert(tile_hash2, string_hash_lookup( th->name ), th);
1632 *tiles_list=g_list_append(*tiles_list, string_hash_lookup( th->name ) );
1634 if (debug_tile(tile))
1635 fprintf(stderr,"new '%s'\n", tile);
1637 th->total_size+=ib->len*4+4;
1638 if (debug_tile(tile))
1639 fprintf(stderr,"New total size of %s(%p):%d\n", th->name, th, th->total_size);
1640 g_hash_table_insert(tile_hash, string_hash_lookup( th->name ), th);
1644 tile_data_size(char *tile)
1646 struct tile_head *th;
1647 th=g_hash_table_lookup(tile_hash, tile);
1650 return th->total_size;
1654 merge_tile(char *base, char *sub)
1656 struct tile_head *thb, *ths;
1657 thb=g_hash_table_lookup(tile_hash, base);
1658 ths=g_hash_table_lookup(tile_hash, sub);
1661 if (debug_tile(base) || debug_tile(sub))
1662 fprintf(stderr,"merging '%s'(%p) (%d) with '%s'(%p) (%d)\n", base, thb, thb ? thb->total_size : 0, sub, ths, ths->total_size);
1665 g_hash_table_remove(tile_hash, sub);
1666 thb->name=string_hash_lookup(base);
1667 g_hash_table_insert(tile_hash, string_hash_lookup( thb->name ), thb);
1670 thb=realloc(thb, sizeof(struct tile_head)+( ths->num_subtiles+thb->num_subtiles ) * sizeof( char*) );
1671 assert(thb != NULL);
1672 memcpy( th_get_subtile( thb, thb->num_subtiles ), th_get_subtile( ths, 0 ), ths->num_subtiles * sizeof( char*) );
1673 thb->num_subtiles+=ths->num_subtiles;
1674 thb->total_size+=ths->total_size;
1675 g_hash_table_insert(tile_hash, string_hash_lookup( thb->name ), thb);
1676 g_hash_table_remove(tile_hash, sub);
1684 get_tiles_list_func(char *key, struct tile_head *th, GList **list)
1686 *list=g_list_prepend(*list, key);
1690 get_tiles_list(void)
1693 g_hash_table_foreach(tile_hash, (GHFunc)get_tiles_list_func, &ret);
1699 write_tile(char *key, struct tile_head *th, gpointer dummy)
1703 fprintf(stderr,"DEBUG: Writing %s\n", key);
1704 strcpy(buffer,"tiles/");
1707 strcat(buffer,".bin");
1709 f=fopen(buffer, "wb+");
1711 fwrite(th->data, th->size, 1, f);
1719 write_item(char *tile, struct item_bin *ib)
1721 struct tile_head *th;
1724 th=g_hash_table_lookup(tile_hash2, tile);
1726 th=g_hash_table_lookup(tile_hash, tile);
1728 if (th->process != 0 && th->process != 1) {
1729 fprintf(stderr,"error with tile '%s' of length %d\n", tile, strlen(tile));
1734 if (debug_tile(tile))
1735 fprintf(stderr,"Data:Writing %d bytes to '%s' (%p,%p)\n", (ib->len+1)*4, tile, g_hash_table_lookup(tile_hash, tile), tile_hash2 ? g_hash_table_lookup(tile_hash2, tile) : NULL);
1737 if (th->total_size_used+size > th->total_size) {
1738 fprintf(stderr,"Overflow in tile %s (used %d max %d item %d)\n", tile, th->total_size_used, th->total_size, size);
1742 memcpy(th->zip_data+th->total_size_used, ib, size);
1743 th->total_size_used+=size;
1745 fprintf(stderr,"no tile hash found for %s\n", tile);
1752 write_item_part(FILE *out, struct item_bin *orig, int first, int last)
1754 struct item_bin new;
1755 struct coord *c=(struct coord *)(orig+1);
1756 char *attr=(char *)(c+orig->clen/2);
1757 int attr_len=orig->len-orig->clen-2;
1759 new.type=orig->type;
1760 new.clen=(last-first+1)*2;
1761 new.len=new.clen+attr_len+2;
1763 fprintf(stderr,"first %d last %d type 0x%x len %d clen %d attr_len %d\n", first, last, new.type, new.len, new.clen, attr_len);
1765 fwrite(&new, sizeof(new), 1, out);
1766 fwrite(c+first, new.clen*4, 1, out);
1767 fwrite(attr, attr_len*4, 1, out);
1771 phase2(FILE *in, FILE *out)
1774 int i,ccount,last,ndref;
1775 struct item_bin *ib;
1776 struct node_item *ni;
1778 processed_nodes=processed_nodes_out=processed_ways=processed_relations=processed_tiles=0;
1780 while ((ib=read_item(in))) {
1782 fprintf(stderr,"type 0x%x len %d clen %d\n", ib->type, ib->len, ib->clen);
1785 c=(struct coord *)(ib+1);
1787 for (i = 0 ; i < ccount ; i++) {
1790 ni=node_item_get(ndref);
1792 fprintf(stderr,"ni=%p\n", ni);
1795 if (ni->ref_way > 1 && i != 0 && i != ccount-1 && item_is_street(*ib)) {
1796 write_item_part(out, ib, last, i);
1801 write_item_part(out, ib, last, ccount-1);
1809 phase34_process_file(int phase, FILE *in)
1811 struct item_bin *ib;
1816 while ((ib=read_item(in))) {
1817 if (ib->type < 0x80000000)
1821 bbox((struct coord *)(ib+1), ib->clen/2, &r);
1824 if (ib->type == type_street_n_lanes || ib->type == type_highway_city || ib->type == type_highway_land || ib->type == type_ramp)
1826 if (ib->type == type_street_3_city || ib->type == type_street_4_city || ib->type == type_street_3_land || ib->type == type_street_4_land)
1829 tile(&r, buffer, max);
1831 fprintf(stderr,"%s\n", buffer);
1834 tile_extend(buffer, ib, NULL);
1836 write_item(buffer, ib);
1841 struct item_bin item;
1843 struct attr_bin attr_order;
1846 struct attr_bin attr_zipfile_ref;
1851 index_submap_add(int phase, struct tile_head *th, GList **tiles_list)
1853 struct index_item ii;
1854 int len=strlen(th->name);
1855 char index_tile[len+1];
1857 ii.min=(len > 4) ? len-4 : 0;
1859 strcpy(index_tile, th->name);
1865 tile_bbox(th->name, &ii.r);
1867 ii.item.len=sizeof(ii)/4-1;
1868 ii.item.type=type_submap;
1871 ii.attr_order.len=2;
1872 ii.attr_order.type=attr_order;
1874 ii.attr_zipfile_ref.len=2;
1875 ii.attr_zipfile_ref.type=attr_zipfile_ref;
1876 ii.zipfile_ref=th->zipnum;
1879 tile_extend(index_tile, (struct item_bin *)&ii, tiles_list);
1881 write_item(index_tile, (struct item_bin *)&ii);
1883 unsigned int *c=(unsigned int *)ⅈ
1885 for (i = 0 ; i < sizeof(ii)/4 ; i++) {
1886 fprintf(stderr,"%08x ", c[i]);
1888 fprintf(stderr,"\n");
1893 add_tile_hash(struct tile_head *th)
1895 int idx,len,maxnamelen=0;
1899 g_hash_table_insert(tile_hash2, string_hash_lookup( th->name ), th);
1901 for( idx = 0; idx < th->num_subtiles; idx++ ) {
1903 data = th_get_subtile( th, idx );
1905 if (debug_tile(data) || debug_tile(th->name)) {
1906 fprintf(stderr,"Parent for '%s' is '%s'\n", *data, th->name);
1909 g_hash_table_insert(tile_hash2, *data, th);
1911 len = strlen( *data );
1913 if (len > maxnamelen) {
1922 create_tile_hash(void)
1924 struct tile_head *th;
1925 int len,maxnamelen=0;
1927 tile_hash2=g_hash_table_new(g_str_hash, g_str_equal);
1930 len=add_tile_hash(th);
1931 if (len > maxnamelen)
1939 create_tile_hash_list(GList *list)
1942 struct tile_head *th;
1944 tile_hash2=g_hash_table_new(g_str_hash, g_str_equal);
1946 fprintf(stderr,"list=%p\n", list);
1947 next=g_list_first(list);
1949 th=g_hash_table_lookup(tile_hash, next->data);
1951 fprintf(stderr,"No tile found for '%s'\n", (char *)(next->data));
1954 next=g_list_next(next);
1959 destroy_tile_hash(void)
1961 g_hash_table_destroy(tile_hash2);
1967 static void write_countrydir(int phase, int maxnamelen);
1970 write_tilesdir(int phase, int maxlen, FILE *out)
1973 GList *tiles_list,*next;
1975 struct tile_head *th,**last=NULL;
1978 tiles_list=get_tiles_list();
1980 create_tile_hash_list(tiles_list);
1981 next=g_list_first(tiles_list);
1982 last=&tile_head_root;
1985 if (strlen(next->data) > maxlen)
1986 maxlen=strlen(next->data);
1987 next=g_list_next(next);
1993 fprintf(stderr,"PROGRESS: collecting tiles with len=%d\n", len);
1995 #ifdef GENERATE_INDEX
1997 write_countrydir(phase, maxlen);
1999 next=g_list_first(tiles_list);
2001 if (strlen(next->data) == len) {
2002 th=g_hash_table_lookup(tile_hash, next->data);
2008 fprintf(out,"%s:%d",(char *)next->data,th->total_size);
2010 for ( idx = 0; idx< th->num_subtiles; idx++ ){
2011 data= th_get_subtile( th, idx );
2012 fprintf(out,":%s", *data);
2018 index_submap_add(phase, th, &tiles_list);
2022 next=g_list_next(next);
2031 struct tile_head *th;
2032 char basetile[1024];
2034 GList *tiles_list_sorted,*last;
2035 int i,i_min,len,size_all,size[5],size_min,work_done;
2039 tiles_list_sorted=get_tiles_list();
2040 fprintf(stderr,"PROGRESS: sorting %d tiles\n", g_list_length(tiles_list_sorted));
2041 tiles_list_sorted=g_list_sort(tiles_list_sorted, (GCompareFunc)strcmp);
2042 fprintf(stderr,"PROGRESS: sorting %d tiles done\n", g_list_length(tiles_list_sorted));
2043 last=g_list_last(tiles_list_sorted);
2046 th=g_hash_table_lookup(tile_hash, last->data);
2047 zip_size+=th->total_size;
2048 last=g_list_previous(last);
2050 fprintf(stderr,"DEBUG: size=%Ld\n", zip_size);
2051 last=g_list_last(tiles_list_sorted);
2055 len=strlen(last->data);
2057 strcpy(basetile,last->data);
2058 basetile[len-1]='\0';
2059 strcpy(subtile,last->data);
2060 for (i = 0 ; i < 4 ; i++) {
2061 subtile[len-1]='a'+i;
2062 size[i]=tile_data_size(subtile);
2064 size[4]=tile_data_size(basetile);
2065 size_all=size[0]+size[1]+size[2]+size[3]+size[4];
2066 if (size_all < 65536 && size_all > 0 && size_all != size[4]) {
2067 for (i = 0 ; i < 4 ; i++) {
2068 subtile[len-1]='a'+i;
2069 work_done+=merge_tile(basetile, subtile);
2075 for (i = 0 ; i < 4 ; i++) {
2076 if (size[i] && size[i] < size_min) {
2083 if (size[4]+size_min >= 65536)
2085 subtile[len-1]='a'+i_min;
2086 work_done+=merge_tile(basetile, subtile);
2087 size[4]+=size[i_min];
2092 last=g_list_previous(last);
2094 g_list_free(tiles_list_sorted);
2095 fprintf(stderr,"PROGRESS: merged %d tiles\n", work_done);
2096 } while (work_done);
2099 struct country_index_item {
2100 struct item_bin item;
2101 struct attr_bin attr_country_id;
2103 struct attr_bin attr_zipfile_ref;
2108 index_country_add(int phase, int country_id, int zipnum)
2110 struct country_index_item ii;
2111 char *index_tile="";
2113 ii.item.len=sizeof(ii)/4-1;
2114 ii.item.type=type_countryindex;
2117 ii.attr_country_id.len=2;
2118 ii.attr_country_id.type=attr_country_id;
2119 ii.country_id=country_id;
2121 ii.attr_zipfile_ref.len=2;
2122 ii.attr_zipfile_ref.type=attr_zipfile_ref;
2123 ii.zipfile_ref=zipnum;
2126 tile_extend(index_tile, (struct item_bin *)&ii, NULL);
2128 write_item(index_tile, (struct item_bin *)&ii);
2131 #ifdef GENERATE_INDEX
2139 add_aux_tile(int phase, char *name, char *filename, int size)
2141 struct aux_tile *at;
2143 at=g_new0(struct aux_tile, 1);
2144 at->name=g_strdup(name);
2145 at->filename=g_strdup(filename);
2147 aux_tile_list=g_list_append(aux_tile_list, at);
2153 write_aux_tiles(FILE *out, FILE *dir_out, int compression_level, int namelen)
2155 GList *l=aux_tile_list;
2156 struct aux_tile *at;
2163 buffer=malloc(at->size);
2164 assert(buffer != NULL);
2165 f=fopen(at->filename,"r");
2167 fread(buffer, at->size, 1, f);
2169 write_zipmember(out, dir_out, at->name, namelen, buffer, at->size, compression_level);
2177 write_countrydir(int phase, int maxnamelen)
2182 char searchtile[32];
2184 struct country_table *co;
2185 for (i = 0 ; i < sizeof(country_table)/sizeof(struct country_table) ; i++) {
2186 co=&country_table[i];
2189 tile(&co->r, tilename, max);
2190 sprintf(searchtile,"%ss%d", tilename, 0);
2191 sprintf(filename,"country_%d.bin", co->countryid);
2192 zipnum=add_aux_tile(phase, searchtile, filename, co->size);
2193 index_country_add(phase,co->countryid,zipnum);
2199 remove_countryfiles(void)
2203 struct country_table *co;
2205 for (i = 0 ; i < sizeof(country_table)/sizeof(struct country_table) ; i++) {
2206 co=&country_table[i];
2208 sprintf(filename,"country_%d.bin", co->countryid);
2216 phase34(int phase, int maxnamelen, FILE *ways_in, FILE *nodes_in, FILE *tilesdir_out)
2219 processed_nodes=processed_nodes_out=processed_ways=processed_relations=processed_tiles=0;
2223 tile_hash=g_hash_table_new(g_str_hash, g_str_equal);
2225 phase34_process_file(phase, ways_in);
2227 phase34_process_file(phase, nodes_in);
2228 fprintf(stderr,"read %d bytes\n", bytes_read);
2233 write_tilesdir(phase, maxnamelen, tilesdir_out);
2240 dump_coord(struct coord *c)
2242 printf("0x%x 0x%x",c->x, c->y);
2248 struct item_bin *ib;
2256 while ((ib=read_item(in))) {
2257 c=(struct coord *)(ib+1);
2258 if (ib->type < type_line) {
2262 attr_start=(int *)(ib+1)+ib->clen;
2263 attr_end=(int *)ib+ib->len+1;
2264 printf("type=%s", item_to_name(ib->type));
2265 while (attr_start < attr_end) {
2266 a=(struct attr_bin *)(attr_start);
2267 attr_start+=a->len+1;
2269 attr_data_set(&attr, (a+1));
2270 str=attr_to_text(&attr, NULL, 1);
2271 printf(" %s=\"%s\"", attr_to_name(a->type), str);
2274 printf(" debug=\"length=%d\"", ib->len);
2276 if (ib->type >= type_line) {
2277 for (i = 0 ; i < ib->clen/2 ; i++) {
2287 phase3(FILE *ways_in, FILE *nodes_in, FILE *tilesdir_out)
2289 return phase34(3, 0, ways_in, nodes_in, tilesdir_out);
2292 static long long zipoffset;
2293 static int zipdir_size;
2296 compress2_int(Byte *dest, uLongf *destLen, const Bytef *source, uLong sourceLen, int level)
2301 stream.next_in = (Bytef*)source;
2302 stream.avail_in = (uInt)sourceLen;
2303 stream.next_out = dest;
2304 stream.avail_out = (uInt)*destLen;
2305 if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;
2307 stream.zalloc = (alloc_func)0;
2308 stream.zfree = (free_func)0;
2309 stream.opaque = (voidpf)0;
2311 err = deflateInit2(&stream, level, Z_DEFLATED, -15, 9, Z_DEFAULT_STRATEGY);
2312 if (err != Z_OK) return err;
2314 err = deflate(&stream, Z_FINISH);
2315 if (err != Z_STREAM_END) {
2316 deflateEnd(&stream);
2317 return err == Z_OK ? Z_BUF_ERROR : err;
2319 *destLen = stream.total_out;
2321 err = deflateEnd(&stream);
2326 write_zipmember(FILE *out, FILE *dir_out, char *name, int filelen, char *data, int data_size, int compression_level)
2328 struct zip_lfh lfh = {
2341 struct zip_cd cd = {
2362 char filename[filelen+1];
2363 int error,crc,len,comp_size=data_size;
2364 uLongf destlen=data_size+data_size/500+12;
2365 char compbuffer[destlen];
2367 crc=crc32(0, NULL, 0);
2368 crc=crc32(crc, (unsigned char *)data, data_size);
2369 if (compression_level) {
2370 error=compress2_int((Byte *)compbuffer, &destlen, (Bytef *)data, data_size, compression_level);
2371 if (error == Z_OK) {
2372 if (destlen < data_size) {
2377 fprintf(stderr,"compress2 returned %d\n", error);
2381 lfh.zipsize=comp_size;
2382 lfh.zipuncmp=data_size;
2383 lfh.zipmthd=compression_level ? 8:0;
2385 cd.zipcsiz=comp_size;
2386 cd.zipcunc=data_size;
2387 cd.zipcmthd=compression_level ? 8:0;
2388 strcpy(filename, name);
2389 len=strlen(filename);
2390 while (len < filelen) {
2391 filename[len++]='_';
2393 filename[filelen]='\0';
2394 fwrite(&lfh, sizeof(lfh), 1, out);
2395 fwrite(filename, filelen, 1, out);
2396 fwrite(data, comp_size, 1, out);
2397 zipoffset+=sizeof(lfh)+filelen+comp_size;
2398 fwrite(&cd, sizeof(cd), 1, dir_out);
2399 fwrite(filename, filelen, 1, dir_out);
2400 zipdir_size+=sizeof(cd)+filelen;
2404 process_slice(FILE *ways_in, FILE *nodes_in, int size, int maxnamelen, FILE *out, FILE *dir_out, int compression_level)
2406 struct tile_head *th;
2407 char *slice_data,*zip_data;
2410 slice_data=malloc(size);
2411 assert(slice_data != NULL);
2412 zip_data=slice_data;
2416 th->zip_data=zip_data;
2417 zip_data+=th->total_size;
2422 fseek(ways_in, 0, SEEK_SET);
2424 fseek(nodes_in, 0, SEEK_SET);
2425 phase34(4, maxnamelen, ways_in, nodes_in, NULL);
2430 #ifdef GENERATE_INDEX
2431 if (! strlen(th->name))
2432 zipfiles+=write_aux_tiles(out, dir_out, compression_level, maxnamelen);
2434 if (th->total_size != th->total_size_used) {
2435 fprintf(stderr,"Size error '%s': %d vs %d\n", th->name, th->total_size, th->total_size_used);
2438 if (strlen(th->name))
2439 write_zipmember(out, dir_out, th->name, maxnamelen, th->zip_data, th->total_size, compression_level);
2441 write_zipmember(out, dir_out, "index", sizeof("index")-1, th->zip_data, th->total_size, compression_level);
2454 cat(FILE *in, FILE *out)
2458 while ((size=fread(buffer, 1, 4096, in)))
2459 fwrite(buffer, 1, size, out);
2463 phase4(FILE *ways_in, FILE *nodes_in, FILE *out, FILE *dir_out, int compression_level)
2465 int slice_size=1024*1024*1024;
2466 int maxnamelen,size,slices;
2468 struct tile_head *th,*th2;
2469 struct zip_eoc eoc = {
2480 maxnamelen=create_tile_hash();
2485 fprintf(stderr, "Maximum slice size %d\n", slice_size);
2487 if (size + th->total_size > slice_size) {
2488 fprintf(stderr,"Slice %d is of size %d\n", slices, size);
2492 size+=th->total_size;
2496 fprintf(stderr,"Slice %d is of size %d\n", slices, size);
2507 while (th && size+th->total_size < slice_size) {
2508 size+=th->total_size;
2512 zipfiles+=process_slice(ways_in, nodes_in, size, maxnamelen, out, dir_out, compression_level);
2515 fseek(dir_out, 0, SEEK_SET);
2517 eoc.zipenum=zipfiles;
2518 eoc.zipecenn=zipfiles;
2519 eoc.zipecsz=zipdir_size;
2520 eoc.zipeofst=zipoffset;
2521 fwrite(&eoc, sizeof(eoc), 1, out);
2531 fprintf(f,"osm2navit - parse osm textfile and converts to NavIt binfile format\n\n");
2532 fprintf(f,"Usage :\n");
2533 fprintf(f,"bzcat planet.osm.bz2 | osm2navit mymap.bin\n");
2534 fprintf(f,"Available switches:\n");
2535 fprintf(f,"-h (--help) : this screen\n");
2536 fprintf(f,"-N (--nodes-only) : process only nodes\n");
2537 fprintf(f,"-W (--ways-only) : process only ways\n");
2538 fprintf(f,"-a (--attr-debug-level) : control which data is included in the debug attribute\n");
2539 fprintf(f,"-c (--dump-coordinates) : dump coordinates after phase 1\n");
2540 #ifdef HAVE_POSTGRESQL
2541 fprintf(f,"-d (--db) : get osm data out of a postgresql database with osm simple scheme and given connect string\n");
2543 fprintf(f,"-e (--end) : end at specified phase\n");
2544 fprintf(f,"-k (--keep-tmpfiles) : do not delete tmp files after processing. useful to reuse them\n\n");
2545 fprintf(f,"-o (--coverage) : map every street to item overage\n");
2546 fprintf(f,"-s (--start) : start at specified phase\n");
2547 fprintf(f,"-i (--input-file) : specify the input file name (OSM), overrules default stdin\n");
2548 fprintf(f,"-w (--dedupe-ways) : ensure no duplicate ways or nodes. useful when using several input files\n");
2549 fprintf(f,"-z (--compression-level) : set the compression level\n");
2554 process_binfile(FILE *in, FILE *out)
2556 struct item_bin *ib;
2557 while ((ib=read_item(in))) {
2558 fwrite(ib, (ib->len+1)*4, 1, out);
2562 int main(int argc, char **argv)
2564 FILE *ways=NULL,*ways_split=NULL,*nodes=NULL,*tilesdir,*zipdir,*res;
2565 char *map=g_strdup(attrmap);
2566 int i,c,start=1,end=4,dump_coordinates=0;
2567 int keep_tmpfiles=0;
2568 int process_nodes=1, process_ways=1;
2569 int compression_level=9;
2572 char *result,*dbstr=NULL;
2573 FILE* input_file = stdin;
2574 struct plugins *plugins=NULL;
2575 struct attr **attrs;
2579 int this_option_optind = optind ? optind : 1;
2581 int option_index = 0;
2582 static struct option long_options[] = {
2583 {"attr-debug-level", 1, 0, 'a'},
2584 {"binfile", 0, 0, 'b'},
2585 {"compression-level", 1, 0, 'z'},
2586 {"coverage", 0, 0, 'o'},
2587 #ifdef HAVE_POSTGRESQL
2590 {"dedupe-ways", 0, 0, 'w'},
2591 {"dump", 0, 0, 'D'},
2593 {"help", 0, 0, 'h'},
2594 {"keep-tmpfiles", 0, 0, 'k'},
2595 {"nodes-only", 0, 0, 'N'},
2597 {"plugin", 1, 0, 'p'},
2598 {"start", 1, 0, 's'},
2599 {"input-file", 1, 0, 'i'},
2600 {"ignore-unknown", 0, 0, 'n'},
2601 {"ways-only", 0, 0, 'W'},
2604 c = getopt_long (argc, argv, "DNWa:bc"
2605 #ifdef HAVE_POSTGRESQL
2608 "e:hi:knm:ps:w", long_options, &option_index);
2622 attr_debug_level=atoi(optarg);
2630 #ifdef HAVE_POSTGRESQL
2642 attrs=(struct attr*[]){
2643 &(struct attr){attr_type,{"textfile"}},
2644 &(struct attr){attr_data,{"bookmark.txt"}},
2647 fprintf(stderr,"optarg=%s\n", optarg);
2650 fprintf(stderr,"I will IGNORE unknown types\n");
2654 fprintf(stderr,"I will KEEP tmp files\n");
2662 plugins=plugins_new();
2663 attrs=(struct attr*[]){&(struct attr){attr_path,{optarg}},NULL};
2664 plugins_add_path(plugins, attrs);
2670 dedupe_ways_hash=g_hash_table_new(NULL, NULL);
2673 input_file = fopen( optarg, "r" );
2674 if ( input_file == NULL )
2676 fprintf( stderr, "\nInput file (%s) not found\n", optarg );
2681 compression_level=atoi(optarg);
2687 fprintf(stderr,"c=%d\n", c);
2691 if (optind != argc-(output == 1 ? 0:1))
2694 plugins_init(plugins);
2695 result=argv[optind];
2697 #ifdef GENERATE_INDEX
2698 build_countrytable();
2705 ways=fopen("ways.tmp","wb+");
2707 nodes=fopen("nodes.tmp","wb+");
2709 fprintf(stderr,"PROGRESS: Phase 1: collecting data\n");
2710 #ifdef HAVE_POSTGRESQL
2712 phase1_db(dbstr,ways,nodes);
2715 phase1(input_file,ways,nodes);
2720 #ifdef GENERATE_INDEX
2721 fprintf(stderr,"PROGRESS: Phase 1: sorting countries\n");
2725 if (end == 1 || dump_coordinates)
2726 save_buffer("coords.tmp",&node_buffer);
2730 load_buffer("coords.tmp",&node_buffer);
2733 ways=fopen("ways.tmp","rb");
2734 ways_split=fopen("ways_split.tmp","wb+");
2736 fprintf(stderr,"PROGRESS: Phase 2: finding intersections\n");
2737 phase2(ways,ways_split);
2743 fprintf(stderr,"PROGRESS: Skipping Phase 2\n");
2745 free(node_buffer.base);
2746 node_buffer.base=NULL;
2747 node_buffer.malloced=0;
2752 ways_split=fopen("ways_split.tmp","wb+");
2753 process_binfile(stdin, ways_split);
2757 fprintf(stderr,"PROGRESS: Phase 3: dumping\n");
2758 if (process_nodes) {
2759 nodes=fopen("nodes.tmp","rb");
2766 ways_split=fopen("ways_split.tmp","rb");
2776 fprintf(stderr,"PROGRESS: Phase 3: generating tiles\n");
2778 ways_split=fopen("ways_split.tmp","rb");
2780 nodes=fopen("nodes.tmp","rb");
2781 tilesdir=fopen("tilesdir.tmp","wb+");
2782 phase3(ways_split,nodes,tilesdir);
2793 fprintf(stderr,"PROGRESS: Phase 4: assembling map\n");
2795 ways_split=fopen("ways_split.tmp","rb");
2797 nodes=fopen("nodes.tmp","rb");
2798 res=fopen(result,"wb+");
2799 zipdir=fopen("zipdir.tmp","wb+");
2800 phase4(ways_split,nodes,res,zipdir,compression_level);
2807 if(!keep_tmpfiles) {
2808 remove("nodes.tmp");
2809 remove("ways_split.tmp");
2810 remove("tilesdir.tmp");
2811 remove("zipdir.tmp");
2812 #ifdef GENERATE_INDEX
2813 remove_countryfiles();