source: src/libcfa/concurrency/coroutine.c@ 38d70ab

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 38d70ab was 6b0b624, checked in by Peter A. Buhr <pabuhr@…>, 8 years ago

change #ifndef to #pragma once

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