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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
#include "ArrayDistribution.h"
/********************************
* ArrayDistribution *
********************************/
Boolean ArrayDistribution::equal(ArrayDistribution *) { return NO; }
int ArrayDistribution::distribution_type()
{
printf("In ArrayDistributon: distribution_type, shouldn't be called\n");
return -1;
}
ArrayDistribution::ArrayDistribution()
{
num_of_chunks_ = 0;
chunk_list_ = new List();
current_cell_ = NULL;
}
ArrayDistribution::ArrayDistribution(int **schema_buf)
{
printf("In ArrayDistributon: init, shouldn't be called\n");
}
void ArrayDistribution::add_last(Chunk *new_chunk)
{
chunk_list_->add_last(new_chunk);
num_of_chunks_++;
}
ArrayDistribution::~ArrayDistribution()
{
Cell *list_ptr;
if (chunk_list_) {
list_ptr = chunk_list_->head_;
while (list_ptr) {
delete list_ptr->item();
list_ptr = list_ptr->next();
}
delete chunk_list_;
chunk_list_ = NULL; num_of_chunks_ = 0;
}
}
void ArrayDistribution::pack(int **schema_buf)
{
printf("In ArrayDistributon: pack, shouldn't be called\n");
}
int ArrayDistribution::get_next_index(Chunk *&chunk, int old_val,
int io_node_num,
int num_io_nodes, int max)
{
printf("In ArrayDistributon: get_next_index shouldn't be called\n");
return max;
}
List *ArrayDistribution::chunk_list()
{
return chunk_list_;
}
Chunk* ArrayDistribution::get_next_chunk()
{
if (current_cell_) current_cell_ = current_cell_->next();
else current_cell_ = chunk_list_->head_;
if (current_cell_) return ((Chunk *)current_cell_->item());
return NULL;
}
int ArrayDistribution::total_elements()
{
printf("In ArrayDistributon: total_elements shouldn't be called\n");
return 0;
}
ChunkAllocPolicy ArrayDistribution::alloc_policy()
{
printf("In ArrayDistributon: alloc_policy, shouldn't be called\n");
return ROUND_ROBIN;
}
void ArrayDistribution::list_clear() { current_cell_ = NULL; }
/********************************
* RegularDistribution *
********************************/
RegularDistribution::RegularDistribution(int rank, ArrayLayout *layout,
Distribution *dist,
ChunkAllocPolicy alloc_policy,
Block_Distribution block_dist)
: ArrayDistribution()
{
layout_ = new ArrayLayout(layout);
rank_ = rank;
alloc_policy_ = alloc_policy;
dist_ = copy_distribution(rank_, dist);
block_dist_ = block_dist;
}
RegularDistribution::RegularDistribution(int **schema_buf) : ArrayDistribution()
{
int* ptr = *schema_buf;
layout_ = new ArrayLayout(&ptr);
rank_ = *ptr++;
dist_ = new_distribution(&ptr, rank_);
alloc_policy_ = (ChunkAllocPolicy)*ptr++;
block_dist_ = (Block_Distribution)*ptr++;
*schema_buf = ptr;
}
RegularDistribution::~RegularDistribution()
{
if (layout_) { delete layout_; layout_ = NULL; }
if (dist_ ) { free(dist_); dist_ = NULL; }
}
Boolean RegularDistribution::equal(ArrayDistribution *that)
{
if (!that) return NO;
RegularDistribution *tmp;
if (that->distribution_type() == Regular)
tmp = (RegularDistribution *)that;
else return NO;
if (layout_->equal(tmp->layout_) &&
equal_distribution(rank_, dist_, tmp->dist_)) return YES;
return NO;
}
ArrayLayout *RegularDistribution::layout()
{
return layout_;
}
Distribution *RegularDistribution::distribution()
{
return dist_;
}
void RegularDistribution::pack(int **schema_buf)
{
int* ptr = *schema_buf;
*ptr++ = (int)Regular;
layout_->pack(&ptr);
*ptr++ = rank_;
pack_distribution(&ptr, rank_, dist_);
*ptr++ = (int)alloc_policy_;
*ptr++ = block_dist_;
*schema_buf = ptr;
}
int RegularDistribution::distribution_type()
{
return Regular;
}
int RegularDistribution::total_elements()
{
return layout_->total_elements();
}
ChunkAllocPolicy RegularDistribution::alloc_policy() { return alloc_policy_; }
int RegularDistribution::get_next_index(Chunk *&chunk, int old_val,
int io_node_num,
int num_io_nodes, int max)
{
if (old_val == -1) return io_node_num;
else return (old_val + num_io_nodes);
}
Block_Distribution RegularDistribution::block_dist() { return block_dist_; }
/********************************
* IrregularDistribution *
********************************/
int IrregularDistribution::distribution_type()
{
return Irregular;
}
int IrregularDistribution::total_elements()
{
return num_of_chunks_;
}
int IrregularDistribution::get_next_index(Chunk *&chunk,
int old_val, int io_node_num,
int num_io_nodes, int max)
{
chunk = get_next_chunk();
if (chunk == NULL) return max;
return chunk->chunk_id();
}
IrregularDistribution::IrregularDistribution(int num, Chunk **chunk_list)
: ArrayDistribution()
{
for (int i=0; i<num; i++) add_last(chunk_list[i]);
}
|
