- Timestamp:
- Nov 30, 2019, 11:04:08 AM (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:
- 27f5f71
- Parents:
- 397c101a
- Location:
- libcfa/src
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/coroutine.cfa
r397c101a r524627e 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/interpose.cfa
r397c101a r524627e 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/stdlib.hfa
r397c101a r524627e 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
Note: See TracChangeset
for help on using the changeset viewer.