2 * Copyright (C) 2018-2019 Alyssa Rosenzweig <alyssa@rosenzweig.io>
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25 #include "util/u_memory.h"
27 /* Routines for liveness analysis. Liveness is tracked per byte per node. Per
28 * byte granularity is necessary for proper handling of int8 */
31 liveness_gen(uint16_t *live
, unsigned node
, unsigned max
, uint16_t mask
)
40 liveness_kill(uint16_t *live
, unsigned node
, unsigned max
, uint16_t mask
)
49 liveness_get(uint16_t *live
, unsigned node
, uint16_t max
) {
56 /* Updates live_in for a single instruction */
59 mir_liveness_ins_update(uint16_t *live
, midgard_instruction
*ins
, unsigned max
)
61 /* live_in[s] = GEN[s] + (live_out[s] - KILL[s]) */
63 liveness_kill(live
, ins
->dest
, max
, mir_bytemask(ins
));
65 mir_foreach_src(ins
, src
) {
66 unsigned node
= ins
->src
[src
];
67 unsigned bytemask
= mir_bytemask_of_read_components(ins
, node
);
69 liveness_gen(live
, node
, max
, bytemask
);
73 /* live_out[s] = sum { p in succ[s] } ( live_in[p] ) */
76 liveness_block_live_out(midgard_block
*blk
, unsigned temp_count
)
78 mir_foreach_successor(blk
, succ
) {
79 for (unsigned i
= 0; i
< temp_count
; ++i
)
80 blk
->live_out
[i
] |= succ
->live_in
[i
];
84 /* Liveness analysis is a backwards-may dataflow analysis pass. Within a block,
85 * we compute live_out from live_in. The intrablock pass is linear-time. It
86 * returns whether progress was made. */
89 liveness_block_update(midgard_block
*blk
, unsigned temp_count
)
91 bool progress
= false;
93 liveness_block_live_out(blk
, temp_count
);
95 uint16_t *live
= ralloc_array(blk
, uint16_t, temp_count
);
96 memcpy(live
, blk
->live_out
, temp_count
* sizeof(uint16_t));
98 mir_foreach_instr_in_block_rev(blk
, ins
)
99 mir_liveness_ins_update(live
, ins
, temp_count
);
101 /* To figure out progress, diff live_in */
103 for (unsigned i
= 0; (i
< temp_count
) && !progress
; ++i
)
104 progress
|= (blk
->live_in
[i
] != live
[i
]);
106 ralloc_free(blk
->live_in
);
112 /* Globally, liveness analysis uses a fixed-point algorithm based on a
113 * worklist. We initialize a work list with the exit block. We iterate the work
114 * list to compute live_in from live_out for each block on the work list,
115 * adding the predecessors of the block to the work list if we made progress.
119 mir_compute_liveness(compiler_context
*ctx
)
121 /* If we already have fresh liveness, nothing to do */
122 if (ctx
->metadata
& MIDGARD_METADATA_LIVENESS
)
125 mir_compute_temp_count(ctx
);
126 unsigned temp_count
= ctx
->temp_count
;
128 /* List of midgard_block */
129 struct set
*work_list
= _mesa_set_create(ctx
,
131 _mesa_key_pointer_equal
);
133 struct set
*visited
= _mesa_set_create(ctx
,
135 _mesa_key_pointer_equal
);
139 mir_foreach_block(ctx
, block
) {
140 block
->live_in
= rzalloc_array(NULL
, uint16_t, temp_count
);
141 block
->live_out
= rzalloc_array(NULL
, uint16_t, temp_count
);
144 /* Initialize the work list with the exit block */
145 struct set_entry
*cur
;
147 midgard_block
*exit
= mir_exit_block(ctx
);
148 cur
= _mesa_set_add(work_list
, exit
);
150 /* Iterate the work list */
153 /* Pop off a block */
154 midgard_block
*blk
= (struct midgard_block
*) cur
->key
;
155 _mesa_set_remove(work_list
, cur
);
157 /* Update its liveness information */
158 bool progress
= liveness_block_update(blk
, temp_count
);
160 /* If we made progress, we need to process the predecessors */
162 if (progress
|| !_mesa_set_search(visited
, blk
)) {
163 mir_foreach_predecessor(blk
, pred
)
164 _mesa_set_add(work_list
, pred
);
167 _mesa_set_add(visited
, blk
);
168 } while((cur
= _mesa_set_next_entry(work_list
, NULL
)) != NULL
);
170 _mesa_set_destroy(visited
, NULL
);
171 _mesa_set_destroy(work_list
, NULL
);
173 /* Liveness is now valid */
174 ctx
->metadata
|= MIDGARD_METADATA_LIVENESS
;
177 /* Once liveness data is no longer valid, call this */
180 mir_invalidate_liveness(compiler_context
*ctx
)
182 /* If we didn't already compute liveness, there's nothing to do */
183 if (!(ctx
->metadata
& MIDGARD_METADATA_LIVENESS
))
186 /* It's now invalid regardless */
187 ctx
->metadata
&= ~MIDGARD_METADATA_LIVENESS
;
189 mir_foreach_block(ctx
, block
) {
191 ralloc_free(block
->live_in
);
194 ralloc_free(block
->live_out
);
196 block
->live_in
= NULL
;
197 block
->live_out
= NULL
;
202 mir_is_live_after(compiler_context
*ctx
, midgard_block
*block
, midgard_instruction
*start
, int src
)
204 mir_compute_liveness(ctx
);
206 /* Check whether we're live in the successors */
208 if (liveness_get(block
->live_out
, src
, ctx
->temp_count
))
211 /* Check the rest of the block for liveness */
213 mir_foreach_instr_in_block_from(block
, ins
, mir_next_op(start
)) {
214 if (mir_has_arg(ins
, src
))