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
|
/*
-- MAGMA (version 2.9.0) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date January 2025
@generated from sparse/testing/testing_zgetrowptr.cpp, normal z -> d, Wed Jan 22 14:42:50 2025
@author Hartwig Anzt
*/
// includes, system
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
// includes, project
#include "magma_v2.h"
#include "magmasparse.h"
#include "testings.h"
/* ////////////////////////////////////////////////////////////////////////////
-- testing any solver
*/
int main( int argc, char** argv )
{
magma_int_t info = 0;
TESTING_CHECK( magma_init() );
magma_print_environment();
magma_queue_t queue = NULL;
magma_queue_create( 0, &queue );
/*
magma_d_matrix Z={Magma_CSR};
int i=1;
TESTING_CHECK( magma_dparse_opts( argc, argv, &zopts, &i, queue ));
printf("matrixinfo = [\n");
printf("%% size (n) || nonzeros (nnz) || nnz/n\n");
printf("%%=============================================================%%\n");
while( i < argc ) {
if ( strcmp("LAPLACE2D", argv[i]) == 0 && i+1 < argc ) { // Laplace test
i++;
magma_int_t laplace_size = atoi( argv[i] );
TESTING_CHECK( magma_dm_5stencil( laplace_size, &Z, queue ));
} else { // file-matrix test
TESTING_CHECK( magma_d_csr_mtx( &Z, argv[i], queue ));
}
printf(" %10lld %10lld %10lld\n",
(long long) Z.num_rows, (long long) Z.nnz, (long long) (Z.nnz/Z.num_rows) );
magma_dmfree(&Z, queue );
i++;
}
printf("%%=============================================================%%\n");
printf("];\n");
*/
//const magma_index_t* rowidx = new magma_index_t*[10];
magma_index_t* rowidx={NULL}, *rowptr={NULL};// = {2,6,22,8,33,12,5,1,0,6};
const magma_int_t num_rows = 10;
magma_index_malloc_cpu(&rowidx,num_rows);
magma_index_malloc_cpu(&rowptr, num_rows+1);
magma_int_t nnz=0;
magma_index_t* d_rowidx=NULL;
magma_index_t* d_rowptr=NULL;
for(int i = 0;i<10;i++)
{
rowidx[i] = (rand()%10);
}
magma_index_malloc(&d_rowidx,num_rows);
magma_index_malloc(&d_rowptr,num_rows+1);
//magma_index_malloc_cpu(&rowptr,num_rows+1);
magma_index_setvector(num_rows,rowidx,1,d_rowidx,1,queue);
TESTING_CHECK(magma_dget_row_ptr(num_rows,&nnz,d_rowidx,d_rowptr,queue));
magma_index_getvector(num_rows+1,d_rowptr,1,rowptr,1,queue);
int j =0;
for(int i = 0;i<num_rows;++i)
{
if(i==num_rows){
j = num_rows-1;
}
else{
j = i;
}
printf("Row %d has %d nnz and rowptr of %d\n", i,rowidx[j],rowptr[i]);
}
printf("total number of nz:%d\n", rowptr[num_rows]);
magma_free(d_rowidx);
magma_free(d_rowptr);
magma_free_cpu(rowptr);
magma_free_cpu(rowidx);
magma_queue_destroy( queue );
TESTING_CHECK( magma_finalize() );
return info;
}
|
