LLVM  13.0.0git
RewriteStatepointsForGC.h
Go to the documentation of this file.
1 //===- RewriteStatepointsForGC.h - ------------------------------*- 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 provides interface to "Rewrite Statepoints for GC" pass.
10 //
11 // This passe rewrites call/invoke instructions so as to make potential
12 // relocations performed by the garbage collector explicit in the IR.
13 //
14 //===----------------------------------------------------------------------===//
15 
16 #ifndef LLVM_TRANSFORMS_SCALAR_REWRITESTATEPOINTSFORGC_H
17 #define LLVM_TRANSFORMS_SCALAR_REWRITESTATEPOINTSFORGC_H
18 
19 #include "llvm/IR/PassManager.h"
20 
21 namespace llvm {
22 
23 class DominatorTree;
24 class Function;
25 class Module;
26 class TargetTransformInfo;
27 class TargetLibraryInfo;
28 
29 struct RewriteStatepointsForGC : public PassInfoMixin<RewriteStatepointsForGC> {
31 
33  const TargetLibraryInfo &);
34 };
35 
36 } // namespace llvm
37 
38 #endif // LLVM_TRANSFORMS_SCALAR_REWRITESTATEPOINTSFORGC_H
llvm::PreservedAnalyses
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:155
llvm
Definition: AllocatorList.h:23
M
We currently emits eax Perhaps this is what we really should generate is Is imull three or four cycles eax eax The current instruction priority is based on pattern complexity The former is more complex because it folds a load so the latter will not be emitted Perhaps we should use AddedComplexity to give LEA32r a higher priority We should always try to match LEA first since the LEA matching code does some estimate to determine whether the match is profitable if we care more about code then imull is better It s two bytes shorter than movl leal On a Pentium M
Definition: README.txt:252
llvm::RewriteStatepointsForGC::runOnFunction
bool runOnFunction(Function &F, DominatorTree &, TargetTransformInfo &, const TargetLibraryInfo &)
Definition: RewriteStatepointsForGC.cpp:2808
llvm::PassInfoMixin
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition: PassManager.h:374
llvm::Function
Definition: Function.h:61
llvm::RewriteStatepointsForGC
Definition: RewriteStatepointsForGC.h:29
llvm::TargetTransformInfo
This pass provides access to the codegen interfaces that are needed for IR-level transformations.
Definition: TargetTransformInfo.h:167
llvm::DominatorTree
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition: Dominators.h:151
F
#define F(x, y, z)
Definition: MD5.cpp:56
llvm::Module
A Module instance is used to store all the information related to an LLVM module.
Definition: Module.h:67
Module
Machine Check Debug Module
Definition: MachineCheckDebugify.cpp:122
PassManager.h
llvm::TargetLibraryInfo
Provides information about what library functions are available for the current target.
Definition: TargetLibraryInfo.h:219
llvm::AnalysisManager
A container for analyses that lazily runs them and caches their results.
Definition: InstructionSimplify.h:44
llvm::RewriteStatepointsForGC::run
PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM)
Definition: RewriteStatepointsForGC.cpp:128
llvm::codeview::PublicSymFlags::Function
@ Function