-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathuflat.c
More file actions
574 lines (467 loc) · 16.2 KB
/
uflat.c
File metadata and controls
574 lines (467 loc) · 16.2 KB
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
/**
* @file uflat.c
* @author Samsung R&D Poland - Mobile Security Group (srpol.mb.sec@samsung.com)
* @brief Userspace FLAT (UFLAT) API implementation
*
*/
#ifndef _GNU_SOURCE
#define _GNU_SOURCE
#endif
#include <dlfcn.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdarg.h>
#include <limits.h>
#include <string.h>
#include <sys/mman.h>
#include <unistd.h>
#include "uflat.h"
enum mem_prot {
UFLAT_MEM_PROT_READ = (1 << 0),
UFLAT_MEM_PROT_WRITE = (1 << 1),
UFLAT_MEM_PROT_EXEC = (1 << 2),
};
struct udump_memory_node {
struct rb_node rb;
uint64_t __subtree_last;
uint64_t start;
uint64_t end;
uint16_t prot;
};
struct udump_memory_map {
struct rb_root_cached imap_root;
};
void udump_destroy(struct udump_memory_map* mem);
int udump_dump_vma(struct udump_memory_map* mem);
/*
* Flatten API
*/
volatile int debug_flag = false;
int verbose_flag = false;
func_symbol_info *func_sym_table = NULL;
size_t func_sym_table_n_entries = 0;
struct uflat* uflat_init(const char* path) {
int rv;
struct uflat* uflat = NULL, *err;
uflat = (struct uflat*) calloc(1, sizeof(*uflat));
if(uflat == NULL) {
FLATTEN_LOG_ERROR("Failed to initialize uflat - out-of-memory");
return UFLAT_ERR_PTR(ENOMEM);
}
uflat->udump_memory = (struct udump_memory_map*) calloc(1, sizeof(struct udump_memory_map));
if(uflat->udump_memory == NULL) {
FLATTEN_LOG_ERROR("Failed to initialize kflat - out-of-memory on udump_memory");
free(uflat);
return UFLAT_ERR_PTR(ENOMEM);
}
rv = udump_dump_vma(uflat->udump_memory);
if (rv) {
FLATTEN_LOG_ERROR("Failed to initialize uflat - udump_dump_vma returned (%d)", rv);
err = UFLAT_ERR_PTR(ENOMEM);
goto err_flat_allocated;
}
flatten_init(&uflat->flat);
rv = uflat->flat.error;
if (rv) {
FLATTEN_LOG_ERROR("Failed to initialize uflat - flatten_init returned (%d)", rv);
err = UFLAT_ERR_PTR(rv);
goto err_udump_created;
}
// Prepare output file
uflat->out_size = UFLAT_DEFAULT_OUTPUT_SIZE;
uflat->out_name = strdup(path);
uflat->out_fd = open(path, O_RDWR | O_CREAT, 0664);
if (uflat->out_fd < 0) {
FLATTEN_LOG_ERROR("Failed to create output file - %s", strerror(errno));
err = UFLAT_ERR_PTR(EIO);
goto err_open;
}
rv = ftruncate(uflat->out_fd, uflat->out_size);
if (rv) {
FLATTEN_LOG_ERROR("Failed to truncate output file - %s", strerror(errno));
err = UFLAT_ERR_PTR(EIO);
goto err_mmap;
}
uflat->out_mem = mmap(0, uflat->out_size, PROT_READ | PROT_WRITE,
MAP_SHARED, uflat->out_fd, 0);
if (uflat->out_mem == MAP_FAILED) {
FLATTEN_LOG_ERROR("Failed to mmap output file - %s", strerror(errno));
err = UFLAT_ERR_PTR(EFAULT);
goto err_mmap;
}
uflat->flat.area = uflat->out_mem;
uflat->flat.size = uflat->out_size;
// Initialize symbol address resolution engine
func_sym_table = get_symbol_to_name_mapping(&func_sym_table_n_entries);
return uflat;
err_mmap:
close(uflat->out_fd);
err_open:
free(uflat->out_name);
err_udump_created:
udump_destroy(uflat->udump_memory);
err_flat_allocated:
free(uflat->udump_memory);
free(uflat);
return err;
}
void uflat_fini(struct uflat* uflat) {
if (uflat == NULL)
return;
munmap(uflat->out_mem, uflat->out_size);
close(uflat->out_fd);
free(uflat->out_name);
flatten_fini(&uflat->flat);
udump_destroy(uflat->udump_memory);
free(uflat->udump_memory);
free(uflat);
cleanup_symbol_to_name_mapping(func_sym_table, func_sym_table_n_entries);
FLATTEN_LOG_DEBUG("Deinitialized uflat");
}
int uflat_set_option(struct uflat* uflat, enum uflat_options option, unsigned long value) {
if(option >= UFLAT_OPT_MAX) {
FLATTEN_LOG_ERROR("Invalid option %d provided to uflat_set_option", (int)option);
return -EINVAL;
}
switch(option) {
case UFLAT_OPT_DEBUG:
uflat->flat.FLCTRL.debug_flag = value;
debug_flag = value;
// [[fallthrough]];
case UFLAT_OPT_VERBOSE:
// TODO:
verbose_flag = value;
// uflat->flat.FLCTRL.vebose_flag = 1;
break;
case UFLAT_OPT_OUTPUT_SIZE: {
munmap(uflat->out_mem, uflat->out_size);
uflat->out_size = value;
int rv = ftruncate(uflat->out_fd, uflat->out_size);
if(rv) {
FLATTEN_LOG_ERROR("Failed to truncate output file - %s", strerror(errno));
uflat->flat.error = EIO;
return errno;
}
uflat->out_mem = mmap(0, uflat->out_size, PROT_READ | PROT_WRITE,
MAP_SHARED, uflat->out_fd, 0);
if(uflat->out_mem == MAP_FAILED) {
FLATTEN_LOG_ERROR("Failed to mmap output file - %s", strerror(errno));
uflat->flat.error = EIO;
return errno;
}
uflat->flat.area = uflat->out_mem;
uflat->flat.size = uflat->out_size;
}
break;
case UFLAT_OPT_SKIP_MEM_FRAGMENTS:
uflat->flat.FLCTRL.mem_fragments_skip = value & 1;
break;
case UFLAT_OPT_SKIP_MEM_COPY:
uflat->flat.FLCTRL.mem_copy_skip = value & 1;
break;
default:
FLATTEN_LOG_ERROR("Invalid option provided to uflat_set_option (%d)", option);
break;
}
FLATTEN_LOG_DEBUG("Set option %d to value %ld", option, value);
return 0;
}
int uflat_write(struct uflat* uflat) {
int rv = 0;
if(uflat == NULL)
return -EFAULT;
FLATTEN_LOG_DEBUG("Starting uflat_write to file `%s`", uflat->out_name);
rv = flatten_write(&uflat->flat);
if (rv != 0) {
FLATTEN_LOG_ERROR("Failed to write uflat image - flatten_write returned (%d)", rv);
return rv;
}
size_t to_write = ((struct flatten_header*)uflat->out_mem)->image_size;
rv = ftruncate(uflat->out_fd, to_write);
if (rv) {
FLATTEN_LOG_ERROR("Failed to truncute output file to its final size - %s", strerror(errno));
return -EBADF;
}
FLATTEN_LOG_DEBUG("Saved uflat image of size %zu bytes", to_write);
return 0;
}
/*
* Debug logging
*/
void uflat_dbg_log_clear(void) {}
#ifdef UFLAT_LOGGING
void uflat_err_log_print(const char* fmt, ...) {
va_list args;
if(!debug_flag)
return;
va_start(args, fmt);
vfprintf(stderr, fmt, args);
va_end(args);
}
void uflat_dbg_log_print(const char* fmt, ...) {
va_list args;
if(!debug_flag)
return;
va_start(args, fmt);
vprintf(fmt, args);
va_end(args);
}
void uflat_info_log_print(const char* fmt, ...) {
va_list args;
if(!verbose_flag)
return;
va_start(args, fmt);
vprintf(fmt, args);
va_end(args);
}
#else
void uflat_err_log_print(const char* fmt, ...) {}
void uflat_dbg_log_print(const char* fmt, ...) {}
void uflat_info_log_print(const char* fmt, ...) {}
#endif
/*
* Memory regions collection
*/
#define START(node) ((node)->start)
#define END(node) ((node)->end)
INTERVAL_TREE_DEFINE(struct udump_memory_node, rb,
uintptr_t, __subtree_last,
START, END,
static __attribute__((used)), memory_tree)
static uint16_t udump_str_to_prot(char str[4]) {
uint16_t prot = 0;
if(str[0] == 'r')
prot |= UFLAT_MEM_PROT_READ;
if(str[1] == 'w')
prot |= UFLAT_MEM_PROT_WRITE;
if(str[2] == 'x')
prot |= UFLAT_MEM_PROT_EXEC;
return prot;
}
static int udump_tree_add_range(struct udump_memory_map* mem, uint64_t start, uint64_t end, uint16_t prot) {
struct udump_memory_node* node;
if(memory_tree_iter_first(&mem->imap_root, start, end) != NULL) {
// There's already such interval in our tree
return -EFAULT;
}
node = memory_tree_iter_first(&mem->imap_root, start - 1, start - 1);
if(node && node->prot == prot) {
// Extend the existing node to the right
memory_tree_remove(node, &mem->imap_root);
node->end = end;
memory_tree_insert(node, &mem->imap_root);
return 0;
}
node = memory_tree_iter_first(&mem->imap_root, end + 1, end + 1);
if(node && node->prot == prot) {
// Extend node to the left
memory_tree_remove(node, &mem->imap_root);
node->start = start;
memory_tree_insert(node, &mem->imap_root);
return 0;
}
// Create a new node
size_t alloc_size = ALIGN(sizeof(*node),__alignof__(unsigned long long));
node = (struct udump_memory_node*) malloc(alloc_size);
if(node == NULL)
return -ENOMEM;
node->start = start;
node->end = end;
node->prot = prot;
memory_tree_insert(node, &mem->imap_root);
return 0;
}
void udump_print_vma(struct udump_memory_map* mem) {
struct rb_root* root;
struct rb_node* p;
FLATTEN_LOG_INFO("Content of VMA tree map:");
root = &mem->imap_root.rb_root;
for(p = rb_first_postorder(root); p != NULL; p = rb_next_postorder(p)) {
char mode[4] = {0};
struct udump_memory_node* node = (struct udump_memory_node*) p;
if(node->prot & UFLAT_MEM_PROT_READ)
mode[0] = 'r';
if(node->prot & UFLAT_MEM_PROT_WRITE)
mode[1] = 'w';
if(node->prot & UFLAT_MEM_PROT_EXEC)
mode[2] = 'x';
FLATTEN_LOG_INFO("\t%lx-%lx %s", node->start, node->end, mode);
}
}
void udump_destroy(struct udump_memory_map* mem) {
struct rb_node * p = rb_first(&mem->imap_root.rb_root);
while(p) {
struct udump_memory_node* node = (struct udump_memory_node*)p;
rb_erase(p, &mem->imap_root.rb_root);
p = rb_next(p);
free(node);
}
}
int udump_dump_vma(struct udump_memory_map* mem) {
FILE* fp;
char* line = NULL;
size_t len = 0, count = 0;
ssize_t read;
fp = fopen("/proc/self/maps", "r");
if(fp == NULL) {
FLATTEN_LOG_ERROR("Failed to open /proc/self/maps - %s", strerror(errno));
return -EFAULT;
}
while ((read = getline(&line, &len, fp)) != -1) {
uint64_t start, end;
char prot[5];
if(read < 0)
continue;
int n = sscanf(line, "%lx-%lx %4s", &start, &end, prot);
if(n == 3) {
udump_tree_add_range(mem, start, end - 1, udump_str_to_prot(prot));
count++;
}
}
free(line);
fclose(fp);
if(count <= 0) {
FLATTEN_LOG_ERROR("Failed to parse any line (count == 0)");
return -EFAULT;
}
FLATTEN_LOG_DEBUG("Detected %zu continous regions in process VMA", count);
return 0;
}
static size_t uflat_test_address(struct uflat* uflat, void* ptr, size_t size) {
struct udump_memory_node* node;
node = memory_tree_iter_first(&uflat->udump_memory->imap_root, (uintptr_t)ptr, (uintptr_t)ptr + size - 1);
if(node == NULL || !(node->prot & UFLAT_MEM_PROT_READ))
return 0;
ssize_t remaining = (uintptr_t)node->end - (uintptr_t)ptr + 1;
return (remaining < (ssize_t) size) ? remaining : size;
}
bool uflat_test_address_range(struct flat* flat, void* ptr, size_t size) {
struct uflat* uflat = container_of(flat, struct uflat, flat);
if(size == 0 || ptr == NULL)
return false;
ssize_t remaining = uflat_test_address(uflat, ptr, size);
if(remaining <= 0 || (size_t) remaining < size) {
// Check if there are any new mapping
udump_destroy(uflat->udump_memory);
udump_dump_vma(uflat->udump_memory);
ssize_t remaining = uflat_test_address(uflat, ptr, size);
if(remaining <= 0 || (size_t) remaining < size) {
FLATTEN_LOG_INFO("Failed to access memory at %lx@%zu - access violation", (uintptr_t) ptr, size);
return false;
}
}
return true;
}
bool uflat_test_exec_range(struct flat* flat, void* ptr) {
struct udump_memory_node* node;
struct uflat* uflat = container_of(flat, struct uflat, flat);
node = memory_tree_iter_first(&uflat->udump_memory->imap_root, (uintptr_t)ptr, (uintptr_t)ptr);
if (node == NULL) {
// Check if there are any new mapping
udump_destroy(uflat->udump_memory);
udump_dump_vma(uflat->udump_memory);
node = memory_tree_iter_first(&uflat->udump_memory->imap_root, (uintptr_t)ptr, (uintptr_t)ptr);
if(node == NULL) {
FLATTEN_LOG_INFO("Failed to access memory at %lx - access violation", (uintptr_t) ptr);
return false;
}
}
if(!(node->prot & UFLAT_MEM_PROT_EXEC)) {
FLATTEN_LOG_INFO("Failed to access code memory at %p - non-executable area", ptr);
return false;
}
return true;
}
__attribute__((no_sanitize("address"))) size_t uflat_test_string_len(struct flat* flat, const char* str) {
size_t str_size, avail_size, test_size;
struct uflat* uflat = container_of(flat, struct uflat, flat);
// 1. Fast-path. Check whether first 1000 bytes are maped
// and look for null-terminator in there
avail_size = uflat_test_address(uflat, (void*) str, 1000);
if(avail_size == 0)
return 0;
str_size = strnlen(str, avail_size);
if(str_size < avail_size)
// Return string length + null terminator
return str_size + 1;
// 2. Slow-path. We haven't encountered null-terminator in first
// 1000 bytes, let's look futher
test_size = 8 * 4096;
while(test_size < INT_MAX) {
size_t partial_size;
size_t off = avail_size;
partial_size = uflat_test_address(uflat, (char*)str + off, test_size);
if(partial_size == 0)
return avail_size;
avail_size += partial_size;
str_size = strnlen(str + off, partial_size);
if(str_size < partial_size)
return off + str_size + 1;
test_size *= 2;
}
return avail_size;
}
/*
* Function names resolution
*/
size_t flatten_func_to_name(char* name, size_t size, void* func_ptr) {
int rv;
Dl_info info;
static bool not_ready_warn_issued = false;
if (func_sym_table == NULL) {
if(!not_ready_warn_issued) {
FLATTEN_LOG_ERROR("Failed to initialize symbol address resolution engine");
not_ready_warn_issued = true;
}
memset(name, 0, size);
return 0;
}
if (func_ptr == NULL) {
FLATTEN_LOG_INFO("Failed to symbolize function - NULL pointer given", func_ptr);
memset(name, 0, size);
return 0;
}
rv = dladdr(func_ptr, &info);
// If dladdr returned 0, the address could not be matched to a shared object. Then, search local symbols.
if (rv == 0 || info.dli_sname == NULL) {
if (func_sym_table == NULL){
FLATTEN_LOG_INFO("Failed to symbolize function at address %p - symbol name lookup engine is not initialized", func_ptr);
memset(name, 0, size);
return 0;
}
const char *symbol_name = lookup_func_by_address(func_sym_table, func_sym_table_n_entries, (unsigned long) func_ptr);
if(symbol_name == NULL) {
FLATTEN_LOG_INFO("Failed to symbolize function at address %p - no symbol found with given address", func_ptr);
memset(name, 0, size);
return 0;
}
else {
strncpy(name, symbol_name, size);
FLATTEN_LOG_DEBUG("Resolved func ptr %p to name `%s` (found among local symbols)", func_ptr, name);
return strlen(name);
}
}
// Address matched to a symbol from a shared object
else {
strncpy(name, info.dli_sname, size);
FLATTEN_LOG_DEBUG("Resolved func ptr %p to name `%s` (found in %s)", func_ptr, info.dli_sname, info.dli_fname);
return strlen(name);
}
}
void* hwasan_safe_memcpy(void* dst, const void* src, size_t size) {
return memcpy(dst, src, size);
}
/*
* Image relocation
*/
#define UFLAT_IMAGE_REGION_START 0x100000000000ULL
#define UFLAT_IMAGE_REGION_SIZE 0x200000000000ULL
#define UFLAT_IMAGE_SLICE_SIZE 0x400000000
#define UFLAT_IMAGE_SLICE_COUNT ((UFLAT_IMAGE_REGION_SIZE - 1) / UFLAT_IMAGE_SLICE_SIZE)
uintptr_t uflat_image_base_addr(void) {
int number;
srand(time(NULL));
number = rand() % UFLAT_IMAGE_SLICE_COUNT;
return UFLAT_IMAGE_REGION_START + number * UFLAT_IMAGE_SLICE_SIZE;
}