FLANG
expression.h
1//===-- include/flang/Semantics/expression.h --------------------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#ifndef FORTRAN_SEMANTICS_EXPRESSION_H_
10#define FORTRAN_SEMANTICS_EXPRESSION_H_
11
12#include "semantics.h"
13#include "flang/Common/indirection.h"
14#include "flang/Common/restorer.h"
15#include "flang/Common/visit.h"
16#include "flang/Evaluate/characteristics.h"
17#include "flang/Evaluate/check-expression.h"
18#include "flang/Evaluate/expression.h"
19#include "flang/Evaluate/fold.h"
20#include "flang/Evaluate/tools.h"
21#include "flang/Evaluate/type.h"
22#include "flang/Parser/char-block.h"
23#include "flang/Parser/parse-tree-visitor.h"
24#include "flang/Parser/parse-tree.h"
25#include "flang/Parser/tools.h"
26#include <map>
27#include <optional>
28#include <variant>
29
30using namespace Fortran::parser::literals;
31
32namespace Fortran::parser {
34 template <typename A> bool Pre(const A &x) {
35 if constexpr (HasSource<A>::value) {
36 source.ExtendToCover(x.source);
37 return false;
38 } else {
39 return true;
40 }
41 }
42 template <typename A> void Post(const A &) {}
43 void Post(const CharBlock &at) { source.ExtendToCover(at); }
44
45 CharBlock source;
46};
47
48template <typename A> CharBlock FindSourceLocation(const A &x) {
50 Walk(x, visitor);
51 return visitor.source;
52}
53} // namespace Fortran::parser
54
55using namespace Fortran::parser::literals;
56
57// The expression semantic analysis code has its implementation in
58// namespace Fortran::evaluate, but the exposed API to it is in the
59// namespace Fortran::semantics (below).
60//
61// The ExpressionAnalyzer wraps a SemanticsContext reference
62// and implements constraint checking on expressions using the
63// parse tree node wrappers that mirror the grammar annotations used
64// in the Fortran standard (i.e., scalar-, constant-, &c.).
65
66namespace Fortran::evaluate {
67
68class IntrinsicProcTable;
69
70struct SetExprHelper {
71 explicit SetExprHelper(GenericExprWrapper &&expr) : expr_{std::move(expr)} {}
72 void Set(parser::TypedExpr &x) {
73 x.Reset(new GenericExprWrapper{std::move(expr_)},
74 evaluate::GenericExprWrapper::Deleter);
75 }
76 template <typename T> void Set(const common::Indirection<T> &x) {
77 Set(x.value());
78 }
79 template <typename T> void Set(const T &x) {
80 if constexpr (parser::HasTypedExpr<T>::value) {
81 Set(x.typedExpr);
82 } else if constexpr (ConstraintTrait<T>) {
83 Set(x.thing);
84 } else if constexpr (WrapperTrait<T>) {
85 Set(x.v);
86 }
87 }
88
90};
91
92template <typename T> void ResetExpr(const T &x) {
93 SetExprHelper{GenericExprWrapper{/* error indicator */}}.Set(x);
94}
95
96template <typename T> void SetExpr(const T &x, Expr<SomeType> &&expr) {
97 SetExprHelper{GenericExprWrapper{std::move(expr)}}.Set(x);
98}
99
100class ExpressionAnalyzer {
101public:
102 using MaybeExpr = std::optional<Expr<SomeType>>;
103
104 explicit ExpressionAnalyzer(semantics::SemanticsContext &sc) : context_{sc} {}
105 ExpressionAnalyzer(semantics::SemanticsContext &sc, FoldingContext &fc)
106 : context_{sc}, foldingContext_{fc} {}
107 ExpressionAnalyzer(const ExpressionAnalyzer &) = default;
108
109 semantics::SemanticsContext &context() const { return context_; }
110 bool inWhereBody() const { return inWhereBody_; }
111 void set_inWhereBody(bool yes = true) { inWhereBody_ = yes; }
112 bool inDataStmtObject() const { return inDataStmtObject_; }
113 void set_inDataStmtObject(bool yes = true) { inDataStmtObject_ = yes; }
114
115 FoldingContext &GetFoldingContext() const { return foldingContext_; }
116
117 parser::ContextualMessages &GetContextualMessages() {
118 return foldingContext_.messages();
119 }
120
121 template <typename... A> parser::Message *Say(A &&...args) {
122 return GetContextualMessages().Say(std::forward<A>(args)...);
123 }
124 template <typename FeatureOrUsageWarning, typename... A>
125 parser::Message *Warn(
126 FeatureOrUsageWarning warning, parser::CharBlock at, A &&...args) {
127 return context_.Warn(warning, at, std::forward<A>(args)...);
128 }
129 template <typename FeatureOrUsageWarning, typename... A>
130 parser::Message *Warn(FeatureOrUsageWarning warning, A &&...args) {
131 return Warn(
132 warning, GetContextualMessages().at(), std::forward<A>(args)...);
133 }
134
135 template <typename T, typename... A>
136 parser::Message *SayAt(const T &parsed, A &&...args) {
137 return Say(parser::FindSourceLocation(parsed), std::forward<A>(args)...);
138 }
139
140 int GetDefaultKind(common::TypeCategory);
141 DynamicType GetDefaultKindOfType(common::TypeCategory);
142
143 // Return false and emit error if these checks fail:
144 bool CheckIntrinsicKind(TypeCategory, std::int64_t kind);
145 bool CheckIntrinsicSize(TypeCategory, std::int64_t size);
146
147 // Manage a set of active implied DO loops.
148 bool AddImpliedDo(parser::CharBlock, int kind);
149 void RemoveImpliedDo(parser::CharBlock);
150
151 // When the argument is the name of an active implied DO index, returns
152 // its INTEGER kind type parameter.
153 std::optional<int> IsImpliedDo(parser::CharBlock) const;
154
155 common::Restorer<bool> DoNotUseSavedTypedExprs() {
156 return common::ScopedSet(useSavedTypedExprs_, false);
157 }
158
159 Expr<SubscriptInteger> AnalyzeKindSelector(common::TypeCategory category,
160 const std::optional<parser::KindSelector> &);
161
162 MaybeExpr Analyze(const parser::Expr &);
163 MaybeExpr Analyze(const parser::Variable &);
164 MaybeExpr Analyze(const parser::Selector &);
165 MaybeExpr Analyze(const parser::Designator &);
166 MaybeExpr Analyze(const parser::DataStmtValue &);
167 MaybeExpr Analyze(const parser::AllocateObject &);
168 MaybeExpr Analyze(const parser::PointerObject &);
169 MaybeExpr Analyze(const parser::ConditionalExpr &);
170
171 template <typename A> MaybeExpr Analyze(const common::Indirection<A> &x) {
172 return Analyze(x.value());
173 }
174 template <typename A> MaybeExpr Analyze(const std::optional<A> &x) {
175 if (x) {
176 return Analyze(*x);
177 } else {
178 return std::nullopt;
179 }
180 }
181
182 // Implement constraint-checking wrappers from the Fortran grammar.
183 template <typename A> MaybeExpr Analyze(const parser::Scalar<A> &x) {
184 auto result{Analyze(x.thing)};
185 if (result) {
186 if (int rank{result->Rank()}; rank != 0) {
187 SayAt(x, "Must be a scalar value, but is a rank-%d array"_err_en_US,
188 rank);
189 ResetExpr(x);
190 return std::nullopt;
191 }
192 }
193 return result;
194 }
195 template <typename A> MaybeExpr Analyze(const parser::Constant<A> &x) {
196 auto restorer{
197 GetFoldingContext().messages().SetLocation(FindSourceLocation(x))};
198 auto result{Analyze(x.thing)};
199 if (result) {
200 *result = Fold(std::move(*result));
201 if (!IsConstantExpr(*result)) { // C886, C887, C713
202 SayAt(x, "Must be a constant value"_err_en_US);
203 ResetExpr(x);
204 return std::nullopt;
205 } else {
206 // Save folded expression for later use
207 SetExpr(x, common::Clone(*result));
208 }
209 }
210 return result;
211 }
212 template <typename A> MaybeExpr Analyze(const parser::Integer<A> &x) {
213 auto result{Analyze(x.thing)};
214 if (!EnforceTypeConstraint(
215 parser::FindSourceLocation(x), result, TypeCategory::Integer)) {
216 ResetExpr(x);
217 return std::nullopt;
218 }
219 return result;
220 }
221 template <typename A> MaybeExpr Analyze(const parser::Logical<A> &x) {
222 auto result{Analyze(x.thing)};
223 if (!EnforceTypeConstraint(
224 parser::FindSourceLocation(x), result, TypeCategory::Logical)) {
225 ResetExpr(x);
226 return std::nullopt;
227 }
228 return result;
229 }
230 template <typename A> MaybeExpr Analyze(const parser::DefaultChar<A> &x) {
231 auto result{Analyze(x.thing)};
232 if (!EnforceTypeConstraint(parser::FindSourceLocation(x), result,
233 TypeCategory::Character, true /* default kind */)) {
234 ResetExpr(x);
235 return std::nullopt;
236 }
237 return result;
238 }
239
240 MaybeExpr Analyze(const parser::Name &);
241 MaybeExpr Analyze(const parser::DataRef &dr) {
242 return Analyze<parser::DataRef>(dr);
243 }
244 MaybeExpr Analyze(const parser::StructureComponent &);
245 MaybeExpr Analyze(const parser::SignedIntLiteralConstant &);
246 MaybeExpr Analyze(const parser::SignedRealLiteralConstant &);
247 MaybeExpr Analyze(const parser::SignedComplexLiteralConstant &);
248 MaybeExpr Analyze(const parser::StructureConstructor &);
249 MaybeExpr Analyze(const parser::InitialDataTarget &);
250 MaybeExpr Analyze(const parser::NullInit &);
251 MaybeExpr Analyze(const parser::StmtFunctionStmt &);
252 MaybeExpr Analyze(const parser::FunctionReference &,
253 std::optional<parser::StructureConstructor> * = nullptr);
254
255 void Analyze(const parser::CallStmt &);
256 const Assignment *Analyze(const parser::AssignmentStmt &);
257 const Assignment *Analyze(const parser::PointerAssignmentStmt &);
258
259 // Builds a typed Designator from an untyped DataRef
260 MaybeExpr Designate(DataRef &&);
261 void CheckForWholeAssumedSizeArray(parser::CharBlock, const Symbol *);
262
263 // Allows a whole assumed-size array to appear for the lifetime of
264 // the returned value.
265 common::Restorer<bool> AllowWholeAssumedSizeArray(bool yes = true) {
266 return common::ScopedSet(isWholeAssumedSizeArrayOk_, yes);
267 }
268
269protected:
270 int IntegerTypeSpecKind(const parser::IntegerTypeSpec &);
271
272private:
273 // Allows an Expr to be a null pointer.
274 common::Restorer<bool> AllowNullPointer() {
275 return common::ScopedSet(isNullPointerOk_, true);
276 }
277
278 MaybeExpr Analyze(const parser::IntLiteralConstant &, bool negated = false);
279 MaybeExpr Analyze(const parser::UnsignedLiteralConstant &);
280 MaybeExpr Analyze(const parser::RealLiteralConstant &);
281 MaybeExpr Analyze(const parser::ComplexPart &);
282 MaybeExpr Analyze(const parser::ComplexLiteralConstant &);
283 MaybeExpr Analyze(const parser::LogicalLiteralConstant &);
284 MaybeExpr Analyze(const parser::CharLiteralConstant &);
285 MaybeExpr Analyze(const parser::HollerithLiteralConstant &);
286 MaybeExpr Analyze(const parser::BOZLiteralConstant &);
287 MaybeExpr Analyze(const parser::NamedConstant &);
288 MaybeExpr Analyze(const parser::DataStmtConstant &);
289 MaybeExpr Analyze(const parser::Substring &);
290 MaybeExpr Analyze(const parser::ArrayElement &);
291 MaybeExpr Analyze(const parser::CoindexedNamedObject &);
292 MaybeExpr Analyze(const parser::CharLiteralConstantSubstring &);
293 MaybeExpr Analyze(const parser::SubstringInquiry &);
294 MaybeExpr Analyze(const parser::ArrayConstructor &);
295 MaybeExpr Analyze(const parser::Expr::Parentheses &);
296 MaybeExpr Analyze(const parser::Expr::UnaryPlus &);
297 MaybeExpr Analyze(const parser::Expr::Negate &);
298 MaybeExpr Analyze(const parser::Expr::NOT &);
299 MaybeExpr Analyze(const parser::Expr::PercentLoc &);
300 MaybeExpr Analyze(const parser::Expr::DefinedUnary &);
301 MaybeExpr Analyze(const parser::Expr::Power &);
302 MaybeExpr Analyze(const parser::Expr::Multiply &);
303 MaybeExpr Analyze(const parser::Expr::Divide &);
304 MaybeExpr Analyze(const parser::Expr::Add &);
305 MaybeExpr Analyze(const parser::Expr::Subtract &);
306 MaybeExpr Analyze(const parser::Expr::ComplexConstructor &);
307 MaybeExpr Analyze(const parser::Expr::Concat &);
308 MaybeExpr Analyze(const parser::Expr::LT &);
309 MaybeExpr Analyze(const parser::Expr::LE &);
310 MaybeExpr Analyze(const parser::Expr::EQ &);
311 MaybeExpr Analyze(const parser::Expr::NE &);
312 MaybeExpr Analyze(const parser::Expr::GE &);
313 MaybeExpr Analyze(const parser::Expr::GT &);
314 MaybeExpr Analyze(const parser::Expr::AND &);
315 MaybeExpr Analyze(const parser::Expr::OR &);
316 MaybeExpr Analyze(const parser::Expr::EQV &);
317 MaybeExpr Analyze(const parser::Expr::NEQV &);
318 MaybeExpr Analyze(const parser::Expr::DefinedBinary &);
319 template <typename A> MaybeExpr Analyze(const A &x) {
320 return Analyze(x.u); // default case
321 }
322 template <typename... As> MaybeExpr Analyze(const std::variant<As...> &u) {
323 return common::visit([&](const auto &x) { return Analyze(x); }, u);
324 }
325
326 // Analysis subroutines
327 int AnalyzeKindParam(
328 const std::optional<parser::KindParam> &, int defaultKind);
329 template <typename PARSED>
330 MaybeExpr ExprOrVariable(const PARSED &, parser::CharBlock source);
331 template <typename TYPES, TypeCategory CAT, typename PARSED>
332 MaybeExpr IntLiteralConstant(const PARSED &, bool isNegated = false);
333 MaybeExpr AnalyzeString(std::string &&, int kind);
334 std::optional<Expr<SubscriptInteger>> AsSubscript(MaybeExpr &&);
335 std::optional<Expr<SubscriptInteger>> TripletPart(
336 const std::optional<parser::Subscript> &);
337 std::optional<Subscript> AnalyzeSectionSubscript(
339 std::vector<Subscript> AnalyzeSectionSubscripts(
340 const std::list<parser::SectionSubscript> &);
341 std::optional<Component> CreateComponent(DataRef &&, const Symbol &,
342 const semantics::Scope &, bool C919bAlreadyEnforced = false);
343 MaybeExpr CompleteSubscripts(ArrayRef &&);
344 MaybeExpr ApplySubscripts(DataRef &&, std::vector<Subscript> &&);
345 bool CheckRanks(const DataRef &); // Return false if error exists.
346 bool CheckPolymorphic(const DataRef &); // ditto
347 bool CheckDataRef(const DataRef &); // ditto
348 std::optional<Expr<SubscriptInteger>> GetSubstringBound(
349 const std::optional<parser::ScalarIntExpr> &);
350 MaybeExpr AnalyzeDefinedOp(
351 const parser::Name &, ActualArguments &&, const Symbol *&);
352 MaybeExpr FixMisparsedSubstring(const parser::Designator &);
353
354 struct CalleeAndArguments {
355 // A non-component function reference may constitute a misparsed
356 // structure constructor, in which case its derived type's Symbol
357 // will appear here.
358 std::variant<ProcedureDesignator, SymbolRef> u;
359 ActualArguments arguments;
360 };
361
362 std::optional<CalleeAndArguments> AnalyzeProcedureComponentRef(
363 const parser::ProcComponentRef &, ActualArguments &&, bool isSubroutine);
364 std::optional<characteristics::Procedure> CheckCall(
365 parser::CharBlock, const ProcedureDesignator &, ActualArguments &);
366 using AdjustActuals =
367 std::optional<std::function<bool(const Symbol &, ActualArguments &)>>;
368 const Symbol *ResolveForward(const Symbol &);
369 struct GenericResolution {
370 const Symbol *specific{nullptr};
371 bool failedDueToAmbiguity{false};
372 SymbolVector tried{};
373 };
374 GenericResolution ResolveGeneric(const Symbol &, const ActualArguments &,
375 const AdjustActuals &, bool isSubroutine, SymbolVector &&tried,
376 bool mightBeStructureConstructor = false);
377 void EmitGenericResolutionError(const Symbol &, bool dueToNullActuals,
378 bool isSubroutine, const ActualArguments &, const SymbolVector &,
379 const AdjustActuals &);
380 const Symbol &AccessSpecific(
381 const Symbol &originalGeneric, const Symbol &specific);
382 std::optional<CalleeAndArguments> GetCalleeAndArguments(const parser::Name &,
383 ActualArguments &&, bool isSubroutine = false,
384 bool mightBeStructureConstructor = false);
385 std::optional<CalleeAndArguments> GetCalleeAndArguments(
386 const parser::ProcedureDesignator &, ActualArguments &&,
387 bool isSubroutine, bool mightBeStructureConstructor = false);
388 void CheckBadExplicitType(const SpecificCall &, const Symbol &);
389 void CheckForBadRecursion(parser::CharBlock, const semantics::Symbol &);
390 bool EnforceTypeConstraint(parser::CharBlock, const MaybeExpr &, TypeCategory,
391 bool defaultKind = false);
392 MaybeExpr MakeFunctionRef(
393 parser::CharBlock, ProcedureDesignator &&, ActualArguments &&);
394 MaybeExpr MakeFunctionRef(parser::CharBlock intrinsic, ActualArguments &&);
395 template <typename T> T Fold(T &&expr) {
396 return evaluate::Fold(foldingContext_, std::move(expr));
397 }
398 bool CheckIsValidForwardReference(const semantics::DerivedTypeSpec &);
399 MaybeExpr AnalyzeComplex(MaybeExpr &&re, MaybeExpr &&im, const char *what);
400 std::optional<Chevrons> AnalyzeChevrons(const parser::CallStmt &);
401
402 // CheckStructureConstructor() is used for parsed structure constructors
403 // as well as for generic function references.
404 struct ComponentSpec {
405 ComponentSpec() = default;
406 ComponentSpec(ComponentSpec &&) = default;
407 parser::CharBlock source, exprSource;
408 bool hasKeyword{false};
409 const Symbol *keywordSymbol{nullptr};
410 MaybeExpr expr;
411 };
412 MaybeExpr CheckStructureConstructor(parser::CharBlock typeName,
413 const semantics::DerivedTypeSpec &, std::list<ComponentSpec> &&);
414 MaybeExpr AnalyzeEnumerationConstructor(parser::CharBlock typeName,
416 const std::list<parser::ComponentSpec> &);
417
418 MaybeExpr IterativelyAnalyzeSubexpressions(const parser::Expr &);
419
421 FoldingContext &foldingContext_{context_.foldingContext()};
422 std::map<parser::CharBlock, int> impliedDos_; // values are INTEGER kinds
423 std::map<parser::CharBlock,
424 std::pair<parser::CharBlock, evaluate::characteristics::Procedure>>
425 implicitInterfaces_;
426 bool isWholeAssumedSizeArrayOk_{false};
427 bool isNullPointerOk_{false};
428 bool useSavedTypedExprs_{true};
429 bool inWhereBody_{false};
430 bool inDataStmtObject_{false};
431 bool inDataStmtConstant_{false};
432 bool inStmtFunctionDefinition_{false};
433 bool iterativelyAnalyzingSubexpressions_{false};
434 friend class ArgumentAnalyzer;
435};
436
437inline bool AreConformable(int leftRank, int rightRank) {
438 return leftRank == 0 || rightRank == 0 || leftRank == rightRank;
439}
440
441template <typename L, typename R>
442bool AreConformable(const L &left, const R &right) {
443 return AreConformable(left.Rank(), right.Rank());
444}
445
446template <typename L, typename R>
447void ConformabilityCheck(
448 parser::ContextualMessages &context, const L &left, const R &right) {
449 if (!AreConformable(left, right)) {
450 context.Say("left operand has rank %d, right operand has rank %d"_err_en_US,
451 left.Rank(), right.Rank());
452 }
453}
454} // namespace Fortran::evaluate
455
456namespace Fortran::semantics {
457
458// Semantic analysis of one expression, variable, selector, designator, &c.
459template <typename A>
460std::optional<evaluate::Expr<evaluate::SomeType>> AnalyzeExpr(
461 SemanticsContext &context, const A &expr) {
462 return evaluate::ExpressionAnalyzer{context}.Analyze(expr);
463}
464
465// Semantic analysis of an intrinsic type's KIND parameter expression.
466evaluate::Expr<evaluate::SubscriptInteger> AnalyzeKindSelector(
467 SemanticsContext &, common::TypeCategory,
468 const std::optional<parser::KindSelector> &);
469
470void NoteUsedSymbols(
471 SemanticsContext &, const SomeExpr &, bool isDefinition = false);
472
473bool CheckMisparsedArrayElement(
474 SemanticsContext &, const parser::FunctionReference &);
475
476// Semantic analysis of all expressions in a parse tree, which becomes
477// decorated with typed representations for top-level expressions.
478class ExprChecker {
479public:
480 explicit ExprChecker(SemanticsContext &);
481
482 template <typename A> bool Pre(const A &) { return true; }
483 template <typename A> void Post(const A &) {}
484 bool Walk(const parser::Program &);
485
486 bool Pre(const parser::Expr &x) {
487 AnalyzeAndNoteUses(x);
488 return false;
489 }
490 bool Pre(const parser::Variable &x) {
491 AnalyzeAndNoteUses(x);
492 return false;
493 }
494 bool Pre(const parser::Selector &x) {
495 exprAnalyzer_.Analyze(x);
496 return false;
497 }
498 bool Pre(const parser::DataStmtValue &x) {
499 exprAnalyzer_.Analyze(x);
500 return false;
501 }
502 bool Pre(const parser::AllocateObject &x) {
503 AnalyzeAndNoteUses(x, /*isDefinition=*/true);
504 return false;
505 }
506 bool Pre(const parser::PointerObject &x) {
507 AnalyzeAndNoteUses(x, /*isDefinition=*/true);
508 return false;
509 }
510 bool Pre(const parser::DataStmtObject &);
511 void Post(const parser::DataStmtObject &);
512 bool Pre(const parser::DataImpliedDo &);
513
514 bool Pre(const parser::CallStmt &x) {
515 AnalyzeAndNoteUses(x);
516 return false;
517 }
518 bool Pre(const parser::AssignmentStmt &x) {
519 AnalyzeAndNoteUses(x);
520 return false;
521 }
522 bool Pre(const parser::PointerAssignmentStmt &x) {
523 AnalyzeAndNoteUses(x);
524 return false;
525 }
526
527 // Track whether we're in a WHERE statement or construct body
528 bool Pre(const parser::WhereStmt &) {
529 ++whereDepth_;
530 exprAnalyzer_.set_inWhereBody(InWhereBody());
531 return true;
532 }
533 void Post(const parser::WhereStmt &) {
534 --whereDepth_;
535 exprAnalyzer_.set_inWhereBody(InWhereBody());
536 }
537 bool Pre(const parser::WhereBodyConstruct &) {
538 ++whereDepth_;
539 exprAnalyzer_.set_inWhereBody(InWhereBody());
540 return true;
541 }
542 void Post(const parser::WhereBodyConstruct &) {
543 --whereDepth_;
544 exprAnalyzer_.set_inWhereBody(InWhereBody());
545 }
546
547 bool Pre(const parser::IfConstruct &);
548
549 bool Pre(const parser::ComponentDefStmt &) {
550 inComponentDefStmt_ = true;
551 return true;
552 }
553 void Post(const parser::ComponentDefStmt &) { inComponentDefStmt_ = false; }
554 bool Pre(const parser::KindSelector &) { return !inComponentDefStmt_; }
555 bool Pre(const parser::Initialization &x) {
556 // Default component initialization expressions (but not DATA-like ones
557 // as in DEC STRUCTUREs) were already analyzed in name resolution
558 // and PDT instantiation; do not attempt to re-analyze them without
559 // type parameters.
560 return !inComponentDefStmt_ ||
561 std::holds_alternative<
562 std::list<common::Indirection<parser::DataStmtValue>>>(x.u);
563 }
564
565 template <typename A> bool Pre(const parser::Scalar<A> &x) {
566 AnalyzeAndNoteUses(x);
567 return false;
568 }
569 template <typename A> bool Pre(const parser::Constant<A> &x) {
570 AnalyzeAndNoteUses(x);
571 return false;
572 }
573 template <typename A> bool Pre(const parser::Integer<A> &x) {
574 AnalyzeAndNoteUses(x);
575 return false;
576 }
577 template <typename A> bool Pre(const parser::Logical<A> &x) {
578 AnalyzeAndNoteUses(x);
579 return false;
580 }
581 template <typename A> bool Pre(const parser::DefaultChar<A> &x) {
582 AnalyzeAndNoteUses(x);
583 return false;
584 }
585
586private:
587 template <typename A>
588 void AnalyzeAndNoteUses(
589 const A &x, [[maybe_unused]] bool isDefinition = false) {
590 exprAnalyzer_.Analyze(x);
591 if constexpr (parser::HasTypedExpr<A>::value) {
592 if (x.typedExpr && x.typedExpr->v) {
593 NoteUsedSymbols(context_, *x.typedExpr->v, isDefinition);
594 }
595 } else if constexpr (parser::HasTypedCall<A>::value) {
596 if (x.typedCall) {
597 context_.NoteUsedSymbols(
598 evaluate::CollectUsedSymbolValues(context_, *x.typedCall));
599 }
600 } else if constexpr (parser::HasTypedAssignment<A>::value) {
601 if (x.typedAssignment && x.typedAssignment->v) {
602 context_.NoteUsedSymbols(
603 evaluate::CollectUsedSymbolValues(context_, *x.typedAssignment->v));
604 }
605 }
606 }
607 bool InWhereBody() const { return whereDepth_ > 0; }
608
609 SemanticsContext &context_;
610 evaluate::ExpressionAnalyzer exprAnalyzer_{context_};
611 int whereDepth_{0}; // nesting of WHERE statements & constructs
612 bool inComponentDefStmt_{false};
613};
614} // namespace Fortran::semantics
615#endif // FORTRAN_SEMANTICS_EXPRESSION_H_
Definition indirection.h:31
Definition restorer.h:24
Definition variable.h:205
Definition expression.h:920
Definition type.h:73
Definition common.h:215
Definition expression.h:100
Definition common.h:217
Definition char-block.h:26
Definition message.h:397
Definition message.h:200
Definition scope.h:68
Definition semantics.h:67
Definition symbol.h:893
Definition call.h:34
Definition check-expression.h:19
Definition variable.h:288
Definition expression.h:938
Definition expression.h:70
Definition intrinsics.h:44
Definition parse-tree.h:1952
Definition parse-tree.h:1938
Definition parse-tree.h:2045
Definition parse-tree.h:3343
Definition parse-tree.h:861
Definition parse-tree.h:1932
Definition parse-tree.h:847
Definition parse-tree.h:839
Definition parse-tree.h:1109
Definition parse-tree.h:1727
Definition parse-tree.h:305
Definition parse-tree.h:1550
Definition parse-tree.h:1848
Definition parse-tree.h:1509
Definition parse-tree.h:1558
Definition parse-tree.h:1530
Definition parse-tree.h:329
Definition parse-tree.h:1887
Definition parse-tree.h:1799
Definition parse-tree.h:1772
Definition parse-tree.h:1813
Definition parse-tree.h:1778
Definition parse-tree.h:1817
Definition parse-tree.h:1754
Definition parse-tree.h:1769
Definition parse-tree.h:1805
Definition parse-tree.h:1787
Definition parse-tree.h:1793
Definition parse-tree.h:1796
Definition parse-tree.h:1784
Definition parse-tree.h:1781
Definition parse-tree.h:1766
Definition parse-tree.h:1808
Definition parse-tree.h:1790
Definition parse-tree.h:1748
Definition parse-tree.h:1745
Definition parse-tree.h:1802
Definition parse-tree.h:1739
Definition parse-tree.h:1763
Definition parse-tree.h:1775
Definition parse-tree.h:1742
Definition parse-tree.h:1735
Definition parse-tree.h:3331
Definition tools.h:135
Definition tools.h:145
Definition tools.h:141
Definition parse-tree.h:2399
Definition parse-tree.h:1019
Definition parse-tree.h:797
Definition parse-tree.h:313
Definition parse-tree.h:662
Definition parse-tree.h:875
Definition parse-tree.h:321
Definition parse-tree.h:591
Definition parse-tree.h:2067
Definition parse-tree.h:2028
Definition parse-tree.h:1927
Definition parse-tree.h:3270
Definition parse-tree.h:816
Definition parse-tree.h:297
Definition parse-tree.h:1693
Definition parse-tree.h:2178
Definition parse-tree.h:3407
Definition parse-tree.h:1917
Definition parse-tree.h:1210
Definition parse-tree.h:1879
Definition parse-tree.h:1865
Definition parse-tree.h:803
Definition parse-tree.h:1895
Definition parse-tree.h:2093
Definition parse-tree.h:2080