-
Notifications
You must be signed in to change notification settings - Fork 67
/
new-dispatch.dylan
1510 lines (1324 loc) · 53.4 KB
/
new-dispatch.dylan
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
language: infix-dylan
module: dispatch-engine-internal
Copyright: Original Code is Copyright (c) 1995-2004 Functional Objects, Inc.
All rights reserved.
License: See License.txt in this distribution for details.
Warranty: Distributed WITHOUT WARRANTY OF ANY KIND
define inline function fixnum-dammit (x :: <integer>) => (x :: <integer>) x end;
define constant <callback> = <simple-method>;
define constant callback-iep = mep;
define function parent-gf (parent :: <dispatch-starter>) => (g :: <generic-function>)
select (parent by instance?)
<generic-function> =>
let g :: <generic-function> = parent;
g;
<cache-header-engine-node> =>
let c :: <cache-header-engine-node> = parent;
parent-gf(cache-header-engine-node-parent(c));
end select
end function;
define function dispatch-start (dispatch-starter :: <dispatch-starter>) => (engine)
select (dispatch-starter by instance?)
<generic-function> =>
let gf :: <generic-function> = dispatch-starter;
discriminator(gf);
<cache-header-engine-node> =>
let e :: <cache-header-engine-node> = dispatch-starter;
cache-header-engine-node-next(e) | $absent-engine-node;
end select
end function;
define function dispatch-start-setter (v, dispatch-starter :: <dispatch-starter>) => (engine)
select (dispatch-starter by instance?)
<generic-function> =>
let gf :: <generic-function> = dispatch-starter;
discriminator(gf) := v;
<cache-header-engine-node> =>
let e :: <cache-header-engine-node> = dispatch-starter;
cache-header-engine-node-next(e) := v;
end select
end function;
define function bootstrap-allocate-engine-node (entry-type :: <integer>, root-bits :: <integer>)
=> (e :: <engine-node>)
let classes :: <simple-object-vector> = *engine-node-classes*;
let c :: <class> = vector-element(classes, entry-type);
bootstrap-typed-allocate-engine-node(c, entry-type, root-bits)
end function;
define function bootstrap-typed-allocate-engine-node (c :: <class>,
entry-type :: <integer>,
root-bits :: <integer>)
let callbacks :: <simple-object-vector> = *engine-node-callbacks*;
let e :: <engine-node> = system-allocate-simple-instance(c);
let extra-bits :: <integer> = logand(root-bits, lognot(properties$m-entry-type));
properties(e) := logior(extra-bits, entry-type);
let callback? = vector-element(callbacks, entry-type);
if (callback?)
let callback :: <callback> = callback?;
engine-node-callback(e) := callback-iep(callback);
end if;
e
end function;
define function bootstrap-allocate-and-initialize-engine-node
(entry-type :: <integer>, root-bits :: <integer>)
=> (e :: <engine-node>);
let e :: <engine-node> = bootstrap-allocate-engine-node(entry-type, root-bits);
primitive-initialize-engine-node(e);
e
end function;
define function standard-discriminator-bits
(gf :: <generic-function>) => (bits :: <integer>);
let sig :: <signature> = function-signature(gf);
let props :: <integer> = ash(signature-number-required(sig),
discriminator$v-nrequired);
if (signature-optionals?(sig)) logior(props, discriminator$m-restp) else props end
end function;
define constant $standard-discriminator-bit-mask
= logior(discriminator$m-nrequired, discriminator$m-restp);
define inline function bootstrap-shared-allocate-discriminator
(entry-type :: <integer>, argnum :: <integer>, root-bits :: <integer>, d :: <discriminator>)
=> (d :: <discriminator>)
let callbacks :: <simple-object-vector> = *engine-node-callbacks*;
let props :: <integer>
= logand(root-bits, lognot(logior(discriminator$m-argnum, properties$m-entry-type)));
props := logior(props, entry-type);
props := logior(props, fixnum-dammit(ash(argnum, discriminator$v-argnum)));
let nreq :: <integer>
= ash(logand(root-bits, discriminator$m-nrequired),
- discriminator$v-nrequired);
if (~(argnum < nreq)) // @@@@ (argnum >= nreq)
error("Discriminator being created with conflicting nrequired %= and argnum %=.", nreq, argnum)
end if;
properties(d) := props;
let callback? = vector-element(callbacks, entry-type);
if (callback?)
let callback :: <callback> = callback?;
engine-node-callback(d) := callback-iep(callback);
end if;
d
end function;
define function bootstrap-allocate-discriminator
(entry-type :: <integer>, argnum :: <integer>, root-bits :: <integer>)
=> (d :: <discriminator>)
let classes :: <simple-object-vector> = *engine-node-classes*;
let c :: <class> = vector-element(classes, entry-type);
let d :: <discriminator> = system-allocate-simple-instance(c);
bootstrap-shared-allocate-discriminator(entry-type, argnum, root-bits, d);
end function;
define function bootstrap-allocate-repeated-discriminator
(entry-type :: <integer>, argnum :: <integer>, root-bits :: <integer>, size :: <integer>, default)
=> (d :: <discriminator>)
let classes :: <simple-object-vector> = *engine-node-classes*;
let c :: <class> = vector-element(classes, entry-type);
let d :: <discriminator> = system-allocate-repeated-object-instance(c, #f, size, default);
bootstrap-shared-allocate-discriminator(entry-type, argnum, root-bits, d);
end function;
define open generic bletch (x :: <condition>) => ();
define open method bletch (x :: <condition>) => ()
signal(x)
end method;
define open method bletch (x :: <error>) => ()
error(x)
end method;
define function bletch-stack (l :: <list>)
if (l == #())
#f
else
bletch-stack(tail(l));
bletch(head(l));
end if
end function;
/* *******************************************************
Object locking
******************************************************* */
// This is the general mechanism we use for locking individual objects
// against writing. It doesn't need extra space in the object, nor a high
// number of locks (two total), and hopefully it will be fast enough. I
// see it being used for generic functions, maybe dispatch tables (I'm
// undecided as to how generic function vs. dispatch table locking will be
// done during discrimination fulfillment). I suspect class redefinition
// may require a bigger and more exclusive club (not per-object). Maybe
// this lock will revert to being a generic function only lock, and maybe
// as a consequence it will implicitly lock out class redefinition, or
// something like that. Anyway, it seems to be a reasonable paradigm for
// being able to write-lock individual objects.
define constant $object-lock-notification-lock :: <simple-lock> =
make-simple-lock();
define constant $object-lock-notification :: <notification> =
make-notification($object-lock-notification-lock);
define variable *object-lock-data* :: <list> = #();
define inline-only function token-for-current-thread () => (a-token)
if (*dylan-library-initialized?*)
current-thread()
else #t; // This token could be anything
end if;
end function;
// define function object-locked-p (obj) => (ans :: <list>);
// iterate loop (l :: <list> = *object-lock-data*)
// if (l == #())
// #()
// else
// let couple :: <pair> = head(l);
// if (pointer-id?(head(couple), obj))
// couple
// else
// let nxt :: <list> = tail(l);
// loop(nxt)
// end if
// end if
// end iterate
// end function;
define function multiple-objects-locked? (cells :: <list>, token) => (ans);
if (*object-lock-data* == #())
#f
else
local method peruse (cells :: <list>, recursive-losers :: <list>)
if (cells == #())
if (recursive-losers == #()) #f else recursive-losers end
else
let cell :: <pair> = head(cells);
let obj = head(cell);
let nxt :: <list> = %proper-list-tail(cells);
local method checklock (l :: <list>)
if (l == #())
peruse(nxt, recursive-losers)
else
let this :: <pair> = head(l);
if (pointer-id?(obj, this))
if (pointer-id?(token, tail(this)))
peruse(nxt, pair(obj, recursive-losers))
else
#t
end if
else
checklock(tail(l))
end if
end if
end method;
checklock(*object-lock-data*)
end if
end method;
peruse(cells, #())
end if
end function;
//define function begin-locking-object (cell :: <pair>)
// let cell2 :: <pair> = head(cell);
// let obj = head(cell2);
// let lock :: <simple-lock> = $object-lock-notification-lock;
// let notif :: <notification> = $object-lock-notification;
// with-lock (lock)
// iterate try-again ()
// let lockedp :: <list> = object-locked-p(obj);
// if (lockedp == #())
// tail(cell) := *object-lock-data*;
// *object-lock-data* := cell;
// tail(cell2) := token-for-current-thread();
// release(notif);
// cell
// elseif (tail(lockedp) == token-for-current-thread())
// error("Attempt to recursively lock object %=", obj)
// else
// wait-for(notif);
// try-again()
// end if
// end iterate
// end with-lock
//end function;
define function begin-locking-multiple-objects (hd :: <pair>, tl :: <pair>)
let lock :: <simple-lock> = $object-lock-notification-lock;
let notif :: <notification> = $object-lock-notification;
let token = token-for-current-thread();
with-lock (lock)
iterate try-again ()
let stuff = multiple-objects-locked?(hd, token);
if (stuff == #f)
for (x :: <pair> in hd) tail(x) := token end;
tail(tl) := *object-lock-data*;
*object-lock-data* := hd;
release(notif);
elseif (stuff == #t)
wait-for(notif);
try-again()
else
error("Attempt to recursively lock objects %=", stuff)
end if
end iterate
end with-lock
end function;
define function end-locking-object-cell (cell :: <pair>)
let data :: <list> = *object-lock-data*;
let first-l :: <list> = %proper-list-tail(data);
if (cell == data)
*object-lock-data* := tail(data)
else
iterate sigh (prev :: <list> = data, l :: <list> = first-l)
if (l == #())
#f // This means we aborted before getting the lock.
else
let nxt :: <list> = %proper-list-tail(l);
if (l == cell)
tail(prev) := nxt;
else sigh(l, nxt)
end if
end if
end iterate
end if;
end function;
//define function end-locking-object (cell :: <pair>)
// let lock :: <simple-lock> = $object-lock-notification-lock;
// let notif :: <notification> = $object-lock-notification;
// with-lock (lock)
// end-locking-object-cell(cell);
// release(notif);
// end with-lock;
// values()
//end function;
define function end-locking-multiple-objects (hd :: <pair>, tl :: <pair>) => ()
let lock :: <simple-lock> = $object-lock-notification-lock;
let notif :: <notification> = $object-lock-notification;
with-lock (lock)
block(done)
for (x :: <pair> = hd then tail(x))
end-locking-object-cell(x);
if (x == tl) done() end;
end for;
end;
release(notif);
end with-lock;
values()
end function;
define macro with-object-lock
{ with-object-lock (?object:expression)
?body:body
end
}
=>
// { begin
// let $cell$ = pair(pair(?object, #f), #());
// block ()
// begin-locking-object($cell$);
// ?body;
// cleanup
// end-locking-object($cell$);
// end block
// end
// }
{ begin
let _objlist = pair(pair(?object, #f), #());
block ()
begin-locking-multiple-objects(_objlist, _objlist);
?body;
cleanup
end-locking-multiple-objects(_objlist, _objlist);
end block
end
}
{ with-object-lock (?object:expression, ?punter:name)
?body:body
end
}
=>
{ begin
let _objlist = pair(pair(?object, #f), #());
block (?punter)
begin-locking-multiple-objects(_objlist, _objlist);
?body;
cleanup
end-locking-multiple-objects(_objlist, _objlist);
end block
end
}
end macro;
define inline-only function make-multiple-object-lock-cells (seq :: <sequence>)
=> (h :: <pair>, t :: <pair>)
let t = #();
for (x in seq,
ans :: <list> = #() then pair(pair(x, #f), ans))
if (t == #()) t := ans end;
finally values(ans, if (t == #()) ans else t end)
end for;
end function;
define macro with-multiple-object-lock
{ with-multiple-object-lock (?objectsequence:expression)
?body:body
end
}
=>
{ begin
let _objseq = ?objectsequence;
if (~empty?(_objseq))
let (_head :: <pair>, _tail :: <pair>) = make-multiple-object-lock-cells(_objseq);
block ()
begin-locking-multiple-objects(_head, _tail);
?body;
cleanup
end-locking-multiple-objects(_head, _tail);
end block
end if
end
}
end macro;
/* *******************************
Simple, terminal discriminators
******************************* */
define function %gf-dispatch-absent (mepargs :: <simple-object-vector>,
e :: <engine-node>,
parent :: <dispatch-starter>)
handle-missed-dispatch(e, parent, mepargs)
end function;
define function %gf-dispatch-inapplicable (spreadargs :: <simple-object-vector>,
e :: <inapplicable-engine-node>,
parent :: <dispatch-starter>)
ignore(e);
no-applicable-method-error(parent-gf(parent), copy-sequence(spreadargs))
end function;
define function %gf-dispatch-ambiguous-methods (spreadargs :: <simple-object-vector>,
e :: <ambiguous-methods-engine-node>,
parent :: <dispatch-starter>)
ambiguous-method-error(parent-gf(parent), copy-sequence(spreadargs),
ambiguous-methods-engine-node-ordered(e),
ambiguous-methods-engine-node-ambig(e))
end function;
define function make-ambiguous-methods-engine-node
(ordered :: <sequence>, ambig :: <sequence>)
=> (e :: <ambiguous-methods-engine-node>);
let e :: <ambiguous-methods-engine-node>
= bootstrap-allocate-engine-node(engine-node$k-ambiguous-methods, 0);
ambiguous-methods-engine-node-ordered(e) := ordered;
ambiguous-methods-engine-node-ambig(e) := ambig;
primitive-initialize-engine-node(e);
e
end function;
define inline function make-ambiguous-methods-next-method
(ordered :: <sequence>, ambig :: <sequence>, gf :: <generic-function>)
=> (p :: <pair>);
pair(make-ambiguous-methods-engine-node(ordered, ambig), gf)
end function;
define sealed inline method make (c == <single-method-engine-node>, #key meth :: <method>, data, keys)
=> (e :: <single-method-engine-node>);
ignore(c);
make-single-method-engine-node(meth, data: data, keys: keys)
end method;
define function make-single-method-engine-node (meth :: <method>, #key data, keys)
// @@@@@ The method here is known to not be an <accessor-method>, so can
// use a more specialized version of function-signature when one is available.
let sig :: <signature> = function-signature(meth);
let bits :: <integer> = ash(signature-number-required(sig), smen$v-nrequired);
let bits :: <integer> = if (signature-optionals?(sig)) logior(smen$m-restp, bits) else bits end;
let sme :: <single-method-engine-node>
= if (keys == #f)
bootstrap-allocate-engine-node(engine-node$k-unkeyed-single-method, bits)
elseif (keys == #t)
bootstrap-allocate-engine-node(engine-node$k-unrestricted-keyed-single-method, bits)
else
let keys :: <simple-object-vector> = keys;
let mkeys :: <simple-object-vector> = keyword-specifiers(meth);
let nkeys :: <integer> = size(keys);
let nmkeys :: <integer> = size(mkeys);
if (nkeys = ash(nmkeys, -1)
& begin
local method outer (i :: <integer>)
if (i = nkeys)
#t
else
let k :: <symbol> = vector-element(keys, i);
local method inner (j :: <integer>)
if (j = nmkeys)
#f
elseif (pointer-id?(k, vector-element(mkeys, j)))
outer(i + 1)
else
inner(j + 2)
end if
end method;
inner(0)
end if
end method;
outer(0)
end)
bootstrap-allocate-engine-node(engine-node$k-implicit-keyed-single-method, bits)
else
let e :: <explicit-keyed-single-method-engine-node>
= bootstrap-allocate-engine-node(engine-node$k-explicit-keyed-single-method, bits);
single-method-engine-node-keys(e) := keys;
e
end if
end if;
single-method-engine-node-method(sme) := meth;
single-method-engine-node-data(sme) := data;
primitive-initialize-engine-node(sme);
sme
end function;
/* *****************
Dispatch by Class
***************** */
define constant ckd$v-log2size = discriminator$v-data-start;
define constant ckd$s-log2size = 5;
define macro with-lckd-dispatch
{ with-lckd-dispatch (?d:name)
?:body
end }
=> { if (instance?(?d, <linear-by-singleton-class-discriminator>))
let ?d :: <linear-by-singleton-class-discriminator> = ?d;
?body
else
let ?d :: <linear-by-class-discriminator> = ?d;
?body
end if }
end macro;
define macro with-hckd-dispatch
{ with-hckd-dispatch (?d:name)
?:body
end }
=> { if (instance?(?d, <hashed-by-singleton-class-discriminator>))
let ?d :: <hashed-by-singleton-class-discriminator> = ?d;
?body
else
let ?d :: <hashed-by-class-discriminator> = ?d;
?body
end if }
end macro;
define macro with-ckd-dispatch
{ with-ckd-dispatch (?d:name)
?:body
end }
=> { if (instance?(?d, <linear-class-keyed-discriminator>))
let ?d :: <linear-class-keyed-discriminator> = ?d;
with-lckd-dispatch (?d)
?body
end
else
let ?d :: <hashed-class-keyed-discriminator> = ?d;
with-hckd-dispatch (?d)
?body
end
end if }
end macro;
define inline function %ckd-ref
(ckd :: <class-keyed-discriminator>, idx :: <integer>)
class-keyed-discriminator-table-element(ckd, idx)
end function;
define inline function %ckd-ref-setter
(value, ckd :: <class-keyed-discriminator>, idx :: <integer>)
class-keyed-discriminator-table-element(ckd, idx) := value
end function;
define inline function %ckd-size (ckd :: <class-keyed-discriminator>)
=> (key-and-value-vector-size :: <integer>)
class-keyed-discriminator-table-size(ckd)
end function;
define inline function %ckd-mask (ckd :: <class-keyed-discriminator>) => (mask :: <integer>)
class-keyed-discriminator-table-size(ckd) - 2
end function;
// @@@@ Variable because Apple Dylan compiler copies value and loses eqness!
// @@@@ Keep it that way - better safe than sorry.
define variable $ckd-empty
= #(#"*empty*");
// How big we let a linear discrimination table get. Units are total number
// of data entries, twice the number of key/value pairs.
define constant $linear-discriminator-table-limit :: <integer> = 2 * 5;
define constant $linear-discriminator-table-growth-increment :: <integer> = 2 * 2;
define function hashed-class-keyed-discriminator-log2size
(storage-size :: <integer>) => (table-size :: <integer>)
local method f (i :: <integer>)
let nxt :: <integer> = i + 1;
let siz :: <integer> = %twopower(i);
// @@@@ if (siz > storage-size) nxt else f(nxt) end
if (storage-size < siz) nxt else f(nxt) end
end method;
f(4)
end function;
define inline function grow-linear-class-keyed-discriminator
(d :: <linear-class-keyed-discriminator>)
=> (nd :: <class-keyed-discriminator>)
let stgsiz :: <integer> = %ckd-size(d);
let nstgsiz :: <integer> = stgsiz + $linear-discriminator-table-growth-increment;
let initbits :: <integer> = logand(properties(d), $standard-discriminator-bit-mask);
dbg("grow-linear-class-keyed-discriminator %= - stgsiz=%=, nstgsiz=%=",
d, stgsiz, nstgsiz);
let nd :: <class-keyed-discriminator>
= if (~(nstgsiz < $linear-discriminator-table-limit)) // @@@@ (nstgsiz >= $linear-discriminator-table-limit)
make-hashed-class-keyed-discriminator(logior(engine-node-function-code(d), 1),
discriminator-argnum(d),
hashed-class-keyed-discriminator-log2size(nstgsiz),
initbits)
else
make-linear-class-keyed-discriminator(logand(engine-node-function-code(d), -2),
discriminator-argnum(d), nstgsiz, initbits)
end if;
copy-class-keyed-discriminator-attributes(d, nd);
local method loop (i :: <integer>, nd :: <class-keyed-discriminator>)
if (i = stgsiz)
nd
else
loop(i + 2, ckd-add!(nd, %ckd-ref(d, i), %ckd-ref(d, i + 1)))
end if
end method;
loop(0, nd);
end function;
define inline function grow-hashed-class-keyed-discriminator
(d :: <hashed-class-keyed-discriminator>)
=> (nd :: <hashed-class-keyed-discriminator>)
let stgsiz :: <integer> = %ckd-size(d);
let log2stgsize = %load-byte(ckd$v-log2size, ckd$s-log2size, properties(d));
let nstgsiz :: <integer> = ash(stgsiz, 1);
let initbits :: <integer> = logand(properties(d), $standard-discriminator-bit-mask);
dbg("grow-hashedclass-keyed-discriminator %= - stgsiz=%=, log2=%=, nstgsiz=%=",
d, stgsiz, log2stgsize, nstgsiz);
let nd :: <hashed-class-keyed-discriminator>
= make-hashed-class-keyed-discriminator(engine-node-function-code(d), discriminator-argnum(d),
log2stgsize + 1, initbits);
copy-class-keyed-discriminator-attributes(d, nd);
local method loop (i :: <integer>, nd :: <class-keyed-discriminator>)
if (i = stgsiz)
nd
else
let k = %ckd-ref(d, i);
if (pointer-id?(k, $ckd-empty))
loop (i + 2, nd)
else
loop(i + 2, ckd-add!(nd, k, %ckd-ref(d, i + 1)))
end if
end if
end method;
loop (0, nd)
end function;
define function copy-class-keyed-discriminator-attributes
(d :: <class-keyed-discriminator>, nd :: <class-keyed-discriminator>)
=> ()
if (instance?(d, <by-singleton-class-discriminator>))
grounded-class-keyed-discriminator-default(nd) := grounded-class-keyed-discriminator-default(d);
end if;
end function;
define function grounded-class-keyed-discriminator-default
(d :: <class-keyed-discriminator>)
=> (nd :: <object>)
select (d by instance?)
<monomorphic-by-class-discriminator>, <linear-by-class-discriminator>, <hashed-by-class-discriminator> =>
$absent-engine-node;
<linear-by-singleton-class-discriminator> =>
let d :: <linear-by-singleton-class-discriminator> = d;
class-keyed-discriminator-default(d);
<hashed-by-singleton-class-discriminator> =>
let d :: <hashed-by-singleton-class-discriminator> = d;
class-keyed-discriminator-default(d);
end select
end function;
define function grounded-class-keyed-discriminator-default-setter
(value :: <object>, d :: <class-keyed-discriminator>)
=> (nd :: <object>)
select (d by instance?)
<linear-by-singleton-class-discriminator> =>
let d :: <linear-by-singleton-class-discriminator> = d;
class-keyed-discriminator-default(d) := value;
<hashed-by-singleton-class-discriminator> =>
let d :: <hashed-by-singleton-class-discriminator> = d;
class-keyed-discriminator-default(d) := value;
end select
end function;
define function make-linear-class-keyed-discriminator
(code :: <integer>, argnum :: <integer>,
table-size :: <integer>, extra-bits :: <integer>)
=> (discriminator :: <linear-class-keyed-discriminator>)
dbg("make-linear-class-keyed-discriminator %= %= %=", code, argnum, table-size);
let d :: <linear-class-keyed-discriminator>
= bootstrap-allocate-repeated-discriminator(code, argnum, extra-bits, table-size, $ckd-empty);
lckd-index(d) := 0;
primitive-initialize-discriminator(d);
d
end function;
define function make-hashed-class-keyed-discriminator
(code :: <integer>, argnum :: <integer>,
log2size :: <integer>, extra-bits :: <integer>)
=> (discriminator :: <class-keyed-discriminator>);
dbg("make-hashed-class-keyed-discriminator %= %= %=", code, argnum, log2size);
let bitz :: <integer> = logior(extra-bits, ash(log2size, ckd$v-log2size));
let table-size :: <integer> = %twopower(log2size);
let d :: <hashed-class-keyed-discriminator>
= bootstrap-allocate-repeated-discriminator(code, argnum, bitz, table-size, $ckd-empty);
primitive-initialize-discriminator(d);
d
end function;
define function make-initial-class-keyed-discriminator
(code :: <integer>, argnum :: <integer>,
gf :: <generic-function>, number-of-keys :: <integer>)
dbg("make-initial-class-keyed-discriminator %= %= %=", code, argnum, number-of-keys);
let stgsiz :: <integer> = ash(number-of-keys, 1);
let bitz :: <integer> = standard-discriminator-bits(gf);
if (~(stgsiz < $linear-discriminator-table-limit)) // @@@@ (stgsiz >= $linear-discriminator-table-limit)
make-hashed-class-keyed-discriminator(logior(code, 1), argnum,
hashed-class-keyed-discriminator-log2size(stgsiz),
bitz)
else
make-linear-class-keyed-discriminator(logand(code, -2), argnum, logand(stgsiz + 3, -8),
bitz)
end if
end function;
define function make-by-class-discriminator
(argnum :: <integer>, gf :: <generic-function>, number-of-keys :: <integer>)
=> (d :: <by-class-discriminator>);
if (number-of-keys == 1)
make-monomorphic-by-class-discriminator(argnum, gf)
else
make-initial-class-keyed-discriminator(engine-node$k-linear-by-class, argnum, gf, number-of-keys)
end if
end function;
define function make-by-singleton-class-discriminator
(argnum :: <integer>, gf :: <generic-function>, number-of-keys :: <integer>, default)
=> (d :: <by-singleton-class-discriminator>);
let d :: <by-singleton-class-discriminator>
= make-initial-class-keyed-discriminator(engine-node$k-linear-by-singleton-class, argnum, gf, number-of-keys);
grounded-class-keyed-discriminator-default(d) := default;
d
end function;
//---*** FIXME: When the compiler does range analysis, this might not be needed.
define inline-only function add-without-overflow (x :: <integer>, y :: <integer>) => (z :: <integer>)
let mx = interpret-integer-as-machine-word(x);
let my = strip-integer-tag(interpret-integer-as-machine-word(y));
let result = machine-word-add(mx, my);
interpret-machine-word-as-integer(result)
end;
define inline function linear-class-key-lookup
(key :: <integer>, d :: <linear-class-keyed-discriminator>, default)
let n :: <integer> = %ckd-size(d);
local method loop (i :: <integer>)
if (i = n)
default
else
let otherkey = %ckd-ref(d, i);
if (pointer-id?(otherkey, key))
%ckd-ref(d, add-without-overflow(i, 1))
// elseif (pointer-id?(otherkey, $ckd-empty))
// default
else
loop(add-without-overflow(i, 2))
end if
end if
end method;
loop(0)
end function;
/*
define inline function linear-class-key-lookup
(key :: <integer>, d :: <linear-class-keyed-discriminator>, default)
=> (ans)
let firsti :: <integer> = lckd-index(d);
let otherkey = %ckd-ref(d, firsti);
if (pointer-id?(otherkey, key))
%ckd-ref(d, firsti + 1)
else
let n :: <integer> = %ckd-size(d);
local method loop (i :: <integer>)
let i :: <integer> = i + 2;
let i :: <integer> = if (i == n) 0 else i end;
if (i == firsti)
default
else
let otherkey = %ckd-ref(d, i);
if (pointer-id?(otherkey, key))
lckd-index(d) := i;
%ckd-ref(d, i + 1)
else
loop(i)
end if
end if
end method;
loop(firsti)
end if
end function;
*/
define function grounded-linear-class-key-lookup
(key :: <integer>, d :: <linear-class-keyed-discriminator>, default)
with-lckd-dispatch (d)
linear-class-key-lookup(key, d, default);
end with-lckd-dispatch;
end function;
define function %gf-dispatch-linear-by-class
(arg, parent :: <dispatch-starter>, d :: <linear-by-class-discriminator>)
ignore(parent);
linear-class-key-lookup(object-class-unique-key(arg), d, $absent-engine-node)
end function;
define function %gf-dispatch-linear-by-singleton-class
(arg :: <class>, parent :: <dispatch-starter>, d :: <linear-by-singleton-class-discriminator>)
ignore(parent);
linear-class-key-lookup(class-unique-key(arg), d, class-keyed-discriminator-default(d))
end function;
/* ****** Hashing. ******
* We use a power of 2 hash table size - avoid division in computing the hash index.
* The hash index is computed by masking something of the wrapper. It may be an incrementally
assigned index, or it may come from the address, but we assume it is unchanging
over time (we don't want to have to rehash, at least not commonly). It does need to be
a per-wrapper (maybe per-implementation-class), not per-class, key, if we want to allow
any kind of lazy invalidation. The number used to compute the first hash probe index is
simply masked by the bitmask for the size of the table. Were it coming from an address, a
small right-shift might be appropriate.
* We compute a step for successive probes in the event of a hash conflict. To do this,
we start with the same number which was used to compute the initial probe, but select the
bits just to the left of the ones used to compute the first index. This maximizes the chance
that they are different when the lower set of bits are the same. Some set of these bits are
used to index into a table of prime numbers. The result only has to be odd
in order step through all positions in the table, so this masking will decrease the optimality of
the second hash in smaller tables, but not remove it entirely.
* The table is referenced as alternating keys and values at successive indices, so all numbers
indicating positions/probes/steps are returned scaled appropriately by the routines
which generate them.
*/
define inline function %hckd-first-index
(key :: <integer>, d :: <hashed-class-keyed-discriminator>)
=> (index :: <integer>)
logand(key, %ckd-mask(d))
end function;
// See %hckd-hash-step.
define constant $second-hash-values :: <simple-object-vector>
= #[2, // index = 0, step = 1
6, // index = 1, Step = 3
10, // index = 2, Step = 5
14, // index = 3, Step = 7
22, // index = 4, step = 11
26, // index = 5, step = 13
34, // index = 6, step = 17
38, // index = 7, step = 19
46, // index = 8, step = 23
58, // index = 9, step = 29
62, // index = 10, step = 31
74, // index = 11, step = 37
82, // index = 12, step = 41
86, // index = 13, step = 43
94, // index = 14, step = 47
106 // index = 15, step = 53
];
// Mask to compute index mod the size of $second-hash-values.
define constant $second-hash-mask :: <integer> = 15;
define inline function %hckd-hash-step
(key :: <integer>, d :: <hashed-class-keyed-discriminator>) => (step :: <integer>, mask :: <integer>)
let log2size :: <integer> = %load-byte(ckd$v-log2size, ckd$s-log2size, properties(d));
values(primitive-the(<integer>,
vector-element($second-hash-values,
logand(%scale-down(key, log2size),
$second-hash-mask))),
%twopower(log2size) - 2)
end function;
define inline function %hckd-next-index
(i :: <integer>, step :: <integer>, mask :: <integer>) => (idx :: <integer>)
let next :: <integer> = i + step;
logand(next, mask)
end function;
define inline function hashed-class-key-lookup
(key :: <integer>, d :: <hashed-class-keyed-discriminator>, default)
=> (discriminator :: <object>);
let i :: <integer> = %hckd-first-index(key, d);
let otherkey = %ckd-ref(d, i);
if (pointer-id?(otherkey, key))
%ckd-ref(d, i + 1)
elseif (pointer-id?(otherkey, $ckd-empty))
default
else
let (step :: <integer>, mask :: <integer>)
= %hckd-hash-step(key, d);
local method loop (i :: <integer>)
let i :: <integer> = %hckd-next-index(i, step, mask);
let otherkey = %ckd-ref(d, i);
if (pointer-id?(otherkey, key))
%ckd-ref(d, i + 1)
elseif (pointer-id?(otherkey, $ckd-empty))
default
else
loop(i)
end if
end method;
loop(i)
end if
end function;
define function grounded-hashed-class-key-lookup
(key :: <integer>, d :: <hashed-class-keyed-discriminator>, default)
with-hckd-dispatch (d)
hashed-class-key-lookup(key, d, default);
end with-hckd-dispatch;
end function;
define function %gf-dispatch-hashed-by-class
(arg, parent :: <dispatch-starter>, d :: <hashed-by-class-discriminator>)
ignore(parent);
hashed-class-key-lookup(object-class-unique-key(arg), d, $absent-engine-node)
end function;
define function %gf-dispatch-hashed-by-singleton-class
(arg :: <class>, parent :: <dispatch-starter>, d :: <hashed-by-singleton-class-discriminator>)
ignore(parent);
hashed-class-key-lookup(class-unique-key(arg), d, class-keyed-discriminator-default(d))
end function;
define function ckd-lookup
(key, d :: <class-keyed-discriminator>) => (ans :: <object>)
let default = grounded-class-keyed-discriminator-default(d);
if (instance?(d, <monomorphic-by-class-discriminator>))
let d :: <monomorphic-by-class-discriminator> = d;
if (monomorphic-by-class-discriminator-key(d) == key)
monomorphic-by-class-discriminator-next(d)
else
default
end if
else
if (instance?(d, <linear-class-keyed-discriminator>))
let d :: <linear-class-keyed-discriminator> = d;
grounded-linear-class-key-lookup(key, d, default)
else
let d :: <hashed-class-keyed-discriminator> = d;
grounded-hashed-class-key-lookup(key, d, default)
end if
end if
end function;
define function ckd-ref
(d :: <class-keyed-discriminator>, index :: <integer>) => (value);
with-ckd-dispatch (d)
%ckd-ref(d, index)
end with-ckd-dispatch;
end function;
define function ckd-ref-setter
(value, d :: <class-keyed-discriminator>, index :: <integer>)