forked from DeaDBeeF-Player/deadbeef
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tf.c
2996 lines (2597 loc) · 85.5 KB
/
tf.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
/*
DeaDBeeF -- the music player
Copyright (C) 2009-2014 Alexey Yakovenko and other contributors
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
// basic syntax:
// function call: $function([arg1[,arg2[,...]]])
// meta fields, with spaces allowed: %field name%
// if_defined block: [text$func()%field%more text]
// plain text: anywhere outside of the above
// escaping: $, %, [, ], \ must be escaped
// bytecode format
// 0: indicates start of special block
// 1: function call
// func_idx:byte, num_args:byte, arg1_len:uint16[,arg2_len:byte[,...]]
// 2: meta field
// len:byte, data
// 3: if_defined block
// len:int32, data
// 4: pre-interpreted text
// len:int32, data
// 5: text dimming block
// dim_amount:int8, len:int32, data
// !0: plain text
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <ctype.h>
#include <inttypes.h>
#include <math.h>
#include <assert.h>
#include "streamer.h"
#include "utf8.h"
#include "playlist.h"
#include "playqueue.h"
#include "tf.h"
#include "gettext.h"
#include "plugins.h"
#include "junklib.h"
#define min(x,y) ((x)<(y)?(x):(y))
//#define trace(...) { fprintf(stderr, __VA_ARGS__); }
#define trace(fmt,...)
// check the presence of `dimmed` field in context, based on reported size
#define HAS_DIMMED(ctx) (ctx->_size > (char *)&ctx->dimmed - (char *)ctx)
typedef struct {
const char *i;
char *o;
int eol;
} tf_compiler_t;
typedef int (*tf_func_ptr_t)(ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef);
#define TF_MAX_FUNCS 0xff
typedef struct {
const char *name;
tf_func_ptr_t func;
} tf_func_def;
static int
tf_eval_int (ddb_tf_context_t *ctx, const char *code, int size, char *out, int outlen, int *bool_out, int fail_on_undef);
static const char *
_tf_get_combined_value (playItem_t *it, const char *key, int *needs_free);
#define TF_EVAL_CHECK(res, ctx, arg, arg_len, out, outlen, fail_on_undef)\
res = tf_eval_int (ctx, arg, arg_len, out, outlen, &bool_out, fail_on_undef);\
if (res < 0) { *out = 0; return -1; }
// empty track is used when ctx.it is null
static playItem_t empty_track;
// empty playlist is used when ctx.plt is null
static playlist_t empty_playlist;
// empty code is used when "code" argumen is null
static char empty_code[4] = {0};
static int
snprintf_clip (char *buf, size_t len, const char *fmt, ...) {
va_list ap;
va_start(ap, fmt);
int n = vsnprintf(buf, len, fmt, ap);
va_end(ap);
if (n < 0) {
*buf = 0;
return 0;
}
return (int)min (n, len-1);
}
int
tf_eval (ddb_tf_context_t *ctx, const char *code, char *out, int outlen) {
if (
// 0.7.2
ctx->_size != (char *)&ctx->dimmed - (char *)ctx
// 0.8
&& ctx->_size != sizeof (ddb_tf_context_t)
) {
*out = 0;
return -1;
}
if (!code) {
code = empty_code;
}
int null_it = 0;
if (!ctx->it) {
null_it = 1;
ctx->it = (ddb_playItem_t *)&empty_track;
}
int null_plt = 0;
if (!ctx->plt) {
null_plt = 1;
ctx->plt = (ddb_playlist_t *)&empty_playlist;
}
int32_t codelen = *((int32_t *)code);
code += 4;
memset (out, 0, outlen);
int l = 0;
int bool_out = 0;
int id = -1;
if (ctx->flags & DDB_TF_CONTEXT_HAS_ID) {
id = ctx->id;
}
if (HAS_DIMMED (ctx)) {
ctx->dimmed = 0;
}
switch (id) {
case DB_COLUMN_FILENUMBER:
if (ctx->flags & DDB_TF_CONTEXT_HAS_INDEX) {
l = snprintf_clip (out, outlen, "%d", ctx->idx+1);
}
else if (ctx->plt) {
int idx = plt_get_item_idx ((playlist_t *)ctx->plt, (playItem_t *)ctx->it, PL_MAIN);
l = snprintf_clip (out, outlen, "%d", idx+1);
}
break;
case DB_COLUMN_PLAYING:
l = pl_format_item_queue ((playItem_t *)ctx->it, out, outlen);
break;
default:
// tf_eval_int expects outlen to not include the terminating zero
l = tf_eval_int (ctx, code, codelen, out, outlen-1, &bool_out, 0);
break;
}
if (!(ctx->flags & DDB_TF_CONTEXT_MULTILINE)) {
// replace any unprintable char with '_'
for (; *out; out++) {
if ((uint8_t)(*out) < ' ') {
if (*out == '\033' && (ctx->flags & DDB_TF_CONTEXT_TEXT_DIM)) {
continue;
}
*out = '_';
}
}
}
if (null_it) {
ctx->it = NULL;
}
if (null_plt) {
ctx->plt = NULL;
}
return l;
}
// $greater(a,b) returns true if a is greater than b, otherwise false
int
tf_func_greater (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 2) {
return -1;
}
const char *arg = args;
int bool_out = 0;
char a[10];
int len;
TF_EVAL_CHECK(len, ctx, arg, arglens[0], a, sizeof (a), fail_on_undef);
int aa = atoi (a);
arg += arglens[0];
char b[10];
TF_EVAL_CHECK(len, ctx, arg, arglens[1], b, sizeof (b), fail_on_undef);
int bb = atoi (b);
return aa > bb;
}
// $strcmp(s1,s2) compares s1 and s2, returns true if equal, otherwise false
int
tf_func_strcmp (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 2) {
return -1;
}
const char *arg = args;
int bool_out = 0;
char s1[1000];
int len;
TF_EVAL_CHECK(len, ctx, arg, arglens[0], s1, sizeof (s1), fail_on_undef);
arg += arglens[0];
char s2[1000];
TF_EVAL_CHECK(len, ctx, arg, arglens[1], s2, sizeof (s2), fail_on_undef);
int res = strcmp (s1, s2);
return !res;
}
// $upper(str) converts a string to uppercase
int
tf_func_upper (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
char temp_str[1000];
TF_EVAL_CHECK(len, ctx, args, arglens[0], temp_str, sizeof (temp_str), fail_on_undef);
char *pout = out;
char *p = temp_str;
while (*p && outlen > 0) {
uint32_t i = 0;
u8_nextchar (p, &i);
if (i > outlen) {
break;
}
int l = u8_toupper (p, i, pout);
p += i;
pout += l;
outlen -= l;
}
return (int)(pout - out);
}
// $lower(str) converts a string to lowercase
int
tf_func_lower (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
char temp_str[1000];
TF_EVAL_CHECK(len, ctx, args, arglens[0], temp_str, sizeof (temp_str), fail_on_undef);
char *pout = out;
char *p = temp_str;
while (*p && outlen > 0) {
uint32_t i = 0;
u8_nextchar (p, &i);
if (i > outlen) {
break;
}
int l = u8_tolower (p, i, pout);
p += i;
pout += l;
outlen -= l;
}
return (int)(pout - out);
}
// $num(n,len) Formats the integer number n in decimal notation with len characters. Pads with zeros
// from the left if necessary. len includes the dash when the number is negative. If n is not numeric, it is treated as zero.
int
tf_func_num (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
const char *arg = args;
int bool_out = 0;
int len;
if (argc != 2) {
return -1;
}
TF_EVAL_CHECK(len, ctx, arg, arglens[0], out, outlen, fail_on_undef);
arg += arglens[0];
int n = atoi (out);
TF_EVAL_CHECK(len, ctx, arg, arglens[1], out, outlen, fail_on_undef);
int n_len = atoi (out);
if (outlen < 1 || outlen < n_len) {
*out = 0;
return -1;
}
if (n_len < 0) {
n_len = 0;
}
char *out_w = out;
int is_negative = n < 0;
int num_len = 0;
int cnt = n;
do {
num_len++;
cnt /= 10;
} while (cnt);
if (is_negative) {
*out_w++ = '-';
num_len++;
n *= -1;
}
int num_len_plus_padding = num_len;
while (num_len_plus_padding < n_len) {
*out_w++ = '0';
num_len_plus_padding++;
}
out_w += num_len - is_negative;
do {
*--out_w = (n % 10) + '0';
n /= 10;
} while (n);
return n_len > num_len ? n_len : num_len;
}
// $replace(subject, search, replace, ...) Replaces all occurrences of `search`
// substring in `subject` with `replace`. Accepts multiple search and replace
// substrings
int
tf_func_replace (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc < 3 || argc % 2 == 0) {
return -1;
}
int bool_out = 0;
int i;
const char *arg = args;
char buf[2000];
char *lines[argc];
int lens[argc];
char *ptr = buf;
for (i = 0; i < argc; ++i) {
lines[i] = ptr;
TF_EVAL_CHECK (lens[i], ctx, arg, arglens[i], ptr, (int)(buf+sizeof(buf)-ptr), fail_on_undef);
ptr += lens[i]+1;
arg += arglens[i];
}
char *optr = out;
const char *iptr = lines[0];
for (;;) {
int chunklen = (int)(lines[0] + lens[0] - iptr); //chunk is a substring before the found needle
int idx = -1; //index of the found needle
for (i = 0; i < (argc - 1) / 2; ++i) {
char *found = strstr (iptr, lines[i*2+1]);
if (found && found - iptr < chunklen) {
chunklen = (int)(found - iptr);
idx = i;
}
}
if (chunklen > out + outlen - optr)
return -1;
memcpy (optr, iptr, chunklen);
optr += chunklen;
if (idx == -1) //nothing found
break;
if (lens[idx*2+2] > out + outlen - optr)
return -1;
memcpy (optr, lines[idx*2+2], lens[idx*2+2]);
optr += lens[idx*2+2];
iptr += chunklen + lens[idx*2+1];
}
*optr = 0;
return (int)(optr - out);
}
int
tf_func_abbr (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1 && argc != 2) {
return -1;
}
const char *arg = args;
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, arg, arglens[0], out, outlen, fail_on_undef);
if (argc == 2) {
char num_chars_str[10];
arg += arglens[0];
int l;
TF_EVAL_CHECK(l, ctx, arg, arglens[1], num_chars_str, sizeof (num_chars_str), fail_on_undef);
int num_chars = atoi (num_chars_str);
if (len <= num_chars) {
return len;
}
}
char *p = out;
char *pout = out;
const char skipchars[] = "() ,/\\|";
while (*p) {
// skip whitespace/paren
while (*p && strchr (skipchars, *p)) {
p++;
}
if (!*p) {
break;
}
// take the first letter for abbrev
int is_bracket = *p == '[' || *p == ']';
int32_t size = 0;
u8_nextchar(p, &size);
memmove (pout, p, size);
pout += size;
p += size;
// skip to the end of word
while (*p && !strchr (skipchars, *p)) {
if (!is_bracket) {
p++;
}
else {
size = 0;
u8_nextchar(p, &size);
memmove (pout, p, size);
pout += size;
p += size;
}
}
}
*pout = 0;
return (int)(pout - out);
}
int
tf_func_ansi (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
return len;
}
int
tf_func_ascii (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
char temp_str[1000];
TF_EVAL_CHECK(len, ctx, args, arglens[0], temp_str, sizeof (temp_str), fail_on_undef);
len = junk_iconv (temp_str, len, out, outlen, "utf-8", "ascii");
return len;
}
int
tf_caps_impl (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef, int do_lowercasing) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
char *p = out;
char *end = p + len;
const char skipchars[] = "() ,/\\|";
while (*p) {
// skip whitespace/paren
while (*p && strchr (skipchars, *p)) {
p++;
}
if (!*p) {
break;
}
int is_bracket = *p == '[' || *p == ']';
char temp[5];
// uppercase the first letter
int32_t size = 0;
u8_nextchar (p, &size);
int32_t uppersize = u8_toupper ((const signed char *)p, size, temp);
if (uppersize != size) {
memmove (p+uppersize, p+size, end-(p+size));
end += uppersize - size;
*end = 0;
}
memcpy (p, temp, uppersize);
p += uppersize;
// lowercase to the end of word
while (*p && !strchr (skipchars, *p)) {
if (is_bracket) {
p++;
}
else {
size = 0;
u8_nextchar ((const char *)p, &size);
if (do_lowercasing) {
int32_t lowersize = u8_tolower ((const signed char *)p, size, temp);
if (lowersize != size) {
memmove (p+lowersize, p+size, end-(p+size));
end += lowersize - size;
*end = 0;
}
memcpy (p, temp, lowersize);
p += lowersize;
}
else {
p += size;
}
}
}
}
return (int)(end - out);
}
int
tf_func_caps (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
return tf_caps_impl (ctx, argc, arglens, args, out, outlen, fail_on_undef, 1);
}
int
tf_func_caps2 (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
return tf_caps_impl (ctx, argc, arglens, args, out, outlen, fail_on_undef, 0);
}
int
tf_func_char (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
int n = atoi (out);
*out = 0;
if (outlen < 5) {
return -1;
}
len = u8_wc_toutf8 (out, n);
out[len] = 0;
return len;
}
int
tf_func_crc32 (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
static const uint32_t tab[256] = {
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
};
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
uint32_t crc = 0xffffffff;
for (int i = 0; i < len; i++) {
crc = (crc >> 8) ^ tab[(crc ^ (uint8_t)out[i]) & 0xff];
}
crc ^= 0xffffffff;
return snprintf_clip (out, outlen, "%u", crc);
}
int
tf_func_crlf (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 0 || outlen < 2) {
return -1;
}
out[0] = '\n';
out[1] = 0;
return 1;
}
// $left(text,n) returns the first n characters of text
int
tf_func_left (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 2) {
return -1;
}
const char *arg = args;
int bool_out = 0;
// get number of characters
char num_chars_str[10];
arg += arglens[0];
int len;
TF_EVAL_CHECK(len, ctx, arg, arglens[1], num_chars_str, sizeof (num_chars_str), fail_on_undef);
int num_chars = atoi (num_chars_str);
if (num_chars <= 0 || num_chars > outlen) {
*out = 0;
return -1;
}
// get text
char text[1000];
arg = args;
TF_EVAL_CHECK(len, ctx, arg, arglens[0], text, sizeof (text), fail_on_undef);
// convert num_chars to num_bytes
int num_bytes = u8_offset(text, num_chars);
int res = u8_strnbcpy (out, text, min(num_bytes, outlen));
return res;
}
// $repeat(expr,count): repeat `count` copies of `expr`
int
tf_func_repeat (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 2) {
return -1;
}
const char *arg = args;
int bool_out = 0;
// get repeat count
char num_chars_str[10];
arg += arglens[0];
int len;
TF_EVAL_CHECK(len, ctx, arg, arglens[1], num_chars_str, sizeof (num_chars_str), fail_on_undef);
int repeat_count = atoi (num_chars_str);
if (repeat_count < 0) {
*out = 0;
return -1;
}
else if (repeat_count == 0) {
// early out on zero repeat count
*out = 0;
return 0;
}
// get expr
char text[1000];
arg = args;
TF_EVAL_CHECK(len, ctx, arg, arglens[0], text, sizeof (text), fail_on_undef);
int res=0;
for (int i = 0; i < repeat_count; i++) {
if (res + len > outlen) {
break;
}
res += u8_strnbcpy (out + len * i, text, len);
}
return res;
}
// $insert(str,insert,n): Inserts `insert` into `str` after `n` characters.
int
tf_func_insert (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 3) {
return -1;
}
const char *arg = args;
int bool_out = 0;
int len, str_len, insert_len;
// get str
char str[1000];
arg = args;
TF_EVAL_CHECK(str_len, ctx, arg, arglens[0], str, sizeof (str), fail_on_undef);
int str_chars = u8_strlen(str);
// get insert
char insert[1000];
arg += arglens[0];
TF_EVAL_CHECK(insert_len, ctx, arg, arglens[1], insert, sizeof (insert), fail_on_undef);
// get insertion point
char num_chars_str[10];
arg += arglens[1];
TF_EVAL_CHECK(len, ctx, arg, arglens[2], num_chars_str, sizeof (num_chars_str), fail_on_undef);
int insertion_point = atoi (num_chars_str);
if (insertion_point < 0) {
*out = 0;
return -1;
}
if (insertion_point > str_chars) {
insertion_point = str_chars;
}
// convert num_chars to num_bytes
int nb_before = u8_offset (str, insertion_point);
int nb_after = u8_offset (str + nb_before, str_chars - insertion_point);
int l;
int res = 0;
l = u8_strnbcpy(out, str, min (nb_before, outlen));
outlen -= l;
out += l;
res += l;
l = u8_strnbcpy(out, insert, min (insert_len, outlen));
outlen -= l;
out += l;
res += l;
l = u8_strnbcpy(out, str + nb_before, min (nb_after, outlen));
outlen -= l;
out += l;
res += l;
return res;
}
// $len(expr): returns lenght of `expr`
int
tf_func_len (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc != 1) {
return -1;
}
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
return snprintf_clip(out, outlen, "%d", u8_strlen(out));
}
// $pad(expr,len[, char]): If `expr` is shorter than len characters, the function adds `char` characters (if present otherwise
// spaces) to the right of `expr` to make the result `len` characters long. Otherwise the function returns str unchanged.
int
tf_func_pad_impl (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef, int right) {
if (argc < 1 || argc > 3) {
return -1;
}
int bool_out = 0;
int len, str_len;
const char *arg = args;
char pad_char_str[10] = " ";
int nb_pad_char=1;
// get expr
char str[1000];
TF_EVAL_CHECK(str_len, ctx, args, arglens[0], str, sizeof(str), fail_on_undef);
// get len
char num_chars_str[10];
arg += arglens[0];
TF_EVAL_CHECK(len, ctx, arg, arglens[1], num_chars_str, sizeof (num_chars_str), fail_on_undef);
int padlen_chars = atoi (num_chars_str);
if (padlen_chars < 0) {
*out = 0;
return -1;
}
// get char
if (argc == 3) {
arg += arglens[1];
TF_EVAL_CHECK(len, ctx, arg, arglens[2], pad_char_str, sizeof (pad_char_str), fail_on_undef);
// only accept first character
nb_pad_char = u8_offset(pad_char_str, 1);
pad_char_str[nb_pad_char] = 0;
}
int str_chars = u8_strlen(str);
if (str_chars >= padlen_chars) {
u8_strnbcpy(out, str, min (str_len, outlen));
return str_len;
}
int res=0,l;
int repeat_count = padlen_chars-str_chars;
if (!right) {
l = u8_strnbcpy(out, str, min (str_len, outlen));
outlen -= l;
out += l;
res += l;
}
for (int i = 0; i < repeat_count && outlen; i++) {
l = u8_charcpy (out, pad_char_str, nb_pad_char);
outlen -= l;
out += l;
res += l;
}
if (right) {
l = u8_strnbcpy(out, str, min (str_len, outlen));
outlen -= l;
out += l;
res += l;
}
out[res] = 0;
return res;
}
int
tf_func_pad (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
return tf_func_pad_impl (ctx, argc, arglens, args, out, outlen, fail_on_undef, 0);
}
// $pad_right(expr,len[,char]): same as $pad but right aligns string
int
tf_func_pad_right (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
return tf_func_pad_impl (ctx, argc, arglens, args, out, outlen, fail_on_undef, 1);
}
int
tf_func_directory (ddb_tf_context_t *ctx, int argc, const uint16_t *arglens, const char *args, char *out, int outlen, int fail_on_undef) {
if (argc < 1 || argc > 2) {
return -1;
}
int bool_out = 0;
int len;
TF_EVAL_CHECK(len, ctx, args, arglens[0], out, outlen, fail_on_undef);
int path_len = len;
int levels = 1;
if (argc == 2) {
char temp[20];
args += arglens[0];
TF_EVAL_CHECK(len, ctx, args, arglens[1], temp, sizeof (temp), fail_on_undef);
levels = atoi (temp);
if (levels < 0) {
return -1;
}
}
char *end = out + path_len - 1;
char *start = end;
while (levels--) {
// get to the last delimiter
while (end >= out && *end != '/') {
end--;
}
if (end < out) {
*out = 0;
return -1;
}
// skip multiple delimiters
while (end >= out && *end == '/') {
end--;
}
end++;
if (end < out) {
*out = 0;
return -1;
}
// find another delimiter
start = end - 1;
while (start > out && *start != '/') {
start--;
}
if (*start == '/') {
start++;
}
if (levels) {
end = start;
while (end >= out && *end == '/') {
end--;
}
}
}
memmove (out, start, end-start);