forked from healpy/cfitsio
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patheval_y.c
8344 lines (7445 loc) · 281 KB
/
eval_y.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
/* A Bison parser, made by GNU Bison 3.7.4. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 Free Software Foundation,
Inc.
This program 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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
especially those whose name start with FF_ or ff_. They are
private implementation details that can be changed or removed. */
/* All symbols defined below should begin with ff or FF, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output, and Bison version. */
#define FFBISON 30704
/* Bison version string. */
#define FFBISON_VERSION "3.7.4"
/* Skeleton name. */
#define FFSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define FFPURE 0
/* Push parsers. */
#define FFPUSH 0
/* Pull parsers. */
#define FFPULL 1
/* First part of user prologue. */
#line 1 "eval.y"
/************************************************************************/
/* */
/* CFITSIO Lexical Parser */
/* */
/* This file is one of 3 files containing code which parses an */
/* arithmetic expression and evaluates it in the context of an input */
/* FITS file table extension. The CFITSIO lexical parser is divided */
/* into the following 3 parts/files: the CFITSIO "front-end", */
/* eval_f.c, contains the interface between the user/CFITSIO and the */
/* real core of the parser; the FLEX interpreter, eval_l.c, takes the */
/* input string and parses it into tokens and identifies the FITS */
/* information required to evaluate the expression (ie, keywords and */
/* columns); and, the BISON grammar and evaluation routines, eval_y.c, */
/* receives the FLEX output and determines and performs the actual */
/* operations. The files eval_l.c and eval_y.c are produced from */
/* running flex and bison on the files eval.l and eval.y, respectively. */
/* (flex and bison are available from any GNU archive: see www.gnu.org) */
/* */
/* The grammar rules, rather than evaluating the expression in situ, */
/* builds a tree, or Nodal, structure mapping out the order of */
/* operations and expression dependencies. This "compilation" process */
/* allows for much faster processing of multiple rows. This technique */
/* was developed by Uwe Lammers of the XMM Science Analysis System, */
/* although the CFITSIO implementation is entirely code original. */
/* */
/* */
/* Modification History: */
/* */
/* Kent Blackburn c1992 Original parser code developed for the */
/* FTOOLS software package, in particular, */
/* the fselect task. */
/* Kent Blackburn c1995 BIT column support added */
/* Peter D Wilson Feb 1998 Vector column support added */
/* Peter D Wilson May 1998 Ported to CFITSIO library. User */
/* interface routines written, in essence */
/* making fselect, fcalc, and maketime */
/* capabilities available to all tools */
/* via single function calls. */
/* Peter D Wilson Jun 1998 Major rewrite of parser core, so as to */
/* create a run-time evaluation tree, */
/* inspired by the work of Uwe Lammers, */
/* resulting in a speed increase of */
/* 10-100 times. */
/* Peter D Wilson Jul 1998 gtifilter(a,b,c,d) function added */
/* Peter D Wilson Aug 1998 regfilter(a,b,c,d) function added */
/* Peter D Wilson Jul 1999 Make parser fitsfile-independent, */
/* allowing a purely vector-based usage */
/* Craig B Markwardt Jun 2004 Add MEDIAN() function */
/* Craig B Markwardt Jun 2004 Add SUM(), and MIN/MAX() for bit arrays */
/* Craig B Markwardt Jun 2004 Allow subscripting of nX bit arrays */
/* Craig B Markwardt Jun 2004 Implement statistical functions */
/* NVALID(), AVERAGE(), and STDDEV() */
/* for integer and floating point vectors */
/* Craig B Markwardt Jun 2004 Use NULL values for range errors instead*/
/* of throwing a parse error */
/* Craig B Markwardt Oct 2004 Add ACCUM() and SEQDIFF() functions */
/* Craig B Markwardt Feb 2005 Add ANGSEP() function */
/* Craig B Markwardt Aug 2005 CIRCLE, BOX, ELLIPSE, NEAR and REGFILTER*/
/* functions now accept vector arguments */
/* Craig B Markwardt Sum 2006 Add RANDOMN() and RANDOMP() functions */
/* Craig B Markwardt Mar 2007 Allow arguments to RANDOM and RANDOMN to*/
/* determine the output dimensions */
/* Craig B Markwardt Aug 2009 Add substring STRMID() and string search*/
/* STRSTR() functions; more overflow checks*/
/* Craig B Markwardt Dec 2019 Add bit/hex/oct literal strings and */
/* bitwise operatiosn between integers */
/* Craig B Markwardt Mar 2021 Add SETNULL() function */
/* */
/************************************************************************/
#define APPROX 1.0e-7
#include "eval_defs.h"
#include "region.h"
#include <time.h>
#include <stdlib.h>
#ifndef alloca
#define alloca malloc
#endif
/* Random number generators for various distributions */
#include "simplerng.h"
/* Shrink the initial stack depth to keep local data <32K (mac limit) */
/* yacc will allocate more space if needed, though. */
#define FFINITDEPTH 100
/***************************************************************/
/* Replace Bison's BACKUP macro with one that fixes a bug -- */
/* must update state after popping the stack -- and allows */
/* popping multiple terms at one time. */
/***************************************************************/
#define FFNEWBACKUP(token, value) \
do \
if (ffchar == FFEMPTY ) \
{ ffchar = (token); \
memcpy( &fflval, &(value), sizeof(value) ); \
ffchar1 = FFTRANSLATE (ffchar); \
while (fflen--) FFPOPSTACK; \
ffstate = *ffssp; \
goto ffbackup; \
} \
else \
{ fferror ("syntax error: cannot back up"); FFERROR; } \
while (0)
/***************************************************************/
/* Useful macros for accessing/testing Nodes */
/***************************************************************/
#define TEST(a) if( (a)<0 ) FFERROR
#define SIZE(a) gParse.Nodes[ a ].value.nelem
#define TYPE(a) gParse.Nodes[ a ].type
#define OPER(a) gParse.Nodes[ a ].operation
#define PROMOTE(a,b) if( TYPE(a) > TYPE(b) ) \
b = New_Unary( TYPE(a), 0, b ); \
else if( TYPE(a) < TYPE(b) ) \
a = New_Unary( TYPE(b), 0, a );
/***** Internal functions *****/
#ifdef __cplusplus
extern "C" {
#endif
static int Alloc_Node ( void );
static void Free_Last_Node( void );
static void Evaluate_Node ( int thisNode );
static int New_Const ( int returnType, void *value, long len );
static int New_Column( int ColNum );
static int New_Offset( int ColNum, int offset );
static int New_Unary ( int returnType, int Op, int Node1 );
static int New_BinOp ( int returnType, int Node1, int Op, int Node2 );
static int New_Func ( int returnType, funcOp Op, int nNodes,
int Node1, int Node2, int Node3, int Node4,
int Node5, int Node6, int Node7 );
static int New_FuncSize( int returnType, funcOp Op, int nNodes,
int Node1, int Node2, int Node3, int Node4,
int Node5, int Node6, int Node7, int Size);
static int New_Deref ( int Var, int nDim,
int Dim1, int Dim2, int Dim3, int Dim4, int Dim5 );
static int New_GTI ( funcOp Op, char *fname, int Node1, int Node2, char *start, char *stop );
static int New_REG ( char *fname, int NodeX, int NodeY, char *colNames );
static int New_Vector( int subNode );
static int Close_Vec ( int vecNode );
static int Locate_Col( Node *this );
static int Test_Dims ( int Node1, int Node2 );
static void Copy_Dims ( int Node1, int Node2 );
static void Allocate_Ptrs( Node *this );
static void Do_Unary ( Node *this );
static void Do_Offset ( Node *this );
static void Do_BinOp_bit ( Node *this );
static void Do_BinOp_str ( Node *this );
static void Do_BinOp_log ( Node *this );
static void Do_BinOp_lng ( Node *this );
static void Do_BinOp_dbl ( Node *this );
static void Do_Func ( Node *this );
static void Do_Deref ( Node *this );
static void Do_GTI ( Node *this );
static void Do_GTI_Over ( Node *this );
static void Do_REG ( Node *this );
static void Do_Vector ( Node *this );
static long Search_GTI ( double evtTime, long nGTI, double *start,
double *stop, int ordered, long *nextGTI );
static double GTI_Over(double evtStart, double evtStop,
long nGTI, double *start, double *stop,
long *gtiout);
static char saobox (double xcen, double ycen, double xwid, double ywid,
double rot, double xcol, double ycol);
static char ellipse(double xcen, double ycen, double xrad, double yrad,
double rot, double xcol, double ycol);
static char circle (double xcen, double ycen, double rad,
double xcol, double ycol);
static char bnear (double x, double y, double tolerance);
static char bitcmp (char *bitstrm1, char *bitstrm2);
static char bitlgte(char *bits1, int oper, char *bits2);
static void bitand(char *result, char *bitstrm1, char *bitstrm2);
static void bitor (char *result, char *bitstrm1, char *bitstrm2);
static void bitnot(char *result, char *bits);
static int cstrmid(char *dest_str, int dest_len,
char *src_str, int src_len, int pos);
static void fferror(char *msg);
#ifdef __cplusplus
}
#endif
#line 269 "y.tab.c"
# ifndef FF_CAST
# ifdef __cplusplus
# define FF_CAST(Type, Val) static_cast<Type> (Val)
# define FF_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
# else
# define FF_CAST(Type, Val) ((Type) (Val))
# define FF_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef FF_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define FF_NULLPTR nullptr
# else
# define FF_NULLPTR 0
# endif
# else
# define FF_NULLPTR ((void*)0)
# endif
# endif
/* Use api.header.include to #include this header
instead of duplicating it here. */
#ifndef FF_FF_Y_TAB_H_INCLUDED
# define FF_FF_Y_TAB_H_INCLUDED
/* Debug traces. */
#ifndef FFDEBUG
# define FFDEBUG 0
#endif
#if FFDEBUG
extern int ffdebug;
#endif
/* Token kinds. */
#ifndef FFTOKENTYPE
# define FFTOKENTYPE
enum fftokentype
{
FFEMPTY = -2,
FFEOF = 0, /* "end of file" */
FFerror = 256, /* error */
FFUNDEF = 257, /* "invalid token" */
BOOLEAN = 258, /* BOOLEAN */
LONG = 259, /* LONG */
DOUBLE = 260, /* DOUBLE */
STRING = 261, /* STRING */
BITSTR = 262, /* BITSTR */
FUNCTION = 263, /* FUNCTION */
BFUNCTION = 264, /* BFUNCTION */
IFUNCTION = 265, /* IFUNCTION */
GTIFILTER = 266, /* GTIFILTER */
GTIOVERLAP = 267, /* GTIOVERLAP */
REGFILTER = 268, /* REGFILTER */
COLUMN = 269, /* COLUMN */
BCOLUMN = 270, /* BCOLUMN */
SCOLUMN = 271, /* SCOLUMN */
BITCOL = 272, /* BITCOL */
ROWREF = 273, /* ROWREF */
NULLREF = 274, /* NULLREF */
SNULLREF = 275, /* SNULLREF */
OR = 276, /* OR */
AND = 277, /* AND */
EQ = 278, /* EQ */
NE = 279, /* NE */
GT = 280, /* GT */
LT = 281, /* LT */
LTE = 282, /* LTE */
GTE = 283, /* GTE */
XOR = 284, /* XOR */
POWER = 285, /* POWER */
NOT = 286, /* NOT */
INTCAST = 287, /* INTCAST */
FLTCAST = 288, /* FLTCAST */
UMINUS = 289, /* UMINUS */
ACCUM = 290, /* ACCUM */
DIFF = 291 /* DIFF */
};
typedef enum fftokentype fftoken_kind_t;
#endif
/* Token kinds. */
#define FFEMPTY -2
#define FFEOF 0
#define FFerror 256
#define FFUNDEF 257
#define BOOLEAN 258
#define LONG 259
#define DOUBLE 260
#define STRING 261
#define BITSTR 262
#define FUNCTION 263
#define BFUNCTION 264
#define IFUNCTION 265
#define GTIFILTER 266
#define GTIOVERLAP 267
#define REGFILTER 268
#define COLUMN 269
#define BCOLUMN 270
#define SCOLUMN 271
#define BITCOL 272
#define ROWREF 273
#define NULLREF 274
#define SNULLREF 275
#define OR 276
#define AND 277
#define EQ 278
#define NE 279
#define GT 280
#define LT 281
#define LTE 282
#define GTE 283
#define XOR 284
#define POWER 285
#define NOT 286
#define INTCAST 287
#define FLTCAST 288
#define UMINUS 289
#define ACCUM 290
#define DIFF 291
/* Value type. */
#if ! defined FFSTYPE && ! defined FFSTYPE_IS_DECLARED
union FFSTYPE
{
#line 199 "eval.y"
int Node; /* Index of Node */
double dbl; /* real value */
long lng; /* integer value */
char log; /* logical value */
char str[MAX_STRLEN]; /* string value */
#line 402 "y.tab.c"
};
typedef union FFSTYPE FFSTYPE;
# define FFSTYPE_IS_TRIVIAL 1
# define FFSTYPE_IS_DECLARED 1
#endif
extern FFSTYPE fflval;
int ffparse (void);
#endif /* !FF_FF_Y_TAB_H_INCLUDED */
/* Symbol kind. */
enum ffsymbol_kind_t
{
FFSYMBOL_FFEMPTY = -2,
FFSYMBOL_FFEOF = 0, /* "end of file" */
FFSYMBOL_FFerror = 1, /* error */
FFSYMBOL_FFUNDEF = 2, /* "invalid token" */
FFSYMBOL_BOOLEAN = 3, /* BOOLEAN */
FFSYMBOL_LONG = 4, /* LONG */
FFSYMBOL_DOUBLE = 5, /* DOUBLE */
FFSYMBOL_STRING = 6, /* STRING */
FFSYMBOL_BITSTR = 7, /* BITSTR */
FFSYMBOL_FUNCTION = 8, /* FUNCTION */
FFSYMBOL_BFUNCTION = 9, /* BFUNCTION */
FFSYMBOL_IFUNCTION = 10, /* IFUNCTION */
FFSYMBOL_GTIFILTER = 11, /* GTIFILTER */
FFSYMBOL_GTIOVERLAP = 12, /* GTIOVERLAP */
FFSYMBOL_REGFILTER = 13, /* REGFILTER */
FFSYMBOL_COLUMN = 14, /* COLUMN */
FFSYMBOL_BCOLUMN = 15, /* BCOLUMN */
FFSYMBOL_SCOLUMN = 16, /* SCOLUMN */
FFSYMBOL_BITCOL = 17, /* BITCOL */
FFSYMBOL_ROWREF = 18, /* ROWREF */
FFSYMBOL_NULLREF = 19, /* NULLREF */
FFSYMBOL_SNULLREF = 20, /* SNULLREF */
FFSYMBOL_21_ = 21, /* ',' */
FFSYMBOL_22_ = 22, /* '=' */
FFSYMBOL_23_ = 23, /* ':' */
FFSYMBOL_24_ = 24, /* '{' */
FFSYMBOL_25_ = 25, /* '}' */
FFSYMBOL_26_ = 26, /* '?' */
FFSYMBOL_OR = 27, /* OR */
FFSYMBOL_AND = 28, /* AND */
FFSYMBOL_EQ = 29, /* EQ */
FFSYMBOL_NE = 30, /* NE */
FFSYMBOL_31_ = 31, /* '~' */
FFSYMBOL_GT = 32, /* GT */
FFSYMBOL_LT = 33, /* LT */
FFSYMBOL_LTE = 34, /* LTE */
FFSYMBOL_GTE = 35, /* GTE */
FFSYMBOL_36_ = 36, /* '+' */
FFSYMBOL_37_ = 37, /* '-' */
FFSYMBOL_38_ = 38, /* '%' */
FFSYMBOL_39_ = 39, /* '*' */
FFSYMBOL_40_ = 40, /* '/' */
FFSYMBOL_41_ = 41, /* '|' */
FFSYMBOL_42_ = 42, /* '&' */
FFSYMBOL_XOR = 43, /* XOR */
FFSYMBOL_POWER = 44, /* POWER */
FFSYMBOL_NOT = 45, /* NOT */
FFSYMBOL_INTCAST = 46, /* INTCAST */
FFSYMBOL_FLTCAST = 47, /* FLTCAST */
FFSYMBOL_UMINUS = 48, /* UMINUS */
FFSYMBOL_49_ = 49, /* '[' */
FFSYMBOL_ACCUM = 50, /* ACCUM */
FFSYMBOL_DIFF = 51, /* DIFF */
FFSYMBOL_52_n_ = 52, /* '\n' */
FFSYMBOL_53_ = 53, /* ']' */
FFSYMBOL_54_ = 54, /* '(' */
FFSYMBOL_55_ = 55, /* ')' */
FFSYMBOL_FFACCEPT = 56, /* $accept */
FFSYMBOL_lines = 57, /* lines */
FFSYMBOL_line = 58, /* line */
FFSYMBOL_bvector = 59, /* bvector */
FFSYMBOL_vector = 60, /* vector */
FFSYMBOL_expr = 61, /* expr */
FFSYMBOL_bexpr = 62, /* bexpr */
FFSYMBOL_bits = 63, /* bits */
FFSYMBOL_sexpr = 64 /* sexpr */
};
typedef enum ffsymbol_kind_t ffsymbol_kind_t;
#ifdef short
# undef short
#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
<limits.h> and (if available) <stdint.h> are included
so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
# define FF_STDINT_H
# endif
#endif
/* Narrow types that promote to a signed type and that can represent a
signed or unsigned integer of at least N bits. In tables they can
save space and decrease cache pressure. Promoting to a signed type
helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ fftype_int8;
#elif defined FF_STDINT_H
typedef int_least8_t fftype_int8;
#else
typedef signed char fftype_int8;
#endif
#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ fftype_int16;
#elif defined FF_STDINT_H
typedef int_least16_t fftype_int16;
#else
typedef short fftype_int16;
#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ fftype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined FF_STDINT_H \
&& UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t fftype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char fftype_uint8;
#else
typedef short fftype_uint8;
#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ fftype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined FF_STDINT_H \
&& UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t fftype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short fftype_uint16;
#else
typedef int fftype_uint16;
#endif
#ifndef FFPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
# define FFPTRDIFF_T __PTRDIFF_TYPE__
# define FFPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
# ifndef ptrdiff_t
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# endif
# define FFPTRDIFF_T ptrdiff_t
# define FFPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
# define FFPTRDIFF_T long
# define FFPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif
#ifndef FFSIZE_T
# ifdef __SIZE_TYPE__
# define FFSIZE_T __SIZE_TYPE__
# elif defined size_t
# define FFSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define FFSIZE_T size_t
# else
# define FFSIZE_T unsigned
# endif
#endif
#define FFSIZE_MAXIMUM \
FF_CAST (FFPTRDIFF_T, \
(FFPTRDIFF_MAXIMUM < FF_CAST (FFSIZE_T, -1) \
? FFPTRDIFF_MAXIMUM \
: FF_CAST (FFSIZE_T, -1)))
#define FFSIZEOF(X) FF_CAST (FFPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */
typedef fftype_int16 ff_state_t;
/* State numbers in computations. */
typedef int ff_state_fast_t;
#ifndef FF_
# if defined FFENABLE_NLS && FFENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define FF_(Msgid) dgettext ("bison-runtime", Msgid)
# endif
# endif
# ifndef FF_
# define FF_(Msgid) Msgid
# endif
#endif
#ifndef FF_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define FF_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define FF_ATTRIBUTE_PURE
# endif
#endif
#ifndef FF_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define FF_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define FF_ATTRIBUTE_UNUSED
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define FFUSE(E) ((void) (E))
#else
# define FFUSE(E) /* empty */
#endif
#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about fflval being uninitialized. */
# define FF_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define FF_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define FF_INITIAL_VALUE(Value) Value
#endif
#ifndef FF_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define FF_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define FF_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef FF_INITIAL_VALUE
# define FF_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define FF_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define FF_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef FF_IGNORE_USELESS_CAST_BEGIN
# define FF_IGNORE_USELESS_CAST_BEGIN
# define FF_IGNORE_USELESS_CAST_END
#endif
#define FF_ASSERT(E) ((void) (0 && (E)))
#if !defined ffoverflow
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef FFSTACK_USE_ALLOCA
# if FFSTACK_USE_ALLOCA
# ifdef __GNUC__
# define FFSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define FFSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define FFSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef FFSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define FFSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef FFSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define FFSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define FFSTACK_ALLOC FFMALLOC
# define FFSTACK_FREE FFFREE
# ifndef FFSTACK_ALLOC_MAXIMUM
# define FFSTACK_ALLOC_MAXIMUM FFSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined FFMALLOC || defined malloc) \
&& (defined FFFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef FFMALLOC
# define FFMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (FFSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef FFFREE
# define FFFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* !defined ffoverflow */
#if (! defined ffoverflow \
&& (! defined __cplusplus \
|| (defined FFSTYPE_IS_TRIVIAL && FFSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union ffalloc
{
ff_state_t ffss_alloc;
FFSTYPE ffvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define FFSTACK_GAP_MAXIMUM (FFSIZEOF (union ffalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define FFSTACK_BYTES(N) \
((N) * (FFSIZEOF (ff_state_t) + FFSIZEOF (FFSTYPE)) \
+ FFSTACK_GAP_MAXIMUM)
# define FFCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables FFSIZE and FFSTACKSIZE give the old and new number of
elements in the stack, and FFPTR gives the new location of the
stack. Advance FFPTR to a properly aligned location for the next
stack. */
# define FFSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
FFPTRDIFF_T ffnewbytes; \
FFCOPY (&ffptr->Stack_alloc, Stack, ffsize); \
Stack = &ffptr->Stack_alloc; \
ffnewbytes = ffstacksize * FFSIZEOF (*Stack) + FFSTACK_GAP_MAXIMUM; \
ffptr += ffnewbytes / FFSIZEOF (*ffptr); \
} \
while (0)
#endif
#if defined FFCOPY_NEEDED && FFCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef FFCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define FFCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, FF_CAST (FFSIZE_T, (Count)) * sizeof (*(Src)))
# else
# define FFCOPY(Dst, Src, Count) \
do \
{ \
FFPTRDIFF_T ffi; \
for (ffi = 0; ffi < (Count); ffi++) \
(Dst)[ffi] = (Src)[ffi]; \
} \
while (0)
# endif
# endif
#endif /* !FFCOPY_NEEDED */
/* FFFINAL -- State number of the termination state. */
#define FFFINAL 2
/* FFLAST -- Last index in FFTABLE. */
#define FFLAST 1725
/* FFNTOKENS -- Number of terminals. */
#define FFNTOKENS 56
/* FFNNTS -- Number of nonterminals. */
#define FFNNTS 9
/* FFNRULES -- Number of rules. */
#define FFNRULES 130
/* FFNSTATES -- Number of states. */
#define FFNSTATES 308
/* FFMAXUTOK -- Last valid token kind. */
#define FFMAXUTOK 291
/* FFTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by fflex, with out-of-bounds checking. */
#define FFTRANSLATE(FFX) \
(0 <= (FFX) && (FFX) <= FFMAXUTOK \
? FF_CAST (ffsymbol_kind_t, fftranslate[FFX]) \
: FFSYMBOL_FFUNDEF)
/* FFTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by fflex. */
static const fftype_int8 fftranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
52, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 38, 42, 2,
54, 55, 39, 36, 21, 37, 2, 40, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 23, 2,
2, 22, 2, 26, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 49, 2, 53, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 24, 41, 25, 31, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 27, 28, 29, 30,
32, 33, 34, 35, 43, 44, 45, 46, 47, 48,
50, 51
};
#if FFDEBUG
/* FFRLINE[FFN] -- Source line where rule number FFN was defined. */
static const fftype_int16 ffrline[] =
{
0, 252, 252, 253, 256, 257, 263, 269, 275, 281,
284, 286, 299, 301, 314, 325, 339, 343, 347, 351,
353, 362, 365, 368, 377, 379, 381, 383, 385, 387,
390, 394, 396, 398, 400, 409, 411, 413, 416, 419,
422, 425, 428, 437, 446, 455, 458, 460, 462, 464,
468, 472, 491, 510, 529, 540, 554, 566, 597, 692,
700, 761, 785, 787, 789, 791, 793, 795, 797, 799,
801, 805, 807, 809, 818, 821, 824, 827, 830, 833,
836, 839, 842, 845, 848, 851, 854, 857, 860, 863,
866, 869, 872, 875, 877, 879, 881, 884, 891, 908,
921, 934, 945, 961, 985, 1013, 1050, 1054, 1058, 1061,
1066, 1069, 1074, 1078, 1081, 1085, 1087, 1089, 1091, 1093,
1095, 1097, 1101, 1104, 1106, 1115, 1117, 1119, 1128, 1147,
1166
};
#endif
/** Accessing symbol of state STATE. */
#define FF_ACCESSING_SYMBOL(State) FF_CAST (ffsymbol_kind_t, ffstos[State])
#if FFDEBUG || 0
/* The user-facing name of the symbol whose (internal) number is
FFSYMBOL. No bounds checking. */
static const char *ffsymbol_name (ffsymbol_kind_t ffsymbol) FF_ATTRIBUTE_UNUSED;
/* FFTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at FFNTOKENS, nonterminals. */
static const char *const fftname[] =
{
"\"end of file\"", "error", "\"invalid token\"", "BOOLEAN", "LONG",
"DOUBLE", "STRING", "BITSTR", "FUNCTION", "BFUNCTION", "IFUNCTION",
"GTIFILTER", "GTIOVERLAP", "REGFILTER", "COLUMN", "BCOLUMN", "SCOLUMN",
"BITCOL", "ROWREF", "NULLREF", "SNULLREF", "','", "'='", "':'", "'{'",
"'}'", "'?'", "OR", "AND", "EQ", "NE", "'~'", "GT", "LT", "LTE", "GTE",
"'+'", "'-'", "'%'", "'*'", "'/'", "'|'", "'&'", "XOR", "POWER", "NOT",
"INTCAST", "FLTCAST", "UMINUS", "'['", "ACCUM", "DIFF", "'\\n'", "']'",
"'('", "')'", "$accept", "lines", "line", "bvector", "vector", "expr",
"bexpr", "bits", "sexpr", FF_NULLPTR
};
static const char *
ffsymbol_name (ffsymbol_kind_t ffsymbol)
{
return fftname[ffsymbol];
}
#endif
#ifdef FFPRINT
/* FFTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
static const fftype_int16 fftoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 44, 61, 58, 123, 125, 63, 276, 277, 278,
279, 126, 280, 281, 282, 283, 43, 45, 37, 42,
47, 124, 38, 284, 285, 286, 287, 288, 289, 91,
290, 291, 10, 93, 40, 41
};
#endif
#define FFPACT_NINF (-40)
#define ffpact_value_is_default(Yyn) \
((Yyn) == FFPACT_NINF)
#define FFTABLE_NINF (-1)
#define fftable_value_is_error(Yyn) \
0
/* FFPACT[STATE-NUM] -- Index in FFTABLE of the portion describing
STATE-NUM. */
static const fftype_int16 ffpact[] =
{
-40, 337, -40, -39, -40, -40, -40, -40, -40, 389,
442, 442, -5, 21, 29, 17, 25, 44, 45, -40,
-40, -40, 442, 442, 442, 442, 442, 442, -40, 442,
-40, -15, 19, 1159, 443, 1584, 1605, -40, -40, 276,
-10, 330, 133, 469, 144, 1647, 248, 1526, 209, 1689,
-19, -40, 49, -18, 442, 442, 442, 442, 1526, 209,
294, -6, -6, 24, 26, -6, 24, -6, 24, 671,
1186, 382, 1544, 442, -40, 442, -40, 442, 442, 442,
442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
442, 442, 442, 442, 442, -40, 442, 442, 442, 442,
442, 442, 442, -40, -3, -3, -3, -3, -3, -3,
-3, -3, -3, 442, -40, 442, 442, 442, 442, 442,
442, 442, -40, 442, -40, 442, -40, -40, 442, -40,
442, -40, -40, -40, 442, 442, -40, 442, 442, -40,
1388, 1411, 1434, 1457, -40, -40, -40, -40, 1526, 209,
1526, 209, 1480, 1665, 1665, 1665, 22, 22, 22, 22,
203, 203, 203, 148, 24, 148, -37, -37, -37, -37,
784, 1503, 1558, 1619, 18, 69, -34, -34, 148, 809,
-3, -3, 111, 111, 111, 111, 111, 111, -11, 26,
26, 834, 406, 406, 58, 58, 58, 58, -40, 498,
1191, 1221, 1560, 1245, 1576, 527, 1269, 1293, -40, -40,
-40, -40, 442, 442, -40, 442, 442, 442, 442, -40,
26, 68, 442, -40, 442, -40, -40, 442, -40, 442,
-40, 90, -40, 442, 442, 1629, 859, 1629, 209, 1629,
209, 294, 884, 909, 1317, 699, 556, 76, 585, 614,
442, -40, 442, -40, 442, -40, 442, -40, 442, -40,
96, 97, -40, 99, -40, 934, 959, 984, 727, 1341,
51, 92, 56, 442, -40, 442, -40, 442, -40, -40,
442, -40, 108, -40, 1009, 1034, 1059, 643, 65, 442,
-40, 442, -40, 442, -40, 442, -40, -40, 1084, 1109,
1134, 1365, -40, -40, -40, 442, 755, -40
};
/* FFDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when FFTABLE does not specify something else to do. Zero
means the default is an error. */
static const fftype_uint8 ffdefact[] =
{
2, 0, 1, 0, 71, 31, 32, 122, 18, 0,
0, 0, 0, 0, 0, 33, 72, 123, 19, 35,
36, 125, 0, 0, 0, 0, 0, 0, 4, 0,
3, 0, 0, 0, 0, 0, 0, 9, 54, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 106, 0, 0, 0, 0, 0, 0, 12, 10,
0, 46, 47, 120, 29, 67, 68, 69, 70, 0,
0, 0, 0, 0, 17, 0, 16, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 5, 0, 0, 0, 0,
0, 0, 0, 6, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 8, 0, 0, 0, 0, 0,
0, 0, 7, 0, 58, 0, 55, 57, 0, 56,
0, 99, 100, 101, 0, 0, 107, 0, 0, 112,
0, 0, 0, 0, 48, 121, 30, 126, 15, 11,
13, 14, 0, 85, 86, 84, 80, 81, 83, 82,
38, 39, 37, 40, 49, 41, 43, 42, 44, 45,
0, 0, 0, 0, 94, 93, 95, 96, 50, 0,
0, 0, 74, 75, 78, 76, 77, 79, 23, 22,
21, 0, 87, 88, 89, 91, 92, 90, 127, 0,
0, 0, 0, 0, 0, 0, 0, 0, 34, 73,
124, 20, 0, 0, 62, 0, 0, 0, 0, 115,
29, 0, 0, 24, 0, 60, 102, 0, 129, 0,
59, 0, 108, 0, 0, 97, 0, 51, 53, 52,
98, 128, 0, 0, 0, 0, 0, 0, 0, 0,
0, 63, 0, 116, 0, 25, 0, 130, 0, 103,
0, 0, 110, 0, 113, 0, 0, 0, 0, 0,
0, 0, 0, 0, 64, 0, 117, 0, 26, 61,
0, 109, 0, 114, 0, 0, 0, 0, 0, 0,
65, 0, 118, 0, 27, 0, 104, 111, 0, 0,
0, 0, 66, 119, 28, 0, 0, 105
};