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
|
// =============================================================================
// === GPUQREngine/Include/GPUQREngine_LLBundle.hpp ============================
// =============================================================================
//
// LLBundle is a principal class in the GPUQREngine.
//
// This class is responsible for maintaining the CPU's view of state information
// during the factorization process.
//
// LLBundles are manipulated by its hosting BucketList and are:
// 1) Advanced
// 2) Created
// 3) Grown (in the context of pipelining)
// 4) Operated on (participating in Apply, Factorize, or ApplyFactorize tasks)
//
// =============================================================================
#ifndef GPUQRENGINE_LLBUNDLE_HPP
#define GPUQRENGINE_LLBUNDLE_HPP
#include "GPUQREngine_Common.hpp"
#include "GPUQREngine_TaskDescriptor.hpp"
struct TaskDescriptor;
class BucketList;
class LLBundle
{
public:
BucketList *Buckets; // A back pointer to the hosting BucketList
Int NativeBucket; // The column bucket the bundle belongs "is native" to
Int Shadow; // A memento for the factorized First tile.
// The CPU needs to know
Int First; // The tile with the smallest rowtile index.
// For factorize tasks, this tile is made upper
// triangular.
Int Last; // The index of the last filled slot in the bundle.
Int Delta; // The index of where the Delta starts
// Delta is used in pipelining when we attach a
// factorize task to a finishing apply.
Int SecondMin; // The index of where First's replacement is
Int Max; // The index of the largest element (by rowtile)
Int PanelSize;
Int ApplyCount; // # tiles participating in an APPLY, including the Shadow.
Int Count; // # tiles in the Bundle (Slots+Delta), but not the Shadow.
double *VT[2]; // Pointers to VT tiles.
// When performing a pipelined task (ApplyFactorize),
// memory must be reserved for two separate VT tiles:
// 1) For the HH vectors involved in the Apply
// 2) For the HH vectors resulting from the factorization
bool IsFull
(
void
)
{
return (Count == PanelSize);
}
TaskType CurrentTask;
void *operator new(long unsigned int, LLBundle* p){ return p; }
LLBundle(BucketList *buckets, Int panelSize, Int nativeBucket);
// empty LLBundle constructor (currently used, kept for possible future use
// LLBundle();
// LLBundle destructor:
~LLBundle();
#ifdef GPUQRENGINE_PIPELINING
void AddTileToDelta(Int rowTile);
#endif
void AddTileToSlots(Int rowTile);
// Advance: returns T/F if the bundle is still around after being advanced.
bool Advance();
void PipelinedRearrange();
void UpdateSecondMinIndex();
void UpdateMax();
void gpuPack(TaskDescriptor *cpuTask);
};
#endif
|
