[bd85400] | 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 | // |
---|
[bb82c03] | 7 | // stdlib -- |
---|
[bd85400] | 8 | // |
---|
| 9 | // Author : Peter A. Buhr |
---|
| 10 | // Created On : Thu Jan 28 17:12:35 2016 |
---|
| 11 | // Last Modified By : Peter A. Buhr |
---|
[e9a7e90b] | 12 | // Last Modified On : Wed May 16 07:53:10 2018 |
---|
| 13 | // Update Count : 300 |
---|
[bd85400] | 14 | // |
---|
| 15 | |
---|
[53a6c2a] | 16 | #pragma once |
---|
[17e5e2b] | 17 | |
---|
[e672372] | 18 | #include <stdlib.h> // strto*, *abs |
---|
| 19 | |
---|
[bd85400] | 20 | //--------------------------------------- |
---|
| 21 | |
---|
[45161b4d] | 22 | #ifndef EXIT_FAILURE |
---|
| 23 | #define EXIT_FAILURE 1 // failing exit status |
---|
| 24 | #define EXIT_SUCCESS 0 // successful exit status |
---|
| 25 | #endif // ! EXIT_FAILURE |
---|
| 26 | |
---|
| 27 | //--------------------------------------- |
---|
| 28 | |
---|
[74b19fb] | 29 | // C dynamic allocation |
---|
| 30 | static inline forall( dtype T | sized(T) ) { |
---|
| 31 | T * malloc( void ) { |
---|
| 32 | // printf( "* malloc\n" ); |
---|
| 33 | return (T *)(void *)malloc( (size_t)sizeof(T) ); // C malloc |
---|
| 34 | } // malloc |
---|
| 35 | |
---|
| 36 | // T & malloc( void ) { |
---|
| 37 | // int & p = *(T *)(void *)malloc( (size_t)sizeof(T) ); // C malloc |
---|
| 38 | // printf( "& malloc %p\n", &p ); |
---|
| 39 | // return p; |
---|
| 40 | // // return (T &)*(T *)(void *)malloc( (size_t)sizeof(T) ); // C malloc |
---|
| 41 | // } // malloc |
---|
| 42 | |
---|
| 43 | T * calloc( size_t dim ) { |
---|
| 44 | //printf( "X2\n" ); |
---|
| 45 | return (T *)(void *)calloc( dim, sizeof(T) ); // C calloc |
---|
| 46 | } // calloc |
---|
| 47 | |
---|
| 48 | T * realloc( T * ptr, size_t size ) { |
---|
| 49 | //printf( "X3\n" ); |
---|
| 50 | return (T *)(void *)realloc( (void *)ptr, size ); |
---|
| 51 | } // realloc |
---|
| 52 | |
---|
| 53 | extern "C" { void * memalign( size_t align, size_t size ); } // use default C routine for void * |
---|
| 54 | T * memalign( size_t align ) { |
---|
| 55 | //printf( "X4\n" ); |
---|
| 56 | return (T *)memalign( align, sizeof(T) ); |
---|
| 57 | } // memalign |
---|
| 58 | |
---|
| 59 | extern "C" { void * aligned_alloc( size_t align, size_t size ); } // use default C routine for void * |
---|
| 60 | T * aligned_alloc( size_t align ) { |
---|
| 61 | //printf( "X5\n" ); |
---|
| 62 | return (T *)aligned_alloc( align, sizeof(T) ); |
---|
| 63 | } // aligned_alloc |
---|
| 64 | |
---|
| 65 | int posix_memalign( T ** ptr, size_t align ) { |
---|
| 66 | //printf( "X6\n" ); |
---|
| 67 | return posix_memalign( (void **)ptr, align, sizeof(T) ); // C posix_memalign |
---|
| 68 | } // posix_memalign |
---|
| 69 | |
---|
| 70 | |
---|
| 71 | // Cforall dynamic allocation |
---|
| 72 | extern "C" { void * memset( void * dest, int c, size_t size ); } // use default C routine for void * |
---|
| 73 | |
---|
| 74 | T * alloc( void ) { |
---|
| 75 | //printf( "X7\n" ); |
---|
| 76 | return (T *)(void *)malloc( (size_t)sizeof(T) ); // C malloc |
---|
| 77 | } // alloc |
---|
| 78 | |
---|
| 79 | T * alloc( char fill ) { |
---|
| 80 | //printf( "X8\n" ); |
---|
| 81 | T * ptr = (T *)(void *)malloc( (size_t)sizeof(T) ); // C malloc |
---|
| 82 | return (T *)memset( ptr, (int)fill, sizeof(T) ); // initial with fill value |
---|
| 83 | } // alloc |
---|
| 84 | |
---|
| 85 | T * alloc( size_t dim ) { |
---|
| 86 | //printf( "X9\n" ); |
---|
| 87 | return (T *)(void *)malloc( dim * (size_t)sizeof(T) ); // C malloc |
---|
| 88 | } // alloc |
---|
| 89 | |
---|
| 90 | T * alloc( size_t dim, char fill ) { |
---|
| 91 | //printf( "X10\n" ); |
---|
| 92 | T * ptr = (T *)(void *)malloc( dim * (size_t)sizeof(T) ); // C malloc |
---|
| 93 | return (T *)memset( ptr, (int)fill, dim * sizeof(T) ); // initial with fill value |
---|
| 94 | } // alloc |
---|
| 95 | |
---|
| 96 | T * alloc( T ptr[], size_t dim ) { |
---|
| 97 | //printf( "X11\n" ); |
---|
| 98 | return (T *)(void *)realloc( (void *)ptr, dim * (size_t)sizeof(T) ); // C realloc |
---|
| 99 | } // alloc |
---|
| 100 | } // distribution |
---|
[6065b3aa] | 101 | |
---|
[f3fc631f] | 102 | |
---|
[6065b3aa] | 103 | forall( dtype T | sized(T) ) T * alloc( T ptr[], size_t dim, char fill ); |
---|
| 104 | |
---|
| 105 | static inline forall( dtype T | sized(T) ) T * align_alloc( size_t align ) { |
---|
[f3fc631f] | 106 | //printf( "X13\n" ); |
---|
[6065b3aa] | 107 | return (T *)memalign( align, sizeof(T) ); |
---|
| 108 | } // align_alloc |
---|
| 109 | static inline forall( dtype T | sized(T) ) T * align_alloc( size_t align, char fill ) { |
---|
[f3fc631f] | 110 | //printf( "X14\n" ); |
---|
[6065b3aa] | 111 | T * ptr = (T *)memalign( align, sizeof(T) ); |
---|
[cdbfab0] | 112 | return (T *)memset( ptr, (int)fill, sizeof(T) ); |
---|
[6065b3aa] | 113 | } // align_alloc |
---|
[f3fc631f] | 114 | |
---|
[6065b3aa] | 115 | static inline forall( dtype T | sized(T) ) T * align_alloc( size_t align, size_t dim ) { |
---|
[f3fc631f] | 116 | //printf( "X15\n" ); |
---|
[6065b3aa] | 117 | return (T *)memalign( align, dim * sizeof(T) ); |
---|
| 118 | } // align_alloc |
---|
| 119 | static inline forall( dtype T | sized(T) ) T * align_alloc( size_t align, size_t dim, char fill ) { |
---|
[f3fc631f] | 120 | //printf( "X16\n" ); |
---|
[6065b3aa] | 121 | T * ptr = (T *)memalign( align, dim * sizeof(T) ); |
---|
[cdbfab0] | 122 | return (T *)memset( ptr, (int)fill, dim * sizeof(T) ); |
---|
[6065b3aa] | 123 | } // align_alloc |
---|
| 124 | |
---|
[f3fc631f] | 125 | |
---|
| 126 | // data, non-array types |
---|
| 127 | static inline forall( dtype T | sized(T) ) T * memset( T * dest, char c ) { |
---|
| 128 | //printf( "X17\n" ); |
---|
[cdbfab0] | 129 | return (T *)memset( dest, c, sizeof(T) ); |
---|
[f3fc631f] | 130 | } // memset |
---|
| 131 | extern "C" { void * memcpy( void * dest, const void * src, size_t size ); } // use default C routine for void * |
---|
| 132 | static inline forall( dtype T | sized(T) ) T * memcpy( T * dest, const T * src ) { |
---|
| 133 | //printf( "X18\n" ); |
---|
[cdbfab0] | 134 | return (T *)memcpy( dest, src, sizeof(T) ); |
---|
[f3fc631f] | 135 | } // memcpy |
---|
| 136 | |
---|
| 137 | // data, array types |
---|
[6065b3aa] | 138 | static inline forall( dtype T | sized(T) ) T * memset( T dest[], size_t dim, char c ) { |
---|
[f3fc631f] | 139 | //printf( "X19\n" ); |
---|
[cdbfab0] | 140 | return (T *)(void *)memset( dest, c, dim * sizeof(T) ); // C memset |
---|
[6065b3aa] | 141 | } // memset |
---|
| 142 | static inline forall( dtype T | sized(T) ) T * memcpy( T dest[], const T src[], size_t dim ) { |
---|
[f3fc631f] | 143 | //printf( "X20\n" ); |
---|
[cdbfab0] | 144 | return (T *)(void *)memcpy( dest, src, dim * sizeof(T) ); // C memcpy |
---|
[6065b3aa] | 145 | } // memcpy |
---|
[f3fc631f] | 146 | |
---|
[6065b3aa] | 147 | // allocation/deallocation and constructor/destructor, non-array types |
---|
[aca65621] | 148 | forall( dtype T | sized(T), ttype Params | { void ?{}( T &, Params ); } ) T * new( Params p ); |
---|
[83a071f9] | 149 | forall( dtype T | sized(T) | { void ^?{}( T & ); } ) void delete( T * ptr ); |
---|
| 150 | forall( dtype T, ttype Params | sized(T) | { void ^?{}( T & ); void delete( Params ); } ) void delete( T * ptr, Params rest ); |
---|
[627f585] | 151 | |
---|
[6065b3aa] | 152 | // allocation/deallocation and constructor/destructor, array types |
---|
[aca65621] | 153 | forall( dtype T | sized(T), ttype Params | { void ?{}( T &, Params ); } ) T * anew( size_t dim, Params p ); |
---|
| 154 | forall( dtype T | sized(T) | { void ^?{}( T & ); } ) void adelete( size_t dim, T arr[] ); |
---|
| 155 | forall( dtype T | sized(T) | { void ^?{}( T & ); }, ttype Params | { void adelete( Params ); } ) void adelete( size_t dim, T arr[], Params rest ); |
---|
[6065b3aa] | 156 | |
---|
[bd85400] | 157 | //--------------------------------------- |
---|
| 158 | |
---|
[e672372] | 159 | static inline int strto( const char * sptr, char ** eptr, int base ) { return (int)strtol( sptr, eptr, base ); } |
---|
| 160 | static inline unsigned int strto( const char * sptr, char ** eptr, int base ) { return (unsigned int)strtoul( sptr, eptr, base ); } |
---|
| 161 | static inline long int strto( const char * sptr, char ** eptr, int base ) { return strtol( sptr, eptr, base ); } |
---|
| 162 | static inline unsigned long int strto( const char * sptr, char ** eptr, int base ) { return strtoul( sptr, eptr, base ); } |
---|
| 163 | static inline long long int strto( const char * sptr, char ** eptr, int base ) { return strtoll( sptr, eptr, base ); } |
---|
| 164 | static inline unsigned long long int strto( const char * sptr, char ** eptr, int base ) { return strtoull( sptr, eptr, base ); } |
---|
| 165 | |
---|
| 166 | static inline float strto( const char * sptr, char ** eptr ) { return strtof( sptr, eptr ); } |
---|
| 167 | static inline double strto( const char * sptr, char ** eptr ) { return strtod( sptr, eptr ); } |
---|
| 168 | static inline long double strto( const char * sptr, char ** eptr ) { return strtold( sptr, eptr ); } |
---|
| 169 | |
---|
[bd85400] | 170 | float _Complex strto( const char * sptr, char ** eptr ); |
---|
| 171 | double _Complex strto( const char * sptr, char ** eptr ); |
---|
| 172 | long double _Complex strto( const char * sptr, char ** eptr ); |
---|
| 173 | |
---|
[e672372] | 174 | static inline int ato( const char * sptr ) {return (int)strtol( sptr, 0, 10 ); } |
---|
| 175 | static inline unsigned int ato( const char * sptr ) { return (unsigned int)strtoul( sptr, 0, 10 ); } |
---|
| 176 | static inline long int ato( const char * sptr ) { return strtol( sptr, 0, 10 ); } |
---|
| 177 | static inline unsigned long int ato( const char * sptr ) { return strtoul( sptr, 0, 10 ); } |
---|
| 178 | static inline long long int ato( const char * sptr ) { return strtoll( sptr, 0, 10 ); } |
---|
| 179 | static inline unsigned long long int ato( const char * sptr ) { return strtoull( sptr, 0, 10 ); } |
---|
| 180 | |
---|
| 181 | static inline float ato( const char * sptr ) { return strtof( sptr, 0 ); } |
---|
| 182 | static inline double ato( const char * sptr ) { return strtod( sptr, 0 ); } |
---|
| 183 | static inline long double ato( const char * sptr ) { return strtold( sptr, 0 ); } |
---|
| 184 | |
---|
| 185 | static inline float _Complex ato( const char * sptr ) { return strto( sptr, NULL ); } |
---|
| 186 | static inline double _Complex ato( const char * sptr ) { return strto( sptr, NULL ); } |
---|
| 187 | static inline long double _Complex ato( const char * sptr ) { return strto( sptr, NULL ); } |
---|
| 188 | |
---|
[bd85400] | 189 | //--------------------------------------- |
---|
| 190 | |
---|
[9c47a47] | 191 | forall( otype E | { int ?<?( E, E ); } ) |
---|
[93cdd5c] | 192 | E * bsearch( E key, const E * vals, size_t dim ); |
---|
[f3ddc21] | 193 | |
---|
[9c47a47] | 194 | forall( otype E | { int ?<?( E, E ); } ) |
---|
[93cdd5c] | 195 | size_t bsearch( E key, const E * vals, size_t dim ); |
---|
[bd85400] | 196 | |
---|
[93cdd5c] | 197 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 198 | E * bsearch( K key, const E * vals, size_t dim ); |
---|
| 199 | |
---|
| 200 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 201 | size_t bsearch( K key, const E * vals, size_t dim ); |
---|
| 202 | |
---|
| 203 | |
---|
| 204 | forall( otype E | { int ?<?( E, E ); } ) |
---|
| 205 | E * bsearchl( E key, const E * vals, size_t dim ); |
---|
| 206 | |
---|
| 207 | forall( otype E | { int ?<?( E, E ); } ) |
---|
| 208 | size_t bsearchl( E key, const E * vals, size_t dim ); |
---|
| 209 | |
---|
| 210 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 211 | E * bsearchl( K key, const E * vals, size_t dim ); |
---|
| 212 | |
---|
| 213 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 214 | size_t bsearchl( K key, const E * vals, size_t dim ); |
---|
| 215 | |
---|
| 216 | |
---|
| 217 | forall( otype E | { int ?<?( E, E ); } ) |
---|
| 218 | E * bsearchu( E key, const E * vals, size_t dim ); |
---|
| 219 | |
---|
| 220 | forall( otype E | { int ?<?( E, E ); } ) |
---|
| 221 | size_t bsearchu( E key, const E * vals, size_t dim ); |
---|
| 222 | |
---|
| 223 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 224 | E * bsearchu( K key, const E * vals, size_t dim ); |
---|
| 225 | |
---|
| 226 | forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } ) |
---|
| 227 | size_t bsearchu( K key, const E * vals, size_t dim ); |
---|
[f3ddc21] | 228 | |
---|
[9c47a47] | 229 | |
---|
| 230 | forall( otype E | { int ?<?( E, E ); } ) |
---|
[93cdd5c] | 231 | void qsort( E * vals, size_t dim ); |
---|
[bd85400] | 232 | |
---|
| 233 | //--------------------------------------- |
---|
| 234 | |
---|
[5ea26ed] | 235 | [ int, int ] div( int num, int denom ); |
---|
| 236 | [ long int, long int ] div( long int num, long int denom ); |
---|
| 237 | [ long long int, long long int ] div( long long int num, long long int denom ); |
---|
[4040425] | 238 | forall( otype T | { T ?/?( T, T ); T ?%?( T, T ); } ) |
---|
[5ea26ed] | 239 | [ T, T ] div( T num, T demon ); |
---|
[bd85400] | 240 | |
---|
| 241 | //--------------------------------------- |
---|
| 242 | |
---|
[e672372] | 243 | static inline unsigned char abs( signed char v ) { return abs( (int)v ); } |
---|
[6e991d6] | 244 | extern "C" { int abs( int ); } // use default C routine for int |
---|
[e672372] | 245 | static inline unsigned long int abs( long int v ) { return labs( v ); } |
---|
| 246 | static inline unsigned long long int abs( long long int v ) { return llabs( v ); } |
---|
| 247 | |
---|
| 248 | extern "C" { |
---|
| 249 | double fabs( double ); |
---|
| 250 | float fabsf( float ); |
---|
| 251 | long double fabsl( long double ); |
---|
| 252 | } // extern "C" |
---|
| 253 | static inline float abs( float x ) { return fabsf( x ); } |
---|
| 254 | static inline double abs( double x ) { return fabs( x ); } |
---|
| 255 | static inline long double abs( long double x ) { return fabsl( x ); } |
---|
| 256 | |
---|
| 257 | extern "C" { |
---|
| 258 | double cabs( double _Complex ); |
---|
| 259 | float cabsf( float _Complex ); |
---|
| 260 | long double cabsl( long double _Complex ); |
---|
| 261 | } // extern "C" |
---|
| 262 | static inline float abs( float _Complex x ) { return cabsf( x ); } |
---|
| 263 | static inline double abs( double _Complex x ) { return cabs( x ); } |
---|
| 264 | static inline long double abs( long double _Complex x ) { return cabsl( x ); } |
---|
| 265 | |
---|
[aca65621] | 266 | forall( otype T | { void ?{}( T &, zero_t ); int ?<?( T, T ); T -?( T ); } ) |
---|
[f3ddc21] | 267 | T abs( T ); |
---|
[53ba273] | 268 | |
---|
| 269 | //--------------------------------------- |
---|
| 270 | |
---|
[54aba8d] | 271 | extern "C" { void srandom( unsigned int seed ); } // override C version |
---|
[70e4895d] | 272 | char random( void ); |
---|
[e672372] | 273 | char random( char u ); |
---|
[70e4895d] | 274 | char random( char l, char u ); |
---|
| 275 | int random( void ); |
---|
[e672372] | 276 | int random( int u ); |
---|
| 277 | int random( int l, int u ); |
---|
[70e4895d] | 278 | unsigned int random( void ); |
---|
| 279 | unsigned int random( unsigned int u ); |
---|
| 280 | unsigned int random( unsigned int l, unsigned int u ); |
---|
[54aba8d] | 281 | extern "C" { long int random( void ); } // override C version |
---|
[e672372] | 282 | long int random( long int u ); |
---|
| 283 | long int random( long int l, long int u ); |
---|
[70e4895d] | 284 | unsigned long int random( void ); |
---|
| 285 | unsigned long int random( unsigned long int u ); |
---|
| 286 | unsigned long int random( unsigned long int l, unsigned long int u ); |
---|
| 287 | float random( void ); |
---|
| 288 | double random( void ); |
---|
| 289 | float _Complex random( void ); |
---|
| 290 | double _Complex random( void ); |
---|
| 291 | long double _Complex random( void ); |
---|
[bd85400] | 292 | |
---|
| 293 | //--------------------------------------- |
---|
| 294 | |
---|
[4040425] | 295 | forall( otype T | { int ?<?( T, T ); } ) |
---|
[e672372] | 296 | static inline T min( T t1, T t2 ) { return t1 < t2 ? t1 : t2; } |
---|
[bd85400] | 297 | |
---|
[4040425] | 298 | forall( otype T | { int ?>?( T, T ); } ) |
---|
[e672372] | 299 | static inline T max( T t1, T t2 ) { return t1 > t2 ? t1 : t2; } |
---|
[bd85400] | 300 | |
---|
[a9f2c13] | 301 | forall( otype T | { T min( T, T ); T max( T, T ); } ) |
---|
[e672372] | 302 | static inline T clamp( T value, T min_val, T max_val ) { return max( min_val, min( value, max_val ) ); } |
---|
[a9f2c13] | 303 | |
---|
[4040425] | 304 | forall( otype T ) |
---|
[e672372] | 305 | static inline void swap( T & v1, T & v2 ) { T temp = v1; v1 = v2; v2 = temp; } |
---|
[bd85400] | 306 | |
---|
| 307 | // Local Variables: // |
---|
| 308 | // mode: c // |
---|
| 309 | // tab-width: 4 // |
---|
| 310 | // End: // |
---|