forked from osm2pgsql-dev/osm2pgsql
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoutput-pgsql.c
1627 lines (1412 loc) · 53.3 KB
/
output-pgsql.c
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
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Implements the mid-layer processing for osm2pgsql
* using several PostgreSQL tables
*
* This layer stores data read in from the planet.osm file
* and is then read by the backend processing code to
* emit the final geometry-enabled output formats
*/
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <errno.h>
#ifdef HAVE_PTHREAD
#include <pthread.h>
#endif
#include <libpq-fe.h>
#include "osmtypes.h"
#include "output.h"
#include "reprojection.h"
#include "output-pgsql.h"
#include "build_geometry.h"
#include "middle.h"
#include "pgsql.h"
#include "expire-tiles.h"
#define SRID (project_getprojinfo()->srs)
/* FIXME: Shouldn't malloc this all to begin with but call realloc()
as required. The program will most likely segfault if it reads a
style file with more styles than this */
#define MAX_STYLES 1000
enum table_id {
t_point, t_line, t_poly, t_roads
};
static const struct output_options *Options;
/* Tables to output */
static struct s_table {
//enum table_id table;
char *name;
const char *type;
PGconn *sql_conn;
char buffer[1024];
unsigned int buflen;
int copyMode;
char *columns;
} tables [] = {
{ .name = "%s_point", .type = "POINT" },
{ .name = "%s_line", .type = "LINESTRING"},
{ .name = "%s_polygon", .type = "GEOMETRY" }, // Actually POLGYON & MULTIPOLYGON but no way to limit to just these two
{ .name = "%s_roads", .type = "LINESTRING"}
};
#define NUM_TABLES ((signed)(sizeof(tables) / sizeof(tables[0])))
#define FLAG_POLYGON 1 /* For polygon table */
#define FLAG_LINEAR 2 /* For lines table */
#define FLAG_NOCACHE 4 /* Optimisation: don't bother remembering this one */
#define FLAG_DELETE 8 /* These tags should be simply deleted on sight */
#define FLAG_PHSTORE 17 /* polygons without own column but listed in hstore this implies FLAG_POLYGON */
static struct flagsname {
char *name;
int flag;
} tagflags[] = {
{ .name = "polygon", .flag = FLAG_POLYGON },
{ .name = "linear", .flag = FLAG_LINEAR },
{ .name = "nocache", .flag = FLAG_NOCACHE },
{ .name = "delete", .flag = FLAG_DELETE },
{ .name = "phstore", .flag = FLAG_PHSTORE }
};
#define NUM_FLAGS ((signed)(sizeof(tagflags) / sizeof(tagflags[0])))
/* Table columns, representing key= tags */
struct taginfo {
char *name;
char *type;
int flags;
int count;
};
static struct taginfo *exportList[4]; /* Indexed by enum table_id */
static int exportListCount[4];
/* Data to generate z-order column and road table
* The name of the roads table is misleading, this table
* is used for any feature to be shown at low zoom.
* This includes railways and administrative boundaries too
*/
static struct {
int offset;
const char *highway;
int roads;
} layers[] = {
{ 3, "minor", 0 },
{ 3, "road", 0 },
{ 3, "unclassified", 0 },
{ 3, "residential", 0 },
{ 4, "tertiary_link", 0 },
{ 4, "tertiary", 0 },
// 5 = railway
{ 6, "secondary_link",1 },
{ 6, "secondary", 1 },
{ 7, "primary_link", 1 },
{ 7, "primary", 1 },
{ 8, "trunk_link", 1 },
{ 8, "trunk", 1 },
{ 9, "motorway_link", 1 },
{ 9, "motorway", 1 }
};
static const unsigned int nLayers = (sizeof(layers)/sizeof(*layers));
static int pgsql_delete_way_from_output(int osm_id);
static int pgsql_delete_relation_from_output(int osm_id);
static int pgsql_process_relation(int id, struct member *members, int member_count, struct keyval *tags, int exists);
void read_style_file( const char *filename )
{
FILE *in;
int lineno = 0;
int num_read = 0;
exportList[OSMTYPE_NODE] = malloc( sizeof(struct taginfo) * MAX_STYLES );
exportList[OSMTYPE_WAY] = malloc( sizeof(struct taginfo) * MAX_STYLES );
in = fopen( filename, "rt" );
if( !in )
{
fprintf( stderr, "Couldn't open style file '%s': %s\n", filename, strerror(errno) );
exit_nicely();
}
char buffer[1024];
while( fgets( buffer, sizeof(buffer), in) != NULL )
{
lineno++;
char osmtype[24];
char tag[64];
char datatype[24];
char flags[128];
int i;
char *str;
str = strchr( buffer, '#' );
if( str )
*str = '\0';
int fields = sscanf( buffer, "%23s %63s %23s %127s", osmtype, tag, datatype, flags );
if( fields <= 0 ) /* Blank line */
continue;
if( fields < 3 )
{
fprintf( stderr, "Error reading style file line %d (fields=%d)\n", lineno, fields );
exit_nicely();
}
struct taginfo temp;
temp.name = strdup(tag);
temp.type = strdup(datatype);
temp.flags = 0;
for( str = strtok( flags, ",\r\n" ); str; str = strtok(NULL, ",\r\n") )
{
for( i=0; i<NUM_FLAGS; i++ )
{
if( strcmp( tagflags[i].name, str ) == 0 )
{
temp.flags |= tagflags[i].flag;
break;
}
}
if( i == NUM_FLAGS )
fprintf( stderr, "Unknown flag '%s' line %d, ignored\n", str, lineno );
}
if (temp.flags==FLAG_PHSTORE) {
if (0==(Options->enable_hstore)) {
fprintf( stderr, "Error reading style file line %d (fields=%d)\n", lineno, fields );
fprintf( stderr, "flag 'phstore' is invalid in non-hstore mode\n");
exit_nicely();
}
}
temp.count = 0;
// printf("%s %s %d %d\n", temp.name, temp.type, temp.polygon, offset );
int flag = 0;
if( strstr( osmtype, "node" ) )
{
memcpy( &exportList[ OSMTYPE_NODE ][ exportListCount[ OSMTYPE_NODE ] ], &temp, sizeof(temp) );
exportListCount[ OSMTYPE_NODE ]++;
flag = 1;
}
if( strstr( osmtype, "way" ) )
{
memcpy( &exportList[ OSMTYPE_WAY ][ exportListCount[ OSMTYPE_WAY ] ], &temp, sizeof(temp) );
exportListCount[ OSMTYPE_WAY ]++;
flag = 1;
}
if( !flag )
{
fprintf( stderr, "Weird style line %d\n", lineno );
exit_nicely();
}
num_read++;
}
if (ferror(in)) {
perror(filename);
exit_nicely();
}
if (num_read == 0) {
fprintf(stderr, "Unable to parse any valid columns from the style file. Aborting.\n");
exit_nicely();
}
fclose(in);
}
static void free_style_refs(const char *name, const char *type)
{
// Find and remove any other references to these pointers
// This would be way easier if we kept a single list of styles
// Currently this scales with n^2 number of styles
int i,j;
for (i=0; i<NUM_TABLES; i++) {
for(j=0; j<exportListCount[i]; j++) {
if (exportList[i][j].name == name)
exportList[i][j].name = NULL;
if (exportList[i][j].type == type)
exportList[i][j].type = NULL;
}
}
}
static void free_style(void)
{
int i, j;
for (i=0; i<NUM_TABLES; i++) {
for(j=0; j<exportListCount[i]; j++) {
free(exportList[i][j].name);
free(exportList[i][j].type);
free_style_refs(exportList[i][j].name, exportList[i][j].type);
}
}
for (i=0; i<NUM_TABLES; i++)
free(exportList[i]);
}
/* Handles copying out, but coalesces the data into large chunks for
* efficiency. PostgreSQL doesn't actually need this, but each time you send
* a block of data you get 5 bytes of overhead. Since we go column by column
* with most empty and one byte delimiters, without this optimisation we
* transfer three times the amount of data necessary.
*/
void copy_to_table(enum table_id table, const char *sql)
{
PGconn *sql_conn = tables[table].sql_conn;
unsigned int len = strlen(sql);
unsigned int buflen = tables[table].buflen;
char *buffer = tables[table].buffer;
/* Return to copy mode if we dropped out */
if( !tables[table].copyMode )
{
pgsql_exec(sql_conn, PGRES_COPY_IN, "COPY %s (%s,way) FROM STDIN", tables[table].name, tables[table].columns);
tables[table].copyMode = 1;
}
/* If the combination of old and new data is too big, flush old data */
if( (unsigned)(buflen + len) > sizeof( tables[table].buffer )-10 )
{
pgsql_CopyData(tables[table].name, sql_conn, buffer);
buflen = 0;
/* If new data by itself is also too big, output it immediately */
if( (unsigned)len > sizeof( tables[table].buffer )-10 )
{
pgsql_CopyData(tables[table].name, sql_conn, sql);
len = 0;
}
}
/* Normal case, just append to buffer */
if( len > 0 )
{
strcpy( buffer+buflen, sql );
buflen += len;
len = 0;
}
/* If we have completed a line, output it */
if( buflen > 0 && buffer[buflen-1] == '\n' )
{
pgsql_CopyData(tables[table].name, sql_conn, buffer);
buflen = 0;
}
tables[table].buflen = buflen;
}
static int add_z_order(struct keyval *tags, int *roads)
{
const char *layer = getItem(tags, "layer");
const char *highway = getItem(tags, "highway");
const char *bridge = getItem(tags, "bridge");
const char *tunnel = getItem(tags, "tunnel");
const char *railway = getItem(tags, "railway");
const char *boundary= getItem(tags, "boundary");
int z_order = 0;
int l;
unsigned int i;
char z[13];
l = layer ? strtol(layer, NULL, 10) : 0;
z_order = 10 * l;
*roads = 0;
if (highway) {
for (i=0; i<nLayers; i++) {
if (!strcmp(layers[i].highway, highway)) {
z_order += layers[i].offset;
*roads = layers[i].roads;
break;
}
}
}
if (railway && strlen(railway)) {
z_order += 5;
*roads = 1;
}
// Administrative boundaries are rendered at low zooms so we prefer to use the roads table
if (boundary && !strcmp(boundary, "administrative"))
*roads = 1;
if (bridge && (!strcmp(bridge, "true") || !strcmp(bridge, "yes") || !strcmp(bridge, "1")))
z_order += 10;
if (tunnel && (!strcmp(tunnel, "true") || !strcmp(tunnel, "yes") || !strcmp(tunnel, "1")))
z_order -= 10;
snprintf(z, sizeof(z), "%d", z_order);
addItem(tags, "z_order", z, 0);
return 0;
}
#if 0
static void fix_motorway_shields(struct keyval *tags)
{
const char *highway = getItem(tags, "highway");
const char *name = getItem(tags, "name");
const char *ref = getItem(tags, "ref");
/* The current mapnik style uses ref= for motorway shields but some roads just have name= */
if (!highway || strcmp(highway, "motorway"))
return;
if (name && !ref)
addItem(tags, "ref", name, 0);
}
#endif
/* Append all alternate name:xx on to the name tag with space sepatators.
* name= always comes first, the alternates are in no particular order
* Note: A new line may be better but this does not work with Mapnik
*
* <tag k="name" v="Ben Nevis" />
* <tag k="name:gd" v="Ben Nibheis" />
* becomes:
* <tag k="name" v="Ben Nevis Ben Nibheis" />
*/
void compress_tag_name(struct keyval *tags)
{
const char *name = getItem(tags, "name");
struct keyval *name_ext = getMatches(tags, "name:");
struct keyval *p;
char out[2048];
if (!name_ext)
return;
out[0] = '\0';
if (name) {
strncat(out, name, sizeof(out)-1);
strncat(out, " ", sizeof(out)-1);
}
while((p = popItem(name_ext)) != NULL) {
/* Exclude name:source = "dicataphone" and duplicates */
if (strcmp(p->key, "name:source") && !strstr(out, p->value)) {
strncat(out, p->value, sizeof(out)-1);
strncat(out, " ", sizeof(out)-1);
}
freeItem(p);
}
free(name_ext);
// Remove trailing space
out[strlen(out)-1] = '\0';
//fprintf(stderr, "*** New name: %s\n", out);
updateItem(tags, "name", out);
}
static void pgsql_out_cleanup(void)
{
int i;
for (i=0; i<NUM_TABLES; i++) {
if (tables[i].sql_conn) {
PQfinish(tables[i].sql_conn);
tables[i].sql_conn = NULL;
}
}
}
/* Escape data appropriate to the type */
static void escape_type(char *sql, int len, const char *value, const char *type) {
int items, from, to;
if ( !strcmp(type, "int4") ) {
/* For integers we take the first number, or the average if it's a-b */
items = sscanf(value, "%d-%d", &from, &to);
if ( items == 1 ) {
sprintf(sql, "%d", from);
} else if ( items == 2 ) {
sprintf(sql, "%d", (from + to) / 2);
} else {
sprintf(sql, "\\N");
}
} else {
escape(sql, len, value);
}
}
static void write_hstore(enum table_id table, struct keyval *tags)
{
static char *sql;
static size_t sqllen=0;
// sql buffer
if (sqllen==0) {
sqllen=2048;
sql=malloc(sqllen);
}
// a clone of the tags pointer
struct keyval *xtags = tags;
// while this tags has a follow-up..
while (xtags->next->key != NULL)
{
/*
hstore ASCII representation looks like
"<key>"=>"<value>"
we need at least strlen(key)+strlen(value)+6+'\0' bytes
in theory any single character could also be escaped
thus we need an additional factor of 2.
The maximum lenght of a single hstore element is thus
calcuated as follows:
*/
size_t hlen=2 * (strlen(xtags->next->key) + strlen(xtags->next->value)) + 7;
// if the sql buffer is too small
if (hlen > sqllen) {
sqllen = hlen;
sql = realloc(sql, sqllen);
}
// pack the tag with its value into the hstore
keyval2hstore(sql, xtags->next);
copy_to_table(table, sql);
// update the tag-pointer to point to the next tag
xtags = xtags->next;
// if the tag has a follow up, add a comma to the end
if (xtags->next->key != NULL)
copy_to_table(table, ",");
}
// finish the hstore column by placing a TAB into the data stream
copy_to_table(table, "\t");
// the main hstore-column has now been written
}
// write an hstore column to the database
static void write_hstore_columns(enum table_id table, struct keyval *tags)
{
static char *sql;
static size_t sqllen=0;
// sql buffer
if (sqllen==0) {
sqllen=2048;
sql=malloc(sqllen);
}
// the index of the current hstore column
int i_hstore_column;
// iterate over all configured hstore colums in the options
for(i_hstore_column = 0; i_hstore_column < Options->n_hstore_columns; i_hstore_column++)
{
// did this node have a tag that matched the current hstore column
int found = 0;
// a clone of the tags pointer
struct keyval *xtags = tags;
// while this tags has a follow-up..
while (xtags->next->key != NULL) {
// check if the tags' key starts with the name of the hstore column
char *pos = strstr(xtags->next->key, Options->hstore_columns[i_hstore_column]);
// and if it does..
if(pos == xtags->next->key)
{
// remember we found one
found=1;
// generate the short key name
char *shortkey = xtags->next->key + strlen(Options->hstore_columns[i_hstore_column]);
// calculate the size needed for this hstore entry
size_t hlen=2*(strlen(shortkey)+strlen(xtags->next->value))+7;
// if the sql buffer is too small
if (hlen > sqllen) {
// resize it
sqllen=hlen;
sql=realloc(sql,sqllen);
}
// and pack the shortkey with its value into the hstore
keyval2hstore_manual(sql, shortkey, xtags->next->value);
copy_to_table(table, sql);
// update the tag-pointer to point to the next tag
xtags=xtags->next;
// if the tag has a follow up, add a comma to the end
if (xtags->next->key != NULL)
copy_to_table(table, ",");
}
else
{
// update the tag-pointer to point to the next tag
xtags=xtags->next;
}
}
// if no matching tag has been found, write a NULL
if(!found)
copy_to_table(table, "\\N");
// finish the hstore column by placing a TAB into the data stream
copy_to_table(table, "\t");
}
// all hstore-columns have now been written
}
/* example from: pg_dump -F p -t planet_osm gis
COPY planet_osm (osm_id, name, place, landuse, leisure, "natural", man_made, waterway, highway, railway, amenity, tourism, learning, building, bridge, layer, way) FROM stdin;
17959841 \N \N \N \N \N \N \N bus_stop \N \N \N \N \N \N -\N 0101000020E610000030CCA462B6C3D4BF92998C9B38E04940
17401934 The Horn \N \N \N \N \N \N \N \N pub \N \N \N \N -\N 0101000020E6100000C12FC937140FD5BFB4D2F4FB0CE04940
...
mine - 01 01000000 48424298424242424242424256427364
psql - 01 01000020 E6100000 30CCA462B6C3D4BF92998C9B38E04940
01 01000020 E6100000 48424298424242424242424256427364
0x2000_0000 = hasSRID, following 4 bytes = srid, not supported by geos WKBWriter
Workaround - output SRID=4326;<WKB>
*/
static int pgsql_out_node(int id, struct keyval *tags, double node_lat, double node_lon)
{
static char *sql;
static size_t sqllen=0;
char *v;
int i;
if (sqllen==0) {
sqllen=2048;
sql=malloc(sqllen);
}
expire_tiles_from_bbox(node_lon, node_lat, node_lon, node_lat);
sprintf(sql, "%d\t", id);
copy_to_table(t_point, sql);
for (i=0; i < exportListCount[OSMTYPE_NODE]; i++) {
if( exportList[OSMTYPE_NODE][i].flags & FLAG_DELETE )
continue;
if( (exportList[OSMTYPE_NODE][i].flags & FLAG_PHSTORE) == FLAG_PHSTORE)
continue;
if ((v = getItem(tags, exportList[OSMTYPE_NODE][i].name)))
{
escape_type(sql, sqllen, v, exportList[OSMTYPE_NODE][i].type);
exportList[OSMTYPE_NODE][i].count++;
}
else
sprintf(sql, "\\N");
copy_to_table(t_point, sql);
copy_to_table(t_point, "\t");
}
// hstore columns
write_hstore_columns(t_point, tags);
// check if a regular hstore is requested
if (Options->enable_hstore)
write_hstore(t_point, tags);
sprintf(sql, "SRID=%d;POINT(%.15g %.15g)", SRID, node_lon, node_lat);
copy_to_table(t_point, sql);
copy_to_table(t_point, "\n");
return 0;
}
static void write_wkts(int id, struct keyval *tags, const char *wkt, enum table_id table)
{
static char *sql;
static size_t sqllen=0;
char *v;
int j;
if (sqllen==0) {
sqllen=2048;
sql=malloc(sqllen);
}
sprintf(sql, "%d\t", id);
copy_to_table(table, sql);
for (j=0; j < exportListCount[OSMTYPE_WAY]; j++) {
if( exportList[OSMTYPE_WAY][j].flags & FLAG_DELETE )
continue;
if( (exportList[OSMTYPE_WAY][j].flags & FLAG_PHSTORE) == FLAG_PHSTORE)
continue;
if ((v = getItem(tags, exportList[OSMTYPE_WAY][j].name)))
{
exportList[OSMTYPE_WAY][j].count++;
escape_type(sql, sqllen, v, exportList[OSMTYPE_WAY][j].type);
}
else
sprintf(sql, "\\N");
copy_to_table(table, sql);
copy_to_table(table, "\t");
}
// hstore columns
write_hstore_columns(table, tags);
// check if a regular hstore is requested
if (Options->enable_hstore)
write_hstore(table, tags);
sprintf(sql, "SRID=%d;", SRID);
copy_to_table(table, sql);
copy_to_table(table, wkt);
copy_to_table(table, "\n");
}
static int tag_indicates_polygon(enum OsmType type, const char *key)
{
int i;
if (!strcmp(key, "area"))
return 1;
for (i=0; i < exportListCount[type]; i++) {
if( strcmp( exportList[type][i].name, key ) == 0 )
return exportList[type][i].flags & FLAG_POLYGON;
}
return 0;
}
/* Go through the given tags and determine the union of flags. Also remove
* any tags from the list that we don't know about */
unsigned int pgsql_filter_tags(enum OsmType type, struct keyval *tags, int *polygon)
{
int i, filter = 1;
int flags = 0;
int add_area_tag = 0;
const char *area;
struct keyval *item;
struct keyval temp;
initList(&temp);
/* We used to only go far enough to determine if it's a polygon or not, but now we go through and filter stuff we don't need */
while( (item = popItem(tags)) != NULL )
{
/* Discard natural=coastline tags (we render these from a shapefile instead) */
if (!strcmp("natural",item->key) && !strcmp("coastline",item->value))
{
freeItem( item );
item = NULL;
add_area_tag = 1; /* Allow named islands to appear as polygons */
continue;
}
for (i=0; i < exportListCount[type]; i++)
{
if( strcmp( exportList[type][i].name, item->key ) == 0 )
{
if( exportList[type][i].flags & FLAG_DELETE )
{
freeItem( item );
item = NULL;
break;
}
filter = 0;
flags |= exportList[type][i].flags;
pushItem( &temp, item );
item = NULL;
break;
}
}
if( i == exportListCount[type] )
{
if (Options->enable_hstore) {
pushItem( &temp, item );
filter=0;
} else {
freeItem( item );
}
item = NULL;
}
}
/* Move from temp list back to original list */
while( (item = popItem(&temp)) != NULL )
pushItem( tags, item );
*polygon = flags & FLAG_POLYGON;
/* Special case allowing area= to override anything else */
if ((area = getItem(tags, "area"))) {
if (!strcmp(area, "yes") || !strcmp(area, "true") ||!strcmp(area, "1"))
*polygon = 1;
else if (!strcmp(area, "no") || !strcmp(area, "false") || !strcmp(area, "0"))
*polygon = 0;
} else {
/* If we need to force this as a polygon, append an area tag */
if (add_area_tag) {
addItem(tags, "area", "yes", 0);
*polygon = 1;
}
}
return filter;
}
/*
COPY planet_osm (osm_id, name, place, landuse, leisure, "natural", man_made, waterway, highway, railway, amenity, tourism, learning, bu
ilding, bridge, layer, way) FROM stdin;
198497 Bedford Road \N \N \N \N \N \N residential \N \N \N \N \N \N \N 0102000020E610000004000000452BF702B342D5BF1C60E63BF8DF49406B9C4D470037D5BF5471E316F3DF4940DFA815A6EF35D5BF9AE95E27F5DF4940B41EB
E4C1421D5BF24D06053E7DF4940
212696 Oswald Road \N \N \N \N \N \N minor \N \N \N \N \N \N \N 0102000020E610000004000000467D923B6C22D5BFA359D93EE4DF4940B3976DA7AD11D5BF84BBB376DBDF4940997FF44D9A06D5BF4223D8B8FEDF49404D158C4AEA04D
5BF5BB39597FCDF4940
*/
static int pgsql_out_way(int id, struct keyval *tags, struct osmNode *nodes, int count, int exists)
{
int polygon = 0, roads = 0;
int i, wkt_size;
double split_at;
/* If the flag says this object may exist already, delete it first */
if(exists) {
pgsql_delete_way_from_output(id);
Options->mid->way_changed(id);
}
if (pgsql_filter_tags(OSMTYPE_WAY, tags, &polygon) || add_z_order(tags, &roads))
return 0;
// Split long ways after around 1 degree or 100km
if (Options->projection == PROJ_LATLONG)
split_at = 1;
else
split_at = 100 * 1000;
wkt_size = get_wkt_split(nodes, count, polygon, split_at);
for (i=0;i<wkt_size;i++)
{
char *wkt = get_wkt(i);
if (wkt && strlen(wkt)) {
/* FIXME: there should be a better way to detect polygons */
if (!strncmp(wkt, "POLYGON", strlen("POLYGON")) || !strncmp(wkt, "MULTIPOLYGON", strlen("MULTIPOLYGON"))) {
expire_tiles_from_nodes_poly(nodes, count, id);
double area = get_area(i);
if (area > 0.0) {
char tmp[32];
snprintf(tmp, sizeof(tmp), "%f", area);
addItem(tags, "way_area", tmp, 0);
}
write_wkts(id, tags, wkt, t_poly);
} else {
expire_tiles_from_nodes_line(nodes, count);
write_wkts(id, tags, wkt, t_line);
if (roads)
write_wkts(id, tags, wkt, t_roads);
}
}
free(wkt);
}
clear_wkts();
return 0;
}
static int pgsql_out_relation(int id, struct keyval *rel_tags, struct osmNode **xnodes, struct keyval *xtags, int *xcount, int *xid, const char **xrole)
{
int i, wkt_size;
int polygon = 0, roads = 0;
int make_polygon = 0;
int make_boundary = 0;
struct keyval tags, *p, poly_tags;
char *type;
double split_at;
#if 0
fprintf(stderr, "Got relation with counts:");
for (i=0; xcount[i]; i++)
fprintf(stderr, " %d", xcount[i]);
fprintf(stderr, "\n");
#endif
/* Get the type, if there's no type we don't care */
type = getItem(rel_tags, "type");
if( !type )
return 0;
initList(&tags);
initList(&poly_tags);
/* Clone tags from relation */
p = rel_tags->next;
while (p != rel_tags) {
// For routes, we convert name to route_name
if ((strcmp(type, "route") == 0) && (strcmp(p->key, "name") ==0))
addItem(&tags, "route_name", p->value, 1);
else if (strcmp(p->key, "type")) // drop type=
addItem(&tags, p->key, p->value, 1);
p = p->next;
}
if( strcmp(type, "route") == 0 )
{
const char *state = getItem(rel_tags, "state");
const char *netw = getItem(rel_tags, "network");
int networknr = -1;
if (state == NULL) {
state = "";
}
if (netw != NULL) {
if (strcmp(netw, "lcn") == 0) {
networknr = 10;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "lcn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "lcn", "connection", 1);
} else {
addItem(&tags, "lcn", "yes", 1);
}
} else if (strcmp(netw, "rcn") == 0) {
networknr = 11;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "rcn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "rcn", "connection", 1);
} else {
addItem(&tags, "rcn", "yes", 1);
}
} else if (strcmp(netw, "ncn") == 0) {
networknr = 12;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "ncn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "ncn", "connection", 1);
} else {
addItem(&tags, "ncn", "yes", 1);
}
} else if (strcmp(netw, "lwn") == 0) {
networknr = 20;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "lwn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "lwn", "connection", 1);
} else {
addItem(&tags, "lwn", "yes", 1);
}
} else if (strcmp(netw, "rwn") == 0) {
networknr = 21;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "rwn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "rwn", "connection", 1);
} else {
addItem(&tags, "rwn", "yes", 1);
}
} else if (strcmp(netw, "nwn") == 0) {
networknr = 22;
if (strcmp(state, "alternate") == 0) {
addItem(&tags, "nwn", "alternate", 1);
} else if (strcmp(state, "connection") == 0) {
addItem(&tags, "nwn", "connection", 1);
} else {
addItem(&tags, "nwn", "yes", 1);
}
}
}
if (getItem(rel_tags, "preferred_color") != NULL) {
const char *a = getItem(rel_tags, "preferred_color");
if (strcmp(a, "0") == 0 || strcmp(a, "1") == 0 || strcmp(a, "2") == 0 || strcmp(a, "3") == 0 || strcmp(a, "4") == 0) {
addItem(&tags, "route_pref_color", a, 1);
} else {
addItem(&tags, "route_pref_color", "0", 1);
}
} else {
addItem(&tags, "route_pref_color", "0", 1);
}
if (getItem(rel_tags, "ref") != NULL) {
if (networknr == 10) {
addItem(&tags, "lcn_ref", getItem(rel_tags, "ref"), 1);
} else if (networknr == 11) {
addItem(&tags, "rcn_ref", getItem(rel_tags, "ref"), 1);
} else if (networknr == 12) {
addItem(&tags, "ncn_ref", getItem(rel_tags, "ref"), 1);
} else if (networknr == 20) {
addItem(&tags, "lwn_ref", getItem(rel_tags, "ref"), 1);
} else if (networknr == 21) {
addItem(&tags, "rwn_ref", getItem(rel_tags, "ref"), 1);
} else if (networknr == 22) {
addItem(&tags, "nwn_ref", getItem(rel_tags, "ref"), 1);
}
}
}
else if( strcmp( type, "boundary" ) == 0 )
{
// Boundaries will get converted into multiple geometries:
// - Linear features will end up in the line and roads tables (useful for admin boundaries)
// - Polygon features also go into the polygon table (useful for national_forests)
// The edges of the polygon also get treated as linear fetaures allowing these to be rendered seperately.
make_boundary = 1;
}
else if( strcmp( type, "multipolygon" ) == 0 && getItem(&tags, "boundary") )
{
// Treat type=multipolygon exactly like type=boundary if it has a boundary tag.
make_boundary = 1;
}
else if( strcmp( type, "multipolygon" ) == 0 )
{
make_polygon = 1;
/* Copy the tags from the outer way(s) if the relation is untagged */
/* or if there is just a name tag, people seem to like naming relations */
if (!listHasData(&tags) || ((countList(&tags)==1) && getItem(&tags, "name"))) {
for (i=0; xcount[i]; i++) {
if (xrole[i] && !strcmp(xrole[i], "inner"))
continue;
p = xtags[i].next;
while (p != &(xtags[i])) {
addItem(&tags, p->key, p->value, 1);
p = p->next;
}
}
}
// Collect a list of polygon-like tags, these are used later to
// identify if an inner rings looks like it should be rendered seperately
p = tags.next;