├── .gitignore ├── COPYING ├── COPYING.LESSER ├── README.md ├── build.zig ├── build.zig.zon ├── shell.nix ├── src ├── ee │ ├── c.h │ └── main.zig └── iop │ ├── exports.tab │ ├── hello.zig │ ├── imports.lst │ └── irx_imports.h ├── tools └── irx_cgen.zig ├── zig └── zls /.gitignore: -------------------------------------------------------------------------------- 1 | .zig-cache/ 2 | zig-out/ 3 | build/ 4 | build-*/ 5 | docgen_tmp/ 6 | .idea/ -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /COPYING.LESSER: -------------------------------------------------------------------------------- 1 | GNU LESSER 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 | 9 | This version of the GNU Lesser General Public License incorporates 10 | the terms and conditions of version 3 of the GNU General Public 11 | License, supplemented by the additional permissions listed below. 12 | 13 | 0. Additional Definitions. 14 | 15 | As used herein, "this License" refers to version 3 of the GNU Lesser 16 | General Public License, and the "GNU GPL" refers to version 3 of the GNU 17 | General Public License. 18 | 19 | "The Library" refers to a covered work governed by this License, 20 | other than an Application or a Combined Work as defined below. 21 | 22 | An "Application" is any work that makes use of an interface provided 23 | by the Library, but which is not otherwise based on the Library. 24 | Defining a subclass of a class defined by the Library is deemed a mode 25 | of using an interface provided by the Library. 26 | 27 | A "Combined Work" is a work produced by combining or linking an 28 | Application with the Library. The particular version of the Library 29 | with which the Combined Work was made is also called the "Linked 30 | Version". 31 | 32 | The "Minimal Corresponding Source" for a Combined Work means the 33 | Corresponding Source for the Combined Work, excluding any source code 34 | for portions of the Combined Work that, considered in isolation, are 35 | based on the Application, and not on the Linked Version. 36 | 37 | The "Corresponding Application Code" for a Combined Work means the 38 | object code and/or source code for the Application, including any data 39 | and utility programs needed for reproducing the Combined Work from the 40 | Application, but excluding the System Libraries of the Combined Work. 41 | 42 | 1. Exception to Section 3 of the GNU GPL. 43 | 44 | You may convey a covered work under sections 3 and 4 of this License 45 | without being bound by section 3 of the GNU GPL. 46 | 47 | 2. Conveying Modified Versions. 48 | 49 | If you modify a copy of the Library, and, in your modifications, a 50 | facility refers to a function or data to be supplied by an Application 51 | that uses the facility (other than as an argument passed when the 52 | facility is invoked), then you may convey a copy of the modified 53 | version: 54 | 55 | a) under this License, provided that you make a good faith effort to 56 | ensure that, in the event an Application does not supply the 57 | function or data, the facility still operates, and performs 58 | whatever part of its purpose remains meaningful, or 59 | 60 | b) under the GNU GPL, with none of the additional permissions of 61 | this License applicable to that copy. 62 | 63 | 3. Object Code Incorporating Material from Library Header Files. 64 | 65 | The object code form of an Application may incorporate material from 66 | a header file that is part of the Library. You may convey such object 67 | code under terms of your choice, provided that, if the incorporated 68 | material is not limited to numerical parameters, data structure 69 | layouts and accessors, or small macros, inline functions and templates 70 | (ten or fewer lines in length), you do both of the following: 71 | 72 | a) Give prominent notice with each copy of the object code that the 73 | Library is used in it and that the Library and its use are 74 | covered by this License. 75 | 76 | b) Accompany the object code with a copy of the GNU GPL and this license 77 | document. 78 | 79 | 4. Combined Works. 80 | 81 | You may convey a Combined Work under terms of your choice that, 82 | taken together, effectively do not restrict modification of the 83 | portions of the Library contained in the Combined Work and reverse 84 | engineering for debugging such modifications, if you also do each of 85 | the following: 86 | 87 | a) Give prominent notice with each copy of the Combined Work that 88 | the Library is used in it and that the Library and its use are 89 | covered by this License. 90 | 91 | b) Accompany the Combined Work with a copy of the GNU GPL and this license 92 | document. 93 | 94 | c) For a Combined Work that displays copyright notices during 95 | execution, include the copyright notice for the Library among 96 | these notices, as well as a reference directing the user to the 97 | copies of the GNU GPL and this license document. 98 | 99 | d) Do one of the following: 100 | 101 | 0) Convey the Minimal Corresponding Source under the terms of this 102 | License, and the Corresponding Application Code in a form 103 | suitable for, and under terms that permit, the user to 104 | recombine or relink the Application with a modified version of 105 | the Linked Version to produce a modified Combined Work, in the 106 | manner specified by section 6 of the GNU GPL for conveying 107 | Corresponding Source. 108 | 109 | 1) Use a suitable shared library mechanism for linking with the 110 | Library. A suitable mechanism is one that (a) uses at run time 111 | a copy of the Library already present on the user's computer 112 | system, and (b) will operate properly with a modified version 113 | of the Library that is interface-compatible with the Linked 114 | Version. 115 | 116 | e) Provide Installation Information, but only if you would otherwise 117 | be required to provide such information under section 6 of the 118 | GNU GPL, and only to the extent that such information is 119 | necessary to install and execute a modified version of the 120 | Combined Work produced by recombining or relinking the 121 | Application with a modified version of the Linked Version. (If 122 | you use option 4d0, the Installation Information must accompany 123 | the Minimal Corresponding Source and Corresponding Application 124 | Code. If you use option 4d1, you must provide the Installation 125 | Information in the manner specified by section 6 of the GNU GPL 126 | for conveying Corresponding Source.) 127 | 128 | 5. Combined Libraries. 129 | 130 | You may place library facilities that are a work based on the 131 | Library side by side in a single library together with other library 132 | facilities that are not Applications and are not covered by this 133 | License, and convey such a combined library under terms of your 134 | choice, if you do both of the following: 135 | 136 | a) Accompany the combined library with a copy of the same work based 137 | on the Library, uncombined with any other library facilities, 138 | conveyed under the terms of this License. 139 | 140 | b) Give prominent notice with the combined library that part of it 141 | is a work based on the Library, and explaining where to find the 142 | accompanying uncombined form of the same work. 143 | 144 | 6. Revised Versions of the GNU Lesser General Public License. 145 | 146 | The Free Software Foundation may publish revised and/or new versions 147 | of the GNU Lesser General Public License from time to time. Such new 148 | versions will be similar in spirit to the present version, but may 149 | differ in detail to address new problems or concerns. 150 | 151 | Each version is given a distinguishing version number. If the 152 | Library as you received it specifies that a certain numbered version 153 | of the GNU Lesser General Public License "or any later version" 154 | applies to it, you have the option of following the terms and 155 | conditions either of that published version or of any later version 156 | published by the Free Software Foundation. If the Library as you 157 | received it does not specify a version number of the GNU Lesser 158 | General Public License, you may choose any version of the GNU Lesser 159 | General Public License ever published by the Free Software Foundation. 160 | 161 | If the Library as you received it specifies that a proxy can decide 162 | whether future versions of the GNU Lesser General Public License shall 163 | apply, that proxy's public statement of acceptance of any version is 164 | permanent authorization for you to choose that version for the 165 | Library. 166 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # ZigStation 2 2 | 3 | An experimental project for compiling zig for the PlayStation 2, using the [PS2DEV](https://github.com/ps2dev/ps2dev) 4 | toolchain and [PS2SDK](https://github.com/ps2dev/ps2sdk). 5 | 6 | ## Requirements 7 | 8 | - Zig 0.14.0 (tested with `0.14.0-dev.839+a931bfada`) 9 | - PS2SDK and PS2DEV environment variables with a relatively recent build of the toolchain (`mips64r5900el-ps2-elf-gcc` works, `ee-gcc` doesn't) 10 | 11 | ## Tested on 12 | 13 | - compiled EE code has been tested on: 14 | - pcsx2 2.0 (working) 15 | - SCPH-75004 (working) 16 | 17 | - compiled IOP code has been tested on: 18 | - SCPH-75004 (working) 19 | 20 | Planned testing: 21 | 22 | - SCPH-70004, primarily due to the original IOP. 23 | 24 | I don't have any other PS2 models on hand, but feel free to test the example elf file this repo compiles on your own consoles, 25 | and please report back whether it works on not! 26 | 27 | ## Limitations 28 | 29 | PS2DEV declares a custom target called `mips64r5900el-ps2-elf`, and this cannot be compiled by Zig's LLVM backend. 30 | Due to this, the zig target has been set to `mipsel-freestanding-c`, which translates the zig code to C as if it was 31 | compiling for a plain mipsel cpu without any ABI, and then the buildscript passes this generated C code to ps2dev's gcc. 32 | 33 | The main issue with this is that any POSIX functionality in zig's standard library doesn't work (POSIX error type is 34 | `void` on freestanding), this includes most logging utilities, std.Thread (even though pthreads *is* available in PS2DEV). 35 | 36 | ## Contents 37 | 38 | - `build.zig` - Contains an example buildscript that invokes the PS2DEV gcc compiler for compiling and linking 39 | - `src/c.h` - Separate C header file with the imports. The buildscript converts this to zig, and then adds it as an import. 40 | The reason for doing it like this instead of @cImport is that `zls` is unaware of the PS2SDK system imports, and this 41 | also reduces compile times a bit when changing zig code only (cImports don't need to be re-evaluated) 42 | - `src/main.zig` - An example code that can run on the ps2 once compiled. I will frequently modify this file, so it will 43 | do different things depending on which commit you're on. 44 | - `shell.nix` - For NixOS users. A shell with the PS2DEV and PS2SDK env vars, and an FHS with the PS2DEV dependencies. 45 | You probably have your own already if you got this far. 46 | - `zls` - Also for NixOS users. Launches the `zls` executable from PATH inside the `shell.nix` file's FHS. 47 | - `zig` - Ditto, runs `zig` in the same FHS as the `zls` one. 48 | 49 | ## Future goals 50 | 51 | - Encapsulate the mess in build.zig to a standalone module which can be imported via build.zig.zon 52 | - Create a patchset for the zig standard library for the PS2DEV ABI 53 | - (maybe?) upstream a `ps2dev` OS target/abi to zig. Object file generation still unsupported (it's in LLVM), only C 54 | backend is targeted for now. 55 | - Abstraction layers to hide the raw C code mess 56 | - DMA demo that works with the vector units to make a spinny cube using said abstraction layer 57 | 58 | ## License 59 | Plain old LGPL3.0 for now, see `COPYING` and `COPYING.LESSER`. 60 | 61 | ## Contributing 62 | Feel free to contribute any improvements, cleanups, abstraction layers, etc. (really just whatever you want, this project 63 | is still very new and I don't really have a precise goal aside from "zig on PS2") 64 | 65 | ## Community 66 | At the moment i'm only really active about ps2 zig programming in the [PS2 Scene](https://discord.gg/Uz8p9bJ6za) 67 | discord server's `#other-language-dev` channel. You can hop in there to see my insane ramblings i guess. -------------------------------------------------------------------------------- /build.zig: -------------------------------------------------------------------------------- 1 | const std = @import("std"); 2 | 3 | pub fn build(b: *std.Build) !void { 4 | const target_ee = Processor.ee.target(); 5 | const target_iop = Processor.iop.target(); 6 | const optimize_ee = processorOptimizeOptions(b, .ee, .safe); 7 | const optimize_iop = processorOptimizeOptions(b, .iop, .fast); 8 | 9 | const ps2 = try Toolchain.fromEnv(b); 10 | 11 | const pipeline_iop = ps2.buildIOPBinary( 12 | b, 13 | Toolchain.IOPParams.fromDir(b, b.path("src/iop")), 14 | .{ 15 | .name = "hello", 16 | .root_source_file = b.path("src/iop/hello.zig"), 17 | .target = target_iop, 18 | .optimize = optimize_iop, 19 | .link_libc = true, 20 | }, 21 | ); 22 | 23 | var pipeline_ee = ps2.buildEEBinary(b, .{ 24 | .name = "example", 25 | .root_source_file = b.path("src/ee/main.zig"), 26 | .target = target_ee, 27 | .optimize = optimize_ee, 28 | .link_libc = true, 29 | }); 30 | 31 | const translate_c_ee = ps2.createTranslateC(b, .ee, b.path("src/ee/c.h"), optimize_ee); 32 | translate_c_ee.addIncludeDir(ps2.extras.gsKit.include); 33 | 34 | pipeline_ee.rootModule().addImport("c_ee", translate_c_ee.createModule()); 35 | 36 | pipeline_ee.addLibDir(ps2.extras.gsKit.resolve(b, "lib")); 37 | pipeline_ee.link(&.{ "debug", "atomic", "gskit", "dmakit" }); 38 | 39 | const stripped_elf = ps2.stripElf(b, .ee, optimize_ee, pipeline_ee.output_file); 40 | 41 | const install = b.getInstallStep(); 42 | install.dependOn(&b.addInstallFileWithDir(stripped_elf, .bin, "example.elf").step); 43 | install.dependOn(&b.addInstallFileWithDir(pipeline_iop.output_file, .bin, "hello.irx").step); 44 | } 45 | 46 | fn processorOptimizeOptions(b: *std.Build, proc: Processor, default: std.Build.ReleaseMode) std.builtin.OptimizeMode { 47 | if (b.option( 48 | std.builtin.OptimizeMode, 49 | b.fmt("optimize_{s}", .{@tagName(proc)}), 50 | b.fmt("Prioritize performance, safety, or binary size for the {s}", .{proc.friendlyName()}), 51 | )) |mode| { 52 | return mode; 53 | } 54 | 55 | return switch (default) { 56 | .fast => .ReleaseFast, 57 | .safe => .ReleaseSafe, 58 | .small => .ReleaseSmall, 59 | else => .Debug, 60 | }; 61 | } 62 | 63 | const Processor = enum { 64 | ee, 65 | iop, 66 | 67 | pub fn ext(self: Processor) []const u8 { 68 | return switch (self) { 69 | .ee => "elf", 70 | .iop => "irx", 71 | }; 72 | } 73 | 74 | pub fn friendlyName(self: Processor) []const u8 { 75 | return switch (self) { 76 | .ee => "Emotion Engine", 77 | .iop => "I/O processor", 78 | }; 79 | } 80 | 81 | pub fn macro(self: Processor) []const u8 { 82 | return switch (self) { 83 | .ee => "_EE", 84 | .iop => "_IOP", 85 | }; 86 | } 87 | 88 | pub fn toolPrefix(self: Processor) []const u8 { 89 | return switch (self) { 90 | .ee => "mips64r5900el-ps2-elf", 91 | .iop => "mipsel-ps2-irx", 92 | }; 93 | } 94 | 95 | pub fn suffix(self: Processor) []const u8 { 96 | return @tagName(self); 97 | } 98 | 99 | pub fn target(self: Processor) std.Build.ResolvedTarget { 100 | return switch (self) { 101 | .ee => ee_target.get(), 102 | .iop => iop_target.get(), 103 | }; 104 | } 105 | 106 | pub fn defaultCompileArgs(self: Processor, optimize: std.builtin.OptimizeMode) []const []const u8 { 107 | return switch (self) { 108 | .ee => blk: { 109 | const base = [_][]const u8{ "-D_EE", "-fno-builtin", "-gdwarf-2", "-gz", "-Wno-incompatible-pointer-types", "-Wno-address-of-packed-member" }; 110 | break :blk switch (optimize) { 111 | .Debug => &(base ++ [0][]const u8{}), 112 | .ReleaseSafe => &(base ++ [_][]const u8{ "-O2", "-G0" }), 113 | .ReleaseFast => &(base ++ [_][]const u8{ "-O2", "-G0", "-s" }), 114 | .ReleaseSmall => &(base ++ [_][]const u8{ "-Os", "-G0", "-s" }), 115 | }; 116 | }, 117 | .iop => blk: { 118 | const base = [_][]const u8{ "-D_IOP", "-fno-builtin", "-msoft-float", "-mno-explicit-relocs", "-gdwarf-2", "-gz", "-Wno-incompatible-pointer-types", "-Wno-address-of-packed-member" }; 119 | break :blk switch (optimize) { 120 | .Debug => &(base ++ [0][]const u8{}), 121 | .ReleaseSafe => &(base ++ [_][]const u8{ "-O2", "-G0" }), 122 | .ReleaseFast => &(base ++ [_][]const u8{ "-O2", "-G0", "-s" }), 123 | .ReleaseSmall => &(base ++ [_][]const u8{ "-Os", "-G0", "-s" }), 124 | }; 125 | }, 126 | }; 127 | } 128 | 129 | pub fn defaultLinkArgs(self: Processor, optimize: std.builtin.OptimizeMode) []const []const u8 { 130 | return switch (self) { 131 | .ee => blk: { 132 | const base = [_][]const u8{ "-Wl,-zmax-page-size=128", "-lm", "-lcdvd", "-lpthread", "-lpthreadglue", "-lcglue", "-lkernel" }; 133 | break :blk switch (optimize) { 134 | .Debug => &(base ++ [_][]const u8{"-lg"}), 135 | .ReleaseSafe, .ReleaseFast => &(base ++ [_][]const u8{ "-O2", "-G0", "-lc" }), 136 | .ReleaseSmall => &(base ++ [_][]const u8{ "-Os", "-G0", "-lc" }), 137 | }; 138 | }, 139 | .iop => blk: { 140 | const base = [_][]const u8{ "-D_IOP", "-fno-builtin", "-gdwarf-2", "-gz", "-msoft-float", "-mno-explicit-relocs", "-nostdlib", "-s" }; 141 | break :blk switch (optimize) { 142 | .Debug => &(base ++ [0][]const u8{}), 143 | .ReleaseSafe, .ReleaseFast => &(base ++ [_][]const u8{ "-O2", "-G0" }), 144 | .ReleaseSmall => &(base ++ [_][]const u8{ "-Os", "-G0" }), 145 | }; 146 | }, 147 | }; 148 | } 149 | 150 | fn knownTarget(query: std.Target.Query) std.Build.ResolvedTarget { 151 | return .{ 152 | .query = query, 153 | .result = std.zig.system.resolveTargetQuery(query) catch 154 | @panic("unable to resolve target query"), 155 | }; 156 | } 157 | 158 | var ee_target = LazyTarget.of(init: { 159 | var tgt: std.Target.Query = .{}; 160 | tgt.cpu_arch = .mipsel; 161 | tgt.os_tag = .freestanding; 162 | tgt.ofmt = .c; 163 | tgt.cpu_model = .{ .explicit = &std.Target.mips.cpu.mips2 }; 164 | tgt.cpu_features_add.addFeature(@intFromEnum(std.Target.mips.Feature.mips2)); 165 | break :init tgt; 166 | }); 167 | 168 | var iop_target = LazyTarget.of(init: { 169 | var tgt: std.Target.Query = .{}; 170 | tgt.cpu_arch = .mipsel; 171 | tgt.os_tag = .freestanding; 172 | tgt.ofmt = .c; 173 | tgt.cpu_model = .{ .explicit = &std.Target.mips.cpu.mips2 }; 174 | tgt.cpu_features_add.addFeature(@intFromEnum(std.Target.mips.Feature.mips2)); 175 | break :init tgt; 176 | }); 177 | 178 | const LazyTarget = struct { 179 | q: std.Target.Query, 180 | value: ?std.Build.ResolvedTarget = null, 181 | 182 | const Self = @This(); 183 | 184 | pub fn get(self: *Self) std.Build.ResolvedTarget { 185 | if (self.value) |v| { 186 | return v; 187 | } else { 188 | const v = knownTarget(self.q); 189 | self.value = v; 190 | return v; 191 | } 192 | } 193 | 194 | pub fn of(q: std.Target.Query) LazyTarget { 195 | return .{ .q = q }; 196 | } 197 | }; 198 | }; 199 | 200 | const Toolchain = struct { 201 | const DevSet = struct { 202 | ee: Dev, 203 | iop: Dev, 204 | 205 | const Self = @This(); 206 | 207 | pub fn get(self: Self, p: Processor) Dev { 208 | return switch (p) { 209 | .ee => self.ee, 210 | .iop => self.iop, 211 | }; 212 | } 213 | }; 214 | 215 | const ExtraSdks = struct { 216 | common: Sdk, 217 | gsKit: Sdk, 218 | }; 219 | 220 | extras: ExtraSdks, 221 | dev: DevSet, 222 | 223 | pub fn fromEnv(b: *std.Build) !Toolchain { 224 | const dev_root = std.posix.getenv("PS2DEV") orelse { 225 | std.log.err("PS2DEV environment variable missing!", .{}); 226 | return error.EnvMissing; 227 | }; 228 | const sdk_root = std.posix.getenv("PS2SDK") orelse { 229 | std.log.err("PS2SDK environment variable missing!", .{}); 230 | return error.EnvMissing; 231 | }; 232 | const sdk_ee = Sdk.from(b, sdk_root, Processor.ee.suffix()); 233 | const sdk_iop = Sdk.from(b, sdk_root, Processor.iop.suffix()); 234 | const extras = ExtraSdks{ 235 | .common = Sdk.from(b, sdk_root, "common"), 236 | .gsKit = Sdk.from(b, dev_root, "gsKit"), 237 | }; 238 | const dev = DevSet{ 239 | .ee = Dev.from(b, dev_root, .ee, sdk_ee), 240 | .iop = Dev.from(b, dev_root, .iop, sdk_iop), 241 | }; 242 | return .{ 243 | .extras = extras, 244 | .dev = dev, 245 | }; 246 | } 247 | 248 | pub fn createTranslateC(self: Toolchain, b: *std.Build, processor: Processor, root_source_file: std.Build.LazyPath, optimize: std.builtin.OptimizeMode) *std.Build.Step.TranslateC { 249 | const dev = self.dev.get(processor); 250 | const translate_c = b.addTranslateC(.{ 251 | .root_source_file = root_source_file, 252 | .optimize = optimize, 253 | .target = processor.target(), 254 | }); 255 | translate_c.defineCMacro(processor.macro(), null); 256 | if (dev.stdlibIncludePath(b)) |include| { 257 | translate_c.addIncludeDir(include); 258 | } 259 | translate_c.addIncludeDir(dev.sdk.include); 260 | translate_c.addIncludeDir(self.extras.common.include); 261 | return translate_c; 262 | } 263 | pub fn createPureCCompileStep(self: Toolchain, b: *std.Build, processor: Processor, optimize: std.builtin.OptimizeMode) *std.Build.Step.Run { 264 | const dev = self.dev.get(processor); 265 | var cmd = b.addSystemCommand(&.{ 266 | dev.tool(b, "gcc"), 267 | }); 268 | cmd.addArgs(processor.defaultCompileArgs(optimize)); 269 | cmd.addArgs(&.{ "-I", b.graph.zig_lib_directory.path.? }); 270 | cmd.addArgs(&.{ "-I", dev.sdk.include }); 271 | cmd.addArgs(&.{ "-I", self.extras.common.include }); 272 | return cmd; 273 | } 274 | 275 | pub fn compilePureCFile(self: Toolchain, b: *std.Build, input: std.Build.LazyPath, processor: Processor, optimize: std.builtin.OptimizeMode) struct { *std.Build.Step.Run, std.Build.LazyPath } { 276 | var step = self.createPureCCompileStep(b, processor, optimize); 277 | step.addArg("-c"); 278 | step.addFileArg(input); 279 | step.addArg("-o"); 280 | const output = step.addOutputFileArg("output.o"); 281 | return .{ step, output }; 282 | } 283 | 284 | 285 | pub fn createTranslatedCompileStep(self: Toolchain, b: *std.Build, processor: Processor, optimize: std.builtin.OptimizeMode) *std.Build.Step.Run { 286 | const dev = self.dev.get(processor); 287 | var cmd = b.addSystemCommand(&.{ 288 | dev.tool(b, "gcc"), 289 | }); 290 | cmd.addArgs(processor.defaultCompileArgs(optimize)); 291 | cmd.addArgs(&.{ "-I", b.graph.zig_lib_directory.path.? }); 292 | if (processor == .iop) { 293 | var d = b.addWriteFile("signal.h", "\n"); 294 | cmd.addArg("-I"); 295 | cmd.addDirectoryArg(d.getDirectory()); 296 | } 297 | return cmd; 298 | } 299 | 300 | pub fn compileTranslatedCFile(self: Toolchain, b: *std.Build, input: std.Build.LazyPath, processor: Processor, optimize: std.builtin.OptimizeMode) struct { *std.Build.Step.Run, std.Build.LazyPath } { 301 | var step = self.createTranslatedCompileStep(b, processor, optimize); 302 | step.addArg("-c"); 303 | step.addFileArg(input); 304 | step.addArg("-o"); 305 | const output = step.addOutputFileArg("output.o"); 306 | return .{ step, output }; 307 | } 308 | 309 | pub fn createLinkStep(self: Toolchain, b: *std.Build, processor: Processor, optimize: std.builtin.OptimizeMode) *std.Build.Step.Run { 310 | const dev = self.dev.get(processor); 311 | var cmd = switch (processor) { 312 | .ee => b.addSystemCommand(&.{ 313 | dev.tool(b, "gcc"), 314 | "-T", 315 | dev.sdk.resolve(b, "startup/linkfile"), 316 | "-L", 317 | dev.sdk.resolve(b, "lib"), 318 | }), 319 | .iop => b.addSystemCommand(&.{dev.tool(b, "gcc")}), 320 | }; 321 | cmd.addArgs(processor.defaultLinkArgs(optimize)); 322 | return cmd; 323 | } 324 | 325 | pub fn linkObjects(self: Toolchain, b: *std.Build, inputs: []const std.Build.LazyPath, processor: Processor, optimize: std.builtin.OptimizeMode) struct { *std.Build.Step.Run, std.Build.LazyPath } { 326 | var step = self.createLinkStep(b, processor, optimize); 327 | step.addArg("-o"); 328 | const output = step.addOutputFileArg(b.fmt("output.{s}", .{processor.ext()})); 329 | for (inputs) |input| { 330 | step.addFileArg(input); 331 | } 332 | return .{ step, output }; 333 | } 334 | 335 | pub fn stripElf(self: Toolchain, b: *std.Build, processor: Processor, optimize: std.builtin.OptimizeMode, file: std.Build.LazyPath) std.Build.LazyPath { 336 | const dev = self.dev.get(processor); 337 | return switch (optimize) { 338 | .Debug, .ReleaseSafe => file, 339 | .ReleaseSmall, .ReleaseFast => blk: { 340 | const strip_elf = b.addSystemCommand(&.{ dev.tool(b, "strip"), "-s" }); 341 | strip_elf.addFileArg(file); 342 | strip_elf.addArg("-o"); 343 | const stripped_elf = strip_elf.addOutputFileArg(b.fmt("stripped.{s}", .{processor.ext()})); 344 | break :blk stripped_elf; 345 | }, 346 | }; 347 | } 348 | 349 | pub const IOPParams = struct { 350 | imports: std.Build.LazyPath, 351 | exports: std.Build.LazyPath, 352 | imports_header: std.Build.LazyPath, 353 | 354 | pub fn fromDir(b: *std.Build, dir: std.Build.LazyPath) IOPParams { 355 | const imports = dir.path(b, "imports.lst"); 356 | const exports = dir.path(b, "exports.tab"); 357 | const imports_header = dir.path(b, "irx_imports.h"); 358 | return .{ 359 | .imports = imports, 360 | .exports = exports, 361 | .imports_header = imports_header, 362 | }; 363 | } 364 | }; 365 | 366 | pub fn buildIOPBinary(self: Toolchain, b: *std.Build, params: IOPParams, options: std.Build.ObjectOptions) BuildPipelineIOP { 367 | const irx_imports = self.createTranslateC(b, .iop, params.imports_header, options.optimize); 368 | 369 | const zig_to_c = b.addObject(options); 370 | 371 | zig_to_c.root_module.addImport("irx_imports", irx_imports.createModule()); 372 | 373 | const object_step, const compiled_obj = self.compileTranslatedCFile(b, zig_to_c.getEmittedBin(), .iop, options.optimize); 374 | 375 | //intermediate 376 | const irx_cgen = b.addExecutable(.{ 377 | .name = "irx_cgen", 378 | .root_source_file = b.path("tools/irx_cgen.zig"), 379 | .target = b.graph.host, 380 | }); 381 | 382 | const imports_gen = b.addRunArtifact(irx_cgen); 383 | imports_gen.addArg("imports"); 384 | imports_gen.addFileArg(params.imports); 385 | const build_imports = imports_gen.addOutputFileArg("build-imports.c"); 386 | imports_gen.addFileArg(params.imports_header); 387 | 388 | const exports_gen = b.addRunArtifact(irx_cgen); 389 | exports_gen.addArg("exports"); 390 | exports_gen.addFileArg(params.exports); 391 | const build_exports = exports_gen.addOutputFileArg("build-exports.c"); 392 | 393 | const imports_step, const imports_obj = self.compilePureCFile(b, build_imports, .iop, options.optimize); 394 | const exports_step, const exports_obj = self.compilePureCFile(b, build_exports, .iop, options.optimize); 395 | 396 | imports_step.addArg("-fno-toplevel-reorder"); 397 | exports_step.addArg("-fno-toplevel-reorder"); 398 | 399 | const link_step, const linked_obj = self.linkObjects(b, &.{ compiled_obj, imports_obj, exports_obj }, .iop, options.optimize); 400 | 401 | return .{ 402 | .zig_to_c_step = zig_to_c, 403 | .object_step = object_step, 404 | .link_step = link_step, 405 | .output_file = linked_obj, 406 | }; 407 | } 408 | pub const BuildPipelineIOP = struct { 409 | zig_to_c_step: *std.Build.Step.Compile, 410 | object_step: *std.Build.Step.Run, 411 | link_step: *std.Build.Step.Run, 412 | output_file: std.Build.LazyPath, 413 | 414 | pub fn rootModule(self: BuildPipelineIOP) *std.Build.Module { 415 | return &self.zig_to_c_step.root_module; 416 | } 417 | 418 | pub fn addLibDir(self: BuildPipelineIOP, dir: []const u8) void { 419 | self.link_step.addArgs(&.{ "-L", dir }); 420 | } 421 | 422 | pub fn link(self: BuildPipelineIOP, libraries: []const []const u8) void { 423 | for (libraries) |library| { 424 | self.link_step.addArgs(&.{ "-l", library }); 425 | } 426 | } 427 | }; 428 | 429 | pub fn buildEEBinary(self: Toolchain, b: *std.Build, options: std.Build.ObjectOptions) BuildPipelineEE { 430 | const zig_to_c = b.addObject(options); 431 | 432 | const object_step, const compiled_obj = self.compileTranslatedCFile(b, zig_to_c.getEmittedBin(), .ee, options.optimize); 433 | 434 | const link_step, const linked_obj = self.linkObjects(b, &.{compiled_obj}, .ee, options.optimize); 435 | 436 | return .{ .zig_to_c_step = zig_to_c, .object_step = object_step, .link_step = link_step, .output_file = linked_obj }; 437 | } 438 | 439 | pub const BuildPipelineEE = struct { 440 | zig_to_c_step: *std.Build.Step.Compile, 441 | object_step: *std.Build.Step.Run, 442 | link_step: *std.Build.Step.Run, 443 | output_file: std.Build.LazyPath, 444 | 445 | pub fn rootModule(self: BuildPipelineEE) *std.Build.Module { 446 | return &self.zig_to_c_step.root_module; 447 | } 448 | 449 | pub fn addLibDir(self: BuildPipelineEE, dir: []const u8) void { 450 | self.link_step.addArgs(&.{ "-L", dir }); 451 | } 452 | 453 | pub fn link(self: BuildPipelineEE, libraries: []const []const u8) void { 454 | for (libraries) |library| { 455 | self.link_step.addArgs(&.{ "-l", library }); 456 | } 457 | } 458 | }; 459 | }; 460 | 461 | const Dev = struct { 462 | processor: Processor, 463 | sdk: Sdk, 464 | root: []const u8, 465 | 466 | pub fn from(b: *std.Build, base: []const u8, p: Processor, sdk: Sdk) Dev { 467 | return .{ 468 | .processor = p, 469 | .sdk = sdk, 470 | .root = b.fmt("{s}/{s}", .{ base, p.suffix() }), 471 | }; 472 | } 473 | 474 | pub fn tool(self: Dev, b: *std.Build, tool_name: []const u8) []u8 { 475 | return b.pathJoin(&.{ self.root, "bin", b.fmt( 476 | "{s}-{s}", 477 | .{ self.processor.toolPrefix(), tool_name }, 478 | ) }); 479 | } 480 | 481 | pub fn stdlibIncludePath(self: Dev, b: *std.Build) ?[]const u8 { 482 | const include_path = self.resolve(b, b.fmt("{s}/{s}", .{ self.processor.toolPrefix(), "include" })); 483 | if (std.fs.openDirAbsolute(include_path, .{})) |dir| { 484 | var d = dir; 485 | d.close(); 486 | return include_path; 487 | } else |_| { 488 | return null; 489 | } 490 | } 491 | 492 | pub fn resolve(self: Dev, b: *std.Build, rel_path: []const u8) []u8 { 493 | return b.fmt("{s}/{s}", .{ self.root, rel_path }); 494 | } 495 | }; 496 | 497 | const Sdk = struct { 498 | root: []const u8, 499 | include: []const u8, 500 | 501 | pub fn from(b: *std.Build, base: []const u8, suffix: []const u8) Sdk { 502 | const root = b.fmt("{s}/{s}", .{ base, suffix }); 503 | return .{ 504 | .root = root, 505 | .include = b.fmt("{s}/include", .{root}), 506 | }; 507 | } 508 | 509 | pub fn resolve(self: Sdk, b: *std.Build, rel_path: []const u8) []u8 { 510 | return b.fmt("{s}/{s}", .{ self.root, rel_path }); 511 | } 512 | }; 513 | -------------------------------------------------------------------------------- /build.zig.zon: -------------------------------------------------------------------------------- 1 | .{ 2 | .name = "ZigStation2", 3 | .version = "0.0.1", 4 | .minimum_zig_version = "0.14.0", 5 | .dependencies = .{}, 6 | .paths = .{ 7 | "build.zig", 8 | "build.zig.zon", 9 | "src", 10 | "COPYING", 11 | "COPYING.LESSER", 12 | "README.md", 13 | }, 14 | } 15 | -------------------------------------------------------------------------------- /shell.nix: -------------------------------------------------------------------------------- 1 | { pkgs ? import {}, 2 | run ? "zsh" 3 | }: let 4 | fhs = pkgs.buildFHSUserEnv { 5 | name = "ps2dev"; 6 | targetPkgs = pkgs: (with pkgs; [ 7 | autoconf 8 | gnumake 9 | clang 10 | clang-tools 11 | gcc 12 | wget 13 | git 14 | patch 15 | texinfo 16 | bash 17 | file 18 | bison 19 | flex 20 | gettext 21 | gsl 22 | gnum4 23 | gmp.dev 24 | gmp.out 25 | mpfr.out 26 | mpfr.dev 27 | libmpc 28 | cmake 29 | zlib.dev 30 | zlib.out 31 | ]); 32 | runScript = run; 33 | }; 34 | in pkgs.stdenv.mkDerivation { 35 | name = "ps2dev-shell"; 36 | nativeBuildInputs = [ fhs ]; 37 | hardeningDisable = [ "format" ]; 38 | shellHook = '' 39 | # or whatever you want 40 | export PS2DEV=$HOME/ps2 41 | mkdir -p $PS2DEV 42 | chown -R $USER: $PS2DEV 43 | 44 | # setup login env 45 | export PS2SDK=$PS2DEV/ps2sdk 46 | export PATH=$PATH:$PS2DEV/bin:$PS2DEV/ee/bin:$PS2DEV/iop/bin:$PS2DEV/dvp/bin:$PS2SDK/bin 47 | export CMAKE_INSTALL_PREFIX=$PS2DEV/bin 48 | exec ps2dev 49 | ''; 50 | } 51 | -------------------------------------------------------------------------------- /src/ee/c.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include -------------------------------------------------------------------------------- /src/ee/main.zig: -------------------------------------------------------------------------------- 1 | const std = @import("std"); 2 | const c = @import("c_ee"); 3 | pub fn _main(argc: c_int, argv: [*c][*c]u8) callconv(.C) c_int { 4 | _ = argc; 5 | _ = argv; 6 | return main() catch |err| { 7 | @panic(@errorName(err)); 8 | }; 9 | } 10 | 11 | comptime { 12 | @export(_main, .{ 13 | .name = "main", 14 | }); 15 | } 16 | 17 | var done: std.atomic.Value(bool) = std.atomic.Value(bool).init(false); 18 | 19 | fn thread_main(_: ?*anyopaque) u32 { 20 | screen_writer.print("Thread 2!\n", .{}) catch {}; 21 | _ = c.sleep(2); 22 | done.store(true, .release); 23 | return 1; 24 | } 25 | 26 | fn gskitDemo() void { 27 | const Black = c.GS_SETREG_RGBAQ(0x00, 0x00, 0x00, 0x00, 0x00); 28 | 29 | const gsGlobal: *c.gsGlobal = @ptrCast(c.gsKit_init_global_custom(c.GS_RENDER_QUEUE_OS_POOLSIZE, c.GS_RENDER_QUEUE_PER_POOLSIZE)); 30 | defer c.gsKit_deinit_global(gsGlobal); 31 | 32 | gsGlobal.PSM = c.GS_PSM_CT24; 33 | gsGlobal.PSMZ = c.GS_PSMZ_16S; 34 | 35 | gsGlobal.Mode = c.gsKit_check_rom(); 36 | if (gsGlobal.Mode == c.GS_MODE_PAL) { 37 | gsGlobal.Height = 512; 38 | } else { 39 | gsGlobal.Height = 448; 40 | } 41 | 42 | c.gsKit_init_screen(gsGlobal); 43 | 44 | c.gsKit_mode_switch(gsGlobal, c.GS_PERSISTENT); 45 | 46 | const quad = [_:.{}]c.gsPrimPoint{ 47 | .{ 48 | .rgbaq = c.color_to_RGBAQ(0xFF, 0x00, 0x00, 0xFF, 0), 49 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 200, 200, 0), 50 | }, 51 | .{ 52 | .rgbaq = c.color_to_RGBAQ(0x00, 0xFF, 0x00, 0xFF, 0), 53 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 300, 200, 0), 54 | }, 55 | .{ 56 | .rgbaq = c.color_to_RGBAQ(0x00, 0x00, 0xFF, 0xFF, 0), 57 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 300, 100, 0), 58 | }, 59 | .{ 60 | .rgbaq = c.color_to_RGBAQ(0x00, 0x00, 0xFF, 0xFF, 0), 61 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 300, 100, 0), 62 | }, 63 | .{ 64 | .rgbaq = c.color_to_RGBAQ(0xFF, 0xFF, 0x00, 0xFF, 0), 65 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 200, 100, 0), 66 | }, 67 | .{ 68 | .rgbaq = c.color_to_RGBAQ(0xFF, 0x00, 0x00, 0xFF, 0), 69 | .xyz2 = c.vertex_to_XYZ2(gsGlobal, 200, 200, 0), 70 | }, 71 | }; 72 | c.gsKit_clear(gsGlobal, Black); 73 | c.gsKit_prim_list_triangle_gouraud_3d(gsGlobal, quad.len, &quad); 74 | 75 | var start: c.time_t = undefined; 76 | var now: c.time_t = undefined; 77 | _ = c.time(&start); 78 | now = start; 79 | while (c.difftime(c.time(&now), start) < 5) { 80 | c.gsKit_queue_exec(gsGlobal); 81 | c.gsKit_sync_flip(gsGlobal); 82 | } 83 | } 84 | 85 | fn main() !i32 { 86 | // gskitDemo(); 87 | c.init_scr(); 88 | c.scr_clear(); 89 | c.scr_setCursor(0); 90 | var ret: c_int = undefined; 91 | ret = c.SifLoadModule("host:hello.irx", 0, null); 92 | if (ret < 0) { 93 | try screen_writer.print("Failed to load host:hello.irx ({})\n", .{ret}); 94 | _ = c.SleepThread(); 95 | } 96 | _ = c.printf("Hello from zig EE!\n"); 97 | try screen_writer.print("Hello from zig EE! (on your screen!)\n", .{}); 98 | _ = c.SleepThread(); 99 | return 0; 100 | } 101 | 102 | pub fn panic(msg: []const u8, _: ?*std.builtin.StackTrace, _: ?usize) noreturn { 103 | c.init_scr(); 104 | c.scr_clear(); 105 | c.scr_setCursor(0); 106 | c.scr_setXY(0, 0); 107 | c.scr_setfontcolor(0x000000); 108 | c.scr_setbgcolor(0x0000FF); 109 | c.scr_printf("PANIC"); 110 | c.scr_setfontcolor(0xFFFFFF); 111 | c.scr_setbgcolor(0x000000); 112 | c.scr_printf("\n"); 113 | var buf: [1:0]u8 = undefined; 114 | buf[1] = 0; 115 | for (msg) |char| { 116 | buf[0] = char; 117 | c.scr_printf(&buf); 118 | } 119 | _ = c.SleepThread(); 120 | unreachable; 121 | } 122 | const ScreenCtx = struct { 123 | pub fn write(_: *ScreenCtx, bytes: []const u8) ScreenError!usize { 124 | const buf_size = 16; 125 | var print_buf: [buf_size:0]u8 = undefined; 126 | @memset(&print_buf, 0); 127 | var i: usize = 0; 128 | while (i < bytes.len) : (i += buf_size) { 129 | const count = @min(buf_size, bytes.len - i); 130 | @memcpy(print_buf[0..count], bytes[i..][0..count]); 131 | print_buf[count] = 0; 132 | c.scr_printf(print_buf[0..count :0]); 133 | } 134 | return bytes.len; 135 | } 136 | }; 137 | 138 | const ScreenError = error{ 139 | Overflow, 140 | }; 141 | 142 | var global_screen = ScreenCtx{}; 143 | 144 | var screen_writer = std.io.Writer(*ScreenCtx, ScreenError, ScreenCtx.write){ .context = &global_screen }; 145 | -------------------------------------------------------------------------------- /src/iop/exports.tab: -------------------------------------------------------------------------------- 1 | DECLARE_EXPORT_TABLE(hello, 1, 0) 2 | DECLARE_EXPORT(_start) 3 | DECLARE_EXPORT(_retonly) 4 | DECLARE_EXPORT(_retonly) 5 | DECLARE_EXPORT(_retonly) 6 | 7 | /* 4 */ 8 | DECLARE_EXPORT(hello) 9 | END_EXPORT_TABLE 10 | 11 | void _retonly() {} -------------------------------------------------------------------------------- /src/iop/hello.zig: -------------------------------------------------------------------------------- 1 | const irx = @import("irx_imports"); 2 | 3 | pub export const _irx_id: irx.irx_id = .{ 4 | .n = "hello", 5 | .v = irx.IRX_VER(1, 0), 6 | }; 7 | pub extern var _exp_hello: irx.irx_export_table; 8 | 9 | pub export fn _start(argc: c_int, argv: [*c]c_char) c_int { 10 | _ = argc; 11 | _ = argv; 12 | if (irx.RegisterLibraryEntries(&_exp_hello) != 0) { 13 | return irx.MODULE_NO_RESIDENT_END; 14 | } 15 | hello(); 16 | return irx.MODULE_RESIDENT_END; 17 | } 18 | 19 | pub export fn hello() void { 20 | _ = irx.printf("Hello from zig IOP!\n"); 21 | } -------------------------------------------------------------------------------- /src/iop/imports.lst: -------------------------------------------------------------------------------- 1 | loadcore_IMPORTS_start 2 | I_RegisterLibraryEntries 3 | loadcore_IMPORTS_end 4 | 5 | stdio_IMPORTS_start 6 | I_printf 7 | stdio_IMPORTS_end -------------------------------------------------------------------------------- /src/iop/irx_imports.h: -------------------------------------------------------------------------------- 1 | #ifndef IOP_IRX_IMPORTS_H 2 | #define IOP_IRX_IMPORTS_H 3 | 4 | #include 5 | 6 | #include 7 | #include 8 | 9 | #endif -------------------------------------------------------------------------------- /tools/irx_cgen.zig: -------------------------------------------------------------------------------- 1 | const std = @import("std"); 2 | pub fn main() !void { 3 | { 4 | var arena_state = std.heap.ArenaAllocator.init(std.heap.page_allocator); 5 | defer arena_state.deinit(); 6 | const arena = arena_state.allocator(); 7 | const args = try std.process.argsAlloc(arena); 8 | if (args.len < 4) fatal("wrong number of arguments", .{}); 9 | 10 | const mode = args[1]; 11 | const input = args[2]; 12 | const output = args[3]; 13 | 14 | const is_imports = std.mem.eql(u8, mode, "imports"); 15 | const is_exports = std.mem.eql(u8, mode, "exports"); 16 | 17 | if (!is_imports and !is_exports) { 18 | fatal("unknown mode {s}", .{mode}); 19 | } 20 | 21 | var input_file = std.fs.cwd().openFile(input, .{}) catch |err| { 22 | fatal("unable to open '{s}': {s}", .{input, @errorName(err)}); 23 | }; 24 | defer input_file.close(); 25 | var br = std.io.bufferedReader(input_file.reader()); 26 | const reader = br.reader(); 27 | 28 | var output_file = std.fs.cwd().createFile(output, .{}) catch |err| { 29 | fatal("unable to create '{s}': {s}", .{output, @errorName(err)}); 30 | }; 31 | defer output_file.close(); 32 | var bw = std.io.bufferedWriter(output_file.writer()); 33 | const writer = bw.writer(); 34 | 35 | if (is_imports) { 36 | if (args.len < 5) { 37 | fatal("wrong number of arguments for imports", .{}); 38 | } 39 | try writer.writeAll("#include \""); 40 | try writer.writeAll(args[4]); 41 | try writer.writeAll("\"\n"); 42 | } else if (is_exports) { 43 | try writer.writeAll("#include \n"); 44 | } else unreachable; 45 | 46 | const Fifo = std.fifo.LinearFifo(u8, .{ .Static = 4096 }); 47 | var fifo: Fifo = Fifo.init(); 48 | defer fifo.deinit(); 49 | try fifo.pump(reader, writer); 50 | try bw.flush(); 51 | } 52 | 53 | return std.process.cleanExit(); 54 | } 55 | 56 | fn fatal(comptime format: []const u8, args: anytype) noreturn { 57 | std.debug.print(format, args); 58 | std.process.exit(1); 59 | } -------------------------------------------------------------------------------- /zig: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | nix-shell --argstr run "sh -c 'zig $*'" -------------------------------------------------------------------------------- /zls: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | nix-shell --argstr run "sh -c 'zls $*'" 3 | --------------------------------------------------------------------------------