-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.h
254 lines (205 loc) · 6.27 KB
/
utils.h
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
#ifndef _UTILS_
#define _UTILS_
#include "common.h"
int binary_search_right_boundary_kernel(const int *row_pointer,
const int key_input,
const int size)
{
int start = 0;
int stop = size - 1;
int median;
int key_median;
while (stop >= start)
{
median = (stop + start) / 2;
key_median = row_pointer[median];
if (key_input >= key_median)
start = median + 1;
else
stop = median - 1;
}
return start;
}
void binary_search_right_boundary_item_kernel(const MAT_PTR_TYPE *row_pointer,
const MAT_PTR_TYPE key_input,
const int size,
int *colpos,
MAT_PTR_TYPE *nnzpos)
{
int start = 0;
int stop = size - 1;
MAT_PTR_TYPE median;
MAT_PTR_TYPE key_median;
while (stop >= start)
{
median = (stop + start) / 2;
key_median = row_pointer[median];
if (key_input >= key_median)
start = median + 1;
else
stop = median - 1;
}
*colpos = start - 1;
*nnzpos = key_input - row_pointer[*colpos];
}
// in-place exclusive scan
void exclusive_scan(MAT_PTR_TYPE *input, int length)
{
if(length == 0 || length == 1)
return;
MAT_PTR_TYPE old_val, new_val;
old_val = input[0];
input[0] = 0;
for (int i = 1; i < length; i++)
{
new_val = input[i];
input[i] = old_val + input[i-1];
old_val = new_val;
}
}
void exclusive_scan_char(unsigned char *input, int length)
{
if(length == 0 || length == 1)
return;
unsigned char old_val, new_val;
old_val = input[0];
input[0] = 0;
for (int i = 1; i < length; i++)
{
new_val = input[i];
input[i] = old_val + input[i-1];
old_val = new_val;
}
}
/*
// in-place exclusive scan
void exclusive_scan_int(int *input, int length)
{
if(length == 0 || length == 1)
return;
int old_val, new_val;
old_val = input[0];
input[0] = 0;
for (int i = 1; i < length; i++)
{
new_val = input[i];
input[i] = old_val + input[i-1];
old_val = new_val;
}
}
*/
void swap_key(int *a , int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
void swap_val(MAT_VAL_TYPE *a , MAT_VAL_TYPE *b)
{
MAT_VAL_TYPE tmp = *a;
*a = *b;
*b = tmp;
}
// quick sort key-value pair (child function)
int partition_key_val_pair(int *key, MAT_VAL_TYPE *val, int length, int pivot_index)
{
int i = 0 ;
int small_length = pivot_index;
int pivot = key[pivot_index];
swap_key(&key[pivot_index], &key[pivot_index + (length - 1)]);
swap_val(&val[pivot_index], &val[pivot_index + (length - 1)]);
for(; i < length; i++)
{
if(key[pivot_index+i] < pivot)
{
swap_key(&key[pivot_index+i], &key[small_length]);
swap_val(&val[pivot_index+i], &val[small_length]);
small_length++;
}
}
swap_key(&key[pivot_index + length - 1], &key[small_length]);
swap_val(&val[pivot_index + length - 1], &val[small_length]);
return small_length;
}
// quick sort key-value pair (main function)
void quick_sort_key_val_pair(int *key, MAT_VAL_TYPE *val, int length)
{
if(length == 0 || length == 1)
return;
int small_length = partition_key_val_pair(key, val, length, 0) ;
quick_sort_key_val_pair(key, val, small_length);
quick_sort_key_val_pair(&key[small_length + 1], &val[small_length + 1], length - small_length - 1);
}
// quick sort key (child function)
int partition_key(int *key, int length, int pivot_index)
{
int i = 0 ;
int small_length = pivot_index;
int pivot = key[pivot_index];
swap_key(&key[pivot_index], &key[pivot_index + (length - 1)]);
for(; i < length; i++)
{
if(key[pivot_index+i] < pivot)
{
swap_key(&key[pivot_index+i], &key[small_length]);
small_length++;
}
}
swap_key(&key[pivot_index + length - 1], &key[small_length]);
return small_length;
}
// quick sort key (main function)
void quick_sort_key(int *key, int length)
{
if(length == 0 || length == 1)
return;
int small_length = partition_key(key, length, 0) ;
quick_sort_key(key, small_length);
quick_sort_key(&key[small_length + 1], length - small_length - 1);
}
// void print__m256i(char *name, __m256i key)
// {
// printf("%s", name);
// printf("%i, ", _mm256_extract_epi32(key, 0));
// printf("%i, ", _mm256_extract_epi32(key, 1));
// printf("%i, ", _mm256_extract_epi32(key, 2));
// printf("%i, ", _mm256_extract_epi32(key, 3));
// printf("%i, ", _mm256_extract_epi32(key, 4));
// printf("%i, ", _mm256_extract_epi32(key, 5));
// printf("%i, ", _mm256_extract_epi32(key, 6));
// printf("%i, \n", _mm256_extract_epi32(key, 7));
// }
void matrix_transposition(const int m,
const int n,
const MAT_PTR_TYPE nnz,
const MAT_PTR_TYPE *csrRowPtr,
const int *csrColIdx,
const MAT_VAL_TYPE *csrVal,
int *cscRowIdx,
MAT_PTR_TYPE *cscColPtr,
MAT_VAL_TYPE *cscVal)
{
// histogram in column pointer
memset (cscColPtr, 0, sizeof(MAT_PTR_TYPE) * (n+1));
for (MAT_PTR_TYPE i = 0; i < nnz; i++)
{
cscColPtr[csrColIdx[i]]++;
}
// prefix-sum scan to get the column pointer
exclusive_scan(cscColPtr, n + 1);
MAT_PTR_TYPE *cscColIncr = (MAT_PTR_TYPE *)malloc(sizeof(MAT_PTR_TYPE) * (n+1));
memcpy (cscColIncr, cscColPtr, sizeof(MAT_PTR_TYPE) * (n+1));
// insert nnz to csc
for (int row = 0; row < m; row++)
{
for (MAT_PTR_TYPE j = csrRowPtr[row]; j < csrRowPtr[row+1]; j++)
{
int col = csrColIdx[j];
cscRowIdx[cscColIncr[col]] = row;
cscVal[cscColIncr[col]] = csrVal[j];
cscColIncr[col]++;
}
}
free (cscColIncr);
}
#endif