-
-
Notifications
You must be signed in to change notification settings - Fork 1
/
BIn.inl
603 lines (555 loc) · 20.8 KB
/
BIn.inl
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
/* Script2™
@link https://github.com/KabukiStarship/Script2.git
@file /BIn.inl
@author Cale McCollough <https://cookingwithcale.org>
@license Copyright Kabuki Starship™ <kabukistarship.com>; This Source Code
Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of
the MPL was not distributed with this file, You can obtain one at
<https://mozilla.org/MPL/2.0/>. */
#include <_Config.h>
#if SEAM >= SCRIPT2_CRABS
#include "BIn.hpp"
//
#include "BSeq.hpp"
#include "Error.h"
#include "Hash.hpp"
#include "Slot.hpp"
//#include "Types.h"
#if SEAM == SCRIPT2_CRABS
#include "_Debug.inl"
#define CLEAR(origin, stop) \
while (origin <= stop) *origin++ = ' ';
#else
#include "_Release.inl"
#define CLEAR(origin, stop)
#endif
namespace _ {
CHA* BInEnd(BIn* bin) { return TPtr<CHA>(bin) + bin->size; }
ISW SlotLength(CHA* origin, CHA* stop, IUW size) {
return stop - origin;
}
ISW SlotSpace(CHA* origin, CHA* stop, IUW size) {
return size - (stop - origin);
}
ISC BInSpace(BIn* bin) {
CHA* txb_ptr = TPtr<CHA>(bin);
return ISC(SlotSpace(txb_ptr + bin->origin, txb_ptr + bin->stop, bin->size));
}
ISC BinBufferLength(BIn* bin) {
CHA* origin = BInBegin(bin);
return ISC(SlotLength(origin + bin->origin, origin + bin->stop, bin->size));
}
#if USING_SCRIPT2_TEXT == YES_0
const CHA** STRBInStates() {
static const CHA* kStateStrings[] = {
"Address", //< 0
"Args", //< 1
"UTF-8", //< 2
"UTF-16", //< 3
"UTF-32", //< 4
"Varint", //< 5
"CObj", //< 6
"Hash", //< 7
"Error", //< 8
"Disconnected", //< 9
"ACK", //< 10
"Locked", //< 11
"POD" //< 12
};
return kStateStrings;
}
#endif
/* Used to return an erroneous result from a B-Output.
@param error The error type.
@return Returns a Static Error Op Result. */
inline const Op* BInError(BIn* bin, Error error) {
D_COUT("\nBIn " << STRError(error) << " error!");
return OpError(error);
}
/* Used to return an erroneous result from a B-Output.
@param bin The source BIn.
@param error The error type.
@param header The B-Sequence Header.
@param offset The offset to the type in error in the B-Sequence.
@param address The address of the IUA in error.
@return Returns a Static Error Op Result. */
inline const Op* BInError(BIn* bin, Error error, const ISC* header) {
D_COUT("\nBIn %s error!", STRError(error));
return OpError(error);
}
/* Used to return an erroneous result from a B-Output.
@param bin The source BIn.
@param error The error type.
@param header The B-Sequence Header.
@param offset The offset to the type in error in the B-Sequence.
@param address The address of the IUA in error.
@return Returns a Static Error Op Result. */
inline const Op* BInError(BIn* bin, Error error, const ISC* header,
ISC offset) {
D_COUT("\nBIn " << STRError(error) << " error!");
return OpError(error);
}
/* Used to return an erroneous result from a B-Output.
@param bin The source BIn.
@param error The error type.
@param header The B-Sequence Header.
@param offset The offset to the type in error in the B-Sequence.
@param address The address of the IUA in error.
@return Returns a Static Error Op Result. */
inline const Op* BInError(BIn* bin, Error error, const ISC* header, ISC offset,
CHA* address) {
D_COUT("\nBIn " << STRError(error) << " error!");
return OpError(error);
}
BIn* BInInit(IUW* socket, ISC size) {
D_ASSERT(size >= cSlotSizeMin);
BIn* bin = TPtr<BIn>(socket);
bin->size = size - sizeof(BIn);
bin->origin = 0;
bin->stop = 0;
bin->read = 0;
D_ARRAY_WIPE(BInBegin(bin), size);
return bin;
}
ISC BInStreamByte(BIn* bin) {
CHA* origin = BInBegin(bin),
* stop = origin + bin->size - 1;
CHA* open = (CHA*)origin + bin->read,
* origin = origin + bin->origin,
* begin = origin;
ISC length = (ISC)((origin < open) ? open - origin + 1
: (stop - origin) + (open - origin) + 2);
if (length < 1) {
BInError(bin, cErrorBufferOverflow, TParams<1, STR_>(), 2, origin);
return -1;
}
// IUA b = *cursor;
bin->stop = (++origin >= stop) ? TDelta<ISC>(origin, stop)
: TDelta<ISC>(origin, origin);
return 0;
}
BOL BInIsReadable(BIn* bin) { return BinBufferLength(bin) > 0; }
const Op* BInRead(BIn* bin, const ISC* params, void** args) {
D_COUT("\nReading ");
D_COUT_BSQ(params);
D_COUT(" from B-Input:");
D_COUT_BIN(bin);
if (!bin) {
return BInError(bin, cErrorImplementation);
}
if (!params) {
return BInError(bin, cErrorImplementation);
}
if (!args) {
return BInError(bin, cErrorImplementation);
}
IUA iua; //< Temp variable.
IUB iub; //< Temp variable.
IUC iuc; //< Temp variable.
IUD iud; //< Temp variable.
CHA* iua_ptr; //< Pointer to a cIUA.
IUB* iub_ptr; //< Pointer to a cIUB.
IUC* iuc_ptr; //< Pointer to a cIUC.
IUD* iud_ptr; //< Pointer to a cIUA.
ISC type, //< The current type being read.
size, //< Size of the ring socket.
length, //< Length of the data in the socket.
count, //< Argument length.
index, //< Index in the params.
arg_index = 0, //< Index in the args.
value, //< Temp variable.
num_params = *params; //< Number of params.
IUB hash; //< Hash of the incoming data.
if (num_params == 0) return 0; //< Nothing to do.
hash = PRIME_LARGEST_IUB;
size = bin->size;
CHA* begin = BInBegin(bin), //< The beginning of the socket.
* end = begin + size - 1, //< The end of the socket.
* origin = origin + bin->origin, //< The origin of the data.
* stop = origin + bin->stop; //< The stop of the data.
// const ISC* param = params + 1; //< The current param.
length = TSlotLength<ISC>(origin, stop, size);
// When we scan, we are reading from the beginning of the Slot socket.
for (index = 1; index <= num_params; ++index) {
type = params[index];
D_COUT("\nparam:" << arg_index + 1 << " type:" << STAAType(type) <<
" start:" << TDelta<>(origin, start) << " stop:" <<
TDelta<>(origin, stop) << " length:" << length);
switch (type) {
case cNIL:
return BInError(bin, cErrorInvalidType, params, index, origin);
case cISA: //< _R_e_a_d__1__B_y_t_e__T_y_p_e_s________________
case cIUA:
#if USING_SCRIPT2_1_BYTE_TYPES
if (length-- == 0)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
// Load next pointer and increment args.
iua_ptr = TPtr<CHA>(args[arg_index]);
if (!iua_ptr) break;
// Read type;
// Byte 1
iua = *origin; //< Read
D_COUT(" '" << iua << "', ");
hash = HashIUB(iua, hash); //< Hash
if (++origin >= stop) origin -= size; //< Increment
*iua_ptr = iua; //< Write
break;
#else
return BInError(bin, cErrorInvalidType, params, index, origin);
#endif
case cISB: //< _R_e_a_d__1_6_-_b_i_t__T_y_p_e_s_______________
case cIUB:
case cFPB:
#if CPU_WORD_SIZE == CPU_16_BIT
case cBOL:
#endif
#if USING_SCRIPT2_2_BYTE_TYPES
if (length < 2)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
length -= 2;
// Load next pointer and increment args.
iua_ptr = TPtr<CHA>(args[arg_index]);
if (!iua_ptr) break;
// Read type
// Byte 1
iua = *origin; //< Read
hash = HashIUB(iua, hash); //< Hash
if (++origin >= stop) origin -= size; //< Increment
*iua_ptr = iua; //< Write
// Byte 2
iua = *origin; //< Read
hash = HashIUB(iua, hash); //< Hash
if (++origin >= stop) origin -= size; //< Increment
*(iua_ptr + 1) = iua; //< Write
break;
#else
return BInError(bin, cErrorInvalidType, params, index, origin);
#endif
case cISC: //< _R_e_a_d__3_2_-_b_i_t__T_y_p_e_s_______________
case cIUC:
case cFPC:
#if USING_SCRIPT2_4_BYTE_TYPES
if (length < 4)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
length -= 4;
// Load next pointer and increment args.
iua_ptr = TPtr<CHA>(args[arg_index]);
if (!iua_ptr) break;
// Read type
for (value = sizeof(IUC); value > 0; --value) {
// Byte 1
iua = *origin; //< Read
hash = HashIUB(iua, hash); //< Hash
if (++origin >= stop) origin -= size; //< Increment
*iua_ptr++ = iua; //< Write
}
#else
return BInError(bin, cErrorInvalidType, params, index, origin);
#endif
case cISD: //< _R_e_a_d__6_4_-_b_i_t__T_y_p_e_s_______________
case cIUD:
case cFPD:
#if USING_SCRIPT2_8_BYTE_TYPES
if (length < 8)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
length -= 8;
// Load next pointer and increment args.
iua_ptr = TPtr<CHA>(args[arg_index]);
if (!iua_ptr) break;
// Read type
for (value = sizeof(IUD); value > 0; --value) {
// Byte 1
iua = *origin; //< Read
hash = HashIUB(iua, hash); //< Hash
if (++origin >= stop) origin -= size; //< Increment
*iua_ptr++ = iua; //< Write
}
break;
#else
return BInError(bin, cErrorInvalidType, params, index, origin);
#endif
case STR_: //< _R_e_a_d__S_t_r_i_n_g_-_8____________________
// Load buffered-type argument length and increment the index.
++num_params;
count = params[++index];
//< @todo Replace with pointer arithmetic.
// Load next pointer and increment args.
iua_ptr = TPtr<CHA>(args[arg_index]);
if (iua_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
D_COUT("\nReading STR_:0x" << Hexf(iua_ptr) << " with length:" <<
count);
// Read CHA.
iua = *origin;
hash = HashIUB(iua, hash);
if (++origin >= stop) origin -= size;
*iua_ptr = iua;
++iua_ptr;
D_COUT(iua);
while ((iua != 0) && (count != 0)) {
--count;
if (count == 0) //< Reached count:0 before nil-term CHA.
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
iua = *origin; // Read IUA from ring-socket.
hash = HashIUB(iua, hash);
if (++origin >= stop) origin -= size;
*iua_ptr++ = iua; // Write IUA to destination.
D_COUT(iua);
}
D_COUT("\" success!\n");
if (type != cADR) {
*iua_ptr = 0;
// No need to hash 0.
}
break;
//case cSVI: //< _R_e_a_d__S_i_g_n_e_d__V_a_r_i_n_t______________
//case cUVI: //< _R_e_a_d__U_n_s_i_g_n_e_d__V_a_r_i_n_t___________
#if CPU_SIZE <= 16
// Load next pointer and increment args.
iub_ptr = TPtr<IUB>(args[arg_index]);
if (iub_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
// SScan IUA 1.
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iub = iua;
IUC temp = 7; //< Number of bits to shift iua to the left.
count = 5; //< The max number_ of Varint4 bytes.
while (iua >> 7 == 0) {
if (length-- == 0)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iuc |= IUC(iua & 0x7F) << temp;
//< @todo I'm starting to second guess if we need to mask iua
//< because we're packing them up and will overwrite.
temp += 7;
if (--count == 0)
return BInError(bin, cErrorVarintOverflow, params, index, origin);
}
if (count == 5) //< If there is only one IUA we need to
iuc &= 0x7F; //< mask off the terminating varint bit.
if (type == cSVI) iuc = TTypeUnpackVarint<IUC>(iuc);
*iuc_ptr = iuc;
break;
#else
// Load next pointer and increment args.
iuc_ptr = TPtr<IUC>(args[arg_index]);
if (iuc_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
// SScan IUA 1.
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iuc = iua;
iub = 7; //< Number of bits to shift iua to the left.
count = 5; //< The max number_ of Varint4 bytes.
while (iua >> 7 == 0) {
if (length-- == 0)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iuc |= ((IUC)(iua & 0x7F)) << iub;
//< @todo I'm starting to second guess if we need to mask iua
//< because we're packing them up and will overwrite.
iub += 7;
if (--count == 0)
return BInError(bin, cErrorVarintOverflow, params, index, origin);
}
if (count == 5) //< If there is only one IUA we need to
iuc &= 0x7F; //< mask off the terminating varint bit.
if (type == SVI) iuc = TTypeUnpackVarint<IUC>(iuc);
*iuc_ptr = iuc;
break;
#endif
case cSV8: //< _R_e_a_d__V_a_r_i_n_t__8____________________
case cUV8:
// Load next pointer and increment args.
iud_ptr = TPtr<IUD>(args[arg_index]);
if (!iud_ptr) {
return BInError(bin, cErrorImplementation, params, index, origin);
}
// SScan IUA 1.
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iud = iua;
iub = 7; //< Number of bits to shift iua to the left.
count = 9; //< The max number_ of Varint8 bytes.
while (iua >> 7 == 0) {
if (length-- == 0)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
if (count == 1) {
// Varint 8 differs from Varint 2 and 4 in that on the
// last IUA, IUA 9 of 9, there is no terminating
// varint bit.
iud |= ((IUD)(iua)) << iub;
break;
}
iud |= ((IUD)(iua & 0x7F)) << iub;
//< @todo I'm starting to second guess if we need to mask
//< iua because we're packing them up and will overwrite.
iub += 7;
if (--count == 0)
return BInError(bin, cErrorVarintOverflow, params, index, origin);
}
if (count == 9) //< If there is only one IUA we need to
iud &= 0x7F; //< mask off the terminating varint bit.
if (type == cSV8) iud = TTypeUnpackVarint<IUD>(iud);
*iud_ptr = iud;
break;
case cBSQ: //< _B_-_S_e_q_u_e_n_c_e__S_t_r_i_n_g______________
#if USING_BSQ
iua_ptr = TPtr<CHA>(args[arg_index]);
if (iua_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
iua = *origin;
#endif
default: {
D_COUT("\nIt's an array!\n");
#if USING_SCRIPT2_ARRAY
switch (type & 0x60) {
case 0: {
if ((type < cLST) && (type < cMAP))
return BInError(bin, cErrorInvalidType, params, index, origin);
if (length < 1) // 1 IUA for the width word.
return BInError(bin, cErrorBufferUnderflow, params, index,
origin);
iua_ptr = TPtr<CHA>(args[arg_index]);
if (iua_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
if (iua > length - 1)
return BInError(bin, cErrorBufferOverflow, params, index, origin);
length = length - count - 1;
count = IUW(iua);
break;
}
case 1: {
if (length < 2) // 2 IUA for the width word.
return BInError(bin, cErrorBufferUnderflow, params, index,
origin);
length -= 2;
iub_ptr = TPtr<IUB>(args[arg_index]);
if (iub_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
for (temp = 0; temp <= sizeof(IUB); temp += 8) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iub |= ((IUB)iua) << temp;
}
if (iub > length)
return BInError(bin, cErrorBufferOverflow, params, index, origin);
length -= count;
count = IUW(iub);
iua_ptr = TPtr<CHA>(iub_ptr);
break;
}
case 2: {
if (length < 4) // 4 IUA for the width word.
return BInError(bin, cErrorBufferUnderflow, params, index,
origin);
length -= 4;
iuc_ptr = TPtr<IUC>(args[arg_index]);
if (iuc_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
for (temp = 0; temp <= sizeof(IUC); temp += 8) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iuc |= IUC(iua) << temp;
}
if (iuc >= length)
return BInError(bin, cErrorBufferOverflow, params, index, origin);
length -= count;
count = IUW(iuc);
iua_ptr = TPtr<CHA>(iuc_ptr);
break;
}
case 3: { // 8 IUA for the width word.
if (length < 9)
return BInError(bin, cErrorBufferUnderflow, params, index,
origin);
length -= 8;
iud_ptr = TPtr<IUD>(args[arg_index]);
if (iud_ptr == nullptr)
return BInError(bin, cErrorImplementation, params, index, origin);
for (temp = 0; temp <= sizeof(IUD); temp += 8) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
iud |= IUD(iua) << temp;
}
if (iud > length)
return BInError(bin, cErrorBufferOverflow, params, index, origin);
length -= count;
count = IUW(iud);
iua_ptr = TPtr<CHA>(iud_ptr);
break;
}
default:
return BInError(bin, cErrorImplementation, params, index, origin);
}
if (length < count)
return BInError(bin, cErrorBufferOverflow, params, index, origin);
if (count == 0) break; //< Not sure if this is an error.
if (origin + count >= stop) {
for (; size - count > 0; --count) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
*iua_ptr = iua;
++iua_ptr;
}
stop = origin - 1;
for (; count > 0; --count) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
*iua_ptr = iua;
++iua_ptr;
}
break;
}
for (; count > 0; --count) {
iua = *origin;
if (++origin >= stop) origin -= size;
hash = HashIUB(iua, hash);
*iua_ptr = iua;
++iua_ptr;
}
break;
#endif //< D_THIS
}
}
++arg_index;
D_COUT(" |");
}
D_COUT("\nHash expected:0x" << Hexf(hash));
if (length < 2)
return BInError(bin, cErrorBufferUnderflow, params, index, origin);
iub = *origin;
if (++origin >= stop) origin -= size;
iua = *origin;
if (++origin >= stop) origin -= size;
iub |= (((IUB)iua) << 8);
D_COUT("found:0x" << Hexf(iub));
if (hash != iub)
return BInError(bin, cErrorInvalidHash, params, index, origin);
D_COUT("\nDone reading\n");
CLEAR(origin, stop)
// Convert pointer back to offset
bin->origin = TDelta<ISC>(origin, origin);
return 0;
}
} //< namespace _
#endif