1 ! Copyright (C) 2009 Slava Pestov.
2 ! See https://factorcode.org/license.txt for BSD license.
3 USING: accessors assocs combinators.short-circuit
4 compiler.cfg.predecessors compiler.cfg.rpo
5 compiler.cfg.utilities deques dlists functors kernel lexer
7 IN: compiler.cfg.dataflow-analysis
9 GENERIC: join-sets ( sets bb dfa -- set )
10 GENERIC: transfer-set ( in-set bb dfa -- out-set )
11 GENERIC: block-order ( cfg dfa -- bbs )
12 GENERIC: successors ( bb dfa -- seq )
13 GENERIC: predecessors ( bb dfa -- seq )
14 GENERIC: ignore-block? ( bb dfa -- ? )
18 MIXIN: dataflow-analysis
20 : <dfa-worklist> ( cfg dfa -- queue )
21 block-order <hashed-dlist> [ push-all-front ] keep ;
23 :: compute-in-set ( bb out-sets dfa -- set )
24 ! Only consider initialized sets.
25 bb dfa ignore-block? [ f ] [
27 [ out-sets key? ] filter
32 :: update-in-set ( bb in-sets out-sets dfa -- ? )
33 bb out-sets dfa compute-in-set
34 bb in-sets maybe-set-at ; inline
36 :: compute-out-set ( bb in-sets dfa -- set )
37 bb dfa ignore-block? [ f ] [ bb in-sets at bb dfa transfer-set ] if ;
39 :: update-out-set ( bb in-sets out-sets dfa -- ? )
40 bb in-sets dfa compute-out-set
41 bb out-sets maybe-set-at ; inline
43 : update-in/out-set ( bb in-sets out-sets dfa -- ? )
44 { [ update-in-set ] [ update-out-set ] } 4 n&& ;
46 :: dfa-step ( bb in-sets out-sets dfa -- bbs )
47 bb in-sets out-sets dfa update-in/out-set bb dfa successors { } ? ;
49 :: run-dataflow-analysis ( cfg dfa -- in-sets out-sets )
51 H{ } clone :> out-sets
52 cfg needs-predecessors
53 cfg dfa <dfa-worklist>
54 [ in-sets out-sets dfa dfa-step ] slurp/replenish-deque
58 M: dataflow-analysis join-sets 2drop assoc-intersect-all ;
59 M: dataflow-analysis ignore-block? drop kill-block?>> ;
61 <FUNCTOR: define-analysis ( name -- )
63 name DEFINES-CLASS ${name}
64 name-ins DEFINES ${name}-ins
65 name-outs DEFINES ${name}-outs
66 name-in DEFINES ${name}-in
67 name-out DEFINES ${name}-out
75 : name-in ( bb -- set ) name-ins get at ;
79 : name-out ( bb -- set ) name-outs get at ;
83 ! ! ! Forward dataflow analysis
85 MIXIN: forward-analysis
86 INSTANCE: forward-analysis dataflow-analysis
88 M: forward-analysis block-order drop reverse-post-order ;
89 M: forward-analysis successors drop successors>> ;
90 M: forward-analysis predecessors drop predecessors>> ;
92 <FUNCTOR: define-forward-analysis ( name -- )
95 name-ins IS ${name}-ins
96 name-outs IS ${name}-outs
97 compute-name-sets DEFINES compute-${name}-sets
101 INSTANCE: name forward-analysis
103 : compute-name-sets ( cfg -- )
104 name run-dataflow-analysis
105 [ name-ins set ] [ name-outs set ] bi* ;
109 ! ! ! Backward dataflow analysis
111 MIXIN: backward-analysis
112 INSTANCE: backward-analysis dataflow-analysis
114 M: backward-analysis block-order drop post-order ;
115 M: backward-analysis successors drop predecessors>> ;
116 M: backward-analysis predecessors drop successors>> ;
118 <FUNCTOR: define-backward-analysis ( name -- )
121 name-ins IS ${name}-ins
122 name-outs IS ${name}-outs
123 compute-name-sets DEFINES compute-${name}-sets
127 INSTANCE: name backward-analysis
129 : compute-name-sets ( cfg -- )
130 \ name run-dataflow-analysis
131 [ name-outs set ] [ name-ins set ] bi* ;
137 SYNTAX: FORWARD-ANALYSIS:
138 scan-token [ define-analysis ] [ define-forward-analysis ] bi ;
140 SYNTAX: BACKWARD-ANALYSIS:
141 scan-token [ define-analysis ] [ define-backward-analysis ] bi ;