source: src/Parser/ExpressionNode.cc@ ee3c93d

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum with_gc
Last change on this file since ee3c93d was 9a705dc8, checked in by Rob Schluntz <rschlunt@…>, 7 years ago

Implement concurrency keyword casts

  • Property mode set to 100644
File size: 20.7 KB
RevLine 
[b87a5ed]1//
2// Cforall Version 1.0.0 Copyright (C) 2015 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//
[0caaa6a]7// ExpressionNode.cc --
8//
[f43df73]9// Author : Peter A. Buhr
[b87a5ed]10// Created On : Sat May 16 13:17:07 2015
[76c62b2]11// Last Modified By : Peter A. Buhr
[dc7db63]12// Last Modified On : Thu Mar 22 11:57:39 2018
13// Update Count : 801
[0caaa6a]14//
[b87a5ed]15
[ea6332d]16#include <cassert> // for assert
[d180746]17#include <stdio.h> // for sscanf, size_t
18#include <climits> // for LLONG_MAX, LONG_MAX, INT_MAX, UINT...
19#include <list> // for list
20#include <sstream> // for basic_istream::operator>>, basic_i...
21#include <string> // for string, operator+, operator==
[51b73452]22
[d180746]23#include "Common/SemanticError.h" // for SemanticError
24#include "Common/utility.h" // for maybeMoveBuild, maybeBuild, CodeLo...
25#include "ParseNode.h" // for ExpressionNode, maybeMoveBuildType
26#include "SynTree/Constant.h" // for Constant
27#include "SynTree/Declaration.h" // for EnumDecl, StructDecl, UnionDecl
28#include "SynTree/Expression.h" // for Expression, ConstantExpr, NameExpr
29#include "SynTree/Statement.h" // for CompoundStmt, Statement
30#include "SynTree/Type.h" // for BasicType, Type, Type::Qualifiers
31#include "parserutility.h" // for notZeroExpr
32
33class Initializer;
[51b73452]34
35using namespace std;
36
[cd623a4]37//##############################################################################
38
[7bf7fb9]39// Difficult to separate extra parts of constants during lexing because actions are not allow in the middle of patterns:
40//
41// prefix action constant action suffix
42//
43// Alternatively, breaking a pattern using BEGIN does not work if the following pattern can be empty:
44//
45// constant BEGIN CONT ...
46// <CONT>(...)? BEGIN 0 ... // possible empty suffix
47//
48// because the CONT rule is NOT triggered if the pattern is empty. Hence, constants are reparsed here to determine their
49// type.
50
[beec62c]51extern const Type::Qualifiers noQualifiers; // no qualifiers on constants
[7bf7fb9]52
[930f69e]53static inline bool checkH( char c ) { return c == 'h' || c == 'H'; }
[7bf7fb9]54static inline bool checkL( char c ) { return c == 'l' || c == 'L'; }
[930f69e]55static inline bool checkZ( char c ) { return c == 'z' || c == 'Z'; }
56static inline bool checkU( char c ) { return c == 'u' || c == 'U'; }
[7bf7fb9]57static inline bool checkF( char c ) { return c == 'f' || c == 'F'; }
58static inline bool checkD( char c ) { return c == 'd' || c == 'D'; }
59static inline bool checkI( char c ) { return c == 'i' || c == 'I'; }
[0a2168f]60static inline bool checkB( char c ) { return c == 'b' || c == 'B'; }
[7bf7fb9]61static inline bool checkX( char c ) { return c == 'x' || c == 'X'; }
62
[201aeb9]63static const char * lnthsInt[2][6] = {
64 { "int8_t", "int16_t", "int32_t", "int64_t", "size_t", },
65 { "uint8_t", "uint16_t", "uint32_t", "uint64_t", "size_t", }
66}; // lnthsInt
67
68static inline void checkLNInt( string & str, int & lnth, int & size ) {
69 string::size_type posn = str.find_first_of( "lL" ), start = posn;
70 if ( posn == string::npos ) return;
71 size = 4; // assume largest size
72 posn += 1; // advance to size
73 if ( str[posn] == '8' ) { // 8
74 lnth = 0;
75 } else if ( str[posn] == '1' ) {
76 posn += 1;
77 if ( str[posn] == '6' ) { // 16
78 lnth = 1;
79 } else { // 128
80 posn += 1;
81 lnth = 5;
82 } // if
83 } else {
84 if ( str[posn] == '3' ) { // 32
85 lnth = 2;
86 } else if ( str[posn] == '6' ) { // 64
87 lnth = 3;
88 } else {
89 assertf( false, "internal error, bad integral length %s", str.c_str() );
[bf4b4cf]90 } // if
[201aeb9]91 posn += 1;
92 } // if
93 str.erase( start, posn - start + 1 ); // remove length suffix
94} // checkLNInt
95
[ba2a68b]96Expression * build_constantInteger( string & str ) {
[201aeb9]97 static const BasicType::Kind kind[2][6] = {
[930f69e]98 // short (h) must be before char (hh)
[201aeb9]99 { BasicType::ShortSignedInt, BasicType::SignedChar, BasicType::SignedInt, BasicType::LongSignedInt, BasicType::LongLongSignedInt, BasicType::SignedInt128, },
100 { BasicType::ShortUnsignedInt, BasicType::UnsignedChar, BasicType::UnsignedInt, BasicType::LongUnsignedInt, BasicType::LongLongUnsignedInt, BasicType::UnsignedInt128, },
[7bf7fb9]101 };
[76c62b2]102
[7bf7fb9]103 bool dec = true, Unsigned = false; // decimal, unsigned constant
[201aeb9]104 int size; // 0 => short, 1 => char, 2 => int, 3 => long int, 4 => long long int, 5 => int128
105 int lnth = -1; // literal length
106
[6165ce7]107 unsigned long long int v; // converted integral value
[0a2168f]108 size_t last = str.length() - 1; // last subscript of constant
[6165ce7]109 Expression * ret;
[7bf7fb9]110
[6165ce7]111 // special constants
112 if ( str == "0" ) {
113 ret = new ConstantExpr( Constant( (Type *)new ZeroType( noQualifiers ), str, (unsigned long long int)0 ) );
114 goto CLEANUP;
115 } // if
116 if ( str == "1" ) {
117 ret = new ConstantExpr( Constant( (Type *)new OneType( noQualifiers ), str, (unsigned long long int)1 ) );
118 goto CLEANUP;
119 } // if
[ea6332d]120
[0a2168f]121 // Cannot be "0"
122
123 if ( str[0] == '0' ) { // radix character ?
[7bf7fb9]124 dec = false;
[0a2168f]125 if ( checkX( str[1] ) ) { // hex constant ?
[7bf7fb9]126 sscanf( (char *)str.c_str(), "%llx", &v );
127 //printf( "%llx %llu\n", v, v );
[0a2168f]128 } else if ( checkB( str[1] ) ) { // binary constant ?
129 v = 0;
130 for ( unsigned int i = 2;; i += 1 ) { // compute value
131 if ( str[i] == '1' ) v |= 1;
132 if ( i == last ) break;
133 v <<= 1;
134 } // for
135 //printf( "%llx %llu\n", v, v );
[7bf7fb9]136 } else { // octal constant
137 sscanf( (char *)str.c_str(), "%llo", &v );
138 //printf( "%llo %llu\n", v, v );
139 } // if
140 } else { // decimal constant ?
141 sscanf( (char *)str.c_str(), "%llu", &v );
142 //printf( "%llu %llu\n", v, v );
143 } // if
144
145 if ( v <= INT_MAX ) { // signed int
[930f69e]146 size = 2;
[7bf7fb9]147 } else if ( v <= UINT_MAX && ! dec ) { // unsigned int
[930f69e]148 size = 2;
[7bf7fb9]149 Unsigned = true; // unsigned
150 } else if ( v <= LONG_MAX ) { // signed long int
[930f69e]151 size = 3;
[7bf7fb9]152 } else if ( v <= ULONG_MAX && ( ! dec || LONG_MAX == LLONG_MAX ) ) { // signed long int
[930f69e]153 size = 3;
[7bf7fb9]154 Unsigned = true; // unsigned long int
155 } else if ( v <= LLONG_MAX ) { // signed long long int
[930f69e]156 size = 4;
[7bf7fb9]157 } else { // unsigned long long int
[930f69e]158 size = 4;
[7bf7fb9]159 Unsigned = true; // unsigned long long int
160 } // if
161
[930f69e]162 // At least one digit in integer constant, so safe to backup while looking for suffix.
163
[7bf7fb9]164 if ( checkU( str[last] ) ) { // suffix 'u' ?
165 Unsigned = true;
[930f69e]166 if ( checkL( str[last - 1] ) ) { // suffix 'l' ?
167 size = 3;
168 if ( checkL( str[last - 2] ) ) { // suffix "ll" ?
169 size = 4;
[7bf7fb9]170 } // if
[930f69e]171 } else if ( checkH( str[last - 1] ) ) { // suffix 'h' ?
172 size = 0;
173 if ( checkH( str[last - 2] ) ) { // suffix "hh" ?
174 size = 1;
175 } // if
176 str.erase( last - size - 1, size + 1 ); // remove 'h'/"hh"
[201aeb9]177 } else { // suffix "ln" ?
178 checkLNInt( str, lnth, size );
[7bf7fb9]179 } // if
180 } else if ( checkL( str[ last ] ) ) { // suffix 'l' ?
[930f69e]181 size = 3;
182 if ( checkL( str[last - 1] ) ) { // suffix 'll' ?
183 size = 4;
184 if ( checkU( str[last - 2] ) ) { // suffix 'u' ?
[7bf7fb9]185 Unsigned = true;
186 } // if
[930f69e]187 } else if ( checkU( str[last - 1] ) ) { // suffix 'u' ?
188 Unsigned = true;
189 } // if
190 } else if ( checkH( str[ last ] ) ) { // suffix 'h' ?
191 size = 0;
192 if ( checkH( str[last - 1] ) ) { // suffix "hh" ?
193 size = 1;
194 if ( checkU( str[last - 2] ) ) { // suffix 'u' ?
[7bf7fb9]195 Unsigned = true;
196 } // if
[930f69e]197 } else if ( checkU( str[last - 1] ) ) { // suffix 'u' ?
198 Unsigned = true;
[7bf7fb9]199 } // if
[930f69e]200 str.erase( last - size, size + 1 ); // remove 'h'/"hh"
201 } else if ( checkZ( str[last] ) ) { // suffix 'z' ?
[201aeb9]202 lnth = 4;
[930f69e]203 str.erase( last, 1 ); // remove 'z'
[201aeb9]204 } else { // suffix "ln" ?
205 checkLNInt( str, lnth, size );
[7bf7fb9]206 } // if
207
[201aeb9]208 assert( 0 <= size && size < 6 );
[a6c5d7c]209 // Constant type is correct for overload resolving.
[e8ccca3]210 ret = new ConstantExpr( Constant( new BasicType( noQualifiers, kind[Unsigned][size] ), str, v ) );
[a6c5d7c]211 if ( Unsigned && size < 2 ) { // hh or h, less than int ?
[201aeb9]212 // int i = -1uh => 65535 not -1, so cast is necessary for unsigned, which unfortunately eliminates warnings for large values.
[c0bf94e]213 ret = new CastExpr( ret, new BasicType( Type::Qualifiers(), kind[Unsigned][size] ), false );
[201aeb9]214 } else if ( lnth != -1 ) { // explicit length ?
215 if ( lnth == 5 ) { // int128 ?
216 size = 5;
[c0bf94e]217 ret = new CastExpr( ret, new BasicType( Type::Qualifiers(), kind[Unsigned][size] ), false );
[201aeb9]218 } else {
[c0bf94e]219 ret = new CastExpr( ret, new TypeInstType( Type::Qualifiers(), lnthsInt[Unsigned][lnth], false ), false );
[201aeb9]220 } // if
[7b1d5ec]221 } // if
[6165ce7]222 CLEANUP:
[e8ccca3]223
[ab57786]224 delete &str; // created by lex
225 return ret;
[7bf7fb9]226} // build_constantInteger
[51b73452]227
[201aeb9]228
229static inline void checkLNFloat( string & str, int & lnth, int & size ) {
230 string::size_type posn = str.find_first_of( "lL" ), start = posn;
231 if ( posn == string::npos ) return;
232 size = 2; // assume largest size
233 lnth = 0;
234 posn += 1; // advance to size
235 if ( str[posn] == '3' ) { // 32
236 size = 0;
237 } else if ( str[posn] == '6' ) { // 64
238 size = 1;
239 } else if ( str[posn] == '8' || str[posn] == '1' ) { // 80, 128
240 size = 2;
241 if ( str[posn] == '1' ) posn += 1;
242 } else {
243 assertf( false, "internal error, bad floating point length %s", str.c_str() );
244 } // if
245 posn += 1;
246 str.erase( start, posn - start + 1 ); // remove length suffix
247} // checkLNFloat
248
249
[f43df73]250Expression * build_constantFloat( string & str ) {
[7bf7fb9]251 static const BasicType::Kind kind[2][3] = {
252 { BasicType::Float, BasicType::Double, BasicType::LongDouble },
253 { BasicType::FloatComplex, BasicType::DoubleComplex, BasicType::LongDoubleComplex },
254 };
[59c24b6]255
[7bf7fb9]256 bool complx = false; // real, complex
[201aeb9]257 int size = 1; // 0 => float, 1 => double, 2 => long double
258 int lnth = -1; // literal length
[7bf7fb9]259 // floating-point constant has minimum of 2 characters: 1. or .1
260 size_t last = str.length() - 1;
[d56e5bc]261 double v;
262
263 sscanf( str.c_str(), "%lg", &v );
[51b73452]264
[7bf7fb9]265 if ( checkI( str[last] ) ) { // imaginary ?
266 complx = true;
267 last -= 1; // backup one character
268 } // if
[0caaa6a]269
[7bf7fb9]270 if ( checkF( str[last] ) ) { // float ?
271 size = 0;
272 } else if ( checkD( str[last] ) ) { // double ?
273 size = 1;
274 } else if ( checkL( str[last] ) ) { // long double ?
275 size = 2;
[201aeb9]276 } else {
277 size = 1; // double (default)
278 checkLNFloat( str, lnth, size );
[7bf7fb9]279 } // if
280 if ( ! complx && checkI( str[last - 1] ) ) { // imaginary ?
281 complx = true;
282 } // if
[51b73452]283
[201aeb9]284 assert( 0 <= size && size < 3 );
[e8ccca3]285 Expression * ret = new ConstantExpr( Constant( new BasicType( noQualifiers, kind[complx][size] ), str, v ) );
[201aeb9]286 if ( lnth != -1 ) { // explicit length ?
[c0bf94e]287 ret = new CastExpr( ret, new BasicType( Type::Qualifiers(), kind[complx][size] ), false );
[201aeb9]288 } // if
[76c62b2]289
[ab57786]290 delete &str; // created by lex
291 return ret;
[7bf7fb9]292} // build_constantFloat
[51b73452]293
[76c62b2]294static void sepString( string & str, string & units, char delimit ) {
295 string::size_type posn = str.find_last_of( delimit ) + 1;
296 if ( posn != str.length() ) {
[e8ccca3]297 units = "?" + str.substr( posn ); // extract units
[76c62b2]298 str.erase( posn ); // remove units
299 } // if
300} // sepString
301
[f43df73]302Expression * build_constantChar( string & str ) {
[76c62b2]303 string units; // units
304 sepString( str, units, '\'' ); // separate constant from units
305
[e8ccca3]306 Expression * ret = new ConstantExpr( Constant( new BasicType( noQualifiers, BasicType::Char ), str, (unsigned long long int)(unsigned char)str[1] ) );
307 if ( units.length() != 0 ) {
[ba2a68b]308 ret = new UntypedExpr( new NameExpr( units ), { ret } );
[e8ccca3]309 } // if
[76c62b2]310
[ab57786]311 delete &str; // created by lex
312 return ret;
[7bf7fb9]313} // build_constantChar
[51b73452]314
[e612146c]315Expression * build_constantStr( string & str ) {
[76c62b2]316 string units; // units
317 sepString( str, units, '"' ); // separate constant from units
318
[513e165]319 Type * strtype;
320 switch ( str[0] ) { // str has >= 2 characters, i.e, null string "" => safe to look at subscripts 0/1
[e612146c]321 case 'u':
[513e165]322 if ( str[1] == '8' ) goto Default; // utf-8 characters => array of char
323 // lookup type of associated typedef
324 strtype = new TypeInstType( Type::Qualifiers( Type::Const ), "char16_t", false );
[e612146c]325 break;
326 case 'U':
[513e165]327 strtype = new TypeInstType( Type::Qualifiers( Type::Const ), "char32_t", false );
[e612146c]328 break;
329 case 'L':
[513e165]330 strtype = new TypeInstType( Type::Qualifiers( Type::Const ), "wchar_t", false );
[e612146c]331 break;
[513e165]332 Default: // char default string type
333 default:
334 strtype = new BasicType( Type::Qualifiers( Type::Const ), BasicType::Char );
[e612146c]335 } // switch
[513e165]336 ArrayType * at = new ArrayType( noQualifiers, strtype,
[e8ccca3]337 new ConstantExpr( Constant::from_ulong( str.size() + 1 - 2 ) ), // +1 for '\0' and -2 for '"'
338 false, false );
[e612146c]339 Expression * ret = new ConstantExpr( Constant( at, str, (unsigned long long int)0 ) ); // constant 0 is ignored for pure string value
340 if ( units.length() != 0 ) {
341 ret = new UntypedExpr( new NameExpr( units ), { ret } );
342 } // if
[5809461]343
[ab57786]344 delete &str; // created by lex
345 return ret;
[7bf7fb9]346} // build_constantStr
[51b73452]347
[930f69e]348Expression * build_field_name_FLOATING_FRACTIONconstant( const string & str ) {
[a16764a6]349 if ( str.find_first_not_of( "0123456789", 1 ) != string::npos ) SemanticError( yylloc, "invalid tuple index " + str );
[930f69e]350 Expression * ret = build_constantInteger( *new string( str.substr(1) ) );
351 delete &str;
352 return ret;
353} // build_field_name_FLOATING_FRACTIONconstant
354
355Expression * build_field_name_FLOATING_DECIMALconstant( const string & str ) {
[a16764a6]356 if ( str[str.size()-1] != '.' ) SemanticError( yylloc, "invalid tuple index " + str );
[930f69e]357 Expression * ret = build_constantInteger( *new string( str.substr( 0, str.size()-1 ) ) );
358 delete &str;
359 return ret;
360} // build_field_name_FLOATING_DECIMALconstant
361
[f43df73]362Expression * build_field_name_FLOATINGconstant( const string & str ) {
[8780e30]363 // str is of the form A.B -> separate at the . and return member expression
364 int a, b;
365 char dot;
[f43df73]366 stringstream ss( str );
[8780e30]367 ss >> a >> dot >> b;
[d56e5bc]368 UntypedMemberExpr * ret = new UntypedMemberExpr( new ConstantExpr( Constant::from_int( b ) ), new ConstantExpr( Constant::from_int( a ) ) );
[8780e30]369 delete &str;
370 return ret;
371} // build_field_name_FLOATINGconstant
372
373Expression * make_field_name_fraction_constants( Expression * fieldName, Expression * fracts ) {
374 if ( fracts ) {
375 if ( UntypedMemberExpr * memberExpr = dynamic_cast< UntypedMemberExpr * >( fracts ) ) {
376 memberExpr->set_member( make_field_name_fraction_constants( fieldName, memberExpr->get_aggregate() ) );
377 return memberExpr;
378 } else {
379 return new UntypedMemberExpr( fracts, fieldName );
[f43df73]380 } // if
381 } // if
[8780e30]382 return fieldName;
383} // make_field_name_fraction_constants
384
385Expression * build_field_name_fraction_constants( Expression * fieldName, ExpressionNode * fracts ) {
386 return make_field_name_fraction_constants( fieldName, maybeMoveBuild< Expression >( fracts ) );
387} // build_field_name_fraction_constants
388
[a2e0687]389NameExpr * build_varref( const string * name ) {
[bf4b4cf]390 NameExpr * expr = new NameExpr( *name );
[7ecbb7e]391 delete name;
392 return expr;
[a2e0687]393} // build_varref
[51b1202]394
[5809461]395// TODO: get rid of this and OperKinds and reuse code from OperatorTable
[a2e0687]396static const char * OperName[] = { // must harmonize with OperKinds
[5721a6d]397 // diadic
[e5f2a67]398 "SizeOf", "AlignOf", "OffsetOf", "?+?", "?-?", "?\\?", "?*?", "?/?", "?%?", "||", "&&",
[5721a6d]399 "?|?", "?&?", "?^?", "Cast", "?<<?", "?>>?", "?<?", "?>?", "?<=?", "?>=?", "?==?", "?!=?",
[e5f2a67]400 "?=?", "?@=?", "?\\=?", "?*=?", "?/=?", "?%=?", "?+=?", "?-=?", "?<<=?", "?>>=?", "?&=?", "?^=?", "?|=?",
[d9e2280]401 "?[?]", "...",
[5721a6d]402 // monadic
[5809461]403 "+?", "-?", "AddressOf", "*?", "!?", "~?", "++?", "?++", "--?", "?--",
[a2e0687]404}; // OperName
[5721a6d]405
[a2e0687]406Expression * build_cast( DeclarationNode * decl_node, ExpressionNode * expr_node ) {
407 Type * targetType = maybeMoveBuildType( decl_node );
[d1625f8]408 if ( dynamic_cast< VoidType * >( targetType ) ) {
[064e3ff]409 delete targetType;
[c0bf94e]410 return new CastExpr( maybeMoveBuild< Expression >(expr_node), false );
[064e3ff]411 } else {
[c0bf94e]412 return new CastExpr( maybeMoveBuild< Expression >(expr_node), targetType, false );
[064e3ff]413 } // if
[a2e0687]414} // build_cast
[a5f0529]415
[9a705dc8]416Expression * build_keyword_cast( KeywordCastExpr::Target target, ExpressionNode * expr_node ) {
417 return new KeywordCastExpr( maybeMoveBuild< Expression >(expr_node), target );
418}
419
[a2e0687]420Expression * build_virtual_cast( DeclarationNode * decl_node, ExpressionNode * expr_node ) {
[513e165]421 return new VirtualCastExpr( maybeMoveBuild< Expression >( expr_node ), maybeMoveBuildType( decl_node ) );
[a2e0687]422} // build_virtual_cast
[064e3ff]423
[a2e0687]424Expression * build_fieldSel( ExpressionNode * expr_node, Expression * member ) {
[513e165]425 return new UntypedMemberExpr( member, maybeMoveBuild< Expression >(expr_node) );
[a2e0687]426} // build_fieldSel
[064e3ff]427
[a2e0687]428Expression * build_pfieldSel( ExpressionNode * expr_node, Expression * member ) {
429 UntypedExpr * deref = new UntypedExpr( new NameExpr( "*?" ) );
[64ac636]430 deref->location = expr_node->location;
[7ecbb7e]431 deref->get_args().push_back( maybeMoveBuild< Expression >(expr_node) );
[a2e0687]432 UntypedMemberExpr * ret = new UntypedMemberExpr( member, deref );
[064e3ff]433 return ret;
[a2e0687]434} // build_pfieldSel
[064e3ff]435
[a2e0687]436Expression * build_offsetOf( DeclarationNode * decl_node, NameExpr * member ) {
[a7c90d4]437 Expression * ret = new UntypedOffsetofExpr( maybeMoveBuildType( decl_node ), member->get_name() );
[ac71a86]438 delete member;
439 return ret;
[a2e0687]440} // build_offsetOf
[064e3ff]441
[a2e0687]442Expression * build_and_or( ExpressionNode * expr_node1, ExpressionNode * expr_node2, bool kind ) {
[7ecbb7e]443 return new LogicalExpr( notZeroExpr( maybeMoveBuild< Expression >(expr_node1) ), notZeroExpr( maybeMoveBuild< Expression >(expr_node2) ), kind );
[a2e0687]444} // build_and_or
[51e076e]445
[a2e0687]446Expression * build_unary_val( OperKinds op, ExpressionNode * expr_node ) {
[f43df73]447 list< Expression * > args;
[7ecbb7e]448 args.push_back( maybeMoveBuild< Expression >(expr_node) );
[d9e2280]449 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
[a2e0687]450} // build_unary_val
451
452Expression * build_unary_ptr( OperKinds op, ExpressionNode * expr_node ) {
[f43df73]453 list< Expression * > args;
[cccc534]454 args.push_back( maybeMoveBuild< Expression >(expr_node) ); // xxx -- this is exactly the same as the val case now, refactor this code.
[d9e2280]455 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
[a2e0687]456} // build_unary_ptr
457
458Expression * build_binary_val( OperKinds op, ExpressionNode * expr_node1, ExpressionNode * expr_node2 ) {
[f43df73]459 list< Expression * > args;
[7ecbb7e]460 args.push_back( maybeMoveBuild< Expression >(expr_node1) );
461 args.push_back( maybeMoveBuild< Expression >(expr_node2) );
[d9e2280]462 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
[a2e0687]463} // build_binary_val
464
465Expression * build_binary_ptr( OperKinds op, ExpressionNode * expr_node1, ExpressionNode * expr_node2 ) {
[f43df73]466 list< Expression * > args;
[cda7889]467 args.push_back( maybeMoveBuild< Expression >(expr_node1) );
[7ecbb7e]468 args.push_back( maybeMoveBuild< Expression >(expr_node2) );
[d9e2280]469 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
[a2e0687]470} // build_binary_ptr
[51e076e]471
[a2e0687]472Expression * build_cond( ExpressionNode * expr_node1, ExpressionNode * expr_node2, ExpressionNode * expr_node3 ) {
[7ecbb7e]473 return new ConditionalExpr( notZeroExpr( maybeMoveBuild< Expression >(expr_node1) ), maybeMoveBuild< Expression >(expr_node2), maybeMoveBuild< Expression >(expr_node3) );
[a2e0687]474} // build_cond
[51e076e]475
[a2e0687]476Expression * build_tuple( ExpressionNode * expr_node ) {
[f43df73]477 list< Expression * > exprs;
[907eccb]478 buildMoveList( expr_node, exprs );
479 return new UntypedTupleExpr( exprs );;
[a2e0687]480} // build_tuple
[9706554]481
[a2e0687]482Expression * build_func( ExpressionNode * function, ExpressionNode * expr_node ) {
[f43df73]483 list< Expression * > args;
[7ecbb7e]484 buildMoveList( expr_node, args );
[bf4b4cf]485 return new UntypedExpr( maybeMoveBuild< Expression >(function), args );
[a2e0687]486} // build_func
[9706554]487
[a2e0687]488Expression * build_compoundLiteral( DeclarationNode * decl_node, InitializerNode * kids ) {
[7880579]489 Declaration * newDecl = maybeBuild< Declaration >(decl_node); // compound literal type
[630a82a]490 if ( DeclarationWithType * newDeclWithType = dynamic_cast< DeclarationWithType * >( newDecl ) ) { // non-sue compound-literal type
[7ecbb7e]491 return new CompoundLiteralExpr( newDeclWithType->get_type(), maybeMoveBuild< Initializer >(kids) );
[630a82a]492 // these types do not have associated type information
493 } else if ( StructDecl * newDeclStructDecl = dynamic_cast< StructDecl * >( newDecl ) ) {
[fbcde64]494 if ( newDeclStructDecl->has_body() ) {
495 return new CompoundLiteralExpr( new StructInstType( Type::Qualifiers(), newDeclStructDecl ), maybeMoveBuild< Initializer >(kids) );
496 } else {
497 return new CompoundLiteralExpr( new StructInstType( Type::Qualifiers(), newDeclStructDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
498 } // if
[630a82a]499 } else if ( UnionDecl * newDeclUnionDecl = dynamic_cast< UnionDecl * >( newDecl ) ) {
[fbcde64]500 if ( newDeclUnionDecl->has_body() ) {
501 return new CompoundLiteralExpr( new UnionInstType( Type::Qualifiers(), newDeclUnionDecl ), maybeMoveBuild< Initializer >(kids) );
502 } else {
503 return new CompoundLiteralExpr( new UnionInstType( Type::Qualifiers(), newDeclUnionDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
504 } // if
[630a82a]505 } else if ( EnumDecl * newDeclEnumDecl = dynamic_cast< EnumDecl * >( newDecl ) ) {
[fbcde64]506 if ( newDeclEnumDecl->has_body() ) {
507 return new CompoundLiteralExpr( new EnumInstType( Type::Qualifiers(), newDeclEnumDecl ), maybeMoveBuild< Initializer >(kids) );
508 } else {
509 return new CompoundLiteralExpr( new EnumInstType( Type::Qualifiers(), newDeclEnumDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
510 } // if
[630a82a]511 } else {
512 assert( false );
513 } // if
[a2e0687]514} // build_compoundLiteral
[630a82a]515
[b87a5ed]516// Local Variables: //
517// tab-width: 4 //
518// mode: c++ //
519// compile-command: "make install" //
520// End: //
Note: See TracBrowser for help on using the repository browser.