1 /* -*- mode: C++; c-basic-offset: 4; tab-width: 4 -*-*
3 * Copyright (c) 2005-2011 Apple Inc. All rights reserved.
5 * @APPLE_LICENSE_HEADER_START@
7 * This file contains Original Code and/or Modifications of Original Code
8 * as defined in and that are subject to the Apple Public Source License
9 * Version 2.0 (the 'License'). You may not use this file except in
10 * compliance with the License. Please obtain a copy of the License at
11 * http://www.opensource.apple.com/apsl/ and read it before using this
14 * The Original Code and all software distributed under the License are
15 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
19 * Please see the License for the specific language governing rights and
20 * limitations under the License.
22 * @APPLE_LICENSE_HEADER_END@
25 // start temp HACK for cross builds
26 extern "C" double log2 ( double );
28 // end temp HACK for cross builds
32 #include <sys/types.h>
35 #include <sys/sysctl.h>
41 #include <mach/mach_time.h>
42 #include <mach/vm_statistics.h>
43 #include <mach/mach_init.h>
44 #include <mach/mach_host.h>
46 #include <mach-o/dyld.h>
48 #include <AvailabilityMacros.h>
57 #include <ext/hash_map>
58 #include <ext/hash_set>
63 #include "MachOFileAbstraction.hpp"
64 #include "Architectures.hpp"
67 #include "InputFiles.h"
69 #include "OutputFile.h"
71 #include "passes/stubs/make_stubs.h"
72 #include "passes/dtrace_dof.h"
73 #include "passes/got.h"
74 #include "passes/tlvp.h"
75 #include "passes/huge.h"
76 #include "passes/compact_unwind.h"
77 #include "passes/order.h"
78 #include "passes/branch_island.h"
79 #include "passes/branch_shim.h"
80 #include "passes/objc.h"
81 #include "passes/dylibs.h"
83 #include "parsers/archive_file.h"
84 #include "parsers/macho_relocatable_file.h"
85 #include "parsers/macho_dylib_file.h"
86 #include "parsers/lto_file.h"
87 #include "parsers/opaque_section_file.h"
90 struct PerformanceStatistics
{
92 uint64_t startInputFileProcessing
;
93 uint64_t startResolver
;
98 vm_statistics_data_t vmStart
;
99 vm_statistics_data_t vmEnd
;
106 class InternalState
: public ld::Internal
109 InternalState(const Options
& opts
) : _options(opts
), _atomsOrderedInSections(false) { }
110 virtual ld::Internal::FinalSection
* addAtom(const ld::Atom
& atom
);
111 virtual ld::Internal::FinalSection
* getFinalSection(const ld::Section
&);
114 void markAtomsOrdered() { _atomsOrderedInSections
= true; }
115 virtual ~InternalState() {}
118 class FinalSection
: public ld::Internal::FinalSection
121 FinalSection(const ld::Section
& sect
, uint32_t sectionsSeen
, bool objFile
);
122 static int sectionComparer(const void* l
, const void* r
);
123 static const ld::Section
& outputSection(const ld::Section
& sect
, bool mergeZeroFill
);
124 static const ld::Section
& objectOutputSection(const ld::Section
& sect
, bool makeTentativeDefsReal
);
126 friend class InternalState
;
127 static uint32_t sectionOrder(const ld::Section
& sect
, uint32_t sectionsSeen
);
128 static uint32_t segmentOrder(const ld::Section
& sect
, bool objFile
);
129 uint32_t _segmentOrder
;
130 uint32_t _sectionOrder
;
132 static std::vector
<const char*> _s_segmentsSeen
;
133 static ld::Section _s_DATA_data
;
134 static ld::Section _s_DATA_const
;
135 static ld::Section _s_TEXT_text
;
136 static ld::Section _s_TEXT_const
;
137 static ld::Section _s_DATA_nl_symbol_ptr
;
138 static ld::Section _s_DATA_common
;
139 static ld::Section _s_DATA_zerofill
;
144 size_t operator()(const ld::Section
*) const;
146 struct SectionEquals
{
147 bool operator()(const ld::Section
* left
, const ld::Section
* right
) const;
149 typedef __gnu_cxx::hash_map
<const ld::Section
*, FinalSection
*, SectionHash
, SectionEquals
> SectionInToOut
;
152 SectionInToOut _sectionInToFinalMap
;
153 const Options
& _options
;
154 bool _atomsOrderedInSections
;
157 ld::Section
InternalState::FinalSection::_s_DATA_data( "__DATA", "__data", ld::Section::typeUnclassified
);
158 ld::Section
InternalState::FinalSection::_s_DATA_const("__DATA", "__const", ld::Section::typeUnclassified
);
159 ld::Section
InternalState::FinalSection::_s_TEXT_text( "__TEXT", "__text", ld::Section::typeCode
);
160 ld::Section
InternalState::FinalSection::_s_TEXT_const("__TEXT", "__const", ld::Section::typeUnclassified
);
161 ld::Section
InternalState::FinalSection::_s_DATA_nl_symbol_ptr("__DATA", "__nl_symbol_ptr", ld::Section::typeNonLazyPointer
);
162 ld::Section
InternalState::FinalSection::_s_DATA_common("__DATA", "__common", ld::Section::typeZeroFill
);
163 ld::Section
InternalState::FinalSection::_s_DATA_zerofill("__DATA", "__zerofill", ld::Section::typeZeroFill
);
164 std::vector
<const char*> InternalState::FinalSection::_s_segmentsSeen
;
167 size_t InternalState::SectionHash::operator()(const ld::Section
* sect
) const
170 __gnu_cxx::hash
<const char*> temp
;
171 hash
+= temp
.operator()(sect
->segmentName());
172 hash
+= temp
.operator()(sect
->sectionName());
176 bool InternalState::SectionEquals::operator()(const ld::Section
* left
, const ld::Section
* right
) const
178 return (*left
== *right
);
182 InternalState::FinalSection::FinalSection(const ld::Section
& sect
, uint32_t sectionsSeen
, bool objFile
)
183 : ld::Internal::FinalSection(sect
),
184 _segmentOrder(segmentOrder(sect
, objFile
)),
185 _sectionOrder(sectionOrder(sect
, sectionsSeen
))
187 //fprintf(stderr, "FinalSection(%s, %s) _segmentOrder=%d, _sectionOrder=%d\n",
188 // this->segmentName(), this->sectionName(), _segmentOrder, _sectionOrder);
191 const ld::Section
& InternalState::FinalSection::outputSection(const ld::Section
& sect
, bool mergeZeroFill
)
193 // merge sections in final linked image
194 switch ( sect
.type() ) {
195 case ld::Section::typeLiteral4
:
196 case ld::Section::typeLiteral8
:
197 case ld::Section::typeLiteral16
:
198 return _s_TEXT_const
;
199 case ld::Section::typeUnclassified
:
200 if ( strcmp(sect
.segmentName(), "__DATA") == 0 ) {
201 if ( strcmp(sect
.sectionName(), "__datacoal_nt") == 0 )
203 if ( strcmp(sect
.sectionName(), "__const_coal") == 0 )
204 return _s_DATA_const
;
206 else if ( strcmp(sect
.segmentName(), "__TEXT") == 0 ) {
207 if ( strcmp(sect
.sectionName(), "__const_coal") == 0 )
208 return _s_TEXT_const
;
211 case ld::Section::typeZeroFill
:
213 return _s_DATA_zerofill
;
215 case ld::Section::typeCode
:
216 if ( strcmp(sect
.segmentName(), "__TEXT") == 0 ) {
217 if ( strcmp(sect
.sectionName(), "__textcoal_nt") == 0 )
219 else if ( strcmp(sect
.sectionName(), "__StaticInit") == 0 )
223 case ld::Section::typeNonLazyPointer
:
224 if ( strcmp(sect
.segmentName(), "__DATA") == 0 ) {
225 if ( strcmp(sect
.sectionName(), "__nl_symbol_ptr") == 0 )
226 return _s_DATA_nl_symbol_ptr
;
228 else if ( strcmp(sect
.segmentName(), "__IMPORT") == 0 ) {
229 if ( strcmp(sect
.sectionName(), "__pointers") == 0 )
230 return _s_DATA_nl_symbol_ptr
;
233 case ld::Section::typeTentativeDefs
:
235 return _s_DATA_zerofill
;
237 return _s_DATA_common
;
246 const ld::Section
& InternalState::FinalSection::objectOutputSection(const ld::Section
& sect
, bool makeTentativeDefsReal
)
248 // in -r mode the only section that ever changes is __tenative -> __common with -d option
249 if ( (sect
.type() == ld::Section::typeTentativeDefs
) && makeTentativeDefsReal
)
250 return _s_DATA_common
;
254 uint32_t InternalState::FinalSection::segmentOrder(const ld::Section
& sect
, bool objFile
)
256 if ( strcmp(sect
.segmentName(), "__PAGEZERO") == 0 )
258 if ( strcmp(sect
.segmentName(), "__HEADER") == 0 ) // only used with -preload
260 if ( strcmp(sect
.segmentName(), "__TEXT") == 0 )
262 // in -r mode, want __DATA last so zerofill sections are at end
263 if ( strcmp(sect
.segmentName(), "__DATA") == 0 )
264 return (objFile
? 5 : 2);
265 if ( strcmp(sect
.segmentName(), "__OBJC") == 0 )
267 if ( strcmp(sect
.segmentName(), "__IMPORT") == 0 )
270 // layout non-standard segments in order seen (+10 to shift beyond standard segments)
271 for (uint32_t i
=0; i
< _s_segmentsSeen
.size(); ++i
) {
272 if ( strcmp(_s_segmentsSeen
[i
], sect
.segmentName()) == 0 )
275 _s_segmentsSeen
.push_back(sect
.segmentName());
276 return _s_segmentsSeen
.size()-1+10;
279 uint32_t InternalState::FinalSection::sectionOrder(const ld::Section
& sect
, uint32_t sectionsSeen
)
281 if ( sect
.type() == ld::Section::typeFirstSection
)
283 if ( sect
.type() == ld::Section::typeMachHeader
)
285 if ( sect
.type() == ld::Section::typeLastSection
)
287 if ( strcmp(sect
.segmentName(), "__TEXT") == 0 ) {
288 switch ( sect
.type() ) {
289 case ld::Section::typeCode
:
290 // <rdar://problem/8346444> make __text always be first "code" section
291 if ( strcmp(sect
.sectionName(), "__text") == 0 )
295 case ld::Section::typeStub
:
297 case ld::Section::typeStubHelper
:
299 case ld::Section::typeLSDA
:
301 case ld::Section::typeUnwindInfo
:
303 case ld::Section::typeCFI
:
305 case ld::Section::typeStubClose
:
308 return sectionsSeen
+20;
311 else if ( strcmp(sect
.segmentName(), "__DATA") == 0 ) {
312 switch ( sect
.type() ) {
313 case ld::Section::typeLazyPointerClose
:
315 case ld::Section::typeDyldInfo
:
317 case ld::Section::typeNonLazyPointer
:
319 case ld::Section::typeLazyPointer
:
321 case ld::Section::typeInitializerPointers
:
323 case ld::Section::typeTerminatorPointers
:
325 case ld::Section::typeTLVInitialValues
:
326 return INT_MAX
-4; // need TLV zero-fill to follow TLV init values
327 case ld::Section::typeTLVZeroFill
:
329 case ld::Section::typeZeroFill
:
330 // make sure __huge is always last zerofill section
331 if ( strcmp(sect
.sectionName(), "__huge") == 0 )
336 // <rdar://problem/7435296> Reorder sections to reduce page faults in object files
337 if ( strcmp(sect
.sectionName(), "__objc_classlist") == 0 )
339 else if ( strcmp(sect
.sectionName(), "__objc_nlclslist") == 0 )
341 else if ( strcmp(sect
.sectionName(), "__objc_catlist") == 0 )
343 else if ( strcmp(sect
.sectionName(), "__objc_protolist") == 0 )
345 else if ( strcmp(sect
.sectionName(), "__objc_imageinfo") == 0 )
347 else if ( strcmp(sect
.sectionName(), "__objc_const") == 0 )
349 else if ( strcmp(sect
.sectionName(), "__objc_selrefs") == 0 )
351 else if ( strcmp(sect
.sectionName(), "__objc_msgrefs") == 0 )
353 else if ( strcmp(sect
.sectionName(), "__objc_protorefs") == 0 )
355 else if ( strcmp(sect
.sectionName(), "__objc_classrefs") == 0 )
357 else if ( strcmp(sect
.sectionName(), "__objc_superrefs") == 0 )
359 else if ( strcmp(sect
.sectionName(), "__objc_data") == 0 )
362 return sectionsSeen
+40;
365 // make sure zerofill in any other section is at end of segment
366 if ( sect
.type() == ld::Section::typeZeroFill
)
368 return sectionsSeen
+20;
372 static void validateFixups(const ld::Atom
& atom
)
374 //fprintf(stderr, "validateFixups %s\n", atom.name());
375 bool lastWasClusterEnd
= true;
376 ld::Fixup::Cluster lastClusterSize
= ld::Fixup::k1of1
;
377 uint32_t curClusterOffsetInAtom
= 0;
378 for (ld::Fixup::iterator fit
=atom
.fixupsBegin(); fit
!= atom
.fixupsEnd(); ++fit
) {
379 //fprintf(stderr, " fixup offset=%d, cluster=%d\n", fit->offsetInAtom, fit->clusterSize);
380 assert((fit
->offsetInAtom
< atom
.size()) || (fit
->offsetInAtom
== 0));
381 if ( fit
->firstInCluster() ) {
382 assert(lastWasClusterEnd
);
383 curClusterOffsetInAtom
= fit
->offsetInAtom
;
384 lastWasClusterEnd
= (fit
->clusterSize
== ld::Fixup::k1of1
);
387 assert(!lastWasClusterEnd
);
388 assert(fit
->offsetInAtom
== curClusterOffsetInAtom
);
389 switch ((ld::Fixup::Cluster
)fit
->clusterSize
) {
390 case ld::Fixup::k1of1
:
391 case ld::Fixup::k1of2
:
392 case ld::Fixup::k1of3
:
393 case ld::Fixup::k1of4
:
394 case ld::Fixup::k1of5
:
395 lastWasClusterEnd
= false;
397 case ld::Fixup::k2of2
:
398 assert(lastClusterSize
= ld::Fixup::k1of2
);
399 lastWasClusterEnd
= true;
401 case ld::Fixup::k2of3
:
402 assert(lastClusterSize
= ld::Fixup::k1of3
);
403 lastWasClusterEnd
= false;
405 case ld::Fixup::k2of4
:
406 assert(lastClusterSize
= ld::Fixup::k1of4
);
407 lastWasClusterEnd
= false;
409 case ld::Fixup::k2of5
:
410 assert(lastClusterSize
= ld::Fixup::k1of5
);
411 lastWasClusterEnd
= false;
413 case ld::Fixup::k3of3
:
414 assert(lastClusterSize
= ld::Fixup::k2of3
);
415 lastWasClusterEnd
= true;
417 case ld::Fixup::k3of4
:
418 assert(lastClusterSize
= ld::Fixup::k2of4
);
419 lastWasClusterEnd
= false;
421 case ld::Fixup::k3of5
:
422 assert(lastClusterSize
= ld::Fixup::k2of5
);
423 lastWasClusterEnd
= false;
425 case ld::Fixup::k4of4
:
426 assert(lastClusterSize
= ld::Fixup::k3of4
);
427 lastWasClusterEnd
= true;
429 case ld::Fixup::k4of5
:
430 assert(lastClusterSize
= ld::Fixup::k3of5
);
431 lastWasClusterEnd
= false;
433 case ld::Fixup::k5of5
:
434 assert(lastClusterSize
= ld::Fixup::k4of5
);
435 lastWasClusterEnd
= true;
439 lastClusterSize
= fit
->clusterSize
;
440 if ( fit
->binding
== ld::Fixup::bindingDirectlyBound
) {
441 assert(fit
->u
.target
!= NULL
);
444 switch (lastClusterSize
) {
445 case ld::Fixup::k1of1
:
446 case ld::Fixup::k2of2
:
447 case ld::Fixup::k3of3
:
448 case ld::Fixup::k4of4
:
449 case ld::Fixup::k5of5
:
452 assert(0 && "last fixup was not end of cluster");
458 ld::Internal::FinalSection
* InternalState::addAtom(const ld::Atom
& atom
)
460 ld::Internal::FinalSection
* fs
= this->getFinalSection(atom
.section());
461 //fprintf(stderr, "InternalState::doAtom(%p), name=%s, sect=%s, finalsect=%p\n", &atom, atom.name(), atom.section().sectionName(), fs);
463 validateFixups(atom
);
465 if ( _atomsOrderedInSections
) {
466 // make sure this atom is placed before any trailing section$end$ atom
467 if ( (fs
->atoms
.size() > 1) && (fs
->atoms
.back()->contentType() == ld::Atom::typeSectionEnd
) ) {
468 // last atom in section$end$ atom, insert before it
469 const ld::Atom
* endAtom
= fs
->atoms
.back();
470 fs
->atoms
.pop_back();
471 fs
->atoms
.push_back(&atom
);
472 fs
->atoms
.push_back(endAtom
);
475 // not end atom, just append new atom
476 fs
->atoms
.push_back(&atom
);
481 fs
->atoms
.push_back(&atom
);
486 ld::Internal::FinalSection
* InternalState::getFinalSection(const ld::Section
& inputSection
)
488 const ld::Section
* baseForFinalSection
= &inputSection
;
490 // see if input section already has a FinalSection
491 SectionInToOut::iterator pos
= _sectionInToFinalMap
.find(&inputSection
);
492 if ( pos
!= _sectionInToFinalMap
.end() ) {
496 // otherwise, create a new final section
497 bool objFile
= false;
498 switch ( _options
.outputKind() ) {
499 case Options::kStaticExecutable
:
500 case Options::kDynamicExecutable
:
501 case Options::kDynamicLibrary
:
502 case Options::kDynamicBundle
:
504 case Options::kKextBundle
:
505 case Options::kPreload
:
507 // coalesce some sections
508 const ld::Section
& outSect
= FinalSection::outputSection(inputSection
, _options
.mergeZeroFill());
509 pos
= _sectionInToFinalMap
.find(&outSect
);
510 if ( pos
!= _sectionInToFinalMap
.end() ) {
511 _sectionInToFinalMap
[&inputSection
] = pos
->second
;
512 //fprintf(stderr, "_sectionInToFinalMap[%p] = %p\n", &inputSection, pos->second);
515 else if ( outSect
!= inputSection
) {
516 // new output section created, but not in map
517 baseForFinalSection
= &outSect
;
521 case Options::kObjectFile
:
522 baseForFinalSection
= &FinalSection::objectOutputSection(inputSection
, _options
.makeTentativeDefinitionsReal());
523 pos
= _sectionInToFinalMap
.find(baseForFinalSection
);
524 if ( pos
!= _sectionInToFinalMap
.end() ) {
525 _sectionInToFinalMap
[&inputSection
] = pos
->second
;
526 //fprintf(stderr, "_sectionInToFinalMap[%p] = %p\n", &inputSection, pos->second);
533 InternalState::FinalSection
* result
= new InternalState::FinalSection(*baseForFinalSection
,
534 _sectionInToFinalMap
.size(), objFile
);
535 _sectionInToFinalMap
[baseForFinalSection
] = result
;
536 //fprintf(stderr, "_sectionInToFinalMap[%p] = %p\n", baseForFinalSection, result);
537 sections
.push_back(result
);
542 int InternalState::FinalSection::sectionComparer(const void* l
, const void* r
)
544 const FinalSection
* left
= *(FinalSection
**)l
;
545 const FinalSection
* right
= *(FinalSection
**)r
;
546 if ( left
->_segmentOrder
!= right
->_segmentOrder
)
547 return (left
->_segmentOrder
- right
->_segmentOrder
);
548 return (left
->_sectionOrder
- right
->_sectionOrder
);
551 void InternalState::sortSections()
553 //fprintf(stderr, "UNSORTED final sections:\n");
554 //for (std::vector<ld::Internal::FinalSection*>::iterator it = sections.begin(); it != sections.end(); ++it) {
555 // fprintf(stderr, "final section %p %s/%s\n", (*it), (*it)->segmentName(), (*it)->sectionName());
557 qsort(§ions
[0], sections
.size(), sizeof(FinalSection
*), &InternalState::FinalSection::sectionComparer
);
558 //fprintf(stderr, "SORTED final sections:\n");
559 //for (std::vector<ld::Internal::FinalSection*>::iterator it = sections.begin(); it != sections.end(); ++it) {
560 // fprintf(stderr, "final section %p %s/%s\n", (*it), (*it)->segmentName(), (*it)->sectionName());
562 assert((sections
[0]->type() == ld::Section::typeMachHeader
)
563 || ((sections
[0]->type() == ld::Section::typeFirstSection
) && (sections
[1]->type() == ld::Section::typeMachHeader
))
564 || ((sections
[0]->type() == ld::Section::typePageZero
) && (sections
[1]->type() == ld::Section::typeMachHeader
))
565 || ((sections
[0]->type() == ld::Section::typePageZero
) && (sections
[1]->type() == ld::Section::typeFirstSection
) && (sections
[2]->type() == ld::Section::typeMachHeader
)) );
569 static char* commatize(uint64_t in
, char* out
)
573 sprintf(rawNum
, "%llu", in
);
574 const int rawNumLen
= strlen(rawNum
);
575 for(int i
=0; i
< rawNumLen
-1; ++i
) {
577 if ( ((rawNumLen
-i
) % 3) == 1 )
580 *out
++ = rawNum
[rawNumLen
-1];
585 static void printTime(const char* msg
, uint64_t partTime
, uint64_t totalTime
)
587 static uint64_t sUnitsPerSecond
= 0;
588 if ( sUnitsPerSecond
== 0 ) {
589 struct mach_timebase_info timeBaseInfo
;
590 if ( mach_timebase_info(&timeBaseInfo
) == KERN_SUCCESS
) {
591 sUnitsPerSecond
= 1000000000ULL * timeBaseInfo
.denom
/ timeBaseInfo
.numer
;
592 //fprintf(stderr, "sUnitsPerSecond=%llu\n", sUnitsPerSecond);
595 if ( partTime
< sUnitsPerSecond
) {
596 uint32_t milliSecondsTimeTen
= (partTime
*10000)/sUnitsPerSecond
;
597 uint32_t milliSeconds
= milliSecondsTimeTen
/10;
598 uint32_t percentTimesTen
= (partTime
*1000)/totalTime
;
599 uint32_t percent
= percentTimesTen
/10;
600 fprintf(stderr
, "%24s: % 4d.%d milliseconds (% 4d.%d%%)\n", msg
, milliSeconds
, milliSecondsTimeTen
-milliSeconds
*10, percent
, percentTimesTen
-percent
*10);
603 uint32_t secondsTimeTen
= (partTime
*10)/sUnitsPerSecond
;
604 uint32_t seconds
= secondsTimeTen
/10;
605 uint32_t percentTimesTen
= (partTime
*1000)/totalTime
;
606 uint32_t percent
= percentTimesTen
/10;
607 fprintf(stderr
, "%24s: % 4d.%d seconds (% 4d.%d%%)\n", msg
, seconds
, secondsTimeTen
-seconds
*10, percent
, percentTimesTen
-percent
*10);
612 static void getVMInfo(vm_statistics_data_t
& info
)
614 mach_msg_type_number_t count
= sizeof(vm_statistics_data_t
) / sizeof(natural_t
);
615 kern_return_t error
= host_statistics(mach_host_self(), HOST_VM_INFO
,
616 (host_info_t
)&info
, &count
);
617 if (error
!= KERN_SUCCESS
) {
618 bzero(&info
, sizeof(vm_statistics_data_t
));
622 int main(int argc
, const char* argv
[])
624 const char* archName
= NULL
;
625 bool showArch
= false;
626 bool archInferred
= false;
628 PerformanceStatistics statistics
;
629 statistics
.startTool
= mach_absolute_time();
631 // create object to track command line arguments
632 Options
options(argc
, argv
);
633 InternalState
state(options
);
636 if ( options
.printStatistics() )
637 getVMInfo(statistics
.vmStart
);
639 // update strings for error messages
640 showArch
= options
.printArchPrefix();
641 archName
= options
.architectureName();
642 archInferred
= (options
.architecture() == 0);
644 // open and parse input files
645 statistics
.startInputFileProcessing
= mach_absolute_time();
646 ld::tool::InputFiles
inputFiles(options
, &archName
);
648 // load and resolve all references
649 statistics
.startResolver
= mach_absolute_time();
650 ld::tool::Resolver
resolver(options
, inputFiles
, state
);
654 statistics
.startDylibs
= mach_absolute_time();
655 inputFiles
.dylibs(state
);
657 // do initial section sorting so passes have rough idea of the layout
658 state
.sortSections();
661 statistics
.startPasses
= mach_absolute_time();
662 ld::passes::objc::doPass(options
, state
);
663 ld::passes::stubs::doPass(options
, state
);
664 ld::passes::huge::doPass(options
, state
);
665 ld::passes::got::doPass(options
, state
);
666 ld::passes::tlvp::doPass(options
, state
);
667 ld::passes::dylibs::doPass(options
, state
); // must be after stubs and GOT passes
668 ld::passes::order::doPass(options
, state
);
669 state
.markAtomsOrdered();
670 ld::passes::branch_shim::doPass(options
, state
); // must be after stubs
671 ld::passes::branch_island::doPass(options
, state
); // must be after stubs and order pass
672 ld::passes::dtrace::doPass(options
, state
);
673 ld::passes::compact_unwind::doPass(options
, state
); // must be after order pass
675 // sort final sections
676 state
.sortSections();
679 statistics
.startOutput
= mach_absolute_time();
680 ld::tool::OutputFile
out(options
);
682 statistics
.startDone
= mach_absolute_time();
685 //mach_o::relocatable::printCounts();
686 if ( options
.printStatistics() ) {
687 getVMInfo(statistics
.vmEnd
);
688 uint64_t totalTime
= statistics
.startDone
- statistics
.startTool
;
689 printTime("ld total time", totalTime
, totalTime
);
690 printTime(" option parsing time", statistics
.startInputFileProcessing
- statistics
.startTool
, totalTime
);
691 printTime(" object file processing", statistics
.startResolver
- statistics
.startInputFileProcessing
,totalTime
);
692 printTime(" resolve symbols", statistics
.startDylibs
- statistics
.startResolver
, totalTime
);
693 printTime(" build atom list", statistics
.startPasses
- statistics
.startDylibs
, totalTime
);
694 printTime(" passess", statistics
.startOutput
- statistics
.startPasses
, totalTime
);
695 printTime(" write output", statistics
.startDone
- statistics
.startOutput
, totalTime
);
696 fprintf(stderr
, "pageins=%u, pageouts=%u, faults=%u\n",
697 statistics
.vmEnd
.pageins
-statistics
.vmStart
.pageins
,
698 statistics
.vmEnd
.pageouts
-statistics
.vmStart
.pageouts
,
699 statistics
.vmEnd
.faults
-statistics
.vmStart
.faults
);
701 fprintf(stderr
, "processed %3u object files, totaling %15s bytes\n", inputFiles
._totalObjectLoaded
, commatize(inputFiles
._totalObjectSize
, temp
));
702 fprintf(stderr
, "processed %3u archive files, totaling %15s bytes\n", inputFiles
._totalArchivesLoaded
, commatize(inputFiles
._totalArchiveSize
, temp
));
703 fprintf(stderr
, "processed %3u dylib files\n", inputFiles
._totalDylibsLoaded
);
704 fprintf(stderr
, "wrote output file totaling %15s bytes\n", commatize(out
.fileSize(), temp
));
706 // <rdar://problem/6780050> Would like linker warning to be build error.
707 if ( options
.errorBecauseOfWarnings() ) {
708 fprintf(stderr
, "ld: fatal warning(s) induced error (-fatal_warnings)\n");
712 catch (const char* msg
) {
714 fprintf(stderr
, "ld: %s for inferred architecture %s\n", msg
, archName
);
716 fprintf(stderr
, "ld: %s for architecture %s\n", msg
, archName
);
718 fprintf(stderr
, "ld: %s\n", msg
);
727 // implement assert() function to print out a backtrace before aborting
728 void __assert_rtn(const char* func
, const char* file
, int line
, const char* failedexpr
)
730 fprintf(stderr
, "Assertion failed: (%s), function %s, file %s, line %d.\n", failedexpr
, func
, file
, line
);
732 void* callStack
[128];
733 int depth
= ::backtrace(callStack
, 128);
734 char* buffer
= (char*)malloc(1024);
735 for(int i
=0; i
< depth
-1; ++i
) {
737 dladdr(callStack
[i
], &info
);
738 const char* symboName
= info
.dli_sname
;
739 if ( (symboName
!= NULL
) && (strncmp(symboName
, "_Z", 2) == 0) ) {
740 size_t bufLen
= 1024;
742 char* unmangled
= abi::__cxa_demangle(symboName
, buffer
, &bufLen
, &result
);
743 if ( unmangled
!= NULL
)
744 symboName
= unmangled
;
746 long offset
= (uintptr_t)callStack
[i
] - (uintptr_t)info
.dli_saddr
;
747 fprintf(stderr
, "%d %p %s + %ld\n", i
, callStack
[i
], symboName
, offset
);