forked from postgis/postgis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathg_serialized.c
1571 lines (1277 loc) · 38.5 KB
/
g_serialized.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
/**********************************************************************
*
* PostGIS - Spatial Types for PostgreSQL
* http://postgis.net
*
* PostGIS is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* PostGIS 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 PostGIS. If not, see <http://www.gnu.org/licenses/>.
*
**********************************************************************
*
* Copyright 2009 Paul Ramsey <pramsey@cleverelephant.ca>
* Copyright 2017 Darafei Praliaskouski <me@komzpa.net>
*
**********************************************************************/
#include "liblwgeom_internal.h"
#include "lwgeom_log.h"
#include "lwgeodetic.h"
/***********************************************************************
* GSERIALIZED metadata utility functions.
*/
/* handle missaligned uint32_t data */
static inline uint32_t gserialized_get_uint32_t(const uint8_t *loc)
{
return *((uint32_t*)loc);
}
int gserialized_has_bbox(const GSERIALIZED *gser)
{
return FLAGS_GET_BBOX(gser->flags);
}
int gserialized_has_z(const GSERIALIZED *gser)
{
return FLAGS_GET_Z(gser->flags);
}
int gserialized_has_m(const GSERIALIZED *gser)
{
return FLAGS_GET_M(gser->flags);
}
int gserialized_get_zm(const GSERIALIZED *gser)
{
return 2 * FLAGS_GET_Z(gser->flags) + FLAGS_GET_M(gser->flags);
}
int gserialized_ndims(const GSERIALIZED *gser)
{
return FLAGS_NDIMS(gser->flags);
}
int gserialized_is_geodetic(const GSERIALIZED *gser)
{
return FLAGS_GET_GEODETIC(gser->flags);
}
uint32_t gserialized_max_header_size(void)
{
/* read GSERIALIZED size + max bbox according gbox_serialized_size (2 + Z + M) + 1 int for type */
return sizeof(GSERIALIZED) + 8 * sizeof(float) + sizeof(int);
}
uint32_t gserialized_header_size(const GSERIALIZED *gser)
{
uint32_t sz = 8; /* varsize (4) + srid(3) + flags (1) */
if (gserialized_has_bbox(gser))
sz += gbox_serialized_size(gser->flags);
return sz;
}
uint32_t gserialized_get_type(const GSERIALIZED *s)
{
uint32_t *ptr;
ptr = (uint32_t*)(s->data);
LWDEBUG(4,"entered");
if ( FLAGS_GET_BBOX(s->flags) )
{
LWDEBUGF(4,"skipping forward past bbox (%d bytes)",gbox_serialized_size(s->flags));
ptr += (gbox_serialized_size(s->flags) / sizeof(uint32_t));
}
return *ptr;
}
int32_t gserialized_get_srid(const GSERIALIZED *s)
{
int32_t srid = 0;
srid = srid | (s->srid[0] << 16);
srid = srid | (s->srid[1] << 8);
srid = srid | s->srid[2];
/* Only the first 21 bits are set. Slide up and back to pull
the negative bits down, if we need them. */
srid = (srid<<11)>>11;
/* 0 is our internal unknown value. We'll map back and forth here for now */
if ( srid == 0 )
return SRID_UNKNOWN;
else
return srid;
}
void gserialized_set_srid(GSERIALIZED *s, int32_t srid)
{
LWDEBUGF(3, "Called with srid = %d", srid);
srid = clamp_srid(srid);
/* 0 is our internal unknown value.
* We'll map back and forth here for now */
if ( srid == SRID_UNKNOWN )
srid = 0;
s->srid[0] = (srid & 0x001F0000) >> 16;
s->srid[1] = (srid & 0x0000FF00) >> 8;
s->srid[2] = (srid & 0x000000FF);
}
inline static int gserialized_cmp_srid(const GSERIALIZED *s1, const GSERIALIZED *s2)
{
return (
s1->srid[0] == s2->srid[0] &&
s1->srid[1] == s2->srid[1] &&
s1->srid[2] == s2->srid[2]
) ? 0 : 1;
}
GSERIALIZED* gserialized_copy(const GSERIALIZED *g)
{
GSERIALIZED *g_out = NULL;
assert(g);
g_out = (GSERIALIZED*)lwalloc(SIZE_GET(g->size));
memcpy((uint8_t*)g_out,(uint8_t*)g,SIZE_GET(g->size));
return g_out;
}
static size_t gserialized_is_empty_recurse(const uint8_t *p, int *isempty);
static size_t gserialized_is_empty_recurse(const uint8_t *p, int *isempty)
{
int i;
int32_t type, num;
memcpy(&type, p, 4);
memcpy(&num, p+4, 4);
if ( lwtype_is_collection(type) )
{
size_t lz = 8;
for ( i = 0; i < num; i++ )
{
lz += gserialized_is_empty_recurse(p+lz, isempty);
if ( ! *isempty )
return lz;
}
*isempty = LW_TRUE;
return lz;
}
else
{
*isempty = (num == 0 ? LW_TRUE : LW_FALSE);
return 8;
}
}
int gserialized_is_empty(const GSERIALIZED *g)
{
uint8_t *p = (uint8_t*)g;
int isempty = 0;
assert(g);
p += 8; /* Skip varhdr and srid/flags */
if( FLAGS_GET_BBOX(g->flags) )
p += gbox_serialized_size(g->flags); /* Skip the box */
gserialized_is_empty_recurse(p, &isempty);
return isempty;
}
char* gserialized_to_string(const GSERIALIZED *g)
{
return lwgeom_to_wkt(lwgeom_from_gserialized(g), WKT_ISO, 12, 0);
}
/* Unfortunately including advanced instructions is something that
only helps a small sliver of users who can build their own
knowing the target system they will be running on. Packagers
have to aim for the lowest common demoninator. So this is
dead code for the forseeable future. */
#define HAVE_PDEP 0
#if HAVE_PDEP
/* http://www.joshbarczak.com/blog/?p=454 */
static uint64_t uint32_interleave_2(uint32_t u1, uint32_t u2)
{
uint64_t x = u1;
uint64_t y = u2;
uint64_t x_mask = 0x5555555555555555;
uint64_t y_mask = 0xAAAAAAAAAAAAAAAA;
return _pdep_u64(x, x_mask) | _pdep_u64(y, y_mask);
}
static uint64_t uint32_interleave_3(uint32_t u1, uint32_t u2, uint32_t u3)
{
/* only look at the first 21 bits */
uint64_t x = u1 & 0x1FFFFF;
uint64_t y = u2 & 0x1FFFFF;
uint64_t z = u3 & 0x1FFFFF;
uint64_t x_mask = 0x9249249249249249;
uint64_t y_mask = 0x2492492492492492;
uint64_t z_mask = 0x4924924924924924;
return _pdep_u64(x, x_mask) | _pdep_u64(y, y_mask) | _pdep_u64(z, z_mask);
}
#else
static uint64_t uint32_interleave_2(uint32_t u1, uint32_t u2)
{
uint64_t x = u1;
uint64_t y = u2;
int i;
static uint64_t B[5] =
{
0x5555555555555555,
0x3333333333333333,
0x0F0F0F0F0F0F0F0F,
0x00FF00FF00FF00FF,
0x0000FFFF0000FFFF
};
static uint64_t S[5] = { 1, 2, 4, 8, 16 };
for ( i = 4; i >= 0; i-- )
{
x = (x | (x << S[i])) & B[i];
y = (y | (y << S[i])) & B[i];
}
return x | (y << 1);
}
#endif
union floatuint {
uint32_t u;
float f;
};
uint64_t gbox_get_sortable_hash(const GBOX *g)
{
union floatuint x, y;
/*
* Since in theory the bitwise representation of an IEEE
* float is sortable (exponents come before mantissa, etc)
* we just copy the bits directly into an int and then
* interleave those ints.
*/
if ( FLAGS_GET_GEODETIC(g->flags) )
{
GEOGRAPHIC_POINT gpt;
POINT3D p;
p.x = (g->xmax + g->xmin) / 2.0;
p.y = (g->ymax + g->ymin) / 2.0;
p.z = (g->zmax + g->zmin) / 2.0;
normalize(&p);
cart2geog(&p, &gpt);
x.f = gpt.lon;
y.f = gpt.lat;
}
else
{
/*
* Here we'd like to get two ordinates from 4 in the box.
* Since it's just a sortable bit representation we can omit division from (A+B)/2.
* All it should do is subtract 1 from exponent anyways.
*/
x.f = g->xmax + g->xmin;
y.f = g->ymax + g->ymin;
}
return uint32_interleave_2(x.u, y.u);
}
int gserialized_cmp(const GSERIALIZED *g1, const GSERIALIZED *g2)
{
int g1_is_empty, g2_is_empty, cmp;
GBOX box1, box2;
uint64_t hash1, hash2;
size_t sz1 = SIZE_GET(g1->size);
size_t sz2 = SIZE_GET(g2->size);
union floatuint x, y;
/*
* For two non-same points, we can skip a lot of machinery.
*/
if (
sz1 > 16 && // 16 is size of EMPTY, if it's larger - it has coordinates
sz2 > 16 &&
!FLAGS_GET_BBOX(g1->flags) &&
!FLAGS_GET_BBOX(g2->flags) &&
*(uint32_t*)(g1+8) == POINTTYPE &&
*(uint32_t*)(g2+8) == POINTTYPE
)
{
double *dptr = (double*)(g1->data + sizeof(double));
x.f = 2.0 * dptr[0];
y.f = 2.0 * dptr[1];
hash1 = uint32_interleave_2(x.u, y.u);
dptr = (double*)(g2->data + sizeof(double));
x.f = 2.0 * dptr[0];
y.f = 2.0 * dptr[1];
hash2 = uint32_interleave_2(x.u, y.u);
/* If the SRIDs are the same, we can use hash inequality */
/* to jump us out of this function early. Otherwise we still */
/* have to do the full calculation */
if ( gserialized_cmp_srid(g1, g2) == 0 )
{
if ( hash1 > hash2 )
return 1;
if ( hash1 < hash2 )
return -1;
}
/* if hashes happen to be the same, go to full compare. */
}
size_t hsz1 = gserialized_header_size(g1);
size_t hsz2 = gserialized_header_size(g2);
uint8_t *b1 = (uint8_t*)g1 + hsz1;
uint8_t *b2 = (uint8_t*)g2 + hsz2;
size_t bsz1 = sz1 - hsz1;
size_t bsz2 = sz2 - hsz2;
size_t bsz = bsz1 < bsz2 ? bsz1 : bsz2;
int cmp_srid = gserialized_cmp_srid(g1, g2);
g1_is_empty = (gserialized_get_gbox_p(g1, &box1) == LW_FAILURE);
g2_is_empty = (gserialized_get_gbox_p(g2, &box2) == LW_FAILURE);
/* Empty < Non-empty */
if (g1_is_empty && !g2_is_empty)
return -1;
/* Non-empty > Empty */
if (!g1_is_empty && g2_is_empty)
return 1;
/* Return equality for perfect equality only */
cmp = memcmp(b1, b2, bsz);
if ( bsz1 == bsz2 && cmp_srid == 0 && cmp == 0 )
return 0;
if (!g1_is_empty && !g2_is_empty)
{
/* Using the centroids, calculate somewhat sortable */
/* hash key. The key doesn't provide good locality over */
/* the +/- boundary, but otherwise is pretty OK */
hash1 = gbox_get_sortable_hash(&box1);
hash2 = gbox_get_sortable_hash(&box2);
if ( hash1 > hash2 )
return 1;
else if ( hash1 < hash2 )
return -1;
/* What, the hashes are equal? OK... sort on the */
/* box minima */
if (box1.xmin < box2.xmin)
return -1;
else if (box1.xmin > box2.xmin)
return 1;
if (box1.ymin < box2.ymin)
return -1;
else if (box1.ymin > box2.ymin)
return 1;
/* Still equal? OK... sort on the box maxima */
if (box1.xmax < box2.xmax)
return -1;
else if (box1.xmax > box2.xmax)
return 1;
if (box1.ymax < box2.ymax)
return -1;
else if (box1.ymax > box2.ymax)
return 1;
}
/* Prefix comes before longer one. */
if (bsz1 != bsz2 && cmp == 0)
{
if (bsz1 < bsz2)
return -1;
else if (bsz1 > bsz2)
return 1;
}
return cmp > 0 ? 1 : -1;
}
int gserialized_read_gbox_p(const GSERIALIZED *g, GBOX *gbox)
{
/* Null input! */
if ( ! ( g && gbox ) ) return LW_FAILURE;
/* Initialize the flags on the box */
gbox->flags = g->flags;
/* Has pre-calculated box */
if ( FLAGS_GET_BBOX(g->flags) )
{
int i = 0;
float *fbox = (float*)(g->data);
gbox->xmin = fbox[i++];
gbox->xmax = fbox[i++];
gbox->ymin = fbox[i++];
gbox->ymax = fbox[i++];
/* Geodetic? Read next dimension (geocentric Z) and return */
if ( FLAGS_GET_GEODETIC(g->flags) )
{
gbox->zmin = fbox[i++];
gbox->zmax = fbox[i++];
return LW_SUCCESS;
}
/* Cartesian? Read extra dimensions (if there) and return */
if ( FLAGS_GET_Z(g->flags) )
{
gbox->zmin = fbox[i++];
gbox->zmax = fbox[i++];
}
if ( FLAGS_GET_M(g->flags) )
{
gbox->mmin = fbox[i++];
gbox->mmax = fbox[i++];
}
return LW_SUCCESS;
}
return LW_FAILURE;
}
/*
* Populate a bounding box *without* allocating an LWGEOM. Useful
* for some performance purposes.
*/
static int gserialized_peek_gbox_p(const GSERIALIZED *g, GBOX *gbox)
{
uint32_t type = gserialized_get_type(g);
/* Peeking doesn't help if you already have a box or are geodetic */
if ( FLAGS_GET_GEODETIC(g->flags) || FLAGS_GET_BBOX(g->flags) )
{
return LW_FAILURE;
}
/* Boxes of points are easy peasy */
if ( type == POINTTYPE )
{
int i = 1; /* Start past <pointtype><padding> */
double *dptr = (double*)(g->data);
/* Read the empty flag */
int *iptr = (int*)(g->data);
int isempty = (iptr[1] == 0);
/* EMPTY point has no box */
if ( isempty ) return LW_FAILURE;
gbox->xmin = gbox->xmax = dptr[i++];
gbox->ymin = gbox->ymax = dptr[i++];
gbox->flags = g->flags;
if ( FLAGS_GET_Z(g->flags) )
{
gbox->zmin = gbox->zmax = dptr[i++];
}
if ( FLAGS_GET_M(g->flags) )
{
gbox->mmin = gbox->mmax = dptr[i++];
}
gbox_float_round(gbox);
return LW_SUCCESS;
}
/* We can calculate the box of a two-point cartesian line trivially */
else if ( type == LINETYPE )
{
int ndims = FLAGS_NDIMS(g->flags);
int i = 0; /* Start at <linetype><npoints> */
double *dptr = (double*)(g->data);
int *iptr = (int*)(g->data);
int npoints = iptr[1]; /* Read the npoints */
/* This only works with 2-point lines */
if ( npoints != 2 )
return LW_FAILURE;
/* Advance to X */
/* Past <linetype><npoints> */
i++;
gbox->xmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->xmax = FP_MAX(dptr[i], dptr[i+ndims]);
/* Advance to Y */
i++;
gbox->ymin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->ymax = FP_MAX(dptr[i], dptr[i+ndims]);
gbox->flags = g->flags;
if ( FLAGS_GET_Z(g->flags) )
{
/* Advance to Z */
i++;
gbox->zmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->zmax = FP_MAX(dptr[i], dptr[i+ndims]);
}
if ( FLAGS_GET_M(g->flags) )
{
/* Advance to M */
i++;
gbox->mmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->mmax = FP_MAX(dptr[i], dptr[i+ndims]);
}
gbox_float_round(gbox);
return LW_SUCCESS;
}
/* We can also do single-entry multi-points */
else if ( type == MULTIPOINTTYPE )
{
int i = 0; /* Start at <multipointtype><ngeoms> */
double *dptr = (double*)(g->data);
int *iptr = (int*)(g->data);
int ngeoms = iptr[1]; /* Read the ngeoms */
int npoints;
/* This only works with single-entry multipoints */
if ( ngeoms != 1 )
return LW_FAILURE;
/* Npoints is at <multipointtype><ngeoms><pointtype><npoints> */
npoints = iptr[3];
/* The check below is necessary because we can have a MULTIPOINT
* that contains a single, empty POINT (ngeoms = 1, npoints = 0) */
if ( npoints != 1 )
return LW_FAILURE;
/* Move forward two doubles (four ints) */
/* Past <multipointtype><ngeoms> */
/* Past <pointtype><npoints> */
i += 2;
/* Read the doubles from the one point */
gbox->xmin = gbox->xmax = dptr[i++];
gbox->ymin = gbox->ymax = dptr[i++];
gbox->flags = g->flags;
if ( FLAGS_GET_Z(g->flags) )
{
gbox->zmin = gbox->zmax = dptr[i++];
}
if ( FLAGS_GET_M(g->flags) )
{
gbox->mmin = gbox->mmax = dptr[i++];
}
gbox_float_round(gbox);
return LW_SUCCESS;
}
/* And we can do single-entry multi-lines with two vertices (!!!) */
else if ( type == MULTILINETYPE )
{
int ndims = FLAGS_NDIMS(g->flags);
int i = 0; /* Start at <multilinetype><ngeoms> */
double *dptr = (double*)(g->data);
int *iptr = (int*)(g->data);
int ngeoms = iptr[1]; /* Read the ngeoms */
int npoints;
/* This only works with 1-line multilines */
if ( ngeoms != 1 )
return LW_FAILURE;
/* Npoints is at <multilinetype><ngeoms><linetype><npoints> */
npoints = iptr[3];
if ( npoints != 2 )
return LW_FAILURE;
/* Advance to X */
/* Move forward two doubles (four ints) */
/* Past <multilinetype><ngeoms> */
/* Past <linetype><npoints> */
i += 2;
gbox->xmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->xmax = FP_MAX(dptr[i], dptr[i+ndims]);
/* Advance to Y */
i++;
gbox->ymin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->ymax = FP_MAX(dptr[i], dptr[i+ndims]);
gbox->flags = g->flags;
if ( FLAGS_GET_Z(g->flags) )
{
/* Advance to Z */
i++;
gbox->zmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->zmax = FP_MAX(dptr[i], dptr[i+ndims]);
}
if ( FLAGS_GET_M(g->flags) )
{
/* Advance to M */
i++;
gbox->mmin = FP_MIN(dptr[i], dptr[i+ndims]);
gbox->mmax = FP_MAX(dptr[i], dptr[i+ndims]);
}
gbox_float_round(gbox);
return LW_SUCCESS;
}
return LW_FAILURE;
}
/**
* Read the bounding box off a serialization and calculate one if
* it is not already there.
*/
int gserialized_get_gbox_p(const GSERIALIZED *g, GBOX *box)
{
/* Try to just read the serialized box. */
if ( gserialized_read_gbox_p(g, box) == LW_SUCCESS )
{
return LW_SUCCESS;
}
/* No box? Try to peek into simpler geometries and */
/* derive a box without creating an lwgeom */
else if ( gserialized_peek_gbox_p(g, box) == LW_SUCCESS )
{
return LW_SUCCESS;
}
/* Damn! Nothing for it but to create an lwgeom... */
/* See http://trac.osgeo.org/postgis/ticket/1023 */
else
{
LWGEOM *lwgeom = lwgeom_from_gserialized(g);
int ret = lwgeom_calculate_gbox(lwgeom, box);
gbox_float_round(box);
lwgeom_free(lwgeom);
return ret;
}
}
/***********************************************************************
* Calculate the GSERIALIZED size for an LWGEOM.
*/
/* Private functions */
static size_t gserialized_from_any_size(const LWGEOM *geom); /* Local prototype */
static size_t gserialized_from_lwpoint_size(const LWPOINT *point)
{
size_t size = 4; /* Type number. */
assert(point);
size += 4; /* Number of points (one or zero (empty)). */
size += point->point->npoints * FLAGS_NDIMS(point->flags) * sizeof(double);
LWDEBUGF(3, "point size = %d", size);
return size;
}
static size_t gserialized_from_lwline_size(const LWLINE *line)
{
size_t size = 4; /* Type number. */
assert(line);
size += 4; /* Number of points (zero => empty). */
size += line->points->npoints * FLAGS_NDIMS(line->flags) * sizeof(double);
LWDEBUGF(3, "linestring size = %d", size);
return size;
}
static size_t gserialized_from_lwtriangle_size(const LWTRIANGLE *triangle)
{
size_t size = 4; /* Type number. */
assert(triangle);
size += 4; /* Number of points (zero => empty). */
size += triangle->points->npoints * FLAGS_NDIMS(triangle->flags) * sizeof(double);
LWDEBUGF(3, "triangle size = %d", size);
return size;
}
static size_t gserialized_from_lwpoly_size(const LWPOLY *poly)
{
size_t size = 4; /* Type number. */
uint32_t i = 0;
assert(poly);
size += 4; /* Number of rings (zero => empty). */
if ( poly->nrings % 2 )
size += 4; /* Padding to double alignment. */
for ( i = 0; i < poly->nrings; i++ )
{
size += 4; /* Number of points in ring. */
size += poly->rings[i]->npoints * FLAGS_NDIMS(poly->flags) * sizeof(double);
}
LWDEBUGF(3, "polygon size = %d", size);
return size;
}
static size_t gserialized_from_lwcircstring_size(const LWCIRCSTRING *curve)
{
size_t size = 4; /* Type number. */
assert(curve);
size += 4; /* Number of points (zero => empty). */
size += curve->points->npoints * FLAGS_NDIMS(curve->flags) * sizeof(double);
LWDEBUGF(3, "circstring size = %d", size);
return size;
}
static size_t gserialized_from_lwcollection_size(const LWCOLLECTION *col)
{
size_t size = 4; /* Type number. */
uint32_t i = 0;
assert(col);
size += 4; /* Number of sub-geometries (zero => empty). */
for ( i = 0; i < col->ngeoms; i++ )
{
size_t subsize = gserialized_from_any_size(col->geoms[i]);
size += subsize;
LWDEBUGF(3, "lwcollection subgeom(%d) size = %d", i, subsize);
}
LWDEBUGF(3, "lwcollection size = %d", size);
return size;
}
static size_t gserialized_from_any_size(const LWGEOM *geom)
{
LWDEBUGF(2, "Input type: %s", lwtype_name(geom->type));
switch (geom->type)
{
case POINTTYPE:
return gserialized_from_lwpoint_size((LWPOINT *)geom);
case LINETYPE:
return gserialized_from_lwline_size((LWLINE *)geom);
case POLYGONTYPE:
return gserialized_from_lwpoly_size((LWPOLY *)geom);
case TRIANGLETYPE:
return gserialized_from_lwtriangle_size((LWTRIANGLE *)geom);
case CIRCSTRINGTYPE:
return gserialized_from_lwcircstring_size((LWCIRCSTRING *)geom);
case CURVEPOLYTYPE:
case COMPOUNDTYPE:
case MULTIPOINTTYPE:
case MULTILINETYPE:
case MULTICURVETYPE:
case MULTIPOLYGONTYPE:
case MULTISURFACETYPE:
case POLYHEDRALSURFACETYPE:
case TINTYPE:
case COLLECTIONTYPE:
return gserialized_from_lwcollection_size((LWCOLLECTION *)geom);
default:
lwerror("Unknown geometry type: %d - %s", geom->type, lwtype_name(geom->type));
return 0;
}
}
/* Public function */
size_t gserialized_from_lwgeom_size(const LWGEOM *geom)
{
size_t size = 8; /* Header overhead. */
assert(geom);
if ( geom->bbox )
size += gbox_serialized_size(geom->flags);
size += gserialized_from_any_size(geom);
LWDEBUGF(3, "g_serialize size = %d", size);
return size;
}
/***********************************************************************
* Serialize an LWGEOM into GSERIALIZED.
*/
/* Private functions */
static size_t gserialized_from_lwgeom_any(const LWGEOM *geom, uint8_t *buf);
static size_t gserialized_from_lwpoint(const LWPOINT *point, uint8_t *buf)
{
uint8_t *loc;
int ptsize = ptarray_point_size(point->point);
int type = POINTTYPE;
assert(point);
assert(buf);
if ( FLAGS_GET_ZM(point->flags) != FLAGS_GET_ZM(point->point->flags) )
lwerror("Dimensions mismatch in lwpoint");
LWDEBUGF(2, "lwpoint_to_gserialized(%p, %p) called", point, buf);
loc = buf;
/* Write in the type. */
memcpy(loc, &type, sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Write in the number of points (0 => empty). */
memcpy(loc, &(point->point->npoints), sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Copy in the ordinates. */
if ( point->point->npoints > 0 )
{
memcpy(loc, getPoint_internal(point->point, 0), ptsize);
loc += ptsize;
}
return (size_t)(loc - buf);
}
static size_t gserialized_from_lwline(const LWLINE *line, uint8_t *buf)
{
uint8_t *loc;
int ptsize;
size_t size;
int type = LINETYPE;
assert(line);
assert(buf);
LWDEBUGF(2, "lwline_to_gserialized(%p, %p) called", line, buf);
if ( FLAGS_GET_Z(line->flags) != FLAGS_GET_Z(line->points->flags) )
lwerror("Dimensions mismatch in lwline");
ptsize = ptarray_point_size(line->points);
loc = buf;
/* Write in the type. */
memcpy(loc, &type, sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Write in the npoints. */
memcpy(loc, &(line->points->npoints), sizeof(uint32_t));
loc += sizeof(uint32_t);
LWDEBUGF(3, "lwline_to_gserialized added npoints (%d)", line->points->npoints);
/* Copy in the ordinates. */
if ( line->points->npoints > 0 )
{
size = line->points->npoints * ptsize;
memcpy(loc, getPoint_internal(line->points, 0), size);
loc += size;
}
LWDEBUGF(3, "lwline_to_gserialized copied serialized_pointlist (%d bytes)", ptsize * line->points->npoints);
return (size_t)(loc - buf);
}
static size_t gserialized_from_lwpoly(const LWPOLY *poly, uint8_t *buf)
{
uint32_t i;
uint8_t *loc;
int ptsize;
int type = POLYGONTYPE;
assert(poly);
assert(buf);
LWDEBUG(2, "lwpoly_to_gserialized called");
ptsize = sizeof(double) * FLAGS_NDIMS(poly->flags);
loc = buf;
/* Write in the type. */
memcpy(loc, &type, sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Write in the nrings. */
memcpy(loc, &(poly->nrings), sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Write in the npoints per ring. */
for ( i = 0; i < poly->nrings; i++ )
{
memcpy(loc, &(poly->rings[i]->npoints), sizeof(uint32_t));
loc += sizeof(uint32_t);
}
/* Add in padding if necessary to remain double aligned. */
if ( poly->nrings % 2 )
{
memset(loc, 0, sizeof(uint32_t));
loc += sizeof(uint32_t);
}
/* Copy in the ordinates. */
for ( i = 0; i < poly->nrings; i++ )
{
POINTARRAY *pa = poly->rings[i];
size_t pasize;
if ( FLAGS_GET_ZM(poly->flags) != FLAGS_GET_ZM(pa->flags) )
lwerror("Dimensions mismatch in lwpoly");
pasize = pa->npoints * ptsize;
memcpy(loc, getPoint_internal(pa, 0), pasize);
loc += pasize;
}
return (size_t)(loc - buf);
}
static size_t gserialized_from_lwtriangle(const LWTRIANGLE *triangle, uint8_t *buf)
{
uint8_t *loc;
int ptsize;
size_t size;
int type = TRIANGLETYPE;
assert(triangle);
assert(buf);
LWDEBUGF(2, "lwtriangle_to_gserialized(%p, %p) called", triangle, buf);
if ( FLAGS_GET_ZM(triangle->flags) != FLAGS_GET_ZM(triangle->points->flags) )
lwerror("Dimensions mismatch in lwtriangle");
ptsize = ptarray_point_size(triangle->points);
loc = buf;
/* Write in the type. */
memcpy(loc, &type, sizeof(uint32_t));
loc += sizeof(uint32_t);
/* Write in the npoints. */
memcpy(loc, &(triangle->points->npoints), sizeof(uint32_t));
loc += sizeof(uint32_t);
LWDEBUGF(3, "lwtriangle_to_gserialized added npoints (%d)", triangle->points->npoints);
/* Copy in the ordinates. */
if ( triangle->points->npoints > 0 )
{
size = triangle->points->npoints * ptsize;
memcpy(loc, getPoint_internal(triangle->points, 0), size);
loc += size;
}
LWDEBUGF(3, "lwtriangle_to_gserialized copied serialized_pointlist (%d bytes)", ptsize * triangle->points->npoints);
return (size_t)(loc - buf);
}
static size_t gserialized_from_lwcircstring(const LWCIRCSTRING *curve, uint8_t *buf)
{
uint8_t *loc;
int ptsize;