[20102d]: src / compiler / x86 / call.lisp Maximize Restore History

Download this file

call.lisp    1518 lines (1413 with data), 63.9 kB

   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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
;;;; function call for the x86 VM
;;;; This software is part of the SBCL system. See the README file for
;;;; more information.
;;;;
;;;; This software is derived from the CMU CL system, which was
;;;; written at Carnegie Mellon University and released into the
;;;; public domain. The software is in the public domain and is
;;;; provided with absolutely no warranty. See the COPYING and CREDITS
;;;; files for more information.
(in-package "SB!VM")
;;;; interfaces to IR2 conversion
;;; Return a wired TN describing the N'th full call argument passing
;;; location.
(defun standard-arg-location (n)
(declare (type unsigned-byte n))
(if (< n register-arg-count)
(make-wired-tn *backend-t-primitive-type* descriptor-reg-sc-number
(nth n *register-arg-offsets*))
(make-wired-tn *backend-t-primitive-type* control-stack-sc-number n)))
;;; Make a passing location TN for a local call return PC.
;;;
;;; Always wire the return PC location to the stack in its standard
;;; location.
(defun make-return-pc-passing-location (standard)
(declare (ignore standard))
(make-wired-tn (primitive-type-or-lose 'system-area-pointer)
sap-stack-sc-number return-pc-save-offset))
;;; This is similar to MAKE-RETURN-PC-PASSING-LOCATION, but makes a
;;; location to pass OLD-FP in.
;;;
;;; This is wired in both the standard and the local-call conventions,
;;; because we want to be able to assume it's always there. Besides,
;;; the x86 doesn't have enough registers to really make it profitable
;;; to pass it in a register.
(defun make-old-fp-passing-location (standard)
(declare (ignore standard))
(make-wired-tn *fixnum-primitive-type* control-stack-sc-number
ocfp-save-offset))
;;; Make the TNs used to hold OLD-FP and RETURN-PC within the current
;;; function. We treat these specially so that the debugger can find
;;; them at a known location.
;;;
;;; Without using a save-tn - which does not make much sense if it is
;;; wired to the stack?
(defun make-old-fp-save-location (physenv)
(physenv-debug-live-tn (make-wired-tn *fixnum-primitive-type*
control-stack-sc-number
ocfp-save-offset)
physenv))
(defun make-return-pc-save-location (physenv)
(physenv-debug-live-tn
(make-wired-tn (primitive-type-or-lose 'system-area-pointer)
sap-stack-sc-number return-pc-save-offset)
physenv))
;;; Make a TN for the standard argument count passing location. We only
;;; need to make the standard location, since a count is never passed when we
;;; are using non-standard conventions.
(defun make-arg-count-location ()
(make-wired-tn *fixnum-primitive-type* any-reg-sc-number ecx-offset))
;;; Make a TN to hold the number-stack frame pointer. This is allocated
;;; once per component, and is component-live.
(defun make-nfp-tn ()
(make-restricted-tn *fixnum-primitive-type* ignore-me-sc-number))
(defun make-stack-pointer-tn ()
(make-normal-tn *fixnum-primitive-type*))
(defun make-number-stack-pointer-tn ()
(make-restricted-tn *fixnum-primitive-type* ignore-me-sc-number))
;;; Return a list of TNs that can be used to represent an unknown-values
;;; continuation within a function.
(defun make-unknown-values-locations ()
(list (make-stack-pointer-tn)
(make-normal-tn *fixnum-primitive-type*)))
;;; This function is called by the ENTRY-ANALYZE phase, allowing
;;; VM-dependent initialization of the IR2-COMPONENT structure. We
;;; push placeholder entries in the CONSTANTS to leave room for
;;; additional noise in the code object header.
(defun select-component-format (component)
(declare (type component component))
;; The 1+ here is because for the x86 the first constant is a
;; pointer to a list of fixups, or NIL if the code object has none.
;; (If I understand correctly, the fixups are needed at GC copy
;; time because the X86 code isn't relocatable.)
;;
;; KLUDGE: It'd be cleaner to have the fixups entry be a named
;; element of the CODE (aka component) primitive object. However,
;; it's currently a large, tricky, error-prone chore to change
;; the layout of any primitive object, so for the foreseeable future
;; we'll just live with this ugliness. -- WHN 2002-01-02
(dotimes (i (1+ code-constants-offset))
(vector-push-extend nil
(ir2-component-constants (component-info component))))
(values))
;;;; frame hackery
;;; This is used for setting up the Old-FP in local call.
(define-vop (current-fp)
(:results (val :scs (any-reg control-stack)))
(:generator 1
(move val ebp-tn)))
;;; We don't have a separate NFP, so we don't need to do anything here.
(define-vop (compute-old-nfp)
(:results (val))
(:ignore val)
(:generator 1
nil))
;;; Accessing a slot from an earlier stack frame is definite hackery.
(define-vop (ancestor-frame-ref)
(:args (frame-pointer :scs (descriptor-reg))
(variable-home-tn :load-if nil))
(:results (value :scs (descriptor-reg any-reg)))
(:policy :fast-safe)
(:generator 4
(aver (sc-is variable-home-tn control-stack))
(loadw value frame-pointer
(frame-word-offset (tn-offset variable-home-tn)))))
(define-vop (ancestor-frame-set)
(:args (frame-pointer :scs (descriptor-reg))
(value :scs (descriptor-reg any-reg)))
(:results (variable-home-tn :load-if nil))
(:policy :fast-safe)
(:generator 4
(aver (sc-is variable-home-tn control-stack))
(storew value frame-pointer
(frame-word-offset (tn-offset variable-home-tn)))))
(macrolet ((define-frame-op
(suffix sc stack-sc instruction
&optional (ea
`(make-ea :dword
:base frame-pointer
:disp (frame-byte-offset
(tn-offset variable-home-tn)))))
(let ((reffer (symbolicate 'ancestor-frame-ref '/ suffix))
(setter (symbolicate 'ancestor-frame-set '/ suffix)))
`(progn
(define-vop (,reffer ancestor-frame-ref)
(:results (value :scs (,sc)))
(:generator 4
(aver (sc-is variable-home-tn ,stack-sc))
(inst ,instruction value
,ea)))
(define-vop (,setter ancestor-frame-set)
(:args (frame-pointer :scs (descriptor-reg))
(value :scs (,sc)))
(:generator 4
(aver (sc-is variable-home-tn ,stack-sc))
(inst ,instruction ,ea value))))))
(define-x87-frame-op
(suffix sc stack-sc (load set)
&optional (ea
`(make-ea :dword
:base frame-pointer
:disp (frame-byte-offset
(tn-offset variable-home-tn)))))
(let ((reffer (symbolicate 'ancestor-frame-ref '/ suffix))
(setter (symbolicate 'ancestor-frame-set '/ suffix)))
`(progn
(define-vop (,reffer ancestor-frame-ref)
(:results (value :scs (,sc)))
(:generator 4
(aver (sc-is variable-home-tn ,stack-sc))
,(if (symbolp load)
`(with-empty-tn@fp-top (value)
(inst ,load ,ea))
load)))
(define-vop (,setter ancestor-frame-set)
(:args (frame-pointer :scs (descriptor-reg))
(value :scs (,sc)))
(:generator 4
(aver (sc-is variable-home-tn ,stack-sc))
,(if (symbolp set)
`(with-tn@fp-top (value)
(inst ,set ,ea))
set)))))))
(define-frame-op signed-byte-32 signed-reg signed-stack mov)
(define-frame-op unsigned-byte-32 unsigned-reg unsigned-stack mov)
(define-frame-op system-area-pointer sap-reg sap-stack mov)
(define-x87-frame-op double-float double-reg double-stack
(fldd fstd) (make-ea :dword
:base frame-pointer
:disp (frame-byte-offset
(1+ (tn-offset variable-home-tn)))))
(define-x87-frame-op single-float single-reg single-stack
(fld fst))
(define-x87-frame-op complex-double-float complex-double-reg
complex-double-stack
((let ((real (complex-double-reg-real-tn value))
(imag (complex-double-reg-imag-tn value)))
(with-empty-tn@fp-top (real)
(inst fldd (ea-for-cdf-real-stack variable-home-tn frame-pointer)))
(with-empty-tn@fp-top (imag)
(inst fldd (ea-for-cdf-imag-stack variable-home-tn frame-pointer))))
(let ((real (complex-double-reg-real-tn value))
(imag (complex-double-reg-imag-tn value)))
(with-tn@fp-top (real)
(inst fstd (ea-for-cdf-real-stack variable-home-tn frame-pointer)))
(with-tn@fp-top (imag)
(inst fstd (ea-for-cdf-imag-stack variable-home-tn frame-pointer))))))
(define-x87-frame-op complex-single-float complex-single-reg
complex-single-stack
((let ((real (complex-single-reg-real-tn value))
(imag (complex-single-reg-imag-tn value)))
(with-empty-tn@fp-top (real)
(inst fld (ea-for-csf-real-stack variable-home-tn frame-pointer)))
(with-empty-tn@fp-top (imag)
(inst fld (ea-for-csf-imag-stack variable-home-tn frame-pointer))))
(let ((real (complex-single-reg-real-tn value))
(imag (complex-single-reg-imag-tn value)))
(with-tn@fp-top (real)
(inst fst (ea-for-csf-real-stack variable-home-tn frame-pointer)))
(with-tn@fp-top (imag)
(inst fst (ea-for-csf-imag-stack variable-home-tn frame-pointer)))))))
(defun primitive-type-indirect-cell-type (ptype)
(declare (type primitive-type ptype))
(macrolet ((foo (&body data)
`(case (primitive-type-name ptype)
,@(loop for (name stack-sc ref set) in data
collect
`(,name
(load-time-value
(list (primitive-type-or-lose ',name)
(sc-or-lose ',stack-sc)
(lambda (node block fp value res)
(sb!c::vop ,ref node block
fp value res))
(lambda (node block fp new-val value)
(sb!c::vop ,set node block
fp new-val value)))))))))
(foo (double-float double-stack
ancestor-frame-ref/double-float
ancestor-frame-set/double-float)
(single-float single-stack
ancestor-frame-ref/single-float
ancestor-frame-set/single-float)
(complex-double-float complex-double-stack
ancestor-frame-ref/complex-double-float
ancestor-frame-set/complex-double-float)
(complex-single-float complex-single-stack
ancestor-frame-ref/complex-single-float
ancestor-frame-set/complex-single-float)
(signed-byte-32 signed-stack
ancestor-frame-ref/signed-byte-32
ancestor-frame-set/signed-byte-32)
(unsigned-byte-32 unsigned-stack
ancestor-frame-ref/unsigned-byte-32
ancestor-frame-set/unsigned-byte-32)
(unsigned-byte-31 unsigned-stack
ancestor-frame-ref/unsigned-byte-32
ancestor-frame-set/unsigned-byte-32)
(system-area-pointer sap-stack
ancestor-frame-ref/system-area-pointer
ancestor-frame-set/system-area-pointer))))
(define-vop (xep-allocate-frame)
(:info start-lab copy-more-arg-follows)
(:vop-var vop)
(:generator 1
(emit-alignment n-lowtag-bits)
(trace-table-entry trace-table-fun-prologue)
(emit-label start-lab)
;; Skip space for the function header.
(inst simple-fun-header-word)
(dotimes (i (1- simple-fun-code-offset))
(inst dword 0))
;; The start of the actual code.
;; Save the return-pc.
(popw ebp-tn (frame-word-offset return-pc-save-offset))
;; If copy-more-arg follows it will allocate the correct stack
;; size. The stack is not allocated first here as this may expose
;; args on the stack if they take up more space than the frame!
(unless copy-more-arg-follows
;; The args fit within the frame so just allocate the frame.
(inst lea esp-tn
(make-ea :dword :base ebp-tn
:disp (- (* n-word-bytes
(- (max 3 (sb-allocated-size 'stack))
sp->fp-offset))))))
(trace-table-entry trace-table-normal)))
;;; This is emitted directly before either a known-call-local, call-local,
;;; or a multiple-call-local. All it does is allocate stack space for the
;;; callee (who has the same size stack as us).
(define-vop (allocate-frame)
(:results (res :scs (any-reg))
(nfp))
(:info callee)
(:ignore nfp callee)
(:generator 2
(inst lea res (make-ea :dword :base esp-tn
:disp (- (* sp->fp-offset n-word-bytes))))
(inst sub esp-tn (* n-word-bytes (sb-allocated-size 'stack)))))
;;; Allocate a partial frame for passing stack arguments in a full
;;; call. NARGS is the number of arguments passed. We allocate at
;;; least 3 slots, because the XEP noise is going to want to use them
;;; before it can extend the stack.
(define-vop (allocate-full-call-frame)
(:info nargs)
(:results (res :scs (any-reg)))
(:generator 2
(inst lea res (make-ea :dword :base esp-tn
:disp (- (* sp->fp-offset n-word-bytes))))
(inst sub esp-tn (* (max nargs 3) n-word-bytes))))
;;; Emit code needed at the return-point from an unknown-values call
;;; for a fixed number of values. Values is the head of the TN-REF
;;; list for the locations that the values are to be received into.
;;; Nvals is the number of values that are to be received (should
;;; equal the length of Values).
;;;
;;; If 0 or 1 values are expected, then we just emit an instruction to
;;; reset the SP (which will only be executed when other than 1 value
;;; is returned.)
;;;
;;; In the general case we have to do three things:
;;; -- Default unsupplied register values. This need only be done
;;; when a single value is returned, since register values are
;;; defaulted by the called in the non-single case.
;;; -- Default unsupplied stack values. This needs to be done whenever
;;; there are stack values.
;;; -- Reset SP. This must be done whenever other than 1 value is
;;; returned, regardless of the number of values desired.
(defun default-unknown-values (vop values nvals node)
(declare (type (or tn-ref null) values)
(type unsigned-byte nvals))
(let ((type (sb!c::basic-combination-derived-type node)))
(cond
((<= nvals 1)
(note-this-location vop :single-value-return)
(cond
((<= (sb!kernel:values-type-max-value-count type)
register-arg-count)
(when (and (named-type-p type)
(eq nil (named-type-name type)))
;; The function never returns, it may happen that the code
;; ends right here leavig the :SINGLE-VALUE-RETURN note
;; dangling. Let's emit a NOP.
(inst nop)))
((not (sb!kernel:values-type-may-be-single-value-p type))
(inst mov esp-tn ebx-tn))
((member :cmov *backend-subfeatures*)
(inst cmov :c esp-tn ebx-tn))
(t
(let ((single-value (gen-label)))
(inst jmp :nc single-value)
(inst mov esp-tn ebx-tn)
(emit-label single-value)))))
((<= nvals register-arg-count)
(note-this-location vop :unknown-return)
(when (sb!kernel:values-type-may-be-single-value-p type)
(let ((regs-defaulted (gen-label)))
(inst jmp :c regs-defaulted)
;; Default the unsupplied registers.
(let* ((2nd-tn-ref (tn-ref-across values))
(2nd-tn (tn-ref-tn 2nd-tn-ref)))
(inst mov 2nd-tn nil-value)
(when (> nvals 2)
(loop
for tn-ref = (tn-ref-across 2nd-tn-ref)
then (tn-ref-across tn-ref)
for count from 2 below register-arg-count
do (inst mov (tn-ref-tn tn-ref) 2nd-tn))))
(inst mov ebx-tn esp-tn)
(emit-label regs-defaulted)))
(when (< register-arg-count
(sb!kernel:values-type-max-value-count type))
(inst mov esp-tn ebx-tn)))
((<= nvals 7)
;; The number of bytes depends on the relative jump instructions.
;; Best case is 31+(n-3)*14, worst case is 35+(n-3)*18. For
;; NVALS=6 that is 73/89 bytes, and for NVALS=7 that is 87/107
;; bytes which is likely better than using the blt below.
(let ((regs-defaulted (gen-label))
(defaulting-done (gen-label))
(default-stack-slots (gen-label)))
(note-this-location vop :unknown-return)
;; Branch off to the MV case.
(inst jmp :c regs-defaulted)
;; Do the single value case.
;; Default the register args
(inst mov eax-tn nil-value)
(do ((i 1 (1+ i))
(val (tn-ref-across values) (tn-ref-across val)))
((= i (min nvals register-arg-count)))
(inst mov (tn-ref-tn val) eax-tn))
;; Fake other registers so it looks like we returned with all the
;; registers filled in.
(move ebx-tn esp-tn)
(inst jmp default-stack-slots)
(emit-label regs-defaulted)
(inst mov eax-tn nil-value)
(collect ((defaults))
(do ((i register-arg-count (1+ i))
(val (do ((i 0 (1+ i))
(val values (tn-ref-across val)))
((= i register-arg-count) val))
(tn-ref-across val)))
((null val))
(let ((default-lab (gen-label))
(tn (tn-ref-tn val))
(first-stack-arg-p (= i register-arg-count)))
(defaults (cons default-lab
(cons tn first-stack-arg-p)))
(inst cmp ecx-tn (fixnumize i))
(inst jmp :be default-lab)
(when first-stack-arg-p
;; There are stack args so the frame of the callee is
;; still there, save EDX in its first slot temporalily.
(storew edx-tn ebx-tn (frame-word-offset sp->fp-offset)))
(loadw edx-tn ebx-tn (frame-word-offset (+ sp->fp-offset i)))
(inst mov tn edx-tn)))
(emit-label defaulting-done)
(loadw edx-tn ebx-tn (frame-word-offset sp->fp-offset))
(move esp-tn ebx-tn)
(let ((defaults (defaults)))
(when defaults
(assemble (*elsewhere*)
(trace-table-entry trace-table-fun-prologue)
(emit-label default-stack-slots)
(dolist (default defaults)
(emit-label (car default))
(when (cddr default)
;; We are setting the first stack argument to NIL.
;; The callee's stack frame is dead, save EDX by
;; pushing it to the stack, it will end up at same
;; place as in the (STOREW EDX-TN EBX-TN -1) case
;; above.
(inst push edx-tn))
(inst mov (second default) eax-tn))
(inst jmp defaulting-done)
(trace-table-entry trace-table-normal)))))))
(t
;; 91 bytes for this branch.
(let ((regs-defaulted (gen-label))
(restore-edi (gen-label))
(no-stack-args (gen-label))
(default-stack-vals (gen-label))
(count-okay (gen-label)))
(note-this-location vop :unknown-return)
;; Branch off to the MV case.
(inst jmp :c regs-defaulted)
;; Default the register args, and set up the stack as if we
;; entered the MV return point.
(inst mov ebx-tn esp-tn)
(inst mov edi-tn nil-value)
(inst mov esi-tn edi-tn)
;; Compute a pointer to where to put the [defaulted] stack values.
(emit-label no-stack-args)
(inst push edx-tn)
(inst push edi-tn)
(inst lea edi-tn
(make-ea :dword :base ebp-tn
:disp (frame-byte-offset register-arg-count)))
;; Load EAX with NIL so we can quickly store it, and set up
;; stuff for the loop.
(inst mov eax-tn nil-value)
(inst std)
(inst mov ecx-tn (- nvals register-arg-count))
;; Jump into the default loop.
(inst jmp default-stack-vals)
;; The regs are defaulted. We need to copy any stack arguments,
;; and then default the remaining stack arguments.
(emit-label regs-defaulted)
;; Compute the number of stack arguments, and if it's zero or
;; less, don't copy any stack arguments.
(inst sub ecx-tn (fixnumize register-arg-count))
(inst jmp :le no-stack-args)
;; Save EDI.
(storew edi-tn ebx-tn (frame-word-offset (+ sp->fp-offset 1)))
;; Throw away any unwanted args.
(inst cmp ecx-tn (fixnumize (- nvals register-arg-count)))
(inst jmp :be count-okay)
(inst mov ecx-tn (fixnumize (- nvals register-arg-count)))
(emit-label count-okay)
;; Save the number of stack values.
(inst mov eax-tn ecx-tn)
;; Compute a pointer to where the stack args go.
(inst lea edi-tn
(make-ea :dword :base ebp-tn
:disp (frame-byte-offset register-arg-count)))
;; Save ESI, and compute a pointer to where the args come from.
(storew esi-tn ebx-tn (frame-word-offset (+ sp->fp-offset 2)))
(inst lea esi-tn
(make-ea :dword :base ebx-tn
:disp (frame-byte-offset
(+ sp->fp-offset register-arg-count))))
;; Do the copy.
(inst shr ecx-tn word-shift) ; make word count
(inst std)
(inst rep)
(inst movs :dword)
;; Restore ESI.
(loadw esi-tn ebx-tn (frame-word-offset (+ sp->fp-offset 2)))
;; Now we have to default the remaining args. Find out how many.
(inst sub eax-tn (fixnumize (- nvals register-arg-count)))
(inst neg eax-tn)
;; If none, then just blow out of here.
(inst jmp :le restore-edi)
(inst mov ecx-tn eax-tn)
(inst shr ecx-tn word-shift) ; word count
;; Load EAX with NIL for fast storing.
(inst mov eax-tn nil-value)
;; Do the store.
(emit-label default-stack-vals)
(inst rep)
(inst stos eax-tn)
;; Restore EDI, and reset the stack.
(emit-label restore-edi)
(loadw edi-tn ebx-tn (frame-word-offset (+ sp->fp-offset 1)))
(inst mov esp-tn ebx-tn)
(inst cld)))))
(values))
;;;; unknown values receiving
;;; Emit code needed at the return point for an unknown-values call
;;; for an arbitrary number of values.
;;;
;;; We do the single and non-single cases with no shared code: there
;;; doesn't seem to be any potential overlap, and receiving a single
;;; value is more important efficiency-wise.
;;;
;;; When there is a single value, we just push it on the stack,
;;; returning the old SP and 1.
;;;
;;; When there is a variable number of values, we move all of the
;;; argument registers onto the stack, and return ARGS and NARGS.
;;;
;;; ARGS and NARGS are TNs wired to the named locations. We must
;;; explicitly allocate these TNs, since their lifetimes overlap with
;;; the results start and count. (Also, it's nice to be able to target
;;; them.)
(defun receive-unknown-values (args nargs start count node)
(declare (type tn args nargs start count))
(let ((type (sb!c::basic-combination-derived-type node))
(variable-values (gen-label))
(stack-values (gen-label))
(done (gen-label)))
(when (sb!kernel:values-type-may-be-single-value-p type)
(inst jmp :c variable-values)
(cond ((location= start (first *register-arg-tns*))
(inst push (first *register-arg-tns*))
(inst lea start (make-ea :dword :base esp-tn :disp n-word-bytes)))
(t (inst mov start esp-tn)
(inst push (first *register-arg-tns*))))
(inst mov count (fixnumize 1))
(inst jmp done)
(emit-label variable-values))
;; The stack frame is burnt and RETurned from if there are no
;; stack values. In this case quickly reallocate sufficient space.
(when (<= (sb!kernel:values-type-min-value-count type)
register-arg-count)
(inst cmp nargs (fixnumize register-arg-count))
(inst jmp :g stack-values)
(inst sub esp-tn nargs)
(emit-label stack-values))
;; dtc: this writes the registers onto the stack even if they are
;; not needed, only the number specified in ecx are used and have
;; stack allocated to them. No harm is done.
(loop
for arg in *register-arg-tns*
for i downfrom -1
for j below (sb!kernel:values-type-max-value-count type)
do (storew arg args i))
(move start args)
(move count nargs)
(emit-label done))
(values))
;;; VOP that can be inherited by unknown values receivers. The main thing this
;;; handles is allocation of the result temporaries.
(define-vop (unknown-values-receiver)
(:temporary (:sc descriptor-reg :offset ebx-offset
:from :eval :to (:result 0))
values-start)
(:temporary (:sc any-reg :offset ecx-offset
:from :eval :to (:result 1))
nvals)
(:results (start :scs (any-reg control-stack))
(count :scs (any-reg control-stack))))
;;;; local call with unknown values convention return
(defun check-ocfp-and-return-pc (old-fp return-pc)
#+nil
(format t "*known-return: old-fp ~S, tn-kind ~S; ~S ~S~%"
old-fp (sb!c::tn-kind old-fp) (sb!c::tn-save-tn old-fp)
(sb!c::tn-kind (sb!c::tn-save-tn old-fp)))
#+nil
(format t "*known-return: return-pc ~S, tn-kind ~S; ~S ~S~%"
return-pc (sb!c::tn-kind return-pc)
(sb!c::tn-save-tn return-pc)
(sb!c::tn-kind (sb!c::tn-save-tn return-pc)))
(unless (and (sc-is old-fp control-stack)
(= (tn-offset old-fp) ocfp-save-offset))
(error "ocfp not on stack in standard save location?"))
(unless (and (sc-is return-pc sap-stack)
(= (tn-offset return-pc) return-pc-save-offset))
(error "return-pc not on stack in standard save location?")))
;;; The local call convention doesn't fit that well with x86-style
;;; calls. Emit a header for local calls to pop the return address
;;; in the right place.
(defun emit-block-header (start-label trampoline-label fall-thru-p alignp)
(declare (ignore alignp))
(when trampoline-label
(when fall-thru-p
(inst jmp start-label))
(emit-label trampoline-label)
(popw ebp-tn (frame-word-offset return-pc-save-offset)))
(emit-label start-label))
;;; Non-TR local call for a fixed number of values passed according to
;;; the unknown values convention.
;;;
;;; FP is the frame pointer in install before doing the call.
;;;
;;; NFP would be the number-stack frame pointer if we had a separate
;;; number stack.
;;;
;;; Args are the argument passing locations, which are specified only
;;; to terminate their lifetimes in the caller.
;;;
;;; VALUES are the return value locations (wired to the standard
;;; passing locations). NVALS is the number of values received.
;;;
;;; Save is the save info, which we can ignore since saving has been
;;; done.
;;;
;;; TARGET is a continuation pointing to the start of the called
;;; function.
(define-vop (call-local)
(:args (fp)
(nfp)
(args :more t))
(:results (values :more t))
(:save-p t)
(:move-args :local-call)
(:info arg-locs callee target nvals)
(:vop-var vop)
(:ignore nfp arg-locs args callee)
(:node-var node)
(:generator 5
(trace-table-entry trace-table-call-site)
(move ebp-tn fp)
(note-this-location vop :call-site)
(inst call target)
(default-unknown-values vop values nvals node)
(trace-table-entry trace-table-normal)))
;;; Non-TR local call for a variable number of return values passed according
;;; to the unknown values convention. The results are the start of the values
;;; glob and the number of values received.
(define-vop (multiple-call-local unknown-values-receiver)
(:args (fp)
(nfp)
(args :more t))
(:save-p t)
(:move-args :local-call)
(:info save callee target)
(:ignore args save nfp callee)
(:vop-var vop)
(:node-var node)
(:generator 20
(trace-table-entry trace-table-call-site)
(move ebp-tn fp)
(note-this-location vop :call-site)
(inst call target)
(note-this-location vop :unknown-return)
(receive-unknown-values values-start nvals start count node)
(trace-table-entry trace-table-normal)))
;;;; local call with known values return
;;; Non-TR local call with known return locations. Known-value return
;;; works just like argument passing in local call.
;;;
;;; Note: we can't use normal load-tn allocation for the fixed args,
;;; since all registers may be tied up by the more operand. Instead,
;;; we use MAYBE-LOAD-STACK-TN.
(define-vop (known-call-local)
(:args (fp)
(nfp)
(args :more t))
(:results (res :more t))
(:move-args :local-call)
(:save-p t)
(:info save callee target)
(:ignore args res save nfp callee)
(:vop-var vop)
(:generator 5
(trace-table-entry trace-table-call-site)
(move ebp-tn fp)
(note-this-location vop :call-site)
(inst call target)
(note-this-location vop :known-return)
(trace-table-entry trace-table-normal)))
;;; From Douglas Crosher
;;; Return from known values call. We receive the return locations as
;;; arguments to terminate their lifetimes in the returning function. We
;;; restore FP and CSP and jump to the Return-PC.
(define-vop (known-return)
(:args (old-fp)
(return-pc)
(vals :more t))
(:move-args :known-return)
(:info val-locs)
(:ignore val-locs vals)
(:vop-var vop)
(:generator 6
(check-ocfp-and-return-pc old-fp return-pc)
(trace-table-entry trace-table-fun-epilogue)
;; Zot all of the stack except for the old-fp and return-pc.
(inst mov esp-tn ebp-tn)
(inst pop ebp-tn)
(inst ret)
(trace-table-entry trace-table-normal)))
;;;; full call
;;;
;;; There is something of a cross-product effect with full calls.
;;; Different versions are used depending on whether we know the
;;; number of arguments or the name of the called function, and
;;; whether we want fixed values, unknown values, or a tail call.
;;;
;;; In full call, the arguments are passed creating a partial frame on
;;; the stack top and storing stack arguments into that frame. On
;;; entry to the callee, this partial frame is pointed to by FP.
;;; This macro helps in the definition of full call VOPs by avoiding
;;; code replication in defining the cross-product VOPs.
;;;
;;; NAME is the name of the VOP to define.
;;;
;;; NAMED is true if the first argument is an fdefinition object whose
;;; definition is to be called.
;;;
;;; RETURN is either :FIXED, :UNKNOWN or :TAIL:
;;; -- If :FIXED, then the call is for a fixed number of values, returned in
;;; the standard passing locations (passed as result operands).
;;; -- If :UNKNOWN, then the result values are pushed on the stack, and the
;;; result values are specified by the Start and Count as in the
;;; unknown-values continuation representation.
;;; -- If :TAIL, then do a tail-recursive call. No values are returned.
;;; The Old-Fp and Return-PC are passed as the second and third arguments.
;;;
;;; In non-tail calls, the pointer to the stack arguments is passed as
;;; the last fixed argument. If Variable is false, then the passing
;;; locations are passed as a more arg. Variable is true if there are
;;; a variable number of arguments passed on the stack. Variable
;;; cannot be specified with :TAIL return. TR variable argument call
;;; is implemented separately.
;;;
;;; In tail call with fixed arguments, the passing locations are
;;; passed as a more arg, but there is no new-FP, since the arguments
;;; have been set up in the current frame.
(macrolet ((define-full-call (name named return variable)
(aver (not (and variable (eq return :tail))))
`(define-vop (,name
,@(when (eq return :unknown)
'(unknown-values-receiver)))
(:args
,@(unless (eq return :tail)
'((new-fp :scs (any-reg) :to (:argument 1))))
(fun :scs (descriptor-reg control-stack)
:target eax :to (:argument 0))
,@(when (eq return :tail)
'((old-fp)
(return-pc)))
,@(unless variable '((args :more t :scs (descriptor-reg)))))
,@(when (eq return :fixed)
'((:results (values :more t))))
(:save-p ,(if (eq return :tail) :compute-only t))
,@(unless (or (eq return :tail) variable)
'((:move-args :full-call)))
(:vop-var vop)
(:info
,@(unless (or variable (eq return :tail)) '(arg-locs))
,@(unless variable '(nargs))
,@(when (eq return :fixed) '(nvals))
step-instrumenting)
(:ignore
,@(unless (or variable (eq return :tail)) '(arg-locs))
,@(unless variable '(args)))
;; We pass either the fdefn object (for named call) or
;; the actual function object (for unnamed call) in
;; EAX. With named call, closure-tramp will replace it
;; with the real function and invoke the real function
;; for closures. Non-closures do not need this value,
;; so don't care what shows up in it.
(:temporary
(:sc descriptor-reg
:offset eax-offset
:from (:argument 0)
:to :eval)
eax)
;; We pass the number of arguments in ECX.
(:temporary (:sc unsigned-reg :offset ecx-offset :to :eval) ecx)
;; With variable call, we have to load the
;; register-args out of the (new) stack frame before
;; doing the call. Therefore, we have to tell the
;; lifetime stuff that we need to use them.
,@(when variable
(mapcar (lambda (name offset)
`(:temporary (:sc descriptor-reg
:offset ,offset
:from (:argument 0)
:to :eval)
,name))
*register-arg-names* *register-arg-offsets*))
,@(when (eq return :tail)
'((:temporary (:sc unsigned-reg
:from (:argument 1)
:to (:argument 2))
old-fp-tmp)))
,@(unless (eq return :tail)
'((:node-var node)))
(:generator ,(+ (if named 5 0)
(if variable 19 1)
(if (eq return :tail) 0 10)
15
(if (eq return :unknown) 25 0))
(trace-table-entry trace-table-call-site)
;; This has to be done before the frame pointer is
;; changed! EAX stores the 'lexical environment' needed
;; for closures.
(move eax fun)
,@(if variable
;; For variable call, compute the number of
;; arguments and move some of the arguments to
;; registers.
(collect ((noise))
;; Compute the number of arguments.
(noise '(inst mov ecx new-fp))
(noise '(inst sub ecx esp-tn))
;; Move the necessary args to registers,
;; this moves them all even if they are
;; not all needed.
(loop
for name in *register-arg-names*
for index downfrom -1
do (noise `(loadw ,name new-fp ,index)))
(noise))
'((if (zerop nargs)
(inst xor ecx ecx)
(inst mov ecx (fixnumize nargs)))))
,@(cond ((eq return :tail)
'(;; Python has figured out what frame we should
;; return to so might as well use that clue.
;; This seems really important to the
;; implementation of things like
;; (without-interrupts ...)
;;
;; dtc; Could be doing a tail call from a
;; known-local-call etc in which the old-fp
;; or ret-pc are in regs or in non-standard
;; places. If the passing location were
;; wired to the stack in standard locations
;; then these moves will be un-necessary;
;; this is probably best for the x86.
(sc-case old-fp
((control-stack)
(unless (= ocfp-save-offset
(tn-offset old-fp))
;; FIXME: FORMAT T for stale
;; diagnostic output (several of
;; them around here), ick
(error "** tail-call old-fp not S0~%")
(move old-fp-tmp old-fp)
(storew old-fp-tmp
ebp-tn
(frame-word-offset ocfp-save-offset))))
((any-reg descriptor-reg)
(error "** tail-call old-fp in reg not S0~%")
(storew old-fp
ebp-tn
(frame-word-offset ocfp-save-offset))))
;; For tail call, we have to push the
;; return-pc so that it looks like we CALLed
;; despite the fact that we are going to JMP.
(inst push return-pc)
))
(t
;; For non-tail call, we have to save our
;; frame pointer and install the new frame
;; pointer. We can't load stack tns after this
;; point.
`(;; Python doesn't seem to allocate a frame
;; here which doesn't leave room for the
;; ofp/ret stuff.
;; The variable args are on the stack and
;; become the frame, but there may be <3
;; args and 3 stack slots are assumed
;; allocate on the call. So need to ensure
;; there are at least 3 slots. This hack
;; just adds 3 more.
,(if variable
'(inst sub esp-tn (fixnumize 3)))
;; Bias the new-fp for use as an fp
,(if variable
'(inst sub new-fp (fixnumize sp->fp-offset)))
;; Save the fp
(storew ebp-tn new-fp
(frame-word-offset ocfp-save-offset))
(move ebp-tn new-fp) ; NB - now on new stack frame.
)))
(when step-instrumenting
(emit-single-step-test)
(inst jmp :eq DONE)
(inst break single-step-around-trap))
DONE
(note-this-location vop :call-site)
(inst ,(if (eq return :tail) 'jmp 'call)
,(if named
'(make-ea-for-object-slot eax fdefn-raw-addr-slot
other-pointer-lowtag)
'(make-ea-for-object-slot eax closure-fun-slot
fun-pointer-lowtag)))
,@(ecase return
(:fixed
'((default-unknown-values vop values nvals node)))
(:unknown
'((note-this-location vop :unknown-return)
(receive-unknown-values values-start nvals start count
node)))
(:tail))
(trace-table-entry trace-table-normal)))))
(define-full-call call nil :fixed nil)
(define-full-call call-named t :fixed nil)
(define-full-call multiple-call nil :unknown nil)
(define-full-call multiple-call-named t :unknown nil)
(define-full-call tail-call nil :tail nil)
(define-full-call tail-call-named t :tail nil)
(define-full-call call-variable nil :fixed t)
(define-full-call multiple-call-variable nil :unknown t))
;;; This is defined separately, since it needs special code that BLT's
;;; the arguments down. All the real work is done in the assembly
;;; routine. We just set things up so that it can find what it needs.
(define-vop (tail-call-variable)
(:args (args :scs (any-reg control-stack) :target esi)
(function :scs (descriptor-reg control-stack) :target eax)
(old-fp)
(return-pc))
(:temporary (:sc unsigned-reg :offset esi-offset :from (:argument 0)) esi)
(:temporary (:sc unsigned-reg :offset eax-offset :from (:argument 1)) eax)
(:generator 75
(check-ocfp-and-return-pc old-fp return-pc)
;; Move these into the passing locations if they are not already there.
(move esi args)
(move eax function)
;; And jump to the assembly routine.
(inst jmp (make-fixup 'tail-call-variable :assembly-routine))))
;;;; unknown values return
;;; Return a single-value using the Unknown-Values convention.
;;;
;;; pfw--get wired-tn conflicts sometimes if register sc specd for args
;;; having problems targeting args to regs -- using temps instead.
;;;
;;; First off, modifying the return-pc defeats the branch-prediction
;;; optimizations on modern CPUs quite handily. Second, we can do all
;;; this without needing a temp register. Fixed the latter, at least.
;;; -- AB 2006/Feb/04
(define-vop (return-single)
(:args (old-fp)
(return-pc)
(value))
(:ignore value)
(:generator 6
(check-ocfp-and-return-pc old-fp return-pc)
(trace-table-entry trace-table-fun-epilogue)
;; Drop stack above old-fp
(inst mov esp-tn ebp-tn)
;; Clear the multiple-value return flag
(inst clc)
;; Restore the old frame pointer
(inst pop ebp-tn)
;; And return.
(inst ret)))
;;; Do unknown-values return of a fixed (other than 1) number of
;;; values. The VALUES are required to be set up in the standard
;;; passing locations. NVALS is the number of values returned.
;;;
;;; Basically, we just load ECX with the number of values returned and
;;; EBX with a pointer to the values, set ESP to point to the end of
;;; the values, and jump directly to return-pc.
(define-vop (return)
(:args (old-fp)
(return-pc :to (:eval 1))
(values :more t))
(:ignore values)
(:info nvals)
;; In the case of other than one value, we need these registers to
;; tell the caller where they are and how many there are.
(:temporary (:sc unsigned-reg :offset ebx-offset) ebx)
(:temporary (:sc unsigned-reg :offset ecx-offset) ecx)
;; We need to stretch the lifetime of return-pc past the argument
;; registers so that we can default the argument registers without
;; trashing return-pc.
(:temporary (:sc unsigned-reg :offset (first *register-arg-offsets*)
:from :eval) a0)
(:temporary (:sc unsigned-reg :offset (second *register-arg-offsets*)
:from :eval) a1)
(:temporary (:sc unsigned-reg :offset (third *register-arg-offsets*)
:from :eval) a2)
(:generator 6
(check-ocfp-and-return-pc old-fp return-pc)
(when (= nvals 1)
;; This is handled in RETURN-SINGLE.
(error "nvalues is 1"))
(trace-table-entry trace-table-fun-epilogue)
;; Establish the values pointer and values count.
(inst lea ebx (make-ea :dword :base ebp-tn
:disp (* sp->fp-offset n-word-bytes)))
(if (zerop nvals)
(inst xor ecx ecx) ; smaller
(inst mov ecx (fixnumize nvals)))
;; Pre-default any argument register that need it.
(when (< nvals register-arg-count)
(let* ((arg-tns (nthcdr nvals (list a0 a1 a2)))
(first (first arg-tns)))
(inst mov first nil-value)
(dolist (tn (cdr arg-tns))
(inst mov tn first))))
;; Set the multiple value return flag.
(inst stc)
;; And away we go. Except that return-pc is still on the
;; stack and we've changed the stack pointer. So we have to
;; tell it to index off of EBX instead of EBP.
(cond ((<= nvals register-arg-count)
(inst mov esp-tn ebp-tn)
(inst pop ebp-tn)
(inst ret))
(t
;; Some values are on the stack after RETURN-PC and OLD-FP,
;; can't return normally and some slots of the frame will
;; be used as temporaries by the receiver.
;;
;; Clear as much of the stack as possible, but not past the
;; old frame address.
(inst lea esp-tn
(make-ea :dword :base ebp-tn
:disp (frame-byte-offset (1- nvals))))
(move ebp-tn old-fp)
(inst push (make-ea :dword :base ebx
:disp (frame-byte-offset
(+ sp->fp-offset
(tn-offset return-pc)))))
(inst ret)))
(trace-table-entry trace-table-normal)))
;;; Do unknown-values return of an arbitrary number of values (passed
;;; on the stack.) We check for the common case of a single return
;;; value, and do that inline using the normal single value return
;;; convention. Otherwise, we branch off to code that calls an
;;; assembly-routine.
;;;
;;; The assembly routine takes the following args:
;;; ECX -- number of values to find there.
;;; ESI -- pointer to where to find the values.
(define-vop (return-multiple)
(:args (old-fp)
(return-pc)
(vals :scs (any-reg) :target esi)
(nvals :scs (any-reg) :target ecx))
(:temporary (:sc unsigned-reg :offset esi-offset :from (:argument 2)) esi)
(:temporary (:sc unsigned-reg :offset ecx-offset :from (:argument 3)) ecx)
(:temporary (:sc descriptor-reg :offset (first *register-arg-offsets*)
:from (:eval 0)) a0)
(:node-var node)
(:generator 13
(check-ocfp-and-return-pc old-fp return-pc)
(trace-table-entry trace-table-fun-epilogue)
(unless (policy node (> space speed))
;; Check for the single case.
(let ((not-single (gen-label)))
(inst cmp nvals (fixnumize 1))
(inst jmp :ne not-single)
;; Return with one value.
(loadw a0 vals -1)
;; Clear the stack until ocfp.
(inst mov esp-tn ebp-tn)
;; clear the multiple-value return flag
(inst clc)
;; Out of here.
(inst pop ebp-tn)
(inst ret)
;; Nope, not the single case. Jump to the assembly routine.
(emit-label not-single)))
(move esi vals)
(move ecx nvals)
(inst jmp (make-fixup 'return-multiple :assembly-routine))
(trace-table-entry trace-table-normal)))
;;;; XEP hackery
;;; We don't need to do anything special for regular functions.
(define-vop (setup-environment)
(:info label)
(:ignore label)
(:generator 0
;; Don't bother doing anything.
nil))
;;; Get the lexical environment from its passing location.
(define-vop (setup-closure-environment)
(:results (closure :scs (descriptor-reg)))
(:info label)
(:ignore label)
(:generator 6
;; Get result.
(move closure eax-tn)))
;;; Copy a &MORE arg from the argument area to the end of the current
;;; frame. FIXED is the number of non-&MORE arguments.
;;;
;;; The tricky part is doing this without trashing any of the calling
;;; convention registers that are still needed. This vop is emitted
;;; directly after the xep-allocate frame. That means the registers
;;; are in use as follows:
;;;
;;; EAX -- The lexenv.
;;; EBX -- Available.
;;; ECX -- The total number of arguments * N-WORD-BYTES.
;;; EDX -- The first arg.
;;; EDI -- The second arg.
;;; ESI -- The third arg.
;;;
;;; So basically, we have one register available for our use: EBX.
;;;
;;; What we can do is push the other regs onto the stack, and then
;;; restore their values by looking directly below where we put the
;;; more-args.
(define-vop (copy-more-arg)
(:info fixed)
(:generator 20
;; Avoid the copy if there are no more args.
(cond ((zerop fixed)
(inst jecxz JUST-ALLOC-FRAME))
(t
(inst cmp ecx-tn (fixnumize fixed))
(inst jmp :be JUST-ALLOC-FRAME)))
;; Allocate the space on the stack.
;; stack = ebp + sp->fp-offset - (max 3 frame-size) - (nargs - fixed)
;;
;; Problem: this might leave some &more args outside esp, so
;; clamp the movement for now. If fixed > frame-size, reset
;; esp to the end of the current &more args (which *should*
;; be a noop?)
(inst lea ebx-tn
(make-ea :dword :base ebp-tn
:disp (* n-word-bytes
(- sp->fp-offset
(max 0
(- (max 3 (sb-allocated-size 'stack))
fixed))))))
(inst sub ebx-tn ecx-tn) ; Got the new stack in ebx
(inst mov esp-tn ebx-tn)
;; Now: nargs>=1 && nargs>fixed
;; Save the original count of args.
(inst mov ebx-tn ecx-tn)
(cond ((< fixed register-arg-count)
;; We must stop when we run out of stack args, not when we
;; run out of more args.
;; Number to copy = nargs-3
(inst sub ecx-tn (fixnumize register-arg-count))
;; Everything of interest in registers.
(inst jmp :be DO-REGS))
(t
;; Number to copy = nargs-fixed
(inst sub ecx-tn (fixnumize fixed))))
(let ((delta (* n-word-bytes
(- (max 3 (sb-allocated-size 'stack))
fixed)))
(LOOP (gen-label)))
(cond ((zerop delta)
;; nothing to move!
)
((minusp delta)
;; stack frame smaller than fixed; moving args to higher
;; addresses (stack grows downard), so copy from the
;; end. Moreover, because we'd have to shrink the frame,
;; esp currently points at the end of the source args.
(inst push ebx-tn)
(emit-label LOOP)
(inst sub ecx-tn n-word-bytes)
(inst mov ebx-tn (make-ea :dword
:base esp-tn :index ecx-tn
;; compensate for PUSH above
:disp n-word-bytes))
(inst mov (make-ea :dword
:base esp-tn :index ecx-tn
;; compensate for PUSH, and
;; add (abs delta)
:disp (- n-word-bytes delta))
ebx-tn)
(inst jmp :nz LOOP)
(inst pop ebx-tn))
((plusp delta)
;; stack frame larger than fixed. Moving args to lower
;; addresses, so copy from the lowest address. esp
;; already points to the lowest address of the destination.
(inst push ebx-tn)
(inst push esi-tn)
(inst xor ebx-tn ebx-tn)
(emit-label LOOP)
(inst mov esi-tn (make-ea :dword
:base esp-tn :index ebx-tn
;; PUSHed 2 words
:disp (+ (* 2 n-word-bytes)
delta)))
(inst mov (make-ea :dword
:base esp-tn :index ebx-tn
:disp (* 2 n-word-bytes))
esi-tn)
(inst add ebx-tn n-word-bytes)
(inst sub ecx-tn n-word-bytes)
(inst jmp :nz LOOP)
(inst pop esi-tn)
(inst pop ebx-tn))))
DO-REGS
;; stack can now be set to its final size
(when (< (max 3 (sb-allocated-size 'stack)) fixed)
(inst add esp-tn (* n-word-bytes
(- fixed
(max 3 (sb-allocated-size 'stack))))))
;; Restore ECX
(inst mov ecx-tn ebx-tn)
;; Here: nargs>=1 && nargs>fixed
(when (< fixed register-arg-count)
;; Now we have to deposit any more args that showed up in
;; registers.
(do ((i fixed))
( nil )
;; Store it relative to ebp
(inst mov (make-ea :dword :base ebp-tn
:disp (* n-word-bytes
(- sp->fp-offset
(+ 1
(- i fixed)
(max 3 (sb-allocated-size
'stack))))))
(nth i *register-arg-tns*))
(incf i)
(when (>= i register-arg-count)
(return))
;; Don't deposit any more than there are.
(if (zerop i)
(inst test ecx-tn ecx-tn)
(inst cmp ecx-tn (fixnumize i)))
(inst jmp :eq DONE)))
(inst jmp DONE)
JUST-ALLOC-FRAME
(inst lea esp-tn
(make-ea :dword :base ebp-tn
:disp (* n-word-bytes
(- sp->fp-offset
(max 3 (sb-allocated-size 'stack))))))
DONE))
(define-vop (more-kw-arg)
(:translate sb!c::%more-kw-arg)
(:policy :fast-safe)
(:args (object :scs (descriptor-reg) :to (:result 1))
(index :scs (any-reg immediate) :to (:result 1) :target keyword))
(:arg-types * tagged-num)
(:results (value :scs (descriptor-reg any-reg))
(keyword :scs (descriptor-reg any-reg)))
(:result-types * *)
(:generator 4
(sc-case index
(immediate
(inst mov value (make-ea :dword :base object :disp (tn-value index)))
(inst mov keyword (make-ea :dword :base object
:disp (+ (tn-value index) n-word-bytes))))
(t
(inst mov value (make-ea :dword :base object :index index))
(inst mov keyword (make-ea :dword :base object :index index
:disp n-word-bytes))))))
(define-vop (more-arg)
(:translate sb!c::%more-arg)
(:policy :fast-safe)
(:args (object :scs (descriptor-reg) :to (:result 1))
(index :scs (any-reg) :to (:result 1) :target value))
(:arg-types * tagged-num)
(:results (value :scs (descriptor-reg any-reg)))
(:result-types *)
(:generator 4
(move value index)
(inst neg value)
(inst mov value (make-ea :dword :base object :index value))))
;;; Turn more arg (context, count) into a list.
(define-vop (listify-rest-args)
(:translate %listify-rest-args)
(:policy :safe)
(:args (context :scs (descriptor-reg) :target src)
(count :scs (any-reg) :target ecx))
(:arg-types * tagged-num)
(:temporary (:sc unsigned-reg :offset esi-offset :from (:argument 0)) src)
(:temporary (:sc unsigned-reg :offset ecx-offset :from (:argument 1)) ecx)
(:temporary (:sc unsigned-reg :offset eax-offset) eax)
(:temporary (:sc unsigned-reg) dst)
(:results (result :scs (descriptor-reg)))
(:node-var node)
(:generator 20
(let ((enter (gen-label))
(loop (gen-label))
(done (gen-label))
(stack-allocate-p (node-stack-allocate-p node)))
(move src context)
(move ecx count)
;; Check to see whether there are no args, and just return NIL if so.
(inst mov result nil-value)
(inst jecxz done)
(inst lea dst (make-ea :dword :base ecx :index ecx))
(maybe-pseudo-atomic stack-allocate-p
(allocation dst dst node stack-allocate-p list-pointer-lowtag)
;; Set decrement mode (successive args at lower addresses)
(inst std)
;; Set up the result.
(move result dst)
;; Jump into the middle of the loop, 'cause that's where we want
;; to start.
(inst jmp enter)
(emit-label loop)
;; Compute a pointer to the next cons.
(inst add dst (* cons-size n-word-bytes))
;; Store a pointer to this cons in the CDR of the previous cons.
(storew dst dst -1 list-pointer-lowtag)
(emit-label enter)
;; Grab one value and stash it in the car of this cons.
(inst lods eax)
(storew eax dst 0 list-pointer-lowtag)
;; Go back for more.
(inst sub ecx n-word-bytes)
(inst jmp :nz loop)
;; NIL out the last cons.
(storew nil-value dst 1 list-pointer-lowtag)
(inst cld))
(emit-label done))))
;;; Return the location and size of the &MORE arg glob created by
;;; COPY-MORE-ARG. SUPPLIED is the total number of arguments supplied
;;; (originally passed in ECX). FIXED is the number of non-rest
;;; arguments.
;;;
;;; We must duplicate some of the work done by COPY-MORE-ARG, since at
;;; that time the environment is in a pretty brain-damaged state,
;;; preventing this info from being returned as values. What we do is
;;; compute supplied - fixed, and return a pointer that many words
;;; below the current stack top.
(define-vop (more-arg-context)
(:policy :fast-safe)
(:translate sb!c::%more-arg-context)
(:args (supplied :scs (any-reg) :target count))
(:arg-types positive-fixnum (:constant fixnum))
(:info fixed)
(:results (context :scs (descriptor-reg))
(count :scs (any-reg)))
(:result-types t tagged-num)
(:note "more-arg-context")
(:generator 5
(move count supplied)
;; SP at this point points at the last arg pushed.
;; Point to the first more-arg, not above it.
(inst lea context (make-ea :dword :base esp-tn
:index count :scale 1
:disp (- (+ (fixnumize fixed) n-word-bytes))))
(unless (zerop fixed)
(inst sub count (fixnumize fixed)))))
;;; Signal wrong argument count error if NARGS isn't equal to COUNT.
(define-vop (verify-arg-count)
(:policy :fast-safe)
(:translate sb!c::%verify-arg-count)
(:args (nargs :scs (any-reg)))
(:arg-types positive-fixnum (:constant t))
(:info count)
(:vop-var vop)
(:save-p :compute-only)
(:generator 3
(let ((err-lab
(generate-error-code vop 'invalid-arg-count-error nargs)))
(if (zerop count)
(inst test nargs nargs) ; smaller instruction
(inst cmp nargs (fixnumize count)))
(inst jmp :ne err-lab))))
;;; Various other error signallers.
(macrolet ((def (name error translate &rest args)
`(define-vop (,name)
,@(when translate
`((:policy :fast-safe)
(:translate ,translate)))
(:args ,@(mapcar (lambda (arg)
`(,arg :scs (any-reg descriptor-reg)))
args))
(:vop-var vop)
(:save-p :compute-only)
(:generator 1000
(error-call vop ',error ,@args)))))
(def arg-count-error invalid-arg-count-error
sb!c::%arg-count-error nargs)
(def type-check-error object-not-type-error sb!c::%type-check-error
object type)
(def layout-invalid-error layout-invalid-error sb!c::%layout-invalid-error
object layout)
(def odd-key-args-error odd-key-args-error
sb!c::%odd-key-args-error)
(def unknown-key-arg-error unknown-key-arg-error
sb!c::%unknown-key-arg-error key)
(def nil-fun-returned-error nil-fun-returned-error nil fun))
;;; Single-stepping
(defun emit-single-step-test ()
;; We use different ways of representing whether stepping is on on
;; +SB-THREAD / -SB-THREAD: on +SB-THREAD, we use a slot in the
;; thread structure. On -SB-THREAD we use the value of a static
;; symbol. Things are done this way, since reading a thread-local
;; slot from a symbol would require an extra register on +SB-THREAD,
;; and reading a slot from a thread structure would require an extra
;; register on -SB-THREAD.
#!+sb-thread
(progn
#!+win32 (inst push eax-tn)
(with-tls-ea (EA :base #!+win32 eax-tn #!-win32 :unused
:disp-type :constant
:disp (* thread-stepping-slot n-word-bytes))
(inst cmp EA nil-value :maybe-fs))
#!+win32 (inst pop eax-tn))
#!-sb-thread
(inst cmp (make-ea-for-symbol-value sb!impl::*stepping*)
nil-value))
(define-vop (step-instrument-before-vop)
(:policy :fast-safe)
(:vop-var vop)
(:generator 3
(emit-single-step-test)
(inst jmp :eq DONE)
(inst break single-step-before-trap)
DONE
(note-this-location vop :step-before-vop)))