├── .gitattributes ├── Hook ├── fishhook.c ├── fishhook.h ├── hook.c ├── hook.h ├── mach_excServer.c ├── mach_excServer.h └── patch.h ├── LICENSE ├── Makefile ├── README.md ├── Tweak.xm ├── control └── hookjailed.plist /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /Hook/fishhook.c: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2013, Facebook, Inc. 2 | // All rights reserved. 3 | // Redistribution and use in source and binary forms, with or without 4 | // modification, are permitted provided that the following conditions are met: 5 | // * Redistributions of source code must retain the above copyright notice, 6 | // this list of conditions and the following disclaimer. 7 | // * Redistributions in binary form must reproduce the above copyright notice, 8 | // this list of conditions and the following disclaimer in the documentation 9 | // and/or other materials provided with the distribution. 10 | // * Neither the name Facebook nor the names of its contributors may be used to 11 | // endorse or promote products derived from this software without specific 12 | // prior written permission. 13 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 14 | // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 15 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 16 | // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE 17 | // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 18 | // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 19 | // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 20 | // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 21 | // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 22 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23 | 24 | #include "fishhook.h" 25 | 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | #include 37 | #include 38 | 39 | #if __has_include() 40 | #include 41 | #endif 42 | 43 | #ifdef __LP64__ 44 | typedef struct mach_header_64 mach_header_t; 45 | typedef struct segment_command_64 segment_command_t; 46 | typedef struct section_64 section_t; 47 | typedef struct nlist_64 nlist_t; 48 | #define LC_SEGMENT_ARCH_DEPENDENT LC_SEGMENT_64 49 | #else 50 | typedef struct mach_header mach_header_t; 51 | typedef struct segment_command segment_command_t; 52 | typedef struct section section_t; 53 | typedef struct nlist nlist_t; 54 | #define LC_SEGMENT_ARCH_DEPENDENT LC_SEGMENT 55 | #endif 56 | 57 | #ifndef SEG_DATA_CONST 58 | #define SEG_DATA_CONST "__DATA_CONST" 59 | #endif 60 | 61 | struct rebindings_entry { 62 | struct rebinding *rebindings; 63 | size_t rebindings_nel; 64 | struct rebindings_entry *next; 65 | }; 66 | 67 | static struct rebindings_entry *_rebindings_head; 68 | 69 | static int prepend_rebindings(struct rebindings_entry **rebindings_head, 70 | struct rebinding rebindings[], 71 | size_t nel) { 72 | struct rebindings_entry *new_entry = (struct rebindings_entry *) malloc(sizeof(struct rebindings_entry)); 73 | if (!new_entry) { 74 | return -1; 75 | } 76 | new_entry->rebindings = (struct rebinding *) malloc(sizeof(struct rebinding) * nel); 77 | if (!new_entry->rebindings) { 78 | free(new_entry); 79 | return -1; 80 | } 81 | memcpy(new_entry->rebindings, rebindings, sizeof(struct rebinding) * nel); 82 | new_entry->rebindings_nel = nel; 83 | new_entry->next = *rebindings_head; 84 | *rebindings_head = new_entry; 85 | return 0; 86 | } 87 | 88 | #if 0 89 | static int get_protection(void *addr, vm_prot_t *prot, vm_prot_t *max_prot) { 90 | mach_port_t task = mach_task_self(); 91 | vm_size_t size = 0; 92 | vm_address_t address = (vm_address_t)addr; 93 | memory_object_name_t object; 94 | #ifdef __LP64__ 95 | mach_msg_type_number_t count = VM_REGION_BASIC_INFO_COUNT_64; 96 | vm_region_basic_info_data_64_t info; 97 | kern_return_t info_ret = vm_region_64( 98 | task, &address, &size, VM_REGION_BASIC_INFO_64, (vm_region_info_64_t)&info, &count, &object); 99 | #else 100 | mach_msg_type_number_t count = VM_REGION_BASIC_INFO_COUNT; 101 | vm_region_basic_info_data_t info; 102 | kern_return_t info_ret = vm_region(task, &address, &size, VM_REGION_BASIC_INFO, (vm_region_info_t)&info, &count, &object); 103 | #endif 104 | if (info_ret == KERN_SUCCESS) { 105 | if (prot != NULL) 106 | *prot = info.protection; 107 | 108 | if (max_prot != NULL) 109 | *max_prot = info.max_protection; 110 | 111 | return 0; 112 | } 113 | 114 | return -1; 115 | } 116 | #endif 117 | 118 | static void perform_rebinding_with_section(struct rebindings_entry *rebindings, 119 | section_t *section, 120 | intptr_t slide, 121 | nlist_t *symtab, 122 | char *strtab, 123 | uint32_t *indirect_symtab) { 124 | uint32_t *indirect_symbol_indices = indirect_symtab + section->reserved1; 125 | void **indirect_symbol_bindings = (void **)((uintptr_t)slide + section->addr); 126 | 127 | for (uint i = 0; i < section->size / sizeof(void *); i++) { 128 | uint32_t symtab_index = indirect_symbol_indices[i]; 129 | if (symtab_index == INDIRECT_SYMBOL_ABS || symtab_index == INDIRECT_SYMBOL_LOCAL || 130 | symtab_index == (INDIRECT_SYMBOL_LOCAL | INDIRECT_SYMBOL_ABS)) { 131 | continue; 132 | } 133 | uint32_t strtab_offset = symtab[symtab_index].n_un.n_strx; 134 | char *symbol_name = strtab + strtab_offset; 135 | bool symbol_name_longer_than_1 = symbol_name[0] && symbol_name[1]; 136 | struct rebindings_entry *cur = rebindings; 137 | while (cur) { 138 | for (uint j = 0; j < cur->rebindings_nel; j++) { 139 | if (symbol_name_longer_than_1 && strcmp(&symbol_name[1], cur->rebindings[j].name) == 0) { 140 | kern_return_t err; 141 | 142 | if (cur->rebindings[j].replaced != NULL && indirect_symbol_bindings[i] != cur->rebindings[j].replacement) 143 | *(cur->rebindings[j].replaced) = indirect_symbol_bindings[i]; 144 | 145 | /** 146 | * 1. Moved the vm protection modifying codes to here to reduce the 147 | * changing scope. 148 | * 2. Adding VM_PROT_WRITE mode unconditionally because vm_region 149 | * API on some iOS/Mac reports mismatch vm protection attributes. 150 | * -- Lianfu Hao Jun 16th, 2021 151 | **/ 152 | err = vm_protect (mach_task_self (), (uintptr_t)indirect_symbol_bindings, section->size, 0, VM_PROT_READ | VM_PROT_WRITE | VM_PROT_COPY); 153 | if (err == KERN_SUCCESS) { 154 | /** 155 | * Once we failed to change the vm protection, we 156 | * MUST NOT continue the following write actions! 157 | * iOS 15 has corrected the const segments prot. 158 | * -- Lionfore Hao Jun 11th, 2021 159 | **/ 160 | #if !__has_feature(ptrauth_calls) && 0 // FIXME: build on Linux 161 | indirect_symbol_bindings[i] = cur->rebindings[j].replacement; 162 | #else 163 | void *replacement = cur->rebindings[j].replacement; 164 | if (!strcmp(section->sectname, "__auth_got")) { 165 | void *stripped = ptrauth_strip(replacement, ptrauth_key_process_independent_code); 166 | replacement = ptrauth_sign_unauthenticated(stripped, ptrauth_key_process_independent_code, &indirect_symbol_bindings[i]); 167 | } 168 | indirect_symbol_bindings[i] = replacement; 169 | #endif 170 | } 171 | goto symbol_loop; 172 | } 173 | } 174 | cur = cur->next; 175 | } 176 | symbol_loop:; 177 | } 178 | } 179 | 180 | static void rebind_symbols_for_image(struct rebindings_entry *rebindings, 181 | const struct mach_header *header, 182 | intptr_t slide) { 183 | Dl_info info; 184 | if (dladdr(header, &info) == 0) { 185 | return; 186 | } 187 | 188 | segment_command_t *cur_seg_cmd; 189 | segment_command_t *linkedit_segment = NULL; 190 | struct symtab_command* symtab_cmd = NULL; 191 | struct dysymtab_command* dysymtab_cmd = NULL; 192 | 193 | uintptr_t cur = (uintptr_t)header + sizeof(mach_header_t); 194 | for (uint i = 0; i < header->ncmds; i++, cur += cur_seg_cmd->cmdsize) { 195 | cur_seg_cmd = (segment_command_t *)cur; 196 | if (cur_seg_cmd->cmd == LC_SEGMENT_ARCH_DEPENDENT) { 197 | if (strcmp(cur_seg_cmd->segname, SEG_LINKEDIT) == 0) { 198 | linkedit_segment = cur_seg_cmd; 199 | } 200 | } else if (cur_seg_cmd->cmd == LC_SYMTAB) { 201 | symtab_cmd = (struct symtab_command*)cur_seg_cmd; 202 | } else if (cur_seg_cmd->cmd == LC_DYSYMTAB) { 203 | dysymtab_cmd = (struct dysymtab_command*)cur_seg_cmd; 204 | } 205 | } 206 | 207 | if (!symtab_cmd || !dysymtab_cmd || !linkedit_segment || 208 | !dysymtab_cmd->nindirectsyms) { 209 | return; 210 | } 211 | 212 | // Find base symbol/string table addresses 213 | uintptr_t linkedit_base = (uintptr_t)slide + linkedit_segment->vmaddr - linkedit_segment->fileoff; 214 | nlist_t *symtab = (nlist_t *)(linkedit_base + symtab_cmd->symoff); 215 | char *strtab = (char *)(linkedit_base + symtab_cmd->stroff); 216 | 217 | // Get indirect symbol table (array of uint32_t indices into symbol table) 218 | uint32_t *indirect_symtab = (uint32_t *)(linkedit_base + dysymtab_cmd->indirectsymoff); 219 | 220 | cur = (uintptr_t)header + sizeof(mach_header_t); 221 | for (uint i = 0; i < header->ncmds; i++, cur += cur_seg_cmd->cmdsize) { 222 | cur_seg_cmd = (segment_command_t *)cur; 223 | if (cur_seg_cmd->cmd == LC_SEGMENT_ARCH_DEPENDENT) { 224 | if (strcmp(cur_seg_cmd->segname, SEG_DATA) != 0 && 225 | strcmp(cur_seg_cmd->segname, SEG_DATA_CONST) != 0) { 226 | continue; 227 | } 228 | for (uint j = 0; j < cur_seg_cmd->nsects; j++) { 229 | section_t *sect = 230 | (section_t *)(cur + sizeof(segment_command_t)) + j; 231 | if ((sect->flags & SECTION_TYPE) == S_LAZY_SYMBOL_POINTERS) { 232 | perform_rebinding_with_section(rebindings, sect, slide, symtab, strtab, indirect_symtab); 233 | } 234 | if ((sect->flags & SECTION_TYPE) == S_NON_LAZY_SYMBOL_POINTERS) { 235 | perform_rebinding_with_section(rebindings, sect, slide, symtab, strtab, indirect_symtab); 236 | } 237 | } 238 | } 239 | } 240 | } 241 | 242 | static void _rebind_symbols_for_image(const struct mach_header *header, 243 | intptr_t slide) { 244 | rebind_symbols_for_image(_rebindings_head, header, slide); 245 | } 246 | 247 | int rebind_symbols_image(void *header, 248 | intptr_t slide, 249 | struct rebinding rebindings[], 250 | size_t rebindings_nel) { 251 | struct rebindings_entry *rebindings_head = NULL; 252 | int retval = prepend_rebindings(&rebindings_head, rebindings, rebindings_nel); 253 | rebind_symbols_for_image(rebindings_head, (const struct mach_header *) header, slide); 254 | if (rebindings_head) { 255 | free(rebindings_head->rebindings); 256 | } 257 | free(rebindings_head); 258 | return retval; 259 | } 260 | 261 | int rebind_symbols(struct rebinding rebindings[], size_t rebindings_nel) { 262 | int retval = prepend_rebindings(&_rebindings_head, rebindings, rebindings_nel); 263 | if (retval < 0) { 264 | return retval; 265 | } 266 | // If this was the first call, register callback for image additions (which is also invoked for 267 | // existing images, otherwise, just run on existing images 268 | if (!_rebindings_head->next) { 269 | _dyld_register_func_for_add_image(_rebind_symbols_for_image); 270 | } else { 271 | uint32_t c = _dyld_image_count(); 272 | for (uint32_t i = 0; i < c; i++) { 273 | _rebind_symbols_for_image(_dyld_get_image_header(i), _dyld_get_image_vmaddr_slide(i)); 274 | } 275 | } 276 | return retval; 277 | } 278 | -------------------------------------------------------------------------------- /Hook/fishhook.h: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2013, Facebook, Inc. 2 | // All rights reserved. 3 | // Redistribution and use in source and binary forms, with or without 4 | // modification, are permitted provided that the following conditions are met: 5 | // * Redistributions of source code must retain the above copyright notice, 6 | // this list of conditions and the following disclaimer. 7 | // * Redistributions in binary form must reproduce the above copyright notice, 8 | // this list of conditions and the following disclaimer in the documentation 9 | // and/or other materials provided with the distribution. 10 | // * Neither the name Facebook nor the names of its contributors may be used to 11 | // endorse or promote products derived from this software without specific 12 | // prior written permission. 13 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 14 | // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 15 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 16 | // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE 17 | // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 18 | // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 19 | // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 20 | // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 21 | // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 22 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23 | 24 | #ifndef fishhook_h 25 | #define fishhook_h 26 | 27 | #include 28 | #include 29 | 30 | #if !defined(FISHHOOK_EXPORT) 31 | #define FISHHOOK_VISIBILITY __attribute__((visibility("hidden"))) 32 | #else 33 | #define FISHHOOK_VISIBILITY __attribute__((visibility("default"))) 34 | #endif 35 | 36 | #ifdef __cplusplus 37 | extern "C" { 38 | #endif //__cplusplus 39 | 40 | /* 41 | * A structure representing a particular intended rebinding from a symbol 42 | * name to its replacement 43 | */ 44 | struct rebinding { 45 | const char *name; 46 | void *replacement; 47 | void **replaced; 48 | }; 49 | 50 | /* 51 | * For each rebinding in rebindings, rebinds references to external, indirect 52 | * symbols with the specified name to instead point at replacement for each 53 | * image in the calling process as well as for all future images that are loaded 54 | * by the process. If rebind_functions is called more than once, the symbols to 55 | * rebind are added to the existing list of rebindings, and if a given symbol 56 | * is rebound more than once, the later rebinding will take precedence. 57 | */ 58 | FISHHOOK_VISIBILITY 59 | int rebind_symbols(struct rebinding rebindings[], size_t rebindings_nel); 60 | 61 | /* 62 | * Rebinds as above, but only in the specified image. The header should point 63 | * to the mach-o header, the slide should be the slide offset. Others as above. 64 | */ 65 | FISHHOOK_VISIBILITY 66 | int rebind_symbols_image(void *header, 67 | intptr_t slide, 68 | struct rebinding rebindings[], 69 | size_t rebindings_nel); 70 | 71 | #ifdef __cplusplus 72 | } 73 | #endif //__cplusplus 74 | 75 | #endif //fishhook_h 76 | 77 | -------------------------------------------------------------------------------- /Hook/hook.c: -------------------------------------------------------------------------------- 1 | #include "hook.h" 2 | #include "mach_excServer.h" 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | kern_return_t catch_mach_exception_raise( 14 | mach_port_t exception_port, 15 | mach_port_t thread, 16 | mach_port_t task, 17 | exception_type_t exception, 18 | mach_exception_data_t code, 19 | mach_msg_type_number_t codeCnt) { 20 | abort(); // will call only if not hooked 21 | } 22 | 23 | kern_return_t catch_mach_exception_raise_state_identity( 24 | mach_port_t exception_port, 25 | mach_port_t thread, 26 | mach_port_t task, 27 | exception_type_t exception, 28 | mach_exception_data_t code, 29 | mach_msg_type_number_t codeCnt, 30 | int *flavor, 31 | thread_state_t old_state, 32 | mach_msg_type_number_t old_stateCnt, 33 | thread_state_t new_state, 34 | mach_msg_type_number_t *new_stateCnt) { 35 | abort(); // will call only if not hooked 36 | } 37 | 38 | mach_port_t server; 39 | 40 | struct hook { 41 | uintptr_t old; 42 | uintptr_t new; 43 | }; 44 | static struct hook hooks[16]; 45 | static int active_hooks; 46 | 47 | kern_return_t catch_mach_exception_raise_state( 48 | mach_port_t exception_port, 49 | exception_type_t exception, 50 | const mach_exception_data_t code, 51 | mach_msg_type_number_t codeCnt, 52 | int *flavor, 53 | const thread_state_t old_state, 54 | mach_msg_type_number_t old_stateCnt, 55 | thread_state_t new_state, 56 | mach_msg_type_number_t *new_stateCnt) { 57 | arm_thread_state64_t *old = (arm_thread_state64_t *)old_state; 58 | arm_thread_state64_t *new = (arm_thread_state64_t *)new_state; 59 | 60 | for (int i = 0; i < active_hooks; ++i) { 61 | if (hooks[i].old == arm_thread_state64_get_pc(*old)) { 62 | *new = *old; 63 | *new_stateCnt = old_stateCnt; 64 | 65 | // set our method to call after breakpoint trigger 66 | arm_thread_state64_set_pc_fptr(*new, hooks[i].new); 67 | return KERN_SUCCESS; 68 | } 69 | } 70 | 71 | return KERN_FAILURE; 72 | } 73 | 74 | void *exception_handler(void *unused) { 75 | mach_msg_server(mach_exc_server, sizeof(union __RequestUnion__catch_mach_exc_subsystem), server, MACH_MSG_OPTION_NONE); 76 | abort(); 77 | } 78 | 79 | bool hook(void *old[], void *new[], int count) { 80 | if (count > 6) return false; 81 | 82 | static bool initialized; 83 | static int breakpoints; 84 | if (!initialized) { 85 | // get active breakpoints 86 | size_t size = sizeof(breakpoints); 87 | sysctlbyname("hw.optional.breakpoint", &breakpoints, &size, NULL, 0); // usually 6 88 | 89 | // enable exception handler 90 | mach_port_allocate(mach_task_self(), MACH_PORT_RIGHT_RECEIVE, &server) != KERN_SUCCESS; 91 | mach_port_insert_right(mach_task_self(), server, server, MACH_MSG_TYPE_MAKE_SEND) != KERN_SUCCESS; 92 | task_set_exception_ports(mach_task_self(), EXC_MASK_BREAKPOINT, server, EXCEPTION_STATE | MACH_EXCEPTION_CODES, ARM_THREAD_STATE64) != KERN_SUCCESS; 93 | 94 | pthread_t thread; 95 | pthread_create(&thread, NULL, exception_handler, NULL); 96 | 97 | initialized = true; 98 | } 99 | 100 | if (count > breakpoints) return false; 101 | 102 | // add breakpoints 103 | arm_debug_state64_t state = {}; 104 | for (int i = 0; i < count; i++) { 105 | // breakpoint address 106 | state.__bvr[i] = (uintptr_t)old[i]; 107 | 108 | //enable breakpoint 109 | state.__bcr[i] = 0x1e5; 110 | 111 | hooks[i] = (struct hook){(uintptr_t)old[i], (uintptr_t)new[i]}; 112 | active_hooks = count; 113 | } 114 | 115 | // setup debug mode with our breakpoints for task 116 | if (task_set_state(mach_task_self(), ARM_DEBUG_STATE64, (thread_state_t)&state, ARM_DEBUG_STATE64_COUNT) != KERN_SUCCESS) return false; 117 | 118 | thread_act_array_t threads; 119 | mach_msg_type_number_t thread_count = ARM_DEBUG_STATE64_COUNT; 120 | task_threads(mach_task_self(), &threads, &thread_count); 121 | bool success = true; 122 | 123 | // setup debug mode with our breakpoints for all threads 124 | for (int i = 0; i < thread_count; ++i) if (thread_set_state(threads[i], ARM_DEBUG_STATE64, (thread_state_t)&state, ARM_DEBUG_STATE64_COUNT) != KERN_SUCCESS) success = false; 125 | 126 | // clear 127 | for (int i = 0; i < thread_count; ++i) mach_port_deallocate(mach_task_self(), threads[i]); 128 | vm_deallocate(mach_task_self(), (vm_address_t)threads, thread_count * sizeof(*threads)); 129 | 130 | return success; 131 | } 132 | -------------------------------------------------------------------------------- /Hook/hook.h: -------------------------------------------------------------------------------- 1 | #ifndef hook_h 2 | #define hook_h 3 | 4 | #ifdef __cplusplus 5 | extern "C" { 6 | #endif 7 | 8 | #include 9 | 10 | bool hook(void *o[], void *n[], int c); 11 | 12 | #ifdef __cplusplus 13 | } 14 | #endif 15 | 16 | #endif /* hook_h */ 17 | -------------------------------------------------------------------------------- /Hook/mach_excServer.c: -------------------------------------------------------------------------------- 1 | /* 2 | * IDENTIFICATION: 3 | * stub generated by bootstrap_cmds-129 4 | * OPTIONS: 5 | */ 6 | 7 | /* Module mach_exc */ 8 | 9 | #define __MIG_check__Request__mach_exc_subsystem__ 1 10 | 11 | #include "mach_excServer.h" 12 | 13 | #ifndef mig_internal 14 | #define mig_internal static __inline__ 15 | #endif /* mig_internal */ 16 | 17 | #ifndef mig_external 18 | #define mig_external 19 | #endif /* mig_external */ 20 | 21 | #if !defined(__MigTypeCheck) && defined(TypeCheck) 22 | #define __MigTypeCheck TypeCheck /* Legacy setting */ 23 | #endif /* !defined(__MigTypeCheck) */ 24 | 25 | #if !defined(__MigKernelSpecificCode) && defined(_MIG_KERNEL_SPECIFIC_CODE_) 26 | #define __MigKernelSpecificCode _MIG_KERNEL_SPECIFIC_CODE_ /* Legacy setting */ 27 | #endif /* !defined(__MigKernelSpecificCode) */ 28 | 29 | #ifndef LimitCheck 30 | #define LimitCheck 0 31 | #endif /* LimitCheck */ 32 | 33 | #ifndef min 34 | #define min(a,b) ( ((a) < (b))? (a): (b) ) 35 | #endif /* min */ 36 | 37 | #if !defined(_WALIGN_) 38 | #define _WALIGN_(x) (((x) + 3) & ~3) 39 | #endif /* !defined(_WALIGN_) */ 40 | 41 | #if !defined(_WALIGNSZ_) 42 | #define _WALIGNSZ_(x) _WALIGN_(sizeof(x)) 43 | #endif /* !defined(_WALIGNSZ_) */ 44 | 45 | #ifndef UseStaticTemplates 46 | #define UseStaticTemplates 0 47 | #endif /* UseStaticTemplates */ 48 | 49 | #ifndef MIG_SERVER_ROUTINE 50 | #define MIG_SERVER_ROUTINE 51 | #endif 52 | 53 | #ifndef __DeclareRcvRpc 54 | #define __DeclareRcvRpc(_NUM_, _NAME_) 55 | #endif /* __DeclareRcvRpc */ 56 | 57 | #ifndef __BeforeRcvRpc 58 | #define __BeforeRcvRpc(_NUM_, _NAME_) 59 | #endif /* __BeforeRcvRpc */ 60 | 61 | #ifndef __AfterRcvRpc 62 | #define __AfterRcvRpc(_NUM_, _NAME_) 63 | #endif /* __AfterRcvRpc */ 64 | 65 | #ifndef __DeclareRcvSimple 66 | #define __DeclareRcvSimple(_NUM_, _NAME_) 67 | #endif /* __DeclareRcvSimple */ 68 | 69 | #ifndef __BeforeRcvSimple 70 | #define __BeforeRcvSimple(_NUM_, _NAME_) 71 | #endif /* __BeforeRcvSimple */ 72 | 73 | #ifndef __AfterRcvSimple 74 | #define __AfterRcvSimple(_NUM_, _NAME_) 75 | #endif /* __AfterRcvSimple */ 76 | 77 | #define novalue void 78 | 79 | #define msgh_request_port msgh_local_port 80 | #define MACH_MSGH_BITS_REQUEST(bits) MACH_MSGH_BITS_LOCAL(bits) 81 | #define msgh_reply_port msgh_remote_port 82 | #define MACH_MSGH_BITS_REPLY(bits) MACH_MSGH_BITS_REMOTE(bits) 83 | 84 | #define MIG_RETURN_ERROR(X, code) {\ 85 | ((mig_reply_error_t *)X)->RetCode = code;\ 86 | ((mig_reply_error_t *)X)->NDR = NDR_record;\ 87 | return;\ 88 | } 89 | 90 | /* Forward Declarations */ 91 | 92 | 93 | mig_internal novalue _Xmach_exception_raise 94 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP); 95 | 96 | mig_internal novalue _Xmach_exception_raise_state 97 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP); 98 | 99 | mig_internal novalue _Xmach_exception_raise_state_identity 100 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP); 101 | 102 | 103 | #if ( __MigTypeCheck ) 104 | #if __MIG_check__Request__mach_exc_subsystem__ 105 | #if !defined(__MIG_check__Request__mach_exception_raise_t__defined) 106 | #define __MIG_check__Request__mach_exception_raise_t__defined 107 | 108 | mig_internal kern_return_t __MIG_check__Request__mach_exception_raise_t(__attribute__((__unused__)) __Request__mach_exception_raise_t *In0P) 109 | { 110 | 111 | typedef __Request__mach_exception_raise_t __Request; 112 | #if __MigTypeCheck 113 | unsigned int msgh_size; 114 | #endif /* __MigTypeCheck */ 115 | 116 | #if __MigTypeCheck 117 | msgh_size = In0P->Head.msgh_size; 118 | if (!(In0P->Head.msgh_bits & MACH_MSGH_BITS_COMPLEX) || 119 | (In0P->msgh_body.msgh_descriptor_count != 2) || 120 | (msgh_size < (mach_msg_size_t)(sizeof(__Request) - 16)) || (msgh_size > (mach_msg_size_t)sizeof(__Request))) 121 | return MIG_BAD_ARGUMENTS; 122 | #endif /* __MigTypeCheck */ 123 | 124 | #if __MigTypeCheck 125 | if (In0P->thread.type != MACH_MSG_PORT_DESCRIPTOR || 126 | In0P->thread.disposition != 17) 127 | return MIG_TYPE_ERROR; 128 | #endif /* __MigTypeCheck */ 129 | 130 | #if __MigTypeCheck 131 | if (In0P->task.type != MACH_MSG_PORT_DESCRIPTOR || 132 | In0P->task.disposition != 17) 133 | return MIG_TYPE_ERROR; 134 | #endif /* __MigTypeCheck */ 135 | 136 | #if defined(__NDR_convert__int_rep__Request__mach_exception_raise_t__codeCnt__defined) 137 | if (In0P->NDR.int_rep != NDR_record.int_rep) 138 | __NDR_convert__int_rep__Request__mach_exception_raise_t__codeCnt(&In0P->codeCnt, In0P->NDR.int_rep); 139 | #endif /* __NDR_convert__int_rep__Request__mach_exception_raise_t__codeCnt__defined */ 140 | #if __MigTypeCheck 141 | if ( In0P->codeCnt > 2 ) 142 | return MIG_BAD_ARGUMENTS; 143 | if (((msgh_size - (mach_msg_size_t)(sizeof(__Request) - 16)) / 8 < In0P->codeCnt) || 144 | (msgh_size != (mach_msg_size_t)(sizeof(__Request) - 16) + (8 * In0P->codeCnt))) 145 | return MIG_BAD_ARGUMENTS; 146 | #endif /* __MigTypeCheck */ 147 | 148 | return MACH_MSG_SUCCESS; 149 | } 150 | #endif /* !defined(__MIG_check__Request__mach_exception_raise_t__defined) */ 151 | #endif /* __MIG_check__Request__mach_exc_subsystem__ */ 152 | #endif /* ( __MigTypeCheck ) */ 153 | 154 | 155 | /* Routine mach_exception_raise */ 156 | mig_internal novalue _Xmach_exception_raise 157 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP) 158 | { 159 | 160 | #ifdef __MigPackStructs 161 | #pragma pack(push, 4) 162 | #endif 163 | typedef struct { 164 | mach_msg_header_t Head; 165 | /* start of the kernel processed data */ 166 | mach_msg_body_t msgh_body; 167 | mach_msg_port_descriptor_t thread; 168 | mach_msg_port_descriptor_t task; 169 | /* end of the kernel processed data */ 170 | NDR_record_t NDR; 171 | exception_type_t exception; 172 | mach_msg_type_number_t codeCnt; 173 | int64_t code[2]; 174 | mach_msg_trailer_t trailer; 175 | } Request __attribute__((unused)); 176 | #ifdef __MigPackStructs 177 | #pragma pack(pop) 178 | #endif 179 | typedef __Request__mach_exception_raise_t __Request; 180 | typedef __Reply__mach_exception_raise_t Reply __attribute__((unused)); 181 | 182 | /* 183 | * typedef struct { 184 | * mach_msg_header_t Head; 185 | * NDR_record_t NDR; 186 | * kern_return_t RetCode; 187 | * } mig_reply_error_t; 188 | */ 189 | 190 | Request *In0P = (Request *) InHeadP; 191 | Reply *OutP = (Reply *) OutHeadP; 192 | #ifdef __MIG_check__Request__mach_exception_raise_t__defined 193 | kern_return_t check_result; 194 | #endif /* __MIG_check__Request__mach_exception_raise_t__defined */ 195 | 196 | __DeclareRcvRpc(2405, "mach_exception_raise") 197 | __BeforeRcvRpc(2405, "mach_exception_raise") 198 | 199 | #if defined(__MIG_check__Request__mach_exception_raise_t__defined) 200 | check_result = __MIG_check__Request__mach_exception_raise_t((__Request *)In0P); 201 | if (check_result != MACH_MSG_SUCCESS) 202 | { MIG_RETURN_ERROR(OutP, check_result); } 203 | #endif /* defined(__MIG_check__Request__mach_exception_raise_t__defined) */ 204 | 205 | OutP->RetCode = catch_mach_exception_raise(In0P->Head.msgh_request_port, In0P->thread.name, In0P->task.name, In0P->exception, In0P->code, In0P->codeCnt); 206 | 207 | OutP->NDR = NDR_record; 208 | 209 | 210 | __AfterRcvRpc(2405, "mach_exception_raise") 211 | } 212 | 213 | #if ( __MigTypeCheck ) 214 | #if __MIG_check__Request__mach_exc_subsystem__ 215 | #if !defined(__MIG_check__Request__mach_exception_raise_state_t__defined) 216 | #define __MIG_check__Request__mach_exception_raise_state_t__defined 217 | 218 | mig_internal kern_return_t __MIG_check__Request__mach_exception_raise_state_t(__attribute__((__unused__)) __Request__mach_exception_raise_state_t *In0P, __attribute__((__unused__)) __Request__mach_exception_raise_state_t **In1PP) 219 | { 220 | 221 | typedef __Request__mach_exception_raise_state_t __Request; 222 | __Request *In1P; 223 | #if __MigTypeCheck 224 | unsigned int msgh_size; 225 | #endif /* __MigTypeCheck */ 226 | unsigned int msgh_size_delta; 227 | 228 | #if __MigTypeCheck 229 | msgh_size = In0P->Head.msgh_size; 230 | if ((In0P->Head.msgh_bits & MACH_MSGH_BITS_COMPLEX) || 231 | (msgh_size < (mach_msg_size_t)(sizeof(__Request) - 5200)) || (msgh_size > (mach_msg_size_t)sizeof(__Request))) 232 | return MIG_BAD_ARGUMENTS; 233 | #endif /* __MigTypeCheck */ 234 | 235 | #if defined(__NDR_convert__int_rep__Request__mach_exception_raise_state_t__codeCnt__defined) 236 | if (In0P->NDR.int_rep != NDR_record.int_rep) 237 | __NDR_convert__int_rep__Request__mach_exception_raise_state_t__codeCnt(&In0P->codeCnt, In0P->NDR.int_rep); 238 | #endif /* __NDR_convert__int_rep__Request__mach_exception_raise_state_t__codeCnt__defined */ 239 | msgh_size_delta = (8 * In0P->codeCnt); 240 | #if __MigTypeCheck 241 | if ( In0P->codeCnt > 2 ) 242 | return MIG_BAD_ARGUMENTS; 243 | if (((msgh_size - (mach_msg_size_t)(sizeof(__Request) - 5200)) / 8 < In0P->codeCnt) || 244 | (msgh_size < (mach_msg_size_t)(sizeof(__Request) - 5200) + (8 * In0P->codeCnt))) 245 | return MIG_BAD_ARGUMENTS; 246 | msgh_size -= msgh_size_delta; 247 | #endif /* __MigTypeCheck */ 248 | 249 | *In1PP = In1P = (__Request *) ((pointer_t) In0P + msgh_size_delta - 16); 250 | 251 | #if defined(__NDR_convert__int_rep__Request__mach_exception_raise_state_t__old_stateCnt__defined) 252 | if (In0P->NDR.int_rep != NDR_record.int_rep) 253 | __NDR_convert__int_rep__Request__mach_exception_raise_state_t__old_stateCnt(&In1P->old_stateCnt, In1P->NDR.int_rep); 254 | #endif /* __NDR_convert__int_rep__Request__mach_exception_raise_state_t__old_stateCnt__defined */ 255 | #if __MigTypeCheck 256 | if ( In1P->old_stateCnt > 1296 ) 257 | return MIG_BAD_ARGUMENTS; 258 | if (((msgh_size - (mach_msg_size_t)(sizeof(__Request) - 5200)) / 4 < In1P->old_stateCnt) || 259 | (msgh_size != (mach_msg_size_t)(sizeof(__Request) - 5200) + (4 * In1P->old_stateCnt))) 260 | return MIG_BAD_ARGUMENTS; 261 | #endif /* __MigTypeCheck */ 262 | 263 | return MACH_MSG_SUCCESS; 264 | } 265 | #endif /* !defined(__MIG_check__Request__mach_exception_raise_state_t__defined) */ 266 | #endif /* __MIG_check__Request__mach_exc_subsystem__ */ 267 | #endif /* ( __MigTypeCheck ) */ 268 | 269 | 270 | /* Routine mach_exception_raise_state */ 271 | mig_internal novalue _Xmach_exception_raise_state 272 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP) 273 | { 274 | 275 | #ifdef __MigPackStructs 276 | #pragma pack(push, 4) 277 | #endif 278 | typedef struct { 279 | mach_msg_header_t Head; 280 | NDR_record_t NDR; 281 | exception_type_t exception; 282 | mach_msg_type_number_t codeCnt; 283 | int64_t code[2]; 284 | int flavor; 285 | mach_msg_type_number_t old_stateCnt; 286 | natural_t old_state[1296]; 287 | mach_msg_trailer_t trailer; 288 | } Request __attribute__((unused)); 289 | #ifdef __MigPackStructs 290 | #pragma pack(pop) 291 | #endif 292 | typedef __Request__mach_exception_raise_state_t __Request; 293 | typedef __Reply__mach_exception_raise_state_t Reply __attribute__((unused)); 294 | 295 | /* 296 | * typedef struct { 297 | * mach_msg_header_t Head; 298 | * NDR_record_t NDR; 299 | * kern_return_t RetCode; 300 | * } mig_reply_error_t; 301 | */ 302 | 303 | Request *In0P = (Request *) InHeadP; 304 | Request *In1P; 305 | Reply *OutP = (Reply *) OutHeadP; 306 | #ifdef __MIG_check__Request__mach_exception_raise_state_t__defined 307 | kern_return_t check_result; 308 | #endif /* __MIG_check__Request__mach_exception_raise_state_t__defined */ 309 | 310 | __DeclareRcvRpc(2406, "mach_exception_raise_state") 311 | __BeforeRcvRpc(2406, "mach_exception_raise_state") 312 | 313 | #if defined(__MIG_check__Request__mach_exception_raise_state_t__defined) 314 | check_result = __MIG_check__Request__mach_exception_raise_state_t((__Request *)In0P, (__Request **)&In1P); 315 | if (check_result != MACH_MSG_SUCCESS) 316 | { MIG_RETURN_ERROR(OutP, check_result); } 317 | #endif /* defined(__MIG_check__Request__mach_exception_raise_state_t__defined) */ 318 | 319 | OutP->new_stateCnt = 1296; 320 | 321 | OutP->RetCode = catch_mach_exception_raise_state(In0P->Head.msgh_request_port, In0P->exception, In0P->code, In0P->codeCnt, &In1P->flavor, In1P->old_state, In1P->old_stateCnt, OutP->new_state, &OutP->new_stateCnt); 322 | if (OutP->RetCode != KERN_SUCCESS) { 323 | MIG_RETURN_ERROR(OutP, OutP->RetCode); 324 | } 325 | 326 | OutP->NDR = NDR_record; 327 | 328 | 329 | OutP->flavor = In1P->flavor; 330 | OutP->Head.msgh_size = (mach_msg_size_t)(sizeof(Reply) - 5184) + (((4 * OutP->new_stateCnt))); 331 | 332 | __AfterRcvRpc(2406, "mach_exception_raise_state") 333 | } 334 | 335 | #if ( __MigTypeCheck ) 336 | #if __MIG_check__Request__mach_exc_subsystem__ 337 | #if !defined(__MIG_check__Request__mach_exception_raise_state_identity_t__defined) 338 | #define __MIG_check__Request__mach_exception_raise_state_identity_t__defined 339 | 340 | mig_internal kern_return_t __MIG_check__Request__mach_exception_raise_state_identity_t(__attribute__((__unused__)) __Request__mach_exception_raise_state_identity_t *In0P, __attribute__((__unused__)) __Request__mach_exception_raise_state_identity_t **In1PP) 341 | { 342 | 343 | typedef __Request__mach_exception_raise_state_identity_t __Request; 344 | __Request *In1P; 345 | #if __MigTypeCheck 346 | unsigned int msgh_size; 347 | #endif /* __MigTypeCheck */ 348 | unsigned int msgh_size_delta; 349 | 350 | #if __MigTypeCheck 351 | msgh_size = In0P->Head.msgh_size; 352 | if (!(In0P->Head.msgh_bits & MACH_MSGH_BITS_COMPLEX) || 353 | (In0P->msgh_body.msgh_descriptor_count != 2) || 354 | (msgh_size < (mach_msg_size_t)(sizeof(__Request) - 5200)) || (msgh_size > (mach_msg_size_t)sizeof(__Request))) 355 | return MIG_BAD_ARGUMENTS; 356 | #endif /* __MigTypeCheck */ 357 | 358 | #if __MigTypeCheck 359 | if (In0P->thread.type != MACH_MSG_PORT_DESCRIPTOR || 360 | In0P->thread.disposition != 17) 361 | return MIG_TYPE_ERROR; 362 | #endif /* __MigTypeCheck */ 363 | 364 | #if __MigTypeCheck 365 | if (In0P->task.type != MACH_MSG_PORT_DESCRIPTOR || 366 | In0P->task.disposition != 17) 367 | return MIG_TYPE_ERROR; 368 | #endif /* __MigTypeCheck */ 369 | 370 | #if defined(__NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__codeCnt__defined) 371 | if (In0P->NDR.int_rep != NDR_record.int_rep) 372 | __NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__codeCnt(&In0P->codeCnt, In0P->NDR.int_rep); 373 | #endif /* __NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__codeCnt__defined */ 374 | msgh_size_delta = (8 * In0P->codeCnt); 375 | #if __MigTypeCheck 376 | if ( In0P->codeCnt > 2 ) 377 | return MIG_BAD_ARGUMENTS; 378 | if (((msgh_size - (mach_msg_size_t)(sizeof(__Request) - 5200)) / 8 < In0P->codeCnt) || 379 | (msgh_size < (mach_msg_size_t)(sizeof(__Request) - 5200) + (8 * In0P->codeCnt))) 380 | return MIG_BAD_ARGUMENTS; 381 | msgh_size -= msgh_size_delta; 382 | #endif /* __MigTypeCheck */ 383 | 384 | *In1PP = In1P = (__Request *) ((pointer_t) In0P + msgh_size_delta - 16); 385 | 386 | #if defined(__NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__old_stateCnt__defined) 387 | if (In0P->NDR.int_rep != NDR_record.int_rep) 388 | __NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__old_stateCnt(&In1P->old_stateCnt, In1P->NDR.int_rep); 389 | #endif /* __NDR_convert__int_rep__Request__mach_exception_raise_state_identity_t__old_stateCnt__defined */ 390 | #if __MigTypeCheck 391 | if ( In1P->old_stateCnt > 1296 ) 392 | return MIG_BAD_ARGUMENTS; 393 | if (((msgh_size - (mach_msg_size_t)(sizeof(__Request) - 5200)) / 4 < In1P->old_stateCnt) || 394 | (msgh_size != (mach_msg_size_t)(sizeof(__Request) - 5200) + (4 * In1P->old_stateCnt))) 395 | return MIG_BAD_ARGUMENTS; 396 | #endif /* __MigTypeCheck */ 397 | 398 | return MACH_MSG_SUCCESS; 399 | } 400 | #endif /* !defined(__MIG_check__Request__mach_exception_raise_state_identity_t__defined) */ 401 | #endif /* __MIG_check__Request__mach_exc_subsystem__ */ 402 | #endif /* ( __MigTypeCheck ) */ 403 | 404 | 405 | /* Routine mach_exception_raise_state_identity */ 406 | mig_internal novalue _Xmach_exception_raise_state_identity 407 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP) 408 | { 409 | 410 | #ifdef __MigPackStructs 411 | #pragma pack(push, 4) 412 | #endif 413 | typedef struct { 414 | mach_msg_header_t Head; 415 | /* start of the kernel processed data */ 416 | mach_msg_body_t msgh_body; 417 | mach_msg_port_descriptor_t thread; 418 | mach_msg_port_descriptor_t task; 419 | /* end of the kernel processed data */ 420 | NDR_record_t NDR; 421 | exception_type_t exception; 422 | mach_msg_type_number_t codeCnt; 423 | int64_t code[2]; 424 | int flavor; 425 | mach_msg_type_number_t old_stateCnt; 426 | natural_t old_state[1296]; 427 | mach_msg_trailer_t trailer; 428 | } Request __attribute__((unused)); 429 | #ifdef __MigPackStructs 430 | #pragma pack(pop) 431 | #endif 432 | typedef __Request__mach_exception_raise_state_identity_t __Request; 433 | typedef __Reply__mach_exception_raise_state_identity_t Reply __attribute__((unused)); 434 | 435 | /* 436 | * typedef struct { 437 | * mach_msg_header_t Head; 438 | * NDR_record_t NDR; 439 | * kern_return_t RetCode; 440 | * } mig_reply_error_t; 441 | */ 442 | 443 | Request *In0P = (Request *) InHeadP; 444 | Request *In1P; 445 | Reply *OutP = (Reply *) OutHeadP; 446 | #ifdef __MIG_check__Request__mach_exception_raise_state_identity_t__defined 447 | kern_return_t check_result; 448 | #endif /* __MIG_check__Request__mach_exception_raise_state_identity_t__defined */ 449 | 450 | __DeclareRcvRpc(2407, "mach_exception_raise_state_identity") 451 | __BeforeRcvRpc(2407, "mach_exception_raise_state_identity") 452 | 453 | #if defined(__MIG_check__Request__mach_exception_raise_state_identity_t__defined) 454 | check_result = __MIG_check__Request__mach_exception_raise_state_identity_t((__Request *)In0P, (__Request **)&In1P); 455 | if (check_result != MACH_MSG_SUCCESS) 456 | { MIG_RETURN_ERROR(OutP, check_result); } 457 | #endif /* defined(__MIG_check__Request__mach_exception_raise_state_identity_t__defined) */ 458 | 459 | OutP->new_stateCnt = 1296; 460 | 461 | OutP->RetCode = catch_mach_exception_raise_state_identity(In0P->Head.msgh_request_port, In0P->thread.name, In0P->task.name, In0P->exception, In0P->code, In0P->codeCnt, &In1P->flavor, In1P->old_state, In1P->old_stateCnt, OutP->new_state, &OutP->new_stateCnt); 462 | if (OutP->RetCode != KERN_SUCCESS) { 463 | MIG_RETURN_ERROR(OutP, OutP->RetCode); 464 | } 465 | 466 | OutP->NDR = NDR_record; 467 | 468 | 469 | OutP->flavor = In1P->flavor; 470 | OutP->Head.msgh_size = (mach_msg_size_t)(sizeof(Reply) - 5184) + (((4 * OutP->new_stateCnt))); 471 | 472 | __AfterRcvRpc(2407, "mach_exception_raise_state_identity") 473 | } 474 | 475 | 476 | 477 | /* Description of this subsystem, for use in direct RPC */ 478 | const struct catch_mach_exc_subsystem catch_mach_exc_subsystem = { 479 | mach_exc_server_routine, 480 | 2405, 481 | 2410, 482 | (mach_msg_size_t)sizeof(union __ReplyUnion__catch_mach_exc_subsystem), 483 | (vm_address_t)0, 484 | { 485 | { (mig_impl_routine_t) 0, 486 | (mig_stub_routine_t) _Xmach_exception_raise, 6, 0, (routine_arg_descriptor_t)0, (mach_msg_size_t)sizeof(__Reply__mach_exception_raise_t)}, 487 | { (mig_impl_routine_t) 0, 488 | (mig_stub_routine_t) _Xmach_exception_raise_state, 9, 0, (routine_arg_descriptor_t)0, (mach_msg_size_t)sizeof(__Reply__mach_exception_raise_state_t)}, 489 | { (mig_impl_routine_t) 0, 490 | (mig_stub_routine_t) _Xmach_exception_raise_state_identity, 11, 0, (routine_arg_descriptor_t)0, (mach_msg_size_t)sizeof(__Reply__mach_exception_raise_state_identity_t)}, 491 | {0, 0, 0, 0, 0, 0}, 492 | {0, 0, 0, 0, 0, 0}, 493 | } 494 | }; 495 | 496 | 497 | mig_external boolean_t mach_exc_server 498 | (mach_msg_header_t *InHeadP, mach_msg_header_t *OutHeadP) 499 | { 500 | /* 501 | * typedef struct { 502 | * mach_msg_header_t Head; 503 | * NDR_record_t NDR; 504 | * kern_return_t RetCode; 505 | * } mig_reply_error_t; 506 | */ 507 | 508 | mig_routine_t routine; 509 | 510 | OutHeadP->msgh_bits = MACH_MSGH_BITS(MACH_MSGH_BITS_REPLY(InHeadP->msgh_bits), 0); 511 | OutHeadP->msgh_remote_port = InHeadP->msgh_reply_port; 512 | /* Minimal size: routine() will update it if different */ 513 | OutHeadP->msgh_size = (mach_msg_size_t)sizeof(mig_reply_error_t); 514 | OutHeadP->msgh_local_port = MACH_PORT_NULL; 515 | OutHeadP->msgh_id = InHeadP->msgh_id + 100; 516 | OutHeadP->msgh_reserved = 0; 517 | 518 | if ((InHeadP->msgh_id > 2409) || (InHeadP->msgh_id < 2405) || 519 | ((routine = catch_mach_exc_subsystem.routine[InHeadP->msgh_id - 2405].stub_routine) == 0)) { 520 | ((mig_reply_error_t *)OutHeadP)->NDR = NDR_record; 521 | ((mig_reply_error_t *)OutHeadP)->RetCode = MIG_BAD_ID; 522 | return FALSE; 523 | } 524 | (*routine) (InHeadP, OutHeadP); 525 | return TRUE; 526 | } 527 | 528 | mig_external mig_routine_t mach_exc_server_routine 529 | (mach_msg_header_t *InHeadP) 530 | { 531 | int msgh_id; 532 | 533 | msgh_id = InHeadP->msgh_id - 2405; 534 | 535 | if ((msgh_id > 4) || (msgh_id < 0)) 536 | return 0; 537 | 538 | return catch_mach_exc_subsystem.routine[msgh_id].stub_routine; 539 | } 540 | -------------------------------------------------------------------------------- /Hook/mach_excServer.h: -------------------------------------------------------------------------------- 1 | #ifndef _mach_exc_server_ 2 | #define _mach_exc_server_ 3 | 4 | /* Module mach_exc */ 5 | 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | 16 | /* BEGIN VOUCHER CODE */ 17 | 18 | #ifndef KERNEL 19 | #if defined(__has_include) 20 | #if __has_include() 21 | #ifndef USING_VOUCHERS 22 | #define USING_VOUCHERS 23 | #endif 24 | #ifndef __VOUCHER_FORWARD_TYPE_DECLS__ 25 | #define __VOUCHER_FORWARD_TYPE_DECLS__ 26 | #ifdef __cplusplus 27 | extern "C" { 28 | #endif 29 | #ifndef __VOUCHER_FOWARD_TYPE_DECLS_SINGLE_ATTR 30 | #define __VOUCHER_FOWARD_TYPE_DECLS_SINGLE_ATTR __unsafe_indexable 31 | #endif 32 | extern boolean_t voucher_mach_msg_set(mach_msg_header_t * msg) __attribute__((weak_import)); 33 | #ifdef __cplusplus 34 | } 35 | #endif 36 | #endif // __VOUCHER_FORWARD_TYPE_DECLS__ 37 | #endif // __has_include() 38 | #endif // __has_include 39 | #endif // !KERNEL 40 | 41 | /* END VOUCHER CODE */ 42 | 43 | 44 | /* BEGIN MIG_STRNCPY_ZEROFILL CODE */ 45 | 46 | #if defined(__has_include) 47 | #if __has_include() 48 | #ifndef USING_MIG_STRNCPY_ZEROFILL 49 | #define USING_MIG_STRNCPY_ZEROFILL 50 | #endif 51 | #ifndef __MIG_STRNCPY_ZEROFILL_FORWARD_TYPE_DECLS__ 52 | #define __MIG_STRNCPY_ZEROFILL_FORWARD_TYPE_DECLS__ 53 | #ifdef __cplusplus 54 | extern "C" { 55 | #endif 56 | #ifndef __MIG_STRNCPY_ZEROFILL_FORWARD_TYPE_DECLS_CSTRING_ATTR 57 | #define __MIG_STRNCPY_ZEROFILL_FORWARD_TYPE_DECLS_CSTRING_COUNTEDBY_ATTR(C) __unsafe_indexable 58 | #endif 59 | extern int mig_strncpy_zerofill(char * dest, const char * src, int len) __attribute__((weak_import)); 60 | #ifdef __cplusplus 61 | } 62 | #endif 63 | #endif /* __MIG_STRNCPY_ZEROFILL_FORWARD_TYPE_DECLS__ */ 64 | #endif /* __has_include() */ 65 | #endif /* __has_include */ 66 | 67 | /* END MIG_STRNCPY_ZEROFILL CODE */ 68 | 69 | 70 | #ifdef AUTOTEST 71 | #ifndef FUNCTION_PTR_T 72 | #define FUNCTION_PTR_T 73 | typedef void (*function_ptr_t)(mach_port_t, char *, mach_msg_type_number_t); 74 | typedef struct { 75 | char * name; 76 | function_ptr_t function; 77 | } function_table_entry; 78 | typedef function_table_entry *function_table_t; 79 | #endif /* FUNCTION_PTR_T */ 80 | #endif /* AUTOTEST */ 81 | 82 | #ifndef mach_exc_MSG_COUNT 83 | #define mach_exc_MSG_COUNT 5 84 | #endif /* mach_exc_MSG_COUNT */ 85 | 86 | #include 87 | #include 88 | #include 89 | #include 90 | #include 91 | 92 | #ifdef __BeforeMigServerHeader 93 | __BeforeMigServerHeader 94 | #endif /* __BeforeMigServerHeader */ 95 | 96 | #ifndef MIG_SERVER_ROUTINE 97 | #define MIG_SERVER_ROUTINE 98 | #endif 99 | 100 | 101 | /* Routine mach_exception_raise */ 102 | #ifdef mig_external 103 | mig_external 104 | #else 105 | extern 106 | #endif /* mig_external */ 107 | MIG_SERVER_ROUTINE 108 | kern_return_t catch_mach_exception_raise 109 | ( 110 | mach_port_t exception_port, 111 | mach_port_t thread, 112 | mach_port_t task, 113 | exception_type_t exception, 114 | mach_exception_data_t code, 115 | mach_msg_type_number_t codeCnt 116 | ); 117 | 118 | /* Routine mach_exception_raise_state */ 119 | #ifdef mig_external 120 | mig_external 121 | #else 122 | extern 123 | #endif /* mig_external */ 124 | MIG_SERVER_ROUTINE 125 | kern_return_t catch_mach_exception_raise_state 126 | ( 127 | mach_port_t exception_port, 128 | exception_type_t exception, 129 | const mach_exception_data_t code, 130 | mach_msg_type_number_t codeCnt, 131 | int *flavor, 132 | const thread_state_t old_state, 133 | mach_msg_type_number_t old_stateCnt, 134 | thread_state_t new_state, 135 | mach_msg_type_number_t *new_stateCnt 136 | ); 137 | 138 | /* Routine mach_exception_raise_state_identity */ 139 | #ifdef mig_external 140 | mig_external 141 | #else 142 | extern 143 | #endif /* mig_external */ 144 | MIG_SERVER_ROUTINE 145 | kern_return_t catch_mach_exception_raise_state_identity 146 | ( 147 | mach_port_t exception_port, 148 | mach_port_t thread, 149 | mach_port_t task, 150 | exception_type_t exception, 151 | mach_exception_data_t code, 152 | mach_msg_type_number_t codeCnt, 153 | int *flavor, 154 | thread_state_t old_state, 155 | mach_msg_type_number_t old_stateCnt, 156 | thread_state_t new_state, 157 | mach_msg_type_number_t *new_stateCnt 158 | ); 159 | 160 | #ifdef mig_external 161 | mig_external 162 | #else 163 | extern 164 | #endif /* mig_external */ 165 | boolean_t mach_exc_server( 166 | mach_msg_header_t *InHeadP, 167 | mach_msg_header_t *OutHeadP); 168 | 169 | #ifdef mig_external 170 | mig_external 171 | #else 172 | extern 173 | #endif /* mig_external */ 174 | mig_routine_t mach_exc_server_routine( 175 | mach_msg_header_t *InHeadP); 176 | 177 | 178 | /* Description of this subsystem, for use in direct RPC */ 179 | extern const struct catch_mach_exc_subsystem { 180 | mig_server_routine_t server; /* Server routine */ 181 | mach_msg_id_t start; /* Min routine number */ 182 | mach_msg_id_t end; /* Max routine number + 1 */ 183 | unsigned int maxsize; /* Max msg size */ 184 | vm_address_t reserved; /* Reserved */ 185 | struct routine_descriptor /* Array of routine descriptors */ 186 | routine[5]; 187 | } catch_mach_exc_subsystem; 188 | 189 | /* typedefs for all requests */ 190 | 191 | #ifndef __Request__mach_exc_subsystem__defined 192 | #define __Request__mach_exc_subsystem__defined 193 | 194 | #ifdef __MigPackStructs 195 | #pragma pack(push, 4) 196 | #endif 197 | typedef struct { 198 | mach_msg_header_t Head; 199 | /* start of the kernel processed data */ 200 | mach_msg_body_t msgh_body; 201 | mach_msg_port_descriptor_t thread; 202 | mach_msg_port_descriptor_t task; 203 | /* end of the kernel processed data */ 204 | NDR_record_t NDR; 205 | exception_type_t exception; 206 | mach_msg_type_number_t codeCnt; 207 | int64_t code[2]; 208 | } __Request__mach_exception_raise_t __attribute__((unused)); 209 | #ifdef __MigPackStructs 210 | #pragma pack(pop) 211 | #endif 212 | 213 | #ifdef __MigPackStructs 214 | #pragma pack(push, 4) 215 | #endif 216 | typedef struct { 217 | mach_msg_header_t Head; 218 | NDR_record_t NDR; 219 | exception_type_t exception; 220 | mach_msg_type_number_t codeCnt; 221 | int64_t code[2]; 222 | int flavor; 223 | mach_msg_type_number_t old_stateCnt; 224 | natural_t old_state[1296]; 225 | } __Request__mach_exception_raise_state_t __attribute__((unused)); 226 | #ifdef __MigPackStructs 227 | #pragma pack(pop) 228 | #endif 229 | 230 | #ifdef __MigPackStructs 231 | #pragma pack(push, 4) 232 | #endif 233 | typedef struct { 234 | mach_msg_header_t Head; 235 | /* start of the kernel processed data */ 236 | mach_msg_body_t msgh_body; 237 | mach_msg_port_descriptor_t thread; 238 | mach_msg_port_descriptor_t task; 239 | /* end of the kernel processed data */ 240 | NDR_record_t NDR; 241 | exception_type_t exception; 242 | mach_msg_type_number_t codeCnt; 243 | int64_t code[2]; 244 | int flavor; 245 | mach_msg_type_number_t old_stateCnt; 246 | natural_t old_state[1296]; 247 | } __Request__mach_exception_raise_state_identity_t __attribute__((unused)); 248 | #ifdef __MigPackStructs 249 | #pragma pack(pop) 250 | #endif 251 | #endif /* !__Request__mach_exc_subsystem__defined */ 252 | 253 | 254 | /* union of all requests */ 255 | 256 | #ifndef __RequestUnion__catch_mach_exc_subsystem__defined 257 | #define __RequestUnion__catch_mach_exc_subsystem__defined 258 | union __RequestUnion__catch_mach_exc_subsystem { 259 | __Request__mach_exception_raise_t Request_mach_exception_raise; 260 | __Request__mach_exception_raise_state_t Request_mach_exception_raise_state; 261 | __Request__mach_exception_raise_state_identity_t Request_mach_exception_raise_state_identity; 262 | }; 263 | #endif /* __RequestUnion__catch_mach_exc_subsystem__defined */ 264 | /* typedefs for all replies */ 265 | 266 | #ifndef __Reply__mach_exc_subsystem__defined 267 | #define __Reply__mach_exc_subsystem__defined 268 | 269 | #ifdef __MigPackStructs 270 | #pragma pack(push, 4) 271 | #endif 272 | typedef struct { 273 | mach_msg_header_t Head; 274 | NDR_record_t NDR; 275 | kern_return_t RetCode; 276 | } __Reply__mach_exception_raise_t __attribute__((unused)); 277 | #ifdef __MigPackStructs 278 | #pragma pack(pop) 279 | #endif 280 | 281 | #ifdef __MigPackStructs 282 | #pragma pack(push, 4) 283 | #endif 284 | typedef struct { 285 | mach_msg_header_t Head; 286 | NDR_record_t NDR; 287 | kern_return_t RetCode; 288 | int flavor; 289 | mach_msg_type_number_t new_stateCnt; 290 | natural_t new_state[1296]; 291 | } __Reply__mach_exception_raise_state_t __attribute__((unused)); 292 | #ifdef __MigPackStructs 293 | #pragma pack(pop) 294 | #endif 295 | 296 | #ifdef __MigPackStructs 297 | #pragma pack(push, 4) 298 | #endif 299 | typedef struct { 300 | mach_msg_header_t Head; 301 | NDR_record_t NDR; 302 | kern_return_t RetCode; 303 | int flavor; 304 | mach_msg_type_number_t new_stateCnt; 305 | natural_t new_state[1296]; 306 | } __Reply__mach_exception_raise_state_identity_t __attribute__((unused)); 307 | #ifdef __MigPackStructs 308 | #pragma pack(pop) 309 | #endif 310 | #endif /* !__Reply__mach_exc_subsystem__defined */ 311 | 312 | 313 | /* union of all replies */ 314 | 315 | #ifndef __ReplyUnion__catch_mach_exc_subsystem__defined 316 | #define __ReplyUnion__catch_mach_exc_subsystem__defined 317 | union __ReplyUnion__catch_mach_exc_subsystem { 318 | __Reply__mach_exception_raise_t Reply_mach_exception_raise; 319 | __Reply__mach_exception_raise_state_t Reply_mach_exception_raise_state; 320 | __Reply__mach_exception_raise_state_identity_t Reply_mach_exception_raise_state_identity; 321 | }; 322 | #endif /* __ReplyUnion__catch_mach_exc_subsystem__defined */ 323 | 324 | #ifndef subsystem_to_name_map_mach_exc 325 | #define subsystem_to_name_map_mach_exc \ 326 | { "mach_exception_raise", 2405 },\ 327 | { "mach_exception_raise_state", 2406 },\ 328 | { "mach_exception_raise_state_identity", 2407 } 329 | #endif 330 | 331 | #ifdef __AfterMigServerHeader 332 | __AfterMigServerHeader 333 | #endif /* __AfterMigServerHeader */ 334 | 335 | #endif /* _mach_exc_server_ */ 336 | -------------------------------------------------------------------------------- /Hook/patch.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | bool getType(unsigned int data) { 9 | int a = data & 0xffff8000; 10 | int b = a + 0x00008000; 11 | int c = b & 0xffff7fff; 12 | return c; 13 | } 14 | 15 | struct MemoryFileInfo { 16 | uint32_t index; 17 | const struct mach_header *header; 18 | const char *name; 19 | long long address; 20 | }; 21 | 22 | void *get_image_header(const char *image_name, intptr_t *slide) { 23 | uint32_t count = _dyld_image_count(); 24 | for (uint32_t i = 0; i < count; i++) { 25 | const char *name = _dyld_get_image_name(i); 26 | if (strstr(name, image_name)) { 27 | *slide = _dyld_get_image_vmaddr_slide(i); 28 | return (void *)_dyld_get_image_header(i); 29 | } 30 | } 31 | return NULL; 32 | } 33 | 34 | MemoryFileInfo getBaseInfo() { 35 | MemoryFileInfo _info; 36 | std::string applicationsPath = "/private/var/containers/Bundle/Application"; 37 | for (uint32_t i = 0; i < _dyld_image_count(); i++) 38 | { 39 | const char *name = _dyld_get_image_name(i); 40 | if (!name) continue; 41 | std::string fullpath(name); 42 | if (strncmp(fullpath.c_str(), applicationsPath.c_str(), applicationsPath.size()) == 0) 43 | { 44 | _info.index = i; 45 | _info.header = _dyld_get_image_header(i); 46 | _info.name = _dyld_get_image_name(i); 47 | _info.address = _dyld_get_image_vmaddr_slide(i); 48 | break; 49 | } 50 | } 51 | return _info; 52 | } 53 | 54 | MemoryFileInfo getMemoryFileInfo(const std::string& fileName) { 55 | MemoryFileInfo _info; 56 | const uint32_t imageCount = _dyld_image_count(); 57 | for (uint32_t i = 0; i < imageCount; i++) { 58 | const char *name = _dyld_get_image_name(i); 59 | if (!name) 60 | continue; 61 | std::string fullpath(name); 62 | if (fullpath.length() < fileName.length() || fullpath.compare(fullpath.length() - fileName.length(), fileName.length(), fileName) != 0) 63 | continue; 64 | _info.index = i; 65 | _info.header = _dyld_get_image_header(i); 66 | _info.name = _dyld_get_image_name(i); 67 | _info.address = _dyld_get_image_vmaddr_slide(i); 68 | break; 69 | } 70 | return _info; 71 | } 72 | 73 | uintptr_t getAbsoluteAddress(const char *fileName, uintptr_t address) { 74 | MemoryFileInfo info; 75 | if (fileName) 76 | info = getMemoryFileInfo(fileName); 77 | else 78 | info = getBaseInfo(); 79 | if (info.address == 0) 80 | return 0; 81 | return info.address + address; 82 | } 83 | 84 | bool vm(long long offset, unsigned int data) { 85 | const char *fileName = NULL; 86 | uintptr_t address = getAbsoluteAddress(fileName, offset); 87 | if (address == 0) 88 | return false; 89 | 90 | kern_return_t err; 91 | mach_port_t port = mach_task_self(); 92 | 93 | err = vm_protect(port, (mach_vm_address_t)address, sizeof(data), false, VM_PROT_READ | VM_PROT_WRITE | VM_PROT_COPY); 94 | if (err != KERN_SUCCESS) { 95 | return false; 96 | } 97 | 98 | if (getType(data)) { 99 | data = CFSwapInt32(data); 100 | err = vm_write(port, (mach_vm_address_t)address, (vm_offset_t)&data, sizeof(data)); 101 | } else { 102 | data = (unsigned short)data; 103 | data = CFSwapInt16(data); 104 | err = vm_write(port, (mach_vm_address_t)address, (vm_offset_t)&data, sizeof(data)); 105 | } 106 | 107 | if (err != KERN_SUCCESS) { 108 | return false; 109 | } 110 | 111 | err = vm_protect(port, (mach_vm_address_t)address, sizeof(data), false, VM_PROT_READ | VM_PROT_EXECUTE); 112 | if (err != KERN_SUCCESS) { 113 | return false; 114 | } 115 | 116 | return true; 117 | } -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | ARCHS = arm64 2 | DEBUG = 0 3 | FINALPACKAGE = 1 4 | FOR_RELEASE = 1 5 | IGNORE_WARNINGS = 0 6 | 7 | #THEOS_PACKAGE_SCHEME = rootless 8 | 9 | include $(THEOS)/makefiles/common.mk 10 | 11 | TWEAK_NAME = hookjailed 12 | 13 | $(TWEAK_NAME)_CFLAGS = -fobjc-arc -Wall -Wno-deprecated-declarations -Wno-unused-variable -Wno-unused-value -Wno-unused-function -fvisibility=hidden 14 | 15 | $(TWEAK_NAME)_CCFLAGS = -std=c++11 -fno-rtti -fno-exceptions -DNDEBUG -Wall -Wno-deprecated-declarations -Wno-unused-variable -Wno-unused-value -Wno-unused-function -fvisibility=hidden 16 | 17 | $(TWEAK_NAME)_FILES = Tweak.xm $(wildcard Hook/*.c) 18 | 19 | include $(THEOS_MAKE_PATH)/tweak.mk 20 | 21 | 22 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # JailedHookNoOrig 2 | Hook no original for jailed devices, limit at 6 (because of Apple). Based on iSH hook and Ellekit 3 | 4 | # Credit: Lav0chka (who helped me a lot) 5 | -------------------------------------------------------------------------------- /Tweak.xm: -------------------------------------------------------------------------------- 1 | #import "Hook/fishhook.h" 2 | #import "Hook/hook.h" 3 | #import "Hook/patch.h" 4 | 5 | /********** FISHHOOK ***********/ 6 | 7 | void (*original_function)(void *_this); 8 | void replaced_function(void *_this) { 9 | if(_this != NULL){ 10 | return; 11 | } 12 | } 13 | 14 | void fishhook_function(){ 15 | //_TN_127 is the output name function for testing. 16 | rebind_symbols((struct rebinding[1]){{"_TN_127", (void *)replaced_function, (void **)&original_function}},1); 17 | } 18 | 19 | 20 | /****** END FISHHOOK *******/ 21 | 22 | /****** HOOK NO ORIGINAL *******/ 23 | 24 | bool _function_return1(void *_this){ 25 | return TRUE; 26 | } 27 | 28 | float _function_return2(void *_this){ 29 | return 10; 30 | } 31 | 32 | void _function_return3(void *_this){ 33 | return; 34 | } 35 | 36 | void _function_4(void *_this){ 37 | return; 38 | } 39 | 40 | void _function_5(void *_this){ 41 | return; 42 | } 43 | 44 | bool _function_6(void *_this){ 45 | return FALSE; 46 | } 47 | 48 | void hook_no_orig_function(){ 49 | //This hook maximum get 6 due to Apple, all at the same time, you can hook into private region like an static address 50 | //with getAbsoluteAddress("image_name", 0xAddress); 51 | //You can also use get_image_header() if you need it 52 | hook( 53 | (void *[]) { 54 | (void *)getAbsoluteAddress("FEProj", 0xAABBCCD), //first address function 55 | (void *)getAbsoluteAddress("FEProj", 0xFF99887), 56 | (void *)getAbsoluteAddress("FEProj", 0x9887766), 57 | (void *)getAbsoluteAddress("wildrift", 0x10AABBCCD), 58 | (void *)getAbsoluteAddress("wildriftvn", 0x10CCDDEEF), 59 | (void *)getAbsoluteAddress("anogs", 0xFFEEDDC) 60 | }, 61 | (void *[]) { 62 | (bool *)_function_return1, //matched for the first function and so on 63 | (void *)_function_return2, 64 | (void *)_function_return3, 65 | (void *)_function_4, 66 | (void *)_function_5, 67 | (bool *)_function_6 68 | }, 69 | 6); //remember to change this number to matched functions, example you input 3 functions but let this number is 6, the hook will not work. 70 | } 71 | 72 | /****** END HOOK ******/ 73 | 74 | %ctor{ 75 | fishhook_function(); 76 | hook_no_orig_function(); 77 | } -------------------------------------------------------------------------------- /control: -------------------------------------------------------------------------------- 1 | Package: com.34306.hookjailed 2 | Name: hookjailed 3 | Version: 0.0.1 4 | Architecture: iphoneos-arm 5 | Description: Hook no original for apps on jailed devices 6 | Maintainer: Little 34306 7 | Author: 34306 8 | Section: Tweaks 9 | Depends: mobilesubstrate (>= 0.9.5000) 10 | -------------------------------------------------------------------------------- /hookjailed.plist: -------------------------------------------------------------------------------- 1 | { Filter = { Bundles = ( "com.riotgames.league.wildrift" ); }; } 2 | --------------------------------------------------------------------------------