Changes in libcfa/src/concurrency/coroutine.cfa [c18bf9e:708ae38]

File:

• libcfa/src/concurrency/coroutine.cfa (modified) (10 diffs)

libcfa/src/concurrency/coroutine.cfa

@@ -48 +48 @@
 //-----------------------------------------------------------------------------
 forall(T &)
-void copy(CoroutineCancelled(T) * dst, CoroutineCancelled(T) * src) libcfa_public {
+void copy(CoroutineCancelled(T) * dst, CoroutineCancelled(T) * src) {
         dst->virtual_table = src->virtual_table;
         dst->the_coroutine = src->the_coroutine;
@@ -55 +55 @@
 
 forall(T &)
-const char * msg(CoroutineCancelled(T) *) libcfa_public {
+const char * msg(CoroutineCancelled(T) *) {
         return "CoroutineCancelled(...)";
 }
@@ -62 +62 @@
 forall(T & | is_coroutine(T))
 void __cfaehm_cancelled_coroutine(
-                T & cor, coroutine$ * desc, EHM_DEFAULT_VTABLE(CoroutineCancelled, (T)) ) libcfa_public {
+                T & cor, coroutine$ * desc, EHM_DEFAULT_VTABLE(CoroutineCancelled, (T)) ) {
         verify( desc->cancellation );
         desc->state = Cancelled;
@@ -89 +89 @@
 
 void __stack_prepare( __stack_info_t * this, size_t create_size );
-static void __stack_clean  ( __stack_info_t * this );
+void __stack_clean  ( __stack_info_t * this );
 
 //-----------------------------------------------------------------------------
@@ -114 +114 @@
 }
 
-void ?{}( coroutine$ & this, const char name[], void * storage, size_t storageSize ) libcfa_public with( this ) {
+void ?{}( coroutine$ & this, const char name[], void * storage, size_t storageSize ) with( this ) {
         (this.context){0p, 0p};
         (this.stack){storage, storageSize};
@@ -124 +124 @@
 }
 
-void ^?{}(coroutine$& this) libcfa_public {
+void ^?{}(coroutine$& this) {
         if(this.state != Halted && this.state != Start && this.state != Primed) {
                 coroutine$ * src = active_coroutine();
@@ -147 +147 @@
 // Not inline since only ever called once per coroutine
 forall(T & | is_coroutine(T) | { EHM_DEFAULT_VTABLE(CoroutineCancelled, (T)); })
-void prime(T& cor) libcfa_public {
+void prime(T& cor) {
         coroutine$* this = get_coroutine(cor);
         assert(this->state == Start);
@@ -155 +155 @@
 }
 
-static [void *, size_t] __stack_alloc( size_t storageSize ) {
+[void *, size_t] __stack_alloc( size_t storageSize ) {
         const size_t stack_data_size = libCeiling( sizeof(__stack_t), 16 ); // minimum alignment
         assert(__page_size != 0l);
@@ -193 +193 @@
 }
 
-static void __stack_clean  ( __stack_info_t * this ) {
+void __stack_clean  ( __stack_info_t * this ) {
         void * storage = this->storage->limit;
 
@@ -215 +215 @@
 }
 
-void __stack_prepare( __stack_info_t * this, size_t create_size ) libcfa_public {
+void __stack_prepare( __stack_info_t * this, size_t create_size ) {
         const size_t stack_data_size = libCeiling( sizeof(__stack_t), 16 ); // minimum alignment
         bool userStack;