Work at SourceForge, help us to make it a better place! We have an immediate need for a Support Technician in our San Francisco or Denver office.

Close

[ea1220]: src / pcl / vector.lisp Maximize Restore History

Download this file

vector.lisp    1213 lines (1126 with data), 44.4 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
;;;; permutation vectors
;;;; This software is part of the SBCL system. See the README file for
;;;; more information.
;;;; This software is derived from software originally released by Xerox
;;;; Corporation. Copyright and release statements follow. Later modifications
;;;; to the software are in the public domain and are provided with
;;;; absolutely no warranty. See the COPYING and CREDITS files for more
;;;; information.
;;;; copyright information from original PCL sources:
;;;;
;;;; Copyright (c) 1985, 1986, 1987, 1988, 1989, 1990 Xerox Corporation.
;;;; All rights reserved.
;;;;
;;;; Use and copying of this software and preparation of derivative works based
;;;; upon this software are permitted. Any distribution of this software or
;;;; derivative works must comply with all applicable United States export
;;;; control laws.
;;;;
;;;; This software is made available AS IS, and Xerox Corporation makes no
;;;; warranty about the software, its performance or its conformity to any
;;;; specification.
(in-package "SB-PCL")
(defmacro instance-slot-index (wrapper slot-name)
`(let ((pos 0))
(declare (fixnum pos))
(block loop
(dolist (sn (wrapper-instance-slots-layout ,wrapper))
(when (eq ,slot-name sn) (return-from loop pos))
(incf pos)))))
(defun pv-cache-limit-fn (nlines)
(default-limit-fn nlines))
(defstruct (pv-table (:predicate pv-tablep)
(:constructor make-pv-table-internal
(slot-name-lists call-list))
(:copier nil))
(cache nil :type (or cache null))
(pv-size 0 :type fixnum)
(slot-name-lists nil :type list)
(call-list nil :type list))
#-sb-fluid (declaim (sb-ext:freeze-type pv-table))
(defvar *initial-pv-table* (make-pv-table-internal nil nil))
; help new slot-value-using-class methods affect fast iv access
(defvar *all-pv-table-list* nil)
(defun make-pv-table (&key slot-name-lists call-list)
(let ((pv-table (make-pv-table-internal slot-name-lists call-list)))
(push pv-table *all-pv-table-list*)
pv-table))
(defun make-pv-table-type-declaration (var)
`(type pv-table ,var))
(defvar *slot-name-lists-inner* (make-hash-table :test 'equal))
(defvar *slot-name-lists-outer* (make-hash-table :test 'equal))
;;; Entries in this are lists of (table . pv-offset-list).
(defvar *pv-key-to-pv-table-table* (make-hash-table :test 'equal))
(defun intern-pv-table (&key slot-name-lists call-list)
(let ((new-p nil))
(flet ((inner (x)
(or (gethash x *slot-name-lists-inner*)
(setf (gethash x *slot-name-lists-inner*) (copy-list x))))
(outer (x)
(or (gethash x *slot-name-lists-outer*)
(setf (gethash x *slot-name-lists-outer*)
(let ((snl (copy-list (cdr x)))
(cl (car x)))
(setq new-p t)
(make-pv-table :slot-name-lists snl
:call-list cl))))))
(let ((pv-table (outer (mapcar #'inner (cons call-list slot-name-lists)))))
(when new-p
(let ((pv-index 1))
(dolist (slot-name-list slot-name-lists)
(dolist (slot-name (cdr slot-name-list))
(note-pv-table-reference slot-name pv-index pv-table)
(incf pv-index)))
(dolist (gf-call call-list)
(note-pv-table-reference gf-call pv-index pv-table)
(incf pv-index))
(setf (pv-table-pv-size pv-table) pv-index)))
pv-table))))
(defun note-pv-table-reference (ref pv-offset pv-table)
(let ((entry (gethash ref *pv-key-to-pv-table-table*)))
(when (listp entry)
(let ((table-entry (assq pv-table entry)))
(when (and (null table-entry)
(> (length entry) 8))
(let ((new-table-table (make-hash-table :size 16 :test 'eq)))
(dolist (table-entry entry)
(setf (gethash (car table-entry) new-table-table)
(cdr table-entry)))
(setf (gethash ref *pv-key-to-pv-table-table*) new-table-table)))
(when (listp entry)
(if (null table-entry)
(let ((new (cons pv-table pv-offset)))
(if (consp entry)
(push new (cdr entry))
(setf (gethash ref *pv-key-to-pv-table-table*)
(list new))))
(push pv-offset (cdr table-entry)))
(return-from note-pv-table-reference nil))))
(let ((list (gethash pv-table entry)))
(if (consp list)
(push pv-offset (cdr list))
(setf (gethash pv-table entry) (list pv-offset)))))
nil)
(defun map-pv-table-references-of (ref function)
(let ((entry (gethash ref *pv-key-to-pv-table-table*)))
(if (listp entry)
(dolist (table+pv-offset-list entry)
(funcall function
(car table+pv-offset-list)
(cdr table+pv-offset-list)))
(maphash function entry)))
ref)
(defvar *pvs* (make-hash-table :test 'equal))
(defun optimize-slot-value-by-class-p (class slot-name type)
(or (not (eq *boot-state* 'complete))
(let ((slotd (find-slot-definition class slot-name)))
(and slotd
(slot-accessor-std-p slotd type)))))
(defun compute-pv-slot (slot-name wrapper class class-slots class-slot-p-cell)
(if (symbolp slot-name)
(when (optimize-slot-value-by-class-p class slot-name 'all)
(or (instance-slot-index wrapper slot-name)
(let ((cell (assq slot-name class-slots)))
(when cell
(setf (car class-slot-p-cell) t)
cell))))
(when (consp slot-name)
(dolist (type '(reader writer) nil)
(when (eq (car slot-name) type)
(return
(let* ((gf-name (cadr slot-name))
(gf (gdefinition gf-name))
(location (when (eq *boot-state* 'complete)
(accessor-values1 gf type class))))
(when (consp location)
(setf (car class-slot-p-cell) t))
location)))))))
(defun compute-pv (slot-name-lists wrappers)
(unless (listp wrappers) (setq wrappers (list wrappers)))
(let* ((not-simple-p-cell (list nil))
(elements
(let ((elements nil))
(dolist (slot-names slot-name-lists)
(when slot-names
(let* ((wrapper (pop wrappers))
(std-p (typep wrapper 'wrapper))
(class (wrapper-class* wrapper))
(class-slots (and std-p (wrapper-class-slots wrapper))))
(dolist (slot-name (cdr slot-names))
;; Original PCL code had this idiom. why not:
;;
;; (WHEN STD-P
;; (PUSH ...)) ?
(push (when std-p
(compute-pv-slot slot-name wrapper class
class-slots not-simple-p-cell))
elements)))))
(nreverse elements))))
(if (car not-simple-p-cell)
(make-permutation-vector (cons t elements))
(or (gethash elements *pvs*)
(setf (gethash elements *pvs*)
(make-permutation-vector (cons nil elements)))))))
(defun compute-calls (call-list wrappers)
(declare (ignore call-list wrappers))
#||
(map 'vector
(lambda (call)
(compute-emf-from-wrappers call wrappers))
call-list)
||#
'#())
#|| ; Need to finish this, then write the maintenance functions.
(defun compute-emf-from-wrappers (call wrappers)
(when call
(destructuring-bind (gf-name nreq restp arg-info) call
(if (eq gf-name 'make-instance)
(error "should not get here") ; there is another mechanism for this.
(lambda (&rest args)
(if (not (eq *boot-state* 'complete))
(apply (gdefinition gf-name) args)
(let* ((gf (gdefinition gf-name))
(arg-info (arg-info-reader gf))
(classes '?)
(types '?)
(emf (cache-miss-values-internal gf arg-info
wrappers classes types
'caching)))
(update-all-pv-tables call wrappers emf)
(invoke-emf emf args))))))))
||#
(defun make-permutation-vector (indexes)
(make-array (length indexes) :initial-contents indexes))
(defun pv-table-lookup (pv-table pv-wrappers)
(let* ((slot-name-lists (pv-table-slot-name-lists pv-table))
(call-list (pv-table-call-list pv-table))
(cache (or (pv-table-cache pv-table)
(setf (pv-table-cache pv-table)
(get-cache (- (length slot-name-lists)
(count nil slot-name-lists))
t
#'pv-cache-limit-fn
2)))))
(or (probe-cache cache pv-wrappers)
(let* ((pv (compute-pv slot-name-lists pv-wrappers))
(calls (compute-calls call-list pv-wrappers))
(pv-cell (cons pv calls))
(new-cache (fill-cache cache pv-wrappers pv-cell)))
(unless (eq new-cache cache)
(setf (pv-table-cache pv-table) new-cache))
pv-cell))))
(defun make-pv-type-declaration (var)
`(type simple-vector ,var))
(defvar *empty-pv* #())
(defmacro pvref (pv index)
`(svref ,pv ,index))
(defmacro copy-pv (pv)
`(copy-seq ,pv))
(defun make-calls-type-declaration (var)
`(type simple-vector ,var))
(defmacro callsref (calls index)
`(svref ,calls ,index))
(defvar *pv-table-cache-update-info* nil)
(defun update-pv-table-cache-info (class)
(let ((slot-names-for-pv-table-update nil)
(new-icui nil))
(dolist (icu *pv-table-cache-update-info*)
(if (eq (car icu) class)
(pushnew (cdr icu) slot-names-for-pv-table-update)
(push icu new-icui)))
(setq *pv-table-cache-update-info* new-icui)
(when slot-names-for-pv-table-update
(update-all-pv-table-caches class slot-names-for-pv-table-update))))
(defun update-all-pv-table-caches (class slot-names)
(let* ((cwrapper (class-wrapper class))
(std-p (typep cwrapper 'wrapper))
(class-slots (and std-p (wrapper-class-slots cwrapper)))
(class-slot-p-cell (list nil))
(new-values (mapcar (lambda (slot-name)
(cons slot-name
(when std-p
(compute-pv-slot
slot-name cwrapper class
class-slots class-slot-p-cell))))
slot-names))
(pv-tables nil))
(dolist (slot-name slot-names)
(map-pv-table-references-of
slot-name
(lambda (pv-table pv-offset-list)
(declare (ignore pv-offset-list))
(pushnew pv-table pv-tables))))
(dolist (pv-table pv-tables)
(let* ((cache (pv-table-cache pv-table))
(slot-name-lists (pv-table-slot-name-lists pv-table))
(pv-size (pv-table-pv-size pv-table))
(pv-map (make-array pv-size :initial-element nil)))
(let ((map-index 1) (param-index 0))
(dolist (slot-name-list slot-name-lists)
(dolist (slot-name (cdr slot-name-list))
(let ((a (assoc slot-name new-values)))
(setf (svref pv-map map-index)
(and a (cons param-index (cdr a)))))
(incf map-index))
(incf param-index)))
(when cache
(map-cache (lambda (wrappers pv-cell)
(setf (car pv-cell)
(update-slots-in-pv wrappers (car pv-cell)
cwrapper pv-size pv-map)))
cache))))))
(defun update-slots-in-pv (wrappers pv cwrapper pv-size pv-map)
(if (not (if (atom wrappers)
(eq cwrapper wrappers)
(dolist (wrapper wrappers nil)
(when (eq wrapper cwrapper)
(return t)))))
pv
(let* ((old-intern-p (listp (pvref pv 0)))
(new-pv (if old-intern-p
(copy-pv pv)
pv))
(new-intern-p t))
(if (atom wrappers)
(dotimes-fixnum (i pv-size)
(when (consp (let ((map (svref pv-map i)))
(if map
(setf (pvref new-pv i) (cdr map))
(pvref new-pv i))))
(setq new-intern-p nil)))
(let ((param 0))
(dolist (wrapper wrappers)
(when (eq wrapper cwrapper)
(dotimes-fixnum (i pv-size)
(when (consp (let ((map (svref pv-map i)))
(if (and map (= (car map) param))
(setf (pvref new-pv i) (cdr map))
(pvref new-pv i))))
(setq new-intern-p nil))))
(incf param))))
(when new-intern-p
(setq new-pv (let ((list-pv (coerce pv 'list)))
(or (gethash (cdr list-pv) *pvs*)
(setf (gethash (cdr list-pv) *pvs*)
(if old-intern-p
new-pv
(make-permutation-vector list-pv)))))))
new-pv)))
(defun maybe-expand-accessor-form (form required-parameters slots env)
(let* ((fname (car form))
#||(len (length form))||#
(gf (if (symbolp fname)
(unencapsulated-fdefinition fname)
(gdefinition fname))))
(macrolet ((maybe-optimize-reader ()
`(let ((parameter
(can-optimize-access1 (cadr form)
required-parameters env)))
(when parameter
(optimize-reader slots parameter gf-name form))))
(maybe-optimize-writer ()
`(let ((parameter
(can-optimize-access1 (caddr form)
required-parameters env)))
(when parameter
(optimize-writer slots parameter gf-name form)))))
(unless (and (consp (cadr form))
(eq 'instance-accessor-parameter (caadr form)))
(when (and (eq *boot-state* 'complete)
(generic-function-p gf))
(let ((methods (generic-function-methods gf)))
(when methods
(let* ((gf-name (generic-function-name gf))
(arg-info (gf-arg-info gf))
(metatypes (arg-info-metatypes arg-info))
(nreq (length metatypes))
(applyp (arg-info-applyp arg-info)))
(when (null applyp)
(cond ((= nreq 1)
(when (some #'standard-reader-method-p methods)
(maybe-optimize-reader)))
((and (= nreq 2)
(consp gf-name)
(eq (car gf-name) 'setf))
(when (some #'standard-writer-method-p methods)
(maybe-optimize-writer)))))))))))))
(defun optimize-generic-function-call (form
required-parameters
env
slots
calls)
(declare (ignore required-parameters env slots calls))
(or ; (optimize-reader ...)?
form))
(defun can-optimize-access (form required-parameters env)
(let ((type (ecase (car form)
(slot-value 'reader)
(set-slot-value 'writer)
(slot-boundp 'boundp)))
(var (cadr form))
(slot-name (eval (caddr form)))) ; known to be constant
(can-optimize-access1 var required-parameters env type slot-name)))
;;; FIXME: This looks like an internal helper function for
;;; CAN-OPTIMIZE-ACCESS, and it is used that way, but it's also called
;;; bare from several places in the code. Perhaps the two functions
;;; should be renamed CAN-OPTIMIZE-ACCESS-FOR-FORM and
;;; CAN-OPTIMIZE-ACCESS-FOR-VAR. If so, I'd just as soon use keyword
;;; args instead of optional ones, too.
(defun can-optimize-access1 (var required-parameters env
&optional type slot-name)
(when (and (consp var) (eq 'the (car var)))
;; FIXME: We should assert list of length 3 here. Or maybe we
;; should just define EXTRACT-THE, replace the whole
;; (WHEN ..)
;; form with
;; (AWHEN (EXTRACT-THE VAR)
;; (SETF VAR IT))
;; and then use EXTRACT-THE similarly to clean up the other tests
;; against 'THE scattered through the PCL code.
(setq var (caddr var)))
(when (symbolp var)
(let* ((rebound? (caddr (var-declaration '%variable-rebinding var env)))
(parameter-or-nil (car (memq (or rebound? var)
required-parameters))))
(when parameter-or-nil
(let* ((class-name (caddr (var-declaration '%class
parameter-or-nil
env)))
(class (find-class class-name nil)))
(when (or (not (eq *boot-state* 'complete))
(and class (not (class-finalized-p class))))
(setq class nil))
(when (and class-name (not (eq class-name t)))
(when (or (null type)
(not (and class
(memq *the-class-structure-object*
(class-precedence-list class))))
(optimize-slot-value-by-class-p class slot-name type))
(cons parameter-or-nil (or class class-name)))))))))
(defun optimize-slot-value (slots sparameter form)
(if sparameter
(destructuring-bind (ignore1 ignore2 slot-name-form) form
(declare (ignore ignore1 ignore2))
(let ((slot-name (eval slot-name-form)))
(optimize-instance-access slots :read sparameter slot-name nil)))
`(accessor-slot-value ,@(cdr form))))
(defun optimize-set-slot-value (slots sparameter form)
(if sparameter
(destructuring-bind (ignore1 ignore2 slot-name-form new-value) form
(declare (ignore ignore1 ignore2))
(let ((slot-name (eval slot-name-form)))
(optimize-instance-access slots
:write
sparameter
slot-name
new-value)))
`(accessor-set-slot-value ,@(cdr form))))
(defun optimize-slot-boundp (slots sparameter form)
(if sparameter
(destructuring-bind
;; FIXME: In CMU CL ca. 19991205, this binding list had a
;; fourth element in it, NEW-VALUE. It's hard to see how
;; that could possibly be right, since SLOT-BOUNDP has no
;; NEW-VALUE. Since it was causing a failure in building PCL
;; for SBCL, so I changed it to match the definition of
;; SLOT-BOUNDP (and also to match the list used in the
;; similar OPTIMIZE-SLOT-VALUE, above). However, I'm weirded
;; out by this, since this is old code which has worked for
;; ages to build PCL for CMU CL, so it's hard to see why it
;; should need a patch like this in order to build PCL for
;; SBCL. I'd like to return to this and find a test case
;; which exercises this function both in CMU CL, to see
;; whether it's really a previously-unexercised bug or
;; whether I've misunderstood something (and, presumably,
;; patched it wrong).
(slot-boundp-symbol instance slot-name-form)
form
(declare (ignore slot-boundp-symbol instance))
(let ((slot-name (eval slot-name-form)))
(optimize-instance-access slots
:boundp
sparameter
slot-name
nil)))
`(accessor-slot-boundp ,@(cdr form))))
(defun optimize-reader (slots sparameter gf-name form)
(if sparameter
(optimize-accessor-call slots :read sparameter gf-name nil)
form))
(defun optimize-writer (slots sparameter gf-name form)
(if sparameter
(destructuring-bind (ignore1 ignore2 new-value) form
(declare (ignore ignore1 ignore2))
(optimize-accessor-call slots :write sparameter gf-name new-value))
form))
;;; The SLOTS argument is an alist, the CAR of each entry is the name
;;; of a required parameter to the function. The alist is in order, so
;;; the position of an entry in the alist corresponds to the
;;; argument's position in the lambda list.
(defun optimize-instance-access (slots
read/write
sparameter
slot-name
new-value)
(let ((class (if (consp sparameter) (cdr sparameter) *the-class-t*))
(parameter (if (consp sparameter) (car sparameter) sparameter)))
(if (and (eq *boot-state* 'complete)
(classp class)
(memq *the-class-structure-object* (class-precedence-list class)))
(let ((slotd (find-slot-definition class slot-name)))
(ecase read/write
(:read
`(,(slot-definition-defstruct-accessor-symbol slotd) ,parameter))
(:write
`(setf (,(slot-definition-defstruct-accessor-symbol slotd)
,parameter)
,new-value))
(:boundp
t)))
(let* ((parameter-entry (assq parameter slots))
(slot-entry (assq slot-name (cdr parameter-entry)))
(position (posq parameter-entry slots))
(pv-offset-form (list 'pv-offset ''.PV-OFFSET.)))
(unless parameter-entry
(bug "slot optimization bewilderment: O-I-A"))
(unless slot-entry
(setq slot-entry (list slot-name))
(push slot-entry (cdr parameter-entry)))
(push pv-offset-form (cdr slot-entry))
(ecase read/write
(:read
`(instance-read ,pv-offset-form ,parameter ,position
',slot-name ',class))
(:write
`(let ((.new-value. ,new-value))
(instance-write ,pv-offset-form ,parameter ,position
',slot-name ',class .new-value.)))
(:boundp
`(instance-boundp ,pv-offset-form ,parameter ,position
',slot-name ',class)))))))
(defun optimize-accessor-call (slots read/write sparameter gf-name new-value)
(let* ((class (if (consp sparameter) (cdr sparameter) *the-class-t*))
(parameter (if (consp sparameter) (car sparameter) sparameter))
(parameter-entry (assq parameter slots))
(name (case read/write
(:read `(reader ,gf-name))
(:write `(writer ,gf-name))))
(slot-entry (assoc name (cdr parameter-entry) :test #'equal))
(position (posq parameter-entry slots))
(pv-offset-form (list 'pv-offset ''.PV-OFFSET.)))
(unless parameter-entry
(error "slot optimization bewilderment: O-A-C"))
(unless slot-entry
(setq slot-entry (list name))
(push slot-entry (cdr parameter-entry)))
(push pv-offset-form (cdr slot-entry))
(ecase read/write
(:read
`(instance-reader ,pv-offset-form ,parameter ,position ,gf-name ',class))
(:write
`(let ((.new-value. ,new-value))
(instance-writer ,pv-offset-form ,parameter ,position ,gf-name ',class
.new-value.))))))
(defvar *unspecific-arg* '..unspecific-arg..)
(defun optimize-gf-call-internal (form slots env)
(when (and (consp form)
(eq (car form) 'the))
(setq form (caddr form)))
(or (and (symbolp form)
(let* ((rebound? (caddr (var-declaration '%variable-rebinding
form
env)))
(parameter-or-nil (car (assq (or rebound? form) slots))))
(when parameter-or-nil
(let* ((class-name (caddr (var-declaration 'class
parameter-or-nil
env))))
(when (and class-name (not (eq class-name t)))
(position parameter-or-nil slots :key #'car))))))
(if (constantp form)
(let ((form (eval form)))
(if (symbolp form)
form
*unspecific-arg*))
*unspecific-arg*)))
(defun optimize-gf-call (slots calls gf-call-form nreq restp env)
(unless (eq (car gf-call-form) 'make-instance) ; XXX needs more work
(let* ((args (cdr gf-call-form))
(all-args-p (eq (car gf-call-form) 'make-instance))
(non-required-args (nthcdr nreq args))
(required-args (ldiff args non-required-args))
(call-spec (list (car gf-call-form) nreq restp
(mapcar (lambda (form)
(optimize-gf-call-internal form slots env))
(if all-args-p
args
required-args))))
(call-entry (assoc call-spec calls :test #'equal))
(pv-offset-form (list 'pv-offset ''.PV-OFFSET.)))
(unless (some #'integerp
(let ((spec-args (cdr call-spec)))
(if all-args-p
(ldiff spec-args (nthcdr nreq spec-args))
spec-args)))
(return-from optimize-gf-call nil))
(unless call-entry
(setq call-entry (list call-spec))
(push call-entry (cdr calls)))
(push pv-offset-form (cdr call-entry))
(if (eq (car call-spec) 'make-instance)
`(funcall (pv-ref .pv. ,pv-offset-form) ,@(cdr gf-call-form))
`(let ((.emf. (pv-ref .pv. ,pv-offset-form)))
(invoke-effective-method-function .emf. ,restp
,@required-args ,@(when restp `((list ,@non-required-args)))))))))
(define-walker-template pv-offset) ; These forms get munged by mutate slots.
(defmacro pv-offset (arg) arg)
(define-walker-template instance-accessor-parameter)
(defmacro instance-accessor-parameter (x) x)
;;; It is safe for these two functions to be wrong. They just try to
;;; guess what the most likely case will be.
(defun generate-fast-class-slot-access-p (class-form slot-name-form)
(let ((class (and (constantp class-form) (eval class-form)))
(slot-name (and (constantp slot-name-form) (eval slot-name-form))))
(and (eq *boot-state* 'complete)
(standard-class-p class)
(not (eq class *the-class-t*)) ; shouldn't happen, though.
(let ((slotd (find-slot-definition class slot-name)))
(and slotd (eq :class (slot-definition-allocation slotd)))))))
(defun skip-fast-slot-access-p (class-form slot-name-form type)
(let ((class (and (constantp class-form) (eval class-form)))
(slot-name (and (constantp slot-name-form) (eval slot-name-form))))
(and (eq *boot-state* 'complete)
(standard-class-p class)
(not (eq class *the-class-t*)) ; shouldn't happen, though.
(let ((slotd (find-slot-definition class slot-name)))
(and slotd (skip-optimize-slot-value-by-class-p class
slot-name
type))))))
(defun skip-optimize-slot-value-by-class-p (class slot-name type)
(let ((slotd (find-slot-definition class slot-name)))
(and slotd
(eq *boot-state* 'complete)
(not (slot-accessor-std-p slotd type)))))
(defmacro instance-read-internal (pv slots pv-offset default &optional kind)
(unless (member kind '(nil :instance :class :default))
(error "illegal kind argument to ~S: ~S" 'instance-read-internal kind))
(if (eq kind :default)
default
(let* ((index (gensym))
(value index))
`(locally (declare #.*optimize-speed*)
(let ((,index (pvref ,pv ,pv-offset)))
(setq ,value (typecase ,index
;; FIXME: the line marked by KLUDGE below
;; (and the analogous spot in
;; INSTANCE-WRITE-INTERNAL) is there purely
;; to suppress a type mismatch warning that
;; propagates through to user code.
;; Presumably SLOTS at this point can never
;; actually be NIL, but the compiler seems
;; to think it could, so we put this here
;; to shut it up. (see also mail Rudi
;; Schlatte sbcl-devel 2003-09-21) -- CSR,
;; 2003-11-30
,@(when (or (null kind) (eq kind :instance))
`((fixnum
(and ,slots ; KLUDGE
(clos-slots-ref ,slots ,index)))))
,@(when (or (null kind) (eq kind :class))
`((cons (cdr ,index))))
(t +slot-unbound+)))
(if (eq ,value +slot-unbound+)
,default
,value))))))
(defmacro instance-read (pv-offset parameter position slot-name class)
(if (skip-fast-slot-access-p class slot-name 'reader)
`(accessor-slot-value ,parameter ,slot-name)
`(instance-read-internal .pv. ,(slot-vector-symbol position)
,pv-offset (accessor-slot-value ,parameter ,slot-name)
,(if (generate-fast-class-slot-access-p class slot-name)
:class :instance))))
(defmacro instance-reader (pv-offset parameter position gf-name class)
(declare (ignore class))
`(instance-read-internal .pv. ,(slot-vector-symbol position)
,pv-offset
(,gf-name (instance-accessor-parameter ,parameter))
:instance))
(defmacro instance-write-internal (pv slots pv-offset new-value default
&optional kind (type t))
(unless (member kind '(nil :instance :class :default))
(error "illegal kind argument to ~S: ~S" 'instance-write-internal kind))
(if (eq kind :default)
default
(let* ((index (gensym)))
`(locally (declare #.*optimize-speed*)
(let ((,index (pvref ,pv ,pv-offset)))
(typecase ,index
,@(when (or (null kind) (eq kind :instance))
`((fixnum (and ,slots
(setf (clos-slots-ref ,slots ,index)
(locally
(declare (optimize (safety 3)))
(the ,type ,new-value)))))))
,@(when (or (null kind) (eq kind :class))
`((cons (setf (cdr ,index)
(locally
(declare (optimize (safety 3)))
(the ,type ,new-value))))))
(t ,default)))))))
(defmacro instance-write (pv-offset
parameter
position
slot-name
class
new-value)
(if (skip-fast-slot-access-p class slot-name 'writer)
`(accessor-set-slot-value ,parameter ,slot-name ,new-value)
`(instance-write-internal .pv. ,(slot-vector-symbol position)
,pv-offset ,new-value
(accessor-set-slot-value ,parameter ,slot-name ,new-value)
,(if (generate-fast-class-slot-access-p class slot-name)
:class :instance)
,(if (and (eq *boot-state* 'complete)
(constantp class)
(constantp slot-name)
(standard-class-p (eval class))
(not (eq (eval class) *the-class-t*)))
(let ((slotd (find-slot-definition (eval class) (eval slot-name))))
(or (not slotd)
(slot-definition-type slotd)))
t))))
(defmacro instance-writer (pv-offset
parameter
position
gf-name
class
new-value)
(declare (ignore class))
`(instance-write-internal .pv. ,(slot-vector-symbol position)
,pv-offset ,new-value
(,(if (consp gf-name)
(get-setf-fun-name gf-name)
gf-name)
(instance-accessor-parameter ,parameter)
,new-value)
:instance))
(defmacro instance-boundp-internal (pv slots pv-offset default
&optional kind)
(unless (member kind '(nil :instance :class :default))
(error "illegal kind argument to ~S: ~S" 'instance-boundp-internal kind))
(if (eq kind :default)
default
(let* ((index (gensym)))
`(locally (declare #.*optimize-speed*)
(let ((,index (pvref ,pv ,pv-offset)))
(typecase ,index
,@(when (or (null kind) (eq kind :instance))
`((fixnum (not (and ,slots
(eq (clos-slots-ref ,slots ,index)
+slot-unbound+))))))
,@(when (or (null kind) (eq kind :class))
`((cons (not (eq (cdr ,index) +slot-unbound+)))))
(t ,default)))))))
(defmacro instance-boundp (pv-offset parameter position slot-name class)
(if (skip-fast-slot-access-p class slot-name 'boundp)
`(accessor-slot-boundp ,parameter ,slot-name)
`(instance-boundp-internal .pv. ,(slot-vector-symbol position)
,pv-offset (accessor-slot-boundp ,parameter ,slot-name)
,(if (generate-fast-class-slot-access-p class slot-name)
:class :instance))))
;;; This magic function has quite a job to do indeed.
;;;
;;; The careful reader will recall that <slots> contains all of the
;;; optimized slot access forms produced by OPTIMIZE-INSTANCE-ACCESS.
;;; Each of these is a call to either INSTANCE-READ or INSTANCE-WRITE.
;;;
;;; At the time these calls were produced, the first argument was
;;; specified as the symbol .PV-OFFSET.; what we have to do now is
;;; convert those pv-offset arguments into the actual number that is
;;; the correct offset into the pv.
;;;
;;; But first, oh but first, we sort <slots> a bit so that for each
;;; argument we have the slots in alphabetical order. This
;;; canonicalizes the PV-TABLE's a bit and will hopefully lead to
;;; having fewer PV's floating around. Even if the gain is only
;;; modest, it costs nothing.
(defun slot-name-lists-from-slots (slots calls)
(multiple-value-bind (slots calls) (mutate-slots-and-calls slots calls)
(let* ((slot-name-lists
(mapcar (lambda (parameter-entry)
(cons nil (mapcar #'car (cdr parameter-entry))))
slots))
(call-list
(mapcar #'car calls)))
(dolist (call call-list)
(dolist (arg (cdr call))
(when (integerp arg)
(setf (car (nth arg slot-name-lists)) t))))
(setq slot-name-lists (mapcar (lambda (r+snl)
(when (or (car r+snl) (cdr r+snl))
r+snl))
slot-name-lists))
(let ((cvt (apply #'vector
(let ((i -1))
(mapcar (lambda (r+snl)
(when r+snl (incf i)))
slot-name-lists)))))
(setq call-list (mapcar (lambda (call)
(cons (car call)
(mapcar (lambda (arg)
(if (integerp arg)
(svref cvt arg)
arg))
(cdr call))))
call-list)))
(values slot-name-lists call-list))))
(defun mutate-slots-and-calls (slots calls)
(let ((sorted-slots (sort-slots slots))
(sorted-calls (sort-calls (cdr calls)))
(pv-offset 0)) ; index 0 is for info
(dolist (parameter-entry sorted-slots)
(dolist (slot-entry (cdr parameter-entry))
(incf pv-offset)
(dolist (form (cdr slot-entry))
(setf (cadr form) pv-offset))))
(dolist (call-entry sorted-calls)
(incf pv-offset)
(dolist (form (cdr call-entry))
(setf (cadr form) pv-offset)))
(values sorted-slots sorted-calls)))
(defun symbol-pkg-name (sym)
(let ((pkg (symbol-package sym)))
(if pkg (package-name pkg) "")))
;;; FIXME: Because of the existence of UNINTERN and RENAME-PACKAGE,
;;; the part of this ordering which is based on SYMBOL-PKG-NAME is not
;;; stable. This ordering is only used in to
;;; SLOT-NAME-LISTS-FROM-SLOTS, where it serves to "canonicalize the
;;; PV-TABLE's a bit and will hopefully lead to having fewer PV's
;;; floating around", so it sounds as though the instability won't
;;; actually lead to bugs, just small inefficiency. But still, it
;;; would be better to reimplement this function as a comparison based
;;; on SYMBOL-HASH:
;;; * stable comparison
;;; * smaller code (here, and in being able to discard SYMBOL-PKG-NAME)
;;; * faster code.
(defun symbol-lessp (a b)
(if (eq (symbol-package a)
(symbol-package b))
(string-lessp (symbol-name a)
(symbol-name b))
(string-lessp (symbol-pkg-name a)
(symbol-pkg-name b))))
(defun symbol-or-cons-lessp (a b)
(etypecase a
(symbol (etypecase b
(symbol (symbol-lessp a b))
(cons t)))
(cons (etypecase b
(symbol nil)
(cons (if (eq (car a) (car b))
(symbol-or-cons-lessp (cdr a) (cdr b))
(symbol-or-cons-lessp (car a) (car b))))))))
(defun sort-slots (slots)
(mapcar (lambda (parameter-entry)
(cons (car parameter-entry)
(sort (cdr parameter-entry) ;slot entries
#'symbol-or-cons-lessp
:key #'car)))
slots))
(defun sort-calls (calls)
(sort calls #'symbol-or-cons-lessp :key #'car))
;;;; This needs to work in terms of metatypes and also needs to work
;;;; for automatically generated reader and writer functions.
;;;; Automatically generated reader and writer functions use this
;;;; stuff too.
(defmacro pv-binding ((required-parameters slot-name-lists pv-table-symbol)
&body body)
(let (slot-vars pv-parameters)
(loop for slots in slot-name-lists
for required-parameter in required-parameters
for i from 0
do (when slots
(push required-parameter pv-parameters)
(push (slot-vector-symbol i) slot-vars)))
`(pv-binding1 (.pv. .calls. ,pv-table-symbol
,(nreverse pv-parameters) ,(nreverse slot-vars))
,@body)))
(defmacro pv-binding1 ((pv calls pv-table-symbol pv-parameters slot-vars)
&body body)
`(pv-env (,pv ,calls ,pv-table-symbol ,pv-parameters)
(let (,@(mapcar (lambda (slot-var p) `(,slot-var (get-slots-or-nil ,p)))
slot-vars pv-parameters))
(declare (ignorable ,@(mapcar #'identity slot-vars)))
,@body)))
;;; This gets used only when the default MAKE-METHOD-LAMBDA is
;;; overridden.
(defmacro pv-env ((pv calls pv-table-symbol pv-parameters)
&rest forms)
`(let* ((.pv-table. ,pv-table-symbol)
(.pv-cell. (pv-table-lookup-pv-args .pv-table. ,@pv-parameters))
(,pv (car .pv-cell.))
(,calls (cdr .pv-cell.)))
(declare ,(make-pv-type-declaration pv))
(declare ,(make-calls-type-declaration calls))
,@(when (symbolp pv-table-symbol)
`((declare (special ,pv-table-symbol))))
,pv ,calls
,@forms))
(defvar *non-var-declarations*
;; FIXME: VALUES was in this list, conditionalized with #+CMU, but I
;; don't *think* CMU CL had, or SBCL has, VALUES declarations. If
;; SBCL doesn't have 'em, VALUES should probably be removed from
;; this list.
'(values
%method-name
%method-lambda-list
optimize
ftype
inline
notinline))
(defvar *var-declarations-with-arg*
'(%class
type))
(defvar *var-declarations-without-arg*
'(ignore
ignorable special dynamic-extent
;; FIXME: Possibly this entire list and variable could go away.
;; If not, certainly we should remove all these built-in typenames
;; from the list, and replace them with a test for "is it a type
;; name?" (CLTL1 allowed only built-in type names as declarations,
;; but ANSI CL allows any type name as a declaration.)
array atom base-char bignum bit bit-vector character compiled-function
complex cons double-float extended-char
fixnum float function hash-table integer
keyword list long-float nil null number package pathname random-state ratio
rational readtable sequence short-float signed-byte simple-array
simple-bit-vector simple-string simple-vector single-float standard-char
stream string symbol t unsigned-byte vector))
(defun split-declarations (body args maybe-reads-params-p)
(let ((inner-decls nil)
(outer-decls nil)
decl)
(loop (when (null body) (return nil))
(setq decl (car body))
(unless (and (consp decl)
(eq (car decl) 'declare))
(return nil))
(dolist (form (cdr decl))
(when (consp form)
(let ((declaration-name (car form)))
(if (member declaration-name *non-var-declarations*)
(push `(declare ,form) outer-decls)
(let ((arg-p
(member declaration-name
*var-declarations-with-arg*))
(non-arg-p
(member declaration-name
*var-declarations-without-arg*))
(dname (list (pop form)))
(inners nil) (outers nil))
(unless (or arg-p non-arg-p)
;; FIXME: This warning, and perhaps the
;; various *VAR-DECLARATIONS-FOO* and/or
;; *NON-VAR-DECLARATIONS* variables,
;; could probably go away now that we're not
;; trying to be portable between different
;; CLTL1 hosts the way PCL was. (Note that to
;; do this right, we need to be able to handle
;; user-defined (DECLAIM (DECLARATION FOO))
;; stuff.)
(warn "The declaration ~S is not understood by ~S.~@
Please put ~S on one of the lists ~S,~%~S, or~%~S.~@
(Assuming it is a variable declaration without argument)."
declaration-name 'split-declarations
declaration-name
'*non-var-declarations*
'*var-declarations-with-arg*
'*var-declarations-without-arg*)
(push declaration-name *var-declarations-without-arg*))
(when arg-p
(setq dname (append dname (list (pop form)))))
(case (car dname)
(%class (push `(declare (,@dname ,@form)) inner-decls))
(t
(dolist (var form)
(if (member var args)
;; Quietly remove IGNORE declarations
;; on args when a next-method is
;; involved, to prevent compiler
;; warnings about ignored args being
;; read.
(unless (and maybe-reads-params-p
(eq (car dname) 'ignore))
(push var outers))
(push var inners)))
(when outers
(push `(declare (,@dname ,@outers)) outer-decls))
(when inners
(push
`(declare (,@dname ,@inners))
inner-decls)))))))))
(setq body (cdr body)))
(values outer-decls inner-decls body)))
;;; Pull a name out of the %METHOD-NAME declaration in the function
;;; body given, or return NIL if no %METHOD-NAME declaration is found.
(defun body-method-name (body)
(multiple-value-bind (real-body declarations documentation)
(parse-body body)
(declare (ignore real-body documentation))
(let ((name-decl (get-declaration '%method-name declarations)))
(and name-decl
(destructuring-bind (name) name-decl
name)))))
;;; Convert a lambda expression containing a SB-PCL::%METHOD-NAME
;;; declaration (which is a naming style internal to PCL) into an
;;; SB-INT:NAMED-LAMBDA expression (which is a naming style used
;;; throughout SBCL, understood by the main compiler); or if there's
;;; no SB-PCL::%METHOD-NAME declaration, then just return the original
;;; lambda expression.
(defun name-method-lambda (method-lambda)
(let ((method-name (body-method-name (cddr method-lambda))))
(if method-name
`(named-lambda (method ,method-name) ,(rest method-lambda))
method-lambda)))
(defun make-method-initargs-form-internal (method-lambda initargs env)
(declare (ignore env))
(let (method-lambda-args
lmf ; becomes body of function
lmf-params)
(if (not (and (= 3 (length method-lambda))
(= 2 (length (setq method-lambda-args (cadr method-lambda))))
(consp (setq lmf (third method-lambda)))
(eq 'simple-lexical-method-functions (car lmf))
(eq (car method-lambda-args)
(cadr (setq lmf-params (cadr lmf))))
(eq (cadr method-lambda-args)
(caddr lmf-params))))
`(list* :function ,(name-method-lambda method-lambda)
',initargs)
(let* ((lambda-list (car lmf-params))
(nreq 0)
(restp nil)
(args nil))
(dolist (arg lambda-list)
(when (member arg '(&optional &rest &key))
(setq restp t)
(return nil))
(when (eq arg '&aux)
(return nil))
(incf nreq)
(push arg args))
(setq args (nreverse args))
(setf (getf (getf initargs :plist) :arg-info) (cons nreq restp))
(make-method-initargs-form-internal1
initargs (cddr lmf) args lmf-params restp)))))
(defun make-method-initargs-form-internal1
(initargs body req-args lmf-params restp)
(multiple-value-bind (outer-decls inner-decls body-sans-decls)
(split-declarations
body req-args (or (getf (cdr lmf-params) :call-next-method-p)
(getf (cdr lmf-params) :setq-p)))
(let* ((rest-arg (when restp '.rest-arg.))
(args+rest-arg (if restp
(append req-args (list rest-arg))
req-args)))
`(list*
:fast-function
(,(if (body-method-name body) 'named-lambda 'lambda)
,@(when (body-method-name body)
;; function name
(list (cons 'fast-method (body-method-name body))))
(.pv-cell. .next-method-call. ,@args+rest-arg) ; function args
;; body of the function
(declare (ignorable .pv-cell. .next-method-call.))
,@outer-decls
(declare (disable-package-locks pv-env))
(macrolet ((pv-env ((pv calls pv-table-symbol pv-parameters)
&rest forms)
(declare (ignore pv-table-symbol
pv-parameters))
(declare (enable-package-locks pv-env))
`(let ((,pv (car .pv-cell.))
(,calls (cdr .pv-cell.)))
(declare ,(make-pv-type-declaration pv)
,(make-calls-type-declaration calls))
,pv ,calls
,@forms)))
(declare (enable-package-locks pv-env))
(fast-lexical-method-functions
(,(car lmf-params) .next-method-call. ,req-args ,rest-arg
,@(cdddr lmf-params))
,@inner-decls
,@body-sans-decls)))
',initargs))))
;;; Use arrays and hash tables and the fngen stuff to make this much
;;; better. It doesn't really matter, though, because a function
;;; returned by this will get called only when the user explicitly
;;; funcalls a result of method-function. BUT, this is needed to make
;;; early methods work.
(defun method-function-from-fast-function (fmf)
(declare (type function fmf))
(let* ((method-function nil) (pv-table nil)
(arg-info (method-function-get fmf :arg-info))
(nreq (car arg-info))
(restp (cdr arg-info)))
(setq method-function
(lambda (method-args next-methods)
(unless pv-table
(setq pv-table (method-function-pv-table fmf)))
(let* ((pv-cell (when pv-table
(get-method-function-pv-cell
method-function method-args pv-table)))
(nm (car next-methods))
(nms (cdr next-methods))
(nmc (when nm
(make-method-call
:function (if (std-instance-p nm)
(method-function nm)
nm)
:call-method-args (list nms)))))
(if restp
(let* ((rest (nthcdr nreq method-args))
(args (ldiff method-args rest)))
(apply fmf pv-cell nmc (nconc args (list rest))))
(apply fmf pv-cell nmc method-args)))))
(let* ((fname (method-function-get fmf :name))
(name `(,(or (get (car fname) 'method-sym)
(setf (get (car fname) 'method-sym)
(let ((str (symbol-name (car fname))))
(if (string= "FAST-" str :end2 5)
(format-symbol *pcl-package* (subseq str 5))
(car fname)))))
,@(cdr fname))))
(set-fun-name method-function name))
(setf (method-function-get method-function :fast-function) fmf)
method-function))
(defun get-method-function-pv-cell (method-function
method-args
&optional pv-table)
(let ((pv-table (or pv-table (method-function-pv-table method-function))))
(when pv-table
(let ((pv-wrappers (pv-wrappers-from-all-args pv-table method-args)))
(when pv-wrappers
(pv-table-lookup pv-table pv-wrappers))))))
(defun pv-table-lookup-pv-args (pv-table &rest pv-parameters)
(pv-table-lookup pv-table (pv-wrappers-from-pv-args pv-parameters)))
(defun pv-wrappers-from-pv-args (&rest args)
(let (wrappers)
(dolist (arg args (if (cdr wrappers) (nreverse wrappers) (car wrappers)))
(let ((wrapper (wrapper-of arg)))
(push (if (invalid-wrapper-p wrapper)
(check-wrapper-validity wrapper)
wrapper)
wrappers)))))
(defun pv-wrappers-from-all-args (pv-table args)
(loop for snl in (pv-table-slot-name-lists pv-table) and arg in args
when snl
collect (wrapper-of arg) into wrappers
finally (return (if (cdr wrappers) wrappers (car wrappers)))))
;;; Return the subset of WRAPPERS which is used in the cache
;;; of PV-TABLE.
(defun pv-wrappers-from-all-wrappers (pv-table wrappers)
(loop for snl in (pv-table-slot-name-lists pv-table) and w in wrappers
when snl
collect w into result
finally (return (if (cdr result) result (car result)))))