register_target.cpp 3.69 KB
Newer Older
1
2
3
/*
 * The MIT License (MIT)
 *
4
 * Copyright (c) 2015-2023 Advanced Micro Devices, Inc. All rights reserved.
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 *
 * 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.
 */
24
#include <mutex>
25
#include <string>
26
#include <unordered_map>
27
#include <migraphx/register_target.hpp>
28
29
#include <migraphx/ranges.hpp>
#include <migraphx/dynamic_loader.hpp>
30
31
32
33

namespace migraphx {
inline namespace MIGRAPHX_INLINE_NS {

34
35
36
void store_target_lib(const dynamic_loader& lib)
{
    static std::vector<dynamic_loader> target_loader;
37
    static std::mutex mutex;
38
39
    std::unique_lock<std::mutex> lock(mutex);

40
41
42
    target_loader.emplace_back(lib);
}

43
44
45
/**
 * Returns a singleton map of targets and names.
 */
46
47
std::unordered_map<std::string, target>& target_map()
{
48
    static std::unordered_map<std::string, target> m; // NOLINT
49
50
51
    return m;
}

52
53
54
55
56
57
58
59
60
/**
 * Returns a singleton mutex used by the various register_target methods.
 */
std::mutex& target_mutex()
{
    static std::mutex m; // NOLINT
    return m;
}

61
62
63
64
void register_target_init() { (void)target_map(); }

void unregister_target(const std::string& name)
{
65
    std::unique_lock<std::mutex> lock(target_mutex());
66
67
68
69
    assert(target_map().count(name));
    target_map().erase(name);
}

70
71
72
/**
 * Insert a target name in the target_map; thread safe.
 */
73
74
void register_target(const target& t)
{
75
    std::unique_lock<std::mutex> lock(target_mutex());
76
77
    target_map()[t.name()] = t;
}
78

79
80
81
82
/**
 * Search for a target by name in the target_map; thread-safe.
 */
migraphx::optional<target> find_target(const std::string& name)
83
{
84
85
86
    // search for match or return none
    std::unique_lock<std::mutex> lock(target_mutex());
    const auto it = target_map().find(name);
87

88
89
90
91
92
93
94
95
96
97
98
99
100
101
    if(it == target_map().end())
        return nullopt;
    return it->second;
}

/**
 * Get a target by name.  Load target library and register target if needed.
 * Thread safe.
 */
target make_target(const std::string& name)
{
    //   no lock required here
    auto t = find_target(name);
    if(t == nullopt)
102
103
    {
        std::string target_name = "libmigraphx_" + name + ".so";
104
        // register_target is called by this
105
        store_target_lib(dynamic_loader(target_name));
106
        t = find_target(name);
107
    }
108
109
110
    // at this point we should always have a target

    return *t;
111
112
}

113
114
115
/**
 * Get list of names of registered targets.
 */
116
117
std::vector<std::string> get_targets()
{
118
    std::unique_lock<std::mutex> lock(target_mutex());
119
120
121
122
123
124
125
126
127
128
129
    std::vector<std::string> result;
    std::transform(target_map().begin(),
                   target_map().end(),
                   std::back_inserter(result),
                   [&](auto&& p) { return p.first; });
    std::sort(result.begin(), result.end());
    return result;
}

} // namespace MIGRAPHX_INLINE_NS
} // namespace migraphx