Avoid unneeded return keywords.

lib/cretonne/src/bitset.rs

@@ -31,7 +31,7 @@ impl<T> BitSet<T>
     pub fn contains(&self, num: u8) -> bool {
         assert!((num as usize) < Self::bits());
         assert!((num as usize) < Self::max_bits());
-        return self.0.into() & (1 << num) != 0;
+        self.0.into() & (1 << num) != 0
     }
 
 /// Return the smallest number contained in the bitset or None if empty

lib/frontend/src/ssa.rs

@@ -252,26 +252,25 @@ impl<Variable> SSABuilder<Variable>
             UseVarCases::SealedOnePredecessor(pred) => {
                 let (val, mids) = self.use_var(dfg, layout, jts, var, ty, pred);
                 self.def_var(var, val, block);
-                return (val, mids);
+                (val, mids)
             }
             // The block has multiple predecessors, we register the ebb argument as the current
             // definition for the variable.
             UseVarCases::Unsealed(val) => {
                 self.def_var(var, val, block);
-                return (val,
+                (val,
-                        SideEffects {
+                 SideEffects {
-                            split_ebbs_created: Vec::new(),
+                     split_ebbs_created: Vec::new(),
-                            instructions_added_to_ebbs: Vec::new(),
+                     instructions_added_to_ebbs: Vec::new(),
-                        });
+                 })
             }
             UseVarCases::SealedMultiplePredecessors(preds, val, ebb) => {
                 // If multiple predecessor we look up a use_var in each of them:
                 // if they all yield the same value no need for an Ebb argument
                 self.def_var(var, val, block);
-                return self.predecessors_lookup(dfg, layout, jts, val, var, ebb, &preds);
+                self.predecessors_lookup(dfg, layout, jts, val, var, ebb, &preds)
             }
-        };
+        }
-
     }
 
     /// Declares a new basic block belonging to the body of a certain `Ebb` and having `pred`