Remove some more cfg(test)s

src/librustc_data_structures/graph/dominators/mod.rs

@@ -127,11 +127,6 @@ impl<Node: Idx> Dominators<Node> {
         // FIXME -- could be optimized by using post-order-rank
         self.dominators(node).any(|n| n == dom)
     }
-
-    #[cfg(test)]
-    fn all_immediate_dominators(&self) -> &IndexVec<Node, Option<Node>> {
-        &self.immediate_dominators
-    }
 }
 
 pub struct Iter<'dom, Node: Idx> {

src/librustc_data_structures/graph/dominators/tests.rs

@@ -1,13 +1,13 @@
-use super::super::tests::TestGraph;
-
 use super::*;
 
+use super::super::tests::TestGraph;
+
 #[test]
 fn diamond() {
     let graph = TestGraph::new(0, &[(0, 1), (0, 2), (1, 3), (2, 3)]);
 
     let dominators = dominators(&graph);
-    let immediate_dominators = dominators.all_immediate_dominators();
+    let immediate_dominators = &dominators.immediate_dominators;
     assert_eq!(immediate_dominators[0], Some(0));
     assert_eq!(immediate_dominators[1], Some(0));
     assert_eq!(immediate_dominators[2], Some(0));
@@ -22,7 +22,7 @@ fn paper() {
                                  (2, 1)]);
 
     let dominators = dominators(&graph);
-    let immediate_dominators = dominators.all_immediate_dominators();
+    let immediate_dominators = &dominators.immediate_dominators;
     assert_eq!(immediate_dominators[0], None); // <-- note that 0 is not in graph
     assert_eq!(immediate_dominators[1], Some(6));
     assert_eq!(immediate_dominators[2], Some(6));

src/librustc_data_structures/obligation_forest/tests.rs

@@ -1,6 +1,4 @@
-#![cfg(test)]
-
-use super::{Error, DoCompleted, ObligationForest, ObligationProcessor, Outcome, ProcessResult};
+use super::*;
 
 use std::fmt;
 use std::marker::PhantomData;