1 //===-- lib/Semantics/compute-offsets.cpp -----------------------*- 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 #include "compute-offsets.h" 10 #include "../../runtime/descriptor.h" 11 #include "flang/Evaluate/fold-designator.h" 12 #include "flang/Evaluate/fold.h" 13 #include "flang/Evaluate/shape.h" 14 #include "flang/Evaluate/type.h" 15 #include "flang/Semantics/scope.h" 16 #include "flang/Semantics/semantics.h" 17 #include "flang/Semantics/symbol.h" 18 #include "flang/Semantics/tools.h" 19 #include "flang/Semantics/type.h" 20 #include <algorithm> 21 #include <vector> 22 23 namespace Fortran::semantics { 24 25 class ComputeOffsetsHelper { 26 public: 27 // TODO: configure based on target 28 static constexpr std::size_t maxAlignment{8}; 29 30 ComputeOffsetsHelper(SemanticsContext &context) : context_{context} {} 31 void Compute() { Compute(context_.globalScope()); } 32 33 private: 34 struct SizeAndAlignment { 35 SizeAndAlignment() {} 36 SizeAndAlignment(std::size_t bytes) : size{bytes}, alignment{bytes} {} 37 SizeAndAlignment(std::size_t bytes, std::size_t align) 38 : size{bytes}, alignment{align} {} 39 std::size_t size{0}; 40 std::size_t alignment{0}; 41 }; 42 struct SymbolAndOffset { 43 SymbolAndOffset(Symbol &s, std::size_t off, const EquivalenceObject &obj) 44 : symbol{&s}, offset{off}, object{&obj} {} 45 SymbolAndOffset(const SymbolAndOffset &) = default; 46 Symbol *symbol; 47 std::size_t offset; 48 const EquivalenceObject *object; 49 }; 50 51 void Compute(Scope &); 52 void DoScope(Scope &); 53 void DoCommonBlock(Symbol &); 54 void DoEquivalenceBlockBase(Symbol &, SizeAndAlignment &); 55 void DoEquivalenceSet(const EquivalenceSet &); 56 SymbolAndOffset Resolve(const SymbolAndOffset &); 57 std::size_t ComputeOffset(const EquivalenceObject &); 58 void DoSymbol(Symbol &); 59 SizeAndAlignment GetSizeAndAlignment(const Symbol &); 60 SizeAndAlignment GetElementSize(const Symbol &); 61 std::size_t CountElements(const Symbol &); 62 static std::size_t Align(std::size_t, std::size_t); 63 static SizeAndAlignment GetIntrinsicSizeAndAlignment(TypeCategory, int); 64 65 SemanticsContext &context_; 66 evaluate::FoldingContext &foldingContext_{context_.foldingContext()}; 67 std::size_t offset_{0}; 68 std::size_t alignment_{0}; 69 // symbol -> symbol+offset that determines its location, from EQUIVALENCE 70 std::map<MutableSymbolRef, SymbolAndOffset> dependents_; 71 // base symbol -> SizeAndAlignment for each distinct EQUIVALENCE block 72 std::map<MutableSymbolRef, SizeAndAlignment> equivalenceBlock_; 73 }; 74 75 void ComputeOffsetsHelper::Compute(Scope &scope) { 76 for (Scope &child : scope.children()) { 77 Compute(child); 78 } 79 DoScope(scope); 80 dependents_.clear(); 81 equivalenceBlock_.clear(); 82 } 83 84 static bool InCommonBlock(const Symbol &symbol) { 85 const auto *details{symbol.detailsIf<ObjectEntityDetails>()}; 86 return details && details->commonBlock(); 87 } 88 89 void ComputeOffsetsHelper::DoScope(Scope &scope) { 90 if (scope.symbol() && scope.IsParameterizedDerivedType()) { 91 return; // only process instantiations of parameterized derived types 92 } 93 // Build dependents_ from equivalences: symbol -> symbol+offset 94 for (const EquivalenceSet &set : scope.equivalenceSets()) { 95 DoEquivalenceSet(set); 96 } 97 offset_ = 0; 98 alignment_ = 0; 99 // Compute a base symbol and overall block size for each 100 // disjoint EQUIVALENCE storage sequence. 101 for (auto &[symbol, dep] : dependents_) { 102 dep = Resolve(dep); 103 CHECK(symbol->size() == 0); 104 auto symInfo{GetSizeAndAlignment(*symbol)}; 105 symbol->set_size(symInfo.size); 106 Symbol &base{*dep.symbol}; 107 auto iter{equivalenceBlock_.find(base)}; 108 std::size_t minBlockSize{dep.offset + symInfo.size}; 109 if (iter == equivalenceBlock_.end()) { 110 equivalenceBlock_.emplace( 111 base, SizeAndAlignment{minBlockSize, symInfo.alignment}); 112 } else { 113 SizeAndAlignment &blockInfo{iter->second}; 114 blockInfo.size = std::max(blockInfo.size, minBlockSize); 115 blockInfo.alignment = std::max(blockInfo.alignment, symInfo.alignment); 116 } 117 } 118 // Assign offsets for non-COMMON EQUIVALENCE blocks 119 for (auto &[symbol, blockInfo] : equivalenceBlock_) { 120 if (!InCommonBlock(*symbol)) { 121 DoSymbol(*symbol); 122 DoEquivalenceBlockBase(*symbol, blockInfo); 123 offset_ = std::max(offset_, symbol->offset() + blockInfo.size); 124 } 125 } 126 // Process remaining non-COMMON symbols; this is all of them if there 127 // was no use of EQUIVALENCE in the scope. 128 for (auto &symbol : scope.GetSymbols()) { 129 if (!InCommonBlock(*symbol) && 130 dependents_.find(symbol) == dependents_.end() && 131 equivalenceBlock_.find(symbol) == equivalenceBlock_.end()) { 132 DoSymbol(*symbol); 133 } 134 } 135 scope.set_size(offset_); 136 scope.set_alignment(alignment_); 137 // Assign offsets in COMMON blocks. 138 for (auto &pair : scope.commonBlocks()) { 139 DoCommonBlock(*pair.second); 140 } 141 for (auto &[symbol, dep] : dependents_) { 142 symbol->set_offset(dep.symbol->offset() + dep.offset); 143 if (const auto *block{FindCommonBlockContaining(*dep.symbol)}) { 144 symbol->get<ObjectEntityDetails>().set_commonBlock(*block); 145 } 146 } 147 } 148 149 auto ComputeOffsetsHelper::Resolve(const SymbolAndOffset &dep) 150 -> SymbolAndOffset { 151 auto it{dependents_.find(*dep.symbol)}; 152 if (it == dependents_.end()) { 153 return dep; 154 } else { 155 SymbolAndOffset result{Resolve(it->second)}; 156 result.offset += dep.offset; 157 result.object = dep.object; 158 return result; 159 } 160 } 161 162 void ComputeOffsetsHelper::DoCommonBlock(Symbol &commonBlock) { 163 auto &details{commonBlock.get<CommonBlockDetails>()}; 164 offset_ = 0; 165 alignment_ = 0; 166 std::size_t minSize{0}; 167 std::size_t minAlignment{0}; 168 for (auto &object : details.objects()) { 169 Symbol &symbol{*object}; 170 DoSymbol(symbol); 171 auto iter{dependents_.find(symbol)}; 172 if (iter == dependents_.end()) { 173 // Get full extent of any EQUIVALENCE block into size of COMMON 174 auto eqIter{equivalenceBlock_.find(symbol)}; 175 if (eqIter != equivalenceBlock_.end()) { 176 SizeAndAlignment &blockInfo{eqIter->second}; 177 DoEquivalenceBlockBase(symbol, blockInfo); 178 minSize = std::max( 179 minSize, std::max(offset_, symbol.offset() + blockInfo.size)); 180 minAlignment = std::max(minAlignment, blockInfo.alignment); 181 } 182 } else { 183 SymbolAndOffset &dep{iter->second}; 184 Symbol &base{*dep.symbol}; 185 auto errorSite{ 186 commonBlock.name().empty() ? symbol.name() : commonBlock.name()}; 187 if (const auto *baseBlock{FindCommonBlockContaining(base)}) { 188 if (baseBlock == &commonBlock) { 189 context_.Say(errorSite, 190 "'%s' is storage associated with '%s' by EQUIVALENCE elsewhere in COMMON block /%s/"_err_en_US, 191 symbol.name(), base.name(), commonBlock.name()); 192 } else { // 8.10.3(1) 193 context_.Say(errorSite, 194 "'%s' in COMMON block /%s/ must not be storage associated with '%s' in COMMON block /%s/ by EQUIVALENCE"_err_en_US, 195 symbol.name(), commonBlock.name(), base.name(), 196 baseBlock->name()); 197 } 198 } else if (dep.offset > symbol.offset()) { // 8.10.3(3) 199 context_.Say(errorSite, 200 "'%s' cannot backward-extend COMMON block /%s/ via EQUIVALENCE with '%s'"_err_en_US, 201 symbol.name(), commonBlock.name(), base.name()); 202 } else { 203 base.get<ObjectEntityDetails>().set_commonBlock(commonBlock); 204 base.set_offset(symbol.offset() - dep.offset); 205 } 206 } 207 } 208 commonBlock.set_size(std::max(minSize, offset_)); 209 details.set_alignment(std::max(minAlignment, alignment_)); 210 } 211 212 void ComputeOffsetsHelper::DoEquivalenceBlockBase( 213 Symbol &symbol, SizeAndAlignment &blockInfo) { 214 if (symbol.size() > blockInfo.size) { 215 blockInfo.size = symbol.size(); 216 } 217 } 218 219 void ComputeOffsetsHelper::DoEquivalenceSet(const EquivalenceSet &set) { 220 std::vector<SymbolAndOffset> symbolOffsets; 221 std::optional<std::size_t> representative; 222 for (const EquivalenceObject &object : set) { 223 std::size_t offset{ComputeOffset(object)}; 224 SymbolAndOffset resolved{ 225 Resolve(SymbolAndOffset{object.symbol, offset, object})}; 226 symbolOffsets.push_back(resolved); 227 if (!representative || 228 resolved.offset >= symbolOffsets[*representative].offset) { 229 // The equivalenced object with the largest offset from its resolved 230 // symbol will be the representative of this set, since the offsets 231 // of the other objects will be positive relative to it. 232 representative = symbolOffsets.size() - 1; 233 } 234 } 235 CHECK(representative); 236 const SymbolAndOffset &base{symbolOffsets[*representative]}; 237 for (const auto &[symbol, offset, object] : symbolOffsets) { 238 if (symbol == base.symbol) { 239 if (offset != base.offset) { 240 auto x{evaluate::OffsetToDesignator( 241 context_.foldingContext(), *symbol, base.offset, 1)}; 242 auto y{evaluate::OffsetToDesignator( 243 context_.foldingContext(), *symbol, offset, 1)}; 244 if (x && y) { 245 context_ 246 .Say(base.object->source, 247 "'%s' and '%s' cannot have the same first storage unit"_err_en_US, 248 x->AsFortran(), y->AsFortran()) 249 .Attach(object->source, "Incompatible reference to '%s'"_en_US, 250 y->AsFortran()); 251 } else { // error recovery 252 context_ 253 .Say(base.object->source, 254 "'%s' (offset %zd bytes and %zd bytes) cannot have the same first storage unit"_err_en_US, 255 symbol->name(), base.offset, offset) 256 .Attach(object->source, 257 "Incompatible reference to '%s' offset %zd bytes"_en_US, 258 symbol->name(), offset); 259 } 260 } 261 } else { 262 dependents_.emplace(*symbol, 263 SymbolAndOffset{*base.symbol, base.offset - offset, *object}); 264 } 265 } 266 } 267 268 // Offset of this equivalence object from the start of its variable. 269 std::size_t ComputeOffsetsHelper::ComputeOffset( 270 const EquivalenceObject &object) { 271 std::size_t offset{0}; 272 if (!object.subscripts.empty()) { 273 const ArraySpec &shape{object.symbol.get<ObjectEntityDetails>().shape()}; 274 auto lbound{[&](std::size_t i) { 275 return *ToInt64(shape[i].lbound().GetExplicit()); 276 }}; 277 auto ubound{[&](std::size_t i) { 278 return *ToInt64(shape[i].ubound().GetExplicit()); 279 }}; 280 for (std::size_t i{object.subscripts.size() - 1};;) { 281 offset += object.subscripts[i] - lbound(i); 282 if (i == 0) { 283 break; 284 } 285 --i; 286 offset *= ubound(i) - lbound(i) + 1; 287 } 288 } 289 auto result{offset * GetElementSize(object.symbol).size}; 290 if (object.substringStart) { 291 int kind{context_.defaultKinds().GetDefaultKind(TypeCategory::Character)}; 292 if (const DeclTypeSpec * type{object.symbol.GetType()}) { 293 if (const IntrinsicTypeSpec * intrinsic{type->AsIntrinsic()}) { 294 kind = ToInt64(intrinsic->kind()).value_or(kind); 295 } 296 } 297 result += kind * (*object.substringStart - 1); 298 } 299 return result; 300 } 301 302 void ComputeOffsetsHelper::DoSymbol(Symbol &symbol) { 303 if (symbol.has<TypeParamDetails>() || symbol.has<SubprogramDetails>() || 304 symbol.has<UseDetails>() || symbol.has<ProcBindingDetails>()) { 305 return; // these have type but no size 306 } 307 SizeAndAlignment s{GetSizeAndAlignment(symbol)}; 308 if (s.size == 0) { 309 return; 310 } 311 offset_ = Align(offset_, s.alignment); 312 symbol.set_size(s.size); 313 symbol.set_offset(offset_); 314 offset_ += s.size; 315 alignment_ = std::max(alignment_, s.alignment); 316 } 317 318 auto ComputeOffsetsHelper::GetSizeAndAlignment(const Symbol &symbol) 319 -> SizeAndAlignment { 320 SizeAndAlignment result{GetElementSize(symbol)}; 321 std::size_t elements{CountElements(symbol)}; 322 if (elements > 1) { 323 result.size = Align(result.size, result.alignment); 324 } 325 result.size *= elements; 326 return result; 327 } 328 329 auto ComputeOffsetsHelper::GetElementSize(const Symbol &symbol) 330 -> SizeAndAlignment { 331 const DeclTypeSpec *type{symbol.GetType()}; 332 if (!type) { 333 return {}; 334 } 335 // TODO: The size of procedure pointers is not yet known 336 // and is independent of rank (and probably also the number 337 // of length type parameters). 338 if (IsDescriptor(symbol) || IsProcedurePointer(symbol)) { 339 int lenParams{0}; 340 if (const DerivedTypeSpec * derived{type->AsDerived()}) { 341 lenParams = CountLenParameters(*derived); 342 } 343 std::size_t size{ 344 runtime::Descriptor::SizeInBytes(symbol.Rank(), false, lenParams)}; 345 return {size, maxAlignment}; 346 } 347 if (IsProcedure(symbol)) { 348 return {}; 349 } 350 SizeAndAlignment result; 351 if (const IntrinsicTypeSpec * intrinsic{type->AsIntrinsic()}) { 352 if (auto kind{ToInt64(intrinsic->kind())}) { 353 result = GetIntrinsicSizeAndAlignment(intrinsic->category(), *kind); 354 } 355 if (type->category() == DeclTypeSpec::Character) { 356 ParamValue length{type->characterTypeSpec().length()}; 357 CHECK(length.isExplicit()); // else should be descriptor 358 if (MaybeIntExpr lengthExpr{length.GetExplicit()}) { 359 if (auto lengthInt{ToInt64(*lengthExpr)}) { 360 result.size *= *lengthInt; 361 } 362 } 363 } 364 } else if (const DerivedTypeSpec * derived{type->AsDerived()}) { 365 if (derived->scope()) { 366 result.size = derived->scope()->size(); 367 result.alignment = derived->scope()->alignment(); 368 } 369 } else { 370 DIE("not intrinsic or derived"); 371 } 372 return result; 373 } 374 375 std::size_t ComputeOffsetsHelper::CountElements(const Symbol &symbol) { 376 if (auto shape{GetShape(foldingContext_, symbol)}) { 377 if (auto sizeExpr{evaluate::GetSize(std::move(*shape))}) { 378 if (auto size{ToInt64(Fold(foldingContext_, std::move(*sizeExpr)))}) { 379 return *size; 380 } 381 } 382 } 383 return 1; 384 } 385 386 // Align a size to its natural alignment, up to maxAlignment. 387 std::size_t ComputeOffsetsHelper::Align(std::size_t x, std::size_t alignment) { 388 if (alignment > maxAlignment) { 389 alignment = maxAlignment; 390 } 391 return (x + alignment - 1) & -alignment; 392 } 393 394 auto ComputeOffsetsHelper::GetIntrinsicSizeAndAlignment( 395 TypeCategory category, int kind) -> SizeAndAlignment { 396 if (category == TypeCategory::Character) { 397 return {static_cast<std::size_t>(kind)}; 398 } 399 std::optional<std::size_t> size{ 400 evaluate::DynamicType{category, kind}.MeasureSizeInBytes()}; 401 CHECK(size.has_value()); 402 if (category == TypeCategory::Complex) { 403 return {*size, *size >> 1}; 404 } else { 405 return {*size}; 406 } 407 } 408 409 void ComputeOffsets(SemanticsContext &context) { 410 ComputeOffsetsHelper{context}.Compute(); 411 } 412 413 } // namespace Fortran::semantics 414