Maneesh Gupta
77 строки
2.9 KiB
C++
77 строки
2.9 KiB
C++
/*
|
|
Copyright (c) 2015-2017 Advanced Micro Devices, Inc. All rights reserved.
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANNTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INNCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANNY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER INN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR INN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
*/
|
|
|
|
/*
|
|
* Test for checking the functionality of
|
|
* hipError_t hipDeviceSynchronize();
|
|
*/
|
|
|
|
/* HIT_START
|
|
* BUILD: %t %s ../../test_common.cpp
|
|
* TEST: %t
|
|
* HIT_END
|
|
*/
|
|
|
|
#include "test_common.h"
|
|
|
|
#define _SIZE sizeof(int) * 1024 * 1024
|
|
#define NUM_STREAMS 2
|
|
|
|
__global__ void Iter(int* Ad, int num) {
|
|
int tx = threadIdx.x + blockIdx.x * blockDim.x;
|
|
// Kernel loop designed to execute very slowly... ... ... so we can test timing-related
|
|
// behavior below
|
|
if (tx == 0) {
|
|
for (int i = 0; i < num; i++) {
|
|
Ad[tx] += 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
int* A[NUM_STREAMS];
|
|
int* Ad[NUM_STREAMS];
|
|
hipStream_t stream[NUM_STREAMS];
|
|
for (int i = 0; i < NUM_STREAMS; i++) {
|
|
HIPCHECK(hipHostMalloc((void**)&A[i], _SIZE, hipHostMallocDefault));
|
|
A[i][0] = 1;
|
|
HIPCHECK(hipMalloc((void**)&Ad[i], _SIZE));
|
|
HIPCHECK(hipStreamCreate(&stream[i]));
|
|
}
|
|
for (int i = 0; i < NUM_STREAMS; i++) {
|
|
HIPCHECK(hipMemcpyAsync(Ad[i], A[i], _SIZE, hipMemcpyHostToDevice, stream[i]));
|
|
}
|
|
for (int i = 0; i < NUM_STREAMS; i++) {
|
|
hipLaunchKernelGGL(HIP_KERNEL_NAME(Iter), dim3(1), dim3(1), 0, stream[i], Ad[i], 1 << 30);
|
|
}
|
|
for (int i = 0; i < NUM_STREAMS; i++) {
|
|
HIPCHECK(hipMemcpyAsync(A[i], Ad[i], _SIZE, hipMemcpyDeviceToHost, stream[i]));
|
|
}
|
|
|
|
|
|
// This first check but relies on the kernel running for so long that the D2H async memcopy has
|
|
// not started yet. This will be true in an optimal asynchronous implementation. Conservative
|
|
// implementations which synchronize the hipMemcpyAsync will fail, ie if
|
|
// HIP_LAUNCH_BLOCKING=true
|
|
HIPASSERT(1 << 30 != A[NUM_STREAMS - 1][0] - 1);
|
|
HIPCHECK(hipDeviceSynchronize());
|
|
HIPASSERT(1 << 30 == A[NUM_STREAMS - 1][0] - 1);
|
|
passed();
|
|
}
|