-
Notifications
You must be signed in to change notification settings - Fork 791
/
gie.cpp
1546 lines (1324 loc) · 49.7 KB
/
gie.cpp
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
/***********************************************************************
gie - The Geospatial Integrity Investigation Environment
************************************************************************
The Geospatial Integrity Investigation Environment "gie" is a modest
regression testing environment for the PROJ.4 transformation library.
Its primary design goal was to be able to replace those thousands of
lines of regression testing code that are (at time of writing) part
of PROJ.4, while not requiring any other kind of tooling than the same
C compiler already employed for compiling the library.
The basic functionality of the gie command language is implemented
through just 3 command verbs:
operation, which defines the PROJ.4 operation to test,
accept, which defines the input coordinate to read, and
expect, which defines the result to expect.
E.g:
operation +proj=utm +zone=32 +ellps=GRS80
accept 12 55
expect 691_875.632_14 6_098_907.825_05
Note that gie accepts the underscore ("_") as a thousands separator.
It is not required (in fact, it is entirely ignored by the input
routine), but it significantly improves the readability of the very
long strings of numbers typically required in projected coordinates.
By default, gie considers the EXPECTation met, if the result comes to
within 0.5 mm of the expected. This default can be changed using the
'tolerance' command verb (and yes, I know, linguistically speaking, both
"operation" and "tolerance" are nouns, not verbs). See the first
few hundred lines of the "builtins.gie" test file for more details of
the command verbs available (verbs of both the VERBal and NOUNistic
persuation).
--
But more importantly than being an acronym for "Geospatial Integrity
Investigation Environment", gie were also the initials, user id, and
USGS email address of Gerald Ian Evenden (1935--2016), the geospatial
visionary, who, already in the 1980s, started what was to become the
PROJ.4 of today.
Gerald's clear vision was that map projections are *just special
functions*. Some of them rather complex, most of them of two variables,
but all of them *just special functions*, and not particularly more
special than the sin(), cos(), tan(), and hypot() already available in
the C standard library.
And hence, according to Gerald, *they should not be particularly much
harder to use*, for a programmer, than the sin()s, tan()s and hypot()s
so readily available.
Gerald's ingenuity also showed in the implementation of the vision,
where he devised a comprehensive, yet simple, system of key-value
pairs for parameterising a map projection, and the highly flexible
PJ struct, storing run-time compiled versions of those key-value pairs,
hence making a map projection function call, pj_fwd(PJ, point), as easy
as a traditional function call like hypot(x,y).
While today, we may have more formally well defined metadata systems
(most prominent the OGC WKT2 representation), nothing comes close being
as easily readable ("human compatible") as Gerald's key-value system.
This system in particular, and the PROJ.4 system in general, was
Gerald's great gift to anyone using and/or communicating about geodata.
It is only reasonable to name a program, keeping an eye on the integrity
of the PROJ.4 system, in honour of Gerald.
So in honour, and hopefully also in the spirit, of Gerald Ian Evenden
(1935--2016), this is the Geospatial Integrity Investigation Environment.
************************************************************************
Thomas Knudsen, thokn@sdfe.dk, 2017-10-01/2017-10-08
************************************************************************
* Copyright (c) 2017 Thomas Knudsen
* Copyright (c) 2017, SDFE
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
***********************************************************************/
#include <ctype.h>
#include <errno.h>
#include <math.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "proj.h"
#include "proj_internal.h"
#include "proj_strtod.h"
#include <cmath> /* for isnan */
#include <math.h>
#include "optargpm.h"
/* Package for flexible format I/O - ffio */
typedef struct ffio {
FILE *f;
const char *const *tags;
const char *tag;
char *args;
char *next_args;
size_t n_tags;
size_t args_size;
size_t next_args_size;
size_t argc;
size_t lineno, next_lineno;
size_t level;
bool strict_mode;
} ffio;
static int get_inp(ffio *G);
static int skip_to_next_tag(ffio *G);
static int step_into_gie_block(ffio *G);
static int nextline(ffio *G);
static int at_end_delimiter(ffio *G);
static const char *at_tag(ffio *G);
static int at_decorative_element(ffio *G);
static ffio *ffio_destroy(ffio *G);
static ffio *ffio_create(const char *const *tags, size_t n_tags,
size_t max_record_size);
static const char *const gie_tags[] = {
"<gie>",
"operation",
"crs_src",
"crs_dst",
"use_proj4_init_rules",
"accept",
"expect",
"roundtrip",
"banner",
"verbose",
"direction",
"tolerance",
"ignore",
"require_grid",
"echo",
"skip",
"</gie>",
"<gie-strict>",
"</gie-strict>",
};
static const size_t n_gie_tags = sizeof gie_tags / sizeof gie_tags[0];
int main(int argc, char **argv);
static int dispatch(const char *cmnd, const char *args);
static int errmsg(int errlev, const char *msg, ...);
static int errno_from_err_const(const char *err_const);
static int list_err_codes(void);
static int process_file(const char *fname);
static const char *column(const char *buf, int n);
static const char *err_const_from_errno(int err);
#define SKIP -1
#define MAX_OPERATION 10000
typedef struct {
char operation[MAX_OPERATION + 1];
char crs_dst[MAX_OPERATION + 1];
char crs_src[MAX_OPERATION + 1];
PJ *P;
PJ_COORD a, b, e;
PJ_DIRECTION dir;
int verbosity;
int skip;
int op_id;
int op_ok, op_ko, op_skip;
int total_ok, total_ko, total_skip;
int grand_ok, grand_ko, grand_skip;
size_t operation_lineno;
size_t dimensions_given, dimensions_given_at_last_accept;
double tolerance;
int use_proj4_init_rules;
int ignore;
int skip_test;
const char *curr_file;
FILE *fout;
} gie_ctx;
ffio *F = nullptr;
static gie_ctx T;
int tests = 0, succs = 0, succ_fails = 0, fail_fails = 0, succ_rtps = 0,
fail_rtps = 0;
static const char delim[] = {"-------------------------------------------------"
"------------------------------\n"};
static const char usage[] = {
"--------------------------------------------------------------------------"
"------\n"
"Usage: %s [-options]... infile...\n"
"--------------------------------------------------------------------------"
"------\n"
"Options:\n"
"--------------------------------------------------------------------------"
"------\n"
" -h Help: print this usage information\n"
" -o /path/to/file Specify output file name\n"
" -v Verbose: Provide non-essential informational "
"output.\n"
" Repeat -v for more verbosity (e.g. -vv)\n"
" -q Quiet: Opposite of verbose. In quiet mode not even "
"errors\n"
" are reported. Only interaction is through the "
"return code\n"
" (0 on success, non-zero indicates number of FAILED "
"tests)\n"
" -l List the PROJ internal system error codes\n"
"--------------------------------------------------------------------------"
"------\n"
"Long Options:\n"
"--------------------------------------------------------------------------"
"------\n"
" --output Alias for -o\n"
" --verbose Alias for -v\n"
" --help Alias for -h\n"
" --list Alias for -l\n"
" --version Print version number\n"
"--------------------------------------------------------------------------"
"------\n"
"Examples:\n"
"--------------------------------------------------------------------------"
"------\n"
"1. Run all tests in file \"corner-cases.gie\", providing much extra "
"information\n"
" gie -vvvv corner-cases.gie\n"
"2. Run all tests in files \"foo\" and \"bar\", providing info on failures "
"only\n"
" gie foo bar\n"
"--------------------------------------------------------------------------"
"------\n"};
int main(int argc, char **argv) {
int i;
const char *longflags[] = {"v=verbose", "q=quiet", "h=help",
"l=list", "version", nullptr};
const char *longkeys[] = {"o=output", nullptr};
OPTARGS *o;
memset(&T, 0, sizeof(T));
T.dir = PJ_FWD;
T.verbosity = 1;
T.tolerance = 5e-4;
T.ignore = 5555; /* Error code that will not be issued by proj_create() */
T.use_proj4_init_rules = FALSE;
/* coverity[tainted_data] */
o = opt_parse(argc, argv, "hlvq", "o", longflags, longkeys);
if (nullptr == o)
return 0;
if (opt_given(o, "h") || argc == 1) {
printf(usage, o->progname);
free(o);
return 0;
}
if (opt_given(o, "version")) {
fprintf(stdout, "%s: %s\n", o->progname, pj_get_release());
free(o);
return 0;
}
T.verbosity = opt_given(o, "q");
if (T.verbosity)
T.verbosity = -1;
if (T.verbosity != -1)
T.verbosity = opt_given(o, "v") + 1;
T.fout = stdout;
if (opt_given(o, "o"))
T.fout = fopen(opt_arg(o, "output"), "rt");
if (nullptr == T.fout) {
fprintf(stderr, "%s: Cannot open '%s' for output\n", o->progname,
opt_arg(o, "output"));
free(o);
return 1;
}
if (opt_given(o, "l")) {
free(o);
return list_err_codes();
}
if (0 == o->fargc) {
if (T.verbosity == -1)
return -1;
fprintf(T.fout, "Nothing to do\n");
free(o);
return 0;
}
F = ffio_create(gie_tags, n_gie_tags, 1000);
if (nullptr == F) {
fprintf(stderr, "%s: No memory\n", o->progname);
free(o);
return 1;
}
for (i = 0; i < o->fargc; i++) {
FILE *f = fopen(o->fargv[i], "rt");
if (f == nullptr) {
fprintf(T.fout, "%sCannot open specified input file '%s' - bye!\n",
delim, o->fargv[i]);
return 1;
}
fclose(f);
}
for (i = 0; i < o->fargc; i++)
process_file(o->fargv[i]);
if (T.verbosity > 0) {
if (o->fargc > 1) {
fprintf(
T.fout,
"%sGrand total: %d. Success: %d, Skipped: %d, Failure: %d\n",
delim, T.grand_ok + T.grand_ko + T.grand_skip, T.grand_ok,
T.grand_skip, T.grand_ko);
}
fprintf(T.fout, "%s", delim);
if (T.verbosity > 1) {
fprintf(T.fout,
"Failing roundtrips: %4d, Succeeding roundtrips: %4d\n",
fail_rtps, succ_rtps);
fprintf(T.fout,
"Failing failures: %4d, Succeeding failures: %4d\n",
fail_fails, succ_fails);
fprintf(
T.fout,
"Internal counters: %4.4d(%4.4d)\n",
tests, succs);
fprintf(T.fout, "%s", delim);
}
} else if (T.grand_ko)
fprintf(T.fout, "Failures: %d", T.grand_ko);
if (stdout != T.fout)
fclose(T.fout);
free(o);
ffio_destroy(F);
return T.grand_ko;
}
static int another_failure(void) {
T.op_ko++;
T.total_ko++;
proj_errno_reset(T.P);
return 0;
}
static int another_skip(void) {
T.op_skip++;
T.total_skip++;
return 0;
}
static int another_success(void) {
T.op_ok++;
T.total_ok++;
proj_errno_reset(T.P);
return 0;
}
static int another_succeeding_failure(void) {
succ_fails++;
return another_success();
}
static int another_failing_failure(void) {
fail_fails++;
return another_failure();
}
static int another_succeeding_roundtrip(void) {
succ_rtps++;
return another_success();
}
static int another_failing_roundtrip(void) {
fail_rtps++;
return another_failure();
}
static int process_file(const char *fname) {
F->lineno = F->next_lineno = F->level = 0;
T.op_ok = T.total_ok = 0;
T.op_ko = T.total_ko = 0;
T.op_skip = T.total_skip = 0;
if (T.skip) {
proj_destroy(T.P);
T.P = nullptr;
return 0;
}
/* We have already tested in main that the file exists */
F->f = fopen(fname, "rt");
if (T.verbosity > 0)
fprintf(T.fout, "%sReading file '%s'\n", delim, fname);
T.curr_file = fname;
while (get_inp(F)) {
if (SKIP == dispatch(F->tag, F->args)) {
proj_destroy(T.P);
T.P = nullptr;
return 0;
}
}
fclose(F->f);
F->lineno = F->next_lineno = 0;
T.grand_ok += T.total_ok;
T.grand_ko += T.total_ko;
T.grand_skip += T.grand_skip;
if (T.verbosity > 0) {
fprintf(
T.fout,
"%stotal: %2d tests succeeded, %2d tests skipped, %2d tests %s\n",
delim, T.total_ok, T.total_skip, T.total_ko,
T.total_ko ? "FAILED!" : "failed.");
}
if (F->level == 0)
return errmsg(-3, "File '%s':Missing '<gie>' cmnd - bye!\n", fname);
if (F->level % 2) {
if (F->strict_mode)
return errmsg(-4, "File '%s':Missing '</gie-strict>' cmnd - bye!\n",
fname);
else
return errmsg(-4, "File '%s':Missing '</gie>' cmnd - bye!\n",
fname);
}
return 0;
}
/*****************************************************************************/
const char *column(const char *buf, int n) {
/*****************************************************************************
Return a pointer to the n'th column of buf. Column numbers start at 0.
******************************************************************************/
int i;
if (n <= 0)
return buf;
for (i = 0; i < n; i++) {
while (isspace(*buf))
buf++;
if (i == n - 1)
break;
while ((0 != *buf) && !isspace(*buf))
buf++;
}
return buf;
}
/*****************************************************************************/
static double strtod_scaled(const char *args, double default_scale) {
/*****************************************************************************
Interpret <args> as a numeric followed by a linear decadal prefix.
Return the properly scaled numeric
******************************************************************************/
const double GRS80_DEG = 111319.4908; /* deg-to-m at equator of GRS80 */
char *endp;
double s = proj_strtod(args, &endp);
if (args == endp)
return HUGE_VAL;
const char *units = column(args, 2);
if (0 == strcmp(units, "km"))
s *= 1000;
else if (0 == strcmp(units, "m"))
s *= 1;
else if (0 == strcmp(units, "dm"))
s /= 10;
else if (0 == strcmp(units, "cm"))
s /= 100;
else if (0 == strcmp(units, "mm"))
s /= 1000;
else if (0 == strcmp(units, "um"))
s /= 1e6;
else if (0 == strcmp(units, "nm"))
s /= 1e9;
else if (0 == strcmp(units, "rad"))
s = GRS80_DEG * proj_todeg(s);
else if (0 == strcmp(units, "deg"))
s = GRS80_DEG * s;
else
s *= default_scale;
return s;
}
static int banner(const char *args) {
char dots[] = {"..."}, nodots[] = {""}, *thedots = nodots;
if (strlen(args) > 70)
thedots = dots;
fprintf(T.fout, "%s%-70.70s%s\n", delim, args, thedots);
return 0;
}
static int tolerance(const char *args) {
T.tolerance = strtod_scaled(args, 1);
if (HUGE_VAL == T.tolerance) {
T.tolerance = 0.0005;
return 1;
}
return 0;
}
static int use_proj4_init_rules(const char *args) {
T.use_proj4_init_rules = strcmp(args, "true") == 0;
return 0;
}
static int ignore(const char *args) {
T.ignore = errno_from_err_const(column(args, 1));
return 0;
}
static int require_grid(const char *args) {
PJ_GRID_INFO grid_info;
const char *grid_filename = column(args, 1);
grid_info = proj_grid_info(grid_filename);
if (strlen(grid_info.filename) == 0) {
if (T.verbosity > 1) {
fprintf(T.fout, "Test skipped because of missing grid %s\n",
grid_filename);
}
T.skip_test = 1;
}
return 0;
}
static int direction(const char *args) {
const char *endp = args;
while (isspace(*endp))
endp++;
switch (*endp) {
case 'F':
case 'f':
T.dir = PJ_FWD;
break;
case 'I':
case 'i':
case 'R':
case 'r':
T.dir = PJ_INV;
break;
default:
return 1;
}
return 0;
}
static void finish_previous_operation(const char *args) {
if (T.verbosity > 1 && T.op_id > 1 && T.op_ok + T.op_ko)
fprintf(T.fout,
"%s %d tests succeeded, %d tests skipped, %d tests %s\n",
delim, T.op_ok, T.op_skip, T.op_ko,
T.op_ko ? "FAILED!" : "failed.");
(void)args;
}
/*****************************************************************************/
static int operation(const char *args) {
/*****************************************************************************
Define the operation to apply to the input data (in ISO 19100 lingo,
an operation is the general term describing something that can be
either a conversion or a transformation)
******************************************************************************/
T.op_id++;
T.operation_lineno = F->lineno;
strncpy(&(T.operation[0]), F->args, MAX_OPERATION);
T.operation[MAX_OPERATION] = '\0';
if (T.verbosity > 1) {
finish_previous_operation(F->args);
banner(args);
}
T.op_ok = 0;
T.op_ko = 0;
T.op_skip = 0;
T.skip_test = 0;
direction("forward");
tolerance("0.5 mm");
ignore("pjd_err_dont_skip");
proj_errno_reset(T.P);
if (T.P)
proj_destroy(T.P);
proj_errno_reset(nullptr);
proj_context_use_proj4_init_rules(nullptr, T.use_proj4_init_rules);
T.P = proj_create(nullptr, F->args);
/* Checking that proj_create succeeds is first done at "expect" time, */
/* since we want to support "expect"ing specific error codes */
return 0;
}
static int crs_to_crs_operation() {
T.op_id++;
T.operation_lineno = F->lineno;
if (T.verbosity > 1) {
char buffer[80];
finish_previous_operation(F->args);
snprintf(buffer, 80, "%-36.36s -> %-36.36s", T.crs_src, T.crs_dst);
banner(buffer);
}
T.op_ok = 0;
T.op_ko = 0;
T.op_skip = 0;
T.skip_test = 0;
direction("forward");
tolerance("0.5 mm");
ignore("pjd_err_dont_skip");
proj_errno_reset(T.P);
if (T.P)
proj_destroy(T.P);
proj_errno_reset(nullptr);
proj_context_use_proj4_init_rules(nullptr, T.use_proj4_init_rules);
T.P = proj_create_crs_to_crs(nullptr, T.crs_src, T.crs_dst, nullptr);
strcpy(T.crs_src, "");
strcpy(T.crs_dst, "");
return 0;
}
static int crs_src(const char *args) {
strncpy(&(T.crs_src[0]), F->args, MAX_OPERATION);
T.crs_src[MAX_OPERATION] = '\0';
(void)args;
if (strcmp(T.crs_src, "") != 0 && strcmp(T.crs_dst, "") != 0) {
crs_to_crs_operation();
}
return 0;
}
static int crs_dst(const char *args) {
strncpy(&(T.crs_dst[0]), F->args, MAX_OPERATION);
T.crs_dst[MAX_OPERATION] = '\0';
(void)args;
if (strcmp(T.crs_src, "") != 0 && strcmp(T.crs_dst, "") != 0) {
crs_to_crs_operation();
}
return 0;
}
static PJ_COORD torad_coord(PJ *P, PJ_DIRECTION dir, PJ_COORD a) {
size_t i, n;
const char *axis = "enut";
paralist *l = pj_param_exists(P->params, "axis");
if (l && dir == PJ_INV)
axis = l->param + strlen("axis=");
n = strlen(axis);
for (i = 0; i < n; i++)
if (strchr("news", axis[i]))
a.v[i] = proj_torad(a.v[i]);
return a;
}
static PJ_COORD todeg_coord(PJ *P, PJ_DIRECTION dir, PJ_COORD a) {
size_t i, n;
const char *axis = "enut";
paralist *l = pj_param_exists(P->params, "axis");
if (l && dir == PJ_FWD)
axis = l->param + strlen("axis=");
n = strlen(axis);
for (i = 0; i < n; i++)
if (strchr("news", axis[i]))
a.v[i] = proj_todeg(a.v[i]);
return a;
}
/*****************************************************************************/
static PJ_COORD parse_coord(const char *args) {
/*****************************************************************************
Attempt to interpret args as a PJ_COORD.
******************************************************************************/
int i;
char *endp;
char *dmsendp;
const char *prev = args;
PJ_COORD a = proj_coord(0, 0, 0, 0);
T.dimensions_given = 0;
for (i = 0; i < 4; i++) {
/* proj_strtod doesn't read values like 123d45'678W so we need a bit */
/* of help from proj_dmstor. proj_strtod effectively ignores what */
/* comes after "d", so we use that fact that when dms is larger than */
/* d the value was stated in "dms" form. */
/* This could be avoided if proj_dmstor used the same proj_strtod() */
/* as gie, but that is not the case (yet). When we remove projects.h */
/* from the public API we can change that. */
// Even Rouault: unsure about the above. Coordinates are not necessarily
// geographic coordinates, and the roundtrip through radians for
// big projected coordinates cause inaccuracies, that can cause
// test failures when testing points at edge of grids.
// For example 1501000.0 becomes 1501000.000000000233
double d;
while (*prev && isspace(*prev))
++prev;
if (strncmp(prev, "HUGE_VAL", strlen("HUGE_VAL")) == 0) {
d = HUGE_VAL;
endp = const_cast<char *>(prev) + strlen("HUGE_VAL");
} else {
d = proj_strtod(prev, &endp);
}
if (!std::isnan(d) && *endp != '\0' && !isspace(*endp)) {
double dms = PJ_TODEG(proj_dmstor(prev, &dmsendp));
/* TODO: When projects.h is removed, call proj_dmstor() in all cases
*/
if (d != dms && fabs(d) < fabs(dms) && fabs(dms) < fabs(d) + 1) {
d = dms;
endp = dmsendp;
}
/* A number like -81d00'00.000 will be parsed correctly by both */
/* proj_strtod and proj_dmstor but only the latter will return */
/* the correct end-pointer. */
if (d == dms && endp != dmsendp)
endp = dmsendp;
}
/* Break out if there were no more numerals */
if (prev == endp)
return i > 1 ? a : proj_coord_error();
a.v[i] = d;
prev = endp;
T.dimensions_given++;
}
return a;
}
/*****************************************************************************/
static int accept(const char *args) {
/*****************************************************************************
Read ("ACCEPT") a 2, 3, or 4 dimensional input coordinate.
******************************************************************************/
T.a = parse_coord(args);
if (T.verbosity > 3)
fprintf(T.fout, "# %s\n", args);
T.dimensions_given_at_last_accept = T.dimensions_given;
return 0;
}
/*****************************************************************************/
static int roundtrip(const char *args) {
/*****************************************************************************
Check how far we go from the ACCEPTed point when doing successive
back/forward transformation pairs.
Without args, roundtrip defaults to 100 iterations:
roundtrip
With one arg, roundtrip will default to a tolerance of T.tolerance:
roundtrip ntrips
With two args:
roundtrip ntrips tolerance
Always returns 0.
******************************************************************************/
int ntrips;
double d, r, ans;
char *endp;
PJ_COORD coo;
if (nullptr == T.P) {
if (T.ignore == proj_errno(T.P))
return another_skip();
return another_failure();
}
ans = proj_strtod(args, &endp);
if (endp == args) {
/* Default to 100 iterations if not args. */
ntrips = 100;
} else {
if (ans < 1.0 || ans > 1000000.0) {
errmsg(2, "Invalid number of roundtrips: %lf\n", ans);
return another_failing_roundtrip();
}
ntrips = (int)ans;
}
d = strtod_scaled(endp, 1);
d = d == HUGE_VAL ? T.tolerance : d;
/* input ("accepted") values - probably in degrees */
coo = proj_angular_input(T.P, T.dir) ? torad_coord(T.P, T.dir, T.a) : T.a;
r = proj_roundtrip(T.P, T.dir, ntrips, &coo);
if ((std::isnan(r) && std::isnan(d)) || r <= d)
return another_succeeding_roundtrip();
if (T.verbosity > -1) {
if (0 == T.op_ko && T.verbosity < 2)
banner(T.operation);
fprintf(T.fout, "%s", T.op_ko ? " -----\n" : delim);
fprintf(T.fout, " FAILURE in %s(%d):\n",
opt_strip_path(T.curr_file), (int)F->lineno);
fprintf(T.fout,
" roundtrip deviation: %.6f mm, expected: %.6f mm\n",
1000 * r, 1000 * d);
}
return another_failing_roundtrip();
}
static int expect_message(double d, const char *args) {
another_failure();
if (T.verbosity < 0)
return 1;
if (d > 1e6)
d = 999999.999999;
if (0 == T.op_ko && T.verbosity < 2)
banner(T.operation);
fprintf(T.fout, "%s", T.op_ko ? " -----\n" : delim);
fprintf(T.fout, " FAILURE in %s(%d):\n", opt_strip_path(T.curr_file),
(int)F->lineno);
fprintf(T.fout, " expected: %s\n", args);
fprintf(T.fout, " got: %.12f %.12f", T.b.xy.x, T.b.xy.y);
if (T.b.xyzt.t != 0 || T.b.xyzt.z != 0)
fprintf(T.fout, " %.9f", T.b.xyz.z);
if (T.b.xyzt.t != 0)
fprintf(T.fout, " %.9f", T.b.xyzt.t);
fprintf(T.fout, "\n");
fprintf(T.fout, " deviation: %.6f mm, expected: %.6f mm\n", 1000 * d,
1000 * T.tolerance);
return 1;
}
static int expect_message_cannot_parse(const char *args) {
another_failure();
if (T.verbosity > -1) {
if (0 == T.op_ko && T.verbosity < 2)
banner(T.operation);
fprintf(T.fout, "%s", T.op_ko ? " -----\n" : delim);
fprintf(T.fout, " FAILURE in %s(%d):\n Too few args: %s\n",
opt_strip_path(T.curr_file), (int)F->lineno, args);
}
return 1;
}
static int expect_failure_with_errno_message(int expected, int got) {
another_failing_failure();
if (T.verbosity < 0)
return 1;
if (0 == T.op_ko && T.verbosity < 2)
banner(T.operation);
fprintf(T.fout, "%s", T.op_ko ? " -----\n" : delim);
fprintf(T.fout, " FAILURE in %s(%d):\n", opt_strip_path(T.curr_file),
(int)F->lineno);
fprintf(T.fout, " got errno %s (%d): %s\n", err_const_from_errno(got),
got, proj_errno_string(got));
fprintf(T.fout, " expected %s (%d): %s",
err_const_from_errno(expected), expected,
proj_errno_string(expected));
fprintf(T.fout, "\n");
return 1;
}
/* For test purposes, we want to call a transformation of the same */
/* dimensionality as the number of dimensions given in accept */
static PJ_COORD expect_trans_n_dim(const PJ_COORD &ci) {
if (4 == T.dimensions_given_at_last_accept)
return proj_trans(T.P, T.dir, ci);
if (3 == T.dimensions_given_at_last_accept)
return pj_approx_3D_trans(T.P, T.dir, ci);
return pj_approx_2D_trans(T.P, T.dir, ci);
}
/*****************************************************************************/
static int expect(const char *args) {
/*****************************************************************************
Tell GIE what to expect, when transforming the ACCEPTed input
******************************************************************************/
PJ_COORD ci, co, ce;
double d;
int expect_failure = 0;
int expect_failure_with_errno = 0;
if (0 == strncmp(args, "failure", 7)) {
expect_failure = 1;
/* Option: Fail with an expected errno (syntax: expect failure errno
* -33) */
if (0 == strncmp(column(args, 2), "errno", 5))
expect_failure_with_errno = errno_from_err_const(column(args, 3));
}
if (T.ignore == proj_errno(T.P))
return another_skip();
if (nullptr == T.P) {
/* If we expect failure, and fail, then it's a success... */
if (expect_failure) {
/* Failed to fail correctly? */
if (expect_failure_with_errno &&
proj_errno(T.P) != expect_failure_with_errno)
return expect_failure_with_errno_message(
expect_failure_with_errno, proj_errno(T.P));
return another_succeeding_failure();
}
/* Otherwise, it's a true failure */
banner(T.operation);
errmsg(3,
"%sInvalid operation definition in line no. %d:\n %s "
"(errno=%s/%d)\n",
delim, (int)T.operation_lineno,
proj_errno_string(proj_errno(T.P)),
err_const_from_errno(proj_errno(T.P)), proj_errno(T.P));
return another_failing_failure();
}
/* We may still successfully fail even if the proj_create succeeded */
if (expect_failure) {
proj_errno_reset(T.P);
/* Try to carry out the operation - and expect failure */
ci =
proj_angular_input(T.P, T.dir) ? torad_coord(T.P, T.dir, T.a) : T.a;
co = expect_trans_n_dim(ci);
if (expect_failure_with_errno) {
if (proj_errno(T.P) == expect_failure_with_errno)
return another_succeeding_failure();
// fprintf (T.fout, "errno=%d, expected=%d\n", proj_errno (T.P),
// expect_failure_with_errno);
banner(T.operation);
errmsg(3, "%serrno=%s (%d), expected=%d at line %d\n", delim,
err_const_from_errno(proj_errno(T.P)), proj_errno(T.P),