[Statepoints 3/4] Statepoint infrastructure for garbage collection: SelectionDAGBuilder
This is the third patch in a small series. It contains the CodeGen support for lowering the gc.statepoint intrinsic sequences (223078) to the STATEPOINT pseudo machine instruction (223085). The change also includes the set of helper routines and classes for working with gc.statepoints, gc.relocates, and gc.results since the lowering code uses them.
With this change, gc.statepoints should be functionally complete. The documentation will follow in the fourth change, and there will likely be some cleanup changes, but interested parties can start experimenting now.
I'm not particularly happy with the amount of code or complexity involved with the lowering step, but at least it's fairly well isolated. The statepoint lowering code is split into it's own files and anyone not working on the statepoint support itself should be able to ignore it.
During the lowering process, we currently spill aggressively to stack. This is not entirely ideal (and we have plans to do better), but it's functional, relatively straight forward, and matches closely the implementations of the patchpoint intrinsics. Most of the complexity comes from trying to keep relocated copies of values in the same stack slots across statepoints. Doing so avoids the insertion of pointless load and store instructions to reshuffle the stack. The current implementation isn't as effective as I'd like, but it is functional and 'good enough' for many common use cases.
In the long term, I'd like to figure out how to integrate the statepoint lowering with the register allocator. In principal, we shouldn't need to eagerly spill at all. The register allocator should do any spilling required and the statepoint should simply record that fact. Depending on how challenging that turns out to be, we may invest in a smarter global stack slot assignment mechanism as a stop gap measure.
Reviewed by: atrick, ributzka
llvm-svn: 223137
2014-12-03 02:50:36 +08:00
|
|
|
//===-- StatepointLowering.h - SDAGBuilder's statepoint code -*- C++ -*---===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file includes support code use by SelectionDAGBuilder when lowering a
|
|
|
|
// statepoint sequence in SelectionDAG IR.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_LIB_CODEGEN_SELECTIONDAG_STATEPOINTLOWERING_H
|
|
|
|
#define LLVM_LIB_CODEGEN_SELECTIONDAG_STATEPOINTLOWERING_H
|
|
|
|
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
|
|
|
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
class SelectionDAGBuilder;
|
|
|
|
|
|
|
|
/// This class tracks both per-statepoint and per-selectiondag information.
|
|
|
|
/// For each statepoint it tracks locations of it's gc valuess (incoming and
|
|
|
|
/// relocated) and list of gcreloc calls scheduled for visiting (this is
|
|
|
|
/// used for a debug mode consistency check only). The spill slot tracking
|
|
|
|
/// works in concert with information in FunctionLoweringInfo.
|
|
|
|
class StatepointLoweringState {
|
|
|
|
public:
|
2015-04-30 05:52:45 +08:00
|
|
|
StatepointLoweringState() : NextSlotToAllocate(0) {}
|
[Statepoints 3/4] Statepoint infrastructure for garbage collection: SelectionDAGBuilder
This is the third patch in a small series. It contains the CodeGen support for lowering the gc.statepoint intrinsic sequences (223078) to the STATEPOINT pseudo machine instruction (223085). The change also includes the set of helper routines and classes for working with gc.statepoints, gc.relocates, and gc.results since the lowering code uses them.
With this change, gc.statepoints should be functionally complete. The documentation will follow in the fourth change, and there will likely be some cleanup changes, but interested parties can start experimenting now.
I'm not particularly happy with the amount of code or complexity involved with the lowering step, but at least it's fairly well isolated. The statepoint lowering code is split into it's own files and anyone not working on the statepoint support itself should be able to ignore it.
During the lowering process, we currently spill aggressively to stack. This is not entirely ideal (and we have plans to do better), but it's functional, relatively straight forward, and matches closely the implementations of the patchpoint intrinsics. Most of the complexity comes from trying to keep relocated copies of values in the same stack slots across statepoints. Doing so avoids the insertion of pointless load and store instructions to reshuffle the stack. The current implementation isn't as effective as I'd like, but it is functional and 'good enough' for many common use cases.
In the long term, I'd like to figure out how to integrate the statepoint lowering with the register allocator. In principal, we shouldn't need to eagerly spill at all. The register allocator should do any spilling required and the statepoint should simply record that fact. Depending on how challenging that turns out to be, we may invest in a smarter global stack slot assignment mechanism as a stop gap measure.
Reviewed by: atrick, ributzka
llvm-svn: 223137
2014-12-03 02:50:36 +08:00
|
|
|
|
|
|
|
/// Reset all state tracking for a newly encountered safepoint. Also
|
|
|
|
/// performs some consistency checking.
|
|
|
|
void startNewStatepoint(SelectionDAGBuilder &Builder);
|
|
|
|
|
|
|
|
/// Clear the memory usage of this object. This is called from
|
|
|
|
/// SelectionDAGBuilder::clear. We require this is never called in the
|
|
|
|
/// midst of processing a statepoint sequence.
|
|
|
|
void clear();
|
|
|
|
|
|
|
|
/// Returns the spill location of a value incoming to the current
|
|
|
|
/// statepoint. Will return SDValue() if this value hasn't been
|
|
|
|
/// spilled. Otherwise, the value has already been spilled and no
|
|
|
|
/// further action is required by the caller.
|
|
|
|
SDValue getLocation(SDValue val) {
|
|
|
|
if (!Locations.count(val))
|
|
|
|
return SDValue();
|
|
|
|
return Locations[val];
|
|
|
|
}
|
|
|
|
void setLocation(SDValue val, SDValue Location) {
|
|
|
|
assert(!Locations.count(val) &&
|
|
|
|
"Trying to allocate already allocated location");
|
|
|
|
Locations[val] = Location;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Record the fact that we expect to encounter a given gc_relocate
|
|
|
|
/// before the next statepoint. If we don't see it, we'll report
|
|
|
|
/// an assertion.
|
|
|
|
void scheduleRelocCall(const CallInst &RelocCall) {
|
|
|
|
PendingGCRelocateCalls.push_back(&RelocCall);
|
|
|
|
}
|
|
|
|
/// Remove this gc_relocate from the list we're expecting to see
|
|
|
|
/// before the next statepoint. If we weren't expecting to see
|
|
|
|
/// it, we'll report an assertion.
|
|
|
|
void relocCallVisited(const CallInst &RelocCall) {
|
|
|
|
SmallVectorImpl<const CallInst *>::iterator itr =
|
|
|
|
std::find(PendingGCRelocateCalls.begin(), PendingGCRelocateCalls.end(),
|
|
|
|
&RelocCall);
|
|
|
|
assert(itr != PendingGCRelocateCalls.end() &&
|
|
|
|
"Visited unexpected gcrelocate call");
|
|
|
|
PendingGCRelocateCalls.erase(itr);
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: Should add consistency tracking to ensure we encounter
|
|
|
|
// expected gc_result calls too.
|
|
|
|
|
|
|
|
/// Get a stack slot we can use to store an value of type ValueType. This
|
|
|
|
/// will hopefully be a recylced slot from another statepoint.
|
|
|
|
SDValue allocateStackSlot(EVT ValueType, SelectionDAGBuilder &Builder);
|
|
|
|
|
|
|
|
void reserveStackSlot(int Offset) {
|
|
|
|
assert(Offset >= 0 && Offset < (int)AllocatedStackSlots.size() &&
|
|
|
|
"out of bounds");
|
|
|
|
assert(!AllocatedStackSlots[Offset] && "already reserved!");
|
|
|
|
assert(NextSlotToAllocate <= (unsigned)Offset && "consistency!");
|
|
|
|
AllocatedStackSlots[Offset] = true;
|
|
|
|
}
|
|
|
|
bool isStackSlotAllocated(int Offset) {
|
|
|
|
assert(Offset >= 0 && Offset < (int)AllocatedStackSlots.size() &&
|
|
|
|
"out of bounds");
|
|
|
|
return AllocatedStackSlots[Offset];
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
/// Maps pre-relocation value (gc pointer directly incoming into statepoint)
|
|
|
|
/// into it's location (currently only stack slots)
|
|
|
|
DenseMap<SDValue, SDValue> Locations;
|
|
|
|
|
|
|
|
/// A boolean indicator for each slot listed in the FunctionInfo as to
|
|
|
|
/// whether it has been used in the current statepoint. Since we try to
|
|
|
|
/// preserve stack slots across safepoints, there can be gaps in which
|
|
|
|
/// slots have been allocated.
|
|
|
|
SmallVector<bool, 50> AllocatedStackSlots;
|
|
|
|
|
|
|
|
/// Points just beyond the last slot known to have been allocated
|
|
|
|
unsigned NextSlotToAllocate;
|
|
|
|
|
|
|
|
/// Keep track of pending gcrelocate calls for consistency check
|
|
|
|
SmallVector<const CallInst *, 10> PendingGCRelocateCalls;
|
|
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif // LLVM_LIB_CODEGEN_SELECTIONDAG_STATEPOINTLOWERING_H
|