- File:
-
- 1 edited
-
src/libcfa/concurrency/coroutines.c (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
src/libcfa/concurrency/coroutines.c
reb2e723 raed3f54 1 //2 // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo3 //4 // The contents of this file are covered under the licence agreement in the5 // file "LICENCE" distributed with Cforall.6 //7 // coroutines.c --8 //9 // Author : Thierry Delisle10 // Created On : Mon Nov 28 12:27:26 201611 // Last Modified By : Thierry Delisle12 // Last Modified On : Mon Nov 28 12:27:26 201613 // Update Count : 014 //15 16 extern "C" {17 #include <stddef.h>18 #include <malloc.h>19 #include <errno.h>20 #include <string.h>21 #include <unistd.h>22 #include <sys/mman.h>23 }24 25 #include "coroutines"26 #include "libhdr.h"27 28 #define __CFA_INVOKE_PRIVATE__29 #include "invoke.h"30 31 //-----------------------------------------------------------------------------32 // Global state variables33 34 // minimum feasible stack size in bytes35 #define MinStackSize 100036 static size_t pageSize = 0; // architecture pagesize HACK, should go in proper runtime singleton37 38 //Current coroutine39 //Will need to be in TLS when multi-threading is added40 coroutine* current_coroutine;41 42 //-----------------------------------------------------------------------------43 // Coroutine ctors and dtors44 void ?{}(coStack_t* this) {45 this->size = 10240; // size of stack46 this->storage = NULL; // pointer to stack47 this->limit = NULL; // stack grows towards stack limit48 this->base = NULL; // base of stack49 this->context = NULL; // address of cfa_context_t50 this->top = NULL; // address of top of storage51 this->userStack = false;52 }53 54 void ?{}(coStack_t* this, size_t size) {55 this{};56 this->size = size;57 58 create_stack(this, this->size);59 }60 61 void ?{}(coroutine* this) {62 this->name = "Anonymous Coroutine";63 this->errno_ = 0;64 this->state = Start;65 this->notHalted = true;66 this->starter = NULL;67 this->last = NULL;68 }69 70 void ?{}(coroutine* this, size_t size) {71 this{};72 (&this->stack){size};73 }74 75 void ^?{}(coStack_t* this) {76 if ( ! this->userStack ) {77 LIB_DEBUG_DO(78 if ( mprotect( this->storage, pageSize, PROT_READ | PROT_WRITE ) == -1 ) {79 abortf( "(coStack_t *)%p.^?{}() : internal error, mprotect failure, error(%d) %s.", this, errno, strerror( errno ) );80 }81 );82 free( this->storage );83 }84 }85 86 void ^?{}(coroutine* this) {}87 88 // Part of the Public API89 // Not inline since only ever called once per coroutine90 forall(dtype T | is_coroutine(T))91 void prime(T* cor) {92 coroutine* this = get_coroutine(cor);93 assert(this->state == Start);94 95 this->state = Primed;96 resume(cor);97 }98 99 // We need to call suspend from invoke.c, so we expose this wrapper that100 // is not inline (We can't inline Cforall in C)101 void suspend_no_inline(void) {102 LIB_DEBUG_PRINTF("Suspending back : to %p from %p\n", this_coroutine(), this_coroutine() ? this_coroutine()->last : (void*)-1);103 104 suspend();105 }106 107 void corCxtSw(coroutine* src, coroutine* dst) {108 // THREAD_GETMEM( This )->disableInterrupts();109 110 // set state of current coroutine to inactive111 src->state = Inactive;112 113 // set new coroutine that task is executing114 current_coroutine = dst;115 116 // context switch to specified coroutine117 CtxSwitch( src->stack.context, dst->stack.context );118 // when CtxSwitch returns we are back in the src coroutine119 120 // set state of new coroutine to active121 src->state = Active;122 123 // THREAD_GETMEM( This )->enableInterrupts();124 } //ctxSwitchDirect125 126 void create_stack( coStack_t* this, unsigned int storageSize ) {127 //TEMP HACK do this on proper kernel startup128 if(pageSize == 0ul) pageSize = sysconf( _SC_PAGESIZE );129 130 size_t cxtSize = libCeiling( sizeof(machine_context_t), 8 ); // minimum alignment131 132 if ( (intptr_t)this->storage == 0 ) {133 this->userStack = false;134 this->size = libCeiling( storageSize, 16 );135 // use malloc/memalign because "new" raises an exception for out-of-memory136 137 // assume malloc has 8 byte alignment so add 8 to allow rounding up to 16 byte alignment138 LIB_DEBUG_DO( this->storage = memalign( pageSize, cxtSize + this->size + pageSize ) );139 LIB_NO_DEBUG_DO( this->storage = malloc( cxtSize + this->size + 8 ) );140 141 LIB_DEBUG_DO(142 if ( mprotect( this->storage, pageSize, PROT_NONE ) == -1 ) {143 abortf( "(uMachContext &)%p.createContext() : internal error, mprotect failure, error(%d) %s.", this, (int)errno, strerror( (int)errno ) );144 } // if145 );146 147 if ( (intptr_t)this->storage == 0 ) {148 abortf( "Attempt to allocate %d bytes of storage for coroutine or task execution-state but insufficient memory available.", this->size );149 } // if150 151 LIB_DEBUG_DO( this->limit = (char *)this->storage + pageSize );152 LIB_NO_DEBUG_DO( this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ) ); // minimum alignment153 154 } else {155 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() );156 this->userStack = true;157 this->size = storageSize - cxtSize;158 159 if ( this->size % 16 != 0u ) this->size -= 8;160 161 this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ); // minimum alignment162 } // if163 assertf( this->size >= MinStackSize, "Stack size %d provides less than minimum of %d bytes for a stack.", this->size, MinStackSize );164 165 this->base = (char *)this->limit + this->size;166 this->context = this->base;167 this->top = (char *)this->context + cxtSize;168 }169 170 // Local Variables: //171 // mode: c //172 // tab-width: 4 //173 // End: //
Note:
See TracChangeset
for help on using the changeset viewer.
