refactor(tracker): move branch-selection bit skip from jet handler to assertion handler

Author: stringhandler

src/tracker.rs

@@ -185,11 +185,6 @@ impl<'a> DefaultTracker<'a> {
 
         let mut input_frame = input.clone();
 
-        // The reason we need to advance by a bit is that the AssertL combinator is actually a Case combinator,
-        // which takes a bit of input to decide which branch to take. But this bit is "meaningless" and
-        // is always 0 because it's an assertion.
-        let _ = input_frame.next();
-
         let args = match parse_jet_arguments(jet, &mut input_frame) {
             Ok(args) => args,
             Err(e) => {
@@ -219,13 +214,6 @@ impl<'a> DefaultTracker<'a> {
                 let target_ty = &node.arrow().target;
                 let jet_target_ty = resolve_jet_type(&target_type(jet));
 
-                // Skip the leading bit when the frame has extra padding.
-                // This occurs because some jets (like eq_64 etc.) are wrapped in AssertL (a Case combinator),
-                // see compile::with_debug_symbol
-                if target_ty.as_sum().is_some() {
-                    let _ = output_frame.next();
-                }
-
                 let output_value = SimValue::from_padded_bits(&mut output_frame, target_ty)
                     .expect("output from bit machine is always well-formed");
 
@@ -259,7 +247,10 @@ impl<'a> DefaultTracker<'a> {
 
         let mut input_frame = input.clone();
 
-        // Skip the Case combinator's branch selection bit (see handle_jet).
+        // Skip the Case combinator's branch selection bit
+        // The reason we need to advance by a bit is that the AssertL combinator is actually a Case combinator,
+        // which takes a bit of input to decide which branch to take. But this bit is "meaningless" and
+        // is always 0 because it's an assertion.
         let _ = input_frame.next();
 
         // The debug call has signature `dbg!(T) -> T`, so the target type