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