├── README.md ├── memmem.c ├── plib.h ├── main.c ├── functions.c ├── link.c ├── import_symbols.py └── gpl.txt /README.md: -------------------------------------------------------------------------------- 1 | Identifies common functions in iBSS/iBEC/iBoot/LLB. Wrapper around ibex by @xerub and Cyanide. Plus IDA Pro plugin. 2 | 3 | Licensed under GPL. 4 | 5 | #IDA Pro support 6 | This repositary includes IDA Pro plugin as well. To export locations found by ibex_find for IDA plugin use `-ida` option (`ibex_find ibec.dec.bin -ida > import_me_in_ida_plugin.txt`). 7 | After loading the ida plugin it will rename the adresses to names according to the exported file. In addition to that it will track xrefs to panic functions (and similar) which leak function 8 | names in strings and rename them as well. Using this method I was able to automatically rename ~230 functions for iOS 7 iBoot/iBEC. 9 | (iOS 9 iBxxx contains far less strings so this method wouldn't be viable.) 10 | 11 | #Building 12 | `cc -m32 main.c -D TARGET_BASEADDR=0x5ff00000 -o ibex_find` 13 | or if you want symbols found by Cyanide as well 14 | `cc -m32 main.c -D TARGET_BASEADDR=0x5ff00000 -D USE_CYANIDE -o ibex_find` 15 | 16 | 17 | #Output 18 | ``` 19 | TARGET_BASEADDR 0x5ff00000 20 | IBOOT_LEN 0x45024 21 | end 0x5ff45024 22 | find_printf() = 0x5ff33ca5 23 | find_snprintf() = 0x5ff3425d 24 | find_malloc() = 0x5ff185cd 25 | find_free() = 0x5ff18681 26 | find_memmove() = 0x5ff34734 27 | find_jumpto() = 0x5ff1e5ed 28 | find_aes_crypto_cmd() = 0x5ff208a5 29 | find_enter_critical_section() = 0x5ff1e9d1 30 | find_exit_critical_section() = 0x5ff1ea3d 31 | find_h2fmi_select() = 0x0 32 | find_create_envvar() = 0x5ff16ef1 33 | find_fs_mount() = 0x5ff22f69 34 | find_fs_loadfile() = 0x5ff231b5 35 | find_bdev_stack() = 0x5ff47208 36 | find_image_list() = 0x5ff44330 37 | ``` 38 | Have fun :) 39 | -------------------------------------------------------------------------------- /memmem.c: -------------------------------------------------------------------------------- 1 | /* 2 | * ibex - pseudo-library 3 | * 4 | * Copyright (c) 2015 xerub 5 | * Boyer-Moore-Horspool algorithm from Wikipedia 6 | * 7 | * This program is free software; you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation; either version 2 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | 22 | #include "plib.h" 23 | 24 | 25 | #define UCHAR_MAX 255 26 | 27 | unsigned char * 28 | boyermoore_horspool_memmem(const unsigned char* haystack, size_t hlen, 29 | const unsigned char* needle, size_t nlen) 30 | { 31 | size_t last, scan = 0; 32 | size_t bad_char_skip[UCHAR_MAX + 1]; /* Officially called: 33 | * bad character shift */ 34 | 35 | /* Sanity checks on the parameters */ 36 | if (nlen <= 0 || !haystack || !needle) 37 | return NULL; 38 | 39 | /* ---- Preprocess ---- */ 40 | /* Initialize the table to default value */ 41 | /* When a character is encountered that does not occur 42 | * in the needle, we can safely skip ahead for the whole 43 | * length of the needle. 44 | */ 45 | for (scan = 0; scan <= UCHAR_MAX; scan = scan + 1) 46 | bad_char_skip[scan] = nlen; 47 | 48 | /* C arrays have the first byte at [0], therefore: 49 | * [nlen - 1] is the last byte of the array. */ 50 | last = nlen - 1; 51 | 52 | /* Then populate it with the analysis of the needle */ 53 | for (scan = 0; scan < last; scan = scan + 1) 54 | bad_char_skip[needle[scan]] = last - scan; 55 | 56 | /* ---- Do the matching ---- */ 57 | 58 | /* Search the haystack, while the needle can still be within it. */ 59 | while (hlen >= nlen) 60 | { 61 | /* scan from the end of the needle */ 62 | for (scan = last; haystack[scan] == needle[scan]; scan = scan - 1) 63 | if (scan == 0) /* If the first byte matches, we've found it. */ 64 | return (void *)haystack; 65 | 66 | /* otherwise, we need to skip some bytes and start again. 67 | Note that here we are getting the skip value based on the last byte 68 | of needle, no matter where we didn't match. So if needle is: "abcd" 69 | then we are skipping based on 'd' and that value will be 4, and 70 | for "abcdd" we again skip on 'd' but the value will be only 1. 71 | The alternative of pretending that the mismatched character was 72 | the last character is slower in the normal case (E.g. finding 73 | "abcd" in "...azcd..." gives 4 by using 'd' but only 74 | 4-2==2 using 'z'. */ 75 | hlen -= bad_char_skip[haystack[last]]; 76 | haystack += bad_char_skip[haystack[last]]; 77 | } 78 | 79 | return NULL; 80 | } 81 | 82 | void * 83 | memmem(const void *haystack, size_t hlen, const void *needle, size_t nlen) 84 | { 85 | const unsigned char *h; 86 | const unsigned char *n; 87 | if (!nlen) { 88 | return (void *)haystack; 89 | } 90 | if (nlen > hlen) { 91 | return NULL; 92 | } 93 | if (nlen >= 4 && hlen >= 256) { 94 | return boyermoore_horspool_memmem(haystack, hlen, needle, nlen); 95 | } 96 | for (h = haystack, n = needle; hlen >= nlen; hlen--, h++) { 97 | if (*h == *n && !memcmp(h + 1, n + 1, nlen - 1)) { 98 | return (char *)h; 99 | } 100 | } 101 | return NULL; 102 | } 103 | -------------------------------------------------------------------------------- /plib.h: -------------------------------------------------------------------------------- 1 | /* 2 | * ibex - pseudo-library 3 | * 4 | * Copyright (c) 2010, 2014-2015 xerub 5 | * 6 | * This program is free software; you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation; either version 2 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | */ 19 | 20 | 21 | #ifndef PLIB_H_included 22 | #define PLIB_H_included 23 | 24 | #include 25 | #include 26 | 27 | #define ARRAY_SIZE(x) (sizeof(x)/sizeof(x[0])) 28 | 29 | #define AES_ENCRYPT 0x10 30 | #define AES_DECRYPT 0x11 31 | 32 | #define KBAG_IV_SIZE 0x10 33 | #define KBAG_KEY_SIZE 0x20 34 | #define KBAG_KEY_IV_SIZE (KBAG_IV_SIZE + KBAG_KEY_SIZE) 35 | 36 | #define SHSH_KEY 0x100 37 | #define GID_KEY 0x20000200 38 | #define UID_KEY 0x20000201 39 | 40 | struct linked_list { 41 | struct linked_list *prev; 42 | struct linked_list *next; 43 | }; 44 | 45 | typedef struct CmdArg { 46 | signed int integer; /* strtol(str, 0, 0) */ 47 | unsigned int uinteger; /* strtoul(str, 0, 0) */ 48 | signed int inthex; /* strtol(str, 0, 16) */ 49 | unsigned char boolean; /* evaluated from "true", "false" or CmdArg.integer */ 50 | char *string __attribute__((aligned(4))); 51 | } CmdArg; 52 | 53 | #ifndef TARGET_BASEADDR 54 | extern unsigned int TARGET_BASEADDR; 55 | #endif 56 | #ifndef TARGET_LOADADDR 57 | extern unsigned int TARGET_LOADADDR; 58 | #endif 59 | #ifndef TARGET_JUMPADDR 60 | extern unsigned int TARGET_JUMPADDR; 61 | #endif 62 | 63 | extern int version; 64 | 65 | typedef int (*printf_t)(const char *fmt, ...) __attribute__((format(printf, 1, 2))); 66 | extern printf_t printf_; 67 | 68 | typedef int (*snprintf_t)(char *buf, size_t max, const char *fmt, ...) __attribute__((format(printf, 3, 4))); 69 | extern snprintf_t snprintf_; 70 | 71 | typedef void *(*malloc_t)(size_t size); 72 | extern malloc_t malloc_; 73 | 74 | typedef void (*free_t)(void *ptr); 75 | extern free_t free_; 76 | 77 | typedef void *(*memmove_t)(void *dst, const void *src, size_t n); 78 | extern memmove_t memmove_; 79 | 80 | typedef int (*aes_crypto_cmd_t)(int crypt_type, void *inbuf, void *outbuf, unsigned int inbuf_len, unsigned int aes_key_type, char *iv, char *key); 81 | extern aes_crypto_cmd_t aes_crypto_cmd_; 82 | 83 | typedef void (*enter_critical_section_t)(void); 84 | extern enter_critical_section_t enter_critical_section_; 85 | 86 | typedef void (*exit_critical_section_t)(void); 87 | extern exit_critical_section_t exit_critical_section_; 88 | 89 | typedef void (*jumpto_t)(int, void *, int, int) __attribute__((noreturn)); 90 | extern jumpto_t jumpto_; 91 | 92 | typedef void *(*h2fmi_select_t)(void); 93 | extern h2fmi_select_t h2fmi_select_; 94 | 95 | typedef int (*create_envvar_t)(const char *var, const char *val, int wtf); 96 | extern create_envvar_t create_envvar_; 97 | 98 | typedef int (*fs_mount_t)(const char *partition, const char *fstype, const char *mountpoint); 99 | extern fs_mount_t fs_mount_; 100 | 101 | typedef int (*fs_loadfile_t)(const char* path, void *address, unsigned int *size); 102 | extern fs_loadfile_t fs_loadfile_; 103 | 104 | extern void *bdev_stack; 105 | extern void *image_list; 106 | 107 | /* our stuff */ 108 | 109 | extern unsigned int get_addr; 110 | extern unsigned int get_endp; 111 | 112 | void flush_icache(void); 113 | 114 | /* misc C stuff */ 115 | 116 | unsigned char * 117 | boyermoore_horspool_memmem(const unsigned char* haystack, size_t hlen, 118 | const unsigned char* needle, size_t nlen); 119 | 120 | int xtoi(const char *hptr); 121 | 122 | /* standard C stuff */ 123 | 124 | int atoi(const char *nptr); 125 | 126 | int strcmp(const char *s1, const char *s2); 127 | int memcmp(const void *b1, const void *b2, size_t len); 128 | void *memset(void *s, int c, size_t n); 129 | void *memmove(void *dest, const void *src, size_t n); 130 | void *memcpy(void *dest, const void *src, size_t n); 131 | void *memmem(const void* haystack, size_t hlen, const void* needle, size_t nlen); 132 | 133 | void _exit(int status) __attribute__((noreturn)); 134 | 135 | #endif 136 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2015, danzatt 3 | * All rights reserved. 4 | * 5 | * This program is free software: you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation, either version 3 of the License, or 8 | * (at your option) any later version. 9 | * 10 | * This program is distributed in the hope that it will be useful, 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | * GNU General Public License for more details. 14 | * 15 | * You should have received a copy of the GNU General Public License 16 | * along with this program. If not, see . 17 | * 18 | */ 19 | 20 | 21 | #include 22 | #include 23 | #include 24 | 25 | #include 26 | #include 27 | 28 | #include "plib.h" 29 | #include "link.c" 30 | 31 | #include "functions.c" 32 | 33 | #define handle_error(msg) \ 34 | do { perror(msg); exit(EXIT_FAILURE); } while (0) 35 | 36 | #define print_find_x(x) printf(#x " = 0x%x\n", (unsigned int) x) 37 | 38 | int main(int argc, char const *argv[]) { 39 | 40 | char *addr; 41 | int fd; 42 | struct stat sb; 43 | 44 | int ida = 0; 45 | 46 | if (argc == 3){ 47 | if (strcmp(argv[2], "-ida") == 0){ 48 | // printf("ida\n"); 49 | ida = 1; 50 | } 51 | } 52 | 53 | fd = open(argv[1], O_RDONLY); 54 | if (fd == -1) 55 | handle_error("open"); 56 | 57 | if (fstat(fd, &sb) == -1) /* To obtain file size */ 58 | handle_error("fstat"); 59 | 60 | 61 | addr = mmap((void *) TARGET_BASEADDR, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0); 62 | 63 | if (addr != TARGET_BASEADDR) { 64 | printf("cannot map properly to 0x%x\n", TARGET_BASEADDR); 65 | return 0; 66 | } 67 | 68 | 69 | if (addr == MAP_FAILED) 70 | handle_error("mmap"); 71 | 72 | IBOOT_LEN = sb.st_size; 73 | 74 | if (ida){ 75 | printf("setcmt;symbol found by ibex\n"); 76 | 77 | printf("printf;%x\n", find_printf()); 78 | printf("snprintf;%x\n", find_snprintf()); 79 | printf("malloc;%x\n", find_malloc()); 80 | printf("free;%x\n", find_free()); 81 | printf("memmove;%x\n", find_memmove()); 82 | printf("jumpto;%x\n", find_jumpto()); 83 | printf("aes_crypto_cmd;%x\n", find_aes_crypto_cmd()); 84 | printf("enter_critical_section;%x\n", find_enter_critical_section()); 85 | printf("exit_critical_section;%x\n", find_exit_critical_section()); 86 | printf("h2fmi_select;%x\n", find_h2fmi_select()); 87 | printf("create_envvar;%x\n", find_create_envvar()); 88 | printf("fs_mount;%x\n", find_fs_mount()); 89 | printf("fs_loadfile;%x\n", find_fs_loadfile()); 90 | printf("panic;%x\n", find_panic()); 91 | printf("main;%x\n", find_easy("main", sizeof("main") - 1)); 92 | printf("task_create;%x\n", find_task_create()); 93 | 94 | printf("bdev_stack;%x\n", find_bdev_stack()); 95 | printf("image_list;%x\n", find_image_list()); 96 | } else { 97 | 98 | printf("TARGET_BASEADDR 0x%x\n", TARGET_BASEADDR); 99 | printf("IBOOT_LEN 0x%x\n", IBOOT_LEN); 100 | printf("end 0x%x\n", IBOOT_LEN + TARGET_BASEADDR); 101 | printf("\n===========ibex===========\n"); 102 | printf("printf = 0x%x\n", find_printf()); 103 | printf("snprintf = 0x%x\n", find_snprintf()); 104 | printf("malloc = 0x%x\n", find_malloc()); 105 | printf("free = 0x%x\n", find_free()); 106 | printf("memmove = 0x%x\n", find_memmove()); 107 | printf("jumpto = 0x%x\n", find_jumpto()); 108 | printf("aes_crypto_cmd = 0x%x\n", find_aes_crypto_cmd()); 109 | printf("enter_critical_section = 0x%x\n", find_enter_critical_section()); 110 | printf("exit_critical_section = 0x%x\n", find_exit_critical_section()); 111 | printf("h2fmi_select = 0x%x\n", find_h2fmi_select()); 112 | printf("create_envvar = 0x%x\n", find_create_envvar()); 113 | printf("fs_mount = 0x%x\n", find_fs_mount()); 114 | printf("fs_loadfile = 0x%x\n", find_fs_loadfile()); 115 | printf("panic = 0x%x\n", find_panic()); 116 | printf("main = 0x%x\n", find_easy("main", sizeof("main") - 1)); 117 | printf("task_create = 0x%x\n", find_task_create()); 118 | 119 | printf("bdev_stack = 0x%x\n", find_bdev_stack()); 120 | printf("image_list = 0x%x\n", find_image_list()); 121 | } 122 | 123 | #ifdef USE_CYANIDE 124 | if (ida){ 125 | printf("setcmt;symbol found by cyanide\n"); 126 | 127 | for (int i = 0; i < (sizeof(functions)/sizeof(functions[0]) - 1); i++) { 128 | unsigned int 129 | x = find_function(functions[i][0], (unsigned char *) TARGET_BASEADDR, (unsigned char *) TARGET_BASEADDR); 130 | printf("%s;%x\n", functions[i][0], x); 131 | } 132 | 133 | } else { 134 | printf("\n==========cyanide=========\n"); 135 | 136 | for (int i = 0; i < (sizeof(functions)/sizeof(functions[0]) - 1); i++) { 137 | unsigned int 138 | x = find_function(functions[i][0], (unsigned char *) TARGET_BASEADDR, (unsigned char *) TARGET_BASEADDR); 139 | printf("%s = 0x%x\n", functions[i][0], x); 140 | } 141 | } 142 | #endif 143 | return 0; 144 | } 145 | -------------------------------------------------------------------------------- /functions.c: -------------------------------------------------------------------------------- 1 | /** 2 | * GreenPois0n Cynanide - functions.c 3 | * Copyright (C) 2010 Chronic-Dev Team 4 | * Copyright (C) 2010 Joshua Hill 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | **/ 19 | 20 | #include 21 | #include 22 | #include 23 | 24 | /*#include "task.h" 25 | #include "lock.h" 26 | #include "common.h" 27 | #include "commands.h"*/ 28 | 29 | static unsigned char push = 0xB5; 30 | static unsigned char push_r7_lr[] = { 0x80, 0xB5 }; 31 | static unsigned char push_r4_r7_lr[] = { 0x90, 0xB5 }; 32 | static unsigned char push_r4_to_r7_lr[] = { 0xF0, 0xB5 }; 33 | static unsigned char push_r4_r5_r7_lr[] = { 0xB0, 0xB5 }; 34 | 35 | static unsigned char* functions[][3] = { 36 | { "aes_crypto_cmd", "aes_crypto_cmd", push_r4_r7_lr }, 37 | { "free", "heap_panic", push_r4_to_r7_lr }, 38 | { "fs_mount", "fs_mount", push_r4_to_r7_lr }, 39 | { "cmd_ramdisk", "Ramdisk too large", push_r4_r5_r7_lr }, 40 | { "cmd_go", "jumping into image", push_r7_lr }, 41 | { "image_load", "image validation failed but untrusted images are permitted", push_r4_to_r7_lr }, 42 | { "fsboot", "root filesystem mount failed", push_r4_to_r7_lr }, 43 | { "kernel_load", "rd=md0", push_r4_to_r7_lr }, 44 | { "task_yield", "task_yield", push_r4_r5_r7_lr }, 45 | { "default_block_write", "no reasonable default block write routine", push_r7_lr }, 46 | { "populate_images", "image %p: bdev %p type %c%c%c%c offset 0x", push_r4_r5_r7_lr }, 47 | { "uart_read", "uart_read", push_r4_to_r7_lr }, 48 | { "uart_write", "uart_write", push_r4_to_r7_lr }, 49 | { "task_create", "task_create", push_r4_to_r7_lr }, 50 | { "task_exit", "task_exit", push_r4_to_r7_lr }, 51 | { "fs_open", "fs_open", push_r4_to_r7_lr }, 52 | { "dma_set_aes", "dma_set_aes", push_r4_to_r7_lr }, 53 | { "dma_generate_segments", "dma_generate_segments", push_r4_to_r7_lr }, 54 | { "dma_generate_aes_segments", "dma_generate_aes_segments", push_r4_to_r7_lr }, 55 | { "dma_cancel", "dma_cancel", push_r4_to_r7_lr }, 56 | { "dma_continue_async", "dma_continue_async", push_r4_to_r7_lr }, 57 | { "dma_int_handler", "dma_int_handler", push_r4_to_r7_lr }, 58 | { "cdma_init", "cdma_init", push_r4_to_r7_lr }, 59 | { "aes_hw_crypto_cmd", "aes_hw_crypto_cmd", push_r4_to_r7_lr }, 60 | { "displaypipe_init", "displaypipe_init", push_r4_to_r7_lr }, 61 | { "h2fmi_wait_dma_task_pending", "h2fmi_wait_dma_task_pending", push_r4_to_r7_lr }, 62 | { "h2fmi_pio_read_sector", "h2fmi_pio_read_sector", push_r4_to_r7_lr }, 63 | { "h2fmi_pio_write_sector", "h2fmi_pio_write_sector", push_r4_to_r7_lr }, 64 | { "h2fmi_wait_done", "h2fmi_wait_done", push_r4_to_r7_lr }, 65 | { "_memalign", "_memalign", push_r4_to_r7_lr }, 66 | { "_malloc", "_malloc", push_r4_to_r7_lr }, 67 | { "exit_critical_section", "exit_critical_section", push_r4_to_r7_lr }, 68 | { "enter_critical_section", "enter_critical_section", push_r4_to_r7_lr }, 69 | { "sha1_calculate", "sha1_calculate", push_r4_to_r7_lr }, 70 | { "nand_read_block_hook", "nand_read_block_hook", push_r4_to_r7_lr }, 71 | { "uart_set_mode", "uart_set_mode", push_r4_to_r7_lr }, 72 | { "uart_set_flow_control", "uart_set_flow_control", push_r4_to_r7_lr }, 73 | { "uart_set_baud_rate", "uart_set_baud_rate", push_r4_to_r7_lr }, 74 | { "hfs_init", "HFSInitPartition", push_r4_to_r7_lr }, 75 | { "h2fmiReadBootpage", "h2fmiReadBootpage", push_r4_to_r7_lr }, 76 | { "h2fmiWriteBootpage", "h2fmiWriteBootpage", push_r4_to_r7_lr }, 77 | { NULL, NULL, NULL } 78 | }; 79 | 80 | unsigned int find_reference(unsigned char* data, unsigned int base, unsigned int size, char* signature) { 81 | unsigned int i = 0; 82 | 83 | // First find the string 84 | unsigned int address = 0; 85 | for(i = 0; i < size; i++) { 86 | if(!memcmp(&data[i], signature, strlen(signature))) { 87 | address = base | i; 88 | break; 89 | } 90 | } 91 | if(address == 0) return NULL; 92 | 93 | // Next find where that string is referenced 94 | unsigned int reference = 0; 95 | for(i = 0; i < size; i++) { 96 | if(!memcmp(&data[i], &address, 4)) { 97 | reference = base | i; 98 | break; 99 | } 100 | } 101 | if(reference == 0) return NULL; 102 | reference -= 8; 103 | 104 | unsigned int reference2 = 0; 105 | for(i = 0; i < size; i++) { 106 | if(!memcmp(&data[i], &reference, 4)) { 107 | reference2 = base | i; 108 | break; 109 | } 110 | } 111 | if(reference2 == 0) return NULL; 112 | return reference2; 113 | } 114 | 115 | unsigned int find_top(unsigned char* data, unsigned int base, unsigned int size, unsigned int address) { 116 | // Find the top of that function 117 | int i = 0; 118 | unsigned int function = 0; 119 | while(i > 0) { 120 | i--; 121 | if(data[i] == push) { 122 | function = base | i; 123 | break; 124 | } 125 | } 126 | if(function == 0) return NULL; 127 | } 128 | 129 | unsigned int find_offset(unsigned char* data, unsigned int base, unsigned int size, unsigned char** what) { 130 | unsigned int i = 0; 131 | unsigned char* top = what[2]; 132 | unsigned char* name = what[0]; 133 | unsigned char* signature = what[1]; 134 | unsigned int dbase = (unsigned int) data; 135 | 136 | // First find the string 137 | unsigned int address = 0; 138 | for(i = 0; i < size; i++) { 139 | if(!memcmp(&data[i], signature, strlen(signature))) { 140 | address = base | i; 141 | break; 142 | } 143 | } 144 | if(address == 0) return NULL; 145 | 146 | // Next find where that string is referenced 147 | unsigned int reference = 0; 148 | for(i = 0; i < size; i++) { 149 | if(!memcmp(&data[i], &address, 4)) { 150 | reference = base | i; 151 | break; 152 | } 153 | } 154 | if(reference == 0) return NULL; 155 | 156 | // Finally find the top of that function 157 | unsigned int function = 0; 158 | while(i > 0) { 159 | i--; 160 | if(data[i] == push) { 161 | function = dbase | i; 162 | break; 163 | } 164 | } 165 | if(function == 0) return NULL; 166 | 167 | return function; 168 | } 169 | 170 | unsigned int find_string(unsigned char* data, unsigned int base, unsigned int size, const char* name) { 171 | // First find the string 172 | int i = 0; 173 | unsigned int address = 0; 174 | for(i = 0; i < size; i++) { 175 | if(!memcmp(&data[i], name, strlen(name))) { 176 | address = &data[i]; 177 | break; 178 | } 179 | } 180 | return address; 181 | } 182 | 183 | void* find_function(const char* name, unsigned char* target, unsigned char* base) { 184 | int i = 0; 185 | unsigned int found = 0; 186 | for(i = 0; i < sizeof(functions); i++) { 187 | if(!strcmp(functions[i][0], name)) { 188 | found = find_offset(target, base, 0x40000, functions[i]); 189 | if(found < 0) { 190 | return NULL; 191 | } 192 | break; 193 | } 194 | } 195 | 196 | return (void*) found; 197 | } 198 | -------------------------------------------------------------------------------- /link.c: -------------------------------------------------------------------------------- 1 | /* 2 | * ibex - link external symbols 3 | * 4 | * Copyright (c) 2010, 2015 xerub 5 | * Portions Copyright (c) 2015 iH8sn0w 6 | * 7 | * This program is free software; you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation; either version 2 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | 22 | #include "plib.h" 23 | #include "memmem.c" 24 | 25 | 26 | #ifndef TARGET_BASEADDR 27 | unsigned int TARGET_BASEADDR; 28 | #endif 29 | #ifndef TARGET_LOADADDR 30 | unsigned int TARGET_LOADADDR; 31 | #endif 32 | #ifndef TARGET_JUMPADDR 33 | unsigned int TARGET_JUMPADDR; 34 | #endif 35 | 36 | int version; 37 | 38 | 39 | unsigned int IBOOT_LEN = 0; 40 | 41 | #define MASK(x, y, z) (((x) >> (y)) & ((1 << (z)) - 1)) 42 | #define MAYBE_UNUSED __attribute__((unused)) static 43 | #define MAYBE_UNUSED_NORETURN __attribute__((unused, noreturn)) static 44 | 45 | /* much of the code below was snarfed from iDove v3 */ 46 | 47 | MAYBE_UNUSED void* pattern_search(const void* addr, int len, int pattern, int mask, int step) { 48 | int i; 49 | char* caddr = (char*)addr; 50 | if (len <= 0) 51 | return NULL; 52 | if (step < 0) { 53 | len = -len; 54 | len &= ~-(step+1); 55 | } else { 56 | len &= ~(step-1); 57 | } 58 | for (i = 0; i != len; i += step) { 59 | int x = *(int*)(caddr + i); 60 | if ((x & mask) == pattern) 61 | return (void*)(caddr + i); 62 | } 63 | return NULL; 64 | } 65 | 66 | MAYBE_UNUSED void* bl_search_down(const void* start_addr, int len) { 67 | /* BL pattern is xx Fx xx F8+ */ 68 | return pattern_search(start_addr, len, 0xD000F000, 0xD000F800, 2); 69 | } 70 | 71 | MAYBE_UNUSED void* blx_search_down(const void* start_addr, int len) { 72 | return pattern_search(start_addr, len, 0xC000F000, 0xD001F800, 2); 73 | } 74 | 75 | MAYBE_UNUSED void* bw_search_down(const void* start_addr, int len) { 76 | return pattern_search(start_addr, len, 0x9000F000, 0xD000F800, 2); 77 | } 78 | 79 | MAYBE_UNUSED void* ldr_search_down(const void* start_addr, int len) { 80 | /* LDR pattern is xx xx 48 xx ( 00 00 f8 00 ) */ 81 | return pattern_search(start_addr, len, 0x00004800, 0x0000F800, 2); 82 | } 83 | 84 | MAYBE_UNUSED void* ldr_search_up(const void* start_addr, int len) { 85 | /* LDR pattern is xx xx 48 xx ( 00 00 f8 00 ) */ 86 | return pattern_search(start_addr, len, 0x00004800, 0x0000F800, -2); 87 | } 88 | 89 | MAYBE_UNUSED void* ldr32_search_up(const void* start_addr, int len) { 90 | /* LDR32 pattern is DF F8 xx xx */ 91 | return pattern_search(start_addr, len, 0x0000F8DF, 0x0000FFFF, -2); 92 | } 93 | 94 | MAYBE_UNUSED void* ldr_to(const void* loc) { 95 | int dw, ldr_target; 96 | int xref_target = (int)loc; 97 | int i = xref_target; 98 | int min_addr = xref_target - 0x420; 99 | for(; i > min_addr; i -= 2) { 100 | i = (int)ldr_search_up((void*)i, i - min_addr); 101 | if (i == 0) { 102 | return NULL; 103 | } 104 | 105 | dw = *(int*)i; 106 | ldr_target = ((i + 4) & ~3) + ((dw & 0xff) << 2); 107 | if (ldr_target == xref_target) { 108 | return (void*)i; 109 | } 110 | i -= 2; 111 | } 112 | 113 | i = xref_target; 114 | min_addr = xref_target - 0x1000; 115 | for(; i > min_addr; i -= 4) { 116 | i = (int)ldr32_search_up((void*)i, i - min_addr); 117 | if (i == 0) { 118 | break; 119 | } 120 | dw = *(int*)i; 121 | ldr_target = ((i + 4) & ~3) + ((dw >> 16) & 0xfff); 122 | if (ldr_target == xref_target) { 123 | return (void*)i; 124 | } 125 | } 126 | return NULL; 127 | } 128 | 129 | MAYBE_UNUSED void* push_lr_search_up(const void* start_addr, int len) { 130 | /* F0 B5 <-- PUSH LR */ 131 | /* F0 BD <-- POP PC */ 132 | return pattern_search(start_addr, len, 0x0000B580, 0x0000FF80, -2); 133 | } 134 | 135 | MAYBE_UNUSED void* resolve_bl32(const void* bl) { 136 | int jump = 0; 137 | unsigned short bits = ((unsigned short *)bl)[0]; 138 | unsigned short exts = ((unsigned short *)bl)[1]; 139 | jump |= MASK(bits, 10, 1) << 24; 140 | jump |= (~(MASK(bits, 10, 1) ^ MASK(exts, 13, 1)) & 0x1) << 23; 141 | jump |= (~(MASK(bits, 10, 1) ^ MASK(exts, 11, 1)) & 0x1) << 22; 142 | jump |= MASK(bits, 0, 10) << 12; 143 | jump |= MASK(exts, 0, 11) << 1; 144 | jump |= MASK(exts, 12, 1); 145 | jump <<= 7; 146 | jump >>= 7; 147 | return (void*)((int)bl + 4 + jump); 148 | } 149 | 150 | MAYBE_UNUSED const void * 151 | find32(const void *buffer, size_t len, unsigned int value) 152 | { 153 | const unsigned int *p = (const unsigned int *)buffer; 154 | for (len /= 4; len--; p++) { 155 | if (*p == value) { 156 | return p; 157 | } 158 | } 159 | return NULL; 160 | } 161 | 162 | MAYBE_UNUSED const void * 163 | find_xref(const char *pattern, size_t patlen) 164 | { 165 | const unsigned char *str = boyermoore_horspool_memmem((void *)TARGET_BASEADDR, IBOOT_LEN, (void *)pattern, patlen); 166 | const void *ref = NULL; 167 | if (str) { 168 | ref = find32((void *)TARGET_BASEADDR, IBOOT_LEN, (unsigned int)str); 169 | } 170 | return ref; 171 | } 172 | 173 | MAYBE_UNUSED const void * 174 | find_easy(const char *pattern, size_t patlen) 175 | { 176 | const char *fn; 177 | const void *mm = find_xref(pattern, patlen); 178 | if (!mm) { 179 | return NULL; 180 | } 181 | fn = push_lr_search_up(mm, 0x200); 182 | if (!fn) { 183 | return NULL; 184 | } 185 | return fn + 1; 186 | } 187 | 188 | MAYBE_UNUSED printf_t 189 | find_printf(void) 190 | { 191 | const void *ldr; 192 | const void *bl; 193 | const void *mm = find_xref("jumping into image at", sizeof("jumping into image at") - 1); 194 | if (!mm) { 195 | return NULL; 196 | } 197 | ldr = ldr_to(mm); 198 | if (!ldr) { 199 | return NULL; 200 | } 201 | bl = bl_search_down(ldr, 8); 202 | if (!bl) { 203 | return NULL; 204 | } 205 | return (printf_t)(int)resolve_bl32(bl); 206 | } 207 | 208 | MAYBE_UNUSED snprintf_t 209 | find_snprintf(void) 210 | { 211 | const void *ldr; 212 | const void *bl; 213 | const void *mm = find_xref("CPID:", sizeof("CPID:") - 1); 214 | if (!mm) { 215 | return NULL; 216 | } 217 | ldr = ldr_to(mm); 218 | if (!ldr) { 219 | return NULL; 220 | } 221 | bl = bl_search_down(ldr, 40); 222 | if (!bl) { 223 | return NULL; 224 | } 225 | return (snprintf_t)(int)resolve_bl32(bl); 226 | } 227 | 228 | MAYBE_UNUSED malloc_t 229 | find_malloc(void) 230 | { 231 | return (malloc_t)(int)find_easy("_malloc must allocate at least one byte", sizeof("_malloc must allocate at least one byte") - 1); 232 | } 233 | 234 | MAYBE_UNUSED free_t 235 | find_free(void) 236 | { 237 | const unsigned int *pop; 238 | const void *mm = find_xref("heap_add_chunk", sizeof("heap_add_chunk") - 1); 239 | if (!mm) { 240 | return NULL; 241 | } 242 | pop = pattern_search(mm, 0x200, 0x40F0E8BD, 0xFFFFFFFF, -2); 243 | if (!pop) { 244 | return NULL; 245 | } 246 | return (free_t)(int)resolve_bl32(pop + 1); 247 | } 248 | 249 | MAYBE_UNUSED memmove_t 250 | find_memmove(void) 251 | { 252 | const void *ldr; 253 | const void *blx; 254 | const void *mm = find_xref("double panic in ", sizeof("double panic in ") - 1); 255 | if (!mm) { 256 | return NULL; 257 | } 258 | ldr = ldr_to(mm); 259 | if (!ldr) { 260 | return NULL; 261 | } 262 | blx = blx_search_down(ldr, 16); 263 | if (!blx) { 264 | return NULL; 265 | } 266 | return (memmove_t)((int)resolve_bl32(blx) & ~2); 267 | } 268 | 269 | MAYBE_UNUSED jumpto_t 270 | find_jumpto(void) 271 | { 272 | const void *ldr; 273 | const void *pr; 274 | const void *bl; 275 | const void *mm = find_xref("jumping into image at", sizeof("jumping into image at") - 1); 276 | if (!mm) { 277 | return NULL; 278 | } 279 | ldr = ldr_to(mm); 280 | if (!ldr) { 281 | return NULL; 282 | } 283 | pr = bl_search_down(ldr, 8); 284 | if (!pr) { 285 | return NULL; 286 | } 287 | bl = bl_search_down((char *)pr + 4, 20); 288 | if (!bl) { 289 | bl = bw_search_down((char *)pr + 4, 24); 290 | if (!bl) { 291 | return NULL; 292 | } 293 | } 294 | return (jumpto_t)(int)resolve_bl32(bl); 295 | } 296 | 297 | MAYBE_UNUSED aes_crypto_cmd_t 298 | find_aes_crypto_cmd(void) 299 | { 300 | return (aes_crypto_cmd_t)(int)find_easy("aes_crypto_cmd", sizeof("aes_crypto_cmd") - 1); 301 | } 302 | 303 | MAYBE_UNUSED enter_critical_section_t 304 | find_enter_critical_section(void) 305 | { 306 | return (enter_critical_section_t)(int)find_easy("enter_critical_section", sizeof("enter_critical_section") - 1); 307 | } 308 | 309 | MAYBE_UNUSED exit_critical_section_t 310 | find_exit_critical_section(void) 311 | { 312 | return (exit_critical_section_t)(int)find_easy("exit_critical_section", sizeof("exit_critical_section") - 1); 313 | } 314 | 315 | MAYBE_UNUSED h2fmi_select_t 316 | find_h2fmi_select(void) 317 | { 318 | const void *fn; 319 | const void *bl; 320 | const void *mm = NULL; 321 | const unsigned char *str = boyermoore_horspool_memmem((void *)TARGET_BASEADDR, IBOOT_LEN, (void *)"nand_syscfg", sizeof("nand_syscfg") - 1); 322 | if (str) { 323 | const char *tmp = find32((void *)TARGET_BASEADDR, IBOOT_LEN, (unsigned int)str); 324 | if (tmp) { 325 | mm = find32(tmp + 4, TARGET_BASEADDR + IBOOT_LEN - (unsigned int)tmp - 4, (unsigned int)str); 326 | } 327 | } 328 | if (!mm) { 329 | return NULL; 330 | } 331 | fn = push_lr_search_up(mm, 0x200); 332 | if (!fn) { 333 | return NULL; 334 | } 335 | bl = bl_search_down(fn, 32); 336 | if (!bl) { 337 | return NULL; 338 | } 339 | return (h2fmi_select_t)(int)resolve_bl32(bl); 340 | } 341 | 342 | MAYBE_UNUSED create_envvar_t 343 | find_create_envvar(void) 344 | { 345 | const void *ldr; 346 | const void *bl; 347 | const void *mm = find_xref("build-style", sizeof("build-style") - 1); 348 | if (!mm) { 349 | return NULL; 350 | } 351 | ldr = ldr_to(mm); 352 | if (!ldr) { 353 | return NULL; 354 | } 355 | bl = bl_search_down(ldr, 32); 356 | if (!bl) { 357 | return NULL; 358 | } 359 | return (create_envvar_t)(int)resolve_bl32(bl); 360 | } 361 | 362 | MAYBE_UNUSED fs_mount_t 363 | find_fs_mount(void) 364 | { 365 | return (fs_mount_t)(int)find_easy("fs_mount:", sizeof("fs_mount:") - 1); 366 | } 367 | 368 | MAYBE_UNUSED fs_loadfile_t 369 | find_fs_loadfile(void) 370 | { 371 | const char *fn; 372 | const void *mm = NULL; 373 | const unsigned char *str = boyermoore_horspool_memmem((void *)TARGET_BASEADDR, IBOOT_LEN, (void *)"Permission Denied", sizeof("Permission Denied") - 1); 374 | if (str) { 375 | const char *tmp = find32((void *)TARGET_BASEADDR, IBOOT_LEN, (unsigned int)str); 376 | while (tmp) { 377 | mm = tmp; 378 | tmp = find32(tmp + 4, TARGET_BASEADDR + IBOOT_LEN - (unsigned int)tmp - 4, (unsigned int)str); 379 | } 380 | } 381 | if (!mm) { 382 | return NULL; 383 | } 384 | fn = push_lr_search_up(mm, 0x200); 385 | if (!fn) { 386 | return NULL; 387 | } 388 | return (fs_loadfile_t)(int)(fn + 1); 389 | } 390 | 391 | MAYBE_UNUSED void * 392 | find_bdev_stack(void) 393 | { 394 | const void *bl; 395 | unsigned ldr; 396 | const void *mm = find_easy("nand_firmware", sizeof("nand_firmware") - 1); 397 | if (!mm) { 398 | mm = find_easy("nor0", sizeof("nor0") - 1); 399 | if (!mm) { 400 | return NULL; 401 | } 402 | } 403 | bl = bl_search_down((void *)((unsigned)mm & ~1), 16); 404 | if (!bl) { 405 | return NULL; 406 | } 407 | bl = resolve_bl32(bl); 408 | if (!bl) { 409 | return NULL; 410 | } 411 | ldr = (unsigned)ldr_search_down((void *)((unsigned)bl & ~1), 16); 412 | if (!ldr) { 413 | return NULL; 414 | } 415 | return ((void **)(ldr & ~3))[*(unsigned char *)ldr + 1]; 416 | } 417 | 418 | MAYBE_UNUSED void * 419 | find_image_list(void) 420 | { 421 | const void *mm = find_xref("image %p: bdev %p type %c%c%c%c offset 0x%llx", sizeof("image %p: bdev %p type %c%c%c%c offset 0x%llx") - 1); 422 | if (!mm) { 423 | return NULL; 424 | } 425 | return ((void **)mm)[-1]; 426 | } 427 | 428 | MAYBE_UNUSED int 429 | find_panic(void) 430 | { 431 | return (int)find_easy("double panic in ", sizeof("double panic in ") - 1) - 2; 432 | } 433 | 434 | MAYBE_UNUSED const void * 435 | find_task_create(void) 436 | { 437 | const char *fn; 438 | void *ldr; 439 | void *bl; 440 | const void *mm = find_xref("main", sizeof("main") - 1); 441 | if (!mm) { 442 | return NULL; 443 | } 444 | 445 | ldr = ldr_search_up(mm, 0x32); 446 | bl = bl_search_down(ldr, 0x32); 447 | 448 | fn = resolve_bl32(bl); 449 | 450 | return fn; 451 | } 452 | -------------------------------------------------------------------------------- /import_symbols.py: -------------------------------------------------------------------------------- 1 | """ 2 | * Copyright 2015, danzatt 3 | * All rights reserved. 4 | * 5 | * This program is free software: you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation, either version 3 of the License, or 8 | * (at your option) any later version. 9 | * 10 | * This program is distributed in the hope that it will be useful, 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | * GNU General Public License for more details. 14 | * 15 | * You should have received a copy of the GNU General Public License 16 | * along with this program. If not, see . 17 | * 18 | """ 19 | 20 | #quite a mess 21 | 22 | rename_count = 0 23 | 24 | #=============================== helpers ======================================= 25 | 26 | def is_sub_start(addr): 27 | funct = GetFunctionName(addr) #get parent subroutine 28 | return addr == LocByName(funct) 29 | 30 | def append_comment(ea, name): 31 | if name != "" or name != None: 32 | 33 | if RptCmt(ea) != None and name in RptCmt(ea): 34 | return 35 | 36 | cmt = "" 37 | 38 | if RptCmt(ea) != None: 39 | cmt += RptCmt(ea) + "\n" 40 | cmt += name 41 | MakeRptCmt(ea, cmt) 42 | 43 | def append_function_comment(ea, name): 44 | if name != "" or name != None: 45 | 46 | if GetFunctionCmt(ea, 0) != None and name in GetFunctionCmt(ea, 0): 47 | return 48 | 49 | cmt = "" 50 | 51 | if GetFunctionCmt(ea, 0) != None: 52 | cmt += GetFunctionCmt(ea, 0) + "\n" 53 | cmt += name 54 | SetFunctionCmt(ea, cmt, 0) 55 | 56 | def rename(ea, name, optional_prefix): 57 | if LocByName(name) == ea: 58 | return 59 | 60 | if LocByName(name) != BADADDR: #name is already used 61 | name = optional_prefix + "_" + name 62 | if LocByName(name) != BADADDR: #if even prefixed name is taken 63 | return 64 | 65 | print "%s -> %s" % (hex(ea), name) 66 | MakeName(ea, name) 67 | global rename_count 68 | rename_count += 1 69 | 70 | def resolve(pc): 71 | if Name(pc).startswith("dword_") or Name(pc).startswith("off_"): 72 | pc = get_32(pc) 73 | return pc 74 | 75 | def rename_complicated(addr, name, optional_prefix = "", cmt = ""): 76 | if Name(addr) == name: 77 | return 78 | elif (is_sub_start(addr)): 79 | if GetFunctionName(addr).startswith("sub_"): 80 | rename(addr, name, optional_prefix) 81 | append_function_comment(addr, cmt) 82 | else: 83 | append_function_comment(addr, name) 84 | append_function_comment(addr, cmt) 85 | elif (Name(addr) == "" or Name(addr).startswith("loc_") or Name(addr).startswith("dword_")): 86 | rename(addr, name, optional_prefix) 87 | append_comment(addr, cmt) 88 | else: 89 | print "%s already has name \"%s\" (should be changed to %s)" % (hex(addr), Name(addr), name) 90 | append_comment(addr, name) 91 | append_comment(addr, cmt) 92 | 93 | def get_32(addr): 94 | 95 | if addr is BADADDR or type(addr) is not int: 96 | print "get_32: BADADDR" 97 | return BADADDR 98 | 99 | ret = 0 100 | ret |= Byte(addr) 101 | ret |= Byte(addr+1) << 8 102 | ret |= Byte(addr+2) << 8*2 103 | ret |= Byte(addr+3) << 8*3 104 | 105 | return ret 106 | 107 | def xref_cnt(ea): 108 | ret = 0 109 | for xref in XrefsTo(ea, 0): 110 | ret += 1 111 | return ret 112 | 113 | def is_valid_reg(reg, getnum = False): 114 | if reg in ["SP", "LR", "PC"]: 115 | if getnum: 116 | return -1 117 | return True 118 | 119 | if not reg.startswith("R"): 120 | return False 121 | if len(reg) > 3: 122 | return False 123 | num = reg[1:] 124 | if not num.isdigit(): 125 | return False 126 | num = int(num) 127 | if not num in range(13): #12+ have special names in IDA 128 | return False 129 | if len(reg) == 3 and reg[1] == "0": 130 | return False 131 | if getnum: 132 | return num 133 | return True 134 | 135 | #"emulation", not even close but works 136 | def whats_in_reg(pc, reg): 137 | startaddr = pc 138 | #print "startaddr", hex(startaddr) 139 | has_xrefs = xref_cnt(pc) > 1 140 | insn = DecodeInstruction(pc) 141 | 142 | if not is_valid_reg(reg): 143 | print "unsupported reg" 144 | return [] 145 | 146 | for idx in xrange(32): 147 | #print "pc=", hex(pc) 148 | if insn == None: 149 | return [] 150 | 151 | mnem = GetMnem(pc) 152 | 153 | #print hex(pc), mnem 154 | 155 | if not has_xrefs: 156 | 157 | if mnem in ["LDR", "LDR.W"] and GetOpnd(pc, 0) == reg: 158 | val = GetOperandValue(pc, 1) 159 | return [val] if val is not None else [] 160 | 161 | elif mnem in ["MOV", "MOVS"] and GetOpnd(pc, 0) == reg: 162 | src = GetOpnd(pc, 1) 163 | if is_valid_reg(src): 164 | reg = src 165 | else: 166 | if src.startswith("#"): 167 | src = src[1:] 168 | if src.startswith("0x"): 169 | src = src[2:] 170 | if not src.isdigit(): 171 | return [BADADDR] 172 | src = int(src, 16) 173 | 174 | if type(src) != int: 175 | return [BADADDR] 176 | return [src] 177 | 178 | elif mnem == "BL" and reg: 179 | if idx == 0: 180 | insn, has_xrefs = DecodePrecedingInstruction(pc) 181 | if insn is None: 182 | return [] 183 | pc = insn.ip 184 | continue #if it's our first insn we determine the reg value before BL 185 | if is_valid_reg(reg, True) in range(0,3) or reg == "LR": #R0-R3 may be affected by BL 186 | #print hex(pc), "cannot go back due to BL. startaddr =", hex(startaddr) 187 | return [] 188 | 189 | else: 190 | #print hex(pc),"xrefs=", xref_cnt(pc) 191 | ret = [] 192 | for xref in XrefsTo(pc, 0): 193 | res = whats_in_reg(xref.frm, reg) 194 | if res is not None: 195 | ret.extend(res) 196 | return ret 197 | 198 | insn, has_xrefs = DecodePrecedingInstruction(pc) 199 | if insn is None: 200 | return [] 201 | pc = insn.ip 202 | return [] 203 | 204 | #========================== rename from file =================================== 205 | 206 | path = AskFile(0, "*", "Choose file exported by ibex_find") 207 | 208 | cmt = "" 209 | 210 | print path 211 | if path != None: 212 | lines = [line.rstrip('\n') for line in open(path)] 213 | 214 | for line in lines: 215 | a = line.split(";") 216 | 217 | if len(a) != 2: 218 | continue 219 | 220 | if a[0] == "setcmt": 221 | cmt = a[1] 222 | print cmt 223 | continue 224 | 225 | (name, addr) = a 226 | 227 | #print "name %s addr %s" % (name, addr) 228 | 229 | addr = int(addr, 16) 230 | 231 | if addr == 0: 232 | continue 233 | 234 | is_thumb = GetReg(addr, "T") 235 | insn_size = 2 if is_thumb else 4 236 | addr -= addr % insn_size #align 237 | 238 | #change "symbol found by ibex" into just "ibex" 239 | optional_prefix = cmt.split(" ")[-1] 240 | 241 | rename_complicated(addr, name, optional_prefix, cmt) 242 | 243 | #========================= rename exception vector ============================= 244 | 245 | pc = Segments().next() #Segments() returns generator, we grab the 1st element 246 | vector_table = [ 247 | { 248 | "name": "Reset", 249 | "comment": "Processor is reset or started" 250 | }, 251 | { 252 | "name": "Undef", 253 | "comment": "An undefined instruction is encountered. Usually this is from an erroneous branch or corruption of code, but can also be used for emulating instruction sets on processors which do not support them." 254 | }, 255 | { 256 | "name": "Swi", 257 | "comment": "A \"Software Interrupt\" is generated, by the SWI/SVC command. This is most often used to perform system calls: Code in user mode invokes the instruction, and the processor shifts to supervisor mode, to a predefined system call handler" 258 | }, 259 | { 260 | "name": "PrefAbt", 261 | "comment": "Instruction Prefetch abort" 262 | }, 263 | { 264 | "name": "DataAbt", 265 | "comment": "Data Abort" 266 | }, 267 | { 268 | "name": "AddrExc", 269 | "comment": "An Address Exception (invalid address) is encountered" 270 | }, 271 | { 272 | "name": "IRQ", 273 | "comment": "An Interrupt Request is singaled: The CPU stops everything and transfers control to the interrupt handler." 274 | }, 275 | { 276 | "name": "FIQ", 277 | "comment": "A Fast Interrupt Request is singaled: The CPU stops everything and transfers control to the interrupt handler. Other interrupts are blocked during the time." 278 | } 279 | ] 280 | 281 | reset = BADADDR 282 | im_not_that_dumb = True 283 | 284 | for a in vector_table: 285 | #print hex(pc), a["name"], a["comment"] 286 | handler_addr = 0 287 | if GetMnem(pc) == "LDR" and GetOpnd(pc, 0) == "PC": 288 | off = GetOperandValue(pc, 1) #this actually isn't offset because IDA has resolved it for us 289 | 290 | #string_addr = GetManyBytes(off, 4) 291 | #print string_addr.encode("hex") 292 | 293 | handler_addr = get_32(off) 294 | 295 | if GetMnem(pc) == "B": 296 | handler_addr = GetOperandValue(pc, 0) 297 | 298 | #print hex(handler_addr) 299 | rename_complicated(handler_addr, a["name"] + "_handler", cmt = "" if im_not_that_dumb else a["comment"]) 300 | 301 | if a["name"] == "Reset": 302 | reset = handler_addr # pedanticness, always is at BASE + 0x40 303 | 304 | pc += DecodeInstruction(pc).size 305 | 306 | #======================= add mode names to comment ============================= 307 | 308 | """ 309 | User All 0b10000 310 | FIQ - Fast Interrupt Request All 0b10001 311 | IRQ - Interrupt Request All 0b10010 312 | Supervisor All 0b10011 313 | Abort All 0b10111 314 | Undefined All 0b11011 315 | System ARMv4 and above 0b11111 316 | Monitor Security Extensions only 0b10110 317 | """ 318 | 319 | modes = { 320 | 0b10000: "User", 321 | 0b10001: "FIQ", 322 | 0b10010: "IRQ", 323 | 0b10011: "Supervisor", 324 | 0b10111: "Abort", 325 | 0b11011: "Undefined", 326 | 0b11111: "System", 327 | 0b10110: "Monitor" 328 | } 329 | 330 | insns_eaten = 0 331 | pc = reset 332 | 333 | while insns_eaten < 60: 334 | #print hex(pc), "eating,",GetMnem(pc) 335 | 336 | size = DecodeInstruction(pc).size 337 | 338 | if GetMnem(pc) == "ORR" and GetMnem(pc + size) == "MSR": 339 | mode = GetOperandValue(pc, 2) 340 | #print hex(mode) 341 | if mode != -1: 342 | append_comment(pc, modes[mode]) 343 | 344 | pc += size 345 | insns_eaten += 1 346 | 347 | """ 348 | iBoot contains calls to panic with R0 pointing to the function name. We find 349 | "panic" function, follow every xref and go back at most 15 instructions while 350 | looking for "LDR R0, xxx". Due to ARM xxx is offset to nearby 32bit address. 351 | That adress is the actual absolute address to the string. We read the string 352 | (which is the function name) and rename the parent subroutine (if any) 353 | or the location of panic call accordingly. 354 | """ 355 | 356 | print "===============renaming panics================" 357 | 358 | panic = LocByName("panic") 359 | if panic != BADADDR: 360 | for xref in XrefsTo(panic, 0): 361 | 362 | #print xref.type, XrefTypeName(xref.type), 'from', hex(xref.frm), 'to', hex(xref.to) 363 | 364 | pc = xref.frm 365 | function_name = None 366 | pc -= DecodePreviousInstruction(pc).size 367 | #print "calling whats_in_reg", hex(pc) 368 | r1 = whats_in_reg(pc, "R0") 369 | 370 | for val in r1: 371 | if val == BADADDR: 372 | continue 373 | 374 | #print "val = ", hex(val), " => ", hex(get_32(val)) 375 | name = GetString(get_32(val)) 376 | 377 | if name is not None: 378 | #print hex(pc), "->", name 379 | 380 | funct = GetFunctionName(pc) 381 | 382 | if funct != "": # if location belongs to subroutine 383 | rename_complicated(LocByName(funct), name, cmt="discovered by looking for [XREF]") 384 | else: 385 | rename_complicated(pc, name, cmt="discovered by looking for [XREF]") 386 | 387 | 388 | """ 389 | for _ in xrange(15): 390 | pc -= DecodePreviousInstruction(pc).size 391 | if GetMnem(pc) == "LDR" and GetOpnd(pc, 0) == "R0": 392 | off = GetOperandValue(pc, 1) #this actually isn't offset because IDA has resolved it for us 393 | 394 | #string_addr = GetManyBytes(off, 4) 395 | #print string_addr.encode("hex") 396 | 397 | string_addr = 0 398 | 399 | string_addr = get_32(off) 400 | 401 | #print hex(string_addr) 402 | function_name = GetString(string_addr) 403 | 404 | #if LocByName(function_name) == BADADDR: 405 | 406 | funct = GetFunctionName(xref.frm) 407 | 408 | if funct != "": # if location belongs to subroutine 409 | rename_complicated(LocByName(funct), function_name) 410 | else: 411 | rename_complicated(xref.frm, function_name) 412 | 413 | break 414 | 415 | if function_name != None: 416 | #print "resolved name", function_name 417 | pass 418 | else: 419 | print "couldn't resolve name at ", xref.frm 420 | """ 421 | else: 422 | print "couldn't find panic when you find it re-run this plugin" 423 | 424 | 425 | """ 426 | Calls to task_create pass the task name in R0. We do the very same thing as above. 427 | """ 428 | print "================renaming tasks================" 429 | 430 | task_create = LocByName("task_create") 431 | if task_create != BADADDR: 432 | for xref in XrefsTo(task_create, 0): 433 | 434 | pc = xref.frm 435 | 436 | task_handler = resolve(whats_in_reg(pc, "R1")[0]) 437 | task_name = resolve(whats_in_reg(pc, "R0")[0]) 438 | task_name = GetString(task_name) 439 | 440 | #print hex(task_handler), "->", GetString(task_name), hex(task_name) 441 | 442 | funct = GetFunctionName(task_handler) 443 | 444 | if funct != "": # if location belongs to subroutine 445 | rename_complicated(LocByName(funct), "task_" + task_name.replace(" ", "_").replace("-", "_"), cmt=task_name) 446 | else: 447 | rename_complicated(task_handler, "task_" + task_name.replace(" ", "_").replace("-", "_"), cmt=task_name) 448 | 449 | 450 | """ 451 | function_name = None 452 | 453 | for _ in xrange(15): 454 | pc -= DecodePreviousInstruction(pc).size 455 | if GetMnem(pc) == "LDR" and GetOpnd(pc, 0) == "R0": 456 | off = GetOperandValue(pc, 1) #this actually isn't offset because IDA has resolved it for us 457 | 458 | #string_addr = GetManyBytes(off, 4) 459 | #print string_addr.encode("hex") 460 | 461 | string_addr = 0 462 | 463 | string_addr = get_32(off) 464 | 465 | #print hex(string_addr) 466 | function_name = GetString(string_addr) 467 | 468 | #if LocByName(function_name) == BADADDR: 469 | 470 | funct = GetFunctionName(xref.frm) 471 | 472 | if funct != "": # if location belongs to subroutine 473 | rename_complicated(LocByName(funct), function_name.replace(" ", "_") + "_task", cmt=function_name) 474 | else: 475 | rename_complicated(xref.frm, function_name.replace(" ", "_") + "_task", cmt=function_name) 476 | 477 | break 478 | 479 | if function_name != None: 480 | #print "resolved name", function_name 481 | pass 482 | else: 483 | print "couldn't resolve name at ", xref.frm 484 | """ 485 | print "================[NAND] strings================" 486 | 487 | base = Segments().next() #Segments() returns generator, we grab the 1st element 488 | #base = BADADDR # <---------------------- NOTICE ME 489 | 490 | nand_panic = BADADDR 491 | 492 | for string in Strings(): 493 | if str(string).startswith("[NAND] "): 494 | absolute_addr = FindBinary(base, SEARCH_DOWN, hex(string.ea)[2:]) 495 | #print "absolute_addr=", hex(absolute_addr) 496 | 497 | for a in XrefsTo(absolute_addr, 0): 498 | #print hex(a.frm), "\t", GetDisasm(a.frm) 499 | 500 | pc = a.frm 501 | 502 | #look for BL downwards 503 | while GetMnem(pc) != "BL": 504 | if GetMnem(pc) == "B": 505 | pc = GetOperandValue(pc, 0) #follow unconditional branch 506 | continue 507 | #print "pc=", hex(pc) 508 | pc += DecodeInstruction(pc).size 509 | 510 | if GetOperandValue(pc, 0) != nand_panic and nand_panic != BADADDR: 511 | print "[W]: Different nand_panic's" 512 | 513 | nand_panic = GetOperandValue(pc, 0) 514 | 515 | r1 = whats_in_reg(pc, "R1") 516 | 517 | for val in r1: 518 | if val == BADADDR: 519 | continue 520 | 521 | #print "val = ", hex(val), " => ", hex(get_32(val)) 522 | name = GetString(get_32(val)) 523 | 524 | if name is not None: 525 | # print hex(pc), "->", name 526 | 527 | funct = GetFunctionName(pc) 528 | 529 | if funct != "": # if location belongs to subroutine 530 | rename_complicated(LocByName(funct), name, cmt="discovered by looking for [NAND]") 531 | else: 532 | rename_complicated(pc, name, cmt="discovered by looking for [NAND]") 533 | 534 | print "=====================XREF=====================" 535 | 536 | rename_complicated(nand_panic, "nand_panic") 537 | 538 | for a in XrefsTo(nand_panic): 539 | pc = a.frm 540 | 541 | #look for BL downwards 542 | while GetMnem(pc) != "BL": 543 | if GetMnem(pc) == "B": 544 | pc = GetOperandValue(pc, 0) #follow unconditional branch 545 | continue 546 | #print "pc=", hex(pc) 547 | pc += DecodeInstruction(pc).size 548 | 549 | r1 = whats_in_reg(pc, "R1") 550 | 551 | for val in r1: 552 | if val == BADADDR: 553 | continue 554 | 555 | #print "val = ", hex(val), " => ", hex(get_32(val)) 556 | name = GetString(get_32(val)) 557 | 558 | if name is not None: 559 | #print hex(pc), "->", name 560 | 561 | funct = GetFunctionName(pc) 562 | 563 | if funct != "": # if location belongs to subroutine 564 | rename_complicated(LocByName(funct), name, cmt="discovered by looking for [XREF]") 565 | else: 566 | rename_complicated(pc, name, cmt="discovered by looking for [XREF]") 567 | """ 568 | for string in Strings(): 569 | absolute_addr = FindBinary(base, SEARCH_DOWN, hex(string.ea)[2:]) 570 | #print "absolute_addr=", hex(absolute_addr) 571 | 572 | for a in XrefsTo(absolute_addr, 0): 573 | print string, "used at", hex(a.frm) 574 | """ 575 | print "Renamed total of %i functions for you. Have fun :)" % rename_count 576 | 577 | 578 | 579 | """ 580 | #TODO: complete this 581 | 582 | #terribly broken 583 | def whats_in_regs(pc, regs, lvl=0, alias = {}): 584 | lvl+=1 585 | orig_regs = regs 586 | 587 | print "looking for", regs 588 | 589 | ret = {} 590 | #alias = {} 591 | 592 | def add_alias(alias, orig, aliases): 593 | if alias in aliases: 594 | aliases[alias].extend([orig]) 595 | else: 596 | aliases[alias] = [orig] 597 | 598 | has_xrefs = xref_cnt(pc) > 1 599 | insn = DecodeInstruction(pc) 600 | 601 | for reg in regs: 602 | if not is_valid_reg(reg): 603 | print "unsupported reg", reg 604 | return [BADADDR] 605 | 606 | for idx in xrange(256): 607 | 608 | if len(ret) >= len(orig_regs): 609 | return [ret] 610 | 611 | if insn == None: 612 | return [ret] 613 | 614 | mnem = GetMnem(pc) 615 | 616 | #print hex(pc), mnem 617 | 618 | if not has_xrefs: 619 | 620 | if mnem in ["LDR", "LDR.W"]: 621 | 622 | dst = GetOpnd(pc, 0) 623 | val = GetOperandValue(pc, 1) 624 | 625 | #LDR R6, [SP,#0xXX+var_XX] 626 | if GetOpnd(pc, 1).startswith("["): 627 | val = BADADDR 628 | 629 | if dst in regs: 630 | ret[dst] = val 631 | regs.remove(dst) 632 | 633 | if dst in alias: 634 | original_names = alias[dst] 635 | for name in original_names: 636 | print "alias=", alias 637 | print "name", name 638 | print "original_names", original_names 639 | print "alias[dst]=", alias[dst] 640 | print "pc=", hex(pc) 641 | print lvl*"\t", "ret=", ret 642 | print lvl*"\t", "ret[", name,"] =", val 643 | ret[name] = val 644 | alias.remove(dst) 645 | 646 | elif mnem in ["MOV", "MOVS"]: 647 | src = GetOpnd(pc, 1) 648 | dst = GetOpnd(pc, 0) 649 | 650 | if is_valid_reg(dst): 651 | if dst in regs: 652 | add_alias(dst, regs, alias) 653 | regs.remove(dst) 654 | 655 | if dst in alias: 656 | if src in alias: 657 | alias[src].extend(alias[dst]) 658 | else: 659 | alias[src] = alias[dst] 660 | del alias[dst] 661 | 662 | elif mnem == "BL" and reg: 663 | if idx == 0: 664 | pc -= insn.size 665 | continue #if it's our first insn we determine the reg value before BL 666 | 667 | if is_valid_reg(reg, True) in range(0,3) or reg == "LR": #R0-R3 may be affected by BL 668 | print hex(pc), "cannot go back due to BL" 669 | return [BADADDR] 670 | 671 | else: 672 | 673 | print hex(pc),"xrefs=", xref_cnt(pc) 674 | 675 | missing_regs = [] 676 | 677 | for reg in orig_regs: 678 | if reg not in ret: 679 | missing_regs.append(reg) 680 | print lvl*"\t", "missing_regs", missing_regs 681 | 682 | 683 | for xref in XrefsTo(pc, 0): 684 | aa = whats_in_regs(xref.frm, missing_regs, lvl=lvl) 685 | print lvl*"\t", "recursion returned", 686 | 687 | #ret.extend(whats_in_reg(xref.frm, reg)) 688 | return ret 689 | 690 | pc -= insn.size 691 | insn, has_xrefs = DecodePrecedingInstruction(pc) 692 | 693 | print whats_in_regs(here(), AskStr("R0", "What regs ?").split(" ")) 694 | """ 695 | -------------------------------------------------------------------------------- /gpl.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------