Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[HEXAGON] Split huge 1D DMA Transfers into smaller transfers with leg… #10971

Merged
merged 1 commit into from
Apr 12, 2022
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 30 additions & 1 deletion src/runtime/hexagon/hexagon/hexagon_user_dma.cc
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,7 @@ int init_hexagon_user_dma() {
return DMA_SUCCESS;
}

int hexagon_user_dma_1d_sync(void* dst, void* src, uint32_t length) {
int hexagon_user_dma_1d_sync_helper(void* dst, void* src, uint32_t length) {
#if defined(__hexagon__) && __HEXAGON_ARCH__ >= 68
static int config_dma = init_hexagon_user_dma();
if (config_dma != DMA_SUCCESS) {
Expand Down Expand Up @@ -114,6 +114,35 @@ int hexagon_user_dma_1d_sync(void* dst, void* src, uint32_t length) {
#endif
}

int hexagon_user_dma_1d_sync(void* dst, void* src, uint32_t length) {
// One DMA transfer can copy atmost DESC_LENGTH_MASK bytes.
// Make the common case quick.
if (length <= DESC_LENGTH_MASK) return hexagon_user_dma_1d_sync_helper(dst, src, length);

// Split big transfers into smaller transfers.
char* cast_src = static_cast<char*>(src);
char* cast_dst = static_cast<char*>(dst);
for (uint32_t i = 0; i < length;) {
// Ensure there is no overflow while updating i
uint32_t cur_len = std::min<uint32_t>(length - i, DESC_LENGTH_MASK);
int ret_val = hexagon_user_dma_1d_sync_helper(&cast_dst[i], &cast_src[i], cur_len);
if (ret_val != DMA_SUCCESS) return ret_val;
// 2 cases for new val for i:
// 1. length - i <= DESC_LENGTH_MASK (<= MAX_UINT)
// new_i = i + (length - i) = length, no more iter
// and no overflow (since (length - i) <= (MAX_UINT - i))
// 2. length - i > DESC_LENGTH_MASK
// length > (i + DESC_LENGTH_MASK)
// new_i = (i + DESC_LENGTH_MASK)
// length > new_i for next iter, we're done
// length - i > DESC_LENGTH_MASK
// and length <= MAX_UINT,
// so MAX_UINT >= length > DESC_LEN_MASK + i
// MAX_UINT > (DESC_LEN_MASK + i), so no overflow
i += cur_len;
}
return DMA_SUCCESS;
}
} // namespace hexagon
} // namespace runtime
} // namespace tvm