2017-09-14 20:52:27 +02:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/mman.h>
|
2019-02-25 05:09:34 +01:00
|
|
|
|
2018-10-25 03:08:06 +02:00
|
|
|
extern "C" {
|
|
|
|
#include <libfdt.h>
|
|
|
|
}
|
2019-02-10 09:57:51 +01:00
|
|
|
#include <utils.h>
|
2019-09-20 09:05:14 +02:00
|
|
|
#include <bitset>
|
2019-09-21 11:30:04 +02:00
|
|
|
#include <vector>
|
2017-09-14 20:52:27 +02:00
|
|
|
|
|
|
|
#include "magiskboot.h"
|
2019-02-25 05:09:34 +01:00
|
|
|
#include "format.h"
|
2017-09-14 20:52:27 +02:00
|
|
|
|
2019-09-20 09:05:14 +02:00
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
constexpr int MAX_DEPTH = 32;
|
|
|
|
static bitset<MAX_DEPTH> depth_set;
|
|
|
|
|
|
|
|
static void pretty_node(int depth) {
|
|
|
|
if (depth == 0)
|
|
|
|
return;
|
|
|
|
|
2019-09-21 11:30:04 +02:00
|
|
|
for (int i = 0; i < depth - 1; ++i)
|
|
|
|
printf(depth_set[i] ? "│ " : " ");
|
|
|
|
|
|
|
|
printf(depth_set[depth - 1] ? "├── " : "└── ");
|
2019-09-20 09:05:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void pretty_prop(int depth) {
|
2019-09-21 11:30:04 +02:00
|
|
|
for (int i = 0; i < depth; ++i)
|
|
|
|
printf(depth_set[i] ? "│ " : " ");
|
|
|
|
|
|
|
|
printf(depth_set[depth] ? "│ " : " ");
|
2019-09-20 09:05:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void print_node(const void *fdt, int node = 0, int depth = 0) {
|
|
|
|
// Print node itself
|
|
|
|
pretty_node(depth);
|
|
|
|
printf("#%d: %s\n", node, fdt_get_name(fdt, node, nullptr));
|
|
|
|
|
|
|
|
// Print properties
|
|
|
|
depth_set[depth] = fdt_first_subnode(fdt, node) >= 0;
|
2017-11-09 20:45:06 +01:00
|
|
|
int prop;
|
|
|
|
fdt_for_each_property_offset(prop, fdt, node) {
|
2019-09-20 09:05:14 +02:00
|
|
|
pretty_prop(depth);
|
2017-11-09 20:45:06 +01:00
|
|
|
int size;
|
|
|
|
const char *name;
|
2019-09-20 09:05:14 +02:00
|
|
|
auto value = static_cast<const char *>(fdt_getprop_by_offset(fdt, prop, &name, &size));
|
|
|
|
|
|
|
|
bool is_str = !(size > 1 && value[0] == 0);
|
|
|
|
if (is_str) {
|
|
|
|
// Scan through value to see if printable
|
|
|
|
for (int i = 0; i < size; ++i) {
|
|
|
|
char c = value[i];
|
|
|
|
if (i == size - 1) {
|
|
|
|
// Make sure null terminate
|
|
|
|
is_str = c == '\0';
|
|
|
|
} else if ((c > 0 && c < 32) || c >= 127) {
|
|
|
|
is_str = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (is_str) {
|
|
|
|
printf("[%s]: [%s]\n", name, value);
|
|
|
|
} else {
|
|
|
|
printf("[%s]: <bytes>(%d)\n", name, size);
|
|
|
|
}
|
2017-11-09 20:45:06 +01:00
|
|
|
}
|
|
|
|
|
2019-09-20 09:05:14 +02:00
|
|
|
// Recursive
|
|
|
|
if (depth_set[depth]) {
|
|
|
|
int child;
|
|
|
|
int prev = -1;
|
|
|
|
fdt_for_each_subnode(child, fdt, node) {
|
|
|
|
if (prev >= 0)
|
|
|
|
print_node(fdt, prev, depth + 1);
|
|
|
|
prev = child;
|
|
|
|
}
|
|
|
|
depth_set[depth] = false;
|
|
|
|
print_node(fdt, prev, depth + 1);
|
2017-10-07 16:08:10 +02:00
|
|
|
}
|
|
|
|
}
|
2017-09-14 20:52:27 +02:00
|
|
|
|
2019-09-21 11:30:04 +02:00
|
|
|
static int find_fstab(const void *fdt, int node = 0) {
|
|
|
|
if (fdt_get_name(fdt, node, nullptr) == "fstab"sv)
|
|
|
|
return node;
|
|
|
|
int child;
|
|
|
|
fdt_for_each_subnode(child, fdt, node) {
|
|
|
|
int fstab = find_fstab(fdt, child);
|
|
|
|
if (fstab >= 0)
|
2017-09-14 20:52:27 +02:00
|
|
|
return fstab;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2019-09-20 09:53:58 +02:00
|
|
|
static void dtb_print(const char *file, bool fstab) {
|
2017-10-07 16:08:10 +02:00
|
|
|
size_t size ;
|
2018-10-25 03:08:06 +02:00
|
|
|
uint8_t *dtb, *fdt;
|
2017-10-07 16:08:10 +02:00
|
|
|
fprintf(stderr, "Loading dtbs from [%s]\n", file);
|
2019-02-25 05:09:34 +01:00
|
|
|
mmap_ro(file, dtb, size);
|
2017-10-07 16:08:10 +02:00
|
|
|
// Loop through all the dtbs
|
|
|
|
int dtb_num = 0;
|
|
|
|
for (int i = 0; i < size; ++i) {
|
|
|
|
if (memcmp(dtb + i, DTB_MAGIC, 4) == 0) {
|
|
|
|
fdt = dtb + i;
|
2019-09-20 09:53:58 +02:00
|
|
|
if (fstab) {
|
|
|
|
int node = find_fstab(fdt);
|
|
|
|
if (node >= 0) {
|
|
|
|
fprintf(stderr, "Found fstab in dtb.%04d\n", dtb_num);
|
|
|
|
print_node(fdt, node);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "Printing dtb.%04d\n", dtb_num);
|
|
|
|
print_node(fdt);
|
|
|
|
}
|
2019-09-21 11:30:04 +02:00
|
|
|
++dtb_num;
|
2017-10-07 16:08:10 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
fprintf(stderr, "\n");
|
|
|
|
munmap(dtb, size);
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
2019-09-21 11:30:04 +02:00
|
|
|
static void dtb_patch(const char *in, const char *out) {
|
|
|
|
vector<uint8_t *> fdt_list;
|
|
|
|
size_t dtb_sz ;
|
|
|
|
uint8_t *dtb;
|
|
|
|
fprintf(stderr, "Loading dtbs from [%s]\n", in);
|
|
|
|
mmap_ro(in, dtb, dtb_sz);
|
|
|
|
bool modified = false;
|
|
|
|
for (int i = 0; i < dtb_sz; ++i) {
|
2017-09-14 20:52:27 +02:00
|
|
|
if (memcmp(dtb + i, DTB_MAGIC, 4) == 0) {
|
2019-09-21 11:30:04 +02:00
|
|
|
// Patched will only be smaller
|
|
|
|
int len = fdt_totalsize(dtb + i);
|
|
|
|
auto fdt = static_cast<uint8_t *>(xmalloc(len));
|
|
|
|
memcpy(fdt, dtb + i, len);
|
|
|
|
int fstab = find_fstab(fdt);
|
|
|
|
if (fstab < 0)
|
|
|
|
continue;
|
|
|
|
fprintf(stderr, "Found fstab in dtb.%04d\n", fdt_list.size());
|
|
|
|
int block;
|
|
|
|
fdt_for_each_subnode(block, fdt, fstab) {
|
|
|
|
fprintf(stderr, "Found entry [%s] in fstab\n", fdt_get_name(fdt, block, nullptr));
|
|
|
|
uint32_t size;
|
|
|
|
auto value = static_cast<const char *>(
|
|
|
|
fdt_getprop(fdt, block, "fsmgr_flags", reinterpret_cast<int *>(&size)));
|
|
|
|
char *pval = patch_verity(value, size);
|
|
|
|
if (pval) {
|
|
|
|
modified = true;
|
|
|
|
fdt_setprop_string(fdt, block, "fsmgr_flags", pval);
|
2017-09-14 20:52:27 +02:00
|
|
|
}
|
|
|
|
}
|
2019-09-21 11:30:04 +02:00
|
|
|
fdt_list.push_back(fdt);
|
2017-09-14 20:52:27 +02:00
|
|
|
}
|
|
|
|
}
|
2019-09-21 11:30:04 +02:00
|
|
|
munmap(dtb, dtb_sz);
|
|
|
|
if (modified) {
|
|
|
|
if (!out)
|
|
|
|
out = in;
|
|
|
|
int fd = xopen(out, O_WRONLY | O_CREAT | O_CLOEXEC);
|
|
|
|
for (auto fdt : fdt_list) {
|
|
|
|
fdt_pack(fdt);
|
|
|
|
xwrite(fd, fdt, fdt_totalsize(fdt));
|
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
}
|
|
|
|
exit(!modified);
|
2017-11-10 18:30:33 +01:00
|
|
|
}
|
|
|
|
|
2019-09-20 09:53:58 +02:00
|
|
|
int dtb_commands(int argc, char *argv[]) {
|
|
|
|
char *dtb = argv[0];
|
|
|
|
++argv;
|
|
|
|
--argc;
|
|
|
|
|
|
|
|
if (argv[0] == "print"sv) {
|
|
|
|
dtb_print(dtb, argc > 1 && argv[1] == "-f"sv);
|
|
|
|
} else if (argv[0] == "patch"sv) {
|
2019-09-21 11:30:04 +02:00
|
|
|
dtb_patch(dtb, argv[1]);
|
2019-09-20 09:53:58 +02:00
|
|
|
} else {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2017-11-10 18:30:33 +01:00
|
|
|
return 0;
|
2017-09-14 20:52:27 +02:00
|
|
|
}
|