Changeset 4fa8f1a
- Timestamp:
- Nov 30, 2019, 1:17:32 PM (5 years ago)
- Branches:
- ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- 1805b1b, e8c52cf
- Parents:
- e71c1d4 (diff), ce7bdc4 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - Files:
-
- 13 edited
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/coroutine.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Mon Nov 28 12:27:26 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Fri Mar 30 17:20:57 201813 // Update Count : 912 // Last Modified On : Sat Nov 30 09:59:36 2019 13 // Update Count : 14 14 14 // 15 15 … … 90 90 91 91 void ?{}( coroutine_desc & this, const char * name, void * storage, size_t storageSize ) with( this ) { 92 (this.context){ NULL, NULL};92 (this.context){0p, 0p}; 93 93 (this.stack){storage, storageSize}; 94 94 this.name = name; 95 95 state = Start; 96 starter = NULL;97 last = NULL;98 cancellation = NULL;96 starter = 0p; 97 last = 0p; 98 cancellation = 0p; 99 99 } 100 100 -
libcfa/src/concurrency/invoke.h
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Jan 17 12:27:26 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Sat Jun 22 18:19:13201913 // Update Count : 4 012 // Last Modified On : Thu Nov 28 22:34:07 2019 13 // Update Count : 41 14 14 // 15 15 … … 51 51 52 52 struct { 53 void * stack; 53 54 volatile unsigned short disable_count; 54 55 volatile bool enabled; -
libcfa/src/concurrency/kernel.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Jan 17 12:27:26 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Nov 21 16:46:59201913 // Update Count : 2712 // Last Modified On : Fri Nov 29 17:59:16 2019 13 // Update Count : 35 14 14 // 15 15 … … 26 26 #include <signal.h> 27 27 #include <unistd.h> 28 #include <limits.h> // PTHREAD_STACK_MIN 28 29 } 29 30 … … 133 134 NULL, 134 135 NULL, 135 { 1, false, false },136 { NULL, 1, false, false }, 136 137 6u //this should be seeded better but due to a bug calling rdtsc doesn't work 137 138 }; … … 233 234 234 235 pthread_join( kernel_thread, NULL ); 236 free( this.stack ); 235 237 } 236 238 … … 445 447 __cfaabi_dbg_print_safe("Kernel : Starting core %p\n", this); 446 448 447 pthread_create( &this->kernel_thread, NULL, CtxInvokeProcessor, (void*)this ); 449 pthread_attr_t attr; 450 int ret; 451 ret = pthread_attr_init( &attr ); // initialize attribute 452 if ( ret ) { 453 abort( "%s : internal error, pthread_attr_init failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 454 } // if 455 456 size_t stacksize; 457 ret = pthread_attr_getstacksize( &attr, &stacksize ); // default stack size, normally defined by shell limit 458 if ( ret ) { 459 abort( "%s : internal error, pthread_attr_getstacksize failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 460 } // if 461 assert( stacksize >= PTHREAD_STACK_MIN ); 462 463 this->stack = malloc( stacksize ); 464 ret = pthread_attr_setstack( &attr, this->stack, stacksize ); 465 if ( ret ) { 466 abort( "%s : internal error, pthread_attr_setstack failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 467 } // if 468 469 ret = pthread_create( &this->kernel_thread, &attr, CtxInvokeProcessor, (void *)this ); 470 if ( ret ) { 471 abort( "%s : internal error, pthread_create failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 472 } // if 473 // pthread_create( &this->kernel_thread, NULL, CtxInvokeProcessor, (void*)this ); 448 474 449 475 __cfaabi_dbg_print_safe("Kernel : core %p started\n", this); -
libcfa/src/concurrency/kernel.hfa
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Jan 17 12:27:26 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Sat Jun 22 11:39:17201913 // Update Count : 1 612 // Last Modified On : Thu Nov 28 21:24:12 2019 13 // Update Count : 17 14 14 // 15 15 … … 135 135 semaphore terminated; 136 136 137 // pthread Stack 138 void * stack; 139 137 140 // Link lists fields 138 141 struct __dbg_node_proc { -
libcfa/src/concurrency/preemption.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Mon Jun 5 14:20:42 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Tue Jun 5 17:35:49 201813 // Update Count : 3 712 // Last Modified On : Sat Nov 30 08:02:56 2019 13 // Update Count : 39 14 14 // 15 15 … … 24 24 #include <string.h> 25 25 #include <unistd.h> 26 #include <limits.h> // PTHREAD_STACK_MIN 26 27 } 27 28 … … 81 82 // Get next expired node 82 83 static inline alarm_node_t * get_expired( alarm_list_t * alarms, Time currtime ) { 83 if( !alarms->head ) return NULL;// If no alarms return null84 if( alarms->head->alarm >= currtime ) return NULL;// If alarms head not expired return null85 return pop(alarms); 84 if( !alarms->head ) return 0p; // If no alarms return null 85 if( alarms->head->alarm >= currtime ) return 0p; // If alarms head not expired return null 86 return pop(alarms); // Otherwise just pop head 86 87 } 87 88 88 89 // Tick one frame of the Discrete Event Simulation for alarms 89 90 static void tick_preemption() { 90 alarm_node_t * node = NULL;// Used in the while loop but cannot be declared in the while condition91 alarm_list_t * alarms = &event_kernel->alarms; 92 Time currtime = __kernel_get_time(); // Check current time once so weeverything "happens at once"91 alarm_node_t * node = 0p; // Used in the while loop but cannot be declared in the while condition 92 alarm_list_t * alarms = &event_kernel->alarms; // Local copy for ease of reading 93 Time currtime = __kernel_get_time(); // Check current time once so everything "happens at once" 93 94 94 95 //Loop throught every thing expired … … 243 244 sigaddset( &mask, sig ); 244 245 245 if ( pthread_sigmask( SIG_UNBLOCK, &mask, NULL) == -1 ) {246 if ( pthread_sigmask( SIG_UNBLOCK, &mask, 0p ) == -1 ) { 246 247 abort( "internal error, pthread_sigmask" ); 247 248 } … … 254 255 sigaddset( &mask, sig ); 255 256 256 if ( pthread_sigmask( SIG_BLOCK, &mask, NULL) == -1 ) {257 if ( pthread_sigmask( SIG_BLOCK, &mask, 0p ) == -1 ) { 257 258 abort( "internal error, pthread_sigmask" ); 258 259 } … … 301 302 302 303 // Setup proper signal handlers 303 __cfaabi_sigaction( SIGUSR1, sigHandler_ctxSwitch, SA_SIGINFO | SA_RESTART ); 304 __cfaabi_sigaction( SIGUSR1, sigHandler_ctxSwitch, SA_SIGINFO | SA_RESTART ); // CtxSwitch handler 304 305 305 306 signal_block( SIGALRM ); 306 307 307 pthread_create( &alarm_thread, NULL, alarm_loop, NULL ); 308 pthread_attr_t attr; 309 int ret; 310 ret = pthread_attr_init( &attr ); // initialize attribute 311 if ( ret ) { 312 abort( "%s : internal error, pthread_attr_init failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 313 } // if 314 315 size_t stacksize; 316 ret = pthread_attr_getstacksize( &attr, &stacksize ); // default stack size, normally defined by shell limit 317 if ( ret ) { 318 abort( "%s : internal error, pthread_attr_getstacksize failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 319 } // if 320 assert( stacksize >= PTHREAD_STACK_MIN ); 321 322 kernelTLS.preemption_state.stack = malloc( stacksize ); 323 ret = pthread_attr_setstack( &attr, kernelTLS.preemption_state.stack, stacksize ); 324 if ( ret ) { 325 abort( "%s : internal error, pthread_attr_setstack failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 326 } // if 327 328 ret = pthread_create( &alarm_thread, &attr, alarm_loop, 0p ); 329 if ( ret ) { 330 abort( "%s : internal error, pthread_create failed, error(%d) %s.", __PRETTY_FUNCTION__, ret, strerror( ret ) ); 331 } // if 308 332 } 309 333 … … 316 340 sigset_t mask; 317 341 sigfillset( &mask ); 318 sigprocmask( SIG_BLOCK, &mask, NULL);342 sigprocmask( SIG_BLOCK, &mask, 0p ); 319 343 320 344 // Notify the alarm thread of the shutdown … … 323 347 324 348 // Wait for the preemption thread to finish 325 pthread_join( alarm_thread, NULL ); 349 350 pthread_join( alarm_thread, 0p ); 351 free( kernelTLS.preemption_state.stack ); 326 352 327 353 // Preemption is now fully stopped … … 380 406 static_assert( sizeof( sigset_t ) == sizeof( cxt->uc_sigmask ), "Expected cxt->uc_sigmask to be of sigset_t" ); 381 407 #endif 382 if ( pthread_sigmask( SIG_SETMASK, (sigset_t *)&(cxt->uc_sigmask), NULL) == -1 ) {408 if ( pthread_sigmask( SIG_SETMASK, (sigset_t *)&(cxt->uc_sigmask), 0p ) == -1 ) { 383 409 abort( "internal error, sigprocmask" ); 384 410 } … … 399 425 sigset_t mask; 400 426 sigfillset(&mask); 401 if ( pthread_sigmask( SIG_BLOCK, &mask, NULL) == -1 ) {427 if ( pthread_sigmask( SIG_BLOCK, &mask, 0p ) == -1 ) { 402 428 abort( "internal error, pthread_sigmask" ); 403 429 } … … 420 446 {__cfaabi_dbg_print_buffer_decl( " KERNEL: Spurious wakeup %d.\n", err );} 421 447 continue; 422 448 case EINVAL : 423 449 abort( "Timeout was invalid." ); 424 450 default: … … 453 479 EXIT: 454 480 __cfaabi_dbg_print_safe( "Kernel : Preemption thread stopping\n" ); 455 return NULL;481 return 0p; 456 482 } 457 483 … … 466 492 sigset_t oldset; 467 493 int ret; 468 ret = pthread_sigmask(0, NULL, &oldset);494 ret = pthread_sigmask(0, 0p, &oldset); 469 495 if(ret != 0) { abort("ERROR sigprocmask returned %d", ret); } 470 496 -
libcfa/src/fstream.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Wed May 27 17:56:53 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Tue Sep 10 22:19:56 201913 // Update Count : 35 412 // Last Modified On : Fri Nov 29 06:56:46 2019 13 // Update Count : 355 14 14 // 15 15 … … 66 66 } // ?{} 67 67 68 void ^?{}( ofstream & os ) { 69 close( os ); 70 } // ^?{} 71 68 72 void sepOn( ofstream & os ) { os.sepOnOff = ! getNL( os ); } 69 73 void sepOff( ofstream & os ) { os.sepOnOff = false; } … … 195 199 } // ?{} 196 200 201 void ^?{}( ifstream & is ) { 202 close( is ); 203 } // ^?{} 204 197 205 void nlOn( ifstream & os ) { os.nlOnOff = true; } 198 206 void nlOff( ifstream & os ) { os.nlOnOff = false; } -
libcfa/src/fstream.hfa
re71c1d4 r4fa8f1a 10 10 // Created On : Wed May 27 17:56:53 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Mon Jul 15 18:10:23201913 // Update Count : 16 712 // Last Modified On : Fri Nov 29 06:56:02 2019 13 // Update Count : 168 14 14 // 15 15 … … 72 72 void ?{}( ofstream & os, const char * name, const char * mode ); 73 73 void ?{}( ofstream & os, const char * name ); 74 void ^?{}( ofstream & os ); 74 75 75 76 extern ofstream & sout, & stdout, & serr, & stderr; // aliases … … 101 102 void ?{}( ifstream & is, const char * name, const char * mode ); 102 103 void ?{}( ifstream & is, const char * name ); 104 void ^?{}( ifstream & is ); 103 105 104 106 extern ifstream & sin, & stdin; // aliases -
libcfa/src/heap.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Dec 19 21:58:35 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Sun Nov 24 17:56:15201913 // Update Count : 6 3812 // Last Modified On : Fri Nov 29 17:33:58 2019 13 // Update Count : 641 14 14 // 15 15 … … 71 71 72 72 73 // static bool traceHeapTerm = false;74 75 // inline bool traceHeapTerm() {76 // return traceHeapTerm;77 // } // traceHeapTerm78 79 // bool traceHeapTermOn() {80 // bool temp = traceHeapTerm;81 // traceHeapTerm = true;82 // return temp;83 // } // traceHeapTermOn84 85 // bool traceHeapTermOff() {86 // bool temp = traceHeapTerm;87 // traceHeapTerm = false;88 // return temp;89 // } // traceHeapTermOff90 91 92 73 enum { 93 74 // Define the default extension heap amount in units of bytes. When the uC++ supplied heap reaches the brk address, … … 115 96 if ( allocFree != 0 ) { 116 97 // DO NOT USE STREAMS AS THEY MAY BE UNAVAILABLE AT THIS POINT. 117 //char helpText[512];118 //int len = snprintf( helpText, sizeof(helpText), "CFA warning (UNIX pid:%ld) : program terminating with %u(0x%x) bytes of storage allocated but not freed.\n"119 //"Possible cause is unfreed storage allocated by the program or system/library routines called from the program.\n",120 //(long int)getpid(), allocFree, allocFree ); // always print the UNIX pid121 // __cfaabi_dbg_bits_write( STDERR_FILENO, helpText, len ); // print debug/nodebug98 char helpText[512]; 99 int len = snprintf( helpText, sizeof(helpText), "CFA warning (UNIX pid:%ld) : program terminating with %u(0x%x) bytes of storage allocated but not freed.\n" 100 "Possible cause is unfreed storage allocated by the program or system/library routines called from the program.\n", 101 (long int)getpid(), allocFree, allocFree ); // always print the UNIX pid 102 __cfaabi_bits_write( STDERR_FILENO, helpText, len ); // print debug/nodebug 122 103 } // if 123 104 } // prtUnfreed -
libcfa/src/interpose.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Wed Mar 29 16:10:31 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Nov 21 16:47:02 201913 // Update Count : 11 812 // Last Modified On : Sat Nov 30 07:09:42 2019 13 // Update Count : 119 14 14 // 15 15 … … 196 196 __cfaabi_bits_print_nolock( STDERR_FILENO, "Stack back trace for: %s\n", messages[0]); 197 197 198 for ( int i = Start; i < size - abort_lastframe && messages != NULL; i += 1 ) {199 char * name = NULL, * offset_begin = NULL, * offset_end = NULL;198 for ( int i = Start; i < size - abort_lastframe && messages != 0p; i += 1 ) { 199 char * name = 0p, * offset_begin = 0p, * offset_end = 0p; 200 200 201 201 for ( char * p = messages[i]; *p; ++p ) { -
libcfa/src/startup.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Jul 24 16:21:57 2018 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Jul 25 16:42:01 201813 // Update Count : 1 112 // Last Modified On : Sat Nov 30 07:07:56 2019 13 // Update Count : 13 14 14 // 15 15 16 16 #include "startup.hfa" 17 #include <unistd.h> 18 17 #include <time.h> // tzset 19 18 20 19 extern "C" { 21 20 static void __cfaabi_appready_startup( void ) __attribute__(( constructor( STARTUP_PRIORITY_APPREADY ) )); 22 21 void __cfaabi_appready_startup( void ) { 22 tzset(); // initialize time global variables 23 23 #ifdef __CFA_DEBUG__ 24 24 extern void heapAppStart(); -
libcfa/src/stdlib.hfa
re71c1d4 r4fa8f1a 10 10 // Created On : Thu Jan 28 17:12:35 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Fri Nov 2 2 15:13:14201913 // Update Count : 39912 // Last Modified On : Fri Nov 29 23:08:02 2019 13 // Update Count : 400 14 14 // 15 15 … … 210 210 211 211 static inline { 212 int ato( const char * sptr ) { return (int)strtol( sptr, 0 , 10 ); }213 unsigned int ato( const char * sptr ) { return (unsigned int)strtoul( sptr, 0 , 10 ); }214 long int ato( const char * sptr ) { return strtol( sptr, 0 , 10 ); }215 unsigned long int ato( const char * sptr ) { return strtoul( sptr, 0 , 10 ); }216 long long int ato( const char * sptr ) { return strtoll( sptr, 0 , 10 ); }217 unsigned long long int ato( const char * sptr ) { return strtoull( sptr, 0 , 10 ); }218 219 float ato( const char * sptr ) { return strtof( sptr, 0 ); }220 double ato( const char * sptr ) { return strtod( sptr, 0 ); }221 long double ato( const char * sptr ) { return strtold( sptr, 0 ); }222 223 float _Complex ato( const char * sptr ) { return strto( sptr, NULL); }224 double _Complex ato( const char * sptr ) { return strto( sptr, NULL); }225 long double _Complex ato( const char * sptr ) { return strto( sptr, NULL); }212 int ato( const char * sptr ) { return (int)strtol( sptr, 0p, 10 ); } 213 unsigned int ato( const char * sptr ) { return (unsigned int)strtoul( sptr, 0p, 10 ); } 214 long int ato( const char * sptr ) { return strtol( sptr, 0p, 10 ); } 215 unsigned long int ato( const char * sptr ) { return strtoul( sptr, 0p, 10 ); } 216 long long int ato( const char * sptr ) { return strtoll( sptr, 0p, 10 ); } 217 unsigned long long int ato( const char * sptr ) { return strtoull( sptr, 0p, 10 ); } 218 219 float ato( const char * sptr ) { return strtof( sptr, 0p ); } 220 double ato( const char * sptr ) { return strtod( sptr, 0p ); } 221 long double ato( const char * sptr ) { return strtold( sptr, 0p ); } 222 223 float _Complex ato( const char * sptr ) { return strto( sptr, 0p ); } 224 double _Complex ato( const char * sptr ) { return strto( sptr, 0p ); } 225 long double _Complex ato( const char * sptr ) { return strto( sptr, 0p ); } 226 226 } // distribution 227 227 -
tests/concurrent/thread.cfa
re71c1d4 r4fa8f1a 7 7 thread Second { semaphore* lock; }; 8 8 9 void ?{}( First & this, semaphore & lock ) { ((thread&)this) {"Thread 1"}; this.lock = &lock; }10 void ?{}( Second & this, semaphore & lock ) { ((thread&)this) {"Thread 2"}; this.lock = &lock; }9 void ?{}( First & this, semaphore & lock ) { ((thread&)this).self_cor.name = "Thread 1"; this.lock = &lock; } 10 void ?{}( Second & this, semaphore & lock ) { ((thread&)this).self_cor.name = "Thread 2"; this.lock = &lock; } 11 11 12 12 void main(First& this) { -
tests/time.cfa
re71c1d4 r4fa8f1a 10 10 // Created On : Tue Mar 27 17:24:56 2018 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Dec 20 23:09:21 201813 // Update Count : 2 312 // Last Modified On : Fri Nov 29 23:05:30 2019 13 // Update Count : 24 14 14 // 15 15 … … 20 20 Duration d1 = 3`h, d2 = 2`s, d3 = 3.375`s, d4 = 12`s, d5 = 1`s + 10_000`ns; 21 21 sout | d1 | d2 | d3 | d4 | d5; 22 int i;23 22 d1 = 0; 24 23 sout | d1 | d2 | d3;
Note: See TracChangeset
for help on using the changeset viewer.