├── LICENSE ├── Makefile ├── README.md ├── gcc-plugins.pdf └── src ├── phi-debug └── phi-debug.cpp └── test ├── test.c ├── test.c.018t.ssa └── test.c.018t.ssa.dot /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | phi-debug: 2 | mkdir -p plugin 3 | g++ -g -Wall -Wextra -std=c++14 -I`gcc -print-file-name=plugin`/include -fPIC -fno-rtti -shared src/phi-debug/phi-debug.cpp -o plugin/$@.so 4 | 5 | test: 6 | gcc -fplugin=plugin/phi-debug.so -O0 src/test/test.c -o src/test/test 7 | rm src/test/test 8 | 9 | .PHONY : clean 10 | 11 | clean: 12 | rm -rf plugin src/test/test 13 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # gcc-plugin-guide 2 | Краткий гайд по написанию плагинов для GCC на русском языке 3 | 4 | ## Зачем? 5 | На данный момент существует очень мало статей на русском (да и на английском) языке по написанию `плагинов` к `GCC`. В то же время `плагины` очень удобны и существенно расширяют функциональность компилятора, поэтому я и решил написать небольшой гайд по их написанию для `GCC`. 6 | 7 | # OS & Compiler 8 | Linux Mint 18.3 9 | GCC 5.4.0 10 | 11 | ## На чем тестировалось? 12 | Небольшой плагин-дебаггер SSA-формы. В качестве тестовой программы для дебага - набор из нескольких функций, содержащих константы, циклы, условия и тд. 13 | -------------------------------------------------------------------------------- /gcc-plugins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/masyagin1998/gcc-plugin-guide/dba609d1d1d0bbb85a4eaa0312c731e80e40f755/gcc-plugins.pdf -------------------------------------------------------------------------------- /src/phi-debug/phi-debug.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2019 Mikhail Masyagin 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | #include 8 | #include 9 | 10 | #include 11 | 12 | #include 13 | #include 14 | #include 15 | 16 | #include 17 | #include 18 | #include 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | #include 25 | #include 26 | 27 | #define PREFIX_UNUSED(variable) ((void)variable) 28 | 29 | int plugin_is_GPL_compatible = 1; 30 | 31 | #define PLUGIN_NAME "phi-debug" 32 | #define PLUGIN_VERSION "1.0.0" 33 | #define PLUGIN_HELP "this plugin shows:\n"\ 34 | "* basic blocks;\n"\ 35 | "* GIMPLE instructions:\n"\ 36 | " - arithmetic operations;\n"\ 37 | " - phi-functions;\n"\ 38 | " - branches;\n"\ 39 | " - memory operations;" 40 | 41 | static struct plugin_info phi_debug_plugin_info = { 42 | .version = PLUGIN_VERSION, 43 | .help = PLUGIN_HELP, 44 | }; 45 | 46 | static const struct pass_data phi_debug_pass_data = { 47 | .type = GIMPLE_PASS, 48 | .name = PLUGIN_NAME, 49 | .optinfo_flags = OPTGROUP_NONE, 50 | .tv_id = TV_NONE, 51 | 52 | .properties_required = PROP_gimple_any, 53 | .properties_provided = 0, 54 | .properties_destroyed = 0, 55 | 56 | .todo_flags_start = 0, 57 | .todo_flags_finish = 0, 58 | }; 59 | 60 | struct phi_debug_pass : gimple_opt_pass { 61 | phi_debug_pass(gcc::context*ctx) : gimple_opt_pass(phi_debug_pass_data, ctx) {} 62 | virtual unsigned int execute(function*fun) override; 63 | virtual phi_debug_pass *clone() override { return this; } 64 | }; 65 | 66 | static unsigned int phi_debug_bb_id(basic_block bb) 67 | { 68 | std::cout << "\t" << "bb: "; 69 | edge e; 70 | edge_iterator it; 71 | std::cout << "("; 72 | std::stringstream src_stream; 73 | FOR_EACH_EDGE(e, it, bb->preds) { 74 | src_stream << e->src->index << ", "; 75 | } 76 | std::string src = src_stream.str(); 77 | std::cout << src.substr(0, src.size() - 2); 78 | std::cout << ")"; 79 | std::cout << " -> " << 80 | "(" << bb->index << ")" 81 | << " -> "; 82 | std::cout << "("; 83 | std::stringstream dst_stream; 84 | FOR_EACH_EDGE(e, it, bb->succs) { 85 | dst_stream << e->dest->index << ", "; 86 | } 87 | std::string dst = dst_stream.str(); 88 | std::cout << dst.substr(0, dst.size() - 2); 89 | std::cout << ")"; 90 | 91 | return 0; 92 | } 93 | 94 | static unsigned int phi_debug_tree(tree t) 95 | { 96 | switch (TREE_CODE(t)) { 97 | // Constants. 98 | case INTEGER_CST: 99 | std::cout << TREE_INT_CST_LOW(t); 100 | break; 101 | case REAL_CST: { 102 | std::cout << "REAL_CST"; 103 | break; 104 | } 105 | case FIXED_CST: { 106 | std::cout << "FIXED_CST"; 107 | break; 108 | } 109 | case COMPLEX_CST: 110 | std::cout << "COMPLEX_CST"; 111 | break; 112 | case VECTOR_CST: 113 | std::cout << "VECTOR_CST"; 114 | break; 115 | case STRING_CST: 116 | std::cout << "\"" << TREE_STRING_POINTER(t) << "\""; 117 | break; 118 | // Declarations. 119 | case LABEL_DECL: 120 | std::cout << (DECL_NAME(t) ? IDENTIFIER_POINTER(DECL_NAME(t)) : "unk_label_decl") << ":"; 121 | break; 122 | case FIELD_DECL: 123 | std::cout << (DECL_NAME(t) ? IDENTIFIER_POINTER(DECL_NAME(t)) : "unk_field_decl"); 124 | break; 125 | case VAR_DECL: 126 | std::cout << (DECL_NAME(t) ? IDENTIFIER_POINTER(DECL_NAME(t)) : "unk_var_decl"); 127 | break; 128 | case CONST_DECL: 129 | std::cout << (DECL_NAME(t) ? IDENTIFIER_POINTER(DECL_NAME(t)) : "unk_const_decl"); 130 | break; 131 | // Memory references. 132 | case COMPONENT_REF: 133 | phi_debug_tree(TREE_OPERAND(t, 0)); 134 | std::cout << "->"; 135 | phi_debug_tree(TREE_OPERAND(t, 1)); 136 | break; 137 | case BIT_FIELD_REF: 138 | phi_debug_tree(TREE_OPERAND(t, 0)); 139 | std::cout << "->"; 140 | std::cout << "("; 141 | phi_debug_tree(TREE_OPERAND(t, 1)); 142 | std::cout << " : "; 143 | phi_debug_tree(TREE_OPERAND(t, 2)); 144 | std::cout << ")"; 145 | break; 146 | case ARRAY_REF: 147 | phi_debug_tree(TREE_OPERAND(t, 0)); 148 | std::cout << "["; 149 | phi_debug_tree(TREE_OPERAND(t, 1)); 150 | std::cout << "]"; 151 | break; 152 | case ARRAY_RANGE_REF: 153 | phi_debug_tree(TREE_OPERAND(t, 0)); 154 | std::cout << "["; 155 | phi_debug_tree(TREE_OPERAND(t, 1)); 156 | std::cout << ":"; 157 | // MAYBE RUNTIME EXCEPTION ?!!! 158 | phi_debug_tree(TREE_OPERAND(t, 2)); 159 | std::cout << "]"; 160 | break; 161 | case INDIRECT_REF: 162 | std::cout << "*"; 163 | phi_debug_tree(TREE_OPERAND(t, 0)); 164 | break; 165 | case CONSTRUCTOR: 166 | std::cout << "constructor"; 167 | break; 168 | case ADDR_EXPR: 169 | std::cout << "&"; 170 | phi_debug_tree(TREE_OPERAND(t, 0)); 171 | break; 172 | case TARGET_MEM_REF: 173 | std::cout << "TMR("; 174 | std::cout << "BASE: "; 175 | phi_debug_tree(TREE_OPERAND(t, 0)); 176 | std::cout << ", "; 177 | std::cout << "OFFSET: "; 178 | phi_debug_tree(TREE_OPERAND(t, 1)); 179 | std::cout << ", "; 180 | std::cout << "STEP: "; 181 | phi_debug_tree(TREE_OPERAND(t, 2)); 182 | std::cout << ", "; 183 | std::cout << "INDEX1: "; 184 | phi_debug_tree(TREE_OPERAND(t, 3)); 185 | std::cout << ", "; 186 | std::cout << "INDEX2: "; 187 | phi_debug_tree(TREE_OPERAND(t, 4)); 188 | std::cout << " )"; 189 | break; 190 | case MEM_REF: 191 | std::cout << "((typeof("; 192 | phi_debug_tree(TREE_OPERAND(t, 1)); 193 | std::cout << "))"; 194 | phi_debug_tree(TREE_OPERAND(t, 0)); 195 | std::cout << ")"; 196 | break; 197 | // SSA-name. 198 | case SSA_NAME: { 199 | gimple stmt = SSA_NAME_DEF_STMT(t); 200 | if (gimple_code(stmt) == GIMPLE_PHI) { 201 | std::cout << "(" << (SSA_NAME_IDENTIFIER(t) ? IDENTIFIER_POINTER(SSA_NAME_IDENTIFIER(t)) : "unk_ssa_name") << 202 | "__v" << SSA_NAME_VERSION(t); 203 | std::cout << " = GIMPLE_PHI("; 204 | for (unsigned int i = 0; i < gimple_phi_num_args(stmt); i++) { 205 | phi_debug_tree(gimple_phi_arg(stmt, i)->def); 206 | if (i != gimple_phi_num_args(stmt) - 1) { 207 | std::cout << ", "; 208 | } 209 | } 210 | std::cout << "))"; 211 | } else { 212 | std::cout << (SSA_NAME_IDENTIFIER(t) ? IDENTIFIER_POINTER(SSA_NAME_IDENTIFIER(t)) : "unk_ssa_name") << 213 | "__v" << SSA_NAME_VERSION(t); 214 | } 215 | 216 | break; 217 | } 218 | default: 219 | std::cout << "unk_tree_code(" << TREE_CODE(t) << ")"; 220 | break; 221 | } 222 | 223 | return 0; 224 | } 225 | 226 | static unsigned int phi_debug_op(enum tree_code code) 227 | { 228 | switch (code) { 229 | // Arithmetical operators. 230 | case POINTER_PLUS_EXPR: 231 | case PLUS_EXPR: 232 | std::cout << "+"; 233 | break; 234 | case NEGATE_EXPR: 235 | case MINUS_EXPR: 236 | std::cout << "-"; 237 | break; 238 | case MULT_EXPR: 239 | std::cout << "*"; 240 | break; 241 | case TRUNC_DIV_EXPR: 242 | case CEIL_DIV_EXPR: 243 | case FLOOR_DIV_EXPR: 244 | case ROUND_DIV_EXPR: 245 | case EXACT_DIV_EXPR: 246 | case RDIV_EXPR: 247 | std::cout << "/"; 248 | break; 249 | // Bit-shift operators. 250 | case LSHIFT_EXPR: 251 | std::cout << "<<"; 252 | break; 253 | case RSHIFT_EXPR: 254 | std::cout << ">>"; 255 | break; 256 | // Bit-logical operators. 257 | case BIT_IOR_EXPR: 258 | std::cout << "|"; 259 | break; 260 | case BIT_XOR_EXPR: 261 | std::cout << "^"; 262 | break; 263 | case BIT_AND_EXPR: 264 | std::cout << "&"; 265 | break; 266 | case BIT_NOT_EXPR: 267 | std::cout << "!"; 268 | break; 269 | // Truth-logical operators. 270 | case TRUTH_ANDIF_EXPR: 271 | case TRUTH_AND_EXPR: 272 | std::cout << "&&"; 273 | break; 274 | case TRUTH_ORIF_EXPR: 275 | case TRUTH_OR_EXPR: 276 | std::cout << "||"; 277 | break; 278 | case TRUTH_XOR_EXPR: 279 | std::cout << "^^"; 280 | break; 281 | case TRUTH_NOT_EXPR: 282 | std::cout << "!"; 283 | // Relational operators. 284 | case LT_EXPR: 285 | case UNLT_EXPR: 286 | std::cout << "<"; 287 | break; 288 | case LE_EXPR: 289 | case UNLE_EXPR: 290 | std::cout << "<="; 291 | break; 292 | case GT_EXPR: 293 | case UNGT_EXPR: 294 | std::cout << ">"; 295 | break; 296 | case GE_EXPR: 297 | case UNGE_EXPR: 298 | std::cout << ">="; 299 | break; 300 | case EQ_EXPR: 301 | case UNEQ_EXPR: 302 | std::cout << "=="; 303 | break; 304 | case NE_EXPR: 305 | case LTGT_EXPR: 306 | std::cout << "!="; 307 | break; 308 | case UNORDERED_EXPR: 309 | std::cout << "unord"; 310 | break; 311 | case ORDERED_EXPR: 312 | std::cout << "ord"; 313 | break; 314 | // Unknown operators. 315 | default: 316 | std::cout << "?(" << code << ")?"; 317 | break; 318 | } 319 | return 0; 320 | } 321 | 322 | static unsigned int phi_debug_on_gimple_assign(gimple stmt) 323 | { 324 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_ASSIGN\"" << " " << "(" << GIMPLE_ASSIGN << ")" << " { "; 325 | switch (gimple_num_ops(stmt)) { 326 | case 2: 327 | phi_debug_tree(gimple_assign_lhs(stmt)); 328 | std::cout << " = "; 329 | phi_debug_tree(gimple_assign_rhs1(stmt)); 330 | break; 331 | case 3: 332 | phi_debug_tree(gimple_assign_lhs(stmt)); 333 | std::cout << " = "; 334 | phi_debug_tree(gimple_assign_rhs1(stmt)); 335 | std::cout << " "; 336 | phi_debug_op(gimple_assign_rhs_code(stmt)); 337 | std::cout << " "; 338 | phi_debug_tree(gimple_assign_rhs2(stmt)); 339 | break; 340 | } 341 | std::cout << " }" << std::endl; 342 | 343 | return 0; 344 | } 345 | 346 | static unsigned int phi_debug_on_gimple_call(gimple stmt) 347 | { 348 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_CALL\"" << " " << "(" << GIMPLE_CALL << ")" << " { "; 349 | tree lhs = gimple_call_lhs (stmt); 350 | if (lhs) { 351 | phi_debug_tree(lhs); 352 | printf(" = "); 353 | } 354 | std::cout << fndecl_name(gimple_call_fndecl(stmt)) << "("; 355 | for (unsigned int i = 0; i < gimple_call_num_args(stmt); i++) { 356 | phi_debug_tree(gimple_call_arg(stmt, i)); 357 | if (i != gimple_call_num_args(stmt) - 1) { 358 | std::cout << ", "; 359 | } 360 | } 361 | std::cout << ")"; 362 | std::cout << " }" << std::endl; 363 | 364 | return 0; 365 | } 366 | 367 | /* 368 | static unsigned int phi_debug_on_gimple_phi(gimple stmt) 369 | { 370 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_PHI\"" << " "<< "(" << GIMPLE_PHI << ")" << " {"; 371 | for (unsigned int i = 0; i < gimple_phi_num_args(stmt); i++) { 372 | phi_debug_tree(gimple_phi_arg(stmt, i)->def); 373 | if (i != gimple_phi_num_args(stmt) - 1) { 374 | std::cout << ", "; 375 | } 376 | } 377 | std::cout << "}" << std::endl; 378 | 379 | return 0; 380 | } 381 | */ 382 | 383 | static unsigned int phi_debug_on_gimple_cond(gimple stmt) 384 | { 385 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_COND\"" << " " << "(" << GIMPLE_COND << ")" << " { "; 386 | phi_debug_tree(gimple_cond_lhs(stmt)); 387 | std::cout << " "; 388 | phi_debug_op(gimple_assign_rhs_code(stmt)); 389 | std::cout << " "; 390 | phi_debug_tree(gimple_cond_rhs(stmt)); 391 | std::cout << " }" << std::endl; 392 | 393 | return 0; 394 | } 395 | 396 | static unsigned int phi_debug_on_gimple_label(gimple stmt) { 397 | PREFIX_UNUSED(stmt); 398 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_LABEL\"" << " " << "(" << GIMPLE_LABEL << ")" << " {"; 399 | std::cout << "}" << std::endl; 400 | 401 | return 0; 402 | } 403 | 404 | static unsigned int phi_debug_on_gimple_return(gimple stmt) 405 | { 406 | PREFIX_UNUSED(stmt); 407 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_RETURN\"" << " " << "(" << GIMPLE_RETURN << ")" << " {"; 408 | std::cout << "}" << std::endl; 409 | 410 | return 0; 411 | } 412 | 413 | static unsigned int phi_debug_on_unknown_stmt(gimple stmt) 414 | { 415 | std::cout << "\t\t" << "stmt: " << "\"GIMPLE_UNKNOWN\"" << " " << "(" << gimple_code(stmt) << ")" << " {}" << std::endl; 416 | 417 | return 0; 418 | } 419 | 420 | 421 | static unsigned int phi_debug_statements(basic_block bb) 422 | { 423 | for (gimple_stmt_iterator gsi = gsi_start_bb(bb); !gsi_end_p(gsi); gsi_next(&gsi)) { 424 | gimple stmt = gsi_stmt(gsi); 425 | 426 | switch (gimple_code(stmt)) { 427 | case GIMPLE_ASSIGN: 428 | phi_debug_on_gimple_assign(stmt); 429 | break; 430 | case GIMPLE_CALL: 431 | phi_debug_on_gimple_call(stmt); 432 | break; 433 | /* 434 | case GIMPLE_PHI: 435 | phi_debug_on_gimple_phi(stmt); 436 | break; 437 | */ 438 | case GIMPLE_COND: 439 | phi_debug_on_gimple_cond(stmt); 440 | break; 441 | case GIMPLE_LABEL: 442 | phi_debug_on_gimple_label(stmt); 443 | break; 444 | case GIMPLE_RETURN: 445 | phi_debug_on_gimple_return(stmt); 446 | break; 447 | default: 448 | phi_debug_on_unknown_stmt(stmt); 449 | break; 450 | } 451 | } 452 | 453 | return 0; 454 | } 455 | 456 | static unsigned int phi_debug_function(function*fn) 457 | { 458 | std::cout << "func: " << "\"" << function_name(fn) << "\"" << " {" << std::endl; 459 | basic_block bb; 460 | FOR_EACH_BB_FN(bb, fn) { 461 | phi_debug_bb_id(bb); 462 | std::cout << " {" << std::endl; 463 | phi_debug_statements(bb); 464 | std::cout << "\t" << "}" << std::endl; 465 | } 466 | std::cout << "}" << std::endl; 467 | std::cout << std::endl; 468 | return 0; 469 | } 470 | 471 | unsigned int phi_debug_pass::execute(function*fn) { return phi_debug_function(fn); } 472 | 473 | static struct register_pass_info phi_debug_pass_info = { 474 | .pass = new phi_debug_pass(g), 475 | .reference_pass_name = "ssa", 476 | .ref_pass_instance_number = 1, 477 | .pos_op = PASS_POS_INSERT_AFTER, 478 | }; 479 | 480 | int plugin_init(struct plugin_name_args *args, struct plugin_gcc_version *version) 481 | { 482 | if(!plugin_default_version_check(version, &gcc_version)) { 483 | return 1; 484 | } 485 | 486 | register_callback(args->base_name, PLUGIN_INFO, NULL, &phi_debug_plugin_info); 487 | register_callback(args->base_name, PLUGIN_PASS_MANAGER_SETUP, NULL, &phi_debug_pass_info); 488 | 489 | return 0; 490 | } 491 | -------------------------------------------------------------------------------- /src/test/test.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int test_gimple_cst() { 6 | const int t = time(NULL); 7 | printf("%d", t); 8 | printf("%f", 5.25); 9 | printf("%f", 5.25f); 10 | int arr[] = { 1, 2, 3, 4, 5 }; 11 | printf("["); 12 | for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++) { 13 | printf("%d ", i); 14 | } 15 | printf("]"); 16 | return 0; 17 | } 18 | 19 | int test_gimple_arithm() { 20 | int a, b, c, d, e, f; 21 | scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f); 22 | int g; 23 | g = (a * b / c - f) ^ ((d << e) | f); 24 | return 0; 25 | } 26 | 27 | int test_gimple_phi() { 28 | int w, x, y, z; 29 | scanf("%d", &x); 30 | x = x - 3; 31 | if (x < 3) { 32 | y = x * 2; 33 | w = y; 34 | } else { 35 | y = x - 3; 36 | } 37 | w = x - y; 38 | z = x + y; 39 | printf("w: %d, x: %d, y: %d, z: %d", 40 | w, x, y, z); 41 | return 0; 42 | } 43 | 44 | struct TEST_MEM { 45 | int a; 46 | int b; 47 | int c; 48 | }; 49 | 50 | struct TEST_MEM*test_gimple_memory() { 51 | int n; 52 | scanf("%d", &n); 53 | struct TEST_MEM*arr = (struct TEST_MEM*) malloc(n * sizeof(struct TEST_MEM)); 54 | for (int i = 0; i < n; i++) { 55 | arr[i].a = i; 56 | arr[i].b = i * i; 57 | (arr + i)->c = i * i * i; 58 | } 59 | 60 | return arr; 61 | } 62 | 63 | int main() { 64 | test_gimple_cst(); 65 | test_gimple_arithm(); 66 | test_gimple_phi(); 67 | test_gimple_memory(); 68 | 69 | return 0; 70 | } 71 | -------------------------------------------------------------------------------- /src/test/test.c.018t.ssa: -------------------------------------------------------------------------------- 1 | 2 | ;; Function test_gimple_cst (test_gimple_cst, funcdef_no=2, decl_uid=2922, cgraph_uid=2, symbol_order=2) 3 | 4 | test_gimple_cst () 5 | { 6 | int i; 7 | int arr[5]; 8 | const int t; 9 | int D.2962; 10 | unsigned int i.0; 11 | long int D.2960; 12 | long int _5; 13 | unsigned int i.0_17; 14 | int _21; 15 | 16 | : 17 | _5 = time (0B); 18 | t_6 = (const int) _5; 19 | printf ("%d", t_6); 20 | printf ("%f", 5.25e+0); 21 | printf ("%f", 5.25e+0); 22 | arr[0] = 1; 23 | arr[1] = 2; 24 | arr[2] = 3; 25 | arr[3] = 4; 26 | arr[4] = 5; 27 | __builtin_putchar (91); 28 | i_16 = 0; 29 | goto ; 30 | 31 | : 32 | printf ("%d ", i_1); 33 | i_19 = i_1 + 1; 34 | 35 | : 36 | # i_1 = PHI 37 | i.0_17 = (unsigned int) i_1; 38 | if (i.0_17 <= 4) 39 | goto ; 40 | else 41 | goto ; 42 | 43 | : 44 | __builtin_putchar (93); 45 | _21 = 0; 46 | arr ={v} {CLOBBER}; 47 | 48 | : 49 | return _21; 50 | 51 | } 52 | 53 | 54 | 55 | ;; Function test_gimple_arithm (test_gimple_arithm, funcdef_no=3, decl_uid=2930, cgraph_uid=3, symbol_order=3) 56 | 57 | test_gimple_arithm () 58 | { 59 | int g; 60 | int f; 61 | int e; 62 | int d; 63 | int c; 64 | int b; 65 | int a; 66 | int D.2977; 67 | int D.2976; 68 | int f.7; 69 | int D.2974; 70 | int e.6; 71 | int d.5; 72 | int D.2971; 73 | int f.4; 74 | int D.2969; 75 | int c.3; 76 | int D.2967; 77 | int b.2; 78 | int a.1; 79 | int a.1_3; 80 | int b.2_4; 81 | int _5; 82 | int c.3_6; 83 | int _7; 84 | int f.4_8; 85 | int _9; 86 | int d.5_10; 87 | int e.6_11; 88 | int _12; 89 | int f.7_13; 90 | int _14; 91 | int _16; 92 | 93 | : 94 | scanf ("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f); 95 | a.1_3 = a; 96 | b.2_4 = b; 97 | _5 = a.1_3 * b.2_4; 98 | c.3_6 = c; 99 | _7 = _5 / c.3_6; 100 | f.4_8 = f; 101 | _9 = _7 - f.4_8; 102 | d.5_10 = d; 103 | e.6_11 = e; 104 | _12 = d.5_10 << e.6_11; 105 | f.7_13 = f; 106 | _14 = _12 | f.7_13; 107 | g_15 = _9 ^ _14; 108 | _16 = 0; 109 | a ={v} {CLOBBER}; 110 | b ={v} {CLOBBER}; 111 | c ={v} {CLOBBER}; 112 | d ={v} {CLOBBER}; 113 | e ={v} {CLOBBER}; 114 | f ={v} {CLOBBER}; 115 | 116 | : 117 | return _16; 118 | 119 | } 120 | 121 | 122 | 123 | ;; Function test_gimple_phi (test_gimple_phi, funcdef_no=4, decl_uid=2939, cgraph_uid=4, symbol_order=4) 124 | 125 | test_gimple_phi () 126 | { 127 | int z; 128 | int y; 129 | int x; 130 | int w; 131 | int D.2991; 132 | int x.15; 133 | int x.14; 134 | int x.13; 135 | int x.12; 136 | int x.11; 137 | int x.10; 138 | int x.9; 139 | int x.8; 140 | int x.8_4; 141 | int x.9_5; 142 | int x.10_7; 143 | int x.11_8; 144 | int x.12_11; 145 | int x.13_13; 146 | int x.14_15; 147 | int x.15_17; 148 | int _19; 149 | 150 | : 151 | scanf ("%d", &x); 152 | x.8_4 = x; 153 | x.9_5 = x.8_4 + -3; 154 | x = x.9_5; 155 | x.10_7 = x; 156 | if (x.10_7 <= 2) 157 | goto ; 158 | else 159 | goto ; 160 | 161 | : 162 | x.11_8 = x; 163 | y_9 = x.11_8 * 2; 164 | w_10 = y_9; 165 | goto ; 166 | 167 | : 168 | x.12_11 = x; 169 | y_12 = x.12_11 + -3; 170 | 171 | : 172 | # y_1 = PHI 173 | x.13_13 = x; 174 | w_14 = x.13_13 - y_1; 175 | x.14_15 = x; 176 | z_16 = x.14_15 + y_1; 177 | x.15_17 = x; 178 | printf ("w: %d, x: %d, y: %d, z: %d", w_14, x.15_17, y_1, z_16); 179 | _19 = 0; 180 | x ={v} {CLOBBER}; 181 | 182 | : 183 | return _19; 184 | 185 | } 186 | 187 | 188 | 189 | ;; Function test_gimple_memory (test_gimple_memory, funcdef_no=5, decl_uid=2949, cgraph_uid=5, symbol_order=5) 190 | 191 | test_gimple_memory () 192 | { 193 | int i; 194 | struct TEST_MEM * arr; 195 | int n; 196 | struct TEST_MEM * D.3010; 197 | int n.17; 198 | int D.3008; 199 | int D.3007; 200 | struct TEST_MEM * D.3006; 201 | long unsigned int D.3005; 202 | long unsigned int D.3004; 203 | int D.3003; 204 | struct TEST_MEM * D.3002; 205 | long unsigned int D.3001; 206 | long unsigned int D.3000; 207 | struct TEST_MEM * D.2999; 208 | long unsigned int D.2998; 209 | long unsigned int D.2997; 210 | long unsigned int D.2996; 211 | long unsigned int D.2995; 212 | int n.16; 213 | int n.16_5; 214 | long unsigned int _6; 215 | long unsigned int _7; 216 | int n.17_11; 217 | long unsigned int _12; 218 | long unsigned int _13; 219 | struct TEST_MEM * _14; 220 | long unsigned int _16; 221 | long unsigned int _17; 222 | struct TEST_MEM * _18; 223 | int _19; 224 | long unsigned int _21; 225 | long unsigned int _22; 226 | struct TEST_MEM * _23; 227 | int _24; 228 | int _25; 229 | struct TEST_MEM * _28; 230 | 231 | : 232 | scanf ("%d", &n); 233 | n.16_5 = n; 234 | _6 = (long unsigned int) n.16_5; 235 | _7 = _6 * 12; 236 | arr_9 = malloc (_7); 237 | i_10 = 0; 238 | goto ; 239 | 240 | : 241 | _12 = (long unsigned int) i_1; 242 | _13 = _12 * 12; 243 | _14 = arr_9 + _13; 244 | _14->a = i_1; 245 | _16 = (long unsigned int) i_1; 246 | _17 = _16 * 12; 247 | _18 = arr_9 + _17; 248 | _19 = i_1 * i_1; 249 | _18->b = _19; 250 | _21 = (long unsigned int) i_1; 251 | _22 = _21 * 12; 252 | _23 = arr_9 + _22; 253 | _24 = i_1 * i_1; 254 | _25 = _24 * i_1; 255 | _23->c = _25; 256 | i_27 = i_1 + 1; 257 | 258 | : 259 | # i_1 = PHI 260 | n.17_11 = n; 261 | if (i_1 < n.17_11) 262 | goto ; 263 | else 264 | goto ; 265 | 266 | : 267 | _28 = arr_9; 268 | n ={v} {CLOBBER}; 269 | 270 | : 271 | return _28; 272 | 273 | } 274 | 275 | 276 | 277 | ;; Function main (main, funcdef_no=6, decl_uid=2957, cgraph_uid=6, symbol_order=6) 278 | 279 | main () 280 | { 281 | int D.3013; 282 | int _6; 283 | 284 | : 285 | test_gimple_cst (); 286 | test_gimple_arithm (); 287 | test_gimple_phi (); 288 | test_gimple_memory (); 289 | _6 = 0; 290 | 291 | : 292 | return _6; 293 | 294 | } 295 | 296 | 297 | -------------------------------------------------------------------------------- /src/test/test.c.018t.ssa.dot: -------------------------------------------------------------------------------- 1 | digraph "test.c.018t.ssa" { 2 | overlap=false; 3 | subgraph "cluster_test_gimple_cst" { 4 | style="dashed"; 5 | color="black"; 6 | label="test_gimple_cst ()"; 7 | subgraph cluster_2_1 { 8 | style="filled"; 9 | color="darkgreen"; 10 | fillcolor="grey88"; 11 | label="loop 1"; 12 | labeljust=l; 13 | penwidth=2; 14 | fn_2_basic_block_4 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 15 | |#\ i_1\ =\ PHI\ \\l\ 16 | |i.0_17\ =\ (unsigned\ int)\ i_1;\l\ 17 | |if\ (i.0_17\ \<=\ 4)\l\ 18 | \ \ goto\ \;\l\ 19 | else\l\ 20 | \ \ goto\ \;\l\ 21 | }"]; 22 | 23 | fn_2_basic_block_3 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 24 | |printf\ (\"%d\ \",\ i_1);\l\ 25 | |i_19\ =\ i_1\ +\ 1;\l\ 26 | }"]; 27 | 28 | } 29 | fn_2_basic_block_0 [shape=Mdiamond,style=filled,fillcolor=white,label="ENTRY"]; 30 | 31 | fn_2_basic_block_1 [shape=Mdiamond,style=filled,fillcolor=white,label="EXIT"]; 32 | 33 | fn_2_basic_block_2 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 34 | |_5\ =\ time\ (0B);\l\ 35 | |t_6\ =\ (const\ int)\ _5;\l\ 36 | |printf\ (\"%d\",\ t_6);\l\ 37 | |printf\ (\"%f\",\ 5.25e+0);\l\ 38 | |printf\ (\"%f\",\ 5.25e+0);\l\ 39 | |arr[0]\ =\ 1;\l\ 40 | |arr[1]\ =\ 2;\l\ 41 | |arr[2]\ =\ 3;\l\ 42 | |arr[3]\ =\ 4;\l\ 43 | |arr[4]\ =\ 5;\l\ 44 | |__builtin_putchar\ (91);\l\ 45 | |i_16\ =\ 0;\l\ 46 | goto\ \;\l\ 47 | }"]; 48 | 49 | fn_2_basic_block_5 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 50 | |__builtin_putchar\ (93);\l\ 51 | |_21\ =\ 0;\l\ 52 | |arr\ =\{v\}\ \{CLOBBER\};\l\ 53 | }"]; 54 | 55 | fn_2_basic_block_6 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 56 | |\:\l\ 57 | |return\ _21;\l\ 58 | }"]; 59 | 60 | fn_2_basic_block_0:s -> fn_2_basic_block_2:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 61 | fn_2_basic_block_2:s -> fn_2_basic_block_4:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 62 | fn_2_basic_block_3:s -> fn_2_basic_block_4:n [style="dotted,bold",color=blue,weight=10,constraint=false, label="[0%]"]; 63 | fn_2_basic_block_4:s -> fn_2_basic_block_3:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 64 | fn_2_basic_block_4:s -> fn_2_basic_block_5:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 65 | fn_2_basic_block_5:s -> fn_2_basic_block_6:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 66 | fn_2_basic_block_6:s -> fn_2_basic_block_1:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 67 | fn_2_basic_block_0:s -> fn_2_basic_block_1:n [style="invis",constraint=true]; 68 | } 69 | subgraph "cluster_test_gimple_arithm" { 70 | style="dashed"; 71 | color="black"; 72 | label="test_gimple_arithm ()"; 73 | fn_3_basic_block_0 [shape=Mdiamond,style=filled,fillcolor=white,label="ENTRY"]; 74 | 75 | fn_3_basic_block_1 [shape=Mdiamond,style=filled,fillcolor=white,label="EXIT"]; 76 | 77 | fn_3_basic_block_2 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 78 | |scanf\ (\"%d%d%d%d%d%d\",\ &a,\ &b,\ &c,\ &d,\ &e,\ &f);\l\ 79 | |a.1_3\ =\ a;\l\ 80 | |b.2_4\ =\ b;\l\ 81 | |_5\ =\ a.1_3\ *\ b.2_4;\l\ 82 | |c.3_6\ =\ c;\l\ 83 | |_7\ =\ _5\ /\ c.3_6;\l\ 84 | |f.4_8\ =\ f;\l\ 85 | |_9\ =\ _7\ -\ f.4_8;\l\ 86 | |d.5_10\ =\ d;\l\ 87 | |e.6_11\ =\ e;\l\ 88 | |_12\ =\ d.5_10\ \<\<\ e.6_11;\l\ 89 | |f.7_13\ =\ f;\l\ 90 | |_14\ =\ _12\ \|\ f.7_13;\l\ 91 | |g_15\ =\ _9\ ^\ _14;\l\ 92 | |_16\ =\ 0;\l\ 93 | |a\ =\{v\}\ \{CLOBBER\};\l\ 94 | |b\ =\{v\}\ \{CLOBBER\};\l\ 95 | |c\ =\{v\}\ \{CLOBBER\};\l\ 96 | |d\ =\{v\}\ \{CLOBBER\};\l\ 97 | |e\ =\{v\}\ \{CLOBBER\};\l\ 98 | |f\ =\{v\}\ \{CLOBBER\};\l\ 99 | }"]; 100 | 101 | fn_3_basic_block_3 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 102 | |\:\l\ 103 | |return\ _16;\l\ 104 | }"]; 105 | 106 | fn_3_basic_block_0:s -> fn_3_basic_block_2:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 107 | fn_3_basic_block_2:s -> fn_3_basic_block_3:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 108 | fn_3_basic_block_3:s -> fn_3_basic_block_1:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 109 | fn_3_basic_block_0:s -> fn_3_basic_block_1:n [style="invis",constraint=true]; 110 | } 111 | subgraph "cluster_test_gimple_phi" { 112 | style="dashed"; 113 | color="black"; 114 | label="test_gimple_phi ()"; 115 | fn_4_basic_block_0 [shape=Mdiamond,style=filled,fillcolor=white,label="ENTRY"]; 116 | 117 | fn_4_basic_block_1 [shape=Mdiamond,style=filled,fillcolor=white,label="EXIT"]; 118 | 119 | fn_4_basic_block_2 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 120 | |scanf\ (\"%d\",\ &x);\l\ 121 | |x.8_4\ =\ x;\l\ 122 | |x.9_5\ =\ x.8_4\ +\ -3;\l\ 123 | |x\ =\ x.9_5;\l\ 124 | |x.10_7\ =\ x;\l\ 125 | |if\ (x.10_7\ \<=\ 2)\l\ 126 | \ \ goto\ \;\l\ 127 | else\l\ 128 | \ \ goto\ \;\l\ 129 | }"]; 130 | 131 | fn_4_basic_block_3 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 132 | |x.11_8\ =\ x;\l\ 133 | |y_9\ =\ x.11_8\ *\ 2;\l\ 134 | |w_10\ =\ y_9;\l\ 135 | goto\ \;\l\ 136 | }"]; 137 | 138 | fn_4_basic_block_4 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 139 | |x.12_11\ =\ x;\l\ 140 | |y_12\ =\ x.12_11\ +\ -3;\l\ 141 | }"]; 142 | 143 | fn_4_basic_block_5 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 144 | |#\ y_1\ =\ PHI\ \\l\ 145 | |x.13_13\ =\ x;\l\ 146 | |w_14\ =\ x.13_13\ -\ y_1;\l\ 147 | |x.14_15\ =\ x;\l\ 148 | |z_16\ =\ x.14_15\ +\ y_1;\l\ 149 | |x.15_17\ =\ x;\l\ 150 | |printf\ (\"w:\ %d,\ x:\ %d,\ y:\ %d,\ z:\ %d\",\ w_14,\ x.15_17,\ y_1,\ z_16);\l\ 151 | |_19\ =\ 0;\l\ 152 | |x\ =\{v\}\ \{CLOBBER\};\l\ 153 | }"]; 154 | 155 | fn_4_basic_block_6 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 156 | |\:\l\ 157 | |return\ _19;\l\ 158 | }"]; 159 | 160 | fn_4_basic_block_0:s -> fn_4_basic_block_2:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 161 | fn_4_basic_block_2:s -> fn_4_basic_block_3:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 162 | fn_4_basic_block_2:s -> fn_4_basic_block_4:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 163 | fn_4_basic_block_3:s -> fn_4_basic_block_5:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 164 | fn_4_basic_block_4:s -> fn_4_basic_block_5:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 165 | fn_4_basic_block_5:s -> fn_4_basic_block_6:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 166 | fn_4_basic_block_6:s -> fn_4_basic_block_1:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 167 | fn_4_basic_block_0:s -> fn_4_basic_block_1:n [style="invis",constraint=true]; 168 | } 169 | subgraph "cluster_test_gimple_memory" { 170 | style="dashed"; 171 | color="black"; 172 | label="test_gimple_memory ()"; 173 | subgraph cluster_5_1 { 174 | style="filled"; 175 | color="darkgreen"; 176 | fillcolor="grey88"; 177 | label="loop 1"; 178 | labeljust=l; 179 | penwidth=2; 180 | fn_5_basic_block_4 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 181 | |#\ i_1\ =\ PHI\ \\l\ 182 | |n.17_11\ =\ n;\l\ 183 | |if\ (i_1\ \<\ n.17_11)\l\ 184 | \ \ goto\ \;\l\ 185 | else\l\ 186 | \ \ goto\ \;\l\ 187 | }"]; 188 | 189 | fn_5_basic_block_3 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 190 | |_12\ =\ (long\ unsigned\ int)\ i_1;\l\ 191 | |_13\ =\ _12\ *\ 12;\l\ 192 | |_14\ =\ arr_9\ +\ _13;\l\ 193 | |_14-\>a\ =\ i_1;\l\ 194 | |_16\ =\ (long\ unsigned\ int)\ i_1;\l\ 195 | |_17\ =\ _16\ *\ 12;\l\ 196 | |_18\ =\ arr_9\ +\ _17;\l\ 197 | |_19\ =\ i_1\ *\ i_1;\l\ 198 | |_18-\>b\ =\ _19;\l\ 199 | |_21\ =\ (long\ unsigned\ int)\ i_1;\l\ 200 | |_22\ =\ _21\ *\ 12;\l\ 201 | |_23\ =\ arr_9\ +\ _22;\l\ 202 | |_24\ =\ i_1\ *\ i_1;\l\ 203 | |_25\ =\ _24\ *\ i_1;\l\ 204 | |_23-\>c\ =\ _25;\l\ 205 | |i_27\ =\ i_1\ +\ 1;\l\ 206 | }"]; 207 | 208 | } 209 | fn_5_basic_block_0 [shape=Mdiamond,style=filled,fillcolor=white,label="ENTRY"]; 210 | 211 | fn_5_basic_block_1 [shape=Mdiamond,style=filled,fillcolor=white,label="EXIT"]; 212 | 213 | fn_5_basic_block_2 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 214 | |scanf\ (\"%d\",\ &n);\l\ 215 | |n.16_5\ =\ n;\l\ 216 | |_6\ =\ (long\ unsigned\ int)\ n.16_5;\l\ 217 | |_7\ =\ _6\ *\ 12;\l\ 218 | |arr_9\ =\ malloc\ (_7);\l\ 219 | |i_10\ =\ 0;\l\ 220 | goto\ \;\l\ 221 | }"]; 222 | 223 | fn_5_basic_block_5 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 224 | |_28\ =\ arr_9;\l\ 225 | |n\ =\{v\}\ \{CLOBBER\};\l\ 226 | }"]; 227 | 228 | fn_5_basic_block_6 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 229 | |\:\l\ 230 | |return\ _28;\l\ 231 | }"]; 232 | 233 | fn_5_basic_block_0:s -> fn_5_basic_block_2:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 234 | fn_5_basic_block_2:s -> fn_5_basic_block_4:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 235 | fn_5_basic_block_3:s -> fn_5_basic_block_4:n [style="dotted,bold",color=blue,weight=10,constraint=false, label="[0%]"]; 236 | fn_5_basic_block_4:s -> fn_5_basic_block_3:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 237 | fn_5_basic_block_4:s -> fn_5_basic_block_5:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 238 | fn_5_basic_block_5:s -> fn_5_basic_block_6:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 239 | fn_5_basic_block_6:s -> fn_5_basic_block_1:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 240 | fn_5_basic_block_0:s -> fn_5_basic_block_1:n [style="invis",constraint=true]; 241 | } 242 | subgraph "cluster_main" { 243 | style="dashed"; 244 | color="black"; 245 | label="main ()"; 246 | fn_6_basic_block_0 [shape=Mdiamond,style=filled,fillcolor=white,label="ENTRY"]; 247 | 248 | fn_6_basic_block_1 [shape=Mdiamond,style=filled,fillcolor=white,label="EXIT"]; 249 | 250 | fn_6_basic_block_2 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 251 | |test_gimple_cst\ ();\l\ 252 | |test_gimple_arithm\ ();\l\ 253 | |test_gimple_phi\ ();\l\ 254 | |test_gimple_memory\ ();\l\ 255 | |_6\ =\ 0;\l\ 256 | }"]; 257 | 258 | fn_6_basic_block_3 [shape=record,style=filled,fillcolor=lightgrey,label="{ FREQ:0 |\:\l\ 259 | |\:\l\ 260 | |return\ _6;\l\ 261 | }"]; 262 | 263 | fn_6_basic_block_0:s -> fn_6_basic_block_2:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 264 | fn_6_basic_block_2:s -> fn_6_basic_block_3:n [style="solid,bold",color=blue,weight=100,constraint=true, label="[0%]"]; 265 | fn_6_basic_block_3:s -> fn_6_basic_block_1:n [style="solid,bold",color=black,weight=10,constraint=true, label="[0%]"]; 266 | fn_6_basic_block_0:s -> fn_6_basic_block_1:n [style="invis",constraint=true]; 267 | } 268 | } 269 | --------------------------------------------------------------------------------