1 | // -*- Mode: CFA -*- |
---|
2 | // |
---|
3 | // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo |
---|
4 | // |
---|
5 | // The contents of this file are covered under the licence agreement in the |
---|
6 | // file "LICENCE" distributed with Cforall. |
---|
7 | // |
---|
8 | // coroutine.c -- |
---|
9 | // |
---|
10 | // Author : Thierry Delisle |
---|
11 | // Created On : Mon Nov 28 12:27:26 2016 |
---|
12 | // Last Modified By : Thierry Delisle |
---|
13 | // Last Modified On : Mon Nov 28 12:27:26 2016 |
---|
14 | // Update Count : 0 |
---|
15 | // |
---|
16 | |
---|
17 | #include "coroutine" |
---|
18 | |
---|
19 | extern "C" { |
---|
20 | #include <stddef.h> |
---|
21 | #include <malloc.h> |
---|
22 | #include <errno.h> |
---|
23 | #include <string.h> |
---|
24 | #include <unistd.h> |
---|
25 | #include <sys/mman.h> |
---|
26 | } |
---|
27 | |
---|
28 | #include "kernel" |
---|
29 | #include "libhdr.h" |
---|
30 | |
---|
31 | #define __CFA_INVOKE_PRIVATE__ |
---|
32 | #include "invoke.h" |
---|
33 | |
---|
34 | extern volatile thread_local processor * this_processor; |
---|
35 | |
---|
36 | //----------------------------------------------------------------------------- |
---|
37 | // Global state variables |
---|
38 | |
---|
39 | // minimum feasible stack size in bytes |
---|
40 | #define MinStackSize 1000 |
---|
41 | static size_t pageSize = 0; // architecture pagesize HACK, should go in proper runtime singleton |
---|
42 | |
---|
43 | //----------------------------------------------------------------------------- |
---|
44 | // Coroutine ctors and dtors |
---|
45 | void ?{}(coStack_t& this) { |
---|
46 | this.size = 65000; // size of stack |
---|
47 | this.storage = NULL; // pointer to stack |
---|
48 | this.limit = NULL; // stack grows towards stack limit |
---|
49 | this.base = NULL; // base of stack |
---|
50 | this.context = NULL; // address of cfa_context_t |
---|
51 | this.top = NULL; // address of top of storage |
---|
52 | this.userStack = false; |
---|
53 | } |
---|
54 | |
---|
55 | void ?{}(coStack_t& this, size_t size) { |
---|
56 | this{}; |
---|
57 | this.size = size; |
---|
58 | |
---|
59 | create_stack(&this, this.size); |
---|
60 | } |
---|
61 | |
---|
62 | void ?{}(coroutine_desc& this) { |
---|
63 | this{ "Anonymous Coroutine" }; |
---|
64 | } |
---|
65 | |
---|
66 | void ?{}(coroutine_desc& this, const char * name) { |
---|
67 | this.name = name; |
---|
68 | this.errno_ = 0; |
---|
69 | this.state = Start; |
---|
70 | this.starter = NULL; |
---|
71 | this.last = NULL; |
---|
72 | } |
---|
73 | |
---|
74 | void ?{}(coroutine_desc& this, size_t size) { |
---|
75 | this{}; |
---|
76 | (this.stack){size}; |
---|
77 | } |
---|
78 | |
---|
79 | void ^?{}(coStack_t& this) { |
---|
80 | if ( ! this.userStack ) { |
---|
81 | LIB_DEBUG_DO( |
---|
82 | if ( mprotect( this.storage, pageSize, PROT_READ | PROT_WRITE ) == -1 ) { |
---|
83 | abortf( "(coStack_t *)%p.^?{}() : internal error, mprotect failure, error(%d) %s.", &this, errno, strerror( errno ) ); |
---|
84 | } |
---|
85 | ); |
---|
86 | free( this.storage ); |
---|
87 | } |
---|
88 | } |
---|
89 | |
---|
90 | void ^?{}(coroutine_desc& this) {} |
---|
91 | |
---|
92 | // Part of the Public API |
---|
93 | // Not inline since only ever called once per coroutine |
---|
94 | forall(dtype T | is_coroutine(T)) |
---|
95 | void prime(T& cor) { |
---|
96 | coroutine_desc* this = get_coroutine(cor); |
---|
97 | assert(this->state == Start); |
---|
98 | |
---|
99 | this->state = Primed; |
---|
100 | resume(cor); |
---|
101 | } |
---|
102 | |
---|
103 | // Wrapper for co |
---|
104 | void CoroutineCtxSwitch(coroutine_desc* src, coroutine_desc* dst) { |
---|
105 | // THREAD_GETMEM( This )->disableInterrupts(); |
---|
106 | |
---|
107 | // set state of current coroutine to inactive |
---|
108 | src->state = src->state == Halted ? Halted : Inactive; |
---|
109 | |
---|
110 | // set new coroutine that task is executing |
---|
111 | this_coroutine = dst; |
---|
112 | |
---|
113 | // context switch to specified coroutine |
---|
114 | assert( src->stack.context ); |
---|
115 | CtxSwitch( src->stack.context, dst->stack.context ); |
---|
116 | // when CtxSwitch returns we are back in the src coroutine |
---|
117 | |
---|
118 | // set state of new coroutine to active |
---|
119 | src->state = Active; |
---|
120 | |
---|
121 | // THREAD_GETMEM( This )->enableInterrupts(); |
---|
122 | } //ctxSwitchDirect |
---|
123 | |
---|
124 | void create_stack( coStack_t* this, unsigned int storageSize ) { |
---|
125 | //TEMP HACK do this on proper kernel startup |
---|
126 | if(pageSize == 0ul) pageSize = sysconf( _SC_PAGESIZE ); |
---|
127 | |
---|
128 | size_t cxtSize = libCeiling( sizeof(machine_context_t), 8 ); // minimum alignment |
---|
129 | |
---|
130 | if ( (intptr_t)this->storage == 0 ) { |
---|
131 | this->userStack = false; |
---|
132 | this->size = libCeiling( storageSize, 16 ); |
---|
133 | // use malloc/memalign because "new" raises an exception for out-of-memory |
---|
134 | |
---|
135 | // assume malloc has 8 byte alignment so add 8 to allow rounding up to 16 byte alignment |
---|
136 | LIB_DEBUG_DO( this->storage = memalign( pageSize, cxtSize + this->size + pageSize ) ); |
---|
137 | LIB_NO_DEBUG_DO( this->storage = malloc( cxtSize + this->size + 8 ) ); |
---|
138 | |
---|
139 | LIB_DEBUG_DO( |
---|
140 | if ( mprotect( this->storage, pageSize, PROT_NONE ) == -1 ) { |
---|
141 | abortf( "(uMachContext &)%p.createContext() : internal error, mprotect failure, error(%d) %s.", this, (int)errno, strerror( (int)errno ) ); |
---|
142 | } // if |
---|
143 | ); |
---|
144 | |
---|
145 | if ( (intptr_t)this->storage == 0 ) { |
---|
146 | abortf( "Attempt to allocate %d bytes of storage for coroutine or task execution-state but insufficient memory available.", this->size ); |
---|
147 | } // if |
---|
148 | |
---|
149 | LIB_DEBUG_DO( this->limit = (char *)this->storage + pageSize ); |
---|
150 | LIB_NO_DEBUG_DO( this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ) ); // minimum alignment |
---|
151 | |
---|
152 | } else { |
---|
153 | assertf( ((size_t)this->storage & (libAlign() - 1)) != 0ul, "Stack storage %p for task/coroutine must be aligned on %d byte boundary.", this->storage, (int)libAlign() ); |
---|
154 | this->userStack = true; |
---|
155 | this->size = storageSize - cxtSize; |
---|
156 | |
---|
157 | if ( this->size % 16 != 0u ) this->size -= 8; |
---|
158 | |
---|
159 | this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ); // minimum alignment |
---|
160 | } // if |
---|
161 | assertf( this->size >= MinStackSize, "Stack size %d provides less than minimum of %d bytes for a stack.", this->size, MinStackSize ); |
---|
162 | |
---|
163 | this->base = (char *)this->limit + this->size; |
---|
164 | this->context = this->base; |
---|
165 | this->top = (char *)this->context + cxtSize; |
---|
166 | } |
---|
167 | |
---|
168 | // We need to call suspend from invoke.c, so we expose this wrapper that |
---|
169 | // is not inline (We can't inline Cforall in C) |
---|
170 | extern "C" { |
---|
171 | void __suspend_internal(void) { |
---|
172 | suspend(); |
---|
173 | } |
---|
174 | } |
---|
175 | |
---|
176 | // Local Variables: // |
---|
177 | // mode: c // |
---|
178 | // tab-width: 4 // |
---|
179 | // End: // |
---|