-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtensor.cpp
More file actions
2180 lines (1673 loc) · 61.3 KB
/
Copy pathtensor.cpp
File metadata and controls
2180 lines (1673 loc) · 61.3 KB
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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "tensor.h"
#include <iostream>
#include <unordered_map>
#include <map>
#include <numeric>
#include <memory>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>
#include <algorithm>
#include <parallel/algorithm>
#include <parallel/numeric>
#define PRINT_HEADER 0
#define PRINT_DEBUG 0
#define PRINT_HYBRID 0
#define LAMBDA 11
/*
Tensor Feature Extraction
-------------------------
*/
using namespace std;
int comb(int n, int r)
{
if (r == 0)
return 1;
if (r > n / 2)
return comb(n, n - r);
long res = 1;
for (int k = 1; k <= r; ++k)
{
res *= n - k + 1;
res /= k;
}
return res;
}
void sort_tensor(tensor *T, int mode)
{
std::vector<std::tuple<std::vector<int>, double>> sort_vec;
for (TENSORSIZE_T i = 0; i < T->nnz; i++)
{
int value = (T->values != nullptr) ? T->values[i] : 0;
std::vector<int> c_indices;
for (int j = 0; j < T->order; j++)
c_indices.push_back(T->indices[(j + mode) % T->order][i]);
sort_vec.emplace_back(c_indices, value);
}
std::sort(sort_vec.begin(), sort_vec.end(),
[T](std::tuple<std::vector<int>, double> t1,
std::tuple<std::vector<int>, double> t2)
{
for (int j = 0; j < T->order; j++)
{
if (std::get<0>(t1)[j] != std::get<0>(t2)[j])
return std::get<0>(t1)[j] < std::get<0>(t2)[j];
}
return false;
});
for (TENSORSIZE_T i = 0; i < T->nnz; i++)
{
auto &t = sort_vec[i];
for (int j = 0; j < T->order; j++)
{
T->indices[j][i] = std::get<0>(t)[j];
}
if (T->values != nullptr)
{
T->values[i] = std::get<1>(t);
}
}
int dim_temp[T->order];
for (int i = 0; i < T->order; i++)
dim_temp[i] = T->dim[(i + mode) % T->order];
for (int i = 0; i < T->order; i++)
T->dim[i] = dim_temp[i];
}
dim2_tensor_fragment *coo2fragment(tensor *T, int mode_order1, int mode_order2)
{
// int i, j, k;
int I0 = T->dim[mode_order1];
int I1 = T->dim[mode_order2];
TENSORSIZE_T nnz = T->nnz;
int *i0 = T->indices[mode_order1];
int *i1 = T->indices[mode_order2];
int *temp_cnt0 = (int *)safe_calloc(I0, sizeof(int));
// #pragma omp parallel for
for (TENSORSIZE_T i = 0; i < nnz; i++)
{
temp_cnt0[i0[i]]++;
}
int size0 = 0;
#pragma omp parallel for reduction(+ : size0)
for (int i = 0; i < I0; i++)
{
if (temp_cnt0[i] > 0)
{
size0 += 1;
}
}
// printf("%d \t\t : size0 \n", size0);
int *cnt0 = (int *)safe_malloc(size0 * sizeof(int));
int *ind0 = (int *)safe_malloc(size0 * sizeof(int));
int *strt0 = (int *)safe_malloc((size0 + 1) * sizeof(int));
strt0[0] = 0;
int j = 0;
// #pragma omp parallel for
for (int i = 0; i < I0; i++)
{
int temp_cnt0_i = temp_cnt0[i];
if (temp_cnt0_i != 0)
{
// #pragma omp critical
// {
cnt0[j] = temp_cnt0_i;
ind0[j] = i;
strt0[j + 1] = strt0[j] + temp_cnt0_i;
j++;
// }
}
}
free(temp_cnt0);
int size_temp_loc0 = ind0[size0 - 1] + 1;
int *temp_loc0 = (int *)safe_calloc(size_temp_loc0, sizeof(int));
#pragma omp parallel for
for (int i = 0; i < size0; i++)
{
temp_loc0[ind0[i]] = strt0[i];
}
// timer *order0_tm = timer_start("time_order0");
int *order0 = (int *)safe_calloc(nnz, sizeof(int));
// #pragma omp parallel for
for (TENSORSIZE_T k = 0; k < nnz; k++)
{
int coo_ind0 = i0[k];
order0[temp_loc0[coo_ind0]++] = k;
}
// timer_end(order0_tm);
// timer_end(level0_tm);
free(temp_loc0);
int *size1 = (int *)safe_calloc(size0, sizeof(int));
int **ind1 = (int **)safe_malloc(size0 * sizeof(int *));
int **cnt1 = (int **)safe_malloc(size0 * sizeof(int *));
// int *tmp_cnt1 = (int *)safe_calloc(I1, sizeof(int));
// int *tmp_cnt1 = (int *)safe_malloc(I1 * sizeof(int));
int *size1_start = (int *)safe_malloc((size0 + 1) * sizeof(int));
size1_start[0] = 0;
// timer *level1_tm = timer_start("time_level1");
// double time_tmp_cnt1=0;
#pragma omp parallel
{
int *tmp_cnt1 = (int *)safe_malloc(I1 * sizeof(int)); // TT REUSE ALLOC
#pragma omp for
for (int i = 0; i < size0; i++)
{
// timer *sub_level1_tm = timer_start("sub_level1");
// #pragma omp parallel for
for (int j = 0; j < I1; j++)
{
tmp_cnt1[j] = 0;
}
int size1_i = 0;
// double time_start = omp_get_wtime();
// #pragma omp parallel for
for (int j = strt0[i]; j < strt0[i + 1]; j++)
{
int curr_i1 = i1[order0[j]];
tmp_cnt1[curr_i1]++;
if (tmp_cnt1[curr_i1] == 1) // TT: MERGE HERE
size1_i++;
}
// double time_tmp_cnt1 += omp_get_wtime() - time_start; // TT :: check times seperately
// #pragma omp parallel for reduction(+: size1_i)
// for ( j = 0; j < I1; j++){
// if(tmp_cnt1[j] > 0)
// size1_i += 1;
// }
// TT: CHECK MALLOC TIMES
// size1[i] = reduce(tmp_cnt1, I1, UNIT_SUM_OP, 0);
cnt1[i] = (int *)calloc(size1_i, sizeof(int));
ind1[i] = (int *)calloc(size1_i, sizeof(int));
// int* cnt1_i = cnt1[i];
// int* ind1_i = ind1[i];
size1[i] = size1_i;
int k = 0;
// #pragma omp parallel for
for (int z = 0; z < I1; z++)
{
int tmp_cnt1_z = tmp_cnt1[z];
if (tmp_cnt1_z != 0)
{
// cnt1_i[k]=tmp_cnt1[z];
// ind1_i[k]=z;
cnt1[i][k] = tmp_cnt1_z;
ind1[i][k] = z;
// #pragma omp atomic
k++;
}
}
}
free(tmp_cnt1);
// memset(tmp_cnt1, 0, sizeof(int)*I1);
// timer_end(sub_level1_tm);
}
// timer_end(level1_tm);
// free(tmp_cnt1);
free(order0);
free(strt0);
for (int i = 0; i < size0; i++)
{
size1_start[i + 1] = size1_start[i] + size1[i];
}
int size1_tot = size1_start[size0];
int *ind1_all = (int *)safe_malloc(size1_tot * sizeof(int));
int *cnt1_all = (int *)safe_malloc(size1_tot * sizeof(int));
#pragma omp parallel for
for (int i = 0; i < size0; i++)
{
int strt = size1_start[i];
int end = size1_start[i + 1];
for (j = strt; j < end; j++)
{
int j_strt = j - strt;
ind1_all[j] = ind1[i][j_strt];
cnt1_all[j] = cnt1[i][j_strt];
}
}
for (int i = 0; i < size0; i++)
{
free(ind1[i]);
free(cnt1[i]);
}
free(ind1);
free(cnt1);
dim2_tensor_fragment *fragment = (dim2_tensor_fragment *)safe_malloc(sizeof(dim2_tensor_fragment));
fragment->cnt0 = cnt0;
fragment->ind0 = ind0;
// fragment->ind1 = ind1;
// fragment->cnt1 = cnt1;
fragment->size1_tot = size1_tot;
fragment->ind1 = ind1_all;
fragment->cnt1 = cnt1_all;
fragment->size0 = size0;
fragment->size1 = size1;
// timer_end(mode_tm);
return fragment;
}
tensor *create_tensor(int order, TENSORSIZE_T nnz)
{
tensor *T = (tensor *)safe_malloc(sizeof(tensor));
T->indices = (int **)safe_malloc(order * sizeof(int *));
T->dim = (int *)safe_malloc(order * sizeof(int));
for (int i = 0; i < order; i++)
{
T->indices[i] = (int *)safe_malloc(nnz * sizeof(int));
}
T->values = (double *)safe_malloc(nnz * sizeof(double));
T->order = order;
T->nnz = nnz;
return T;
}
void tensor_to_3d (tensor *T, tensor * T3d){
int max_arr [6];
T3d->org_order = T->order;
for (int i = 0; i <T->order; i++){
T3d->org_dim[i] = T->dim[i];
}
find_max3 ( T->dim, T->order, max_arr );
// update dim of T3d
for (int i=0; i<3; i++){
T3d->dim [i] = max_arr[i+3] ;
// T3d->dim [i] = T->dim [ max_arr[i] ];
for (TENSORSIZE_T j=0; j<T3d->nnz; j++){
T3d->indices[i][j] = T->indices[max_arr[i]][j];
}
}
for (int i = 0; i < T->order; i++){
free(T->indices[i]);
}
free(T->indices);
free(T->values);
}
void find_max3 ( int * arr, int arr_size, int * max_arr ) {
int first, second, third, first_i, second_i, third_i;
third = first = second = first_i = second_i = third_i = 0;
int curr;
for(int i = 0; i < arr_size; i++)
{
curr = arr[i];
// If current element is
// greater than first
if (curr > first)
{
third = second;
second = first;
first = curr;
third_i = second_i;
second_i = first_i;
first_i = i;
}
// If arr[i] is in between first
// and second then update second
else if (curr > second )
{
third = second;
second = curr;
third_i = second_i;
second_i = i;
}
else if (curr > third ){
third = curr;
third_i = i;
}
}
max_arr[0] = first_i;
max_arr[1] = second_i;
max_arr[2] = third_i;
max_arr[3] = first;
max_arr[4] = second;
max_arr[5] = third;
}
tensor *read_tensor(FILE *file_ptr, int order, TENSORSIZE_T nnz)
{
size_t tensor_MAXLINE = 500; // May be inline
char line[tensor_MAXLINE];
int curr_ind, max_dim;
tensor *T = create_tensor(order, nnz);
char *fgets_out = NULL;
fgets_out = fgets(line, tensor_MAXLINE, file_ptr);
fgets_out = fgets(line, tensor_MAXLINE, file_ptr);
// read from file to tensor in COO format
for (TENSORSIZE_T i = 0; i < nnz; i++)
{
fgets_out = fgets(line, tensor_MAXLINE, file_ptr);
char *token = strtok(line, " \t");
// loop through the string to extract all other tokens
for (int j = 0; j < order; j++)
{
// T->indices[j][i] = atoi(token);
T->indices[j][i] = atoi(token) - 1;
token = strtok(NULL, " \t");
}
char *dummy;
T->values[i] = strtod(token, &dummy);
}
if (fgets_out == NULL)
printf("\n fgets output is NULL! \n\n");
// find dim
for (int j = 0; j < order; j++){
max_dim = 0;
for (TENSORSIZE_T i = 0; i < nnz; i++){
curr_ind = T->indices[j][i];
if(max_dim < curr_ind ){
max_dim = curr_ind ;
}
}
T->dim[j] = max_dim + 1 ;
}
return T;
}
tensor *read_tensor_binary(FILE *file_ptr, int order, TENSORSIZE_T nnz)
{
size_t tensor_MAXLINE = 500; // May be inline
char line[tensor_MAXLINE];
int curr_ind, max_dim;
tensor *T = create_tensor(order, nnz);
char *fgets_out = NULL;
// read from file to tensor in COO format
for (TENSORSIZE_T i = 0; i < nnz; i++)
{
fgets_out = fgets(line, tensor_MAXLINE, file_ptr);
char *token = strtok(line, " \t");
// loop through the string to extract all other tokens
for (int j = 0; j < order; j++)
{
T->indices[j][i] = atoi(token) - 1;
token = strtok(NULL, " \t");
}
}
if (fgets_out == NULL)
printf("\n fgets output is NULL! \n\n");
// find dim
for (int j = 0; j < order; j++){
max_dim = 0;
for (TENSORSIZE_T i = 0; i < nnz; i++){
curr_ind = T->indices[j][i];
if(max_dim < curr_ind ){
max_dim = curr_ind ;
}
}
T->dim[j] = max_dim + 1 ;
}
return T;
}
TENSORSIZE_T calculate_num_slices(int order, int *dim)
{
TENSORSIZE_T num_slices = 0;
for (int i = 0; i < order - 1; i++)
{
for (int j = i + 1; j < order; j++)
{
TENSORSIZE_T mult = 1;
for (int k = 0; k < order; k++)
{
if (k != i && k != j)
mult *= dim[k];
}
num_slices += mult;
}
}
return num_slices;
}
TENSORSIZE_T calculate_num_fibers(int order, int *dim)
{
TENSORSIZE_T num_fibers = 0;
for (int i = 0; i < order; i++)
{
TENSORSIZE_T mult = 1;
for (int j = 0; j < order; j++)
if (j != i)
mult *= dim[j];
num_fibers += mult;
}
return num_fibers;
}
/* sparsity */
double calculate_sparsity(TENSORSIZE_T nnz, int order, int *dim)
{
double density = (nnz + 0.0) / dim[0];
for (int i = 1; i < order; i++)
density = density / dim[i];
return density;
}
/*Calculates std for nonzeros. Discards 0 values */
double calculate_std(int *arr, int arr_size, TENSORSIZE_T num_elems, double mean)
{
double c_mean;
if (mean == -1)
c_mean = ((double)reduce_sum(arr, arr_size)) / num_elems;
else
c_mean = mean;
double sqr_sum = 0;
#pragma omp parallel for reduction(+ : sqr_sum)
for (int i = 0; i < arr_size; i++)
{
// if(arr[i]==0) continue; // TT: already all entries nonzero !
double mean_diff = arr[i] - c_mean;
sqr_sum += mean_diff * mean_diff;
}
// If we want std of all elements including zero !
if (num_elems - arr_size > 0){
sqr_sum += (num_elems-arr_size) * c_mean * c_mean;
}
return sqrt(sqr_sum / num_elems);
}
void calculate_nnzSliceCnt_fragment(dim2_tensor_fragment **fragments, int num_fragments, int *offsets)
{
offsets[0] = 0;
for (int i = 0; i < num_fragments; i++)
{
offsets[i+1] = offsets[i] + fragments[i]->size0;
}
}
void calculate_nnzFiberCnt_fragment(dim2_tensor_fragment **fragments, int num_fragments, int* offsets)
{
offsets[0] = 0;
for (int i = 0; i < num_fragments; i++){
fragments[i]->size1_tot = reduce_sum(fragments[i]->size1, fragments[i]->size0);
offsets[i+1] = offsets[i] + fragments[i]->size1_tot;
}
}
void calculate_nnzPerSlice_fragment(dim2_tensor_fragment **fragments, int num_fragments, int *nnzPerSlice)
{
int start_index = 0;
for (int i = 0; i < num_fragments; i++)
{
dim2_tensor_fragment *curr_frag = fragments[i];
int curr_frag_size0 = curr_frag->size0;
#pragma omp parallel for
for (int j = 0; j < curr_frag_size0; j++)
nnzPerSlice[start_index + j] = curr_frag->cnt0[j];
start_index += curr_frag_size0;
}
}
void calculate_nnzPerFiber_fragment(dim2_tensor_fragment **fragments, int num_fragments, int *nnzPerFiber)
{
int start_index = 0;
for (int i = 0; i < num_fragments; i++)
{
dim2_tensor_fragment *curr_frag = fragments[i];
int curr_frag_size1_tot = curr_frag->size1_tot;
#pragma omp parallel for
for (int j = 0; j < curr_frag_size1_tot; j++)
nnzPerFiber[start_index + j] = curr_frag->cnt1[j];
start_index += curr_frag_size1_tot;
// for(int j=0; j<cur_frag->size0; j++){
// memcpy(nnzPerFiber + start_index, cur_frag->cnt1[j], (size_t)sizeof(int) * cur_frag->size1[j]);
// start_index += cur_frag->size1[j];
// }
}
}
void calculate_fibersPerSlice_fragment(dim2_tensor_fragment **fragments, int num_fragments, int *fibersPerSlice)
{
int start_index = 0;
for (int i = 0; i < num_fragments; i++)
{
dim2_tensor_fragment *curr_frag = fragments[i];
int curr_frag_size0 = curr_frag->size0;
#pragma omp parallel for
for (int j = 0; j < curr_frag_size0; j++)
fibersPerSlice[start_index + j] = curr_frag->size1[j];
start_index += curr_frag_size0;
}
}
mode_based_features *extract_features(tensor *T, enum EXTRACTION_METHOD method)
{
switch (method)
{
case MAP:
return extract_features_modes(T);
break;
case SORT:
return extract_features_sort(T);
break;
case FRAGMENT:
return extract_features_fragment(T);
break;
case HYBRID:
return extract_features_hybrid(T);
default:
return extract_features_sort(T);
break;
}
}
void print_vec ( int *array, int array_size)
{
for (int i = 0; i<array_size; i++){
printf ("%d ", array[i]);
}
}
void extract_final_mode(mode_features *features, int *nnzPerX, int nnzPerX_size)
{
features->nz_cnt = nnzPerX_size;
features->max = reduce_max(nnzPerX, nnzPerX_size);
features->min = reduce_min(nnzPerX, nnzPerX_size);
features->dev = features->max - features->min;
TENSORSIZE_T allCnt = features->all_cnt;
if (PRINT_DEBUG){
printf(" ig_dim1 : %d, ig_dim2 : %d, ", features->ignored_dim1, features->ignored_dim2);
printf(" all_cnt : %Ld, nz_cnt: %d, array : [ ", allCnt, nnzPerX_size);
print_vec (nnzPerX, nnzPerX_size);
printf(" ] ");
}
TENSORSIZE_T sum = reduce_sum(nnzPerX, nnzPerX_size);
double avg = (sum + 0.0) / allCnt;
features->sum = sum;
features->avg = avg;
features->stDev = calculate_std(nnzPerX, nnzPerX_size, allCnt, avg);
features->cv = features->stDev / avg;
// This mean is the mean of only nonzero values !
features->avg_onlynz = (sum + 0.0) / nnzPerX_size;
// printf(" sum : %ld, avg: %f, avg_onlynz : %f \n", sum, avg, features->avg_onlynz);
// This std is the std of only nonzero values !
features->stDev_onlynz = calculate_std(nnzPerX, nnzPerX_size, nnzPerX_size, features->avg_onlynz);
features->cv_onlynz = features->stDev_onlynz / features->avg_onlynz;
}
int calculate_nnz_per_slice_sort(tensor *T, int *nnz_per_slice, int *adj_nnz_per_slice)
{
nnz_per_slice[0] = 1;
// bool adj = false;
int offset = 0;
for (TENSORSIZE_T i = 1; i < T->nnz; i++)
{
if (T->indices[0][i - 1] != T->indices[0][i])
{
/*
if (offset > 0)
{
if (adj)
*adj_nnz_per_slice += abs(nnz_per_slice[offset] - nnz_per_slice[offset - 1]);
else
*adj_nnz_per_slice += nnz_per_slice[offset] + nnz_per_slice[offset - 1];
}
*/
//adj = T->indices[0][i] - T->indices[0][i - 1] == 1;
offset++;
}
nnz_per_slice[offset]++;
}
/*
if (T->indices[0][0] > 0)
*adj_nnz_per_slice += nnz_per_slice[0];
if (T->indices[0][T->nnz - 1] < T->dim[0] - 1)
*adj_nnz_per_slice += nnz_per_slice[offset];
*/
return offset + 1;
}
int calculate_nnz_per_fiber_sort(tensor *T, int *nnz_per_fiber, int *adj_nnz_per_fiber)
{
int offset = 0;
nnz_per_fiber[0] = 1;
// bool adj = false;
for (TENSORSIZE_T i = 1; i < T->nnz; i++)
{
if (T->indices[0][i - 1] != T->indices[0][i] ||
T->indices[1][i - 1] != T->indices[1][i])
{
/*
if (offset > 0)
{
if (adj)
*adj_nnz_per_fiber += abs(nnz_per_fiber[offset] - nnz_per_fiber[offset - 1]);
else
*adj_nnz_per_fiber += nnz_per_fiber[offset] + nnz_per_fiber[offset - 1];
}
adj = (T->indices[0][i] - T->indices[0][i - 1]) == 1;*/
offset++;
}
nnz_per_fiber[offset]++;
}
/*
if (T->indices[0][0] > 0)
*adj_nnz_per_fiber += nnz_per_fiber[0];
if (T->indices[0][T->nnz - 1] < T->dim[0] - 1)
*adj_nnz_per_fiber += nnz_per_fiber[offset];
*/
return offset + 1;
}
int calculate_fibers_per_slice_sort(tensor *T, int *fibers_per_slice, int *adj_fibers_per_slice)
{
int offset = 0;
//bool adj = false;
fibers_per_slice[0] = 1;
for (TENSORSIZE_T i = 1; i < T->nnz; i++)
{
if (T->indices[0][i - 1] != T->indices[0][i])
{
/*
if (offset > 0)
{
if (adj)
*adj_fibers_per_slice += abs(fibers_per_slice[offset] - fibers_per_slice[offset - 1]);
else
*adj_fibers_per_slice += fibers_per_slice[offset] + fibers_per_slice[offset - 1];
}
adj = T->indices[0][i] - T->indices[0][i - 1] == 1;*/
offset++;
fibers_per_slice[offset] = 1;
}
else
{
fibers_per_slice[offset] += (T->indices[1][i - 1] != T->indices[1][i]);
}
}
/*
if (T->indices[0][0] > 0)
*adj_fibers_per_slice += fibers_per_slice[0];
if (T->indices[0][T->nnz - 1] < T->dim[0] - 1)
*adj_fibers_per_slice += fibers_per_slice[offset];
*/
return offset + 1;
}
void calculate_nnz_per_slice_map(tensor *T, SliceMap *nnz_per_slice_m)
{
for (TENSORSIZE_T j = 0; j < T->nnz; j++)
{
nnz_per_slice_m->increment(j);
}
}
void calculate_nnz_per_fiber_map(tensor *T, int fiber_id, FiberMap *nnz_per_fiber_m)
{
for (TENSORSIZE_T j = 0; j < T->nnz; j++)
{
nnz_per_fiber_m->increment(j);
}
}
void calculate_fibers_per_slice_map(tensor *T, int fiber_id, FiberMap *nnz_per_fiber_m, SliceMap **fibers_per_slice_m)
{
int s = T->order - 2 - fiber_id;
// printf("\nfiber_id: %d\n", fiber_id);
// printf("s: %d\n", s);
for (TENSORSIZE_T j = 0; j < T->nnz; j++)
{
bool first = nnz_per_fiber_m->increment(j);
// printf("---------------------\n");
// printf("j: %d\n", j);
if (first)
{
for (int z = fiber_id + 1; z < T->order; z++)
{
int fps_index = T->order - 1 - z + (s * (s + 1)) / 2;
fibers_per_slice_m[fps_index]->increment(j);
// printf("z: %d\n", z);
// printf("fps_index: %d\n", fps_index);
}
}
}
}
void calculate_nnz_per_fiber_and_fibers_per_slice_map(tensor *T, int fiber_id, FiberMap *nnz_per_fiber_m, SliceMap **fibers_per_slice_m)
{
int order = T->order;
fiber_id = order - 1 - fiber_id; //added for reverse fps order
int s = order - 2 - fiber_id;
// printf("\nfiber_id: %d, ", fiber_id);
// printf("s: %d\n", s);
for (TENSORSIZE_T j = 0; j < T->nnz; j++)
{
bool first = nnz_per_fiber_m->increment(j);
// printf("---------------------\n");
// printf("j: %d\n", j);
if (first)
{
for (int z = fiber_id + 1; z < order; z++)
{
int fps_index = order - 1 - z + (s * (s + 1)) / 2;
// int s = floor((sqrt(1 + 8 * i) - 1.0) / 2.0);
// int fps_index = T->order - 2 - s;
fibers_per_slice_m[fps_index]->increment(j);
// int ignored_dim_2 = T->order - 2 - s;
// int ignored_dim_1 = T->order - 1 - i + (s * (s + 1)) / 2;
// printf("z: %d, ", z);
// printf("fps_index: %d\n", fps_index);
}
}
}
}
mode_based_features *extract_features_sort(tensor *T)
{
TENSORSIZE_T nnz = T->nnz;
int order = T->order;
int *dim = T->dim;
TENSORSIZE_T num_slices = calculate_num_slices(order, dim);
TENSORSIZE_T num_fibers = calculate_num_fibers(order, dim);
int *nnzPerSlice = (int *)safe_calloc(order * nnz, sizeof(int));
int *fibersPerSlice = (int *)safe_calloc(order * nnz, sizeof(int));
int *nnzPerFiber = (int *)safe_calloc(order * nnz, sizeof(int));
int adjNnzPerSlice = 0;
int adjNnzPerFiber = 0;
int adjFibersPerSlice = 0;
int mode_num = 3;
int num_modes_for_slices = comb(T->order, 2);
int num_modes_for_fibers = T->order; // comb(T->order, 1) = T->order
int slice_offsets[num_modes_for_slices+1];
int fiber_offsets[num_modes_for_fibers+1];
int fps_offsets[num_modes_for_slices+1];
slice_offsets[0] = 0;
fiber_offsets[0] = 0;
fps_offsets[0] = 0;
// printf ("before \n");
timer *arrays_tm = timer_start("time_find_arrays_total");
for (int mode = 0; mode < mode_num; mode++)
{
// printf ("before mode %d \n", mode);
char name_string[30];
sprintf(name_string, "time_sort_mode_%d", mode);
timer *arrays_tm_ind = timer_start(name_string);
sort_tensor(T, 1);
int slice_offset = calculate_nnz_per_slice_sort(T, nnzPerSlice + slice_offsets[mode], &(adjNnzPerSlice));
int fiber_offset = calculate_nnz_per_fiber_sort(T, nnzPerFiber + fiber_offsets[mode], &(adjNnzPerFiber));
int fps_offset = calculate_fibers_per_slice_sort(T, fibersPerSlice + fps_offsets[mode], &(adjFibersPerSlice));
slice_offsets[mode+1] = slice_offset + slice_offsets[mode];
fiber_offsets[mode+1] = fiber_offset + fiber_offsets[mode];
fps_offsets[mode+1] = fps_offset + fps_offsets[mode];
timer_end(arrays_tm_ind);
}
timer_end(arrays_tm);
// printf ("after \n");
timer *extract_final_tm = timer_start("time_extract_final");
base_features *features = new base_features();
mode_features **slice_mode_features = new mode_features *[num_modes_for_slices];
mode_features **fps_mode_features = new mode_features *[num_modes_for_slices];
mode_features **fiber_mode_features = new mode_features *[num_modes_for_fibers];
mode_based_features *all = new mode_based_features{features, slice_mode_features, fiber_mode_features, fps_mode_features};
features->tensor_name = T->tensor_name ;
features->order = order;
features->org_order = T->org_order;
features->org_order = T->org_order;
features->dim = dim;