├── LICENSE ├── README.md └── io_node.py /LICENSE: -------------------------------------------------------------------------------- 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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 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 | {project} Copyright (C) {year} {fullname} 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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # NodeIO 2 | NodeIO is an add-on for Blender 3D (blender.org) that allows nodes and node trees to be 3 | exported and re-imported with ease. This means that important, or commonly used node setups 4 | can be saved so that they don't have to be re-built later. Currently NodeIO supports Cycles, 5 | Blender Internal, Mitsuba Render, Animation Nodes, and Sverchok. 6 | -------------------------------------------------------------------------------- /io_node.py: -------------------------------------------------------------------------------- 1 | bl_info = { 2 | "name": "NodeIO", 3 | "author": "Jacob Morris", 4 | "version": (0, 6, 0), 5 | "blender": (2, 79, 0), 6 | "location": "Node Editor > Properties", 7 | "description": "Allows The Exporting And Importing Of Node Trees Via .bnodes Files", 8 | "category": "Import-Export" 9 | } 10 | 11 | # This program is free software: you can redistribute it and/or modify 12 | # it under the terms of the GNU General Public License as published by 13 | # the Free Software Foundation, either version 3 of the License, or 14 | # (at your option) any later version. 15 | # 16 | # This program is distributed in the hope that it will be useful, 17 | # but WITHOUT ANY WARRANTY; without even the implied warranty of 18 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 19 | # GNU General Public License for more details. 20 | # 21 | # You should have received a copy of the GNU General Public License 22 | # along with this program. If not, see . 23 | 24 | import bpy 25 | from bpy.props import StringProperty, EnumProperty, BoolProperty 26 | from datetime import datetime 27 | from time import tzname 28 | import operator 29 | from inspect import getmembers 30 | from os import path, mkdir, listdir, walk, remove as remove_file, sep as os_file_sep 31 | from shutil import copyfile, rmtree 32 | import zipfile 33 | from mathutils import * 34 | import json 35 | 36 | VERSION = (0, 6, 0) 37 | DEBUG_FILE = False # makes JSON file more human readable at the cost of file-size 38 | ROUND = 4 39 | 40 | 41 | def make_list(data): 42 | out = [] 43 | for i in data: 44 | if isinstance(i, (bool, str)): 45 | out.append(i) 46 | else: # int, float 47 | out.append(round(i, ROUND)) 48 | return out 49 | 50 | 51 | def collect_node_data(n: bpy.types.Node): 52 | ns, inputs, outputs, dependencies = [], [], [], [] 53 | node_data = {"inputs": inputs, "outputs": outputs, "node_specific": ns, "bl_idname": n.bl_idname} 54 | is_group = False 55 | 56 | if n.bl_idname in ("ShaderNodeGroup", "TextureNodeGroup") or n.bl_idname[0:11] == "SvGroupNode": 57 | is_group = True 58 | 59 | # certain nodes that do not support some operations, like having no .inputs or .outputs, 60 | node_exclude_list = ['NodeReroute', 'NodeGroupInput', 'NodeGroupOutput'] 61 | socket_field_list = ['default_value', "value", "objectName", "fontName", "category", "groupName", "textBlockName", 62 | "sequenceName", 'isUsed', 'easeIn', 'easeOut'] 63 | 64 | # types that can be converted to lists 65 | list_types = (Color, Vector, Euler, Quaternion, bpy.types.bpy_prop_array) 66 | 67 | if n.bl_idname not in node_exclude_list: # Reroute does have in and out, but does not know type until linked 68 | # inputs 69 | for j in range(len(n.inputs)): 70 | socket = n.inputs[j] 71 | data = {"index": j, "bl_idname": socket.bl_idname, 'values': {}} 72 | for i in socket_field_list: 73 | try: 74 | val = eval("socket.{}".format(i)) 75 | if isinstance(val, list_types): # list 76 | data["values"][i] = make_list(val) 77 | elif isinstance(val, (str, bool)): 78 | data["values"][i] = val 79 | elif isinstance(val, (float, int)): 80 | data["values"][i] = round(val, ROUND) 81 | except AttributeError: 82 | pass 83 | 84 | if data['values']: 85 | inputs.append(data) 86 | 87 | # outputs 88 | for j in range(len(n.outputs)): 89 | socket = n.outputs[j] 90 | data = {"index": j, "bl_idname": socket.bl_idname, 'values': {}} 91 | for i in socket_field_list: 92 | try: 93 | val = eval("socket.{}".format(i)) 94 | if isinstance(val, list_types): # list 95 | data["values"][i] = make_list(val) 96 | elif isinstance(val, (str, bool)): 97 | data["values"][i] = val 98 | elif isinstance(val, (float, int)): 99 | data["values"][i] = round(val, ROUND) 100 | except AttributeError: 101 | pass 102 | 103 | if data['values']: 104 | outputs.append(data) 105 | elif n.bl_idname == "NodeGroupInput": 106 | temp = [] 107 | for i in n.outputs: 108 | if i.bl_idname != "NodeSocketVirtual": 109 | temp.append(i.bl_idname) 110 | temp.append(i.name) 111 | ns += ["group_input", temp] 112 | elif n.bl_idname == "NodeGroupOutput": 113 | temp = [] 114 | for i in n.inputs: 115 | if i.bl_idname != "NodeSocketVirtual": 116 | temp.append(i.bl_idname) 117 | temp.append(i.name) 118 | ns += ["group_output", temp] 119 | 120 | # list of default values to ignore for smaller file-size, or because not needed, also if property is read-only 121 | exclude_attributes = {'__doc__', '__module__', '__slots__', 'bl_description', 'bl_height_default', 'bl_height_max', 122 | 'bl_height_min', 'bl_icon', 'bl_rna', 'bl_static_type', 'bl_width_default', 'bl_width_min', 123 | 'bl_width_max', 'color_mapping', 'draw_buttons', 'draw_buttons_ext', 'image_user', 124 | 'input_template', 'inputs', 'internal_links', 'is_registered_node_type', 'bl_label', 125 | 'output_template', 'outputs', 'poll', 'poll_instance', 'rna_type', 'shading_compatibility', 126 | 'show_options', 'show_preview', 'show_texture', 'socket_value_update', 'texture_mapping', 127 | 'type', 'update', 'viewLocation', 'width_hidden', 'bl_idname', 'dimensions', 128 | 'isAnimationNode', 'evaluationExpression', 'socketIdentifier', 'canCache', 129 | 'iterateThroughLists', 'identifier', 'scale_off', 'orient_axis', 'generic_enum', 'objects', 130 | 'particles', 'uv'} 131 | 132 | exclude_nodes = {'SvGetPropNode', "SvSetPropNode"} 133 | 134 | # Manual Attribute Collection ------------------------------------------->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> 135 | if n.bl_idname[0:11] == "SvGroupNode": 136 | node_data["monad.name"] = n.monad.name 137 | 138 | # Automatic Attribute Collection ---------------------------------------->>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> 139 | if n.bl_idname not in exclude_nodes: 140 | for method in getmembers(n): 141 | if method[0] not in exclude_attributes: 142 | t = method[1] # type of value 143 | val = getattr(n, method[0]) # get value 144 | 145 | # special handling for certain types 146 | if isinstance(t, list_types): # TUPLE 147 | ns += [method[0], make_list(val)] 148 | elif isinstance(t, (bpy.types.CurveMapping, bpy.types.ShaderNodeRGBCurve)): # CURVES 149 | if isinstance(t, bpy.types.CurveMapping): 150 | if isinstance(n, bpy.types.TextureNodeCurveTime): 151 | c = n.curve 152 | else: 153 | c = n.mapping 154 | else: # happens with n_InterpolationFromCurveMappingNode, has ShaderNodeRGBCurve which has curve 155 | c = n.curveNode.mapping 156 | curves = [make_list(c.black_level), make_list(c.white_level), 157 | str(c.clip_max_x), str(c.clip_max_y), str(c.clip_min_x), 158 | str(c.clip_min_y), str(c.use_clip)] 159 | 160 | for curve in c.curves: 161 | points = [curve.extend] 162 | for point in curve.points: 163 | points.append([make_list(point.location), point.handle_type]) 164 | curves.append(points) 165 | ns += ["mapping", curves] 166 | elif isinstance(t, bpy.types.ColorRamp): # COLOR RAMP 167 | els = [] 168 | for j in n.color_ramp.elements: 169 | cur_el = [j.position, make_list(j.color)] 170 | els.append(cur_el) 171 | ns += ["color_ramp.color_mode", n.color_ramp.color_mode, "color_ramp.interpolation", 172 | n.color_ramp.interpolation, "color_ramp.elements", els] 173 | elif isinstance(t, bpy.types.NodeTree): # NODE TREE 174 | ns += ["node_tree.name", val.name] 175 | elif isinstance(t, bpy.types.Image) and n.image is not None: # IMAGE 176 | ns += ["image", n.image.name] 177 | dependencies.append(['image', n.image.name, n.image.filepath]) 178 | elif isinstance(t, bpy.types.ParticleSystem): # PARTICLE SYSTEM - needs objects and particle system 179 | ns += [method[0], [n.object, val.name]] 180 | elif isinstance(t, (str, bool)): # STRING 181 | ns += [method[0], val] 182 | elif isinstance(t, (int, float)): # FlOAT, INTEGER 183 | ns += [method[0], round(val, ROUND)] 184 | elif isinstance(t, bpy.types.Node): # FRAME NODE 185 | ns += [method[0], val.name] 186 | elif isinstance(t, bpy.types.Texture): # TEXTURE NODE 187 | ns += [method[0], val.name] 188 | 189 | # extra information needed for creating nodes 190 | if n.bl_idname == 'an_CreateListNode': # have to determine number of inputs, has to be evaluated after assignedType 191 | ns += ['an_list_size', len(n.inputs) - 1] 192 | elif n.bl_idname in ('SvGetPropNode', 'SvSetPropNode'): 193 | ns += ['prop_name', n.prop_name, 'location', make_list(n.location), 'name', n.name, 'color', make_list(n.color), 194 | 'hide', n.hide] 195 | 196 | return [node_data, is_group, dependencies] 197 | 198 | 199 | # recursive method that collects all nodes and if group node goes and collects its nodes 200 | # data is added to data in [[nodes, links], [nodes, links]] group by group 201 | def collect_nodes(nodes, links, dependencies, names, name, data): 202 | m_n = [] 203 | m_l = [] 204 | 205 | for n in nodes: # nodes 206 | out, is_group, im = collect_node_data(n) 207 | m_n.append(out) 208 | dependencies.append(im) 209 | 210 | if is_group and n.bl_idname in ("ShaderNodeGroup", "TextureNodeGroup"): 211 | collect_nodes(n.node_tree.nodes, n.node_tree.links, dependencies, names, n.node_tree.name, data) 212 | elif is_group and n.bl_idname[0:11] == "SvGroupNode": 213 | collect_nodes(n.monad.nodes, n.monad.links, dependencies, names, n.monad.name, data) 214 | 215 | for l in links: # links 216 | out = link_info(l) 217 | m_l.append(out) 218 | 219 | data.append([m_n, m_l]) 220 | names[name] = len(data) - 1 221 | 222 | 223 | def link_info(link): 224 | out = [link.from_node.name] 225 | 226 | fr = link.from_socket.path_from_id() 227 | fr = fr.split(".") 228 | 229 | if len(fr) == 3: 230 | fr = fr[2] 231 | else: 232 | fr = fr[1] 233 | 234 | n1 = fr.index("[") 235 | n2 = fr.index("]") 236 | ind = int(fr[n1 + 1:n2]) 237 | out.append(ind) 238 | out.append(link.to_node.name) 239 | fr = link.to_socket.path_from_id() 240 | fr = fr.split(".") 241 | 242 | if len(fr) == 3: 243 | fr = fr[2] 244 | else: 245 | fr = fr[1] 246 | 247 | n1 = fr.index("[") 248 | n2 = fr.index("]") 249 | ind = int(fr[n1 + 1:n2]) 250 | out.append(ind) 251 | 252 | return out 253 | 254 | 255 | def export_node_tree(self, context): 256 | to_export = [] 257 | # export_type = context.scene.node_io_export_type 258 | export_path = bpy.path.abspath(context.scene.node_io_export_path) 259 | folder_path = None 260 | folder_name = None 261 | node_tree = context.space_data.node_tree 262 | 263 | # check data 264 | if not export_path: 265 | self.report({"ERROR"}, "NodeIO: Empty Export Path") 266 | return 267 | elif not path.exists(export_path): 268 | self.report({"ERROR"}, "NodeIO: Export Path '{}' Does Not Exist".format(export_path)) 269 | return 270 | elif node_tree is None: 271 | self.report({"ERROR"}, "NodeIO: No Active Node Tree") 272 | return 273 | 274 | # COLLECT NEED INFORMATION: to_export allows multiple node_trees at a time. Info formatted into dict 275 | # {"nodes":____, "links":____, "name":____, "bl_idname":_____} 276 | if node_tree.bl_idname in ("ShaderNodeTree", "MitsubaShaderNodeTree"): 277 | to_export.append({"nodes": node_tree.nodes, "links": node_tree.links, "name": 278 | context.active_object.active_material.name, "bl_idname": node_tree.bl_idname}) 279 | elif node_tree.bl_idname in ("an_AnimationNodeTree", "SverchCustomTreeType"): 280 | to_export.append({"nodes": node_tree.nodes, "links": node_tree.links, "name": node_tree.name, 281 | "bl_idname": node_tree.bl_idname}) 282 | elif node_tree.bl_idname == "TextureNodeTree": 283 | to_export.append({"nodes": node_tree.nodes, "links": node_tree.links, "name": 284 | context.active_object.active_material.active_texture.name, "bl_idname": node_tree.bl_idname}) 285 | 286 | # create folder if more then one node_tree, or if paths are being made relative and there might be dependencies 287 | if len(to_export) > 1 or context.scene.node_io_dependency_save_type == "2": 288 | try: 289 | if len(to_export) > 1: 290 | folder_name = "mat_group_{}".format(len(to_export)) 291 | else: 292 | folder_name = to_export[0]['name'] 293 | folder_path = export_path + os_file_sep + folder_name 294 | mkdir(folder_path) 295 | except FileExistsError: 296 | self.report({"INFO"}, "NodeIO: Directory '{}' Already Exists, Will Add/Overwrite Files In Directory". 297 | format(folder_path)) 298 | else: 299 | folder_path = export_path 300 | 301 | # export materials 302 | for node_tree in to_export: 303 | json_root = {} 304 | names = {} 305 | data, dependencies = [], [] 306 | m_links, m_nodes = node_tree["links"], node_tree["nodes"] 307 | 308 | # get node data 309 | collect_nodes(m_nodes, m_links, dependencies, names, "main", data) 310 | 311 | # write data 312 | # material attribs 313 | t = datetime.now() 314 | date_string = "{}/{}/{} at {}:{}:{} in {}".format(t.month, t.day, t.year, t.hour, t.minute, 315 | t.second, tzname[0]) 316 | 317 | node_counter = 0 318 | for group in names: 319 | json_root[group] = {'nodes': data[names[group]][0], 'links': data[names[group]][1]} 320 | node_counter += len(data[names[group]][0]) 321 | 322 | # get order of groups 323 | pre_order = sorted(names.items(), key=operator.itemgetter(1)) 324 | order = [i[0].replace("/", "_") for i in pre_order] 325 | json_root['__info__'] = {'number_of_nodes': node_counter, 'group_order': order, "render_engine": 326 | context.scene.render.engine, "node_tree_name": node_tree["name"], 327 | "date_created": date_string, "version": VERSION, "node_tree_id": 328 | node_tree["bl_idname"]} 329 | 330 | # dependencies 331 | depend_out = [] # collect all dependencies to place as attribute of root element so they can be imported first 332 | duplicates = {} 333 | 334 | # absolute filepaths 335 | if context.scene.node_io_dependency_save_type == "1": 336 | json_root['__info__']['path_type'] = "absolute" 337 | 338 | # of format [node, node,...] where each node is [depend, depend,...] and depend is [type, name, path] 339 | for node in dependencies: 340 | for depend in node: 341 | if depend[1] not in duplicates or depend[1] in duplicates and depend[2] != duplicates[depend[1]]: 342 | depend_out.append([depend[0], depend[1], bpy.path.abspath(depend[2])]) 343 | duplicates[depend[1]] = bpy.path.abspath(depend[2]) 344 | # relative filepaths 345 | else: 346 | json_root['__info__']['path_type'] = "relative" 347 | 348 | for node in dependencies: 349 | for depend in node: 350 | if depend[1] not in duplicates: 351 | depend_path = bpy.path.abspath(depend[2]) 352 | depend_out.append([depend[0], depend[1], os_file_sep + depend[1]]) 353 | copyfile(depend_path, folder_path + os_file_sep + depend[1]) 354 | duplicates[depend[1]] = depend[1] 355 | 356 | json_root['__info__']['dependencies'] = depend_out 357 | save_path = folder_path + os_file_sep + node_tree["name"] + ".bnodes" 358 | 359 | # write file 360 | try: 361 | file = open(save_path, 'w') 362 | if DEBUG_FILE: # make multiple lines and indent if trying to debug 363 | json.dump(json_root, file, indent=4) 364 | else: 365 | json.dump(json_root, file) 366 | file.close() 367 | 368 | self.report({"INFO"}, "NodeIO: Exported '{}' With {} Nodes And {} Dependencies".format( 369 | json_root['__info__']['node_tree_name'], json_root['__info__']['number_of_nodes'], 370 | len(json_root['__info__']['dependencies']))) 371 | except (PermissionError, FileNotFoundError): 372 | self.report({"ERROR"}, "NodeIO: Permission Denied '{}', Cannot Continue".format(save_path)) 373 | return 374 | 375 | # zip folder 376 | if folder_path != export_path and context.scene.node_io_is_compress: # if folder has been created 377 | if path.exists(folder_path + ".zip"): # if zipped file is already there, delete 378 | remove_file(folder_path + ".zip") 379 | 380 | zf = zipfile.ZipFile(folder_path + ".zip", "w", zipfile.ZIP_DEFLATED) 381 | for dirname, subdirs, files in walk(folder_path): 382 | for filename in files: 383 | zf.write(path.join(dirname, filename), arcname=filename) 384 | zf.close() 385 | 386 | # delete non-compressed folder 387 | rmtree(folder_path) 388 | 389 | 390 | def import_node_tree(self, context): 391 | if context.scene.node_io_import_type == "1": # single file 392 | import_path = bpy.path.abspath(context.scene.node_io_import_path_file) 393 | folder_path = path.dirname(import_path) 394 | else: # all files in folder 395 | import_path = bpy.path.abspath(context.scene.node_io_import_path_dir) 396 | folder_path = import_path 397 | 398 | # check file path 399 | if not import_path: 400 | self.report({"ERROR"}, "NodeIO: Empty Import Path") 401 | return 402 | elif not path.exists(import_path): 403 | self.report({"ERROR"}, "NodeIO: Filepath '{}' Does Not Exist".format(import_path)) 404 | return 405 | elif context.scene.node_io_import_type == "1" and not import_path.endswith(".bnodes") and \ 406 | not import_path.endswith('.zip'): 407 | self.report({"ERROR"}, "NodeIO: Filepath Does Not End With .bnodes") 408 | return 409 | 410 | # collect filepaths 411 | import_list = [] 412 | 413 | if context.scene.node_io_import_type == "2" and not import_path.endswith('.zip'): # import all files in folder 414 | files = listdir(import_path) 415 | 416 | for file in files: 417 | if file.endswith(".bnodes"): 418 | import_list.append(import_path + os_file_sep + file) 419 | elif import_path.endswith('.zip'): 420 | zip_folder = zipfile.ZipFile(import_path) 421 | folder_path = path.dirname(import_path) + os_file_sep + path.basename(import_path).split(".")[0] 422 | 423 | try: 424 | mkdir(folder_path) # create new folder 425 | except FileExistsError: 426 | self.report({"INFO"}, "NodeIO: Folder Already Exists") 427 | 428 | for file_name in zip_folder.namelist(): # open zip file and write it to new directory 429 | f = open(folder_path + os_file_sep + file_name, 'wb') 430 | f.write(zip_folder.open(file_name, 'r').read()) 431 | f.close() 432 | 433 | if file_name.endswith('.bnodes'): 434 | import_list.append(folder_path + os_file_sep + file_name) 435 | else: 436 | import_list.append(import_path) 437 | 438 | # for each .bnodes file import and create material 439 | for file_path in import_list: 440 | file = open(file_path, 'r') 441 | root = json.load(file) 442 | file.close() 443 | 444 | node_tree, nodes, links = None, None, None 445 | 446 | # determine type 447 | if root['__info__']['node_tree_id'] == 'ShaderNodeTree': 448 | # make sure in correct render mode 449 | if root['__info__']['render_engine'] != context.scene.render.engine: 450 | self.report({"ERROR"}, "NodeIO: Please Switch To '{}' Engine".format(root['__info__'] 451 | ['render_engine'])) 452 | return 453 | 454 | node_tree = bpy.data.materials.new(root['__info__']['node_tree_name']) 455 | node_tree.use_nodes = True 456 | nodes = node_tree.node_tree.nodes 457 | links = node_tree.node_tree.links 458 | 459 | elif root['__info__']['node_tree_id'] == "MitsubaShaderNodeTree": 460 | # make sure in correct render mode 461 | if root['__info__']['render_engine'] != context.scene.render.engine: 462 | self.report({"ERROR"}, "NodeIO: Please Switch To '{}' Engine".format(root['__info__'] 463 | ['render_engine'])) 464 | return 465 | 466 | node_tree = bpy.data.materials.new(root['__info__']['node_tree_name']) 467 | context.space_data.node_tree = node_tree 468 | mitsuba_tree = bpy.data.node_groups.new(name=root['__info__']['node_tree_name'], 469 | type="MitsubaShaderNodeTree") 470 | nodes = mitsuba_tree.nodes 471 | links = mitsuba_tree.links 472 | node_tree.mitsuba_nodes.nodetree = mitsuba_tree.name 473 | 474 | elif root['__info__']['node_tree_id'] in ("an_AnimationNodeTree", "SverchCustomTreeType"): 475 | node_tree = bpy.data.node_groups.new(name=root['__info__']['node_tree_name'], 476 | type=root['__info__']['node_tree_id']) 477 | context.space_data.node_tree = node_tree 478 | nodes = node_tree.nodes 479 | links = node_tree.links 480 | 481 | elif root['__info__']['node_tree_id'] == "TextureNodeTree": 482 | node_tree = bpy.data.textures.new(name=root['__info__']['node_tree_name'], type='NONE') 483 | node_tree.use_nodes = True 484 | nodes = node_tree.node_tree.nodes 485 | links = node_tree.node_tree.links 486 | 487 | # remove any default nodes 488 | for i in nodes: 489 | nodes.remove(i) 490 | 491 | # import dependencies 492 | dependencies = root['__info__']['dependencies'] 493 | depend_errors = 0 494 | 495 | for depend in dependencies: 496 | if depend[0] == "image" and depend[1] not in bpy.data.images: 497 | try: 498 | if root['__info__']['path_type'] == "relative": 499 | image = bpy.data.images.load(folder_path + os_file_sep + depend[1]) 500 | else: 501 | image = bpy.data.images.load(depend[2]) 502 | image.name = depend[1] # set name in-case the image was renamed 503 | except RuntimeError: 504 | depend_errors += 1 505 | 506 | if depend_errors: 507 | self.report({"ERROR"}, "NodeIO: " + str(depend_errors) + " Dependency(ies) Couldn't Be Loaded") 508 | 509 | # add new nodes 510 | order = root['__info__']['group_order'] 511 | for group_name in order: 512 | if group_name not in bpy.data.node_groups or group_name == "main": # create only if needed 513 | group = root[group_name] 514 | 515 | # set up which node tree to use (used for node groups in node tree) 516 | if group_name == "main": 517 | nt = nodes 518 | elif root['__info__']['node_tree_id'] == "ShaderNodeTree": 519 | nt = bpy.data.node_groups.new(group_name, "ShaderNodeTree") 520 | elif root['__info__']['node_tree_id'] == "TextureNodeTree": 521 | nt = bpy.data.node_groups.new(group_name, "TextureNodeTree") 522 | elif root['__info__']['node_tree_id'] == 'SverchCustomTreeType': 523 | nt = bpy.data.node_groups.new(group_name, 'SverchGroupTreeType') 524 | 525 | parents = [] 526 | 527 | for node in group['nodes']: 528 | parent = {} 529 | 530 | # check if node is custom then make sure it is installed 531 | if node["bl_idname"] == "GenericNoteNode" and \ 532 | ("generic_note" not in bpy.context.user_preferences.addons.keys() and 533 | "genericnote" not in bpy.context.user_preferences.addons.keys()): 534 | self.report({"WARNING"}, "Generic Note Node Add-on Not Installed") 535 | else: 536 | # retrieve node name, create node 537 | node_id = node['bl_idname'] 538 | if node_id[0:11] == "SvGroupNode": # find what the node_groups id is and use it 539 | node_id = bpy.data.node_groups[node['monad.name']].cls_bl_idname 540 | 541 | if group_name == "main": 542 | temp = nt.new(node_id) 543 | else: 544 | temp = nt.nodes.new(node_id) 545 | 546 | # node specific is first so that groups are set up first 547 | nos = node["node_specific"] 548 | if nos: 549 | for i in range(0, len(nos), 2): # step by two because name, value, name, value... 550 | att = nos[i] 551 | val = nos[i + 1] 552 | 553 | # group node inputs and outputs 554 | if att in ("group_input", "group_output"): 555 | for sub in range(0, len(val), 2): 556 | if att == "group_input" and val[sub] != "NodeSocketVirtual": 557 | nt.inputs.new(val[sub], val[sub + 1]) 558 | elif att == "group_output" and val[sub] != "NodeSocketVirtual": 559 | nt.outputs.new(val[sub], val[sub + 1]) 560 | 561 | elif att == "parent" and val is not None: # don't set parent in case not created yet 562 | parent['parent'] = val 563 | elif val is not None: 564 | set_attributes(self, temp, val, att) 565 | 566 | # inputs 567 | if node['inputs']: 568 | for i in node['inputs']: 569 | for val_key in i['values'].keys(): 570 | if isinstance(i['values'][val_key], str): 571 | exec("temp.inputs[{}].{} = '{}'".format(i['index'], val_key, 572 | i['values'][val_key])) 573 | else: 574 | exec("temp.inputs[{}].{} = {}".format(i['index'], val_key, 575 | i['values'][val_key])) 576 | 577 | # outputs 578 | if node['outputs']: 579 | for i in node['outputs']: 580 | for val_key in i['values'].keys(): 581 | if isinstance(i['values'][val_key], str): 582 | exec("temp.outputs[{}].{} = '{}'".format(i['index'], val_key, 583 | i['values'][val_key])) 584 | else: 585 | exec("temp.outputs[{}].{} = {}".format(i['index'], val_key, 586 | i['values'][val_key])) 587 | 588 | # deal with parents 589 | if parent: 590 | parent['node'] = temp.name 591 | parent['location'] = temp.location 592 | parents.append(parent) 593 | 594 | # set parents 595 | for parent in parents: 596 | if group_name != "main": 597 | nt.nodes[parent['node']].parent = nt.nodes[parent['parent']] 598 | nt.nodes[parent['node']].location = parent['location'] + nt.nodes[parent['parent']].location 599 | else: 600 | nt[parent['node']].parent = nt[parent['parent']] 601 | nt[parent['node']].location = parent['location'] + nt[parent['parent']].location 602 | 603 | if group_name == "main": 604 | use_nt, use_ln = nt, links 605 | else: 606 | use_nt, use_ln = nt.nodes, nt.links 607 | 608 | for link in group['links']: 609 | o = use_nt[link[0]].outputs[link[1]] 610 | i = use_nt[link[2]].inputs[link[3]] 611 | use_ln.new(o, i) 612 | 613 | # add material to object 614 | if context.object is not None and context.scene.node_io_is_auto_add: 615 | if root['__info__']['node_tree_id'] in ('ShaderNodeTree', 'MitsubaShaderNodeTree'): 616 | context.object.data.materials.append(node_tree) 617 | elif root['__info__']['node_tree_id'] == "TextureNodeTree" \ 618 | and context.active_object.active_material is not None: 619 | context.active_object.active_material.active_texture = node_tree 620 | 621 | self.report({"INFO"}, "NodeIO: Imported {} With {} Nodes".format(root['__info__']['node_tree_name'], 622 | root['__info__']['number_of_nodes'])) 623 | 624 | 625 | def set_attributes(self, temp, val, att): 626 | # determine attribute type, exec() can be used if value gets directly set to attribute 627 | if att == "image" and val in bpy.data.images: 628 | temp.image = bpy.data.images[val] 629 | elif att == 'an_list_size': # add correct number of inputs for animation node list 630 | temp.removeElementInputs() 631 | for i in range(val): 632 | temp.newInputSocket() 633 | elif att == "object" and val in bpy.data.objects: 634 | temp.object = bpy.data.objects[val] 635 | elif att == "particle_system" and val[0] in bpy.data.objects \ 636 | and val[1] in bpy.data.objects[val[0]].particle_systems: 637 | temp.particle_system = bpy.data.objects[val[0]].particle_systems[val[1]] 638 | elif att == "color_ramp.elements": 639 | e = temp.color_ramp.elements 640 | if len(val) >= 2: 641 | e[0].position = val[0][0] 642 | e[0].color = val[0][1] 643 | e[1].position = val[1][0] 644 | e[1].color = val[1][1] 645 | del val[0:2] 646 | for el in val: 647 | e_temp = e.new(el[0]) 648 | e_temp.color = el[1] 649 | elif att == "node_tree.name" and val in bpy.data.node_groups: 650 | temp.node_tree = bpy.data.node_groups[val] 651 | elif att == "material" and val in bpy.data.materials: 652 | temp.material = bpy.data.materials[val] 653 | elif att == "mapping": 654 | if temp.bl_idname == "an_InterpolationFromCurveMappingNode": # contains ShaderNodeRGBCurve, which has curve 655 | node = temp.curveNode.mapping 656 | elif temp.bl_idname == "TextureNodeCurveTime": 657 | node = temp.curve 658 | else: 659 | node = temp.mapping 660 | 661 | # set curves 662 | node.black_level = val[0] 663 | node.white_level = val[1] 664 | node.clip_max_x = float(val[2]) 665 | node.clip_max_y = float(val[3]) 666 | node.clip_min_x = float(val[4]) 667 | node.clip_min_y = float(val[5]) 668 | node.use_clip = True if val[6] == "True" else False 669 | 670 | for i in range(7): 671 | del val[0] 672 | 673 | # go through each curve 674 | counter = 0 675 | for i in val: 676 | # set first two points 677 | curves = node.curves 678 | curves[counter].extend = i[0] 679 | del i[0] 680 | curves[counter].points[0].location = i[0][0] 681 | curves[counter].points[0].handle_type = i[0][1] 682 | curves[counter].points[1].location = i[1][0] 683 | curves[counter].points[1].handle_type = i[1][1] 684 | del i[0:2] 685 | for i2 in i: 686 | temp_point = node.curves[counter].points.new(i2[0][0], i2[0][1]) 687 | temp_point.handle_type = i2[1] 688 | counter += 1 689 | elif att == "texture" and val in bpy.data.textures: 690 | temp.texture = bpy.data.textures[val] 691 | else: 692 | try: 693 | if isinstance(val, str): 694 | exec("temp.{} = '{}'".format(att, val)) 695 | else: 696 | exec("temp.{} = {}".format(att, val)) 697 | except (AttributeError, TypeError) as e: 698 | self.report({"WARNING"}, "NodeIO: Error={}, Node Name={}, Node ID={}, Attribute={}, Value={}". 699 | format(type(e).__name__, temp.name, temp.bl_idname, att, val)) 700 | 701 | # PROPERTIES 702 | bpy.types.Scene.node_io_import_export = EnumProperty(name="Import/Export", items=(("1", "Import", ""), 703 | ("2", "Export", ""))) 704 | bpy.types.Scene.node_io_export_path = StringProperty(name="Export Path", subtype="DIR_PATH") 705 | bpy.types.Scene.node_io_import_path_file = StringProperty(name="Import Path", subtype="FILE_PATH") 706 | bpy.types.Scene.node_io_import_path_dir = StringProperty(name="Import Path", subtype="DIR_PATH") 707 | bpy.types.Scene.node_io_dependency_save_type = EnumProperty(name="Dependency Paths", items=(("1", "Absolute Paths", ""), 708 | ("2", "Make Paths Relative", 709 | "")), 710 | default="1") 711 | bpy.types.Scene.node_io_is_auto_add = BoolProperty(name="Add Node Tree To Object?", default=True) 712 | bpy.types.Scene.node_io_import_type = EnumProperty(name="Import Type", items=(("1", "File", "Imports Just Selected " + 713 | "File Unless .zip, In Which Case All " + 714 | "Files Within .zip Folder Are Imported"), 715 | ("2", "Folder", 716 | "Imports All Files Within Folder"))) 717 | bpy.types.Scene.node_io_is_compress = BoolProperty(name="Compress Folder?") 718 | 719 | 720 | class NodeIOPanel(bpy.types.Panel): 721 | bl_idname = "OBJECT_PT_node_io_panel" 722 | bl_label = "NodeIO Panel" 723 | bl_space_type = "NODE_EDITOR" 724 | bl_region_type = "UI" 725 | 726 | def draw(self, context): 727 | layout = self.layout 728 | layout.prop(context.scene, "node_io_import_export") 729 | layout.separator() 730 | 731 | if context.scene.node_io_import_export == "2": 732 | layout.prop(context.scene, "node_io_dependency_save_type") 733 | layout.prop(context.scene, "node_io_is_compress", icon="FILTER") 734 | layout.separator() 735 | layout.prop(context.scene, "node_io_export_path") 736 | layout.separator() 737 | layout.operator("export.node_io_export", icon="ZOOMOUT") 738 | 739 | else: 740 | layout.prop(context.scene, "node_io_import_type") 741 | layout.prop(context.scene, "node_io_is_auto_add", icon="NODETREE") 742 | layout.separator() 743 | 744 | if context.scene.node_io_import_type == "1": 745 | layout.prop(context.scene, "node_io_import_path_file") 746 | else: 747 | layout.prop(context.scene, "node_io_import_path_dir") 748 | layout.separator() 749 | 750 | layout.operator("import.node_io_import", icon="ZOOMIN") 751 | 752 | 753 | class NodeIOExport(bpy.types.Operator): 754 | bl_idname = "export.node_io_export" 755 | bl_label = "Export Node Tree" 756 | 757 | def execute(self, context): 758 | export_node_tree(self, context) 759 | return {"FINISHED"} 760 | 761 | 762 | class NodeIOImport(bpy.types.Operator): 763 | bl_idname = "import.node_io_import" 764 | bl_label = "Import Node Tree" 765 | 766 | def execute(self, context): 767 | import_node_tree(self, context) 768 | return {"FINISHED"} 769 | 770 | 771 | def register(): 772 | bpy.utils.register_module(__name__) 773 | 774 | 775 | def unregister(): 776 | bpy.utils.unregister_module(__name__) 777 | 778 | if __name__ == "__main__": 779 | register() 780 | --------------------------------------------------------------------------------