OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:LiveIntervalUnion
(Results
1 - 9
of
9
) sorted by null
/external/llvm/lib/CodeGen/
RegAllocBase.h
24
//
LiveIntervalUnion
data structure.
41
#include "
LiveIntervalUnion
.h"
59
LiveIntervalUnion
::Allocator UnionAllocator;
68
LiveIntervalUnion
*Array;
75
void init(
LiveIntervalUnion
::Allocator &, unsigned NRegs);
79
LiveIntervalUnion
& operator[](unsigned PhysReg) {
89
OwningArrayPtr<
LiveIntervalUnion
::Query> Queries;
109
LiveIntervalUnion
::Query &query(LiveInterval &VirtReg, unsigned PhysReg) {
114
// Get direct access to the underlying
LiveIntervalUnion
for PhysReg.
115
LiveIntervalUnion
&getLiveUnion(unsigned PhysReg)
[
all
...]
InterferenceCache.h
17
#include "
LiveIntervalUnion
.h"
25
LiveIntervalUnion
*LIUArray;
62
/// AliasTags - A
LiveIntervalUnion
pointer and tag for each alias of
64
SmallVector<std::pair<
LiveIntervalUnion
*, unsigned>, 8> Aliases;
66
typedef
LiveIntervalUnion
::SegmentIter Iter;
97
bool valid(
LiveIntervalUnion
*LIUArray, const TargetRegisterInfo *TRI);
101
LiveIntervalUnion
*LIUArray,
135
void init(MachineFunction*,
LiveIntervalUnion
*, SlotIndexes*, LiveIntervals*,
LiveIntervalUnion.cpp
1
//===--
LiveIntervalUnion
.cpp - Live interval union data structure --------===//
10
//
LiveIntervalUnion
represents a coalesced set of live intervals. This may be
17
#include "
LiveIntervalUnion
.h"
30
void
LiveIntervalUnion
::unify(LiveInterval &VirtReg) {
57
void
LiveIntervalUnion
::extract(LiveInterval &VirtReg) {
83
LiveIntervalUnion
::print(raw_ostream &OS, const TargetRegisterInfo *TRI) const {
98
void
LiveIntervalUnion
::verify(LiveVirtRegBitSet& VisitedVRegs) {
106
bool
LiveIntervalUnion
::Query::isSeenInterference(LiveInterval *VirtReg) const {
121
unsigned
LiveIntervalUnion
::Query::
186
bool
LiveIntervalUnion
::Query::checkLoopInterference(MachineLoopRange *Loop)
[
all
...]
LiveIntervalUnion.h
1
//===--
LiveIntervalUnion
.h - Live interval union data struct --*- C++ -*--===//
10
//
LiveIntervalUnion
is a union of live segments across multiple live virtual
34
/// Compare a live virtual register segment to a
LiveIntervalUnion
segment.
45
class
LiveIntervalUnion
{
68
LiveIntervalUnion
(unsigned r, Allocator &a) : RepReg(r), Tag(0), Segments(a)
109
LiveIntervalUnion
*LiveUnion;
122
Query(LiveInterval *VReg,
LiveIntervalUnion
*LIU):
138
void init(unsigned UTag, LiveInterval *VReg,
LiveIntervalUnion
*LIU) {
RegAllocBase.cpp
11
// for
LiveIntervalUnion
-based register allocators.
51
// Verify each
LiveIntervalUnion
.
89
// Instantiate a
LiveIntervalUnion
for each physical register.
90
void RegAllocBase::LiveUnionArray::init(
LiveIntervalUnion
::Allocator &allocator,
94
static_cast<
LiveIntervalUnion
*>(malloc(sizeof(
LiveIntervalUnion
)*NRegs));
96
new(Array + r)
LiveIntervalUnion
(r, allocator);
112
Queries.reset(new
LiveIntervalUnion
::Query[PhysReg2LiveUnion.numRegs()]);
120
Array[r].~
LiveIntervalUnion
();
132
// register, unify them with the corresponding
LiveIntervalUnion
, otherwise pus
[
all
...]
InterferenceCache.cpp
26
LiveIntervalUnion
*liuarray,
74
LiveIntervalUnion
*LIUArray,
84
LiveIntervalUnion
*LIU = LIUArray + *AS;
96
bool InterferenceCache::Entry::valid(
LiveIntervalUnion
*LIUArray,
100
LiveIntervalUnion
*LIU = LIUArray + *AS;
RegAllocBasic.cpp
175
LiveIntervalUnion
::Query &Q = query(VirtReg, PhysReg);
208
LiveIntervalUnion
::Query &QAlias = query(VirtReg, *asI);
264
LiveIntervalUnion
::Query &IntfQ = query(VirtReg, interfReg);
Android.mk
33
LiveIntervalUnion
.cpp \
RegAllocGreedy.cpp
543
LiveIntervalUnion
::Query &Q = query(VirtReg, *AliasI);
601
LiveIntervalUnion
::Query &Q = query(VirtReg, *AliasI);
[
all
...]
Completed in 45 milliseconds