summaryrefslogtreecommitdiff
path: root/navit/maptool/boundaries.c
blob: c6472addadc0465762cc0b342cff7bacd85bd3ed (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
/**
 * Navit, a modular navigation system.
 * Copyright (C) 2005-2011 Navit Team
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * version 2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the
 * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA  02110-1301, USA.
 */
#include <stdio.h>
#include <string.h>
#include "maptool.h"
#ifdef _MSC_VER
#define strcasecmp _stricmp
#endif

char *
osm_tag_value(struct item_bin *ib, char *key) {
    char *tag=NULL;
    int len=strlen(key);
    while ((tag=item_bin_get_attr(ib, attr_osm_tag, tag))) {
        if (!strncmp(tag,key,len) && tag[len] == '=')
            return tag+len+1;
    }
    return NULL;
}

#if 0
static char *
osm_tag_name(struct item_bin *ib) {
    return osm_tag_value(ib, "name");
}
#endif

osmid
boundary_relid(struct boundary *b) {
    long long *id;
    if (!b)
        return 0;
    if (!b->ib)
        return 0;
    id=item_bin_get_attr(b->ib, attr_osm_relationid, NULL);
    if (id)
        return *id;
    return 0;
}
static void
process_boundaries_member(void *func_priv, void *relation_priv, struct item_bin *member, void *member_priv) {
    struct boundary *b=relation_priv;
    enum geom_poly_segment_type role=(long)member_priv;
    int *dup;
    dup=item_bin_get_attr(member,attr_duplicate,NULL);
    if(!dup || *dup==0)
        b->segments=g_list_prepend(b->segments,item_bin_to_poly_segment(member, role));
}

static GList *
process_boundaries_setup(FILE *boundaries, struct relations *relations) {
    struct item_bin *ib;
    GList *boundaries_list=NULL;
    struct relations_func *relations_func;

    relations_func=relations_func_new(process_boundaries_member, NULL);
    while ((ib=read_item(boundaries))) {
        char *member=NULL;
        struct boundary *boundary=g_new0(struct boundary, 1);
        char *admin_level=osm_tag_value(ib, "admin_level");
        char *iso=osm_tag_value(ib, "ISO3166-1");
        int has_subrelations=0;
        int has_outer_ways=0;

        processed_relations++;

        if(!iso)
            iso=osm_tag_value(ib, "iso3166-1:alpha2");

        if (admin_level && !strcmp(admin_level, "2")) {
            if(!iso) {
                char *int_name=osm_tag_value(ib,"int_name");
                if(int_name && !strcmp(int_name,"France"))
                    iso="FR";
            }
            if (iso) {
                struct country_table *country=country_from_iso2(iso);
                if (!country)
                    osm_warning("relation",item_bin_get_relationid(ib),0,"Country Boundary contains unknown ISO3166-1 value '%s'\n",iso);
                else {
                    boundary->iso2=g_strdup(iso);
                    osm_info("relation",item_bin_get_relationid(ib),0,"Country Boundary for '%s'\n",iso);
                }
                boundary->country=country;
            } else
                osm_warning("relation",item_bin_get_relationid(ib),0,"Country Boundary doesn't contain an ISO3166-1 tag\n");
        }
        while ((member=item_bin_get_attr(ib, attr_osm_member, member))) {
            long long osm_id;
            int read=0;
            enum relation_member_type member_type;
            int member_type_numeric;
            char *rolestr;

            if (sscanf(member,RELATION_MEMBER_PARSE_FORMAT,&member_type_numeric,&osm_id,&read) < 2)
                continue;

            member_type=(enum relation_member_type)member_type_numeric;
            rolestr=member+read;

            if(member_type==rel_member_node) {
                if(!strcmp(rolestr,"admin_centre") || !strcmp(rolestr,"admin_center"))
                    boundary->admin_centre=osm_id;
            }
            if(member_type==rel_member_way) {
                enum geom_poly_segment_type role;
                if (!strcmp(rolestr,"outer") || !strcmp(rolestr,"exclave")) {
                    has_outer_ways=1;
                    role=geom_poly_segment_type_way_outer;
                } else if (!strcmp(rolestr,"inner") || !strcmp(rolestr,"enclave"))
                    role=geom_poly_segment_type_way_inner;
                else if (!strcmp(rolestr,""))
                    role=geom_poly_segment_type_way_unknown;
                else {
                    osm_warning("relation",item_bin_get_relationid(ib),0,"Unknown role %s in member ",rolestr);
                    osm_warning("way",osm_id,1,"\n");
                    role=geom_poly_segment_type_none;
                }
                relations_add_relation_member_entry(relations, relations_func, boundary, (gpointer)role, rel_member_way, osm_id);
            }
            if(member_type==rel_member_relation) {
                if (!strcmp(rolestr,"outer") || !strcmp(rolestr,"exclave") || !strcmp(rolestr,"inner") || !strcmp(rolestr,"enclave"))
                    has_subrelations++;
            }
        }
        if(boundary->iso2 && has_subrelations)
            osm_warning("relation",item_bin_get_relationid(ib),0,
                        "Country boundary '%s' has %d relations as boundary segments. These are not supported yet.\n", boundary->iso2,
                        has_subrelations);
        if(boundary->iso2 && !has_outer_ways) {
            osm_warning("relation",item_bin_get_relationid(ib),0,
                        "Skipping country boundary for '%s' because it has no outer ways.\n", boundary->iso2);
            g_free(boundary->iso2);
            boundary->iso2=NULL;
        }

        boundary->ib=item_bin_dup(ib);
        boundaries_list=g_list_append(boundaries_list, boundary);
    }
    return boundaries_list;
}

GList *
boundary_find_matches(GList *l, struct coord *c) {
    GList *ret=NULL;
    while (l) {
        struct boundary *boundary=l->data;
        if (bbox_contains_coord(&boundary->r, c)) {
            if (geom_poly_segments_point_inside(boundary->sorted_segments,c) > 0)
                ret=g_list_prepend(ret, boundary);
            ret=g_list_concat(ret,boundary_find_matches(boundary->children, c));
        }
        l=g_list_next(l);
    }
    return ret;
}

#if 0
static void
test(GList *boundaries_list) {
    struct item_bin *ib;
    FILE *f=fopen("country_276.bin.unsorted","r");
    printf("start\n");
    while ((ib=read_item(f))) {
        struct coord *c=(struct coord *)(ib+1);
        char *name=item_bin_get_attr(ib, attr_town_name, NULL);
        printf("%s:",name);
        boundary_find_matches(boundaries_list, c);
        printf("\n");
    }
    fclose(f);
    printf("end\n");
}

static void
dump_hierarchy(GList *l, char *prefix) {
    char *newprefix=g_alloca(sizeof(char)*(strlen(prefix)+2));
    strcpy(newprefix, prefix);
    strcat(newprefix," ");
    while (l) {
        struct boundary *boundary=l->data;
        fprintf(stderr,"%s:%s (0x%x,0x%x)-(0x%x,0x%x)\n",prefix,osm_tag_name(boundary->ib),boundary->r.l.x,boundary->r.l.y,
                boundary->r.h.x,boundary->r.h.y);
        dump_hierarchy(boundary->children, newprefix);
        l=g_list_next(l);
    }
}

static gint
boundary_bbox_compare(gconstpointer a, gconstpointer b) {
    const struct boundary *boundarya=a;
    const struct boundary *boundaryb=b;
    long long areaa=bbox_area(&boundarya->r);
    long long areab=bbox_area(&boundaryb->r);
    if (areaa > areab)
        return 1;
    if (areaa < areab)
        return -1;
    return 0;
}
#endif

static GList *
process_boundaries_insert(GList *list, struct boundary *boundary) {
    GList *l=list;
    while (l) {
        struct boundary *b=l->data;
        if (bbox_contains_bbox(&boundary->r, &b->r)) {
            list=g_list_remove(list, b);
            boundary->children=g_list_prepend(boundary->children, b);
            l=list;
        } else if (bbox_contains_bbox(&b->r, &boundary->r)) {
            b->children=process_boundaries_insert(b->children, boundary);
            return list;
        } else
            l=g_list_next(l);
    }
    return g_list_prepend(list, boundary);
}


static GList *
process_boundaries_finish(GList *boundaries_list) {
    GList *l,*sl;
    GList *ret=NULL;
    l=boundaries_list;
    while (l) {
        struct boundary *boundary=l->data;
        int first=1;
        FILE *f=NULL,*fu=NULL;
        if (boundary->country) {
            char *name=g_strdup_printf("country_%s_poly",boundary->iso2);
            f=tempfile("",name,1);
            g_free(name);
        }
        boundary->sorted_segments=geom_poly_segments_sort(boundary->segments, geom_poly_segment_type_way_right_side);
        sl=boundary->sorted_segments;
        while (sl) {
            struct geom_poly_segment *gs=sl->data;
            struct coord *c=gs->first;
            while (c <= gs->last) {
                if (first) {
                    boundary->r.l=*c;
                    boundary->r.h=*c;
                    first=0;
                } else
                    bbox_extend(c, &boundary->r);
                c++;
            }
            if (f) {
                struct item_bin *ib=tmp_item_bin;
                item_bin_init(ib, type_selected_line);
                /* FIXME check for overflow */
                item_bin_add_coord(ib, gs->first, gs->last-gs->first+1);
                item_bin_write(ib, f);
            }
            if (boundary->country) {
                if (!coord_is_equal(*gs->first,*gs->last)) {
                    struct item_bin *ib;
                    if (!fu) {
                        char *name=g_strdup_printf("country_%s_broken",boundary->iso2);
                        fu=tempfile("",name,1);
                        g_free(name);
                    }
                    ib=tmp_item_bin;
                    item_bin_init(ib, type_selected_point);
                    item_bin_add_coord(ib, gs->first, 1);
                    item_bin_write(ib, fu);
                    item_bin_init(ib, type_selected_point);
                    item_bin_add_coord(ib, gs->last, 1);
                    item_bin_write(ib, fu);
                }
            }
            sl=g_list_next(sl);
        }
        ret=process_boundaries_insert(ret, boundary);
        l=g_list_next(l);
        if (f)
            fclose(f);
        if (fu) {
            if (boundary->country)
                osm_warning("relation",item_bin_get_relationid(boundary->ib),0,"Broken country polygon '%s'\n",boundary->iso2);
            fclose(fu);
        }

    }
    return ret;
}

GList *
process_boundaries(FILE *boundaries, FILE *ways) {
    GList *boundaries_list;
    struct relations *relations=relations_new();

    boundaries_list=process_boundaries_setup(boundaries, relations);
    relations_process(relations, NULL, ways);
    relations_destroy(relations);
    return process_boundaries_finish(boundaries_list);
}

void
free_boundaries(GList *bl) {
    GList *l=bl;
    while (l) {
        struct boundary *boundary=l->data;
        GList *s=boundary->segments;
        while (s) {
            struct geom_poly_segment *seg=s->data;
            g_free(seg->first);
            g_free(seg);
            s=g_list_next(s);
        };
        s=boundary->sorted_segments;
        while (s) {
            struct geom_poly_segment *seg=s->data;
            g_free(seg->first);
            g_free(seg);
            s=g_list_next(s);
        };
        g_list_free(boundary->segments);
        g_list_free(boundary->sorted_segments);
        g_free(boundary->ib);
        g_free(boundary->iso2);
        free_boundaries(boundary->children);
        g_free(boundary);
        l=g_list_next(l);
    }
    g_list_free(bl);
}