1cc5e6a72SClement Courbet //===--------------------- Support.cpp --------------------------*- C++ -*-===//
2cc5e6a72SClement Courbet //
32946cd70SChandler Carruth // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
42946cd70SChandler Carruth // See https://llvm.org/LICENSE.txt for license information.
52946cd70SChandler Carruth // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6cc5e6a72SClement Courbet //
7cc5e6a72SClement Courbet //===----------------------------------------------------------------------===//
8cc5e6a72SClement Courbet /// \file
9cc5e6a72SClement Courbet ///
10cc5e6a72SClement Courbet /// This file implements a few helper functions used by various pipeline
11cc5e6a72SClement Courbet /// components.
12cc5e6a72SClement Courbet ///
13cc5e6a72SClement Courbet //===----------------------------------------------------------------------===//
14cc5e6a72SClement Courbet
15cc5e6a72SClement Courbet #include "llvm/MCA/Support.h"
16cc5e6a72SClement Courbet #include "llvm/MC/MCSchedule.h"
177a617fdfSKazu Hirata #include <numeric>
18cc5e6a72SClement Courbet
19cc5e6a72SClement Courbet namespace llvm {
20cc5e6a72SClement Courbet namespace mca {
21cc5e6a72SClement Courbet
2297ed076dSAndrea Di Biagio #define DEBUG_TYPE "llvm-mca"
2397ed076dSAndrea Di Biagio
operator +=(const ReleaseAtCycles & RHS)24*85e3875aSMichael Maitland ReleaseAtCycles &ReleaseAtCycles::operator+=(const ReleaseAtCycles &RHS) {
25d30fff9aSAndrea Di Biagio if (Denominator == RHS.Denominator)
26d30fff9aSAndrea Di Biagio Numerator += RHS.Numerator;
27d30fff9aSAndrea Di Biagio else {
28d30fff9aSAndrea Di Biagio // Create a common denominator for LHS and RHS by calculating the least
29d30fff9aSAndrea Di Biagio // common multiple from the GCD.
307a617fdfSKazu Hirata unsigned GCD = std::gcd(Denominator, RHS.Denominator);
31d30fff9aSAndrea Di Biagio unsigned LCM = (Denominator * RHS.Denominator) / GCD;
32d30fff9aSAndrea Di Biagio unsigned LHSNumerator = Numerator * (LCM / Denominator);
33d30fff9aSAndrea Di Biagio unsigned RHSNumerator = RHS.Numerator * (LCM / RHS.Denominator);
34d30fff9aSAndrea Di Biagio Numerator = LHSNumerator + RHSNumerator;
35d30fff9aSAndrea Di Biagio Denominator = LCM;
36d30fff9aSAndrea Di Biagio }
37d30fff9aSAndrea Di Biagio return *this;
38d30fff9aSAndrea Di Biagio }
39d30fff9aSAndrea Di Biagio
computeProcResourceMasks(const MCSchedModel & SM,MutableArrayRef<uint64_t> Masks)40cc5e6a72SClement Courbet void computeProcResourceMasks(const MCSchedModel &SM,
4197ed076dSAndrea Di Biagio MutableArrayRef<uint64_t> Masks) {
42cc5e6a72SClement Courbet unsigned ProcResourceID = 0;
43cc5e6a72SClement Courbet
4497ed076dSAndrea Di Biagio assert(Masks.size() == SM.getNumProcResourceKinds() &&
4597ed076dSAndrea Di Biagio "Invalid number of elements");
4697ed076dSAndrea Di Biagio // Resource at index 0 is the 'InvalidUnit'. Set an invalid mask for it.
4797ed076dSAndrea Di Biagio Masks[0] = 0;
4897ed076dSAndrea Di Biagio
49cc5e6a72SClement Courbet // Create a unique bitmask for every processor resource unit.
50cc5e6a72SClement Courbet for (unsigned I = 1, E = SM.getNumProcResourceKinds(); I < E; ++I) {
51cc5e6a72SClement Courbet const MCProcResourceDesc &Desc = *SM.getProcResource(I);
52cc5e6a72SClement Courbet if (Desc.SubUnitsIdxBegin)
53cc5e6a72SClement Courbet continue;
54cc5e6a72SClement Courbet Masks[I] = 1ULL << ProcResourceID;
55cc5e6a72SClement Courbet ProcResourceID++;
56cc5e6a72SClement Courbet }
57cc5e6a72SClement Courbet
58cc5e6a72SClement Courbet // Create a unique bitmask for every processor resource group.
59cc5e6a72SClement Courbet for (unsigned I = 1, E = SM.getNumProcResourceKinds(); I < E; ++I) {
60cc5e6a72SClement Courbet const MCProcResourceDesc &Desc = *SM.getProcResource(I);
61cc5e6a72SClement Courbet if (!Desc.SubUnitsIdxBegin)
62cc5e6a72SClement Courbet continue;
63cc5e6a72SClement Courbet Masks[I] = 1ULL << ProcResourceID;
64cc5e6a72SClement Courbet for (unsigned U = 0; U < Desc.NumUnits; ++U) {
65cc5e6a72SClement Courbet uint64_t OtherMask = Masks[Desc.SubUnitsIdxBegin[U]];
66cc5e6a72SClement Courbet Masks[I] |= OtherMask;
67cc5e6a72SClement Courbet }
68cc5e6a72SClement Courbet ProcResourceID++;
69cc5e6a72SClement Courbet }
7097ed076dSAndrea Di Biagio
7197ed076dSAndrea Di Biagio #ifndef NDEBUG
7297ed076dSAndrea Di Biagio LLVM_DEBUG(dbgs() << "\nProcessor resource masks:"
7397ed076dSAndrea Di Biagio << "\n");
7497ed076dSAndrea Di Biagio for (unsigned I = 0, E = SM.getNumProcResourceKinds(); I < E; ++I) {
7597ed076dSAndrea Di Biagio const MCProcResourceDesc &Desc = *SM.getProcResource(I);
76d30fff9aSAndrea Di Biagio LLVM_DEBUG(dbgs() << '[' << format_decimal(I,2) << "] " << " - "
77d30fff9aSAndrea Di Biagio << format_hex(Masks[I],16) << " - "
78d30fff9aSAndrea Di Biagio << Desc.Name << '\n');
7997ed076dSAndrea Di Biagio }
8097ed076dSAndrea Di Biagio #endif
81cc5e6a72SClement Courbet }
82cc5e6a72SClement Courbet
computeBlockRThroughput(const MCSchedModel & SM,unsigned DispatchWidth,unsigned NumMicroOps,ArrayRef<unsigned> ProcResourceUsage)83cc5e6a72SClement Courbet double computeBlockRThroughput(const MCSchedModel &SM, unsigned DispatchWidth,
84cc5e6a72SClement Courbet unsigned NumMicroOps,
85cc5e6a72SClement Courbet ArrayRef<unsigned> ProcResourceUsage) {
86cc5e6a72SClement Courbet // The block throughput is bounded from above by the hardware dispatch
87cc5e6a72SClement Courbet // throughput. That is because the DispatchWidth is an upper bound on the
88cc5e6a72SClement Courbet // number of opcodes that can be part of a single dispatch group.
89cc5e6a72SClement Courbet double Max = static_cast<double>(NumMicroOps) / DispatchWidth;
90cc5e6a72SClement Courbet
91cc5e6a72SClement Courbet // The block throughput is also limited by the amount of hardware parallelism.
92cc5e6a72SClement Courbet // The number of available resource units affects the resource pressure
93cc5e6a72SClement Courbet // distribution, as well as how many blocks can be executed every cycle.
94cc5e6a72SClement Courbet for (unsigned I = 0, E = SM.getNumProcResourceKinds(); I < E; ++I) {
95*85e3875aSMichael Maitland unsigned ReleaseAtCycles = ProcResourceUsage[I];
96*85e3875aSMichael Maitland if (!ReleaseAtCycles)
97cc5e6a72SClement Courbet continue;
98cc5e6a72SClement Courbet
99cc5e6a72SClement Courbet const MCProcResourceDesc &MCDesc = *SM.getProcResource(I);
100*85e3875aSMichael Maitland double Throughput = static_cast<double>(ReleaseAtCycles) / MCDesc.NumUnits;
101cc5e6a72SClement Courbet Max = std::max(Max, Throughput);
102cc5e6a72SClement Courbet }
103cc5e6a72SClement Courbet
104cc5e6a72SClement Courbet // The block reciprocal throughput is computed as the MAX of:
105cc5e6a72SClement Courbet // - (NumMicroOps / DispatchWidth)
106*85e3875aSMichael Maitland // - (NumUnits / ReleaseAtCycles) for every consumed processor resource.
107cc5e6a72SClement Courbet return Max;
108cc5e6a72SClement Courbet }
109cc5e6a72SClement Courbet
110cc5e6a72SClement Courbet } // namespace mca
111cc5e6a72SClement Courbet } // namespace llvm
112