云风协程库保存和恢复协程运行栈原理讲解

版权声明：本文为博主原创文章，遵循 CC 4.0 by-sa 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/liushengxi_root/article/details/85114692

   首先， linux下的进程地址空间布局是这样子的：

可以看到 整个进程地址空间从上到下地址变化是从高地址到低地址的！ 32 位系统有 4G 的地址空间，其中0x08048000-> 0xbfffffff 是用户空间，0xc0000000~0xffffffff 是内核空间，包括内核代码和数据、与进程相关的数据结构（如页表、内核栈）等。其实就是大体上就是下面这样：

另外， %esp 执行栈顶，往低地址方向变化； brk/sbrk 函数控制堆顶往高地址方向变化。也就是说栈是向下生长的．（堆向上生长，这样可以充分利用空间）

知道了这些，我们就可以开心的来看代码了＾-＾

保存现场:

协程在从 RUNNING 到 SUSPEND 状态时需要保存运行栈，即调用 coroutine_yield 之后挂起协程，让出CPU的过程。

原理：就是将该协程运行时候的所有数据转而存储到每个协程所对应的结构中，为了在下次回到这个协程时能回到之前的执行点继续执行，那么你会想问，那这个协程运行的时候的栈在哪？我们来看代码：

C->ctx.uc_stack.ss_sp = S->stack; 
C->ctx.uc_stack.ss_size = STACK_SIZE; 
makecontext(&C->ctx, (void (*)(void)) mainfunc, 2, 
(uint32_t)ptr, (uint32_t)(ptr>>32)); 

   
   

   
   
1
2
3
4

这是协程初始化时进行的设置．我们可以看到schedule 的 stack[STACK_SIZE] 是子协程运行的公共栈空间！该协程栈的栈顶设置为 S->stack，mainfunc 的运行使用 S->stack 作为栈顶，大小为 STACK_SIZE．ｏｋ，一切搞定，那么转储的时候其实就是将这个栈中该协程所用到的数据copy到它对应的结构中就行了．

static void
_save_stack(struct coroutine *C, char *top)
{
	printf("top:%p \n", top);
<span class="token keyword">char</span> dummy <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span>
<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"dummy:%p \n"</span><span class="token punctuation">,</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token comment">// top-&amp;dummy 即该协程的运行时所占的空间大小</span>
<span class="token function">assert</span><span class="token punctuation">(</span>top <span class="token operator">-</span> <span class="token operator">&amp;</span>dummy <span class="token operator">&lt;=</span> STACK_SIZE<span class="token punctuation">)</span><span class="token punctuation">;</span>

<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"STACK_ZISE:%d \n"</span><span class="token punctuation">,</span> STACK_SIZE<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"top - &amp;dummy:%ld \n"</span><span class="token punctuation">,</span> top <span class="token operator">-</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token comment">//如果协程私有栈空间大小(C-&gt;cap)不够放下运行时的栈空间，则要重新扩容</span>
<span class="token keyword">if</span> <span class="token punctuation">(</span>C<span class="token operator">-&gt;</span>cap <span class="token operator">&lt;</span> top <span class="token operator">-</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	<span class="token function">free</span><span class="token punctuation">(</span>C<span class="token operator">-&gt;</span>stack<span class="token punctuation">)</span><span class="token punctuation">;</span>
	C<span class="token operator">-&gt;</span>cap <span class="token operator">=</span> top <span class="token operator">-</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">;</span>
	C<span class="token operator">-&gt;</span>stack <span class="token operator">=</span> <span class="token function">malloc</span><span class="token punctuation">(</span>C<span class="token operator">-&gt;</span>cap<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>
C<span class="token operator">-&gt;</span>size <span class="token operator">=</span> top <span class="token operator">-</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">;</span> <span class="token comment">/*c-&gt;stack 是在堆上的*/</span>
<span class="token function">memcpy</span><span class="token punctuation">(</span>C<span class="token operator">-&gt;</span>stack<span class="token punctuation">,</span> <span class="token operator">&amp;</span>dummy<span class="token punctuation">,</span> C<span class="token operator">-&gt;</span>size<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token comment">//将(dummy-&gt;top) 的数据copy到该协程对应的结构中就行了</span>

}

void coroutine_yield(struct schedule S)
{
int id = S->running;
assert(id >= 0);
struct coroutine C = S->co[id];
assert((char *)&C > S->stack);

<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"S-&gt;stack ==%p\n"</span><span class="token punctuation">,</span> S<span class="token operator">-&gt;</span>stack<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"S-&gt;stack+STACK_SIZE ==%p\n"</span><span class="token punctuation">,</span> S<span class="token operator">-&gt;</span>stack <span class="token operator">+</span> STACK_SIZE<span class="token punctuation">)</span><span class="token punctuation">;</span>

//为了在下次回到这个协程时能回到之前的执行点继续执行，必须要保存其执行的上下文

<span class="token function">_save_stack</span><span class="token punctuation">(</span>C<span class="token punctuation">,</span> S<span class="token operator">-&gt;</span>stack <span class="token operator">+</span> STACK_SIZE<span class="token punctuation">)</span><span class="token punctuation">;</span>

C<span class="token operator">-&gt;</span>status <span class="token operator">=</span> COROUTINE_SUSPEND<span class="token punctuation">;</span>
S<span class="token operator">-&gt;</span>running <span class="token operator">=</span> <span class="token operator">-</span><span class="token number">1</span><span class="token punctuation">;</span>
<span class="token function">swapcontext</span><span class="token punctuation">(</span><span class="token operator">&amp;</span>C<span class="token operator">-&gt;</span>ctx<span class="token punctuation">,</span> <span class="token operator">&amp;</span>S<span class="token operator">-&gt;</span>main<span class="token punctuation">)</span><span class="token punctuation">;</span>

}

• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16
• 17
• 18
• 19
• 20
• 21
• 22
• 23
• 24
• 25
• 26
• 27
• 28
• 29
• 30
• 31
• 32
• 33
• 34
• 35
• 36
• 37
• 38
• 39
• 40
• 41

关于_save_stack()函数，我画了这样的一幅图，相信你一看就能懂

程序执行结果：

1.　可以看到S->stack+STACK_SIZE地址值大于S->stack,所以他在高地址．
2.　dummy介于两者之间，> S->stack ,< S->stack+STACK_SIZE．因为我们没有用到什么数据，所以dummy的地址很靠近< S->stack+STACK_SIZE．
3.　证明上面画得图是正确的．

恢复现场:

协程从 SUSPEND 到 RUNNING 状态时，是要恢复当时的运行栈，回到执行点再执行的．

原理：将各自私有的C->stack 空间中的数据恢复到S->stack中

// C->size 表示协程似有栈的实际大小
memcpy(S->stack + STACK_SIZE - C->size, C->stack, C->size);

 
 

 
 
1
2

至此，该原理就讲解到这儿了，你理解了吗？？

                                </div>
            <link href="https://csdnimg.cn/release/phoenix/mdeditor/markdown_views-e44c3c0e64.css" rel="stylesheet">
                </div>