py_loader.cpp 2.47 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2015-2022 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
 * 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 <migraphx/py.hpp>
#include <migraphx/dynamic_loader.hpp>
#include <migraphx/process.hpp>
#include <migraphx/ranges.hpp>

namespace migraphx {
inline namespace MIGRAPHX_INLINE_NS {

static std::vector<fs::path> find_available_python_versions()
{
    std::vector<fs::path> result;
    auto path = dynamic_loader::path(&load_py).parent_path();
    for(const auto& entry : fs::directory_iterator{path})
    {
        auto p = entry.path();
39
40
        if(not fs::is_regular_file(p))
            continue;
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
        if(not contains(p.stem().string(), "migraphx_py_"))
            continue;
        result.push_back(p);
    }
    std::sort(result.begin(), result.end(), std::greater<>{});
    return result;
}

static dynamic_loader load_py_lib()
{
    auto libs = find_available_python_versions();
    for(const auto& lib : libs)
    {
        auto result = dynamic_loader::try_load(lib);
        if(result.has_value())
            return *result;
    }
    MIGRAPHX_THROW("Cant find a viable version of python");
}

static dynamic_loader py_lib()
{
    static dynamic_loader lib = load_py_lib();
    return lib;
}

program load_py(const std::string& filename)
{
    static auto f = py_lib().get_function<program(const std::string&)>("migraphx_load_py");
    return f(filename);
}

} // namespace MIGRAPHX_INLINE_NS
} // namespace migraphx