-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathawk.c
2764 lines (2322 loc) · 57.9 KB
/
awk.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
/* vi: set sw=4 ts=4: */
/*
* awk implementation for busybox
*
* Copyright (C) 2002 by Dmitry Zakharov <dmit@crp.bank.gov.ua>
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <time.h>
#include <math.h>
#include <ctype.h>
#include <getopt.h>
#include <regex.h>
#include "busybox.h"
#define MAXVARFMT 240
#define MINNVBLOCK 64
/* variable flags */
#define VF_NUMBER 0x0001 /* 1 = primary type is number */
#define VF_ARRAY 0x0002 /* 1 = it's an array */
#define VF_CACHED 0x0100 /* 1 = num/str value has cached str/num eq */
#define VF_USER 0x0200 /* 1 = user input (may be numeric string) */
#define VF_SPECIAL 0x0400 /* 1 = requires extra handling when changed */
#define VF_WALK 0x0800 /* 1 = variable has alloc'd x.walker list */
#define VF_FSTR 0x1000 /* 1 = string points to fstring buffer */
#define VF_CHILD 0x2000 /* 1 = function arg; x.parent points to source */
#define VF_DIRTY 0x4000 /* 1 = variable was set explicitly */
/* these flags are static, don't change them when value is changed */
#define VF_DONTTOUCH (VF_ARRAY | VF_SPECIAL | VF_WALK | VF_CHILD | VF_DIRTY)
/* Variable */
typedef struct var_s {
unsigned short type; /* flags */
double number;
char *string;
union {
int aidx; /* func arg index (on compilation stage) */
struct xhash_s *array; /* array ptr */
struct var_s *parent; /* for func args, ptr to actual parameter */
char **walker; /* list of array elements (for..in) */
} x;
} var;
/* Node chain (pattern-action chain, BEGIN, END, function bodies) */
typedef struct chain_s {
struct node_s *first;
struct node_s *last;
char *programname;
} chain;
/* Function */
typedef struct func_s {
unsigned short nargs;
struct chain_s body;
} func;
/* I/O stream */
typedef struct rstream_s {
FILE *F;
char *buffer;
int adv;
int size;
int pos;
unsigned short is_pipe;
} rstream;
typedef struct hash_item_s {
union {
struct var_s v; /* variable/array hash */
struct rstream_s rs; /* redirect streams hash */
struct func_s f; /* functions hash */
} data;
struct hash_item_s *next; /* next in chain */
char name[1]; /* really it's longer */
} hash_item;
typedef struct xhash_s {
unsigned int nel; /* num of elements */
unsigned int csize; /* current hash size */
unsigned int nprime; /* next hash size in PRIMES[] */
unsigned int glen; /* summary length of item names */
struct hash_item_s **items;
} xhash;
/* Tree node */
typedef struct node_s {
unsigned long info;
unsigned short lineno;
union {
struct node_s *n;
var *v;
int i;
char *s;
regex_t *re;
} l;
union {
struct node_s *n;
regex_t *ire;
func *f;
int argno;
} r;
union {
struct node_s *n;
} a;
} node;
/* Block of temporary variables */
typedef struct nvblock_s {
int size;
var *pos;
struct nvblock_s *prev;
struct nvblock_s *next;
var nv[0];
} nvblock;
typedef struct tsplitter_s {
node n;
regex_t re[2];
} tsplitter;
/* simple token classes */
/* Order and hex values are very important!!! See next_token() */
#define TC_SEQSTART 1 /* ( */
#define TC_SEQTERM (1 << 1) /* ) */
#define TC_REGEXP (1 << 2) /* /.../ */
#define TC_OUTRDR (1 << 3) /* | > >> */
#define TC_UOPPOST (1 << 4) /* unary postfix operator */
#define TC_UOPPRE1 (1 << 5) /* unary prefix operator */
#define TC_BINOPX (1 << 6) /* two-opnd operator */
#define TC_IN (1 << 7)
#define TC_COMMA (1 << 8)
#define TC_PIPE (1 << 9) /* input redirection pipe */
#define TC_UOPPRE2 (1 << 10) /* unary prefix operator */
#define TC_ARRTERM (1 << 11) /* ] */
#define TC_GRPSTART (1 << 12) /* { */
#define TC_GRPTERM (1 << 13) /* } */
#define TC_SEMICOL (1 << 14)
#define TC_NEWLINE (1 << 15)
#define TC_STATX (1 << 16) /* ctl statement (for, next...) */
#define TC_WHILE (1 << 17)
#define TC_ELSE (1 << 18)
#define TC_BUILTIN (1 << 19)
#define TC_GETLINE (1 << 20)
#define TC_FUNCDECL (1 << 21) /* `function' `func' */
#define TC_BEGIN (1 << 22)
#define TC_END (1 << 23)
#define TC_EOF (1 << 24)
#define TC_VARIABLE (1 << 25)
#define TC_ARRAY (1 << 26)
#define TC_FUNCTION (1 << 27)
#define TC_STRING (1 << 28)
#define TC_NUMBER (1 << 29)
#define TC_UOPPRE (TC_UOPPRE1 | TC_UOPPRE2)
/* combined token classes */
#define TC_BINOP (TC_BINOPX | TC_COMMA | TC_PIPE | TC_IN)
#define TC_UNARYOP (TC_UOPPRE | TC_UOPPOST)
#define TC_OPERAND (TC_VARIABLE | TC_ARRAY | TC_FUNCTION | \
TC_BUILTIN | TC_GETLINE | TC_SEQSTART | TC_STRING | TC_NUMBER)
#define TC_STATEMNT (TC_STATX | TC_WHILE)
#define TC_OPTERM (TC_SEMICOL | TC_NEWLINE)
/* word tokens, cannot mean something else if not expected */
#define TC_WORD (TC_IN | TC_STATEMNT | TC_ELSE | TC_BUILTIN | \
TC_GETLINE | TC_FUNCDECL | TC_BEGIN | TC_END)
/* discard newlines after these */
#define TC_NOTERM (TC_COMMA | TC_GRPSTART | TC_GRPTERM | \
TC_BINOP | TC_OPTERM)
/* what can expression begin with */
#define TC_OPSEQ (TC_OPERAND | TC_UOPPRE | TC_REGEXP)
/* what can group begin with */
#define TC_GRPSEQ (TC_OPSEQ | TC_OPTERM | TC_STATEMNT | TC_GRPSTART)
/* if previous token class is CONCAT1 and next is CONCAT2, concatenation */
/* operator is inserted between them */
#define TC_CONCAT1 (TC_VARIABLE | TC_ARRTERM | TC_SEQTERM | \
TC_STRING | TC_NUMBER | TC_UOPPOST)
#define TC_CONCAT2 (TC_OPERAND | TC_UOPPRE)
#define OF_RES1 0x010000
#define OF_RES2 0x020000
#define OF_STR1 0x040000
#define OF_STR2 0x080000
#define OF_NUM1 0x100000
#define OF_CHECKED 0x200000
/* combined operator flags */
#define xx 0
#define xV OF_RES2
#define xS (OF_RES2 | OF_STR2)
#define Vx OF_RES1
#define VV (OF_RES1 | OF_RES2)
#define Nx (OF_RES1 | OF_NUM1)
#define NV (OF_RES1 | OF_NUM1 | OF_RES2)
#define Sx (OF_RES1 | OF_STR1)
#define SV (OF_RES1 | OF_STR1 | OF_RES2)
#define SS (OF_RES1 | OF_STR1 | OF_RES2 | OF_STR2)
#define OPCLSMASK 0xFF00
#define OPNMASK 0x007F
/* operator priority is a highest byte (even: r->l, odd: l->r grouping)
* For builtins it has different meaning: n n s3 s2 s1 v3 v2 v1,
* n - min. number of args, vN - resolve Nth arg to var, sN - resolve to string
*/
#define P(x) (x << 24)
#define PRIMASK 0x7F000000
#define PRIMASK2 0x7E000000
/* Operation classes */
#define SHIFT_TIL_THIS 0x0600
#define RECUR_FROM_THIS 0x1000
enum {
OC_DELETE=0x0100, OC_EXEC=0x0200, OC_NEWSOURCE=0x0300,
OC_PRINT=0x0400, OC_PRINTF=0x0500, OC_WALKINIT=0x0600,
OC_BR=0x0700, OC_BREAK=0x0800, OC_CONTINUE=0x0900,
OC_EXIT=0x0a00, OC_NEXT=0x0b00, OC_NEXTFILE=0x0c00,
OC_TEST=0x0d00, OC_WALKNEXT=0x0e00,
OC_BINARY=0x1000, OC_BUILTIN=0x1100, OC_COLON=0x1200,
OC_COMMA=0x1300, OC_COMPARE=0x1400, OC_CONCAT=0x1500,
OC_FBLTIN=0x1600, OC_FIELD=0x1700, OC_FNARG=0x1800,
OC_FUNC=0x1900, OC_GETLINE=0x1a00, OC_IN=0x1b00,
OC_LAND=0x1c00, OC_LOR=0x1d00, OC_MATCH=0x1e00,
OC_MOVE=0x1f00, OC_PGETLINE=0x2000, OC_REGEXP=0x2100,
OC_REPLACE=0x2200, OC_RETURN=0x2300, OC_SPRINTF=0x2400,
OC_TERNARY=0x2500, OC_UNARY=0x2600, OC_VAR=0x2700,
OC_DONE=0x2800,
ST_IF=0x3000, ST_DO=0x3100, ST_FOR=0x3200,
ST_WHILE=0x3300
};
/* simple builtins */
enum {
F_in=0, F_rn, F_co, F_ex, F_lg, F_si, F_sq, F_sr,
F_ti, F_le, F_sy, F_ff, F_cl
};
/* builtins */
enum {
B_a2=0, B_ix, B_ma, B_sp, B_ss, B_ti, B_lo, B_up,
B_ge, B_gs, B_su
};
/* tokens and their corresponding info values */
#define NTC "\377" /* switch to next token class (tc<<1) */
#define NTCC '\377'
#define OC_B OC_BUILTIN
static char * const tokenlist =
"\1(" NTC
"\1)" NTC
"\1/" NTC /* REGEXP */
"\2>>" "\1>" "\1|" NTC /* OUTRDR */
"\2++" "\2--" NTC /* UOPPOST */
"\2++" "\2--" "\1$" NTC /* UOPPRE1 */
"\2==" "\1=" "\2+=" "\2-=" /* BINOPX */
"\2*=" "\2/=" "\2%=" "\2^="
"\1+" "\1-" "\3**=" "\2**"
"\1/" "\1%" "\1^" "\1*"
"\2!=" "\2>=" "\2<=" "\1>"
"\1<" "\2!~" "\1~" "\2&&"
"\2||" "\1?" "\1:" NTC
"\2in" NTC
"\1," NTC
"\1|" NTC
"\1+" "\1-" "\1!" NTC /* UOPPRE2 */
"\1]" NTC
"\1{" NTC
"\1}" NTC
"\1;" NTC
"\1\n" NTC
"\2if" "\2do" "\3for" "\5break" /* STATX */
"\10continue" "\6delete" "\5print"
"\6printf" "\4next" "\10nextfile"
"\6return" "\4exit" NTC
"\5while" NTC
"\4else" NTC
"\5close" "\6system" "\6fflush" "\5atan2" /* BUILTIN */
"\3cos" "\3exp" "\3int" "\3log"
"\4rand" "\3sin" "\4sqrt" "\5srand"
"\6gensub" "\4gsub" "\5index" "\6length"
"\5match" "\5split" "\7sprintf" "\3sub"
"\6substr" "\7systime" "\10strftime"
"\7tolower" "\7toupper" NTC
"\7getline" NTC
"\4func" "\10function" NTC
"\5BEGIN" NTC
"\3END" "\0"
;
static unsigned long tokeninfo[] = {
0,
0,
OC_REGEXP,
xS|'a', xS|'w', xS|'|',
OC_UNARY|xV|P(9)|'p', OC_UNARY|xV|P(9)|'m',
OC_UNARY|xV|P(9)|'P', OC_UNARY|xV|P(9)|'M',
OC_FIELD|xV|P(5),
OC_COMPARE|VV|P(39)|5, OC_MOVE|VV|P(74),
OC_REPLACE|NV|P(74)|'+', OC_REPLACE|NV|P(74)|'-',
OC_REPLACE|NV|P(74)|'*', OC_REPLACE|NV|P(74)|'/',
OC_REPLACE|NV|P(74)|'%', OC_REPLACE|NV|P(74)|'&',
OC_BINARY|NV|P(29)|'+', OC_BINARY|NV|P(29)|'-',
OC_REPLACE|NV|P(74)|'&', OC_BINARY|NV|P(15)|'&',
OC_BINARY|NV|P(25)|'/', OC_BINARY|NV|P(25)|'%',
OC_BINARY|NV|P(15)|'&', OC_BINARY|NV|P(25)|'*',
OC_COMPARE|VV|P(39)|4, OC_COMPARE|VV|P(39)|3,
OC_COMPARE|VV|P(39)|0, OC_COMPARE|VV|P(39)|1,
OC_COMPARE|VV|P(39)|2, OC_MATCH|Sx|P(45)|'!',
OC_MATCH|Sx|P(45)|'~', OC_LAND|Vx|P(55),
OC_LOR|Vx|P(59), OC_TERNARY|Vx|P(64)|'?',
OC_COLON|xx|P(67)|':',
OC_IN|SV|P(49),
OC_COMMA|SS|P(80),
OC_PGETLINE|SV|P(37),
OC_UNARY|xV|P(19)|'+', OC_UNARY|xV|P(19)|'-',
OC_UNARY|xV|P(19)|'!',
0,
0,
0,
0,
0,
ST_IF, ST_DO, ST_FOR, OC_BREAK,
OC_CONTINUE, OC_DELETE|Vx, OC_PRINT,
OC_PRINTF, OC_NEXT, OC_NEXTFILE,
OC_RETURN|Vx, OC_EXIT|Nx,
ST_WHILE,
0,
OC_FBLTIN|Sx|F_cl, OC_FBLTIN|Sx|F_sy, OC_FBLTIN|Sx|F_ff, OC_B|B_a2|P(0x83),
OC_FBLTIN|Nx|F_co, OC_FBLTIN|Nx|F_ex, OC_FBLTIN|Nx|F_in, OC_FBLTIN|Nx|F_lg,
OC_FBLTIN|F_rn, OC_FBLTIN|Nx|F_si, OC_FBLTIN|Nx|F_sq, OC_FBLTIN|Nx|F_sr,
OC_B|B_ge|P(0xd6), OC_B|B_gs|P(0xb6), OC_B|B_ix|P(0x9b), OC_FBLTIN|Sx|F_le,
OC_B|B_ma|P(0x89), OC_B|B_sp|P(0x8b), OC_SPRINTF, OC_B|B_su|P(0xb6),
OC_B|B_ss|P(0x8f), OC_FBLTIN|F_ti, OC_B|B_ti|P(0x0b),
OC_B|B_lo|P(0x49), OC_B|B_up|P(0x49),
OC_GETLINE|SV|P(0),
0, 0,
0,
0
};
/* internal variable names and their initial values */
/* asterisk marks SPECIAL vars; $ is just no-named Field0 */
enum {
CONVFMT=0, OFMT, FS, OFS,
ORS, RS, RT, FILENAME,
SUBSEP, ARGIND, ARGC, ARGV,
ERRNO, FNR,
NR, NF, IGNORECASE,
ENVIRON, F0, _intvarcount_
};
static char * vNames =
"CONVFMT\0" "OFMT\0" "FS\0*" "OFS\0"
"ORS\0" "RS\0*" "RT\0" "FILENAME\0"
"SUBSEP\0" "ARGIND\0" "ARGC\0" "ARGV\0"
"ERRNO\0" "FNR\0"
"NR\0" "NF\0*" "IGNORECASE\0*"
"ENVIRON\0" "$\0*" "\0";
static char * vValues =
"%.6g\0" "%.6g\0" " \0" " \0"
"\n\0" "\n\0" "\0" "\0"
"\034\0"
"\377";
/* hash size may grow to these values */
#define FIRST_PRIME 61;
static const unsigned int PRIMES[] = { 251, 1021, 4093, 16381, 65521 };
static const unsigned int NPRIMES = sizeof(PRIMES) / sizeof(unsigned int);
/* globals */
//extern char **environ;
static var * V[_intvarcount_];
static chain beginseq, mainseq, endseq, *seq;
static int nextrec, nextfile;
static node *break_ptr, *continue_ptr;
static rstream *iF;
static xhash *vhash, *ahash, *fdhash, *fnhash;
static char *programname;
static short lineno;
static int is_f0_split;
static int nfields = 0;
static var *Fields = NULL;
static tsplitter fsplitter, rsplitter;
static nvblock *cb = NULL;
static char *pos;
static char *buf;
static int icase = FALSE;
static int exiting = FALSE;
static struct {
unsigned long tclass;
unsigned long info;
char *string;
double number;
short lineno;
int rollback;
} t;
/* function prototypes */
extern void xregcomp(regex_t *preg, const char *regex, int cflags);
static void handle_special(var *);
static node *parse_expr(unsigned long);
static void chain_group(void);
static var *evaluate(node *, var *);
static rstream *next_input_file(void);
static int fmt_num(char *, int, char *, double, int);
static int awk_exit(int);
/* ---- error handling ---- */
static const char EMSG_INTERNAL_ERROR[] = "Internal error";
static const char EMSG_UNEXP_EOS[] = "Unexpected end of string";
static const char EMSG_UNEXP_TOKEN[] = "Unexpected token";
static const char EMSG_DIV_BY_ZERO[] = "Division by zero";
static const char EMSG_INV_FMT[] = "Invalid format specifier";
static const char EMSG_TOO_FEW_ARGS[] = "Too few arguments for builtin";
static const char EMSG_NOT_ARRAY[] = "Not an array";
static const char EMSG_POSSIBLE_ERROR[] = "Possible syntax error";
static const char EMSG_UNDEF_FUNC[] = "Call to undefined function";
#ifndef CONFIG_FEATURE_AWK_MATH
static const char EMSG_NO_MATH[] = "Math support is not compiled in";
#endif
static void syntax_error(const char * const message)
{
error_msg("%s:%i: %s", programname, lineno, message);
exit(1);
}
#define runtime_error(x) syntax_error(x)
/* ---- hash stuff ---- */
static unsigned int hashidx(char *name) {
register unsigned int idx=0;
while (*name) idx = *name++ + (idx << 6) - idx;
return idx;
}
/* create new hash */
static xhash *hash_init(void) {
xhash *newhash;
newhash = (xhash *)xcalloc(1, sizeof(xhash));
newhash->csize = FIRST_PRIME;
newhash->items = (hash_item **)xcalloc(newhash->csize, sizeof(hash_item *));
return newhash;
}
/* find item in hash, return ptr to data, NULL if not found */
static void *hash_search(xhash *hash, char *name) {
hash_item *hi;
hi = hash->items [ hashidx(name) % hash->csize ];
while (hi) {
if (strcmp(hi->name, name) == 0)
return &(hi->data);
hi = hi->next;
}
return NULL;
}
/* grow hash if it becomes too big */
static void hash_rebuild(xhash *hash) {
unsigned int newsize, i, idx;
hash_item **newitems, *hi, *thi;
if (hash->nprime == NPRIMES)
return;
newsize = PRIMES[hash->nprime++];
newitems = (hash_item **)xcalloc(newsize, sizeof(hash_item *));
for (i=0; i<hash->csize; i++) {
hi = hash->items[i];
while (hi) {
thi = hi;
hi = thi->next;
idx = hashidx(thi->name) % newsize;
thi->next = newitems[idx];
newitems[idx] = thi;
}
}
free(hash->items);
hash->csize = newsize;
hash->items = newitems;
}
/* find item in hash, add it if necessary. Return ptr to data */
static void *hash_find(xhash *hash, char *name) {
hash_item *hi;
unsigned int idx;
int l;
hi = hash_search(hash, name);
if (! hi) {
if (++hash->nel / hash->csize > 10)
hash_rebuild(hash);
l = strlen(name) + 1;
hi = xcalloc(sizeof(hash_item) + l, 1);
memcpy(hi->name, name, l);
idx = hashidx(name) % hash->csize;
hi->next = hash->items[idx];
hash->items[idx] = hi;
hash->glen += l;
}
return &(hi->data);
}
#define findvar(hash, name) (var *) hash_find ( (hash) , (name) )
#define newvar(name) (var *) hash_find ( vhash , (name) )
#define newfile(name) (rstream *) hash_find ( fdhash , (name) )
#define newfunc(name) (func *) hash_find ( fnhash , (name) )
static void hash_remove(xhash *hash, char *name) {
hash_item *hi, **phi;
phi = &(hash->items[ hashidx(name) % hash->csize ]);
while (*phi) {
hi = *phi;
if (strcmp(hi->name, name) == 0) {
hash->glen -= (strlen(name) + 1);
hash->nel--;
*phi = hi->next;
free(hi);
break;
}
phi = &(hi->next);
}
}
/* ------ some useful functions ------ */
static void skip_spaces(char **s) {
register char *p = *s;
while(*p == ' ' || *p == '\t' ||
(*p == '\\' && *(p+1) == '\n' && (++p, ++t.lineno))) {
p++;
}
*s = p;
}
static char *nextword(char **s) {
register char *p = *s;
while (*(*s)++) ;
return p;
}
static char nextchar(char **s) {
register char c, *pps;
c = *((*s)++);
pps = *s;
if (c == '\\') c = process_escape_sequence((const char**)s);
if (c == '\\' && *s == pps) c = *((*s)++);
return c;
}
static inline int isalnum_(int c) {
return (isalnum(c) || c == '_');
}
static FILE *afopen(const char *path, const char *mode) {
return (*path == '-' && *(path+1) == '\0') ? stdin : xfopen(path, mode);
}
/* -------- working with variables (set/get/copy/etc) -------- */
static xhash *iamarray(var *v) {
var *a = v;
while (a->type & VF_CHILD)
a = a->x.parent;
if (! (a->type & VF_ARRAY)) {
a->type |= VF_ARRAY;
a->x.array = hash_init();
}
return a->x.array;
}
static void clear_array(xhash *array) {
unsigned int i;
hash_item *hi, *thi;
for (i=0; i<array->csize; i++) {
hi = array->items[i];
while (hi) {
thi = hi;
hi = hi->next;
free(thi->data.v.string);
free(thi);
}
array->items[i] = NULL;
}
array->glen = array->nel = 0;
}
/* clear a variable */
static var *clrvar(var *v) {
if (!(v->type & VF_FSTR))
free(v->string);
v->type &= VF_DONTTOUCH;
v->type |= VF_DIRTY;
v->string = NULL;
return v;
}
/* assign string value to variable */
static var *setvar_p(var *v, char *value) {
clrvar(v);
v->string = value;
handle_special(v);
return v;
}
/* same as setvar_p but make a copy of string */
static var *setvar_s(var *v, char *value) {
return setvar_p(v, (value && *value) ? xstrdup(value) : NULL);
}
/* same as setvar_s but set USER flag */
static var *setvar_u(var *v, char *value) {
setvar_s(v, value);
v->type |= VF_USER;
return v;
}
/* set array element to user string */
static void setari_u(var *a, int idx, char *s) {
register var *v;
static char sidx[12];
sprintf(sidx, "%d", idx);
v = findvar(iamarray(a), sidx);
setvar_u(v, s);
}
/* assign numeric value to variable */
static var *setvar_i(var *v, double value) {
clrvar(v);
v->type |= VF_NUMBER;
v->number = value;
handle_special(v);
return v;
}
static char *getvar_s(var *v) {
/* if v is numeric and has no cached string, convert it to string */
if ((v->type & (VF_NUMBER | VF_CACHED)) == VF_NUMBER) {
fmt_num(buf, MAXVARFMT, getvar_s(V[CONVFMT]), v->number, TRUE);
v->string = xstrdup(buf);
v->type |= VF_CACHED;
}
return (v->string == NULL) ? "" : v->string;
}
static double getvar_i(var *v) {
char *s;
if ((v->type & (VF_NUMBER | VF_CACHED)) == 0) {
v->number = 0;
s = v->string;
if (s && *s) {
v->number = strtod(s, &s);
if (v->type & VF_USER) {
skip_spaces(&s);
if (*s != '\0')
v->type &= ~VF_USER;
}
} else {
v->type &= ~VF_USER;
}
v->type |= VF_CACHED;
}
return v->number;
}
static var *copyvar(var *dest, var *src) {
if (dest != src) {
clrvar(dest);
dest->type |= (src->type & ~VF_DONTTOUCH);
dest->number = src->number;
if (src->string)
dest->string = xstrdup(src->string);
}
handle_special(dest);
return dest;
}
static var *incvar(var *v) {
return setvar_i(v, getvar_i(v)+1.);
}
/* return true if v is number or numeric string */
static int is_numeric(var *v) {
getvar_i(v);
return ((v->type ^ VF_DIRTY) & (VF_NUMBER | VF_USER | VF_DIRTY));
}
/* return 1 when value of v corresponds to true, 0 otherwise */
static int istrue(var *v) {
if (is_numeric(v))
return (v->number == 0) ? 0 : 1;
else
return (v->string && *(v->string)) ? 1 : 0;
}
/* temporary variables allocator. Last allocated should be first freed */
static var *nvalloc(int n) {
nvblock *pb = NULL;
var *v, *r;
int size;
while (cb) {
pb = cb;
if ((cb->pos - cb->nv) + n <= cb->size) break;
cb = cb->next;
}
if (! cb) {
size = (n <= MINNVBLOCK) ? MINNVBLOCK : n;
cb = (nvblock *)xmalloc(sizeof(nvblock) + size * sizeof(var));
cb->size = size;
cb->pos = cb->nv;
cb->prev = pb;
cb->next = NULL;
if (pb) pb->next = cb;
}
v = r = cb->pos;
cb->pos += n;
while (v < cb->pos) {
v->type = 0;
v->string = NULL;
v++;
}
return r;
}
static void nvfree(var *v) {
var *p;
if (v < cb->nv || v >= cb->pos)
runtime_error(EMSG_INTERNAL_ERROR);
for (p=v; p<cb->pos; p++) {
if ((p->type & (VF_ARRAY|VF_CHILD)) == VF_ARRAY) {
clear_array(iamarray(p));
free(p->x.array->items);
free(p->x.array);
}
if (p->type & VF_WALK)
free(p->x.walker);
clrvar(p);
}
cb->pos = v;
while (cb->prev && cb->pos == cb->nv) {
cb = cb->prev;
}
}
/* ------- awk program text parsing ------- */
/* Parse next token pointed by global pos, place results into global t.
* If token isn't expected, give away. Return token class
*/
static unsigned long next_token(unsigned long expected) {
char *p, *pp, *s;
char *tl;
unsigned long tc, *ti;
int l;
static int concat_inserted = FALSE;
static unsigned long save_tclass, save_info;
static unsigned long ltclass = TC_OPTERM;
if (t.rollback) {
t.rollback = FALSE;
} else if (concat_inserted) {
concat_inserted = FALSE;
t.tclass = save_tclass;
t.info = save_info;
} else {
p = pos;
readnext:
skip_spaces(&p);
lineno = t.lineno;
if (*p == '#')
while (*p != '\n' && *p != '\0') p++;
if (*p == '\n')
t.lineno++;
if (*p == '\0') {
tc = TC_EOF;
} else if (*p == '\"') {
/* it's a string */
t.string = s = ++p;
while (*p != '\"') {
if (*p == '\0' || *p == '\n')
syntax_error(EMSG_UNEXP_EOS);
*(s++) = nextchar(&p);
}
p++;
*s = '\0';
tc = TC_STRING;
} else if ((expected & TC_REGEXP) && *p == '/') {
/* it's regexp */
t.string = s = ++p;
while (*p != '/') {
if (*p == '\0' || *p == '\n')
syntax_error(EMSG_UNEXP_EOS);
if ((*s++ = *p++) == '\\') {
pp = p;
*(s-1) = process_escape_sequence((const char **)&p);
if (*pp == '\\') *s++ = '\\';
if (p == pp) *s++ = *p++;
}
}
p++;
*s = '\0';
tc = TC_REGEXP;
} else if (*p == '.' || isdigit(*p)) {
/* it's a number */
t.number = strtod(p, &p);
if (*p == '.')
syntax_error(EMSG_UNEXP_TOKEN);
tc = TC_NUMBER;
} else {
/* search for something known */
tl = tokenlist;
tc = 0x00000001;
ti = tokeninfo;
while (*tl) {
l = *(tl++);
if (l == NTCC) {
tc <<= 1;
continue;
}
/* if token class is expected, token
* matches and it's not a longer word,
* then this is what we are looking for
*/
if ((tc & (expected | TC_WORD | TC_NEWLINE)) &&
*tl == *p && strncmp(p, tl, l) == 0 &&
!((tc & TC_WORD) && isalnum_(*(p + l)))) {
t.info = *ti;
p += l;
break;
}
ti++;
tl += l;
}
if (! *tl) {
/* it's a name (var/array/function),
* otherwise it's something wrong
*/
if (! isalnum_(*p))
syntax_error(EMSG_UNEXP_TOKEN);
t.string = --p;
while(isalnum_(*(++p))) {
*(p-1) = *p;
}
*(p-1) = '\0';
tc = TC_VARIABLE;
if (*p == '(') {
tc = TC_FUNCTION;
} else {
skip_spaces(&p);
if (*p == '[') {
p++;
tc = TC_ARRAY;
}
}
}
}
pos = p;
/* skipping newlines in some cases */
if ((ltclass & TC_NOTERM) && (tc & TC_NEWLINE))
goto readnext;
/* insert concatenation operator when needed */
if ((ltclass&TC_CONCAT1) && (tc&TC_CONCAT2) && (expected&TC_BINOP)) {
concat_inserted = TRUE;
save_tclass = tc;
save_info = t.info;
tc = TC_BINOP;
t.info = OC_CONCAT | SS | P(35);
}
t.tclass = tc;
}
ltclass = t.tclass;
/* Are we ready for this? */
if (! (ltclass & expected))
syntax_error((ltclass & (TC_NEWLINE | TC_EOF)) ?
EMSG_UNEXP_EOS : EMSG_UNEXP_TOKEN);
return ltclass;
}