-
Notifications
You must be signed in to change notification settings - Fork 4
/
awk.h
1759 lines (1500 loc) · 47.6 KB
/
awk.h
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
/*
* awk.h -- Definitions for gawk.
*/
/*
* Copyright (C) 1986, 1988, 1989, 1991-2011 the Free Software Foundation, Inc.
*
* This file is part of GAWK, the GNU implementation of the
* AWK Programming Language.
*
* GAWK 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.
*
* GAWK 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
/* ------------------------------ Includes ------------------------------ */
/*
* config.h absolutely, positively, *M*U*S*T* be included before
* any system headers. Otherwise, extreme death, destruction
* and loss of life results.
*/
#if defined(_TANDEM_SOURCE)
/*
* config.h forces this even on non-tandem systems but it
* causes problems elsewhere if used in the check below.
* so workaround it. bleah.
*/
#define tandem_for_real 1
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#ifndef _GNU_SOURCE
#define _GNU_SOURCE 1 /* enable GNU extensions */
#endif /* _GNU_SOURCE */
#if defined(tandem_for_real) && ! defined(_SCO_DS)
#define _XOPEN_SOURCE_EXTENDED 1
#endif
#include <stdio.h>
#include <assert.h>
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif /* HAVE_LIMITS_H */
#include <ctype.h>
#include <setjmp.h>
#include "gettext.h"
#define _(msgid) gettext(msgid)
#define N_(msgid) msgid
#if ! (defined(HAVE_LIBINTL_H) && defined(ENABLE_NLS) && ENABLE_NLS > 0)
#ifndef LOCALEDIR
#define LOCALEDIR NULL
#endif /* LOCALEDIR */
#endif
#if !defined(__STDC__) || __STDC__ < 1
#error "gawk no longer supports non-C89 environments (no __STDC__ or __STDC__ < 1)"
#endif
#if defined(HAVE_STDARG_H)
#include <stdarg.h>
#else
#error "gawk no longer supports <varargs.h>. Please update your compiler and runtime"
#endif
#include <signal.h>
#include <time.h>
#include <errno.h>
#if ! defined(errno)
extern int errno;
#endif
#ifdef STDC_HEADERS
#include <stdlib.h>
#endif /* not STDC_HEADERS */
#ifdef HAVE_STDBOOL_H
#include <stdbool.h>
#else
#include "missing_d/gawkbool.h"
#endif
#include "mbsupport.h" /* defines MBS_SUPPORT */
#if MBS_SUPPORT
/* We can handle multibyte strings. */
#include <wchar.h>
#include <wctype.h>
#endif
#ifdef STDC_HEADERS
#include <float.h>
#endif
#undef CHARBITS
#undef INTBITS
#if !defined(ZOS_USS)
#if HAVE_INTTYPES_H
# include <inttypes.h>
#endif
#if HAVE_STDINT_H
# include <stdint.h>
#endif
#else /* ZOS_USS */
#include <limits.h>
#include <sys/time.h>
#define INT32_MAX INT_MAX
#define INT32_MIN INT_MIN
#ifndef __uint32_t
#define __uint32_t 1
typedef unsigned long uint32_t;
#endif
typedef long int32_t;
#endif /* !ZOS_USS */
/* ----------------- System dependencies (with more includes) -----------*/
/* This section is the messiest one in the file, not a lot that can be done */
#ifndef VMS
#ifdef HAVE_FCNTL_H
#include <fcntl.h>
#endif
#include <sys/types.h>
#include <sys/stat.h>
#else /* VMS */
#include <stddef.h>
#include <stat.h>
#include <file.h> /* avoid <fcntl.h> in io.c */
/* debug.c needs this; when _DECC_V4_SOURCE is defined (as it is
in our config.h [vms/vms-conf.h]), off_t won't get declared */
# if !defined(__OFF_T) && !defined(_OFF_T)
# if defined(____OFF_T) || defined(___OFF_T)
typedef __off_t off_t; /* __off_t is either int or __int64 */
# else
typedef int off_t;
# endif
# endif
#endif /* VMS */
#include "protos.h"
#ifdef HAVE_STRING_H
#include <string.h>
#ifdef NEED_MEMORY_H
#include <memory.h>
#endif /* NEED_MEMORY_H */
#else /* not HAVE_STRING_H */
#ifdef HAVE_STRINGS_H
#include <strings.h>
#endif /* HAVE_STRINGS_H */
#endif /* not HAVE_STRING_H */
#if HAVE_UNISTD_H
#include <unistd.h>
#endif /* HAVE_UNISTD_H */
#ifdef VMS
#include <unixlib.h>
#include "vms/redirect.h"
#endif /*VMS*/
#ifndef O_BINARY
#define O_BINARY 0
#endif
#ifndef HAVE_VPRINTF
#error "you lose: you need a system with vfprintf"
#endif /* HAVE_VPRINTF */
#ifndef HAVE_SETLOCALE
#define setlocale(locale, val) /* nothing */
#endif /* HAVE_SETLOCALE */
#if HAVE_MEMCPY_ULONG
extern char *memcpy_ulong(char *dest, const char *src, unsigned long l);
#define memcpy memcpy_ulong
#endif
#if HAVE_MEMSET_ULONG
extern void *memset_ulong(void *dest, int val, unsigned long l);
#define memset memset_ulong
#endif
#ifdef HAVE_LIBSIGSEGV
#include <sigsegv.h>
#else
typedef void *stackoverflow_context_t;
#define sigsegv_install_handler(catchsegv) signal(SIGSEGV, catchsig)
/* define as 0 rather than empty so that (void) cast on it works */
#define stackoverflow_install_handler(catchstackoverflow, extra_stack, STACK_SIZE) 0
#endif
/* use this as lintwarn("...")
this is a hack but it gives us the right semantics */
#define lintwarn (*(set_loc(__FILE__, __LINE__),lintfunc))
#ifdef HAVE_MPFR
#include <gmp.h>
#include <mpfr.h>
#ifndef MPFR_RNDN
/* for compatibility with MPFR 2.X */
#define MPFR_RNDN GMP_RNDN
#define MPFR_RNDZ GMP_RNDZ
#define MPFR_RNDU GMP_RNDU
#define MPFR_RNDD GMP_RNDD
#endif
#endif
#include "regex.h"
#include "dfa.h"
typedef struct Regexp {
struct re_pattern_buffer pat;
struct re_registers regs;
struct dfa *dfareg;
short dfa;
short has_anchor; /* speed up of avoid_dfa kludge, temporary */
short non_empty; /* for use in fpat_parse_field */
short has_meta; /* re has meta chars so (probably) isn't simple string */
short maybe_long; /* re has meta chars that can match long text */
} Regexp;
#define RESTART(rp,s) (rp)->regs.start[0]
#define REEND(rp,s) (rp)->regs.end[0]
#define SUBPATSTART(rp,s,n) (rp)->regs.start[n]
#define SUBPATEND(rp,s,n) (rp)->regs.end[n]
#define NUMSUBPATS(rp,s) (rp)->regs.num_regs
/* regexp matching flags: */
#define RE_NEED_START 1 /* need to know start/end of match */
#define RE_NO_BOL 2 /* not allowed to match ^ in regexp */
#include "gawkapi.h"
/* Stuff for losing systems. */
#if !defined(HAVE_STRTOD)
extern double gawk_strtod();
#define strtod gawk_strtod
#endif
#if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 7)
# define __attribute__(x)
#endif
#ifndef ATTRIBUTE_UNUSED
#define ATTRIBUTE_UNUSED __attribute__ ((__unused__))
#endif /* ATTRIBUTE_UNUSED */
#ifndef ATTRIBUTE_NORETURN
#define ATTRIBUTE_NORETURN __attribute__ ((__noreturn__))
#endif /* ATTRIBUTE_NORETURN */
#ifndef ATTRIBUTE_PRINTF
#define ATTRIBUTE_PRINTF(m, n) __attribute__ ((__format__ (__printf__, m, n)))
#define ATTRIBUTE_PRINTF_1 ATTRIBUTE_PRINTF(1, 2)
#define ATTRIBUTE_PRINTF_2 ATTRIBUTE_PRINTF(2, 3)
#endif /* ATTRIBUTE_PRINTF */
/* ------------------ Constants, Structures, Typedefs ------------------ */
#define AWKNUM double
enum defrule { BEGIN = 1, Rule, END, BEGINFILE, ENDFILE,
MAXRULE /* sentinel, not legal */ };
extern const char *const ruletab[];
typedef enum nodevals {
/* illegal entry == 0 */
Node_illegal,
Node_val, /* node is a value - type in flags */
Node_regex, /* a regexp, text, compiled, flags, etc */
Node_dynregex, /* a dynamic regexp */
/* symbol table values */
Node_var, /* scalar variable, lnode is value */
Node_var_array, /* array is ptr to elements, table_size num of eles */
Node_var_new, /* newly created variable, may become an array */
Node_param_list, /* lnode is a variable, rnode is more list */
Node_func, /* lnode is param. list, rnode is body */
Node_ext_func, /* extension function, code_ptr is builtin code */
Node_array_ref, /* array passed by ref as parameter */
Node_array_tree, /* Hashed array tree (HAT) */
Node_array_leaf, /* Linear 1-D array */
Node_dump_array, /* array info */
/* program execution -- stack item types */
Node_arrayfor,
Node_frame,
Node_instruction,
Node_final /* sentry value, not legal */
} NODETYPE;
struct exp_node;
typedef union bucket_item {
struct {
union bucket_item *next;
char *str;
size_t len;
size_t code;
struct exp_node *name;
struct exp_node *val;
} hs;
struct {
union bucket_item *next;
long li[2];
struct exp_node *val[2];
size_t cnt;
} hi;
} BUCKET;
/* string hash table */
#define ahnext hs.next
#define ahname hs.name /* a string index node */
#define ahname_str hs.str /* shallow copy; = ahname->stptr */
#define ahname_len hs.len /* = ahname->stlen */
#define ahvalue hs.val
#define ahcode hs.code
/* integer hash table */
#define ainext hi.next
#define ainum hi.li /* integer indices */
#define aivalue hi.val
#define aicount hi.cnt
struct exp_instruction;
typedef int (*Func_print)(FILE *, const char *, ...);
typedef struct exp_node **(*array_ptr)(struct exp_node *, struct exp_node *);
/*
* NOTE - this struct is a rather kludgey -- it is packed to minimize
* space usage, at the expense of cleanliness. Alter at own risk.
*/
typedef struct exp_node {
union {
struct {
union {
struct exp_node *lptr;
struct exp_instruction *li;
long ll;
array_ptr *lp;
} l;
union {
struct exp_node *rptr;
Regexp *preg;
struct exp_node **av;
BUCKET **bv;
void (*uptr)(void);
struct exp_instruction *iptr;
} r;
union {
struct exp_node *extra;
void (*aptr)(void);
long xl;
char **param_list;
} x;
char *name;
size_t reserved;
struct exp_node *rn;
unsigned long cnt;
unsigned long reflags;
# define CASE 1
# define CONSTANT 2
# define FS_DFLT 4
} nodep;
struct {
#ifdef HAVE_MPFR
union {
AWKNUM fltnum;
mpfr_t mpnum;
mpz_t mpi;
} nm;
#else
AWKNUM fltnum; /* this is here for optimal packing of
* the structure on many machines
*/
#endif
char *sp;
size_t slen;
long sref;
int idx;
#if MBS_SUPPORT
wchar_t *wsp;
size_t wslen;
#endif
} val;
} sub;
NODETYPE type;
unsigned int flags;
/* any type */
# define MALLOC 0x0001 /* can be free'd */
/* type = Node_val */
# define STRING 0x0002 /* assigned as string */
# define STRCUR 0x0004 /* string value is current */
# define NUMCUR 0x0008 /* numeric value is current */
# define NUMBER 0x0010 /* assigned as number */
# define MAYBE_NUM 0x0020 /* user input: if NUMERIC then
* a NUMBER */
# define FIELD 0x0040 /* this is a field */
# define INTLSTR 0x0080 /* use localized version */
# define NUMINT 0x0100 /* numeric value is an integer */
# define INTIND 0x0200 /* integral value is array index;
* lazy conversion to string.
*/
# define WSTRCUR 0x0400 /* wide str value is current */
# define MPFN 0x0800 /* arbitrary-precision floating-point number */
# define MPZN 0x1000 /* arbitrary-precision integer */
# define NO_EXT_SET 0x2000 /* extension cannot set a value for this variable */
/* type = Node_var_array */
# define ARRAYMAXED 0x4000 /* array is at max size */
# define HALFHAT 0x8000 /* half-capacity Hashed Array Tree;
* See cint_array.c */
# define XARRAY 0x10000
} NODE;
#define vname sub.nodep.name
#define lnode sub.nodep.l.lptr
#define nextp sub.nodep.l.lptr
#define rnode sub.nodep.r.rptr
/* Node_param_list */
#define param vname
#define dup_ent sub.nodep.r.rptr
/* Node_param_list, Node_func */
#define param_cnt sub.nodep.l.ll
/* Node_func */
#define fparms sub.nodep.rn
#define code_ptr sub.nodep.r.iptr
/* Node_regex, Node_dynregex */
#define re_reg sub.nodep.r.preg
#define re_flags sub.nodep.reflags
#define re_text lnode
#define re_exp sub.nodep.x.extra
#define re_cnt flags
/* Node_val */
#define stptr sub.val.sp
#define stlen sub.val.slen
#define valref sub.val.sref
#define stfmt sub.val.idx
#define wstptr sub.val.wsp
#define wstlen sub.val.wslen
#ifdef HAVE_MPFR
#define mpg_numbr sub.val.nm.mpnum
#define mpg_i sub.val.nm.mpi
#define numbr sub.val.nm.fltnum
#else
#define numbr sub.val.fltnum
#endif
/* Node_arrayfor */
#define for_list sub.nodep.r.av
#define for_list_size sub.nodep.reflags
#define cur_idx sub.nodep.l.ll
#define for_array sub.nodep.rn
/* Node_frame: */
#define stack sub.nodep.r.av
#define func_node sub.nodep.x.extra
#define prev_frame_size sub.nodep.reflags
#define reti sub.nodep.l.li
#define num_tail_calls sub.nodep.cnt
/* Node_var: */
#define var_value lnode
#define var_update sub.nodep.r.uptr
#define var_assign sub.nodep.x.aptr
/* Node_var_array: */
#define buckets sub.nodep.r.bv
#define nodes sub.nodep.r.av
#define array_funcs sub.nodep.l.lp
#define array_base sub.nodep.l.ll
#define table_size sub.nodep.reflags
#define array_size sub.nodep.cnt
#define array_capacity sub.nodep.reserved
#define xarray sub.nodep.rn
#define parent_array sub.nodep.x.extra
/* array_funcs[0] is the array initialization function and
* array_funcs[1] is the index type checking function
*/
#define alookup array_funcs[2]
#define aexists array_funcs[3]
#define aclear array_funcs[4]
#define aremove array_funcs[5]
#define alist array_funcs[6]
#define acopy array_funcs[7]
#define adump array_funcs[8]
#define NUM_AFUNCS 9 /* # of entries in array_funcs */
/* Node_array_ref: */
#define orig_array lnode
#define prev_array rnode
/* Node_array_print */
#define adepth sub.nodep.l.ll
#define alevel sub.nodep.x.xl
/* --------------------------------lint warning types----------------------------*/
typedef enum lintvals {
LINT_illegal,
LINT_assign_in_cond,
LINT_no_effect
} LINTTYPE;
/* --------------------------------Instruction ---------------------------------- */
typedef enum opcodeval {
/* illegal entry == 0 */
Op_illegal,
/* binary operators */
Op_times,
Op_times_i,
Op_quotient,
Op_quotient_i,
Op_mod,
Op_mod_i,
Op_plus,
Op_plus_i,
Op_minus,
Op_minus_i,
Op_exp,
Op_exp_i,
Op_concat,
/* line range instruction pair */
Op_line_range, /* flags for Op_cond_pair */
Op_cond_pair, /* conditional pair */
Op_subscript,
Op_sub_array,
/* unary operators */
Op_preincrement,
Op_predecrement,
Op_postincrement,
Op_postdecrement,
Op_unary_minus,
Op_field_spec,
/* unary relationals */
Op_not,
/* assignments */
Op_assign,
Op_store_var, /* simple variable assignment optimization */
Op_store_sub, /* array[subscript] assignment optimization */
Op_store_field, /* $n assignment optimization */
Op_assign_times,
Op_assign_quotient,
Op_assign_mod,
Op_assign_plus,
Op_assign_minus,
Op_assign_exp,
Op_assign_concat,
/* boolean binaries */
Op_and, /* a left subexpression in && */
Op_and_final, /* right subexpression of && */
Op_or,
Op_or_final,
/* binary relationals */
Op_equal,
Op_notequal,
Op_less,
Op_greater,
Op_leq,
Op_geq,
Op_match,
Op_match_rec, /* match $0 */
Op_nomatch,
Op_rule,
/* keywords */
Op_K_case,
Op_K_default,
Op_K_break,
Op_K_continue,
Op_K_print,
Op_K_print_rec,
Op_K_printf,
Op_K_next,
Op_K_exit,
Op_K_return,
Op_K_delete,
Op_K_delete_loop,
Op_K_getline_redir,
Op_K_getline,
Op_K_nextfile,
Op_builtin,
Op_sub_builtin, /* sub, gsub and gensub */
Op_ext_builtin,
Op_in_array, /* boolean test of membership in array */
/* function call instruction */
Op_func_call,
Op_indirect_func_call,
Op_push, /* scalar variable */
Op_push_arg, /* variable type (scalar or array) argument to built-in */
Op_push_i, /* number, string */
Op_push_re, /* regex */
Op_push_array,
Op_push_param,
Op_push_lhs,
Op_subscript_lhs,
Op_field_spec_lhs,
Op_no_op, /* jump target */
Op_pop, /* pop an item from the runtime stack */
Op_jmp,
Op_jmp_true,
Op_jmp_false,
Op_get_record,
Op_newfile,
Op_arrayfor_init,
Op_arrayfor_incr,
Op_arrayfor_final,
Op_var_update, /* update value of NR, NF or FNR */
Op_var_assign,
Op_field_assign,
Op_after_beginfile,
Op_after_endfile,
Op_func,
Op_exec_count,
Op_breakpoint,
Op_lint,
Op_atexit,
Op_stop,
/* parsing (yylex and yyparse), should never appear in valid compiled code */
Op_token,
Op_symbol,
Op_list,
/* program structures -- for use in the profiler/pretty printer */
Op_K_do,
Op_K_for,
Op_K_arrayfor,
Op_K_while,
Op_K_switch,
Op_K_if,
Op_K_else,
Op_K_function,
Op_cond_exp,
Op_final /* sentry value, not legal */
} OPCODE;
enum redirval {
/* I/O redirections */
redirect_none = 0,
redirect_output,
redirect_append,
redirect_pipe,
redirect_pipein,
redirect_input,
redirect_twoway
};
struct break_point;
typedef struct exp_instruction {
struct exp_instruction *nexti;
union {
NODE *dn;
struct exp_instruction *di;
NODE *(*fptr)(int);
awk_value_t *(*efptr)(int, awk_value_t *);
long dl;
char *name;
} d;
union {
long xl;
NODE *xn;
void (*aptr)(void);
struct exp_instruction *xi;
struct break_point *bpt;
} x;
short source_line;
OPCODE opcode;
} INSTRUCTION;
#define func_name d.name
#define memory d.dn
#define builtin d.fptr
#define extfunc d.efptr
#define builtin_idx d.dl
#define expr_count x.xl
#define target_continue d.di
#define target_jmp d.di
#define target_break x.xi
/* Op_sub_builtin */
#define sub_flags d.dl
#define GSUB 0x01 /* builtin is gsub */
#define GENSUB 0x02 /* builtin is gensub */
#define LITERAL 0x04 /* target is a literal string */
/* Op_K_exit */
#define target_end d.di
#define target_atexit x.xi
/* Op_newfile, Op_K_getline, Op_nextfile */
#define target_endfile x.xi
/* Op_newfile */
#define target_get_record x.xi
/* Op_get_record, Op_K_nextfile */
#define target_newfile d.di
/* Op_K_getline */
#define target_beginfile d.di
/* Op_get_record */
#define has_endfile x.xl
/* Op_token */
#define lextok d.name
#define param_count x.xl
/* Op_rule */
#define in_rule x.xl
#define source_file d.name
/* Op_K_case, Op_K_default */
#define case_stmt x.xi
#define case_exp d.di
#define stmt_start case_exp
#define stmt_end case_stmt
#define match_exp x.xl
#define target_stmt x.xi
/* Op_K_switch */
#define switch_end x.xi
#define switch_start d.di
/* Op_K_getline, Op_K_getline_redir */
#define into_var x.xl
/* Op_K_getline_redir, Op_K_print, Op_K_print_rec, Op_K_printf */
#define redir_type d.dl
/* Op_arrayfor_incr */
#define array_var x.xn
/* Op_line_range */
#define triggered x.xl
/* Op_cond_pair */
#define line_range x.xi
/* Op_func_call, Op_func */
#define func_body x.xn
/* Op_func_call */
#define tail_call d.dl
/* Op_subscript */
#define sub_count d.dl
/* Op_push_lhs, Op_subscript_lhs, Op_field_spec_lhs */
#define do_reference x.xl
/* Op_list, Op_rule, Op_func */
#define lasti d.di
#define firsti x.xi
/* Op_rule, Op_func */
#define last_line x.xl
#define first_line source_line
/* Op_lint */
#define lint_type d.dl
/* Op_field_spec_lhs */
#define target_assign d.di
/* Op_var_assign */
#define assign_var x.aptr
/* Op_var_update */
#define update_var x.aptr
/* Op_field_assign */
#define field_assign x.aptr
/* Op_field_assign, Op_var_assign */
#define assign_ctxt d.dl
/* Op_concat */
#define concat_flag d.dl
#define CSUBSEP 1
#define CSVAR 2
/* Op_breakpoint */
#define break_pt x.bpt
/*------------------ pretty printing/profiling --------*/
/* Op_exec_count */
#define exec_count d.dl
/* Op_K_while */
#define while_body d.di
/* Op_K_do */
#define doloop_cond d.di
/* Op_K_for */
#define forloop_cond d.di
#define forloop_body x.xi
/* Op_K_if */
#define branch_if d.di
#define branch_else x.xi
/* Op_K_else */
#define branch_end x.xi
/* Op_line_range */
#define condpair_left d.di
#define condpair_right x.xi
/* Op_store_var */
#define initval x.xn
typedef struct iobuf {
awk_input_buf_t public; /* exposed to extensions */
char *buf; /* start data buffer */
char *off; /* start of current record in buffer */
char *dataend; /* first byte in buffer to hold new data,
NULL if not read yet */
char *end; /* end of buffer */
size_t readsize; /* set from fstat call */
size_t size; /* buffer size */
ssize_t count; /* amount read last time */
size_t scanoff; /* where we were in the buffer when we had
to regrow/refill */
/*
* No argument prototype on read_func. See get_src_buf()
* in awkgram.y.
*/
ssize_t (*read_func)();
bool valid;
int errcode;
int flag;
# define IOP_IS_TTY 1
# define IOP_AT_EOF 2
# define IOP_CLOSED 4
# define IOP_AT_START 8
} IOBUF;
typedef void (*Func_ptr)(void);
/* structure used to dynamically maintain a linked-list of open files/pipes */
struct redirect {
unsigned int flag;
# define RED_FILE 1
# define RED_PIPE 2
# define RED_READ 4
# define RED_WRITE 8
# define RED_APPEND 16
# define RED_NOBUF 32
# define RED_USED 64 /* closed temporarily to reuse fd */
# define RED_EOF 128
# define RED_TWOWAY 256
# define RED_PTY 512
# define RED_SOCKET 1024
# define RED_TCP 2048
char *value;
FILE *ifp; /* input fp, needed for PIPES_SIMULATED */
IOBUF *iop;
int pid;
int status;
struct redirect *prev;
struct redirect *next;
const char *mode;
awk_output_buf_t output;
};
/*
* structure for our source, either a command line string or a source file.
*/
typedef struct srcfile {
struct srcfile *next;
struct srcfile *prev;
enum srctype {
SRC_CMDLINE = 1,
SRC_STDIN,
SRC_FILE,
SRC_INC,
SRC_EXTLIB
} stype;
char *src; /* name on command line or include statement */
char *fullpath; /* full path after AWKPATH search */
time_t mtime;
struct stat sbuf;
int srclines; /* no of lines in source */
size_t bufsize;
char *buf;
int *line_offset; /* offset to the beginning of each line */
int fd;
int maxlen; /* size of the longest line */
char *lexptr;
char *lexend;
char *lexeme;
char *lexptr_begin;
int lasttok;
} SRCFILE;
/* structure for execution context */
typedef struct context {
INSTRUCTION pools;
NODE symbols;
INSTRUCTION rule_list;
SRCFILE srcfiles;
int sourceline;
char *source;
void (*install_func)(NODE *);
struct context *prev;
} AWK_CONTEXT;
/* for debugging purposes */
struct flagtab {
int val;
const char *name;
};
typedef struct block_item {
size_t size;
struct block_item *freep;
} BLOCK;
enum block_id {
BLOCK_INVALID = 0, /* not legal */
BLOCK_NODE,
BLOCK_BUCKET,
BLOCK_MAX /* count */
};
#ifndef LONG_MAX
#define LONG_MAX ((long)(~(1L << (sizeof (long) * 8 - 1))))
#endif
#ifndef ULONG_MAX
#define ULONG_MAX (~(unsigned long)0)
#endif
#ifndef LONG_MIN
#define LONG_MIN ((long)(-LONG_MAX - 1L))
#endif
#define UNLIMITED LONG_MAX
/* -------------------------- External variables -------------------------- */