Mar 9, 2024 · Feb 28, 2024 · Feb 28, 2024 · Mar 1, 2024 · Mar 1, 2024 · Mar 1, 2024
diff --git a/mypyc/test-data/opt-copy-propagation.test b/mypyc/test-data/opt-copy-propagation.test
 L0:
    return x

 [case testCopyPropagationChain]
 def f(x: int) -> int:
    y = x
    z = y
    return z
 [out]
 def f(x):
    x :: int
 L0:
    return x

 [case testCopyPropagationTooComplex]
 def f(b: bool, x: int) -> int:
    if b:
diff --git a/mypyc/transform/copy_propagation.py b/mypyc/transform/copy_propagation.py

 def do_copy_propagation(fn: FuncIR, options: CompilerOptions) -> None:
    """Perform copy propagation optimization for fn."""

    # Anything with an assignment count >1 will not be optimized
    # here, as it would be require data flow analysis and we want to
    # keep this simple & fast, at least until we've made data flow
    # analysis much faster.
    counts = {}
    replacements: dict[Value, Value] = {}
    for arg in fn.arg_regs:
                elif c == 1:
                    del replacements[op.dest]
            elif isinstance(op, AssignMulti):
                # Copy propagation not supported
                # Copy propagation not supported for AssignMulti destinations
                counts[op.dest] = 2
                replacements.pop(op.dest, 0)

    # Follow chains of propagation with multiple assignments.
    for src, dst in list(replacements.items()):
        while dst in replacements:
            dst = replacements[dst]
        replacements[src] = dst

    b = LowLevelIRBuilder(None, options)
    t = CopyPropagationTransform(b, replacements)
    t.transform_blocks(fn.blocks)
Original file line number	Diff line number	Diff line change
Expand Up		@@ -11,6 +11,17 @@ def f(x):
		L0:
		return x

		[case testCopyPropagationChain]
		def f(x: int) -> int:
		y = x
		z = y
		return z
		[out]
		def f(x):
		x :: int
		L0:
		return x

		[case testCopyPropagationTooComplex]
		def f(b: bool, x: int) -> int:
		if b:
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -23,6 +23,11 @@

		def do_copy_propagation(fn: FuncIR, options: CompilerOptions) -> None:
		"""Perform copy propagation optimization for fn."""

		# Anything with an assignment count >1 will not be optimized
		# here, as it would be require data flow analysis and we want to
		# keep this simple & fast, at least until we've made data flow
		# analysis much faster.
		counts = {}
		replacements: dict[Value, Value] = {}
		for arg in fn.arg_regs:
Expand All		@@ -39,10 +44,16 @@ def do_copy_propagation(fn: FuncIR, options: CompilerOptions) -> None:
		elif c == 1:
		del replacements[op.dest]
		elif isinstance(op, AssignMulti):
		# Copy propagation not supported
		# Copy propagation not supported for AssignMulti destinations
		counts[op.dest] = 2
		replacements.pop(op.dest, 0)

		# Follow chains of propagation with multiple assignments.
		for src, dst in list(replacements.items()):
		while dst in replacements:
		dst = replacements[dst]
		replacements[src] = dst

		b = LowLevelIRBuilder(None, options)
		t = CopyPropagationTransform(b, replacements)
		t.transform_blocks(fn.blocks)
Expand Down