*
* This algorithm is very similar to the one outlined in "Efficiently
* Computing Static Single Assignment Form and the Control Dependence
- * Graph" by Cytron et. al. The primary difference is that we only put one
+ * Graph" by Cytron et al. The primary difference is that we only put one
* SSA def on the stack per block.
*/
static bool
return progress;
}
-void
+bool
nir_lower_vars_to_ssa(nir_shader *shader)
{
+ bool progress = false;
+
nir_foreach_function(function, shader) {
if (function->impl)
- nir_lower_vars_to_ssa_impl(function->impl);
+ progress |= nir_lower_vars_to_ssa_impl(function->impl);
}
+
+ return progress;
}