summaryrefslogtreecommitdiff
path: root/include/llvm/CodeGen/CollectorMetadata.h
blob: 0f958a833867adf9ca2664b1c3be75319731552a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
//===-- CollectorMetadata.h - Garbage collector metadata ------------------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file was developed by Gordon Henriksen and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file declares the CollectorMetadata and CollectorModuleMetadata classes,
// which are used as a communication channel from the target code generator
// to the target garbage collectors. This interface allows code generators and
// garbage collectors to be developed independently.
//
// The CollectorMetadata class records the data necessary to build a type
// accurate stack map. Roots are specified in the LLVM IR using the llvm.gcroot
// intrinsic, which the code generator understands. The code generator records
// the stack offset for each GC root. Safe points are generated by the code
// generator according to the collector's declared needs (generally at function
// calls).
//
// Safe points and roots are sufficient to build type-accurate stack maps. As a
// refinement, liveness analysis calculates the set of live roots at each safe
// point. Liveness analysis is not presently performed, so all roots are assumed
// live.
//
// CollectorModuleMetadata simply collects CollectorMetadata structures for each
// Function as it is compiled. This is necessary for collectors which must emit
// a stack map for the entire compilation unit. CollectorMetadata outlives the
// MachineFunction from which it is derived, so must not refer to any code
// generator data structures.
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_CODEGEN_COLLECTORMETADATA_H
#define LLVM_CODEGEN_COLLECTORMETADATA_H

#include "llvm/Pass.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/StringMap.h"

namespace llvm {
  
  class AsmPrinter;
  class Collector;
  class Constant;
  class TargetAsmInfo;
  
  
  namespace GC {
    /// PointKind - The type of a collector-safe point.
    /// 
    enum PointKind {
      Loop,    //< Instr is a loop (backwards branch).
      Return,  //< Instr is a return instruction.
      PreCall, //< Instr is a call instruction.
      PostCall //< Instr is the return address of a call.
    };
  }
  
  /// GCPoint - Metadata for a collector-safe point in machine code.
  /// 
  struct GCPoint {
    GC::PointKind Kind; //< The kind of the safe point.
    unsigned Num;       //< Usually a label.
    
    GCPoint(GC::PointKind K, unsigned N) : Kind(K), Num(N) {}
  };
  
  /// GCRoot - Metadata for a pointer to an object managed by the garbage
  /// collector.
  struct GCRoot {
    int Num;            //< Usually a frame index.
    int StackOffset;    //< Offset from the stack pointer.
    Constant *Metadata; //< Metadata straight from the call to llvm.gcroot.
    
    GCRoot(int N, Constant *MD) : Num(N), StackOffset(-1), Metadata(MD) {}
  };
  
  
  /// CollectorMetadata - Garbage collection metadata for a function.
  /// 
  class CollectorMetadata {
  public:
    typedef std::vector<GCPoint>::iterator iterator;
    typedef std::vector<GCRoot>::iterator roots_iterator;
    typedef std::vector<GCRoot>::const_iterator live_iterator;
    
  private:
    const Function &F;
    Collector &C;
    uint64_t FrameSize;
    std::vector<GCRoot> Roots;
    std::vector<GCPoint> SafePoints;
    
    // FIXME: Liveness. A 2D BitVector, perhaps?
    // 
    //   BitVector Liveness;
    //   
    //   bool islive(int point, int root) =
    //     Liveness[point * SafePoints.size() + root]
    // 
    // The bit vector is the more compact representation where >3.2% of roots
    // are live per safe point (1.5% on 64-bit hosts).
    
  public:
    CollectorMetadata(const Function &F, Collector &C);
    ~CollectorMetadata();
    
    /// getFunction - Return the function to which this metadata applies.
    /// 
    const Function &getFunction() const { return F; }
    
    /// getCollector - Return the collector for the function.
    /// 
    Collector &getCollector() { return C; }
    
    /// addStackRoot - Registers a root that lives on the stack. Num is the
    /// stack object ID for the alloca (if the code generator is using 
    /// MachineFrameInfo).
    void addStackRoot(int Num, Constant *Metadata) {
      Roots.push_back(GCRoot(Num, Metadata));
    }
    
    /// addSafePoint - Notes the existence of a safe point. Num is the ID of the
    /// label just prior to the safe point (if the code generator is using 
    /// MachineModuleInfo).
    void addSafePoint(GC::PointKind Kind, unsigned Num) {
      SafePoints.push_back(GCPoint(Kind, Num));
    }
    
    /// getFrameSize/setFrameSize - Records the function's frame size.
    /// 
    uint64_t getFrameSize() const { return FrameSize; }
    void setFrameSize(uint64_t S) { FrameSize = S; }
    
    /// begin/end - Iterators for safe points.
    /// 
    iterator begin() { return SafePoints.begin(); }
    iterator end()   { return SafePoints.end();   }
    size_t size() const { return SafePoints.size(); }
    
    /// roots_begin/roots_end - Iterators for all roots in the function.
    /// 
    roots_iterator roots_begin() { return Roots.begin(); }
    roots_iterator roots_end  () { return Roots.end();   }
    size_t roots_size() const { return Roots.size(); }
    
    /// live_begin/live_end - Iterators for live roots at a given safe point.
    /// 
    live_iterator live_begin(const iterator &p) { return roots_begin(); }
    live_iterator live_end  (const iterator &p) { return roots_end();   }
    size_t live_size(const iterator &p) const { return roots_size(); }
  };
  
  
  /// CollectorModuleMetadata - Garbage collection metadata for a whole module.
  /// 
  class CollectorModuleMetadata : public ImmutablePass {
    typedef StringMap<Collector*> collector_map_type;
    typedef std::vector<Collector*> list_type;
    typedef DenseMap<const Function*,CollectorMetadata*> function_map_type;
    
    collector_map_type NameMap;
    list_type Collectors;
    function_map_type Map;
    
    Collector *getOrCreateCollector(const Module *M, const std::string &Name);
    
  public:
    typedef list_type::const_iterator iterator;
    
    static char ID;
    
    CollectorModuleMetadata();
    ~CollectorModuleMetadata();
    
    /// clear - Used to delete module metadata. The metadata deleter pass calls
    /// this.
    void clear();
    
    /// begin/end - Iterators for collectors.
    /// 
    iterator begin() const { return Collectors.begin(); }
    iterator end()   const { return Collectors.end();   }
    
    /// get - Look up function metadata.
    /// 
    CollectorMetadata &get(const Function &F);
  };
  
}

#endif