diff --git a/CHANGELOG.md b/CHANGELOG.md new file mode 100644 --- /dev/null +++ b/CHANGELOG.md @@ -0,0 +1,11 @@ +# Changelog + +`stackcollapse-ghc` uses [PVP Versioning][1]. +The changelog is available [on GitHub][2]. + +## 0.0.1 + +* Initially created. + +[1]: https://pvp.haskell.org +[2]: https://github.com/marcin-rzeznicki/stackcollapse-ghc/releases diff --git a/LICENSE b/LICENSE new file mode 100644 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100644 --- /dev/null +++ b/README.md @@ -0,0 +1,159 @@ +# stackcollapse-ghc + +[![Build status](https://img.shields.io/travis/marcin-rzeznicki/stackcollapse-ghc.svg?logo=travis)](https://travis-ci.org/marcin-rzeznicki/stackcollapse-ghc) +[![Hackage](https://img.shields.io/hackage/v/stackcollapse-ghc.svg?logo=haskell)](https://hackage.haskell.org/package/stackcollapse-ghc) +[![Stackage Lts](http://stackage.org/package/stackcollapse-ghc/badge/lts)](http://stackage.org/lts/package/stackcollapse-ghc) +[![Stackage Nightly](http://stackage.org/package/stackcollapse-ghc/badge/nightly)](http://stackage.org/nightly/package/stackcollapse-ghc) +[![GPL-3.0-only license](https://img.shields.io/badge/license-GPL--3.0--only-blue.svg)](LICENSE) + +Program to fold GHC prof files into flamegraph input + +## Motivation + +The reasons why this package exists despite other packages with similar functionality (not including the NIH syndrome) boil down to: +* it does only one thing (stack collapsing), so it's up to the user to install flamegraph scripts, pass options etc (in my eyes it's not a limitation, on the contrary), +* output control: annotations (color profiles), extending traces from a configured set of modules with the source locations or toggling qualified names, +* precise ticks and/or bytes with `-p` reports, +* it's fast + +Table of Contents +----------------- + * [Basic usage](#basic-usage) + * [Ticks](#visualize-ticks) + * [Allocations](#visualize-allocations) + * [Cookbook](#cookbook) + * [Colors](#using-distinct-colors-for-modules) + * [Qualified names](#turning-off-qualified-names) + * [Source locations](#adding-source-locations) + * [All options](#all-options) + * [Installation](#installation) + +## Basic usage + +(all the following examples assume you have installed `flamegraph` on your path) + +### Visualize ticks + +If you have a detailed prof file (`-P` RTS option) + +```bash +stackcollapse-ghc prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks > path_to_svg +``` + +If you have a standard prof file (`-p` RTS option) + +```bash +stackcollapse-ghc -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks > path_to_svg +``` + +![Ticks](./examples/basicTime.svg) + +### Visualize allocations + +If you have a detailed prof file (`-P` RTS option) + +```bash +stackcollapse-ghc --alloc prof_file | flamegraph.pl --title 'Example' --subtitle 'Bytes allocated' --countname bytes > path_to_svg +``` + +If you have a standard prof file (`-p` RTS option) + +```bash +stackcollapse-ghc --alloc -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Bytes allocated' --countname bytes > path_to_svg +``` + +![Bytes](./examples/basicAlloc.svg) + +## Cookbook + +### Using distinct colors for modules + +Works out of the box. You just need to tell the program which modules are "yours" (by default it only assumes `Main`) and pass the desired color scheme to the flamegraph script + +```bash +stackcollapse-ghc -u Example prof_file | flamegraph.pl --title 'Example with colors' --subtitle 'Time' --countname ticks --color java > path_to_svg +``` + +(the traces coming from your modules are green under this palette) + +![JavaColor](./examples/javaColor.svg) + +Or you can use the `mem` pallette to track allocations + +```bash +stackcollapse-ghc -u Example --alloc -p prof_file | flamegraph.pl --title 'Example with colors' --subtitle 'Bytes allocated' --countname bytes --color mem > path_to_svg +``` + +![MemColor](./examples/memColor.svg) + +This is achieved by using a thing called _annotations_. `stackcollapse-ghc` adds the annotation `_[j]` to traces from modules in `-u`, `_[i]` to _CAFs_ and `_[k]` to the "kernel" modules, such as `GHC` or `System` + +### Turning off qualified names + +You might want to tone down the visual clutter in your flamegraph by turning off the qualified names for some modules. You can use the `-u` option for this just as in the color pallete examples. Traces from the modules that you have passed in `-u` will have unqualified names by default + +```bash +stackcollapse-ghc -u Example -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks > path_to_svg +``` + +![UserModules](./examples/userModules.svg) + +If you want to use visual indications *and* retain qualified names you can use the following option + +```bash +stackcollapse-ghc -Q -u Example -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks --color java > path_to_svg +``` + +### Adding source locations + +If you want to see the source of the traces on the generated flamegraph, you can do it selectively by combining `-u` options to mark the modules for which you want to include locations, with `-s` + +```bash +stackcollapse-ghc -s -u Example prof_file | flamegraph.pl --title 'Example with sources' --subtitle 'Time' --countname ticks > path_to_svg +``` + +![UserSources](./examples/userSrc.svg) + +Alternatively, you can simply include it for all traces (with or without `-u` depending on whether you need it for something else, such as colors or qualified names) + +```bash +stackcollapse-ghc -S prof_file | flamegraph.pl --title 'Example with sources' --subtitle 'Time' --countname ticks > path_to_svg +``` + +![AllSources](./examples/allSrc.svg) + +## All options + +``` +Usage: stackcollapse-ghc [OPTIONS] FILE +OPTIONS: + -P Process detailed prof file ('-P' or '-pa' options) (default) + -p Process standard prof file ('-p' option) + -u module_name --user-module=module_name Name of an user module (may be repeated to add more than one). Matches the whole "hierarchy", so `MyModule` matches `MyModule` as well as `MyModule.Internal` + -t --time Collapse with respect to time (default) + -a --alloc Collapse with respect to allocations + -S Append source location to every function name + -s Append source location to functions defined in user modules + --no-source Do not append source location (default) + -Q Always use qualified functon names + --no-qualified Do not use qualified function names + -q Use qualified names for functions not defined in user modules (default) + -A --annotations, --annot Add annotations to output (j - user modules, k - GHC and System, i - CAFs) + --no-annotations, --no-annot Do not add annotations to output + +``` + +## Installation + +You can install it from [Hackage](https://hackage.haskell.org/) or [Stackage](https://www.stackage.org/) by using either `cabal`: + +``` +cabal v2-update +cabal v2-install stackcollapse-ghc +``` + +or `stack` + +``` +stack install stackcollapse-ghc +``` diff --git a/app/Main.hs b/app/Main.hs new file mode 100644 --- /dev/null +++ b/app/Main.hs @@ -0,0 +1,152 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +module Main (main) where + +import Config +import UserModule +import StackCollapse +import System.Console.GetOpt +import System.Environment (getArgs, getProgName) +import System.Exit +import System.IO (Handle, hPutStrLn, stderr, hPutChar, stdout) +import Data.Functor ((<&>)) +import Data.Function ((&)) +import Control.Monad (foldM) +import Control.Exception +import qualified Data.ByteString.Lazy as Lazy + +cmdLineOpts + :: [OptDescr (StackCollapseConfig -> Either String StackCollapseConfig)] +cmdLineOpts = + [ Option + ['P'] + [] + (NoArg $ \config -> Right config { inputType = Detailed }) + "Process detailed prof file ('-P' or '-pa' options) (default)" + , Option + ['p'] + [] + (NoArg $ \config -> Right config { inputType = Standard }) + "Process standard prof file ('-p' option)" + , Option + ['u'] + ["user-module"] + (ReqArg + (\input config -> parseUserModule input <&> prependUserModule config) + "module_name") + "Name of an user module (may be repeated to add more than one). Matches the whole \"hierarchy\", so `MyModule` matches `MyModule` as well as `MyModule.Internal`" + , Option + ['t'] + ["time"] + (NoArg $ \config -> Right config { operationMode = Time }) + "Collapse with respect to time (default)" + , Option + ['a'] + ["alloc"] + (NoArg $ \config -> Right config { operationMode = Alloc }) + "Collapse with respect to allocations" + , Option + ['S'] + [] + (NoArg $ \config -> Right config { sourceMode = SourceAlways }) + "Append source location to every function name" + , Option + ['s'] + [] + (NoArg $ \config -> Right config { sourceMode = SourceUser }) + "Append source location to functions defined in user modules" + , Option + [] + ["no-source"] + (NoArg $ \config -> Right config { sourceMode = SourceNever }) + "Do not append source location (default)" + , Option + ['Q'] + [] + (NoArg $ \config -> Right config { functionNameMode = QualifiedAlways }) + "Always use qualified functon names" + , Option + [] + ["no-qualified"] + (NoArg $ \config -> Right config { functionNameMode = QualifiedNever }) + "Do not use qualified function names" + , Option + ['q'] + [] + (NoArg $ \config -> Right config { functionNameMode = QualifiedKernel }) + "Use qualified names for functions not defined in user modules (default)" + , Option + ['A'] + ["annotations", "annot"] + (NoArg $ \config -> Right config { annotationMode = WithAnnotations }) + "Add annotations to output (j - user modules, k - GHC and System, i - CAFs)" + , Option + [] + ["no-annotations", "no-annot"] + (NoArg $ \config -> Right config { annotationMode = NoAnnotations }) + "Do not add annotations to output"] + +main :: IO () +main = getArgs >>= run + +run :: [String] -> IO () +run [] = printUsage stdout +run ["-h"] = printUsage stdout +run ["--help"] = printUsage stdout +run args = case getOpt RequireOrder cmdLineOpts args of + (opts, [path], []) -> do + let configOrError = foldM (&) defaultConfig opts + either + invalidArgumentError + ((`catch` runtimeError) . runStackCollapse path) + configOrError + (_, _, errors) -> invalidUsageError errors + +runStackCollapse :: FilePath -> StackCollapseConfig -> IO () +runStackCollapse inpath config = stackCollapseFromPath config inpath + >>= either (runtimeError . userError) Lazy.putStrLn . collapseStack + +printUsage :: Handle -> IO () +printUsage h = do + exe <- getProgName + hPutChar h '\n' + hPutStrLn h + $ usageInfo ("Usage: " ++ exe ++ " [OPTIONS] FILE\nOPTIONS:") cmdLineOpts + hPutChar h '\n' + +invalidUsageError :: [String] -> IO a +invalidUsageError errorMessages = do + let errorMessage = concat errorMessages + putErrLn errorMessage + printUsage stderr + exitFailure + +invalidArgumentError :: String -> IO a +invalidArgumentError errorMessage = do + putErrLn $ "Invalid argument: " ++ errorMessage + exitFailure + +runtimeError :: IOError -> IO a +runtimeError ioerror = do + putErrLn $ displayException ioerror + exitWith $ ExitFailure 2 + +putErrLn :: String -> IO () +putErrLn = hPutStrLn stderr + + + diff --git a/src/CallTree.hs b/src/CallTree.hs new file mode 100644 --- /dev/null +++ b/src/CallTree.hs @@ -0,0 +1,50 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE LambdaCase #-} + +module CallTree (CallTree(..), insertTrace, CallForest, extractForest) where + +import Trace +import Data.Tree.Zipper +import Data.Tree + +data CallTree = MkTree !Int (TreePos Full Trace) + | EmptyTree + +insertTrace :: Trace -> Int -> CallTree -> Either String CallTree +insertTrace trace 0 EmptyTree = Right $ MkTree 0 $ fromTree $ Node trace [] +insertTrace _ _ EmptyTree = Left "the first line should not be indented" +insertTrace trace level (MkTree depth cursor) + | level == succ depth = Right $ MkTree level $ insertChild cursor + | level <= depth = MkTree level <$> insertSibling (depth - level) cursor + | otherwise = Left "invalid indentation" + where + newNode = Node trace [] + + insertChild = insert newNode . children + + insertSibling 0 = Right . insert newNode . nextSpace + insertSibling up = (\case + Just parent' -> insertSibling (up - 1) parent' + Nothing -> Left "bug: no parent") + . parent + +type CallForest = Forest Trace + +extractForest :: CallTree -> CallForest +extractForest EmptyTree = [] +extractForest (MkTree _ cursor) = toForest cursor diff --git a/src/CallTreeBuilder.hs b/src/CallTreeBuilder.hs new file mode 100644 --- /dev/null +++ b/src/CallTreeBuilder.hs @@ -0,0 +1,99 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE NamedFieldPuns #-} +{-# LANGUAGE OverloadedStrings #-} + +module CallTreeBuilder + ( NumberedLine + , numberedLines + , tryBuildCallForest + , CallForest + , OperationMode) where + +import Format (MayFail, ColumnList, Format, Inherited(..)) +import CallTree +import Config (OperationMode(..)) +import Data.ByteString (ByteString) +import qualified Data.ByteString.Char8 as Char8 +import Control.Foldl (FoldM(..), foldM) +import Control.Monad.Trans.State +import Control.Arrow + +type NumberedLine = (Int, ByteString) + +numberedLines :: ByteString -> [NumberedLine] +numberedLines = zip [1 :: Int ..] . Char8.lines + +tryBuildCallForest + :: Format -> OperationMode -> [NumberedLine] -> MayFail CallForest +tryBuildCallForest format opMode nls = + evalStateT (foldM builder $ map (second splitLine) nls) Building + where + builder = callTreeBuilder format opMode + +type CallTreeBuilder = + FoldM (StateT BuilderState MayFail) NumberedRow CallForest + +type NumberedRow = (Int, Row) + +data BuilderState = Skipping Int + | Building + +callTreeBuilder :: Format -> OperationMode -> CallTreeBuilder +callTreeBuilder format opMode = FoldM + (\tree -> StateT . build tree) + (return EmptyTree) + (return . extractForest) + where + build callTree (_, Row { level }) (Skipping depth) + | level > depth = return (callTree, Skipping depth) + build callTree (lineNumber, Row { level, columns }) _ = do + (trace, inherited) <- format' lineNumber columns + a <- insertTrace trace level callTree + let s = if skip inherited + then Skipping level + else Building + return (a, s) + + skip = case opMode of + Time -> (== 0.0) . inheritedTime + Alloc -> (== 0.0) . inheritedAlloc + + format' lineNumber = left (printErrorLocation lineNumber ++) . format + + printErrorLocation + lineNumber = "confused at line " ++ show lineNumber ++ ": " + +data Row = Row { level :: !Int, columns :: ColumnList } + +splitLine :: ByteString -> Row +splitLine line = Row { level = Char8.length ident, columns = splitLine' rest } + where + (ident, rest) = Char8.span (== ' ') line + + splitLine' bs + | Char8.null bs = [] + | otherwise = case Char8.head bs of + ' ' -> splitLine' $ Char8.dropWhile (== ' ') bs + '<' + | "" `Char8.isPrefixOf` bs + -> let (nli, bs') = Char8.splitAt 18 bs + in nli:splitLine' bs' + _ -> let (column, bs') = Char8.break (== ' ') bs + in column:splitLine' bs' + + diff --git a/src/Config.hs b/src/Config.hs new file mode 100644 --- /dev/null +++ b/src/Config.hs @@ -0,0 +1,75 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE DerivingStrategies #-} +{-# LANGUAGE NamedFieldPuns #-} + +module Config + ( StackCollapseConfig(..) + , defaultConfig + , InputType(..) + , SourceMode(..) + , FunctionNameMode(..) + , OperationMode(..) + , AnnotationMode(..) + , prependUserModule) where + +import UserModule + +data StackCollapseConfig = + Config { userModules :: [UserModule] + , sourceMode :: SourceMode + , functionNameMode :: FunctionNameMode + , operationMode :: OperationMode + , annotationMode :: AnnotationMode + , inputType :: InputType + } + +defaultConfig :: StackCollapseConfig +defaultConfig = Config { userModules = [userModule_Main] + , sourceMode = SourceNever + , functionNameMode = QualifiedKernel + , operationMode = Time + , annotationMode = WithAnnotations + , inputType = Detailed + } + +data InputType = Standard + | Detailed + +data SourceMode = SourceAlways + | SourceUser + | SourceNever + deriving stock (Eq) + +data FunctionNameMode = QualifiedAlways + | QualifiedKernel + | QualifiedNever + deriving stock (Eq) + +data OperationMode = Time + | Alloc + +data AnnotationMode = NoAnnotations + | WithAnnotations + deriving stock (Eq) + +prependUserModule :: StackCollapseConfig -> UserModule -> StackCollapseConfig +prependUserModule config@Config { userModules } modu = + config { userModules = modu:userModules } + + + diff --git a/src/Format.hs b/src/Format.hs new file mode 100644 --- /dev/null +++ b/src/Format.hs @@ -0,0 +1,85 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE OverloadedStrings #-} + +module Format + ( MayFail + , ColumnList + , Format + , Inherited(..) + , readSrc + , readCostCentre + , readText + , readInteger + , readDouble) where + +import Trace +import Data.ByteString (ByteString) +import qualified Data.ByteString.Char8 as Char8 +import Data.Text (Text) +import qualified Data.Text as T +import Data.Text.Encoding (decodeUtf8') +import Control.Arrow (left) +import Text.Read (readMaybe) + +type MayFail = Either String + +type ColumnList = [ByteString] + +type Format = ColumnList -> MayFail (Trace, Inherited) + +data Inherited = + Inherited { inheritedTime :: Double, inheritedAlloc :: Double } + +readSrc :: ByteString -> MayFail Src +readSrc = fmap mkSrc . readText + where + mkSrc "" = BuiltIn + mkSrc "" = EntireModule + mkSrc "" = NoLocationInfo + mkSrc text = Location text + +readCostCentre :: ByteString -> MayFail CostCentre +readCostCentre = fmap mkCC . readText + where + mkCC "MAIN" = Main + mkCC "CAF" = CAF Nothing + mkCC text + | "CAF:" `T.isPrefixOf` text = CAF (Just text) + | otherwise = SCC text + +readText :: ByteString -> MayFail Text +readText = left show . decodeUtf8' + +showText :: ByteString -> String +showText = either (const "") T.unpack . readText + +readInteger :: ByteString -> MayFail Integer +readInteger chars = case Char8.readInteger chars of + Just (i, chars') + | Char8.null chars' -> Right i + | otherwise -> _error + Nothing -> _error + where + _error = Left $ "expected integer in place of '" ++ showText chars ++ "' " + +readDouble :: ByteString -> MayFail Double +readDouble chars = maybe _error Right (readMaybe $ Char8.unpack chars) + where + _error = Left $ "expected double in place of '" ++ showText chars ++ "' " + + diff --git a/src/Orphans.hs b/src/Orphans.hs new file mode 100644 --- /dev/null +++ b/src/Orphans.hs @@ -0,0 +1,35 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE TypeFamilies #-} + +module Orphans (TreeF(..)) where + +import Data.Tree (Tree(..)) +import Data.Functor.Foldable + +data TreeF a r = NodeF a [r] + +instance Functor (TreeF a) where + fmap f (NodeF a rs) = NodeF a (map f rs) + +type instance Base (Tree a) = TreeF a + +instance Recursive (Tree a) where + project (Node a sub) = NodeF a sub + +instance Corecursive (Tree a) where + embed (NodeF a rs) = Node a rs diff --git a/src/Profiles.hs b/src/Profiles.hs new file mode 100644 --- /dev/null +++ b/src/Profiles.hs @@ -0,0 +1,160 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE NamedFieldPuns #-} +{-# LANGUAGE OverloadedStrings #-} + +module Profiles (Standard(..), Detailed(..), Profile(..), MayFail) where + +import Format +import CallTreeBuilder +import Trace +import Data.ByteString (ByteString) +import qualified Data.ByteString.Char8 as Char8 +import Data.Char (isSpace) +import Data.List.NonEmpty (NonEmpty(..), nonEmpty) +import qualified Data.List.NonEmpty as NEL +import Data.Either.Extra (maybeToEither) +import Control.Applicative (liftA2) +import Control.Arrow (left) +import Control.Monad +import Safe (tailMay) + +newtype Detailed = ProfileDetailed ByteString + +detailedProfStart :: Detailed -> MayFail [NumberedLine] +detailedProfStart (ProfileDetailed bs) = skipToMain $ numberedLines bs + +newtype Standard = ProfileStandard ByteString + +totalsStart :: Standard -> MayFail (NonEmpty NumberedLine) +totalsStart (ProfileStandard bs) = skipToTotalTime $ numberedLines bs + +class Profile p where + buildCallForest :: OperationMode -> p -> MayFail CallForest + +instance Profile Detailed where + buildCallForest + opMode = detailedProfStart >=> tryBuildCallForest format opMode + where + format + [_cc, _module, _src, _, _, _, _, _inhTime, _inhAlloc, _ticks, _bytes] = + let readTrace = Trace <$> readCostCentre _cc + <*> readText _module + <*> readSrc _src + <*> readInteger _ticks + <*> readInteger _bytes + readInherited = + Inherited <$> readDouble _inhTime <*> readDouble _inhAlloc + in liftA2 (,) readTrace readInherited + format _ = Left + "missing columns. Is the input file in the correct format (-P/-pa)?" + +instance Profile Standard where + buildCallForest opMode p = do + start <- totalsStart p + let (totalTimeLine, afterTotalTime) = NEL.uncons start + totalTicks <- left ((printError "total ticks" $ fst totalTimeLine) ++) + $ readTotalTicks + $ snd totalTimeLine + (totalAllocLine :| afterTotals) + <- maybeToEither (eofError "after the total ticks line") afterTotalTime + totalBytes <- left ((printError "total bytes" $ fst totalAllocLine) ++) + $ readTotalBytes + $ snd totalAllocLine + input <- skipToMain afterTotals + tryBuildCallForest (format totalTicks totalBytes) opMode input + where + format + totalTicks + totalBytes + [_cc, _module, _src, _, _, _indTime, _indAlloc, _inhTime, _inhAlloc] = + let readTrace = + (\cc modul src indTime indAllc + -> let ticks = round $ indTime * (fromIntegral totalTicks / 100) + alloc = round $ indAllc * (fromIntegral totalBytes / 100) + in Trace { cc, modul, src, ticks, alloc }) + <$> readCostCentre _cc + <*> readText _module + <*> readSrc _src + <*> readDouble _indTime + <*> readDouble _indAlloc + readInherited = + Inherited <$> readDouble _inhTime <*> readDouble _inhAlloc + in liftA2 (,) readTrace readInherited + format _ _ _ = Left + "unexpected number of columns. Is the input file in the correct format (-p)? Did you use the '-p' option?" + + printError what line = "confused at line " + ++ show line + ++ " when trying to parse '" + ++ what + ++ "': " + +skipToMain :: [NumberedLine] -> MayFail [NumberedLine] +skipToMain = fmap skipEmpty + . maybeToEither (eofError "can't find the header") + . (tailMay . skipToCostCentreHeader >=> tailMay . skipToCostCentreHeader) + where + startsWithCostCentre = ("COST CENTRE" `Char8.isPrefixOf`) . snd + + skipToCostCentreHeader = dropWhile (not . startsWithCostCentre) + + skipEmpty = dropWhile (Char8.null . snd) + +skipToTotalTime :: [NumberedLine] -> MayFail (NonEmpty NumberedLine) +skipToTotalTime = maybeToEither (eofError "can't find the total time line") + . nonEmpty + . dropWhile (not . startsWithTotalTime) + where + startsWithTotalTime = ("total time" `Char8.isPrefixOf`) . trimLeft . snd + +eofError :: String -> String +eofError why = "unexpected end of file: " + ++ why + ++ " \n(This usually means that the file is malformed. If you're sure that the file is correct then you found a bug)" + +readTotalTicks :: ByteString -> MayFail Integer +readTotalTicks = readInteger . Char8.drop 1 . trim . atOpeningParen + where + atOpeningParen = Char8.dropWhile (/= '(') + +readTotalBytes :: ByteString -> MayFail Integer +readTotalBytes = readGroupedDecimal . trim . Char8.drop 2 . atEqualSign + where + atEqualSign = Char8.dropWhile (/= '=') + + readGroupedDecimal = go 0 + where + go r bs = case Char8.readInteger bs of + Just (i, bs') + -> let j = r * 1000 + i + in case Char8.uncons bs' of + Just (',', bs'') -> go j bs'' + Just (ch, _) + -> Left $ "unexpected '" ++ ch:"' when looking for ','" + Nothing -> Right j + Nothing + -> Left $ "expected integer but found '" ++ Char8.unpack bs ++ "' " + +trimLeft :: ByteString -> ByteString +trimLeft = Char8.dropWhile isSpace + +trim :: ByteString -> ByteString +trim = Char8.takeWhile (not . isSpace) + + + diff --git a/src/StackCollapse.hs b/src/StackCollapse.hs new file mode 100644 --- /dev/null +++ b/src/StackCollapse.hs @@ -0,0 +1,159 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE NamedFieldPuns #-} +{-# LANGUAGE OverloadedStrings #-} +{-# LANGUAGE ExistentialQuantification #-} + +module StackCollapse + ( MayFail + , StackCollapse(..) + , collapseStack + , stackCollapseFromPath + , stackCollapseFromConfig) where + +import Trace +import Config +import UserModule +import Orphans +import Profiles +import CallTree (CallForest) +import Data.ByteString.Builder +import qualified Data.ByteString as ByteString +import qualified Data.ByteString.Lazy as Lazy +import Data.Bool +import Data.Text.Encoding (encodeUtf8Builder) +import Data.List (intersperse) +import Data.Functor.Foldable +import Data.Functor ((<&>)) +import Control.Applicative (liftA2, liftA3) + +data StackCollapse = forall p. Profile p + => StackCollapse { profile :: p + , builder :: Trace -> Builder + , mode :: OperationMode + } + +collapseStack :: StackCollapse -> MayFail Lazy.ByteString +collapseStack StackCollapse { profile, builder, mode } = + buildCallForest mode profile + <&> collapseCallForest (collectSamples mode) builder + where + collectSamples Time = ticks + collectSamples Alloc = alloc + +stackCollapseFromConfig + :: StackCollapseConfig -> ByteString.ByteString -> StackCollapse +stackCollapseFromConfig config input = + let builder = frameBuilder config + mode = operationMode config + in case inputType config of + Standard + -> StackCollapse { profile = ProfileStandard input, builder, mode } + Detailed + -> StackCollapse { profile = ProfileDetailed input, builder, mode } + +stackCollapseFromPath :: StackCollapseConfig -> FilePath -> IO StackCollapse +stackCollapseFromPath config = fmap (stackCollapseFromConfig config) + . ByteString.readFile + +collapseCallForest + :: (Trace -> Integer) -> (Trace -> Builder) -> CallForest -> Lazy.ByteString +collapseCallForest collectSamples buildFrame = toLazyByteString + . mconcat + . intersperse (char7 '\n') + . concatMap catamorphism + where + catamorphism = cata $ collapseCallTraces collectSamples buildFrame + +collapseCallTraces :: (Trace -> Integer) + -> (Trace -> Builder) + -> TreeF Trace [Builder] + -> [Builder] +collapseCallTraces collectSamples buildFrame (NodeF trace stacks) + | collectedSamples == 0 = stacks' + | otherwise = frameWithCount:stacks' + where + collectedSamples = collectSamples trace + + frame = buildFrame trace + + stacks' = concatMap (map $ withSep ';' frame) stacks + + frameWithCount = withSep ' ' frame $ integerDec collectedSamples + +frameBuilder :: StackCollapseConfig -> Trace -> Builder +frameBuilder config = + let optSource = + let builder = (char7 ' ' <>) . bracket . encodeUtf8Builder . source + in case sourceMode config of + SourceNever -> const mempty + SourceAlways -> builder liftA2 (&&) hasLocation (not . isCAF) + SourceUser -> builder + liftA3 + (\a b c -> a && b && c) + hasLocation + (not . isCAF) + (isUserTrace config) + optModule = let builder = (<> char7 '.') . encodeUtf8Builder . modul + in case functionNameMode config of + QualifiedNever -> const mempty + QualifiedAlways -> builder not . isMain + QualifiedKernel -> builder + not . liftA2 (||) isMain (isUserTrace config) + optAnnot = case annotationMode config of + WithAnnotations -> annot + NoAnnotations -> const mempty + annot trace + | isCAF trace = annotate "i" + | isKernelTrace trace = annotate "k" + | isUserTrace config trace = annotate "j" + | otherwise = mempty + in optModule <> (encodeUtf8Builder . costCentre) <> optSource <> optAnnot + +isUserTrace :: StackCollapseConfig -> Trace -> Bool +isUserTrace = inAnyUserModule . userModules + +isKernelTrace :: Trace -> Bool +isKernelTrace = inAnyModule kernelModules + where + kernelModules = + [ "GHC" + , "Data.Tuple" + , "Data.Bits" + , "Control.Monad" + , "Data.HashTable" + , "Data.Typeable" + , "Foreign" + , "Numeric" + , "System" + , "Text" + , "Type" + , "Unsafe"] + +withSep :: Char -> Builder -> Builder -> Builder +withSep sep left right = left <> char7 sep <> right + +bracket :: Builder -> Builder +bracket b = char7 '[' <> b <> char7 ']' + +annotate :: Builder -> Builder +annotate = (char7 '_' <>) . bracket + +() :: (Monoid b) => (a -> b) -> (a -> Bool) -> a -> b +then' if' = \a -> bool mempty (then' a) (if' a) + +infixl 7 diff --git a/src/Trace.hs b/src/Trace.hs new file mode 100644 --- /dev/null +++ b/src/Trace.hs @@ -0,0 +1,80 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE NamedFieldPuns #-} +{-# LANGUAGE OverloadedStrings #-} + +module Trace + ( Trace(..) + , CostCentre(..) + , Src(..) + , hasLocation + , isMain + , isCAF + , costCentre + , source + , inAnyModule) where + +import Data.Text (Text) +import qualified Data.Text as T + +data Trace = Trace { cc :: CostCentre + , modul :: Text + , src :: Src + , ticks :: Integer + , alloc :: Integer + } + +data CostCentre = Main + | CAF (Maybe Text) + | SCC Text + +data Src = BuiltIn + | EntireModule + | NoLocationInfo + | Location Text + +hasLocation :: Trace -> Bool +hasLocation Trace { src = (Location _) } = True +hasLocation _ = False + +isMain :: Trace -> Bool +isMain Trace { cc = Main } = True +isMain _ = False + +isCAF :: Trace -> Bool +isCAF Trace { cc = (CAF _) } = True +isCAF _ = False + +costCentre :: Trace -> Text +costCentre trace = case cc trace of + Main -> "MAIN" + CAF Nothing -> "CAF" + CAF (Just text) -> text + SCC text -> text + +source :: Trace -> Text +source trace = case src trace of + BuiltIn -> "" + EntireModule -> "" + NoLocationInfo -> "" + Location l -> l + +inAnyModule :: [Text] -> Trace -> Bool +inAnyModule modules Trace { modul } = any + (maybe False (\suffix -> T.null suffix || T.head suffix == '.') + . flip T.stripPrefix modul) + modules diff --git a/src/UserModule.hs b/src/UserModule.hs new file mode 100644 --- /dev/null +++ b/src/UserModule.hs @@ -0,0 +1,59 @@ +{- stackcollapse-ghc - fold GHC prof files into flamegraph input + Copyright (C) 2020 Marcin Rzeźnicki + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . +-} +{-# LANGUAGE DerivingStrategies #-} + +module UserModule + ( UserModule + , parseUserModule + , userModule_Main + , inAnyUserModule + , toString) where + +import Trace +import Data.Text (Text) +import qualified Data.Text as T +import Data.Char (isDigit, isLetter, isUpper) +import Data.Maybe (listToMaybe) +import Data.Coerce + +newtype UserModule = UserModule Text + deriving stock (Eq) + +parseUserModule :: String -> Either String UserModule +parseUserModule string + | not allLettersOrDigitsOrDotOr' = + Left "Module name must consist of letter | digit | . | ' only" + | not startsWithUpper = Left "Module name must start with uppercase letter" + | endsWithDot = Left "Do not end module name with '.'" + | otherwise = Right $ UserModule $ T.pack string + where + allLettersOrDigitsOrDotOr' = + all (\c -> isLetter c || isDigit c || c == '\'' || c == '.') string + + startsWithUpper = maybe False isUpper $ listToMaybe string + + endsWithDot = last string == '.' + +userModule_Main :: UserModule +userModule_Main = UserModule $ T.pack "Main" + +inAnyUserModule :: [UserModule] -> Trace -> Bool +inAnyUserModule = inAnyModule . coerce + +toString :: UserModule -> String +toString (UserModule t) = T.unpack t + diff --git a/stackcollapse-ghc.cabal b/stackcollapse-ghc.cabal new file mode 100644 --- /dev/null +++ b/stackcollapse-ghc.cabal @@ -0,0 +1,131 @@ +cabal-version: 2.4 +name: stackcollapse-ghc +version: 0.0.1 +synopsis: Program to fold GHC prof files into flamegraph input +description: Program to fold GHC prof files into flamegraph input + + The reasons why this package exists despite other packages with similar functionality (not including the NIH syndrome) boil down to: + . + * it does only one thing (stack collapsing), so it's up to the user to install flamegraph scripts, pass options etc (in my eyes it's not a limitation, on the contrary), + . + * output control: annotations (color profiles), extending traces from a configured set of modules with the source locations or toggling qualified names, + . + * precise ticks and/or bytes with @-p@ reports, + . + * it's fast + + . + = Basic usage + . + == Visualize ticks + . + + If you have a detailed prof file (@-P@ RTS option) + . + > stackcollapse-ghc prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks > path_to_svg + . + + If you have a standard prof file (@-p@ RTS option) + . + > stackcollapse-ghc -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Time' --countname ticks > path_to_svg + . + + . + == Visualize allocations + . + If you have a detailed prof file (@-P@ RTS option) + . + > stackcollapse-ghc --alloc prof_file | flamegraph.pl --title 'Example' --subtitle 'Bytes allocated' --countname bytes > path_to_svg + . + + If you have a standard prof file (@-p@ RTS option) + . + > stackcollapse-ghc --alloc -p prof_file | flamegraph.pl --title 'Example' --subtitle 'Bytes allocated' --countname bytes > path_to_svg + . + + See the full [README](https://github.com/marcin-rzeznicki/stackcollapse-ghc) for details. +homepage: https://github.com/marcin-rzeznicki/stackcollapse-ghc +bug-reports: https://github.com/marcin-rzeznicki/stackcollapse-ghc/issues +license: GPL-3.0-only +license-file: LICENSE +author: Marcin Rzeźnicki +maintainer: Marcin Rzeźnicki +copyright: 2020 Marcin Rzeźnicki +category: Profiling +build-type: Simple +extra-source-files: test/prof_files/*.prof +extra-doc-files: README.md + CHANGELOG.md +tested-with: GHC == 8.6.5 + GHC == 8.8.2 + GHC == 8.8.3 + +source-repository head + type: git + location: https://github.com/marcin-rzeznicki/stackcollapse-ghc.git + +common common-options + build-depends: base >= 4.12.0.0 && < 4.14, + bytestring >= 0.10.8 + + ghc-options: -Wall + -Wcompat + -Widentities + -Wincomplete-uni-patterns + -Wincomplete-record-updates + -fdefer-typed-holes + if impl(ghc >= 8.0) + ghc-options: -Wredundant-constraints + if impl(ghc >= 8.2) + ghc-options: -fhide-source-paths + if impl(ghc >= 8.4) + ghc-options: -Wmissing-export-lists + -Wpartial-fields + if impl(ghc >= 8.8) + ghc-options: -Wmissing-deriving-strategies + + default-language: Haskell2010 + +common common-sources + hs-source-dirs: src + other-modules: Config + UserModule + Trace + Format + CallTree + CallTreeBuilder + Orphans + Profiles + StackCollapse + build-depends: text >= 1.2.3.0, + containers >= 0.6.0.1, + rosezipper ==0.2, + foldl ==1.4.6, + transformers ==0.5.6.*, + recursion-schemes ==5.1.3, + safe ==0.3.*, + extra + +executable stackcollapse-ghc + import: common-options, + common-sources + hs-source-dirs: app + main-is: Main.hs + ghc-options: -threaded + -O2 + -rtsopts + -with-rtsopts=-N + +test-suite stackcollapse-ghc-test + import: common-options, + common-sources + type: exitcode-stdio-1.0 + hs-source-dirs: test + main-is: Spec.hs + other-modules: Helpers + build-depends: hspec-golden ==0.1.0.1, + hspec, + utf8-string ^>=1.0.1 + ghc-options: -threaded + -rtsopts + -with-rtsopts=-N diff --git a/test/Helpers.hs b/test/Helpers.hs new file mode 100644 --- /dev/null +++ b/test/Helpers.hs @@ -0,0 +1,82 @@ +{-# LANGUAGE NamedFieldPuns #-} + +module Helpers (embedInFileName, toArgsString, userModuleFromString) where + +import Config +import UserModule (UserModule, userModule_Main) +import qualified UserModule +import Data.Either.Extra (fromRight') + +embedInFileName :: StackCollapseConfig -> String +embedInFileName + Config { operationMode + , sourceMode + , functionNameMode + , annotationMode + , userModules + , inputType + } = embedInputType inputType + ++ embedOperationMode operationMode + ++ embedSourceMode sourceMode + ++ embedFunctionNameMode functionNameMode + ++ embedAnnotationMode annotationMode + ++ embedUserModules userModules + where + embedInputType Standard = "-p" + embedInputType Detailed = "" + + embedUserModules = concatMap (('+':) . UserModule.toString) + . filter (/= userModule_Main) + + embedOperationMode Time = "--time" + embedOperationMode Alloc = "--alloc" + + embedSourceMode SourceAlways = "--source-always" + embedSourceMode SourceUser = "--source-user" + embedSourceMode SourceNever = "" + + embedFunctionNameMode QualifiedAlways = "--qualified" + embedFunctionNameMode QualifiedKernel = "" + embedFunctionNameMode QualifiedNever = "--no-qualified" + + embedAnnotationMode WithAnnotations = "" + embedAnnotationMode NoAnnotations = "--no-annot" + +toArgsString :: StackCollapseConfig -> String +toArgsString + Config { operationMode + , sourceMode + , functionNameMode + , annotationMode + , userModules + , inputType + } = unwords + $ [ toArgs_Op operationMode + , toArgs_Source sourceMode + , toArgs_FunctionName functionNameMode + , toArgs_Annot annotationMode + , toArgs_Input inputType] + ++ toArgs_userModules userModules + where + toArgs_userModules = map (("-u " ++) . UserModule.toString) + . filter (/= userModule_Main) + + toArgs_Op Time = "--time" + toArgs_Op Alloc = "--alloc" + + toArgs_Source SourceAlways = "-S" + toArgs_Source SourceUser = "-s" + toArgs_Source SourceNever = "--no-source" + + toArgs_FunctionName QualifiedAlways = "-Q" + toArgs_FunctionName QualifiedKernel = "-q" + toArgs_FunctionName QualifiedNever = "--no-qualified" + + toArgs_Annot WithAnnotations = "-A" + toArgs_Annot NoAnnotations = "--no-annot" + + toArgs_Input Standard = "-p" + toArgs_Input Detailed = "-P" + +userModuleFromString :: String -> UserModule +userModuleFromString = fromRight' . UserModule.parseUserModule diff --git a/test/Spec.hs b/test/Spec.hs new file mode 100644 --- /dev/null +++ b/test/Spec.hs @@ -0,0 +1,105 @@ +{-# LANGUAGE NamedFieldPuns #-} + +module Main (main) where + +import Helpers +import Config +import StackCollapse +import Test.Hspec +import Test.Hspec.Golden +import qualified Data.ByteString.Lazy as Lazy +import Data.ByteString.Lazy.Char8 (pack) +import Data.ByteString.Lazy.UTF8 (toString) +import Data.Either.Extra (fromEither) +import Control.Arrow (left) + +path_ProfFilesDir :: String +path_ProfFilesDir = "test/prof_files/" + +path_GoldenDir :: String +path_GoldenDir = "test/.golden" + +path_ProfFile :: String -> FilePath +path_ProfFile stem = path_ProfFilesDir ++ stem ++ ".prof" + +main :: IO () +main = hspec + $ do + context "detailed prof" + $ withConfigs + "semiprimes" + [ defaultConfig + , defaultConfig `prependUserModule` userModuleFromString "Example" + , defaultConfig { sourceMode = SourceUser } + `prependUserModule` userModuleFromString "Example" + , defaultConfig { functionNameMode = QualifiedNever } + `prependUserModule` userModuleFromString "Example" + , defaultConfig { operationMode = Alloc } + `prependUserModule` userModuleFromString "Example"] + context "standard prof" + $ withConfigs + "countSemiprimes" + [ defaultConfig { inputType = Standard } + `prependUserModule` userModuleFromString "Example" + , defaultConfig { inputType = Standard, operationMode = Alloc } + `prependUserModule` userModuleFromString "Example"] + context "unicode chars" + $ withConfigs + "unicode" + [ defaultConfig { inputType = Standard + , functionNameMode = QualifiedNever + } + , defaultConfig { inputType = Standard + , operationMode = Alloc + , sourceMode = SourceAlways + }] + context "no header" $ stackCollapseTest "no-header" defaultConfig + context "just totals" $ stackCollapseTest "no-data" defaultConfig + context "no totals" + $ stackCollapseTest "no-totals" + $ defaultConfig { inputType = Standard } + context "malformed total bytes" + $ stackCollapseTest "malformed-bytes" + $ defaultConfig { inputType = Standard } + context "malformed ticks" + $ stackCollapseTest "no-ticks" + $ defaultConfig { inputType = Standard } + context "data errors" + $ withConfigs + "errors" + [defaultConfig, defaultConfig { operationMode = Alloc }] + context "wrong input type (-P given but the file is -p)" + $ stackCollapseTest "countSemiprimes" defaultConfig + context "wrong input type (-p given but the file is -P)" + $ stackCollapseTest "semiprimes" + $ defaultConfig { inputType = Standard } + +withConfigs :: String -> [StackCollapseConfig] -> Spec +withConfigs fileStem = mapM_ (stackCollapseTest fileStem) + +stackCollapseTest :: String -> StackCollapseConfig -> Spec +stackCollapseTest fileStem opts = before (prepareTest fileStem opts) + $ specify (toArgsString opts) runAndCompareStackCollapse + where + runAndCompareStackCollapse = + compareWithGold fileStem opts . fromEither . left pack . collapseStack + +compareWithGold + :: String -> StackCollapseConfig -> Lazy.ByteString -> Golden Lazy.ByteString +compareWithGold stem opts bs = + Golden { output = bs + , encodePretty = toString + , writeToFile = Lazy.writeFile + , readFromFile = Lazy.readFile + , directory = path_GoldenDir + , testName + } + where + testName = stem ++ embedInFileName opts + +prepareTest :: String -> StackCollapseConfig -> IO StackCollapse +prepareTest stem opts = let profFilePath = path_ProfFile stem + in stackCollapseFromPath opts profFilePath + + + diff --git a/test/prof_files/countSemiprimes.prof b/test/prof_files/countSemiprimes.prof new file mode 100644 --- /dev/null +++ b/test/prof_files/countSemiprimes.prof @@ -0,0 +1,219 @@ + Sun May 24 19:22 2020 Time and Allocation Profiling Report (Final) + + prog-exe +RTS -i0.001 -ki64k -pocountSemiprimes -s -p -RTS countSemiprimes + + total time = 0.30 secs (301 ticks @ 1000 us, 1 processor) + total alloc = 504,592,280 bytes (excludes profiling overheads) + +COST CENTRE MODULE SRC %time %alloc + +unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 71.4 91.9 +union Data.List.Ordered Data/List/Ordered.hs:231:1-23 22.3 0.0 +countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 1.7 1.3 +basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 1.3 0.5 +>>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 0.3 1.7 + + + individual inherited +COST CENTRE MODULE SRC no. entries %time %alloc %time %alloc + +MAIN MAIN 1433 0 0.0 0.0 100.0 100.0 + CAF GHC.Conc.Signal 1547 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding 1531 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding.Iconv 1529 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Handle.FD 1521 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Thread 1481 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Poll 1451 0 0.0 0.0 0.0 0.0 + CAF:$fApplicativeBox_$cpure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-6 2783 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-12 3039 1 0.0 0.0 0.0 0.0 + CAF:$fApplicativeId4 Data.Vector.Fusion.Util 2780 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:31:3-11 3023 1 0.0 0.0 0.0 0.0 + CAF:$fMonadBox_$creturn Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-8 2784 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-15 3038 1 0.0 0.0 0.0 0.0 + CAF:$fMonadId1 Data.Vector.Fusion.Util 2782 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:35:3-15 3022 1 0.0 0.0 0.0 0.0 + CAF:$fPrimMonadST1_r5gX Control.Monad.Primitive 2209 0 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3029 1 0.0 0.0 0.0 0.0 + CAF:doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-14 2785 0 0.0 0.0 0.0 0.0 + doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-21 2883 1 0.0 0.0 0.0 0.0 + CAF:doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-16 2787 0 0.0 0.0 0.0 0.0 + doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-24 3009 1 0.0 0.0 0.0 0.0 + CAF:doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-14 2786 0 0.0 0.0 0.0 0.0 + doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-22 2887 1 0.0 0.0 0.0 0.0 + CAF:empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-5 1596 0 0.0 0.0 0.0 0.0 + empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-13 2961 1 0.0 0.0 0.0 0.0 + CAF:findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-7 1628 0 0.0 0.0 0.0 0.0 + findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-78 2955 1 0.0 0.0 0.0 0.0 + CAF:lvl60_rful Example 2820 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2891 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2892 0 0.0 0.0 0.0 0.0 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2893 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2894 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2895 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2896 0 0.0 0.0 0.0 0.0 + CAF:main1 Main 2864 0 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2866 1 0.0 0.0 0.0 0.0 + CAF:nextComposite_rfu0 Example src/Example.hs:45:5-17 2811 0 0.0 0.0 0.0 0.0 + primes Example src/Example.hs:(61,1)-(117,55) 2950 0 0.0 0.0 0.0 0.0 + primes.large Example src/Example.hs:65:5-37 2951 0 0.0 0.0 0.0 0.0 + sieve Example src/Example.hs:(40,1)-(58,53) 2952 0 0.0 0.0 0.0 0.0 + sieve.nextComposite Example src/Example.hs:45:5-36 2953 1 0.0 0.0 0.0 0.0 + CAF:primesTo10 Example 2810 0 0.0 0.0 0.0 0.1 + primes Example src/Example.hs:(61,1)-(117,55) 2942 0 0.0 0.0 0.0 0.1 + primes.large Example src/Example.hs:65:5-37 2943 0 0.0 0.0 0.0 0.1 + primes.spin Example src/Example.hs:117:5-55 2944 5717 0.0 0.1 0.0 0.1 + CAF:primesTo8 Example 2814 0 0.0 0.0 1.0 1.9 + primes Example src/Example.hs:(61,1)-(117,55) 2939 0 0.0 0.0 1.0 1.9 + primes.large Example src/Example.hs:65:5-37 2940 0 0.0 0.0 1.0 1.9 + sieve Example src/Example.hs:(40,1)-(58,53) 2941 1 0.0 0.0 1.0 1.9 + sieve.sieve' Example src/Example.hs:(49,5)-(52,46) 2945 5716 0.0 0.1 1.0 1.9 + sieve.adjust Example src/Example.hs:(54,5)-(58,53) 2966 6524 0.3 0.0 0.7 1.5 + sieve.adjust.(...) Example src/Example.hs:58:9-53 2968 6524 0.0 0.0 0.3 1.3 + deleteFindMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:198:1-98 2969 6524 0.0 0.0 0.3 1.3 + minViewWithKey Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(209,1)-(210,70) 2970 6524 0.0 0.0 0.3 1.3 + extractHeap Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(312,1)-(314,48) 2975 3566 0.0 0.0 0.3 1.3 + extractForest Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(354,1)-(363,27) 2976 42471 0.3 0.7 0.3 1.2 + incrExtract Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(345,1)-(348,54) 2986 31818 0.0 0.1 0.0 0.5 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2991 23574 0.0 0.4 0.0 0.4 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2992 11640 0.0 0.0 0.0 0.0 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2990 11934 0.0 0.0 0.0 0.0 + extractForest. 2808 0 0.0 0.0 0.0 0.0 + primes Example src/Example.hs:(61,1)-(117,55) 2948 0 0.0 0.0 0.0 0.0 + primes.wheel2357 Example src/Example.hs:(67,5)-(115,11) 2949 0 0.0 0.0 0.0 0.0 + CAF:run1 Main 2861 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2869 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2870 1 0.0 0.0 0.0 0.0 + CAF:run2 Main 2860 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2872 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2873 0 0.0 0.0 0.0 0.0 + CAF:run32 Main 2858 0 0.0 0.0 5.3 5.4 + run Main app/Main.hs:(13,1)-(24,17) 2877 0 0.0 0.0 5.3 5.4 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2880 1 0.0 0.0 5.3 5.4 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2885 1 1.7 1.3 5.3 5.4 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 3021 200011 0.3 1.7 2.7 2.8 + fmap Data.Vector.Fusion.Stream.Monadic Data/Vector/Fusion/Stream/Monadic.hs:(133,3)-(135,20) 3024 50004 0.7 0.6 2.3 1.0 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1480-1538 3025 50002 0.0 0.0 1.7 0.4 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 3026 50002 1.3 0.4 1.7 0.4 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3030 0 0.3 0.0 0.3 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:433-499 3031 50002 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes.\ Example src/Example.hs:16:40-64 3041 50001 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 3020 50004 0.0 0.0 0.0 0.0 + basicUnsafeSlice Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1016-1084 3027 50003 0.0 0.0 0.0 0.3 + basicUnsafeSlice Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(94,3)-(95,25) 3028 50003 0.0 0.3 0.0 0.3 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:376:3-73 3035 50001 0.0 0.0 1.0 0.7 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:50:3-19 3040 50001 0.7 0.4 0.7 0.4 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3036 50001 0.3 0.3 0.3 0.3 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:220-288 3037 50001 0.0 0.0 0.0 0.0 + + Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(26,3)-(32,29) 3008 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:374:3-42 3004 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3005 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:508-575 3050 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3051 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3052 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1176-1228 3010 1 0.0 0.0 0.0 0.1 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 3011 1 0.0 0.0 0.0 0.1 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 3012 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 3013 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 3014 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:263:68-95 3015 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 3016 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3018 1 0.0 0.1 0.0 0.1 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2886 1 0.0 0.0 0.0 0.2 + isNSemiprime.\ Example src/Example.hs:24:30-57 2925 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:358:3-72 2926 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 2927 12110 0.0 0.1 0.0 0.1 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2928 12110 0.0 0.0 0.0 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:445-514 2929 12110 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:355:3-51 2908 1 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(114,3)-(117,36) 2909 1 0.0 0.0 0.0 0.0 + basicInitialize.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:117:7-36 2910 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2911 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2912 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2913 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2914 1 0.0 0.0 0.0 0.0 + setByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:521-878 2915 1 0.0 0.0 0.0 0.0 + internal Control.Monad.Primitive Control/Monad/Primitive.hs:96:3-21 2916 1 0.0 0.0 0.0 0.0 + setByteArray#.i Data.Primitive.Types Data/Primitive/Types.hs:251:596-619 2917 1 0.0 0.0 0.0 0.0 + setByteArray#.n Data.Primitive.Types Data/Primitive/Types.hs:251:660-683 2918 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:372:3-70 3001 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3002 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3003 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2888 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2889 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2890 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2907 1 0.0 0.0 0.0 0.0 + isNSemiprime.nSemiprimes Example src/Example.hs:23:9-40 2919 1 0.0 0.0 0.0 0.1 + semiprimesTo Example src/Example.hs:28:1-52 2920 1 0.0 0.1 0.0 0.1 + sChunks Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:122:30-36 3019 1 0.0 0.0 0.0 0.0 + sSize Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:124:30-34 3007 1 0.0 0.0 0.0 0.0 + upperBound Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(126,1)-(128,30) 3006 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2878 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2879 0 0.0 0.0 0.0 0.0 + CAF:run37 Main 2862 0 0.0 0.0 0.0 0.0 + CAF:run_x Main 2859 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2874 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2881 0 0.0 0.0 0.0 0.0 + countSemiprimes.\ Example src/Example.hs:13:23-67 2882 9 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 2884 36 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:664-703 3053 18 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3054 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:817-872 3055 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3056 18 0.0 0.0 0.0 0.0 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:214-279 3057 18 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2875 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2876 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-10 2178 0 0.0 0.0 0.0 0.0 + sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-14 3017 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-12 2194 0 0.0 0.0 0.0 0.0 + sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-16 2906 1 0.0 0.0 0.0 0.0 + CAF:semiprimes_$ssemiprimes Example src/Example.hs:31:1-10 2817 0 0.0 0.0 93.7 92.5 + semiprimes Example src/Example.hs:(31,1)-(33,51) 2921 1 0.0 0.1 93.7 92.5 + semiprimes.\ Example src/Example.hs:31:29-58 2924 2763 0.0 0.0 93.7 92.4 + semiprimes.facts Example src/Example.hs:33:5-51 2933 2762 0.0 0.3 0.0 0.5 + primesTo Example src/Example.hs:36:1-44 2934 2762 0.0 0.2 0.0 0.2 + union Data.List.Ordered Data/List/Ordered.hs:231:1-23 2930 2762 22.3 0.0 93.7 91.9 + unionBy Data.List.Ordered Data/List/Ordered.hs:(235,1)-(243,34) 2931 2762 0.0 0.0 71.4 91.9 + unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 2932 7246750 71.4 91.9 71.4 91.9 + CAF:size48_rfui Example 2819 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2897 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2898 0 0.0 0.0 0.0 0.0 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2899 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2900 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2901 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 2902 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2903 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2904 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2905 1 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2867 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2868 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2871 0 0.0 0.0 0.0 0.0 diff --git a/test/prof_files/errors.prof b/test/prof_files/errors.prof new file mode 100644 --- /dev/null +++ b/test/prof_files/errors.prof @@ -0,0 +1,137 @@ + Sun May 24 18:56 2020 Time and Allocation Profiling Report (Final) + + prog-exe +RTS -i0.001 -ki64k -posemiprimes -s -P -RTS semiprimes + + total time = 0.28 secs (276 ticks @ 1000 us, 1 processor) + total alloc = 487,091,392 bytes (excludes profiling overheads) + +COST CENTRE MODULE SRC %time %alloc ticks bytes + +unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 94.2 95.2 260 463788928 +semiprimes.facts Example src/Example.hs:33:5-51 1.4 0.4 4 1814960 + + + individual inherited +COST CENTRE MODULE SRC no. entries %time %alloc %time %alloc ticks bytes + +MAIN MAIN 1433 0 _ 0.0 100.0 100.0 0 150808 + CAF GHC.Conc.Signal 1547 0 0.0 0.0 0.0 0.0 0 656 + CAF GHC.IO.Encoding 1531 0 0.0 0.0 0.0 0.0 0 3168 + CAF GHC.IO.Encoding.Iconv 1529 0 0.0 0.0 0.0 0.0 0 200 + CAF GHC.IO.Handle.FD 1521 0 0.4 0.0 0.4 0.0 1 34704 + CAF GHC.Event.Thread 1481 0 0.0 0.0 0.0 0.0 0 1216 + CAF GHC.Event.Poll 1451 0 0.0 0.0 0.0 0.0 0 48 + CAF:empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-5 1596 0 0.0 0.0 0.0 0.0 0 0 + empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-13 2905 1 0.0 0.0 0.0 0.0 0 0 + CAF:findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-7 1628 0 0.0 0.0 0.0 0.0 0 16 + findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-78 2899 1 0.0 0.0 0.0 0.0 0 0 + CAF:main1 Main 2864 0 0.0 0.0 0.0 0.0 0 16 + main Main app/Main.hs:10:1-22 2866 1 0.0 0.0 0.0 0.0 0 0 + CAF:nextComposite_rfu0 Example src/Example.hs:45:5-17 2811 0 0.0 0.0 0.0 0.0 0 0 + primes Example src/Example.hs:(61,1)-(117,55) 2894 0 0.0 0.0 0.0 0.0 0 0 + primes.large Example src/Example.hs:65:5-37 2895 0 0.0 0.0 0.0 0.0 0 0 + sieve Example src/Example.hs:(40,1)-(58,53) 2896 0 0.0 0.0 0.0 0.0 0 16 + sieve.nextComposite Example src/Example.hs:45:5-36 2897 1 0.0 0.0 0.0 0.0 0 0 + CAF:run33 Main 2856 0 0.0 0.0 0.0 0.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2869 0 0.0 0.0 0.0 0.0 0 16 + profile Main app/Main.hs:27:1-65 2870 1 0.0 0.0 0.0 0.0 0 0 + CAF:run34 Main 2855 0 0.0 0.0 0.0 0.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2872 0 0.0 0.0 0.0 0.0 0 0 + profile Main app/Main.hs:27:1-65 2873 0 0.0 0.0 0.0 0.0 0 16 + CAF:run35 Main 2857 0 0.0 0.0 0.0 0.0 0 720 + CAF:run37 Main 2862 0 0.0 0.0 0.0 0.0 0 72 + CAF:run_x1 Main 2854 0 0.0 0.0 99.6 100.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2874 0 0.0 0.0 99.6 100.0 0 0 + profile Main app/Main.hs:27:1-65 2875 0 0.0 0.0 99.6 100.0 0 0 + program Main app/Main.hs:27:63-65 2876 1 0.0 0.0 99.6 100.0 0 48 + semiprimesTo Example src/Example.hs:28:1-52 2877 1 0.4 0.1 99.6 100.0 1 678352 + semiprimes Example src/Example.hs:(31,1)-(33,51) 2878 1 0.0 0.1 99.3 99.8 0 442264 + semiprimes.\ Example src/Example.hs:31:29-58 2881 2763 0.0 0.0 97.1 97.2 0 154704 + semiprimes.facts Example src/Example.hs:33:5-51 2885 2762 1.4 0.4 2.9 2.0 4 1814960 + primesTo Example src/Example.hs:36:1-44 2886 2762 0.4 0.3 1.4 1.6 1 + primes Example src/Example.hs:(61,1)-(117,55) 2887 2762 0.0 0.2 1.1 1.3 0 1104424 + primes.small Example src/Example.hs:63:5-24 2888 2762 0.0 0.0 0.0 0.0 0 138848 + primes.large Example src/Example.hs:65:5-37 2910 911 0.0 0.0 0.7 0.8 0 116608 + primes.spin Example src/Example.hs:117:5-55 2911 6344 0.0 0.2 0.0 0.2 0 956208 + sieve Example src/Example.hs:(40,1)-(58,53) 2912 911 0.0 0.0 0.7 0.6 0 133936 + sieve.sieve' Example src/Example.hs:(49,5)-(52,46) 2913 5433 0.0 0.2 0.4 0.5 0 862928 + sieve.crossoff Example src/Example.hs:43:5-68 2922 4672 0.4 0.1 0.4 0.3 632696 + insert Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:150:1-21 2923 4672 0.0 0.1 0.0 0.2 0 566928 + insert' Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(169,1)-(172,59) 2924 4672 0.0 0.0 0.0 0.1 0 0 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2960 3360 0.0 0.1 0.0 0.1 0 287232 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2961 1592 0.0 0.0 0.0 0.0 0 0 + tip Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:265:1-28 2959 1768 0.0 0.0 0.0 0.0 0 0 + sieve.adjust Example src/Example.hs:(54,5)-(58,53) 2948 300 0.0 0.0 0.0 0.0 0 50400 + sieve.adjust.(...) Example src/Example.hs:58:9-53 2950 300 0.0 0.0 0.0 0.0 0 0 + deleteFindMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:198:1-98 2951 300 0.0 0.0 0.0 0.0 0 0 + minViewWithKey Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(209,1)-(210,70) 2952 300 0.0 0.0 0.0 0.0 0 0 + extractHeap Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(312,1)-(314,48) 2957 150 0.0 0.0 0.0 0.0 0 6000 + extractForest Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(354,1)-(363,27) 2958 955 0.0 0.0 0.0 0.0 0 69720 + incrExtract Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(345,1)-(348,54) 2963 546 0.0 0.0 0.0 0.0 0 5320 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2968 305 0.0 0.0 0.0 0.0 0 28712 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2969 172 0.0 0.0 0.0 0.0 0 0 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2967 133 0.0 0.0 0.0 0.0 0 0 + extractForest.>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 0.3 1.7 + + + individual inherited +COST CENTRE MODULE SRC no. entries %time %alloc %time %alloc + +MAIN MAIN 1433 0 0.0 0.0 100.0 100.0 + CAF GHC.Conc.Signal 1547 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding 1531 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding.Iconv 1529 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Handle.FD 1521 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Thread 1481 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Poll 1451 0 0.0 0.0 0.0 0.0 + CAF:$fApplicativeBox_$cpure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-6 2783 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-12 3039 1 0.0 0.0 0.0 0.0 + CAF:$fApplicativeId4 Data.Vector.Fusion.Util 2780 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:31:3-11 3023 1 0.0 0.0 0.0 0.0 + CAF:$fMonadBox_$creturn Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-8 2784 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-15 3038 1 0.0 0.0 0.0 0.0 + CAF:$fMonadId1 Data.Vector.Fusion.Util 2782 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:35:3-15 3022 1 0.0 0.0 0.0 0.0 + CAF:$fPrimMonadST1_r5gX Control.Monad.Primitive 2209 0 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3029 1 0.0 0.0 0.0 0.0 + CAF:doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-14 2785 0 0.0 0.0 0.0 0.0 + doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-21 2883 1 0.0 0.0 0.0 0.0 + CAF:doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-16 2787 0 0.0 0.0 0.0 0.0 + doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-24 3009 1 0.0 0.0 0.0 0.0 + CAF:doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-14 2786 0 0.0 0.0 0.0 0.0 + doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-22 2887 1 0.0 0.0 0.0 0.0 + CAF:empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-5 1596 0 0.0 0.0 0.0 0.0 + empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-13 2961 1 0.0 0.0 0.0 0.0 + CAF:findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-7 1628 0 0.0 0.0 0.0 0.0 + findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-78 2955 1 0.0 0.0 0.0 0.0 + CAF:lvl60_rful Example 2820 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2891 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2892 0 0.0 0.0 0.0 0.0 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2893 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2894 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2895 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2896 0 0.0 0.0 0.0 0.0 + CAF:main1 Main 2864 0 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2866 1 0.0 0.0 0.0 0.0 + CAF:nextComposite_rfu0 Example src/Example.hs:45:5-17 2811 0 0.0 0.0 0.0 0.0 + primes Example src/Example.hs:(61,1)-(117,55) 2950 0 0.0 0.0 0.0 0.0 + primes.large Example src/Example.hs:65:5-37 2951 0 0.0 0.0 0.0 0.0 + sieve Example src/Example.hs:(40,1)-(58,53) 2952 0 0.0 0.0 0.0 0.0 + sieve.nextComposite Example src/Example.hs:45:5-36 2953 1 0.0 0.0 0.0 0.0 + CAF:primesTo10 Example 2810 0 0.0 0.0 0.0 0.1 + primes Example src/Example.hs:(61,1)-(117,55) 2942 0 0.0 0.0 0.0 0.1 + primes.large Example src/Example.hs:65:5-37 2943 0 0.0 0.0 0.0 0.1 + primes.spin Example src/Example.hs:117:5-55 2944 5717 0.0 0.1 0.0 0.1 + CAF:primesTo8 Example 2814 0 0.0 0.0 1.0 1.9 + primes Example src/Example.hs:(61,1)-(117,55) 2939 0 0.0 0.0 1.0 1.9 + primes.large Example src/Example.hs:65:5-37 2940 0 0.0 0.0 1.0 1.9 + sieve Example src/Example.hs:(40,1)-(58,53) 2941 1 0.0 0.0 1.0 1.9 + sieve.sieve' Example src/Example.hs:(49,5)-(52,46) 2945 5716 0.0 0.1 1.0 1.9 + sieve.adjust Example src/Example.hs:(54,5)-(58,53) 2966 6524 0.3 0.0 0.7 1.5 + sieve.adjust.(...) Example src/Example.hs:58:9-53 2968 6524 0.0 0.0 0.3 1.3 + deleteFindMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:198:1-98 2969 6524 0.0 0.0 0.3 1.3 + minViewWithKey Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(209,1)-(210,70) 2970 6524 0.0 0.0 0.3 1.3 + extractHeap Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(312,1)-(314,48) 2975 3566 0.0 0.0 0.3 1.3 + extractForest Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(354,1)-(363,27) 2976 42471 0.3 0.7 0.3 1.2 + incrExtract Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(345,1)-(348,54) 2986 31818 0.0 0.1 0.0 0.5 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2991 23574 0.0 0.4 0.0 0.4 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2992 11640 0.0 0.0 0.0 0.0 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2990 11934 0.0 0.0 0.0 0.0 + extractForest. 2808 0 0.0 0.0 0.0 0.0 + primes Example src/Example.hs:(61,1)-(117,55) 2948 0 0.0 0.0 0.0 0.0 + primes.wheel2357 Example src/Example.hs:(67,5)-(115,11) 2949 0 0.0 0.0 0.0 0.0 + CAF:run1 Main 2861 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2869 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2870 1 0.0 0.0 0.0 0.0 + CAF:run2 Main 2860 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2872 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2873 0 0.0 0.0 0.0 0.0 + CAF:run32 Main 2858 0 0.0 0.0 5.3 5.4 + run Main app/Main.hs:(13,1)-(24,17) 2877 0 0.0 0.0 5.3 5.4 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2880 1 0.0 0.0 5.3 5.4 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2885 1 1.7 1.3 5.3 5.4 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 3021 200011 0.3 1.7 2.7 2.8 + fmap Data.Vector.Fusion.Stream.Monadic Data/Vector/Fusion/Stream/Monadic.hs:(133,3)-(135,20) 3024 50004 0.7 0.6 2.3 1.0 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1480-1538 3025 50002 0.0 0.0 1.7 0.4 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 3026 50002 1.3 0.4 1.7 0.4 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3030 0 0.3 0.0 0.3 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:433-499 3031 50002 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes.\ Example src/Example.hs:16:40-64 3041 50001 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 3020 50004 0.0 0.0 0.0 0.0 + basicUnsafeSlice Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1016-1084 3027 50003 0.0 0.0 0.0 0.3 + basicUnsafeSlice Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(94,3)-(95,25) 3028 50003 0.0 0.3 0.0 0.3 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:376:3-73 3035 50001 0.0 0.0 1.0 0.7 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:50:3-19 3040 50001 0.7 0.4 0.7 0.4 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3036 50001 0.3 0.3 0.3 0.3 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:220-288 3037 50001 0.0 0.0 0.0 0.0 + + Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(26,3)-(32,29) 3008 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:374:3-42 3004 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3005 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:508-575 3050 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3051 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3052 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1176-1228 3010 1 0.0 0.0 0.0 0.1 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 3011 1 0.0 0.0 0.0 0.1 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 3012 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 3013 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 3014 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:263:68-95 3015 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 3016 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3018 1 0.0 0.1 0.0 0.1 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2886 1 0.0 0.0 0.0 0.2 + isNSemiprime.\ Example src/Example.hs:24:30-57 2925 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:358:3-72 2926 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 2927 12110 0.0 0.1 0.0 0.1 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2928 12110 0.0 0.0 0.0 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:445-514 2929 12110 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:355:3-51 2908 1 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(114,3)-(117,36) 2909 1 0.0 0.0 0.0 0.0 + basicInitialize.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:117:7-36 2910 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2911 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2912 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2913 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2914 1 0.0 0.0 0.0 0.0 + setByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:521-878 2915 1 0.0 0.0 0.0 0.0 + internal Control.Monad.Primitive Control/Monad/Primitive.hs:96:3-21 2916 1 0.0 0.0 0.0 0.0 + setByteArray#.i Data.Primitive.Types Data/Primitive/Types.hs:251:596-619 2917 1 0.0 0.0 0.0 0.0 + setByteArray#.n Data.Primitive.Types Data/Primitive/Types.hs:251:660-683 2918 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:372:3-70 3001 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3002 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3003 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2888 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2889 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2890 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2907 1 0.0 0.0 0.0 0.0 + isNSemiprime.nSemiprimes Example src/Example.hs:23:9-40 2919 1 0.0 0.0 0.0 0.1 + semiprimesTo Example src/Example.hs:28:1-52 2920 1 0.0 0.1 0.0 0.1 + sChunks Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:122:30-36 3019 1 0.0 0.0 0.0 0.0 + sSize Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:124:30-34 3007 1 0.0 0.0 0.0 0.0 + upperBound Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(126,1)-(128,30) 3006 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2878 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2879 0 0.0 0.0 0.0 0.0 + CAF:run37 Main 2862 0 0.0 0.0 0.0 0.0 + CAF:run_x Main 2859 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2874 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2881 0 0.0 0.0 0.0 0.0 + countSemiprimes.\ Example src/Example.hs:13:23-67 2882 9 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 2884 36 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:664-703 3053 18 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3054 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:817-872 3055 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3056 18 0.0 0.0 0.0 0.0 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:214-279 3057 18 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2875 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2876 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-10 2178 0 0.0 0.0 0.0 0.0 + sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-14 3017 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-12 2194 0 0.0 0.0 0.0 0.0 + sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-16 2906 1 0.0 0.0 0.0 0.0 + CAF:semiprimes_$ssemiprimes Example src/Example.hs:31:1-10 2817 0 0.0 0.0 93.7 92.5 + semiprimes Example src/Example.hs:(31,1)-(33,51) 2921 1 0.0 0.1 93.7 92.5 + semiprimes.\ Example src/Example.hs:31:29-58 2924 2763 0.0 0.0 93.7 92.4 + semiprimes.facts Example src/Example.hs:33:5-51 2933 2762 0.0 0.3 0.0 0.5 + primesTo Example src/Example.hs:36:1-44 2934 2762 0.0 0.2 0.0 0.2 + union Data.List.Ordered Data/List/Ordered.hs:231:1-23 2930 2762 22.3 0.0 93.7 91.9 + unionBy Data.List.Ordered Data/List/Ordered.hs:(235,1)-(243,34) 2931 2762 0.0 0.0 71.4 91.9 + unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 2932 7246750 71.4 91.9 71.4 91.9 + CAF:size48_rfui Example 2819 0 0.0 0.0 0.0 0.0 + countSemiprimes Example src/Example.hs:(12,1)-(17,22) 2897 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example src/Example.hs:(15,5)-(17,22) 2898 0 0.0 0.0 0.0 0.0 + isNSemiprime Example src/Example.hs:(20,1)-(25,25) 2899 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2900 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2901 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 2902 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2903 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2904 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2905 1 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2867 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2868 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2871 0 0.0 0.0 0.0 0.0 diff --git a/test/prof_files/no_data.prof b/test/prof_files/no_data.prof new file mode 100644 --- /dev/null +++ b/test/prof_files/no_data.prof @@ -0,0 +1,7 @@ + Sun May 24 18:56 2020 Time and Allocation Profiling Report (Final) + + prog-exe +RTS -i0.001 -ki64k -posemiprimes -s -P -RTS semiprimes + + total time = 0.28 secs (276 ticks @ 1000 us, 1 processor) + total alloc = 487,091,392 bytes (excludes profiling overheads) + diff --git a/test/prof_files/no_header.prof b/test/prof_files/no_header.prof new file mode 100644 --- /dev/null +++ b/test/prof_files/no_header.prof @@ -0,0 +1,11 @@ + Sun May 24 18:56 2020 Time and Allocation Profiling Report (Final) + + prog-exe +RTS -i0.001 -ki64k -posemiprimes -s -P -RTS semiprimes + + total time = 0.28 secs (276 ticks @ 1000 us, 1 processor) + total alloc = 487,091,392 bytes (excludes profiling overheads) + +COST CENTRE MODULE SRC %time %alloc ticks bytes + +unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 94.2 95.2 260 463788928 +semiprimes.facts Example src/Example.hs:33:5-51 1.4 0.4 4 1814960 diff --git a/test/prof_files/semiprimes.prof b/test/prof_files/semiprimes.prof new file mode 100644 --- /dev/null +++ b/test/prof_files/semiprimes.prof @@ -0,0 +1,137 @@ + Sun May 24 18:56 2020 Time and Allocation Profiling Report (Final) + + prog-exe +RTS -i0.001 -ki64k -posemiprimes -s -P -RTS semiprimes + + total time = 0.28 secs (276 ticks @ 1000 us, 1 processor) + total alloc = 487,091,392 bytes (excludes profiling overheads) + +COST CENTRE MODULE SRC %time %alloc ticks bytes + +unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 94.2 95.2 260 463788928 +semiprimes.facts Example src/Example.hs:33:5-51 1.4 0.4 4 1814960 + + + individual inherited +COST CENTRE MODULE SRC no. entries %time %alloc %time %alloc ticks bytes + +MAIN MAIN 1433 0 0.0 0.0 100.0 100.0 0 150808 + CAF GHC.Conc.Signal 1547 0 0.0 0.0 0.0 0.0 0 656 + CAF GHC.IO.Encoding 1531 0 0.0 0.0 0.0 0.0 0 3168 + CAF GHC.IO.Encoding.Iconv 1529 0 0.0 0.0 0.0 0.0 0 200 + CAF GHC.IO.Handle.FD 1521 0 0.4 0.0 0.4 0.0 1 34704 + CAF GHC.Event.Thread 1481 0 0.0 0.0 0.0 0.0 0 1216 + CAF GHC.Event.Poll 1451 0 0.0 0.0 0.0 0.0 0 48 + CAF:empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-5 1596 0 0.0 0.0 0.0 0.0 0 0 + empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-13 2905 1 0.0 0.0 0.0 0.0 0 0 + CAF:findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-7 1628 0 0.0 0.0 0.0 0.0 0 16 + findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-78 2899 1 0.0 0.0 0.0 0.0 0 0 + CAF:main1 Main 2864 0 0.0 0.0 0.0 0.0 0 16 + main Main app/Main.hs:10:1-22 2866 1 0.0 0.0 0.0 0.0 0 0 + CAF:nextComposite_rfu0 Example src/Example.hs:45:5-17 2811 0 0.0 0.0 0.0 0.0 0 0 + primes Example src/Example.hs:(61,1)-(117,55) 2894 0 0.0 0.0 0.0 0.0 0 0 + primes.large Example src/Example.hs:65:5-37 2895 0 0.0 0.0 0.0 0.0 0 0 + sieve Example src/Example.hs:(40,1)-(58,53) 2896 0 0.0 0.0 0.0 0.0 0 16 + sieve.nextComposite Example src/Example.hs:45:5-36 2897 1 0.0 0.0 0.0 0.0 0 0 + CAF:run33 Main 2856 0 0.0 0.0 0.0 0.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2869 0 0.0 0.0 0.0 0.0 0 16 + profile Main app/Main.hs:27:1-65 2870 1 0.0 0.0 0.0 0.0 0 0 + CAF:run34 Main 2855 0 0.0 0.0 0.0 0.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2872 0 0.0 0.0 0.0 0.0 0 0 + profile Main app/Main.hs:27:1-65 2873 0 0.0 0.0 0.0 0.0 0 16 + CAF:run35 Main 2857 0 0.0 0.0 0.0 0.0 0 720 + CAF:run37 Main 2862 0 0.0 0.0 0.0 0.0 0 72 + CAF:run_x1 Main 2854 0 0.0 0.0 99.6 100.0 0 0 + run Main app/Main.hs:(13,1)-(24,17) 2874 0 0.0 0.0 99.6 100.0 0 0 + profile Main app/Main.hs:27:1-65 2875 0 0.0 0.0 99.6 100.0 0 0 + program Main app/Main.hs:27:63-65 2876 1 0.0 0.0 99.6 100.0 0 48 + semiprimesTo Example src/Example.hs:28:1-52 2877 1 0.4 0.1 99.6 100.0 1 678352 + semiprimes Example src/Example.hs:(31,1)-(33,51) 2878 1 0.0 0.1 99.3 99.8 0 442264 + semiprimes.\ Example src/Example.hs:31:29-58 2881 2763 0.0 0.0 97.1 97.2 0 154704 + semiprimes.facts Example src/Example.hs:33:5-51 2885 2762 1.4 0.4 2.9 2.0 4 1814960 + primesTo Example src/Example.hs:36:1-44 2886 2762 0.4 0.3 1.4 1.6 1 1360448 + primes Example src/Example.hs:(61,1)-(117,55) 2887 2762 0.0 0.2 1.1 1.3 0 1104424 + primes.small Example src/Example.hs:63:5-24 2888 2762 0.0 0.0 0.0 0.0 0 138848 + primes.large Example src/Example.hs:65:5-37 2910 911 0.0 0.0 0.7 0.8 0 116608 + primes.spin Example src/Example.hs:117:5-55 2911 6344 0.0 0.2 0.0 0.2 0 956208 + sieve Example src/Example.hs:(40,1)-(58,53) 2912 911 0.0 0.0 0.7 0.6 0 133936 + sieve.sieve' Example src/Example.hs:(49,5)-(52,46) 2913 5433 0.0 0.2 0.4 0.5 0 862928 + sieve.crossoff Example src/Example.hs:43:5-68 2922 4672 0.4 0.1 0.4 0.3 1 632696 + insert Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:150:1-21 2923 4672 0.0 0.1 0.0 0.2 0 566928 + insert' Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(169,1)-(172,59) 2924 4672 0.0 0.0 0.0 0.1 0 0 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2960 3360 0.0 0.1 0.0 0.1 0 287232 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2961 1592 0.0 0.0 0.0 0.0 0 0 + tip Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:265:1-28 2959 1768 0.0 0.0 0.0 0.0 0 0 + sieve.adjust Example src/Example.hs:(54,5)-(58,53) 2948 300 0.0 0.0 0.0 0.0 0 50400 + sieve.adjust.(...) Example src/Example.hs:58:9-53 2950 300 0.0 0.0 0.0 0.0 0 0 + deleteFindMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:198:1-98 2951 300 0.0 0.0 0.0 0.0 0 0 + minViewWithKey Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(209,1)-(210,70) 2952 300 0.0 0.0 0.0 0.0 0 0 + extractHeap Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(312,1)-(314,48) 2957 150 0.0 0.0 0.0 0.0 0 6000 + extractForest Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(354,1)-(363,27) 2958 955 0.0 0.0 0.0 0.0 0 69720 + incrExtract Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(345,1)-(348,54) 2963 546 0.0 0.0 0.0 0.0 0 5320 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2968 305 0.0 0.0 0.0 0.0 0 28712 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2969 172 0.0 0.0 0.0 0.0 0 0 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2967 133 0.0 0.0 0.0 0.0 0 0 + extractForest.>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 0.3 1.7 + + + individual inherited +COST CENTRE MODULE SRC no. entries %time %alloc %time %alloc + +MAIN MAIN 1433 0 0.0 0.0 100.0 100.0 + CAF GHC.Conc.Signal 1547 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding 1531 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Encoding.Iconv 1529 0 0.0 0.0 0.0 0.0 + CAF GHC.IO.Handle.FD 1521 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Thread 1481 0 0.0 0.0 0.0 0.0 + CAF GHC.Event.Poll 1451 0 0.0 0.0 0.0 0.0 + CAF:$fApplicativeBox_$cpure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-6 2783 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:45:3-12 3039 1 0.0 0.0 0.0 0.0 + CAF:$fApplicativeId4 Data.Vector.Fusion.Util 2780 0 0.0 0.0 0.0 0.0 + pure Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:31:3-11 3023 1 0.0 0.0 0.0 0.0 + CAF:$fMonadBox_$creturn Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-8 2784 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:49:3-15 3038 1 0.0 0.0 0.0 0.0 + CAF:$fMonadId1 Data.Vector.Fusion.Util 2782 0 0.0 0.0 0.0 0.0 + return Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:35:3-15 3022 1 0.0 0.0 0.0 0.0 + CAF:$fPrimMonadST1_r5gX Control.Monad.Primitive 2209 0 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3029 1 0.0 0.0 0.0 0.0 + CAF:doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-14 2785 0 0.0 0.0 0.0 0.0 + doBoundsChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:55:1-21 2883 1 0.0 0.0 0.0 0.0 + CAF:doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-16 2787 0 0.0 0.0 0.0 0.0 + doInternalChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:71:1-24 3009 1 0.0 0.0 0.0 0.0 + CAF:doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-14 2786 0 0.0 0.0 0.0 0.0 + doUnsafeChecks Data.Vector.Internal.Check Data/Vector/Internal/Check.hs:64:1-22 2887 1 0.0 0.0 0.0 0.0 + CAF:empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-5 1596 0 0.0 0.0 0.0 0.0 + empty Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:131:1-13 2961 1 0.0 0.0 0.0 0.0 + CAF:findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-7 1628 0 0.0 0.0 0.0 0.0 + findMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:189:1-78 2955 1 0.0 0.0 0.0 0.0 + CAF:lvl60_rful Example 2820 0 0.0 0.0 0.0 0.0 + countSemiprimes Example источники/Example.hs:(12,1)-(17,22) 2891 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example источники/Example.hs:(15,5)-(17,22) 2892 0 0.0 0.0 0.0 0.0 + isNSemiprime Example источники/Example.hs:(20,1)-(25,25) 2893 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2894 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2895 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2896 0 0.0 0.0 0.0 0.0 + CAF:main1 Main 2864 0 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2866 1 0.0 0.0 0.0 0.0 + CAF:nextComposite_rfu0 Example источники/Example.hs:45:5-17 2811 0 0.0 0.0 0.0 0.0 + primes Example источники/Example.hs:(61,1)-(117,55) 2950 0 0.0 0.0 0.0 0.0 + primes.large Example источники/Example.hs:65:5-37 2951 0 0.0 0.0 0.0 0.0 + sieve Example источники/Example.hs:(40,1)-(58,53) 2952 0 0.0 0.0 0.0 0.0 + sieve.nextComposite Example источники/Example.hs:45:5-36 2953 1 0.0 0.0 0.0 0.0 + CAF:primesTo10 Example 2810 0 0.0 0.0 0.0 0.1 + primes Example источники/Example.hs:(61,1)-(117,55) 2942 0 0.0 0.0 0.0 0.1 + primes.large Example источники/Example.hs:65:5-37 2943 0 0.0 0.0 0.0 0.1 + primes.spin Example источники/Example.hs:117:5-55 2944 5717 0.0 0.1 0.0 0.1 + CAF:primesTo8 Example 2814 0 0.0 0.0 1.0 1.9 + primes Example источники/Example.hs:(61,1)-(117,55) 2939 0 0.0 0.0 1.0 1.9 + primes.large Example источники/Example.hs:65:5-37 2940 0 0.0 0.0 1.0 1.9 + sieve Example источники/Example.hs:(40,1)-(58,53) 2941 1 0.0 0.0 1.0 1.9 + sieve.sieve' Example источники/Example.hs:(49,5)-(52,46) 2945 5716 0.0 0.1 1.0 1.9 + sieve.adjust Example источники/Example.hs:(54,5)-(58,53) 2966 6524 0.3 0.0 0.7 1.5 + sieve.adjust.(...) Example источники/Example.hs:58:9-53 2968 6524 0.0 0.0 0.3 1.3 + deleteFindMin Data.PQueue.Prio.Min Data/PQueue/Prio/Min.hs:198:1-98 2969 6524 0.0 0.0 0.3 1.3 + minViewWithKey Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(209,1)-(210,70) 2970 6524 0.0 0.0 0.3 1.3 + extractHeap Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(312,1)-(314,48) 2975 3566 0.0 0.0 0.3 1.3 + extractForest Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(354,1)-(363,27) 2976 42471 0.3 0.7 0.3 1.2 + incrExtract Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(345,1)-(348,54) 2986 31818 0.0 0.1 0.0 0.5 + incr Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(297,1)-(300,50) 2991 23574 0.0 0.4 0.0 0.4 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2992 11640 0.0 0.0 0.0 0.0 + meld Data.PQueue.Prio.Internals Data/PQueue/Prio/Internals.hs:(269,1)-(271,46) 2990 11934 0.0 0.0 0.0 0.0 + extractForest. 2808 0 0.0 0.0 0.0 0.0 + primes Example источники/Example.hs:(61,1)-(117,55) 2948 0 0.0 0.0 0.0 0.0 + primes.wheel2357 Example источники/Example.hs:(67,5)-(115,11) 2949 0 0.0 0.0 0.0 0.0 + CAF:run1 Main 2861 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2869 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2870 1 0.0 0.0 0.0 0.0 + CAF:run2 Main 2860 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2872 0 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2873 0 0.0 0.0 0.0 0.0 + CAF:run32 Main 2858 0 0.0 0.0 5.3 5.4 + run Main app/Main.hs:(13,1)-(24,17) 2877 0 0.0 0.0 5.3 5.4 + countSemiprimes Example источники/Example.hs:(12,1)-(17,22) 2880 1 0.0 0.0 5.3 5.4 + countSemiprimes.noOfSemiprimes Example источники/Example.hs:(15,5)-(17,22) 2885 1 1.7 1.3 5.3 5.4 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:36:3-18 3021 200011 0.3 1.7 2.7 2.8 + fmap Data.Vector.Fusion.Stream.Monadic Data/Vector/Fusion/Stream/Monadic.hs:(133,3)-(135,20) 3024 50004 0.7 0.6 2.3 1.0 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1480-1538 3025 50002 0.0 0.0 1.7 0.4 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 3026 50002 1.3 0.4 1.7 0.4 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3030 0 0.3 0.0 0.3 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:433-499 3031 50002 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes.λ Example источники/Example.hs:16:40-64 3041 50001 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 3020 50004 0.0 0.0 0.0 0.0 + basicUnsafeSlice Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1016-1084 3027 50003 0.0 0.0 0.0 0.3 + basicUnsafeSlice Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(94,3)-(95,25) 3028 50003 0.0 0.3 0.0 0.3 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:376:3-73 3035 50001 0.0 0.0 1.0 0.7 + >>= Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:50:3-19 3040 50001 0.7 0.4 0.7 0.4 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3036 50001 0.3 0.3 0.3 0.3 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:220-288 3037 50001 0.0 0.0 0.0 0.0 + + Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(26,3)-(32,29) 3008 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:374:3-42 3004 1 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3005 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:508-575 3050 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3051 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3052 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:241:1176-1228 3010 1 0.0 0.0 0.0 0.1 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 3011 1 0.0 0.0 0.0 0.1 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 3012 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 3013 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 3014 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:263:68-95 3015 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 3016 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3018 1 0.0 0.1 0.0 0.1 + isNSemiprime Example источники/Example.hs:(20,1)-(25,25) 2886 1 0.0 0.0 0.0 0.2 + isNSemiprime.λ Example источники/Example.hs:24:30-57 2925 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:358:3-72 2926 12110 0.0 0.0 0.0 0.1 + basicUnsafeWrite Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:124:3-69 2927 12110 0.0 0.1 0.0 0.1 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2928 12110 0.0 0.0 0.0 0.0 + writeByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:445-514 2929 12110 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:355:3-51 2908 1 0.0 0.0 0.0 0.0 + basicInitialize Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(114,3)-(117,36) 2909 1 0.0 0.0 0.0 0.0 + basicInitialize.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:117:7-36 2910 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2911 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2912 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2913 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2914 1 0.0 0.0 0.0 0.0 + setByteArray# Data.Primitive.Types Data/Primitive/Types.hs:251:521-878 2915 1 0.0 0.0 0.0 0.0 + internal Control.Monad.Primitive Control/Monad/Primitive.hs:96:3-21 2916 1 0.0 0.0 0.0 0.0 + setByteArray#.i Data.Primitive.Types Data/Primitive/Types.hs:251:596-619 2917 1 0.0 0.0 0.0 0.0 + setByteArray#.n Data.Primitive.Types Data/Primitive/Types.hs:251:660-683 2918 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:372:3-70 3001 1 0.0 0.0 0.0 0.0 + basicUnsafeFreeze Data.Vector.Primitive Data/Vector/Primitive.hs:(220,3)-(221,51) 3002 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 3003 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2888 1 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2889 1 0.0 0.0 0.0 0.0 + basicUnsafeNew.mx Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:111:7-37 2890 1 0.0 0.0 0.0 0.0 + primitive Control.Monad.Primitive Control/Monad/Primitive.hs:205:3-16 2907 1 0.0 0.0 0.0 0.0 + isNSemiprime.nSemiprimes Example источники/Example.hs:23:9-40 2919 1 0.0 0.0 0.0 0.1 + semiprimesTo Example источники/Example.hs:28:1-52 2920 1 0.0 0.1 0.0 0.1 + sChunks Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:122:30-36 3019 1 0.0 0.0 0.0 0.0 + sSize Data.Vector.Fusion.Bundle.Monadic Data/Vector/Fusion/Bundle/Monadic.hs:124:30-34 3007 1 0.0 0.0 0.0 0.0 + upperBound Data.Vector.Fusion.Bundle.Size Data/Vector/Fusion/Bundle/Size.hs:(126,1)-(128,30) 3006 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2878 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2879 0 0.0 0.0 0.0 0.0 + CAF:run37 Main 2862 0 0.0 0.0 0.0 0.0 + CAF:run_x Main 2859 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2874 0 0.0 0.0 0.0 0.0 + countSemiprimes Example источники/Example.hs:(12,1)-(17,22) 2881 0 0.0 0.0 0.0 0.0 + countSemiprimes.λ Example источники/Example.hs:13:23-67 2882 9 0.0 0.0 0.0 0.0 + unId Data.Vector.Fusion.Util Data/Vector/Fusion/Util.hs:25:21-24 2884 36 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:664-703 3053 18 0.0 0.0 0.0 0.0 + basicLength Data.Vector.Primitive Data/Vector/Primitive.hs:228:3-32 3054 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:242:817-872 3055 18 0.0 0.0 0.0 0.0 + basicUnsafeIndexM Data.Vector.Primitive Data/Vector/Primitive.hs:234:3-75 3056 18 0.0 0.0 0.0 0.0 + indexByteArray# Data.Primitive.Types Data/Primitive/Types.hs:263:214-279 3057 18 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2875 0 0.0 0.0 0.0 0.0 + program Main app/Main.hs:27:63-65 2876 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-10 2178 0 0.0 0.0 0.0 0.0 + sIZEOF_INT Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:71:1-14 3017 1 0.0 0.0 0.0 0.0 + CAF:sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-12 2194 0 0.0 0.0 0.0 0.0 + sIZEOF_WORD8 Data.Primitive.MachDeps Data/Primitive/MachDeps.hs:95:1-16 2906 1 0.0 0.0 0.0 0.0 + CAF:semiprimes_$ssemiprimes Example источники/Example.hs:31:1-10 2817 0 0.0 0.0 93.7 92.5 + semiprimes Example источники/Example.hs:(31,1)-(33,51) 2921 1 0.0 0.1 93.7 92.5 + semiprimes.λ Example источники/Example.hs:31:29-58 2924 2763 0.0 0.0 93.7 92.4 + semiprimes.facts Example источники/Example.hs:33:5-51 2933 2762 0.0 0.3 0.0 0.5 + primesTo Example источники/Example.hs:36:1-44 2934 2762 0.0 0.2 0.0 0.2 + union Data.List.Ordered Data/List/Ordered.hs:231:1-23 2930 2762 22.3 0.0 93.7 91.9 + unionBy Data.List.Ordered Data/List/Ordered.hs:(235,1)-(243,34) 2931 2762 0.0 0.0 71.4 91.9 + unionBy.loop Data.List.Ordered Data/List/Ordered.hs:(237,6)-(243,34) 2932 7246750 71.4 91.9 71.4 91.9 + CAF:size48_rfui Example 2819 0 0.0 0.0 0.0 0.0 + countSemiprimes Example источники/Example.hs:(12,1)-(17,22) 2897 0 0.0 0.0 0.0 0.0 + countSemiprimes.noOfSemiprimes Example источники/Example.hs:(15,5)-(17,22) 2898 0 0.0 0.0 0.0 0.0 + isNSemiprime Example источники/Example.hs:(20,1)-(25,25) 2899 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Unboxed.Base Data/Vector/Unboxed/Base.hs:354:3-55 2900 0 0.0 0.0 0.0 0.0 + basicUnsafeNew Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:(105,3)-(111,37) 2901 0 0.0 0.0 0.0 0.0 + basicUnsafeNew.size Data.Vector.Primitive.Mutable Data/Vector/Primitive/Mutable.hs:110:7-36 2902 1 0.0 0.0 0.0 0.0 + sizeOf Data.Primitive.Types Data/Primitive/Types.hs:131:1-25 2903 1 0.0 0.0 0.0 0.0 + sizeOf# Data.Primitive.Types Data/Primitive/Types.hs:251:70-99 2904 1 0.0 0.0 0.0 0.0 + unI# Data.Primitive.Types Data/Primitive/Types.hs:246:1-17 2905 1 0.0 0.0 0.0 0.0 + main Main app/Main.hs:10:1-22 2867 0 0.0 0.0 0.0 0.0 + run Main app/Main.hs:(13,1)-(24,17) 2868 1 0.0 0.0 0.0 0.0 + profile Main app/Main.hs:27:1-65 2871 0 0.0 0.0 0.0 0.0