/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/CodeGen/LiveStacks.h
Line | Count | Source (jump to first uncovered line) |
1 | | //===- LiveStacks.h - Live Stack Slot Analysis ------------------*- 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 | | // This file implements the live stack slot analysis pass. It is analogous to |
10 | | // live interval analysis except it's analyzing liveness of stack slots rather |
11 | | // than registers. |
12 | | // |
13 | | //===----------------------------------------------------------------------===// |
14 | | |
15 | | #ifndef LLVM_CODEGEN_LIVESTACKS_H |
16 | | #define LLVM_CODEGEN_LIVESTACKS_H |
17 | | |
18 | | #include "llvm/CodeGen/LiveInterval.h" |
19 | | #include "llvm/CodeGen/MachineFunctionPass.h" |
20 | | #include "llvm/Pass.h" |
21 | | #include <cassert> |
22 | | #include <map> |
23 | | #include <unordered_map> |
24 | | |
25 | | namespace llvm { |
26 | | |
27 | | class TargetRegisterClass; |
28 | | class TargetRegisterInfo; |
29 | | |
30 | | class LiveStacks : public MachineFunctionPass { |
31 | | const TargetRegisterInfo *TRI; |
32 | | |
33 | | /// Special pool allocator for VNInfo's (LiveInterval val#). |
34 | | /// |
35 | | VNInfo::Allocator VNInfoAllocator; |
36 | | |
37 | | /// S2IMap - Stack slot indices to live interval mapping. |
38 | | using SS2IntervalMap = std::unordered_map<int, LiveInterval>; |
39 | | SS2IntervalMap S2IMap; |
40 | | |
41 | | /// S2RCMap - Stack slot indices to register class mapping. |
42 | | std::map<int, const TargetRegisterClass *> S2RCMap; |
43 | | |
44 | | public: |
45 | | static char ID; // Pass identification, replacement for typeid |
46 | | |
47 | 33.8k | LiveStacks() : MachineFunctionPass(ID) { |
48 | 33.8k | initializeLiveStacksPass(*PassRegistry::getPassRegistry()); |
49 | 33.8k | } |
50 | | |
51 | | using iterator = SS2IntervalMap::iterator; |
52 | | using const_iterator = SS2IntervalMap::const_iterator; |
53 | | |
54 | 0 | const_iterator begin() const { return S2IMap.begin(); } |
55 | 0 | const_iterator end() const { return S2IMap.end(); } |
56 | 25.4k | iterator begin() { return S2IMap.begin(); } |
57 | 25.4k | iterator end() { return S2IMap.end(); } |
58 | | |
59 | 510k | unsigned getNumIntervals() const { return (unsigned)S2IMap.size(); } |
60 | | |
61 | | LiveInterval &getOrCreateInterval(int Slot, const TargetRegisterClass *RC); |
62 | | |
63 | 494k | LiveInterval &getInterval(int Slot) { |
64 | 494k | assert(Slot >= 0 && "Spill slot indice must be >= 0"); |
65 | 494k | SS2IntervalMap::iterator I = S2IMap.find(Slot); |
66 | 494k | assert(I != S2IMap.end() && "Interval does not exist for stack slot"); |
67 | 494k | return I->second; |
68 | 494k | } |
69 | | |
70 | 0 | const LiveInterval &getInterval(int Slot) const { |
71 | 0 | assert(Slot >= 0 && "Spill slot indice must be >= 0"); |
72 | 0 | SS2IntervalMap::const_iterator I = S2IMap.find(Slot); |
73 | 0 | assert(I != S2IMap.end() && "Interval does not exist for stack slot"); |
74 | 0 | return I->second; |
75 | 0 | } |
76 | | |
77 | 687k | bool hasInterval(int Slot) const { return S2IMap.count(Slot); } |
78 | | |
79 | 0 | const TargetRegisterClass *getIntervalRegClass(int Slot) const { |
80 | 0 | assert(Slot >= 0 && "Spill slot indice must be >= 0"); |
81 | 0 | std::map<int, const TargetRegisterClass *>::const_iterator I = |
82 | 0 | S2RCMap.find(Slot); |
83 | 0 | assert(I != S2RCMap.end() && |
84 | 0 | "Register class info does not exist for stack slot"); |
85 | 0 | return I->second; |
86 | 0 | } |
87 | | |
88 | 121k | VNInfo::Allocator &getVNInfoAllocator() { return VNInfoAllocator; } |
89 | | |
90 | | void getAnalysisUsage(AnalysisUsage &AU) const override; |
91 | | void releaseMemory() override; |
92 | | |
93 | | /// runOnMachineFunction - pass entry point |
94 | | bool runOnMachineFunction(MachineFunction &) override; |
95 | | |
96 | | /// print - Implement the dump method. |
97 | | void print(raw_ostream &O, const Module * = nullptr) const override; |
98 | | }; |
99 | | |
100 | | } // end namespace llvm |
101 | | |
102 | | #endif |