source: src/Parser/ExpressionNode.cc@ 2d59d53

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 resolv-new with_gc
Last change on this file since 2d59d53 was 4cb935e, checked in by Thierry Delisle <tdelisle@…>, 9 years ago

0 and 1 now properly parse and resolve to zero_t and one_t respectively
  • Property mode set to 100644
File size: 14.7 KB
Line 
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//
7// ExpressionNode.cc --
8//
9// Author : Rodolfo G. Esteves
10// Created On : Sat May 16 13:17:07 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Fri Sep 16 16:27:44 2016
13// Update Count : 508
14//
15
16#include <cassert>
17#include <cctype>
18#include <climits>
19#include <cstdio>
20#include <algorithm>
21#include <sstream>
22
23#include "ParseNode.h"
24#include "TypeData.h"
25#include "SynTree/Constant.h"
26#include "SynTree/Expression.h"
27#include "SynTree/Declaration.h"
28#include "Common/UnimplementedError.h"
29#include "parseutility.h"
30#include "Common/utility.h"
31
32using namespace std;
33
34//##############################################################################
35
36// Difficult to separate extra parts of constants during lexing because actions are not allow in the middle of patterns:
37//
38// prefix action constant action suffix
39//
40// Alternatively, breaking a pattern using BEGIN does not work if the following pattern can be empty:
41//
42// constant BEGIN CONT ...
43// <CONT>(...)? BEGIN 0 ... // possible empty suffix
44//
45// because the CONT rule is NOT triggered if the pattern is empty. Hence, constants are reparsed here to determine their
46// type.
47
48Type::Qualifiers emptyQualifiers; // no qualifiers on constants
49
50static inline bool checkU( char c ) { return c == 'u' || c == 'U'; }
51static inline bool checkL( char c ) { return c == 'l' || c == 'L'; }
52static inline bool checkF( char c ) { return c == 'f' || c == 'F'; }
53static inline bool checkD( char c ) { return c == 'd' || c == 'D'; }
54static inline bool checkI( char c ) { return c == 'i' || c == 'I'; }
55static inline bool checkX( char c ) { return c == 'x' || c == 'X'; }
56
57Expression *build_constantInteger( const std::string & str ) {
58 static const BasicType::Kind kind[2][3] = {
59 { BasicType::SignedInt, BasicType::LongSignedInt, BasicType::LongLongSignedInt },
60 { BasicType::UnsignedInt, BasicType::LongUnsignedInt, BasicType::LongLongUnsignedInt },
61 };
62 bool dec = true, Unsigned = false; // decimal, unsigned constant
63 int size; // 0 => int, 1 => long, 2 => long long
64 unsigned long long v; // converted integral value
65 size_t last = str.length() - 1; // last character of constant
66
67 if ( str[0] == '0' ) { // octal/hex constant ?
68 dec = false;
69 if ( last != 0 && checkX( str[1] ) ) { // hex constant ?
70 sscanf( (char *)str.c_str(), "%llx", &v );
71 //printf( "%llx %llu\n", v, v );
72 } else { // octal constant
73 sscanf( (char *)str.c_str(), "%llo", &v );
74 //printf( "%llo %llu\n", v, v );
75 } // if
76 } else { // decimal constant ?
77 sscanf( (char *)str.c_str(), "%llu", &v );
78 //printf( "%llu %llu\n", v, v );
79 } // if
80
81 if ( v <= INT_MAX ) { // signed int
82 size = 0;
83 } else if ( v <= UINT_MAX && ! dec ) { // unsigned int
84 size = 0;
85 Unsigned = true; // unsigned
86 } else if ( v <= LONG_MAX ) { // signed long int
87 size = 1;
88 } else if ( v <= ULONG_MAX && ( ! dec || LONG_MAX == LLONG_MAX ) ) { // signed long int
89 size = 1;
90 Unsigned = true; // unsigned long int
91 } else if ( v <= LLONG_MAX ) { // signed long long int
92 size = 2;
93 } else { // unsigned long long int
94 size = 2;
95 Unsigned = true; // unsigned long long int
96 } // if
97
98 if ( checkU( str[last] ) ) { // suffix 'u' ?
99 Unsigned = true;
100 if ( last > 0 && checkL( str[last - 1] ) ) { // suffix 'l' ?
101 size = 1;
102 if ( last > 1 && checkL( str[last - 2] ) ) { // suffix 'll' ?
103 size = 2;
104 } // if
105 } // if
106 } else if ( checkL( str[ last ] ) ) { // suffix 'l' ?
107 size = 1;
108 if ( last > 0 && checkL( str[last - 1] ) ) { // suffix 'll' ?
109 size = 2;
110 if ( last > 1 && checkU( str[last - 2] ) ) { // suffix 'u' ?
111 Unsigned = true;
112 } // if
113 } else {
114 if ( last > 0 && checkU( str[last - 1] ) ) { // suffix 'u' ?
115 Unsigned = true;
116 } // if
117 } // if
118 } // if
119
120 Expression * ret = new ConstantExpr( Constant( new BasicType( emptyQualifiers, kind[Unsigned][size] ), str ) );
121 delete &str; // created by lex
122 return ret;
123} // build_constantInteger
124
125Expression *build_constantFloat( const std::string & str ) {
126 static const BasicType::Kind kind[2][3] = {
127 { BasicType::Float, BasicType::Double, BasicType::LongDouble },
128 { BasicType::FloatComplex, BasicType::DoubleComplex, BasicType::LongDoubleComplex },
129 };
130
131 bool complx = false; // real, complex
132 int size = 1; // 0 => float, 1 => double (default), 2 => long double
133 // floating-point constant has minimum of 2 characters: 1. or .1
134 size_t last = str.length() - 1;
135
136 if ( checkI( str[last] ) ) { // imaginary ?
137 complx = true;
138 last -= 1; // backup one character
139 } // if
140
141 if ( checkF( str[last] ) ) { // float ?
142 size = 0;
143 } else if ( checkD( str[last] ) ) { // double ?
144 size = 1;
145 } else if ( checkL( str[last] ) ) { // long double ?
146 size = 2;
147 } // if
148 if ( ! complx && checkI( str[last - 1] ) ) { // imaginary ?
149 complx = true;
150 } // if
151
152 Expression * ret = new ConstantExpr( Constant( new BasicType( emptyQualifiers, kind[complx][size] ), str ) );
153 delete &str; // created by lex
154 return ret;
155} // build_constantFloat
156
157Expression *build_constantChar( const std::string & str ) {
158 Expression * ret = new ConstantExpr( Constant( new BasicType( emptyQualifiers, BasicType::Char ), str ) );
159 delete &str; // created by lex
160 return ret;
161} // build_constantChar
162
163ConstantExpr *build_constantStr( const std::string & str ) {
164 // string should probably be a primitive type
165 ArrayType *at = new ArrayType( emptyQualifiers, new BasicType( emptyQualifiers, BasicType::Char ),
166 new ConstantExpr( Constant( new BasicType( emptyQualifiers, BasicType::UnsignedInt ),
167 toString( str.size()+1-2 ) ) ), // +1 for '\0' and -2 for '"'
168 false, false );
169 ConstantExpr * ret = new ConstantExpr( Constant( at, str ) );
170 delete &str; // created by lex
171 return ret;
172} // build_constantStr
173
174Expression *build_constantZeroOne( const std::string & str ) {
175 Expression * ret = new ConstantExpr( Constant( str == "0" ? (Type*)new ZeroType( emptyQualifiers ) : (Type*)new OneType( emptyQualifiers ), str ) );
176 delete &str; // created by lex
177 return ret;
178} // build_constantChar
179
180Expression * build_field_name_FLOATINGconstant( const std::string & str ) {
181 // str is of the form A.B -> separate at the . and return member expression
182 int a, b;
183 char dot;
184 std::stringstream ss( str );
185 ss >> a >> dot >> b;
186 UntypedMemberExpr * ret = new UntypedMemberExpr(
187 new ConstantExpr( Constant( new BasicType( emptyQualifiers, BasicType::SignedInt ), toString( b ) ) ),
188 new ConstantExpr( Constant( new BasicType( emptyQualifiers, BasicType::SignedInt ), toString( a ) ) ) );
189 delete &str;
190 return ret;
191} // build_field_name_FLOATINGconstant
192
193Expression * make_field_name_fraction_constants( Expression * fieldName, Expression * fracts ) {
194 if ( fracts ) {
195 if ( UntypedMemberExpr * memberExpr = dynamic_cast< UntypedMemberExpr * >( fracts ) ) {
196 memberExpr->set_member( make_field_name_fraction_constants( fieldName, memberExpr->get_aggregate() ) );
197 return memberExpr;
198 } else {
199 return new UntypedMemberExpr( fracts, fieldName );
200 }
201 }
202 return fieldName;
203} // make_field_name_fraction_constants
204
205Expression * build_field_name_fraction_constants( Expression * fieldName, ExpressionNode * fracts ) {
206 return make_field_name_fraction_constants( fieldName, maybeMoveBuild< Expression >( fracts ) );
207} // build_field_name_fraction_constants
208
209Expression * build_field_name_REALFRACTIONconstant( const std::string & str ) {
210 assert( str[0] == '.' );
211 Expression * ret = build_constantInteger( *new std::string( str.substr(1) ) );
212 delete &str;
213 return ret;
214} // build_field_name_REALFRACTIONconstant
215
216Expression * build_field_name_REALDECIMALconstant( const std::string & str ) {
217 assert( str[str.size()-1] == '.' );
218 Expression * ret = build_constantInteger( *new std::string( str.substr( 0, str.size()-1 ) ) );
219 delete &str;
220 return ret;
221} // build_field_name_REALDECIMALconstant
222
223NameExpr * build_varref( const string *name, bool labelp ) {
224 NameExpr *expr = new NameExpr( *name, nullptr );
225 delete name;
226 return expr;
227}
228
229static const char *OperName[] = {
230 // diadic
231 "SizeOf", "AlignOf", "OffsetOf", "?+?", "?-?", "?*?", "?/?", "?%?", "||", "&&",
232 "?|?", "?&?", "?^?", "Cast", "?<<?", "?>>?", "?<?", "?>?", "?<=?", "?>=?", "?==?", "?!=?",
233 "?=?", "?@=?", "?*=?", "?/=?", "?%=?", "?+=?", "?-=?", "?<<=?", "?>>=?", "?&=?", "?^=?", "?|=?",
234 "?[?]", "...",
235 // monadic
236 "+?", "-?", "AddressOf", "*?", "!?", "~?", "++?", "?++", "--?", "?--", "&&"
237};
238
239Expression *build_cast( DeclarationNode *decl_node, ExpressionNode *expr_node ) {
240 Type *targetType = maybeMoveBuildType( decl_node );
241 if ( dynamic_cast< VoidType * >( targetType ) ) {
242 delete targetType;
243 return new CastExpr( maybeMoveBuild< Expression >(expr_node) );
244 } else {
245 return new CastExpr( maybeMoveBuild< Expression >(expr_node), targetType );
246 } // if
247}
248
249Expression *build_fieldSel( ExpressionNode *expr_node, Expression *member ) {
250 UntypedMemberExpr *ret = new UntypedMemberExpr( member, maybeMoveBuild< Expression >(expr_node) );
251 return ret;
252}
253
254Expression *build_pfieldSel( ExpressionNode *expr_node, Expression *member ) {
255 UntypedExpr *deref = new UntypedExpr( new NameExpr( "*?" ) );
256 deref->get_args().push_back( maybeMoveBuild< Expression >(expr_node) );
257 UntypedMemberExpr *ret = new UntypedMemberExpr( member, deref );
258 return ret;
259}
260
261Expression *build_addressOf( ExpressionNode *expr_node ) {
262 return new AddressExpr( maybeMoveBuild< Expression >(expr_node) );
263}
264Expression *build_sizeOfexpr( ExpressionNode *expr_node ) {
265 return new SizeofExpr( maybeMoveBuild< Expression >(expr_node) );
266}
267Expression *build_sizeOftype( DeclarationNode *decl_node ) {
268 return new SizeofExpr( maybeMoveBuildType( decl_node ) );
269}
270Expression *build_alignOfexpr( ExpressionNode *expr_node ) {
271 return new AlignofExpr( maybeMoveBuild< Expression >(expr_node) );
272}
273Expression *build_alignOftype( DeclarationNode *decl_node ) {
274 return new AlignofExpr( maybeMoveBuildType( decl_node) );
275}
276Expression *build_offsetOf( DeclarationNode *decl_node, NameExpr *member ) {
277 Expression* ret = new UntypedOffsetofExpr( maybeMoveBuildType( decl_node ), member->get_name() );
278 delete member;
279 return ret;
280}
281
282Expression *build_and_or( ExpressionNode *expr_node1, ExpressionNode *expr_node2, bool kind ) {
283 return new LogicalExpr( notZeroExpr( maybeMoveBuild< Expression >(expr_node1) ), notZeroExpr( maybeMoveBuild< Expression >(expr_node2) ), kind );
284}
285
286Expression *build_unary_val( OperKinds op, ExpressionNode *expr_node ) {
287 std::list< Expression * > args;
288 args.push_back( maybeMoveBuild< Expression >(expr_node) );
289 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
290}
291Expression *build_unary_ptr( OperKinds op, ExpressionNode *expr_node ) {
292 std::list< Expression * > args;
293 args.push_back( new AddressExpr( maybeMoveBuild< Expression >(expr_node) ) );
294 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
295}
296Expression *build_binary_val( OperKinds op, ExpressionNode *expr_node1, ExpressionNode *expr_node2 ) {
297 std::list< Expression * > args;
298 args.push_back( maybeMoveBuild< Expression >(expr_node1) );
299 args.push_back( maybeMoveBuild< Expression >(expr_node2) );
300 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
301}
302Expression *build_binary_ptr( OperKinds op, ExpressionNode *expr_node1, ExpressionNode *expr_node2 ) {
303 std::list< Expression * > args;
304 args.push_back( new AddressExpr( maybeMoveBuild< Expression >(expr_node1) ) );
305 args.push_back( maybeMoveBuild< Expression >(expr_node2) );
306 return new UntypedExpr( new NameExpr( OperName[ (int)op ] ), args );
307}
308
309Expression *build_cond( ExpressionNode *expr_node1, ExpressionNode *expr_node2, ExpressionNode *expr_node3 ) {
310 return new ConditionalExpr( notZeroExpr( maybeMoveBuild< Expression >(expr_node1) ), maybeMoveBuild< Expression >(expr_node2), maybeMoveBuild< Expression >(expr_node3) );
311}
312
313Expression *build_comma( ExpressionNode *expr_node1, ExpressionNode *expr_node2 ) {
314 return new CommaExpr( maybeMoveBuild< Expression >(expr_node1), maybeMoveBuild< Expression >(expr_node2) );
315}
316
317Expression *build_attrexpr( NameExpr *var, ExpressionNode * expr_node ) {
318 return new AttrExpr( var, maybeMoveBuild< Expression >(expr_node) );
319}
320Expression *build_attrtype( NameExpr *var, DeclarationNode * decl_node ) {
321 return new AttrExpr( var, maybeMoveBuildType( decl_node ) );
322}
323
324Expression *build_tuple( ExpressionNode * expr_node ) {
325 TupleExpr *ret = new TupleExpr();
326 buildMoveList( expr_node, ret->get_exprs() );
327 return ret;
328}
329
330Expression *build_func( ExpressionNode * function, ExpressionNode * expr_node ) {
331 std::list< Expression * > args;
332 buildMoveList( expr_node, args );
333 return new UntypedExpr( maybeMoveBuild< Expression >(function), args, nullptr );
334}
335
336Expression *build_range( ExpressionNode * low, ExpressionNode *high ) {
337 return new RangeExpr( maybeMoveBuild< Expression >( low ), maybeMoveBuild< Expression >( high ) );
338}
339
340Expression *build_asmexpr( ExpressionNode *inout, ConstantExpr *constraint, ExpressionNode *operand ) {
341 return new AsmExpr( maybeMoveBuild< Expression >( inout ), constraint, maybeMoveBuild< Expression >(operand) );
342}
343
344Expression *build_valexpr( StatementNode *s ) {
345 return new UntypedValofExpr( maybeMoveBuild< Statement >(s), nullptr );
346}
347Expression *build_typevalue( DeclarationNode *decl ) {
348 return new TypeExpr( maybeMoveBuildType( decl ) );
349}
350
351Expression *build_compoundLiteral( DeclarationNode *decl_node, InitializerNode *kids ) {
352 Declaration * newDecl = maybeBuild< Declaration >(decl_node); // compound literal type
353 if ( DeclarationWithType * newDeclWithType = dynamic_cast< DeclarationWithType * >( newDecl ) ) { // non-sue compound-literal type
354 return new CompoundLiteralExpr( newDeclWithType->get_type(), maybeMoveBuild< Initializer >(kids) );
355 // these types do not have associated type information
356 } else if ( StructDecl * newDeclStructDecl = dynamic_cast< StructDecl * >( newDecl ) ) {
357 return new CompoundLiteralExpr( new StructInstType( Type::Qualifiers(), newDeclStructDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
358 } else if ( UnionDecl * newDeclUnionDecl = dynamic_cast< UnionDecl * >( newDecl ) ) {
359 return new CompoundLiteralExpr( new UnionInstType( Type::Qualifiers(), newDeclUnionDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
360 } else if ( EnumDecl * newDeclEnumDecl = dynamic_cast< EnumDecl * >( newDecl ) ) {
361 return new CompoundLiteralExpr( new EnumInstType( Type::Qualifiers(), newDeclEnumDecl->get_name() ), maybeMoveBuild< Initializer >(kids) );
362 } else {
363 assert( false );
364 } // if
365}
366
367// Local Variables: //
368// tab-width: 4 //
369// mode: c++ //
370// compile-command: "make install" //
371// End: //
Note: See TracBrowser for help on using the repository browser.