├── .gitignore ├── .travis.yml ├── Cargo.toml ├── LICENSE ├── README.md ├── xml-schema-tests ├── Cargo.toml ├── build.rs ├── src │ ├── lib.rs │ ├── po.rs │ └── po.xsd └── tests │ └── po.rs └── xml-schema ├── Cargo.toml ├── src ├── bigfloat.rs ├── bin │ └── gen.rs ├── lib.rs ├── macros.rs ├── names.rs ├── parser.rs ├── parser_generator.rs ├── primitives.rs ├── processor.rs ├── support.rs ├── test_parser.rs ├── test_parser_schema.rs └── xml_utils.rs └── tests └── po.rs /.gitignore: -------------------------------------------------------------------------------- 1 | # Generated by Cargo 2 | # will have compiled files and executables 3 | /target/ 4 | 5 | # Remove Cargo.lock from gitignore if creating an executable, leave it for libraries 6 | # More information here https://doc.rust-lang.org/cargo/guide/cargo-toml-vs-cargo-lock.html 7 | Cargo.lock 8 | 9 | # These are backup files generated by rustfmt 10 | **/*.rs.bk 11 | 12 | /target 13 | **/*.rs.bk 14 | Cargo.lock 15 | 16 | *.xsd 17 | *.nxsd 18 | *.xml 19 | foo.rs 20 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: rust 2 | rust: 3 | - stable 4 | - beta 5 | - nightly 6 | cache: cargo 7 | script: 8 | - wget https://www.w3.org/2009/XMLSchema/XMLSchema.xsd -O xml-schema/XMLSchema.xsd 9 | - wget https://www.w3.org/2009/XMLSchema/derived.nxsd -O xml-schema/derived.nxsd 10 | - cargo test 11 | - cargo run --package xml-schema --bin gen xml-schema/derived.nxsd xml-schema/XMLSchema.xsd > foo.rs 12 | - diff foo.rs xml-schema/src/parser.rs # Fails if they are different. 13 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [workspace] 2 | 3 | members = [ 4 | "xml-schema", 5 | "xml-schema-tests", 6 | ] 7 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published 637 | by the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # rust-xml-schema 2 | XML Parser generator based on XML schemas. 3 | 4 | Project status: pre-alpha 5 | 6 | ## Features 7 | 8 | * Self-generating, meaning that all features used by `XMLSchema.xsd` 9 | (XML Schema's definition using XML Schema itself) are supported. 10 | This includes: 11 | * namespaces 12 | * group/choice/sequence/element 13 | * attributes 14 | * Most datatypes (some natively implemented, some generated via `derived.nxsd`) 15 | * Anonymous elements are given a name using a best-effort heuristic -- they 16 | are manually overridable 17 | 18 | ## To do 19 | 20 | * simpleContent 21 | * some facets 22 | * anything related to XPath 23 | * assertions 24 | * time data types 25 | * notation 26 | * many other stuff, grep for `TODO`, `unimplemented`, `unwrap`, or `expect` in the code. 27 | * add tests 28 | * check conformance to the XSD specification 29 | 30 | ## Regenerating the schema parser 31 | 32 | ``` 33 | wget https://www.w3.org/2009/XMLSchema/XMLSchema.xsd -O xml-schema/XMLSchema.xsd 34 | wget https://www.w3.org/2009/XMLSchema/derived.nxsd -O xml-schema/derived.nxsd 35 | cargo run --package xml-schema --bin gen xml-schema/derived.nxsd xml-schema/XMLSchema.xsd > foo.rs 36 | cp foo.rs xml-schema/src/parser.rs 37 | cargo test 38 | ``` 39 | 40 | -------------------------------------------------------------------------------- /xml-schema-tests/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "xml-schema-tests" 3 | version = "0.1.0" 4 | authors = ["Valentin Lorentz "] 5 | build = "build.rs" 6 | 7 | [dependencies] 8 | xml-schema = { path = "../xml-schema" } 9 | pretty_assertions = "0.4" 10 | 11 | [build-dependencies] 12 | xml-schema = { path = "../xml-schema" } 13 | -------------------------------------------------------------------------------- /xml-schema-tests/build.rs: -------------------------------------------------------------------------------- 1 | extern crate xml_schema; 2 | 3 | use std::env; 4 | use std::fs::{File, read_dir}; 5 | use std::io::{Read, Write}; 6 | use std::path::Path; 7 | use std::ffi::OsStr; 8 | use std::env::current_dir; 9 | 10 | use xml_schema::{Processor, ParserGenerator, parse_xsd}; 11 | 12 | fn main() { 13 | let mut in_dir = current_dir().unwrap(); 14 | in_dir.push("src"); 15 | let out_dir = env::var("OUT_DIR").unwrap(); 16 | 17 | println!("cargo:rerun-if-changed=build.rs"); 18 | 19 | for entry in read_dir(in_dir.clone()).expect(&format!("Could not read dir {:?}", in_dir)) { 20 | let in_path = entry.unwrap().path(); 21 | if in_path.extension() != Some(&OsStr::new("xsd")) { 22 | continue; 23 | } 24 | println!("cargo:rerun-if-changed={}", in_path.to_str().unwrap()); 25 | 26 | let mut in_file = 27 | File::open(in_path.clone()) 28 | .expect(&format!("Could not open {:?}", in_path)); 29 | let mut in_xml = String::new(); 30 | in_file 31 | .read_to_string(&mut in_xml) 32 | .expect(&format!("Could not read {:?}", in_path)); 33 | let (document, parse_context) = parse_xsd(&in_xml); 34 | let document = document.expect(&format!("Could not parse {:?}", in_path)); 35 | 36 | let mut proc = Processor::new(&document); 37 | proc.process_ast(&document); 38 | 39 | let renames = Default::default(); 40 | let mut gen = ParserGenerator::new(vec![proc], &parse_context, renames); 41 | let scope = gen.gen_target_scope(); 42 | 43 | let filename = in_path.file_name().unwrap(); 44 | let out_path = 45 | Path::new(&out_dir) 46 | .join(filename) 47 | .with_extension("rs"); 48 | println!("cargo:warning=printing to: {}", out_path.to_str().unwrap()); 49 | let mut out_file = 50 | File::create(out_path.clone()) 51 | .expect(&format!("Could not create {:?}", out_path)); 52 | out_file 53 | .write(b"#[allow(unused_imports)]\nuse xml_schema::support;\n") 54 | .expect(&format!("Could not write in {:?}", out_path)); 55 | out_file 56 | .write(scope.to_string().as_bytes()) 57 | .expect(&format!("Could not write in {:?}", out_path)); 58 | } 59 | println!("cargo:rerun-if-changed={}", in_dir.to_str().unwrap()); 60 | } 61 | -------------------------------------------------------------------------------- /xml-schema-tests/src/lib.rs: -------------------------------------------------------------------------------- 1 | #[macro_use] 2 | extern crate xml_schema; 3 | 4 | #[macro_use] 5 | extern crate pretty_assertions; 6 | 7 | pub mod po; 8 | -------------------------------------------------------------------------------- /xml-schema-tests/src/po.rs: -------------------------------------------------------------------------------- 1 | include!(concat!(env!("OUT_DIR"), "/po.rs")); 2 | -------------------------------------------------------------------------------- /xml-schema-tests/src/po.xsd: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Purchase order schema for Example.com. 6 | Copyright 2000 Example.com. All rights reserved. 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | -------------------------------------------------------------------------------- /xml-schema-tests/tests/po.rs: -------------------------------------------------------------------------------- 1 | extern crate xml_schema; 2 | extern crate xml_schema_tests; 3 | 4 | use xml_schema::support::{ParseXml, DefaultParseContext, InnerStream, Tokenizer}; 5 | use xml_schema_tests::po; 6 | 7 | const EXAMPLE: &'static str = r#" 8 | 9 | 10 | 11 | Alice Smith 12 | 123 Maple Street 13 | Mill Valley 14 | CA 15 | 90952 16 | 17 | 18 | Robert Smith 19 | 8 Oak Avenue 20 | Old Town 21 | PA 22 | 95819 23 | 24 | Hurry, my lawn is going wild! 25 | 26 | 27 | Lawnmower 28 | 1 29 | 148.95 30 | Confirm this is electric 31 | 32 | 33 | Baby Monitor 34 | 1 35 | 39.98 36 | 1999-05-21 37 | 38 | 39 | 40 | "#; 41 | 42 | #[test] 43 | fn test_example() { 44 | let tokenizer = Tokenizer::from(EXAMPLE); 45 | let mut stream = Box::new(InnerStream::new(tokenizer)); 46 | let order = po::unqualified::PurchaseOrder::parse_xml(&mut stream, &mut DefaultParseContext::default(), &Default::default()); 47 | let order = order.unwrap(); 48 | assert_eq!(order.attr_order_date.unwrap().0, "1999-10-20"); 49 | } 50 | -------------------------------------------------------------------------------- /xml-schema/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "xml-schema" 3 | version = "0.1.0" 4 | authors = ["Valentin Lorentz "] 5 | 6 | [dependencies] 7 | #quick-xml = "0.12.1" 8 | xmlparser = "0.5.0" 9 | codegen = { git = "https://github.com/carllerche/codegen" } 10 | heck = "0.3.0" 11 | bigdecimal = "0.0.12" 12 | num-traits = "0.2.5" 13 | 14 | [[bin]] 15 | name = "gen" 16 | path = "src/bin/gen.rs" 17 | -------------------------------------------------------------------------------- /xml-schema/src/bigfloat.rs: -------------------------------------------------------------------------------- 1 | use std::fmt::Display; 2 | use std::str::FromStr; 3 | use std::cmp::Ordering; 4 | 5 | use bigdecimal::{BigDecimal, ParseBigDecimalError}; 6 | use num_traits::{Zero, One}; 7 | use std::ops::{Add, Mul}; 8 | 9 | #[derive(Debug, Clone, Hash)] 10 | pub enum BigFloat { 11 | Decimal(BigDecimal), 12 | PlusInfinity, 13 | MinusInfinity, 14 | NaN, 15 | } 16 | impl FromStr for BigFloat { 17 | type Err = ParseBigDecimalError; 18 | 19 | /// https://www.w3.org/TR/xmlschema11-2/#sec-lex-float 20 | /// 21 | /// Make sure to remove all whitespaces before calling this. 22 | fn from_str(s: &str) -> Result { 23 | match s { 24 | "INF" | "+INF" => Ok(BigFloat::PlusInfinity), 25 | "-INF" => Ok(BigFloat::MinusInfinity), 26 | "NaN" => Ok(BigFloat::NaN), 27 | _ => BigDecimal::from_str(s).map(BigFloat::Decimal), 28 | } 29 | } 30 | } 31 | impl PartialEq for BigFloat { 32 | fn eq(&self, rhs: &BigFloat) -> bool { 33 | use self::BigFloat::*; 34 | match (self, rhs) { 35 | (NaN, _) | (_, NaN) => false, 36 | (PlusInfinity, PlusInfinity) => true, 37 | (MinusInfinity, MinusInfinity) => true, 38 | (Decimal(l), Decimal(r)) => l == r, 39 | _ => false, 40 | } 41 | } 42 | } 43 | impl PartialOrd for BigFloat { 44 | fn partial_cmp(&self, rhs: &BigFloat) -> Option { 45 | use self::BigFloat::*; 46 | if self == rhs { 47 | Some(Ordering::Equal) 48 | } 49 | else { 50 | match (self, rhs) { 51 | (NaN, _) | (_, NaN) => None, 52 | (PlusInfinity, _) => Some(Ordering::Less), 53 | (MinusInfinity, _) => Some(Ordering::Greater), 54 | (_, PlusInfinity) => Some(Ordering::Greater), 55 | (_, MinusInfinity) => Some(Ordering::Less), 56 | (Decimal(l), Decimal(r)) => l.partial_cmp(r), 57 | } 58 | } 59 | } 60 | } 61 | impl Display for BigFloat { 62 | fn fmt(&self, f: &mut ::std::fmt::Formatter<'_>) -> Result<(), ::std::fmt::Error> { 63 | use self::BigFloat::*; 64 | match self { 65 | NaN => write!(f, "NaN"), 66 | PlusInfinity => write!(f, "+INF"), // TODO: what's the canonical repr? 67 | MinusInfinity => write!(f, "-INF"), 68 | Decimal(d) => d.fmt(f), 69 | } 70 | } 71 | } 72 | 73 | #[derive(Debug, Clone, Hash, PartialEq, PartialOrd)] 74 | pub struct BigFloatNotNaN(BigFloat); 75 | impl Eq for BigFloatNotNaN {} 76 | impl Ord for BigFloatNotNaN { 77 | fn cmp(&self, rhs: &BigFloatNotNaN) -> Ordering { 78 | self.0.partial_cmp(&rhs.0).expect("NaN") 79 | } 80 | } 81 | impl From for BigFloatNotNaN { 82 | fn from(d: BigDecimal) -> BigFloatNotNaN { 83 | BigFloatNotNaN(BigFloat::Decimal(d)) 84 | } 85 | } 86 | impl From for BigFloatNotNaN { 87 | fn from(f: BigFloat) -> BigFloatNotNaN { 88 | if f == BigFloat::NaN { 89 | panic!("NaN"); 90 | } 91 | BigFloatNotNaN(f) 92 | } 93 | } 94 | impl FromStr for BigFloatNotNaN { 95 | type Err = ParseBigDecimalError; 96 | 97 | /// https://www.w3.org/TR/xmlschema11-2/#sec-lex-float 98 | /// 99 | /// Make sure to remove all whitespaces before calling this. 100 | fn from_str(s: &str) -> Result { 101 | match s { 102 | "INF" | "+INF" => Ok(BigFloatNotNaN(BigFloat::PlusInfinity)), 103 | "-INF" => Ok(BigFloatNotNaN(BigFloat::MinusInfinity)), 104 | "NaN" => Err(ParseBigDecimalError::Other("NaN".to_string())), 105 | _ => Ok(BigFloatNotNaN::from(BigDecimal::from_str(s)?)), 106 | } 107 | } 108 | } 109 | impl Add for BigFloatNotNaN { 110 | type Output = BigFloatNotNaN; 111 | fn add(self, rhs: BigFloatNotNaN) -> BigFloatNotNaN { 112 | use self::BigFloat::*; 113 | match (self.0, rhs.0) { 114 | (NaN, _) | (_, NaN) => panic!("NaN"), 115 | (PlusInfinity, MinusInfinity) => panic!("+inf + -inf"), 116 | (MinusInfinity, PlusInfinity) => panic!("-inf + +inf"), 117 | (PlusInfinity, _) | (_, PlusInfinity) => BigFloatNotNaN(PlusInfinity), 118 | (MinusInfinity, _) | (_, MinusInfinity) => BigFloatNotNaN(MinusInfinity), 119 | (Decimal(f), Decimal(r)) => BigFloatNotNaN(Decimal(f + r)), 120 | } 121 | } 122 | } 123 | impl Mul for BigFloatNotNaN { 124 | type Output = BigFloatNotNaN; 125 | fn mul(self, rhs: BigFloatNotNaN) -> BigFloatNotNaN { 126 | use self::BigFloat::*; 127 | match (self.0, rhs.0) { 128 | (NaN, _) | (_, NaN) => panic!("NaN"), 129 | (PlusInfinity, MinusInfinity) | (MinusInfinity, PlusInfinity) => BigFloatNotNaN(MinusInfinity), 130 | (PlusInfinity, PlusInfinity) | (MinusInfinity, MinusInfinity) => BigFloatNotNaN(PlusInfinity), 131 | (PlusInfinity, Decimal(d)) | (Decimal(d), PlusInfinity) => { 132 | if BigDecimal::is_zero(&d) { 133 | panic!("+inf * 0") 134 | } 135 | else if d > BigDecimal::zero() { 136 | BigFloatNotNaN(PlusInfinity) 137 | } 138 | else { 139 | BigFloatNotNaN(MinusInfinity) 140 | } 141 | }, 142 | (MinusInfinity, Decimal(d)) | (Decimal(d), MinusInfinity) => { 143 | if BigDecimal::is_zero(&d) { 144 | panic!("-inf * 0") 145 | } 146 | else if d > BigDecimal::zero() { 147 | BigFloatNotNaN(MinusInfinity) 148 | } 149 | else { 150 | BigFloatNotNaN(PlusInfinity) 151 | } 152 | }, 153 | (Decimal(l), Decimal(r)) => BigFloatNotNaN(Decimal(l * r)), 154 | } 155 | } 156 | } 157 | impl Zero for BigFloatNotNaN { 158 | fn zero() -> BigFloatNotNaN { 159 | BigFloatNotNaN(BigFloat::Decimal(BigDecimal::zero())) 160 | } 161 | fn is_zero(&self) -> bool { 162 | match self { 163 | BigFloatNotNaN(BigFloat::Decimal(d)) => d.is_zero(), 164 | _ => false, 165 | } 166 | } 167 | } 168 | impl One for BigFloatNotNaN { 169 | fn one() -> BigFloatNotNaN { 170 | BigFloatNotNaN(BigFloat::Decimal(BigDecimal::one())) 171 | } 172 | fn is_one(&self) -> bool { 173 | match self { 174 | BigFloatNotNaN(BigFloat::Decimal(d)) => d.is_one(), 175 | _ => false, 176 | } 177 | } 178 | } 179 | impl Display for BigFloatNotNaN { 180 | fn fmt(&self, f: &mut ::std::fmt::Formatter<'_>) -> Result<(), ::std::fmt::Error> { 181 | self.0.fmt(f) 182 | } 183 | } 184 | 185 | -------------------------------------------------------------------------------- /xml-schema/src/bin/gen.rs: -------------------------------------------------------------------------------- 1 | use std::env::args_os; 2 | use std::fs::File; 3 | use std::io::Read; 4 | use std::collections::HashMap; 5 | 6 | extern crate xmlparser; 7 | extern crate xml_schema; 8 | extern crate codegen; 9 | use xml_schema::processor::*; 10 | use xml_schema::parser_generator::*; 11 | use xml_schema::parse_xsd_with_visitor; 12 | 13 | const RENAMES: &[(&'static str, &'static str)] = &[ 14 | ("SequenceDefaultOpenContentAnnotation", "AnnotatedOpenContent"), 15 | ("sequence_default_open_content_annotation", "open_content"), 16 | ("ChoiceSimpleTypeComplexType", "Type"), 17 | ("choice_simple_type_complex_type", "type_"), 18 | ("SequenceOpenContentTypeDefParticleAttrDeclsAssertions", "CompleteContentModel"), 19 | ("ChoiceAttributeAttributeGroup", "AttrOrAttrGroup"), 20 | ("choice_attribute_attribute_group", "attribute"), 21 | ("SequenceSelectorField", "UniquenessSpec"), 22 | ("sequence_selector_field", "uniqueness_spec"), 23 | //("ChoiceRestrictionExtension", "ContentDef"), 24 | //("choice_restriction_extension", "content_def"), 25 | ("ChoiceAppinfoDocumentation", "AnnotationContent"), 26 | ("choice_appinfo_documentation", "annotation_content"), 27 | ]; 28 | 29 | fn main() { 30 | let mut inputs = Vec::new(); 31 | for arg in args_os().skip(1) { 32 | let mut s = String::new(); 33 | let mut file = File::open(&arg).expect(&format!("Could not open {:?}", arg)); 34 | file.read_to_string(&mut s).expect(&format!("Could not read {:?}", arg)); 35 | inputs.push((arg, s)); 36 | } 37 | 38 | let inputs2 = inputs.iter().map(|(arg, s)| (arg, &s[..])); 39 | 40 | let mut parse_context = XsdParseContext::default(); 41 | 42 | let mut documents = Vec::new(); 43 | for (filename, input) in inputs2 { 44 | documents.push((filename, parse_xsd_with_visitor(input, &mut parse_context).unwrap())); 45 | } 46 | 47 | let mut processors = Vec::new(); 48 | for (filename, document) in &documents { 49 | println!("// Input: {:?}", filename); 50 | let mut proc = Processor::new(document); 51 | proc.process_ast(document); 52 | processors.push(proc); 53 | } 54 | 55 | let mut renames = HashMap::new(); 56 | for (from_, to_) in RENAMES { 57 | renames.insert(from_.to_string(), to_.to_string()); 58 | } 59 | 60 | let mut gen = ParserGenerator::new(processors, &parse_context, renames); 61 | let scope = gen.gen_target_scope(); 62 | println!("#[allow(unused_imports)]\nuse support;\n{}", scope.to_string()); 63 | } 64 | -------------------------------------------------------------------------------- /xml-schema/src/lib.rs: -------------------------------------------------------------------------------- 1 | #![recursion_limit="80"] 2 | 3 | pub extern crate xmlparser; 4 | extern crate codegen; 5 | extern crate heck; 6 | extern crate num_traits; 7 | extern crate bigdecimal; 8 | 9 | #[macro_use] pub mod macros; 10 | pub mod xml_utils; 11 | pub mod names; 12 | pub mod support; 13 | pub mod primitives; 14 | pub mod bigfloat; 15 | 16 | pub mod parser; 17 | pub mod processor; 18 | pub mod parser_generator; 19 | 20 | #[cfg(test)] 21 | mod test_parser; 22 | #[cfg(test)] 23 | mod test_parser_schema; 24 | 25 | use support::{ParseXml, InnerStream, ParseContext, ParentContext}; 26 | 27 | pub use processor::Processor; 28 | pub use parser_generator::{XsdParseContext, ParserGenerator}; 29 | 30 | pub fn parse_xsd<'input>(xsd: &'input str) -> (Option>, XsdParseContext) { 31 | let mut visitor = XsdParseContext::default(); 32 | let ast = parse_xsd_with_visitor(xsd, &mut visitor); 33 | (ast, visitor) 34 | } 35 | 36 | pub fn parse_xsd_with_visitor<'input, TParseContext: ParseContext<'input>>(xsd: &'input str, visitor: &mut TParseContext) -> Option> { 37 | let tokenizer = xmlparser::Tokenizer::from(xsd); 38 | let mut stream = Box::new(InnerStream::new(tokenizer)); 39 | parser::xs::Schema::parse_xml(&mut stream, visitor, &ParentContext::default()) 40 | } 41 | 42 | -------------------------------------------------------------------------------- /xml-schema/src/macros.rs: -------------------------------------------------------------------------------- 1 | #[macro_export] 2 | macro_rules! use_xsd_types { 3 | () => { 4 | pub use $crate::parser::xs; 5 | } 6 | } 7 | 8 | #[macro_export] 9 | macro_rules! try_rollback { 10 | ($stream:expr, $tx:expr, $e:expr) => { 11 | match $e { 12 | Some(i) => i, 13 | None => { 14 | $tx.rollback($stream); 15 | return None 16 | } 17 | } 18 | } 19 | } 20 | 21 | #[macro_export] 22 | macro_rules! impl_enum { 23 | ( $name:ident, $($variant_macro:ident ! ( $($variant_args: tt )* ), )* ) => { 24 | #[allow(unused_imports)] 25 | use $crate::support::*; 26 | impl<'input> ParseXml<'input> for $name<'input> { 27 | const NODE_NAME: &'static str = concat!("enum ", stringify!($name)); 28 | 29 | fn parse_empty>(parse_context: &mut TParseContext, parent_context: &ParentContext<'input>) -> Option { 30 | $( 31 | match $variant_macro!($name, __empty_element, parse_context, parent_context, $($variant_args)*) { 32 | Some(x) => return Some(x), 33 | None => (), 34 | } 35 | )* 36 | None 37 | } 38 | 39 | fn parse_self_xml<'b, TParseContext: ParseContext<'input>>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &'b ParentContext<'input>) -> Option { 40 | let tx = stream.transaction(); 41 | $( 42 | match $variant_macro!($name, stream, parse_context, parent_context, $($variant_args)*) { 43 | Some(x) => return Some(x), 44 | None => (), // TODO: should we rollback here? 45 | } 46 | )* 47 | 48 | tx.rollback(stream); 49 | None 50 | } 51 | } 52 | } 53 | } 54 | 55 | // TODO: deduplicate the empty and non-empty cases 56 | macro_rules! impl_singleton_variant { 57 | // empty element; call parse_empty_xml 58 | ( $enum_name:ident, __empty_element, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Box < $type_name:ident > ) => { 59 | super::$type_mod_name::$type_name::parse_empty($parse_context, $parent_context).map(Box::new).map($enum_name::$variant_name) 60 | }; 61 | ( $enum_name:ident, __empty_element, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Option < Box < $type_name:ident > > ) => { 62 | Some(super::$type_mod_name::$type_name::parse_empty($parse_context, $parent_context).map(Box::new).map($enum_name::$variant_name)) 63 | }; 64 | ( $enum_name:ident, __empty_element, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Vec < $type_name:ident > ) => {{ 65 | // TODO: Should it be vec![], or vec![super::$type_mod_name::$type_name::parse_empty(...)]? 66 | let mut items = Vec::new(); 67 | Some($enum_name::$variant_name(items)) 68 | }}; 69 | 70 | // non-empty element; call parse_xml 71 | ( $enum_name:ident, $stream:expr, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Box < $type_name:ident > ) => { 72 | super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context).map(Box::new).map($enum_name::$variant_name) 73 | }; 74 | ( $enum_name:ident, $stream:expr, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Option < Box < $type_name:ident > > ) => { 75 | Some(super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context).map(Box::new).map($enum_name::$variant_name)) 76 | }; 77 | ( $enum_name:ident, $stream:expr, $parse_context:expr, $parent_context:expr, $variant_name:ident, $type_mod_name:ident, Vec < $type_name:ident > ) => {{ 78 | let mut items = Vec::new(); 79 | while let Some(item) = super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context) { 80 | items.push(item); 81 | } 82 | Some($enum_name::$variant_name(items)) 83 | }} 84 | } 85 | 86 | // TODO: deduplicate the empty and non-empty cases 87 | macro_rules! impl_struct_variant { 88 | ( $enum_name:ident, __empty_element, $parse_context:expr, $parent_context:expr, $variant_name:ident, ) => {{ 89 | // empty variant 90 | Some(Default::default()) 91 | }}; 92 | ( $enum_name:ident, __empty_element, $parse_context:expr, $parent_context:expr, $variant_name:ident, $( ( $field_name:ident, $( $field_args:tt )* ), )* ) => {{ 93 | let mut res = None; 94 | loop { // single run, used for breaking 95 | $( 96 | let $field_name = match impl_struct_variant_field!(__empty_element, $parse_context, $parent_context, $( $field_args )* ) { 97 | Some(e) => e, 98 | None => break, 99 | }; 100 | )* 101 | res = Some($enum_name::$variant_name { 102 | $( 103 | $field_name, 104 | )* 105 | }); 106 | break; 107 | } 108 | res 109 | }}; 110 | 111 | ( $enum_name:ident, $stream: expr, $parse_context:expr, $parent_context:expr, $variant_name:ident, ) => {{ 112 | // empty variant 113 | None 114 | }}; 115 | ( $enum_name:ident, $stream: expr, $parse_context:expr, $parent_context:expr, $variant_name:ident, $( ( $field_name:ident, $( $field_args:tt )* ), )* ) => {{ 116 | let mut res = None; 117 | loop { // single run, used for breaking 118 | $( 119 | let $field_name = match impl_struct_variant_field!($stream, $parse_context, $parent_context, $( $field_args )* ) { 120 | Some(e) => e, 121 | None => break, 122 | }; 123 | )* 124 | res = Some($enum_name::$variant_name { 125 | $( 126 | $field_name, 127 | )* 128 | }); 129 | break; 130 | } 131 | res 132 | }} 133 | } 134 | 135 | // TODO: deduplicate the empty and non-empty cases 136 | macro_rules! impl_struct_variant_field { 137 | ( __empty_element, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Box < $type_name:ident > ) => { 138 | super::$type_mod_name::$type_name::parse_empty($parse_context, $parent_context).map(Box::new) 139 | }; 140 | ( __empty_element, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Option < Box < $type_name:ident > > ) => { 141 | Some(super::$type_mod_name::$type_name::parse_empty($parse_context, $parent_context).map(Box::new)) 142 | }; 143 | ( __empty_element, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident > ) => {{ 144 | // TODO: Should it be vec![], or vec![super::$type_mod_name::$type_name::parse_empty(...)]? 145 | let mut items = Vec::new(); 146 | Some(items) 147 | }}; 148 | 149 | 150 | ( $stream: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Box < $type_name:ident > ) => { 151 | super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context).map(Box::new) 152 | }; 153 | ( $stream: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Option < Box < $type_name:ident > > ) => { 154 | Some(super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context).map(Box::new)) 155 | }; 156 | ( $stream: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident > ) => {{ 157 | let mut items = Vec::new(); 158 | while let Some(item) = super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context) { 159 | items.push(item); 160 | } 161 | Some(items) 162 | }} 163 | } 164 | 165 | #[macro_export] 166 | macro_rules! impl_group_or_sequence { 167 | ( $name:ident, ) => { 168 | #[allow(unused_imports)] 169 | use $crate::support::*; 170 | impl<'input> ParseXml<'input> for $name<'input> { 171 | const NODE_NAME: &'static str = concat!("empty group or sequence ", stringify!($name)); 172 | 173 | fn parse_empty>(parse_context: &mut TParseContext, parent_context: &ParentContext<'input>) -> Option { 174 | Some($name(Default::default())) 175 | } 176 | 177 | fn parse_self_xml<'b, TParseContext: ParseContext<'input>>(stream: &mut Stream<'input>, _parse_context: &mut TParseContext, _parent_context: &'b ParentContext<'input>) -> Option { 178 | None 179 | } 180 | } 181 | }; 182 | ( $name:ident, $( ( $field_name:ident, $( $field_args:tt )* ), )* ) => { 183 | #[allow(unused_imports)] 184 | use $crate::support::*; 185 | impl<'input> ParseXml<'input> for $name<'input> { 186 | const NODE_NAME: &'static str = concat!("group or sequence ", stringify!($name)); 187 | 188 | #[allow(unused_variables)] 189 | fn parse_empty>(parse_context: &mut TParseContext, parent_context: &ParentContext<'input>) -> Option { 190 | Some($name { 191 | $( 192 | $field_name: impl_empty_element_field!(parse_context, parent_context, $($field_args)*), 193 | )* 194 | }) 195 | } 196 | 197 | #[allow(unused_variables)] 198 | fn parse_self_xml<'b, TParseContext: ParseContext<'input>>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &'b ParentContext<'input>) -> Option { 199 | let tx = stream.transaction(); 200 | Some($name { 201 | $( 202 | $field_name: impl_element_field!(stream, tx, parse_context, parent_context, $($field_args)*), 203 | )* 204 | }) 205 | } 206 | } 207 | } 208 | } 209 | 210 | #[macro_export] 211 | macro_rules! impl_element { 212 | ( $struct_name:ident, $namespace:expr, $name:expr, attributes = { $( ($attr_prefix:expr, $attr_local:expr) => $attr_name:ident : $use:ident, )* }, fields = { $( ( $field_name:ident, $( $field_args:tt )* ), )* } ) => { 213 | #[allow(unused_imports)] 214 | use $crate::support::*; 215 | impl<'input> ParseXml<'input> for $struct_name<'input> { 216 | const NODE_NAME: &'static str = concat!("element ", stringify!($struct_name)); 217 | 218 | fn parse_empty>(_parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>) -> Option { 219 | None 220 | } 221 | 222 | #[allow(unused_variables)] 223 | fn parse_self_xml<'b, TParseContext: ParseContext<'input>>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &'b ParentContext<'input>) -> Option { 224 | use $crate::support::{XmlToken,ElementEnd}; 225 | let mut parent_context: ParentContext<'input> = parent_context.clone(); 226 | let tx = stream.transaction(); 227 | let mut tok = stream.next().unwrap(); 228 | loop { 229 | match tok { 230 | XmlToken::Whitespaces(_) => (), 231 | XmlToken::Comment(_) => (), 232 | XmlToken::Text(_) => (), 233 | _ => break, 234 | } 235 | tok = stream.next().unwrap(); 236 | } 237 | match tok { 238 | XmlToken::ElementStart(element_prefix, name) => { 239 | if name.to_str() == $name { 240 | let mut attrs = HashMap::new(); 241 | $( 242 | let mut $attr_name = None; 243 | )* 244 | loop { 245 | let tok = stream.next().unwrap(); 246 | match tok { 247 | XmlToken::Whitespaces(_) => (), 248 | XmlToken::Comment(_) => (), 249 | XmlToken::Text(_) => (), 250 | XmlToken::Attribute((key_prefix, key_local), value) => { 251 | let key_prefix = key_prefix.to_str(); 252 | let key_local = key_local.to_str(); 253 | let value = value.to_str(); 254 | match (key_prefix, key_local) { 255 | ("xmlns", l) => { 256 | parent_context.namespaces.insert(l, value); 257 | parse_context.on_xmlns(Some(l), value); 258 | //continue; // TODO: uncomment 259 | }, 260 | ("", "xmlns") => { 261 | parent_context.namespaces.insert("", value); 262 | parse_context.on_xmlns(None, value); 263 | //continue; // TODO: uncomment 264 | } 265 | _ => (), 266 | } 267 | let key_namespace = match key_prefix { 268 | "" => parent_context.namespaces.get(element_prefix.to_str()).cloned(), 269 | _ => parent_context.namespaces.get(key_prefix).cloned(), 270 | }; 271 | let key = FullName::new(key_namespace, key_local); 272 | let old = attrs.insert(key, value); assert_eq!(old, None); 273 | match (key_prefix, key_local) { 274 | $( 275 | (_, $attr_local) => { // TODO: match the namespace too 276 | match ParseXmlStr::parse_xml_str(value, parse_context, &parent_context, &Facets::default()) { 277 | Some(("", value)) => { 278 | $attr_name = Some(value) 279 | // TODO: check for duplicates 280 | }, 281 | Some((out, _)) => 282 | panic!("Unmatched data at the end of {}={:?}: {:?}", $attr_local, value, out), 283 | None => 284 | panic!("Could not parse {}={:?}.", $attr_local, value), 285 | } 286 | }, 287 | )* 288 | _ => (), // TODO: unknown attribute 289 | } 290 | }, 291 | XmlToken::ElementEnd(ElementEnd::Open) => { 292 | let element_ns: &'input str = match element_prefix.to_str() { 293 | "" => { 294 | parent_context.namespaces.get("").cloned().unwrap_or("") 295 | }, 296 | p => { 297 | parent_context.namespaces.get(p) 298 | .expect(&format!("unknown namespace {:?}", element_prefix.to_str())).clone() 299 | }, 300 | }; 301 | if element_ns != $namespace { // This can't be checked on the ElementStart, because we have to check for xmlns first. 302 | return None 303 | } 304 | let ret = Some($struct_name { 305 | attrs, 306 | $( 307 | $attr_name: extract_attribute!($attr_name, $attr_local, $use), 308 | )* 309 | $( 310 | $field_name: impl_element_field!(stream, tx, parse_context, &parent_context, $($field_args)*), 311 | )* 312 | }); 313 | let mut next_tok; 314 | loop { 315 | next_tok = stream.next(); 316 | match next_tok { 317 | Some(XmlToken::Whitespaces(_)) => (), 318 | Some(XmlToken::Comment(_)) => (), 319 | Some(XmlToken::Text(_)) => (), 320 | Some(XmlToken::ElementEnd(ElementEnd::Close(prefix2, name2))) => { 321 | assert_eq!((element_prefix.to_str(), name.to_str()), (prefix2.to_str(), name2.to_str())); 322 | return ret; 323 | } 324 | _ => panic!(format!("Expected closing tag for {}:{}, got {:?}", element_prefix, name, next_tok)), 325 | } 326 | } 327 | }, 328 | XmlToken::ElementEnd(ElementEnd::Empty) => { 329 | let element_ns: &'input str = parent_context.namespaces.get(element_prefix.to_str()).expect(&format!("unknown namespace {:?}", element_prefix.to_str())).clone(); 330 | if element_ns != $namespace { // This can't be checked on the ElementStart, because we have to check for xmlns first. 331 | return None 332 | } 333 | return Some($struct_name { 334 | attrs, 335 | $( 336 | $attr_name: extract_attribute!($attr_name, $attr_local, $use), 337 | )* 338 | $( 339 | $field_name: impl_empty_element_field!(parse_context, &parent_context, $($field_args)*), 340 | )* 341 | }); 342 | }, 343 | XmlToken::ElementEnd(ElementEnd::Close(_, _)) => { 344 | tx.rollback(stream); 345 | return None 346 | }, 347 | _ => panic!(format!("Expected element end for {}:{}, got {:?}", element_prefix, name, tok)), 348 | } 349 | } 350 | } 351 | else { 352 | tx.rollback(stream); 353 | None 354 | } 355 | }, 356 | XmlToken::ElementEnd(ElementEnd::Close(_, _)) => { 357 | tx.rollback(stream); 358 | return None 359 | }, 360 | _ => panic!(format!("Expected element start for {}, got {:?}", Self::NODE_NAME, tok)), 361 | } 362 | } 363 | } 364 | } 365 | } 366 | 367 | #[macro_export] 368 | macro_rules! extract_attribute { 369 | ( $attr_name:ident, $attr_local:expr, required ) => { 370 | $attr_name.expect(&format!("Missing attribute {}", $attr_local)) 371 | }; 372 | ( $attr_name:ident, $attr_local:expr, optional ) => { 373 | $attr_name 374 | }; 375 | } 376 | 377 | #[macro_export] 378 | macro_rules! impl_element_field { 379 | ( $stream: expr, $tx: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, $type_name:ident ) => { 380 | try_rollback!($stream, $tx, super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context)) 381 | }; 382 | ( $stream: expr, $tx: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Option < $type_name:ident > ) => { 383 | super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context) 384 | }; 385 | ( $stream: expr, $tx: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident ; min=$min:expr ; max=$max:expr ; > ) => {{ 386 | let mut items = Vec::new(); 387 | let min: usize = $min; 388 | let max: usize = $max; 389 | while let Some(item) = super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context) { 390 | items.push(item); 391 | if items.len() > max { 392 | return None; 393 | } 394 | } 395 | if items.len() < min { 396 | return None; 397 | } 398 | items 399 | }}; 400 | ( $stream: expr, $tx: expr, $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident ; min=$min:expr ; > ) => {{ 401 | let mut items = Vec::new(); 402 | let min: usize = $min; 403 | while let Some(item) = super::$type_mod_name::$type_name::parse_xml($stream, $parse_context, $parent_context) { 404 | items.push(item); 405 | } 406 | if items.len() < min { 407 | return None; 408 | } 409 | items 410 | }}; 411 | } 412 | 413 | 414 | #[macro_export] 415 | macro_rules! impl_empty_element_field { 416 | ( $parse_context:expr, $parent_context:expr, $type_mod_name:ident, $type_name:ident ) => { 417 | match super::$type_mod_name::$type_name::parse_empty($parse_context, $parent_context) { 418 | Some(default) => default, 419 | None => return None, 420 | } 421 | }; 422 | ( $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Option < $type_name:ident > ) => { 423 | None 424 | }; 425 | ( $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident ; min=$min:expr ; max=$max:expr ; > ) => {{ 426 | Vec::new() 427 | }}; 428 | ( $parse_context:expr, $parent_context:expr, $type_mod_name:ident, Vec < $type_name:ident ; min=$min:expr ; > ) => {{ 429 | Vec::new() 430 | }}; 431 | } 432 | 433 | #[macro_export] 434 | macro_rules! impl_union { 435 | ( $name:ident, { $($variant_macro:ident ! ( $($variant_args: tt )* ), )* } ) => { 436 | #[allow(unused_imports)] 437 | use $crate::support::*; 438 | impl<'input> ParseXmlStr<'input> for $name<'input> { 439 | const NODE_NAME: &'static str = concat!("union ", stringify!($name)); 440 | 441 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Self)> { 442 | $( 443 | match $variant_macro!($name, input, parse_context, parent_context, facets, $($variant_args)*) { 444 | Some((o, x)) => return Some((o, x)), 445 | None => (), 446 | } 447 | )* 448 | 449 | None 450 | } 451 | } 452 | } 453 | } 454 | 455 | macro_rules! impl_union_variant { 456 | ( $name:ident, $input:expr, $parse_context:expr, $parent_context:expr, $facets:expr, $variant_name:ident) => { 457 | ParseXmlStr::parse_xml_str($input, $parse_context, $parent_context, $facets) 458 | .map(|(o, x)| (o, $name::$variant_name(x))) 459 | } 460 | } 461 | 462 | #[macro_export] 463 | macro_rules! impl_list { 464 | ( $name:ident, $item_type_mod_name:ident :: $item_type:ident ) => { 465 | #[allow(unused_imports)] 466 | use $crate::support::*; 467 | impl<'input> ParseXmlStr<'input> for $name<'input> { 468 | const NODE_NAME: &'static str = concat!("list ", stringify!($name)); 469 | 470 | #[allow(unused_variables)] 471 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Self)> { 472 | let mut input = input; 473 | let mut items = Vec::new(); 474 | while let Some((output, item)) = ParseXmlStr::parse_xml_str(input, parse_context, parent_context, facets) { 475 | items.push(item); 476 | if output.len() == 0 { 477 | return Some(("", $name(items))); 478 | } 479 | if &output[0..1] != " " { 480 | return None; 481 | } 482 | input = &output[1..]; 483 | } 484 | None 485 | } 486 | } 487 | } 488 | } 489 | 490 | #[macro_export] 491 | macro_rules! impl_simpletype_restriction { 492 | ( $name:ident, Facets { $( $facet_name:ident : $facet_value:expr , )* } ) => { 493 | #[allow(unused_imports)] 494 | use $crate::support::*; 495 | impl<'input> ParseXmlStr<'input> for $name<'input> { 496 | const NODE_NAME: &'static str = stringify!($name); 497 | 498 | #[allow(unused_variables)] 499 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Self)> { 500 | let mut facets = facets.clone(); 501 | $( 502 | facets.$facet_name = $facet_value.or(facets.$facet_name); 503 | )* 504 | let (output, v) = ParseXmlStr::parse_xml_str(input, parse_context, parent_context, &facets)?; 505 | Some((output, $name(v))) 506 | } 507 | } 508 | } 509 | } 510 | -------------------------------------------------------------------------------- /xml-schema/src/names.rs: -------------------------------------------------------------------------------- 1 | use std::collections::HashMap; 2 | use std::fmt; 3 | 4 | use primitives::QName; 5 | 6 | const KEYWORDS: &[&'static str] = &["override"]; 7 | fn escape_keyword(name: &str) -> String { 8 | if KEYWORDS.contains(&name) { 9 | format!("{}_", name) 10 | } 11 | else { 12 | name.to_string() 13 | } 14 | } 15 | 16 | pub(crate) struct NameGenerator(HashMap); 17 | 18 | impl NameGenerator { 19 | pub fn new() -> NameGenerator { 20 | NameGenerator(HashMap::new()) 21 | } 22 | 23 | pub fn gen_name(&mut self, name: String) -> String { 24 | let nb_uses = self.0.get(&name).cloned().unwrap_or(1); 25 | let ret = if nb_uses > 1 { 26 | format!("{}{}", name, nb_uses) 27 | } 28 | else { 29 | name.to_string() 30 | }; 31 | self.0.insert(name, nb_uses+1); 32 | ret 33 | } 34 | } 35 | 36 | pub fn name_from_hint<'input>(hint: &NameHint<'input>) -> Option { 37 | if hint.tokens.len() > 0 { 38 | Some(hint.tokens.iter().map(|&s| escape_keyword(s)).collect::>().join("_")) 39 | } 40 | else { 41 | None 42 | } 43 | } 44 | 45 | #[derive(Debug, Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] 46 | pub struct FullName<'input>(Option<&'input str>, &'input str); 47 | 48 | impl<'input> FullName<'input> { 49 | pub fn new(ns: Option<&'input str>, name: &'input str) -> FullName<'input> { 50 | FullName(ns, name) 51 | } 52 | pub fn namespace(&self) -> Option<&'input str> { 53 | self.0 54 | } 55 | pub fn local_name(&self) -> &'input str { 56 | self.1 57 | } 58 | } 59 | 60 | impl<'input> FullName<'input> { 61 | pub fn from_qname(qn: &QName<'input>, default_namespace: Option<&'input str>) -> FullName<'input> { 62 | FullName(qn.namespace.or(default_namespace), qn.local_name) 63 | } 64 | } 65 | 66 | impl<'input> fmt::Display for FullName<'input> { 67 | fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { 68 | match self.0 { 69 | Some(prefix) => write!(f, "{}:{}", prefix, self.1), 70 | None => write!(f, "{}", self.1), 71 | } 72 | } 73 | } 74 | 75 | #[derive(Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] 76 | pub struct NameHint<'input> { 77 | tokens: Vec<&'input str>, 78 | } 79 | impl<'input> NameHint<'input> { 80 | pub fn new_empty() -> NameHint<'input> { 81 | NameHint { tokens: Vec::new() } 82 | } 83 | pub fn new(s: &'input str) -> NameHint<'input> { 84 | NameHint { tokens: vec![s] } 85 | } 86 | pub fn from_fullname(name: &FullName<'input>) -> NameHint<'input> { 87 | NameHint::new(name.1) 88 | } 89 | pub fn push(&mut self, s: &'input str) { 90 | self.tokens.push(s); 91 | } 92 | pub fn extend(&mut self, other: &NameHint<'input>) { 93 | self.tokens.extend(other.tokens.iter()) 94 | } 95 | } 96 | -------------------------------------------------------------------------------- /xml-schema/src/parser_generator.rs: -------------------------------------------------------------------------------- 1 | use std::collections::{HashMap, HashSet}; 2 | 3 | use codegen as cg; 4 | use heck::{SnakeCase, CamelCase}; 5 | 6 | use support::{ParseContext, Facets}; 7 | use primitives::PRIMITIVE_TYPES; 8 | use processor::*; 9 | use names::*; 10 | 11 | #[derive(Default)] 12 | pub struct XsdParseContext<'input> { 13 | namespaces: HashMap<&'input str, &'input str>, 14 | } 15 | impl<'input> ParseContext<'input> for XsdParseContext<'input> { 16 | fn on_xmlns(&mut self, name: Option<&'input str>, uri: &'input str) { 17 | match name { 18 | None => (), 19 | Some(ns) => { self.namespaces.insert(uri, ns); }, 20 | } 21 | } 22 | } 23 | 24 | const KEYWORDS: &[&'static str] = &["override"]; 25 | fn escape_keyword(name: &str) -> String { 26 | if KEYWORDS.contains(&name) { 27 | format!("{}_", name) 28 | } 29 | else { 30 | name.to_string() 31 | } 32 | } 33 | 34 | #[derive(Debug)] 35 | pub struct ParserGenerator<'ast, 'input: 'ast> { 36 | processors: Vec>, 37 | module_names: HashMap, String>, // URI -> module name 38 | primitive_types: HashMap<&'static str, RichType<'input, Type<'input>>>, 39 | simple_restrictions: HashMap<(FullName<'input>, Facets<'input>), String>, 40 | renames: HashMap, 41 | self_gen: bool, 42 | } 43 | 44 | impl<'ast, 'input: 'ast> ParserGenerator<'ast, 'input> { 45 | pub fn new(processors: Vec>, parse_context: &XsdParseContext<'input>, renames: HashMap) -> ParserGenerator<'ast, 'input> { 46 | let mut module_names = HashMap::new(); 47 | module_names.insert(None, "unqualified".to_string()); 48 | let mut name_gen = NameGenerator::new(); 49 | 50 | let mut primitive_types = HashMap::new(); 51 | for (name, type_name) in PRIMITIVE_TYPES { 52 | primitive_types.insert(*name, RichType::new(NameHint::new(name), Type::Simple(SimpleType::Primitive(name, type_name)), Documentation::new())); 53 | } 54 | 55 | for (&uri, ns) in parse_context.namespaces.iter() { 56 | if Some(&ns.to_string()) != module_names.get(&Some(uri)) { 57 | module_names.insert(Some(uri), name_gen.gen_name(ns.to_string())); 58 | } 59 | } 60 | 61 | let mut self_gen = false; 62 | for proc in &processors { 63 | if proc.target_namespace == Some(&SCHEMA_URI) { 64 | self_gen = true; 65 | } 66 | } 67 | ParserGenerator { 68 | processors, renames, module_names, primitive_types, self_gen, 69 | simple_restrictions: HashMap::new(), 70 | } 71 | } 72 | 73 | pub fn get_module_name(&self, qname: FullName<'input>) -> String { 74 | if qname.namespace() == Some(SCHEMA_URI) { 75 | for (name, _) in PRIMITIVE_TYPES { 76 | if *name == qname.local_name() { 77 | return "support".to_string(); 78 | } 79 | } 80 | } 81 | self.module_names.get(&qname.namespace()).expect(&format!("{:?}", qname.namespace())).clone() 82 | } 83 | 84 | pub fn gen_target_scope(&mut self) -> cg::Scope { 85 | let mut scope = cg::Scope::new(); 86 | scope.raw("pub use std::collections::HashMap;"); 87 | scope.raw("pub use std::marker::PhantomData;"); 88 | self.create_modules(&mut scope); 89 | self.gen_choices(&mut scope); 90 | self.gen_simple_types(&mut scope); 91 | self.gen_lists(&mut scope); 92 | self.gen_unions(&mut scope); 93 | self.gen_sequences(&mut scope); 94 | self.gen_elements(&mut scope); 95 | self.gen_inline_elements(&mut scope); 96 | self.gen_groups(&mut scope); 97 | scope 98 | } 99 | 100 | fn create_modules(&mut self, scope: &mut cg::Scope) { 101 | let mut modules: Vec<_> = self.module_names.iter().collect(); 102 | modules.sort(); 103 | for (&uri, mod_name) in modules { 104 | if !self.self_gen && uri == Some(SCHEMA_URI) { 105 | scope.raw(&format!("#[allow(unused_imports)]\npub use xml_schema::parser::xs as {};", mod_name)); 106 | } 107 | else { 108 | let mut module = scope.new_module(mod_name); 109 | module.vis("pub"); 110 | module.scope().raw(&format!("//! {:?}", uri)); 111 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 112 | } 113 | } 114 | } 115 | 116 | fn gen_choices(&self, scope: &mut cg::Scope) { 117 | let module = scope.new_module("enums"); 118 | module.vis("pub"); 119 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 120 | let mut name_gen = NameGenerator::new(); 121 | for proc in &self.processors { 122 | let mut choices: Vec<_> = proc.choices.iter().collect(); 123 | choices.sort_by_key(|&(t,names)| (t, names.iter().collect::>())); 124 | for (ref choice, ref names) in choices { 125 | for name in names.iter() { 126 | let enum_name = escape_keyword(&name.to_camel_case()); 127 | let enum_name = name_gen.gen_name(enum_name); 128 | self.gen_choice(module.scope(), &enum_name, choice, &Documentation::new()); 129 | } 130 | } 131 | } 132 | } 133 | fn gen_choice(&self, scope: &mut cg::Scope, enum_name: &String, items: &Vec>>, doc: &Documentation<'input>) { 134 | let mut impl_code = Vec::new(); 135 | let enum_name = self.renames.get(enum_name).unwrap_or(enum_name); 136 | impl_code.push(format!("impl_enum!({},", enum_name)); 137 | { 138 | let enum_ = scope.new_enum(&enum_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 139 | for (i, item) in items.iter().enumerate() { 140 | let mut fields = Vec::new(); 141 | let mut doc = doc.clone(); 142 | { 143 | let mut name_gen = NameGenerator::new(); 144 | let field_writer = &mut |field_name: String, type_mod_name: String, min_occurs, max_occurs, type_name: String| { 145 | let field_name = escape_keyword(&name_gen.gen_name(field_name.to_snake_case())); 146 | let type_mod_name = escape_keyword(&type_mod_name.to_snake_case()); 147 | let type_name = escape_keyword(&type_name.to_camel_case()); 148 | fields.push((field_name, type_mod_name, min_occurs, max_occurs, type_name)); 149 | }; 150 | let doc_writer = &mut |doc2: &Documentation<'input>| doc.extend(doc2); 151 | self.write_type_in_struct_def(field_writer, &mut Some(doc_writer), &item.type_); 152 | } 153 | enum_.doc(&doc.to_string()); 154 | let variant_name = name_from_hint(&item.name_hint) 155 | .unwrap_or(format!("{}{}", enum_name, i)).to_camel_case(); 156 | let variant_name = escape_keyword(&variant_name.to_camel_case()); 157 | let variant_name = self.renames.get(&variant_name).unwrap_or(&variant_name); 158 | let mut variant = enum_.new_variant(&variant_name); 159 | if fields.len() == 1 { 160 | let (_, type_mod_name, min_occurs, max_occurs, type_name) = fields.remove(0); 161 | match (min_occurs, max_occurs) { 162 | (1, 1) => { 163 | variant.tuple(&format!("Box>", escape_keyword(&type_mod_name), escape_keyword(&type_name))); 164 | impl_code.push(format!(" impl_singleton_variant!({}, {}, Box<{}>),", variant_name, escape_keyword(&type_mod_name), escape_keyword(&type_name))); 165 | }, 166 | (0, 1) => { 167 | variant.tuple(&format!("Option>", escape_keyword(&type_mod_name), escape_keyword(&type_name))); 168 | impl_code.push(format!(" impl_singleton_variant!({}, {}, Option<{}>),", variant_name, escape_keyword(&type_mod_name), escape_keyword(&type_name))); 169 | }, 170 | (_, _) => { 171 | variant.tuple(&format!("Vec>", escape_keyword(&type_mod_name), escape_keyword(&type_name))); 172 | impl_code.push(format!(" impl_singleton_variant!({}, {}, Vec<{}>),", variant_name, escape_keyword(&type_mod_name), escape_keyword(&type_name))); 173 | }, 174 | } 175 | } 176 | else { 177 | impl_code.push(format!(" impl_struct_variant!({},", variant_name)); 178 | for (field_name, type_mod_name, min_occurs, max_occurs, type_name) in fields { 179 | match (min_occurs, max_occurs) { 180 | (1, 1) => { 181 | impl_code.push(format!(" ({}, {}, Box<{}>),", field_name, type_mod_name, type_name)); 182 | variant.named(&field_name, &format!("Box>", type_mod_name, type_name)); 183 | }, 184 | (0, 1) => { 185 | impl_code.push(format!(" ({}, {}, Option >),", field_name, type_mod_name, type_name)); 186 | variant.named(&field_name, &format!("Option> >", type_mod_name, type_name)); 187 | }, 188 | (_, _) => { 189 | impl_code.push(format!(" ({}, {}, Vec<{}>),", field_name, type_mod_name, type_name)); 190 | variant.named(&field_name, &format!("Vec >", type_mod_name, type_name)); 191 | }, 192 | } 193 | } 194 | impl_code.push(format!(" ),")); 195 | } 196 | } 197 | } 198 | impl_code.push(");".to_string()); 199 | scope.raw(&impl_code.join("\n")); 200 | } 201 | fn gen_unions(&self, scope: &mut cg::Scope) { 202 | let module = scope.new_module("unions"); 203 | module.vis("pub"); 204 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 205 | let mut name_gen = NameGenerator::new(); 206 | for proc in &self.processors { 207 | let mut unions: Vec<_> = proc.unions.iter().collect(); 208 | unions.sort_by_key(|&(items, names)| (items, names.iter().collect::>())); 209 | for (ref items, ref names) in unions { 210 | for name in names.iter() { 211 | let enum_name = escape_keyword(&name.to_camel_case()); 212 | let enum_name = name_gen.gen_name(enum_name); 213 | let mut impl_code = Vec::new(); 214 | impl_code.push(format!("impl_union!({}, {{", enum_name)); 215 | { 216 | let enum_ = module.new_enum(&enum_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 217 | for item in items.iter() { 218 | let RichType { name_hint, attrs, type_, doc } = item; 219 | let variant_name = name_from_hint(name_hint).unwrap().to_camel_case(); 220 | if let Some((type_mod_name, type_name)) = self.get_simple_type_name(type_) { 221 | enum_.new_variant(&variant_name).tuple(&format!("{}::{}<'input>", type_mod_name, type_name)); 222 | impl_code.push(format!(" impl_union_variant!({}),", variant_name)); 223 | } 224 | } 225 | } 226 | impl_code.push(format!("}});")); 227 | module.scope().raw(&impl_code.join("\n")); 228 | } 229 | } 230 | } 231 | } 232 | 233 | fn gen_lists(&self, scope: &mut cg::Scope) { 234 | let module = scope.new_module("lists"); 235 | module.vis("pub"); 236 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 237 | let mut name_gen = NameGenerator::new(); 238 | for proc in &self.processors { 239 | let mut lists: Vec<_> = proc.lists.iter().collect(); 240 | lists.sort_by_key(|&(item_type, names)| (item_type, names.iter().collect::>())); 241 | for (ref item_type, ref names) in lists { 242 | for name in names.iter() { 243 | let name = escape_keyword(&name.to_camel_case()); 244 | let struct_name = name_gen.gen_name(name); 245 | if let Some((type_mod_name, type_name)) = self.get_simple_type_name(&item_type.type_) { 246 | { 247 | let struct_ = module.new_struct(&struct_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 248 | struct_.tuple_field(&format!("pub Vec<{}::{}<'input>>", type_mod_name, type_name)); 249 | } 250 | module.scope().raw(&format!("impl_list!({}, {}::{});", struct_name, type_mod_name, type_name)); 251 | } 252 | } 253 | } 254 | } 255 | } 256 | 257 | fn get_simple_type_name(&self, ty: &SimpleType<'input>) -> Option<(String, String)> { 258 | let (type_mod_name, type_name) = match ty { 259 | SimpleType::Alias(name) => { 260 | if name.namespace() == Some(&SCHEMA_URI) { 261 | for (prim_name, prim_type_name) in PRIMITIVE_TYPES { 262 | if *prim_name == name.local_name() { 263 | return Some(("support".to_string(), prim_type_name.to_string())); 264 | } 265 | } 266 | } 267 | let type_mod_name = self.get_module_name(*name); 268 | let type_mod_name = escape_keyword(&type_mod_name.to_snake_case()); 269 | let type_name = escape_keyword(&name.local_name().to_camel_case()); 270 | (type_mod_name, type_name) 271 | }, 272 | SimpleType::Restriction(name, facets) => { 273 | ("restrictions".to_string(), self.simple_restrictions.get(&(name.clone(), facets.clone())).unwrap().to_string()) 274 | } 275 | SimpleType::Primitive(field_name, type_name) => { 276 | ("support".to_string(), type_name.to_string()) 277 | }, 278 | SimpleType::Union(type_name) => { 279 | let type_name = escape_keyword(&type_name.to_camel_case()); 280 | ("unions".to_string(), type_name) 281 | }, 282 | SimpleType::List(name) => { 283 | let type_name = escape_keyword(&name.to_camel_case()); 284 | ("lists".to_string(), type_name) 285 | }, 286 | SimpleType::Empty => { 287 | return None 288 | }, 289 | }; 290 | Some((type_mod_name, type_name)) 291 | } 292 | 293 | fn gen_simple_types(&mut self, scope: &mut cg::Scope) { 294 | self.gen_simple_restrictions(scope); 295 | let mut name_gen = NameGenerator::new(); 296 | for proc in &self.processors { 297 | let mut types: Vec<_> = proc.simple_types.iter().collect(); 298 | types.sort_by_key(|&(n,_)| n); 299 | for (&qname, (ref ty, ref doc)) in types { 300 | let mod_name = self.get_module_name(qname); 301 | if mod_name == "support" { 302 | // Implemented as a primitive, skip it. 303 | continue; 304 | } 305 | let scope = scope.get_module_mut(&mod_name) 306 | .expect(&mod_name).scope(); 307 | let name = escape_keyword(&qname.local_name().to_camel_case()); 308 | let name = name_gen.gen_name(name); 309 | if let Some((type_mod_name, type_name)) = self.get_simple_type_name(&ty.type_) { 310 | scope.raw(&format!("pub type {}<'input> = {}::{}<'input>;", name, type_mod_name, type_name)); 311 | } 312 | else { 313 | panic!("{:?}", ty) 314 | } 315 | } 316 | } 317 | } 318 | 319 | fn gen_simple_restrictions(&mut self, scope: &mut cg::Scope) { 320 | let mut name_gen = NameGenerator::new(); 321 | let module = scope.new_module("restrictions"); 322 | module.vis("pub"); 323 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 324 | 325 | for proc in &self.processors { 326 | let mut simple_restrictions: Vec<_> = proc.simple_restrictions.iter().collect(); 327 | 328 | simple_restrictions.sort(); 329 | for (base_name, facets) in simple_restrictions { 330 | if self.simple_restrictions.get(&(*base_name, facets.clone())).is_some() { 331 | continue; 332 | } 333 | let name = match &facets.enumeration { 334 | Some(items) => { 335 | if items.len() == 1 { 336 | format!("{}", items[0]) 337 | } 338 | else { 339 | format!("enumeration_{}", items.join("_")) 340 | } 341 | }, 342 | None => format!("Restrict_{}", base_name.local_name()), 343 | }; 344 | let name = name.to_camel_case(); 345 | let name = name_gen.gen_name(name.clone()); 346 | self.simple_restrictions.insert((base_name.clone(), facets.clone()), name.clone()); 347 | let (base_mod_name, base_type_name) = self.get_simple_type_name(&SimpleType::Alias(*base_name)).unwrap(); // TODO 348 | module.scope().raw(&format!("#[derive(Debug, PartialEq)] pub struct {}<'input>(pub {}::{}<'input>);", name, base_mod_name, base_type_name)); 349 | let mut s = Vec::new(); 350 | let f = &mut |n: &Option<_>| { 351 | match n.as_ref() { 352 | None => "None".to_string(), 353 | Some(f) => format!("Some(BigFloatNotNaN::from_str(\"{}\").unwrap())", f), 354 | } 355 | }; 356 | s.push(format!("min_exclusive: {},", f(&facets.min_exclusive))); 357 | s.push(format!("min_inclusive: {},", f(&facets.min_inclusive))); 358 | s.push(format!("max_exclusive: {},", f(&facets.max_exclusive))); 359 | s.push(format!("max_inclusive: {},", f(&facets.max_inclusive))); 360 | s.push(format!("total_digits: {:?},", facets.total_digits)); 361 | s.push(format!("fraction_digits: {:?},", facets.fraction_digits)); 362 | s.push(format!("length: {:?},", facets.length)); 363 | s.push(format!("min_length: {:?},", facets.min_length)); 364 | s.push(format!("max_length: {:?},", facets.max_length)); 365 | match &facets.enumeration { 366 | Some(items) => s.push(format!("enumeration: Some(vec![{}]),", items.iter().map(|i| format!("{:?}", i)).collect::>().join(", "))), 367 | None => s.push("enumeration: None,".to_string()), 368 | } 369 | s.push(format!("white_space: {:?},", facets.white_space)); 370 | s.push(format!("pattern: {:?},", facets.pattern)); 371 | s.push(format!("assertion: {:?},", facets.assertion)); 372 | s.push(format!("explicit_timezone: {:?},", facets.explicit_timezone)); 373 | module.scope().raw(&format!("impl_simpletype_restriction!({}, Facets {{\n {}\n}});", name, s.join("\n "))); 374 | } 375 | } 376 | } 377 | 378 | fn gen_sequences(&mut self, scope: &mut cg::Scope) { 379 | let module = scope.new_module("sequences"); 380 | module.vis("pub"); 381 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 382 | 383 | for proc in &self.processors { 384 | let mut sequences: Vec<_> = proc.sequences.iter().collect(); 385 | 386 | sequences.sort_by_key(|&(i,(n,_))| (n.iter().collect::>(), i)); 387 | for (sequence, (names, doc)) in sequences { 388 | for name in names.iter() { 389 | self.gen_group_or_sequence(module, name, &sequence.iter().collect(), doc); 390 | } 391 | } 392 | } 393 | } 394 | 395 | fn gen_groups(&mut self, scope: &mut cg::Scope) { 396 | for proc in &self.processors { 397 | let mut groups: Vec<_> = proc.groups.iter().collect(); 398 | 399 | groups.sort_by_key(|&(n,_)| n); 400 | for (&name, group) in groups { 401 | let mod_name = self.get_module_name(name); 402 | let mut module = scope.get_module_mut(&mod_name).unwrap(); 403 | let struct_name = name.local_name(); 404 | if let Type::InlineChoice(ref items) = group.type_ { 405 | self.gen_choice(module.scope(), &struct_name.to_string().to_camel_case(), items, &group.doc); 406 | } 407 | else if let Type::InlineSequence(ref items) = group.type_ { 408 | self.gen_group_or_sequence(module, struct_name, &items.iter().collect(), &group.doc); 409 | } 410 | else { 411 | self.gen_group_or_sequence(module, struct_name, &vec![group], &group.doc); 412 | } 413 | } 414 | } 415 | } 416 | 417 | fn gen_fields(&self, empty_struct: &mut bool, struct_: &mut cg::Struct, impl_code: &mut Vec, doc: &mut Documentation<'input>, name_gen: &mut NameGenerator, type_: &Type<'input>) { 418 | let field_writer = &mut |name: String, type_mod_name: String, min_occurs, max_occurs, type_name: String| { 419 | *empty_struct = false; 420 | let name = escape_keyword(&name_gen.gen_name(name.to_snake_case())); 421 | let name = self.renames.get(&name).unwrap_or(&name); 422 | let type_mod_name = escape_keyword(&type_mod_name.to_snake_case()); 423 | let type_name = escape_keyword(&type_name.to_camel_case()); 424 | let type_name = self.renames.get(&type_name).unwrap_or(&type_name); 425 | match (min_occurs, max_occurs) { 426 | (1, 1) => { 427 | struct_.field(&format!("pub {}", name), &format!("super::{}::{}<'input>", type_mod_name, type_name)); 428 | impl_code.push(format!(" ({}, {}, {}),", name, type_mod_name, type_name)) 429 | }, 430 | (0, 1) => { 431 | struct_.field(&format!("pub {}", name), &format!("Option>", type_mod_name, type_name)); 432 | impl_code.push(format!(" ({}, {}, Option<{}>),", name, type_mod_name, type_name)) 433 | }, 434 | (_, ::std::usize::MAX) => { 435 | struct_.field(&format!("pub {}", name), &format!("Vec>", type_mod_name, type_name)); 436 | impl_code.push(format!(" ({}, {}, Vec<{}; min={};>),", name, type_mod_name, type_name, min_occurs)) 437 | }, 438 | (_, _) => { 439 | struct_.field(&format!("pub {}", name), &format!("Vec>", type_mod_name, type_name)); 440 | impl_code.push(format!(" ({}, {}, Vec<{}; min={}; max={};>),", name, type_mod_name, type_name, min_occurs, max_occurs)) 441 | }, 442 | } 443 | }; 444 | let doc_writer = &mut |doc2| doc.extend(doc2); 445 | self.write_type_in_struct_def(field_writer, &mut Some(doc_writer), &type_); 446 | } 447 | 448 | fn gen_group_or_sequence(&self, module: &mut cg::Module, struct_name: &'input str, items: &Vec<&RichType<'input, Type<'input>>>, doc: &Documentation<'input>) { 449 | let mut impl_code = Vec::new(); 450 | let struct_name = escape_keyword(&struct_name.to_camel_case()); 451 | let struct_name = self.renames.get(&struct_name).unwrap_or(&struct_name); 452 | impl_code.push(format!("impl_group_or_sequence!({},", struct_name)); 453 | { 454 | let mut empty_struct = true; 455 | let struct_ = module.new_struct(&struct_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 456 | let mut name_gen = NameGenerator::new(); 457 | let mut doc = doc.clone(); 458 | { 459 | for item in items { 460 | self.gen_fields(&mut empty_struct, struct_, &mut impl_code, &mut doc, &mut name_gen, &item.type_); 461 | } 462 | } 463 | struct_.doc(&doc.to_string()); 464 | if empty_struct { 465 | struct_.tuple_field(&format!("pub ::std::marker::PhantomData<&'input ()>")); 466 | } 467 | } 468 | impl_code.push(");".to_string()); 469 | module.scope().raw(&impl_code.join("\n")); 470 | } 471 | 472 | fn gen_inline_elements(&mut self, scope: &mut cg::Scope) { 473 | let module = scope.new_module("inline_elements"); 474 | module.vis("pub"); 475 | module.scope().raw("#[allow(unused_imports)]\nuse super::*;"); 476 | for proc in &self.processors { 477 | let mut elements: Vec<_> = proc.inline_elements.iter().collect(); 478 | 479 | elements.sort_by_key(|&((ns,n,_,_),(n2,_))| (ns, n, n2.iter().collect::>())); 480 | for ((namespace, tag_name, attrs, element), (struct_names, doc)) in elements { 481 | // struct_names is always non-empty. 482 | 483 | let mut struct_names: Vec<_> = struct_names.iter().map(|s| s.to_camel_case()).collect(); 484 | 485 | // Sort them to get the shortest one, and alias all the others to this one 486 | struct_names.sort_by_key(|n| n.len()); // TODO: just use a min_by_key 487 | for alias in &struct_names[1..] { 488 | module.scope().raw(&format!("pub type {}<'input> = {}<'input>;", alias, struct_names[0])); 489 | } 490 | 491 | let tag_name = FullName::new(*namespace, tag_name); 492 | self.gen_element(module, &struct_names[0], &tag_name, attrs, element, doc); 493 | } 494 | } 495 | } 496 | 497 | fn gen_elements(&mut self, scope: &mut cg::Scope) { 498 | for proc in &self.processors { 499 | let mut elements: Vec<_> = proc.elements.iter().collect(); 500 | 501 | elements.sort_by_key(|&(n,_)| n); 502 | for (&name, element) in elements { 503 | let mod_name = self.get_module_name(name); 504 | let mut module = scope.get_module_mut(&mod_name).expect(&mod_name); 505 | let head_local_name = format!("{}_head", name.local_name()); 506 | let mut substitutions = Vec::new(); 507 | substitutions.push(FullName::new(name.namespace(), &head_local_name)); 508 | for proc in &self.processors { 509 | if let Some(members) = proc.substitution_groups.get(&name) { 510 | substitutions.extend(members); 511 | } 512 | } 513 | if substitutions.len() > 1 { 514 | let enum_name = escape_keyword(&name.local_name().to_camel_case()); 515 | self.gen_substitution_enum(module.scope(), &enum_name, &substitutions); 516 | let struct_name = escape_keyword(&head_local_name.to_camel_case()); 517 | self.gen_element(module, &struct_name, &name, &element.attrs, &element.type_, &element.doc); 518 | } 519 | else { 520 | let struct_name = escape_keyword(&name.local_name().to_camel_case()); 521 | self.gen_element(module, &struct_name, &name, &element.attrs, &element.type_, &element.doc); 522 | } 523 | } 524 | } 525 | } 526 | 527 | fn gen_substitution_enum(&self, scope: &mut cg::Scope, enum_name: &str, substitutions: &Vec>) { 528 | let mut impl_code = Vec::new(); 529 | impl_code.push(format!("impl_enum!({},", enum_name)); 530 | let mut name_gen = NameGenerator::new(); 531 | { 532 | let enum_ = scope.new_enum(&enum_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 533 | for &substitution in substitutions { 534 | let variant_name = escape_keyword(&name_gen.gen_name(substitution.local_name().to_camel_case())); 535 | let type_mod_name = escape_keyword(&self.get_module_name(substitution).to_snake_case()); 536 | let type_name = escape_keyword(&substitution.local_name().to_camel_case()); 537 | let mut variant = enum_.new_variant(&variant_name); 538 | variant.tuple(&format!("Box>", escape_keyword(&type_mod_name), escape_keyword(&type_name))); 539 | impl_code.push(format!(" impl_singleton_variant!({}, {}, Box<{}>),", variant_name, escape_keyword(&type_mod_name), escape_keyword(&type_name))); 540 | } 541 | impl_code.push(");".to_string()); 542 | } 543 | scope.raw(&impl_code.join("\n")); 544 | } 545 | 546 | fn gen_attrs(&self, struct_: &mut cg::Struct, impl_code: &mut Vec, name_gen: &mut NameGenerator, attrs: &Attrs<'input>, seen_attrs: &mut HashMap, AttrUse>, generated_attrs: &mut HashSet>, inherited: bool) { 547 | for (attr_name, use_, attr_type) in &attrs.named { 548 | if generated_attrs.contains(attr_name) { 549 | continue; 550 | } 551 | let default_type = SimpleType::Primitive(SCHEMA_URI, "AnySimpleType"); 552 | let type_ = attr_type.as_ref().unwrap_or(&default_type); 553 | let (type_mod_name, type_name) = self.get_simple_type_name(&type_).unwrap(); 554 | let use_ = if inherited { 555 | *seen_attrs.get(attr_name).unwrap_or(use_) 556 | } 557 | else { 558 | *use_ 559 | }; 560 | seen_attrs.insert(attr_name.clone(), use_); 561 | generated_attrs.insert(attr_name.clone()); 562 | match use_ { 563 | AttrUse::Optional => { 564 | let field_name = name_gen.gen_name(format!("attr_{}", attr_name.local_name()).to_snake_case()); 565 | struct_.field(&format!("pub {}", field_name), &format!("Option<{}::{}<'input>>", type_mod_name, type_name)); 566 | impl_code.push(format!(" ({:?}, {:?}) => {}: optional,", attr_name.namespace().unwrap_or(""), attr_name.local_name(), field_name)); 567 | }, 568 | AttrUse::Required => { 569 | let field_name = name_gen.gen_name(format!("attr_{}", attr_name.local_name()).to_snake_case()); 570 | struct_.field(&format!("pub {}", field_name), &format!("{}::{}<'input>", type_mod_name, type_name)); 571 | impl_code.push(format!(" ({:?}, {:?}) => {}: required,", attr_name.namespace().unwrap_or(""), attr_name.local_name(), field_name)); 572 | }, 573 | AttrUse::Prohibited => (), 574 | } 575 | } 576 | for group_name in &attrs.group_refs { 577 | let mut found = false; 578 | for processor in self.processors.iter() { 579 | if let Some(attrs) = processor.attribute_groups.get(group_name) { 580 | self.gen_attrs(struct_, impl_code, name_gen, attrs, seen_attrs, generated_attrs, false); 581 | found = true; 582 | break; 583 | } 584 | } 585 | if !found { 586 | panic!("unknown attribute group: {:?}", group_name); 587 | } 588 | } 589 | } 590 | 591 | fn gen_element(&self, module: &mut cg::Module, struct_name: &str, tag_name: &FullName<'input>, attrs: &Attrs<'input>, type_: &Type<'input>, doc: &Documentation<'input>) { 592 | let mut impl_code = Vec::new(); 593 | impl_code.push(format!("impl_element!({}, {:?}, \"{}\", attributes = {{", 594 | struct_name, tag_name.namespace().unwrap_or(""), tag_name.local_name())); 595 | { 596 | let struct_ = module.new_struct(&struct_name).vis("pub").derive("Debug").derive("PartialEq").generic("'input"); 597 | let mut empty_struct = false; 598 | struct_.field("pub attrs", "HashMap, &'input str>"); 599 | let mut name_gen = NameGenerator::new(); 600 | let mut doc = doc.clone(); 601 | let mut generated_attrs = HashSet::new(); 602 | let mut seen_attrs = HashMap::new(); 603 | 604 | let attrs = self.compute_attrs(&type_, attrs); 605 | self.gen_attrs(struct_, &mut impl_code, &mut name_gen, &attrs, &mut seen_attrs, &mut generated_attrs, false); 606 | { 607 | let field_writer = &mut |_, _, _, _, _| (); 608 | let doc_writer = &mut |_| (); 609 | self.write_type_in_struct_def(field_writer, &mut Some(doc_writer), &type_); 610 | } 611 | impl_code.push(format!("}}, fields = {{")); 612 | self.gen_fields(&mut empty_struct, struct_, &mut impl_code, &mut doc, &mut name_gen, type_); 613 | struct_.doc(&doc.to_string()); 614 | } 615 | impl_code.push(format!("}});")); 616 | module.scope().raw(&impl_code.join("\n")); 617 | } 618 | 619 | fn get_type(&self, name: &FullName<'input>) -> &RichType<'input, Type<'input>> { 620 | if name.namespace() == Some(SCHEMA_URI) { 621 | if let Some(type_) = self.primitive_types.get(name.local_name()) { 622 | return type_; 623 | } 624 | } 625 | let mut type_ = None; 626 | for proc in &self.processors { 627 | if proc.target_namespace != name.namespace() { 628 | continue; 629 | } 630 | type_ = proc.types.get(name); 631 | if type_.is_some() { 632 | break; 633 | } 634 | } 635 | let type_ = type_.expect(&format!("Unknown type name: {:?}", name)); 636 | type_ 637 | } 638 | 639 | fn write_type_in_struct_def<'a, F, H>(&'a self, 640 | field_writer: &mut F, 641 | doc_writer: &mut Option<&mut H>, 642 | type_: &'a Type<'input>, 643 | ) where 644 | F: FnMut(String, String, usize, usize, String), 645 | H: FnMut(&'a Documentation<'input>), 646 | 'ast: 'a { 647 | let mut doc_non_writer: Option<&mut H> = None; 648 | match &type_ { 649 | Type::Alias(name) => { 650 | let target_type = self.get_type(name); 651 | if let Some(ref mut f) = doc_writer { 652 | f(&target_type.doc); 653 | } 654 | self.write_type_in_struct_def(field_writer, doc_writer, &target_type.type_); 655 | }, 656 | Type::InlineSequence(items) => { 657 | for item in items { 658 | self.write_type_in_struct_def(field_writer, &mut doc_non_writer, &item.type_); 659 | } 660 | } 661 | Type::Sequence(min_occurs, max_occurs, name) => { 662 | field_writer(name.to_string(), "sequences".to_string(), *min_occurs, *max_occurs, name.to_string()); 663 | } 664 | Type::Element(min_occurs, max_occurs, name) => { 665 | field_writer(name.to_string(), "inline_elements".to_string(), *min_occurs, *max_occurs, name.to_string()); 666 | } 667 | Type::Group(min_occurs, max_occurs, name) | 668 | Type::ElementRef(min_occurs, max_occurs, name) => { 669 | let field_name = name.local_name(); 670 | let mod_name = self.get_module_name(*name); 671 | field_writer(field_name.to_string(), mod_name.to_string(), *min_occurs, *max_occurs, name.local_name().to_string()); 672 | }, 673 | Type::Choice(min_occurs, max_occurs, ref name) => { 674 | field_writer(name.to_string(), "enums".to_string(), *min_occurs, *max_occurs, name.to_string()); 675 | }, 676 | Type::Extension(base, ext_type) => { 677 | let base_type = &self.get_type(base); 678 | self.write_type_in_struct_def(field_writer, &mut doc_non_writer, &base_type.type_); 679 | self.write_type_in_struct_def(field_writer, doc_writer, &ext_type.type_); 680 | }, 681 | Type::Restriction(base, ext_type) => { 682 | if let Some(ref mut f) = doc_writer { 683 | f(&ext_type.doc); 684 | } 685 | let base_type = &self.get_type(base); 686 | // TODO: do something with the base's type 687 | self.write_type_in_struct_def(field_writer, doc_writer, &ext_type.type_); 688 | }, 689 | Type::Empty => (), // TODO ? 690 | Type::Any => { 691 | field_writer("any".to_string(), "support".to_string(), 1, 1, "Any".to_string()) 692 | }, 693 | Type::Simple(type_) => { 694 | let (type_mod_name, type_name) = self.get_simple_type_name(&type_).unwrap(); 695 | field_writer(type_name.clone(), type_mod_name, 1, 1, type_name); 696 | } 697 | _ => unimplemented!("writing {:?}", type_), 698 | } 699 | } 700 | 701 | fn compute_attrs(&self, type_: &Type<'input>, own_attrs: &Attrs<'input>) -> Attrs<'input> { 702 | match type_ { 703 | Type::Alias(name) => { 704 | let target_type = self.get_type(name); 705 | let target_attrs = self.compute_attrs(&target_type.type_, &target_type.attrs); 706 | self.extend_attrs(&target_attrs, own_attrs) 707 | }, 708 | Type::InlineSequence(_) | 709 | Type::Sequence(_, _, _) | 710 | Type::Element(_, _, _) | 711 | Type::Group(_, _, _) | 712 | Type::ElementRef(_, _, _) | 713 | Type::Choice(_, _, _) | 714 | Type::Empty | 715 | Type::Any => { 716 | own_attrs.clone() 717 | } 718 | Type::Extension(base, ext_type) => { 719 | let base_type = &self.get_type(&base); 720 | let base_attrs = self.compute_attrs(&base_type.type_, &base_type.attrs); 721 | let own_attrs = self.extend_attrs(own_attrs, &ext_type.attrs); // XXX 722 | self.extend_attrs(&base_attrs, &own_attrs) 723 | }, 724 | Type::Restriction(base, ext_type) => { 725 | let base_type = &self.get_type(&base); 726 | let base_attrs = self.compute_attrs(&base_type.type_, &base_type.attrs); 727 | let own_attrs = self.extend_attrs(own_attrs, &ext_type.attrs); // XXX 728 | self.restrict_attrs(&base_attrs, &own_attrs) 729 | }, 730 | Type::Simple(type2) => { 731 | own_attrs.clone() 732 | } 733 | _ => unimplemented!("writing {:?}", type_), 734 | } 735 | } 736 | 737 | pub fn extend_attrs(&self, base: &Attrs<'input>, other: &Attrs<'input>) -> Attrs<'input> { 738 | let mut other_named = HashMap::new(); 739 | for (name, attr_use, type_) in other.named.iter() { 740 | other_named.insert(name.clone(), (*attr_use, type_)); 741 | } 742 | let mut seen = HashSet::new(); 743 | let mut named: Vec<_> = base.named.iter().map(|(name, attr_use, type_)| { 744 | seen.insert(name); 745 | match other_named.get(name) { 746 | None => (name.clone(), *attr_use, (*type_).clone()), 747 | Some((attr_use, type_)) => (name.clone(), *attr_use, (*type_).clone()), 748 | } 749 | }).collect(); 750 | 751 | let mut other_refs = HashMap::new(); 752 | for (name, attr_use, ref_) in other.refs.iter() { 753 | other_refs.insert((name.clone(), ref_.clone()), *attr_use); 754 | } 755 | let mut refs: Vec<_> = base.refs.iter().map(|(name, attr_use, ref_)| { 756 | if let Some(name) = name { 757 | seen.insert(name); 758 | } 759 | match other_refs.get(&(*name, *ref_)) { 760 | None => (name.clone(), *attr_use, (*ref_).clone()), 761 | Some(attr_use) => (name.clone(), *attr_use, (*ref_).clone()), 762 | } 763 | }).collect(); 764 | 765 | for (name, attr_use, type_) in other.named.iter() { 766 | if !seen.contains(name) { 767 | named.push((name.clone(), *attr_use, type_.clone())); 768 | } 769 | } 770 | for (name, attr_use, ref_) in other.refs.iter() { 771 | match name { 772 | Some(name) => { 773 | if !seen.contains(name) { 774 | refs.push((Some(name.clone()), *attr_use, ref_.clone())); 775 | } 776 | }, 777 | None => (), // TODO 778 | } 779 | } 780 | 781 | let mut group_refs = base.group_refs.clone(); 782 | let seen_refs: HashSet<_> = base.group_refs.iter().collect(); 783 | for group_ref in other.group_refs.iter() { 784 | if !seen_refs.contains(group_ref) { 785 | group_refs.push(*group_ref); 786 | } 787 | } 788 | 789 | let res = Attrs { named, refs, group_refs, any_attributes: other.any_attributes }; 790 | res 791 | } 792 | 793 | pub fn restrict_attrs(&self, base: &Attrs<'input>, other: &Attrs<'input>) -> Attrs<'input> { 794 | self.extend_attrs(base, other) // XXX 795 | } 796 | } 797 | -------------------------------------------------------------------------------- /xml-schema/src/primitives.rs: -------------------------------------------------------------------------------- 1 | use std::cmp::max; 2 | use std::str::FromStr; 3 | use std::marker::PhantomData; 4 | use std::fmt; 5 | 6 | use bigdecimal::BigDecimal; 7 | use num_traits::{Zero, One}; 8 | 9 | use xmlparser::{Token as XmlToken, ElementEnd, StrSpan}; 10 | 11 | use support::{ParseXml, ParseXmlStr, Stream, ParseContext, ParentContext, Facets, BigFloatNotNaN}; 12 | use xml_utils::*; 13 | 14 | macro_rules! return_split { 15 | ( $input:expr, $position:expr, $pred:expr, $validator:ident !, $facets:expr) => {{ 16 | let input = $input; 17 | let pos = $position; 18 | let parsed = &input[0..pos]; 19 | $validator!(parsed, $facets); 20 | return Some((&input[pos..], $pred(parsed))) 21 | }} 22 | } 23 | 24 | macro_rules! validate_str { 25 | ( $s:expr, $facets:expr) => {{ 26 | let facets = $facets; 27 | let s: &&str = &$s; 28 | if let Some(ref enumeration) = facets.enumeration { 29 | if !enumeration.contains(s) { 30 | panic!("Expected one of {:?}, got {:?}", enumeration, s); 31 | } 32 | } 33 | if let Some(ref length) = facets.length { 34 | if s.len() != *length { 35 | panic!("{:?} has length != {}", s, length); 36 | } 37 | } 38 | if let Some(ref min_length) = facets.min_length { 39 | if s.len() < *min_length { 40 | panic!("{:?} has length < {}", s, min_length); 41 | } 42 | } 43 | if let Some(ref max_length) = facets.max_length { 44 | if s.len() > *max_length { 45 | panic!("{:?} has length > {}", s, max_length); 46 | } 47 | } 48 | }} 49 | } 50 | 51 | macro_rules! validate_int { 52 | ( $n:expr, $facets:expr) => {{ 53 | let n: BigDecimal = $n.into(); 54 | validate_decimal!(n, $facets); 55 | }} 56 | } 57 | macro_rules! validate_decimal { 58 | ( $n:expr, $facets:expr) => {{ 59 | let facets = $facets; 60 | let n: BigFloatNotNaN = $n.into(); 61 | if let Some(ref min_exclusive) = facets.min_exclusive { 62 | if n <= *min_exclusive { 63 | panic!("{} is <= {}", n, min_exclusive); 64 | } 65 | } 66 | if let Some(ref min_inclusive) = facets.min_inclusive { 67 | if n < *min_inclusive { 68 | panic!("{} is < {}", n, min_inclusive); 69 | } 70 | } 71 | if let Some(ref max_exclusive) = facets.max_exclusive { 72 | if n >= *max_exclusive { 73 | panic!("{} is >= {}", n, max_exclusive); 74 | } 75 | } 76 | if let Some(ref max_inclusive) = facets.max_inclusive { 77 | if n > *max_inclusive { 78 | panic!("{} is > {}", n, max_inclusive); 79 | } 80 | } 81 | }} 82 | } 83 | 84 | pub const PRIMITIVE_TYPES: &[(&'static str, &'static str)] = &[ 85 | ("anySimpleType", "AnySimpleType"), 86 | ("token", "Token"), 87 | ("QName", "QName"), 88 | ("string", "XmlString"), 89 | ("positiveInteger", "PositiveInteger"), 90 | ("anyURI", "AnyUri"), 91 | ("boolean", "Boolean"), 92 | ("NCName", "NcName"), 93 | ("nonNegativeInteger", "NonNegativeInteger"), 94 | ("dateTime", "DateTime"), 95 | ("date", "Date"), 96 | ("duration", "Duration"), 97 | ("decimal", "Decimal"), 98 | ]; 99 | 100 | pub type DateTime<'input> = Token<'input>; // TODO 101 | pub type Date<'input> = Token<'input>; // TODO 102 | pub type Duration<'input> = Token<'input>; // TODO 103 | 104 | /// https://www.w3.org/TR/xmlschema11-2/#token 105 | #[derive(Debug, PartialEq)] 106 | pub struct Token<'input>(pub &'input str); 107 | 108 | impl<'input> ParseXmlStr<'input> for Token<'input> { 109 | const NODE_NAME: &'static str = "token"; 110 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Token<'input>)> { 111 | if input.len() == 0 { 112 | return None; 113 | } 114 | let mut iter = input.char_indices().peekable(); 115 | while let Some((i, c)) = iter.next() { 116 | match (i, c) { 117 | (0, ' ') => return None, 118 | (_, ' ') => { 119 | // If this space is followed by a whitespace, split before both 120 | match iter.peek() { 121 | Some((_, ' ')) | Some((_, '\r')) | Some((_, '\n')) | 122 | Some((_, '\t')) => return_split!(input, i, Token, validate_str!, facets), 123 | Some((_, _)) => (), 124 | None => return_split!(input, i, Token, validate_str!, facets), 125 | } 126 | } 127 | (_, '\r') | (_, '\n') | (_, '\t') => return_split!(input, i, Token, validate_str!, facets), 128 | _ => (), 129 | } 130 | } 131 | validate_str!(input, facets); 132 | Some(("", Token(input))) 133 | } 134 | } 135 | impl<'input> Default for Token<'input> { 136 | fn default() -> Self { 137 | Token("") 138 | } 139 | } 140 | 141 | #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, Default)] 142 | pub struct QName<'input> { 143 | pub namespace: Option<&'input str>, 144 | pub local_name: &'input str, 145 | } 146 | impl<'input> ParseXmlStr<'input> for QName<'input> { 147 | const NODE_NAME: &'static str = "QName"; 148 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, QName<'input>)> { 149 | if input.len() == 0 { 150 | return None; 151 | } 152 | let f = &mut |prefix, local| QName { 153 | namespace: parent_context.namespaces.get(prefix).cloned(), 154 | local_name: local 155 | }; 156 | let mut i1 = 0; 157 | for (i, c) in input.char_indices() { 158 | if c == ':' { 159 | i1 = i; 160 | } 161 | else if c == ' ' { // TODO 162 | if i == 0 || i <= i1+1 { 163 | return None; 164 | } 165 | if i1 > 0 { 166 | return Some((&input[i..], f(&input[0..i1+1], &input[i1+1..i+1]))) 167 | } 168 | else { 169 | return Some((&input[i..], f("", &input[0..i+1]))) 170 | } 171 | } 172 | } 173 | if i1 > 0 { 174 | return Some(("", f(&input[0..i1], &input[i1+1..]))) 175 | } 176 | else { 177 | return Some(("", f("", input))) 178 | } 179 | } 180 | } 181 | 182 | impl<'input> From<&'input str> for QName<'input> { 183 | fn from(s: &'input str) -> QName<'input> { 184 | let mut splitted = s.split(":"); 185 | let v1 = splitted.next().expect(&format!("Empty qname")); 186 | let v2 = splitted.next(); 187 | assert_eq!(splitted.next(), None); 188 | match v2 { 189 | None => QName { namespace: None, local_name: v1 }, 190 | Some(v2) => QName { namespace: Some(v1), local_name: v2 }, 191 | } 192 | } 193 | } 194 | 195 | impl <'input> QName<'input> { 196 | pub fn from_strspans(prefix: StrSpan<'input>, local: StrSpan<'input>) -> QName<'input> { 197 | match prefix.to_str() { 198 | "" => QName { namespace: None, local_name: local.to_str() }, 199 | p => QName { namespace: Some(p), local_name: local.to_str() }, 200 | } 201 | } 202 | } 203 | 204 | impl<'input> fmt::Display for QName<'input> { 205 | fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { 206 | match self.namespace { 207 | Some(ns) => write!(f, "{}:{}", ns, self.local_name), 208 | None => write!(f, "{}", self.local_name), 209 | } 210 | } 211 | } 212 | 213 | #[derive(Debug, PartialEq, Default)] 214 | pub struct AnyUri<'input>(pub &'input str); 215 | impl<'input> ParseXmlStr<'input> for AnyUri<'input> { 216 | const NODE_NAME: &'static str = "AnyUri"; 217 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, AnyUri<'input>)> { 218 | if input.len() == 0 { 219 | return None; 220 | } 221 | for (i, c) in input.char_indices() { 222 | if c == ' ' { // TODO 223 | if i == 0 { 224 | return None; 225 | } 226 | return Some((&input[i..], AnyUri(&input[0..i]))) 227 | } 228 | } 229 | Some(("", AnyUri(input))) 230 | } 231 | } 232 | 233 | #[derive(Debug, PartialEq)] 234 | pub struct AnyURIElement<'input>(StrSpan<'input>); 235 | impl<'input> ParseXml<'input> for AnyURIElement<'input> { 236 | const NODE_NAME: &'static str = "AnyURIElement"; 237 | fn parse_self_xml>(stream: &mut Stream<'input>, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>) -> Option> { 238 | match stream.next() { 239 | Some(XmlToken::Text(strspan)) => Some(AnyURIElement(strspan)), 240 | _ => None, 241 | } 242 | } 243 | } 244 | 245 | #[derive(Debug, PartialEq, Default)] 246 | pub struct Integer<'input>(pub i64, PhantomData<&'input ()>); 247 | impl<'input> ParseXmlStr<'input> for Integer<'input> { 248 | const NODE_NAME: &'static str = "Integer"; 249 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Integer<'input>)> { 250 | let mut iter = input.char_indices(); 251 | let mut n: i64 = 0; 252 | let mut multiplier = 1; 253 | let c = iter.next()?.1; 254 | match c { 255 | '+' => multiplier = 1, 256 | '-' => multiplier = -1, 257 | '0'..='9' => n = (c as i64) - ('0' as i64), 258 | _ => return None, 259 | } 260 | 261 | if c == '+' || c == '-' { 262 | let c = iter.next()?.1; 263 | match c { 264 | '0'..='9' => n = (c as i64) - ('0' as i64), 265 | _ => return None, 266 | } 267 | } 268 | 269 | for (i,c) in iter { 270 | match c { 271 | '0'..='9' => n = n * 10 + ((c as i64) - ('0' as i64)), 272 | _ => { 273 | let res = multiplier * n; 274 | validate_int!(res, facets); 275 | return Some((&input[i..], Integer(res, PhantomData::default()))); 276 | } 277 | } 278 | } 279 | 280 | let res = multiplier * n; 281 | validate_int!(res, facets); 282 | Some(("", Integer(res, PhantomData::default()))) 283 | } 284 | } 285 | 286 | #[derive(Debug, PartialEq)] 287 | pub struct NonNegativeInteger<'input>(pub u64, PhantomData<&'input ()>); 288 | impl<'input> ParseXmlStr<'input> for NonNegativeInteger<'input> { 289 | const NODE_NAME: &'static str = "NonNegativeInteger"; 290 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets) -> Option<(&'input str, NonNegativeInteger<'input>)> { 291 | let min = max(BigFloatNotNaN::zero(), facets.min_inclusive.clone().unwrap_or(BigFloatNotNaN::zero())); 292 | let mut facets = facets.clone(); 293 | facets.min_inclusive = Some(min); 294 | let (output, n) = Integer::parse_self_xml_str(input, parse_context, parent_context, &facets)?; 295 | Some((output, NonNegativeInteger(n.0 as u64, PhantomData::default()))) 296 | } 297 | } 298 | 299 | #[derive(Debug, PartialEq)] 300 | pub struct PositiveInteger<'input>(pub u64, PhantomData<&'input ()>); 301 | impl<'input> ParseXmlStr<'input> for PositiveInteger<'input> { 302 | const NODE_NAME: &'static str = "PositiveInteger"; 303 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets) -> Option<(&'input str, PositiveInteger<'input>)> { 304 | let min = max(BigFloatNotNaN::one(), facets.min_inclusive.clone().unwrap_or(BigFloatNotNaN::zero())); 305 | let mut facets = facets.clone(); 306 | facets.min_inclusive = Some(min); 307 | let (output, n) = NonNegativeInteger::parse_self_xml_str(input, parse_context, parent_context, &facets)?; 308 | Some((output, PositiveInteger(n.0, PhantomData::default()))) 309 | } 310 | } 311 | 312 | #[derive(Debug, PartialEq, Default)] 313 | pub struct Decimal<'input>(pub BigDecimal, PhantomData<&'input ()>); 314 | impl<'input> ParseXmlStr<'input> for Decimal<'input> { 315 | const NODE_NAME: &'static str = "Decimal"; 316 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Decimal<'input>)> { 317 | for (i, c) in input.char_indices() { 318 | if c == ' ' { // TODO 319 | let res = match BigDecimal::from_str(&input[0..i]) { 320 | Ok(res) => res, 321 | Err(_) => return None, 322 | }; 323 | validate_decimal!(res.clone(), facets); 324 | return Some((&input[i..], Decimal(res, PhantomData::default()))) 325 | } 326 | } 327 | let res = match BigDecimal::from_str(input) { 328 | Ok(res) => res, 329 | Err(_) => return None, 330 | }; 331 | validate_decimal!(res.clone(), facets); 332 | Some(("", Decimal(res, PhantomData::default()))) 333 | } 334 | } 335 | 336 | #[derive(Debug, PartialEq, Default)] 337 | pub struct Any<'input>(pub Vec>); 338 | impl<'input> ParseXml<'input> for Any<'input> { 339 | const NODE_NAME: &'static str = "Any"; 340 | fn parse_self_xml>(stream: &mut Stream<'input>, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>) -> Option> { 341 | let mut tag_stack = Vec::new(); 342 | let mut tokens = Vec::new(); 343 | loop { 344 | let tx = stream.transaction(); 345 | let tok = stream.next()?; 346 | match tok { 347 | XmlToken::Whitespaces(_) => (), 348 | XmlToken::Comment(_) => (), 349 | XmlToken::Text(_) => (), 350 | XmlToken::ElementStart(prefix, name) => { 351 | tag_stack.push(QName::from_strspans(prefix, name)); 352 | tokens.push(tok); 353 | break 354 | }, 355 | _ => { 356 | tx.rollback(stream); 357 | if tokens.len() > 0 { 358 | return Some(Any(tokens)); 359 | } 360 | else { 361 | return None; 362 | } 363 | } 364 | } 365 | tokens.push(tok); 366 | } 367 | while tag_stack.len() > 0 { 368 | let tok = stream.next().unwrap(); 369 | tokens.push(tok); 370 | match tok { 371 | XmlToken::ElementStart(prefix, name) => tag_stack.push(QName::from_strspans(prefix, name)), 372 | XmlToken::ElementEnd(end) => { 373 | match end { 374 | ElementEnd::Open => (), 375 | ElementEnd::Close(prefix, name) => assert_eq!(QName::from_strspans(prefix, name), tag_stack.pop().unwrap()), 376 | ElementEnd::Empty => { tag_stack.pop(); () }, 377 | } 378 | } 379 | _ => (), 380 | } 381 | } 382 | Some(Any(tokens)) 383 | } 384 | } 385 | 386 | /// https://www.w3.org/TR/xmlschema11-2/#string 387 | #[derive(Debug, PartialEq)] 388 | pub struct XmlString<'input>(pub &'input str); 389 | 390 | impl<'input> ParseXmlStr<'input> for XmlString<'input> { 391 | const NODE_NAME: &'static str = "XmlString"; 392 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, XmlString<'input>)> { 393 | for (i, c) in input.char_indices() { 394 | if !is_xml_char(c) { 395 | return_split!(input, i, XmlString, validate_str!, facets); 396 | } 397 | } 398 | Some(("", XmlString(input))) 399 | } 400 | } 401 | 402 | impl<'input> Default for XmlString<'input> { 403 | fn default() -> Self { 404 | XmlString("") 405 | } 406 | } 407 | 408 | /// https://www.w3.org/TR/xmlschema11-2/#anySimpleType 409 | #[derive(Debug, PartialEq)] 410 | pub struct AnySimpleType<'input>(pub &'input str); 411 | 412 | impl<'input> ParseXmlStr<'input> for AnySimpleType<'input> { 413 | const NODE_NAME: &'static str = "AnySimpleType"; 414 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, AnySimpleType<'input>)> { 415 | Some(("", AnySimpleType(input))) 416 | } 417 | } 418 | 419 | impl<'input> Default for AnySimpleType<'input> { 420 | fn default() -> Self { 421 | AnySimpleType("") 422 | } 423 | } 424 | 425 | 426 | /// https://www.w3.org/TR/xmlschema11-2/#NCName 427 | #[derive(Debug, PartialEq)] 428 | pub struct NcName<'input>(pub &'input str); 429 | 430 | impl<'input> ParseXmlStr<'input> for NcName<'input> { 431 | const NODE_NAME: &'static str = "NcName"; 432 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, NcName<'input>)> { 433 | let mut iter = input.char_indices(); 434 | let c = iter.next()?.1; 435 | if c == ':' || !is_name_start_char(c) { return None }; 436 | 437 | for (i, c) in iter { 438 | if c == ':' || !is_name_char(c) { 439 | return_split!(input, i, NcName, validate_str!, facets); 440 | } 441 | } 442 | 443 | Some(("", NcName(input))) 444 | } 445 | } 446 | 447 | #[derive(Debug, PartialEq, Default)] 448 | pub struct Boolean<'input>(bool, PhantomData<&'input ()>); 449 | impl<'input> ParseXmlStr<'input> for Boolean<'input> { 450 | const NODE_NAME: &'static str = "Boolean"; 451 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, _parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Boolean<'input>)> { 452 | if input.len() >= 1 { 453 | match &input[0..1] { 454 | "0" => return Some((&input[1..], Boolean(false, PhantomData::default()))), 455 | "1" => return Some((&input[1..], Boolean(true, PhantomData::default()))), 456 | _ => (), 457 | } 458 | } 459 | if input.len() >= 4 && &input[0..4] == "true" { 460 | return Some((&input[4..], Boolean(true, PhantomData::default()))) 461 | } 462 | if input.len() >= 5 && &input[0..4] == "false" { 463 | return Some((&input[5..], Boolean(false, PhantomData::default()))) 464 | } 465 | None 466 | } 467 | } 468 | -------------------------------------------------------------------------------- /xml-schema/src/processor.rs: -------------------------------------------------------------------------------- 1 | use std::fmt::Debug; 2 | use std::hash::Hash; 3 | use std::collections::{HashMap, HashSet}; 4 | 5 | use xmlparser::Token as XmlToken; 6 | use xmlparser::{TextUnescape, XmlSpace}; 7 | 8 | use parser::*; 9 | use names::*; 10 | use support::Facets; 11 | use primitives::{QName,NcName,AnyUri,NonNegativeInteger}; 12 | 13 | pub const SCHEMA_URI: &'static str = "http://www.w3.org/2001/XMLSchema"; 14 | 15 | fn parse_min_occurs(x: &Option) -> usize { 16 | match x { 17 | None => 1, 18 | Some(n) => n.0 as usize, 19 | } 20 | } 21 | fn parse_max_occurs(x: &Option) -> usize { 22 | match x { 23 | None => 1, 24 | Some(unions::UnionNonNegativeIntegerNmtoken::NonNegativeInteger(n)) => n.0 as usize, 25 | Some(unions::UnionNonNegativeIntegerNmtoken::Nmtoken(restrictions::Unbounded(_))) => usize::max_value(), 26 | } 27 | } 28 | 29 | fn vec_concat_opt(vector: &Vec, value: Option) -> Vec{ 30 | let mut vector2: Vec = vector.clone(); 31 | if let Some(v) = value { 32 | vector2.push(v); 33 | } 34 | vector2 35 | } 36 | 37 | #[derive(Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] 38 | #[must_use] 39 | pub struct Documentation<'input>(Vec<&'input str>); 40 | impl<'input> Documentation<'input> { 41 | pub fn new() -> Documentation<'input> { 42 | Documentation(Vec::new()) 43 | } 44 | pub fn extend(&mut self, v: &Documentation<'input>) { 45 | self.0.extend(v.0.iter()); 46 | } 47 | } 48 | 49 | impl<'input> ToString for Documentation<'input> { 50 | fn to_string(&self) -> String { 51 | self.0.iter().map(|doc| TextUnescape::unescape(doc, XmlSpace::Default)).collect::>().join("\n") 52 | } 53 | } 54 | 55 | #[derive(Debug, Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)] 56 | pub enum AttrUse { 57 | Prohibited, 58 | Required, 59 | Optional, 60 | } 61 | 62 | #[derive(Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] 63 | pub struct Attrs<'input> { 64 | pub named: Vec<(FullName<'input>, AttrUse, Option>)>, 65 | pub refs: Vec<(Option>, AttrUse, FullName<'input>)>, 66 | pub group_refs: Vec>, 67 | pub any_attributes: bool, 68 | } 69 | impl<'input> Attrs<'input> { 70 | pub fn new() -> Attrs<'input> { 71 | Attrs { named: Vec::new(), refs: Vec::new(), group_refs: Vec::new(), any_attributes: false } 72 | } 73 | fn extend(&mut self, other: Attrs<'input>) { 74 | let Attrs { named, refs, group_refs, any_attributes } = other; 75 | self.named.extend(named); 76 | self.refs.extend(refs); 77 | self.group_refs.extend(group_refs); 78 | self.any_attributes |= any_attributes; 79 | } 80 | } 81 | 82 | #[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord)] 83 | pub struct RichType<'input, T: Debug + Hash + PartialEq + Eq + PartialOrd + Ord> { 84 | pub name_hint: NameHint<'input>, 85 | pub attrs: Attrs<'input>, 86 | pub type_: T, 87 | pub doc: Documentation<'input>, 88 | } 89 | impl<'input, T: Debug + Hash + PartialEq + Eq + PartialOrd + Ord> RichType<'input, T> { 90 | pub fn new(name_hint: NameHint<'input>, type_: T, doc: Documentation<'input>) -> RichType<'input, T> { 91 | RichType { name_hint, attrs: Attrs::new(), type_, doc } 92 | } 93 | } 94 | impl<'input> RichType<'input, Type<'input>> { 95 | fn add_attrs(mut self, new_attrs: Attrs<'input>) -> RichType<'input, Type<'input>> { 96 | self.attrs.extend(new_attrs); 97 | self 98 | } 99 | } 100 | 101 | impl<'input> RichType<'input, SimpleType<'input>> { 102 | pub fn into_complex(self) -> RichType<'input, Type<'input>> { 103 | let RichType { name_hint, attrs, type_, doc } = self; 104 | RichType { name_hint, attrs, type_: Type::Simple(type_), doc } 105 | } 106 | } 107 | 108 | #[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord)] 109 | pub enum Type<'input> { 110 | Any, 111 | Empty, 112 | Alias(FullName<'input>), 113 | Extension(FullName<'input>, Box>>), 114 | Restriction(FullName<'input>, Box>>), 115 | ElementRef(usize, usize, FullName<'input>), 116 | Element(usize, usize, String), 117 | Group(usize, usize, FullName<'input>), 118 | Choice(usize, usize, String), 119 | InlineChoice(Vec>>), 120 | Sequence(usize, usize, String), 121 | InlineSequence(Vec>>), 122 | Simple(SimpleType<'input>), 123 | } 124 | 125 | #[derive(Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)] 126 | pub enum SimpleType<'input> { 127 | Primitive(&'static str, &'static str), 128 | Alias(FullName<'input>), 129 | Restriction(FullName<'input>, Facets<'input>), 130 | List(String), 131 | Union(String), 132 | Empty, 133 | } 134 | 135 | #[derive(Debug)] 136 | pub struct Processor<'ast, 'input: 'ast> { 137 | pub target_namespace: Option<&'input str>, 138 | pub element_form_default_qualified: bool, 139 | pub attribute_form_default_qualified: bool, 140 | pub elements: HashMap, RichType<'input, Type<'input>>>, 141 | pub types: HashMap, RichType<'input, Type<'input>>>, 142 | pub simple_types: HashMap, (RichType<'input, SimpleType<'input>>, Documentation<'input>)>, 143 | pub choices: HashMap>>, HashSet>, 144 | pub sequences: HashMap>>, (HashSet, Documentation<'input>)>, 145 | pub groups: HashMap, RichType<'input, Type<'input>>>, 146 | pub attribute_groups: HashMap, Attrs<'input>>, 147 | pub inline_elements: HashMap<(Option<&'input str>, &'input str, Attrs<'input>, Type<'input>), (HashSet, Documentation<'input>)>, 148 | 149 | pub lists: HashMap>, HashSet>, 150 | pub unions: HashMap>>, HashSet>, 151 | pub simple_restrictions: HashSet<(FullName<'input>, Facets<'input>)>, 152 | pub substitution_groups: HashMap, Vec>>, 153 | _phantom: PhantomData<&'ast ()>, // Sometimes I need 'ast when prototyping 154 | } 155 | 156 | impl<'ast, 'input: 'ast> Processor<'ast, 'input> { 157 | pub fn new(ast: &'ast xs::Schema<'input>) -> Processor<'ast, 'input> { 158 | let target_namespace = ast.attr_target_namespace.as_ref().map(|t| t.0); 159 | let element_form_default_qualified = match ast.attr_element_form_default.as_ref().map(|x| ((x.0).0).0) { 160 | Some("qualified") => true, 161 | Some("unqualified") | None => false, 162 | _ => unreachable!(), 163 | }; 164 | let attribute_form_default_qualified = match ast.attr_attribute_form_default.as_ref().map(|x| ((x.0).0).0) { 165 | Some("qualified") => true, 166 | Some("unqualified") | None => false, 167 | _ => unreachable!(), 168 | }; 169 | Processor { 170 | target_namespace, 171 | element_form_default_qualified, 172 | attribute_form_default_qualified, 173 | elements: HashMap::new(), 174 | types: HashMap::new(), 175 | groups: HashMap::new(), 176 | choices: HashMap::new(), 177 | lists: HashMap::new(), 178 | unions: HashMap::new(), 179 | sequences: HashMap::new(), 180 | attribute_groups: HashMap::new(), 181 | inline_elements: HashMap::new(), 182 | simple_types: HashMap::new(), 183 | simple_restrictions: HashSet::new(), 184 | substitution_groups: HashMap::new(), 185 | _phantom: PhantomData::default(), 186 | } 187 | } 188 | 189 | pub fn process_ast(&mut self, ast: &'ast xs::Schema<'input>) { 190 | for top_level_item in ast.sequence_schema_top_annotation.iter() { 191 | match top_level_item.schema_top { 192 | xs::SchemaTop::Redefinable(ref r) => self.process_redefinable(r, false), 193 | xs::SchemaTop::Element(ref e) => { self.process_toplevel_element(e); }, 194 | xs::SchemaTop::Attribute(_) => unimplemented!("top-level attribute"), 195 | xs::SchemaTop::Notation(ref e) => self.process_notation(e), 196 | } 197 | } 198 | } 199 | 200 | fn process_notation(&mut self, notation: &'ast xs::Notation<'input>) { 201 | // TODO 202 | } 203 | 204 | fn process_redefinable(&mut self, r: &'ast xs::Redefinable<'input>, inlinable: bool) { 205 | match r { 206 | xs::Redefinable::SimpleType(ref e) => { self.process_simple_type(e); }, 207 | xs::Redefinable::ComplexType(e) => { self.process_complex_type(e, inlinable); }, 208 | xs::Redefinable::Group(e) => { self.process_named_group(e); }, 209 | xs::Redefinable::AttributeGroup(e) => self.process_attribute_group(e), 210 | } 211 | } 212 | 213 | fn process_annotation(&self, annotation: &Vec<&'ast xs::Annotation<'input>>) -> Documentation<'input> { 214 | let strings = annotation.iter().flat_map(|xs::Annotation { ref attrs, ref attr_id, ref annotation_content }| { 215 | annotation_content.iter().filter_map(|c| { 216 | match c { 217 | enums::AnnotationContent::Appinfo(_) => None, 218 | enums::AnnotationContent::Documentation(e) => { 219 | let xs::Documentation { ref attrs, ref attr_source, ref sequence_any } = **e; 220 | Some(sequence_any.iter().flat_map(|sequences::SequenceAny { any }| { 221 | any.0.iter().filter_map(|tok| { 222 | match tok { 223 | XmlToken::Text(s) => Some(s.to_str()), 224 | _ => None, 225 | } 226 | }) 227 | })) 228 | }, 229 | } 230 | }) 231 | }).flat_map(|v| v).collect(); 232 | Documentation(strings) 233 | } 234 | 235 | fn process_group_ref(&mut self, 236 | group_ref: &'ast inline_elements::GroupRef<'input>, 237 | ) -> RichType<'input, Type<'input>> { 238 | let inline_elements::GroupRef { ref attrs, ref attr_id, ref attr_ref, ref attr_min_occurs, ref attr_max_occurs, ref annotation } = group_ref; 239 | let ref_ = attr_ref; 240 | let min_occurs = parse_min_occurs(attr_min_occurs); 241 | let max_occurs = parse_max_occurs(attr_max_occurs); 242 | 243 | let ref_ = FullName::from_qname(ref_, self.target_namespace); 244 | RichType::new( 245 | NameHint::new(ref_.local_name()), 246 | Type::Group(min_occurs, max_occurs, ref_), 247 | self.process_annotation(&annotation.iter().collect()), 248 | ) 249 | } 250 | 251 | fn process_named_group(&mut self, 252 | group: &'ast xs::Group<'input>, 253 | ) -> RichType<'input, Type<'input>> { 254 | let xs::Group { ref attrs, ref attr_id, ref attr_name, ref annotation, choice_all_choice_sequence: ref content } = group; 255 | let name = attr_name; 256 | let max_occurs = 1; 257 | let min_occurs = 1; 258 | 259 | let mut type_ = match content { 260 | enums::ChoiceAllChoiceSequence::All(_) => unimplemented!("all"), 261 | enums::ChoiceAllChoiceSequence::Choice(e) => self.process_choice(e, true), 262 | enums::ChoiceAllChoiceSequence::Sequence(e) => self.process_sequence(e, true), 263 | }; 264 | 265 | type_.doc.extend(&self.process_annotation(&annotation.iter().collect())); 266 | let doc = type_.doc.clone(); 267 | 268 | let name = FullName::new(self.target_namespace, name.0); 269 | self.groups.insert(name, type_); 270 | RichType::new( 271 | NameHint::from_fullname(&name), 272 | Type::Group(min_occurs, max_occurs, name), 273 | doc, 274 | ) 275 | } 276 | 277 | fn process_attribute_group(&mut self, group: &'ast xs::AttributeGroup<'input>) { 278 | let name = &group.attr_name; 279 | let attrs = self.process_attr_decls(&group.attr_decls); 280 | let name = FullName::new(self.target_namespace, name.0); 281 | self.attribute_groups.insert(name, attrs); 282 | } 283 | 284 | fn process_local_simple_type(&mut self, 285 | simple_type: &'ast inline_elements::LocalSimpleType<'input>, 286 | ) -> RichType<'input, SimpleType<'input>> { 287 | let inline_elements::LocalSimpleType { ref attrs, ref attr_id, ref annotation, ref simple_derivation } = simple_type; 288 | //let struct_name = self.namespaces.new_type(QName::from(name)); 289 | let annotation: Vec<_> = annotation.iter().collect(); 290 | match simple_derivation { 291 | xs::SimpleDerivation::Restriction(e) => self.process_simple_restriction(e, annotation.clone()), 292 | xs::SimpleDerivation::List(ref e) => self.process_list(e, annotation.clone()), 293 | xs::SimpleDerivation::Union(ref e) => self.process_union(e, annotation.clone()), 294 | } 295 | } 296 | 297 | fn process_simple_type(&mut self, 298 | simple_type: &'ast xs::SimpleType<'input>, 299 | ) -> RichType<'input, SimpleType<'input>> { 300 | let xs::SimpleType { ref attrs, ref attr_id, ref attr_name, ref attr_final, ref annotation, ref simple_derivation } = simple_type; 301 | let annotation: Vec<_> = annotation.iter().collect(); 302 | let name = attr_name; 303 | let name = FullName::new(self.target_namespace, name.0); 304 | //let struct_name = self.namespaces.new_type(QName::from(name)); 305 | let ty = match simple_derivation { 306 | xs::SimpleDerivation::Restriction(e) => 307 | self.process_simple_restriction(e, annotation.clone()), 308 | xs::SimpleDerivation::List(ref e) => self.process_list(e, annotation.clone()), 309 | xs::SimpleDerivation::Union(ref e) => self.process_union(e, annotation.clone()), 310 | }; 311 | 312 | let doc = self.process_annotation(&annotation); 313 | self.simple_types.insert(name, (ty, doc.clone())); 314 | RichType::new( 315 | NameHint::from_fullname(&name), 316 | SimpleType::Alias(name), 317 | doc, 318 | ) 319 | } 320 | 321 | fn process_list(&mut self, 322 | list: &'ast xs::List<'input>, 323 | annotation: Vec<&'ast xs::Annotation<'input>>, 324 | ) -> RichType<'input, SimpleType<'input>> { 325 | let item_type = list.attr_item_type; 326 | let item_type = item_type.as_ref().map(|n| FullName::from_qname(n, self.target_namespace)); 327 | 328 | let item_type = match (item_type, &list.local_simple_type) { 329 | (None, Some(st)) => { 330 | let mut ty = self.process_local_simple_type(st); 331 | ty.doc.extend(&self.process_annotation(&annotation)); 332 | ty 333 | }, 334 | (Some(n), None) => { 335 | RichType::new( 336 | NameHint::new(n.local_name()), 337 | SimpleType::Alias(n), 338 | self.process_annotation(&annotation), 339 | ) 340 | }, 341 | (None, None) => panic!(" with no itemType or child type."), 342 | (Some(ref t1), Some(ref t2)) => panic!(" has both an itemType attribute ({:?}) and a child type ({:?}).", t1, t2), 343 | }; 344 | 345 | let mut name_hint = item_type.name_hint.clone(); 346 | name_hint.push("list"); 347 | let doc = self.process_annotation(&annotation); 348 | let name = name_from_hint(&name_hint).unwrap(); 349 | self.lists.entry(item_type) 350 | .or_insert(HashSet::new()) 351 | .insert(name.clone()); 352 | RichType::new( 353 | name_hint, 354 | SimpleType::List(name), 355 | doc, 356 | ) 357 | } 358 | 359 | fn process_union(&mut self, 360 | union: &'ast xs::Union<'input>, 361 | annotation: Vec<&'ast xs::Annotation<'input>>, 362 | ) -> RichType<'input, SimpleType<'input>> { 363 | let default_vec = Vec::new(); 364 | let mut name_hint = NameHint::new("union"); 365 | let member_types = union.attr_member_types.as_ref().map(|l| &l.0).unwrap_or(&default_vec); 366 | let mut member_types: Vec<_> = member_types.iter().map(|name| { 367 | let name = FullName::from_qname(name, self.target_namespace); 368 | name_hint.push(name.local_name()); 369 | RichType::new( 370 | NameHint::new(name.local_name()), 371 | SimpleType::Alias(name), 372 | self.process_annotation(&annotation), 373 | ) 374 | }).collect(); 375 | 376 | for t in union.local_simple_type.iter() { 377 | let ty = self.process_local_simple_type(t); 378 | name_hint.extend(&ty.name_hint); 379 | member_types.push(ty) 380 | } 381 | 382 | let doc = self.process_annotation(&annotation); 383 | let name = name_from_hint(&name_hint).unwrap(); 384 | self.unions.entry(member_types) 385 | .or_insert(HashSet::new()) 386 | .insert(name.clone()); 387 | RichType::new( 388 | name_hint, 389 | SimpleType::Union(name), 390 | doc, 391 | ) 392 | } 393 | 394 | fn process_complex_type(&mut self, 395 | complex_type: &'ast xs::ComplexType<'input>, 396 | inlinable: bool, 397 | ) -> RichType<'input, Type<'input>> { 398 | let xs::ComplexType { ref attrs, ref attr_id, ref attr_name, ref attr_mixed, ref attr_abstract, ref attr_final, ref attr_block, ref attr_default_attributes_apply, ref annotation, ref complex_type_model } = complex_type; 399 | let name = attr_name; 400 | //let struct_name = self.namespaces.new_type(QName::from(name)); 401 | let mut ty = match complex_type_model { 402 | xs::ComplexTypeModel::SimpleContent(_) => unimplemented!("simpleContent"), 403 | xs::ComplexTypeModel::ComplexContent(ref model) => 404 | self.process_complex_content(model, false), 405 | xs::ComplexTypeModel::CompleteContentModel { ref open_content, ref type_def_particle, ref attr_decls, ref assertions } => 406 | self.process_complete_content_model(open_content, type_def_particle, attr_decls, assertions, inlinable), 407 | }; 408 | ty.doc.extend(&self.process_annotation(&annotation.iter().collect())); 409 | 410 | let doc = ty.doc.clone(); 411 | let name = FullName::new(self.target_namespace, name.0); 412 | self.types.insert(name, ty); 413 | RichType::new( 414 | NameHint::from_fullname(&name), 415 | Type::Alias(name), 416 | doc, 417 | ) 418 | } 419 | 420 | fn process_local_complex_type(&mut self, 421 | complex_type: &'ast inline_elements::LocalComplexType<'input>, 422 | attr_name: Option<&'ast NcName<'input>>, 423 | annotation: Vec<&'ast xs::Annotation<'input>>, 424 | inlinable: bool, 425 | ) -> RichType<'input, Type<'input>> { 426 | let inline_elements::LocalComplexType { ref attrs, ref attr_id, ref attr_mixed, ref attr_default_attributes_apply, annotation: ref annotation2, ref complex_type_model } = complex_type; 427 | let name = attr_name; 428 | //let struct_name = self.namespaces.new_type(QName::from(name)); 429 | let mut ty = match complex_type_model { 430 | xs::ComplexTypeModel::SimpleContent(_) => unimplemented!("simpleContent"), 431 | xs::ComplexTypeModel::ComplexContent(ref model) => 432 | self.process_complex_content(model, false), 433 | xs::ComplexTypeModel::CompleteContentModel { ref open_content, ref type_def_particle, ref attr_decls, ref assertions } => 434 | self.process_complete_content_model(open_content, type_def_particle, attr_decls, assertions, inlinable), 435 | }; 436 | ty.doc.extend(&self.process_annotation(&vec_concat_opt(&annotation, annotation2.as_ref()))); 437 | 438 | if let Some(name) = name { 439 | let doc = ty.doc.clone(); 440 | let name = FullName::new(self.target_namespace, name.0); 441 | self.types.insert(name, ty); 442 | RichType::new( 443 | NameHint::from_fullname(&name), 444 | Type::Alias(name), 445 | doc, 446 | ) 447 | } 448 | else { 449 | ty 450 | } 451 | } 452 | 453 | fn process_complete_content_model(&mut self, 454 | open_content: &'ast Option>>, 455 | type_def_particle: &'ast Option>>, 456 | attr_decls: &'ast xs::AttrDecls<'input>, 457 | assertions: &'ast xs::Assertions<'input>, 458 | inlinable: bool, 459 | ) -> RichType<'input, Type<'input>> { 460 | let ty = match type_def_particle.as_ref() { 461 | Some(type_def_particle) => self.process_type_def_particle(type_def_particle, inlinable), 462 | None => RichType::new( 463 | NameHint::new("empty_particle"), 464 | Type::Empty, 465 | Documentation::new() 466 | ), 467 | }; 468 | ty.add_attrs(self.process_attr_decls(attr_decls)) 469 | } 470 | 471 | fn process_complex_content(&mut self, model: &'ast xs::ComplexContent<'input>, inlinable: bool) -> RichType<'input, Type<'input>> { 472 | let xs::ComplexContent { ref attrs, ref attr_id, ref attr_mixed, ref annotation, ref choice_restriction_extension } = model; 473 | let annotation = annotation.iter().collect(); 474 | match choice_restriction_extension { 475 | enums::ChoiceRestrictionExtension::Restriction(ref r) => { 476 | let inline_elements::ComplexRestrictionType { 477 | ref attrs, ref attr_id, ref attr_base, annotation: ref annotation2, 478 | ref sequence_open_content_type_def_particle, 479 | ref attr_decls, ref assertions 480 | } = **r; 481 | let ty = match sequence_open_content_type_def_particle { 482 | Some(sequences::SequenceOpenContentTypeDefParticle { open_content, type_def_particle }) => 483 | self.process_complex_restriction(attr_base, type_def_particle, vec_concat_opt(&annotation, annotation2.as_ref())), 484 | None => { 485 | RichType::new( 486 | NameHint::new("empty_extension"), 487 | Type::Empty, 488 | self.process_annotation(&vec_concat_opt(&annotation, annotation2.as_ref())), 489 | ) 490 | }, 491 | }; 492 | ty.add_attrs(self.process_attr_decls(attr_decls)) 493 | }, 494 | enums::ChoiceRestrictionExtension::Extension(ref e) => { 495 | let inline_elements::ExtensionType { 496 | ref attrs, ref attr_base, ref attr_id, annotation: ref annotation2, ref open_content, 497 | ref type_def_particle, ref attr_decls, ref assertions 498 | } = **e; 499 | let ty = match type_def_particle { 500 | Some(type_def_particle) => 501 | self.process_extension(attrs, attr_base, type_def_particle, vec_concat_opt(&annotation, annotation2.as_ref()), inlinable), 502 | None => self.process_trivial_extension(attrs, attr_base, vec_concat_opt(&annotation, annotation2.as_ref())), 503 | }; 504 | ty.add_attrs(self.process_attr_decls(attr_decls)) 505 | }, 506 | } 507 | } 508 | 509 | fn process_complex_restriction(&mut self, 510 | attr_base: &'ast QName<'input>, 511 | type_def_particle: &'ast xs::TypeDefParticle<'input>, 512 | annotation: Vec<&'ast xs::Annotation<'input>>, 513 | ) -> RichType<'input, Type<'input>> { 514 | // TODO: use the base 515 | let ty = self.process_type_def_particle(type_def_particle, false); 516 | let base = FullName::from_qname(attr_base, self.target_namespace); 517 | RichType::new( 518 | NameHint::new_empty(), 519 | Type::Restriction(base, Box::new(ty)), 520 | self.process_annotation(&annotation), 521 | ) 522 | } 523 | 524 | fn process_facets(&mut self, facet_list: &Vec>) -> Facets<'input> { 525 | let mut facets = Facets::default(); 526 | use parser::xs::Facet::*; 527 | for facet_or_any in facet_list { 528 | match facet_or_any { 529 | enums::ChoiceFacetAny::Facet(e) => { 530 | match **e { 531 | FacetHead(_) => panic!("abstract element"), 532 | MinExclusive(ref e) => facets.min_exclusive = Some(e.attr_value.0.parse().expect("invalid minexclusive")), 533 | MinInclusive(ref e) => facets.min_inclusive = Some(e.attr_value.0.parse().expect("invalid mininclusive")), 534 | MaxExclusive(ref e) => facets.max_exclusive = Some(e.attr_value.0.parse().expect("invalid maxexclusive")), 535 | MaxInclusive(ref e) => facets.max_inclusive = Some(e.attr_value.0.parse().expect("invalid maxinclusive")), 536 | TotalDigits(ref e) => facets.total_digits = Some(e.attr_value.0), 537 | FractionDigits(ref e) => facets.fraction_digits = Some(e.attr_value.0), 538 | Length(ref e) => facets.length = Some(e.attr_value.0 as usize), 539 | MinLength(ref e) => facets.min_length = Some(e.attr_value.0 as usize), 540 | MaxLength(ref e) => facets.max_length = Some(e.attr_value.0 as usize), 541 | Enumeration(ref e) => facets.enumeration.get_or_insert(Vec::new()).push(e.attr_value.0), 542 | WhiteSpace(ref e) => facets.white_space = Some(((e.attr_value.0).0).0), 543 | Pattern(ref e) => facets.pattern = Some(e.attr_value.0), 544 | Assertion(ref e) => unimplemented!("assertion facet"), 545 | ExplicitTimezone(ref e) => facets.explicit_timezone = Some(((e.attr_value.0).0).0), 546 | }; 547 | }, 548 | enums::ChoiceFacetAny::Any(_) => (), // TODO (probably just whitespaces) 549 | } 550 | } 551 | facets 552 | } 553 | 554 | fn process_simple_restriction(&mut self, 555 | restriction: &'ast xs::Restriction<'input>, 556 | annotation: Vec<&'ast xs::Annotation<'input>>, 557 | ) -> RichType<'input, SimpleType<'input>> { 558 | let xs::Restriction { ref attrs, ref attr_id, ref attr_base, annotation: ref annotation2, ref simple_restriction_model } = restriction; 559 | let base = attr_base; 560 | let base = base.unwrap_or(QName { namespace: Some(SCHEMA_URI), local_name: "anySimpleType" }); 561 | let xs::SimpleRestrictionModel { ref local_simple_type, ref choice_facet_any } = simple_restriction_model; 562 | let facets = self.process_facets(choice_facet_any); 563 | 564 | let base = FullName::from_qname(&base, self.target_namespace); 565 | 566 | self.simple_restrictions.insert((base, facets.clone())); 567 | 568 | match local_simple_type { 569 | Some(inline_elements::LocalSimpleType { ref attrs, ref attr_id, annotation: ref annotation2, ref simple_derivation }) => { 570 | RichType::new( 571 | NameHint::new(base.local_name()), 572 | SimpleType::Restriction(base, facets), 573 | self.process_annotation(&vec_concat_opt(&annotation, annotation2.as_ref())), 574 | ) 575 | }, 576 | None => { 577 | RichType::new( 578 | NameHint::new(base.local_name()), 579 | SimpleType::Restriction(base, facets), 580 | self.process_annotation(&annotation), 581 | ) 582 | }, 583 | } 584 | } 585 | 586 | fn process_type_def_particle(&mut self, particle: &'ast xs::TypeDefParticle<'input>, inlinable: bool) -> RichType<'input, Type<'input>> { 587 | match particle { 588 | xs::TypeDefParticle::Group(e) => self.process_group_ref(e), 589 | xs::TypeDefParticle::All(_) => unimplemented!("all"), 590 | xs::TypeDefParticle::Choice(e) => self.process_choice(e, inlinable), 591 | xs::TypeDefParticle::Sequence(e) => self.process_sequence(e, inlinable), 592 | } 593 | } 594 | 595 | fn process_nested_particle(&mut self, 596 | particle: &'ast xs::NestedParticle<'input>, 597 | annotation: Vec<&'ast xs::Annotation<'input>>, 598 | inlinable: bool 599 | ) -> RichType<'input, Type<'input>> { 600 | let mut ty = match particle { 601 | xs::NestedParticle::Element(e) => self.process_local_element(e), 602 | xs::NestedParticle::Group(e) => self.process_group_ref(e), 603 | xs::NestedParticle::Choice(e) => self.process_choice(e, inlinable), 604 | xs::NestedParticle::Sequence(e) => self.process_sequence(e, inlinable), 605 | xs::NestedParticle::Any(e) => self.process_any(e, Vec::new()), 606 | }; 607 | 608 | ty.doc.extend(&self.process_annotation(&annotation)); 609 | ty 610 | } 611 | 612 | fn process_any(&mut self, 613 | any: &'ast xs::Any<'input>, 614 | annotation: Vec<&'ast xs::Annotation<'input>>, 615 | ) -> RichType<'input, Type<'input>> { 616 | RichType::new( 617 | NameHint::new("any"), 618 | Type::Any, 619 | self.process_annotation(&annotation), 620 | ) 621 | } 622 | 623 | fn process_sequence(&mut self, 624 | seq: &'ast xs::Sequence<'input>, 625 | inlinable: bool, 626 | ) -> RichType<'input, Type<'input>> { 627 | let xs::Sequence { ref attrs, ref attr_id, ref attr_min_occurs, ref attr_max_occurs, ref annotation, ref nested_particle } = seq; 628 | let particles = nested_particle; 629 | let min_occurs = parse_min_occurs(attr_min_occurs); 630 | let max_occurs = parse_max_occurs(attr_max_occurs); 631 | let mut items = Vec::new(); 632 | let mut name_hint = NameHint::new("sequence"); 633 | if min_occurs == 1 && max_occurs == 1 && inlinable && particles.len() == 1 { 634 | self.process_nested_particle(particles.get(0).unwrap(), annotation.iter().collect(), inlinable) 635 | } 636 | else { 637 | for particle in particles.iter() { 638 | let ty = self.process_nested_particle(particle, vec![], false); 639 | name_hint.extend(&ty.name_hint); 640 | items.push(ty); 641 | } 642 | let doc = self.process_annotation(&annotation.iter().collect()); 643 | if min_occurs == 1 && max_occurs == 1 { 644 | RichType::new( 645 | name_hint, 646 | Type::InlineSequence(items), 647 | doc, 648 | ) 649 | } 650 | else { 651 | let name = name_from_hint(&name_hint).unwrap(); 652 | let (names, docs) = self.sequences.entry(items) 653 | .or_insert((HashSet::new(), Documentation::new())); 654 | names.insert(name.clone()); 655 | docs.extend(&doc); 656 | RichType::new( 657 | name_hint, 658 | Type::Sequence(min_occurs, max_occurs, name), 659 | doc, 660 | ) 661 | } 662 | } 663 | } 664 | 665 | fn process_choice(&mut self, 666 | choice: &'ast xs::Choice<'input>, 667 | inlinable: bool 668 | ) -> RichType<'input, Type<'input>> { 669 | let xs::Choice { ref attrs, ref attr_id, ref attr_min_occurs, ref attr_max_occurs, ref annotation, ref nested_particle } = choice; 670 | let particles = nested_particle; 671 | let min_occurs = parse_min_occurs(attr_min_occurs); 672 | let max_occurs = parse_max_occurs(attr_max_occurs); 673 | let mut items = Vec::new(); 674 | let mut name_hint = NameHint::new("choice"); 675 | if particles.len() == 1 { 676 | let particle = particles.get(0).unwrap(); 677 | let RichType { name_hint, attrs, type_, doc } = 678 | self.process_nested_particle(particle, annotation.iter().collect(), inlinable); 679 | match (min_occurs, max_occurs, type_) { 680 | (_, _, Type::Element(1, 1, e)) => return RichType { 681 | name_hint, attrs, type_: Type::Element(min_occurs, max_occurs, e), doc }, 682 | (_, _, Type::Group(1, 1, e)) => return RichType { 683 | name_hint, attrs, type_: Type::Group(min_occurs, max_occurs, e), doc }, 684 | (_, _, Type::Choice(1, 1, e)) => return RichType { 685 | name_hint, attrs, type_: Type::Choice(min_occurs, max_occurs, e), doc }, 686 | (_, _, Type::Sequence(1, 1, e)) => return RichType { 687 | name_hint, attrs, type_: Type::Sequence(min_occurs, max_occurs, e), doc }, 688 | (1, 1, type_) => return RichType { name_hint, attrs, type_, doc }, 689 | (_, _, type_) => { 690 | let name = name_from_hint(&name_hint).unwrap(); 691 | let items = vec![RichType { name_hint: name_hint.clone(), attrs: Attrs::new(), type_, doc: doc.clone() }]; 692 | let (names, docs) = self.sequences.entry(items) 693 | .or_insert((HashSet::new(), Documentation::new())); 694 | names.insert(name.clone()); 695 | docs.extend(&doc); 696 | let type_ = Type::Sequence(min_occurs, max_occurs, name); 697 | return RichType { name_hint, attrs, type_, doc } 698 | }, 699 | } 700 | } 701 | else { 702 | for particle in particles.iter() { 703 | let ty = self.process_nested_particle(particle, vec![], false); 704 | name_hint.extend(&ty.name_hint); 705 | items.push(ty); 706 | } 707 | } 708 | let doc = self.process_annotation(&annotation.iter().collect()); 709 | match (min_occurs, max_occurs, inlinable) { 710 | (1, 1, true) => { 711 | RichType::new( 712 | name_hint, 713 | Type::InlineChoice(items), 714 | doc, 715 | ) 716 | }, 717 | (_, _, _) => { 718 | let name = name_from_hint(&name_hint).unwrap(); 719 | self.choices.entry(items) 720 | .or_insert(HashSet::new()) 721 | .insert(name.clone()); 722 | RichType::new( 723 | name_hint, 724 | Type::Choice(min_occurs, max_occurs, name), 725 | doc, 726 | ) 727 | } 728 | } 729 | } 730 | 731 | fn process_trivial_extension(&mut self, 732 | attrs: &'ast HashMap, &'input str>, 733 | attr_base: &'ast QName<'input>, 734 | annotation: Vec<&'ast xs::Annotation<'input>>, 735 | ) -> RichType<'input, Type<'input>> { 736 | let base = FullName::from_qname(&attr_base, self.target_namespace); 737 | RichType::new( 738 | NameHint::new_empty(), 739 | Type::Alias(base), 740 | self.process_annotation(&annotation), 741 | ) 742 | } 743 | 744 | fn process_extension(&mut self, 745 | attrs: &'ast HashMap, &'input str>, 746 | attr_base: &'ast QName<'input>, 747 | type_def_particle: &'ast xs::TypeDefParticle<'input>, 748 | annotation: Vec<&'ast xs::Annotation<'input>>, 749 | inlinable: bool, 750 | ) -> RichType<'input, Type<'input>> { 751 | let base = FullName::from_qname(attr_base, self.target_namespace); 752 | RichType::new( 753 | NameHint::new_empty(), 754 | Type::Extension(base, Box::new(self.process_type_def_particle(type_def_particle, inlinable))), 755 | self.process_annotation(&annotation), 756 | ) 757 | } 758 | 759 | fn process_toplevel_element(&mut self, element: &'ast xs::Element<'input>) { 760 | let name = FullName::new(self.target_namespace, element.attr_name.0); 761 | let type_attr: Option> = element.attr_type; 762 | let substitution_group = &element.attr_substitution_group; 763 | let xs::Element { ref attrs, ref attr_id, ref attr_name, ref attr_type, ref attr_substitution_group, ref attr_default, ref attr_fixed, ref attr_nillable, ref attr_abstract, ref attr_final, ref attr_block, ref annotation, type_: ref child_type, ref alternative_alt_type, ref identity_constraint } = element; 764 | let annotation = annotation.iter().collect(); 765 | if let Some(heads) = attr_substitution_group { 766 | for head in &heads.0 { 767 | let head = FullName::from_qname(head, self.target_namespace); 768 | self.substitution_groups.entry(head) 769 | .or_insert(Vec::new()) 770 | .push(name.clone()); 771 | } 772 | } 773 | let type_ = match (type_attr, &child_type) { 774 | (None, Some(ref c)) => match c { 775 | enums::Type::SimpleType(ref e) => { 776 | let mut ty = self.process_local_simple_type(e); 777 | ty.doc.extend(&self.process_annotation(&annotation)); 778 | ty.into_complex() 779 | }, 780 | enums::Type::ComplexType(ref e) => { 781 | self.process_local_complex_type(e, Some(attr_name), annotation, false) 782 | }, 783 | }, 784 | (Some(t), None) => { 785 | let t = FullName::from_qname(&t, self.target_namespace); 786 | RichType::new( 787 | NameHint::new(t.local_name()), 788 | Type::Alias(t.into()), 789 | self.process_annotation(&annotation), 790 | ) 791 | }, 792 | (None, None) => { 793 | RichType::new( 794 | NameHint::new("empty"), 795 | Type::Empty, 796 | self.process_annotation(&annotation), 797 | ) 798 | }, 799 | (Some(ref t1), Some(ref t2)) => panic!("Toplevel element '{:?}' has both a type attribute ({:?}) and a child type ({:?}).", name, t1, t2), 800 | }; 801 | 802 | self.elements.insert(name, type_); 803 | } 804 | 805 | fn process_local_element(&mut self, 806 | element: &'ast inline_elements::LocalElement<'input>, 807 | ) -> RichType<'input, Type<'input>> { 808 | let inline_elements::LocalElement { ref attrs, ref attr_id, ref attr_name, ref attr_ref, ref attr_min_occurs, ref attr_max_occurs, ref attr_type, ref attr_default, ref attr_fixed, ref attr_nillable, ref attr_block, ref attr_form, ref attr_target_namespace, ref annotation, ref type_, ref alternative_alt_type, ref identity_constraint } = element; 809 | let annotation = annotation.iter().collect(); 810 | let name = attr_name; 811 | let type_attr = attr_type; 812 | let min_occurs = parse_min_occurs(attr_min_occurs); 813 | let max_occurs = parse_max_occurs(attr_max_occurs); 814 | 815 | if let Some(ref_) = attr_ref { 816 | if let Some(name) = name { 817 | panic!(" has both ref={:?} and name={:?}", ref_, name); 818 | } 819 | let ref_ = FullName::from_qname(ref_, self.target_namespace); 820 | RichType::new( 821 | NameHint::new(ref_.local_name()), 822 | Type::ElementRef(min_occurs, max_occurs, ref_), 823 | self.process_annotation(&annotation), 824 | ) 825 | } 826 | else { 827 | let name = name.as_ref().expect(" has no name.").0; 828 | 829 | // https://www.w3.org/TR/xmlschema11-1/#dcl.elt.local 830 | let qualified_form = match attr_form.as_ref().map(|x| ((x.0).0).0) { 831 | Some("qualified") => true, 832 | Some("unqualified") => false, 833 | None => self.element_form_default_qualified, 834 | _ => unreachable!(), 835 | }; 836 | let namespace = match (attr_target_namespace, qualified_form) { 837 | (Some(AnyUri(target_namespace)), _) => Some(*target_namespace), 838 | (None, true) => self.target_namespace, 839 | (None, false) => None, 840 | }; 841 | 842 | match (type_attr, &type_) { 843 | (None, Some(ref c)) => { 844 | let mut t = match c { 845 | enums::Type::SimpleType(ref e) => { 846 | let mut ty = self.process_local_simple_type(e); 847 | ty.doc.extend(&self.process_annotation(&annotation)); 848 | ty.into_complex() 849 | }, 850 | enums::Type::ComplexType(ref e) => { 851 | self.process_local_complex_type(e, None, annotation, false) 852 | }, 853 | }; 854 | let mut name_hint = NameHint::new(name); 855 | name_hint.extend(&t.name_hint); 856 | let struct_name = name_from_hint(&name_hint).unwrap(); 857 | let (elems, doc) = self.inline_elements.entry((namespace, name, t.attrs, t.type_)) 858 | .or_insert((HashSet::new(), Documentation::new())); 859 | elems.insert(struct_name.clone()); 860 | t.doc.extend(doc); 861 | RichType::new( 862 | NameHint::new(name), 863 | Type::Element(min_occurs, max_occurs, struct_name), 864 | t.doc, 865 | ) 866 | }, 867 | (Some(t), None) => { 868 | let name_hint1 = NameHint::new(t.local_name); 869 | let mut name_hint2 = NameHint::new(name); 870 | name_hint2.push(t.local_name); 871 | // TODO: move this heuristic in names.rs 872 | let name_hint = if t.local_name.to_lowercase().contains(&name.to_lowercase()) { 873 | name_hint1 874 | } 875 | else { 876 | name_hint2 877 | }; 878 | let struct_name = name_from_hint(&name_hint).unwrap(); 879 | let mut doc = self.process_annotation(&annotation); 880 | let t = FullName::from_qname(t, self.target_namespace); 881 | let (elems, doc2) = self.inline_elements.entry((namespace, name, Attrs::new(), Type::Alias(t))) 882 | .or_insert((HashSet::new(), Documentation::new())); 883 | elems.insert(struct_name.clone()); 884 | doc.extend(doc2); 885 | RichType::new( 886 | NameHint::new(name), 887 | Type::Element(min_occurs, max_occurs, struct_name), 888 | doc, 889 | ) 890 | }, 891 | (None, None) => { 892 | RichType::new( 893 | NameHint::new("empty"), 894 | Type::Empty, 895 | self.process_annotation(&annotation), 896 | ) 897 | }, 898 | (Some(ref t1), Some(ref t2)) => panic!("Element '{:?}' has both a type attribute ({:?}) and a child type ({:?}).", name, t1, t2), 899 | } 900 | } 901 | } 902 | 903 | fn process_attr_decls(&mut self, attr_decls: &'ast xs::AttrDecls<'input>) -> Attrs<'input> { 904 | let mut attrs = Attrs::new(); 905 | for attr_decl in &attr_decls.attribute { 906 | match attr_decl { 907 | enums::AttrOrAttrGroup::Attribute(e) => { 908 | let name = e.attr_name.as_ref().map(|ncn| FullName::new(self.target_namespace, ncn.0)); 909 | let mut type_attr: Option> = e.attr_type; 910 | let use_ = match e.attr_use.as_ref().map(|x| ((x.0).0).0) { 911 | Some("prohibited") => AttrUse::Prohibited, 912 | Some("required") => AttrUse::Required, 913 | Some("optional") => AttrUse::Optional, 914 | None => AttrUse::Optional, // TODO 915 | Some(s) => panic!("Unknown attribute value use={:?}", s), 916 | }; 917 | match (name, e.attr_ref, type_attr, &e.local_simple_type) { 918 | (Some(name), None, Some(t), None) => { 919 | let t = FullName::from_qname(&t, self.target_namespace); 920 | attrs.named.push((name, use_, Some(SimpleType::Alias(t)))); 921 | }, 922 | (Some(name), None, None, Some(t)) => { 923 | let t = self.process_local_simple_type(t); 924 | attrs.named.push((name, use_, Some(t.type_))); 925 | }, 926 | (Some(name), None, None, None) => 927 | attrs.named.push((name, use_, None)), 928 | (None, None, None, None) => 929 | panic!("no attribute on ."), 930 | (_, _, Some(ref t1), Some(ref t2)) => 931 | panic!(" has both a type attribute ({:?}) and a child type ({:?}).", t1, t2), 932 | (None, None, Some(_), None) | (None, None, None, Some(_)) => 933 | panic!(" has a type but no name."), 934 | (_, Some(_), Some(_), None) | (_, Some(_), None, Some(_)) => 935 | panic!(" has a type and a ref."), 936 | (_, Some(ref_), None, None) => (), // TODO 937 | } 938 | }, 939 | enums::AttrOrAttrGroup::AttributeGroup(e) => { 940 | attrs.group_refs.push(FullName::from_qname(&e.attr_ref, self.target_namespace)); 941 | }, 942 | } 943 | } 944 | if attr_decls.any_attribute.is_some() { 945 | attrs.any_attributes = true; 946 | } 947 | attrs 948 | } 949 | 950 | 951 | } 952 | -------------------------------------------------------------------------------- /xml-schema/src/support.rs: -------------------------------------------------------------------------------- 1 | use std::marker::PhantomData; 2 | use std::collections::HashMap; 3 | pub use std::str::FromStr; 4 | 5 | pub use xmlparser::{Token as XmlToken, Tokenizer, ElementEnd}; 6 | 7 | pub use primitives::*; // TODO: remove the pub? 8 | pub use names::FullName; 9 | 10 | pub use bigfloat::BigFloatNotNaN; 11 | 12 | #[derive(Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord, Default)] 13 | pub struct Facets<'input> { 14 | pub min_exclusive: Option, 15 | pub min_inclusive: Option, 16 | pub max_exclusive: Option, 17 | pub max_inclusive: Option, 18 | pub total_digits: Option, 19 | pub fraction_digits: Option, 20 | pub length: Option, 21 | pub min_length: Option, 22 | pub max_length: Option, 23 | pub enumeration: Option>, 24 | pub white_space: Option<&'input str>, 25 | pub pattern: Option<&'input str>, 26 | pub assertion: Option<&'input str>, 27 | pub explicit_timezone: Option<&'input str>, 28 | } 29 | 30 | #[derive(Debug,PartialEq)] 31 | pub struct List<'input, Item>(Vec, PhantomData<&'input ()>); 32 | 33 | pub type Stream<'input> = Box>; 34 | pub struct InnerStream<'input> { 35 | pub(crate) index: usize, 36 | passed_prelude: bool, 37 | tokens: Vec>, 38 | } 39 | 40 | impl<'input> InnerStream<'input> { 41 | pub fn new(tokenizer: Tokenizer<'input>) -> InnerStream<'input> { 42 | InnerStream { index: 0, passed_prelude: false, tokens: tokenizer.into_iter().map(|o| o.unwrap()).collect() } 43 | } 44 | 45 | #[inline] 46 | pub fn transaction(&self) -> Transaction { 47 | Transaction { initial_index: self.index } 48 | } 49 | } 50 | 51 | #[must_use] 52 | pub struct Transaction { 53 | initial_index: usize, 54 | } 55 | 56 | impl Transaction { 57 | #[inline] 58 | pub fn commit(self) { 59 | } 60 | 61 | #[inline] 62 | pub fn rollback(self, stream: &mut InnerStream) { 63 | //println!("// Rolling back {} tokens", stream.index - self.initial_index); 64 | stream.index = self.initial_index 65 | } 66 | } 67 | 68 | impl<'input> Iterator for InnerStream<'input> { 69 | type Item = XmlToken<'input>; 70 | fn next(&mut self) -> Option { 71 | if !self.passed_prelude { 72 | self.passed_prelude = true; 73 | loop { 74 | let tok = self.next().unwrap(); 75 | match tok { 76 | XmlToken::EntityDeclaration(_, _) | 77 | XmlToken::Declaration(_, _, _) | 78 | XmlToken::DtdStart(_, _) | 79 | XmlToken::Comment(_) => (), 80 | XmlToken::DtdEnd => break, 81 | _ => { 82 | return Some(tok); 83 | } 84 | } 85 | } 86 | } 87 | let tok = self.tokens.get(self.index); 88 | //println!("// Reading {:?}", tok); 89 | match tok { 90 | Some(res) => { 91 | self.index += 1; 92 | Some(res.clone()) 93 | } 94 | None => None 95 | } 96 | } 97 | } 98 | 99 | 100 | #[derive(Clone)] 101 | pub struct ParentContext<'input> { 102 | pub namespaces: HashMap<&'input str, &'input str>, 103 | } 104 | impl<'input> Default for ParentContext<'input> { 105 | fn default() -> ParentContext<'input> { 106 | let mut namespaces = HashMap::new(); 107 | namespaces.insert("xmlns", "xmlns"); 108 | namespaces.insert("xml", "xml"); 109 | ParentContext { namespaces } 110 | } 111 | } 112 | pub trait ParseContext<'input> { 113 | fn on_xmlns(&mut self, _name: Option<&'input str>, _uri: &'input str) { 114 | } 115 | } 116 | #[derive(Default)] 117 | pub struct DefaultParseContext<'input> { 118 | _phantom: PhantomData<&'input str>, 119 | } 120 | 121 | impl<'input> ParseContext<'input> for DefaultParseContext<'input> { 122 | } 123 | 124 | pub trait ParseXml<'input>: Sized { 125 | const NODE_NAME: &'static str; 126 | 127 | fn parse_self_xml>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>) -> Option; 128 | 129 | 130 | fn parse_empty>(_parse_context: &mut TParseContext, _parent_context: &ParentContext<'input>) -> Option { 131 | None 132 | } 133 | 134 | fn parse_xml>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>) -> Option { 135 | //println!("// Entering: {:?}", Self::NODE_NAME); 136 | let ret = Self::parse_self_xml(stream, parse_context, parent_context); 137 | /* 138 | match ret { 139 | Some(_) => println!("// Leaving: {:?} (succeeded)", Self::NODE_NAME), 140 | None => println!("// Leaving: {:?} (aborted)", Self::NODE_NAME), 141 | }*/ 142 | ret 143 | } 144 | } 145 | 146 | pub trait ParseXmlStr<'input>: Sized { 147 | const NODE_NAME: &'static str; 148 | 149 | fn parse_self_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Self)>; 150 | 151 | fn parse_xml_str<'a, TParseContext: ParseContext<'input>>(input: &'input str, parse_context: &mut TParseContext, parent_context: &ParentContext<'input>, facets: &Facets<'a>) -> Option<(&'input str, Self)> { 152 | //println!("// Entering: {:?}", Self::NODE_NAME); 153 | let ret = Self::parse_self_xml_str(input, parse_context, parent_context, facets); 154 | /* 155 | match ret { 156 | Some(_) => println!("// Leaving: {:?} (succeeded)", Self::NODE_NAME), 157 | None => println!("// Leaving: {:?} (aborted)", Self::NODE_NAME), 158 | }*/ 159 | ret 160 | } 161 | } 162 | 163 | impl<'input, T> ParseXml<'input> for T where T: ParseXmlStr<'input> { 164 | const NODE_NAME: &'static str = Self::NODE_NAME; 165 | fn parse_self_xml<'b, TParseContext: ParseContext<'input>>(stream: &mut Stream<'input>, parse_context: &mut TParseContext, parent_context: &'b ParentContext<'input>) -> Option { 166 | match stream.next() { 167 | Some(XmlToken::Text(strspan)) => { 168 | match Self::parse_self_xml_str(strspan.to_str(), parse_context, parent_context, &Facets::default()) { 169 | Some(("", out)) => Some(out), 170 | Some((unparsed, _)) => None, 171 | None => None, 172 | } 173 | } 174 | _ => None, 175 | } 176 | } 177 | } 178 | -------------------------------------------------------------------------------- /xml-schema/src/test_parser.rs: -------------------------------------------------------------------------------- 1 | use xmlparser; 2 | 3 | use parse_xsd; 4 | use parser::*; 5 | use support::*; 6 | 7 | const PERSON_XSD: &'static str = r#" 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | "#; 19 | 20 | #[test] 21 | fn generated_parses_person_xsd() { 22 | let (doc, _) = parse_xsd(PERSON_XSD); 23 | assert_ne!(doc, None); 24 | } 25 | -------------------------------------------------------------------------------- /xml-schema/src/test_parser_schema.rs: -------------------------------------------------------------------------------- 1 | use std::fs::File; 2 | use std::io::Read; 3 | use std::collections::HashMap; 4 | 5 | use xmlparser; 6 | 7 | use parse_xsd; 8 | use parser::xs; 9 | use parser_generator::ParserGenerator; 10 | use support::*; 11 | 12 | #[test] 13 | fn generated_parses_person_xsd() { 14 | let mut f = File::open("XMLSchema.xsd").unwrap(); 15 | let mut s = String::new(); 16 | f.read_to_string(&mut s).unwrap(); 17 | let (doc, _) = parse_xsd(&s); 18 | assert_ne!(doc, None); 19 | } 20 | 21 | #[test] 22 | fn round1_parser_person_xsd() { 23 | let mut f = File::open("XMLSchema.xsd").unwrap(); 24 | let mut s = String::new(); 25 | f.read_to_string(&mut s).unwrap(); 26 | let (doc, _) = parse_xsd(&s); 27 | assert_ne!(doc, None); 28 | //let mut parser_generator = ParserGenerator::new(doc.as_ref().unwrap(), HashMap::new()); 29 | //parser_generator.gen(doc.as_ref().unwrap()).to_string(); 30 | } 31 | 32 | -------------------------------------------------------------------------------- /xml-schema/src/xml_utils.rs: -------------------------------------------------------------------------------- 1 | /// https://www.w3.org/TR/xml11/#NT-Char 2 | #[inline(always)] 3 | pub fn is_xml_char(c: char) -> bool { 4 | match c as u32 { 5 | 0x0..=0xD7FF | 0xE000..=0xFFFD | 0x10000..=0x10FFFF => true, 6 | 0xFFFE | 0xFFFF => false, 7 | _ => unreachable!(), 8 | } 9 | } 10 | 11 | /// https://www.w3.org/TR/xml-names11/#NT-NCNameStartChar 12 | #[inline(always)] 13 | pub fn is_name_start_char(c: char) -> bool { 14 | match c { 15 | ':' | 'A'..='Z' | '_' | 'a'..='z' | '\u{C0}'..='\u{D6}' | '\u{F8}'..='\u{2FF}' | 16 | '\u{370}'..='\u{1FFF}' | '\u{200C}'..='\u{200D}' | '\u{2070}'..='\u{218F}' | 17 | '\u{2C00}'..='\u{2FEF}' | '\u{3001}'..='\u{D7FF}' | '\u{F900}'..='\u{FDCF}' | 18 | '\u{FDF0}'..='\u{FFFD}' | '\u{10000}'..='\u{EFFFF}' => true, 19 | _ => false, 20 | } 21 | } 22 | 23 | /// https://www.w3.org/TR/xml-names11/#NT-NCNameChar 24 | #[inline(always)] 25 | pub fn is_name_char(c: char) -> bool { 26 | match c { 27 | '-' | '.' | '0'..='9' | '\u{B7}' | '\u{0300}'..='\u{036F}' | 28 | '\u{203F}'..='\u{2040}' => true, 29 | _ => is_name_start_char(c), 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /xml-schema/tests/po.rs: -------------------------------------------------------------------------------- 1 | extern crate xml_schema; 2 | use xml_schema::parse_xsd; 3 | use xml_schema::parser::*; 4 | 5 | const PO_XSD: &'static str = r#" 6 | 7 | 8 | 9 | 10 | Purchase order schema for Example.com. 11 | Copyright 2000 Example.com. All rights reserved. 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | "#; 73 | 74 | #[test] 75 | fn parse_po_xsd() { 76 | let doc = parse_xsd(PO_XSD); 77 | } 78 | --------------------------------------------------------------------------------