forked from OSchip/llvm-project
1151 lines
40 KiB
C++
1151 lines
40 KiB
C++
//===-- lib/Evaluate/characteristics.cpp ----------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "flang/Evaluate/characteristics.h"
|
|
#include "flang/Common/indirection.h"
|
|
#include "flang/Evaluate/check-expression.h"
|
|
#include "flang/Evaluate/fold.h"
|
|
#include "flang/Evaluate/intrinsics.h"
|
|
#include "flang/Evaluate/tools.h"
|
|
#include "flang/Evaluate/type.h"
|
|
#include "flang/Parser/message.h"
|
|
#include "flang/Semantics/scope.h"
|
|
#include "flang/Semantics/symbol.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <initializer_list>
|
|
|
|
using namespace Fortran::parser::literals;
|
|
|
|
namespace Fortran::evaluate::characteristics {
|
|
|
|
// Copy attributes from a symbol to dst based on the mapping in pairs.
|
|
template <typename A, typename B>
|
|
static void CopyAttrs(const semantics::Symbol &src, A &dst,
|
|
const std::initializer_list<std::pair<semantics::Attr, B>> &pairs) {
|
|
for (const auto &pair : pairs) {
|
|
if (src.attrs().test(pair.first)) {
|
|
dst.attrs.set(pair.second);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Shapes of function results and dummy arguments have to have
|
|
// the same rank, the same deferred dimensions, and the same
|
|
// values for explicit dimensions when constant.
|
|
bool ShapesAreCompatible(const Shape &x, const Shape &y) {
|
|
if (x.size() != y.size()) {
|
|
return false;
|
|
}
|
|
auto yIter{y.begin()};
|
|
for (const auto &xDim : x) {
|
|
const auto &yDim{*yIter++};
|
|
if (xDim) {
|
|
if (!yDim || ToInt64(*xDim) != ToInt64(*yDim)) {
|
|
return false;
|
|
}
|
|
} else if (yDim) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool TypeAndShape::operator==(const TypeAndShape &that) const {
|
|
return type_ == that.type_ && ShapesAreCompatible(shape_, that.shape_) &&
|
|
attrs_ == that.attrs_ && corank_ == that.corank_;
|
|
}
|
|
|
|
TypeAndShape &TypeAndShape::Rewrite(FoldingContext &context) {
|
|
LEN_ = Fold(context, std::move(LEN_));
|
|
shape_ = Fold(context, std::move(shape_));
|
|
return *this;
|
|
}
|
|
|
|
std::optional<TypeAndShape> TypeAndShape::Characterize(
|
|
const semantics::Symbol &symbol, FoldingContext &context) {
|
|
const auto &ultimate{symbol.GetUltimate()};
|
|
return std::visit(
|
|
common::visitors{
|
|
[&](const semantics::ObjectEntityDetails &object)
|
|
-> std::optional<TypeAndShape> {
|
|
if (auto type{DynamicType::From(object.type())}) {
|
|
TypeAndShape result{
|
|
std::move(*type), GetShape(context, ultimate)};
|
|
result.AcquireAttrs(ultimate);
|
|
result.AcquireLEN(ultimate);
|
|
return std::move(result.Rewrite(context));
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
},
|
|
[&](const semantics::ProcEntityDetails &proc) {
|
|
const semantics::ProcInterface &interface{proc.interface()};
|
|
if (interface.type()) {
|
|
return Characterize(*interface.type(), context);
|
|
} else if (interface.symbol()) {
|
|
return Characterize(*interface.symbol(), context);
|
|
} else {
|
|
return std::optional<TypeAndShape>{};
|
|
}
|
|
},
|
|
[&](const semantics::TypeParamDetails &tp) {
|
|
if (auto type{DynamicType::From(tp.type())}) {
|
|
return std::optional<TypeAndShape>{std::move(*type)};
|
|
} else {
|
|
return std::optional<TypeAndShape>{};
|
|
}
|
|
},
|
|
[&](const semantics::AssocEntityDetails &assoc) {
|
|
return Characterize(assoc, context);
|
|
},
|
|
[&](const semantics::ProcBindingDetails &binding) {
|
|
return Characterize(binding.symbol(), context);
|
|
},
|
|
[](const auto &) { return std::optional<TypeAndShape>{}; },
|
|
},
|
|
// GetUltimate() used here, not ResolveAssociations(), because
|
|
// we need the type/rank of an associate entity from TYPE IS,
|
|
// CLASS IS, or RANK statement.
|
|
ultimate.details());
|
|
}
|
|
|
|
std::optional<TypeAndShape> TypeAndShape::Characterize(
|
|
const semantics::AssocEntityDetails &assoc, FoldingContext &context) {
|
|
std::optional<TypeAndShape> result;
|
|
if (auto type{DynamicType::From(assoc.type())}) {
|
|
if (auto rank{assoc.rank()}) {
|
|
if (*rank >= 0 && *rank <= common::maxRank) {
|
|
result = TypeAndShape{std::move(*type), Shape(*rank)};
|
|
}
|
|
} else if (auto shape{GetShape(context, assoc.expr())}) {
|
|
result = TypeAndShape{std::move(*type), std::move(*shape)};
|
|
}
|
|
if (result && type->category() == TypeCategory::Character) {
|
|
if (const auto *chExpr{UnwrapExpr<Expr<SomeCharacter>>(assoc.expr())}) {
|
|
if (auto len{chExpr->LEN()}) {
|
|
result->set_LEN(std::move(*len));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Fold(context, std::move(result));
|
|
}
|
|
|
|
std::optional<TypeAndShape> TypeAndShape::Characterize(
|
|
const semantics::DeclTypeSpec &spec, FoldingContext &context) {
|
|
if (auto type{DynamicType::From(spec)}) {
|
|
return Fold(context, TypeAndShape{std::move(*type)});
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
std::optional<TypeAndShape> TypeAndShape::Characterize(
|
|
const ActualArgument &arg, FoldingContext &context) {
|
|
return Characterize(arg.UnwrapExpr(), context);
|
|
}
|
|
|
|
bool TypeAndShape::IsCompatibleWith(parser::ContextualMessages &messages,
|
|
const TypeAndShape &that, const char *thisIs, const char *thatIs,
|
|
bool isElemental, bool thisIsDeferredShape,
|
|
bool thatIsDeferredShape) const {
|
|
if (!type_.IsTkCompatibleWith(that.type_)) {
|
|
messages.Say(
|
|
"%1$s type '%2$s' is not compatible with %3$s type '%4$s'"_err_en_US,
|
|
thatIs, that.AsFortran(), thisIs, AsFortran());
|
|
return false;
|
|
}
|
|
return isElemental ||
|
|
CheckConformance(messages, shape_, that.shape_, thisIs, thatIs, false,
|
|
false /* no scalar expansion */, thisIsDeferredShape,
|
|
thatIsDeferredShape);
|
|
}
|
|
|
|
std::optional<Expr<SubscriptInteger>> TypeAndShape::MeasureElementSizeInBytes(
|
|
FoldingContext &foldingContext, bool align) const {
|
|
if (LEN_) {
|
|
CHECK(type_.category() == TypeCategory::Character);
|
|
return Fold(foldingContext,
|
|
Expr<SubscriptInteger>{type_.kind()} * Expr<SubscriptInteger>{*LEN_});
|
|
}
|
|
if (auto elementBytes{type_.MeasureSizeInBytes(foldingContext, align)}) {
|
|
return Fold(foldingContext, std::move(*elementBytes));
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<Expr<SubscriptInteger>> TypeAndShape::MeasureSizeInBytes(
|
|
FoldingContext &foldingContext) const {
|
|
if (auto elements{GetSize(Shape{shape_})}) {
|
|
// Sizes of arrays (even with single elements) are multiples of
|
|
// their alignments.
|
|
if (auto elementBytes{
|
|
MeasureElementSizeInBytes(foldingContext, GetRank(shape_) > 0)}) {
|
|
return Fold(
|
|
foldingContext, std::move(*elements) * std::move(*elementBytes));
|
|
}
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
void TypeAndShape::AcquireAttrs(const semantics::Symbol &symbol) {
|
|
if (const auto *object{
|
|
symbol.GetUltimate().detailsIf<semantics::ObjectEntityDetails>()}) {
|
|
corank_ = object->coshape().Rank();
|
|
if (object->IsAssumedRank()) {
|
|
attrs_.set(Attr::AssumedRank);
|
|
}
|
|
if (object->IsAssumedShape()) {
|
|
attrs_.set(Attr::AssumedShape);
|
|
}
|
|
if (object->IsAssumedSize()) {
|
|
attrs_.set(Attr::AssumedSize);
|
|
}
|
|
if (object->IsDeferredShape()) {
|
|
attrs_.set(Attr::DeferredShape);
|
|
}
|
|
if (object->IsCoarray()) {
|
|
attrs_.set(Attr::Coarray);
|
|
}
|
|
}
|
|
}
|
|
|
|
void TypeAndShape::AcquireLEN() {
|
|
if (type_.category() == TypeCategory::Character) {
|
|
if (const auto *param{type_.charLength()}) {
|
|
if (const auto &intExpr{param->GetExplicit()}) {
|
|
LEN_ = ConvertToType<SubscriptInteger>(common::Clone(*intExpr));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void TypeAndShape::AcquireLEN(const semantics::Symbol &symbol) {
|
|
if (type_.category() == TypeCategory::Character) {
|
|
if (auto len{DataRef{symbol}.LEN()}) {
|
|
LEN_ = std::move(*len);
|
|
}
|
|
}
|
|
}
|
|
|
|
std::string TypeAndShape::AsFortran() const {
|
|
return type_.AsFortran(LEN_ ? LEN_->AsFortran() : "");
|
|
}
|
|
|
|
llvm::raw_ostream &TypeAndShape::Dump(llvm::raw_ostream &o) const {
|
|
o << type_.AsFortran(LEN_ ? LEN_->AsFortran() : "");
|
|
attrs_.Dump(o, EnumToString);
|
|
if (!shape_.empty()) {
|
|
o << " dimension";
|
|
char sep{'('};
|
|
for (const auto &expr : shape_) {
|
|
o << sep;
|
|
sep = ',';
|
|
if (expr) {
|
|
expr->AsFortran(o);
|
|
} else {
|
|
o << ':';
|
|
}
|
|
}
|
|
o << ')';
|
|
}
|
|
return o;
|
|
}
|
|
|
|
bool DummyDataObject::operator==(const DummyDataObject &that) const {
|
|
return type == that.type && attrs == that.attrs && intent == that.intent &&
|
|
coshape == that.coshape;
|
|
}
|
|
|
|
static common::Intent GetIntent(const semantics::Attrs &attrs) {
|
|
if (attrs.test(semantics::Attr::INTENT_IN)) {
|
|
return common::Intent::In;
|
|
} else if (attrs.test(semantics::Attr::INTENT_OUT)) {
|
|
return common::Intent::Out;
|
|
} else if (attrs.test(semantics::Attr::INTENT_INOUT)) {
|
|
return common::Intent::InOut;
|
|
} else {
|
|
return common::Intent::Default;
|
|
}
|
|
}
|
|
|
|
std::optional<DummyDataObject> DummyDataObject::Characterize(
|
|
const semantics::Symbol &symbol, FoldingContext &context) {
|
|
if (symbol.has<semantics::ObjectEntityDetails>()) {
|
|
if (auto type{TypeAndShape::Characterize(symbol, context)}) {
|
|
std::optional<DummyDataObject> result{std::move(*type)};
|
|
using semantics::Attr;
|
|
CopyAttrs<DummyDataObject, DummyDataObject::Attr>(symbol, *result,
|
|
{
|
|
{Attr::OPTIONAL, DummyDataObject::Attr::Optional},
|
|
{Attr::ALLOCATABLE, DummyDataObject::Attr::Allocatable},
|
|
{Attr::ASYNCHRONOUS, DummyDataObject::Attr::Asynchronous},
|
|
{Attr::CONTIGUOUS, DummyDataObject::Attr::Contiguous},
|
|
{Attr::VALUE, DummyDataObject::Attr::Value},
|
|
{Attr::VOLATILE, DummyDataObject::Attr::Volatile},
|
|
{Attr::POINTER, DummyDataObject::Attr::Pointer},
|
|
{Attr::TARGET, DummyDataObject::Attr::Target},
|
|
});
|
|
result->intent = GetIntent(symbol.attrs());
|
|
return result;
|
|
}
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
bool DummyDataObject::CanBePassedViaImplicitInterface() const {
|
|
if ((attrs &
|
|
Attrs{Attr::Allocatable, Attr::Asynchronous, Attr::Optional,
|
|
Attr::Pointer, Attr::Target, Attr::Value, Attr::Volatile})
|
|
.any()) {
|
|
return false; // 15.4.2.2(3)(a)
|
|
} else if ((type.attrs() &
|
|
TypeAndShape::Attrs{TypeAndShape::Attr::AssumedShape,
|
|
TypeAndShape::Attr::AssumedRank,
|
|
TypeAndShape::Attr::Coarray})
|
|
.any()) {
|
|
return false; // 15.4.2.2(3)(b-d)
|
|
} else if (type.type().IsPolymorphic()) {
|
|
return false; // 15.4.2.2(3)(f)
|
|
} else if (const auto *derived{GetDerivedTypeSpec(type.type())}) {
|
|
return derived->parameters().empty(); // 15.4.2.2(3)(e)
|
|
} else {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
llvm::raw_ostream &DummyDataObject::Dump(llvm::raw_ostream &o) const {
|
|
attrs.Dump(o, EnumToString);
|
|
if (intent != common::Intent::Default) {
|
|
o << "INTENT(" << common::EnumToString(intent) << ')';
|
|
}
|
|
type.Dump(o);
|
|
if (!coshape.empty()) {
|
|
char sep{'['};
|
|
for (const auto &expr : coshape) {
|
|
expr.AsFortran(o << sep);
|
|
sep = ',';
|
|
}
|
|
}
|
|
return o;
|
|
}
|
|
|
|
DummyProcedure::DummyProcedure(Procedure &&p)
|
|
: procedure{new Procedure{std::move(p)}} {}
|
|
|
|
bool DummyProcedure::operator==(const DummyProcedure &that) const {
|
|
return attrs == that.attrs && intent == that.intent &&
|
|
procedure.value() == that.procedure.value();
|
|
}
|
|
|
|
static std::string GetSeenProcs(
|
|
const semantics::UnorderedSymbolSet &seenProcs) {
|
|
// Sort the symbols so that they appear in the same order on all platforms
|
|
auto ordered{semantics::OrderBySourcePosition(seenProcs)};
|
|
std::string result;
|
|
llvm::interleave(
|
|
ordered,
|
|
[&](const SymbolRef p) { result += '\'' + p->name().ToString() + '\''; },
|
|
[&]() { result += ", "; });
|
|
return result;
|
|
}
|
|
|
|
// These functions with arguments of type UnorderedSymbolSet are used with
|
|
// mutually recursive calls when characterizing a Procedure, a DummyArgument,
|
|
// or a DummyProcedure to detect circularly defined procedures as required by
|
|
// 15.4.3.6, paragraph 2.
|
|
static std::optional<DummyArgument> CharacterizeDummyArgument(
|
|
const semantics::Symbol &symbol, FoldingContext &context,
|
|
semantics::UnorderedSymbolSet &seenProcs);
|
|
|
|
static std::optional<Procedure> CharacterizeProcedure(
|
|
const semantics::Symbol &original, FoldingContext &context,
|
|
semantics::UnorderedSymbolSet &seenProcs) {
|
|
Procedure result;
|
|
const auto &symbol{original.GetUltimate()};
|
|
if (seenProcs.find(symbol) != seenProcs.end()) {
|
|
std::string procsList{GetSeenProcs(seenProcs)};
|
|
context.messages().Say(symbol.name(),
|
|
"Procedure '%s' is recursively defined. Procedures in the cycle:"
|
|
" %s"_err_en_US,
|
|
symbol.name(), procsList);
|
|
return std::nullopt;
|
|
}
|
|
seenProcs.insert(symbol);
|
|
CopyAttrs<Procedure, Procedure::Attr>(symbol, result,
|
|
{
|
|
{semantics::Attr::PURE, Procedure::Attr::Pure},
|
|
{semantics::Attr::ELEMENTAL, Procedure::Attr::Elemental},
|
|
{semantics::Attr::BIND_C, Procedure::Attr::BindC},
|
|
});
|
|
if (result.attrs.test(Procedure::Attr::Elemental) &&
|
|
!symbol.attrs().test(semantics::Attr::IMPURE)) {
|
|
result.attrs.set(Procedure::Attr::Pure); // explicitly flag pure procedures
|
|
}
|
|
return std::visit(
|
|
common::visitors{
|
|
[&](const semantics::SubprogramDetails &subp)
|
|
-> std::optional<Procedure> {
|
|
if (subp.isFunction()) {
|
|
if (auto fr{
|
|
FunctionResult::Characterize(subp.result(), context)}) {
|
|
result.functionResult = std::move(fr);
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
} else {
|
|
result.attrs.set(Procedure::Attr::Subroutine);
|
|
}
|
|
for (const semantics::Symbol *arg : subp.dummyArgs()) {
|
|
if (!arg) {
|
|
result.dummyArguments.emplace_back(AlternateReturn{});
|
|
} else if (auto argCharacteristics{CharacterizeDummyArgument(
|
|
*arg, context, seenProcs)}) {
|
|
result.dummyArguments.emplace_back(
|
|
std::move(argCharacteristics.value()));
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
return result;
|
|
},
|
|
[&](const semantics::ProcEntityDetails &proc)
|
|
-> std::optional<Procedure> {
|
|
if (symbol.attrs().test(semantics::Attr::INTRINSIC)) {
|
|
return context.intrinsics().IsSpecificIntrinsicFunction(
|
|
symbol.name().ToString());
|
|
}
|
|
const semantics::ProcInterface &interface{proc.interface()};
|
|
if (const semantics::Symbol * interfaceSymbol{interface.symbol()}) {
|
|
return CharacterizeProcedure(
|
|
*interfaceSymbol, context, seenProcs);
|
|
} else {
|
|
result.attrs.set(Procedure::Attr::ImplicitInterface);
|
|
const semantics::DeclTypeSpec *type{interface.type()};
|
|
if (symbol.test(semantics::Symbol::Flag::Subroutine)) {
|
|
// ignore any implicit typing
|
|
result.attrs.set(Procedure::Attr::Subroutine);
|
|
} else if (type) {
|
|
if (auto resultType{DynamicType::From(*type)}) {
|
|
result.functionResult = FunctionResult{*resultType};
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
} else if (symbol.test(semantics::Symbol::Flag::Function)) {
|
|
return std::nullopt;
|
|
}
|
|
// The PASS name, if any, is not a characteristic.
|
|
return result;
|
|
}
|
|
},
|
|
[&](const semantics::ProcBindingDetails &binding) {
|
|
if (auto result{CharacterizeProcedure(
|
|
binding.symbol(), context, seenProcs)}) {
|
|
if (!symbol.attrs().test(semantics::Attr::NOPASS)) {
|
|
auto passName{binding.passName()};
|
|
for (auto &dummy : result->dummyArguments) {
|
|
if (!passName || dummy.name.c_str() == *passName) {
|
|
dummy.pass = true;
|
|
return result;
|
|
}
|
|
}
|
|
DIE("PASS argument missing");
|
|
}
|
|
return result;
|
|
} else {
|
|
return std::optional<Procedure>{};
|
|
}
|
|
},
|
|
[&](const semantics::UseDetails &use) {
|
|
return CharacterizeProcedure(use.symbol(), context, seenProcs);
|
|
},
|
|
[&](const semantics::HostAssocDetails &assoc) {
|
|
return CharacterizeProcedure(assoc.symbol(), context, seenProcs);
|
|
},
|
|
[](const auto &) { return std::optional<Procedure>{}; },
|
|
},
|
|
symbol.details());
|
|
}
|
|
|
|
static std::optional<DummyProcedure> CharacterizeDummyProcedure(
|
|
const semantics::Symbol &symbol, FoldingContext &context,
|
|
semantics::UnorderedSymbolSet &seenProcs) {
|
|
if (auto procedure{CharacterizeProcedure(symbol, context, seenProcs)}) {
|
|
// Dummy procedures may not be elemental. Elemental dummy procedure
|
|
// interfaces are errors when the interface is not intrinsic, and that
|
|
// error is caught elsewhere. Elemental intrinsic interfaces are
|
|
// made non-elemental.
|
|
procedure->attrs.reset(Procedure::Attr::Elemental);
|
|
DummyProcedure result{std::move(procedure.value())};
|
|
CopyAttrs<DummyProcedure, DummyProcedure::Attr>(symbol, result,
|
|
{
|
|
{semantics::Attr::OPTIONAL, DummyProcedure::Attr::Optional},
|
|
{semantics::Attr::POINTER, DummyProcedure::Attr::Pointer},
|
|
});
|
|
result.intent = GetIntent(symbol.attrs());
|
|
return result;
|
|
} else {
|
|
return std::nullopt;
|
|
}
|
|
}
|
|
|
|
llvm::raw_ostream &DummyProcedure::Dump(llvm::raw_ostream &o) const {
|
|
attrs.Dump(o, EnumToString);
|
|
if (intent != common::Intent::Default) {
|
|
o << "INTENT(" << common::EnumToString(intent) << ')';
|
|
}
|
|
procedure.value().Dump(o);
|
|
return o;
|
|
}
|
|
|
|
llvm::raw_ostream &AlternateReturn::Dump(llvm::raw_ostream &o) const {
|
|
return o << '*';
|
|
}
|
|
|
|
DummyArgument::~DummyArgument() {}
|
|
|
|
bool DummyArgument::operator==(const DummyArgument &that) const {
|
|
return u == that.u; // name and passed-object usage are not characteristics
|
|
}
|
|
|
|
static std::optional<DummyArgument> CharacterizeDummyArgument(
|
|
const semantics::Symbol &symbol, FoldingContext &context,
|
|
semantics::UnorderedSymbolSet &seenProcs) {
|
|
auto name{symbol.name().ToString()};
|
|
if (symbol.has<semantics::ObjectEntityDetails>()) {
|
|
if (auto obj{DummyDataObject::Characterize(symbol, context)}) {
|
|
return DummyArgument{std::move(name), std::move(obj.value())};
|
|
}
|
|
} else if (auto proc{
|
|
CharacterizeDummyProcedure(symbol, context, seenProcs)}) {
|
|
return DummyArgument{std::move(name), std::move(proc.value())};
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<DummyArgument> DummyArgument::FromActual(
|
|
std::string &&name, const Expr<SomeType> &expr, FoldingContext &context) {
|
|
return std::visit(
|
|
common::visitors{
|
|
[&](const BOZLiteralConstant &) {
|
|
return std::make_optional<DummyArgument>(std::move(name),
|
|
DummyDataObject{
|
|
TypeAndShape{DynamicType::TypelessIntrinsicArgument()}});
|
|
},
|
|
[&](const NullPointer &) {
|
|
return std::make_optional<DummyArgument>(std::move(name),
|
|
DummyDataObject{
|
|
TypeAndShape{DynamicType::TypelessIntrinsicArgument()}});
|
|
},
|
|
[&](const ProcedureDesignator &designator) {
|
|
if (auto proc{Procedure::Characterize(designator, context)}) {
|
|
return std::make_optional<DummyArgument>(
|
|
std::move(name), DummyProcedure{std::move(*proc)});
|
|
} else {
|
|
return std::optional<DummyArgument>{};
|
|
}
|
|
},
|
|
[&](const ProcedureRef &call) {
|
|
if (auto proc{Procedure::Characterize(call, context)}) {
|
|
return std::make_optional<DummyArgument>(
|
|
std::move(name), DummyProcedure{std::move(*proc)});
|
|
} else {
|
|
return std::optional<DummyArgument>{};
|
|
}
|
|
},
|
|
[&](const auto &) {
|
|
if (auto type{TypeAndShape::Characterize(expr, context)}) {
|
|
return std::make_optional<DummyArgument>(
|
|
std::move(name), DummyDataObject{std::move(*type)});
|
|
} else {
|
|
return std::optional<DummyArgument>{};
|
|
}
|
|
},
|
|
},
|
|
expr.u);
|
|
}
|
|
|
|
bool DummyArgument::IsOptional() const {
|
|
return std::visit(
|
|
common::visitors{
|
|
[](const DummyDataObject &data) {
|
|
return data.attrs.test(DummyDataObject::Attr::Optional);
|
|
},
|
|
[](const DummyProcedure &proc) {
|
|
return proc.attrs.test(DummyProcedure::Attr::Optional);
|
|
},
|
|
[](const AlternateReturn &) { return false; },
|
|
},
|
|
u);
|
|
}
|
|
|
|
void DummyArgument::SetOptional(bool value) {
|
|
std::visit(common::visitors{
|
|
[value](DummyDataObject &data) {
|
|
data.attrs.set(DummyDataObject::Attr::Optional, value);
|
|
},
|
|
[value](DummyProcedure &proc) {
|
|
proc.attrs.set(DummyProcedure::Attr::Optional, value);
|
|
},
|
|
[](AlternateReturn &) { DIE("cannot set optional"); },
|
|
},
|
|
u);
|
|
}
|
|
|
|
void DummyArgument::SetIntent(common::Intent intent) {
|
|
std::visit(common::visitors{
|
|
[intent](DummyDataObject &data) { data.intent = intent; },
|
|
[intent](DummyProcedure &proc) { proc.intent = intent; },
|
|
[](AlternateReturn &) { DIE("cannot set intent"); },
|
|
},
|
|
u);
|
|
}
|
|
|
|
common::Intent DummyArgument::GetIntent() const {
|
|
return std::visit(common::visitors{
|
|
[](const DummyDataObject &data) { return data.intent; },
|
|
[](const DummyProcedure &proc) { return proc.intent; },
|
|
[](const AlternateReturn &) -> common::Intent {
|
|
DIE("Alternate return have no intent");
|
|
},
|
|
},
|
|
u);
|
|
}
|
|
|
|
bool DummyArgument::CanBePassedViaImplicitInterface() const {
|
|
if (const auto *object{std::get_if<DummyDataObject>(&u)}) {
|
|
return object->CanBePassedViaImplicitInterface();
|
|
} else {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
bool DummyArgument::IsTypelessIntrinsicDummy() const {
|
|
const auto *argObj{std::get_if<characteristics::DummyDataObject>(&u)};
|
|
return argObj && argObj->type.type().IsTypelessIntrinsicArgument();
|
|
}
|
|
|
|
llvm::raw_ostream &DummyArgument::Dump(llvm::raw_ostream &o) const {
|
|
if (!name.empty()) {
|
|
o << name << '=';
|
|
}
|
|
if (pass) {
|
|
o << " PASS";
|
|
}
|
|
std::visit([&](const auto &x) { x.Dump(o); }, u);
|
|
return o;
|
|
}
|
|
|
|
FunctionResult::FunctionResult(DynamicType t) : u{TypeAndShape{t}} {}
|
|
FunctionResult::FunctionResult(TypeAndShape &&t) : u{std::move(t)} {}
|
|
FunctionResult::FunctionResult(Procedure &&p) : u{std::move(p)} {}
|
|
FunctionResult::~FunctionResult() {}
|
|
|
|
bool FunctionResult::operator==(const FunctionResult &that) const {
|
|
return attrs == that.attrs && u == that.u;
|
|
}
|
|
|
|
std::optional<FunctionResult> FunctionResult::Characterize(
|
|
const Symbol &symbol, FoldingContext &context) {
|
|
if (symbol.has<semantics::ObjectEntityDetails>()) {
|
|
if (auto type{TypeAndShape::Characterize(symbol, context)}) {
|
|
FunctionResult result{std::move(*type)};
|
|
CopyAttrs<FunctionResult, FunctionResult::Attr>(symbol, result,
|
|
{
|
|
{semantics::Attr::ALLOCATABLE, FunctionResult::Attr::Allocatable},
|
|
{semantics::Attr::CONTIGUOUS, FunctionResult::Attr::Contiguous},
|
|
{semantics::Attr::POINTER, FunctionResult::Attr::Pointer},
|
|
});
|
|
return result;
|
|
}
|
|
} else if (auto maybeProc{Procedure::Characterize(symbol, context)}) {
|
|
FunctionResult result{std::move(*maybeProc)};
|
|
result.attrs.set(FunctionResult::Attr::Pointer);
|
|
return result;
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
bool FunctionResult::IsAssumedLengthCharacter() const {
|
|
if (const auto *ts{std::get_if<TypeAndShape>(&u)}) {
|
|
return ts->type().IsAssumedLengthCharacter();
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool FunctionResult::CanBeReturnedViaImplicitInterface() const {
|
|
if (attrs.test(Attr::Pointer) || attrs.test(Attr::Allocatable)) {
|
|
return false; // 15.4.2.2(4)(b)
|
|
} else if (const auto *typeAndShape{GetTypeAndShape()}) {
|
|
if (typeAndShape->Rank() > 0) {
|
|
return false; // 15.4.2.2(4)(a)
|
|
} else {
|
|
const DynamicType &type{typeAndShape->type()};
|
|
switch (type.category()) {
|
|
case TypeCategory::Character:
|
|
if (const auto *param{type.charLength()}) {
|
|
if (const auto &expr{param->GetExplicit()}) {
|
|
return IsConstantExpr(*expr); // 15.4.2.2(4)(c)
|
|
} else if (param->isAssumed()) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
case TypeCategory::Derived:
|
|
if (!type.IsPolymorphic()) {
|
|
const auto &spec{type.GetDerivedTypeSpec()};
|
|
for (const auto &pair : spec.parameters()) {
|
|
if (const auto &expr{pair.second.GetExplicit()}) {
|
|
if (!IsConstantExpr(*expr)) {
|
|
return false; // 15.4.2.2(4)(c)
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
default:
|
|
return true;
|
|
}
|
|
}
|
|
} else {
|
|
return false; // 15.4.2.2(4)(b) - procedure pointer
|
|
}
|
|
}
|
|
|
|
llvm::raw_ostream &FunctionResult::Dump(llvm::raw_ostream &o) const {
|
|
attrs.Dump(o, EnumToString);
|
|
std::visit(common::visitors{
|
|
[&](const TypeAndShape &ts) { ts.Dump(o); },
|
|
[&](const CopyableIndirection<Procedure> &p) {
|
|
p.value().Dump(o << " procedure(") << ')';
|
|
},
|
|
},
|
|
u);
|
|
return o;
|
|
}
|
|
|
|
Procedure::Procedure(FunctionResult &&fr, DummyArguments &&args, Attrs a)
|
|
: functionResult{std::move(fr)}, dummyArguments{std::move(args)}, attrs{a} {
|
|
}
|
|
Procedure::Procedure(DummyArguments &&args, Attrs a)
|
|
: dummyArguments{std::move(args)}, attrs{a} {}
|
|
Procedure::~Procedure() {}
|
|
|
|
bool Procedure::operator==(const Procedure &that) const {
|
|
return attrs == that.attrs && functionResult == that.functionResult &&
|
|
dummyArguments == that.dummyArguments;
|
|
}
|
|
|
|
int Procedure::FindPassIndex(std::optional<parser::CharBlock> name) const {
|
|
int argCount{static_cast<int>(dummyArguments.size())};
|
|
int index{0};
|
|
if (name) {
|
|
while (index < argCount && *name != dummyArguments[index].name.c_str()) {
|
|
++index;
|
|
}
|
|
}
|
|
CHECK(index < argCount);
|
|
return index;
|
|
}
|
|
|
|
bool Procedure::CanOverride(
|
|
const Procedure &that, std::optional<int> passIndex) const {
|
|
// A pure procedure may override an impure one (7.5.7.3(2))
|
|
if ((that.attrs.test(Attr::Pure) && !attrs.test(Attr::Pure)) ||
|
|
that.attrs.test(Attr::Elemental) != attrs.test(Attr::Elemental) ||
|
|
functionResult != that.functionResult) {
|
|
return false;
|
|
}
|
|
int argCount{static_cast<int>(dummyArguments.size())};
|
|
if (argCount != static_cast<int>(that.dummyArguments.size())) {
|
|
return false;
|
|
}
|
|
for (int j{0}; j < argCount; ++j) {
|
|
if ((!passIndex || j != *passIndex) &&
|
|
dummyArguments[j] != that.dummyArguments[j]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
std::optional<Procedure> Procedure::Characterize(
|
|
const semantics::Symbol &original, FoldingContext &context) {
|
|
semantics::UnorderedSymbolSet seenProcs;
|
|
return CharacterizeProcedure(original, context, seenProcs);
|
|
}
|
|
|
|
std::optional<Procedure> Procedure::Characterize(
|
|
const ProcedureDesignator &proc, FoldingContext &context) {
|
|
if (const auto *symbol{proc.GetSymbol()}) {
|
|
if (auto result{characteristics::Procedure::Characterize(
|
|
symbol->GetUltimate(), context)}) {
|
|
return result;
|
|
}
|
|
} else if (const auto *intrinsic{proc.GetSpecificIntrinsic()}) {
|
|
return intrinsic->characteristics.value();
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
std::optional<Procedure> Procedure::Characterize(
|
|
const ProcedureRef &ref, FoldingContext &context) {
|
|
if (auto callee{Characterize(ref.proc(), context)}) {
|
|
if (callee->functionResult) {
|
|
if (const Procedure *
|
|
proc{callee->functionResult->IsProcedurePointer()}) {
|
|
return {*proc};
|
|
}
|
|
}
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
bool Procedure::CanBeCalledViaImplicitInterface() const {
|
|
if (attrs.test(Attr::Elemental) || attrs.test(Attr::BindC)) {
|
|
return false; // 15.4.2.2(5,6)
|
|
} else if (IsFunction() &&
|
|
!functionResult->CanBeReturnedViaImplicitInterface()) {
|
|
return false;
|
|
} else {
|
|
for (const DummyArgument &arg : dummyArguments) {
|
|
if (!arg.CanBePassedViaImplicitInterface()) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
|
|
llvm::raw_ostream &Procedure::Dump(llvm::raw_ostream &o) const {
|
|
attrs.Dump(o, EnumToString);
|
|
if (functionResult) {
|
|
functionResult->Dump(o << "TYPE(") << ") FUNCTION";
|
|
} else {
|
|
o << "SUBROUTINE";
|
|
}
|
|
char sep{'('};
|
|
for (const auto &dummy : dummyArguments) {
|
|
dummy.Dump(o << sep);
|
|
sep = ',';
|
|
}
|
|
return o << (sep == '(' ? "()" : ")");
|
|
}
|
|
|
|
// Utility class to determine if Procedures, etc. are distinguishable
|
|
class DistinguishUtils {
|
|
public:
|
|
// Are these procedures distinguishable for a generic name?
|
|
static bool Distinguishable(const Procedure &, const Procedure &);
|
|
// Are these procedures distinguishable for a generic operator or assignment?
|
|
static bool DistinguishableOpOrAssign(const Procedure &, const Procedure &);
|
|
|
|
private:
|
|
struct CountDummyProcedures {
|
|
CountDummyProcedures(const DummyArguments &args) {
|
|
for (const DummyArgument &arg : args) {
|
|
if (std::holds_alternative<DummyProcedure>(arg.u)) {
|
|
total += 1;
|
|
notOptional += !arg.IsOptional();
|
|
}
|
|
}
|
|
}
|
|
int total{0};
|
|
int notOptional{0};
|
|
};
|
|
|
|
static bool Rule3Distinguishable(const Procedure &, const Procedure &);
|
|
static const DummyArgument *Rule1DistinguishingArg(
|
|
const DummyArguments &, const DummyArguments &);
|
|
static int FindFirstToDistinguishByPosition(
|
|
const DummyArguments &, const DummyArguments &);
|
|
static int FindLastToDistinguishByName(
|
|
const DummyArguments &, const DummyArguments &);
|
|
static int CountCompatibleWith(const DummyArgument &, const DummyArguments &);
|
|
static int CountNotDistinguishableFrom(
|
|
const DummyArgument &, const DummyArguments &);
|
|
static bool Distinguishable(const DummyArgument &, const DummyArgument &);
|
|
static bool Distinguishable(const DummyDataObject &, const DummyDataObject &);
|
|
static bool Distinguishable(const DummyProcedure &, const DummyProcedure &);
|
|
static bool Distinguishable(const FunctionResult &, const FunctionResult &);
|
|
static bool Distinguishable(const TypeAndShape &, const TypeAndShape &);
|
|
static bool IsTkrCompatible(const DummyArgument &, const DummyArgument &);
|
|
static bool IsTkrCompatible(const TypeAndShape &, const TypeAndShape &);
|
|
static const DummyArgument *GetAtEffectivePosition(
|
|
const DummyArguments &, int);
|
|
static const DummyArgument *GetPassArg(const Procedure &);
|
|
};
|
|
|
|
// Simpler distinguishability rules for operators and assignment
|
|
bool DistinguishUtils::DistinguishableOpOrAssign(
|
|
const Procedure &proc1, const Procedure &proc2) {
|
|
auto &args1{proc1.dummyArguments};
|
|
auto &args2{proc2.dummyArguments};
|
|
if (args1.size() != args2.size()) {
|
|
return true; // C1511: distinguishable based on number of arguments
|
|
}
|
|
for (std::size_t i{0}; i < args1.size(); ++i) {
|
|
if (Distinguishable(args1[i], args2[i])) {
|
|
return true; // C1511, C1512: distinguishable based on this arg
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const Procedure &proc1, const Procedure &proc2) {
|
|
auto &args1{proc1.dummyArguments};
|
|
auto &args2{proc2.dummyArguments};
|
|
auto count1{CountDummyProcedures(args1)};
|
|
auto count2{CountDummyProcedures(args2)};
|
|
if (count1.notOptional > count2.total || count2.notOptional > count1.total) {
|
|
return true; // distinguishable based on C1514 rule 2
|
|
}
|
|
if (Rule3Distinguishable(proc1, proc2)) {
|
|
return true; // distinguishable based on C1514 rule 3
|
|
}
|
|
if (Rule1DistinguishingArg(args1, args2)) {
|
|
return true; // distinguishable based on C1514 rule 1
|
|
}
|
|
int pos1{FindFirstToDistinguishByPosition(args1, args2)};
|
|
int name1{FindLastToDistinguishByName(args1, args2)};
|
|
if (pos1 >= 0 && pos1 <= name1) {
|
|
return true; // distinguishable based on C1514 rule 4
|
|
}
|
|
int pos2{FindFirstToDistinguishByPosition(args2, args1)};
|
|
int name2{FindLastToDistinguishByName(args2, args1)};
|
|
if (pos2 >= 0 && pos2 <= name2) {
|
|
return true; // distinguishable based on C1514 rule 4
|
|
}
|
|
return false;
|
|
}
|
|
|
|
// C1514 rule 3: Procedures are distinguishable if both have a passed-object
|
|
// dummy argument and those are distinguishable.
|
|
bool DistinguishUtils::Rule3Distinguishable(
|
|
const Procedure &proc1, const Procedure &proc2) {
|
|
const DummyArgument *pass1{GetPassArg(proc1)};
|
|
const DummyArgument *pass2{GetPassArg(proc2)};
|
|
return pass1 && pass2 && Distinguishable(*pass1, *pass2);
|
|
}
|
|
|
|
// Find a non-passed-object dummy data object in one of the argument lists
|
|
// that satisfies C1514 rule 1. I.e. x such that:
|
|
// - m is the number of dummy data objects in one that are nonoptional,
|
|
// are not passed-object, that x is TKR compatible with
|
|
// - n is the number of non-passed-object dummy data objects, in the other
|
|
// that are not distinguishable from x
|
|
// - m is greater than n
|
|
const DummyArgument *DistinguishUtils::Rule1DistinguishingArg(
|
|
const DummyArguments &args1, const DummyArguments &args2) {
|
|
auto size1{args1.size()};
|
|
auto size2{args2.size()};
|
|
for (std::size_t i{0}; i < size1 + size2; ++i) {
|
|
const DummyArgument &x{i < size1 ? args1[i] : args2[i - size1]};
|
|
if (!x.pass && std::holds_alternative<DummyDataObject>(x.u)) {
|
|
if (CountCompatibleWith(x, args1) >
|
|
CountNotDistinguishableFrom(x, args2) ||
|
|
CountCompatibleWith(x, args2) >
|
|
CountNotDistinguishableFrom(x, args1)) {
|
|
return &x;
|
|
}
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
// Find the index of the first nonoptional non-passed-object dummy argument
|
|
// in args1 at an effective position such that either:
|
|
// - args2 has no dummy argument at that effective position
|
|
// - the dummy argument at that position is distinguishable from it
|
|
int DistinguishUtils::FindFirstToDistinguishByPosition(
|
|
const DummyArguments &args1, const DummyArguments &args2) {
|
|
int effective{0}; // position of arg1 in list, ignoring passed arg
|
|
for (std::size_t i{0}; i < args1.size(); ++i) {
|
|
const DummyArgument &arg1{args1.at(i)};
|
|
if (!arg1.pass && !arg1.IsOptional()) {
|
|
const DummyArgument *arg2{GetAtEffectivePosition(args2, effective)};
|
|
if (!arg2 || Distinguishable(arg1, *arg2)) {
|
|
return i;
|
|
}
|
|
}
|
|
effective += !arg1.pass;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
// Find the index of the last nonoptional non-passed-object dummy argument
|
|
// in args1 whose name is such that either:
|
|
// - args2 has no dummy argument with that name
|
|
// - the dummy argument with that name is distinguishable from it
|
|
int DistinguishUtils::FindLastToDistinguishByName(
|
|
const DummyArguments &args1, const DummyArguments &args2) {
|
|
std::map<std::string, const DummyArgument *> nameToArg;
|
|
for (const auto &arg2 : args2) {
|
|
nameToArg.emplace(arg2.name, &arg2);
|
|
}
|
|
for (int i = args1.size() - 1; i >= 0; --i) {
|
|
const DummyArgument &arg1{args1.at(i)};
|
|
if (!arg1.pass && !arg1.IsOptional()) {
|
|
auto it{nameToArg.find(arg1.name)};
|
|
if (it == nameToArg.end() || Distinguishable(arg1, *it->second)) {
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
// Count the dummy data objects in args that are nonoptional, are not
|
|
// passed-object, and that x is TKR compatible with
|
|
int DistinguishUtils::CountCompatibleWith(
|
|
const DummyArgument &x, const DummyArguments &args) {
|
|
return std::count_if(args.begin(), args.end(), [&](const DummyArgument &y) {
|
|
return !y.pass && !y.IsOptional() && IsTkrCompatible(x, y);
|
|
});
|
|
}
|
|
|
|
// Return the number of dummy data objects in args that are not
|
|
// distinguishable from x and not passed-object.
|
|
int DistinguishUtils::CountNotDistinguishableFrom(
|
|
const DummyArgument &x, const DummyArguments &args) {
|
|
return std::count_if(args.begin(), args.end(), [&](const DummyArgument &y) {
|
|
return !y.pass && std::holds_alternative<DummyDataObject>(y.u) &&
|
|
!Distinguishable(y, x);
|
|
});
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const DummyArgument &x, const DummyArgument &y) {
|
|
if (x.u.index() != y.u.index()) {
|
|
return true; // different kind: data/proc/alt-return
|
|
}
|
|
return std::visit(
|
|
common::visitors{
|
|
[&](const DummyDataObject &z) {
|
|
return Distinguishable(z, std::get<DummyDataObject>(y.u));
|
|
},
|
|
[&](const DummyProcedure &z) {
|
|
return Distinguishable(z, std::get<DummyProcedure>(y.u));
|
|
},
|
|
[&](const AlternateReturn &) { return false; },
|
|
},
|
|
x.u);
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const DummyDataObject &x, const DummyDataObject &y) {
|
|
using Attr = DummyDataObject::Attr;
|
|
if (Distinguishable(x.type, y.type)) {
|
|
return true;
|
|
} else if (x.attrs.test(Attr::Allocatable) && y.attrs.test(Attr::Pointer) &&
|
|
y.intent != common::Intent::In) {
|
|
return true;
|
|
} else if (y.attrs.test(Attr::Allocatable) && x.attrs.test(Attr::Pointer) &&
|
|
x.intent != common::Intent::In) {
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const DummyProcedure &x, const DummyProcedure &y) {
|
|
const Procedure &xProc{x.procedure.value()};
|
|
const Procedure &yProc{y.procedure.value()};
|
|
if (Distinguishable(xProc, yProc)) {
|
|
return true;
|
|
} else {
|
|
const std::optional<FunctionResult> &xResult{xProc.functionResult};
|
|
const std::optional<FunctionResult> &yResult{yProc.functionResult};
|
|
return xResult ? !yResult || Distinguishable(*xResult, *yResult)
|
|
: yResult.has_value();
|
|
}
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const FunctionResult &x, const FunctionResult &y) {
|
|
if (x.u.index() != y.u.index()) {
|
|
return true; // one is data object, one is procedure
|
|
}
|
|
return std::visit(
|
|
common::visitors{
|
|
[&](const TypeAndShape &z) {
|
|
return Distinguishable(z, std::get<TypeAndShape>(y.u));
|
|
},
|
|
[&](const CopyableIndirection<Procedure> &z) {
|
|
return Distinguishable(z.value(),
|
|
std::get<CopyableIndirection<Procedure>>(y.u).value());
|
|
},
|
|
},
|
|
x.u);
|
|
}
|
|
|
|
bool DistinguishUtils::Distinguishable(
|
|
const TypeAndShape &x, const TypeAndShape &y) {
|
|
return !IsTkrCompatible(x, y) && !IsTkrCompatible(y, x);
|
|
}
|
|
|
|
// Compatibility based on type, kind, and rank
|
|
bool DistinguishUtils::IsTkrCompatible(
|
|
const DummyArgument &x, const DummyArgument &y) {
|
|
const auto *obj1{std::get_if<DummyDataObject>(&x.u)};
|
|
const auto *obj2{std::get_if<DummyDataObject>(&y.u)};
|
|
return obj1 && obj2 && IsTkrCompatible(obj1->type, obj2->type);
|
|
}
|
|
bool DistinguishUtils::IsTkrCompatible(
|
|
const TypeAndShape &x, const TypeAndShape &y) {
|
|
return x.type().IsTkCompatibleWith(y.type()) &&
|
|
(x.attrs().test(TypeAndShape::Attr::AssumedRank) ||
|
|
y.attrs().test(TypeAndShape::Attr::AssumedRank) ||
|
|
x.Rank() == y.Rank());
|
|
}
|
|
|
|
// Return the argument at the given index, ignoring the passed arg
|
|
const DummyArgument *DistinguishUtils::GetAtEffectivePosition(
|
|
const DummyArguments &args, int index) {
|
|
for (const DummyArgument &arg : args) {
|
|
if (!arg.pass) {
|
|
if (index == 0) {
|
|
return &arg;
|
|
}
|
|
--index;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
// Return the passed-object dummy argument of this procedure, if any
|
|
const DummyArgument *DistinguishUtils::GetPassArg(const Procedure &proc) {
|
|
for (const auto &arg : proc.dummyArguments) {
|
|
if (arg.pass) {
|
|
return &arg;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
bool Distinguishable(const Procedure &x, const Procedure &y) {
|
|
return DistinguishUtils::Distinguishable(x, y);
|
|
}
|
|
|
|
bool DistinguishableOpOrAssign(const Procedure &x, const Procedure &y) {
|
|
return DistinguishUtils::DistinguishableOpOrAssign(x, y);
|
|
}
|
|
|
|
DEFINE_DEFAULT_CONSTRUCTORS_AND_ASSIGNMENTS(DummyArgument)
|
|
DEFINE_DEFAULT_CONSTRUCTORS_AND_ASSIGNMENTS(DummyProcedure)
|
|
DEFINE_DEFAULT_CONSTRUCTORS_AND_ASSIGNMENTS(FunctionResult)
|
|
DEFINE_DEFAULT_CONSTRUCTORS_AND_ASSIGNMENTS(Procedure)
|
|
} // namespace Fortran::evaluate::characteristics
|
|
|
|
template class Fortran::common::Indirection<
|
|
Fortran::evaluate::characteristics::Procedure, true>;
|