Loop optimization (invariant code motion) in Compiler Design - Mini Project: Build & Apply

Loop Optimization: Invariant Code Motion

📖 Scenario: You are learning how compilers improve program speed by moving calculations that do not change inside a loop to outside the loop. This is called invariant code motion.Imagine you have a loop that repeats some work many times. If part of the work always gives the same result, it is better to do it once before the loop instead of repeating it every time.

🎯 Goal: Build a simple example showing a loop with an invariant calculation inside it, then move that calculation outside the loop to optimize it.

📋 What You'll Learn

Create a loop that runs 5 times

Inside the loop, calculate a value that does not change each time

Create a variable to hold the invariant calculation outside the loop

Rewrite the loop to use the pre-calculated value instead of recalculating

💡 Why This Matters

🌍 Real World

Compilers use invariant code motion to make programs run faster by reducing unnecessary repeated calculations inside loops.

💼 Career

Understanding loop optimizations is important for compiler developers, performance engineers, and software developers aiming to write efficient code.

1

Create a loop with an invariant calculation inside

Write a loop that runs 5 times using for i in range(5):. Inside the loop, calculate value = 10 * 2 and then calculate result = value + i.

Compiler Design

# Write a for loop that runs 5 times
# Inside the loop calculate value = 10 * 2 and result = value + i
# Your code here

Hint

Use for i in range(5): to create the loop. Inside, assign value = 10 * 2 and then result = value + i.

2

Create a variable for the invariant calculation outside the loop

Before the loop, create a variable called value and set it to 10 * 2.

Compiler Design

# Create value = 10 * 2 before the loop
for i in range(5):
    value = 10 * 2
    result = value + i
# Your code here

Hint

Move the calculation value = 10 * 2 before the loop so it runs only once.

3

Remove the invariant calculation from inside the loop

Modify the loop to remove the line value = 10 * 2 so that only result = value + i remains inside the loop.

Compiler Design

value = 10 * 2
for i in range(5):
    # Remove the calculation of value inside the loop
    result = value + i
# Your code here

Hint

Delete the line value = 10 * 2 inside the loop so it uses the pre-calculated value.

4

Explain the benefit of moving the invariant code outside the loop

Add a comment before the loop explaining that moving value = 10 * 2 outside the loop saves repeated calculations and makes the loop faster.

Compiler Design

# Add a comment explaining why moving the calculation outside the loop is better
value = 10 * 2
for i in range(5):
    result = value + i
# Your code here

Hint

Write a comment starting with # Moving the calculation of value outside the loop explaining the optimization benefit.

Practice

1. What is the main goal of loop optimization (invariant code motion) in compiler design?

easy

A. To move calculations that do not change outside the loop to improve efficiency

B. To increase the number of loops in the program

C. To add more calculations inside the loop for accuracy

D. To remove all loops from the program

Solution

1. Step 1: Understand loop invariant code

   Loop invariant code means calculations inside a loop that produce the same result every time.

2. Step 2: Purpose of moving invariant code

   Moving such code outside the loop avoids repeating the same calculation, saving time.

3. Final Answer:

   To move calculations that do not change outside the loop to improve efficiency -> Option A

4. Quick Check:

   Invariant code motion = move unchanging code outside loop [OK]

Hint: Move unchanging calculations outside loops to speed up code [OK]

Common Mistakes:

• Thinking loop optimization adds more loops
• Believing invariant code should stay inside loops
• Confusing optimization with removing loops

2. Which of the following code snippets correctly applies invariant code motion?

easy

A. for i in range(n):
x = 5 * 3
print(i + x)

B. for i in range(n):
x = i * 3
print(x)

C. for i in range(n):
print(i + 5 * 3)

D. x = 5 * 3
for i in range(n):
print(i + x)

Solution

1. Step 1: Identify invariant calculation

   The calculation 5 * 3 does not depend on the loop variable i, so it is invariant.

2. Step 2: Check code placement

   x = 5 * 3 for i in range(n): print(i + x) moves 5 * 3 outside the loop, calculating it once before looping.

3. Final Answer:

   x = 5 * 3 for i in range(n): print(i + x) -> Option D

4. Quick Check:

   Invariant code outside loop = x = 5 * 3 for i in range(n): print(i + x) [OK]

Hint: Put constant calculations before the loop starts [OK]

Common Mistakes:

• Calculating invariant code inside the loop repeatedly
• Moving variable-dependent code outside the loop
• Ignoring the loop variable dependency

3. Consider the following code snippet:

sum = 0
for i in range(1, 5):
    x = 10 * 2
    sum += i + x
print(sum)

What will be the output after applying invariant code motion optimization?

medium

A. 50

B. 70

C. 90

D. 110

Solution

1. Step 1: Move invariant calculation outside loop

   Calculate x = 10 * 2 = 20 once before the loop.

2. Step 2: Calculate sum with optimized code

   sum = 0; loop i=1 to 4: sum += i + 20
   Sum = (1+20)+(2+20)+(3+20)+(4+20) = 21+22+23+24 = 90

3. Final Answer:

   90 -> Option C

4. Quick Check:

   Sum of (i+20) for i=1 to 4 = 90 [OK]

Hint: Calculate constants once, then sum loop values [OK]

Common Mistakes:

• Adding 10*2 inside loop each time
• Miscounting loop iterations
• Forgetting to add i in sum

4. Identify the error in the following code related to invariant code motion:

for i in range(3):
    y = i * 2
    x = 4 + 5
    print(x + y)

What is the problem if we move x = 4 + 5 inside the loop?

medium

A. Moving x inside loop causes repeated calculation, reducing efficiency

B. x depends on i, so moving it outside causes error

C. No problem, code is optimized correctly

D. x is undefined inside the loop

Solution

1. Step 1: Analyze variable dependency

   x = 4 + 5 is invariant; it does not depend on i.

2. Step 2: Effect of moving x inside loop

   Moving x inside loop causes repeated calculation each iteration, wasting resources.

3. Final Answer:

   Moving x inside loop causes repeated calculation, reducing efficiency -> Option A

4. Quick Check:

   Invariant code inside loop = inefficient [OK]

Hint: Keep invariant code outside loop to avoid repeats [OK]

Common Mistakes:

• Thinking invariant code depends on loop variable
• Believing repeated calculation improves speed
• Confusing variable scope with optimization

5. Given the nested loop below, which is the best way to apply invariant code motion to optimize it?

for i in range(3):
    for j in range(4):
        x = 2 * 3
        y = i + j
        print(x + y)

hard

A. Move both x and y outside all loops

B. Move x outside both loops, keep y inside inner loop

C. Keep both x and y inside inner loop

D. Move y outside inner loop, keep x inside inner loop

Solution

1. Step 1: Identify invariant expressions

   x = 2 * 3 is invariant (does not depend on i or j). y = i + j depends on both loop variables.

2. Step 2: Apply invariant code motion

   Move x outside both loops to calculate once. y must stay inside inner loop as it changes each iteration.

3. Final Answer:

   Move x outside both loops, keep y inside inner loop -> Option B

4. Quick Check:

   Invariant x outside loops, variable y inside loop [OK]

Hint: Only move calculations independent of all loops outside [OK]

Common Mistakes:

• Moving variable-dependent code outside loops
• Keeping invariant code inside loops unnecessarily
• Confusing which variables depend on loop indices