this repo has no description
Loads of work, libmacarchive added, copyright headers...
+2309
-269
+14
-8
CMakeLists.txt
+14
-8
CMakeLists.txt
···
75
75
src/dyld/binfmt_misc.cpp
76
76
)
77
77
78
+
SET(CMAKE_INSTALL_RPATH "${CMAKE_INSTALL_PREFIX}/lib${SUFFIX}/darling")
79
+
#SET(CMAKE_EXE_LINKER_FLAGS "-Wl,--enable-new-dtags")
80
+
78
81
add_executable(dyld${SUFFIX} ${dyld_SRCS})
79
82
target_link_libraries(dyld${SUFFIX} -ldl -lpthread mach-o util)
80
83
81
-
set(fatmacho-extract_SRCS
82
-
src/dyld/extract.cpp
83
-
)
84
+
#set(fatmacho-extract_SRCS
85
+
# src/dyld/extract.cpp
86
+
#)
84
87
85
-
add_executable(fatmacho-extract ${fatmacho-extract_SRCS})
86
-
target_link_libraries(fatmacho-extract -ldl -lpthread -l:./libmach-o.so -Wl,-export-dynamic)
88
+
#add_executable(fatmacho-extract ${fatmacho-extract_SRCS})
89
+
#target_link_libraries(fatmacho-extract -ldl -lpthread -l:./libmach-o.so -Wl,-export-dynamic)
87
90
88
91
set(motool_SRCS
89
92
src/motool/motool.cpp
···
96
99
97
100
# If building on a 64bit system, only install these for 64bits
98
101
if (NOT DEFINED SUFFIX OR SUFFIX STREQUAL "64")
99
-
install(TARGETS fatmacho-extract motool DESTINATION bin)
102
+
install(TARGETS motool DESTINATION bin)
100
103
install(FILES etc/dylib.conf DESTINATION /etc/darling)
104
+
add_subdirectory(src/macbinary)
105
+
add_subdirectory(src/libmacarchive)
101
106
endif(NOT DEFINED SUFFIX OR SUFFIX STREQUAL "64")
102
107
103
-
install(TARGETS mach-o DESTINATION lib${SUFFIX})
108
+
install(TARGETS mach-o DESTINATION "lib${SUFFIX}/darling")
104
109
105
110
add_subdirectory(src/libSystem)
106
111
#add_subdirectory(src/libcxxdarwin)
107
112
add_subdirectory(src/libobjcdarwin)
108
113
#add_subdirectory(src/libunwind-darwin-gcc)
109
114
add_subdirectory(src/libncurses)
110
-
#add_subdirectory(src/CoreServices)
115
+
add_subdirectory(src/CoreSecurity)
116
+
add_subdirectory(src/thin)
111
117
112
118
add_dependencies(dyld${SUFFIX} mach-o)
113
119
add_dependencies(System.B.dylib genfuncmap)
+674
LICENSE
+674
LICENSE
···
1
+
GNU GENERAL PUBLIC LICENSE
2
+
Version 3, 29 June 2007
3
+
4
+
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
5
+
Everyone is permitted to copy and distribute verbatim copies
6
+
of this license document, but changing it is not allowed.
7
+
8
+
Preamble
9
+
10
+
The GNU General Public License is a free, copyleft license for
11
+
software and other kinds of works.
12
+
13
+
The licenses for most software and other practical works are designed
14
+
to take away your freedom to share and change the works. By contrast,
15
+
the GNU General Public License is intended to guarantee your freedom to
16
+
share and change all versions of a program--to make sure it remains free
17
+
software for all its users. We, the Free Software Foundation, use the
18
+
GNU General Public License for most of our software; it applies also to
19
+
any other work released this way by its authors. You can apply it to
20
+
your programs, too.
21
+
22
+
When we speak of free software, we are referring to freedom, not
23
+
price. Our General Public Licenses are designed to make sure that you
24
+
have the freedom to distribute copies of free software (and charge for
25
+
them if you wish), that you receive source code or can get it if you
26
+
want it, that you can change the software or use pieces of it in new
27
+
free programs, and that you know you can do these things.
28
+
29
+
To protect your rights, we need to prevent others from denying you
30
+
these rights or asking you to surrender the rights. Therefore, you have
31
+
certain responsibilities if you distribute copies of the software, or if
32
+
you modify it: responsibilities to respect the freedom of others.
33
+
34
+
For example, if you distribute copies of such a program, whether
35
+
gratis or for a fee, you must pass on to the recipients the same
36
+
freedoms that you received. You must make sure that they, too, receive
37
+
or can get the source code. And you must show them these terms so they
38
+
know their rights.
39
+
40
+
Developers that use the GNU GPL protect your rights with two steps:
41
+
(1) assert copyright on the software, and (2) offer you this License
42
+
giving you legal permission to copy, distribute and/or modify it.
43
+
44
+
For the developers' and authors' protection, the GPL clearly explains
45
+
that there is no warranty for this free software. For both users' and
46
+
authors' sake, the GPL requires that modified versions be marked as
47
+
changed, so that their problems will not be attributed erroneously to
48
+
authors of previous versions.
49
+
50
+
Some devices are designed to deny users access to install or run
51
+
modified versions of the software inside them, although the manufacturer
52
+
can do so. This is fundamentally incompatible with the aim of
53
+
protecting users' freedom to change the software. The systematic
54
+
pattern of such abuse occurs in the area of products for individuals to
55
+
use, which is precisely where it is most unacceptable. Therefore, we
56
+
have designed this version of the GPL to prohibit the practice for those
57
+
products. If such problems arise substantially in other domains, we
58
+
stand ready to extend this provision to those domains in future versions
59
+
of the GPL, as needed to protect the freedom of users.
60
+
61
+
Finally, every program is threatened constantly by software patents.
62
+
States should not allow patents to restrict development and use of
63
+
software on general-purpose computers, but in those that do, we wish to
64
+
avoid the special danger that patents applied to a free program could
65
+
make it effectively proprietary. To prevent this, the GPL assures that
66
+
patents cannot be used to render the program non-free.
67
+
68
+
The precise terms and conditions for copying, distribution and
69
+
modification follow.
70
+
71
+
TERMS AND CONDITIONS
72
+
73
+
0. Definitions.
74
+
75
+
"This License" refers to version 3 of the GNU General Public License.
76
+
77
+
"Copyright" also means copyright-like laws that apply to other kinds of
78
+
works, such as semiconductor masks.
79
+
80
+
"The Program" refers to any copyrightable work licensed under this
81
+
License. Each licensee is addressed as "you". "Licensees" and
82
+
"recipients" may be individuals or organizations.
83
+
84
+
To "modify" a work means to copy from or adapt all or part of the work
85
+
in a fashion requiring copyright permission, other than the making of an
86
+
exact copy. The resulting work is called a "modified version" of the
87
+
earlier work or a work "based on" the earlier work.
88
+
89
+
A "covered work" means either the unmodified Program or a work based
90
+
on the Program.
91
+
92
+
To "propagate" a work means to do anything with it that, without
93
+
permission, would make you directly or secondarily liable for
94
+
infringement under applicable copyright law, except executing it on a
95
+
computer or modifying a private copy. Propagation includes copying,
96
+
distribution (with or without modification), making available to the
97
+
public, and in some countries other activities as well.
98
+
99
+
To "convey" a work means any kind of propagation that enables other
100
+
parties to make or receive copies. Mere interaction with a user through
101
+
a computer network, with no transfer of a copy, is not conveying.
102
+
103
+
An interactive user interface displays "Appropriate Legal Notices"
104
+
to the extent that it includes a convenient and prominently visible
105
+
feature that (1) displays an appropriate copyright notice, and (2)
106
+
tells the user that there is no warranty for the work (except to the
107
+
extent that warranties are provided), that licensees may convey the
108
+
work under this License, and how to view a copy of this License. If
109
+
the interface presents a list of user commands or options, such as a
110
+
menu, a prominent item in the list meets this criterion.
111
+
112
+
1. Source Code.
113
+
114
+
The "source code" for a work means the preferred form of the work
115
+
for making modifications to it. "Object code" means any non-source
116
+
form of a work.
117
+
118
+
A "Standard Interface" means an interface that either is an official
119
+
standard defined by a recognized standards body, or, in the case of
120
+
interfaces specified for a particular programming language, one that
121
+
is widely used among developers working in that language.
122
+
123
+
The "System Libraries" of an executable work include anything, other
124
+
than the work as a whole, that (a) is included in the normal form of
125
+
packaging a Major Component, but which is not part of that Major
126
+
Component, and (b) serves only to enable use of the work with that
127
+
Major Component, or to implement a Standard Interface for which an
128
+
implementation is available to the public in source code form. A
129
+
"Major Component", in this context, means a major essential component
130
+
(kernel, window system, and so on) of the specific operating system
131
+
(if any) on which the executable work runs, or a compiler used to
132
+
produce the work, or an object code interpreter used to run it.
133
+
134
+
The "Corresponding Source" for a work in object code form means all
135
+
the source code needed to generate, install, and (for an executable
136
+
work) run the object code and to modify the work, including scripts to
137
+
control those activities. However, it does not include the work's
138
+
System Libraries, or general-purpose tools or generally available free
139
+
programs which are used unmodified in performing those activities but
140
+
which are not part of the work. For example, Corresponding Source
141
+
includes interface definition files associated with source files for
142
+
the work, and the source code for shared libraries and dynamically
143
+
linked subprograms that the work is specifically designed to require,
144
+
such as by intimate data communication or control flow between those
145
+
subprograms and other parts of the work.
146
+
147
+
The Corresponding Source need not include anything that users
148
+
can regenerate automatically from other parts of the Corresponding
149
+
Source.
150
+
151
+
The Corresponding Source for a work in source code form is that
152
+
same work.
153
+
154
+
2. Basic Permissions.
155
+
156
+
All rights granted under this License are granted for the term of
157
+
copyright on the Program, and are irrevocable provided the stated
158
+
conditions are met. This License explicitly affirms your unlimited
159
+
permission to run the unmodified Program. The output from running a
160
+
covered work is covered by this License only if the output, given its
161
+
content, constitutes a covered work. This License acknowledges your
162
+
rights of fair use or other equivalent, as provided by copyright law.
163
+
164
+
You may make, run and propagate covered works that you do not
165
+
convey, without conditions so long as your license otherwise remains
166
+
in force. You may convey covered works to others for the sole purpose
167
+
of having them make modifications exclusively for you, or provide you
168
+
with facilities for running those works, provided that you comply with
169
+
the terms of this License in conveying all material for which you do
170
+
not control copyright. Those thus making or running the covered works
171
+
for you must do so exclusively on your behalf, under your direction
172
+
and control, on terms that prohibit them from making any copies of
173
+
your copyrighted material outside their relationship with you.
174
+
175
+
Conveying under any other circumstances is permitted solely under
176
+
the conditions stated below. Sublicensing is not allowed; section 10
177
+
makes it unnecessary.
178
+
179
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180
+
181
+
No covered work shall be deemed part of an effective technological
182
+
measure under any applicable law fulfilling obligations under article
183
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
184
+
similar laws prohibiting or restricting circumvention of such
185
+
measures.
186
+
187
+
When you convey a covered work, you waive any legal power to forbid
188
+
circumvention of technological measures to the extent such circumvention
189
+
is effected by exercising rights under this License with respect to
190
+
the covered work, and you disclaim any intention to limit operation or
191
+
modification of the work as a means of enforcing, against the work's
192
+
users, your or third parties' legal rights to forbid circumvention of
193
+
technological measures.
194
+
195
+
4. Conveying Verbatim Copies.
196
+
197
+
You may convey verbatim copies of the Program's source code as you
198
+
receive it, in any medium, provided that you conspicuously and
199
+
appropriately publish on each copy an appropriate copyright notice;
200
+
keep intact all notices stating that this License and any
201
+
non-permissive terms added in accord with section 7 apply to the code;
202
+
keep intact all notices of the absence of any warranty; and give all
203
+
recipients a copy of this License along with the Program.
204
+
205
+
You may charge any price or no price for each copy that you convey,
206
+
and you may offer support or warranty protection for a fee.
207
+
208
+
5. Conveying Modified Source Versions.
209
+
210
+
You may convey a work based on the Program, or the modifications to
211
+
produce it from the Program, in the form of source code under the
212
+
terms of section 4, provided that you also meet all of these conditions:
213
+
214
+
a) The work must carry prominent notices stating that you modified
215
+
it, and giving a relevant date.
216
+
217
+
b) The work must carry prominent notices stating that it is
218
+
released under this License and any conditions added under section
219
+
7. This requirement modifies the requirement in section 4 to
220
+
"keep intact all notices".
221
+
222
+
c) You must license the entire work, as a whole, under this
223
+
License to anyone who comes into possession of a copy. This
224
+
License will therefore apply, along with any applicable section 7
225
+
additional terms, to the whole of the work, and all its parts,
226
+
regardless of how they are packaged. This License gives no
227
+
permission to license the work in any other way, but it does not
228
+
invalidate such permission if you have separately received it.
229
+
230
+
d) If the work has interactive user interfaces, each must display
231
+
Appropriate Legal Notices; however, if the Program has interactive
232
+
interfaces that do not display Appropriate Legal Notices, your
233
+
work need not make them do so.
234
+
235
+
A compilation of a covered work with other separate and independent
236
+
works, which are not by their nature extensions of the covered work,
237
+
and which are not combined with it such as to form a larger program,
238
+
in or on a volume of a storage or distribution medium, is called an
239
+
"aggregate" if the compilation and its resulting copyright are not
240
+
used to limit the access or legal rights of the compilation's users
241
+
beyond what the individual works permit. Inclusion of a covered work
242
+
in an aggregate does not cause this License to apply to the other
243
+
parts of the aggregate.
244
+
245
+
6. Conveying Non-Source Forms.
246
+
247
+
You may convey a covered work in object code form under the terms
248
+
of sections 4 and 5, provided that you also convey the
249
+
machine-readable Corresponding Source under the terms of this License,
250
+
in one of these ways:
251
+
252
+
a) Convey the object code in, or embodied in, a physical product
253
+
(including a physical distribution medium), accompanied by the
254
+
Corresponding Source fixed on a durable physical medium
255
+
customarily used for software interchange.
256
+
257
+
b) Convey the object code in, or embodied in, a physical product
258
+
(including a physical distribution medium), accompanied by a
259
+
written offer, valid for at least three years and valid for as
260
+
long as you offer spare parts or customer support for that product
261
+
model, to give anyone who possesses the object code either (1) a
262
+
copy of the Corresponding Source for all the software in the
263
+
product that is covered by this License, on a durable physical
264
+
medium customarily used for software interchange, for a price no
265
+
more than your reasonable cost of physically performing this
266
+
conveying of source, or (2) access to copy the
267
+
Corresponding Source from a network server at no charge.
268
+
269
+
c) Convey individual copies of the object code with a copy of the
270
+
written offer to provide the Corresponding Source. This
271
+
alternative is allowed only occasionally and noncommercially, and
272
+
only if you received the object code with such an offer, in accord
273
+
with subsection 6b.
274
+
275
+
d) Convey the object code by offering access from a designated
276
+
place (gratis or for a charge), and offer equivalent access to the
277
+
Corresponding Source in the same way through the same place at no
278
+
further charge. You need not require recipients to copy the
279
+
Corresponding Source along with the object code. If the place to
280
+
copy the object code is a network server, the Corresponding Source
281
+
may be on a different server (operated by you or a third party)
282
+
that supports equivalent copying facilities, provided you maintain
283
+
clear directions next to the object code saying where to find the
284
+
Corresponding Source. Regardless of what server hosts the
285
+
Corresponding Source, you remain obligated to ensure that it is
286
+
available for as long as needed to satisfy these requirements.
287
+
288
+
e) Convey the object code using peer-to-peer transmission, provided
289
+
you inform other peers where the object code and Corresponding
290
+
Source of the work are being offered to the general public at no
291
+
charge under subsection 6d.
292
+
293
+
A separable portion of the object code, whose source code is excluded
294
+
from the Corresponding Source as a System Library, need not be
295
+
included in conveying the object code work.
296
+
297
+
A "User Product" is either (1) a "consumer product", which means any
298
+
tangible personal property which is normally used for personal, family,
299
+
or household purposes, or (2) anything designed or sold for incorporation
300
+
into a dwelling. In determining whether a product is a consumer product,
301
+
doubtful cases shall be resolved in favor of coverage. For a particular
302
+
product received by a particular user, "normally used" refers to a
303
+
typical or common use of that class of product, regardless of the status
304
+
of the particular user or of the way in which the particular user
305
+
actually uses, or expects or is expected to use, the product. A product
306
+
is a consumer product regardless of whether the product has substantial
307
+
commercial, industrial or non-consumer uses, unless such uses represent
308
+
the only significant mode of use of the product.
309
+
310
+
"Installation Information" for a User Product means any methods,
311
+
procedures, authorization keys, or other information required to install
312
+
and execute modified versions of a covered work in that User Product from
313
+
a modified version of its Corresponding Source. The information must
314
+
suffice to ensure that the continued functioning of the modified object
315
+
code is in no case prevented or interfered with solely because
316
+
modification has been made.
317
+
318
+
If you convey an object code work under this section in, or with, or
319
+
specifically for use in, a User Product, and the conveying occurs as
320
+
part of a transaction in which the right of possession and use of the
321
+
User Product is transferred to the recipient in perpetuity or for a
322
+
fixed term (regardless of how the transaction is characterized), the
323
+
Corresponding Source conveyed under this section must be accompanied
324
+
by the Installation Information. But this requirement does not apply
325
+
if neither you nor any third party retains the ability to install
326
+
modified object code on the User Product (for example, the work has
327
+
been installed in ROM).
328
+
329
+
The requirement to provide Installation Information does not include a
330
+
requirement to continue to provide support service, warranty, or updates
331
+
for a work that has been modified or installed by the recipient, or for
332
+
the User Product in which it has been modified or installed. Access to a
333
+
network may be denied when the modification itself materially and
334
+
adversely affects the operation of the network or violates the rules and
335
+
protocols for communication across the network.
336
+
337
+
Corresponding Source conveyed, and Installation Information provided,
338
+
in accord with this section must be in a format that is publicly
339
+
documented (and with an implementation available to the public in
340
+
source code form), and must require no special password or key for
341
+
unpacking, reading or copying.
342
+
343
+
7. Additional Terms.
344
+
345
+
"Additional permissions" are terms that supplement the terms of this
346
+
License by making exceptions from one or more of its conditions.
347
+
Additional permissions that are applicable to the entire Program shall
348
+
be treated as though they were included in this License, to the extent
349
+
that they are valid under applicable law. If additional permissions
350
+
apply only to part of the Program, that part may be used separately
351
+
under those permissions, but the entire Program remains governed by
352
+
this License without regard to the additional permissions.
353
+
354
+
When you convey a copy of a covered work, you may at your option
355
+
remove any additional permissions from that copy, or from any part of
356
+
it. (Additional permissions may be written to require their own
357
+
removal in certain cases when you modify the work.) You may place
358
+
additional permissions on material, added by you to a covered work,
359
+
for which you have or can give appropriate copyright permission.
360
+
361
+
Notwithstanding any other provision of this License, for material you
362
+
add to a covered work, you may (if authorized by the copyright holders of
363
+
that material) supplement the terms of this License with terms:
364
+
365
+
a) Disclaiming warranty or limiting liability differently from the
366
+
terms of sections 15 and 16 of this License; or
367
+
368
+
b) Requiring preservation of specified reasonable legal notices or
369
+
author attributions in that material or in the Appropriate Legal
370
+
Notices displayed by works containing it; or
371
+
372
+
c) Prohibiting misrepresentation of the origin of that material, or
373
+
requiring that modified versions of such material be marked in
374
+
reasonable ways as different from the original version; or
375
+
376
+
d) Limiting the use for publicity purposes of names of licensors or
377
+
authors of the material; or
378
+
379
+
e) Declining to grant rights under trademark law for use of some
380
+
trade names, trademarks, or service marks; or
381
+
382
+
f) Requiring indemnification of licensors and authors of that
383
+
material by anyone who conveys the material (or modified versions of
384
+
it) with contractual assumptions of liability to the recipient, for
385
+
any liability that these contractual assumptions directly impose on
386
+
those licensors and authors.
387
+
388
+
All other non-permissive additional terms are considered "further
389
+
restrictions" within the meaning of section 10. If the Program as you
390
+
received it, or any part of it, contains a notice stating that it is
391
+
governed by this License along with a term that is a further
392
+
restriction, you may remove that term. If a license document contains
393
+
a further restriction but permits relicensing or conveying under this
394
+
License, you may add to a covered work material governed by the terms
395
+
of that license document, provided that the further restriction does
396
+
not survive such relicensing or conveying.
397
+
398
+
If you add terms to a covered work in accord with this section, you
399
+
must place, in the relevant source files, a statement of the
400
+
additional terms that apply to those files, or a notice indicating
401
+
where to find the applicable terms.
402
+
403
+
Additional terms, permissive or non-permissive, may be stated in the
404
+
form of a separately written license, or stated as exceptions;
405
+
the above requirements apply either way.
406
+
407
+
8. Termination.
408
+
409
+
You may not propagate or modify a covered work except as expressly
410
+
provided under this License. Any attempt otherwise to propagate or
411
+
modify it is void, and will automatically terminate your rights under
412
+
this License (including any patent licenses granted under the third
413
+
paragraph of section 11).
414
+
415
+
However, if you cease all violation of this License, then your
416
+
license from a particular copyright holder is reinstated (a)
417
+
provisionally, unless and until the copyright holder explicitly and
418
+
finally terminates your license, and (b) permanently, if the copyright
419
+
holder fails to notify you of the violation by some reasonable means
420
+
prior to 60 days after the cessation.
421
+
422
+
Moreover, your license from a particular copyright holder is
423
+
reinstated permanently if the copyright holder notifies you of the
424
+
violation by some reasonable means, this is the first time you have
425
+
received notice of violation of this License (for any work) from that
426
+
copyright holder, and you cure the violation prior to 30 days after
427
+
your receipt of the notice.
428
+
429
+
Termination of your rights under this section does not terminate the
430
+
licenses of parties who have received copies or rights from you under
431
+
this License. If your rights have been terminated and not permanently
432
+
reinstated, you do not qualify to receive new licenses for the same
433
+
material under section 10.
434
+
435
+
9. Acceptance Not Required for Having Copies.
436
+
437
+
You are not required to accept this License in order to receive or
438
+
run a copy of the Program. Ancillary propagation of a covered work
439
+
occurring solely as a consequence of using peer-to-peer transmission
440
+
to receive a copy likewise does not require acceptance. However,
441
+
nothing other than this License grants you permission to propagate or
442
+
modify any covered work. These actions infringe copyright if you do
443
+
not accept this License. Therefore, by modifying or propagating a
444
+
covered work, you indicate your acceptance of this License to do so.
445
+
446
+
10. Automatic Licensing of Downstream Recipients.
447
+
448
+
Each time you convey a covered work, the recipient automatically
449
+
receives a license from the original licensors, to run, modify and
450
+
propagate that work, subject to this License. You are not responsible
451
+
for enforcing compliance by third parties with this License.
452
+
453
+
An "entity transaction" is a transaction transferring control of an
454
+
organization, or substantially all assets of one, or subdividing an
455
+
organization, or merging organizations. If propagation of a covered
456
+
work results from an entity transaction, each party to that
457
+
transaction who receives a copy of the work also receives whatever
458
+
licenses to the work the party's predecessor in interest had or could
459
+
give under the previous paragraph, plus a right to possession of the
460
+
Corresponding Source of the work from the predecessor in interest, if
461
+
the predecessor has it or can get it with reasonable efforts.
462
+
463
+
You may not impose any further restrictions on the exercise of the
464
+
rights granted or affirmed under this License. For example, you may
465
+
not impose a license fee, royalty, or other charge for exercise of
466
+
rights granted under this License, and you may not initiate litigation
467
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
468
+
any patent claim is infringed by making, using, selling, offering for
469
+
sale, or importing the Program or any portion of it.
470
+
471
+
11. Patents.
472
+
473
+
A "contributor" is a copyright holder who authorizes use under this
474
+
License of the Program or a work on which the Program is based. The
475
+
work thus licensed is called the contributor's "contributor version".
476
+
477
+
A contributor's "essential patent claims" are all patent claims
478
+
owned or controlled by the contributor, whether already acquired or
479
+
hereafter acquired, that would be infringed by some manner, permitted
480
+
by this License, of making, using, or selling its contributor version,
481
+
but do not include claims that would be infringed only as a
482
+
consequence of further modification of the contributor version. For
483
+
purposes of this definition, "control" includes the right to grant
484
+
patent sublicenses in a manner consistent with the requirements of
485
+
this License.
486
+
487
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
488
+
patent license under the contributor's essential patent claims, to
489
+
make, use, sell, offer for sale, import and otherwise run, modify and
490
+
propagate the contents of its contributor version.
491
+
492
+
In the following three paragraphs, a "patent license" is any express
493
+
agreement or commitment, however denominated, not to enforce a patent
494
+
(such as an express permission to practice a patent or covenant not to
495
+
sue for patent infringement). To "grant" such a patent license to a
496
+
party means to make such an agreement or commitment not to enforce a
497
+
patent against the party.
498
+
499
+
If you convey a covered work, knowingly relying on a patent license,
500
+
and the Corresponding Source of the work is not available for anyone
501
+
to copy, free of charge and under the terms of this License, through a
502
+
publicly available network server or other readily accessible means,
503
+
then you must either (1) cause the Corresponding Source to be so
504
+
available, or (2) arrange to deprive yourself of the benefit of the
505
+
patent license for this particular work, or (3) arrange, in a manner
506
+
consistent with the requirements of this License, to extend the patent
507
+
license to downstream recipients. "Knowingly relying" means you have
508
+
actual knowledge that, but for the patent license, your conveying the
509
+
covered work in a country, or your recipient's use of the covered work
510
+
in a country, would infringe one or more identifiable patents in that
511
+
country that you have reason to believe are valid.
512
+
513
+
If, pursuant to or in connection with a single transaction or
514
+
arrangement, you convey, or propagate by procuring conveyance of, a
515
+
covered work, and grant a patent license to some of the parties
516
+
receiving the covered work authorizing them to use, propagate, modify
517
+
or convey a specific copy of the covered work, then the patent license
518
+
you grant is automatically extended to all recipients of the covered
519
+
work and works based on it.
520
+
521
+
A patent license is "discriminatory" if it does not include within
522
+
the scope of its coverage, prohibits the exercise of, or is
523
+
conditioned on the non-exercise of one or more of the rights that are
524
+
specifically granted under this License. You may not convey a covered
525
+
work if you are a party to an arrangement with a third party that is
526
+
in the business of distributing software, under which you make payment
527
+
to the third party based on the extent of your activity of conveying
528
+
the work, and under which the third party grants, to any of the
529
+
parties who would receive the covered work from you, a discriminatory
530
+
patent license (a) in connection with copies of the covered work
531
+
conveyed by you (or copies made from those copies), or (b) primarily
532
+
for and in connection with specific products or compilations that
533
+
contain the covered work, unless you entered into that arrangement,
534
+
or that patent license was granted, prior to 28 March 2007.
535
+
536
+
Nothing in this License shall be construed as excluding or limiting
537
+
any implied license or other defenses to infringement that may
538
+
otherwise be available to you under applicable patent law.
539
+
540
+
12. No Surrender of Others' Freedom.
541
+
542
+
If conditions are imposed on you (whether by court order, agreement or
543
+
otherwise) that contradict the conditions of this License, they do not
544
+
excuse you from the conditions of this License. If you cannot convey a
545
+
covered work so as to satisfy simultaneously your obligations under this
546
+
License and any other pertinent obligations, then as a consequence you may
547
+
not convey it at all. For example, if you agree to terms that obligate you
548
+
to collect a royalty for further conveying from those to whom you convey
549
+
the Program, the only way you could satisfy both those terms and this
550
+
License would be to refrain entirely from conveying the Program.
551
+
552
+
13. Use with the GNU Affero General Public License.
553
+
554
+
Notwithstanding any other provision of this License, you have
555
+
permission to link or combine any covered work with a work licensed
556
+
under version 3 of the GNU Affero General Public License into a single
557
+
combined work, and to convey the resulting work. The terms of this
558
+
License will continue to apply to the part which is the covered work,
559
+
but the special requirements of the GNU Affero General Public License,
560
+
section 13, concerning interaction through a network will apply to the
561
+
combination as such.
562
+
563
+
14. Revised Versions of this License.
564
+
565
+
The Free Software Foundation may publish revised and/or new versions of
566
+
the GNU General Public License from time to time. Such new versions will
567
+
be similar in spirit to the present version, but may differ in detail to
568
+
address new problems or concerns.
569
+
570
+
Each version is given a distinguishing version number. If the
571
+
Program specifies that a certain numbered version of the GNU General
572
+
Public License "or any later version" applies to it, you have the
573
+
option of following the terms and conditions either of that numbered
574
+
version or of any later version published by the Free Software
575
+
Foundation. If the Program does not specify a version number of the
576
+
GNU General Public License, you may choose any version ever published
577
+
by the Free Software Foundation.
578
+
579
+
If the Program specifies that a proxy can decide which future
580
+
versions of the GNU General Public License can be used, that proxy's
581
+
public statement of acceptance of a version permanently authorizes you
582
+
to choose that version for the Program.
583
+
584
+
Later license versions may give you additional or different
585
+
permissions. However, no additional obligations are imposed on any
586
+
author or copyright holder as a result of your choosing to follow a
587
+
later version.
588
+
589
+
15. Disclaimer of Warranty.
590
+
591
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599
+
600
+
16. Limitation of Liability.
601
+
602
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610
+
SUCH DAMAGES.
611
+
612
+
17. Interpretation of Sections 15 and 16.
613
+
614
+
If the disclaimer of warranty and limitation of liability provided
615
+
above cannot be given local legal effect according to their terms,
616
+
reviewing courts shall apply local law that most closely approximates
617
+
an absolute waiver of all civil liability in connection with the
618
+
Program, unless a warranty or assumption of liability accompanies a
619
+
copy of the Program in return for a fee.
620
+
621
+
END OF TERMS AND CONDITIONS
622
+
623
+
How to Apply These Terms to Your New Programs
624
+
625
+
If you develop a new program, and you want it to be of the greatest
626
+
possible use to the public, the best way to achieve this is to make it
627
+
free software which everyone can redistribute and change under these terms.
628
+
629
+
To do so, attach the following notices to the program. It is safest
630
+
to attach them to the start of each source file to most effectively
631
+
state the exclusion of warranty; and each file should have at least
632
+
the "copyright" line and a pointer to where the full notice is found.
633
+
634
+
<one line to give the program's name and a brief idea of what it does.>
635
+
Copyright (C) <year> <name of author>
636
+
637
+
This program is free software: you can redistribute it and/or modify
638
+
it under the terms of the GNU General Public License as published by
639
+
the Free Software Foundation, either version 3 of the License, or
640
+
(at your option) any later version.
641
+
642
+
This program is distributed in the hope that it will be useful,
643
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
644
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645
+
GNU General Public License for more details.
646
+
647
+
You should have received a copy of the GNU General Public License
648
+
along with this program. If not, see <http://www.gnu.org/licenses/>.
649
+
650
+
Also add information on how to contact you by electronic and paper mail.
651
+
652
+
If the program does terminal interaction, make it output a short
653
+
notice like this when it starts in an interactive mode:
654
+
655
+
<program> Copyright (C) <year> <name of author>
656
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657
+
This is free software, and you are welcome to redistribute it
658
+
under certain conditions; type `show c' for details.
659
+
660
+
The hypothetical commands `show w' and `show c' should show the appropriate
661
+
parts of the General Public License. Of course, your program's commands
662
+
might be different; for a GUI interface, you would use an "about box".
663
+
664
+
You should also get your employer (if you work as a programmer) or school,
665
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
666
+
For more information on this, and how to apply and follow the GNU GPL, see
667
+
<http://www.gnu.org/licenses/>.
668
+
669
+
The GNU General Public License does not permit incorporating your program
670
+
into proprietary programs. If your program is a subroutine library, you
671
+
may consider it more useful to permit linking proprietary applications with
672
+
the library. If this is what you want to do, use the GNU Lesser General
673
+
Public License instead of this License. But first, please read
674
+
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+9
-5
etc/dylib.conf
+9
-5
etc/dylib.conf
···
3
3
libiconv.2.dylib=libSystem.B.dylib.so
4
4
libstdc++.6.dylib=libSystem.B.dylib.so
5
5
#libncurses.5.4.dylib=libncurses.so.5
6
-
/System/Library/Frameworks/CoreFoundation.framework/Versions/A/CoreFoundation=libCoreFoundation.so
7
-
/System/Library/Frameworks/CoreServices.framework/Versions/A/CoreServices=libgnustep-base.so
8
-
/System/Library/Frameworks/Foundation.framework/Versions/C/Foundation=libgnustep-base.so
9
-
/System/Library/Frameworks/AppKit.framework/Versions/C/AppKit=libgnustep-gui.so
10
-
6
+
#/System/Library/Frameworks/CoreFoundation.framework/Versions/A/CoreFoundation=libCoreFoundation.so
7
+
#/System/Library/Frameworks/CoreFoundation.framework/Versions/A/CoreFoundation=libgnustep-corebase.so
8
+
/System/Library/Frameworks/CoreServices.framework/Versions/A/CoreServices=/dev/null
9
+
/System/Library/Frameworks/Foundation.framework/Versions/C/Foundation=libobjc.A.dylib.so
10
+
/System/Library/Frameworks/AppKit.framework/Versions/C/AppKit=libAppKit.so
11
+
/System/Library/Frameworks/Cocoa.framework/Versions/A/Cocoa=libCocoa.so
12
+
/System/Library/Frameworks/IOKit.framework/Versions/A/IOKit=/dev/null
13
+
/System/Library/Frameworks/Security.framework/Versions/A/Security=libCoreSecurity.so
14
+
/System/Library/Frameworks/ApplicationServices.framework/Versions/A/ApplicationServices=/dev/null
11
15
+19
src/dyld/FileMap.cpp
+19
src/dyld/FileMap.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
Copyright (C) 2011 Shinichiro Hamaji
6
+
7
+
Darling is free software: you can redistribute it and/or modify
8
+
it under the terms of the GNU 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
+
Darling 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 General Public License for more details.
16
+
17
+
You should have received a copy of the GNU General Public License
18
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
19
+
*/
1
20
2
21
#include "FileMap.h"
3
22
#include <cassert>
+19
src/dyld/FileMap.h
+19
src/dyld/FileMap.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
Copyright (C) 2011 Shinichiro Hamaji
6
+
7
+
Darling is free software: you can redistribute it and/or modify
8
+
it under the terms of the GNU 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
+
Darling 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 General Public License for more details.
16
+
17
+
You should have received a copy of the GNU General Public License
18
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
19
+
*/
1
20
2
21
#ifndef FILEMAP_H
3
22
#define FILEMAP_H
+21
-1
src/dyld/MachOLoader.cpp
+21
-1
src/dyld/MachOLoader.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
Copyright (C) 2011 Shinichiro Hamaji
6
+
7
+
Darling is free software: you can redistribute it and/or modify
8
+
it under the terms of the GNU 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
+
Darling 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 General Public License for more details.
16
+
17
+
You should have received a copy of the GNU General Public License
18
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
19
+
*/
20
+
1
21
#include "config.h"
2
22
#include "MachOLoader.h"
3
23
#include "MachO.h"
···
209
229
}
210
230
211
231
if (mach.get_eh_frame().first)
212
-
__register_frame(reinterpret_cast<void*>(mach.get_eh_frame().first));
232
+
__register_frame(reinterpret_cast<void*>(mach.get_eh_frame().first + *slide));
213
233
}
214
234
215
235
void MachOLoader::checkMmapMinAddr(intptr addr)
+20
src/dyld/MachOLoader.h
+20
src/dyld/MachOLoader.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
Copyright (C) 2011 Shinichiro Hamaji
6
+
7
+
Darling is free software: you can redistribute it and/or modify
8
+
it under the terms of the GNU 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
+
Darling 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 General Public License for more details.
16
+
17
+
You should have received a copy of the GNU General Public License
18
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
19
+
*/
20
+
1
21
#ifndef MACHOLOADER_H
2
22
#define MACHOLOADER_H
3
23
#include <vector>
-30
src/dyld/Timer.cpp
-30
src/dyld/Timer.cpp
···
1
-
#include "Timer.h"
2
-
3
-
Timer g_timer;
4
-
5
-
static void initGlobalTimer() __attribute__((constructor));
6
-
7
-
Timer::Timer()
8
-
: start_time(0)
9
-
{
10
-
}
11
-
12
-
void Timer::start()
13
-
{
14
-
if (FLAGS_PRINT_TIME)
15
-
start_time = clock();
16
-
}
17
-
18
-
void Timer::print(const char* name)
19
-
{
20
-
if (FLAGS_PRINT_TIME)
21
-
{
22
-
double elapsed = ((double)clock() - start_time) / CLOCKS_PER_SEC;
23
-
printf("Elapsed time (%s): %f sec\n", name, elapsed);
24
-
}
25
-
}
26
-
27
-
void initGlobalTimer()
28
-
{
29
-
g_timer.start();
30
-
}
-17
src/dyld/Timer.h
-17
src/dyld/Timer.h
+61
-11
src/dyld/Trampoline.cpp
+61
-11
src/dyld/Trampoline.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#include "Trampoline.h"
2
21
#include <unistd.h>
3
22
#include <sys/mman.h>
···
8
27
#include <fstream>
9
28
#include <sstream>
10
29
#include <stack>
30
+
#include <cxxabi.h>
31
+
#include "../util/log.h"
11
32
12
33
TrampolineMgr* TrampolineMgr::m_pInstance = 0;
13
34
std::map<std::string, TrampolineMgr::FunctionInfo> TrampolineMgr::m_functionInfo;
···
68
89
if ((targetAddr > m_pMem && targetAddr < m_pMem+m_nMax) || !isExecutable(targetAddr))
69
90
return targetAddr; // will not create a trampoline for a trampoline
70
91
71
-
AddrEntry e = { name, targetAddr };
92
+
AddrEntry e = { name, name, targetAddr };
72
93
if (m_nNext >= m_nMax)
73
94
throw std::runtime_error("TrampolineMgr buffer full");
95
+
96
+
//std::cout << e.name << std::endl;
97
+
if (e.name.compare(0, 2, "_Z") == 0)
98
+
{
99
+
int status;
100
+
char* n = abi::__cxa_demangle(e.name.c_str(), 0, 0, &status);
101
+
102
+
//std::cout << n << std::endl;
103
+
104
+
if (n)
105
+
{
106
+
e.printName = n;
107
+
e.printName += " - ";
108
+
e.printName += e.name;
109
+
free(n);
110
+
}
111
+
}
74
112
75
113
m_entries.push_back(e);
76
114
m_pMem[m_nNext].init(m_nNext, TrampolineMgr::printInfo, TrampolineMgr::printInfoR);
···
96
134
return false;
97
135
}
98
136
137
+
std::string TrampolineMgr::inFile(void* addr)
138
+
{
139
+
for (auto it = m_memoryMap.begin(); it != m_memoryMap.end(); it++)
140
+
{
141
+
if (addr >= it->start && addr < it->end)
142
+
return it->file;
143
+
}
144
+
return "?";
145
+
}
146
+
99
147
void TrampolineMgr::invalidateMemoryMap()
100
148
{
101
149
m_memoryMap.clear();
···
116
164
s++;
117
165
pages.end = (void*) strtol(s, (char**) &s, 16);
118
166
pages.executable = (*(s+3) == 'x') && (*(s+2) == '-'); // not writable
167
+
168
+
if (line.size() > 74)
169
+
pages.file = line.substr(73);
119
170
120
171
//std::cout << line << " -> " << pages.start << " - " << pages.end << " " << pages.executable << std::endl;
121
172
m_memoryMap.push_back(pages);
···
231
282
void* TrampolineMgr::printInfo(uint32_t index, CallStack* stack)
232
283
{
233
284
FunctionInfo* info = 0;
234
-
const std::string& name = m_pInstance->m_entries[index].name;
235
-
auto it = m_functionInfo.find(name);
285
+
const AddrEntry& e = m_pInstance->m_entries[index];
286
+
auto it = m_functionInfo.find(e.name);
236
287
std::ostream* out;
237
288
ReturnInfo retInfo;
238
289
···
251
302
ArgumentWalker w(stack);
252
303
bool first = true;
253
304
254
-
(*out) << name << '(';
305
+
(*out) << e.printName << '(';
255
306
256
307
for (char c : it->second.arguments)
257
308
{
···
262
313
263
314
(*out) << w.next(c);
264
315
}
265
-
(*out) << ")\n" << std::flush;
316
+
(*out) << ") ";
266
317
}
267
318
else
268
-
(*out) << m_pInstance->m_entries[index].name << "(?)\n" << std::flush;
319
+
(*out) << e.printName << "(?) ";
320
+
(*out) << "ret_ip=" << stack->retAddr /*<< '(' << m_pInstance->inFile(stack->retAddr) << ')'*/ << std::endl << std::flush;
269
321
270
322
retInfo.retAddr = stack->retAddr;
271
323
gettimeofday(&retInfo.callTime, 0);
···
290
342
(*out) << '[' << stamp << "] ";
291
343
(*out) << std::string(g_returnInfo->size(), ' ');
292
344
345
+
ArgumentWalker w(stack);
293
346
if (it != m_functionInfo.end())
294
-
{
295
-
ArgumentWalker w(stack);
296
347
(*out) << "-> " << w.ret(it->second.retType);
297
-
}
298
348
else
299
-
(*out) << "-> ?";
349
+
(*out) << "-> ? (" << w.ret('p') << ')';
300
350
301
-
(*out) << " {" << callTime() << "}\n" << std::flush;
351
+
(*out) << " {" << callTime() << "} errno=" << errno << std::endl << std::flush;
302
352
303
353
g_returnInfo->pop();
304
354
+22
-1
src/dyld/Trampoline.h
+22
-1
src/dyld/Trampoline.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#ifndef TRAMPOLINE_H
2
21
#define TRAMPOLINE_H
3
22
#include <stdint.h>
···
18
37
19
38
void* generate(void* targetAddr, const char* name);
20
39
bool isExecutable(void* targetAddr);
40
+
std::string inFile(void* addr);
21
41
void invalidateMemoryMap();
22
42
23
43
static void loadFunctionInfo(const char* path);
···
61
81
private:
62
82
struct AddrEntry
63
83
{
64
-
std::string name;
84
+
std::string name, printName;
65
85
void* addr;
66
86
};
67
87
struct MemoryPages
···
69
89
void* start;
70
90
void* end;
71
91
bool executable;
92
+
std::string file;
72
93
73
94
bool operator<(const MemoryPages& o) { return start < o.start; }
74
95
bool operator<(void* p) { return start < p; }
+19
src/dyld/UndefinedFunction.cpp
+19
src/dyld/UndefinedFunction.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#include "UndefinedFunction.h"
2
21
#include <unistd.h>
3
22
#include <sys/mman.h>
+19
src/dyld/UndefinedFunction.h
+19
src/dyld/UndefinedFunction.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#ifndef UNDEFINEDFUNCTION_H
2
21
#define UNDEFINEDFUNCTION_H
3
22
#include <cstdio>
+19
src/dyld/binfmt_misc.cpp
+19
src/dyld/binfmt_misc.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#include "binfmt_misc.h"
2
21
#include <fstream>
3
22
#include <stdexcept>
+19
src/dyld/binfmt_misc.h
+19
src/dyld/binfmt_misc.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#ifndef BINFMTMISC_H
2
21
#define BINFMTMISC_H
3
22
+20
src/dyld/dyld.cpp
+20
src/dyld/dyld.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
Copyright (C) 2011 Shinichiro Hamaji
6
+
7
+
Darling is free software: you can redistribute it and/or modify
8
+
it under the terms of the GNU 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
+
Darling 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 General Public License for more details.
16
+
17
+
You should have received a copy of the GNU General Public License
18
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
19
+
*/
20
+
1
21
#include "MachO.h"
2
22
#include "MachOLoader.h"
3
23
#include "arch.h"
-121
src/dyld/extract.cpp
-121
src/dyld/extract.cpp
···
1
-
// Copyright 2011 Shinichiro Hamaji. All rights reserved.
2
-
//
3
-
// Redistribution and use in source and binary forms, with or without
4
-
// modification, are permitted provided that the following conditions
5
-
// are met:
6
-
//
7
-
// 1. Redistributions of source code must retain the above copyright
8
-
// notice, this list of conditions and the following disclaimer.
9
-
//
10
-
// 2. Redistributions in binary form must reproduce the above
11
-
// copyright notice, this list of conditions and the following
12
-
// disclaimer in the documentation and/or other materials
13
-
// provided with the distribution.
14
-
//
15
-
// THIS SOFTWARE IS PROVIDED BY Shinichiro Hamaji ``AS IS'' AND ANY
16
-
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17
-
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
18
-
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Shinichiro Hamaji OR
19
-
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
20
-
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
21
-
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
22
-
// USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23
-
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
24
-
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
25
-
// OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26
-
// SUCH DAMAGE.
27
-
28
-
// A command line tool to extract a Mach-O binary from a fat binary.
29
-
30
-
#include <fcntl.h>
31
-
#include <sys/mman.h>
32
-
#include <sys/types.h>
33
-
#include <sys/stat.h>
34
-
#include <unistd.h>
35
-
#include <errno.h>
36
-
#include <cstdio>
37
-
38
-
#include <map>
39
-
#include <string>
40
-
#include <iostream>
41
-
42
-
#include <mach-o/fat.h>
43
-
44
-
#include "FatMachO.h"
45
-
46
-
static std::string getFileName(std::string path);
47
-
48
-
int main(int argc, char** argv)
49
-
{
50
-
if (argc < 2 || argc > 4)
51
-
{
52
-
std::cerr << "Usage: " << argv[0] << " <file> [arch-out]\n";
53
-
return 1;
54
-
}
55
-
56
-
int fd = ::open(argv[1], O_RDONLY);
57
-
if (fd < 0)
58
-
{
59
-
perror("open");
60
-
return 1;
61
-
}
62
-
63
-
off_t len = ::lseek(fd, 0, SEEK_END);
64
-
const char* bin = reinterpret_cast<char*>(::mmap(NULL, len, PROT_READ | PROT_WRITE | PROT_EXEC, MAP_PRIVATE, fd, 0));
65
-
66
-
if (bin == MAP_FAILED)
67
-
{
68
-
perror("mmap");
69
-
return -errno;
70
-
}
71
-
72
-
std::map<std::string, fat_arch> archs;
73
-
if (!FatMachO::readFatInfo(fd, &archs))
74
-
{
75
-
std::cerr << "Failed to read the Fat Mach-O header\n";
76
-
return 1;
77
-
}
78
-
79
-
std::cout << archs.size() << " archs:\n";
80
-
81
-
for (std::map<std::string, fat_arch>::const_iterator iter = archs.begin(); iter != archs.end(); ++iter)
82
-
{
83
-
const fat_arch& arch = iter->second;
84
-
std::cout << "cputype=" << arch.cputype << " (" << iter->first << ") "
85
-
"cpusubtype=" << arch.cpusubtype << " offset=" << arch.offset << " size=" << arch.size
86
-
<< " align=" << arch.align << std::endl;
87
-
}
88
-
89
-
for (int i = 2; i < argc; i++)
90
-
{
91
-
const char* arch_name = argv[i];
92
-
std::map<std::string, fat_arch>::const_iterator found = archs.find(arch_name);
93
-
if (found == archs.end())
94
-
{
95
-
std::cerr << "Architecture not present: " << arch_name << std::endl;
96
-
continue;
97
-
}
98
-
99
-
const fat_arch& arch = found->second;
100
-
std::string outname = getFileName(argv[0]) + "." + arch_name;
101
-
int out = ::open(outname.c_str(), O_WRONLY | O_CREAT, 0777);
102
-
103
-
if (::write(out, bin + arch.offset, arch.size) != arch.size)
104
-
{
105
-
perror("write");
106
-
return -errno;
107
-
}
108
-
109
-
::close(out);
110
-
}
111
-
}
112
-
113
-
std::string getFileName(std::string path)
114
-
{
115
-
size_t pos = path.rfind('/');
116
-
if (pos == std::string::npos)
117
-
return path;
118
-
119
-
return path.substr(pos+1);
120
-
}
121
-
+19
src/dyld/ld.cpp
+19
src/dyld/ld.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#include "config.h"
2
21
#define DARWIN_LD_INTERNAL
3
22
#include "MachOLoader.h"
+19
src/dyld/ld.h
+19
src/dyld/ld.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#ifndef DARWIN_LD_H
2
21
#define DARWIN_LD_H
3
22
#include <dlfcn.h>
+19
src/dyld/public.cpp
+19
src/dyld/public.cpp
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#include "config.h"
2
21
#include "public.h"
3
22
#include "MachOLoader.h"
+19
src/dyld/public.h
+19
src/dyld/public.h
···
1
+
/*
2
+
This file is part of Darling.
3
+
4
+
Copyright (C) 2012 Lubos Dolezel
5
+
6
+
Darling is free software: you can redistribute it and/or modify
7
+
it under the terms of the GNU General Public License as published by
8
+
the Free Software Foundation, either version 3 of the License, or
9
+
(at your option) any later version.
10
+
11
+
Darling is distributed in the hope that it will be useful,
12
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
GNU General Public License for more details.
15
+
16
+
You should have received a copy of the GNU General Public License
17
+
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
*/
19
+
1
20
#ifndef DYLD_PUBLIC_H
2
21
#define DYLD_PUBLIC_H
3
22
#include <stdint.h>
+18
src/dyld/trampoline_helper.nasm
+18
src/dyld/trampoline_helper.nasm
···
1
+
;
2
+
; This file is part of Darling.
3
+
;
4
+
; Copyright (C) 2012 Lubos Dolezel
5
+
;
6
+
; Darling is free software: you can redistribute it and/or modify
7
+
; it under the terms of the GNU General Public License as published by
8
+
; the Free Software Foundation, either version 3 of the License, or
9
+
; (at your option) any later version.
10
+
;
11
+
; Darling is distributed in the hope that it will be useful,
12
+
; but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
; GNU General Public License for more details.
15
+
16
+
; You should have received a copy of the GNU General Public License
17
+
; along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
1
19
global trampoline_start
2
20
global trampoline_end
3
21
global reg_saveall
+1
-1
src/libSystem/CMakeLists.txt
+1
-1
src/libSystem/CMakeLists.txt
···
94
94
target_link_libraries(System.B.dylib -ldl -lpthread -luuid -l:../../libmach-o.so -lrt -lssl -lbsd -l:libobjc.so.4)
95
95
add_dependencies(System.B.dylib mach-o)
96
96
97
-
install(TARGETS System.B.dylib DESTINATION lib${SUFFIX})
97
+
install(TARGETS System.B.dylib DESTINATION "lib${SUFFIX}/darling")
98
98
+8
-3
src/libSystem/libc/mac.c
+8
-3
src/libSystem/libc/mac.c
···
273
273
return r;
274
274
275
275
// Linux's buf size is currently much smaller, only 65, so strcpy() is safe
276
-
strcpy(buf->sysname, linux_buf.sysname);
276
+
//strcpy(buf->sysname, linux_buf.sysname);
277
+
//strcpy(buf->nodename, linux_buf.nodename);
278
+
//strcpy(buf->release, linux_buf.release);
279
+
//strcpy(buf->version, linux_buf.version);
280
+
//strcpy(buf->machine, linux_buf.machine);
281
+
strcpy(buf->sysname, "Darwin");
277
282
strcpy(buf->nodename, linux_buf.nodename);
278
-
strcpy(buf->release, linux_buf.release);
279
-
strcpy(buf->version, linux_buf.version);
283
+
strcpy(buf->release, "12.0.0");
284
+
strcpy(buf->version, "Darwin Kernel Version 12.0.0");
280
285
strcpy(buf->machine, linux_buf.machine);
281
286
return 0;
282
287
}
+22
src/libmacarchive/CMakeLists.txt
+22
src/libmacarchive/CMakeLists.txt
···
1
+
project(macarchive)
2
+
3
+
cmake_minimum_required(VERSION 2.4.0)
4
+
if(COMMAND cmake_policy)
5
+
cmake_policy(SET CMP0003 NEW)
6
+
endif(COMMAND cmake_policy)
7
+
8
+
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11 -fPIC")
9
+
10
+
set(macarchive_SRCS
11
+
FileStream.cpp
12
+
MacBinaryStream.cpp
13
+
DMGStream.cpp
14
+
adc.c
15
+
)
16
+
17
+
add_library(macarchive SHARED ${macarchive_SRCS})
18
+
target_link_libraries(macarchive -lssl -lz -lbz2)
19
+
20
+
install(TARGETS macarchive DESTINATION "lib{SUFFIX}/darling")
21
+
22
+
+41
src/libmacarchive/DMGStream.cpp
+41
src/libmacarchive/DMGStream.cpp
···
1
+
#include "DMGStream.h"
2
+
3
+
IStream* DMGStream::open(IStream* stream)
4
+
{
5
+
DMGStream* o = new DMGStream(stream);
6
+
stream->seek(-512, SEEK_END);
7
+
stream->read(&o->m_koly, 512);
8
+
9
+
if (o->m_koly.Signature.msb() != 'koly')
10
+
{
11
+
delete o;
12
+
return nullptr;
13
+
}
14
+
else
15
+
return o;
16
+
}
17
+
18
+
DMGStream::DMGStream(IStream* stream)
19
+
: m_stream(stream)
20
+
{
21
+
static_assert(sizeof(m_koly) == 512, "Invalid kolyblk declaration");
22
+
23
+
// TODO: process the headers
24
+
}
25
+
26
+
DMGStream::~DMGStream()
27
+
{
28
+
}
29
+
30
+
ssize_t DMGStream::read(void* buffer, ssize_t bytes)
31
+
{
32
+
}
33
+
34
+
int64_t DMGStream::seek(int64_t offset, int whence)
35
+
{
36
+
}
37
+
38
+
int64_t DMGStream::length() const
39
+
{
40
+
}
41
+
+79
src/libmacarchive/DMGStream.h
+79
src/libmacarchive/DMGStream.h
···
1
+
#ifndef DMGSTREAM_H
2
+
#define DMGSTREAM_H
3
+
#include <stdint.h>
4
+
#include "IStream.h"
5
+
#include "../util/MSB.h"
6
+
7
+
// TODO: copyright vo1tur
8
+
9
+
// base64: http://www.ioncannon.net/programming/34/howto-base64-encode-with-cc-and-openssl/
10
+
11
+
struct kolyblk {
12
+
MSB<uint32_t> Signature;
13
+
MSB<uint32_t> Version;
14
+
MSB<uint32_t> HeaderSize;
15
+
MSB<uint32_t> Flags;
16
+
MSB<uint64_t> RunningDataForkOffset;
17
+
MSB<uint64_t> DataForkOffset;
18
+
MSB<uint64_t> DataForkLength;
19
+
MSB<uint64_t> RsrcForkOffset;
20
+
MSB<uint64_t> RsrcForkLength;
21
+
MSB<uint32_t> SegmentNumber;
22
+
MSB<uint32_t> SegmentCount;
23
+
MSB<uint32_t> SegmentID1;
24
+
MSB<uint32_t> SegmentID2;
25
+
MSB<uint32_t> SegmentID3;
26
+
MSB<uint32_t> SegmentID4;
27
+
MSB<uint32_t> DataForkChecksumType;
28
+
MSB<uint32_t> Reserved1;
29
+
MSB<uint32_t> DataForkChecksum;
30
+
MSB<uint32_t> Reserved2;
31
+
char Reserved3[120];
32
+
MSB<uint64_t> XMLOffset;
33
+
MSB<uint64_t> XMLLength;
34
+
char Reserved4[120];
35
+
MSB<uint32_t> MasterChecksumType;
36
+
MSB<uint32_t> Reserved5;
37
+
MSB<uint32_t> MasterChecksum;
38
+
MSB<uint32_t> Reserved6;
39
+
char Reserved7[120];
40
+
MSB<uint32_t> ImageVariant;
41
+
MSB<uint64_t> SectorCount;
42
+
char Reserved8[12];
43
+
} __attribute__ ((__packed__));
44
+
45
+
struct _mishblk {
46
+
MSB<uint32_t> BlocksSignature;
47
+
MSB<uint32_t> InfoVersion;
48
+
MSB<uint64_t> FirstSectorNumber;
49
+
MSB<uint64_t> SectorCount;
50
+
MSB<uint64_t> DataStart;
51
+
MSB<uint32_t> DecompressedBufferRequested;
52
+
MSB<uint32_t> BlocksDescriptor;
53
+
char Reserved1[24];
54
+
MSB<uint32_t> ChecksumType;
55
+
MSB<uint32_t> Reserved2;
56
+
MSB<uint32_t> Checksum;
57
+
MSB<uint32_t> Reserved3;
58
+
char Reserved4[120];
59
+
MSB<uint32_t> BlocksRunCount;
60
+
char *Data;
61
+
} __attribute__ ((__packed__));
62
+
63
+
class DMGStream : public IStream
64
+
{
65
+
private:
66
+
DMGStream(IStream* stream);
67
+
public:
68
+
static IStream* open(IStream* stream);
69
+
virtual ~DMGStream();
70
+
virtual ssize_t read(void* buffer, ssize_t bytes) override;
71
+
virtual int64_t seek(int64_t offset, int whence) override;
72
+
virtual int64_t length() const override;
73
+
private:
74
+
IStream* m_stream;
75
+
kolyblk m_koly;
76
+
};
77
+
78
+
#endif
79
+
+41
src/libmacarchive/FileStream.cpp
+41
src/libmacarchive/FileStream.cpp
···
1
+
#include "FileStream.h"
2
+
#include <sys/types.h>
3
+
#include <sys/stat.h>
4
+
#include <unistd.h>
5
+
#include <fcntl.h>
6
+
7
+
FileStream::FileStream(int fd)
8
+
: m_fd(fd)
9
+
{
10
+
m_length = lseek(fd, 0, SEEK_END);
11
+
lseek(fd, 0, SEEK_SET);
12
+
}
13
+
14
+
IStream* FileStream::open(const char* path)
15
+
{
16
+
int fd = ::open(path, O_RDONLY);
17
+
if (fd < 0)
18
+
return nullptr;
19
+
return new FileStream(fd);
20
+
}
21
+
22
+
FileStream::~FileStream()
23
+
{
24
+
close(m_fd);
25
+
}
26
+
27
+
ssize_t FileStream::read(void* buffer, ssize_t bytes)
28
+
{
29
+
return ::read(m_fd, buffer, bytes);
30
+
}
31
+
32
+
int64_t FileStream::seek(int64_t offset, int whence)
33
+
{
34
+
return lseek(m_fd, offset, whence);
35
+
}
36
+
37
+
int64_t FileStream::length() const
38
+
{
39
+
return m_length;
40
+
}
41
+
+21
src/libmacarchive/FileStream.h
+21
src/libmacarchive/FileStream.h
···
1
+
#ifndef FILESTREAM_H
2
+
#define FILESTREAM_H
3
+
#include "IStream.h"
4
+
5
+
class FileStream : public IStream
6
+
{
7
+
private:
8
+
FileStream(int fd);
9
+
public:
10
+
static IStream* open(const char* path);
11
+
virtual ~FileStream();
12
+
virtual ssize_t read(void* buffer, ssize_t bytes) override;
13
+
virtual int64_t seek(int64_t offset, int whence) override;
14
+
virtual int64_t length() const override;
15
+
private:
16
+
int m_fd;
17
+
int64_t m_length;
18
+
};
19
+
20
+
#endif
21
+
+25
src/libmacarchive/IStorage.h
+25
src/libmacarchive/IStorage.h
···
1
+
#ifndef ISTORAGE_H
2
+
#define ISTORAGE_H
3
+
#include <vector>
4
+
#include <string>
5
+
#include <stdint.h>
6
+
7
+
class IStream;
8
+
9
+
struct FileEntry
10
+
{
11
+
std::string name;
12
+
int64_t size;
13
+
unsigned char d_type; // see readdir()
14
+
};
15
+
16
+
class IStorage
17
+
{
18
+
public:
19
+
virtual ~IStorage() = 0;
20
+
virtual IStream* open(const char* path) = 0;
21
+
virtual std::vector<FileEntry> list() = 0;
22
+
};
23
+
24
+
#endif
25
+
+17
src/libmacarchive/IStream.h
+17
src/libmacarchive/IStream.h
···
1
+
#ifndef ISTREAM_H
2
+
#define ISTREAM_H
3
+
#include <stdint.h>
4
+
#include <sys/types.h>
5
+
#include <unistd.h>
6
+
7
+
class IStream
8
+
{
9
+
public:
10
+
virtual ~IStream() = 0;
11
+
virtual ssize_t read(void* buffer, ssize_t bytes) = 0;
12
+
virtual int64_t seek(int64_t offset, int whence) = 0;
13
+
virtual int64_t length() const = 0;
14
+
};
15
+
16
+
#endif
17
+
+61
src/libmacarchive/MacBinaryStream.cpp
+61
src/libmacarchive/MacBinaryStream.cpp
···
1
+
#include "MacBinaryStream.h"
2
+
3
+
MacBinaryStream::MacBinaryStream(IStream* stream)
4
+
: m_stream(stream), m_pos(0)
5
+
{
6
+
m_stream->read(&m_header, sizeof(m_header));
7
+
8
+
uint32_t extraLen = 0;
9
+
10
+
if (m_header.signature == 'mBIN')
11
+
extraLen = m_header.sec_header_len;
12
+
13
+
m_dataOffset = 128 + extraLen;
14
+
m_stream->seek(m_dataOffset, SEEK_SET);
15
+
}
16
+
17
+
IStream* MacBinaryStream::open(IStream* stream)
18
+
{
19
+
return new MacBinaryStream(stream);
20
+
}
21
+
22
+
MacBinaryStream::~MacBinaryStream()
23
+
{
24
+
}
25
+
26
+
ssize_t MacBinaryStream::read(void* buffer, ssize_t bytes)
27
+
{
28
+
if (m_pos + bytes > m_header.data_len)
29
+
bytes = m_header.data_len - m_pos;
30
+
31
+
bytes = m_stream->read(buffer, bytes);
32
+
33
+
if (bytes > 0)
34
+
m_pos += bytes;
35
+
36
+
return bytes;
37
+
}
38
+
39
+
int64_t MacBinaryStream::seek(int64_t offset, int whence)
40
+
{
41
+
if (whence == SEEK_SET)
42
+
m_pos = offset;
43
+
else if (whence == SEEK_CUR)
44
+
m_pos += offset;
45
+
else if (whence == SEEK_END)
46
+
m_pos = m_header.data_len - offset;
47
+
48
+
if (m_pos > m_header.data_len)
49
+
m_pos = m_header.data_len;
50
+
if (m_pos < 0)
51
+
m_pos = 0;
52
+
53
+
m_stream->seek(m_pos, SEEK_SET);
54
+
return m_pos;
55
+
}
56
+
57
+
int64_t MacBinaryStream::length() const
58
+
{
59
+
return m_header.data_len;
60
+
}
61
+
+24
src/libmacarchive/MacBinaryStream.h
+24
src/libmacarchive/MacBinaryStream.h
···
1
+
#ifndef MACBINARYSTREAM_H
2
+
#define MACBINARYSTREAM_H
3
+
#include "../macbinary/macbinary.h"
4
+
#include "IStream.h"
5
+
6
+
class MacBinaryStream : public IStream
7
+
{
8
+
private:
9
+
MacBinaryStream(IStream* stream);
10
+
public:
11
+
static IStream* open(IStream* stream);
12
+
13
+
~MacBinaryStream();
14
+
virtual ssize_t read(void* buffer, ssize_t bytes) override;
15
+
virtual int64_t seek(int64_t offset, int whence) override;
16
+
virtual int64_t length() const override;
17
+
private:
18
+
IStream* m_stream;
19
+
MacBinaryHeader m_header;
20
+
int64_t m_pos, m_dataOffset;
21
+
};
22
+
23
+
#endif
24
+
+114
src/libmacarchive/adc.c
+114
src/libmacarchive/adc.c
···
1
+
#include "adc.h"
2
+
#include <stdlib.h>
3
+
#include <stdio.h>
4
+
#include <string.h>
5
+
6
+
7
+
int adc_decompress(int in_size, unsigned char *input, int avail_size, unsigned char *output, int *bytes_written)
8
+
{
9
+
if (in_size == 0)
10
+
return 0;
11
+
bool output_full = false;
12
+
unsigned char *inp = input;
13
+
unsigned char *outp = output;
14
+
int chunk_type;
15
+
int chunk_size;
16
+
int offset;
17
+
int i;
18
+
19
+
while (inp - input < in_size) {
20
+
chunk_type = adc_chunk_type(*inp);
21
+
switch (chunk_type) {
22
+
case ADC_PLAIN:
23
+
chunk_size = adc_chunk_size(*inp);
24
+
if (outp + chunk_size - output > avail_size) {
25
+
output_full = true;
26
+
break;
27
+
}
28
+
memcpy(outp, inp + 1, chunk_size);
29
+
inp += chunk_size + 1;
30
+
outp += chunk_size;
31
+
break;
32
+
33
+
case ADC_2BYTE:
34
+
chunk_size = adc_chunk_size(*inp);
35
+
offset = adc_chunk_offset(inp);
36
+
if (outp + chunk_size - output > avail_size) {
37
+
output_full = true;
38
+
break;
39
+
}
40
+
if (offset == 0) {
41
+
memset(outp, *(outp - offset - 1), chunk_size);
42
+
outp += chunk_size;
43
+
inp += 2;
44
+
} else {
45
+
for (i = 0; i < chunk_size; i++) {
46
+
memcpy(outp, outp - offset - 1, 1);
47
+
outp++;
48
+
}
49
+
inp += 2;
50
+
}
51
+
break;
52
+
53
+
case ADC_3BYTE:
54
+
chunk_size = adc_chunk_size(*inp);
55
+
offset = adc_chunk_offset(inp);
56
+
if (outp + chunk_size - output > avail_size) {
57
+
output_full = true;
58
+
break;
59
+
}
60
+
if (offset == 0) {
61
+
memset(outp, *(outp - offset - 1), chunk_size);
62
+
outp += chunk_size;
63
+
inp += 3;
64
+
} else {
65
+
for (i = 0; i < chunk_size; i++) {
66
+
memcpy(outp, outp - offset - 1, 1);
67
+
outp++;
68
+
}
69
+
inp += 3;
70
+
}
71
+
break;
72
+
}
73
+
if (output_full)
74
+
break;
75
+
}
76
+
*bytes_written = outp - output;
77
+
return inp - input;
78
+
}
79
+
80
+
int adc_chunk_type(char _byte)
81
+
{
82
+
if (_byte & 0x80)
83
+
return ADC_PLAIN;
84
+
if (_byte & 0x40)
85
+
return ADC_3BYTE;
86
+
return ADC_2BYTE;
87
+
}
88
+
89
+
int adc_chunk_size(char _byte)
90
+
{
91
+
switch (adc_chunk_type(_byte)) {
92
+
case ADC_PLAIN:
93
+
return (_byte & 0x7F) + 1;
94
+
case ADC_2BYTE:
95
+
return ((_byte & 0x3F) >> 2) + 3;
96
+
case ADC_3BYTE:
97
+
return (_byte & 0x3F) + 4;
98
+
}
99
+
return -1;
100
+
}
101
+
102
+
int adc_chunk_offset(unsigned char *chunk_start)
103
+
{
104
+
unsigned char *c = chunk_start;
105
+
switch (adc_chunk_type(*c)) {
106
+
case ADC_PLAIN:
107
+
return 0;
108
+
case ADC_2BYTE:
109
+
return ((((unsigned char)*c & 0x03)) << 8) + (unsigned char)*(c + 1);
110
+
case ADC_3BYTE:
111
+
return (((unsigned char)*(c + 1)) << 8) + (unsigned char)*(c + 2);
112
+
}
113
+
return -1;
114
+
}
+15
src/libmacarchive/adc.h
+15
src/libmacarchive/adc.h
···
1
+
#include <stdio.h>
2
+
#include <unistd.h>
3
+
4
+
#define ADC_PLAIN 0x01
5
+
#define ADC_2BYTE 0x02
6
+
#define ADC_3BYTE 0x03
7
+
8
+
#define bool short
9
+
#define true 1
10
+
#define false 0
11
+
12
+
int adc_decompress(int in_size, unsigned char *input, int avail_size, unsigned char *output, int *bytes_written);
13
+
int adc_chunk_type(char _byte);
14
+
int adc_chunk_size(char _byte);
15
+
int adc_chunk_offset(unsigned char *chunk_start);
+1
-1
src/libncurses/CMakeLists.txt
+1
-1
src/libncurses/CMakeLists.txt
+8
-1
src/libobjcdarwin/CMakeLists.txt
+8
-1
src/libobjcdarwin/CMakeLists.txt
···
12
12
#endif (NOT "${CMAKE_CXX_COMPILER} ${CMAKE_CXX_COMPILER_ARG1}" MATCHES ".*clang")
13
13
14
14
#configure_file(config.h.in config.h)
15
+
16
+
add_definitions(-D__STDC_LIMIT_MACROS)
17
+
15
18
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++0x -fPIC -fvisibility=hidden -ggdb")
16
19
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -std=c99 -fPIC -fvisibility=hidden -ggdb")
17
20
set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} -fPIC")
···
19
22
set(objcdarwin_SRCS
20
23
objc_msgSend_fixup.nasm
21
24
objc_msgSendSuper.nasm
25
+
objc_msgSend.nasm
22
26
NameTranslate.cpp
23
27
ClassRegister.cpp
24
28
···
37
41
new/protocol.cpp
38
42
39
43
NSBundle_dyld.mm
44
+
NSCFString.mm
45
+
misc.mm
46
+
zero.c
40
47
)
41
48
42
49
add_library(objc.A.dylib SHARED ${objcdarwin_SRCS})
43
50
target_link_libraries(objc.A.dylib -l:libobjc.so.4 -lgnustep-base)
44
51
45
-
install(TARGETS objc.A.dylib DESTINATION lib${SUFFIX})
52
+
install(TARGETS objc.A.dylib DESTINATION "lib${SUFFIX}/darling")
46
53
-1
src/libobjcdarwin/NSBundle_dyld.h
-1
src/libobjcdarwin/NSBundle_dyld.h
+16
-2
src/libobjcdarwin/NSBundle_dyld.mm
+16
-2
src/libobjcdarwin/NSBundle_dyld.mm
···
11
11
12
12
extern char g_darwin_executable_path[PATH_MAX];
13
13
static NSBundle* _mainBundle = 0;
14
+
static NSAutoreleasePool* g_pool = 0;
14
15
15
16
void MethodSwizzle(Class aClass, SEL orig_sel, SEL alt_sel);
16
17
···
19
20
LOG << "Swizzling methods in NSBundle\n";
20
21
21
22
MethodSwizzle(objc_getMetaClass("NSBundle"), @selector(mainBundle), @selector(x_mainBundle));
23
+
24
+
g_pool = [[NSAutoreleasePool alloc] init];
22
25
23
26
const char* last = strrchr(g_darwin_executable_path, '/');
24
27
if (last != 0)
25
28
{
26
29
last++;
27
30
28
-
NSAutoreleasePool* pool = [[NSAutoreleasePool alloc] init];
29
31
NSString* str = [NSString stringWithUTF8String:last];
30
32
[[NSProcessInfo processInfo] setProcessName:str];
31
-
[pool drain];
32
33
}
33
34
}
34
35
36
+
__attribute__((destructor)) static void myexit()
37
+
{
38
+
[g_pool drain];
39
+
g_pool = 0;
40
+
}
35
41
36
42
@implementation NSBundle (NSBundle_dyld)
37
43
/*
···
55
61
56
62
path.resize(pos+1);
57
63
//path += "Resources";
64
+
65
+
if ((pos = path.find(".app/")) != std::string::npos)
66
+
{
67
+
// "path.endsWith()"
68
+
// if (path.compare(path.size()-7, 7, "/MacOS/") == 0)
69
+
// path.resize(path.size() - 7);
70
+
path.resize(pos+6);
71
+
}
58
72
59
73
LOG << "NSBundle::x_mainBundle(): deduced " << path << " as resource path\n";
60
74
+14
src/libobjcdarwin/NSCFString.h
+14
src/libobjcdarwin/NSCFString.h
+418
src/libobjcdarwin/NSCFString.mm
+418
src/libobjcdarwin/NSCFString.mm
···
1
+
/** Implementation for GNUStep of NSString concrete subclasses
2
+
Copyright (C) 1997,1998,2000 Free Software Foundation, Inc.
3
+
4
+
Base on code written by Stevo Crvenkovski <stevo@btinternet.com>
5
+
Date: February 1997
6
+
7
+
Based on NSGCString and NSString
8
+
Written by: Andrew Kachites McCallum
9
+
<mccallum@gnu.ai.mit.edu>
10
+
Date: March 1995
11
+
12
+
Optimised by Richard Frith-Macdonald <richard@brainstorm.co.uk>
13
+
Date: October 1998
14
+
15
+
Redesign/rewrite by Richard Frith-Macdonald <rfm@gnu.org>
16
+
Date: September 2000
17
+
18
+
This file is part of the GNUstep Base Library.
19
+
20
+
This library is free software; you can redistribute it and/or
21
+
modify it under the terms of the GNU Lesser General Public
22
+
License as published by the Free Software Foundation; either
23
+
version 2 of the License, or (at your option) any later version.
24
+
25
+
This library is distributed in the hope that it will be useful,
26
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
27
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
28
+
Library General Public License for more details.
29
+
30
+
You should have received a copy of the GNU Lesser General Public
31
+
License along with this library; if not, write to the Free
32
+
Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
33
+
Boston, MA 02111 USA.
34
+
35
+
This file derives a NSCFString class from the NXConstantString implementaion. (Luboš Doležel)
36
+
*/
37
+
38
+
#import "NSCFString.h"
39
+
#import <Foundation/NSException.h>
40
+
41
+
/* Determine the length of the UTF-8 string as a unicode (UTF-16) string.
42
+
* sets the ascii flag according to the content found.
43
+
*/
44
+
static NSUInteger
45
+
lengthUTF8(const uint8_t *p, unsigned l, BOOL *ascii, BOOL *latin1)
46
+
{
47
+
const uint8_t *e = p + l;
48
+
BOOL a = YES;
49
+
BOOL l1 = YES;
50
+
51
+
l = 0;
52
+
while (p < e)
53
+
{
54
+
uint8_t c = *p;
55
+
uint32_t u = c;
56
+
57
+
if (c > 0x7f)
58
+
{
59
+
int i, sle = 0;
60
+
61
+
a = NO;
62
+
/* calculated the expected sequence length */
63
+
while (c & 0x80)
64
+
{
65
+
c = c << 1;
66
+
sle++;
67
+
}
68
+
69
+
/* legal ? */
70
+
if ((sle < 2) || (sle > 6))
71
+
{
72
+
[NSException raise: NSInternalInconsistencyException
73
+
format: @"Bad sequence length in constant string"];
74
+
}
75
+
76
+
if (p + sle > e)
77
+
{
78
+
[NSException raise: NSInternalInconsistencyException
79
+
format: @"Short data in constant string"];
80
+
}
81
+
82
+
/* get the codepoint */
83
+
for (i = 1; i < sle; i++)
84
+
{
85
+
if (p[i] < 0x80 || p[i] >= 0xc0)
86
+
break;
87
+
u = (u << 6) | (p[i] & 0x3f);
88
+
}
89
+
90
+
if (i < sle)
91
+
{
92
+
[NSException raise: NSInternalInconsistencyException
93
+
format: @"Codepoint out of range in constant string"];
94
+
}
95
+
u = u & ~(0xffffffff << ((5 * sle) + 1));
96
+
p += sle;
97
+
98
+
/*
99
+
* We check for invalid codepoints here.
100
+
*/
101
+
if (u > 0x10ffff || u == 0xfffe || u == 0xffff
102
+
|| (u >= 0xfdd0 && u <= 0xfdef))
103
+
{
104
+
[NSException raise: NSInternalInconsistencyException
105
+
format: @"Codepoint invalid in constant string"];
106
+
}
107
+
108
+
if ((u >= 0xd800) && (u <= 0xdfff))
109
+
{
110
+
[NSException raise: NSInternalInconsistencyException
111
+
format: @"Bad surrogate pair in constant string"];
112
+
}
113
+
}
114
+
else
115
+
{
116
+
p++;
117
+
}
118
+
119
+
/*
120
+
* Add codepoint as either a single unichar for BMP
121
+
* or as a pair of surrogates for codepoints over 16 bits.
122
+
*/
123
+
if (u < 0x10000)
124
+
{
125
+
l++;
126
+
if (u > 255)
127
+
{
128
+
l1 = NO;
129
+
}
130
+
}
131
+
else
132
+
{
133
+
l += 2;
134
+
}
135
+
}
136
+
if (0 != ascii)
137
+
{
138
+
*ascii = a;
139
+
}
140
+
if (0 != latin1)
141
+
{
142
+
*latin1 = l1;
143
+
}
144
+
return l;
145
+
}
146
+
147
+
/* Sequentially extracts characters from UTF-8 string
148
+
* p = pointer to the utf-8 data
149
+
* l = length (bytes) of the utf-8 data
150
+
* o = pointer to current offset within the data
151
+
* n = pointer to either zero or the next pre-read part of a surrogate pair.
152
+
* The condition for having read the entire string is that the offset (*o)
153
+
* is the number of bytes in the string, and the unichar pointed to by *n
154
+
* is zero (meaning there is no second part of a surrogate pair remaining).
155
+
*/
156
+
static inline unichar
157
+
nextUTF8(const uint8_t *p, unsigned l, unsigned *o, unichar *n)
158
+
{
159
+
unsigned i;
160
+
161
+
/* If we still have the second part of a surrogate pair, return it.
162
+
*/
163
+
if (*n > 0)
164
+
{
165
+
unichar u = *n;
166
+
167
+
*n = 0;
168
+
return u;
169
+
}
170
+
171
+
if ((i = *o) < l)
172
+
{
173
+
uint8_t c = p[i];
174
+
uint32_t u = c;
175
+
176
+
if (c > 0x7f)
177
+
{
178
+
int j, sle = 0;
179
+
180
+
/* calculated the expected sequence length */
181
+
while (c & 0x80)
182
+
{
183
+
c = c << 1;
184
+
sle++;
185
+
}
186
+
187
+
/* legal ? */
188
+
if ((sle < 2) || (sle > 6))
189
+
{
190
+
[NSException raise: NSInvalidArgumentException
191
+
format: @"bad multibyte character length"];
192
+
}
193
+
194
+
if (sle + i > l)
195
+
{
196
+
[NSException raise: NSInvalidArgumentException
197
+
format: @"multibyte character extends beyond data"];
198
+
}
199
+
200
+
/* get the codepoint */
201
+
for (j = 1; j < sle; j++)
202
+
{
203
+
uint8_t b = p[i + j];
204
+
205
+
if (b < 0x80 || b >= 0xc0)
206
+
break;
207
+
u = (u << 6) | (b & 0x3f);
208
+
}
209
+
210
+
if (j < sle)
211
+
{
212
+
[NSException raise: NSInvalidArgumentException
213
+
format: @"bad data in multibyte character"];
214
+
}
215
+
u = u & ~(0xffffffff << ((5 * sle) + 1));
216
+
i += sle;
217
+
218
+
/*
219
+
* We discard invalid codepoints here.
220
+
*/
221
+
if (u > 0x10ffff || u == 0xfffe || u == 0xffff
222
+
|| (u >= 0xfdd0 && u <= 0xfdef))
223
+
{
224
+
[NSException raise: NSInvalidArgumentException
225
+
format: @"invalid unicode codepoint"];
226
+
}
227
+
228
+
if ((u >= 0xd800) && (u <= 0xdfff))
229
+
{
230
+
[NSException raise: NSInvalidArgumentException
231
+
format: @"unmatched half of surrogate pair"];
232
+
}
233
+
}
234
+
else
235
+
{
236
+
i++;
237
+
}
238
+
239
+
/*
240
+
* Add codepoint as either a single unichar for BMP
241
+
* or as a pair of surrogates for codepoints over 16 bits.
242
+
*/
243
+
if (u >= 0x10000)
244
+
{
245
+
unichar ul, uh;
246
+
247
+
u -= 0x10000;
248
+
ul = u & 0x3ff;
249
+
uh = (u >> 10) & 0x3ff;
250
+
251
+
*n = ul + 0xdc00; // record second part of pair
252
+
u = uh + 0xd800; // return first part.
253
+
}
254
+
*o = i; // Return new index
255
+
return (unichar)u;
256
+
}
257
+
[NSException raise: NSInvalidArgumentException
258
+
format: @"no more data in UTF-8 string"];
259
+
return 0;
260
+
}
261
+
262
+
@implementation NSCFString
263
+
264
+
- (const char*) UTF8String
265
+
{
266
+
return nxcsptr;
267
+
}
268
+
269
+
- (unichar) characterAtIndex: (NSUInteger)index
270
+
{
271
+
NSUInteger l = 0;
272
+
unichar u;
273
+
unichar n = 0;
274
+
unsigned i = 0;
275
+
276
+
while (i < nxcslen || n > 0)
277
+
{
278
+
u = nextUTF8((const uint8_t *)nxcsptr, nxcslen, &i, &n);
279
+
if (l++ == index)
280
+
{
281
+
return u;
282
+
}
283
+
}
284
+
285
+
[NSException raise: NSInvalidArgumentException
286
+
format: @"-characterAtIndex: index out of range"];
287
+
return 0;
288
+
}
289
+
290
+
- (void) dealloc
291
+
{
292
+
GSNOSUPERDEALLOC;
293
+
}
294
+
295
+
/* Must match the implementation in NSString
296
+
*/
297
+
- (NSUInteger) hash
298
+
{
299
+
if (nxcslen > 0)
300
+
{
301
+
unsigned ret = 0;
302
+
unichar n = 0;
303
+
unsigned i = 0;
304
+
unichar c;
305
+
306
+
while (i < nxcslen)
307
+
{
308
+
c = nextUTF8((const uint8_t *)nxcsptr, nxcslen, &i, &n);
309
+
ret = (ret << 5) + ret + c;
310
+
}
311
+
if (0 != n)
312
+
{
313
+
ret = (ret << 5) + ret + n; // Add final character
314
+
}
315
+
ret &= 0x0fffffff;
316
+
if (ret == 0)
317
+
{
318
+
ret = 0x0fffffff;
319
+
}
320
+
return ret;
321
+
}
322
+
else
323
+
{
324
+
return 0x0ffffffe; /* Hash for an empty string. */
325
+
}
326
+
}
327
+
328
+
- (id) initWithBytes: (const void*)bytes
329
+
length: (NSUInteger)length
330
+
encoding: (NSStringEncoding)encoding
331
+
{
332
+
[NSException raise: NSGenericException
333
+
format: @"Attempt to init a constant string"];
334
+
return nil;
335
+
}
336
+
337
+
- (id) initWithBytesNoCopy: (void*)bytes
338
+
length: (NSUInteger)length
339
+
encoding: (NSStringEncoding)encoding
340
+
freeWhenDone: (BOOL)flag
341
+
{
342
+
[NSException raise: NSGenericException
343
+
format: @"Attempt to init a constant string"];
344
+
return nil;
345
+
}
346
+
347
+
- (BOOL) isEqual: (id)anObject
348
+
{
349
+
if ([anObject isKindOfClass: [NSCFString class]])
350
+
{
351
+
NSCFString* str = (NSCFString*) anObject;
352
+
if (nxcslen != str->nxcslen)
353
+
return NO;
354
+
else
355
+
return memcmp(nxcsptr, str->nxcsptr, nxcslen) == 0;
356
+
}
357
+
else if ([anObject isKindOfClass: [NSString class]])
358
+
return [anObject isEqual: self];
359
+
else
360
+
return NO;
361
+
}
362
+
363
+
- (BOOL) isEqualToString: (NSString*)other
364
+
{
365
+
if ([other isKindOfClass: [NSCFString class]])
366
+
{
367
+
NSCFString* str = (NSCFString*) other;
368
+
if (nxcslen != str->nxcslen)
369
+
return NO;
370
+
else
371
+
return memcmp(nxcsptr, str->nxcsptr, nxcslen) == 0;
372
+
}
373
+
else
374
+
return [other isEqual: self];
375
+
}
376
+
377
+
- (NSUInteger) length
378
+
{
379
+
return lengthUTF8((const uint8_t*)nxcsptr, nxcslen, 0, 0);
380
+
}
381
+
382
+
- (id) retain
383
+
{
384
+
return self;
385
+
}
386
+
387
+
- (oneway void) release
388
+
{
389
+
return;
390
+
}
391
+
392
+
- (id) autorelease
393
+
{
394
+
return self;
395
+
}
396
+
397
+
- (id) copyWithZone: (NSZone*)z
398
+
{
399
+
return self;
400
+
}
401
+
402
+
- (NSZone*) zone
403
+
{
404
+
return NSDefaultMallocZone();
405
+
}
406
+
407
+
- (NSStringEncoding) fastestEncoding
408
+
{
409
+
return NSUTF8StringEncoding;
410
+
}
411
+
412
+
- (NSStringEncoding) smallestEncoding
413
+
{
414
+
return NSUTF8StringEncoding;
415
+
}
416
+
417
+
@end
418
+
+5
src/libobjcdarwin/NameTranslate.cpp
+5
src/libobjcdarwin/NameTranslate.cpp
+3
src/libobjcdarwin/common/attribute.cpp
+3
src/libobjcdarwin/common/attribute.cpp
···
1
1
#include "attribute.h"
2
+
#include "../../util/log.h"
2
3
#include <cassert>
3
4
4
5
bool nextAttribute(objc_property_attribute_t& next, const char*& pos, std::vector<std::string>& strings)
···
38
39
strings.push_back(std::string(start, pos-start));
39
40
next.value = strings.back().c_str();
40
41
}
42
+
43
+
LOG << "Attr: name: " << next.name << "; value: " << next.value << std::endl;
41
44
42
45
return true;
43
46
}
+17
src/libobjcdarwin/common/property.h
+17
src/libobjcdarwin/common/property.h
···
6
6
#include "../../util/log.h"
7
7
#include "attribute.h"
8
8
#include <vector>
9
+
#include <cstring>
9
10
10
11
template<typename PropList, typename Func>
11
12
void ConvertProperties(const PropList* props, Func f)
12
13
{
13
14
LOG << "Registering " << props->count << " properties\n";
15
+
14
16
for (uint32_t i = 0; i < props->count; i++)
15
17
{
16
18
auto* prop = &props->list[i];
···
18
20
std::vector<std::string> strings;
19
21
objc_property_attribute_t next;
20
22
const char* pos = prop->attributes;
23
+
bool hadName = false;
24
+
25
+
LOG << "Converting " << prop->attributes << std::endl;
21
26
22
27
while (nextAttribute(next, pos, strings))
28
+
{
29
+
// THIS IS VERY WRONG
30
+
// But needed as a workaround for a serious mistake made in libobjc2's design!
31
+
if (strcmp(next.name, "V") == 0)
32
+
{
33
+
next.value = prop->name;
34
+
hadName = true;
35
+
}
23
36
attribs.push_back(next);
37
+
}
38
+
39
+
if (!hadName)
40
+
attribs.push_back(objc_property_attribute_t{"V", prop->name});
24
41
25
42
//attribs.clear();
26
43
LOG << "\tProperty " << prop->name << " with " << attribs.size() << " attributes\n";
+8
src/libobjcdarwin/misc.mm
+8
src/libobjcdarwin/misc.mm
+6
-58
src/libobjcdarwin/objc_msgSend.nasm
+6
-58
src/libobjcdarwin/objc_msgSend.nasm
···
1
-
global __darwin_objc_msgSend
1
+
global __darwin_objc_msgSend_noarg
2
2
3
-
extern objcdarwin_class_lookup
4
-
extern objc_msg_lookup
5
-
extern sel_get_any_uid
6
-
extern objcdarwin_SaveRegisters
7
-
extern objcdarwin_RestoreRegisters
8
-
extern objcdarwin_sel_lookup
3
+
extern objc_msgSend
9
4
10
5
%ifidn __OUTPUT_FORMAT__, elf64
11
6
12
7
BITS 64
13
8
section text
14
9
15
-
__darwin_objc_msgSend:
16
-
; Procedure:
17
-
; 1) get the converted GNU class from an Apple class
18
-
; 2) convert Apple selector to GNU
19
-
; 3) run objc_msg_lookup
20
-
; 4) jump to the pointer returned by objc_msg_lookup
21
-
22
-
call objcdarwin_SaveRegisters WRT ..plt
23
-
call objcdarwin_class_lookup WRT ..plt
24
-
mov [rsp], rax ; save the converted value
25
-
26
-
; move the second argument into the first argument
27
-
mov rdi, [rsp+8]
28
-
call objcdarwin_sel_lookup WRT ..plt
29
-
; rax now has the GNU selector
30
-
; move rax to the second argument
31
-
mov rsi, rax
32
-
mov [rsp+8], rax
33
-
; restore the first argument
34
-
mov rdi, [rsp]
35
-
call objc_msg_lookup WRT ..plt
36
-
37
-
call objcdarwin_RestoreRegisters WRT ..plt
38
-
jmp rax
10
+
__darwin_objc_msgSend_noarg:
11
+
jmp objc_msgSend WRT ..plt
39
12
40
13
%elifidn __OUTPUT_FORMAT__, elf
41
14
42
15
BITS 32
43
16
section text
44
17
45
-
__darwin_objc_msgSend:
46
-
;enter 8
47
-
48
-
mov ecx, [esp+4]
49
-
push ecx ; arg for func call
50
-
51
-
call objcdarwin_class_lookup ;WRT ..plt
52
-
53
-
add esp, 4 ; remove argument
54
-
mov [esp+4], eax ; change the class id
55
-
56
-
mov ecx, [esp+8] ; second argument
57
-
push ecx
58
-
59
-
call objcdarwin_sel_lookup ;WRT ..plt
60
-
61
-
add esp, 4
62
-
mov [esp+8], eax
63
-
64
-
push eax ; reuse the sel_get_any_uid retval
65
-
mov eax, [esp+8]
66
-
push eax ; class id
67
-
68
-
call objc_msg_lookup ;WRT ..plt
69
-
add esp, 8
70
-
71
-
jmp eax
18
+
__darwin_objc_msgSend_noarg:
19
+
jmp objc_msgSend
72
20
73
21
%else
74
22
+7
src/libobjcdarwin/visibility.h
+7
src/libobjcdarwin/visibility.h
+16
src/macbinary/CMakeLists.txt
+16
src/macbinary/CMakeLists.txt
···
1
+
project(macbinary)
2
+
3
+
cmake_minimum_required(VERSION 2.4.0)
4
+
if(COMMAND cmake_policy)
5
+
cmake_policy(SET CMP0003 NEW)
6
+
endif(COMMAND cmake_policy)
7
+
8
+
set(macbinary_SRCS
9
+
macbinary.cpp
10
+
)
11
+
12
+
add_executable(macbinary ${macbinary_SRCS})
13
+
14
+
install(TARGETS macbinary DESTINATION bin)
15
+
16
+
+175
src/macbinary/macbinary.cpp
+175
src/macbinary/macbinary.cpp
···
1
+
#define FOR_MACBINARY
2
+
#include <iostream>
3
+
#include <fstream>
4
+
#include <cstdlib>
5
+
#include <cstring>
6
+
#include <string>
7
+
#include <stdexcept>
8
+
#include <algorithm>
9
+
#include <sstream>
10
+
#include "macbinary.h"
11
+
12
+
int main(int argc, char** argv)
13
+
{
14
+
if (argc != 3 && argc != 4)
15
+
printHelp();
16
+
17
+
Command cmd = getCommand(argv[1]);
18
+
std::ifstream file;
19
+
20
+
try
21
+
{
22
+
MacBinaryHeader hdr;
23
+
24
+
file.exceptions(std::ifstream::failbit | std::ifstream::badbit | std::ifstream::eofbit);
25
+
file.open(argv[2], std::ios_base::binary | std::ios_base::in);
26
+
27
+
file.read((char*) &hdr, sizeof hdr);
28
+
checkHeader(hdr);
29
+
30
+
switch (cmd)
31
+
{
32
+
case PrintName:
33
+
printName(file, hdr);
34
+
break;
35
+
case ExtractDF:
36
+
extractDF(file, hdr, (argc == 4)? argv[3] : 0);
37
+
break;
38
+
case ExtractRF:
39
+
extractRF(file, hdr, (argc == 4)? argv[3] : 0);
40
+
break;
41
+
}
42
+
43
+
return 0;
44
+
}
45
+
catch (const std::ifstream::failure& e)
46
+
{
47
+
std::cerr << "Error reading input file: " << argv[2] << std::endl;
48
+
}
49
+
catch (const std::exception& e)
50
+
{
51
+
std::cerr << e.what() << std::endl;
52
+
return 1;
53
+
}
54
+
}
55
+
56
+
void printHelp()
57
+
{
58
+
std::cerr << "Usage: macbinary <command> <file> [outfile]\n\n"
59
+
"Commands: \ndf - extract the data fork\n"
60
+
"rf - extract the resource fork (will append '.rf' to the original file name)\n"
61
+
"fn - print the original file name\n";
62
+
exit(1);
63
+
}
64
+
65
+
Command getCommand(const char* cmd)
66
+
{
67
+
if (!strcmp(cmd, "df"))
68
+
return ExtractDF;
69
+
else if (!strcmp(cmd, "rf"))
70
+
return ExtractRF;
71
+
else if (!strcmp(cmd, "pn"))
72
+
return PrintName;
73
+
else
74
+
{
75
+
printHelp();
76
+
return PrintName; // never reached
77
+
}
78
+
}
79
+
80
+
void printName(std::ifstream& file, const MacBinaryHeader& hdr)
81
+
{
82
+
std::cout << std::string(hdr.filename, hdr.filename_len) << std::endl;
83
+
}
84
+
85
+
void extractRF(std::ifstream& file, const MacBinaryHeader& hdr, const char* outName)
86
+
{
87
+
if (!hdr.resource_len)
88
+
std::cerr << "Warning: the resource fork is empty\n";
89
+
90
+
uint32_t extraLen = 0;
91
+
std::string name;
92
+
93
+
if (uint32_t(hdr.signature) == 'mBIN')
94
+
extraLen = hdr.sec_header_len;
95
+
96
+
extraLen += hdr.data_len;
97
+
extraLen = (extraLen+127) / 128 * 128;
98
+
99
+
if (outName)
100
+
name = outName;
101
+
else
102
+
name = std::string(hdr.filename, hdr.filename_len) + ".rf";
103
+
104
+
extract(file, 128 + extraLen, hdr.resource_len, name);
105
+
}
106
+
107
+
void extractDF(std::ifstream& file, const MacBinaryHeader& hdr, const char* outName)
108
+
{
109
+
if (!hdr.data_len)
110
+
std::cerr << "Warning: the data fork is empty\n";
111
+
112
+
uint32_t extraLen = 0;
113
+
std::string name;
114
+
115
+
if (hdr.signature == 'mBIN')
116
+
extraLen = hdr.sec_header_len;
117
+
118
+
if (outName)
119
+
name = outName;
120
+
else
121
+
name = std::string(hdr.filename, hdr.filename_len);
122
+
123
+
extract(file, 128 + extraLen, hdr.data_len, name);
124
+
}
125
+
126
+
void extract(std::ifstream& file, uint32_t offset, uint32_t len, std::string outName)
127
+
{
128
+
std::ofstream fout;
129
+
std::ostream* out;
130
+
uint32_t pos = 0;
131
+
132
+
std::cerr << "Extracting into " << outName << std::endl;
133
+
134
+
try
135
+
{
136
+
if (outName != "-")
137
+
{
138
+
fout.exceptions(std::ofstream::failbit | std::ofstream::badbit);
139
+
fout.open(outName, std::ios_base::out | std::ios_base::binary);
140
+
out = &fout;
141
+
}
142
+
else
143
+
out = &std::cout;
144
+
145
+
file.seekg(offset);
146
+
147
+
while (pos < len)
148
+
{
149
+
char buffer[4096];
150
+
uint32_t toRead = std::min<uint32_t>(len-pos, sizeof buffer);
151
+
152
+
file.read(buffer, toRead);
153
+
out->write(buffer, toRead);
154
+
155
+
pos += toRead;
156
+
}
157
+
}
158
+
catch (const std::exception& e)
159
+
{
160
+
std::stringstream ss;
161
+
ss << "Error writing output file: ";
162
+
ss << outName;
163
+
throw ss.str();
164
+
}
165
+
}
166
+
167
+
void checkHeader(const MacBinaryHeader& hdr)
168
+
{
169
+
if (hdr.signature == 'mBIN')
170
+
return; // MacBinary III
171
+
// TODO: crc // may be MacBinary II
172
+
if (hdr.zero2 == 0)
173
+
return; // may be MacBinary I
174
+
}
175
+
+49
src/macbinary/macbinary.h
+49
src/macbinary/macbinary.h
···
1
+
#ifndef MACBINARY_H
2
+
#define MACBINARY_H
3
+
#include <stdint.h>
4
+
#include "../util/MSB.h"
5
+
6
+
// http://hackipedia.org/File%20formats/Containers/MacBinary%20(archive)/MacBinary%20III%20file%20format.html
7
+
8
+
#pragma pack(1)
9
+
struct MacBinaryHeader
10
+
{
11
+
uint8_t old_ver;
12
+
uint8_t filename_len;
13
+
char filename[63];
14
+
MSB<uint32_t> file_type, file_creator;
15
+
uint8_t orig_finder_flags;
16
+
uint8_t zero;
17
+
MSB<uint16_t> vertical_pos, horizontal_pos;
18
+
MSB<uint16_t> win_folder_id;
19
+
uint8_t _protected, zero2;
20
+
MSB<uint32_t> data_len, resource_len;
21
+
MSB<uint32_t> created, last_modified;
22
+
MSB<uint16_t> getinfo_comment_len;
23
+
uint8_t finder_flags;
24
+
MSB<uint32_t> signature; // 'mBIN'
25
+
uint8_t script, ext_finder_flags, unused[8];
26
+
MSB<uint32_t> total_len; // unused
27
+
MSB<uint16_t> sec_header_len;
28
+
uint8_t version_write, version_read;
29
+
MSB<uint16_t> crc;
30
+
char padding[2]; // pad to 128 bytes
31
+
};
32
+
#pragma pack()
33
+
34
+
static_assert(sizeof(MacBinaryHeader) == 128, "Invalid header length");
35
+
36
+
#ifdef FOR_MACBINARY
37
+
enum Command { ExtractDF, ExtractRF, PrintName };
38
+
39
+
void printHelp();
40
+
Command getCommand(const char* cmd);
41
+
void printName(std::ifstream& file, const MacBinaryHeader& hdr);
42
+
void extractRF(std::ifstream& file, const MacBinaryHeader& hdr, const char* outName);
43
+
void extractDF(std::ifstream& file, const MacBinaryHeader& hdr, const char* outName);
44
+
void extract(std::ifstream& file, uint32_t offset, uint32_t len, std::string outName);
45
+
void checkHeader(const MacBinaryHeader& hdr);
46
+
#endif
47
+
48
+
#endif
49
+
+19
src/motool/motool.cpp
+19
src/motool/motool.cpp
···
1
+
/*
2
+
* This file is part of Darling.
3
+
*
4
+
* Copyright (C) 2012 Lubos Dolezel
5
+
*
6
+
* Darling is free software: you can redistribute it and/or modify
7
+
* it under the terms of the GNU General Public License as published by
8
+
* the Free Software Foundation, either version 3 of the License, or
9
+
* (at your option) any later version.
10
+
*
11
+
* Darling is distributed in the hope that it will be useful,
12
+
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
+
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
+
* GNU General Public License for more details.
15
+
*
16
+
* You should have received a copy of the GNU General Public License
17
+
* along with Foobar. If not, see <http://www.gnu.org/licenses/>.
18
+
* */
19
+
1
20
#include "MachO.h"
2
21
#include "FatMachO.h"
3
22
#include <iostream>
+24
src/util/MSB.h
+24
src/util/MSB.h
···
1
+
#ifndef MSB_H
2
+
#define MSB_H
3
+
#ifndef _BSD_SOURCE
4
+
# define _BSD_SOURCE
5
+
#endif
6
+
#include <endian.h>
7
+
#include <stdint.h>
8
+
9
+
template<typename T>
10
+
class MSB
11
+
{
12
+
protected:
13
+
static uint16_t convert(uint16_t v) { return be16toh(v); }
14
+
static uint32_t convert(uint32_t v) { return be32toh(v); }
15
+
static uint64_t convert(uint64_t v) { return be64toh(v); }
16
+
17
+
public:
18
+
operator T() const { return convert(m_data); }
19
+
T msb() const { return m_data; }
20
+
private:
21
+
T m_data;
22
+
};
23
+
24
+
#endif
+3
-6
tests/src/objc_properties.m
+3
-6
tests/src/objc_properties.m
···
3
3
#import <objc/runtime.h>
4
4
5
5
@interface helloclass : NSObject {
6
-
@private int var;
6
+
@private int varName;
7
7
}
8
-
@property (readwrite,assign) int var;
8
+
@property (readwrite,assign) int propName;
9
9
@end
10
10
11
11
@implementation helloclass
12
-
@synthesize var;
12
+
@synthesize propName = varName;
13
13
@end
14
14
15
15
int main()
16
16
{
17
-
helloclass* c = [helloclass new];
18
-
c.var = 5;
19
-
20
17
unsigned int outCount, i;
21
18
objc_property_t *properties = class_copyPropertyList([helloclass class], &outCount);
22
19
printf("%u properties\n", outCount);