-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjs_object.c
1106 lines (856 loc) · 23.4 KB
/
js_object.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "js.h"
#include "js_db.h"
#include "js_props.h"
#include "js_string.h"
extern PropFcn *builtinFcn[];
value_t newObject(valuetype_t type) {
value_t v;
v.bits = vt_object;
v.addr = js_alloc(sizeof(object_t), true);
v.oval->protoBase = type;
v.refcount = 1;
return v;
}
value_t newArray(enum ArrayType subType, uint32_t initSize) {
value_t v;
v.bits = vt_array;
v.addr = js_alloc(sizeof(array_t), true);
v.aval->obj = newObject(vt_array);
if (initSize)
v.aval->valuePtr = newVector (initSize, sizeof(value_t), false);
v.subType = subType;
v.objvalue = 1;
v.refcount = 1;
return v;
}
// retrieve baseVal from object
value_t *baseObject(value_t obj) {
if (obj.marshaled || obj.oval->baseVal->type == vt_undef )
return NULL;
return obj.oval->baseVal;
}
value_t convArray2Value(void *val, enum ArrayType type) {
value_t result;
switch (type) {
case array_value:
return *(value_t *)val;
case array_int8:
result.bits = vt_int;
result.nval = *(int8_t *)val;
return result;
case array_uint8:
result.bits = vt_int;
result.nval = *(uint8_t *)val;
return result;
case array_int16:
result.bits = vt_int;
result.nval = *(int16_t *)val;
return result;
case array_uint16:
result.bits = vt_int;
result.nval = *(uint16_t *)val;
return result;
case array_int32:
result.bits = vt_int;
result.nval = *(int32_t *)val;
return result;
case array_uint32:
result.bits = vt_int;
result.nval = *(uint32_t *)val;
return result;
case array_float32:
result.bits = vt_dbl;
result.dbl = *(float *)val;
return result;
case array_float64:
result.bits = vt_dbl;
result.dbl = *(double *)val;
return result;
}
result.bits = vt_undef;
return result;
}
void storeArrayValue(value_t left, value_t right) {
string_t *leftstr = js_dbaddr(left, NULL);
switch (left.subType) {
case array_value:
*left.lval = right;
return;
case array_int8:
*(int8_t *)leftstr->val = (int8_t)conv2Int(right, true).nval;
return;
case array_uint8:
*(uint8_t *)leftstr->val = (uint8_t)conv2Int(right, true).nval;
return;
case array_int16:
*(int16_t *)leftstr->val = (int16_t)conv2Int(right, true).nval;
return;
case array_uint16:
*(uint16_t *)leftstr->val = (uint16_t)conv2Int(right, true).nval;
return;
case array_int32:
*(int32_t *)leftstr->val = (int32_t)conv2Int(right, true).nval;
return;
case array_uint32:
*(uint32_t *)leftstr->val = (uint32_t)conv2Int(right, true).nval;
return;
case array_float32:
*(float *)leftstr->val = (float)conv2Dbl(right, true).dbl;
return;
case array_float64:
*(double *)leftstr->val = conv2Dbl(right, true).dbl;
return;
}
}
uint64_t hashStr(uint8_t *str, uint32_t len) {
uint64_t hash = 0;
uint64_t mask;
while (len>=8) {
len -= 8;
hash += *((uint64_t *) &str[len]);
hash *= 5;
}
mask = 1ULL << len * 8;
return hash += --mask & (*((uint64_t *) &str[0]));
}
void hashStore(void *table, uint32_t hashEnt, uint32_t idx, uint32_t val) {
switch (hashEnt) {
case 1:
((uint8_t *)table)[idx] = val;
return;
case 2:
((uint16_t *)table)[idx] = val;
return;
case 4:
((uint32_t *)table)[idx] = val;
return;
default:
fprintf(stderr, "bad hash table entry size: %d\n", hashEnt);
exit(0);
}
}
uint32_t hashEntry(void *table, uint32_t hashEnt, uint32_t idx) {
switch (hashEnt) {
case 1:
return ((uint8_t *)table)[idx];
case 2:
return ((uint16_t *)table)[idx];
case 4:
return ((uint32_t *)table)[idx];
default:
fprintf(stderr, "bad hash table entry size: %d\n", hashEnt);
exit(0);
}
}
uint32_t hashBytes(uint32_t cap) {
if (cap < 255) {
return sizeof(uint8_t);
} else if (cap < 65535) {
return sizeof(uint16_t);
}
return sizeof(uint32_t);
}
// evaluate object value
value_t evalBuiltin(value_t v, document_t *rawDoc, value_t original, bool lval, bool eval) {
if (v.type == vt_lval)
return v;
if (eval && v.type == vt_closure) {
array_t aval[1];
value_t args;
memset (aval, 0, sizeof(args));
args.bits = vt_array;
args.aval = aval;
return fcnCall(v, args, original, false, NULL);
}
if (original.type == vt_object && !original.marshaled && original.oval->baseVal->type)
original = *original.oval->baseVal;
if (eval && v.type == vt_propfcn)
return (builtinFcn[v.subType][v.nval].fcn)(NULL, original, NULL);
if (v.type == vt_propval)
return callFcnProp(v, original, lval);
if (v.marshaled) {
v.rawDoc = rawDoc;
incrRefCnt(v);
}
return v;
}
// execute lookup/access operation in object/prototype/builtins
typedef enum {
ProtoChain,
ProtoBase,
OriginalVal,
AllDone
} LookupPhase;
value_t lookupAttribute(value_t obj, string_t *attr, value_t original, bool lVal, bool eval) {
LookupPhase phase = ProtoChain;
value_t v, field;
uint64_t hash;
field.bits = vt_string;
field.addr = attr;
// reference to fcn prototype?
if (obj.type == vt_closure) {
if (attr->len == 9 && !memcmp(attr->val, "prototype", 9)) {
if (lVal ) {
v.bits = vt_lval;
v.lval = &obj.closure->protoObj;
} else
v = obj.closure->protoObj;
return v;
}
}
// attribute on object like things
if (obj.objvalue)
obj = *obj.lval;
hash = hashStr(attr->val, attr->len);
// go to builtins if not an object
if (obj.type != vt_object)
if (obj.type == vt_hndl)
obj = builtinProtoHndl[obj.subType];
else
obj = builtinProto[obj.type];
if (obj.type != vt_object)
return v.bits = vt_undef, v;
if (obj.marshaled) {
// 1st, look in the object
if ((v = lookup(obj, field, lVal, hash)).type != vt_undef)
return evalBuiltin(v, obj.rawDoc, original, lVal, eval);
// 2nd, look in the original type builtins
if (original.type == vt_hndl) {
if ((v = lookup(builtinProtoHndl[original.subType], field, lVal,
hash)).type != vt_undef)
return evalBuiltin(v, obj.rawDoc, original, lVal, eval);
} else
if ((v = lookup(builtinProto[original.type], field, lVal, hash))
.type != vt_undef)
return evalBuiltin(v, obj.rawDoc, original, lVal, eval);
// 3rd, look in the object type builtins
if ((v = lookup(builtinProto[vt_object], field, lVal, hash)).type != vt_undef)
return evalBuiltin(v, obj.rawDoc, original, lVal, eval);
return v.bits = vt_undef, v;
}
// examine prototype chain
// then examine baseVal builtins
while (obj.type == vt_object) {
object_t *oval = obj.oval;
// look for attribute
// in the object
if ((v = lookup(obj, field, lVal, hash)).type != vt_undef)
return evalBuiltin(v, obj.rawDoc, original, lVal, eval);
if (lVal)
break;
switch (phase) {
case ProtoChain:
obj = oval->protoChain;
phase = ProtoBase;
if (obj.type == vt_object)
continue;
// check original object builtins
case ProtoBase:
phase = OriginalVal;
if (oval->protoBase) {
if( oval->protoBase == vt_hndl)
obj = builtinProtoHndl[oval->protoSub];
else
obj = builtinProto[oval->protoBase];
continue;
}
// check built-ins for original type
case OriginalVal:
phase = AllDone;
if (original.type == vt_hndl)
obj = builtinProtoHndl[original.subType];
else
obj = builtinProto[original.type];
continue;
// nothing found
case AllDone:
break;
}
break;
}
v.bits = vt_undef;
return v;
}
// return vector value slot idx + 1 (>0)
// or hash slot h (<= 0)
int lookupValue(value_t obj, value_t name, uint64_t hash, bool find) {
dbobject_t *dboval = js_dbaddr(obj, NULL);
string_t *namestr = js_dbaddr(name, NULL);
int idx, h, hashMod, hashEnt;
uint32_t start, cap;
pair_t *pairs;
void *hashTbl;
pairs = obj.marshaled ? dboval->pairs : obj.oval->pairsPtr;
cap = obj.marshaled ? dboval->cnt : vec_max(obj.oval->pairsPtr);
if (!cap)
return 0;
if (!hash)
hash = hashStr(namestr->val, namestr->len);
hashEnt = hashBytes(cap);
hashMod = 3 * cap / 2;
hashTbl = pairs + cap;
start = hash % hashMod;
h = start;
while ((idx = hashEntry(hashTbl, hashEnt, h))) {
if (find) {
value_t v = pairs[idx - 1].name;
string_t *keystr = js_dbaddr(v, obj.rawDoc);
if (keystr->len == namestr->len) {
if (!memcmp(keystr->val, namestr->val, namestr->len))
return idx;
}
}
if (++h == hashMod)
h = 0;
if (h == start) {
fprintf(stderr, "hash table overflow looking for %.*s\n", namestr->len, namestr->val);
exit(0);
}
}
return -h;
}
//
// insert new object value
value_t *setAttribute(object_t *oval, value_t name, uint32_t h) {
uint32_t cap = vec_max(oval->pairsPtr);
uint32_t hashMod, hashEnt;
string_t *namestr;
void *hashTbl;
uint32_t idx;
pair_t pair;
hashTbl = oval->pairsPtr + cap;
hashEnt = hashBytes(cap);
hashMod = 3 * cap / 2;
pair.value.bits = vt_undef;
pair.name = name;
incrRefCnt(name);
// append the new object pair vector
// is the pair vector full?
if (vec_cnt(oval->pairsPtr) + 1 < cap) {
oval->pairsPtr[vec_size(oval->pairsPtr)++] = pair;
hashStore(hashTbl, hashEnt, h, vec_size(oval->pairsPtr));
} else {
oval->pairsPtr = vec_grow (oval->pairsPtr, cap, sizeof(pair_t), true);
cap = vec_max(oval->pairsPtr);
hashEnt = hashBytes(cap);
hashTbl = oval->pairsPtr + cap;
hashMod = 3 * cap / 2;
// append the new object pair vector
// with the new property
oval->pairsPtr[vec_size(oval->pairsPtr)++] = pair;
// rehash current & new entries
for (idx=0; idx < vec_cnt(oval->pairsPtr); idx++) {
namestr = js_dbaddr(oval->pairsPtr[idx].name, NULL);
h = hashStr(namestr->val, namestr->len) % hashMod;
while (hashEntry(hashTbl, hashEnt, h))
if (++h == hashMod)
h = 0;
hashStore(hashTbl, hashEnt, h, idx + 1);
}
}
// return new slot value address
idx = vec_cnt(oval->pairsPtr);
return &oval->pairsPtr[idx - 1].value;
}
// lookup value in object/dbobject
value_t lookup(value_t obj, value_t name, bool lVal, uint64_t hash) {
dbobject_t *dboval = js_dbaddr(obj, NULL);
value_t v;
int idx;
idx = lookupValue(obj, name, hash, true);
if (idx > 0) {
if (obj.marshaled)
v = dboval->pairs[idx - 1].value;
else if (lVal) {
v.bits = vt_lval;
v.lval = &obj.oval->pairsPtr[idx - 1].value;
} else
v = obj.oval->pairsPtr[idx - 1].value;
if (v.marshaled && obj.marshaled) {
v.rawDoc = obj.rawDoc;
incrRefCnt(v);
}
return v;
}
if (!lVal)
return v.bits = vt_undef, v;
if (obj.marshaled)
obj = convDocObject(obj);
v.bits = vt_lval;
v.lval = setAttribute(obj.oval, name, -idx);
return v;
}
// TODO -- remove the field from the name & value vectors and hash table
value_t *deleteField(object_t *obj, value_t name) {
uint32_t cap = vec_max(obj->pairsPtr);
void *hashTbl = obj->pairsPtr + cap;
string_t *namestr = js_dbaddr(name, NULL);
uint32_t hashEnt = hashBytes(cap);
uint32_t hashMod = 3 * cap / 2;
uint32_t idx, start, h;
if (cap)
h = hashStr(namestr->val, namestr->len) % hashMod;
else
return NULL;
start = h;
do {
if ((idx = hashEntry(hashTbl, hashEnt, h))) {
pair_t *key = obj->pairsPtr + idx - 1;
string_t *keystr = js_dbaddr(key->name, NULL);
if (keystr->len == namestr->len)
if (!memcmp(keystr->val, namestr->val, namestr->len))
return &obj->pairsPtr[idx - 1].value;
}
if (++h == hashMod)
h = 0;
} while (h != start);
// not there
return NULL;
}
value_t fcnArrayToString(value_t *args, value_t thisVal, environment_t *env) {
value_t *array = vec_cnt(args) ? args : &thisVal;
dbarray_t *dbaval = js_dbaddr(*array, NULL);
value_t ending, comma, ans[1];
uint32_t idx = 0;
value_t *values;
uint32_t cnt;
values = array->marshaled ? dbaval->valueArray : array->aval->valuePtr;
cnt = array->marshaled ? dbaval->cnt : vec_cnt(values);
ans->bits = vt_string;
ans->addr = &LeftBrackStr;
comma.bits = vt_string;
comma.addr = &CommaStr;
while (idx < cnt) {
value_t v = values[idx];
v = conv2Str(v, false, v.type == vt_string);
valueCat(ans, v, true);
if (++idx < cnt)
valueCat(ans, comma, false);
}
ending.bits = vt_string;
ending.addr = &RightBrackStr;
valueCat(ans, ending, false);
return *ans;
}
/*
value_t fcnObjectIs(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectKeys(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectPreventExtensions(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectSeal(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectSetPrototypeOf(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectValues(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectIsExtensible(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectIsFrozen(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectIsSealed(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectCreate(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectEntries(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectFreeze(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectGetOwnPropDesc(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectGetOwnPropNames(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectGetOwnPropSymbols(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectDefineProp(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
value_t fcnObjectDefineProps(value_t *args, value_t *thisVal, environment_t *env) {
value_t val;
val.bits = vt_undef;
return val;
}
*/
value_t fcnObjectSetValue(value_t *args, value_t thisVal, environment_t *env) {
object_t *oval;
value_t base;
if (thisVal.marshaled)
return base.bits = vt_undef, base;
if (thisVal.objvalue)
oval = js_dbaddr(*thisVal.lval, NULL);
else
oval = js_dbaddr(thisVal, NULL);
if (vec_cnt(args))
base = args[0];
else
base.bits = vt_undef;
replaceSlot(oval->baseVal, base);
return base;
}
value_t fcnObjectHasOwnProperty(value_t *args, value_t thisVal, environment_t *env) {
value_t val, obj;
if (thisVal.objvalue)
obj = *thisVal.lval;
else
obj = thisVal;
val.bits = vt_bool;
if (vec_cnt(args))
val.boolean = lookup(obj, args[0], false, 0).type == vt_undef ? false : true;
else
val.boolean = false;
return val;
}
value_t fcnObjectValueOf(value_t *args, value_t thisVal, environment_t *env) {
value_t obj;
if (vec_cnt(args))
obj = args[0];
else if (thisVal.objvalue)
obj = *thisVal.lval;
else
obj = thisVal;
if (obj.marshaled)
return obj;
if (obj.oval->baseVal->type == vt_undef)
return thisVal;
return *obj.oval->baseVal;
}
/*
value_t fcnObjectLock(value_t *args, value_t *thisVal, environment_t *env) {
object_t *oval;
value_t val;
if (thisVal->objvalue)
oval = js_dbaddr(*thisVal->lval, NULL);
if (vec_cnt(args) > 0)
mode = conv2Int(args[0], false);
else
return val.bits = vt_undef, val;
if (mode.type != vt_int)
return val.bits = vt_undef, val;
switch (mode.nval) {
case 0: readLock(oval->lock); break;
case 1: writeLock(oval->lock); break;
}
val.bits = vt_bool;
val.boolean = true;
return val;
}
value_t fcnObjectUnlock(value_t *args, value_t *thisVal, environment_t *env) {
object_t *oval;
value_t val;
if (thisVal->objvalue)
oval = js_dbaddr(*thisVal->lval, NULL);
rwUnlock(oval->lock);
val.bits = vt_bool;
val.boolean = true;
return val;
}
*/
value_t fcnObjectToString(value_t *args, value_t thisVal, environment_t *env) {
value_t *obj = vec_cnt(args) ? args : &thisVal;
value_t colon, ending, comma, ans[1];
dbobject_t *dboval = js_dbaddr(*obj, NULL);
uint32_t idx = 0;
pair_t *pairs;
uint32_t cnt;
pairs = obj->marshaled ? dboval->pairs : obj->oval->pairsPtr;
cnt = obj->marshaled ? dboval->cnt : vec_cnt(pairs);
ans->bits = vt_string;
ans->addr = &LeftBraceStr;
colon.bits = vt_string;
colon.addr = &ColonStr;
comma.bits = vt_string;
comma.addr = &CommaStr;
while (idx < cnt) {
value_t v = pairs[idx].name;
if (v.marshaled && obj->marshaled) {
v.rawDoc = obj->rawDoc;
incrRefCnt(v);
}
v = conv2Str(v, false, true);
valueCat(ans, v, true);
valueCat(ans, colon, false);
v = pairs[idx].value;
if (v.marshaled && obj->marshaled) {
v.rawDoc = obj->rawDoc;
incrRefCnt(v);
}
v = conv2Str(v, true, v.type == vt_string);
valueCat(ans, v, true);
if (++idx < cnt)
valueCat(ans, comma, false);
}
ending.bits = vt_string;
ending.addr = &RightBraceStr;
valueCat(ans, ending, false);
return *ans;
}
value_t propObjProto(value_t val, bool lVal) {
value_t ref, *proto = &val.oval->protoChain;
if (val.marshaled)
return builtinProto[vt_object];
if (!lVal)
return *proto;
ref.bits = vt_lval;
ref.lval = proto;
return ref;
}
value_t propObjLength(value_t val, bool lVal) {
value_t len;
len.bits = vt_int;
len.nval = 1;
return len;
}
value_t fcnArraySlice(value_t *args, value_t thisVal, environment_t *env) {
dbarray_t *dbaval = js_dbaddr(thisVal, NULL);
value_t slice, end;
uint32_t start, count;
value_t *values;
value_t array;
uint32_t idx, cnt;
values = thisVal.marshaled ? dbaval->valueArray : thisVal.aval->valuePtr;
cnt = thisVal.marshaled ? dbaval->cnt : vec_cnt(values);
if (vec_cnt(args) > 0)
slice = conv2Int(args[0], false);
else {
slice.bits = vt_int;
slice.nval = 0;
}
if (vec_cnt(args) > 1)
end = conv2Int(args[1], false);
else {
end.bits = vt_int;
end.nval = cnt;
}
if (slice.type != vt_int)
slice.nval = 0;
if (end.nval < 0)
end.nval += cnt;
if (end.nval > cnt || end.nval == 0)
end.nval = cnt;
if (slice.nval < 0) {
start = (uint32_t)slice.nval + cnt;
count = (uint32_t)(-slice.nval);
} else {
start = (uint32_t)slice.nval;
count = (uint32_t)end.nval - start;
}
array = newArray(array_value, count);
for (idx = 0; idx < count; idx++) {
value_t nxt = values[start + idx];
array.aval->valuePtr[idx] = nxt;
incrRefCnt(nxt);
}
return array;
}
value_t fcnArrayConcat(value_t *args, value_t thisVal, environment_t *env) {
value_t array = newArray(array_value, 0);
dbarray_t *dbaval = js_dbaddr(thisVal, NULL);
uint32_t idx, cnt, j;
value_t *values;
values = thisVal.marshaled ? dbaval->valueArray : thisVal.aval->valuePtr;
cnt = thisVal.marshaled ? dbaval->cnt : vec_cnt(values);
// clone existing array values
for (idx = 0; idx < cnt; idx++) {
value_t nxt = values[idx];
vec_push(array.aval->valuePtr, nxt);
incrRefCnt(nxt);
}
// append new argument elements
for (idx = 0; idx < vec_cnt(args); idx++) {
if (args[idx].type == vt_array) {
dbarray_t *nxt = js_dbaddr(args[idx], NULL);
value_t *nxtvalues = args[idx].marshaled ? nxt->valueArray : args[idx].aval->valuePtr;
uint32_t nxtcnt = args[idx].marshaled ? nxt->cnt : vec_cnt(nxtvalues);
for (j = 0; j < nxtcnt; j++) {
vec_push(array.aval->valuePtr, nxtvalues[j]);
incrRefCnt(nxtvalues[j]);
}
} else {
vec_push (array.aval->valuePtr, args[idx]);
incrRefCnt(args[idx]);
}
}
return array;
}
value_t fcnArrayValueOf(value_t *args, value_t thisVal, environment_t *env) {
if (vec_cnt(args))
return args[0];
else
return thisVal;
}
value_t fcnArrayJoin(value_t *args, value_t thisVal, environment_t *env) {
dbarray_t *dbaval = js_dbaddr(thisVal, NULL);
value_t delim, val[1], v;
value_t *values;
int cnt, idx;
values = thisVal.marshaled ? dbaval->valueArray : thisVal.aval->valuePtr;
cnt = thisVal.marshaled ? dbaval->cnt : vec_cnt(values);
if (vec_cnt(args) > 0)
delim = conv2Str(args[0], false, false);
else {
delim.bits = vt_string;
delim.addr = &CommaStr;
}
val->bits = vt_string;
val->addr = &EmptyStr;
for (idx = 0; idx < cnt; idx++) {
v = conv2Str(values[idx], false, false);
valueCat(val, v, true);
if (idx < cnt - 1)
valueCat(val, delim, false);
}
abandonValue (delim);
return *val;
}
/*
value_t fcnArrayLock(value_t *args, value_t *thisVal, environment_t *env) {
array_t *array = js_dbaddr(*thisVal, NULL);
value_t val, mode;
if (vec_cnt(args) > 0)
mode = conv2Int(args[0], false);
else
return val.bits = vt_undef, val;
if (mode.type != vt_int)
return val.bits = vt_undef, val;
switch (mode.nval) {
case 0: readLock(aval->lock); break;
case 1: writeLock(aval->lock); break;
}
val.bits = vt_bool;
val.boolean = true;