-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathvmachine.cpp
1085 lines (1013 loc) · 37 KB
/
vmachine.cpp
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
////////////////////////////////////////////////////////////////////////////////
// DScript Scripting Language
// Copyright (C) 2003 Bryan "daerid" Ross
//
// Permission to copy, use, modify, sell and distribute this software is
// granted provided this copyright notice appears in all copies. This
// software is provided "as is" without express or implied warranty, and
// with no claim as to its suitability for any purpose.
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
// Standard Library Includes
#include <algorithm>
#include <sstream>
#include <stdexcept>
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
// DScript Includes
#include "vmachine.h"
#include "context.h"
////////////////////////////////////////////////////////////////////////////////
using namespace std;
using namespace dscript;
void vmachine::execute(
instr_iter begin,
instr_iter end,
instr_iter instr,
context& ctx
)
{
// push a new stack frame
m_callstack.push(dictionary_t());
// the current stack frame
dictionary_t& stack_frame = m_callstack.top();
while(instr != end)
{
op_code o = instr->get_op_code();
bool returned = false;
switch(o)
{
case op_push_param:
{
// push the top of the stack as a parameter
// then pop the top of the runtime stack
m_param_stack.push_back(m_runtime_stack.top());
m_runtime_stack.pop();
++instr;
}
break;
case op_call_func:
// get a reference to the func_table entry
{
// get the name of the function
++instr;
string_table::entry name = instr->get_str();
// Clear the return value (in case of error)
m_return_val.clear();
// get a reference to the function
func_table::entry* e = functions.find(name);
if(e == 0)
{
m_return_val.set_type(value::type_int);
m_return_val.intval = 0;
ctx.log_msg("function \"" + string(name) + "\" not found");
m_param_stack.clear();
}
else if(e->is_host)
{
// validate min/max args
if(e->min_args != -1)
{
if(m_param_stack.size() < size_t(e->min_args))
ctx.log_msg("Usage: " + (e->name + e->usage_string));
}
if(e->max_args != -1)
{
if(m_param_stack.size() > size_t(e->max_args))
ctx.log_msg("Usage: " + (e->name + e->usage_string));
}
// host function
// gotta reverse the args
reverse(m_param_stack.begin(),m_param_stack.end());
// call it!
(*(e->host_func))(m_param_stack,ctx);
// clear the param frame
m_param_stack.clear();
}
else
{
// script function
execute(
e->begin,
e->end,
e->start,
ctx
);
// clear the param frame
m_param_stack.clear();
}
++instr;
}
break;
case op_push_str:
// push the named string
++instr;
m_runtime_stack.push(instr->get_str());
++instr;
break;
case op_push_int:
// push the int
++instr;
m_runtime_stack.push(instr->get_int());
++instr;
break;
case op_push_float:
// push a float
++instr;
m_runtime_stack.push(*(instr->get_flt()));
++instr;
break;
case op_cat_aidx_expr:
// cat the two values on top with a '_'
{
value tocat = m_runtime_stack.top();
m_runtime_stack.pop();
tocat.set_type(value::type_str);
m_runtime_stack.top() =
m_runtime_stack.top().to_str() + '_' + tocat.to_str();
++instr;
}
break;
case op_push_var:
{
++instr;
string_table::entry ste = instr->get_str();
dictionary_t& dict = (ste[0]=='$') ? globals : stack_frame;
m_runtime_stack.push(dict[instr->get_str()]);
++instr;
}
break;
case op_push_var_value:
// replace the top of the stack with the value of
// the variable named by the top of the stack
{
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
dictionary_t& dict = (ste[0]=='$') ? globals : stack_frame;
m_runtime_stack.top() = dict[ste];
++instr;
}
break;
case op_load_ret:
{
// push the value in the return
// register onto the top of the stack
m_runtime_stack.push(m_return_val);
++instr;
}
break;
case op_inc_var:
// increment the variable named by one
{
++instr;
string_table::entry ste = instr->get_str();
dictionary_t& dict = (ste[0]=='$') ? globals : stack_frame;
dict[ste].set_type(value::type_int);
++(dict[ste].intval);
++instr;
}
break;
case op_dec_var:
// decrement the variable named by one
{
++instr;
string_table::entry ste = instr->get_str();
dictionary_t& dict = (ste[0]=='$') ? globals : stack_frame;
dict[ste].set_type(value::type_int);
--(dict[ste].intval);
++instr;
}
break;
case op_neg:
// negate the top of the stack
// promote to int
m_runtime_stack.top().set_type(value::type_int);
m_runtime_stack.top().intval = -(m_runtime_stack.top().intval);
++instr;
break;
case op_log_not:
// logical not the top of the stack
// promote to int
m_runtime_stack.top().set_type(value::type_int);
m_runtime_stack.top().intval = !(m_runtime_stack.top().intval);
++instr;
break;
case op_bit_not:
// binary not the top of the stack
// promote to int
m_runtime_stack.top().set_type(value::type_int);
m_runtime_stack.top().intval = ~(m_runtime_stack.top().intval);
++instr;
break;
case op_mul:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// multiply the new top by the popped top
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval *= top.intval;
else
{
newtop.set_type(value::type_flt);
newtop.fltval *= top.to_flt();
}
++instr;
}
break;
case op_div:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// divide the new top by the popped top
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
{
// check divide by zero error
if(top.intval == 0)
throw runtime_error("Divide by zero encountered.");
newtop.intval /= top.intval;
}
else
{
newtop.set_type(value::type_flt);
newtop.fltval /= top.to_flt();
}
++instr;
}
break;
case op_mod:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// mod the new top by the popped top
// mod may only be done on integral types
newtop.set_type(value::type_int);
newtop.intval %= top.to_int();
++instr;
}
break;
case op_add:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// add the new top to the popped top
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval += top.intval;
else
{
newtop.set_type(value::type_flt);
newtop.fltval += top.to_flt();
}
++instr;
}
break;
case op_sub:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// subtract the popped top from the new top
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval -= top.intval;
else
{
newtop.set_type(value::type_flt);
newtop.fltval -= top.to_flt();
}
++instr;
}
break;
case op_cat:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// concat the two top values together
// check types (keep int if both are int, otherwise go to flt)
newtop.set_type(value::type_str);
newtop.strval.append(top.to_str());
++instr;
}
break;
case op_shl:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// shift left the new top by the popped top
// shift left may only be done on integral types
newtop.set_type(value::type_int);
newtop.intval <<= top.to_int();
++instr;
}
break;
case op_shr:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// shift right the new top by the popped top
// shift right may only be done on integral types
newtop.set_type(value::type_int);
newtop.intval >>= top.to_int();
++instr;
}
break;
case op_cmp_less_eq:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval <= top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() <= top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_cmp_less:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval < top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() < top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_cmp_grtr_eq:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval >= top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() >= top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_cmp_grtr:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval > top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() > top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_eq:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval == top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() == top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_neq:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types (keep int if both are int, otherwise go to flt)
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval != top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() != top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_bit_and:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// only can be done on ints
newtop.set_type(value::type_int);
newtop.intval &= top.to_int();
++instr;
}
break;
case op_bit_or:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// only can be done on ints
newtop.set_type(value::type_int);
newtop.intval |= top.to_int();
++instr;
}
break;
case op_bit_xor:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// only can be done on ints
newtop.set_type(value::type_int);
newtop.intval ^= top.to_int();
++instr;
}
break;
case op_log_and:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval && top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() && top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_log_or:
{
// grab the top one
value top = m_runtime_stack.top();
m_runtime_stack.pop();
value& newtop = m_runtime_stack.top();
// check types
if(
top.type == value::type_int &&
newtop.type == value::type_int
)
newtop.intval = newtop.intval || top.intval;
else
{
// bypass the conversion process
newtop.intval = newtop.to_flt() || top.to_flt();
newtop.type = value::type_int;
}
++instr;
}
break;
case op_decl_func:
{
// first thing will be the function name,
// second will be offset at which function ends
++instr;
string_table::entry func_name = instr->get_str();
++instr;
int offset = instr->get_int();
++instr; // now points to first instruction of the function
instr_iter func_end = begin + offset;
functions.add_script_func(
func_name,
begin,
instr,
func_end
);
instr = func_end;
}
break;
case op_pop_param:
{
// grab the name
++instr;
string_table::entry ste = instr->get_str();
// pop the top of the param stack into the named var
if(m_param_stack.size() > 0)
{
stack_frame[ste] = m_param_stack.back();
m_param_stack.pop_back();
}
else
stack_frame[ste].clear();
++instr;
}
break;
case op_return:
returned = true;
break;
case op_store_ret:
// store the top of the runtime stack in the return value register
m_return_val = m_runtime_stack.top();
m_runtime_stack.pop();
++instr;
break;
case op_assign:
// the top of the stack is a value
// the next underneath is the name of a variable
// store the value in the variable
{
value v = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
dictionary_t& dict = (ste[0] == '$') ? globals : stack_frame;
dict[ste] = v;
++instr;
}
break;
case op_assign_var:
// assign the variable designated
// the value on the top of the stack
{
++instr;
string_table::entry ste = instr->get_str();
dictionary_t& dict = (ste[0] == '$') ? globals : stack_frame;
dict[ste] = m_runtime_stack.top();
m_runtime_stack.pop();
++instr;
}
break;
case op_mul_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// multiply the variable by the value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
if(var.type == value::type_int && val.type == value::type_int)
var.intval *= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval *= val.to_flt();
}
++instr;
}
break;
case op_mul_asn_var:
// multiply a specified variable by a value
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value val = m_runtime_stack.top();
m_runtime_stack.pop();
if(var.type == value::type_int && val.type == value::type_int)
var.intval *= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval *= val.to_flt();
}
++instr;
}
break;
case op_div_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// divide the variable by the value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
if(var.type == value::type_int && val.type == value::type_int)
var.intval /= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval /= val.to_flt();
}
++instr;
}
break;
case op_div_asn_var:
// divide a specified variable by a value
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
if(var.type == value::type_int && val.type == value::type_int)
var.intval /= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval /= val.to_flt();
}
++instr;
}
break;
case op_mod_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// multiply the variable by the value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_int);
var.intval %= val.to_int();
++instr;
}
break;
case op_mod_asn_var:
// mod a specified variable by a value
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
// must be an int type
var.set_type(value::type_int);
var.intval %= val.to_int();
++instr;
}
break;
case op_add_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// add the value to the variable
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
if(var.type == value::type_int && val.type == value::type_int)
var.intval += val.intval;
else
{
var.set_type(value::type_flt);
var.fltval += val.to_flt();
}
++instr;
}
break;
case op_add_asn_var:
// add a specified variable to a value
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
if(var.type == value::type_int && val.type == value::type_int)
var.intval += val.intval;
else
{
var.set_type(value::type_flt);
var.fltval += val.to_flt();
}
++instr;
}
break;
case op_sub_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// add the value to the variable
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
if(var.type == value::type_int && val.type == value::type_int)
var.intval -= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval -= val.to_flt();
}
++instr;
}
break;
case op_sub_asn_var:
// subtract a value from a specified variable
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
if(var.type == value::type_int && val.type == value::type_int)
var.intval -= val.intval;
else
{
var.set_type(value::type_flt);
var.fltval -= val.to_flt();
}
++instr;
}
break;
case op_cat_asn:
// the top of the stack is a value
// the next underneath is the name of a variable
// add the value to the variable
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_str);
var.strval.append(val.to_str());
++instr;
}
break;
case op_cat_asn_var:
// add a specified variable to a value
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value val = m_runtime_stack.top();
m_runtime_stack.pop();
var.set_type(value::type_str);
var.strval.append(val.to_str());
++instr;
}
break;
case op_band_asn:
// binary and a variable's value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_int);
var.intval &= val.to_int();
++instr;
}
break;
case op_band_asn_var:
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
// must be an int type
var.set_type(value::type_int);
var.intval &= val.to_int();
++instr;
}
break;
case op_bor_asn:
// binary or a variable's value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_int);
var.intval |= val.to_int();
++instr;
}
break;
case op_bor_asn_var:
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
// must be an int type
var.set_type(value::type_int);
var.intval |= val.to_int();
++instr;
}
break;
case op_bxor_asn:
// binary xor a variable's value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_int);
var.intval ^= val.to_int();
++instr;
}
break;
case op_bxor_asn_var:
{
++instr;
string_table::entry ste = instr->get_str();
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
value& val = m_runtime_stack.top();
m_runtime_stack.pop();
// must be an int type
var.set_type(value::type_int);
var.intval ^= val.to_int();
++instr;
}
break;
case op_shl_asn:
// shift left a variable's value
{
value val = m_runtime_stack.top();
m_runtime_stack.pop();
string_table::entry ste =
strings.insert(m_runtime_stack.top().to_str());
m_runtime_stack.pop();
// set the var's value
value& var = (ste[0] == '$') ? globals[ste] : stack_frame[ste];
var.set_type(value::type_int);
var.intval <<= val.to_int();