blob: 7c3c1bb5f04a8f968335428b84a3c545b5b871e2 (
plain)
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
39
40
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
|
//
// Copyright 2014 Ettus Research LLC
// Copyright 2018 Ettus Research, a National Instruments Company
//
// SPDX-License-Identifier: GPL-3.0-or-later
//
#ifndef INCLUDED_LIBUHD_RFNOC_UTILS_HPP
#define INCLUDED_LIBUHD_RFNOC_UTILS_HPP
#include <uhd/rfnoc/node_ctrl_base.hpp>
#include <boost/lexical_cast.hpp>
#include <set>
namespace uhd { namespace rfnoc { namespace utils {
/*! If \p suggested_port equals ANY_PORT, return the first available
* port number on \p nodes. Otherwise, return \p suggested_port.
*
* If \p allowed_ports is given, another condition is that the port
* number must be listed in here.
* If \p allowed_ports is not specified or empty, the assumption is
* that all ports are valid.
*
* On failure, ANY_PORT is returned.
*/
static size_t node_map_find_first_free(
node_ctrl_base::node_map_t nodes,
const size_t suggested_port,
const std::set<size_t> allowed_ports=std::set<size_t>()
) {
size_t port = suggested_port;
if (port == ANY_PORT) {
if (allowed_ports.empty()) {
port = 0;
while (nodes.count(port) and (port != ANY_PORT)) {
port++;
}
} else {
for(const size_t allowed_port: allowed_ports) {
if (not nodes.count(port)) {
return allowed_port;
}
return ANY_PORT;
}
}
} else {
if (not (allowed_ports.empty() or allowed_ports.count(port))) {
return ANY_PORT;
}
}
return port;
}
template <typename T>
static std::set<T> str_list_to_set(const std::vector<std::string> &list) {
std::set<T> return_set;
for(const std::string &S: list) {
return_set.insert(boost::lexical_cast<T>(S));
}
return return_set;
}
}}}; /* namespace uhd::rfnoc::utils */
#endif /* INCLUDED_LIBUHD_RFNOC_UTILS_HPP */
|
