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 | // |
---|
7 | // builtins.c -- |
---|
8 | // |
---|
9 | // Author : Peter A. Buhr |
---|
10 | // Created On : Fri Jul 21 16:21:03 2017 |
---|
11 | // Last Modified By : Peter A. Buhr |
---|
12 | // Last Modified On : Thu Feb 2 11:33:56 2023 |
---|
13 | // Update Count : 135 |
---|
14 | // |
---|
15 | |
---|
16 | #define __cforall_builtins__ |
---|
17 | |
---|
18 | // type that wraps a pointer and a destructor-like function - used in generating implicit destructor calls for struct members in user-defined functions |
---|
19 | // Note: needs to occur early, because it is used to generate destructor calls during code generation |
---|
20 | forall(T &) |
---|
21 | struct __Destructor { |
---|
22 | T * object; |
---|
23 | void (*dtor)(T *); |
---|
24 | }; |
---|
25 | |
---|
26 | // defined destructor in the case that non-generated code wants to use __Destructor |
---|
27 | forall(T &) |
---|
28 | static inline void ^?{}(__Destructor(T) & x) { |
---|
29 | if (x.object && x.dtor) { |
---|
30 | x.dtor(x.object); |
---|
31 | } |
---|
32 | } |
---|
33 | |
---|
34 | // easy interface into __Destructor's destructor for easy codegen purposes |
---|
35 | extern "C" { |
---|
36 | forall(T &) |
---|
37 | static inline void __destroy_Destructor(__Destructor(T) * dtor) { |
---|
38 | ^(*dtor){}; |
---|
39 | } |
---|
40 | } |
---|
41 | |
---|
42 | // exception implementation |
---|
43 | |
---|
44 | typedef unsigned long long __cfaabi_abi_exception_type_t; |
---|
45 | |
---|
46 | #include <limits.h> // CHAR_BIT |
---|
47 | #include "../src/virtual.h" |
---|
48 | #include "../src/exception.h" |
---|
49 | |
---|
50 | void exit( int status, const char fmt[], ... ) __attribute__ (( format(printf, 2, 3), __nothrow__, __leaf__, __noreturn__ )); |
---|
51 | void abort( const char fmt[], ... ) __attribute__ (( format(printf, 1, 2), __nothrow__, __leaf__, __noreturn__ )); |
---|
52 | |
---|
53 | forall(T &) |
---|
54 | static inline T & identity(T & i) { |
---|
55 | return i; |
---|
56 | } |
---|
57 | |
---|
58 | // generator support |
---|
59 | struct generator$ { |
---|
60 | inline int; |
---|
61 | }; |
---|
62 | |
---|
63 | static inline void ?{}(generator$ & this) { ((int&)this) = 0; } |
---|
64 | static inline void ^?{}(generator$ &) {} |
---|
65 | |
---|
66 | forall( T & ) |
---|
67 | trait is_generator { |
---|
68 | void main(T & this); |
---|
69 | generator$ * get_generator(T & this); |
---|
70 | }; |
---|
71 | |
---|
72 | forall(T & | is_generator(T)) |
---|
73 | static inline T & resume(T & gen) { |
---|
74 | main(gen); |
---|
75 | return gen; |
---|
76 | } |
---|
77 | |
---|
78 | // implicit increment, decrement if += defined, and implicit not if != defined |
---|
79 | |
---|
80 | // C11 reference manual Section 6.5.16 (page101): "An assignment expression has the value of the left operand after the |
---|
81 | // assignment, but is not an lvalue." Hence, return a value not a reference. |
---|
82 | static inline { |
---|
83 | forall( T | { T ?+=?( T &, one_t ); } ) |
---|
84 | T ++?( T & x ) { return x += 1; } |
---|
85 | |
---|
86 | forall( T | { T ?+=?( T &, one_t ); } ) |
---|
87 | T ?++( T & x ) { T tmp = x; x += 1; return tmp; } |
---|
88 | |
---|
89 | forall( T | { T ?-=?( T &, one_t ); } ) |
---|
90 | T --?( T & x ) { return x -= 1; } |
---|
91 | |
---|
92 | forall( T | { T ?-=?( T &, one_t ); } ) |
---|
93 | T ?--( T & x ) { T tmp = x; x -= 1; return tmp; } |
---|
94 | |
---|
95 | forall( T | { int ?!=?( T, zero_t ); } ) |
---|
96 | int !?( T & x ) { return !( x != 0 ); } |
---|
97 | } // distribution |
---|
98 | |
---|
99 | // universal typed pointer constant |
---|
100 | static inline forall( DT & ) DT * intptr( uintptr_t addr ) { return (DT *)addr; } |
---|
101 | static inline forall( ftype FT ) FT * intptr( uintptr_t addr ) { return (FT *)addr; } |
---|
102 | |
---|
103 | #if defined(__SIZEOF_INT128__) |
---|
104 | // constructor for 128-bit numbers (all constants are unsigned as +/- are operators) |
---|
105 | static inline void ?{}( unsigned int128 & this, unsigned long int h, unsigned long int l ) { |
---|
106 | this = (unsigned int128)h << 64 | (unsigned int128)l; |
---|
107 | } // ?{} |
---|
108 | #endif // __SIZEOF_INT128__ |
---|
109 | |
---|
110 | // for-control index constraints |
---|
111 | // forall( T | { void ?{}( T &, zero_t ); void ?{}( T &, one_t ); T ?+=?( T &, T ); T ?-=?( T &, T ); int ?<?( T, T ); } ) |
---|
112 | // static inline T __for_control_index_constraints__( T t ) { return t; } |
---|
113 | |
---|
114 | // exponentiation operator implementation |
---|
115 | |
---|
116 | extern "C" { |
---|
117 | float powf( float x, float y ); |
---|
118 | double pow( double x, double y ); |
---|
119 | long double powl( long double x, long double y ); |
---|
120 | float _Complex cpowf( float _Complex x, _Complex float z ); |
---|
121 | double _Complex cpow( double _Complex x, _Complex double z ); |
---|
122 | long double _Complex cpowl( long double _Complex x, _Complex long double z ); |
---|
123 | } // extern "C" |
---|
124 | |
---|
125 | static inline { |
---|
126 | float ?\?( float x, float y ) { return powf( x, y ); } |
---|
127 | double ?\?( double x, double y ) { return pow( x, y ); } |
---|
128 | long double ?\?( long double x, long double y ) { return powl( x, y ); } |
---|
129 | float _Complex ?\?( float _Complex x, _Complex float y ) { return cpowf(x, y ); } |
---|
130 | double _Complex ?\?( double _Complex x, _Complex double y ) { return cpow( x, y ); } |
---|
131 | long double _Complex ?\?( long double _Complex x, _Complex long double y ) { return cpowl( x, y ); } |
---|
132 | } // distribution |
---|
133 | |
---|
134 | #define __CFA_EXP__() \ |
---|
135 | if ( y == 0 ) return 1; /* convention */ \ |
---|
136 | __CFA_EXP_INT__( /* special cases for integral types */ \ |
---|
137 | if ( x == 1 ) return 1; /* base case */ \ |
---|
138 | if ( x == 2 ) return x << (y - 1); /* positive shifting */ \ |
---|
139 | if ( y >= sizeof(y) * CHAR_BIT ) return 0; /* immediate overflow, negative exponent > 2^size-1 */ \ |
---|
140 | ) \ |
---|
141 | typeof(x) op = 1; /* accumulate odd product */ \ |
---|
142 | for ( ; y > 1; y >>= 1 ) { /* squaring exponentiation, O(log2 y) */ \ |
---|
143 | if ( (y & 1) == 1 ) op = op * x; /* odd ? */ \ |
---|
144 | x = x * x; \ |
---|
145 | } \ |
---|
146 | return x * op |
---|
147 | #define __CFA_EXP_INT__(...) __VA_ARGS__ |
---|
148 | |
---|
149 | static inline { |
---|
150 | int ?\?( int x, unsigned int y ) { __CFA_EXP__(); } |
---|
151 | long int ?\?( long int x, unsigned long int y ) { __CFA_EXP__(); } |
---|
152 | long long int ?\?( long long int x, unsigned long long int y ) { __CFA_EXP__(); } |
---|
153 | // unsigned computation may be faster and larger |
---|
154 | unsigned int ?\?( unsigned int x, unsigned int y ) { __CFA_EXP__(); } |
---|
155 | unsigned long int ?\?( unsigned long int x, unsigned long int y ) { __CFA_EXP__(); } |
---|
156 | unsigned long long int ?\?( unsigned long long int x, unsigned long long int y ) { __CFA_EXP__(); } |
---|
157 | } // distribution |
---|
158 | |
---|
159 | #undef __CFA_EXP_INT__ |
---|
160 | #define __CFA_EXP_INT__(...) |
---|
161 | |
---|
162 | static inline forall( OT | { void ?{}( OT & this, one_t ); OT ?*?( OT, OT ); } ) { |
---|
163 | OT ?\?( OT x, unsigned int y ) { __CFA_EXP__(); } |
---|
164 | OT ?\?( OT x, unsigned long int y ) { __CFA_EXP__(); } |
---|
165 | OT ?\?( OT x, unsigned long long int y ) { __CFA_EXP__(); } |
---|
166 | } // distribution |
---|
167 | |
---|
168 | #undef __CFA_EXP_INT__ |
---|
169 | #undef __CFA_EXP__ |
---|
170 | |
---|
171 | static inline { |
---|
172 | int ?\=?( int & x, unsigned int y ) { x = x \ y; return x; } |
---|
173 | long int ?\=?( long int & x, unsigned long int y ) { x = x \ y; return x; } |
---|
174 | long long int ?\=?( long long int & x, unsigned long long int y ) { x = x \ y; return x; } |
---|
175 | unsigned int ?\=?( unsigned int & x, unsigned int y ) { x = x \ y; return x; } |
---|
176 | unsigned long int ?\=?( unsigned long int & x, unsigned long int y ) { x = x \ y; return x; } |
---|
177 | unsigned long long int ?\=?( unsigned long long int & x, unsigned long long int y ) { x = x \ y; return x; } |
---|
178 | } // distribution |
---|
179 | |
---|
180 | struct quasi_void {}; |
---|
181 | static inline void ?{}(quasi_void &) {} |
---|
182 | static inline void ?{}(quasi_void &, quasi_void) {} |
---|
183 | static inline void ^?{}(quasi_void &) {} |
---|
184 | static inline quasi_void ?=?(quasi_void &, quasi_void & _src) { return _src; } |
---|
185 | |
---|
186 | forall( E ) trait Bounded { |
---|
187 | E lowerBound(void); |
---|
188 | E upperBound(void); |
---|
189 | }; |
---|
190 | |
---|
191 | forall( E | Bounded( E ) ) trait Serial { |
---|
192 | int fromInstance( E e ); |
---|
193 | E fromInt_unsafe( int i ); |
---|
194 | E succ_unsafe( E e ); |
---|
195 | E pred_unsafe( E e ); |
---|
196 | }; |
---|
197 | |
---|
198 | forall( E | Serial( E ) ) { |
---|
199 | E fromInt( int i ); |
---|
200 | E succ( E e ); |
---|
201 | E pred( E e ); |
---|
202 | int Countof( E ); |
---|
203 | } |
---|
204 | |
---|
205 | |
---|
206 | forall( E ) trait CfaEnum { |
---|
207 | const char * label( E e ); |
---|
208 | int posn( E e ); |
---|
209 | }; |
---|
210 | |
---|
211 | forall( E, V | CfaEnum( E ) ) trait TypedEnum { |
---|
212 | V value( E e ); |
---|
213 | }; |
---|
214 | |
---|
215 | // Local Variables: // |
---|
216 | // mode: c // |
---|
217 | // tab-width: 4 // |
---|
218 | // End: // |
---|