refactor(rlix-validation): drop unreachable per-engine contiguity loop in C6-mapping

[TianyeGGBond]

Context

In assert_rlix_topology, the C6-mapping check enforces that the inference device mapping is a sorted, contiguous, zero-based list, and that each engine occupies a contiguous GPU range:

infer_device_mapping = sorted(infer)
if infer_device_mapping != list(range(len(infer_device_mapping))):
    raise RuntimeError(...)                       # (1) must be exactly [0, 1, ..., n-1]
for engine_index, start in enumerate(range(0, len(infer_device_mapping), per_engine)):
    group = infer_device_mapping[start : start + per_engine]
    expected = list(range(group[0], group[0] + per_engine))
    if group != expected:                          # (2) each engine's slice must be contiguous
        raise RuntimeError(...)

Problem

Check (2) is dead code. Once check (1) passes, infer_device_mapping is exactly [0, 1, ..., n-1]. Slicing a fully-contiguous zero-based list into per_engine-sized chunks always yields contiguous ranges, so group == expected is guaranteed and the loop's raise can never fire.

Change

Remove the loop. Check (1) alone fully enforces the C6-mapping invariant. No behavioral change — the removed branch was unreachable.

🤖 Generated with Claude Code