forked from mbert/elvis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
calc.c
2929 lines (2690 loc) · 65.9 KB
/
calc.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
/* calc.c */
/* Copyright 1995 by Steve Kirkendall */
#include "elvis.h"
#ifdef FEATURE_RCSID
char id_calc[] = "$Id: calc.c,v 2.145 2004/03/14 23:18:52 steve Exp $";
#endif
#ifdef TRY
# undef FEATURE_CALC
# define FEATURE_CALC 1
#endif
#include <setjmp.h>
#ifdef TRY
# include <getopt.h>
# undef o_true
# define o_true "True"
# undef o_false
# define o_false "False"
# define elvdigit isdigit
# define elvupper isupper
# define elvlower islower
# define elvalnum isalnum
# define elvcntrl iscntrl
# define elvspace isspace
# define elvtoupper toupper
# define elvtolower tolower
# if USE_PROTOTYPES
extern int isdigit(int c);
extern int isupper(int c);
extern int islower(int c);
extern int isalnum(int c);
extern int iscntrl(int c);
extern int isspace(int c);
extern int toupper(int c);
extern int tolower(int c);
# endif
# define safedup(s) strdup(s)
# define safefree(p) free(p)
#endif /* TRY */
#ifdef FEATURE_CALC
# if USE_PROTOTYPES
static int copyname(CHAR *dest, CHAR *src, ELVBOOL num);
static ELVBOOL func(CHAR *name, CHAR *arg);
static ELVBOOL apply(void);
static CHAR *applyall(int prec);
static CHAR *maybeconcat(CHAR *build, int base, ELVBOOL asmsg);
# ifdef FEATURE_ARRAY
static CHAR *nextelement(CHAR *element, CHAR **setref);
static CHAR *subnum(CHAR *cp, long nelem, long *from, long *to);
# endif
# endif /* USE_PROTOTYPES */
#endif /* FEATURE_CALC */
#ifndef TRY
#ifdef FEATURE_CALC
static CHAR *feature[] =
{
# ifdef PROTOCOL_HTTP
toCHAR("http"),
# endif
# ifdef PROTOCOL_FTP
toCHAR("ftp"),
# endif
# ifdef FEATURE_ALIAS
toCHAR("alias"),
# endif
# ifdef FEATURE_ARRAY
toCHAR("array"),
# endif
# ifdef FEATURE_AUTOCMD
toCHAR("autocmd"),
# endif
# ifdef FEATURE_BACKTICK
toCHAR("backtick"),
# endif
# ifdef FEATURE_BROWSE
toCHAR("browse"),
# endif
# ifdef FEATURE_CACHEDESC
toCHAR("cachedesc"),
# endif
# ifdef FEATURE_CALC
toCHAR("calc"),
# endif
# ifdef FEATURE_COMPLETE
toCHAR("complete"),
# endif
# ifdef FEATURE_EQUALTILDE
toCHAR("equaltilde"),
# endif
# ifdef FEATURE_FOLD
toCHAR("fold"),
# endif
# ifdef FEATURE_G
toCHAR("g"),
# endif
# ifdef FEATURE_HLOBJECT
toCHAR("hlobject"),
# endif
# ifdef FEATURE_HLSEARCH
toCHAR("hlsearch"),
# endif
# ifdef FEATURE_IMAGE
toCHAR("image"),
# endif
# ifdef FEATURE_INCSEARCH
toCHAR("incsearch"),
# endif
# ifdef FEATURE_LISTCHARS
toCHAR("listchars"),
# endif
# ifdef FEATURE_LITRE
toCHAR("litre"),
# endif
# ifdef FEATURE_LPR
toCHAR("lpr"),
# endif
# ifdef FEATURE_MAKE
toCHAR("make"),
# endif
# ifdef FEATURE_MAPDB
toCHAR("mapdb"),
# endif
# ifdef FEATURE_MISC
toCHAR("misc"),
# endif
# ifdef FEATURE_MKEXRC
toCHAR("mkexrc"),
# endif
# ifdef FEATURE_NORMAL
toCHAR("normal"),
# endif
# ifdef FEATURE_PERSIST
toCHAR("persist"),
# endif
# ifdef FEATURE_PROTO
toCHAR("proto"),
# endif
# ifdef FEATURE_RAM
toCHAR("ram"),
# endif
# ifdef FEATURE_RCSID
toCHAR("rcsid"),
# endif
# ifdef FEATURE_REGION
toCHAR("region"),
# endif
# ifdef FEATURE_SHOWTAG
toCHAR("showtag"),
# endif
# ifdef FEATURE_SMARTARGS
toCHAR("smartargs"),
# endif
# ifdef FEATURE_SPELL
toCHAR("spell"),
# endif
# ifdef FEATURE_SPLIT
toCHAR("split"),
# endif
# ifdef FEATURE_STDIN
toCHAR("stdin"),
# endif
# ifdef FEATURE_TAGS
toCHAR("tags"),
# endif
# ifdef FEATURE_TEXTOBJ
toCHAR("textobj"),
# endif
# ifdef FEATURE_V
toCHAR("v"),
# endif
# ifdef FEATURE_XFT
toCHAR("xft"),
# endif
NULL
};
#endif /* FEATURE_CALC */
#endif /* !TRY */
#ifdef FEATURE_CALC
/* This array describes the operators */
static struct
{
char *name; /* name of the operator */
short prec; /* natural precedence of the operator */
char code; /* function code for applying operator */
char subcode;/* details, depend on function */
} opinfo[] =
{
{"Func",1, 'f', '('},
{"Cat", 17, 'c', ' '},
{"Sub", 18, 'a', '['},
{";", 2, 'c', ';'},
{",", 2, 'c', ','},
{"..", 3, 'c', '.'},
{"||", 6, 'b', '|'},
{"&&", 7, 'b', '&'},
{"!=", 11, 's', '!'},
{"==", 11, 's', '='},
{"<=", 12, 's', 'l'},
{">=", 12, 's', 'g'},
{"<<", 13, 'i', '<'},
{">>", 13, 'i', '>'},
{":", 5, 't', ':'},
{"?", 4, 't', '?'},
{"|", 8, 'i', '|'},
{"^", 9, 'i', '^'},
{"&", 10, 'i', '&'},
{"=", 11, 's', '='},
{"<", 12, 's', '<'},
{">", 12, 's', '>'},
{"+", 14, 'i', '+'},
{"-", 14, 'i', '-'},
{"%", 15, 'i', '%'},
{"*", 15, 'i', '*'},
{"/", 15, 'i', '/'},
{"!", 16, 'u', '!'},
{"~", 16, 'u', '~'},
};
/* The following variables are used during the evaluation of each expression */
static struct
{
CHAR *first; /* first argument to operator */
int idx; /* index into opinfo of the operator */
int prec; /* precedence of operator */
} opstack[10];
static int ops; /* stack pointer for opstack[] */
/* The following variables are used for storing the parenthesis level */
static CHAR *parstack[20];
/* ultimately, the result returned by calculate() */
static CHAR result[1024];
#define RESULT_END (&result[QTY(result) - 3])
#define RESULT_AVAIL(from) ((int)(RESULT_END - (CHAR *)(from)))
#define RESULT_OVERFLOW(from, need) (RESULT_AVAIL(from) < (int)(need))
#define UNSAFE if (o_security == 'r') goto Unsafe
#endif /* FEATURE_CALC */
/* This function returns ElvTrue iff a string looks like an integer */
ELVBOOL calcnumber(str)
CHAR *str; /* a nul-terminated string to check */
{
ELVBOOL dp = ElvFalse; /* has decimal point been seen yet? */
/* allow a leading "-" */
if (*str == '-')
str++;
/* The only decimal number that can start with '0' is zero */
if (str[0] == '0' && str[1])
return ElvFalse;
/* Require at least one digit, and don't allow any non-digits */
do
{
if (*str == '.' && dp == ElvFalse && str[1])
dp = ElvTrue;
else if (!elvdigit(*str))
return ElvFalse;
} while (*++str);
return ElvTrue;
}
#ifdef FEATURE_CALC
/* This function returns ElvTrue if passed a string which looks like a number,
* and ElvFalse if it doesn't. This function differs from calcnumber() in that
* this one also converts octal numbers, hex numbers, and literal characters
* to base ten. Note that the length of the string may change.
*/
ELVBOOL calcbase10(str)
CHAR *str;
{
long num;
int i;
/* do the easy tests first */
if (calcnumber(str)) return ElvTrue;
if (*str != '0' && *str != '\'') return ElvFalse;
if (str[0] == '\'')
{
if (str[1] == '\\')
{
if (!str[2] || str[3] != '\'')
return ElvFalse;
switch (str[2])
{
case '0': num = 0; break;
case 'a': num = '\007'; break;
case 'b': num = '\b'; break;
case 'E':
case 'e': num = '\033'; break;
case 'f': num = '\f'; break;
case 'n': num = '\n'; break;
case 'r': num = '\r'; break;
case 't': num = '\t'; break;
default: num = str[2]; break;
}
i = 4;
}
else
{
if (str[1] == '\\' || !str[1] || str[2] != '\'')
return ElvFalse;
num = str[1];
i = 3;
}
}
else if (str[1] == 'x')
{
/* is it hex? */
for (i = 2, num = 0; ; i++)
{
if (str[i] >= '0' && str[i] <= '9')
num = num * 16 + str[i] - '0';
else if (str[i] >= 'a' && str[i] <= 'f')
num = num * 16 + str[i] - 'a' + 10;
else
break;
}
}
else
{
/* is it octal? */
for (i = 1, num = 0; ; i++)
{
if (str[i] >= '0' && str[i] <= '7')
num = num * 8 + str[i] - '0';
else
break;
}
}
/* If we hit a problem before the end of the string, it isn't a number */
if (str[i]) return ElvFalse;
/* We have a number! Convert to decimal */
long2CHAR(str, num);
return ElvTrue;
}
#endif /* FEATURE_CALC */
/* This function returns ElvFalse if the string looks like any kind of "false"
* value, and ElvTrue otherwise. The false values are "", "0", "false", "no",
* and the value of the `false' option.
*/
ELVBOOL calctrue(str)
CHAR *str; /* the sting to be checked */
{
if (!str || !*str || !CHARcmp(str, toCHAR("0"))
|| !CHARcmp(str, toCHAR("false")) || !CHARcmp(str, toCHAR("no"))
|| (o_false && !CHARcmp(str, o_false)))
{
return ElvFalse;
}
return ElvTrue;
}
#ifdef FEATURE_CALC
# ifdef FEATURE_ARRAY
/* parse the next number in a subscript, and return a pointer to the point after
* it. If there is no next number, then return NULL. Sets *from and *to to
* the values, or to 1/nelem if a '.' was involved.
*/
static CHAR *subnum(cp, nelem, from, to)
CHAR *cp; /* number field */
long nelem; /* number of elements */
long *from; /* where to store "from" */
long *to; /* where to store "to" */
{
ELVBOOL neg;
ELVBOOL from1, tonelem;
long val;
/* skip whitespace or commas */
while (*cp && (elvspace(*cp) || *cp == ','))
cp++;
if (!*cp)
return NULL;
/* notice a "." indicating that all earlier items should be included */
if ((from1 = (ELVBOOL)(*cp == '.')) == ElvTrue)
cp++;
/* notice a "-" sign */
if ((neg = (ELVBOOL)(*cp == '-')) == ElvTrue)
cp++;
/* expect a digit or '?'. If not a digit or '?' then fail */
if (!elvdigit(*cp) && *cp != '?')
return NULL;
/* convert the number */
if (*cp == '?')
{
val = rand() % nelem + 1;
cp++;
}
else
{
for (val = 0; elvdigit(*cp); cp++)
val = val * 10 + (*cp - '0');
}
/* notice a "." indicating that later items should be included */
if ((tonelem = (ELVBOOL)(*cp == '.')) == ElvTrue)
cp++;
/* return the appropriate stuff */
if (val > nelem)
val = nelem + 1;
else if (neg && val != 0)
val = nelem + 1 - val;
*from = from1 ? 1L : val;
*to = tonelem ? nelem : val;
return cp;
}
/* For a given array, calculate the start & end points of a subscript.
* Stores the information in "chunks", and returns the delimiter.
*/
_CHAR_ calcsubscript(array, sub, max, chunks)
CHAR *array; /* array, as a string with delimiters */
CHAR *sub; /* subscript, as a string of numbers & other symbols */
int max; /* sizeof of "chunks" output array */
CHUNK *chunks;/* output array */
{
static CHAR nstr[20];/* number of elements, as a string */
long nelem; /* number of elements */
int chunk; /* next element of chunks[] to use */
CHAR delim; /* delimiter char, if not whitespace */
long start, end;/* index numbers of start & end of chunk */
long lt1, lt2 = 0;/* some other index number */
CHAR *cp;
int len;
/* check for field name instead of subscripts */
if (elvalpha(*sub))
{
/* check length -- if field name is longer than array, then
* there is no such field.
*/
chunks[0].ptr = NULL;
len = CHARlen(sub);
if ((int)CHARlen(array) <= len)
return ' ';
/* search for the name at the start of a comma-delimited item,
* followed by ':'.
*/
for (cp = array;
((cp != array && cp[-1] != ',')
|| cp[len] != ':'
|| CHARncmp(cp, sub, len));
cp++)
{
/* if hit end without finding field, then fail */
if (cp[len] == '\0')
return ' ';
}
/* find the length of the field's value */
for (chunks[0].ptr = cp += len + 1; *cp && *cp != ','; cp++)
{
}
chunks[0].len = (int)(cp - chunks[0].ptr);
chunks[1].ptr = NULL;
return ' ';
}
/* check for delimiter at start of sub */
if (!sub[0])
delim = '\0';
else if (sub[1] == ',')
{
if (!elvdigit(*sub))
delim = sub[0], sub += 2;
else
delim = ' ';
}
else if (sub[0] == ',')
delim = '\0';
else if (!elvalnum(*sub) && !elvspace(*sub) && !CHARchr(toCHAR("?-."), *sub))
delim = *sub++;
else
delim = ' ';
/* count the elements */
if (delim == '\0')
nelem = CHARlen(array);
else if (delim == ' ')
{
for (cp = array, nelem = 0; *cp; cp++)
if ((cp == array || elvspace(cp[-1])) && !elvspace(*cp))
nelem++;
}
else /* some other delimiter */
{
for (cp = array, nelem = 1; *cp; cp++)
if (*cp == delim)
nelem++;
}
long2CHAR(nstr, nelem);
/* for each chunk... */
for (chunk = 0; chunk < max - 1; chunk++)
{
/* get a number from subscripts string */
sub = subnum(sub, nelem, &start, &end);
if (!sub)
break;
/* combine following numbers as part of this chunk if possible*/
if (start != 0)
{
while ((cp = subnum(sub, nelem, <1, <2)) != NULL
&& end + 1 == lt1)
{
sub = cp;
end = lt2;
}
}
/* now we know this chunk extends from the start of the
* "from" item to the end of the "to" item.
*/
if (end < start || start > nelem)
{
/* backwards elements are ignored */
chunk--;
}
else if (start == 0L)
{
/* number of elements, regardless of what "element" means */
chunks[chunk].ptr = nstr;
chunks[chunk].len = CHARlen(nstr);
}
else if (delim == '\0')
{
/* indexed by character */
chunks[chunk].ptr = &array[start - 1];
chunks[chunk].len = end - start + 1;
}
else if (delim == ' ')
{
/* whitespace-delimited */
for (cp = array, lt1 = 0; *cp; cp++, lt2++)
{
if ((cp == array || elvspace(cp[-1]))
&& !elvspace(*cp))
{
lt1++;
if (lt1 == start)
{
chunks[chunk].ptr = cp;
lt2 = 0L;
}
}
else if (cp != array
&& !elvspace(cp[-1])
&& elvspace(*cp)
&& lt1 == end)
{
break;
}
}
chunks[chunk].len = lt2;
}
else
{
/* some other delimiter */
if (start == 1)
chunks[chunk].ptr = array;
for (cp = array, lt1 = 1; *cp; cp++)
{
if (*cp == delim)
{
if (end == lt1)
{
chunks[chunk].len = (int)(cp - chunks[chunk].ptr);
break;
}
lt1++;
if (start == lt1)
chunks[chunk].ptr = cp + 1;
}
}
if (!*cp)
chunks[chunk].len = cp - chunks[chunk].ptr;
}
}
/* mark the end of the "chunks" array */
chunks[chunk].ptr = NULL;
/* return the delimiter */
return delim;
}
# endif /* FEATURE_ARRAY */
/* This function copies characters up to the next non-alphanumeric character,
* nul-terminates the copy, and returns the number of characters copied.
*/
static int copyname(dest, src, num)
CHAR *dest; /* where to copy into */
CHAR *src; /* start of alphanumeric string to copy from */
ELVBOOL num; /* treat numbers specially? */
{
int i;
/* copy until non-alphanumeric character is encountered */
if (num && elvdigit(*src))
{
for (i = 0; elvdigit(*src); i++)
{
if (RESULT_OVERFLOW(dest, 2)) return 0;
*dest++ = *src++;
}
}
else
{
for (i = 0; elvalnum(*src) || *src == '_'; i++)
{
if (RESULT_OVERFLOW(dest, 2)) return 0;
*dest++ = *src++;
}
}
*dest = '\0';
return i;
}
/* This function implements the built-in "functions". The name indicates
* which function should be performed, and arg is its only argument. The
* result should be a string, and it should be copied over the name; func
* should then return ElvTrue to indicate success. If the function fails for
* any reason, func() should emit an error message and return ElvFalse.
*
* The functions supported are:
* strlen(string) return the number of characters in the string.
* tolower(string) returns a lowercase version of string.
* toupper(string) returns an uppercase version of string.
* isnumber(string) return "true" iff string is a decimal number
* htmlsafe(string) return an HTML-encoded version of string
* quote(chars,str) return a copy of str with backslashes before chars
* unquote(chars,str) return a copy of str with backslashes before chars
* hex(number) return a string representing the hex value of number
* octal(number) return a string representing the octal value of number
* char(number) return a single-character string
* exists(file) return "true" iff file exists
* dirperm(file) return a string indicating file attributes.
* dirfile(file) return the filename part of a pathname (including ext)
* dirname(file) return the directory part of a pathname.
* dirdir(file) return the directory, like dirname(file).
* dirext(file) return the filename extension.
* basename(file) return the filename without extension.
* elvispath(file) return the pathname of a file in elvis' path, or ""
* buffer(buf) return "true" iff buffer exist
* window(buf) return windowid if buffer is shown in a window
* newbuffer(buf) create/truncate a buffer, and return its name
* feature(name) return "true" iff the named feature is supported
* knownsyntax(file) return language if the file's extension is in elvis.syn
* current(what) return line, column, word, mode, next, prev, or tag
* line(buf,line) return text of a line
* fold(buf,line) return name of current fold, or "" if none
* color(face,attr) return attributes for a given text face
* time(file) return timestamp in "YYYY-MM-DDThh:mm:ss" format
* rand(number) return a random number between 1 and number
* spell(word) return alternate spellings, or "" if good
* spelltag(word) return alternate spellings, or "" if good
*/
static ELVBOOL func(name, arg)
CHAR *name; /* name of function to apply */
CHAR *arg; /* the argument to the function */
{
CHAR *tmp;
int i;
#ifndef TRY
int j;
char *c;
MARK begin;
MARKBUF end;
BUFFER buf;
WINDOW win;
ELVBOOL oldsaveregexp, oldmagic, bol;
regexp *re;
CHAR *fg, *bg, *like;
unsigned short bits;
#endif
if (!CHARcmp(name, toCHAR("strlen")))
{
long2CHAR(name, (long)CHARlen(arg));
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("tolower")))
{
for (; *arg; arg++)
*name++ = (elvupper(*arg) ? elvtolower(*arg) : *arg);
*name = '\0';
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("toupper")))
{
for (; *arg; arg++)
*name++ = (elvlower(*arg) ? elvtoupper(*arg) : *arg);
*name = '\0';
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("isnumber")))
{
if (RESULT_OVERFLOW(name, 6)) goto Overflow;
CHARcpy(name, calcnumber(arg) ? o_true : o_false);
return ElvTrue;
}
#ifndef TRY
else if (!CHARcmp(name, toCHAR("list")))
{
/* count the displayed with of this string */
for (tmp = arg, i = 0; *tmp; tmp++)
if (elvcntrl(*tmp))
i += 2;
else
i++;
if (RESULT_OVERFLOW(name, i)) goto Overflow;
/* Copy the arg, converting control chars to printable.
* The display string will overlap "name" on the left, and it
* may overlap the end of "arg" on the right. To prevent
* overflow from damaging the arg during conversion, we must
* create a temporary copy of it.
*/
tmp = CHARdup(arg);
for (i = j = 0; tmp[i]; i++)
if (elvcntrl(tmp[i]))
{
name[j++] = '^';
name[j++] = tmp[i] ^ '@';
}
else
name[j++] = tmp[i];
name[j] = '\0';
safefree(tmp);
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("htmlsafe")))
{
for (i = 0, tmp = NULL; arg[i]; i++)
{
switch (arg[i])
{
case '&': buildstr(&tmp, "&"); break;
case '<': buildstr(&tmp, "<"); break;
case '>': buildstr(&tmp, ">"); break;
case '"': buildstr(&tmp, """); break;
case '\t': buildCHAR(&tmp, ' '); break;
default: buildCHAR(&tmp, arg[i]);
}
}
if (tmp)
{
if (RESULT_OVERFLOW(name, CHARlen(tmp))) goto Overflow;
CHARcpy(name, tmp);
safefree(tmp);
}
else
{
*name = '\0';
}
return ElvTrue;
}
#ifdef FEATURE_MISC
else if (!CHARcmp(name, toCHAR("color")))
{
/* separate face name from attribute name */
tmp = CHARchr(arg, ',');
if (tmp)
*tmp++ = '\0';
/* decide what we're supposed to return */
if (!tmp)
j = 0;
else if (*tmp == 'f')
j = 1;
else if (*tmp == 'b')
j = 2;
else if (*tmp == 'l')
j = 3;
else if (*tmp == 's')
j = 4;
else
goto BadArgs;
/* search for the named color. Note that we don't use
* colorfind() because we don't want to add it if it hasn't
* been set.
*/
for (i = 1;
i < colornpermanent && CHARcmp(arg, colorinfo[i].name);
i++)
{
}
if (i < colornpermanent)
{
/* found! */
/* parse the color description, if necessary */
tmp = colorinfo[i].descr;
fg = bg = like = NULL;
if (j != 0 && j != 4)
colorparse(tmp, &fg, &bg, &like, &bits);
/* choose which attribute to return */
switch (j)
{
case 1: tmp = fg; break;
case 2: tmp = bg; break;
case 3: tmp = like; break;
case 4: tmp = (colorinfo[i].da.bits & COLOR_SET)
? o_true
: o_false;
break;
}
/* return it */
if (tmp)
{
if (RESULT_OVERFLOW(name, CHARlen(tmp)))
{
if (fg) safefree(fg);
if (bg) safefree(bg);
if (like) safefree(like);
goto Overflow;
}
CHARcpy(name, tmp);
}
else
{
*name = '\0';
}
if (fg) safefree(fg);
if (bg) safefree(bg);
if (like) safefree(like);
}
else
{
/* not found -- return "" */
*name = '\0';
}
return ElvTrue;
}
#endif /* FEATURE_MISC */
else if (!CHARcmp(name, toCHAR("time")))
{
if (RESULT_OVERFLOW(name, 20))
goto Overflow;
if (arg[0])
UNSAFE;
CHARcpy(name, toCHAR(dirtime(tochar8(arg))));
return ElvTrue;
}
#endif /* !TRY */
else if (!CHARcmp(name, toCHAR("hex")))
{
if (!calcnumber(arg)) goto NeedNumber;
if (RESULT_OVERFLOW(name, 10)) goto Overflow;
sprintf((char *)name, "0x%lx", CHAR2long(arg));
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("octal")))
{
if (!calcnumber(arg)) goto NeedNumber;
if (RESULT_OVERFLOW(name, 12)) goto Overflow;
sprintf((char *)name, "0%lo", CHAR2long(arg));
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("char")))
{
if (!calcnumber(arg)) goto NeedNumber;
*name++ = (CHAR)CHAR2long(arg);
*name = '\0';
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("ascii")))
{
sprintf((char *)name, "%d", *arg);
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("dirext")))
{
/* if this is a URL, and it contains a '#' or '?' character,
* then truncate it there.
*/
if ((arg[3] == ':' || arg[4] == ':')
&& ((tmp = CHARchr(arg, '#')) != NULL
|| (tmp = CHARchr(arg, '?')) != NULL))
*tmp = '\0';
/* find the last '.' in the name */
for (tmp = arg + CHARlen(arg); --tmp >= arg && elvalnum(*tmp); )
{
}
if (*tmp != '.')
{
tmp = toCHAR("");
}
CHARcpy(name, tmp);
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("rand")))
{
if (calcnumber(arg))
{
long2CHAR(name, 1 + rand() % CHAR2long(arg));
}
else
{
/* count the comma-delimited values */
for (i = 0, tmp = arg; tmp; tmp = CHARchr(tmp+1, ','))
i++;
/* choose one randomly */
i = rand() % i;
/* locate it, and return it */
tmp = arg;
if (i > 0)
for ( ; i > 0; tmp = CHARchr(tmp, ',') + 1)
i--;
for (; *tmp && *tmp != ','; )
*name++ = *tmp++;
*name = '\0';
}
return ElvTrue;
}
#ifndef TRY
else if (!CHARcmp(name, toCHAR("quote")))
{
/* divide the arg into "chars" and "str" fields */
tmp = CHARchr(arg, (CHAR)',');
if (!tmp)
{
goto Need2Args;
}
*tmp++ = '\0';
/* build a copy with backslashes */
tmp = addquotes(arg, tmp);
/* if the resulting string fits in buffer, then store it */
if (RESULT_OVERFLOW(name, CHARlen(tmp)))
goto Overflow;
CHARcpy(name, tmp);
safefree(tmp);
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("unquote")))
{
/* divide the arg into "chars" and "str" fields */
tmp = CHARchr(arg, (CHAR)',');
if (!tmp)
{
goto Need2Args;
}
*tmp++ = '\0';
/* build a copy with backslashes */
tmp = removequotes(arg, tmp);
/* store the resulting string (it *will* fit) */
CHARcpy(name, tmp);
safefree(tmp);
return ElvTrue;
}
else if (!CHARcmp(name, toCHAR("exists")))
{
UNSAFE;
#if defined(PROTOCOL_HTTP) || defined(PROTOCOL_FTP)
if (urlremote(tochar8(arg)))
{
CHARcpy(name, o_false);
}
else
#endif
{