Conor McCarthy (@cmccarthy) commented about libs/vkd3d-shader/ir.c:
+}
+/* Topologically sort the blocks according to the forward edges. By
- definition if the input CFG is reducible then its forward edges
- form a DAG, so a topological sorting exists. In order to compute it
- we keep an array with the incoming degree for each block and an
- available list of all the blocks whose incoming degree has reached
- zero. At each step we pick a block from the available list and
- strip it away from the graph, updating the incoming degrees and
- available list. We prefer picking the most recently added block
- (i.e., from the end of the available list) because it will keep
- together related blocks in the order, which allow us to generate
- fewer control flow primitives. */
+static enum vkd3d_result vsir_cfg_sort_nodes(struct vsir_cfg *cfg) +{
- enum vkd3d_result ret;
Needs to be on the line above `i` for correct formatting.