├── COPYING
├── README.md
├── main-valid.cc
├── main.cc
├── make-valid.sh
├── make.sh
├── rules
├── cxx.txt
└── cxx2.txt
└── rules2code.py
/COPYING:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | Program fuzzer
2 | ==============
3 |
4 | Introduction
5 | ------------
6 |
7 | Very WIP/PoC code. Proceed with caution.
8 |
9 | Many thanks to lcamtuf, the AFL people, John Regehr and the C-Reduce people,
10 | and the GCC people.
11 |
12 |
13 | Usage
14 | -----
15 |
16 | 1. Download AFL to the current directory.
17 | 2. Build it.
18 | 4. Build your compiler using `afl-gcc`.
19 | 3. Change `$AFL_PATH` in `make.sh` if necessary.
20 | 5. Look for `execlp` in `main.cc` and point it to your instrumented compiler.
21 | 6. Run `make.sh`.
22 | 7. Run `./main`.
23 |
24 |
25 | License
26 | -------
27 |
28 | The project includes snippets from AFL (Apache 2.0) and gcc (GPL 3),
29 | therefore this project is naturally GPL 3 as well.
30 |
31 |
32 | Reported bugs
33 | -------------
34 |
35 | GCC:
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 | *
68 | *
69 | *
70 | *
71 | *
72 | *
73 | *
74 | *
75 | *
76 | *
77 | *
78 | *
79 | *
80 | *
81 | *
82 | *
83 | *
84 | *
85 | *
86 | *
87 | *
88 | *
89 | *
90 | *
91 | *
92 | *
93 |
94 | Clang:
95 |
96 | *
97 |
--------------------------------------------------------------------------------
/main-valid.cc:
--------------------------------------------------------------------------------
1 | // Copyright (C) 2018 Vegard Nossum
2 |
3 | #include
4 | #include
5 | #include
6 | #include
7 | #include
8 |
9 | #include
10 | #include
11 | #include
12 | #include
13 | #include
14 | #include
15 | #include
16 | #include
17 |
18 | #include
19 | #include
20 | #include
21 | #include
22 | #include
23 | #include
24 | #include
25 |
26 | // From AFL
27 | #include "config.h"
28 |
29 | // Parameters
30 |
31 | static const unsigned int pool_size = 250;
32 | static const unsigned int nr_initial_transformations = 250;
33 | static const unsigned int nr_transformations_multiplier = 25;
34 |
35 | // parameter to the geometric distribution we use to pick expressions to mutate
36 | static const double find_p = .25;
37 |
38 | // Types
39 |
40 | struct type;
41 | typedef std::shared_ptr type_ptr;
42 |
43 | struct expression;
44 | typedef std::shared_ptr expr_ptr;
45 | typedef std::vector expr_vec;
46 |
47 | struct function;
48 | typedef std::shared_ptr function_ptr;
49 |
50 | struct program;
51 | typedef std::shared_ptr program_ptr;
52 |
53 | struct visitor {
54 | unsigned int unreachable_counter;
55 |
56 | visitor():
57 | unreachable_counter(0)
58 | {
59 | }
60 |
61 | void enter_unreachable()
62 | {
63 | ++unreachable_counter;
64 | }
65 |
66 | void leave_unreachable()
67 | {
68 | --unreachable_counter;
69 | }
70 |
71 | bool is_unreachable()
72 | {
73 | return unreachable_counter > 0;
74 | }
75 |
76 | virtual void visit(type_ptr &) {}
77 | virtual void visit(function_ptr fn, expr_ptr &) {}
78 | virtual void visit(function_ptr fn, function_ptr &) {}
79 | };
80 |
81 | struct type {
82 | std::string name;
83 |
84 | type(std::string name):
85 | name(name)
86 | {
87 | }
88 |
89 | virtual ~type()
90 | {
91 | }
92 |
93 | void print(FILE *f)
94 | {
95 | fprintf(f, "%s", name.c_str());
96 | }
97 | };
98 |
99 | static type_ptr void_type = std::make_shared("void");
100 | static type_ptr voidp_type = std::make_shared("void *");
101 | static type_ptr int_type = std::make_shared("int");
102 |
103 | struct expression {
104 | unsigned int generation;
105 |
106 | expression(unsigned int generation):
107 | generation(generation)
108 | {
109 | }
110 |
111 | virtual ~expression()
112 | {
113 | }
114 |
115 | virtual expr_ptr clone(expr_ptr &this_ptr) = 0;
116 |
117 | virtual void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
118 | {
119 | v.visit(fn, this_ptr);
120 | }
121 |
122 | virtual void print(FILE *f, unsigned int indent) = 0;
123 | };
124 |
125 | // Helper to maintain reachability information when traversing AST
126 | struct unreachable_expression: expression {
127 | expr_ptr expr;
128 |
129 | unreachable_expression(unsigned int generation, expr_ptr expr):
130 | expression(generation),
131 | expr(expr)
132 | {
133 | }
134 |
135 | expr_ptr clone(expr_ptr &this_ptr)
136 | {
137 | return std::make_shared(generation, expr->clone(expr));
138 | }
139 |
140 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
141 | {
142 | v.enter_unreachable();
143 | v.visit(fn, this_ptr);
144 | expr->visit(fn, expr, v);
145 | v.leave_unreachable();
146 | }
147 |
148 | void print(FILE *f, unsigned int indent)
149 | {
150 | expr->print(f, indent);
151 | }
152 | };
153 |
154 | struct variable_expression: expression {
155 | // TODO: should we have a separate class variable as well?
156 | std::string name;
157 |
158 | variable_expression(unsigned int generation, std::string name):
159 | expression(generation),
160 | name(name)
161 | {
162 | }
163 |
164 | expr_ptr clone(expr_ptr &this_ptr)
165 | {
166 | return this_ptr;
167 | }
168 |
169 | void print(FILE *f, unsigned int indent)
170 | {
171 | fprintf(f, "%s", name.c_str());
172 | }
173 | };
174 |
175 | struct int_literal_expression: expression {
176 | int value;
177 |
178 | int_literal_expression(unsigned int generation, int value):
179 | expression(generation),
180 | value(value)
181 | {
182 | }
183 |
184 | expr_ptr clone(expr_ptr &this_ptr)
185 | {
186 | return this_ptr;
187 | }
188 |
189 | void print(FILE *f, unsigned int indent)
190 | {
191 | fprintf(f, "%d", value);
192 | }
193 | };
194 |
195 | struct cast_expression: expression {
196 | type_ptr type;
197 | expr_ptr expr;
198 |
199 | cast_expression(unsigned int generation, type_ptr type, expr_ptr expr):
200 | expression(generation),
201 | type(type),
202 | expr(expr)
203 | {
204 | }
205 |
206 | expr_ptr clone(expr_ptr &this_ptr)
207 | {
208 | return std::make_shared(generation, type, expr->clone(expr));
209 | }
210 |
211 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
212 | {
213 | v.visit(fn, this_ptr);
214 |
215 | expr->visit(fn, expr, v);
216 | }
217 |
218 | void print(FILE *f, unsigned int indent)
219 | {
220 | fprintf(f, "(");
221 | type->print(f);
222 | fprintf(f, ") (");
223 | expr->print(f, indent);
224 | fprintf(f, ")");
225 | }
226 | };
227 |
228 | struct call_expression: expression {
229 | expr_ptr fn_expr;
230 | std::vector arg_exprs;
231 |
232 | call_expression(unsigned int generation, expr_ptr fn_expr, std::initializer_list arg_exprs = {}):
233 | expression(generation),
234 | fn_expr(fn_expr),
235 | arg_exprs(arg_exprs)
236 | {
237 | }
238 |
239 | call_expression(unsigned int generation, expr_ptr fn_expr, std::vector arg_exprs):
240 | expression(generation),
241 | fn_expr(fn_expr),
242 | arg_exprs(arg_exprs)
243 | {
244 | }
245 |
246 | expr_ptr clone(expr_ptr &this_ptr)
247 | {
248 | std::vector new_arg_exprs;
249 | for (auto &arg_expr: arg_exprs)
250 | new_arg_exprs.push_back(arg_expr->clone(arg_expr));
251 |
252 | return std::make_shared(generation, fn_expr->clone(fn_expr), new_arg_exprs);
253 | }
254 |
255 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
256 | {
257 | v.visit(fn, this_ptr);
258 |
259 | fn_expr->visit(fn, fn_expr, v);
260 | for (auto &arg_expr: arg_exprs)
261 | arg_expr->visit(fn, arg_expr, v);
262 | }
263 |
264 | void print(FILE *f, unsigned int indent)
265 | {
266 | fn_expr->print(f, indent);
267 | fprintf(f, "(");
268 |
269 | for (unsigned int i = 0; i < arg_exprs.size(); ++i) {
270 | if (i > 0)
271 | fprintf(f, ", ");
272 |
273 | arg_exprs[i]->print(f, indent);
274 | }
275 |
276 | fprintf(f, ")");
277 | }
278 | };
279 |
280 | struct preop_expression: expression {
281 | std::string op;
282 | expr_ptr arg;
283 |
284 | preop_expression(unsigned int generation, std::string op, expr_ptr arg):
285 | expression(generation),
286 | op(op),
287 | arg(arg)
288 | {
289 | }
290 |
291 | expr_ptr clone(expr_ptr &this_ptr)
292 | {
293 | return std::make_shared(generation, op, arg->clone(arg));
294 | }
295 |
296 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
297 | {
298 | v.visit(fn, this_ptr);
299 |
300 | arg->visit(fn, arg, v);
301 | }
302 |
303 | void print(FILE *f, unsigned int indent)
304 | {
305 | fprintf(f, "%s(", op.c_str());
306 | arg->print(f, indent);
307 | fprintf(f, ")");
308 | }
309 | };
310 |
311 | struct binop_expression: expression {
312 | std::string op;
313 | expr_ptr lhs;
314 | expr_ptr rhs;
315 |
316 | binop_expression(unsigned int generation, std::string op, expr_ptr lhs, expr_ptr rhs):
317 | expression(generation),
318 | op(op),
319 | lhs(lhs),
320 | rhs(rhs)
321 | {
322 | }
323 |
324 | expr_ptr clone(expr_ptr &this_ptr)
325 | {
326 | return std::make_shared(generation, op, lhs->clone(lhs), rhs->clone(rhs));
327 | }
328 |
329 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
330 | {
331 | v.visit(fn, this_ptr);
332 |
333 | lhs->visit(fn, lhs, v);
334 | rhs->visit(fn, rhs, v);
335 | }
336 |
337 | void print(FILE *f, unsigned int indent)
338 | {
339 | fprintf(f, "(");
340 | lhs->print(f, indent);
341 | fprintf(f, ") %s (", op.c_str());
342 | rhs->print(f, indent);
343 | fprintf(f, ")");
344 | }
345 | };
346 |
347 | struct ternop_expression: expression {
348 | std::string op1;
349 | std::string op2;
350 | expr_ptr arg1;
351 | expr_ptr arg2;
352 | expr_ptr arg3;
353 |
354 | ternop_expression(unsigned int generation, std::string op1, std::string op2, expr_ptr arg1, expr_ptr arg2, expr_ptr arg3):
355 | expression(generation),
356 | op1(op1),
357 | op2(op2),
358 | arg1(arg1),
359 | arg2(arg2),
360 | arg3(arg3)
361 | {
362 | }
363 |
364 | expr_ptr clone(expr_ptr &this_ptr)
365 | {
366 | return std::make_shared(generation, op1, op2, arg1->clone(arg1), arg2->clone(arg2), arg3->clone(arg3));
367 | }
368 |
369 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
370 | {
371 | v.visit(fn, this_ptr);
372 |
373 | arg1->visit(fn, arg1, v);
374 | arg2->visit(fn, arg2, v);
375 | arg3->visit(fn, arg3, v);
376 | }
377 |
378 | void print(FILE *f, unsigned int indent)
379 | {
380 | fprintf(f, "(");
381 | arg1->print(f, indent);
382 | fprintf(f, ") %s (", op1.c_str());
383 | arg2->print(f, indent);
384 | fprintf(f, ") %s (", op2.c_str());
385 | arg3->print(f, indent);
386 | fprintf(f, ")");
387 | }
388 | };
389 |
390 | struct unreachable_statement: expression {
391 | expr_ptr stmt;
392 |
393 | unreachable_statement(unsigned int generation, expr_ptr stmt):
394 | expression(generation),
395 | stmt(stmt)
396 | {
397 | }
398 |
399 | expr_ptr clone(expr_ptr &this_ptr)
400 | {
401 | return std::make_shared(generation, stmt->clone(stmt));
402 | }
403 |
404 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
405 | {
406 | v.enter_unreachable();
407 | v.visit(fn, this_ptr);
408 | stmt->visit(fn, stmt, v);
409 | v.leave_unreachable();
410 | }
411 |
412 | void print(FILE *f, unsigned int indent)
413 | {
414 | stmt->print(f, indent);
415 | }
416 | };
417 |
418 | typedef expression statement;
419 |
420 | struct declaration_statement: statement {
421 | type_ptr var_type;
422 | expr_ptr var_expr;
423 | expr_ptr value_expr;
424 |
425 | declaration_statement(unsigned int generation, type_ptr var_type, expr_ptr var_expr, expr_ptr value_expr):
426 | expression(generation),
427 | var_type(var_type),
428 | var_expr(var_expr),
429 | value_expr(value_expr)
430 | {
431 | }
432 |
433 | expr_ptr clone(expr_ptr &this_ptr)
434 | {
435 | return std::make_shared(generation, var_type, var_expr->clone(var_expr), value_expr->clone(value_expr));
436 | }
437 |
438 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
439 | {
440 | v.visit(fn, this_ptr);
441 |
442 | //var_type->visit(fn, var_type, v);
443 | var_expr->visit(fn, var_expr, v);
444 | value_expr->visit(fn, value_expr, v);
445 | }
446 |
447 | void print(FILE *f, unsigned int indent)
448 | {
449 | fprintf(f, "%*s", 2 * indent, "");
450 | var_type->print(f);
451 | fprintf(f, " ");
452 | var_expr->print(f, indent);
453 | fprintf(f, " = ");
454 | value_expr->print(f, indent);
455 | fprintf(f, ";\n");
456 | }
457 | };
458 |
459 | struct return_statement: statement {
460 | expr_ptr ret_expr;
461 |
462 | return_statement(unsigned int generation, expr_ptr ret_expr):
463 | expression(generation),
464 | ret_expr(ret_expr)
465 | {
466 | }
467 |
468 | expr_ptr clone(expr_ptr &this_ptr)
469 | {
470 | return std::make_shared(generation, ret_expr->clone(ret_expr));
471 | }
472 |
473 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
474 | {
475 | v.visit(fn, this_ptr);
476 |
477 | ret_expr->visit(fn, ret_expr, v);
478 | }
479 |
480 | void print(FILE *f, unsigned int indent)
481 | {
482 | fprintf(f, "%*sreturn ", 2 * indent, "");
483 | ret_expr->print(f, indent);
484 | fprintf(f, ";\n");
485 | }
486 | };
487 |
488 | struct block_statement: statement {
489 | std::vector statements;
490 |
491 | explicit block_statement(unsigned int generation):
492 | expression(generation)
493 | {
494 | }
495 |
496 | explicit block_statement(unsigned int generation, std::vector &statements):
497 | expression(generation),
498 | statements(statements)
499 | {
500 | }
501 |
502 | expr_ptr clone(expr_ptr &this_ptr)
503 | {
504 | std::vector new_statements;
505 | for (auto &stmt: statements)
506 | new_statements.push_back(stmt->clone(stmt));
507 |
508 | return std::make_shared(generation, new_statements);
509 | }
510 |
511 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
512 | {
513 | v.visit(fn, this_ptr);
514 |
515 | for (auto &stmt: statements)
516 | stmt->visit(fn, stmt, v);
517 | }
518 |
519 | void print(FILE *f, unsigned int indent)
520 | {
521 | fprintf(f, "{\n");
522 | for (const auto &stmt: statements)
523 | stmt->print(f, indent + 1);
524 | fprintf(f, "%*s}\n", 2 * (indent - 1), "");
525 | }
526 | };
527 |
528 | struct if_statement: statement {
529 | expr_ptr cond_expr;
530 | expr_ptr true_stmt;
531 | expr_ptr false_stmt;
532 |
533 | if_statement(unsigned int generation, expr_ptr cond_expr, expr_ptr true_stmt, expr_ptr false_stmt):
534 | expression(generation),
535 | cond_expr(cond_expr),
536 | true_stmt(true_stmt),
537 | false_stmt(false_stmt)
538 | {
539 | }
540 |
541 | expr_ptr clone(expr_ptr &this_ptr)
542 | {
543 | return std::make_shared(generation, cond_expr->clone(cond_expr), true_stmt->clone(true_stmt), false_stmt ? false_stmt->clone(false_stmt) : false_stmt);
544 | }
545 |
546 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
547 | {
548 | v.visit(fn, this_ptr);
549 |
550 | cond_expr->visit(fn, cond_expr, v);
551 | true_stmt->visit(fn, true_stmt, v);
552 | false_stmt->visit(fn, false_stmt, v);
553 | }
554 |
555 | void print(FILE *f, unsigned int indent)
556 | {
557 | fprintf(f, "%*s", 2 * indent, "");
558 | fprintf(f, "if (");
559 | cond_expr->print(f, indent);
560 | fprintf(f, ") ");
561 | true_stmt->print(f, indent + 1);
562 |
563 | if (false_stmt) {
564 | fprintf(f, "%*selse ", 2 * indent, "");
565 | false_stmt->print(f, indent + 1);
566 | }
567 | }
568 | };
569 |
570 | struct asm_constraint_expression: expression {
571 | std::string constraint;
572 | expr_ptr expr;
573 |
574 | asm_constraint_expression(unsigned int generation, std::string constraint, expr_ptr expr):
575 | expression(generation),
576 | constraint(constraint),
577 | expr(expr)
578 | {
579 | }
580 |
581 | expr_ptr clone(expr_ptr &this_ptr)
582 | {
583 | return std::make_shared(generation, constraint, expr->clone(expr));
584 | }
585 |
586 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
587 | {
588 | v.visit(fn, this_ptr);
589 |
590 | expr->visit(fn, expr, v);
591 | }
592 |
593 | void print(FILE *f, unsigned int indent)
594 | {
595 | fprintf(f, "\"%s\" (", constraint.c_str());
596 | expr->print(f, indent);
597 | fprintf(f, ")");
598 | }
599 | };
600 |
601 | struct asm_statement: statement {
602 | bool is_volatile;
603 | std::vector outputs;
604 | std::vector inputs;
605 |
606 | asm_statement(unsigned int generation, bool is_volatile, std::vector outputs, std::vector inputs):
607 | expression(generation),
608 | is_volatile(is_volatile),
609 | outputs(outputs),
610 | inputs(inputs)
611 | {
612 | }
613 |
614 | expr_ptr clone(expr_ptr &this_ptr)
615 | {
616 | std::vector new_outputs;
617 | for (auto &output_expr: outputs)
618 | new_outputs.push_back(output_expr->clone(output_expr));
619 |
620 | std::vector new_inputs;
621 | for (auto &input_expr: inputs)
622 | new_inputs.push_back(input_expr->clone(input_expr));
623 |
624 | return std::make_shared(generation, is_volatile, new_outputs, new_inputs);
625 | }
626 |
627 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
628 | {
629 | v.visit(fn, this_ptr);
630 | }
631 |
632 | void print(FILE *f, unsigned int indent)
633 | {
634 | fprintf(f, "%*s", 2 * indent, "");
635 | fprintf(f, "asm %s(\"\"", is_volatile ? "volatile " : "");
636 |
637 | if (outputs.size() || inputs.size()) {
638 | fprintf(f, " : ");
639 |
640 | for (unsigned int i = 0; i < outputs.size(); ++i) {
641 | if (i > 0)
642 | fprintf(f, ", ");
643 |
644 | outputs[i]->print(f, indent);
645 | }
646 | }
647 |
648 | if (inputs.size()) {
649 | fprintf(f, " : ");
650 |
651 | for (unsigned int i = 0; i < inputs.size(); ++i) {
652 | if (i > 0)
653 | fprintf(f, ", ");
654 |
655 | inputs[i]->print(f, indent);
656 | }
657 | }
658 |
659 | fprintf(f, ");\n");
660 | }
661 | };
662 |
663 | struct statement_expression: expression {
664 | expr_ptr block_stmt;
665 | expr_ptr last_stmt;
666 |
667 | statement_expression(unsigned int generation, expr_ptr block_stmt, expr_ptr last_stmt):
668 | expression(generation),
669 | block_stmt(block_stmt),
670 | last_stmt(last_stmt)
671 | {
672 | }
673 |
674 | expr_ptr clone(expr_ptr &this_ptr)
675 | {
676 | return std::make_shared(generation, block_stmt->clone(block_stmt), last_stmt->clone(last_stmt));
677 | }
678 |
679 | void visit(function_ptr fn, expr_ptr &this_ptr, visitor &v)
680 | {
681 | v.visit(fn, this_ptr);
682 |
683 | block_stmt->visit(fn, block_stmt, v);
684 | last_stmt->visit(fn, last_stmt, v);
685 | }
686 |
687 | void print(FILE *f, unsigned int indent)
688 | {
689 | fprintf(f, "({ ");
690 | block_stmt->print(f, 0);
691 | last_stmt->print(f, 0);
692 | fprintf(f, "})");
693 | }
694 | };
695 |
696 | struct expression_statement: statement {
697 | expr_ptr expr;
698 |
699 | expression_statement(unsigned int generation, expr_ptr expr):
700 | expression(generation),
701 | expr(expr)
702 | {
703 | }
704 |
705 | expr_ptr clone(expr_ptr &this_ptr)
706 | {
707 | return std::make_shared(generation, expr->clone(expr));
708 | }
709 |
710 | void visit(function_ptr fn, expr_ptr &this_stmt, visitor &v)
711 | {
712 | v.visit(fn, this_stmt);
713 |
714 | expr->visit(fn, expr, v);
715 | }
716 |
717 | void print(FILE *f, unsigned int indent)
718 | {
719 | fprintf(f, "%*s", 2 * indent, "");
720 | expr->print(f, indent);
721 | fprintf(f, ";\n");
722 | }
723 | };
724 |
725 | struct function {
726 | std::string name;
727 |
728 | type_ptr return_type;
729 | std::vector arg_types;
730 |
731 | expr_ptr body;
732 |
733 | function(std::string name, type_ptr return_type, std::vector arg_types, expr_ptr body):
734 | name(name),
735 | return_type(return_type),
736 | arg_types(arg_types),
737 | body(body)
738 | {
739 | }
740 |
741 | function_ptr clone()
742 | {
743 | return std::make_shared(name, return_type, arg_types, body->clone(body));
744 | }
745 |
746 | void visit(function_ptr fn, function_ptr &this_ptr, visitor &v)
747 | {
748 | v.visit(this_ptr, this_ptr);
749 |
750 | body->visit(this_ptr, body, v);
751 | }
752 |
753 | void print(FILE *f)
754 | {
755 | return_type->print(f);
756 | fprintf(f, " %s(", name.c_str());
757 | for (unsigned int i = 0; i < arg_types.size(); ++i) {
758 | if (i > 0)
759 | fprintf(f, ", ");
760 |
761 | arg_types[i]->print(f);
762 | }
763 | fprintf(f, ")\n");
764 | body->print(f, 1);
765 | fprintf(f, "\n");
766 | }
767 | };
768 |
769 | struct ident_allocator {
770 | unsigned int id;
771 |
772 | ident_allocator():
773 | id(0)
774 | {
775 | }
776 |
777 | std::string new_ident()
778 | {
779 | std::ostringstream ss;
780 | ss << "id" << id++;
781 | return ss.str();
782 | }
783 | };
784 |
785 | struct program {
786 | unsigned int generation;
787 |
788 | int toplevel_value;
789 |
790 | ident_allocator ids;
791 |
792 | std::vector toplevel_decls;
793 | std::vector toplevel_fns;
794 |
795 | function_ptr toplevel_fn;
796 | expr_ptr toplevel_call_expr;
797 |
798 | explicit program(int toplevel_value):
799 | generation(0),
800 | toplevel_value(toplevel_value)
801 | {
802 | auto body = std::make_shared(generation);
803 | body->statements.push_back(std::make_shared(generation, std::make_shared(generation, toplevel_value)));
804 | toplevel_fn = std::make_shared(ids.new_ident(), int_type, std::vector(), body);
805 | toplevel_call_expr = std::make_shared(generation, std::make_shared(generation, toplevel_fn->name));
806 | }
807 |
808 | program(unsigned int generation, int toplevel_value, ident_allocator &ids, std::vector toplevel_decls, std::vector toplevel_fns, function_ptr toplevel_fn, expr_ptr toplevel_call_expr):
809 | generation(generation),
810 | toplevel_value(toplevel_value),
811 | ids(ids),
812 | toplevel_decls(toplevel_decls),
813 | toplevel_fns(toplevel_fns),
814 | toplevel_fn(toplevel_fn),
815 | toplevel_call_expr(toplevel_call_expr)
816 | {
817 | }
818 |
819 | program_ptr clone()
820 | {
821 | std::vector new_toplevel_decls;
822 | for (auto &stmt_ptr: toplevel_decls)
823 | new_toplevel_decls.push_back(stmt_ptr->clone(stmt_ptr));
824 |
825 | std::vector new_toplevel_fns;
826 | for (auto &fn_ptr: toplevel_fns)
827 | new_toplevel_fns.push_back(fn_ptr->clone());
828 |
829 | return std::make_shared(generation + 1, toplevel_value, ids, new_toplevel_decls, new_toplevel_fns, toplevel_fn->clone(), toplevel_call_expr->clone(toplevel_call_expr));
830 | }
831 |
832 | void visit(visitor &v)
833 | {
834 | for (auto &stmt_ptr: toplevel_decls)
835 | stmt_ptr->visit(nullptr, stmt_ptr, v);
836 |
837 | for (auto &fn_ptr: toplevel_fns)
838 | fn_ptr->visit(nullptr, fn_ptr, v);
839 |
840 | toplevel_fn->visit(nullptr, toplevel_fn, v);
841 | // XXX? toplevel_call_expr->visit(nullptr, toplevel_call_expr, v);
842 | }
843 |
844 | void print(FILE *f)
845 | {
846 | //fprintf(f, "#include \n");
847 | fprintf(f, "extern \"C\" {\n");
848 | fprintf(f, "extern int printf (const char *__restrict __format, ...);\n");
849 | fprintf(f, "}\n");
850 | fprintf(f, "\n");
851 |
852 | for (auto &stmt_ptr: toplevel_decls)
853 | stmt_ptr->print(f, 0);
854 |
855 | for (auto &fn_ptr: toplevel_fns)
856 | fn_ptr->print(f);
857 |
858 | toplevel_fn->print(f);
859 |
860 | fprintf(f, "int main(int argc, char *argv[])\n");
861 | fprintf(f, "{\n");
862 | fprintf(f, " printf(\"%%d\\n\", ");
863 | toplevel_call_expr->print(f, 0);
864 | fprintf(f, ");\n");
865 | fprintf(f, "}\n");
866 | }
867 | };
868 |
869 | // Mutation
870 |
871 | static std::random_device r;
872 | static std::default_random_engine re;
873 |
874 | // Tree traversal helpers
875 |
876 | template
877 | struct find_result {
878 | function_ptr fn;
879 | expr_ptr *expr_ptr_ref;
880 | std::shared_ptr expr;
881 |
882 | find_result(function_ptr fn, expr_ptr &expr_ptr_ref, std::shared_ptr expr):
883 | fn(fn),
884 | expr_ptr_ref(&expr_ptr_ref),
885 | expr(expr)
886 | {
887 | }
888 |
889 | // sort by generation in descending order (used for picking more recently modified expressions)
890 | bool operator<(const find_result &other) const
891 | {
892 | return expr->generation > other.expr->generation;
893 | }
894 | };
895 |
896 | template
897 | std::vector> find_exprs(program_ptr p)
898 | {
899 | std::vector> result;
900 |
901 | struct find_exprs_visitor: visitor {
902 | std::vector> &result;
903 |
904 | find_exprs_visitor(std::vector> &result):
905 | result(result)
906 | {
907 | }
908 |
909 | void visit(function_ptr fn, expr_ptr &e)
910 | {
911 | // Only return expressions within functions
912 | if (!fn)
913 | return;
914 |
915 | auto cast_e = std::dynamic_pointer_cast(e);
916 | if (cast_e)
917 | result.push_back(find_result(fn, e, cast_e));
918 | }
919 | };
920 |
921 | find_exprs_visitor v(result);
922 | p->visit(v);
923 | return result;
924 | }
925 |
926 | template
927 | std::vector> find_expr(program_ptr p)
928 | {
929 | auto results = find_exprs(p);
930 | if (results.empty())
931 | return results;
932 |
933 | std::sort(results.begin(), results.end());
934 |
935 | unsigned int index = std::geometric_distribution(find_p)(re);
936 | if (index >= results.size())
937 | index = results.size() - 1;
938 |
939 | std::vector> new_results;
940 | new_results.push_back(results[index]);
941 | return new_results;
942 | }
943 |
944 | template
945 | struct find_stmts_result {
946 | function_ptr fn;
947 | expr_ptr *stmt_ptr_ref;
948 | std::shared_ptr stmt;
949 |
950 | find_stmts_result(function_ptr fn, expr_ptr &stmt_ptr_ref, std::shared_ptr stmt):
951 | fn(fn),
952 | stmt_ptr_ref(&stmt_ptr_ref),
953 | stmt(stmt)
954 | {
955 | }
956 |
957 | // sort by generation in descending order (used for picking more recently modified expressions)
958 | bool operator<(const find_stmts_result &other) const
959 | {
960 | return stmt->generation > other.stmt->generation;
961 | }
962 | };
963 |
964 | // TODO: merge this with find_expr() above...
965 | template
966 | std::vector> find_stmts(program_ptr p, std::function)> filter = [](visitor &, std::shared_ptr e){ return true; })
967 | {
968 | std::vector> result;
969 |
970 | struct find_stmts_visitor: visitor {
971 | std::function)> filter;
972 | std::vector> &result;
973 |
974 | find_stmts_visitor(std::function)> filter, std::vector> &result):
975 | filter(filter),
976 | result(result)
977 | {
978 | }
979 |
980 | void visit(function_ptr fn, expr_ptr &s)
981 | {
982 | auto cast_s = std::dynamic_pointer_cast(s);
983 | if (cast_s) {
984 | if (!filter(*this, cast_s))
985 | return;
986 |
987 | result.push_back(find_stmts_result(fn, s, cast_s));
988 | }
989 | }
990 | };
991 |
992 | find_stmts_visitor v(filter, result);
993 | p->visit(v);
994 | return result;
995 | }
996 |
997 | template
998 | std::vector> find_stmt(program_ptr p, std::function)> filter = [](visitor &, std::shared_ptr e){ return true; })
999 | {
1000 | auto results = find_stmts(p, filter);
1001 | if (results.empty())
1002 | return results;
1003 |
1004 | std::sort(results.begin(), results.end());
1005 |
1006 | unsigned int index = std::geometric_distribution(find_p)(re);
1007 | if (index >= results.size())
1008 | index = results.size() - 1;
1009 |
1010 | std::vector> new_results;
1011 | new_results.push_back(results[index]);
1012 | return new_results;
1013 | }
1014 |
1015 |
1016 | #if 0
1017 | static void walk(program_ptr p, std::function callback)
1018 | {
1019 | struct walk_visitor: visitor {
1020 | std::function cb;
1021 |
1022 | walk_visitor(std::function cb):
1023 | cb(cb)
1024 | {
1025 | }
1026 |
1027 | void visit(expr_ptr &ref)
1028 | {
1029 | cb(*this);
1030 | }
1031 | };
1032 |
1033 | walk_visitor v(callback);
1034 | p->visit(v);
1035 | }
1036 | #endif
1037 |
1038 | // Integer transformations
1039 |
1040 | static program_ptr transform_integer_to_statement_expression(program_ptr p)
1041 | {
1042 | program_ptr new_p = p->clone();
1043 | unsigned int generation = new_p->generation;
1044 |
1045 | // First, find all integer literals
1046 | auto int_literal_exprs = find_expr(new_p);
1047 | if (int_literal_exprs.empty())
1048 | return p;
1049 |
1050 | // Pick a random one to mutate
1051 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1052 | auto int_e = e.expr;
1053 |
1054 | // Replace by a new expression
1055 | std::vector stmts;
1056 | auto new_e = std::make_shared(generation,
1057 | std::make_shared(generation, stmts),
1058 | std::make_shared(generation, int_e));
1059 | *e.expr_ptr_ref = new_e;
1060 | return new_p;
1061 | }
1062 |
1063 | static program_ptr transform_integer_to_sum(program_ptr p)
1064 | {
1065 | program_ptr new_p = p->clone();
1066 | unsigned int generation = new_p->generation;
1067 |
1068 | // First, find all integer literals
1069 | auto int_literal_exprs = find_expr(new_p);
1070 | if (int_literal_exprs.empty())
1071 | return p;
1072 |
1073 | // Pick a random one to mutate
1074 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1075 | auto int_e = e.expr;
1076 |
1077 | // Pick numbers that we know won't overflow (either here or in the generated program!)
1078 | int min = std::numeric_limits::min();
1079 | int max = std::numeric_limits::max();
1080 | if (int_e->value < 0)
1081 | max = int_e->value - min;
1082 | else
1083 | min = int_e->value - max;
1084 |
1085 | int value_a = std::uniform_int_distribution(min, max)(re);
1086 | int value_b = int_e->value - value_a;
1087 |
1088 | // Replace by a new expression
1089 | auto a_expr = std::make_shared(generation, value_a);
1090 | auto b_expr = std::make_shared(generation, value_b);
1091 | auto new_e = std::make_shared(generation, "+", a_expr, b_expr);
1092 | *e.expr_ptr_ref = new_e;
1093 | return new_p;
1094 | }
1095 |
1096 | static int gcd(int a, int b)
1097 | {
1098 | while (a != b) {
1099 | if (a > b)
1100 | a -= b;
1101 | else
1102 | b -= a;
1103 | }
1104 |
1105 | return a;
1106 | }
1107 |
1108 | static program_ptr transform_integer_to_product(program_ptr p)
1109 | {
1110 | program_ptr new_p = p->clone();
1111 | unsigned int generation = new_p->generation;
1112 |
1113 | // First, find all integer literals
1114 | auto int_literal_exprs = find_expr(new_p);
1115 | if (int_literal_exprs.empty())
1116 | return p;
1117 |
1118 | // Pick a random one to mutate
1119 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1120 | auto int_e = e.expr;
1121 |
1122 | // TODO!
1123 | int a = abs(int_e->value);
1124 | if (a <= 1)
1125 | return p;
1126 | int b = std::uniform_int_distribution(1, a - 1)(re);
1127 |
1128 | int value_a = gcd(a, b);
1129 | int value_b = int_e->value / value_a;
1130 |
1131 | // Replace by a new expression
1132 | auto a_expr = std::make_shared(generation, value_a);
1133 | auto b_expr = std::make_shared(generation, value_b);
1134 | auto new_e = std::make_shared(generation, "*", a_expr, b_expr);
1135 | *e.expr_ptr_ref = new_e;
1136 | return new_p;
1137 | }
1138 |
1139 | static program_ptr transform_integer_to_negation(program_ptr p)
1140 | {
1141 | program_ptr new_p = p->clone();
1142 | unsigned int generation = new_p->generation;
1143 |
1144 | // First, find all integer literals
1145 | auto int_literal_exprs = find_expr(new_p);
1146 | if (int_literal_exprs.empty())
1147 | return p;
1148 |
1149 | // Pick a random one to mutate
1150 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1151 | auto int_e = e.expr;
1152 |
1153 | // Replace by a new expression
1154 | auto arg_expr = std::make_shared(generation, ~int_e->value);
1155 | auto new_e = std::make_shared(generation, "~", arg_expr);
1156 | *e.expr_ptr_ref = new_e;
1157 | return new_p;
1158 | }
1159 |
1160 | static program_ptr transform_integer_to_conjunction(program_ptr p)
1161 | {
1162 | program_ptr new_p = p->clone();
1163 | unsigned int generation = new_p->generation;
1164 |
1165 | // First, find all integer literals
1166 | auto int_literal_exprs = find_expr(new_p);
1167 | if (int_literal_exprs.empty())
1168 | return p;
1169 |
1170 | // Pick a random one to mutate
1171 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1172 | auto int_e = e.expr;
1173 |
1174 | int r = std::uniform_int_distribution(std::numeric_limits::min(), std::numeric_limits::max())(re);
1175 |
1176 | // Pick numbers that we know won't overflow (either here or in the generated program!)
1177 | int value_a = int_e->value | r;
1178 | int value_b = int_e->value | ~r;
1179 |
1180 | // Replace by a new expression
1181 | auto a_expr = std::make_shared(generation, value_a);
1182 | auto b_expr = std::make_shared(generation, value_b);
1183 | auto new_e = std::make_shared(generation, "&", a_expr, b_expr);
1184 | *e.expr_ptr_ref = new_e;
1185 | return new_p;
1186 | }
1187 |
1188 | static program_ptr transform_integer_to_disjunction(program_ptr p)
1189 | {
1190 | program_ptr new_p = p->clone();
1191 | unsigned int generation = new_p->generation;
1192 |
1193 | // First, find all integer literals
1194 | auto int_literal_exprs = find_expr(new_p);
1195 | if (int_literal_exprs.empty())
1196 | return p;
1197 |
1198 | // Pick a random one to mutate
1199 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1200 | auto int_e = e.expr;
1201 |
1202 | int r = std::uniform_int_distribution(std::numeric_limits::min(), std::numeric_limits::max())(re);
1203 |
1204 | // Pick numbers that we know won't overflow (either here or in the generated program!)
1205 | int value_a = int_e->value & r;
1206 | int value_b = int_e->value & ~r;
1207 |
1208 | // Replace by a new expression
1209 | auto a_expr = std::make_shared(generation, value_a);
1210 | auto b_expr = std::make_shared(generation, value_b);
1211 | auto new_e = std::make_shared(generation, "|", a_expr, b_expr);
1212 | *e.expr_ptr_ref = new_e;
1213 | return new_p;
1214 | }
1215 |
1216 | static program_ptr transform_integer_to_xor(program_ptr p)
1217 | {
1218 | program_ptr new_p = p->clone();
1219 | unsigned int generation = new_p->generation;
1220 |
1221 | // First, find all integer literals
1222 | auto int_literal_exprs = find_expr(new_p);
1223 | if (int_literal_exprs.empty())
1224 | return p;
1225 |
1226 | // Pick a random one to mutate
1227 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1228 | auto int_e = e.expr;
1229 |
1230 | int r = std::uniform_int_distribution(std::numeric_limits::min(), std::numeric_limits::max())(re);
1231 |
1232 | // Pick numbers that we know won't overflow (either here or in the generated program!)
1233 | int value_a = ~r;
1234 | int value_b = r ^ ~int_e->value;
1235 |
1236 | // Replace by a new expression
1237 | auto a_expr = std::make_shared(generation, value_a);
1238 | auto b_expr = std::make_shared(generation, value_b);
1239 | auto new_e = std::make_shared(generation, "^", a_expr, b_expr);
1240 | *e.expr_ptr_ref = new_e;
1241 | return new_p;
1242 | }
1243 |
1244 | static program_ptr transform_integer_to_ternary(program_ptr p)
1245 | {
1246 | program_ptr new_p = p->clone();
1247 | unsigned int generation = new_p->generation;
1248 |
1249 | // First, find all integer literals
1250 | auto int_literal_exprs = find_expr(new_p);
1251 | if (int_literal_exprs.empty())
1252 | return p;
1253 |
1254 | // Pick a random one to mutate
1255 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1256 | auto int_e = e.expr;
1257 |
1258 | int min = std::numeric_limits::min();
1259 | int max = std::numeric_limits::max();
1260 |
1261 | auto cond_expr = std::make_shared(generation, std::uniform_int_distribution(0, 1)(re));
1262 | expr_ptr true_expr = std::make_shared(generation, int_e->value);
1263 | expr_ptr false_expr = std::make_shared(generation,
1264 | std::make_shared(generation, std::uniform_int_distribution(min, max)(re)));
1265 |
1266 | expr_ptr a_expr = true_expr;
1267 | expr_ptr b_expr = false_expr;
1268 | if (!cond_expr->value)
1269 | std::swap(a_expr, b_expr);
1270 |
1271 | // Replace by a new expression
1272 | auto new_e = std::make_shared(generation, "?", ":", cond_expr, a_expr, b_expr);
1273 | *e.expr_ptr_ref = new_e;
1274 | return new_p;
1275 | }
1276 |
1277 | static program_ptr transform_integer_1_to_equals(program_ptr p)
1278 | {
1279 | program_ptr new_p = p->clone();
1280 | unsigned int generation = new_p->generation;
1281 |
1282 | // First, find all integer literals
1283 | auto int_literal_exprs = find_stmt(new_p, [](visitor &, std::shared_ptr e){ return e->value == 1; });
1284 | if (int_literal_exprs.empty())
1285 | return p;
1286 |
1287 | // Pick a random one to mutate
1288 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1289 | auto int_e = e.stmt;
1290 |
1291 | int r = std::uniform_int_distribution(std::numeric_limits::min(), std::numeric_limits::max())(re);
1292 |
1293 | // Replace by a new expression
1294 | auto a_expr = std::make_shared(generation, r);
1295 | auto b_expr = std::make_shared(generation, r);
1296 | auto new_e = std::make_shared(generation, "==", a_expr, b_expr);
1297 | *e.stmt_ptr_ref = new_e;
1298 | return new_p;
1299 | }
1300 |
1301 | static program_ptr transform_integer_1_to_not_equals(program_ptr p)
1302 | {
1303 | program_ptr new_p = p->clone();
1304 | unsigned int generation = new_p->generation;
1305 |
1306 | // First, find all integer literals
1307 | auto int_literal_exprs = find_stmt(new_p, [](visitor &, std::shared_ptr e){ return e->value == 1; });
1308 | if (int_literal_exprs.empty())
1309 | return p;
1310 |
1311 | // Pick a random one to mutate
1312 | auto e = int_literal_exprs[std::uniform_int_distribution(0, int_literal_exprs.size() - 1)(re)];
1313 | auto int_e = e.stmt;
1314 |
1315 | // Pick two random numbers (not the same)
1316 | int r1 = std::uniform_int_distribution(std::numeric_limits::min(), std::numeric_limits::max())(re);
1317 | int r2;
1318 | do {
1319 | r2 = std::uniform_int_distribution(std::numeric_limits