-
Notifications
You must be signed in to change notification settings - Fork 62
/
shptree.c
1108 lines (908 loc) · 42 KB
/
shptree.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
/******************************************************************************
*
* Project: Shapelib
* Purpose: Implementation of quadtree building and searching functions.
* Author: Frank Warmerdam, warmerdam@pobox.com
*
******************************************************************************
* Copyright (c) 1999, Frank Warmerdam
* Copyright (c) 2012, Even Rouault <even dot rouault at spatialys.com>
*
* SPDX-License-Identifier: MIT OR LGPL-2.0-or-later
******************************************************************************
*
*/
#include "shapefil_private.h"
#include <math.h>
#include <assert.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#ifdef USE_CPL
#include "cpl_error.h"
#endif
#ifndef TRUE
#define TRUE 1
#define FALSE 0
#endif
/* -------------------------------------------------------------------- */
/* If the following is 0.5, nodes will be split in half. If it */
/* is 0.6 then each subnode will contain 60% of the parent */
/* node, with 20% representing overlap. This can be help to */
/* prevent small objects on a boundary from shifting too high */
/* up the tree. */
/* -------------------------------------------------------------------- */
#define SHP_SPLIT_RATIO 0.55
/************************************************************************/
/* SHPTreeNodeInit() */
/* */
/* Initialize a tree node. */
/************************************************************************/
static SHPTreeNode *SHPTreeNodeCreate(const double *padfBoundsMin,
const double *padfBoundsMax)
{
SHPTreeNode *psTreeNode;
psTreeNode = STATIC_CAST(SHPTreeNode *, malloc(sizeof(SHPTreeNode)));
if (SHPLIB_NULLPTR == psTreeNode)
return SHPLIB_NULLPTR;
psTreeNode->nShapeCount = 0;
psTreeNode->panShapeIds = SHPLIB_NULLPTR;
psTreeNode->papsShapeObj = SHPLIB_NULLPTR;
psTreeNode->nSubNodes = 0;
if (padfBoundsMin != SHPLIB_NULLPTR)
memcpy(psTreeNode->adfBoundsMin, padfBoundsMin, sizeof(double) * 4);
if (padfBoundsMax != SHPLIB_NULLPTR)
memcpy(psTreeNode->adfBoundsMax, padfBoundsMax, sizeof(double) * 4);
return psTreeNode;
}
/************************************************************************/
/* SHPCreateTree() */
/************************************************************************/
SHPTree SHPAPI_CALL1(*)
SHPCreateTree(SHPHandle hSHP, int nDimension, int nMaxDepth,
const double *padfBoundsMin, const double *padfBoundsMax)
{
SHPTree *psTree;
if (padfBoundsMin == SHPLIB_NULLPTR && hSHP == SHPLIB_NULLPTR)
return SHPLIB_NULLPTR;
/* -------------------------------------------------------------------- */
/* Allocate the tree object */
/* -------------------------------------------------------------------- */
psTree = STATIC_CAST(SHPTree *, malloc(sizeof(SHPTree)));
if (SHPLIB_NULLPTR == psTree)
{
return SHPLIB_NULLPTR;
}
psTree->hSHP = hSHP;
psTree->nMaxDepth = nMaxDepth;
psTree->nDimension = nDimension;
psTree->nTotalCount = 0;
/* -------------------------------------------------------------------- */
/* If no max depth was defined, try to select a reasonable one */
/* that implies approximately 8 shapes per node. */
/* -------------------------------------------------------------------- */
if (psTree->nMaxDepth == 0 && hSHP != SHPLIB_NULLPTR)
{
int nMaxNodeCount = 1;
int nShapeCount;
SHPGetInfo(hSHP, &nShapeCount, SHPLIB_NULLPTR, SHPLIB_NULLPTR,
SHPLIB_NULLPTR);
while (nMaxNodeCount * 4 < nShapeCount)
{
psTree->nMaxDepth += 1;
nMaxNodeCount = nMaxNodeCount * 2;
}
#ifdef USE_CPL
CPLDebug("Shape", "Estimated spatial index tree depth: %d",
psTree->nMaxDepth);
#endif
/* NOTE: Due to problems with memory allocation for deep trees,
* automatically estimated depth is limited up to 12 levels.
* See Ticket #1594 for detailed discussion.
*/
if (psTree->nMaxDepth > MAX_DEFAULT_TREE_DEPTH)
{
psTree->nMaxDepth = MAX_DEFAULT_TREE_DEPTH;
#ifdef USE_CPL
CPLDebug(
"Shape",
"Falling back to max number of allowed index tree levels (%d).",
MAX_DEFAULT_TREE_DEPTH);
#endif
}
}
/* -------------------------------------------------------------------- */
/* Allocate the root node. */
/* -------------------------------------------------------------------- */
psTree->psRoot = SHPTreeNodeCreate(padfBoundsMin, padfBoundsMax);
if (SHPLIB_NULLPTR == psTree->psRoot)
{
free(psTree);
return SHPLIB_NULLPTR;
}
/* -------------------------------------------------------------------- */
/* Assign the bounds to the root node. If none are passed in, */
/* use the bounds of the provided file otherwise the create */
/* function will have already set the bounds. */
/* -------------------------------------------------------------------- */
if (padfBoundsMin == SHPLIB_NULLPTR)
{
SHPGetInfo(hSHP, SHPLIB_NULLPTR, SHPLIB_NULLPTR,
psTree->psRoot->adfBoundsMin, psTree->psRoot->adfBoundsMax);
}
/* -------------------------------------------------------------------- */
/* If we have a file, insert all its shapes into the tree. */
/* -------------------------------------------------------------------- */
if (hSHP != SHPLIB_NULLPTR)
{
int iShape, nShapeCount;
SHPGetInfo(hSHP, &nShapeCount, SHPLIB_NULLPTR, SHPLIB_NULLPTR,
SHPLIB_NULLPTR);
for (iShape = 0; iShape < nShapeCount; iShape++)
{
SHPObject *psShape;
psShape = SHPReadObject(hSHP, iShape);
if (psShape != SHPLIB_NULLPTR)
{
SHPTreeAddShapeId(psTree, psShape);
SHPDestroyObject(psShape);
}
}
}
return psTree;
}
/************************************************************************/
/* SHPDestroyTreeNode() */
/************************************************************************/
static void SHPDestroyTreeNode(SHPTreeNode *psTreeNode)
{
int i;
assert(SHPLIB_NULLPTR != psTreeNode);
for (i = 0; i < psTreeNode->nSubNodes; i++)
{
if (psTreeNode->apsSubNode[i] != SHPLIB_NULLPTR)
SHPDestroyTreeNode(psTreeNode->apsSubNode[i]);
}
if (psTreeNode->panShapeIds != SHPLIB_NULLPTR)
free(psTreeNode->panShapeIds);
if (psTreeNode->papsShapeObj != SHPLIB_NULLPTR)
{
for (i = 0; i < psTreeNode->nShapeCount; i++)
{
if (psTreeNode->papsShapeObj[i] != SHPLIB_NULLPTR)
SHPDestroyObject(psTreeNode->papsShapeObj[i]);
}
free(psTreeNode->papsShapeObj);
}
free(psTreeNode);
}
/************************************************************************/
/* SHPDestroyTree() */
/************************************************************************/
void SHPAPI_CALL SHPDestroyTree(SHPTree *psTree)
{
SHPDestroyTreeNode(psTree->psRoot);
free(psTree);
}
/************************************************************************/
/* SHPCheckBoundsOverlap() */
/* */
/* Do the given boxes overlap at all? */
/************************************************************************/
int SHPAPI_CALL SHPCheckBoundsOverlap(const double *padfBox1Min,
const double *padfBox1Max,
const double *padfBox2Min,
const double *padfBox2Max, int nDimension)
{
for (int iDim = 0; iDim < nDimension; iDim++)
{
if (padfBox2Max[iDim] < padfBox1Min[iDim])
return FALSE;
if (padfBox1Max[iDim] < padfBox2Min[iDim])
return FALSE;
}
return TRUE;
}
/************************************************************************/
/* SHPCheckObjectContained() */
/* */
/* Does the given shape fit within the indicated extents? */
/************************************************************************/
static bool SHPCheckObjectContained(const SHPObject *psObject, int nDimension,
const double *padfBoundsMin,
const double *padfBoundsMax)
{
if (psObject->dfXMin < padfBoundsMin[0] ||
psObject->dfXMax > padfBoundsMax[0])
return false;
if (psObject->dfYMin < padfBoundsMin[1] ||
psObject->dfYMax > padfBoundsMax[1])
return false;
if (nDimension == 2)
return true;
if (psObject->dfZMin < padfBoundsMin[2] ||
psObject->dfZMax > padfBoundsMax[2])
return false;
if (nDimension == 3)
return true;
if (psObject->dfMMin < padfBoundsMin[3] ||
psObject->dfMMax > padfBoundsMax[3])
return false;
return true;
}
/************************************************************************/
/* SHPTreeSplitBounds() */
/* */
/* Split a region into two subregion evenly, cutting along the */
/* longest dimension. */
/************************************************************************/
static void SHPTreeSplitBounds(const double *padfBoundsMinIn,
const double *padfBoundsMaxIn,
double *padfBoundsMin1, double *padfBoundsMax1,
double *padfBoundsMin2, double *padfBoundsMax2)
{
/* -------------------------------------------------------------------- */
/* The output bounds will be very similar to the input bounds, */
/* so just copy over to start. */
/* -------------------------------------------------------------------- */
memcpy(padfBoundsMin1, padfBoundsMinIn, sizeof(double) * 4);
memcpy(padfBoundsMax1, padfBoundsMaxIn, sizeof(double) * 4);
memcpy(padfBoundsMin2, padfBoundsMinIn, sizeof(double) * 4);
memcpy(padfBoundsMax2, padfBoundsMaxIn, sizeof(double) * 4);
/* -------------------------------------------------------------------- */
/* Split in X direction. */
/* -------------------------------------------------------------------- */
if ((padfBoundsMaxIn[0] - padfBoundsMinIn[0]) >
(padfBoundsMaxIn[1] - padfBoundsMinIn[1]))
{
double dfRange = padfBoundsMaxIn[0] - padfBoundsMinIn[0];
padfBoundsMax1[0] = padfBoundsMinIn[0] + dfRange * SHP_SPLIT_RATIO;
padfBoundsMin2[0] = padfBoundsMaxIn[0] - dfRange * SHP_SPLIT_RATIO;
}
/* -------------------------------------------------------------------- */
/* Otherwise split in Y direction. */
/* -------------------------------------------------------------------- */
else
{
double dfRange = padfBoundsMaxIn[1] - padfBoundsMinIn[1];
padfBoundsMax1[1] = padfBoundsMinIn[1] + dfRange * SHP_SPLIT_RATIO;
padfBoundsMin2[1] = padfBoundsMaxIn[1] - dfRange * SHP_SPLIT_RATIO;
}
}
/************************************************************************/
/* SHPTreeNodeAddShapeId() */
/************************************************************************/
static bool SHPTreeNodeAddShapeId(SHPTreeNode *psTreeNode, SHPObject *psObject,
int nMaxDepth, int nDimension)
{
int i;
/* -------------------------------------------------------------------- */
/* If there are subnodes, then consider whether this object */
/* will fit in them. */
/* -------------------------------------------------------------------- */
if (nMaxDepth > 1 && psTreeNode->nSubNodes > 0)
{
for (i = 0; i < psTreeNode->nSubNodes; i++)
{
if (SHPCheckObjectContained(
psObject, nDimension,
psTreeNode->apsSubNode[i]->adfBoundsMin,
psTreeNode->apsSubNode[i]->adfBoundsMax))
{
return SHPTreeNodeAddShapeId(psTreeNode->apsSubNode[i],
psObject, nMaxDepth - 1,
nDimension);
}
}
}
/* -------------------------------------------------------------------- */
/* Otherwise, consider creating four subnodes if could fit into */
/* them, and adding to the appropriate subnode. */
/* -------------------------------------------------------------------- */
#if MAX_SUBNODE == 4
else if (nMaxDepth > 1 && psTreeNode->nSubNodes == 0)
{
double adfBoundsMinH1[4], adfBoundsMaxH1[4];
double adfBoundsMinH2[4], adfBoundsMaxH2[4];
double adfBoundsMin1[4], adfBoundsMax1[4];
double adfBoundsMin2[4], adfBoundsMax2[4];
double adfBoundsMin3[4], adfBoundsMax3[4];
double adfBoundsMin4[4], adfBoundsMax4[4];
SHPTreeSplitBounds(psTreeNode->adfBoundsMin, psTreeNode->adfBoundsMax,
adfBoundsMinH1, adfBoundsMaxH1, adfBoundsMinH2,
adfBoundsMaxH2);
SHPTreeSplitBounds(adfBoundsMinH1, adfBoundsMaxH1, adfBoundsMin1,
adfBoundsMax1, adfBoundsMin2, adfBoundsMax2);
SHPTreeSplitBounds(adfBoundsMinH2, adfBoundsMaxH2, adfBoundsMin3,
adfBoundsMax3, adfBoundsMin4, adfBoundsMax4);
if (SHPCheckObjectContained(psObject, nDimension, adfBoundsMin1,
adfBoundsMax1) ||
SHPCheckObjectContained(psObject, nDimension, adfBoundsMin2,
adfBoundsMax2) ||
SHPCheckObjectContained(psObject, nDimension, adfBoundsMin3,
adfBoundsMax3) ||
SHPCheckObjectContained(psObject, nDimension, adfBoundsMin4,
adfBoundsMax4))
{
psTreeNode->nSubNodes = 4;
psTreeNode->apsSubNode[0] =
SHPTreeNodeCreate(adfBoundsMin1, adfBoundsMax1);
psTreeNode->apsSubNode[1] =
SHPTreeNodeCreate(adfBoundsMin2, adfBoundsMax2);
psTreeNode->apsSubNode[2] =
SHPTreeNodeCreate(adfBoundsMin3, adfBoundsMax3);
psTreeNode->apsSubNode[3] =
SHPTreeNodeCreate(adfBoundsMin4, adfBoundsMax4);
/* recurse back on this node now that it has subnodes */
return (SHPTreeNodeAddShapeId(psTreeNode, psObject, nMaxDepth,
nDimension));
}
}
#endif /* MAX_SUBNODE == 4 */
/* -------------------------------------------------------------------- */
/* Otherwise, consider creating two subnodes if could fit into */
/* them, and adding to the appropriate subnode. */
/* -------------------------------------------------------------------- */
#if MAX_SUBNODE == 2
else if (nMaxDepth > 1 && psTreeNode->nSubNodes == 0)
{
double adfBoundsMin1[4], adfBoundsMax1[4];
double adfBoundsMin2[4], adfBoundsMax2[4];
SHPTreeSplitBounds(psTreeNode->adfBoundsMin, psTreeNode->adfBoundsMax,
adfBoundsMin1, adfBoundsMax1, adfBoundsMin2,
adfBoundsMax2);
if (SHPCheckObjectContained(psObject, nDimension, adfBoundsMin1,
adfBoundsMax1))
{
psTreeNode->nSubNodes = 2;
psTreeNode->apsSubNode[0] =
SHPTreeNodeCreate(adfBoundsMin1, adfBoundsMax1);
psTreeNode->apsSubNode[1] =
SHPTreeNodeCreate(adfBoundsMin2, adfBoundsMax2);
return (SHPTreeNodeAddShapeId(psTreeNode->apsSubNode[0], psObject,
nMaxDepth - 1, nDimension));
}
else if (SHPCheckObjectContained(psObject, nDimension, adfBoundsMin2,
adfBoundsMax2))
{
psTreeNode->nSubNodes = 2;
psTreeNode->apsSubNode[0] =
SHPTreeNodeCreate(adfBoundsMin1, adfBoundsMax1);
psTreeNode->apsSubNode[1] =
SHPTreeNodeCreate(adfBoundsMin2, adfBoundsMax2);
return (SHPTreeNodeAddShapeId(psTreeNode->apsSubNode[1], psObject,
nMaxDepth - 1, nDimension));
}
}
#endif /* MAX_SUBNODE == 2 */
/* -------------------------------------------------------------------- */
/* If none of that worked, just add it to this nodes list. */
/* -------------------------------------------------------------------- */
psTreeNode->nShapeCount++;
psTreeNode->panShapeIds =
STATIC_CAST(int *, realloc(psTreeNode->panShapeIds,
sizeof(int) * psTreeNode->nShapeCount));
psTreeNode->panShapeIds[psTreeNode->nShapeCount - 1] = psObject->nShapeId;
if (psTreeNode->papsShapeObj != SHPLIB_NULLPTR)
{
psTreeNode->papsShapeObj = STATIC_CAST(
SHPObject **, realloc(psTreeNode->papsShapeObj,
sizeof(void *) * psTreeNode->nShapeCount));
psTreeNode->papsShapeObj[psTreeNode->nShapeCount - 1] = SHPLIB_NULLPTR;
}
return true;
}
/************************************************************************/
/* SHPTreeAddShapeId() */
/* */
/* Add a shape to the tree, but don't keep a pointer to the */
/* object data, just keep the shapeid. */
/************************************************************************/
int SHPAPI_CALL SHPTreeAddShapeId(SHPTree *psTree, SHPObject *psObject)
{
psTree->nTotalCount++;
return (SHPTreeNodeAddShapeId(psTree->psRoot, psObject, psTree->nMaxDepth,
psTree->nDimension));
}
/************************************************************************/
/* SHPTreeCollectShapesIds() */
/* */
/* Work function implementing SHPTreeFindLikelyShapes() on a */
/* tree node by tree node basis. */
/************************************************************************/
static void SHPTreeCollectShapeIds(const SHPTree *hTree,
const SHPTreeNode *psTreeNode,
double *padfBoundsMin, double *padfBoundsMax,
int *pnShapeCount, int *pnMaxShapes,
int **ppanShapeList)
{
int i;
/* -------------------------------------------------------------------- */
/* Does this node overlap the area of interest at all? If not, */
/* return without adding to the list at all. */
/* -------------------------------------------------------------------- */
if (!SHPCheckBoundsOverlap(psTreeNode->adfBoundsMin,
psTreeNode->adfBoundsMax, padfBoundsMin,
padfBoundsMax, hTree->nDimension))
return;
/* -------------------------------------------------------------------- */
/* Grow the list to hold the shapes on this node. */
/* -------------------------------------------------------------------- */
if (*pnShapeCount + psTreeNode->nShapeCount > *pnMaxShapes)
{
*pnMaxShapes = (*pnShapeCount + psTreeNode->nShapeCount) * 2 + 20;
*ppanShapeList = STATIC_CAST(
int *, realloc(*ppanShapeList, sizeof(int) * *pnMaxShapes));
}
/* -------------------------------------------------------------------- */
/* Add the local nodes shapeids to the list. */
/* -------------------------------------------------------------------- */
for (i = 0; i < psTreeNode->nShapeCount; i++)
{
(*ppanShapeList)[(*pnShapeCount)++] = psTreeNode->panShapeIds[i];
}
/* -------------------------------------------------------------------- */
/* Recurse to subnodes if they exist. */
/* -------------------------------------------------------------------- */
for (i = 0; i < psTreeNode->nSubNodes; i++)
{
if (psTreeNode->apsSubNode[i] != SHPLIB_NULLPTR)
SHPTreeCollectShapeIds(hTree, psTreeNode->apsSubNode[i],
padfBoundsMin, padfBoundsMax, pnShapeCount,
pnMaxShapes, ppanShapeList);
}
}
/************************************************************************/
/* SHPTreeFindLikelyShapes() */
/* */
/* Find all shapes within tree nodes for which the tree node */
/* bounding box overlaps the search box. The return value is */
/* an array of shapeids terminated by a -1. The shapeids will */
/* be in order, as hopefully this will result in faster (more */
/* sequential) reading from the file. */
/************************************************************************/
/* helper for qsort */
static int SHPTreeCompareInts(const void *a, const void *b)
{
return *REINTERPRET_CAST(const int *, a) -
*REINTERPRET_CAST(const int *, b);
}
int SHPAPI_CALL1(*)
SHPTreeFindLikelyShapes(const SHPTree *hTree, double *padfBoundsMin,
double *padfBoundsMax, int *pnShapeCount)
{
int *panShapeList = SHPLIB_NULLPTR, nMaxShapes = 0;
/* -------------------------------------------------------------------- */
/* Perform the search by recursive descent. */
/* -------------------------------------------------------------------- */
*pnShapeCount = 0;
SHPTreeCollectShapeIds(hTree, hTree->psRoot, padfBoundsMin, padfBoundsMax,
pnShapeCount, &nMaxShapes, &panShapeList);
/* -------------------------------------------------------------------- */
/* Sort the id array */
/* -------------------------------------------------------------------- */
if (panShapeList != SHPLIB_NULLPTR)
qsort(panShapeList, *pnShapeCount, sizeof(int), SHPTreeCompareInts);
return panShapeList;
}
/************************************************************************/
/* SHPTreeNodeTrim() */
/* */
/* This is the recursive version of SHPTreeTrimExtraNodes() that */
/* walks the tree cleaning it up. */
/************************************************************************/
static int SHPTreeNodeTrim(SHPTreeNode *psTreeNode)
{
int i;
/* -------------------------------------------------------------------- */
/* Trim subtrees, and free subnodes that come back empty. */
/* -------------------------------------------------------------------- */
for (i = 0; i < psTreeNode->nSubNodes; i++)
{
if (SHPTreeNodeTrim(psTreeNode->apsSubNode[i]))
{
SHPDestroyTreeNode(psTreeNode->apsSubNode[i]);
psTreeNode->apsSubNode[i] =
psTreeNode->apsSubNode[psTreeNode->nSubNodes - 1];
psTreeNode->nSubNodes--;
i--; /* process the new occupant of this subnode entry */
}
}
/* -------------------------------------------------------------------- */
/* If the current node has 1 subnode and no shapes, promote that */
/* subnode to the current node position. */
/* -------------------------------------------------------------------- */
if (psTreeNode->nSubNodes == 1 && psTreeNode->nShapeCount == 0)
{
SHPTreeNode *psSubNode = psTreeNode->apsSubNode[0];
memcpy(psTreeNode->adfBoundsMin, psSubNode->adfBoundsMin,
sizeof(psSubNode->adfBoundsMin));
memcpy(psTreeNode->adfBoundsMax, psSubNode->adfBoundsMax,
sizeof(psSubNode->adfBoundsMax));
psTreeNode->nShapeCount = psSubNode->nShapeCount;
assert(psTreeNode->panShapeIds == SHPLIB_NULLPTR);
psTreeNode->panShapeIds = psSubNode->panShapeIds;
assert(psTreeNode->papsShapeObj == SHPLIB_NULLPTR);
psTreeNode->papsShapeObj = psSubNode->papsShapeObj;
psTreeNode->nSubNodes = psSubNode->nSubNodes;
for (i = 0; i < psSubNode->nSubNodes; i++)
psTreeNode->apsSubNode[i] = psSubNode->apsSubNode[i];
free(psSubNode);
}
/* -------------------------------------------------------------------- */
/* We should be trimmed if we have no subnodes, and no shapes. */
/* -------------------------------------------------------------------- */
return (psTreeNode->nSubNodes == 0 && psTreeNode->nShapeCount == 0);
}
/************************************************************************/
/* SHPTreeTrimExtraNodes() */
/* */
/* Trim empty nodes from the tree. Note that we never trim an */
/* empty root node. */
/************************************************************************/
void SHPAPI_CALL SHPTreeTrimExtraNodes(SHPTree *hTree)
{
SHPTreeNodeTrim(hTree->psRoot);
}
struct SHPDiskTreeInfo
{
SAHooks sHooks;
SAFile fpQIX;
};
/************************************************************************/
/* SHPOpenDiskTree() */
/************************************************************************/
SHPTreeDiskHandle SHPOpenDiskTree(const char *pszQIXFilename,
const SAHooks *psHooks)
{
SHPTreeDiskHandle hDiskTree;
hDiskTree = STATIC_CAST(SHPTreeDiskHandle,
calloc(1, sizeof(struct SHPDiskTreeInfo)));
if (psHooks == SHPLIB_NULLPTR)
SASetupDefaultHooks(&(hDiskTree->sHooks));
else
memcpy(&(hDiskTree->sHooks), psHooks, sizeof(SAHooks));
hDiskTree->fpQIX = hDiskTree->sHooks.FOpen(pszQIXFilename, "rb",
hDiskTree->sHooks.pvUserData);
if (hDiskTree->fpQIX == SHPLIB_NULLPTR)
{
free(hDiskTree);
return SHPLIB_NULLPTR;
}
return hDiskTree;
}
/***********************************************************************/
/* SHPCloseDiskTree() */
/************************************************************************/
void SHPCloseDiskTree(SHPTreeDiskHandle hDiskTree)
{
if (hDiskTree == SHPLIB_NULLPTR)
return;
hDiskTree->sHooks.FClose(hDiskTree->fpQIX);
free(hDiskTree);
}
/************************************************************************/
/* SHPSearchDiskTreeNode() */
/************************************************************************/
static bool SHPSearchDiskTreeNode(const SHPTreeDiskHandle hDiskTree,
double *padfBoundsMin, double *padfBoundsMax,
int **ppanResultBuffer, int *pnBufferMax,
int *pnResultCount, int bNeedSwap,
int nRecLevel)
{
unsigned int i;
unsigned int offset;
unsigned int numshapes, numsubnodes;
double adfNodeBoundsMin[2], adfNodeBoundsMax[2];
int nFReadAcc;
/* -------------------------------------------------------------------- */
/* Read and unswap first part of node info. */
/* -------------------------------------------------------------------- */
nFReadAcc = STATIC_CAST(
int, hDiskTree->sHooks.FRead(&offset, 4, 1, hDiskTree->fpQIX));
if (bNeedSwap)
SHP_SWAP32(&offset);
nFReadAcc += STATIC_CAST(int, hDiskTree->sHooks.FRead(adfNodeBoundsMin,
sizeof(double), 2,
hDiskTree->fpQIX));
nFReadAcc += STATIC_CAST(int, hDiskTree->sHooks.FRead(adfNodeBoundsMax,
sizeof(double), 2,
hDiskTree->fpQIX));
if (bNeedSwap)
{
SHP_SWAPDOUBLE(adfNodeBoundsMin + 0);
SHP_SWAPDOUBLE(adfNodeBoundsMin + 1);
SHP_SWAPDOUBLE(adfNodeBoundsMax + 0);
SHP_SWAPDOUBLE(adfNodeBoundsMax + 1);
}
nFReadAcc += STATIC_CAST(
int, hDiskTree->sHooks.FRead(&numshapes, 4, 1, hDiskTree->fpQIX));
if (bNeedSwap)
SHP_SWAP32(&numshapes);
/* Check that we could read all previous values */
if (nFReadAcc != 1 + 2 + 2 + 1)
{
hDiskTree->sHooks.Error("I/O error");
return false;
}
/* Sanity checks to avoid int overflows in later computation */
if (offset > INT_MAX - sizeof(int))
{
hDiskTree->sHooks.Error("Invalid value for offset");
return false;
}
if (numshapes > (INT_MAX - offset - sizeof(int)) / sizeof(int) ||
numshapes > INT_MAX / sizeof(int) - *pnResultCount)
{
hDiskTree->sHooks.Error("Invalid value for numshapes");
return false;
}
/* -------------------------------------------------------------------- */
/* If we don't overlap this node at all, we can just fseek() */
/* pass this node info and all subnodes. */
/* -------------------------------------------------------------------- */
if (!SHPCheckBoundsOverlap(adfNodeBoundsMin, adfNodeBoundsMax,
padfBoundsMin, padfBoundsMax, 2))
{
offset += numshapes * sizeof(int) + sizeof(int);
hDiskTree->sHooks.FSeek(hDiskTree->fpQIX, offset, SEEK_CUR);
return true;
}
/* -------------------------------------------------------------------- */
/* Add all the shapeids at this node to our list. */
/* -------------------------------------------------------------------- */
if (numshapes > 0)
{
if (*pnResultCount + numshapes >
STATIC_CAST(unsigned int, *pnBufferMax))
{
int *pNewBuffer;
*pnBufferMax = (*pnResultCount + numshapes + 100) * 5 / 4;
if (STATIC_CAST(size_t, *pnBufferMax) > INT_MAX / sizeof(int))
*pnBufferMax = *pnResultCount + numshapes;
pNewBuffer = STATIC_CAST(
int *, realloc(*ppanResultBuffer, *pnBufferMax * sizeof(int)));
if (pNewBuffer == SHPLIB_NULLPTR)
{
hDiskTree->sHooks.Error("Out of memory error");
return false;
}
*ppanResultBuffer = pNewBuffer;
}
if (hDiskTree->sHooks.FRead(*ppanResultBuffer + *pnResultCount,
sizeof(int), numshapes,
hDiskTree->fpQIX) != numshapes)
{
hDiskTree->sHooks.Error("I/O error");
return false;
}
if (bNeedSwap)
{
for (i = 0; i < numshapes; i++)
SHP_SWAP32(*ppanResultBuffer + *pnResultCount + i);
}
*pnResultCount += numshapes;
}
/* -------------------------------------------------------------------- */
/* Process the subnodes. */
/* -------------------------------------------------------------------- */
if (hDiskTree->sHooks.FRead(&numsubnodes, 4, 1, hDiskTree->fpQIX) != 1)
{
hDiskTree->sHooks.Error("I/O error");
return false;
}
if (bNeedSwap)
SHP_SWAP32(&numsubnodes);
if (numsubnodes > 0 && nRecLevel == 32)
{
hDiskTree->sHooks.Error("Shape tree is too deep");
return false;
}
for (i = 0; i < numsubnodes; i++)
{
if (!SHPSearchDiskTreeNode(hDiskTree, padfBoundsMin, padfBoundsMax,
ppanResultBuffer, pnBufferMax, pnResultCount,
bNeedSwap, nRecLevel + 1))
return false;
}
return true;
}
/************************************************************************/
/* SHPTreeReadLibc() */
/************************************************************************/
static SAOffset SHPTreeReadLibc(void *p, SAOffset size, SAOffset nmemb,
SAFile file)
{
return STATIC_CAST(SAOffset, fread(p, STATIC_CAST(size_t, size),
STATIC_CAST(size_t, nmemb),
REINTERPRET_CAST(FILE *, file)));
}
/************************************************************************/
/* SHPTreeSeekLibc() */
/************************************************************************/
static SAOffset SHPTreeSeekLibc(SAFile file, SAOffset offset, int whence)
{
return STATIC_CAST(SAOffset, fseek(REINTERPRET_CAST(FILE *, file),
STATIC_CAST(long, offset), whence));
}
/************************************************************************/
/* SHPSearchDiskTree() */
/************************************************************************/
int SHPAPI_CALL1(*) SHPSearchDiskTree(FILE *fp, double *padfBoundsMin,
double *padfBoundsMax, int *pnShapeCount)
{
struct SHPDiskTreeInfo sDiskTree;
memset(&sDiskTree.sHooks, 0, sizeof(sDiskTree.sHooks));
/* We do not use SASetupDefaultHooks() because the FILE* */
/* is a libc FILE* */
sDiskTree.sHooks.FSeek = SHPTreeSeekLibc;
sDiskTree.sHooks.FRead = SHPTreeReadLibc;
sDiskTree.fpQIX = REINTERPRET_CAST(SAFile, fp);
return SHPSearchDiskTreeEx(&sDiskTree, padfBoundsMin, padfBoundsMax,
pnShapeCount);
}
/***********************************************************************/
/* SHPSearchDiskTreeEx() */
/************************************************************************/
int SHPAPI_CALL1(*)
SHPSearchDiskTreeEx(const SHPTreeDiskHandle hDiskTree,
double *padfBoundsMin, double *padfBoundsMax,
int *pnShapeCount)
{
int nBufferMax = 0;
unsigned char abyBuf[16];
int *panResultBuffer = SHPLIB_NULLPTR;
*pnShapeCount = 0;
/* -------------------------------------------------------------------- */
/* Read the header. */
/* -------------------------------------------------------------------- */
hDiskTree->sHooks.FSeek(hDiskTree->fpQIX, 0, SEEK_SET);
hDiskTree->sHooks.FRead(abyBuf, 16, 1, hDiskTree->fpQIX);
if (memcmp(abyBuf, "SQT", 3) != 0)
return SHPLIB_NULLPTR;
#if defined(SHP_BIG_ENDIAN)
bool bNeedSwap = abyBuf[3] != 2;
#else
bool bNeedSwap = abyBuf[3] != 1;
#endif
/* -------------------------------------------------------------------- */
/* Search through root node and its descendants. */
/* -------------------------------------------------------------------- */
if (!SHPSearchDiskTreeNode(hDiskTree, padfBoundsMin, padfBoundsMax,
&panResultBuffer, &nBufferMax, pnShapeCount,
bNeedSwap, 0))
{
if (panResultBuffer != SHPLIB_NULLPTR)
free(panResultBuffer);
*pnShapeCount = 0;
return SHPLIB_NULLPTR;
}
/* -------------------------------------------------------------------- */
/* Sort the id array */
/* -------------------------------------------------------------------- */
/* To distinguish between empty intersection from error case */
if (panResultBuffer == SHPLIB_NULLPTR)
panResultBuffer = STATIC_CAST(int *, calloc(1, sizeof(int)));
else
qsort(panResultBuffer, *pnShapeCount, sizeof(int), SHPTreeCompareInts);
return panResultBuffer;
}
/************************************************************************/
/* SHPGetSubNodeOffset() */
/* */
/* Determine how big all the subnodes of this node (and their */
/* children) will be. This will allow disk based searchers to */
/* seek past them all efficiently. */
/************************************************************************/
static int SHPGetSubNodeOffset(SHPTreeNode *node)
{
int i;
int offset = 0;
for (i = 0; i < node->nSubNodes; i++)
{
if (node->apsSubNode[i])
{
offset += 4 * sizeof(double) +
(node->apsSubNode[i]->nShapeCount + 3) * sizeof(int);
offset += SHPGetSubNodeOffset(node->apsSubNode[i]);
}
}
return (offset);
}
/************************************************************************/
/* SHPWriteTreeNode() */
/************************************************************************/
static void SHPWriteTreeNode(SAFile fp, SHPTreeNode *node,
const SAHooks *psHooks)
{
int i, j;
int offset;
unsigned char *pabyRec;
assert(SHPLIB_NULLPTR != node);
offset = SHPGetSubNodeOffset(node);
pabyRec = STATIC_CAST(unsigned char *,