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.

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

Jump to bottom

Resolve failures on SLES #2021

Draft
wants to merge 1 commit into
base: release/rocm-rel-6.3.0.1
Choose a base branch
from
+13 −8
Draft

Resolve failures on SLES #2021

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
17 changes: 11 additions & 6 deletions HostLibraryTests/DecisionTree_test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
*
* MIT License
*
* Copyright (C) 2022 Advanced Micro Devices, Inc. All rights reserved.
* Copyright (C) 2022-2024 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
Expand Down Expand Up @@ -369,7 +369,12 @@ TEST(DecisionTree, DecisionTreeBatch)
using SizeInRange = Predicates::Contraction::SizeInRange;
using Range = Predicates::Contraction::Range;
using And = Predicates::And<ContractionProblem>;
using BForest = BasicForest<Key,
// Create a Key4 aliase specific to this test because this test uses four features which
// requires a size four Key type; whereas previous tests only use three features.
using Key4 = std::array<float, 4>;
using DTree4
= Tree<Key4, std::shared_ptr<ContractionLibrary>, std::shared_ptr<ContractionSolution>>;
using BForest = BasicForest<Key4,
ContractionProblem,
std::shared_ptr<ContractionLibrary>,
std::shared_ptr<ContractionSolution>>;
Expand Down Expand Up @@ -410,9 +415,9 @@ TEST(DecisionTree, DecisionTreeBatch)
features.push_back(boundSize);

// Make trees library
std::vector<DTree> region1trees;
std::vector<DTree4> region1trees;

DTree region1tree0{{
DTree4 region1tree0{{
{0, 5000.f, IDX_RETURN_FALSE, IDX_RETURN_TRUE}, // YES for freeSizeA > 5000
}};
region1tree0.value = region1Library0;
Expand All @@ -426,9 +431,9 @@ TEST(DecisionTree, DecisionTreeBatch)
region1dtreelib->forest = region1forest;

// Make trees library
std::vector<DTree> region2trees;
std::vector<DTree4> region2trees;

DTree region2tree0{{
DTree4 region2tree0{{
{0, 5000.f, IDX_RETURN_TRUE, IDX_RETURN_FALSE}, // YES for freeSizeA <= 5000
}};
region2tree0.value = region2Library0;
Expand Down
4 changes: 2 additions & 2 deletions Tensile/Source/lib/source/llvm/Loading.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
*
* MIT License
*
* Copyright (C) 2019-2022 Advanced Micro Devices, Inc. All rights reserved.
* Copyright (C) 2019-2024 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
Expand Down Expand Up @@ -44,7 +44,7 @@ namespace Tensile

try
{
auto inputFile = llvm::MemoryBuffer::getFile(filename);
auto inputFile = llvm::MemoryBuffer::getFileAsStream(filename);

LibraryIOContext<MySolution> context{filename, preloaded, nullptr};
llvm::yaml::Input yin((*inputFile)->getMemBufferRef(), &context);
Expand Down