#include <stdio.h> #define X (?) #define Y 23 int array1[X][Y]; int array2[X]; int test() { int sum= (?) ; int i=0; do { if( (?) ) continue; sum+= (?) ; }while(i<X && i<Y); return (?) ; } int main() { return 0; } 汇编代码如下: test: pushl %ebp movl %esp, %ebp subl $16, %esp movl $14, -8(%ebp) movl $0, -4(%ebp) .L5: movl -4(%ebp), %eax movl array2(,%eax,4), %ecx movl -4(%ebp), %edx movl %edx, %eax addl %eax, %eax addl %edx, %eax sall $5, %eax addl $array1, %eax movl (%eax), %eax imull %ecx, %eax cmpl $6, %eax jle .L2 movl -4(%ebp), %eax movl array2(,%eax,4), %ecx movl -4(%ebp), %edx movl %edx, %eax addl %eax, %eax addl %edx, %eax sall $5, %eax addl $array1, %eax movl (%eax), %eax movl %ecx, %edx subl %eax, %edx movl %edx, %eax cmpl $7, %eax jle .L6 .L2: movl -4(%ebp), %edx movl %edx, %eax addl %eax, %eax addl %edx, %eax sall $5, %eax addl $array1, %eax movl (%eax), %edx movl -4(%ebp), %eax movl array2(,%eax,4), %eax addl %edx, %eax addl -4(%ebp), %eax addl %eax, -8(%ebp) addl $1, -4(%ebp) jmp .L3 .L6: nop .L3: cmpl $18, -4(%ebp) jg .L4 cmpl $22, -4(%ebp) jle .L5 .L4: movl -8(%ebp), %eax subl $5, %eax imull -8(%ebp), %eax leave ret填空?的位置