递归调用的栈变化及函数调用示意_简述程序功能,并画出unk(1348)递归调用中栈的变化过程-优快云博客

本文通过示例代码解析了递归调用的过程，详细描述了函数调用时栈的变化，从main函数开始，经过e函数的多次递归调用，最终返回并打印输出。递归调用中涉及了条件判断、参数传递和栈帧的压栈与弹栈操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h> void main() { int a = 2; void e(int n); e(a); } void e(int n) { if (n > 0) { e(--n); printf("*%d*/n* ", n); e(n); printf("%d good!/n",n); } } | | main | | |_______________________| | | | pushl a = 2 |_______________________| | | call e | pushl IP | |_______________________| | | | pushl %ebp | |_______________________| | | a > 0 exec if| pushl a = 1 |_______________________| | | call e sec | pushl IP | |_______________________| | | | pushl %ebp | |_______________________| | | a > 0 exec if| pushl a = 0 |_______________________| | | call e third | pushl IP | |_______________________| | | | pushl %ebp | |_______________________| | | a == 0 return| pushl a = 0 |_______________________| | | | pushl $"*d*/n*" |_______________________| |show *0* | call printf | * | |______on screen________| | | | pushl a = 0 |_______________________| | | call e fourth| pushl IP | |_______________________| | | | pushl %ebp | |_______________________| | | a == 0 return| pushl a = 0 |_______________________| | | call printf | pushl |_______________________| |show | | 0 good* | |_______on screen_______| | | main |__________________| | | int a = 2 |__________________|/ | | e(2); |__________________| | | return void | |__________________| | | |__________________| | | |__________________| | | |__________________| | | |__________________| | | |__________________| | | |__________________| | | |__________________| | | |__________________| | | | | | | | $"%d good/n"| | | | | | | | | | | | | | | / |____________________| / |_______________| |___________________| | / | | / | | | | | / | if(2 > 0) | / | if(1 > 0) | | | |____________________|/ |_______________| |___________________| | | | | | | | | | e(1); | | e(0); |------->| return void | |____________________| |_______________| |___________________| |/ | |/ | | | | |printf("xxx"); | / |printf("xxx"); | | | |____________________| / |_______________| |___________________| | / | | / | | | | | | | / | e(0); |------->| return void | |____________________| / |_______________| |___________________| | / | | / | | | | | | | /|printf("yyy"); | | | |____________________| |_______________| |___________________| | | | | | | | | / | | | | | | |____________________| / |_______________| |___________________| | | | / | | | | | | | / | if(1>0) | | | / |____________________| / |_______________| |___________________| | | | / | | | | | | | / | e(0); |------->| return void | |____________________|/ |_______________| |___________________| | / | | | | | | | | e(1); | |printf("xxx"); | | | |____________________| |_______________| |___________________| | | |/ | | | | | |printf("yyy"); | / | e(0); |------->| return void | /|____________________| / |_______________| |___________________| | | | / | | | | | | | / |printf("yyy"); | | | |____________________| / |_______________| |___________________|