-
Notifications
You must be signed in to change notification settings - Fork 81
/
bstraux.c
1161 lines (1025 loc) · 30.5 KB
/
bstraux.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
/*
* This source file is part of the bstring string library. This code was
* written by Paul Hsieh in 2002-2015, and is covered by the BSD open source
* license and the GPL. Refer to the accompanying documentation for details
* on usage and license.
*/
/*
* bstraux.c
*
* This file is not necessarily part of the core bstring library itself, but
* is just an auxilliary module which includes miscellaneous or trivial
* functions.
*/
#if defined (_MSC_VER)
# define _CRT_SECURE_NO_WARNINGS
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <ctype.h>
#include "bstrlib.h"
#include "bstraux.h"
#ifndef UNUSED
#define UNUSED(x) (void)(x)
#endif
/* bstring bTail (bstring b, int n)
*
* Return with a string of the last n characters of b.
*/
bstring bTail (bstring b, int n) {
if (b == NULL || n < 0 || (b->mlen < b->slen && b->mlen > 0)) return NULL;
if (n >= b->slen) return bstrcpy (b);
return bmidstr (b, b->slen - n, n);
}
/* bstring bHead (bstring b, int n)
*
* Return with a string of the first n characters of b.
*/
bstring bHead (bstring b, int n) {
if (b == NULL || n < 0 || (b->mlen < b->slen && b->mlen > 0)) return NULL;
if (n >= b->slen) return bstrcpy (b);
return bmidstr (b, 0, n);
}
/* int bFill (bstring a, char c, int len)
*
* Fill a given bstring with the character in parameter c, for a length n.
*/
int bFill (bstring b, char c, int len) {
if (b == NULL || len < 0 || (b->mlen < b->slen && b->mlen > 0)) return -__LINE__;
b->slen = 0;
return bsetstr (b, len, NULL, c);
}
/* int bReplicate (bstring b, int n)
*
* Replicate the contents of b end to end n times and replace it in b.
*/
int bReplicate (bstring b, int n) {
return bpattern (b, n * b->slen);
}
/* int bReverse (bstring b)
*
* Reverse the contents of b in place.
*/
int bReverse (bstring b) {
int i, n, m;
unsigned char t;
if (b == NULL || b->slen < 0 || b->mlen < b->slen) return -__LINE__;
n = b->slen;
if (2 <= n) {
m = ((unsigned)n) >> 1;
n--;
for (i=0; i < m; i++) {
t = b->data[n - i];
b->data[n - i] = b->data[i];
b->data[i] = t;
}
}
return 0;
}
/* int bInsertChrs (bstring b, int pos, int len, unsigned char c, unsigned char fill)
*
* Insert a repeated sequence of a given character into the string at
* position pos for a length len.
*/
int bInsertChrs (bstring b, int pos, int len, unsigned char c, unsigned char fill) {
if (b == NULL || b->slen < 0 || b->mlen < b->slen || pos < 0 || len <= 0) return -__LINE__;
if (pos > b->slen
&& 0 > bsetstr (b, pos, NULL, fill)) return -__LINE__;
if (0 > balloc (b, b->slen + len)) return -__LINE__;
if (pos < b->slen) memmove (b->data + pos + len, b->data + pos, b->slen - pos);
memset (b->data + pos, c, len);
b->slen += len;
b->data[b->slen] = (unsigned char) '\0';
return BSTR_OK;
}
/* int bJustifyLeft (bstring b, int space)
*
* Left justify a string.
*/
int bJustifyLeft (bstring b, int space) {
int j, i, s, t;
unsigned char c = (unsigned char) space;
if (b == NULL || b->slen < 0 || b->mlen < b->slen) return -__LINE__;
if (space != (int) c) return BSTR_OK;
for (s=j=i=0; i < b->slen; i++) {
t = s;
s = c != (b->data[j] = b->data[i]);
j += (t|s);
}
if (j > 0 && b->data[j-1] == c) j--;
b->data[j] = (unsigned char) '\0';
b->slen = j;
return BSTR_OK;
}
/* int bJustifyRight (bstring b, int width, int space)
*
* Right justify a string to within a given width.
*/
int bJustifyRight (bstring b, int width, int space) {
int ret;
if (width <= 0) return -__LINE__;
if (0 > (ret = bJustifyLeft (b, space))) return ret;
if (b->slen <= width)
return bInsertChrs (b, 0, width - b->slen, (unsigned char) space, (unsigned char) space);
return BSTR_OK;
}
/* int bJustifyCenter (bstring b, int width, int space)
*
* Center a string's non-white space characters to within a given width by
* inserting whitespaces at the beginning.
*/
int bJustifyCenter (bstring b, int width, int space) {
int ret;
if (width <= 0) return -__LINE__;
if (0 > (ret = bJustifyLeft (b, space))) return ret;
if (b->slen <= width)
return bInsertChrs (b, 0, (width - b->slen + 1) >> 1, (unsigned char) space, (unsigned char) space);
return BSTR_OK;
}
/* int bJustifyMargin (bstring b, int width, int space)
*
* Stretch a string to flush against left and right margins by evenly
* distributing additional white space between words. If the line is too
* long to be margin justified, it is left justified.
*/
int bJustifyMargin (bstring b, int width, int space) {
struct bstrList * sl;
int i, l, c;
if (b == NULL || b->slen < 0 || b->mlen == 0 || b->mlen < b->slen) return -__LINE__;
if (NULL == (sl = bsplit (b, (unsigned char) space))) return -__LINE__;
for (l=c=i=0; i < sl->qty; i++) {
if (sl->entry[i]->slen > 0) {
c ++;
l += sl->entry[i]->slen;
}
}
if (l + c >= width || c < 2) {
bstrListDestroy (sl);
return bJustifyLeft (b, space);
}
b->slen = 0;
for (i=0; i < sl->qty; i++) {
if (sl->entry[i]->slen > 0) {
if (b->slen > 0) {
int s = (width - l + (c / 2)) / c;
bInsertChrs (b, b->slen, s, (unsigned char) space, (unsigned char) space);
l += s;
}
bconcat (b, sl->entry[i]);
c--;
if (c <= 0) break;
}
}
bstrListDestroy (sl);
return BSTR_OK;
}
static size_t readNothing (void *buff, size_t elsize, size_t nelem, void *parm) {
UNUSED(buff);
UNUSED(elsize);
UNUSED(nelem);
UNUSED(parm);
return 0; /* Immediately indicate EOF. */
}
/* struct bStream * bsFromBstr (const_bstring b);
*
* Create a bStream whose contents are a copy of the bstring passed in.
* This allows the use of all the bStream APIs with bstrings.
*/
struct bStream * bsFromBstr (const_bstring b) {
struct bStream * s = bsopen ((bNread) readNothing, NULL);
bsunread (s, b); /* Push the bstring data into the empty bStream. */
return s;
}
static size_t readRef (void *buff, size_t elsize, size_t nelem, void *parm) {
struct tagbstring * t = (struct tagbstring *) parm;
size_t tsz = elsize * nelem;
if (tsz > (size_t) t->slen) tsz = (size_t) t->slen;
if (tsz > 0) {
memcpy (buff, t->data, tsz);
t->slen -= (int) tsz;
t->data += tsz;
return tsz / elsize;
}
return 0;
}
/* The "by reference" version of the above function. This function puts
* a number of restrictions on the call site (the passed in struct
* tagbstring *will* be modified by this function, and the source data
* must remain alive and constant for the lifetime of the bStream).
* Hence it is not presented as an extern.
*/
static struct bStream * bsFromBstrRef (struct tagbstring * t) {
if (!t) return NULL;
return bsopen ((bNread) readRef, t);
}
/* char * bStr2NetStr (const_bstring b)
*
* Convert a bstring to a netstring. See
* http://cr.yp.to/proto/netstrings.txt for a description of netstrings.
* Note: 1) The value returned should be freed with a call to bcstrfree() at
* the point when it will no longer be referenced to avoid a memory
* leak.
* 2) If the returned value is non-NULL, then it also '\0' terminated
* in the character position one past the "," terminator.
*/
char * bStr2NetStr (const_bstring b) {
char strnum[sizeof (b->slen) * 3 + 1];
bstring s;
unsigned char * buff;
if (b == NULL || b->data == NULL || b->slen < 0) return NULL;
sprintf (strnum, "%d:", b->slen);
if (NULL == (s = bfromcstr (strnum))
|| bconcat (s, b) == BSTR_ERR || bconchar (s, (char) ',') == BSTR_ERR) {
bdestroy (s);
return NULL;
}
buff = s->data;
bcstrfree ((char *) s);
return (char *) buff;
}
/* bstring bNetStr2Bstr (const char * buf)
*
* Convert a netstring to a bstring. See
* http://cr.yp.to/proto/netstrings.txt for a description of netstrings.
* Note that the terminating "," *must* be present, however a following '\0'
* is *not* required.
*/
bstring bNetStr2Bstr (const char * buff) {
int i, x;
bstring b;
if (buff == NULL) return NULL;
x = 0;
for (i=0; buff[i] != ':'; i++) {
unsigned int v = buff[i] - '0';
if (v > 9 || x > ((INT_MAX - (signed int)v) / 10)) return NULL;
x = (x * 10) + v;
}
/* This thing has to be properly terminated */
if (buff[i + 1 + x] != ',') return NULL;
if (NULL == (b = bfromcstr (""))) return NULL;
if (balloc (b, x + 1) != BSTR_OK) {
bdestroy (b);
return NULL;
}
memcpy (b->data, buff + i + 1, x);
b->data[x] = (unsigned char) '\0';
b->slen = x;
return b;
}
static char b64ETable[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
/* bstring bBase64Encode (const_bstring b)
*
* Generate a base64 encoding. See: RFC1341
*/
bstring bBase64Encode (const_bstring b) {
int i, c0, c1, c2, c3;
bstring out;
if (b == NULL || b->slen < 0 || b->data == NULL) return NULL;
out = bfromcstr ("");
for (i=0; i + 2 < b->slen; i += 3) {
if (i && ((i % 57) == 0)) {
if (bconchar (out, (char) '\015') < 0 || bconchar (out, (char) '\012') < 0) {
bdestroy (out);
return NULL;
}
}
c0 = b->data[i] >> 2;
c1 = ((b->data[i] << 4) |
(b->data[i+1] >> 4)) & 0x3F;
c2 = ((b->data[i+1] << 2) |
(b->data[i+2] >> 6)) & 0x3F;
c3 = b->data[i+2] & 0x3F;
if (bconchar (out, b64ETable[c0]) < 0 ||
bconchar (out, b64ETable[c1]) < 0 ||
bconchar (out, b64ETable[c2]) < 0 ||
bconchar (out, b64ETable[c3]) < 0) {
bdestroy (out);
return NULL;
}
}
if (i && ((i % 57) == 0)) {
if (bconchar (out, (char) '\015') < 0 || bconchar (out, (char) '\012') < 0) {
bdestroy (out);
return NULL;
}
}
switch (i + 2 - b->slen) {
case 0: c0 = b->data[i] >> 2;
c1 = ((b->data[i] << 4) |
(b->data[i+1] >> 4)) & 0x3F;
c2 = (b->data[i+1] << 2) & 0x3F;
if (bconchar (out, b64ETable[c0]) < 0 ||
bconchar (out, b64ETable[c1]) < 0 ||
bconchar (out, b64ETable[c2]) < 0 ||
bconchar (out, (char) '=') < 0) {
bdestroy (out);
return NULL;
}
break;
case 1: c0 = b->data[i] >> 2;
c1 = (b->data[i] << 4) & 0x3F;
if (bconchar (out, b64ETable[c0]) < 0 ||
bconchar (out, b64ETable[c1]) < 0 ||
bconchar (out, (char) '=') < 0 ||
bconchar (out, (char) '=') < 0) {
bdestroy (out);
return NULL;
}
break;
case 2: break;
}
return out;
}
#define B64_PAD (-2)
#define B64_ERR (-1)
static int base64DecodeSymbol (unsigned char alpha) {
if ((alpha >= 'A') && (alpha <= 'Z')) return (int)(alpha - 'A');
else if ((alpha >= 'a') && (alpha <= 'z'))
return 26 + (int)(alpha - 'a');
else if ((alpha >= '0') && (alpha <= '9'))
return 52 + (int)(alpha - '0');
else if (alpha == '+') return 62;
else if (alpha == '/') return 63;
else if (alpha == '=') return B64_PAD;
else return B64_ERR;
}
/* bstring bBase64DecodeEx (const_bstring b, int * boolTruncError)
*
* Decode a base64 block of data. All MIME headers are assumed to have been
* removed. See: RFC1341
*/
bstring bBase64DecodeEx (const_bstring b, int * boolTruncError) {
int i, v;
unsigned char c0, c1, c2;
bstring out;
if (b == NULL || b->slen < 0 || b->data == NULL) return NULL;
if (boolTruncError) *boolTruncError = 0;
out = bfromcstr ("");
i = 0;
for (;;) {
do {
if (i >= b->slen) return out;
if (b->data[i] == '=') { /* Bad "too early" truncation */
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out);
return NULL;
}
v = base64DecodeSymbol (b->data[i]);
i++;
} while (v < 0);
c0 = (unsigned char) (v << 2);
do {
if (i >= b->slen || b->data[i] == '=') { /* Bad "too early" truncation */
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out);
return NULL;
}
v = base64DecodeSymbol (b->data[i]);
i++;
} while (v < 0);
c0 |= (unsigned char) (v >> 4);
c1 = (unsigned char) (v << 4);
do {
if (i >= b->slen) {
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out);
return NULL;
}
if (b->data[i] == '=') {
i++;
if (i >= b->slen || b->data[i] != '=' || bconchar (out, c0) < 0) {
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out); /* Missing "=" at the end. */
return NULL;
}
return out;
}
v = base64DecodeSymbol (b->data[i]);
i++;
} while (v < 0);
c1 |= (unsigned char) (v >> 2);
c2 = (unsigned char) (v << 6);
do {
if (i >= b->slen) {
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out);
return NULL;
}
if (b->data[i] == '=') {
if (bconchar (out, c0) < 0 || bconchar (out, c1) < 0) {
if (boolTruncError) {
*boolTruncError = 1;
return out;
}
bdestroy (out);
return NULL;
}
if (boolTruncError) *boolTruncError = 0;
return out;
}
v = base64DecodeSymbol (b->data[i]);
i++;
} while (v < 0);
c2 |= (unsigned char) (v);
if (bconchar (out, c0) < 0 ||
bconchar (out, c1) < 0 ||
bconchar (out, c2) < 0) {
if (boolTruncError) {
*boolTruncError = -1;
return out;
}
bdestroy (out);
return NULL;
}
}
}
#define UU_DECODE_BYTE(b) (((b) == (signed int)'`') ? 0 : (b) - (signed int)' ')
struct bUuInOut {
bstring src, dst;
int * badlines;
};
#define UU_MAX_LINELEN 45
static int bUuDecLine (void * parm, int ofs, int len) {
struct bUuInOut * io = (struct bUuInOut *) parm;
bstring s = io->src;
bstring t = io->dst;
int i, llen, otlen, ret, c0, c1, c2, c3, d0, d1, d2, d3;
if (len == 0) return 0;
llen = UU_DECODE_BYTE (s->data[ofs]);
ret = 0;
otlen = t->slen;
if (((unsigned) llen) > UU_MAX_LINELEN) { ret = -__LINE__;
goto bl;
}
llen += t->slen;
for (i=1; i < s->slen && t->slen < llen;i += 4) {
unsigned char outoctet[3];
c0 = UU_DECODE_BYTE (d0 = (int) bchare (s, i+ofs+0, ' ' - 1));
c1 = UU_DECODE_BYTE (d1 = (int) bchare (s, i+ofs+1, ' ' - 1));
c2 = UU_DECODE_BYTE (d2 = (int) bchare (s, i+ofs+2, ' ' - 1));
c3 = UU_DECODE_BYTE (d3 = (int) bchare (s, i+ofs+3, ' ' - 1));
if (((unsigned) (c0|c1) >= 0x40)) { if (!ret) ret = -__LINE__;
if (d0 > 0x60 || (d0 < (' ' - 1) && !isspace (d0)) ||
d1 > 0x60 || (d1 < (' ' - 1) && !isspace (d1))) {
t->slen = otlen;
goto bl;
}
c0 = c1 = 0;
}
outoctet[0] = (unsigned char) ((c0 << 2) | ((unsigned) c1 >> 4));
if (t->slen+1 >= llen) {
if (0 > bconchar (t, (char) outoctet[0])) return -__LINE__;
break;
}
if ((unsigned) c2 >= 0x40) { if (!ret) ret = -__LINE__;
if (d2 > 0x60 || (d2 < (' ' - 1) && !isspace (d2))) {
t->slen = otlen;
goto bl;
}
c2 = 0;
}
outoctet[1] = (unsigned char) ((c1 << 4) | ((unsigned) c2 >> 2));
if (t->slen+2 >= llen) {
if (0 > bcatblk (t, outoctet, 2)) return -__LINE__;
break;
}
if ((unsigned) c3 >= 0x40) { if (!ret) ret = -__LINE__;
if (d3 > 0x60 || (d3 < (' ' - 1) && !isspace (d3))) {
t->slen = otlen;
goto bl;
}
c3 = 0;
}
outoctet[2] = (unsigned char) ((c2 << 6) | ((unsigned) c3));
if (0 > bcatblk (t, outoctet, 3)) return -__LINE__;
}
if (t->slen < llen) { if (0 == ret) ret = -__LINE__;
t->slen = otlen;
}
bl:;
if (ret && io->badlines) {
(*io->badlines)++;
return 0;
}
return ret;
}
/* bstring bUuDecodeEx (const_bstring src, int * badlines)
*
* Performs a UUDecode of a block of data. If there are errors in the
* decoding, they are counted up and returned in "badlines", if badlines is
* not NULL. It is assumed that the "begin" and "end" lines have already
* been stripped off. The potential security problem of writing the
* filename in the begin line is something that is beyond the scope of a
* portable library.
*/
#ifdef _MSC_VER
#pragma warning(disable:4204)
#endif
bstring bUuDecodeEx (const_bstring src, int * badlines) {
struct tagbstring t;
struct bStream * s;
struct bStream * d;
bstring b;
if (!src) return NULL;
t = *src; /* Short lifetime alias to header of src */
s = bsFromBstrRef (&t); /* t is undefined after this */
if (!s) return NULL;
d = bsUuDecode (s, badlines);
b = bfromcstralloc (256, "");
if (NULL == b || 0 > bsread (b, d, INT_MAX)) {
bdestroy (b);
b = NULL;
}
bsclose (d);
bsclose (s);
return b;
}
struct bsUuCtx {
struct bUuInOut io;
struct bStream * sInp;
};
static size_t bsUuDecodePart (void *buff, size_t elsize, size_t nelem, void *parm) {
static struct tagbstring eol = bsStatic ("\r\n");
struct bsUuCtx * luuCtx = (struct bsUuCtx *) parm;
size_t tsz;
int l, lret;
if (NULL == buff || NULL == parm) return 0;
tsz = elsize * nelem;
CheckInternalBuffer:;
/* If internal buffer has sufficient data, just output it */
if (((size_t) luuCtx->io.dst->slen) > tsz) {
memcpy (buff, luuCtx->io.dst->data, tsz);
bdelete (luuCtx->io.dst, 0, (int) tsz);
return nelem;
}
DecodeMore:;
if (0 <= (l = binchr (luuCtx->io.src, 0, &eol))) {
int ol = 0;
struct tagbstring t;
bstring s = luuCtx->io.src;
luuCtx->io.src = &t;
do {
if (l > ol) {
bmid2tbstr (t, s, ol, l - ol);
lret = bUuDecLine (&luuCtx->io, 0, t.slen);
if (0 > lret) {
luuCtx->io.src = s;
goto Done;
}
}
ol = l + 1;
if (((size_t) luuCtx->io.dst->slen) > tsz) break;
l = binchr (s, ol, &eol);
} while (BSTR_ERR != l);
bdelete (s, 0, ol);
luuCtx->io.src = s;
goto CheckInternalBuffer;
}
if (BSTR_ERR != bsreada (luuCtx->io.src, luuCtx->sInp, bsbufflength (luuCtx->sInp, BSTR_BS_BUFF_LENGTH_GET))) {
goto DecodeMore;
}
bUuDecLine (&luuCtx->io, 0, luuCtx->io.src->slen);
Done:;
/* Output any lingering data that has been translated */
if (((size_t) luuCtx->io.dst->slen) > 0) {
if (((size_t) luuCtx->io.dst->slen) > tsz) goto CheckInternalBuffer;
memcpy (buff, luuCtx->io.dst->data, luuCtx->io.dst->slen);
tsz = luuCtx->io.dst->slen / elsize;
luuCtx->io.dst->slen = 0;
if (tsz > 0) return tsz;
}
/* Deallocate once EOF becomes triggered */
bdestroy (luuCtx->io.dst);
bdestroy (luuCtx->io.src);
free (luuCtx);
return 0;
}
/* bStream * bsUuDecode (struct bStream * sInp, int * badlines)
*
* Creates a bStream which performs the UUDecode of an an input stream. If
* there are errors in the decoding, they are counted up and returned in
* "badlines", if badlines is not NULL. It is assumed that the "begin" and
* "end" lines have already been stripped off. The potential security
* problem of writing the filename in the begin line is something that is
* beyond the scope of a portable library.
*/
struct bStream * bsUuDecode (struct bStream * sInp, int * badlines) {
struct bsUuCtx * luuCtx = (struct bsUuCtx *) malloc (sizeof (struct bsUuCtx));
struct bStream * sOut;
if (NULL == luuCtx) return NULL;
luuCtx->io.src = bfromcstr ("");
luuCtx->io.dst = bfromcstr ("");
if (NULL == luuCtx->io.dst || NULL == luuCtx->io.src) {
CleanUpFailureToAllocate:;
bdestroy (luuCtx->io.dst);
bdestroy (luuCtx->io.src);
free (luuCtx);
return NULL;
}
luuCtx->io.badlines = badlines;
if (badlines) *badlines = 0;
luuCtx->sInp = sInp;
sOut = bsopen ((bNread) bsUuDecodePart, luuCtx);
if (NULL == sOut) goto CleanUpFailureToAllocate;
return sOut;
}
#define UU_ENCODE_BYTE(b) (char) (((b) == 0) ? '`' : ((b) + ' '))
/* bstring bUuEncode (const_bstring src)
*
* Performs a UUEncode of a block of data. The "begin" and "end" lines are
* not appended.
*/
bstring bUuEncode (const_bstring src) {
bstring out;
int i, j, jm;
unsigned int c0, c1, c2;
if (src == NULL || src->slen < 0 || src->data == NULL) return NULL;
if ((out = bfromcstr ("")) == NULL) return NULL;
for (i=0; i < src->slen; i += UU_MAX_LINELEN) {
if ((jm = i + UU_MAX_LINELEN) > src->slen) jm = src->slen;
if (bconchar (out, UU_ENCODE_BYTE (jm - i)) < 0) {
bstrFree (out);
break;
}
for (j = i; j < jm; j += 3) {
c0 = (unsigned int) bchar (src, j );
c1 = (unsigned int) bchar (src, j + 1);
c2 = (unsigned int) bchar (src, j + 2);
if (bconchar (out, UU_ENCODE_BYTE ( (c0 & 0xFC) >> 2)) < 0 ||
bconchar (out, UU_ENCODE_BYTE (((c0 & 0x03) << 4) | ((c1 & 0xF0) >> 4))) < 0 ||
bconchar (out, UU_ENCODE_BYTE (((c1 & 0x0F) << 2) | ((c2 & 0xC0) >> 6))) < 0 ||
bconchar (out, UU_ENCODE_BYTE ( (c2 & 0x3F))) < 0) {
bstrFree (out);
goto End;
}
}
if (bconchar (out, (char) '\r') < 0 || bconchar (out, (char) '\n') < 0) {
bstrFree (out);
break;
}
}
End:;
return out;
}
/* bstring bYEncode (const_bstring src)
*
* Performs a YEncode of a block of data. No header or tail info is
* appended. See: http://www.yenc.org/whatis.htm and
* http://www.yenc.org/yenc-draft.1.3.txt
*/
bstring bYEncode (const_bstring src) {
int i;
bstring out;
unsigned char c;
if (src == NULL || src->slen < 0 || src->data == NULL) return NULL;
if ((out = bfromcstr ("")) == NULL) return NULL;
for (i=0; i < src->slen; i++) {
c = (unsigned char)(src->data[i] + 42);
if (c == '=' || c == '\0' || c == '\r' || c == '\n') {
if (0 > bconchar (out, (char) '=')) {
bdestroy (out);
return NULL;
}
c += (unsigned char) 64;
}
if (0 > bconchar (out, c)) {
bdestroy (out);
return NULL;
}
}
return out;
}
/* bstring bYDecode (const_bstring src)
*
* Performs a YDecode of a block of data. See:
* http://www.yenc.org/whatis.htm and http://www.yenc.org/yenc-draft.1.3.txt
*/
#define MAX_OB_LEN (64)
bstring bYDecode (const_bstring src) {
int i;
bstring out;
unsigned char c;
unsigned char octetbuff[MAX_OB_LEN];
int obl;
if (src == NULL || src->slen < 0 || src->data == NULL) return NULL;
if ((out = bfromcstr ("")) == NULL) return NULL;
obl = 0;
for (i=0; i < src->slen; i++) {
if ('=' == (c = src->data[i])) { /* The = escape mode */
i++;
if (i >= src->slen) {
bdestroy (out);
return NULL;
}
c = (unsigned char) (src->data[i] - 64);
} else {
if ('\0' == c) {
bdestroy (out);
return NULL;
}
/* Extraneous CR/LFs are to be ignored. */
if (c == '\r' || c == '\n') continue;
}
octetbuff[obl] = (unsigned char) ((int) c - 42);
obl++;
if (obl >= MAX_OB_LEN) {
if (0 > bcatblk (out, octetbuff, obl)) {
bdestroy (out);
return NULL;
}
obl = 0;
}
}
if (0 > bcatblk (out, octetbuff, obl)) {
bdestroy (out);
out = NULL;
}
return out;
}
/* int bSGMLEncode (bstring b)
*
* Change the string into a version that is quotable in SGML (HTML, XML).
*/
int bSGMLEncode (bstring b) {
static struct tagbstring fr[4][2] = {
{ bsStatic("&"), bsStatic("&") },
{ bsStatic("\""), bsStatic(""") },
{ bsStatic("<"), bsStatic("<") },
{ bsStatic(">"), bsStatic(">") } };
int i;
for (i = 0; i < 4; i++) {
int ret = bfindreplace (b, &fr[i][0], &fr[i][1], 0);
if (0 > ret) return ret;
}
return 0;
}
/* bstring bStrfTime (const char * fmt, const struct tm * timeptr)
*
* Takes a format string that is compatible with strftime and a struct tm
* pointer, formats the time according to the format string and outputs
* the bstring as a result. Note that if there is an early generation of a
* '\0' character, the bstring will be truncated to this end point.
*/
bstring bStrfTime (const char * fmt, const struct tm * timeptr) {
#if defined (__TURBOC__) && !defined (__BORLANDC__)
static struct tagbstring ns = bsStatic ("bStrfTime Not supported");
fmt = fmt;
timeptr = timeptr;
return &ns;
#else
bstring buff;
int n;
size_t r;
if (fmt == NULL) return NULL;
/* Since the length is not determinable beforehand, a search is
performed using the truncating "strftime" call on increasing
potential sizes for the output result. */
if ((n = (int) (2*strlen (fmt))) < 16) n = 16;
buff = bfromcstralloc (n+2, "");
for (;;) {
if (BSTR_OK != balloc (buff, n + 2)) {
bdestroy (buff);
return NULL;
}
r = strftime ((char *) buff->data, n + 1, fmt, timeptr);
if (r > 0) {
buff->slen = (int) r;
break;
}
n += n;
}
return buff;
#endif
}
/* int bSetCstrChar (bstring a, int pos, char c)
*
* Sets the character at position pos to the character c in the bstring a.
* If the character c is NUL ('\0') then the string is truncated at this
* point. Note: this does not enable any other '\0' character in the bstring
* as terminator indicator for the string. pos must be in the position
* between 0 and b->slen inclusive, otherwise BSTR_ERR will be returned.
*/
int bSetCstrChar (bstring b, int pos, char c) {
if (NULL == b || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen)
return BSTR_ERR;
if (pos < 0 || pos > b->slen) return BSTR_ERR;
if (pos == b->slen) {
if ('\0' != c) return bconchar (b, c);
return 0;
}
b->data[pos] = (unsigned char) c;
if ('\0' == c) b->slen = pos;
return 0;
}
/* int bSetChar (bstring b, int pos, char c)
*
* Sets the character at position pos to the character c in the bstring a.
* The string is not truncated if the character c is NUL ('\0'). pos must
* be in the position between 0 and b->slen inclusive, otherwise BSTR_ERR
* will be returned.
*/
int bSetChar (bstring b, int pos, char c) {
if (NULL == b || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen)
return BSTR_ERR;
if (pos < 0 || pos > b->slen) return BSTR_ERR;
if (pos == b->slen) {
return bconchar (b, c);
}
b->data[pos] = (unsigned char) c;
return 0;
}
#define INIT_SECURE_INPUT_LENGTH (256)
/* bstring bSecureInput (int maxlen, int termchar,
* bNgetc vgetchar, void * vgcCtx)
*
* Read input from an abstracted input interface, for a length of at most
* maxlen characters. If maxlen <= 0, then there is no length limit put
* on the input. The result is terminated early if vgetchar() return EOF
* or the user specified value termchar.
*
*/
bstring bSecureInput (int maxlen, int termchar, bNgetc vgetchar, void * vgcCtx) {
int i, m, c;
bstring b, t;
if (!vgetchar) return NULL;
b = bfromcstralloc (INIT_SECURE_INPUT_LENGTH, "");
if ((c = UCHAR_MAX + 1) == termchar) c++;
for (i=0; ; i++) {
if (termchar == c || (maxlen > 0 && i >= maxlen)) break;
c = vgetchar (vgcCtx);
if (EOF == c) break;
if (i+1 >= b->mlen) {
/* Double size, and deal with numeric overflows */
if (b->mlen <= INT_MAX / 2) m = b->mlen << 1;
else if (b->mlen <= INT_MAX - 1024) m = b->mlen + 1024;
else if (b->mlen <= INT_MAX - 16) m = b->mlen + 16;
else if (b->mlen <= INT_MAX - 1) m = b->mlen + 1;
else {
bSecureDestroy (b); /* Cleanse partial buffer */
return NULL;
}
t = bfromcstrrangealloc (b->mlen + 1, m, "");
if (t) memcpy (t->data, b->data, i);
bSecureDestroy (b); /* Cleanse previous buffer */
b = t;
if (!b) return b;
}
b->data[i] = (unsigned char) c;