From: Ilia Mirkin <imirkin@alum.mit.edu>
Date: Wed, 2 Dec 2015 05:38:22 +0000 (-0500)
Subject: nv50/ir: make sure entire graph is reachable
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=52b68375aeaa1ff6bca48eb833176d3498aa48f7;p=mesa.git

nv50/ir: make sure entire graph is reachable

The algorithm expects the entire CFG to be reachable, so make sure that
we hit every node. Otherwise we will end up with uninitialized data,
memory corruption, etc.

Signed-off-by: Ilia Mirkin <imirkin@alum.mit.edu>
---

diff --git a/src/gallium/drivers/nouveau/codegen/nv50_ir_ssa.cpp b/src/gallium/drivers/nouveau/codegen/nv50_ir_ssa.cpp
index 2e432349f24..9ea1065b806 100644
--- a/src/gallium/drivers/nouveau/codegen/nv50_ir_ssa.cpp
+++ b/src/gallium/drivers/nouveau/codegen/nv50_ir_ssa.cpp
@@ -87,6 +87,7 @@ DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
       LABEL(i) = i;
       SEMI(i) = ANCESTOR(i) = -1;
    }
+   assert(i == count);
 
    build();