1 ! Copyright (C) 2008, 2010 Slava Pestov.
2 ! See https://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays assocs byte-arrays classes
4 classes.algebra classes.singleton classes.tuple
5 classes.tuple.private combinators combinators.short-circuit
6 compiler.tree.propagation.copy compiler.utilities kernel layouts math
7 math.intervals namespaces sequences sequences.private strings
9 IN: compiler.tree.propagation.info
11 : false-class? ( class -- ? ) \ f class<= ;
13 : true-class? ( class -- ? ) \ f class-not class<= ;
15 : null-class? ( class -- ? ) null class<= ;
17 GENERIC: eql? ( obj1 obj2 -- ? )
20 M: bignum eql? over bignum? [ = ] [ 2drop f ] if ;
21 M: ratio eql? over ratio? [ = ] [ 2drop f ] if ;
22 M: float eql? over float? [ [ double>bits ] same? ] [ 2drop f ] if ;
23 M: complex eql? over complex? [ = ] [ 2drop f ] if ;
25 TUPLE: value-info-state
32 CONSTANT: null-info T{ value-info-state f null empty-interval }
34 CONSTANT: object-info T{ value-info-state f object full-interval }
36 : interval>literal ( class interval -- literal literal? )
37 dup special-interval? [
41 { [ over interval-length 0 > ] [ 3drop f f ] }
42 { [ pick bignum class<= ] [ 2nip >bignum t ] }
43 { [ pick integer class<= ] [ 2nip >fixnum t ] }
44 { [ pick float class<= ] [ 2nip [ f f ] [ >float t ] if-zero ] }
49 : <value-info> ( -- info ) \ value-info-state new ; inline
53 : tuple-slot-infos ( tuple -- slots )
54 [ tuple-slots ] [ class-of all-slots ] bi
55 [ read-only>> [ <literal-info> ] [ drop f ] if ] 2map
58 UNION: fixed-length array byte-array string ;
60 : literal-class ( obj -- class )
61 dup singleton-class? [
67 : (slots-with-length) ( length class -- slots )
68 "slots" word-prop length 1 - f <array> swap prefix ;
70 : slots-with-length ( seq -- slots )
71 [ length <literal-info> ] [ class-of ] bi (slots-with-length) ;
73 : init-literal-info ( info -- info )
74 empty-interval >>interval
75 dup literal>> literal-class >>class
77 { [ dup real? ] [ [a,a] >>interval ] }
78 { [ dup tuple? ] [ tuple-slot-infos >>slots ] }
79 { [ dup fixed-length? ] [ slots-with-length >>slots ] }
83 : empty-set? ( info -- ? )
85 [ class>> null-class? ]
86 [ [ interval>> empty-interval? ] [ class>> real class<= ] bi and ]
89 ! Hardcoding classes is kind of a hack.
90 : min-value ( class -- n )
92 { fixnum [ most-negative-fixnum ] }
93 { array-capacity [ 0 ] }
94 { integer-array-capacity [ 0 ] }
98 : max-value ( class -- n )
100 { fixnum [ most-positive-fixnum ] }
101 { array-capacity [ max-array-capacity ] }
102 { integer-array-capacity [ max-array-capacity ] }
106 : class-interval ( class -- i )
108 { fixnum [ fixnum-interval ] }
109 { array-capacity [ array-capacity-interval ] }
110 { integer-array-capacity [ array-capacity-interval ] }
111 [ drop full-interval ]
114 : fix-capacity-class ( class -- class' )
116 { array-capacity fixnum }
117 { integer-array-capacity integer }
120 : wrap-interval ( interval class -- interval' )
121 class-interval 2dup interval-subset? [ drop ] [ nip ] if ;
123 : init-interval ( info -- info )
124 dup [ interval>> full-interval or ] [ class>> ] bi wrap-interval >>interval
125 dup class>> integer class<= [ [ integral-closure ] change-interval ] when ; inline
127 : init-value-info ( info -- info )
133 empty-interval >>interval
136 dup [ class>> ] [ interval>> ] bi interval>literal
137 [ >>literal ] [ >>literal? ] bi*
138 [ fix-capacity-class ] change-class
142 : <class/interval-info> ( class interval -- info )
146 init-value-info ; foldable
148 : <class-info> ( class -- info )
149 f <class/interval-info> ; foldable
151 : <interval-info> ( interval -- info )
155 init-value-info ; foldable
157 : <literal-info> ( literal -- info )
161 init-value-info ; foldable
163 : <sequence-info> ( length class -- info )
166 [ (slots-with-length) ] dip swap >>slots
169 : <tuple-info> ( slots class -- info )
175 : >literal< ( info -- literal literal? )
176 [ literal>> ] [ literal?>> ] bi ;
178 : intersect-literals ( info1 info2 -- literal literal? )
180 { [ dup literal?>> not ] [ drop >literal< ] }
181 { [ over literal?>> not ] [ nip >literal< ] }
182 { [ 2dup [ literal>> ] bi@ eql? not ] [ 2drop f f ] }
186 DEFER: value-info-intersect
188 DEFER: (value-info-intersect)
190 : intersect-slot ( info1 info2 -- info )
192 { [ dup not ] [ nip ] }
193 { [ over not ] [ drop ] }
194 [ (value-info-intersect) ]
197 : intersect-slots ( info1 info2 -- slots )
199 { [ dup not ] [ drop ] }
200 { [ over not ] [ nip ] }
202 2dup [ length ] same?
203 [ [ intersect-slot ] 2map ] [ 2drop f ] if
207 : (value-info-intersect) ( info1 info2 -- info )
208 [ <value-info> ] 2dip
210 [ [ class>> ] bi@ class-and >>class ]
211 [ [ interval>> ] bi@ interval-intersect >>interval ]
212 [ intersect-literals [ >>literal ] [ >>literal? ] bi* ]
213 [ intersect-slots >>slots ]
217 : value-info-intersect ( info1 info2 -- info )
219 { [ dup class>> null-class? ] [ nip ] }
220 { [ over class>> null-class? ] [ drop ] }
221 [ (value-info-intersect) ]
224 : union-literals ( info1 info2 -- literal literal? )
225 2dup [ literal?>> ] both? [
226 [ literal>> ] bi@ 2dup eql? [ drop t ] [ 2drop f f ] if
229 DEFER: value-info-union
231 DEFER: (value-info-union)
233 : union-slot ( info1 info2 -- info )
235 { [ dup not ] [ nip ] }
236 { [ over not ] [ drop ] }
237 [ (value-info-union) ]
240 : union-slots ( info1 info2 -- slots )
242 2dup [ length ] same?
243 [ [ union-slot ] 2map ] [ 2drop f ] if ;
245 : (value-info-union) ( info1 info2 -- info )
246 [ <value-info> ] 2dip
248 [ [ class>> ] bi@ class-or >>class ]
249 [ [ interval>> ] bi@ interval-union >>interval ]
250 [ union-literals [ >>literal ] [ >>literal? ] bi* ]
251 [ union-slots >>slots ]
255 : value-info-union ( info1 info2 -- info )
257 { [ dup class>> null-class? ] [ drop ] }
258 { [ over class>> null-class? ] [ nip ] }
259 [ (value-info-union) ]
262 : value-infos-union ( infos -- info )
264 [ [ ] [ value-info-union ] map-reduce ] if-empty ;
266 : literals<= ( info1 info2 -- ? )
268 { [ dup literal?>> not ] [ 2drop t ] }
269 { [ over literal?>> not ] [ drop class>> null-class? ] }
270 [ [ literal>> ] bi@ eql? ]
275 : slots<= ( info1 info2 -- ? )
276 2dup [ class>> ] bi@ class< [ 2drop t ] [
277 [ slots>> ] bi@ f pad-tail-shorter [ value-info<= ] 2all?
280 : value-info<= ( info1 info2 -- ? )
281 [ [ object-info ] unless* ] bi@
283 [ [ class>> ] bi@ class<= ]
284 [ [ interval>> ] bi@ interval-subset? ]
291 : value-info* ( value -- info ? )
292 resolve-copy value-infos get assoc-stack
293 [ null-info or ] [ >boolean ] bi ; inline
295 : value-info ( value -- info )
298 : set-value-info ( info value -- )
299 resolve-copy value-infos get last set-at ;
301 : refine-value-info ( info value -- )
302 resolve-copy value-infos get
303 [ assoc-stack [ value-info-intersect ] when* ] 2keep
306 : value-literal ( value -- obj ? )
307 value-info >literal< ;
309 : possible-boolean-values ( info -- values )
311 { [ dup null-class? ] [ { } ] }
312 { [ dup true-class? ] [ { t } ] }
313 { [ dup false-class? ] [ { f } ] }
317 : node-value-info ( node value -- info )
318 swap info>> at* [ drop null-info ] unless ;
320 : node-input-infos ( node -- seq )
321 dup in-d>> [ node-value-info ] with map ;
323 : node-output-infos ( node -- seq )
324 dup out-d>> [ node-value-info ] with map ;
326 : first-literal ( #call -- obj )
327 dup in-d>> first node-value-info literal>> ;
329 : last-literal ( #call -- obj )
330 dup out-d>> last node-value-info literal>> ;
332 : immutable-tuple-boa? ( #call -- ? )
333 dup word>> \ <tuple-boa> eq? [
334 dup in-d>> last node-value-info
335 literal>> first immutable-tuple-class?
338 : class-infos ( classes/f -- infos )
339 [ <class-info> ] map ;
341 : word>input-infos ( word -- input-infos/f )
342 "input-classes" word-prop class-infos ;