[2bb4a01] | 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 | // Decl.cpp -- |
---|
| 8 | // |
---|
| 9 | // Author : Aaron B. Moss |
---|
| 10 | // Created On : Thu May 9 10:00:00 2019 |
---|
[7edd5c1] | 11 | // Last Modified By : Andrew Beach |
---|
| 12 | // Last Modified On : Thu May 5 12:10:00 2022 |
---|
| 13 | // Update Count : 24 |
---|
[2bb4a01] | 14 | // |
---|
| 15 | |
---|
| 16 | #include "Decl.hpp" |
---|
| 17 | |
---|
[360b2e13] | 18 | #include <cassert> // for assert, strict_dynamic_cast |
---|
[d76c588] | 19 | #include <iostream> |
---|
[360b2e13] | 20 | #include <unordered_map> |
---|
| 21 | |
---|
[8f06277] | 22 | #include "Common/Eval.h" // for eval |
---|
[87701b6] | 23 | |
---|
[360b2e13] | 24 | #include "Fwd.hpp" // for UniqueId |
---|
[a300e4a] | 25 | #include "Init.hpp" |
---|
[360b2e13] | 26 | #include "Node.hpp" // for readonly |
---|
[87701b6] | 27 | #include "Type.hpp" // for readonly |
---|
[a4a6802] | 28 | #include "Expr.hpp" |
---|
[2bb4a01] | 29 | |
---|
| 30 | namespace ast { |
---|
[a300e4a] | 31 | |
---|
[2bb4a01] | 32 | // To canonicalize declarations |
---|
| 33 | static UniqueId lastUniqueId = 0; |
---|
| 34 | |
---|
| 35 | void Decl::fixUniqueId() { |
---|
| 36 | if ( uniqueId ) return; // ensure only set once |
---|
| 37 | uniqueId = ++lastUniqueId; |
---|
| 38 | } |
---|
[a300e4a] | 39 | |
---|
[8a5530c] | 40 | // --- FunctionDecl |
---|
| 41 | |
---|
[7edd5c1] | 42 | FunctionDecl::FunctionDecl( const CodeLocation & loc, const std::string & name, |
---|
[3e5dd913] | 43 | std::vector<ptr<DeclWithType>>&& params, std::vector<ptr<DeclWithType>>&& returns, |
---|
| 44 | CompoundStmt * stmts, Storage::Classes storage, Linkage::Spec linkage, |
---|
[3e94a23] | 45 | std::vector<ptr<Attribute>>&& attrs, Function::Specs fs, ArgumentFlag isVarArgs ) |
---|
[37273c8] | 46 | : FunctionDecl( loc, name, {}, {}, std::move(params), std::move(returns), |
---|
| 47 | stmts, storage, linkage, std::move(attrs), fs, isVarArgs ) { |
---|
[3e5dd913] | 48 | } |
---|
[490fb92e] | 49 | |
---|
[7edd5c1] | 50 | FunctionDecl::FunctionDecl( const CodeLocation & location, const std::string & name, |
---|
| 51 | std::vector<ptr<TypeDecl>>&& forall, std::vector<ptr<DeclWithType>>&& assertions, |
---|
| 52 | std::vector<ptr<DeclWithType>>&& params, std::vector<ptr<DeclWithType>>&& returns, |
---|
| 53 | CompoundStmt * stmts, Storage::Classes storage, Linkage::Spec linkage, |
---|
[3e94a23] | 54 | std::vector<ptr<Attribute>>&& attrs, Function::Specs fs, ArgumentFlag isVarArgs ) |
---|
[7edd5c1] | 55 | : DeclWithType( location, name, storage, linkage, std::move(attrs), fs ), |
---|
| 56 | type_params( std::move( forall) ), assertions( std::move( assertions ) ), |
---|
[b859f59] | 57 | params( std::move(params) ), returns( std::move(returns) ), |
---|
[7edd5c1] | 58 | type( nullptr ), stmts( stmts ) { |
---|
[3e94a23] | 59 | FunctionType * type = new FunctionType( isVarArgs ); |
---|
[7edd5c1] | 60 | for ( auto & param : this->params ) { |
---|
| 61 | type->params.emplace_back( param->get_type() ); |
---|
| 62 | } |
---|
| 63 | for ( auto & ret : this->returns ) { |
---|
| 64 | type->returns.emplace_back( ret->get_type() ); |
---|
| 65 | } |
---|
| 66 | for ( auto & param : this->type_params ) { |
---|
| 67 | type->forall.emplace_back( new TypeInstType( param ) ); |
---|
| 68 | } |
---|
| 69 | for ( auto & assertion : this->assertions ) { |
---|
| 70 | type->assertions.emplace_back( |
---|
| 71 | new VariableExpr( assertion->location, assertion ) ); |
---|
| 72 | } |
---|
| 73 | this->type = type; |
---|
| 74 | } |
---|
| 75 | |
---|
[490fb92e] | 76 | |
---|
[87701b6] | 77 | const Type * FunctionDecl::get_type() const { return type.get(); } |
---|
[e0e9a0b] | 78 | void FunctionDecl::set_type( const Type * t ) { |
---|
| 79 | type = strict_dynamic_cast< const FunctionType * >( t ); |
---|
| 80 | } |
---|
[8a5530c] | 81 | |
---|
[360b2e13] | 82 | // --- TypeDecl |
---|
| 83 | |
---|
[312029a] | 84 | const char * TypeDecl::typeString() const { |
---|
[6e50a6b] | 85 | static const char * kindNames[] = { "sized data type", "sized data type", "sized object type", "sized function type", "sized tuple type", "sized length value" }; |
---|
[b66d14a] | 86 | static_assert( sizeof(kindNames) / sizeof(kindNames[0]) == TypeDecl::NUMBER_OF_KINDS, "typeString: kindNames is out of sync." ); |
---|
[07de76b] | 87 | assertf( kind < TypeDecl::NUMBER_OF_KINDS, "TypeDecl kind is out of bounds." ); |
---|
[97b47ec] | 88 | // sizeof("sized") includes '\0' and gives the offset to remove "sized ". |
---|
| 89 | return sized ? kindNames[ kind ] : &kindNames[ kind ][ sizeof("sized") ]; |
---|
[360b2e13] | 90 | } |
---|
| 91 | |
---|
[312029a] | 92 | const char * TypeDecl::genTypeString() const { |
---|
[b66d14a] | 93 | static const char * kindNames[] = { "T &", "T *", "T", "(*)", "T ...", "[T]" }; |
---|
| 94 | static_assert( sizeof(kindNames) / sizeof(kindNames[0]) == TypeDecl::NUMBER_OF_KINDS, "genTypeString: kindNames is out of sync." ); |
---|
[07de76b] | 95 | assertf( kind < TypeDecl::NUMBER_OF_KINDS, "TypeDecl kind is out of bounds." ); |
---|
[360b2e13] | 96 | return kindNames[ kind ]; |
---|
| 97 | } |
---|
| 98 | |
---|
[93c10de] | 99 | std::ostream & operator<< ( std::ostream & out, const TypeData & data ) { |
---|
[d76c588] | 100 | return out << data.kind << ", " << data.isComplete; |
---|
| 101 | } |
---|
| 102 | |
---|
[312029a] | 103 | // --- AggregateDecl |
---|
| 104 | |
---|
| 105 | // These must harmonize with the corresponding AggregateDecl::Aggregate enumerations. |
---|
| 106 | static const char * aggregateNames[] = { "struct", "union", "enum", "exception", "trait", "generator", "coroutine", "monitor", "thread", "NoAggregateName" }; |
---|
| 107 | |
---|
| 108 | const char * AggregateDecl::aggrString( AggregateDecl::Aggregate aggr ) { |
---|
| 109 | return aggregateNames[aggr]; |
---|
| 110 | } |
---|
| 111 | |
---|
[a300e4a] | 112 | // --- EnumDecl |
---|
| 113 | |
---|
[9d6e7fa9] | 114 | bool EnumDecl::valueOf( const Decl * enumerator, long long& value ) const { |
---|
[a300e4a] | 115 | if ( enumValues.empty() ) { |
---|
[8f557161] | 116 | Evaluation crntVal = {0, true, true}; // until expression is given, we know to start counting from 0 |
---|
[9d6e7fa9] | 117 | for ( const Decl * member : members ) { |
---|
[a300e4a] | 118 | const ObjectDecl* field = strict_dynamic_cast< const ObjectDecl* >( member ); |
---|
| 119 | if ( field->init ) { |
---|
[87701b6] | 120 | const SingleInit * init = strict_dynamic_cast< const SingleInit* >( field->init.get() ); |
---|
[8f557161] | 121 | crntVal = eval( init->value ); |
---|
| 122 | if ( ! crntVal.isEvaluableInGCC ) { |
---|
[733074e] | 123 | SemanticError( init->location, ::toString( "Non-constexpr in initialization of " |
---|
[a300e4a] | 124 | "enumerator: ", field ) ); |
---|
| 125 | } |
---|
| 126 | } |
---|
| 127 | if ( enumValues.count( field->name ) != 0 ) { |
---|
[733074e] | 128 | SemanticError( location, ::toString( "Enum ", name, " has multiple members with the " "name ", field->name ) ); |
---|
[a300e4a] | 129 | } |
---|
[8f557161] | 130 | if (crntVal.hasKnownValue) { |
---|
| 131 | enumValues[ field->name ] = crntVal.knownValue; |
---|
| 132 | } |
---|
| 133 | ++crntVal.knownValue; |
---|
[a300e4a] | 134 | } |
---|
| 135 | } |
---|
| 136 | |
---|
| 137 | auto it = enumValues.find( enumerator->name ); |
---|
[b859f59] | 138 | |
---|
[a300e4a] | 139 | if ( it != enumValues.end() ) { |
---|
[b859f59] | 140 | |
---|
[f135b50] | 141 | // Handle typed enum by casting the value in (C++) compiler |
---|
[3e54399] | 142 | // if ( base ) { // A typed enum |
---|
| 143 | // if ( const BasicType * bt = dynamic_cast<const BasicType *>(base) ) { |
---|
| 144 | // switch( bt->kind ) { |
---|
| 145 | // case BasicType::Kind::Bool: value = (bool) it->second; break; |
---|
| 146 | // case BasicType::Kind::Char: value = (char) it->second; break; |
---|
| 147 | // case BasicType::Kind::SignedChar: value = (signed char) it->second; break; |
---|
| 148 | // case BasicType::Kind::UnsignedChar: value = (unsigned char) it->second; break; |
---|
| 149 | // case BasicType::Kind::ShortSignedInt: value = (short signed int) it->second; break; |
---|
| 150 | // case BasicType::Kind::SignedInt: value = (signed int) it->second; break; |
---|
| 151 | // case BasicType::Kind::UnsignedInt: value = (unsigned int) it->second; break; |
---|
| 152 | // case BasicType::Kind::LongSignedInt: value = (long signed int) it->second; break; |
---|
| 153 | // case BasicType::Kind::LongUnsignedInt: value = (long unsigned int) it->second; break; |
---|
| 154 | // case BasicType::Kind::LongLongSignedInt: value = (long long signed int) it->second; break; |
---|
[b859f59] | 155 | // case BasicType::Kind::LongLongUnsignedInt: value = (long long unsigned int) it->second; break; |
---|
[3e54399] | 156 | // // TODO: value should be able to handle long long unsigned int |
---|
| 157 | |
---|
| 158 | // default: |
---|
| 159 | // value = it->second; |
---|
| 160 | // } |
---|
| 161 | // } |
---|
| 162 | // } else { |
---|
[f135b50] | 163 | value = it->second; |
---|
[3e54399] | 164 | //} |
---|
[f135b50] | 165 | |
---|
[a300e4a] | 166 | return true; |
---|
| 167 | } |
---|
| 168 | return false; |
---|
| 169 | } |
---|
| 170 | |
---|
[2bb4a01] | 171 | } |
---|
| 172 | |
---|
| 173 | // Local Variables: // |
---|
| 174 | // tab-width: 4 // |
---|
| 175 | // mode: c++ // |
---|
| 176 | // compile-command: "make install" // |
---|
| 177 | // End: // |
---|