source: libcfa/prelude/builtins.c @ 3e2e9b2

Last change on this file since 3e2e9b2 was 3e2e9b2, checked in by JiadaL <j82liang@…>, 3 weeks ago

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

  • Property mode set to 100644
File size: 6.1 KB
RevLine 
[a5f0529]1//
[a1edafa]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.
[a5f0529]6//
7// builtins.c --
8//
[a1edafa]9// Author           : Peter A. Buhr
10// Created On       : Fri Jul 21 16:21:03 2017
[88ac8672]11// Last Modified By : Peter A. Buhr
[62595b31]12// Last Modified On : Fri Nov  8 17:07:15 2024
13// Update Count     : 144
[a5f0529]14//
[a1edafa]15
[c960331]16#define __cforall_builtins__
17
[b867278]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
[fd54fef]20forall(T &)
[b867278]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
[fd54fef]27forall(T &)
[b867278]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" {
[fd54fef]36        forall(T &)
[b867278]37        static inline void __destroy_Destructor(__Destructor(T) * dtor) {
38                ^(*dtor){};
39        }
40}
41
[a1edafa]42// exception implementation
43
[36982fc]44typedef unsigned long long __cfaabi_abi_exception_type_t;
[fa4805f]45
[bf71cfd]46#include "../src/virtual.h"
47#include "../src/exception.h"
[a1edafa]48
[169d944]49void exit( int status, const char fmt[], ... ) __attribute__ (( format(printf, 2, 3), __nothrow__, __leaf__, __noreturn__ ));
[f79cdf8]50void abort( const char fmt[], ... ) __attribute__ (( format(printf, 1, 2), __nothrow__, __leaf__, __noreturn__ ));
[169d944]51
[fd54fef]52forall(T &)
[427854b]53static inline T & identity(T & i) {
54        return i;
55}
56
57// generator support
[e84ab3d]58struct generator$ {
[427854b]59        inline int;
60};
61
[e84ab3d]62static inline void  ?{}(generator$ & this) { ((int&)this) = 0; }
63static inline void ^?{}(generator$ &) {}
[427854b]64
[8a97248]65forall( T & )
66trait is_generator {
[427854b]67      void main(T & this);
[e84ab3d]68      generator$ * get_generator(T & this);
[427854b]69};
70
[fd54fef]71forall(T & | is_generator(T))
[427854b]72static inline T & resume(T & gen) {
73        main(gen);
74        return gen;
75}
76
[0d8266c]77// implicit increment, decrement if += defined, and implicit not if != defined
[d2887f7]78
[2ead704]79// C11 reference manual Section 6.5.16 (page101): "An assignment expression has the value of the left operand after the
80// assignment, but is not an lvalue." Hence, return a value not a reference.
[8a30423]81static inline {
[8477fc4]82        forall( T | { T ?+=?( T &, one_t ); } )
83        T ++?( T & x ) { return x += 1; }
[d2887f7]84
[8477fc4]85        forall( T | { T ?+=?( T &, one_t ); } )
86        T ?++( T & x ) { T tmp = x; x += 1; return tmp; }
[d2887f7]87
[8477fc4]88        forall( T | { T ?-=?( T &, one_t ); } )
89        T --?( T & x ) { return x -= 1; }
[d2887f7]90
[8477fc4]91        forall( T | { T ?-=?( T &, one_t ); } )
92        T ?--( T & x ) { T tmp = x; x -= 1; return tmp; }
[0d8266c]93
[8477fc4]94        forall( T | { int ?!=?( T, zero_t ); } )
95        int !?( T & x ) { return !( x != 0 ); }
[8a30423]96} // distribution
[7579ac0]97
98// universal typed pointer constant
[fd54fef]99static inline forall( DT & ) DT * intptr( uintptr_t addr ) { return (DT *)addr; }
[04423b53]100static inline forall( ftype FT ) FT * intptr( uintptr_t addr ) { return (FT *)addr; }
[a1edafa]101
[cf5af9c]102#if defined(__SIZEOF_INT128__)
[b56f55c]103// constructor for 128-bit numbers (all constants are unsigned as +/- are operators)
104static inline void ?{}( unsigned int128 & this, unsigned long int h, unsigned long int l ) {
105        this = (unsigned int128)h << 64 | (unsigned int128)l;
106} // ?{}
[cf5af9c]107#endif // __SIZEOF_INT128__
[b56f55c]108
[c99a0d1]109// for-control index constraints
110// forall( T | { void ?{}( T &, zero_t ); void ?{}( T &, one_t ); T ?+=?( T &, T ); T ?-=?( T &, T ); int ?<?( T, T ); } )
111// static inline T __for_control_index_constraints__( T t ) { return t; }
112
[a1edafa]113// exponentiation operator implementation
114
115extern "C" {
116        float powf( float x, float y );
117        double pow( double x, double y );
118        long double powl( long double x, long double y );
119        float _Complex cpowf( float _Complex x, _Complex float z );
120        double _Complex cpow( double _Complex x, _Complex double z );
121        long double _Complex cpowl( long double _Complex x, _Complex long double z );
122} // extern "C"
123
[8a30423]124static inline {
125        float ?\?( float x, float y ) { return powf( x, y ); }
126        double ?\?( double x, double y ) { return pow( x, y ); }
127        long double ?\?( long double x, long double y ) { return powl( x, y ); }
128        float _Complex ?\?( float _Complex x, _Complex float y ) { return cpowf(x, y ); }
129        double _Complex ?\?( double _Complex x, _Complex double y ) { return cpow( x, y ); }
130        long double _Complex ?\?( long double _Complex x, _Complex long double y ) { return cpowl( x, y ); }
131} // distribution
[a1edafa]132
[108b2c7]133int ?\?( int x, unsigned int y );
134long int ?\?( long int x, unsigned long int y );
135long long int ?\?( long long int x, unsigned long long int y );
136// unsigned computation may be faster and larger
137unsigned int ?\?( unsigned int x, unsigned int y );
138unsigned long int ?\?( unsigned long int x, unsigned long int y );
139unsigned long long int ?\?( unsigned long long int x, unsigned long long int y );
140
141forall( OT | { void ?{}( OT & this, one_t ); OT ?*?( OT, OT ); } ) {
142        OT ?\?( OT x, unsigned int y );
143        OT ?\?( OT x, unsigned long int y );
144        OT ?\?( OT x, unsigned long long int y );
[8a30423]145} // distribution
[8dbfb7e]146
[8a30423]147static inline {
[24d6572]148        int ?\=?( int & x, unsigned int y ) { x = x \ y; return x; }
[8a30423]149        long int ?\=?( long int & x, unsigned long int y ) { x = x \ y; return x; }
[88ac8672]150        long long int ?\=?( long long int & x, unsigned long long int y ) { x = x \ y; return x; }
[24d6572]151        unsigned int ?\=?( unsigned int & x, unsigned int y ) { x = x \ y; return x; }
[8a30423]152        unsigned long int ?\=?( unsigned long int & x, unsigned long int y ) { x = x \ y; return x; }
[88ac8672]153        unsigned long long int ?\=?( unsigned long long int & x, unsigned long long int y ) { x = x \ y; return x; }
[8a30423]154} // distribution
[a1edafa]155
[85855b0]156struct quasi_void {};
157static inline void ?{}(quasi_void &) {}
158static inline void ?{}(quasi_void &, quasi_void) {}
159static inline void ^?{}(quasi_void &) {}
160static inline quasi_void ?=?(quasi_void &, quasi_void & _src) { return _src; }
161
[b006c51e]162forall( E ) trait Bounded {
163        E lowerBound(void);
164        E upperBound(void);
165};
166
167forall( E | Bounded( E ) ) trait Serial {
168        int fromInstance( E e );
169        E fromInt_unsafe( int i );
170        E succ_unsafe( E e );
171        E pred_unsafe( E e );
172};
173
174forall( E | Serial( E ) ) {
175        E fromInt( int i );
176        E succ( E e );
177        E pred( E e );
178        int Countof( E );
179}
180
181
182forall( E ) trait CfaEnum {
183        const char * label( E e );
184        int posn( E e );
185};
186
187forall( E, V | CfaEnum( E ) ) trait TypedEnum {
188        V value( E e );
189};
190
[a1edafa]191// Local Variables: //
192// mode: c //
193// tab-width: 4 //
194// End: //
Note: See TracBrowser for help on using the repository browser.