peter klausler | d1862eb | 2020-06-18 20:28:43 | [diff] [blame] | 1 | //===-- lib/Semantics/compute-offsets.cpp -----------------------*- C++ -*-===// |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 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" |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 10 | #include "flang/Evaluate/fold-designator.h" |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 11 | #include "flang/Evaluate/fold.h" |
| 12 | #include "flang/Evaluate/shape.h" |
| 13 | #include "flang/Evaluate/type.h" |
Peter Klausler | 830c0b9 | 2021-09-01 23:00:53 | [diff] [blame] | 14 | #include "flang/Runtime/descriptor.h" |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 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: |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 27 | ComputeOffsetsHelper(SemanticsContext &context) : context_{context} {} |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 28 | void Compute(Scope &); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 29 | |
| 30 | private: |
Tim Keith | 54b35c06 | 2020-05-06 22:00:14 | [diff] [blame] | 31 | struct SizeAndAlignment { |
| 32 | SizeAndAlignment() {} |
peter klausler | d1862eb | 2020-06-18 20:28:43 | [diff] [blame] | 33 | SizeAndAlignment(std::size_t bytes) : size{bytes}, alignment{bytes} {} |
| 34 | SizeAndAlignment(std::size_t bytes, std::size_t align) |
| 35 | : size{bytes}, alignment{align} {} |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 36 | std::size_t size{0}; |
Tim Keith | 54b35c06 | 2020-05-06 22:00:14 | [diff] [blame] | 37 | std::size_t alignment{0}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 38 | }; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 39 | struct SymbolAndOffset { |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 40 | SymbolAndOffset(Symbol &s, std::size_t off, const EquivalenceObject &obj) |
peter klausler | d60a022 | 2021-08-10 17:22:39 | [diff] [blame] | 41 | : symbol{s}, offset{off}, object{&obj} {} |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 42 | SymbolAndOffset(const SymbolAndOffset &) = default; |
peter klausler | d60a022 | 2021-08-10 17:22:39 | [diff] [blame] | 43 | MutableSymbolRef symbol; |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 44 | std::size_t offset; |
| 45 | const EquivalenceObject *object; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 46 | }; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 47 | |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 48 | void DoCommonBlock(Symbol &); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 49 | void DoEquivalenceBlockBase(Symbol &, SizeAndAlignment &); |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 50 | void DoEquivalenceSet(const EquivalenceSet &); |
| 51 | SymbolAndOffset Resolve(const SymbolAndOffset &); |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 52 | std::size_t ComputeOffset(const EquivalenceObject &); |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 53 | // Returns amount of padding that was needed for alignment |
| 54 | std::size_t DoSymbol(Symbol &); |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 55 | SizeAndAlignment GetSizeAndAlignment(const Symbol &, bool entire); |
| 56 | std::size_t Align(std::size_t, std::size_t); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 57 | |
| 58 | SemanticsContext &context_; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 59 | std::size_t offset_{0}; |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 60 | std::size_t alignment_{1}; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 61 | // symbol -> symbol+offset that determines its location, from EQUIVALENCE |
peter klausler | 0d8331c | 2021-03-18 17:26:23 | [diff] [blame] | 62 | std::map<MutableSymbolRef, SymbolAndOffset, SymbolAddressCompare> dependents_; |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 63 | // base symbol -> SizeAndAlignment for each distinct EQUIVALENCE block |
peter klausler | 0d8331c | 2021-03-18 17:26:23 | [diff] [blame] | 64 | std::map<MutableSymbolRef, SizeAndAlignment, SymbolAddressCompare> |
| 65 | equivalenceBlock_; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 66 | }; |
| 67 | |
| 68 | void ComputeOffsetsHelper::Compute(Scope &scope) { |
| 69 | for (Scope &child : scope.children()) { |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 70 | ComputeOffsets(context_, child); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 71 | } |
Jean Perier | f2da8f5 | 2022-03-11 18:03:19 | [diff] [blame] | 72 | if (scope.symbol() && scope.IsDerivedTypeWithKindParameter()) { |
Jean Perier | f88a949 | 2022-03-03 09:14:08 | [diff] [blame] | 73 | return; // only process instantiations of kind parameterized derived types |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 74 | } |
peter klausler | 4fede8b | 2020-12-07 22:46:24 | [diff] [blame] | 75 | if (scope.alignment().has_value()) { |
| 76 | return; // prevent infinite recursion in error cases |
| 77 | } |
| 78 | scope.SetAlignment(0); |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 79 | // Build dependents_ from equivalences: symbol -> symbol+offset |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 80 | for (const EquivalenceSet &set : scope.equivalenceSets()) { |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 81 | DoEquivalenceSet(set); |
| 82 | } |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 83 | // Compute a base symbol and overall block size for each |
| 84 | // disjoint EQUIVALENCE storage sequence. |
| 85 | for (auto &[symbol, dep] : dependents_) { |
| 86 | dep = Resolve(dep); |
| 87 | CHECK(symbol->size() == 0); |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 88 | auto symInfo{GetSizeAndAlignment(*symbol, true)}; |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 89 | symbol->set_size(symInfo.size); |
| 90 | Symbol &base{*dep.symbol}; |
| 91 | auto iter{equivalenceBlock_.find(base)}; |
| 92 | std::size_t minBlockSize{dep.offset + symInfo.size}; |
| 93 | if (iter == equivalenceBlock_.end()) { |
| 94 | equivalenceBlock_.emplace( |
| 95 | base, SizeAndAlignment{minBlockSize, symInfo.alignment}); |
| 96 | } else { |
| 97 | SizeAndAlignment &blockInfo{iter->second}; |
| 98 | blockInfo.size = std::max(blockInfo.size, minBlockSize); |
| 99 | blockInfo.alignment = std::max(blockInfo.alignment, symInfo.alignment); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 100 | } |
| 101 | } |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 102 | // Assign offsets for non-COMMON EQUIVALENCE blocks |
| 103 | for (auto &[symbol, blockInfo] : equivalenceBlock_) { |
| 104 | if (!InCommonBlock(*symbol)) { |
| 105 | DoSymbol(*symbol); |
| 106 | DoEquivalenceBlockBase(*symbol, blockInfo); |
| 107 | offset_ = std::max(offset_, symbol->offset() + blockInfo.size); |
| 108 | } |
| 109 | } |
| 110 | // Process remaining non-COMMON symbols; this is all of them if there |
| 111 | // was no use of EQUIVALENCE in the scope. |
| 112 | for (auto &symbol : scope.GetSymbols()) { |
| 113 | if (!InCommonBlock(*symbol) && |
| 114 | dependents_.find(symbol) == dependents_.end() && |
| 115 | equivalenceBlock_.find(symbol) == equivalenceBlock_.end()) { |
| 116 | DoSymbol(*symbol); |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 117 | } |
| 118 | } |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 119 | scope.set_size(offset_); |
peter klausler | 4fede8b | 2020-12-07 22:46:24 | [diff] [blame] | 120 | scope.SetAlignment(alignment_); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 121 | // Assign offsets in COMMON blocks. |
| 122 | for (auto &pair : scope.commonBlocks()) { |
| 123 | DoCommonBlock(*pair.second); |
| 124 | } |
| 125 | for (auto &[symbol, dep] : dependents_) { |
| 126 | symbol->set_offset(dep.symbol->offset() + dep.offset); |
| 127 | if (const auto *block{FindCommonBlockContaining(*dep.symbol)}) { |
| 128 | symbol->get<ObjectEntityDetails>().set_commonBlock(*block); |
| 129 | } |
| 130 | } |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 131 | } |
| 132 | |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 133 | auto ComputeOffsetsHelper::Resolve(const SymbolAndOffset &dep) |
| 134 | -> SymbolAndOffset { |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 135 | auto it{dependents_.find(*dep.symbol)}; |
| 136 | if (it == dependents_.end()) { |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 137 | return dep; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 138 | } else { |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 139 | SymbolAndOffset result{Resolve(it->second)}; |
| 140 | result.offset += dep.offset; |
| 141 | result.object = dep.object; |
| 142 | return result; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 143 | } |
| 144 | } |
| 145 | |
| 146 | void ComputeOffsetsHelper::DoCommonBlock(Symbol &commonBlock) { |
| 147 | auto &details{commonBlock.get<CommonBlockDetails>()}; |
| 148 | offset_ = 0; |
Tim Keith | 54b35c06 | 2020-05-06 22:00:14 | [diff] [blame] | 149 | alignment_ = 0; |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 150 | std::size_t minSize{0}; |
| 151 | std::size_t minAlignment{0}; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 152 | for (auto &object : details.objects()) { |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 153 | Symbol &symbol{*object}; |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 154 | auto errorSite{ |
| 155 | commonBlock.name().empty() ? symbol.name() : commonBlock.name()}; |
| 156 | if (std::size_t padding{DoSymbol(symbol)}) { |
| 157 | context_.Say(errorSite, |
| 158 | "COMMON block /%s/ requires %zd bytes of padding before '%s' for alignment"_port_en_US, |
| 159 | commonBlock.name(), padding, symbol.name()); |
| 160 | } |
Jean Perier | 084d8be | 2021-09-03 06:12:44 | [diff] [blame] | 161 | auto eqIter{equivalenceBlock_.end()}; |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 162 | auto iter{dependents_.find(symbol)}; |
| 163 | if (iter == dependents_.end()) { |
Jean Perier | d892d73 | 2021-09-09 07:11:49 | [diff] [blame] | 164 | eqIter = equivalenceBlock_.find(symbol); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 165 | if (eqIter != equivalenceBlock_.end()) { |
Jean Perier | 084d8be | 2021-09-03 06:12:44 | [diff] [blame] | 166 | DoEquivalenceBlockBase(symbol, eqIter->second); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 167 | } |
| 168 | } else { |
| 169 | SymbolAndOffset &dep{iter->second}; |
| 170 | Symbol &base{*dep.symbol}; |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 171 | if (const auto *baseBlock{FindCommonBlockContaining(base)}) { |
| 172 | if (baseBlock == &commonBlock) { |
| 173 | context_.Say(errorSite, |
| 174 | "'%s' is storage associated with '%s' by EQUIVALENCE elsewhere in COMMON block /%s/"_err_en_US, |
| 175 | symbol.name(), base.name(), commonBlock.name()); |
| 176 | } else { // 8.10.3(1) |
| 177 | context_.Say(errorSite, |
| 178 | "'%s' in COMMON block /%s/ must not be storage associated with '%s' in COMMON block /%s/ by EQUIVALENCE"_err_en_US, |
| 179 | symbol.name(), commonBlock.name(), base.name(), |
| 180 | baseBlock->name()); |
| 181 | } |
| 182 | } else if (dep.offset > symbol.offset()) { // 8.10.3(3) |
| 183 | context_.Say(errorSite, |
| 184 | "'%s' cannot backward-extend COMMON block /%s/ via EQUIVALENCE with '%s'"_err_en_US, |
| 185 | symbol.name(), commonBlock.name(), base.name()); |
| 186 | } else { |
Jean Perier | 084d8be | 2021-09-03 06:12:44 | [diff] [blame] | 187 | eqIter = equivalenceBlock_.find(base); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 188 | base.get<ObjectEntityDetails>().set_commonBlock(commonBlock); |
| 189 | base.set_offset(symbol.offset() - dep.offset); |
| 190 | } |
| 191 | } |
Jean Perier | 084d8be | 2021-09-03 06:12:44 | [diff] [blame] | 192 | // Get full extent of any EQUIVALENCE block into size of COMMON ( see |
| 193 | // 8.10.2.2 point 1 (2)) |
| 194 | if (eqIter != equivalenceBlock_.end()) { |
| 195 | SizeAndAlignment &blockInfo{eqIter->second}; |
| 196 | minSize = std::max( |
| 197 | minSize, std::max(offset_, eqIter->first->offset() + blockInfo.size)); |
| 198 | minAlignment = std::max(minAlignment, blockInfo.alignment); |
| 199 | } |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 200 | } |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 201 | commonBlock.set_size(std::max(minSize, offset_)); |
| 202 | details.set_alignment(std::max(minAlignment, alignment_)); |
Jean Perier | 2c8cb9a | 2022-04-29 12:52:27 | [diff] [blame] | 203 | context_.MapCommonBlockAndCheckConflicts(commonBlock); |
peter klausler | 4ac617f | 2020-08-07 20:25:11 | [diff] [blame] | 204 | } |
| 205 | |
| 206 | void ComputeOffsetsHelper::DoEquivalenceBlockBase( |
| 207 | Symbol &symbol, SizeAndAlignment &blockInfo) { |
| 208 | if (symbol.size() > blockInfo.size) { |
| 209 | blockInfo.size = symbol.size(); |
| 210 | } |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 211 | } |
| 212 | |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 213 | void ComputeOffsetsHelper::DoEquivalenceSet(const EquivalenceSet &set) { |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 214 | std::vector<SymbolAndOffset> symbolOffsets; |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 215 | std::optional<std::size_t> representative; |
| 216 | for (const EquivalenceObject &object : set) { |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 217 | std::size_t offset{ComputeOffset(object)}; |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 218 | SymbolAndOffset resolved{ |
| 219 | Resolve(SymbolAndOffset{object.symbol, offset, object})}; |
| 220 | symbolOffsets.push_back(resolved); |
| 221 | if (!representative || |
| 222 | resolved.offset >= symbolOffsets[*representative].offset) { |
| 223 | // The equivalenced object with the largest offset from its resolved |
| 224 | // symbol will be the representative of this set, since the offsets |
| 225 | // of the other objects will be positive relative to it. |
| 226 | representative = symbolOffsets.size() - 1; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 227 | } |
| 228 | } |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 229 | CHECK(representative); |
| 230 | const SymbolAndOffset &base{symbolOffsets[*representative]}; |
| 231 | for (const auto &[symbol, offset, object] : symbolOffsets) { |
| 232 | if (symbol == base.symbol) { |
| 233 | if (offset != base.offset) { |
| 234 | auto x{evaluate::OffsetToDesignator( |
| 235 | context_.foldingContext(), *symbol, base.offset, 1)}; |
| 236 | auto y{evaluate::OffsetToDesignator( |
| 237 | context_.foldingContext(), *symbol, offset, 1)}; |
| 238 | if (x && y) { |
| 239 | context_ |
| 240 | .Say(base.object->source, |
| 241 | "'%s' and '%s' cannot have the same first storage unit"_err_en_US, |
| 242 | x->AsFortran(), y->AsFortran()) |
| 243 | .Attach(object->source, "Incompatible reference to '%s'"_en_US, |
| 244 | y->AsFortran()); |
| 245 | } else { // error recovery |
| 246 | context_ |
| 247 | .Say(base.object->source, |
| 248 | "'%s' (offset %zd bytes and %zd bytes) cannot have the same first storage unit"_err_en_US, |
| 249 | symbol->name(), base.offset, offset) |
| 250 | .Attach(object->source, |
| 251 | "Incompatible reference to '%s' offset %zd bytes"_en_US, |
| 252 | symbol->name(), offset); |
| 253 | } |
| 254 | } |
| 255 | } else { |
| 256 | dependents_.emplace(*symbol, |
| 257 | SymbolAndOffset{*base.symbol, base.offset - offset, *object}); |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 258 | } |
| 259 | } |
| 260 | } |
| 261 | |
| 262 | // Offset of this equivalence object from the start of its variable. |
| 263 | std::size_t ComputeOffsetsHelper::ComputeOffset( |
| 264 | const EquivalenceObject &object) { |
| 265 | std::size_t offset{0}; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 266 | if (!object.subscripts.empty()) { |
| 267 | const ArraySpec &shape{object.symbol.get<ObjectEntityDetails>().shape()}; |
| 268 | auto lbound{[&](std::size_t i) { |
| 269 | return *ToInt64(shape[i].lbound().GetExplicit()); |
| 270 | }}; |
| 271 | auto ubound{[&](std::size_t i) { |
| 272 | return *ToInt64(shape[i].ubound().GetExplicit()); |
| 273 | }}; |
| 274 | for (std::size_t i{object.subscripts.size() - 1};;) { |
| 275 | offset += object.subscripts[i] - lbound(i); |
| 276 | if (i == 0) { |
| 277 | break; |
| 278 | } |
| 279 | --i; |
| 280 | offset *= ubound(i) - lbound(i) + 1; |
| 281 | } |
| 282 | } |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 283 | auto result{offset * GetSizeAndAlignment(object.symbol, false).size}; |
peter klausler | 31e6cd2 | 2020-07-01 18:45:38 | [diff] [blame] | 284 | if (object.substringStart) { |
| 285 | int kind{context_.defaultKinds().GetDefaultKind(TypeCategory::Character)}; |
| 286 | if (const DeclTypeSpec * type{object.symbol.GetType()}) { |
| 287 | if (const IntrinsicTypeSpec * intrinsic{type->AsIntrinsic()}) { |
| 288 | kind = ToInt64(intrinsic->kind()).value_or(kind); |
| 289 | } |
| 290 | } |
| 291 | result += kind * (*object.substringStart - 1); |
| 292 | } |
| 293 | return result; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 294 | } |
| 295 | |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 296 | std::size_t ComputeOffsetsHelper::DoSymbol(Symbol &symbol) { |
Tim Keith | 044a71d | 2020-08-25 01:20:22 | [diff] [blame] | 297 | if (!symbol.has<ObjectEntityDetails>() && !symbol.has<ProcEntityDetails>()) { |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 298 | return 0; |
Tim Keith | 237d0e3 | 2020-05-06 18:43:06 | [diff] [blame] | 299 | } |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 300 | SizeAndAlignment s{GetSizeAndAlignment(symbol, true)}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 301 | if (s.size == 0) { |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 302 | return 0; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 303 | } |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 304 | std::size_t previousOffset{offset_}; |
Tim Keith | 54b35c06 | 2020-05-06 22:00:14 | [diff] [blame] | 305 | offset_ = Align(offset_, s.alignment); |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 306 | std::size_t padding{offset_ - previousOffset}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 307 | symbol.set_size(s.size); |
| 308 | symbol.set_offset(offset_); |
| 309 | offset_ += s.size; |
Tim Keith | 54b35c06 | 2020-05-06 22:00:14 | [diff] [blame] | 310 | alignment_ = std::max(alignment_, s.alignment); |
Peter Klausler | c709f50 | 2022-03-31 19:55:45 | [diff] [blame] | 311 | return padding; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 312 | } |
| 313 | |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 314 | auto ComputeOffsetsHelper::GetSizeAndAlignment( |
| 315 | const Symbol &symbol, bool entire) -> SizeAndAlignment { |
peter klausler | d1862eb | 2020-06-18 20:28:43 | [diff] [blame] | 316 | // TODO: The size of procedure pointers is not yet known |
| 317 | // and is independent of rank (and probably also the number |
| 318 | // of length type parameters). |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 319 | auto &foldingContext{context_.foldingContext()}; |
Tim Keith | 2c662f3 | 2020-07-29 14:23:28 | [diff] [blame] | 320 | if (IsDescriptor(symbol) || IsProcedurePointer(symbol)) { |
peter klausler | a48e416 | 2021-07-19 18:53:20 | [diff] [blame] | 321 | const auto *derived{ |
| 322 | evaluate::GetDerivedTypeSpec(evaluate::DynamicType::From(symbol))}; |
| 323 | int lenParams{derived ? CountLenParameters(*derived) : 0}; |
| 324 | std::size_t size{runtime::Descriptor::SizeInBytes( |
| 325 | symbol.Rank(), derived != nullptr, lenParams)}; |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 326 | return {size, foldingContext.maxAlignment()}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 327 | } |
Tim Keith | 2c662f3 | 2020-07-29 14:23:28 | [diff] [blame] | 328 | if (IsProcedure(symbol)) { |
| 329 | return {}; |
| 330 | } |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 331 | if (auto chars{evaluate::characteristics::TypeAndShape::Characterize( |
| 332 | symbol, foldingContext)}) { |
| 333 | if (entire) { |
| 334 | if (auto size{ToInt64(chars->MeasureSizeInBytes(foldingContext))}) { |
| 335 | return {static_cast<std::size_t>(*size), |
| 336 | chars->type().GetAlignment(foldingContext)}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 337 | } |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 338 | } else { // element size only |
peter klausler | efc5926 | 2021-02-02 22:39:05 | [diff] [blame] | 339 | if (auto size{ToInt64(chars->MeasureElementSizeInBytes( |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 340 | foldingContext, true /*aligned*/))}) { |
| 341 | return {static_cast<std::size_t>(*size), |
| 342 | chars->type().GetAlignment(foldingContext)}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 343 | } |
| 344 | } |
| 345 | } |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 346 | return {}; |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 347 | } |
| 348 | |
| 349 | // Align a size to its natural alignment, up to maxAlignment. |
| 350 | std::size_t ComputeOffsetsHelper::Align(std::size_t x, std::size_t alignment) { |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 351 | alignment = std::min(alignment, context_.foldingContext().maxAlignment()); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 352 | return (x + alignment - 1) & -alignment; |
| 353 | } |
| 354 | |
peter klausler | 6aa3591 | 2020-12-15 19:06:44 | [diff] [blame] | 355 | void ComputeOffsets(SemanticsContext &context, Scope &scope) { |
| 356 | ComputeOffsetsHelper{context}.Compute(scope); |
Tim Keith | c353ebb | 2020-04-22 22:39:24 | [diff] [blame] | 357 | } |
| 358 | |
| 359 | } // namespace Fortran::semantics |