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