├── README
├── divapatch
├── COPYING
├── Makefile
├── README
├── exports.exp
├── hook.c
├── hook.h
├── imports.S
├── logger.c
├── logger.h
├── main.c
├── pspdefs.h
├── reader.c
├── reader.h
├── resources
│ ├── diva1st_embedded.txt
│ ├── diva1st_images.txt
│ ├── diva1st_translation.txt
│ ├── diva2nd#_translation.txt
│ ├── diva2nd101_translation.txt
│ ├── diva2nd_images.txt
│ ├── diva2nd_translation.txt
│ ├── divaext_embedded.txt
│ ├── divaext_embedded_base.txt
│ ├── divaext_embedded_english.txt
│ ├── divaext_images.txt
│ ├── divaext_translation.txt
│ └── divaext_translation_base.txt
├── search.c
├── search.h
├── util
│ ├── Makefile
│ ├── Makefile.win32
│ ├── convert.cpp
│ └── extract.c
├── utility.c
└── utility.h
├── mhp3loader
├── COPYING
├── Makefile
├── README
├── exports.exp
├── gen_id.py
├── hook.c
├── hook.h
├── imports.S
├── loader.c
├── loader.h
├── logger.c
├── logger.h
├── main.c
├── main.h
├── reader.c
├── reader.h
├── search.c
└── search.h
└── mhpatch
├── COPYING
├── Makefile
├── README
├── data_install.c
├── data_install.h
├── exports.exp
├── imports.S
├── libs.c
├── libs.h
├── logger.c
├── logger.h
├── main.c
├── misc.c
├── misc.h
├── sceio.c
└── sceio.h
/README:
--------------------------------------------------------------------------------
1 | PRX patchers for MonsterHunter Portable 3rd and Project Diva 2nd
--------------------------------------------------------------------------------
/divapatch/COPYING:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
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 |
635 | Copyright (C)
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 .
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 | Copyright (C)
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 | .
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 | .
675 |
--------------------------------------------------------------------------------
/divapatch/Makefile:
--------------------------------------------------------------------------------
1 | TARGET = divapatch
2 | OBJS = main.o exports.o imports.o logger.o hook.o reader.o search.o utility.o
3 |
4 | LIBS =
5 | WARN_FLAGS=-Wall -Wextra -Wfloat-equal -Wundef -Wshadow -Wpointer-arith -Wcast-align -Wwrite-strings -Wconversion -Wunreachable-code -Wno-unused-parameter
6 | CFLAGS = -O2 -G0 -std=c99 $(WARN_FLAGS)
7 |
8 | ifeq ($(DEBUG), 1)
9 | CFLAGS+=-DDEBUG
10 | endif
11 |
12 | ifneq ($(UTILITY_HOOK), 0)
13 | CFLAGS+=-DUTILITY_HOOK
14 | endif
15 |
16 | ASFLAGS = $(CFLAGS)
17 |
18 | USE_KERNEL_LIBC = 1
19 | USE_KERNEL_LIBS = 1
20 |
21 | PSP_FW_VERSION=620
22 |
23 | PSPSDK=$(shell psp-config --pspsdk-path)
24 | include $(PSPSDK)/lib/build_prx.mak
25 |
--------------------------------------------------------------------------------
/divapatch/README:
--------------------------------------------------------------------------------
1 | divapatch: in-game prx patcher by codestation
2 |
3 | Usage:
4 |
5 | * Copy divapatch.prx to the ms0:/seplugins directory of the PSP and enable
6 | it in game.txt (the plugins can be in a separate directory inside seplugins,
7 | e.g. ms0:/seplugins/divapatch to avoid cluttering the plugins directory).
8 |
9 | * Copy the patchfile diva2nd_translation.bin in the same place as the plugin
10 |
11 | To create the patchfile run "divaconvert diva2nd_translation.txt"
12 |
13 | Note: the diva2nd_translation.txt file must be in shift-jis encoding.
14 |
15 | For Project Diva Extend use the filenames divaext_translation.[bin|txt]
16 |
--------------------------------------------------------------------------------
/divapatch/exports.exp:
--------------------------------------------------------------------------------
1 | PSP_BEGIN_EXPORTS
2 |
3 | PSP_EXPORT_START(syslib, 0, 0x8000)
4 | PSP_EXPORT_FUNC(module_start)
5 | PSP_EXPORT_FUNC(module_stop)
6 | PSP_EXPORT_VAR(module_info)
7 | PSP_EXPORT_END
8 |
9 | PSP_EXPORT_START(divakernel, 0, 0x4001)
10 | PSP_EXPORT_FUNC(diva_open)
11 | PSP_EXPORT_FUNC(diva_read)
12 | PSP_EXPORT_FUNC(diva_aread)
13 | PSP_EXPORT_FUNC(diva_wait)
14 | PSP_EXPORT_FUNC(diva_poll)
15 | PSP_EXPORT_FUNC(diva_waitc)
16 | PSP_EXPORT_FUNC(diva_close)
17 | PSP_EXPORT_FUNC(diva_save)
18 | PSP_EXPORT_FUNC(diva_osk)
19 | PSP_EXPORT_FUNC(diva_net)
20 | PSP_EXPORT_FUNC(diva_shot)
21 | PSP_EXPORT_END
22 |
23 | PSP_END_EXPORTS
24 |
--------------------------------------------------------------------------------
/divapatch/hook.c:
--------------------------------------------------------------------------------
1 | /*
2 | * Copyright 2010 by Coldbird
3 | *
4 | * hook.c - Import Hooking Functions
5 | *
6 | * This file is part of Adhoc Emulator.
7 | *
8 | * Adhoc Emulator is free software: you can redistribute it and/or modify
9 | * it under the terms of the GNU General Public License as published by
10 | * the Free Software Foundation, either version 3 of the License, or
11 | * (at your option) any later version.
12 | *
13 | * Adhoc Emulator is distributed in the hope that it will be useful,
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | * GNU General Public License for more details.
17 | *
18 | * You should have received a copy of the GNU General Public License
19 | * along with Adhoc Emulator. If not, see .
20 | */
21 |
22 | #include
23 | #include
24 | #include
25 | #include
26 | #include "hook.h"
27 | #include "logger.h"
28 |
29 | typedef struct {
30 | const char * name;
31 | unsigned short version;
32 | unsigned short attribute;
33 | unsigned char entLen;
34 | unsigned char varCount;
35 | unsigned short funcCount;
36 | unsigned int * fnids;
37 | unsigned int * funcs;
38 | unsigned int * vnids;
39 | unsigned int * vars;
40 | } PspModuleImport;
41 |
42 | PspModuleImport * find_import_lib(SceModule * module, const char * library) {
43 | //library import pointer
44 | PspModuleImport * result = NULL;
45 |
46 | //valid arguments
47 | if (module && library) {
48 | //check stub table
49 | unsigned int x = 0;
50 | while (x < module->stub_size) {
51 | //grab library stub
52 | result = (PspModuleImport *) ((u32) (module->stub_top) + x);
53 | //library found
54 | if (result->name && strcmp(result->name, library) == 0) {
55 | //stop search
56 | break;
57 | }
58 |
59 | //move forward
60 | x += (u32)(result->entLen * 4);
61 | }
62 |
63 | //library not found
64 | if (x == module->stub_size)
65 | result = NULL;
66 | }
67 |
68 | //return library import pointer
69 | return result;
70 | }
71 |
72 | void list_imports(SceModule * module, const char * library) {
73 | //find library import
74 | PspModuleImport * import = find_import_lib(module, library);
75 |
76 | //found import
77 | if (import) {
78 | //find stub
79 | unsigned int x = 0;
80 | for (; x < import->funcCount; x++) {
81 | //found stub
82 | kprintf("%s: %08X\n", library, import->fnids[x]);
83 | }
84 | }
85 | }
86 |
87 | unsigned int find_import_bynid(SceModule * module, const char * library, unsigned int nid) {
88 | //stub address
89 | unsigned int result = 0;
90 |
91 | //find library import
92 | PspModuleImport * import = find_import_lib(module, library);
93 |
94 | //found import
95 | if (import) {
96 | //kprintf("%s: Found import lib: %s\n", __FILE__, library);
97 | //find stub
98 | unsigned int x = 0;
99 | for (; x < import->funcCount; x++) {
100 | //kprintf("%s: checking import NID: %08X\n", __FILE__, import->fnids[x]);
101 | //found stub
102 | if (import->fnids[x] == nid) {
103 | //save stub address
104 | result = (unsigned int) &import->funcs[x * 2];
105 |
106 | //stop search
107 | break;
108 | }
109 | }
110 | }
111 |
112 | //return stub address
113 | return result;
114 | }
115 |
116 | void api_hook_import(unsigned int address, void * function) {
117 | //valid address
118 | if (address) {
119 | //asm jmp
120 | *(unsigned int *) (address) = 0x08000000 | ((unsigned int) function & 0x0FFFFFFF) >> 2;
121 |
122 | //asm nop
123 | *(unsigned int *) (address + 4) = 0;
124 |
125 | //flush cache
126 | sceKernelDcacheWritebackInvalidateRange((const void *) address, 8);
127 | sceKernelIcacheInvalidateRange((const void *) address, 8);
128 | }
129 | }
130 |
131 | void api_hook_import_syscall(unsigned int address, void * function) {
132 | //valid address
133 | if (address) {
134 | //asm jr $ra
135 | *(unsigned int *) (address) = 0x03E00008;
136 |
137 | //asm syscall #
138 | *(unsigned int *) (address + 4) = (((sceKernelQuerySystemCall(function)) << 6) | 12);
139 |
140 | //flush cache
141 | sceKernelDcacheWritebackInvalidateRange((const void *) address, 8);
142 | sceKernelIcacheInvalidateRange((const void *) address, 8);
143 | }
144 | }
145 |
146 | int hook_import_bynid(SceModule * module, const char * library, unsigned int nid, void * function, int syscall) {
147 | //result
148 | int result = 0;
149 |
150 | //find import stub
151 | unsigned int stub = find_import_bynid(module, library, nid);
152 |
153 | //found stub
154 | if (stub) {
155 | //write syscall
156 | if (syscall)
157 | api_hook_import_syscall(stub, function);
158 |
159 | //write jump
160 | else
161 | api_hook_import(stub, function);
162 | }
163 |
164 | //stub not found
165 | else
166 | result = -1;
167 |
168 | //return result
169 | return result;
170 | }
171 |
--------------------------------------------------------------------------------
/divapatch/hook.h:
--------------------------------------------------------------------------------
1 | /*
2 | * Copyright 2010 by Coldbird
3 | *
4 | * hook.h - Import Hooking Functions
5 | *
6 | * This file is part of Adhoc Emulator.
7 | *
8 | * Adhoc Emulator is free software: you can redistribute it and/or modify
9 | * it under the terms of the GNU General Public License as published by
10 | * the Free Software Foundation, either version 3 of the License, or
11 | * (at your option) any later version.
12 | *
13 | * Adhoc Emulator is distributed in the hope that it will be useful,
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | * GNU General Public License for more details.
17 | *
18 | * You should have received a copy of the GNU General Public License
19 | * along with Adhoc Emulator. If not, see .
20 | */
21 |
22 | #ifndef HOOK_H_
23 | #define HOOK_H_
24 |
25 | #include
26 |
27 | //query syscall number
28 | unsigned int sceKernelQuerySystemCall(void * function);
29 |
30 | unsigned int find_import_bynid(SceModule * module, const char * library, unsigned int nid);
31 | //hook function via import (can do jump & syscall hooks)
32 | int hook_import_bynid(SceModule * module, const char * library, unsigned int nid, void * function, int syscall);
33 |
34 | #endif /* HOOK_H_ */
35 |
--------------------------------------------------------------------------------
/divapatch/imports.S:
--------------------------------------------------------------------------------
1 | .set noreorder
2 |
3 | #include "pspstub.s"
4 |
5 | STUB_START "SystemCtrlForKernel",0x00090000,0x00020005
6 | STUB_FUNC 0x1C90BECB,sctrlHENSetStartModuleHandler
7 | STUB_FUNC 0x159AF5CC,sctrlHENFindFunction
8 | STUB_END
9 |
--------------------------------------------------------------------------------
/divapatch/logger.c:
--------------------------------------------------------------------------------
1 | /*
2 | * MHP3patch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #include
21 | #include
22 | #include "logger.h"
23 |
24 | #ifdef DEBUG
25 |
26 | char _buffer_log[256];
27 | u32 __k1;
28 |
29 | int kwrite(const char *path, void *buffer, SceSize buflen) {
30 | int written = 0;
31 | SceUID file;
32 | //file = sceIoOpen(path, PSP_O_APPEND | PSP_O_CREAT | PSP_O_WRONLY, 0777);
33 | file = 1;
34 | if(file >= 0) {
35 | written = sceIoWrite(file, buffer, buflen);
36 | //sceIoClose(file);
37 | }
38 | return written;
39 | }
40 |
41 | #endif
42 |
--------------------------------------------------------------------------------
/divapatch/logger.h:
--------------------------------------------------------------------------------
1 | /*
2 | * MHP3patch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #ifndef LOGGER_H_
21 | #define LOGGER_H_
22 |
23 | #include
24 | #include
25 |
26 | #ifdef DEBUG
27 |
28 | #define LOGFILE "ms0:/divapatch.log"
29 |
30 | int sprintf(char *str, const char *format, ...);
31 |
32 | extern char _buffer_log[256];
33 | extern u32 __k1;
34 |
35 | int kwrite(const char *path, void *buffer, SceSize buflen);
36 |
37 | #define kprintf(format, ...) do { \
38 | __k1 = pspSdkSetK1(0); \
39 | sprintf(_buffer_log, "%s: "format, __func__, ## __VA_ARGS__); \
40 | kwrite(LOGFILE, _buffer_log, strlen(_buffer_log)); \
41 | pspSdkSetK1(__k1); \
42 | } while(0)
43 |
44 | int kwrite(const char *path, void *buffer, SceSize buflen);
45 |
46 | #else
47 |
48 | #define kprintf(format, ...)
49 | #define kwrite(a, b, c)
50 |
51 | #endif
52 |
53 | #endif /* LOGGER_H_ */
54 |
--------------------------------------------------------------------------------
/divapatch/main.c:
--------------------------------------------------------------------------------
1 | /*
2 | * divapatch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #include
21 | #include
22 | #include
23 | #include
24 | #include
25 | #include "pspdefs.h"
26 | #include "hook.h"
27 | #include "reader.h"
28 | #include "utility.h"
29 | #include "logger.h"
30 |
31 | #define PLUGIN_NAME "divapatch"
32 |
33 | PSP_MODULE_INFO(PLUGIN_NAME, PSP_MODULE_KERNEL, 0, 5);
34 | PSP_HEAP_SIZE_KB(0);
35 |
36 | #define GAME_MODULE "PdvApp"
37 | #define GAMEID_DIR "disc0:/UMD_DATA.BIN"
38 |
39 | #define ITEMSOF(arr) (int)(sizeof(arr) / sizeof(0[arr]))
40 |
41 | struct addr_data {
42 | void **addr;
43 | u32 offset;
44 | }__attribute__((packed));
45 |
46 | typedef struct {
47 | u32 nid;
48 | void *func;
49 | } stub;
50 |
51 | const char *diva_id[] = {
52 | "ULJM05472", // Project Diva
53 | "ULJM05681", // Project Diva 2nd
54 | "ULJM05933", // Project Diva Extend
55 | "NPJH50465", // Project Diva Extend
56 | "NPJH50475", // Project Diva 2nd Okaidoku Ban
57 | "ULJM05681", // Project Diva 2nd 1.01
58 | };
59 |
60 | const char *trans_files[] = {
61 | "diva1st_translation.bin",
62 | "diva2nd_translation.bin",
63 | "divaext_translation.bin",
64 | "divaext_translation.bin",
65 | "diva2nd#_translation.bin",
66 | "diva2nd101_translation.bin",
67 | };
68 |
69 | const char *embedded_files[] = {
70 | "diva1st_embedded.bin",
71 | "diva2nd_embedded.bin",
72 | "divaext_embedded.bin",
73 | "divaext_embedded.bin",
74 | "diva2nd#_embedded.bin",
75 | "diva2nd101_embedded.bin",
76 | };
77 |
78 | const stub stubs[] = {
79 | { 0x109F50BC, diva_open }, // sceIoOpen
80 | { 0x6A638D83, diva_read }, // sceIoRead
81 | { 0xA0B5A7C2, diva_aread }, // sceIoReadAsync
82 | { 0xE23EEC33, diva_wait }, // sceIoWaitAsync
83 | { 0x3251EA56, diva_poll }, // sceIoPollAsync
84 | { 0x35DBD746, diva_waitc }, // sceIoWaitAsyncCB
85 | { 0x810C4BC3, diva_close }, // sceIoClose
86 | };
87 |
88 | #ifdef UTILITY_HOOK
89 |
90 | const stub utility_stubs[] = {
91 | { 0x50C4CD57, diva_save }, // sceUtilitySavedataInitStart
92 | { 0xF6269B82, diva_osk }, // sceUtilityOskInitStart
93 | { 0x4DB1E739, diva_net }, // sceUtilityNetconfInitStart
94 | { 0x0251B134, diva_shot }, // sceUtilityScreenshotInitStart
95 | };
96 |
97 | #endif
98 |
99 | char filepath[256];
100 |
101 | static SceUID block_id = -1;
102 | static SceUID table_id = -1;
103 | static int patch_index = -1;
104 |
105 | static void *block_addr = NULL;
106 | static void *table_addr = NULL;
107 |
108 | static STMOD_HANDLER previous = NULL;
109 |
110 | static SceUID sema = 0;
111 |
112 | inline void DcacheWritebackAll(void) {
113 | __asm__ volatile("\
114 | .word 0x40088000; .word 0x24090800; .word 0x7D081180;\
115 | .word 0x01094804; .word 0x00004021; .word 0xBD140000;\
116 | .word 0xBD140000; .word 0x25080040; .word 0x1509FFFC;\
117 | .word 0x00000000; .word 0x0000000F; .word 0x00000000;\
118 | "::);
119 | }
120 |
121 | inline void IcacheClearAll(void) {
122 | __asm__ volatile("\
123 | .word 0x40088000; .word 0x24091000; .word 0x7D081240;\
124 | .word 0x01094804; .word 0x4080E000; .word 0x4080E800;\
125 | .word 0x00004021; .word 0xBD010000; .word 0xBD030000;\
126 | .word 0x25080040; .word 0x1509FFFC; .word 0x00000000;\
127 | "::);
128 | }
129 |
130 | /**
131 | * clears the instruction cache
132 | */
133 | void clear_caches(void) {
134 | IcacheClearAll();
135 | DcacheWritebackAll();
136 | }
137 |
138 | void patch_embedded() {
139 | u32 count;
140 | SceUID fd;
141 | SceSize size;
142 | SceSize index_size, table_size;
143 | SceUID embedded_id;
144 | void *embedded_addr;
145 |
146 | // use the plugin directory to load the patchfile from there
147 | strrchr(filepath, '/')[1] = 0;
148 | strcat(filepath, embedded_files[patch_index]);
149 |
150 | kprintf("trying to open %s\n", filepath);
151 | fd = sceIoOpen(filepath, PSP_O_RDONLY, 0777);
152 | if(fd < 0) {
153 | kprintf("%s not found\n", filepath);
154 | return;
155 | }
156 |
157 | // get the translation file size
158 | size = (SceSize)sceIoLseek(fd, 0, PSP_SEEK_END);
159 | sceIoLseek(fd, 0, PSP_SEEK_SET);
160 |
161 | embedded_id = sceKernelAllocPartitionMemory(PSP_MEMORY_PARTITION_KERNEL, "divatable", PSP_SMEM_Low, size, NULL);
162 | if(embedded_id < 0) {
163 | return;
164 | }
165 | embedded_addr = sceKernelGetBlockHeadAddr(embedded_id);
166 | kprintf("allocated table block at %08X\n", (u32)embedded_addr);
167 |
168 | // read the whole file
169 | sceIoLseek(fd, 0, PSP_SEEK_SET);
170 | sceIoRead(fd, embedded_addr, size);
171 | sceIoClose(fd);
172 |
173 | // get the number of entries in the translation file
174 | count = *(u32 *)embedded_addr;
175 |
176 | // calculate the index table size
177 | index_size = (count * 8) + 4;
178 | // and the padding (if any)
179 | index_size += 16 - (index_size % 16);
180 | // calculate the required size to hold all the translated strings (without the index table)
181 | table_size = size - index_size;
182 |
183 | kprintf("found %i strings to patch\n", count);
184 |
185 | for(u32 i = 0; i < count; i++) {
186 | struct addr_data *data;
187 |
188 | // get the current table pointer
189 | data = &((struct addr_data *)((char *)embedded_addr + 4))[i];
190 |
191 | // and calculate the address that is gonna have our string in memory
192 | void *final_addr = (void *)((u32)((char *)embedded_addr + index_size) + data->offset);
193 | //kprintf("using %08X as string address\n", (u32)final_addr);
194 |
195 | // skip null strings
196 | if(strcmp(final_addr, "NULL") != 0) {
197 | strcpy((char *)data->addr, final_addr);
198 | }
199 | }
200 | sceKernelFreePartitionMemory(embedded_id);
201 | kprintf("patching done\n");
202 | }
203 |
204 | void patch_eboot() {
205 | u32 count;
206 | SceUID fd;
207 | SceOff size;
208 | SceSize index_size, table_size;
209 |
210 | // use the plugin directory to load the patchfile from there
211 | strrchr(filepath, '/')[1] = 0;
212 | strcat(filepath, trans_files[patch_index]);
213 |
214 | kprintf("trying to open %s\n", filepath);
215 | fd = sceIoOpen(filepath, PSP_O_RDONLY, 0777);
216 | if(fd < 0) {
217 | kprintf("%s not found\n", filepath);
218 | return;
219 | }
220 |
221 | // get the translation file size
222 | size = sceIoLseek(fd, 0, PSP_SEEK_END);
223 | sceIoLseek(fd, 0, PSP_SEEK_SET);
224 |
225 | // get the number of entries in the translation file
226 | sceIoRead(fd, &count, 4);
227 |
228 | // calculate the index table size
229 | index_size = (count * 8) + 4;
230 | // and the padding (if any)
231 | index_size += 16 - (index_size % 16);
232 | // calculate the required size to hold all the translated strings (without the index table)
233 | table_size = (SceSize)size - index_size;
234 |
235 | // allocate the translated string block
236 | block_id = sceKernelAllocPartitionMemory(PSP_MEMORY_PARTITION_USER, "divatrans", PSP_SMEM_High, table_size, NULL);
237 | if(block_id < 0) {
238 | return;
239 | }
240 | block_addr = sceKernelGetBlockHeadAddr(block_id);
241 | kprintf("allocated block at %08X\n", (u32)block_addr);
242 |
243 | // read the translated strings
244 | sceIoLseek(fd, index_size, PSP_SEEK_SET);
245 | sceIoRead(fd, block_addr, table_size);
246 |
247 | // allocate the index table
248 | table_id = sceKernelAllocPartitionMemory(PSP_MEMORY_PARTITION_KERNEL, "divatable", PSP_SMEM_Low, count * 8, NULL);
249 | if(table_id < 0) {
250 | return;
251 | }
252 | table_addr = sceKernelGetBlockHeadAddr(table_id);
253 | kprintf("allocated table block at %08X\n", (u32)table_addr);
254 |
255 | // read the translated strings
256 | sceIoLseek(fd, 4, PSP_SEEK_SET);
257 | sceIoRead(fd, table_addr, count * 8);
258 |
259 | sceIoClose(fd);
260 |
261 | kprintf("found %i strings to patch\n", count);
262 |
263 | // lets process all the strings in the table
264 | for(u32 i = 0; i < count; i++) {
265 | struct addr_data *data;
266 |
267 | // get the current table pointer
268 | data = &((struct addr_data *)table_addr)[i];
269 |
270 | // and calculate the address that is gonna have our string in memory
271 | void *final_addr = (void *)((u32)(block_addr) + data->offset);
272 | //kprintf("using %08X as string address\n", (u32)final_addr);
273 |
274 | int half_patch = 0;
275 |
276 | // if the address was marked as "^x08XXXXXX" in the source file then lets
277 | // only make a lui patch with the upper address
278 | if(((u32)data->addr & 0xF0000000) == 0xE0000000) {
279 | half_patch = 1;
280 | // mark the last byte as "F" so it can pass the next "if" conditional
281 | data->addr = (void **)((u32)data->addr | (u32)0xF0000000);
282 |
283 | // if the address was marked as "$x08XXXXXX" in the source file then lets
284 | // only make patch with the lower address
285 | } else if(((u32)data->addr & 0xF0000000) == 0xD0000000) {
286 | half_patch = -1;
287 | // mark the last byte as "F" so it can pass the next "if" conditional
288 | data->addr = (void **)((u32)data->addr | (u32)0xF0000000);
289 | }
290 |
291 | // if the address was marked as "!x08000000" in the source file then lets
292 | // patch the lower address in the current instruction and the upper address
293 | // in the lui instruction above it
294 | if((u32)data->addr & 0xF0000000) {
295 | // clear our "F" marker
296 | data->addr = (void **)(((u32)data->addr) & ~0xF0000000);
297 | // and use "4" instead (0x4XXXXXXX == uncached access, not sure if this is necessary)
298 | data->addr = (void **)(((u32)data->addr) | 0x40000000);
299 |
300 | u16 *code_addr = (u16 *)data->addr;
301 |
302 | // split or string address into lower/upper components
303 | u16 addr1 = (u32)final_addr & 0xFFFF;
304 | u16 addr2 = (u16)((((u32)final_addr) >> 16) & 0xFFFF);
305 |
306 | // increase by one if the lower address part if more than 0x7FFF
307 | // (this is required when changing the address of an instruction)
308 | if(addr1 & 0x8000) {
309 | addr2++;
310 | }
311 |
312 | // if the patch was an upper-address only then patch the lui instruction
313 | // and continue
314 | if(half_patch > 0) {
315 | half_patch = 0;
316 | //kprintf("%02i) patching upper offset at addr: %08X with %04X\n", i, (u32)data.addr, addr2);
317 | *code_addr = addr2;
318 | continue;
319 | } else if(half_patch < 0) {
320 | half_patch = 0;
321 | //kprintf("%02i) patching lower offset at addr: %08X with %04X\n", i, (u32)data.addr, addr2);
322 | *code_addr = addr1;
323 | continue;
324 | }
325 |
326 | //kprintf("%02i) patching opcodes around addr: %08X\n", i, (u32)data.addr);
327 |
328 | // get the mips register number used in the instruction. That number is located at the
329 | // bit 16-21. Don't forget the endianess so we have to advance 2 bytes to position our
330 | // pointer corrently and do the extraction. We use this number in the backtracking phrase
331 | // so we don't patch the incorrect lui instrcution.
332 | u16 mips_reg = (*(code_addr + 1) >> 5) & 0x1F;
333 | //kprintf("using register number %i for lui search\n", mips_reg);
334 |
335 | int j = 0;
336 | //maximum backtrace to look for a lui instruction, lets check the above 32 instructions
337 | while(j < 32) {
338 |
339 | // extract out supposed lui instruction
340 | u16 lui = *(code_addr - 1 - (j*2));
341 | //kprintf("> checking %08X for lui: (%04X), regnum: %i\n", (u32)(code_addr - 1 - (j*2)), lui, (lui & 0x1F));
342 |
343 | // lets check if we have the lui instruction (0x3C) and it uses rhe same register number
344 | // than the instruction used in the lower address calculation
345 | if((lui & 0x3C00) == 0x3C00 && (lui & 0x1F) == mips_reg) { // lui
346 | //kprintf("> patching lower addr: %08X with %04X\n", (u32)code_addr, addr1);
347 | *code_addr = addr1;
348 | // advance the pointer to our matching lui and patch its upper address
349 | code_addr -= (2 + (j*2));
350 | //kprintf("> patching upper addr: %08X with %04X\n", (u32)code_addr, addr2);
351 | *code_addr = addr2;
352 | break;
353 | } else {
354 | j++;
355 | }
356 | }
357 | if(j >= 32) {
358 | kprintf("Backtrace failed, cannot find matching lui for %08X\n", (u32)data->addr);
359 | }
360 | } else {
361 | // the address to patch is in clear view so we don't have to do all crap above and
362 | // just overwrite the address
363 | data->addr = (void **)(((u32)data->addr) | 0x40000000);
364 | //kprintf("%02i) patching pointer at addr: %08X\n", i, (u32)data.addr);
365 | *data->addr = final_addr;
366 | }
367 | }
368 | sceKernelFreePartitionMemory(table_id);
369 | kprintf("patching done\n");
370 | }
371 |
372 | /**
373 | * Gets our gameid from the UMD disk (there is a function who returns that but sadly
374 | * not all CFW resolves that function NID).
375 | */
376 | int get_gameid(char *gameid) {
377 | SceUID fd = sceIoOpen(GAMEID_DIR, PSP_O_RDONLY, 0777);
378 | if (fd >= 0) {
379 | sceIoRead(fd, gameid, 10);
380 | sceIoClose(fd);
381 | // remove the "-" from the gameid
382 | if (gameid[4] == '-') {
383 | memmove(gameid + 4, gameid + 5, 5);
384 | }
385 | gameid[9] = '\0';
386 | }
387 | return fd;
388 | }
389 |
390 | int module_start_handler(SceModule2 * module) {
391 | // lets execute the previous start handlers first to give a chance
392 | // to nploader to complete its hooking phrase.
393 | int ret = previous ? previous(module) : 0;
394 |
395 | // tests if the module is usermode (skip all the kernel modules)
396 | if((module->text_addr & 0x80000000) != 0x80000000 && strcmp(module->modname, GAME_MODULE) == 0) {
397 | // game found, but since all versions use the same module name we need
398 | // to find out the correct game.
399 | kprintf("Project Diva found, loaded at %08X, data size: %08X, bss size: %08X\n", module->text_addr, module->data_size, module->bss_size);
400 | char gameid[16];
401 |
402 | if(get_gameid(gameid) >= 0) {
403 | kprintf("GAMEID: %s\n", gameid);
404 | for(int i = 0; i < ITEMSOF(diva_id); i++) {
405 | if(strcmp(gameid, diva_id[i]) == 0) {
406 | kprintf("found match: %i\n", i);
407 | patch_index = i;
408 | break;
409 | }
410 | }
411 | // Check if the game has been updated to 1.01 and change the index to use the diva2nd101 files
412 | if(patch_index == 1 && module->data_size == 0x0016887D && module->bss_size == 0x0003B860) {
413 | kprintf("Found Project Diva 2nd v1.01 eboot, changing patch index to use %s\n", diva_id[5]);
414 | patch_index = 5;
415 | }
416 |
417 | // valid gameid
418 | if(patch_index >= 0) {
419 | kprintf("patching embedded strings (overwrite)\n");
420 | patch_embedded();
421 | kprintf("patching string addresses (redirect)\n");
422 | patch_eboot();
423 | clear_caches();
424 | // wake up our main thread so it can hook the file i/o funcs of the game
425 | sceKernelSignalSema(sema, 1);
426 | }
427 | }
428 | }
429 | return ret;
430 | }
431 |
432 | /**
433 | * Patch the imports of the game eboot
434 | * @param module: module structure to have it hooked
435 | */
436 | void patch_imports(SceModule *module) {
437 | for (u32 i = 0; i < ITEMSOF(stubs); i++) {
438 | if(hook_import_bynid(module, "IoFileMgrForUser", stubs[i].nid, stubs[i].func, 1) < 0) {
439 | kprintf("Failed to hook %08X\n", stubs[i].nid);
440 | }
441 | }
442 | }
443 |
444 | #ifdef UTILITY_HOOK
445 |
446 | /**
447 | * Patch the imports of the game eboot (osk/net/save dialogs)
448 | * @param module: module structure to have it hooked
449 | */
450 | void patch_utility(SceModule *module) {
451 | for (u32 i = 0; i < ITEMSOF(utility_stubs); i++) {
452 | if(hook_import_bynid(module, "sceUtility", utility_stubs[i].nid, utility_stubs[i].func, 1) < 0) {
453 | kprintf("Failed to hook %08X\n", utility_stubs[i].nid);
454 | }
455 | }
456 | }
457 |
458 | void change_lang(int lang) {
459 | int button;
460 |
461 | sceImposeGetLanguageMode((int[]){0}, &button);
462 | sceImposeSetLanguageMode(lang, button);
463 | }
464 |
465 | #endif
466 |
467 | int thread_start(SceSize args, void *argp) {
468 | // save the plugin location
469 | strcpy(filepath, argp);
470 |
471 | // create a semaphore to know when the eboot patch is done
472 | sema = sceKernelCreateSema("divapatch_wake", 0, 0, 1, NULL);
473 |
474 | previous = sctrlHENSetStartModuleHandler(module_start_handler);
475 |
476 | // wait here until the patch is done
477 | sceKernelWaitSema(sema, 1, NULL);
478 |
479 | // load the image index table
480 | if(patch_index >= 0) {
481 | #ifdef UTILITY_HOOK
482 | // change the impose language
483 | change_lang(PSP_SYSTEMPARAM_LANGUAGE_ENGLISH);
484 | #endif
485 | SceModule *module = sceKernelFindModuleByName(GAME_MODULE);
486 | if(module) {
487 | #ifdef UTILITY_HOOK
488 | kprintf("patching utility funcs\n");
489 | patch_utility(module);
490 | #endif
491 | if(load_image_index(patch_index)) {
492 | // redirect the file open, read and close operations to our plugin
493 | kprintf("patching imports\n");
494 | patch_imports(module);
495 |
496 | // 0x333A34AE == nploader's np_open NID
497 | u32 func = sctrlHENFindFunction("nploader", "nploader", 0x333A34AE);
498 | if(func) {
499 | kprintf("nploader found, redirecting sceIoOpen to np_open: %08X\n", func);
500 | module = sceKernelFindModuleByName(PLUGIN_NAME);
501 | // 0x109F50BC == sceIoOpen NID
502 | if(hook_import_bynid(module, "IoFileMgrForKernel", 0x109F50BC, (void *)func, 0) < 0) {
503 | kprintf("Failed to hook %08X\n", 0x109F50BC);
504 | }
505 | }
506 | } else {
507 | kprintf("the image index wasn't found\n");
508 | }
509 | }
510 | }
511 | sceKernelDeleteSema(sema);
512 | return 0;
513 | }
514 |
515 | int module_start(SceSize args, void *argp) {
516 | SceUID thid = sceKernelCreateThread("divapatch_main", thread_start, 0x22, 0x2000, 0, NULL);
517 | if(thid >= 0) {
518 | sceKernelStartThread(thid, args, argp);
519 | }
520 | return 0;
521 | }
522 |
523 | int module_stop(SceSize args, void *argp) {
524 | if(block_id >= 0) {
525 | sceKernelFreePartitionMemory(block_id);
526 | }
527 | return 0;
528 | }
529 |
--------------------------------------------------------------------------------
/divapatch/pspdefs.h:
--------------------------------------------------------------------------------
1 | /*
2 | * divapatch module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #ifndef PSPDEFS_H_
21 | #define PSPDEFS_H_
22 |
23 | #include
24 |
25 | #define PSP_MEMORY_PARTITION_UMDCACHE 8
26 |
27 | #define PSP_MODEL_PHAT 0
28 | #define PSP_MODEL_SLIM 1
29 | #define PSP_MODEL_GO 4
30 |
31 | typedef struct SceModule2
32 | {
33 | struct SceModule2* next; //0, 0x00
34 | u16 attribute; //4, 0x04
35 | u8 version[2]; //6, 0x06
36 | char modname[27]; //8, 0x08
37 | char terminal; //35, 0x23
38 | u16 status; //36, 0x24 (Used in modulemgr for stage identification)
39 | u16 padding; //38, 0x26
40 | u32 unk_28; //40, 0x28
41 | SceUID modid; //44, 0x2C
42 | SceUID usermod_thid; //48, 0x30
43 | SceUID memid; //52, 0x34
44 | SceUID mpidtext; //56, 0x38
45 | SceUID mpiddata; //60, 0x3C
46 | void * ent_top; //64, 0x40
47 | u32 ent_size; //68, 0x44
48 | void * stub_top; //72, 0x48
49 | u32 stub_size; //76, 0x4C
50 | int (* module_start)(SceSize, void *); //80, 0x50
51 | int (* module_stop)(SceSize, void *); //84, 0x54
52 | int (* module_bootstart)(SceSize, void *); //88, 0x58
53 | int (* module_reboot_before)(void *); //92, 0x5C
54 | int (* module_reboot_phase)(SceSize, void *); //96, 0x60
55 | u32 entry_addr; //100, 0x64(seems to be used as a default address)
56 | u32 gp_value; //104, 0x68
57 | u32 text_addr; //108, 0x6C
58 | u32 text_size; //112, 0x70
59 | u32 data_size; //116, 0x74
60 | u32 bss_size; //120, 0x78
61 | u8 nsegment; //124, 0x7C
62 | u8 padding2[3]; //125, 0x7D
63 | u32 segmentaddr[4]; //128, 0x80
64 | u32 segmentsize[4]; //144, 0x90
65 | int module_start_thread_priority; //160, 0xA0
66 | SceSize module_start_thread_stacksize; //164, 0xA4
67 | SceUInt module_start_thread_attr; //168, 0xA8
68 | int module_stop_thread_priority; //172, 0xAC
69 | SceSize module_stop_thread_stacksize; //176, 0xB0
70 | SceUInt module_stop_thread_attr; //180, 0xB4
71 | int module_reboot_before_thread_priority; //184, 0xB8
72 | SceSize module_reboot_before_thread_stacksize; //188, 0xBC
73 | SceUInt module_reboot_before_thread_attr; //192, 0xC0
74 | } SceModule2;
75 |
76 | typedef int (* STMOD_HANDLER)(SceModule2 *);
77 |
78 | int sceKernelGetModel();
79 | char *sceKernelGetUMDData(void);
80 | unsigned int sceKernelQuerySystemCall(void * function);
81 | u32 sctrlHENFindFunction(const char *modname, const char *libname, u32 nid);
82 | STMOD_HANDLER sctrlHENSetStartModuleHandler(STMOD_HANDLER handler);
83 |
84 | #endif /* PSPDEFS_H_ */
85 |
--------------------------------------------------------------------------------
/divapatch/reader.c:
--------------------------------------------------------------------------------
1 | /*
2 | * divapatch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #include
21 | #include
22 | #include
23 | #include
24 | #include "search.h"
25 | #include "reader.h"
26 | #include "logger.h"
27 |
28 | #define ITEMSOF(arr) (int)(sizeof(arr) / sizeof(0[arr]))
29 |
30 | const char *cpk_pack[] = {
31 | "disc0:/PSP_GAME/USRDIR/media/afs/DivaDataList.afs",
32 | "disc0:/PSP_GAME/USRDIR/media/afs/Diva2Data.cpk",
33 | "disc0:/PSP_GAME/USRDIR/media/afs/Diva2ExData.cpk",
34 | "disc0:/PSP_GAME/USRDIR/media/afs/Diva2ExData.cpk",
35 | "disc0:/PSP_GAME/USRDIR/media/afs/Diva2Data.cpk",
36 | "disc0:/PSP_GAME/USRDIR/media/afs/Diva2Data.cpk",
37 | };
38 |
39 | const char *image_files[] = {
40 | "diva1st_images.bin",
41 | "diva2nd_images.bin",
42 | "divaext_images.bin",
43 | "divaext_images.bin",
44 | "diva2nd#_images.bin",
45 | "diva2nd_images.bin",
46 | };
47 |
48 | SceUID datafd;
49 | extern char filepath[256];
50 |
51 | static SceUID block_id;
52 | u32 cpk_count = 0;
53 | cpknode *cpk_table;
54 | char *image_filenames;
55 | const char *cpk_file;
56 | SceUID wait_fd = -1;
57 | SceSize wait_size;
58 |
59 | static SceUID open_file(const char *file) {
60 | int ret = -1;
61 | SceIoStat stat;
62 | char path[256];
63 |
64 | strcpy(path, filepath);
65 | strrchr(path, '/')[1] = 0;
66 | strcat(path, file);
67 | kprintf("trying to open %s\n", path);
68 | memset(&stat, 0, sizeof(stat));
69 | if(sceIoGetstat(path, &stat) >= 0) {
70 | ret = sceIoOpen(path, PSP_O_RDONLY, 0777);
71 | kprintf("got fd: %08X\n", ret);
72 | } else {
73 | kprintf("File not found\n");
74 | }
75 | return ret;
76 | }
77 |
78 | /**
79 | * load an image index table from the storage media
80 | * @param file_index - the filename array index to be used
81 | */
82 | int load_image_index(int file_index) {
83 | u32 index_size;
84 | void *block_addr;
85 |
86 | SceUID fd = open_file(image_files[file_index]);
87 | if(fd < 0) {
88 | return 0;
89 | }
90 |
91 | SceSize size = (SceSize)sceIoLseek(fd, 0, PSP_SEEK_END);
92 | sceIoLseek(fd, 0, PSP_SEEK_SET);
93 |
94 | kprintf("image index size: %i bytes\n", size);
95 | block_id = sceKernelAllocPartitionMemory(PSP_MEMORY_PARTITION_KERNEL, "diva_img", PSP_SMEM_High, size, NULL);
96 | if(block_id < 0) {
97 | kprintf("cannot allocate memory block\n");
98 | return 0;
99 | }
100 | block_addr = sceKernelGetBlockHeadAddr(block_id);
101 | kprintf("allocated memory block: %08X\n", (u32)block_addr);
102 |
103 | sceIoRead(fd, block_addr, size);
104 | sceIoClose(fd);
105 |
106 | cpk_count = *(u32 *)block_addr;
107 | kprintf("image entries: %i\n", cpk_count);
108 | cpk_table = (cpknode *)((u32)block_addr + 4);
109 | kprintf("cpk table addr: %08X\n", (u32)cpk_table);
110 |
111 | index_size = (cpk_count * 8) + 4;
112 | index_size += 16 - (index_size % 16);
113 | image_filenames = (char *)block_addr + index_size;
114 | kprintf("image filenames start: %08X\n", (u32)image_filenames);
115 |
116 | // save the correct cpk container to use
117 | cpk_file = cpk_pack[file_index];
118 | kprintf("Using %s as cpk file\n", cpk_file);
119 | return 1;
120 | }
121 |
122 | SceUID diva_open(const char *file, int flags, SceMode mode) {
123 | kprintf("opening %s\n", file);
124 | SceUID fd = sceIoOpen(file, flags, mode);
125 | if (fd >= 0) {
126 | // if the opened file is our cpk then lets save the file descriptor so
127 | // we can recognize it later
128 | if (strcmp(file, cpk_file) == 0) {
129 | kprintf("%s opened\n", cpk_file);
130 | datafd = fd;
131 | } else {
132 | kprintf("opened: %s, fd: %08X\n", file, fd);
133 | }
134 | }
135 | return fd;
136 | }
137 |
138 | int _diva_read(SceUID fd, void *data, SceSize size, int async) {
139 | u32 file_offset;
140 | cpknode *file_index;
141 | SceUID modfd;
142 | int res;
143 | u32 k1;
144 |
145 | if (fd == datafd) {
146 | // get the current file pointer
147 | file_offset = (u32)sceIoLseek(fd, 0, PSP_SEEK_CUR);
148 | // and find if the file part that the game is trying to read is in our list
149 | // of files to replace
150 | file_index = search_vector(file_offset, cpk_table, cpk_count);
151 | if(file_index != NULL) {
152 | kprintf("index found: %08X\n", *(u32 *)file_index);
153 | k1 = pspSdkSetK1(0);
154 | modfd = open_file(image_filenames + file_index->filename_offset);
155 | if(modfd >= 0) {
156 | sceIoLseek(modfd, file_offset - file_index->cpk_offset, PSP_SEEK_SET);
157 | kprintf("reading offset %08X, size: %08X\n", file_offset, size);
158 | // read our modified file instead, fooling the game
159 | res = async ? sceIoReadAsync(modfd, data, size) : sceIoRead(modfd, data, size);
160 | kprintf("read returned %08X\n", res);
161 | // make sure to return the read bytes that the game is expecting
162 | if(!async) {
163 | res = (int)size;
164 | sceIoClose(modfd);
165 | } else {
166 | wait_size = size;
167 | wait_fd = modfd;
168 | }
169 | // and advance the file pointer so we fully simulated that the read from the
170 | // cpk has been done
171 | sceIoLseek(fd, size, PSP_SEEK_CUR);
172 | pspSdkSetK1(k1);
173 | return res;
174 | }
175 | pspSdkSetK1(k1);
176 | }
177 | }
178 | kprintf("reading %i bytes from fd: %08X, offset: %08X, async: %i\n", size, fd, (u32)sceIoLseek(fd, 0, PSP_SEEK_CUR), async);
179 | return async ? sceIoReadAsync(fd, data, size) : sceIoRead(fd, data, size);
180 | }
181 |
182 | int diva_read(SceUID fd, void *data, SceSize size) {
183 | return _diva_read(fd, data, size, 0);
184 | }
185 |
186 | int diva_aread(SceUID fd, void *data, SceSize size) {
187 | return _diva_read(fd, data, size, 1);
188 | }
189 |
190 | int diva_wait(SceUID fd, SceInt64 *res) {
191 | int ret;
192 | u32 k1;
193 |
194 | if(wait_fd >= 0 && fd == datafd) {
195 | kprintf("waiting for fd: %08X\n", wait_fd);
196 | k1 = pspSdkSetK1(0);
197 | ret = sceIoWaitAsync(wait_fd, res);
198 | if(ret >= 0) {
199 | kprintf("Async read completed: %i bytes\n", (u32)*res);
200 | *res = wait_size;
201 | }
202 | sceIoClose(wait_fd);
203 | pspSdkSetK1(k1);
204 | wait_fd = -1;
205 | return ret;
206 | }
207 | return sceIoWaitAsync(fd, res);
208 | }
209 | int diva_poll(SceUID fd, SceInt64 *res) {
210 | int ret;
211 | u32 k1;
212 |
213 | if(wait_fd >= 0 && fd == datafd) {
214 | kprintf("polling for fd: %08X\n", wait_fd);
215 | k1 = pspSdkSetK1(0);
216 | ret = sceIoPollAsync(wait_fd, res);
217 | if(ret <= 0) {
218 | if(ret == 0) {
219 | kprintf("Async read completed: %i bytes\n", (u32)*res);
220 | *res = wait_size;
221 | } else {
222 | kprintf("polling error: %08X\n", ret);
223 | }
224 | sceIoClose(wait_fd);
225 | wait_fd = -1;
226 | } else {
227 | kprintf("poll result: %08X\n", ret);
228 | }
229 | pspSdkSetK1(k1);
230 | return ret;
231 | }
232 | return sceIoPollAsync(fd, res);
233 | }
234 | int diva_waitc(SceUID fd, SceInt64 *res) {
235 | int ret;
236 | u32 k1;
237 |
238 | if(wait_fd >= 0 && fd == datafd) {
239 | kprintf("waiting (CB) for fd: %08X\n", wait_fd);
240 | k1 = pspSdkSetK1(0);
241 | ret = sceIoWaitAsyncCB(wait_fd, res);
242 | if(ret >= 0) {
243 | kprintf("Async read completed: %i bytes\n", (u32)*res);
244 | *res = wait_size;
245 | }
246 | sceIoClose(wait_fd);
247 | wait_fd = -1;
248 | pspSdkSetK1(k1);
249 | return ret;
250 | }
251 | return sceIoWaitAsyncCB(fd, res);
252 | }
253 |
254 | int diva_close(SceUID fd) {
255 | if (fd == datafd) {
256 | // clear our file descriptor
257 | datafd = -1;
258 | kprintf("%s closed\n", cpk_file);
259 | } else {
260 | kprintf("closed fd: %08X\n", fd);
261 | }
262 | return sceIoClose(fd);
263 | }
264 |
--------------------------------------------------------------------------------
/divapatch/reader.h:
--------------------------------------------------------------------------------
1 | /*
2 | * MHP3patch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #ifndef SCEIO_H_
21 | #define SCEIO_H_
22 |
23 | #include
24 |
25 | typedef struct {
26 | u32 offset;
27 | u32 size;
28 | const char *filename;
29 | } node;
30 |
31 | typedef struct {
32 | u32 cpk_offset;
33 | u32 filename_offset;
34 | } cpknode;
35 |
36 | int load_image_index(int file_index);
37 | SceUID diva_open(const char *file, int flags, SceMode mode);
38 | int diva_read(SceUID fd, void *data, SceSize size);
39 | int diva_aread(SceUID fd, void *data, SceSize size);
40 | int diva_wait(SceUID fd, SceInt64 *res);
41 | int diva_poll(SceUID fd, SceInt64 *res);
42 | int diva_waitc(SceUID fd, SceInt64 *res);
43 | int diva_close(SceUID fd);
44 |
45 | #endif /* SCEIO_H_ */
46 |
--------------------------------------------------------------------------------
/divapatch/resources/diva1st_embedded.txt:
--------------------------------------------------------------------------------
1 | #Unlock requirements
2 | 0x08B70DD4 Condition1: ---
3 | 0x08B70DE8 Condition2: ---
4 |
5 | #LYRICS (MAX CHARS PER LINE: 40, or the game will freeze)
6 | #Love is war
7 | 0x08B27878 Mou Ikiba Ga Nai Wa Kono Koi no Netsuryo
8 | 0x08B278A1 Haiiro no Kumo Monokuro no Kensou
9 | 0x08B278CA Hizashi WaKageri YuugureWaIro WoKaeteIku
10 | 0x08B278F3 Aa Sekai Ga Nijinde
11 | 0x08B2791C Soredemo Suki De Irareru Ka Nante
12 | 0x08B27945 Wakatteru Kedo Dou Sureba Ii No
13 | 0x08B2796E Doushitara Dousureba
14 | 0x08B27997 Baka Da na Watashi...
15 | 0x08B279C0 Tatakau No Yo HATO Wo Ute
16 | 0x08B279E9 Shudan Nante Eranderarenai
17 | 0x08B27A12 SUKATO Hirari Mise Tsukeru No Yo
18 | 0x08B27A3B Kimi No Shisen Ubatte Miseru No
19 | 0x08B27A64 Geigeki YouiSenkyou Wa ImaDaFuriNanodesu
20 | 0x08B27A8D KoiWaMomokuKimiNoKuchizukeDeMeGaSameruNo
21 |
22 | #World is mine
23 | 0x08B27AB8 Sekai De Ichiban Ohimesama
24 | 0x08B27AE1 Sou Iu Atsukai Kokoro Ete Yo Ne
25 | 0x08B27B0A Sono Ichi
26 | 0x08B27B33 Itsumo To ChigauKamigataNiKigaTsuku Koto
27 | 0x08B27B5C Sono Ni
28 | 0x08B27B85 Chanto Kutsu Made Miru Koto, Ii Ne?
29 | 0x08B27BAE Sono San
30 | 0x08B27BD7 WatashiNoHitokotoNiWaMittsuNoKotobaDeHen
31 | 0x08B27C00 Wakattara Migite Ga Orusu Nano Wo
32 | 0x08B27C29 Nantoka Shite!
33 | 0x08B27C52 BetsuNi Wagamama Nante Itte Nai N Dakara
34 | 0x08B27C7B Kimi Ni Kokoro Kara Omotte Hoshii No
35 | 0x08B27CA4 Kawaii Tte
36 | 0x08B27CCD Sekai De Ichiban Ohimesama
37 | 0x08B27CF6 Ki Ga Tsuite Nee Nee
38 | 0x08B27D1F Mataseru Nante Rongai Yo
39 | 0x08B27D48 Watashi Wo Dare Da To Omotteru No?
40 | 0x08B27D71 Mou Nandaka Amaimono Ga Tabetai!
41 | 0x08B27D9A Ima Sugu Ni Yo
42 | 0x08B27DC3 Ichigo No Notta SHOTOKEKII
43 | 0x08B27DEC Kodawari Tamago No Torokeru Purin
44 | 0x08B27E15 Minna, Minna Gaman Shimasu...
45 | 0x08B27E3E Wagamama Na Ko Dato Omowanai De
46 | 0x08B27E67 Watashi Datte Yareba Dekiru Mon
47 | 0x08B27E90 Ato De Koukai Suru Wa Yo
48 | 0x08B27EB9 Touzen Desu! Datte Watashi Wa
49 | 0x08B27EE2 Sekai De Ichiban Ohimesama
50 | 0x08B27F0B Chanto Mitete Yone
51 | 0x08B27F34 Dokoka Ni Icchau Yo?
52 | 0x08B27F5D Fui Ni Dakishimerareta
53 | 0x08B27F86 Kyuu Ni Sonna! Eh?
54 | 0x08B27FAF "Hikareru Abunai Yo"
55 | 0x08B27FD8 Sou Itte Soppo Muku Kimi
56 | 0x08B28001 ...Kocchi No Ga Abunai Wa Yo
57 |
58 | #Sono Ichibyo Slow Motion
59 | 0x08B2802C Nagai Nagai Kudarizaka
60 | 0x08B28055 Neguse Wo Tsuketa Watashi
61 | 0x08B2807E Kakeashi De Korobanai You Ni
62 | 0x08B280A7 Ma Ni Ae Itsumo No BASU
63 | 0x08B280D0 Iki Wo Kirasete Hashiru
64 | 0x08B280F9 Kinou No Ame Mizutatmari Wo Yokete
65 | 0x08B28122 Oroshitate No Kutsu Wo Yogosanai You Ni
66 | 0x08B2814B Ki Wo Tsukete Tonda
67 | 0x08B28174 Agaru Mizu Shibuki, Nami Butsu Kumo
68 | 0x08B2819D Butsukaru Furimuku Kimi
69 | 0x08B281C6 SURO-MO-SHON
70 | 0x08B281EF Shougeki Ga Kakenukete Iku
71 | 0x08B28218 Hoppe Wo Tsuneru
72 | 0x08B28241 Ochikiite...Maiagaranaide...
73 | 0x08B2826A Tomaranai Doki Doki
74 | 0x08B28293 SUPIDO Ageru Shinsou No Oto
75 | 0x08B282BC Kimi Wa Aruku
76 | 0x08B282E5 Omowazu Ushiro Kara SHATSU WoHippatteita
77 | 0x08B2830E Hitosuji No Kaze Ki No Ha Wo Yurashite
78 | 0x08B28337 Ametsuyu Ga Atama Ni Parari ToFurikakaru
79 | 0x08B28360 Watashi Wa Miageru
80 | 0x08B28389 Massugu Ni Kimi No Hitomi Wo Miru
81 | 0x08B283B2 Kore Wa Koi Nan Desu Ka
82 | 0x08B283DB Kono Kimochi Ni Ki Ga Tsukarenai You Ni
83 | 0x08B28404 Awatete Atozusari Shinagara
84 | 0x08B2842D "Nandemo Nai Desu!"
85 | 0x08B28456 Mazui...Bareta...?
86 | 0x08B2847F Onegai Ki Ga Tsukanaide
87 | 0x08B284A8 SURO-MO-SHON
88 | 0x08B284D1 Mimi Made Akaku Somaru Dou Shiyou
89 | 0x08B284FA Okoranaide Haya Aruki De SakiNi Ikanaide
90 | 0x08B28523 Ato O Oikakeru
91 | 0x08B2854C Teiryuujo Kara BASU Ga Hashitte Iku
92 | 0x08B28575"Ah ah, Chikoku..."
93 | 0x08B2859E Tossa Ni"Hai!"Tte Genki Yoku Henji Shita
94 | 0x08B285C7 Ureshii
95 |
96 | #Hinekuremono
97 | 0x08B285F0 Itsumo Nakushite KaraKoukai Shite NakuNo
98 | 0x08B28619 Naitara Wasurerareru Kara
99 | 0x08B28642 Okiniiri No Mono Nante
100 | 0x08B2866B Sou Taishita Mono Ja Nai
101 | 0x08B28694 Senobi Shite Te Ni Ireta Kotae
102 | 0x08B286BD Hontou Wa Wakaranakute
103 | 0x08B286E6 Asa No Hikari Ga Terashidasu Koro
104 | 0x08B2870F Hattoshite Me Ga Sameru No
105 | 0x08B28738 Koko Ni Ite Hanarenaide
106 | 0x08B28761 Kuchi Ni Dekinai Watashi Wa
107 | 0x08B2878A Sokkenai Henji Wo Kurikaesu
108 | 0x08B287B3 Doko Ni Mo Mou Ikanaide
109 | 0x08B287DC Muashiku Kokoro De Sakebu
110 | 0x08B28805 Tsutaetai No Ni
111 | 0x08B2882E Nani Wo Nakushite
112 | 0x08B28857 Nani Wo Etan Darou
113 | 0x08B28880 Ima Ni Natte Yatto Wakatta
114 |
--------------------------------------------------------------------------------
/divapatch/resources/diva1st_translation.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/diva1st_translation.txt
--------------------------------------------------------------------------------
/divapatch/resources/diva2nd#_translation.txt:
--------------------------------------------------------------------------------
1 | # Translation file for Project Diva 2nd Okaidoku Ban (use shift-jis to edit the file)
2 | # 0x08xxxxxx: use this format to rewrite the pointed address
3 | # to a newly allocated one for the translation.
4 | # !x08xxxxxx: use this type of format if the address to modify
5 | # is embedded inside a instruction (use the lower
6 | # address part of the instruction for the address).
7 | # ^x08xxxxxx: use this type of format if the address to modify
8 | # is embedded inside a instruction and you only need
9 | # to patch the upper address (the lui is behind many
10 | # branch instructions).
11 | # $x08xxxxxx: use this type of format if the address to modify
12 | # is embedded inside a instruction and you only need
13 | # to patch the lower address
14 |
15 | # Main menu
16 |
17 | !x088D47D8 Rhythm Game
18 | !x088D47E4 Character Select
19 | !x088D47F0 DIVA Room
20 | !x088D47FC Shop
21 | !x088D4808 Play Records
22 | !x088D4814 Edit
23 | !x088D4820 Ad Hoc
24 | !x088D482C Options
25 | !x088D4838 Save
26 | !x088D4844 Back to Title
27 |
--------------------------------------------------------------------------------
/divapatch/resources/diva2nd101_translation.txt:
--------------------------------------------------------------------------------
1 | # Translation file for Project Diva 2nd (v1.01) (use shift-jis to edit the file)
2 | # 0x08xxxxxx: use this format to rewrite the pointed address
3 | # to a newly allocated one for the translation.
4 | # !x08xxxxxx: use this type of format if the address to modify
5 | # is embedded inside a instruction (use the lower
6 | # address part of the instruction for the address).
7 | # ^x08xxxxxx: use this type of format if the address to modify
8 | # is embedded inside a instruction and you only need
9 | # to patch the upper address (the lui is behind many
10 | # branch instructions).
11 | # $x08xxxxxx: use this type of format if the address to modify
12 | # is embedded inside a instruction and you only need
13 | # to patch the lower address
14 |
15 | # Main menu
16 |
17 | !x088D4AE0 Rhythm Game
18 | !x088D4AEC Character Select
19 | !x088D4AF8 DIVA Room
20 | !x088D4B04 Shop
21 | !x088D4B10 Play Records
22 | !x088D4B1C Edit
23 | !x088D4B28 Ad Hoc
24 | !x088D4B34 Options
25 | !x088D4B40 Save
26 | !x088D4B4C Back to Title
27 |
--------------------------------------------------------------------------------
/divapatch/resources/diva2nd_images.txt:
--------------------------------------------------------------------------------
1 | # Image index table file for Project Diva
2 | # Use the format to override the files in DivaDataList.afs
3 |
4 | 0x000B0004 diva2nd/menu_basic.png
5 |
--------------------------------------------------------------------------------
/divapatch/resources/diva2nd_translation.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/diva2nd_translation.txt
--------------------------------------------------------------------------------
/divapatch/resources/divaext_embedded.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/divaext_embedded.txt
--------------------------------------------------------------------------------
/divapatch/resources/divaext_embedded_base.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/divaext_embedded_base.txt
--------------------------------------------------------------------------------
/divapatch/resources/divaext_embedded_english.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/divaext_embedded_english.txt
--------------------------------------------------------------------------------
/divapatch/resources/divaext_translation.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/divaext_translation.txt
--------------------------------------------------------------------------------
/divapatch/resources/divaext_translation_base.txt:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/codestation/prxpatch/461fcee8906b887d52d0db4f2863aa2dd5447834/divapatch/resources/divaext_translation_base.txt
--------------------------------------------------------------------------------
/divapatch/search.c:
--------------------------------------------------------------------------------
1 | /*
2 | * MHP3patch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #include "search.h"
21 |
22 | /**
23 | * modified binary search function that only works on node arrays
24 | * @param value value to search in the array
25 | * @param vector array to make the search
26 | * @param lim number of elements in the array
27 | * @returns the address of the found value in the array, else NULL
28 | */
29 | cpknode *search_vector(u32 value, cpknode *vector, u32 lim) {
30 | u32 idx;
31 | u32 count = lim;
32 | if(vector) {
33 | while(lim) {
34 | idx = lim >> 1;
35 | if(value >= vector[idx].cpk_offset) {
36 | if(value > vector[idx].cpk_offset && (idx+1 > count || value >= vector[idx+1].cpk_offset)) {
37 | vector += idx + 1;
38 | lim--;
39 | } else {
40 | return vector + idx;
41 | }
42 | }
43 | lim >>= 1;
44 | }
45 | }
46 | return NULL;
47 | }
48 |
--------------------------------------------------------------------------------
/divapatch/search.h:
--------------------------------------------------------------------------------
1 | /*
2 | * divapatch kernel module
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #ifndef SEARCH_H_
21 | #define SEARCH_H_
22 |
23 | #include
24 | #include "reader.h"
25 |
26 | cpknode *search_vector(u32 value, cpknode *vector, u32 lim);
27 |
28 | #endif /* SEARCH_H_ */
29 |
--------------------------------------------------------------------------------
/divapatch/util/Makefile:
--------------------------------------------------------------------------------
1 | CC := gcc
2 | CXX := g++
3 | TARGET := divaconvert
4 | TARGET2 := divaextract
5 | LIBS :=
6 | INCLUDES :=
7 | LIBPATH :=
8 | WARN_FLAGS=-Wall -Wextra -Wfloat-equal -Wundef -Wshadow -Wpointer-arith -Wcast-align -Wwrite-strings -Wconversion -Wunreachable-code
9 | CFLAGS := -O2 -pipe -Wno-unused-result -std=c99 $(WARN_FLAGS)
10 | CXXFLAGS := -O2 -pipe -Wno-unused-result $(WARN_FLAGS)
11 | LDFLAGS := -Wl,-O1 -Wl,--sort-common -Wl,--as-needed
12 | RM = rm -f
13 | OBJS = convert.o
14 | OBJS2 = extract.o
15 |
16 | all: $(OBJS) $(OBJS2)
17 | @$(CXX) $(LDFLAGS) $(OBJS) $(LIBPATH) $(LIBS) -o $(TARGET)
18 | @$(CC) $(LDFLAGS) $(OBJS2) $(LIBPATH) $(LIBS) -o $(TARGET2)
19 | @echo LINK $(TARGET)
20 | @echo LINK $(TARGET2)
21 |
22 | .cpp.o:
23 | @$(CXX) $(CXXFLAGS) $(INCLUDES) -c $*.cpp
24 | @echo CXX $*.cpp
25 |
26 | .c.o:
27 | @$(CC) $(CFLAGS) $(INCLUDES) -c $*.c
28 | @echo CC $*.c
29 |
30 | clean:
31 | @-$(RM) $(OBJS) $(TARGET)
32 | @-$(RM) $(OBJS2) $(TARGET2)
33 | @echo CLEAN $(TARGET)
34 | @echo CLEAN $(TARGET2)
35 |
36 | .PHONY: all clean
37 |
--------------------------------------------------------------------------------
/divapatch/util/Makefile.win32:
--------------------------------------------------------------------------------
1 | CC := i686-pc-mingw32-gcc
2 | CXX := i686-pc-mingw32-g++
3 | TARGET := divaconvert.exe
4 | TARGET2 := divaextract.exe
5 | LIBS :=
6 | INCLUDES :=
7 | LIBPATH :=
8 | WARN_FLAGS=-Wall -Wextra -Wfloat-equal -Wundef -Wshadow -Wpointer-arith -Wcast-align -Wwrite-strings -Wconversion -Wunreachable-code
9 | CFLAGS := -O2 -pipe -Wno-unused-result -std=c99 $(WARN_FLAGS)
10 | CXXFLAGS := -O2 -pipe -Wno-unused-result $(WARN_FLAGS)
11 | LDFLAGS := -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -static-libstdc++ -static-libgcc
12 | RM = rm -f
13 | OBJS = convert.o
14 | OBJS2 = extract.o
15 |
16 | all: $(OBJS) $(OBJS2)
17 | @$(CXX) $(LDFLAGS) $(OBJS) $(LIBPATH) $(LIBS) -o $(TARGET)
18 | @$(CC) $(LDFLAGS) $(OBJS2) $(LIBPATH) $(LIBS) -o $(TARGET2)
19 | @echo LINK $(TARGET)
20 | @echo LINK $(TARGET2)
21 |
22 | .cpp.o:
23 | @$(CXX) $(CXXFLAGS) $(INCLUDES) -c $*.cpp
24 | @echo CXX $*.cpp
25 |
26 | .c.o:
27 | @$(CC) $(CFLAGS) $(INCLUDES) -c $*.c
28 | @echo CC $*.c
29 |
30 | clean:
31 | @-$(RM) $(OBJS) $(TARGET)
32 | @-$(RM) $(OBJS2) $(TARGET2)
33 | @echo CLEAN $(TARGET)
34 | @echo CLEAN $(TARGET2)
35 |
36 | .PHONY: all clean
37 |
--------------------------------------------------------------------------------
/divapatch/util/convert.cpp:
--------------------------------------------------------------------------------
1 | /*
2 | * PJD2Patch patch utilily
3 | *
4 | * Copyright (C) 2011 Codestation
5 | *
6 | * This program 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 | * This program 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 this program. If not, see .
18 | */
19 |
20 | #include
21 | #include
22 | #include
23 | #include
24 |
25 | #include