better naming

crates/red_knot_python_semantic/src/semantic_index/use_def/bitset.rs

@@ -139,14 +139,14 @@ impl<const B: usize> Iterator for BitSetIterator<'_, B> {
                     *cur_block_index += 1;
                     *cur_block = blocks[*cur_block_index];
                 }
-                let value = cur_block.trailing_zeros();
-                // reset the lowest set bit
+                let lowest_bit_set = cur_block.trailing_zeros();
+                // reset the lowest set bit, without a data dependency on `lowest_bit_set`
                 *cur_block &= cur_block.wrapping_sub(1);
-                // SAFETY: `value` cannot be more than 64, `cur_block_index` cannot be more than
-                // `B - 1`, and we check above that `B * 64 < u32::MAX`. So both `64 *
+                // SAFETY: `lowest_bit_set` cannot be more than 64, `cur_block_index` cannot be
+                // more than `B - 1`, and we check above that `B * 64 < u32::MAX`. So both `64 *
                 // cur_block_index` and the final value here must fit in u32.
                 #[allow(clippy::cast_possible_truncation)]
-                Some(value + (64 * *cur_block_index) as u32)
+                Some(lowest_bit_set + (64 * *cur_block_index) as u32)
             }
             Self::Heap(set_iter) => set_iter.next().copied(),
         }