/* Copyright (c) 2021 - 2021 Advanced Micro Devices, Inc. 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 WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ #include "hip_graph_internal.hpp" #include #define CASE_STRING(X, C) \ case X: \ case_string = #C; \ break; namespace { const char* GetGraphNodeTypeString(uint32_t op) { const char* case_string; switch (static_cast(op)) { CASE_STRING(hipGraphNodeTypeKernel, KernelNode) CASE_STRING(hipGraphNodeTypeMemcpy, MemcpyNode) CASE_STRING(hipGraphNodeTypeMemset, MemsetNode) CASE_STRING(hipGraphNodeTypeHost, HostNode) CASE_STRING(hipGraphNodeTypeGraph, GraphNode) CASE_STRING(hipGraphNodeTypeEmpty, EmptyNode) CASE_STRING(hipGraphNodeTypeWaitEvent, WaitEventNode) CASE_STRING(hipGraphNodeTypeEventRecord, EventRecordNode) CASE_STRING(hipGraphNodeTypeExtSemaphoreSignal, ExtSemaphoreSignalNode) CASE_STRING(hipGraphNodeTypeExtSemaphoreWait, ExtSemaphoreWaitNode) CASE_STRING(hipGraphNodeTypeMemAlloc, MemAllocNode) CASE_STRING(hipGraphNodeTypeMemFree, MemFreeNode) CASE_STRING(hipGraphNodeTypeMemcpyFromSymbol, MemcpyFromSymbolNode) CASE_STRING(hipGraphNodeTypeMemcpyToSymbol, MemcpyToSymbolNode) default: case_string = "Unknown node type"; }; return case_string; }; } namespace hip { int GraphNode::nextID = 0; int Graph::nextID = 0; std::unordered_set GraphNode::nodeSet_; // Guards global node set amd::Monitor GraphNode::nodeSetLock_{}; std::unordered_set Graph::graphSet_; // Guards global graph set amd::Monitor Graph::graphSetLock_{}; std::unordered_set GraphExec::graphExecSet_; // Guards global exec graph set // we have graphExec object as part of child graph and we need recursive lock amd::Monitor GraphExec::graphExecSetLock_(true); std::unordered_set UserObject::ObjectSet_; // Guards global user object amd::Monitor UserObject::UserObjectLock_{}; // Guards mem map add/remove against work thread amd::Monitor GraphNode::WorkerThreadLock_{}; hipError_t GraphMemcpyNode1D::ValidateParams(void* dst, const void* src, size_t count, hipMemcpyKind kind) { hipError_t status = ihipMemcpy_validate(dst, src, count, kind); if (status != hipSuccess) { return status; } size_t sOffset = 0; amd::Memory* srcMemory = getMemoryObject(src, sOffset); size_t dOffset = 0; amd::Memory* dstMemory = getMemoryObject(dst, dOffset); if ((srcMemory == nullptr) && (dstMemory != nullptr)) { // host to device if ((kind != hipMemcpyHostToDevice) && (kind != hipMemcpyDefault)) { return hipErrorInvalidValue; } } else if ((srcMemory != nullptr) && (dstMemory == nullptr)) { // device to host if ((kind != hipMemcpyDeviceToHost) && (kind != hipMemcpyDefault)) { return hipErrorInvalidValue; } } return hipSuccess; } // ================================================================================================ hipError_t GraphMemcpyNode::ValidateParams(const hipMemcpy3DParms* pNodeParams) { hipError_t status; status = ihipMemcpy3D_validate(pNodeParams); if (status != hipSuccess) { return status; } const HIP_MEMCPY3D pCopy = hip::getDrvMemcpy3DDesc(*pNodeParams); status = ihipDrvMemcpy3D_validate(&pCopy); if (status != hipSuccess) { return status; } return hipSuccess; } // ================================================================================================ bool Graph::isGraphValid(Graph* pGraph) { amd::ScopedLock lock(graphSetLock_); if (graphSet_.find(pGraph) == graphSet_.end()) { return false; } return true; } // ================================================================================================ void Graph::AddNode(const Node& node) { vertices_.emplace_back(node); ClPrint(amd::LOG_INFO, amd::LOG_CODE, "[hipGraph] Add %s(%p)", GetGraphNodeTypeString(node->GetType()), node); node->SetParentGraph(this); } // ================================================================================================ void Graph::RemoveNode(const Node& node) { vertices_.erase(std::remove(vertices_.begin(), vertices_.end(), node), vertices_.end()); delete node; } // ================================================================================================ // root nodes are all vertices with 0 in-degrees std::vector Graph::GetRootNodes() const { std::vector roots; for (auto entry : vertices_) { if (entry->GetInDegree() == 0) { roots.push_back(entry); ClPrint(amd::LOG_INFO, amd::LOG_CODE, "[hipGraph] Root node: %s(%p)", GetGraphNodeTypeString(entry->GetType()), entry); } } return roots; } // ================================================================================================ // leaf nodes are all vertices with 0 out-degrees std::vector Graph::GetLeafNodes() const { std::vector leafNodes; for (auto entry : vertices_) { if (entry->GetOutDegree() == 0) { leafNodes.push_back(entry); } } return leafNodes; } // ================================================================================================ size_t Graph::GetLeafNodeCount() const { int numLeafNodes = 0; for (auto entry : vertices_) { if (entry->GetOutDegree() == 0) { numLeafNodes++; } } return numLeafNodes; } std::vector> Graph::GetEdges() const { std::vector> edges; for (const auto& i : vertices_) { for (const auto& j : i->GetEdges()) { edges.push_back(std::make_pair(i, j)); } } return edges; } // ================================================================================================ void Graph::ScheduleOneNode(Node node, int stream_id) { if (node->stream_id_ == -1) { // Assign active stream to the current node node->stream_id_ = stream_id; max_streams_ = std::max(max_streams_, (stream_id + 1)); // Process child graph separately, since, there is no connection if (node->GetType() == hipGraphNodeTypeGraph) { auto child = reinterpret_cast(node)->GetChildGraph(); child->ScheduleNodes(); max_streams_ = std::max(max_streams_, child->max_streams_); if (child->max_streams_ == 1) { reinterpret_cast(node)->TopologicalOrder(); } } for (auto edge: node->GetEdges()) { ScheduleOneNode(edge, stream_id); // 1. Each extra edge will get a new stream from the pool // 2. Streams will be reused if the number of edges > streams stream_id = (stream_id + 1) % DEBUG_HIP_FORCE_GRAPH_QUEUES; } } } // ================================================================================================ void Graph::ScheduleNodes() { for (auto node : vertices_) { node->stream_id_ = -1; node->signal_is_required_ = false; } memset(&roots_[0], 0, sizeof(Node) * roots_.size()); max_streams_ = 0; // Start processing all nodes in the graph to find async executions. int stream_id = 0; for (auto node : vertices_) { if (node->stream_id_ == -1) { ScheduleOneNode(node, stream_id); // Find the root nodes if ((node->GetDependencies().size() == 0) && (node->stream_id_ != 0)) { // Fill in only the first in the sequence if (roots_[node->stream_id_] == nullptr) { roots_[node->stream_id_] = node; } } // 1. Each extra root will get a new stream from the pool // 2. Streams will be recycled if the number of roots > streams stream_id = (stream_id + 1) % DEBUG_HIP_FORCE_GRAPH_QUEUES; } } } // ================================================================================================ bool Graph::TopologicalOrder(std::vector& TopoOrder) { std::queue q; std::unordered_map inDegree; for (auto entry : vertices_) { // Update the dependencies if a signal is required for (auto dep: entry->GetDependencies()) { // Check if the stream ID doesn't match and enable signal if (dep->stream_id_ != entry->stream_id_) { dep->signal_is_required_ = true; } } if (entry->GetInDegree() == 0) { q.push(entry); } inDegree[entry] = entry->GetInDegree(); } while (!q.empty()) { Node node = q.front(); TopoOrder.push_back(node); q.pop(); for (auto edge : node->GetEdges()) { inDegree[edge]--; if (inDegree[edge] == 0) { q.push(edge); } } } if (GetNodeCount() == TopoOrder.size()) { return true; } return false; } // ================================================================================================ Graph* Graph::clone(std::unordered_map& clonedNodes) const { Graph* newGraph = new Graph(device_, this); for (auto entry : vertices_) { GraphNode* node = entry->clone(); node->SetParentGraph(newGraph); newGraph->vertices_.push_back(node); clonedNodes[entry] = node; } std::vector clonedEdges; std::vector clonedDependencies; for (auto node : vertices_) { const std::vector& edges = node->GetEdges(); clonedEdges.clear(); for (auto edge : edges) { clonedEdges.push_back(clonedNodes[edge]); } clonedNodes[node]->SetEdges(clonedEdges); } for (auto node : vertices_) { const std::vector& dependencies = node->GetDependencies(); clonedDependencies.clear(); for (auto dep : dependencies) { clonedDependencies.push_back(clonedNodes[dep]); } clonedNodes[node]->SetDependencies(clonedDependencies); } for (auto& userObj : graphUserObj_) { userObj.first->retain(); newGraph->graphUserObj_.insert(userObj); // Clone graph should have its separate graph owned ref count = 1 newGraph->graphUserObj_[userObj.first] = 1; userObj.first->owning_graphs_.insert(newGraph); } // Clone the root nodes to the new graph if (roots_.size() > 0) { memcpy(&newGraph->roots_[0], &roots_[0], sizeof(Node) * roots_.size()); } return newGraph; } // ================================================================================================ Graph* Graph::clone() const { std::unordered_map clonedNodes; return clone(clonedNodes); } // ================================================================================================ bool GraphExec::isGraphExecValid(GraphExec* pGraphExec) { amd::ScopedLock lock(graphExecSetLock_); if (graphExecSet_.find(pGraphExec) == graphExecSet_.end()) { return false; } return true; } // ================================================================================================ hipError_t GraphExec::CreateStreams(uint32_t num_streams) { parallel_streams_.reserve(num_streams); for (uint32_t i = 0; i < num_streams; ++i) { auto stream = new hip::Stream(hip::getCurrentDevice(), hip::Stream::Priority::Normal, hipStreamNonBlocking); if (stream == nullptr || !stream->Create()) { if (stream != nullptr) { hip::Stream::Destroy(stream); } ClPrint(amd::LOG_ERROR, amd::LOG_CODE, "[hipGraph] Failed to create parallel stream!"); return hipErrorOutOfMemory; } parallel_streams_.push_back(stream); } // Don't wait for other streams to finish. // Capture stream is to capture AQL packet. capture_stream_ = hip::getNullStream(false); return hipSuccess; } // ================================================================================================ hipError_t GraphExec::Init() { hipError_t status = hipSuccess; // create extra stream to avoid queue collision with the default execution stream status = CreateStreams(clonedGraph_->max_streams_); if (status != hipSuccess) { return status; } if (DEBUG_CLR_GRAPH_PACKET_CAPTURE) { // For graph nodes capture AQL packets to dispatch them directly during graph launch. status = CaptureAQLPackets(); } instantiateDeviceId_ = hip::getCurrentDevice()->deviceId(); return status; } //! Chunk size to add to kern arg pool constexpr uint32_t kKernArgChunkSize = 128 * Ki; // ================================================================================================ void GraphExec::GetKernelArgSizeForGraph(size_t& kernArgSizeForGraph) { // GPU packet capture is enabled for kernel nodes. Calculate the kernel // arg size required for all graph kernel nodes to allocate for (hip::GraphNode* node : topoOrder_) { if (node->GraphCaptureEnabled()) { kernArgSizeForGraph += node->GetKerArgSize(); } else if (node->GetType() == hipGraphNodeTypeGraph) { auto childNode = reinterpret_cast(node); // Child graph shares same kernel arg manager GraphKernelArgManager* KernelArgManager = GetKernelArgManager(); KernelArgManager->retain(); childNode->graphExec_.SetKernelArgManager(KernelArgManager); // Set capture stream for child graph childNode->graphExec_.capture_stream_ = capture_stream_; if (childNode->GetChildGraph()->max_streams_ == 1) { childNode->graphExec_.GetKernelArgSizeForGraph(kernArgSizeForGraph); } } } } // ================================================================================================ hipError_t GraphExec::AllocKernelArgForGraphNode() { hipError_t status = hipSuccess; for (auto& node : topoOrder_) { if (node->GetType() == hipGraphNodeTypeKernel) { // Check if graph requires hidden heap and set as part of graphExec param. static bool initialized = false; if (!initialized && reinterpret_cast(node)->HasHiddenHeap()) { SetHiddenHeap(); initialized = true; } } if (node->GraphCaptureEnabled()) { node->CaptureAndFormPacket(capture_stream_, GetKernelArgManager()); } else if (node->GetType() == hipGraphNodeTypeGraph) { auto childNode = reinterpret_cast(node); if (childNode->GetChildGraph()->max_streams_ == 1) { childNode->SetGraphCaptureStatus(true); status = childNode->graphExec_.AllocKernelArgForGraphNode(); if (status != hipSuccess) { return status; } } } } return status; } // ================================================================================================ hipError_t GraphExec::CaptureAQLPackets() { hipError_t status = hipSuccess; if (clonedGraph_->max_streams_ == 1) { size_t kernArgSizeForGraph = 0; GetKernelArgSizeForGraph(kernArgSizeForGraph); auto device = g_devices[ihipGetDevice()]->devices()[0]; // Add a larger initial pool to accomodate for any updates to kernel args bool bStatus = kernArgManager_->AllocGraphKernargPool(kernArgSizeForGraph + kKernArgChunkSize); if (bStatus != true) { return hipErrorMemoryAllocation; } status = AllocKernelArgForGraphNode(); if (status != hipSuccess) { return status; } kernArgManager_->ReadBackOrFlush(); } return status; } // ================================================================================================ hipError_t GraphExec::UpdateAQLPacket(hip::GraphNode* node) { hipError_t status = hipSuccess; if (clonedGraph_->max_streams_ == 1) { node->CaptureAndFormPacket(capture_stream_, kernArgManager_); } return hipSuccess; } // ================================================================================================ void GraphExec::DecrementRefCount(cl_event event, cl_int command_exec_status, void* user_data) { GraphExec* graphExec = reinterpret_cast(user_data); graphExec->release(); } // ================================================================================================ hipError_t GraphExec::EnqueueGraphWithSingleList(hip::Stream* hip_stream) { // Accumulate command tracks all the AQL packet batch that we submit to the HW. For now // we track only kernel nodes. amd::AccumulateCommand* accumulate = nullptr; hipError_t status = hipSuccess; if (DEBUG_CLR_GRAPH_PACKET_CAPTURE) { accumulate = new amd::AccumulateCommand(*hip_stream, {}, nullptr); } for (int i = 0; i < topoOrder_.size(); i++) { if (topoOrder_[i]->GraphCaptureEnabled()) { if (topoOrder_[i]->GetEnabled()) { std::vector& gpuPackets = topoOrder_[i]->GetAqlPackets(); for (auto& packet : gpuPackets) { hip_stream->vdev()->dispatchAqlPacket(packet, topoOrder_[i]->GetKernelName(), accumulate); } } } else { topoOrder_[i]->SetStream(hip_stream); status = topoOrder_[i]->CreateCommand(topoOrder_[i]->GetQueue()); topoOrder_[i]->EnqueueCommands(hip_stream); } } if (DEBUG_CLR_GRAPH_PACKET_CAPTURE) { accumulate->enqueue(); accumulate->release(); } return status; } // ================================================================================================ void Graph::UpdateStreams(hip::Stream* launch_stream, const std::vector& parallel_streams) { // Allocate array for parallel streams, based on the graph scheduling + current stream // We create extra stream to avoid collision streams_.resize(parallel_streams.size()); // Current stream is the default in the assignment streams_[0] = launch_stream; // Assign the streams in the array of all streams // Avoid stream that has collision with launch stream for (uint32_t i = 1, j = 0; i < streams_.size(); j++) { assert(j != parallel_streams.size()); if (launch_stream->getQueueID() != parallel_streams[j]->getQueueID()) { streams_[i++] = parallel_streams[j]; } } } // ================================================================================================ bool Graph::RunOneNode(Node node, bool wait) { if (node->launch_id_ == -1) { // Clear the storage of the wait nodes memset(&wait_order_[0], 0, sizeof(Node) * wait_order_.size()); amd::Command::EventWaitList waitList; // Walk through dependencies and find the last launches on each parallel stream for (auto depNode : node->GetDependencies()) { // Process only the nodes that have been submitted if (depNode->launch_id_ != -1) { // If it's the same stream then skip the signal, since it's in order if (depNode->stream_id_ != node->stream_id_) { // If there is no wait node on the stream, then assign one if ((wait_order_[depNode->stream_id_] == nullptr) || // If another node executed on the same stream, then use the latest launch only, // since the same stream has in-order run (wait_order_[depNode->stream_id_]->launch_id_ < depNode->launch_id_)) { wait_order_[depNode->stream_id_] = depNode; } } } else { // It should be a safe return, // since the last edge to this dependency has to submit the command return true; } } // Create a wait list from the last launches of all dependencies for (auto dep : wait_order_) { if (dep != nullptr) { // Add all commands in the wait list if (dep->GetType() != hipGraphNodeTypeGraph) { for (auto command : dep->GetCommands()) { waitList.push_back(command); } } } } if (node->GetType() == hipGraphNodeTypeGraph) { // Process child graph separately, since, there is no connection auto child = reinterpret_cast(node)->GetChildGraph(); if (!reinterpret_cast(node)->graphCaptureStatus_) { child->RunNodes(node->stream_id_, &streams_, &waitList); } } else { // Assing a stream to the current node node->SetStream(streams_); // Create the execution commands on the assigned stream auto status = node->CreateCommand(node->GetQueue()); if (status != hipSuccess) { LogPrintfError("Command creation for node id(%d) failed!", current_id_ + 1); return false; } // Retain all commands, since potentially the command can finish before a wait signal for (auto command : node->GetCommands()) { command->retain(); } // If a wait was requested, then process the list if (wait && !waitList.empty()) { node->UpdateEventWaitLists(waitList); } // Start the execution node->EnqueueCommands(node->GetQueue()); } // Assign the launch ID of the submmitted node // This is also applied to childGraphs to prevent them from being reprocessed node->launch_id_ = current_id_++; uint32_t i = 0; // Execute the nodes in the edges list for (auto edge: node->GetEdges()) { // Don't wait in the nodes, executed on the same streams and if it has just one dependency bool wait = ((i < DEBUG_HIP_FORCE_GRAPH_QUEUES) || (edge->GetDependencies().size() > 1)) ? true : false; // Execute the edge node if (!RunOneNode(edge, wait)) { return false; } i++; } if (i == 0) { // Add a leaf node into the list for a wait. // Always use the last node, since it's the latest for the particular queue leafs_[node->stream_id_] = node; } } return true; } // ================================================================================================ bool Graph::RunNodes( int32_t base_stream, const std::vector* parallel_streams, const amd::Command::EventWaitList* parent_waitlist) { if (parallel_streams != nullptr) { streams_ = *parallel_streams; } // childgraph node has dependencies on parent graph nodes from other streams if (parent_waitlist != nullptr) { auto start_marker = new amd::Marker(*streams_[base_stream], true, *parent_waitlist); if (start_marker != nullptr) { start_marker->enqueue(); start_marker->release(); } } amd::Command::EventWaitList wait_list; current_id_ = 0; memset(&leafs_[0], 0, sizeof(Node) * leafs_.size()); // Add possible waits in parallel streams for the app's default launch stream constexpr bool kRetainCommand = true; auto last_command = streams_[base_stream]->getLastQueuedCommand(kRetainCommand); if (last_command != nullptr) { // Add the last command into the waiting list wait_list.push_back(last_command); // Check if the graph has multiple root nodes for (uint32_t i = 0; i < DEBUG_HIP_FORCE_GRAPH_QUEUES; ++i) { if ((base_stream != i) && (roots_[i] != nullptr)) { // Wait for the app's queue auto start_marker = new amd::Marker(*streams_[i], true, wait_list); if (start_marker != nullptr) { start_marker->enqueue(); start_marker->release(); } } } last_command->release(); } // Run all commands in the graph for (auto node : vertices_) { if (node->launch_id_ == -1) { if (!RunOneNode(node, true)) { return false; } } } wait_list.clear(); // Check if the graph has multiple leaf nodes for (uint32_t i = 0; i < DEBUG_HIP_FORCE_GRAPH_QUEUES; ++i) { if ((base_stream != i) && (leafs_[i] != nullptr)) { // Add all commands in the wait list if (leafs_[i]->GetType() != hipGraphNodeTypeGraph) { for (auto command : leafs_[i]->GetCommands()) { wait_list.push_back(command); } } } } // Wait for leafs in the graph's app stream if (wait_list.size() > 0) { auto end_marker = new amd::Marker(*streams_[base_stream], true, wait_list); if (end_marker != nullptr) { end_marker->enqueue(); end_marker->release(); } } // Release commands after execution for (auto& node : vertices_) { node->launch_id_ = -1; if (node->GetType() != hipGraphNodeTypeGraph) { for (auto command : node->GetCommands()) { command->release(); } } } return true; } // ================================================================================================ hipError_t GraphExec::Run(hipStream_t graph_launch_stream) { hipError_t status = hipSuccess; hip::Stream* launch_stream = hip::getStream(graph_launch_stream); if (flags_ & hipGraphInstantiateFlagAutoFreeOnLaunch) { if (!topoOrder_.empty()) { topoOrder_[0]->GetParentGraph()->FreeAllMemory(launch_stream); topoOrder_[0]->GetParentGraph()->memalloc_nodes_ = 0; } } // If this is a repeat launch, make sure corresponding MemFreeNode exists for a MemAlloc node if (repeatLaunch_ == true) { if (!topoOrder_.empty() && topoOrder_[0]->GetParentGraph()->GetMemAllocNodeCount() > 0) { return hipErrorInvalidValue; } } else { repeatLaunch_ = true; } if (clonedGraph_->max_streams_ == 1 && instantiateDeviceId_ == launch_stream->DeviceId()) { if (DEBUG_CLR_GRAPH_PACKET_CAPTURE) { // If the graph has kernels that does device side allocation, during packet capture, heap is // allocated because heap pointer has to be added to the AQL packet, and initialized during // graph launch. static bool initialized = false; if (!initialized && HasHiddenHeap()) { launch_stream->vdev()->HiddenHeapInit(); initialized = true; } } status = EnqueueGraphWithSingleList(launch_stream); } else if (clonedGraph_->max_streams_ == 1 && instantiateDeviceId_ != launch_stream->DeviceId()) { for (int i = 0; i < topoOrder_.size(); i++) { topoOrder_[i]->SetStream(launch_stream); status = topoOrder_[i]->CreateCommand(topoOrder_[i]->GetQueue()); topoOrder_[i]->EnqueueCommands(launch_stream); } } else { // Update streams for the graph execution clonedGraph_->UpdateStreams(launch_stream, parallel_streams_); // Execute all nodes in the graph if (!clonedGraph_->RunNodes()) { LogError("Failed to launch nodes!"); return hipErrorOutOfMemory; } } this->retain(); amd::Command* CallbackCommand = new amd::Marker(*launch_stream, kMarkerDisableFlush, {}); // we may not need to flush any caches. CallbackCommand->setEventScope(amd::Device::kCacheStateIgnore); amd::Event& event = CallbackCommand->event(); if (!event.setCallback(CL_COMPLETE, GraphExec::DecrementRefCount, this)) { return hipErrorInvalidHandle; } CallbackCommand->enqueue(); // Add the new barrier to stall the stream, until the callback is done amd::Command::EventWaitList eventWaitList; eventWaitList.push_back(CallbackCommand); amd::Command* block_command = new amd::Marker(*launch_stream, kMarkerDisableFlush, eventWaitList); // we may not need to flush any caches. block_command->setEventScope(amd::Device::kCacheStateIgnore); if (block_command == nullptr) { return hipErrorInvalidValue; } block_command->enqueue(); block_command->release(); CallbackCommand->release(); ResetQueueIndex(); return status; } // ================================================================================================ bool GraphKernelArgManager::AllocGraphKernargPool(size_t pool_size) { bool bStatus = true; assert(pool_size > 0); address graph_kernarg_base; auto device = g_devices[ihipGetDevice()]->devices()[0]; // Current device is stored as part of tls. Save current device to destroy kernelArgs from the // callback thread. device_ = device; if (device->info().largeBar_) { graph_kernarg_base = reinterpret_cast
(device->deviceLocalAlloc(pool_size)); device_kernarg_pool_ = true; } else { graph_kernarg_base = reinterpret_cast
( device->hostAlloc(pool_size, 0, amd::Device::MemorySegment::kKernArg)); } if (graph_kernarg_base == nullptr) { return false; } kernarg_graph_.push_back(KernelArgPoolGraph(graph_kernarg_base, pool_size)); return true; } address GraphKernelArgManager::AllocKernArg(size_t size, size_t alignment) { assert(alignment != 0); address result = nullptr; result = amd::alignUp( kernarg_graph_.back().kernarg_pool_addr_ + kernarg_graph_.back().kernarg_pool_offset_, alignment); const size_t pool_new_usage = (result + size) - kernarg_graph_.back().kernarg_pool_addr_; if (pool_new_usage <= kernarg_graph_.back().kernarg_pool_size_) { kernarg_graph_.back().kernarg_pool_offset_ = pool_new_usage; } else { // If current chunck is full allocate new chunck with same size as current bool bStatus = AllocGraphKernargPool(kernarg_graph_.back().kernarg_pool_size_); if (bStatus == false) { return nullptr; } else { // Allocte kernel arg memory from new chunck return AllocKernArg(size, alignment); } } return result; } void GraphKernelArgManager::ReadBackOrFlush() { if (device_kernarg_pool_ && device_) { auto kernArgImpl = device_->settings().kernel_arg_impl_; if (kernArgImpl == KernelArgImpl::DeviceKernelArgsHDP) { *device_->info().hdpMemFlushCntl = 1u; auto kSentinel = *reinterpret_cast(device_->info().hdpMemFlushCntl); } else if (kernArgImpl == KernelArgImpl::DeviceKernelArgsReadback && kernarg_graph_.back().kernarg_pool_addr_ != 0) { address dev_ptr = kernarg_graph_.back().kernarg_pool_addr_ + kernarg_graph_.back().kernarg_pool_size_; auto kSentinel = *reinterpret_cast(dev_ptr - 1); _mm_sfence(); *(dev_ptr - 1) = kSentinel; _mm_mfence(); kSentinel = *reinterpret_cast(dev_ptr - 1); } } } } // namespace hip