diff options
| author | Ilia Mirkin <[email protected]> | 2015-12-02 00:38:22 -0500 |
|---|---|---|
| committer | Ilia Mirkin <[email protected]> | 2015-12-02 18:51:15 -0500 |
| commit | 52b68375aeaa1ff6bca48eb833176d3498aa48f7 (patch) | |
| tree | 3516c8a4760c1bf2ea38566a91fab87ef954e41a /src | |
| parent | adcc547bfbef362067bb3b4e3aee75b287bc6189 (diff) | |
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 <[email protected]>
Diffstat (limited to 'src')
| -rw-r--r-- | src/gallium/drivers/nouveau/codegen/nv50_ir_ssa.cpp | 1 |
1 files changed, 1 insertions, 0 deletions
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(); |