]> git.cameronkatri.com Git - ldid.git/blob - ldid.cpp
Swap libplist with CoreFoundation (for Substrate).
[ldid.git] / ldid.cpp
1 /* ldid - (Mach-O) Link-Loader Identity Editor
2 * Copyright (C) 2007-2015 Jay Freeman (saurik)
3 */
4
5 /* GNU Affero General Public License, Version 3 {{{ */
6 /*
7 * This program is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU Affero General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU Affero General Public License for more details.
16
17 * You should have received a copy of the GNU Affero General Public License
18 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 **/
20 /* }}} */
21
22 #include <cstdio>
23 #include <cstdlib>
24 #include <cstring>
25 #include <fstream>
26 #include <iostream>
27 #include <memory>
28 #include <set>
29 #include <sstream>
30 #include <string>
31 #include <vector>
32
33 #include <dirent.h>
34 #include <errno.h>
35 #include <fcntl.h>
36 #include <regex.h>
37 #include <stdbool.h>
38 #include <stdint.h>
39 #include <unistd.h>
40
41 #include <sys/mman.h>
42 #include <sys/stat.h>
43 #include <sys/types.h>
44
45 #ifndef LDID_NOSMIME
46 #include <openssl/err.h>
47 #include <openssl/pem.h>
48 #include <openssl/pkcs7.h>
49 #include <openssl/pkcs12.h>
50 #endif
51
52 #ifdef __APPLE__
53 #include <CommonCrypto/CommonDigest.h>
54
55 #define LDID_SHA1_DIGEST_LENGTH CC_SHA1_DIGEST_LENGTH
56 #define LDID_SHA1 CC_SHA1
57 #define LDID_SHA1_CTX CC_SHA1_CTX
58 #define LDID_SHA1_Init CC_SHA1_Init
59 #define LDID_SHA1_Update CC_SHA1_Update
60 #define LDID_SHA1_Final CC_SHA1_Final
61
62 #define LDID_SHA256_DIGEST_LENGTH CC_SHA256_DIGEST_LENGTH
63 #define LDID_SHA256 CC_SHA256
64 #define LDID_SHA256_CTX CC_SHA256_CTX
65 #define LDID_SHA256_Init CC_SHA256_Init
66 #define LDID_SHA256_Update CC_SHA256_Update
67 #define LDID_SHA256_Final CC_SHA256_Final
68 #else
69 #include <openssl/sha.h>
70
71 #define LDID_SHA1_DIGEST_LENGTH SHA_DIGEST_LENGTH
72 #define LDID_SHA1 SHA1
73 #define LDID_SHA1_CTX SHA_CTX
74 #define LDID_SHA1_Init SHA1_Init
75 #define LDID_SHA1_Update SHA1_Update
76 #define LDID_SHA1_Final SHA1_Final
77
78 #define LDID_SHA256_DIGEST_LENGTH SHA256_DIGEST_LENGTH
79 #define LDID_SHA256 SHA256
80 #define LDID_SHA256_CTX SHA256_CTX
81 #define LDID_SHA256_Init SHA256_Init
82 #define LDID_SHA256_Update SHA256_Update
83 #define LDID_SHA256_Final SHA256_Final
84 #endif
85
86 #ifndef LDID_NOPLIST
87 #include <plist/plist.h>
88 #elif __APPLE__
89 #include <CoreFoundation/CoreFoundation.h>
90 #endif
91
92 #include "ldid.hpp"
93
94 #define _assert___(line) \
95 #line
96 #define _assert__(line) \
97 _assert___(line)
98
99 #ifndef $
100 #define $(value) value
101 #endif
102
103 #ifdef __EXCEPTIONS
104 #define _assert_(expr, format, ...) \
105 do if (!(expr)) { \
106 fprintf(stderr, $("%s(%u): _assert(): " format "\n"), __FILE__, __LINE__, ## __VA_ARGS__); \
107 throw $(__FILE__ "(" _assert__(__LINE__) "): _assert(" #expr ")"); \
108 } while (false)
109 #else
110 // XXX: this is not acceptable
111 #define _assert_(expr, format, ...) \
112 do if (!(expr)) { \
113 fprintf(stderr, $("%s(%u): _assert(): " format "\n"), __FILE__, __LINE__, ## __VA_ARGS__); \
114 exit(-1); \
115 } while (false)
116 #endif
117
118 #define _assert(expr) \
119 _assert_(expr, "%s", $(#expr))
120
121 #define _syscall(expr, ...) [&] { for (;;) { \
122 auto _value(expr); \
123 if ((long) _value != -1) \
124 return _value; \
125 int error(errno); \
126 if (error == EINTR) \
127 continue; \
128 /* XXX: EINTR is included in this list to fix g++ */ \
129 for (auto success : (long[]) {EINTR, __VA_ARGS__}) \
130 if (error == success) \
131 return (decltype(expr)) -success; \
132 _assert_(false, "errno=%u", error); \
133 } }()
134
135 #define _trace() \
136 fprintf(stderr, $("_trace(%s:%u): %s\n"), __FILE__, __LINE__, $(__FUNCTION__))
137
138 #define _not(type) \
139 ((type) ~ (type) 0)
140
141 #define _packed \
142 __attribute__((packed))
143
144 template <typename Type_>
145 struct Iterator_ {
146 typedef typename Type_::const_iterator Result;
147 };
148
149 #define _foreach(item, list) \
150 for (bool _stop(true); _stop; ) \
151 for (const __typeof__(list) &_list = (list); _stop; _stop = false) \
152 for (Iterator_<__typeof__(list)>::Result _item = _list.begin(); _item != _list.end(); ++_item) \
153 for (bool _suck(true); _suck; _suck = false) \
154 for (const __typeof__(*_item) &item = *_item; _suck; _suck = false)
155
156 class _Scope {
157 };
158
159 template <typename Function_>
160 class Scope :
161 public _Scope
162 {
163 private:
164 Function_ function_;
165
166 public:
167 Scope(const Function_ &function) :
168 function_(function)
169 {
170 }
171
172 ~Scope() {
173 function_();
174 }
175 };
176
177 template <typename Function_>
178 Scope<Function_> _scope(const Function_ &function) {
179 return Scope<Function_>(function);
180 }
181
182 #define _scope__(counter, function) \
183 __attribute__((__unused__)) \
184 const _Scope &_scope ## counter(_scope([&]function))
185 #define _scope_(counter, function) \
186 _scope__(counter, function)
187 #define _scope(function) \
188 _scope_(__COUNTER__, function)
189
190 #define CPU_ARCH_MASK uint32_t(0xff000000)
191 #define CPU_ARCH_ABI64 uint32_t(0x01000000)
192
193 #define CPU_TYPE_ANY uint32_t(-1)
194 #define CPU_TYPE_VAX uint32_t( 1)
195 #define CPU_TYPE_MC680x0 uint32_t( 6)
196 #define CPU_TYPE_X86 uint32_t( 7)
197 #define CPU_TYPE_MC98000 uint32_t(10)
198 #define CPU_TYPE_HPPA uint32_t(11)
199 #define CPU_TYPE_ARM uint32_t(12)
200 #define CPU_TYPE_MC88000 uint32_t(13)
201 #define CPU_TYPE_SPARC uint32_t(14)
202 #define CPU_TYPE_I860 uint32_t(15)
203 #define CPU_TYPE_POWERPC uint32_t(18)
204
205 #define CPU_TYPE_I386 CPU_TYPE_X86
206
207 #define CPU_TYPE_ARM64 (CPU_ARCH_ABI64 | CPU_TYPE_ARM)
208 #define CPU_TYPE_POWERPC64 (CPU_ARCH_ABI64 | CPU_TYPE_POWERPC)
209 #define CPU_TYPE_X86_64 (CPU_ARCH_ABI64 | CPU_TYPE_X86)
210
211 struct fat_header {
212 uint32_t magic;
213 uint32_t nfat_arch;
214 } _packed;
215
216 #define FAT_MAGIC 0xcafebabe
217 #define FAT_CIGAM 0xbebafeca
218
219 struct fat_arch {
220 uint32_t cputype;
221 uint32_t cpusubtype;
222 uint32_t offset;
223 uint32_t size;
224 uint32_t align;
225 } _packed;
226
227 struct mach_header {
228 uint32_t magic;
229 uint32_t cputype;
230 uint32_t cpusubtype;
231 uint32_t filetype;
232 uint32_t ncmds;
233 uint32_t sizeofcmds;
234 uint32_t flags;
235 } _packed;
236
237 #define MH_MAGIC 0xfeedface
238 #define MH_CIGAM 0xcefaedfe
239
240 #define MH_MAGIC_64 0xfeedfacf
241 #define MH_CIGAM_64 0xcffaedfe
242
243 #define MH_DYLDLINK 0x4
244
245 #define MH_OBJECT 0x1
246 #define MH_EXECUTE 0x2
247 #define MH_DYLIB 0x6
248 #define MH_BUNDLE 0x8
249 #define MH_DYLIB_STUB 0x9
250
251 struct load_command {
252 uint32_t cmd;
253 uint32_t cmdsize;
254 } _packed;
255
256 #define LC_REQ_DYLD uint32_t(0x80000000)
257
258 #define LC_SEGMENT uint32_t(0x01)
259 #define LC_SYMTAB uint32_t(0x02)
260 #define LC_DYSYMTAB uint32_t(0x0b)
261 #define LC_LOAD_DYLIB uint32_t(0x0c)
262 #define LC_ID_DYLIB uint32_t(0x0d)
263 #define LC_SEGMENT_64 uint32_t(0x19)
264 #define LC_UUID uint32_t(0x1b)
265 #define LC_CODE_SIGNATURE uint32_t(0x1d)
266 #define LC_SEGMENT_SPLIT_INFO uint32_t(0x1e)
267 #define LC_REEXPORT_DYLIB uint32_t(0x1f | LC_REQ_DYLD)
268 #define LC_ENCRYPTION_INFO uint32_t(0x21)
269 #define LC_DYLD_INFO uint32_t(0x22)
270 #define LC_DYLD_INFO_ONLY uint32_t(0x22 | LC_REQ_DYLD)
271 #define LC_ENCRYPTION_INFO_64 uint32_t(0x2c)
272
273 union Version {
274 struct {
275 uint8_t patch;
276 uint8_t minor;
277 uint16_t major;
278 } _packed;
279
280 uint32_t value;
281 };
282
283 struct dylib {
284 uint32_t name;
285 uint32_t timestamp;
286 uint32_t current_version;
287 uint32_t compatibility_version;
288 } _packed;
289
290 struct dylib_command {
291 uint32_t cmd;
292 uint32_t cmdsize;
293 struct dylib dylib;
294 } _packed;
295
296 struct uuid_command {
297 uint32_t cmd;
298 uint32_t cmdsize;
299 uint8_t uuid[16];
300 } _packed;
301
302 struct symtab_command {
303 uint32_t cmd;
304 uint32_t cmdsize;
305 uint32_t symoff;
306 uint32_t nsyms;
307 uint32_t stroff;
308 uint32_t strsize;
309 } _packed;
310
311 struct dyld_info_command {
312 uint32_t cmd;
313 uint32_t cmdsize;
314 uint32_t rebase_off;
315 uint32_t rebase_size;
316 uint32_t bind_off;
317 uint32_t bind_size;
318 uint32_t weak_bind_off;
319 uint32_t weak_bind_size;
320 uint32_t lazy_bind_off;
321 uint32_t lazy_bind_size;
322 uint32_t export_off;
323 uint32_t export_size;
324 } _packed;
325
326 struct dysymtab_command {
327 uint32_t cmd;
328 uint32_t cmdsize;
329 uint32_t ilocalsym;
330 uint32_t nlocalsym;
331 uint32_t iextdefsym;
332 uint32_t nextdefsym;
333 uint32_t iundefsym;
334 uint32_t nundefsym;
335 uint32_t tocoff;
336 uint32_t ntoc;
337 uint32_t modtaboff;
338 uint32_t nmodtab;
339 uint32_t extrefsymoff;
340 uint32_t nextrefsyms;
341 uint32_t indirectsymoff;
342 uint32_t nindirectsyms;
343 uint32_t extreloff;
344 uint32_t nextrel;
345 uint32_t locreloff;
346 uint32_t nlocrel;
347 } _packed;
348
349 struct dylib_table_of_contents {
350 uint32_t symbol_index;
351 uint32_t module_index;
352 } _packed;
353
354 struct dylib_module {
355 uint32_t module_name;
356 uint32_t iextdefsym;
357 uint32_t nextdefsym;
358 uint32_t irefsym;
359 uint32_t nrefsym;
360 uint32_t ilocalsym;
361 uint32_t nlocalsym;
362 uint32_t iextrel;
363 uint32_t nextrel;
364 uint32_t iinit_iterm;
365 uint32_t ninit_nterm;
366 uint32_t objc_module_info_addr;
367 uint32_t objc_module_info_size;
368 } _packed;
369
370 struct dylib_reference {
371 uint32_t isym:24;
372 uint32_t flags:8;
373 } _packed;
374
375 struct relocation_info {
376 int32_t r_address;
377 uint32_t r_symbolnum:24;
378 uint32_t r_pcrel:1;
379 uint32_t r_length:2;
380 uint32_t r_extern:1;
381 uint32_t r_type:4;
382 } _packed;
383
384 struct nlist {
385 union {
386 char *n_name;
387 int32_t n_strx;
388 } n_un;
389
390 uint8_t n_type;
391 uint8_t n_sect;
392 uint8_t n_desc;
393 uint32_t n_value;
394 } _packed;
395
396 struct segment_command {
397 uint32_t cmd;
398 uint32_t cmdsize;
399 char segname[16];
400 uint32_t vmaddr;
401 uint32_t vmsize;
402 uint32_t fileoff;
403 uint32_t filesize;
404 uint32_t maxprot;
405 uint32_t initprot;
406 uint32_t nsects;
407 uint32_t flags;
408 } _packed;
409
410 struct segment_command_64 {
411 uint32_t cmd;
412 uint32_t cmdsize;
413 char segname[16];
414 uint64_t vmaddr;
415 uint64_t vmsize;
416 uint64_t fileoff;
417 uint64_t filesize;
418 uint32_t maxprot;
419 uint32_t initprot;
420 uint32_t nsects;
421 uint32_t flags;
422 } _packed;
423
424 struct section {
425 char sectname[16];
426 char segname[16];
427 uint32_t addr;
428 uint32_t size;
429 uint32_t offset;
430 uint32_t align;
431 uint32_t reloff;
432 uint32_t nreloc;
433 uint32_t flags;
434 uint32_t reserved1;
435 uint32_t reserved2;
436 } _packed;
437
438 struct section_64 {
439 char sectname[16];
440 char segname[16];
441 uint64_t addr;
442 uint64_t size;
443 uint32_t offset;
444 uint32_t align;
445 uint32_t reloff;
446 uint32_t nreloc;
447 uint32_t flags;
448 uint32_t reserved1;
449 uint32_t reserved2;
450 uint32_t reserved3;
451 } _packed;
452
453 struct linkedit_data_command {
454 uint32_t cmd;
455 uint32_t cmdsize;
456 uint32_t dataoff;
457 uint32_t datasize;
458 } _packed;
459
460 struct encryption_info_command {
461 uint32_t cmd;
462 uint32_t cmdsize;
463 uint32_t cryptoff;
464 uint32_t cryptsize;
465 uint32_t cryptid;
466 } _packed;
467
468 #define BIND_OPCODE_MASK 0xf0
469 #define BIND_IMMEDIATE_MASK 0x0f
470 #define BIND_OPCODE_DONE 0x00
471 #define BIND_OPCODE_SET_DYLIB_ORDINAL_IMM 0x10
472 #define BIND_OPCODE_SET_DYLIB_ORDINAL_ULEB 0x20
473 #define BIND_OPCODE_SET_DYLIB_SPECIAL_IMM 0x30
474 #define BIND_OPCODE_SET_SYMBOL_TRAILING_FLAGS_IMM 0x40
475 #define BIND_OPCODE_SET_TYPE_IMM 0x50
476 #define BIND_OPCODE_SET_ADDEND_SLEB 0x60
477 #define BIND_OPCODE_SET_SEGMENT_AND_OFFSET_ULEB 0x70
478 #define BIND_OPCODE_ADD_ADDR_ULEB 0x80
479 #define BIND_OPCODE_DO_BIND 0x90
480 #define BIND_OPCODE_DO_BIND_ADD_ADDR_ULEB 0xa0
481 #define BIND_OPCODE_DO_BIND_ADD_ADDR_IMM_SCALED 0xb0
482 #define BIND_OPCODE_DO_BIND_ULEB_TIMES_SKIPPING_ULEB 0xc0
483
484 struct : ldid::Progress {
485 virtual void operator()(const std::string &value) const {
486 }
487
488 virtual void operator()(double value) const {
489 }
490 } dummy_;
491
492 struct Progression : ldid::Progress {
493 const ldid::Progress &progress_;
494 std::string name_;
495
496 Progression(const ldid::Progress &progress, const std::string &name) :
497 progress_(progress),
498 name_(name)
499 {
500 }
501
502 virtual void operator()(const std::string &value) const {
503 return progress_(name_ + " (" + value + ")");
504 }
505
506 virtual void operator()(double value) const {
507 return progress_(value);
508 }
509 };
510
511 static std::streamsize read(std::streambuf &stream, void *data, size_t size) {
512 auto writ(stream.sgetn(static_cast<char *>(data), size));
513 _assert(writ >= 0);
514 return writ;
515 }
516
517 static inline void get(std::streambuf &stream, void *data, size_t size) {
518 _assert(read(stream, data, size) == size);
519 }
520
521 static inline void put(std::streambuf &stream, const void *data, size_t size) {
522 _assert(stream.sputn(static_cast<const char *>(data), size) == size);
523 }
524
525 static inline void put(std::streambuf &stream, const void *data, size_t size, const ldid::Progress &progress) {
526 progress(0);
527 for (size_t total(0); total != size;) {
528 auto writ(std::min(size - total, size_t(4096 * 4)));
529 _assert(stream.sputn(static_cast<const char *>(data) + total, writ) == writ);
530 total += writ;
531 progress(double(total) / size);
532 }
533 }
534
535 static size_t most(std::streambuf &stream, void *data, size_t size) {
536 size_t total(size);
537 while (size > 0)
538 if (auto writ = read(stream, data, size))
539 size -= writ;
540 else break;
541 return total - size;
542 }
543
544 static inline void pad(std::streambuf &stream, size_t size) {
545 char padding[size];
546 memset(padding, 0, size);
547 put(stream, padding, size);
548 }
549
550 template <typename Type_>
551 Type_ Align(Type_ value, size_t align) {
552 value += align - 1;
553 value /= align;
554 value *= align;
555 return value;
556 }
557
558 static const uint8_t PageShift_(0x0c);
559 static const uint32_t PageSize_(1 << PageShift_);
560
561 static inline uint16_t Swap_(uint16_t value) {
562 return
563 ((value >> 8) & 0x00ff) |
564 ((value << 8) & 0xff00);
565 }
566
567 static inline uint32_t Swap_(uint32_t value) {
568 value = ((value >> 8) & 0x00ff00ff) |
569 ((value << 8) & 0xff00ff00);
570 value = ((value >> 16) & 0x0000ffff) |
571 ((value << 16) & 0xffff0000);
572 return value;
573 }
574
575 static inline uint64_t Swap_(uint64_t value) {
576 value = (value & 0x00000000ffffffff) << 32 | (value & 0xffffffff00000000) >> 32;
577 value = (value & 0x0000ffff0000ffff) << 16 | (value & 0xffff0000ffff0000) >> 16;
578 value = (value & 0x00ff00ff00ff00ff) << 8 | (value & 0xff00ff00ff00ff00) >> 8;
579 return value;
580 }
581
582 static inline int16_t Swap_(int16_t value) {
583 return Swap_(static_cast<uint16_t>(value));
584 }
585
586 static inline int32_t Swap_(int32_t value) {
587 return Swap_(static_cast<uint32_t>(value));
588 }
589
590 static inline int64_t Swap_(int64_t value) {
591 return Swap_(static_cast<uint64_t>(value));
592 }
593
594 static bool little_(true);
595
596 static inline uint16_t Swap(uint16_t value) {
597 return little_ ? Swap_(value) : value;
598 }
599
600 static inline uint32_t Swap(uint32_t value) {
601 return little_ ? Swap_(value) : value;
602 }
603
604 static inline uint64_t Swap(uint64_t value) {
605 return little_ ? Swap_(value) : value;
606 }
607
608 static inline int16_t Swap(int16_t value) {
609 return Swap(static_cast<uint16_t>(value));
610 }
611
612 static inline int32_t Swap(int32_t value) {
613 return Swap(static_cast<uint32_t>(value));
614 }
615
616 static inline int64_t Swap(int64_t value) {
617 return Swap(static_cast<uint64_t>(value));
618 }
619
620 class Swapped {
621 protected:
622 bool swapped_;
623
624 Swapped() :
625 swapped_(false)
626 {
627 }
628
629 public:
630 Swapped(bool swapped) :
631 swapped_(swapped)
632 {
633 }
634
635 template <typename Type_>
636 Type_ Swap(Type_ value) const {
637 return swapped_ ? Swap_(value) : value;
638 }
639 };
640
641 class Data :
642 public Swapped
643 {
644 private:
645 void *base_;
646 size_t size_;
647
648 public:
649 Data(void *base, size_t size) :
650 base_(base),
651 size_(size)
652 {
653 }
654
655 void *GetBase() const {
656 return base_;
657 }
658
659 size_t GetSize() const {
660 return size_;
661 }
662 };
663
664 class MachHeader :
665 public Data
666 {
667 private:
668 bool bits64_;
669
670 struct mach_header *mach_header_;
671 struct load_command *load_command_;
672
673 public:
674 MachHeader(void *base, size_t size) :
675 Data(base, size)
676 {
677 mach_header_ = (mach_header *) base;
678
679 switch (Swap(mach_header_->magic)) {
680 case MH_CIGAM:
681 swapped_ = !swapped_;
682 case MH_MAGIC:
683 bits64_ = false;
684 break;
685
686 case MH_CIGAM_64:
687 swapped_ = !swapped_;
688 case MH_MAGIC_64:
689 bits64_ = true;
690 break;
691
692 default:
693 _assert(false);
694 }
695
696 void *post = mach_header_ + 1;
697 if (bits64_)
698 post = (uint32_t *) post + 1;
699 load_command_ = (struct load_command *) post;
700
701 _assert(
702 Swap(mach_header_->filetype) == MH_EXECUTE ||
703 Swap(mach_header_->filetype) == MH_DYLIB ||
704 Swap(mach_header_->filetype) == MH_BUNDLE
705 );
706 }
707
708 bool Bits64() const {
709 return bits64_;
710 }
711
712 struct mach_header *operator ->() const {
713 return mach_header_;
714 }
715
716 operator struct mach_header *() const {
717 return mach_header_;
718 }
719
720 uint32_t GetCPUType() const {
721 return Swap(mach_header_->cputype);
722 }
723
724 uint32_t GetCPUSubtype() const {
725 return Swap(mach_header_->cpusubtype) & 0xff;
726 }
727
728 struct load_command *GetLoadCommand() const {
729 return load_command_;
730 }
731
732 std::vector<struct load_command *> GetLoadCommands() const {
733 std::vector<struct load_command *> load_commands;
734
735 struct load_command *load_command = load_command_;
736 for (uint32_t cmd = 0; cmd != Swap(mach_header_->ncmds); ++cmd) {
737 load_commands.push_back(load_command);
738 load_command = (struct load_command *) ((uint8_t *) load_command + Swap(load_command->cmdsize));
739 }
740
741 return load_commands;
742 }
743
744 void ForSection(const ldid::Functor<void (const char *, const char *, void *, size_t)> &code) const {
745 _foreach (load_command, GetLoadCommands())
746 switch (Swap(load_command->cmd)) {
747 case LC_SEGMENT: {
748 auto segment(reinterpret_cast<struct segment_command *>(load_command));
749 code(segment->segname, NULL, GetOffset<void>(segment->fileoff), segment->filesize);
750 auto section(reinterpret_cast<struct section *>(segment + 1));
751 for (uint32_t i(0), e(Swap(segment->nsects)); i != e; ++i, ++section)
752 code(segment->segname, section->sectname, GetOffset<void>(segment->fileoff + section->offset), section->size);
753 } break;
754
755 case LC_SEGMENT_64: {
756 auto segment(reinterpret_cast<struct segment_command_64 *>(load_command));
757 code(segment->segname, NULL, GetOffset<void>(segment->fileoff), segment->filesize);
758 auto section(reinterpret_cast<struct section_64 *>(segment + 1));
759 for (uint32_t i(0), e(Swap(segment->nsects)); i != e; ++i, ++section)
760 code(segment->segname, section->sectname, GetOffset<void>(segment->fileoff + section->offset), section->size);
761 } break;
762 }
763 }
764
765 template <typename Target_>
766 Target_ *GetOffset(uint32_t offset) const {
767 return reinterpret_cast<Target_ *>(offset + (uint8_t *) mach_header_);
768 }
769 };
770
771 class FatMachHeader :
772 public MachHeader
773 {
774 private:
775 fat_arch *fat_arch_;
776
777 public:
778 FatMachHeader(void *base, size_t size, fat_arch *fat_arch) :
779 MachHeader(base, size),
780 fat_arch_(fat_arch)
781 {
782 }
783
784 fat_arch *GetFatArch() const {
785 return fat_arch_;
786 }
787 };
788
789 class FatHeader :
790 public Data
791 {
792 private:
793 fat_header *fat_header_;
794 std::vector<FatMachHeader> mach_headers_;
795
796 public:
797 FatHeader(void *base, size_t size) :
798 Data(base, size)
799 {
800 fat_header_ = reinterpret_cast<struct fat_header *>(base);
801
802 if (Swap(fat_header_->magic) == FAT_CIGAM) {
803 swapped_ = !swapped_;
804 goto fat;
805 } else if (Swap(fat_header_->magic) != FAT_MAGIC) {
806 fat_header_ = NULL;
807 mach_headers_.push_back(FatMachHeader(base, size, NULL));
808 } else fat: {
809 size_t fat_narch = Swap(fat_header_->nfat_arch);
810 fat_arch *fat_arch = reinterpret_cast<struct fat_arch *>(fat_header_ + 1);
811 size_t arch;
812 for (arch = 0; arch != fat_narch; ++arch) {
813 uint32_t arch_offset = Swap(fat_arch->offset);
814 uint32_t arch_size = Swap(fat_arch->size);
815 mach_headers_.push_back(FatMachHeader((uint8_t *) base + arch_offset, arch_size, fat_arch));
816 ++fat_arch;
817 }
818 }
819 }
820
821 std::vector<FatMachHeader> &GetMachHeaders() {
822 return mach_headers_;
823 }
824
825 bool IsFat() const {
826 return fat_header_ != NULL;
827 }
828
829 struct fat_header *operator ->() const {
830 return fat_header_;
831 }
832
833 operator struct fat_header *() const {
834 return fat_header_;
835 }
836 };
837
838 #define CSMAGIC_REQUIREMENT uint32_t(0xfade0c00)
839 #define CSMAGIC_REQUIREMENTS uint32_t(0xfade0c01)
840 #define CSMAGIC_CODEDIRECTORY uint32_t(0xfade0c02)
841 #define CSMAGIC_EMBEDDED_SIGNATURE uint32_t(0xfade0cc0)
842 #define CSMAGIC_EMBEDDED_SIGNATURE_OLD uint32_t(0xfade0b02)
843 #define CSMAGIC_EMBEDDED_ENTITLEMENTS uint32_t(0xfade7171)
844 #define CSMAGIC_DETACHED_SIGNATURE uint32_t(0xfade0cc1)
845 #define CSMAGIC_BLOBWRAPPER uint32_t(0xfade0b01)
846
847 #define CSSLOT_CODEDIRECTORY uint32_t(0x00000)
848 #define CSSLOT_INFOSLOT uint32_t(0x00001)
849 #define CSSLOT_REQUIREMENTS uint32_t(0x00002)
850 #define CSSLOT_RESOURCEDIR uint32_t(0x00003)
851 #define CSSLOT_APPLICATION uint32_t(0x00004)
852 #define CSSLOT_ENTITLEMENTS uint32_t(0x00005)
853 #define CSSLOT_ALTERNATE uint32_t(0x01000)
854
855 #define CSSLOT_SIGNATURESLOT uint32_t(0x10000)
856
857 #define CS_HASHTYPE_SHA160_160 1
858 #define CS_HASHTYPE_SHA256_256 2
859 #define CS_HASHTYPE_SHA256_160 3
860 #define CS_HASHTYPE_SHA386_386 4
861
862 struct BlobIndex {
863 uint32_t type;
864 uint32_t offset;
865 } _packed;
866
867 struct Blob {
868 uint32_t magic;
869 uint32_t length;
870 } _packed;
871
872 struct SuperBlob {
873 struct Blob blob;
874 uint32_t count;
875 struct BlobIndex index[];
876 } _packed;
877
878 struct CodeDirectory {
879 uint32_t version;
880 uint32_t flags;
881 uint32_t hashOffset;
882 uint32_t identOffset;
883 uint32_t nSpecialSlots;
884 uint32_t nCodeSlots;
885 uint32_t codeLimit;
886 uint8_t hashSize;
887 uint8_t hashType;
888 uint8_t spare1;
889 uint8_t pageSize;
890 uint32_t spare2;
891 uint32_t scatterOffset;
892 uint32_t teamIDOffset;
893 //uint32_t spare3;
894 //uint64_t codeLimit64;
895 } _packed;
896
897 enum Kind : uint32_t {
898 exprForm = 1, // prefix expr form
899 };
900
901 enum ExprOp : uint32_t {
902 opFalse, // unconditionally false
903 opTrue, // unconditionally true
904 opIdent, // match canonical code [string]
905 opAppleAnchor, // signed by Apple as Apple's product
906 opAnchorHash, // match anchor [cert hash]
907 opInfoKeyValue, // *legacy* - use opInfoKeyField [key; value]
908 opAnd, // binary prefix expr AND expr [expr; expr]
909 opOr, // binary prefix expr OR expr [expr; expr]
910 opCDHash, // match hash of CodeDirectory directly [cd hash]
911 opNot, // logical inverse [expr]
912 opInfoKeyField, // Info.plist key field [string; match suffix]
913 opCertField, // Certificate field [cert index; field name; match suffix]
914 opTrustedCert, // require trust settings to approve one particular cert [cert index]
915 opTrustedCerts, // require trust settings to approve the cert chain
916 opCertGeneric, // Certificate component by OID [cert index; oid; match suffix]
917 opAppleGenericAnchor, // signed by Apple in any capacity
918 opEntitlementField, // entitlement dictionary field [string; match suffix]
919 opCertPolicy, // Certificate policy by OID [cert index; oid; match suffix]
920 opNamedAnchor, // named anchor type
921 opNamedCode, // named subroutine
922 opPlatform, // platform constraint [integer]
923 exprOpCount // (total opcode count in use)
924 };
925
926 enum MatchOperation {
927 matchExists, // anything but explicit "false" - no value stored
928 matchEqual, // equal (CFEqual)
929 matchContains, // partial match (substring)
930 matchBeginsWith, // partial match (initial substring)
931 matchEndsWith, // partial match (terminal substring)
932 matchLessThan, // less than (string with numeric comparison)
933 matchGreaterThan, // greater than (string with numeric comparison)
934 matchLessEqual, // less or equal (string with numeric comparison)
935 matchGreaterEqual, // greater or equal (string with numeric comparison)
936 };
937
938 #define OID_ISO_MEMBER 42
939 #define OID_US OID_ISO_MEMBER, 134, 72
940 #define APPLE_OID OID_US, 0x86, 0xf7, 0x63
941 #define APPLE_ADS_OID APPLE_OID, 0x64
942 #define APPLE_EXTENSION_OID APPLE_ADS_OID, 6
943
944 #ifndef LDID_NOFLAGT
945 extern "C" uint32_t hash(uint8_t *k, uint32_t length, uint32_t initval);
946 #endif
947
948 struct Algorithm {
949 size_t size_;
950 uint8_t type_;
951
952 Algorithm(size_t size, uint8_t type) :
953 size_(size),
954 type_(type)
955 {
956 }
957
958 virtual const uint8_t *operator [](const ldid::Hash &hash) const = 0;
959
960 virtual void operator ()(uint8_t *hash, const void *data, size_t size) const = 0;
961 virtual void operator ()(ldid::Hash &hash, const void *data, size_t size) const = 0;
962 virtual void operator ()(std::vector<char> &hash, const void *data, size_t size) const = 0;
963
964 virtual const char *name() = 0;
965 };
966
967 struct AlgorithmSHA1 :
968 Algorithm
969 {
970 AlgorithmSHA1() :
971 Algorithm(LDID_SHA1_DIGEST_LENGTH, CS_HASHTYPE_SHA160_160)
972 {
973 }
974
975 virtual const uint8_t *operator [](const ldid::Hash &hash) const {
976 return hash.sha1_;
977 }
978
979 void operator ()(uint8_t *hash, const void *data, size_t size) const {
980 LDID_SHA1(static_cast<const uint8_t *>(data), size, hash);
981 }
982
983 void operator ()(ldid::Hash &hash, const void *data, size_t size) const {
984 return operator()(hash.sha1_, data, size);
985 }
986
987 void operator ()(std::vector<char> &hash, const void *data, size_t size) const {
988 hash.resize(LDID_SHA1_DIGEST_LENGTH);
989 return operator ()(reinterpret_cast<uint8_t *>(hash.data()), data, size);
990 }
991
992 virtual const char *name() {
993 return "sha1";
994 }
995 };
996
997 struct AlgorithmSHA256 :
998 Algorithm
999 {
1000 AlgorithmSHA256() :
1001 Algorithm(LDID_SHA256_DIGEST_LENGTH, CS_HASHTYPE_SHA256_256)
1002 {
1003 }
1004
1005 virtual const uint8_t *operator [](const ldid::Hash &hash) const {
1006 return hash.sha256_;
1007 }
1008
1009 void operator ()(uint8_t *hash, const void *data, size_t size) const {
1010 LDID_SHA256(static_cast<const uint8_t *>(data), size, hash);
1011 }
1012
1013 void operator ()(ldid::Hash &hash, const void *data, size_t size) const {
1014 return operator()(hash.sha256_, data, size);
1015 }
1016
1017 void operator ()(std::vector<char> &hash, const void *data, size_t size) const {
1018 hash.resize(LDID_SHA256_DIGEST_LENGTH);
1019 return operator ()(reinterpret_cast<uint8_t *>(hash.data()), data, size);
1020 }
1021
1022 virtual const char *name() {
1023 return "sha256";
1024 }
1025 };
1026
1027 static const std::vector<Algorithm *> &GetAlgorithms() {
1028 static AlgorithmSHA1 sha1;
1029 static AlgorithmSHA256 sha256;
1030
1031 static Algorithm *array[] = {
1032 &sha1,
1033 &sha256,
1034 };
1035
1036 static std::vector<Algorithm *> algorithms(array, array + sizeof(array) / sizeof(array[0]));
1037 return algorithms;
1038 }
1039
1040 struct CodesignAllocation {
1041 FatMachHeader mach_header_;
1042 uint32_t offset_;
1043 uint32_t size_;
1044 uint32_t limit_;
1045 uint32_t alloc_;
1046 uint32_t align_;
1047 const char *arch_;
1048
1049 CodesignAllocation(FatMachHeader mach_header, size_t offset, size_t size, size_t limit, size_t alloc, size_t align, const char *arch) :
1050 mach_header_(mach_header),
1051 offset_(offset),
1052 size_(size),
1053 limit_(limit),
1054 alloc_(alloc),
1055 align_(align),
1056 arch_(arch)
1057 {
1058 }
1059 };
1060
1061 #ifndef LDID_NOTOOLS
1062 class File {
1063 private:
1064 int file_;
1065
1066 public:
1067 File() :
1068 file_(-1)
1069 {
1070 }
1071
1072 ~File() {
1073 if (file_ != -1)
1074 _syscall(close(file_));
1075 }
1076
1077 void open(const char *path, int flags) {
1078 _assert(file_ == -1);
1079 file_ = _syscall(::open(path, flags));
1080 }
1081
1082 int file() const {
1083 return file_;
1084 }
1085 };
1086
1087 class Map {
1088 private:
1089 File file_;
1090 void *data_;
1091 size_t size_;
1092
1093 void clear() {
1094 if (data_ == NULL)
1095 return;
1096 _syscall(munmap(data_, size_));
1097 data_ = NULL;
1098 size_ = 0;
1099 }
1100
1101 public:
1102 Map() :
1103 data_(NULL),
1104 size_(0)
1105 {
1106 }
1107
1108 Map(const std::string &path, int oflag, int pflag, int mflag) :
1109 Map()
1110 {
1111 open(path, oflag, pflag, mflag);
1112 }
1113
1114 Map(const std::string &path, bool edit) :
1115 Map()
1116 {
1117 open(path, edit);
1118 }
1119
1120 ~Map() {
1121 clear();
1122 }
1123
1124 bool empty() const {
1125 return data_ == NULL;
1126 }
1127
1128 void open(const std::string &path, int oflag, int pflag, int mflag) {
1129 clear();
1130
1131 file_.open(path.c_str(), oflag);
1132 int file(file_.file());
1133
1134 struct stat stat;
1135 _syscall(fstat(file, &stat));
1136 size_ = stat.st_size;
1137
1138 data_ = _syscall(mmap(NULL, size_, pflag, mflag, file, 0));
1139 }
1140
1141 void open(const std::string &path, bool edit) {
1142 if (edit)
1143 open(path, O_RDWR, PROT_READ | PROT_WRITE, MAP_SHARED);
1144 else
1145 open(path, O_RDONLY, PROT_READ, MAP_PRIVATE);
1146 }
1147
1148 void *data() const {
1149 return data_;
1150 }
1151
1152 size_t size() const {
1153 return size_;
1154 }
1155
1156 operator std::string() const {
1157 return std::string(static_cast<char *>(data_), size_);
1158 }
1159 };
1160 #endif
1161
1162 namespace ldid {
1163
1164 std::string Analyze(const void *data, size_t size) {
1165 std::string entitlements;
1166
1167 FatHeader fat_header(const_cast<void *>(data), size);
1168 _foreach (mach_header, fat_header.GetMachHeaders())
1169 _foreach (load_command, mach_header.GetLoadCommands())
1170 if (mach_header.Swap(load_command->cmd) == LC_CODE_SIGNATURE) {
1171 auto signature(reinterpret_cast<struct linkedit_data_command *>(load_command));
1172 auto offset(mach_header.Swap(signature->dataoff));
1173 auto pointer(reinterpret_cast<uint8_t *>(mach_header.GetBase()) + offset);
1174 auto super(reinterpret_cast<struct SuperBlob *>(pointer));
1175
1176 for (size_t index(0); index != Swap(super->count); ++index)
1177 if (Swap(super->index[index].type) == CSSLOT_ENTITLEMENTS) {
1178 auto begin(Swap(super->index[index].offset));
1179 auto blob(reinterpret_cast<struct Blob *>(pointer + begin));
1180 auto writ(Swap(blob->length) - sizeof(*blob));
1181
1182 if (entitlements.empty())
1183 entitlements.assign(reinterpret_cast<char *>(blob + 1), writ);
1184 else
1185 _assert(entitlements.compare(0, entitlements.size(), reinterpret_cast<char *>(blob + 1), writ) == 0);
1186 }
1187 }
1188
1189 return entitlements;
1190 }
1191
1192 static void Allocate(const void *idata, size_t isize, std::streambuf &output, const Functor<size_t (const MachHeader &, size_t)> &allocate, const Functor<size_t (const MachHeader &, std::streambuf &output, size_t, const std::string &, const char *, const Progress &)> &save, const Progress &progress) {
1193 FatHeader source(const_cast<void *>(idata), isize);
1194
1195 size_t offset(0);
1196 if (source.IsFat())
1197 offset += sizeof(fat_header) + sizeof(fat_arch) * source.Swap(source->nfat_arch);
1198
1199 std::vector<CodesignAllocation> allocations;
1200 _foreach (mach_header, source.GetMachHeaders()) {
1201 struct linkedit_data_command *signature(NULL);
1202 struct symtab_command *symtab(NULL);
1203
1204 _foreach (load_command, mach_header.GetLoadCommands()) {
1205 uint32_t cmd(mach_header.Swap(load_command->cmd));
1206 if (false);
1207 else if (cmd == LC_CODE_SIGNATURE)
1208 signature = reinterpret_cast<struct linkedit_data_command *>(load_command);
1209 else if (cmd == LC_SYMTAB)
1210 symtab = reinterpret_cast<struct symtab_command *>(load_command);
1211 }
1212
1213 size_t size;
1214 if (signature == NULL)
1215 size = mach_header.GetSize();
1216 else {
1217 size = mach_header.Swap(signature->dataoff);
1218 _assert(size <= mach_header.GetSize());
1219 }
1220
1221 if (symtab != NULL) {
1222 auto end(mach_header.Swap(symtab->stroff) + mach_header.Swap(symtab->strsize));
1223 _assert(end <= size);
1224 _assert(end >= size - 0x10);
1225 size = end;
1226 }
1227
1228 size_t alloc(allocate(mach_header, size));
1229
1230 auto *fat_arch(mach_header.GetFatArch());
1231 uint32_t align;
1232
1233 if (fat_arch != NULL)
1234 align = source.Swap(fat_arch->align);
1235 else switch (mach_header.GetCPUType()) {
1236 case CPU_TYPE_POWERPC:
1237 case CPU_TYPE_POWERPC64:
1238 case CPU_TYPE_X86:
1239 case CPU_TYPE_X86_64:
1240 align = 0xc;
1241 break;
1242 case CPU_TYPE_ARM:
1243 case CPU_TYPE_ARM64:
1244 align = 0xe;
1245 break;
1246 default:
1247 align = 0x0;
1248 break;
1249 }
1250
1251 const char *arch(NULL);
1252 switch (mach_header.GetCPUType()) {
1253 case CPU_TYPE_POWERPC:
1254 arch = "ppc";
1255 break;
1256 case CPU_TYPE_POWERPC64:
1257 arch = "ppc64";
1258 break;
1259 case CPU_TYPE_X86:
1260 arch = "i386";
1261 break;
1262 case CPU_TYPE_X86_64:
1263 arch = "x86_64";
1264 break;
1265 case CPU_TYPE_ARM:
1266 arch = "arm";
1267 break;
1268 case CPU_TYPE_ARM64:
1269 arch = "arm64";
1270 break;
1271 }
1272
1273 offset = Align(offset, 1 << align);
1274
1275 uint32_t limit(size);
1276 if (alloc != 0)
1277 limit = Align(limit, 0x10);
1278
1279 allocations.push_back(CodesignAllocation(mach_header, offset, size, limit, alloc, align, arch));
1280 offset += size + alloc;
1281 offset = Align(offset, 0x10);
1282 }
1283
1284 size_t position(0);
1285
1286 if (source.IsFat()) {
1287 fat_header fat_header;
1288 fat_header.magic = Swap(FAT_MAGIC);
1289 fat_header.nfat_arch = Swap(uint32_t(allocations.size()));
1290 put(output, &fat_header, sizeof(fat_header));
1291 position += sizeof(fat_header);
1292
1293 _foreach (allocation, allocations) {
1294 auto &mach_header(allocation.mach_header_);
1295
1296 fat_arch fat_arch;
1297 fat_arch.cputype = Swap(mach_header->cputype);
1298 fat_arch.cpusubtype = Swap(mach_header->cpusubtype);
1299 fat_arch.offset = Swap(allocation.offset_);
1300 fat_arch.size = Swap(allocation.limit_ + allocation.alloc_);
1301 fat_arch.align = Swap(allocation.align_);
1302 put(output, &fat_arch, sizeof(fat_arch));
1303 position += sizeof(fat_arch);
1304 }
1305 }
1306
1307 _foreach (allocation, allocations) {
1308 progress(allocation.arch_);
1309 auto &mach_header(allocation.mach_header_);
1310
1311 pad(output, allocation.offset_ - position);
1312 position = allocation.offset_;
1313
1314 std::vector<std::string> commands;
1315
1316 _foreach (load_command, mach_header.GetLoadCommands()) {
1317 std::string copy(reinterpret_cast<const char *>(load_command), load_command->cmdsize);
1318
1319 switch (mach_header.Swap(load_command->cmd)) {
1320 case LC_CODE_SIGNATURE:
1321 continue;
1322 break;
1323
1324 case LC_SEGMENT: {
1325 auto segment_command(reinterpret_cast<struct segment_command *>(&copy[0]));
1326 if (strncmp(segment_command->segname, "__LINKEDIT", 16) != 0)
1327 break;
1328 size_t size(mach_header.Swap(allocation.limit_ + allocation.alloc_ - mach_header.Swap(segment_command->fileoff)));
1329 segment_command->filesize = size;
1330 segment_command->vmsize = Align(size, 1 << allocation.align_);
1331 } break;
1332
1333 case LC_SEGMENT_64: {
1334 auto segment_command(reinterpret_cast<struct segment_command_64 *>(&copy[0]));
1335 if (strncmp(segment_command->segname, "__LINKEDIT", 16) != 0)
1336 break;
1337 size_t size(mach_header.Swap(allocation.limit_ + allocation.alloc_ - mach_header.Swap(segment_command->fileoff)));
1338 segment_command->filesize = size;
1339 segment_command->vmsize = Align(size, 1 << allocation.align_);
1340 } break;
1341 }
1342
1343 commands.push_back(copy);
1344 }
1345
1346 if (allocation.alloc_ != 0) {
1347 linkedit_data_command signature;
1348 signature.cmd = mach_header.Swap(LC_CODE_SIGNATURE);
1349 signature.cmdsize = mach_header.Swap(uint32_t(sizeof(signature)));
1350 signature.dataoff = mach_header.Swap(allocation.limit_);
1351 signature.datasize = mach_header.Swap(allocation.alloc_);
1352 commands.push_back(std::string(reinterpret_cast<const char *>(&signature), sizeof(signature)));
1353 }
1354
1355 size_t begin(position);
1356
1357 uint32_t after(0);
1358 _foreach(command, commands)
1359 after += command.size();
1360
1361 std::stringbuf altern;
1362
1363 struct mach_header header(*mach_header);
1364 header.ncmds = mach_header.Swap(uint32_t(commands.size()));
1365 header.sizeofcmds = mach_header.Swap(after);
1366 put(output, &header, sizeof(header));
1367 put(altern, &header, sizeof(header));
1368 position += sizeof(header);
1369
1370 if (mach_header.Bits64()) {
1371 auto pad(mach_header.Swap(uint32_t(0)));
1372 put(output, &pad, sizeof(pad));
1373 put(altern, &pad, sizeof(pad));
1374 position += sizeof(pad);
1375 }
1376
1377 _foreach(command, commands) {
1378 put(output, command.data(), command.size());
1379 put(altern, command.data(), command.size());
1380 position += command.size();
1381 }
1382
1383 uint32_t before(mach_header.Swap(mach_header->sizeofcmds));
1384 if (before > after) {
1385 pad(output, before - after);
1386 pad(altern, before - after);
1387 position += before - after;
1388 }
1389
1390 auto top(reinterpret_cast<char *>(mach_header.GetBase()));
1391
1392 std::string overlap(altern.str());
1393 overlap.append(top + overlap.size(), Align(overlap.size(), 0x1000) - overlap.size());
1394
1395 put(output, top + (position - begin), allocation.size_ - (position - begin), progress);
1396 position = begin + allocation.size_;
1397
1398 pad(output, allocation.limit_ - allocation.size_);
1399 position += allocation.limit_ - allocation.size_;
1400
1401 size_t saved(save(mach_header, output, allocation.limit_, overlap, top, progress));
1402 if (allocation.alloc_ > saved)
1403 pad(output, allocation.alloc_ - saved);
1404 else
1405 _assert(allocation.alloc_ == saved);
1406 position += allocation.alloc_;
1407 }
1408 }
1409
1410 }
1411
1412 typedef std::map<uint32_t, std::string> Blobs;
1413
1414 static void insert(Blobs &blobs, uint32_t slot, const std::stringbuf &buffer) {
1415 auto value(buffer.str());
1416 std::swap(blobs[slot], value);
1417 }
1418
1419 static const std::string &insert(Blobs &blobs, uint32_t slot, uint32_t magic, const std::stringbuf &buffer) {
1420 auto value(buffer.str());
1421 Blob blob;
1422 blob.magic = Swap(magic);
1423 blob.length = Swap(uint32_t(sizeof(blob) + value.size()));
1424 value.insert(0, reinterpret_cast<char *>(&blob), sizeof(blob));
1425 auto &save(blobs[slot]);
1426 std::swap(save, value);
1427 return save;
1428 }
1429
1430 static size_t put(std::streambuf &output, uint32_t magic, const Blobs &blobs) {
1431 size_t total(0);
1432 _foreach (blob, blobs)
1433 total += blob.second.size();
1434
1435 struct SuperBlob super;
1436 super.blob.magic = Swap(magic);
1437 super.blob.length = Swap(uint32_t(sizeof(SuperBlob) + blobs.size() * sizeof(BlobIndex) + total));
1438 super.count = Swap(uint32_t(blobs.size()));
1439 put(output, &super, sizeof(super));
1440
1441 size_t offset(sizeof(SuperBlob) + sizeof(BlobIndex) * blobs.size());
1442
1443 _foreach (blob, blobs) {
1444 BlobIndex index;
1445 index.type = Swap(blob.first);
1446 index.offset = Swap(uint32_t(offset));
1447 put(output, &index, sizeof(index));
1448 offset += blob.second.size();
1449 }
1450
1451 _foreach (blob, blobs)
1452 put(output, blob.second.data(), blob.second.size());
1453
1454 return offset;
1455 }
1456
1457 #ifndef LDID_NOSMIME
1458 class Buffer {
1459 private:
1460 BIO *bio_;
1461
1462 public:
1463 Buffer(BIO *bio) :
1464 bio_(bio)
1465 {
1466 _assert(bio_ != NULL);
1467 }
1468
1469 Buffer() :
1470 bio_(BIO_new(BIO_s_mem()))
1471 {
1472 }
1473
1474 Buffer(const char *data, size_t size) :
1475 Buffer(BIO_new_mem_buf(const_cast<char *>(data), size))
1476 {
1477 }
1478
1479 Buffer(const std::string &data) :
1480 Buffer(data.data(), data.size())
1481 {
1482 }
1483
1484 Buffer(PKCS7 *pkcs) :
1485 Buffer()
1486 {
1487 _assert(i2d_PKCS7_bio(bio_, pkcs) != 0);
1488 }
1489
1490 ~Buffer() {
1491 BIO_free_all(bio_);
1492 }
1493
1494 operator BIO *() const {
1495 return bio_;
1496 }
1497
1498 explicit operator std::string() const {
1499 char *data;
1500 auto size(BIO_get_mem_data(bio_, &data));
1501 return std::string(data, size);
1502 }
1503 };
1504
1505 class Stuff {
1506 private:
1507 PKCS12 *value_;
1508 EVP_PKEY *key_;
1509 X509 *cert_;
1510 STACK_OF(X509) *ca_;
1511
1512 public:
1513 Stuff(BIO *bio) :
1514 value_(d2i_PKCS12_bio(bio, NULL)),
1515 ca_(NULL)
1516 {
1517 _assert(value_ != NULL);
1518 _assert(PKCS12_parse(value_, "", &key_, &cert_, &ca_) != 0);
1519
1520 _assert(key_ != NULL);
1521 _assert(cert_ != NULL);
1522
1523 if (ca_ == NULL)
1524 ca_ = sk_X509_new_null();
1525 _assert(ca_ != NULL);
1526 }
1527
1528 Stuff(const std::string &data) :
1529 Stuff(Buffer(data))
1530 {
1531 }
1532
1533 ~Stuff() {
1534 sk_X509_pop_free(ca_, X509_free);
1535 X509_free(cert_);
1536 EVP_PKEY_free(key_);
1537 PKCS12_free(value_);
1538 }
1539
1540 operator PKCS12 *() const {
1541 return value_;
1542 }
1543
1544 operator EVP_PKEY *() const {
1545 return key_;
1546 }
1547
1548 operator X509 *() const {
1549 return cert_;
1550 }
1551
1552 operator STACK_OF(X509) *() const {
1553 return ca_;
1554 }
1555 };
1556
1557 class Signature {
1558 private:
1559 PKCS7 *value_;
1560
1561 public:
1562 Signature(const Stuff &stuff, const Buffer &data, const std::string &xml) {
1563 value_ = PKCS7_new();
1564 _assert(value_ != NULL);
1565
1566 _assert(PKCS7_set_type(value_, NID_pkcs7_signed));
1567 _assert(PKCS7_content_new(value_, NID_pkcs7_data));
1568
1569 STACK_OF(X509) *certs(stuff);
1570 for (unsigned i(0), e(sk_X509_num(certs)); i != e; i++)
1571 _assert(PKCS7_add_certificate(value_, sk_X509_value(certs, e - i - 1)));
1572
1573 auto info(PKCS7_sign_add_signer(value_, stuff, stuff, NULL, PKCS7_NOSMIMECAP));
1574 _assert(info != NULL);
1575
1576 PKCS7_set_detached(value_, 1);
1577
1578 ASN1_OCTET_STRING *string(ASN1_OCTET_STRING_new());
1579 _assert(string != NULL);
1580 try {
1581 _assert(ASN1_STRING_set(string, xml.data(), xml.size()));
1582
1583 static auto nid(OBJ_create("1.2.840.113635.100.9.1", "", ""));
1584 _assert(PKCS7_add_signed_attribute(info, nid, V_ASN1_OCTET_STRING, string));
1585 } catch (...) {
1586 ASN1_OCTET_STRING_free(string);
1587 throw;
1588 }
1589
1590 _assert(PKCS7_final(value_, data, PKCS7_BINARY));
1591 }
1592
1593 ~Signature() {
1594 PKCS7_free(value_);
1595 }
1596
1597 operator PKCS7 *() const {
1598 return value_;
1599 }
1600 };
1601 #endif
1602
1603 class NullBuffer :
1604 public std::streambuf
1605 {
1606 public:
1607 virtual std::streamsize xsputn(const char_type *data, std::streamsize size) {
1608 return size;
1609 }
1610
1611 virtual int_type overflow(int_type next) {
1612 return next;
1613 }
1614 };
1615
1616 class Digest {
1617 public:
1618 uint8_t sha1_[LDID_SHA1_DIGEST_LENGTH];
1619 };
1620
1621 class HashBuffer :
1622 public std::streambuf
1623 {
1624 private:
1625 ldid::Hash &hash_;
1626
1627 LDID_SHA1_CTX sha1_;
1628 LDID_SHA256_CTX sha256_;
1629
1630 public:
1631 HashBuffer(ldid::Hash &hash) :
1632 hash_(hash)
1633 {
1634 LDID_SHA1_Init(&sha1_);
1635 LDID_SHA256_Init(&sha256_);
1636 }
1637
1638 ~HashBuffer() {
1639 LDID_SHA1_Final(reinterpret_cast<uint8_t *>(hash_.sha1_), &sha1_);
1640 LDID_SHA256_Final(reinterpret_cast<uint8_t *>(hash_.sha256_), &sha256_);
1641 }
1642
1643 virtual std::streamsize xsputn(const char_type *data, std::streamsize size) {
1644 LDID_SHA1_Update(&sha1_, data, size);
1645 LDID_SHA256_Update(&sha256_, data, size);
1646 return size;
1647 }
1648
1649 virtual int_type overflow(int_type next) {
1650 if (next == traits_type::eof())
1651 return sync();
1652 char value(next);
1653 xsputn(&value, 1);
1654 return next;
1655 }
1656 };
1657
1658 class HashProxy :
1659 public HashBuffer
1660 {
1661 private:
1662 std::streambuf &buffer_;
1663
1664 public:
1665 HashProxy(ldid::Hash &hash, std::streambuf &buffer) :
1666 HashBuffer(hash),
1667 buffer_(buffer)
1668 {
1669 }
1670
1671 virtual std::streamsize xsputn(const char_type *data, std::streamsize size) {
1672 _assert(HashBuffer::xsputn(data, size) == size);
1673 return buffer_.sputn(data, size);
1674 }
1675 };
1676
1677 #ifndef LDID_NOTOOLS
1678 static bool Starts(const std::string &lhs, const std::string &rhs) {
1679 return lhs.size() >= rhs.size() && lhs.compare(0, rhs.size(), rhs) == 0;
1680 }
1681
1682 class Split {
1683 public:
1684 std::string dir;
1685 std::string base;
1686
1687 Split(const std::string &path) {
1688 size_t slash(path.rfind('/'));
1689 if (slash == std::string::npos)
1690 base = path;
1691 else {
1692 dir = path.substr(0, slash + 1);
1693 base = path.substr(slash + 1);
1694 }
1695 }
1696 };
1697
1698 static void mkdir_p(const std::string &path) {
1699 if (path.empty())
1700 return;
1701 #ifdef __WIN32__
1702 if (_syscall(mkdir(path.c_str()), EEXIST) == -EEXIST)
1703 return;
1704 #else
1705 if (_syscall(mkdir(path.c_str(), 0755), EEXIST) == -EEXIST)
1706 return;
1707 #endif
1708 auto slash(path.rfind('/', path.size() - 1));
1709 if (slash == std::string::npos)
1710 return;
1711 mkdir_p(path.substr(0, slash));
1712 }
1713
1714 static std::string Temporary(std::filebuf &file, const Split &split) {
1715 std::string temp(split.dir + ".ldid." + split.base);
1716 mkdir_p(split.dir);
1717 _assert_(file.open(temp.c_str(), std::ios::out | std::ios::trunc | std::ios::binary) == &file, "open(): %s", temp.c_str());
1718 return temp;
1719 }
1720
1721 static void Commit(const std::string &path, const std::string &temp) {
1722 struct stat info;
1723 if (_syscall(stat(path.c_str(), &info), ENOENT) == 0) {
1724 #ifndef __WIN32__
1725 _syscall(chown(temp.c_str(), info.st_uid, info.st_gid));
1726 #endif
1727 _syscall(chmod(temp.c_str(), info.st_mode));
1728 }
1729
1730 _syscall(rename(temp.c_str(), path.c_str()));
1731 }
1732 #endif
1733
1734 namespace ldid {
1735
1736 #ifndef LDID_NOSMIME
1737 static void get(std::string &value, X509_NAME *name, int nid) {
1738 auto index(X509_NAME_get_index_by_NID(name, nid, -1));
1739 _assert(index >= 0);
1740 auto next(X509_NAME_get_index_by_NID(name, nid, index));
1741 _assert(next == -1);
1742 auto entry(X509_NAME_get_entry(name, index));
1743 _assert(entry != NULL);
1744 auto asn(X509_NAME_ENTRY_get_data(entry));
1745 _assert(asn != NULL);
1746 value.assign(reinterpret_cast<char *>(ASN1_STRING_data(asn)), ASN1_STRING_length(asn));
1747 }
1748 #endif
1749
1750 static void req(std::streambuf &buffer, uint32_t value) {
1751 value = Swap(value);
1752 put(buffer, &value, sizeof(value));
1753 }
1754
1755 static void req(std::streambuf &buffer, const std::string &value) {
1756 req(buffer, value.size());
1757 put(buffer, value.data(), value.size());
1758 static uint8_t zeros[] = {0,0,0,0};
1759 put(buffer, zeros, 3 - (value.size() + 3) % 4);
1760 }
1761
1762 template <size_t Size_>
1763 static void req(std::streambuf &buffer, uint8_t (&&data)[Size_]) {
1764 req(buffer, Size_);
1765 put(buffer, data, Size_);
1766 static uint8_t zeros[] = {0,0,0,0};
1767 put(buffer, zeros, 3 - (Size_ + 3) % 4);
1768 }
1769
1770 Hash Sign(const void *idata, size_t isize, std::streambuf &output, const std::string &identifier, const std::string &entitlements, const std::string &requirements, const std::string &key, const Slots &slots, const Progress &progress) {
1771 Hash hash;
1772
1773
1774 std::string team;
1775 std::string common;
1776
1777 #ifndef LDID_NOSMIME
1778 if (!key.empty()) {
1779 Stuff stuff(key);
1780 auto name(X509_get_subject_name(stuff));
1781 _assert(name != NULL);
1782 get(team, name, NID_organizationalUnitName);
1783 get(common, name, NID_commonName);
1784 }
1785 #endif
1786
1787
1788 std::stringbuf backing;
1789
1790 if (!requirements.empty()) {
1791 put(backing, requirements.data(), requirements.size());
1792 } else {
1793 Blobs blobs;
1794
1795 std::stringbuf requirement;
1796 req(requirement, exprForm);
1797 req(requirement, opAnd);
1798 req(requirement, opIdent);
1799 req(requirement, identifier);
1800 req(requirement, opAnd);
1801 req(requirement, opAppleGenericAnchor);
1802 req(requirement, opAnd);
1803 req(requirement, opCertField);
1804 req(requirement, 0);
1805 req(requirement, "subject.CN");
1806 req(requirement, matchEqual);
1807 req(requirement, common);
1808 req(requirement, opCertGeneric);
1809 req(requirement, 1);
1810 req(requirement, (uint8_t []) {APPLE_EXTENSION_OID, 2, 1});
1811 req(requirement, matchExists);
1812 insert(blobs, 3, CSMAGIC_REQUIREMENT, requirement);
1813
1814 put(backing, CSMAGIC_REQUIREMENTS, blobs);
1815 }
1816
1817
1818 // XXX: this is just a "sufficiently large number"
1819 size_t certificate(0x3000);
1820
1821 Allocate(idata, isize, output, fun([&](const MachHeader &mach_header, size_t size) -> size_t {
1822 size_t alloc(sizeof(struct SuperBlob));
1823
1824 uint32_t normal((size + PageSize_ - 1) / PageSize_);
1825
1826 uint32_t special(0);
1827
1828 _foreach (slot, slots)
1829 special = std::max(special, slot.first);
1830
1831 mach_header.ForSection(fun([&](const char *segment, const char *section, void *data, size_t size) {
1832 if (strcmp(segment, "__TEXT") == 0 && section != NULL && strcmp(section, "__info_plist") == 0)
1833 special = std::max(special, CSSLOT_INFOSLOT);
1834 }));
1835
1836 special = std::max(special, CSSLOT_REQUIREMENTS);
1837 alloc += sizeof(struct BlobIndex);
1838 alloc += backing.str().size();
1839
1840 if (!entitlements.empty()) {
1841 special = std::max(special, CSSLOT_ENTITLEMENTS);
1842 alloc += sizeof(struct BlobIndex);
1843 alloc += sizeof(struct Blob);
1844 alloc += entitlements.size();
1845 }
1846
1847 size_t directory(0);
1848
1849 directory += sizeof(struct BlobIndex);
1850 directory += sizeof(struct Blob);
1851 directory += sizeof(struct CodeDirectory);
1852 directory += identifier.size() + 1;
1853
1854 if (!team.empty())
1855 directory += team.size() + 1;
1856
1857 for (Algorithm *algorithm : GetAlgorithms())
1858 alloc = Align(alloc + directory + (special + normal) * algorithm->size_, 16);
1859
1860 #ifndef LDID_NOSMIME
1861 if (!key.empty()) {
1862 alloc += sizeof(struct BlobIndex);
1863 alloc += sizeof(struct Blob);
1864 alloc += certificate;
1865 }
1866 #endif
1867
1868 return alloc;
1869 }), fun([&](const MachHeader &mach_header, std::streambuf &output, size_t limit, const std::string &overlap, const char *top, const Progress &progress) -> size_t {
1870 Blobs blobs;
1871
1872 if (true) {
1873 insert(blobs, CSSLOT_REQUIREMENTS, backing);
1874 }
1875
1876 if (!entitlements.empty()) {
1877 std::stringbuf data;
1878 put(data, entitlements.data(), entitlements.size());
1879 insert(blobs, CSSLOT_ENTITLEMENTS, CSMAGIC_EMBEDDED_ENTITLEMENTS, data);
1880 }
1881
1882 Slots posts(slots);
1883
1884 mach_header.ForSection(fun([&](const char *segment, const char *section, void *data, size_t size) {
1885 if (strcmp(segment, "__TEXT") == 0 && section != NULL && strcmp(section, "__info_plist") == 0) {
1886 auto &slot(posts[CSSLOT_INFOSLOT]);
1887 for (Algorithm *algorithm : GetAlgorithms())
1888 (*algorithm)(slot, data, size);
1889 }
1890 }));
1891
1892 unsigned total(0);
1893 for (Algorithm *pointer : GetAlgorithms()) {
1894 Algorithm &algorithm(*pointer);
1895
1896 std::stringbuf data;
1897
1898 uint32_t special(0);
1899 _foreach (blob, blobs)
1900 special = std::max(special, blob.first);
1901 _foreach (slot, posts)
1902 special = std::max(special, slot.first);
1903 uint32_t normal((limit + PageSize_ - 1) / PageSize_);
1904
1905 CodeDirectory directory;
1906 directory.version = Swap(uint32_t(0x00020200));
1907 directory.flags = Swap(uint32_t(0));
1908 directory.nSpecialSlots = Swap(special);
1909 directory.codeLimit = Swap(uint32_t(limit));
1910 directory.nCodeSlots = Swap(normal);
1911 directory.hashSize = algorithm.size_;
1912 directory.hashType = algorithm.type_;
1913 directory.spare1 = 0x00;
1914 directory.pageSize = PageShift_;
1915 directory.spare2 = Swap(uint32_t(0));
1916 directory.scatterOffset = Swap(uint32_t(0));
1917 //directory.spare3 = Swap(uint32_t(0));
1918 //directory.codeLimit64 = Swap(uint64_t(0));
1919
1920 uint32_t offset(sizeof(Blob) + sizeof(CodeDirectory));
1921
1922 directory.identOffset = Swap(uint32_t(offset));
1923 offset += identifier.size() + 1;
1924
1925 if (team.empty())
1926 directory.teamIDOffset = Swap(uint32_t(0));
1927 else {
1928 directory.teamIDOffset = Swap(uint32_t(offset));
1929 offset += team.size() + 1;
1930 }
1931
1932 offset += special * algorithm.size_;
1933 directory.hashOffset = Swap(uint32_t(offset));
1934 offset += normal * algorithm.size_;
1935
1936 put(data, &directory, sizeof(directory));
1937
1938 put(data, identifier.c_str(), identifier.size() + 1);
1939 if (!team.empty())
1940 put(data, team.c_str(), team.size() + 1);
1941
1942 std::vector<uint8_t> storage((special + normal) * algorithm.size_);
1943 auto *hashes(&storage[special * algorithm.size_]);
1944
1945 memset(storage.data(), 0, special * algorithm.size_);
1946
1947 _foreach (blob, blobs) {
1948 auto local(reinterpret_cast<const Blob *>(&blob.second[0]));
1949 algorithm(hashes - blob.first * algorithm.size_, local, Swap(local->length));
1950 }
1951
1952 _foreach (slot, posts)
1953 memcpy(hashes - slot.first * algorithm.size_, algorithm[slot.second], algorithm.size_);
1954
1955 progress(0);
1956 if (normal != 1)
1957 for (size_t i = 0; i != normal - 1; ++i) {
1958 algorithm(hashes + i * algorithm.size_, (PageSize_ * i < overlap.size() ? overlap.data() : top) + PageSize_ * i, PageSize_);
1959 progress(double(i) / normal);
1960 }
1961 if (normal != 0)
1962 algorithm(hashes + (normal - 1) * algorithm.size_, top + PageSize_ * (normal - 1), ((limit - 1) % PageSize_) + 1);
1963 progress(1);
1964
1965 put(data, storage.data(), storage.size());
1966
1967 const auto &save(insert(blobs, total == 0 ? CSSLOT_CODEDIRECTORY : CSSLOT_ALTERNATE + total - 1, CSMAGIC_CODEDIRECTORY, data));
1968 algorithm(hash, save.data(), save.size());
1969
1970 ++total;
1971 }
1972
1973 #ifndef LDID_NOSMIME
1974 if (!key.empty()) {
1975 #ifdef LDID_NOPLIST
1976 auto plist(CFDictionaryCreateMutable(kCFAllocatorDefault, 0, &kCFTypeDictionaryKeyCallBacks, &kCFTypeDictionaryValueCallBacks));
1977 _scope({ CFRelease(plist); });
1978
1979 auto cdhashes(CFArrayCreateMutable(kCFAllocatorDefault, 0, &kCFTypeArrayCallBacks));
1980 _scope({ CFRelease(cdhashes); });
1981
1982 CFDictionarySetValue(plist, CFSTR("cdhashes"), cdhashes);
1983 #else
1984 auto plist(plist_new_dict());
1985 _scope({ plist_free(plist); });
1986
1987 auto cdhashes(plist_new_array());
1988 plist_dict_set_item(plist, "cdhashes", cdhashes);
1989 #endif
1990
1991 unsigned total(0);
1992 for (Algorithm *pointer : GetAlgorithms()) {
1993 Algorithm &algorithm(*pointer);
1994 (void) algorithm;
1995
1996 const auto &blob(blobs[total == 0 ? CSSLOT_CODEDIRECTORY : CSSLOT_ALTERNATE + total - 1]);
1997 ++total;
1998
1999 std::vector<char> hash;
2000 algorithm(hash, blob.data(), blob.size());
2001 hash.resize(20);
2002
2003 #ifdef LDID_NOPLIST
2004 auto value(CFDataCreate(kCFAllocatorDefault, reinterpret_cast<const UInt8 *>(hash.data()), hash.size()));
2005 _scope({ CFRelease(value); });
2006 CFArrayAppendValue(cdhashes, value);
2007 #else
2008 plist_array_append_item(cdhashes, plist_new_data(hash.data(), hash.size()));
2009 #endif
2010 }
2011
2012 #ifdef LDID_NOPLIST
2013 auto created(CFPropertyListCreateXMLData(kCFAllocatorDefault, plist));
2014 _scope({ CFRelease(created); });
2015 auto xml(reinterpret_cast<const char *>(CFDataGetBytePtr(created)));
2016 auto size(CFDataGetLength(created));
2017 #else
2018 char *xml(NULL);
2019 uint32_t size;
2020 plist_to_xml(plist, &xml, &size);
2021 _scope({ free(xml); });
2022 #endif
2023
2024 std::stringbuf data;
2025 const std::string &sign(blobs[CSSLOT_CODEDIRECTORY]);
2026
2027 Stuff stuff(key);
2028 Buffer bio(sign);
2029
2030 Signature signature(stuff, sign, std::string(xml, size));
2031 Buffer result(signature);
2032 std::string value(result);
2033 put(data, value.data(), value.size());
2034
2035 const auto &save(insert(blobs, CSSLOT_SIGNATURESLOT, CSMAGIC_BLOBWRAPPER, data));
2036 _assert(save.size() <= certificate);
2037 }
2038 #endif
2039
2040 return put(output, CSMAGIC_EMBEDDED_SIGNATURE, blobs);
2041 }), progress);
2042
2043 return hash;
2044 }
2045
2046 #ifndef LDID_NOTOOLS
2047 static void Unsign(void *idata, size_t isize, std::streambuf &output, const Progress &progress) {
2048 Allocate(idata, isize, output, fun([](const MachHeader &mach_header, size_t size) -> size_t {
2049 return 0;
2050 }), fun([](const MachHeader &mach_header, std::streambuf &output, size_t limit, const std::string &overlap, const char *top, const Progress &progress) -> size_t {
2051 return 0;
2052 }), progress);
2053 }
2054
2055 std::string DiskFolder::Path(const std::string &path) const {
2056 return path_ + "/" + path;
2057 }
2058
2059 DiskFolder::DiskFolder(const std::string &path) :
2060 path_(path)
2061 {
2062 }
2063
2064 DiskFolder::~DiskFolder() {
2065 if (!std::uncaught_exception())
2066 for (const auto &commit : commit_)
2067 Commit(commit.first, commit.second);
2068 }
2069
2070 #ifndef __WIN32__
2071 std::string readlink(const std::string &path) {
2072 for (size_t size(1024); ; size *= 2) {
2073 std::string data;
2074 data.resize(size);
2075
2076 int writ(_syscall(::readlink(path.c_str(), &data[0], data.size())));
2077 if (size_t(writ) >= size)
2078 continue;
2079
2080 data.resize(writ);
2081 return data;
2082 }
2083 }
2084 #endif
2085
2086 void DiskFolder::Find(const std::string &root, const std::string &base, const Functor<void (const std::string &)> &code, const Functor<void (const std::string &, const Functor<std::string ()> &)> &link) const {
2087 std::string path(Path(root) + base);
2088
2089 DIR *dir(opendir(path.c_str()));
2090 _assert(dir != NULL);
2091 _scope({ _syscall(closedir(dir)); });
2092
2093 while (auto child = readdir(dir)) {
2094 std::string name(child->d_name);
2095 if (name == "." || name == "..")
2096 continue;
2097 if (Starts(name, ".ldid."))
2098 continue;
2099
2100 bool directory;
2101
2102 #ifdef __WIN32__
2103 struct stat info;
2104 _syscall(stat((path + name).c_str(), &info));
2105 if (false);
2106 else if (S_ISDIR(info.st_mode))
2107 directory = true;
2108 else if (S_ISREG(info.st_mode))
2109 directory = false;
2110 else
2111 _assert_(false, "st_mode=%x", info.st_mode);
2112 #else
2113 switch (child->d_type) {
2114 case DT_DIR:
2115 directory = true;
2116 break;
2117 case DT_REG:
2118 directory = false;
2119 break;
2120 case DT_LNK:
2121 link(base + name, fun([&]() { return readlink(path + name); }));
2122 continue;
2123 default:
2124 _assert_(false, "d_type=%u", child->d_type);
2125 }
2126 #endif
2127
2128 if (directory)
2129 Find(root, base + name + "/", code, link);
2130 else
2131 code(base + name);
2132 }
2133 }
2134
2135 void DiskFolder::Save(const std::string &path, bool edit, const void *flag, const Functor<void (std::streambuf &)> &code) {
2136 if (!edit) {
2137 // XXX: use nullbuf
2138 std::stringbuf save;
2139 code(save);
2140 } else {
2141 std::filebuf save;
2142 auto from(Path(path));
2143 commit_[from] = Temporary(save, from);
2144 code(save);
2145 }
2146 }
2147
2148 bool DiskFolder::Look(const std::string &path) const {
2149 return _syscall(access(Path(path).c_str(), R_OK), ENOENT) == 0;
2150 }
2151
2152 void DiskFolder::Open(const std::string &path, const Functor<void (std::streambuf &, size_t, const void *)> &code) const {
2153 std::filebuf data;
2154 auto result(data.open(Path(path).c_str(), std::ios::binary | std::ios::in));
2155 _assert_(result == &data, "DiskFolder::Open(%s)", path.c_str());
2156
2157 auto length(data.pubseekoff(0, std::ios::end, std::ios::in));
2158 data.pubseekpos(0, std::ios::in);
2159 code(data, length, NULL);
2160 }
2161
2162 void DiskFolder::Find(const std::string &path, const Functor<void (const std::string &)> &code, const Functor<void (const std::string &, const Functor<std::string ()> &)> &link) const {
2163 Find(path, "", code, link);
2164 }
2165 #endif
2166
2167 SubFolder::SubFolder(Folder &parent, const std::string &path) :
2168 parent_(parent),
2169 path_(path)
2170 {
2171 }
2172
2173 void SubFolder::Save(const std::string &path, bool edit, const void *flag, const Functor<void (std::streambuf &)> &code) {
2174 return parent_.Save(path_ + path, edit, flag, code);
2175 }
2176
2177 bool SubFolder::Look(const std::string &path) const {
2178 return parent_.Look(path_ + path);
2179 }
2180
2181 void SubFolder::Open(const std::string &path, const Functor<void (std::streambuf &, size_t, const void *)> &code) const {
2182 return parent_.Open(path_ + path, code);
2183 }
2184
2185 void SubFolder::Find(const std::string &path, const Functor<void (const std::string &)> &code, const Functor<void (const std::string &, const Functor<std::string ()> &)> &link) const {
2186 return parent_.Find(path_ + path, code, link);
2187 }
2188
2189 std::string UnionFolder::Map(const std::string &path) const {
2190 auto remap(remaps_.find(path));
2191 if (remap == remaps_.end())
2192 return path;
2193 return remap->second;
2194 }
2195
2196 void UnionFolder::Map(const std::string &path, const Functor<void (const std::string &)> &code, const std::string &file, const Functor<void (const Functor<void (std::streambuf &, size_t, const void *)> &)> &save) const {
2197 if (file.size() >= path.size() && file.substr(0, path.size()) == path)
2198 code(file.substr(path.size()));
2199 }
2200
2201 UnionFolder::UnionFolder(Folder &parent) :
2202 parent_(parent)
2203 {
2204 }
2205
2206 void UnionFolder::Save(const std::string &path, bool edit, const void *flag, const Functor<void (std::streambuf &)> &code) {
2207 return parent_.Save(Map(path), edit, flag, code);
2208 }
2209
2210 bool UnionFolder::Look(const std::string &path) const {
2211 auto file(resets_.find(path));
2212 if (file != resets_.end())
2213 return true;
2214 return parent_.Look(Map(path));
2215 }
2216
2217 void UnionFolder::Open(const std::string &path, const Functor<void (std::streambuf &, size_t, const void *)> &code) const {
2218 auto file(resets_.find(path));
2219 if (file == resets_.end())
2220 return parent_.Open(Map(path), code);
2221 auto &entry(file->second);
2222
2223 auto &data(*entry.data_);
2224 auto length(data.pubseekoff(0, std::ios::end, std::ios::in));
2225 data.pubseekpos(0, std::ios::in);
2226 code(data, length, entry.flag_);
2227 }
2228
2229 void UnionFolder::Find(const std::string &path, const Functor<void (const std::string &)> &code, const Functor<void (const std::string &, const Functor<std::string ()> &)> &link) const {
2230 for (auto &reset : resets_)
2231 Map(path, code, reset.first, fun([&](const Functor<void (std::streambuf &, size_t, const void *)> &code) {
2232 auto &entry(reset.second);
2233 auto &data(*entry.data_);
2234 auto length(data.pubseekoff(0, std::ios::end, std::ios::in));
2235 data.pubseekpos(0, std::ios::in);
2236 code(data, length, entry.flag_);
2237 }));
2238
2239 for (auto &remap : remaps_)
2240 Map(path, code, remap.first, fun([&](const Functor<void (std::streambuf &, size_t, const void *)> &code) {
2241 parent_.Open(remap.second, fun([&](std::streambuf &data, size_t length, const void *flag) {
2242 code(data, length, flag);
2243 }));
2244 }));
2245
2246 parent_.Find(path, fun([&](const std::string &name) {
2247 if (deletes_.find(path + name) == deletes_.end())
2248 code(name);
2249 }), fun([&](const std::string &name, const Functor<std::string ()> &read) {
2250 if (deletes_.find(path + name) == deletes_.end())
2251 link(name, read);
2252 }));
2253 }
2254
2255 #ifndef LDID_NOTOOLS
2256 static void copy(std::streambuf &source, std::streambuf &target, size_t length, const Progress &progress) {
2257 progress(0);
2258 size_t total(0);
2259 for (;;) {
2260 char data[4096 * 4];
2261 size_t writ(source.sgetn(data, sizeof(data)));
2262 if (writ == 0)
2263 break;
2264 _assert(target.sputn(data, writ) == writ);
2265 total += writ;
2266 progress(double(total) / length);
2267 }
2268 }
2269
2270 #ifndef LDID_NOPLIST
2271 static plist_t plist(const std::string &data) {
2272 plist_t plist(NULL);
2273 if (Starts(data, "bplist00"))
2274 plist_from_bin(data.data(), data.size(), &plist);
2275 else
2276 plist_from_xml(data.data(), data.size(), &plist);
2277 _assert(plist != NULL);
2278 return plist;
2279 }
2280
2281 static void plist_d(std::streambuf &buffer, size_t length, const Functor<void (plist_t)> &code) {
2282 std::stringbuf data;
2283 copy(buffer, data, length, dummy_);
2284 auto node(plist(data.str()));
2285 _scope({ plist_free(node); });
2286 _assert(plist_get_node_type(node) == PLIST_DICT);
2287 code(node);
2288 }
2289
2290 static std::string plist_s(plist_t node) {
2291 _assert(node != NULL);
2292 _assert(plist_get_node_type(node) == PLIST_STRING);
2293 char *data;
2294 plist_get_string_val(node, &data);
2295 _scope({ free(data); });
2296 return data;
2297 }
2298 #endif
2299
2300 enum Mode {
2301 NoMode,
2302 OptionalMode,
2303 OmitMode,
2304 NestedMode,
2305 TopMode,
2306 };
2307
2308 class Expression {
2309 private:
2310 regex_t regex_;
2311 std::vector<std::string> matches_;
2312
2313 public:
2314 Expression(const std::string &code) {
2315 _assert_(regcomp(&regex_, code.c_str(), REG_EXTENDED) == 0, "regcomp()");
2316 matches_.resize(regex_.re_nsub + 1);
2317 }
2318
2319 ~Expression() {
2320 regfree(&regex_);
2321 }
2322
2323 bool operator ()(const std::string &data) {
2324 regmatch_t matches[matches_.size()];
2325 auto value(regexec(&regex_, data.c_str(), matches_.size(), matches, 0));
2326 if (value == REG_NOMATCH)
2327 return false;
2328 _assert_(value == 0, "regexec()");
2329 for (size_t i(0); i != matches_.size(); ++i)
2330 matches_[i].assign(data.data() + matches[i].rm_so, matches[i].rm_eo - matches[i].rm_so);
2331 return true;
2332 }
2333
2334 const std::string &operator [](size_t index) const {
2335 return matches_[index];
2336 }
2337 };
2338
2339 struct Rule {
2340 unsigned weight_;
2341 Mode mode_;
2342 std::string code_;
2343
2344 mutable std::auto_ptr<Expression> regex_;
2345
2346 Rule(unsigned weight, Mode mode, const std::string &code) :
2347 weight_(weight),
2348 mode_(mode),
2349 code_(code)
2350 {
2351 }
2352
2353 Rule(const Rule &rhs) :
2354 weight_(rhs.weight_),
2355 mode_(rhs.mode_),
2356 code_(rhs.code_)
2357 {
2358 }
2359
2360 void Compile() const {
2361 regex_.reset(new Expression(code_));
2362 }
2363
2364 bool operator ()(const std::string &data) const {
2365 _assert(regex_.get() != NULL);
2366 return (*regex_)(data);
2367 }
2368
2369 bool operator <(const Rule &rhs) const {
2370 if (weight_ > rhs.weight_)
2371 return true;
2372 if (weight_ < rhs.weight_)
2373 return false;
2374 return mode_ > rhs.mode_;
2375 }
2376 };
2377
2378 struct RuleCode {
2379 bool operator ()(const Rule *lhs, const Rule *rhs) const {
2380 return lhs->code_ < rhs->code_;
2381 }
2382 };
2383
2384 #ifndef LDID_NOPLIST
2385 static Hash Sign(const uint8_t *prefix, size_t size, std::streambuf &buffer, Hash &hash, std::streambuf &save, const std::string &identifier, const std::string &entitlements, const std::string &requirements, const std::string &key, const Slots &slots, size_t length, const Progress &progress) {
2386 // XXX: this is a miserable fail
2387 std::stringbuf temp;
2388 put(temp, prefix, size);
2389 copy(buffer, temp, length - size, progress);
2390 // XXX: this is a stupid hack
2391 pad(temp, 0x10 - (length & 0xf));
2392 auto data(temp.str());
2393
2394 HashProxy proxy(hash, save);
2395 return Sign(data.data(), data.size(), proxy, identifier, entitlements, requirements, key, slots, progress);
2396 }
2397
2398 Bundle Sign(const std::string &root, Folder &folder, const std::string &key, std::map<std::string, Hash> &remote, const std::string &requirements, const Functor<std::string (const std::string &, const std::string &)> &alter, const Progress &progress) {
2399 std::string executable;
2400 std::string identifier;
2401
2402 bool mac(false);
2403
2404 std::string info("Info.plist");
2405 if (!folder.Look(info) && folder.Look("Resources/" + info)) {
2406 mac = true;
2407 info = "Resources/" + info;
2408 }
2409
2410 folder.Open(info, fun([&](std::streambuf &buffer, size_t length, const void *flag) {
2411 plist_d(buffer, length, fun([&](plist_t node) {
2412 executable = plist_s(plist_dict_get_item(node, "CFBundleExecutable"));
2413 identifier = plist_s(plist_dict_get_item(node, "CFBundleIdentifier"));
2414 }));
2415 }));
2416
2417 if (!mac && folder.Look("MacOS/" + executable)) {
2418 executable = "MacOS/" + executable;
2419 mac = true;
2420 }
2421
2422 progress(root + "*");
2423
2424 std::string entitlements;
2425 folder.Open(executable, fun([&](std::streambuf &buffer, size_t length, const void *flag) {
2426 // XXX: this is a miserable fail
2427 std::stringbuf temp;
2428 copy(buffer, temp, length, progress);
2429 // XXX: this is a stupid hack
2430 pad(temp, 0x10 - (length & 0xf));
2431 auto data(temp.str());
2432 entitlements = alter(root, Analyze(data.data(), data.size()));
2433 }));
2434
2435 static const std::string directory("_CodeSignature/");
2436 static const std::string signature(directory + "CodeResources");
2437
2438 std::map<std::string, std::multiset<Rule>> versions;
2439
2440 auto &rules1(versions[""]);
2441 auto &rules2(versions["2"]);
2442
2443 const std::string resources(mac ? "Resources/" : "");
2444
2445 if (true) {
2446 rules1.insert(Rule{1, NoMode, "^" + resources});
2447 rules1.insert(Rule{1000, OptionalMode, "^" + resources + ".*\\.lproj/"});
2448 rules1.insert(Rule{1100, OmitMode, "^" + resources + ".*\\.lproj/locversion.plist$"});
2449 rules1.insert(Rule{1010, NoMode, "^Base\\.lproj/"});
2450 rules1.insert(Rule{1, NoMode, "^version.plist$"});
2451 }
2452
2453 if (true) {
2454 rules2.insert(Rule{11, NoMode, ".*\\.dSYM($|/)"});
2455 rules2.insert(Rule{20, NoMode, "^" + resources});
2456 rules2.insert(Rule{2000, OmitMode, "^(.*/)?\\.DS_Store$"});
2457 rules2.insert(Rule{10, NestedMode, "^(Frameworks|SharedFrameworks|PlugIns|Plug-ins|XPCServices|Helpers|MacOS|Library/(Automator|Spotlight|LoginItems))/"});
2458 rules2.insert(Rule{1, NoMode, "^.*"});
2459 rules2.insert(Rule{1000, OptionalMode, "^" + resources + ".*\\.lproj/"});
2460 rules2.insert(Rule{1100, OmitMode, "^" + resources + ".*\\.lproj/locversion.plist$"});
2461 rules2.insert(Rule{1010, NoMode, "^Base\\.lproj/"});
2462 rules2.insert(Rule{20, OmitMode, "^Info\\.plist$"});
2463 rules2.insert(Rule{20, OmitMode, "^PkgInfo$"});
2464 rules2.insert(Rule{10, NestedMode, "^[^/]+$"});
2465 rules2.insert(Rule{20, NoMode, "^embedded\\.provisionprofile$"});
2466 rules2.insert(Rule{20, NoMode, "^version\\.plist$"});
2467 }
2468
2469 std::map<std::string, Hash> local;
2470
2471 std::string failure(mac ? "Contents/|Versions/[^/]*/Resources/" : "");
2472 Expression nested("^(Frameworks/[^/]*\\.framework|PlugIns/[^/]*\\.appex(()|/[^/]*.app))/(" + failure + ")Info\\.plist$");
2473 std::map<std::string, Bundle> bundles;
2474
2475 folder.Find("", fun([&](const std::string &name) {
2476 if (!nested(name))
2477 return;
2478 auto bundle(root + Split(name).dir);
2479 bundle.resize(bundle.size() - resources.size());
2480 SubFolder subfolder(folder, bundle);
2481
2482 bundles[nested[1]] = Sign(bundle, subfolder, key, local, "", Starts(name, "PlugIns/") ? alter :
2483 static_cast<const Functor<std::string (const std::string &, const std::string &)> &>(fun([&](const std::string &, const std::string &) -> std::string { return entitlements; }))
2484 , progress);
2485 }), fun([&](const std::string &name, const Functor<std::string ()> &read) {
2486 }));
2487
2488 std::set<std::string> excludes;
2489
2490 auto exclude([&](const std::string &name) {
2491 // BundleDiskRep::adjustResources -> builder.addExclusion
2492 if (name == executable || Starts(name, directory) || Starts(name, "_MASReceipt/") || name == "CodeResources")
2493 return true;
2494
2495 for (const auto &bundle : bundles)
2496 if (Starts(name, bundle.first + "/")) {
2497 excludes.insert(name);
2498 return true;
2499 }
2500
2501 return false;
2502 });
2503
2504 std::map<std::string, std::string> links;
2505
2506 folder.Find("", fun([&](const std::string &name) {
2507 if (exclude(name))
2508 return;
2509
2510 if (local.find(name) != local.end())
2511 return;
2512 auto &hash(local[name]);
2513
2514 folder.Open(name, fun([&](std::streambuf &data, size_t length, const void *flag) {
2515 progress(root + name);
2516
2517 union {
2518 struct {
2519 uint32_t magic;
2520 uint32_t count;
2521 };
2522
2523 uint8_t bytes[8];
2524 } header;
2525
2526 auto size(most(data, &header.bytes, sizeof(header.bytes)));
2527
2528 if (name != "_WatchKitStub/WK" && size == sizeof(header.bytes))
2529 switch (Swap(header.magic)) {
2530 case FAT_MAGIC:
2531 // Java class file format
2532 if (Swap(header.count) >= 40)
2533 break;
2534 case FAT_CIGAM:
2535 case MH_MAGIC: case MH_MAGIC_64:
2536 case MH_CIGAM: case MH_CIGAM_64:
2537 folder.Save(name, true, flag, fun([&](std::streambuf &save) {
2538 Slots slots;
2539 Sign(header.bytes, size, data, hash, save, identifier, "", "", key, slots, length, Progression(progress, root + name));
2540 }));
2541 return;
2542 }
2543
2544 folder.Save(name, false, flag, fun([&](std::streambuf &save) {
2545 HashProxy proxy(hash, save);
2546 put(proxy, header.bytes, size);
2547 copy(data, proxy, length - size, progress);
2548 }));
2549 }));
2550 }), fun([&](const std::string &name, const Functor<std::string ()> &read) {
2551 if (exclude(name))
2552 return;
2553
2554 links[name] = read();
2555 }));
2556
2557 auto plist(plist_new_dict());
2558 _scope({ plist_free(plist); });
2559
2560 for (const auto &version : versions) {
2561 auto files(plist_new_dict());
2562 plist_dict_set_item(plist, ("files" + version.first).c_str(), files);
2563
2564 for (const auto &rule : version.second)
2565 rule.Compile();
2566
2567 bool old(&version.second == &rules1);
2568
2569 for (const auto &hash : local)
2570 for (const auto &rule : version.second)
2571 if (rule(hash.first)) {
2572 if (!old && mac && excludes.find(hash.first) != excludes.end());
2573 else if (old && rule.mode_ == NoMode)
2574 plist_dict_set_item(files, hash.first.c_str(), plist_new_data(reinterpret_cast<const char *>(hash.second.sha1_), sizeof(hash.second.sha1_)));
2575 else if (rule.mode_ != OmitMode) {
2576 auto entry(plist_new_dict());
2577 plist_dict_set_item(entry, "hash", plist_new_data(reinterpret_cast<const char *>(hash.second.sha1_), sizeof(hash.second.sha1_)));
2578 if (!old)
2579 plist_dict_set_item(entry, "hash2", plist_new_data(reinterpret_cast<const char *>(hash.second.sha256_), sizeof(hash.second.sha256_)));
2580 if (rule.mode_ == OptionalMode)
2581 plist_dict_set_item(entry, "optional", plist_new_bool(true));
2582 plist_dict_set_item(files, hash.first.c_str(), entry);
2583 }
2584
2585 break;
2586 }
2587
2588 for (const auto &link : links)
2589 for (const auto &rule : version.second)
2590 if (rule(link.first)) {
2591 if (rule.mode_ != OmitMode) {
2592 auto entry(plist_new_dict());
2593 plist_dict_set_item(entry, "symlink", plist_new_string(link.second.c_str()));
2594 if (rule.mode_ == OptionalMode)
2595 plist_dict_set_item(entry, "optional", plist_new_bool(true));
2596 plist_dict_set_item(files, link.first.c_str(), entry);
2597 }
2598
2599 break;
2600 }
2601
2602 if (!old && mac)
2603 for (const auto &bundle : bundles) {
2604 auto entry(plist_new_dict());
2605 plist_dict_set_item(entry, "cdhash", plist_new_data(reinterpret_cast<const char *>(bundle.second.hash.sha256_), sizeof(bundle.second.hash.sha256_)));
2606 plist_dict_set_item(entry, "requirement", plist_new_string("anchor apple generic"));
2607 plist_dict_set_item(files, bundle.first.c_str(), entry);
2608 }
2609 }
2610
2611 for (const auto &version : versions) {
2612 auto rules(plist_new_dict());
2613 plist_dict_set_item(plist, ("rules" + version.first).c_str(), rules);
2614
2615 std::multiset<const Rule *, RuleCode> ordered;
2616 for (const auto &rule : version.second)
2617 ordered.insert(&rule);
2618
2619 for (const auto &rule : ordered)
2620 if (rule->weight_ == 1 && rule->mode_ == NoMode)
2621 plist_dict_set_item(rules, rule->code_.c_str(), plist_new_bool(true));
2622 else {
2623 auto entry(plist_new_dict());
2624 plist_dict_set_item(rules, rule->code_.c_str(), entry);
2625
2626 switch (rule->mode_) {
2627 case NoMode:
2628 break;
2629 case OmitMode:
2630 plist_dict_set_item(entry, "omit", plist_new_bool(true));
2631 break;
2632 case OptionalMode:
2633 plist_dict_set_item(entry, "optional", plist_new_bool(true));
2634 break;
2635 case NestedMode:
2636 plist_dict_set_item(entry, "nested", plist_new_bool(true));
2637 break;
2638 case TopMode:
2639 plist_dict_set_item(entry, "top", plist_new_bool(true));
2640 break;
2641 }
2642
2643 if (rule->weight_ >= 10000)
2644 plist_dict_set_item(entry, "weight", plist_new_uint(rule->weight_));
2645 else if (rule->weight_ != 1)
2646 plist_dict_set_item(entry, "weight", plist_new_real(rule->weight_));
2647 }
2648 }
2649
2650 folder.Save(signature, true, NULL, fun([&](std::streambuf &save) {
2651 HashProxy proxy(local[signature], save);
2652 char *xml(NULL);
2653 uint32_t size;
2654 plist_to_xml(plist, &xml, &size);
2655 _scope({ free(xml); });
2656 put(proxy, xml, size);
2657 }));
2658
2659 Bundle bundle;
2660 bundle.path = executable;
2661
2662 folder.Open(executable, fun([&](std::streambuf &buffer, size_t length, const void *flag) {
2663 progress(root + executable);
2664 folder.Save(executable, true, flag, fun([&](std::streambuf &save) {
2665 Slots slots;
2666 slots[1] = local.at(info);
2667 slots[3] = local.at(signature);
2668 bundle.hash = Sign(NULL, 0, buffer, local[executable], save, identifier, entitlements, requirements, key, slots, length, Progression(progress, root + executable));
2669 }));
2670 }));
2671
2672 for (const auto &entry : local)
2673 remote[root + entry.first] = entry.second;
2674
2675 return bundle;
2676 }
2677
2678 Bundle Sign(const std::string &root, Folder &folder, const std::string &key, const std::string &requirements, const Functor<std::string (const std::string &, const std::string &)> &alter, const Progress &progress) {
2679 std::map<std::string, Hash> local;
2680 return Sign(root, folder, key, local, requirements, alter, progress);
2681 }
2682 #endif
2683
2684 #endif
2685 }
2686
2687 #ifndef LDID_NOTOOLS
2688 int main(int argc, char *argv[]) {
2689 #ifndef LDID_NOSMIME
2690 OpenSSL_add_all_algorithms();
2691 #endif
2692
2693 union {
2694 uint16_t word;
2695 uint8_t byte[2];
2696 } endian = {1};
2697
2698 little_ = endian.byte[0];
2699
2700 bool flag_r(false);
2701 bool flag_e(false);
2702 bool flag_q(false);
2703
2704 #ifndef LDID_NOFLAGT
2705 bool flag_T(false);
2706 #endif
2707
2708 bool flag_S(false);
2709 bool flag_s(false);
2710
2711 bool flag_D(false);
2712
2713 bool flag_A(false);
2714 bool flag_a(false);
2715
2716 bool flag_u(false);
2717
2718 uint32_t flag_CPUType(_not(uint32_t));
2719 uint32_t flag_CPUSubtype(_not(uint32_t));
2720
2721 const char *flag_I(NULL);
2722
2723 #ifndef LDID_NOFLAGT
2724 bool timeh(false);
2725 uint32_t timev(0);
2726 #endif
2727
2728 Map entitlements;
2729 Map requirements;
2730 Map key;
2731 ldid::Slots slots;
2732
2733 std::vector<std::string> files;
2734
2735 if (argc == 1) {
2736 fprintf(stderr, "usage: %s -S[entitlements.xml] <binary>\n", argv[0]);
2737 fprintf(stderr, " %s -e MobileSafari\n", argv[0]);
2738 fprintf(stderr, " %s -S cat\n", argv[0]);
2739 fprintf(stderr, " %s -Stfp.xml gdb\n", argv[0]);
2740 exit(0);
2741 }
2742
2743 for (int argi(1); argi != argc; ++argi)
2744 if (argv[argi][0] != '-')
2745 files.push_back(argv[argi]);
2746 else switch (argv[argi][1]) {
2747 case 'r':
2748 _assert(!flag_s);
2749 _assert(!flag_S);
2750 flag_r = true;
2751 break;
2752
2753 case 'e': flag_e = true; break;
2754
2755 case 'E': {
2756 const char *string = argv[argi] + 2;
2757 const char *colon = strchr(string, ':');
2758 _assert(colon != NULL);
2759 Map file(colon + 1, O_RDONLY, PROT_READ, MAP_PRIVATE);
2760 char *arge;
2761 unsigned number(strtoul(string, &arge, 0));
2762 _assert(arge == colon);
2763 auto &slot(slots[number]);
2764 for (Algorithm *algorithm : GetAlgorithms())
2765 (*algorithm)(slot, file.data(), file.size());
2766 } break;
2767
2768 case 'q': flag_q = true; break;
2769
2770 case 'Q': {
2771 const char *xml = argv[argi] + 2;
2772 requirements.open(xml, O_RDONLY, PROT_READ, MAP_PRIVATE);
2773 } break;
2774
2775 case 'D': flag_D = true; break;
2776
2777 case 'a': flag_a = true; break;
2778
2779 case 'A':
2780 _assert(!flag_A);
2781 flag_A = true;
2782 if (argv[argi][2] != '\0') {
2783 const char *cpu = argv[argi] + 2;
2784 const char *colon = strchr(cpu, ':');
2785 _assert(colon != NULL);
2786 char *arge;
2787 flag_CPUType = strtoul(cpu, &arge, 0);
2788 _assert(arge == colon);
2789 flag_CPUSubtype = strtoul(colon + 1, &arge, 0);
2790 _assert(arge == argv[argi] + strlen(argv[argi]));
2791 }
2792 break;
2793
2794 case 's':
2795 _assert(!flag_r);
2796 _assert(!flag_S);
2797 flag_s = true;
2798 break;
2799
2800 case 'S':
2801 _assert(!flag_r);
2802 _assert(!flag_s);
2803 flag_S = true;
2804 if (argv[argi][2] != '\0') {
2805 const char *xml = argv[argi] + 2;
2806 entitlements.open(xml, O_RDONLY, PROT_READ, MAP_PRIVATE);
2807 }
2808 break;
2809
2810 case 'K':
2811 if (argv[argi][2] != '\0')
2812 key.open(argv[argi] + 2, O_RDONLY, PROT_READ, MAP_PRIVATE);
2813 break;
2814
2815 #ifndef LDID_NOFLAGT
2816 case 'T': {
2817 flag_T = true;
2818 if (argv[argi][2] == '-')
2819 timeh = true;
2820 else {
2821 char *arge;
2822 timev = strtoul(argv[argi] + 2, &arge, 0);
2823 _assert(arge == argv[argi] + strlen(argv[argi]));
2824 }
2825 } break;
2826 #endif
2827
2828 case 'u': {
2829 flag_u = true;
2830 } break;
2831
2832 case 'I': {
2833 flag_I = argv[argi] + 2;
2834 } break;
2835
2836 default:
2837 goto usage;
2838 break;
2839 }
2840
2841 _assert(flag_S || key.empty());
2842 _assert(flag_S || flag_I == NULL);
2843
2844 if (files.empty()) usage: {
2845 exit(0);
2846 }
2847
2848 size_t filei(0), filee(0);
2849 _foreach (file, files) try {
2850 std::string path(file);
2851
2852 struct stat info;
2853 _syscall(stat(path.c_str(), &info));
2854
2855 if (S_ISDIR(info.st_mode)) {
2856 #ifndef LDID_NOPLIST
2857 _assert(!flag_r);
2858 ldid::DiskFolder folder(path);
2859 path += "/" + Sign("", folder, key, requirements, ldid::fun([&](const std::string &, const std::string &) -> std::string { return entitlements; }), dummy_).path;
2860 #else
2861 _assert(false);
2862 #endif
2863 } else if (flag_S || flag_r) {
2864 Map input(path, O_RDONLY, PROT_READ, MAP_PRIVATE);
2865
2866 std::filebuf output;
2867 Split split(path);
2868 auto temp(Temporary(output, split));
2869
2870 if (flag_r)
2871 ldid::Unsign(input.data(), input.size(), output, dummy_);
2872 else {
2873 std::string identifier(flag_I ?: split.base.c_str());
2874 ldid::Sign(input.data(), input.size(), output, identifier, entitlements, requirements, key, slots, dummy_);
2875 }
2876
2877 Commit(path, temp);
2878 }
2879
2880 bool modify(false);
2881 #ifndef LDID_NOFLAGT
2882 if (flag_T)
2883 modify = true;
2884 #endif
2885 if (flag_s)
2886 modify = true;
2887
2888 Map mapping(path, modify);
2889 FatHeader fat_header(mapping.data(), mapping.size());
2890
2891 _foreach (mach_header, fat_header.GetMachHeaders()) {
2892 struct linkedit_data_command *signature(NULL);
2893 struct encryption_info_command *encryption(NULL);
2894
2895 if (flag_A) {
2896 if (mach_header.GetCPUType() != flag_CPUType)
2897 continue;
2898 if (mach_header.GetCPUSubtype() != flag_CPUSubtype)
2899 continue;
2900 }
2901
2902 if (flag_a)
2903 printf("cpu=0x%x:0x%x\n", mach_header.GetCPUType(), mach_header.GetCPUSubtype());
2904
2905 _foreach (load_command, mach_header.GetLoadCommands()) {
2906 uint32_t cmd(mach_header.Swap(load_command->cmd));
2907
2908 if (false);
2909 else if (cmd == LC_CODE_SIGNATURE)
2910 signature = reinterpret_cast<struct linkedit_data_command *>(load_command);
2911 else if (cmd == LC_ENCRYPTION_INFO || cmd == LC_ENCRYPTION_INFO_64)
2912 encryption = reinterpret_cast<struct encryption_info_command *>(load_command);
2913 else if (cmd == LC_LOAD_DYLIB) {
2914 volatile struct dylib_command *dylib_command(reinterpret_cast<struct dylib_command *>(load_command));
2915 const char *name(reinterpret_cast<const char *>(load_command) + mach_header.Swap(dylib_command->dylib.name));
2916
2917 if (strcmp(name, "/System/Library/Frameworks/UIKit.framework/UIKit") == 0) {
2918 if (flag_u) {
2919 Version version;
2920 version.value = mach_header.Swap(dylib_command->dylib.current_version);
2921 printf("uikit=%u.%u.%u\n", version.major, version.minor, version.patch);
2922 }
2923 }
2924 }
2925 #ifndef LDID_NOFLAGT
2926 else if (cmd == LC_ID_DYLIB) {
2927 volatile struct dylib_command *dylib_command(reinterpret_cast<struct dylib_command *>(load_command));
2928
2929 if (flag_T) {
2930 uint32_t timed;
2931
2932 if (!timeh)
2933 timed = timev;
2934 else {
2935 dylib_command->dylib.timestamp = 0;
2936 timed = hash(reinterpret_cast<uint8_t *>(mach_header.GetBase()), mach_header.GetSize(), timev);
2937 }
2938
2939 dylib_command->dylib.timestamp = mach_header.Swap(timed);
2940 }
2941 }
2942 #endif
2943 }
2944
2945 if (flag_D) {
2946 _assert(encryption != NULL);
2947 encryption->cryptid = mach_header.Swap(0);
2948 }
2949
2950 if (flag_e) {
2951 _assert(signature != NULL);
2952
2953 uint32_t data = mach_header.Swap(signature->dataoff);
2954
2955 uint8_t *top = reinterpret_cast<uint8_t *>(mach_header.GetBase());
2956 uint8_t *blob = top + data;
2957 struct SuperBlob *super = reinterpret_cast<struct SuperBlob *>(blob);
2958
2959 for (size_t index(0); index != Swap(super->count); ++index)
2960 if (Swap(super->index[index].type) == CSSLOT_ENTITLEMENTS) {
2961 uint32_t begin = Swap(super->index[index].offset);
2962 struct Blob *entitlements = reinterpret_cast<struct Blob *>(blob + begin);
2963 fwrite(entitlements + 1, 1, Swap(entitlements->length) - sizeof(*entitlements), stdout);
2964 }
2965 }
2966
2967 if (flag_q) {
2968 _assert(signature != NULL);
2969
2970 uint32_t data = mach_header.Swap(signature->dataoff);
2971
2972 uint8_t *top = reinterpret_cast<uint8_t *>(mach_header.GetBase());
2973 uint8_t *blob = top + data;
2974 struct SuperBlob *super = reinterpret_cast<struct SuperBlob *>(blob);
2975
2976 for (size_t index(0); index != Swap(super->count); ++index)
2977 if (Swap(super->index[index].type) == CSSLOT_REQUIREMENTS) {
2978 uint32_t begin = Swap(super->index[index].offset);
2979 struct Blob *requirement = reinterpret_cast<struct Blob *>(blob + begin);
2980 fwrite(requirement, 1, Swap(requirement->length), stdout);
2981 }
2982 }
2983
2984 if (flag_s) {
2985 _assert(signature != NULL);
2986
2987 uint32_t data = mach_header.Swap(signature->dataoff);
2988
2989 uint8_t *top = reinterpret_cast<uint8_t *>(mach_header.GetBase());
2990 uint8_t *blob = top + data;
2991 struct SuperBlob *super = reinterpret_cast<struct SuperBlob *>(blob);
2992
2993 for (size_t index(0); index != Swap(super->count); ++index)
2994 if (Swap(super->index[index].type) == CSSLOT_CODEDIRECTORY) {
2995 uint32_t begin = Swap(super->index[index].offset);
2996 struct CodeDirectory *directory = reinterpret_cast<struct CodeDirectory *>(blob + begin + sizeof(Blob));
2997
2998 uint8_t (*hashes)[LDID_SHA1_DIGEST_LENGTH] = reinterpret_cast<uint8_t (*)[LDID_SHA1_DIGEST_LENGTH]>(blob + begin + Swap(directory->hashOffset));
2999 uint32_t pages = Swap(directory->nCodeSlots);
3000
3001 if (pages != 1)
3002 for (size_t i = 0; i != pages - 1; ++i)
3003 LDID_SHA1(top + PageSize_ * i, PageSize_, hashes[i]);
3004 if (pages != 0)
3005 LDID_SHA1(top + PageSize_ * (pages - 1), ((data - 1) % PageSize_) + 1, hashes[pages - 1]);
3006 }
3007 }
3008 }
3009
3010 ++filei;
3011 } catch (const char *) {
3012 ++filee;
3013 ++filei;
3014 }
3015
3016 return filee;
3017 }
3018 #endif