/* * Copyright (c) Advanced Micro Devices, Inc., or its affiliates. * * SPDX-License-Identifier: MIT */ #include #include #include #include #include #include "graph_memset_node_test_common.hh" #include "graph_tests_common.hh" #define SIZE 1024 static char memSetVal = 'a'; /** * @addtogroup hipGraphAddMemsetNode hipGraphAddMemsetNode * @{ * @ingroup GraphTest * `hipGraphAddMemsetNode(hipGraphNode_t *pGraphNode, hipGraph_t graph, const hipGraphNode_t * *pDependencies, size_t numDependencies, const hipMemsetParams *pMemsetParams)` - * Creates a memset node and adds it to a graph */ /** * Test Description * ------------------------ * - Verify that all elements of destination memory are set to the correct value. * The test is repeated for all valid element sizes(1, 2, 4), and several allocations of different * height and width, both on host and device. * Test source * ------------------------ * - unit/graph/hipGraphAddMemsetNode.cc * Test requirements * ------------------------ * - HIP_VERSION >= 5.2 */ HIP_TEMPLATE_TEST_CASE(Unit_hipGraphAddMemsetNode_Positive_Basic, uint8_t, uint16_t, uint32_t) { const auto f = [](hipMemsetParams* params) { hipGraph_t graph = nullptr; HIP_CHECK(hipGraphCreate(&graph, 0)); hipGraphNode_t node = nullptr; HIP_CHECK(hipGraphAddMemsetNode(&node, graph, nullptr, 0, params)); hipGraphExec_t graph_exec = nullptr; HIP_CHECK(hipGraphInstantiate(&graph_exec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graph_exec, hipStreamPerThread)); HIP_CHECK(hipStreamSynchronize(hipStreamPerThread)); HIP_CHECK(hipGraphExecDestroy(graph_exec)); HIP_CHECK(hipGraphDestroy(graph)); return hipSuccess; }; GraphMemsetNodeCommonPositive(f); } /** * Test Description * ------------------------ * - Verify API behaviour with invalid arguments: * -# pGraphNode is nullptr * -# graph is nullptr * -# pDependencies is nullptr when numDependencies is not zero * -# A node in pDependencies originates from a different graph * -# numDependencies is invalid * -# A node is duplicated in pDependencies * -# pMemsetParams is nullptr * -# pMemsetParams::dst is nullptr * -# pMemsetParams::elementSize is different from 1, 2, and 4 * -# pMemsetParams::width is zero * -# pMemsetParams::width is larger than the allocated memory region * -# pMemsetParams::height is zero * -# pMemsetParams::pitch is less than width when height is more than 1 * -# pMemsetParams::pitch * pMemsetParams::height is larger than the allocated memory region * Test source * ------------------------ * - unit/graph/hipGraphAddMemsetNode.cc * Test requirements * ------------------------ * - HIP_VERSION >= 5.2 */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_Negative_Parameters) { using namespace std::placeholders; hipGraph_t graph = nullptr; HIP_CHECK(hipGraphCreate(&graph, 0)); LinearAllocGuard alloc(LinearAllocs::hipMalloc, 4 * sizeof(int)); hipMemsetParams params = {}; params.dst = alloc.ptr(); params.elementSize = sizeof(*alloc.ptr()); params.width = 1; params.height = 1; params.value = 42; GraphAddNodeCommonNegativeTests(std::bind(hipGraphAddMemsetNode, _1, _2, _3, _4, ¶ms), graph); hipGraphNode_t node = nullptr; MemsetCommonNegative(std::bind(hipGraphAddMemsetNode, &node, graph, nullptr, 0, _1), params); HIP_CHECK(hipGraphDestroy(graph)); } /* * Allocate a 2D array using hipMallocPitch. Initialize the allocated memory * using hipGraphAddMemsetNode. Copy the values in device memory to host using * hipGraphAddMemcpyNode. Verify the results. */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMallocPitch_2D) { size_t width = SIZE * sizeof(char), numW{SIZE}, numH{SIZE}, pitch_A; char* A_d; hipGraph_t graph; std::vector nodeDependencies; // Host memory. char* A_h = new char[numW * numH]; for (size_t i = 0; i < numW; i++) { for (size_t j = 0; j < numH; j++) { *(A_h + i * numH + j) = ' '; } } // 2D Memory allocation hipMallocPitch HIP_CHECK(hipMallocPitch(reinterpret_cast(&A_d), &pitch_A, width, numH)); // Create Graph HIP_CHECK(hipGraphCreate(&graph, 0)); hipGraphNode_t memsetNode, memcpyNode; // Add MemSet Node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = reinterpret_cast(A_d); memsetParams.value = memSetVal; memsetParams.pitch = pitch_A; memsetParams.elementSize = sizeof(char); memsetParams.width = numW; memsetParams.height = numH; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // Add MemCpy Node hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = make_hipPitchedPtr(A_d, pitch_A, numW, numH); myparms.dstPtr = make_hipPitchedPtr(A_h, width, numW, numH); myparms.extent = make_hipExtent(width, numH, 1); myparms.kind = hipMemcpyDeviceToHost; HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < numW; i++) { for (size_t j = 0; j < numH; j++) { REQUIRE(*(A_h + i * numH + j) == memSetVal); } } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)); delete[] A_h; HIP_CHECK(hipFree(A_d)); } /* * Allocate a 1D array using hipMallocPitch. Initialize the allocated memory using * hipGraphAddMemsetNode. Copy the values in device memory to host using * hipGraphAddMemcpyNode. Verify the results. */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMallocPitch_1D) { size_t width = SIZE * sizeof(char), numW{SIZE}, pitch_A; char* A_d; // Initialize the host memory std::vector A_h(numW, ' '); hipGraph_t graph; std::vector nodeDependencies; // 1D Memory allocation hipMallocPitch HIP_CHECK(hipMallocPitch(reinterpret_cast(&A_d), &pitch_A, width, 1)); // Create Graph HIP_CHECK(hipGraphCreate(&graph, 0)); hipGraphNode_t memsetNode, memcpyNode; // Add MemSet Node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = reinterpret_cast(A_d); memsetParams.value = memSetVal; memsetParams.pitch = pitch_A; memsetParams.elementSize = sizeof(char); memsetParams.width = numW; memsetParams.height = 1; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // Add MemCpy Node hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = make_hipPitchedPtr(A_d, pitch_A, numW, 1); myparms.dstPtr = make_hipPitchedPtr(A_h.data(), width, numW, 1); myparms.extent = make_hipExtent(width, 1, 1); myparms.kind = hipMemcpyDeviceToHost; HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < numW; i++) { REQUIRE(A_h[i] == memSetVal); } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)); HIP_CHECK(hipFree(A_d)); } /* * Allocate a 2D array using hipMalloc3D. Initialize the allocated memory using * hipGraphAddMemsetNode. Copy the values in device memory to host using * hipGraphAddMemcpyNode. Verify the results. */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMalloc3D_2D) { size_t width = SIZE * sizeof(char); size_t numW = SIZE, numH = SIZE; // Host Memory char* A_h = new char[numW * numH]; for (size_t i = 0; i < numW; i++) { for (size_t j = 0; j < numH; j++) { *(A_h + i * numH + j) = ' '; } } hipGraph_t graph; std::vector nodeDependencies; hipPitchedPtr A_d; hipExtent extent3D = make_hipExtent(width, numH, 1); // Allocate 3D memory. HIPCHECK(hipMalloc3D(&A_d, extent3D)); // Create Graph HIP_CHECK(hipGraphCreate(&graph, 0)); hipGraphNode_t memsetNode, memcpyNode; // Add MemSet Node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = A_d.ptr; memsetParams.value = memSetVal; memsetParams.pitch = A_d.pitch; memsetParams.elementSize = sizeof(char); memsetParams.width = numW; memsetParams.height = numH; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // MemCpy params hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = A_d; myparms.dstPtr = make_hipPitchedPtr(A_h, width, numW, numH); myparms.extent = make_hipExtent(width, numH, 1); myparms.kind = hipMemcpyDeviceToHost; // Add MemCpy Node HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < numW; i++) { for (size_t j = 0; j < numH; j++) { REQUIRE(*(A_h + i * numH + j) == memSetVal); } } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)); delete[] A_h; HIP_CHECK(hipFree(A_d.ptr)); } /* * Allocate a 1D array using hipMalloc3D. Initialize the allocated * memory using hipGraphAddMemsetNode. Copy the values in device * memory to host using hipGraphAddMemcpyNode. Verify the results. */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMalloc3D_1D) { size_t width = SIZE * sizeof(char); size_t numW = SIZE; // Initialize the host memory std::vector A_h(numW, ' '); hipGraph_t graph; std::vector nodeDependencies; hipPitchedPtr A_d; hipExtent extent1D = make_hipExtent(width, 1, 1); // Allocate 3D memory. HIPCHECK(hipMalloc3D(&A_d, extent1D)); // Create Graph HIP_CHECK(hipGraphCreate(&graph, 0)); hipGraphNode_t memsetNode, memcpyNode; // Add MemSet Node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = A_d.ptr; memsetParams.value = memSetVal; memsetParams.pitch = A_d.pitch; memsetParams.elementSize = sizeof(char); memsetParams.width = numW; memsetParams.height = 1; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // MemCpy params hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = A_d; myparms.dstPtr = make_hipPitchedPtr(A_h.data(), width, numW, 1); myparms.extent = make_hipExtent(width, 1, 1); myparms.kind = hipMemcpyDeviceToHost; // Add MemCpy Node HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < numW; i++) { REQUIRE(A_h[i] == memSetVal); } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)) HIP_CHECK(hipFree(A_d.ptr)); } /* * Allocate a 1D array using hipMalloc. Initialize the allocated memory using * hipGraphAddMemsetNode. Copy the values in device memory to host using * hipGraphAddMemcpyNode. Verify the results. */ HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMalloc_1D) { char* A_d; size_t NumW = SIZE; size_t Nbytes1D = SIZE * sizeof(char); // Initialize the host memory std::vector A_h(NumW, ' '); // Allocate memory to Device pointer HIP_CHECK(hipMalloc(reinterpret_cast(&A_d), Nbytes1D)); // Create the graph hipGraph_t graph; std::vector nodeDependencies; hipGraphNode_t memsetNode, memcpyNode; HIP_CHECK(hipGraphCreate(&graph, 0)); // Add Memset node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = reinterpret_cast(A_d); memsetParams.value = memSetVal; memsetParams.pitch = Nbytes1D; memsetParams.elementSize = sizeof(char); memsetParams.width = NumW; memsetParams.height = 1; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // Add MemCpy Node hipPitchedPtr devPitchedPtr{A_d, Nbytes1D, NumW, 0}; hipPitchedPtr hostPitchedPtr{A_h.data(), Nbytes1D, NumW, 0}; hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = devPitchedPtr; myparms.dstPtr = hostPitchedPtr; myparms.extent = make_hipExtent(Nbytes1D, 1, 1); myparms.kind = hipMemcpyDeviceToHost; HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < NumW; i++) { REQUIRE(A_h[i] == memSetVal); } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)); HIP_CHECK(hipFree(A_d)); } HIP_TEST_CASE(Unit_hipGraphAddMemsetNode_hipMallocManaged) { if (!HipTest::isManagedMemorySupportedOnDevice(0)) { WARN( "GPU 0 doesn't support hipDeviceAttributeManagedMemory attribute" "so defaulting to system memory."); } size_t Nbytes1D = SIZE * sizeof(char); char* A_d; // Initialize the host memory std::vector A_h(SIZE, ' '); // Device Memory HIP_CHECK(hipMallocManaged(&A_d, SIZE * sizeof(char))); // Create the graph hipGraph_t graph; std::vector nodeDependencies; hipGraphNode_t memsetNode, memcpyNode; HIP_CHECK(hipGraphCreate(&graph, 0)); // Add Memset node hipMemsetParams memsetParams{}; memset(&memsetParams, 0, sizeof(memsetParams)); memsetParams.dst = reinterpret_cast(A_d); memsetParams.value = memSetVal; memsetParams.pitch = Nbytes1D; memsetParams.elementSize = sizeof(char); memsetParams.width = SIZE; memsetParams.height = 1; HIP_CHECK(hipGraphAddMemsetNode(&memsetNode, graph, nullptr, 0, &memsetParams)); nodeDependencies.push_back(memsetNode); // Add MemCpy Node hipPitchedPtr devPitchedPtr{A_d, Nbytes1D, SIZE, 1}; hipPitchedPtr hostPitchedPtr{A_h.data(), Nbytes1D, SIZE, 1}; hipMemcpy3DParms myparms{}; myparms.srcPos = make_hipPos(0, 0, 0); myparms.dstPos = make_hipPos(0, 0, 0); myparms.srcPtr = devPitchedPtr; myparms.dstPtr = hostPitchedPtr; myparms.extent = make_hipExtent(Nbytes1D, 1, 1); myparms.kind = hipMemcpyDeviceToHost; HIP_CHECK(hipGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &myparms)); nodeDependencies.clear(); // Create executable graph hipStream_t streamForGraph; hipGraphExec_t graphExec; HIP_CHECK(hipStreamCreate(&streamForGraph)); HIP_CHECK(hipGraphInstantiate(&graphExec, graph, nullptr, nullptr, 0)); HIP_CHECK(hipGraphLaunch(graphExec, streamForGraph)); HIP_CHECK(hipStreamSynchronize(streamForGraph)); // Verfication for (size_t i = 0; i < SIZE; i++) { REQUIRE(A_h[i] == memSetVal); } HIP_CHECK(hipGraphExecDestroy(graphExec)); HIP_CHECK(hipGraphDestroy(graph)); HIP_CHECK(hipStreamDestroy(streamForGraph)); HIP_CHECK(hipFree(A_d)); } /** * End doxygen group GraphTest. * @} */