-
Notifications
You must be signed in to change notification settings - Fork 16
/
stubs-ia32.cc
1297 lines (953 loc) · 27 KB
/
stubs-ia32.cc
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 "stubs.h"
#include "code-space.h" // CodeSpace
#include "cpu.h" // CPU
#include "ast.h" // BinOp
#include "macroassembler.h" // Masm
#include "runtime.h"
#include "pic.h"
namespace candor {
namespace internal {
#define __ masm()->
BaseStub::BaseStub(CodeSpace* space, StubType type) : space_(space),
masm_(space),
type_(type) {
}
void BaseStub::GeneratePrologue() {
__ push(ebp);
__ mov(ebp, esp);
__ AllocateSpills();
}
void BaseStub::GenerateEpilogue(int args) {
__ FinalizeSpills();
__ mov(esp, ebp);
__ pop(ebp);
// Caller should unwind stack
__ ret(0);
}
void EntryStub::Generate() {
GeneratePrologue();
// Store callee-save registers
__ push(ebx);
__ push(esi);
__ push(edi);
__ push(edi);
Operand fn(ebp, 2 * 4);
Operand argc(ebp, 3 * 4);
Operand argv(ebp, 4 * 4);
__ EnterFramePrologue();
// Push all arguments to stack
Label even, align1, align2, align3, args, args_loop, unwind_even;
__ mov(eax, argc);
__ Untag(eax);
// Odd arguments count check (for alignment)
// NOTE: On ia32 we're trying to make argc % 4 == 0
__ mov(ebx, eax);
__ andb(ebx, Immediate(3));
__ cmpb(ebx, Immediate(0));
__ jmp(kEq, &even);
__ cmpb(ebx, Immediate(1));
__ jmp(kEq, &align1);
__ cmpb(ebx, Immediate(2));
__ jmp(kEq, &align2);
__ cmpb(ebx, Immediate(3));
__ jmp(kEq, &align3);
__ bind(&align1);
__ pushb(Immediate(0));
__ bind(&align2);
__ pushb(Immediate(0));
__ bind(&align3);
__ pushb(Immediate(0));
__ bind(&even);
// Get pointer to the end of arguments array
__ mov(ebx, eax);
__ shl(ebx, Immediate(2));
__ mov(edx, argv);
__ addl(ebx, edx);
__ jmp(&args_loop);
__ bind(&args);
__ sublb(ebx, Immediate(4));
// Get argument from list
Operand arg(ebx, 0);
__ mov(eax, arg);
__ push(eax);
// Loop if needed
__ bind(&args_loop);
__ cmpl(ebx, edx);
__ jmp(kNe, &args);
// Nullify all registers to help GC distinguish on-stack values
__ xorl(ebx, ebx);
__ xorl(ecx, ecx);
__ xorl(edx, edx);
__ xorl(scratch, scratch);
// Put argc
__ mov(eax, argc);
// Call code
__ mov(ebx, fn);
__ CallFunction(ebx);
// Unwind arguments
__ mov(ebx, argc);
__ Untag(ebx);
__ testb(ebx, Immediate(3));
__ jmp(kEq, &unwind_even);
__ orlb(ebx, Immediate(3));
__ inc(ebx);
__ bind(&unwind_even);
__ shl(ebx, Immediate(2));
__ addl(esp, ebx);
__ EnterFrameEpilogue();
// Restore callee-save registers
__ pop(edi);
__ pop(edi);
__ pop(esi);
__ pop(ebx);
GenerateEpilogue();
}
void AllocateStub::Generate() {
GeneratePrologue();
// Align stack
__ pushb(Immediate(0));
__ pushb(Immediate(0));
__ pushb(Immediate(0));
__ push(ebx);
// Arguments
Operand size(ebp, 3 * 4);
Operand tag(ebp, 2 * 4);
Label runtime_allocate, done;
Heap* heap = masm()->heap();
Immediate heapref(reinterpret_cast<intptr_t>(heap));
Immediate top(reinterpret_cast<intptr_t>(heap->new_space()->top()));
Immediate limit(reinterpret_cast<intptr_t>(heap->new_space()->limit()));
Operand scratch_op(scratch, 0);
// Get pointer to current page's top
// (new_space()->top() is a pointer to space's property
// which is a pointer to page's top pointer
// that's why we are dereferencing it here twice
__ mov(scratch, top);
__ mov(scratch, scratch_op);
__ mov(eax, scratch_op);
__ mov(ebx, size);
__ Untag(ebx);
// Add object size to the top
__ addl(ebx, eax);
__ jmp(kCarry, &runtime_allocate);
// Check if we exhausted buffer
__ mov(scratch, limit);
__ mov(scratch, scratch_op);
__ cmpl(ebx, scratch_op);
__ jmp(kGt, &runtime_allocate);
// We should allocate only even amount of bytes
__ orlb(ebx, Immediate(0x01));
// Update top
__ mov(scratch, top);
__ mov(scratch, scratch_op);
__ mov(scratch_op, ebx);
__ jmp(&done);
// Invoke runtime allocation stub
__ bind(&runtime_allocate);
// Remove junk from registers
__ xorl(eax, eax);
__ xorl(ebx, ebx);
RuntimeAllocateCallback allocate = &RuntimeAllocate;
{
Masm::Align a(masm());
__ Pushad();
__ mov(scratch, size);
__ push(scratch);
__ push(scratch);
// Two arguments: heap, size
__ push(scratch);
__ push(heapref);
__ mov(scratch, Immediate(*reinterpret_cast<intptr_t*>(&allocate)));
__ Call(scratch);
__ addlb(esp, 4 * 4);
__ Popad(eax);
}
// Voila result and result_end are pointers
__ bind(&done);
// Set tag
Operand qtag(eax, HValue::kTagOffset);
__ mov(scratch, tag);
__ Untag(scratch);
__ mov(qtag, scratch);
// eax will hold resulting pointer
__ pop(ebx);
GenerateEpilogue();
}
void AllocateFunctionStub::Generate() {
GeneratePrologue();
// Arguments
Operand argc(ebp, 3 * 4);
Operand addr(ebp, 2 * 4);
__ Allocate(Heap::kTagFunction, reg_nil, HValue::kPointerSize * 4, eax);
// Move address of current context to first slot
Operand qparent(eax, HFunction::kParentOffset);
Operand qaddr(eax, HFunction::kCodeOffset);
Operand qroot(eax, HFunction::kRootOffset);
Operand qargc(eax, HFunction::kArgcOffset);
Heap* heap = masm()->heap();
Immediate root(reinterpret_cast<intptr_t>(heap->old_space()->root()));
Operand scratch_op(scratch, 0);
__ mov(qparent, context_reg);
__ mov(scratch, root);
__ mov(scratch, scratch_op);
__ mov(qroot, scratch);
// Put addr of code and argc
__ mov(scratch, addr);
__ mov(qaddr, scratch);
__ mov(scratch, argc);
__ mov(qargc, scratch);
__ CheckGC();
GenerateEpilogue();
}
void AllocateObjectStub::Generate() {
GeneratePrologue();
// Arguments
Operand size(ebp, 3 * 4);
Operand tag(ebp, 2 * 4);
__ mov(ecx, tag);
__ mov(ebx, size);
__ AllocateObjectLiteral(Heap::kTagNil, ecx, ebx, eax);
GenerateEpilogue();
}
void CallBindingStub::Generate() {
GeneratePrologue();
Operand argc(ebp, 3 * 4);
Operand fn(ebp, 2 * 4);
// Save all registers
__ Pushad();
// binding(argc, argv)
__ mov(eax, argc);
__ Untag(eax);
__ mov(ebx, ebp);
// old ebp + return address + two arguments + two words alignment
__ addlb(ebx, Immediate(6 * 4));
__ mov(scratch, eax);
__ shl(scratch, Immediate(2));
__ subl(ebx, scratch);
// argv should point to the end of arguments array
__ mov(scratch, eax);
__ shl(scratch, Immediate(2));
__ addl(ebx, scratch);
__ ExitFramePrologue();
Operand code(scratch, HFunction::kCodeOffset);
__ push(ebx); // align
__ push(ebx); //
__ push(ebx); // <- argv
__ push(eax); // <- argc
__ mov(scratch, fn);
__ Call(code);
__ addlb(esp, Immediate(4 * 4));
__ ExitFrameEpilogue();
// Restore all except eax
__ Popad(eax);
__ CheckGC();
GenerateEpilogue();
}
void CollectGarbageStub::Generate() {
GeneratePrologue();
RuntimeCollectGarbageCallback gc = &RuntimeCollectGarbage;
__ Pushad();
{
Masm::Align a(masm());
// RuntimeCollectGarbage(heap, stack_top)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, esp);
__ push(esi);
__ push(esi);
__ push(esi);
__ push(edi);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&gc)));
__ Call(eax);
__ addlb(esp, Immediate(4 * 4));
}
__ Popad(reg_nil);
GenerateEpilogue();
}
void TypeofStub::Generate() {
GeneratePrologue();
Heap* heap = masm()->heap();
Immediate root(reinterpret_cast<intptr_t>(heap->old_space()->root()));
Operand scratch_op(scratch, 0);
Label not_nil, not_unboxed, done;
Operand type(eax, 0);
__ IsNil(eax, ¬_nil, NULL);
__ mov(eax, Immediate(HContext::GetIndexDisp(Heap::kRootNilTypeIndex)));
__ jmp(&done);
__ bind(¬_nil);
__ IsUnboxed(eax, ¬_unboxed, NULL);
__ mov(eax, Immediate(HContext::GetIndexDisp(Heap::kRootNumberTypeIndex)));
__ jmp(&done);
__ bind(¬_unboxed);
Operand btag(eax, HValue::kTagOffset);
__ movzxb(eax, btag);
__ shl(eax, Immediate(2));
__ addl(eax, Immediate(HContext::GetIndexDisp(
Heap::kRootBooleanTypeIndex - Heap::kTagBoolean)));
__ bind(&done);
// eax contains offset in root_reg
__ mov(scratch, root);
__ mov(scratch, scratch_op);
__ addl(eax, scratch);
__ mov(eax, type);
GenerateEpilogue();
}
void SizeofStub::Generate() {
GeneratePrologue();
RuntimeSizeofCallback sizeofc = &RuntimeSizeof;
__ Pushad();
// RuntimeSizeof(heap, obj)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, eax);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&sizeofc)));
__ push(esi);
__ push(esi);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
GenerateEpilogue(0);
}
void KeysofStub::Generate() {
GeneratePrologue();
RuntimeKeysofCallback keysofc = &RuntimeKeysof;
__ Pushad();
// RuntimeKeysof(heap, obj)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, eax);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&keysofc)));
__ push(esi);
__ push(esi);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
GenerateEpilogue(0);
}
void LookupPropertyStub::Generate() {
GeneratePrologue();
Label is_object, is_array, cleanup, slow_case;
Label non_object_error, done;
// eax <- object
// ebx <- property
// ecx <- change flag
Masm::Spill object_s(masm(), eax);
Masm::Spill change_s(masm(), ecx);
Masm::Spill esi_s(masm(), esi);
// Return nil on non-object's property access
__ IsUnboxed(eax, NULL, &non_object_error);
__ IsNil(eax, NULL, &non_object_error);
// Or into non-object
__ IsHeapObject(Heap::kTagObject, eax, NULL, &is_object);
__ IsHeapObject(Heap::kTagArray, eax, &non_object_error, &is_array);
__ bind(&is_object);
// Fast case: object and a string key
{
__ IsUnboxed(ebx, NULL, &slow_case);
__ IsNil(ebx, NULL, &slow_case);
__ IsHeapObject(Heap::kTagString, ebx, &slow_case, NULL);
__ StringHash(ebx, edx);
Operand qmask(eax, HObject::kMaskOffset);
__ mov(esi, qmask);
// offset = hash & mask + kSpaceOffset
__ andl(edx, esi);
__ addlb(edx, Immediate(HMap::kSpaceOffset));
Operand qmap(eax, HObject::kMapOffset);
Operand qproto(eax, HObject::kProtoOffset);
__ mov(scratch, qmap);
__ addl(scratch, edx);
Label match;
// edx now contains pointer to the key slot in map's space
// compare key's addresses
Operand slot(scratch, 0);
__ mov(scratch, slot);
// Slot should contain either key
__ cmpl(scratch, ebx);
__ jmp(kEq, &match);
// or nil
__ cmpl(scratch, Immediate(Heap::kTagNil));
__ jmp(kNe, &cleanup);
__ bind(&match);
Label fast_case_end, same_key;
// Insert key if was asked
__ cmpl(ecx, Immediate(0));
__ jmp(kEq, &fast_case_end);
// Inserting key in map is required
// invalidate IC if key wasn't the same
__ IsNil(scratch, &same_key, NULL);
__ mov(qproto, Immediate(Heap::kICDisabledValue));
__ bind(&same_key);
// Restore map's interior pointer
__ mov(scratch, qmap);
__ addl(scratch, edx);
// Put the key into slot
__ mov(slot, ebx);
__ bind(&fast_case_end);
// Compute value's address
// eax = key_offset + mask + 4
__ mov(eax, edx);
__ addl(eax, esi);
__ addlb(eax, Immediate(HValue::kPointerSize));
// Cleanup
__ xorl(edx, edx);
esi_s.Unspill();
// Return value
GenerateEpilogue(0);
}
__ bind(&is_array);
// Fast case: dense array and a unboxed key
{
__ IsUnboxed(ebx, &slow_case, NULL);
__ IsNil(ebx, NULL, &slow_case);
__ cmpl(ebx, Immediate(-1));
__ jmp(kLe, &slow_case);
__ IsDenseArray(eax, &slow_case, NULL);
// Get mask
Operand qmask(eax, HObject::kMaskOffset);
__ mov(edx, qmask);
// Check if index is above the mask
// NOTE: ebx is tagged so we need to shift it only 1 time
__ mov(esi, ebx);
__ shl(esi, Immediate(1));
__ cmpl(esi, edx);
__ jmp(kGt, &cleanup);
// Apply mask
__ andl(esi, edx);
// Check if length was increased
Label length_set;
Operand qlength(eax, HArray::kLengthOffset);
__ mov(edx, qlength);
__ Untag(ebx);
__ inc(ebx);
__ cmpl(ebx, edx);
__ jmp(kLe, &length_set);
// Update length
__ mov(qlength, ebx);
__ bind(&length_set);
// ebx is untagged here - so nullify it
__ xorl(ebx, ebx);
// Get index
__ mov(eax, esi);
__ addlb(eax, Immediate(HMap::kSpaceOffset));
// Cleanup
__ xorl(edx, edx);
esi_s.Unspill();
// Return value
GenerateEpilogue(0);
}
__ bind(&cleanup);
esi_s.Unspill();
__ xorl(edx, edx);
__ bind(&slow_case);
__ Pushad();
RuntimeLookupPropertyCallback lookup = &RuntimeLookupProperty;
// RuntimeLookupProperty(heap, obj, key, change)
// (returns addr of slot)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, eax);
__ mov(edx, ebx);
// ecx already contains change flag
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&lookup)));
__ push(ecx);
__ push(edx);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
__ jmp(&done);
__ bind(&non_object_error);
// Non object lookups return nil
__ mov(eax, Immediate(Heap::kTagNil));
__ bind(&done);
GenerateEpilogue();
}
void PICMissStub::Generate() {
GeneratePrologue();
Operand space(ebp, 8);
Operand object(ebp, 12);
Operand result(ebp, 16);
Operand ip(ebp, 20);
// Amend PIC
__ Pushad();
__ push(ip);
__ push(result);
__ push(object);
__ push(space);
PIC::MissCallback miss_cb = &PIC::Miss;
__ mov(scratch, Immediate(*reinterpret_cast<intptr_t*>(&miss_cb)));
__ Call(scratch);
__ addlb(esp, Immediate(4 * 4));
__ Popad(reg_nil);
GenerateEpilogue(0);
}
void CoerceToBooleanStub::Generate() {
GeneratePrologue();
Heap* heap = masm()->heap();
Immediate root(reinterpret_cast<intptr_t>(heap->old_space()->root()));
Operand scratch_op(scratch, 0);
Label unboxed, truel, not_bool, coerced_type;
// Check type and coerce if not boolean
__ IsUnboxed(eax, NULL, &unboxed);
__ IsNil(eax, NULL, ¬_bool);
__ IsHeapObject(Heap::kTagBoolean, eax, ¬_bool, NULL);
__ jmp(&coerced_type);
__ bind(&unboxed);
__ mov(scratch, root);
__ mov(scratch, scratch_op);
Operand truev(scratch, HContext::GetIndexDisp(Heap::kRootTrueIndex));
Operand falsev(scratch, HContext::GetIndexDisp(Heap::kRootFalseIndex));
__ cmpl(eax, Immediate(HNumber::Tag(0)));
__ jmp(kNe, &truel);
__ mov(eax, falsev);
__ jmp(&coerced_type);
__ bind(&truel);
__ mov(eax, truev);
__ jmp(&coerced_type);
__ bind(¬_bool);
__ Pushad();
RuntimeCoerceCallback to_boolean = &RuntimeToBoolean;
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, eax);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&to_boolean)));
__ push(esi);
__ push(esi);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
__ bind(&coerced_type);
__ CheckGC();
GenerateEpilogue(0);
}
void CloneObjectStub::Generate() {
GeneratePrologue();
Label non_object, done;
// eax <- object
__ IsUnboxed(eax, NULL, &non_object);
__ IsNil(eax, NULL, &non_object);
__ IsHeapObject(Heap::kTagObject, eax, &non_object, NULL);
// Get map
Operand qmap(eax, HObject::kMapOffset);
__ mov(eax, qmap);
// Get size
Operand qsize(eax, HMap::kSizeOffset);
__ mov(ecx, qsize);
__ TagNumber(ecx);
// Allocate new object
__ AllocateObjectLiteral(Heap::kTagObject, reg_nil, ecx, edx);
__ mov(ebx, edx);
// Get new object's map
qmap.base(ebx);
__ mov(ebx, qmap);
// Set proto
Operand qproto(edx, HObject::kProtoOffset);
__ mov(qproto, eax);
// Skip headers
__ addlb(eax, Immediate(HMap::kSpaceOffset));
__ addlb(ebx, Immediate(HMap::kSpaceOffset));
// NOTE: ecx is tagged here
// Copy all fields from it
Label loop_start, loop_cond;
__ jmp(&loop_cond);
__ bind(&loop_start);
Operand from(eax, 0), to(ebx, 0);
__ mov(scratch, from);
__ mov(to, scratch);
// Move forward
__ addlb(eax, Immediate(4));
__ addlb(ebx, Immediate(4));
__ dec(ecx);
// Loop
__ bind(&loop_cond);
__ cmpl(ecx, Immediate(0));
__ jmp(kNe, &loop_start);
__ mov(eax, edx);
__ jmp(&done);
__ bind(&non_object);
__ mov(ecx, Immediate(HNumber::Tag(16)));
// Allocate new object
__ AllocateObjectLiteral(Heap::kTagObject, reg_nil, ecx, eax);
__ bind(&done);
GenerateEpilogue();
}
void DeletePropertyStub::Generate() {
GeneratePrologue();
// eax <- receiver
// ebx <- property
//
RuntimeDeletePropertyCallback delp = &RuntimeDeleteProperty;
__ Pushad();
// RuntimeDeleteProperty(heap, obj, property)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, eax);
__ mov(edx, ebx);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&delp)));
__ push(esi);
__ push(edx);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(reg_nil);
GenerateEpilogue();
}
void HashValueStub::Generate() {
GeneratePrologue();
Operand str(ebp, 2 * 4);
RuntimeGetHashCallback hash = &RuntimeGetHash;
__ Pushad();
// RuntimeStringHash(heap, str)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, str);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&hash)));
__ push(esi);
__ push(esi);
__ push(esi);
__ push(edi);
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
// Caller will unwind stack
GenerateEpilogue();
}
void StackTraceStub::Generate() {
// Store caller's frame pointer
__ mov(ebx, ebp);
GeneratePrologue();
// eax <- ip
// ebx <- ebp
//
RuntimeStackTraceCallback strace = &RuntimeStackTrace;
__ Pushad();
// RuntimeStackTrace(heap, frame, ip)
__ mov(edi, Immediate(reinterpret_cast<intptr_t>(masm()->heap())));
__ mov(esi, ebx);
__ mov(edx, eax);
__ push(esi);
__ push(edx);
__ push(esi);
__ push(edi);
__ mov(eax, Immediate(*reinterpret_cast<intptr_t*>(&strace)));
__ call(eax);
__ addlb(esp, Immediate(4 * 4));
__ Popad(eax);
GenerateEpilogue();
}
#define BINARY_SUB_TYPES(V)\
V(Add)\
V(Sub)\
V(Mul)\
V(Div)\
V(Mod)\
V(BAnd)\
V(BOr)\
V(BXor)\
V(Shl)\
V(Shr)\
V(UShr)\
V(Eq)\
V(StrictEq)\
V(Ne)\
V(StrictNe)\
V(Lt)\
V(Gt)\
V(Le)\
V(Ge)\
V(LOr)\
V(LAnd)
void BinOpStub::Generate() {
GeneratePrologue();
Heap* heap = masm()->heap();
Immediate root(reinterpret_cast<intptr_t>(heap->old_space()->root()));
Operand scratch_op(scratch, 0);
// eax <- lhs
// ebx <- rhs
Label not_unboxed, done;
Label lhs_to_heap, rhs_to_heap;
if (type() != BinOp::kDiv) {
// Try working with unboxed numbers
__ IsUnboxed(eax, ¬_unboxed, NULL);
__ IsUnboxed(ebx, ¬_unboxed, NULL);
// Number (+) Number
if (BinOp::is_math(type())) {
Masm::Spill lvalue(masm(), eax);
Masm::Spill rvalue(masm(), ebx);
switch (type()) {
case BinOp::kAdd: __ addl(eax, ebx); break;
case BinOp::kSub: __ subl(eax, ebx); break;
case BinOp::kMul: __ Untag(ebx); __ imull(ebx); break;
default: __ emitb(0xcc); break;
}
// Call stub on overflow
__ jmp(kNoOverflow, &done);
// Restore numbers
lvalue.Unspill();
rvalue.Unspill();
__ jmp(¬_unboxed);
} else if (BinOp::is_binary(type())) {
switch (type()) {
case BinOp::kBAnd: __ andl(eax, ebx); break;
case BinOp::kBOr: __ orl(eax, ebx); break;
case BinOp::kBXor: __ xorl(eax, ebx); break;
case BinOp::kMod:
{
Label zero;
__ xorl(edx, edx);
__ cmpl(ebx, Immediate(HNumber::Tag(0)));
__ jmp(kEq, &zero);
__ idivl(ebx);
__ bind(&zero);
__ mov(eax, edx);
}
break;
case BinOp::kShl:
case BinOp::kShr:
case BinOp::kUShr:
__ mov(ecx, ebx);
__ shr(ecx, Immediate(1));
switch (type()) {
case BinOp::kShl: __ sal(eax); break;
case BinOp::kShr: __ sar(eax); break;
case BinOp::kUShr: __ shr(eax); break;
default: __ emitb(0xcc); break;
}
// Cleanup last bit
__ shr(eax, Immediate(1));
__ shl(eax, Immediate(1));
break;
default: __ emitb(0xcc); break;
}
} else if (BinOp::is_logic(type())) {
Condition cond = masm()->BinOpToCondition(type(), Masm::kIntegral);
// Note: eax and ebx are boxed here
// Otherwise cmp won't work for negative numbers
__ cmpl(eax, ebx);
Label true_, cond_end;
__ mov(scratch, root);