-
Notifications
You must be signed in to change notification settings - Fork 1.8k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add and update samples with CUDA 10.1 Update 1 support
- Loading branch information
Showing
210 changed files
with
46,852 additions
and
1,139 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,166 @@ | ||
| /* Copyright (c) 2019, NVIDIA CORPORATION. All rights reserved. | ||
| * | ||
| * Redistribution and use in source and binary forms, with or without | ||
| * modification, are permitted provided that the following conditions | ||
| * are met: | ||
| * * Redistributions of source code must retain the above copyright | ||
| * notice, this list of conditions and the following disclaimer. | ||
| * * Redistributions in binary form must reproduce the above copyright | ||
| * notice, this list of conditions and the following disclaimer in the | ||
| * documentation and/or other materials provided with the distribution. | ||
| * * Neither the name of NVIDIA CORPORATION nor the names of its | ||
| * contributors may be used to endorse or promote products derived | ||
| * from this software without specific prior written permission. | ||
| * | ||
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY | ||
| * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR | ||
| * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | ||
| * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | ||
| * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | ||
| * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | ||
| * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| */ | ||
|
|
||
| #ifndef HELPER_CUSOLVER | ||
| #define HELPER_CUSOLVER | ||
|
|
||
| #include <ctype.h> | ||
| #include <cuda_runtime.h> | ||
| #include <math.h> | ||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
| #include <string.h> | ||
|
|
||
| #include "cusparse.h" | ||
|
|
||
| #define SWITCH_CHAR '-' | ||
|
|
||
| struct testOpts { | ||
| char *sparse_mat_filename; // by switch -F<filename> | ||
| const char *testFunc; // by switch -R<name> | ||
| const char *reorder; // by switch -P<name> | ||
| int lda; // by switch -lda<int> | ||
| }; | ||
|
|
||
| double vec_norminf(int n, const double *x) { | ||
| double norminf = 0; | ||
| for (int j = 0; j < n; j++) { | ||
| double x_abs = fabs(x[j]); | ||
| norminf = (norminf > x_abs) ? norminf : x_abs; | ||
| } | ||
| return norminf; | ||
| } | ||
|
|
||
| /* | ||
| * |A| = max { |A|*ones(m,1) } | ||
| */ | ||
| double mat_norminf(int m, int n, const double *A, int lda) { | ||
| double norminf = 0; | ||
| for (int i = 0; i < m; i++) { | ||
| double sum = 0.0; | ||
| for (int j = 0; j < n; j++) { | ||
| double A_abs = fabs(A[i + j * lda]); | ||
| sum += A_abs; | ||
| } | ||
| norminf = (norminf > sum) ? norminf : sum; | ||
| } | ||
| return norminf; | ||
| } | ||
|
|
||
| /* | ||
| * |A| = max { |A|*ones(m,1) } | ||
| */ | ||
| double csr_mat_norminf(int m, int n, int nnzA, const cusparseMatDescr_t descrA, | ||
| const double *csrValA, const int *csrRowPtrA, | ||
| const int *csrColIndA) { | ||
| const int baseA = | ||
| (CUSPARSE_INDEX_BASE_ONE == cusparseGetMatIndexBase(descrA)) ? 1 : 0; | ||
|
|
||
| double norminf = 0; | ||
| for (int i = 0; i < m; i++) { | ||
| double sum = 0.0; | ||
| const int start = csrRowPtrA[i] - baseA; | ||
| const int end = csrRowPtrA[i + 1] - baseA; | ||
| for (int colidx = start; colidx < end; colidx++) { | ||
| // const int j = csrColIndA[colidx] - baseA; | ||
| double A_abs = fabs(csrValA[colidx]); | ||
| sum += A_abs; | ||
| } | ||
| norminf = (norminf > sum) ? norminf : sum; | ||
| } | ||
| return norminf; | ||
| } | ||
|
|
||
| void display_matrix(int m, int n, int nnzA, const cusparseMatDescr_t descrA, | ||
| const double *csrValA, const int *csrRowPtrA, | ||
| const int *csrColIndA) { | ||
| const int baseA = | ||
| (CUSPARSE_INDEX_BASE_ONE == cusparseGetMatIndexBase(descrA)) ? 1 : 0; | ||
|
|
||
| printf("m = %d, n = %d, nnz = %d, matlab base-1\n", m, n, nnzA); | ||
|
|
||
| for (int row = 0; row < m; row++) { | ||
| const int start = csrRowPtrA[row] - baseA; | ||
| const int end = csrRowPtrA[row + 1] - baseA; | ||
| for (int colidx = start; colidx < end; colidx++) { | ||
| const int col = csrColIndA[colidx] - baseA; | ||
| double Areg = csrValA[colidx]; | ||
| printf("A(%d, %d) = %20.16E\n", row + 1, col + 1, Areg); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| #if defined(_WIN32) | ||
| #if !defined(WIN32_LEAN_AND_MEAN) | ||
| #define WIN32_LEAN_AND_MEAN | ||
| #endif | ||
| #include <windows.h> | ||
| double second(void) { | ||
| LARGE_INTEGER t; | ||
| static double oofreq; | ||
| static int checkedForHighResTimer; | ||
| static BOOL hasHighResTimer; | ||
|
|
||
| if (!checkedForHighResTimer) { | ||
| hasHighResTimer = QueryPerformanceFrequency(&t); | ||
| oofreq = 1.0 / (double)t.QuadPart; | ||
| checkedForHighResTimer = 1; | ||
| } | ||
| if (hasHighResTimer) { | ||
| QueryPerformanceCounter(&t); | ||
| return (double)t.QuadPart * oofreq; | ||
| } else { | ||
| return (double)GetTickCount() / 1000.0; | ||
| } | ||
| } | ||
|
|
||
| #elif defined(__linux__) || defined(__QNX__) | ||
| #include <stddef.h> | ||
| #include <sys/resource.h> | ||
| #include <sys/time.h> | ||
| double second(void) { | ||
| struct timeval tv; | ||
| gettimeofday(&tv, NULL); | ||
| return (double)tv.tv_sec + (double)tv.tv_usec / 1000000.0; | ||
| } | ||
|
|
||
| #elif defined(__APPLE__) | ||
| #include <stddef.h> | ||
| #include <sys/resource.h> | ||
| #include <sys/sysctl.h> | ||
| #include <sys/time.h> | ||
| #include <sys/types.h> | ||
| double second(void) { | ||
| struct timeval tv; | ||
| gettimeofday(&tv, NULL); | ||
| return (double)tv.tv_sec + (double)tv.tv_usec / 1000000.0; | ||
| } | ||
| #else | ||
| #error unsupported platform | ||
| #endif | ||
|
|
||
| #endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.