Skip to content

Fix seg fault #9

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.

Sign up for GitHub

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

Merged
jichangjichang merged 1 commit into from
Nov 29, 2022
Merged

Fix seg fault #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 2 additions & 2 deletions clients/include/testing_matmul.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -376,11 +376,11 @@ void testing_matmul(const Arguments& arg)
HIPBLAS_STATUS_SUCCESS);
}
// Get Heuristic results
hipblasLtMatmulHeuristicResult_t heuristicResult[1] = {0};
hipblasLtMatmulHeuristicResult_t heuristicResult[3] = {0};
int returnedAlgoCount = 0;
EXPECT_HIPBLAS_STATUS(
(hipblasLtMatmulAlgoGetHeuristic(
handle, matmul, matA, matB, matC, matD, pref, 1, heuristicResult, &returnedAlgoCount)),
handle, matmul, matA, matB, matC, matD, pref, 3, heuristicResult, &returnedAlgoCount)),
HIPBLAS_STATUS_SUCCESS);

if(arg.unit_check || arg.norm_check)
Expand Down
2 changes: 1 addition & 1 deletion library/src/amd_detail/rocblaslt/src/tensile_host.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -798,7 +798,7 @@ getBestSolutions(RocblasltContractionProblem<Ti, To, Tc> prob,

auto solutions =
library->findTopSolutions(tensile_prob, *hardware, requestedAlgoCount);
*returnAlgoCount = std::max((int)solutions.size(), requestedAlgoCount);
*returnAlgoCount = std::min((int)solutions.size(), requestedAlgoCount);
for (size_t i = 0; i < *returnAlgoCount; i++) {
auto solution = solutions[i];
heuristicResultsArray[i].algo.data.ptr =
Expand Down