## I noticed a particularly cute instruction choice in GCC’s
        ## output of a square-table-computing algorithm.
        .globl main
main:   call table
        xor %eax, %eax
        ret
table:  mov $-0x10000, %edx
        mov $0x100, %ecx
1:      call print_square
        lea -1(%edx, %ecx,2), %edx # cute instruction
        loopnz 1b
        ret
print_square:
        push %edx
        push %ecx
        neg %edx
        push %edx
        push %ecx
        push $format_string
        call printf
        pop %eax                # unused
        pop %ecx
        pop %edx
        pop %ecx
        pop %edx
        ret
.section .rodata
format_string:
        .asciz "%d² = %d\n"