OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:GCStrategy
(Results
1 - 11
of
11
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/lib/IR/
GCStrategy.cpp
1
//===-
GCStrategy
.cpp - Garbage Collector Description ---------------------===//
9
// This file implements the policy object
GCStrategy
which describes the
14
#include "llvm/IR/
GCStrategy
.h"
20
GCStrategy
::
GCStrategy
() = default;
BuiltinGCs.cpp
15
#include "llvm/IR/
GCStrategy
.h"
27
class ErlangGC : public
GCStrategy
{
38
class OcamlGC : public
GCStrategy
{
54
class ShadowStackGC : public
GCStrategy
{
59
/// A
GCStrategy
which serves as an example for the usage of a statepoint based
60
/// lowering strategy. This
GCStrategy
is intended to suitable as a default
65
class StatepointGC : public
GCStrategy
{
87
/// A
GCStrategy
for the CoreCLR Runtime. The strategy is similar to
97
class CoreCLRGC : public
GCStrategy
{
/src/external/apache2/llvm/dist/llvm/include/llvm/IR/
GCStrategy.h
1
//===- llvm/CodeGen/
GCStrategy
.h - Garbage collection -----------*- C++ -*-===//
9
//
GCStrategy
coordinates code generation algorithms and implements some itself
15
//
GCStrategy
is relevant for implementations using either gc.root or
19
// When requested by a subclass of
GCStrategy
, the gc.root implementation will
25
//
GCStrategy
can request that the collector insert such points:
61
///
GCStrategy
describes a garbage collector algorithm's code generation
63
/// be abstractly described.
GCStrategy
objects must be looked up through
66
class
GCStrategy
{
81
GCStrategy
();
82
virtual ~
GCStrategy
() = default
[
all
...]
/src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
GCMetadataPrinter.h
10
// as assembly code. This is a separate class from
GCStrategy
in order to allow
14
// GCMetadataPrinterRegistry. This is separate from the
GCStrategy
itself
29
class
GCStrategy
;
43
GCStrategy
*S;
54
GCStrategy
&getStrategy() { return *S; }
GCMetadata.h
17
// - Safe points as specified by the
GCStrategy
's NeededSafePoints.
40
#include "llvm/IR/
GCStrategy
.h"
85
GCStrategy
&S;
101
GCFunctionInfo(const Function &F,
GCStrategy
&S);
108
GCStrategy
&getStrategy() { return S; }
154
SmallVector<std::unique_ptr<
GCStrategy
>, 1> GCStrategyList;
156
StringMap<
GCStrategy
*> GCStrategyMap;
159
/// Lookup the
GCStrategy
object associated with the given gc name.
162
GCStrategy
*getGCStrategy(const StringRef Name);
181
using iterator = SmallVector<std::unique_ptr<
GCStrategy
>, 1>::const_iterator
[
all
...]
AsmPrinter.h
43
class
GCStrategy
;
797
GCMetadataPrinter *GetOrCreateGCPrinter(
GCStrategy
&S);
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/
GCMetadata.cpp
54
GCFunctionInfo::GCFunctionInfo(const Function &F,
GCStrategy
&S)
75
GCStrategy
*S = getGCStrategy(F.getGC());
142
GCStrategy
*GCModuleInfo::getGCStrategy(const StringRef Name) {
150
std::unique_ptr<
GCStrategy
> S = Entry.instantiate();
GCRootLowering.cpp
37
/// directed by the
GCStrategy
. It also performs automatic root initialization
40
bool DoLowering(Function &F,
GCStrategy
&S);
178
GCStrategy
&S = FI.getStrategy();
183
/// Lower barriers out of existance (if the associated
GCStrategy
hasn't
190
bool LowerIntrinsics::DoLowering(Function &F,
GCStrategy
&S) {
/src/external/apache2/llvm/lib/libLLVMIR/
Makefile
34
GCStrategy
.cpp \
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
StatepointLowering.cpp
35
#include "llvm/IR/
GCStrategy
.h"
525
// Verifier, but we can't get to the
GCStrategy
from there (yet).
526
GCStrategy
&S = GFI->getStrategy();
1000
// Check that the associated
GCStrategy
expects to encounter statepoints.
1002
"
GCStrategy
does not expect to encounter statepoints");
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
AsmPrinter.cpp
70
#include "llvm/IR/
GCStrategy
.h"
162
using gcp_map_type = DenseMap<
GCStrategy
*, std::unique_ptr<GCMetadataPrinter>>;
3382
GCMetadataPrinter *AsmPrinter::GetOrCreateGCPrinter(
GCStrategy
&S) {
Completed in 23 milliseconds
Indexes created Wed Jun 17 00:25:26 UTC 2026