-
Notifications
You must be signed in to change notification settings - Fork 7
/
infer.lisp
1963 lines (1790 loc) · 79 KB
/
infer.lisp
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
(in-package #:3bgl-shaders)
(defvar *inference-worklist*)
(defvar *current-function-return-type*)
(defvar *current-function-stages*)
(defvar *current-function-local-types*)
(defclass any-type ()
((constraints :initform (make-hash-table) :accessor constraints :initarg :constraints)))
(defclass inference-call-site ()
;; can't use called function directly, since we might have multiple
;; calls with incompatible types
((called-function :accessor called-function :initarg :called-function)))
(define-condition inference-failure () ())
(define-condition incomplete-dependent (inference-failure) ())
(defclass optional-arg-type ()
;; used to indicate optional args, replaced by actual type
;; when actual number of args passed is known
((arg-type :initarg :arg-type :accessor arg-type)))
(defclass constrained-type ()
;; constraints shouldn't include equality constraints, they get
;; handled in UNIFY
((types :accessor types :initarg :types
:initform (make-hash-table))
(constraints :initform (make-hash-table) :accessor constraints :initarg :constraints)))
(defmethod types ((type concrete-type))
(alexandria:alist-hash-table (list (cons type t))))
(defclass ref-type ()
;; instead of trying to replace type objects in constraints etc when
;; unifying, we just change-class to a ref-type, and the container
;; can resolve it to the real type on use
((equiv :initarg :equiv :accessor equiv :initform nil)))
(defmethod get-equiv-type (type)
;; possibly should error on things that aren't known types?
type)
(defmethod get-equiv-type ((type ref-type))
(let ((e (equiv type)))
(assert (and e (not (eql e type))))
(setf (equiv type) (get-equiv-type e))))
(defun debug-type-names (type)
(typecase type
(null nil)
(list (mapcar 'debug-type-names type))
(generic-type (name type))
(any-type T)
(constrained-type
(debug-type-names
(mapcar 'car
(remove nil (alexandria:hash-table-alist
(types type))
:key 'cdr))))
(ref-type
(format nil "->~a" (debug-type-names (get-equiv-type type))))
(optional-arg-type
(format nil "(or NIL ~s)" (debug-type-names (arg-type type))))
(hash-table
(let ((x))
(maphash (lambda (k v) (when v (push (debug-type-names k) x))) type)
x))
(t
#++(error "tried to get name of unknown type ~s?" type)
"<T>"
)))
(defun debug-local-binding-type-data (hash)
(labels ((d (x)
(typecase x
(symbol
x)
(number
x)
((eql :return)
x)
(function-call
(format nil "(~a~{~^ ~a~})" (name (called-function x))
(mapcar #'d (arguments x))))
(variable-read
(d (binding x)))
(local-variable
(name x))
(interface-binding
(name x))
(slot-access
(format nil "(@ ~a ~a)" (d (binding x)) (field x)))
(swizzle-access
(format nil "(.~a ~a)" (field x)
(d (binding x))))
(t (debug-type-names x)))))
(loop for (k . v) in (alexandria:hash-table-alist hash)
do (format t "~a -> ~a~%"
(d k)
(d v)))))
(defun print-bindings/ret (name bindings ret)
(when name (format t "inferred ~s:~%" name))
(loop for i in bindings
do (format t " ~a ~@[(~s) ~]=~% ~s~%" (if (typep i 'generic-type)
(name i)
i)
(if (typep i 'binding)
(value-type i)
nil)
(debug-type-names (if (typep i 'binding)
(value-type i)
i))))
(format t " -> ~s~%" (debug-type-names ret)))
(defmethod add-constraint (ctype constraint)
;; not an error, so we don't have to check before assigning constraints...
(when *verbose* (format t "added constraint to type ~s?~%" ctype)))
(defmethod add-constraint ((ctype constrained-type) constraint)
(setf (gethash constraint (constraints ctype)) t))
(defmethod add-constraint ((ctype any-type) constraint)
(setf (gethash constraint (constraints ctype)) t))
(defmethod add-constraint ((ctype optional-arg-type) constraint)
(add-constraint (arg-type ctype) constraint))
(defmethod add-constraint ((ctype ref-type) constraint)
(add-constraint (equiv ctype) constraint))
(defclass constraint ()
((modified :initform nil :accessor modified)))
(defun flag-modified-constraint (constraint)
(unless (modified constraint)
(when *verbose* (format t "~&flag constraint ~s ~s~%" constraint (name constraint)))
(setf (modified constraint) t)
(push constraint *inference-worklist*)))
(defun flag-modified-type (type)
(setf type (get-equiv-type type))
(when *verbose*
(format t "~&flag type ~s (~s)~%" type (debug-type-names type)))
(maphash (lambda (constraint v)
(when v (flag-modified-constraint constraint)))
(constraints type)))
(defclass function-application (constraint)
((argument-types :accessor argument-types :initform nil)
(return-type :initarg :return-type :accessor return-type) ;; SET-TYPE?
(function-types :initarg :function-types :accessor function-types) ;; modifiable list of ftype, each is a list of concrete arg types + concrete ret type
(name :initarg :name :accessor name :initform nil))) ;; for debugging
;;; used to store types for variable arity built-in functions (or ones with
;;; optional args)
;;; converted to a normal function-application with specific arity
;;; before type inference, when we know how many arguments are passed
;;; to it
(defclass variable-arity-function-application (function-application)
((min-arity :initarg :min-arity :accessor min-arity :initform 0)
(max-arity :initarg :max-arity :accessor max-arity :initform 0)
;; array of MAX-ARITY+1 lists of ftypes
;; entry N contains ftypes of arity N, or NIL if function doesn't
;; accept that arity
;; ftype is list of list of concrete arg types + concrete return type
;; ex ((int int int) vec3)
(function-types-by-arity :initarg :function-types-by-arity
:accessor function-types-by-arity)))
(defclass global-function-constraint (constraint)
;; doesn't actually constrain things, just a place to track changes
;; to argument bindings' types
((name :accessor name :initarg :name :initform nil)
(function :accessor global-function :initarg :function)
(argument-types :accessor argument-types :initform nil)
(return-type :initarg :return-type :accessor return-type)))
(defclass cast-constraint (constraint)
;; represents a possible cast from IN-TYPE to OUT-TYPE
;; (can't just unify them, since we might have other incompatible
;; uses for IN. for example in (setf a 1) (setf b a) (* a uvec)
;; (setf b 1.2), A needs to be :INT or :UINT for the multiplication
;; and B needs to be :FLOAT for the 2nd assignment, so they can't be
;; unified directly at (SETF B A) it needs to unify something like
;; (SETF B (CAST A)) where knowing B is a float means A is
;; INT/UINT/FLOAT, and knowing A is INT/UINT means B is
;; INT/UINT/FLOAT
;;
;; on update, if none of the input or output types can be involved
;; in an implicit cast (like structs or samplers), it should remove
;; itself from in/out and unify them normally
;;
;; cast-type can be :implicit or :explicit, which use corresponding
;; slots in the types
((cast-type :initform :implicit :accessor cast-type :initarg :cast-type)
(in-type :initarg :in :accessor in-type)
(out-type :initarg :out :accessor out-type)
(name :initarg :name :accessor name :initform nil)))
(defclass ctype/other-constraint (constraint)
((ctype :initarg :ctype :accessor ctype)
(other-type :initarg :other-type :accessor other-type)))
(defclass same-size-different-base-type-constraint (ctype/other-constraint)
;; CTYPE is restricted to a vector or scalar with same number of
;; elements as OTHER-TYPE, but with elements of BASE-TYPE
;; ex base-type :bool => :float -> bool, :vec2 -> :bvec2, :ivec3 -> :bvec3
((base-type :initarg :base-type :accessor base-type)))
(defclass same-base-type-different-size-constraint (ctype/other-constraint)
;; CTYPE is restricted to a vector or scalar with fixed size
;; but same base-type as OTHER-TYPE, which must be a vector with
;; at least MIN-SIZE elements
;; ex (or :vec3 :ivec4) -> (or :vec2 :ivec2)
((out-size :initarg :out-size :accessor out-size)
(min-size :initarg :min-size :accessor min-size)))
(defclass same-type-or-scalar-constraint (ctype/other-constraint)
;; CTYPE is same type as OTHER-TYPE or a scalar of same type as base
;; type of OTHER-TYPE
;; ex :float -> :float, :ivec2 -> (or :ivec2 :int), :vec3 -> (or :vec3 :float)
())
(defclass scalar-type-of-constraint (ctype/other-constraint)
;; CTYPE is scalar base type of OTHER-TYPE
;; ex :float -> :float, :ivec2 -> :int, :vec3 -> :float
())
(defclass array-access-constraint (ctype/other-constraint)
;; CTYPE is array type of length at least MIN-SIZE containing
;; elements of type OTHER-TYPE
((min-size :initarg :min-size :accessor min-size)))
(defmethod dump-constraint ((c cast-constraint))
(format t "~& cast ~s @ ~s:~% ~s~%-> ~s~%" c (name c)
(debug-type-names (in-type c))
(debug-type-names (out-type c))))
(defmethod dump-constraint ((c variable-arity-function-application))
(format t "~& variable arity ~s ~s/~s~%" c
(min-arity c) (max-arity c)))
(defmethod dump-constraint ((c function-application))
(format t "~& function application ~s ~s:~% ~s~%-> ~s~%" c (name c)
(debug-type-names (argument-types c))
(debug-type-names (return-type c))))
(defmethod dump-constraint ((c global-function-constraint))
(format t "~& g-f-c ~s ~s/~s:~% ~s~%" c (name c)
(name (global-function c))
(argument-types c)))
(defmethod dump-constraint ((c ctype/other-constraint))
(format t " ~s~% ~s~%"
(debug-type-names (ctype c))
(debug-type-names (other-type c))))
(defmethod dump-constraint ((c same-base-type-different-size-constraint))
(format t "~& same-base/diff-size ~s~% ~s -> ~s" c
(min-size c) (out-size c))
(call-next-method))
(defmethod dump-constraint ((c same-type-or-scalar-constraint))
(format t "~& same or scalar ~s~%" c)
(call-next-method))
(defmethod dump-constraint ((c scalar-type-of-constraint))
(format t "~& ->scalar ~s~%" c)
(call-next-method))
(defmethod dump-constraint ((c array-access-constraint))
(format t "~& array-access ~s [~s]~%" c (min-size c))
(call-next-method))
(defparameter *copy-constraints-hash* nil
"used to track already copied constraints when copying type inference data")
(defmacro defmethod2 (name (a b) &body body)
;; define methods on NAME with arguments A B and B A
`(progn
(defmethod ,name (,a ,b) ,@body)
(defmethod ,name (,b ,a) ,@body)))
;; unify types A, B, updating any constraints if needed, and return unified type
;; (should UNIFY handle any implicit cast stuff? assuming not for now,
;; possibly will want a separate 'concrete' type for casts though?
(defmethod unify (a b)
(unless (eq a b)
(error "can't unify ~s and ~s yet!" a b))
a)
(defmethod unify ((a any-type) (b any-type))
(unless (eq a b)
;; move all of B's constraints to A, and make B a ref to A
(loop for c being the hash-keys of (constraints b) using (hash-value v)
when v
;; don't need to flag constraints, since neither A or B
;; provide any new info
do (setf (gethash c (constraints a)) t))
(change-class b 'ref-type :equiv a))
a)
(defmethod unify ((a constrained-type) (b constrained-type))
;; merge sets of types
;; if only 1 type left
;; make A and B refs to a concrete type
;; flag all constraints
;; (for now assuming A and B had more than 1 valid type(
;; return concrete type
;; else
;; flag constraints if set of types changed
;; move constraints from B to A
;; make B a ref to A
;; return A
(let ((types (make-hash-table))
(last-type nil))
(maphash (lambda (k v) (when (and v (gethash k (types a)))
(setf last-type k)
(setf (gethash k types) t)))
(types b))
(case (hash-table-count types)
(0 (error "failed to unify types ~s, ~s" a b))
(1
;; LAST-TYPE = single type
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(loop for c being the hash-keys of (constraints b) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv last-type)
(change-class b 'ref-type :equiv last-type)
last-type)
(t
;; multiple types
(when (/= (hash-table-count types)
(hash-table-count (types a)))
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c)))
(setf (types a) types)
(loop with flag = (/= (hash-table-count types)
(hash-table-count (types b)))
for c being the hash-keys of (constraints b) using (hash-value v)
when v
do (when flag
(flag-modified-constraint c))
(setf (gethash c (constraints a)) t))
(change-class b 'ref-type :equiv a)
a))))
(defmethod2 unify ((a constrained-type) (b generic-type))
;; make sure B is in A's set of valid types
;; remove A,B from constraints, add B
;; flag constraint modified
;; return B
(error "constrained x generic not done yet"))
(defmethod2 unify ((a constrained-type) (b concrete-type))
;; if B is valid type for A, make A a ref to B, and flag constraints
;; (for now, assuming constrainted types have multiple types)
(assert (gethash b (types a)))
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv b)
b)
(defmethod2 unify ((a any-type) (b concrete-type))
;; same as constrained-type/concrete-type, except all types are valid
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv b)
b)
(defmethod2 unify ((a any-type) (b array-type))
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv b)
b)
(defmethod2 unify ((a array-type) (b array-initialization))
#++(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
#++(change-class a 'ref-type :equiv b)
;; just assume it is OK?
a)
(defmethod2 unify ((a any-type) (b struct-type))
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv b)
b)
(defmethod2 unify ((a constrained-type) (b any-type))
;; add B's constraints to A, flag them modified, make B a ref to A
(loop for c being the hash-keys of (constraints b) using (hash-value v)
when v
do (flag-modified-constraint c)
(setf (gethash c (constraints a)) t))
(change-class b 'ref-type :equiv a)
a)
(defmethod2 unify ((a constrained-type) (b null))
;; NIL is alias for :void concrete type
(let ((void (get-type-binding :void)))
(assert (or (gethash b (types a))
(gethash void (types a))))
(loop for c being the hash-keys of (constraints a) using (hash-value v)
when v
do (flag-modified-constraint c))
(change-class a 'ref-type :equiv void)
void))
(defmethod2 unify ((a ref-type) b)
(setf (equiv a) (unify (equiv a) b)))
#++
(defmethod unify :around (a b)
(let ((x (call-next-method)))
(format t "~s ~s ->~% ~s~%" (type-of a) (type-of b)
(typecase x
(concrete-type
(name x))
(constrained-type
(mapcar 'name (alexandria:hash-table-keys (types x))))
(t (type-of x))))
(when (and (typep x 'concrete-type)
(eql x (get-type-binding :dmat4)))
(break "dmat4?" a b x))
x))
(defclass infer-build-constraints (3bgl-glsl::glsl-walker)
())
(defun set-type (types &key constraint)
(etypecase types
(array-type
types)
(struct-type
types)
((eql t)
(make-instance 'any-type
:constraints (alexandria:plist-hash-table
(when constraint (list constraint t)))))
(symbol
(or (get-type-binding types)
(error "unknown type ~s?" types)))
(concrete-type
types)
(list
(let ((set (make-hash-table)))
(loop for i in types
when (symbolp i)
do (setf i (or (get-type-binding i)
(error "unknown type ~s?" types)))
do (setf (gethash i set) t))
(make-instance 'constrained-type
:types set :constraints (alexandria:plist-hash-table
(when constraint
(list constraint t))))))))
(defmethod copy-constraints :around (x)
;; we might have NIL as cached value, so check 2nd value of gethash
(multiple-value-bind (cached found)
(gethash (get-equiv-type x) *copy-constraints-hash*)
(if found
cached
(call-next-method))))
(defmethod copy-constraints ((constraint function-application))
(let ((copy (make-instance 'function-application
:name (name constraint)
:function-types (copy-list (function-types
constraint)))))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'argument-types)
(mapcar 'copy-constraints (argument-types constraint)))
(setf (slot-value copy 'return-type)
(copy-constraints (return-type constraint)))
copy))
(defmethod copy-constraints ((constraint variable-arity-function-application))
(let ((copy (make-instance 'variable-arity-function-application
:name (name constraint)
:function-types-by-arity
(map 'vector #'copy-list
(function-types-by-arity constraint)))))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'return-type)
(copy-constraints (return-type constraint)))
(setf (slot-value copy 'argument-types)
(mapcar 'copy-constraints (argument-types constraint)))
copy))
(defmethod copy-constraints ((constraint global-function-constraint))
(let ((copy (make-instance 'global-function-constraint
:name (name constraint)
:function (global-function constraint))))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'argument-types)
(mapcar 'copy-constraints (argument-types constraint)))
(setf (slot-value copy 'return-type)
(copy-constraints (return-type constraint)))
copy))
(defmethod copy-constraints ((constraint same-type-or-scalar-constraint))
(let ((copy (make-instance 'same-type-or-scalar-constraint)))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'ctype)
(copy-constraints (ctype constraint)))
(setf (slot-value copy 'other-type)
(copy-constraints (other-type constraint)))
copy))
(defmethod copy-constraints ((constraint scalar-type-of-constraint))
(let ((copy (make-instance 'scalar-type-of-constraint)))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'ctype)
(copy-constraints (ctype constraint)))
(setf (slot-value copy 'other-type)
(copy-constraints (other-type constraint)))
copy))
(defmethod copy-constraints ((constraint cast-constraint))
(let ((copy (make-instance 'cast-constraint
:name (name constraint)
:cast-type (cast-type constraint))))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'in-type)
(copy-constraints (in-type constraint)))
(setf (slot-value copy 'out-type)
(copy-constraints (out-type constraint)))
copy))
(defmethod copy-constraints ((constraint same-size-different-base-type-constraint))
(let ((copy (make-instance 'same-size-different-base-type-constraint)))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
;; not sure if we need to actually copy base type, it should be concrete?
;; (probably should enforce that before skipping copy though)
(setf (slot-value copy 'base-type)
(copy-constraints (base-type constraint)))
(setf (slot-value copy 'ctype)
(copy-constraints (ctype constraint)))
(setf (slot-value copy 'other-type)
(copy-constraints (other-type constraint)))
copy))
(defmethod copy-constraints ((constraint same-base-type-different-size-constraint))
(let ((copy (make-instance 'same-base-type-different-size-constraint)))
;; we need to update cache before copying constrained types because they
;; link back to constraint
(setf (gethash constraint *copy-constraints-hash*)
copy)
(setf (slot-value copy 'min-size) (min-size constraint))
(setf (slot-value copy 'out-size) (out-size constraint))
(setf (slot-value copy 'ctype)
(copy-constraints (ctype constraint)))
(setf (slot-value copy 'other-type)
(copy-constraints (other-type constraint)))
copy))
(defmethod copy-constraints ((type generic-type))
;; concrete types and aggregates don't need copied
(let ((e (or (get-equiv-type type) type)))
(setf (gethash type *copy-constraints-hash*) e
(gethash e *copy-constraints-hash*) e)))
(defmethod copy-constraints ((type null))
;; doesn't need copied
(setf (gethash type *copy-constraints-hash*) type))
(defmethod copy-constraints ((hash hash-table))
(let ((n (make-hash-table)))
(maphash (lambda (k v)
(when v
(setf (gethash (copy-constraints k) n) t)))
hash)
n))
(defmethod copy-constraints ((type ref-type))
(copy-constraints (get-equiv-type type)))
(defmethod copy-constraints ((type constrained-type))
(let* ((copy (make-instance 'constrained-type)))
;; we need to update cache before copying constraints because they
;; link back to type
(setf (gethash type *copy-constraints-hash*) copy)
(setf (slot-value copy 'constraints)
(copy-constraints (constraints type)))
(setf (slot-value copy 'types)
(copy-constraints (types type)))
copy))
(defun expand-optional-arg-type (o-a-t)
(if (typep o-a-t 'optional-arg-type)
(change-class o-a-t 'ref-type :equiv (arg-type o-a-t))
o-a-t))
(defmethod copy-constraints ((type optional-arg-type))
(let* ((copy (make-instance 'optional-arg-type)))
;; we need to update cache before copying constraints because they
;; link back to type
(setf (gethash type *copy-constraints-hash*) copy)
(setf (slot-value copy 'arg-type)
(copy-constraints (arg-type type)))
(setf (gethash type *copy-constraints-hash*)
(expand-optional-arg-type copy))))
(defmethod copy-constraints ((type any-type))
(let* ((copy (make-instance 'any-type)))
;; we need to update cache before copying constraints because they
;; link back to type
(setf (gethash type *copy-constraints-hash*) copy)
(setf (slot-value copy 'constraints)
(copy-constraints (constraints type)))
copy))
(defun copy-unify-constraints (type unify-type &key cast name)
(unless unify-type
(assert (typep type 'optional-arg-type))
(return-from copy-unify-constraints nil))
(let ((copy (copy-constraints type)))
(if cast
(let ((cast-constraint (make-instance 'cast-constraint
:name name
:in unify-type
:out copy
:cast-type cast)))
(assert unify-type)
(add-constraint copy cast-constraint)
(add-constraint unify-type cast-constraint)
(flag-modified-constraint cast-constraint)
copy)
(unify copy unify-type))))
(defmethod walk (form (walker infer-build-constraints))
(break "walk" form)
(call-next-method))
(defun cast-to-boolean (type)
;; no implicit casts to bool, so just force type to be bool...
(let ((bool (get-type-binding :bool)))
(etypecase type
(any-type
(flag-modified-type type)
(change-class type 'ref-type :equiv bool)
bool)
(constrained-type
(assert (gethash bool (types type)))
(unless (= 1 (hash-table-count (types type)))
(flag-modified-type type))
(change-class type 'ref-type :equiv bool)
bool)
(ref-type
(setf (equiv type) (cast-to-boolean (equiv type))))
(concrete-type
(assert (eq type bool))
type))))
(defmethod walk ((form if-form) (walker infer-build-constraints))
;; todo: unify test-form with types accepted by IF? (scalars? booleans?)
(cast-to-boolean (walk (test-form form) walker))
(if (and (then-form form) (else-form form))
(unify (walk (then-form form) walker)
(walk (else-form form) walker))
(if (then-form form)
(walk (then-form form) walker)
(walk (else-form form) walker))))
(defmethod walk ((form for-loop) (walker infer-build-constraints))
;; walk init/step forms, ignore ret?
;; walk condition-forms, casts to boolean(or scalar?)?
;; walk body (ignore ret?)
(loop for a in (init-forms form) do (walk a walker))
(loop for a in (step-forms form) do (walk a walker))
(loop for a in (condition-forms form)
for ret = (walk a walker)
finally (cast-to-boolean ret))
;; for now ignoring return type, since 'for' is a statement in glsl
(loop for a in (body form) do (walk a walker)))
(defmethod walk ((form swizzle-access) (walker infer-build-constraints))
(let* ((binding-type (get-equiv-type (walk (binding form) walker)))
(n (length (field form)))
;; fixme: don't hard code this?
(vector-types #(()
(:bool :int :uint :float :double)
(:bvec2 :ivec2 :uvec2 :vec2 :dvec2)
(:bvec3 :ivec3 :uvec3 :vec3 :dvec3)
(:bvec4 :ivec4 :uvec4 :vec4 :dvec4)))
(out-type (set-type (aref vector-types n)))
(valid-vector-types (loop for i from (max 2 (1+ (min-size form)))
below 5
append (aref vector-types i))))
;; not sure yet if this should be possible or not...wrap with
;; get-equiv-type if so
(assert (not (typep binding-type 'ref-type)))
(setf (value-type form)
(cond
;; check for known output type
((typep binding-type 'concrete-type)
(aref (scalar/vector-set binding-type) n))
((and (typep binding-type 'constrained-type)
(= 1 (hash-table-count (types binding-type))))
(error "shouldn't happen anymore?"))
((typep binding-type 'array-type)
(assert (typep (base-type binding-type)
'concrete-type))
(aref (scalar/vector-set (base-type binding-type)) n))
(t
(let ((c (make-instance 'same-base-type-different-size-constraint
:out-size n
:min-size (1+ (min-size form))
:ctype out-type
:other-type binding-type)))
(cond
((typep binding-type 'any-type)
(change-class binding-type 'constrained-type
:types (alexandria:alist-hash-table
(mapcar (lambda (a)
(cons (get-type-binding a) t))
valid-vector-types))))
((typep binding-type 'constrained-type)
(setf binding-type
(unify binding-type (set-type valid-vector-types)))))
(add-constraint binding-type c)
(add-constraint out-type c)
(flag-modified-constraint c)
out-type))))))
(defmethod walk ((form array-access) (walker infer-build-constraints))
(let ((binding-type (walk (binding form) walker)))
;; walk index calculation
(walk (index form) walker)
;; just returning array type for now...
;; fixme: add constraints on size
(typecase binding-type
(array-type
(base-type binding-type))
((or any-type constrained-type)
(let ((c (make-instance 'scalar-type-of-constraint
:ctype (make-instance 'any-type)
:other-type binding-type)))
(add-constraint binding-type c)
(add-constraint (ctype c) c)
(flag-modified-constraint c)
(ctype c)))
(t ;; not sure this should happen?
(value-type binding-type)))))
(defmethod walk ((form slot-access) (walker infer-build-constraints))
;; todo: for now requiring structs to have declared type, but eventually
;; should check type of binding, and add constraint that it be a struct
;; with specified field (which will require tracking known structs, etc)
(let ((struct-type (walk (binding form) walker)))
(when (typep struct-type 'constrained-type)
(setf struct-type (get-only-hash-key (types struct-type))))
;; fixme: should structs have a hash for O(1) access?
;; or should something earlier have already looked up the specific slot?
(loop for binding in (bindings struct-type)
when (or (eql (name binding) (field form))
;; todo: decide if (.foo struct) accessor should be
;; kept? if so, should it intern symbols instead
;; of doing string compare?
(equal (string (name binding)) (field form)))
do (return-from walk (value-type binding)))
(break "slot-access: slot ~s not found in struct ~s"
(field form) (name struct-type))))
(defmethod walk ((form function-call) (walker infer-build-constraints))
(let* ((called (called-function form))
(*copy-constraints-hash* (make-hash-table))
(call-site (when (typep called 'global-function)
(make-instance 'inference-call-site
:called-function called))))
(when (typep called 'unknown-function-binding)
(error "got call to unknown function ~s during type inference"
(name called)))
(unless (eq t (type-inference-state called))
(when *verbose*
(format t "got call to function ~s with incomplete or failed type inference ~s?" (name called) (type-inference-state called)))
(error 'incomplete-dependent))
;; make local copies of any types/constraints affected by function
;; args, and unify with actual arg types
;; (unify will add modified constraints to work list)
(assert (<= (length (arguments form))
(length (bindings called))))
;; store NIL in the cache for any unused args, so we don't try to copy them
;; while walking other args
(loop for binding in (nthcdr (length (arguments form)) (bindings called))
do (setf (gethash (value-type binding) *copy-constraints-hash*) nil))
;; walk remaining args and copy as usual
(let ((a (loop with args = (arguments form)
for arg = (pop args)
for binding in (bindings called)
collect (copy-unify-constraints
(value-type binding)
(if arg
(walk arg walker)
nil)
:cast (and arg (allow-casts binding))
:name (name binding)))))
(if call-site
(setf (gethash call-site *current-function-local-types*) a)
;; add calls to internal functions as well so we can
;; print them specially depending on types
;; (ex MOD -> mod() for floats, % for ints)
(setf (gethash form *current-function-local-types*) a)))
;; copy return type and any linked constraints
;; (may have already been copied if it depends on arguments)
(cond
((eq (called-function form)
(get-function-binding 'return
:env 3bgl-glsl::*glsl-base-environment*))
;; if we are calling RETURN, unify return type with function
;; return as well
(let* ((r (copy-constraints (value-type called))))
(if (boundp '*current-function-return-type*)
(setf *current-function-return-type*
;; don't need a cast, since input to RETURN already has one
(unify r *current-function-return-type*))
(setf *current-function-return-type* r))))
((eq (called-function form)
(get-function-binding 'discard
:env 3bgl-glsl::*glsl-base-environment*))
;; discard works like RETURN but always VOID type
;; return as well
(let* ((r (get-type-binding :void
:env 3bgl-glsl::*glsl-base-environment*)))
(if (boundp '*current-function-return-type*)
(setf *current-function-return-type*
(unify r *current-function-return-type*))
(setf *current-function-return-type* r))))
(t ;; normal function, just copy the return values as usual
(let ((vt (copy-constraints (value-type called))))
(if call-site
(push vt (gethash call-site *current-function-local-types*))
(push vt (gethash form *current-function-local-types*)))
vt)))))
(defmethod walk ((form variable-read) (walker infer-build-constraints))
(walk (binding form) walker))
(defmethod walk ((form variable-write) (walker infer-build-constraints))
(let* ((binding (walk (binding form) walker))
(value (walk (value form) walker))
;; todo: avoid creating cast constraint if we know both types?
(cast (make-instance 'cast-constraint
:name form
:in value
:out binding)))
(assert value)
(add-constraint binding cast)
(add-constraint value cast)
(flag-modified-constraint cast)
value))
(defmethod walk ((form local-variable) (walker infer-build-constraints))
(value-type form))
(defmethod walk ((form array-type) (walker infer-build-constraints))
form)
(defmethod walk ((form binding) (walker infer-build-constraints))
(walk (value-type form) walker))
(defmethod walk ((form interface-binding) (walker infer-build-constraints))
(let ((stage-binding (stage-binding form)))
(assert stage-binding)
(walk stage-binding walker)))
(defmethod walk ((form interface-stage-binding) (walker infer-build-constraints))
(walk (binding form) walker))
(defmethod walk ((form constant-binding) (walker infer-build-constraints))
(if (member (value-type form) '(t nil))
(walk (initial-value-form form) walker)
(value-type form)))
(defmethod walk ((form function-argument) (walker infer-build-constraints))
(value-type form))
(defmethod walk ((form integer) (walker infer-build-constraints))
(set-type (list :int)))
(defmethod walk ((form float) (walker infer-build-constraints))
(set-type :float))
(defmethod walk ((form explicit-progn) (walker infer-build-constraints))
(loop for a in (body form)
for ret = (walk a walker)
finally (return ret)))
(defmethod walk ((form implicit-progn) (walker infer-build-constraints))
(loop for a in (body form)
for ret = (walk a walker)
finally (return ret)))
(defmethod walk ((form binding-scope) (walker infer-build-constraints))
(loop for binding in (bindings form)
for declared-type = (set-type (declared-type binding))
for initial-value-type = (walk (initial-value-form binding) walker)
when initial-value-type
do (if (implicit-casts-to initial-value-type)
(let ((cast (make-instance 'cast-constraint
:name (name
(initial-value-form
binding))
:cast-type :implicit
:in initial-value-type
:out declared-type)))
(add-constraint declared-type cast)
(add-constraint initial-value-type cast)
(flag-modified-constraint cast)
(setf (value-type binding) declared-type))
(let ((u (unify declared-type initial-value-type)))
(setf (value-type binding) u)))
else do (setf (value-type binding) declared-type)
do (setf (gethash binding *current-function-local-types*)
(value-type binding)))
(loop for a in (body form)
for ret = (walk a walker)
finally (return ret)))
(defmethod walk ((form global-function) (walker infer-build-constraints))
(let* ((*current-function-return-type* (make-instance 'any-type))
(*current-function-stages* (list t)))
(loop for binding in (bindings form)
for declared-type = (declared-type binding)
;; fixme: is this still right/useful?
if (typep declared-type '(cons (eql T) (cons unsigned-byte)))
collect (setf (value-type binding)
(value-type (elt (bindings form)
(second declared-type))))
else collect (setf (value-type binding)
(set-type declared-type))
do (setf (gethash binding *current-function-local-types*)
(value-type binding)))
;; fixme: add a constraint (or just a type?) if return type isn't T
(when (and (declared-type form)
(not (eq (declared-type form) t)))
(when (or (not (value-type form))
(eq t (value-type form)))
(setf (value-type form) (declared-type form)))
(when (typep (value-type form) 'any-type)
(setf (value-type form) (unify (value-type form)
(declared-type form)))))
(loop for a in (body form)
do (walk a walker))
(if (and (value-type form)
(not (eq (value-type form) t)))
(setf (gethash :return *current-function-local-types*)
(unify (value-type form) *current-function-return-type*))
(setf (gethash :return *current-function-local-types*)
*current-function-return-type*
(value-type form)
*current-function-return-type*))))
(defmethod walk (form (walker infer-build-constraints))
(when *verbose* (format t "unhandled form ~s~%" form))
(when (next-method-p)
(call-next-method)))
(defmethod unifiable-types-p (x type)
(error "can't tell if ~s unifies with ~s?" x type))
(defmethod unifiable-types-p ((a null) (b null))
;; is this right?
t)