Changeset 6a3d2e7 for src/libcfa/concurrency/threads.c
- Timestamp:
- Jan 17, 2017, 1:33:11 PM (7 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- 2fc88be
- Parents:
- aed3f54
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/libcfa/concurrency/threads.c
raed3f54 r6a3d2e7 1 // -*- Mode: CFA -*- 1 2 // 2 3 // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo … … 5 6 // file "LICENCE" distributed with Cforall. 6 7 // 7 // threads .c--8 // threads -- 8 9 // 9 10 // Author : Thierry Delisle 10 // Created On : Mon Nov 2812:27:26 201611 // Created On : Tue Jan 17 12:27:26 2016 11 12 // Last Modified By : Thierry Delisle 12 // Last Modified On : Mon Nov 28 12:27:26 201613 // Last Modified On : -- 13 14 // Update Count : 0 14 15 // 15 16 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 17 25 #include "threads"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 //Extra private desctructor for the main39 //FIXME the main should not actually allocate a stack40 //Since the main is never resumed the extra stack does not cause41 //any problem but it is wasted memory42 void ?{}(coStack_t* this, size_t size);43 void ?{}(coroutine* this, size_t size);44 45 //Main coroutine46 //FIXME do not construct a stack for the main47 coroutine main_coroutine = { 1000 };48 49 //Current coroutine50 //Will need to be in TLS when multi-threading is added51 coroutine* current_coroutine = &main_coroutine;52 53 //-----------------------------------------------------------------------------54 // Coroutine ctors and dtors55 void ?{}(coStack_t* this) {56 this->size = 10240; // size of stack57 this->storage = NULL; // pointer to stack58 this->limit = NULL; // stack grows towards stack limit59 this->base = NULL; // base of stack60 this->context = NULL; // address of cfa_context_t61 this->top = NULL; // address of top of storage62 this->userStack = false;63 }64 65 void ?{}(coStack_t* this, size_t size) {66 this{};67 this->size = size;68 69 create_stack(this, this->size);70 }71 72 void ?{}(coroutine* this) {73 this->name = "Anonymous Coroutine";74 this->errno_ = 0;75 this->state = Start;76 this->notHalted = true;77 this->starter = NULL;78 this->last = NULL;79 }80 81 void ?{}(coroutine* this, size_t size) {82 this{};83 (&this->stack){size};84 }85 86 void ^?{}(coStack_t* this) {87 if ( ! this->userStack ) {88 LIB_DEBUG_DO(89 if ( mprotect( this->storage, pageSize, PROT_READ | PROT_WRITE ) == -1 ) {90 abortf( "(coStack_t *)%p.^?{}() : internal error, mprotect failure, error(%d) %s.", this, errno, strerror( errno ) );91 }92 );93 free( this->storage );94 }95 }96 97 void ^?{}(coroutine* this) {}98 99 // Part of the Public API100 // Not inline since only ever called once per coroutine101 forall(dtype T | is_coroutine(T))102 void prime(T* cor) {103 coroutine* this = get_coroutine(cor);104 assert(this->state == Start);105 106 this->state = Primed;107 resume(cor);108 }109 110 // We need to call suspend from invoke.c, so we expose this wrapper that111 // is not inline (We can't inline Cforall in C)112 void suspend_no_inline(void) {113 suspend();114 }115 116 void corCxtSw(coroutine* src, coroutine* dst) {117 // THREAD_GETMEM( This )->disableInterrupts();118 119 // set state of current coroutine to inactive120 src->state = Inactive;121 122 // set new coroutine that task is executing123 current_coroutine = dst;124 125 // context switch to specified coroutine126 CtxSwitch( src->stack.context, dst->stack.context );127 // when CtxSwitch returns we are back in the src coroutine128 129 // set state of new coroutine to active130 src->state = Active;131 132 // THREAD_GETMEM( This )->enableInterrupts();133 } //ctxSwitchDirect134 135 void create_stack( coStack_t* this, unsigned int storageSize ) {136 //TEMP HACK do this on proper kernel startup137 if(pageSize == 0ul) pageSize = sysconf( _SC_PAGESIZE );138 139 size_t cxtSize = libCeiling( sizeof(machine_context_t), 8 ); // minimum alignment140 141 if ( (intptr_t)this->storage == 0 ) {142 this->userStack = false;143 this->size = libCeiling( storageSize, 16 );144 // use malloc/memalign because "new" raises an exception for out-of-memory145 146 // assume malloc has 8 byte alignment so add 8 to allow rounding up to 16 byte alignment147 LIB_DEBUG_DO( this->storage = memalign( pageSize, cxtSize + this->size + pageSize ) );148 LIB_NO_DEBUG_DO( this->storage = malloc( cxtSize + this->size + 8 ) );149 150 LIB_DEBUG_DO(151 if ( mprotect( this->storage, pageSize, PROT_NONE ) == -1 ) {152 abortf( "(uMachContext &)%p.createContext() : internal error, mprotect failure, error(%d) %s.", this, (int)errno, strerror( (int)errno ) );153 } // if154 );155 156 if ( (intptr_t)this->storage == 0 ) {157 abortf( "Attempt to allocate %d bytes of storage for coroutine or task execution-state but insufficient memory available.", this->size );158 } // if159 160 LIB_DEBUG_DO( this->limit = (char *)this->storage + pageSize );161 LIB_NO_DEBUG_DO( this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ) ); // minimum alignment162 163 } else {164 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() );165 this->userStack = true;166 this->size = storageSize - cxtSize;167 168 if ( this->size % 16 != 0u ) this->size -= 8;169 170 this->limit = (char *)libCeiling( (unsigned long)this->storage, 16 ); // minimum alignment171 } // if172 assertf( this->size >= MinStackSize, "Stack size %d provides less than minimum of %d bytes for a stack.", this->size, MinStackSize );173 174 this->base = (char *)this->limit + this->size;175 this->context = this->base;176 this->top = (char *)this->context + cxtSize;177 }178 18 179 19 // Local Variables: //
Note: See TracChangeset
for help on using the changeset viewer.