我已成功使用@Erki A 建议的方法并描述了here。
以下是该方法的简短摘要:
问题:
获取没有帧指针的调用堆栈。
解决方案主要思路:
从汇编代码中得出调试器从调试信息中理解的内容。
我们需要的信息:
1. 寄回地址存放于何处。
2. 堆栈指针递减多少。
要重现整个堆栈跟踪,需要:
1. Get the current $sp and $ra
2. Scan towards the beginning of the function and look for "addui
sp,sp,spofft" command (spofft<0)
3. Reprodece prev. $sp (sp- spofft)
4. Scan forward and look for "sw r31,raofft(sp)"
5. Prev. return address stored at [sp+ raofft]
上面我描述了一次迭代。当 $ra 为 0 时停止。
如何获得第一个 $ra?
__builtin_return_address(0)
如何获得第一个$sp?
register unsigned sp asm("29");
asm("" : "=r" (sp));
***由于我的大部分文件都是用 micro-mips 优化编译的,所以我不得不处理 micro-mips-ISA。
当我尝试分析使用 microMips 优化编译的代码时出现了很多问题(请记住,每一步的目标是重现 prev.ra 和 prev.sp):
这让事情变得更复杂了:
1. ra ($31) register contain unaligned return address.
You may find more information at Linked questions.
The unaligned ra helps you understand that you run over different
ISA(micro-mips-isa)
2. There are functions that do not move the sp. You can find more
information [here][3].
(If a "leaf" function only modifies the temporary registers and returns
to a return statement in its caller's code, then there is no need for
$ra to be changed, and there is no need for a stack frame for that
function.)
3. Functions that do not store the ra
4. MicroMips instructions can be both - 16bit and 32bit: run over the
commnds using unsinged short*.
5. There are functions that perform "addiu sp, sp, spofft" more than once
6. micro-mips-isa has couple variations for the same command
for example: addiu,addiusp.
我决定忽略部分问题,这就是为什么它适用于 95% 的情况。