├── LICENSE ├── Makefile ├── README.md ├── csg2stp.sh ├── csg2xml.l └── xml2mak.c /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 | 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 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | # 2 | 3 | all: csg2xml xml2mak 4 | 5 | csg2xml: lex.yy.c csg2xml.l 6 | gcc -o csg2xml lex.yy.c -lfl 7 | 8 | xml2mak: xml2mak.c 9 | gcc -Wall -O2 -o xml2mak xml2mak.c -lexpat 10 | 11 | lex.yy.c: csg2xml.l 12 | flex csg2xml.l 13 | 14 | clean: 15 | rm -f csg2xml xml2mak lex.yy.c *.o 16 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # csg2stp 2 | convert openscad design to step brep 3 | 4 | ## Why 5 | The mesh output from OpenSCAD is not suitable for CNC (the actual shapes are not preserved to compile sane G-CODE). There's no way to add these information after the object is "rendered" to mesh, these information are lost forever. The arcs are turned to polygons, the surfaces are also turned to a mesh, etc. Because of this the only way to build a usable STEP file is to go back to the CSG output of OpenSCAD and rebuild the object using OPENCASCADE which is the only open source BREP library I know. 6 | 7 | ## Requirements 8 | Use my fork of OCC-CSG: 9 | https://github.com/gega/OCC-CSG.git 10 | branch: sweep 11 | 12 | This fork has the necessary changes to support the complex conversions: 13 | 14 | - sweep command for rotate_extrude 15 | - random rotation for rotationally symmetric primitives 16 | - brep analysis for csg operation to prevent crashes 17 | 18 | Compile and install this tool with the extended features. 19 | 20 | You also need to have OpenSCAD installed and available in your path. 21 | 22 | ## Usage 23 | 24 | csg2stp.sh part.scad [loops] [args] 25 | 26 | - **part.scad:** the OpenSCAD file to be converted 27 | - **loops:** number of STEP parts generated 28 | 29 | _for complex objects multiple rounds needed to convert successfully_ 30 | 31 | [default: 1] 32 | - **args:** additional OpenSCAD parameters 33 | 34 | [default: none] 35 | 36 | ## Manual Operation 37 | 38 | 1. compile and install OCC-CSG (use my fork and the sweep branch) 39 | 40 | ```git clone https://github.com/gega/OCC-CSG.git ; cd OCC-CSG ; git checkout sweep ; mkdir build ; cd build ; cmake .. ; make ; sudo make install``` 41 | 42 | 3. build these utilities with cloning this repo and make 43 | 44 | ```git clone git@github.com:gega/csg2stp.git ; cd csg2stp ; make``` 45 | 46 | 4. open your design in OpenSCAD, render and export as CSG 47 | 48 | ```openscad -o model.csg model.scad``` 49 | 50 | 5. feed the csg to csg2xml and redirect the stdout to an xml file 51 | 52 | ```./csg2xml model.xml``` 53 | 54 | 6. use xml2mak to generate a makefile 55 | 56 | ```./xml2mak model.xml model.stp >model.mak``` 57 | 58 | 7. use make -f with the generated makefile 59 | 60 | ```make -f model.mak``` 61 | 62 | 8. model.stp is generated, check if valid and complete, if not, go to step 6 and try again 63 | 64 | ## Fine Print 65 | 66 | **NOTE:** The following OpenSCAD commands are not supported because OPENCASCADE doesn't implement them: 67 | - hull 68 | - import 69 | - projection 70 | - minkowski 71 | 72 | **WARNING:** The process is not deterministic, for some models it needs to be converted several times in order to get the proper results! 73 | -------------------------------------------------------------------------------- /csg2stp.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | # consts 4 | CSG2STPDIR=./ 5 | TMPDIR=$(mktemp -d) 6 | PAR=$(nproc --all) 7 | 8 | SCAD=$1 9 | PCS=$2 10 | 11 | ERR=0 12 | 13 | if [ x"$SCAD" == x"" ]; then 14 | ERR=1 15 | else 16 | shift 17 | fi 18 | 19 | if [ x"$PCS" == x"" ]; then 20 | PCS=1 21 | else 22 | shift 23 | fi 24 | 25 | NAM=$(basename $SCAD .scad) 26 | 27 | if [ ! -f $SCAD ]; then 28 | echo "$SCAD not found" 29 | ERR=1 30 | fi 31 | 32 | if [ $ERR -ne 0 ]; then 33 | echo "Usage: $0 part.scad [loops] [openscad argument list]" 34 | echo " The generation contains some randomization" 35 | echo " and because of that multiple generation may" 36 | echo " necessary. Use the 'loops' parameter to define" 37 | echo " the number of STEP files generated." 38 | exit 0 39 | fi 40 | 41 | openscad -o $TMPDIR/$NAM.csg "$@" $SCAD 42 | test $? -eq 0 || exit 1 43 | $CSG2STPDIR/csg2xml <$TMPDIR/$NAM.csg >$TMPDIR/$NAM.xml 44 | test $? -eq 0 || exit 2 45 | $CSG2STPDIR/xml2mak $TMPDIR/$NAM.xml $NAM.stp >$TMPDIR/$NAM.mak 46 | test $? -eq 0 || exit 3 47 | 48 | for((i=0;i<$PCS;i++)) do 49 | make -j$PAR -f $TMPDIR/$NAM.mak &>/dev/null 50 | if [ -f $NAM.stp ]; then 51 | if [ $PCS -gt 1 ]; then 52 | mv $NAM.stp $NAM-$i.stp 53 | echo "$NAM-$i.stp done" 54 | else 55 | echo "$NAM.stp done" 56 | fi 57 | fi 58 | done 59 | 60 | rm -rf $TMPDIR 61 | -------------------------------------------------------------------------------- /csg2xml.l: -------------------------------------------------------------------------------- 1 | %{ 2 | #include 3 | 4 | #define STACKMAX 1000 5 | char *stack[STACKMAX]; 6 | int stackp=0; 7 | int mode=0; 8 | int mc=0; 9 | int deep=0; 10 | 11 | #define PUSH(a) stack[stackp++]=(a) 12 | #define POP() stack[--stackp] 13 | #define PEEK() stack[stackp] 14 | 15 | %} 16 | 17 | %% 18 | 19 | 20 | [a-z_]*[(] { 21 | if(NULL!=yytext) { 22 | yytext[strlen(yytext)-1]='\0'; 23 | printf("<%s",yytext); 24 | } 25 | PUSH(strdup(yytext)); 26 | mode=mc=0; 27 | } 28 | [a-zA-Z$\"_][-a-zA-Z_0-9\.\"]* { 29 | if(mode==0) { 30 | if(yytext[0]!='$') { 31 | printf(" %s",yytext); 32 | mode=1; 33 | } else mode=0; 34 | } else if(mode==2) { 35 | printf("=\"%s%s",(yytext[0]=='"'?&yytext[1]:yytext),(yytext[0]=='"'?"":"\"")); 36 | mode=0; 37 | } 38 | } 39 | 40 | \= { if(mode==1) mode=2; 41 | } 42 | [-0-9][-\.0-9e]* { 43 | double v; 44 | sscanf(yytext,"%lf",&v); 45 | if(mode==2) { printf("=\"%.16g\"",v); 46 | mode=0; } 47 | else if(mode==3) { 48 | printf(" t%d=\"%.16g\"",++mc,v); 49 | } 50 | else if(mode==4) { 51 | printf("%s%.16g",(mc++==0?"":","),v); 52 | } 53 | } 54 | 55 | \" ; 56 | \[ { 57 | if(mode==0) mode=3; 58 | else if(mode==2) { printf("=\""); mode=4; deep=1; } 59 | else if(mode==4) deep++; 60 | } 61 | \] { 62 | if(mode==4) { 63 | if(--deep==0) { printf("\""); mode=0; } 64 | } else mode=0; 65 | } 66 | \, ; 67 | \) ; 68 | \{ { printf(">\n"); } 69 | \} { char *s=POP(); printf("\n",s); free(s); } 70 | ; { printf("/>\n"); free(POP()); } 71 | [ \t\n]+ ; 72 | 73 | %% 74 | 75 | int main(void) { 76 | printf("\n"); 77 | yylex(); 78 | printf("\n"); 79 | return 0; 80 | } 81 | -------------------------------------------------------------------------------- /xml2mak.c: -------------------------------------------------------------------------------- 1 | /* gcc -Wall -O2 -o xml2mak xml2mak.c -lexpat 2 | * 3 | * csg xml to occ-csg makefile generator 4 | * 5 | This file is part of csg2stp. 6 | 7 | csg2stp is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Affero General Public License as 9 | published by the Free Software Foundation, either version 3 of 10 | the License, or (at your option) any later version. 11 | 12 | Foobar is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU Affero General Public License for more details. 16 | 17 | You should have received a copy of the GNU Affero General 18 | Public License along with Foobar. 19 | If not, see . 20 | * 21 | */ 22 | #define _GNU_SOURCE 23 | 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | 36 | 37 | struct trav; 38 | struct tag; 39 | 40 | 41 | int ac_circle(int mode, struct trav *trv, const char *fres, const char **at); 42 | int ac_cube(int mode, struct trav *trv, const char *fres, const char **at); 43 | int ac_cylinder(int mode, struct trav *trv, const char *fres, const char **at); 44 | int ac_difference(int mode, struct trav *trv, const char *fres, const char **at); 45 | int ac_union(int mode, struct trav *trv, const char *fres, const char **at); 46 | int ac_intersection(int mode, struct trav *trv, const char *fres, const char **at); 47 | int ac_linear_extrude(int mode, struct trav *trv, const char *fres, const char **at); 48 | int ac_polygon(int mode, struct trav *trv, const char *fres, const char **at); 49 | int ac_polyhedron(int mode, struct trav *trv, const char *fres, const char **at); 50 | int ac_projection(int mode, struct trav *trv, const char *fres, const char **at); 51 | int ac_rotate_extrude(int mode, struct trav *trv, const char *fres, const char **at); 52 | int ac_sphere(int mode, struct trav *trv, const char *fres, const char **at); 53 | int ac_square(int mode, struct trav *trv, const char *fres, const char **at); 54 | 55 | 56 | #define OCCEXELONG "occ-csg" 57 | #define OCCSWPEXELONG "occ-csg" 58 | #define OCCEXE "occ-csg" 59 | #define OCCSWPEXE "occ-csg" 60 | #define MV "mv" 61 | #define RM "rm" 62 | #define STACKSIZE 100 63 | 64 | #define FL_SHORT (1L<<0) 65 | #define FL_IGNORE (1L<<1) 66 | #define FL_ERROR (1L<<2) 67 | #define FL_START (1L<<3) 68 | #define FL_END (1L<<4) 69 | 70 | #define EPSILON 0.00001 71 | #define FEQ(a,b) (fabs((a)-(b))stkp>=STACKSIZE) { fprintf(stderr,"stack overflow!\n"); exit(0); } \ 75 | trv->stk[1+trv->stkp].tag=t; \ 76 | trv->stk[1+trv->stkp].num=0; \ 77 | trv->stk[1+trv->stkp].att=strdup(a); \ 78 | trv->stk[1+trv->stkp].frs=f; \ 79 | trv->stk[1+trv->stkp].id=i; \ 80 | trv->stkp++; \ 81 | } while(0) 82 | 83 | #define POP(t) do { \ 84 | if(trv->stkp<=0) { fprintf(stderr,"stack underflow!\n"); exit(0); } \ 85 | if(NULL!=trv->stk[trv->stkp].att) free(trv->stk[trv->stkp].att); \ 86 | if(NULL!=trv->stk[trv->stkp].frs) free(trv->stk[trv->stkp].frs); \ 87 | --trv->stkp; \ 88 | } while(0) 89 | 90 | #define PEEK(n) (&trv->stk[trv->stkp+(n)]) 91 | 92 | 93 | struct stack 94 | { 95 | int num; 96 | const struct tag *tag; 97 | char *att; 98 | char *frs; 99 | int id; 100 | }; 101 | 102 | struct trav 103 | { 104 | int depth; 105 | int tagc; 106 | struct stack stk[STACKSIZE]; 107 | int stkp; 108 | const char *tmp; 109 | const char *out; 110 | }; 111 | 112 | struct tag 113 | { 114 | char *name; 115 | int (*action)(int,struct trav *,const char *,const char **); 116 | int flags; 117 | }; 118 | 119 | 120 | static const struct tag tags[]= 121 | { 122 | { "circle", ac_circle, FL_SHORT }, 123 | { "color", NULL, FL_IGNORE }, 124 | { "cube", ac_cube, FL_SHORT }, 125 | { "cylinder", ac_cylinder, FL_SHORT }, 126 | { "difference", ac_difference, 0 }, 127 | { "group", NULL, FL_IGNORE }, 128 | { "hull", NULL, FL_ERROR }, 129 | { "import", NULL, FL_ERROR }, 130 | { "intersection", ac_intersection, 0 }, 131 | { "linear_extrude", ac_linear_extrude, 0 }, 132 | { "multmatrix", ac_union, 0 }, 133 | { "polygon", ac_polygon, FL_SHORT }, 134 | { "polyhedron", ac_polyhedron, FL_SHORT }, 135 | { "projection", NULL, FL_ERROR }, 136 | { "render", NULL, FL_IGNORE }, 137 | { "rotate_extrude", ac_rotate_extrude, 0 }, 138 | { "sphere", ac_sphere, FL_SHORT }, 139 | { "union", ac_union, 0 }, 140 | { "csg", NULL, 0 }, 141 | { "square", ac_square, FL_SHORT }, 142 | {NULL} 143 | }; 144 | 145 | 146 | static char *fresult(struct trav *trv, int m, int num) 147 | { 148 | int ln,n=0; 149 | char *ret=NULL; 150 | 151 | if(NULL!=trv&&trv->stkp>0) 152 | { 153 | if(num<0) num=PEEK(n)->num; 154 | ln=strlen(trv->tmp)+100; 155 | if(NULL!=(ret=malloc(ln))) 156 | { 157 | if(m==0) snprintf(ret,ln,"%d_%s%d_%s_%d.stp", PEEK(n)->id,trv->tmp,trv->depth,PEEK(n)->tag->name,num); 158 | else snprintf(ret,ln,"%d_%s%d_%s_%d_TMP_%d.stp",PEEK(n)->id,trv->tmp,trv->depth,PEEK(n)->tag->name,num,m); 159 | } 160 | } 161 | 162 | return(ret); 163 | } 164 | 165 | static const char *getattr(const char **at, char *nd) 166 | { 167 | const char *ret=NULL; 168 | int i; 169 | 170 | if(at!=NULL) 171 | { 172 | for(i=0;at[i]!=NULL;i+=2) 173 | { 174 | if(strcmp(at[i],nd)==0) ret=at[i+1]; 175 | } 176 | } 177 | return(ret); 178 | } 179 | 180 | int chain(struct trav *trv, const char *fres, const char *op) 181 | { 182 | int i,n; 183 | char *ftmpres,*fsrc; 184 | 185 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 186 | n=PEEK(0)->num; 187 | if(n>0) 188 | { 189 | fsrc=fresult(trv,1,0); 190 | for(i=1;i<=n;i++) 191 | { 192 | ftmpres=fresult(trv,i+1,-1); 193 | printf("# %d %s\n",__LINE__,__FUNCTION__); 194 | if(i==1) printf("$(T)/%s:\t$(T)/%s\n\t\t%s $(T)/%s $(T)/%s\n",ftmpres,fresult(trv,0,i),MV,fresult(trv,0,i),ftmpres); 195 | else printf("$(T)/%s:\t$(T)/%s $(T)/%s\n\t\t%s %s $(T)/%s $(T)/%s $(T)/%s 0.5 0.03\n",(i 213 | // --create 2d:circle x,y,r 214 | int ac_circle(int mode, struct trav *trv, const char *fres, const char **at) 215 | { 216 | double r; 217 | 218 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 219 | r=atof(getattr(at,"r")); 220 | printf("$(T)/%s:\n\t\t%s --create 2d:circle 0,0,%g $(T)/%s\n",fres,OCCEXE,r,fres); 221 | 222 | return(0); 223 | } 224 | 225 | // 226 | // --create box x1,y1,z1,x2,y2,z2 227 | // --transform scale sx,sy,sz 228 | int ac_cube(int mode, struct trav *trv, const char *fres, const char **at) 229 | { 230 | char *f1; 231 | 232 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 233 | 234 | // 1x1x1 box 235 | f1=fresult(trv,1,-1); 236 | printf("$(T)/%s:\n",fres); 237 | if(strcmp(getattr(at,"center"),"true")==0) printf("\t\t%s --create box -0.5,-0.5,-0.5,0.5,0.5,0.5 $(T)/%s\n",OCCEXE,f1); 238 | else printf("\t\t%s --create box 0,0,0,1,1,1 $(T)/%s\n",OCCEXE,f1); 239 | // scale to size 240 | printf("\t\t%s --transform scale %s $(T)/%s $(T)/%s\n",OCCEXE,getattr(at,"size"),f1,fres); 241 | printf("\t\t%s -f $(T)/%s\n",RM,f1); 242 | free(f1); 243 | 244 | return(0); 245 | } 246 | 247 | // 248 | // cylinder (1xd) --create cyl x1,y1,z1,r,h 249 | // cylinder (2xd) --create cone x1,y1,z1,r1,r2,h 250 | int ac_cylinder(int mode, struct trav *trv, const char *fres, const char **at) 251 | { 252 | double h,r1,r2; 253 | char *f1; 254 | 255 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 256 | h=atof(getattr(at,"h")); 257 | r1=atof(getattr(at,"r1")); 258 | r2=atof(getattr(at,"r2")); 259 | f1=fresult(trv,1,-1); 260 | printf("$(T)/%s:\n",fres); 261 | if(FEQ(r1,r2)) printf("\t\t%s --create cyl 0,0,0,%g,%g $(T)/%s\n",OCCEXE,r1,h,f1); 262 | else printf("\t\t%s --create cone 0,0,0,%g,%g,%g $(T)/%s\n",OCCEXE,r1,r2,h,f1); 263 | if(strcmp(getattr(at,"center"),"true")==0) printf("\t\t%s --transform translate 0,0,%g $(T)/%s $(T)/%s\n\t\t%s $(T)/%s\n",OCCEXE,-(h/2.0),f1,fres,RM,f1); 264 | else printf("\t\t%s $(T)/%s $(T)/%s\n",MV,f1,fres); 265 | free(f1); 266 | 267 | return(0); 268 | } 269 | 270 | // occ-csg --csg difference file1.stp file2.stp file-out.stp 271 | int ac_difference(int mode, struct trav *trv, const char *fres, const char **at) 272 | { 273 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 274 | if(mode==FL_END) chain(trv,fres,"--csg difference"); 275 | return(0); 276 | } 277 | 278 | // convert 4x4 matrix to 4x3 matrix 279 | static char *transmatrix(char *m) 280 | { 281 | int i,n; 282 | if(NULL!=m) for(i=n=0;m[i]!='\0';i++) if(m[i]==','&&++n>=12) m[i]='\0'; 283 | return(m); 284 | } 285 | 286 | int ac_union(int mode, struct trav *trv, const char *fres, const char **at) 287 | { 288 | char *f1; 289 | 290 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 291 | if(mode==FL_END&&PEEK(0)->num>0) 292 | { 293 | f1=fresult(trv,1,-1); 294 | chain(trv,f1,"--csg union"); 295 | printf("$(T)/%s:\t$(T)/%s\n",fres,f1); 296 | if(NULL==PEEK(0)->att||PEEK(0)->att[0]=='\0') printf("\t\t%s $(T)/%s $(T)/%s\n",MV,f1,fres); 297 | else printf("\t\t%s --transform matrix %s $(T)/%s $(T)/%s\n\t\t%s $(T)/%s\n",OCCEXE,transmatrix(PEEK(0)->att),f1,fres,RM,f1); 298 | free(f1); 299 | } 300 | return(0); 301 | } 302 | 303 | int ac_intersection(int mode, struct trav *trv, const char *fres, const char **at) 304 | { 305 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 306 | if(mode==FL_END) chain(trv,fres,"--csg intersection"); 307 | return(0); 308 | } 309 | 310 | // 311 | // --create extrusion:file ex,ey,ez f.stp 312 | int ac_linear_extrude(int mode, struct trav *trv, const char *fres, const char **at) 313 | { 314 | int n; 315 | static int center=0; 316 | static double height=1; 317 | char *f1,*f2; 318 | 319 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 320 | if(mode==FL_START) height=atof(getattr(at,"height")); 321 | if(mode==FL_START) center=(strcmp("true",getattr(at,"center"))==0?1:0); 322 | if(mode==FL_END&&PEEK(0)->num>0) 323 | { 324 | n=PEEK(0)->num; 325 | if(n>0) 326 | { 327 | f1=fresult(trv,1,-1); 328 | f2=fresult(trv,2,-1); 329 | chain(trv,f1,"--csg union"); 330 | printf("$(T)/%s:\t$(T)/%s\n",fres,f1); 331 | printf("\t\t%s --create extrusion:file %g,%g,%g $(T)/%s $(T)/%s\n",OCCEXE,0.0,0.0,height,f1,f2); 332 | if(center) 333 | { 334 | printf("\t\t%s --transform translate 0,0,%g $(T)/%s $(T)/%s\n",OCCEXE,-height/2,f2,fres); 335 | } 336 | else 337 | { 338 | printf("\t\t%s $(T)/%s $(T)/%s\n",MV,f2,fres); 339 | } 340 | printf("\t\t%s -f $(T)/%s $(T)/%s\n",RM,f1,f2); 341 | free(f1); 342 | free(f2); 343 | } 344 | } 345 | return(0); 346 | } 347 | 348 | // 349 | // --create 2d:polygon x1,y1,x2,y2,... 2dpolygon.stp 350 | int ac_polygon(int mode, struct trav *trv, const char *fres, const char **at) 351 | { 352 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 353 | printf("$(T)/%s:\n\t\t%s --create 2d:polygon %s $(T)/%s\n",fres,OCCEXE,getattr(at,"points"),fres); 354 | return(0); 355 | } 356 | 357 | // 358 | // --create 2d:polygon x1,y1,x2,y2,x3,y3,x4,y4 359 | int ac_square(int mode, struct trav *trv, const char *fres, const char **at) 360 | { 361 | int center=0; 362 | double w,h; 363 | char *a; 364 | double x1,y1,x4,y4; 365 | 366 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 367 | center=(strcmp("true",getattr(at,"center"))==0?1:0); 368 | a=strdup(getattr(at,"size")); 369 | w=atof(a); 370 | h=atof(strchr(a,',')+1); 371 | if(center) 372 | { 373 | x1=-w/2.0; 374 | y1=h/2.0; 375 | x4=w/2.0; 376 | y4=-h/2.0; 377 | } 378 | else 379 | { 380 | x1=0; 381 | y1=h; 382 | x4=w; 383 | y4=0; 384 | } 385 | free(a); 386 | printf("$(T)/%s:\n\t\t%s --create 2d:polygon %g,%g,%g,%g,%g,%g,%g,%g,%g,%g $(T)/%s\n",fres,OCCEXE,x1,y1,x4,y1,x4,y4,x1,y4,x1,y1,fres); 387 | return(0); 388 | } 389 | 390 | #define GETX(p,i) (p[i*3]) 391 | #define GETY(p,i) (p[i*3+1]) 392 | #define GETZ(p,i) (p[i*3+2]) 393 | 394 | // 398 | // occ-csg --create polygons x1,y1,z1,x2,y2,z2,... p1v1,p1v2,p1v3,...:p2v1,p2v2,p2v3,... polygons.stp 399 | int ac_polyhedron(int mode, struct trav *trv, const char *fres, const char **at) 400 | { 401 | double *xyz; 402 | int n,i,f1,f2,f3; 403 | char *p,*q; 404 | 405 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 406 | 407 | // read points 408 | p=strdup(getattr(at,"points")); 409 | for(n=1,q=p;*q;q++) if(*q==',') ++n; 410 | printf("$(T)/%s:\n\t\t%s --create polygons",fres,OCCEXE); 411 | xyz=calloc(n,sizeof(double)); 412 | for(q=p-1,i=0;q!=NULL;q=strchr(q,','),i++) 413 | { 414 | xyz[i]=atof(++q); 415 | printf("%c%.4g",(i==0?' ':','),xyz[i]); 416 | } 417 | 418 | // go on to faces 419 | free(p); 420 | p=strdup(getattr(at,"faces")); 421 | for(q=p,i=0;q!=NULL;i++) 422 | { 423 | q=strchr(q,','); 424 | if(NULL==q) break; 425 | f1=atoi(++q); 426 | q=strchr(q,','); 427 | if(NULL==q) break; 428 | f2=atoi(++q); 429 | q=strchr(q,','); 430 | if(NULL==q) break; 431 | f3=atoi(++q); 432 | printf("%c%d,%d,%d",(i==0?' ':':'),f1,f2,f3); 433 | } 434 | printf(" $(T)/%s\n",fres); 435 | 436 | free(p); 437 | free(xyz); 438 | return(0); 439 | } 440 | 441 | #define PI 3.14159265358979323846 442 | #define ANGLE_360 999 443 | // 444 | // 2d:circle - rotate/translate 2d:polygon - rotate/translate 2d:polygon ==> path.stp 445 | // extrude over path 446 | int ac_rotate_extrude(int mode, struct trav *trv, const char *fres, const char **at) 447 | { 448 | int n; 449 | static double angle=0; 450 | char *f1,*f2; 451 | 452 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 453 | if(mode==FL_START) angle=atof(getattr(at,"angle")); 454 | if(mode==FL_END&&PEEK(0)->num>0) 455 | { 456 | n=PEEK(0)->num; 457 | if(n>0) 458 | { 459 | f1=fresult(trv,1,-1); 460 | f2=fresult(trv,2,-1); 461 | chain(trv,f1,"--csg union"); 462 | printf("$(T)/%s:\t$(T)/%s\n",fres,f1); 463 | printf("\t\t%s --transform matrix 1,0,0,0,0,2.22045e-16,-1,0,0,1,2.22045e-16,0 $(T)/%s $(T)/%s\n",OCCEXE,f1,f2); 464 | printf("\t\t%s --create extrusion:sweep %.2f Z $(T)/%s $(T)/%s\n",OCCSWPEXE,angle,f2,fres); 465 | printf("\t\t%s $(T)/%s $(T)/%s\n",RM,f1,f2); 466 | free(f1); 467 | free(f2); 468 | } 469 | } 470 | return(0); 471 | } 472 | 473 | // 474 | // occ-csg --create sphere x1,y1,z1,r sphere.stp 475 | int ac_sphere(int mode, struct trav *trv, const char *fres, const char **at) 476 | { 477 | double r; 478 | printf("\n# %s at %d --> %s\n",__FUNCTION__,trv->tagc,fres); 479 | r=atof(getattr(at,"r")); 480 | printf("$(T)/%s:\n\t\t%s --create sphere 0,0,0,%g $(T)/%s\n",fres,OCCEXE,r,fres); 481 | return(0); 482 | } 483 | 484 | 485 | static char *strattr(const char **at) 486 | { 487 | char *ret; 488 | int i,l; 489 | 490 | ret=calloc(1,1); 491 | for(i=l=0;at[i]!=NULL;i+=2) 492 | { 493 | l+=strlen(at[i+1])+1; 494 | ret=realloc(ret,l+1); 495 | if(i>0) strcat(ret,","); 496 | strcat(ret,at[i+1]); 497 | } 498 | 499 | return(ret); 500 | } 501 | 502 | static const struct tag *findtag(const struct tag *ts, const char *tg) 503 | { 504 | if(NULL!=ts) { while(NULL!=ts->name) if(strcmp(ts->name,tg)==0) break; else ts++; } 505 | 506 | return(ts); 507 | } 508 | 509 | static void start_element(void *dt, const char *el, const char **at) 510 | { 511 | static int cnt=1000; 512 | struct trav *trv=(struct trav *)dt; 513 | const struct tag *t=findtag(tags,el); 514 | char *a; 515 | 516 | ++cnt; 517 | if(NULL!=t&&(t->flags&FL_IGNORE)==0) 518 | { 519 | trv->tagc++; 520 | if((t->flags&FL_ERROR)!=0) 521 | { 522 | fprintf(stderr,"error: tag '%s' not supported\n",el); 523 | printf("echo 'error: unsupported operation: %s'\n",el); 524 | printf("exit\n"); 525 | exit(1); 526 | } 527 | PEEK(0)->num++; 528 | a=strattr(at); 529 | char *f=fresult(trv,0,-1); 530 | PUSH(t,a,f,cnt); 531 | free(a); 532 | trv->depth++; 533 | printf("\n"); 534 | if(NULL!=t->action) t->action(FL_START,trv,PEEK(0)->frs,at); 535 | } 536 | else if(t==NULL) 537 | { 538 | fprintf(stderr,"***UNKNOWN tag: %s\n",el); 539 | exit(1); 540 | } 541 | } 542 | 543 | static void end_element(void *data, const char *el) 544 | { 545 | struct trav *trv=(struct trav *)data; 546 | const struct tag *t=findtag(tags,el); 547 | 548 | if(NULL!=t&&(t->flags&FL_IGNORE)==0) 549 | { 550 | if(NULL!=t->action&&(t->flags&FL_SHORT)==0) t->action(FL_END,trv,PEEK(0)->frs,NULL); 551 | if(trv->depth==2) printf("\n$(T)/%s:\t$(T)/%s\n\t\t%s $(T)/%s $(T)/%s\n",trv->out,PEEK(0)->frs,MV,PEEK(0)->frs,trv->out); 552 | POP(); 553 | trv->depth--; 554 | } 555 | } 556 | 557 | int parse_xml(char *csg, char *out) 558 | { 559 | struct trav traversal; 560 | struct trav *trv=&traversal; 561 | int ret=0; 562 | 563 | memset(trv,0,sizeof(struct trav)); 564 | trv->tmp="tmp_"; 565 | trv->out="brep_result"; 566 | if(NULL!=csg) 567 | { 568 | int ln=strlen(csg); 569 | printf("# makefile for %s\n\nT := $(shell mktemp -d)\n\n$(info WDIR=$(T))\n\nall:\t%s\n\n",out,out); 570 | XML_Parser parser = XML_ParserCreate(NULL); 571 | XML_SetElementHandler(parser, start_element, end_element); 572 | XML_SetUserData(parser, (void *)trv); 573 | 574 | if (XML_Parse(parser, csg, ln, XML_TRUE) == XML_STATUS_ERROR) 575 | { 576 | fprintf(stderr,"error: %s\n", XML_ErrorString(XML_GetErrorCode(parser))); 577 | ret=-1; 578 | } 579 | XML_ParserFree(parser); 580 | printf("\n%s:\t$(T)/%s\n\t\t%s $(T)/%s %s\n",out,trv->out,MV,trv->out,out); 581 | printf("\t\t%s -rf $T\n",RM); 582 | } 583 | 584 | return(ret); 585 | } 586 | 587 | int main(int argc, char **argv) 588 | { 589 | FILE *f; 590 | struct stat sb; 591 | char *csg; 592 | int ret=0,r; 593 | 594 | if(argc<3) 595 | { 596 | printf("Usage: %s csg.xml out.mak\n",argv[0]); 597 | exit(0); 598 | } 599 | f=fopen(argv[1],"r"); 600 | if(f!=NULL) 601 | { 602 | if(0==fstat(fileno(f),&sb)&&sb.st_size>0) 603 | { 604 | csg=malloc(sb.st_size+1); 605 | if(csg!=NULL) 606 | { 607 | csg[0]='\0'; 608 | if(0<(r=fread(csg,sizeof(char),sb.st_size,f))) 609 | { 610 | csg[r]='\0'; 611 | parse_xml(csg,argv[2]); 612 | } 613 | free(csg); 614 | } 615 | else ret=10; 616 | } 617 | else 618 | { 619 | fprintf(stderr,"fstat failed on '%s'\n",argv[1]); 620 | ret=3; 621 | } 622 | fclose(f); 623 | } 624 | else 625 | { 626 | fprintf(stderr,"failed to open csg xml file '%s'\n",argv[1]); 627 | ret=2; 628 | } 629 | 630 | return(ret); 631 | } 632 | --------------------------------------------------------------------------------