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 : Andrew Beach
|
---|
12 | // Last Modified On : Tue Oct 27 14:42:00 2020
|
---|
13 | // Update Count : 111
|
---|
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(dtype 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(dtype 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(dtype 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(dtype 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 | trait is_generator(dtype T) {
|
---|
67 | void main(T & this);
|
---|
68 | $generator * get_generator(T & this);
|
---|
69 | };
|
---|
70 |
|
---|
71 | forall(dtype T | is_generator(T))
|
---|
72 | static inline T & resume(T & gen) {
|
---|
73 | main(gen);
|
---|
74 | return gen;
|
---|
75 | }
|
---|
76 |
|
---|
77 | // implicit increment, decrement if += defined, and implicit not if != defined
|
---|
78 |
|
---|
79 | static inline {
|
---|
80 | forall( dtype DT | { DT & ?+=?( DT &, one_t ); } )
|
---|
81 | DT & ++?( DT & x ) { return x += 1; }
|
---|
82 |
|
---|
83 | forall( dtype DT | sized(DT) | { void ?{}( DT &, DT ); void ^?{}( DT & ); DT & ?+=?( DT &, one_t ); } )
|
---|
84 | DT & ?++( DT & x ) { DT tmp = x; x += 1; return tmp; }
|
---|
85 |
|
---|
86 | forall( dtype DT | { DT & ?-=?( DT &, one_t ); } )
|
---|
87 | DT & --?( DT & x ) { return x -= 1; }
|
---|
88 |
|
---|
89 | forall( dtype DT | sized(DT) | { void ?{}( DT &, DT ); void ^?{}( DT & ); DT & ?-=?( DT &, one_t ); } )
|
---|
90 | DT & ?--( DT & x ) { DT tmp = x; x -= 1; return tmp; }
|
---|
91 |
|
---|
92 | forall( dtype DT | { int ?!=?( const DT &, zero_t ); } )
|
---|
93 | int !?( const DT & x ) { return !( x != 0 ); }
|
---|
94 | } // distribution
|
---|
95 |
|
---|
96 | // universal typed pointer constant
|
---|
97 | static inline forall( dtype DT ) DT * intptr( uintptr_t addr ) { return (DT *)addr; }
|
---|
98 | static inline forall( ftype FT ) FT * intptr( uintptr_t addr ) { return (FT *)addr; }
|
---|
99 |
|
---|
100 | #if defined(__SIZEOF_INT128__)
|
---|
101 | // constructor for 128-bit numbers (all constants are unsigned as +/- are operators)
|
---|
102 | static inline void ?{}( unsigned int128 & this, unsigned long int h, unsigned long int l ) {
|
---|
103 | this = (unsigned int128)h << 64 | (unsigned int128)l;
|
---|
104 | } // ?{}
|
---|
105 | #endif // __SIZEOF_INT128__
|
---|
106 |
|
---|
107 | // exponentiation operator implementation
|
---|
108 |
|
---|
109 | extern "C" {
|
---|
110 | float powf( float x, float y );
|
---|
111 | double pow( double x, double y );
|
---|
112 | long double powl( long double x, long double y );
|
---|
113 | float _Complex cpowf( float _Complex x, _Complex float z );
|
---|
114 | double _Complex cpow( double _Complex x, _Complex double z );
|
---|
115 | long double _Complex cpowl( long double _Complex x, _Complex long double z );
|
---|
116 | } // extern "C"
|
---|
117 |
|
---|
118 | static inline {
|
---|
119 | float ?\?( float x, float y ) { return powf( x, y ); }
|
---|
120 | double ?\?( double x, double y ) { return pow( x, y ); }
|
---|
121 | long double ?\?( long double x, long double y ) { return powl( x, y ); }
|
---|
122 | float _Complex ?\?( float _Complex x, _Complex float y ) { return cpowf(x, y ); }
|
---|
123 | double _Complex ?\?( double _Complex x, _Complex double y ) { return cpow( x, y ); }
|
---|
124 | long double _Complex ?\?( long double _Complex x, _Complex long double y ) { return cpowl( x, y ); }
|
---|
125 | } // distribution
|
---|
126 |
|
---|
127 | #define __CFA_BASE_COMP_1__() if ( ep == 1 ) return 1
|
---|
128 | #define __CFA_BASE_COMP_2__() if ( ep == 2 ) return ep << (y - 1)
|
---|
129 | #define __CFA_EXP_OVERFLOW__() if ( y >= sizeof(y) * CHAR_BIT ) return 0
|
---|
130 |
|
---|
131 | #define __CFA_EXP__() \
|
---|
132 | if ( y == 0 ) return 1; /* convention */ \
|
---|
133 | __CFA_BASE_COMP_1__(); /* base case */ \
|
---|
134 | __CFA_BASE_COMP_2__(); /* special case, positive shifting for integral types */ \
|
---|
135 | __CFA_EXP_OVERFLOW__(); /* immediate overflow, negative exponent > 2^size-1 */ \
|
---|
136 | typeof(ep) op = 1; /* accumulate odd product */ \
|
---|
137 | for ( ; y > 1; y >>= 1 ) { /* squaring exponentiation, O(log2 y) */ \
|
---|
138 | if ( (y & 1) == 1 ) op = op * ep; /* odd ? */ \
|
---|
139 | ep = ep * ep; \
|
---|
140 | } \
|
---|
141 | return ep * op
|
---|
142 |
|
---|
143 | static inline {
|
---|
144 | long int ?\?( int ep, unsigned int y ) { __CFA_EXP__(); }
|
---|
145 | long int ?\?( long int ep, unsigned long int y ) { __CFA_EXP__(); }
|
---|
146 | // unsigned computation may be faster and larger
|
---|
147 | unsigned long int ?\?( unsigned int ep, unsigned int y ) { __CFA_EXP__(); }
|
---|
148 | unsigned long int ?\?( unsigned long int ep, unsigned long int y ) { __CFA_EXP__(); }
|
---|
149 | } // distribution
|
---|
150 |
|
---|
151 | #undef __CFA_BASE_COMP_1__
|
---|
152 | #undef __CFA_BASE_COMP_2__
|
---|
153 | #undef __CFA_EXP_OVERFLOW__
|
---|
154 | #define __CFA_BASE_COMP_1__()
|
---|
155 | #define __CFA_BASE_COMP_2__()
|
---|
156 | #define __CFA_EXP_OVERFLOW__()
|
---|
157 |
|
---|
158 | static inline forall( otype OT | { void ?{}( OT & this, one_t ); OT ?*?( OT, OT ); } ) {
|
---|
159 | OT ?\?( OT ep, unsigned int y ) { __CFA_EXP__(); }
|
---|
160 | OT ?\?( OT ep, unsigned long int y ) { __CFA_EXP__(); }
|
---|
161 | } // distribution
|
---|
162 |
|
---|
163 | #undef __CFA_BASE_COMP_1__
|
---|
164 | #undef __CFA_BASE_COMP_2__
|
---|
165 | #undef __CFA_EXP_OVERFLOW__
|
---|
166 |
|
---|
167 | static inline {
|
---|
168 | long int ?\=?( long int & x, unsigned long int y ) { x = x \ y; return x; }
|
---|
169 | unsigned long int ?\=?( unsigned long int & x, unsigned long int y ) { x = x \ y; return x; }
|
---|
170 | int ?\=?( int & x, unsigned long int y ) { x = x \ y; return x; }
|
---|
171 | unsigned int ?\=?( unsigned int & x, unsigned long int y ) { x = x \ y; return x; }
|
---|
172 | } // distribution
|
---|
173 |
|
---|
174 | // Local Variables: //
|
---|
175 | // mode: c //
|
---|
176 | // tab-width: 4 //
|
---|
177 | // End: //
|
---|