Magisk/native/src/base/misc.hpp

313 lines
9.8 KiB
C++
Raw Normal View History

2019-07-01 22:58:19 -07:00
#pragma once
2019-12-13 00:37:06 -05:00
#include <pthread.h>
2019-07-01 22:58:19 -07:00
#include <string>
#include <functional>
#include <string_view>
2022-01-21 04:43:27 -08:00
#include <bitset>
2023-04-03 18:20:12 -07:00
#include <random>
2023-06-20 18:17:26 -07:00
#include <cxx.h>
2019-07-01 22:58:19 -07:00
2023-06-07 16:49:40 -07:00
#include "xwrap.hpp"
#define DISALLOW_COPY_AND_MOVE(clazz) \
2023-06-07 16:49:40 -07:00
clazz(const clazz &) = delete; \
clazz(clazz &&) = delete;
2023-06-07 16:49:40 -07:00
#define ALLOW_MOVE_ONLY(clazz) \
clazz() = default; \
clazz(const clazz&) = delete; \
clazz(clazz &&o) { swap(o); } \
clazz& operator=(clazz &&o) { swap(o); return *this; }
2019-09-25 23:55:39 -04:00
class mutex_guard {
DISALLOW_COPY_AND_MOVE(mutex_guard)
2019-07-01 22:58:19 -07:00
public:
explicit mutex_guard(pthread_mutex_t &m): mutex(&m) {
pthread_mutex_lock(mutex);
}
2021-01-12 00:07:48 -08:00
void unlock() {
pthread_mutex_unlock(mutex);
mutex = nullptr;
}
~mutex_guard() {
2021-01-12 00:07:48 -08:00
if (mutex) pthread_mutex_unlock(mutex);
}
2019-07-01 22:58:19 -07:00
private:
pthread_mutex_t *mutex;
2019-07-01 22:58:19 -07:00
};
2020-04-30 01:27:36 -07:00
template <class Func>
2019-09-25 23:55:39 -04:00
class run_finally {
DISALLOW_COPY_AND_MOVE(run_finally)
2019-07-01 22:58:19 -07:00
public:
2021-08-19 01:54:12 -07:00
explicit run_finally(Func &&fn) : fn(std::move(fn)) {}
~run_finally() { fn(); }
2019-07-01 22:58:19 -07:00
private:
2021-08-19 01:54:12 -07:00
Func fn;
2019-07-01 22:58:19 -07:00
};
template <typename T>
class reversed_container {
public:
reversed_container(T &base) : base(base) {}
decltype(std::declval<T>().rbegin()) begin() { return base.rbegin(); }
decltype(std::declval<T>().crbegin()) begin() const { return base.crbegin(); }
decltype(std::declval<T>().crbegin()) cbegin() const { return base.crbegin(); }
decltype(std::declval<T>().rend()) end() { return base.rend(); }
decltype(std::declval<T>().crend()) end() const { return base.crend(); }
decltype(std::declval<T>().crend()) cend() const { return base.crend(); }
private:
T &base;
};
template <typename T>
reversed_container<T> reversed(T &base) {
return reversed_container<T>(base);
}
template<class T>
static inline void default_new(T *&p) { p = new T(); }
2022-02-08 16:49:22 +08:00
template<class T>
static inline void default_new(std::unique_ptr<T> &p) { p.reset(new T()); }
template<typename T, typename Impl>
class stateless_allocator {
public:
using value_type = T;
T *allocate(size_t num) { return static_cast<T*>(Impl::allocate(sizeof(T) * num)); }
void deallocate(T *ptr, size_t num) { Impl::deallocate(ptr, sizeof(T) * num); }
stateless_allocator() = default;
stateless_allocator(const stateless_allocator&) = default;
stateless_allocator(stateless_allocator&&) = default;
template <typename U>
stateless_allocator(const stateless_allocator<U, Impl>&) {}
bool operator==(const stateless_allocator&) { return true; }
bool operator!=(const stateless_allocator&) { return false; }
};
2022-02-07 00:17:07 -08:00
class dynamic_bitset_impl {
2022-01-21 04:43:27 -08:00
public:
2022-01-23 04:39:00 -08:00
using slot_type = unsigned long;
constexpr static int slot_size = sizeof(slot_type) * 8;
using slot_bits = std::bitset<slot_size>;
2022-02-07 00:17:07 -08:00
size_t slots() const { return slot_list.size(); }
slot_type get_slot(size_t slot) const {
return slot_list.size() > slot ? slot_list[slot].to_ulong() : 0ul;
}
2022-02-11 01:00:58 -08:00
void emplace_back(slot_type l) {
slot_list.emplace_back(l);
}
2022-02-07 00:17:07 -08:00
protected:
slot_bits::reference get(size_t pos) {
2022-01-21 04:43:27 -08:00
size_t slot = pos / slot_size;
size_t index = pos % slot_size;
2022-01-23 04:39:00 -08:00
if (slot_list.size() <= slot) {
slot_list.resize(slot + 1);
2022-01-21 04:43:27 -08:00
}
2022-01-23 04:39:00 -08:00
return slot_list[slot][index];
2022-01-21 04:43:27 -08:00
}
2022-02-07 00:17:07 -08:00
bool get(size_t pos) const {
2022-01-24 22:30:13 -08:00
size_t slot = pos / slot_size;
size_t index = pos % slot_size;
return slot_list.size() > slot && slot_list[slot][index];
}
2022-01-23 04:39:00 -08:00
private:
std::vector<slot_bits> slot_list;
2022-01-21 04:43:27 -08:00
};
2022-02-07 00:17:07 -08:00
struct dynamic_bitset : public dynamic_bitset_impl {
slot_bits::reference operator[] (size_t pos) { return get(pos); }
bool operator[] (size_t pos) const { return get(pos); }
};
struct StringCmp {
using is_transparent = void;
bool operator()(std::string_view a, std::string_view b) const { return a < b; }
};
2023-06-07 16:49:40 -07:00
struct heap_data;
2022-09-15 01:17:05 -07:00
2023-06-07 16:49:40 -07:00
// Interchangeable as `&[u8]` in Rust
struct byte_view {
byte_view() : _buf(nullptr), _sz(0) {}
byte_view(const void *buf, size_t sz) : _buf((uint8_t *) buf), _sz(sz) {}
// byte_view, or any of its subclass, can be copied as byte_view
byte_view(const byte_view &o) : _buf(o._buf), _sz(o._sz) {}
// Bridging to Rust slice
byte_view(rust::Slice<const uint8_t> o) : byte_view(o.data(), o.size()) {}
operator rust::Slice<const uint8_t>() { return rust::Slice<const uint8_t>(_buf, _sz); }
// String as bytes
byte_view(const char *s, bool with_nul = true)
: byte_view(std::string_view(s), with_nul, false) {}
byte_view(const std::string &s, bool with_nul = true)
: byte_view(std::string_view(s), with_nul, false) {}
byte_view(std::string_view s, bool with_nul = true)
: byte_view(s, with_nul, true /* string_view is not guaranteed to null terminate */ ) {}
// Vector as bytes
byte_view(const std::vector<uint8_t> &v) : byte_view(v.data(), v.size()) {}
const uint8_t *buf() const { return _buf; }
size_t sz() const { return _sz; }
bool contains(byte_view pattern) const;
bool equals(byte_view o) const;
heap_data clone() const;
protected:
uint8_t *_buf;
size_t _sz;
private:
byte_view(std::string_view s, bool with_nul, bool check_nul)
: byte_view(static_cast<const void *>(s.data()), s.length()) {
if (with_nul) {
if (check_nul && s[s.length()] != '\0')
return;
++_sz;
}
}
};
// Interchangeable as `&mut [u8]` in Rust
struct byte_data : public byte_view {
byte_data() = default;
byte_data(void *buf, size_t sz) : byte_view(buf, sz) {}
2023-06-10 17:11:02 -07:00
// byte_data, or any of its subclass, can be copied as byte_data
byte_data(const byte_data &o) : byte_data(o._buf, o._sz) {}
2023-06-07 16:49:40 -07:00
// Transparent conversion from common C++ types to mutable byte references
byte_data(std::string &s, bool with_nul = true)
: byte_data(s.data(), with_nul ? s.length() + 1 : s.length()) {}
byte_data(std::vector<uint8_t> &v) : byte_data(v.data(), v.size()) {}
// Bridging to Rust slice
byte_data(rust::Slice<uint8_t> o) : byte_data(o.data(), o.size()) {}
operator rust::Slice<uint8_t>() { return rust::Slice<uint8_t>(_buf, _sz); }
using byte_view::buf;
uint8_t *buf() { return _buf; }
void swap(byte_data &o);
2023-06-20 18:17:26 -07:00
rust::Vec<size_t> patch(byte_view from, byte_view to);
2023-06-07 16:49:40 -07:00
};
2023-06-10 01:40:45 -07:00
template<size_t N>
struct byte_array : public byte_data {
byte_array() : byte_data(arr, N), arr{0} {}
private:
uint8_t arr[N];
};
2023-06-07 16:49:40 -07:00
class byte_channel;
struct heap_data : public byte_data {
ALLOW_MOVE_ONLY(heap_data)
explicit heap_data(size_t sz) : byte_data(calloc(sz, 1), sz) {}
2023-06-07 16:49:40 -07:00
~heap_data() { free(_buf); }
// byte_channel needs to reallocate the internal buffer
friend byte_channel;
};
2023-05-28 23:50:52 -07:00
2023-06-20 18:17:26 -07:00
rust::Vec<size_t> mut_u8_patch(
rust::Slice<uint8_t> buf,
rust::Slice<const uint8_t> from,
rust::Slice<const uint8_t> to);
2023-03-08 06:52:09 +08:00
uint64_t parse_uint64_hex(std::string_view s);
2021-10-23 14:38:30 -07:00
int parse_int(std::string_view s);
2019-07-01 22:58:19 -07:00
2020-04-30 01:27:36 -07:00
using thread_entry = void *(*)(void *);
2023-05-09 18:54:38 -07:00
extern "C" int new_daemon_thread(thread_entry entry, void *arg = nullptr);
2019-07-01 22:58:19 -07:00
static inline bool str_contains(std::string_view s, std::string_view ss) {
return s.find(ss) != std::string::npos;
}
static inline bool str_starts(std::string_view s, std::string_view ss) {
return s.size() >= ss.size() && s.compare(0, ss.size(), ss) == 0;
}
static inline bool str_ends(std::string_view s, std::string_view ss) {
return s.size() >= ss.size() && s.compare(s.size() - ss.size(), std::string::npos, ss) == 0;
}
static inline std::string ltrim(std::string &&s) {
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](unsigned char ch) {
return !std::isspace(ch);
}));
return std::move(s);
}
static inline std::string rtrim(std::string &&s) {
s.erase(std::find_if(s.rbegin(), s.rend(), [](unsigned char ch) {
return !std::isspace(ch) && ch != '\0';
}).base(), s.end());
return std::move(s);
}
2020-11-07 14:36:13 -08:00
int fork_dont_care();
int fork_no_orphan();
2020-11-07 14:36:13 -08:00
void init_argv0(int argc, char **argv);
void set_nice_name(const char *name);
uint32_t binary_gcd(uint32_t u, uint32_t v);
int switch_mnt_ns(int pid);
std::string &replace_all(std::string &str, std::string_view from, std::string_view to);
2023-04-03 18:50:36 -07:00
std::vector<std::string> split(std::string_view s, std::string_view delims);
std::vector<std::string_view> split_view(std::string_view, std::string_view delims);
2020-11-07 14:36:13 -08:00
// Similar to vsnprintf, but the return value is the written number of bytes
int vssprintf(char *dest, size_t size, const char *fmt, va_list ap);
// Similar to snprintf, but the return value is the written number of bytes
int ssprintf(char *dest, size_t size, const char *fmt, ...);
2022-09-15 01:17:05 -07:00
// This is not actually the strscpy from the Linux kernel.
// Silently truncates, and returns the number of bytes written.
extern "C" size_t strscpy(char *dest, const char *src, size_t size);
// Ban usage of unsafe cstring functions
#define vsnprintf __use_vssprintf_instead__
#define snprintf __use_ssprintf_instead__
2022-09-15 01:17:05 -07:00
#define strlcpy __use_strscpy_instead__
2019-07-01 22:58:19 -07:00
struct exec_t {
bool err = false;
int fd = -2;
void (*pre_exec)() = nullptr;
int (*fork)() = xfork;
const char **argv = nullptr;
2019-07-01 22:58:19 -07:00
};
int exec_command(exec_t &exec);
template <class ...Args>
int exec_command(exec_t &exec, Args &&...args) {
const char *argv[] = {args..., nullptr};
exec.argv = argv;
return exec_command(exec);
2019-07-01 22:58:19 -07:00
}
int exec_command_sync(exec_t &exec);
template <class ...Args>
int exec_command_sync(exec_t &exec, Args &&...args) {
const char *argv[] = {args..., nullptr};
exec.argv = argv;
return exec_command_sync(exec);
2019-07-01 22:58:19 -07:00
}
template <class ...Args>
int exec_command_sync(Args &&...args) {
2021-08-26 03:09:56 -07:00
exec_t exec;
return exec_command_sync(exec, args...);
2019-07-01 22:58:19 -07:00
}
2020-11-07 14:36:13 -08:00
template <class ...Args>
void exec_command_async(Args &&...args) {
const char *argv[] = {args..., nullptr};
exec_t exec {
.fork = fork_dont_care,
.argv = argv,
};
exec_command(exec);
2020-11-07 14:36:13 -08:00
}