Document current relooper algorithm and do minor cleanup

c2rust-transpile/src/cfg/loops.rs

@@ -170,28 +170,29 @@ impl<Lbl: Hash + Eq + Clone> LoopInfo<Lbl> {
         self.loops.extend(other.loops);
     }
 
-    /// Find the smallest possible loop that contains all of the items
+    /// Finds the smallest possible loop that contains all of the entries.
     pub fn tightest_common_loop<E: Iterator<Item = Lbl>>(&self, mut entries: E) -> Option<LoopId> {
+        // Start with the loop containing the first entry.
         let first = entries.next()?;
-
         let mut loop_id = *self.node_loops.get(&first)?;
 
+        // Widen the loop until it contains the all of our entries, or it can no longer
+        // be widened.
         for entry in entries {
-            // Widen the loop until it contains the `entry`, or it can no longer be widened.
             loop {
-                match self.loops.get(&loop_id) {
-                    Some((ref in_loop, parent_id)) => {
-                        if in_loop.contains(&entry) {
-                            break;
-                        }
-                        loop_id = if let Some(i) = parent_id {
-                            *i
-                        } else {
-                            return None;
-                        };
-                    }
-
-                    None => return None,
+                let (in_loop, parent_id) = self.loops.get(&loop_id).unwrap_or_else(|| {
+                    panic!(
+                        "Found loop ID {:?} with no corresponding loop info",
+                        loop_id,
+                    )
+                });
+
+                // If our current loop contains the entry, move on to the next entry. Otherwise
+                // move on to the next wider loop if there is one.
+                if in_loop.contains(&entry) {
+                    break;
+                } else {
+                    loop_id = parent_id.clone()?;
                 }
             }
         }

c2rust-transpile/src/cfg/mod.rs

@@ -14,6 +14,7 @@
 //!   - simplify that sequence of `Structure<Stmt>`s into another such sequence
 //!   - convert the `Vec<Structure<Stmt>>` back into a `Vec<Stmt>`
 //!
+//! See the [`relooper`] module for more details about the Relooper algorithm.
 
 use crate::c_ast::iterators::{DFExpr, SomeId};
 use crate::c_ast::CLabelId;