-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathaasm_stdlib.h
655 lines (600 loc) · 18.4 KB
/
aasm_stdlib.h
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
#ifndef AASM_STDLIB
#define AASM_STDLIB 1
#include <stdio.h>
#include <stdbool.h>
#include <stdint.h>
#include "aasm_global.h"
#include "arbnum.h"
//############################################### <Std globals>
enum CompiletimeConstantsStdlib {
initialstackSize = 64
};
int stackSize = initialstackSize;
num_t* stack;
int stackptr;
num_t* retstack;
int retstackptr;
int64_t decimalpoint;
num_t* args[maxArgumentAmount];
num_t tmps[maxArgumentAmount];
enum typesstd { UnDef, Number, String };
enum registers {
gr1, gr2, gr3, gr4, gr5, gr6,
ir, jr, ans,
inplen, endian, decip, path,
stacsz, mstptr, rstptr, offset,
tme, ptme,
flag, loop,
regAmount
};
num_t regs[regAmount];
enum instructsstdlib {
set, dget, dset, len, rot, shf, rev,
trun, app, sel, cut, ins,
inc, dec, add, sub, rsub, mul, divi, modu, root,
print, nprint, sprint, input,
sinput, firead, fiwrite, flen,
cmp, ucmp, Ce, Cn, Cg, Cs,
jmp, rjmp, rmr,
push, pop, peek, flip, ret,
cton, ntoc, ston, ntos,
run, prun, rnd,
SAVE, LOAD
};
char registerstring[][maxKeywordLen] = {
"gr1", "gr2", "gr3", "gr4", "gr5", "gr6",
"ir", "jr", "ans",
"inplen", "endian", "decip", "path",
"stacsz", "mstptr", "rstptr", "offset",
"time", "ptime",
"flag", "loop",
"\0end"
};
char instructstring[][maxKeywordLen] = {
"set", "dget", "dset", "len", "rot", "shf", "rev",
"trun", "app", "sel", "cut", "ins",
"inc", "dec", "add", "sub", "rsub", "mul", "div", "mod", "root",
"print", "nprint", "sprint", "input",
"sinput", "fread", "fwrite", "flen",
"cmp", "ucmp", "Ce", "Cn", "Cg", "Cs",
"jmp", "rjmp", "rmr",
"push", "pop", "peek", "flip", "ret",
"cton", "ntoc", "ston", "ntos",
"run", "prun", "rand",
"SAVE", "LOAD",
"\0end"
};
//############################################### </Std globals>
//############################################### <Std internal functions>
void freestacks(){
for(int i = stackptr; i < stackSize; i++)
free(stack[i].nump);
free(stack);
for(int i = retstackptr; i < stackSize; i++)
free(retstack[i].nump);
free(retstack);
}
bool pushtomst(num_t* num){
stackptr--;
if(stackptr < 0){
printf("\aThe bottom of the stack has been reached (it currently contains %d items)\n", stackSize);
printf("It is possible to change the size of the stack by modifying the `stacsz` register, but this will clear the current stack.\n");
stackptr = 0;
return false;
}
initnum(&stack[stackptr], 1, 0, 0);
copynum(&stack[stackptr], num, 0);
return true;
}
bool popfrommst(num_t* num){
if(stackptr >= stackSize){
printf("\aThe top of the stack has been reached (there are no elements to be popped).\n");
stackptr = stackSize;
return false;
}
copynum(num, &stack[stackptr], 0);
free(stack[stackptr].nump);
stackptr++;
return true;
}
bool fliperonie(){
if(stackptr >= stackSize){
printf("\aThe top of the main stack has been reached (there are no elements to be flipped).\n");
stackptr = stackSize;
return false;
}
retstackptr--;
if(retstackptr < 0){
printf("\aThe bottom of the return stack has been reached (it currently contains %d items)\n", stackSize);
printf("It is possible to change the size of both stacks by modifying the `stacsz` register, but this will clear the current state of both stacks.\n");
retstackptr = 0;
return false;
}
initnum(&retstack[retstackptr], 1, 0, 0);
copynum(&retstack[retstackptr], &stack[stackptr], 0);
free(stack[stackptr].nump);
stackptr++;
return true;
}
bool reteronie(){
if(retstackptr >= stackSize){
printf("\aThe top of the return stack has been reached (there are no elements to be returned).\n");
retstackptr = stackSize;
return false;
}
stackptr--;
if(stackptr < 0){
printf("\aThe bottom of the main stack has been reached (it currently contains %d items)\n", stackSize);
printf("It is possible to change the size of both stacks by modifying the `stacsz` register, but this will clear the current state of both stacks.\n");
stackptr = 0;
return false;
}
initnum(&stack[stackptr], 1, 0, 0);
copynum(&stack[stackptr], &retstack[retstackptr], 0);
free(retstack[retstackptr].nump);
retstackptr++;
return true;
}
int saveload(char path[], char saveorload, GLOBAL* mainptrs){
FILE* fp;
if(saveorload == 's'){
fp = fopen(path, "wb+");
if(fp == NULL){
printf("\aCould not open file to save to: '%s'.\n", path);
return 1;
}
for(int i = 0; i < regAmount; i++)
savenum(fp, ®s[i]);
for(int i = stackSize-1; i >= stackptr; i--)
savenum(fp, &stack[i]);
for(int i = stackSize-1; i >= retstackptr; i--)
savenum(fp, &retstack[i]);
if(mainptrs->inputMode == 'i') printf("Saved state to '%s'.\n", path);
} else {
fp = fopen(path, "rb");
if(fp == NULL){
printf("\aCould not open file to load from: '%s'.\n", path);
return 1;
}
for(int i = 0; i < regAmount; i++)
loadnum(fp, ®s[i]);
freestacks();
stackSize = numtoint(®s[stacsz], false);
stack = (num_t*) malloc(stackSize * sizeof(num_t));
retstack = (num_t*) malloc(stackSize * sizeof(num_t));
stackptr = numtoint(®s[mstptr], false);
retstackptr = numtoint(®s[rstptr], false);
for(int i = stackSize-1; i >= stackptr; i--){
initnum(&stack[i], 1, 0, 0);
loadnum(fp, &stack[i]);}
for(int i = stackSize-1; i >= retstackptr; i--){
initnum(&retstack[i], 1, 0, 0);
loadnum(fp, &retstack[i]);}
if(mainptrs->inputMode == 'i') printf("Loaded state from '%s'.\n", path);
}
fclose(fp);
return 0;
}
//############################################### </Std internal functions>
//############################################### <Std essentials>
int init_std(GLOBAL* mainptrs){
initnumarray(regAmount, regs, 7, 0, 0);
decimalpoint = 0;
stackptr = stackSize;
stack = (num_t*) malloc(stackSize * sizeof(num_t));
retstackptr = stackSize;
retstack = (num_t*) malloc(stackSize * sizeof(num_t));
inttonum(®s[decip], decimalpoint);
inttonum(®s[inplen], mainptrs->userInputLen);
inttonum(®s[endian], mainptrs->bigEndian);
inttonum(®s[loop], mainptrs->scriptLoops);
inttonum(®s[stacsz], stackSize);
inttonum(®s[mstptr], stackSize);
inttonum(®s[rstptr], stackSize);
inttonum(®s[offset], stackSize);
free(regs[path].nump);
initnum(®s[path], 2, 0, 0);
regs[path].nump[0] = '.';
regs[path].nump[1] = '/';
time_t thetime = time(&thetime);
inttonum(®s[tme], (int64_t) thetime);
for(int i = 0; i < maxArgumentAmount; i++){
args[i] = &tmps[i];
initnum(args[i], 1, 0, 0);
tmps[i].nump[0] = 0;
}
if(mainptrs->debug == 'v') printf("stdlib initted\n");
return 0;
}
int update_std(GLOBAL* mainptrs){
mainptrs->userInputLen = numtoint(®s[inplen], false);
decimalpoint = numtoint(®s[decip], true);
if(regs[endian].nump[0] != 1 || regs[endian].nump[0] == 0) mainptrs->bigEndian = 0;
else mainptrs->bigEndian = 1;
inttonum(®s[endian], mainptrs->bigEndian);
if(regs[loop].nump[0] != 1 || regs[loop].nump[0] == 0) mainptrs->scriptLoops = 0;
else mainptrs->scriptLoops = 1;
inttonum(®s[loop], mainptrs->scriptLoops);
if(stackSize != numtoint(®s[stacsz], false)){
freestacks();
stackSize = numtoint(®s[stacsz], false);
stackptr = stackSize;
retstackptr = stackSize;
inttonum(®s[offset], stackSize);
stack = (num_t*) malloc(stackSize * sizeof(num_t));
retstack = (num_t*) malloc(stackSize * sizeof(num_t));
}
inttonum(®s[mstptr], stackptr);
inttonum(®s[rstptr], retstackptr);
for(int i = 0; i < maxArgumentAmount; i++){
free(tmps[i].nump);
args[i] = &tmps[i];
initnum(args[i], 1, 0, 0);
tmps[i].nump[0] = 0;
}
time_t thetime = time(&thetime);
inttonum(®s[tme], (int64_t) thetime);
if(mainptrs->debug == 'v') printf("stdlib updated\n");
return 0;
}
int free_std(GLOBAL* mainptrs){
for(int i = 0; i < maxArgumentAmount; i++)
free(tmps[i].nump);
freestacks();
freenumarray(regAmount, regs);
if(mainptrs->debug == 'v') printf("stdlib freed\n");
return 0;
}
int instructhandler_std(GLOBAL* mainptrs){
mainptrs->instructNr = strlook(mainptrs->userInput, instructstring, &mainptrs->readhead);
switch(mainptrs->instructNr){
case Ce:
if(regs[flag].nump[0] == 0) mainptrs->lookingMode = 'i';
else mainptrs->lookingMode = 'd';
break;
case Cn:
if(regs[flag].nump[0] != 0) mainptrs->lookingMode = 'i';
else mainptrs->lookingMode = 'd';
break;
case Cg:
if(regs[flag].nump[0] == 1) mainptrs->lookingMode = 'i';
else mainptrs->lookingMode = 'd';
break;
case Cs:
if(regs[flag].nump[0] == 2) mainptrs->lookingMode = 'i';
else mainptrs->lookingMode = 'd';
break;
case jmp:
case rjmp:
case rmr:
if(mainptrs->inputMode != 'f'){
printf("\aThis instruction only works in a script.\n");
mainptrs->lookingMode = 'd';
break;
}
mainptrs->lookingMode = 'a';
break;
default:
mainptrs->lookingMode = 'a';
break;
}
if(mainptrs->debug == 'v') printf("stdlib instructed\n");
return 0;
}
int argumenthandler_std(GLOBAL* mainptrs){
char entry = mainptrs->userInput[mainptrs->readhead];
int registerNr = -1;
bool stacref = false;
if( entry == '$' ){
entry = mainptrs->userInput[++mainptrs->readhead];
stacref = true;
}
if( (entry >= 'a' && entry <= 'z') || (entry >= 'A' && entry <= 'Z') ){
registerNr = strlook(mainptrs->userInput, registerstring, &mainptrs->readhead);
if(registerNr == -1){
printf("\aRegister at argument %d on line %d is not a register.\n", mainptrs->argumentNr + 1, mainptrs->flist[mainptrs->fileNr]->lineNr);
mainptrs->lookingMode = 'd';
} else {
args[mainptrs->argumentNr] = ®s[registerNr];
}
} else if( entry >= '0' && entry <= '9' ){
mainptrs->readhead +=-1 + inpstrtonum(args[mainptrs->argumentNr], mainptrs->userInput, mainptrs->readhead, mainptrs->bigEndian);
} else if( entry == '\"' ) {
mainptrs->readhead += strtostrnum(args[mainptrs->argumentNr], mainptrs->userInput, 1 + mainptrs->readhead);
}
if(stacref){
int staent = numtoint(®s[offset], false) - 1 - numtoint(args[mainptrs->argumentNr], true);
if(staent >= stackptr && staent < stackSize){
args[mainptrs->argumentNr] = &stack[staent];
} else {
printf("\aTried to access a non-existent element (entry %d) on the stack.\n", staent);
printf("offset: %d, mstptr: %d, stacsz: %d\n", (int)numtoint(®s[offset], false), stackptr, stackSize);
mainptrs->lookingMode = 'd';
}
}
if(mainptrs->debug == 'v') printf("stdlib argumented\n");
return 0;
}
int executehandler_std(GLOBAL* mainptrs){
time_t begin_time = time(&begin_time);
bool doprint = true;
if(mainptrs->inputMode != 'i') doprint = false;
int rettype = UnDef;
num_t* printptr = args[0];
FILE* quicfptr;
num_t dummy;
int d = 0;
initnum(&dummy, 15, 0, 0);
switch (mainptrs->instructNr){
case set:
copynum(args[0], args[1], 0);
break;
case dget:
free(dummy.nump);
initnum(&dummy, 1, args[0]->sign, args[0]->dim);
dummy.nump[0] = args[0]->nump[numtoint(args[1], false) % args[0]->len];
copynum(args[2], &dummy, 0);
printptr = args[2];
break;
case dset:
args[0]->nump[numtoint(args[1], false) % args[0]->len] = args[2]->nump[0];
break;
case len:
inttonum(args[1], args[0]->len);
printptr = args[1];
break;
case rot:
rotnum(args[0], numtoint(args[1], true));
break;
case shf:
shiftnum(args[0], numtoint(args[1], true));
break;
case rev:
reversenum(args[0]);
break;
case trun:
truncatenum(args[0]);
break;
case app:
appendnum(args[0], args[1]);
break;
case sel:
selectsectionnum(args[0], args[1], numtoint(args[2], false), numtoint(args[0], false) + numtoint(args[2], false));
break;
case cut:
selectsectionnum(&dummy, args[0], numtoint(args[1], false), numtoint(args[2], false) + 1);
copynum(args[0], &dummy, 0);
break;
case ins:
insertnum(args[0], args[1], numtoint(args[2], false));
break;
case inc:
incnum(args[0], false);
break;
case dec:
incnum(args[0], true);
break;
case add:
sumnum(args[0], args[0], args[1], false);
break;
case sub:
sumnum(args[0], args[0], args[1], true);
break;
case rsub:
sumnum(args[1], args[0], args[1], true);
printptr = args[1];
break;
case mul:
multnum(args[0], args[0], args[1]);
if(decimalpoint != 0){
shiftnum(args[0], -1*decimalpoint);
}
break;
case divi:
if(decimalpoint != 0){
shiftnum(args[0], decimalpoint);
}
divnum(args[0], args[2], args[0], args[1]);
break;
case modu:
if(decimalpoint != 0){
shiftnum(args[0], decimalpoint);
}
divnum(args[2], args[0], args[0], args[1]);
break;
case root:
printf("`root` not yet implemented.\n"); //TODO root
break;
case print:
doprint = true;
if(args[0]->nump[0] > 9) rettype = String;
break;
case nprint:
doprint = false;
rettype = Number;
printnum(args[0], mainptrs->bigEndian + 2);
break;
case sprint:
doprint = false;
rettype = String;
printstrnum(args[0]);
break;
case input:
inputfailed:
fgets(mainptrs->userInput, mainptrs->userInputLen, stdin);
if(mainptrs->userInput[0] >= '0' && mainptrs->userInput[0] <= '9')
inpstrtonum(args[0], mainptrs->userInput, 0, mainptrs->bigEndian);
else if (mainptrs->userInput[0] == '"'){
strtostrnum(args[0], mainptrs->userInput, 1);
rettype = String;
} else {printf("\aInput must be a number or string\n"); goto inputfailed;}
break;
case sinput:
fgets(mainptrs->userInput, mainptrs->userInputLen, stdin);
free(args[0]->nump);
for(int i = 0; mainptrs->userInput[i] != '\0'; i++)
if(mainptrs->userInput[i] == '\n') initnum(args[0], i, 0, 0);
for(uint64_t i = 0; i < args[0]->len; i++)
if(mainptrs->userInput[i] != '\n') args[0]->nump[i] = mainptrs->userInput[i];
else args[0]->nump[i] = '\0';
rettype = String;
break;
case firead:
quicfptr = fopen((char*)(args[1]->nump), "rb");
if(quicfptr == NULL){ printf("\aCould not open file '%s'.\n", args[1]->nump); doprint = false; break;}
args[0]->len = numtoint(args[0], false);
free(args[0]->nump);
initnum(args[0], args[0]->len, 0, 0);
fseek(quicfptr, numtoint(args[2], false), SEEK_SET);
fread(args[0]->nump, 1, args[0]->len, quicfptr);
fclose(quicfptr);
rettype = String;
break;
case fiwrite:
if(args[2]->sign == 0) quicfptr = fopen((char*)(args[1]->nump), "wb");
else quicfptr = fopen((char*)(args[1]->nump), "wb+");
if(quicfptr == NULL){ printf("\aCould not open or create file '%s'.\n", args[1]->nump); doprint = false; break;}
fseek(quicfptr, numtoint(args[2], false), SEEK_SET);
fwrite(args[0]->nump, 1, args[0]->len, quicfptr);
fclose(quicfptr);
rettype = String;
break;
case flen:
quicfptr = fopen((char*)(args[0]->nump), "r");
if(quicfptr == NULL){ printf("\aCould not read the length of file '%s'.\n", args[0]->nump); doprint = false; break;}
fseek(quicfptr, 0, SEEK_END);
inttonum(args[1], ftell(quicfptr));
printptr = args[1];
fclose(quicfptr);
break;
case cmp:
inttonum(®s[flag], cmpnum(args[0], args[1], true));
printptr = ®s[flag];
break;
case ucmp:
inttonum(®s[flag], cmpnum(args[0], args[1], false));
printptr = ®s[flag];
break;
case jmp:
d = strlook((char*)args[0]->nump, /*(char(*)[maxKeywordLen])*/ mainptrs->flist[mainptrs->fileNr]->labels, &d);
if(d == -1){
printf("\aLabel '%s' does not exist\n", args[0]->nump);
break;
}
// printf("jmp to: %ld\n", thefile->labelposs[dum]);
// inttonum(args[1], ftell(mainptrs->flist[mainptrs->fileNr]->fp));
// fseek(mainptrs->flist[mainptrs->fileNr]->fp, mainptrs->flist[mainptrs->fileNr]->labelposs[d], SEEK_SET);
inttonum(args[1], mainptrs->flist[mainptrs->fileNr]->pos);
mainptrs->flist[mainptrs->fileNr]->pos = mainptrs->flist[mainptrs->fileNr]->labelposs[d];
break;
case rjmp:
inttonum(args[1], mainptrs->flist[mainptrs->fileNr]->pos);
mainptrs->flist[mainptrs->fileNr]->pos = numtoint(args[0], false) % mainptrs->flist[mainptrs->fileNr]->len;
break;
case rmr:
inttonum(args[0], mainptrs->flist[mainptrs->fileNr]->pos);
break;
case push:
if(!pushtomst(args[0])) doprint = false;
break;
case pop:
if(!popfrommst(args[0])) doprint = false;
break;
case peek:
if(stackptr == stackSize){
printf("\aThere are no elements on the stack\n");
doprint = false;
break;
}
copynum(args[0], &stack[stackptr], 0);
break;
case flip:
if(isnumzero(args[0])) args[0]->nump[0] = (uint8_t) 1;
for(int i = numtoint(args[0], false); i > 0; i--){
if(!fliperonie()){ doprint = false; break;}
if(i == 1) printptr = &retstack[retstackptr];
}
break;
case ret:
if(isnumzero(args[0])) args[0]->nump[0] = (uint8_t) 1;
for(int i = numtoint(args[0], false); i > 0; i--){
if(!reteronie()){ doprint = false; break;}
if(i == 1) {
printptr = &stack[stackptr];
copynum(®s[ans], printptr, 0);
}
}
break;
case cton:
uint8tonum(args[0], args[0]->nump[numtoint(args[1], false) % (int64_t)args[0]->len]);
rettype = Number;
break;
case ntoc:
dummy.nump[0] = numtouint8(args[0]);
free(args[0]->nump);
initnum(args[0], 1, 0, 0);
args[0]->nump[0] = dummy.nump[0];
rettype = String;
break;
case ston:
inpstrtonum(&dummy, (char*) args[0]->nump, 0, mainptrs->bigEndian);
copynum(args[0], &dummy, false);
rettype = Number;
break;
case ntos:
numasstr(args[0], mainptrs->bigEndian, (bool)numtoint(args[1], false));
rettype = String;
break;
case prun:
copynum(&dummy, ®s[path], 0);
appendnum(&dummy, args[0]);
copynum(args[0], &dummy, 0);
case run:
RunScript(mainptrs, (char*)args[0]->nump);
doprint = false;
break;
case rnd:
randnum(args[0], numtoint(args[1], false));
break;
case SAVE:
saveload((char*)args[0]->nump, 's', mainptrs);
doprint = false;
break;
case LOAD:
saveload((char*)args[0]->nump, 'l', mainptrs);
doprint = false;
break;
}
if(rettype == UnDef){
if(printptr->nump[0] > 9) rettype = String;
else rettype = Number;
}
if(doprint){
switch (rettype){
case Number:
printnum(printptr, mainptrs->bigEndian);
break;
case String:
printstrnum(printptr);
printf("\n");
break;
}
copynum(®s[ans], printptr, 0);
}
free(dummy.nump);
time_t end_time = time(&end_time);
inttonum(®s[ptme], (int64_t) end_time - begin_time);
if(mainptrs->debug == 'v') printf("stdlib executed\n");
return 0;
}
int libFuncPtrs_AASM_STDLIB(){
initfuncs[AASM_STDLIB] = &init_std;
instructhandlers[AASM_STDLIB] = &instructhandler_std;
argumenthandlers[AASM_STDLIB] = &argumenthandler_std;
executehandlers[AASM_STDLIB] = &executehandler_std;
updatefuncs[AASM_STDLIB] = &update_std;
freefuncs[AASM_STDLIB] = &free_std;
return 0;
}
//############################################### </Std essentials>
#endif