diff options
Diffstat (limited to 'libvmon')
| -rw-r--r-- | libvmon/LICENSE | 674 | ||||
| -rw-r--r-- | libvmon/bitmap.h | 15 | ||||
| -rw-r--r-- | libvmon/defs/_begin.def | 549 | ||||
| -rw-r--r-- | libvmon/defs/_end.def | 43 | ||||
| -rw-r--r-- | libvmon/defs/proc_files.def | 8 | ||||
| -rw-r--r-- | libvmon/defs/proc_io.def | 33 | ||||
| -rw-r--r-- | libvmon/defs/proc_stat.def | 105 | ||||
| -rw-r--r-- | libvmon/defs/proc_vm.def | 19 | ||||
| -rw-r--r-- | libvmon/defs/proc_wants.def | 14 | ||||
| -rw-r--r-- | libvmon/defs/sys_stat.def | 114 | ||||
| -rw-r--r-- | libvmon/defs/sys_vm.def | 169 | ||||
| -rw-r--r-- | libvmon/defs/sys_wants.def | 7 | ||||
| -rw-r--r-- | libvmon/vmon.c | 1634 | ||||
| -rw-r--r-- | libvmon/vmon.h | 308 |
14 files changed, 3692 insertions, 0 deletions
diff --git a/libvmon/LICENSE b/libvmon/LICENSE new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/libvmon/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> + 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. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + 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 <http://www.gnu.org/licenses/>. + +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: + + <program> Copyright (C) <year> <name of author> + 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 +<http://www.gnu.org/licenses/>. + + 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 +<http://www.gnu.org/philosophy/why-not-lgpl.html>. diff --git a/libvmon/bitmap.h b/libvmon/bitmap.h new file mode 100644 index 0000000..eacb97d --- /dev/null +++ b/libvmon/bitmap.h @@ -0,0 +1,15 @@ +#ifndef _BITMAP_H +#define _BITMAP_H + +/* simple implementation of general-purpose bitmap macros taken from the comp.lang.c FAQ */ + +#include <limits.h> /* for CHAR_BIT */ + +#define BITMASK(b) (1 << ((b) % CHAR_BIT)) +#define BITSLOT(b) ((b) / CHAR_BIT) +#define BITSET(a, b) ((a)[BITSLOT(b)] |= BITMASK(b)) +#define BITCLEAR(a, b) ((a)[BITSLOT(b)] &= ~BITMASK(b)) +#define BITTEST(a, b) ((a)[BITSLOT(b)] & BITMASK(b)) +#define BITNSLOTS(nb) ((nb + CHAR_BIT - 1) / CHAR_BIT) + +#endif diff --git a/libvmon/defs/_begin.def b/libvmon/defs/_begin.def new file mode 100644 index 0000000..047fd4d --- /dev/null +++ b/libvmon/defs/_begin.def @@ -0,0 +1,549 @@ +/* the common types are handled in _begin.def and _end.def, individual .def files are free to create special types as well, but should + * provide macros for all the ifdef's supported here for any additions. + */ + +/* for declaring the want-specific sample data structure (used by vmon.h) */ +#ifdef VMON_DECLARE_MEMBERS +#define vmon_datum_str(_name, _sym, _label, _desc) char *_name; +#define vmon_datum_str_array(_name, _sym, _label, _desc) char **_name; +#define vmon_datum_char(_name, _sym, _label, _desc) char _name; +#define vmon_datum_char_array(_name, _sym, _label, _desc) vmon_char_array_t _name; +#define vmon_datum_int(_name, _sym, _label, _desc) int _name; +#define vmon_datum_uint(_name, _sym, _label, _desc) unsigned int _name; +#define vmon_datum_ulong(_name, _sym, _label, _desc) unsigned long _name; +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) unsigned long long _name; +#define vmon_datum_long(_name, _sym, _label, _desc) long _name; +#define vmon_datum_longlong(_name, _sym, _label, _desc) long long _name; + +/* leave omissions undefined, they'll get defined as noops at the end of this file */ +#endif + + + +/* for creating the symbolic constants enumeration (used by vmon.h) */ +#ifdef VMON_ENUM_SYMBOLS +#define vmon_datum_str(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_str_array(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_char(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_char_array(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_int(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_uint(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_ulong(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_long(_name, _sym, _label, _desc) VMON_ ## _sym, +#define vmon_datum_longlong(_name, _sym, _label, _desc) VMON_ ## _sym, + +/* leave omissions undefined, they'll get defined as noops at the end of this file */ +#endif + + + +/* for creating an offset table relating symbols to struct member offsets */ +#ifdef VMON_INITIALIZE_OFFSET_TABLE +/* TODO: error out using #error if VMON_OFFSET_TABLE_STRUCT is not defined */ +/* I use the gcc builtin here because it's convenient, otherwise we either do the double macro expansion dance or put the offsetof definition here */ +#define vmon_datum_str(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_str_array(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_char(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_char_array(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_int(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_uint(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_ulong(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_long(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), +#define vmon_datum_longlong(_name, _sym, _label, _desc) __builtin_offsetof(VMON_OFFSET_TABLE_STRUCT, _name), + +/* no offsets can exist for omitted members, so they're declared as nops */ +/* leave omissions undefined, they'll get defined as noops at the end of this file */ +#endif + + + +/* for creating a lookup table for the member names as strings, indexed by the enumerated symbols */ +#ifdef VMON_INITIALIZE_NAME_TABLE +#define vmon_datum_str(_name, _sym, _label, _desc) #_name , +#define vmon_datum_str_array(_name, _sym, _label, _desc) #_name , +#define vmon_datum_char(_name, _sym, _label, _desc) #_name , +#define vmon_datum_char_array(_name, _sym, _label, _desc) #_name , +#define vmon_datum_int(_name, _sym, _label, _desc) #_name , +#define vmon_datum_uint(_name, _sym, _label, _desc) #_name , +#define vmon_datum_ulong(_name, _sym, _label, _desc) #_name , +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) #_name , +#define vmon_datum_long(_name, _sym, _label, _desc) #_name , +#define vmon_datum_longlong(_name, _sym, _label, _desc) #_name , + +/* leave omissions undefined, they'll get defined as noops at the end of this file */ +#endif + + + +/* for creating a lookup table for the human-readable descriptions, indexed by the enumerated symbols */ +#ifdef VMON_INITIALIZE_DESC_TABLE +#define vmon_datum_str(_name, _sym, _label, _desc) _desc , +#define vmon_datum_str_array(_name, _sym, _label, _desc) _desc , +#define vmon_datum_char(_name, _sym, _label, _desc) _desc , +#define vmon_datum_char_array(_name, _sym, _label, _desc) _desc , +#define vmon_datum_int(_name, _sym, _label, _desc) _desc , +#define vmon_datum_uint(_name, _sym, _label, _desc) _desc , +#define vmon_datum_ulong(_name, _sym, _label, _desc) _desc , +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) _desc , +#define vmon_datum_long(_name, _sym, _label, _desc) _desc , +#define vmon_datum_longlong(_name, _sym, _label, _desc) _desc , + +/* leave omissions undefined, they'll get defined as noops at the end of this file */ +#endif + + + +/* these are different from the symbols, because they ignore the omissions, the definition includes all fields so we can parse the file, + * but the symbols only relate to fields we actually store in memory. */ +#ifdef VMON_ENUM_PARSER_STATES +#define vmon_datum_str(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_str_array(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_char(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_char_array(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_int(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_uint(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_ulong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_long(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_datum_longlong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, + +#define vmon_omit_n(_n, _sym, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_literal(_lit, _sym) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_run(_char, _sym) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_str(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_str_array(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_char(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_char_array(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_int(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_uint(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_ulong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_ulonglong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_long(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#define vmon_omit_longlong(_name, _sym, _label, _desc) VMON_PARSER_STATE_ ## _sym, +#endif + + +/* most the stuff we need in scope for the parser generated via VMON_IMPLEMENT_PARSER before including the appropriate .def */ +#ifdef VMON_PREPARE_PARSER + char input; + int var_isneg = 0; + int var_int = 0; + unsigned int var_uint = 0; + long var_long = 0; + long long var_longlong = 0; + unsigned long var_ulong = 0; + unsigned long long var_ulonglong = 0; + char *var_array = NULL; + int var_array_alloc_len = 0, var_array_len = 0; + +#define vmon_datum_str(_name, _sym, _label, _desc) +#define vmon_datum_str_array(_name, _sym, _label, _desc) +#define vmon_datum_char(_name, _sym, _label, _desc) +#define vmon_datum_char_array(_name, _sym, _label, _desc) +#define vmon_datum_int(_name, _sym, _label, _desc) +#define vmon_datum_uint(_name, _sym, _label, _desc) +#define vmon_datum_ulong(_name, _sym, _label, _desc) +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) +#define vmon_datum_long(_name, _sym, _label, _desc) +#define vmon_datum_longlong(_name, _sym, _label, _desc) + +#define vmon_omit_n(_n, _sym, _desc) +#define vmon_omit_literal(_lit, _sym) +#define vmon_omit_run(_char, _sym) +#define vmon_omit_str(_name, _sym, _label, _desc) +#define vmon_omit_str_array(_name, _sym, _label, _desc) +#define vmon_omit_char(_name, _sym, _label, _desc) +#define vmon_omit_char_array(_name, _sym, _label, _desc) +#define vmon_omit_int(_name, _sym, _label, _desc) +#define vmon_omit_uint(_name, _sym, _label, _desc) +#define vmon_omit_ulong(_name, _sym, _label, _desc) +#define vmon_omit_ulonglong(_name, _sym, _label, _desc) +#define vmon_omit_long(_name, _sym, _label, _desc) +#define vmon_omit_longlong(_name, _sym, _label, _desc) +#endif + + +/* implements the cases for a simple switch()-based bytestream parser */ +#ifdef VMON_IMPLEMENT_PARSER +/* TODO: error out if the following aren't defined, these are utilized by the parser FSM: + * VMON_PARSER_DELIM <-- what value to treat as a delimiter for string/char arrays (sort of like IFS in bash) + * TODO: there are a bunch of variables we assume are available and named a certain way here, + * it would be preferable to be able to define those externally and inform the x-macro of their + * names etc. + */ +#define vmon_datum_str(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case VMON_PARSER_DELIM:\ + /* store accumulated string, reset tmp, and advance */\ + if(*store)->_name) {\ + if( strncmp((*store)->name, _array, var_array_len) ||\ + (*store)->name[var_array_len] != '\0') {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + }\ + free((*store)->name);\ + } else {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + }\ + (*store)->_name = strndup(var_array, var_array_len);\ + var_array_len = 0;\ + state++;\ + break;\ + default:\ + /* accumulate string */\ + var_array[var_array_len++] = input;\ + break;\ + }\ + break; + +#define vmon_datum_str_array(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + /* TODO ? */ \ + break; + +#define vmon_datum_char(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + if((*store)->_name != input) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = input;\ + }\ + state++;\ + break; + +#define vmon_datum_char_array(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + /* TODO */\ + /* TODO */\ + break; + +#define vmon_datum_int(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '-':\ + /* TODO: we don't verify the '-' is leading... */\ + var_isneg = 1;\ + break;\ + case '0' ... '9':\ + var_int *= 10;\ + var_int += input - '0';\ + break;\ + default:\ + if(var_isneg) {\ + var_int = -var_int;\ + var_isneg = 0;\ + }\ + if((*store)->_name != var_int) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_int;\ + }\ + var_int = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_datum_uint(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + var_uint *= 10;\ + var_uint += input - '0';\ + break;\ + default:\ + if((*store)->_name != var_uint) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_uint;\ + }\ + var_uint = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_datum_ulong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + var_ulong *= 10;\ + var_ulong += input - '0';\ + break;\ + default:\ + if((*store)->_name != var_ulong) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_ulong;\ + }\ + var_ulong = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_datum_ulonglong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + var_ulonglong *= 10;\ + var_ulonglong += input - '0';\ + break;\ + default:\ + if((*store)->_name != var_ulonglong) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_ulonglong;\ + }\ + var_ulonglong = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_datum_long(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '-':\ + /* TODO: we dont verify the '-' is leading... */\ + var_isneg = 1;\ + break;\ + case '0' ... '9':\ + var_long *= 10;\ + var_long += input - '0';\ + break;\ + default:\ + if(var_isneg) {\ + var_long = -var_long;\ + var_isneg = 0;\ + }\ + if((*store)->_name != var_long) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_long;\ + }\ + var_long = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_datum_longlong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '-':\ + /* TODO: we dont verify the '-' is leading... */\ + var_isneg = 1;\ + break;\ + case '0' ... '9':\ + var_longlong *= 10;\ + var_longlong += input - '0';\ + break;\ + default:\ + if(var_isneg) {\ + var_longlong = -var_longlong;\ + var_isneg = 0;\ + }\ + if((*store)->_name != var_longlong) {\ + BITSET((*store)->changed, VMON_ ## _sym);\ + changes++;\ + (*store)->_name = var_longlong;\ + }\ + var_longlong = 0;\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +/* parse but simply skip omitted fields, advance on the delimiter */ +#define vmon_omit_n(_n, _sym, _desc) case VMON_PARSER_STATE_ ## _sym:\ + var_int++;\ + if(var_int >= _n) {\ + var_int = 0;\ + state++;\ + }\ + break; + +#define vmon_omit_literal(_lit, _sym) case VMON_PARSER_STATE_ ## _sym:\ + /* TODO make this actually match the literal, for now we skip the length. */ \ + var_int++;\ + if(var_int >= (sizeof(_lit) - 1)) {\ + var_int = 0;\ + state++;\ + }\ + break; + +#define vmon_omit_run(_char, _sym) case VMON_PARSER_STATE_ ## _sym:\ + if(input != _char) {\ + state++;\ + /* XXX: we fall-through to the next case because this byte belongs to the next state */\ + } else {\ + break;\ + } + + +#define vmon_omit_str(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + if(input == VMON_PARSER_DELIM) {\ + state++;\ + } else {\ + break;\ + } + +#define vmon_omit_str_array(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + if(input == VMON_PARSER_DELIM) {\ + state++;\ + } else {\ + break;\ + } + +#define vmon_omit_char(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + state++;\ + break; + +#define vmon_omit_char_array(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + if(input == VMON_PARSER_DELIM) {\ + state++;\ + } else {\ + break;\ + } + +#define vmon_omit_int(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + case '-':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_omit_uint(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_omit_ulong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_omit_ulonglong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_omit_long(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + case '-':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } + +#define vmon_omit_longlong(_name, _sym, _label, _desc) case VMON_PARSER_STATE_ ## _sym:\ + switch(input) {\ + case '0' ... '9':\ + case '-':\ + break;\ + default:\ + state++;\ + break;\ + }\ + if(state == VMON_PARSER_STATE_ ## _sym) {\ + /* we want to fall-through when the state advances */\ + break;\ + } +#endif + + +/* for convenience, if the omit macros are undefind define them as noops, since that's the most common pattern */ +/* XXX TODO: we may need to add some mechanism for informing the VMON_SUPPRESS_UNDEFS clause in _end.def when these + * have been automatically defined vs. explicitly defined. When automatically defined, we should undefine them regarldess + * of undef suppression. But when they are explicitly defined prior to entering here, we should honor the undef suppression. + * I'm going to leave it as-is for now until it bites me in the ass. + */ +#ifndef vmon_omit_n +# define vmon_omit_n(_n, _sym, _desc) +#endif +#ifndef vmon_omit_literal +# define vmon_omit_literal(_lit, _sym) +#endif +#ifndef vmon_omit_run +# define vmon_omit_run(_char, _sym) +#endif +#ifndef vmon_omit_str +# define vmon_omit_str(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_str_array +# define vmon_omit_str_array(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_char +# define vmon_omit_char(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_char_array +# define vmon_omit_char_array(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_int +# define vmon_omit_int(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_uint +# define vmon_omit_uint(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_ulong +# define vmon_omit_ulong(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_ulonglong +# define vmon_omit_ulonglong(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_long +# define vmon_omit_long(_name, _sym, _label, _desc) +#endif +#ifndef vmon_omit_longlong +# define vmon_omit_longlong(_name, _sym, _label, _desc) +#endif diff --git a/libvmon/defs/_end.def b/libvmon/defs/_end.def new file mode 100644 index 0000000..9243349 --- /dev/null +++ b/libvmon/defs/_end.def @@ -0,0 +1,43 @@ +#ifndef VMON_SUPPRESS_UNDEFS + +/* XXX TODO: we may need to detect and manage the automatic definition of the vmon_omit_* definitions */ + +#undef vmon_datum_str +#undef vmon_datum_str_array +#undef vmon_datum_char +#undef vmon_datum_char_array +#undef vmon_datum_int +#undef vmon_datum_uint +#undef vmon_datum_ulong +#undef vmon_datum_ulonglong +#undef vmon_datum_long +#undef vmon_datum_longlong +#undef vmon_omit_n +#undef vmon_omit_literal +#undef vmon_omit_run +#undef vmon_omit_str +#undef vmon_omit_str_array +#undef vmon_omit_char +#undef vmon_omit_char_array +#undef vmon_omit_int +#undef vmon_omit_uint +#undef vmon_omit_ulong +#undef vmon_omit_ulonglong +#undef vmon_omit_long +#undef vmon_omit_longlong +#undef VMON_DECLARE_MEMBERS +#undef VMON_DECLARE_CHANGEBITS +#undef VMON_ENUM_SYMBOLS +#undef VMON_ASSIGN_NAME_TABLE +#undef VMON_ASSIGN_DESC_TABLE +#undef VMON_ENUM_PARSER_STATES +#undef VMON_PREPARE_PARSER +#undef VMON_IMPLEMENT_PARSER +#undef VMON_PARSER_DELIM +#undef vmon_want + +#else + +#undef VMON_SUPPRESS_UNDEFS + +#endif diff --git a/libvmon/defs/proc_files.def b/libvmon/defs/proc_files.def new file mode 100644 index 0000000..6e3db98 --- /dev/null +++ b/libvmon/defs/proc_files.def @@ -0,0 +1,8 @@ +#include "_begin.def" + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/$pid/fd */ +vmon_datum_int( fdnum, FILES_FDNUM, "FdNum", "File descriptor number (historically 0-255)") +vmon_datum_char_array( object_path, FILES_OBJPATH, "ObjPath", "Object path this descriptor represents a handle for") + +#include "_end.def" diff --git a/libvmon/defs/proc_io.def b/libvmon/defs/proc_io.def new file mode 100644 index 0000000..0e1776d --- /dev/null +++ b/libvmon/defs/proc_io.def @@ -0,0 +1,33 @@ +#include "_begin.def" + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/$pid/io */ +vmon_omit_literal("rchar: ", PROC_IO_RCHAR_LABEL) +vmon_datum_ulonglong( rchars, PROC_IO_RCHAR, "CharsRead", "Characters read (all)") +vmon_omit_literal("\n", PROC_IO_RCHAR_NL) + +vmon_omit_literal("wchar: ", PROC_IO_WCHAR_LABEL) +vmon_datum_ulonglong( wchars, PROC_IO_WCHAR, "CharsWritten", "Characters written (all)") +vmon_omit_literal("\n", PROC_IO_WCHAR_NL) + +vmon_omit_literal("syscr: ", PROC_IO_SYSCR_LABEL) +vmon_datum_ulonglong( syscr, PROC_IO_SYSCR, "SysReads", "Read system calls") +vmon_omit_literal("\n", PROC_IO_SYSCR_NL) + +vmon_omit_literal("syscw: ", PROC_IO_SYSCW_LABEL) +vmon_datum_ulonglong( syscw, PROC_IO_SYSCW, "SysWrites", "Write system calls") +vmon_omit_literal("\n", PROC_IO_SYSCW_NL) + +vmon_omit_literal("read_bytes: ", PROC_IO_READBYTES_LABEL) +vmon_datum_ulonglong( read_bytes, PROC_IO_READBYTES, "BytesReadIO", "Bytes read from storage") +vmon_omit_literal("\n", PROC_IO_READBYTES_NL) + +vmon_omit_literal("write_bytes: ", PROC_IO_WRITEBYTES_LABEL) +vmon_datum_ulonglong( write_bytes, PROC_IO_WRITEBYTES, "BytesWrittenIO", "Bytes written to storage") +vmon_omit_literal("\n", PROC_IO_WRITEBYTES_NL) + +vmon_omit_literal("cancelled_write_bytes: ", PROC_IO_CANCELLED_WRITEBYTES_LABEL) +vmon_datum_ulonglong( cancelled_write_bytes, PROC_IO_CANCELLED_WRITEBYTES, "CancelledWriteBytes", "Bytes written but canceled before reaching storage (truncate)") +vmon_omit_literal("\n", PROC_IO_CANCELLED_WRITEBYTES_NL) + +#include "_end.def" diff --git a/libvmon/defs/proc_stat.def b/libvmon/defs/proc_stat.def new file mode 100644 index 0000000..db704e9 --- /dev/null +++ b/libvmon/defs/proc_stat.def @@ -0,0 +1,105 @@ +#include "_begin.def" + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/$pid/comm */ +vmon_datum_char_array( comm, PROC_STAT_COMM, "Cmd", "/proc/$pid/comm raw contents (with the \n substituted with \0)") + + /* /proc/$pid/cmdline */ +vmon_datum_char_array( cmdline, PROC_STAT_CMDLINE, "Cmdline", "/proc/$pid/cmdline raw contents") +vmon_datum_int( argc, PROC_STAT_ARGC, "Argc", "parsed cmdline count as if executed") +vmon_datum_str_array( argv, PROC_STAT_ARGV, "Argv", "parsed cmdline argv contents as if executed, pointers into cmdline") + + /* /proc/$pid/exe */ +vmon_datum_char_array( exe, PROC_STAT_EXE, "ExePath", "/proc/$pid/exe symlink target") + + /* /proc/$pid/wchan */ +vmon_datum_char_array( wchan, PROC_STAT_WCHAN, "WChan", "/proc/$pid/wchan raw contents (address resolved)") + + /* /proc/$pid/stat */ +vmon_datum_int( pid, PROC_STAT_PID, "PID", "the process id") +vmon_omit_n( (*store)->comm.len + 3, PROC_STAT_COMM_, "the filename of the executable, in parentheses, skipped") +vmon_datum_char( state, PROC_STAT_STATE, "State", "process state, one of \"RSDZTW\"") +vmon_omit_run( ' ', PROC_STAT_PPID_SP) +vmon_datum_longlong( ppid, PROC_STAT_PPID, "PPId", "parent pid") +vmon_omit_run( ' ', PROC_STAT_PGID_SP) +vmon_datum_longlong( pgrp, PROC_STAT_PGID, "PGId", "parent process group") +vmon_omit_run( ' ', PROC_STAT_SID_SP) +vmon_datum_longlong( sid, PROC_STAT_SID, "SessionId", "session id") +vmon_omit_run( ' ', PROC_STAT_TTY_NR_SP) +vmon_datum_longlong( tty_nr, PROC_STAT_TTY_NR, "Tty", "controlling terminal of the process") +vmon_omit_run( ' ', PROC_STAT_TPGID_SP) +vmon_datum_longlong( tpgid, PROC_STAT_TPGID, "CtrlPGid", "id of the foreground process group of the controlling terminal of the process") +vmon_omit_run( ' ', PROC_STAT_FLAGS_SP) +vmon_datum_ulonglong( flags, PROC_STAT_FLAGS, "Flags", "the kernel flags of the process (see PF_* in the non-uapi <linux/sched.h>)") +vmon_omit_run( ' ', PROC_STAT_MINFLT_SP) +vmon_datum_ulonglong( minflt, PROC_STAT_MINFLT, "MnrFlts", "the number of minor faults (no hitting disk)") +vmon_omit_run( ' ', PROC_STAT_CMINFLT_SP) +vmon_datum_ulonglong( cminflt, PROC_STAT_CMINFLT, "ChldMnrFlts", "number of minor faults waited-for children have made") +vmon_omit_run( ' ', PROC_STAT_MAJFLT_SP) +vmon_datum_ulonglong( majflt, PROC_STAT_MAJFLT, "MjrFlts", "the number of major faults (hit disk)") +vmon_omit_run( ' ', PROC_STAT_CMAJFLT_SP) +vmon_datum_ulonglong( cmajflt, PROC_STAT_CMAJFLT, "ChldMjrFlts", "the number of major faults waited-for children have made") +vmon_omit_run( ' ', PROC_STAT_UTIME_SP) +vmon_datum_ulonglong( utime, PROC_STAT_UTIME, "UsrCPU", "amount of time this process has spent in user mode (ticks)") +vmon_omit_run( ' ', PROC_STAT_STIME_SP) +vmon_datum_ulonglong( stime, PROC_STAT_STIME, "SysCPU", "amount of time this process has spent in kernel mode (ticks)") +vmon_omit_run( ' ', PROC_STAT_CUTIME_SP) +vmon_datum_longlong( cutime, PROC_STAT_CUTIME, "ChldUsrCPU", "amount of time the waited-for children have spent in user mode (ticks)") +vmon_omit_run( ' ', PROC_STAT_CSTIME_SP) +vmon_datum_longlong( cstime, PROC_STAT_CSTIME, "ChldSysCPU", "amount of time the waited-for children have spent in kernel mode (ticks)") +vmon_omit_run( ' ', PROC_STAT_PRIORITY_SP) +vmon_datum_longlong( priority, PROC_STAT_PRIORITY, "Priority", "priority of the process") +vmon_omit_run( ' ', PROC_STAT_NICE_SP) +vmon_datum_longlong( nice, PROC_STAT_NICE, "Nice", "nice value") +vmon_omit_run( ' ', PROC_STAT_NUM_THREADS_SP) +vmon_datum_longlong( num_threads, PROC_STAT_NUM_THREADS, "NumThreads", "number of threads") +vmon_omit_run( ' ', PROC_STAT_ALARM_SP) +vmon_omit_ulonglong( itrealvalue, PROC_STAT_ALARM, "NextAlarm", "the time in jiffies before the next SIGALRM is sent (not maintained)") +vmon_omit_run( ' ', PROC_STAT_START_SP) +vmon_datum_ulonglong( start, PROC_STAT_START, "StartTime", "start time relative to system boot in jiffies") +vmon_omit_run( ' ', PROC_STAT_VSIZE_SP) +vmon_datum_ulonglong( vsize, PROC_STAT_VSIZE, "VirtSize", "virtual memory size (bytes)") +vmon_omit_run( ' ', PROC_STAT_RSS_SP) +vmon_datum_ulonglong( rss, PROC_STAT_RSS, "ResSize", "resident set size (bytes)") +vmon_omit_run( ' ', PROC_STAT_RSSLIM_SP) +vmon_datum_ulonglong( rsslim, PROC_STAT_RSSLIM, "ResSizeLimit", "resident set size ulimit") +vmon_omit_run( ' ', PROC_STAT_STARTCODE_SP) +vmon_omit_ulonglong( startcode, PROC_STAT_STARTCODE, "CodeStart", "address above which program text can run") +vmon_omit_run( ' ', PROC_STAT_ENDCODE_SP) +vmon_omit_ulonglong( endcode, PROC_STAT_ENDCODE, "CodeEnd", "address below which program text can run") +vmon_omit_run( ' ', PROC_STAT_STARTSTACK_SP) +vmon_omit_ulonglong( startstack, PROC_STAT_STARTSTACK, "StackStart", "address of the stack start") +vmon_omit_run( ' ', PROC_STAT_ESP_SP) +vmon_omit_ulonglong( kstkesp, PROC_STAT_ESP, "StackPtr", "current stack pointer") +vmon_omit_run( ' ', PROC_STAT_EIP_SP) +vmon_omit_ulonglong( kstkeip, PROC_STAT_EIP, "InstructnPtr", "current instruction pointer") +vmon_omit_run( ' ', PROC_STAT_SIGNAL_SP) +vmon_omit_ulonglong( signal, PROC_STAT_SIGNAL, "SigsPending", "bitmap of pending signals") +vmon_omit_run( ' ', PROC_STAT_SIGBLOCKED_SP) +vmon_omit_ulonglong( blocked, PROC_STAT_SIGBLOCKED, "SigsBlocked", "bitmap of blocked signals") +vmon_omit_run( ' ', PROC_STAT_SIGIGNORED_SP) +vmon_omit_ulonglong( ignored, PROC_STAT_SIGIGNORED, "SigsIgnored", "bitmap of ignored signals") +vmon_omit_run( ' ', PROC_STAT_SIGCAUGHT_SP) +vmon_omit_ulonglong( caught, PROC_STAT_SIGCAUGHT, "SigsCaught", "bitmap of caughtsignals") +vmon_omit_run( ' ', PROC_STAT_WCHAN_ADDR_SP) +vmon_datum_ulonglong( wchan_addr, PROC_STAT_WCHAN_ADDR, "WchanAddr", "address of the process' wchan") +vmon_omit_run( ' ', PROC_STAT_SWAPPED_SP) +vmon_omit_ulonglong( nswap, PROC_STAT_SWAPPED, "NumSwapped", "number of pages swapped (not maintained)") +vmon_omit_run( ' ', PROC_STAT_CSWAPPED_SP) +vmon_omit_ulonglong( cnswap, PROC_STAT_CSWAPPED, "ChldNumSwpd", "number of cumulative pages swapped for children (not maintained)") +vmon_omit_run( ' ', PROC_STAT_EXITSIGNAL_SP) +vmon_omit_longlong( exit_signal, PROC_STAT_EXITSIGNAL, "ExitSignal", "signal to be sent to parent when we die") +vmon_omit_run( ' ', PROC_STAT_PROCESSOR_SP) +vmon_datum_longlong( processor, PROC_STAT_PROCESSOR, "LastCPU", "CPU number last executed on") +vmon_omit_run( ' ', PROC_STAT_RT_PRIORITY_SP) +vmon_omit_ulonglong( rt_priority, PROC_STAT_RT_PRIORITY, "RTPriority", "realtime priority of the process") +vmon_omit_run( ' ', PROC_STAT_POLICY_SP) +vmon_omit_ulonglong( policy, PROC_STAT_POLICY, "SchedPolicy", "scheduling policy of the process") +vmon_omit_run( ' ', PROC_STAT_DELAY_BLKIO_SP) +vmon_datum_ulonglong( delay_blkio, PROC_STAT_DELAY_BLKIO, "BlkIODelays", "aggregated block IO delays, in ticks") +vmon_omit_run( ' ', PROC_STAT_GUEST_TIME_SP) +vmon_datum_ulonglong( guest_time, PROC_STAT_GUEST_TIME, "GuestTime", "time spent running a virtual cpu for a guest OS") +vmon_omit_run( ' ', PROC_STAT_CGUEST_TIME_SP) +vmon_datum_longlong( cguest_time, PROC_STAT_CGUEST_TIME, "ChldGuestTim", "time spent running a virtual cpu for a guest OS in (waited for?) children") + +#include "_end.def" diff --git a/libvmon/defs/proc_vm.def b/libvmon/defs/proc_vm.def new file mode 100644 index 0000000..9028272 --- /dev/null +++ b/libvmon/defs/proc_vm.def @@ -0,0 +1,19 @@ +#include "_begin.def" + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/$pid/statm */ +vmon_datum_ulonglong( size_pages, PROC_VM_SIZE_PAGES, "Size", "Size in pages") +vmon_omit_run( ' ', PROC_VM_RESIDENT_PAGES_SP) +vmon_datum_ulonglong( resident_pages, PROC_VM_RESIDENT_PAGES, "Resident", "Resident set size in pages") +vmon_omit_run( ' ', PROC_VM_SHARED_PAGES_SP) +vmon_datum_ulonglong( shared_pages, PROC_VM_SHARED_PAGES, "Shared", "Shared size in pages") +vmon_omit_run( ' ', PROC_VM_TEXT_PAGES_SP) +vmon_datum_ulonglong( text_pages, PROC_VM_TEXT_PAGES, "Text", "Text segment size in pages") +vmon_omit_run( ' ', PROC_VM_LIB_PAGES_SP) +vmon_omit_ulonglong( lib_pages, PROC_VM_LIB_PAGES, "Library", "Library segment size (skipped, unused in 2.6)") +vmon_omit_run( ' ', PROC_VM_DATA_PAGES_SP) +vmon_datum_ulonglong( data_pages, PROC_VM_DATA_PAGES, "Data", "Data segment size in pages") +vmon_omit_run( ' ', PROC_VM_DIRTY_PAGES_SP) +vmon_omit_ulonglong( dirty_pages, PROC_VM_DIRTY_PAGES, "Dirty", "Dirtied (skipped, unused in 2.6)") + +#include "_end.def" diff --git a/libvmon/defs/proc_wants.def b/libvmon/defs/proc_wants.def new file mode 100644 index 0000000..7f02602 --- /dev/null +++ b/libvmon/defs/proc_wants.def @@ -0,0 +1,14 @@ +#include "_begin.def" + +/* the available per-process wants, the order here matters, put wants which affect the sampling heirarchy first */ +/* otherwise they will change the heirarchy after samples have been collected, leaving newly introduced nodes with uninitialized sample stores after return from vmon_sample() */ + +/* sym, name, internal fulfilllment function */ +vmon_want(PROC_FOLLOW_CHILDREN, proc_follow_children, proc_follow_children) +vmon_want(PROC_FOLLOW_THREADS, proc_follow_threads, proc_follow_threads) +vmon_want(PROC_FILES, proc_files, proc_sample_files) +vmon_want(PROC_STAT, proc_stat, proc_sample_stat) +vmon_want(PROC_VM, proc_vm, proc_sample_vm) +vmon_want(PROC_IO, proc_io, proc_sample_io) + +#include "_end.def" diff --git a/libvmon/defs/sys_stat.def b/libvmon/defs/sys_stat.def new file mode 100644 index 0000000..ef8b9a7 --- /dev/null +++ b/libvmon/defs/sys_stat.def @@ -0,0 +1,114 @@ +#include "_begin.def" + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/stat */ + +/* a cpu row, this is shown once for the total prefixed with "cpu ", then again for every cpu prefixed with "cpuN ", newlines terminate rows */ +vmon_omit_n( 5, SYS_STAT_CPU_PREFIX, "cpu line \"cpu \" prefix") +vmon_datum_ulonglong( user, SYS_STAT_CPU_USER, "UserTime", "Time spent in user mode (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_NICE_SP) +vmon_datum_ulonglong( nice, SYS_STAT_CPU_NICE, "NiceTime", "Time spent in user mode with low priority (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_SYS_SP) +vmon_datum_ulonglong( system, SYS_STAT_CPU_SYS, "SysTime", "Time spent in system mode (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_IDLE_SP) +vmon_datum_ulonglong( idle, SYS_STAT_CPU_IDLE, "IdleTime", "Time spent in the idle task (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_IOWAIT_SP) +vmon_datum_ulonglong( iowait, SYS_STAT_CPU_IOWAIT, "IOWaitTime", "Time spent runnable but waiting for IO (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_IRQ_SP) +vmon_datum_ulonglong( irq, SYS_STAT_CPU_IRQ, "IRQTime", "Time spent in IRQ context (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_SIRQ_SP) +vmon_datum_ulonglong( softirq, SYS_STAT_CPU_SIRQ, "SoftIRQTime", "Time spent in the softirq context (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_STEAL_SP) +vmon_datum_ulonglong( steal, SYS_STAT_CPU_STEAL, "StealTime", "Time spent in a virtualized environment (ticks)") +vmon_omit_run( ' ', SYS_STAT_CPU_GUEST_SP) +vmon_datum_ulonglong( guest, SYS_STAT_CPU_GUEST, "GuestTime", "Time spent in a virtual cpu (ticks)") +vmon_omit_literal( "\n", SYS_STAT_CPU_NL) + + + + +#if 0 +/* here we want to embed a list of a cpus, the cpu entries need to be a composite type which needs */ + +/* TODO: the rest of /proc/stat, need to develop the macro language further to cleanly support the variable structures like N cpu rows etc... */ +vmon_heredef_list_begin( cpus, SYS_STAT_CPUS, "CPUs", "CPU time accounts for every cpu in the system") +/* we probably should somehow express which field is to be used as an index for addressing the array elements (and growing as needed) */ +vmon_omit_n( 5, SYS_STAT_PERCPU_PREFIX, "cpu line \"cpu \" prefix") +vmon_datum_ulonglong( user, SYS_STAT_PERCPU_USER, "UserTime", "Time spent in user mode (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_NICE_SP) +vmon_datum_ulonglong( nice, SYS_STAT_PERCPU_NICE, "NiceTime", "Time spent in user mode with low priority (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_SYS_SP) +vmon_datum_ulonglong( system, SYS_STAT_PERCPU_SYS, "SysTime", "Time spent in system mode (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_IDLE_SP) +vmon_datum_ulonglong( idle, SYS_STAT_PERCPU_IDLE, "IdleTime", "Time spent in the idle task (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_IOWAIT_SP) +vmon_datum_ulonglong( iowait, SYS_STAT_PERCPU_IOWAIT, "IOWaitTime", "Time spent runnable but waiting for IO (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_IRQ_SP) +vmon_datum_ulonglong( irq, SYS_STAT_PERCPU_IRQ, "IRQTime", "Time spent in IRQ context (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_SIRQ_SP) +vmon_datum_ulonglong( softirq, SYS_STAT_PERCPU_SIRQ, "SoftIRQTime", "Time spent in the softirq context (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_STEAL_SP) +vmon_datum_ulonglong( steal, SYS_STAT_PERCPU_STEAL, "StealTime", "Time spent in a virtualized environment (ticks)") +vmon_omit_run( ' ', SYS_STAT_PERCPU_GUEST_SP) +vmon_datum_ulonglong( guest, SYS_STAT_PERCPU_GUEST, "GuestTime", "Time spent in a virtual cpu (ticks)") +vmon_omit_literal( "\n", SYS_STAT_PERCPU_NL) +vmon_heredef_list_end( cpus, SYS_STAT_CPUS) + +/* we make the interrupts array dynamic, which is kind of annoying, since in older/simple XT-PIC systems it could be simply an array of 16 elements, + and the calling code could have made assumptions about the layout. Taking this approach to accomodate modern systems also forces calling code to + be more indirect about accessing the members of this array, less assumptions can be made, such is life. I considered using a simple static array with + named directly-accessible members in the CONFIG_GENERIC_HARDIRQS case, but that would encourage creating programs dependent on that case which would + then not work unmodified on the newer (and more common, now) complicated irq routing case. :( + */ +vmon_omit_literal("intr", SYS_STAT_IRQS_PREFIX) +vmon_heredef_array_begin( irqs, SYS_STAT_IRQS, "IRQs", "Counters for all interrupts in the system") +vmon_omit_literal(" ", SYS_STAT_IRQS_SP) +vmon_datum_ulonglong( count, SYS_STAT_PERIRQ_COUNT) +vmon_heredef_array_end( irqs, SYS_STAT_IRQS) +vmon_omit_literal("\n", SYS_STAT_IRQS_NL) + +vmon_omit_literal("ctxt ", SYS_STAT_CTXT_SWITCHES_PREFIX) +vmon_datum_ulonglong( ctxt, SYS_STAT_CTXT_SWITCHES, "CXs", "Count of context switches since boot") +vmon_omit_literal("\n", SYS_STAT_CTXT_SWITCHES_NL) + +vmon_omit_literal("btime ", SYS_STAT_BOOTTIME_PREFIX) +vmon_datum_ulong( boot_time, SYS_STAT_BOOTTIME, "BootTime", "Number of seconds since epoch the system booted at") +vmon_omit_literal("\n", SYS_STAT_BOOTTIME_NL) + +vmon_omit_literal("processes ", SYS_STAT_FORKS_PREFIX) +vmon_datum_ulong( forks, SYS_STAT_FORKS, "Forks", "Number of forks since the system booted") +vmon_omit_literal("\n", SYS_STAT_FORKS_NL) + +vmon_omit_literal("procs_running ", SYS_STAT_NRUNNABLE_PREFIX) +vmon_datum_ulong( n_runnable, SYS_STAT_NRUNNABLE, "NumRunnable", "Number of processes currently runnable (may exceed number of cpus)") +vmon_omit_literal("\n", SYS_STAT_NRUNNABLE_NL) + +vmon_omit_literal("procs_blocked ", SYS_STAT_NBLOCKED_PREFIX) +vmon_datum_ulong( n_blocked, SYS_STAT_NBLOCKED, "NumBlocked", "Number of processes currently blocked") +vmon_omit_literal("\n", SYS_STAT_NBLOCKED_NL) + +vmon_omit_literal("softirq ", SYS_STAT_SIRQS_PREFIX) +vmon_datum_ulonglong( sirq_hi, SYS_STAT_SIRQ_HI, "HiSIRQ", "Number of high priority soft interrupts (HI_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_TIMER_SP) +vmon_datum_ulonglong( sirq_timer, SYS_STAT_SIRQ_TIMER, "TimerSIRQ", "Number of timer software interrupts (TIMER_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_NET_TX_SP) +vmon_datum_ulonglong( sirq_net_tx, SYS_STAT_SIRQ_NET_TX, "NetTxSIRQ", "Number of network transmit software interrupts (NET_TX_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_NET_RX_SP) +vmon_datum_ulonglong( sirq_net_rx, SYS_STAT_SIRQ_NET_RX, "NetRxSIRQ", "Number of network receive software interrupts (NET_RX_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_BLOCK_SP) +vmon_datum_ulonglong( sirq_block, SYS_STAT_SIRQ_BLOCK, "BlockSIRQ", "Number of block software interrupts (BLOCK_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_IOPOLL_SP) +vmon_datum_ulonglong( sirq_iopoll, SYS_STAT_SIRQ_IOPOLL, "IOPollSIRQ", "Number of block IO poll software interrupts (BLOCK_IOPOLL_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_TASKLET_SP) +vmon_datum_ulonglong( sirq_tasklet, SYS_STAT_SIRQ_TASKLET, "TaskletSIRQ", "Number of tasklet software interrupts (TASKLET SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_HRTIMER_SP) +vmon_datum_ulonglong( sirq_hrtimer, SYS_STAT_SIRQ_HRTIMER, "HRTimerSIRQ", "Number of hrtimer software interrupts (HRTIMER_SOFTIRQ)") +vmon_omit_literal(" ", SYS_STAT_SIRQ_RCU_SP) +vmon_datum_ulonglong( sirq_rcu, SYS_STAT_SIRQ_RCU, "RCUSIRQ", "Number of RCU software interrupts (RCU_SOFTIRQ)") +vmon_omit_literal("\n", SYS_STAT_SIRQS_NL) + + +#endif + + +#include "_end.def" diff --git a/libvmon/defs/sys_vm.def b/libvmon/defs/sys_vm.def new file mode 100644 index 0000000..33b4d3f --- /dev/null +++ b/libvmon/defs/sys_vm.def @@ -0,0 +1,169 @@ +#include "_begin.def" + + + /* member name, symbolic constant, human label, human description (think UI/help) */ + /* /proc/meminfo */ +vmon_omit_literal("MemTotal:", SYS_VM_TOTAL_KB_LABEL) +vmon_omit_run(' ', SYS_VM_TOTAL_KB_WHITESPACE) +vmon_datum_ulong( total_kb, SYS_VM_TOTAL_KB, "Total", "Total memory in system") +vmon_omit_literal(" kB\n", SYS_VM_TOTAL_KB_UNIT_NL) +vmon_omit_literal("MemFree:", SYS_VM_FREE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_FREE_KB_WHITESPACE) +vmon_datum_ulong( free_kb, SYS_VM_FREE_KB, "Free", "Free memory in system") +vmon_omit_literal(" kB\n", SYS_VM_FREE_KB_UNIT_NL) +vmon_omit_literal("Buffers:", SYS_VM_BUFFERS_KB_LABEL) +vmon_omit_run(' ', SYS_VM_BUFFERS_KB_WHITESPACE) +vmon_datum_ulong( buffers_kb, SYS_VM_BUFFERS_KB, "Buffers", "Memory allocated to buffers") +vmon_omit_literal(" kB\n", SYS_VM_BUFFERS_KB_UNIT_NL) +vmon_omit_literal("Cached:", SYS_VM_CACHED_KB_LABEL) +vmon_omit_run(' ', SYS_VM_CACHED_KB_WHITESPACE) +vmon_datum_ulong( cached_kb, SYS_VM_CACHED_KB, "Cached", "Memory allocated to caches") +vmon_omit_literal(" kB\n", SYS_VM_CACHED_KB_UNIT_NL) +vmon_omit_literal("SwapCached:", SYS_VM_SWAPCACHED_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SWAPCACHED_KB_WHITESPACE) +vmon_datum_ulong( swapcached_kb, SYS_VM_SWAPCACHED_KB, "SwapCached", "Memory allocated to swap caches") +vmon_omit_literal(" kB\n", SYS_VM_SWAPCACHED_KB_UNIT_NL) +vmon_omit_literal("Active:", SYS_VM_ACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_ACTIVE_KB_WHITESPACE) +vmon_datum_ulong( active_kb, SYS_VM_ACTIVE_KB, "Active", "Active pages") +vmon_omit_literal(" kB\n", SYS_VM_ACTIVE_KB_UNIT_NL) +vmon_omit_literal("Inactive:", SYS_VM_INACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_INACTIVE_KB_WHITESPACE) +vmon_datum_ulong( inactive_kb, SYS_VM_INACTIVE_KB, "Inactive", "Inactive pages") +vmon_omit_literal(" kB\n", SYS_VM_INACTIVE_KB_UNIT_NL) +vmon_omit_literal("Active(anon):", SYS_VM_ANON_ACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_ANON_ACTIVE_KB_WHITESPACE) +vmon_datum_ulong( anon_active_kb, SYS_VM_ANON_ACTIVE_KB, "AnonActive", "Active anonymous pages") +vmon_omit_literal(" kB\n", SYS_VM_ANON_ACTIVE_KB_UNIT_NL) +vmon_omit_literal("Inactive(anon):", SYS_VM_ANON_INACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_ANON_INACTIVE_KB_WHITESPACE) +vmon_datum_ulong( anon_inactive_kb, SYS_VM_ANON_INACTIVE_KB, "AnonInactive", "Inactive anonymous pages") +vmon_omit_literal(" kB\n", SYS_VM_ANON_INACTIVE_KB_UNIT_NL) +vmon_omit_literal("Active(file):", SYS_VM_FILE_ACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_FILE_ACTIVE_KB_WHITESPACE) +vmon_datum_ulong( file_active_kb, SYS_VM_FILE_ACTIVE_KB, "FileActive", "Active file pages") +vmon_omit_literal(" kB\n", SYS_VM_FILE_ACTIVE_KB_UNIT_NL) +vmon_omit_literal("Inactive(file):", SYS_VM_FILE_INACTIVE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_FILE_INACTIVE_KB_WHITESPACE) +vmon_datum_ulong( file_inactive_kb, SYS_VM_FILE_INACTIVE_KB, "FileInactive", "Inactive file pages") +vmon_omit_literal(" kB\n", SYS_VM_FILE_INACTIVE_KB_UNIT_NL) +vmon_omit_literal("Unevictable:", SYS_VM_UNEVICTABLE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_UNEVICTABLE_KB_WHITESPACE) +vmon_datum_ulong( unevictable_kb, SYS_VM_UNEVICTABLE_KB, "Unevictable", "Unevictable pages") +vmon_omit_literal(" kB\n", SYS_VM_UNEVICTABLE_KB_UNIT_NL) +vmon_omit_literal("Mlocked:", SYS_VM_MLOCKED_KB_LABEL) +vmon_omit_run(' ', SYS_VM_MLOCKED_KB_WHITESPACE) +vmon_datum_ulong( mlocked_kb, SYS_VM_MLOCKED_KB, "Mlocked", "Locked pages") +vmon_omit_literal(" kB\n", SYS_VM_MLOCKED_KB_UNIT_NL) +vmon_omit_literal("SwapTotal:", SYS_VM_SWAP_TOTAL_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SWAP_TOTAL_KB_WHITESPACE) +vmon_datum_ulong( swap_total_kb, SYS_VM_SWAP_TOTAL_KB, "SwapTotal", "Total swap") +vmon_omit_literal(" kB\n", SYS_VM_SWAP_TOTAL_KB_UNIT_NL) +vmon_omit_literal("SwapFree:", SYS_VM_SWAP_FREE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SWAP_FREE_KB_WHITESPACE) +vmon_datum_ulong( swap_free_kb, SYS_VM_SWAP_FREE_KB, "SwapFree", "Free swap") +vmon_omit_literal(" kB\n", SYS_VM_SWAP_FREE_KB_UNIT_NL) +vmon_omit_literal("Dirty:", SYS_VM_DIRTY_KB_LABEL) +vmon_omit_run(' ', SYS_VM_DIRTY_KB_WHITESPACE) +vmon_datum_ulong( dirty_kb, SYS_VM_DIRTY_KB, "Dirty", "Dirty pages") +vmon_omit_literal(" kB\n", SYS_VM_DIRTY_KB_UNIT_NL) +vmon_omit_literal("Writeback:", SYS_VM_WRITEBACK_KB_LABEL) +vmon_omit_run(' ', SYS_VM_WRITEBACK_KB_WHITESPACE) +vmon_datum_ulong( writeback_kb, SYS_VM_WRITEBACK_KB, "Writeback", "Dirtied pages in the process of being written back") +vmon_omit_literal(" kB\n", SYS_VM_WRITEBACK_KB_UNIT_NL) +vmon_omit_literal("AnonPages:", SYS_VM_ANONPAGES_KB_LABEL) +vmon_omit_run(' ', SYS_VM_ANONPAGES_KB_WHITESPACE) +vmon_datum_ulong( anonpages_kb, SYS_VM_ANONPAGES_KB, "AnonPages", "Anonymous pages") +vmon_omit_literal(" kB\n", SYS_VM_ANONPAGES_KB_UNIT_NL) +vmon_omit_literal("Mapped:", SYS_VM_MAPPED_KB_LABEL) +vmon_omit_run(' ', SYS_VM_MAPPED_KB_WHITESPACE) +vmon_datum_ulong( mapped_kb, SYS_VM_MAPPED_KB, "Mapped", "Mapped pages") +vmon_omit_literal(" kB\n", SYS_VM_MAPPED_KB_UNIT_NL) +vmon_omit_literal("Shmem:", SYS_VM_SHMEM_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SHMEM_KB_WHITESPACE) +vmon_datum_ulong( shmem_kb, SYS_VM_SHMEM_KB, "Shmem", "SysV IPC shmem") +vmon_omit_literal(" kB\n", SYS_VM_SHMEM_KB_UNIT_NL) +vmon_omit_literal("Slab:", SYS_VM_SLAB_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SLAB_KB_WHITESPACE) +vmon_datum_ulong( slab_kb, SYS_VM_SLAB_KB, "Slab", "Slab memory") +vmon_omit_literal(" kB\n", SYS_VM_SLAB_KB_UNIT_NL) +vmon_omit_literal("SReclaimable:", SYS_VM_SRECLAIMABLE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SRECLAIMABLE_KB_WHITESPACE) +vmon_datum_ulong( sreclaimable_kb, SYS_VM_SRECLAIMABLE_KB, "SReclaimable", "Slab (reclaimable) memory") +vmon_omit_literal(" kB\n", SYS_VM_SRECLAIMABLE_KB_UNIT_NL) +vmon_omit_literal("SUnreclaim:", SYS_VM_SUNRECLAIMABLE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_SUNRECLAIMABLE_KB_WHITESPACE) +vmon_datum_ulong( sunreclaimable_kb, SYS_VM_SUNRECLAIMABLE_KB, "SUnreclaim", "Slab (unreclaimable) memory") +vmon_omit_literal(" kB\n", SYS_VM_SUNRECLAIMABLE_KB_UNIT_NL) +vmon_omit_literal("KernelStack:", SYS_VM_KERNELSTACK_KB_LABEL) +vmon_omit_run(' ', SYS_VM_KERNELSTACK_KB_WHITESPACE) +vmon_datum_ulong( kernelstack_kb, SYS_VM_KERNELSTACK_KB, "KernelStack", "Kernel stack") +vmon_omit_literal(" kB\n", SYS_VM_KERNELSTACK_KB_UNIT_NL) +vmon_omit_literal("PageTables:", SYS_VM_PAGETABLES_KB_LABEL) +vmon_omit_run(' ', SYS_VM_PAGETABLES_KB_WHITESPACE) +vmon_datum_ulong( pagetables_kb, SYS_VM_PAGETABLES_KB, "PageTables", "Page tables") +vmon_omit_literal(" kB\n", SYS_VM_PAGETABLES_KB_UNIT_NL) +vmon_omit_literal("NFS_Unstable:", SYS_VM_NFS_UNSTABLE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_NFS_UNSTABLE_KB_WHITESPACE) +vmon_datum_ulong( nfs_unstable_kb, SYS_VM_NFS_UNSTABLE_KB, "NFS_Unstable", "NFS unstable") +vmon_omit_literal(" kB\n", SYS_VM_NFS_UNSTABLE_KB_UNIT_NL) +vmon_omit_literal("Bounce:", SYS_VM_BOUNCE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_BOUNCE_KB_WHITESPACE) +vmon_datum_ulong( bounce_kb, SYS_VM_BOUNCE_KB, "Bounce", "Bounce") +vmon_omit_literal(" kB\n", SYS_VM_BOUNCE_KB_UNIT_NL) +vmon_omit_literal("WritebackTmp:", SYS_VM_WRITEBACKTMP_KB_LABEL) +vmon_omit_run(' ', SYS_VM_WRITEBACKTMP_KB_WHITESPACE) +vmon_datum_ulong( writebacktmp_kb, SYS_VM_WRITEBACKTMP_KB, "WritebackTmp", "Writeback temp") +vmon_omit_literal(" kB\n", SYS_VM_WRITEBACKTMP_KB_UNIT_NL) +vmon_omit_literal("CommitLimit:", SYS_VM_COMMITLIMIT_KB_LABEL) +vmon_omit_run(' ', SYS_VM_COMMITLIMIT_KB_WHITESPACE) +vmon_datum_ulong( commitlimit_kb, SYS_VM_COMMITLIMIT_KB, "CommitLimit", "Commit limit") +vmon_omit_literal(" kB\n", SYS_VM_COMMITLIMIT_KB_UNIT_NL) +vmon_omit_literal("Committed_AS:", SYS_VM_COMMITTED_AS_KB_LABEL) +vmon_omit_run(' ', SYS_VM_COMMITTED_AS_KB_WHITESPACE) +vmon_datum_ulong( commited_as_kb, SYS_VM_COMMITTED_AS_KB, "Commited_AS", "Commited address space? TODO ") +vmon_omit_literal(" kB\n", SYS_VM_COMMITTED_AS_KB_UNIT_NL) +vmon_omit_literal("VmallocTotal:", SYS_VM_VMALLOC_TOTAL_KB_LABEL) +vmon_omit_run(' ', SYS_VM_VMALLOC_KB_WHITESPACE) +vmon_datum_ulong( vmalloctotal_kb, SYS_VM_VMALLOC_TOTAL_KB, "VmallocTotal", "Vmalloc total") +vmon_omit_literal(" kB\n", SYS_VM_VMALLOC_TOTAL_KB_UNIT_NL) +vmon_omit_literal("VmallocUsed:", SYS_VM_VMALLOC_USED_KB_LABEL) +vmon_omit_run(' ', SYS_VM_VMALLOC_USED_KB_WHITESPACE) +vmon_datum_ulong( vmallocused_kb, SYS_VM_VMALLOC_USED_KB, "VmallocUsed", "Vmalloc used") +vmon_omit_literal(" kB\n", SYS_VM_VMALLOC_USED_KB_UNIT_NL) +vmon_omit_literal("VmallocChunk:", SYS_VM_VMALLOC_CHUNK_KB_LABEL) +vmon_omit_run(' ', SYS_VM_VMALLOC_CHUNK_KB_WHITESPACE) +vmon_datum_ulong( vmallocchunk_kb, SYS_VM_VMALLOC_CHUNK_KB, "VmallocChunk", "Vmalloc chunk") +vmon_omit_literal(" kB\n", SYS_VM_VMALLOC_CHUNK_KB_UNIT_NL) +vmon_omit_literal("HugePages_Total:", SYS_VM_HUGEPAGES_TOTAL_LABEL) +vmon_omit_run(' ', SYS_VM_HUGEPAGES_TOTAL_WHITESPACE) +vmon_datum_ulong( hugepages_total, SYS_VM_HUGEPAGES_TOTAL, "HugePages_Total", "HugePages total") +vmon_omit_literal("\n", SYS_VM_HUGEPAGES_TOTAL_NL) +vmon_omit_literal("HugePages_Free:", SYS_VM_HUGEPAGES_FREE_LABEL) +vmon_omit_run(' ', SYS_VM_HUGEPAGES_FREE_WHITESPACE) +vmon_datum_ulong( hugepages_free, SYS_VM_HUGEPAGES_FREE, "HugePages_Free", "HugePages free") +vmon_omit_literal("\n", SYS_VM_HUGEPAGES_FREE_NL) +vmon_omit_literal("HugePages_Rsvd:", SYS_VM_HUGEPAGES_RESERVED_LABEL) +vmon_omit_run(' ', SYS_VM_HUGEPAGES_RESERVED_WHITESPACE) +vmon_datum_ulong( hugepages_reserved, SYS_VM_HUGEPAGES_RESERVED, "HugePages_Rsvd", "HugePages reserved") +vmon_omit_literal("\n", SYS_VM_HUGEPAGES_RESERVED_UNIT_NL) +vmon_omit_literal("HugePages_Surp:", SYS_VM_HUGEPAGES_SURPLUS_LABEL) +vmon_omit_run(' ', SYS_VM_HUGEPAGES_SURPLUS_WHITESPACE) +vmon_datum_ulong( hugepages_surplus, SYS_VM_HUGEPAGES_SURPLUS, "HugePages_Surp", "HugePages surplus") +vmon_omit_literal("\n", SYS_VM_HUGEPAGES_SURPLUS_NL) +vmon_omit_literal("Hugepagesize:", SYS_VM_HUGEPAGE_SIZE_KB_LABEL) +vmon_omit_run(' ', SYS_VM_HUGEPAGE_SIZE_KB_WHITESPACE) +vmon_datum_ulong( hugepage_size_kb, SYS_VM_HUGEPAGE_SIZE_KB, "HugePage_Size", "HugePage page size") +vmon_omit_literal(" kB\n", SYS_VM_HUGEPAGE_SIZE_KB_UNIT_NL) +vmon_omit_literal("DirectMap4k:", SYS_VM_DIRECTMAP_4K_KB_LABEL) +vmon_omit_run(' ', SYS_VM_DIRECTMAP_4K_KB_WHITESPACE) +vmon_datum_ulong( directmap4k_kb, SYS_VM_DIRECTMAP_4K_KB, "DirectMap4k", "DirectMap 4K") +vmon_omit_literal(" kB\n", SYS_VM_DIRECTMAP_4K_KB_UNIT_NL) +vmon_omit_literal("DirectMap4M:", SYS_VM_DIRECTMAP_4M_KB_LABEL) +vmon_omit_run(' ', SYS_VM_DIRECTMAP_4M_KB_WHITESPACE) +vmon_datum_ulong( directmap2m_kb, SYS_VM_DIRECTMAP_4M_KB, "DirectMap4M", "DirectMap 4M") +vmon_omit_literal(" kB\n", SYS_VM_DIRECTMAP_4M_KB_UNIT_NL) + +/* TODO: /proc/vmstat */ + +#include "_end.def" diff --git a/libvmon/defs/sys_wants.def b/libvmon/defs/sys_wants.def new file mode 100644 index 0000000..750d7bb --- /dev/null +++ b/libvmon/defs/sys_wants.def @@ -0,0 +1,7 @@ +#include "_begin.def" + +/* the available sys-wide wants */ +vmon_want(SYS_STAT, sys_stat, sys_sample_stat) +vmon_want(SYS_VM, sys_vm, sys_sample_vm) + +#include "_end.def" diff --git a/libvmon/vmon.c b/libvmon/vmon.c new file mode 100644 index 0000000..7d2b2a0 --- /dev/null +++ b/libvmon/vmon.c @@ -0,0 +1,1634 @@ +/* + * libvmon - a lightweight linux system/process monitoring library, + * intended for linking directly into gpl programs. + * + * This has been written specifically for use in vwm, my window manager, + * but includes some facilities for other uses. + * + * Copyright (c) 2012-2014 Vito Caputo - <vcaputo@gnugeneration.com> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 3 as + * published by the Free Software Foundation. + * + * 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 <http://www.gnu.org/licenses/>. + */ + +#include <stdlib.h> +#include <unistd.h> +#include <stdio.h> +#include <stdarg.h> +#include <sys/types.h> +#include <sys/stat.h> +#include <fcntl.h> +#include <string.h> +#include <inttypes.h> +#include <dirent.h> +#include <errno.h> +#include "list.h" + +#include "vmon.h" + +#define VMON_INTERNAL_PROC_IS_THREAD (1L << 31) /* used to communicate to vmon_proc_monitor() that the pid is a tid */ + +/* valid return values for the sampler functions, these are private to the library */ +typedef enum _sample_ret_t { + SAMPLE_CHANGED, /* this sampler invocation has changes */ + SAMPLE_UNCHANGED, /* this sampler invocation has no changes */ + SAMPLE_ERROR, /* this sampler invocation encountered errors (XXX it may be interesting to support indicating changing & errors) */ + DTOR_FREE, /* this dtor(sampler) invocation wants the caller to free the store */ + DTOR_NOFREE /* this dtor(sampler) invocation does not want the caller to perform a free on the store */ +} sample_ret_t; + + +/* some private convenience functions */ +static void try_free(void **ptr) +{ + if((*ptr)) { + free((*ptr)); + (*ptr) = NULL; + } +} + + +static void try_close(int *fd) +{ + if((*fd) != -1) { + close((*fd)); + (*fd) = -1; + } +} + + +static void try_closedir(DIR **dir) +{ + if((*dir)) { + closedir((*dir)); + (*dir) = NULL; + } +} + + +/* these have been wrapped to suppress syscall overhead when we have a bad file descriptor without cluttering the samplers with checks */ +static off_t try_lseek(int fd, off_t offset, int whence) +{ + if(fd != -1) { + return lseek(fd, offset, whence); + } else { + errno = EBADF; + return fd; + } +} + + +static ssize_t try_read(int fd, void *buf, size_t count) +{ + if(fd != -1) { + return read(fd, buf, count); + } else { + errno = EBADF; + return fd; + } +} + + +/* this does a copy from src to dest + * sets the bit specified by changed_pos in the bitmap *changed if what was copied to src was different from what was already there */ +static void memcmpcpy(void *dest, const void *src, size_t n, char *changed, int changed_pos) +{ + size_t i = 0; + + /* if the changed bit is set on entry we don't execute the comparison-copy */ + if(!BITTEST(changed, changed_pos)) { + /* a simple slow compare and copy loop, break out if we've found a change */ + /* XXX TODO: an obvious optimization would be to compare and copy words at a time... */ + for(; i < n; i++) { + if(((char *)dest)[i] != ((char *)src)[i]) { + BITSET(changed, changed_pos); + break; + } + ((char *)dest)[i] = ((char *)src)[i]; + } + } + + /* memcpy whatever remains */ + if(n - i) { + memcpy(&((char *)dest)[i], &((char *)src)[i], n - i); + } +} + + +typedef enum _vmon_load_flags_t { + LOAD_FLAGS_NONE = 0, + LOAD_FLAGS_NOTRUNCATE = 1L +} vmon_load_flags_t; + +/* we enlarge *alloc if necessary, but never shrink it. changed[changed_pos] bit is set if a difference is detected, supply LOAD_FLAGS_NOTRUNCATE if we don't want empty contents to truncate last-known data */ +static char * load_contents_fd(vmon_t *vmon, vmon_char_array_t *array, int fd, vmon_load_flags_t flags, char *changed, int changed_pos) +{ + int total = 0, len, alloc_len = array->alloc_len; + char *alloc = array->array, *tmp; + + while((len = read(fd, vmon->buf, sizeof(vmon->buf))) > 0) { + if(total + len > alloc_len) { + /* realloc to accomodate the new total */ + tmp = realloc(alloc, total + len); + if(!tmp) { + return NULL; + } + + alloc_len = total + len; + alloc = tmp; + } + + memcmpcpy(&alloc[total], vmon->buf, len, changed, changed_pos); + + total += len; + } + + array->array = alloc; + array->alloc_len = alloc_len; + + /* if we read something or didn't encounter an error, store the new total */ + if(total || (len == 0 && !(flags & LOAD_FLAGS_NOTRUNCATE))) { + /* if the new length differs ensure the changed bit is set */ + if(array->len != total) { + BITSET(changed, changed_pos); + } + + array->len = total; + } + + return alloc; +} + + +/* convenience function for opening a path using a format string, path is temporarily assembled in vmon->buf */ +static int openf(vmon_t *vmon, int flags, DIR *dir, char *fmt, ...) +{ + int fd; + va_list va_arg; + + va_start(va_arg, fmt); + vsnprintf(vmon->buf, sizeof(vmon->buf), fmt, va_arg); /* XXX accepting the possibility of truncating the path */ + va_end(va_arg); + + fd = openat(dirfd(dir), vmon->buf, flags); + + return fd; +} + + +/* convenience function for opening a directory using a format string, path is temporarily assembled in vmon->buf */ +static DIR * opendirf(vmon_t *vmon, DIR *dir, char *fmt, ...) +{ + int fd; + va_list va_arg; + + va_start(va_arg, fmt); + vsnprintf(vmon->buf, sizeof(vmon->buf), fmt, va_arg); /* XXX accepting the possibility of truncating the path */ + va_end(va_arg); + + fd = openat(dirfd(dir), vmon->buf, O_RDONLY); + if(fd == -1) { + return NULL; + } + + return fdopendir(fd); +} + + +/* enlarge an array by the specified amount */ +static int grow_array(vmon_char_array_t *array, int amount) +{ + char *tmp; + + tmp = realloc(array->array, array->alloc_len + amount); + if(!tmp) { + return 0; + } + + array->alloc_len += amount; + array->array = tmp; + + return 1; +} + + +/* load the contents of a symlink, dir is not optional */ +#define READLINKF_GROWINIT 10 +#define READLINKF_GROWBY 2 +static char * readlinkf(vmon_t *vmon, vmon_char_array_t *array, DIR *dir, char *fmt, ...) +{ + va_list va_arg; + int len; + + va_start(va_arg, fmt); + vsnprintf(vmon->buf, sizeof(vmon->buf), fmt, va_arg); + va_end(va_arg); + + if(!array->array && !grow_array(array, READLINKF_GROWINIT)) { + goto _fail; + } + + do { + len = readlinkat(dirfd(dir), vmon->buf, array->array, (array->alloc_len - 1)); + } while(len != -1 && len == (array->alloc_len - 1) && (len = grow_array(array, READLINKF_GROWBY))); + + if(len <= 0) { + goto _fail; + } + + array->len = len; + array->array[array->len] = '\0'; + + return array->array; + +_fail: + return NULL; +} + + +/* here starts private per-process samplers and other things like following children implementation etc. */ + +/* sample stat process stats */ +typedef enum _vmon_proc_stat_fsm_t { +#define VMON_ENUM_PARSER_STATES +#include "defs/proc_stat.def" +} vmon_proc_stat_fsm_t; + +static sample_ret_t proc_sample_stat(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_stat_t **store) +{ + int changes = 0; + int i, len; + char *arg; + int argn, prev_argc; + vmon_proc_stat_fsm_t state = VMON_PARSER_STATE_PROC_STAT_PID; +#define VMON_PREPARE_PARSER +#include "defs/proc_stat.def" + + if(!proc) { /* dtor */ + try_close(&(*store)->comm_fd); + try_free((void **)&(*store)->comm); + try_close(&(*store)->cmdline_fd); + try_free((void **)&(*store)->cmdline); + try_close(&(*store)->wchan_fd); + try_close(&(*store)->stat_fd); + try_free((void **)&(*store)->exe); + + return DTOR_FREE; + } + +_retry: + if(!(*store)) { /* ctor */ + + *store = calloc(1, sizeof(vmon_proc_stat_t)); + + if(proc->is_thread) { + (*store)->comm_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/comm", proc->pid, proc->pid); + (*store)->cmdline_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/cmdline", proc->pid, proc->pid); + (*store)->wchan_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/wchan", proc->pid, proc->pid); + (*store)->stat_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/stat", proc->pid, proc->pid); + } else { + (*store)->comm_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/comm", proc->pid); + (*store)->cmdline_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/cmdline", proc->pid); + (*store)->wchan_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/wchan", proc->pid); + (*store)->stat_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/stat", proc->pid); + } + + /* initially everything is considered changed */ + memset((*store)->changed, 0xff, sizeof((*store)->changed)); + } else { + try_lseek((*store)->comm_fd, 0, SEEK_SET); + try_lseek((*store)->cmdline_fd, 0, SEEK_SET); + try_lseek((*store)->wchan_fd, 0, SEEK_SET); + try_lseek((*store)->stat_fd, 0, SEEK_SET); + + /* clear the entire changed bitmap */ + memset((*store)->changed, 0, sizeof((*store)->changed)); + } + + /* XXX TODO: integrate load_contents_fd() calls into changes++ maintenance */ + /* /proc/$pid/comm */ + load_contents_fd(vmon, &(*store)->comm, (*store)->comm_fd, LOAD_FLAGS_NOTRUNCATE, (*store)->changed, VMON_PROC_STAT_COMM); + + /* /proc/$pid/cmdline */ + load_contents_fd(vmon, &(*store)->cmdline, (*store)->cmdline_fd, LOAD_FLAGS_NOTRUNCATE, (*store)->changed, VMON_PROC_STAT_CMDLINE); + for(prev_argc = (*store)->argc, (*store)->argc = 0, i = 0; i < (*store)->cmdline.len; i++) { + if(!(*store)->cmdline.array[i]) { + (*store)->argc++; + } + } + + /* if the cmdline has changed, allocate argv array and store ptrs to the fields within it */ + if(BITTEST((*store)->changed, VMON_PROC_STAT_CMDLINE)) { + if(prev_argc != (*store)->argc) { + try_free((void **)&(*store)->argv); /* XXX could realloc */ + (*store)->argv = malloc((*store)->argc * sizeof(char *)); + } + + for(argn = 0, arg = (*store)->cmdline.array, i = 0; i < (*store)->cmdline.len; i++) { + if(!(*store)->cmdline.array[i]) { + (*store)->argv[argn++] = arg; + arg = &(*store)->cmdline.array[i + 1]; + } + } + } + + /* /proc/$pid/wchan */ + load_contents_fd(vmon, &(*store)->wchan, (*store)->wchan_fd, LOAD_FLAGS_NOTRUNCATE, (*store)->changed, VMON_PROC_STAT_WCHAN); + + /* /proc/$pid/exe */ + if((*store)->cmdline.len) { /* kernel threads have no cmdline, and always fail readlinkf() on exe, skip readlinking the exe for them using this heuristic */ + readlinkf(vmon, &(*store)->exe, vmon->proc_dir, "%i/exe", proc->pid); + } + + /* XXX TODO: there's a race between discovering comm_len from /proc/$pid/comm and applying it in the parsing of /proc/$pid/stat, detect the race + * scenario and retry the sample when detected by goto _retry */ + + /* read in stat and parse it assigning the stat members accordingly */ + while((len = try_read((*store)->stat_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + /* parse the fields from the file, stepping through... */ + input = vmon->buf[i]; + switch(state) { +#define VMON_PARSER_DELIM ' ' /* TODO XXX eliminate the need for this, I want the .def's to include all the data format knowledge */ +#define VMON_IMPLEMENT_PARSER +#include "defs/proc_stat.def" + default: + /* we're finished parsing once we've fallen off the end of the symbols */ + break; + } + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* implements the children following */ +static int proc_follow_children(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_follow_children_t **store) +{ + int changes = 0; + int len, i, child_pid = 0, found; + vmon_proc_t *tmp, *_tmp; + list_head_t *cur, *start; + + if(!proc) { /* dtor */ + try_close(&(*store)->children_fd); + + return DTOR_FREE; + } + + if(proc->is_thread) { /* don't follow children of threads */ + return SAMPLE_UNCHANGED; + } + + if(!(*store)) { /* implicit ctor on first sample */ + *store = calloc(1, sizeof(vmon_proc_follow_children_t)); + + (*store)->children_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/children", proc->pid, proc->pid); + } else { + try_lseek((*store)->children_fd, 0, SEEK_SET); + } + + /* unmonitor stale children on entry, this concludes the two-phase removal of a process */ + list_for_each_entry_safe(tmp, _tmp, &proc->children, siblings) { + if(tmp->is_stale) { + vmon_proc_unmonitor(vmon, tmp, NULL, NULL); + } +#ifdef _MOVE_STALE_TO_FRONT + else { + break; + } +#endif + } + + /* if we have a parent, and our parent has become stale, ensure this, the child, becomes stale as well */ + if(proc->parent && proc->parent->is_stale) { + proc->is_stale = 1; + proc->parent->children_changed = 1; + return SAMPLE_CHANGED; + } + + /* maintain our awareness of children, if we detect a new child initiate monitoring for it, existing children get their generation number updated */ + start = &proc->children; + while((len = try_read((*store)->children_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + switch(vmon->buf[i]) { + case '0' ... '9': + /* PID component, accumulate it */ + child_pid *= 10; + child_pid += (vmon->buf[i] - '0'); + break; + + case ' ': + /* separator, terminates a PID, search for it in the childrens list */ + found = 0; + list_for_each(cur, start) { + if(list_entry(cur, vmon_proc_t, siblings)->pid == child_pid) { + /* found the child already monitored, update its generation number and stop searching */ + tmp = list_entry(cur, vmon_proc_t, siblings); + tmp->generation = vmon->generation; + found = 1; + tmp->is_new = 0; + break; + } + } + + if(found || (tmp = vmon_proc_monitor(vmon, proc, child_pid, proc->wants, NULL, NULL))) { + /* position the process in the siblings list, and update the start */ + /* move to front breaks vwm, we rely on the stale processes maintaining their position! maybe make it an option to vmon_init() since it can be a useful optimization. */ +#ifdef _MOVE_STALE_TO_FRONT + list_move_tail(&tmp->siblings, start); +#endif + start = &tmp->siblings; + } /* else { vmon_proc_monitor failed just move on } */ + + child_pid = 0; + break; + } + } + } + + /* look for children which seem to no longer exist (found by stale generation numbers) and queue them for unmonitoring, flag this as a children change too */ + found = 0; + list_for_each_entry(tmp, &proc->children, siblings) { + if(tmp->generation != vmon->generation) { + /* set children not found to stale status so the caller can respond and on our next sample invocation we will unmonitor them */ + found = tmp->is_stale = 1; + } +#ifdef _MOVE_STALE_TO_FRONT + /* this depends on the moving of stale entries to the start of the list optimization which breaks vwm, disabled for now */ + else { + break; + } +#endif + } + + /* XXX TODO: does it makes sense for shit to happen here? */ + if(found) { + if(proc->parent) { + proc->parent->children_changed = 1; + } else { + vmon->processes_changed = 1; + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* implements the thread following */ +static int proc_follow_threads(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_follow_threads_t **store) +{ + int changes = 0; + struct dirent dentry, *dentry_res; + list_head_t *cur, *start; + vmon_proc_t *tmp, *_tmp; + int found; + + if(!proc) { /* dtor */ + try_closedir(&(*store)->task_dir); + + return DTOR_FREE; + } + + if(proc->is_thread) { /* bypass following the threads of threads */ + return SAMPLE_UNCHANGED; + } + + if(!proc->stores || !proc->stores[VMON_STORE_PROC_STAT] || (((vmon_proc_stat_t *)proc->stores[VMON_STORE_PROC_STAT])->num_threads <= 1 && list_empty(&proc->threads))) { + /* bypass following of threads if we either can't determine the number from the proc stat sample or if the sample says there's 1 or less (and an empty threads list, handling stale exited threads) */ + /* XXX I'm not sure if this is always the right thing to do, there may be some situations where one could play games with clone() directly + * and escape the monitoring library with a lone thread having had the main thread exit, leaving the count at 1 while having a process + * descriptor distinguished from the single thread XXX */ + return SAMPLE_UNCHANGED; + } + + if(!(*store)) { /* implicit ctor on first sample */ + *store = calloc(1, sizeof(vmon_proc_follow_threads_t)); + + (*store)->task_dir = opendirf(vmon, vmon->proc_dir, "%i/task", proc->pid); + } else if((*store)->task_dir) { + seekdir((*store)->task_dir, 0); + } + + if(!(*store)->task_dir) { + return SAMPLE_ERROR; + } + + /* unmonitor stale threads on entry, this concludes the two-phase removal of a thread (just like follow_children) */ + list_for_each_entry_safe(tmp, _tmp, &proc->threads, threads) { + if(tmp->is_stale) { + vmon_proc_unmonitor(vmon, tmp, NULL, NULL); + } +#ifdef _MOVE_STALE_TO_FRONT + else { + break; + } +#endif + } + + start = &proc->threads; + while(!readdir_r((*store)->task_dir, &dentry, &dentry_res) && dentry_res) { + int tid; + + if(dentry.d_name[0] == '.' && (dentry.d_name[1] == '\0' || (dentry.d_name[1] == '.' && dentry.d_name[2] == '\0'))) { + /* skip . and .. */ + continue; + } + + tid = atoi(dentry.d_name); + + found = 0; + list_for_each(cur, start) { + if(cur == &proc->threads) { /* take care to skip the head node */ + continue; + } + + if(list_entry(cur, vmon_proc_t, threads)->pid == tid) { + /* found the thread already monitored, update its generation number and stop searching */ + tmp = list_entry(cur, vmon_proc_t, threads); + tmp->generation = vmon->generation; + found = 1; + tmp->is_new = 0; + break; + } + } + + if(found || (tmp = vmon_proc_monitor(vmon, proc, tid, (proc->wants | VMON_INTERNAL_PROC_IS_THREAD), NULL, NULL))) { + /* position the thread in the threads list, and update the start */ +#ifdef _MOVE_STALE_TO_FRONT + list_move_tail(&tmp->threads, start); +#endif + start = &tmp->threads; + } /* else { vmon_proc_monitor failed just move on } */ + } + + list_for_each_entry_safe(tmp, _tmp, &proc->threads, threads) { + if(tmp->generation != vmon->generation) { + /* set children not found to stale status so the caller can respond and on our next sample invocation we will unmonitor them */ + tmp->is_stale = 1; + } +#ifdef _MOVE_STALE_TO_FRONT + else { + break; + } +#endif + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* helper for maintaining reference counted global objects table */ +static vmon_fobject_t * fobject_lookup_hinted(vmon_t *vmon, const char *path, vmon_fobject_t *hint) +{ + vmon_fobject_t *fobject = NULL, *tmp = NULL; + uint64_t inum; + + /* TODO maintain the fobject hash tables, they should probably be isolated/scoped based on the string before the : */ + /* in reality there needs to be a list somewhere of the valid prefixes we wish to support, and that list should associate + * the prefixes with the kind of contextual information details we monitor for each of those types. Then when new + * fobject types are added to libvmon, the rest of the code automatically reflects the additions due to the mechanization. + */ + if(!path || strncmp(path, "pipe:", 5)) { + return NULL; /* XXX TODO: for now we're only dealing with pipes */ + } + + sscanf(&path[6], "%" SCNu64 "]", &inum); + + if(hint && hint->inum == inum) { + /* the hint matches, skip the search */ + return hint; + } + + /* search for the inode, if we can't find it, allocate a new fobject XXX this needs optimizing but silly until we have all object types handled... */ + list_for_each_entry(tmp, &vmon->fobjects, bucket) { + if(tmp->inum == inum) { + fobject = tmp; + break; + } + } + + if(!fobject) { + /* create a new fobject */ + fobject = malloc(sizeof(vmon_fobject_t)); + + fobject->type = VMON_FOBJECT_TYPE_PIPE; + fobject->inum = inum; + INIT_LIST_HEAD(&fobject->ref_fds); + INIT_LIST_HEAD(&fobject->bucket); + fobject->refcnt = 0; + fobject->foo = NULL; + list_add_tail(&fobject->bucket, &vmon->fobjects); + vmon->fobjects_nr++; + + if(vmon->fobject_ctor_cb) { + vmon->fobject_ctor_cb(vmon, fobject); + } + } + + return fobject; +} + + +/* add a reference to an fobject, fd_ref is optional (should be present if the reference is due to an open fd, which may not be the case) */ +static void fobject_ref(vmon_t *vmon, vmon_fobject_t *fobject, vmon_proc_fd_t *fd_ref) +{ + fobject->refcnt++; + + if(fd_ref) { + list_add_tail(&fd_ref->ref_fds, &fobject->ref_fds); + } +} + + +/* fobject is required and is the object being unrefereced, fd_ref is optional but represents the per-process fd reference being used to access this fobject via */ +static int fobject_unref(vmon_t *vmon, vmon_fobject_t *fobject, vmon_proc_fd_t *fd_ref) +{ + if(fd_ref) { + list_del(&fd_ref->ref_fds); + } + + fobject->refcnt--; + + if(!fobject->refcnt) { + /* after the refcnt drops to zero we discard the fobject */ + list_del(&fobject->bucket); + vmon->fobjects_nr--; + + if(vmon->fobject_dtor_cb) { + vmon->fobject_dtor_cb(vmon, fobject); + } + + free(fobject); + return 1; + } + + return 0; +} + + +/* helper for deleting an fd from the per-process fds list list */ +static void del_fd(vmon_t *vmon, vmon_proc_fd_t *fd) +{ + list_del(&fd->fds); + if(fd->object) { + fobject_unref(vmon, fd->object, fd); /* note we supply both the fobject ptr and proc_fd ptr (fd) */ + } + try_free((void **)&fd->object_path); + free(fd); +} + + +/* implements the open file descriptors (/proc/$pid/fd/...) sampling */ +static sample_ret_t proc_sample_files(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_files_t **store) +{ + int changes = 0; + struct dirent dentry, *dentry_res; + int fdnum; + list_head_t *cur, *start; + vmon_proc_fd_t *fd, *_fd; + vmon_fobject_t *cur_object = NULL; + + if(!proc) { + /* dtor implementation */ + if(--((*store)->refcnt)) { /* suppress dtor while references exist, the store is shared */ + return DTOR_NOFREE; + } + + try_closedir(&(*store)->fd_dir); + + list_for_each_entry_safe(fd, _fd, &(*store)->fds, fds) { + del_fd(vmon, fd); + } + + return DTOR_FREE; + } + + if(proc->is_thread) { + /* don't monitor the open files of threads, instead, share the files store of the parent process by adding a reference to it */ + /* XXX TODO: use kcmp CMP_FILES in the future instead of assuming all threads share open files */ + if(!(*store) && ((*store) = proc->parent->stores[VMON_STORE_PROC_FILES])) { + (*store)->refcnt++; + } + return SAMPLE_UNCHANGED; /* XXX TODO: we actually want to reflect/copy the activity state of the parent */ + } + + if(!(*store)) { /* implicit ctor on first sample */ + *store = calloc(1, sizeof(vmon_proc_files_t)); + + (*store)->refcnt = 1; + (*store)->fd_dir = opendirf(vmon, vmon->proc_dir, "%i/fd", proc->pid); + + INIT_LIST_HEAD(&(*store)->fds); + } else if((*store)->fd_dir) { + /* we have a directory handle, and we're reentering the function with the directory positioned at the end */ + seekdir((*store)->fd_dir, 0); + } + + if(!(*store)->fd_dir) { + /* we have no directory handle on reentry */ + /* XXX TODO: this happens when we don't have permission, this hsould be handled more elegantly/cleanly, and we don't + * make any attempt to ever reopen the directory because the ctor has already run. */ + goto _fail; + } + + start = &(*store)->fds; + while(!readdir_r((*store)->fd_dir, &dentry, &dentry_res) && dentry_res) { + if(dentry.d_name[0] == '.' && (dentry.d_name[1] == '\0' || (dentry.d_name[1] == '.' && dentry.d_name[2] == '\0'))) { + /* skip . and .. */ + continue; + } + + fdnum = atoi(dentry.d_name); + + /* search the process' files list for this fdnum */ + fd = NULL; + list_for_each(cur, start) { + if(cur == &(*store)->fds) { + continue; /* skip the head node as it's not boxed */ + } + if(list_entry(cur, vmon_proc_fd_t, fds)->fdnum == fdnum) { + fd = list_entry(cur, vmon_proc_fd_t, fds); + break; + } + } + + if(!fd) { + fd = calloc(1, sizeof(vmon_proc_fd_t)); + if(!fd) { + /* TODO: errors */ + goto _fail; + } + fd->fdnum = fdnum; + fd->process = proc; + INIT_LIST_HEAD(&fd->ref_fds); + list_add_tail(&fd->fds, start); + } else { + list_move_tail(&fd->fds, start); + } + + fd->generation = vmon->generation; + + /* Always readlink the fd path, since we have no way of knowing if it's a repurposed fdnum even when we've found a match. + * It would be nice if say.. the mtime of the /proc/$pid/fd directory changed if there's been any fd activity so we could skip the entire + * readdir+readlink loop in idle times, worth investigating. */ + readlinkf(vmon, &fd->object_path, vmon->proc_dir, "%i/fd/%s", proc->pid, dentry.d_name); + + cur_object = fd->object; /* stow the current object reference before we potentially replace it so we may unreference it if needed */ + fd->object = fobject_lookup_hinted(vmon, fd->object_path.array, cur_object); + if(cur_object != fd->object) { + if(cur_object) { + fobject_unref(vmon, cur_object, fd); + } + + if(fd->object) { + fobject_ref(vmon, fd->object, fd); + } + } /* else { lookup returned the same object as before (or NULL), is there anything to do? } */ + + start = &fd->fds; /* update the search start to this fd */ + } + + /* search for stale (closed) fds, remove references for any we find */ + list_for_each_entry_safe(fd, _fd, &(*store)->fds, fds) { + if(fd->generation != vmon->generation) { + del_fd(vmon, fd); + } else { + break; + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; + +_fail: + return SAMPLE_ERROR; +} + + +/* implements the vm utilization sampling */ +typedef enum _vmon_proc_vm_fsm_t { +#define VMON_ENUM_PARSER_STATES +#include "defs/proc_vm.def" +} vmon_proc_vm_fsm_t; + +static sample_ret_t proc_sample_vm(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_vm_t **store) +{ + int i, len; + int changes = 0; + vmon_proc_vm_fsm_t state = VMON_PARSER_STATE_PROC_VM_SIZE_PAGES; +#define VMON_PREPARE_PARSER +#include "defs/proc_vm.def" + + if(!proc) { /* dtor */ + try_close(&(*store)->statm_fd); + + return DTOR_FREE; + } + + if(!(*store)) { /* ctor */ + (*store) = calloc(1, sizeof(vmon_proc_vm_t)); + if(proc->is_thread) { + (*store)->statm_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/statm", proc->pid, proc->pid); + } else { + (*store)->statm_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/statm", proc->pid); + } + + /* initially everything is considered changed */ + memset((*store)->changed, 0xff, sizeof((*store)->changed)); + } else { + try_lseek((*store)->statm_fd, 0, SEEK_SET); + + /* clear the entire changed bitmap */ + memset((*store)->changed, 0, sizeof((*store)->changed)); + } + + /* read in statm and parse it assigning the vm members accordingly */ + while((len = try_read((*store)->statm_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + /* parse the fields from the file, stepping through... */ + input = vmon->buf[i]; + switch(state) { +#define VMON_IMPLEMENT_PARSER +#include "defs/proc_vm.def" + default: + /* we're finished parsing once we've fallen off the end of the symbols */ + break; + } + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* implements the io utilization sampling */ +typedef enum _vmon_proc_io_fsm_t { +#define VMON_ENUM_PARSER_STATES +#include "defs/proc_io.def" +} vmon_proc_io_fsm_t; + +static sample_ret_t proc_sample_io(vmon_t *vmon, vmon_proc_t *proc, vmon_proc_io_t **store) +{ + int i, len; + int changes = 0; + vmon_proc_io_fsm_t state = VMON_PARSER_STATE_PROC_IO_RCHAR_LABEL; +#define VMON_PREPARE_PARSER +#include "defs/proc_io.def" + + if(!proc) { /* dtor */ + try_close(&(*store)->io_fd); + + return DTOR_FREE; + } + + if(!(*store)) { /* ctor */ + (*store) = calloc(1, sizeof(vmon_proc_io_t)); + if(proc->is_thread) { + (*store)->io_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/task/%i/io", proc->pid, proc->pid); + } else { + (*store)->io_fd = openf(vmon, O_RDONLY, vmon->proc_dir, "%i/io", proc->pid); + } + + /* initially everything is considered changed */ + memset((*store)->changed, 0xff, sizeof((*store)->changed)); + } else { + try_lseek((*store)->io_fd, 0, SEEK_SET); + + /* clear the entire changed bitmap */ + memset((*store)->changed, 0, sizeof((*store)->changed)); + } + + /* read in io and parse it assigning the io members accordingly */ + while((len = try_read((*store)->io_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + /* parse the fields from the file, stepping through... */ + input = vmon->buf[i]; + switch(state) { +#define VMON_IMPLEMENT_PARSER +#include "defs/proc_io.def" + default: + /* we're finished parsing once we've fallen off the end of the symbols */ + break; + } + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* here starts the private system-wide samplers */ + +typedef enum _vmon_sys_stat_fsm_t { +#define VMON_ENUM_PARSER_STATES +#include "defs/sys_stat.def" +} vmon_sys_stat_fsm_t; + +/* system-wide stat sampling, things like CPU usages, stuff in /proc/stat */ +static sample_ret_t sys_sample_stat(vmon_t *vmon, vmon_sys_stat_t **store) +{ + int i, len; + int changes = 0; + vmon_sys_stat_fsm_t state = VMON_PARSER_STATE_SYS_STAT_CPU_PREFIX; /* this could be defined as the "VMON_PARSER_INITIAL_STATE" */ +#define VMON_PREPARE_PARSER +#include "defs/sys_stat.def" + + if(!vmon) { /* dtor */ + try_close(&(*store)->stat_fd); + return DTOR_FREE; + } + + if(!(*store)) { /* ctor */ + (*store) = calloc(1, sizeof(vmon_sys_stat_t)); + (*store)->stat_fd = openat(dirfd(vmon->proc_dir), "stat", O_RDONLY); + } else { + try_lseek((*store)->stat_fd, 0, SEEK_SET); + } + + while((len = try_read((*store)->stat_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + input = vmon->buf[i]; + switch(state) { +#define VMON_PARSER_DELIM ' ' /* TODO XXX eliminate the need for this, I want the .def's to include all the data format knowledge */ +#define VMON_IMPLEMENT_PARSER +#include "defs/sys_stat.def" + default: + /* we're finished parsing once we've fallen off the end of the symbols */ + break; + } + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* system-wide vm sampling, /proc/meminfo & /proc/vmstat */ +typedef enum _vmon_sys_vm_fsm_t { +#define VMON_ENUM_PARSER_STATES +#include "defs/sys_vm.def" +} vmon_sys_vm_fsm_t; + +static sample_ret_t sys_sample_vm(vmon_t *vmon, vmon_sys_vm_t **store) +{ + int i, len; + int changes = 0; + vmon_sys_vm_fsm_t state = VMON_PARSER_STATE_SYS_VM_TOTAL_KB_LABEL; /* this could be defined as the "VMON_PARSER_INITIAL_STATE" */ +#define VMON_PREPARE_PARSER +#include "defs/sys_vm.def" + + if(!vmon) { /* dtor */ + try_close(&(*store)->meminfo_fd); + return DTOR_FREE; + } + + if(!(*store)) { /* ctor */ + (*store) = calloc(1, sizeof(vmon_sys_vm_t)); + (*store)->meminfo_fd = openat(dirfd(vmon->proc_dir), "meminfo", O_RDONLY); + + /* initially everything is considered changed */ + memset((*store)->changed, 0xff, sizeof((*store)->changed)); + } else { + try_lseek((*store)->meminfo_fd, 0, SEEK_SET); + memset((*store)->changed, 0, sizeof((*store)->changed)); + } + + while((len = try_read((*store)->meminfo_fd, vmon->buf, sizeof(vmon->buf))) > 0) { + for(i = 0; i < len; i++) { + input = vmon->buf[i]; + switch(state) { +#define VMON_PARSER_DELIM ' ' /* TODO XXX eliminate the need for this, I want the .def's to include all the data format knowledge */ +#define VMON_IMPLEMENT_PARSER +#include "defs/sys_vm.def" + default: + /* we're finished parsing once we've fallen off the end of the symbols */ + break; + } + } + } + + return changes ? SAMPLE_CHANGED : SAMPLE_UNCHANGED; +} + + +/* here begins the public interface */ + +/* initialize a vmon instance, proc_wants is a default wants mask, optionally inherited vmon_proc_monitor() calls */ +int vmon_init(vmon_t *vmon, vmon_flags_t flags, vmon_sys_wants_t sys_wants, vmon_proc_wants_t proc_wants) +{ + int i; + + if((flags & VMON_FLAG_PROC_ALL) && (proc_wants & VMON_WANT_PROC_FOLLOW_CHILDREN)) { + return 0; + } + + if(!(vmon->proc_dir = opendir("/proc"))) { + return 0; + } + + INIT_LIST_HEAD(&vmon->processes); + INIT_LIST_HEAD(&vmon->orphans); + + for(i = 0; i < VMON_HTAB_SIZE; i++) { + INIT_LIST_HEAD(&vmon->htab[i]); + } + + memset(vmon->stores, 0, sizeof(vmon->stores)); + + /* TODO XXX: rename to something processes-specific! see vmon.h */ + vmon->array = NULL; + vmon->array_allocated_nr = vmon->array_active_nr = vmon->array_hint_free = 0; + + /* TODO XXX: this is temporary, see vmon.h */ + INIT_LIST_HEAD(&vmon->fobjects); + vmon->fobjects_nr = 0; + + vmon->flags = flags; + vmon->sys_wants = sys_wants; + vmon->proc_wants = proc_wants; + + /* here we populate the sys and proc function tables */ +#define vmon_want(_sym, _name, _func) \ + vmon->sys_funcs[VMON_STORE_ ## _sym] = (int(*)(vmon_t *, void **))_func; +#include "defs/sys_wants.def" + +#define vmon_want(_sym, _name, _func) \ + vmon->proc_funcs[VMON_STORE_ ## _sym] = (int(*)(vmon_t *, vmon_proc_t *, void **))_func; +#include "defs/proc_wants.def" + + vmon->sample_cb = NULL; + vmon->proc_ctor_cb = NULL; + vmon->proc_dtor_cb = NULL; + vmon->fobject_ctor_cb = NULL; + vmon->fobject_dtor_cb = NULL; + + return 1; +} + + +/* destroy vmon instance */ +void vmon_destroy(vmon_t *vmon) +{ + /* TODO: do we want to forcibly unmonitor everything being monitored still, or require the caller to have done that beforehand? */ + /* TODO: cleanup other shit, like closedir(vmon->proc_dir), etc */ +} + + +/* helper for searching for the process in the process array, specify NULL to find a free slot */ +static int find_proc_in_array(vmon_t *vmon, vmon_proc_t *proc, int hint) +{ + int ret = -1; + + if(hint >= 0 && hint < vmon->array_allocated_nr && vmon->array[hint] == proc) { + /* the hint was accurate, bypass the search */ + ret = hint; + } else { + int i; + + /* search for the entry in the array */ + for(i = 0; i < vmon->array_allocated_nr; i++) { + if(vmon->array[i] == proc) { + ret = i; + break; + } + } + } + + if(!proc && ret == -1) { + vmon_proc_t **tmp; + + /* enlarge the array */ + tmp = realloc(vmon->array, (vmon->array_allocated_nr + VMON_ARRAY_GROWBY) * sizeof(vmon_proc_t *)); + if(tmp) { + memset(&tmp[vmon->array_allocated_nr], 0, VMON_ARRAY_GROWBY * sizeof(vmon_proc_t *)); + ret = vmon->array_hint_free = vmon->array_allocated_nr; + vmon->array_allocated_nr += VMON_ARRAY_GROWBY; + vmon->array = tmp; + } /* XXX TODO: handle realloc failure */ + } + + return ret; +} + + +/* simple helper for installing callbacks on the callback lists, currently only used for the per-process sample callbacks */ +/* will not install the same callback function & arg combination more than once, and will not install NULL-functioned callbacks at all! */ +static int maybe_install_proc_callback(vmon_t *vmon, list_head_t *callbacks, void (*func)(vmon_t *, vmon_proc_t *, void *), void *arg) +{ + if(func) { + vmon_proc_callback_t *cb; + + list_for_each_entry(cb, callbacks, callbacks) { + if(cb->func == func && cb->arg == arg) { + break; + } + } + + if(&cb->callbacks == callbacks) { + cb = malloc(sizeof(vmon_proc_callback_t)); + if(!cb) { + return 0; + } + cb->func = func; + cb->arg = arg; + list_add_tail(&cb->callbacks, callbacks); + } + } + + return 1; +} + + +/* monitor a process under a given vmon instance, the public interface. + * XXX note it's impossible to say "none" for wants per-process, just "inherit", if vmon_init() was told a proc_wants of "inherit" then it's like having "none" + * proc_wants for all proceses, perhaps improve this if there's a pressure to support this use case */ +vmon_proc_t * vmon_proc_monitor(vmon_t *vmon, vmon_proc_t *parent, int pid, vmon_proc_wants_t wants, void (*sample_cb)(vmon_t *, vmon_proc_t *, void *), void *sample_cb_data) +{ + vmon_proc_t *proc; + int hash = (pid % VMON_HTAB_SIZE), i; + int is_thread = (wants & VMON_INTERNAL_PROC_IS_THREAD) ? 1 : 0; + + wants &= ~VMON_INTERNAL_PROC_IS_THREAD; + + if(pid < 0) return NULL; + + list_for_each_entry(proc, &vmon->htab[hash], bucket) { + /* search for the process to see if it's already monitored, we allow threads to exist with the same pid hence the additional is_thread comparison */ + if(proc->pid == pid && proc->is_thread == is_thread) { + if(!maybe_install_proc_callback(vmon, &proc->sample_callbacks, sample_cb, sample_cb_data)) { + return NULL; + } + + proc->wants = wants; /* we can alter wants this way, though it clearly needs more consideration XXX */ + proc->refcnt++; + /* This is a predicament. If the top-level (externally-established) process monitor wins the race, the process has no parent and is on the vmon->processes list. + * Then the follow_children-established monitor comes along and wants to assign a parent, this isn't such a big deal, and we should be able to permit it, however, + * we're in the process of iterating the top-level processes list when we run the follow_children() sampler of a descendant which happens to also be the parent. + * We can't simply remove the process from the top-level processes list mid-iteration and stick it on the children list of the parent, the iterator could wind up + * following the new pointer into the parents children. + * + * What I'm doing for now is allowing the assignment of a parent when there is no parent, but we don't perform the vmon->processes to parent->children migration + * until the top-level sample_siblings() function sees the node with the parent. At that point, the node will migrate to the parent's children list. + */ + if(parent && !proc->parent) { + /* if a parent was supplied, and there is no current parent, the process is a top-level currently by external callers, but now appears to be a child of something as well, + * so in this scenario, we'll remove it from the top-level siblings list, and make it a child of the new parent. I don't think there needs to be concern about its being a thread here. */ + /* Note we can't simply move the process from its current processes list and add it to the supplied parent's children list, as that would break the iterator above us at the top-level, so + * we must defer the migration until the processes iterator context can do it for us - but this is tricky because we're in the middle of traversing our heirarchy and this process may + * be in a critical is_new state which must be realized this sample at its location in the heirarchy for correctness, there will be no reappearance of that critical state in the correct + * tree position for users like vwm. */ + /* the VMON_FLAG_2PASS flag has been introduced for users like vwm */ + proc->parent = parent; + } /* else if(parent && proc->parent) { XXX TODO: it shouldn't be possible to have conflicting parents, but may want to log an error if it happens. */ + + return proc; + } + } + + proc = (vmon_proc_t *)malloc(sizeof(vmon_proc_t)); + if(proc == NULL) { + /* TODO: report an error */ + return NULL; + } + + proc->pid = pid; + proc->wants = wants; + proc->generation = vmon->generation; + proc->refcnt = 1; + proc->is_new = 1; /* newly created process */ + proc->is_stale = 0; /* implicitly not stale, since it is new */ + proc->is_thread = is_thread; + memset(proc->stores, 0, sizeof(proc->stores)); + proc->parent = parent; + INIT_LIST_HEAD(&proc->sample_callbacks); + INIT_LIST_HEAD(&proc->children); + INIT_LIST_HEAD(&proc->siblings); + INIT_LIST_HEAD(&proc->threads); + + if(!maybe_install_proc_callback(vmon, &proc->sample_callbacks, sample_cb, sample_cb_data)) { + free(proc); + return NULL; + } + + if(parent) { + /* if a parent is specified, attach this process to the parent's children or threads with its siblings */ + if(is_thread) { + list_add_tail(&proc->threads, &parent->threads); + parent->threads_changed = 1; + } else { + list_add_tail(&proc->siblings, &parent->children); + parent->children_changed = 1; + } + } else { + /* if no parent is specified, this is a toplevel process, attach it to the vmon->processes list with its siblings */ + /* XXX ignoring is_thread if no parent is specified, it shouldn't occur, unless I want to support external callers monitoring specific threads explicitly, maybe... */ + list_add_tail(&proc->siblings, &vmon->processes); + vmon->processes_changed = 1; + } + + /* add this process to the hash table */ + list_add_tail(&proc->bucket, &vmon->htab[hash]); + + /* if process table maintenance is enabled acquire a free slot for this process */ + if((vmon->flags & VMON_FLAG_PROC_ARRAY) && (i = find_proc_in_array(vmon, NULL, vmon->array_hint_free)) != -1) { + vmon->array[i] = proc; + + /* cache where we get inserted into the array */ + proc->array_hint_pos = i; + } + + /* invoke ctor callback if set, note it's only called when a new vmon_proc_t has been instantiated */ + if(vmon->proc_ctor_cb) { + vmon->proc_ctor_cb(vmon, proc); + } + + return proc; +} + + +/* stop monitoring a process under a given vmon instance, a caller who supplied a sample_cb & sample_cb_data pair @ monitor() must also supply it @ unmonitor! */ +void vmon_proc_unmonitor(vmon_t *vmon, vmon_proc_t *proc, void (*sample_cb)(vmon_t *, vmon_proc_t *, void *), void *sample_cb_data) +{ + vmon_proc_t *child, *_child; + int i; + + if(sample_cb) { /* uninstall callback */ + vmon_proc_callback_t *cb, *_cb; + + list_for_each_entry_safe(cb, _cb, &proc->sample_callbacks, callbacks) { + if(cb->func == sample_cb && cb->arg == sample_cb_data) { + list_del(&cb->callbacks); + free(cb); + break; + } + } + } + + if(--(proc->refcnt)) { /* if the process still has references, don't free it */ + return; + } + + /* recursively unmonitor any children processes being monitored */ + list_for_each_entry_safe(child, _child, &proc->children, siblings) { + if(child->parent == proc) { + child->parent = NULL; /* children we're currently a parent of, we're going bye bye, so make them orphans */ + list_add_tail(&child->siblings, &vmon->orphans); /* if the child becomes actually dtor'd in the nxt step it immediately will be discarded from the orphans list ... */ + } + vmon_proc_unmonitor(vmon, child, NULL, NULL); + } + + /* unmonitor all threads being monitored, suppressed if this process is a thread itself, as threads don't have children */ + if(!proc->is_thread) { + list_for_each_entry_safe(child, _child, &proc->threads, threads) { + vmon_proc_unmonitor(vmon, child, NULL, NULL); + } + } + + /* if maintaining a process array NULL out the entry */ + if((vmon->flags & VMON_FLAG_PROC_ARRAY) && (i = find_proc_in_array(vmon, proc, proc->array_hint_pos)) != -1) { + vmon->array[i] = NULL; + /* store its index if the current free hint isn't free, or it's lower than the current free hint, making the hint useful */ + if(vmon->array[vmon->array_hint_free] || i < vmon->array_hint_free) { + vmon->array_hint_free = i; + } + } + + list_del(&proc->siblings); + if(proc->is_thread) { + list_del(&proc->threads); + } + list_del(&proc->bucket); + + if(proc->parent) { /* XXX TODO: verify this works ok for unmonitored orphans */ + /* set the children changed flag in the parent */ + if(proc->is_thread) { + proc->parent->threads_changed = 1; + } else { + proc->parent->children_changed = 1; /* XXX TODO: for now I modify children_changed for both when the child dtor occurs and is_stale gets set */ + } + } else { + /* or the toplevel processes changed flag if parentless/toplevel */ + vmon->processes_changed = 1; + } + + for(i = 0; i < sizeof(vmon->proc_funcs) / sizeof(vmon->proc_funcs[VMON_STORE_PROC_STAT]); i++) { + if(proc->stores[i] != NULL) { /* any non-NULL stores must have a function installed and must have been sampled, invoke the dtor branch */ + if(vmon->proc_funcs[i](vmon, NULL, &proc->stores[i]) == DTOR_FREE) { + free(proc->stores[i]); + } + proc->stores[i] = NULL; + } + } + + /* invoke the dtor if set, note it only happens when the vmon_proc_t instance is about to be freed, not when it transitions to proc.is_stale=1 */ + if(vmon->proc_dtor_cb) { + vmon->proc_dtor_cb(vmon, proc); + } + + free(proc); +} + + +/* internal sampling helper, perform sampling for a given process */ +static void sample(vmon_t *vmon, vmon_proc_t *proc) +{ + int i, wants, cur; + + /* load this process monitors wants, or inherit the default */ + wants = proc->wants ? proc->wants : vmon->proc_wants; + + proc->activity = 0; + for(i = 0, cur = 1; wants; cur <<= 1, i++) { + if(wants & cur) { + if(vmon->proc_funcs[i](vmon, proc, &proc->stores[i]) == SAMPLE_CHANGED) { + proc->activity |= cur; + } + wants &= ~cur; + } + } +} + + +/* internal sampling helper, perform sampling for all sibling processes in the provided siblings list */ +static int sample_threads(vmon_t *vmon, list_head_t *threads) +{ + vmon_proc_t *proc; + + list_for_each_entry(proc, threads, threads) { + sample(vmon, proc); + +#if 0 + /* callbacks can't be installed currently on threads */ + vmon_proc_callback_t *cb; + + list_for_each_entry(cb, &proc->sample_callbacks, callbacks) { + cb->func(vmon, proc, cb->arg); + } +#endif + } + + return 1; +} + + +/* internal single-pass sampling helper, recursively perform sampling and callbacks for all sibling processes in the provided siblings list */ +static int sample_siblings(vmon_t *vmon, list_head_t *siblings) +{ + vmon_proc_t *proc, *_proc; + + list_for_each_entry_safe(proc, _proc, siblings, siblings) { + vmon_proc_callback_t *cb; + int entered_new = 0; + + /* prepare to transition top-level processes out of the is_new state, there's no sampler acting on behalf of top-level processes */ + if(proc->is_new) { + entered_new = 1; + } + + sample(vmon, proc); /* invoke samplers for this node */ + sample_threads(vmon, &proc->threads); /* invoke samplers for this node's threads */ + sample_siblings(vmon, &proc->children); /* invoke samplers for this node's children, and their callbacks, by recursing into this function */ + /* XXX TODO: error returns */ + + /* if this is the top-level processes list, and proc has found a parent through the above sampling, migrate it to the parent's children list */ + if(siblings == &vmon->processes && proc->parent) { + list_del(&proc->siblings); + list_add_tail(&proc->siblings, &proc->parent->children); + continue; + } + + /* XXX note that sample_callbacks are called only after all the descendants have had their sampling performed (and their potential callbacks invoked) + * this enables the installation of a callback at a specific node in the process heirarchy which can also perform duties on behalf of the children + * being monitored, handy when automatically following children, an immediately relevant use case (vwm) + */ + list_for_each_entry(cb, &proc->sample_callbacks, callbacks) { + cb->func(vmon, proc, cb->arg); + } + + /* transition new to non-new processes where we're responsible, this is a slight problem */ + if(!proc->parent && entered_new) { + proc->is_new = 0; + } + } + + /* if we've just finished the top-level processes, and we have some orphans, we want to make the orphans top-level processes and sample them as such */ + if(siblings == &vmon->processes && !list_empty(&vmon->orphans)) { + /* XXX TODO: do I need to get these orphans sampled immediately for this sample? Are they getting skipped this sample? + * TODO: instrument the samplers to see if generation is > 1 behind to detect drops... */ + list_splice_init(&vmon->orphans, vmon->processes.prev); + } + + return 1; +} + + +/* 2pass version of the internal heirarchical sampling helper */ +static int sample_siblings_pass1(vmon_t *vmon, list_head_t *siblings) +{ + vmon_proc_t *proc, *_proc; + + /* invoke samplers */ + list_for_each_entry_safe(proc, _proc, siblings, siblings) { + sample(vmon, proc); /* invoke samplers for this node */ + sample_threads(vmon, &proc->threads); /* invoke samplers for this node's threads */ + sample_siblings_pass1(vmon, &proc->children); /* invoke samplers for this node's children, by recursing into this function */ + /* XXX TODO: error returns */ + + /* if this is the top-level processes list, and proc has found a parent through the above sampling, migrate it to the parent's children list */ + /* XXX: clarification; a process may have been monitored explicitly by an external caller which then becomes monitored as the followed child of + * another process, here we detect that and move the process out of the top-level processes list and down to the children list it belongs to. */ + if(siblings == &vmon->processes) { + /* XXX: nobody maintains the generation numbers for the top-level processes, so it's done here... + * TODO: detect exited top-level processes and do something useful? */ + proc->generation = vmon->generation; + + if(proc->parent) { + list_del(&proc->siblings); + list_add_tail(&proc->siblings, &proc->parent->children); + } + } + } + + if(siblings == &vmon->processes && !list_empty(&vmon->orphans)) { + /* XXX TODO: do I need to get these orphans sampled immediately for this sample? Are they getting skipped this sample? + * TODO: instrument the samplers to see if generation is > 1 behind to detect drops and log as bugs... */ + list_splice_init(&vmon->orphans, vmon->processes.prev); + } + + return 1; +} + + +static int sample_siblings_pass2(vmon_t *vmon, list_head_t *siblings) +{ + vmon_proc_t *proc; + + /* invoke callbacks */ + list_for_each_entry(proc, siblings, siblings) { + vmon_proc_callback_t *cb; + + sample_siblings_pass2(vmon, &proc->children); /* recurse into children, we invoke callbacks as encountered on nodes from the leaves up */ + + list_for_each_entry(cb, &proc->sample_callbacks, callbacks) { + cb->func(vmon, proc, cb->arg); + } + + if(!proc->parent && proc->is_new) { /* top-level processes aren't managed by a follower/sampler, so we need to clear their is_new flag, this approach is slightly deviant from the managed case, + * as the managed case will actually allow the process to retain its is_new flag across a vmon_sample() cycle, where we're clearing it @ exit. It makes + * no difference to the callbacks, but if someone walks the tree after vmon_sample() relying on is_new, they'll be confused. XXX TODO FIXME + * May be able to leverage the generation number and turn the top-level sampler into more of a follower analog??? + */ + proc->is_new = 0; + } + } + + return 1; +} + + +/* collect information for all monitored processes, this is the interesting part, call it periodically at a regular interval */ +int vmon_sample(vmon_t *vmon) +{ + int i, wants, cur, ret = 1; + + vmon->generation++; + + /* first manage the "all processes monitored" use case, this doesn't do any sampling, it just maintains the top-level list of processes being monitored */ + /* note this doesn't cover threads, as linux doesn't expose threads in the readdir of /proc, even though you can directly look them up at /proc/$tid */ + if((vmon->flags & VMON_FLAG_PROC_ALL)) { + struct dirent dentry, *dentry_res; + list_head_t *tmp, *_tmp = &vmon->processes; + + /* if VMON_FLAG_PROC_ALL flag is set, quite a different code path is used which simply readdir()'s /proc, treating every numeric directory found + * as a process to monitor. The list of toplevel processes being monitored is kept in sync with these, automatically monitoring + * new processes found, and unmonitoring processes now absent, in a fashion very similar to the proc_sample_files() code. */ + seekdir(vmon->proc_dir, 0); + while(!readdir_r(vmon->proc_dir, &dentry, &dentry_res) && dentry_res) { + int pid, found; + + if(dentry.d_type != DT_DIR || dentry.d_name[0] < '0' || dentry.d_name[0] > '9') { + /* skip non-directories and non-numeric directories */ + continue; + } + + pid = atoi(dentry.d_name); + + found = 0; + list_for_each(tmp, _tmp) { /* note how we use _tmp as the head for the processes iteration, resuming from the last process' node */ + if(tmp == &vmon->processes) { + continue; /* must take care to skip the processes list_head_t, as it's not a vmon_proc_t */ + } + + if(list_entry(tmp, vmon_proc_t, siblings)->pid == pid) { + found = 1; + break; + } + } + + if(!found) { + /* monitor the process */ + vmon_proc_t *proc = vmon_proc_monitor(vmon, NULL, pid, vmon->proc_wants, NULL, NULL); + + if(!proc) { + /* TODO error */ + continue; + } + + tmp = &proc->siblings; + } + + list_move_tail(tmp, _tmp); /* place this process next to the current start (XXX there are cases where it's already there) */ + + list_entry(tmp, vmon_proc_t, siblings)->generation = vmon->generation; /* for identifying stale nodes */ + + _tmp = tmp; /* set this node as the head to start the next search from */ + } + + list_for_each_safe(tmp, _tmp, &vmon->processes) { /* XXX safe version needed since vmon_proc_unmonitor() deletes from the processes list */ + if(list_entry(tmp, vmon_proc_t, siblings)->generation != vmon->generation) { + vmon_proc_unmonitor(vmon, list_entry(tmp, vmon_proc_t, siblings), NULL, NULL); + } else { + /* we can stop looking for stale processes upon finding a non-stale one, since they've been sorted by the above algorithm */ + break; + } + } + } + + /* now for actual sampling */ + + /* first the sys-wide samplers */ + wants = vmon->sys_wants; /* the caller-requested sys-wide wants */ + vmon->activity = 0; + for(i = 0, cur = 1; wants; cur <<= 1, i++) { + if(wants & cur) { + if(vmon->sys_funcs[i](vmon, &vmon->stores[i]) == SAMPLE_CHANGED) { + vmon->activity |= cur; + } + wants &= ~cur; + } + } + + if(vmon->sample_cb) { + vmon->sample_cb(vmon); + } + + /* then the per-process samplers */ + if((vmon->flags & VMON_FLAG_PROC_ARRAY)) { + int j; + /* TODO: determine if this really makes sense, if we always maintain a heirarchy even in array mode, then we + * should probably always sample in the heirarchical order, or maybe make it caller-specified. + * There is a benefit to invoking the callbacks in heirarchical order, the callbacks can make assumptions about the children + * having the callbacks invoked prior to the current node, if done in depth-first order.... + * XXX this is a problem, figure out what to do with this, for now we don't even maintain the heirarchy in VMON_FLAG_PROC_ALL + * mode, only FOLLOW_CHILDREN mode, and it's likely PROC_ARRAY will generally be used together with PROC_ALL, so no heirarchy + * is available to traverse even if we wanted to. + */ + + /* flat process-array ordered sampling, in this mode threads and processes are all placed flatly in the array, + * so this does the sampling for all monitored in no particular order */ + for(j = 0; j < vmon->array_allocated_nr; j++) { + vmon_proc_t *proc; + + if((proc = vmon->array[j])) { + vmon_proc_callback_t *cb; + + sample(vmon, proc); + + list_for_each_entry(cb, &proc->sample_callbacks, callbacks) { + cb->func(vmon, proc, cb->arg); + } + + /* age process, we use the presence of a parent as a flag indicating if the process is managed ala follow children/threads + * XXX TODO: should probably change the public _monitor() api to not contain a parent param then */ + if(!proc->parent && proc->is_new) { + proc->is_new = 0; + } + } + } + } else if((vmon->flags & VMON_FLAG_2PASS)) { + /* recursive heirarchical depth-first processes tree sampling, at each node threads come before children, done in two passes: + * Pass 1. samplers + * Pass 2. callbacks + * XXX this is the path vwm utilizes, everything else is for other uses, like implementing top-like programs. + */ + ret = sample_siblings_pass1(vmon, &vmon->processes); /* XXX TODO: errors */ + ret = sample_siblings_pass2(vmon, &vmon->processes); + } else { + /* recursive heirarchical depth-first processes tree sampling, at each node threads come before children, done in a single pass: + * Pass 1. samplers; callbacks (for every node) + */ + ret = sample_siblings(vmon, &vmon->processes); + } + + return ret; +} diff --git a/libvmon/vmon.h b/libvmon/vmon.h new file mode 100644 index 0000000..06a062b --- /dev/null +++ b/libvmon/vmon.h @@ -0,0 +1,308 @@ +#ifndef _VMON_H +#define _VMON_H + +#include <sys/types.h> +#include <dirent.h> +#include <stdint.h> +#include <string.h> /* I use strcmp() in the type comparator definitions */ + +#include "bitmap.h" +#include "list.h" + +#define VMON_HTAB_SIZE 128 /* number of buckets in the processes hash table */ +#define VMON_ARRAY_GROWBY 5 /* number of elements to grow the processes array */ + +typedef enum _vmon_flags_t { + VMON_FLAG_NONE = 0, + VMON_FLAG_PROC_ARRAY = 1L, /* maintain a process array (useful if you need to do things like implement top(1) */ + VMON_FLAG_PROC_ALL = 1L << 1, /* monitor all the processes in the system (XXX this has some follow_children implications...) */ + VMON_FLAG_2PASS = 1L << 2, /* perform all sampling/wants in a first pass, then invoke all callbacks in second in vmon_sample(), important if your callbacks are layout-sensitive (vwm) */ +} vmon_flags_t; + +/* store ids, used as indices into the stores array, and shift offsets for the wants mask */ +typedef enum _vmon_sys_store_t { +#define vmon_want(_sym, _name, _func) VMON_STORE_ ## _sym, +#include "defs/sys_wants.def" + VMON_STORE_SYS_NR +} vmon_sys_store_t; + +typedef enum _vmon_sys_wants_t { + VMON_WANT_SYS_NONE = 0, +#define vmon_want(_sym, _name, _func) VMON_WANT_ ## _sym = 1L << VMON_STORE_ ## _sym, +#include "defs/sys_wants.def" +} vmon_sys_wants_t; + +typedef enum _vmon_proc_store_t { +#define vmon_want(_sym, _name, _func) VMON_STORE_ ## _sym, +#include "defs/proc_wants.def" + VMON_STORE_PROC_NR +} vmon_proc_store_t; + +typedef enum _vmon_proc_wants_t { + VMON_WANT_PROC_INHERIT = 0, +#define vmon_want(_sym, _name, _func) VMON_WANT_ ## _sym = 1L << VMON_STORE_ ## _sym, +#include "defs/proc_wants.def" + /* XXX: note proc_wants is internally overloaded in libvmon to communicate when a process is a thread-child of a process, so not all bits are available. */ +} vmon_proc_wants_t; + + +/* we add some new complex types */ +typedef struct _vmon_char_array_t { + char *array; + int len; + int alloc_len; +} vmon_char_array_t; + +typedef struct _vmon_str_array_t { + char **array; + int len; + int alloc_len; +} vmon_str_array_t; + + +/* system stat stuff (/proc/stat...) */ +typedef enum _vmon_sys_stat_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/sys_stat.def" + VMON_SYS_STAT_NR /* append this symbol to the end so we have a count */ +} vmon_sys_stat_sym_t; + +typedef struct _vmon_sys_stat_t { + int stat_fd; + + char changed[BITNSLOTS(VMON_SYS_STAT_NR)]; /* bitmap for indicating changed fields */ + +#define VMON_DECLARE_MEMBERS +#include "defs/sys_stat.def" +} vmon_sys_stat_t; + + +/* system vm/mem stuff (/proc/meminfo, /proc/vmstat...) */ +typedef enum _vmon_sys_vm_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/sys_vm.def" + VMON_SYS_VM_NR /* append this symbol to the end so we have a count */ +} vmon_sys_vm_sym_t; + +typedef struct _vmon_sys_vm_t { + int meminfo_fd; + + char changed[BITNSLOTS(VMON_SYS_VM_NR)]; /* bitmap for indicating changed fields */ + +#define VMON_DECLARE_MEMBERS +#include "defs/sys_vm.def" +} vmon_sys_vm_t; + + +/* stat things we always monitor for a process, regardless of the caller's wants */ +typedef enum _vmon_proc_stat_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/proc_stat.def" + VMON_PROC_STAT_NR /* append this symbol to the end so we have a count */ +} vmon_proc_stat_sym_t; + +typedef struct _vmon_proc_stat_t { + int cmdline_fd, comm_fd, wchan_fd, stat_fd; /* per-process stat monitoring /proc/$pid/{wchan,stat} file handles */ + + char changed[BITNSLOTS(VMON_PROC_STAT_NR)]; /* bitmap for indicating changed fields */ + +#define VMON_DECLARE_MEMBERS +#include "defs/proc_stat.def" +} vmon_proc_stat_t; + + +/* vm-related per-process things we can monitor */ +typedef enum _vmon_proc_vm_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/proc_vm.def" + VMON_PROC_VM_NR /* append this symbol to the end so we have a count */ +} vmon_proc_vm_sym_t; + +typedef struct _vmon_proc_vm_t { + int statm_fd; /* per-process vm monitoring /proc/$pid/statm file handle */ + + char changed[BITNSLOTS(VMON_PROC_VM_NR)]; /* bitmap for indicating changed fields */ + +#define VMON_DECLARE_MEMBERS +#include "defs/proc_vm.def" +} vmon_proc_vm_t; + + +/* io-related per-process things we can monitor */ +typedef enum _vmon_proc_io_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/proc_io.def" + VMON_PROC_IO_NR /* append this symbol to the end so we have a count */ +} vmon_proc_io_sym_t; + +typedef struct _vmon_proc_io_t { + int io_fd; /* per-process io monitoring /proc/$pid/io file handle */ + + char changed[BITNSLOTS(VMON_PROC_IO_NR)]; /* bitmap for indicating changed fields */ + +#define VMON_DECLARE_MEMBERS +#include "defs/proc_io.def" +} vmon_proc_io_t; + + +/* follow children want context */ +typedef struct _vmon_proc_follow_children_t { + int children_fd; /* per-process children following /proc/$pid/task/$pid/children file handle */ +} vmon_proc_follow_children_t; + + +/* follow threads want context */ +typedef struct _vmon_proc_follow_threads_t { + DIR *task_dir; /* per-process threads monitoring /proc/$pid/task handle */ +} vmon_proc_follow_threads_t; + + +/* open files monitoring */ +typedef enum _vmon_proc_files_sym_t { +#define VMON_ENUM_SYMBOLS +#include "defs/proc_files.def" +} vmon_proc_files_sym_t; + +typedef enum _vmon_fobject_type_t { + VMON_FOBJECT_TYPE_UNRECOGNIZED = 0, + /* TODO, enumerate the possible opened fobject types, this should come out of a .def */ + VMON_FOBJECT_TYPE_PIPE, + VMON_FOBJECT_TYPE_SOCKET, + VMON_FOBJECT_TYPE_ANON, + VMON_FOBJECT_TYPE_NR +} vmon_fobject_type_t; + +typedef struct _vmon_fobject_t { + list_head_t bucket; /* fobjects hash table bucket this fobject belongs to */ + uint64_t inum; /* inode number */ + list_head_t ref_fds; /* referring fds list, this is a list of proc_fd_t's which appear to have this object open */ + int refcnt; /* reference count, this may be greater than the # of nodes in ref_fds, for instance the + monitoring of /proc/net/unix will maintain references to fobjects for every row, without + maintaing nodes on ref_fds. But there are certain fobjects which simply emerge due to + processes having them open (pipes) which are not explicitly monitored elsewhere, in those + cases the refcnt and number of nodes in ref_fds shall match. */ + vmon_fobject_type_t type; /* type for this fobject */ + + + /* TODO: possibly hook into the object-type-specific information here, if so, it should come out of .defs */ + /* XXX the question is do I want to introduce that resource allocation here as part of the fobject, or do I want + * it elsewhere and potentially optional? I think it makes sense to make it optional and triggered by asking for + * fobject detail monitoring, so instead of a union here we should have a pointer, and that pointer becomes useful + * when fobject-type monitors become active */ + void *foo; /* hook for caller's data, if needed (expected to be used together with fobject_[cd]tor_cb) */ +} vmon_fobject_t; + +typedef struct _vmon_proc_fd_t { + list_head_t fds; /* per-process files list node */ + int generation; /* generation number, for convenient detection of closed files */ + struct _vmon_proc_t *process; /* process this fd belongs to (annoying, but enables linking processes with fobject refs) */ + list_head_t ref_fds; /* ref_fds list node */ + vmon_fobject_t *object; /* the object instance this fd refers to (this object also contains the head for the refs list) */ + +#define VMON_DECLARE_MEMBERS +#include "defs/proc_files.def" +} vmon_proc_fd_t; + +typedef struct _vmon_proc_files_t { + int refcnt; /* reference count for dealing with sharing of open files (like threads...) */ + DIR *fd_dir; /* per-process files /proc/$pid/fd handle */ + list_head_t fds; /* per-process files linked list head */ +} vmon_proc_files_t; + + +/* TODO per-process VM stats monitoring */ + +struct _vmon_t; + + +/* list of callbacks is maintained for the per-process callbacks, it's convenient to do things like update multiple dynamic contexts associated with a given process monitor (think multiple windows) */ +typedef struct _vmon_proc_callback_t { + void (*func)(struct _vmon_t *, struct _vmon_proc_t *, void *); + void *arg; + list_head_t callbacks; +} vmon_proc_callback_t; + +typedef struct _vmon_proc_t { + list_head_t bucket; /* processes hash table bucket this process belongs to */ + + list_head_t children; /* head of the children of this process, empty when no children */ + list_head_t siblings; /* node in siblings list */ + list_head_t threads; /* head or node for the threads list, empty when process has no threads */ + + struct _vmon_proc_t *parent; /* reference to the parent */ + + int array_hint_pos; /* hint for the process's position in the array (when array maintenance has been requested) */ + + int pid; /* the PID of the process being monitored */ + + int generation; /* generation number, for convenient detection of exited processes */ + int refcnt; /* reference count on this node */ + vmon_proc_wants_t wants; /* wants @ this node */ + + vmon_proc_wants_t activity; /* bits updated when there's activity on the respective wants (stores have changes) */ + void *stores[VMON_STORE_PROC_NR]; /* pointers to the per-want per-monitored-process storage space */ + + /* callbacks invoked after sampling wants at and below this node */ + list_head_t sample_callbacks; /* list of callbacks to invoke sample_cb on behalf of (and supply as parameteres to) */ + void *foo; /* another per-process hook for whatever per-process uses the caller may have, but not managed by the api */ + + int children_changed:1; /* gets set when any of my immediate children have had is_new or is_stale set in the last sample */ + int threads_changed:1; /* gets set when any of my threads have had is_new or is_stale set in the last sample */ + int is_new:1; /* process is new in the most recent sample, automatically cleared on subsequent sample */ + int is_stale:1; /* process became stale in the most recent sample, automatically cleared on subsequent sample (process will be discarded) */ + int is_thread:1; /* process is a thread belonging to parent */ +} vmon_proc_t; + + +typedef struct _vmon_t { + DIR *proc_dir; /* /proc is opened @ vmon_init() */ + + /* TODO: rename this to something more contextually processes-specific */ + /* these array members are only relevant when array maintenance has been requested via VMON_FLAG_PROC_ARRAY @ vmon_init() */ + vmon_proc_t **array; /* array of processes being monitored (flat) */ + int array_allocated_nr; /* number of entries in the table */ + int array_active_nr; /* number of processes present in the table (including stale) */ + int array_hint_free; /* hint for a free element in the list */ + + list_head_t htab[VMON_HTAB_SIZE]; /* hash table for quickly finding processes being monitored */ + list_head_t processes; /* top of the processes heirarchy */ + list_head_t orphans; /* ephemeral list of processes orphaned this sample, orphans wind up becoming top-level processes */ + int processes_changed:1; /* flag set when the toplevel processes list changes */ + + list_head_t fobjects; /* XXX TODO: temporary single fobjects table, in the future this will be an array of type-indexed + * fobject hash tables */ + int fobjects_nr; /* XXX TODO: temporary simple counter of number of fobjects, this will change into something + * more like we have for the proceses array */ + vmon_flags_t flags; /* instance flags */ + vmon_sys_wants_t sys_wants; /* system-wide wants mask */ + vmon_proc_wants_t proc_wants; /* inherited per-process wants mask */ + + /* function tables for mapping of wants bits to functions (sys-wide and per-process) */ + int (*sys_funcs[VMON_STORE_SYS_NR])(struct _vmon_t *, void **); + int (*proc_funcs[VMON_STORE_PROC_NR])(struct _vmon_t *, vmon_proc_t *, void **); + + vmon_sys_wants_t activity; /* bits updated when there's activity on the respective wants (stores have changes) */ + void *stores[VMON_STORE_SYS_NR]; /* stores for the sys-wide wants */ + void (*sample_cb)(struct _vmon_t *); /* callback invoked after executing the selected sys wants (once per vmon_sample() call)) */ + + char buf[8192]; /* scratch buffer for private use XXX: it may make sense to dynamically size these... */ + char buf_bis[8192]; /* secondary scratch buffer for private use */ + int generation; /* generation counter for whatever might need it, increments with vmon_sample() calls */ + + /* callbacks we'll invoke in response to processes becoming instantiated and destroyed, when set */ + void (*proc_ctor_cb)(struct _vmon_t *, vmon_proc_t *); + void (*proc_dtor_cb)(struct _vmon_t *, vmon_proc_t *); + + /* callbacks we'll invoke in response to fobjects becoming instantiated and destroyed, when set */ + void (*fobject_ctor_cb)(struct _vmon_t *, vmon_fobject_t *); + void (*fobject_dtor_cb)(struct _vmon_t *, vmon_fobject_t *); +} vmon_t; + + +int vmon_init(vmon_t *, vmon_flags_t, vmon_sys_wants_t, vmon_proc_wants_t); +void vmon_destroy(vmon_t *); +vmon_proc_t * vmon_proc_monitor(vmon_t *, vmon_proc_t *, int, vmon_proc_wants_t, void (*)(vmon_t *, vmon_proc_t *, void *), void *); +void vmon_proc_unmonitor(vmon_t *, vmon_proc_t *, void (*)(vmon_t *, vmon_proc_t *, void *), void *); +int vmon_sample(vmon_t *); + +#endif |