// // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo // // The contents of this file are covered under the licence agreement in the // file "LICENCE" distributed with Cforall. // // builtins.c -- // // Author : Peter A. Buhr // Created On : Fri Jul 21 16:21:03 2017 // Last Modified By : Peter A. Buhr // Last Modified On : Fri Nov 8 17:07:15 2024 // Update Count : 144 // #define __cforall_builtins__ // type that wraps a pointer and a destructor-like function - used in generating implicit destructor calls for struct members in user-defined functions // Note: needs to occur early, because it is used to generate destructor calls during code generation forall(T &) struct __Destructor { T * object; void (*dtor)(T *); }; // defined destructor in the case that non-generated code wants to use __Destructor forall(T &) static inline void ^?{}(__Destructor(T) & x) { if (x.object && x.dtor) { x.dtor(x.object); } } // easy interface into __Destructor's destructor for easy codegen purposes extern "C" { forall(T &) static inline void __destroy_Destructor(__Destructor(T) * dtor) { ^(*dtor){}; } } // exception implementation typedef unsigned long long __cfaabi_abi_exception_type_t; #include // CHAR_BIT #include "../src/virtual.h" #include "../src/exception.h" void exit( int status, const char fmt[], ... ) __attribute__ (( format(printf, 2, 3), __nothrow__, __leaf__, __noreturn__ )); void abort( const char fmt[], ... ) __attribute__ (( format(printf, 1, 2), __nothrow__, __leaf__, __noreturn__ )); forall(T &) static inline T & identity(T & i) { return i; } // generator support struct generator$ { inline int; }; static inline void ?{}(generator$ & this) { ((int&)this) = 0; } static inline void ^?{}(generator$ &) {} forall( T & ) trait is_generator { void main(T & this); generator$ * get_generator(T & this); }; forall(T & | is_generator(T)) static inline T & resume(T & gen) { main(gen); return gen; } // implicit increment, decrement if += defined, and implicit not if != defined // C11 reference manual Section 6.5.16 (page101): "An assignment expression has the value of the left operand after the // assignment, but is not an lvalue." Hence, return a value not a reference. static inline { forall( T | { T ?+=?( T &, one_t ); } ) T ++?( T & x ) { return x += 1; } forall( T | { T ?+=?( T &, one_t ); } ) T ?++( T & x ) { T tmp = x; x += 1; return tmp; } forall( T | { T ?-=?( T &, one_t ); } ) T --?( T & x ) { return x -= 1; } forall( T | { T ?-=?( T &, one_t ); } ) T ?--( T & x ) { T tmp = x; x -= 1; return tmp; } forall( T | { int ?!=?( T, zero_t ); } ) int !?( T & x ) { return !( x != 0 ); } } // distribution // universal typed pointer constant static inline forall( DT & ) DT * intptr( uintptr_t addr ) { return (DT *)addr; } static inline forall( ftype FT ) FT * intptr( uintptr_t addr ) { return (FT *)addr; } #if defined(__SIZEOF_INT128__) // constructor for 128-bit numbers (all constants are unsigned as +/- are operators) static inline void ?{}( unsigned int128 & this, unsigned long int h, unsigned long int l ) { this = (unsigned int128)h << 64 | (unsigned int128)l; } // ?{} #endif // __SIZEOF_INT128__ // for-control index constraints // forall( T | { void ?{}( T &, zero_t ); void ?{}( T &, one_t ); T ?+=?( T &, T ); T ?-=?( T &, T ); int ?= sizeof(y) * CHAR_BIT ) return 0; /* immediate overflow, negative exponent > 2^size-1 */ \ ) \ typeof(x) op = 1; /* accumulate odd product */ \ typeof(x) w = x; /* FIX-ME: possible bug in the box pass changing value argument through parameter */ \ for ( ; y > 1; y >>= 1 ) { /* squaring exponentiation, O(log2 y) */ \ if ( (y & 1) == 1 ) op = op * w; /* odd ? */ \ w = w * w; \ } \ return w * op #define __CFA_EXP_INT__(...) __VA_ARGS__ static inline { int ?\?( int x, unsigned int y ) { __CFA_EXP__(); } long int ?\?( long int x, unsigned long int y ) { __CFA_EXP__(); } long long int ?\?( long long int x, unsigned long long int y ) { __CFA_EXP__(); } // unsigned computation may be faster and larger unsigned int ?\?( unsigned int x, unsigned int y ) { __CFA_EXP__(); } unsigned long int ?\?( unsigned long int x, unsigned long int y ) { __CFA_EXP__(); } unsigned long long int ?\?( unsigned long long int x, unsigned long long int y ) { __CFA_EXP__(); } } // distribution #undef __CFA_EXP_INT__ #define __CFA_EXP_INT__(...) static inline forall( OT | { void ?{}( OT & this, one_t ); OT ?*?( OT, OT ); } ) { OT ?\?( OT x, unsigned int y ) { __CFA_EXP__(); } OT ?\?( OT x, unsigned long int y ) { __CFA_EXP__(); } OT ?\?( OT x, unsigned long long int y ) { __CFA_EXP__(); } } // distribution #undef __CFA_EXP_INT__ #undef __CFA_EXP__ static inline { int ?\=?( int & x, unsigned int y ) { x = x \ y; return x; } long int ?\=?( long int & x, unsigned long int y ) { x = x \ y; return x; } long long int ?\=?( long long int & x, unsigned long long int y ) { x = x \ y; return x; } unsigned int ?\=?( unsigned int & x, unsigned int y ) { x = x \ y; return x; } unsigned long int ?\=?( unsigned long int & x, unsigned long int y ) { x = x \ y; return x; } unsigned long long int ?\=?( unsigned long long int & x, unsigned long long int y ) { x = x \ y; return x; } } // distribution struct quasi_void {}; static inline void ?{}(quasi_void &) {} static inline void ?{}(quasi_void &, quasi_void) {} static inline void ^?{}(quasi_void &) {} static inline quasi_void ?=?(quasi_void &, quasi_void & _src) { return _src; } forall( E ) trait Bounded { E lowerBound(void); E upperBound(void); }; forall( E | Bounded( E ) ) trait Serial { int fromInstance( E e ); E fromInt_unsafe( int i ); E succ_unsafe( E e ); E pred_unsafe( E e ); }; forall( E | Serial( E ) ) { E fromInt( int i ); E succ( E e ); E pred( E e ); int Countof( E ); } forall( E ) trait CfaEnum { const char * label( E e ); int posn( E e ); }; forall( E, V | CfaEnum( E ) ) trait TypedEnum { V value( E e ); }; // Local Variables: // // mode: c // // tab-width: 4 // // End: //