[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
|
---|
[312029a] | 11 | // Last Modified By : Peter A. Buhr
|
---|
[20207c0] | 12 | // Last Modified On : Tue Jan 12 16:54:55 2021
|
---|
| 13 | // Update Count : 23
|
---|
[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 |
|
---|
[87701b6] | 22 | #include "Common/utility.h"
|
---|
| 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
|
---|
[2bb4a01] | 28 |
|
---|
| 29 | namespace ast {
|
---|
[a300e4a] | 30 |
|
---|
[2bb4a01] | 31 | // To canonicalize declarations
|
---|
| 32 | static UniqueId lastUniqueId = 0;
|
---|
| 33 |
|
---|
| 34 | using IdMapType = std::unordered_map< UniqueId, readonly<Decl> >;
|
---|
| 35 | static IdMapType idMap;
|
---|
| 36 |
|
---|
| 37 | void Decl::fixUniqueId() {
|
---|
| 38 | if ( uniqueId ) return; // ensure only set once
|
---|
| 39 | uniqueId = ++lastUniqueId;
|
---|
| 40 | idMap[ uniqueId ] = this;
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | readonly<Decl> Decl::fromId( UniqueId id ) {
|
---|
| 44 | IdMapType::const_iterator i = idMap.find( id );
|
---|
| 45 | if ( i != idMap.end() ) return i->second;
|
---|
| 46 | return {};
|
---|
| 47 | }
|
---|
[a300e4a] | 48 |
|
---|
[8a5530c] | 49 | // --- FunctionDecl
|
---|
| 50 |
|
---|
[490fb92e] | 51 | FunctionDecl::FunctionDecl( const CodeLocation & loc, const std::string & name,
|
---|
[3e5dd913] | 52 | std::vector<ptr<TypeDecl>>&& forall,
|
---|
| 53 | std::vector<ptr<DeclWithType>>&& params, std::vector<ptr<DeclWithType>>&& returns,
|
---|
| 54 | CompoundStmt * stmts, Storage::Classes storage, Linkage::Spec linkage,
|
---|
| 55 | std::vector<ptr<Attribute>>&& attrs, Function::Specs fs, bool isVarArgs)
|
---|
| 56 | : DeclWithType( loc, name, storage, linkage, std::move(attrs), fs ), params(std::move(params)), returns(std::move(returns)),
|
---|
| 57 | type_params(std::move(forall)), stmts( stmts ) {
|
---|
| 58 | FunctionType * ftype = new FunctionType(static_cast<ArgumentFlag>(isVarArgs));
|
---|
| 59 | for (auto & param : this->params) {
|
---|
| 60 | ftype->params.emplace_back(param->get_type());
|
---|
| 61 | }
|
---|
| 62 | for (auto & ret : this->returns) {
|
---|
| 63 | ftype->returns.emplace_back(ret->get_type());
|
---|
| 64 | }
|
---|
| 65 | for (auto & tp : this->type_params) {
|
---|
| 66 | ftype->forall.emplace_back(new TypeInstType(tp->name, tp));
|
---|
| 67 | }
|
---|
| 68 | this->type = ftype;
|
---|
| 69 | }
|
---|
[490fb92e] | 70 |
|
---|
| 71 |
|
---|
[87701b6] | 72 | const Type * FunctionDecl::get_type() const { return type.get(); }
|
---|
[e0e9a0b] | 73 | void FunctionDecl::set_type( const Type * t ) {
|
---|
| 74 | type = strict_dynamic_cast< const FunctionType * >( t );
|
---|
| 75 | }
|
---|
[8a5530c] | 76 |
|
---|
[360b2e13] | 77 | // --- TypeDecl
|
---|
| 78 |
|
---|
[312029a] | 79 | const char * TypeDecl::typeString() const {
|
---|
[6e50a6b] | 80 | static const char * kindNames[] = { "sized data type", "sized data type", "sized object type", "sized function type", "sized tuple type", "sized length value" };
|
---|
[b66d14a] | 81 | static_assert( sizeof(kindNames) / sizeof(kindNames[0]) == TypeDecl::NUMBER_OF_KINDS, "typeString: kindNames is out of sync." );
|
---|
[07de76b] | 82 | assertf( kind < TypeDecl::NUMBER_OF_KINDS, "TypeDecl kind is out of bounds." );
|
---|
[312029a] | 83 | return sized ? kindNames[ kind ] : &kindNames[ kind ][ sizeof("sized") ]; // sizeof includes '\0'
|
---|
[360b2e13] | 84 | }
|
---|
| 85 |
|
---|
[312029a] | 86 | const char * TypeDecl::genTypeString() const {
|
---|
[b66d14a] | 87 | static const char * kindNames[] = { "T &", "T *", "T", "(*)", "T ...", "[T]" };
|
---|
| 88 | static_assert( sizeof(kindNames) / sizeof(kindNames[0]) == TypeDecl::NUMBER_OF_KINDS, "genTypeString: kindNames is out of sync." );
|
---|
[07de76b] | 89 | assertf( kind < TypeDecl::NUMBER_OF_KINDS, "TypeDecl kind is out of bounds." );
|
---|
[360b2e13] | 90 | return kindNames[ kind ];
|
---|
| 91 | }
|
---|
| 92 |
|
---|
[d76c588] | 93 | std::ostream & operator<< ( std::ostream & out, const TypeDecl::Data & data ) {
|
---|
| 94 | return out << data.kind << ", " << data.isComplete;
|
---|
| 95 | }
|
---|
| 96 |
|
---|
[312029a] | 97 | // --- AggregateDecl
|
---|
| 98 |
|
---|
| 99 | // These must harmonize with the corresponding AggregateDecl::Aggregate enumerations.
|
---|
| 100 | static const char * aggregateNames[] = { "struct", "union", "enum", "exception", "trait", "generator", "coroutine", "monitor", "thread", "NoAggregateName" };
|
---|
| 101 |
|
---|
| 102 | const char * AggregateDecl::aggrString( AggregateDecl::Aggregate aggr ) {
|
---|
| 103 | return aggregateNames[aggr];
|
---|
| 104 | }
|
---|
| 105 |
|
---|
[a300e4a] | 106 | // --- EnumDecl
|
---|
| 107 |
|
---|
[9d6e7fa9] | 108 | bool EnumDecl::valueOf( const Decl * enumerator, long long& value ) const {
|
---|
[a300e4a] | 109 | if ( enumValues.empty() ) {
|
---|
| 110 | long long crntVal = 0;
|
---|
[9d6e7fa9] | 111 | for ( const Decl * member : members ) {
|
---|
[a300e4a] | 112 | const ObjectDecl* field = strict_dynamic_cast< const ObjectDecl* >( member );
|
---|
| 113 | if ( field->init ) {
|
---|
[87701b6] | 114 | const SingleInit * init = strict_dynamic_cast< const SingleInit* >( field->init.get() );
|
---|
[a300e4a] | 115 | auto result = eval( init->value );
|
---|
| 116 | if ( ! result.second ) {
|
---|
[733074e] | 117 | SemanticError( init->location, ::toString( "Non-constexpr in initialization of "
|
---|
[a300e4a] | 118 | "enumerator: ", field ) );
|
---|
| 119 | }
|
---|
| 120 | crntVal = result.first;
|
---|
| 121 | }
|
---|
| 122 | if ( enumValues.count( field->name ) != 0 ) {
|
---|
[733074e] | 123 | SemanticError( location, ::toString( "Enum ", name, " has multiple members with the " "name ", field->name ) );
|
---|
[a300e4a] | 124 | }
|
---|
| 125 | enumValues[ field->name ] = crntVal;
|
---|
| 126 | ++crntVal;
|
---|
| 127 | }
|
---|
| 128 | }
|
---|
| 129 |
|
---|
| 130 | auto it = enumValues.find( enumerator->name );
|
---|
| 131 | if ( it != enumValues.end() ) {
|
---|
| 132 | value = it->second;
|
---|
| 133 | return true;
|
---|
| 134 | }
|
---|
| 135 | return false;
|
---|
| 136 | }
|
---|
| 137 |
|
---|
[2bb4a01] | 138 | }
|
---|
| 139 |
|
---|
| 140 | // Local Variables: //
|
---|
| 141 | // tab-width: 4 //
|
---|
| 142 | // mode: c++ //
|
---|
| 143 | // compile-command: "make install" //
|
---|
| 144 | // End: //
|
---|