patchfinder64.c 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266
  1. //
  2. // patchfinder64.c
  3. // extra_recipe
  4. //
  5. // Copyright © 2017 xerub. All rights reserved.
  6. //
  7. #include <assert.h>
  8. #include <stdint.h>
  9. #include <string.h>
  10. #include "kernel.h"
  11. typedef unsigned long long addr_t;
  12. #define IS64(image) (*(uint8_t *)(image) & 1)
  13. #define MACHO(p) ((*(unsigned int *)(p) & ~1) == 0xfeedface)
  14. /* generic stuff *************************************************************/
  15. #define UCHAR_MAX 255
  16. static unsigned char *
  17. boyermoore_horspool_memmem(const unsigned char* haystack, size_t hlen,
  18. const unsigned char* needle, size_t nlen)
  19. {
  20. size_t last, scan = 0;
  21. size_t bad_char_skip[UCHAR_MAX + 1]; /* Officially called:
  22. * bad character shift */
  23. /* Sanity checks on the parameters */
  24. if (nlen <= 0 || !haystack || !needle)
  25. return NULL;
  26. /* ---- Preprocess ---- */
  27. /* Initialize the table to default value */
  28. /* When a character is encountered that does not occur
  29. * in the needle, we can safely skip ahead for the whole
  30. * length of the needle.
  31. */
  32. for (scan = 0; scan <= UCHAR_MAX; scan = scan + 1)
  33. bad_char_skip[scan] = nlen;
  34. /* C arrays have the first byte at [0], therefore:
  35. * [nlen - 1] is the last byte of the array. */
  36. last = nlen - 1;
  37. /* Then populate it with the analysis of the needle */
  38. for (scan = 0; scan < last; scan = scan + 1)
  39. bad_char_skip[needle[scan]] = last - scan;
  40. /* ---- Do the matching ---- */
  41. /* Search the haystack, while the needle can still be within it. */
  42. while (hlen >= nlen)
  43. {
  44. /* scan from the end of the needle */
  45. for (scan = last; haystack[scan] == needle[scan]; scan = scan - 1)
  46. if (scan == 0) /* If the first byte matches, we've found it. */
  47. return (void *)haystack;
  48. /* otherwise, we need to skip some bytes and start again.
  49. Note that here we are getting the skip value based on the last byte
  50. of needle, no matter where we didn't match. So if needle is: "abcd"
  51. then we are skipping based on 'd' and that value will be 4, and
  52. for "abcdd" we again skip on 'd' but the value will be only 1.
  53. The alternative of pretending that the mismatched character was
  54. the last character is slower in the normal case (E.g. finding
  55. "abcd" in "...azcd..." gives 4 by using 'd' but only
  56. 4-2==2 using 'z'. */
  57. hlen -= bad_char_skip[haystack[last]];
  58. haystack += bad_char_skip[haystack[last]];
  59. }
  60. return NULL;
  61. }
  62. /* disassembler **************************************************************/
  63. static int HighestSetBit(int N, uint32_t imm)
  64. {
  65. int i;
  66. for (i = N - 1; i >= 0; i--) {
  67. if (imm & (1 << i)) {
  68. return i;
  69. }
  70. }
  71. return -1;
  72. }
  73. static uint64_t ZeroExtendOnes(unsigned M, unsigned N) // zero extend M ones to N width
  74. {
  75. (void)N;
  76. return ((uint64_t)1 << M) - 1;
  77. }
  78. static uint64_t RORZeroExtendOnes(unsigned M, unsigned N, unsigned R)
  79. {
  80. uint64_t val = ZeroExtendOnes(M, N);
  81. if (R == 0) {
  82. return val;
  83. }
  84. return ((val >> R) & (((uint64_t)1 << (N - R)) - 1)) | ((val & (((uint64_t)1 << R) - 1)) << (N - R));
  85. }
  86. static uint64_t Replicate(uint64_t val, unsigned bits)
  87. {
  88. uint64_t ret = val;
  89. unsigned shift;
  90. for (shift = bits; shift < 64; shift += bits) { // XXX actually, it is either 32 or 64
  91. ret |= (val << shift);
  92. }
  93. return ret;
  94. }
  95. static int DecodeBitMasks(unsigned immN, unsigned imms, unsigned immr, int immediate, uint64_t *newval)
  96. {
  97. unsigned levels, S, R, esize;
  98. int len = HighestSetBit(7, (immN << 6) | (~imms & 0x3F));
  99. if (len < 1) {
  100. return -1;
  101. }
  102. levels = ZeroExtendOnes(len, 6);
  103. if (immediate && (imms & levels) == levels) {
  104. return -1;
  105. }
  106. S = imms & levels;
  107. R = immr & levels;
  108. esize = 1 << len;
  109. *newval = Replicate(RORZeroExtendOnes(S + 1, esize, R), esize);
  110. return 0;
  111. }
  112. static int DecodeMov(uint32_t opcode, uint64_t total, int first, uint64_t *newval)
  113. {
  114. unsigned o = (opcode >> 29) & 3;
  115. unsigned k = (opcode >> 23) & 0x3F;
  116. unsigned rn, rd;
  117. uint64_t i;
  118. if (k == 0x24 && o == 1) { // MOV (bitmask imm) <=> ORR (immediate)
  119. unsigned s = (opcode >> 31) & 1;
  120. unsigned N = (opcode >> 22) & 1;
  121. if (s == 0 && N != 0) {
  122. return -1;
  123. }
  124. rn = (opcode >> 5) & 0x1F;
  125. if (rn == 31) {
  126. unsigned imms = (opcode >> 10) & 0x3F;
  127. unsigned immr = (opcode >> 16) & 0x3F;
  128. return DecodeBitMasks(N, imms, immr, 1, newval);
  129. }
  130. } else if (k == 0x25) { // MOVN/MOVZ/MOVK
  131. unsigned s = (opcode >> 31) & 1;
  132. unsigned h = (opcode >> 21) & 3;
  133. if (s == 0 && h > 1) {
  134. return -1;
  135. }
  136. i = (opcode >> 5) & 0xFFFF;
  137. h *= 16;
  138. i <<= h;
  139. if (o == 0) { // MOVN
  140. *newval = ~i;
  141. return 0;
  142. } else if (o == 2) { // MOVZ
  143. *newval = i;
  144. return 0;
  145. } else if (o == 3 && !first) { // MOVK
  146. *newval = (total & ~((uint64_t)0xFFFF << h)) | i;
  147. return 0;
  148. }
  149. } else if ((k | 1) == 0x23 && !first) { // ADD (immediate)
  150. unsigned h = (opcode >> 22) & 3;
  151. if (h > 1) {
  152. return -1;
  153. }
  154. rd = opcode & 0x1F;
  155. rn = (opcode >> 5) & 0x1F;
  156. if (rd != rn) {
  157. return -1;
  158. }
  159. i = (opcode >> 10) & 0xFFF;
  160. h *= 12;
  161. i <<= h;
  162. if (o & 2) { // SUB
  163. *newval = total - i;
  164. return 0;
  165. } else { // ADD
  166. *newval = total + i;
  167. return 0;
  168. }
  169. }
  170. return -1;
  171. }
  172. /* patchfinder ***************************************************************/
  173. static addr_t
  174. step64(const uint8_t *buf, addr_t start, size_t length, uint32_t what, uint32_t mask)
  175. {
  176. addr_t end = start + length;
  177. while (start < end) {
  178. uint32_t x = *(uint32_t *)(buf + start);
  179. if ((x & mask) == what) {
  180. return start;
  181. }
  182. start += 4;
  183. }
  184. return 0;
  185. }
  186. static addr_t
  187. step64_back(const uint8_t *buf, addr_t start, size_t length, uint32_t what, uint32_t mask)
  188. {
  189. addr_t end = start - length;
  190. while (start >= end) {
  191. uint32_t x = *(uint32_t *)(buf + start);
  192. if ((x & mask) == what) {
  193. return start;
  194. }
  195. start -= 4;
  196. }
  197. return 0;
  198. }
  199. static addr_t
  200. bof64(const uint8_t *buf, addr_t start, addr_t where)
  201. {
  202. for (; where >= start; where -= 4) {
  203. uint32_t op = *(uint32_t *)(buf + where);
  204. if ((op & 0xFFC003FF) == 0x910003FD) {
  205. unsigned delta = (op >> 10) & 0xFFF;
  206. //printf("%x: ADD X29, SP, #0x%x\n", where, delta);
  207. if ((delta & 0xF) == 0) {
  208. addr_t prev = where - ((delta >> 4) + 1) * 4;
  209. uint32_t au = *(uint32_t *)(buf + prev);
  210. if ((au & 0xFFC003E0) == 0xA98003E0) {
  211. //printf("%x: STP x, y, [SP,#-imm]!\n", prev);
  212. return prev;
  213. }
  214. }
  215. }
  216. }
  217. return 0;
  218. }
  219. static addr_t
  220. xref64(const uint8_t *buf, addr_t start, addr_t end, addr_t what)
  221. {
  222. addr_t i;
  223. uint64_t value[32];
  224. memset(value, 0, sizeof(value));
  225. end &= ~3;
  226. for (i = start & ~3; i < end; i += 4) {
  227. uint32_t op = *(uint32_t *)(buf + i);
  228. unsigned reg = op & 0x1F;
  229. if ((op & 0x9F000000) == 0x90000000) {
  230. signed adr = ((op & 0x60000000) >> 18) | ((op & 0xFFFFE0) << 8);
  231. //printf("%llx: ADRP X%d, 0x%llx\n", i, reg, ((long long)adr << 1) + (i & ~0xFFF));
  232. value[reg] = ((long long)adr << 1) + (i & ~0xFFF);
  233. /*} else if ((op & 0xFFE0FFE0) == 0xAA0003E0) {
  234. unsigned rd = op & 0x1F;
  235. unsigned rm = (op >> 16) & 0x1F;
  236. //printf("%llx: MOV X%d, X%d\n", i, rd, rm);
  237. value[rd] = value[rm];*/
  238. } else if ((op & 0xFF000000) == 0x91000000) {
  239. unsigned rn = (op >> 5) & 0x1F;
  240. unsigned shift = (op >> 22) & 3;
  241. unsigned imm = (op >> 10) & 0xFFF;
  242. if (shift == 1) {
  243. imm <<= 12;
  244. } else {
  245. //assert(shift == 0);
  246. if (shift > 1) continue;
  247. }
  248. //printf("%llx: ADD X%d, X%d, 0x%x\n", i, reg, rn, imm);
  249. value[reg] = value[rn] + imm;
  250. } else if ((op & 0xF9C00000) == 0xF9400000) {
  251. unsigned rn = (op >> 5) & 0x1F;
  252. unsigned imm = ((op >> 10) & 0xFFF) << 3;
  253. //printf("%llx: LDR X%d, [X%d, 0x%x]\n", i, reg, rn, imm);
  254. if (!imm) continue; // XXX not counted as true xref
  255. value[reg] = value[rn] + imm; // XXX address, not actual value
  256. /*} else if ((op & 0xF9C00000) == 0xF9000000) {
  257. unsigned rn = (op >> 5) & 0x1F;
  258. unsigned imm = ((op >> 10) & 0xFFF) << 3;
  259. //printf("%llx: STR X%d, [X%d, 0x%x]\n", i, reg, rn, imm);
  260. if (!imm) continue; // XXX not counted as true xref
  261. value[rn] = value[rn] + imm; // XXX address, not actual value*/
  262. } else if ((op & 0x9F000000) == 0x10000000) {
  263. signed adr = ((op & 0x60000000) >> 18) | ((op & 0xFFFFE0) << 8);
  264. //printf("%llx: ADR X%d, 0x%llx\n", i, reg, ((long long)adr >> 11) + i);
  265. value[reg] = ((long long)adr >> 11) + i;
  266. } else if ((op & 0xFF000000) == 0x58000000) {
  267. unsigned adr = (op & 0xFFFFE0) >> 3;
  268. //printf("%llx: LDR X%d, =0x%llx\n", i, reg, adr + i);
  269. value[reg] = adr + i; // XXX address, not actual value
  270. }
  271. if (value[reg] == what) {
  272. return i;
  273. }
  274. }
  275. return 0;
  276. }
  277. static addr_t
  278. calc64(const uint8_t *buf, addr_t start, addr_t end, int which)
  279. {
  280. addr_t i;
  281. uint64_t value[32];
  282. memset(value, 0, sizeof(value));
  283. end &= ~3;
  284. for (i = start & ~3; i < end; i += 4) {
  285. uint32_t op = *(uint32_t *)(buf + i);
  286. unsigned reg = op & 0x1F;
  287. if ((op & 0x9F000000) == 0x90000000) {
  288. signed adr = ((op & 0x60000000) >> 18) | ((op & 0xFFFFE0) << 8);
  289. //printf("%llx: ADRP X%d, 0x%llx\n", i, reg, ((long long)adr << 1) + (i & ~0xFFF));
  290. value[reg] = ((long long)adr << 1) + (i & ~0xFFF);
  291. /*} else if ((op & 0xFFE0FFE0) == 0xAA0003E0) {
  292. unsigned rd = op & 0x1F;
  293. unsigned rm = (op >> 16) & 0x1F;
  294. //printf("%llx: MOV X%d, X%d\n", i, rd, rm);
  295. value[rd] = value[rm];*/
  296. } else if ((op & 0xFF000000) == 0x91000000) {
  297. unsigned rn = (op >> 5) & 0x1F;
  298. unsigned shift = (op >> 22) & 3;
  299. unsigned imm = (op >> 10) & 0xFFF;
  300. if (shift == 1) {
  301. imm <<= 12;
  302. } else {
  303. //assert(shift == 0);
  304. if (shift > 1) continue;
  305. }
  306. //printf("%llx: ADD X%d, X%d, 0x%x\n", i, reg, rn, imm);
  307. value[reg] = value[rn] + imm;
  308. } else if ((op & 0xF9C00000) == 0xF9400000) {
  309. unsigned rn = (op >> 5) & 0x1F;
  310. unsigned imm = ((op >> 10) & 0xFFF) << 3;
  311. //printf("%llx: LDR X%d, [X%d, 0x%x]\n", i, reg, rn, imm);
  312. if (!imm) continue; // XXX not counted as true xref
  313. value[reg] = value[rn] + imm; // XXX address, not actual value
  314. } else if ((op & 0xF9C00000) == 0xF9000000) {
  315. unsigned rn = (op >> 5) & 0x1F;
  316. unsigned imm = ((op >> 10) & 0xFFF) << 3;
  317. //printf("%llx: STR X%d, [X%d, 0x%x]\n", i, reg, rn, imm);
  318. if (!imm) continue; // XXX not counted as true xref
  319. value[rn] = value[rn] + imm; // XXX address, not actual value
  320. } else if ((op & 0x9F000000) == 0x10000000) {
  321. signed adr = ((op & 0x60000000) >> 18) | ((op & 0xFFFFE0) << 8);
  322. //printf("%llx: ADR X%d, 0x%llx\n", i, reg, ((long long)adr >> 11) + i);
  323. value[reg] = ((long long)adr >> 11) + i;
  324. } else if ((op & 0xFF000000) == 0x58000000) {
  325. unsigned adr = (op & 0xFFFFE0) >> 3;
  326. //printf("%llx: LDR X%d, =0x%llx\n", i, reg, adr + i);
  327. value[reg] = adr + i; // XXX address, not actual value
  328. }
  329. }
  330. return value[which];
  331. }
  332. static addr_t
  333. calc64mov(const uint8_t *buf, addr_t start, addr_t end, int which)
  334. {
  335. addr_t i;
  336. uint64_t value[32];
  337. memset(value, 0, sizeof(value));
  338. end &= ~3;
  339. for (i = start & ~3; i < end; i += 4) {
  340. uint32_t op = *(uint32_t *)(buf + i);
  341. unsigned reg = op & 0x1F;
  342. uint64_t newval;
  343. int rv = DecodeMov(op, value[reg], 0, &newval);
  344. if (rv == 0) {
  345. if (((op >> 31) & 1) == 0) {
  346. newval &= 0xFFFFFFFF;
  347. }
  348. value[reg] = newval;
  349. }
  350. }
  351. return value[which];
  352. }
  353. static addr_t
  354. find_call64(const uint8_t *buf, addr_t start, size_t length)
  355. {
  356. return step64(buf, start, length, 0x94000000, 0xFC000000);
  357. }
  358. static addr_t
  359. follow_call64(const uint8_t *buf, addr_t call)
  360. {
  361. long long w;
  362. w = *(uint32_t *)(buf + call) & 0x3FFFFFF;
  363. w <<= 64 - 26;
  364. w >>= 64 - 26 - 2;
  365. return call + w;
  366. }
  367. static addr_t
  368. follow_cbz(const uint8_t *buf, addr_t cbz)
  369. {
  370. return cbz + ((*(int *)(buf + cbz) & 0x3FFFFE0) << 10 >> 13);
  371. }
  372. /* kernel iOS10 **************************************************************/
  373. #include <fcntl.h>
  374. #include <stdio.h>
  375. #include <stdlib.h>
  376. #include <unistd.h>
  377. #include <mach-o/loader.h>
  378. #ifdef __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__
  379. #include <mach/mach.h>
  380. size_t kread(uint64_t where, void *p, size_t size);
  381. #endif
  382. task_t tfp0;
  383. static uint8_t *kernel = NULL;
  384. static size_t kernel_size = 0;
  385. static addr_t xnucore_base = 0;
  386. static addr_t xnucore_size = 0;
  387. static addr_t prelink_base = 0;
  388. static addr_t prelink_size = 0;
  389. static addr_t cstring_base = 0;
  390. static addr_t cstring_size = 0;
  391. static addr_t pstring_base = 0;
  392. static addr_t pstring_size = 0;
  393. static addr_t kerndumpbase = -1;
  394. static addr_t kernel_entry = 0;
  395. static void *kernel_mh = 0;
  396. static addr_t kernel_delta = 0;
  397. int
  398. init_patchfinder(task_t taskfp0, addr_t base, const char *filename)
  399. {
  400. tfp0 = taskfp0;
  401. size_t rv;
  402. uint8_t buf[0x4000];
  403. unsigned i, j;
  404. const struct mach_header *hdr = (struct mach_header *)buf;
  405. const uint8_t *q;
  406. addr_t min = -1;
  407. addr_t max = 0;
  408. int is64 = 0;
  409. init_kernel(taskfp0);
  410. #ifdef __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__
  411. #define close(f)
  412. rv = tfp0_kread(base, buf, sizeof(buf));
  413. if (rv != sizeof(buf)) {
  414. printf("failed kread, got size: %zu \n", rv);
  415. return -1;
  416. }
  417. #else /* __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ */
  418. printf("this code right here has run ............. \n");
  419. int fd = open(filename, O_RDONLY);
  420. if (fd < 0) {
  421. printf("failed at open, got fd: %s \n", fd);
  422. return -1;
  423. }
  424. rv = rk32_via_tfp0(tfp0, fd);
  425. //rv = read(fd, buf, sizeof(buf));
  426. if (rv != sizeof(buf)) {
  427. close(fd);
  428. printf("failed at buf read, got rv: %d \n", rv);
  429. return -1;
  430. }
  431. #endif /* __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ */
  432. if (!MACHO(buf)) {
  433. close(fd);
  434. printf("failed macho, buf: %s \n", buf);
  435. return -1;
  436. }
  437. if (IS64(buf)) {
  438. is64 = 4;
  439. }
  440. q = buf + sizeof(struct mach_header) + is64;
  441. for (i = 0; i < hdr->ncmds; i++) {
  442. const struct load_command *cmd = (struct load_command *)q;
  443. if (cmd->cmd == LC_SEGMENT_64) {
  444. const struct segment_command_64 *seg = (struct segment_command_64 *)q;
  445. if (min > seg->vmaddr) {
  446. min = seg->vmaddr;
  447. }
  448. if (max < seg->vmaddr + seg->vmsize) {
  449. max = seg->vmaddr + seg->vmsize;
  450. }
  451. if (!strcmp(seg->segname, "__TEXT_EXEC")) {
  452. xnucore_base = seg->vmaddr;
  453. xnucore_size = seg->filesize;
  454. }
  455. if (!strcmp(seg->segname, "__PLK_TEXT_EXEC")) {
  456. prelink_base = seg->vmaddr;
  457. prelink_size = seg->filesize;
  458. }
  459. if (!strcmp(seg->segname, "__TEXT")) {
  460. const struct section_64 *sec = (struct section_64 *)(seg + 1);
  461. for (j = 0; j < seg->nsects; j++) {
  462. if (!strcmp(sec[j].sectname, "__cstring")) {
  463. cstring_base = sec[j].addr;
  464. cstring_size = sec[j].size;
  465. }
  466. }
  467. }
  468. if (!strcmp(seg->segname, "__PRELINK_TEXT")) {
  469. const struct section_64 *sec = (struct section_64 *)(seg + 1);
  470. for (j = 0; j < seg->nsects; j++) {
  471. if (!strcmp(sec[j].sectname, "__text")) {
  472. pstring_base = sec[j].addr;
  473. pstring_size = sec[j].size;
  474. }
  475. }
  476. }
  477. }
  478. if (cmd->cmd == LC_UNIXTHREAD) {
  479. uint32_t *ptr = (uint32_t *)(cmd + 1);
  480. uint32_t flavor = ptr[0];
  481. struct {
  482. uint64_t x[29]; /* General purpose registers x0-x28 */
  483. uint64_t fp; /* Frame pointer x29 */
  484. uint64_t lr; /* Link register x30 */
  485. uint64_t sp; /* Stack pointer x31 */
  486. uint64_t pc; /* Program counter */
  487. uint32_t cpsr; /* Current program status register */
  488. } *thread = (void *)(ptr + 2);
  489. if (flavor == 6) {
  490. kernel_entry = thread->pc;
  491. }
  492. }
  493. q = q + cmd->cmdsize;
  494. }
  495. kerndumpbase = min;
  496. xnucore_base -= kerndumpbase;
  497. prelink_base -= kerndumpbase;
  498. cstring_base -= kerndumpbase;
  499. pstring_base -= kerndumpbase;
  500. kernel_size = max - min;
  501. #ifdef __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__
  502. kernel = malloc(kernel_size);
  503. if (!kernel) {
  504. printf("failed to malloc kern \n");
  505. return -1;
  506. }
  507. rv = tfp0_kread(kerndumpbase, kernel, kernel_size);
  508. // rv = kread(kerndumpbase, kernel, kernel_size);
  509. if (rv != kernel_size) {
  510. free(kernel);
  511. printf("failed to kread kern, rv: %zu \n", rv);
  512. return -1;
  513. }
  514. kernel_mh = kernel + base - min;
  515. (void)filename;
  516. #undef close
  517. #else /* __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ */
  518. kernel = calloc(1, kernel_size);
  519. if (!kernel) {
  520. close(fd);
  521. printf("failed to calloc kern, kernel: %d \n", kernel);
  522. return -1;
  523. }
  524. q = buf + sizeof(struct mach_header) + is64;
  525. for (i = 0; i < hdr->ncmds; i++) {
  526. const struct load_command *cmd = (struct load_command *)q;
  527. if (cmd->cmd == LC_SEGMENT_64) {
  528. const struct segment_command_64 *seg = (struct segment_command_64 *)q;
  529. size_t sz = pread(fd, kernel + seg->vmaddr - min, seg->filesize, seg->fileoff);
  530. if (sz != seg->filesize) {
  531. close(fd);
  532. free(kernel);
  533. printf("sz != seg->filesize, sz: %zu", sz);
  534. return -1;
  535. }
  536. if (!kernel_mh) {
  537. kernel_mh = kernel + seg->vmaddr - min;
  538. }
  539. if (!strcmp(seg->segname, "__LINKEDIT")) {
  540. kernel_delta = seg->vmaddr - min - seg->fileoff;
  541. }
  542. }
  543. q = q + cmd->cmdsize;
  544. }
  545. close(fd);
  546. (void)base;
  547. #endif /* __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ */
  548. return 0;
  549. }
  550. void
  551. term_kernel(void)
  552. {
  553. free(kernel);
  554. }
  555. /* these operate on VA ******************************************************/
  556. #define INSN_RET 0xD65F03C0, 0xFFFFFFFF
  557. #define INSN_CALL 0x94000000, 0xFC000000
  558. #define INSN_B 0x14000000, 0xFC000000
  559. #define INSN_CBZ 0x34000000, 0xFC000000
  560. addr_t
  561. find_register_value(addr_t where, int reg)
  562. {
  563. addr_t val;
  564. addr_t bof = 0;
  565. where -= kerndumpbase;
  566. if (where > xnucore_base) {
  567. bof = bof64(kernel, xnucore_base, where);
  568. if (!bof) {
  569. bof = xnucore_base;
  570. }
  571. } else if (where > prelink_base) {
  572. bof = bof64(kernel, prelink_base, where);
  573. if (!bof) {
  574. bof = prelink_base;
  575. }
  576. }
  577. val = calc64(kernel, bof, where, reg);
  578. if (!val) {
  579. return 0;
  580. }
  581. return val + kerndumpbase;
  582. }
  583. addr_t
  584. find_reference(addr_t to, int n, int prelink)
  585. {
  586. addr_t ref, end;
  587. addr_t base = xnucore_base;
  588. addr_t size = xnucore_size;
  589. if (prelink) {
  590. base = prelink_base;
  591. size = prelink_size;
  592. }
  593. if (n <= 0) {
  594. n = 1;
  595. }
  596. end = base + size;
  597. to -= kerndumpbase;
  598. do {
  599. ref = xref64(kernel, base, end, to);
  600. if (!ref) {
  601. return 0;
  602. }
  603. base = ref + 4;
  604. } while (--n > 0);
  605. return ref + kerndumpbase;
  606. }
  607. addr_t
  608. find_strref(const char *string, int n, int prelink)
  609. {
  610. uint8_t *str;
  611. addr_t base = cstring_base;
  612. addr_t size = cstring_size;
  613. if (prelink) {
  614. base = pstring_base;
  615. size = pstring_size;
  616. }
  617. str = boyermoore_horspool_memmem(kernel + base, size, (uint8_t *)string, strlen(string));
  618. if (!str) {
  619. return 0;
  620. }
  621. return find_reference(str - kernel + kerndumpbase, n, prelink);
  622. }
  623. addr_t
  624. find_gPhysBase(void)
  625. {
  626. addr_t ret, val;
  627. // addr_t ref = find_strref("\"pmap_map_high_window_bd: insufficient pages", 1, 0);
  628. addr_t ref = find_strref("\"pmap_map_high_window_bd: area too large", 1, 0);
  629. if (!ref) {
  630. return 0;
  631. }
  632. ref -= kerndumpbase;
  633. ret = step64(kernel, ref, 64, INSN_RET);
  634. if (!ret) {
  635. return 0;
  636. }
  637. val = calc64(kernel, ref, ret, 8);
  638. if (!val) {
  639. return 0;
  640. }
  641. return val + kerndumpbase;
  642. }
  643. addr_t
  644. find_kernel_pmap(void)
  645. {
  646. addr_t call, bof, val;
  647. addr_t ref = find_strref("\"pmap_map_bd\"", 1, 0);
  648. if (!ref) {
  649. return 0;
  650. }
  651. ref -= kerndumpbase;
  652. call = step64_back(kernel, ref, 64, INSN_CALL);
  653. if (!call) {
  654. return 0;
  655. }
  656. bof = bof64(kernel, xnucore_base, call);
  657. if (!bof) {
  658. return 0;
  659. }
  660. val = calc64(kernel, bof, call, 2);
  661. if (!val) {
  662. return 0;
  663. }
  664. return val + kerndumpbase;
  665. }
  666. addr_t
  667. find_amfiret(void)
  668. {
  669. addr_t ret;
  670. addr_t ref = find_strref("AMFI: hook..execve() killing pid %u: %s\n", 1, 1);
  671. if (!ref) {
  672. return 0;
  673. }
  674. ref -= kerndumpbase;
  675. ret = step64(kernel, ref, 512, INSN_RET);
  676. if (!ret) {
  677. return 0;
  678. }
  679. return ret + kerndumpbase;
  680. }
  681. addr_t
  682. find_ret_0(void)
  683. {
  684. addr_t off;
  685. uint32_t *k;
  686. k = (uint32_t *)(kernel + xnucore_base);
  687. for (off = 0; off < xnucore_size - 4; off += 4, k++) {
  688. if (k[0] == 0xAA1F03E0 && k[1] == 0xD65F03C0) {
  689. return off + xnucore_base + kerndumpbase;
  690. }
  691. }
  692. k = (uint32_t *)(kernel + prelink_base);
  693. for (off = 0; off < prelink_size - 4; off += 4, k++) {
  694. if (k[0] == 0xAA1F03E0 && k[1] == 0xD65F03C0) {
  695. return off + prelink_base + kerndumpbase;
  696. }
  697. }
  698. return 0;
  699. }
  700. addr_t
  701. find_amfi_memcmpstub(void)
  702. {
  703. addr_t call, dest, reg;
  704. addr_t ref = find_strref("%s: Possible race detected. Rejecting.", 1, 1);
  705. if (!ref) {
  706. return 0;
  707. }
  708. ref -= kerndumpbase;
  709. call = step64_back(kernel, ref, 64, INSN_CALL);
  710. if (!call) {
  711. return 0;
  712. }
  713. dest = follow_call64(kernel, call);
  714. if (!dest) {
  715. return 0;
  716. }
  717. reg = calc64(kernel, dest, dest + 8, 16);
  718. if (!reg) {
  719. return 0;
  720. }
  721. return reg + kerndumpbase;
  722. }
  723. addr_t
  724. find_sbops(void)
  725. {
  726. addr_t off, what;
  727. uint8_t *str = boyermoore_horspool_memmem(kernel + pstring_base, pstring_size, (uint8_t *)"Seatbelt sandbox policy", sizeof("Seatbelt sandbox policy") - 1);
  728. if (!str) {
  729. return 0;
  730. }
  731. what = str - kernel + kerndumpbase;
  732. for (off = 0; off < kernel_size - prelink_base; off += 8) {
  733. if (*(uint64_t *)(kernel + prelink_base + off) == what) {
  734. return *(uint64_t *)(kernel + prelink_base + off + 24);
  735. }
  736. }
  737. return 0;
  738. }
  739. addr_t
  740. find_lwvm_mapio_patch(void)
  741. {
  742. addr_t call, dest, reg;
  743. addr_t ref = find_strref("_mapForIO", 1, 1);
  744. if (!ref) {
  745. return 0;
  746. }
  747. ref -= kerndumpbase;
  748. call = step64(kernel, ref, 64, INSN_CALL);
  749. if (!call) {
  750. return 0;
  751. }
  752. call = step64(kernel, call + 4, 64, INSN_CALL);
  753. if (!call) {
  754. return 0;
  755. }
  756. dest = follow_call64(kernel, call);
  757. if (!dest) {
  758. return 0;
  759. }
  760. reg = calc64(kernel, dest, dest + 8, 16);
  761. if (!reg) {
  762. return 0;
  763. }
  764. return reg + kerndumpbase;
  765. }
  766. addr_t
  767. find_lwvm_mapio_newj(void)
  768. {
  769. addr_t call;
  770. addr_t ref = find_strref("_mapForIO", 1, 1);
  771. if (!ref) {
  772. return 0;
  773. }
  774. ref -= kerndumpbase;
  775. call = step64(kernel, ref, 64, INSN_CALL);
  776. if (!call) {
  777. return 0;
  778. }
  779. call = step64(kernel, call + 4, 64, INSN_CALL);
  780. if (!call) {
  781. return 0;
  782. }
  783. call = step64(kernel, call + 4, 64, INSN_CALL);
  784. if (!call) {
  785. return 0;
  786. }
  787. call = step64_back(kernel, call, 64, INSN_B);
  788. if (!call) {
  789. return 0;
  790. }
  791. return call + 4 + kerndumpbase;
  792. }
  793. addr_t
  794. find_cpacr_write(void)
  795. {
  796. addr_t off;
  797. uint32_t *k;
  798. k = (uint32_t *)(kernel + xnucore_base);
  799. for (off = 0; off < xnucore_size - 4; off += 4, k++) {
  800. if (k[0] == 0xd5181040) {
  801. return off + xnucore_base + kerndumpbase;
  802. }
  803. }
  804. return 0;
  805. }
  806. addr_t
  807. find_str(const char *string)
  808. {
  809. uint8_t *str = boyermoore_horspool_memmem(kernel, kernel_size, (uint8_t *)string, strlen(string));
  810. if (!str) {
  811. return 0;
  812. }
  813. return str - kernel + kerndumpbase;
  814. }
  815. addr_t
  816. find_entry(void)
  817. {
  818. /* XXX returns an unslid address */
  819. return kernel_entry;
  820. }
  821. const unsigned char *
  822. find_mh(void)
  823. {
  824. return kernel_mh;
  825. }
  826. addr_t
  827. find_amfiops(void)
  828. {
  829. addr_t off, what;
  830. uint8_t *str = boyermoore_horspool_memmem(kernel + pstring_base, pstring_size, (uint8_t *)"Apple Mobile File Integrity", sizeof("Apple Mobile File Integrity") - 1);
  831. if (!str) {
  832. return 0;
  833. }
  834. what = str - kernel + kerndumpbase;
  835. /* XXX will only work on a dumped kernel */
  836. for (off = 0; off < kernel_size - prelink_base; off += 8) {
  837. if (*(uint64_t *)(kernel + prelink_base + off) == what) {
  838. return *(uint64_t *)(kernel + prelink_base + off + 0x18);
  839. }
  840. }
  841. return 0;
  842. }
  843. addr_t
  844. find_sysbootnonce(void)
  845. {
  846. addr_t off, what;
  847. uint8_t *str = boyermoore_horspool_memmem(kernel + cstring_base, cstring_size, (uint8_t *)"com.apple.System.boot-nonce", sizeof("com.apple.System.boot-nonce") - 1);
  848. if (!str) {
  849. return 0;
  850. }
  851. what = str - kernel + kerndumpbase;
  852. for (off = 0; off < kernel_size - xnucore_base; off += 8) {
  853. if (*(uint64_t *)(kernel + xnucore_base + off) == what) {
  854. return xnucore_base + off + 8 + 4 + kerndumpbase;
  855. }
  856. }
  857. return 0;
  858. }
  859. uint64_t find_copyout(void) {
  860. // Find the first reference to the string
  861. addr_t ref = find_strref("\"%s(%p, %p, %lu) - transfer too large\"", 2, 0);
  862. if (!ref) {
  863. return 0;
  864. }
  865. ref -= kerndumpbase;
  866. uint64_t start = 0;
  867. for (int i = 4; i < 0x100*4; i+=4) {
  868. uint32_t op = *(uint32_t*)(kernel+ref-i);
  869. if (op == 0xd10143ff) { // SUB SP, SP, #0x50
  870. start = ref-i;
  871. break;
  872. }
  873. }
  874. if (!start) {
  875. return 0;
  876. }
  877. return start + kerndumpbase;
  878. }
  879. uint64_t find_bzero(void) {
  880. // Just find SYS #3, c7, c4, #1, X3, then get the start of that function
  881. addr_t off;
  882. uint32_t *k;
  883. k = (uint32_t *)(kernel + xnucore_base);
  884. for (off = 0; off < xnucore_size - 4; off += 4, k++) {
  885. if (k[0] == 0xd50b7423) {
  886. off += xnucore_base;
  887. break;
  888. }
  889. }
  890. uint64_t start = bof64(kernel, xnucore_base, off);
  891. if (!start) {
  892. return 0;
  893. }
  894. return start + kerndumpbase;
  895. }
  896. addr_t find_bcopy(void) {
  897. // Jumps straight into memmove after switching x0 and x1 around
  898. // Guess we just find the switch and that's it
  899. addr_t off;
  900. uint32_t *k;
  901. k = (uint32_t *)(kernel + xnucore_base);
  902. for (off = 0; off < xnucore_size - 4; off += 4, k++) {
  903. if (k[0] == 0xAA0003E3 && k[1] == 0xAA0103E0 && k[2] == 0xAA0303E1 && k[3] == 0xd503201F) {
  904. return off + xnucore_base + kerndumpbase;
  905. }
  906. }
  907. k = (uint32_t *)(kernel + prelink_base);
  908. for (off = 0; off < prelink_size - 4; off += 4, k++) {
  909. if (k[0] == 0xAA0003E3 && k[1] == 0xAA0103E0 && k[2] == 0xAA0303E1 && k[3] == 0xd503201F) {
  910. return off + prelink_base + kerndumpbase;
  911. }
  912. }
  913. return 0;
  914. }
  915. addr_t find_trustcache(void) {
  916. addr_t call, func, val;
  917. addr_t ref = find_strref("com.apple.MobileFileIntegrity", 1, 1);
  918. if (!ref) {
  919. printf("didnt find string ref\n");
  920. return 0;
  921. }
  922. ref -= kerndumpbase;
  923. call = step64(kernel, ref, 32, INSN_CALL);
  924. if (!call) {
  925. printf("couldn't find the call\n");
  926. return 0;
  927. }
  928. call = step64(kernel, call+4, 32, INSN_CALL);
  929. func = follow_call64(kernel, call);
  930. if (!func) {
  931. printf("couldn't follow the call\n");
  932. return 0;
  933. }
  934. val = calc64(kernel, func, func + 16, 8);
  935. if (!val) {
  936. return 0;
  937. }
  938. return val + kerndumpbase;
  939. }
  940. addr_t find_amficache(void) {
  941. addr_t call, func, bof, val;
  942. addr_t ref = find_strref("com.apple.MobileFileIntegrity", 1, 1);
  943. if (!ref) {
  944. printf("didnt find string ref\n");
  945. return 0;
  946. }
  947. ref -= kerndumpbase;
  948. call = step64(kernel, ref, 32, INSN_CALL);
  949. if (!call) {
  950. printf("couldn't find the call\n");
  951. return 0;
  952. }
  953. call = step64(kernel, call+4, 32, INSN_CALL);
  954. func = follow_call64(kernel, call);
  955. if (!func) {
  956. printf("couldn't follow the call\n");
  957. return 0;
  958. }
  959. bof = bof64(kernel, func - 256, func);
  960. if (!bof) {
  961. printf("couldn't find the start of the function\n");
  962. return 0;
  963. }
  964. val = calc64(kernel, bof, func, 9);
  965. if (!val) {
  966. printf("couldn't find x9\n");
  967. return 0;
  968. }
  969. return val + kerndumpbase;
  970. }
  971. // #ifdef HAVE_MAIN
  972. /* extra_recipe **************************************************************/
  973. #define INSN_STR8 0xF9000000 | 8, 0xFFC00000 | 0x1F
  974. addr_t
  975. find_AGXCommandQueue_vtable(void)
  976. {
  977. addr_t val, str8;
  978. addr_t ref = find_strref("AGXCommandQueue", 1, 1);
  979. if (!ref) {
  980. return 0;
  981. }
  982. val = find_register_value(ref, 0);
  983. if (!val) {
  984. return 0;
  985. }
  986. ref = find_reference(val, 1, 1);
  987. if (!ref) {
  988. return 0;
  989. }
  990. ref -= kerndumpbase;
  991. str8 = step64(kernel, ref, 32, INSN_STR8);
  992. if (!str8) {
  993. return 0;
  994. }
  995. val = calc64(kernel, ref, str8, 8);
  996. if (!val) {
  997. return 0;
  998. }
  999. return val + kerndumpbase;
  1000. }
  1001. addr_t
  1002. find_allproc(void)
  1003. {
  1004. addr_t val, bof, str8;
  1005. addr_t ref = find_strref("\"pgrp_add : pgrp is dead adding process\"", 1, 0); // modified
  1006. if (!ref) {
  1007. return 0;
  1008. }
  1009. ref -= kerndumpbase;
  1010. bof = bof64(kernel, xnucore_base, ref);
  1011. if (!bof) {
  1012. return 0;
  1013. }
  1014. str8 = step64_back(kernel, ref, ref - bof, INSN_STR8);
  1015. if (!str8) {
  1016. return 0;
  1017. }
  1018. val = calc64(kernel, bof, str8, 8);
  1019. if (!val) {
  1020. return 0;
  1021. }
  1022. return val + kerndumpbase;
  1023. }
  1024. addr_t
  1025. find_call5(void)
  1026. {
  1027. addr_t bof;
  1028. uint8_t gadget[] = { 0x95, 0x5A, 0x40, 0xF9, 0x68, 0x02, 0x40, 0xF9, 0x88, 0x5A, 0x00, 0xF9, 0x60, 0xA2, 0x40, 0xA9 };
  1029. uint8_t *str = boyermoore_horspool_memmem(kernel + prelink_base, prelink_size, gadget, sizeof(gadget));
  1030. if (!str) {
  1031. return 0;
  1032. }
  1033. bof = bof64(kernel, prelink_base, str - kernel);
  1034. if (!bof) {
  1035. return 0;
  1036. }
  1037. return bof + kerndumpbase;
  1038. }
  1039. addr_t
  1040. find_realhost(addr_t priv)
  1041. {
  1042. addr_t val;
  1043. if (!priv) {
  1044. return 0;
  1045. }
  1046. priv -= kerndumpbase;
  1047. val = calc64(kernel, priv, priv + 12, 0);
  1048. if (!val) {
  1049. return 0;
  1050. }
  1051. return val + kerndumpbase;
  1052. }
  1053. #include <mach-o/nlist.h>
  1054. addr_t
  1055. find_symbol(const char *symbol)
  1056. {
  1057. unsigned i;
  1058. const struct mach_header *hdr = kernel_mh;
  1059. const uint8_t *q;
  1060. int is64 = 0;
  1061. if (IS64(hdr)) {
  1062. is64 = 4;
  1063. }
  1064. /* XXX will only work on a decrypted kernel */
  1065. if (!kernel_delta) {
  1066. return 0;
  1067. }
  1068. /* XXX I should cache these. ohwell... */
  1069. q = (uint8_t *)(hdr + 1) + is64;
  1070. for (i = 0; i < hdr->ncmds; i++) {
  1071. const struct load_command *cmd = (struct load_command *)q;
  1072. if (cmd->cmd == LC_SYMTAB) {
  1073. const struct symtab_command *sym = (struct symtab_command *)q;
  1074. const char *stroff = (const char *)kernel + sym->stroff + kernel_delta;
  1075. if (is64) {
  1076. uint32_t k;
  1077. const struct nlist_64 *s = (struct nlist_64 *)(kernel + sym->symoff + kernel_delta);
  1078. for (k = 0; k < sym->nsyms; k++) {
  1079. if (s[k].n_type & N_STAB) {
  1080. continue;
  1081. }
  1082. if (s[k].n_value && (s[k].n_type & N_TYPE) != N_INDR) {
  1083. if (!strcmp(symbol, stroff + s[k].n_un.n_strx)) {
  1084. /* XXX this is an unslid address */
  1085. return s[k].n_value;
  1086. }
  1087. }
  1088. }
  1089. }
  1090. }
  1091. q = q + cmd->cmdsize;
  1092. }
  1093. return 0;
  1094. }
  1095. /* g0blin ****z****************************************************************/
  1096. addr_t find_sandbox_label_update_execve(void) {
  1097. addr_t ref;
  1098. for (int i = 1; (ref = find_strref("process-exec denied while updating label", i, 1)); i++) {
  1099. if (ref) {
  1100. printf("process-exec string at 0x%llx\n", ref);
  1101. ref = ref - 0x368;
  1102. printf("patch location -> 0x%llx\n", ref);
  1103. return ref;
  1104. }
  1105. }
  1106. // addr_t off, what;
  1107. // uint8_t *str = boyermoore_horspool_memmem(kernel + pstring_base, pstring_size, (uint8_t *)"process-exec denied", sizeof("process-exec denied") - 1);
  1108. // if (str) {
  1109. // what = str - kernel + kerndumpbase;
  1110. // for (off = 0; off < kernel_size - prelink_base; off += 8) {
  1111. // if (*(uint64_t *)(kernel + prelink_base + off) == what) {
  1112. // ref = *(uint64_t *)(kernel + prelink_base + off + 24);
  1113. // printf("found process-exec denied at: 0x%llx\n", ref);
  1114. // }
  1115. // }
  1116. // ref = ref - 0x368;
  1117. // }
  1118. return 0;
  1119. }
  1120. /* test **********************************************************************/
  1121. /*
  1122. int
  1123. main(int argc, char **argv)
  1124. {
  1125. int rv;
  1126. addr_t base = 0;
  1127. const addr_t vm_kernel_slide = 0;
  1128. rv = init_kernel(base, (argc > 1) ? argv[1] : "krnl");
  1129. assert(rv == 0);
  1130. addr_t AGXCommandQueue_vtable = find_AGXCommandQueue_vtable();
  1131. printf("\t\t\t<string>0x%llx</string>\n", AGXCommandQueue_vtable - vm_kernel_slide);
  1132. addr_t OSData_getMetaClass = find_symbol("__ZNK6OSData12getMetaClassEv");
  1133. printf("\t\t\t<string>0x%llx</string>\n", OSData_getMetaClass);
  1134. addr_t OSSerializer_serialize = find_symbol("__ZNK12OSSerializer9serializeEP11OSSerialize");
  1135. printf("\t\t\t<string>0x%llx</string>\n", OSSerializer_serialize);
  1136. addr_t k_uuid_copy = find_symbol("_uuid_copy");
  1137. printf("\t\t\t<string>0x%llx</string>\n", k_uuid_copy);
  1138. addr_t allproc = find_allproc();
  1139. printf("\t\t\t<string>0x%llx</string>\n", allproc);
  1140. addr_t realhost = find_realhost(find_symbol("_host_priv_self") + vm_kernel_slide);
  1141. printf("\t\t\t<string>0x%llx</string>\n", realhost - vm_kernel_slide);
  1142. addr_t call5 = find_call5();
  1143. printf("\t\t\t<string>0x%llx</string>\n", call5 - vm_kernel_slide);
  1144. assert(find_symbol("_rootvnode") == find_gPhysBase() + 0x38 - vm_kernel_slide);
  1145. term_kernel();
  1146. return 0;
  1147. }*/
  1148. // #endif /* HAVE_MAIN */