blocks|key|1943721|text|“调用堆栈是由堆栈框架组成的……”--Wikipedia|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1943722|堆栈帧是您放在堆栈上的东西。它们是包含有关要调用的子例程的信息的数据结构。|1943723|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Call_stack#Structure^0|J|9|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

"A call stack is composed of stack frames..." — <a href="http://en.wikipedia.org/wiki/Call_stack#Structure" rel="noreferrer">Wikipedia</a>

A stack frame is a thing that you put on the stack. They are data structures that contain information about subroutines to call.

blocks|key|1730357|text|堆栈帧是推送到堆栈上的数据帧。在调用堆栈的情况下，堆栈帧将表示函数调用及其参数数据。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1730358|如果我没记错的话，函数的返回地址首先被压入堆栈，然后是参数和局部变量的空间。它们共同构成了“框架”，尽管这可能是依赖于架构的。处理器知道每个帧中有多少字节，并在帧被推送和弹出堆栈时相应地移动堆栈指针。|1730359|编辑：|1730360|高级调用堆栈和处理器的调用堆栈之间有很大的不同。|1730361|当我们谈论处理器的调用堆栈时，我们谈论的是在汇编或机器代码中处理字节/字级别的地址和值。在谈到高级语言时，有一些“调用堆栈”，但它们是由运行时环境管理的调试/运行时工具，因此您可以记录程序的错误(在较高级别)。在这个级别上，像行号、方法和类名之类的东西通常是已知的。当处理器获得代码时，它完全没有这些东西的概念。|1730362|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|N|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|O|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|P|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|K|$]]

A stack frame is a frame of data that gets pushed onto the stack. In the case of a call stack, a stack frame would represent a function call and its argument data. 

If I remember correctly, the function return address is pushed onto the stack first, then the arguments and space for local variables. Together, they make the "frame," although this is likely architecture-dependent. The processor knows how many bytes are in each frame and moves the stack pointer accordingly as frames are pushed and popped off the stack.

<h3>EDIT:</h3> 

There is a big difference between higher-level call stacks and the processor's call stack.

When we talk about a processor's call stack, we are talking about working with addresses and values at the byte/word level in assembly or machine code. There are "call stacks" when talking about higher-level languages, but they are a debugging/runtime tool managed by the runtime environment so that you can log what went wrong with your program (at a high level). At this level, things like line numbers and method and class names are often known. By the time the processor gets the code, it has absolutely no concept of these things.

blocks|key|1944047|text|一个简短的总结。也许有人有更好的解释。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1944048|调用堆栈由一个或多个多个堆栈帧组成。每个堆栈帧对应于对尚未以返回终止的函数或过程的调用。|1944049|要使用堆栈帧，线程需要保留两个指针，一个称为堆栈指针(SP)，另一个称为帧指针(FP)。SP始终指向堆栈的“顶部”，而FP始终指向帧的“顶部”。此外，线程还维护指向要执行的下一条指令的程序计数器(PC)。|1944050|以下内容存储在堆栈中:局部变量和临时变量，当前指令的实际参数(过程、函数等)。|1944051|关于堆栈的清理，有不同的调用约定。|1944052|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|N|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|O|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|P|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|K|$]]

A quick wrap up. Maybe someone has a better explanation.

A call stack is composed of 1 or many several stack frames. Each stack frame corresponds to a call to a function or procedure which has not yet terminated with a return. 

To use a stack frame, a thread keeps two pointers, one is called the Stack Pointer (SP), and the other is called the Frame Pointer (FP). SP always points to the "top" of the stack, and FP always points to the "top" of the frame. Additionally, the thread also maintains a program counter (PC) which points to the next instruction to be executed. 

The following are stored on the stack: local variables and temporaries, actual parameters of the current instruction (procedure, function, etc.)

There are different calling conventions regarding the cleaning of the stack.

blocks|key|1944257|text|堆栈帧是与函数调用相关的打包信息。这些信息通常包括传递给函数的参数、局部变量以及终止时返回的位置。激活记录是堆栈帧的另一个名称。堆栈帧的布局由制造商在ABI中确定，每个支持ISA的编译器都必须符合此标准，但是布局方案可以依赖于编译器。通常，堆栈帧大小不受限制，但有一个称为“红色/受保护区域”的概念，允许系统calls...etc在不干扰堆栈帧的情况下执行。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1944258|总是有一个SP，但在一些ABI(例如ARM和PowerPC)上，FP是可选的。需要放到堆栈上的参数只能使用SP进行偏移。是否为函数调用生成堆栈框架取决于参数的类型和数量、局部变量以及局部变量的一般访问方式。在大多数ISA上，首先使用寄存器，如果有比专用于传递参数的寄存器更多的参数，这些寄存器会被放到堆栈中(例如，x86+ABI有6个寄存器来传递整数参数)。因此，有时，一些函数不需要将堆栈帧放在堆栈上，只需要将返回地址推入堆栈。|1944259|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

Stack frame is the packed information related to a function call. This information generally includes arguments passed to th function, local variables and where to return upon terminating. Activation record is another name for a stack frame. The layout of the stack frame is determined in the ABI by the manufacturer and every compiler supporting the ISA must conform to this standard, however layout scheme can be compiler dependent. Generally stack frame size is not limited but there is a concept called "red/protected zone" to allow system calls...etc to execute without interfering with a stack frame. 

There is always a SP but on some ABIs (ARM's and PowerPC's for example) FP is optional. Arguments that needed to be placed onto the stack can be offsetted using the SP only. Whether a stack frame is generated for a function call or not depends on the type and number of arguments, local variables and how local variables are accessed generally. On most ISAs, first, registers are used and if there are more arguments than registers dedicated to pass arguments these are placed onto the stack (For example x86 ABI has 6 registers to pass integer arguments). Hence, sometimes, some functions do not need a stack frame to be placed on the stack, just the return address is pushed onto the stack.

It seems that I get the idea of call stack in programming language design. But I cannot find (probably, I just don't search hard enough) any decent explanation of what stack frame is.

So I would like to ask someone to explain it to me in a few words.

Explain the concept of a stack frame in a nutshell

数据结构

编译器

似乎我在编程语言设计中得到了调用堆栈的概念。但是我找不到(可能是我搜索得不够努力)任何关于堆栈帧是什么的合理解释。所以我想请人用几句话给我解释一下。

问简单地解释堆栈帧的概念
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问简单地解释堆栈帧的概念EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问简单地解释堆栈帧的概念
EN