|
| 1 | +#include "bpf_map.h" |
| 2 | + |
| 3 | +#include "bpf_exception.h" |
| 4 | + |
| 5 | +BpfMap::BpfMap(BpfProgram *program_, const py::object &map_from_python) { |
| 6 | + if (py::isinstance<py::function>(map_from_python)) { |
| 7 | + const auto name = map_from_python.attr("__name__").cast<std::string>(); |
| 8 | + bpf_program = program_; |
| 9 | + map_ = bpf_object__find_map_by_name(bpf_program->get_obj(), name.c_str()); |
| 10 | + if (!map_) { |
| 11 | + throw BpfException("Failed to find map by name"); |
| 12 | + } |
| 13 | + map_fd = bpf_map__fd(map_); |
| 14 | + if (map_fd == -1) { |
| 15 | + throw BpfException("Failed to open map File Descriptor"); |
| 16 | + } |
| 17 | + } else { |
| 18 | + throw BpfException("Invalid map object passed to function."); |
| 19 | + } |
| 20 | +} |
| 21 | + |
| 22 | +std::vector<uint8_t> BpfMap::python_to_bytes(const py::object &obj, size_t size) { |
| 23 | + std::vector<uint8_t> result(size, 0); |
| 24 | + |
| 25 | + if (py::isinstance<py::int_>(obj)) { |
| 26 | + const auto value = obj.cast<uint64_t>(); |
| 27 | + std::memcpy(result.data(), &value, std::min(size, sizeof(uint64_t))); |
| 28 | + } else if (py::isinstance<py::bytes>(obj)) { |
| 29 | + const auto bytes_str = obj.cast<std::string>(); |
| 30 | + std::memcpy(result.data(), bytes_str.data(), std::min(size, bytes_str.size())); |
| 31 | + } else if (py::isinstance<py::str>(obj)) { |
| 32 | + const auto str_val = obj.cast<std::string>(); |
| 33 | + std::memcpy(result.data(), str_val.data(), std::min(size, str_val.size())); |
| 34 | + } |
| 35 | + |
| 36 | + return result; |
| 37 | +} |
| 38 | + |
| 39 | +py::object BpfMap::bytes_to_python(const std::vector<uint8_t> &data) { |
| 40 | + // Try to interpret as integer if it's a common integer size |
| 41 | + if (data.size() == 4) { |
| 42 | + uint32_t value; |
| 43 | + std::memcpy(&value, data.data(), 4); |
| 44 | + return py::cast(value); |
| 45 | + } else if (data.size() == 8) { |
| 46 | + uint64_t value; |
| 47 | + std::memcpy(&value, data.data(), 8); |
| 48 | + return py::cast(value); |
| 49 | + } else { |
| 50 | + // Return as bytes |
| 51 | + return py::bytes(reinterpret_cast<const char *>(data.data()), data.size()); |
| 52 | + } |
| 53 | +} |
| 54 | + |
| 55 | +void BpfMap::update(const py::object &key, const py::object &value) const { |
| 56 | + const size_t key_size = bpf_map__key_size(map_); |
| 57 | + const size_t value_size = bpf_map__value_size(map_); |
| 58 | + |
| 59 | + const auto key_bytes = python_to_bytes(key, key_size); |
| 60 | + const auto value_bytes = python_to_bytes(value, value_size); |
| 61 | + |
| 62 | + const int ret = bpf_map__update_elem( |
| 63 | + map_, |
| 64 | + key_bytes.data(), |
| 65 | + key_size, |
| 66 | + value_bytes.data(), |
| 67 | + value_size, |
| 68 | + BPF_ANY); |
| 69 | + if (ret != 0) { |
| 70 | + throw BpfException("Failed to update map element"); |
| 71 | + } |
| 72 | +} |
| 73 | + |
| 74 | +void BpfMap::delete_elem(const py::object &key) const { |
| 75 | + const size_t key_size = bpf_map__key_size(map_); |
| 76 | + std::vector<uint8_t> key_bytes; |
| 77 | + key_bytes = python_to_bytes(key, key_size); |
| 78 | + |
| 79 | + if (const int ret = bpf_map__delete_elem(map_, key_bytes.data(), key_size, BPF_ANY); ret != 0) { |
| 80 | + throw BpfException("Failed to delete map element"); |
| 81 | + } |
| 82 | +} |
| 83 | + |
| 84 | +py::list BpfMap::get_next_key(const py::object &key) const { |
| 85 | + const size_t key_size = bpf_map__key_size(map_); |
| 86 | + std::vector<uint8_t> next_key(key_size); |
| 87 | + |
| 88 | + int ret; |
| 89 | + if (key.is_none()) { |
| 90 | + ret = bpf_map__get_next_key(map_, nullptr, next_key.data(), key_size); |
| 91 | + } else { |
| 92 | + const auto key_bytes = python_to_bytes(key, key_size); |
| 93 | + ret = bpf_map__get_next_key(map_, key_bytes.data(), next_key.data(), key_size); |
| 94 | + } |
| 95 | + |
| 96 | + py::list result; |
| 97 | + if (ret == 0) { |
| 98 | + result.append(bytes_to_python(next_key)); |
| 99 | + } |
| 100 | + return result; |
| 101 | +} |
| 102 | + |
| 103 | +py::list BpfMap::keys() const { |
| 104 | + py::list result; |
| 105 | + const size_t key_size = bpf_map__key_size(map_); |
| 106 | + |
| 107 | + std::vector<uint8_t> key(key_size); |
| 108 | + std::vector<uint8_t> next_key(key_size); |
| 109 | + |
| 110 | + int ret = bpf_map__get_next_key(map_, nullptr, key.data(), key_size); |
| 111 | + |
| 112 | + while (ret == 0) { |
| 113 | + result.append(bytes_to_python(key)); |
| 114 | + ret = bpf_map__get_next_key(map_, key.data(), next_key.data(), key_size); |
| 115 | + key = next_key; |
| 116 | + } |
| 117 | + |
| 118 | + return result; |
| 119 | +} |
| 120 | + |
| 121 | +py::list BpfMap::values() const { |
| 122 | + py::list result; |
| 123 | + const size_t key_size = bpf_map__key_size(map_); |
| 124 | + const size_t value_size = bpf_map__value_size(map_); |
| 125 | + |
| 126 | + std::vector<uint8_t> key(key_size); |
| 127 | + std::vector<uint8_t> next_key(key_size); |
| 128 | + std::vector<uint8_t> value(value_size); |
| 129 | + |
| 130 | + int ret = bpf_map__get_next_key(map_, nullptr, key.data(), key_size); |
| 131 | + |
| 132 | + while (ret == 0) { |
| 133 | + if (bpf_map__lookup_elem(map_, key.data(), key_size, value.data(), value_size, BPF_ANY) == 0) { |
| 134 | + result.append(bytes_to_python(value)); |
| 135 | + } |
| 136 | + ret = bpf_map__get_next_key(map_, key.data(), next_key.data(), key_size); |
| 137 | + key = next_key; |
| 138 | + } |
| 139 | + |
| 140 | + return result; |
| 141 | +} |
| 142 | + |
| 143 | +std::string BpfMap::get_name() const { |
| 144 | + const char *name = bpf_map__name(map_); |
| 145 | + return name ? std::string(name) : ""; |
| 146 | +} |
| 147 | + |
| 148 | +int BpfMap::get_type() const { |
| 149 | + return bpf_map__type(map_); |
| 150 | +} |
| 151 | + |
| 152 | +int BpfMap::get_key_size() const { |
| 153 | + return bpf_map__key_size(map_); |
| 154 | +} |
| 155 | + |
| 156 | +int BpfMap::get_value_size() const { |
| 157 | + return bpf_map__value_size(map_); |
| 158 | +} |
| 159 | + |
| 160 | +int BpfMap::get_max_entries() const { |
| 161 | + return bpf_map__max_entries(map_); |
| 162 | +} |
| 163 | + |
| 164 | +py::dict BpfMap::items() const { |
| 165 | + py::dict result; |
| 166 | + const size_t key_size = bpf_map__key_size(map_); |
| 167 | + const size_t value_size = bpf_map__value_size(map_); |
| 168 | + |
| 169 | + std::vector<uint8_t> key(key_size); |
| 170 | + std::vector<uint8_t> next_key(key_size); |
| 171 | + std::vector<uint8_t> value(value_size); |
| 172 | + |
| 173 | + // Get first key |
| 174 | + int ret = bpf_map__get_next_key(map_, nullptr, key.data(), key_size); |
| 175 | + |
| 176 | + while (ret == 0) { |
| 177 | + // Lookup value for current key |
| 178 | + if (bpf_map__lookup_elem(map_, key.data(), key_size, value.data(), value_size, BPF_ANY) == 0) { |
| 179 | + result[bytes_to_python(key)] = bytes_to_python(value); |
| 180 | + } |
| 181 | + |
| 182 | + // Get next key |
| 183 | + ret = bpf_map__get_next_key(map_, key.data(), next_key.data(), key_size); |
| 184 | + key = next_key; |
| 185 | + } |
| 186 | + |
| 187 | + return result; |
| 188 | +} |
| 189 | + |
| 190 | +py::object BpfMap::lookup(const py::object &key) const { |
| 191 | + const __u32 key_size = bpf_map__key_size(map_); |
| 192 | + const __u32 value_size = bpf_map__value_size(map_); |
| 193 | + |
| 194 | + const auto key_bytes = python_to_bytes(key, key_size); |
| 195 | + std::vector<uint8_t> value_bytes(value_size); |
| 196 | + |
| 197 | + // The flags field here matters only when spin locks are used which is close to fucking never, so fuck no, |
| 198 | + // im not adding it |
| 199 | + const int ret = bpf_map__lookup_elem( |
| 200 | + map_, |
| 201 | + key_bytes.data(), |
| 202 | + key_size, |
| 203 | + value_bytes.data(), |
| 204 | + value_size, |
| 205 | + BPF_ANY); |
| 206 | + if (ret != 0) { |
| 207 | + return py::none(); |
| 208 | + } |
| 209 | + |
| 210 | + return bytes_to_python(value_bytes); |
| 211 | +} |
0 commit comments