Add effective peephole optimizer for uop traces.

Feature or enhancement

Currently we lack an effective peephole optimizer for uops traces.
We do some ad-hoc removal of LOAD/POP pairs, but many enhancements are missed.

For example, this silly program:

def add(a, b):
    return a + b

def loop(n=100_000):
    t = 0
    for _ in range(n):
        t += add(1,2)

if __name__ == "__main__":
    loop()

generates this trace:

which contains the sequence:

_LOAD_FAST_BORROW 0
_LOAD_FAST_BORROW_1
_LOAD_CONST_INLINE_BORROW K 
_RROT_3
_POP_TOP_NOP
_POP_TOP_NOP

which should be reduced to

_LOAD_CONST_INLINE_BORROW K 

Linked PRs

• gh-153035

首先定位 uop trace optimizer 和现有的临时 LOAD/POP 移除逻辑，然后重现提供的 add/loop trace。将当前序列与提议的缩减序列进行比较；当 optimizer 能够处理此案例，并且该变换有覆盖时，即表示完成。开始之前请先查看关联的 PR gh-153035，因为这项工作已经与它关联。