-
Notifications
You must be signed in to change notification settings - Fork 12
/
api_interpreter.d
3729 lines (3001 loc) · 109 KB
/
api_interpreter.d
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 module contains most of the public "raw" API, as well as the Croc
bytecode interpreter.
This module is $(B way) too big!
License:
Copyright (c) 2008 Jarrett Billingsley
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the
use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it freely,
subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software in a
product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not
be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
******************************************************************************/
module croc.api_interpreter;
import tango.core.Exception;
import tango.core.Memory;
import tango.core.Traits;
import tango.core.Tuple;
import tango.core.Vararg;
import croc.api_checks;
import croc.api_debug;
import croc.api_stack;
import croc.base_alloc;
import croc.base_gc;
import croc.base_metamethods;
import croc.interpreter;
import croc.types;
import croc.types_array;
import croc.types_class;
import croc.types_function;
import croc.types_instance;
import croc.types_memblock;
import croc.types_namespace;
import croc.types_nativeobj;
import croc.types_string;
import croc.types_table;
import croc.types_thread;
import croc.types_weakref;
import croc.utf;
import croc.utils;
private
{
extern(C) void* rt_stackBottom();
extern(C) void* rt_stackTop();
}
// ================================================================================================================================================
// Public
// ================================================================================================================================================
public:
// ================================================================================================================================================
// VM-related functions
/**
Push the metatable for the given type. If the type has no metatable, pushes null. The type given must be
one of the "normal" types -- the "internal" types are illegal and an error will be thrown.
Params:
type = The type whose metatable is to be pushed.
Returns:
The stack index of the newly-pushed value (null if the type has no metatable, or a namespace if it does).
*/
word getTypeMT(CrocThread* t, CrocValue.Type type)
{
mixin(FuncNameMix);
// ORDER CROCVALUE TYPE
if(!(type >= CrocValue.Type.FirstUserType && type <= CrocValue.Type.LastUserType))
{
if(type >= CrocValue.Type.min && type <= CrocValue.Type.max)
throwStdException(t, "TypeException", __FUNCTION__ ~ " - Cannot get metatable for type '{}'", CrocValue.typeStrings[type]);
else
throwStdException(t, "ApiError", __FUNCTION__ ~ " - Invalid type '{}'", type);
}
if(auto ns = t.vm.metaTabs[cast(uword)type])
return push(t, CrocValue(ns));
else
return pushNull(t);
}
/**
Sets the metatable for the given type to the namespace or null at the top of the stack. Throws an
error if the type given is one of the "internal" types, or if the value at the top of the stack is
neither null nor a namespace.
Params:
type = The type whose metatable is to be set.
*/
void setTypeMT(CrocThread* t, CrocValue.Type type)
{
mixin(apiCheckNumParams!("1"));
// ORDER CROCVALUE TYPE
if(!(type >= CrocValue.Type.FirstUserType && type <= CrocValue.Type.LastUserType))
{
if(type >= CrocValue.Type.min && type <= CrocValue.Type.max)
throwStdException(t, "TypeException", __FUNCTION__ ~ " - Cannot set metatable for type '{}'", CrocValue.typeStrings[type]);
else
throwStdException(t, "ApiError", __FUNCTION__ ~ " - Invalid type '{}'", type);
}
auto v = getValue(t, -1);
if(v.type == CrocValue.Type.Namespace)
t.vm.metaTabs[cast(uword)type] = v.mNamespace;
else if(v.type == CrocValue.Type.Null)
t.vm.metaTabs[cast(uword)type] = null;
else
mixin(apiParamTypeError!("-1", "metatable", "namespace|null"));
pop(t);
}
/**
Pushes the VM's registry namespace onto the stack. The registry is sort of a hidden global namespace only accessible
from native code and which native code may use for any purpose.
Returns:
The stack index of the newly-pushed namespace.
*/
word getRegistry(CrocThread* t)
{
return push(t, CrocValue(t.vm.registry));
}
/**
Allocates a block of memory using the given thread's VM's allocator function. This memory is $(B not) garbage-collected.
You must free the memory returned by this function in order to avoid memory leaks.
The array returned by this function should not have its length set or be appended to (~=).
Params:
size = The size, in bytes, of the block to allocate.
Returns:
A void array representing the memory block.
*/
void[] allocMem(CrocThread* t, uword size)
{
return t.vm.alloc.allocArray!(void)(size);
}
/**
Resize a block of memory. $(B Only call this on memory that has been allocated using the allocMem, _resizeMem or dupMem
functions.) If you pass this function an empty (0-length) memory block, it will allocate memory. If you resize an existing
block to a length of 0, it will deallocate that memory.
If you resize a block to a smaller size, its data will be truncated. If you resize a block to a larger size, the empty
space will be uninitialized.
The array returned by this function through the mem parameter should not have its length set or be appended to (~=).
Params:
mem = A reference to the memory block you want to reallocate. This is a reference so that the original memory block
reference that you pass in is updated. This can be a 0-length array.
size = The size, in bytes, of the new size of the memory block.
*/
void resizeMem(CrocThread* t, ref void[] mem, uword size)
{
t.vm.alloc.resizeArray(mem, size);
}
/**
Duplicate a block of memory. This is safe to call on memory that was not allocated with the thread's VM's allocator.
The new block will be the same size and contain the same data as the old block.
The array returned by this function should not have its length set or be appended to (~=).
Params:
mem = The block of memory to copy. This is not required to have been allocated by allocMem, resizeMem, or _dupMem.
Returns:
The new memory block.
*/
void[] dupMem(CrocThread* t, void[] mem)
{
return t.vm.alloc.dupArray(mem);
}
/**
Free a block of memory. $(B Only call this on memory that has been allocated with allocMem, resizeMem, or dupMem.)
It's legal to free a 0-length block.
Params:
mem = A reference to the memory block you want to free. This is a reference so that the original memory block
reference that you pass in is updated. This can be a 0-length array.
*/
void freeMem(CrocThread* t, ref void[] mem)
{
t.vm.alloc.freeArray(mem);
}
/**
Creates a reference to a Croc object. A reference is like the native equivalent of Croc's nativeobj. Whereas a
nativeobj allows Croc to hold a reference to a native object, a reference allows native code to hold a reference
to a Croc object.
References are identified by unique integer values which are passed to the $(D pushRef) and $(D removeRef) functions.
These are guaranteed to be probabilistically to be unique for the life of the program. What I mean by that is that
if you created a million references per second, it would take you over half a million years before the reference
values wrapped around. Aren'_t 64-bit integers great?
References prevent the referenced Croc object from being collected, ever, so unless you want memory leaks, you must
call $(D removeRef) when your code no longer needs the object. See $(croc.ex) for some reference helpers.
Params:
idx = The stack index of the object to which a reference should be created. If this refers to a value type,
an exception will be thrown.
Returns:
The new reference name for the given object. You can create several references to the same object; it will not
be collectible until all references to it have been removed.
*/
ulong createRef(CrocThread* t, word idx)
{
mixin(FuncNameMix);
auto v = getValue(t, idx);
if(!v.isGCObject())
{
pushTypeString(t, idx);
throwStdException(t, "ApiError", __FUNCTION__ ~ " - Can only get references to reference types, not '{}'", getString(t, -1));
}
auto ret = t.vm.currentRef++;
*t.vm.refTab.insert(t.vm.alloc, ret) = v.mBaseObj;
return ret;
}
/**
Pushes the object associated with the given reference onto the stack and returns the slot of the pushed object.
If the given reference is invalid, an exception will be thrown.
*/
word pushRef(CrocThread* t, ulong r)
{
mixin(FuncNameMix);
auto v = t.vm.refTab.lookup(r);
if(v is null)
throwStdException(t, "ApiError", __FUNCTION__ ~ " - Reference '{}' does not exist", r);
return push(t, CrocValue(*v));
}
/**
Removes the given reference. When all references to an object are removed, it will no longer be considered to be
referenced by the host app and will be subject to normal GC rules. If the given reference is invalid, an
exception will be thrown.
*/
void removeRef(CrocThread* t, ulong r)
{
mixin(FuncNameMix);
if(!t.vm.refTab.remove(r))
throwStdException(t, "ApiError", __FUNCTION__ ~ " - Reference '{}' does not exist", r);
}
/**
Pushes the 'Throwable' class which forms the root of the Croc exception hierarchy.
Returns:
The stack index of the pushed class.
*/
word pushThrowableClass(CrocThread* t)
{
return push(t, CrocValue(t.vm.throwable));
}
/**
Pushes the 'exceptions.Location' class, which is used often in exceptions and tracebacks.
Returns:
The stack index of the pushed class.
*/
word pushLocationClass(CrocThread* t)
{
return push(t, CrocValue(t.vm.location));
}
// ================================================================================================================================================
// GC-related stuff
/**
Runs the garbage collector if necessary.
This will perform a garbage collection only if a sufficient amount of memory has been allocated since
the last collection.
Params:
t = The thread to use to collect the garbage. Garbage collection is vm-wide but requires a thread
in order to be able to call finalization methods.
Returns:
The number of bytes collected, which may be 0.
*/
uword maybeGC(CrocThread* t)
{
if(t.vm.alloc.gcDisabled > 0)
return 0;
if(t.vm.alloc.couldUseGC())
return gc(t);
else
return 0;
}
/**
Runs the garbage collector unconditionally.
Params:
t = The thread to use to collect the garbage. Garbage collection is vm-wide but requires a thread
in order to be able to call finalization methods.
fullCollect = If true, forces a full garbage collection this cycle. In the case of the currently-implemented
GC, this forces the collector to run a cyclic garbage collection phase. Cyclic garbage must be scanned
for occasionally when using a reference counting scheme, but it can be time-consuming. Normally it is only
scanned for occasionally, but you can force it to occur.
Returns:
The number of bytes collected by this collection cycle.
*/
uword gc(CrocThread* t, bool fullCollect = false)
{
if(t.vm.alloc.gcDisabled > 0)
return 0;
auto beforeSize = t.vm.alloc.totalBytes;
gcCycle(t.vm, fullCollect ? GCCycleType.Full : GCCycleType.Normal);
runFinalizers(t);
t.vm.stringTab.minimize(t.vm.alloc);
t.vm.weakRefTab.minimize(t.vm.alloc);
t.vm.allThreads.minimize(t.vm.alloc);
auto ret = beforeSize > t.vm.alloc.totalBytes ? beforeSize - t.vm.alloc.totalBytes : 0; // This is.. possible? TODO: figure out how.
getRegistry(t);
field(t, -1, "gc.postGCCallbacks");
foreach(word v; foreachLoop(t, 1))
{
dup(t, v);
pushNull(t);
rawCall(t, -2, 0);
}
pop(t);
return ret;
}
/**
Changes various limits used by the garbage collector. Most have an effect on how often GC collections are run. You can set
these limits to better suit your program, or to enforce certain behaviors, but setting them incorrectly can cause the GC to
thrash, collecting way too often and hogging the CPU. Be careful.
Params:
type = The type of limit to be set. The valid types are as follows:
$(UL
$(LI "nurseryLimit" - The size, in bytes, of the nursery generation. Defaults to 512KB. Most objects are initially
allocated in the nursery. When the nursery fills up (the number of bytes allocated exceeds this limit), a collection
will be triggered. Setting the nursery limit higher will cause collections to run less often, but they will take
longer to complete. Setting the nursery limit lower will put more pressure on the older generation as it will not
give young objects a chance to die off, as they usually do. Setting the nursery limit to 0 will cause a collection
to be triggered on every allocation. That's probably bad.)
$(LI "metadataLimit" - The size, in bytes, of the GC metadata. Defaults to 128KB. The metadata includes two buffers: one
keeps track of which old-generation objects have been modified; the other keeps track of which old-generation objects
need to have their reference counts decreased. This is pretty low-level stuff, but generally speaking, the more object
mutation your program has, the faster these buffers will fill up. When they do, a collection is triggered. Much like
the nursery limit, setting this value higher will cause collections to occur less often but they will take longer.
Setting it lower will put more pressure on the older generation, as it will tend to pull objects out of the nursery
before they can have a chance to die off. Setting the metadata limit to 0 will cause a collection to be triggered on
every mutation. That's also probably bad!)
$(LI "nurserySizeCutoff" - The maximum size, in bytes, of an object that can be allocated in the nursery. Defaults to 256.
If an object is bigger than this, it will be allocated directly in the old generation instead. This avoids having large
objects fill up the nursery and causing more collections than necessary. Chances are this won't happen too often, unless
you're allocating really huge class instances. Setting this value to 0 will effectively turn the GC algorithm into a
regular deferred reference counting GC, with only one generation. Maybe that'd be useful for you?)
$(LI "cycleCollectInterval" - Since the Croc reference implementation uses a form of reference counting to do garbage
collection, it must detect cyclic garbage (which would otherwise never be freed). Cyclic garbage usually forms only a
small part of all garbage, but ignoring it would cause memory leaks. In order to avoid that, the GC must occasionally
run a separate cycle collection algorithm during the GC cycle. This is triggered when enough potential cyclic garbage is
buffered (see the next limit type for that), or every $(I n) collections, whichever comes first. This limit is that $(I n).
It defaults to 50; that is, every 50 garbage collection cycles, a cycle collection will be forced, regardless of how much
potential cyclic garbage has been buffered. Setting this limit to 0 will force a cycle collection at every GC cycle, which
isn't that great for performance. Setting this limit very high will cause cycle collections only to be triggered if
enough potential cyclic garbage is buffered, but it's then possible that that garbage can hang around until program end,
wasting memory.)
$(LI "cycleMetadataLimit" - As explained above, the GC will buffer potential cyclic garbage during normal GC cycles, and then
when a cycle collection is initiated, it will look at that buffered garbage and determine whether it really is garbage.
This limit is similar to metadataLimit in that it measures the size of a buffer, and when that buffer size crosses this
limit, a cycle collection is triggered. This defaults to 128KB. The more cyclic garbage your program produces, the faster
this buffer will fill up. Note that Croc is somewhat smart about what it considers potential cyclic garbage; only objects
whose reference counts decrease to a non-zero value are candidates for cycle collection. Of course, this is only a heuristic,
and can have false positives, meaning non-cyclic objects (living or dead) can be scanned by the cycle collector as well.
Thus the cycle collector must be run to reclaim ALL dead objects.)
)
lim = The limit value. Its meaning is determined by the type parameter.
Returns:
The previous value of the limit that was set.
*/
uword gcLimit(CrocThread* t, char[] type, uword lim)
{
switch(type)
{
case "nurseryLimit": auto ret = t.vm.alloc.nurseryLimit; t.vm.alloc.nurseryLimit = lim; return ret;
case "metadataLimit": auto ret = t.vm.alloc.metadataLimit; t.vm.alloc.metadataLimit = lim; return ret;
case "nurserySizeCutoff": auto ret = t.vm.alloc.nurserySizeCutoff; t.vm.alloc.nurserySizeCutoff = lim; return ret;
case "cycleCollectInterval": auto ret = t.vm.alloc.nextCycleCollect; t.vm.alloc.nextCycleCollect = lim; return ret;
case "cycleMetadataLimit": auto ret = t.vm.alloc.cycleMetadataLimit; t.vm.alloc.cycleMetadataLimit = lim; return ret;
default: throwStdException(t, "ValueException", "Invalid limit type '{}'", type);
}
assert(false);
}
/**
Gets the current values of various GC limits. For an explanation of the valid limit types, see the other overload of this function.
Params:
type = See the other overload of gcLimit.
Returns:
The current value of the given limit.
*/
uword gcLimit(CrocThread* t, char[] type)
{
switch(type)
{
case "nurseryLimit": return t.vm.alloc.nurseryLimit;
case "metadataLimit": return t.vm.alloc.metadataLimit;
case "nurserySizeCutoff": return t.vm.alloc.nurserySizeCutoff;
case "cycleCollectInterval": return t.vm.alloc.nextCycleCollect;
case "cycleMetadataLimit": return t.vm.alloc.cycleMetadataLimit;
default: throwStdException(t, "ValueException", "Invalid limit type '{}'", type);
}
assert(false);
}
// ================================================================================================================================================
// Pushing values onto the stack
/**
These push a value of the given type onto the stack.
Returns:
The stack index of the newly-pushed value.
*/
word pushNull(CrocThread* t)
{
return push(t, CrocValue.nullValue);
}
/// ditto
word pushBool(CrocThread* t, bool v)
{
return push(t, CrocValue(v));
}
/// ditto
word pushInt(CrocThread* t, crocint v)
{
return push(t, CrocValue(v));
}
/// ditto
word pushFloat(CrocThread* t, crocfloat v)
{
return push(t, CrocValue(v));
}
/// ditto
word pushChar(CrocThread* t, dchar v)
{
return push(t, CrocValue(v));
}
/// ditto
word pushString(CrocThread* t, char[] v)
{
return push(t, CrocValue(createString(t, v)));
}
/**
Push a formatted string onto the stack. This works exactly like tango.text.convert.Layout (and in fact
calls it), except that the destination buffer is a Croc string.
Params:
fmt = The Tango-style format string.
... = The arguments to be formatted.
Returns:
The stack index of the newly-pushed string.
*/
word pushFormat(CrocThread* t, char[] fmt, ...)
{
return pushVFormat(t, fmt, _arguments, _argptr);
}
/**
A version of pushFormat meant to be called from variadic functions.
Params:
fmt = The Tango-style format string.
arguments = The array of TypeInfo for the variadic _arguments.
argptr = The platform-specific argument pointer.
Returns:
The stack index of the newly-pushed string.
*/
word pushVFormat(CrocThread* t, char[] fmt, TypeInfo[] arguments, va_list argptr)
{
uword numPieces = 0;
uint sink(char[] data)
{
if(data.length > 0)
{
pushString(t, data);
numPieces++;
}
return data.length;
}
try
t.vm.formatter.convert(&sink, arguments, argptr, fmt);
catch(CrocException e)
throw e;
catch(Exception e)
throwStdException(t, "ValueException", "Error during string formatting: {}", e);
maybeGC(t);
if(numPieces == 0)
return pushString(t, "");
else
return cat(t, numPieces);
}
/**
Creates a new table object and pushes it onto the stack.
Params:
size = The number of slots to preallocate in the table, as an optimization.
Returns:
The stack index of the newly-created table.
*/
word newTable(CrocThread* t, uword size = 0)
{
maybeGC(t);
return push(t, CrocValue(table.create(t.vm.alloc, size)));
}
/**
Creates a new array object and pushes it onto the stack.
Params:
len = The length of the new array.
Returns:
The stack index of the newly-created array.
*/
word newArray(CrocThread* t, uword len)
{
maybeGC(t);
return push(t, CrocValue(array.create(t.vm.alloc, len)));
}
/**
Creates a new array object using values at the top of the stack. Pops those values and pushes
the new array onto the stack.
Params:
len = How many values on the stack to be put into the array, and the length of the resulting
array.
Returns:
The stack index of the newly-created array.
*/
word newArrayFromStack(CrocThread* t, uword len)
{
mixin(apiCheckNumParams!("len"));
maybeGC(t);
auto a = array.create(t.vm.alloc, len);
array.sliceAssign(t.vm.alloc, a, 0, len, t.stack[t.stackIndex - len .. t.stackIndex]);
pop(t, len);
return push(t, CrocValue(a));
}
/**
Creates a new memblock object and pushes it onto the stack.
Params:
len = The length of the memblock in bytes. Can be 0.
Returns:
The stack index of the newly-created memblock.
*/
word newMemblock(CrocThread* t, uword len)
{
maybeGC(t);
return push(t, CrocValue(memblock.create(t.vm.alloc, len)));
}
/**
Creates a new memblock object whose data is a copy of a native array. The resulting memblock will
own its data and the original array will not be referenced in any way.
Params:
arr = The source data array.
Returns:
The stack index of the newly-created memblock.
*/
word memblockFromNativeArray(CrocThread* t, void[] arr)
{
auto ret = newMemblock(t, arr.length);
auto data = cast(void[])getMemblock(t, ret).data;
data[] = arr[];
return ret;
}
/**
Creates a new memblock object whose data is a view into a native array.
This means that $(B the memblock will point into the native heap.) As a result, it is the responsibility
of the host program to ensure that this data is valid for the lifetime of the memblock. If it becomes
invalid, script code can crash the host. The resulting memblock will $(B not) own its data.
Params:
arr = The array to create a view of.
Returns:
The stack index of the newly-created memblock.
*/
word memblockViewNativeArray(CrocThread* t, void[] arr)
{
return push(t, CrocValue(memblock.createView(t.vm.alloc, arr)));
}
/**
Creates a new native closure and pushes it onto the stack.
If you want to associate upvalues with the function, you should push them in order on
the stack before calling newFunction and then pass how many upvalues you pushed.
An example:
-----
// 1. Push any upvalues. Here we have two. Note that they are pushed in order:
// upvalue 0 will be 5 and upvalue 1 will be "hi" once the closure is created.
pushInt(t, 5);
pushString(t, "hi");
// 2. Call newFunction.
newFunction(t, &myFunc, "myFunc", 2);
// 3. Store the resulting closure somewhere.
setGlobal(t, "myFunc");
-----
This function pops any upvalues off the stack and leaves the new closure in their place.
The function's environment is, by default, the current environment (see pushEnvironment).
To use a different environment, see newFunctionWithEnv.
Params:
func = The native function to be used in the closure.
name = The _name to be given to the function. This is just the 'debug' _name that
shows up in error messages. In order to make the function accessible, you have
to actually put the resulting closure somewhere, like in the globals, or in
a namespace.
numUpvals = How many upvalues there are on the stack under the _name to be associated
with this closure. Defaults to 0.
Returns:
The stack index of the newly-created closure.
*/
word newFunction(CrocThread* t, NativeFunc func, char[] name, uword numUpvals = 0)
{
pushEnvironment(t);
return newFunctionWithEnv(t, func, name, numUpvals);
}
/**
Same as above, but allows you to set the maximum allowable number of parameters that can
be passed to this function. If more than numParams parameters are passed to this function,
an exception will be thrown. If fewer are passed, it is not an error.
*/
word newFunction(CrocThread* t, uint numParams, NativeFunc func, char[] name, uword numUpvals = 0)
{
pushEnvironment(t);
return newFunctionWithEnv(t, numParams, func, name, numUpvals);
}
/**
Creates a new native closure with an explicit environment and pushes it onto the stack.
Very similar to newFunction, except that it also expects the environment for the function
(a namespace) to be on top of the stack. Using newFunction's example, one would push
the environment namespace after step 1, and step 2 would call newFunctionWithEnv instead.
Params:
func = The native function to be used in the closure.
name = The _name to be given to the function. This is just the 'debug' _name that
shows up in error messages. In order to make the function accessible, you have
to actually put the resulting closure somewhere, like in the globals, or in
a namespace.
numUpvals = How many upvalues there are on the stack under the _name and environment to
be associated with this closure. Defaults to 0.
Returns:
The stack index of the newly-created closure.
*/
word newFunctionWithEnv(CrocThread* t, NativeFunc func, char[] name, uword numUpvals = 0)
{
return newFunctionWithEnv(t, .func.MaxParams, func, name, numUpvals);
}
/**
Same as above, but allows you to set the maximum allowable number of parameters that can
be passed to this function. See newFunction for more details.
*/
word newFunctionWithEnv(CrocThread* t, uint numParams, NativeFunc func, char[] name, uword numUpvals = 0)
{
mixin(apiCheckNumParams!("numUpvals + 1"));
auto env = getNamespace(t, -1);
if(env is null)
mixin(apiParamTypeError!("-1", "environment", "namespace"));
maybeGC(t);
auto f = .func.create(t.vm.alloc, env, createString(t, name), func, numUpvals, numParams);
f.nativeUpvals()[] = t.stack[t.stackIndex - 1 - numUpvals .. t.stackIndex - 1];
pop(t, numUpvals + 1); // upvals and env.
return push(t, CrocValue(f));
}
/**
Creates a new script function closure and pushes it on the stack.
The given function definition may not have any upvalues. If it does, an error will be thrown.
If the definition is cacheable and there is already an instantiation of it, then the cached instantiation
will be pushed. Otherwise, a new closure will be created (and cached if the definition is cacheable). In the
case that a new closure is created, its environment will be the current environment. To use a different
environment, use newFunctionWithEnv.
Params:
funcDef: The stack index of the function definition object.
Returns:
The stack index of the new closure.
*/
word newFunction(CrocThread* t, word funcDef)
{
funcDef = absIndex(t, funcDef);
pushEnvironment(t);
return newFunctionWithEnv(t, funcDef);
}
/**
Same as above, except it expects an explicit environment object to be at the top of the stack. This environment
is popped and the new closure is pushed in its place. If the given function definition is cacheable and has a
cached instantiation already, the environment on the stack is ignored. This is because such a situation is impossible
within the language. In Croc, if a function is judged to be cacheable, then it is impossible to create closures
of it with different environments.
Params:
funcDef: The stack index of the function definition object.
Returns:
The stack index of the new closure.
*/
word newFunctionWithEnv(CrocThread* t, word funcDef)
{
mixin(apiCheckNumParams!("1"));
funcDef = absIndex(t, funcDef);
auto def = getFuncDef(t, funcDef);
if(def is null)
{
pushTypeString(t, funcDef);
throwStdException(t, "TypeException", __FUNCTION__ ~ " - funcDef must be a function definition, not a '{}'", getString(t, -1));
}
if(def.numUpvals > 0)
throwStdException(t, "ValueException", __FUNCTION__ ~ " - Function definition may not have any upvalues");
auto env = getNamespace(t, -1);
if(env is null)
{
pushTypeString(t, -1);
throwStdException(t, "TypeException", __FUNCTION__ ~ " - Environment must be a namespace, not a '{}'", getString(t, -1));
}
maybeGC(t);
auto ret = .func.create(t.vm.alloc, env, def);
if(ret is null)
{
pushToString(t, funcDef);
throwStdException(t, "RuntimeException", __FUNCTION__ ~ " - Attempting to instantiate {} with a different namespace than was associated with it", getString(t, -1));
}
pop(t);
return push(t, CrocValue(ret));
}
/**
Creates a new class and pushes it onto the stack.
After creating the class, you can then fill it with members by using fielda.
Params:
base = The stack index of the _base class. The _base can be `null`, in which case the new class will have no base
class. Otherwise it must be a class.
name = The _name of the class. Remember that you still have to store the class object somewhere,
though, like in a global.
Returns:
The stack index of the newly-created class.
*/
word newClass(CrocThread* t, word base, char[] name)
{
mixin(FuncNameMix);
CrocClass* b = void;
if(isNull(t, base))
b = null;
else if(auto c = getClass(t, base))
b = c;
else
{
pushTypeString(t, base);
throwStdException(t, "TypeException", __FUNCTION__ ~ " - Base must be 'null' or 'class', not '{}'", getString(t, -1));
}
maybeGC(t);
return push(t, CrocValue(classobj.create(t.vm.alloc, createString(t, name), b)));
}
/**
Same as above, except it uses null as the base. The new class is left on the top of the stack.
*/
word newClass(CrocThread* t, char[] name)
{
mixin(FuncNameMix);
maybeGC(t);
return push(t, CrocValue(classobj.create(t.vm.alloc, createString(t, name), null)));
}
/**
Creates an instance of a class and pushes it onto the stack. This does $(I not) call any
constructors defined for the class; this simply allocates an instance.
Croc instances can have two kinds of extra data associated with them for use by the host: extra
Croc values and arbitrary bytes. The structure of a Croc instance is something like this:
-----
// ---------
// | |
// | | The data that's part of every instance - its parent class, fields, and finalizer.
// | |
// +-------+
// |0: "x" | Extra Croc values which can point into the Croc heap.
// |1: 5 |
// +-------+
// |... | Arbitrary byte data.
// ---------
-----
Both extra sections are optional, and no instances created from script classes will have them.
Extra Croc values are useful for adding "members" to the instance which are not visible to the
scripts but which can still hold Croc objects. They will be scanned by the GC, so objects
referenced by these members will not be collected. If you want to hold a reference to a native
D object, for instance, this would be the place to put it (wrapped in a NativeObject).
The arbitrary bytes associated with an instance are not scanned by either the D or the Croc GC,
so don'_t store references to GC'ed objects there. These bytes are useable for just about anything,
such as storing values which can'_t be stored in Croc values -- structs, complex numbers, long
integers, whatever.
A clarification: You can store references to $(B heap) objects in the extra bytes, but you must not
store references to $(B GC'ed) objects there. That is, you can 'malloc' some data and store the pointer
in the extra bytes, since that's not GC'ed memory. You must however perform your own memory management for
such memory. You can set up a finalizer function for instances in which you can perform memory management
for these references.
Params:
base = The class from which this instance will be created.
numValues = How many extra Croc values will be associated with the instance. See above.
extraBytes = How many extra bytes to attach to the instance. See above.
*/
word newInstance(CrocThread* t, word base)
{
mixin(FuncNameMix);
auto b = getClass(t, base);
if(b is null)
{
pushTypeString(t, base);
throwStdException(t, "TypeException", __FUNCTION__ ~ " - expected 'class' for base, not '{}'", getString(t, -1));
}
maybeGC(t);
return push(t, CrocValue(instance.create(t.vm, b)));
}
/**
Creates a new namespace object and pushes it onto the stack.
The parent of the new namespace will be the current function environment, exactly
as in Croc when you declare a namespace without an explicit parent.
Params:
name = The _name of the namespace.
Returns:
The stack index of the newly-created namespace.
*/
word newNamespace(CrocThread* t, char[] name)
{
push(t, CrocValue(getEnv(t)));
newNamespace(t, -1, name);
insertAndPop(t, -2);
return stackSize(t) - 1;
}
/**
Creates a new namespace object with an explicit parent and pushes it onto the stack.
Params:
parent = The stack index of the _parent. The _parent can be null, in which case
the new namespace will not have a _parent. Otherwise it must be a namespace.
name = The _name of the namespace.
Returns:
The stack index of the newly-created namespace.
*/
word newNamespace(CrocThread* t, word parent, char[] name)
{
mixin(FuncNameMix);
CrocNamespace* p = void;
if(isNull(t, parent))
p = null;
else if(isNamespace(t, parent))
p = getNamespace(t, parent);
else
{
pushTypeString(t, parent);
throwStdException(t, "TypeException", __FUNCTION__ ~ " - Parent must be null or namespace, not '{}'", getString(t, -1));
}
maybeGC(t);
return push(t, CrocValue(namespace.create(t.vm.alloc, createString(t, name), p)));
}