source: libcfa/prelude/builtins.c@ 85d8153

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 85d8153 was 88ac8672, checked in by Peter A. Buhr <pabuhr@…>, 5 years ago

formatting, add long long versions for exponentiation operator
  • Property mode set to 100644
File size: 6.4 KB
Line 
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 : Tue Apr 13 17:26:32 2021
13// Update Count : 117
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
20forall(T &)
21struct __Destructor {
22 T * object;
23 void (*dtor)(T *);
24};
25
26// defined destructor in the case that non-generated code wants to use __Destructor
27forall(T &)
28static 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
35extern "C" {
36 forall(T &)
37 static inline void __destroy_Destructor(__Destructor(T) * dtor) {
38 ^(*dtor){};
39 }
40}
41
42// exception implementation
43
44typedef 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
50void exit( int status, const char fmt[], ... ) __attribute__ (( format(printf, 2, 3), __nothrow__, __leaf__, __noreturn__ ));
51void abort( const char fmt[], ... ) __attribute__ (( format(printf, 1, 2), __nothrow__, __leaf__, __noreturn__ ));
52
53forall(T &)
54static inline T & identity(T & i) {
55 return i;
56}
57
58// generator support
59struct $generator {
60 inline int;
61};
62
63static inline void ?{}($generator & this) { ((int&)this) = 0; }
64static inline void ^?{}($generator &) {}
65
66trait is_generator(T &) {
67 void main(T & this);
68 $generator * get_generator(T & this);
69};
70
71forall(T & | is_generator(T))
72static 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
79static inline {
80 forall( DT & | { DT & ?+=?( DT &, one_t ); } )
81 DT & ++?( DT & x ) { return x += 1; }
82
83 forall( 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( DT & | { DT & ?-=?( DT &, one_t ); } )
87 DT & --?( DT & x ) { return x -= 1; }
88
89 forall( 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( DT & | { int ?!=?( const DT &, zero_t ); } )
93 int !?( const DT & x ) { return !( x != 0 ); }
94} // distribution
95
96// universal typed pointer constant
97static inline forall( DT & ) DT * intptr( uintptr_t addr ) { return (DT *)addr; }
98static 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)
102static 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
109extern "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
118static 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 ( x == 1 ) return 1
128#define __CFA_BASE_COMP_2__() if ( x == 2 ) return x << (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(x) op = 1; /* accumulate odd product */ \
137 for ( ; y > 1; y >>= 1 ) { /* squaring exponentiation, O(log2 y) */ \
138 if ( (y & 1) == 1 ) op = op * x; /* odd ? */ \
139 x = x * x; \
140 } \
141 return x * op
142
143static inline {
144 long int ?\?( int x, unsigned int y ) { __CFA_EXP__(); }
145 long int ?\?( long int x, unsigned long int y ) { __CFA_EXP__(); }
146 long long int ?\?( long long int x, unsigned long long int y ) { __CFA_EXP__(); }
147 // unsigned computation may be faster and larger
148 unsigned long int ?\?( unsigned int x, unsigned int y ) { __CFA_EXP__(); }
149 unsigned long int ?\?( unsigned long int x, unsigned long int y ) { __CFA_EXP__(); }
150 unsigned long long int ?\?( unsigned long long int x, unsigned long long int y ) { __CFA_EXP__(); }
151} // distribution
152
153#undef __CFA_BASE_COMP_1__
154#undef __CFA_BASE_COMP_2__
155#undef __CFA_EXP_OVERFLOW__
156#define __CFA_BASE_COMP_1__()
157#define __CFA_BASE_COMP_2__()
158#define __CFA_EXP_OVERFLOW__()
159
160static inline forall( OT | { void ?{}( OT & this, one_t ); OT ?*?( OT, OT ); } ) {
161 OT ?\?( OT x, unsigned int y ) { __CFA_EXP__(); }
162 OT ?\?( OT x, unsigned long int y ) { __CFA_EXP__(); }
163 OT ?\?( OT x, unsigned long long int y ) { __CFA_EXP__(); }
164} // distribution
165
166#undef __CFA_BASE_COMP_1__
167#undef __CFA_BASE_COMP_2__
168#undef __CFA_EXP_OVERFLOW__
169
170static inline {
171 long int ?\=?( int & x, unsigned int y ) { x = x \ y; return x; }
172 long int ?\=?( long int & x, unsigned long int y ) { x = x \ y; return x; }
173 long long int ?\=?( long long int & x, unsigned long long int y ) { x = x \ y; return x; }
174 unsigned long int ?\=?( unsigned int & x, unsigned int y ) { x = x \ y; return x; }
175 unsigned long int ?\=?( unsigned long int & x, unsigned long int y ) { x = x \ y; return x; }
176 unsigned long long int ?\=?( unsigned long long int & x, unsigned long long int y ) { x = x \ y; return x; }
177} // distribution
178
179// Local Variables: //
180// mode: c //
181// tab-width: 4 //
182// End: //
Note: See TracBrowser for help on using the repository browser.