pax_global_header00006660000000000000000000000064141726064040014516gustar00rootroot0000000000000052 comment=6a856ccc8dc151dddb6f1f9f11467875ea3d2206 ding-libs-0.6.2/000077500000000000000000000000001417260640400133735ustar00rootroot00000000000000ding-libs-0.6.2/.git-commit-template000066400000000000000000000003261417260640400172570ustar00rootroot00000000000000COMPONENT: Subject Explanation Resolves: https://pagure.io/SSSD/ding-libs/issue/XXXX # Try to keep the subject line within 52 chars ----| # Also please try to not exceed 72 characters of length for the body --| ding-libs-0.6.2/.gitignore000066400000000000000000000014641417260640400153700ustar00rootroot00000000000000*.[oa] configure config.log config.status config.rpath config.h config.h.in cscope.out doxy.config Makefile Makefile.in Makefile.in.in *.so *.so.[0-9].[0-9].[0-9] *.a *.l[oa] *.py[oc] *.pydevproject .deps .libs *.html *.[0-9] *.pc autom4te.cache libtool stamp-h1 m4/* !m4/ld-version-script.m4 aclocal.m4 depcomp ltmain.sh missing .dirstamp sssd.spec *.gmo *.header *.sed *.sin Makevars.template POTFILES Rules-quot stamp-po ABOUT-NLS build *.patch *.swp *.X tags *~ .vscode/ contrib/ding-libs.spec # Testing *_ut* *.out foo.conf test-suite.log test.ini bom2be bom2le bom3 bom4be bom4le dhash_example* dhash_test* merge.validator.* test_real* modtest.conf.* real.conf.manual test_rules.ini # Doxyfiles basicobjects/basicobjects.cfg.doxy collection/collection.cfg.doxy ini/ini_config.cfg.doxy refarray/ref_array.cfg.doxyding-libs-0.6.2/COPYING000066400000000000000000001045131417260640400144320ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . ding-libs-0.6.2/COPYING.LESSER000066400000000000000000000167331417260640400154340ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. This version of the GNU Lesser General Public License incorporates the terms and conditions of version 3 of the GNU General Public License, supplemented by the additional permissions listed below. 0. Additional Definitions. As used herein, "this License" refers to version 3 of the GNU Lesser General Public License, and the "GNU GPL" refers to version 3 of the GNU General Public License. "The Library" refers to a covered work governed by this License, other than an Application or a Combined Work as defined below. An "Application" is any work that makes use of an interface provided by the Library, but which is not otherwise based on the Library. Defining a subclass of a class defined by the Library is deemed a mode of using an interface provided by the Library. A "Combined Work" is a work produced by combining or linking an Application with the Library. The particular version of the Library with which the Combined Work was made is also called the "Linked Version". The "Minimal Corresponding Source" for a Combined Work means the Corresponding Source for the Combined Work, excluding any source code for portions of the Combined Work that, considered in isolation, are based on the Application, and not on the Linked Version. The "Corresponding Application Code" for a Combined Work means the object code and/or source code for the Application, including any data and utility programs needed for reproducing the Combined Work from the Application, but excluding the System Libraries of the Combined Work. 1. Exception to Section 3 of the GNU GPL. You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL. 2. Conveying Modified Versions. If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application that uses the facility (other than as an argument passed when the facility is invoked), then you may convey a copy of the modified version: a) under this License, provided that you make a good faith effort to ensure that, in the event an Application does not supply the function or data, the facility still operates, and performs whatever part of its purpose remains meaningful, or b) under the GNU GPL, with none of the additional permissions of this License applicable to that copy. 3. Object Code Incorporating Material from Library Header Files. The object code form of an Application may incorporate material from a header file that is part of the Library. You may convey such object code under terms of your choice, provided that, if the incorporated material is not limited to numerical parameters, data structure layouts and accessors, or small macros, inline functions and templates (ten or fewer lines in length), you do both of the following: a) Give prominent notice with each copy of the object code that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the object code with a copy of the GNU GPL and this license document. 4. Combined Works. You may convey a Combined Work under terms of your choice that, taken together, effectively do not restrict modification of the portions of the Library contained in the Combined Work and reverse engineering for debugging such modifications, if you also do each of the following: a) Give prominent notice with each copy of the Combined Work that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the Combined Work with a copy of the GNU GPL and this license document. c) For a Combined Work that displays copyright notices during execution, include the copyright notice for the Library among these notices, as well as a reference directing the user to the copies of the GNU GPL and this license document. d) Do one of the following: 0) Convey the Minimal Corresponding Source under the terms of this License, and the Corresponding Application Code in a form suitable for, and under terms that permit, the user to recombine or relink the Application with a modified version of the Linked Version to produce a modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source. 1) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. e) Provide Installation Information, but only if you would otherwise be required to provide such information under section 6 of the GNU GPL, and only to the extent that such information is necessary to install and execute a modified version of the Combined Work produced by recombining or relinking the Application with a modified version of the Linked Version. (If you use option 4d0, the Installation Information must accompany the Minimal Corresponding Source and Corresponding Application Code. If you use option 4d1, you must provide the Installation Information in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.) 5. Combined Libraries. You may place library facilities that are a work based on the Library side by side in a single library together with other library facilities that are not Applications and are not covered by this License, and convey such a combined library under terms of your choice, if you do both of the following: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities, conveyed under the terms of this License. b) Give prominent notice with the combined library that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 6. Revised Versions of the GNU Lesser General Public License. The Free Software Foundation may publish revised and/or new versions of the GNU Lesser 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 Library as you received it specifies that a certain numbered version of the GNU Lesser General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that published version or of any later version published by the Free Software Foundation. If the Library as you received it does not specify a version number of the GNU Lesser General Public License, you may choose any version of the GNU Lesser General Public License ever published by the Free Software Foundation. If the Library as you received it specifies that a proxy can decide whether future versions of the GNU Lesser General Public License shall apply, that proxy's public statement of acceptance of any version is permanent authorization for you to choose that version for the Library. ding-libs-0.6.2/Makefile.am000066400000000000000000000333221417260640400154320ustar00rootroot00000000000000TRACE_LEVEL=@TRACE_VAR@ RPMBUILD ?= $(PWD)/rpmbuild #Some old versions of automake don't define builddir builddir ?= . # Workaround for gettext whinging SUBDIRS = dist_noinst_DATA = \ m4 \ COPYING \ COPYING.LESSER \ path_utils/libpath_utils.sym \ dhash/libdhash.sym \ collection/libcollection.sym \ refarray/libref_array.sym \ basicobjects/libbasicobjects.sym \ ini/libini_config.sym ############################################################################## # Common ############################################################################## AM_CFLAGS = if HAVE_GCC AM_CFLAGS += \ -Wall -Wshadow -Wstrict-prototypes -Wpointer-arith -Wcast-qual \ -Wcast-align -Wwrite-strings -Wextra -Wno-unused-parameter \ -Wno-sign-compare -Wformat-security -Wmissing-prototypes -Wundef endif AM_CPPFLAGS = \ -I$(srcdir)/collection \ -I$(srcdir)/path_utils \ -I$(srcdir)/refarray \ -I$(srcdir)/dhash \ -I$(srcdir)/ini \ -I$(srcdir)/basicobjects \ -I$(srcdir) \ -I$(srcdir)/trace \ $(TRACE_LEVEL) ACLOCAL_AMFLAGS = -I m4 DOXYGEN = @DOXYGEN@ pkgconfigdir = $(libdir)/pkgconfig dist_pkgconfig_DATA = dist_doc_DATA = dist_examples_DATA = dist_include_HEADERS = lib_LTLIBRARIES = check_PROGRAMS = TESTS = examplesdir = $(docdir)/examples ############################################################################## # Path Utils ############################################################################## lib_LTLIBRARIES += libpath_utils.la dist_pkgconfig_DATA += path_utils/path_utils.pc dist_include_HEADERS += path_utils/path_utils.h libpath_utils_la_SOURCES = path_utils/path_utils.c libpath_utils_la_DEPENDENCIES = path_utils/libpath_utils.sym libpath_utils_la_LIBADD = $(LTLIBICONV) \ $(LTLIBINTL) libpath_utils_la_LDFLAGS = \ -version-info 1:1:0 if HAVE_LD_VERSION_SCRIPT libpath_utils_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/path_utils/libpath_utils.sym endif if HAVE_CHECK check_PROGRAMS += path_utils_ut \ ini_augment_ut_check \ ini_configmod_ut_check \ ini_parse_ut_check \ ini_validators_ut_check \ $(NULL) TESTS += path_utils_ut \ ini_augment_ut_check \ ini_configmod_ut_check \ ini_parse_ut_check \ ini_validators_ut_check \ $(NULL) endif path_utils_ut_SOURCES = path_utils/path_utils_ut.c path_utils_ut_CFLAGS = \ $(AM_CFLAGS) \ $(CHECK_CFLAGS) path_utils_ut_LDADD = \ $(CHECK_LIBS) \ libpath_utils.la path_utils-docs: if HAVE_DOXYGEN cd path_utils; \ $(DOXYGEN) path_utils.cfg.doxy; endif dist_doc_DATA += path_utils/README.path_utils ############################################################################## # dhash ############################################################################## lib_LTLIBRARIES += libdhash.la dist_pkgconfig_DATA += dhash/dhash.pc dist_include_HEADERS += dhash/dhash.h libdhash_la_SOURCES = dhash/dhash.c libdhash_la_DEPENDENCIES = dhash/libdhash.sym libdhash_la_LDFLAGS = \ -version-info 2:0:1 if HAVE_LD_VERSION_SCRIPT libdhash_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/dhash/libdhash.sym endif check_PROGRAMS += dhash_test dhash_example TESTS += dhash_test dhash_example if HAVE_CHECK check_PROGRAMS += dhash_ut_check TESTS += dhash_ut_check endif dhash_test_SOURCES = dhash/examples/dhash_test.c dhash_test_LDADD = libdhash.la dhash_example_SOURCES = dhash/examples/dhash_example.c dhash_example_LDADD = libdhash.la dhash_ut_check_SOURCES = dhash/dhash_ut_check.c dhash_ut_chech_CFLAGS = $(AM_CFLAGS) \ $(CHECK_CFLAGS) \ $(NULL) dhash_ut_check_LDADD = libdhash.la \ $(CHECK_LIBS) \ $(NULL) dist_examples_DATA += \ dhash/examples/dhash_test.c \ dhash/examples/dhash_example.c dist_doc_DATA += dhash/README.dhash ############################################################################## # collection ############################################################################## lib_LTLIBRARIES += libcollection.la dist_pkgconfig_DATA += collection/collection.pc dist_include_HEADERS += \ collection/collection.h \ collection/collection_tools.h \ collection/collection_queue.h \ collection/collection_stack.h libcollection_la_SOURCES = \ collection/collection.c \ collection/collection_tools.c \ collection/collection_cnv.c \ collection/collection_queue.c \ collection/collection_stack.c \ collection/collection_cmp.c \ collection/collection_iter.c \ collection/collection_priv.h \ trace/trace.h libcollection_la_DEPENDENCIES = collection/libcollection.sym libcollection_la_LDFLAGS = \ -version-info 5:1:1 if HAVE_LD_VERSION_SCRIPT libcollection_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/collection/libcollection.sym endif check_PROGRAMS += \ collection_ut \ collection_stack_ut \ collection_queue_ut TESTS += \ collection_ut \ collection_stack_ut \ collection_queue_ut collection_ut_SOURCES = collection/collection_ut.c collection_ut_LDADD = libcollection.la collection_stack_ut_SOURCES = collection/collection_stack_ut.c collection_stack_ut_LDADD = libcollection.la collection_queue_ut_SOURCES = collection/collection_queue_ut.c collection_queue_ut_LDADD = libcollection.la collection-docs: if HAVE_DOXYGEN cd collection; \ $(DOXYGEN) collection.cfg.doxy endif ############################################################################## # refarray ############################################################################## lib_LTLIBRARIES += libref_array.la dist_pkgconfig_DATA += refarray/ref_array.pc dist_include_HEADERS += refarray/ref_array.h libref_array_la_SOURCES = \ refarray/ref_array.c \ trace/trace.h libref_array_la_DEPENDENCIES = refarray/libref_array.sym libref_array_la_LDFLAGS = \ -version-info 3:1:2 if HAVE_LD_VERSION_SCRIPT libref_array_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/refarray/libref_array.sym endif check_PROGRAMS += ref_array_ut TESTS += ref_array_ut ref_array_ut_SOURCES = refarray/ref_array_ut.c ref_array_ut_LDADD = libref_array.la dist_doc_DATA += refarray/README.ref_array ref_array-docs: if HAVE_DOXYGEN cd refarray; \ $(DOXYGEN) ref_array.cfg.doxy endif ############################################################################## # basicobjects ############################################################################## lib_LTLIBRARIES += libbasicobjects.la dist_pkgconfig_DATA += basicobjects/basicobjects.pc dist_include_HEADERS += basicobjects/simplebuffer.h libbasicobjects_la_SOURCES = \ basicobjects/simplebuffer.c \ trace/trace.h libbasicobjects_la_DEPENDENCIES = basicobjects/libbasicobjects.sym libbasicobjects_la_LDFLAGS = \ -version-info 1:0:1 if HAVE_LD_VERSION_SCRIPT libbasicobjects_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/basicobjects/libbasicobjects.sym endif check_PROGRAMS += simplebuffer_ut TESTS += simplebuffer_ut simplebuffer_ut_SOURCES = basicobjects/simplebuffer_ut.c simplebuffer_ut_LDADD = libbasicobjects.la basicobjects-docs: if HAVE_DOXYGEN cd basicobjects; \ $(DOXYGEN) basicobjects.cfg.doxy endif ############################################################################## # ini_config ############################################################################## lib_LTLIBRARIES += libini_config.la dist_pkgconfig_DATA += ini/ini_config.pc dist_include_HEADERS += ini/ini_config.h ini/ini_configobj.h \ ini/ini_valueobj.h ini/ini_comment.h \ ini/ini_configmod.h libini_config_la_SOURCES = \ ini/ini_config.c \ ini/ini_config.h \ ini/ini_get_value.c \ ini/ini_get_array.c \ ini/ini_list.c \ ini/ini_print.c \ ini/ini_parse.c \ ini/ini_metadata.c \ ini/ini_metadata.h \ ini/ini_defines.h \ ini/ini_comment.c \ ini/ini_comment.h \ ini/ini_valueobj.c \ ini/ini_valueobj.h \ ini/ini_serialize.c \ ini/ini_fileobj.c \ ini/ini_configobj.c \ ini/ini_configobj.h \ ini/ini_configmod.h \ ini/ini_configmod.c \ ini/ini_config_priv.h \ ini/ini_get_valueobj.c \ ini/ini_get_array_valueobj.c \ ini/ini_list_valueobj.c \ ini/ini_augment.c \ trace/trace.h EXTRA_libini_config_la_DEPENDENCIES = ini/libini_config.sym libini_config_la_LIBADD = \ libcollection.la \ libpath_utils.la \ libref_array.la \ libbasicobjects.la \ $(LTLIBICONV) \ $(LTLIBINTL) libini_config_la_LDFLAGS = \ -version-info 7:1:2 if HAVE_LD_VERSION_SCRIPT libini_config_la_LDFLAGS += -Wl,--version-script=$(top_srcdir)/ini/libini_config.sym endif dist_noinst_DATA += \ ini/ini.conf \ ini/ini.d/real.conf \ ini/ini.d/test.conf \ ini/ini.d/ipa.conf \ ini/ini.d/foo.conf.in \ ini/ini.d/mysssd.conf \ ini/ini.d/smerge.conf \ ini/ini.d/sexpect.conf \ ini/ini.d/first.conf \ ini/ini.d/second.conf \ ini/ini.d/space.conf \ ini/ini.d/mergecheck.conf \ ini/ini.d/comment.conf \ ini/ini.d/real8.conf \ ini/ini.d/real16be.conf \ ini/ini.d/real16le.conf \ ini/ini.d/real32be.conf \ ini/ini.d/real32le.conf \ ini/ini.d/symbols.conf \ ini/ini.d/new_line.conf \ ini/ini.d/merge.validator \ ini/ini2.d/real8.conf \ ini/ini2.d/real16be.conf \ ini/ini2.d/real16le.conf \ ini/ini2.d/real32be.conf \ ini/ini2.d/real32le.conf check_PROGRAMS += \ ini_config_ut \ ini_comment_ut \ ini_valueobj_ut \ ini_parse_ut \ ini_augment_ut \ ini_configmod_ut \ ini_save_ut TESTS += \ ini_config_ut \ ini_comment_ut \ ini_valueobj_ut \ ini_parse_ut \ ini_augment_ut \ ini_configmod_ut \ ini_save_ut ini_config_ut_SOURCES = ini/ini_config_ut.c ini_config_ut_LDADD = \ libini_config.la \ libcollection.la ini_comment_ut_SOURCES = ini/ini_comment_ut.c ini_comment_ut_LDADD = libini_config.la ini_valueobj_ut_SOURCES = ini/ini_valueobj_ut.c ini_valueobj_ut_LDADD = libini_config.la libbasicobjects.la ini_parse_ut_SOURCES = ini/ini_parse_ut.c ini_parse_ut_LDADD = libini_config.la libcollection.la libbasicobjects.la ini_augment_ut_SOURCES = ini/ini_augment_ut.c ini_augment_ut_LDADD = libini_config.la libcollection.la \ libbasicobjects.la libpath_utils.la libref_array.la ini_configmod_ut_SOURCES = ini/ini_configmod_ut.c ini_configmod_ut_LDADD = libini_config.la libcollection.la \ libbasicobjects.la libpath_utils.la libref_array.la ini_augment_ut_check_SOURCES = ini/ini_augment_ut_check.c ini_augment_ut_check_CFLAGS = $(AM_CFLAGS) $(CHECK_CFLAGS) ini_augment_ut_check_LDADD = libini_config.la $(CHECK_LIBS) \ libref_array.la ini_configmod_ut_check_SOURCES = ini/ini_configmod_ut_check.c ini_configmod_ut_check_CFLAGS = $(AM_CFLAGS) $(CHECK_CFLAGS) ini_configmod_ut_check_LDADD = libini_config.la libcollection.la \ libbasicobjects.la libpath_utils.la \ libref_array.la \ $(CHECK_LIBS) ini_parse_ut_check_SOURCES = ini/ini_parse_ut_check.c ini_parse_ut_check_CFLAGS = $(AM_CFLAGS) $(CHECK_CFLAGS) ini_parse_ut_check_LDADD = libini_config.la \ libref_array.la \ $(CHECK_LIBS) ini_validators_ut_check_SOURCES = ini/ini_validators_ut_check.c ini_validators_ut_check_CFLAGS = $(AM_CFLAGS) $(CHECK_CFLAGS) ini_validators_ut_check_LDADD = libini_config.la $(CHECK_LIBS) ini_save_ut_SOURCES = ini/ini_save_ut.c ini_save_ut_LDADD = libini_config.la libcollection.la \ libbasicobjects.la libpath_utils.la libref_array.la ini_config-docs: if HAVE_DOXYGEN cd ini; \ $(DOXYGEN) ini_config.cfg.doxy endif clean-local-ini_config: rm -f ./*.out rm -f test.ini rm -f ./foo.conf ./bom* #From ini_parse_ut rm -f ./merge.validator.* #From ini_augment_ut rm -f ./real.conf.manual rm -f ./modtest.conf.real rm -f ./modtest.conf.exp rm -f ./test_* ############################################################################## # Additional rules ############################################################################## rpmroot: mkdir -p $(RPMBUILD)/BUILD mkdir -p $(RPMBUILD)/RPMS mkdir -p $(RPMBUILD)/SOURCES mkdir -p $(RPMBUILD)/SPECS mkdir -p $(RPMBUILD)/SRPMS rpms: dist-gzip rpmroot cp $(builddir)/contrib/ding-libs.spec $(RPMBUILD)/SPECS cp $(distdir).tar.gz $(RPMBUILD)/SOURCES cd $(RPMBUILD); \ rpmbuild --define "_topdir $(RPMBUILD)" -ba SPECS/ding-libs.spec if GIT_CHECKOUT prerelease-rpms: cp $(srcdir)/version.m4 $(srcdir)/version.m4.orig sed -e "s/m4_define(\[PRERELEASE_VERSION_NUMBER\], \[.*\])/m4_define(\[PRERELEASE_VERSION_NUMBER\], \[.`date +%Y%m%d%H`git`git log -1 --pretty=format:%h`\])/" < $(srcdir)/version.m4.orig > $(srcdir)/version.m4 $(MAKE) rpms mv $(srcdir)/version.m4.orig $(srcdir)/version.m4 endif # make srpms will use the old digest algorithm to be compatible # with RHEL5 srpm: dist-gzip rpmroot cp $(builddir)/contrib/ding-libs.spec $(RPMBUILD)/SPECS cp $(distdir).tar.gz $(RPMBUILD)/SOURCES cd $(RPMBUILD); \ rpmbuild --define "_topdir $(RPMBUILD)" \ --define _source_filedigest_algorithm=1 \ -bs SPECS/ding-libs.spec if GIT_CHECKOUT prerelease-srpm: cp $(srcdir)/version.m4 $(srcdir)/version.m4.orig sed -e "s/m4_define(\[PRERELEASE_VERSION_NUMBER\], \[.*\])/m4_define(\[PRERELEASE_VERSION_NUMBER\], \[.`date +%Y%m%d%H`git`git log -1 --pretty=format:%h`\])/" < $(srcdir)/version.m4.orig > $(srcdir)/version.m4 $(MAKE) srpm mv $(srcdir)/version.m4.orig $(srcdir)/version.m4 endif tests: all $(check_PROGRAMS) docs: path_utils-docs collection-docs ref_array-docs ini_config-docs basicobjects-docs clean-local: clean-local-ini_config rm -Rf doc ding-libs-0.6.2/README000066400000000000000000000003651417260640400142570ustar00rootroot00000000000000To build the ding-libs from the tarball: ./configure make make docs (optional) make check (optional) make install To build the ding-libs from a source checkout: autoreconf -if then follow the tarball instructions above. ding-libs-0.6.2/basicobjects/000077500000000000000000000000001417260640400160265ustar00rootroot00000000000000ding-libs-0.6.2/basicobjects/basicobjects.cfg.doxy.in000066400000000000000000001755221417260640400225450ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "libbasicobjects" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = "The $name class" \ "The $name widget" \ "The $name file" \ is \ provides \ specifies \ contains \ represents \ a \ an \ the # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@ # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.c *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *_ut.c config.h # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = NO # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = YES #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES ding-libs-0.6.2/basicobjects/basicobjects.pc.in000066400000000000000000000004461417260640400214160ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: basicobjects Description: Library contains basic objects like dynamic string Version: @BASICOBJECTS_VERSION@ Libs: -L${libdir} -lbasicobjects Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/basicobjects/libbasicobjects.sym000066400000000000000000000005351417260640400217050ustar00rootroot00000000000000BASICOBJECTS_0.1.0 { global: simplebuffer_free; simplebuffer_alloc; simplebuffer_grow; simplebuffer_add_raw; simplebuffer_add_str; simplebuffer_add_cr; simplebuffer_write; simplebuffer_get_buf; simplebuffer_get_len; local: *; }; BASICOBJECTS_0.1.1 { global: simplebuffer_get_vbuf; } BASICOBJECTS_0.1.0; ding-libs-0.6.2/basicobjects/simplebuffer.c000066400000000000000000000126371417260640400206660ustar00rootroot00000000000000/* Simple buffer Basic buffer manipulation routines. Taken from ELAPI code. Copyright (C) Dmitri Pal 2009 - 2010 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 . */ #include "config.h" #include /* for errors */ #include /* for free() */ #include /* for write() */ #include /* for memcpy() */ #include "simplebuffer.h" #include "trace.h" /* End line string */ #define ENDLNSTR "\n" /* Function to free buffer */ void simplebuffer_free(struct simplebuffer *data) { TRACE_FLOW_ENTRY(); if (data) { free(data->buffer); free(data); } TRACE_FLOW_EXIT(); } /* Allocate buffer structure */ int simplebuffer_alloc(struct simplebuffer **data) { int error = EOK; TRACE_FLOW_ENTRY(); if (!data) { TRACE_ERROR_STRING("Invalid argument", ""); error = EINVAL; } else { *data = (struct simplebuffer *)calloc(1, sizeof(struct simplebuffer)); if (*data == NULL) { TRACE_ERROR_STRING("Failed to allocate memory", ""); error = ENOMEM; } else error = EOK; } TRACE_FLOW_RETURN(error); return error; } /* Grow buffer */ int simplebuffer_grow(struct simplebuffer *data, uint32_t len, uint32_t block) { int error = EOK; unsigned char *newbuf = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_NUMBER("Current length: ", data->length); TRACE_INFO_NUMBER("Current size: ", data->size); TRACE_INFO_NUMBER("Length to have: ", len); TRACE_INFO_NUMBER("Increment length: ", block); /* Grow buffer if needed */ while (data->length + len >= data->size) { newbuf = realloc(data->buffer, data->size + block); if (newbuf == NULL) { TRACE_ERROR_NUMBER("Error. Failed to allocate memory.", ENOMEM); return ENOMEM; } data->buffer = newbuf; data->size += block; TRACE_INFO_NUMBER("New size: ", data->size); } TRACE_INFO_NUMBER("Final size: ", data->size); TRACE_FLOW_RETURN(error); return error; } /* Function to add raw data to the end of the buffer. * Terminating 0 is not counted in length but appended * automatically. */ int simplebuffer_add_raw(struct simplebuffer *data, void *data_in, uint32_t len, uint32_t block) { int error = EOK; uint32_t size; TRACE_FLOW_ENTRY(); size = len + 1; error = simplebuffer_grow(data, size, ((block > size) ? block : size)); if (error) { TRACE_ERROR_NUMBER("Failed to grow buffer.", error); return error; } memcpy(data->buffer + data->length, data_in, len); data->length += len; data->buffer[data->length] = '\0'; TRACE_FLOW_EXIT(); return error; } /* Function to add string to the end of the buffer. */ int simplebuffer_add_str(struct simplebuffer *data, const char *str, uint32_t len, uint32_t block) { int error = EOK; uint32_t size; TRACE_FLOW_ENTRY(); size = len + 1; error = simplebuffer_grow(data, size, ((block > size) ? block : size)); if (error) { TRACE_ERROR_NUMBER("Failed to grow buffer.", error); return error; } memcpy(data->buffer + data->length, str, len); data->length += len; data->buffer[data->length] = '\0'; TRACE_FLOW_EXIT(); return error; } /* Finction to add CR to the buffer */ int simplebuffer_add_cr(struct simplebuffer *data) { int error = EOK; char cr[] = ENDLNSTR; TRACE_FLOW_ENTRY(); error = simplebuffer_add_raw(data, (void *)cr, sizeof(ENDLNSTR) - 1, sizeof(ENDLNSTR)); TRACE_FLOW_RETURN(error); return error; } /* Function to write data synchroniusly */ int simplebuffer_write(int fd, struct simplebuffer *data, uint32_t *left) { size_t res; int error; TRACE_FLOW_ENTRY(); /* Write given number of bytes to the socket */ res = write(fd, data->buffer + (data->length - *left), (size_t)(*left)); if (res == -1) { error = errno; TRACE_ERROR_NUMBER("Write failed.", error); return error; } (*left) -= res; TRACE_FLOW_EXIT(); return EOK; } /* Get buffer */ const unsigned char *simplebuffer_get_buf(struct simplebuffer *data) { return data->buffer; } /* Get void buffer */ void *simplebuffer_get_vbuf(struct simplebuffer *data) { return (void *)data->buffer; } /* Get length */ uint32_t simplebuffer_get_len(struct simplebuffer *data) { return data->length; } ding-libs-0.6.2/basicobjects/simplebuffer.h000066400000000000000000000046301417260640400206650ustar00rootroot00000000000000/* Simple buffer Basic buffer manipulation routines. Taken from ELAPI code. Copyright (C) Dmitri Pal 2009 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 . */ #ifndef ELAPI_SIMPLEBUFFER_H #define ELAPI_SIMPLEBUFFER_H #include #ifndef EOK #define EOK 0 #endif /* Generic data structure for the buffer */ struct simplebuffer { unsigned char *buffer; uint32_t size; uint32_t length; }; /* Function to free data */ void simplebuffer_free(struct simplebuffer *data); /* Allocate data structure */ int simplebuffer_alloc(struct simplebuffer **data); /* Function to add memory to the buffer */ int simplebuffer_grow(struct simplebuffer *data, uint32_t len, uint32_t block); /* Function to add raw data to the end of the buffer. * Terminating 0 is not counted in length but appended * automatically. */ int simplebuffer_add_raw(struct simplebuffer *data, void *data_in, uint32_t len, uint32_t block); /* Function to add string to the buffer. * Same as above just uses string as an argument. */ int simplebuffer_add_str(struct simplebuffer *data, const char *str, uint32_t len, uint32_t block); /* Finction to add CR to the buffer */ int simplebuffer_add_cr(struct simplebuffer *data); /* Function to write data synchroniusly */ int simplebuffer_write(int fd, struct simplebuffer *data, uint32_t *left); /* Get buffer */ const unsigned char *simplebuffer_get_buf(struct simplebuffer *data); /* Get buffer */ void *simplebuffer_get_vbuf(struct simplebuffer *data); /* Get length */ uint32_t simplebuffer_get_len(struct simplebuffer *data); #endif ding-libs-0.6.2/basicobjects/simplebuffer_ut.c000066400000000000000000000073471417260640400214000ustar00rootroot00000000000000/* Simple buffer UNIT test Basic buffer manipulation routines. Copyright (C) Dmitri Pal 2010 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 . */ #include "config.h" #include #include #include #include #include #include #define TRACE_HOME #include "trace.h" #include "simplebuffer.h" int verbose = 0; #define BOOUT(foo) \ do { \ if (verbose) foo; \ } while(0) static int simple_test(void) { int error = EOK; struct simplebuffer *data = NULL; char str1[] = "test string 1"; char str2[] = "test string 2"; const char str3[] = "test string 3"; uint32_t left = 0; int i; const unsigned char *buf; BOOUT(printf("Simple test start.\n")); error = simplebuffer_alloc(&data); if (error) { printf("Failed to allocate object %d\n", error); return error; } error = simplebuffer_add_raw(data, (void *)str1, strlen(str1), 1); if (error) { printf("Failed to add string to an object %d\n", error); simplebuffer_free(data); return error; } error = simplebuffer_add_cr(data); if (error) { printf("Failed to add CR to an object %d\n", error); simplebuffer_free(data); return error; } error = simplebuffer_add_raw(data, (void *)str2, strlen(str2), 1); if (error) { printf("Failed to add string to an object %d\n", error); simplebuffer_free(data); return error; } error = simplebuffer_add_cr(data); if (error) { printf("Failed to add CR to an object %d\n", error); simplebuffer_free(data); return error; } error = simplebuffer_add_str(data, str3, strlen(str3), 1); if (error) { printf("Failed to add string to an object %d\n", error); simplebuffer_free(data); return error; } left = simplebuffer_get_len(data); buf = simplebuffer_get_buf(data); BOOUT(for(i = 0; i < left; i++) { printf("%02d: %02X\n", i, buf[i]); }); if (verbose) { while (left > 0) { error = simplebuffer_write(1, data, &left); if (error) { printf("Failed to write to output %d\n", error); simplebuffer_free(data); return error; } } } BOOUT(printf("\n[%s]\n", simplebuffer_get_buf(data))); BOOUT(printf("Length: %d\n", simplebuffer_get_len(data))); simplebuffer_free(data); BOOUT(printf("Simple test end.\n")); return error; } int main(int argc, char *argv[]) { int error = EOK; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; BOOUT(printf("Start\n")); if ((error = simple_test())) { printf("Test failed! Error %d.\n", error); return -1; } BOOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/collection/000077500000000000000000000000001417260640400155265ustar00rootroot00000000000000ding-libs-0.6.2/collection/collection.c000066400000000000000000003542511417260640400200370ustar00rootroot00000000000000/* COLLECTION LIBRARY Implementation of the collection library interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #include #include #include "trace.h" /* The collection should use the real structures */ #include "collection_priv.h" #include "collection.h" #define INTERRUPT(d) ((d == COL_DSP_LASTDUPNS) || (d == COL_DSP_NDUPNS)) ? 0 : 1 /* Internal constants defined to denote actions that can be performed by find handler */ #define COLLECTION_ACTION_FIND 1 #define COLLECTION_ACTION_DEL 2 #define COLLECTION_ACTION_UPDATE 3 #define COLLECTION_ACTION_GET 4 /* Special internal error code to indicate that collection search was interrupted */ #define EINTR_INTERNAL 10000 /* Magic numbers for hashing */ #if SIZEOF_LONG == 8 #define FNV1a_prime 1099511628211ul #define FNV1a_base 14695981039346656037ul #elif SIZEOF_LONG_LONG == 8 #define FNV1a_prime 1099511628211ull #define FNV1a_base 14695981039346656037ull #else #error "Platform cannot support 64-bit constant integers" #endif /* Struct used for passing parameter for update operation */ struct update_property { int type; void *data; int length; int found; }; /* This struct is used to construct path * to an item in the collection (tree) */ struct path_data { char *name; int length; struct path_data *previous_path; }; /* Structure to keep data needed to * copy collection * while traversing it */ struct col_copy { int mode; struct path_data *current_path; char *given_name; int given_len; col_copy_cb copy_cb; void *ext_data; }; /******************** FUNCTION DECLARATIONS ****************************/ /* Have to declare those due to function cross referencing */ static int col_find_item_and_do(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, col_item_fn item_handler, void *custom_data, int action); /* Traverse callback for find & delete function */ static int col_act_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *passed_traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop); /* Traverse handler to find parent of the item */ static int col_parent_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop); /* Traverse callback signature */ typedef int (*internal_item_fn)(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop); /* Function to walk_items */ static int col_walk_items(struct collection_item *ci, int mode_flags, internal_item_fn traverse_handler, void *traverse_data, col_item_fn user_item_handler, void *custom_data, unsigned *depth); /* Function to get sub collection */ static int col_get_subcollection(const char *property, int property_len, int type, void *data, int length, void *found, int *dummy); /* Function to destroy collection */ void col_destroy_collection(struct collection_item *ci); /******************** SUPPLEMENTARY FUNCTIONS ****************************/ /* BASIC OPERATIONS */ /* Function that checks if property can be added */ static int col_validate_property(const char *property) { TRACE_FLOW_STRING("col_validate_property", "Entry point."); /* Only alpha numeric characters are allowed in names of the properties */ int invalid = 0; const char *check; check = property; while (*check != '\0') { /* It turned out that limiting collection charcters is bad */ if ((*check < ' ') || (*check == '!')) { invalid = 1; break; } check++; } TRACE_FLOW_NUMBER("col_validate_property. Returning ", invalid); return invalid; } /* Function that cleans the item with callback */ void col_delete_item_with_cb(struct collection_item *item, col_item_cleanup_fn cb, void *custom_data) { struct collection_item *other_collection; TRACE_FLOW_STRING("col_delete_item","Entry point."); if (item == NULL) { TRACE_FLOW_STRING("col_delete_item","Nothing to delete!"); return; } /* Handle external or embedded collection */ if(item->type == COL_TYPE_COLLECTIONREF) { /* Our data is a pointer to a whole external collection so dereference * it or delete */ other_collection = *((struct collection_item **)(item->data)); col_destroy_collection_with_cb(other_collection, cb, custom_data); } /* Call the callback */ if (cb) cb(item->property, item->property_len, item->type, item->data, item->length, custom_data); TRACE_INFO_STRING("Deleting property:", item->property); TRACE_INFO_NUMBER("Type:", item->type); if (item->property != NULL) free(item->property); if (item->data != NULL) free(item->data); free(item); TRACE_FLOW_STRING("col_delete_item","Exit."); } /* Function that cleans the item */ void col_delete_item(struct collection_item *item) { TRACE_FLOW_STRING("col_delete_item","Entry point."); col_delete_item_with_cb(item, NULL, NULL); TRACE_FLOW_STRING("col_delete_item","Exit."); } /* A generic function to allocate a property item */ int col_allocate_item(struct collection_item **ci, const char *property, const void *item_data, int length, int type) { struct collection_item *item = NULL; TRACE_FLOW_STRING("col_allocate_item", "Entry point."); TRACE_INFO_NUMBER("Will be using type:", type); /* Check the length */ if (length >= COL_MAX_DATA) { TRACE_ERROR_STRING("col_allocate_item", "Data to long."); return EMSGSIZE; } if (col_validate_property(property)) { TRACE_ERROR_STRING("Invalid chracters in the property name", property); return EINVAL; } /* Allocate memory for the structure */ item = (struct collection_item *)malloc(sizeof(struct collection_item)); if (item == NULL) { TRACE_ERROR_STRING("col_allocate_item", "Malloc failed."); return ENOMEM; } /* After we initialize members we can use delete_item() in case of error */ item->next = NULL; item->property = NULL; item->data = NULL; TRACE_INFO_NUMBER("About to set type to:", type); item->type = type; /* Copy property */ item->property = strdup(property); if (item->property == NULL) { TRACE_ERROR_STRING("col_allocate_item", "Failed to dup property."); col_delete_item(item); return ENOMEM; } item->phash = col_make_hash(property, 0, &(item->property_len)); TRACE_INFO_NUMBER("Item hash", item->phash); TRACE_INFO_NUMBER("Item property length", item->property_len); TRACE_INFO_NUMBER("Item property strlen", strlen(item->property)); /* Deal with data */ item->data = malloc(length); if (item->data == NULL) { TRACE_ERROR_STRING("col_allocate_item", "Failed to dup data."); col_delete_item(item); return ENOMEM; } memcpy(item->data, item_data, length); item->length = length; /* Make sure that data is NULL terminated in case of string */ if (type == COL_TYPE_STRING) ((char *)(item->data))[length-1] = '\0'; *ci = item; TRACE_INFO_STRING("Item property", item->property); TRACE_INFO_NUMBER("Item property type", item->type); TRACE_INFO_NUMBER("Item data length", item->length); TRACE_FLOW_STRING("col_allocate_item", "Success exit."); return EOK; } /* Structure used to find things in collection */ struct property_search { const char *property; uint64_t hash; struct collection_item *parent; int index; int count; int found; int use_type; int type; int interrupt; int exact; }; /* Find the parent of the item with given name */ static int col_find_property_sub(struct collection_item *collection, const char *subcollection, int interrupt, const char *refprop, int idx, int exact, int use_type, int type, struct collection_item **parent) { struct property_search ps; int i = 0; unsigned depth = 0; struct collection_item *sub = NULL; int error = EOK; TRACE_FLOW_ENTRY(); *parent = NULL; ps.property = refprop; ps.hash = FNV1a_base; ps.parent = NULL; ps.index = idx; ps.count = 0; ps.found = 0; ps.use_type = use_type; ps.type = type; ps.interrupt = interrupt; ps.exact = exact; /* Create hash of the string to search */ while(refprop[i] != 0) { ps.hash = ps.hash ^ toupper(refprop[i]); ps.hash *= FNV1a_prime; i++; } /* Add item to collection */ if (subcollection == NULL) { sub = collection; } else { TRACE_INFO_STRING("Subcollection is not null, searching", subcollection); error = col_find_item_and_do(collection, subcollection, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, col_get_subcollection, (void *)(&sub), COLLECTION_ACTION_FIND); if (error) { TRACE_ERROR_NUMBER("Search for subcollection returned error:", error); /* Not found */ return 0; } if (sub == NULL) { TRACE_ERROR_STRING("Search for subcollection returned NULL", ""); /* Not found */ return 0; } } /* We do not care about error here */ (void)col_walk_items(sub, COL_TRAVERSE_ONELEVEL, col_parent_traverse_handler, (void *)parent, NULL, (void *)&ps, &depth); if (*parent) { /* Item is found in the collection */ TRACE_FLOW_STRING("col_find_property", "Exit - item found"); return 1; } /* Item is not found */ TRACE_FLOW_STRING("col_find_property", "Exit - item NOT found"); return 0; } /* Backward compatible wrapper */ static int col_find_property(struct collection_item *collection, const char *refprop, int idx, int use_type, int type, struct collection_item **parent) { int error = EOK; TRACE_FLOW_ENTRY(); error = col_find_property_sub(collection, NULL, 1, refprop, idx, 0, use_type, type, parent); TRACE_FLOW_RETURN(error); return error; } /* Find a duplicate item */ int col_get_dup_item(struct collection_item *ci, const char *subcollection, const char *property_to_find, int type, int idx, int exact, struct collection_item **item) { int error = EOK; struct collection_item *parent = NULL; TRACE_FLOW_ENTRY(); if (!ci) { TRACE_ERROR_STRING("Passed in collection is invalid", ""); return EINVAL; } if (!item) { TRACE_ERROR_STRING("Result storage is invalid", ""); return EINVAL; } if (!property_to_find) { TRACE_ERROR_STRING("Passed in property to find is NULL", ""); return EINVAL; } /* Find the corresponding duplicate item */ if (col_find_property_sub(ci, subcollection, 0, property_to_find, idx, exact, (type == COL_TYPE_ANY) ? 0 : 1, type, &parent)) { *item = parent->next; /* function col_get_dup_item with big value of idx should * return the last item with the same property name. */ if (strncmp(property_to_find, parent->next->property, parent->next->property_len) != 0) { *item = parent; } } else error = ENOENT; TRACE_FLOW_EXIT(); return error; } /* Insert item into the current collection */ int col_insert_item_into_current(struct collection_item *collection, struct collection_item *item, int disposition, const char *refprop, int idx, unsigned flags) { struct collection_header *header = NULL; struct collection_item *parent = NULL; struct collection_item *current = NULL; int refindex = 0; TRACE_FLOW_STRING("col_insert_item_into_current", "Entry point"); /* Do best effort on the item */ if ((!item) || (item->next)) { TRACE_ERROR_STRING("Passed in item is invalid", ""); return EINVAL; } if (collection == NULL) { TRACE_INFO_STRING("col_insert_item_into_current", "Collection accepting is NULL"); if (item->type == COL_TYPE_COLLECTION) { /* This is a special case of self creation */ TRACE_INFO_STRING("col_insert_item_into_current", "Adding header item to new collection."); collection = item; } else { TRACE_ERROR_STRING("Passed in item is invalid", ""); return EINVAL; } } else { /* We can add items only to collections */ if (collection->type != COL_TYPE_COLLECTION) { TRACE_ERROR_STRING("Attempt to add item to non collection.",""); TRACE_ERROR_STRING("Collection name:", collection->property); TRACE_ERROR_NUMBER("Collection type:", collection->type); return EINVAL; } } /* After processing flags we can process disposition */ header = (struct collection_header *)collection->data; /* Check flags first */ switch(flags) { case COL_INSERT_NOCHECK: /* No check - good just fall through */ TRACE_INFO_STRING("Insert without check", ""); break; case COL_INSERT_DUPOVER: /* Find item and overwrite - ignore disposition */ if (col_find_property(collection, item->property, 0, 0, 0, &parent)) { current = parent->next; item->next = current->next; parent->next = item; if (header->last == current) header->last = item; col_delete_item(current); /* Deleted one added another - count stays the same! */ TRACE_FLOW_STRING("col_insert_item_into_current", "Dup overwrite exit"); return EOK; } /* Not found so we fall thorough and add as requested */ break; case COL_INSERT_DUPOVERT: /* Find item by name and type and overwrite - ignore disposition */ if (col_find_property(collection, item->property, 0, 1, item->type, &parent)) { current = parent->next; item->next = current->next; parent->next = item; if (header->last == current) header->last = item; col_delete_item(current); /* Deleted one added another - count stays the same! */ TRACE_FLOW_STRING("col_insert_item_into_current", "Dup overwrite exit"); return EOK; } /* Not found so we fall thorough and add as requested */ break; case COL_INSERT_DUPERROR: if (col_find_property(collection, item->property, 0, 0, 0, &parent)) { /* Return error */ TRACE_ERROR_NUMBER("Duplicate property", EEXIST); return EEXIST; } break; case COL_INSERT_DUPERRORT: if (col_find_property(collection, item->property, 0, 1, item->type, &parent)) { /* Return error */ TRACE_ERROR_NUMBER("Duplicate property of the same type", EEXIST); return EEXIST; } break; case COL_INSERT_DUPMOVE: /* Find item and delete */ if (col_find_property(collection, item->property, 0, 0, 0, &parent)) { current = parent->next; parent->next = current->next; if (header->last == current) header->last = parent; col_delete_item(current); header->count--; } /* Now add item according to the disposition */ break; case COL_INSERT_DUPMOVET: /* Find item and delete */ TRACE_INFO_STRING("Property:", item->property); TRACE_INFO_NUMBER("Type:", item->type); if (col_find_property(collection, item->property, 0, 1, item->type, &parent)) { TRACE_INFO_LNUMBER("Current:", parent->next); current = parent->next; parent->next = current->next; if (header->last == current) header->last = parent; col_delete_item(current); header->count--; } /* Now add item according to the disposition */ break; default: /* The new ones should be added here */ TRACE_ERROR_NUMBER("Flag is not implemented", ENOSYS); return ENOSYS; } switch (disposition) { case COL_DSP_END: /* Link new item to the last item in the list if there any */ if (header->count != 0) header->last->next = item; /* Make sure we save a new last element */ header->last = item; header->count++; break; case COL_DSP_FRONT: /* Same as above if there is header only */ if (header->count == 1) { header->last->next = item; header->last = item; } else { item->next = collection->next; collection->next = item; } header->count++; break; case COL_DSP_BEFORE: /* Check argument */ if (!refprop) { TRACE_ERROR_STRING("In this case property is required", ""); return EINVAL; } /* We need to find property */ if (col_find_property(collection, refprop, 0, 0, 0, &parent)) { item->next = parent->next; parent->next = item; header->count++; } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; case COL_DSP_AFTER: /* Check argument */ if (!refprop) { TRACE_ERROR_STRING("In this case property is required", ""); return EINVAL; } /* We need to find property */ if (col_find_property(collection, refprop, 0, 0, 0, &parent)) { parent = parent->next; if (parent->next) { /* It is not the last item */ item->next = parent->next; parent->next = item; } else { /* It is the last item */ header->last->next = item; header->last = item; } header->count++; } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; case COL_DSP_INDEX: if(idx == 0) { /* Same is first */ if (header->count == 1) { header->last->next = item; header->last = item; } else { item->next = collection->next; collection->next = item; } } else if(idx >= header->count - 1) { /* In this case add to the end */ header->last->next = item; /* Make sure we save a new last element */ header->last = item; } else { /* In the middle */ parent = collection; /* Move to the right position counting */ while (idx > 0) { idx--; if (parent->next) parent = parent->next; } item->next = parent->next; parent->next = item; } header->count++; break; case COL_DSP_FIRSTDUP: case COL_DSP_LASTDUP: case COL_DSP_NDUP: case COL_DSP_LASTDUPNS: case COL_DSP_NDUPNS: if (disposition == COL_DSP_FIRSTDUP) refindex = 0; else if ((disposition == COL_DSP_LASTDUP) || (disposition == COL_DSP_LASTDUPNS)) refindex = -1; else refindex = idx; /* We need to find property based on index */ if (col_find_property_sub(collection, NULL, INTERRUPT(disposition), item->property, refindex, 0, 0, 0, &parent)) { item->next = parent->next; parent->next = item; header->count++; if(header->last == parent) header->last = item; } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; default: TRACE_ERROR_STRING("Disposition is not implemented", ""); return ENOSYS; } TRACE_INFO_STRING("Collection:", collection->property); TRACE_INFO_STRING("Just added item is:", item->property); TRACE_INFO_NUMBER("Item type.", item->type); TRACE_INFO_NUMBER("Number of items in collection now is.", header->count); TRACE_FLOW_STRING("col_insert_item_into_current", "Exit"); return EOK; } /* Extract item from the current collection */ int col_extract_item_from_current(struct collection_item *collection, int disposition, const char *refprop, int idx, int type, struct collection_item **ret_ref) { struct collection_header *header = NULL; struct collection_item *parent = NULL; struct collection_item *current = NULL; struct collection_item *found = NULL; int refindex = 0; int use_type = 0; TRACE_FLOW_STRING("col_extract_item_from_current", "Entry point"); /* Check that collection is not empty */ if ((collection == NULL) || (collection->type != COL_TYPE_COLLECTION)) { TRACE_ERROR_STRING("Collection can't be NULL", ""); return EINVAL; } header = (struct collection_header *)collection->data; /* Before moving forward we need to check if there is anything to extract */ if (header->count <= 1) { TRACE_ERROR_STRING("Collection is empty.", "Nothing to extract."); return ENOENT; } if (type != 0) use_type = 1; switch (disposition) { case COL_DSP_END: /* Extract last item in the list. */ parent = collection; current = collection->next; while (current->next != NULL) { parent = current; current = current->next; } *ret_ref = parent->next; parent->next = NULL; /* Special case - one data element */ if (header->count == 2) header->last = collection; else header->last = parent; break; case COL_DSP_FRONT: /* Extract first item in the list */ *ret_ref = collection->next; collection->next = (*ret_ref)->next; /* Special case - one data element */ if (header->count == 2) header->last = collection; break; case COL_DSP_BEFORE: /* Check argument */ if (!refprop) { TRACE_ERROR_STRING("In this case property is required", ""); return EINVAL; } /* We have to do it in two steps */ /* First find the property that is mentioned */ if (col_find_property(collection, refprop, 0, use_type, type, &found)) { /* We found the requested property */ if (found->next == collection->next) { /* The referenced property is the first in the list */ TRACE_ERROR_STRING("Nothing to extract. Lists starts with property", refprop); return ENOENT; } /* Get to the parent of the item that is before the one that is found */ parent = collection; current = collection->next; while (current != found) { parent = current; current = current->next; } *ret_ref = current; parent->next = current->next; } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; case COL_DSP_AFTER: /* Check argument */ if (!refprop) { TRACE_ERROR_STRING("In this case property is required", ""); return EINVAL; } /* We need to find property */ if (col_find_property(collection, refprop, 0, use_type, type, &parent)) { current = parent->next; if (current->next) { *ret_ref = current->next; current->next = (*ret_ref)->next; /* If we removed the last element adjust header */ if(current->next == NULL) header->last = current; } else { TRACE_ERROR_STRING("Property is last in the list", refprop); return ENOENT; } } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; case COL_DSP_INDEX: if (idx == 0) { *ret_ref = collection->next; collection->next = (*ret_ref)->next; /* Special case - one data element */ if (header->count == 2) header->last = collection; } /* Index 0 stands for the first data element. * Count includes header element. */ else if (idx >= (header->count - 1)) { TRACE_ERROR_STRING("Index is out of boundaries", refprop); return ENOENT; } else { /* Loop till the element with right index */ refindex = 0; parent = collection; current = collection->next; while (refindex < idx) { parent = current; current = current->next; refindex++; } *ret_ref = parent->next; parent->next = (*ret_ref)->next; /* If we removed the last element adjust header */ if (parent->next == NULL) header->last = parent; } break; case COL_DSP_FIRSTDUP: case COL_DSP_LASTDUP: case COL_DSP_NDUP: case COL_DSP_LASTDUPNS: case COL_DSP_NDUPNS: if (disposition == COL_DSP_FIRSTDUP) refindex = 0; else if ((disposition == COL_DSP_LASTDUP) || (disposition == COL_DSP_LASTDUPNS)) refindex = -2; else refindex = idx; /* We need to find property based on index */ if (col_find_property_sub(collection, NULL, INTERRUPT(disposition), refprop, refindex, 1, use_type, type, &parent)) { *ret_ref = parent->next; parent->next = (*ret_ref)->next; /* If we removed the last element adjust header */ if(parent->next == NULL) header->last = parent; } else { TRACE_ERROR_STRING("Property not found", refprop); return ENOENT; } break; default: TRACE_ERROR_STRING("Disposition is not implemented", ""); return ENOSYS; } /* Clear item and reduce count */ (*ret_ref)->next = NULL; header->count--; TRACE_INFO_STRING("Collection:", (*ret_ref)->property); TRACE_INFO_NUMBER("Item type.", (*ret_ref)->type); TRACE_INFO_NUMBER("Number of items in collection now is.", header->count); TRACE_FLOW_STRING("col_extract_item_from_current", "Exit"); return EOK; } /* Extract item from the collection */ int col_extract_item(struct collection_item *collection, const char *subcollection, int disposition, const char *refprop, int idx, int type, struct collection_item **ret_ref) { struct collection_item *col = NULL; int error = EOK; TRACE_FLOW_STRING("col_extract_item", "Entry point"); /* Check that collection is not empty */ if ((collection == NULL) || (collection->type != COL_TYPE_COLLECTION)) { TRACE_ERROR_STRING("Collection can't be NULL", ""); return EINVAL; } /* Get subcollection if needed */ if (subcollection == NULL) { col = collection; } else { TRACE_INFO_STRING("Subcollection id not null, searching", subcollection); error = col_find_item_and_do(collection, subcollection, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, col_get_subcollection, (void *)(&col), COLLECTION_ACTION_FIND); if (error) { TRACE_ERROR_NUMBER("Search for subcollection returned error:", error); return error; } if (col == NULL) { TRACE_ERROR_STRING("Search for subcollection returned NULL pointer", ""); return ENOENT; } } /* Extract from the current collection */ error = col_extract_item_from_current(col, disposition, refprop, idx, type, ret_ref); if (error) { TRACE_ERROR_NUMBER("Failed to extract item from the current collection", error); return error; } TRACE_FLOW_STRING("col_extract_item", "Exit"); return EOK; } /* Remove item (property) from collection with callback.*/ int col_remove_item_with_cb(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, int type, col_item_cleanup_fn cb, void *custom_data) { int error = EOK; struct collection_item *ret_ref = NULL; TRACE_FLOW_STRING("col_remove_item", "Enter"); /* Extract from the current collection */ error = col_extract_item(ci, subcollection, disposition, refprop, idx, type, &ret_ref); if (error) { TRACE_ERROR_NUMBER("Failed to extract item from the collection", error); return error; } col_delete_item_with_cb(ret_ref, cb, custom_data); TRACE_FLOW_STRING("col_remove_item", "Exit"); return EOK; } /* Remove item (property) from collection.*/ int col_remove_item(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, int type) { return col_remove_item_with_cb(ci, subcollection, disposition, refprop, idx, type, NULL, NULL); } /* Remove item (property) from current collection. * Just a simple wrapper. */ int col_remove_item_from_current(struct collection_item *ci, int disposition, const char *refprop, int idx, int type) { int error = EOK; TRACE_FLOW_STRING("col_remove_item_from_current", "Exit"); /* Remove item from current collection */ error = col_remove_item(ci, NULL, disposition, refprop, idx, type); TRACE_FLOW_NUMBER("col_remove_item_from_current. Exit. Returning", error); return error; } /* Insert the item into the collection or subcollection */ int col_insert_item(struct collection_item *collection, const char *subcollection, struct collection_item *item, int disposition, const char *refprop, int idx, unsigned flags) { int error; struct collection_item *acceptor = NULL; TRACE_FLOW_STRING("col_insert_item", "Entry point."); /* Do best effort on the item */ if ((!item) || (item->next)) { TRACE_ERROR_STRING("Passed in item is invalid", ""); return EINVAL; } /* Check that collection is not empty */ if ((collection == NULL) && (item->type != COL_TYPE_COLLECTION)) { TRACE_ERROR_STRING("Collection can't be NULL", ""); return EINVAL; } /* Add item to collection */ if (subcollection == NULL) { acceptor = collection; } else { TRACE_INFO_STRING("Subcollection id not null, searching", subcollection); error = col_find_item_and_do(collection, subcollection, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, col_get_subcollection, (void *)(&acceptor), COLLECTION_ACTION_FIND); if (error) { TRACE_ERROR_NUMBER("Search for subcollection returned error:", error); return error; } if (acceptor == NULL) { TRACE_ERROR_STRING("Search for subcollection returned NULL pointer", ""); return ENOENT; } } /* Instert item to the current collection */ error = col_insert_item_into_current(acceptor, item, disposition, refprop, idx, flags); if (error) { TRACE_ERROR_NUMBER("Failed to insert item into current collection", error); return error; } TRACE_FLOW_STRING("insert_item", "Exit"); return EOK; } /* Insert property with reference. * This is internal function so we do not check parameters. * See external wrapper below. */ static int col_insert_property_with_ref_int(struct collection_item *collection, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int type, const void *data, int length, struct collection_item **ret_ref) { struct collection_item *item = NULL; int error; TRACE_FLOW_STRING("col_insert_property_with_ref_int", "Entry point."); /* Create a new property out of the given parameters */ error = col_allocate_item(&item, property, data, length, type); if (error) { TRACE_ERROR_NUMBER("Failed to allocate item", error); return error; } /* Send the property to the insert_item function */ error = col_insert_item(collection, subcollection, item, disposition, refprop, idx, flags); if (error) { TRACE_ERROR_NUMBER("Failed to insert item", error); col_delete_item(item); return error; } if (ret_ref) *ret_ref = item; TRACE_FLOW_STRING("col_insert_property_with_ref_int", "Exit"); return EOK; } /* Special function used to copy item from one * collection to another using caller's callback. */ static int col_copy_item_with_cb(struct collection_item *collection, const char *property, int type, const void *data, int length, col_copy_cb copy_cb, void *ext_data) { struct collection_item *item = NULL; int skip = 0; int error = EOK; TRACE_FLOW_STRING("col_copy_item_with_cb", "Entry point."); /* Create a new property out of the given parameters */ error = col_allocate_item(&item, property, data, length, type); if (error) { TRACE_ERROR_NUMBER("Failed to allocate item", error); return error; } /* Call callback if any */ if (copy_cb) { TRACE_INFO_STRING("Calling callback for item:", item->property); error = copy_cb(item, ext_data, &skip); if (error) { TRACE_ERROR_NUMBER("Callback failed", error); col_delete_item(item); return error; } } /* Are we told to skip this item? */ if (skip) col_delete_item(item); else { /* Insted property into the collection */ error = col_insert_item(collection, NULL, item, COL_DSP_END, NULL, 0, 0); if (error) { TRACE_ERROR_NUMBER("Failed to insert item", error); col_delete_item(item); return error; } } TRACE_FLOW_STRING("col_copy_item_with_cb", "Exit"); return EOK; } /* This is public function so we need to check the validity * of the arguments. */ int col_insert_property_with_ref(struct collection_item *collection, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int type, const void *data, int length, struct collection_item **ret_ref) { int error; TRACE_FLOW_STRING("col_insert_property_with_ref", "Entry point."); /* Check that collection is not empty */ if (collection == NULL) { TRACE_ERROR_STRING("Collection cant be NULL", ""); return EINVAL; } error = col_insert_property_with_ref_int(collection, subcollection, disposition, refprop, idx, flags, property, type, data, length, ret_ref); TRACE_FLOW_NUMBER("col_insert_property_with_ref_int Returning:", error); return error; } /* TRAVERSE HANDLERS */ /* Special handler to just set a flag if the item is found */ static int col_is_in_item_handler(const char *property, int property_len, int type, void *data, int length, void *found, int *dummy) { TRACE_FLOW_STRING("col_is_in_item_handler", "Entry."); TRACE_INFO_STRING("Property:", property); TRACE_INFO_NUMBER("Property length:", property_len); TRACE_INFO_NUMBER("Type:", type); TRACE_INFO_NUMBER("Length:", length); *((int *)(found)) = COL_MATCH; TRACE_FLOW_STRING("col_is_in_item_handler", "Success Exit."); return EOK; } /* Special handler to retrieve the sub collection */ static int col_get_subcollection(const char *property, int property_len, int type, void *data, int length, void *found, int *dummy) { TRACE_FLOW_STRING("col_get_subcollection", "Entry."); TRACE_INFO_STRING("Property:", property); TRACE_INFO_NUMBER("Property length:", property_len); TRACE_INFO_NUMBER("Type:", type); TRACE_INFO_NUMBER("Length:", length); *((struct collection_item **)(found)) = *((struct collection_item **)(data)); TRACE_FLOW_STRING("col_get_subcollection","Success Exit."); return EOK; } /* CLEANUP */ /* Cleans the collection tree including current item. */ /* The passed in variable should not be used after the call * as memory is freed!!! */ static void col_delete_collection(struct collection_item *ci, col_item_cleanup_fn cb, void *custom_data) { TRACE_FLOW_STRING("col_delete_collection", "Entry."); if (ci == NULL) { TRACE_FLOW_STRING("col_delete_collection", "Nothing to do Exit."); return; } TRACE_INFO_STRING("Real work to do", ""); TRACE_INFO_STRING("Property", ci->property); TRACE_INFO_NUMBER("Next item", ci->next); col_delete_collection(ci->next, cb, custom_data); /* Delete this item */ col_delete_item_with_cb(ci, cb, custom_data); TRACE_FLOW_STRING("col_delete_collection", "Exit."); } /* NAME MANAGEMENT - used by search */ /* Internal data structures used for search */ struct find_name { const char *name_to_find; int name_len_to_find; uint64_t hash; int type_to_match; char *given_name; int given_len; struct path_data *current_path; int action; }; /* Create a new name */ static int col_create_path_data(struct path_data **name_path, const char *name, int length, const char *property, int property_len, char sep) { int error = EOK; struct path_data *new_name_path; TRACE_FLOW_STRING("col_create_path_data", "Entry."); TRACE_INFO_STRING("Constructing path from name:", name); TRACE_INFO_STRING("Constructing path from property:", property); /* Allocate structure */ new_name_path = (struct path_data *)malloc(sizeof(struct path_data)); if (new_name_path == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory for new path struct.", ENOMEM); return ENOMEM; } new_name_path->name = malloc(length + property_len + 2); if (new_name_path->name == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory for new path name.", ENOMEM); free(new_name_path); return ENOMEM; } /* Construct the new name */ new_name_path->length = 0; if(length > 0) { memcpy(new_name_path->name, name, length); new_name_path->length = length; new_name_path->name[new_name_path->length] = sep; new_name_path->length++; new_name_path->name[new_name_path->length] = '\0'; TRACE_INFO_STRING("Name so far:", new_name_path->name); TRACE_INFO_NUMBER("Len so far:", new_name_path->length); } memcpy(&new_name_path->name[new_name_path->length], property, property_len); new_name_path->length += property_len; new_name_path->name[new_name_path->length] = '\0'; /* Link to the chain */ new_name_path->previous_path = *name_path; *name_path = new_name_path; TRACE_INFO_STRING("Constructed path", new_name_path->name); TRACE_FLOW_NUMBER("col_create_path_data. Returning:", error); return error; } /* Matching item name and type */ static int col_match_item(struct collection_item *current, struct find_name *traverse_data) { const char *find_str; const char *start; const char *data_str; TRACE_FLOW_STRING("col_match_item", "Entry"); if (traverse_data->type_to_match & current->type) { /* Check if there is any value to match */ if ((traverse_data->name_to_find == NULL) || (*(traverse_data->name_to_find) == '\0')) { TRACE_INFO_STRING("col_match_item", "Returning MATCH because there is no search criteria!"); return COL_MATCH; } /* Check the hashes - if they do not match return */ if (traverse_data->hash != current->phash) { TRACE_INFO_STRING("col_match_item","Returning NO match!"); return COL_NOMATCH; } /* We will do the actual string comparison only if the hashes matched */ /* Start comparing the two strings from the end */ find_str = traverse_data->name_to_find + traverse_data->name_len_to_find; start = current->property; data_str = start + current->property_len; TRACE_INFO_STRING("Searching for:", traverse_data->name_to_find); TRACE_INFO_STRING("Item name:", current->property); TRACE_INFO_STRING("Current path:", traverse_data->current_path->name); TRACE_INFO_NUMBER("Searching:", toupper(*find_str)); TRACE_INFO_NUMBER("Have:", toupper(*data_str)); /* We start pointing to 0 so the loop will be executed at least once */ while (toupper(*data_str) == toupper(*find_str)) { TRACE_INFO_STRING("Loop iteration:",""); if (data_str == start) { if (find_str > traverse_data->name_to_find) { if (*(find_str-1) == '!') { /* We matched the property but the search string is * longer so we need to continue matching */ TRACE_INFO_STRING("col_match_item", "Need to continue matching"); start = traverse_data->current_path->name; data_str = &start[traverse_data->current_path->length - 1]; find_str -= 2; continue; } else { TRACE_INFO_STRING("col_match_item","Returning NO match!"); return COL_NOMATCH; } } else { TRACE_INFO_STRING("col_match_item","Returning MATCH!"); return COL_MATCH; } } else if ((find_str == traverse_data->name_to_find) && (*(data_str-1) == '!')) return COL_MATCH; data_str--; find_str--; TRACE_INFO_NUMBER("Searching:", toupper(*find_str)); TRACE_INFO_NUMBER("Have:", toupper(*data_str)); } } TRACE_FLOW_STRING("col_match_item","Returning NO match!"); return COL_NOMATCH; } /* Function to delete the data that contains search path */ static void col_delete_path_data(struct path_data *path) { TRACE_FLOW_STRING("col_delete_path_data","Entry."); if (path != NULL) { TRACE_INFO_STRING("col_delete_path_data", "Item to delete exits."); if (path->previous_path != NULL) { TRACE_INFO_STRING("col_delete_path_data", "But previous item to delete exits to. Nesting."); col_delete_path_data(path->previous_path); } if (path->name != NULL) { TRACE_INFO_STRING("col_delete_path_data Deleting path:", path->name); free(path->name); } TRACE_INFO_STRING("col_delete_path_data", "Deleting path element"); free(path); } TRACE_FLOW_STRING("col_delete_path_data", "Exit"); } /* MAIN TRAVERSAL FUNCTION */ /* Internal function to walk collection */ /* For each item walked it will call traverse handler. Traverse handler accepts: current item, user provided item handler and user provided custom data. */ /* See below different traverse handlers for different cases */ static int col_walk_items(struct collection_item *ci, int mode_flags, internal_item_fn traverse_handler, void *traverse_data, col_item_fn user_item_handler, void *custom_data, unsigned *depth) { struct collection_item *current; struct collection_item *parent = NULL; struct collection_item *sub; int stop = 0; int error = EOK; TRACE_FLOW_STRING("col_walk_items", "Entry."); TRACE_INFO_NUMBER("Mode flags:", mode_flags); /* Increase depth */ /* NOTE: The depth is increased at the entry to the function. * and decreased right before the exit so it is safe to decrease it. */ (*depth)++; current = ci; while (current) { TRACE_INFO_STRING("Processing item:", current->property); TRACE_INFO_NUMBER("Item type:", current->type); if (current->type == COL_TYPE_COLLECTIONREF) { TRACE_INFO_STRING("Subcollection:", current->property); if ((mode_flags & COL_TRAVERSE_IGNORE) == 0) { TRACE_INFO_STRING("Subcollection is not ignored.", ""); /* We are not ignoring sub collections */ if ((mode_flags & COL_TRAVERSE_FLAT) == 0) { TRACE_INFO_STRING("Subcollection is not flattened.", ""); /* We are not flattening sub collections. * The flattening means that we are not going * to return reference and headers for sub collections. * We will also not do special end collection * invocation for sub collections. */ error = traverse_handler(ci, parent, current, traverse_data, user_item_handler, custom_data, &stop); if (stop != 0) { TRACE_INFO_STRING("Traverse handler returned STOP.", ""); error = EINTR_INTERNAL; } /* Check what error we got */ if (error == EINTR_INTERNAL) { TRACE_FLOW_NUMBER("Internal error - means we are stopping.", error); (*depth)--; return error; } else if (error) { TRACE_ERROR_NUMBER("Traverse handler returned error.", error); (*depth)--; return error; } } if ((mode_flags & COL_TRAVERSE_ONELEVEL) == 0) { TRACE_INFO_STRING("Before diving into sub collection",""); sub = *((struct collection_item **)(current->data)); TRACE_INFO_STRING("Sub collection name", sub->property); TRACE_INFO_NUMBER("Header type", sub->type); /* We need to go into sub collections */ error = col_walk_items(sub, mode_flags, traverse_handler, traverse_data, user_item_handler, custom_data, depth); TRACE_INFO_STRING("Returned from sub collection processing", ""); TRACE_INFO_STRING("Done processing item:", current->property); TRACE_INFO_NUMBER("Done processing item type:", current->type); } } } else { /* Check if it is a header and we are not on the root level. * If we are flattening collection we need to skip headers * for sub collections. */ /* Call handler if: * a) It is not collection header * OR * b) It is header we are flattening but we are on top level * OR * c) It is header and we are not flattening. */ if ((current->type != COL_TYPE_COLLECTION) || (((mode_flags & COL_TRAVERSE_FLAT) != 0) && (*depth == 1)) || ((mode_flags & COL_TRAVERSE_FLAT) == 0)) { /* Call handler then move on */ error = traverse_handler(ci, parent, current, traverse_data, user_item_handler, custom_data, &stop); } } /* If we are stopped - return EINTR_INTERNAL */ if (stop != 0) { TRACE_INFO_STRING("Traverse handler returned STOP.", ""); error = EINTR_INTERNAL; } /* Check what error we got */ if (error == EINTR_INTERNAL) { TRACE_FLOW_NUMBER("Internal error - means we are stopping.", error); (*depth)--; return error; } else if (error) { TRACE_ERROR_NUMBER("Traverse handler returned error.", error); (*depth)--; return error; } TRACE_INFO_NUMBER("Next element", current->next); parent = current; current = current->next; } TRACE_INFO_STRING("Out of loop", ""); /* Check if we need to have a special * call at the end of the collection. */ if ((mode_flags & COL_TRAVERSE_END) != 0) { /* Do this dummy invocation only: * a) If we are flattening and on the root level * b) We are not flattening */ if ((((mode_flags & COL_TRAVERSE_FLAT) != 0) && (*depth == 1)) || ((mode_flags & COL_TRAVERSE_FLAT) == 0)) { TRACE_INFO_STRING("About to do the special end collection invocation of handler", ""); error = traverse_handler(ci, parent, current, traverse_data, user_item_handler, custom_data, &stop); } } TRACE_FLOW_NUMBER("col_walk_items. Returns: ", error); (*depth)--; return error; } /* ACTION */ /* Find an item by property name and perform an action on it. */ /* No pattern matching supported in the first implementation. */ /* To refer to child properties use notatation like this: */ /* parent!child!subchild!subsubchild etc. */ static int col_find_item_and_do(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, col_item_fn item_handler, void *custom_data, int action) { int error = EOK; struct find_name *traverse_data = NULL; unsigned depth = 0; int count = 0; const char *last_part; char *sep; TRACE_FLOW_STRING("col_find_item_and_do", "Entry."); /* Item handler is always required */ if ((item_handler == NULL) && (action == COLLECTION_ACTION_FIND)) { TRACE_ERROR_NUMBER("No item handler - returning error!", EINVAL); return EINVAL; } /* Collection is requered */ if (ci == NULL) { TRACE_ERROR_NUMBER("No collection to search!", EINVAL); return EINVAL; } /* Make sure that there is anything to search */ type &= COL_TYPE_ANY; if ((type == 0) && ((property_to_find == NULL) || ((property_to_find != NULL) && (*property_to_find == '\0')))) { TRACE_ERROR_NUMBER("No item search criteria specified - returning error!", ENOENT); return ENOENT; } /* Prepare data for traversal */ traverse_data = (struct find_name *)malloc(sizeof(struct find_name)); if (traverse_data == NULL) { TRACE_ERROR_NUMBER("Failed to allocate traverse data memory - returning error!", ENOMEM); return ENOMEM; } TRACE_INFO_STRING("col_find_item_and_do", "Filling in traverse data."); traverse_data->name_to_find = property_to_find; if (property_to_find != NULL) { traverse_data->name_len_to_find = strlen(property_to_find); /* Check if the search string ends with "!" - this is illegal */ if (traverse_data->name_to_find[traverse_data->name_len_to_find - 1] == '!') { TRACE_ERROR_NUMBER("Search string is invalid.", EINVAL); free(traverse_data); return EINVAL; } /* Find last ! if any */ sep = strrchr(traverse_data->name_to_find, '!'); if (sep != NULL) { sep++; last_part = sep; } else last_part = traverse_data->name_to_find; TRACE_INFO_STRING("Last item", last_part); /* Create hash of the last part */ traverse_data->hash = FNV1a_base; /* Create hash of the string to search */ while(last_part[count] != 0) { traverse_data->hash = traverse_data->hash ^ toupper(last_part[count]); traverse_data->hash *= FNV1a_prime; count++; } } else { /* We a looking for a first element of a given type */ TRACE_INFO_STRING("No search string", ""); traverse_data->name_len_to_find = 0; } traverse_data->type_to_match = type; traverse_data->given_name = NULL; traverse_data->given_len = 0; traverse_data->current_path = NULL; traverse_data->action = action; mode_flags |= COL_TRAVERSE_END; TRACE_INFO_STRING("col_find_item_and_do", "About to walk the tree."); TRACE_INFO_NUMBER("Traverse flags", mode_flags); error = col_walk_items(ci, mode_flags, col_act_traverse_handler, (void *)traverse_data, item_handler, custom_data, &depth); if (traverse_data->current_path != NULL) { TRACE_INFO_STRING("find_item_and_do", "Path was not cleared - deleting"); col_delete_path_data(traverse_data->current_path); } free(traverse_data); if (error && (error != EINTR_INTERNAL)) { TRACE_ERROR_NUMBER("Walk items returned error. Returning: ", error); return error; } else { TRACE_FLOW_STRING("Walk items returned SUCCESS.", ""); return EOK; } } /* Function to replace data in the item */ static int col_update_current_item(struct collection_item *current, struct update_property *update_data) { TRACE_FLOW_STRING("col_update_current_item", "Entry"); /* If type is different or same but it is string or binary we need to * replace the storage */ if ((current->type != update_data->type) || ((current->type == update_data->type) && ((current->type == COL_TYPE_STRING) || (current->type == COL_TYPE_BINARY)))) { TRACE_INFO_STRING("Replacing item data buffer", ""); free(current->data); current->data = malloc(update_data->length); if (current->data == NULL) { TRACE_ERROR_STRING("Failed to allocate memory", ""); current->length = 0; return ENOMEM; } current->length = update_data->length; } TRACE_INFO_STRING("Overwriting item data", ""); memcpy(current->data, update_data->data, current->length); current->type = update_data->type; if (current->type == COL_TYPE_STRING) ((char *)(current->data))[current->length-1] = '\0'; TRACE_FLOW_STRING("update_current_item", "Exit"); return EOK; } /* TRAVERSE CALLBACKS */ /* Traverse handler for simple traverse function */ /* Handler must be able to deal with NULL current item */ static int col_simple_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop) { int error = EOK; struct collection_item end_item; char zero = '\0'; TRACE_FLOW_STRING("col_simple_traverse_handler", "Entry."); if (current == NULL) { memset((void *)&end_item, 0, sizeof(struct collection_item)); end_item.type = COL_TYPE_END; end_item.property = &zero; current = &end_item; } error = user_item_handler(current->property, current->property_len, current->type, current->data, current->length, custom_data, stop); TRACE_FLOW_NUMBER("col_simple_traverse_handler. Returning:", error); return error; } /* Traverse handler for to find parent */ static int col_parent_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop) { struct property_search *to_find; int done = 0; int match = 0; TRACE_FLOW_STRING("col_parent_traverse_handler", "Entry."); to_find = (struct property_search *)custom_data; TRACE_INFO_NUMBER("Looking for HASH:", (unsigned)(to_find->hash)); TRACE_INFO_NUMBER("Current HASH:", (unsigned)(current->phash)); /* Check hashes first */ if(to_find->hash == current->phash) { /* Check type if we are asked to use type */ if ((to_find->use_type) && (!(to_find->type & current->type))) { TRACE_FLOW_STRING("parent_traverse_handler. Returning:","Exit. Hash is Ok, type is not"); return EOK; } /* Validate property. Make sure we include terminating 0 in the comparison */ if (strncasecmp(current->property, to_find->property, current->property_len + 1) == 0) { match = 1; to_find->found = 1; /* Do the right thing based on index */ /* If index is 0 we are looking for the first value in the list of duplicate properties */ if (to_find->index == 0) done = 1; /* If index is non zero we are looking for N-th instance of the dup property */ else if (to_find->index > 0) { if (to_find->count == to_find->index) done = 1; else { /* Record found instance and move on */ to_find->parent = previous; (to_find->count)++; } } /* If we are looking for last instance just record it */ else to_find->parent = previous; } } if (done) { *stop = 1; *((struct collection_item **)traverse_data) = previous; } else { if (to_find->interrupt) { /* As soon as we found first non matching one but there was a match * return the parent of the last found item. */ if (((!match) || (current->next == NULL)) && (to_find->index != 0) && (to_find->found)) { *stop = 1; if (to_find->index == -2) *((struct collection_item **)traverse_data) = to_find->parent; else if (to_find->exact) { /* This means that we need to match the exact * index but we did not */ to_find->parent = NULL; to_find->found = 0; } else *((struct collection_item **)traverse_data) = to_find->parent->next; } } else if ((current->next == NULL) && (to_find->found)) { *stop = 1; if (to_find->index == -2) *((struct collection_item **)traverse_data) = to_find->parent; else if (to_find->exact) { /* This means that we need to match the exact * index but we did not */ to_find->parent = NULL; to_find->found = 0; } else *((struct collection_item **)traverse_data) = to_find->parent->next; } } TRACE_FLOW_STRING("col_parent_traverse_handler. Returning:","Exit"); return EOK; } /* Traverse callback for find & delete function */ static int col_act_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *passed_traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop) { int error = EOK; struct find_name *traverse_data = NULL; char *name; int length; struct path_data *temp; struct collection_header *header; char *property; int property_len; struct update_property *update_data; TRACE_FLOW_STRING("col_act_traverse_handler", "Entry."); traverse_data = (struct find_name *)passed_traverse_data; /* We can be called when current points to NULL */ if (current == NULL) { TRACE_INFO_STRING("col_act_traverse_handler", "Special call at the end of the collection."); temp = traverse_data->current_path; traverse_data->current_path = temp->previous_path; temp->previous_path = NULL; col_delete_path_data(temp); traverse_data->given_name = NULL; traverse_data->given_len = 0; TRACE_FLOW_NUMBER("Handling end of collection - removed path. Returning:", error); return error; } /* Create new path at the beginning of a new sub collection */ if (current->type == COL_TYPE_COLLECTION) { TRACE_INFO_STRING("col_act_traverse_handler", "Processing collection handle."); /* Create new path */ if (traverse_data->current_path != NULL) { TRACE_INFO_STRING("Already have part of the path", ""); name = traverse_data->current_path->name; length = traverse_data->current_path->length; TRACE_INFO_STRING("Path:", name); TRACE_INFO_NUMBER("Path len:", length); } else { name = NULL; length = 0; } if (traverse_data->given_name != NULL) { property = traverse_data->given_name; property_len = traverse_data->given_len; } else { property = current->property; property_len = current->property_len; } TRACE_INFO_STRING("col_act_traverse_handler", "About to create path data."); error = col_create_path_data(&(traverse_data->current_path), name, length, property, property_len, '!'); TRACE_INFO_NUMBER("col_create_path_data returned:", error); return error; } /* Handle the collection pointers */ if (current->type == COL_TYPE_COLLECTIONREF) { traverse_data->given_name = current->property; traverse_data->given_len = current->property_len; TRACE_INFO_STRING("Saved given name:", traverse_data->given_name); } TRACE_INFO_STRING("Processing item with property:", current->property); /* Do here what we do with items */ if (col_match_item(current, traverse_data)) { TRACE_INFO_STRING("Matched item:", current->property); switch (traverse_data->action) { case COLLECTION_ACTION_FIND: TRACE_INFO_STRING("It is a find action - calling handler.", ""); if (user_item_handler != NULL) { /* Call user handler */ error = user_item_handler(current->property, current->property_len, current->type, current->data, current->length, custom_data, stop); TRACE_INFO_NUMBER("Handler returned:", error); TRACE_INFO_NUMBER("Handler set STOP to:", *stop); } break; case COLLECTION_ACTION_GET: TRACE_INFO_STRING("It is a get action.", ""); if (custom_data != NULL) *((struct collection_item **)(custom_data)) = current; break; case COLLECTION_ACTION_DEL: TRACE_INFO_STRING("It is a delete action.", ""); /* Make sure we tell the caller we found a match */ if (custom_data != NULL) *(int *)custom_data = COL_MATCH; /* Adjust header of the collection */ header = (struct collection_header *)head->data; header->count--; if (current->next == NULL) header->last = previous; /* Unlink and delete iteam */ /* Previous can't be NULL here becuase we never delete * header elements */ previous->next = current->next; col_delete_item(current); TRACE_INFO_STRING("Did the delete of the item.", ""); break; case COLLECTION_ACTION_UPDATE: TRACE_INFO_STRING("It is an update action.", ""); if((current->type == COL_TYPE_COLLECTION) || (current->type == COL_TYPE_COLLECTIONREF)) { TRACE_ERROR_STRING("Can't update collections it is an error for now", ""); return EINVAL; } /* Make sure we tell the caller we found a match */ if (custom_data != NULL) { update_data = (struct update_property *)custom_data; update_data->found = COL_MATCH; error = col_update_current_item(current, update_data); } else { TRACE_ERROR_STRING("Error - update data is required", ""); return EINVAL; } TRACE_INFO_STRING("Did the delete of the item.", ""); break; default: break; } /* Force interrupt if we found */ *stop = 1; } TRACE_FLOW_NUMBER("col_act_traverse_handler returning", error); return error; } /* Traverse handler for copy function */ static int col_copy_traverse_handler(struct collection_item *head, struct collection_item *previous, struct collection_item *current, void *passed_traverse_data, col_item_fn user_item_handler, void *custom_data, int *stop) { int error = EOK; struct collection_item *parent; struct collection_item *other = NULL; struct col_copy *traverse_data; struct path_data *temp; char *name; int length; char *property = NULL; int property_len; struct collection_header *header; char *offset; TRACE_FLOW_STRING("col_copy_traverse_handler", "Entry."); parent = (struct collection_item *)custom_data; traverse_data = (struct col_copy *)passed_traverse_data; /* We can be called when current points to NULL */ /* This will happen only in the FLATDOT case */ if (current == NULL) { TRACE_INFO_STRING("col_copy_traverse_handler", "Special call at the end of the collection."); temp = traverse_data->current_path; traverse_data->current_path = temp->previous_path; temp->previous_path = NULL; col_delete_path_data(temp); traverse_data->given_name = NULL; traverse_data->given_len = 0; TRACE_FLOW_NUMBER("Handling end of collection - removed path. Returning:", error); return error; } /* Create new path at the beginning of a new sub collection */ if (current->type == COL_TYPE_COLLECTION) { TRACE_INFO_STRING("col_copy_traverse_handler", "Processing collection handle."); if (traverse_data->mode == COL_COPY_FLATDOT) { /* Create new path */ if (traverse_data->current_path != NULL) { TRACE_INFO_STRING("Already have part of the path", ""); name = traverse_data->current_path->name; length = traverse_data->current_path->length; TRACE_INFO_STRING("Path:", name); TRACE_INFO_NUMBER("Path len:", length); if (traverse_data->given_name != NULL) { property = traverse_data->given_name; property_len = traverse_data->given_len; } else { property = current->property; property_len = current->property_len; } } else { /* Do not create prefix for top collection * if there is no given name. */ name = NULL; length = 0; if (traverse_data->given_name != NULL) { property = traverse_data->given_name; property_len = traverse_data->given_len; } else { property = NULL; property_len = 0; } } TRACE_INFO_STRING("col_copy_traverse_handler", "About to create path data."); error = col_create_path_data(&(traverse_data->current_path), name, length, property, property_len, '.'); TRACE_FLOW_NUMBER("col_copy_traverse_handler processed header:", error); return error; } else { TRACE_FLOW_NUMBER("col_copy_traverse_handler skipping the header:", error); return error; } } /* Check if this is a special case of sub collection */ if (current->type == COL_TYPE_COLLECTIONREF) { TRACE_INFO_STRING("Found a subcollection we need to copy. Name:", current->property); /* Based on the mode we need to do different things */ switch (traverse_data->mode) { case COL_COPY_NORMAL: error = col_copy_collection_with_cb(&other, *((struct collection_item **)(current->data)), current->property, COL_COPY_NORMAL, traverse_data->copy_cb, traverse_data->ext_data); if (error) { TRACE_ERROR_NUMBER("Copy subcollection returned error:", error); return error; } /* Add new item to a collection * all references are now sub collections */ error = col_insert_property_with_ref_int(parent, NULL, COL_DSP_END, NULL, 0, 0, current->property, COL_TYPE_COLLECTIONREF, (void *)(&other), sizeof(struct collection_item **), NULL); TRACE_FLOW_NUMBER("col_copy_traverse_handler returning in NORMAL mode:", error); return error; case COL_COPY_KEEPREF: /* Just increase reference count of the referenced collection */ other = *((struct collection_item **)(current->data)); header = (struct collection_header *)(other->data); header->reference_count++; /* Add new item to a collection * all references are now sub collections */ error = col_insert_property_with_ref_int(parent, NULL, COL_DSP_END, NULL, 0, 0, current->property, COL_TYPE_COLLECTIONREF, (void *)(&other), sizeof(struct collection_item **), NULL); TRACE_FLOW_NUMBER("col_copy_traverse_handler returning in KEEPREF mode:", error); return error; case COL_COPY_TOP: /* Told to ignore sub collections */ TRACE_FLOW_NUMBER("col_copy_traverse_handler returning in TOP mode:", error); return error; case COL_COPY_FLATDOT: traverse_data->given_name = current->property; traverse_data->given_len = current->property_len; TRACE_INFO_STRING("Saved given name:", traverse_data->given_name); TRACE_FLOW_NUMBER("col_copy_traverse_handler returning in FLATDOT mode:", error); return error; /* NOTE: The mode COL_COPY_FLAT is not in the list of cases becuase * in this flat mode we traverse collection using COL_TRAVERSE_FLAT flag * thus we should not be called on referenced collections at all * by the col_walk_items() function. */ default: TRACE_ERROR_NUMBER("col_copy_traverse_handler bad mode error:", EINVAL); return EINVAL; } } else { if (traverse_data->mode == COL_COPY_FLATDOT) { /* Since this code can't use asprintf have to do it hard way */ property = malloc(traverse_data->current_path->length + current->property_len + 2); if (property == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory for a new name:", error); return error; } /* Add first part and dot only if we have prefix */ offset = property; if (traverse_data->current_path->length) { memcpy(offset, traverse_data->current_path->name, traverse_data->current_path->length); offset[traverse_data->current_path->length] = '.'; offset += traverse_data->current_path->length + 1; } memcpy(offset, current->property, current->property_len); offset[current->property_len] = '\0'; } else property = current->property; TRACE_INFO_STRING("Using property:", property); error = col_copy_item_with_cb(parent, property, current->type, current->data, current->length, traverse_data->copy_cb, traverse_data->ext_data); /* Free property if we allocated it */ if (traverse_data->mode == COL_COPY_FLATDOT) free(property); if (error) { TRACE_ERROR_NUMBER("Failed to copy property:", error); return error; } } TRACE_FLOW_NUMBER("col_copy_traverse_handler returning", error); return error; } /********************* MAIN INTERFACE FUNCTIONS *****************************/ /* CREATE */ /* Function that creates an named collection of a given class*/ int col_create_collection(struct collection_item **ci, const char *name, unsigned cclass) { struct collection_item *handle = NULL; struct collection_header header; int error = EOK; TRACE_FLOW_STRING("col_create_collection", "Entry."); /* Prepare header */ header.last = NULL; header.reference_count = 1; header.count = 0; header.cclass = cclass; /* Create a collection type property */ error = col_insert_property_with_ref_int(NULL, NULL, COL_DSP_END, NULL, 0, 0, name, COL_TYPE_COLLECTION, &header, sizeof(header), &handle); if (error) return error; *ci = handle; TRACE_FLOW_STRING("col_create_collection", "Success Exit."); return EOK; } /* DESTROY */ /* Function that destroys a collection */ void col_destroy_collection_with_cb(struct collection_item *ci, col_item_cleanup_fn cb, void *custom_data) { struct collection_header *header; TRACE_FLOW_STRING("col_destroy_collection_with_cb", "Entry."); /* Do not try to delete NULL */ if (ci == NULL) return; /* You can delete only whole collection not a part of it */ if (ci->type != COL_TYPE_COLLECTION) { TRACE_ERROR_STRING("Attempt to delete a non collection - BAD!", ""); TRACE_ERROR_NUMBER("Actual type is:", ci->type); return; } TRACE_INFO_STRING("Name:", ci->property); /* Collection can be referenced by other collection */ header = (struct collection_header *)(ci->data); TRACE_INFO_NUMBER("Reference count:", header->reference_count); if (header->reference_count > 1) { TRACE_INFO_STRING("Dereferencing a referenced collection.", ""); header->reference_count--; TRACE_INFO_NUMBER("Number after dereferencing.", header->reference_count); } else { col_delete_collection(ci, cb, custom_data); } TRACE_FLOW_STRING("col_destroy_collection_with_cb", "Exit."); } /* Function that destroys a collection */ void col_destroy_collection(struct collection_item *ci) { TRACE_FLOW_STRING("col_destroy_collection", "Entry."); col_destroy_collection_with_cb(ci, NULL, NULL); TRACE_FLOW_STRING("col_destroy_collection", "Exit."); } /* COPY */ /* Wrapper around a more advanced function */ int col_copy_collection(struct collection_item **collection_copy, struct collection_item *collection_to_copy, const char *name_to_use, int copy_mode) { int error = EOK; TRACE_FLOW_STRING("col_copy_collection", "Entry."); error = col_copy_collection_with_cb(collection_copy, collection_to_copy, name_to_use, copy_mode, NULL, NULL); TRACE_FLOW_NUMBER("col_copy_collection. Exit. Returning", error); return error; } /* Create a deep copy of the current collection. */ /* Referenced collections of the donor are copied as sub collections. */ int col_copy_collection_with_cb(struct collection_item **collection_copy, struct collection_item *collection_to_copy, const char *name_to_use, int copy_mode, col_copy_cb copy_cb, void *ext_data) { int error = EOK; struct collection_item *new_collection = NULL; const char *name; struct collection_header *header; unsigned depth = 0; struct col_copy traverse_data; int flags; TRACE_FLOW_STRING("col_copy_collection_with_cb", "Entry."); /* Collection is required */ if (collection_to_copy == NULL) { TRACE_ERROR_NUMBER("No collection to search!", EINVAL); return EINVAL; } /* Storage is required too */ if (collection_copy == NULL) { TRACE_ERROR_NUMBER("No memory provided to receive collection copy!", EINVAL); return EINVAL; } /* NOTE: Refine this check if adding a new copy mode */ if ((copy_mode < 0) || (copy_mode > COL_COPY_TOP)) { TRACE_ERROR_NUMBER("Invalid copy mode:", copy_mode); return EINVAL; } /* Determine what name to use */ if (name_to_use != NULL) name = name_to_use; else name = collection_to_copy->property; header = (struct collection_header *)collection_to_copy->data; /* Create a new collection */ error = col_create_collection(&new_collection, name, header->cclass); if (error) { TRACE_ERROR_NUMBER("col_create_collection failed returning", error); return error; } traverse_data.mode = copy_mode; traverse_data.current_path = NULL; traverse_data.given_name = NULL; traverse_data.given_len = 0; traverse_data.copy_cb = copy_cb; traverse_data.ext_data = ext_data; if (copy_mode == COL_COPY_FLATDOT) flags = COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END; else if (copy_mode == COL_COPY_FLAT) flags = COL_TRAVERSE_FLAT; else flags = COL_TRAVERSE_ONELEVEL; error = col_walk_items(collection_to_copy, flags, col_copy_traverse_handler, (void *)(&traverse_data), NULL, new_collection, &depth); if (!error) *collection_copy = new_collection; else col_destroy_collection(new_collection); TRACE_FLOW_NUMBER("col_copy_collection_with_cb returning", error); return error; } /* EXTRACTION */ /* Extract collection */ int col_get_collection_reference(struct collection_item *ci, struct collection_item **acceptor, const char *collection_to_find) { struct collection_header *header; struct collection_item *subcollection = NULL; int error = EOK; TRACE_FLOW_STRING("col_get_collection_reference", "Entry."); if ((ci == NULL) || (ci->type != COL_TYPE_COLLECTION) || (acceptor == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter - returning error",EINVAL); return EINVAL; } if (collection_to_find) { /* Find a sub collection */ TRACE_INFO_STRING("We are given subcollection name - search it:", collection_to_find); error = col_find_item_and_do(ci, collection_to_find, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, col_get_subcollection, (void *)(&subcollection), COLLECTION_ACTION_FIND); if (error) { TRACE_ERROR_NUMBER("Search failed returning error", error); return error; } if (subcollection == NULL) { TRACE_ERROR_STRING("Search for subcollection returned NULL pointer", ""); return ENOENT; } } else { /* Create reference to the same collection */ TRACE_INFO_STRING("Creating reference to the top level collection.", ""); subcollection = ci; } header = (struct collection_header *)subcollection->data; TRACE_INFO_NUMBER("Count:", header->count); TRACE_INFO_NUMBER("Ref count:", header->reference_count); header->reference_count++; TRACE_INFO_NUMBER("Ref count after increment:", header->reference_count); *acceptor = subcollection; TRACE_FLOW_STRING("col_get_collection_reference", "Success Exit."); return EOK; } /* Get collection - if current item is a reference get a real collection from it. */ int col_get_reference_from_item(struct collection_item *ci, struct collection_item **acceptor) { struct collection_header *header; struct collection_item *subcollection = NULL; TRACE_FLOW_STRING("get_reference_from_item", "Entry."); if ((ci == NULL) || (ci->type != COL_TYPE_COLLECTIONREF) || (acceptor == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter - returning error",EINVAL); return EINVAL; } subcollection = *((struct collection_item **)ci->data); header = (struct collection_header *)subcollection->data; TRACE_INFO_NUMBER("Count:", header->count); TRACE_INFO_NUMBER("Ref count:", header->reference_count); header->reference_count++; TRACE_INFO_NUMBER("Ref count after increment:", header->reference_count); *acceptor = subcollection; TRACE_FLOW_STRING("col_get_reference_from_item", "Success Exit."); return EOK; } /* ADDITION */ /* Add collection to collection */ int col_add_collection_to_collection(struct collection_item *ci, const char *sub_collection_name, const char *as_property, struct collection_item *collection_to_add, int mode) { struct collection_item *acceptor = NULL; const char *name_to_use; struct collection_header *header; struct collection_item *collection_copy; int error = EOK; struct col_copy traverse_data; unsigned depth = 0; TRACE_FLOW_STRING("col_add_collection_to_collection", "Entry."); if ((ci == NULL) || (ci->type != COL_TYPE_COLLECTION) || (collection_to_add == NULL) || (collection_to_add->type != COL_TYPE_COLLECTION)) { /* Need to debug here */ TRACE_ERROR_NUMBER("Missing parameter - returning error", EINVAL); return EINVAL; } if (sub_collection_name != NULL) { /* Find a sub collection */ TRACE_INFO_STRING("We are given subcollection name - search it:", sub_collection_name); error = col_find_item_and_do(ci, sub_collection_name, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, col_get_subcollection, (void *)(&acceptor), COLLECTION_ACTION_FIND); if (error) { TRACE_ERROR_NUMBER("Search failed returning error", error); return error; } if (acceptor == NULL) { TRACE_ERROR_STRING("Search for subcollection returned NULL pointer", ""); return ENOENT; } } else { acceptor = ci; } if (as_property != NULL) name_to_use = as_property; else name_to_use = collection_to_add->property; TRACE_INFO_STRING("Going to use name:", name_to_use); switch (mode) { case COL_ADD_MODE_REFERENCE: TRACE_INFO_STRING("We are adding a reference.", ""); TRACE_INFO_NUMBER("Type of the header element:", collection_to_add->type); TRACE_INFO_STRING("Header name we are adding.", collection_to_add->property); /* Create a pointer to external collection */ /* For future thread safety: Transaction start -> */ error = col_insert_property_with_ref_int(acceptor, NULL, COL_DSP_END, NULL, 0, 0, name_to_use, COL_TYPE_COLLECTIONREF, (void *)(&collection_to_add), sizeof(struct collection_item **), NULL); TRACE_INFO_NUMBER("Type of the header element after adding property:", collection_to_add->type); TRACE_INFO_STRING("Header name we just added.", collection_to_add->property); if (error) { TRACE_ERROR_NUMBER("Adding property failed with error:", error); return error; } header = (struct collection_header *)collection_to_add->data; TRACE_INFO_NUMBER("Count:", header->count); TRACE_INFO_NUMBER("Ref count:", header->reference_count); header->reference_count++; TRACE_INFO_NUMBER("Ref count after increment:", header->reference_count); /* -> Transaction end */ break; case COL_ADD_MODE_EMBED: TRACE_INFO_STRING("We are embedding the collection.", ""); /* First check if the passed in collection is referenced more than once */ TRACE_INFO_NUMBER("Type of the header element we are adding:", collection_to_add->type); TRACE_INFO_STRING("Header name we are adding.", collection_to_add->property); TRACE_INFO_NUMBER("Type of the header element we are adding to:", acceptor->type); TRACE_INFO_STRING("Header name we are adding to.", acceptor->property); error = col_insert_property_with_ref_int(acceptor, NULL, COL_DSP_END, NULL, 0, 0, name_to_use, COL_TYPE_COLLECTIONREF, (void *)(&collection_to_add), sizeof(struct collection_item **), NULL); TRACE_INFO_NUMBER("Adding property returned:", error); break; case COL_ADD_MODE_CLONE: TRACE_INFO_STRING("We are cloning the collection.", ""); TRACE_INFO_STRING("Name we will use.", name_to_use); /* For future thread safety: Transaction start -> */ error = col_copy_collection(&collection_copy, collection_to_add, name_to_use, COL_COPY_NORMAL); if (error) return error; TRACE_INFO_STRING("We have a collection copy.", collection_copy->property); TRACE_INFO_NUMBER("Collection type.", collection_copy->type); TRACE_INFO_STRING("Acceptor collection.", acceptor->property); TRACE_INFO_NUMBER("Acceptor collection type.", acceptor->type); error = col_insert_property_with_ref_int(acceptor, NULL, COL_DSP_END, NULL, 0, 0, name_to_use, COL_TYPE_COLLECTIONREF, (void *)(&collection_copy), sizeof(struct collection_item **), NULL); /* -> Transaction end */ TRACE_INFO_NUMBER("Adding property returned:", error); break; case COL_ADD_MODE_FLAT: TRACE_INFO_STRING("We are flattening the collection.", ""); traverse_data.mode = COL_COPY_FLAT; traverse_data.current_path = NULL; traverse_data.copy_cb = NULL; traverse_data.ext_data = NULL; if ((as_property) && (*as_property)) { /* The normal assignement generates a warning * becuase I am assigning const to a non const. * I can't make the structure member to be const * since it changes but it changes * to point to different stings at different time * This is just an initial sting it will use. * The logic does not change the content of the string. * To overcome the issue I use memcpy(); */ memcpy(&(traverse_data.given_name), &(as_property), sizeof(char *)); traverse_data.given_len = strlen(as_property); } else { traverse_data.given_name = NULL; traverse_data.given_len = 0; } error = col_walk_items(collection_to_add, COL_TRAVERSE_FLAT, col_copy_traverse_handler, (void *)(&traverse_data), NULL, acceptor, &depth); TRACE_INFO_NUMBER("Copy collection flat returned:", error); break; case COL_ADD_MODE_FLATDOT: TRACE_INFO_STRING("We are flattening the collection with dots.", ""); traverse_data.mode = COL_COPY_FLATDOT; traverse_data.current_path = NULL; traverse_data.copy_cb = NULL; traverse_data.ext_data = NULL; if ((as_property) && (*as_property)) { /* The normal assignement generates a warning * becuase I am assigning const to a non const. * I can't make the structure member to be const * since it changes but it changes * to point to different stings at different time * This is just an initial sting it will use. * The logic does not change the content of the string. * To overcome the issue I use memcpy(); */ memcpy(&(traverse_data.given_name), &(as_property), sizeof(char *)); traverse_data.given_len = strlen(as_property); } else { traverse_data.given_name = NULL; traverse_data.given_len = 0; } error = col_walk_items(collection_to_add, COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END, col_copy_traverse_handler, (void *)(&traverse_data), NULL, acceptor, &depth); TRACE_INFO_NUMBER("Copy collection flatdot returned:", error); break; default: error = EINVAL; } TRACE_FLOW_NUMBER("col_add_collection_to_collection returning:", error); return error; } /* TRAVERSING */ /* Function to traverse the entire collection including optionally * sub collections */ int col_traverse_collection(struct collection_item *ci, int mode_flags, col_item_fn item_handler, void *custom_data) { int error = EOK; unsigned depth = 0; TRACE_FLOW_STRING("col_traverse_collection", "Entry."); if (ci == NULL) { TRACE_ERROR_NUMBER("No collection to traverse!", EINVAL); return EINVAL; } error = col_walk_items(ci, mode_flags, col_simple_traverse_handler, NULL, item_handler, custom_data, &depth); if ((error != 0) && (error != EINTR_INTERNAL)) { TRACE_ERROR_NUMBER("Error walking tree", error); return error; } TRACE_FLOW_STRING("col_traverse_collection", "Success exit."); return EOK; } /* CHECK */ /* Convenience function to check if specific property is in the collection */ int col_is_item_in_collection(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, int *found) { int error; TRACE_FLOW_STRING("col_is_item_in_collection","Entry."); *found = COL_NOMATCH; error = col_find_item_and_do(ci, property_to_find, type, mode_flags, col_is_in_item_handler, (void *)found, COLLECTION_ACTION_FIND); TRACE_FLOW_NUMBER("col_is_item_in_collection returning", error); return error; } /* SEARCH */ /* Search function. Looks up an item in the collection based on the property. Essentually it is a traverse function with spacial traversing logic. */ int col_get_item_and_do(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, col_item_fn item_handler, void *custom_data) { int error = EOK; TRACE_FLOW_STRING("col_get_item_and_do","Entry."); error = col_find_item_and_do(ci, property_to_find, type, mode_flags, item_handler, custom_data, COLLECTION_ACTION_FIND); TRACE_FLOW_NUMBER("col_get_item_and_do returning", error); return error; } /* Get raw item */ int col_get_item(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, struct collection_item **item) { int error = EOK; TRACE_FLOW_STRING("col_get_item", "Entry."); error = col_find_item_and_do(ci, property_to_find, type, mode_flags, NULL, (void *)item, COLLECTION_ACTION_GET); TRACE_FLOW_NUMBER("col_get_item returning", error); return error; } /* DELETE */ /* Delete property from the collection */ int col_delete_property(struct collection_item *ci, const char *property_to_find, int type, int mode_flags) { int error = EOK; int found; TRACE_FLOW_STRING("col_delete_property", "Entry."); found = COL_NOMATCH; error = col_find_item_and_do(ci, property_to_find, type, mode_flags, NULL, (void *)(&found), COLLECTION_ACTION_DEL); if ((error == EOK) && (found == COL_NOMATCH)) error = ENOENT; TRACE_FLOW_NUMBER("col_delete_property returning", error); return error; } /* UPDATE */ /* Update property in the collection */ int col_update_property(struct collection_item *ci, const char *property_to_find, int type, void *new_data, int length, int mode_flags) { int error = EOK; struct update_property update_data; TRACE_FLOW_STRING("col_update_property", "Entry."); update_data.type = type; update_data.data = new_data; update_data.length = length; update_data.found = COL_NOMATCH; error = col_find_item_and_do(ci, property_to_find, type, mode_flags, NULL, (void *)(&update_data), COLLECTION_ACTION_UPDATE); if ((error == EOK) && (update_data.found == COL_NOMATCH)) error = ENOENT; TRACE_FLOW_NUMBER("col_update_property returning", error); return error; } /* Function to modify the item */ int col_modify_item(struct collection_item *item, const char *property, int type, const void *data, int length) { TRACE_FLOW_STRING("col_modify_item", "Entry"); /* Allow renameing only */ if ((item == NULL) || ((item->type == COL_TYPE_COLLECTION) && (length != 0)) || ((item->type == COL_TYPE_COLLECTIONREF) && (length != 0))) { TRACE_ERROR_NUMBER("Invalid argument or invalid argument type", EINVAL); return EINVAL; } if (property != NULL) { if (col_validate_property(property)) { TRACE_ERROR_STRING("Invalid chracters in the property name", property); return EINVAL; } free(item->property); item->property = strdup(property); if (item->property == NULL) { TRACE_ERROR_STRING("Failed to allocate memory", ""); return ENOMEM; } /* Update property length and hash if we rename the property */ item->phash = col_make_hash(property, 0, &(item->property_len)); TRACE_INFO_NUMBER("Item hash", item->phash); TRACE_INFO_NUMBER("Item property length", item->property_len); TRACE_INFO_NUMBER("Item property strlen", strlen(item->property)); } /* We need to change data ? */ if(length) { /* If type is different or same but it is string or binary we need to * replace the storage */ if ((item->type != type) || ((item->type == type) && ((item->type == COL_TYPE_STRING) || (item->type == COL_TYPE_BINARY)))) { TRACE_INFO_STRING("Replacing item data buffer", ""); free(item->data); item->data = malloc(length); if (item->data == NULL) { TRACE_ERROR_STRING("Failed to allocate memory", ""); item->length = 0; return ENOMEM; } item->length = length; } TRACE_INFO_STRING("Overwriting item data", ""); memcpy(item->data, data, item->length); item->type = type; if (item->type == COL_TYPE_STRING) ((char *)(item->data))[item->length - 1] = '\0'; } TRACE_FLOW_STRING("col_modify_item", "Exit"); return EOK; } /* Set collection class */ int col_set_collection_class(struct collection_item *item, unsigned cclass) { struct collection_header *header; TRACE_FLOW_STRING("col_set_collection_class", "Entry"); if (item->type != COL_TYPE_COLLECTION) { TRACE_INFO_NUMBER("Not a collectin object. Type is", item->type); return EINVAL; } header = (struct collection_header *)item->data; header->cclass = cclass; TRACE_FLOW_STRING("col_set_collection_class", "Exit"); return EOK; } /* Get collection class */ int col_get_collection_class(struct collection_item *item, unsigned *cclass) { struct collection_header *header; TRACE_FLOW_STRING("col_get_collection_class", "Entry"); if (item->type != COL_TYPE_COLLECTION) { TRACE_ERROR_NUMBER("Not a collection object. Type is", item->type); return EINVAL; } header = (struct collection_header *)item->data; *cclass = header->cclass; TRACE_FLOW_STRING("col_get_collection_class", "Exit"); return EOK; } /* Get collection count */ int col_get_collection_count(struct collection_item *item, unsigned *count) { struct collection_header *header; TRACE_FLOW_STRING("col_get_collection_count", "Entry"); if (item->type != COL_TYPE_COLLECTION) { TRACE_ERROR_NUMBER("Not a collectin object. Type is", item->type); return EINVAL; } header = (struct collection_header *)item->data; *count = header->count; TRACE_FLOW_STRING("col_get_collection_count", "Exit"); return EOK; } /* Convinience function to check if the collection is of the specific class */ /* In case of internal error assumes that collection is not of the right class */ int col_is_of_class(struct collection_item *item, unsigned cclass) { int error = EOK; unsigned ret_class = 0; TRACE_FLOW_STRING("col_is_of_class invoked", ""); error = col_get_collection_class(item, &ret_class); if (error || (ret_class != cclass)) return 0; else return 1; } /* Get propery */ const char *col_get_item_property(struct collection_item *ci, int *property_len) { if (property_len != NULL) *property_len = ci->property_len; return ci->property; } /* Get type */ int col_get_item_type(struct collection_item *ci) { return ci->type; } /* Get length */ int col_get_item_length(struct collection_item *ci) { return ci->length; } /* Get data */ void *col_get_item_data(struct collection_item *ci) { return ci->data; } /* Get hash */ uint64_t col_get_item_hash(struct collection_item *ci) { return ci->phash; } /* Calculates hash of the string using internal hashing * algorithm. Populates "length" with length * of the string not counting 0. * Length argument can be NULL. */ uint64_t col_make_hash(const char *string, int sub_len, int *length) { uint64_t hash = 0; int str_len = 0; TRACE_FLOW_STRING("col_make_hash called for string:", string); if (string) { hash = FNV1a_base; while (string[str_len] != 0) { /* Check if we need to stop */ if ((sub_len > 0) && (str_len == sub_len)) break; hash = hash ^ toupper(string[str_len]); hash *= FNV1a_prime; str_len++; } } if (length) *length = str_len; TRACE_FLOW_NUMBER("col_make_hash returning hash:", hash); return hash; } ding-libs-0.6.2/collection/collection.cfg.doxy.in000066400000000000000000001755271417260640400217520ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "libcollection" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = "The $name class" \ "The $name widget" \ "The $name file" \ is \ provides \ specifies \ contains \ represents \ a \ an \ the # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@ # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.c *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *_ut.c *priv* config.h # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = NO # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = YES #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES ding-libs-0.6.2/collection/collection.h000066400000000000000000004221771417260640400200470ustar00rootroot00000000000000/* COLLECTION LIBRARY Header file for collection interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #ifndef COLLECTION_H #define COLLECTION_H #include /** @mainpage The COLLECTION interface * The collection is a set of items of different types. * * To better understand how collections work imagine travel bags. * They usually come in different sizes and one can put a bag in a bag when * they put away to the shelf in a garage or closet. Collection is such bag * except that you can put other bags into each other even if they are not * empty.
* When you put items into a bag you do not see the contents of the bag. * You just hold the bag. How many other bags inside this bag you do not know. * But you might know that you put a "wallet" somewhere there. * You ask the bag you hold: "find my wallet and give it to me". * get_item function will return you the item that is your "wallet". * You can then change something or just get information about the item you * retrieved. But in most cases you do not need the wallet itself. You want to * get something from the wallet or put something into it. IMO money would * be an obvious choice. To do this you use update_xxx_property functions.
* There might be a bag somewhere deep and you might want to add something to * it. add_xxx_property_xxx functions allow you to specify sub collection you * want the item to be added to. If this sub collection argument is NULL top * level collection is assumed.
* The search in the collections uses a "x!y!z" notation to refer to an item (or * property). You can search for "wallet" and it will find any first instance of * the "wallet" in your luggage. But you might have two wallets. One is yours and * another is your significant other's. So you might say find "my!wallet". * It will find wallet in your bag (collection) named "my". This collection can * be many levels deep inside other collections. You do not need to know the * full path to get to it. But if you have the full path you can use the fill * path like this "luggage!newbags!my!wallet".
* It is useful to be able to put bags into bags as well as get them out of each * other. When the collection is created the header keeps a reference count on * how many copies of the collection are known to the world. So one can put a * collection into collection and give up its access to it (embed) or still hold * to the reference. By embedding the collection the caller effectively gives * up its responsibility to destroy the collection after it is used.
* By extracting reference from an internal collection the caller gains access * to the collection directly and thus has responsibility to destroy it after * use. * * Internally collection is implemented as a link list rather than a hash * table. * This makes it suitable for small (dozens of items) sets of data for which * the order is important. Thus the collection properties and sub collections * can be used to model objects like a book case. Imagine a book case that * consists of multiple shelves. You can perform operations like "add a new * shelf after second shelf" or "put a book on the 4th shelf right before * the book with the red cover." * * A bit of terminology: * - collection - an object implemented as a link list that holds * properties (attributes). * - property - a named logical element of the collection. * - item - physical element of the collection, think about it * as a node in the link list. * - value - data associated with the property. * - type - type of the data associated with a property. * - length - length of the data associated with the property. * - sub collection - collection embedded into another collection. * It is a property with the value of a special * type. The name of the property that denotes * a sub collection can be different from the name * of the collection it refers to. * - traverse - call a function that will internally iterate * through a collection and do something with its * elements. * - iterate - step through a collection yourselves. * * Characters with codes less than space in ASCII table are illegal for * property names. * Character '!' also illegal in a property or collection name and * reserved for "x!y!z" notation. * * There is always a header item in any collection that starts the collection. * Most of the functions in the interface (unless explicitly stated otherwise) * assume that the collection_item * argument points to the header element. * Passing in elements extracted from the middle of a collection to functions * that expect header elements is illegal. There might be not enough checking * at the moment but this will be enforced in future versions of the library. * */ #ifndef EOK #define EOK 0 #endif /** * @defgroup collection COLLECTION interface * @{ */ /** * @brief Default class for a free form collection. */ #define COL_CLASS_DEFAULT 0 /** * @brief Value indicates that property is not found. * * Used in search functions. */ #define COL_NOMATCH 0 /** * @brief Value indicates that property is found. * * Used in search functions. */ #define COL_MATCH 1 /** * @defgroup coltypes Type definition constants * @{ */ /** * @brief Indicates that property is of type "string". * * For elements of type string the length includes the trailing 0. */ #define COL_TYPE_STRING 0x00000001 /** @brief Indicates that property is of type "binary". */ #define COL_TYPE_BINARY 0x00000002 /** @brief Indicates that property is of type "integer". */ #define COL_TYPE_INTEGER 0x00000004 /** @brief Indicates that property is of type "unsigned". */ #define COL_TYPE_UNSIGNED 0x00000008 /** @brief Indicates that property is of type "long". */ #define COL_TYPE_LONG 0x00000010 /** @brief Indicates that property is of type "unsigned long". */ #define COL_TYPE_ULONG 0x00000020 /** @brief Indicates that property is of type "double". */ #define COL_TYPE_DOUBLE 0x00000040 /** @brief Indicates that property is of Boolean type. */ #define COL_TYPE_BOOL 0x00000080 /** * @brief Indicates that property is of type "collection". * * The item of this type denotes that starting element of a * collection. */ #define COL_TYPE_COLLECTION 0x00000100 /** * @brief Indicates that property is of type "sub collection". * * An item of this type is a pointer to an existing external * collection. */ #define COL_TYPE_COLLECTIONREF 0x00000200 /** * @brief Special type that denotes the end of the collection. * * Useful when traversing collections. */ #define COL_TYPE_END 0x10000000 /** * @brief Special type that denotes any property in the collection. * * Useful when traversing collection and searching for a property * of unknown type but known name. */ #define COL_TYPE_ANY 0x0FFFFFFF /** * @} */ /** * @defgroup addmodes Constants defining add modes * * The following constants define how one collection can be added to another. * * @{ */ /** @brief Add a collection into a collection as a reference */ #define COL_ADD_MODE_REFERENCE 0 /** * @brief Embed the collection into another collection. * * The collection will become part of another collection. * After this operation the handle to the collection being added * should not be used or freed. * Embedding a collection can be done only once. * If the collection is referenced by another collection, * the operation will fail. */ #define COL_ADD_MODE_EMBED 1 /** * @brief Perform a deep copy. * * Perform a deep copy of a collection with * all its sub collections */ #define COL_ADD_MODE_CLONE 2 /** * @brief Create a flattened copy. * * Create a deep copy of a collection with * its sub collections flattening and NOT * resolving duplicates. */ #define COL_ADD_MODE_FLAT 3 /** * @brief Create a flattened copy with constructed names. * * Creates a deep copy of a collection with * its sub collections flattening and NOT * resolving duplicates. Names are constructed * in dotted notation. * For example the sub collection * named "sub" containing "foo" and * "bar" will be flattened as: * "sub.foo", "sub.bar". */ #define COL_ADD_MODE_FLATDOT 4 /** * @} */ /** * @defgroup traverseconst Constants defining traverse modes * * The following constants define how a collection can be * traversed or iterated. * * Flags defined below can generally be combined with each other. * * \ref COL_TRAVERSE_FLAT, \ref COL_TRAVERSE_SHOWSUB, * \ref COL_TRAVERSE_ONLYSUB are mutually exclusive flags. * If combined together results will be unpredictable.
* DO NOT MIX THEM IN ONE ITERATOR. * * * @{ */ /** @brief Traverse all items in the collection. */ #define COL_TRAVERSE_DEFAULT 0x00000000 /** * @brief Traverse only the top level. * * Traverse only top level * ignored if the IGNORE flag is * specified */ #define COL_TRAVERSE_ONELEVEL 0x00000001 /** * @brief Insert end collection marker. * * Call the handler once more when the * end of the collection is reached. * Specifying this flag would cause a traversing * function to call a callback once more passing * in a virtual property of type \ref COL_TYPE_END. * Good for processing nested collections. */ #define COL_TRAVERSE_END 0x00000002 /** @brief Ignore sub collections as if none is present. */ #define COL_TRAVERSE_IGNORE 0x00000004 /** * @brief Flatten the collection. * * Traversing this way would act as if * all the properties of sub collection are properties * of the root collection. The referencing properties or * headers of the referenced collections are skipped. * * If we think of the book case example * this is very useful when one wants to iterate through * all the books skipping information about * which shelf they are on. */ #define COL_TRAVERSE_FLAT 0x00000008 /** * @defgroup moreiterflag Additional iterator flags * * \note NOTE: These flags ignored by traverse functions and * can be used only in the iterator. * * @{ */ /** * @brief Include headers of sub collections. * * When one collection is embedded or referenced by another collection * there are two names we can be interested in. The name of the property * that defines the reference and the name of the embedded collection. * It is recommended that they be the same, however there may be cases * when the name of the referencing property and referenced collection * should be different. By default only the name of the referencing * property is returned while iterating through the collection and * its sub collections. Specifying this flag would cause the names * of the collection (header elements) be included into the iteration * process. * * Flag is ignored if the \ref COL_TRAVERSE_ONELEVEL flag is * specified and not ignored. * Flag is ignored is also ignored if the FLAT flag is specified. */ #define COL_TRAVERSE_SHOWSUB 0x00010000 /** * @brief Show sub collections. * * Show the header of the sub collection instead of the reference. * Flag is ignored if the \ref COL_TRAVERSE_ONELEVEL flag is * specified and not ignored. * Flag is ignored is also ignored if the FLAT flag is specified. */ #define COL_TRAVERSE_ONLYSUB 0x00020000 /** * @} */ /** * @} */ /** * @defgroup copyconst Constants defining copy modes * * The following constants define modes accepted by copy * collection function(s). * * @{ */ /** * @brief Perform a deep copy. * * Referenced collections of the donor are copied as sub * collections. */ #define COL_COPY_NORMAL 0 /** * @brief Perform a deep flat copy. * * Collection is flattened. No name construction performed. */ #define COL_COPY_FLAT 1 /** * @brief Perform a deep flat copy constructing names. * * Collection is flattened. Names are concatenated with dot. */ #define COL_COPY_FLATDOT 2 /** @brief Perform a deep copy but leave references as references. */ #define COL_COPY_KEEPREF 3 /** @brief Copy only top level collection. */ #define COL_COPY_TOP 4 /** * @} */ /** * @defgroup sortconst Constants defining sort order * * All flags can be combined in OR operation. * Flags \ref COL_SORT_ASC and \ref COL_SORT_DESC are * mutually exclusive. If both specified the * collection will be sorted in the descending order. * * @{ */ /** @brief Sort in ascending order. */ #define COL_SORT_ASC 0x00000000 /** @brief Sort in descending order. */ #define COL_SORT_DESC 0x00000001 /** @brief Sort all sub collections. */ #define COL_SORT_SUB 0x00000002 /** * @brief Sort only embedded sub collections. * * Ignored if \ref COL_SORT_SUB is not specified. */ #define COL_SORT_MYSUB 0x00000004 /** * @} */ /* Public declaration of the private data */ #ifndef COLLECTION_PRIV_H /** * @struct collection_item * @brief Opaque structure that holds one property. * * Your implementation can assume that following members * will always be members of the collection_item. * but you should use get_item_xxx functions to get them * and never access internal data directly. * * - char *property; * - int property_len; * - int type; * - int length; * - void *data; */ struct collection_item; /** * @struct collection_iterator * @brief Opaque iterator structure. * * The iterator structure is used * when one wants to traverse the collection * going through its properties and optionally * sub collections. * * Caller should never assume * anything about internals of this structure. */ struct collection_iterator; #endif /* COLLECTION_PRIV_H */ /** * @brief Create a collection * * The function will create a collection. * Each collection should have name and class. * * @param[out] ci Newly allocated collection object. * @param[in] name The name is supposed to be a unique identifier of * the collection. This is useful when the collections * are stored within other collections or inside other * aggregation objects. Caller is free to use any name. * Name should consist of the ASCII characters with codes * non less than space. Exclamation mark character is * a special character and can't be used in name of * collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] cclass Class is used to relate the collection to a specific * group of the collections of the same structure. * This is very useful when you try to represent * objects using collections and you want to check if * the objects have same structure or not. * There is no predefined name space for the collection * classes. Defining classes is left to the application * developers.
* NOTE: * If you decide to build an interface using collection * library pick a range for the classes you are * going to use and make sure that they do not collide * with other interfaces built on top of the collection. * * @return 0 - Collection was created successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the collection name. * @return EMSGSIZE - Collection name is too long. */ int col_create_collection(struct collection_item **ci, const char *name, unsigned cclass); /** * @brief Destroy a collection * * The function will destroy a collection. * * @param[in] ci Collection object. * */ void col_destroy_collection(struct collection_item *ci); /** * @brief Cleanup Callback * * Signature of the callback that needs to be used when * the collection is destroyed and a special cleanup operation * is required for items in the collection. * * @param[in] property The name of the property will * be passed in this parameter. * @param[in] property_len Length of the property name * will be passed in this parameter. * @param[in] type Type of the data will be passed * in this parameter. * @param[in] data Pointer to the data will be passed * in this parameter. * @param[in] length Length of data will be passed in * this parameter. * @param[in] custom_data Custom data will be passed in * this parameter. */ typedef void (*col_item_cleanup_fn)(const char *property, int property_len, int type, void *data, int length, void *custom_data); /** * @brief Destroy a collection with callback * * Execute a provided callback for each item * in the collection or subcollection immediately * before freeing item. The callback is executed for each * element including the collection header. * It is the responsibility of the callback implementor * to properly handle gifferent collection elements * depending upon whether it is a header, reference to * an embedded or external collection or a normal data * element. * * The function will destroy a collection. * * @param[in] ci Collection object. * @param[in] cb Cleanup callback. * @param[in] custom_data Application data passed into * the cleanup callback. * */ void col_destroy_collection_with_cb(struct collection_item *ci, col_item_cleanup_fn cb, void *custom_data); /** * @brief Copy item callback. * * Callback is used by the * \ref col_copy_collection_with_cb "col_copy_collection_with_cb" function. * Function is called after the new item is created but not yet * inserted into the target collection. * The implementer of the callback can alter the item data * or indicate to the caller that the item should be skipped. * * @param[in] item Newly allocated item that will be inserted * into the new collection. * @param[in] ext_data Data the application might want to * pass to the callback. * @param[out] skip Pointer to a variable that indicates if the * item should be skipped or not. * Set this variable to any nonzero value * and the item will be skipped. * @return 0 - Success * @return Function can return any error code. This code * will be propagated through the internal functions and * returned to the application. * */ typedef int (*col_copy_cb)(struct collection_item *item, void *ext_data, int *skip); /** * @brief Copy collection with data modification. * * Function create a deep copy of the current collection. * Calls caller provided callback before copying each item's data. * This is useful if the data needs to be resolved in some way. * The best use is when the template is copied and the values * in the template are resolved to the actual values. * The acceptable modes are defined \ref copyconst "here". * * @param[out] col_copy Newly created collection object. * @param[in] col_to_copy Collection object that will be copied. * @param[in] name_to_use Name of the new collection. * @param[in] copy_mode How to \ref copyconst "copy". * @param[in] copy_cb Pointer to a callback \ref col_copy_cb. * Can be NULL. In this case data is copied * without modification. * @param[in] ext_data Data the application might want to * pass to the callback. * * @return 0 - Collection was copied successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return Any error code returned by the callback. * */ int col_copy_collection_with_cb(struct collection_item **col_copy, struct collection_item *col_to_copy, const char *name_to_use, int copy_mode, col_copy_cb copy_cb, void *ext_data); /** * @brief Copy collection without data modification. * * Function creates a deep copy of the current collection. * It wraps the \ref col_copy_collection_with_cb function. * The acceptable modes are defined \ref copyconst "here". * * @param[out] col_copy Newly created collection object. * @param[in] col_to_copy Collection object that will be copied. * @param[in] name_to_use Name of the new collection. * @param[in] copy_mode How to \ref copyconst "copy". * * @return 0 - Collection was copied successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_copy_collection(struct collection_item **col_copy, struct collection_item *col_to_copy, const char *name_to_use, int copy_mode); /** * @brief Add collection to collection. * * Function adds one collection into another * depending upon a specified \ref addmodes "mode". * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add collection to. If NULL the collection * is added to the root collection. * @param[in] as_property Name of the property that will constitute * the reference. If NULL the name of * the collection being added will be used. * If specified the restrictions to * the name characters and length apply. * For more details about the name related * restrictions see * \ref addproperty "col_add_xxx_property" * functions. * @param[in] ci_to_add Collection to add. * @param[in] mode Specifies \ref addmodes "how" * the collection should be added. * * @return 0 - Collection was added successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * The attempt to update a property which is * a reference to a collection or a collection * name. * @return ENOENT - Property to update is not found. */ int col_add_collection_to_collection(struct collection_item *ci, const char *subcollection, const char *as_property, struct collection_item *ci_to_add, int mode); /** * @brief Search Callback * * Signature of the callback that needs to be used when * traversing a collection or looking for a specific item. * * @param[in] property The name of the property will * be passed in this parameter. * @param[in] property_len Length of the property name * will be passed in this parameter. * @param[in] type Type of the data will be passed * in this parameter. * @param[in] data Pointer to the data will be passed * in this parameter. * @param[in] length Length of data will be passed in * this parameter. * @param[in] custom_data Custom data will be passed in * this parameter. * @param[out] stop Pointer to a variable where the handler * can put nonzero to stop traversing * of the collection. * @return 0 - Success * @return Function can return any error code. This code * will be propagated through the internal functions and * returned to the application. */ typedef int (*col_item_fn)(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *stop); /** * @brief Traverse collection * * Function to traverse the entire collection * including (optionally) sub collections. * * @param[in] ci Collection object to traverse. * @param[in] mode_flags How to traverse. * See details \ref traverseconst "here". * @param[in] item_handler Application supplied callback. * It will be called for each item * in the collection including headers. * @param[in] custom_data Custom data that application * might want to pass to the callback. * * @return 0 - Collection was traversed successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return Any error code returned by the callback. * */ int col_traverse_collection(struct collection_item *ci, int mode_flags, col_item_fn item_handler, void *custom_data); /** * @brief Search and do function. * * Looks up an item in the collection based on the property and type. * Actually it is a traverse function with special traversing logic. * It traverses the whole collection but calls the supplied * callback only for the items that match the search criteria. * It is the responsibility of the caller to define how the callback * is going to indicate that the item it was looking for is found. * Function will not return error if the item is not found. * It is the responsibility of the calling application to check * the data passed in custom_data and see if the item was found and * that the action was performed. * * @param[in] ci Collection object to traverse. * @param[in] property_to_find Name of the property to find. * Parameter supports "x!y" * notation. * @param[in] type Type filter. Only properties * of the given type will match. * Can be 0 to indicate that all * types should be evaluated. * @param[in] mode_flags How to traverse the collection. * See details \ref traverseconst "here". * @param[in] item_handler Function to call when the item is found. * @param[in] custom_data Custom data passed to the callback. * * @return 0 - Operation completed successfully. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - The search criteria is incorrect. * @return ENOMEM - No memory. * @return Any error code returned by the callback. * */ int col_get_item_and_do(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, col_item_fn item_handler, void *custom_data); /** * @brief Search function to get an item. * * Convenience function to get individual item. * Caller should be aware that this is not a copy of the item * but the pointer to actual item stored in the collection. * The returned pointer should never be altered or freed by caller of the function. * The caller should be sure that the collection does not go out of scope * while the pointer to its data is in use. * Working with the internals of the collection item structure directly * may cause problems in future if the internal implementation changes. * The caller needs to be aware that function does not return * error if item is not found. The caller needs to check if * item is not NULL to determine whether something was found. * Internally function is a wrapper around the \ref col_get_item_and_do * function. * * Use \ref getitem "item management" functions to work with the item. * * @param[in] ci Collection object to traverse. * @param[in] property_to_find Name of the property to find. * Parameter supports "x!y" * notation. * @param[in] type Type filter. Only properties * of the given type will match. * Can be 0 to indicate that all * types should be evaluated. * @param[in] mode_flags How to traverse the collection. * See details \ref traverseconst "here". * @param[in] item Pointer to found item or NULL * if item is not found. * * @return 0 - No internal errors during search. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - The search criteria is incorrect. * @return ENOMEM - No memory. * */ int col_get_item(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, struct collection_item **item); /** * @brief Search function to get one of the duplicate items. * * Convenience function to get an individual item out of the list of duplicates. * Caller should be aware that this is not a copy of the item * but the pointer to actual item stored in the collection. * The returned pointer should never be altered or freed by caller * of the function. * The caller should be sure that the collection does not go out of scope * while the pointer to its data is in use. * Working with the internals of the collection item structure directly * may cause problems in future if the internal implementation changes. * If collection to search or property to find is NULL function returns NULL. * * Use \ref getitem "item management" functions to work with the item. * * @param[in] ci Collection object to traverse. * @param[in] subcollection Name of the sub collection to find * item in. If NULL, the top level collection * is used. One can use "foo!bar!baz" * notation to identify the sub collection. * @param[in] property_to_find Name of the property to find. * @param[in] type Type filter. Only properties * of the given type will match. * Can be 0 to indicate that all * types should be evaluated. * @param[in] idx Index of the duplicate to find. * 0 - any first instance * positive - N-th instance (index is 0-based) * negative - last instance * @param[in] exact If 0 then if index above is greater than * actual number of duplicates the last duplicate * if be returned. * If non-zero the funtion will return ENOENT * in case the index is greater than actual * number of duplicates. * @param[out] item Pointer to found item or NULL * if item is not found. * @return 0 No errors. * @return EINVAL Invalid argument. * @return ENOENT Item is not found. */ int col_get_dup_item(struct collection_item *ci, const char *subcollection, const char *property_to_find, int type, int idx, int exact, struct collection_item **item); /** * @brief Sort collection. * * If the sub collections are included in sorting * each collection is sorted separately (this is not a global sort). * It might be dangerous to sort sub collections if * sub collection is not owned by the current collection. * If it is a reference to an external collection * there might be an issue. To skip the collections that * externally referenced use \ref COL_SORT_MYSUB flag. * Keep in mind that if a collection is referenced * more than once by other collection and that collection * is sorted with sub collections the referenced * collection will be sorted more than once. * * NOTE: Current implementation of the sorting * function is very simple and alternative * implementations might be provided later. * * @param[in] col Collection to sort. * @param[in] cmp_flags For more information see * \ref compflags "comparison flags". * @param[in] sort_flags For more information see * \ref sortconst "sort flags". * * @return 0 - No internal errors during sorting. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_sort_collection(struct collection_item *col, unsigned cmp_flags, unsigned sort_flags); /** * @brief Delete property. * * Delete property from the collection. * It is recommended to use a more efficient function * \ref col_remove_item for the same purpose if * the property is unique or if the collection * has a known structure. * The col_delete_property function has some advantage only * if it is not known where property * resides and what is the structure of the collection. * In this case "foo!bar!baz" notation can be used in * the property_to_find argument to find and delete * the property "baz" that is in a sub collection "bar" * which is in turn a part of a collection "foo". * * @param[in] ci Collection to delete property from. * @param[in] property_to_find Property to delete. * @param[in] type Use type if names are not unique * and you know the type of the value * you want to delete. Otherwise set to 0. * @param[in] mode_flags The flags define how the collection * should be searched. For more information * see \ref traverseconst "traverse constants". * * @return 0 - Property was deleted successfully. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOMEM - No memory. * @return ENOENT - Property not found. * */ int col_delete_property(struct collection_item *ci, const char *property_to_find, int type, int mode_flags); /** * @brief Is property in the collection? * * Convenience function to check if the property * is indeed in the collection. * * @param[in] ci Collection to search. * @param[in] property_to_find Property to find. * @param[in] type Use type if names are not unique * and you know the type of the value * you want to check. Otherwise set to 0. * @param[in] mode_flags The flags define how the collection * should be searched. For more information * see \ref traverseconst "traverse constants". * @param[out] found The variable that will receive the result * of the search. * COL_NOMATCH - if not found * COL_MATCH if found * * @return 0 - Search completed successfully. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOMEM - No memory. * */ int col_is_item_in_collection(struct collection_item *ci, const char *property_to_find, int type, int mode_flags, int *found); /** * @brief Get a reference to a collection * * Get a pointer to a collection included into another collection. * If the col_to_find is NULL function returns a reference * to the top level collection. * Delete extracted collection after use to decrease reference count. * * @param[in] ci Collection to search. * @param[out] acceptor Variable that accepts pointer to * an extracted collection. * Use \ref col_destroy_collection to * free returned object reference after * use. * @param[in] col_to_find Collection to find. * "foo!bar!baz" notation can be used. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOMEM - No memory. */ int col_get_collection_reference(struct collection_item *ci, struct collection_item **acceptor, const char *col_to_find); /** * @brief Get a reference from the item * * Get a pointer to a collection from a current item * if current item is a reference to the collection. * If current item is not a reference to a collection an error * will be returned. * Delete extracted collection after use to decrease reference count. * * @param[in] item Item to extract the reference from. * @param[out] acceptor Variable that accepts pointer to * an extracted collection. * Use \ref col_destroy_collection to * free returned object reference after * use. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. */ int col_get_reference_from_item(struct collection_item *item, struct collection_item **acceptor); /** * @brief Get collection class. * * The classes of the collections can be used to convey information * about the collection's internal structure. * Some interfaces built on top of the collection might * impose restrictions on the collection structure. * For example the interface can decide that it is going * to deal with the collections that do not have sub collections * and elements of the collections are always only strings. * So the interface will define a class of the collection * and create a function that would take the strings and create * such a collection. Then other functions of that interface * would check if the provided collection is of the specified class. * If not the interface would reject the collection right away. * If the collection is of the valid class the interface might * call the validation function to make sure that this is really * the case however it needs to validate it only once and lower level * functions can rely on the class value of the collection * without performing duplicate validation. * * @param[in] ci Collection object. * @param[out] cclass Variable that will receive * the value of the class. * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_get_collection_class(struct collection_item *ci, unsigned *cclass); /** * @brief Set collection class. * * Sometimes as a result of the collection modification * the class of the collection can change. * * @param[in] ci Collection object. * @param[in] cclass New class value. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_set_collection_class(struct collection_item *ci, unsigned cclass); /** * @brief Get count of the elements. * * It is useful to know how many items are there in the collection. * * @param[in] ci Collection object. * @param[out] count Variable will receive the value * of the number of the items in * the collection. Collection * header or references to external * collections are counted as well. * This means that every collection * has at least one item - the header. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_get_collection_count(struct collection_item *ci, unsigned *count); /** * @brief Check the class of collection. * * Convenience function to check if the collection is of the specific class. * In case of internal error assumes that collection is not of the right class. * * @param[in] ci Collection object. * @param[in] cclass Class value to compare to to. * * @return 0 - If any internal error or classes do not match. * @return 1 - No error and classes do match. * */ int col_is_of_class(struct collection_item *ci, unsigned cclass); /** * @defgroup addproperty Add property functions * * Functions in this section add properties to a collection. * * All the functions in this section add a property of the specified * type to the collection object. * They are convenience wrappers around the col_insert_xxx_property * functions. * They always append property to the end of the collection. * * Common parameters for these functions are: * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * * @{ */ /** * @brief Add a string property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] string Null terminated string to add. * @param[in] length Length of the string. Should include the length * of the terminating 0. * If the length is shorter than the full string * the string will be truncated. If the length is * longer than the actual string there might be * garbage at end of the actual string. * Library will always properly NULL terminate * the string at the given position dictated * by length but in no way will inspect the validity * of the passed in data. This is left to the calling * application. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_str_property(struct collection_item *ci, const char *subcollection, const char *property, const char *string, int length); /** * @brief Add a binary property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] binary_data Data to add. * @param[in] length Length of the data. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_binary_property(struct collection_item *ci, const char *subcollection, const char *property, void *binary_data, int length); /** * @brief Add an integer property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Integer value to add. Value is signed. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_int_property(struct collection_item *ci, const char *subcollection, const char *property, int32_t number); /** * @brief Add an unsigned integer property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Unsigned integer value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_unsigned_property(struct collection_item *ci, const char *subcollection, const char *property, uint32_t number); /** * @brief Add an long property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Long integer value to add. Value is signed. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_long_property(struct collection_item *ci, const char *subcollection, const char *property, int64_t number); /** * @brief Add an unsigned long property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Unsigned long integer value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_ulong_property(struct collection_item *ci, const char *subcollection, const char *property, uint64_t number); /** * @brief Add a property of type double to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Floating point value. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_double_property(struct collection_item *ci, const char *subcollection, const char *property, double number); /** * @brief Add a Boolean property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] logical Boolean value. 0 - false, nonzero - true. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_bool_property(struct collection_item *ci, const char *subcollection, const char *property, unsigned char logical); /** * @brief Add a property of a specified type to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] type See type definitions \ref coltypes "here". * @param[in] data Data to add. * @param[in] length Length of the data. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_any_property(struct collection_item *ci, const char *subcollection, const char *property, int type, void *data, int length); /** * @defgroup addprop_withref Add properties with reference * * Family of functions that add properties to a collection * and return reference to an item that holds * a newly created property. * * All the functions in this section append a property of * the specified type to the collection object. * * Parameters for the functions and return values are the same * as for the \ref addproperty "col_add_xxx_property" functions. * The only difference is that these functions have one additional * argument: * * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @{ */ /** * @brief Add a string property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] string Null terminated string to add. * @param[in] length Length of the string. Should include the length * of the terminating 0. * If the length is shorter than the full string * the string will be truncated. If the length is * longer than the actual string there might be * garbage at end of the actual string. * Library will always properly NULL terminate * the string at the given position dictated * by length but in no way will inspect the validity * of the passed in data. This is left to the calling * application. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_str_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, char *string, int length, struct collection_item **ret_ref); /** * @brief Add a binary property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] binary_data Data to add. * @param[in] length Length of the data. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_binary_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, void *binary_data, int length, struct collection_item **ret_ref); /** * @brief Add an integer property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Integer value to add. Value is signed. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_int_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int32_t number, struct collection_item **ret_ref); /** * @brief Add an unsigned integer property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Unsigned integer value to add. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_unsigned_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, uint32_t number, struct collection_item **ret_ref); /** * @brief Add an long property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Long integer value to add. Value is signed. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_long_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int64_t number, struct collection_item **ret_ref); /** * @brief Add an unsigned long property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Unsigned long integer value to add. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_ulong_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, uint64_t number, struct collection_item **ret_ref); /** * @brief Add a property of type double to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Floating point value. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_double_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, double number, struct collection_item **ret_ref); /** * @brief Add a Boolean property to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] logical Boolean value. 0 - false, nonzero - true. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_bool_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, unsigned char logical, struct collection_item **ret_ref); /** * @brief Add a property of a specified type to a collection. * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] type See type definitions \ref coltypes "here". * @param[in] data Data to add. * @param[in] length Length of the data. * @param[out] ret_ref Reference to the newly added item that * holds the property. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection is not found. * */ int col_add_any_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int type, void *data, int length, struct collection_item **ret_ref); /** * @} */ /** * @} */ /** * @defgroup insertproperty Insert property functions * * Functions in this section insert properties into a collection * at a specified position. * * Common parameters for these functions are: * * @param[in] ci Root collection object. * @param[in] subcollection Name of the inner collection to * add property to. If NULL the property * is added to the root collection. * @param[in] disposition Defines relation point. * For more information see * \ref dispvalues "disposition defines". * @param[in] refprop Property to relate to * @param[in] idx Index (see comments below). * @param[in] flags Flags that control naming issues. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * * * Other arguments are the same as the arguments for the * \ref addproperty "col_add_xxx_property" functions. * * @return 0 - Property was insterted successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * @return ENOENT - Sub collection or property to relate to is not found. * @return EEXIST - Property with given name already exists. * This error is returned if collection * should hold unique names. * For more information see description of the * "flags" argument. * @return ENOSYS - Flag or disposition value is not implemented. * @{ */ /** @brief Insert a string property. */ int col_insert_str_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, const char *string, int length); /** @brief Insert a binary property. */ int col_insert_binary_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, void *binary_data, int length); /** @brief Insert an integer property. */ int col_insert_int_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int32_t number); /** @brief Insert an unsigned property. */ int col_insert_unsigned_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint32_t number); /** @brief Insert a long property. */ int col_insert_long_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int64_t number); /** @brief Insert an unsigned long property. */ int col_insert_ulong_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint64_t number); /** @brief Insert a property with a floating point value. */ int col_insert_double_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, double number); /** @brief Insert a property with a Boolean value. */ int col_insert_bool_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, unsigned char logical); /** @brief Insert a string property and get back a reference. */ int col_insert_str_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, const char *string, int length, struct collection_item **ret_ref); /** @brief Insert a binary property and get back a reference. */ int col_insert_binary_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, void *binary_data, int length, struct collection_item **ret_ref); /** @brief Insert an integer property and get back a reference. */ int col_insert_int_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int32_t number, struct collection_item **ret_ref); /** @brief Insert an unsigned property and get back a reference. */ int col_insert_unsigned_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint32_t number, struct collection_item **ret_ref); /** @brief Insert a long property and get back a reference. */ int col_insert_long_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int64_t number, struct collection_item **ret_ref); /** @brief Insert an unsigned long property and get back a reference. */ int col_insert_ulong_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint64_t number, struct collection_item **ret_ref); /** * @brief Insert a property with a floating * point value and get back a reference. */ int col_insert_double_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, double number, struct collection_item **ret_ref); /** @brief Insert a property with a Boolean value and get back a reference. */ int col_insert_bool_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, unsigned char logical, struct collection_item **ret_ref); /** @brief Insert property of any type and get back a reference. */ int col_insert_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int type, const void *data, int length, struct collection_item **ret_ref); /** * @} */ /** * @defgroup updateproperty Update property functions * * Functions in this section update properties in a collection. * * All update functions search the property using the * internal traverse function. * Use same "x!y" notation to specify a property. * For more details about the search logic see * \ref col_get_item_and_do function. * * The existing value of the property is destroyed and lost. * * It is not possible to rename the property using these functions. * To do more advanced modifications see \ref col_modify_item function * and \ref modwrap "item modification wrappers" . * * Common parameters for these functions are: * * @param[in] ci Root collection object. * @param[in] property Name of the property. * @param[in] mode_flags Specify how the collection * should to be traversed. * * The rest of the arguments specify the new values for * the property. For more details about these arguments see * the description of the \ref addproperty "col_add_xxx_property" * corresponding function. * * * @return 0 - Property was updated successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * The attempt to update a property which is * a reference to a collection or a collection * name. * @return ENOENT - Property to update is not found. * * @{ */ /** * Update a property with a string value. * Length should include the terminating 0. */ int col_update_str_property(struct collection_item *ci, const char *property, int mode_flags, char *string, int length); /** * Update a property with a binary value. */ int col_update_binary_property(struct collection_item *ci, const char *property, int mode_flags, void *binary_data, int length); /** * Update a property with an integer value. */ int col_update_int_property(struct collection_item *ci, const char *property, int mode_flags, int32_t number); /** * Update a property with an unsigned value. */ int col_update_unsigned_property(struct collection_item *ci, const char *property, int mode_flags, uint32_t number); /** * Update a property with a long value. */ int col_update_long_property(struct collection_item *ci, const char *property, int mode_flags, int64_t number); /** * Update a property with an unsigned long value. */ int col_update_ulong_property(struct collection_item *ci, const char *property, int mode_flags, uint64_t number); /** * Update a property with a floating point value. */ int col_update_double_property(struct collection_item *ci, const char *property, int mode_flags, double number); /** * Update a property with a Boolean value. */ int col_update_bool_property(struct collection_item *ci, const char *property, int mode_flags, unsigned char logical); /** * Update a property with a value by specifying type * and value. See definitions of the type constants * \ref coltypes "here". * All other col_update_xxx_property functions are wrappers * around this one. */ int col_update_property(struct collection_item *ci, const char *property, int type, void *new_data, int length, int mode_flags); /** * @} */ /** * @defgroup getitem Item management * * Group of functions that allows retrieving individual elements * of the \ref collection_item hiding the internal implementation. * * @{ */ /** * @defgroup compflags Comparison flags * * This section describes the flags used in item comparison. * * Flags: * - \ref COL_CMPIN_PROP_EQU * - \ref COL_CMPIN_PROP_BEG * - \ref COL_CMPIN_PROP_MID * - \ref COL_CMPIN_PROP_END * * are mutually exclusive. * * All other flags can be provided in any combination. * * @{ */ /** @brief Properties should be exactly equal */ #define COL_CMPIN_PROP_EQU 0x000000004 /** @brief Properties should start with the same substring. */ #define COL_CMPIN_PROP_BEG 0x000000005 /** @brief One property should be a substring of another. */ #define COL_CMPIN_PROP_MID 0x000000006 /** @brief Properties should have the same substring at the end. */ #define COL_CMPIN_PROP_END 0x000000007 /** * @brief Make sure that there is a dot. * * Useful with _BEG, _MID and _END flags to check that the there is * a dot (if present) in the right place (before, after or both). * For example the first item is named "foo.bar" and the second * is "bar". Using _END the "bar" will be found but if _DOT flag is * used too the function will also check if there was a "." before the found * string in this case. * Ignored in case of _EQU. */ #define COL_CMPIN_PROP_DOT 0x000000008 /** @brief Compare property lengths. */ #define COL_CMPIN_PROP_LEN 0x000000010 /** @brief Compare types. */ #define COL_CMPIN_TYPE 0x000000020 /** @brief Compare data lengths. */ #define COL_CMPIN_DATA_LEN 0x000000040 /** * @brief Compare data. * * Compares data (up to the length of the second one) * if type is the same. If type is different * function will assume data is different * without performing actual comparison. */ #define COL_CMPIN_DATA 0x000000080 /** * @} */ /** * @defgroup outflags Comparison results flags * * This section describes the flags set as a result of * a comparison operation. * * @{ */ /** * @brief Second item's property is greater. * * If _EQU was specified and the property of the second item * is greater the following bit will be set */ #define COL_CMPOUT_PROP_STR 0x00000001 /** * @brief Second item's property is longer. * * If told to compare property lengths * and the second is longer this bit will be set. */ #define COL_CMPOUT_PROP_LEN 0x00000002 /** * @brief Second item's data is longer. * * If told to compare data lengths * and second is longer this bit will be set */ #define COL_CMPOUT_DATA_LEN 0x00000004 /** * @brief Second item's data is greater. * * If told to compare data * and types are the same, then * if the second one is greater this bit will * be set. If data is binary flag is never set. */ #define COL_CMPOUT_DATA 0x00000008 /** * @} */ /** * @defgroup dispvalues Disposition constants * * Possible dispositions for insert, extract and delete function(s). * Not all of these dispositions are implemented day one. * If disposition is not implemented the function * will return error ENOSYS. * * Other dispositions might be possible in future. * * @{ */ /** * @brief Relate to the end of the collection * * For "insert": * - Add property to the end of the collection. * * For "extract" or "delete": * - Extract or delete the last property in the collection. */ #define COL_DSP_END 0 /** * @brief Relate to the beginning of the collection * * For "insert": * - Add property to the beginning of the collection right after the header. * * For "extract" or "delete": * - Extract or delete the first property in the collection. * This is the one right after the header. */ #define COL_DSP_FRONT 1 /** * @brief Before the given property * * For "insert": * - Add property before the referenced property. * * For "extract" or "delete": * - Extract or delete the property that stands * before the referenced property in the collection. * If given property is the first in the collection * ENOENT is returned. */ #define COL_DSP_BEFORE 2 /** * @brief After the given property * * For "insert": * - Add property immediately the referenced property. * * For "extract" or "delete": * - Extract or delete the property that stands * after the referenced property in the collection. * If given property is the last in the collection * ENOENT is returned. */ #define COL_DSP_AFTER 3 /** * @brief Use index * * For "insert": * - The COL_DSP_INDEX adds the item as N-th item after header in the list. * Index is zero based. * If there are less than N items in the list the item is added to the end. * The index value of 0 means that the item will be added immediately * after the header. Index of 1 will mean that it is added after first data * item and so on. * * For "extract" or "delete": * - In case of extraction or deletion the N-th item of the collection * will be extracted or deleted. * Index is zero based. * If there are less than N+1 items in the list the function will return ENOENT. * */ #define COL_DSP_INDEX 4 /** * @brief Use first among duplicates * * This mode applies only to the list of duplicate * properties that are going one after another. * * For "insert": * - Add property as a first dup of the given property. * The property name is taken from the item * and the value refprop is ignored. * * For "extract" or "delete": * - Delete or extract first duplicate property. * The property name is taken from the refprop. * The property will be extracted or deleted if found * regardless of whether there are any duplicates or not. */ #define COL_DSP_FIRSTDUP 5 /** * @brief Use last among duplicates * * This mode applies only to the list of duplicate * properties that are going one after another. * * For "insert": * - Add property as the last dup of the given property. * The property name is taken from the item * and the value refprop is ignored. * * For "extract" or "delete": * - Delete or extract the last duplicate of the property. * The property name is taken from the refprop. * Extracts or deletes last duplicate property in the uninterrupted * sequence of properties with the same name. * The property will be extracted or deleted if found * regardless of whether there are any duplicates or not. */ #define COL_DSP_LASTDUP 6 /** * @brief Use N-th among duplicates * * This mode applies only to the list of duplicate * properties that are going one after another. * * For "insert": * - Add property as a N-th dup of the given property. * The property name is taken from the item * and the value refprop is ignored. * Index is zero based. * The COL_DSP_NDUP is used in case of the multi value property * to add a new property with the same name into specific place * in the list of properties with the same name. * The index of 0 will mean to add the property before the first * instance of the property with the same name. * If the property does not exist ENOENT will be returned. * If the index is greater than the last property with the same * name the item will be added immediately after last * property with the same name. * * For "extract" or "delete": * - Delete or extract N-th duplicate property. * Index is zero based. * The property name is taken from the refprop. * If index is greater than number of duplicate * properties in the sequence ENOENT is returned. * */ #define COL_DSP_NDUP 7 /** * @brief Use last among nonsequential duplicates * * This mode applies to the list of duplicates that might be scattered * across the collection * * For "insert": * - Add property as the last dup of the given property. * The property name is taken from the item * and the value refprop is ignored. * * For "extract" or "delete": * - Delete or extract the last duplicate of the property. * The property name is taken from the refprop. * Extracts or deletes last duplicate property in the uninterrupted * sequence of properties with the same name. * The property will be extracted or deleted if found * regardless of whether there are any duplicates or not. */ #define COL_DSP_LASTDUPNS 8 /** * @brief Use N-th among nonsequential duplicates * * This mode applies only to the list of duplicate * properties that are going one after another. * * For "insert": * - Add property as a N-th dup of the given property. * The property name is taken from the item * and the value refprop is ignored. * Index is zero based. * The COL_DSP_NDUPNS is used in case of the multi value property * to add a new property with the same name into specific place * in the list of properties with the same name. * The index of 0 will mean to add the property before the first * instance of the property with the same name. * If the property does not exist ENOENT will be returned. * If the index is greater than the last property with the same * name the item will be added immediately after last * property with the same name. * * For "extract" or "delete": * - Delete or extract N-th duplicate property. * Index is zero based. * The property name is taken from the refprop. * If index is greater than number of duplicate * properties in the sequence ENOENT is returned. * */ #define COL_DSP_NDUPNS 9 /** * @} */ /** * @defgroup insflags Flags used in insert item functions * * Flags that can be used with insert functions. * * In future can more flags might be added. * * NOTE: Use of the duplicate checking flags is costly * since it requires a forward look up of the whole * collection before the item is inserted. * Do not use it until it is absolutely necessary. * * @{ */ /** @brief This is the default mode - no dup checks on insert */ #define COL_INSERT_NOCHECK 0 /** * @brief Check for duplicate name and overwrite. * Position arguments are ignored. */ #define COL_INSERT_DUPOVER 1 /** * @brief Check for duplicate name and type and overwrite. * Position arguments are ignored. */ #define COL_INSERT_DUPOVERT 2 /** @brief Return error EEXIST if the entry with the same name exists. */ #define COL_INSERT_DUPERROR 3 /** * @brief Return error EEXIST if the entry * with the same name and type exists. */ #define COL_INSERT_DUPERRORT 4 /** @brief Check for duplicates, overwrite, * extract and then move to the position requested. */ #define COL_INSERT_DUPMOVE 5 /** @brief Check for duplicate name and type, overwrite, * extract and then move to the position requested. */ #define COL_INSERT_DUPMOVET 6 /** * @} */ /** * @brief Get item property. * * Get name of the property from the item. If the item is a header * the name of the property is the name of the collection. * The element that denotes the collection header has * type \ref COL_TYPE_COLLECTION. * Optionally the property length can be retrieved too. * * @param[in] ci Item to get property from. * If item is invalid the function * will cause a segment violation. * @param[out] property_len If not NULL the variable * will receive the length * of the property not counting * terminating 0. * * @return Property name. * */ const char *col_get_item_property(struct collection_item *ci, int *property_len); /** * @brief Get item type. * * Get type from the item. * * @param[in] ci Item to get type from. * If item is invalid the function * will cause a segment violation. * * @return Item type. * */ int col_get_item_type(struct collection_item *ci); /** * @brief Get value length from the item. * * Get value length from the item. For strings this includes * NULL terminating zero. * * @param[in] ci Item to get value length from. * If item is invalid the function * will cause a segment violation. * * @return Value length. * */ int col_get_item_length(struct collection_item *ci); /** * @brief Get value from the item. * * Get value from the item. * * @param[in] ci Item to get value from. * If item is invalid the function * will cause a segment violation. * * @return Property value. * */ void *col_get_item_data(struct collection_item *ci); /** * @brief Get hash value from the item. * * Get hash value from the item. The hash value is * 64-bit hash created from the property name. * It is done to optimize the searches. * * This function is exposed for some corner cases * that require low level operations, for example * for custom search callbacks to take advantage * of the internal hashes. * * @param[in] ci Item to get hash from. * If item is invalid the function * will cause a segment violation. * * @return Hash value. * */ uint64_t col_get_item_hash(struct collection_item *ci); /** * @brief Calculate hash value for a string. * * Calculates hash value of the string using internal hashing * algorithm. Populates "length" with length * of the string not counting 0. * * This function is useful if you want to build a custom * search or collection sorting function. * * @param[in] string String to hash. If NULL hash is 0. * @param[in] sub_len If it is greater than zero * it is used to count how many * characters from string should * be included into hash calculation. * If 0 the actual length of the string * is determined and used. * @param[out] length Will receive the calculated length * of the provided string. * Length argument can be NULL. * * @return Hash value. */ uint64_t col_make_hash(const char *string, int sub_len, int *length); /** * @brief Compare two items. * * The second item is evaluated against the first. * Function returns 0 if two items are the same * and non-zero otherwise. * The \ref compflags "in_flags" is a bit mask that * defines how the items should be compared. * * If items are different they might be sorted following * some order. For example one can order items by name * but not by type. * If the result of the function is non-zero * the \ref outflags "out_flags" (if provided) will be * set to indicate if the second item is greater * then the first. * * @param[in] first First item to compare. * @param[in] second Second item to compare. * @param[in] in_flags See \ref compflags "comparison flags". * @param[out] out_flags See \ref outflags "output flags". * * * @return 0 if items are the same and nonzero otherwise. */ int col_compare_items(struct collection_item *first, struct collection_item *second, unsigned in_flags, unsigned *out_flags); /** * @brief Modify any item element. * * This function is useful if you want to modify the item that * you got as a result of \ref iterfunc "iterating" through * collection or by calling \ref col_get_item. * Previous type and data of the item is destroyed. * * If you want to rename an item provide a new name in the property * argument otherwise keep it NULL. * * If you want the data to remain unchanged use 0 as a length parameter. * * If the item is a reference or a collection and you attempt to change * the data, i.e. length is not 0, the call will return an error EINVAL. * If the item is a reference or a collection it can only be renamed. * * The are several convenience function that are wrappers * around this function. For more information * see \ref modwrap "item modification wrappers". * * @param[in] item Item to modify. * @param[in] property Property name. Use NULL to leave the property * unchanged. * @param[in] type See \ref coltypes "types" for more information. * @param[in] data New value. * @param[in] length New value. Use 0 to leave the value and its type * unchanged. * * @return 0 - Item was successfully modified. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * The attempt to modify an item which is * a reference to a collection or a collection * name. */ int col_modify_item(struct collection_item *item, const char *property, int type, const void *data, int length); /** * @defgroup modwrap Item modification wrappers * * The functions in this section are convenience wrappers * around \ref col_modify_item. * They return same error codes. * * @{ */ /** * @brief Modify item property. * * This function is a convenience wrapper around \ref col_modify_item. * It is equivalent to: col_modify_item(item, property, 0, NULL, 0); * */ int col_modify_item_property(struct collection_item *item, const char *property); /** * @brief Modify item value to be a string. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided string. * If property is not NULL it also renames the property. * If the length argument is not zero the string will be truncated to * this length. If the length is 0 the length will be calculated based * on the length of the actual string. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_str_item(struct collection_item *item, const char *property, const char *string, int length); /** * @brief Modify item value to be a binary blob. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided binary buffer. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_binary_item(struct collection_item *item, const char *property, void *binary_data, int length); /** * @brief Modify item value to be a Boolean. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided logical value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_bool_item(struct collection_item *item, const char *property, unsigned char logical); /** * @brief Modify item value to be an integer. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided integer value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_int_item(struct collection_item *item, const char *property, int32_t number); /** * @brief Modify item value to be a long integer. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided long integer value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_long_item(struct collection_item *item, const char *property, int64_t number); /** * @brief Modify item value to be an unsigned long. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided unsigned long value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_ulong_item(struct collection_item *item, const char *property, uint64_t number); /** * @brief Modify item value to be an unsigned integer. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided unsigned integer value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_unsigned_item(struct collection_item *item, const char *property, uint32_t number); /** * @brief Modify item value to be a floating point. * * This function is a convenience wrapper around \ref col_modify_item. * It sets a value of the item to a provided floating point value. * If property is not NULL it also renames the property. * Original value is always destroyed. * * @return - same error values as \ref col_modify_item. */ int col_modify_double_item(struct collection_item *item, const char *property, double number); /** * @} */ /** * @brief Extract item from the collection. * * Function to find and remove an item from the collection. * Function does not destroy the item instead it returns a reference * to the item so it can be used later and inserted back into this or * other collection. * The function assumes that the caller knows the collection * the property is stored in. * The header of the collection can't be extracted with this function * but the reference to the collection can. * * Function allows specifying relative position of the item in the * collection. One can specify that he wants to extract an item * that is first in the collection or last, or after other item * in the collection. For more details see parameter definitions. * * After extracting the item from the collection the caller has to * either insert it back into some collection using \ref col_insert_item * or delete it using \ref col_delete_item. * * * @param[in] ci Collection object. * @param[in] subcollection Name of the sub collection to extract * item from. If NULL, the top level collection * is used. One can use "foo!bar!baz" * notation to identify the sub collection. * @param[in] disposition Constant that controls how the relative * position of the item to extract is determined. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should extract next item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to extract. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] type Type filter. Only the item of the matching * type will be used. It can be a bit mask of * more than one type. Use 0 if you do not * need to filter by type. * @param[out] ret_ref Variable will receive the value of the * pointer to the extracted item. * * @return 0 - Item was successfully extracted. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * extracting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. */ int col_extract_item(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, int type, struct collection_item **ret_ref); /** * @brief Extract item from the current collection. * * Function is similar to the \ref col_extract_item. * It acts exactly the same as \ref col_extract_item when the * subcollection parameter of the \ref col_extract_item is set to NULL. * * @param[in] ci Collection object. * @param[in] disposition Constant that controls how the relative * position of the item to extract is determined. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should extract next item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to extract. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] type Type filter. Only the item of the matching * type will be used. It can be a bit mask of * more than one type. Use 0 if you do not * need to filter by type. * @param[out] ret_ref Variable will receive the value of the * pointer to the extracted item. * * @return 0 - Item was successfully extracted. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * extracting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. */ int col_extract_item_from_current(struct collection_item *ci, int disposition, const char *refprop, int idx, int type, struct collection_item **ret_ref); /** * @brief Remove item from the collection. * * Function internally calls \ref col_extract_item and then * \ref col_delete_item for the extracted item. * * Function is similar to \ref col_delete_property function * but allows more specific information about what item (property) * to remove. * * The header will not be considered for deletion. * * @param[in] ci Collection object. * @param[in] subcollection Name of the sub collection to remove * item from. If NULL, the top level collection * is used. One can use "foo!bar!baz" * notation to identify the sub collection. * @param[in] disposition Constant that controls how the relative * position of the item to remove is determined. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should remove next item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to remove. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] type Type filter. Only the item of the matching * type will be used. It can be a bit mask of * more than one type. Use 0 if you do not * need to filter by type. * * @return 0 - Item was successfully removed. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * deleting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. */ int col_remove_item(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, int type); /** * @brief Remove item from the collection. * * Function internally calls \ref col_extract_item and then * \ref col_delete_item for the extracted item. * * Function is similar to \ref col_delete_property function * but allows more specific information about what item (property) * to remove. * * The header will not be considered for deletion. * * @param[in] ci Collection object. * @param[in] subcollection Name of the sub collection to remove * item from. If NULL, the top level collection * is used. One can use "foo!bar!baz" * notation to identify the sub collection. * @param[in] disposition Constant that controls how the relative * position of the item to remove is determined. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should remove next item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to remove. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] type Type filter. Only the item of the matching * type will be used. It can be a bit mask of * more than one type. Use 0 if you do not * need to filter by type. * @param[in] cb Callback to use. * @param[in] custom_data Caller defined data that can be passed * to the callback. * * @return 0 - Item was successfully removed. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * deleting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. */ int col_remove_item_with_cb(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, int type, col_item_cleanup_fn cb, void *custom_data); /** * @brief Remove item from the current collection. * * Function is similar to the \ref col_remove_item. * It acts exactly the same as \ref col_remove_item when the * subcollection parameter of the \ref col_remove_item is set to NULL. * * @param[in] ci Collection object. * @param[in] disposition Constant that controls how the relative * position of the item to remove is determined. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should remove next item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to remove. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] type Type filter. Only the item of the matching * type will be used. It can be a bit mask of * more than one type. Use 0 if you do not * need to filter by type. * * @return 0 - Item was successfully removed. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * deleting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. */ int col_remove_item_from_current(struct collection_item *ci, int disposition, const char *refprop, int idx, int type); /** * @brief Insert item to the collection. * * WARNING: Only use this function to insert items * that were extracted using \ref col_extract_item or * \ref col_extract_item_from_current. * NEVER use it with items that were returned by: * - \ref col_get_item * - \ref addproperty "add property" functions * - \ref addprop_withref "add property with reference" functions * - \ref insertproperty "instert property" functions. * * The fundamental difference is that when you extracted item * using col_extract_item() it stops to be managed by a collection. * With such item you can: * - a) Insert this item into another (or same) collection * - b) Get item information using corresponding item management functions. * - c) Destroy item using col_delete_item(). * * You are required to do either a) or c) with such item. * * @param[in] ci Collection object. * @param[in] subcollection Name of the sub collection to insert * item into. If NULL, the top level collection * is used. One can use "foo!bar!baz" * notation to identify the sub collection. * @param[in] item Item to insert. * @param[in] disposition Constant that controls where to insert * the item. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should insert the item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to insert. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] flags Flags that control naming issues. * See \ref insflags "insert flags" * for more details. * * @return 0 - Item was successfully extracted. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * extracting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. * @return EEXIST If duplicate name/type checking is turned on * and duplicate name/type is detected. * */ int col_insert_item(struct collection_item *ci, const char *subcollection, struct collection_item *item, int disposition, const char *refprop, int idx, unsigned flags); /** * @brief Insert item to the current collection. * * Function is equivalent to \ref col_insert_item with * subcollection parameter equal NULL. * * @param[in] ci Collection object. * @param[in] item Item to insert. * @param[in] disposition Constant that controls where to insert * the item. * For more information see \ref dispvalues * "disposition constants". * @param[in] refprop Name of the property to relate to. * This can be used to specify that function * should insert the item after the item * with this name. Leave NULL if the * disposition you are using does not * relate to an item in the collection. * @param[in] idx Index of the property to insert. * Useful for multi-value properties where * several properties have same name in a row. * @param[in] flags Flags that control naming issues. * See \ref insflags "insert flags" * for more details. * * @return 0 - Item was successfully extracted. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * @return ENOENT - Sub collection is not found. * The position can't be determined. For example * extracting next item after item with name "foo" * will cause this error if item "foo" is the last * item in the collection. There are other cases * when this error can be returned but the common * theme is that something was not found. * @return ENOSYS Unknown disposition value. * @return EEXIST If duplicate name/type checking is turned on * and duplicate name/type is detected. * */ int col_insert_item_into_current(struct collection_item *ci, struct collection_item *item, int disposition, const char *refprop, int idx, unsigned flags); /** * @brief Delete extracted item. * * NEVER use this function to delete an item * that was not previously extracted from the collection. * * There is currently no function to create an item aside and * then insert it into the collection so the col_delete_item * has only one use. In future this may change. * * @param[in] item Item to delete. * */ void col_delete_item(struct collection_item *item); /** * @brief Delete extracted item with callback. * * This function is similar to \ref col_delete_item but allows * passing a callback function so that value stored in the collection can * be properly distroyed. * * @param[in] item Item to delete. * @param[in] cb Callback to use. * @param[in] custom_data Caller defined data that can be passed to the callback. * */ void col_delete_item_with_cb(struct collection_item *item, col_item_cleanup_fn cb, void *custom_data); /** * @} */ /** * @defgroup iterfunc Iterator interface * * The functions in this section allow iterating * through a collection in a loop where the caller * implements the loop. It is different from the search and * traverse functions described in other sections because those * functions implement the loop themselves and call provided * callback in a specific situation. * * @{ */ /** * @brief Bind iterator to a collection. * * This function creates an iterator object and binds it to the collection. * * @param[out] iterator Newly created iterator object. * @param[in] ci Collection to iterate. * @param[in] mode_flags Flags define how to traverse the collection. * For more information see \ref traverseconst * "constants defining traverse modes". * * @return 0 - Iterator was created successfully. * @return ENOMEM - No memory. * @return EINVAL - The value of some of the arguments is invalid. * */ int col_bind_iterator(struct collection_iterator **iterator, struct collection_item *ci, int mode_flags); /** * @brief Unbind the iterator from the collection. * * @param[in] iterator Iterator object to free. */ void col_unbind_iterator(struct collection_iterator *iterator); /** * @brief Iterate collection. * * Advance to next item in the collection. After the iterator is * bound it does not point to any item in the collection. * Use this function in the loop to step through all items * in the collection. See unit test for code examples. * * @param[in] iterator Iterator object to use. * @param[out] item Pointer to the collection item. * Do not destroy or alter this pointer * in any ways. To access the internals * of the item use \ref getitem "item management" * functions. * The value of the item will be set to NULL if * the end of the collection is reached. * * @return 0 - Item was successfully retrieved. * @return EINVAL - The value of some of the arguments is invalid. */ int col_iterate_collection(struct collection_iterator *iterator, struct collection_item **item); /** * @brief Move up * * Stop processing this sub collection and move to the next item in the * collection some levels up. * * @param[in] iterator Iterator object to use. * @param[in] level Indicates how many levels up you want to jump. * If 0 - call is a no op. * If the depth is less then requested level * the iterator will get to the 0 level and * next call to \ref col_iterate_collection * will return NULL item. * * @return 0 - Iterator was successfully repositioned. * @return EINVAL - The value of some of the arguments is invalid. */ int col_iterate_up(struct collection_iterator *iterator, unsigned level); /** * @brief Get current depth * * How deep are we relative to the top level? * This function will report depth that in some cases might look * misleading. The reason is that traverse flags affect the internal * level we are on at each moment. * For example the default traverse behavior is to show * references to the sub collections. * So when the item reference is returned the * depth automatically adjusted to level inside the sub collection. * So if function is called in this situation the level returned will * denote the level inside collection. * Now imagine that this collection is empty so the attempt to read * element will push you automatically one level up (in absence of the * \ref COL_TRAVERSE_END flag). If in this situation you encounter another * collection the reference will be returned and level automatically * adjusted to level inside the collection. * The point is that the level is reliable only after * a data item was returned. * To avoid this ambiguity another function \ref col_get_item_depth * was introduced. * * @param[in] iterator Iterator object to use. * @param[in] depth The variable will receive the depth * the iterator is on. The value is 0 * if the iterator is on the top level. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. */ int col_get_iterator_depth(struct collection_iterator *iterator, int *depth); /** * @brief Get depth of the last returned item. * * @param[in] iterator Iterator object to use. * @param[in] depth The variable will receive the depth * the iterator is on. * Item from the top level will have * depth equal to 0. The value of 0 * will also be returned if no item * was read so far. * * @return 0 - Success. * @return EINVAL - The value of some of the arguments is invalid. */ int col_get_item_depth(struct collection_iterator *iterator, int *depth); /** * @brief Pin iterator * * Pins down the iterator to loop around current point. * * This feature allows some search optimization. * The idea is to be able to put a 'pin' * into a specific place while iterating * the collection and make this place a new * "wrap around" place for the collection. * This means that next time you * iterate this collection you will start * iterating from the next item and * the item you got before setting pin will be * the last in your iteration cycle. * * Here is the example: * * Assume you have two collections that you need * to compare and perform some action on collection * 1 based on the presence of the item in collection 2. * - Collection1 = A, B, C, D, E, F * - Collection2 = A, C, F * * The usual approach is to try A from collection 1 * against A, B, C from collection 2. "A" will be found * right away. But to find "F" it has to be compared * to "A" and "C" first. The fact that the collections * are to some extent ordered can in some cases * help to reduce the number of comparisons. * If we found "C" in the list we can put a "pin" * into the collection there causing the iterator * to warp at this "pin" point. Since "D" and "E" * are not in the second collection we will have * to make same amount of comparisons in traditional * or "pinned" case to not find them. * To find "F" in pinned case there will be just one * comparison. * - Traditional case = 1 + 3 + 2 + 3 + 3 + 3 = 15 * - Pinned case = 1 + 3 + 1 + 3 + 3 + 1 = 12 * * It is a 20% comparison reduction. * * @param[in] iterator Iterator object to use. */ void col_pin_iterator(struct collection_iterator *iterator); /** * @brief Rewind iterator * * Rewinds iterator to the current pin point which is by * default the beginning of the collection until changed by * \ref col_pin_iterator function. * * @param[in] iterator Iterator object to use. */ void col_rewind_iterator(struct collection_iterator *iterator); /** * @} */ /** * @} */ #endif ding-libs-0.6.2/collection/collection.pc.in000066400000000000000000000005121417260640400206100ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: collection Description: A data-type to collect data in a heirarchical structure for easy iteration and serialization Version: @COLLECTION_VERSION@ Libs: -L${libdir} -lcollection Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/collection/collection_cmp.c000066400000000000000000000336661417260640400207020ustar00rootroot00000000000000/* COLLECTION LIBRARY Function to compare items. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #include #include #include "trace.h" /* The collection should use the real structures */ #include "collection_priv.h" #include "collection.h" #define NONZERO 1 #define PROP_MSK 0x000000007 #define TYPED_MATCH(type) \ do { \ if (*((type *)(first->data)) != *((type *)(second->data))) { \ result = NONZERO; \ if ((out_flags) && \ (*((type *)(first->data)) < *((type *)(second->data)))) { \ *out_flags |= COL_CMPOUT_DATA; \ } \ } \ } while(0) /* Function to compare two items */ int col_compare_items(struct collection_item *first, struct collection_item *second, unsigned in_flags, unsigned *out_flags) { int result = 0; unsigned mode; int cmpres = 0; char *substr; TRACE_FLOW_STRING("col_compare_items", "Entry."); /* If any of the arguments is NULL return * that they are different. */ if ((first == NULL) || (second == NULL)) { TRACE_INFO_STRING("One of the items is NULL", ""); return NONZERO; } /* Check if we are told to compare something */ if (!in_flags) { TRACE_INFO_NUMBER("No flags specified", in_flags); return NONZERO; } if (out_flags) *out_flags = 0; /* Start comparison */ mode = in_flags & PROP_MSK; if (mode > 0 ) { /* We are told to compare the properties */ switch(mode) { case COL_CMPIN_PROP_EQU: /* looking for exact match */ /* Compare hashes and lengths first */ if ((first->phash == second->phash) && (first->property_len == second->property_len)) { /* Collections are case insensitive, sorry... */ cmpres = strncasecmp(first->property, second->property, second->property_len); if (cmpres != 0) { result = NONZERO; if (cmpres < 0) { /* Second is greater */ if (out_flags) *out_flags |= COL_CMPOUT_PROP_STR; } } } else { result = NONZERO; /* They are different so check if we need to compare? */ if (out_flags) { cmpres = strncasecmp(first->property, second->property, second->property_len); if (cmpres < 0) { /* Second is greater */ *out_flags |= COL_CMPOUT_PROP_STR; } } } break; case COL_CMPIN_PROP_BEG: /* looking for beginning */ /* Compare lengths first */ if (first->property_len >= second->property_len) { cmpres = strncasecmp(first->property, second->property, second->property_len); if (cmpres == 0) { /* Check we need to validate for dot */ if (in_flags & COL_CMPIN_PROP_DOT) { if ((first->property[second->property_len] != '\0') && (first->property[second->property_len] != '.')) { result = NONZERO; } } } else result = NONZERO; } else result = NONZERO; break; case COL_CMPIN_PROP_MID: /* looking for middle */ /* Compare lengths first */ if (first->property_len >= second->property_len) { substr = strcasestr(first->property, second->property); if (substr != NULL) { /* Check we need to validate for dot */ if (in_flags & COL_CMPIN_PROP_DOT) { /* Check if we have a dot before or after */ if (((substr != first->property) && (first->property[(substr - first->property) - 1] != '.')) || ((substr[second->property_len] != '\0') && (substr[second->property_len] != '.'))) { result = NONZERO; } } } else result = NONZERO; } else result = NONZERO; break; case COL_CMPIN_PROP_END: /* looking for end */ /* Compare lengths first */ if (first->property_len >= second->property_len) { substr = first->property + (first->property_len - second->property_len); cmpres = strncasecmp(substr, second->property, second->property_len); if (cmpres == 0) { /* Check we need to validate for dot */ if (in_flags & COL_CMPIN_PROP_DOT) { if ((substr != first->property) && (first->property[(substr - first->property) - 1] != '.')) { result = NONZERO; } } } else result = NONZERO; } else result = NONZERO; break; default: result = NONZERO; break; } } /* Check if we are told to compare property lengths */ if (in_flags & COL_CMPIN_PROP_LEN) { if (first->property_len != second->property_len) { result = NONZERO; /* Do we need to tell who is greater? */ if ((out_flags) && (first->property_len < second->property_len)) { *out_flags |= COL_CMPOUT_PROP_LEN; } } } /* Check if we are told to compare types */ if (in_flags & COL_CMPIN_TYPE) { if (first->type != second->type) result = NONZERO; } /* Check if we need to compare data length */ if (in_flags & COL_CMPIN_DATA_LEN) { if (first->length != second->length) { result = NONZERO; /* Do we need to tell who is greater? */ if ((out_flags) && (first->length < second->length)) { *out_flags |= COL_CMPOUT_DATA_LEN; } } } /* Check if we need to compare data */ if (in_flags & COL_CMPIN_DATA) { if (first->type == second->type) { switch(first->type) { case COL_TYPE_STRING: if (first->length == second->length) { cmpres = strncmp((const char *)first->data, (const char *)second->data, first->length); if (cmpres != 0) { result = NONZERO; if (cmpres < 0) { /* Second is greater */ if (out_flags) *out_flags |= COL_CMPOUT_DATA; } } } else result = NONZERO; break; case COL_TYPE_BINARY: if (first->length == second->length) { cmpres = memcmp(first->data, second->data, first->length); if (cmpres != 0) result = NONZERO; } else result = NONZERO; break; case COL_TYPE_INTEGER: /* Use macro to match data */ TYPED_MATCH(int); break; case COL_TYPE_UNSIGNED: /* Use macro to match data */ TYPED_MATCH(unsigned); break; case COL_TYPE_LONG: /* Use macro to match data */ TYPED_MATCH(long); break; case COL_TYPE_ULONG: /* Use macro to match data */ TYPED_MATCH(unsigned long); break; case COL_TYPE_DOUBLE: /* Use macro to match data */ TYPED_MATCH(double); break; case COL_TYPE_BOOL: /* Use macro to match data */ TYPED_MATCH(unsigned char); break; /* These are never same */ case COL_TYPE_COLLECTION: case COL_TYPE_COLLECTIONREF: case COL_TYPE_END: default: result = NONZERO; break; } } else result = NONZERO; } TRACE_FLOW_NUMBER("col_compare_items. Exit. Returning:", result); return result; } /* Sort collection */ int col_sort_collection(struct collection_item *col, unsigned cmp_flags, unsigned sort_flags) { int error = EOK; struct collection_item *current; struct collection_header *header; struct collection_item **array; struct collection_item *temp_item; struct collection_item *other; size_t size; int ind, last; int i, j; int res; unsigned out_flags; TRACE_FLOW_STRING("col_sort_collection", "Entry."); TRACE_INFO_NUMBER("Comparison flags:", cmp_flags); TRACE_INFO_NUMBER("Sort flags:", sort_flags); if ((col == NULL) || (col->type != COL_TYPE_COLLECTION)) { TRACE_ERROR_STRING("Collecton must not ne NULL", ""); return EINVAL; } /* This will be a fast and simple implementation for now */ header = (struct collection_header *)(col->data); if ((sort_flags & COL_SORT_SUB) && (sort_flags & COL_SORT_MYSUB) && (header->reference_count > 1)) { TRACE_FLOW_STRING("col_sort_collection", "Exit."); return error; } size = sizeof(struct collection_item *) * (header->count - 1); array = (struct collection_item **)malloc(size); if (array == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory", ENOMEM); return ENOMEM; } /* Fill array */ current = col->next; ind = 0; while (current != NULL) { TRACE_INFO_STRING("Item:", current->property); array[ind] = current; if ((sort_flags & COL_SORT_SUB) && (array[ind]->type == COL_TYPE_COLLECTIONREF)) { /* If we found a subcollection and we need to sort it * then sort it. */ other = *((struct collection_item **)(array[ind]->data)); error = col_sort_collection(other, cmp_flags, sort_flags); if (error) { TRACE_ERROR_NUMBER("Subcollection sort failed", error); free(array); return error; } } ind++; current = current->next; } last = ind - 1; for (i = 0; i < last; i++) { TRACE_INFO_STRING("Arg1:", array[i]->property); TRACE_INFO_STRING("Arg2:", array[i + 1]->property); res = col_compare_items(array[i], array[i + 1], cmp_flags, &out_flags); TRACE_INFO_STRING("Result:", ((res == 0) ? "same" : "different")); TRACE_INFO_NUMBER("Out flags", out_flags); /* If they are not same and second is not greater * in any way then we need to swap them */ if ((res != 0) && (out_flags == 0)) { /* Swap */ TRACE_INFO_STRING("Swapping:", ""); TRACE_INFO_STRING("Item:", array[i]->property); TRACE_INFO_STRING("Item:", array[i + 1]->property); temp_item = array[i]; array[i] = array[i + 1]; array[i + 1] = temp_item; /* But we need to go up bubbling this item */ j = i; while (j > 0) { res = col_compare_items(array[j - 1], array[j], cmp_flags, &out_flags); /* If they are not same and second is not greater * in any way then we need to swap them */ if ((res != 0) && (out_flags == 0)) { /* Swap */ temp_item = array[j - 1]; array[j - 1] = array[j]; array[j] = temp_item; } else break; j--; } } } /* Build the chain back */ if (sort_flags & COL_SORT_DESC) { col->next = array[last]; for (i = last; i > 0 ; i--) { array[i]->next = array[i - 1]; } array[0]->next = NULL; header->last = array[0]; } else { col->next = array[0]; for (i = 0; i < last ; i++) { array[i]->next = array[i + 1]; } array[last]->next = NULL; header->last = array[last]; } free(array); TRACE_FLOW_STRING("col_sort_collection", "Exit."); return error; } ding-libs-0.6.2/collection/collection_cnv.c000066400000000000000000001354441417260640400207060ustar00rootroot00000000000000/* COLLECTION LIBRARY Convenience wrapper functions are implemented here. They take a lot of space but pretty simple so they are separated from the core logic. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #include #include "trace.h" /* The collection should use the teal structures */ #include "collection_priv.h" #include "collection.h" /* PROPERTIES */ /* Insert string property with positioning */ int col_insert_str_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, const char *string, int length) { int error = EOK; TRACE_FLOW_STRING("col_insert_string_property", "Entry."); if (length == 0) length = strlen(string) + 1; error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_STRING, (const void *)string, length, NULL); TRACE_FLOW_NUMBER("col_insert_string_property returning", error); return error; } /* Insert binary property with positioning */ int col_insert_binary_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, void *binary_data, int length) { int error = EOK; TRACE_FLOW_STRING("col_insert_binary_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_BINARY, binary_data, length, NULL); TRACE_FLOW_NUMBER("col_insert_binary_property returning", error); return error; } /* Insert integer property with positioning */ int col_insert_int_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int32_t number) { int error = EOK; TRACE_FLOW_STRING("col_insert_int_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_INTEGER, (void *)&number, sizeof(int32_t), NULL); TRACE_FLOW_NUMBER("col_insert_int_property returning", error); return error; } /* Insert unsigned property with positioning */ int col_insert_unsigned_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint32_t number) { int error = EOK; TRACE_FLOW_STRING("col_insert_unsigned_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_UNSIGNED, (void *)&number, sizeof(uint32_t), NULL); TRACE_FLOW_NUMBER("col_insert_unsigned_property returning", error); return error; } /* Insert long property with positioning */ int col_insert_long_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int64_t number) { int error = EOK; TRACE_FLOW_STRING("col_insert_long_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_LONG, (void *)&number, sizeof(int64_t), NULL); TRACE_FLOW_NUMBER("col_insert_long_property returning", error); return error; } /* Insert unsigned long property with positioning */ int col_insert_ulong_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint64_t number) { int error = EOK; TRACE_FLOW_STRING("col_insert_ulong_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_ULONG, (void *)&number, sizeof(uint64_t), NULL); TRACE_FLOW_NUMBER("col_insert_ulong_property returning", error); return error; } /* Insert double property with positioning */ int col_insert_double_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, double number) { int error = EOK; TRACE_FLOW_STRING("col_insert_double_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_DOUBLE, (void *)&number, sizeof(double), NULL); TRACE_FLOW_NUMBER("col_insert_double_property returning", error); return error; } /* Insert bool property with positioning */ int col_insert_bool_property(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, unsigned char logical) { int error = EOK; TRACE_FLOW_STRING("col_insert_bool_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_BOOL, (void *)&logical, sizeof(unsigned char), NULL); TRACE_FLOW_NUMBER("col_insert_bool_property returning", error); return error; } /* Insert string property with positioning and reference. */ int col_insert_str_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, const char *string, int length, struct collection_item **ret_ref) { int error = EOK; void *ptr; TRACE_FLOW_STRING("col_insert_string_property_with_ref", "Entry."); if (length == 0) length = strlen(string) + 1; /* Work around a compilation warning */ memcpy(&ptr, &string, sizeof(void *)); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_STRING, ptr, length, ret_ref); TRACE_FLOW_NUMBER("col_insert_string_property_with_ref returning", error); return error; } /* Insert binary property with positioning and reference. */ int col_insert_binary_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, void *binary_data, int length, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_binary_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_BINARY, (void *)binary_data, length, ret_ref); TRACE_FLOW_NUMBER("col_insert_binary_property_with_ref returning", error); return error; } /* Insert int property with positioning and reference. */ int col_insert_int_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int32_t number, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_int_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_INTEGER, (void *)&number, sizeof(int32_t), ret_ref); TRACE_FLOW_NUMBER("col_insert_int_property_with_ref returning", error); return error; } /* Insert unsigned property with positioning and reference. */ int col_insert_unsigned_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint32_t number, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_unsigned_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_UNSIGNED, (void *)&number, sizeof(uint32_t), ret_ref); TRACE_FLOW_NUMBER("col_insert_unsigned_property_with_ref returning", error); return error; } /* Insert long property with positioning and reference. */ int col_insert_long_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, int64_t number, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_long_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_LONG, (void *)&number, sizeof(int64_t), ret_ref); TRACE_FLOW_NUMBER("col_insert_long_property_with_ref returning", error); return error; } /* Insert unsigned long property with positioning and reference. */ int col_insert_ulong_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, uint64_t number, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_ulong_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_ULONG, (void *)&number, sizeof(uint64_t), ret_ref); TRACE_FLOW_NUMBER("col_insert_ulong_property_with_ref returning", error); return error; } /* Insert double property with positioning and reference. */ int col_insert_double_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, double number, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_double_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_DOUBLE, (void *)&number, sizeof(double), ret_ref); TRACE_FLOW_NUMBER("col_insert_double_property_with_ref returning", error); return error; } /* Insert bool property with positioning and reference. */ int col_insert_bool_property_with_ref(struct collection_item *ci, const char *subcollection, int disposition, const char *refprop, int idx, unsigned flags, const char *property, unsigned char logical, struct collection_item **ret_ref) { int error = EOK; TRACE_FLOW_STRING("col_insert_bool_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, disposition, refprop, idx, flags, property, COL_TYPE_BOOL, (void *)&logical, sizeof(unsigned char), ret_ref); TRACE_FLOW_NUMBER("col_insert_bool_property_with_ref returning", error); return error; } /* Add a string property. */ int col_add_str_property(struct collection_item *ci, const char *subcollection, const char *property, const char *string, int length) { int error = EOK; TRACE_FLOW_STRING("col_add_str_property", "Entry."); error = col_insert_str_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, string, length); TRACE_FLOW_NUMBER("col_add_str_property returning", error); return error; } /* Add a binary property. */ int col_add_binary_property(struct collection_item *ci, const char *subcollection, const char *property, void *binary_data, int length) { int error = EOK; TRACE_FLOW_STRING("col_add_binary_property", "Entry."); error = col_insert_binary_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, binary_data, length); TRACE_FLOW_NUMBER("col_add_binary_property returning", error); return error; } /* Add an int property. */ int col_add_int_property(struct collection_item *ci, const char *subcollection, const char *property, int32_t number) { int error = EOK; TRACE_FLOW_STRING("col_add_int_property", "Entry."); error = col_insert_int_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number); TRACE_FLOW_NUMBER("col_add_int_property returning", error); return error; } /* Add an unsigned int property. */ int col_add_unsigned_property(struct collection_item *ci, const char *subcollection, const char *property, uint32_t number) { int error = EOK; TRACE_FLOW_STRING("col_add_unsigned_property", "Entry."); error = col_insert_unsigned_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number); TRACE_FLOW_NUMBER("col_add_unsigned_property returning", error); return error; } /* Add an long property. */ int col_add_long_property(struct collection_item *ci, const char *subcollection, const char *property, int64_t number) { int error = EOK; TRACE_FLOW_STRING("col_add_long_property", "Entry."); error = col_insert_long_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number); TRACE_FLOW_NUMBER("col_add_long_property returning", error); return error; } /* Add an unsigned long property. */ int col_add_ulong_property(struct collection_item *ci, const char *subcollection, const char *property, uint64_t number) { int error = EOK; TRACE_FLOW_STRING("col_add_ulong_property", "Entry."); error = col_insert_ulong_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number); TRACE_FLOW_NUMBER("col_add_ulong_property returning", error); return error; } /* Add a double property. */ int col_add_double_property(struct collection_item *ci, const char *subcollection, const char *property, double number) { int error = EOK; TRACE_FLOW_STRING("col_add_double_property", "Entry."); error = col_insert_double_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number); TRACE_FLOW_NUMBER("col_add_double_property returning", error); return error; } /* Add a bool property. */ int col_add_bool_property(struct collection_item *ci, const char *subcollection, const char *property, unsigned char logical) { int error = EOK; TRACE_FLOW_STRING("col_add_bool_property", "Entry."); error = col_insert_bool_property(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, logical); TRACE_FLOW_NUMBER("col_add_bool_property returning", error); return error; } /* A function to add a property */ int col_add_any_property(struct collection_item *ci, const char *subcollection, const char *property, int type, void *data, int length) { int error = EOK; TRACE_FLOW_STRING("col_add_any_property", "Entry."); error = col_insert_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, type, data, length, NULL); TRACE_FLOW_NUMBER("col_add_any_property returning", error); return error; } /* Add a string property with reference */ int col_add_str_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, char *string, int length, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_str_property_with_ref", "Entry."); error = col_insert_str_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, string, length, ref_ret); TRACE_FLOW_NUMBER("col_add_str_property_with_ref returning", error); return error; } /* Add a binary property with reference. */ int col_add_binary_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, void *binary_data, int length, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_binary_property_with_ref", "Entry."); error = col_insert_binary_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, binary_data, length, ref_ret); TRACE_FLOW_NUMBER("col_add_binary_property_with_ref returning", error); return error; } /* Add an int property with reference. */ int col_add_int_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int32_t number, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_int_property_with_ref", "Entry."); error = col_insert_int_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number, ref_ret); TRACE_FLOW_NUMBER("col_add_int_property_with_ref returning", error); return error; } /* Add an unsigned int property with reference. */ int col_add_unsigned_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, uint32_t number, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_unsigned_property_with_ref", "Entry."); error = col_insert_unsigned_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number, ref_ret); TRACE_FLOW_NUMBER("col_add_unsigned_property_with_ref returning", error); return error; } /* Add an long property with reference. */ int col_add_long_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int64_t number, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_long_property_with_ref", "Entry."); error = col_insert_long_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number, ref_ret); TRACE_FLOW_NUMBER("col_add_long_property_with_ref returning", error); return error; } /* Add an unsigned long property with reference. */ int col_add_ulong_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, uint64_t number, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_ulong_property_with_ref", "Entry."); error = col_insert_ulong_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number, ref_ret); TRACE_FLOW_NUMBER("col_add_ulong_property_with_ref returning", error); return error; } /* Add a double property with reference. */ int col_add_double_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, double number, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_double_property_with_ref", "Entry."); error = col_insert_double_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, number, ref_ret); TRACE_FLOW_NUMBER("col_add_double_property_with_ref returning", error); return error; } /* Add a bool property with reference. */ int col_add_bool_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, unsigned char logical, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_bool_property_with_ref", "Entry."); error = col_insert_bool_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, logical, ref_ret); TRACE_FLOW_NUMBER("col_add_bool_property_with_ref returning", error); return error; } /* A function to add a property with reference. */ int col_add_any_property_with_ref(struct collection_item *ci, const char *subcollection, const char *property, int type, void *data, int length, struct collection_item **ref_ret) { int error = EOK; TRACE_FLOW_STRING("col_add_any_property_with_ref", "Entry."); error = col_insert_property_with_ref(ci, subcollection, COL_DSP_END, NULL, 0, 0, property, type, data, length, ref_ret); TRACE_FLOW_NUMBER("col_add_any_property_with_ref returning", error); return error; } /* Update a string property in the collection. * Length should include the terminating 0 */ int col_update_str_property(struct collection_item *ci, const char *property, int mode_flags, char *string, int length) { int error = EOK; TRACE_FLOW_STRING("col_update_str_property", "Entry."); if (length == 0) length = strlen(string) + 1; error = col_update_property(ci, property, COL_TYPE_STRING, (void *)string, length, mode_flags); TRACE_FLOW_NUMBER("col_update_str_property Returning", error); return error; } /* Update a binary property in the collection. */ int col_update_binary_property(struct collection_item *ci, const char *property, int mode_flags, void *binary_data, int length) { int error = EOK; TRACE_FLOW_STRING("col_update_binary_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_BINARY, binary_data, length, mode_flags); TRACE_FLOW_NUMBER("col_update_binary_property Returning", error); return error; } /* Update an int property in the collection. */ int col_update_int_property(struct collection_item *ci, const char *property, int mode_flags, int32_t number) { int error = EOK; TRACE_FLOW_STRING("col_update_int_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_INTEGER, (void *)(&number), sizeof(int32_t), mode_flags); TRACE_FLOW_NUMBER("col_update_int_property Returning", error); return error; } /* Update an unsigned int property. */ int col_update_unsigned_property(struct collection_item *ci, const char *property, int mode_flags, uint32_t number) { int error = EOK; TRACE_FLOW_STRING("col_update_unsigned_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_UNSIGNED, (void *)(&number), sizeof(uint32_t), mode_flags); TRACE_FLOW_NUMBER("col_update_unsigned_property Returning", error); return error; } /* Update a long property. */ int col_update_long_property(struct collection_item *ci, const char *property, int mode_flags, int64_t number) { int error = EOK; TRACE_FLOW_STRING("col_update_long_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_LONG, (void *)(&number), sizeof(int64_t), mode_flags); TRACE_FLOW_NUMBER("col_update_long_property Returning", error); return error; } /* Update an unsigned long property. */ int col_update_ulong_property(struct collection_item *ci, const char *property, int mode_flags, uint64_t number) { int error = EOK; TRACE_FLOW_STRING("col_update_ulong_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_ULONG, (void *)(&number), sizeof(uint64_t), mode_flags); TRACE_FLOW_NUMBER("col_update_ulong_property Returning", error); return error; } /* Update a double property. */ int col_update_double_property(struct collection_item *ci, const char *property, int mode_flags, double number) { int error = EOK; TRACE_FLOW_STRING("col_update_double_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_DOUBLE, (void *)(&number), sizeof(double), mode_flags); TRACE_FLOW_NUMBER("col_update_double_property Returning", error); return error; } /* Update a bool property. */ int col_update_bool_property(struct collection_item *ci, const char *property, int mode_flags, unsigned char logical) { int error = EOK; TRACE_FLOW_STRING("col_update_bool_property", "Entry."); error = col_update_property(ci, property, COL_TYPE_BOOL, (void *)(&logical), sizeof(unsigned char), mode_flags); TRACE_FLOW_NUMBER("col_update_bool_property Returning", error); return error; } /* Rename item */ int col_modify_item_property(struct collection_item *item, const char *property) { int error; TRACE_FLOW_STRING("col_modify_item_property", "Entry"); error = col_modify_item(item, property, 0, NULL, 0); TRACE_FLOW_STRING("col_modify_item_property", "Exit"); return error; } /* Convenience functions that wrap modify_item(). */ /* Modify item data to be str */ int col_modify_str_item(struct collection_item *item, const char *property, const char *string, int length) { int len; int error; TRACE_FLOW_STRING("col_modify_str_item", "Entry"); if (length != 0) len = length; else len = strlen(string) + 1; error = col_modify_item(item, property, COL_TYPE_STRING, (const void *)string, len); TRACE_FLOW_STRING("col_modify_str_item", "Exit"); return error; } /* Modify item data to be binary */ int col_modify_binary_item(struct collection_item *item, const char *property, void *binary_data, int length) { int error; TRACE_FLOW_STRING("col_modify_binary_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_BINARY, binary_data, length); TRACE_FLOW_STRING("col_modify_binary_item", "Exit"); return error; } /* Modify item data to be bool */ int col_modify_bool_item(struct collection_item *item, const char *property, unsigned char logical) { int error; TRACE_FLOW_STRING("col_modify_bool_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_BOOL, (void *)(&logical), 1); TRACE_FLOW_STRING("col_modify_bool_item", "Exit"); return error; } /* Modify item data to be int */ int col_modify_int_item(struct collection_item *item, const char *property, int32_t number) { int error; TRACE_FLOW_STRING("col_modify_int_item","Entry"); error = col_modify_item(item, property, COL_TYPE_INTEGER, (void *)(&number), sizeof(int32_t)); TRACE_FLOW_STRING("col_modify_int_item", "Exit"); return error; } /* Modify item data to be long */ int col_modify_long_item(struct collection_item *item, const char *property, int64_t number) { int error; TRACE_FLOW_STRING("col_modify_long_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_LONG, (void *)(&number), sizeof(int64_t)); TRACE_FLOW_STRING("col_modify_long_item", "Exit"); return error; } /* Modify item data to be unigned long */ int col_modify_ulong_item(struct collection_item *item, const char *property, uint64_t number) { int error; TRACE_FLOW_STRING("col_modify_ulong_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_ULONG, (void *)(&number), sizeof(uint64_t)); TRACE_FLOW_STRING("col_modify_ulong_item", "Exit"); return error; } int col_modify_unsigned_item(struct collection_item *item, const char *property, uint32_t number) { int error; TRACE_FLOW_STRING("col_modify_unsigned_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_UNSIGNED, (void *)(&number), sizeof(uint32_t)); TRACE_FLOW_STRING("col_modify_unsigned_item", "Exit"); return error; } int col_modify_double_item(struct collection_item *item, const char *property, double number) { int error; TRACE_FLOW_STRING("col_modify_double_item", "Entry"); error = col_modify_item(item, property, COL_TYPE_DOUBLE, (void *)(&number), sizeof(double)); TRACE_FLOW_STRING("col_modify_double_item", "Exit"); return error; } ding-libs-0.6.2/collection/collection_iter.c000066400000000000000000000366071417260640400210640ustar00rootroot00000000000000/* COLLECTION LIBRARY Implementation of the collection library iterator functions. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #include #include #include "trace.h" /* The collection should use the real structures */ #include "collection_priv.h" #include "collection.h" /* Depth for iterator depth allocation block */ #define STACK_DEPTH_BLOCK 15 /* Grow iteration stack */ static int col_grow_stack(struct collection_iterator *iterator, unsigned desired) { int grow_by = 0; struct collection_item **temp; TRACE_FLOW_STRING("col_grow_stack", "Entry."); if (desired > iterator->stack_size) { grow_by = (((desired - iterator->stack_size) / STACK_DEPTH_BLOCK) + 1) * STACK_DEPTH_BLOCK; temp = (struct collection_item **)realloc(iterator->stack, grow_by * sizeof(struct collection_item *)); if (temp == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory", ENOMEM); return ENOMEM; } iterator->stack = temp; iterator->stack_size += grow_by; } TRACE_FLOW_STRING("col_grow_stack", "Exit."); return EOK; } /* Bind iterator to a collection */ int col_bind_iterator(struct collection_iterator **iterator, struct collection_item *ci, int mode_flags) { int error; struct collection_header *header; struct collection_iterator *iter = NULL; TRACE_FLOW_STRING("col_bind_iterator", "Entry."); /* Do some argument checking first */ if ((iterator == NULL) || (ci == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } iter = (struct collection_iterator *)malloc(sizeof(struct collection_iterator)); if (iter == NULL) { TRACE_ERROR_NUMBER("Error allocating memory for the iterator.", ENOMEM); return ENOMEM; } /* Allocate memory for the stack */ iter->stack = NULL; iter->stack_size = 0; iter->stack_depth = 0; iter->item_level = 0; iter->flags = mode_flags; iter->pin_level = 0; iter->can_break = 0; TRACE_INFO_NUMBER("Iterator flags", iter->flags); /* Allocate memory for stack */ error = col_grow_stack(iter, 1); if(error) { free(iter); TRACE_ERROR_NUMBER("Error growing stack.", error); return error; } /* Create a special end item */ error = col_allocate_item(&(iter->end_item), "", NULL, 0, COL_TYPE_END); if(error) { free(iter); TRACE_ERROR_NUMBER("Error allocating end item.", error); return error; } /* Make sure that we tie iterator to the collection */ header = (struct collection_header *)ci->data; header->reference_count++; iter->top = ci; iter->pin = ci; *(iter->stack) = ci; iter->stack_depth++; *iterator = iter; TRACE_FLOW_STRING("col_bind_iterator", "Exit"); return EOK; } /* Stop processing this subcollection and move to the next item in the * collection 'level' levels up.*/ int col_iterate_up(struct collection_iterator *iterator, unsigned level) { TRACE_FLOW_STRING("iterate_up", "Entry"); if (iterator == NULL) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } TRACE_INFO_NUMBER("Going up:", level); TRACE_INFO_NUMBER("Current stack depth:", iterator->stack_depth); /* If level is big just move to the top, * that will end the iteration process. */ if (level >= iterator->stack_depth) iterator->stack_depth = 0; else iterator->stack_depth -= level; TRACE_INFO_NUMBER("Stack depth at the end:", iterator->stack_depth); TRACE_FLOW_STRING("col_iterate_up", "Exit"); return EOK; } /* How deep are we relative to the top level.*/ int col_get_iterator_depth(struct collection_iterator *iterator, int *depth) { TRACE_FLOW_STRING("col_get_iterator_depth", "Entry"); if ((iterator == NULL) || (depth == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } *depth = iterator->stack_depth - 1; TRACE_INFO_NUMBER("Stack depth at the end:", iterator->stack_depth); TRACE_FLOW_STRING("col_get_iterator_depth","Exit"); return EOK; } /* What was the level of the last item we got? */ int col_get_item_depth(struct collection_iterator *iterator, int *depth) { TRACE_FLOW_STRING("col_get_item_depth", "Entry"); if ((iterator == NULL) || (depth == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } *depth = iterator->item_level; TRACE_INFO_NUMBER("Item level at the end:", iterator->item_level); TRACE_FLOW_STRING("col_get_item_depth","Exit"); return EOK; } /* Unbind the iterator from the collection */ void col_unbind_iterator(struct collection_iterator *iterator) { TRACE_FLOW_STRING("col_unbind_iterator", "Entry."); if (iterator != NULL) { col_destroy_collection(iterator->top); col_delete_item(iterator->end_item); free(iterator->stack); free(iterator); } TRACE_FLOW_STRING("col_unbind_iterator", "Exit"); } /* Get items from the collection one by one following the tree */ int col_iterate_collection(struct collection_iterator *iterator, struct collection_item **item) { int error; struct collection_item *current; struct collection_item *other; TRACE_FLOW_STRING("col_iterate_collection", "Entry."); /* Check if we have storage for item */ if (item == NULL) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } while (1) { TRACE_INFO_NUMBER("Stack depth:", iterator->stack_depth); if (iterator->stack_depth == 0) { /* Re-init so if we continue looping we start over */ iterator->stack[0] = iterator->top; iterator->stack_depth++; iterator->item_level = 0; } /* Is current item available */ current = iterator->stack[iterator->stack_depth - 1]; iterator->item_level = iterator->stack_depth - 1; /* Are we done? */ if (((iterator->stack_depth - 1) == iterator->pin_level) && (iterator->pin == current)) { if (iterator->can_break) { TRACE_FLOW_STRING("We are done.", ""); *item = NULL; iterator->can_break = 0; return EOK; } else iterator->can_break = 1; } /* We are not done so check if we have an item */ if (current != NULL) { TRACE_INFO_STRING("Current item:", current->property); TRACE_INFO_NUMBER("Current item type:", current->type); /* Is this a collection reference */ if (current->type == COL_TYPE_COLLECTIONREF) { /* We do follow references? */ TRACE_INFO_STRING("Current item:", "collection reference"); if ((iterator->flags & COL_TRAVERSE_IGNORE) == 0) { /* We should not ignore - then move on */ TRACE_INFO_STRING("Collection references are not ignored", ""); error = col_grow_stack(iterator, iterator->stack_depth + 1); if (error) { TRACE_ERROR_NUMBER("Error growing stack.", error); return error; } /* Do we need to go deeper than one level ? */ if ((iterator->flags & COL_TRAVERSE_ONELEVEL) == 0) { TRACE_INFO_STRING("Need to go deeper", ""); /* We need to go deeper... */ /* Do we need to show headers but not reference? */ if ((iterator->flags & COL_TRAVERSE_ONLYSUB) != 0) { TRACE_INFO_STRING("Instructed to show header not reference", ""); other = *((struct collection_item **)current->data); iterator->stack[iterator->stack_depth] = other->next; iterator->item_level = iterator->stack_depth; *item = other; } /* Do we need to show both? */ else if ((iterator->flags & COL_TRAVERSE_SHOWSUB) != 0) { TRACE_INFO_STRING("Instructed to show header and reference",""); iterator->stack[iterator->stack_depth] = *((struct collection_item **)(current->data)); *item = current; /* Do not need to adjust level here */ } /* Do not show either */ else if ((iterator->flags & COL_TRAVERSE_FLAT) != 0) { TRACE_INFO_STRING("Instructed not to show header and reference",""); other = *((struct collection_item **)current->data); iterator->stack[iterator->stack_depth] = other->next; iterator->stack[iterator->stack_depth - 1] = current->next; iterator->stack_depth++; /* Do not need to adjust level here */ continue; } /* We need to show reference only */ else { TRACE_INFO_STRING("Instructed to show reference only", ""); other = *((struct collection_item **)current->data); TRACE_INFO_STRING("Sub collection:", other->property); TRACE_INFO_NUMBER("Sub collection type:", other->type); iterator->stack[iterator->stack_depth] = other->next; if (other->next != NULL) { TRACE_INFO_STRING("Will show this item next time:", other->next->property); TRACE_INFO_NUMBER("Will show this item next time type:", other->next->type); } *item = current; TRACE_INFO_NUMBER("Level of the reference:", iterator->item_level); /* Do not need to adjust level here */ } TRACE_INFO_STRING("We return item:", (*item)->property); TRACE_INFO_NUMBER("We return item type:", (*item)->type); TRACE_INFO_STRING("Moving to the next item on the previous item in stack", ""); iterator->stack[iterator->stack_depth - 1] = current->next; iterator->stack_depth++; } else { TRACE_INFO_STRING("Instructed to parse just one level", ""); /* On one level - just return current */ *item = current; TRACE_INFO_STRING("Moving to the next item on one level", ""); iterator->stack[iterator->stack_depth - 1] = current->next; } break; } else { /* We need to ignore references so move to the next item */ TRACE_INFO_STRING("Stepping over the reference", ""); iterator->stack[iterator->stack_depth - 1] = current->next; continue; } } else { /* Got a normal item - return it and move to the next one */ if ((current->type == COL_TYPE_COLLECTION) && ((iterator->flags & COL_TRAVERSE_FLAT) != 0) && (iterator->stack_depth > 1)) { TRACE_INFO_STRING("Header of the sub collection in flat case ", ""); iterator->stack[iterator->stack_depth - 1] = current->next; continue; } else { TRACE_INFO_STRING("Simple item", ""); *item = current; iterator->stack[iterator->stack_depth - 1] = current->next; } break; } } else { /* Item is NULL */ TRACE_INFO_STRING("Finished level", "moving to upper level"); iterator->stack_depth--; /* Remember that item_level is zero based while depth is size * so we decrease and then assign. */ TRACE_INFO_NUMBER("Stack depth at the end:", iterator->stack_depth); if ((iterator->flags & COL_TRAVERSE_END) != 0) { /* Show end element * a) If we are flattening but at the top * b) We are not flattening */ if ((((iterator->flags & COL_TRAVERSE_FLAT) != 0) && (iterator->stack_depth == 0)) || ((iterator->flags & COL_TRAVERSE_FLAT) == 0)) { /* Return dummy entry to indicate the end of the collection */ TRACE_INFO_STRING("Finished level", "told to return END"); *item = iterator->end_item; break; } } else { /* Move to next level */ continue; } } } TRACE_FLOW_STRING("col_iterate_collection", "Exit"); return EOK; } /* Pins down the iterator to loop around this point */ void col_pin_iterator(struct collection_iterator *iterator) { TRACE_FLOW_STRING("col_iterator_add_pin", "Entry"); if ((!iterator) || (!iterator->stack)) { TRACE_FLOW_STRING("Invalid itertor", "Ingoring"); return; } while ((iterator->stack_depth) && (iterator->stack[iterator->stack_depth - 1] == NULL)) { iterator->stack_depth--; } if (iterator->stack_depth == 0) { iterator->pin = iterator->top; iterator->pin_level = 0; } else { iterator->pin = iterator->stack[iterator->stack_depth - 1]; iterator->pin_level = iterator->stack_depth - 1; } iterator->can_break = 0; TRACE_FLOW_STRING("col_iterator_add_pin", "Exit"); } /* Rewinds iterator to the beginning */ void col_rewind_iterator(struct collection_iterator *iterator) { TRACE_FLOW_STRING("col_rewind_iterator", "Entry"); if ((!iterator) || (!iterator->stack)) { TRACE_FLOW_STRING("Invalid itertor", "Ingoring"); return; } iterator->pin = iterator->top; iterator->stack[0] = iterator->top; iterator->stack_depth = 1; iterator->item_level = 0; iterator->pin_level = 0; iterator->can_break = 0; TRACE_FLOW_STRING("col_rewind_iterator", "Exit"); } ding-libs-0.6.2/collection/collection_priv.h000066400000000000000000000050101417260640400210660ustar00rootroot00000000000000/* COLLECTION LIBRARY Header file for internal structures used by the collection interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #ifndef COLLECTION_PRIV_H #define COLLECTION_PRIV_H #include /* Define real strcutures */ /* Structure that holds one property. * This structure should never be assumed and used directly other than * inside the collection.c that contains actual implementation or * collection_tools.c or collection_utils.c. */ struct collection_item { /* Member that contains element linking information. * This member should never be directly accessed by an application. */ struct collection_item *next; /* Your implementation can assume that these members * will always be members of the collection_item. * but you should use get_item_xxx functions to get them. */ char *property; int property_len; int type; int length; void *data; uint64_t phash; }; /* Internal iterator structure - exposed for reference. * Never access internals of this structure in your application. */ struct collection_iterator { struct collection_item *top; struct collection_item **stack; unsigned stack_size; unsigned stack_depth; unsigned item_level; int flags; struct collection_item *end_item; struct collection_item *pin; unsigned pin_level; unsigned can_break; }; /* Special type of data that stores collection header information. */ struct collection_header { struct collection_item *last; unsigned reference_count; unsigned count; unsigned cclass; }; /* Internal function to allocate item */ int col_allocate_item(struct collection_item **ci, const char *property, const void *item_data, int length, int type); #endif ding-libs-0.6.2/collection/collection_queue.c000066400000000000000000000240671417260640400212420ustar00rootroot00000000000000/* QUEUE Implementation of the queue on top of collection library interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include "collection_queue.h" #include "trace.h" /* Function that creates a queue object */ int col_create_queue(struct collection_item **queue) { int error = EOK; TRACE_FLOW_STRING("col_create_queue", "Entry point."); error = col_create_collection(queue, COL_NAME_QUEUE, COL_CLASS_QUEUE); TRACE_FLOW_STRING("col_create_queue", "Exit."); return error; } /* Function that destroys a queue object */ void col_destroy_queue(struct collection_item *queue) { TRACE_FLOW_STRING("col_destroy_queue", "Entry point."); col_destroy_collection(queue); TRACE_FLOW_STRING("col_destroy_queue", "Exit"); } /* Put a string property into a queue. */ int col_enqueue_str_property(struct collection_item *queue, const char *property, const char *string, int length) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_str_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_str_property(queue, NULL, property, string, length); TRACE_FLOW_STRING("col_enqueue_str_property", "Exit."); return error; } /* Put a binary property into a queue. */ int col_enqueue_binary_property(struct collection_item *queue, const char *property, void *binary_data, int length) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_binary_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_binary_property(queue, NULL, property, binary_data, length); TRACE_FLOW_STRING("col_enqueue_binary_property", "Exit."); return error; } /* Put an int property into a queue. */ int col_enqueue_int_property(struct collection_item *queue, const char *property, int32_t number) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_int_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_int_property(queue, NULL, property, number); TRACE_FLOW_STRING("col_enqueue_int_property", "Exit."); return error; } /* Put an unsigned int property into a queue. */ int col_enqueue_unsigned_property(struct collection_item *queue, const char *property, uint32_t number) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_unsigned_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_unsigned_property(queue, NULL, property, number); TRACE_FLOW_STRING("col_enqueue_unsigned_property", "Exit."); return error; } /* Put a long property. */ int col_enqueue_long_property(struct collection_item *queue, const char *property, int64_t number) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_long_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_long_property(queue, NULL, property, number); TRACE_FLOW_STRING("col_enqueue_long_property", "Exit."); return error; } /* Put an unsigned long property. */ int col_enqueue_ulong_property(struct collection_item *queue, const char *property, uint64_t number) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_ulong_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_ulong_property(queue, NULL, property, number); TRACE_FLOW_STRING("col_enqueue_ulong_property", "Exit."); return error; } /* Put a double property. */ int col_enqueue_double_property(struct collection_item *queue, const char *property, double number) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_double_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_double_property(queue, NULL, property, number); TRACE_FLOW_STRING("enqueue_double_property", "Exit."); return error; } /* Put a bool property. */ int col_enqueue_bool_property(struct collection_item *queue, const char *property, unsigned char logical) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_bool_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_bool_property(queue, NULL, property, logical); TRACE_FLOW_STRING("col_enqueue_bool_property", "Exit."); return error; } /* Put any property */ int col_enqueue_any_property(struct collection_item *queue, const char *property, int type, void *data, int length) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_any_property", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_any_property(queue, NULL, property, type, data, length); TRACE_FLOW_STRING("col_enqueue_any_property", "Exit."); return error; } /* Enqueue item */ int col_enqueue_item(struct collection_item *queue, struct collection_item *item) { int error = EOK; TRACE_FLOW_STRING("col_enqueue_item", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_insert_item_into_current(queue, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK); TRACE_FLOW_STRING("col_enqueue_item", "Exit."); return error; } /* Dequeue item */ int col_dequeue_item(struct collection_item *queue, struct collection_item **item) { int error = EOK; TRACE_FLOW_STRING("col_dequeue_item", "Entry point."); /* Check that queue is not empty */ if (queue == NULL) { TRACE_ERROR_STRING("queue can't be NULL", ""); return EINVAL; } /* Make sure it is a queue */ if (!col_is_of_class(queue, COL_CLASS_QUEUE)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_extract_item_from_current(queue, COL_DSP_FRONT, NULL, 0, 0, item); TRACE_FLOW_STRING("col_dequeue_item", "Exit."); return error; } ding-libs-0.6.2/collection/collection_queue.h000066400000000000000000000305751417260640400212500ustar00rootroot00000000000000/* QUEUE Header file for queue implemented using collection interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #ifndef COLLECTION_QUEUE_H #define COLLECTION_QUEUE_H #include "collection.h" /** * @defgroup queue QUEUE interface * * Queue interface is a wrapper on top of the \ref collection * interface. It implements a queue using a collection object. * * @{ */ /** @brief Class for the queue object */ #define COL_CLASS_QUEUE 40000 /** @brief All queues use this name as the name of the collection */ #define COL_NAME_QUEUE "queue" /** * @brief Create queue. * * Function that creates a queue object. * * @param[out] queue Newly created queue object. * * @return 0 - Queue was created successfully. * @return ENOMEM - No memory. * */ int col_create_queue(struct collection_item **queue); /** * @brief Destroy queue. * * Function that destroys a queue object. * * @param[in] queue Queue object to destroy. * */ void col_destroy_queue(struct collection_item *queue); /** * @brief Add string to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] string Null terminated string to add. * @param[in] length Length of the string. Should include the length * of the terminating 0. * If the length is shorter than the full string * the string will be truncated. If the length is * longer than the actual string there might be * garbage at end of the actual string. * Library will always properly NULL terminate * the string at the given position dictated * by length but in no way will inspect the validity * of the passed in data. This is left to the calling * application. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_str_property(struct collection_item *queue, const char *property, const char *string, int length); /** * @brief Add binary value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] binary_data Data to add. * @param[in] length Length of the binary data. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_binary_property(struct collection_item *queue, const char *property, void *binary_data, int length); /** * @brief Add integer value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_int_property(struct collection_item *queue, const char *property, int32_t number); /** * @brief Add unsigned value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_unsigned_property(struct collection_item *queue, const char *property, uint32_t number); /** * @brief Add long integer value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_long_property(struct collection_item *queue, const char *property, int64_t number); /** * @brief Add unsigned long value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_ulong_property(struct collection_item *queue, const char *property, uint64_t number); /** * @brief Add floating point value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_double_property(struct collection_item *queue, const char *property, double number); /** * @brief Add Boolean value to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] logical Value to add. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_bool_property(struct collection_item *queue, const char *property, unsigned char logical); /** * @brief Add value of any type to the queue. * * @param[in] queue Queue object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] type Type to use. * @param[in] data Data to add. * @param[in] length Length of the data. * * @return 0 - Property was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * */ int col_enqueue_any_property(struct collection_item *queue, const char *property, int type, void *data, int length); /** * @brief Push item into the queue. * * @param[in] queue Queue object. * @param[in] item Item to push. * * @return 0 - Item was added successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int col_enqueue_item(struct collection_item *queue, struct collection_item *item); /** * @brief Get item from the queue. * * @param[in] queue Queue object. * @param[out] item Variable receives the value * of the retrieved item. * Will be set to NULL if there are * no more items in the queue. * * @return 0 - No internal issues detected. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int col_dequeue_item(struct collection_item *queue, struct collection_item **item); /** * @} */ #endif ding-libs-0.6.2/collection/collection_queue_ut.c000066400000000000000000000136661417260640400217550ustar00rootroot00000000000000/* QUEUE INTERFACE Queue unit test. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #define TRACE_HOME #include "trace.h" #include "collection_queue.h" #include "collection_tools.h" typedef int (*test_fn)(void); int verbose = 0; #define COLOUT(foo) \ do { \ if (verbose) foo; \ } while(0) static int queue_test(void) { struct collection_item *queue = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; struct collection_item *item = NULL; int i; unsigned count; int error = EOK; TRACE_FLOW_STRING("queue_test","Entry."); COLOUT(printf("\n\nQUEUE TEST!!!.\n\n\n")); if((error = col_create_queue(&queue)) || (error = col_enqueue_str_property(queue, "item1","value 1" ,0)) || (error = col_enqueue_int_property(queue, "item2", -1)) || (error = col_enqueue_unsigned_property(queue, "item3", 1)) || (error = col_enqueue_long_property(queue, "item4", 100)) || (error = col_enqueue_ulong_property(queue, "item5", 1000)) || (error = col_enqueue_double_property(queue, "item6", 1.1)) || (error = col_enqueue_bool_property(queue, "item7", 1)) || (error = col_enqueue_binary_property(queue, "item8", binary_dump, sizeof(binary_dump)))) { printf("Failed to enqueue property. Error %d\n", error); col_destroy_collection(queue); return error; } COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); error = col_get_collection_count(queue, &count); if (error) { printf("Failed to get count. Error %d\n", error); col_destroy_collection(queue); return error; } count--; COLOUT(printf("Rotate the queue.\n")); for (i = 0; i < count; i++) { if ((error = col_dequeue_item(queue, &item)) || (error = col_enqueue_item(queue, item))) { printf("Failed to dequeue or enqueue items. Error %d\n", error); col_destroy_collection(queue); return error; } COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); } col_destroy_collection(queue); TRACE_FLOW_NUMBER("queue_test. Returning", error); COLOUT(printf("\n\nEND OF QUEUE TEST!!!.\n\n\n")); return error; } static int empty_test(void) { struct collection_item *queue = NULL; struct collection_item *item = NULL; int i; unsigned count; int error = EOK; TRACE_FLOW_STRING("empty_test","Entry."); COLOUT(printf("\n\nEMPTY QUEUE TEST!!!.\n\n\n")); if((error = col_create_queue(&queue)) || (error = col_enqueue_str_property(queue, "item1","value 1" ,0)) || (error = col_enqueue_int_property(queue, "item2", -1)) || (error = col_enqueue_unsigned_property(queue, "item3", 1))) { printf("Failed to enqueue property. Error %d\n", error); col_destroy_collection(queue); return error; } COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); error = col_get_collection_count(queue, &count); if (error) { printf("Failed to get count. Error %d\n", error); col_destroy_collection(queue); return error; } count--; COLOUT(printf("Empty the queue.\n")); for (i = 0; i < count; i++) { if ((error = col_dequeue_item(queue, &item))) { printf("Failed to dequeue or enqueue items. Error %d\n", error); col_destroy_collection(queue); return error; } col_delete_item(item); COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); } COLOUT(printf("Add elements again.\n")); if((error = col_enqueue_str_property(queue, "item1","value 1" ,0)) || (error = col_enqueue_int_property(queue, "item2", -1)) || (error = col_enqueue_unsigned_property(queue, "item3", 1))) { printf("Failed to enqueue property. Error %d\n", error); col_destroy_collection(queue); return error; } COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); error = col_get_collection_count(queue, &count); if (error) { printf("Failed to get count. Error %d\n", error); col_destroy_collection(queue); return error; } count--; COLOUT(printf("Empty the queue again.\n")); for (i = 0; i < count; i++) { if ((error = col_dequeue_item(queue, &item))) { printf("Failed to dequeue or enqueue items. Error %d\n", error); col_destroy_collection(queue); return error; } col_delete_item(item); COLOUT(col_debug_collection(queue,COL_TRAVERSE_DEFAULT)); } col_destroy_collection(queue); TRACE_FLOW_NUMBER("empty_test. Returning", error); COLOUT(printf("\n\nEND OF QUEUE TEST!!!.\n\n\n")); return error; } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { queue_test, empty_test, NULL }; test_fn t; int i = 0; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; printf("Start\n"); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed!\n"); return error; } } printf("Success!\n"); return 0; } ding-libs-0.6.2/collection/collection_stack.c000066400000000000000000000234371417260640400212230ustar00rootroot00000000000000/* STACK Implementation of the stack on top of collection library interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include "collection_stack.h" #include "trace.h" /* Function that creates a stack object */ int col_create_stack(struct collection_item **stack) { int error = EOK; TRACE_FLOW_STRING("col_create_stack", "Entry point."); error = col_create_collection(stack, COL_NAME_STACK, COL_CLASS_STACK); TRACE_FLOW_STRING("col_create_stack", "Exit."); return error; } /* Function that destroys a stack object */ void col_destroy_stack(struct collection_item *stack) { TRACE_FLOW_STRING("col_destroy_stack", "Entry point."); col_destroy_collection(stack); TRACE_FLOW_STRING("col_destroy_stack", "Exit"); } int col_push_str_property(struct collection_item *stack, const char *property, const char *string, int length) { int error = EOK; TRACE_FLOW_STRING("col_push_str_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_str_property(stack, NULL, property, string, length); TRACE_FLOW_STRING("col_push_str_property", "Exit."); return error; } /* Push a binary property to stack. */ int col_push_binary_property(struct collection_item *stack, const char *property, void *binary_data, int length) { int error = EOK; TRACE_FLOW_STRING("col_push_binary_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_binary_property(stack, NULL, property, binary_data, length); TRACE_FLOW_STRING("col_push_binary_property", "Exit."); return error; } /* Push an int property to stack. */ int col_push_int_property(struct collection_item *stack, const char *property, int32_t number) { int error = EOK; TRACE_FLOW_STRING("col_push_int_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_int_property(stack, NULL, property, number); TRACE_FLOW_STRING("col_push_int_property", "Exit."); return error; } /* Push an unsigned int property to stack. */ int col_push_unsigned_property(struct collection_item *stack, const char *property, uint32_t number) { int error = EOK; TRACE_FLOW_STRING("col_push_unsigned_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_unsigned_property(stack, NULL, property, number); TRACE_FLOW_STRING("col_push_unsigned_property", "Exit."); return error; } /* Push a long property. */ int col_push_long_property(struct collection_item *stack, const char *property, int64_t number) { int error = EOK; TRACE_FLOW_STRING("col_push_long_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_long_property(stack, NULL, property, number); TRACE_FLOW_STRING("col_push_long_property", "Exit."); return error; } /* Push an unsigned long property. */ int col_push_ulong_property(struct collection_item *stack, const char *property, uint64_t number) { int error = EOK; TRACE_FLOW_STRING("col_push_ulong_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_ulong_property(stack, NULL, property, number); TRACE_FLOW_STRING("col_push_ulong_property", "Exit."); return error; } /* Push a double property. */ int col_push_double_property(struct collection_item *stack, const char *property, double number) { int error = EOK; TRACE_FLOW_STRING("col_push_double_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_double_property(stack, NULL, property, number); TRACE_FLOW_STRING("col_push_double_property", "Exit."); return error; } /* Push a bool property. */ int col_push_bool_property(struct collection_item *stack, const char *property, unsigned char logical) { int error = EOK; TRACE_FLOW_STRING("col_push_bool_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_bool_property(stack, NULL, property, logical); TRACE_FLOW_STRING("push_double_property", "Exit."); return error; } /* Push any property */ int col_push_any_property(struct collection_item *stack, const char *property, int type, void *data, int length) { int error = EOK; TRACE_FLOW_STRING("col_push_any_property", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_add_any_property(stack, NULL, property, type, data, length); TRACE_FLOW_STRING("col_push_any_property", "Exit."); return error; } /* Push item */ int col_push_item(struct collection_item *stack, struct collection_item *item) { int error = EOK; TRACE_FLOW_STRING("col_push_item", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_insert_item_into_current(stack, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK); TRACE_FLOW_STRING("col_push_item", "Exit."); return error; } /* Pop_item */ int col_pop_item(struct collection_item *stack, struct collection_item **item) { int error = EOK; TRACE_FLOW_STRING("col_pop_item", "Entry point."); /* Check that stack is not empty */ if (stack == NULL) { TRACE_ERROR_STRING("Stack can't be NULL", ""); return EINVAL; } /* Make sure it is a stack */ if (!col_is_of_class(stack, COL_CLASS_STACK)) { TRACE_ERROR_STRING("Wrong class", ""); return EINVAL; } error = col_extract_item_from_current(stack, COL_DSP_END, NULL, 0, 0, item); TRACE_FLOW_STRING("col_pop_item", "Exit."); return error; } ding-libs-0.6.2/collection/collection_stack.h000066400000000000000000000304471417260640400212270ustar00rootroot00000000000000/* STACK Header file for stack implemented using collection interface. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #ifndef COLLECTION_STACK_H #define COLLECTION_STACK_H #include /** * @defgroup stack STACK interface * * Stack interface is a wrapper on top of the \ref collection * interface. It implements a stack using a collection object. * * @{ */ /** @brief Class for the stack object */ #define COL_CLASS_STACK 30000 /** @brief All stacks use this name as the name of the collection */ #define COL_NAME_STACK "stack" /** * @brief Create stack. * * Function that creates a stack object. * * @param[out] stack Newly created stack object. * * @return 0 - Stack was created successfully. * @return ENOMEM - No memory. * */ int col_create_stack(struct collection_item **stack); /** * @brief Destroy stack. * * Function that destroys a stack object. * * @param[in] stack Stack object to destroy. * */ void col_destroy_stack(struct collection_item *stack); /** * @brief Push string to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] string Null terminated string to add. * @param[in] length Length of the string. Should include the length * of the terminating 0. * If the length is shorter than the full string * the string will be truncated. If the length is * longer than the actual string there might be * garbage at end of the actual string. * Library will always properly NULL terminate * the string at the given position dictated * by length but in no way will inspect the validity * of the passed in data. This is left to the calling * application. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * */ int col_push_str_property(struct collection_item *stack, const char *property, const char *string, int length); /** * @brief Push binary value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] binary_data Data to add. * @param[in] length Length of the binary data. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_binary_property(struct collection_item *stack, const char *property, void *binary_data, int length); /** * @brief Push integer value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_int_property(struct collection_item *stack, const char *property, int32_t number); /** * @brief Push unsigned value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_unsigned_property(struct collection_item *stack, const char *property, uint32_t number); /** * @brief Push long integer value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_long_property(struct collection_item *stack, const char *property, int64_t number); /** * @brief Push unsigned long value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_ulong_property(struct collection_item *stack, const char *property, uint64_t number); /** * @brief Push floating point value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] number Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_double_property(struct collection_item *stack, const char *property, double number); /** * @brief Push Boolean value to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] logical Value to add. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return EMSGSIZE - Property name is too long. * */ int col_push_bool_property(struct collection_item *stack, const char *property, unsigned char logical); /** * @brief Push value of any type to the stack. * * @param[in] stack Stack object. * @param[in] property Name of the property.
* Name should consist of the ASCII characters * with codes non less than space. * Exclamation mark character is * a special character and can't be used * in name of collection or property.
* Maximum allowed length is defined at compile time. * The default value is 64k. * @param[in] type Type to use. * @param[in] data Data to add. * @param[in] length Length of the data. * * @return 0 - Property was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid characters in the property name. * Value argument is invalid in some way. * @return EMSGSIZE - Property name is too long. * */ int col_push_any_property(struct collection_item *stack, const char *property, int type, void *data, int length); /** * @brief Push item into the stack. * * @param[in] stack Stack object. * @param[in] item Item to push. * * @return 0 - Item was pushed successfully. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int col_push_item(struct collection_item *stack, struct collection_item *item); /** * @brief Pop item from the stack. * * @param[in] stack Stack object. * @param[out] item Variable receives the value * of the retrieved item. * Will be set to NULL if there are * no more items in the stack. * * @return 0 - No internal issues detected. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int col_pop_item(struct collection_item *stack, struct collection_item **item); /** * @} */ #endif ding-libs-0.6.2/collection/collection_stack_ut.c000066400000000000000000000073211417260640400217250ustar00rootroot00000000000000/* STACK INTERFACE Stack unit test. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #define TRACE_HOME #include "trace.h" #include "collection_stack.h" #include "collection_tools.h" typedef int (*test_fn)(void); int verbose = 0; #define COLOUT(foo) \ do { \ if (verbose) foo; \ } while(0) static int stack_test(void) { struct collection_item *stack = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; struct collection_item *item1 = NULL; struct collection_item *item2 = NULL; int error = EOK; TRACE_FLOW_STRING("stack_test", "Entry."); COLOUT(printf("\n\nSTACK TEST!!!.\n\n\n")); if ((error = col_create_stack(&stack)) || (error = col_push_str_property(stack, "item1", "value 1", 0)) || (error = col_push_int_property(stack, "item2", -1)) || (error = col_push_unsigned_property(stack, "item3", 1)) || (error = col_push_long_property(stack, "item4", 100)) || (error = col_push_ulong_property(stack, "item5", 1000)) || (error = col_push_double_property(stack, "item6", 1.1)) || (error = col_push_bool_property(stack, "item7", 1)) || (error = col_push_binary_property(stack, "item8", binary_dump, sizeof(binary_dump)))) { printf("Failed to push property. Error %d\n", error); col_destroy_collection(stack); return error; } COLOUT(col_debug_collection(stack, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Swapping last two items by popping and pushing them back.\n")); if ((error = col_pop_item(stack, &item1)) || (error = col_pop_item(stack, &item2))) { printf("Failed to pop items. Error %d\n", error); col_destroy_collection(stack); return error; } COLOUT(printf("\nPopped two last items.\n")); COLOUT(col_debug_collection(stack, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\nLast item.\n")); COLOUT(col_debug_item(item1)); COLOUT(printf("\nPrevious item.\n")); COLOUT(col_debug_item(item2)); if ((error = col_push_item(stack, item1)) || (error = col_push_item(stack, item2))) { printf("Failed to pop or push items. Error %d\n", error); col_destroy_collection(stack); return error; } COLOUT(printf("\n\nPushed two items again in reverse order.\n\n")); COLOUT(col_debug_collection(stack, COL_TRAVERSE_DEFAULT)); col_destroy_collection(stack); TRACE_FLOW_NUMBER("stack_test. Returning", error); COLOUT(printf("\n\nEND OF STACK TEST!!!.\n\n")); return error; } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { stack_test, NULL }; test_fn t; int i = 0; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; printf("Start\n"); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed!\n"); return error; } } printf("Success!\n"); return 0; } ding-libs-0.6.2/collection/collection_tools.c000066400000000000000000000530241417260640400212510ustar00rootroot00000000000000/* COLLECTION LIBRARY Additional functions for printing and debugging collections. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #include #include "trace.h" #include "collection_priv.h" #include "collection.h" #include "collection_tools.h" /* Debug handle */ int col_debug_handle(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy) { int i; int nest_level; int ignore = 0; TRACE_FLOW_STRING("col_debug_handle", "Entry."); nest_level = *(int *)(custom_data); if (nest_level == -1) { ignore = 1; nest_level = 1; } TRACE_INFO_NUMBER("We are getting this pointer:", custom_data); TRACE_INFO_NUMBER("Nest level:", nest_level); switch (type) { case COL_TYPE_STRING: printf(">%*s%s[%d] str: %s (%d)\n", (nest_level -1) * 4, "", property, length, (char *)(data), nest_level); break; case COL_TYPE_BINARY: printf(">%*s%s[%d] bin: ", (nest_level -1) * 4, "", property, length); for (i = 0; i < length; i++) printf("%02X", ((unsigned char *)(data))[i]); printf(" (%d)\n", nest_level); break; case COL_TYPE_INTEGER: printf(">%*s%s[%d] int: %d (%d)\n", (nest_level -1) * 4, "", property, length, *((int32_t *)(data)), nest_level); break; case COL_TYPE_UNSIGNED: printf(">%*s%s[%d] uint: %u (%d)\n", (nest_level -1) * 4, "", property, length, *((uint32_t *)(data)), nest_level); break; case COL_TYPE_LONG: printf(">%*s%s[%d] long: %lld (%d)\n", (nest_level -1) * 4, "", property, length, (long long int)(*((int64_t *)(data))), nest_level); break; case COL_TYPE_ULONG: printf(">%*s%s[%d] ulong: %llu (%d)\n", (nest_level -1) * 4, "", property, length, (long long unsigned)(*((uint64_t *)(data))), nest_level); break; case COL_TYPE_DOUBLE: printf(">%*s%s[%d] double: %.4f (%d)\n", (nest_level -1) * 4, "", property, length, *((double *)(data)), nest_level); break; case COL_TYPE_BOOL: printf(">%*s%s[%d] bool: %s (%d)\n", (nest_level -1) * 4, "", property, length, (*((unsigned char *)(data)) == '\0') ? "false" : "true", nest_level); break; case COL_TYPE_COLLECTION: if (!ignore) nest_level++; printf(">%*s%s[%d] header: count %d, ref_count %d class %d data: ", (nest_level -1) * 4, "", property, length, ((struct collection_header *)(data))->count, ((struct collection_header *)(data))->reference_count, ((struct collection_header *)(data))->cclass); /* Due to padding issues this is unsafe so ifdefed for now */ #ifdef COL_PRINT_BINARY_HEADER for (i = 0; i < length; i++) printf("%02X", ((unsigned char *)(data))[i]); #endif printf(" (%d)\n", nest_level); break; case COL_TYPE_COLLECTIONREF: printf(">%*s%s[%d] external link: ", (nest_level -1) * 4, "", property, length); for (i = 0; i < length; i++) printf("%02X", ((unsigned char *)(data))[i]); printf(" (%d)\n", nest_level); break; case COL_TYPE_END: printf(">%*sEND[N/A] (%d)\n", (nest_level -1) * 4, "", nest_level); if (!ignore) nest_level--; break; default: printf("Not implemented yet.\n"); break; } *(int *)(custom_data) = nest_level; TRACE_INFO_NUMBER("Nest level at the end:", nest_level); TRACE_FLOW_STRING("col_debug_handle", "Success exit."); return EOK; } /* Convenience function to debug an item */ inline int col_debug_item(struct collection_item *item) { int dummy = 0; int nest_level = -1; return col_debug_handle(item->property, item->property_len, item->type, item->data, item->length, (void *)(&nest_level), &dummy); } /* Print collection for debugging purposes */ int col_debug_collection(struct collection_item *handle, int flag) { int error = EOK; int nest_level = 0; TRACE_FLOW_STRING("col_debug_collection", "Entry."); printf("DEBUG COLLECTION %s\n", handle->property); flag |= COL_TRAVERSE_END; printf("Traverse flags %d\n", flag); /* Traverse collection */ error = col_traverse_collection(handle, flag, col_debug_handle, (void *)(&nest_level)); if (error) printf("Error debuging collection %d\n", error); TRACE_FLOW_STRING("col_debug_collection", "Exit."); return error; } /* Return a static string based on type of the element */ static inline const char *col_get_type(int type) { switch (type) { case COL_TYPE_STRING: return COL_TYPE_NAME_STRING; case COL_TYPE_INTEGER: return COL_TYPE_NAME_INTEGER; case COL_TYPE_UNSIGNED: return COL_TYPE_NAME_UNSIGNED; case COL_TYPE_LONG: return COL_TYPE_NAME_LONG; case COL_TYPE_ULONG: return COL_TYPE_NAME_ULONG; case COL_TYPE_BINARY: return COL_TYPE_NAME_BINARY; case COL_TYPE_DOUBLE: return COL_TYPE_NAME_DOUBLE; case COL_TYPE_BOOL: return COL_TYPE_NAME_BOOL; default: return COL_TYPE_NAME_UNKNOWN; } } /* Calculate the potential size of the item */ int col_get_data_len(int type, int length) { int len = 0; TRACE_FLOW_STRING("col_get_data_len", "Entry point"); switch (type) { case COL_TYPE_INTEGER: case COL_TYPE_UNSIGNED: len = 11; break; case COL_TYPE_LONG: case COL_TYPE_ULONG: len = 20; break; case COL_TYPE_STRING: case COL_TYPE_BINARY: len = length * 2 + 2; break; case COL_TYPE_DOUBLE: len = 64; break; case COL_TYPE_BOOL: len = 6; break; default: len = 0; break; } TRACE_FLOW_STRING("col_get_data_len","Exit point"); return len; } /* Copy data escaping characters */ static int col_copy_esc(char *dest, const char *source, char esc) { int i = 0; int j = 0; dest[j] = esc; j++; while (source[i]) { if ((source[i] == '\\') || (source[i] == esc)) { dest[j] = '\\'; j++; } dest[j] = source[i]; i++; j++; } dest[j] = esc; j++; return j; } /* Grow buffer to accomodate more space */ int col_grow_buffer(struct col_serial_data *buf_data, int len) { char *tmp; TRACE_FLOW_STRING("col_grow_buffer", "Entry point"); TRACE_INFO_NUMBER("Current length: ", buf_data->length); TRACE_INFO_NUMBER("Increment length: ", len); TRACE_INFO_NUMBER("Expected length: ", buf_data->length+len); TRACE_INFO_NUMBER("Current size: ", buf_data->size); /* Grow buffer if needed */ while (buf_data->length+len >= buf_data->size) { tmp = realloc(buf_data->buffer, buf_data->size + BLOCK_SIZE); if (tmp == NULL) { TRACE_ERROR_NUMBER("Error. Failed to allocate memory.", ENOMEM); return ENOMEM; } buf_data->buffer = tmp; buf_data->size += BLOCK_SIZE; TRACE_INFO_NUMBER("New size: ", buf_data->size); } TRACE_INFO_NUMBER("Final size: ", buf_data->size); TRACE_FLOW_STRING("col_grow_buffer", "Success Exit."); return EOK; } /* Specail function to add different formatting symbols to the output */ int col_put_marker(struct col_serial_data *buf_data, const void *data, int len) { int error = EOK; TRACE_FLOW_STRING("col_put_marker", "Entry point"); TRACE_INFO_NUMBER("Marker length: ", len); error = col_grow_buffer(buf_data, len); if (error) { TRACE_ERROR_NUMBER("col_grow_buffer failed with: ", error); return error; } memcpy(buf_data->buffer + buf_data->length, data, len); buf_data->length += len; buf_data->buffer[buf_data->length] = '\0'; TRACE_FLOW_STRING("col_put_marker","Success exit"); return error; } /* Add item's data */ int col_serialize(const char *property_in, int property_len_in, int type, void *data_in, int length_in, void *custom_data, int *dummy) { int len; struct col_serial_data *buf_data; const char *property; const void *data; int property_len; int length; int error = EOK; int i; TRACE_FLOW_STRING("col_serialize","Entry point"); *dummy = 0; /* Check is there is buffer. If not allocate */ buf_data = (struct col_serial_data *)custom_data; if (buf_data == NULL) { TRACE_ERROR_STRING("Error.", "Storage data is not passed in!"); return EINVAL; } if (buf_data->buffer == NULL) { TRACE_INFO_STRING("First time use.", "Allocating buffer."); buf_data->buffer = malloc(BLOCK_SIZE); if (buf_data->buffer == NULL) { TRACE_ERROR_NUMBER("Error. Failed to allocate memory.", ENOMEM); return ENOMEM; } buf_data->buffer[0] = '\0'; buf_data->length = 0; buf_data->size = BLOCK_SIZE; } TRACE_INFO_NUMBER("Buffer len: ", buf_data->length); TRACE_INFO_NUMBER("Buffer size: ", buf_data->size); TRACE_INFO_STRING("Buffer: ", buf_data->buffer); /* Check the beginning of the collection */ if (type == COL_TYPE_COLLECTION) { TRACE_INFO_STRING("Serializing collection: ", property_in); TRACE_INFO_STRING("First header. ", ""); error = col_put_marker(buf_data, "(", 1); if (error != EOK) return error; property = TEXT_COLLECTION; property_len = TEXT_COLLEN; data = property_in; length = property_len_in + 1; type = COL_TYPE_STRING; buf_data->nest_level++; } /* Check for subcollections */ else if (type == COL_TYPE_COLLECTIONREF) { /* Skip */ TRACE_FLOW_STRING("col_serialize", "skip reference return"); return EOK; } /* Check for the end of the collection */ else if (type == COL_TYPE_END) { if ((buf_data->length > 0) && (buf_data->buffer[buf_data->length-1] == ',')) { buf_data->length--; buf_data->buffer[buf_data->length] = '\0'; } if (buf_data->nest_level > 0) { buf_data->nest_level--; error = col_put_marker(buf_data, ")", 1); if (error != EOK) return error; } TRACE_FLOW_STRING("col_serialize", "end collection item processed returning"); return EOK; } else { property = property_in; property_len = property_len_in; data = data_in; length = length_in; } TRACE_INFO_STRING("Property: ", property); TRACE_INFO_NUMBER("Property length: ", property_len); /* Start with property and "=" */ if ((error = col_put_marker(buf_data, property, property_len)) || (error = col_put_marker(buf_data, "=", 1))) { TRACE_ERROR_NUMBER("put_marker returned error: ", error); return error; } /* Get projected length of the item */ len = col_get_data_len(type,length); TRACE_INFO_NUMBER("Expected data length: ",len); TRACE_INFO_STRING("Buffer so far: ", buf_data->buffer); /* Make sure we have enough space */ if ((error = col_grow_buffer(buf_data, len))) { TRACE_ERROR_NUMBER("grow_buffer returned error: ", error); return error; } /* Add the value */ switch (type) { case COL_TYPE_STRING: /* Escape double quotes */ len = col_copy_esc(&buf_data->buffer[buf_data->length], (const char *)(data), '"'); break; /* Here and below it is safe to use sprintf() becuase we * already pre-calculated the length and allocated buffer * of the right size. */ case COL_TYPE_BINARY: buf_data->buffer[buf_data->length] = '\''; for (i = 0; i < length; i++) sprintf(&buf_data->buffer[buf_data->length + i *2] + 1, "%02X", (unsigned int)(((const unsigned char *)(data))[i])); len = length * 2 + 1; buf_data->buffer[buf_data->length + len] = '\''; len++; break; case COL_TYPE_INTEGER: len = sprintf(&buf_data->buffer[buf_data->length], "%d", *((const int32_t *)(data))); break; case COL_TYPE_UNSIGNED: len = sprintf(&buf_data->buffer[buf_data->length], "%u", *((const uint32_t *)(data))); break; case COL_TYPE_LONG: len = sprintf(&buf_data->buffer[buf_data->length], "%lld", (long long int)(*((const int64_t *)(data)))); break; case COL_TYPE_ULONG: len = sprintf(&buf_data->buffer[buf_data->length], "%llu", (long long unsigned)(*((const uint64_t *)(data)))); break; case COL_TYPE_DOUBLE: len = sprintf(&buf_data->buffer[buf_data->length], "%.4f", *((const double *)(data))); break; case COL_TYPE_BOOL: len = sprintf(&buf_data->buffer[buf_data->length], "%s", (*((const unsigned char *)(data))) ? "true" : "false"); break; default: buf_data->buffer[buf_data->length] = '\0'; len = 0; break; } /* Adjust length */ buf_data->length += len; buf_data->buffer[buf_data->length] = '\0'; /* Always put a comma at the end */ error = col_put_marker(buf_data, ",", 1); if (error != EOK) { TRACE_ERROR_NUMBER("put_marker returned error: ", error); return error; } TRACE_INFO_STRING("Data: ", buf_data->buffer); TRACE_FLOW_STRING("col_serialize", "Exit point"); return EOK; } /* Print the collection using default serialization */ int col_print_collection(struct collection_item *handle) { struct col_serial_data buf_data; int error = EOK; TRACE_FLOW_STRING("col_print_collection", "Entry"); printf("COLLECTION:\n"); buf_data.buffer = NULL; buf_data.length = 0; buf_data.size = 0; buf_data.nest_level = 0; /* Traverse collection */ error = col_traverse_collection(handle, COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END , col_serialize, (void *)(&buf_data)); if (error) printf("Error traversing collection %d\n", error); else printf("%s\n", buf_data.buffer); free(buf_data.buffer); TRACE_FLOW_NUMBER("col_print_collection returning", error); return error; } /* Print the collection using iterator */ int col_print_collection2(struct collection_item *handle) { struct collection_iterator *iterator = NULL; int error = EOK; struct collection_item *item = NULL; int nest_level = 0; int dummy = 0; int line = 1; TRACE_FLOW_STRING("col_print_collection2", "Entry"); /* If we have something to print print it */ if (handle == NULL) { TRACE_ERROR_STRING("No error list", ""); return EINVAL; } /* Bind iterator */ error = col_bind_iterator(&iterator, handle, COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END | COL_TRAVERSE_SHOWSUB); if (error) { TRACE_ERROR_NUMBER("Error (bind):", error); return error; } do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { TRACE_ERROR_NUMBER("Error (iterate):", error); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; if (item->type != COL_TYPE_END) printf("%05d", line); col_debug_handle(item->property, item->property_len, item->type, item->data, item->length, (void *)(&nest_level), &dummy); line++; } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); TRACE_INFO_STRING("col_print_collection2", "Exit"); return EOK; } /* Find and print one item using default serialization */ int col_print_item(struct collection_item *handle, const char *name) { struct col_serial_data buf_data; int error = EOK; TRACE_FLOW_STRING("col_print_item", "Entry"); printf("PRINT ITEM:\n"); buf_data.buffer = NULL; buf_data.length = 0; buf_data.size = 0; buf_data.nest_level = 0; error = col_get_item_and_do(handle, name, COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, col_serialize, &buf_data); if(error) printf("Error searching collection %d\n", error); else { if (buf_data.buffer != NULL) { if (buf_data.length > 0) buf_data.length--; buf_data.buffer[buf_data.length] = '\0'; printf("%s\n", buf_data.buffer); free(buf_data.buffer); } else { printf("Name %s is not found in the collection %s.\n", name, handle->property); } } TRACE_FLOW_NUMBER("col_print_item returning", error); return error; } /* Function to free the list of properties. */ void col_free_property_list(char **str_list) { int current = 0; TRACE_FLOW_STRING("col_free_property_list","Entry"); if (str_list != NULL) { while(str_list[current]) { free(str_list[current]); current++; } free(str_list); } TRACE_FLOW_STRING("col_free_property_list","Exit"); } /* Convert collection to list of properties */ char **col_collection_to_list(struct collection_item *handle, int *size, int *error) { struct collection_iterator *iterator; struct collection_item *item = NULL; char **list; unsigned count; int err; int current = 0; TRACE_FLOW_STRING("col_collection_to_list","Entry"); /* Get number of the subsections */ err = col_get_collection_count(handle, &count); if (err) { TRACE_ERROR_NUMBER("Failed to get count of items from collection.", err); if (error) *error = err; return NULL; } /* Allocate memory for the sections */ list = (char **)malloc(count * sizeof(char *)); if (list == NULL) { TRACE_ERROR_NUMBER("Failed to get allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Now iterate to fill in the sections */ /* Bind iterator */ err = col_bind_iterator(&iterator, handle, COL_TRAVERSE_ONELEVEL); if (err) { TRACE_ERROR_NUMBER("Failed to bind.", err); if (error) *error = err; free(list); return NULL; } while(1) { /* Loop through a collection */ err = col_iterate_collection(iterator, &item); if (err) { TRACE_ERROR_NUMBER("Failed to iterate collection", err); if (error) *error = err; col_free_property_list(list); col_unbind_iterator(iterator); return NULL; } /* Are we done ? */ if (item == NULL) break; TRACE_INFO_STRING("Property:", col_get_item_property(item, NULL)); /* Skip head */ if(col_get_item_type(item) == COL_TYPE_COLLECTION) continue; /* Allocate memory for the new string */ list[current] = strdup(col_get_item_property(item, NULL)); if (list[current] == NULL) { TRACE_ERROR_NUMBER("Failed to dup string.", ENOMEM); if (error) *error = ENOMEM; col_free_property_list(list); return NULL; } current++; } list[current] = NULL; /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); if (size) *size = (int)(count - 1); if (error) *error = EOK; TRACE_FLOW_STRING("col_collection_to_list returning", ((list == NULL) ? "NULL" : list[0])); return list; } ding-libs-0.6.2/collection/collection_tools.h000066400000000000000000000176661417260640400212720ustar00rootroot00000000000000/* COLLECTION LIBRARY Header file for supplementary functions that provide printing and debugging of collections. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #ifndef COLLECTION_TOOLS_H #define COLLECTION_TOOLS_H #include "collection.h" /** * @defgroup tools TOOLS interface * * Additional functions retaed to tracing, * printing, debugging and serializaing collections. * * Functions in this module are more a sample implementation * than a part of the interface. There is a chance they will * change over time. * * @{ */ #ifdef HAVE_TRACE #define COL_DEBUG_COLLECTION(collection) col_debug_collection(collection,COL_TRAVERSE_DEFAULT); #else #define COL_DEBUG_COLLECTION(collection) ; #endif /** @brief Name used for string type. */ #define COL_TYPE_NAME_STRING "string" /** @brief Name used for binary type. */ #define COL_TYPE_NAME_BINARY "bin" /** @brief Name used for integer type. */ #define COL_TYPE_NAME_INTEGER "int" /** @brief Name used for unsigned integer type. */ #define COL_TYPE_NAME_UNSIGNED "uint" /** @brief Name used for long type. */ #define COL_TYPE_NAME_LONG "long" /** @brief Name used for unsigned long type. */ #define COL_TYPE_NAME_ULONG "ulong" /** @brief Name used for floating point type. */ #define COL_TYPE_NAME_DOUBLE "double" /** @brief Name used for boolean type. */ #define COL_TYPE_NAME_BOOL "bool" /** @brief Name used for unknown type. */ #define COL_TYPE_NAME_UNKNOWN "unknown" /** @brief Literal used in the default serialization. */ #define TEXT_COLLECTION "SET" /** @brief Length of the \ref TEXT_COLLECTION literal. */ #define TEXT_COLLEN 3 /** * @brief The data will be allocated in BLOCK_SIZE * blocks during serialization. */ #define BLOCK_SIZE 1024 /** * @struct col_serial_data * @brief Structure is used to incrementaly serialize collection. */ struct col_serial_data { char *buffer; int size; int length; int nest_level; }; /** * @brief Calculate the potential size of the item. * * @param[in] type Type of the value. * @param[in] length Length of the value. * * @return Maximum length the value would occupy when serialized. */ int col_get_data_len(int type, int length); /** * @brief Grow serialization buffer. * * @param[in] buf_data Serialization object. * @param[in] len For how much the serialization storage * should be incrementally increased. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_grow_buffer(struct col_serial_data *buf_data, int len); /** * @brief Add special data to the serialization output. * * @param[in] buf_data Serialization object. * @param[in] data Pointer to special data. * @param[in] len Length of the data to insert. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_put_marker(struct col_serial_data *buf_data, const void *data, int len); /** * @brief Serialization of data callback. * * @param[in] property_in Property to serialize. * @param[in] property_len_in Length of the property to serialize. * @param[in] type Type of the value. * @param[in] data_in Value to serialize. * @param[in] length_in Length of the value. * @param[in] custom_data State data passed to callback. * It is actually a serialization object. * @param[in] dummy Not used. It is here because * the callback needs to comply * to the functions signature. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_serialize(const char *property_in, int property_len_in, int type, void *data_in, int length_in, void *custom_data, int *dummy); /** * @brief Debug property callback. * * @param[in] property Property to debug. * @param[in] property_len Length of the property to debug. * @param[in] type Type of the value. * @param[in] data Value to serialize. * @param[in] length Length of the value. * @param[in] custom_data State data passed to the callback. * @param[in] dummy Not used. It is here because * the callback needs to comply * to the functions signature. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_debug_handle(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy); /** * @brief Convenience function to debug an item. * * Prints item internals. * * @param[in] item Item to print. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_debug_item(struct collection_item *item); /** * @brief Print collection for debugging purposes. * * Prints collection internals. * * @param[in] handle Collection to debug. * @param[in] flag See traverse flags. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_debug_collection(struct collection_item *handle, int flag); /** * @brief Print collection data. * * Prints collection data. * Uses traverse function to iterate through * the collection. * * @param[in] handle Collection to print. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_print_collection(struct collection_item *handle); /** * @brief Print collection data. * * Prints collection data. * Uses iterator to process the collection. * * @param[in] handle Collection to print. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_print_collection2(struct collection_item *handle); /** * @brief Find and print one property. * * Prints item data. * * @param[in] handle Collection to search. * @param[in] name Item to find and print. * * @return 0 - Success. * @return ENOMEM - No memory. */ int col_print_item(struct collection_item *handle, const char *name); /** * @brief Convert collection to the array of properties. * * @param[in] handle Collection to convert. * @param[in] size Will receive the number of * the strings in the array. * Can be NULL if caller is not interested * in the size of the array. * @param[in] error Will receive error value if any. * Can be NULL if the caller does * not care about error codes. * - 0 - Success. * - ENOMEM - No memory. * * @return List of strings that constitute * the properties in the collection. * Collection name is not included. */ char **col_collection_to_list(struct collection_item *handle, int *size, int *error); /** * @brief Free list of properties. * * @param[in] str_list List to free. */ void col_free_property_list(char **str_list); /** * @} */ #endif ding-libs-0.6.2/collection/collection_ut.c000066400000000000000000002451571417260640400205530ustar00rootroot00000000000000/* COLLECTION LIBRARY Collection unit test. Copyright (C) Dmitri Pal 2009 Collection Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Collection Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Collection Library. If not, see . */ #include "config.h" #include #include #include #define TRACE_HOME #include "trace.h" #include "collection.h" #include "collection_tools.h" typedef int (*test_fn)(void); int verbose = 0; #define COLOUT(foo) \ do { \ if (verbose) foo; \ } while(0) static int dup_test(void) { int error = EOK; struct collection_item *dup = NULL; struct collection_item *item = NULL; int i; const char *results[] = { "value5", "value5", "value0", "value1", "value2", "value3", "value4", "value5" }; TRACE_FLOW_ENTRY(); COLOUT(printf("\n\nDUP TEST!!!.\n\n\n")); COLOUT(printf("Creating DUP collection.\n")); if ((error = col_create_collection(&dup, "dup", 0)) || (error = col_add_str_property(dup, NULL, "key", "value0", 0)) || (error = col_add_str_property(dup, NULL, "key", "value1", 0)) || (error = col_add_str_property(dup, NULL, "key", "value2", 0)) || (error = col_add_str_property(dup, NULL, "foo", "bar", 0)) || (error = col_add_str_property(dup, NULL, "key", "value3", 0)) || (error = col_add_str_property(dup, NULL, "key", "value4", 0)) || (error = col_add_str_property(dup, NULL, "key", "value5", 0))) { printf("Failed to add property. Error %d\n", error); col_destroy_collection(dup); return error; } COLOUT(col_debug_collection(dup, COL_TRAVERSE_DEFAULT)); if (!col_get_dup_item(NULL, NULL, "key", COL_TYPE_ANY, 10000, 0, &item) || !col_get_dup_item(dup, NULL, NULL, COL_TYPE_ANY, 10000, 0, &item) || !col_get_dup_item(dup, NULL, "key", COL_TYPE_ANY, 10000, 1, &item) || !col_get_dup_item(dup, NULL, "key", COL_TYPE_STRING, 0, 1, NULL)) { /* Expected error but did not get it */ printf("Expected error but got success.\n"); col_destroy_collection(dup); return EINVAL; } for (i = 0; i < 6; i++) { error = col_get_dup_item(dup, NULL, "key", COL_TYPE_STRING, i, 1, &item); if (error) { printf("Search returned error %d.\n", error); col_destroy_collection(dup); return error; } if (!item) { printf("Item should be found - but in reality is NULL.\n"); col_destroy_collection(dup); return EINVAL; } if (strcmp((char *)col_get_item_data(item), results[i+2]) != 0) { printf("Expected %s got %s.\n", results[i+2], (char *)col_get_item_data(item)); col_destroy_collection(dup); return EINVAL; } } col_destroy_collection(dup); TRACE_FLOW_EXIT(); COLOUT(printf("\n\nEND OF DUP TEST!!!.\n\n\n")); return EOK; } static int ref_collection_test(void) { struct collection_item *peer = NULL; struct collection_item *socket = NULL; struct collection_item *socket2 = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; int error = EOK; TRACE_FLOW_STRING("ref_collection_test", "Entry."); COLOUT(printf("\n\nREF TEST!!!.\n\n\n")); COLOUT(printf("Creating PEER collection.\n")); if ((error = col_create_collection(&peer, "peer", 0)) || (error = col_add_str_property(peer, NULL, "hostname", "peerhost.mytest.com", 0)) || /* Expect trailing zero to be truncated */ (error = col_add_str_property(peer, NULL, "IPv4", "10.10.10.10", 12)) || (error = col_add_str_property(peer, NULL, "IPv6", "bla:bla:bla:bla:bla:bla", 0))) { printf("Failed to add property. Error %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("Creating SOCKET collection.\n")); if ((error = col_create_collection(&socket, "socket", 0)) || (error = col_add_int_property(socket, NULL, "id", 1)) || (error = col_add_long_property(socket, NULL, "packets", 100000000L)) || (error = col_add_binary_property(socket, NULL, "stack", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(peer); col_destroy_collection(socket); printf("Failed to add property. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Adding PEER collection to SOCKET collection as a reference named PEER\n")); /* Embed peer host into the socket2 as reference */ error = col_add_collection_to_collection(socket, NULL, "peer", peer, COL_ADD_MODE_REFERENCE); if (error) { col_destroy_collection(peer); col_destroy_collection(socket); printf("Failed to add collection to collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); COLOUT(printf("About to destroy PEER\n")); col_destroy_collection(peer); COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(printf("About to extract PEER\n")); error = col_get_collection_reference(socket, &peer, "peer"); if (error) { col_destroy_collection(socket); printf("Failed to extract collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); col_destroy_collection(peer); COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); error = col_get_collection_reference(socket, &socket2, NULL); if (error) { col_destroy_collection(socket); printf("Failed to extract collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket2, COL_TRAVERSE_DEFAULT)); col_destroy_collection(socket); COLOUT(col_debug_collection(socket2, COL_TRAVERSE_DEFAULT)); col_destroy_collection(socket2); TRACE_FLOW_NUMBER("ref_collection_test. Returning", error); COLOUT(printf("\n\nEND OF REF TEST!!!.\n\n\n")); return error; } static int single_collection_test(void) { struct collection_item *handle = NULL; int error = EOK; TRACE_FLOW_STRING("single_collection_test", "Entry."); if ((error = col_create_collection(&handle, "string_test", 0)) || (error = col_add_str_property(handle, NULL, "property_1", "some data", 0)) || (error = col_add_str_property(handle, NULL, "property_2", "some other data", 2)) || (error = col_add_str_property(handle, NULL, "property_3", "more data", 7))) { printf("Failed to add property. Error %d\n", error); col_destroy_collection(handle); return error; } error = col_add_str_property(handle, NULL, "property 1!", "some data", 0); if (error) { COLOUT(printf("Expected error adding bad property to collection %d\n", error)); } else { printf("Expected error but got success\n"); return -1; } error = col_add_double_property(handle, NULL, "double", 0.253545); if (error) { printf("Failed to add double property. Error %d\n", error); col_destroy_collection(handle); return error; } error = col_update_double_property(handle, "double", COL_TRAVERSE_DEFAULT, 1.999999); if (error) { printf("Failed to update double property. Error %d\n", error); col_destroy_collection(handle); return error; } COLOUT(printf("Created collection\n")); /* Traverse collection */ if (verbose) { error = col_debug_collection(handle, COL_TRAVERSE_DEFAULT); if (error) { printf("Error debugging collection %d\n", error); return error; } error = col_print_collection(handle); if (error) { printf("Error printing collection %d\n", error); return error; } } col_destroy_collection(handle); TRACE_FLOW_NUMBER("single_collection_test. Error: ", error); return error; } static int add_collection_test(void) { struct collection_item *peer = NULL; struct collection_item *socket = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; int error = EOK; TRACE_FLOW_STRING("add_collection_test", "Entry."); COLOUT(printf("\n\nADD TEST!!!.\n\n\n")); COLOUT(printf("Creating PEER collection.\n")); if ((error = col_create_collection(&peer, "peer", 0)) || (error = col_add_str_property(peer, NULL, "hostname", "peerhost.mytest.com", 0)) || /* Expect trailing zero to be truncated */ (error = col_add_str_property(peer, NULL, "IPv4", "10.10.10.10", 12)) || (error = col_add_str_property(peer, NULL, "IPv6", "bla:bla:bla:bla:bla:bla", 0))) { printf("Failed to add property. Error %d", error); col_destroy_collection(peer); return error; } COLOUT(printf("Creating SOCKET collection.\n")); if ((error = col_create_collection(&socket, "socket", 0)) || (error = col_add_int_property(socket, NULL, "id", 1)) || (error = col_add_long_property(socket, NULL, "packets", 100000000L)) || (error = col_add_binary_property(socket, NULL, "stack", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(peer); col_destroy_collection(socket); printf("Failed to add property. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Adding PEER collection to SOCKET collection as a reference named PEER\n")); /* Embed peer host into the socket2 as reference */ error = col_add_collection_to_collection(socket, NULL, "peer", peer, COL_ADD_MODE_REFERENCE); if (error) { col_destroy_collection(peer); col_destroy_collection(socket); printf("Failed to create collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); col_destroy_collection(peer); COLOUT(col_debug_collection(socket, COL_TRAVERSE_DEFAULT)); col_destroy_collection(socket); TRACE_FLOW_NUMBER("add_collection_test. Returning", error); return error; } static int copy_cb(struct collection_item *item, void *ext_data, int *skip) { COLOUT(printf("INSIDE Copy Callback\n")); COLOUT(col_debug_item(item)); COLOUT(printf("Passed in data: %s\n", (char *) ext_data)); if (strcmp(col_get_item_property(item, NULL), "id") == 0) *skip = 1; return EOK; } static int mixed_collection_test(void) { struct collection_item *peer; struct collection_item *socket1; struct collection_item *socket2; struct collection_item *socket3; struct collection_item *event; struct collection_item *host; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; int found = 0; unsigned int class = 0; char foo[] = "foo"; int error = EOK; TRACE_FLOW_STRING("mixed_collection_test", "Entry."); COLOUT(printf("\n\nMIXED TEST!!!.\n\n\n")); COLOUT(printf("Creating PEER collection.\n")); if ((error = col_create_collection(&peer, "peer", 0)) || (error = col_add_str_property(peer, NULL, "hostname", "peerhost.mytest.com", 0)) || /* Expect trailing zero to be truncated */ (error = col_add_str_property(peer, NULL, "IPv4", "10.10.10.10", 12)) || (error = col_add_str_property(peer, NULL, "IPv6", "bla:bla:bla:bla:bla:bla", 0))) { printf("Failed to add property. Error %d", error); col_destroy_collection(peer); return error; } COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Creating HOST collection.\n")); if ((error = col_create_collection(&host, "host", 0)) || (error = col_add_str_property(host, NULL, "hostname", "myhost.mytest.com", 0)) || (error = col_add_str_property(host, NULL, "IPv4", "20.20.20.20", 13)) || (error = col_add_str_property(host, NULL, "IPv6", "bla:bla:bla:bla:bla:bla", 0)) || (error = col_add_double_property(host, NULL, "double", 0.253545))) { printf("Failed to add property. Error %d", error); col_destroy_collection(peer); col_destroy_collection(host); return error; } COLOUT(col_debug_collection(host, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Creating SOCKET1 collection.\n")); if ((error = col_create_collection(&socket1, "socket1", 0)) || (error = col_add_int_property(socket1, NULL, "id", 1)) || (error = col_add_long_property(socket1, NULL, "packets", 100000000L)) || (error = col_add_binary_property(socket1, NULL, "stack", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); printf("Failed to add property. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket1, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Creating a copy of SOCKET1 collection named SOCKET2.\n")); error = col_copy_collection(&socket2, socket1, "socket2", COL_COPY_NORMAL); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); printf("Failed to copy collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket2, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); error = col_copy_collection_with_cb(&socket3, socket1, "socket3", COL_COPY_FLATDOT, copy_cb, (void *)foo); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); col_destroy_collection(socket2); printf("Failed to copy collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket3, COL_TRAVERSE_DEFAULT)); col_destroy_collection(socket3); COLOUT(printf("Adding PEER collection to SOCKET2 collection as a reference named PEER2\n")); /* Embed peer host into the socket2 as reference */ error = col_add_collection_to_collection(socket2, NULL, "peer2", peer, COL_ADD_MODE_REFERENCE); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); col_destroy_collection(socket2); printf("Failed to create collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket2, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Creating an EVENT collection.\n")); /* Construct event */ error = col_create_collection(&event, "event", 0); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); col_destroy_collection(socket2); printf("Failed to create collection. Error %d\n", error); return error; } COLOUT(col_debug_collection(event, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Adding HOST to EVENT.\n")); /* Add host to event */ error = col_add_collection_to_collection(event, NULL, NULL, host, COL_ADD_MODE_REFERENCE); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to add collections. Error %d\n", error); return error; } COLOUT(col_debug_collection(event, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Embed SOCKET1 into EVENT.\n")); /* Donate socket1 to event */ /* Socket1 should not be used after this */ error = col_add_collection_to_collection(event, NULL, NULL, socket1, COL_ADD_MODE_EMBED); if (error) { col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket1); col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to add collections. Error %d\n", error); return error; } COLOUT(printf("Traverse one level:\n")); COLOUT(col_debug_collection(event, COL_TRAVERSE_ONELEVEL)); COLOUT(printf("Traverse ignore subcollections:\n")); COLOUT(col_debug_collection(event, COL_TRAVERSE_IGNORE)); COLOUT(printf("Traverse normal:\n")); COLOUT(col_debug_collection(event, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(socket1, COL_TRAVERSE_DEFAULT)); COLOUT(printf("SOCKET1 MUST NOT BE USED AFTER THIS POINT!!!\n")); socket1 = NULL; COLOUT(printf("Add collection PEER as PEER1 to subcollection SOCKET1 of the EVENT.\n")); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); error = col_add_collection_to_collection(event, "socket1", "peer1", peer, COL_ADD_MODE_CLONE); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to add collections. Error %d\n", error); return error; } COLOUT(col_debug_collection(event, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Add property named TIMEOUT to PEER collection.\n")); /* Add new property to the peer collection */ error = col_add_int_property(peer, NULL, "timeout", 5); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to add property. Error %d\n", error); return error; } COLOUT(col_debug_collection(socket2, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Add property named DELAY to PEER1 collection.\n")); error = col_add_int_property(event, "peer1", "delay", 10); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to add property. Error %d\n", error); return error; } COLOUT(col_debug_collection(event, COL_TRAVERSE_DEFAULT)); COLOUT(col_debug_collection(host, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Check if property PEER1.DELAY is in the EVENT collection.\n")); /* Check if the property in the collection */ found = 0; error = col_is_item_in_collection(event, "peer1!delay", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to check property. Error %d\n", error); return error; } if (found == 1) { COLOUT(printf("Property is found!\n")); } else { COLOUT(printf("Error property is not found!\n")); } COLOUT(col_print_item(event, "peer1!IPv6")); COLOUT(col_print_item(event, "event!socket1!peer1!IPv6")); COLOUT(col_print_item(event, "event!peer1!IPv6")); COLOUT(col_print_item(event, "speer1!IPv6")); COLOUT(col_print_item(event, "eer1!IPv6")); COLOUT(col_print_item(event, "!peer1!IPv6")); COLOUT(col_print_item(event, "t!peer1!IPv6")); /* Traverse collection */ if (verbose) { error = col_print_collection2(event); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Error printing collection %d\n", error); return error; } } COLOUT(printf("Delete property PEER1!DELAY from the EVENT collection.\n")); error = col_delete_property(event, "peer1!delay", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Failed to delete property. Error %d\n", error); return error; } COLOUT(printf("Printing EVENT.\n")); /* Traverse collection */ if (verbose) { error = col_print_collection2(event); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Error printing collection %d\n", error); return error; } } COLOUT(printf("Debugging EVENT.\n")); if (verbose) { error = col_debug_collection(event, COL_TRAVERSE_DEFAULT); if (error) { col_destroy_collection(peer); col_destroy_collection(host); /* No socket1 any more :) */ col_destroy_collection(socket2); col_destroy_collection(event); printf("Error printing collection %d\n", error); return error; } } COLOUT(printf("Cleanup of the collections PEER, HOST and SOCKET2.\n")); /* Destroy a referenced collection */ col_destroy_collection(peer); col_destroy_collection(host); col_destroy_collection(socket2); COLOUT(printf("Printing EVENT again.\n")); /* Traverse collection again - peer should still be there */ if (verbose) { error = col_print_collection(event); if (error) { col_destroy_collection(event); printf("Error printing collection %d\n", error); return error; } } COLOUT(printf("Debugging EVENT again.\n")); if (verbose) { error = col_debug_collection(event, COL_TRAVERSE_DEFAULT); if (error) { col_destroy_collection(event); printf("Error printing collection %d\n", error); return error; } } COLOUT(printf("Attempt to add property to a referenced collection.\n")); error = col_add_int_property(event, "host", "session", 500); if (error) { col_destroy_collection(event); printf("Error was NOT able to add property to a referenced collection %d.\n", error); return error; } COLOUT(printf("Attempt to delete non-existent property.\n")); /* Can't delete non exitent property */ error = col_delete_property(event, "host.host", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT); if (error == 0) { col_destroy_collection(event); printf("Error was able to delete property that does not exist.\n"); return -1; } else COLOUT(printf("Expected error %d\n", error)); /* Set collection class */ error = col_set_collection_class(event, 2); if (error != 0) { col_destroy_collection(event); printf("Error was NOT able to set class.\n"); return error; } error = col_get_collection_class(event, &class); if (error != 0) { col_destroy_collection(event); printf("Error was NOT able to get class.\n"); return error; } else COLOUT(printf("Class = %d\n", class)); if (col_is_of_class(event, 2)) { COLOUT(printf("Class mathced!\n")); } else { col_destroy_collection(event); printf("Error - bad class.\n"); return -1; } COLOUT(printf("Done. Cleaning...\n")); col_destroy_collection(event); COLOUT(printf("Exit.\n")); TRACE_FLOW_NUMBER("add_collection_test. Returning", EOK); return EOK; } static int iterator_test(void) { struct collection_item *peer = NULL; struct collection_item *initial = NULL; struct collection_item *socket1 = NULL; struct collection_item *socket2 = NULL; struct collection_item *socket3 = NULL; struct collection_iterator *iterator = NULL; int error = EOK; struct collection_item *item = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; int depth = 0; int idepth = 0; int len = 0; int i; uint64_t hash1, hash2; int rwnd = 0; COLOUT(printf("\n\n==== ITERATOR TEST ====\n\n")); if ((error = col_create_collection(&initial, "strater", 0)) || (error = col_create_collection(&peer, "peer", 0)) || (error = col_add_str_property(initial, NULL, "hostname", "peerhost.mytest.com", 0)) || /* Expect trailing zero to be truncated */ (error = col_add_str_property(initial, NULL, "IPv4", "10.10.10.10", 12)) || (error = col_add_str_property(initial, NULL, "IPv6", "bla:bla:bla:bla:bla:bla", 0)) || (error = col_add_collection_to_collection(peer, NULL, NULL, initial, COL_ADD_MODE_FLAT))) { printf("Failed to add property. Error %d", error); col_destroy_collection(peer); col_destroy_collection(initial); return error; } col_destroy_collection(initial); if ((error = col_create_collection(&socket1, "socket", 0)) || (error = col_add_int_property(socket1, NULL, "id", 1)) || (error = col_add_long_property(socket1, NULL, "packets", 100000000L)) || (error = col_add_binary_property(socket1, NULL, "stack", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(peer); col_destroy_collection(socket1); printf("Failed to add property. Error %d\n", error); return error; } if ((error = col_create_collection(&socket2, "socket", 0)) || (error = col_add_int_property(socket2, NULL, "id", 2)) || (error = col_add_long_property(socket2, NULL, "packets", 200000000L)) || (error = col_add_binary_property(socket2, NULL, "queue", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(peer); col_destroy_collection(socket1); col_destroy_collection(socket2); printf("Failed to add property. Error %d\n", error); return error; } if ((error = col_create_collection(&socket3, "socket", 0))) { col_destroy_collection(peer); col_destroy_collection(socket1); col_destroy_collection(socket2); printf("Failed to add property. Error %d\n", error); return error; } error = col_add_collection_to_collection(peer, NULL, "first", socket1, COL_ADD_MODE_REFERENCE); if (error) { col_destroy_collection(peer); col_destroy_collection(socket1); col_destroy_collection(socket2); col_destroy_collection(socket3); printf("Failed to add collection to collection. Error %d\n", error); return error; } error = col_add_collection_to_collection(peer, NULL, "second", socket2, COL_ADD_MODE_EMBED); if (error) { col_destroy_collection(peer); col_destroy_collection(socket1); col_destroy_collection(socket2); col_destroy_collection(socket3); printf("Failed to add collection to collection. Error %d\n", error); return error; } error = col_add_collection_to_collection(peer, NULL, "third", socket3, COL_ADD_MODE_EMBED); if (error) { col_destroy_collection(peer); col_destroy_collection(socket1); col_destroy_collection(socket3); printf("Failed to add collection to collection. Error %d\n", error); return error; } error = col_add_collection_to_collection(peer, NULL, "forth", socket1, COL_ADD_MODE_FLATDOT); if (error) { col_destroy_collection(peer); col_destroy_collection(socket1); printf("Failed to add collection to collection. Error %d\n", error); return error; } error = col_add_collection_to_collection(peer, NULL, NULL, socket1, COL_ADD_MODE_FLATDOT); if (error) { col_destroy_collection(peer); col_destroy_collection(socket1); printf("Failed to add collection to collection. Error %d\n", error); return error; } col_destroy_collection(socket1); /* Bind iterator */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_DEFAULT); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nCollection (traverse default):\n\n")); COLOUT(col_debug_collection(peer, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\n\nCollection (traverse flat):\n\n")); COLOUT(col_debug_collection(peer, COL_TRAVERSE_FLAT | COL_TRAVERSE_END)); COLOUT(printf("\n\nIteration (1):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); idepth = 0; col_get_iterator_depth(iterator, &idepth); COLOUT(printf("%*sProperty (%s), type = %d, data size = %d depth = %d idepth = %d\n", depth * 4, "", col_get_item_property(item, NULL), col_get_item_type(item), col_get_item_length(item), depth, idepth)); if ((strcmp(col_get_item_property(item, NULL), "id")==0) && (*((int *)(col_get_item_data(item))) == 1)) { COLOUT(printf("\n\nFound property we need - go up!!!\n\n\n")); /* This should work! */ error = col_iterate_up(iterator, 1); if (error) { printf("We expected success but got error %d\n", error); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } if ((error = col_modify_str_item(item, "id2", "test", 0)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_str_item(item, NULL, "test", 2)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_binary_item(item, NULL, binary_dump, sizeof(binary_dump))) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_bool_item(item, NULL, 1)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_int_item(item, "int", 1)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_long_item(item, "long", 1000000000L)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_ulong_item(item, "ulong", 4000000000UL)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_unsigned_item(item, "unsigned", 4000000000U)) || ((verbose) && (error = col_debug_item(item))) || (error = col_modify_double_item(item, "double", -1.1)) || ((verbose) && (error = col_debug_item(item)))) { printf("Failed to change property.\n"); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } COLOUT(printf("Item name: %s\n", col_get_item_property(item, NULL))); COLOUT(printf("Item hash: %lu\n", (unsigned long int)col_get_item_hash(item))); error = col_modify_item_property(item, "new_name"); if (error) { printf("We expected success but got error %d\n", error); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } len = 0; COLOUT(printf("Item name: %s\n", col_get_item_property(item, &len))); COLOUT(printf("Item hash: %lu\n", (unsigned long int)col_get_item_hash(item))); COLOUT(printf("Item length: %d\n", len)); len = 0; hash1 = col_make_hash("new_name", 0, &len); COLOUT(printf("String name: %s\n", "new_name")); COLOUT(printf("String hash: %lu\n", (unsigned long int)hash1)); COLOUT(printf("String length: %d\n", len)); len = 0; hash2 = col_make_hash("new_name_suffix", 8, &len); COLOUT(printf("String name: %.*s\n", len, "new_name_suffix")); COLOUT(printf("String hash: %lu\n", (unsigned long int)hash2)); COLOUT(printf("String length: %d\n", len)); if (hash1 != hash2) { printf("Hash calculation failed\n"); col_unbind_iterator(iterator); col_destroy_collection(peer); return EINVAL; } hash2 = col_make_hash("new_name", 8, &len); COLOUT(printf("String name: %.*s\n", len, "new_name")); COLOUT(printf("String hash: %lu\n", (unsigned long int)hash2)); COLOUT(printf("String length: %d\n", len)); if (hash1 != hash2) { printf("Hash calculation failed\n"); col_unbind_iterator(iterator); col_destroy_collection(peer); return EINVAL; } } } while(1); col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_FLAT); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (2 - flat):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); if ((strcmp(col_get_item_property(item, NULL), "queue") == 0) && (rwnd == 0)) { COLOUT(printf("Rewinding iterator...\n")); col_rewind_iterator(iterator); rwnd++; } } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_FLAT | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (3 flat with end):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (4 default with end):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_SHOWSUB | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (5 show headers and references with end):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_SHOWSUB); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (6 show headers and references no END):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_ONLYSUB); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIteration (7 show headers only no END):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_DEFAULT); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nIterate up test:\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } /* Are we done ? */ if (item == NULL) break; depth = 0; col_get_item_depth(iterator, &depth); idepth = 0; col_get_iterator_depth(iterator, &idepth); COLOUT(printf("%*sProperty (%s), type = %d, data size = %d depth = %d idepth = %d\n", depth * 4, "", col_get_item_property(item, NULL), col_get_item_type(item), col_get_item_length(item), depth, idepth)); if (strcmp(col_get_item_property(item, NULL), "queue") == 0) { COLOUT(printf("\n\nFound property we need - go up!!!\n")); COLOUT(printf("Expect bail out of collection processing.\n\n")); /* This should work! */ error = col_iterate_up(iterator, 10); if (error) { printf("We expected success but got error %d\n", error); col_unbind_iterator(iterator); col_destroy_collection(peer); return error; } } } while(1); col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_FLAT | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nCircled looping:\n\n")); for (i = 0; i < 200; i++) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) { COLOUT(printf("Reached end.\n\n")); } else { depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_FLAT | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nCircled looping with pin:\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } if (strcmp(col_get_item_property(item, NULL), "queue") == 0) { /* Make it a new looping point */ col_pin_iterator(iterator); COLOUT(printf("Found pin point.\n\n")); break; } /* Are we done ? */ if (item == NULL) { printf("Unexpected end.\n\n"); col_destroy_collection(peer); col_unbind_iterator(iterator); return EINVAL; } else { depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } } while(1); /* Second loop around the pin point */ for (i = 0; i < 200; i++) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) { COLOUT(printf("Reached end.\n\n")); } else { depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); /* Bind iterator again in flat mode */ error = col_bind_iterator(&iterator, peer, COL_TRAVERSE_DEFAULT | COL_TRAVERSE_END); if (error) { printf("Error (bind): %d\n", error); col_destroy_collection(peer); return error; } COLOUT(printf("\n\nCircled looping with pin (default):\n\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } if (strcmp(col_get_item_property(item, NULL), "queue") == 0) { /* Make it a new looping point */ col_pin_iterator(iterator); COLOUT(printf("Found pin point.\n\n")); break; } /* Are we done ? */ if (item == NULL) { printf("Unexpected end.\n\n"); col_destroy_collection(peer); col_unbind_iterator(iterator); return EINVAL; } else { depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } } while(1); /* Second loop around the pin point */ for (i = 0; i < 200; i++) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error (iterate): %d\n", error); col_destroy_collection(peer); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) { COLOUT(printf("Reached end.\n\n")); } else { depth = 0; col_get_item_depth(iterator, &depth); COLOUT(printf("%*s", depth * 4, "")); COLOUT(col_debug_item(item)); } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); col_destroy_collection(peer); return EOK; } static int validate_collection(struct collection_item *col, const char *varray[][2]) { struct collection_iterator *iterator = NULL; int error = EOK; struct collection_item *item = NULL; int count = -1; COLOUT(printf("\n\n==== Validating collection ====\n\n")); /* Bind iterator */ error = col_bind_iterator(&iterator, col, COL_TRAVERSE_DEFAULT); if (error) { COLOUT(printf("Error (bind): %d\n", error)); return error; } do { count++; /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { COLOUT(printf("Error (iterate): %d\n", error)); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; /* Set count when we skip header */ if (col_get_item_type(item) == COL_TYPE_COLLECTION) { count = -1; continue; } if (varray[count][0] == NULL) { /* We have reached the end of the array but not the collection. * This means the test failed. Return error. */ COLOUT(printf("Got extra item in the collection: %s=%s\n", col_get_item_property(item, NULL), (char *)(col_get_item_data(item)))); col_unbind_iterator(iterator); return -1; } if ((strcmp(col_get_item_property(item, NULL), varray[count][0]) != 0) || (strcmp((char *)(col_get_item_data(item)), varray[count][1]) != 0 )) { COLOUT(printf("Expected %s=\"%s\" got %s=\"%s\" \n", varray[count][0], varray[count][1], col_get_item_property(item, NULL), (char *)(col_get_item_data(item)))); col_unbind_iterator(iterator); return -1; } } while(1); col_unbind_iterator(iterator); if (varray[count][0] != NULL) { COLOUT(printf("Expected end got %s=\"%s\"\n", varray[count][0], varray[count][1])); return -1; } COLOUT(printf("\n\n==== Validating collection - OK ====\n\n")); return EOK; } static int insert_extract_test(void) { struct collection_item *col; struct collection_item *col2; int error = EOK; struct collection_item *item = NULL; const char *varray1[][2] = { { "property_-1", "value_-1" }, { "property0", "value0lastdup" }, { "property0_5", "value0_5" }, { "property1", "value1update" }, { "second", "second" }, { "property1_5", "value1_5" }, { "property2", "value2" }, { "property10", "value10" }, { "property10", "value10lastdup" }, { "property_-2", "value-2moved_to_bottom" }, { "property0", "extra_1" }, { "property100", "value100" }, { NULL, NULL } }; const char *varray2[][2] = { { "property_-1_5","value_-1_5" }, { "property1_6", "value_1_6_moved_to_front" }, { "property0", "very_last" }, { "property10", "value10dup" }, { "property_-0_5", "value_-0_5" }, { "property0", "value0firstdupupdate" }, { "property0", "value0" }, { "property0", "before 0_5" }, { "property0", "value0middledup" }, { "property0", "extra_2" }, { "property0", "after_extra2" }, { "property0", "before_extra2" }, { NULL, NULL } }; COLOUT(printf("\n\n==== INSERTION TEST ====\n\n")); if ((error = col_create_collection(&col, "insertion", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK, "property1", "value1", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_INDEX, NULL, 1, COL_INSERT_NOCHECK, "second", "second", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK, "property2", "value2", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_FRONT, NULL, 0, COL_INSERT_NOCHECK, "property0", "value0", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_BEFORE, "property0", 0, COL_INSERT_NOCHECK, "property_-1", "value_-1", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_BEFORE, "property1", 0, COL_INSERT_NOCHECK, "property0_5", "value0_5", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_BEFORE, "property2", 0, COL_INSERT_NOCHECK, "property1_5", "value1_5", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_AFTER, "property_-1", 0, COL_INSERT_NOCHECK, "property_-0_5", "value_-0_5", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_AFTER, "property1_5", 0, COL_INSERT_NOCHECK, "property1_6", "value1_6", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_INDEX, NULL, 10, COL_INSERT_NOCHECK, "property10", "value10", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_INDEX, NULL, 0, COL_INSERT_NOCHECK, "property_-2", "value_-2", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_INDEX, NULL, 1, COL_INSERT_NOCHECK, "property_-1_5", "value_-1_5", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_FIRSTDUP, NULL, 0, COL_INSERT_NOCHECK, "property0", "value0firstdup", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_LASTDUP, NULL, 0, COL_INSERT_NOCHECK, "property0", "value0lastdup", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_NDUP, NULL, 1, COL_INSERT_NOCHECK, "property0", "value0middledup", 0)) || (error = col_insert_str_property(col, NULL, 0, NULL, 0, COL_INSERT_DUPOVER , "property0", "value0firstdupupdate", 0)) || (error = col_insert_str_property(col, NULL, 0, NULL, 0, COL_INSERT_DUPOVERT, "property1", "value1update", 0)) || ((error = col_insert_str_property(col, NULL, 0, NULL, 0, COL_INSERT_DUPERROR, "property0", "does not matter", 0)) != EEXIST) || (error = col_insert_str_property(col, NULL, COL_DSP_NDUP, NULL, 5, COL_INSERT_NOCHECK, "property10", "value10dup", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_LASTDUP, NULL, 0, COL_INSERT_NOCHECK, "property10", "value10lastdup", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_END, NULL, 0, COL_INSERT_DUPMOVET, "property_-2", "value-2moved_to_bottom", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_FRONT, NULL, 0, COL_INSERT_DUPMOVE, "property1_6", "value_1_6_moved_to_front", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK, "property0", "extra_1", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK, "property0", "extra_2", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_NDUP, "property0", 10, COL_INSERT_NOCHECK, "property0", "before 0_5", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_NDUPNS, "property0", 10, COL_INSERT_NOCHECK, "property0", "after_extra2", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_NDUPNS, "property0", 6, COL_INSERT_NOCHECK, "property0", "before_extra2", 0)) || (error = col_insert_str_property(col, NULL, COL_DSP_LASTDUPNS, "property0", 0, COL_INSERT_NOCHECK, "property0", "very_last", 0))) { printf("ERROR in the ITERATION TEST %d\n", error); col_debug_collection(col, COL_TRAVERSE_DEFAULT); col_destroy_collection(col); return error; } COLOUT(printf("\n\nCollection:\n\n")); COLOUT(col_debug_collection(col, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\n\n==== EXTRACTION TEST ====\n\n")); if ((error = col_create_collection(&col2, "extraction", 0)) || /* Extracting "property 1_6" value "value_1_6_moved_to_front" */ (error = col_extract_item(col, NULL, COL_DSP_FRONT, NULL, 0, 0, &item)) || (error = col_insert_item(col2, NULL, item, COL_DSP_FRONT, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting "property_-1_5" value "value_-1_5" */ (error = col_extract_item(col, NULL, COL_DSP_FRONT, NULL, 0, 0, &item)) || /* Putting it in front */ (error = col_insert_item(col2, NULL, item, COL_DSP_FRONT, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting "property0" value "very_last" */ (error = col_extract_item(col, NULL, COL_DSP_END, NULL, 0, 0, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Inserting extra property to the end of first collection */ (error = col_insert_str_property(col, NULL, COL_DSP_INDEX, NULL, 100, COL_INSERT_NOCHECK, "property100", "value100", 0)) || /* This will extract "property10" with value "value10dup" */ (error = col_extract_item(col, NULL, COL_DSP_AFTER, "property10", 0, COL_TYPE_STRING, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting "property_-0_5" value "value_-0_5" */ (error = col_extract_item(col, NULL, COL_DSP_BEFORE, "property0", 0, COL_TYPE_STRING, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || /* Printing initial collection to see its state */ ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Going for the second item in the collection which is * at this moment "property0" with value "value0firstdupupdate" */ (error = col_extract_item(col, NULL, COL_DSP_INDEX, NULL, 1, 0, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting first sequextial duplicate of property0 whic is value * "value0" */ (error = col_extract_item(col, NULL, COL_DSP_NDUP, "property0", 1, 0, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting last sequential dup of "property0" * which is at this moment "before 0_5" */ (error = col_extract_item(col, NULL, COL_DSP_LASTDUP, "property0", 0, 0, &item)) || /* Putting it to the end */ (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Extracting first dup of "property0" * which is at this moment "value0middledup" */ (error = col_extract_item(col, NULL, COL_DSP_FIRSTDUP, "property0", 0, 0, &item)) || (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Printing initial collection to see its state */ ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || /* Should extract extra_2 */ (error = col_extract_item(col, NULL, COL_DSP_NDUPNS, "property0", 3, 0, &item)) || (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Printing initial collection to see its state */ ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || /* Try extracting something that is out of index, expect ENOENT */ ((error = col_extract_item(col, NULL, COL_DSP_NDUPNS, "property0", 10, 0, &item)) != ENOENT) || /* Should extract after_extra_2 */ (error = col_extract_item(col, NULL, COL_DSP_NDUPNS, "property0", 3, 0, &item)) || (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT))) || /* Printing initial collection to see its state */ ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || /* Should extract before_extra_2 */ (error = col_extract_item(col, NULL, COL_DSP_LASTDUPNS, "property0", 0, 0, &item)) || (error = col_insert_item(col2, NULL, item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK)) || ((verbose) && (error = col_debug_collection(col2, COL_TRAVERSE_DEFAULT)))) { COLOUT(printf("ERROR in the EXTRACTION TEST\n")); COLOUT(printf("Collection 1\n")); COLOUT(col_debug_collection(col, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Collection 2\n")); COLOUT(col_debug_collection(col2, COL_TRAVERSE_DEFAULT)); col_destroy_collection(col); col_destroy_collection(col2); return error; } COLOUT(printf("Collection 1\n")); COLOUT(col_debug_collection(col, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Collection 2\n")); COLOUT(col_debug_collection(col2, COL_TRAVERSE_DEFAULT)); error = validate_collection(col, varray1); if (error) { COLOUT(printf("Collection 1 validation failed.\n")); col_destroy_collection(col); col_destroy_collection(col2); return error; } error = validate_collection(col2, varray2); if (error) { COLOUT(printf("Collection 2 validation failed.\n")); col_destroy_collection(col); col_destroy_collection(col2); return error; } col_destroy_collection(col2); col_destroy_collection(col); return EOK; } /* Cleanup collback */ static void cb(const char *property, int property_len, int type, void *data, int length, void *ext_data) { COLOUT(printf("%s\n", *((const char **)ext_data))); COLOUT(printf("Property: %s\n", property)); COLOUT(printf("Length: %d\n", property_len)); COLOUT(printf("Type: %d\n", type)); COLOUT(printf("Data len: %d\n", length)); } static int delete_test(void) { struct collection_item *col; int error = EOK; const char *str = "Cleanup Callback Test"; COLOUT(printf("\n\n==== DELETION TEST 1====\n\n")); if ((error = col_create_collection(&col, "test", 0)) || (error = col_add_int_property(col, NULL, "tt", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_delete_property(col, "test", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_delete_property(col, "test", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1))) { printf("Error in delete test %d\n", error); col_destroy_collection(col); return error; } COLOUT(col_debug_collection(col, COL_TRAVERSE_DEFAULT)); col_destroy_collection(col); COLOUT(printf("\n\n==== DELETION TEST 1 END ====\n\n")); COLOUT(printf("\n\n==== DELETION TEST 2====\n\n")); if ((error = col_create_collection(&col, "test2", 0)) || (error = col_add_int_property(col, NULL, "tt", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_remove_item(col, NULL, COL_DSP_END, NULL, 0, COL_TYPE_ANY)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_remove_item_from_current(col, COL_DSP_AFTER, "tt", 0, COL_TYPE_ANY)) || ((verbose) && (error = col_debug_collection(col, COL_TRAVERSE_DEFAULT))) || (error = col_add_int_property(col, NULL, "test", 1))) { printf("Error in delete test %d\n", error); col_destroy_collection(col); return error; } COLOUT(col_debug_collection(col, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\n\n==== DELETION TEST 2 END ====\n\n")); col_destroy_collection_with_cb(col, cb, (void *)(&str)); return error; } /* Search test */ static int search_test(void) { struct collection_item *level1 = NULL; struct collection_item *level2 = NULL; struct collection_item *level3 = NULL; struct collection_item *level4 = NULL; char binary_dump[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8 }; int found = 0; int error = 0; COLOUT(printf("\n\n==== SEARCH TEST ====\n\n")); if ((error = col_create_collection(&level1, "level1", 0)) || (error = col_create_collection(&level2, "level2", 0)) || (error = col_add_collection_to_collection(level1, NULL, NULL, level2, COL_ADD_MODE_REFERENCE)) || (error = col_create_collection(&level3, "level3", 0)) || (error = col_add_collection_to_collection(level1, "level2", NULL, level3, COL_ADD_MODE_REFERENCE)) || (error = col_create_collection(&level4, "leveL4", 0)) || (error = col_add_collection_to_collection(level1, "level3", NULL, level4, COL_ADD_MODE_REFERENCE)) || (error = col_add_int_property(level1, "leveL4", "id", 1)) || (error = col_add_long_property(level1, "level3", "packets", 100000000L)) || (error = col_add_binary_property(level1, "level2", "stack", binary_dump, sizeof(binary_dump)))) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to build test. Error %d\n", error); return error; } COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_is_item_in_collection(level1, "level1!level2!level3!level4!", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if (!error) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Expected error here since the search data is illegal but got success\n"); return EINVAL; } found = 0; error = col_is_item_in_collection(level1, "level1!level2!level3!level4!id", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find item [level1!level2!level3!level4!id]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, NULL, COL_TYPE_INTEGER, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find first int item [level1!level2!level3!level4!id]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, "", COL_TYPE_INTEGER, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find first int item [level1!level2!level3!level4!id]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, "level3!level4!id", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find item [level3!level4!id]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, "level3!packets", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find item [level3.packets]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, "level1!level2!stack", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find item [level1!level2!stack]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); found = 0; error = col_is_item_in_collection(level1, "level1!level2!level3", COL_TYPE_ANY, COL_TRAVERSE_DEFAULT, &found); if ((error) || (!found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); printf("Failed to find item [level1!level2!level3]. Error %d\n", error); return error ? error : ENOENT; } else COLOUT(printf("Expected item is found\n")); /* Negative tests */ found = 0; error = col_is_item_in_collection(level1, NULL, 0, COL_TRAVERSE_DEFAULT, &found); if ((error != ENOENT) || (found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); if (error) { printf("Unexpected error with NULL & 0 test %d\n", error); } else { printf("Found unexpected item with NULL & 0. Error %d\n", error); error = EINVAL; } return error; } else COLOUT(printf("No item is found as expected.\n")); found = 0; error = col_is_item_in_collection(level1, "", 0, COL_TRAVERSE_DEFAULT, &found); if ((error != ENOENT) || (found)) { col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); if (error) { printf("Unexpected error with \"\" & 0 tests %d\n", error); } else { printf("Found unexpected item with \"\" & 0. Error %d\n", error); error = EINVAL; } return error; } else COLOUT(printf("No item is found as expected.\n")); col_destroy_collection(level1); col_destroy_collection(level2); col_destroy_collection(level3); col_destroy_collection(level4); COLOUT(printf("\n\n==== SEARCH TEST END ====\n\n")); return EOK; } /* Sort test */ static int sort_test(void) { struct collection_item *level1 = NULL; struct collection_item *level2a = NULL; struct collection_item *level2b = NULL; struct collection_item *level3 = NULL; int error = 0; COLOUT(printf("\n\n==== SORT TEST ====\n\n")); if ((error = col_create_collection(&level1, "level1", 0)) || (error = col_create_collection(&level2a, "level2a", 0)) || (error = col_add_collection_to_collection(level1, NULL, NULL, level2a, COL_ADD_MODE_REFERENCE)) || (error = col_create_collection(&level2b, "level2b", 0)) || (error = col_add_collection_to_collection(level1, NULL, NULL, level2b, COL_ADD_MODE_REFERENCE)) || (error = col_create_collection(&level3, "level3", 0)) || (error = col_add_collection_to_collection(level1, "level2a", NULL, level3, COL_ADD_MODE_REFERENCE)) || (error = col_add_collection_to_collection(level1, "level2b", NULL, level3, COL_ADD_MODE_REFERENCE)) || (error = col_add_int_property(level1, NULL, "int3", 1)) || (error = col_add_int_property(level1, NULL, "int2", 2)) || (error = col_add_int_property(level1, NULL, "int1", 3)) || (error = col_add_bool_property(level1, NULL, "bool3", 1)) || (error = col_add_bool_property(level1, NULL, "bool2", 1)) || (error = col_add_bool_property(level1, NULL, "bool1", 0)) || (error = col_add_unsigned_property(level1, NULL, "unsigned1", 2)) || (error = col_add_unsigned_property(level1, NULL, "unsigned3", 1)) || (error = col_add_unsigned_property(level1, NULL, "unsigned2", 3)) || (error = col_add_long_property(level1, NULL, "long3", 1)) || (error = col_add_long_property(level1, NULL, "long2", 2)) || (error = col_add_long_property(level1, NULL, "long1", 3)) || (error = col_add_ulong_property(level1, NULL, "ulong1", 2)) || (error = col_add_ulong_property(level1, NULL, "ulong3", 1)) || (error = col_add_ulong_property(level1, NULL, "ulong2", 3)) || (error = col_add_double_property(level1, NULL, "double1", 2.2)) || (error = col_add_double_property(level1, NULL, "double3", 1.1)) || (error = col_add_double_property(level1, NULL, "double2", 3.3)) || (error = col_add_int_property(level3, NULL, "int3L3", 1)) || (error = col_add_int_property(level3, NULL, "int2L3", 2)) || (error = col_add_int_property(level3, NULL, "int1L3", 3)) || (error = col_add_unsigned_property(level1, "level2a!level3", "unsigned1L3", 2)) || (error = col_add_unsigned_property(level1, "level2a!level3", "unsigned3L3", 1)) || (error = col_add_unsigned_property(level1, "level2a!level3", "unsigned2L3", 3)) || (error = col_add_long_property(level1, "level2b!level3", "long3L3", 1)) || (error = col_add_long_property(level1, "level2b!level3", "long2L3", 2)) || (error = col_add_long_property(level1, "level2b!level3", "long1L3", 3)) || (error = col_add_ulong_property(level1, "level3", "ulong1L3", 2)) || (error = col_add_ulong_property(level1, "level3", "ulong3L3", 1)) || (error = col_add_ulong_property(level1, "level3", "ulong2L3", 3)) || (error = col_add_bool_property(level3, NULL, "bool3", 1)) || (error = col_add_bool_property(level3, NULL, "bool2", 1)) || (error = col_add_bool_property(level3, NULL, "bool1", 0)) || (error = col_add_double_property(level3, NULL, "double1L3", 2.2)) || (error = col_add_double_property(level3, NULL, "double3L3", 1.1)) || (error = col_add_double_property(level3, NULL, "double2L3", 3.3))) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed to build test. Error %d\n", error); return error; } COLOUT(printf("\nUNSORTED COLLECTION\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_sort_collection(level1, COL_CMPIN_PROP_EQU, COL_SORT_SUB | COL_SORT_MYSUB); if (error) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed sort. Error %d\n", error); return error; } COLOUT(printf("\nSORTED BUT SKIPPING REFERENCES\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_sort_collection(level1, COL_CMPIN_PROP_EQU, COL_SORT_SUB); if (error) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed sort. Error %d\n", error); return error; } COLOUT(printf("\nSORTED BUT NOT SKIPPING REFERENCES\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_sort_collection(level1, COL_CMPIN_DATA_LEN, COL_SORT_SUB | COL_SORT_DESC); if (error) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed sort. Error %d\n", error); return error; } COLOUT(printf("\nSORTED DESC NOT SKIPPING BY LENGTH OF DATA\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_sort_collection(level1, COL_CMPIN_PROP_LEN, COL_SORT_SUB | COL_SORT_DESC); if (error) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed sort. Error %d\n", error); return error; } COLOUT(printf("\nSORTED DESC NOT SKIPPING BY LENGTH OF PROPERTY\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); error = col_sort_collection(level1, COL_CMPIN_DATA, COL_SORT_SUB | COL_SORT_DESC); if (error) { col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); printf("Failed sort. Error %d\n", error); return error; } COLOUT(printf("\nSORTED DESC NOT SKIPPING BY DATA\n\n")); COLOUT(col_debug_collection(level1, COL_TRAVERSE_DEFAULT)); col_destroy_collection(level1); col_destroy_collection(level2a); col_destroy_collection(level2b); col_destroy_collection(level3); COLOUT(printf("\n\n==== SORT TEST END ====\n\n")); return EOK; } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { ref_collection_test, single_collection_test, add_collection_test, mixed_collection_test, iterator_test, insert_extract_test, delete_test, search_test, sort_test, dup_test, NULL }; test_fn t; int i = 0; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; printf("Start\n"); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed!\n"); return error; } } printf("Success!\n"); return 0; } ding-libs-0.6.2/collection/libcollection.sym000066400000000000000000000077611417260640400211150ustar00rootroot00000000000000COLLECTION_0.6.2 { global: /* collection.h */ col_create_collection; col_destroy_collection; col_destroy_collection_with_cb; col_copy_collection_with_cb; col_copy_collection; col_add_collection_to_collection; col_traverse_collection; col_get_item_and_do; col_get_item; col_sort_collection; col_delete_property; col_is_item_in_collection; col_get_collection_reference; col_get_reference_from_item; col_get_collection_class; col_set_collection_class; col_get_collection_count; col_is_of_class; col_add_str_property; col_add_binary_property; col_add_int_property; col_add_unsigned_property; col_add_long_property; col_add_ulong_property; col_add_double_property; col_add_bool_property; col_add_any_property; col_add_str_property_with_ref; col_add_binary_property_with_ref; col_add_int_property_with_ref; col_add_unsigned_property_with_ref; col_add_long_property_with_ref; col_add_ulong_property_with_ref; col_add_double_property_with_ref; col_add_bool_property_with_ref; col_add_any_property_with_ref; col_insert_str_property; col_insert_binary_property; col_insert_int_property; col_insert_unsigned_property; col_insert_long_property; col_insert_ulong_property; col_insert_double_property; col_insert_bool_property; col_insert_str_property_with_ref; col_insert_binary_property_with_ref; col_insert_int_property_with_ref; col_insert_unsigned_property_with_ref; col_insert_long_property_with_ref; col_insert_ulong_property_with_ref; col_insert_double_property_with_ref; col_insert_bool_property_with_ref; col_insert_property_with_ref; col_update_str_property; col_update_binary_property; col_update_int_property; col_update_unsigned_property; col_update_long_property; col_update_ulong_property; col_update_double_property; col_update_bool_property; col_update_property; col_get_item_property; col_get_item_type; col_get_item_length; col_get_item_data; col_get_item_hash; col_make_hash; col_compare_items; col_modify_item; col_modify_item_property; col_modify_str_item; col_modify_binary_item; col_modify_bool_item; col_modify_int_item; col_modify_long_item; col_modify_ulong_item; col_modify_unsigned_item; col_modify_double_item; col_extract_item; col_extract_item_from_current; col_remove_item; col_remove_item_from_current; col_insert_item; col_insert_item_into_current; col_delete_item; col_bind_iterator; col_unbind_iterator; col_iterate_collection; col_iterate_up; col_get_iterator_depth; col_get_item_depth; col_pin_iterator; col_rewind_iterator; /* collection_queue.h */ col_create_queue; col_destroy_queue; col_enqueue_str_property; col_enqueue_binary_property; col_enqueue_int_property; col_enqueue_unsigned_property; col_enqueue_long_property; col_enqueue_ulong_property; col_enqueue_double_property; col_enqueue_bool_property; col_enqueue_any_property; col_enqueue_item; col_dequeue_item; /* collection_stack.h */ col_create_stack; col_destroy_stack; col_push_str_property; col_push_binary_property; col_push_int_property; col_push_unsigned_property; col_push_long_property; col_push_ulong_property; col_push_double_property; col_push_bool_property; col_push_any_property; col_push_item; col_pop_item; /* collection_tools.h */ col_get_data_len; col_grow_buffer; col_put_marker; col_serialize; col_debug_handle; col_debug_item; col_debug_collection; col_print_collection; col_print_collection2; col_print_item; col_collection_to_list; col_free_property_list; local: *; }; COLLECTION_0.7 { global: /* collection.h */ col_get_dup_item; col_delete_item_with_cb; col_remove_item_with_cb; } COLLECTION_0.6.2; ding-libs-0.6.2/configure.ac000066400000000000000000000060771417260640400156730ustar00rootroot00000000000000m4_include([version.m4]) AC_INIT([ding-libs], VERSION_NUMBER, [sssd-devel@lists.fedorahosted.org]) AC_CONFIG_SRCDIR([README]) AC_CONFIG_AUX_DIR([build]) m4_ifdef([AC_USE_SYSTEM_EXTENSIONS], [AC_USE_SYSTEM_EXTENSIONS], [AC_GNU_SOURCE]) AM_INIT_AUTOMAKE([-Wall foreign subdir-objects]) AM_PROG_CC_C_O m4_ifdef([AM_PROG_AR], [AM_PROG_AR]) AC_PROG_LIBTOOL AC_CONFIG_MACRO_DIR([m4]) AC_PROG_INSTALL AM_CONDITIONAL([HAVE_GCC], [test "$ac_cv_prog_gcc" = yes]) PKG_CHECK_MODULES([CHECK], [check >= 0.9.5], [have_check=1], [have_check=]) if test x$have_check = x; then AC_MSG_WARN([Without the 'CHECK' libraries, you will be unable to run all tests in the 'make check' suite]) fi AM_CONDITIONAL([HAVE_CHECK], [test x$have_check != x]) m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES]) AC_CONFIG_HEADERS([config.h]) AC_SUBST([PRERELEASE_VERSION], PRERELEASE_VERSION_NUMBER) AC_SUBST([PATH_UTILS_VERSION], PATH_UTILS_VERSION_NUMBER) AC_SUBST([DHASH_VERSION], DHASH_VERSION_NUMBER) AC_SUBST([COLLECTION_VERSION], COLLECTION_VERSION_NUMBER) AC_SUBST([REF_ARRAY_VERSION], REF_ARRAY_VERSION_NUMBER) AC_SUBST([BASICOBJECTS_VERSION], BASICOBJECTS_VERSION_NUMBER) AC_SUBST([INI_CONFIG_VERSION], INI_CONFIG_VERSION_NUMBER) AM_CONDITIONAL([GIT_CHECKOUT], [git log -1 >/dev/null 2>&1]) AC_PATH_PROG([DOXYGEN], [doxygen], [false]) AM_CONDITIONAL([HAVE_DOXYGEN], [test x$DOXYGEN != xfalse ]) # Enable trace build AC_ARG_ENABLE([trace], [AS_HELP_STRING([--enable-trace[=LEVEL]],[build with low level tracing enabled])], [trace_level="$enableval"], [trace_level="0"]) AS_IF([test ["$trace_level" -gt "0"] -a ["$trace_level" -lt "8"] ],[AC_SUBST([TRACE_VAR],["-DTRACE_LEVEL=$trace_level"])]) AC_CHECK_SIZEOF([long]) AC_CHECK_SIZEOF([long long]) gl_LD_VERSION_SCRIPT AM_ICONV AM_GNU_GETTEXT([external]) AM_GNU_GETTEXT_VERSION([0.14.4]) AC_CHECK_FUNC([strcasestr], AC_DEFINE([HAVE_STRCASESTR], [1], [Define if strcasestr exists]), AC_MSG_ERROR("Platform must support strcasestr")) AC_CHECK_FUNC([getline], AC_DEFINE([HAVE_GETLINE], [1], [Define if getline() exists]), AC_MSG_ERROR("Platform must support getline()")) AC_DEFINE([COL_MAX_DATA], [65535], [Max length of the data block allowed in the collection value.]) AC_DEFINE([MAX_KEY], [1024], [Max length of the key in the INI file.]) #Support old versions of autotools that don't provide docdir AC_SUBST([docdir]) if test x$docdir = x; then AC_SUBST([docdir], ${datadir}/doc/AC_PACKAGE_NAME) fi AC_CONFIG_FILES([Makefile contrib/ding-libs.spec path_utils/path_utils.cfg.doxy path_utils/path_utils.pc dhash/dhash.pc collection/collection.cfg.doxy collection/collection.pc refarray/ref_array.cfg.doxy refarray/ref_array.pc basicobjects/basicobjects.cfg.doxy basicobjects/basicobjects.pc ini/ini_config.cfg.doxy ini/ini_config.pc]) AC_OUTPUT ding-libs-0.6.2/contrib/000077500000000000000000000000001417260640400150335ustar00rootroot00000000000000ding-libs-0.6.2/contrib/ding-libs.spec.in000066400000000000000000000237511417260640400201740ustar00rootroot00000000000000Name: @PACKAGE_NAME@ Version: @PACKAGE_VERSION@ Release: 0%{?dist}@PRERELEASE_VERSION@ Summary: "Ding is not GLib" assorted utility libraries Group: Development/Libraries License: LGPLv3+ URL: http://fedorahosted.org/sssd/ Source0: %{name}-%{version}.tar.gz BuildRoot: %(mktemp -ud %{_tmppath}/%{name}-%{version}-%{release}-XXXXXX) %global path_utils_version @PATH_UTILS_VERSION@ %global dhash_version @DHASH_VERSION@ %global collection_version @COLLECTION_VERSION@ %global ref_array_version @REF_ARRAY_VERSION@ %global basicobjects_version @BASICOBJECTS_VERSION@ %global ini_config_version @INI_CONFIG_VERSION@ ### Patches ### ### Dependencies ### # ding-libs is a meta-package that will pull in all of its own # sub-packages Requires: libpath_utils = %{path_utils_version}-%{release} Requires: libdhash = %{dhash_version}-%{release} Requires: libcollection = %{collection_version}-%{release} Requires: libref_array = %{ref_array_version}-%{release} Requires: libini_config = %{ini_config_version}-%{release} ### Build Dependencies ### BuildRequires: autoconf BuildRequires: automake BuildRequires: libtool BuildRequires: m4 BuildRequires: doxygen BuildRequires: pkgconfig BuildRequires: check-devel BuildRequires: gettext-devel %description A meta-package that pulls in libcollection, libdhash, libini_config, librefarray and libpath_utils. %package devel Summary: Development packages for ding-libs Group: Development/Libraries License: LGPLv3+ # ding-libs is a meta-package that will pull in all of its own # sub-packages Requires: libpath_utils-devel = %{path_utils_version}-%{release} Requires: libdhash-devel = %{dhash_version}-%{release} Requires: libcollection-devel = %{collection_version}-%{release} Requires: libref_array-devel = %{ref_array_version}-%{release} Requires: libbasicobjects-devel = %{basicobjects_version}-%{release} Requires: libini_config-devel = %{ini_config_version}-%{release} %description devel A meta-package that pulls in development libraries for libcollection, libdhash, libini_config, librefarray and libpath_utils. ############################################################################## # Path Utils ############################################################################## %package -n libpath_utils Summary: Filesystem Path Utilities Group: Development/Libraries License: LGPLv3+ Version: %{path_utils_version} %description -n libpath_utils Utility functions to manipulate filesystem pathnames %package -n libpath_utils-devel Summary: Development files for libpath_utils Group: Development/Libraries Requires: libpath_utils = %{path_utils_version}-%{release} License: LGPLv3+ Version: %{path_utils_version} %description -n libpath_utils-devel Utility functions to manipulate filesystem pathnames %post -n libpath_utils -p /sbin/ldconfig %postun -n libpath_utils -p /sbin/ldconfig %files -n libpath_utils %defattr(-,root,root,-) %doc COPYING COPYING.LESSER %{_libdir}/libpath_utils.so.1 %{_libdir}/libpath_utils.so.1.0.1 %files -n libpath_utils-devel %defattr(-,root,root,-) %{_includedir}/path_utils.h %{_libdir}/libpath_utils.so %{_libdir}/pkgconfig/path_utils.pc %doc path_utils/README.path_utils %doc path_utils/doc/html/ ############################################################################## # dhash ############################################################################## %package -n libdhash Group: Development/Libraries Summary: Dynamic hash table License: LGPLv3+ Version: %{dhash_version} %description -n libdhash A hash table which will dynamically resize to achieve optimal storage & access time properties %package -n libdhash-devel Summary: Development files for libdhash Group: Development/Libraries Requires: libdhash = %{dhash_version}-%{release} License: LGPLv3+ Version: %{dhash_version} %description -n libdhash-devel A hash table which will dynamically resize to achieve optimal storage & access time properties %post -n libdhash -p /sbin/ldconfig %postun -n libdhash -p /sbin/ldconfig %files -n libdhash %defattr(-,root,root,-) %doc COPYING COPYING.LESSER %{_libdir}/libdhash.so.1 %{_libdir}/libdhash.so.1.1.0 %files -n libdhash-devel %defattr(-,root,root,-) %{_includedir}/dhash.h %{_libdir}/libdhash.so %{_libdir}/pkgconfig/dhash.pc %doc dhash/README.dhash %doc dhash/examples/*.c ############################################################################## # collection ############################################################################## %package -n libcollection Summary: Collection data-type for C Group: Development/Libraries License: LGPLv3+ Version: %{collection_version} %description -n libcollection A data-type to collect data in a hierarchical structure for easy iteration and serialization %package -n libcollection-devel Summary: Development files for libcollection Group: Development/Libraries License: LGPLv3+ Requires: libcollection = %{collection_version}-%{release} Version: %{collection_version} %description -n libcollection-devel A data-type to collect data in a hierarchical structure for easy iteration and serialization %post -n libcollection -p /sbin/ldconfig %postun -n libcollection -p /sbin/ldconfig %files -n libcollection %defattr(-,root,root,-) %doc COPYING %doc COPYING.LESSER %{_libdir}/libcollection.so.4 %{_libdir}/libcollection.so.4.1.1 %files -n libcollection-devel %defattr(-,root,root,-) %{_includedir}/collection.h %{_includedir}/collection_tools.h %{_includedir}/collection_queue.h %{_includedir}/collection_stack.h %{_libdir}/libcollection.so %{_libdir}/pkgconfig/collection.pc %doc collection/doc/html/ ############################################################################## # ref_array ############################################################################## %package -n libref_array Summary: A refcounted array for C Group: Development/Libraries License: LGPLv3+ Version: %{ref_array_version} %description -n libref_array A dynamically-growing, reference-counted array %package -n libref_array-devel Summary: Development files for libref_array Group: Development/Libraries Requires: libref_array = %{ref_array_version}-%{release} License: LGPLv3+ Version: %{ref_array_version} %description -n libref_array-devel A dynamically-growing, reference-counted array %post -n libref_array -p /sbin/ldconfig %postun -n libref_array -p /sbin/ldconfig %files -n libref_array %defattr(-,root,root,-) %doc COPYING %doc COPYING.LESSER %{_libdir}/libref_array.so.1 %{_libdir}/libref_array.so.1.2.1 %files -n libref_array-devel %defattr(-,root,root,-) %{_includedir}/ref_array.h %{_libdir}/libref_array.so %{_libdir}/pkgconfig/ref_array.pc %doc refarray/README.ref_array %doc refarray/doc/html/ ############################################################################## # basicobjects ############################################################################## %package -n libbasicobjects Summary: Basic object types for C Group: Development/Libraries License: GPLv3+ Version: %{basicobjects_version} %description -n libbasicobjects Basic object types %package -n libbasicobjects-devel Summary: Development files for libbasicobjects Group: Development/Libraries License: GPLv3+ Version: %{basicobjects_version} Requires: libbasicobjects = %{basicobjects_version}-%{release} %description -n libbasicobjects-devel Basic object types %post -n libbasicobjects -p /sbin/ldconfig %postun -n libbasicobjects -p /sbin/ldconfig %files -n libbasicobjects %defattr(-,root,root,-) %doc COPYING %doc COPYING.LESSER %{_libdir}/libbasicobjects.so.0 %{_libdir}/libbasicobjects.so.0.1.0 %files -n libbasicobjects-devel %defattr(-,root,root,-) %{_includedir}/simplebuffer.h %{_libdir}/libbasicobjects.so %{_libdir}/pkgconfig/basicobjects.pc ############################################################################## # ini_config ############################################################################## %package -n libini_config Summary: INI file parser for C Group: Development/Libraries License: LGPLv3+ Version: %{ini_config_version} %description -n libini_config Library to process config files in INI format into a libcollection data structure %package -n libini_config-devel Summary: Development files for libini_config Group: Development/Libraries License: LGPLv3+ Requires: libini_config = %{ini_config_version}-%{release} Requires: libcollection-devel = %{collection_version}-%{release} Requires: libref_array-devel = %{ref_array_version}-%{release} Requires: libbasicobjects-devel = %{basicobjects_version}-%{release} Version: %{ini_config_version} %description -n libini_config-devel Library to process config files in INI format into a libcollection data structure %post -n libini_config -p /sbin/ldconfig %postun -n libini_config -p /sbin/ldconfig %files -n libini_config %defattr(-,root,root,-) %doc COPYING %doc COPYING.LESSER %{_libdir}/libini_config.so.5 %{_libdir}/libini_config.so.5.2.1 %files -n libini_config-devel %defattr(-,root,root,-) %{_includedir}/ini_config.h %{_includedir}/ini_configobj.h %{_includedir}/ini_valueobj.h %{_includedir}/ini_comment.h %{_includedir}/ini_configmod.h %{_libdir}/libini_config.so %{_libdir}/pkgconfig/ini_config.pc %doc ini/doc/html/ ############################################################################## # Build steps ############################################################################## %prep %setup -q %build autoreconf -ivf %configure \ --disable-static make %{?_smp_mflags} all docs %check make %{?_smp_mflags} check %install rm -rf $RPM_BUILD_ROOT make install DESTDIR=$RPM_BUILD_ROOT # Remove .la files created by libtool rm -f $RPM_BUILD_ROOT/%{_libdir}/*.la # Remove the example files from the output directory # We will copy them directly from the source directory # for packaging rm -f \ $RPM_BUILD_ROOT/usr/share/doc/ding-libs/README.* \ $RPM_BUILD_ROOT/usr/share/doc/ding-libs/examples/dhash_example.c \ $RPM_BUILD_ROOT/usr/share/doc/ding-libs/examples/dhash_test.c # Remove document install script. RPM is handling this rm -f */doc/html/installdox %clean rm -rf $RPM_BUILD_ROOT %changelog * Tue Sep 21 2010 Stephen Gallagher - @PACKAGE_VERSION@-0 - Automated build of ding-libs ding-libs-0.6.2/dhash/000077500000000000000000000000001417260640400144625ustar00rootroot00000000000000ding-libs-0.6.2/dhash/README.dhash000066400000000000000000000000631417260640400164270ustar00rootroot00000000000000Documentation for libdhash can be found in dhash.h ding-libs-0.6.2/dhash/dhash.c000066400000000000000000001025051417260640400157200ustar00rootroot00000000000000/* Authors: John Dennis Esmond Pitt This implementation was based on a 3/7/1989 public domain submission to comp.sources.misc by Esmond Pitt . Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ /*****************************************************************************/ /******************************** Documentation ******************************/ /*****************************************************************************/ /* * See documentation in corresponding header file dhash.h. * * Compilation controls: * DEBUG controls some informative traces, mainly for debugging. * HASH_STATISTICS causes hash_accesses and hash_collisions to be maintained; * when combined with DEBUG, these are displayed by hash_destroy(). * */ /*****************************************************************************/ /******************************* Include Files *******************************/ /*****************************************************************************/ #include "config.h" #include #include #include #include #include "dhash.h" /*****************************************************************************/ /****************************** Internal Defines *****************************/ /*****************************************************************************/ #define PRIME_1 37 #define PRIME_2 1048583 #ifndef MIN #define MIN(a,b) (((a) < (b)) ? (a) : (b)) #endif #ifndef MAX #define MAX(a,b) (((a) > (b)) ? (a) : (b)) #endif #define halloc(table, size) table->halloc(size, table->halloc_pvt) #define hfree(table, ptr) table->hfree(ptr, table->halloc_pvt) #define hdelete_callback(table, type, entry) do { \ if (table->delete_callback) { \ table->delete_callback(entry, type, table->delete_pvt); \ } \ } while(0) /*****************************************************************************/ /************************** Internal Type Definitions ************************/ /*****************************************************************************/ typedef struct element_t { hash_entry_t entry; struct element_t *next; } element_t, *segment_t; struct hash_table_str { unsigned long p; /* Next bucket to be split */ unsigned long maxp; /* upper bound on p during expansion */ unsigned long entry_count; /* current # entries */ unsigned long bucket_count; /* current # buckets */ unsigned long segment_count; /* current # segments */ unsigned long min_load_factor; unsigned long max_load_factor; unsigned long directory_size; unsigned int directory_size_shift; unsigned long segment_size; unsigned int segment_size_shift; hash_delete_callback *delete_callback; void *delete_pvt; hash_alloc_func *halloc; hash_free_func *hfree; void *halloc_pvt; segment_t **directory; #ifdef HASH_STATISTICS hash_statistics_t statistics; #endif }; typedef unsigned long address_t; typedef struct hash_keys_callback_data_t { unsigned long index; hash_key_t *keys; } hash_keys_callback_data_t; typedef struct hash_values_callback_data_t { unsigned long index; hash_value_t *values; } hash_values_callback_data_t; struct _hash_iter_context_t { struct hash_iter_context_t iter; hash_table_t *table; unsigned long i, j; segment_t *s; element_t *p; }; enum hash_iter_state { HI_STATE_0, HI_STATE_1, HI_STATE_2, HI_STATE_3A, HI_STATE_3B }; /*****************************************************************************/ /********************** External Function Declarations *********************/ /*****************************************************************************/ /*****************************************************************************/ /********************** Internal Function Declarations *********************/ /*****************************************************************************/ static address_t convert_key(hash_key_t *key); static address_t hash(hash_table_t *table, hash_key_t *key); static bool key_equal(hash_key_t *a, hash_key_t *b); static int contract_table(hash_table_t *table); static int expand_table(hash_table_t *table); static hash_entry_t *hash_iter_next(struct hash_iter_context_t *iter); /*****************************************************************************/ /************************* External Global Variables ***********************/ /*****************************************************************************/ /*****************************************************************************/ /************************* Internal Global Variables ***********************/ /*****************************************************************************/ #ifdef DEBUG int debug_level = 1; #endif /*****************************************************************************/ /*************************** Internal Functions ****************************/ /*****************************************************************************/ static void *sys_malloc_wrapper(size_t size, void *pvt) { return malloc(size); } static void sys_free_wrapper(void *ptr, void *pvt) { return free(ptr); } static address_t convert_key(hash_key_t *key) { address_t h; const unsigned char *k; switch(key->type) { case HASH_KEY_ULONG: h = key->ul; break; case HASH_KEY_STRING: /* Convert string to integer */ for (h = 0, k = (const unsigned char *) key->str; *k; k++) h = h * PRIME_1 ^ (*k - ' '); break; case HASH_KEY_CONST_STRING: /* Convert string to integer */ for (h = 0, k = (const unsigned char *) key->c_str; *k; k++) h = h * PRIME_1 ^ (*k - ' '); break; default: h = key->ul; break; } return h; } static address_t hash(hash_table_t *table, hash_key_t *key) { address_t h, address; h = convert_key(key); h %= PRIME_2; address = h & (table->maxp-1); /* h % maxp */ if (address < table->p) address = h & ((table->maxp << 1)-1); /* h % (2*table->maxp) */ return address; } static bool is_valid_key_type(hash_key_enum key_type) { switch(key_type) { case HASH_KEY_ULONG: case HASH_KEY_STRING: case HASH_KEY_CONST_STRING: return true; default: return false; } } static bool is_valid_value_type(hash_value_enum value_type) { switch(value_type) { case HASH_VALUE_UNDEF: case HASH_VALUE_PTR: case HASH_VALUE_INT: case HASH_VALUE_UINT: case HASH_VALUE_LONG: case HASH_VALUE_ULONG: case HASH_VALUE_FLOAT: case HASH_VALUE_DOUBLE: return true; default: return false; } } static bool key_equal(hash_key_t *a, hash_key_t *b) { if (a->type != b->type) return false; switch(a->type) { case HASH_KEY_ULONG: return (a->ul == b->ul); case HASH_KEY_STRING: return (strcmp(a->str, b->str) == 0); case HASH_KEY_CONST_STRING: return (strcmp(a->c_str, b->c_str) == 0); } return false; } static int expand_table(hash_table_t *table) { address_t new_address; unsigned long old_segment_index, new_segment_index; unsigned long old_segment_dir, new_segment_dir; segment_t *old_segment, *new_segment; element_t *current, **previous, **last_of_new; if (table->bucket_count < (table->directory_size << table->segment_size_shift)) { #ifdef DEBUG if (debug_level >= 2) fprintf(stderr, "expand_table on entry: bucket_count=%lu, segment_count=%lu p=%lu maxp=%lu\n", table->bucket_count, table->segment_count, table->p, table->maxp); #endif #ifdef HASH_STATISTICS table->statistics.table_expansions++; #endif /* * Locate the bucket to be split */ old_segment_dir = table->p >> table->segment_size_shift; old_segment = table->directory[old_segment_dir]; old_segment_index = table->p & (table->segment_size-1); /* p % segment_size */ /* * Expand address space; if necessary create a new segment */ new_address = table->maxp + table->p; new_segment_dir = new_address >> table->segment_size_shift; new_segment_index = new_address & (table->segment_size-1); /* new_address % segment_size */ if (new_segment_index == 0) { table->directory[new_segment_dir] = (segment_t *)halloc(table, table->segment_size * sizeof(segment_t)); if (table->directory[new_segment_dir] == NULL) { return HASH_ERROR_NO_MEMORY; } memset(table->directory[new_segment_dir], 0, table->segment_size * sizeof(segment_t)); table->segment_count++; } new_segment = table->directory[new_segment_dir]; /* * Adjust state variables */ table->p++; if (table->p == table->maxp) { table->maxp <<= 1; /* table->maxp *= 2 */ table->p = 0; } table->bucket_count++; /* * Relocate records to the new bucket */ previous = &old_segment[old_segment_index]; current = *previous; last_of_new = &new_segment[new_segment_index]; *last_of_new = NULL; while (current != NULL) { if (hash(table, ¤t->entry.key) == new_address) { /* * Attach it to the end of the new chain */ *last_of_new = current; /* * Remove it from old chain */ *previous = current->next; last_of_new = ¤t->next; current = current->next; *last_of_new = NULL; } else { /* * leave it on the old chain */ previous = ¤t->next; current = current->next; } } #ifdef DEBUG if (debug_level >= 2) fprintf(stderr, "expand_table on exit: bucket_count=%lu, segment_count=%lu p=%lu maxp=%lu\n", table->bucket_count, table->segment_count, table->p, table->maxp); #endif } return HASH_SUCCESS; } static int contract_table(hash_table_t *table) { address_t new_address, old_address; unsigned long old_segment_index, new_segment_index; unsigned long old_segment_dir, new_segment_dir; segment_t *old_segment, *new_segment; element_t *current; if ((table->bucket_count > table->segment_size) && (table->segment_count > 1)) { #ifdef DEBUG if (debug_level >= 2) fprintf(stderr, "contract_table on entry: bucket_count=%lu, segment_count=%lu p=%lu maxp=%lu\n", table->bucket_count, table->segment_count, table->p, table->maxp); #endif #ifdef HASH_STATISTICS table->statistics.table_contractions++; #endif /* * Locate the bucket to be merged with the last bucket */ old_address = table->bucket_count - 1; old_segment_dir = old_address >> table->segment_size_shift; old_segment = table->directory[old_segment_dir]; old_segment_index = old_address & (table->segment_size-1); /* old_address % segment_size */ /* * Adjust state variables */ if (table->p > 0) { table->p--; } else { table->maxp >>= 1; table->p = table->maxp - 1; } table->bucket_count--; /* * Find the last bucket to merge back */ if((current = old_segment[old_segment_index]) != NULL) { new_address = hash(table, &old_segment[old_segment_index]->entry.key); new_segment_dir = new_address >> table->segment_size_shift; new_segment_index = new_address & (table->segment_size-1); /* new_address % segment_size */ new_segment = table->directory[new_segment_dir]; /* * Relocate records to the new bucket by splicing the two chains * together by inserting the old chain at the head of the new chain. * First find the end of the old chain, then set its next pointer to * point to the head of the new chain, set the head of the new chain to * point to the old chain, then finally set the head of the old chain to * NULL. */ while (current->next != NULL) { current = current->next; } current->next = new_segment[new_segment_index]; new_segment[new_segment_index] = old_segment[old_segment_index]; old_segment[old_segment_index] = NULL; } /* * If we have removed the last of the chains in this segment then free the * segment since its no longer in use. */ if (old_segment_index == 0) { table->segment_count--; hfree(table, table->directory[old_segment_dir]); } #ifdef DEBUG if (debug_level >= 2) fprintf(stderr, "contract_table on exit: bucket_count=%lu, segment_count=%lu p=%lu maxp=%lu\n", table->bucket_count, table->segment_count, table->p, table->maxp); #endif } return HASH_SUCCESS; } static int lookup(hash_table_t *table, hash_key_t *key, element_t **element_arg, segment_t **chain_arg) { address_t h; segment_t *current_segment; unsigned long segment_index, segment_dir; segment_t *chain, element; *element_arg = NULL; *chain_arg = NULL; if (!table) return HASH_ERROR_BAD_TABLE; #ifdef HASH_STATISTICS table->statistics.hash_accesses++; #endif h = hash(table, key); segment_dir = h >> table->segment_size_shift; segment_index = h & (table->segment_size-1); /* h % segment_size */ /* * valid segment ensured by hash() */ current_segment = table->directory[segment_dir]; #ifdef DEBUG if (debug_level >= 3) fprintf(stderr, "lookup: h=%lu, segment_dir=%lu, segment_index=%lu current_segment=%p\n", h, segment_dir, segment_index, current_segment); #endif if (current_segment == NULL) return EFAULT; chain = ¤t_segment[segment_index]; element = *chain; /* * Follow collision chain */ while (element != NULL && !key_equal(&element->entry.key, key)) { chain = &element->next; element = *chain; #ifdef HASH_STATISTICS table->statistics.hash_collisions++; #endif } *element_arg = element; *chain_arg = chain; return HASH_SUCCESS; } static bool hash_keys_callback(hash_entry_t *item, void *user_data) { hash_keys_callback_data_t *data = (hash_keys_callback_data_t *)user_data; data->keys[data->index++] = item->key; return true; } static bool hash_values_callback(hash_entry_t *item, void *user_data) { hash_values_callback_data_t *data = (hash_values_callback_data_t *)user_data; data->values[data->index++] = item->value; return true; } /*****************************************************************************/ /**************************** Exported Functions ***************************/ /*****************************************************************************/ const char* hash_error_string(int error) { switch(error) { case HASH_SUCCESS: return "Success"; case HASH_ERROR_BAD_KEY_TYPE: return "Bad key type"; case HASH_ERROR_BAD_VALUE_TYPE: return "Bad value type"; case HASH_ERROR_NO_MEMORY: return "No memory"; case HASH_ERROR_KEY_NOT_FOUND: return "Key not found"; case HASH_ERROR_BAD_TABLE: return "Bad table"; } return NULL; } int hash_create(unsigned long count, hash_table_t **tbl, hash_delete_callback *delete_callback, void *delete_private_data) { return hash_create_ex(count, tbl, 0, 0, 0, 0, NULL, NULL, NULL, delete_callback, delete_private_data); } int hash_create_ex(unsigned long count, hash_table_t **tbl, unsigned int directory_bits, unsigned int segment_bits, unsigned long min_load_factor, unsigned long max_load_factor, hash_alloc_func *alloc_func, hash_free_func *free_func, void *alloc_private_data, hash_delete_callback *delete_callback, void *delete_private_data) { unsigned long i; unsigned int n_addr_bits, requested_bits; unsigned int requested_directory_bits; unsigned int requested_segment_bits; address_t addr; hash_table_t *table = NULL; /* Initialize to NULL in case of an early return due to an error */ *tbl = NULL; if (alloc_func == NULL) alloc_func = sys_malloc_wrapper; if (free_func == NULL) free_func = sys_free_wrapper; /* Compute directory and segment parameters */ /* compute power of 2 >= count; it's the number of requested buckets */ if (count > 1) { for (requested_bits = 0; (1 << requested_bits) < count; requested_bits++); } else { requested_bits = 1; } /* * If caller didn't specify directory & segment allocation then * compute it from the requested count. */ if (directory_bits == 0 || segment_bits == 0) { /* Equally divide buckets between the directory and segments */ requested_directory_bits = MAX(requested_bits >> 1, 1); requested_segment_bits = MAX(requested_bits - requested_directory_bits, 1); /* If the requested count wasn't specified pick a default */ if (count == 0) { directory_bits = MAX(requested_directory_bits, HASH_DEFAULT_DIRECTORY_BITS); segment_bits = MAX(requested_segment_bits, HASH_DEFAULT_SEGMENT_BITS); } else { directory_bits = requested_directory_bits; segment_bits = requested_segment_bits; } } for (addr = ~0, n_addr_bits = 0; addr; addr >>= 1, n_addr_bits++); if (directory_bits + segment_bits > n_addr_bits) return EINVAL; table = (hash_table_t *)alloc_func(sizeof(hash_table_t), alloc_private_data); if (table == NULL) { return HASH_ERROR_NO_MEMORY; } memset(table, 0, sizeof(hash_table_t)); table->halloc = alloc_func; table->hfree = free_func; table->halloc_pvt = alloc_private_data; table->directory_size_shift = directory_bits; table->directory_size = directory_bits ? 1 << directory_bits : 0; table->segment_size_shift = segment_bits; table->segment_size = segment_bits ? 1 << segment_bits : 0; /* Allocate directory */ table->directory = (segment_t **)halloc(table, table->directory_size * sizeof(segment_t *)); if (table->directory == NULL) { hash_destroy(table); return HASH_ERROR_NO_MEMORY; } memset(table->directory, 0, table->directory_size * sizeof(segment_t *)); /* * If one wanted to pre-allocate all the buckets necessary to meet the needs * of the requested count it would be done like this: * * table->segment_count = MIN((count + table->segment_size-1) / table->segment_size, * table->directory_size); * * But with dynamic hash tables there is little point to this, the whole idea is to * allow the table to grow/shrink dynamically, therefore we start with just one * segment of buckets, the minimum necessary. */ table->segment_count = 1; table->p = 0; table->entry_count = 0; table->delete_callback = delete_callback; table->delete_pvt = delete_private_data; /* * Allocate initial segments of buckets */ for (i = 0; i < table->segment_count; i++) { table->directory[i] = (segment_t *)halloc(table, table->segment_size * sizeof(segment_t)); if (table->directory[i] == NULL) { hash_destroy(table); return HASH_ERROR_NO_MEMORY; } memset(table->directory[i], 0, table->segment_size * sizeof(segment_t)); } table->bucket_count = table->segment_count << table->segment_size_shift; table->maxp = table->bucket_count; table->min_load_factor = min_load_factor == 0 ? HASH_DEFAULT_MIN_LOAD_FACTOR : min_load_factor; table->max_load_factor = max_load_factor == 0 ? HASH_DEFAULT_MAX_LOAD_FACTOR : max_load_factor; #ifdef DEBUG if (debug_level >= 1) { fprintf(stderr, "hash_create_ex: count=%lu available buckets=%lu bucket_count=%lu maxp=%lu\n", count, table->directory_size*table->segment_size, table->bucket_count, table->maxp); fprintf(stderr, " directory_bits=%u segment_bits=%u requested_bits=%u\n", directory_bits, segment_bits, requested_bits); fprintf(stderr, " directory_size=%lu segment_size=%lu segment_count=%lu\n", table->directory_size, table->segment_size, table->segment_count); fprintf(stderr, " min_load_factor=%lu max_load_factor=%lu\n", table->min_load_factor, table->max_load_factor); } #endif #ifdef HASH_STATISTICS memset(&table->statistics, 0, sizeof(table->statistics)); #endif *tbl = table; return HASH_SUCCESS; } #ifdef HASH_STATISTICS int hash_get_statistics(hash_table_t *table, hash_statistics_t *statistics) { if (!table) return HASH_ERROR_BAD_TABLE; if (!statistics) return EINVAL; *statistics = table->statistics; return HASH_SUCCESS; } #endif int hash_destroy(hash_table_t *table) { unsigned long i, j; segment_t *s; element_t *p, *q; if (!table) return HASH_ERROR_BAD_TABLE; if (table->directory) { for (i = 0; i < table->segment_count; i++) { /* test probably unnecessary */ if ((s = table->directory[i]) != NULL) { for (j = 0; j < table->segment_size; j++) { p = s[j]; while (p != NULL) { q = p->next; hdelete_callback(table, HASH_TABLE_DESTROY, &p->entry); if (p->entry.key.type == HASH_KEY_STRING || p->entry.key.type == HASH_KEY_CONST_STRING) { /* Internally we do not use constant memory for keys * in hash table elements. */ hfree(table, p->entry.key.str); } hfree(table, (char *)p); p = q; } } hfree(table, s); } } hfree(table, table->directory); } hfree(table, table); table = NULL; return HASH_SUCCESS; } int hash_iterate(hash_table_t *table, hash_iterate_callback callback, void *user_data) { unsigned long i, j; segment_t *s; element_t *p; if (!table) return HASH_ERROR_BAD_TABLE; if (table != NULL) { for (i = 0; i < table->segment_count; i++) { /* test probably unnecessary */ if ((s = table->directory[i]) != NULL) { for (j = 0; j < table->segment_size; j++) { p = s[j]; while (p != NULL) { if(!(*callback)(&p->entry, user_data)) return HASH_SUCCESS; p = p->next; } } } } } return HASH_SUCCESS; } static hash_entry_t *hash_iter_next(struct hash_iter_context_t *iter_arg) { struct _hash_iter_context_t *iter = (struct _hash_iter_context_t *) iter_arg; hash_entry_t *entry = NULL; enum hash_iter_state state = HI_STATE_3A; if (iter->table == NULL) return NULL; while (state != HI_STATE_0) { switch (state) { case HI_STATE_1: iter->i++; if(iter->i >= iter->table->segment_count) return NULL; /* test probably unnecessary */ iter->s = iter->table->directory[iter->i]; if (iter->s == NULL) { state = HI_STATE_1; break; } iter->j = 0; state = HI_STATE_2; /* FALLTHROUGH */ case HI_STATE_2: if (iter->j >= iter->table->segment_size) { state = HI_STATE_1; break; } iter->p = iter->s[iter->j]; state = HI_STATE_3A; /* FALLTHROUGH */ case HI_STATE_3A: if (iter->p == NULL) { state = HI_STATE_3B; break; } entry = &iter->p->entry; iter->p = iter->p->next; state = HI_STATE_0; break; case HI_STATE_3B: iter->j++; state = HI_STATE_2; break; default: /* Should never reach here */ fprintf(stderr, "ERROR hash_iter_next reached invalid state\n"); return NULL; break; } } return entry; } struct hash_iter_context_t *new_hash_iter_context(hash_table_t *table) { struct _hash_iter_context_t *iter; if (!table) return NULL;; iter = halloc(table, sizeof(struct _hash_iter_context_t)); if (iter == NULL) { return NULL; } iter->iter.next = (hash_iter_next_t) hash_iter_next; iter->table = table; iter->i = 0; iter->j = 0; iter->s = table->directory[iter->i]; iter->p = iter->s[iter->j]; return (struct hash_iter_context_t *)iter; } unsigned long hash_count(hash_table_t *table) { return table->entry_count; } int hash_keys(hash_table_t *table, unsigned long *count_arg, hash_key_t **keys_arg) { unsigned long count; hash_key_t *keys; hash_keys_callback_data_t data; if (!table) return HASH_ERROR_BAD_TABLE; count = table->entry_count; if (count == 0) { *count_arg = 0; *keys_arg = NULL; return HASH_SUCCESS; } keys = halloc(table, sizeof(hash_key_t) * count); if (keys == NULL) { *count_arg = -1; *keys_arg = NULL; return HASH_ERROR_NO_MEMORY; } data.index = 0; data.keys = keys; hash_iterate(table, hash_keys_callback, &data); *count_arg = count; *keys_arg = keys; return HASH_SUCCESS; } int hash_values(hash_table_t *table, unsigned long *count_arg, hash_value_t **values_arg) { unsigned long count; hash_value_t *values; hash_values_callback_data_t data; if (!table) return HASH_ERROR_BAD_TABLE; count = table->entry_count; if (count == 0) { *count_arg = 0; *values_arg = NULL; return HASH_SUCCESS; } values = halloc(table, sizeof(hash_value_t) * count); if (values == NULL) { *count_arg = -1; *values_arg = NULL; return HASH_ERROR_NO_MEMORY; } data.index = 0; data.values = values; hash_iterate(table, hash_values_callback, &data); *count_arg = count; *values_arg = values; return HASH_SUCCESS; } typedef struct hash_entries_callback_data_t { unsigned long index; hash_entry_t *entries; } hash_entries_callback_data_t; static bool hash_entries_callback(hash_entry_t *item, void *user_data) { hash_entries_callback_data_t *data = (hash_entries_callback_data_t *)user_data; data->entries[data->index++] = *item; return true; } int hash_entries(hash_table_t *table, unsigned long *count_arg, hash_entry_t **entries_arg) { unsigned long count; hash_entry_t *entries; hash_entries_callback_data_t data; if (!table) return HASH_ERROR_BAD_TABLE; count = table->entry_count; if (count == 0) { *count_arg = 0; *entries_arg = NULL; return HASH_SUCCESS; } entries = halloc(table, sizeof(hash_entry_t) * count); if (entries == NULL) { *count_arg = -1; *entries_arg = NULL; return HASH_ERROR_NO_MEMORY; } data.index = 0; data.entries = entries; hash_iterate(table, hash_entries_callback, &data); *count_arg = count; *entries_arg = entries; return HASH_SUCCESS; } bool hash_has_key(hash_table_t *table, hash_key_t *key) { hash_value_t value; if (hash_lookup(table, key, &value) == HASH_SUCCESS) return true; else return false; } int hash_get_default(hash_table_t *table, hash_key_t *key, hash_value_t *value, hash_value_t *default_value) { int error; if (!table) return HASH_ERROR_BAD_TABLE; error = hash_lookup(table, key, value); if (error == HASH_ERROR_KEY_NOT_FOUND) { error = hash_enter(table, key, default_value); if (error != HASH_SUCCESS) { return error; } *value = *default_value; return HASH_SUCCESS; } else { if (error != HASH_SUCCESS) return error; } return HASH_SUCCESS; } int hash_enter(hash_table_t *table, hash_key_t *key, hash_value_t *value) { int error; segment_t element, *chain; size_t len; if (!table) return HASH_ERROR_BAD_TABLE; if (!is_valid_key_type(key->type)) return HASH_ERROR_BAD_KEY_TYPE; if (!is_valid_value_type(value->type)) return HASH_ERROR_BAD_VALUE_TYPE; lookup(table, key, &element, &chain); if (element == NULL) { /* not found */ element = (element_t *)halloc(table, sizeof(element_t)); if (element == NULL) { /* Allocation failed, return NULL */ return HASH_ERROR_NO_MEMORY; } memset(element, 0, sizeof(element_t)); /* * Initialize new element */ switch(element->entry.key.type = key->type) { case HASH_KEY_ULONG: element->entry.key.ul = key->ul; break; case HASH_KEY_STRING: case HASH_KEY_CONST_STRING: len = strlen(key->c_str) + 1; element->entry.key.str = halloc(table, len); if (element->entry.key.str == NULL) { hfree(table, element); return HASH_ERROR_NO_MEMORY; } memcpy(element->entry.key.str, key->str, len); break; } *chain = element; /* link into chain */ element->next = NULL; /* * Table over-full? */ if (++table->entry_count / table->bucket_count > table->max_load_factor) { if ((error = expand_table(table)) != HASH_SUCCESS) { /* doesn't affect element */ return error; } } } else { hdelete_callback(table, HASH_ENTRY_DESTROY, &element->entry); } switch(element->entry.value.type = value->type) { case HASH_VALUE_UNDEF: element->entry.value.ul = 0; break; case HASH_VALUE_PTR: element->entry.value.ptr = value->ptr; break; case HASH_VALUE_INT: element->entry.value.i = value->i; break; case HASH_VALUE_UINT: element->entry.value.ui = value->ui; break; case HASH_VALUE_LONG: element->entry.value.l = value->l; break; case HASH_VALUE_ULONG: element->entry.value.ul = value->ul; break; case HASH_VALUE_FLOAT: element->entry.value.f = value->f; break; case HASH_VALUE_DOUBLE: element->entry.value.d = value->d; break; } return HASH_SUCCESS; } int hash_lookup(hash_table_t *table, hash_key_t *key, hash_value_t *value) { segment_t element, *chain; if (!table) return HASH_ERROR_BAD_TABLE; if (!is_valid_key_type(key->type)) return HASH_ERROR_BAD_KEY_TYPE; lookup(table, key, &element, &chain); if (element) { *value = element->entry.value; return HASH_SUCCESS; } else { return HASH_ERROR_KEY_NOT_FOUND; } } int hash_delete(hash_table_t *table, hash_key_t *key) { int error; segment_t element, *chain; if (!table) return HASH_ERROR_BAD_TABLE; if (!is_valid_key_type(key->type)) return HASH_ERROR_BAD_KEY_TYPE; lookup(table, key, &element, &chain); if (element) { hdelete_callback(table, HASH_ENTRY_DESTROY, &element->entry); *chain = element->next; /* remove from chain */ /* * Table too sparse? */ if (--table->entry_count / table->bucket_count < table->min_load_factor) { if ((error = contract_table(table)) != HASH_SUCCESS) { /* doesn't affect element */ return error; } } if (element->entry.key.type == HASH_KEY_STRING || element->entry.key.type == HASH_KEY_CONST_STRING) { hfree(table, element->entry.key.str); } hfree(table, element); return HASH_SUCCESS; } else { return HASH_ERROR_KEY_NOT_FOUND; } } ding-libs-0.6.2/dhash/dhash.h000066400000000000000000000424061417260640400157300ustar00rootroot00000000000000/* Authors: John Dennis Esmond Pitt This implementation was based on a 3/7/1989 public domain submission to comp.sources.misc by Esmond Pitt . Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #ifndef DHASH_H #define DHASH_H /*****************************************************************************/ /******************************** Documentation ******************************/ /*****************************************************************************/ #if 0 Dynamic hash table implementation based on article in CACM April 1988 pp. 446-457, by Per-Ake Larson. This implementation was based on a 3/7/1989 submission to comp.sources.misc by Esmond Pitt (ejp@ausmelb.oz.AU) that emulated the hsearch(3) interface. The interface was reworked to be much more flexible and significant new functionality was added by John Dennis (jdennis@sharpeye.com). A hash table maintains a set of pairs. Lookups are performed by locating the key in the table and returning its value. A dynamic hash table keeps the number of hash collisions constant independent of the number of entries in the hash table. Both keys and values may be of different types. Two different key types are supported, strings and unsigned longs. If the key type is a string the hash library will automatically allocate memory to hold the hash key string and will automatically free the memory for the key string when the hash entry is destroyed. Items in the hash table only match when their key types match AND the keys themselves match. For example if there were two hash entries, one whose key type was an unsigned long equal to 1 and one whose key type was a string equal to "1" they would not match, these are considered two distinct entries. The value of the key may be a undefined, pointer, an int, an unsigned int, a long, an unsigned long, a float, or a double. The hash library does nothing with user pointers (value.type == HASH_VALUE_PTR). Its the user responsibility to free items pointed to by these pointers when a hash entry is deleted or the hash table is destroyed (see hash_delete_callback and/or hash_destroy). See dhash_example.c for an illustration of how one might use the API. It does not represent complete API coverage nor the optimal way to do things in all cases, it is just a general example. Copyright 2009-1010 John Dennis This program is distributed under the terms of the GNU Lesser General Public License (LGPL). See the included COPYING and COPYING.lesser files for the terms of this license. #endif /*****************************************************************************/ /******************************* Include Files *******************************/ /*****************************************************************************/ #include #include /*****************************************************************************/ /*********************************** Defines *********************************/ /*****************************************************************************/ #if 1 #define HASH_STATISTICS #endif #define HASH_DEFAULT_DIRECTORY_BITS 5 #define HASH_DEFAULT_SEGMENT_BITS 5 #define HASH_DEFAULT_MIN_LOAD_FACTOR 1 #define HASH_DEFAULT_MAX_LOAD_FACTOR 5 #define HASH_ERROR_BASE -2000 #define HASH_ERROR_LIMIT (HASH_ERROR_BASE+20) #define IS_HASH_ERROR(error) (((error) >= HASH_ERROR_BASE) && ((error) < HASH_ERROR_LIMIT)) #define HASH_SUCCESS 0 #define HASH_ERROR_BAD_KEY_TYPE (HASH_ERROR_BASE + 1) #define HASH_ERROR_BAD_VALUE_TYPE (HASH_ERROR_BASE + 2) #define HASH_ERROR_NO_MEMORY (HASH_ERROR_BASE + 3) #define HASH_ERROR_KEY_NOT_FOUND (HASH_ERROR_BASE + 4) #define HASH_ERROR_BAD_TABLE (HASH_ERROR_BASE + 5) /*****************************************************************************/ /******************************* Type Definitions ****************************/ /*****************************************************************************/ struct hash_table_str; typedef struct hash_table_str hash_table_t; typedef enum { HASH_KEY_STRING, HASH_KEY_ULONG, HASH_KEY_CONST_STRING } hash_key_enum; typedef enum { HASH_VALUE_UNDEF, HASH_VALUE_PTR, HASH_VALUE_INT, HASH_VALUE_UINT, HASH_VALUE_LONG, HASH_VALUE_ULONG, HASH_VALUE_FLOAT, HASH_VALUE_DOUBLE } hash_value_enum; typedef enum { HASH_TABLE_DESTROY, HASH_ENTRY_DESTROY } hash_destroy_enum; typedef struct hash_key_t { hash_key_enum type; union { char *str; const char *c_str; unsigned long ul; }; } hash_key_t; typedef struct hash_value_t { hash_value_enum type; union { void *ptr; int i; unsigned int ui; long l; unsigned long ul; float f; double d; }; } hash_value_t; typedef struct hash_entry_t { hash_key_t key; hash_value_t value; } hash_entry_t; #ifdef HASH_STATISTICS typedef struct hash_statistics_t { unsigned long hash_accesses; unsigned long hash_collisions; unsigned long table_expansions; unsigned long table_contractions; } hash_statistics_t; #endif /* typedef's for callback based iteration */ typedef bool(*hash_iterate_callback)(hash_entry_t *item, void *user_data); typedef void (hash_delete_callback)(hash_entry_t *item, hash_destroy_enum type, void *pvt); /* typedef's for iteration object based iteration */ struct hash_iter_context_t; typedef hash_entry_t *(*hash_iter_next_t)(struct hash_iter_context_t *iter); struct hash_iter_context_t { hash_iter_next_t next; }; /* typedef for hash_create_ex() */ typedef void *(hash_alloc_func)(size_t size, void *pvt); typedef void (hash_free_func)(void *ptr, void *pvt); /*****************************************************************************/ /************************* External Global Variables ***********************/ /*****************************************************************************/ /*****************************************************************************/ /**************************** Exported Functions ***************************/ /*****************************************************************************/ /* * Given an error code returned by a hash function, map it to a error string. * Returns NULL if the error code is unrecognized. */ const char* hash_error_string(int error); /* * Create a new hash table with room for n initial entries. hash_create returns * an opaque pointer to the new hash table in the table parameter. Functions * operating on the hash table pass in this hash table pointer. This means you * may have as many concurrent hash tables as you want. * If the table creation is successful tbl is set to the new table and * HASH_SUCCESS is returned, otherwise tbl will be set to NULL and the * return value will be a HASH error code. * * count * Expected number of entries in the table. This is a tuning * parameter because a dynamic hash table dynamically adjusts it's * internal data strucuture to optimize for the actual number of * entries. The count parameter allows for some more optimization, * however it's not critical to get it right, the table will still * perform well. If you have no idea of how many entries to expect * then pass 0, a reasonable default will be selected. * tbl * Pointer to a hash_table_t variable which is initialized to the * new hash table (i.e. the returned table). If the table fails to * be created due to errors the tbl parameter will be set to NULL * and the return value will be a HASH error code. * delete_callback * Pointer to a function which will be called just prior to a hash * entry being deleted. This is useful when the hash value has * items which may need to be disposed of. The delete_callback may * be NULL. * delete_private_data * Void pointer passed to the delete_callback, this way delete * callbacks can have a private context to reach data they need to * use before performning their operations. delete_private_data * may be NULL. * * hash_create is identical to calling: * * hash_create_ex(count, tbl, 0, 0, 0, 0, NULL, NULL, NULL, * delete_callback, delete_private_data); */ int hash_create(unsigned long count, hash_table_t **tbl, hash_delete_callback *delete_callback, void *delete_private_data); /* * Create a new hash table and fine tune it's configurable parameters. * Refer to CACM article for explanation of parameters. See * hash_create for other parameters and return values. * * directory_bits * Number of address bits allocated to top level directory array. * If directory_bits or segment_bits is zero then directory_bits * and segment_bits will be computed based on the count parameter. * segment_bits * number of address bits allocated to segment array. * min_load_factor * The table contracted when the ratio of entry count to bucket count * is less than the min_load_factor the table is contracted. * max_load_factor * The table expanded when the ratio of entry count to bucket count * is greater than the max_load_factor the table is expanded. * alloc_func * Function pointer for allocation. * free_func * Function pointer for freeing memory allocated with alloc_func. * alloc_private_data * Data pointer passed to the alloc and free functions so that * custom functions can refernce other private data they may need * during their execution without having to use global variables. * * Note directory_bits + segment_bits must be <= number of bits in * unsigned long */ int hash_create_ex(unsigned long count, hash_table_t **tbl, unsigned int directory_bits, unsigned int segment_bits, unsigned long min_load_factor, unsigned long max_load_factor, hash_alloc_func *alloc_func, hash_free_func *free_func, void *alloc_private_data, hash_delete_callback *delete_callback, void *delete_private_data); #ifdef HASH_STATISTICS /* * Return statistics for the table. */ int hash_get_statistics(hash_table_t *table, hash_statistics_t *statistics); #endif /* * hash_destroy deletes all entries in the hash table, freeing all memory used * in implementing the hash table. Some hash entries may have values which are * pointers to user data structures. User pointers are not free by hash_destroy, * they must be free by the caller. This may be done by iterating over all the * entries in the table using hash_iterate() and freeing the values or by * registering a delete callback when the table is created with * hash_create(). Note, hash keys which are strings will be automatically freed * by hash_destroy, the caller does not need to free the key strings. */ int hash_destroy(hash_table_t *table); /* * Enter or update an item in the table referenced by key. If the key does not * exist yet the item will be created and inserted into the table with the * value, otherwise the value for the existing key is updated. The return value * may be HASH_ERROR_BAD_KEY_TYPE or HASH_ERROR_BAD_VALUE_TYPE if the key or * value type respectively is invalid. This function might also return * HASH_ERROR_NO_MEMORY. */ int hash_enter(hash_table_t *table, hash_key_t *key, hash_value_t *value); /* * Using the key lookup the value associated with it in the table. If the key is * not in the table HASH_ERROR_KEY_NOT_FOUND is returned. If the type of key is * invalid HASH_ERROR_BAD_KEY_TYPE is returned. Otherwise HASH_SUCCESS is * returned. If the result is anything other than HASH_SUCCESS the value pointer * is not updated. */ int hash_lookup(hash_table_t *table, hash_key_t *key, hash_value_t *value); /* * Like hash_lookup() except if the key is not in the table then it is entered * into the table and assigned the default_value. Thus it is not possible for * hash_get_default() to return HASH_ERROR_KEY_NOT_FOUND. */ int hash_get_default(hash_table_t *table, hash_key_t *key, hash_value_t *value, hash_value_t *default_value); /* * Delete the item from the table. The key and its type are specified in the key * parameter which are passed by reference. If the key was in the table * HASH_SUCCESS is returned otherwise HASH_ERROR_KEY_NOT_FOUND is * returned. Memory allocated to hold the key if it was a string is free by the * hash library, but values which are pointers to user data must be freed by the * caller (see delete_callback). */ int hash_delete(hash_table_t *table, hash_key_t *key); /* * Often it is useful to operate on every key and/or value in the hash * table. The hash_iterate function will invoke the users callback on every item * in the table as long as the callback returns a non-zero value. Returning a * zero from the callback can be used to halt the iteration prematurely if some * condition is met. The user_data parameter is passed to the callback * function. It can be used for any purpose the caller wants. The callback * parameter list is: * * bool callback(hash_entry_t *item, void *user_data); * * WARNING: Do not modify the contents of the table during an iteration it will * produce undefined results. If you need to visit each item in the table and * potentially delete or insert some entries the proper way to do this is to * obtain a list of keys or items using hash_keys() or hash_items() which * returns a copy of the keys or items. You may then loop on the list returned * and safely update the table (don't forget to free the list when done). */ int hash_iterate(hash_table_t *table, hash_iterate_callback callback, void *user_data); /* * This is another method to iterate on every key/value in the hash table. * However, unlike hash_iterate which requires a callback this function returns * an iterator object which contains a next() function pointer. Each time * next() is invoked it returns a pointer to the next hash entry in the table, * then NULL when all entries have been visited. In some circumstances it's more * convenient than having to define a callback. Like hash_iterate() one must * never modify the table contents during iteration. If you intend to modify the * table during iteration use the functions which return an indepent list of * keys, values, or items instead and iterate on the list. The iterator object * must be free'ed when you're done iterating by calling free() on it. * * Example: * * struct hash_iter_context_t *iter; * hash_entry_t *entry; * * iter = new_hash_iter_context(table); * while ((entry = iter->next(iter)) != NULL) { * do_something(entry); * } * free(iter); */ struct hash_iter_context_t *new_hash_iter_context(hash_table_t *table); /* * Return a count of how many items are currently in the table. */ unsigned long hash_count(hash_table_t *table); /* * Get an array of all the keys in the table returned through the keys * parameter. The number of elements in the array is returned in the count * parameter. Each key in the array is a copy of the key in the table. Any * pointers in the key will be shared with the table entry thus both the item in * the array and the item in the table point to the same object. The array * should be freed by calling free(). The function may return * HASH_ERROR_NO_MEMORY, otherwise HASH_SUCCESS. */ int hash_keys(hash_table_t *table, unsigned long *count, hash_key_t **keys); /* * Get an array of all the values in the table returned through the values * parameter. The number of elements in the array is returned in the count * parameter. Each value in the array is a copy of the value in the table. Any * pointers in the value will be shared with the table entry thus both the item in * the array and the item in the table point to the same object. The array * should be freed by calling free(). The function may return * HASH_ERROR_NO_MEMORY, otherwise HASH_SUCCESS. */ int hash_values(hash_table_t *table, unsigned long *count, hash_value_t **values); /* * Get an array of all the entries in the table returned through the entries * parameter. The number of elements in the array is returned in the count * parameter. Each entry in the array is a copy of the entry in the table. Any * pointers in the entry will be shared with the table entry thus both the item in * the array and the item in the table point to the same object. The array * should be freed by calling free(). The function may return * HASH_ERROR_NO_MEMORY, otherwise HASH_SUCCESS. */ int hash_entries(hash_table_t *table, unsigned long *count, hash_entry_t **entries); /* * Return boolean if the key is in the table. */ bool hash_has_key(hash_table_t *table, hash_key_t *key); #endif ding-libs-0.6.2/dhash/dhash.pc.in000066400000000000000000000004751417260640400165100ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: dhash Description: A hash table which will dynamically resize to achieve optimal storage & access time properties Version: @DHASH_VERSION@ Libs: -L${libdir} -ldhash Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/dhash/dhash_ut_check.c000066400000000000000000000135201417260640400175630ustar00rootroot00000000000000/* Authors: Michal Zidek Copyright (C) 2016 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #include "config.h" #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "dhash.h" #define HTABLE_SIZE 128 int verbose = 0; /* There must be no warnings generated during this test * without having to cast the key value. */ START_TEST(test_key_const_string) { hash_table_t *htable; int ret; hash_value_t ret_val; hash_value_t enter_val1; hash_value_t enter_val2; hash_key_t key; enter_val1.type = HASH_VALUE_INT; enter_val1.i = 1; enter_val2.type = HASH_VALUE_INT; enter_val2.i = 2; key.type = HASH_KEY_CONST_STRING; key.c_str = "constant"; ret = hash_create(HTABLE_SIZE, &htable, NULL, NULL); fail_unless(ret == 0); /* The table is empty, lookup should return error */ ret = hash_lookup(htable, &key, &ret_val); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); /* Deleting with non-existing key should return error */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_enter(htable, &key, &enter_val1); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 1); /* Overwrite the entry */ ret = hash_enter(htable, &key, &enter_val2); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 2); ret = hash_delete(htable, &key); fail_unless(ret == 0); /* Delete again with the same key */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_destroy(htable); fail_unless(ret == 0); } END_TEST START_TEST(test_key_string) { hash_table_t *htable; int ret; hash_value_t ret_val; hash_value_t enter_val1; hash_value_t enter_val2; hash_key_t key; char str[] = "non_constant"; enter_val1.type = HASH_VALUE_INT; enter_val1.i = 1; enter_val2.type = HASH_VALUE_INT; enter_val2.i = 2; key.type = HASH_KEY_STRING; key.str = str; ret = hash_create(HTABLE_SIZE, &htable, NULL, NULL); fail_unless(ret == 0); /* The table is empty, lookup should return error */ ret = hash_lookup(htable, &key, &ret_val); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); /* Deleting with non-existing key should return error */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_enter(htable, &key, &enter_val1); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 1); /* Overwrite the entry */ ret = hash_enter(htable, &key, &enter_val2); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 2); ret = hash_delete(htable, &key); fail_unless(ret == 0); /* Delete again with the same key */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_destroy(htable); fail_unless(ret == 0); } END_TEST START_TEST(test_key_ulong) { hash_table_t *htable; int ret; hash_value_t ret_val; hash_value_t enter_val1; hash_value_t enter_val2; hash_key_t key; enter_val1.type = HASH_VALUE_INT; enter_val1.i = 1; enter_val2.type = HASH_VALUE_INT; enter_val2.i = 2; key.type = HASH_KEY_ULONG; key.ul = 68ul; ret = hash_create(HTABLE_SIZE, &htable, NULL, NULL); fail_unless(ret == 0); /* The table is empty, lookup should return error */ ret = hash_lookup(htable, &key, &ret_val); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); /* Deleting with non-existing key should return error */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_enter(htable, &key, &enter_val1); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 1); /* Overwrite the entry */ ret = hash_enter(htable, &key, &enter_val2); fail_unless(ret == 0); hash_lookup(htable, &key, &ret_val); fail_unless(ret == 0); fail_unless(ret_val.i == 2); ret = hash_delete(htable, &key); fail_unless(ret == 0); /* Delete again with the same key */ ret = hash_delete(htable, &key); fail_unless(ret == HASH_ERROR_KEY_NOT_FOUND); ret = hash_destroy(htable); fail_unless(ret == 0); } END_TEST static Suite *dhash_suite(void) { Suite *s = suite_create(""); TCase *tc_basic = tcase_create("dhash API tests"); tcase_add_test(tc_basic, test_key_const_string); tcase_add_test(tc_basic, test_key_string); tcase_add_test(tc_basic, test_key_ulong); suite_add_tcase(s, tc_basic); return s; } int main(void) { int number_failed; Suite *s = dhash_suite(); SRunner *sr = srunner_create(s); /* If CK_VERBOSITY is set, use that, otherwise it defaults to CK_NORMAL */ srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/dhash/examples/000077500000000000000000000000001417260640400163005ustar00rootroot00000000000000ding-libs-0.6.2/dhash/examples/dhash_example.c000066400000000000000000000107271417260640400212550ustar00rootroot00000000000000/* Authors: John Dennis Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #include #include #include #include #include "dhash.h" struct my_data_t { int foo; char bar[128]; }; static void delete_callback(hash_entry_t *entry, hash_destroy_enum type, void *pvt) { if (entry->value.type == HASH_VALUE_PTR) free(entry->value.ptr); } static bool visit_callback(hash_entry_t *entry, void *user_data) { unsigned long *count = (unsigned long *)user_data; struct my_data_t *my_data = (struct my_data_t *) entry->value.ptr; (*count)++; printf("%s = [foo=%d bar=%s]\n", entry->key.str, my_data->foo, my_data->bar); return true; } static struct my_data_t *new_data(int foo, const char *bar) { struct my_data_t *my_data = malloc(sizeof(struct my_data_t)); my_data->foo = foo; strncpy(my_data->bar, bar, sizeof(my_data->bar)); return my_data; } int main(int argc, char **argv) { static hash_table_t *table = NULL; hash_key_t key, *keys; hash_value_t value; struct hash_iter_context_t *iter; hash_entry_t *entry; unsigned long i, n_entries; int error; struct my_data_t *my_data = new_data(1024, "Hello World!"); unsigned long count; /* Create a hash table */ error = hash_create(10, &table, delete_callback, NULL); if (error != HASH_SUCCESS) { fprintf(stderr, "cannot create hash table (%s)\n", hash_error_string(error)); return error; } /* Enter a key named "My Data" and specify it's value as a pointer to my_data */ key.type = HASH_KEY_STRING; key.str = strdup("My Data"); value.type = HASH_VALUE_PTR; value.ptr = my_data; if ((error = hash_enter(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "cannot add to table \"%s\" (%s)\n", key.str, hash_error_string(error)); return error; } free(key.str); /* Get a list of keys and print them out, free the list when we're done */ if ((error = hash_keys(table, &count, &keys)) != HASH_SUCCESS) { fprintf(stderr, "cannot get key list (%s)\n", hash_error_string(error)); return error; } for (i = 0; i < count; i++) printf("key: %s\n", keys[i].str); free(keys); /* Lookup the key named "My Data" */ key.type = HASH_KEY_STRING; key.str = strdup("My Data"); if ((error = hash_lookup(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "cannot find key \"%s\" (%s)\n", key.str, hash_error_string(error)); } free(key.str); /* Visit each entry in the table, callback will increment count on each visit */ printf("Iterate using callback\n"); count = 0; hash_iterate(table, visit_callback, &count); /* Assure number of visits equal the table size */ assert(count == hash_count(table)); /* Visit each entry using iterator object */ printf("Iterate using iterator\n"); n_entries = 0; iter = new_hash_iter_context(table); while ((entry = iter->next(iter)) != NULL) { struct my_data_t *data = (struct my_data_t *) entry->value.ptr; printf("%s = [foo=%d bar=%s]\n", entry->key.str, data->foo, data->bar); n_entries++; } free(iter); /* Assure number of visits equal the table size */ assert(n_entries == hash_count(table)); /* Remove the entry, deletion callback will be invoked */ key.type = HASH_KEY_STRING; key.str = strdup("My Data"); if ((error = hash_delete(table, &key)) != HASH_SUCCESS) { fprintf(stderr, "cannot delete from table (%s)\n", hash_error_string(error)); } /* Assure key is no longer in table */ assert (!hash_has_key(table, &key)); free(key.str); /* Free the table */ hash_destroy(table); return 0; } ding-libs-0.6.2/dhash/examples/dhash_test.c000066400000000000000000000466311417260640400206040ustar00rootroot00000000000000/* Authors: John Dennis Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #include #include #include #include #include #include #include "dhash.h" #define BUF_SIZE 1024 #define DEFAULT_MAX_TEST (500) hash_entry_t *iter_result_1 = NULL; hash_entry_t *iter_result_2 = NULL; unsigned long max_test = DEFAULT_MAX_TEST; int verbose = 0; static const char *error_string(int error) { const char *str; if (IS_HASH_ERROR(error)) return hash_error_string(error); if (error < 0) { return "Negative error codes are not supported."; } str = strerror(error); if (str == NULL) { return "strerror() returned NULL."; } return str; } static char *key_string(hash_key_t *key) { static char buf[BUF_SIZE]; switch(key->type) { case HASH_KEY_ULONG: snprintf(buf, sizeof(buf), "key ulong = %lu", key->ul); break; case HASH_KEY_STRING: snprintf(buf, sizeof(buf), "key string = \"%s\"", key->str); break; case HASH_KEY_CONST_STRING: snprintf(buf, sizeof(buf), "key string = \"%s\"", key->c_str); break; default: snprintf(buf, sizeof(buf), "unknown key type = %d", key->type); break; } return buf; } static char *value_string(hash_value_t *value) { static char buf[BUF_SIZE]; switch(value->type) { case HASH_VALUE_UNDEF: snprintf(buf, sizeof(buf), "value undefined"); break; case HASH_VALUE_PTR: snprintf(buf, sizeof(buf), "value str = \"%s\"", (char *)value->ptr); break; case HASH_VALUE_INT: snprintf(buf, sizeof(buf), "value int = %d", value->i); break; case HASH_VALUE_UINT: snprintf(buf, sizeof(buf), "value unsigned int = %u", value->ui); break; case HASH_VALUE_LONG: snprintf(buf, sizeof(buf), "value long = %ld", value->l); break; case HASH_VALUE_ULONG: snprintf(buf, sizeof(buf), "value unsigned long = %lu", value->ul); break; case HASH_VALUE_FLOAT: snprintf(buf, sizeof(buf), "value float = %f", value->f); break; case HASH_VALUE_DOUBLE: snprintf(buf, sizeof(buf), "value double = %f", value->f); break; default: snprintf(buf, sizeof(buf), "unknown value type = %d", value->type); break; } return buf; } static char *entry_string(hash_entry_t *entry) { static char buf[BUF_SIZE]; snprintf(buf, sizeof(buf), "[%s] = [%s]", key_string(&entry->key), value_string(&entry->value)); return buf; } static bool callback(hash_entry_t *item, void *user_data) { unsigned long *callback_count = (unsigned long *)user_data; iter_result_1[*callback_count] = *item; (*callback_count)++; if (verbose) printf("%s\n", entry_string(item)); return true; } static void delete_callback(hash_entry_t *item, hash_destroy_enum type, void *pvt) { if (item->value.type == HASH_VALUE_PTR) free(item->value.ptr); } typedef struct test_val_t { long val; char *str; } test_val_t; int main(int argc, char **argv) { test_val_t *test = NULL; long i, j, k; bool duplicate; long val; int status; hash_value_t value; hash_value_t old_value; hash_value_t new_value; hash_key_t key; char buf[BUF_SIZE]; hash_table_t *table = NULL; unsigned long callback_count = 0; unsigned long table_size = 0; unsigned int seed = time(0); unsigned int directory_bits = 0; unsigned int segment_bits = 0; unsigned long min_load_factor = HASH_DEFAULT_MIN_LOAD_FACTOR; unsigned long max_load_factor = HASH_DEFAULT_MAX_LOAD_FACTOR; while (1) { int arg; int option_index = 0; static struct option long_options[] = { {"count", 1, 0, 'c'}, {"verbose", 1, 0, 'v'}, {"quiet", 1, 0, 'q'}, {"table-size", 1, 0, 't'}, {"directory-bits", 1, 0, 'd'}, {"segment-bits", 1, 0, 's'}, {"min-load-factor", 1, 0, 'l'}, {"max-load-factor", 1, 0, 'h'}, {"seed", 1, 0, 'r'}, {0, 0, 0, 0} }; arg = getopt_long(argc, argv, "c:vqt:d:s:l:h:r:", long_options, &option_index); if (arg == -1) break; switch (arg) { case 'c': max_test = strtoul(optarg, NULL, 0); break; case 'v': verbose = 1; break; case 'q': verbose = 0; break; case 't': table_size = strtoul(optarg, NULL, 0); break; case 'd': directory_bits = atoi(optarg); break; case 's': segment_bits = atoi(optarg); break; case 'l': min_load_factor = strtoul(optarg, NULL, 0); break; case 'h': max_load_factor = strtoul(optarg, NULL, 0); break; case 'r': seed = strtoul(optarg, NULL, 0); break; } } if ((test = (test_val_t *) calloc(max_test, sizeof(test_val_t))) == NULL) { fprintf(stderr, "Failed to allocate test array\n"); exit(1); } if ((iter_result_1 = (hash_entry_t *) calloc(max_test, sizeof(hash_entry_t))) == NULL) { fprintf(stderr, "Failed to allocate iter_result_1 array\n"); exit(1); } if ((iter_result_2 = (hash_entry_t *) calloc(max_test, sizeof(hash_entry_t))) == NULL) { fprintf(stderr, "Failed to allocate iter_result_2 array\n"); exit(1); } /* Initialize the random number generator */ srandom(seed); printf("random seed: %#x\n", seed); /* Create the hash table as small as possible to exercise growth */ if ((status = hash_create_ex(table_size, &table, directory_bits, segment_bits, min_load_factor, max_load_factor, NULL, NULL, NULL, delete_callback, NULL)) != HASH_SUCCESS) { fprintf(stderr, "table creation failed at line %d (%s)\n", __LINE__, error_string(status)); exit(1); } /* Initialize the array of test values */ for (i = 0; i < max_test; i++) { /* Get random value, make sure it's unique */ duplicate = true; while (duplicate) { duplicate = false; val = random(); for (j = 0; j < i; j++) { if (test[j].val == val) { duplicate = true; break; } } } test[i].val = val; /* If the value is odd we'll use a string as the key, * otherwise we'll use an unsigned long as the key */ if (test[i].val & 1) { key.type = HASH_KEY_STRING; snprintf(buf, BUF_SIZE, "%ld", test[i].val); test[i].str = strdup(buf); } } printf("Completed building test values, beginning test ...\n"); /* Enter all the test values into the hash table */ for (i = 0; i < max_test; i++) { if (test[i].val & 1) { key.type = HASH_KEY_STRING; key.str = test[i].str; value.type = HASH_VALUE_PTR; value.ptr = (void *) strdup(test[i].str); } else { key.type = HASH_KEY_ULONG; key.ul = test[i].val; value.type = HASH_VALUE_LONG; value.l = test[i].val; } if (hash_has_key(table, &key)) { fprintf(stderr, "Error: %ld already in table when inserting, i = %lu, at line %d\n", test[i].val, i, __LINE__); exit(1); } if ((status = hash_enter(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: %ld failed insertion at line %d (%s) \n", test[i].val, __LINE__, error_string(status)); exit(1); } } /* Now visit each entry in the table using a callback iterator, * store what we found in iter_result_1 for testing the iterator object later on */ if (verbose) printf("callback iterate:\n"); callback_count = 0; if ((status = hash_iterate(table, callback, &callback_count)) != HASH_SUCCESS) { fprintf(stderr, "hash_iterate failed at line %d (%s)\n", __LINE__, error_string(status)); exit(1); } if (verbose) printf("hash_count=%ld, callback_count=%ld\n", hash_count(table), callback_count); if (hash_count(table) != callback_count) { fprintf(stderr, "Error: hash_count(%ld) != callback_count(%ld) at line %d\n", hash_count(table), callback_count, __LINE__); exit(1); } /* Now vist each entry in the table using an iterator object */ { struct hash_iter_context_t *iter; unsigned long n_items; hash_entry_t *entry; if (verbose) printf("iter iterate:\n"); n_items = 0; iter = new_hash_iter_context(table); while ((entry = iter->next(iter)) != NULL) { if (verbose) printf("%s\n", entry_string(entry)); iter_result_2[n_items] = *entry; n_items++; } if (verbose) printf("hash_count=%ld, n_items=%ld\n", hash_count(table), n_items); if (hash_count(table) != n_items) { fprintf(stderr, "Error: hash_count(%ld) != n_items(%ld) at line %d\n", hash_count(table), n_items, __LINE__); exit(1); } free(iter); } /* Both iterators should have visited each item in the same order, verify ... */ for (i = 0; i < max_test; i++) { if (memcmp(&iter_result_1[i], &iter_result_2[i], sizeof(iter_result_1[0])) != 0) { fprintf(stderr, "Error: iter_result_1[%lu] != iter_result_2[%lu] at line %d\n", i, i, __LINE__); exit(1); } } /* Get an array of keys in the table, print them out */ { unsigned long count; hash_key_t *keys; if (verbose) printf("\nhash_keys:\n"); if ((status = hash_keys(table, &count, &keys)) != HASH_SUCCESS) { fprintf(stderr, "hash_keys failed at line %d (%s)\n", __LINE__, error_string(status)); exit(1); } if (hash_count(table) != count) { fprintf(stderr, "Error: hash_count(%ld) != hash_keys() count(%ld) at line %d\n", hash_count(table), count, __LINE__); exit(1); } for (i = 0; i < count; i++) { if (verbose) printf("%s\n", key_string(&keys[i])); } free(keys); } /* Get an array of values in the table, print them out */ { unsigned long count; hash_value_t *values; if (verbose) printf("\nhash_values:\n"); hash_values(table, &count, &values); if (hash_count(table) != count) { fprintf(stderr, "Error: hash_count(%ld) != hash_values() count(%ld) at line %d\n", hash_count(table), count, __LINE__); exit(1); } for (i = 0; i < count; i++) { if (verbose) printf("%s\n", value_string(&values[i])); } free(values); } /* Get an array of items in the table, print them out */ { unsigned long count; hash_entry_t *entries; if (verbose) printf("\nhash_entries:\n"); hash_entries(table, &count, &entries); if (hash_count(table) != count) { fprintf(stderr, "Error: hash_count(%ld) != hash_entries() count(%ld) at line %d\n", hash_count(table), count, __LINE__); exit(1); } for (i = 0; i < count; i++) { if (verbose) printf("%s\n", entry_string(&entries[i])); } free(entries); } /* See if we can find every key */ for (i = max_test - 1; i >= 0; i--) { if (test[i].val & 1) { key.type = HASH_KEY_STRING; key.str = test[i].str; } else { key.type = HASH_KEY_ULONG; key.ul = test[i].val; } if ((status = hash_lookup(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: failed first lookup for value %ld at index %ld at line %d (%s)\n", test[i].val, i, __LINE__, error_string(status)); exit(1); } else { switch(value.type) { case HASH_VALUE_PTR: if (strcmp((char *)value.ptr, test[i].str) != 0) { fprintf(stderr, "Error: corrupt ptr data for %lu at line %d\n", i, __LINE__); exit(1); } break; case HASH_VALUE_LONG: if (value.l != test[i].val) { fprintf(stderr, "Error: corrupt long data for %lu at line %d\n", i, __LINE__); exit(1); } break; default: fprintf(stderr, "Error: unknown value type for %lu\n", i); break; } } } /* Update an entry */ if (test[0].val & 1) { key.type = HASH_KEY_STRING; key.str = test[0].str; } else { key.type = HASH_KEY_ULONG; key.ul = test[0].val; } if ((status = hash_lookup(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: failed lookup for value %ld, at line %d (%s)\n", test[0].val, __LINE__, error_string(status)); exit(1); } old_value.type = value.type; switch (value.type) { case HASH_VALUE_LONG: old_value.ul = value.ul; break; case HASH_VALUE_PTR: old_value.ptr = strdup(value.ptr); break; default: fprintf(stderr, "Error: unsupported value type for update.\n"); exit(1); } value.type = HASH_VALUE_PTR; value.ptr = (void *) strdup("Updated"); if ((status = hash_enter(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: %ld failed insertion at line %d (%s) \n", test[0].val, __LINE__, error_string(status)); exit(1); } if ((status = hash_lookup(table, &key, &new_value)) != HASH_SUCCESS) { fprintf(stderr, "Error: failed lookup for value %ld, at line %d (%s)\n", test[0].val, __LINE__, error_string(status)); exit(1); } if (value.type == new_value.type) { if (strcmp(value.ptr, new_value.ptr) != 0) { fprintf(stderr, "Error: Updated value is not correct, " "expected (%s) got (%s), at line %d\n", (char *) value.ptr, (char *) new_value.ptr, __LINE__); exit(1); } } else { fprintf(stderr, "Error: Updated value is not correct, " "expected type (%d) got (%d), at line %d\n", value.type, new_value.type, __LINE__); exit(1); } if ((status = hash_enter(table, &key, &old_value)) != HASH_SUCCESS) { fprintf(stderr, "Error: %ld failed insertion at line %d (%s) \n", test[0].val, __LINE__, error_string(status)); exit(1); } /* * Delete a key, make sure we can't find it, assure we can find all other * keys. */ for (i = 0; i < max_test; i++) { if (test[i].val & 1) { key.type = HASH_KEY_STRING; key.str = test[i].str; } else { key.type = HASH_KEY_ULONG; key.ul = test[i].val; } if ((status = hash_lookup(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: failed delete lookup for value %ld at index %ld at line %d (%s)\n", test[i].val, i, __LINE__, error_string(status)); exit(1); } if ((status = hash_delete(table, &key)) != HASH_SUCCESS) { fprintf(stderr, "Error: %ld not in table when deleting, i = %lu at line %d (%s)\n", test[i].val, i, __LINE__, error_string(status)); exit(1); } if (hash_lookup(table, &key, &value) != HASH_ERROR_KEY_NOT_FOUND) { fprintf(stderr, "Error: found in table after deletion, value = %ld at index %ld at line %d\n", test[i].val, i, __LINE__); exit(1); } /* See if we can find all remaining keys */ for (k = i + 1; k < max_test; k++) { if (test[k].val & 1) { key.type = HASH_KEY_STRING; key.str = test[k].str; } else { key.type = HASH_KEY_ULONG; key.ul = test[k].val; } if ((status = hash_lookup(table, &key, &value)) != HASH_SUCCESS) { fprintf(stderr, "Error: failed second lookup for value %ld, i = %lu k = %lu at line %d (%s)\n", test[k].val, i, k, __LINE__, error_string(status)); exit(1); } else { switch(value.type) { case HASH_VALUE_PTR: if (strcmp((char *)value.ptr, test[k].str) != 0) { fprintf(stderr, "Error: corrupt ptr data for %lu at line %d\n", k, __LINE__); exit(1); } break; case HASH_VALUE_LONG: if (value.l != test[k].val) { fprintf(stderr, "Error: corrupt long data for %lu at line %d\n", k, __LINE__); exit(1); } break; default: fprintf(stderr, "Error: unknown value type (%d) for %lu\n", value.type, k); break; } } } } if (verbose) printf("\n"); #ifdef HASH_STATISTICS { hash_statistics_t stats; if ((status = hash_get_statistics(table, &stats)) != HASH_SUCCESS) { fprintf(stderr, "Error: could not get statistics at line %d (%s)\n", __LINE__, error_string(status)); exit(1); } printf("Statistics: Accesses = %ld, Collisions = %ld, Collision Rate = %.2f, Expansions = %ld, Contractions = %ld\n", stats.hash_accesses, stats.hash_collisions, ((float)stats.hash_collisions / (float)stats.hash_accesses), stats.table_expansions, stats.table_contractions); } #endif if ((status = hash_destroy(table)) != HASH_SUCCESS) { fprintf(stderr, "table destruction failed at line %d (%s)\n", __LINE__, error_string(status)); exit(1); } for (i = 0; i < max_test; i++) { if (test[i].val & 1) { free(test[i].str); } } free(test); free(iter_result_1); free(iter_result_2); printf("Successfully tested %lu values\n", max_test); return 0; } ding-libs-0.6.2/dhash/libdhash.sym000066400000000000000000000005301417260640400167700ustar00rootroot00000000000000DHASH_0.4.3 { global: hash_error_string; hash_create; hash_create_ex; hash_get_statistics; hash_destroy; hash_enter; hash_lookup; hash_get_default; hash_delete; hash_iterate; new_hash_iter_context; hash_count; hash_keys; hash_values; hash_entries; hash_has_key; local: *; }; ding-libs-0.6.2/ini/000077500000000000000000000000001417260640400141525ustar00rootroot00000000000000ding-libs-0.6.2/ini/ini.conf000066400000000000000000000057731417260640400156140ustar00rootroot00000000000000# INI file that is used by unit test data = ds,mf.ds,mf.ds,m.ds,mds.,fmds. dskjh = mdsmdssm ,md.sd, C1 = "abcd" ;test data wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww = haha [ ] [ wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww ] ;more data = "nmjdsbfmsdn" s = "nmjdsbfmsdn HEX1 = 'ABV1' HEX2 = 'ABV' [ ttt ] C2 ='Ab' int=-44i44 int2=-66U c = with creame and sugar [ dddd ] DC1 = 123U f=-9.0.0 DC2 = -235L DC3 = -345.8907 [ zoo something [ ttt ] v=55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555 v1=55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555.55555555555555555555555555555555 C3 = -34756.56 C4 = .9 ding-libs-0.6.2/ini/ini.d/000077500000000000000000000000001417260640400151535ustar00rootroot00000000000000ding-libs-0.6.2/ini/ini.d/comment.conf000066400000000000000000000010151417260640400174610ustar00rootroot00000000000000/* C-style comment 1 */ /* * C-style comment 2 */ /* // * C-style comment 2 // commented_out_key = some_value */ # The following should be viewed as comment # so no error is expected /*/ = /*/ # The following should be viewed as key # so no error is expected /./ = // # The following should be viewed as key # but it would be error due to spaces /./* = /./ // This should be an error becuase parser thinks it should be a KVP line /* Same with this one */ /* This comment should procduce an error ding-libs-0.6.2/ini/ini.d/first.conf000066400000000000000000000013221417260640400171470ustar00rootroot00000000000000[section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value #END OF THE FIRST FILE ding-libs-0.6.2/ini/ini.d/foo.conf.in000066400000000000000000000002401417260640400172060ustar00rootroot00000000000000#Hoho section [hoho] #Hoho value val= hoho #End of hoho #Start of section [foo] #First value bar = first value #Second value bar = second value #End of section ding-libs-0.6.2/ini/ini.d/ipa.conf000066400000000000000000000053001417260640400165710ustar00rootroot00000000000000[provider/ipa] ipa_domain = str, None, true ipa_server = str, None, true ipa_hostname = str, None, false ldap_uri = str, None, false ldap_search_base = str, None, false ldap_schema = str, None, false ldap_default_bind_dn = str, None, false ldap_default_authtok_type = str, None, false ldap_default_authtok = str, None, false ldap_network_timeout = int, None, false ldap_opt_timeout = int, None, false ldap_offline_timeout = int, None, false ldap_tls_cacert = str, None, false ldap_tls_reqcert = str, None, false ldap_sasl_mech = str, None, false ldap_sasl_authid = str, None, false krb5_kdcip = str, None, false krb5_realm = str, None, false krb5_auth_timeout = int, None, false ldap_krb5_keytab = str, None, false ldap_krb5_init_creds = bool, None, false ldap_entry_usn = str, None, false ldap_rootdse_last_usn = str, None, false ldap_referrals = bool, None, false [provider/ipa/id] ldap_search_timeout = int, None, false ldap_enumeration_refresh_timeout = int, None, false ldap_purge_cache_timeout = int, None, false ldap_id_use_start_tls = bool, None, false ldap_user_search_base = str, None, false ldap_user_search_scope = str, None, false ldap_user_search_filter = str, None, false ldap_user_object_class = str, None, false ldap_user_name = str, None, false ldap_user_uid_number = str, None, false ldap_user_gid_number = str, None, false ldap_user_gecos = str, None, false ldap_user_homedir = str, None, false ldap_user_shell = str, None, false ldap_user_uuid = str, None, false ldap_user_principal = str, None, false ldap_user_fullname = str, None, false ldap_user_member_of = str, None, false ldap_user_modify_timestamp = str, None, false ldap_user_shadow_last_change = str, None, false ldap_user_shadow_min = str, None, false ldap_user_shadow_max = str, None, false ldap_user_shadow_warning = str, None, false ldap_user_shadow_inactive = str, None, false ldap_user_shadow_expire = str, None, false ldap_user_shadow_flag = str, None, false ldap_user_krb_last_pwd_change = str, None, false ldap_user_krb_password_expiration = str, None, false ldap_pwd_attribute = str, None, false ldap_group_search_base = str, None, false ldap_group_search_scope = str, None, false ldap_group_search_filter = str, None, false ldap_group_object_class = str, None, false ldap_group_name = str, None, false ldap_group_gid_number = str, None, false ldap_group_member = str, None, false ldap_group_uuid = str, None, false ldap_group_modify_timestamp = str, None, false ldap_force_upper_case_realm = bool, None, false [provider/ipa/auth] krb5_ccachedir = str, None, false krb5_ccname_template = str, None, false krb5_keytab = str, None, false krb5_validate = bool, None, false [provider/ipa/access] [provider/ipa/chpass] krb5_changepw_principal = str, None, false ding-libs-0.6.2/ini/ini.d/merge.validator000066400000000000000000000063011417260640400201610ustar00rootroot00000000000000Errors detected while parsing: %s%s/comment.conf. Error (9) on line 22: Invalid space character at the beginning of the line. Error (9) on line 24: Invalid space character at the beginning of the line. Error (9) on line 26: Invalid space character at the beginning of the line. Error (15) on line 32: Incomplete comment at the end of the file. Section [section_a] found in file %s%s/first.conf is not allowed. Section [section_c] found in file %s%s/first.conf is not allowed. Section [section_b] found in file %s%s/first.conf is not allowed. File %s%s/first.conf contains sections that are not allowed. Skipping. Section [section_a] found in file %s%s/mergecheck.conf is not allowed. Section [section_c] found in file %s%s/mergecheck.conf is not allowed. Section [section_b] found in file %s%s/mergecheck.conf is not allowed. Section [section_d] found in file %s%s/mergecheck.conf is not allowed. File %s%s/mergecheck.conf contains sections that are not allowed. Skipping. Section [service] found in file %s%s/mysssd.conf is not allowed. Section [sssd] found in file %s%s/mysssd.conf is not allowed. Section [nss] found in file %s%s/mysssd.conf is not allowed. Section [pam] found in file %s%s/mysssd.conf is not allowed. Section [domain] found in file %s%s/mysssd.conf is not allowed. File %s%s/mysssd.conf contains sections that are not allowed. Skipping. Section [section_a] found in file %s%s/second.conf is not allowed. Section [section_b] found in file %s%s/second.conf is not allowed. Section [section_d] found in file %s%s/second.conf is not allowed. File %s%s/second.conf contains sections that are not allowed. Skipping. Section [section1] found in file %s%s/sexpect.conf is not allowed. Section [section2] found in file %s%s/sexpect.conf is not allowed. File %s%s/sexpect.conf contains sections that are not allowed. Skipping. Section [section1] found in file %s%s/smerge.conf is not allowed. Section [section2] found in file %s%s/smerge.conf is not allowed. File %s%s/smerge.conf contains sections that are not allowed. Skipping. Errors detected while parsing: %s%s/space.conf. Error (9) on line 1: Invalid space character at the beginning of the line. Error (9) on line 2: Invalid space character at the beginning of the line. Error (9) on line 3: Invalid space character at the beginning of the line. Error (9) on line 4: Invalid space character at the beginning of the line. Section [info] found in file %s%s/symbols.conf is not allowed. Section [languages] found in file %s%s/symbols.conf is not allowed. Section [text] found in file %s%s/symbols.conf is not allowed. File %s%s/symbols.conf contains sections that are not allowed. Skipping. Errors detected while parsing: %s%s/test.conf. Error (9) on line 11: Invalid space character at the beginning of the line. Error (9) on line 12: Invalid space character at the beginning of the line. Error (9) on line 14: Invalid space character at the beginning of the line. Error (9) on line 15: Invalid space character at the beginning of the line. Error (9) on line 16: Invalid space character at the beginning of the line. Error (9) on line 26: Invalid space character at the beginning of the line. Error (9) on line 35: Invalid space character at the beginning of the line. %s%s/ipa.conf %s%s/real.conf ding-libs-0.6.2/ini/ini.d/mergecheck.conf000066400000000000000000000402001417260640400201130ustar00rootroot00000000000000# Section mode: MERGE, value mode: OVERWRITE [section_a] key1 = second file, key1 second multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 second multi value key2 = first file, key2 second multi value [section_b] key1 = key1 second multi value key2 = key2 second multi value key3 = key3 second multi value [section_d] key1 = second file, key1 second multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: MERGE, value mode: ERROR # This is an expected error 17 in mode 0 + 16 + 1 # Section mode: MERGE, value mode: PRESERVE [section_a] key1 = first file, key1 single value key2 = first file, key2 single value [section_c] key1 = first file, key1 single value key2 = first file, key2 single value [section_b] key1 = key1 single value key2 = key2 single value key3 = key3 single value [section_d] key1 = second file, key1 single value key2 = second file, key2 single value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: MERGE, value mode: ALLOW [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: MERGE, value mode: DETECT # This is an expected error 17 in mode 0 + 64 + 4 [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: ERROR, value mode: OVERWRITE # This is an expected error 17 in mode 256 + 0 + 0 # Section mode: ERROR, value mode: ERROR # This is an expected error 17 in mode 256 + 16 + 1 # Section mode: ERROR, value mode: PRESERVE # This is an expected error 17 in mode 256 + 32 + 2 # Section mode: ERROR, value mode: ALLOW # This is an expected error 17 in mode 256 + 48 + 3 # Section mode: ERROR, value mode: DETECT # This is an expected error 17 in mode 256 + 64 + 4 # Section mode: OVERWRITE, value mode: OVERWRITE [section_a] key1 = second file, key1 second multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 second multi value key2 = first file, key2 second multi value [section_b] key1 = key1 second multi value key2 = key2 second multi value key3 = key3 second multi value [section_d] key1 = second file, key1 second multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: OVERWRITE, value mode: ERROR # This is an expected error 17 in mode 512 + 16 + 1 # Section mode: OVERWRITE, value mode: PRESERVE [section_a] key1 = second file, key1 single value key2 = second file, key2 single value [section_c] key1 = first file, key1 single value key2 = first file, key2 single value [section_b] key1 = key1 single value key2 = key2 single value key3 = key3 single value [section_d] key1 = second file, key1 single value key2 = second file, key2 single value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: OVERWRITE, value mode: ALLOW [section_a] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: OVERWRITE, value mode: DETECT # This is an expected error 17 in mode 512 + 64 + 4 [section_a] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: PRESERVE, value mode: OVERWRITE [section_a] key1 = first file, key1 second multi value key2 = first file, key2 second multi value [section_c] key1 = first file, key1 second multi value key2 = first file, key2 second multi value [section_b] key1 = key1 second multi value key2 = key2 second multi value [section_d] key1 = second file, key1 second multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: PRESERVE, value mode: ERROR [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: PRESERVE, value mode: PRESERVE [section_a] key1 = first file, key1 single value key2 = first file, key2 single value [section_c] key1 = first file, key1 single value key2 = first file, key2 single value [section_b] key1 = key1 single value key2 = key2 single value [section_d] key1 = second file, key1 single value key2 = second file, key2 single value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: PRESERVE, value mode: ALLOW [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: PRESERVE, value mode: DETECT [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: DETECT, value mode: OVERWRITE # This is an expected error 17 in mode 1024 + 0 + 0 [section_a] key1 = second file, key1 second multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 second multi value key2 = first file, key2 second multi value [section_b] key1 = key1 second multi value key2 = key2 second multi value key3 = key3 second multi value [section_d] key1 = second file, key1 second multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: DETECT, value mode: ERROR # This is an expected error 17 in mode 1024 + 16 + 1 # Section mode: DETECT, value mode: PRESERVE # This is an expected error 17 in mode 1024 + 32 + 2 [section_a] key1 = first file, key1 single value key2 = first file, key2 single value [section_c] key1 = first file, key1 single value key2 = first file, key2 single value [section_b] key1 = key1 single value key2 = key2 single value key3 = key3 single value [section_d] key1 = second file, key1 single value key2 = second file, key2 single value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: DETECT, value mode: ALLOW # This is an expected error 17 in mode 1024 + 48 + 3 [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE # Section mode: DETECT, value mode: DETECT # This is an expected error 17 in mode 1024 + 64 + 4 [section_a] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_c] key1 = first file, key1 single value key1 = first file, key1 first multi value key1 = first file, key1 second multi value key2 = first file, key2 single value key2 = first file, key2 first multi value key2 = first file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE FIRST FILE #END OF THE SECOND FILE ding-libs-0.6.2/ini/ini.d/mysssd.conf000066400000000000000000000034211417260640400173440ustar00rootroot00000000000000# Format: # option = type, subtype, mandatory[, default] [service] # Options available to all services debug_level = int, None, false debug_timestamps = bool, None, false debug_to_files = bool, None, false command = str, None, false reconnection_retries = int, None, false [sssd] # Monitor service services = list, str, true, nss, pam domains = list, str, true timeout = int, None, false sbus_timeout = int, None, false re_expression = str, None, false full_name_format = str, None, false [nss] # Name service enum_cache_timeout = int, None, false entry_cache_no_wait_percentage = int, None, false entry_negative_timeout = int, None, false filter_users = list, str, false filter_groups = list, str, false filter_users_in_groups = bool, None, false pwfield = str, None, false [pam] # Authentication service offline_credentials_expiration = int, None, false offline_failed_login_attempts = int, None, false offline_failed_login_delay = int, None, false [provider] #Available provider types id_provider = str, None, true auth_provider = str, None, true access_provider = str, None, false chpass_provider = str, None, false [domain] # Options available to all domains debug_level = int, None, false, 0 debug_timestamps = bool, None, false command = str, None, false min_id = int, None, true, 1000 max_id = int, None, false timeout = int, None, false enumerate = bool, None, false cache_credentials = bool, None, true, false store_legacy_passwords = bool, None, false use_fully_qualified_names = bool, None, false entry_cache_timeout = int, None, false lookup_family_order = str, None, false account_cache_expiration = int, None, false filter_users = list, str, false filter_groups = list, str, false # Special providers [provider/permit] [provider/permit/access] [provider/deny] [provider/deny/access] ding-libs-0.6.2/ini/ini.d/new_line.conf000066400000000000000000000000001417260640400176100ustar00rootroot00000000000000ding-libs-0.6.2/ini/ini.d/real.conf000066400000000000000000000031611417260640400167460ustar00rootroot00000000000000// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 9223375036854775931 ding-libs-0.6.2/ini/ini.d/real16be.conf000066400000000000000000000063301417260640400174250ustar00rootroot00000000000000þÿ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini.d/real16le.conf000066400000000000000000000063301417260640400174370ustar00rootroot00000000000000ÿþ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini.d/real32be.conf000066400000000000000000000146601417260640400174300ustar00rootroot00000000000000þÿ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini.d/real32le.conf000066400000000000000000000146601417260640400174420ustar00rootroot00000000000000ÿþ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini.d/real8.conf000066400000000000000000000031561417260640400170420ustar00rootroot00000000000000// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains] domainsOrder = , LOCAL, , EXAMPLE.COM, , SOMEOTHER.COM , , badarray = , , , , , somearray = , someotherarray = , ; justdelim=:;,; yetanother = [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = ipaserver1.example.com server = ipabackupserver.example.com legacy = FALSE server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' long_array = 1 2; 4' ;8p .16/ 32? double_array = 1.1 2.222222; .4' . ;8p .16/ -32? server = yetanotheripabackupserver.example.com empty_value = space_value = " " int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini.d/second.conf000066400000000000000000000014651417260640400173030ustar00rootroot00000000000000[section_a] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value [section_b] key1 = key1 single value key1 = key1 first multi value key1 = key1 second multi value key2 = key2 single value key2 = key2 first multi value key2 = key2 second multi value key3 = key3 single value key3 = key3 first multi value key3 = key3 second multi value [section_d] key1 = second file, key1 single value key1 = second file, key1 first multi value key1 = second file, key1 second multi value key2 = second file, key2 single value key2 = second file, key2 first multi value key2 = second file, key2 second multi value #END OF THE SECOND FILE ding-libs-0.6.2/ini/ini.d/sexpect.conf000066400000000000000000000137571417260640400175120ustar00rootroot00000000000000# Section mode: MERGE, value mode: OVERWRITE [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: MERGE, value mode: ERROR # Section mode: MERGE, value mode: PRESERVE [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: MERGE, value mode: ALLOW [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: MERGE, value mode: DETECT [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: ERROR, value mode: OVERWRITE # Section mode: ERROR, value mode: ERROR # Section mode: ERROR, value mode: PRESERVE # Section mode: ERROR, value mode: ALLOW # Section mode: ERROR, value mode: DETECT # Section mode: OVERWRITE, value mode: OVERWRITE [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: OVERWRITE, value mode: ERROR [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: OVERWRITE, value mode: PRESERVE [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: OVERWRITE, value mode: ALLOW [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: OVERWRITE, value mode: DETECT [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: PRESERVE, value mode: OVERWRITE [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: PRESERVE, value mode: ERROR [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: PRESERVE, value mode: PRESERVE [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: PRESERVE, value mode: ALLOW [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: PRESERVE, value mode: DETECT [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: DETECT, value mode: OVERWRITE [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: DETECT, value mode: ERROR # Section mode: DETECT, value mode: PRESERVE [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 #End of file # Section mode: DETECT, value mode: ALLOW [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file # Section mode: DETECT, value mode: DETECT [section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file ding-libs-0.6.2/ini/ini.d/smerge.conf000066400000000000000000000007111417260640400173030ustar00rootroot00000000000000[section1] # Key 1 key1 = section1a Value 1 # Key 2 key2 = section1a Value 2 # Key 3 key3 = section1a Value 3 [section2] # Key 1 key1 = section2a Value 1 # Key 2 key2 = section2a Value 2 # Key 3 key3 = section2a Value 3 [section1] # Key 1 key1 = section1b Value 1 # Key 2 key2 = section1b Value 2 # Key 3 key3 = section1b Value 3 [section2] # Key 1 key1 = section2b Value 1 # Key 2 key2 = section2b Value 2 # Key 3 key3 = section2b Value 3 #End of file ding-libs-0.6.2/ini/ini.d/space.conf000066400000000000000000000001321417260640400171110ustar00rootroot00000000000000 spaces = value tab = value tab_and_space = value space_and_tab = value ding-libs-0.6.2/ini/ini.d/symbols.conf000066400000000000000000056221721417260640400175310ustar00rootroot00000000000000ÿþ; ==++== ; ; Copyright (c) Microsoft Corporation. All rights reserved. ; ; ==--== //------------------------------------------------------------------------ // WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING // // AUTO GENERATED FILE. DO NOT EDIT. USE $/com99/src/profile/perfmonhelp // // WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING //------------------------------------------------------------------------ // CORPerfMonSymbols.ini file [info] drivername=.NETFramework symbolfile=CORPerfMonSymbols.h [languages] 009=English 001=Arabic 804=Chinese (PRC) 404=Chinese (Taiwan) 005=Czech 006=Danish 007=German 008=Greek 00A=Spanish 00B=Finnish 00C=French 00D=Hebrew 00E=Hungarian 010=Italian 011=Japanese 012=Korean 013=Dutch 014=Norwegian 015=Polish 416=Portuguese (Brazil) 816=Portuguese (Portugal) 019=Russian 01D=Swedish 01F=Turkish [text] DotNetCLR_Memory_OBJECT_009_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_009_HELP=Counters for CLR Garbage Collected heap. GEN0_COLLECTIONS_COUNTER_009_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_009_HELP=This counter displays the number of times the generation 0 objects (youngest; most recently allocated) are garbage collected (Gen 0 GC) since the start of the application. Gen 0 GC occurs when the available memory in generation 0 is not sufficient to satisfy an allocation request. This counter is incremented at the end of a Gen 0 GC. Higher generation GCs include all lower generation GCs. This counter is explicitly incremented when a higher generation (Gen 1 or Gen 2) GC occurs. _Global_ counter value is not accurate and should be ignored. This counter displays the last observed value. GEN1_COLLECTIONS_COUNTER_009_NAME=# Gen 1 Collections GEN1_COLLECTIONS_COUNTER_009_HELP=This counter displays the number of times the generation 1 objects are garbage collected since the start of the application. The counter is incremented at the end of a Gen 1 GC. Higher generation GCs include all lower generation GCs. This counter is explicitly incremented when a higher generation (Gen 2) GC occurs. _Global_ counter value is not accurate and should be ignored. This counter displays the last observed value. GEN2_COLLECTIONS_COUNTER_009_NAME=# Gen 2 Collections GEN2_COLLECTIONS_COUNTER_009_HELP=This counter displays the number of times the generation 2 objects (older) are garbage collected since the start of the application. The counter is incremented at the end of a Gen 2 GC (also called full GC). _Global_ counter value is not accurate and should be ignored. This counter displays the last observed value. GEN0_BYTES_PROMOTED_COUNTER_009_NAME=Promoted Memory from Gen 0 GEN0_BYTES_PROMOTED_COUNTER_009_HELP=This counter displays the bytes of memory that survive garbage collection (GC) and are promoted from generation 0 to generation 1; objects that are promoted just because they are waiting to be finalized are not included in this counter. This counter displays the value observed at the end of the last GC; its not a cumulative counter. GEN1_BYTES_PROMOTED_COUNTER_009_NAME=Promoted Memory from Gen 1 GEN1_BYTES_PROMOTED_COUNTER_009_HELP=This counter displays the bytes of memory that survive garbage collection (GC) and are promoted from generation 1 to generation 2; objects that are promoted just because they are waiting to be finalized are not included in this counter. This counter displays the value observed at the end of the last GC; its not a cumulative counter. This counter is reset to 0 if the last GC was a Gen 0 GC only. GEN0_PROMOTION_RATE_009_NAME=Gen 0 Promoted Bytes/Sec GEN0_PROMOTION_RATE_009_HELP=This counter displays the bytes per second that are promoted from generation 0 (youngest) to generation 1; objects that are promoted just because they are waiting to be finalized are not included in this counter. Memory is promoted when it survives a garbage collection. This counter was designed as an indicator of relatively long-lived objects being created per sec. This counter displays the difference between the values observed in the last two samples divided by the duration of the sample interval. GEN1_PROMOTION_RATE_009_NAME=Gen 1 Promoted Bytes/Sec GEN1_PROMOTION_RATE_009_HELP=This counter displays the bytes per second that are promoted from generation 1 to generation 2 (oldest); objects that are promoted just because they are waiting to be finalized are not included in this counter. Memory is promoted when it survives a garbage collection. Nothing is promoted from generation 2 since it is the oldest. This counter was designed as an indicator of very long-lived objects being created per sec. This counter displays the difference between the values observed in the last two samples divided by the duration of the sample interval. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_009_NAME=Promoted Finalization-Memory from Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_009_HELP=This counter displays the bytes of memory that are promoted from generation 0 to generation 1 just because they are waiting to be finalized. This counter displays the value observed at the end of the last GC; its not a cumulative counter. PROCESS_ID_009_NAME=Process ID PROCESS_ID_009_HELP=This counter displays the process ID of the CLR process instance being monitored. The value displayed will be 0 until after the first garbage collection. GEN0_HEAP_SIZE_COUNTER_009_NAME=Gen 0 heap size GEN0_HEAP_SIZE_COUNTER_009_HELP=This counter displays the maximum bytes that can be allocated in generation 0 (Gen 0); its does not indicate the current number of bytes allocated in Gen 0. A Gen 0 GC is triggered when the allocations since the last GC exceed this size. The Gen 0 size is tuned by the Garbage Collector and can change during the execution of the application. At the end of a Gen 0 collection the size of the Gen 0 heap is infact 0 bytes; this counter displays the size (in bytes) of allocations that would trigger the next Gen 0 GC. This counter is updated at the end of a GC; its not updated on every allocation. GEN1_HEAP_SIZE_COUNTER_009_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_009_HELP=This counter displays the current number of bytes in generation 1 (Gen 1); this counter does not display the maximum size of Gen 1. Objects are not directly allocated in this generation; they are promoted from previous Gen 0 GCs. This counter is updated at the end of a GC; its not updated on every allocation. GEN2_HEAP_SIZE_COUNTER_009_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_009_HELP=This counter displays the current number of bytes in generation 2 (Gen 2). Objects are not directly allocated in this generation; they are promoted from Gen 1 during previous Gen 1 GCs. This counter is updated at the end of a GC; its not updated on every allocation. LARGE_OBJECT_SIZE_COUNTER_009_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_009_HELP=This counter displays the current size of the Large Object Heap in bytes. Objects greater than a threshold are treated as large objects by the Garbage Collector and are directly allocated in a special heap; they are not promoted through the generations. In CLR v1.1 and above this threshold is equal to 85000 bytes. This counter is updated at the end of a GC; it s not updated on every allocation. SURVIVE_FINALIZE_COUNTER_009_NAME=Finalization Survivors SURVIVE_FINALIZE_COUNTER_009_HELP=This counter displays the number of garbage collected objects that survive a collection because they are waiting to be finalized. If these objects hold references to other objects then those objects also survive but are not counted by this counter; the "Promoted Finalization-Memory from Gen 0" and "Promoted Finalization-Memory from Gen 1" counters represent all the memory that survived due to finalization. This counter is not a cumulative counter; its updated at the end of every GC with count of the survivors during that particular GC only. This counter was designed to indicate the extra overhead that the application might incur because of finalization. NUM_HANDLES_COUNTER_009_NAME=# GC Handles NUM_HANDLES_COUNTER_009_HELP=This counter displays the current number of GC Handles in use. GCHandles are handles to resources external to the CLR and the managed environment. Handles occupy small amounts of memory in the GCHeap but potentially expensive unmanaged resources. ALLOCATION_RATE_COUNTER_009_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_009_HELP=This counter displays the rate of bytes per second allocated on the GC Heap. This counter is updated at the end of every GC; not at each allocation. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. INDUCED_GC_COUNTER_009_NAME=# Induced GC INDUCED_GC_COUNTER_009_HELP=This counter displays the peak number of times a garbage collection was performed because of an explicit call to GC.Collect. Its a good practice to let the GC tune the frequency of its collections. PER_TIME_IN_GC_COUNTER_009_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_009_HELP=% Time in GC is the percentage of elapsed time that was spent in performing a garbage collection (GC) since the last GC cycle. This counter is usually an indicator of the work done by the Garbage Collector on behalf of the application to collect and compact memory. This counter is updated only at the end of every GC and the counter value reflects the last observed value; its not an average. PER_TIME_IN_GC_COUNTER_BASE_009_NAME=Not Displayed PER_TIME_IN_GC_COUNTER_BASE_009_HELP=Not Displayed. TOTAL_HEAP_SIZE_COUNTER_009_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_009_HELP=This counter is the sum of four other counters; Gen 0 Heap Size; Gen 1 Heap Size; Gen 2 Heap Size and the Large Object Heap Size. This counter indicates the current memory allocated in bytes on the GC Heaps. TOTAL_COMMITTED_MEM_COUNTER_009_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_009_HELP=This counter displays the amount of virtual memory (in bytes) currently committed by the Garbage Collector. (Committed memory is the physical memory for which space has been reserved on the disk paging file). TOTAL_RESERVED_MEM_COUNTER_009_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_009_HELP=This counter displays the amount of virtual memory (in bytes) currently reserved by the Garbage Collector. (Reserved memory is the virtual memory space reserved for the application but no disk or main memory pages have been used.) GC_PINNED_OBJECTS_009_NAME=# of Pinned Objects GC_PINNED_OBJECTS_009_HELP=This counter displays the number of pinned objects encountered in the last GC. This counter tracks the pinned objects only in the heaps that were garbage collected e.g. a Gen 0 GC would cause enumeration of pinned objects in the generation 0 heap only. A pinned object is one that the Garbage Collector cannot move in memory. GC_SINKBLOCKS_009_NAME=# of Sink Blocks in use GC_SINKBLOCKS_009_HELP=This counter displays the current number of sync blocks in use. Sync blocks are per-object data structures allocated for storing synchronization information. Sync blocks hold weak references to managed objects and need to be scanned by the Garbage Collector. Sync blocks are not limited to storing synchronization information and can also store COM interop metadata. This counter was designed to indicate performance problems with heavy use of synchronization primitives. DotNetCLR_Loading_OBJECT_009_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_009_HELP=Statistics for CLR Class Loader. LOADING_CLASSES_TOTAL_009_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_009_HELP=This counter displays the cumulative number of classes loaded in all Assemblies since the start of this application. LOADING_TIME_009_NAME=% Time Loading LOADING_TIME_009_HELP=Reserved for future use. LOADING_ASMSEARCHLEN_009_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_009_HELP=Reserved for future use. LOADING_LOADFAILURES_TOTAL_009_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_009_HELP=This counter displays the peak number of classes that have failed to load since the start of the application. These load failures could be due to many reasons like inadequate security or illegal format. Full details can be found in the profiling services help. LOADING_LOADFAILURES_INST_009_NAME=Rate of Load Failures LOADING_LOADFAILURES_INST_009_HELP=This counter displays the number of classes that failed to load per second. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. These load failures could be due to many reasons like inadequate security or illegal format. Full details can be found in the profiling services help. LOADING_HEAPSIZE_009_NAME=Bytes in Loader Heap LOADING_HEAPSIZE_009_HELP=This counter displays the current size (in bytes) of the memory committed by the class loader across all AppDomains. (Committed memory is the physical memory for which space has been reserved on the disk paging file.) LOADING_APPDOMAINS_UNLOADED_TOTAL_009_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_009_HELP=This counter displays the total number of AppDomains unloaded since the start of the application. If an AppDomain is loaded and unloaded multiple times this counter would count each of those unloads as separate. LOADING_APPDOMAINS_UNLOADED_INST_009_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_009_HELP=This counter displays the number of AppDomains unloaded per second. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. LOADING_CLASSES_CUR_009_NAME=Current Classes Loaded LOADING_CLASSES_CUR_009_HELP=This counter displays the current number of classes loaded in all Assemblies. LOADING_CLASSES_INST_009_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_009_HELP=This counter displays the number of classes loaded per second in all Assemblies. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. LOADING_APPDOMAINS_CUR_009_NAME=Current appdomains LOADING_APPDOMAINS_CUR_009_HELP=This counter displays the current number of AppDomains loaded in this application. AppDomains (application domains) provide a secure and versatile unit of processing that the CLR can use to provide isolation between applications running in the same process. LOADING_APPDOMAINS_TOTAL_009_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_009_HELP=This counter displays the peak number of AppDomains loaded since the start of this application. AppDomains (application domains) provide a secure and versatile unit of processing that the CLR can use to provide isolation between applications running in the same process. LOADING_APPDOMAINS_INST_009_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_009_HELP=This counter displays the number of AppDomains loaded per second. AppDomains (application domains) provide a secure and versatile unit of processing that the CLR can use to provide isolation between applications running in the same process. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. LOADING_ASSEMBLIES_CUR_009_NAME=Current Assemblies LOADING_ASSEMBLIES_CUR_009_HELP=This counter displays the current number of Assemblies loaded across all AppDomains in this application. If the Assembly is loaded as domain-neutral from multiple AppDomains then this counter is incremented once only. Assemblies can be loaded as domain-neutral when their code can be shared by all AppDomains or they can be loaded as domain-specific when their code is private to the AppDomain. LOADING_ASSEMBLIES_TOTAL_009_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_009_HELP=This counter displays the total number of Assemblies loaded since the start of this application. If the Assembly is loaded as domain-neutral from multiple AppDomains then this counter is incremented once only. Assemblies can be loaded as domain-neutral when their code can be shared by all AppDomains or they can be loaded as domain-specific when their code is private to the AppDomain. LOADING_ASSEMBLIES_INST_009_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_009_HELP=This counter displays the number of Assemblies loaded across all AppDomains per second. If the Assembly is loaded as domain-neutral from multiple AppDomains then this counter is incremented once only. Assemblies can be loaded as domain-neutral when their code can be shared by all AppDomains or they can be loaded as domain-specific when their code is private to the AppDomain. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. DotNetCLR_Jit_OBJECT_009_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_009_HELP=Stats for CLR Jit. TOTAL_METHODS_JITTED_009_NAME=# of Methods Jitted TOTAL_METHODS_JITTED_009_HELP=This counter displays the total number of methods compiled Just-In-Time (JIT) by the CLR JIT compiler since the start of the application. This counter does not include the pre-jitted methods. JITTED_IL_CUR_009_NAME=# of IL Bytes Jitted JITTED_IL_CUR_009_HELP=This counter displays the total IL bytes jitted since the start of the application. This counter is exactly equivalent to the "Total # of IL Bytes Jitted" counter. JITTED_IL_TOTAL_009_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_009_HELP=This counter displays the total IL bytes jitted since the start of the application. This counter is exactly equivalent to the "# of IL Bytes Jitted" counter. JITTED_IL_INST_009_NAME=IL Bytes Jitted / sec JITTED_IL_INST_009_HELP=This counter displays the rate at which IL bytes are jitted per second. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. JIT_FAILURES_009_NAME=Standard Jit Failures JIT_FAILURES_009_HELP=This counter displays the peak number of methods the JIT compiler has failed to JIT since the start of the application. This failure can occur if the IL cannot be verified or if there was an internal error in the JIT compiler. TIME_IN_JIT_009_NAME=% Time in Jit TIME_IN_JIT_009_HELP=This counter displays the percentage of elapsed time spent in JIT compilation since the last JIT compilation phase. This counter is updated at the end of every JIT compilation phase. A JIT compilation phase is the phase when a method and its dependencies are being compiled. TIME_IN_JIT_BASE_009_NAME=Not Displayed TIME_IN_JIT_BASE_009_HELP=Not Displayed. DotNetCLR_Interop_OBJECT_009_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_009_HELP=Stats for CLR interop. CURRENT_CCW_009_NAME=# of CCWs CURRENT_CCW_009_HELP=This counter displays the current number of Com-Callable-Wrappers (CCWs). A CCW is a proxy for the .NET managed object being referenced from unmanaged COM client(s). This counter was designed to indicate the number of managed objects being referenced by unmanaged COM code. CURRENT_STUBS_009_NAME=# of Stubs CURRENT_STUBS_009_HELP=This counter displays the current number of stubs created by the CLR. Stubs are responsible for marshalling arguments and return values from managed to unmanaged code and vice versa; during a COM Interop call or PInvoke call. NUM_MARSHALLING_009_NAME=# of marshalling NUM_MARSHALLING_009_HELP=This counter displays the total number of times arguments and return values have been marshaled from managed to unmanaged code and vice versa since the start of the application. This counter is not incremented if the stubs are inlined. (Stubs are responsible for marshalling arguments and return values). Stubs usually get inlined if the marshalling overhead is small. TOTAL_TLB_IMPORTS_009_NAME=# of TLB imports / sec TOTAL_TLB_IMPORTS_009_HELP=Reserved for future use. TOTAL_TLB_EXPORTS_009_NAME=# of TLB exports / sec TOTAL_TLB_EXPORTS_009_HELP=Reserved for future use. DotNetCLR_LocksAndThreads_OBJECT_009_NAME=.NET CLR LocksAndThreads DotNetCLR_LocksAndThreads_OBJECT_009_HELP=Stats for CLR Locks and Threads. CONTENTION_TOTAL_009_NAME=Total # of Contentions CONTENTION_TOTAL_009_HELP=This counter displays the total number of times threads in the CLR have attempted to acquire a managed lock unsuccessfully. Managed locks can be acquired in many ways; by the "lock" statement in C# or by calling System.Monitor.Enter or by using MethodImplOptions.Synchronized custom attribute. CONTENTION_INST_009_NAME=Contention Rate / sec CONTENTION_INST_009_HELP=Rate at which threads in the runtime attempt to acquire a managed lock unsuccessfully. Managed locks can be acquired in many ways; by the "lock" statement in C# or by calling System.Monitor.Enter or by using MethodImplOptions.Synchronized custom attribute. QUEUE_LENGTH_CUR_009_NAME=Current Queue Length QUEUE_LENGTH_CUR_009_HELP=This counter displays the total number of threads currently waiting to acquire some managed lock in the application. This counter is not an average over time; it displays the last observed value. QUEUE_LENGTH_TOTAL_009_NAME=Queue Length Peak QUEUE_LENGTH_TOTAL_009_HELP=This counter displays the total number of threads that waited to acquire some managed lock since the start of the application. QUEUE_LENGTH_INST_009_NAME=Queue Length / sec QUEUE_LENGTH_INST_009_HELP=This counter displays the number of threads per second waiting to acquire some lock in the application. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. CURRENT_LOGICAL_THREADS_009_NAME=# of current logical Threads CURRENT_LOGICAL_THREADS_009_HELP=This counter displays the number of current .NET thread objects in the application. A .NET thread object is created either by new System.Threading.Thread or when an unmanaged thread enters the managed environment. This counters maintains the count of both running and stopped threads. This counter is not an average over time; it just displays the last observed value. CURRENT_PHYSICAL_THREADS_009_NAME=# of current physical Threads CURRENT_PHYSICAL_THREADS_009_HELP=This counter displays the number of native OS threads created and owned by the CLR to act as underlying threads for .NET thread objects. This counters value does not include the threads used by the CLR in its internal operations; it is a subset of the threads in the OS process. RECOGNIZED_THREADS_CUR_009_NAME=# of current recognized threads RECOGNIZED_THREADS_CUR_009_HELP=This counter displays the number of threads that are currently recognized by the CLR; they have a corresponding .NET thread object associated with them. These threads are not created by the CLR; they are created outside the CLR but have since run inside the CLR at least once. Only unique threads are tracked; threads with same thread ID re-entering the CLR or recreated after thread exit are not counted twice. RECOGNIZED_THREADS_TOTAL_009_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_009_HELP=This counter displays the total number of threads that have been recognized by the CLR since the start of this application; these threads have a corresponding .NET thread object associated with them. These threads are not created by the CLR; they are created outside the CLR but have since run inside the CLR at least once. Only unique threads are tracked; threads with same thread ID re-entering the CLR or recreated after thread exit are not counted twice. RECOGNIZED_THREADS_INST_009_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_009_HELP=This counter displays the number of threads per second that have been recognized by the CLR; these threads have a corresponding .NET thread object associated with them. These threads are not created by the CLR; they are created outside the CLR but have since run inside the CLR at least once. Only unique threads are tracked; threads with same thread ID re-entering the CLR or recreated after thread exit are not counted twice. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. DotNetCLR_Security_OBJECT_009_NAME=.NET CLR Security DotNetCLR_Security_OBJECT_009_HELP=Stats for CLR Security. SECURITY_TOTALRTCHECKS_009_NAME=Total Runtime Checks SECURITY_TOTALRTCHECKS_009_HELP=This counter displays the total number of runtime Code Access Security (CAS) checks performed since the start of the application. Runtime CAS checks are performed when a caller makes a call to a callee demanding a particular permission; the runtime check is made on every call by the caller; the check is done by examining the current thread stack of the caller. This counter used together with "Stack Walk Depth" is indicative of performance penalty for security checks. SECURITY_TIMEAUTHORIZE_009_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_009_HELP=Reserved for future use. SECURITY_LINKCHECKS_009_NAME=# Link Time Checks SECURITY_LINKCHECKS_009_HELP=This counter displays the total number of linktime Code Access Security (CAS) checks since the start of the application. Linktime CAS checks are performed when a caller makes a call to a callee demanding a particular permission at JIT compile time; linktime check is performed once per caller. This count is not indicative of serious performance issues; its indicative of the security system activity. SECURITY_TIMERTCHECKS_009_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_009_HELP=This counter displays the percentage of elapsed time spent in performing runtime Code Access Security (CAS) checks since the last such check. CAS allows code to be trusted to varying degrees and enforces these varying levels of trust depending on code identity. This counter is updated at the end of a runtime security check; it represents the last observed value; its not an average. SECURITY_TIMERTCHECKS_BASE_009_NAME=Not Displayed SECURITY_TIMERTCHECKS_BASE_009_HELP=Not Displayed. SECURITY_DEPTHSECURITY_009_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_009_HELP=This counter displays the depth of the stack during that last runtime Code Access Security check. Runtime Code Access Security check is performed by crawling the stack. This counter is not an average; it just displays the last observed value. DotNetCLR_Remoting_OBJECT_009_NAME=.NET CLR Remoting DotNetCLR_Remoting_OBJECT_009_HELP=Stats for CLR Remoting. CONTEXT_REMOTECALLS_INST_009_NAME=Remote Calls/sec CONTEXT_REMOTECALLS_INST_009_HELP=This counter displays the number of remote procedure calls invoked per second. A remote procedure call is a call on any object outside the caller;s AppDomain. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. CONTEXT_CHANNELS_009_NAME=Channels CONTEXT_CHANNELS_009_HELP=This counter displays the total number of remoting channels registered across all AppDomains since the start of the application. Channels are used to transport messages to and from remote objects. CONTEXT_PROXIES_009_NAME=Context Proxies CONTEXT_PROXIES_009_HELP=This counter displays the total number of remoting proxy objects created in this process since the start of the process. Proxy object acts as a representative of the remote objects and ensures that all calls made on the proxy are forwarded to the correct remote object instance. CONTEXT_CLASSES_009_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_009_HELP=This counter displays the current number of context-bound classes loaded. Classes that can be bound to a context are called context-bound classes; context-bound classes are marked with Context Attributes which provide usage rules for synchronization; thread affinity; transactions etc. CONTEXT_OBJALLOC_009_NAME=Context-Bound Objects Alloc / sec CONTEXT_OBJALLOC_009_HELP=This counter displays the number of context-bound objects allocated per second. Instances of classes that can be bound to a context are called context-bound objects; context-bound classes are marked with Context Attributes which provide usage rules for synchronization; thread affinity; transactions etc. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. CONTEXT_CONTEXTS_009_NAME=Contexts CONTEXT_CONTEXTS_009_HELP=This counter displays the current number of remoting contexts in the application. A context is a boundary containing a collection of objects with the same usage rules like synchronization; thread affinity; transactions etc. CONTEXT_REMOTECALLS_TOTAL_009_NAME=Total Remote Calls CONTEXT_REMOTECALLS_TOTAL_009_HELP=This counter displays the total number of remote procedure calls invoked since the start of this application. A remote procedure call is a call on any object outside the caller;s AppDomain. DotNetCLR_Excep_OBJECT_009_NAME=.NET CLR Exceptions DotNetCLR_Excep_OBJECT_009_HELP=Runtime statistics on CLR exception handling. EXCEP_THROWN_TOTAL_009_NAME=# of Exceps Thrown EXCEP_THROWN_TOTAL_009_HELP=This counter displays the total number of exceptions thrown since the start of the application. These include both .NET exceptions and unmanaged exceptions that get converted into .NET exceptions e.g. null pointer reference exception in unmanaged code would get re-thrown in managed code as a .NET System.NullReferenceException; this counter includes both handled and unhandled exceptions. Exceptions that are re-thrown would get counted again. Exceptions should only occur in rare situations and not in the normal control flow of the program. EXCEP_THROWN_INST_009_NAME=# of Exceps Thrown / sec EXCEP_THROWN_INST_009_HELP=This counter displays the number of exceptions thrown per second. These include both .NET exceptions and unmanaged exceptions that get converted into .NET exceptions e.g. null pointer reference exception in unmanaged code would get re-thrown in managed code as a .NET System.NullReferenceException; this counter includes both handled and unhandled exceptions. Exceptions should only occur in rare situations and not in the normal control flow of the program; this counter was designed as an indicator of potential performance problems due to large (>100s) rate of exceptions thrown. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. TOTAL_EXCEP_FILTERS_RUN_009_NAME=# of Filters / sec TOTAL_EXCEP_FILTERS_RUN_009_HELP=This counter displays the number of .NET exception filters executed per second. An exception filter evaluates whether an exception should be handled or not. This counter tracks the rate of exception filters evaluated; irrespective of whether the exception was handled or not. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. TOTAL_EXCEP_FINALLYS_RUN_009_NAME=# of Finallys / sec TOTAL_EXCEP_FINALLYS_RUN_009_HELP=This counter displays the number of finally blocks executed per second. A finally block is guaranteed to be executed regardless of how the try block was exited. Only the finally blocks that are executed for an exception are counted; finally blocks on normal code paths are not counted by this counter. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. EXCEPT_STACK_DEPTH_009_NAME=Throw To Catch Depth / sec EXCEPT_STACK_DEPTH_009_HELP=This counter displays the number of stack frames traversed from the frame that threw the .NET exception to the frame that handled the exception per second. This counter resets to 0 when an exception handler is entered; so nested exceptions would show the handler to handler stack depth. This counter is not an average over time; it displays the difference between the values observed in the last two samples divided by the duration of the sample interval. DotNetCLR_Memory_OBJECT_001_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_001_HELP=9/Q'/'* DCHE) 'D(J'F'* 'DEGED) 'D*J *E ,E9G' D@ CLR. GEN0_COLLECTIONS_COUNTER_001_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_001_HELP=J916 G0' 'D9/Q'/ 9// E1'* ,E9 'D(J'F'* 'DEGED) DC'&F'* 'D,JD 0 (Gen 0 GC) (#-/+ 'DC'&F'* #-/+ C'&F'* *E *.5J5G') EF0 (/! *4:JD 'D*7(JB. *-/+ 9EDJ) *,EJ9 'D(J'F'* 'DEGED) DC'&F'* 'D,JD 0 9F/E' D' *CHF 'D0'C1) 'DE*HA1) AJ 'D,JD 0 C'AJ) D*D(J) #-/ 7D('* 'D*.5J5. HJ*E 2J'/) G0' 'D9/'/ AJ FG'J) G0G 'D9EDJ). H**6EF 'D(J'F'* 'DEGED) 'D*J *E ,E9G' (GC) DC'&F'* 'D,JD 'D#-/+ ,EJ9 'D(J'F'* 'DEGED) 'D*J *E ,E9G' D,EJ9 C'&F'* 'D,JD 'D#B/E. HJ*E 2J'/) G0' 'D9/Q'/ (H6H- 9F/E' *-/+ 9EDJ) *,EJ9 (J'F'* EGED) D,JD #9DI ('D,JD 1 #H 'D,JD 2). BJE) _Global_ counter :J1 /BJB) HJ,( %GE'DG'. J916 G0' 'D9/'/ ".1 BJE) *E* ED'-8*G'. GEN1_COLLECTIONS_COUNTER_001_NAME=# Gen 1 Collections GEN1_COLLECTIONS_COUNTER_001_HELP=J916 G0' 'D9/Q'/ 9// E1'* ,E9 'D(J'F'* 'DEGED) DC'&F'* 'D,JD 1 EF0 (/! *4:JD 'D*7(JB. HJ*E 2J'/) G0' 'D9/'/ AJ FG'J) 9EDJ) ,E9 'D(J'F'* 'DEGED) DC'&F'* 'D,JD 1 (Gen 1 GC). H**6EF 'D(J'F'* 'DEGED) 'D*J *E ,E9G' (GC) DC'&F'* 'D,JD 'D#-/+ ,EJ9 'D(J'F'* 'DEGED) 'D*J *E ,E9G' DC'&F'* 'D,JD 'D#B/E. HJ*E 2J'/) G0' 'D9/'/ (4CD 51J- 9F/E' *-/+ 9EDJ) ,E9 (J'F'* EGED) D,JD #9DI ('D,JD 2). BJE) _Global_ counter :J1 /BJB) HJ,( %GE'DG'. J916 G0' 'D9/'/ ".1 BJE) *E* ED'-8*G'. GEN2_COLLECTIONS_COUNTER_001_NAME=# Gen 2 Collections GEN2_COLLECTIONS_COUNTER_001_HELP=J916 G0' 'D9/Q'/ 9// 'DE1'* 'D*J J*E AJG' *,EJ9 'D(J'F'* 'DEGED) DC'&F'* 'DA&) 2 ('D#B/E) EF0 (/! 'D*7(JB. J*2'J/ G0' 'D9/'/ AJ FG'J) Gen 2 GC (JO7DB 9DJG' #J6K' GC 'DC'ED). %F BJE) 'D9/'/ _Global_ :J1 /BJB) HJ,( *,'GDG'. J916 G0' 'D9/'/ ".1 BJE) *E* ED'-8*G'. GEN0_BYTES_PROMOTED_COUNTER_001_NAME=Promoted Memory from Gen 0 GEN0_BYTES_PROMOTED_COUNTER_001_HELP=J916 G0' 'D9/'/ H-/'* ('J* 'D0'C1) 'D*J *(B* (9/ *,EJ9 'D(J'F'* 'DEGED) (GC) H'D*J *E* *1BJ*G' EF 'D,JD 0 %DI 'D,JD 1. 'DC'&F'* 'D*J *E* *1BJ*G' AB7 D#FG JOF*81 %FG'$G' DE J*E *6EJFG' AJ G0' 'D9/'/. J916 G0' 'D9/'/ 'DBJE) 'D*J *E* ED'-8*G' AJ FG'J) ".1 9EDJ) GC AGH DJ3 9/'/K' *1'CEJK'. GEN1_BYTES_PROMOTED_COUNTER_001_NAME=Promoted Memory from Gen 1 GEN1_BYTES_PROMOTED_COUNTER_001_HELP=J916 G0' 'D9/Q'/ H-/'* ('J* 'D0'C1) 'D*J *(B* (9/ *,EJ9 'D(J'F'* 'DEGED) (GC) H'D*J *E* *1BJ*G' EF 'D,JD 1 %DI 'D,JD 2 #E' 'DC'&F'* 'D*J *E* *1BJ*G' AB7 DCHFG' JOF*81 %FG'$G' DE J*E *6EJFG' AJ G0' 'D9/'/. J916 G0' 'D9/'/ 'DBJE) 'D*J *,1J ED'-8*G' AJ FG'J) ".1 9EDJ) GC AGH DJ3 9/'/K' *1'CEJK'. J*E %9'/) *9JJF G0' 'D9/'/ %DI 0 %0' C'F* ".1 9EDJ) GC B/ *E* 9DI 'D,JD 0 AB7. GEN0_PROMOTION_RATE_001_NAME=Gen 0 Promoted Bytes/Sec GEN0_PROMOTION_RATE_001_HELP=J916 G0' 'D9/'/ 9// H-/'* 'D('J* 'D*J *E* *1BJ*G' AJ 'D+'FJ) EF 'D,JD 0 ('D#-/+) %DI 'D,JD 1 #E' 'DC'&F'* 'D*J *E* *1BJ*G' AB7 DCHFG' JOF*81 %FG'$G' ADE J*E *6EJFG' AJ G0' 'D9/'/. J*E *1BJ) 'D0'C1) %0' *(B* (9/ %-/I 9EDJ'* *,EJ9 'D(J'F'* 'DEGED). *E *5EJE G0' 'D9/'/ CE$41 9DI 'DC'&F'* 0'* 'D9E1 'D7HJD F3(JK' 'D*J J*E %F4'$G' AJ 'D+'FJ). HJ916 G0' 'D9/'/ 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). GEN1_PROMOTION_RATE_001_NAME=Gen 1 Promoted Bytes/Sec GEN1_PROMOTION_RATE_001_HELP=J916 G0' 'D9/'/ 9// H-/'* 'D('J* 'D*J *E* *1BJ*G' AJ 'D+'FJ) EF 'D,JD 1 %DI 'D,JD 2 ('D#B/E) DE J*E *6EJF 'DC'&F'* 'D*J *E* *1BJ*G' AB7 D#FG JOF*81 %FG'$G' AJ G0' 'D9/'/. J*E *1BJ) 'D0'C1) %0' *(B* (9/ %-/I 9EDJ'* ,E9 'D(J'F'* 'DEGED). DE J*E *1BJ) #J) C'&F'* EF 'D,JD 2 D#FG GH #B/E ,JD. B/ *E *5EJE G0' 'D9/'/ CE$41 9DI 'DC'&F'* 0'* 'D9E1 'D7HJD DD:'J) 'D*J J*E %F4'$G' AJ 'D+'FJ). J916 G0' 'D9/'/ 'DA1B (JF 'DBJE 'DEH,H/) AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_001_NAME=Promoted Finalization-Memory from Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_001_HELP=J916 G0' 'D9/'/ 9// H-/'* ('J* 'D0'C1) 'D*J *E* *1BJ*G' EF 'D,JD 0 %DI 'D,JD 1 AB7 D#FG JOF*81 %FG'$G'. J916 G0' 'D9/'/ 'DBJE) 'D*J *,1J ED'-8*G' AJ FG'J) ".1 9EDJ) GC AGH DJ3 9/'/K' *1'CEJK'. PROCESS_ID_001_NAME=Process ID PROCESS_ID_001_HELP=J916 G0' 'D9/'/ E91QA 'D9EDJ) 'D.'5 (E+JD 9EDJ) CLR 'D,'1J E1'B(*G. 3*CHF 'DBJE) 'DE91H6) 0 -*I #HD E,EH9) (J'F'* EGED). GEN0_HEAP_SIZE_COUNTER_001_NAME=Gen 0 heap size GEN0_HEAP_SIZE_COUNTER_001_HELP=J916 G0' 'D9/'/ #B5I 9// EF H-/'* 'D('J* JECF *.5J5G' AJ 'D,JD 0 (Gen 0) HGH D' J4J1 %DI 'D9// 'D-'DJ EF H-/'* 'D('J* 'DE.55) AJ 'D,JD 0. J*E *4:JD 9EDJ) *,EJ9 'D(J'F'* 'DEGED) DD,JD 0 9F/E' *2J/ 9EDJ'* 'D*.5J5 'D*J *E* EF0 ".1 9EDJ) *,EJ9 (J'F'* EGED) 9F -,E G0' 'D,JD. J*E 6(7 -,E 'D,JD 0 9F 71JB ,'E9 'D(J'F'* 'DEGED) CE' JECF #F J*:J1 #+F'! *FAJ0 'D*7(JB. HAJ FG'J) 9EDJ) ,E9 'D(J'F'* 'DEGED) DD,JD 0 J5(- -,E CHE) 'D,JD 0 AJ 'DH'B9 0 ('J* J916 G0' 'D9/'/ -,E 9EDJ'* 'D*.5J5 (('D('J*) 'D*J *9ED 9DI *4:JD 9EDJ) ,E9 'D(J'F'* 'DEGED) 'D*'DJ) DD,JD 0 ( Gen 0 GC). J*E *-/J+ G0' 'D9/'/ AJ FG'J) 9EDJ) ,E9 'D(J'F'* 'DEGED) HD' J*E *-/J+G 9F/ CD *.5J5. GEN1_HEAP_SIZE_COUNTER_001_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ EF H-/'* 'D('J* AJ 'D,JD 1 (Gen 1) D' J916 G0' 'D9/'/ #B5I -,E DD,JD 1. D' J*E *.5J5 'DC'&F'* E('41) AJ G0' 'D,JD HDCF J*E *1BJ*G' EF 9EDJ'* ,E9 'D(J'F'* 'DEGED) DD,JD 0 (Gen 0 GC) 'D3'(B). J*E *-/J+ G0' 'D9/'/ AJ FG'J) GC HD' J*E *-/J+G 9F/ CD 9EDJ) *.5J5. GEN2_HEAP_SIZE_COUNTER_001_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ EF H-/'* 'D('J* AJ 'D,JD 2 (Gen 2). D' J*E *.5J5 'DC'&F'* E('41) AJ G0' 'D,JD HDCF J*E *1BJ*G' EF 'D,JD 1 .D'D 9EDJ'* ,E9 'D(J'F'* 'DEGED) 'D3'(B) DD,JD 1 (Gen 1 GC). J*E *-/J+ G0' 'D9/'/ AJ FG'J) 9EDJ'* ,E9 'D(J'F'* 'DEGED) HD' J*E *-/J+G 9F/ CD 9EDJ) *.5J5. LARGE_OBJECT_SIZE_COUNTER_001_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_001_HELP=  J916 G0' 'D9/'/ 'D-,E 'D-'DJ DCHE) 'DC'&F'* 'DC(J1) (H-/'* 'D('J*. H**E E9'ED) 'DC'&F'* 'D*J J2J/ -,EG' 9F 'D-/ 'DEH6- 9DI #FG' C'&F'* C(J1) EF BP(D ,'E9 'D(J'F'* 'DEGED) HJ*E *.5J5G' E('41) AJ CHE) .'5)  HD' **E *1BJ*G' .D'D 'D#,J'D. AJ CLR v1.1 H'D%5/'1'* 'D#-/+  J3'HJ G0' 'D-/ 85000 ('J*. HJ*E *-/J+ G0' 'D9/'/ AJ FG'J) 9EDJ'* ,E9 'D(J'F'* 'DEGED) HD' J*E *-/J+G 9F/ CD 9EDJ) *.5J5. SURVIVE_FINALIZE_COUNTER_001_NAME=Finalization Survivors SURVIVE_FINALIZE_COUNTER_001_HELP=J916 G0' 'D9/'/ 9// 'DC'&F'* 'DE*(BJ) (9/ *,EJ9 'D(J'F'* 'DEGED) DG' D#FG JOF*81 %FG'$G'. %0' C'F* G0G 'DC'&F'* *-*A8 (E1',9 %DI C'&F'* #.1I  A-JF&0 3*(BI G0G 'DC'&F'* #J6K' DCF DF J*E 9/QG' (H'37) G0' 'D9/'/ HJE+D 9/'/' " 0'C1) 'D%FG'! 'D*J *E *1BJ*G' EF 'D,JD 0" H" 0'C1) 'D%FG'! 'D*J *E *1BJ*G' EF 'D,JD 1" 'D0'C1) 'DCDJ) 'D*J *(B* F*J,) DD%FG'!. HG0' 'D9/'/ DJ3 9/'/K' *1'CEJK' HDCF J*E *-/J+G AJ FG'J) CD 9EDJ) *,EJ9 (J'F'* EGED) (9// 'DC'&F'* 'DE*(BJ) AB7 .D'D 9EDJ) GC 'D.'5) G0G *-/J/K'. *E *5EJE G0' 'D9/'/ DD%4'1) %DI EB/'1 'D-ED 'D%6'AJ 'D0J B/ JB9 9DI 'D(1F'E, F*J,) 'D%FG'!. NUM_HANDLES_COUNTER_001_NAME=# GC Handles NUM_HANDLES_COUNTER_001_HELP=J916 G0' 'D9/'/ 9// E9'D,'* GC 'DE3*./E) -'DJK'. *O9/ GCHandles E9'D,'* DEH'1/ .'1, CLR H'D(J&) 'DEO/'1). *4:D 'DE9'D,'* E3'-'* 5:J1) EF 'D0'C1) AJ GCHeap HDCF G0G 'DE3'-'* *E+D EH'1/ :J1 EO/'1) EF 'DE-*ED '1*A'9 *CDA*G'. ALLOCATION_RATE_COUNTER_001_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_001_HELP=J916 G0' 'D9/'/ E9/D H-/'* 'D('J* 'D*J J*E *.5J5G' AJ 'D+'FJ) AJ CHE) GC. J*E *-/J+ G0' 'D9/'/ AJ FG'J) CD GC HDJ3 9F/ CD 9EDJ) *.5J5. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). INDUCED_GC_COUNTER_001_NAME=# Induced GC INDUCED_GC_COUNTER_001_HELP=J916 G0' 'D9/'/ #B5I 9// EF 'DE1'* **E AJG' 9EDJ) ,E9 'D(J'F'* 'DEGED) (3(( '3*/9'! H'6- D@ GC.Collect. JA6D 'D3E'- D@ GC (6(7 *1// 9EDJ'* *,EJ9G'. PER_TIME_IN_GC_COUNTER_001_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_001_HELP=% HB* ,E9 'D(J'F'* 'DEGED) GH F3() 'DHB* 'DEFB6J AJ %,1'! 9EDJ) ,E9 (J'F'* EGED) (GC) EF0 ".1 /H1) ,E9 (J'F'* EGED). HJ9/ G0' 'D9/'/ 9'/) E$41K' 9DI 'D9ED 'D0J *E %,1'$G (H'37) ",'E9 'D(J'F'* 'DEGED)" FJ'() 9F 'D*7(JB D,E9 'D0'C1) H6:7G'. J*E *-/J+ G0' 'D9/'/ AJ FG'J) CD 9EDJ) ,E9 (J'F'* EGED) H*9C3 BJE) 'D9/'/ ".1 BJE) *E* ED'-8*G' HGJ DJ3* BJE) 'DE*H37. PER_TIME_IN_GC_COUNTER_BASE_001_NAME=Not Displayed PER_TIME_IN_GC_COUNTER_BASE_001_HELP=:J1 E91H6. TOTAL_HEAP_SIZE_COUNTER_001_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_001_HELP=G0' 'D9/'/ GH E,EH9 'D9/'/'* 'D#1(9) 'D#.1I HGH -,E CHE) 'D,JD 0 H-,E CHE) 'D,JD 1 H-,E CHE) 'D,JD 2 H-,E CHE) 'DC'&F'* 'DC(J1). HJ4J1 G0' 'D9/'/ %DI 'D0'C1) 'D-'DJ) 'DE.55) ('D('J* AJ CHE'* GC. TOTAL_COMMITTED_MEM_COUNTER_001_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_001_HELP=J916 G0' 'D9/'/ E3'-) 'D0'C1) 'D8'G1J) (('D('J*) 'DE-,H2) -'DJK' EF BP(D ",'E9 'D(J'F'* 'DEGED)". ('D0'C1) 'DE-,H2) GJ 0'C1) A9DJ) *E -,2 E3'-) DG' 9DI EDA 'D*1-JD 9DI 'DB15). TOTAL_RESERVED_MEM_COUNTER_001_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_001_HELP=J916 G0' 'D9/'/ E3'-) 'D0'C1) 'D8'G1J) (('D('J*) 'DE-,H2) -'DJK' EF BP(D " ,'E9 'D(J'F'* 'DEGED)". ('D0'C1) 'DE-,H2) GJ E3'-) 'D0'C1) 'D8'G1J) 'DE-,H2) DD*7(JB /HF '3*./'E #J) 5A-'* .'5) ('DB15 #H 'D0'C1) 'D1&J3J)). GC_PINNED_OBJECTS_001_NAME=# of Pinned Objects GC_PINNED_OBJECTS_001_HELP=J916 G0' 'D9/'/ 9// 'DC'&F'* 'DE+(*) 'D*J *E* E5'/A*G' AJ ".1 9EDJ) ,E9 (J'F'* EGED). J*9B( G0' 'D9/'/ 'DC'&F'* 'DE+(*) AB7 AJ 'DCHE'* 'D*J *E ,E9 (J'F'* EGED) EFG' 9DI 3(JD 'DE+'D  3HA **3(( 9EDJ) ,E9 'D(J'F'* 'DEGED) DD,JD 0 (Gen 0 GC) AJ *9/'/ 'DC'&F'* 'DE+(*) AJ CHE) 'D,JD 0 AB7. H'DC'&F 'DE+(* GH 'DC'&F 'D0J D' J3*7J9 ",'E9 'D(J'F'* 'DEGED)" *-1JCG AJ 'D0'C1). GC_SINKBLOCKS_001_NAME=# of Sink Blocks in use GC_SINKBLOCKS_001_HELP=J916 G0' 'D9/'/ 9// C*D 'DE2'EF) 'DE3*./E) -'DJK'. HC*D 'DE2'EF) GJ (FJ'* (J'F'* DCD C'&F E.55) D*.2JF E9DHE'* 'DE2'EF). *-*A8 C*D 'DE2'EF) (E1',9 69JA) DDC'&F'* 'DEO/'1) HJ,( A-5G' (H'37) ",'E9 'D(J'F'* 'DEGED)". D' JB*51 9ED C*D 'DE2'EF) 9DI *.2JF E9DHE'* 'DE2'EF) (D HJECFG' #J6K' *.2JF (J'F'* *91JA COM interop. *E *5EJE G0' 'D9/'/ DD%4'1) %DI E4'CD 'D#/'! 9F/ 'D'3*./'E 'DE*2'J/ D%14'/'* 'DE2'EF) 'D#HDJ). DotNetCLR_Loading_OBJECT_001_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_001_HELP=%-5'&J'* EO-EQD A&'* CLR. LOADING_CLASSES_TOTAL_001_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_001_HELP=J916 G0' 'D9/'/ 'D9// 'D*1'CEJ DDA&'* 'D*J *E *-EJDG' AJ C'A) "'D*,EJ9'*" EF0 (/! *4:JD 'D*7(JB. LOADING_TIME_001_NAME=% Time Loading LOADING_TIME_001_HELP=E-,H2 DD'3*./'E AJ 'DE3*B(D. LOADING_ASMSEARCHLEN_001_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_001_HELP=E-,H2 DD'3*./'E AJ 'DE3*B(D. LOADING_LOADFAILURES_TOTAL_001_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_001_HELP=J916 G0' 'D9/'/ #B5I 9// DDA&'* 'D*J A4D *-EJDG' EF0 (/! *4:JD 'D*7(JB. B/ *1,9 E1'* A4D 'D*-EJD G0G D9/) EF 'D#3('( C#F JCHF 'D#E'F :J1 C'AM #H #F 'D*F3JB :J1 B'FHFJ. *H,/ *A'5JD C'ED) AJ *9DJE'* ./E'* %F4'! EDA 'D*91JA. LOADING_LOADFAILURES_INST_001_NAME=Rate of Load Failures LOADING_LOADFAILURES_INST_001_HELP=J916 G0' 'D9/'/ 9// 'DA&'* 'D*J A4D *-EJDG' AJ 'D+'FJ). HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). B/ *1,9 E1'* A4D 'D*-EJD G0G D9/) #3('( C#F JCHF 'D#E'F :J1 C'AM #H #F 'D*F3JB :J1 B'FHFJ. *H,/ *A'5JD C'ED) AJ *9DJE'* ./E'* %F4'! EDA 'D*91JA. LOADING_HEAPSIZE_001_NAME=Bytes in Loader Heap LOADING_HEAPSIZE_001_HELP=J916 G0' 'D9/'/ 'D-,E 'D-'DJ DD0'C1) (('D('J*) 'DE-,H2) EF BP(D EO-EQD 'DA&'* 9(1 C'A) E,'D'* AppDomain. ('D0'C1) 'DE-,H2) GJ 0'C1) A9DJ) *E -,2 E3'-) DG' 9DI EDA 'D*1-JD 9DI 'DB15.) LOADING_APPDOMAINS_UNLOADED_TOTAL_001_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// E,'D'* AppDomain 'D*J *E %D:'! *-EJDG' EF0 (/! *4:JD 'D*7(JB. %0' *E *-EJD AppDomain H%D:'! *-EJDG 9/) E1'*  A3JBHE G0' 'D9/'/ (9/Q CD 9EDJ) EF 9EDJ'* %D:'! 'D*-EJD G0G (4CD EFA5D. LOADING_APPDOMAINS_UNLOADED_INST_001_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_001_HELP=J916 G0' 'D9/'/ 9// E,'D'* AppDomain 'D*J *E %D:'! *-EJDG' AJ 'D+'FJ). HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). LOADING_CLASSES_CUR_001_NAME=Current Classes Loaded LOADING_CLASSES_CUR_001_HELP=G0' 'D9/'/ J916 'D9// 'D-'DJ EF 'DA&'* 'DEO-EQD) AJ C'A) "'D*,EJ9'*". LOADING_CLASSES_INST_001_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_001_HELP=J916 G0' 'D9/'/ 9// 'DA&'* 'D*J J*E *-EJDG' AJ 'D+'FJ) AJ C'A) "'D*,EJ9'*". HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* 9(1 'DHB* (D GH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). LOADING_APPDOMAINS_CUR_001_NAME=Current appdomains LOADING_APPDOMAINS_CUR_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ EF E,'D'* AppDomain 'D*J *E *-EJDG' AJ G0' 'D*7(JB. H*HA1 AppDomains (E,'D'* 'D*7(JB'*) H-/) E9'D,) "EF) E*9//) 'D'3*./'E (%EC'F CLR '3*./'EG' DD92D (JF 'D*7(JB'* 'D*J J*E *4:JDG' AJ FA3 'D9EDJ). LOADING_APPDOMAINS_TOTAL_001_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_001_HELP=J916 G0' 'D9/'/ #B5I 9// EF E,'D'* 'D*7(JB'* (AppDomain) 'D*J *E *-EJDG' EF0 (/! *4:JD G0' 'D*7(JB. H*HA1 E,'D'* 'D*7(JB'* H-/) E9'D,) "EF) E*9//) 'D'3*./'E (%EC'F CLR '3*./'EG' DD92D (JF 'D*7(JB'* 'D*J J*E *4:JDG' AJ FA3 'D9EDJ). LOADING_APPDOMAINS_INST_001_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_001_HELP=J916 G0' 'D9/'/ 9// E,'D'* 'D*7(JB'* (AppDomain) 'D*J J*E *-EJDG' AJ 'D+'FJ). H*HA1 E,'D'* 'D*7(JB'* H-/) E9'D,) "EF) E*9//) 'D'3*./'E (%EC'F CLR '3*./'EG' DD92D (JF 'D*7(JB'* 'D*J J*E *4:JDG' AJ FA3 'D9EDJ). HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* 9(1 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). LOADING_ASSEMBLIES_CUR_001_NAME=Current Assemblies LOADING_ASSEMBLIES_CUR_001_HELP=J916 G0' 'D9/'/ 9// "'D*,EJ9'*" 'D-'DJ H'D*J *E *-EJDG' 9(1 C'A) E,'D'* 'D*7(JB'* (AppDomain) AJ G0' 'D*7(JB. %0' *E *-EJD "'D*,EJ9" (-J+ JCHF -J'/J 'DE,'D EF E,'D'* *7(JB'* E*9//)  A3HA J2/'/ G0' 'D9/'/ E1) H'-/) AB7. JECF *-EJD "'D*,EJ9'*" (-J+ *CHF -J'/J) 'DE,'D 9F/E' JCHF EF 'DEECF E4'1C) *9DJE'*G' 'D(1E,J) (H'37) C'A) E,'D'* 'D*7(JB'*  #H 9F/E' JECF *-EJDG' (-J+ *CHF .'5) (E,'D E-// 9F/E' *CHF *9DJE'*G' 'D(1E,J) .'5) (E,'D *7(JB. LOADING_ASSEMBLIES_TOTAL_001_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_001_HELP=J916 G0' 'D9/'/ 9// "'D*,EJ9'*" 'D%,E'DJ 'D*J *E *-EJDG' EF0 (/! *4:JD G0' 'D*7(JB. %0' *E *-EJD "'D*,EJ9" (-J+ JCHF -J'/J 'DE,'D EF E,'D'* *7(JB'* E*9//)  A3J2/'/ G0' 'D9/'/ E1) H'-/) AB7. JECF *-EJD "'D*,EJ9'*" (-J+ *CHF -J'/J) 'DE,'D 9F/E' JCHF EF 'DEECF E4'1C) *9DJE'*G' 'D(1E,J) (H'37) C'A) E,'D'* 'D*7(JB'*  #H JECF *-EJDG' (-J+ *CHF .'5) (E,'D E-// 9F/E' *CHF *9DJE'*G' 'D(1E,J) .'5) (E,'D *7(JB. LOADING_ASSEMBLIES_INST_001_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_001_HELP=J916 G0' 'D9/'/ 9// "'D*,EJ9'*" 'D*J J*E *-EJDG' 9(1 C'A) E,'D'* 'D*7(JB'* (AppDomain) AJ 'D+'FJ). %0' *E *-EJD "'D*,EJ9" (-J+ JCHF -J'/J 'DE,'D EF 'D9/J/ EF E,'D'* 'D*7(JB'*  A3J2/'/ G0' 'D9/'/ E1) H'-/) AB7. JECF *-EJD "'D*,EJ9'*" (-J+ *CHF -J'/J) 'DE,'D 9F/E' JCHF EF 'DEECF E4'1C) *9DJE'*G' 'D(1E,J) (H'37) C'A) E,'D'* 'D*7(JB'*  #H JECF *-EJDG' (-J+ *CHF .'5) (E,'D E-// 9F/E' *CHF *9DJE'*G' 'D(1E,J) .'5) (E,'D 'D*7(JB. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* 9(1 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). DotNetCLR_Jit_OBJECT_001_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_001_HELP=%-5'&J'* D@ CLR Jit. TOTAL_METHODS_JITTED_001_NAME=# of Methods Jitted TOTAL_METHODS_JITTED_001_HELP=G0' 'D9/'/ J916 'D9// 'DCDJ DD#3'DJ( 'D*J *E *-HJDG' (1E,JK' 9DI 'DAH1 (JIT) (H'37) 'DE-HD 'D(1E,J CLR JIT EF0 (/! *4:JD 'D*7(JB. D' J*6EF G0' 'D9/'/ 'D#3'DJ( 'D*J *E *-HJDG' %DI %14'/'* D:) 'D"D) 3'(BK'. JITTED_IL_CUR_001_NAME=# of IL Bytes Jitted JITTED_IL_CUR_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// H-/'* ('J* IL 'D*J *E *-HJDG' %DI %14'/'* D:) 'D"D) EF0 (/! *4:JD 'D*7(JB. G0' 'D9/'/ EC'A& *E'EK' D9/'/ "%,E'DJ 9// H-/'* 'D('J* D@ IL 'D*J *E *-HJDG' %DI %14'/'* D:) 'D"D)". JITTED_IL_TOTAL_001_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// H-/'* ('J* IL 'D*J *E *-HJDG' %DI %14'/'* D:) 'D"D) EF0 (/! *4:JD 'D*7(JB. G0' 'D9/'/ EC'A& *E'EK' D9/'/ "9// H-/'* 'D('J* D@ IL 'D*J *E *-HJDG' %DI %14'/'* D:) 'D"D)". JITTED_IL_INST_001_NAME=IL Bytes Jitted / sec JITTED_IL_INST_001_HELP=J916 G0' 'D9/'/ 'DE9/D 'D0J J*E (G *-HJD H-/'* 'D('J* D@ IL %DI %14'/'* D:) 'D"D) AJ 'D+'FJ). HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). JIT_FAILURES_001_NAME=Standard Jit Failures JIT_FAILURES_001_HELP=J916 G0' 'D9/'/ #B5I 9// DD#3'DJ( 'D*J A4D 'DE-HD 'D(1E,J JIT AJ *-HJDG' %DI %14'/'* D:) 'D"D) EF0 (/! *4:JD 'D*7(JB. JECF #F J-/+ G0' 'DA4D %0' *901 'D*-BB EF IL #H %0' C'F GF'C .7# /'.DJ AJ 'DE-HD 'D(1E,J JIT. TIME_IN_JIT_001_NAME=% Time in Jit TIME_IN_JIT_001_HELP=J916 G0' 'D9/'/ F3() 'DHB* 'DEFB6J AJ *1,E) JIT EF0 ".1 E1-D) *1,E) JIT. J*E *-/J+ G0' 'D9/'/ AJ FG'J) CD E1-D) *1,E) JIT. HE1-D) *1,E) JIT GJ E1-D) *1,E) #-/ 'D#3'DJ( HA1H9G. TIME_IN_JIT_BASE_001_NAME=Not Displayed TIME_IN_JIT_BASE_001_HELP=:J1 E91H6. DotNetCLR_Interop_OBJECT_001_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_001_HELP=%-5'&J'* D@ CLR interop. CURRENT_CCW_001_NAME=# of CCWs CURRENT_CCW_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ EF Com-Callable-Wrappers ('.*5'1G' CCWs). J9*(1 CCW HCJD'K DDC'&F'* 'DEO/'1) D@ NET. H'D*J J*E 9ED E1',9 %DJG' EF 9EJD (9ED'!) COM :J1 'DEO/'1. *E *5EJE G0' 'D9/'/ DD%4'1) %DI 9// 'DC'&F'* 'DEO/'1) H'D*J J*E 9ED E1',9 %DJG' (H'37) 'D*9DJE'* 'D(1E,J) :J1 'DEO/'1) D@ COM. CURRENT_STUBS_001_NAME=# of Stubs CURRENT_STUBS_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ EF H-/'* C9( 'D1H*JF 'D*J *E %F4'$G' (H'37) CLR. H*9/ H-/'* C9( 'D1H*JF E3$HD) 9F *F8JE 'DH3'&7 HBJE 'D%1,'9 EF 'D*9DJE'* 'D(1E,J) 'DEO/'1) %DI :J1 'DEO/'1) H'D9C3 H0DC #+F'! '3*/9'! COM Interop #H '3*/9'! PInvoke. NUM_MARSHALLING_001_NAME=# of marshalling NUM_MARSHALLING_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// E1'* *F8JE 'DH3'&7 HBJE 'D%1,'9 EF 'D*9DJE'* 'D(1E,J) 'DEO/'1) %DI :J1 'DEO/'1) H'D9C3 EF0 (/! *4:JD 'D*7(JB. HD' J*E 2J'/) G0' 'D9/'/ %0' *E *6EJF H-/'* C9( 'D1H*JF. (H-/'* C9( 'D1H*JF GJ 'DE3$HD) 9F *F8JE 'DH3'&7 HBJE 'D%1,'9). J*E *6EJF H-/'* C9( 'D1H*JF 9'/) %0' C'F EB/'1 'D-ED 'D*F8JEJ 5:J1K'. TOTAL_TLB_IMPORTS_001_NAME=# of TLB imports / sec TOTAL_TLB_IMPORTS_001_HELP=E-,H2 DD'3*./'E AJ 'DE3*B(D. TOTAL_TLB_EXPORTS_001_NAME=# of TLB exports / sec TOTAL_TLB_EXPORTS_001_HELP=E-,H2 DD'3*./'E AJ 'DE3*B(D. DotNetCLR_LocksAndThreads_OBJECT_001_NAME=.NET CLR LocksAndThreads DotNetCLR_LocksAndThreads_OBJECT_001_HELP=%-5'&J'* D*#EJF'* HE$41'* *1'(7 CLR. CONTENTION_TOTAL_001_NAME=Total # of Contentions CONTENTION_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// 'DE1'* 'D*J A4D* AJG' E$41'* 'D*1'(7 AJ CLR AJ 'D-5HD 9DI *#EJF EO/'1. JECF 'D-5HD 9DI 'D*#EJF'* 'DEO/'1) (9/) 71B (H'37) 9('1) " lock" AJ D:) #C #H ('3*/9'! System.Monitor.Enter #H ('3*./'E 'D3E) 'DE.55) MethodImplOptions.Synchronized. CONTENTION_INST_001_NAME=Contention Rate / sec CONTENTION_INST_001_HELP='DE9/D 'D0J *-'HD (G E$41'* 'D*1'(7 AJ HB* 'D*4:JD 'D-5HD 9DI *#EJF EO/'1 /HF F,'-. JECF 'D-5HD 9DI 'D*#EJF'* 'DE/O'1) (9/) 71B (H'37) 9('1) "lock" AJ D:) #C #H ('3*/9'! System.Monitor.Enter #H ('3*./'E 'D3E) 'DE.55) MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_001_NAME=Current Queue Length QUEUE_LENGTH_CUR_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// E$41'* 'D*1'(7 'D*J *F*81 -'DJK' 'D-5HD 9DI (96 'D*#EJF'* 'DEO/'1) AJ 'D*7(JB. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 ".1 BJE) *E* ED'-8*G'. QUEUE_LENGTH_TOTAL_001_NAME=Queue Length Peak QUEUE_LENGTH_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// E$41'* 'D*1'(7 'D*J 'F*81* 'D-5HD 9DI (96 'D*#EJF'* 'DEO/'1) EF0 (/! *4:JD 'D*7(JB. QUEUE_LENGTH_INST_001_NAME=Queue Length / sec QUEUE_LENGTH_INST_001_HELP=J916 G0' 'D9/'/ 9// E$41'* 'D*1'(7 AJ 'D+'FJ) 'D*J *F*81 'D-5HD 9DI (96 'D*#EJF'* AJ 'D*7(JB. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). CURRENT_LOGICAL_THREADS_001_NAME=# of current logical Threads CURRENT_LOGICAL_THREADS_001_HELP=J916 G0' 'D9/'/ 9// C'&F'* E$41 *1'(7 NET. 'D-'DJ AJ 'D*7(JB. HJ*E %F4'! C'&F E$41 *1'(7 NET. %E' 9F 71JB System.Threading.Thread ,/J/ #H 9F/E' J/.D E$41 *1'(7 :J1 EO/'1 AJ 'D(J&) 'DEO/'1). HJ-*A8 G0' 'D9/'/ (9// CD EF E$41'* 'D*1'(7 'D*J BJ/ 'D*4:JD H'DE*HBA). HBJE) G0' 'D9/'/ DJ3* BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 AB7 ".1 BJE) *E* ED'-8*G'. CURRENT_PHYSICAL_THREADS_001_NAME=# of current physical Threads CURRENT_PHYSICAL_THREADS_001_HELP=J916 G0' 'D9/'/ 9// E$41'* *1'(7 F8'E 'D*4:JD 'D#5DJ) 'D*J *E %F4'$G' H'E*D'CG' (H'37) CLR DCJ *9ED CE$41'* *1'(7 #3'3J) DC'&F'* E$41 *1'(7 NET. D' **6EF BJE) G0' 'D9/'/ E$41'* 'D*1'(7 'DE3*./E) (H'37) CLR AJ 9EDJ'*G' 'D/'.DJ)  AGJ E,EH9) A19J) EF E$41'* 'D*1'(7 'DEH,H/) AJ 9EDJ) F8'E 'D*4:JD. RECOGNIZED_THREADS_CUR_001_NAME=# of current recognized threads RECOGNIZED_THREADS_CUR_001_HELP=J916 G0' 'D9/'/ 9// E$41'* 'D*1'(7 'D*J *E 'D*91A 9DJG' -'DJK' (H'37) CLR HJB*1F (E$41'* 'D*1'(7 G0G C'&F E$41 *1'(7 NET. E7'(B. DE J*E %F4'! E$41'* 'D*1'(7 G0G (H'37) CLR (D *E %F4'$G' .'1, CLR DCF *E *4:JDG' EF0 0DC 'D-JF /'.D CLR E1) H'-/) 9DI 'D#BD. J*E *9B( E$41'* 'D*1'(7 'DA1J/) AB7 #E' E$41'* 'D*1'(7 'D*J DG' FA3 E91A E$41 'D*1'(7 'D*J */.D CLR E1) #.1I #H 'D*J *E* %9'/) %F4'&G' (9/ %FG'! E$41 'D*1'(7 AD' J*E 9/QG' E1*JF. RECOGNIZED_THREADS_TOTAL_001_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// E$41'* 'D*1'(7 'D*J *E 'D*91A 9DJG' EF BP(D CLR EF0 (/! *4:JD 'D*7(JB HJB*1F (E$41'* 'D*1'(7 G0G C'&F E$41 *1'(7 NET. E7'(B. DE J*E %F4'! E$41'* 'D*1'(7 G0G (H'37) CLR (D *E %F4'$G' .'1,G'  DCF *E *4:JDG' EF0 0DC 'D-JF /'.D CLR E1) H'-/) 9DI 'D#BD. J*E *9B( E$41'* 'D*1'(7 'DA1J/) AB7 HE$41'* 'D*1'(7 'D*J *-*HJ 9DI FA3 E91A E$41 'D*1'(7 'D*J */.D CLR E1) #.1I #H E$41'* 'D*1'(7 'D*J *E* %9'/) %F4'&G' (9/ %FG'! E$41 'D*1'(7 D' J*E 9/G' E1*JF. RECOGNIZED_THREADS_INST_001_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_001_HELP=J916 G0' 'D9/'/ 9// E$41'* 'D*1'(7 AJ 'D+'FJ) 'D*J *E 'D*91A 9DJG' (H'37) CLR. HJB*1F (E$41'* 'D*1'(7 G0G C'&F E$41 *1'(7 NET. E7'(B. DE J*E %F4'! E$41'* 'D*1'(7 G0G (H'37) CLR (D *E %F4'$G' .'1, CLR DCF *E *4:JDG' EF0 0DC 'D-JF /'.D CLR E1) H'-/) 9DI 'D#BD. HJ*E *9B( E$41'* 'D*1'(7 'DA1J/) AB7 HE$41'* 'D*1'(7 'D*J DG' FA3 E91A E$41 'D*1'(7 'D*J */.D CLR E1) #.1I #H E$41'* 'D*1'(7 'D*J *E* %9'/) %F4'&G' (9/ %FG'! E$41 'D*1'(7 D' J*E 9/QG' E1*JF. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). DotNetCLR_Security_OBJECT_001_NAME=.NET CLR Security DotNetCLR_Security_OBJECT_001_HELP=%-5'&J'* D#E'F CLR. SECURITY_TOTALRTCHECKS_001_NAME=Total Runtime Checks SECURITY_TOTALRTCHECKS_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// 9EDJ'* 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) (CAS) 'D*J *E %,1'$G' EF0 (/! *4:JD 'D*7(JB. HJ*E %,1'! 9EDJ'* 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) 9F/E' JBHE 7'D( (%,1'! '3*/9'! DE*5D 9DJG D7D( %0F E9JF HJ*E %,1'! 'D*-BB 'D.'5 (HB* 'D*4:JD 9DI CD '3*/9'! (H'37) 'D7'D( HJ*E 'D*-BB 9F 71JB '.*('1 EC/3 E$41 'D*1'(7 'D-'DJ DD7'D(. HJ4J1 G0' 'D9/'/ 'D0J JO3*./E E9 "9EB 'DEC/3 #+F'! 'DE1H1 (G" %DI EB/'1 'F.A'6 'D#/'! F*J,) 9EDJ'* 'D*-BB EF 'D#E'F. SECURITY_TIMEAUTHORIZE_001_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_001_HELP=E-,H2 DD'3*./'E AJ 'DE3*B(D. SECURITY_LINKCHECKS_001_NAME=# Link Time Checks SECURITY_LINKCHECKS_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// 9EDJ'* 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) (CAS) 'D.'5) (HB* 'D'1*('7 EF0 (/! *4:JD 'D*7(JB. HJ*E %,1'! 9EDJ'* 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) 'D.'5) (HB* 'D'1*('7 9F/E' JBHE 7'D( (%,1'! '3*/9'! DE*5D 9DJG D7D( %0F 9F/ HB* *1,E) JIT HJ*E %,1'! 'D*-BB EF HB* 'D1(7 E1) H'-/) DCD 7'D(. HD' J4J1 G0' 'D9// %DI E4CD'* .7J1) AJ 'D#/'! HDCFG J4J1 %DI F4'7 F8'E 'D#E'F. SECURITY_TIMERTCHECKS_001_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_001_HELP=J916 G0' 'D9/'/ F3() 'DHB* 'DEFB6J AJ %,1'! 9EDJ'* 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) (CAS) AJ HB* 'D*4:JD EF0 ".1 *-BB EE'+D. HJ3E- #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) ('DH+HB AJ 'D*9DJE'* 'D(1E,J) (/1,'* E*FH9) HJA16 E3*HJ'* 'D+B) 'DE*FH9) G0G (F'!K 9DI GHJ) 'D*9DJE'* 'D(1E,J). J*E *-/J+ G0' 'D9/'/ AJ FG'J) 9EDJ) 'D*-BB EF #E'F HB* 'D*4:JD HGH JE+D ".1 BJE) *E* ED'-8*G' HDJ3* BJE) 'DE*H37. SECURITY_TIMERTCHECKS_BASE_001_NAME=Not Displayed SECURITY_TIMERTCHECKS_BASE_001_HELP=:J1 E91H6. SECURITY_DEPTHSECURITY_001_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_001_HELP=J916 G0' 'D9/'/ 9EB 'DEC/3 D".1 9EDJ) *-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) #+F'! HB* 'D*4:JD. J*E %,1'! 'D*-BB EF #E'F 'DH5HD %DI 'D*9DJE'* 'D(1E,J) 9F 71JB E3- 'DEC/3. HD' *CHF BJE) G0' 'D9/'/ BJE) 'DE*H37 HDCFG J916 AB7 ".1 BJE) *E* ED'-8*G'. DotNetCLR_Remoting_OBJECT_001_NAME=.NET CLR Remoting DotNetCLR_Remoting_OBJECT_001_HELP=%-5'&J'* DD9ED 9F (O9/ AJ CLR. CONTEXT_REMOTECALLS_INST_001_NAME=Remote Calls/sec CONTEXT_REMOTECALLS_INST_001_HELP=J916 G0' 'D9/'/ 9// '3*/9'!'* 'D%,1'!'* 'D(9J/) 'D*J *E %,1'$G' AJ 'D+'FJ). H'3*/9'! 'D%,1'! 'D(9J/ GH '3*/9'! D#J C'&F .'1, E,'D 'D*7(JB (AppDomain) 'D.'5 ('D7'D(. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). CONTEXT_CHANNELS_001_NAME=Channels CONTEXT_CHANNELS_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// BFH'* 'D9ED 9F (O9/ 'DE3,D) 9(1 ,EJ9 E,'D'* 'D*7(JB'* (AppDomain) EF0 (/! *4:JD 'D*7(JB. *@O3*./E 'DBFH'* AJ FBD 'D13'&D EF H%DI 'DC'&F'* 'D(9J/). CONTEXT_PROXIES_001_NAME=Context Proxies CONTEXT_PROXIES_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// C'&F'* 'D9ED 9F (O9/ 'D.'5) ('DHCJD 'D*J *E %F4'$G' AJ G0G 'D9EDJ) EF0 (/! 'D9EDJ). HJ9ED C'&F 'DHCJD CEE+D DDC'&F'* 'D(9J/) HJ*#C/ EF *H,JG ,EJ9 'D'3*/9'!'* 'D*J J*E %,1'$G' 9DI 'DHCJD %DI E+JD 'DC'&F 'D(9J/ 'D5-J-. CONTEXT_CLASSES_001_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_001_HELP=J916 G0' 'D9/'/ 'D9// 'D-'DJ DDA&'* 'DE1*(7) ('D3J'B H'D*J *E *-EJDG'. H*3EI 'DA&'* 'D*J JECF 1(7G' ('D3J'B 'DA&'* 'DE1*(7) ('D3J'B HJ*E *9DJE 'DA&'* 'DE1*(7) ('D3J'B (3E'* 'D3J'B 'D*J *HA1 BH'9/ 'D'3*./'E DDE2'EF) HDH5D E$41'* 'D*1'(7 H'DE9'ED'*  %D.. CONTEXT_OBJALLOC_001_NAME=Context-Bound Objects Alloc / sec CONTEXT_OBJALLOC_001_HELP=J916 G0' 'D9/'/ 9// 'DC'&F'* 'DE1*(7) ('D3J'B 'D*J *E *.5J5G' AJ 'D+'FJ). H*3EI E+JD'* 'DA&'* 'D*J JECF 1(7G' ('D3J'B ('DC'&F'* 'DE1*(7) ('D3J'B HJ*E *9DJE 'DA&'* 'DE1*(7) ('D3J'B (3E'* 'D3J'B 'D*J *HA1 BH'9/ 'D'3*./'E DDE2'EF) HDH5D E$41'* 'D*1'(7 H'DE9'ED'*  %D.. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). CONTEXT_CONTEXTS_001_NAME=Contexts CONTEXT_CONTEXTS_001_HELP=G0' 'D9/'/ J916 'D9// 'D-'DJ D3J'B'* 'D9ED 9F (O9/ AJ 'D*7(JB. H'D3J'B GH -/ J-*HJ 9DI E,EH9) C'&F'* DG' FA3 BH'9/ 'D'3*./'E E+D 'DE2'EF) HH5D E$41'* 'D*1'(7 H'DE9'ED'*  %D.. CONTEXT_REMOTECALLS_TOTAL_001_NAME=Total Remote Calls CONTEXT_REMOTECALLS_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// '3*/9'!'* 'D%,1'!'* 'D(9J/) 'D*J *E %,1'$G' EF0 (/! *4:JD 'D*7(JB. H'3*/9'! 'D%,1'! 'D(9J/ GH '3*/9'! D#J C'&F .'1, E,'D 'D*7(JB (AppDomain) 'D.'5 ('D7'D(. DotNetCLR_Excep_OBJECT_001_NAME=.NET CLR Exceptions DotNetCLR_Excep_OBJECT_001_HELP=%-5'&J'* HB* 'D*4:JD AJ E9'D,) '3*+F'!'* CLR. EXCEP_THROWN_TOTAL_001_NAME=# of Exceps Thrown EXCEP_THROWN_TOTAL_001_HELP=J916 G0' 'D9/'/ %,E'DJ 9// 'D'3*+F'!'* 'D*J *E 71-G' EF0 (/! *4:JD 'D*7(JB. H**6EF G0G 'D'3*+F'!'* CD'K EF '3*+F'!'* NET. H'D'3*+F'!'* :J1 'DEO/'1) 'D*J *E *-HJDG' %DI '3*+F'!'* NET. A9DI 3(JD 'DE+'D  3**E %9'/) 71- '3*+F'! E1,9 'DE$41 'DA'1: 'DEH,H/ AJ 'D*9DJE'* 'D(1E,J) :J1 'DEO/'1) AJ 'D*9DJE'* 'D(1E,J) 'DEO/'1) 9DI GJ&) NET System.NullReferenceException. -J+ J*6EF G0' 'D9/'/ CD'K EF 'D'3*+F'!'* 'DEO9'DN,) H:J1 'DEO9'DN,). H3J*E E1) #.1I 9/Q 'D'3*+F'!'* 'D*J *E* %9'/) 71-G'. J,( #F *-/+ 'D'3*+F'!'* AJ EH'BA F'/1) AB7 HDJ3 AJ 'D*/AB 'D9'/J DD*-CE AJ 'D(1F'E,. EXCEP_THROWN_INST_001_NAME=# of Exceps Thrown / sec EXCEP_THROWN_INST_001_HELP=J916 G0' 'D9/'/ 9// 'D'3*+F'!'* 'D*J *E 71-G' AJ 'D+'FJ). H**6EF G0G 'D'3*+F'!'* CD'K EF '3*+F'!'* NET. H'D'3*+F'!'* :J1 'DEO/'1) 'D*J *E *-HJDG' %DI '3*+F'!'* NET. 9DI 3(JD 'DE+'D  3J*E %9'/) 71- '3*+F'! E1,9 'DE$41 'DA'1: 'DEH,H/ AJ 'D*9DJE'* 'D(1E,J) :J1 'DEO/'1) AJ 'D*9DJE'* 'D(1E,J) 'DEO/'1) 9DI GJ&) NET System.NullReferenceException. -J+ J*6EF G0' 'D9/'/ CD'K EF 'D'3*+F'!'* 'DEO9'DN,) H:J1 'DEO9'DN,). J,( #F *-/+ 'D'3*+F'!'* AJ EH'BA F'/1) AB7 HDJ3 AJ 'D*/AB 'D9'/J DD*-CE AJ 'D(1F'E, HB/ *E *5EJE G0' 'D9/'/ CE$41 DE4'CD 'D#/'! 'DE-*ED) F*J,) DDE9/D 'DC(J1 (#C(1 EF 100 +'FJ)) DD'3*+F'!'* 'D*J *E 71-G'. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). TOTAL_EXCEP_FILTERS_RUN_001_NAME=# of Filters / sec TOTAL_EXCEP_FILTERS_RUN_001_HELP=J916 G0' 'D9/'/ 9// 9H'ED *5AJ) '3*+F'!'* NET. 'D*J *E 71-G' AJ 'D+'FJ). HJBHE 9'ED *5AJ) 'D'3*+F'! (*BJJE E' %0' C'F J,( E9'D,) 'D'3*+F'! #E D'. J*9B( G0' 'D9/'/ E9/D 9H'ED *5AJ) 'D'3*+F'!'* 'D*J *E *BJJEG' (51A 'DF81 9E' %0' C'F B/ *E E9'D,) 'D'3*+F'! #E D'. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). TOTAL_EXCEP_FINALLYS_RUN_001_NAME=# of Finallys / sec TOTAL_EXCEP_FINALLYS_RUN_001_HELP=J916 G0' 'D9/'/ 9// 9EDJ'* 'D*#EJF 'DFG'&J) 'D*J *E *FAJ0G' AJ 'D+'FJ). HEF 'DE$C/ *FAJ0 'D*#EJF 'DFG'&J (51A 'DF81 9F CJAJ) %FG'! E-'HD) 'D*#EJF. HD' J*E 9/Q %D' 9EDJ'* 'D*#EJF 'DFG'&J) 'D*J J*E *FAJ0G' EF #,D #-/ 'D'3*+F'!'* AB7 AD' J*E 9/Q 9EDJ'* 'D*#EJF 'DFG'&J) 9DI E3'1'* 'D*9DJE'* 'D(1E,J) 'D9'/J) (H'37) G0' 'D9/'/. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). EXCEPT_STACK_DEPTH_001_NAME=Throw To Catch Depth / sec EXCEPT_STACK_DEPTH_001_HELP=J916 G0' 'D9/'/ 9// %7'1'* 'DEC/3 'D*J *E ',*J'2G' EF 'D%7'1 'D0J B'E (71- '3*+F'! NET. %DI 'D%7'1 'D0J 9'D, 'D'3*+F'! AJ 'D+'FJ). **E %9'/) *9JJF G0' 'D9/'/ %DI 0 9F/ %/.'D #-/ E9'D,'* 'D'3*+F'!'* H(0DC 3HA *O8G1 'D'3*+F'!'* 'DE*/'.D) EB/'1 9EB 'DEC/3 EF E9'D, %DI 'DE9'D, 'D0J JDJG. HD' *CHF BJE) G0' 'D9/'/ BJE) E*H37 'DBJ'3'* .D'D 'DHB* AGH J916 'DA1B (JF 'DBJE 'D*J *E* ED'-8*G' AJ 'D9JF*JF 'D#.J1*JF EB3HEK' 9DI E/) 'DA'5D 'D2EFJ DD9JF). DotNetCLR_Memory_OBJECT_804_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_804_HELP=CLR ƒW>WÞV6e„vX„v¡‹pehV0 GEN0_COLLECTIONS_COUNTER_804_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNegù[ 0 ãNù[aŒ(g°e„vÿgÑRM‘„v)ÛLˆƒW>WÞV6e(Gen 0 GC)„v!kpe0Gen 0 GC (W 0 ãN-N„vïS(u…QX[ N³åNán³RM‘÷‹Bl„v—‰öeÑSu0dk¡‹pehV(W Gen 0 GC Ó~_göežX0ƒØšãN„v GC Sìb@b gƒNOãN„v GC0dk¡‹pehV(WƒØšãN(Gen 1 b Gen 2) GC ÑSuöe>f_žX0_Global_ ¡‹pehV

f:y NN!k‰Km„vf:yê”^(u z^/T¨RåNegù[ 1 ãNù[aŒÛLˆƒW>WÞV6e„v!kpe0dk¡‹pehV(W Gen 1 GC Ó~_göežX0ƒØšãN„v GC Sìb@b gƒNOãN„v GC0dk¡‹pehV(WƒØšãN (Gen 2) GC ÑSuöe>f_žX0_Global_ ¡‹pehV

f:y NN!k‰Km„vf:yê”^(u z^/T¨RåNegù[ 2 ãNù[aŒ(ƒée„v)ÛLˆƒW>WÞV6e„v!kpe0dk¡‹pehV(W Gen 2 GC (_Nðy:NŒ[hQ GC)Ó~_göežX0_Global_ ¡‹pehV

f:y NN!k‰Km„vf:yƒW>WÞV6e (GC) TÍNX[(W ÿv^ÎN 0 ãNÐcGS0R 1 ãN„v…QX[W[‚‚peÿdk¡‹pehV-N NSìbÅN1uŽNI{…_Œ[b €«ˆÐcGS„vù[aŒ0dk¡‹pehV>f:y NN!k GC Ó~_göe‰Km„vf:yƒW>WÞV6e (GC) TÍNX[(W ÿv^ÎN 1 ãNÐcGS0R 2 ãN„v…QX[W[‚‚peÿdk¡‹pehV-N NSìbÅN1uŽNI{…_Œ[b €«ˆÐcGS„vù[aŒ0dk¡‹pehV>f:y NN!k GC Ó~_göe‰Km„vf:yÏkÒyÎN 0 ãN(g°e„v)ÐcGS0R 1 ãN„vW[‚‚peÿdk¡‹pehV-N NSìbÅN1uŽNI{…_Œ[b €«ˆÐcGS„vù[aŒ0ƒW>WÞV6eTÍNX[(W„v…QX[«ˆÐcGS0dk¡‹pehV«ˆ¾‹¡‹:NÏkÒyRú^„vuX[gƒ•„vù[aŒ„vc:yhV0dk¡‹pehV>f:ygÑ$N*N7h,g-N‰Km„vf:yÏkÒyÎN 1 ãNÐcGS0R 2 ãN(gée„v)„vW[‚‚peÿdk¡‹pehV-N NSìbÅN1uŽNI{…_Œ[b €«ˆÐcGS„vù[aŒ0ƒW>WÞV6eTÍNX[(W„v…QX[«ˆÐcGS01uŽN 2 ãN/fgée„v ÿàVdk NOÎN 2 ãNÐcGSûNUO…Q¹[0dk¡‹pehV«ˆ¾‹¡‹:NÏkÒyRú^„vuX[gˆ_•„vù[aŒ„vc:yhV0dk¡‹pehV>f:ygÑ$N*N7h,g-N‰Km„vf:yÅN1uŽNI{…_Œ[b €ÎN 0 ãNÐcGS0R 1 ãN„v…QX[W[‚‚pe0dk¡‹pehV>f:y NN!k GC Ó~_göe‰Km„vf:yck(W«ˆÑvƉ„v CLR Û zž[‹O„vÛ z ID0(W,{N!kÞV6eƒW>WMR ÿ>f:y„vf:y 0 ãN(Gen 0)-NïSåNRM‘„vg'YW[‚‚peÿƒ[ Nc:y Gen 0 -Nò]RM‘„vS_MRW[‚‚pe0S_ÎN NN!k GC åNegRM‘„vW[‚‚pe…Çdk'Y\öe ÿ\æ‰ÑS Gen 0 GC0Gen 0 'Y\/f1uƒW>WÞV6ehVŒte„v ÿv^NO(W”^(u z^gbLˆgô•ôf9e0(W Gen 0 ÞV6eÓ~_göe ÿGen 0 X„v'Y\ž[E– N:N 0 W[‚‚ÿdk¡‹pehV>f:y\æ‰ÑS NN!k Gen 0 GC „vRM‘„v'Y\(åNW[‚‚:NUSMO)0dk¡‹pehV(W GC Ó~_göeôf°eÿ N(WÏk!kRM‘öeôf°e0 GEN1_HEAP_SIZE_COUNTER_804_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_804_HELP=dk¡‹pehV>f:y 1 ãN (Gen 1) -N„vS_MRW[‚‚peÿdk¡‹pehV N>f:y Gen 1 „vg'Y'Y\0dkãN-N„vù[aŒ N/fôv¥cRM‘„vÿÙ›Nù[aŒ/fÎNåNMR„v Gen 0 GC ÐcGS„v0dk¡‹pehV(W GC Ó~_göeôf°eÿ N(WÏk!kRM‘öeôf°e0 GEN2_HEAP_SIZE_COUNTER_804_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_804_HELP=dk¡‹pehV>f:y 2 ãN (Gen 2) -N„vS_MRW[‚‚pe0dkãN-N„vù[aŒ N/fôv¥cRM‘„vÿÙ›Nù[aŒ/f(WåNMR„v Gen 1 GC Ç z-NÎN Gen 1 ÐcGS„v0dk¡‹pehV(W GC Ó~_göeôf°eÿ N(WÏk!kRM‘öeôf°e0 LARGE_OBJECT_SIZE_COUNTER_804_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_804_HELP=dk¡‹pehV>f:y'Y‹Wù[aŒX„vS_MR'Y\(åNW[‚‚:NUSMO)0ƒW>WÞV6ehV\'Y\…Ç–f:y1uŽNI{…_Œ[b €ÞV6eTÍNX[(W„vƒW>WÞV6eù[aŒpe0‚YœgÙ›Nù[aŒwQ gù[vQÖNù[aŒ„v_(u ÿR£›Nù[aŒ_NOX[(W ÿFO/f N¡‹eQdk¡‹pehV…Qÿ Promoted Finalization-Memory from Gen 0 ŒT Promoted Finalization-Memory from Gen 1 ¡‹pehVhˆ:y@b g1uŽN‰Œ[b €X[(W„v…QX[0dk¡‹pehV N/f/}ïy¡‹pehVÿƒ[(WÏk!k GC Ó~_göeôf°e:NÅN(Wyrš[ GC TÍNX[(W„vù[aŒ„vpeÏ‘0dk¡‹pehVèe(Wc:y”^(u z^1uŽNŒ[b €ïSý€O&^eg„v˜Yû|ß~_•0 NUM_HANDLES_COUNTER_804_NAME=# GC Handles NUM_HANDLES_COUNTER_804_HELP=dk¡‹pehV>f:yO(u-N„v GC åSÄg„vS_MRpeîv0GCHandle /f CLR ŒTXb¡{¯sƒX„vYèDn„våSÄg0åSÄg(W GCHeap -N`S(u\Ï‘…QX[ ÿFO/fïSý€O`S(u[5„v^—Xb¡{Dn0 ALLOCATION_RATE_COUNTER_804_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_804_HELP=dk¡‹pehV>f:yÏkÒy(W GC X NRM‘W[‚‚„v‡s0dk¡‹pehV(WÏk!k GC Ó~_göeôf°eÿ N(WÏk!kRM‘öeôf°e0dk¡‹pehV N/fNµköeô•„vs^GWf:y(W N$N*N7h,g-N‰Km„vf:y1uŽNù[ GC.Collect „v>f_Œ(u €gbLˆƒW>WÞV6e„vg'Y!kpe0©‹ GC Œteêñ]„vÞV6e‘˜‡s„v/f*N}YZPÕl0 PER_TIME_IN_GC_COUNTER_804_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_804_HELP=% Time in GC /fê NN!k GC ª_¯såNeggbLˆƒW>WÞV6e (GC) @b(u„vÐLˆöeô•„v~vRÔk0dk¡‹pehV8^/fƒW>WÞV6ehVãNhˆ”^(u z^6eÆ–ŒT‹S)…QX[@bŒ[b„vå]\O„vc:yhV0dk¡‹pehVêS(WÏk!k GC Ó~_göeôf°e ÿ €¡‹pehVf:y0 TOTAL_HEAP_SIZE_COUNTER_804_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_804_HELP=dk¡‹pehV/f 4 *NvQÖN¡‹pehV„vŒTÿGen 0 Heap Size0Gen 1 Heap Size0Gen 2 Heap Size ŒT Large Object Heap Size0dk¡‹pehVåNW[‚‚:NUSMOc:y(W GC X NS_MRRM‘„v…QX[0 TOTAL_COMMITTED_MEM_COUNTER_804_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_804_HELP=dk¡‹pehV>f:yS_MR1uƒW>WÞV6ehVÐc¤N„vZ†ßb…QX[Ï‘(åNW[‚‚:NUSMO)0(Ðc¤N…QX[/fÁxØvu˜b—‡eöN N:NvQÝOYu†Nzzô•„virt…QX[)0 TOTAL_RESERVED_MEM_COUNTER_804_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_804_HELP=dk¡‹pehV>f:yS_MR1uƒW>WÞV6ehVÝOYu„vZ†ßb…QX[Ï‘(åNW[‚‚:NUSMO)0(ÝOYu…QX[/f:N”^(u z^ÝOYu„vZ†ßb…QX[zzô• ÿFO\*gO(uûNUOÁxØvb;N…QX[u˜)0 GC_PINNED_OBJECTS_804_NAME=# of Pinned Objects GC_PINNED_OBJECTS_804_HELP=dk¡‹pehV>f:y N!k GC -NG0R„vúVš[ù[aŒ„vpeîv0dk¡‹pehVêSß*Ž«ˆƒW>WÞV6e„vX-N„vúVš[ù[aŒ ÿ‹O‚Y Gen 0 GC \êSü[ôù[ 0 ãNX-N„vúVš[ù[aŒÛLˆšg>N0úVš[ù[aŒ/f…QX[-NƒW>WÞV6ehVàeÕlûy¨R„vù[aŒ0 GC_SINKBLOCKS_804_NAME=# of Sink Blocks in use GC_SINKBLOCKS_804_HELP=dk¡‹pehV>f:yO(u-N„v sync WW„vS_MRpeîv0Sync WW/fRM‘„vÏk*Nù[aŒ„vpencÓ~„g ÿ(uŽNX[¨P TekáOo`0Sync WWwQ gù[Xb¡{ù[aŒ„v1__(uv^—‰1uƒW>WÞV6ehVÛLˆkbÏc0Sync WW NP–ŽNêSX[¨P TekáOo` ÿ_NïSåNX[¨P COM ’NÍd\OCQpenc0dk¡‹pehVèe(Wc:y gsQ'YÏ‘O(u TekúWCQ„v'`ý€î•˜˜0 DotNetCLR_Loading_OBJECT_804_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_804_HELP=CLR {| R} z^„vß~¡‹áOo`0 LOADING_CLASSES_TOTAL_804_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_804_HELP=dk¡‹pehV>f:yêdk”^(u z^/T¨RåNeg(W@b g z^Æ–-N R}„v{|„v/}ïypeîv0 LOADING_TIME_804_NAME=% Time Loading LOADING_TIME_804_HELP=ÝOYu›O\egO(u0 LOADING_ASMSEARCHLEN_804_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_804_HELP=ÝOYu›O\egO(u0 LOADING_LOADFAILURES_TOTAL_804_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNeg R}1Y%„v{|„vg'Ype0Ù›N R}1Y%„vŸSàV gY¹eb— ÿ‹O‚Y‰[hQ'` N³b€^—Õlf:yÏkÒy R}1Y%„v{|„vpeîv0dk¡‹pehV N/fNµköeô•„vs^GWf:y N$N*N7h,g-N‰Km„vf:y1u{| R} z^è@b g AppDomain Ðc¤N„v…QX[„vS_MR'Y\(åNW[‚‚:NUSMO)0(Ðc¤N…QX[/fÁxØvu˜b—‡eöN N:NvQÝOYu†Nzzô•„virt…QX[)0 LOADING_APPDOMAINS_UNLOADED_TOTAL_804_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNegxS}„v AppDomain „v;`pe0‚YœgY!k R}ŒTxS}Ðg*N AppDomain ÿRdk¡‹pehV\R+Rù[Ïk!kxS}¡‹pe0 LOADING_APPDOMAINS_UNLOADED_INST_804_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_804_HELP=dk¡‹pehV>f:yÏkÒyxS}„v AppDomain „vpeîv0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yS_MR@b g z^Æ–-N R}„v{|„vpeîv0 LOADING_CLASSES_INST_804_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_804_HELP=dk¡‹pehV>f:y@b g z^Æ–-NÏkÒy R}„v{|„vpeîv0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yS_MRdk”^(u z^-N R}„v AppDomain „vpeîv0AppDomain(”^(u z^ßW)Ðc›O‰[hQ(u„vYtUSCQ ÿCLR ïSåNO(uå‹YtUSCQ(WÐLˆŽN TNÛ z-N„v”^(u z^KNô•Ðc›O”–»y0 LOADING_APPDOMAINS_TOTAL_804_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_804_HELP=dk¡‹pehV>f:yêdk”^(u z^/T¨RåNeg R}„v AppDomain „vg'Ypeîv0AppDomain (”^(u z^ßW)Ðc›O‰[hQ(u„vYtUSCQ ÿCLR ïSåNO(uå‹YtUSCQ(WÐLˆŽN TNÛ z-N„v”^(u z^KNô•Ðc›O”–»y0 LOADING_APPDOMAINS_INST_804_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_804_HELP=dk¡‹pehV>f:yÏkÒy R}„v AppDomain „vpeîv0AppDomain (”^(u z^ßW)Ðc›O‰[hQ(u„vYtUSCQ ÿCLR ïSåNO(uå‹YtUSCQ(WÐLˆŽN TNÛ z-N„v”^(u z^KNô•Ðc›O”–»y0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:y(Wdk”^(u z^„v@b g AppDomain -N R}„v z^Æ–„vS_MRpeîv0‚Yœg z^Æ–åN^—yrš[ŽNßW„vb__ÎNY*N AppDomain  R} ÿRdk¡‹pehVêSžXN!k0 z^Æ–(Wƒ[ìN„vãNxïS1u@b g AppDomain qQ«Nöe ÿïSåNåN^—yrš[ŽNßW„vb__ R} ÿb(Wƒ[ìN„vãNxN(uŽN AppDomain öe ÿïSåNåNyrš[ŽNßW„vb__ R}0 LOADING_ASSEMBLIES_TOTAL_804_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_804_HELP=dk¡‹pehV>f:yêdk”^(u z^/T¨RåNeg R}„v z^Æ–„v;`pe0‚Yœg z^Æ–åN^—yrš[ŽNßW„vb__ÎNY*N AppDomain  R} ÿRdk¡‹pehVêSžXN!k0 z^Æ–(Wƒ[ìN„vãNxïS1u@b g AppDomain qQ«Nöe ÿïSåNåN^—yrš[ŽNßW„vb__ R} ÿb(Wƒ[ìN„vãNxN(uŽN AppDomain öe ÿïSåNåNyrš[ŽNßW„vb__ R}0 LOADING_ASSEMBLIES_INST_804_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_804_HELP=dk¡‹pehV>f:yÏkÒy(W@b g AppDomain -N R}„v z^Æ–„vpeîv0‚Yœg z^Æ–åN^—yrš[ŽNßW„vb__ÎNY*N AppDomain  R} ÿRdk¡‹pehVêSžXN!k0 z^Æ–(Wƒ[ìN„vãNxïS1u@b g AppDomain qQ«Nöe ÿïSåNåN^—yrš[ŽNßW„vb__ R} ÿb(Wƒ[ìN„vãNxN(uŽN AppDomain öe ÿïSåNåNyrš[ŽNßW„vb__ R}0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yê”^(u z^/T¨RåNeg1u CLR JIT Ñ‹hVž[öe (JIT) Ñ‹„v¹eÕl;`pe0dk¡‹pehV NSìb„˜ž[öeÑ‹„v¹eÕl0 JITTED_IL_CUR_804_NAME=# of IL Bytes Jitted JITTED_IL_CUR_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNegž[öeÑ‹„v IL W[‚‚;`pe0dk¡‹pehVŒ[hQI{HeŽN Total # of IL Bytes Jitted ¡‹pehV0 JITTED_IL_TOTAL_804_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNegž[öeÑ‹„v IL W[‚‚;`pe0dk¡‹pehVŒ[hQI{HeŽN # of IL Bytes Jitted ¡‹pehV0 JITTED_IL_INST_804_NAME=IL Bytes Jitted / sec JITTED_IL_INST_804_HELP=dk¡‹pehV>f:yÏkÒyž[öeÑ‹ IL W[‚‚pe„v‡s0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yê”^(u z^/T¨RåNeg JIT Ñ‹hVž[öeÑ‹1Y%„v¹eÕl„vg'Ypeîv0dk1Y%O(WàeÕlŒšÁ‹ IL öeb€ JIT Ñ‹hV-N g…Qè•ï‹öeÑSu0 TIME_IN_JIT_804_NAME=% Time in Jit TIME_IN_JIT_804_HELP=dk¡‹pehV>f:yê NN!k JIT Ñ‹6–µkåNeg JIT Ñ‹@b(uÐLˆöeô•„v~vRÔk0dk¡‹pehV(WÏk!k JIT Ñ‹6–µkÓ~_göeôf°e0JIT Ñ‹6–µk/fÑ‹¹eÕlÊSvQOVy˜„v6–µk0 TIME_IN_JIT_BASE_804_NAME=Not Displayed TIME_IN_JIT_BASE_804_HELP=*g>f:y0 DotNetCLR_Interop_OBJECT_804_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_804_HELP=CLR interop „vß~¡‹áOo`0 CURRENT_CCW_804_NAME=# of CCWs CURRENT_CCW_804_HELP=dk¡‹pehV>f:y Com ïSŒ(uSň (CCW) „vS_MRpeîv0CCW /f^—Xb¡{ COM ¢[7bïz-N_(u„v .NET Xb¡{ù[aŒ„vãNt0dk¡‹pehVèe(Wc:y^—Xb¡{ COM ãNx_(u„vXb¡{ù[aŒ„vpeîv0 CURRENT_STUBS_804_NAME=# of Stubs CURRENT_STUBS_804_HELP=dk¡‹pehV>f:y CLR Rú^„v stub „vS_MRpeîv0Stub #(W COM ’NÍd\OŒ(ub PInvoke Œ(ugô•\ÂSpeŒTÔÞVf:yê”^(u z^/T¨RåNeg\ÂSpeŒTÔÞVf:y CLR -N„v¿~ zÕ‹þV·ƒÖSXb¡{•1Y%„v;`!kpe0Xb¡{•ïSåN(uYÍy¹e_·ƒÖSÿÇ(u C# -N„v lock í‹åS0ÇŒ(u System.Monitor.Enter bÇO(u MethodImplOptions.Synchronized êš[INyr'`0 CONTENTION_INST_804_NAME=Contention Rate / sec CONTENTION_INST_804_HELP=¿~ z(WÐLˆöeÕ‹þV·ƒÖSXb¡{•1Y%„v‡s0Xb¡{•ïSåN(uYÍy¹e_·ƒÖSÿÇ(u C# -N„v lock í‹åS0ÇŒ(u System.Monitor.Enter bÇO(u MethodImplOptions.Synchronized êš[INyr'`0 QUEUE_LENGTH_CUR_804_NAME=Current Queue Length QUEUE_LENGTH_CUR_804_HELP=dk¡‹pehV>f:y”^(u z^-NS_MRI{…_·ƒÖSÐg›NXb¡{•„v¿~ z„v;`pe0dk¡‹pehV N/fNµköeô•„vs^GWf:y NN!k‰Km„vf:yê”^(u z^/T¨RåNegI{…_·ƒÖSÐg›NXb¡{•„v¿~ z„v;`pe0 QUEUE_LENGTH_INST_804_NAME=Queue Length / sec QUEUE_LENGTH_INST_804_HELP=dk¡‹pehV>f:y”^(u z^-NÏkÒyI{…_·ƒÖSÐg›N•„v¿~ z„vpeîv0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:y”^(u z^-N„vS_MR .NET ¿~ zù[aŒ„vpeîv0.NET ¿~ zù[aŒ/f1u°e„v System.Threading.Thread Rú^„vb/f(W^—Xb¡{¿~ zÛeQXb¡{¯sƒXöeRú^„v0dk¡‹pehVÝOcÐLˆ¿~ zŒT\Pbk¿~ z$N€„v¡‹pe0dk¡‹pehV N/fNµköeô•„vs^GWf:y NN!k‰Km„vf:y1u CLR Rú^v^åb gåNEQS_ .NET ¿~ zù[aŒ„vúW@x¿~ z„v,g:g OS ¿~ z„vpeîv0dk¡‹pehV

f:yS_MR CLR Æ‹+R„v¿~ z„vpeîvÿÙ›N¿~ z gNƒ[ìNsQT€„vù[”^ .NET ¿~ zù[aŒ0Ù›N¿~ z N/f1u CLR Rú^„vÿƒ[ìN/f(W CLR YRú^„v ÿFO/fó\(W CLR …QÐLˆÇN!k0êSß*Ž/UN„v¿~ zÿù[Í‘°eÛeQ CLR b€(W¿~ zúQTÍ‘°eRú^„vwQ gøv T¿~ z ID „v¿~ z NO¡‹pe$N!k0 RECOGNIZED_THREADS_TOTAL_804_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_804_HELP=dk¡‹pehV>f:yêdk”^(u z^/T¨RåNeg CLR Æ‹+R„v¿~ z„v;`peÿÙ›N¿~ zwQ gNƒ[ìNsQT€„vù[”^ .NET ¿~ zù[aŒ0Ù›N¿~ z N/f1u CLR Rú^„vÿƒ[ìN/f(W CLR YRú^„v ÿFO/fó\(W CLR …QÐLˆÇN!k0êSß*Ž/UN„v¿~ zÿù[Í‘°eÛeQ CLR b€(W¿~ zúQTÍ‘°eRú^„vwQ gøv T¿~ z ID „v¿~ z NO¡‹pe$N!k0 RECOGNIZED_THREADS_INST_804_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_804_HELP=dk¡‹pehV>f:y CLR ÏkÒyÆ‹+R„v¿~ z„vpeîvÿÙ›N¿~ zwQ gNƒ[ìNsQT€„vù[”^ .NET ¿~ zù[aŒ0Ù›N¿~ z N/f1u CLR Rú^„vÿƒ[ìN/f(W CLR YRú^„v ÿFO/fó\(W CLR …QÐLˆÇN!k0êSß*Ž/UN„v¿~ zÿù[Í‘°eÛeQ CLR b€(W¿~ zúQTÍ‘°eRú^„vwQ gøv T¿~ z ID „v¿~ z NO¡‹pe$N!k0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yê”^(u z^/T¨RåNeggbLˆ„vÐLˆöeãNx¿‹î•‰[hQ'` (CAS) Àhåg„v;`pe0S_Œ(u¹eŒ(u‰Blyrš[CgP–„v«ˆŒ(u¹eöe ÿOgbLˆÐLˆöe CAS ÀhågÿŒ(u¹eÏk!kŒ(uöeýgbLˆÐLˆöeÀhågÿdkÀhåg/fÇÀhågŒ(u¹e„vS_MR¿~ zXhŒ[b„v0dk¡‹pehVN Stack Walk Depth NwO(uïSåNc:y‰[hQ'`Àhåg„v'`ý€_c1Y0 SECURITY_TIMEAUTHORIZE_804_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_804_HELP=ÝOYu›O\egO(u0 SECURITY_LINKCHECKS_804_NAME=# Link Time Checks SECURITY_LINKCHECKS_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNegþ”¥cöeãNx¿‹î•‰[hQ'` (CAS) Àhåg„v;`pe0S_Œ(u¹e(W JIT Ñ‹öeŒ(u‰Blyrš[CgP–„v«ˆŒ(u¹eöe ÿgbLˆþ”¥cöe CAS Àhågÿþ”¥cöeÀhågù[Ïk*NŒ(u¹egbLˆN!k0dk¡‹pe Nc:y%NÍ‘„v'`ý€î•˜˜ÿƒ[c:y‰[hQû|ß~;m¨R0 SECURITY_TIMERTCHECKS_804_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_804_HELP=dk¡‹pehV>f:yê N!kÐLˆöeãNx¿‹î•‰[hQ'`(CAS)ÀhågåNeggbLˆÙ7h„vÀhåg@b(u„vÐLˆöeô•„v~vRÔk0CAS AQ¸‹ãNx9hncãNxhÆ‹×S0R N T z¦^„váOûNv^:_6RÙ›N N T§~+R„váOûN0dk¡‹pehV(WÐLˆöe‰[hQ'`ÀhågÓ~_göeôf°eÿƒ[hˆ:y NN!k‰Km„vf:y0 SECURITY_DEPTHSECURITY_804_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_804_HELP=dk¡‹pehV>f:y N!kÐLˆöeãNx¿‹î•‰[hQ'`Àhåggô•„vXh„vñm¦^0ÐLˆöeãNx¿‹î•‰[hQ'`Àhåg/fÇ,rLˆM†SXhgbLˆ„v0dk¡‹pehV N/fs^GWf:y NN!k‰Km„vf:yÏkÒyŒ(u„vÜ zÇ zŒ(u„vpeîv0Ü zÇ zŒ(u/fù[Œ(u¹e AppDomain åNY„vûNUOù[aŒ„vŒ(u0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yê”^(u z^/T¨RåNeg(W@b g AppDomain -NèlŒQ„vÜ zYtáOS„v;`pe0áOS(uŽN OegÞVŽNÜ zù[aŒ„vˆmo`0 CONTEXT_PROXIES_804_NAME=Context Proxies CONTEXT_PROXIES_804_HELP=dk¡‹pehV>f:yêÛ z_ËYåNegdk(WÛ z-NRú^„vÜ zYtãNtù[aŒ„v;`pe0ãNtù[aŒEQS_Ü zù[aŒ„vãNhˆ ÿv^nxÝO\ù[ãNt„v@b gŒ(ulÑS0Rcknx„vÜ zù[aŒž[‹O0 CONTEXT_CLASSES_804_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_804_HELP=dk¡‹pehV>f:y R}„v N N‡eÑ~š[{|„vS_MRpeîv0ïSåNÑ~š[0R N N‡e„v{|ðy:N N N‡eÑ~š[{|ÿ N N‡eÑ~š[{|(u N N‡eyr'`h°‹ ÿÙ›Nyr'`Ðc›O Tek0¿~ zsQT€ŒT‹N¡RI{„vO(uĉR0 CONTEXT_OBJALLOC_804_NAME=Context-Bound Objects Alloc / sec CONTEXT_OBJALLOC_804_HELP=dk¡‹pehV>f:yÏkÒyRM‘„v N N‡eÑ~š[ù[aŒ„vpeîv0ïSåNÑ~š[0R N N‡e„v{|„vž[‹Oðy:N N N‡eÑ~š[ù[aŒÿ N N‡eÑ~š[ù[aŒ(u N N‡eyr'`h°‹ ÿÙ›Nyr'`Ðc›O Tek0¿~ zsQT€ŒT‹N¡RI{„vO(uĉR0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:y”^(u z^-NÜ zYt N N‡e„vS_MRpeîv0 N N‡e/fS+TwQ gøv TO(uĉR(‚Y Tek0¿~ zsQT€ŒT‹N¡RI{)„vù[aŒÆ–T„v¹Lu0 CONTEXT_REMOTECALLS_TOTAL_804_NAME=Total Remote Calls CONTEXT_REMOTECALLS_TOTAL_804_HELP=dk¡‹pehV>f:yêdk”^(u z^/T¨RåNegŒ(u„vÜ zÇ zŒ(u„v;`pe0Ü zÇ zŒ(u/fù[Œ(u¹e AppDomain åNY„vûNUOù[aŒ„vŒ(u0 DotNetCLR_Excep_OBJECT_804_NAME=.NET CLR Exceptions DotNetCLR_Excep_OBJECT_804_HELP=CLR _8^Yt„vÐLˆöeß~¡‹áOo`0 EXCEP_THROWN_TOTAL_804_NAME=# of Exceps Thrown EXCEP_THROWN_TOTAL_804_HELP=dk¡‹pehV>f:yê”^(u z^/T¨RåNeg_ÑS„v_8^„v;`pe0vQ-NSìb .NET _8^åNÊSlbc:N .NET _8^„v^—Xb¡{_8^ ÿ‹O‚Y ÿ^—Xb¡{ãNx-N„vzzcˆ”_(u_8^\(WXb¡{ãNx-NÍ‘°e_ÑS .NET System.NullReferenceExceptionÿdk¡‹pehVâeSìbò]Yt„v_8^_NSìb*gÏ~Yt„v_8^0Í‘°e_ÑS„v_8^\«ˆQ!k¡‹pe0_8^”^S_ÅN(Wg\Å`µQ N € N/f(W z^„vck8^§cöNAm-NÑSu0 EXCEP_THROWN_INST_804_NAME=# of Exceps Thrown / sec EXCEP_THROWN_INST_804_HELP=dk¡‹pehV>f:yÏkÒy_ÑS„v_8^„vpeîv0vQ-NSìb .NET _8^ŒTlbc:N .NET _8^„v^—Xb¡{_8^ ÿ‹O‚Y ÿ^—Xb¡{ãNx-N„vzzcˆ”_(u_8^\(WXb¡{ãNx-NÍ‘°e_ÑS .NET System.NullReferenceExceptionÿdk¡‹pehVâeSìbò]Yt„v_8^_NSìb*gÏ~Yt„v_8^0_8^”^ÅN(Wg\Å`µQ N € N/f(W z^„vck8^§cöNAm-NÑSuÿdk¡‹pehV«ˆ¾‹¡‹:N1uŽN_ÑS'YÔk‡s_8^ (>100s) €ÑSu\o(W'`ý€î•˜˜„vc:yhV0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yÏkÒygbLˆ„v .NET _8^[{ hV„vpeîv0_8^[{ hV¡‹—{_8^/f&T”^å‹Yt0dk¡‹pehVß*Ž¡‹—{„v_8^[{ hV‡s € N¡{/f&TYt_8^0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yÏkÒygbLˆ„v finally WW„vpeîv0 N¡{‚YUOúQ try WW ÿGWÝOÁ‹gbLˆ finally WW0êSù[:N_8^gbLˆ„v finally WW¡‹peÿdk¡‹pehV Nù[ck8^ãNxï„_ N„v finally WW¡‹pe0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„vf:yÏkÒyÎN_ÑS .NET _8^„v'^ûy¨R0RYtå‹_8^„v'^„vXh'^„vpeîv0S_ÛeQ_8^Yt z^öedk¡‹pehVÍ‘n:N 0ÿàVdkL]WY_8^\>f:yYt z^Xhñm¦^„vYt z^0dk¡‹pehV N/fNµköeô•„vs^GWf:ygÑ$N*N7h,g-N‰Km„v\2Lˆôf°e ÿ €ŠxehV„v\2Lˆôf°e ÿ €ŠxehV„v100s) @b"uu[o(WHeý€OUL˜„vc:yhV0 PŠxehVo˜:y„v N/fBf“•„vs^GW 100s) udløste undtagelser. Tælleren angiver ikke et gennemsnit over en længere periode men viser forskellen mellem de værdier, der er observeret i de to sidste eksempler, divideret med varigheden af eksempelintervallet. TOTAL_EXCEP_FILTERS_RUN_006_NAME=Antal filtre pr. sek. TOTAL_EXCEP_FILTERS_RUN_006_HELP=Denne tæller viser antallet af .NET-undtagelsesfiltre, der er udført pr. sekund. Et undtagelsesfilter evaluerer, om en undtagelse skal afviklet eller ej. Tælleren sporer antallet af undtagelsesfiltre, som er evalueret, uanset om undtagelsen er afviklet eller ej. Tælleren angiver ikke et gennemsnit over en længere periode men viser forskellen mellem de værdier, der er observeret i de to sidste eksempler, divideret med varigheden af eksempelintervallet. TOTAL_EXCEP_FINALLYS_RUN_006_NAME=Antal Finally-blokke pr. sek. TOTAL_EXCEP_FINALLYS_RUN_006_HELP=Denne tæller viser det antal finally-blokke, der er udført pr. sekund. En finally-blok udføres med garanti, uanset hvordan try-blokken blev afsluttet. Kun de finally-blokke, der er udført for en undtagelse, bliver talt. Finally-blokke på normale kodestier bliver ikke talt af denne tæller. Tælleren angiver ikke et gennemsnit over en længere periode men viser forskellen mellem de værdier, der er observeret i de to sidste eksempler, divideret med varigheden af eksempelintervallet. EXCEPT_STACK_DEPTH_006_NAME=Antal stakrammer til udløsning pr. sek. EXCEPT_STACK_DEPTH_006_HELP=Denne tæller viser antallet af stakrammer, der krydses fra den ramme, som har udløst .NET-undtagelsen, til den ramme, der har afviklet undtagelsen, pr. sekund. Tælleren nulstilles, når der angives en undtagelsesbehandler, så indlejrede undtagelser vil vise stakdybden fra behandler til behandler. Tælleren angiver ikke et gennemsnit over en længere periode men viser forskellen mellem de værdier, der er observeret i de to sidste eksempler, divideret med varigheden af eksempelintervallet. DotNetCLR_Memory_OBJECT_007_NAME=.NET CLR-Speicher DotNetCLR_Memory_OBJECT_007_HELP=Zähler für CLR Garbage Collection Heap. GEN0_COLLECTIONS_COUNTER_007_NAME=Auflistungsanzahl der Generation 0 GEN0_COLLECTIONS_COUNTER_007_HELP=Dieser Zähler zeigt an, wie oft die Objekte der Generation 0 (die zuletzt zugeordneten Objekte) seit dem Anwendungsstart in die Garbage collection (Gen 0 GC) aufgenommen wurden. Gen 0 GC tritt auf, wenn in Generation 0 nicht genügend Speicher verfügbar ist, um eine Zuordnungsanforderung auszuführen. Der Zähler wird am Ende einer Gen 0 GC erhöht. Die höheren GCs enthalten alle niedrigeren GCs. Der Zähler wird explizit erhöht, wenn eine höhere Generation (Gen 1 oder Gen 2) GC auftritt. Der Zählerwert _Global_ ist falsch und sollte ignoriert werden. Der Zähler zeigt den letzten Wert an. GEN1_COLLECTIONS_COUNTER_007_NAME=Auflistungsanzahl der Generation 1 GEN1_COLLECTIONS_COUNTER_007_HELP=Dieser Zähler zeigt an, wie oft die Objekte der Generation 1 seit dem Anwendungsstart in die Garbage collection (Gen 0 GC) aufgenommen wurden. Der Zähler wird am Ende einer Gen 1 GC erhöht. Die höheren GCs enthalten alle niedrigeren GCs. Der Zähler wird explizit erhöht, wenn eine höhere Generation (Gen 2) GC auftritt. Der Zählerwert _Global_ ist falsch und sollte ignoriert werden. Der Zähler zeigt den letzten Wert an. GEN2_COLLECTIONS_COUNTER_007_NAME=Auflistungsanzahl der Generation 2 GEN2_COLLECTIONS_COUNTER_007_HELP=Dieser Zähler zeigt an, wie oft die Objekte der Generation 2 (älter) seit dem Anwendungsstart in die Garbage collection (Gen 0 GC) aufgenommen wurden. Der Zähler wird am Ende einer Gen 2 GC (Vollständige GC) erhöht. Der Zählerwert _Global_ ist falsch und sollte ignoriert werden. Der Zähler zeigt den letzten Wert an. GEN0_BYTES_PROMOTED_COUNTER_007_NAME=Von Generation 0 avancierter Speicher GEN0_BYTES_PROMOTED_COUNTER_007_HELP=Dieser Zähler zeigt die Größe des Arbeitsspeichers in Bytes an, der nicht in die Garbage collection (GC) aufgenommen und von Generation 0 zu Generation 1 hochgestuft wurde. Objekte, die nur hochgestuft werden, da sie auf die Beendigung warten, sind nicht in diesem Zähler enthalten. Der Zähler zeigt den Wert am Ende der letzten GC an. Der Zähler ist nicht kumulativ. GEN1_BYTES_PROMOTED_COUNTER_007_NAME=Von Generation 1 avancierter Speicher GEN1_BYTES_PROMOTED_COUNTER_007_HELP=Dieser Zähler zeigt die Größe des Arbeitsspeichers in Bytes an, der nicht in die Garbage Collection (GC) aufgenommen und von Generation 1 zu Generation 2 hochgestuft wurde. Objekte, die nur hochgestuft werden, da sie auf die Beendigung warten, sind nicht in diesem Zähler enthalten. Der Zähler zeigt den Wert am Ende der letzten GC an. Der Zähler ist nicht kumulativ. Der Zähler wird auf 0 zurückgesetzt, wenn die letzte GC nur eine Gen 0 GC war. GEN0_PROMOTION_RATE_007_NAME=Von Generation 0 avancierte Bytes/Sek. GEN0_PROMOTION_RATE_007_HELP=Dieser Zähler zeigt die Bytes pro Sekunde an, die von Generation 0 (neueste) zu Generation 1 hochgestuft werden. Objekte, die nur hochgestuft werden, da sie auf die Beendigung warten, sind nicht in diesem Zähler enthalten. Der Speicher wird hochgestuft, wenn er nicht in eine Garbage Collection aufgenommen wurde. Der Zähler wurde als Indikator von relativ langlebigen Objekten entworfen, die pro Sekunde erstellt werden. Der Zählen zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. GEN1_PROMOTION_RATE_007_NAME=Von Generation 1 avancierte Bytes/Sek. GEN1_PROMOTION_RATE_007_HELP=Dieser Zähler zeigt die Bytes pro Sekunde an, die von Generation 1 zu Generation 2 (älteste) hochgestuft werden. Objekte, die nur hochgestuft werden, da sie auf die Beendigung warten, sind nicht in diesem Zähler enthalten. Der Speicher wird hochgestuft, wenn er nicht in eine Garbage Collection aufgenommen wurde. Von Generation 2 werden keine Objekte hochgestuft, da sie die älteste Generation ist. Der Zähler wurde als Indikator von sehr langlebigen Objekten entworfen, die pro Sekunde erstellt werden. Der Zählen zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_007_NAME=Von Gen 0 hochgestufter Finalization-Speicher GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_007_HELP=Dieser Zähler zeigt die Größe des Arbeitsspeichers in Bytes an, von Generation 0 zu Generation 1 hochgestuft wurde, da er auf die Beendigung wartet. Der Zähler zeigt den Wert am Ende der letzten GC an. Der Zähler ist nicht kumulativ. PROCESS_ID_007_NAME=Prozess-ID PROCESS_ID_007_HELP=Dieser Zähler zeigt die Prozess-ID der überwachten CLR-Prozessinstanz an. Der angezeigte Wert bleibt bis zur ersten Garbage Collection 0. GEN0_HEAP_SIZE_COUNTER_007_NAME=Heapgröße der Generation 0 GEN0_HEAP_SIZE_COUNTER_007_HELP=Dieser Zähler zeigt die maximale Anzahl der Bytes an, die in Generation 0 (Gen 0) zugeordnet werden können. Die aktuelle Anzahl der in Gen 0 zugeordneten Bytes wird nicht angezeigt. Eine Gen 0 GC wird ausgelöst, wenn die Zuordnung seit der letzten GC diesen Wert überschreitet size. Die Größe von Gen 0 wird vom Garbage Collector festgelegt und kann sich während dem Ausführen der Anwendung ändern. Am Ende einer Gen 0-Collection beträgt die Größe des Gen 0-Heaps 0 Bytes. Der Zähler zeigt die Größe (in Bytes) von Zuordnungen an, die die nächste Gen 0 GC auslösen. Der Zähler wird am Ende einer GC aktualisiert; nicht bei jeder Zuordnung. GEN1_HEAP_SIZE_COUNTER_007_NAME=Heapgröße der Generation 1 GEN1_HEAP_SIZE_COUNTER_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Bytes in Generation 1 (Gen 1) an. Die maximale Größe von Gen 1 wird nicht angezeigt. Objekte werden in dieser Generation nicht direkt zugeordnet, sondern von vorherigen Gen 0 GCs hochgestuft. Der Zähler wird am Ende einer GC aktualisiert; nicht bei jeder Zuordnung. GEN2_HEAP_SIZE_COUNTER_007_NAME=Heapgröße der Generation 2 GEN2_HEAP_SIZE_COUNTER_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Bytes in Generation 2 (Gen 2) an. Objekte werden in dieser Generation nicht direkt zugeordnet, sondern von Gen 1 während vorherigen Gen 1 GCs hochgestuft. Der Zähler wird am Ende einer GC aktualisiert; nicht bei jeder Zuordnung. LARGE_OBJECT_SIZE_COUNTER_007_NAME=Objektheapgröße LARGE_OBJECT_SIZE_COUNTER_007_HELP=Dieser Zähler zeigt die aktuelle Größe des großen Objektheaps in Bytes an. Objekte, die größer als ein Schwellenwert sind, werden vom Garbage Collector als große Objekte behandelt und direkt in einem speziellen Heap zugeordnet. Sie werden nicht über Generationen hochgestuft. In CLR v1.1 und höher entspricht dieser Schwellenwert 85000 Bytes. Der Indikator wird am Ende einer GC aktualisiert, nicht bei jeder Speicherbelegung. SURVIVE_FINALIZE_COUNTER_007_NAME=Aufgrund ausstehender Objektfestlegung beibehaltene Objekte SURVIVE_FINALIZE_COUNTER_007_HELP=Dieser Zähler zeigt die Anzahl der Objekt in der Garbage Collection an, die beibehalten werden, da sie auf die Beendigung warten. Wenn die Objekte Verweise auf andere Objekte enthalten, werden diese ebenfalls beibehalten, aber nicht gezählt. Die Zähler "Von Gen 0 hochgestufter Finalization-Speicher" und "Von Gen 1 hochgestufter Finalization-Speicher" stellen den gesamten Speicher dar, der beibehalten wurde. Der Zähler ist nicht kumulativ. Er wird am Ende einer GC mit den beibehaltenen Objekten aktualisiert. Der Zähler zeigt die zusätzlichen Objekte an, die die Anwendung aufgrund der Beendigung möglicherweise übernimmt. NUM_HANDLES_COUNTER_007_NAME=Anzahl der GC-Handle NUM_HANDLES_COUNTER_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der verwendeten G-Handles an. GCHandles sind Handles für externe CLR-Ressourcen und der verwalteten Umgebung. Die Handles belegen nur wenig Arbeitsspeicher im GCHeap, aber wertvolle nicht verwaltete Ressourcen. ALLOCATION_RATE_COUNTER_007_NAME=Zugeordnete Bytes/Sek. ALLOCATION_RATE_COUNTER_007_HELP=Dieser Zähle zeigt die Rate der Bytes pro Sekunde an, die im GC-Heap zugeordnet werden. Der Zähler wird am Ende der GC aktualisiert, nicht bei jeder Zuordnung. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. INDUCED_GC_COUNTER_007_NAME=Anzahl der ausgelösten GC INDUCED_GC_COUNTER_007_HELP=Dieser Zähler zeigt an, wie oft die Garbage Collection aufgrund eines expliziten Aufrufs an GC.Collect maximal ausgeführt wurde. Die GC sollte die Frequenz ihrer Collections selbst festlegen. PER_TIME_IN_GC_COUNTER_007_NAME=GC-Zeitdauer in Prozent PER_TIME_IN_GC_COUNTER_007_HELP=Die GC-Zeitdauer in Prozent gibt die verstrichene Zeitdauer für eine Garbage Collection (GC) an, die seit dem letzten GC-Zyklus ausgeführt wurde. Der Zähler zeigt gewöhnlich an, wieviel Speicher vom Garbage Collector für die Anwendung gesammelt und komprimiert wurde. Der Zähler wird nur am Ende einer GC aktualisiert. Der Zählerwert reflektiert den letzten Wert; er gibt keinen Durchschnitt an. PER_TIME_IN_GC_COUNTER_BASE_007_NAME=Nicht angezeigt PER_TIME_IN_GC_COUNTER_BASE_007_HELP=Nicht angezeigt. TOTAL_HEAP_SIZE_COUNTER_007_NAME=Anzahl der Bytes in den Heaps TOTAL_HEAP_SIZE_COUNTER_007_HELP=Dieser Zähler stellt die Summe aus den vier anderen Zählern dar: Gen 0-Heapgröße, Gen 1-Heapgröße, Gen 2-Heapgröße und die Large Object-Heapgröße. Dieser Zähler zeigt den in den GC-Heaps zugeordneten Speicher in Bytes an. TOTAL_COMMITTED_MEM_COUNTER_007_NAME=Festgelegte Bytes insgesamt TOTAL_COMMITTED_MEM_COUNTER_007_HELP=Dieser Zähler zeigt den virtuellen Speicher in Bytes an, der vom Garbage Collector reserviert wurde. (Reservierter Arbeitsspeicher ist der physische Speicher, der in der Auslagerungsdatei des Datenträgers reserviert wird). TOTAL_RESERVED_MEM_COUNTER_007_NAME=Gesamtanzahl der reservierten Bytes TOTAL_RESERVED_MEM_COUNTER_007_HELP=Dieser Zähler zeigt den virtuellen Speicher in Bytes an, der vom Garbage Collector reserviert wird. (Reservierter Speicher ist der virtuelle Arbeitsspeicher, der für die Anwendung reserviert wird.) GC_PINNED_OBJECTS_007_NAME=Anzahl der fixierten Objekte GC_PINNED_OBJECTS_007_HELP=Dieser Zähler zeigt die Anzahl der fixierten Objekte in der letzten GC an. Der Zähler verfolgt die fixierten Objekte nur in den Heaps in der Garbage Collection. Eine Gen 0 GC verursacht z.B. die Enumeration der fixierten Objekte nur im Generation 0-Heap. Ein fixiertes Objekt kann nicht vom Garbage Collector in den Speicher verschoben werden. GC_SINKBLOCKS_007_NAME=Anzahl der verwendeten Sinkblöcke GC_SINKBLOCKS_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der verwendeten Synchronisierungsblöcke an. Synchronisierungsblöcke sind die Datenstrukturen pro Objekt, die zum Speichern der Synchronisierungsinformationen zugeordnet werden. Synchronisierungsblöcke enthalten Weak-Verweise auf verwaltete Objekte und müssen vom Garbage Collector überprüft werden. In Synchronisierungsblöcken können auch COM-Interop-Metadaten gespeichert werden. Der Zähler zeigt Leistungsprobleme an, die auftreten, wenn die Synchronisierungsprimitiven zu oft verwendet werden. DotNetCLR_Loading_OBJECT_007_NAME=.NET CLR-Ladevorgang DotNetCLR_Loading_OBJECT_007_HELP=Statistiken für das CLR-Klassenladeprogramm. LOADING_CLASSES_TOTAL_007_NAME=Gesamtanzahl der geladenen Klassen LOADING_CLASSES_TOTAL_007_HELP=Dieser Zähler zeigt die kumulative Anzahl der Klassen an, die in allen Assemblys seit dem Start der Anwendung geladen wurden. LOADING_TIME_007_NAME=Ladezeit in Prozent LOADING_TIME_007_HELP=Für die zukünftige Verwendung reserviert. LOADING_ASMSEARCHLEN_007_NAME=Assemblysuchlänge LOADING_ASMSEARCHLEN_007_HELP=Für die zukünftige Verwendung reserviert. LOADING_LOADFAILURES_TOTAL_007_NAME=Gesamtanzahl der Ladefehler LOADING_LOADFAILURES_TOTAL_007_HELP=Dieser Zähler zeigt die Höchstanzahl der Klassen an, die seit dem Start der Anwendung nicht geladen werden konnten. Möglicherweise ist die Sicherheit unangemessen oder das Format ist ungültig. Weitere Informationen finden Sie in der Hilfe. LOADING_LOADFAILURES_INST_007_NAME=Rate der Ladefehler LOADING_LOADFAILURES_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Klassen pro Sekunde an, die nicht geladen werden konnten. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. Die Ladefehler können mehrere Ursachen haben; z.B. unzureichende Sicherheit oder ein ungültiges Format. Weitere Informationen finden Sie in der Hilfe. LOADING_HEAPSIZE_007_NAME=Bytes im Lademodulheap LOADING_HEAPSIZE_007_HELP=Dieser Zähler zeigt die aktuelle Größe (in Bytes) des Arbeitsspeichers an, der vom Klassenladeprogramm in allen Anwendungsdomänen reserviert wurde. (Reservierter Arbeitsspeicher ist der physische Speicher, der in der Auslagerungsdatei des Datenträgers reserviert wird.) LOADING_APPDOMAINS_UNLOADED_TOTAL_007_NAME=Gesamtanzahl der entladenen Anwendungsdomänen LOADING_APPDOMAINS_UNLOADED_TOTAL_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Anwendungsdomänen an, die seit dem Anwendungsstart entladen wurden. Wenn eine Anwendungsdomäne mehrmals geladen und entladen wird, werden die Entladevorgänge einzeln gezählt. LOADING_APPDOMAINS_UNLOADED_INST_007_NAME=Rate der entladenen Anwendungsdomänen LOADING_APPDOMAINS_UNLOADED_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Anwendungsdomänen an, die pro Sekunde entladen werden. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. LOADING_CLASSES_CUR_007_NAME=Aktuelle geladene Klassen LOADING_CLASSES_CUR_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der in allen Assemblys geladenen Klassen an. LOADING_CLASSES_INST_007_NAME=Rate der geladenen Klassen LOADING_CLASSES_INST_007_HELP=Dieser Zähler zeigt die Anzahl der pro Sekunden in allen Assemblys geladenen Klassen an. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. LOADING_APPDOMAINS_CUR_007_NAME=Aktuelle Anwendungsdomänen LOADING_APPDOMAINS_CUR_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Anwendungsdomänen an, die in der Anwendung geladen sind. Anwendungsdomänen stellen eine sichere und vielseitige Verarbeitungseinheit bereit, mit der die CLR Anwendungen isolieren kann, die im gleichen Prozess ausgeführt werden. LOADING_APPDOMAINS_TOTAL_007_NAME=Anwendungsdomänen insgesamt LOADING_APPDOMAINS_TOTAL_007_HELP=Dieser Zähler zeigt die Höchstanzahl der Anwendungsdomänen an, die seit dem Starten Anwendung geladen wurden. Anwendungsdomänen stellen eine sichere und vielseitige Verarbeitungseinheit bereit, mit der die CLR Anwendungen isolieren kann, die im gleichen Prozess ausgeführt werden. LOADING_APPDOMAINS_INST_007_NAME=Rate der Anwendungsdomänen LOADING_APPDOMAINS_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Anwendungsdomänen an, die pro Sekunde geladen werden. Anwendungsdomänen stellen eine sichere und vielseitige Verarbeitungseinheit bereit, mit der die CLR Anwendungen isolieren kann, die im gleichen Prozess ausgeführt werden. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. LOADING_ASSEMBLIES_CUR_007_NAME=Aktuelle Assemblys LOADING_ASSEMBLIES_CUR_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Assemblys an, die in dieser Anwendung in allen Anwendungsdomänen geladen werden. Wenn die Assembly von mehreren Anwendungsdomänen als domänenneutral geladen wird, wird der Zähler nur einmal erhöht. Assemblys können als domänenneutral geladen werden, wenn ihr Code von allen Anwendungsdomänen gemeinsam genutzt werden kann. Assemblys können domänenspezifisch geladen werden, wenn ihr Code in der Anwendungsdomäne privat ist. LOADING_ASSEMBLIES_TOTAL_007_NAME=Assemblys insgesamt LOADING_ASSEMBLIES_TOTAL_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Assemblys an, die seit dem Start der Anwendung geladen wurden. Wenn die Assembly von mehreren Anwendungsdomänen als domänenneutral geladen wird, wird der Zähler nur einmal erhöht. Assemblys können als domänenneutral geladen werden, wenn ihr Code von allen Anwendungsdomänen gemeinsam genutzt werden kann. Assemblys können domänenspezifisch geladen werden, wenn ihr Code in der Anwendungsdomäne privat ist. LOADING_ASSEMBLIES_INST_007_NAME=Assemblyrate LOADING_ASSEMBLIES_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Assemblys an, die pro Sekunden in allen Anwendungsdomänen geladen werden. Wenn die Assembly von mehreren Anwendungsdomänen als domänenneutral geladen wird, wird der Zähler nur einmal erhöht. Assemblys können als domänenneutral geladen werden, wenn ihr Code von allen Anwendungsdomänen gemeinsam genutzt werden kann. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. DotNetCLR_Jit_OBJECT_007_NAME=.NET CLR-Jit DotNetCLR_Jit_OBJECT_007_HELP=Statistik für CLR-Jit. TOTAL_METHODS_JITTED_007_NAME=Anzahl der mit JIT kompilierten Methoden TOTAL_METHODS_JITTED_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Methoden an, die vom CLR JIT-Compiler seit dem Start der Anwendung kompiliert wurden. Die nicht JIT-Methoden sind in diesem Zähler nicht enthalten. JITTED_IL_CUR_007_NAME=Anzahl der mit JIT kompilierten IL-Bytes JITTED_IL_CUR_007_HELP=Dieser Zeiger zeigt die Gesamtanzahl der mit JIT kompilierten IL-Bytes seit dem Start der Anwendung an. Dieser Zähler ist mit dem Zähler "Gesamtanzahl der mit JIT kompilierten IL-Bytes" identisch. JITTED_IL_TOTAL_007_NAME=Gesamtanzahl der mit JIT kompilierten IL-Bytes JITTED_IL_TOTAL_007_HELP=Dieser Zeiger zeigt die Gesamtanzahl der mit JIT kompilierten IL-Bytes seit dem Start der Anwendung an. Dieser Zähler ist mit dem Zähler "Anzahl der mit JIT kompilierten IL-Bytes" identisch. JITTED_IL_INST_007_NAME=Mit JIT kompilierte IL-Bytes/Sek. JITTED_IL_INST_007_HELP=Dieser Zähler zeigt die JIT-Rate pro Sekunde für IL-Bytes an. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. JIT_FAILURES_007_NAME=JIT-Standardfehler JIT_FAILURES_007_HELP=Dieser Zähler zeigt die Höchstanzahl der Methoden an, die seit dem Start der Anwendung nicht mit dem JIT-Compiler kompiliert werden konnten. Dieses Problem kann auftreten, wenn die IL nicht überprüft werden kann, oder wenn ein interner Fehler im JIT-Compiler vorliegt. TIME_IN_JIT_007_NAME=JIT-Zeitdauer in Prozent TIME_IN_JIT_007_HELP=Dieser Zähler zeigt die verstrichene Zeit für die JIT-Kompilierung seit der letzten Kompilierungsphase in Prozent an. Der Zähler wird am Ende jeder JIT-Kompilierungsphase aktualisiert. Während einer JIT-Kompilierungsphase werden eine Methode und ihre Abhängigkeiten kompiliert. TIME_IN_JIT_BASE_007_NAME=Nicht angezeigt TIME_IN_JIT_BASE_007_HELP=Nicht angezeigt. DotNetCLR_Interop_OBJECT_007_NAME=.NET CLR-Interop DotNetCLR_Interop_OBJECT_007_HELP=Statistik für CLR-Interop. CURRENT_CCW_007_NAME=Anzahl der CCWs CURRENT_CCW_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der CCWs (Com-Callable-Wrappers) an. Ein CCW ist ein Proxy für das verwaltete .NET-Objekt, auf das von nicht verwalteten COM-Client verwiesen wird. Der Zähler zeigt die Anzahl der verwalteten Objekte an, auf die von nicht verwaltetem COM-Code verwiesen wird. CURRENT_STUBS_007_NAME=Anzahl der Stubs CURRENT_STUBS_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Stubs an, die von der CLR erstellt wurden. Stubs sind für das Marshallen von Argumenten und Rückgabewerten zwischen verwaltetem und nicht verwaltetem Code während einem COM-Interopaufruf oder PInvoke-Aufruf verantwortlich. NUM_MARSHALLING_007_NAME=Anzahl der Marshallvorgänge NUM_MARSHALLING_007_HELP=Dieser Zähler zeigt an, wie oft Argumente und Rückgabewerte zwischen verwaltetem und nicht verwaltetem Code seit dem Start der Anwendung gemarshallt wurden. Der Zähler wird nicht erhöht, wenn die Stubs intern sind. (Stubs sind für das Marshallen von Argumenten und Rückgabewerten verantwortlich). TOTAL_TLB_IMPORTS_007_NAME=Anzahl der TLB-Importe/Sek. TOTAL_TLB_IMPORTS_007_HELP=Für die zukünftige Verwendung reserviert. TOTAL_TLB_EXPORTS_007_NAME=Anzahl der TLB-Exporte/Sek. TOTAL_TLB_EXPORTS_007_HELP=Für die zukünftige Verwendung reserviert. DotNetCLR_LocksAndThreads_OBJECT_007_NAME=.NET CLR-Sperren und Threads DotNetCLR_LocksAndThreads_OBJECT_007_HELP=Statistik für CLR-Sperren und Threads. CONTENTION_TOTAL_007_NAME=Gesamtanzahl der Konflikte CONTENTION_TOTAL_007_HELP=Dieser Zähler zeigt an, wie oft die Threads in der CLR versucht haben, erfolglos eine verwaltete Sperre abzurufen. Verwaltete Sperren können mit mehreren Methoden abgerufen werden. Durch die Anweisung "lock" in C#, durch Aufrufen von System.Monitor.Enter oder mit dem benutzerdefinierten Attribut MethodImplOptions.Synchronized. CONTENTION_INST_007_NAME=Konfliktrate/Sek. CONTENTION_INST_007_HELP=Rate mit der die Threads in der Runtime versuchen, erfolglos eine verwaltete Sperre abzurufen. Verwaltete Sperren können mit mehreren Methoden abgerufen werden. Durch die Anweisung "lock" in C#, durch Aufrufen von System.Monitor.Enter oder mit dem benutzerdefinierten Attribut MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_007_NAME=Aktuelle Warteschlangenlänge QUEUE_LENGTH_CUR_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Threads an, die auf eine verwaltete Sperrung in der Anwendung warten. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den letzten Wert an. QUEUE_LENGTH_TOTAL_007_NAME=Maximale Warteschlangenlänge QUEUE_LENGTH_TOTAL_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Threads an, die seit dem Start der Anwendung auf eine verwaltete Sperrung warten. QUEUE_LENGTH_INST_007_NAME=Warteschlangenlänge/Sek. QUEUE_LENGTH_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Threads pro Sekunde an, die auf eine Sperrung der Anwendung warten. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. CURRENT_LOGICAL_THREADS_007_NAME=Anzahl der aktuellen logischen Threads CURRENT_LOGICAL_THREADS_007_HELP=Dieser Zähler zeigt die Anzahl der aktuellen .NET-Threadobjekte in der Anwendung an. Ein .NET-Threadobjekt wird von System.Threading.Thread erstellt, oder wenn ein nicht verwalteter Thread in die verwaltete Umgebung aufgenommen wird. Der Zähler verwaltet die Anzahl der ausgeführten und beendeten Threads. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den letzten Wert an. CURRENT_PHYSICAL_THREADS_007_NAME=Anzahl der aktuellen physischen Threads CURRENT_PHYSICAL_THREADS_007_HELP=Dieser Zähler zeigt die Anzahl der systemeigenen Betriebssystemthreads an, die von der CLR als untergeordnete .NET-Threadobjekte erstellt werden. Dieser Zählerwert enthält die Threads nicht, die von der CLR für interne Vorgänge verwendet werden. Er ist eine Teilmenge der Threads im Betriebssystemprozess. RECOGNIZED_THREADS_CUR_007_NAME=Anzahl der aktuellen erkannten Threads RECOGNIZED_THREADS_CUR_007_HELP=Dieser Zähler zeigt die Anzahl der Threads an, die von der CLR erkannt werden. Diesen Threads ist ein entsprechendes .NET-Threadobjekt zugewiesen. Die Threads werden außerhalb der CLR erstellt, aber wurden mindestens einmal in der CLR ausgeführt. Nur eindeutige Threads werden nachverfolgt. Threads mit der gleichen Thread-ID, die erneut in die CLR aufgenommen oder nach dem Beenden erstellt werden, werden nicht zweimal gezählt. RECOGNIZED_THREADS_TOTAL_007_NAME=Gesamtanzahl der erkannten Threads RECOGNIZED_THREADS_TOTAL_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Threads an, die von der CLR seit dem Start der Anwendung erkannt wurden. Diesen Threads ist ein entsprechendes .NET-Threadobjekt zugewiesen. Die Threads werden außerhalb der CLR erstellt, aber wurden mindestens einmal in der CLR ausgeführt. Nur eindeutige Threads werden nachverfolgt. Threads mit der gleichen Thread-ID, die erneut in die CLR aufgenommen oder nach dem Beenden erstellt werden, werden nicht zweimal gezählt. RECOGNIZED_THREADS_INST_007_NAME=Erkannte Threadrate/Sek. RECOGNIZED_THREADS_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Threads pro Sekunde an, die von der CLR erkannt wurden. Diesen Threads ist ein entsprechendes .NET-Threadobjekt zugeordnet. Die Threads werden nicht von der CLR, sondern außerhalb der CLR erstellt, aber mindestens einmal in der CLR ausgeführt. Nur eindeutige Threads werden nachverfolgt; Threads mit der gleichen Thread-ID, die in der CLR wiederholt oder erneut erstellt werden, werden nicht zweimal gezählt. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. DotNetCLR_Security_OBJECT_007_NAME=.NET CLR-Sicherheit DotNetCLR_Security_OBJECT_007_HELP=Statistik für die CLR-Sicherheit. SECURITY_TOTALRTCHECKS_007_NAME=Laufzeitüberprüfungen insgesamt SECURITY_TOTALRTCHECKS_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der CAS-Laufzeitüberprüfungen (Code Access Security) seit dem Start der Anwendung an. CAS-Laufzeitüberprüfungen werden ausgeführt wenn beim einem Aufruf eine bestimmte Berechtigung angefordert wird. Die Laufzeitüberprüfung wird für jeden Aufruf ausgeführt, indem der aktuelle Threadstapel des Aufrufers überprüft wird. Dieser Zähler gibt zusammen mit "Stapeltiefe" die Leistungseinbußen für Sicherheitsüberprüfungen an. SECURITY_TIMEAUTHORIZE_007_NAME=Zeit für die Signaturauthentifizierung in Prozent SECURITY_TIMEAUTHORIZE_007_HELP=Für die zukünftige Verwendung reserviert. SECURITY_LINKCHECKS_007_NAME=Anzahl der Verbindungszeitüberprüfungen SECURITY_LINKCHECKS_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der CAS-Überprüfungen (Code Access Security) seit dem Anwendungsstart an. CAS-Linktimeüberprüfen werden ausgeführt, wenn eine bestimmte Berechtigung während der JIT-Kompilierung aufgerufen wird. Eine Linktimeüberprüfung wird nur einmal pro Aufrufer ausgeführt. Dieser Wert zeigt keine Leistungsprobleme an, nur die Sicherheitssystemaktivitäten. SECURITY_TIMERTCHECKS_007_NAME=Zeit für die RT-Überprüfungen in Prozent SECURITY_TIMERTCHECKS_007_HELP=Dieser Zähler zeigt den Zeitraum an, der seit der letzten CAS-Überprüfung (Code Access Security) verstrichen ist. CAS ermöglicht unterschiedliche Vertrauensebenen für den Code und erzwingt die Ebenen abhängig von der Codeidentität. Der Zähler wird am Ende einer Sicherheitsüberprüfung aktualisiert. Er zeigt keinen Durchschnittswert, sondern den letzten Wert an. SECURITY_TIMERTCHECKS_BASE_007_NAME=Nicht angezeigt SECURITY_TIMERTCHECKS_BASE_007_HELP=Nicht angezeigt. SECURITY_DEPTHSECURITY_007_NAME=Stapeltiefe SECURITY_DEPTHSECURITY_007_HELP=Dieser Zähler zeigt die Stapeltiefe während der letzten Überprüfung der Codezugriffssicherheit zur Laufzeit an. Beim Überprüfen Codezugriffssicherheit zur Laufzeit wird der Stapel durchsucht. Der Zähler gibt keinen Durchschnittswert, sondern nur den letzten Wert an. DotNetCLR_Remoting_OBJECT_007_NAME=.NET CLR-Remote DotNetCLR_Remoting_OBJECT_007_HELP=Statistik für CLR-Remote. CONTEXT_REMOTECALLS_INST_007_NAME=Remoteaufrufe/Sek. CONTEXT_REMOTECALLS_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Remoteprozeduraufrufe pro Sekunde an. Ein Remoteprozeduraufruf ist ein Aufruf eines Objekts außerhalb der Anwendungsdomäne des Aufrufers. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. CONTEXT_CHANNELS_007_NAME=Channel CONTEXT_CHANNELS_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Remotechannel in den Anwendungsdomänen an, die seit dem Start der Anwendung registriert wurden. Channel werden zum Übertragen von Nachrichten zwischen Remoteobjekten verwendet. CONTEXT_PROXIES_007_NAME=Kontextproxys CONTEXT_PROXIES_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Remoteproxyobjekte an, die in diesem Prozess seit dem Start der Anwendung erstellt wurden. Proxyobjekte stellen die Remoteobjekte dar und stellen sicher, dass alle Proxyaufrufe an die entsprechende Remoteobjektinstanz weitergeleitet werden. CONTEXT_CLASSES_007_NAME=Geladene kontextgebundene Klassen CONTEXT_CLASSES_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der kontextgebundenen geladenen Klassen an. Klassen, die an einen Kontext gebunden werden können, sind kontextgebundene Klassen. Kontextgebundene Klassen werden mit Kontextattributen für die Synchronisierung, Threadaffinität, Transaktionen, usw. markiert. CONTEXT_OBJALLOC_007_NAME=Kontextgebundene Objektzuordnung/Sek. CONTEXT_OBJALLOC_007_HELP=Dieser Zähler zeigt die Anzahl der kontextgebundenen Objekte an, die pro Sekunde zugeordnet werden. Instanzen von Klassen, die an einen Kontext gebunden werden können, sind kontextgebundene Objekte. Kontextgebundene Klassen werden mit Kontextattributen für die Synchronisierung, Threadaffinität, Transaktionen, usw. markiert. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. CONTEXT_CONTEXTS_007_NAME=Kontext CONTEXT_CONTEXTS_007_HELP=Dieser Zähler zeigt die aktuelle Anzahl der Remotekontexte in der Anwendung an. Ein Kontext enthält eine Auflistung der Objekte mit den gleichen Syntaxregeln; z.B. Synchronisierung, Threadaffinität, Transaktionen, usw. CONTEXT_REMOTECALLS_TOTAL_007_NAME=Remoteaufrufe insgesamt CONTEXT_REMOTECALLS_TOTAL_007_HELP=Dieser Zähle zeigt die Gesamtanzahl der Remoteprozeduraufrufe an, die seit dem Start der Anwendung initialisiert wurden. Ein Remoteprozeduraufruf ist ein Aufruf eines Objekts außerhalb der Anwendungsdomäne des Aufrufers. DotNetCLR_Excep_OBJECT_007_NAME=.NET CLR-Ausnahmen DotNetCLR_Excep_OBJECT_007_HELP=Laufzeitstatistik für die CLR-Ausnahmebehandlung. EXCEP_THROWN_TOTAL_007_NAME=Anzahl der ausgelösten Ausnahmen EXCEP_THROWN_TOTAL_007_HELP=Dieser Zähler zeigt die Gesamtanzahl der Ausnahmen an, die seit dem Start der Anwendung ausgelöst wurden. TDiese schließen .NET-Ausnahmen und nicht verwaltete Ausnahmen ein, die in .NET-Ausnahmen konvertiert werden; z.B. wird eine Nullzeigerverweis-Ausnahme in nicht verwaltetem Code in eine .NET System.NullReferenceException in verwaltetem Code konvertiert. Dieser Zähler enthält behandelte und unbehandelte Ausnahmen. Erneut ausgelöste Ausnahmen, werden wieder gezählt. Ausnahmen sollten nur selten und nicht im normalen Programmablauf auftreten. EXCEP_THROWN_INST_007_NAME=Anzahl der ausgelösten Ausnahmen/Sek. EXCEP_THROWN_INST_007_HELP=Dieser Zähler zeigt die Anzahl der Ausnahmen pro Sekunde an. Diese schließen .NET-Ausnahmen und nicht verwaltete Ausnahmen ein, die in .NET-Ausnahmen konvertiert werden; z.B. wird eine Nullzeigerverweis-Ausnahme in nicht verwaltetem Code in eine .NET System.NullReferenceException in verwaltetem Code konvertiert. Dieser Zähler enthält behandelte und unbehandelte Ausnahmen. Ausnahmen sollten nur selten und nicht im normalen Programmablauf auftreten. Der Zähler zeigt potenzielle Leistungsprobleme an, die aufgrund einer großen Ausnahmerate auftreten. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. TOTAL_EXCEP_FILTERS_RUN_007_NAME=Anzahl der Filter/Sek. TOTAL_EXCEP_FILTERS_RUN_007_HELP=Dieser Zähler zeigt die Anzahl der .NET-Ausnahmefilter an, die pro Sekunde ausgeführt werden. Ein Ausnahmefilter wertet aus, ob eine Ausnahme behandelt werden soll. Der Zähler verfolgt die Rate der ausgewerteten Ausnahmefilter nach; ungeachtet davon, ob die Ausnahme behandelt wurde oder nicht. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. TOTAL_EXCEP_FINALLYS_RUN_007_NAME=Finallyanzahl/Sek. TOTAL_EXCEP_FINALLYS_RUN_007_HELP=Dieser Zähler zeigt die Anzahl der finally-Blöcke an, die pro Sekunde ausgeführt werden. Ein finally-Block wird ausgeführt, unabhängig davon, wie der try-Block beendet wurde. Nur die finally-Blöcke, die für eine Ausnahme ausgeführt werden, werden gezählt. finally-Blöcke in normalen Codepfaden werden nicht gezählt. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. EXCEPT_STACK_DEPTH_007_NAME=Throw-zu-Catch-Tiefe/s EXCEPT_STACK_DEPTH_007_HELP=Dieser Zähler zeigt die Anzahl der Stapelrahmen an, die vom Rahmen durchlaufen werden, der die .NET-Ausnahme ausgelöst hat. Der Zähler wird auf 0 zurückgesetzt, wenn ein Ausnahmehandler eingegeben wird. Der Zähler bildet nicht den Mittelwert aus der Zeit, sondern zeigt den Unterschied zwischen den Werten in den letzten zwei Beispielen geteilt durch das Beispielintervall an. DotNetCLR_Memory_OBJECT_008_NAME=œ½®¼· .NET CLR DotNetCLR_Memory_OBJECT_008_HELP=œµÄÁ·Ä­Â ³¹± Ä¿ ÃÉÁÌ ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ Ä¿Å CLR. GEN0_COLLECTIONS_COUNTER_008_NAME=‘Á¹¸¼Ì ÃÅ»»¿³Î½ Ä·Â ³µ½¹¬Â 0 GEN0_COLLECTIONS_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ĺ ƿÁ­Â À¿Å ­Çµ¹ ÀÁ±³¼±Ä¿À¿¹·¸µ¯ ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ Ãı ±½Ä¹ºµ¯¼µ½± Ä·Â ³µ½¹¬Â 0 (ı À¹¿ ÀÁÌÃƱı, ±ÅĬ À¿Å µºÇÉÁ®¸·º±½ ĵ»µÅı¯±) (GC Ä·Â ³µ½¹¬Â 0) ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. ¤¿ GC Ä·Â ³µ½¹¬Â 0 ³¯½µÄ±¹ Ìı½ · ´¹±¸­Ã¹¼· ¼½®¼· ±ÅĮ ķ ³µ½¹¬Â ´µ½ µÀ±Áºµ¯ ³¹± ½± ¹º±½¿À¿¹®Ãµ¹ ¼¹± ±¯Ä·Ã· µºÇÎÁ·Ã·Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC Ä·Â ³µ½¹¬Â 0. ¤± GC ¼µ³±»ÍĵÁ·Â ³µ½¹¬Â ÀµÁ¹»±¼²¬½¿Å½ Ì»± ı GC ¼¹ºÁÌĵÁɽ ³µ½¹Î½. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ Á·Ä¬ Ìı½ ÀÁ¿ºÍÀĵ¹ GC ¼µ³±»ÍĵÁ·Â ³µ½¹¬Â (³µ½¹¬ 1 ® ³µ½¹¬ 2). — Ĺ¼® ¼µÄÁ·Ä® _Global_ ´µ½ µ¯½±¹ ±ºÁ¹²®Â º±¹ ¸± ÀÁ­Àµ¹ ½± À±Á±²»µÆ¸µ¯. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. GEN1_COLLECTIONS_COUNTER_008_NAME=‘Á¹¸¼Ì ÃÅ»»¿³Î½ Ä·Â ³µ½¹¬Â 1 GEN1_COLLECTIONS_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ĺ ƿÁ­Â À¿Å ­Çµ¹ ÀÁ±³¼±Ä¿À¿¹·¸µ¯ ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ Ãı ±½Ä¹ºµ¯¼µ½± Ä·Â ³µ½¹¬Â 1 ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC ¼¹±Â ³µ½¹¬Â 1. ¤± GC ¼µ³±»ÍĵÁ·Â ³µ½¹¬Â ÀµÁ¹»±¼²¬½¿Å½ Ì»± ı GC ¼¹ºÁÌĵÁɽ ³µ½¹Î½. Ÿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ Á·Ä¬ Ìı½ ÀÁ¿ºÍÀĵ¹ GC ¼µ³±»ÍĵÁ·Â ³µ½¹¬Â (³µ½¹¬ 2). — Ĺ¼® ¼µÄÁ·Ä® _Global_ ´µ½ µ¯½±¹ ±ºÁ¹²®Â º±¹ ¸± ÀÁ­Àµ¹ ½± À±Á±²»µÆ¸µ¯. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. GEN2_COLLECTIONS_COUNTER_008_NAME=‘Á¹¸¼Ì ÃÅ»»¿³Î½ Ä·Â ³µ½¹¬Â 2 GEN2_COLLECTIONS_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ĺ ƿÁ­Â À¿Å ­Çµ¹ ÀÁ±³¼±Ä¿À¿¹·¸µ¯ ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ Ãı ±½Ä¹ºµ¯¼µ½± Ä·Â ³µ½¹¬Â 2 (À±»±¹ÌĵÁ·) ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC Ä·Â ³µ½¹¬Â 2 (¿½¿¼¬¶µÄ±¹ º±¹ À»®ÁµÂ GC). — Ĺ¼® ¼µÄÁ·Ä® _Global_ ´µ½ µ¯½±¹ ±ºÁ¹²®Â º±¹ ¸± ÀÁ­Àµ¹ ½± À±Á±²»µÆ¸µ¯. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. GEN0_BYTES_PROMOTED_COUNTER_008_NAME= Á¿²¹²±Ã¼Ì ¼½®¼·Â ±ÀÌ Ä· ³µ½¹¬ 0 GEN0_BYTES_PROMOTED_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ ı byte Ä·Â ¼½®¼·Â À¿Å ±À¿¼­½¿Å½ ¼µÄ¬ Ä· ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ (GC) º±¹ ı ¿À¿¯± ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 0 ÃÄ· ³µ½¹¬ 1. ”µ½ ÀµÁ¹»±¼²¬½µ¹ ı ±½Ä¹ºµ¯¼µ½± À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ ÃÄ¿ Ä­»¿Â ĿŠĵ»µÅı¯¿Å GC, ´µ½ µ¯½±¹ ±¸Á¿¹ÃĹºÌÂ. GEN1_BYTES_PROMOTED_COUNTER_008_NAME= Á¿²¹²±Ã¼Ì ¼½®¼·Â ±ÀÌ Ä· ³µ½¹¬ 1 GEN1_BYTES_PROMOTED_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ ı byte Ä·Â ¼½®¼·Â À¿Å ±À¿¼­½¿Å½ ¼µÄ¬ Ä· ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ (GC) º±¹ ı ¿À¿¯± ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 1 ÃÄ· ³µ½¹¬ 2. ”µ½ ÀµÁ¹»±¼²¬½µ¹ ı ±½Ä¹ºµ¯¼µ½± À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ ÃÄ¿ Ä­»¿Â ĿŠĵ»µÅı¯¿Å GC, ´µ½ µ¯½±¹ ±¸Á¿¹ÃĹºÌÂ. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ¼·´µ½¯¶µÄ±¹ ¼Ì½¿ µ¬½ Ä¿ ĵ»µÅı¯¿ GC ®Ä±½ Ä·Â ³µ½¹¬Â 0. GEN0_PROMOTION_RATE_008_NAME=Byte ³µ½¹¬Â 0 À¿Å ÀÁ¿²¹²¬ÃÄ·º±½/´µÅĵÁÌ»µÀÄ¿ GEN0_PROMOTION_RATE_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ ı byte À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 0 (½µÌĵÁ·) ÃÄ· ³µ½¹¬ 1 ±½¬ ´µÅĵÁÌ»µÀÄ¿. ”µ½ ÀµÁ¹»±¼²¬½µ¹ ı ±½Ä¹ºµ¯¼µ½± À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. Ÿ ÀÁ¿²¹²±Ã¼Ì ķ ¼½®¼·Â ÀÁ±³¼±Ä¿À¿¹µ¯Ä±¹ ¼µÄ¬ Ä·½ ¿»¿º»®ÁÉ÷ ¼¹±Â ÃÅ»»¿³®Â ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ É ­½´µ¹¾· ³¹± ı ±½Ä¹ºµ¯¼µ½± ÃǵĹº¬ ¼µ³¬»·Â ´¹¬Áºµ¹±Â À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. GEN1_PROMOTION_RATE_008_NAME=Byte ³µ½¹¬Â 1 À¿Å ÀÁ¿²¹²¬ÃÄ·º±½/´µÅĵÁÌ»µÀÄ¿ GEN1_PROMOTION_RATE_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ ı byte À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 1 ÃÄ· ³µ½¹¬ 2 (À±»±¹ÌĵÁ·). ”µ½ ÀµÁ¹»±¼²¬½µ¹ ı ±½Ä¹ºµ¯¼µ½± À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. Ÿ ÀÁ¿²¹²±Ã¼Ì ķ ¼½®¼·Â ÀÁ±³¼±Ä¿À¿¹µ¯Ä±¹ ¼µÄ¬ Ä·½ ¿»¿º»®ÁÉ÷ ¼¹±Â ÃÅ»»¿³®Â ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½. š±½­½± ÃÄ¿¹Çµ¯¿ ´µ½ ÀÁ¿²¹²¬¶µÄ±¹ ±ÀÌ Ä· ³µ½¹¬ 2 µÆÌÿ½ ±ÅÄ® µ¯½±¹ · À±»±¹ÌĵÁ·. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ É ­½´µ¹¾· ³¹± ı ±½Ä¹ºµ¯¼µ½± À¿»Í ¼µ³¬»·Â ´¹¬Áºµ¹±Â À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_008_NAME= Á¿²¹²±Ã¼Ì ¼½®¼·Â ¿»¿º»®ÁÉ÷ ±ÀÌ Ä· ³µ½¹¬ 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ ı byte Ä·Â ¼½®¼·Â À¿Å ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 0 ÃÄ· ³µ½¹¬ 1 µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. Ÿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä·½ Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ ÃÄ¿ Ä­»¿Â ĿŠĵ»µÅı¯¿Å GC, ´µ½ µ¯½±¹ ±¸Á¿¹ÃĹºÌÂ. PROCESS_ID_008_NAME=‘½±³½ÉÁ¹ÃĹºÌ ´¹µÁ³±Ã¯±Â PROCESS_ID_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ±½±³½ÉÁ¹ÃĹºÌ ´¹µÁ³±Ã¯±Â Ä·Â À±Á¿Åï±Â Ä·Â ´¹µÁ³±Ã¯±Â CLR À¿Å À±Á±º¿»¿Å¸µ¯Ä±¹. — Ĺ¼® À¿Å µ¼Æ±½¯¶µÄ±¹ ¸± µ¯½±¹ 0 ¼­ÇÁ¹ Ä·½ ÀÁÎÄ· ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½. GEN0_HEAP_SIZE_COUNTER_008_NAME=œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 0 GEN0_HEAP_SIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ¼­³¹ÃÄ¿ ±Á¹¸¼Ì byte À¿Å ¼À¿Á¿Í½ ½± µºÇÉÁ·¸¿Í½ ÃÄ· ³µ½¹¬ 0. ”µ½ ´·»Î½µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì byte À¿Å ­Ç¿Å½ ®´· µºÇÉÁ·¸µ¯ ÃÄ· ³µ½¹¬ 0. ˆ½± GC ±ÅĮ ķ ³µ½¹¬Â (Gen 0) µ½µÁ³¿À¿¹µ¯Ä±¹ Ìı½ ¿¹ µºÇÉÁ®Ãµ¹Â ±ÀÌ Ä¿ ĵ»µÅı¯¿ GC ÅÀµÁ²±¯½¿Å½ ±ÅÄÌ Ä¿ ¼­³µ¸¿Â. ¤¿ ¼­³µ¸¿Â Ä·Â ³µ½¹¬Â 0 ÁŸ¼¯¶µÄ±¹ ±ÀÌ Ä¿ Garbage Collector º±¹ ¼À¿Áµ¯ ½± ±»»¬¾µ¹ º±Ä¬ Ä· ´¹¬Áºµ¹± Ä·Â µºÄ­»µÃ·Â Ä·Â µÆ±Á¼¿³®Â. £Ä¿ Ä­»¿Â ¼¹±Â ÃÅ»»¿³®Â ±ÀÌ Ä· ³µ½¹¬ 0, Ä¿ ¼­³µ¸¿Â Ä¿Å ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 0 µ¯½±¹ ÃÄ·½ ÀÁ±³¼±Ä¹ºÌķı 0 byte. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ¼­³µ¸¿Â (õ byte) Äɽ µºÇÉÁ®ÃµÉ½ À¿Å ¸± µ½µÁ³¿À¿¹®Ã¿Å½ Ä¿ µÀ̼µ½¿ GC Ä·Â ³µ½¹¬Â 0. Ÿ ¼µÄÁ·Ä®Â µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC º±¹ Ìǹ õ º¬¸µ µºÇÎÁ·Ã·. GEN1_HEAP_SIZE_COUNTER_008_NAME=œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 1 GEN1_HEAP_SIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì byte ÃÄ· ³µ½¹¬ 1 (Gen 1). ”µ½ µ¼Æ±½¯¶µ¹ Ä¿ ¼­³¹ÃÄ¿ ¼­³µ¸¿Â Ä·Â ³µ½¹¬Â 1. ¤± ±½Ä¹ºµ¯¼µ½± ´µ½ µºÇÉÁ¿Í½Ä±¹ ±ÀµÅ¸µ¯±Â õ ±ÅÄ®½ Ä· ³µ½¹¬, ±»»¬ ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ ÀÁ¿·³¿Í¼µ½± GC Ä·Â ³µ½¹¬Â 0. Ÿ ¼µÄÁ·Ä®Â µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC º±¹ Ìǹ õ º¬¸µ µºÇÎÁ·Ã·. GEN2_HEAP_SIZE_COUNTER_008_NAME=œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 2 GEN2_HEAP_SIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì byte ÃÄ· ³µ½¹¬ 2 (Gen 2). ¤± ±½Ä¹ºµ¯¼µ½± ´µ½ µºÇÉÁ¿Í½Ä±¹ ±ÀµÅ¸µ¯±Â õ ±ÅÄ®½ Ä· ³µ½¹¬ ±»»¬ ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ³µ½¹¬ 1 º±Ä¬ Ä· ´¹¬Áºµ¹± ÀÁ¿·³¿Í¼µ½É½ GC Ä·Â ³µ½¹¬Â 1. Ÿ ¼µÄÁ·Ä®Â µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC º±¹ Ìǹ õ º¬¸µ µºÇÎÁ·Ã·. LARGE_OBJECT_SIZE_COUNTER_008_NAME=œ­³µ¸¿Â ÃÉÁ¿Í ¼µ³¬»É½ ±½Ä¹ºµ¹¼­½É½ LARGE_OBJECT_SIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ÄÁ­Ç¿½ ¼­³µ¸¿Â Ä¿Å ÃÉÁ¿Í ¼µ³¬»É½ ±½Ä¹ºµ¹¼­½É½ õ byte. ‘½Ä¹ºµ¯¼µ½± ¼µ³±»ÍĵÁ± ±ÀÌ Ä¿ ÌÁ¹¿ ±½Ä¹¼µÄÉÀ¯¶¿½Ä±¹ É ¼µ³¬»± ±½Ä¹ºµ¯¼µ½± ±ÀÌ Ä¿ Garbage Collector, µºÇÉÁ¿Í½Ä±¹ ±ÀµÅ¸µ¯±Â õ ­½±½ µ¹´¹ºÌ ÃÉÁÌ º±¹ ´µ½ ÀÁ¿²¹²¬¶¿½Ä±¹ ±ÀÌ Ä· ¼¯± ³µ½¹¬ ÃÄ·½ ¬»»·. £Ä·½ ­º´¿Ã· CLR 1.1 º±¹ õ ½µÌĵÁµÂ µº´Ìõ¹Â ±ÅÄÌ Ä¿ ÌÁ¹¿ ¹Ã¿Íı¹ ¼µ 85000 byte. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì GC º±¹ Ìǹ õ º¬¸µ µºÇÎÁ·Ã·. SURVIVE_FINALIZE_COUNTER_008_NAME=£Ä¿¹Çµ¯± µÀ¹²¯É÷ ±ÀÌ Ä·½ ¿Á¹ÃĹº¿À¿¯·Ã· SURVIVE_FINALIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ±½Ä¹ºµ¹¼­½É½ Ãı ¿À¿¯± ­Çµ¹ ÀÁ±³¼±Ä¿À¿¹·¸µ¯ ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ º±¹ ı ¿À¿¯± ±À¿¼­½¿Å½ ¼µÄ¬ Ä· ÃÅ»»¿³® µÀµ¹´® ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± ¿»¿º»®ÁÉ÷. •¬½ ±ÅĬ ı ±½Ä¹ºµ¯¼µ½± ±½±Æ­Á¿½Ä±¹ õ ¬»»± ±½Ä¹ºµ¯¼µ½±, ÄÌĵ À±Á±¼­½¿Å½ º±¹ ±ÅĬ ı ĵ»µÅı¯±, ±»»¬ ´µ½ ¼µÄÁ¹¿Í½Ä±¹ ±ÀÌ Ä¿½ ÃųºµºÁ¹¼­½¿ ¼µÄÁ·Ä®. Ÿ¹ ¼µÄÁ·Ä­Â "  Á¿²¹²±Ã¼Ì ¼½®¼·Â ¿»¿º»®ÁÉ÷ ±ÀÌ Ä· ³µ½¹¬ 0" º±¹ "  Á¿²¹²±Ã¼Ì ¼½®¼·Â ¿»¿º»®ÁÉ÷ ±ÀÌ Ä· ³µ½¹¬ 1" ±½Ä¹ÀÁ¿ÃÉÀµÍ¿Å½ Ì»· Ä· ¼½®¼· À¿Å ´¹±Ä·Á®¸·ºµ »Ì³É ¿»¿º»®ÁÉ÷Â. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¯½±¹ ±¸Á¿¹ÃĹºÌÂ, µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â º¬¸µ GC ¼µ Ä¿ À»®¸¿Â Äɽ ÃÄ¿¹Çµ¯É½ À¿Å ­Ç¿Å½ À±Á±¼µ¯½µ¹ ¼Ì½¿ º±Ä¬ Ä¿ ÃųºµºÁ¹¼­½¿ GC. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ ³¹± ½± ´µ¯Ç½µ¹ Ä·½ ÀÁÌøµÄ· µÀ¹²¬ÁŽ÷ À¿Å ¼À¿Áµ¯ ½± ÀÁ¿º±»­Ãµ¹ · µÆ±Á¼¿³® »Ì³É Ä·Â ¿»¿º»®ÁÉ÷Â. NUM_HANDLES_COUNTER_008_NAME=‘Á¹¸¼Ì ´µ¹ºÄν ǵ¹Á¹Ã¼¿Í Ä¿Å GC NUM_HANDLES_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì ´µ¹ºÄν ǵ¹Á¹Ã¼¿Í Ä¿Å GC À¿Å ÇÁ·Ã¹¼¿À¿¹¿Í½Ä±¹. Ÿ¹ ´µ¯ºÄµÂ ǵ¹Á¹Ã¼¿Í Ä¿Å GC µ¯½±¹ ´µ¯ºÄµÂ ǵ¹Á¹Ã¼¿Í ³¹± ÀÌÁ¿Å À¿Å µ¯½±¹ µ¾ÉĵÁ¹º¿¯ ³¹± Ä¿ CLR º±¹ Ä¿ ´¹±Çµ¹Á¹¶Ì¼µ½¿ ÀµÁ¹²¬»»¿½. Ÿ¹ ´µ¯ºÄµÂ ǵ¹Á¹Ã¼¿Í º±Ä±»±¼²¬½¿Å½ ¼¹ºÁ® À¿ÃÌķı ¼½®¼·Â ÃÄ¿ ÃÉÁÌ GC ±»»¬ ±À±¹Ä¿Í½ ´Å½·Ä¹º¬ ´±À±½·Á¿Í ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿Å ÀÌÁ¿ÅÂ. ALLOCATION_RATE_COUNTER_008_NAME=•ºÇÉÁ·¼­½± byte/´µÅĵÁÌ»µÀÄ¿ ALLOCATION_RATE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ byte À¿Å µºÇÉÁ¿Í½Ä±¹ ±½¬ ´µÅĵÁÌ»µÀÄ¿ ÃÄ¿ ÃÉÁÌ Ä¿Å GC. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â º¬¸µ GC, Ìǹ õ º¬¸µ µºÇÎÁ·Ã·. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. INDUCED_GC_COUNTER_008_NAME=‘Á¹¸¼Ì GC À¿Å ÀÁ¿º»®¸·º±½ INDUCED_GC_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ¼­³¹ÃÄ¿ ±Á¹¸¼Ì Æ¿Áν À¿Å ÀÁ±³¼±Ä¿À¿¹®¸·ºµ ¼¹± ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ »Ì³É Á·Ä®Â º»®Ã·Â ÃÄ¿ GC.Collect.  Á¿Äµ¯½µÄ±¹ ½± ±Æ®ÃµÄµ Ä¿ GC ½± ÁŸ¼¯¶µ¹ Ä· ÃÅǽÌķı Äɽ ÃÅ»»¿³Î½. PER_TIME_IN_GC_COUNTER_008_NAME=% ÇÁ̽¿Å ÃÄ¿ GC PER_TIME_IN_GC_COUNTER_008_HELP=¤¿ % ÇÁ̽¿Å ÃÄ¿ GC µ¯½±¹ Ä¿ À¿Ã¿ÃÄÌ Ä¿Å ÇÁ̽¿Å À¿Å ´±À±½®¸·ºµ ³¹± Ä· ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½ (GC) ±ÀÌ Ä¿½ ĵ»µÅı¯¿ ºÍº»¿ GC. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¯½±¹ ÃŽ®¸É ¼¹± ­½´µ¹¾· Ä·Â µÁ³±Ã¯±Â À¿Å ÀÁ±³¼±Ä¿À¿¹®¸·ºµ ±ÀÌ Ä¿ Garbage Collector ³¹± »¿³±Á¹±Ã¼Ì Ä·Â µÆ±Á¼¿³®Â ³¹± Ä· ÃÅ»»¿³® º±¹ Ä· ÃżÀͺ½É÷ Ä·Â ¼½®¼·Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µ½·¼µÁνµÄ±¹ ¼Ì½¿ ÃÄ¿ Ä­»¿Â º¬¸µ GC º±¹ · Ĺ¼® Ä¿Å ¼µÄÁ·Ä® ±½Ä¹ÀÁ¿ÃÉÀµÍµ¹ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ, Ìǹ Ä¿½ ¼­Ã¿ ÌÁ¿. PER_TIME_IN_GC_COUNTER_BASE_008_NAME=”µ½ µ¼Æ±½¯¶µÄ±¹ PER_TIME_IN_GC_COUNTER_BASE_008_HELP=”µ½ µ¼Æ±½¯¶µÄ±¹. TOTAL_HEAP_SIZE_COUNTER_008_NAME=‘Á¹¸¼Ì byte õ Ì»¿Å ĿÅ ÃÉÁ¿Í TOTAL_HEAP_SIZE_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¯½±¹ Ä¿ ¬¸Á¿¹Ã¼± ĵÃìÁɽ ¬»»É½ ¼µÄÁ·Äν: œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 0, œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 1, œ­³µ¸¿Â ÃÉÁ¿Í Ä·Â ³µ½¹¬Â 2 º±¹ œ­³µ¸¿Â ÃÉÁ¿Í ¼µ³¬»É½ ±½Ä¹ºµ¹¼­½É½. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ¯Ç½µ¹ Ä·½ ÄÁ­Ç¿Åñ ¼½®¼· õ byte À¿Å ­Çµ¹ µºÇÉÁ·¸µ¯ ÃÄ¿Å ÃÉÁ¿Í GC. TOTAL_COMMITTED_MEM_COUNTER_008_NAME=£Å½¿»¹ºÌ ±Á¹¸¼Ì º±Äµ¹»·¼¼­½É½ byte TOTAL_COMMITTED_MEM_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ¼­³µ¸¿Â Ä·Â µ¹º¿½¹º®Â ¼½®¼·Â (õ byte) À¿Å µ¯½±¹ º±Äµ¹»·¼¼­½· Ä· ÃųºµºÁ¹¼­½· ÃĹ³¼® ±ÀÌ Ä¿ Garbage Collector. (— º±Äµ¹»·¼¼­½· ¼½®¼· µ¯½±¹ · ÆÅùº® ¼½®¼· ³¹± Ä·½ ¿À¿¯± ­Çµ¹ ´µÃ¼µÅĵ¯ ÇÎÁ¿Â ÃÄ¿ ±Áǵ¯¿ õ»¹´¿À¿¯·Ã·Â Ä¿Å ´¯Ãº¿Å). TOTAL_RESERVED_MEM_COUNTER_008_NAME=£Å½¿»¹ºÌ ±Á¹¸¼Ì ´µÃ¼µÅ¼­½É½ byte TOTAL_RESERVED_MEM_COUNTER_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ¼­³µ¸¿Â Ä·Â µ¹º¿½¹º®Â ¼½®¼·Â (õ byte) À¿Å ´µÃ¼µÍµÄ±¹ Ä· ÃųºµºÁ¹¼­½· ÃĹ³¼® ±ÀÌ Ä¿ Garbage Collector. (”µÃ¼µÅ¼­½· ¼½®¼· µ¯½±¹ ¿ ÇÎÁ¿Â Ä·Â µ¹º¿½¹º®Â ¼½®¼·Â À¿Å ­Çµ¹ ´µÃ¼µÅĵ¯ ³¹± Ä·½ µÆ±Á¼¿³® ÇÉÁ¯Â ̼É ½± ­Çµ¹ ÇÁ·Ã¹¼¿À¿¹·¸µ¯ ¿ ´¯Ãº¿Â ® õ»¯´µÂ ºÍÁ¹±Â ¼½®¼·Â.) GC_PINNED_OBJECTS_008_NAME=‘Á¹¸¼Ì º±ÁƹÄÃɼ­½É½ ±½Ä¹ºµ¹¼­½É½ GC_PINNED_OBJECTS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì º±ÁƹÄÃɼ­½É½ ±½Ä¹ºµ¹¼­½É½ À¿Å µ½Ä¿À¯ÃÄ·º±½ ÃÄ¿ ĵ»µÅı¯¿ GC. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ À±Á±º¿»¿Å¸µ¯ ı º±ÁƹÄÃɼ­½± ±½Ä¹ºµ¯¼µ½± ¼Ì½¿ ÃÄ¿Å ÃÉÁ¿Í ÌÀ¿Å ÀÁ±³¼±Ä¿À¿¹®¸·ºµ ÃÅ»»¿³® ±À¿ÁÁ¹Æ¸­½Äɽ ÃÄ¿¹Çµ¯É½. “¹± À±Á¬´µ¹³¼±, ­½± GC Ä·Â ³µ½¹¬Â 0 ¸± ÀÁ¿º±»¿Íõ Ä·½ ±À±Á¯¸¼·Ã· Äɽ º±ÁƹÄÃɼ­½É½ ±½Ä¹ºµ¹¼­½É½ ¼Ì½¿ ÃÄ¿ ÃÉÁÌ Ä·Â ³µ½¹¬Â 0. ¤± º±ÁƹÄÃɼ­½± ±½Ä¹ºµ¯¼µ½± µ¯½±¹ ±½Ä¹ºµ¯¼µ½± À¿Å Ä¿ Garbage Collector ´µ½ ¼À¿Áµ¯ ½± ¼µÄ±º¹½®Ãµ¹ ÃÄ· ¼½®¼·. GC_SINKBLOCKS_008_NAME=‘Á¹¸¼Ì Äɽ ¼À»¿º ÃųÇÁ¿½¹Ã¼¿Í À¿Å ÇÁ·Ã¹¼¿À¿¹¿Í½Ä±¹ GC_SINKBLOCKS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì Äɽ ¼À»¿º ÃųÇÁ¿½¹Ã¼¿Í À¿Å ÇÁ·Ã¹¼¿À¿¹¿Í½Ä±¹. ¤± ¼À»¿º ÃųÇÁ¿½¹Ã¼¿Í µ¯½±¹ ´¿¼­Â ´µ´¿¼­½É½ ±½¬ ±½Ä¹ºµ¯¼µ½¿ À¿Å µºÇÉÁ¿Í½Ä±¹ ³¹± Ä·½ ±À¿¸®ºµÅ÷ À»·Á¿Æ¿Á¹Î½ ÃųÇÁ¿½¹Ã¼¿Í. ¤± ¼À»¿º ÃųÇÁ¿½¹Ã¼¿Í ÀµÁ¹­Ç¿Å½ ±Ã¸µ½µ¯Â ±½±Æ¿Á­Â õ ´¹±Çµ¹Á¹¶Ì¼µ½± ±½Ä¹ºµ¯¼µ½± º±¹ ÀÁ­Àµ¹ ½± ñÁν¿½Ä±¹ ±ÀÌ Ä¿ Garbage Collector. ¤± ¼À»¿º ±ÅĬ ´µ½ ÀµÁ¹¿Á¯¶¿½Ä±¹ ÃÄ·½ ±À¿¸®ºµÅ÷ À»·Á¿Æ¿Á¹Î½ ÃųÇÁ¿½¹Ã¼¿Í º±¹ ¼À¿Á¿Í½ µÀ¯Ã·Â ½± ±À¿¸·ºµÍ¿Å½ ¼µÄ±-´µ´¿¼­½± ´¹±»µ¹Ä¿ÅÁ³¹ºÌķı COM. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ ³¹± ½± ´µ¯Ç½µ¹ ÀÁ¿²»®¼±Ä± µÀ¹´Ìõɽ º±Ä¬ Ä·½ µ½Ä±Ä¹º® ÇÁ®Ã· ÃÄ¿¹Çµ¹É´Î½ ÄÍÀɽ ÃųÇÁ¿½¹Ã¼¿Í. DotNetCLR_Loading_OBJECT_008_NAME=¦ÌÁÄÉ÷ .NET CLR DotNetCLR_Loading_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± Ä· ÆÌÁÄÉ÷ º»¬ÃµÉ½ CLR. LOADING_CLASSES_TOTAL_008_NAME=£Í½¿»¿ º»¬ÃµÉ½ À¿Å Æ¿ÁÄθ·º±½ LOADING_CLASSES_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ º»¬ÃµÉ½ À¿Å Æ¿ÁÄθ·º±½ õ Ì»µÂ Ĺ ÃųºÁ¿Ä®Ãµ¹Â ±ÀÌ Ä·½ ­½±Á¾· ±ÅĮ ķ µÆ±Á¼¿³®Â. LOADING_TIME_008_NAME=% ÇÁ̽¿Å ÆÌÁÄÉ÷ LOADING_TIME_008_HELP=”µÃ¼µÅ¼­½¿ ³¹± ¼µ»»¿½Ä¹º® ÇÁ®Ã·. LOADING_ASMSEARCHLEN_008_NAME=œ®º¿Â Ä·Â ±½±¶®Ä·Ã·Â Ä·Â ÃųºÁÌķ÷ LOADING_ASMSEARCHLEN_008_HELP=”µÃ¼µÅ¼­½¿ ³¹± ¼µ»»¿½Ä¹º® ÇÁ®Ã·. LOADING_LOADFAILURES_TOTAL_008_NAME=£Å½¿»¹ºÌ ±Á¹¸¼Ì ±À¿ÄÅǹν ÆÌÁÄÉ÷ LOADING_LOADFAILURES_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ¼­³¹ÃÄ¿ ±Á¹¸¼Ì º»¬ÃµÉ½ À¿Å ±À­ÄÅDZ½ ½± Æ¿ÁÄɸ¿Í½ ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. ‘ÅÄ­Â ¿¹ ±À¿ÄÅÇ·¼­½µÂ ±ÀÌÀµ¹ÁµÂ ÆÌÁÄÉ÷ µ½´­ÇµÄ±¹ ½± ¿Æµ¯»¿½Ä±¹ õ À¿»»¿Í »Ì³¿Å ÌÀÉ õ ±½µÀ±Áº® ±ÃƬ»µ¹± ® õ ¼· ­³ºÅÁ· ¼¿ÁÆ®. ‘½±»ÅĹº­Â À»·Á¿Æ¿Á¯µÂ ¼À¿Áµ¯Äµ ½± ²Áµ¯Äµ ÃÄ· ²¿®¸µ¹± ³¹± Ĺ ÅÀ·ÁµÃ¯µÂ ÀÁ¿Æ¯». LOADING_LOADFAILURES_INST_008_NAME=¡Å¸¼Ì ±À¿ÄÅǹν ÆÌÁÄÉ÷ LOADING_LOADFAILURES_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì º»¬ÃµÉ½ À¿Å ±À­ÄÅDZ½ ½± Æ¿ÁÄɸ¿Í½ ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. ‘ÅÄ­Â ¿¹ ±À¿ÄÅǯµÂ ÆÌÁÄÉ÷ µ½´­ÇµÄ±¹ ½± ¿Æµ¯»¿½Ä±¹ õ À¿»»¿Í »Ì³¿Å ÌÀÉ õ ±½µÀ±Áº® ±ÃƬ»µ¹± ® õ ¼· ­³ºÅÁ· ¼¿ÁÆ®. ‘½±»ÅĹº­Â À»·Á¿Æ¿Á¯µÂ ¼À¿Áµ¯Äµ ½± ²Áµ¯Äµ ÃÄ· ²¿®¸µ¹± ³¹± Ĺ ÅÀ·ÁµÃ¯µÂ ÀÁ¿Æ¯». LOADING_HEAPSIZE_008_NAME=Byte ÃÄ¿ ÃÉÁÌ ÆÌÁÄÉ÷ LOADING_HEAPSIZE_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ÄÁ­Ç¿½ ¼­³µ¸¿Â (õ byte) Ä·Â ¼½®¼·Â À¿Å ­Çµ¹ º±Ä±»·Æ¸µ¯ ³¹± Ä· ÆÌÁÄÉ÷ º»¬ÃµÉ½ õ Ì»± ı AppDomain. (— º±Äµ¹»·¼¼­½· ¼½®¼· µ¯½±¹ · ÆÅùº® ¼½®¼· ³¹± Ä·½ ¿À¿¯± ­Çµ¹ ´µÃ¼µÅĵ¯ ÇÎÁ¿Â ÃÄ¿ ±Áǵ¯¿ õ»¹´¿À¿¯·Ã·Â Ä¿Å ´¯Ãº¿Å.) LOADING_APPDOMAINS_UNLOADED_TOTAL_008_NAME=£Í½¿»¿ appdomain Äɽ ¿À¿¯É½ · ÆÌÁÄÉ÷ ­Çµ¹ º±Ä±Á³·¸µ¯ LOADING_APPDOMAINS_UNLOADED_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ AppDomain Äɽ ¿À¿¯É½ · ÆÌÁÄÉ÷ ­Çµ¹ º±Ä±Á³·¸µ¯ ±ÀÌ Ä· ¼½®¼· ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. •¬½ · ÆÌÁÄÉ÷ µ½Ì AppDomain ÀÁ±³¼±Ä¿À¿¹®¸·ºµ º±¹ º±Ä±Á³®¸·ºµ À¿»»­Â Æ¿Á­Â, ¿ ¼µÄÁ·Ä®Â ¸± ¼µÄÁ®Ãµ¹ º¬¸µ º±Ä¬Á³·Ã· ÆÌÁÄÉ÷ ÇÉÁ¹ÃĬ. LOADING_APPDOMAINS_UNLOADED_INST_008_NAME=¡Å¸¼Ì º±Ä¬Á³·Ã·Â Ä·Â ÆÌÁÄÉ÷ appdomain LOADING_APPDOMAINS_UNLOADED_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ AppDomain Äɽ ¿À¿¯É½ · ÆÌÁÄÉ÷ º±Ä±Á³®¸·ºµ ±½¬ ´µÅĵÁÌ»µÀÄ¿. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. LOADING_CLASSES_CUR_008_NAME=¤Á­Ç¿Åõ º»¬Ãµ¹Â À¿Å Æ¿ÁÄθ·º±½ LOADING_CLASSES_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì º»¬ÃµÉ½ À¿Å Æ¿ÁÄθ·º±½ õ Ì»µÂ Ĺ ÃųºÁ¿Ä®Ãµ¹Â. LOADING_CLASSES_INST_008_NAME=¡Å¸¼Ì ÆÌÁÄÉ÷ º»¬ÃµÉ½ LOADING_CLASSES_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ º»¬ÃµÉ½ À¿Å Æ¿ÁÄθ·º±½ ±½¬ ´µÅĵÁÌ»µÀÄ¿ õ Ì»µÂ Ĺ ÃųºÁ¿Ä®Ãµ¹Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. LOADING_APPDOMAINS_CUR_008_NAME=¤Á­Ç¿½Ä± appdomain LOADING_APPDOMAINS_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì AppDomain À¿Å Æ¿ÁÄθ·º±½ õ ±ÅÄ®½ Ä·½ µÆ±Á¼¿³®. ¤± AppDomain (Ä¿¼µ¯Â µÆ±Á¼¿³®Â) À±Á­Ç¿Å½ ¼¹± ±ÃƱ»® º±¹ µÅ­»¹ºÄ· ¼¿½¬´± µÀµ¾µÁ³±Ã¯±Â À¿Å ¼À¿Áµ¯ ½± ÇÁ·Ã¹¼¿À¿¹®Ãµ¹ Ä¿ CLR ³¹± Ä·½ ±À¿¼Ì½É÷ Äɽ µÆ±Á¼¿³Î½ À¿Å µºÄµ»¿Í½Ä±¹ ÃÄ·½ ¯´¹± ´¹µÁ³±Ã¯±. LOADING_APPDOMAINS_TOTAL_008_NAME=£Í½¿»¿ Appdomain LOADING_APPDOMAINS_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ¼­³¹ÃÄ¿ ±Á¹¸¼Ì AppDomain À¿Å Æ¿ÁÄθ·º±½ ±ÀÌ Ä·½ ­½±Á¾· Ä·Â ÃųºµºÁ¹¼­½·Â µÆ±Á¼¿³®Â. ¤± AppDomain (Ä¿¼µ¯Â µÆ±Á¼¿³®Â) À±Á­Ç¿Å½ ¼¹± ±ÃƱ»® º±¹ µÅ­»¹ºÄ· ¼¿½¬´± µÀµ¾µÁ³±Ã¯±Â À¿Å ¼À¿Áµ¯ ½± ÇÁ·Ã¹¼¿À¿¹®Ãµ¹ Ä¿ CLR ³¹± Ä·½ ±À¿¼Ì½É÷ Äɽ µÆ±Á¼¿³Î½ À¿Å µºÄµ»¿Í½Ä±¹ ÃÄ·½ ¯´¹± ´¹µÁ³±Ã¯±. LOADING_APPDOMAINS_INST_008_NAME=¡Å¸¼Ì ÆÌÁÄÉ÷ appdomain LOADING_APPDOMAINS_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ AppDomain À¿Å Æ¿ÁÄθ·º±½ ±½¬ ´µÅĵÁÌ»µÀÄ¿. ¤± AppDomain (Ä¿¼µ¯Â µÆ±Á¼¿³®Â) À±Á­Ç¿Å½ ¼¹± ±ÃƱ»® º±¹ µÅ­»¹ºÄ· ¼¿½¬´± µÀµ¾µÁ³±Ã¯±Â À¿Å ¼À¿Áµ¯ ½± ÇÁ·Ã¹¼¿À¿¹®Ãµ¹ Ä¿ CLR ³¹± Ä·½ ±À¿¼Ì½É÷ Äɽ µÆ±Á¼¿³Î½ À¿Å µºÄµ»¿Í½Ä±¹ ÃÄ·½ ¯´¹± ´¹µÁ³±Ã¯±. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. LOADING_ASSEMBLIES_CUR_008_NAME=¤Á­Ç¿Åõ ÃųºÁ¿Ä®Ãµ¹Â LOADING_ASSEMBLIES_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì ÃųºÁ¿Ä®ÃµÉ½ À¿Å ­Ç¿Å½ Æ¿ÁÄɸµ¯ õ Ì»± ı AppDomain ±ÅĮ ķ µÆ±Á¼¿³®Â. •¬½ · ÃųºÁÌķ÷ ­Çµ¹ Æ¿ÁÄɸµ¯ ±½µ¾¬Áķı ±ÀÌ Ä¿¼­± ±ÀÌ À¿»»±À»¬ AppDomain ÄÌĵ ¿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ¼Ì½¿ ¼¯± Æ¿Á¬. Ÿ¹ ÃųºÁ¿Ä®Ãµ¹Â ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ ±½µ¾¬Áķı ±ÀÌ Ä¿¼µ¯Â, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ¼À¿Áµ¯ ½± µ¯½±¹ º¿¹½ÌÇÁ·ÃÄ¿Â ±ÀÌ Ì»± ı AppDomain ® ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ É ÃųºÁ¿Ä®Ãµ¹Â À¿Å ±Æ¿Á¿Í½ ­½±½ ÃųºµºÁ¹¼­½¿ Ä¿¼­±, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ÇÁ·Ã¹¼¿À¿¹µ¯Ä±¹ ¼Ì½¿ ±ÀÌ Ä¿ AppDomain. LOADING_ASSEMBLIES_TOTAL_008_NAME=£Í½¿»¿ ÃųºÁ¿Ä®ÃµÉ½ LOADING_ASSEMBLIES_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì ÃųºÁ¿Ä®ÃµÉ½ À¿Å ­Ç¿Å½ Æ¿ÁÄɸµ¯ ±ÀÌ Ä·½ ­½±Á¾· ±ÅĮ ķ µÆ±Á¼¿³®Â. •¬½ · ÃųºÁÌķ÷ ­Çµ¹ Æ¿ÁÄɸµ¯ ±½µ¾¬Áķı ±ÀÌ Ä¿¼­± ±ÀÌ À¿»»±À»¬ AppDomain ÄÌĵ ¿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ¼Ì½¿ ¼¯± Æ¿Á¬. Ÿ¹ ÃųºÁ¿Ä®Ãµ¹Â ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ ±½µ¾¬Áķı ±ÀÌ Ä¿¼µ¯Â, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ¼À¿Áµ¯ ½± µ¯½±¹ º¿¹½ÌÇÁ·ÃÄ¿Â ±ÀÌ Ì»± ı AppDomain ® ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ É ÃųºÁ¿Ä®Ãµ¹Â À¿Å ±Æ¿Á¿Í½ ­½±½ ÃųºµºÁ¹¼­½¿ Ä¿¼­±, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ÇÁ·Ã¹¼¿À¿¹µ¯Ä±¹ ¼Ì½¿ ±ÀÌ Ä¿ AppDomain. LOADING_ASSEMBLIES_INST_008_NAME=¡Å¸¼Ì ÆÌÁÄÉ÷ ÃųºÁ¿Ä®ÃµÉ½ LOADING_ASSEMBLIES_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ÃųºÁ¿Ä®ÃµÉ½ À¿Å Æ¿ÁÄθ·º±½ õ Ì»± ı AppDomain ±½¬ ´µÅĵÁÌ»µÀÄ¿. •¬½ · ÃųºÁÌķ÷ ­Çµ¹ Æ¿ÁÄɸµ¯ ±½µ¾¬Áķı ±ÀÌ Ä¿¼­± ±ÀÌ À¿»»±À»¬ AppDomain, ÄÌĵ ¿ ¼µÄÁ·Ä®Â µÀ±Å¾¬½µÄ±¹ ¼Ì½¿ ¼¯± Æ¿Á¬. Ÿ¹ ÃųºÁ¿Ä®Ãµ¹Â ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ ±½µ¾¬Áķı ±ÀÌ Ä¿¼µ¯Â, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ¼À¿Áµ¯ ½± µ¯½±¹ º¿¹½ÌÇÁ·ÃÄ¿Â ±ÀÌ Ì»± ı AppDomain ® ¼À¿Á¿Í½ ½± Æ¿ÁÄɸ¿Í½ É ÃųºÁ¿Ä®Ãµ¹Â À¿Å ±Æ¿Á¿Í½ ­½±½ ÃųºµºÁ¹¼­½¿ Ä¿¼­±, Ìı½ ¿ ºÎ´¹º¬Â Ä¿Å ÇÁ·Ã¹¼¿À¿¹µ¯Ä±¹ ¼Ì½¿ ±ÀÌ Ä¿ AppDomain. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. DotNetCLR_Jit_OBJECT_008_NAME=Jit .NET CLR DotNetCLR_Jit_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± Ä¿ Jit CLR. TOTAL_METHODS_JITTED_008_NAME=‘Á¹¸¼Ì ¼µ¸Ì´É½ À¿Å ­Ç¿Å½ ¼µÄ±³»ÉÄĹÃĵ¯ ¼µ ÇÁ®Ã· Ä¿Å JIT TOTAL_METHODS_JITTED_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ ¼µ¸Ì´É½ À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ just-in-time (JIT) ±ÀÌ Ä¿ ÀÁ̳Á±¼¼± ¼µÄ±³»ÎÄĹ÷ JIT CLR ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ ÀµÁ¹»±¼²¬½µ¹ Ĺ ¼µ¸Ì´¿Å À¿Å ÅÀ¿²»®¸·º±½ õ µÀµ¾µÁ³±Ã¯± ÀÁ¹½ Ä· ¼µÄ±³»ÎÄĹ÷ JIT. JITTED_IL_CUR_008_NAME=‘Á¹¸¼Ì byte IL À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ ¼µ ÇÁ®Ã· Ä¿Å JIT JITTED_IL_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ Ãͽ¿»¿ Äɽ byte IL À¿Å ­Ç¿Å½ ¼µÄ±³»ÉÄĹÃĵ¯ ¼µ ÇÁ®Ã· Ä¿Å JIT ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µ¯½±¹ ¹Ã¿´Í½±¼¿Â ¼µ Ä¿ ¼µÄÁ·Ä® "£Å½¿»¹ºÌ ±Á¹¸¼Ì byte IL À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ ¼µ ÇÁ®Ã· Ä¿Å JIT". JITTED_IL_TOTAL_008_NAME=£Å½¿»¹ºÌ ±Á¹¸¼Ì byte IL À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ ¼µ ÇÁ®Ã· Ä¿Å JIT JITTED_IL_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ Ãͽ¿»¿ Äɽ byte IL À¿Å ­Ç¿Å½ ¼µÄ±³»ÉÄĹÃĵ¯ ¼µ ÇÁ®Ã· Ä¿Å JIT ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â µ¯½±¹ ¹Ã¿´Í½±¼¿Â ¼µ Ä¿ ¼µÄÁ·Ä® "‘Á¹¸¼Ì byte IL À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ ¼µ ÇÁ®Ã· Ä¿Å JIT". JITTED_IL_INST_008_NAME=Byte IL À¿Å ¼µÄ±³»ÉÄįÃÄ·º±½ ¼µ ÇÁ®Ã· Ä¿Å JIT / ´µÅĵÁÌ»µÀÄ¿ JITTED_IL_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ÁŸ¼Ì ¼µÄ±³»ÎÄĹ÷ ¼µ ÇÁ®Ã· Ä¿Å JIT Äɽ byte IL ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. JIT_FAILURES_008_NAME=¤ÅÀ¹º­Â ±À¿ÄÅǯµÂ ¼µÄ±³»ÎÄĹ÷ ¼µ ÇÁ®Ã· Ä¿Å JIT JIT_FAILURES_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ¼­³¹ÃÄ¿ ±Á¹¸¼Ì Äɽ ¼µ¸Ì´É½ À¿Å Ä¿ ÀÁ̳Á±¼¼± ¼µÄ±³»ÎÄĹ÷ JIT ±À­ÄÅǵ ½± ¼µÄ±³»ÉÄįõ¹ ¼µ ÇÁ®Ã· Ä¿Å JIT ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. ‘ÅÄ® · ±À¿ÄÅǯ± ¼À¿Áµ¯ ½± Ãż²µ¯ µ¬½ Ä¿ IL ´µ½ ¼À¿Áµ¯ ½± µÀ±»·¸µÅĵ¯ ® µ¬½ ÅÀ®Á¾µ µÃÉĵÁ¹ºÌ ÃƬ»¼± ÃÄ¿ ÀÁ̳Á±¼¼± ¼µÄ±³»ÎÄĹ÷ JIT. TIME_IN_JIT_008_NAME=% ÇÁ̽¿Å ÃÄ¿ JIT TIME_IN_JIT_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ À¿Ã¿ÃÄÌ Ä¿Å ÇÁ̽¿Å À¿Å º±Ä±½±»Î¸·ºµ ÃÄ· ¼µÄ±³»ÎÄĹ÷ JIT ±ÀÌ Ä·½ ĵ»µÅı¯± Ƭ÷ ¼µÄ±³»ÎÄĹ÷ JIT. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â º¬¸µ Ƭ÷ ¼µÄ±³»ÎÄĹ÷ JIT. œ¹± Ƭ÷ ¼µÄ±³»ÎÄĹ÷ ¼µ ÇÁ®Ã· JIT µ¯½±¹ · Ƭ÷ º±Ä¬ Ä·½ ¿À¿¯± ³¯½µÄ±¹ ¼µÄ±³»ÎÄĹ÷ ¼¹±Â ¼µ¸Ì´¿Å º±¹ Äɽ µ¾±ÁĮõν Ä·Â. TIME_IN_JIT_BASE_008_NAME=”µ½ µ¼Æ±½¯¶µÄ±¹ TIME_IN_JIT_BASE_008_HELP=”µ½ µ¼Æ±½¯¶µÄ±¹. DotNetCLR_Interop_OBJECT_008_NAME=”¹±»µ¹Ä¿ÅÁ³¹ºÌķı .NET CLR DotNetCLR_Interop_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± Ä· ´¹±»µ¹Ä¿ÅÁ³¹ºÌķı CLR. CURRENT_CCW_008_NAME=‘Á¹¸¼Ì Äɽ CCW CURRENT_CCW_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì CCW (Com-Callable-Wrappers). ˆ½± CCW µ¯½±¹ ­½±Â ´¹±º¿¼¹ÃĮ ¼µÃ¿»¬²·Ã·Â ³¹± Ä¿ ´¹±Çµ¹Á¹¶Ì¼µ½¿ ±½Ä¹ºµ¯¼µ½¿ .NET ÃÄ¿ ¿À¿¯¿ ±½±Æ­Á¿½Ä±¹ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½± ÀÁ¿³Á¬¼¼±Ä±-Àµ»¬Ä· COM. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ ³¹± ½± ´µ¯Ç½µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ´¹±Çµ¹Á¹¶Ì¼µ½É½ ±½Ä¹ºµ¹¼­½É½ Ãı ¿À¿¯± ±½±Æ­ÁµÄ±¹ ¿ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿Â ºÎ´¹º±Â COM. CURRENT_STUBS_008_NAME=‘Á¹¸¼Ì Ãĵ»µÇν CURRENT_STUBS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì Ãĵ»µÇν À¿Å ´·¼¹¿ÅÁ³®¸·º±½ ±ÀÌ Ä¿ CLR. ¤± Ãĵ»­Ç· µ¯½±¹ ÅÀµÍ¸Å½± ³¹± Ä· ´Á¿¼¿»Ì³·Ã· ¿Á¹Ã¼¬Äɽ º±¹ µÀ¹ÃÄÁµÆ̼µ½É½ Ĺ¼Î½ ±ÀÌ ´¹±Çµ¹Á¹¶Ì¼µ½¿ õ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± º±¹ ±½Ä¯ÃÄÁ¿Æ±, º±Ä¬ Ä· ´¹¬Áºµ¹± ¼¹±Â º»®Ã·Â ´¹±»µ¹Ä¿ÅÁ³¹ºÌķı COM ® º»®Ã·Â PInvoke. NUM_MARSHALLING_008_NAME=‘Á¹¸¼Ì ´Á¿¼¿»Ì³·Ã·Â NUM_MARSHALLING_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ Æ¿Áν À¿Å ı ¿Á¯Ã¼±Ä± º±¹ ¿¹ µÀ¹ÃÄÁµÆ̼µ½µÂ Ĺ¼­Â ­Ç¿Å½ ´Á¿¼¿»¿³·¸µ¯ ±ÀÌ ´¹±Çµ¹Á¹¶Ì¼µ½¿ õ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± º±¹ ±½Ä¯ÃÄÁ¿Æ± ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ´µ½ µÀ±Å¾¬½µÄ±¹ µ¬½ ı Ãĵ»­Ç· µ¯½±¹ µ½Ãɼ±Äɼ­½±. (¤± Ãĵ»­Ç· µ¯½±¹ ÅÀµÍ¸Å½± ³¹± Ä· ´Á¿¼¿»Ì³·Ã· ¿Á¹Ã¼¬Äɽ º±¹ µÀ¹ÃÄÁµÆ̼µ½É½ Ĺ¼Î½). ¤± Ãĵ»­Ç· ÃŽ®¸É µ½Ãɼ±Äν¿½Ä±¹, µ¬½ · µÀ¹²¬ÁŽ÷ ±ÀÌ Ä· ´Á¿¼¿»Ì³·Ã· µ¯½±¹ ¼¹ºÁ®. TOTAL_TLB_IMPORTS_008_NAME=‘Á¹¸¼Ì µ¹Ã±³É³Î½ TLB / ´µÅĵÁÌ»µÀÄ¿ TOTAL_TLB_IMPORTS_008_HELP=”µÃ¼µÅ¼­½¿ ³¹± ¼µ»»¿½Ä¹º® ÇÁ®Ã·. TOTAL_TLB_EXPORTS_008_NAME=‘Á¹¸¼Ì µ¾±³É³Î½ TLB / ´µÅĵÁÌ»µÀÄ¿ TOTAL_TLB_EXPORTS_008_HELP=”µÃ¼µÅ¼­½¿ ³¹± ¼µ»»¿½Ä¹º® ÇÁ®Ã·. DotNetCLR_LocksAndThreads_OBJECT_008_NAME=LocksAndThreads .NET CLR DotNetCLR_LocksAndThreads_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± º»µ¹´Î¼±Ä± º±¹ ½®¼±Ä± CLR. CONTENTION_TOTAL_008_NAME=£Å½¿»¹ºÌ ±Á¹¸¼Ì ´¹µ½­¾µÉ½ CONTENTION_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ Ãͽ¿»¿ Äɽ ±À¿ÄÅÇ·¼­½É½ ÀÁ¿ÃÀ±¸µ¹Î½ Äɽ ½·¼¬Äɽ ÃÄ¿ CLR ½± ±À¿ºÄ®Ã¿Å½ ´¹±Çµ¹Á¹¶Ì¼µ½¿ º»µ¯´É¼±. ¤± ´¹±Çµ¹Á¹¶Ì¼µ½± º»µ¹´Î¼±Ä± ¼À¿Á¿Í½ ½± ±À¿ºÄ·¸¿Í½ ¼µ À¿»»¿Í ÄÁÌÀ¿ÅÂ, ¼­ÃÉ Ä·Â ÀÁÌı÷ "lock" ÃÄ¿ C#, ¼­ÃÉ º»®Ã·Â ÃÄ¿ System.Monitor.Enter ® ÇÁ·Ã¹¼¿À¿¹Î½Ä±Â Ä¿ ÀÁ¿Ã±Á¼¿Ã¼­½¿ DZÁ±ºÄ·Á¹ÃĹºÌ MethodImplOptions.Synchronized. CONTENTION_INST_008_NAME=¡Å¸¼Ì ´¹µ½­¾µÉ½ / ´µÅĵÁÌ»µÀÄ¿ CONTENTION_INST_008_HELP=— ÃÅǽÌķı Äɽ ±À¿ÄÅÇ·¼­½É½ ÀÁ¿ÃÀ±¸µ¹Î½ Äɽ ½·¼¬Äɽ ³¹± Ä·½ ±À̺ķ÷ µ½Ì ´¹±Çµ¹Á¹¶Ì¼µ½¿Å º»µ¹´Î¼±Ä¿Â ¼­Ã± ÃÄ¿ ÇÁ̽¿ µºÄ­»µÃ·Â. ¤± ´¹±Çµ¹Á¹¶Ì¼µ½± º»µ¹´Î¼±Ä± ¼À¿Á¿Í½ ½± ±À¿ºÄ·¸¿Í½ ¼µ À¿»»¿Í ÄÁÌÀ¿ÅÂ, ¼­ÃÉ Ä·Â ÀÁÌı÷ "lock" ÃÄ¿ C#, ¼­ÃÉ º»®Ã·Â ÃÄ¿ System.Monitor.Enter ® ÇÁ·Ã¹¼¿À¿¹Î½Ä±Â Ä¿ ÀÁ¿Ã±Á¼¿Ã¼­½¿ DZÁ±ºÄ·Á¹ÃĹºÌ MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_008_NAME=¤Á­Ç¿½ ¼®º¿Â ¿ÅÁ¬Â QUEUE_LENGTH_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ ½·¼¬Äɽ õ ±½±¼¿½® ³¹± ±À̺ķ÷ ´¹±Çµ¹Á¹¶Ì¼µ½¿Å º»µ¹´Î¼±Ä¿Â ÃÄ·½ µÆ±Á¼¿³®. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. QUEUE_LENGTH_TOTAL_008_NAME=œ­³¹ÃÄ¿ ¼®º¿Â ¿ÅÁ¬Â QUEUE_LENGTH_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ ½·¼¬Äɽ õ ±½±¼¿½® ³¹± Ä·½ ±À̺ķ÷ ´¹±Çµ¹Á¹¶Ì¼µ½¿Å º»µ¹´Î¼±Ä¿Â ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. QUEUE_LENGTH_INST_008_NAME=œ®º¿Â ¿ÅÁ¬Â / ´µÅĵÁÌ»µÀÄ¿ QUEUE_LENGTH_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì ½·¼¬Äɽ ±½¬ ´µÅĵÁÌ»µÀÄ¿ À¿Å ²Á¯Ãº¿½Ä±¹ õ ±½±¼¿½® ³¹± Ä·½ ±À̺ķ÷ º»µ¹´Î¼±Ä¿Â ÃÄ·½ µÆ±Á¼¿³®. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. CURRENT_LOGICAL_THREADS_008_NAME=‘Á¹¸¼Ì ÄÁµÇ̽Äɽ »¿³¹ºÎ½ ½·¼¬Äɽ CURRENT_LOGICAL_THREADS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ÄÁµÇ̽Äɽ ±½Ä¹ºµ¹¼­½É½ ½·¼¬Äɽ .NET ÃÄ·½ µÆ±Á¼¿³®. ˆ½± ±½Ä¹ºµ¯¼µ½¿ ½®¼±Ä¿Â .NET ´·¼¹¿ÅÁ³µ¯Ä±¹ µ¯Äµ ¼­ÃÉ µ½Ì ½­¿Å System.Threading.Thread µ¯Äµ Ìı½ ­½± ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿ ½®¼± µ¹Ã­Áǵı¹ ÃÄ¿ ´¹±Çµ¹Á¹¶Ì¼µ½¿ ÀµÁ¹²¬»»¿½. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ÅÀ¿»¿³¯¶µ¹ ÄÌÿ ı ½®¼±Ä± À¿Å µºÄµ»¿Í½Ä±¹ Ìÿ º±¹ µºµ¯½± À¿Å ´¹±ºÌÀ·º±½. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, µ¼Æ±½¯¶µ¹ ±À»Î ķ½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. CURRENT_PHYSICAL_THREADS_008_NAME=‘Á¹¸¼Ì ÄÁµÇ̽Äɽ ÆÅùºÎ½ ½·¼¬Äɽ CURRENT_PHYSICAL_THREADS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ Ä¿À¹ºÎ½ ½·¼¬Äɽ »µ¹Ä¿ÅÁ³¹º¿Í ÃÅÃÄ®¼±Ä¿Â À¿Å ´·¼¹¿ÅÁ³®¸·º±½ º±¹ ±½®º¿Å½ ÃÄ¿ CLR ³¹± ½± »µ¹Ä¿ÅÁ³¿Í½ É ÅÀ¿ºµ¯¼µ½± ½®¼±Ä± ³¹± ı ±½Ä¹ºµ¯¼µ½± ½®¼±Ä¿Â .NET. — Ĺ¼® ±ÅÄ¿Í Ä¿Å ¼µÄÁ·Ä® ´µ½ ÀµÁ¹»±¼²¬½µ¹ ı ½®¼±Ä± À¿Å ÇÁ·Ã¹¼¿À¿¹®¸·º±½ ±ÀÌ Ä¿ CLR ÃĹ µÃÉĵÁ¹º­Â »µ¹Ä¿ÅÁ³¯µÂ Ä¿Å.  Á̺µ¹Ä±¹ ³¹± ­½± ÅÀ¿Ãͽ¿»¿ Äɽ ½·¼¬Äɽ ÃÄ· ´¹µÁ³±Ã¯± Ä¿Å »µ¹Ä¿ÅÁ³¹º¿Í ÃÅÃÄ®¼±Ä¿Â. RECOGNIZED_THREADS_CUR_008_NAME=‘Á¹¸¼Ì ÄÁµÇ̽Äɽ ±½±³½ÉÁ¹Ã¼­½É½ ½·¼¬Äɽ RECOGNIZED_THREADS_CUR_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì ½·¼¬Äɽ À¿Å ±½±³½ÉÁ¯¶¿½Ä±¹ ±ÀÌ Ä¿ CLR º±¹ ı ¿À¿¯± ­Ç¿Å½ ­½± ±½Ä¯ÃÄ¿¹Ç¿ ±½Ä¹ºµ¯¼µ½¿ ½®¼±Ä¿Â .NET À¿Å Ãǵį¶µÄ±¹ ¼µ ±ÅĬ. ¤± ½®¼±Ä± ±ÅĬ ´µ½ ´·¼¹¿ÅÁ³¿Í½Ä±¹ ±ÀÌ Ä¿ CLR, ´·¼¹¿ÅÁ³¿Í½Ä±¹ ­¾É ±ÀÌ ±ÅÄÌ ±»»¬ ­ºÄ¿Äµ ­Ç¿Å½ µºÄµ»µÃĵ¯ ¼­Ã± ÃÄ¿ CLR Ä¿Å»¬Ç¹ÃÄ¿½ ¼¯± Æ¿Á¬.  ±Á±º¿»¿Å¸¿Í½Ä±¹ ¼Ì½¿ ½®¼±Ä± À¿Å µ¯½±¹ ¼¿½±´¹º¬. ¤± ½®¼±Ä± À¿Å ­Ç¿Å½ ¯´¹¿ ±½±³½ÉÁ¹ÃĹºÌ ½®¼±Ä¿Â º±¹ µ¹Ã­ÁÇ¿½Ä±¹ ¾±½¬ ÃÄ¿ CLR ® µºµ¯½± À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ µº ½­¿Å ¼µÄ¬ Ä·½ ­¾¿´¿ Ä¿Å ½®¼±Ä¿Â ´µ½ ¼µÄÁ¹¿Í½Ä±¹ ´Í¿ Æ¿Á­Â. RECOGNIZED_THREADS_TOTAL_008_NAME=‘Á¹¸¼Ì ÃŽ¿»¹ºÎ½ ±½±³½ÉÁ¹Ã¼­½É½ ½·¼¬Äɽ RECOGNIZED_THREADS_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ ½·¼¬Äɽ À¿Å ­Ç¿Å½ ±½±³½ÉÁ¹Ãĵ¯ ±ÀÌ Ä¿ CLR ±ÀÌ Ä·½ ­½±Á¾· ±ÅĮ ķ µÆ±Á¼¿³®Â. ‘ÅĬ ı ½®¼±Ä± ­Ç¿Å½ ­½± ±½Ä¯ÃÄ¿¹Ç¿ ±½Ä¹ºµ¯¼µ½¿ ½®¼±Ä¿Â .NET À¿Å Ãǵį¶µÄ±¹ ¼µ ±ÅĬ. ¤± ÃųºµºÁ¹¼­½± ½®¼±Ä± ´µ½ ´·¼¹¿ÅÁ³¿Í½Ä±¹ ±ÀÌ Ä¿ CLR, ´·¼¹¿ÅÁ³¿Í½Ä±¹ ­¾É ±ÀÌ ±ÅÄÌ, ±»»¬ ­ºÄ¿Äµ ­Ç¿Å½ µºÄµ»µÃĵ¯ ¼­Ã± ÃÄ¿ CLR Ä¿Å»¬Ç¹ÃÄ¿½ ¼¯± Æ¿Á¬.  ±Á±º¿»¿Å¸¿Í½Ä±¹ ¼Ì½¿ ½®¼±Ä± À¿Å µ¯½±¹ ¼¿½±´¹º¬. ¤± ½®¼±Ä± À¿Å ­Ç¿Å½ ¯´¹¿ ±½±³½ÉÁ¹ÃĹºÌ ½®¼±Ä¿Â º±¹ µ¹Ã­ÁÇ¿½Ä±¹ ¾±½¬ ÃÄ¿ CLR ® µºµ¯½± À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ µº ½­¿Å ¼µÄ¬ Ä·½ ­¾¿´¿ Ä¿Å ½®¼±Ä¿Â ´µ½ ¼µÄÁ¹¿Í½Ä±¹ ´Í¿ Æ¿Á­Â. RECOGNIZED_THREADS_INST_008_NAME=ÁŸ¼Ì ±½±³½ÉÁ¹Ã¼­½É½ ½·¼¬Äɽ / ´µÅĵÁÌ»µÀÄ¿ RECOGNIZED_THREADS_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ½·¼¬Äɽ ±½¬ ´µÅĵÁÌ»µÀÄ¿, ı ¿À¿¯± ­Ç¿Å½ ±½±³½ÉÁ¹Ãĵ¯ ±ÀÌ Ä¿ CLR. ‘ÅĬ ı ½®¼±Ä± ­Ç¿Å½ ­½± ±½Ä¯ÃÄ¿¹Ç¿ ±½Ä¹ºµ¯¼µ½¿ ½®¼±Ä¿Â .NET À¿Å Ãǵį¶µÄ±¹ ¼µ ±ÅĬ. ¤± ÃųºµºÁ¹¼­½± ½®¼±Ä± ´µ½ ´·¼¹¿ÅÁ³¿Í½Ä±¹ ±ÀÌ Ä¿ CLR, ´·¼¹¿ÅÁ³¿Í½Ä±¹ ­¾É ±ÀÌ ±ÅÄÌ, ±»»¬ ­ºÄ¿Äµ ­Ç¿Å½ µºÄµ»µÃĵ¯ ¼­Ã± ÃÄ¿ CLR Ä¿Å»¬Ç¹ÃÄ¿½ ¼¯± Æ¿Á¬.  ±Á±º¿»¿Å¸¿Í½Ä±¹ ¼Ì½¿ ½®¼±Ä± À¿Å µ¯½±¹ ¼¿½±´¹º¬. ¤± ½®¼±Ä± À¿Å ­Ç¿Å½ ¯´¹¿ ±½±³½ÉÁ¹ÃĹºÌ ½®¼±Ä¿Â º±¹ µ¹Ã­ÁÇ¿½Ä±¹ ¾±½¬ ÃÄ¿ CLR ® µºµ¯½± À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ µº ½­¿Å ¼µÄ¬ Ä·½ ­¾¿´¿ Ä¿Å ½®¼±Ä¿Â ´µ½ ¼µÄÁ¹¿Í½Ä±¹ ´Í¿ Æ¿Á­Â. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. DotNetCLR_Security_OBJECT_008_NAME=‘ÃƬ»µ¹± .NET CLR DotNetCLR_Security_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± Ä·½ ±ÃƬ»µ¹± CLR. SECURITY_TOTALRTCHECKS_008_NAME=£Í½¿»¿ µ»­³Çɽ ÇÁ̽¿Å µºÄ­»µÃ·Â SECURITY_TOTALRTCHECKS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ µ»­³Çɽ Ä·Â ±ÃƬ»µ¹±Â ÀÁÌò±Ã·Â ºÎ´¹º± (CAS) º±Ä¬ Ä¿ ÇÁ̽¿ µºÄ­»µÃ·Â, À¿Å ÀÁ±³¼±Ä¿À¿¹®¸·º±½ ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ¹ ­»µ³Ç¿¹ CAS ÇÁ̽¿Å µºÄ­»µÃ·Â ³¯½¿½Ä±¹ Ìı½ ¿ º±»Î½ ÀÁ±³¼±Ä¿À¿¹µ¯ ¼¹± º»®Ã· ÃÄ¿½ º±»¿Í¼µ½¿ ¶·Äνı ÃųºµºÁ¹¼­½± ´¹º±¹Î¼±Ä±. Ÿ ­»µ³Ç¿Â ÇÁ̽¿Å µºÄ­»µÃ·Â ÀÁ±³¼±Ä¿À¿¹µ¯Ä±¹ õ º¬¸µ º»®Ã·, µ¾µÄ¬¶¿½Ä±Â Ä·½ ÄÁ­Ç¿Åñ ÃÄ¿¯²± ½·¼¬Äɽ Ä¿Å º±»¿Í½Ä±. ŒÄ±½ ¿ ¼µÄÁ·Ä®Â ±ÅÄÌ ÇÁ·Ã¹¼¿À¿¹µ¯Ä±¹ ¼±¶¯ ¼µ Ä¿ ¼µÄÁ·Ä® " ’¬¸¿Â ÃÄ¿¯²±Â" ÅÀ¿´µ¹º½Íµ¹ ¼µ¯É÷ Ä·Â ±ÀÌ´¿Ã·Â ³¹± Ä¿Å µ»­³Ç¿Å ±ÃƬ»µ¹±Â. SECURITY_TIMEAUTHORIZE_008_NAME=% ÇÁ̽¿Å µ»­³Ç¿Å ıÅÄÌķı ÅÀ¿³Á±Æ®Â SECURITY_TIMEAUTHORIZE_008_HELP=”µÃ¼µÅ¼­½¿ ³¹± ¼µ»»¿½Ä¹º® ÇÁ®Ã·. SECURITY_LINKCHECKS_008_NAME=‘Á¹¸¼Ì µ»­³Çɽ ÇÁ̽¿Å Ãͽ´µÃ·Â SECURITY_LINKCHECKS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ µ»­³Çɽ Ä·Â ±ÃƬ»µ¹±Â ÀÁÌò±Ã·Â ºÎ´¹º± (CAS) º±Ä¬ Ä¿ ÇÁ̽¿ Ãͽ´µÃ·Â ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. Ÿ¹ ­»µ³Ç¿¹ CAS ÇÁ̽¿Å Ãͽ´µÃ·Â µºÄµ»¿Í½Ä±¹ Ìı½ ¿ º±»Î½ ÀÁ±³¼±Ä¿À¿¹µ¯ ¼¹± º»®Ã· ÃÄ¿½ º±»¿Í¼µ½¿ ¶·Äνı ÃųºµºÁ¹¼­½¿ ´¹º±¯É¼± º±Ä¬ Ä· ´¹¬Áºµ¹± Ä·Â ¼µÄ±³»ÎÄĹ÷ JIT. Ÿ ­»µ³Ç¿Â ÇÁ̽¿Å Ãͽ´µÃ·Â ÀÁ±³¼±Ä¿À¿¹µ¯Ä±¹ ¼¯± Æ¿Á¬ ±½¬ º±»¿Í½Ä±. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ ÅÀ¿´µ¹º½Íµ¹ ÿ²±Á¬ ÀÁ¿²»®¼±Ä± µÀ¹´Ìõɽ, ±»»¬ Ä· ´Á±ÃÄ·Á¹Ìķı Ä¿Å ÃÅÃÄ®¼±Ä¿Â ±ÃƬ»µ¹±Â. SECURITY_TIMERTCHECKS_008_NAME=% ÇÁ̽¿Å õ µ»­³Ç¿Å RT SECURITY_TIMERTCHECKS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ À¿Ã¿ÃÄÌ Ä¿Å ÇÁ̽¿Å À¿Å ´±À±½®¸·ºµ ³¹± Ä·½ µºÄ­»µÃ· µ»­³Çɽ Ä·Â ±ÃƬ»µ¹±Â ÀÁÌò±Ã·Â ºÎ´¹º± (CAS) º±Ä¬ Ä¿ ÇÁ̽¿ µºÄ­»µÃ·Â, ±ÀÌ Ä¿½ ĵ»µÅı¯¿ Ä­Ä¿¹¿ ­»µ³Ç¿. — ±ÃƬ»µ¹± Ä·Â ÀÁÌò±Ã·Â ºÎ´¹º± µÀ¹ÄÁ­Àµ¹ Ä¿½ ¿Á¹Ã¼Ì ´¹±ÆÌÁɽ µÀ¹À­´É½ ±¾¹¿À¹Ãį±Â ³¹± Ä¿½ ºÎ´¹º± º±¹ Ä·½ µÆ±Á¼¿³® ±ÅÄν Äɽ µÀ¹À­´É½ ±½¬»¿³± ¼µ Ä·½ ıÅÄÌķı Ä¿Å ºÎ´¹º±. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ µ½·¼µÁνµÄ±¹ ÃÄ¿ Ä­»¿Â µ½Ì µ»­³Ç¿Å ±ÃƬ»µ¹±Â ÇÁ̽¿Å µºÄ­»µÃ·Â. ‘½Ä¹ÀÁ¿ÃÉÀµÍµ¹ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ, Ìǹ Ä¿½ ¼­Ã¿ ÌÁ¿. SECURITY_TIMERTCHECKS_BASE_008_NAME=”µ½ µ¼Æ±½¯¶µÄ±¹ SECURITY_TIMERTCHECKS_BASE_008_HELP=”µ½ µ¼Æ±½¯¶µÄ±¹. SECURITY_DEPTHSECURITY_008_NAME=’¬¸¿Â ÃÄ¿¯²±Â SECURITY_DEPTHSECURITY_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ ²¬¸¿Â Ä·Â ÃÄ¿¯²±Â ÃÄ· ´¹¬Áºµ¹± ĿŠĵ»µÅı¯¿Å µ»­³Ç¿Å ±ÃƬ»µ¹±Â ÀÁÌò±Ã·Â ºÎ´¹º± (CAS) º±Ä¬ Ä¿ ÇÁ̽¿ µºÄ­»µÃ·Â. Ÿ ­»µ³Ç¿Â ±ÃƬ»µ¹±Â ÀÁÌò±Ã·Â ÃÄ¿½ ºÎ´¹º± º±Ä¬ Ä¿ ÇÁ̽¿ µºÄ­»µÃ·Â ÀÁ±³¼±Ä¿À¿¹µ¯Ä±¹ ¼­ÃÉ Ä·Â ±½¬»Å÷ ķ ÃÄ¿¯²±Â. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿, ±»»¬ Ä·½ ĵ»µÅı¯± Ĺ¼® À¿Å À±Á±Ä·Á®¸·ºµ. DotNetCLR_Remoting_OBJECT_008_NAME=‘À¿¼±ºÁÅü­½· µÀ¹º¿¹½É½¯± .NET CLR DotNetCLR_Remoting_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ³¹± Ä·½ ±À¿¼±ºÁÅü­½· µÀ¹º¿¹½É½¯± CLR. CONTEXT_REMOTECALLS_INST_008_NAME=‘À¿¼±ºÁÅü­½µÂ º»®Ãµ¹Â/´µÅĵÁÌ»µÀÄ¿ CONTEXT_REMOTECALLS_INST_008_HELP=Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ º»®ÃµÉ½ ±À¿¼±ºÁÅü­½·Â ´¹±´¹º±Ã¯±Â ±½¬ ´µÅĵÁÌ»µÀÄ¿. œ¹± º»®Ã· ±À¿¼±ºÁÅü­½·Â ´¹±´¹º±Ã¯±Â µ¯½±¹ ¼¹± º»®Ã· ÀÁ¿Â ¿À¿¹¿´®À¿Äµ ±½Ä¹ºµ¯¼µ½¿ µºÄÌ ĿŠAppDomain Ä¿Å º±»¿Í½Ä±. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. CONTEXT_CHANNELS_008_NAME=š±½¬»¹± CONTEXT_CHANNELS_008_HELP=Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ º±½±»¹Î½ ±À¿¼±ºÁÅü­½·Â µÀ¹º¿¹½É½¯±Â À¿Å ­Ç¿Å½ º±Ä±ÇÉÁ·¸µ¯ õ Ì»± ı AppDomain ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â. ¤± º±½¬»¹± ÇÁ·Ã¹¼¿À¿¹¿Í½Ä±¹ ³¹± Ä· ¼µÄ±Æ¿Á¬ ¼·½Å¼¬Äɽ ÀÁ¿Â º±¹ ±ÀÌ ±À¿¼±ºÁÅü­½± ±½Ä¹ºµ¯¼µ½±. CONTEXT_PROXIES_008_NAME=”¹±º¿¼¹ÃÄ­Â ¼µÃ¿»¬²·Ã·Â ÀµÁ¹²¬»»¿½Ä¿Â CONTEXT_PROXIES_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ ±½Ä¹ºµ¹¼­½É½ ¼µÃ¿»¬²·Ã·Â ±À¿¼±ºÁÅü­½·Â µÀ¹º¿¹½É½¯±Â À¿Å ´·¼¹¿ÅÁ³®¸·º±½ ÃÄ· ÃųºµºÁ¹¼­½· ´¹µÁ³±Ã¯± ±ÀÌ Ä·½ ­½±Á¾® Ä·Â. ¤¿ ±½Ä¹ºµ¯¼µ½¿ ¼µÃ¿»¬²·Ã·Â ±½Ä¹ÀÁ¿ÃÉÀµÍµ¹ ı ±À¿¼±ºÁÅü­½± ±½Ä¹ºµ¯¼µ½± º±¹ µ¾±ÃƱ»¯¶µ¹ ÌĹ Ì»µÂ ¿¹ º»®Ãµ¹Â À¿Å ³¯½¿½Ä±¹ ÃÄ¿ ´¹±º¿¼¹ÃÄ® ¼µÃ¿»¬²·Ã·Â ÀÁ¿É¸¿Í½Ä±¹ ÃÄ· ÃÉÃÄ® À±Á¿Åï± ±À¿¼±ºÁÅü­½¿Å ±½Ä¹ºµ¹¼­½¿Å. CONTEXT_CLASSES_008_NAME=š»¬Ãµ¹Â ÃŽ´µ´µ¼­½µÂ ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å À¿Å ­Ç¿Å½ Æ¿ÁÄɸµ¯ CONTEXT_CLASSES_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì Äɽ ÃŽ´µ´µ¼­½É½ ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å º»¬ÃµÉ½ À¿Å ­Ç¿Å½ Æ¿ÁÄɸµ¯. ˆÄù ¿½¿¼¬¶¿½Ä±¹ ¿¹ º»¬Ãµ¹Â À¿Å ¼À¿Á¿Í½ ½± ÃŽ´µ¸¿Í½ ²¬Ãµ¹ µ½Ì ÀµÁ¹µÇ¿¼­½¿Å. Ÿ¹ º»¬Ãµ¹Â ±ÅÄ­Â µÀ¹Ã·¼±¯½¿½Ä±¹ ¼µ DZÁ±ºÄ·Á¹ÃĹº¬ ÀµÁ¹²¬»»¿½Ä¿Â, ı ¿À¿¯± À±Á­Ç¿Å½ º±½Ì½µÂ ÇÁ®Ã·Â ³¹± Ä¿ ÃųÇÁ¿½¹Ã¼Ì, Ä· ÃŽ¬Æµ¹± ½·¼¬Äɽ, Ĺ ÃŽ±»»±³­Â ºÄ». CONTEXT_OBJALLOC_008_NAME=‘½Ä¹ºµ¯¼µ½± ÃŽ´µ´µ¼­½± ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å À¿Å ­Ç¿Å½ µºÇÉÁ·¸µ¯ / ´µÅĵÁÌ»µÀÄ¿ CONTEXT_OBJALLOC_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ÃŽ´µ´µ¼­½É½ ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å ±½Ä¹ºµ¹¼­½É½ À¿Å ­Ç¿Å½ µºÇÉÁ·¸µ¯ ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ¹ À±Á¿ÅïµÂ º»¬ÃµÉ½, ¿¹ ¿À¿¯µÂ ¼À¿Á¿Í½ ½± ÃŽ´µ¸¿Í½ ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å, ¿½¿¼¬¶¿½Ä±¹ ±½Ä¹ºµ¯¼µ½± ÃŽ´µ´µ¼­½± ²¬Ãµ¹ ÀµÁ¹µÇ¿¼­½¿Å. Ÿ¹ º»¬Ãµ¹Â ±ÅÄ­Â µÀ¹Ã·¼±¯½¿½Ä±¹ ¼µ DZÁ±ºÄ·Á¹ÃĹº¬ ÀµÁ¹²¬»»¿½Ä¿Â ı ¿À¿¯± À±Á­Ç¿Å½ º±½Ì½µÂ ÇÁ®Ã·Â ³¹± Ä¿ ÃųÇÁ¿½¹Ã¼Ì, Ä· ÃŽ¬Æµ¹± ½·¼¬Äɽ, Ĺ ÃŽ±»»±³­Â ºÄ». ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. CONTEXT_CONTEXTS_008_NAME= µÁ¹²¬»»¿½Ä± CONTEXT_CONTEXTS_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÄÁ­Ç¿½Ä± ±Á¹¸¼Ì Äɽ ÀµÁ¹²±»»Ì½Äɽ ±À¿¼±ºÁÅü­½·Â µÀ¹º¿¹½É½¯±Â ÃÄ·½ µÆ±Á¼¿³®. ˆ½± ÀµÁ¹²¬»»¿½ µ¯½±¹ ­½± ÌÁ¹¿ À¿Å ÀµÁ¹­Çµ¹ ¼¹± ÃÅ»»¿³® ±½Ä¹ºµ¹¼­½É½ ¼µ Ä¿Å ¯´¹¿Å º±½Ì½µÂ ÇÁ®Ã·Â ÌÀÉ ¿ ÃųÇÁ¿½¹Ã¼ÌÂ, · ÃŽ¬Æµ¹± ½·¼¬Äɽ, ¿¹ ÃŽ±»»±³­Â ºÄ». CONTEXT_REMOTECALLS_TOTAL_008_NAME=£Í½¿»¿ ±À¿¼±ºÁÅü­½É½ º»®ÃµÉ½ CONTEXT_REMOTECALLS_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿ Ãͽ¿»¿ Äɽ º»®ÃµÉ½ ±À¿¼±ºÁÅü­½É½ ´¹±´¹º±Ã¹Î½ À¿Å ÀÁ±³¼±Ä¿À¿¹®¸·º±½ ±ÀÌ Ä·½ ­½±Á¾· Ä·Â ÃųºµºÁ¹¼­½·Â µÆ±Á¼¿³®Â. œ¹± º»®Ã· ±À¿¼±ºÁÅü­½·Â ´¹±´¹º±Ã¯±Â µ¯½±¹ ¼¹± º»®Ã· ÀÁ¿Â ¿À¿¹¿´®À¿Äµ ±½Ä¹ºµ¯¼µ½¿ µºÄÌ ĿŠAppDomain Ä¿Å º±»¿Í½Ä±. DotNetCLR_Excep_OBJECT_008_NAME=•¾±¹Á­Ãµ¹Â .NET CLR DotNetCLR_Excep_OBJECT_008_HELP=£Ä±Ä¹ÃĹº¬ ÃÄ¿¹Çµ¯± ÇÁ̽¿Å µºÄ­»µÃ·Â ³¹± Ä¿ ǵ¹Á¹Ã¼Ì Äɽ µ¾±¹Á­ÃµÉ½ CLR. EXCEP_THROWN_TOTAL_008_NAME=‘Á¹¸¼Ì Äɽ µ¾±¹Á­ÃµÉ½ À¿Å ´·¼¹¿ÅÁ³®¸·º±½ EXCEP_THROWN_TOTAL_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ÃŽ¿»¹ºÌ ±Á¹¸¼Ì Äɽ µ¾±¹Á­ÃµÉ½ À¿Å ´·¼¹¿ÅÁ³®¸·º±½ ±ÀÌ Ä·½ ­½±Á¾· Ä·Â µÆ±Á¼¿³®Â.  µÁ¹»±¼²¬½¿½Ä±¹ º±¹ ¿¹ µ¾±¹Á­Ãµ¹Â .NET º±¹ ¿¹ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½µÂ µ¾±¹Á­Ãµ¹Â ¿¹ ¿À¿¯µÂ ¼µÄ±ÄÁ­À¿½Ä±¹ õ µ¾±¹Á­Ãµ¹Â .NET, À.Ç. ¼¹± µ¾±¯ÁµÃ· ±½±Æ¿Á¬Â ´µ¯ºÄ· null õ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± ¸± ´·¼¹¿ÅÁ³·¸µ¯ ¾±½¬ õ ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± É µ¾±¯ÁµÃ· .NET System.NullReferenceException. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ÀµÁ¹»±¼²¬½µ¹ º±¹ Ĺ µ¾±¹Á­Ãµ¹Â À¿Å ­Ç¿Å½ ±½Ä¹¼µÄÉÀ¹Ãĵ¯ º±¹ ±ÅÄ­Â À¿Å ´µ½ ­Ç¿Å½ ±½Ä¹¼µÄÉÀ¹Ãĵ¯. •¾±¹Á­Ãµ¹Â À¿Å ´·¼¹¿ÅÁ³¿Í½Ä±¹ ¾±½¬, ÀÁ¿Ã¼µÄÁ¿Í½Ä±¹ À¬»¹. •¾±¹Á­Ãµ¹Â ¸± ÀÁ­Àµ¹ ½± ÀÁ¿ºÍÀĿŽ ¼Ì½¿ õ ÃÀ¬½¹µÂ ÀµÁ¹ÀÄÎõ¹Â º±¹ Ìǹ ÃÄ·½ º±½¿½¹º® Á¿® µ»­³Ç¿Å Ä¿Å ÀÁ¿³Á¬¼¼±Ä¿Â. EXCEP_THROWN_INST_008_NAME=‘Á¹¸¼Ì µ¾±¹Á­ÃµÉ½ À¿Å ´·¼¹¿ÅÁ³®¸·º±½ / ´µÅĵÁÌ»µÀÄ¿ EXCEP_THROWN_INST_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ µ¾±¹Á­ÃµÉ½ À¿Å ´·¼¹¿ÅÁ³®¸·º±½ ±½¬ ´µÅĵÁÌ»µÀÄ¿.  µÁ¹»±¼²¬½¿½Ä±¹ º±¹ ¿¹ µ¾±¹Á­Ãµ¹Â .NET º±¹ ¿¹ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½µÂ µ¾±¹Á­Ãµ¹Â ¿¹ ¿À¿¯µÂ ¼µÄ±ÄÁ­À¿½Ä±¹ õ µ¾±¹Á­Ãµ¹Â .NET, À.Ç. ¼¹± µ¾±¯ÁµÃ· ±½±Æ¿Á¬Â ´µ¯ºÄ· null õ ¼· ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± ¸± ´·¼¹¿ÅÁ³·¸µ¯ ¾±½¬ õ ´¹±Çµ¹Á¹¶Ì¼µ½¿ ºÎ´¹º± É µ¾±¯ÁµÃ· .NET System.NullReferenceException. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ÀµÁ¹»±¼²¬½µ¹ º±¹ Ĺ µ¾±¹Á­Ãµ¹Â À¿Å ­Ç¿Å½ ±½Ä¹¼µÄÉÀ¹Ãĵ¯ º±¹ ±ÅÄ­Â À¿Å ´µ½ ­Ç¿Å½ ±½Ä¹¼µÄÉÀ¹Ãĵ¯. •¾±¹Á­Ãµ¹Â ¸± ÀÁ­Àµ¹ ½± ÀÁ¿ºÍÀĿŽ ¼Ì½¿ õ ÃÀ¬½¹µÂ ÀµÁ¹ÀÄÎõ¹Â º±¹ Ìǹ ÃÄ·½ º±½¿½¹º® Á¿® µ»­³Ç¿Å Ä¿Å ÀÁ¿³Á¬¼¼±Ä¿Â. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â Ãǵ´¹¬ÃÄ·ºµ É ­½´µ¹¾· À¹¸±½Î½ ÀÁ¿²»·¼¬Äɽ µÀ¹´Ìõɽ »Ì³É Ä·Â ¼µ³¬»·Â ÃÅǽÌķı (> 100) ¼µ Ä·½ ¿À¿¯± ´·¼¹¿ÅÁ³¿Í½Ä±¹ ¿¹ µ¾±¹Á­Ãµ¹Â. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. TOTAL_EXCEP_FILTERS_RUN_008_NAME=‘Á¹¸¼Ì Ư»ÄÁɽ / ´µÅĵÁÌ»µÀÄ¿ TOTAL_EXCEP_FILTERS_RUN_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ Ư»ÄÁɽ µ¾±¹Á­ÃµÉ½ .NET À¿Å µºÄµ»¿Í½Ä±¹ ±½¬ ´µÅĵÁÌ»µÀÄ¿. ˆ½± Ư»ÄÁ¿ µ¾±¯ÁµÃ·Â ±¾¹¿»¿³µ¯ µ¬½ ¼¹± µ¾±¯ÁµÃ· ÀÁ­Àµ¹ ½± ±½Ä¹¼µÄÉÀ¹Ãĵ¯ ® Ìǹ. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â À±Á±º¿»¿Å¸µ¯ Ä¿ ÁŸ¼Ì Äɽ Ư»ÄÁɽ µ¾±¹Á­ÃµÉ½ À¿Å ±¾¹¿»¿³¿Í½Ä±¹, ±½µ¾¬Áķı ±½ · µ¾±¯ÁµÃ· ­Çµ¹ ±½Ä¹¼µÄÉÀ¹Ãĵ¯ ® Ìǹ. Ÿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. TOTAL_EXCEP_FINALLYS_RUN_008_NAME=‘Á¹¸¼Ì Finally / ´µÅĵÁÌ»µÀÄ¿ TOTAL_EXCEP_FINALLYS_RUN_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ ¼À»¿º finally À¿Å µºÄµ»¿Í½Ä±¹ ±½¬ ´µÅĵÁÌ»µÀÄ¿. ˆ½± ¼À»¿º finally µºÄµ»µ¯Ä±¹ ¿ÀÉô®À¿Äµ ±½µ¾¬Áķı ±ÀÌ Ä¿½ ÄÁÌÀ¿ µ¾Ì´¿Å ±ÀÌ Ä¿ ¼À»¿º try. ¥À¿»¿³¯¶¿½Ä±¹ ¼Ì½¿ ı ¼À»¿º finally ı ¿À¿¯± µºÄµ»¿Í½Ä±¹ ³¹± ¼¹± µ¾±¯ÁµÃ·. ¤± ¼À»¿º finally õ º±½¿½¹º­Â ´¹±´Á¿¼­Â ºÎ´¹º± ´µ½ ¼µÄÁ¹¿Í½Ä±¹ ±ÀÌ ±ÅÄ̽ Ä¿ ¼µÄÁ·Ä®. Ÿ ÃųºµºÁ¹¼­½¿Â ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. EXCEPT_STACK_DEPTH_008_NAME=’¬¸¿Â ±ÀÌ Throw ­É Catch / ´µÅĵÁÌ»µÀÄ¿ EXCEPT_STACK_DEPTH_008_HELP=‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â µ¼Æ±½¯¶µ¹ Ä¿½ ±Á¹¸¼Ì Äɽ À»±¹Ã¯É½ ÃÄ¿¯²±Â À¿Å ´¹±½Í¸·º±½ ±ÀÌ Ä¿ À»±¯Ã¹¿ À¿Å ´·¼¹¿ÍÁ³·Ãµ Ä·½ µ¾±¯ÁµÃ· .NET ­É Ŀ À»±¯Ã¹¿ À¿Å ±½Ä¹¼µÄÎÀ¹Ãµ Ä·½ µ¾±¯ÁµÃ·, ±½¬ ´µÅĵÁÌ»µÀÄ¿. Ÿ ¼µÄÁ·Ä®Â ±ÅÄÌ ¼·´µ½¯¶µÄ±¹, Ìı½ µ¹Ã¬³µÄ±¹ ­½±Â ǵ¹Á¹Ã¼Ì µ¾±¹Á­ÃµÉ½, µÀ¿¼­½É ¿¹ ­½¸µÄµÂ µ¾±¹Á­Ãµ¹Â ¸± µ¼Æ±½¯¶¿Å½ Ä¿ ²¬¸¿Â Ä·Â ÃÄ¿¯²±Â ±ÀÌ Ä¿½ ­½± ǵ¹Á¹Ã¼Ì ÃÄ¿½ ¬»»¿. ‘ÅÄÌ ¿ ¼µÄÁ·Ä®Â ´µ½ µ¼Æ±½¯¶µ¹ Ä¿½ ¼­Ã¿ ÌÁ¿ ¼¹±Â ÇÁ¿½¹º®Â ÀµÁ¹Ì´¿Å, ±»»¬ Ä· ´¹±Æ¿Á¬ ¼µÄ±¾Í Äɽ Ĺ¼Î½ À¿Å À±Á±Ä·Á®¸·º±½ Ãı ´Í¿ ĵ»µÅı¯± ´µ¯³¼±Ä±, ´¹±¹Á¿Í¼µ½· ¼µ Ä· ÇÁ¿½¹º® ´¹¬Áºµ¹± Ä¿Å ´¹±ÃÄ®¼±Ä¿Â ´µ¹³¼±Ä¿»·È¯±Â. DotNetCLR_Memory_OBJECT_00A_NAME=Memoria de .NET CLR DotNetCLR_Memory_OBJECT_00A_HELP=Contadores del montón de recolección de elementos no utilizados de CLR. GEN0_COLLECTIONS_COUNTER_00A_NAME=Número de colecciones de gen. 0 GEN0_COLLECTIONS_COUNTER_00A_HELP=Este contador muestra el número de veces que se han recolectado (GC de gen. 0) objetos de generación 0 (los más recientes, asignados últimamente) desde el inicio de la aplicación. El GC de gen. 0 se produce cuando la memoria disponible de generación 0 no es suficiente para satisfacer la solicitud de asignación. Este contador se incrementa al final del GC de gen. 0. Los GC de última generación incluyen a los GC de generaciones anteriores. Este contador se incrementa explícitamente cuando se produce el GC de última generación (gen. 1 o gen. 2). El valor del contador _Global_ no es preciso y debe omitirse. Este contador muestra el último valor observado. GEN1_COLLECTIONS_COUNTER_00A_NAME=Número de colecciones de gen. 1 GEN1_COLLECTIONS_COUNTER_00A_HELP=Este contador muestra el número de veces que se han recolectado objetos de generación 1 desde el inicio de la aplicación. El contador se incrementa al final del GC de gen. 1. Los GC de última generación incluyen a los GC de generaciones anteriores. Este contador se incrementa explícitamente cuando se produce el GC de última generación (gen. 2). El valor del contador _Global_ no es preciso y debe omitirse. Este contador muestra el último valor observado. GEN2_COLLECTIONS_COUNTER_00A_NAME=Número de colecciones de gen. 2 GEN2_COLLECTIONS_COUNTER_00A_HELP=Este contador muestra el número de veces que se han recolectado objetos de generación 2 (los más antiguos) desde el inicio de la aplicación. Este contador se incrementa al final del GC de gen. 2 (conocido también como GC completo). El valor _Global_ counter no es preciso y debe omitirse. Este contador muestra el último valor observado. GEN0_BYTES_PROMOTED_COUNTER_00A_NAME=Memoria promocionada de gen. 0 GEN0_BYTES_PROMOTED_COUNTER_00A_HELP=Este contador muestra los bytes de memoria que permanecen después de la recolección de elementos no utilizados (GC) y que se promueven de la generación 0 a la generación 1; no se incluyen en este contador los objetos que se promueven a la espera de ser finalizados. Este contador no es acumulativo, ya que muestra el valor observado al final del último GC. GEN1_BYTES_PROMOTED_COUNTER_00A_NAME=Memoria promocionada de gen.1 GEN1_BYTES_PROMOTED_COUNTER_00A_HELP=Este contador muestra los bytes de memoria que permanecen después de la recolección de elementos no utilizados (GC) y que se promueven de la generación 0 a la generación 1; no se incluyen en este contador los objetos que se promueven a la espera de ser finalizados. Este contador no es acumulativo ya que muestra el valor observado al final del último GC. Este contador se restablece a 0 sólo si el último GC es un recolector de generación 0. GEN0_PROMOTION_RATE_00A_NAME=Bytes por segundo promocionados de gen. 0 GEN0_PROMOTION_RATE_00A_HELP=Este contador muestra los bytes por segundo que se promueven de la generación 0 (la más reciente) a la generación 1; no se incluyen en este contador los objetos que se promueven a la espera de ser finalizados. La memoria se promueve cuando permanece después de la recolección de elementos no utilizados. Este contador se diseñó como indicador de objetos de una duración relativamente larga creados cada segundo y muestra la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. GEN1_PROMOTION_RATE_00A_NAME=Bytes por segundo promocionados de gen. 1 GEN1_PROMOTION_RATE_00A_HELP=Este contador muestra los bytes por segundo que se promueven de la generación 1 a la generación 2 (la más antigua); no se incluyen en este contador los objetos que se promueven a la espera de ser finalizados. La memoria se promueve cuando permanece después de la recolección de elementos no utilizados. No se promueve ningún elemento después de la generación 2, ya que es la más antigua. Este contador se diseñó como indicador de objetos de una duración relativamente larga creados cada segundo y muestra la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00A_NAME=Memoria de finalización promocionada de gen. 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00A_HELP=Este contador muestra los bytes de memoria que se promueven de la generación 0 a la generación 1 a la espera de ser finalizados y no es acumulativo, ya que muestra el valor observado al final del último GC. PROCESS_ID_00A_NAME=Id. de proceso PROCESS_ID_00A_HELP=Este contador muestra el id. de proceso de la instancia de proceso CLR que se está supervisando. El valor mostrado será 0 hasta después de la primera recolección de elementos no utilizados. GEN0_HEAP_SIZE_COUNTER_00A_NAME=Tamaño del montón de gen. 0 GEN0_HEAP_SIZE_COUNTER_00A_HELP=Este contador muestra el número máximo de bytes que se pueden asignar a la generación 0 (gen. 0); no indica el número actual de bytes asignados a la gen. 0. El GC de gen. 0 se desencadena cuando el número de asignaciones producidas desde el último GC supera este tamaño. El recolector de elementos no utilizados ajusta el tamaño de gen. 0 y puede cambiar durante la ejecución de la aplicación. Al final de la colección de gen. 0, el tamaño del montón de gen. 0 es igual a 0 bytes; este contador muestra el tamaño (en bytes) de las asignaciones que desencadenan el próximo GC de gen. 0. Este contador se actualiza al final de GC y no después de cada asignación. GEN1_HEAP_SIZE_COUNTER_00A_NAME=Tamaño del montón de gen. 1 GEN1_HEAP_SIZE_COUNTER_00A_HELP=Este contador muestra el número actual de bytes en la generación 1 (gen. 1); este contador no muestra el tamaño máximo de gen. 1. Los objetos no se asignan directamente a esta generación sino que se promueven a partir de GC de gen. 0 anteriores. Este contador se actualiza al final del GC y no después de cada asignación. GEN2_HEAP_SIZE_COUNTER_00A_NAME=Tamaño del montón de gen. 2 GEN2_HEAP_SIZE_COUNTER_00A_HELP=Este contador muestra el número actual de bytes en la generación 2 (gen. 2). Los objetos no se asignan directamente a esta generación sino que se promueven a partir de la generación 1 durante GC de gen. 1 anteriores. Este contador se actualiza al final del GC y no después de cada asignación. LARGE_OBJECT_SIZE_COUNTER_00A_NAME=Tamaño del montón del objeto grande LARGE_OBJECT_SIZE_COUNTER_00A_HELP=Este contador muestra el tamaño actual del montón del objeto grande en bytes. El recolector de elementos no utilizados considera que los objetos con un tamaño superior a un umbral son objetos grandes y se asignan directamente a un montón especial; no se promueven a través de generaciones. En CLR v1.1 y versiones posteriores, este umbral equivale a 85.000 bytes. Este contador se actualiza al final de un GC y no después de cada asignación. SURVIVE_FINALIZE_COUNTER_00A_NAME=Superviviente de finalización SURVIVE_FINALIZE_COUNTER_00A_HELP=Este contador muestra el número de objetos recolectados no utilizados que permanecen después de la colección a la espera de ser finalizados. Si estos objetos hacen referencia a otros objetos, éstos también permanecen pero no se cuentan en este contador. Los contadores "Memoria de finalización promovida de gen. 0" y "Memoria de finalización promovida de gen. 1" representan la memoria restante después de la finalización. Este contador no es acumulativo ya que se actualiza al final de cada GC con el recuento de supervivientes de ese GC solamente. Este contador se diseñó para indicar la sobrecarga adicional que puede tener la aplicación por la finalización. NUM_HANDLES_COUNTER_00A_NAME=Número de identificadores del GC NUM_HANDLES_COUNTER_00A_HELP=Este contador muestra el número actual de identificadores de GC en uso. Los identificadores de recursos GCHandles son externos a CLR y al entorno administrado. Estos identificadores ocupan pequeñas cantidades de memoria en GCHeap pero utilizan recursos sin administrar potencialmente caros. ALLOCATION_RATE_COUNTER_00A_NAME=Bytes asignados por segundo ALLOCATION_RATE_COUNTER_00A_HELP=Este contador muestra la tasa de bytes por segundo que se asignan al montón del GC. Este contador se actualiza al final de cada GC y no después de cada asignación. Este contador no es un promedio de un período de tiempo; muestra la diferencia entre los valores observados de los últimos dos ejemplos dividida por la duración del intervalo de ejemplo. INDUCED_GC_COUNTER_00A_NAME=Número de GC provocados INDUCED_GC_COUNTER_00A_HELP=Este contador muestra el número máximo de veces que se realizó una recolección de elementos no utilizados debido a una llamada explícita a GC.Collect. Es un buen método que el GC ajuste la frecuencia de las colecciones. PER_TIME_IN_GC_COUNTER_00A_NAME=% de tiempo del GC PER_TIME_IN_GC_COUNTER_00A_HELP=El contador '% de tiempo de GC' representa el porcentaje de tiempo transcurrido en realizar una recolección de elementos no utilizados (GC) desde el último ciclo del GC. Este contador es normalmente un indicador del trabajo realizado por el recolector de elementos no utilizados de la aplicación para recopilar y compactar la memoria. Este contador no es un promedio, solo se actualiza al final de GC y muestra el último valor observado. PER_TIME_IN_GC_COUNTER_BASE_00A_NAME=No se muestra PER_TIME_IN_GC_COUNTER_BASE_00A_HELP=No se muestra. TOTAL_HEAP_SIZE_COUNTER_00A_NAME=Número de bytes en todos los montones TOTAL_HEAP_SIZE_COUNTER_00A_HELP=Este contador es la suma de otros cuatro contadores: tamaño del montón de gen. 0, tamaño del montón de gen. 1, tamaño del montón de gen. 2 y el tamaño del montón del objeto grande. Este contador indica los bytes asignados a la memoria actual de los montones de GC. TOTAL_COMMITTED_MEM_COUNTER_00A_NAME=Número de bytes totales confirmados TOTAL_COMMITTED_MEM_COUNTER_00A_HELP=Este contador muestra la cantidad de memoria virtual (en bytes) confirmada actualmente por el recolector de elementos no utilizados. La memoria confirmada representa la memoria física del espacio reservado en el archivo de paginación de disco. TOTAL_RESERVED_MEM_COUNTER_00A_NAME=Número de bytes totales reservados TOTAL_RESERVED_MEM_COUNTER_00A_HELP=Este contador muestra la cantidad de memoria virtual (en bytes) reservados actualmente por el recolector de elementos no utilizados. La memoria reservada representa el espacio de memoria virtual reservado para la aplicación sin tener en cuenta el uso de páginas de disco o de la memoria principal. GC_PINNED_OBJECTS_00A_NAME=Número de objetos anclados GC_PINNED_OBJECTS_00A_HELP=Este contador muestra el número de objetos anclados encontrados en la última GC. Este contador realiza el seguimiento de los objetos anclados sólo en los montones recolectados por el recolector de elementos no utilizados, por ejemplo, un GC de gen. 0 que enumera los objetos anclados contenidos sólo en el montón de generación 0. Un objeto anclado es un objeto que el recolector de elementos no puede mover en la memoria. GC_SINKBLOCKS_00A_NAME=Número de bloques de sincronización en uso GC_SINKBLOCKS_00A_HELP=Este contador muestra el número actual de bloques de sincronización en uso. Los bloques de sincronización son estructuras de datos por objeto asignados para almacenar información de sincronización. El recolector de elementos no utilizados examina los bloques de sincronización con referencias débiles a objetos administrados. Los bloques de sincronización no son limitados para almacenar información de sincronización, y también pueden almacenar metadatos de interoperabilidad COM. Este contador está diseñado para indicar los problemas de rendimiento de los tipos primitivos de sincronización muy utilizados. DotNetCLR_Loading_OBJECT_00A_NAME=Carga de .NET CLR DotNetCLR_Loading_OBJECT_00A_HELP=Estadísticas del cargador de clases CLR. LOADING_CLASSES_TOTAL_00A_NAME=Número total de clases cargadas LOADING_CLASSES_TOTAL_00A_HELP=Este contador muestra el número acumulativo de clases cargadas de los ensamblados desde el inicio de la aplicación. LOADING_TIME_00A_NAME=% de tiempo de carga LOADING_TIME_00A_HELP=Reservado para uso futuro. LOADING_ASMSEARCHLEN_00A_NAME=Longitud de búsqueda del ensamblado LOADING_ASMSEARCHLEN_00A_HELP=Reservado para uso futuro. LOADING_LOADFAILURES_TOTAL_00A_NAME=Número total de errores de carga LOADING_LOADFAILURES_TOTAL_00A_HELP=Este contador muestra el número máximo de clases que han provocado errores de carga desde el inicio de la aplicación. Estos errores de carga pueden deberse a varias razones, como seguridad inadecuada o formato no válido. Se pueden obtener todos los detalles en la ayuda de servicios de generación de perfiles. LOADING_LOADFAILURES_INST_00A_NAME=Tasa de errores de carga LOADING_LOADFAILURES_INST_00A_HELP=Este contador muestra el número de clases que han provocado errores de carga por segundo. Este contador no muestra el promedio de un período de tiempo, sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. Estos errores de carga pueden deberse a varias razones, como seguridad inadecuada o formato no válido. Se pueden obtener todos los detalles en la ayuda de generación de perfiles. LOADING_HEAPSIZE_00A_NAME=Bytes del montón del cargador LOADING_HEAPSIZE_00A_HELP=Este contador muestra el tamaño actual (en bytes) de memoria confirmada por el cargador de clases de los AppDomain. La memoria confirmada representa la memoria física del espacio reservado en el archivo de paginación de disco. LOADING_APPDOMAINS_UNLOADED_TOTAL_00A_NAME=Número total de AppDomain descargados LOADING_APPDOMAINS_UNLOADED_TOTAL_00A_HELP=Este contador muestra el número total de AppDomain descargados desde el inicio de la aplicación. Si carga y descarga varias veces un AppDomain, el contador contará cada descarga por separado. LOADING_APPDOMAINS_UNLOADED_INST_00A_NAME=Tasa de AppDomain descargados LOADING_APPDOMAINS_UNLOADED_INST_00A_HELP=Este contador muestra el número de AppDomain descargados por segundo, no muestra el promedio de un período de tiempo sino la diferencia entre los valores observados en los últimos dos ejemplos dividida por la duración del intervalo de ejemplo. LOADING_CLASSES_CUR_00A_NAME=Clases cargadas actualmente LOADING_CLASSES_CUR_00A_HELP=Este contador muestra el número actual de clases cargadas en todos los ensamblados. LOADING_CLASSES_INST_00A_NAME=Tasa de clases cargadas LOADING_CLASSES_INST_00A_HELP=Este contador muestra el número de clases cargadas por segundo en todos los ensamblados. Este contador no muestra el promedio de un período de tiempo, sino la diferencia entre los valores observados en los últimos dos ejemplos dividida por la duración del intervalo de ejemplo. LOADING_APPDOMAINS_CUR_00A_NAME=AppDomain actuales LOADING_APPDOMAINS_CUR_00A_HELP=Este contador muestra el número actual de AppDomain cargados en esta aplicación. Los AppDomain (dominios de aplicación) proporcionan una unidad de procesamiento segura y versátil que CLR puede utilizar para ofrecer aislamiento a las aplicaciones que se ejecutan en el mismo proceso. LOADING_APPDOMAINS_TOTAL_00A_NAME=Número total de AppDomain LOADING_APPDOMAINS_TOTAL_00A_HELP=Este contador muestra el número máximo de AppDomain cargados desde el inicio de la aplicación. Los AppDomain (dominios de aplicación) proporcionan una unidad de procesamiento segura y versátil que CLR puede utilizar para proporcionar aislamiento a las aplicaciones que se ejecutan en el mismo proceso. LOADING_APPDOMAINS_INST_00A_NAME=Tasa de AppDomain LOADING_APPDOMAINS_INST_00A_HELP=Este contador muestra el número de AppDomain cargados por segundo. Los AppDomain (dominios de aplicación) proporcionan una unidad de procesamiento segura y versátil que CLR puede utilizar para proporcionar aislamiento a las aplicaciones que se ejecutan en el mismo proceso. Este contador no muestra un promedio de un período de tiempo, sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. LOADING_ASSEMBLIES_CUR_00A_NAME=Ensamblados actuales LOADING_ASSEMBLIES_CUR_00A_HELP=Este contador muestra el número actual de ensamblados cargados en todos los AppDomain de esta aplicación. El contador sólo se incrementará una vez, si se carga el ensamblado con dominio neutro desde varios AppDomain. Se pueden cargar los ensamblados con dominio neutro cuando se puede compartir el código en todos AppDomain o cargar los ensamblados con dominio específico cuando el código es privado para el AppDomain. LOADING_ASSEMBLIES_TOTAL_00A_NAME=Número total de ensamblados LOADING_ASSEMBLIES_TOTAL_00A_HELP=Este contador muestra el número total de ensamblados cargados desde el inicio de la aplicación. El contador sólo se incrementará una vez, si se carga el ensamblado con dominio neutro desde varios AppDomain. Se pueden cargar ensamblados con dominio neutro cuando el código se puede compartir con todos los AppDomain o cargar los ensamblados con dominio específico cuando el código es privado para el AppDomain. LOADING_ASSEMBLIES_INST_00A_NAME=Tasa de ensamblados LOADING_ASSEMBLIES_INST_00A_HELP=Este contador muestra el número de ensamblados cargados por segundo en los AppDomain. El contador sólo se incrementará una vez, si se carga el ensamblado con dominio neutro desde varios AppDomain. Se pueden cargar ensamblados con dominio neutro cuando se puede compartir el código en los AppDomain y cargar los ensamblados con dominio específico cuando el código es privado para el AppDomain. Este contador no es un promedio de un período de tiempo; muestra la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. DotNetCLR_Jit_OBJECT_00A_NAME=Compilador JIT de .NET CLR DotNetCLR_Jit_OBJECT_00A_HELP=Estadísticas del compilador JIT de CLR. TOTAL_METHODS_JITTED_00A_NAME=Número de métodos compilados mediante JIT TOTAL_METHODS_JITTED_00A_HELP=Este contador muestra el número total de métodos compilados JIT (Just-In-Time) por el compilador JIT de CLR desde el inicio de la aplicación. Este contador no incluye los métodos anteriores a la compilación JIT. JITTED_IL_CUR_00A_NAME=Número de bytes de IL con compilación JIT JITTED_IL_CUR_00A_HELP=Este contador muestra el número total de bytes de IL con compilación JIT desde el inicio de la aplicación y es equivalente al contador "Número total de bytes de IL con compilación JIT". JITTED_IL_TOTAL_00A_NAME=Número total de bytes de IL con compilación JIT JITTED_IL_TOTAL_00A_HELP=Este contador muestra el número total de bytes de IL con compilación JIT desde el inicio de la aplicación y es equivalente al contador "Número de bytes de IL con compilación JIT". JITTED_IL_INST_00A_NAME=Bytes de IL con compilación JIT por segundo JITTED_IL_INST_00A_HELP=Este contador muestra la velocidad a la que los bytes de IL realizan la compilación JIT por segundo. Este contador no muestra un promedio de un período de tiempo sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. JIT_FAILURES_00A_NAME=Errores estándar de compilación JIT JIT_FAILURES_00A_HELP=Este contador muestra el número máximo de métodos que el compilador JIT no ha podido compilar desde el inicio de la aplicación. Este error puede ocurrir si no se puede comprobar el IL o si hubo un error interno del compilador JIT. TIME_IN_JIT_00A_NAME=% de tiempo de JIT TIME_IN_JIT_00A_HELP=Este contador muestra el porcentaje de tiempo transcurrido de compilación JIT transcurrido desde la última fase de compilación JIT y se actualiza al final de cada fase de compilación. Una fase de compilación JIT es la fase durante la cual se compilan el método y sus dependencias. TIME_IN_JIT_BASE_00A_NAME=No se muestra TIME_IN_JIT_BASE_00A_HELP=No se muestra. DotNetCLR_Interop_OBJECT_00A_NAME=Interoperabilidad de .NET CLR DotNetCLR_Interop_OBJECT_00A_HELP=Estadísticas de la interoperabilidad de CLR. CURRENT_CCW_00A_NAME=Número de contenedores CCW CURRENT_CCW_00A_HELP=Este contador muestra el número actual de contenedores invocables desde COM (CCW). Un contenedor CCW es un proxy del objeto administrado de .NET al que hacen referencia clientes COM sin administrar. Este contador se diseñó para indicar el número de objetos administrados a los que hace referencia un código COM sin administrar. CURRENT_STUBS_00A_NAME=Número de códigos auxiliares CURRENT_STUBS_00A_HELP=Este contador muestra el número actual de códigos auxiliares creados por CLR. Los códigos auxiliares son responsables de calcular las referencias de argumentos y valores devueltos de código administrado y no administrado y viceversa durante una llamada a la interoperabilidad COM o una llamada a PInvoke. NUM_MARSHALLING_00A_NAME=Número de cálculo de referencias NUM_MARSHALLING_00A_HELP=Este contador muestra el número total de veces que se han calculado las referencias de argumentos y valores devueltos del código administrado y no administrado y viceversa desde el inicio de la aplicación. Este contador no se incrementa si los códigos auxiliares están entre líneas. Los códigos auxiliares son responsables de calcular las referencias de argumentos y valores devueltos y normalmente están entre líneas si la sobrecarga del cálculo de referencias es pequeña. TOTAL_TLB_IMPORTS_00A_NAME=Número de importaciones TLB por segundo TOTAL_TLB_IMPORTS_00A_HELP=Reservado para uso futuro. TOTAL_TLB_EXPORTS_00A_NAME=Número de exportaciones TLB por segundo TOTAL_TLB_EXPORTS_00A_HELP=Reservado para uso futuro. DotNetCLR_LocksAndThreads_OBJECT_00A_NAME=LocksAndThreads de .NET CLR DotNetCLR_LocksAndThreads_OBJECT_00A_HELP=Estadísticas de los subprocesos y bloqueos de CLR. CONTENTION_TOTAL_00A_NAME=Número total de contenciones CONTENTION_TOTAL_00A_HELP=Este contador muestra el número total de veces que los subprocesos de CLR intentaron adquirir un bloqueo administrado sin éxito. Los bloqueos administrados se pueden adquirir de varias maneras: mediante la instrucción "lock" de C#, llamando a System.Monitor.Enter o utilizando el atributo personalizado MethodImplOptions.Synchronized. CONTENTION_INST_00A_NAME=Tasa de contención por segundo CONTENTION_INST_00A_HELP=La tasa en la que los subprocesos en tiempo de ejecución intentan adquirir un bloqueo administrado sin éxito. Los bloqueos administrados pueden adquirirse de varias maneras: mediante la instrucción "lock" de C#, llamando a System.Monitor.Enter o utilizando el atributo personalizado MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_00A_NAME=Longitud de cola actual QUEUE_LENGTH_CUR_00A_HELP=Este contador muestra el número total de subprocesos que esperan actualmente para adquirir algún bloqueo administrado de la aplicación y no muestra un promedio de un período de tiempo sino el último valor observado. QUEUE_LENGTH_TOTAL_00A_NAME=Máxima longitud de cola QUEUE_LENGTH_TOTAL_00A_HELP=Este contador muestra el número total de subprocesos que han esperado para adquirir algún bloqueo administrado desde el inicio de la aplicación. QUEUE_LENGTH_INST_00A_NAME=Longitud de la cola por segundo QUEUE_LENGTH_INST_00A_HELP=Este contador muestra el número de subprocesos por segundo que esperan para adquirir algún bloqueo de la aplicación y no muestra un promedio de un período de tiempo sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. CURRENT_LOGICAL_THREADS_00A_NAME=Número de subprocesos lógicos actuales CURRENT_LOGICAL_THREADS_00A_HELP=Este contador muestra el número actual de objetos de subproceso de .NET en la aplicación. El objeto de subproceso de .NET se crea mediante un nuevo subproceso System.Threading.Thread o cuando un subproceso sin administrar se introduce en el entorno administrado. Este contador mantiene el recuento de los subprocesos parados y en ejecución y no muestra un promedio de un período de tiempo sino el último valor observado. CURRENT_PHYSICAL_THREADS_00A_NAME=Número de subprocesos físicos actuales CURRENT_PHYSICAL_THREADS_00A_HELP=Este contador muestra el número de subprocesos nativos del SO creados y propiedad de CLR que actúan como subprocesos subyacentes de los objetos de subprocesos de .NET. El valor de estos contadores no incluye los subprocesos utilizados por CLR en las operaciones internas, es un subconjunto de subprocesos en el proceso del SO. RECOGNIZED_THREADS_CUR_00A_NAME=Número de subprocesos reconocidos actuales RECOGNIZED_THREADS_CUR_00A_HELP=Este contador muestra el número de subprocesos que CLR reconoce actualmente, que tienen asociado un objeto de subproceso de .NET correspondiente a estos subprocesos. CLR no crea estos subprocesos; se crean fuera de CLR pero se ejecutan dentro del mismo al menos una vez. Sólo se realiza el seguimiento de los subprocesos únicos; no se cuentan dos veces los subprocesos con el mismo id. de subproceso que vuelven a entrar a CLR o que se vuelven a crear después de la salida del subproceso. RECOGNIZED_THREADS_TOTAL_00A_NAME=Número de subprocesos totales reconocidos RECOGNIZED_THREADS_TOTAL_00A_HELP=Este contador muestra el número total de subprocesos que CLR reconoce desde el inicio de la aplicación; estos subprocesos tienen asociado un objeto de subproceso de .NET correspondiente. CLR no crea estos subprocesos, se crean fuera de CLR pero se ejecutan dentro del mismo al menos una vez. Sólo se realiza el seguimiento de subprocesos únicos; no se cuentan dos veces los subprocesos con el mismo id. de subproceso que vuelven a entrar a CLR o que se vuelven a crear después de la salida del subproceso. RECOGNIZED_THREADS_INST_00A_NAME=Tasa de subprocesos reconocidos por segundo RECOGNIZED_THREADS_INST_00A_HELP=Este contador muestra el número de subprocesos que CLR reconoce por segundo; estos subprocesos tienen asociado un objeto de subproceso de .NET correspondiente. CLR no crea estos subprocesos; se crean fuera de CLR pero se ejecutan dentro del mismo al menos una vez. Sólo se realiza el seguimiento de subprocesos únicos; no se cuentan dos veces los subprocesos con el mismo id. de subproceso que vuelven a entrar a CLR o que se vuelven a crear después de la salida del subproceso. Este contador no muestra un período de tiempo sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. DotNetCLR_Security_OBJECT_00A_NAME=Seguridad de .NET CLR DotNetCLR_Security_OBJECT_00A_HELP=Estadísticas de seguridad de CLR. SECURITY_TOTALRTCHECKS_00A_NAME=Número total de comprobaciones en tiempo de ejecución SECURITY_TOTALRTCHECKS_00A_HELP=Este contador muestra el número total de comprobaciones de seguridad de acceso del código (CAS) en tiempo de ejecución realizadas desde el inicio de la aplicación. Las comprobaciones CAS en tiempo de ejecución se realizan cuando el llamador efectúa una llamada al destinatario para solicitar un permiso determinado. El llamador realiza la comprobación en tiempo de ejecución de las llamadas examinando la pila actual de subprocesos del llamador. Este contador utilizado junto con la "Profundidad del recorrido de la pila" es el indicativo de la disminución de rendimiento de las comprobaciones de seguridad. SECURITY_TIMEAUTHORIZE_00A_NAME=% de tiempo autenticando firmas SECURITY_TIMEAUTHORIZE_00A_HELP=Reservado para uso futuro. SECURITY_LINKCHECKS_00A_NAME=Número de comprobaciones del tiempo de vinculación SECURITY_LINKCHECKS_00A_HELP=Este contador muestra el número total de comprobaciones de seguridad de acceso del código (CAS) del tiempo de vinculación desde el inicio de la aplicación. Las comprobaciones CAS del tiempo de vinculación se realizan cuando el llamador efectúa una llamada al destinatario para solicitar un permiso determinado en el tiempo de compilación JIT. El llamador realiza una vez la comprobación del tiempo de vinculación. Este recuento no es indicativo de problemas de rendimiento serios, pero sí de la actividad del sistema de seguridad. SECURITY_TIMERTCHECKS_00A_NAME=% de tiempo de comprobaciones RT SECURITY_TIMERTCHECKS_00A_HELP=Este contador muestra el porcentaje de tiempo transcurrido en realizar comprobaciones de seguridad de acceso del código (CAS) en tiempo de ejecución desde la última comprobación. Las comprobaciones CAS tienen diferentes grados de confianza para el código y exigen estos niveles de confianza dependiendo de la identidad del código. Este contador se actualiza al final de la comprobación de seguridad en tiempo de ejecución; no es un promedio ya que muestra el último valor observado. SECURITY_TIMERTCHECKS_BASE_00A_NAME=No se muestra SECURITY_TIMERTCHECKS_BASE_00A_HELP=No se muestra. SECURITY_DEPTHSECURITY_00A_NAME=Profundidad del recorrido de la pila SECURITY_DEPTHSECURITY_00A_HELP=Este contador muestra la profundidad de la pila durante la última comprobación de seguridad de acceso del código en tiempo de ejecución, que se realiza rastreando la pila. Este contador no es un promedio, sólo muestra el último valor observado. DotNetCLR_Remoting_OBJECT_00A_NAME=Entorno remoto de .NET CLR DotNetCLR_Remoting_OBJECT_00A_HELP=Estadísticas de comunicación remota de CLR. CONTEXT_REMOTECALLS_INST_00A_NAME=Llamadas remotas por segundo CONTEXT_REMOTECALLS_INST_00A_HELP=Este contador muestra el número de llamadas a procedimientos remotos invocadas por segundo. Una llamada a un procedimiento remoto se realiza llamando a cualquier objeto fuera del AppDomain del llamador. Este contador no es un promedio de tiempo, muestra la diferencia entre los valores observados de los últimos dos ejemplos dividida por la duración del intervalo de ejemplo. CONTEXT_CHANNELS_00A_NAME=Canales CONTEXT_CHANNELS_00A_HELP=Este contador muestra el número total de canales de comunicación remota registrados en los AppDomain desde el inicio de la aplicación. Los canales se utilizan para llevar mensajes hacia y desde objetos remotos. CONTEXT_PROXIES_00A_NAME=Servidores proxy de contexto CONTEXT_PROXIES_00A_HELP=Este contador muestra el número total de objetos proxy de comunicación remota creados en este proceso desde el inicio del proceso. El objeto proxy actúa como representante de los objetos remotos y garantiza que todas las llamadas que se hagan en el proxy se reenviarán a la instancia correcta del objeto remoto. CONTEXT_CLASSES_00A_NAME=Clases enlazadas a un contexto cargadas CONTEXT_CLASSES_00A_HELP=Este contenedor muestra el número actual de clases enlazadas a un contexto que están cargadas. Las clases que se pueden enlazar a un contexto se llaman clases enlazadas a un contexto. Estas clases se marcan con atributos de contexto que proporcionan reglas de uso sobre sincronización, afinidad de subprocesos, transacciones, etc. CONTEXT_OBJALLOC_00A_NAME=Asignación de objetos enlazados a un contexto por segundo CONTEXT_OBJALLOC_00A_HELP=Este contador muestra el número de asignaciones de objetos enlazados a un contexto por segundo. Las instancias de clases que se pueden enlazar a un contexto se llaman objetos enlazados a un contexto. Las clases enlazadas a un contexto se marcan con atributos de contexto que proporcionan reglas de sincronización, afinidad de subprocesos, transacciones, etc. Este contador no es un promedio de tiempo, sólo muestra la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. CONTEXT_CONTEXTS_00A_NAME=Contextos CONTEXT_CONTEXTS_00A_HELP=Este contador muestra el número actual de contextos de comunicación remota de la aplicación. El contexto es el límite que contiene la colección de objetos con las mismas reglas de uso sobre sincronización, afinidad de subprocesos, transacciones, etc. CONTEXT_REMOTECALLS_TOTAL_00A_NAME=Número total de llamadas remotas CONTEXT_REMOTECALLS_TOTAL_00A_HELP=Este contador muestra el número total de llamadas a procedimientos remotos invocadas desde el inicio de la aplicación. Una llamada a un procedimiento remoto es una llamada a un objeto fuera del AppDomain del llamador. DotNetCLR_Excep_OBJECT_00A_NAME=Excepciones de .NET CLR DotNetCLR_Excep_OBJECT_00A_HELP=Estadísticas en tiempo de ejecución del control de excepciones de CLR. EXCEP_THROWN_TOTAL_00A_NAME=Número de excepciones producidas EXCEP_THROWN_TOTAL_00A_HELP=Este contador muestra el número total de excepciones producidas desde el inicio de la aplicación. Éstas incluyen las excepciones de .NET y las excepciones sin administrar que se convierten en excepciones de .NET, por ejemplo, una excepción de referencia a un puntero nulo en un código no administrado se volvería a producir en código administrado como System.NullReferenceException de .NET; este contador incluye excepciones controladas y no controladas. Las excepciones que se vuelvan a producir se contabilizan de nuevo. Las excepciones sólo tienen lugar en situaciones excepcionales y no en el flujo de control normal del programa. EXCEP_THROWN_INST_00A_NAME=Número de excepciones producidas por segundo EXCEP_THROWN_INST_00A_HELP=Este contador muestra el número de excepciones producidas por segundo. Éstas incluyen excepciones de .NET y excepciones sin administrar que se convierten en excepciones de .NET, por ejemplo, una excepción de referencia a un puntero nulo en código no administrado se volvería a producir en código administrado como System.NullReferenceException de .NET; este contador incluye excepciones controladas y no controladas. Las excepciones sólo tienen lugar en situaciones excepcionales y no en el flujo de control normal del programa; este contador se diseñó como indicador de posibles problemas de rendimiento debido a la gran tasa de excepciones producidas (>100). Este contador no muestra el promedio de tiempo, sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. TOTAL_EXCEP_FILTERS_RUN_00A_NAME=Número de filtros por segundo TOTAL_EXCEP_FILTERS_RUN_00A_HELP=Este contador muestra el número de filtros de excepción de .NET ejecutados por segundo. Un filtro de excepción evalúa si se debe controlar una excepción o no. Este contador realiza un seguimiento de la tasa de filtros de excepción evaluados independientemente de si la excepción se controló o no. Este contador no es un promedio de tiempo, sólo muestra la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. TOTAL_EXCEP_FINALLYS_RUN_00A_NAME=Número de bloques Finally por segundo TOTAL_EXCEP_FINALLYS_RUN_00A_HELP=Este contador muestra el número de bloques finally ejecutados por segundo. Un bloque finally se ejecuta independientemente de cómo salió el bloque try. Sólo se cuentan los bloques finally ejecutados en una excepción; este contador no cuenta los bloques finally de rutas normales de código. Este contador no muestra un promedio de tiempo, sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. EXCEPT_STACK_DEPTH_00A_NAME=Profundidad por segundo de la instrucción Throw a la instrucción Catch EXCEPT_STACK_DEPTH_00A_HELP=Este contador muestra el número de marcos de pila que van desde el marco que produjo la excepción de .NET al marco que controló la excepción por segundo. Este contador se restablece a 0 cuando se proporciona el controlador de excepciones, para que las excepciones anidadas muestren al controlador la profundidad de pila del mismo. Este contador no muestra un promedio de tiempo, sino la diferencia entre los valores observados de los dos últimos ejemplos dividida por la duración del intervalo de ejemplo. DotNetCLR_Memory_OBJECT_00B_NAME=.NET CLR -muisti DotNetCLR_Memory_OBJECT_00B_HELP=Tiivistetyn CLR-keon laskurit. GEN0_COLLECTIONS_COUNTER_00B_NAME=Sukupolven 0 muistista poistamisten määrä GEN0_COLLECTIONS_COUNTER_00B_HELP=Tämä laskuri näyttää, montako kertaa sukupolven 0 objektit (eli uusimmat, viimeksi määritetyt objektit) on tiivistetty (Gen 0 GC) sovelluksen käynnistämisen jälkeen. Tämä tapahtuu, kun sukupolven 0 käytettävissä oleva muisti ei riitä määrityspyynnön suorittamiseen. Tätä laskuria kasvatetaan Gen 0 GC -toiminnon lopussa. Uudempien sukupolvien tiivistäminen sisältää kaikki vanhempien sukupolvien tiivistämiset. Tätä laskuria kasvatetaan eksplisiittisesti, kun uudemman sukupolven (Gen 1 tai Gen 2) muistin tiivistäminen suoritetaan. Laskuriarvo _Global_ ei ole tarkka, joten sitä ei pidä huomioida. Tämä laskuri näyttää viimeisimmän havaitun arvon. GEN1_COLLECTIONS_COUNTER_00B_NAME=Sukupolven 1 muistista poistamisten määrä GEN1_COLLECTIONS_COUNTER_00B_HELP=Tämä laskuri näyttää, montako kertaa sukupolven 1 objektit on tiivistetty sovelluksen käynnistämisen jälkeen. Tätä laskuria kasvatetaan Gen 1 GC -toiminnon lopussa. Uudempien sukupolvien tiivistäminen sisältää kaikki vanhempien sukupolvien tiivistämiset. Tätä laskuria kasvatetaan eksplisiittisesti, kun uudemman sukupolven (Gen 2) muistin tiivistäminen suoritetaan. Laskuriarvo _Global_ ei ole tarkka, joten sitä ei pidä huomioida. Tämä laskuri näyttää viimeisimmän havaitun arvon. GEN2_COLLECTIONS_COUNTER_00B_NAME=Sukupolven 2 muistista poistamisten määrä GEN2_COLLECTIONS_COUNTER_00B_HELP=Tämä laskuri näyttää, montako kertaa sukupolven 2 objektit (vanhemmat objektit) on tiivistetty sovelluksen käynnistämisen jälkeen. Tätä laskuria kasvatetaan Gen 2 GC -toiminnon (kutsutaan myös täydeksi muistin tiivistämiseksi) lopussa. Laskuriarvo _Global_ ei ole tarkka, joten sitä ei pidä huomioida. Tämä laskuri näyttää viimeisimmän havaitun arvon. GEN0_BYTES_PROMOTED_COUNTER_00B_NAME=Sukupolvesta 0 ylennetty muisti GEN0_BYTES_PROMOTED_COUNTER_00B_HELP=Tämä laskuri näyttää muistitavut, jotka jäävät jäljelle muistin tiivistämisen (GC) jälkeen ja jotka ylennetään sukupolvesta 0 sukupolveen 1; objektit, jotka ylennetään vain siksi, että niiden valmistumista odotetaan, eivät sisälly tämän laskurin tietoihin. Tämä laskuri näyttää viimeisimmän muistin tiivistämisen lopussa havaitun arvon. Laskuri ei ole kumulatiivinen. GEN1_BYTES_PROMOTED_COUNTER_00B_NAME=Sukupolvesta 1 ylennetty muisti GEN1_BYTES_PROMOTED_COUNTER_00B_HELP=Tämä laskuri näyttää muistitavut, jotka jäävät jäljelle muistin tiivistämisen (GC) jälkeen ja jotka ylennetään sukupolvesta 1 sukupolveen 2; objektit, jotka ylennetään vain siksi, että niiden valmistumista odotetaan, eivät sisälly tämän laskurin tietoihin. Tämä laskuri näyttää viimeisimmän muistin tiivistämisen lopussa havaitun arvon. Laskuri ei ole kumulatiivinen. Laskurin arvoksi palautetaan 0, jos viimeisin muistin tiivistäminen oli ainoastaan sukupolven 0 muistin tiivistäminen. GEN0_PROMOTION_RATE_00B_NAME=Sukupolven 0 ylennetyt tavut sekunnissa GEN0_PROMOTION_RATE_00B_HELP=Tämä laskuri näyttää sukupolvesta 0 (uusin) sukupolveen 1 ylennetyt tavut sekunnissa; objektit, jotka ylennetään vain siksi, että niiden valmistumista odotetaan, eivät sisälly tämän laskurin tietoihin. Muistin tiivistämisen jälkeen jäljelle jäänyt muisti ylennetään. Tämä laskuri suunniteltiin ilmaisemaan, montako suhteellisen pitkäikäistä objektia luodaan sekunnissa. Tämä laskuri näyttää arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. GEN1_PROMOTION_RATE_00B_NAME=Sukupolven 1 ylennetyt tavut sekunnissa GEN1_PROMOTION_RATE_00B_HELP=Tämä laskuri näyttää sukupolvesta 1 sukupolveen 2 (vanhin) ylennetyt tavut sekunnissa; objektit, jotka ylennetään vain siksi, että niiden valmistumista odotetaan, eivät sisälly tämän laskurin tietoihin. Muistin tiivistämisen jälkeen jäljelle jäänyt muisti ylennetään. Sukupolvesta 2 ei ylennetä mitään, sillä se on vanhin sukupolvi. Tämä laskuri suunniteltiin ilmaisemaan, montako hyvin pitkäikäistä objektia luodaan sekunnissa. Tämä laskuri näyttää arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00B_NAME=Sukupolvesta 0 ylennetty valmistumismuisti GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00B_HELP=Tämä laskuri näyttää muistitavut, jotka ylennetään sukupolvesta 0 sukupolveen 1 vain siksi, että niiden valmistumista odotetaan. Tämä laskuri näyttää viimeisimmän muistin tiivistämisen lopussa havaitun arvon. Laskuri ei ole kumulatiivinen. PROCESS_ID_00B_NAME=Prosessin tunnus PROCESS_ID_00B_HELP=Tämä laskuri näyttää valvottavan CLR-prosessin esiintymän tunnuksen. Näytettävä arvo on 0 ensimmäiseen muistin tiivistämiseen saakka. GEN0_HEAP_SIZE_COUNTER_00B_NAME=Sukupolven 0 keon koko GEN0_HEAP_SIZE_COUNTER_00B_HELP=Tämä laskuri näyttää enimmäismäärän tavuja, jotka voidaan määrittää sukupolvessa 0 (Gen 0); se ei ilmaise sukupolveen 0 määritettynä olevien tavujen määrää. Sukupolven 0 muistin tiivistäminen käynnistetään, kun viimeisimmän muistin tiivistämisen jälkeen tehdyt määritykset ylittävät tämän koon. Muistin tiivistäminen säätää sukupolven 0 kokoa, ja koko voi muuttua sovelluksen suorittamisen aikana. Sukupolven 0 muistin tiivistämisen lopussa Gen 0 -keon koko on 0 tavua. Tämä laskuri näyttää niiden määritysten koon (tavuina), jotka käynnistäisivät seuraavan sukupolven 0 muistin tiivistämisen. Tämä laskuri päivitetään muistin tiivistämisen lopussa, mutta ei jokaisen määrityksen yhteydessä. GEN1_HEAP_SIZE_COUNTER_00B_NAME=Sukupolven 1 keon koko GEN1_HEAP_SIZE_COUNTER_00B_HELP=Tämä laskuri näyttää sukupolven 1 (Gen 1) nykyisen tavumäärän. Laskuri ei näytä sukupolven 1 enimmäiskokoa. Tähän sukupolveen ei määritetä objekteja suoraan, vaan ne ylennetään aiemmista sukupolven 0 muistin tiivistämisistä. Tämä laskuri päivitetään muistin tiivistämisen lopussa, mutta ei jokaisen määrityksen yhteydessä. GEN2_HEAP_SIZE_COUNTER_00B_NAME=Sukupolven 2 keon koko GEN2_HEAP_SIZE_COUNTER_00B_HELP=Tämä laskuri näyttää sukupolven 2 (Gen 2) nykyisen tavumäärän. Tähän sukupolveen ei määritetä objekteja suoraan, vaan ne ylennetään aiemmista sukupolven 1 muistin tiivistämisistä. Tämä laskuri päivitetään muistin tiivistämisen lopussa, mutta ei jokaisen määrityksen yhteydessä. LARGE_OBJECT_SIZE_COUNTER_00B_NAME=Suurten objektien keon koko LARGE_OBJECT_SIZE_COUNTER_00B_HELP=Tämä laskuri näyttää suurten objektien keon (Large Object Heap) koon tavuina. Objekteja, joiden koko on raja-arvoa suurempi, käsitellään muistia tiivistettäessä suurina objekteina ja määritetään erityiseen kekoon suoraan. CLR 1.1:ssä ja uudemmissa versioissa tämä raja-arvo on 85 000 tavua. Laskuri päivitetään kunkin muistin tiivistämisen päätteeksi, muttei jokaisen määrityksen yhteydessä. SURVIVE_FINALIZE_COUNTER_00B_NAME=Viimeistelyn yhteydessä säästetyt SURVIVE_FINALIZE_COUNTER_00B_HELP=Tämä laskuri näyttää niiden muistin tiivistämisen objektien määrän, jotka säästyivät tiivistämiseltä sen vuoksi, että niiden valmistumista odotetaan. Jos näissä objekteissa on viittauksia muihin objekteihin, myös viitatut objektit säästetään. Laskuri ei kuitenkaan laske niitä; Sukupolvesta 0 ylennetty valmistumismuisti- ja Sukupolvesta 1 ylennetty valmistumismuisti -laskurit ilmaisevat kaiken muistin, joka säästettiin valmistumisen odottamisen vuoksi. Tämä laskuri ei ole kumulatiivinen, vaan se päivitetään jokaisen muistin tiivistämisen lopussa kyseisen tiivistämisen yhteydessä jäljelle jääneillä objekteilla. Tämä laskuri suunniteltiin ilmaisemaan ylimääräistä kuormitusta, jonka sovellus saattaa kohdata valmistumisprosessin vuoksi. NUM_HANDLES_COUNTER_00B_NAME=Muistista poistamisen kahvojen määrä NUM_HANDLES_COUNTER_00B_HELP=Tämä laskuri näyttää käytettävien muistin tiivistämisen kahvojen nykyisen määrän. Muistin tiivistämisen kahvat ovat CLR:n ja hallitun ympäristön ulkopuolisten resurssien kahvoja. Kahvat käyttävät pienen määrän muistin tiivistämisen keon muistia, mutta mahdollisesti säästävät sitä verrattuna muiden kuin hallittujen resurssien käyttämiseen. ALLOCATION_RATE_COUNTER_00B_NAME=Määritetyt tavut sekuntia kohti ALLOCATION_RATE_COUNTER_00B_HELP=Tämä laskuri näyttää muistin tiivistämisen keossa määritettyjen tavujen määrän sekunnissa. Tämä laskuri päivitetään muistin tiivistämisen lopussa, mutta ei jokaisen määrityksen yhteydessä. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. INDUCED_GC_COUNTER_00B_NAME=Käynnistettyjen muistista poistamisten määrä INDUCED_GC_COUNTER_00B_HELP=Tämä laskuri näyttää, montako kertaa muistin tiivistäminen suoritettiin sen vuoksi, että GC.Collect-funktiota kutsuttiin eksplisiittisesti. Muistin tiivistämisen kannattaa antaa säätää tiivistämisen aikavälit itse. PER_TIME_IN_GC_COUNTER_00B_NAME=Muistista poistamisen prosentuaalinen aika PER_TIME_IN_GC_COUNTER_00B_HELP=Muistin tiivistämisen prosentuaalinen aika on sen kuluneen ajan prosenttiosuus, joka käytettiin muistin tiivistämiseen edellisen muistin tiivistämisen jälkeen. Tämä laskuri ilmaisee yleensä muistin tiivistämisen sovelluksen puolesta suorittamaa työtä muistin tiivistämiseksi. Tämä laskuri päivitetään ainoastaan jokaisen muistin tiivistämisen lopussa, ja laskurin arvo ilmaisee viimeisen havaitun arvon. Se ei ole keskiarvo. PER_TIME_IN_GC_COUNTER_BASE_00B_NAME=Ei näytetä PER_TIME_IN_GC_COUNTER_BASE_00B_HELP=Ei näytetä. TOTAL_HEAP_SIZE_COUNTER_00B_NAME=Kaikkien kekojen tavujen määrä TOTAL_HEAP_SIZE_COUNTER_00B_HELP=Tämä laskuri on neljän muun laskurin summa: Sukupolven 0 keon koko, Sukupolven 1 keon koko, Sukupolven 2 keon koko ja Suurten objektien keon koko. Tämä laskuri ilmaisee muistin tiivistämisen kekoihin määritetyn muistin tavuina. TOTAL_COMMITTED_MEM_COUNTER_00B_NAME=Käytössä olevien tavujen kokonaismäärä TOTAL_COMMITTED_MEM_COUNTER_00B_HELP=Tämä laskuri näyttää sen näennäismuistin määrän (tavuina), jonka muistin tiivistäminen on varannut. (Varattuna oleva muisti on muisti, jolle on varattu tila levyn sivutustiedostosta.) TOTAL_RESERVED_MEM_COUNTER_00B_NAME=Varattujen tavujen kokonaismäärä TOTAL_RESERVED_MEM_COUNTER_00B_HELP=Tämä laskuri näyttää sen näennäismuistin määrän (tavuina), jonka muistin tiivistäminen on varannut. (Varattu muisti on sovellukselle varattu näennäismuistitila, kun levyä tai perusmuistisivuja ei ole käytetty.) GC_PINNED_OBJECTS_00B_NAME=Sidottujen objektien määrä GC_PINNED_OBJECTS_00B_HELP=Tämä laskuri näyttää viimeisimmässä muistin tiivistämisessä havaittujen sidottujen objektien määrän. Tämä laskuri etsii sidotut objektit ainoastaan keoista, joille suoritettiin muistin tiivistäminen, eli sukupolven 0 muistin tiivistäminen aiheuttaa sidottujen objektien laskemisen ainoastaan sukupolven 0 keosta. Muistin tiivistäminen ei voi siirtää sidottua objektia muistissa. GC_SINKBLOCKS_00B_NAME=Käytössä olevien synkronointilohkojen määrä GC_SINKBLOCKS_00B_HELP=Tämä laskuri näyttää käytettävien synkronointilohkojen määrän. Synkronointilohkot ovat objektikohtaisia tietorakenteita, jotka on varattu säilyttämään synkronointitiedot. Synkronointilohkoissa on hallittuihin objekteihin viittaavia heikkoja viittauksia, jotka muistin tiivistämisen pitää käydä läpi. Synkronointilohkot voivat säilyttää myös yhteiskäytössä olevaa COM-metatietoa. Tämä laskuri suunniteltiin ilmaisemaan suorituskykyongelmia synkronointiprimitiivien runsaassa käytössä. DotNetCLR_Loading_OBJECT_00B_NAME=.NET CLR -lataus DotNetCLR_Loading_OBJECT_00B_HELP=CLR Class Loaderin tilastot. LOADING_CLASSES_TOTAL_00B_NAME=Ladattuja luokkia yhteensä LOADING_CLASSES_TOTAL_00B_HELP=Tämä laskuri näyttää kaikkien kokoamisten lataamien luokkien kumulatiivisen määrän sovelluksen käynnistämisestä lähtien. LOADING_TIME_00B_NAME=Latausaikaprosentti LOADING_TIME_00B_HELP=Varattu tulevaa käyttöä varten. LOADING_ASMSEARCHLEN_00B_NAME=Kokoamisen hakupituus LOADING_ASMSEARCHLEN_00B_HELP=Varattu tulevaa käyttöä varten. LOADING_LOADFAILURES_TOTAL_00B_NAME=Latausvirheitä yhteensä LOADING_LOADFAILURES_TOTAL_00B_HELP=Tämä laskuri näyttää niiden luokkien määrän, joiden lataus epäonnistui sovelluksen käynnistämisestä lähtien. Nämä latausvirheet voivat aiheutua useista syistä, kuten riittämättömästä suojauksesta tai virheellisestä muodosta. Lisätietoja on profilointipalveluiden ohjeessa. LOADING_LOADFAILURES_INST_00B_NAME=Latausvirheiden esiintymistiheys LOADING_LOADFAILURES_INST_00B_HELP=Tämä laskuri näyttää lataamisessa epäonnistuneiden luokkien määrän sekunnissa. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. Nämä latausvirheet voivat aiheutua useista syistä, kuten riittämättömästä suojauksesta tai virheellisestä muodosta. Lisätietoja on profilointipalveluiden ohjeessa. LOADING_HEAPSIZE_00B_NAME=Latausohjelman keon tavut LOADING_HEAPSIZE_00B_HELP=Tämä laskuri näyttää luokan latausohjelman nykyisen varatun muistin koon (tavuina) kaikissa sovellustoimialueissa. (Varattuna oleva muisti on muisti, jolle on varattu tila levyn sivutustiedostosta.) LOADING_APPDOMAINS_UNLOADED_TOTAL_00B_NAME=AppDomain-toimialueiden latauksia poistettu yhteensä LOADING_APPDOMAINS_UNLOADED_TOTAL_00B_HELP=Tämä laskuri näyttää niiden sovellustoimialueiden niiden latausten poistojen määrän, jotka tehtiin sovelluksen käynnistämisen jälkeen. Jos sovellustoimialue ladataan useita kertoja ja sen lataus poistetaan, tämä laskuri pitää jokaista latauksen poistoa erillisenä poistona. LOADING_APPDOMAINS_UNLOADED_INST_00B_NAME=Sovellustoimialueiden latausten poistojen määrä sekunnissa LOADING_APPDOMAINS_UNLOADED_INST_00B_HELP=Tämä laskuri näyttää, monenko sovellustoimialueen lataus poistettiin sekunnissa. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. LOADING_CLASSES_CUR_00B_NAME=Luokkia ladattu LOADING_CLASSES_CUR_00B_HELP=Tämä laskuri näyttää kaikissa kokoamisissa ladattujen luokkien määrän. LOADING_CLASSES_INST_00B_NAME=Luokkien latausnopeus LOADING_CLASSES_INST_00B_HELP=Tämä laskuri näyttää kaikissa kokoamisissa ladattujen luokkien määrän sekunnissa. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. LOADING_APPDOMAINS_CUR_00B_NAME=Nykyiset AppDomain-toimialueet LOADING_APPDOMAINS_CUR_00B_HELP=Tämä laskuri näyttää tässä sovelluksessa ladattujen sovellustoimialueiden määrän. Sovellustoimialueet (AppDomain) tarjoavat suojatun ja monipuolisen käsittely-yksikön, jota CLR voi käyttää erottamaan samassa prosessissa suoritettavat sovellukset toisistaan. LOADING_APPDOMAINS_TOTAL_00B_NAME=AppDomain-toimialueiden määrä yhteensä LOADING_APPDOMAINS_TOTAL_00B_HELP=Tämä laskuri näyttää tämän sovelluksen käynnistämisen jälkeen ladattujen sovellustoimialueiden määrän. Sovellustoimialueet (AppDomain) tarjoavat suojatun ja monipuolisen käsittely-yksikön, jota CLR voi käyttää erottamaan samassa prosessissa suoritettavat sovellukset toisistaan. LOADING_APPDOMAINS_INST_00B_NAME=AppDomain-toimialueiden nopeus LOADING_APPDOMAINS_INST_00B_HELP=Tämä laskuri näyttää ladattujen sovellustoimialueiden määrän sekunnissa. Sovellustoimialueet (AppDomain) tarjoavat suojatun ja monipuolisen käsittely-yksikön, jota CLR voi käyttää erottamaan samassa prosessissa suoritettavat sovellukset toisistaan. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. LOADING_ASSEMBLIES_CUR_00B_NAME=Nykyiset kokoamiset LOADING_ASSEMBLIES_CUR_00B_HELP=Tämä laskuri näyttää kaikissa tämän sovelluksen sovellustoimialueissa ladattujen kokoamisten määrän. Jos kokoaminen on ladattu toimialueeseen kuulumattomana useista sovellustoimialueista, laskurin arvoa suurennetaan vain kerran. Kokoamiset voidaan ladata toimialueeseen kuulumattomina, kun kaikki AppDomain-toimialueet voivat jakaa niiden koodin, tai ne voidaan ladata toimialueeseen kuuluvina, kun niiden koodi kuuluu vain AppDomain-toimialueeseen. LOADING_ASSEMBLIES_TOTAL_00B_NAME=Kokoamisia yhteensä LOADING_ASSEMBLIES_TOTAL_00B_HELP=Tämä laskuri näyttää ladattujen kokoamisten kokonaismäärän sovelluksen käynnistämisen jälkeen. Jos kokoaminen on ladattu toimialueeseen kuulumattomana useista sovellustoimialueista, laskurin arvoa suurennetaan vain kerran. Kokoamiset voidaan ladata toimialueeseen kuulumattomina, kun kaikki sovellustoimialueet voivat jakaa niiden koodin, tai ne voidaan ladata toimialueeseen kuuluvina, kun niiden koodi kuuluu vain sovellustoimialueeseen. LOADING_ASSEMBLIES_INST_00B_NAME=Kokoamisten nopeus LOADING_ASSEMBLIES_INST_00B_HELP=Tämä laskuri näyttää kaikissa sovellustoimialueissa ladattujen kokoamisten määrän sekunnissa. Jos kokoaminen on ladattu toimialueeseen kuulumattomana useista sovellustoimialueista, laskurin arvoa suurennetaan vain kerran. Kokoamiset voidaan ladata toimialueeseen kuulumattomina, kun kaikki sovellustoimialueet voivat jakaa niiden koodin, tai ne voidaan ladata toimialueeseen kuuluvina, kun niiden koodi kuuluu vain sovellustoimialueeseen. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. DotNetCLR_Jit_OBJECT_00B_NAME=.NET CLR JIT -käännös DotNetCLR_Jit_OBJECT_00B_HELP=CLR JIT -käännöksen tilastot. TOTAL_METHODS_JITTED_00B_NAME=JIT-käännettyjen menetelmien määrä TOTAL_METHODS_JITTED_00B_HELP=Tämä laskuri näyttää CLR JIT -kääntäjän kääntämien (Just-In-Time, JIT) menetelmien määrän sovelluksen käynnistämisen jälkeen. Tämä laskuri ei sisällä JIT-esikäännettyjä menetelmiä. JITTED_IL_CUR_00B_NAME=JIT-käännettyjen IL-tavujen määrä JITTED_IL_CUR_00B_HELP=Tämä laskuri näyttää JIT-käännettyjen IL-tavujen kokonaismäärän sovelluksen käynnistämisen jälkeen. Tämä laskuri vastaa tarkalleen JIT-käännettyjen IL-tavujen kokonaismäärä -laskuria. JITTED_IL_TOTAL_00B_NAME=JIT-käännettyjen IL-tavujen kokonaismäärä JITTED_IL_TOTAL_00B_HELP=Tämä laskuri näyttää JIT-käännettyjen IL-tavujen kokonaismäärän sovelluksen käynnistämisen jälkeen. Tämä laskuri vastaa tarkalleen JIT-käännettyjen IL-tavujen määrä -laskuria. JITTED_IL_INST_00B_NAME=IL-tavuja JIT-käännetty sekunnissa JITTED_IL_INST_00B_HELP=Tämä laskuri näyttää, montako IL-tavua käännetään sekunnissa. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. JIT_FAILURES_00B_NAME=Yleiset JIT-virheet JIT_FAILURES_00B_HELP=Tämä laskuri näyttää, monenko menetelmän kohdalla JIT-kääntäjä on epäonnistunut sovelluksen käynnistämisen jälkeen. Tämä virhe voi tapahtua, jos IL:ää ei voida vahvistaa tai jos JIT-kääntäjä kohtaa sisäisen virheen. TIME_IN_JIT_00B_NAME=% JIT-käännöksen aika TIME_IN_JIT_00B_HELP=Tämä laskuri näyttää JIT-käännökseen kuluneen ajan prosentteina viimeisimmän JIT-käännösvaiheen jälkeen. Tämä laskuri päivitetään jokaisen JIT-käännösvaiheen lopussa. JIT-käännösvaihe on vaihe, jolloin menetelmä ja sen sidonnaiset käännetään. TIME_IN_JIT_BASE_00B_NAME=Ei näytetä TIME_IN_JIT_BASE_00B_HELP=Ei näytetä. DotNetCLR_Interop_OBJECT_00B_NAME=.NET CLR -yhteiskäyttö DotNetCLR_Interop_OBJECT_00B_HELP=CLR-yhteiskäytön tilastot. CURRENT_CCW_00B_NAME=CCW:iden määrä CURRENT_CCW_00B_HELP=Tämä laskuri näyttää CCW:n (Com-Callable-Wrapper) nykyisen määrän. CCW on välityspalvelin .NET-hallitulle objektille, johon viitataan muista kuin hallituista COM-asiakkaista. Tämä laskuri on suunniteltu ilmaisemaan muun kuin hallitun COM-koodin viittaamien hallittujen objektien määrää. CURRENT_STUBS_00B_NAME=Kantojen määrä CURRENT_STUBS_00B_HELP=Tämä laskin näyttää nykyisen CLR:n luomien kantojen määrän. Kannat järjestelevät argumentteja ja palauttavat arvoja hallitulta koodilta muulle kuin hallitulle koodille ja päinvastoin COM-yhteiskäyttö- tai PInvoke-kutsun aikana. NUM_MARSHALLING_00B_NAME=Järjestelyjen määrä NUM_MARSHALLING_00B_HELP=Tämä laskuri näyttää niiden kertojen määrän, jolloin argumentit ja palautusarvot ohjattiin hallitulta koodilta muulle kuin hallitulle koodille ja päinvastoin sovelluksen käynnistämisen jälkeen. Tämän laskurin arvoa ei suurenneta, jos kannat ovat sisäisiä. (Kannat vastaavat argumenttien ja palautusarvojen ohjaamisesta). Kannat ovat yleensä sisäisiä, jos ohjauksen määrä on pieni. TOTAL_TLB_IMPORTS_00B_NAME=TLB-tuontien määrä sekunnissa TOTAL_TLB_IMPORTS_00B_HELP=Varattu tulevaa käyttöä varten. TOTAL_TLB_EXPORTS_00B_NAME=TLB-vientien määrä sekunnissa TOTAL_TLB_EXPORTS_00B_HELP=Varattu tulevaa käyttöä varten. DotNetCLR_LocksAndThreads_OBJECT_00B_NAME=.NET CLR -lukitukset ja -säikeet DotNetCLR_LocksAndThreads_OBJECT_00B_HELP=CLR:n lukitusten ja säikeiden tilastot. CONTENTION_TOTAL_00B_NAME=Ristiriitojen kokonaismäärä CONTENTION_TOTAL_00B_HELP=Tämä laskuri näyttää niiden kertojen määrän, jolloin CLR:n säikeet ovat yrittäneet hankkia hallittua lukitusta tuloksetta. Hallitut lukitukset voidaan hankkia usealla tavalla: C#:n lock-lausekkeella, kutsumalla System.Monitor.Enter-funktiota tai käyttämällä mukautettua MethodImplOptions.Synchronized-määritettä. CONTENTION_INST_00B_NAME=Ristiriitojen määrä sekunnissa CONTENTION_INST_00B_HELP=Nopeus, jolla suorituksen aikaiset säikeet yrittävät hankkia lukitusta tuloksetta. Hallitut lukitukset voidaan hankkia usealla tavalla: C#:n lock-lausekkeella, kutsumalla System.Monitor.Enter-funktiota tai käyttämällä mukautettua MethodImplOptions.Synchronized-määritettä. QUEUE_LENGTH_CUR_00B_NAME=Nykyisen jonon pituus QUEUE_LENGTH_CUR_00B_HELP=Tämä laskuri näyttää niiden säikeiden määrä, jotka odottavat sovelluksen hallittua lukitusta. Tämän laskurin arvo on mitattu tietyllä hetkellä, eikä se ilmaise aikavälin keskiarvoa. QUEUE_LENGTH_TOTAL_00B_NAME=Jonon suurin pituus QUEUE_LENGTH_TOTAL_00B_HELP=Tämä laskuri näyttää niiden säikeiden määrän, jotka odottivat hallittua lukitusta sovelluksen käynnistämisen jälkeen. QUEUE_LENGTH_INST_00B_NAME=Jonon pituus sekuntia kohti QUEUE_LENGTH_INST_00B_HELP=Tämä laskuri näyttää niiden säikeiden määrän sekunnissa, jotka odottivat sovelluksen lukitusta. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. CURRENT_LOGICAL_THREADS_00B_NAME=Nykyisten loogisten säikeiden määrä CURRENT_LOGICAL_THREADS_00B_HELP=Tämä laskuri näyttää sovelluksen nykyisten .NET-säieobjektien määrän. .NET-säieobjektin luo uusi System.Threading.Thread, tai se luodaan, kun muu kuin hallittu säie tulee hallittuun ympäristöön. Tämä laskuri säilyttää sekä käynnissä olevien että pysäytettyjen säikeiden määrän. Tämän laskurin arvo on mitattu tietyllä hetkellä, eikä se ilmaise aikavälin keskiarvoa. CURRENT_PHYSICAL_THREADS_00B_NAME=Nykyisten fyysisten säikeiden määrä CURRENT_PHYSICAL_THREADS_00B_HELP=Tämä laskuri näyttää sellaisten CLR:n luomien ja omistamien OS-perussäikeiden määrän, jotka toimivat .NET-säieobjektien alisäikeinä. Tämän laskurin arvo ei sisällä CLR:n sisäisissä toimissa käytettäviä säikeitä, vaan se on OS-prosessin säikeiden alijoukko. RECOGNIZED_THREADS_CUR_00B_NAME=Nykyisten tunnistettujen säikeiden määrä RECOGNIZED_THREADS_CUR_00B_HELP=Tämä laskuri näyttää niiden CLR:n tunnistamien nykyisten säikeiden määrän, joille on määritetty vastaava .NET-säieobjekti. CLR ei luo näitä säikeitä, vaan ne luodaan CLR:n ulkopuolella. Säikeet on suoritettu CLR:n sisällä vähintään kerran. Vain yksilölliset säikeet jäljitetään; CLR:ään tulevia saman säietunnuksen omaavia säikeitä tai säikeen lopetuksen jälkeen uudelleenluotuja säikeitä ei lasketa kahdesti. RECOGNIZED_THREADS_TOTAL_00B_NAME=Tunnistettujen säikeiden kokonaismäärä RECOGNIZED_THREADS_TOTAL_00B_HELP=Tämä laskuri näyttää sellaisten CLR:n tunnistamien säikeiden kokonaismäärän sovelluksen käynnistämisen jälkeen, joille on määritetty vastaava .NET-säieobjekti. CLR ei luo näitä säikeitä, vaan ne luodaan CLR:n ulkopuolella. Säikeet on suoritettu CLR:n sisällä vähintään kerran. Vain yksilölliset säikeet jäljitetään; CLR:ään tulevia saman säietunnuksen omaavia säikeitä tai säikeen lopetuksen jälkeen uudelleenluotuja säikeitä ei lasketa kahdesti. RECOGNIZED_THREADS_INST_00B_NAME=tunnistettuja säikeitä sekunnissa RECOGNIZED_THREADS_INST_00B_HELP=Tämä laskuri näyttää sellaisten CLR:n tunnistamien säikeiden määrän, joille on määritetty vastaava .NET-säieobjekti. CLR ei luo näitä säikeitä, vaan ne luodaan CLR:n ulkopuolella. Säikeet on suoritettu CLR:n sisällä vähintään kerran. Vain yksilölliset säikeet jäljitetään; CLR:ään tulevia saman säietunnuksen omaavia säikeitä tai säikeen lopetuksen jälkeen uudelleenluotuja säikeitä ei lasketa kahdesti. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. DotNetCLR_Security_OBJECT_00B_NAME=.NET CLR -suojaus DotNetCLR_Security_OBJECT_00B_HELP=CLR-suojauksen tilastot. SECURITY_TOTALRTCHECKS_00B_NAME=Suorituksenaikaisia tarkistuksia yhteensä SECURITY_TOTALRTCHECKS_00B_HELP=Tämä laskuri näyttää tehtyjen suorituksenaikaisten CAS (Code Access Security) -tarkistusten määrän sovelluksen käynnistämisen jälkeen. Suorituksenaikaiset CAS-tarkistukset tehdään, kun kutsuja kutsuu kutsuttavaa vaatien erityistä lupaa. Suorituksenaikainen tarkistus tehdään kutsujan jokaiselle kutsulle. Tarkistuksessa tarkistetaan kutsujan säiepino. Tätä laskuria käytetään yhdessä Pinon läpikäyntisyvyys -laskurin avulla ilmaisemaan suojaustarkistusten suorituskykyrangaistusta. SECURITY_TIMEAUTHORIZE_00B_NAME=Aika-allekirjoitusten todennusten määrä SECURITY_TIMEAUTHORIZE_00B_HELP=Varattu tulevaa käyttöä varten. SECURITY_LINKCHECKS_00B_NAME=Linkkienaikaisten tarkistusten määrä SECURITY_LINKCHECKS_00B_HELP=Tämä laskuri näyttää linkkienaikaisten CAS (Code Access Security) -tarkistusten määrän sovelluksen käynnistämisen jälkeen. Linkkienaikaiset CAS-tarkistukset tehdään, kun kutsuja kutsuu kutsuttavaa vaatien erityistä lupaa JIT-käännöksen aikana. Linkkienaikainen tarkistus suoritetaan kerran kutsujaa kohden. Tämä määrä ei ilmaise vakavia suorituskykyongelmia vaan järjestelmän suojaustoimintaa. SECURITY_TIMERTCHECKS_00B_NAME=% RT-tarkistusten aika SECURITY_TIMERTCHECKS_00B_HELP=Tämä laskuri näyttää kuluneen ajan suhteen prosentteina suorituksenaikaisen CAS (Code Access Security) -tarkistuksen käyttämästä ajasta verrattuna edelliseen tarkistukseen. CAS mahdollistaa sen, että koodiin luotetaan eri tasoilla, ja se ylläpitää näitä luottamustasoja koodikohtaisesti. Tämä laskuri päivitetään suorituksenaikaisen suojaustarkistuksen lopussa. Se ei ole keskiarvo, vaan se ilmaisee viimeisimmän mitatun arvon. SECURITY_TIMERTCHECKS_BASE_00B_NAME=Ei näytetä SECURITY_TIMERTCHECKS_BASE_00B_HELP=Ei näytetä. SECURITY_DEPTHSECURITY_00B_NAME=Pinon läpikäyntisyvyys SECURITY_DEPTHSECURITY_00B_HELP=Tämä laskuri näyttää pinon syvyyden viimeisimmän suorituksenaikaisen Code Access Security -tarkistuksen aikana. Suorituksenaikainen Code Access Security -tarkistus tehdään käymällä pino läpi. Tämä laskuri näyttää vain viimeisimmän arvon, joka ei ole keskiarvo. DotNetCLR_Remoting_OBJECT_00B_NAME=.NET CLR -etäkäyttö DotNetCLR_Remoting_OBJECT_00B_HELP=CLR-etäkäytön tilastot. CONTEXT_REMOTECALLS_INST_00B_NAME=Etäkutsuja sekunnissa CONTEXT_REMOTECALLS_INST_00B_HELP=Tämä laskuri näyttää suoritettujen etäproseduurikutsujen määrän sekunnissa. Etäproseduurikutsu on mikä tahansa kutsujan sovellustoimialueen ulkopuolisen objektin kutsu. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. CONTEXT_CHANNELS_00B_NAME=Kanavat CONTEXT_CHANNELS_00B_HELP=Tämä laskuri näyttää kaikissa sovellustoimialueissa rekisteröityjen etäkanavien kokonaismäärän sovelluksen käynnistämisen jälkeen. Kanavien avulla sanomat siirretään etäobjekteille ja takaisin. CONTEXT_PROXIES_00B_NAME=Sisällön välityspalvelimet CONTEXT_PROXIES_00B_HELP=Tämä laskuri näyttää tässä prosessissa luotujen etävälityspalvelinobjektien kokonaismäärän prosessin käynnistämisen jälkeen. Välityspalvelinobjekti edustaa etäobjekteja ja varmistaa, että kaikki välityspalvelimeen tehdyt kutsut välitetään oikealle etäobjektille. CONTEXT_CLASSES_00B_NAME=Ladatut kontekstiin sidotut luokat CONTEXT_CLASSES_00B_HELP=Tämä laskuri näyttää ladattujen kontekstiin sidottujen luokkien määrän. Kontekstiin sidottuja luokkia merkitään kontekstin määritteillä, jotka sisältävät muun muassa synkronoinnin, säikeiden affiniteettien ja tapahtumien käyttösääntöjä. CONTEXT_OBJALLOC_00B_NAME=Määritetyt kontekstiin sidotut luokat sekunnissa CONTEXT_OBJALLOC_00B_HELP=Tämä laskuri näyttää kontekstiin sidottujen objektien määritysten määrän sekunnissa. Kontekstiin sidottuja luokkia merkitään kontekstin määritteillä, jotka sisältävät muun muassa synkronoinnin, säikeiden affiniteettien ja tapahtumien käyttösääntöjä. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. CONTEXT_CONTEXTS_00B_NAME=Kontekstit CONTEXT_CONTEXTS_00B_HELP=Tämä laskuri näyttää sovelluksen etäkontekstien nykyisen määrän. Konteksti on alue, joka sisältää sellaisten objektien kokoelman, joilla on samat käyttösäännöt esimerkiksi synkronoinnille, säikeiden affiniteeteille ja tapahtumille. CONTEXT_REMOTECALLS_TOTAL_00B_NAME=Etäkutsujen kokonaismäärä CONTEXT_REMOTECALLS_TOTAL_00B_HELP=Tämä laskuri näyttää suoritettujen etäkutsujen kokonaismäärän tämän sovelluksen käynnistämisestä lähtien. Etäproseduurikutsu on mikä tahansa kutsujan sovellustoimialueen ulkopuolisen objektin kutsu. DotNetCLR_Excep_OBJECT_00B_NAME=.NET CLR -poikkeukset DotNetCLR_Excep_OBJECT_00B_HELP=CLR-poikkeusten hallinnan suorituksenaikaiset tilastot. EXCEP_THROWN_TOTAL_00B_NAME=Poikkeusten määrä EXCEP_THROWN_TOTAL_00B_HELP=Tämä laskuri näyttää poikkeusten määrän sovelluksen käynnistämisen jälkeen. Näitä poikkeuksia ovat sekä .NET-poikkeukset että muut kuin hallittavat poikkeukset, jotka muunnetaan .NET-poikkeuksiksi. Muunnossa muun kuin hallittavan koodin tyhjä osoitinviittauspoikkeus siirretään hallittuun koodiin .NET System.NullReferenceException -poikkeuksena. Tämä laskuri sisältää käsitellyt ja käsittelemättömät poikkeukset. Uudelleenkäsitellyt poikkeukset lasketaan uudelleen. Poikkeuksia tapahtuu vain erittäin harvoin, eivätkä ne kuulu ohjelman tavalliseen toimintaan. EXCEP_THROWN_INST_00B_NAME=Poikkeusten määrä sekunnissa EXCEP_THROWN_INST_00B_HELP=Tämä laskuri näyttää poikkeusten määrän sekunnissa. Näitä poikkeuksia ovat sekä .NET-poikkeukset että muut kuin hallittavat poikkeukset, jotka muunnetaan .NET-poikkeuksiksi. Muunnossa muun kuin hallittavan koodin tyhjä osoitinviittauspoikkeus siirretään hallittuun koodiin .NET System.NullReferenceException -poikkeuksena. Tämä laskuri sisältää käsitellyt ja käsittelemättömät poikkeukset. Uudelleenkäsitellyt poikkeukset lasketaan uudelleen. Poikkeuksia tapahtuu vain erittäin harvoin, eivätkä ne kuulu ohjelman tavalliseen toimintaan. Tämä laskuri on suunniteltu mahdollisten suurista poikkeusmääristä (> 100) aiheutuvien suorituskykyongelmien ilmaisimeksi. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. TOTAL_EXCEP_FILTERS_RUN_00B_NAME=Suodattimien määrä sekunnissa TOTAL_EXCEP_FILTERS_RUN_00B_HELP=Tämä laskuri näyttää .NET-poikkeussuodattimien määrän sekunnissa. Poikkeussuodatin arvioi, käsitelläänkö poikkeus vai ei. Tämä laskuri seuraa arvioitujen poikkeussuodattimien määrää sekunnissa ottamatta huomioon sitä, käsiteltiinkö poikkeus vai ei. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. TOTAL_EXCEP_FINALLYS_RUN_00B_NAME=Loppulohkojen määrä sekunnissa TOTAL_EXCEP_FINALLYS_RUN_00B_HELP=Tämä laskuri näyttää suoritettujen loppulohkojen määrän sekunnissa. Nämä lohkot suoritetaan aina huolimatta siitä, miten koelohkosta poistuttiin. Vain poikkeukselle suoritetut loppulohkot lasketaan. Tämä laskuri ei laske normaalien koodipolkujen loppulohkoja. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. EXCEPT_STACK_DEPTH_00B_NAME=Poikkeuksia käsittelysyvyyteen sekunnissa EXCEPT_STACK_DEPTH_00B_HELP=Tämä laskuri näyttää .NET-poikkeuksen lähettämästä kehyksestä poikkeuksen käsittelevään kehykseen lähettämien pinon kehysten määrän sekunnissa. Tämän laskurin arvoksi palautetaan 0, kun kohdataan poikkeusten käsittelijä, joten sisäkkäiset poikkeukset näyttävät käsittelijän pinon syvyyden. Tämä laskuri ei näytä minkään ajanjakson keskiarvoa vaan arvon, joka saadaan, kun kahden viimeisimmän näytteen arvojen välinen ero jaetaan näytteiden ottovälin kestolla. DotNetCLR_Memory_OBJECT_00C_NAME=Mémoire CLR .NET DotNetCLR_Memory_OBJECT_00C_HELP=Compteurs pour le tas récupéré par le garbage collector CLR. GEN0_COLLECTIONS_COUNTER_00C_NAME=Nombre de collections de la génération 0 GEN0_COLLECTIONS_COUNTER_00C_HELP=Ce compteur affiche le nombre de fois où les objets de génération 0 (les plus récents, les derniers alloués) sont récupérés par le garbage collector (GC de génération 0) depuis le démarrage de l'application. Le GC de génération 0 intervient lorsque la mémoire disponible dans la génération 0 n'est pas suffisante pour répondre à une demande d'allocation. Ce compteur est incrémenté à la fin d'un GC de génération 0. Les GC de génération supérieure comprennent tous ceux de génération inférieure. Ce compteur est incrémenté de façon explicite lorsqu'un GC de génération supérieure (génération 1 ou 2) se produit. La valeur _Global_ counter n'est pas exacte et doit être ignorée. Ce compteur affiche la dernière valeur observée. GEN1_COLLECTIONS_COUNTER_00C_NAME=Nombre de collections de la génération 1 GEN1_COLLECTIONS_COUNTER_00C_HELP=Ce compteur affiche le nombre de fois où les objets de génération 1 sont récupérés par le garbage collector depuis le démarrage de l'application. Le compteur est incrémenté à la fin d'un GC de génération 1. Les GC de génération supérieure comprennent tous ceux de génération inférieure. Ce compteur est incrémenté de façon explicite lorsqu'un GC de génération supérieure (génération 2) se produit. La valeur _Global_ counter n'est pas exacte et doit être ignorée. Ce compteur affiche la dernière valeur observée. GEN2_COLLECTIONS_COUNTER_00C_NAME=Nombre de collections de la génération 2 GEN2_COLLECTIONS_COUNTER_00C_HELP=Ce compteur affiche le nombre de fois où les objets de génération 2 (les plus anciens) sont récupérés par le garbage collector depuis le démarrage de l'application. Le compteur est incrémenté à la fin d'un GC de génération 2 (également appelé GC complet). La valeur _Global_ counter n'est pas exacte et doit être ignorée. Ce compteur affiche la dernière valeur observée. GEN0_BYTES_PROMOTED_COUNTER_00C_NAME=Mémoire promue de la génération 0 GEN0_BYTES_PROMOTED_COUNTER_00C_HELP=Ce compteur affiche les octets de mémoire qui survivent au GC (garbage collection) et sont promus de la génération 0 à la génération 1 ; les objets qui sont promus uniquement car ils sont en attente de finalisation ne sont pas inclus dans ce compteur. Ce compteur affiche la valeur observée à la fin du dernier GC ; il ne s'agit pas d'un compteur cumulatif. GEN1_BYTES_PROMOTED_COUNTER_00C_NAME=Mémoire promue de la génération 1 GEN1_BYTES_PROMOTED_COUNTER_00C_HELP=Ce compteur affiche les octets de mémoire qui survivent au GC (garbage collection) et sont promus de la génération 1 à la génération 2 ; les objets qui sont promus uniquement car ils sont en attente de finalisation ne sont pas inclus dans ce compteur. Ce compteur affiche la valeur observée à la fin du dernier GC ; il ne s'agit pas d'un compteur cumulatif. Ce compteur est remis à 0 si le dernier GC était un GC de génération 0 uniquement. GEN0_PROMOTION_RATE_00C_NAME=Octets promus de la génération 0/s GEN0_PROMOTION_RATE_00C_HELP=Ce compteur affiche les octets par seconde qui sont promus de la génération 0 (la plus récente) à la génération 1 ; les objets qui sont promus uniquement car ils sont en attente de finalisation ne sont pas inclus dans ce compteur. La mémoire est promue lorsqu'elle survit à une opération garbage collection. Ce compteur a été conçu en tant qu'indicateur d'objets à durée de vie relativement longue créés par seconde. Il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. GEN1_PROMOTION_RATE_00C_NAME=Octets promus de la génération 1/s GEN1_PROMOTION_RATE_00C_HELP=Ce compteur affiche les octets par seconde qui sont promus de la génération 1 à la génération 2 (la plus ancienne); les objets qui sont promus uniquement car ils sont en attente de finalisation ne sont pas inclus dans ce compteur. La mémoire est promue lorsqu'elle survit à une opération garbage collection. Aucun élément n'est promu à partir de la génération 2, dans la mesure où il s'agit de la plus ancienne. Ce compteur a été conçu en tant qu'indicateur d'objets à durée de vie très longue créés par seconde. Il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00C_NAME=Finalisation-mémoire promues de la génération 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00C_HELP=Ce compteur affiche les octets de mémoire qui sont promus de la génération 0 à la génération 1 uniquement car ils sont en attente de finalisation. Ce compteur affiche la valeur observée à la fin du dernier GC ; il ne s'agit pas d'un compteur cumulatif. PROCESS_ID_00C_NAME=ID de processus PROCESS_ID_00C_HELP=Ce compteur affiche l'ID de processus de l'instance du processus CLR qui est surveillée. La valeur affichée sera 0 jusqu'à la fin du premier garbage collection. GEN0_HEAP_SIZE_COUNTER_00C_NAME=Taille du tas de la génération 0 GEN0_HEAP_SIZE_COUNTER_00C_HELP=Ce compteur affiche le nombre maximal d'octets qui peuvent être alloués à la génération 0 ; il n'indique pas le nombre actuel d'octets alloués à la génération 0. Un GC de génération 0 est déclenché lorsque les allocations effectuées depuis le dernier GC dépassent cette taille. La taille de la génération 0 est définie par le Garbage Collector et peut être modifiée lors de l'exécution de l'application. À la fin d'une collection de génération 0, la taille du tas de génération 0 est en fait de 0 octet ; ce compteur affiche la taille (en octets) des allocations qui déclenchent le prochain GC de génération 0. Ce compteur est mis à jour à la fin d'un GC, et non à chaque allocation. GEN1_HEAP_SIZE_COUNTER_00C_NAME=Taille du tas de la génération 1 GEN1_HEAP_SIZE_COUNTER_00C_HELP=Ce compteur affiche le nombre actuel d'octets dans la génération 1 ; il n'affiche pas la taille maximale de la génération 1. Les objets ne sont pas alloués directement à cette génération ; ils sont promus à partir des GC de génération 0 précédents. Ce compteur est mis à jour à la fin d'un GC, et non à chaque allocation. GEN2_HEAP_SIZE_COUNTER_00C_NAME=Taille du tas de la génération 2 GEN2_HEAP_SIZE_COUNTER_00C_HELP=Ce compteur affiche le nombre actuel d'octets dans la génération 2. Les objets ne sont pas alloués directement à cette génération ; ils sont promus à partir de la génération 1 lors des GC de génération 1 précédents. Ce compteur est mis à jour à la fin d'un GC, et non à chaque allocation. LARGE_OBJECT_SIZE_COUNTER_00C_NAME=Taille du tas des objets volumineux LARGE_OBJECT_SIZE_COUNTER_00C_HELP=Ce compteur affiche la taille actuelle du tas des objets volumineux en octets. Les objets dont la taille est supérieure au seuil sont considérés comme des grands objets par le Garbage Collector et sont directement alloués à un tas spécial ; ils ne sont pas promus d'une génération à l'autre. Dans CLR version 1.1 et ultérieures, ce seuil est égal à 85 000 octets. Ce compteur est mis à jour à la fin d'un GC et non à chaque allocation. SURVIVE_FINALIZE_COUNTER_00C_NAME=Survivants de finalisation SURVIVE_FINALIZE_COUNTER_00C_HELP=Ce compteur affiche le nombre d'objets récupérés par le garbage collector qui survivent à une collecte, car ils sont en attente de finalisation. Si ces objets comportent des références à d'autres objets, ces derniers survivent également, mais ne sont pas comptés par ce compteur. Les compteurs "Promoted Finalization-Memory from Gen 0" et "Promoted Finalization-Memory from Gen 1" représentent toute la mémoire qui a survécu grâce à la finalisation. Ce compteur n'est pas cumulatif ; il est mis à jour à la fin de chaque GC avec le compte de survivants à ce GC uniquement. Ce compteur a été conçu pour indiquer la charge supplémentaire que l'application peut subir en raison de la finalisation. NUM_HANDLES_COUNTER_00C_NAME=Nombre de handles GC NUM_HANDLES_COUNTER_00C_HELP=Ce compteur affiche le nombre actuel de handles GC utilisés. Les Handles GC sont des handles pour les ressources externes au CLR et à l'environnement managé. Les handles occupent de petites quantités de mémoire dans le tas GC, mais nécessitent des ressources non managées qui peuvent être coûteuses. ALLOCATION_RATE_COUNTER_00C_NAME=Octets alloués/s ALLOCATION_RATE_COUNTER_00C_HELP=Ce compteur affiche le taux d'octets par seconde alloués au tas GC. Il est mis à jour à la fin de chaque GC et non à chaque allocation. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. INDUCED_GC_COUNTER_00C_NAME=Nombre GC induit INDUCED_GC_COUNTER_00C_HELP=Ce compteur affiche le nombre maximal de fois où un garbage collection a été effectué en raison d'un appel explicite à GC.Collect. Il est conseillé de laisser le GC régler la fréquence de ses collections. PER_TIME_IN_GC_COUNTER_00C_NAME=% temps dans le GC PER_TIME_IN_GC_COUNTER_00C_HELP=% Temps dans le GC représente le pourcentage de temps passé à exécuter une opération GC (garbage collection) depuis le dernier cycle GC. Ce compteur est habituellement un indicateur du travail effectué par le Garbage Collector de la part de l'application pour collecter et compresser de la mémoire. Ce compteur n'est mis à jour qu'à la fin de chaque GC et sa valeur reflète la dernière valeur observée ; il ne représente pas une moyenne. PER_TIME_IN_GC_COUNTER_BASE_00C_NAME=Non affiché PER_TIME_IN_GC_COUNTER_BASE_00C_HELP=Non affiché. TOTAL_HEAP_SIZE_COUNTER_00C_NAME=Nombre d'octets dans tous les tas TOTAL_HEAP_SIZE_COUNTER_00C_HELP=Ce compteur est la somme de quatre autres compteurs : Gen 0 Heap Size, Gen 1 Heap Size, Gen 2 Heap Size et Large Object Heap Size. Il indique la mémoire actuellement allouée en octets aux tas GC. TOTAL_COMMITTED_MEM_COUNTER_00C_NAME=Nombre total d'octets validés TOTAL_COMMITTED_MEM_COUNTER_00C_HELP=Ce compteur affiche la quantité de mémoire virtuelle (en octets) actuellement allouée par le Garbage Collector. (La mémoire allouée est la mémoire physique pour laquelle l'espace a été réservé dans le fichier d'échange du disque.) TOTAL_RESERVED_MEM_COUNTER_00C_NAME=Nombre total d'octets réservés TOTAL_RESERVED_MEM_COUNTER_00C_HELP=Ce compteur affiche la quantité de mémoire virtuelle (en octets) actuellement réservée par le Garbage Collector. (La mémoire réservée est l'espace de mémoire virtuelle réservé à l'application, mais aucun disque, ni page de mémoire principale n'ont été utilisés.) GC_PINNED_OBJECTS_00C_NAME=Nombre d'objets épinglés GC_PINNED_OBJECTS_00C_HELP=Ce compteur affiche le nombre d'objets épinglés trouvés dans le dernier GC. Il effectue le suivi des objets épinglés uniquement dans les tas récupérés par le garbage collector (par exemple un GC de génération 0 entraîne l'énumération des objets épinglés dans le tas de génération 0 uniquement). Un objet épinglé ne peut pas être déplacé par le Garbage Collector dans la mémoire. GC_SINKBLOCKS_00C_NAME=Nombre de blocs de synchronisation utilisés GC_SINKBLOCKS_00C_HELP=Ce compteur affiche le nombre actuel de blocs de synchronisation utilisés. Les blocs de synchronisation sont des structures de données par objet allouées pour le stockage des informations de synchronisation. Ils comportent des références faibles aux objets managés et doivent être analysés par le Garbage Collector. Ces blocs ne sont pas limités au stockage des informations de synchronisation et peuvent également stocker des métadonnées COM Interop. Ce compteur a été conçu pour indiquer des problèmes de performances lors de l'utilisation intensive des primitives de synchronisation. DotNetCLR_Loading_OBJECT_00C_NAME=Chargement CLR .NET DotNetCLR_Loading_OBJECT_00C_HELP=Statistiques du chargeur de classes CLR. LOADING_CLASSES_TOTAL_00C_NAME=Total de classes chargées LOADING_CLASSES_TOTAL_00C_HELP=Ce compteur affiche le nombre cumulatif de classes chargées dans tous les assemblys depuis le démarrage de cette application. LOADING_TIME_00C_NAME=% temps chargement LOADING_TIME_00C_HELP=Réservé pour un usage futur. LOADING_ASMSEARCHLEN_00C_NAME=Longueur de la recherche de l'assembly LOADING_ASMSEARCHLEN_00C_HELP=Réservé pour un usage futur. LOADING_LOADFAILURES_TOTAL_00C_NAME=Total des échecs de chargement LOADING_LOADFAILURES_TOTAL_00C_HELP=Ce compteur affiche le nombre maximal de classes qui n'ont pas pu être chargées depuis le démarrage de l'application. Ces échecs de chargement peuvent avoir de nombreuses causes, telles qu'une sécurité inappropriée ou un format non conforme. Vous trouverez tous les détails dans l'aide des services de profil. LOADING_LOADFAILURES_INST_00C_NAME=Taux d'échecs de chargement LOADING_LOADFAILURES_INST_00C_HELP=Ce compteur affiche le nombre de classes qui n'ont pas pu être chargées par seconde. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. Ces échecs de chargement peuvent avoir de nombreuses causes, telles qu'une sécurité inappropriée ou un format non conforme. Vous trouverez tous les détails dans l'aide des services de profil. LOADING_HEAPSIZE_00C_NAME=Octets dans le tas du chargeur LOADING_HEAPSIZE_00C_HELP=Ce compteur affiche la taille actuelle (en octets) de la mémoire allouée par le chargeur de classes à tous les AppDomains. (La mémoire allouée est la mémoire physique pour laquelle l'espace a été réservé dans le fichier d'échange du disque.) LOADING_APPDOMAINS_UNLOADED_TOTAL_00C_NAME=Total de appdomains déchargés LOADING_APPDOMAINS_UNLOADED_TOTAL_00C_HELP=Ce compteur affiche le nombre total de AppDomains déchargés depuis le démarrage de l'application. Si un AppDomain est chargé, puis déchargé plusieurs fois, ce compteur compte séparément chaque déchargement. LOADING_APPDOMAINS_UNLOADED_INST_00C_NAME=Taux des appdomains déchargés LOADING_APPDOMAINS_UNLOADED_INST_00C_HELP=Ce compteur affiche le nombre de AppDomains déchargés par seconde. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. LOADING_CLASSES_CUR_00C_NAME=Classes chargées actuelles LOADING_CLASSES_CUR_00C_HELP=Ce compteur affiche le nombre actuel de classes chargées dans tous les assemblys. LOADING_CLASSES_INST_00C_NAME=Taux des classes chargées LOADING_CLASSES_INST_00C_HELP=Ce compteur affiche le nombre de classes chargées par seconde dans tous les assemblys. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. LOADING_APPDOMAINS_CUR_00C_NAME=Appdomains actuels LOADING_APPDOMAINS_CUR_00C_HELP=Ce compteur affiche le nombre de AppDomains actuellement chargés dans cette application. Les AppDomains (domaines d'application) fournissent une unité de traitement sécurisée et polyvalente que le CLR peut utiliser pour offrir une isolation entre les applications exécutées dans le même processus. LOADING_APPDOMAINS_TOTAL_00C_NAME=Total de Appdomains LOADING_APPDOMAINS_TOTAL_00C_HELP=Ce compteur affiche le nombre maximal de AppDomains chargés depuis le démarrage de cette application. Les AppDomains (domaines d'application) fournissent une unité de traitement sécurisée et polyvalente que le CLR peut utiliser pour offrir une isolation entre les applications exécutées dans le même processus. LOADING_APPDOMAINS_INST_00C_NAME=Taux de Appdomains LOADING_APPDOMAINS_INST_00C_HELP=Ce compteur affiche le nombre de AppDomains chargés par seconde. Les AppDomains (domaines d'application) fournissent une unité de traitement sécurisée et polyvalente que le CLR peut utiliser pour offrir une isolation entre les applications exécutées dans le même processus. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. LOADING_ASSEMBLIES_CUR_00C_NAME=Assemblys actuels LOADING_ASSEMBLIES_CUR_00C_HELP=Ce compteur affiche le nombre d'assemblys actuellement chargés dans tous les AppDomains de cette application. Si l'assembly est chargé comme étant indépendant du domaine à partir de plusieurs AppDomains, ce compteur n'est incrémenté qu'une seule fois. Les assemblys peuvent être chargés comme étant indépendants du domaine lorsque leur code peut être partagé par tous les AppDomains ou comme étant spécifiques au domaine lorsque leur code est privé pour le AppDomain. LOADING_ASSEMBLIES_TOTAL_00C_NAME=Total d'assemblys LOADING_ASSEMBLIES_TOTAL_00C_HELP=Ce compteur affiche le nombre total d'assemblys chargés depuis le démarrage de cette application. Si l'assembly est chargé comme étant indépendant du domaine à partir de plusieurs AppDomains, ce compteur n'est incrémenté qu'une seule fois. Les assemblys peuvent être chargés comme étant indépendants du domaine lorsque leur code peut être partagé par tous les AppDomains ou comme étant spécifiques au domaine lorsque leur code est privé pour le AppDomain. LOADING_ASSEMBLIES_INST_00C_NAME=Taux des assemblys LOADING_ASSEMBLIES_INST_00C_HELP=Ce compteur affiche le nombre d'assemblys chargés dans tous les AppDomains par seconde. Si l'assembly est chargé comme étant indépendant du domaine à partir de plusieurs AppDomains, ce compteur n'est incrémenté qu'une seule fois. Les assemblys peuvent être chargés comme étant indépendants du domaine lorsque leur code peut être partagé par tous les AppDomains ou comme étant spécifiques au domaine lorsque leur code est privé pour le AppDomain. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. DotNetCLR_Jit_OBJECT_00C_NAME=Jit CLR .NET DotNetCLR_Jit_OBJECT_00C_HELP=Statistiques de Jit CLR. TOTAL_METHODS_JITTED_00C_NAME=Nombre de méthodes traitées avec Jit TOTAL_METHODS_JITTED_00C_HELP=Ce compteur affiche le nombre total de méthodes compilées juste-à-temps (JIT) par le compilateur JIT CLR depuis le démarrage de l'application. Ce compteur n'inclut pas les méthodes ayant subi un traitement pré-JIT. JITTED_IL_CUR_00C_NAME=Nombre d'octets IL traités avec Jit JITTED_IL_CUR_00C_HELP=Ce compteur affiche le nombre total d'octets IL traités avec Jit depuis le démarrage de l'application. Ce compteur équivaut exactement au compteur "Nombre total d'octets IL traités avec Jit". JITTED_IL_TOTAL_00C_NAME=Nombre total d'octets IL traités avec Jit JITTED_IL_TOTAL_00C_HELP=Ce compteur affiche le nombre total d'octets IL traités avec Jit depuis le démarrage de l'application. Ce compteur équivaut exactement au compteur "Nombre d'octets IL traités avec Jit". JITTED_IL_INST_00C_NAME=Octets IL traités avec Jit/s JITTED_IL_INST_00C_HELP=Ce compteur affiche le taux auquel les octets IL sont traités avec Jit par seconde. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. JIT_FAILURES_00C_NAME=Échecs Jit standard JIT_FAILURES_00C_HELP=Ce compteur affiche le nombre maximal de méthodes que le compilateur JIT n'a pas pu traiter depuis le démarrage de l'application. Cet échec peut avoir lieu si l'octet IL ne peut pas être vérifié ou qu'une erreur interne s'est produite dans le compilateur JIT. TIME_IN_JIT_00C_NAME=% temps en Jit TIME_IN_JIT_00C_HELP=Ce compteur affiche le pourcentage de temps passé à la compilation JIT depuis la dernière phase de compilation JIT. Ce compteur est mis à jour à la fin de chaque phase de compilation JIT, qui est la phase pendant laquelle une méthode et ses dépendances sont compilées. TIME_IN_JIT_BASE_00C_NAME=Non affiché TIME_IN_JIT_BASE_00C_HELP=Non affiché. DotNetCLR_Interop_OBJECT_00C_NAME=Interopérabilité CLR .NET DotNetCLR_Interop_OBJECT_00C_HELP=Statistiques de l'interopérabilité CLR. CURRENT_CCW_00C_NAME=Nombre CCW CURRENT_CCW_00C_HELP=Ce compteur affiche le nombre actuel de CCW (Com-Callable-Wrappers). Un CCW est un proxy pour l'objet managé .NET référencé à partir de clients COM non managés. Ce compteur a été conçu pour indiquer le nombre d'objets managés référencés par le code COM non managé. CURRENT_STUBS_00C_NAME=Nombre de stubs CURRENT_STUBS_00C_HELP=Ce compteur affiche le nombre actuel de stubs créés par le CLR. Les stubs sont chargés de marshaler les arguments et les valeurs de retour entre le code managé et le code non managé, lors d'un appel COM Interop ou PInvoke. NUM_MARSHALLING_00C_NAME=Nombre de marshaling NUM_MARSHALLING_00C_HELP=Ce compteur affiche le nombre total de fois où les arguments et les valeurs de retour ont été marshalés entre le code managé et le code non managé depuis le démarrage de l'application. Ce compteur n'est pas incrémenté si les stubs sont inline. (Les stubs sont chargés de marshaler les arguments et les valeurs de retour). Les stubs sont en général inline si la charge mémoire de marshaling est faible. TOTAL_TLB_IMPORTS_00C_NAME=Nombre d'importations TLB/s TOTAL_TLB_IMPORTS_00C_HELP=Réservé pour un usage futur. TOTAL_TLB_EXPORTS_00C_NAME=Nombre d'exportations TLB/s TOTAL_TLB_EXPORTS_00C_HELP=Réservé pour un usage futur. DotNetCLR_LocksAndThreads_OBJECT_00C_NAME=Verrous et threads CLR .NET DotNetCLR_LocksAndThreads_OBJECT_00C_HELP=Statistiques des verrous et threads CLR. CONTENTION_TOTAL_00C_NAME=Nombre total de conflits CONTENTION_TOTAL_00C_HELP=Ce compteur affiche le nombre total de fois où les threads dans le CLR ont tenté en vain d'acquérir un verrou managé. Les verrous managés peuvent être acquis de différentes manières :par l'instruction "lock" dans C#, en appelant System.Monitor.Enter ou en utilisant l'attribut personnalisé MethodImplOptions.Synchronized. CONTENTION_INST_00C_NAME=Taux de conflits/s CONTENTION_INST_00C_HELP=Taux auquel les threads dans le runtime tentent en vain d'acquérir un verrou managé. Les verrous managés peuvent être acquis de différentes manières :par l'instruction "lock" dans C#, en appelant System.Monitor.Enter ou en utilisant l'attribut personnalisé MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_00C_NAME=Longueur de la file actuelle QUEUE_LENGTH_CUR_00C_HELP=Ce compteur affiche le nombre total de threads actuellement en attente d'acquisition d'un verrou managé dans l'application. Ce compteur ne représente pas une moyenne temporelle ; il affiche la dernière valeur observée. QUEUE_LENGTH_TOTAL_00C_NAME=Longueur de la file maximale QUEUE_LENGTH_TOTAL_00C_HELP=Ce compteur affiche le nombre total de threads qui ont attendu pour acquérir un verrou managé depuis le démarrage de l'application. QUEUE_LENGTH_INST_00C_NAME=Longueur de la file/s QUEUE_LENGTH_INST_00C_HELP=Ce compteur affiche le nombre de threads par seconde en attente d'acquisition d'un verrou dans l'application. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. CURRENT_LOGICAL_THREADS_00C_NAME=Nombre de threads actuels logiques CURRENT_LOGICAL_THREADS_00C_HELP=Ce compteur affiche le nombre d'objets thread .NET actuels dans l'application. Un objet thread .NET est créé par le nouveau System.Threading.Thread ou lorsqu'un thread non managé entre dans l'environnement managé. Ce compteur gère le compte des threads en cours d'exécution et arrêtés. Il ne représente pas une moyenne temporelle ; il affiche uniquement la dernière valeur observée. CURRENT_PHYSICAL_THREADS_00C_NAME=Nombre de threads actuels physiques CURRENT_PHYSICAL_THREADS_00C_HELP=Ce compteur affiche le nombre de threads natifs du système d'exploitation créés et détenus par le CLR pour jouer le rôle de threads sous-jacents pour les objets thread .NET. La valeur de ce compteur n'inclut pas les threads utilisés par le CLR dans ses opérations internes ; il s'agit d'un sous-ensemble des threads dans le processus du système d'exploitation. RECOGNIZED_THREADS_CUR_00C_NAME=Nombre de threads actuellement reconnus RECOGNIZED_THREADS_CUR_00C_HELP=Ce compteur affiche le nombre de threads actuellement reconnus par le CLR ; un objet thread .NET correspondant leur est associé. Ces threads ne sont pas créés par le CLR ; ils sont créés en dehors du CLR, mais ont depuis été exécutés au moins une fois à l'intérieur du CLR. Seuls les threads uniques sont suivis ; ceux qui ont le même ID de thread et qui entrent à nouveau dans le CLR, ou ceux recréés après l'arrêt de thread ne sont pas comptés deux fois. RECOGNIZED_THREADS_TOTAL_00C_NAME=Nombre total de threads reconnus RECOGNIZED_THREADS_TOTAL_00C_HELP=Ce compteur affiche le nombre total de threads reconnus par le CLR depuis le démarrage de cette application ; un objet thread .NET correspondant leur est associé. Ces threads ne sont pas créés par le CLR ; ils sont créés en dehors du CLR, mais ont depuis été exécutés au moins une fois à l'intérieur du CLR. Seuls les threads uniques sont suivis ; ceux qui ont le même ID de thread et qui entrent à nouveau dans le CLR, ou ceux recréés après l'arrêt de thread ne sont pas comptés deux fois. RECOGNIZED_THREADS_INST_00C_NAME=taux de threads reconnus/s RECOGNIZED_THREADS_INST_00C_HELP=Ce compteur affiche le nombre de threads par seconde reconnus par le CLR ; un objet thread .NET correspondant leur est associé. Ces threads ne sont pas créés par le CLR ; ils sont créés en dehors du CLR, mais ont depuis été exécutés au moins une fois à l'intérieur du CLR. Seuls les threads uniques sont suivis ; ceux qui ont le même ID de thread et qui entrent à nouveau dans le CLR, ou ceux recréés après l'arrêt de thread ne sont pas comptés deux fois. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. DotNetCLR_Security_OBJECT_00C_NAME=Sécurité CLR .NET DotNetCLR_Security_OBJECT_00C_HELP=Statistiques de la sécurité CLR. SECURITY_TOTALRTCHECKS_00C_NAME=Total de vérifications à l'exécution SECURITY_TOTALRTCHECKS_00C_HELP=Ce compteur affiche le nombre total de vérifications Sécurité d'Accès du Code (CAS) à l'exécution effectuées depuis le démarrage de l'application. Ces vérifications sont effectuées lorsqu'un utilisateur en appelle un autre pour demander une autorisation particulière ; la vérification à l'exécution est réalisée sur chaque appel de l'appelant, en examinant sa pile des threads actuelle. Ce compteur utilisé avec "Stack Walk Depth" indique les altérations des performances pour les contrôles de sécurité. SECURITY_TIMEAUTHORIZE_00C_NAME=% temps authentification de la signature SECURITY_TIMEAUTHORIZE_00C_HELP=Réservé pour un usage futur. SECURITY_LINKCHECKS_00C_NAME=Nombre de vérifications durant l'édition de liens SECURITY_LINKCHECKS_00C_HELP=Ce compteur affiche le nombre total de vérifications Sécurité d'Accès du Code (CAS) durant l'édition de liens effectuées depuis le démarrage de l'application. Ces vérifications sont effectuées lorsqu'un utilisateur en appelle un autre pour demander une autorisation particulière au moment de la compilation JIT ; la vérification durant l'édition de liens est effectuée une fois par appelant. Ce compteur n'indique pas de graves problèmes de performances, mais l'activité du système de sécurité. SECURITY_TIMERTCHECKS_00C_NAME=% temps pour les vérifications RT SECURITY_TIMERTCHECKS_00C_HELP=Ce compteur affiche le pourcentage de temps passé à effectuer des vérifications Sécurité d'Accès du Code (CAS) à l'exécution depuis la dernière vérification de ce type. La Sécurité d'Accès du Code permet de définir divers niveaux de confiance pour le code et d'appliquer ces degrés de confiance en fonction de l'identité du code. Ce compteur est mis à jour à la fin d'une vérification de la sécurité à l'exécution. Il représente la dernière valeur observée et non une moyenne. SECURITY_TIMERTCHECKS_BASE_00C_NAME=Non affiché SECURITY_TIMERTCHECKS_BASE_00C_HELP=Non affiché. SECURITY_DEPTHSECURITY_00C_NAME=Épaisseur de la pile SECURITY_DEPTHSECURITY_00C_HELP=Ce compteur affiche l'épaisseur de la pile lors de la dernière vérification Sécurité d'Accès du Code (CAS) à l'exécution. La vérification Sécurité d'Accès du Code à l'exécution est effectuée en analysant la pile. Ce compteur ne représente pas une moyenne ; il affiche uniquement la dernière valeur observée. DotNetCLR_Remoting_OBJECT_00C_NAME=Accès distant CLR .NET DotNetCLR_Remoting_OBJECT_00C_HELP=Statistiques de la communication à distance CLR. CONTEXT_REMOTECALLS_INST_00C_NAME=Appels distants/s CONTEXT_REMOTECALLS_INST_00C_HELP=Ce compteur affiche le nombre d'appels de procédure distants par seconde. Un appel de procédure distante est un appel sur tout objet en dehors du AppDomain de l'appelant. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. CONTEXT_CHANNELS_00C_NAME=Canaux CONTEXT_CHANNELS_00C_HELP=Ce compteur affiche le nombre total de canaux de communication à distance inscrits auprès de tous les AppDomains depuis le démarrage de l'application. Les canaux servent à transporter des messages depuis et vers les objets distants. CONTEXT_PROXIES_00C_NAME=Proxies de contexte CONTEXT_PROXIES_00C_HELP=Ce compteur affiche le nombre total d'objets proxy de communication à distance créés dans ce processus depuis le démarrage du processus. L'objet proxy représente les objets distants et garantit que tous les appels effectués sur le proxy sont transmis à l'instance d'objet distant appropriée. CONTEXT_CLASSES_00C_NAME=Classes liées au contexte chargées CONTEXT_CLASSES_00C_HELP=Ce compteur affiche le nombre actuel de classes liées au contexte chargées. Les classes qui peuvent être liées à un contexte sont appelées classes liées au contexte ; elles sont marquées avec des attributs de contexte qui fournissent les règles d'usage pour la synchronisation, l'affinité du thread, les transactions, etc. CONTEXT_OBJALLOC_00C_NAME=Objets liés au contexte alloués/s CONTEXT_OBJALLOC_00C_HELP=Ce compteur affiche le nombre d'objets liés au contexte alloués par seconde. Les instances de classes qui peuvent être liées à un contexte sont appelées objets liés au contexte ; les classes liées au contexte sont marquées avec des attributs de contexte qui fournissent les règles d'usage pour la synchronisation, l'affinité du thread, les transactions, etc. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. CONTEXT_CONTEXTS_00C_NAME=Contextes CONTEXT_CONTEXTS_00C_HELP=Ce compteur affiche le nombre actuel de contextes de communication à distance de l'application. Un contexte est une limite qui contient une collection d'objets avec les mêmes règles d'usage, telles que la synchronisation, l'affinité du thread, les transactions, etc. CONTEXT_REMOTECALLS_TOTAL_00C_NAME=Total d'appels distants CONTEXT_REMOTECALLS_TOTAL_00C_HELP=Ce compteur affiche le nombre total d'appels de procédure distants depuis le démarrage de cette application. Un appel de procédure distante est un appel sur tout objet en dehors du AppDomain de l'appelant. DotNetCLR_Excep_OBJECT_00C_NAME=Exceptions CLR .NET DotNetCLR_Excep_OBJECT_00C_HELP=Statistiques à l'exécution sur la gestion des exceptions CLR. EXCEP_THROWN_TOTAL_00C_NAME=Nombre d'exceptions levées EXCEP_THROWN_TOTAL_00C_HELP=Ce compteur affiche le nombre total d'exceptions levées depuis le démarrage de l'application. Elles comprennent à la fois les exceptions .NET et les exceptions non managées qui sont converties en exceptions .NET (par exemple, une exception de référence de pointeur null dans du code non managé est à nouveau levée dans du code managé en tant qu'exception .NET System.NullReferenceException). Ce compteur comprend à la fois les exceptions gérées et non gérées. Les exceptions qui sont à nouveau levées sont à nouveau comptées. Les exceptions ne doivent se produire qu'en de rares occasions et non dans le flux de contrôle normal du programme. EXCEP_THROWN_INST_00C_NAME=Nombre d'exceptions levées/s EXCEP_THROWN_INST_00C_HELP=Ce compteur affiche le nombre d'exceptions levées par seconde. Elles comprennent à la fois les exceptions .NET et les exceptions non managées qui sont converties en exceptions .NET (par exemple, une exception de référence de pointeur null dans du code non managé est à nouveau levée dans du code managé en tant qu'exception .NET System.NullReferenceException). Ce compteur comprend à la fois les exceptions gérées et non gérées. Les exceptions ne doivent se produire qu'en de rares occasions et non dans le flux de contrôle normal du programme. Ce compteur a été conçu en tant qu'indicateur d'éventuels problèmes de performances causés par un taux élevé (>100s) d'exceptions levées. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. TOTAL_EXCEP_FILTERS_RUN_00C_NAME=Nombre de filtres/s TOTAL_EXCEP_FILTERS_RUN_00C_HELP=Ce compteur affiche le nombre de filtres d'exception .NET exécutés par seconde. Un filtre d'exception évalue si une exception doit être gérée ou non. Ce compteur effectue le suivi du taux des filtres d'exception évalués, que l'exception ait été gérée ou non. Il ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. TOTAL_EXCEP_FINALLYS_RUN_00C_NAME=Nombre de Finally/s TOTAL_EXCEP_FINALLYS_RUN_00C_HELP=Ce compteur affiche le nombre de blocs finally exécutés par seconde. Un bloc finally est toujours exécuté, quelle que soit la méthode de sortie du bloc try. Seuls les blocs finally qui sont exécutés pour une exception sont comptés ; ceux situés dans des chemins de code normaux ne le sont pas. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. EXCEPT_STACK_DEPTH_00C_NAME=Profondeur Throw à Catch/s EXCEPT_STACK_DEPTH_00C_HELP=Ce compteur affiche le nombre de frames de pile traversés entre le frame qui a levé l'exception .NET et celui qui a géré l'exception par seconde. Ce compteur est remis à 0 lorsqu'un gestionnaire d'exceptions est entré. Par conséquent, les exceptions imbriquées indiquent la profondeur de la pile, de gestionnaire à gestionnaire. Ce compteur ne représente pas une moyenne temporelle ; il affiche la différence entre les valeurs observées dans les deux derniers intervalles de temps, divisée par la durée de l'intervalle échantillon. DotNetCLR_Memory_OBJECT_00D_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_00D_HELP=ÞÕàÙÝ âÑÕè âèÙÞê ÔÐéäÔ éàÐáäÔ éÜ CLR. GEN0_COLLECTIONS_COUNTER_00D_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔäâÞÙÝ éÐÕÑÙÙçØÙÝ ÞÓÕè 0 (×ÓéÙÝ ÑÙÕêè; ÔÕçæÕ Ð×èÕàÙÝ) àÐáäÕ ÜÐéäÔ (Gen 0 GC) ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÐÙáÕã ÐéäÔ éÜ ÓÕè 0 (Gen 0 GC) ÞêÑæâ ÛÐéè ÔÖÙÛèÕß ÔÖÞÙß ÑÓÕè 0 ÐÙàÕ ÞáäÙç ÛÓÙ ÜâÞÕÓ ÑÑçéê ÔçæÐÔ. ÞÕàÔ ÖÔ ÒÓÜ ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÐéäÔ éÜ ÓÕè 0 (Gen 0 GC). ÐÙáÕäÙ ÐéäÔ éÜ ÓÕèÕê ÒÑÕÔÙÝ ÙÕêè ÛÕÜÜÙÝ Ðê ÛÜ ÐÙáÕäÙ ÔÐéäÔ éÜ ÔÓÕèÕê ÔàÞÕÛÙÝ ÙÕêè. ÞÕàÔ ÖÔ ÒÓÜ ÑÞäÕèé ÛÐéè ÞêÑæâ ÐÙáÕã ÐéäÔ éÜ ÓÕè ÒÑÕÔ ÙÕêè (Gen 1 ÐÕ Gen 2). ÔâèÚ éÜ  _Global_ counter ÐÙàÕ ÞÓÕÙç ÕÙé ÜÔêâÜÝ ÞÞàÕ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔÐ×èÕß éàæäÔ. GEN1_COLLECTIONS_COUNTER_00D_NAME=# Gen 1 Collections GEN1_COLLECTIONS_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔäâÞÙÝ éÐÕÑÙÙçØÙÝ ÞÓÕè 1 àÐáäÕ ÜÐéäÔ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÔÞÕàÔ ÒÓÜ ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÐéäÔ éÜ ÓÕè 1. ÐÙáÕäÙ ÐéäÔ éÜ ÓÕèÕê ÒÑÕÔÙÝ ÙÕêè ÛÕÜÜÙÝ Ðê ÛÜ ÐÙáÕäÙ ÔÐéäÔ éÜ ÔÓÕèÕê ÔàÞÕÛÙÝ ÙÕêè. ÞÕàÔ ÖÔ ÒÓÜ ÑÞäÕèé ÛÐéè ÞêÑæâ ÐÙáÕã ÐéäÔ éÜ ÓÕè ÒÑÕÔ ÙÕêè (Gen 2). ÔâèÚ éÜ _Global_ counter ÐÙàÕ ÞÓÕÙç ÕÙé ÜÔêâÜÝ ÞÞàÕ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß. GEN2_COLLECTIONS_COUNTER_00D_NAME=# Gen 2 Collections GEN2_COLLECTIONS_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔäâÞÙÝ éÐÕÑÙÙçØÙÝ ÞÓÕè 2 (ÙéàÙÝ ÙÕêè) àÐáäÕ ÜÐéäÔ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÔÞÕàÔ ÒÓÜ ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÐéäÔ éÜ ÓÕè 2 (Gen 2 GC) (àçèÐ ÒÝ ÐÙáÕã ÐéäÔ ÞÜÐ). ÔâèÚ éÜ _Global_ counter ÐÙàÕ ÞÓÕÙç ÕÙé ÜÔêâÜÝ ÞÞàÕ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß. GEN0_BYTES_PROMOTED_COUNTER_00D_NAME=Promoted Memory from Gen 0 GEN0_BYTES_PROMOTED_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÑêÙÝ éÜ ÔÖÙÛèÕß ééèÓÕ Ðê ÐÙáÕã ÔÐéäÔ (GC) ÕçÕÓÞÕ ÞÓÕè 0 ÜÓÕè 1; ÐÕÑÙÙçØÙÝ éçÕÓÞÕ èç ÞäàÙ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè ÐÙàÝ àÛÜÜÙÝ ÑÞÕàÔ ÖÔ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÑáÕäÕ éÜ ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß; ÖÔÕ ÜÐ ÞÕàÔ ÞæØÑè. GEN1_BYTES_PROMOTED_COUNTER_00D_NAME=Promoted Memory from Gen 1 GEN1_BYTES_PROMOTED_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÑêÙÝ éÜ ÔÖÙÛèÕß ééèÓÕ Ðê ÐÙáÕã ÔÐéäÔ (GC) ÕçÕÓÞÕ ÞÓÕè 1 ÜÓÕè 2; ÐÕÑÙÙçØÙÝ éçÕÓÞÕ èç ÑÒÜÜ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè ÐÙàÝ àÛÜÜÙÝ ÑÞÕàÔ ÖÔ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÑáÕäÕ éÜ ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß; ÖÔÕ ÜÐ ÞÕàÔ ÞæØÑè. ÞÕàÔ ÖÔ ÞÐÕäá Ü- 0 ÐÝ ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß ÔÙÔ Gen 0 GC ÑÜÑÓ. GEN0_PROMOTION_RATE_00D_NAME=Gen 0 Promoted Bytes/Sec GEN0_PROMOTION_RATE_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÑêÙÝ ÑéàÙÙÔ éçÕÓÞÕ ÞÓÕè 0 (Ô×Óé ÑÙÕêè) ÜÓÕè 1; ÐÕÑÙÙçØÙÝ éçÕÓÞÕ èç ÑÒÜÜ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè ÐÙàÝ àÛÜÜÙÝ ÑÞÕàÔ ÖÔ. ÖÙÛèÕß ÞçÕÓÝ ÛÐéè ÔÕÐ éÕèÓ ÐÙáÕã ÐéäÔ. ÞÕàÔ ÖÔ êÕÛàß ÛÞ×ÕÕß ÜÞáäè ÔÐÕÑÙÙçØÙÝ ÑâÜÙ Þ×ÖÕè ×ÙÙÝ ÐèÕÚ Ù×áÙê ÔÞÕäçÙÝ ÑéàÙÙÔ. ÔÞÕàÔ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. GEN1_PROMOTION_RATE_00D_NAME=Gen 1 Promoted Bytes/Sec GEN1_PROMOTION_RATE_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÑêÙÝ ÑéàÙÙÔ éçÕÓÞÕ ÞÓÕè 1 ÜÓÕè 2 (ÔÙéß ÑÙÕêè); ÐÕÑÙÙçØÙÝ éçÕÓÞÕ èç ÑÒÜÜ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè ÐÙàÝ àÛÜÜÙÝ ÑÞÕàÔ ÖÔ. ÖÙÛèÕß ÞçÕÓÝ ÛÐéè ÔÕÐ éÕèÓ ÐÙáÕã ÐéäÔ. ÓÑè ÐÙàÕ ÞçÕÓÝ ÞÓÕè 2 ÞÛÙÕÕß éÖÔÕ ÔÓÕè ÔÙéß ÑÙÕêè. ÞÕàÔ ÖÔ êÕÛàß ÛÞ×ÕÕß ÜÞáäè ÔÐÕÑÙÙçØÙÝ ÑâÜÙ Þ×ÖÕè ×ÙÙÝ ÐèÕÚ ÞÐÕÓ ÔÞÕäçÙÝ ÑéàÙÙÔ. ÔÞÕàÔ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00D_NAME=Promoted Finalization-Memory from Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÑêÙÝ éÜ ÔÖÙÛèÕß éçÕÓÞÕ ÞÓÕè 0 ÜÓÕè 1 èç ÞäàÙ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÑáÕäÕ éÜ ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß; ÖÔÕ ÜÐ ÞÕàÔ ÞæØÑè. PROCESS_ID_00D_NAME=Process ID PROCESS_ID_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÞÖÔÔ ÔêÔÜÙÚ éÜ ÞÕäâ êÔÜÙÚ CLR éàÞæÐ ê×ê äÙçÕ×. ÔâèÚ ÔÞÕæÒ ÙÔÙÔ 0 âÓ ÜáÙÕÝ ÐÙáÕã ÔÐéäÔ ÔèÐéÕß. GEN0_HEAP_SIZE_COUNTER_00D_NAME=Gen 0 heap size GEN0_HEAP_SIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÑêÙÝ ÔÞèÑÙ éàÙêß ÜÔçæÕê ÑÓÕè 0 (Gen 0); ÔÕÐ ÐÙàÕ ÞæÙÙß Ðê Þáäè ÔÑêÙÝ ÔàÕÛ×Ù éÔÕçæÔ ÑÓÕè 0. Gen 0 GC ÞÕäâÜ ÛÐéè ÔÔçæÐÕê ÞÐÖ ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß ×èÒÕ ÞÒÕÓÜ ÖÔ. ÒÕÓÜÕ éÜ ÓÕè 0 àéÜØ ÑÙÓÙ ÐÕáã ÔÐéäÔ ÕÔÕÐ âéÕÙ ÜÔéêàÕê ÑÞÔÜÚ ÔäâÜê ÔÙÙéÕÝ. ÑáÙÕÞÕ éÜ ÐÙáÕã ÓÕè 0, ÔÒÕÓÜ éÜ âèÙÞê ÓÕè 0 ÔÕÐ 0 ÑêÙÝ; ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÒÕÓÜ (ÑÑêÙÝ) éÜ ÔçæÐÕê éÙÒèÞÕ ÜÔäâÜêÕ éÜ Gen 0 GC ÔÑÐ. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÔÐéäÔ; ÔÕÐ ÐÙàÕ ÞêâÓÛß ÑÛÜ ÔçæÐÔ. GEN1_HEAP_SIZE_COUNTER_00D_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÑêÙÝ ÑÓÕè 1 (Gen 1); ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÒ Ðê ÒÕÓÜÕ ÔÞèÑÙ éÜ ÓÕè 1. ÐÕÑÙÙçØÙÝ ÐÙàÝ ÞÕçæÙÝ ÙéÙèÕê ÑÓÕè ÖÔ; ÔÝ ÞçÕÓÞÙÝ ÞÐÙáÕäÙ ÐéäÔ çÕÓÞÙÝ éÜ ÓÕè 0. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÔÐéäÔ; ÔÕÐ ÐÙàÕ ÞêâÓÛß ÑÛÜ ÔçæÐÔ. GEN2_HEAP_SIZE_COUNTER_00D_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÑêÙÝ ÑÓÕè 2 (Gen 2). ÐÕÑÙÙçØÙÝ ÐÙàÝ ÞÕçæÙÝ ÙéÙèÕê ÑÓÕè ÖÔ; ÔÝ ÞçÕÓÞÙÝ ÞÓÕè 1 ÑÞÔÜÚ ÐÙáÕäÙ ÐéäÔ çÕÓÞÙÝ éÜ ÓÕè 1. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÔÐéäÔ; ÔÕÐ ÐÙàÕ ÞêâÓÛß ÑÛÜ ÔçæÐÔ. LARGE_OBJECT_SIZE_COUNTER_00D_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÒÕÓÜÔ ÔàÕÛ×Ù éÜ 'âèÙÞê ÔÐÕÑÙÙçØÙÝ ÔÒÓÕÜÙÝ' ÑÑêÙÝ. ÐÕÑÙÙçØÙÝ éÒÕÓÜÝ âÕÜÔ âÜ âèÚ áã ÞØÕäÜÙÝ ÛÐÕÑÙÙçØÙÝ ÒÓÕÜÙÝ âÜ-ÙÓÙ ÞÐáã ÔÐéäÔ ÕÔÝ ÞÕçæÙÝ ÙéÙèÕê ÑâèÙÞÔ ÞÙÕ×Óê; ÔÝ ÐÙàÝ ÞçÕÓÞÙÝ ÞÓÕè Ð×Ó ÜéàÙ. Ñ- CLR v1.1 ÕÐÙÜÚ, áã ÖÔ éÕÕÔ Ü- 85000 ÑêÙÝ. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ êÔÜÙÚ ÐÙáÕã ÐéäÔ; ÔÕÐ ÐÙàÕ ÞêâÓÛß ÑÛÜ ÔçæÐÔ. SURVIVE_FINALIZE_COUNTER_00D_NAME=Finalization Survivors SURVIVE_FINALIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÐÕÑÙÙçØÙÝ éàÐáäÕ ÜÐéäÔ ééèÓÕ ÐÙáÕã ÞäàÙ éÔÝ ÞÞêÙàÙÝ ÜÒÙÞÕè. ÐÝ ÐÕÑÙÙçØÙÝ ÐÜÔ ÛÕÜÜÙÝ ÔäàÙÕê ÜÐÕÑÙÙçØÙÝ Ð×èÙÝ, ÒÝ ÐÕÑÙÙçØÙÝ ÐÜÔ ÙéèÓÕ, ÐÚ ÔÝ ÜÐ ÙÙÛÜÜÕ ÑáäÙèÔ éÜ ÞÕàÔ ÖÔ; ÔÞÕàÙÝ "ÖÙÛèÕß ÒÙÞÕè éçÕÓÝ ÞÓÕè 0" Õ"ÖÙÛèÕß ÒÙÞÕè éçÕÓÝ ÞÓÕè 1" ÞÙÙæÒÙÝ Ðê ÛÜ ÔÖÙÛèÕß ééèÓ âçÑ ÒÙÞÕè. ÞÕàÔ ÖÔ ÔÕÐ ÐÙàÕ ÞÕàÔ ÞæØÑè; ÔÕÐ ÞêâÓÛß ÑáÕäÕ éÜ ÛÜ ÐÙáÕã ÐéäÔ ÑÞáäè ÔÐÕÑÙÙçØÙÝ ééèÓÕ ÑÞÔÜÚ ÐÕêÕ ÐÙáÕã ÐéäÔ áäæÙäÙ ÑÜÑÓ. ÞÕàÔ ÖÔ êÕÛàß ÜæÙÙß Ðê ÔêçÕèÔ ÔàÕáäê éâéÕÙÔ ÜÔÙÓèé ÜÙÙéÕÝ ÜéÝ ÒÙÞÕè. NUM_HANDLES_COUNTER_00D_NAME=# GC Handles NUM_HANDLES_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÞØäÜÙÝ ÑÐÙáÕã ÐéäÔ (GCHandles) ÔàÞæÐÙÝ ÑéÙÞÕé. ÞØäÜÙÝ ÑÐÙáÕã ÐéäÔ ÔÝ ÞØäÜÙÝ ÑÞéÐÑÙÝ ×ÙæÕàÙÙÝ Ü- CLR ÕÜáÑÙÑÔ ÔÞàÕÔÜê. ÞØäÜÙÝ ÖçÕçÙÝ ÜÛÞÕÙÕê çØàÕê éÜ ÖÙÛèÕß ÑâèÙÞê ÐÙáÕã ÔÐéäÔ (GCHeap) ÐÚ ÜÞéÐÑÙÝ ÜÐ ÞàÕÔÜÙÝ éâéÕÙÙÝ ÜÔÙÕê ÙçèÙÝ. ALLOCATION_RATE_COUNTER_00D_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê çæÑ ÔÑêÙÝ ÑéàÙÙÔ éÔÕçæÕ ÑâèÙÞê ÐÙáÕã ÔÐéäÔ. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ ÛÜ ÐÙáÕã ÐéäÔ ÕÜÐ ÑÛÜ ÔçæÐÔ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. INDUCED_GC_COUNTER_00D_NAME=# Induced GC INDUCED_GC_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔéÙÐ éÜ ÔäâÞÙÝ éÑÔß ÑÕæâ ÐÙáÕã ÐéäÔ ÑÒÜÜ çèÙÐÔ ÞäÕèéê Ü- GC.Collect. ÛÓÐÙ ÜÐäéè ÜÐÕáã ÔÐéäÔ ÜÛÕÕàß Ðê êÓÙèÕê ÔÐÙáÕäÙÝ éÜÕ. PER_TIME_IN_GC_COUNTER_00D_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_00D_HELP=% ÖÞß ÑÐÙáÕã ÐéäÔ ÔÕÐ Ð×ÕÖ ÔÖÞß éâÑè éÔÕçÓé ÜÑÙæÕâ ÐÙáÕã ÐéäÔ ÞÐÖ Þ×ÖÕè ÐÙáÕã ÔÐéäÔ ÔÐ×èÕß. ÞÕàÔ ÖÔ ÞéÞé ÑÓèÚ ÛÜÜ ÛÞ×ÕÕß ÜâÑÕÓÔ éÑÕæâÔ âÜ-ÙÓÙ ÐÕáã ÔÐéäÔ âÑÕè ÔÙÙéÕÝ ÜéÝ ÐÙáÕã ÕæÞæÕÝ ÔÖÙÛèÕß. ÞÕàÔ ÖÔ ÞêâÓÛß èç ÑáÕäÕ éÜ ÛÜ ÐÙáÕã ÐéäÔ ÕâèÚ ÔÞÕàÔ Þéçã Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß; ÔâèÚ ÐÙàÕ ÞæÙÙß ÞÞÕæâ. PER_TIME_IN_GC_COUNTER_BASE_00D_NAME=Not Displayed PER_TIME_IN_GC_COUNTER_BASE_00D_HELP=ÜÐ ÞÕæÒ. TOTAL_HEAP_SIZE_COUNTER_00D_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÔÕÐ ÔáÛÕÝ éÜ ÐèÑâÔ ÞÕàÙÝ Ð×èÙÝ: ÒÕÓÜ âèÙÞÔ éÜ ÓÕè 0, ÒÕÓÜ âèÙÞÔ éÜ ÓÕè 1, ÒÕÓÜ âèÙÞÔ éÜ ÓÕè 2 ÕÒÕÓÜ âèÙÞê ÐÕÑÙÙçØÙÝ ÒÓÕÜÙÝ. ÞÕàÔ ÖÔ ÞæÙÙß Ðê ÛÞÕê ÔÖÙÛèÕß ÔÞÕçæÙê Ûâê ÑÑêÙÝ ÑâèÙÞÕê ÐÙáÕã ÔÐéäÔ. TOTAL_COMMITTED_MEM_COUNTER_00D_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÛÞÕê ÔÖÙÛèÕß ÔÕÕÙèØÕÐÜÙ (ÑÑêÙÝ) ÔêäÕáÔ Ûâê âÜ-ÙÓÙ ÐÕáã ÔÐéäÔ. (ÔÖÙÛèÕß ÔêäÕá ÔÕÐ ÔÖÙÛèÕß ÔäÙÖÙ éâÑÕèÕ àéÞè éØ× ÑçÕÑå ÔÔ×ÜäÔ ÑÓÙáç). TOTAL_RESERVED_MEM_COUNTER_00D_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÛÞÕê ÔÖÙÛèÕß ÔÕÕÙèØÕÐÜÙ (ÑÑêÙÝ) ÔéÞÕèÔ Ûâê âÜ-ÙÓÙ ÐÕáã ÔÐéäÔ. (ÖÙÛèÕß éÞÕè ÔÕÐ éØ× ÔÖÙÛèÕß ÔÕÕÙèØÕÐÜÙ ÔéÞÕè âÑÕè ÔÙÙéÕÝ, ÞÑÜÙ ÜâéÕê éÙÞÕé ÑÓÙáç ÐÕ ÑâÞÕÓÙ ÔÖÙÛèÕß ÔèÐéÙ). GC_PINNED_OBJECTS_00D_NAME=# of Pinned Objects GC_PINNED_OBJECTS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÐÕÑÙÙçØÙÝ ÔÞÕæÞÓÙÝ éàÞæÐÕ ÑÐÙáÕã ÔÐéäÔ ÔÐ×èÕß. ÔÞÕàÔ âÕçÑ Ð×è ÔÐÕÑÙÙçØÙÝ ÔÞÕæÞÓÙÝ èç ÑâèÙÞÕê éàÛÜÜÕ ÑÐÙáÕã ÔÐéäÔ, ÜÓÕÒÞÔ, Gen 0 GC ÙÒèÕè áäÙèÔ éÜ ÐÕÑÙÙçØÙÝ ÞÕæÞÓÙÝ ÑâèÙÞÔ éÜ ÓÕè 0 ÑÜÑÓ. ÐÕÑÙÙçØ ÞÕæÞÓ ÔÕÐ ÐÕÑÙÙçØ éÜÐÕáã ÔÐéäÔ ÐÙß ÐäéèÕê ÜÔÖÙÖÕ ÑÖÙÛèÕß. GC_SINKBLOCKS_00D_NAME=# of Sink Blocks in use GC_SINKBLOCKS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÑÜÕçÙ áÙàÛèÕß ÔàÞæÐÙÝ ÑéÙÞÕé. ÑÜÕçÙ áÙàÛèÕß ÔÝ ÞÑàÙ àêÕàÙÝ áäæÙäÙÙÝ ÜÐÕÑÙÙçØ éÔÕçæÕ ÜéÝ Ð×áÕß ÞÙÓâ áÙàÛèÕß. ÑÜÕçÙ áÙàÛèÕß ÞÛÙÜÙÝ ÔäàÙÕê ×ÜéÕê ÐÜ ÐÕÑÙÙçØÙÝ ÞàÕÔÜÙÝ ÕÙé ÜáèÕç ÐÕêÝ ÑÐÞæâÕê ÐÕáã ÔÐéäÔ. ÑÜÕçÙ ÔáÙàÛèÕß ÐÙàÝ ÞÕÒÑÜÙÝ ÜÐ×áÕß ÞÙÓâ áÙàÛèÕß - àÙêß ÜÐ×áß ÑÔÝ ÒÝ ÞØÔ-àêÕàÙÝ éÜ COM interop. ÞÕàÔ ÖÔ êÕÛàß ÜæÙÙß ÑâÙÕê ÑÑÙæÕâÙÝ ÔçéÕèÕê ÜéÙÞÕé ÛÑÓ ÑäèÙÞÙØÙÑÙÝ éÜ áÙàÛèÕß. DotNetCLR_Loading_OBJECT_00D_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ ÐÕÓÕê ÞØâÙß ÔÞ×ÜçÕê éÜ CLR. LOADING_CLASSES_TOTAL_00D_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÞæØÑè éÜ ÔÞ×ÜçÕê éàØâàÕ ÑÛÜ ÔÔèÛÑÕê ÞÐÖ ÔäâÜê ÙÙéÕÝ ÖÔ. LOADING_TIME_00D_NAME=% Time Loading LOADING_TIME_00D_HELP=éÞÕè ÜéÙÞÕé âêÙÓÙ. LOADING_ASMSEARCHLEN_00D_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_00D_HELP=éÞÕè ÜéÙÞÕé âêÙÓÙ. LOADING_LOADFAILURES_TOTAL_00D_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔéÙÐ éÜ ÔÞ×ÜçÕê éØâÙàêß àÛéÜÔ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÔÛéÜÙÝ ÑØâÙàÔ âéÕÙÙÝ ÔÙÕ ÜàÑÕâ ÞáÙÑÕê èÑÕê, ÛÒÕß ÐÑØ×Ô ÜÐ ÞêÐÙÞÔ ÐÕ êÑàÙê ÜÐ ×ÕçÙê. äèØÙÝ ÞÜÐÙÝ àÞæÐÙÝ ÑâÖèÔ éÜ éÙèÕêÙ ÙæÙèê äèÕäÙÜ. LOADING_LOADFAILURES_INST_00D_NAME=Rate of Load Failures LOADING_LOADFAILURES_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÞ×ÜçÕê éØâÙàêß àÛéÜÔ ÑéàÙÙÔ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. ÔÛéÜÙÝ ÑØâÙàÔ âéÕÙÙÝ ÔÙÕ ÜàÑÕâ ÞáÙÑÕê èÑÕê, ÛÒÕß ÐÑØ×Ô ÜÐ ÞêÐÙÞÔ ÐÕ êÑàÙê ÜÐ ×ÕçÙê. äèØÙÝ ÞÜÐÙÝ àÞæÐÙÝ ÑâÖèÔ éÜ éÙèÕêÙ ÙæÙèê äèÕäÙÜ. LOADING_HEAPSIZE_00D_NAME=Bytes in Loader Heap LOADING_HEAPSIZE_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÒÕÓÜ ÔàÕÛ×Ù (ÑÑêÙÝ) éÜ ÔÖÙÛèÕß ÔêäÕá âÜ-ÙÓÙ ÞØâÙß ÔÞ×ÜçÕê ÑÛÜ Ô- AppDomains. (ÔÖÙÛèÕß ÔêäÕá ÔÕÐ ÔÖÙÛèÕß ÔäÙÖÙ éâÑÕèÕ àéÞè éØ× ÑçÕÑå ÔÔ×ÜäÔ ÑÓÙáç). LOADING_APPDOMAINS_UNLOADED_TOTAL_00D_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ AppDomains éØâÙàêÝ ÑÕØÜÔ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÐÝ AppDomain àØâß ÕÜÐ×è ÞÛß ØâÙàêÕ ÞÑÕØÜê Þáäè èÑ éÜ äâÞÙÝ, ÔÞÕàÔ ÙáäÕè ÛÜ Ð×Ó ÞÔÑÙØÕÜÙÝ ÑàäèÓ. LOADING_APPDOMAINS_UNLOADED_INST_00D_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè éÜ AppDomains éØâÙàêÝ ÑÕØÜÔ ÑéàÙÙÔ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. LOADING_CLASSES_CUR_00D_NAME=Current Classes Loaded LOADING_CLASSES_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ Þ×ÜçÕê éàØâàÕ ÑÛÜ ÔÔèÛÑÕê. LOADING_CLASSES_INST_00D_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÞ×ÜçÕê éàØâàÕ ÑéàÙÙÔ ÑÛÜ ÔÔèÛÑÕê. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. LOADING_APPDOMAINS_CUR_00D_NAME=Current appdomains LOADING_APPDOMAINS_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ AppDomains éàØâàÕ ÑÙÙéÕÝ ÖÔ. AppDomains (ê×ÕÞÙ ÙÙéÕÞÙÝ) ÞáäçÙÝ Ù×ÙÓê âÙÑÕÓ ÞÐÕÑØ×ê ÕèÑ-éÙÞÕéÙê éÑÔ Ü- CLR Ùé ÐäéèÕê ÜÔéêÞé ÛÓÙ ÜÑÕÓÓ ÙÙéÕÞÙÝ ÔäÕâÜÙÝ ÑÐÕêÕ êÔÜÙÚ. LOADING_APPDOMAINS_TOTAL_00D_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔéÙÐ éÜ AppDomains éàØâàÕ ÞÐÖ ÔäâÜê ÙÙéÕÝ ÖÔ. AppDomains (ê×ÕÞÙ ÙÙéÕÞÙÝ) ÞáäçÙÝ Ù×ÙÓê âÙÑÕÓ ÞÐÕÑØ×ê ÕèÑ-éÙÞÕéÙê éÑÔ Ü- CLR Ùé ÐäéèÕê ÜÔéêÞé ÛÓÙ ÜÑÕÓÓ ÙÙéÕÞÙÝ ÔäÕâÜÙÝ ÑÐÕêÕ êÔÜÙÚ. LOADING_APPDOMAINS_INST_00D_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè éÜ AppDomains éàØâàÕ ÑéàÙÙÔ. AppDomains (ê×ÕÞÙ ÙÙéÕÞÙÝ) ÞáäçÙÝ Ù×ÙÓê âÙÑÕÓ ÞÐÕÑØ×ê ÕèÑ-éÙÞÕéÙê éÑÔ Ü- CLR Ùé ÐäéèÕê ÜÔéêÞé ÛÓÙ ÜÑÕÓÓ ÙÙéÕÞÙÝ ÔäÕâÜÙÝ ÑÐÕêÕ êÔÜÙÚ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. LOADING_ASSEMBLIES_CUR_00D_NAME=Current Assemblies LOADING_ASSEMBLIES_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÔèÛÑÕê éàØâàÕ ÑÛÜ Ô- AppDomains ÑÙÙéÕÝ ÖÔ. ÐÝ ÔÔèÛÑÔ àØâàÔ Û- Domain-neutral Þ- AppDomains ÞèÕÑÙÝ, ÞÕàÔ ÖÔ ÙÒÓÜ äâÝ Ð×ê ÑÜÑÓ. àÙêß ÜØâÕß ÔèÛÑÕê Û- Domain-neutral ÛÐéè àÙêß Üéêã Ðê ÔçÕÓ éÜÔß âÝ ÛÜ Ô- AppDomains, ÐÕ ÜØâÕß ÐÕêß Û- Domain-specific ÛÐéè ÔçÕÓ éÜÔß äèØÙ ÜÐÕêÕ AppDomain. LOADING_ASSEMBLIES_TOTAL_00D_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÔèÛÑÕê éàØâàÕ ÞÐÖ ÔäâÜêÕ éÜ ÙÙéÕÝ ÖÔ. ÐÝ ÔÔèÛÑÔ àØâàÔ Û- Domain-neutral Þ- AppDomains ÞèÕÑÙÝ, ÞÕàÔ ÖÔ ÙÒÓÜ äâÝ Ð×ê ÑÜÑÓ. àÙêß ÜØâÕß ÔèÛÑÕê Û- Domain-neutral ÛÐéè àÙêß Üéêã Ðê ÔçÕÓ éÜÔß âÝ ÛÜ Ô- AppDomains, ÐÕ ÜØâÕß ÐÕêß Û- Domain-specific ÛÐéè ÔçÕÓ éÜÔß äèØÙ ÜÐÕêÕ AppDomain. LOADING_ASSEMBLIES_INST_00D_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÔèÛÑÕê éàØâàÕ ÑÛÜ Ô- AppDomains ÑéàÙÙÔ. ÐÝ ÔÔèÛÑÔ àØâàÔ Û- Domain-neutral Þ- AppDomains ÞèÕÑÙÝ, ÞÕàÔ ÖÔ ÙÒÓÜ äâÝ Ð×ê ÑÜÑÓ. àÙêß ÜØâÕß ÔèÛÑÕê Û- Domain-neutral ÛÐéè àÙêß Üéêã Ðê ÔçÕÓ éÜÔß âÝ ÛÜ Ô- AppDomains, ÐÕ ÜØâÕß ÐÕêß Û- Domain-specific ÛÐéè ÔçÕÓ éÜÔß äèØÙ ÜÐÕêÕ AppDomain. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. DotNetCLR_Jit_OBJECT_00D_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ âÑÕè ÞÔÓè Jit éÜ CLR. TOTAL_METHODS_JITTED_00D_NAME=# of Methods Jitted TOTAL_METHODS_JITTED_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ äâÕÜÕê ÔéÙèÕê éâÑèÕ ÔÙÓÕè ÑéÙØê Just-In-Time  (JIT) ÑÐÞæâÕê ÞÔÓè JIT éÜ CLR ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÛÕÜÜ Ðê äâÕÜÕê ÔéÙèÕê ÞáÕÒ Pre-jit. JITTED_IL_CUR_00D_NAME=# of IL Bytes Jitted JITTED_IL_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÑêÙÝ ÑçÕÓ ÑÙàÙÙÝ (IL) Ñ- Jit ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÞÕàÔ ÖÔ ÖÔÔ ÑÓÙÕç ÜÞÕàÔ "Þá' ÛÕÜÜ éÜ ÑêÙÝ ÑçÕÓ ÑÙàÙÙÝ Ñ- Jit". JITTED_IL_TOTAL_00D_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÑêÙÝ ÑçÕÓ ÑÙàÙÙÝ (IL) Ñ- Jit ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÞÕàÔ ÖÔ ÖÔÔ ÑÓÙÕç ÜÞÕàÔ "Þá' ÔÑêÙÝ ÑçÕÓ ÑÙàÙÙÝ Ñ- Jit". JITTED_IL_INST_00D_NAME=IL Bytes Jitted / sec JITTED_IL_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔçæÑ éÑÕ ÑêÙÝ éÜ çÕÓ ÑÙàÙÙÝ (IL) âÕÑèÙÝ êÔÜÙÚ JIT ÑéàÙÙÔ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. JIT_FAILURES_00D_NAME=Standard Jit Failures JIT_FAILURES_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔéÙÐ éÜ äâÕÜÕê éÙèÕê éÜÞÔÓè JIT ÜÐ ÔÙêÔ ÐäéèÕê ÜÑæâ ÑÔß JIT ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÛéÜ ÖÔ âéÕÙ ÜÔêè×é ÐÝ ÜÐ àÙêß ÜÐÞê Ðê çÕÓ ÔÑÙàÙÙÝ ÐÕ ÐÝ ÐÙèâÔ éÒÙÐÔ äàÙÞÙê ÑÞÔÓè JIT. TIME_IN_JIT_00D_NAME=% Time in Jit TIME_IN_JIT_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Ð×ÕÖ ÔÖÞß éâÑè éÔÕçÓé ÜÔÙÓÕè JIT ÞÐÖ ÔéÜÑ ÔÐ×èÕß éÜ ÔÙÓÕè JIT. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÕ éÜ ÛÜ éÜÑ ÔÙÓÕè JIT. éÜÑ ÔÙÓÕè JIT ÔÕÐ ÔéÜÑ éÑÕ äâÕÜê éÙèÕê Ù×Ó âÝ ÔäèÙØÙÝ ÔêÜÕÙÙÝ ÑÔ âÕÑèÙÝ ÔÙÓÕè. TIME_IN_JIT_BASE_00D_NAME=Not Displayed TIME_IN_JIT_BASE_00D_HELP=ÜÐ ÞÕæÒ. DotNetCLR_Interop_OBJECT_00D_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ âÑÕè CLR interop. CURRENT_CCW_00D_NAME=# of CCWs CURRENT_CCW_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ Com-Callable-Wrappers  (CCW). CCW ÔÕÐ Proxy âÑÕè ÔÐÕÑÙÙçØ ÔÞàÕÔÜ éÜ  .NET éÐÜÙÕ ÑÕæâÔ ÔäàÙÔ ÞÜçÕ×Õê COM éÐÙàÝ ÞàÕÔÜÙÝ. ÞÕàÔ ÖÔ êÕÛàß ÜæÙÙß Ðê Þáäè ÔÐÕÑÙÙçØÙÝ ÔÞàÕÔÜÙÝ éÐÜÙÔÝ ÑÕæâÔ ÔäàÙÔ ÞêÕÚ çÕÓ COM éÐÙàÕ ÞàÕÔÜ. CURRENT_STUBS_00D_NAME=# of Stubs CURRENT_STUBS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ èÛÙÑÙ Stub éàÕæèÕ âÜ-ÙÓÙ Ô- CLR. èÛÙÑÙ Stub Ð×èÐÙÙÝ âÜ áÙÓÕè ÐèÒÕÞàØÙÝ ÕâèÛÙ Ô×ÖèÔ ÞçÕÓ ÞàÕÔÜ ÜçÕÓ ÜÐ ÞàÕÔÜ ÕÜÔäÚ, ÑÞÔÜÚ çèÙÐê COM Interop ÐÕ çèÙÐê PInvoke. NUM_MARSHALLING_00D_NAME=# of marshalling NUM_MARSHALLING_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔäâÞÙÝ éÑÔß áÕÓèÕ ÐèÒÕÞàØÙÝ ÕâèÛÙ Ô×ÖèÔ ÞçÕÓ ÞàÕÔÜ ÜÜÐ ÞàÕÔÜ ÕÜÔäÚ, ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÒÓÜ ÐÝ èÛÙÑÙ Ô- Stub ÔÝ ÞÕØÑâÙÝ. (èÛÙÑÙ Stub Ð×èÐÙÙÝ âÜ áÙÓÕè ÐèÒÕÞàØÙÝ ÕâèÛÙ ×ÖèÔ). èÛÙÑÙ Stub ÞÕØÑâÙÝ ÑÓèÚ ÛÜÜ ÐÝ êçÕèê ÔáÙÓÕè ÔÙÐ çØàÔ. TOTAL_TLB_IMPORTS_00D_NAME=# of TLB imports / sec TOTAL_TLB_IMPORTS_00D_HELP=éÞÕè ÜéÙÞÕé âêÙÓÙ. TOTAL_TLB_EXPORTS_00D_NAME=# of TLB exports / sec TOTAL_TLB_EXPORTS_00D_HELP=éÞÕè ÜéÙÞÕé âêÙÓÙ. DotNetCLR_LocksAndThreads_OBJECT_00D_NAME=.NET CLR LocksAndThreads DotNetCLR_LocksAndThreads_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ âÑÕè àâÙÜÕê ÕÔÜÙÛÙ ÞéàÔ éÜ CLR. CONTENTION_TOTAL_00D_NAME=Total # of Contentions CONTENTION_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔäâÞÙÝ ÑÔß ÔÜÙÛÙ ÞéàÔ Ñ- CLR àÙáÕ ÜÜÐ ÔæÜ×Ô ÜçÑÜ àâÙÜÔ ÞàÕÔÜê. àÙêß ÜçÑÜ àâÙÜÕê ÞàÕÔÜÕê ÑÛÞÔ ÓèÛÙÝ: ÑÐÞæâÕê ÔÔæÔèÔ " lock" Ñ- C# , âÜ-ÙÓÙ çèÙÐÔ Ü- System.Monitor.Enter ÐÕ ÑÐÞæâÕê éÙÞÕé ÑêÛÕàÔ ÔÞÕêÐÞê ÐÙéÙê MethodImplOptions.Synchronized. CONTENTION_INST_00D_NAME=Contention Rate / sec CONTENTION_INST_00D_HELP=ÔçæÑ éÑÕ ÔÜÙÛÙ ÞéàÔ ÑÖÞß ÔèÙæÔ àÙáÕ ÜçÑÜ àâÙÜÔ ÞàÕÔÜê ÜÜÐ ÔæÜ×Ô. àÙêß ÜçÑÜ àâÙÜÕê ÞàÕÔÜÕê ÑÛÞÔ ÓèÛÙÝ: ÑÐÞæâÕê ÔÔæÔèÔ " lock" Ñ- C# , âÜ-ÙÓÙ çèÙÐÔ Ü- System.Monitor.Enter ÐÕ ÑÐÞæâÕê éÙÞÕé ÑêÛÕàÔ ÔÞÕêÐÞê ÐÙéÙê MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_00D_NAME=Current Queue Length QUEUE_LENGTH_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔÜÙÛÙ ÔÞéàÔ ÔÞÞêÙàÙÝ Ûâê ÜçÑÜê àâÙÜÔ ÞàÕÔÜê ÑÙÙéÕÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß. QUEUE_LENGTH_TOTAL_00D_NAME=Queue Length Peak QUEUE_LENGTH_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔÜÙÛÙ ÞéàÔ éÔÞêÙàÕ ÜçÑÜê àâÙÜÔ ÞàÕÔÜê ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. QUEUE_LENGTH_INST_00D_NAME=Queue Length / sec QUEUE_LENGTH_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÜÙÛÙ ÔÞéàÔ ÑéàÙÙÔ ÔÞÞêÙàÙÝ ÜçÑÜê àâÙÜÔ ÛÜéÔÙ ÑÙÙéÕÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. CURRENT_LOGICAL_THREADS_00D_NAME=# of current logical Threads CURRENT_LOGICAL_THREADS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÐÕÑÙÙçØÙ ÔÜÙÛÙ ÔÞéàÔ éÜ  .NET ÑÙÙéÕÝ. ÐÕÑÙÙçØ ÔÜÙÚ ÞéàÔ éÜ  .NET àÕæè ÑÐÞæâÕê System.Threading.Thread ×Óé ÐÕ ÛÐéè ÔÜÙÚ ÞéàÔ ÜÐ ÞàÕÔÜ àÛàá ÜáÑÙÑÔ ÔÞàÕÔÜê. ÞÕàÔ ÖÔ áÕäè ÔÜÙÛÙ ÞéàÔ äÕâÜÙÝ ÕÞÕäáçÙÝ ÛÐ×Ó. ÔÞÕàÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß. CURRENT_PHYSICAL_THREADS_00D_NAME=# of current physical Threads CURRENT_PHYSICAL_THREADS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÜÙÛÙ ÔÞéàÔ éÜ ÞâèÛê ÔÔäâÜÔ éàÕæèÕ âÜ-ÙÓÙ Ô- CLR ÕàÞæÐÙÝ ÑÑâÜÕêÕ ÛÓÙ éÙéÞéÕ ÛÔÜÙÛÙ ÞéàÔ ÔÞéÞéÙÝ ÛÑáÙá âÑÕè ÐÕÑÙÙçØÙ ÔÜÙÛÙ ÞéàÔ éÜ  .NET. âèÚ ÔÞÕàÔ ÐÙàÕ ÛÕÜÜ Ðê ÔÜÙÛÙ ÔÞéàÔ ÑÔÝ ÞéêÞé Ô- CLR ÑäâÕÜÕê ÔäàÙÞÙÕê éÜÕ; ÖÕÔÙ çÑÕæê ÞéàÔ éÜ ÔÜÙÛÙ ÔÞéàÔ ÑêÔÜÙÚ ÞâèÛê ÔÔäâÜÔ. RECOGNIZED_THREADS_CUR_00D_NAME=# of current recognized threads RECOGNIZED_THREADS_CUR_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÜÙÛÙ ÔÞéàÔ ÔÞÖÕÔÙÝ Ûâê âÜ-ÙÓÙ Ô- CLR; Ùé ÜÔÝ ÐÕÑÙÙçØ ÔÜÙÚ ÞéàÔ êÕÐÝ éÜ  .NET ÔÞéÕÙÚ ÜÔÝ. ÔÜÙÛÙ ÞéàÔ ÐÜÔ ÐÙàÝ àÕæèÙÝ âÜ-ÙÓÙ Ô- CLR; ÔÝ àÕæèÙÝ Þ×Õå Ü- CLR ÐÚ ÞÐÖ äâÜÕ ÑêÕÚ Ô- CLR Üä×Õê äâÝ Ð×ê. ÔÞâçÑ ÞêÑæâ èç Ð×è ÔÜÙÛÙ ÞéàÔ ÙÙ×ÕÓÙÙÝ; ÔÜÙÛÙ ÞéàÔ âÝ ÞÖÔÔ ÔÜÙÛÙ ÞéàÔ ÖÔÔ ÔàÛàáÙÝ éÕÑ Ü- CLR ÐÕ àÕæèÙÝ Þ×Óé ÜÐ×è ÙæÙÐê ÔÜÙÚ ÔÞéàÔ ÐÙàÝ àáäèÙÝ äâÞÙÙÝ. RECOGNIZED_THREADS_TOTAL_00D_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔÜÙÛÙ ÔÞéàÔ éÖÕÔÕ âÜ-ÙÓÙ CLR ÞÐÖ ÔäâÜê ÔÙÙéÕÝ; ÜÔÜÙÛÙ ÞéàÔ ÐÜÔ Ùé ÐÕÑÙÙçØ ÔÜÙÚ ÞéàÔ êÕÐÝ éÜ  .NET ÔÞéÕÙÚ ÜÔÝ. ÔÜÙÛÙ ÞéàÔ ÐÜÔ ÐÙàÝ àÕæèÙÝ âÜ-ÙÓÙ Ô- CLR; ÔÝ àÕæèÙÝ Þ×Õå Ü- CLR ÐÚ ÞÐÖ äâÜÕ ÑêÕÚ Ô- CLR Üä×Õê äâÝ Ð×ê. ÔÞâçÑ ÞêÑæâ èç Ð×è ÔÜÙÛÙ ÞéàÔ ÙÙ×ÕÓÙÙÝ; ÔÜÙÛÙ ÞéàÔ âÝ ÞÖÔÔ ÔÜÙÛÙ ÞéàÔ ÖÔÔ ÔàÛàáÙÝ éÕÑ Ü- CLR ÐÕ àÕæèÙÝ Þ×Óé ÜÐ×è ÙæÙÐê ÔÜÙÚ ÔÞéàÔ ÐÙàÝ àáäèÙÝ äâÞÙÙÝ. RECOGNIZED_THREADS_INST_00D_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÜÙÛÙ ÔÞéàÔ ÑéàÙÙÔ éÖÕÔÕ âÜ-ÙÓÙ Ô- CLR; Ùé ÜÔÝ ÐÕÑÙÙçØ ÔÜÙÚ ÞéàÔ êÕÐÝ éÜ .NET ÔÞéÕÙÚ ÜÔÝ. ÔÜÙÛÙ ÞéàÔ ÐÜÔ ÐÙàÝ àÕæèÙÝ âÜ-ÙÓÙ Ô- CLR; ÔÝ àÕæèÙÝ Þ×Õå Ü- CLR ÐÚ ÞÐÖ äâÜÕ ÑêÕÚ Ô- CLR Üä×Õê äâÝ Ð×ê. ÔÞâçÑ ÞêÑæâ èç Ð×è ÔÜÙÛÙ ÞéàÔ ÙÙ×ÕÓÙÙÝ; ÔÜÙÛÙ ÞéàÔ âÝ ÞÖÔÔ ÔÜÙÛÙ ÞéàÔ ÖÔÔ ÔàÛàáÙÝ éÕÑ Ü- CLR ÐÕ àÕæèÙÝ Þ×Óé ÜÐ×è ÙæÙÐê ÔÜÙÚ ÔÞéàÔ ÐÙàÝ àáäèÙÝ äâÞÙÙÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. DotNetCLR_Security_OBJECT_00D_NAME=.NET CLR Security DotNetCLR_Security_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ âÑÕè ÐÑØ×ê CLR. SECURITY_TOTALRTCHECKS_00D_NAME=Total Runtime Checks SECURITY_TOTALRTCHECKS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÑÓÙçÕê ÐÑØ×ê ÒÙéê çÕÓ (CAS) ÑÖÞß èÙæÔ éÑÕæâÕ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÑÓÙçÕê CAS ÑÖÞß èÙæÔ ÞÑÕæâÕê ÛÐéè ÐÕÑÙÙçØ çÕèÐ ÜÐÕÑÙÙçØ Ð×è ÑÑçéÔ ÜçÑÜ ÔèéÐÔ ÞáÕÙÞê; ÛÜ çèÙÐÔ ÛÖÕ àÑÓçê ÑÖÞß ÔèÙæÔ; ÔÑÓÙçÔ ÞêÑæâê âÜ-ÙÓÙ Ñ×Ùàê Þ×áàÙê ÔÜÙÛÙ ÔÞéàÔ ÔàÕÛ×Ùê éÜ ÔÐÕÑÙÙçØ ÔçÕèÐ. ÞÕàÔ ÖÔ ÑéÙÜÕÑ âÝ " Stack Walk Depth" Þéçã Ðê ÔÔÐØÔ ÑÑÙæÕâÙÝ ÔàÒèÞê âçÑ ÑÓÙçÕê ÐÑØ×Ô. SECURITY_TIMEAUTHORIZE_00D_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_00D_HELP=éÞÕè ÜéÙÞÕé âêÙÓÙ. SECURITY_LINKCHECKS_00D_NAME=# Link Time Checks SECURITY_LINKCHECKS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÑÓÙçÕê ÐÑØ×ê ÒÙéê çÕÓ (CAS) ÑÖÞß ÔçÙéÕè ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÑÓÙçÕê CAS ÑÖÞß ÔçÙéÕè ÞÑÕæâÕê ÛÐéè ÐÕÑÙÙçØ çÕèÐ ÜÐÕÑÙÙçØ Ð×è ÑÑçéÔ ÜçÑÜê ÔèéÐÔ ÞáÕÙÞê ÑÖÞß ÔÙÓÕè JIT; ÑÓÙçÔ ÑÖÞß ÔçÙéÕè àâèÛê äâÝ Ð×ê âÑÕè ÛÜ ÐÕÑÙÙçØ çÕèÐ. áäÙèÔ ÖÕ ÐÙàÔ Þéçäê ÑâÙÕê ÑÙæÕâÙÝ èæÙàÙÕê, ÐÜÐ Ðê äâÙÜÕê ÞâèÛê ÔÐÑØ×Ô. SECURITY_TIMERTCHECKS_00D_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Ð×ÕÖ ÔÖÞß é×Üã éÔÕçÓé ÜÑÙæÕâ ÑÓÙçÕê ÐÑØ×ê ÒÙéê çÕÓ (CAS) ÞÐÖ ÔÑÓÙçÔ ÔÐ×èÕàÔ. ÐÑØ×ê CAS ÞÐäéèê Üêê ÐÞÕß ÑçÕÓ ÑèÞÕê ÞéêàÕê ÕÐÕÛäê Ðê èÞÕê ÔÐÞÕß ÔÞéêàÕê ÔÐÜÔ ÑÔêÐÝ ÜÖÔÕê ÔçÕÓ. ÞÕàÔ ÖÔ ÞêâÓÛß ÑáÕäÔ éÜ ÑÓÙçê ÐÑØ×Ô ÑÖÞß ÔèÙæÔ; ÔÕÐ ÞÙÙæÒ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß ÕÜÐ ÞÞÕæâ. SECURITY_TIMERTCHECKS_BASE_00D_NAME=Not Displayed SECURITY_TIMERTCHECKS_BASE_00D_HELP=ÜÐ ÞÕæÒ. SECURITY_DEPTHSECURITY_00D_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê âÕÞçÔ éÜ ÔÞ×áàÙê ÑÖÞß ÑÓÙçê ÐÑØ×ê ÒÙéê ÔçÕÓ ÔÐ×èÕàÔ ÑÖÞß ÔèÙæÔ. ÑÓÙçê ÐÑØ×ê ÒÙéê çÕÓ ÑÖÞß èÙæÔ ÞêÑæâê âÜ-ÙÓÙ áèÙçê ÔÞ×áàÙê. ÔÞÕàÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ, ÐÜÐ ÞæÙÒ Ðê ÔâèÚ ÔàæäÔ ÔÐ×èÕß. DotNetCLR_Remoting_OBJECT_00D_NAME=.NET CLR Remoting DotNetCLR_Remoting_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ âÑÕè CLR Remoting. CONTEXT_REMOTECALLS_INST_00D_NAME=Remote Calls/sec CONTEXT_REMOTECALLS_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔçèÙÐÕê ÜäèÕæÓÕèÕê ÞèÕ×çÕê ÑéàÙÙÔ. ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ çèÙÐÕê ÜäèÕæÓÕèÕê ÞèÕ×çÕê éÑÕæâÕ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. CONTEXT_CHANNELS_00D_NAME=Channels CONTEXT_CHANNELS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ âèÕæÙÝ ÞáÕÒ Remoting éàèéÞÕ ÑÛÜ Ô- AppDomains ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. âèÕæÙÝ ÞéÞéÙÝ ÜÔâÑèê ÔÕÓâÕê ÐÜ ÐÕÑÙÙçØÙÝ ÞèÕ×çÙÝ ÕÞÔÝ. CONTEXT_PROXIES_00D_NAME=Context Proxies CONTEXT_PROXIES_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÐÕÑÙÙçØÙ Proxy ÞáÕÒ Remoting éàÕæèÕ ÑêÔÜÙÚ ÖÔ ÞÐÖ ÔäâÜê ÔêÔÜÙÚ. ÐÕÑÙÙçØ Proxy äÕâÜ ÛàæÙÒ éÜ ÔÐÕÑÙÙçØÙÝ ÔÞèÕ×çÙÝ ÕÞÕÕÓÐ éÛÜ ÔçèÙÐÕê Ñ- Proxy ÙâÑèÕ ÔÜÐÔ ÐÜ ÞÕäâ ÔÐÕÑÙÙçØ ÔÞèÕ×ç ÔÞêÐÙÝ. CONTEXT_CLASSES_00D_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ Þ×ÜçÕê ÞÐÕÒÓÕê-Ôçéè éàØâàÕ. Þ×ÜçÕê éàÙêß ÜÐÒÓ ÐÕêß ÑÔçéè àçèÐÕê Þ×ÜçÕê ÞÐÕÒÓÕê-Ôçéè; Þ×ÜçÕê ÞÐÕÒÓÕê-Ôçéè ÞáÕÞàÕê ÑÐÞæâÕê êÛÕàÕê Ôçéè ÔÞáäçÕê ÛÜÜÙ éÙÞÕé ÜáÙàÛèÕß, ÖÙçÔ ÑÙß ÔÜÙÛÙ ÞéàÔ, ØèàÖçæÙÕê ÕÛÕ'. CONTEXT_OBJALLOC_00D_NAME=Context-Bound Objects Alloc / sec CONTEXT_OBJALLOC_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè éÜ ÐÕÑÙÙçØÙÝ ÞÐÕÒÓÙ-Ôçéè éÔÕçæÕ ÑéàÙÙÔ. ÞÕäâÙÝ éÜ Þ×ÜçÕê éàÙêß ÜÐÒÓ ÐÕêÝ ÑÔçéè àçèÐÙÝ ÐÕÑÙÙçØÙÝ ÞÐÕÒÓÙ-Ôçéè; Þ×ÜçÕê ÞÐÕÒÓÕê-Ôçéè ÞáÕÞàÕê ÑÐÞæâÕê êÛÕàÕê Ôçéè ÔÞáäçÕê ÛÜÜÙ éÙÞÕé ÜáÙàÛèÕß, ÖÙçÔ ÑÙß ÔÜÙÛÙ ÞéàÔ, ØèàÖçæÙÕê ÕÛÕ'. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. CONTEXT_CONTEXTS_00D_NAME=Contexts CONTEXT_CONTEXTS_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔàÕÛ×Ù éÜ ÔçéèÙÝ ÞáÕÒ Remoting ÑÙÙéÕÝ. Ôçéè ÔÕÐ ê×ÕÝ ÔÞÛÙÜ ÐÕáã éÜ ÐÕÑÙÙçØÙÝ ÑâÜÙ ÛÜÜÙ éÙÞÕé ÖÔÙÝ ÛÒÕß áÙàÛèÕß, ÖÙçÔ ÑÙß ÔÜÙÛÙ ÞéàÔ, ØèàÖçæÙÕê ÕÛÕ'. CONTEXT_REMOTECALLS_TOTAL_00D_NAME=Total Remote Calls CONTEXT_REMOTECALLS_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ çèÙÐÕê ÜäèÕæÓÕèÕê ÞèÕ×çÕê éÑÕæâÕ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. çèÙÐÔ ÜäèÕæÓÕèÔ ÞèÕ×çê ÔÙÐ çèÙÐÔ ÜÛÜ ÐÕÑÙÙçØ ÔÞÞÕçÝ Þ×Õå Ü-AppDomain éÜ ÔÐÕÑÙÙçØ ÔçÕèÐ. DotNetCLR_Excep_OBJECT_00D_NAME=.NET CLR Exceptions DotNetCLR_Excep_OBJECT_00D_HELP=àêÕàÙÝ áØØÙáØÙÙÝ ÑÖÞß èÙæÔ ÐÕÓÕê ØÙäÕÜ Ñ×èÙÒÙÝ Ñ- CLR. EXCEP_THROWN_TOTAL_00D_NAME=# of Exceps Thrown EXCEP_THROWN_TOTAL_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè ÔÛÕÜÜ éÜ ÔêèâÕê âÜ ×èÙÒÙÝ éÑÕæâÕ ÞÐÖ ÔäâÜê ÔÙÙéÕÝ. ×èÙÒÙÝ ÐÜÔ ÛÕÜÜÙÝ Ôß ×èÙÒÙÝ éÜ  .NET ÕÔß ×èÙÒÙÝ ÜÐ ÞàÕÔÜÙÝ éâÑèÕ ÔÞèÔ Ü×èÙÒÙÝ éÜ  .NET. ÜÓÕÒÞÔ, ×èÙÒ éàÑâ ÞÔäàÙÔ ÞáÕÒ Null éÜ ÞæÑÙâ ÑçÕÓ ÜÐ ÞàÕÔÜ ÙÙÖèç Ñ×ÖèÔ ÐÜ çÕÓ ÞàÕÔÜ Û-  .NET System.NullReferenceException; ÞÕàÔ ÖÔ ÛÕÜÜ Ôß ×èÙÒÙÝ ÞØÕäÜÙÝ ÕÔß ×èÙÒÙÝ éÐÙàÝ ÞØÕäÜÙÝ. ×èÙÒÙÝ éàÖèçÕ ×ÖèÔ àáäèÙÝ éàÙê. ×èÙÒÙÝ ÐÞÕèÙÝ ÜÔêè×é ÑÞæÑÙÝ àÓÙèÙÝ ÑÜÑÓ, ÕÜÐ ÑÖèÙÞê ÔÑçèÔ ÔèÒÙÜÔ éÜ ÔêÕÛàÙê. EXCEP_THROWN_INST_00D_NAME=# of Exceps Thrown / sec EXCEP_THROWN_INST_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÔÔêèâÕê âÜ ×èÙÒÙÝ éÑÕæâÕ ÑéàÙÙÔ. ×èÙÒÙÝ ÐÜÔ ÛÕÜÜÙÝ Ôß ×èÙÒÙÝ éÜ  .NET ÕÔß ×èÙÒÙÝ ÜÐ ÞàÕÔÜÙÝ éâÑèÕ ÔÞèÔ Ü×èÙÒÙÝ éÜ  .NET. ÜÓÕÒÞÔ, ×èÙÒ éàÑâ ÞÔäàÙÔ ÞáÕÒ Null éÜ ÞæÑÙâ ÑçÕÓ ÜÐ ÞàÕÔÜ ÙÙÖèç Ñ×ÖèÔ ÐÜ çÕÓ ÞàÕÔÜ Û-  .NET System.NullReferenceException; ÞÕàÔ ÖÔ ÛÕÜÜ Ôß ×èÙÒÙÝ ÞØÕäÜÙÝ ÕÔß ×èÙÒÙÝ éÐÙàÝ ÞØÕäÜÙÝ. ×èÙÒÙÝ ÐÞÕèÙÝ ÜÔêè×é èç ÑÞçèÙÝ àÓÙèÙÝ ÕÜÐ ÑÖèÙÞê ÔÑçèÔ ÔèÒÙÜÔ éÜ ÔêÕÛàÙê; ÞÕàÔ ÖÔ àÕâÓ ÜÔæÑÙâ âÜ ÑâÙÕê ÑÙæÕâÙÝ ÐäéèÙÕê éÙÙÒèÞÕ âçÑ çæÑ ÒÑÕÔ (> 100) éÜ ÔêèâÕê âÜ ×èÙÒÙÝ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. TOTAL_EXCEP_FILTERS_RUN_00D_NAME=# of Filters / sec TOTAL_EXCEP_FILTERS_RUN_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè éÜ ÞáààÙ ×èÙÒÙÝ éÜ  .NET éÔÕäâÜÕ ÑéàÙÙÔ. Þáàß ×èÙÒÙÝ ÞâèÙÚ ÐÝ Ùé ÜØäÜ Ñ×èÙÒ ÐÕ ÜÐ. ÞÕàÔ ÖÔ âÕçÑ Ð×è çæÑ ÞáààÙ Ô×èÙÒÙÝ éÔÕâèÛÕ, ÞÑÜÙ ÜÔê×éÑ ÑÛÚ éÔ×èÙÒ ØÕäÜ ÐÕ ÜÐ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. TOTAL_EXCEP_FINALLYS_RUN_00D_NAME=# of Finallys / sec TOTAL_EXCEP_FINALLYS_RUN_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê ÔÞáäè éÜ ÑÜÕçÙÝ ÞáÕÒ Finally éÔÕäâÜÕ ÑéàÙÙÔ. ÑÜÕç ÞáÕÒ Finally ÙÕäâÜ ÑÕÕÓÐÕê ÜÜÐ çéè ÜÐÕäß éÑÕ ÔêÑæâÔ ÔÙæÙÐÔ ÞÔÑÜÕç. ÔÞÕàÔ áÕäè èç ÑÜÕçÙ Finally éÔÕäâÜÕ ÑÒÜÜ ×èÙÒ; ÑÜÕçÙ Finally ÑàêÙÑÙ çÕÓ èÒÙÜÙÝ ÐÙàÝ àáäèÙÝ âÜ-ÙÓÙ ÞÕàÔ ÖÔ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. EXCEPT_STACK_DEPTH_00D_NAME=Throw To Catch Depth / sec EXCEPT_STACK_DEPTH_00D_HELP=ÞÕàÔ ÖÔ ÞæÙÒ Ðê Þáäè ÞáÒèÕê ÔÞ×áàÙê éâÑèÕ ÞÔÞáÒèê éÔêèÙâÔ âÜ ×èÙÒ  .NET ÐÜ ÔÞáÒèê éØÙäÜÔ Ñ×èÙÒ ÑéàÙÙÔ. ÞÕàÔ ÖÔ ÞêÐäá Ü- 0 Ñâê ÔÖàê ÞØäÜ Ñ×èÙÒÙÝ, ÛÚ é×èÙÒÙÝ ÞçÕààÙÝ ÙÕÑÙÜÕ Ðê ÔÞØäÜ ÜâÕÞç Þ×áàÙê ÔÞØäÜ. ÞÕàÔ ÖÔ ÐÙàÕ ÞæÙÙß ÞÞÕæâ ÜÐÕèÚ ÖÞß, ÐÜÐ ÞæÙÒ Ðê ÔÔäèé ÑÙß ÔâèÛÙÝ éàæäÕ ÑéêÙ ÔÓÒÙÞÕê ÔÐ×èÕàÕê, ×ÜçÙ ÞéÚ ÞèÕÕ× ÔÓÒÙÞÔ. DotNetCLR_Memory_OBJECT_00E_NAME=.NET CLR  memória DotNetCLR_Memory_OBJECT_00E_HELP=A közös nyelvi futtató környezet szemétgyqjtési szolgáltatásával kezelt halommemóriára vonatkozó számlálók GEN0_COLLECTIONS_COUNTER_00E_NAME=0. generációs gyqjtések száma GEN0_COLLECTIONS_COUNTER_00E_HELP=Ez a számláló azt mutatja, hogy a 0. generációs (legfiatalabb, legkésQbb lefoglalt) objektumok hányszor estek át szemétgyqjtésen (0. generációs szemétgyqjtés) az alkalmazás elindítása óta. Akkor kerül sor 0. generációs szemétgyqjtésre, amikor a rendelkezésre álló 0. generációs memória nem elegendQ egy foglalási kérelem teljesítéséhez. A rendszer a 0. generációs szemétgyqjtések végén növeli a számlálót. A magasabb generációs szemétgyqjtések az összes alacsonyabb generációs szemétgyqjtést magukban foglalják. A rendszer explicit módon növeli ezt a számlálót magasabb (1. vagy 2.) generációs szemétgyqjtés elvégzésekor. A _Global_ számlálóérték nem pontos, ezért figyelmen kívül hagyható. Ez a számláló a legutóbbi megfigyelt értéket mutatja. GEN1_COLLECTIONS_COUNTER_00E_NAME=1. generációs gyqjtések száma GEN1_COLLECTIONS_COUNTER_00E_HELP=Ez a számláló azt mutatja, hogy az 1. generációs objektumok hányszor estek át szemétgyqjtésen az alkalmazás elindítása óta. A rendszer az 1. generációs szemétgyqjtések végén növeli a számlálót. A magasabb generációs szemétgyqjtések az összes alacsonyabb generációs szemétgyqjtést magukban foglalják. A rendszer explicit módon növeli ezt a számlálót magasabb (2.) generációs szemétgyqjtés elvégzésekor. A _Global_ számlálóérték nem pontos, ezért figyelmen kívül hagyható. Ez a számláló a legutóbbi megfigyelt értéket mutatja. GEN2_COLLECTIONS_COUNTER_00E_NAME=2. generációs gyqjtések száma GEN2_COLLECTIONS_COUNTER_00E_HELP=Ez a számláló azt mutatja, hogy a 2. generációs (régebbi) objektumok hányszor estek át szemétgyqjtésen az alkalmazás elindítása óta. A rendszer a 2. generációs (más néven teljes) szemétgyqjtések végén növeli a számlálót. A _Global_ számlálóérték nem pontos, ezért figyelmen kívül hagyható. Ez a számláló a legutóbbi megfigyelt értéket mutatja. GEN0_BYTES_PROMOTED_COUNTER_00E_NAME=0. generációból elQléptetett memória (bájt) GEN0_BYTES_PROMOTED_COUNTER_00E_HELP=Ez a számláló annak a memóriaterületnek a méretét mutatja bájtban, amelyet a szemétgyqjtés után továbbra is objektumok foglalnak el, és amelyet a rendszer elQléptet 0. generációból 1. generációba. A számláló értéke nem tartalmazza azon objektumok méretét, amelyeket a rendszer csak azért léptetett elQ, mert véglegesítésre várnak. A számláló nem összesített értéket jelez, hanem a legutóbbi szemétgyqjtés végén megfigyelt értéket mutatja. GEN1_BYTES_PROMOTED_COUNTER_00E_NAME=1. generációból elQléptetett memória (bájt) GEN1_BYTES_PROMOTED_COUNTER_00E_HELP=Ez a számláló annak a memóriaterületnek a méretét mutatja bájtban, amelyet a szemétgyqjtés után továbbra is objektumok foglalnak el, és amelyet a rendszer elQléptet 1. generációból 2. generációba. A számláló értéke nem tartalmazza azon objektumok méretét, amelyeket a rendszer csak azért léptetett elQ, mert véglegesítésre várnak. A számláló nem összesített értéket jelez, hanem a legutóbbi szemétgyqjtés végén megfigyelt értéket mutatja. A rendszer nullázza a számlálót, ha a legutóbbi szemétgyqjtés csak 0. generációs szemétgyqjtés volt. GEN0_PROMOTION_RATE_00E_NAME=0. generációból elQléptetett memória (bájt/mp) GEN0_PROMOTION_RATE_00E_HELP=Ez a számláló azt a másodpercenkénti memóriaméretet mutatja bájtban, amelyet a rendszer elQléptet 0. generációból (legfiatalabb) 1. generációba. A számláló értékébe nem számít bele azon objektumok mérete, amelyeket a rendszer csak azért léptetett elQ, mert véglegesítésre várnak. A memória elQléptetésére akkor kerül sor, ha azt a szemétgyqjtés után is objektum foglalja el. A számláló közvetetten jelzi a másodpercenként létrehozott viszonylag hosszabb élettartamú objektumok számát is. A számláló a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. GEN1_PROMOTION_RATE_00E_NAME=1. generációból elQléptetett memória (bájt/mp) GEN1_PROMOTION_RATE_00E_HELP=Ez a számláló azt a másodpercenkénti memóriaméretet mutatja bájtban, amelyet a rendszer elQléptet 1. generációból 2. generációba (legrégebbi). A számláló értékébe nem számít bele azon objektumok mérete, amelyeket a rendszer csak azért léptetett elQ, mert véglegesítésre várnak. A memória elQléptetésére akkor kerül sor, ha azt a szemétgyqjtés után is objektum foglalja el. A 2. generáció a legrégebbi objektumokat tartalmazza, ezért ebbQl a generációból már nem lehet elQléptetni. A számláló közvetetten jelzi a másodpercenként létrehozott nagyon hosszú élettartamú objektumok számát is. A számláló a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00E_NAME=0. generációból elQléptetett véglegesítésre váró memória (bájt) GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_00E_HELP=Ez a számláló annak a memóriaterületnek a méretét mutatja bájtban, amelyet a rendszer csak azért léptetett elQ 0. generációból 1. generációba, mert véglegesítésre vár. A számláló nem összesített értéket jelez, hanem a legutóbbi szemétgyqjtés végén megfigyelt értéket mutatja. PROCESS_ID_00E_NAME=Folyamatazonosító PROCESS_ID_00E_HELP=Ez a számláló a közös nyelvi futtató környezet megfigyelt folyamatpéldányának folyamatazonosítóját jeleníti meg. Az érték az elsQ szemétgyqjtés végéig 0 lesz. GEN0_HEAP_SIZE_COUNTER_00E_NAME=0. generációs halommemória mérete (bájt) GEN0_HEAP_SIZE_COUNTER_00E_HELP=Ez a számláló a 0. generációban lefoglalható maximális memóriaterület méretét mutatja bájtban, nem jelzi azonban a 0. generációban ténylegesen lefoglalt memória pillanatnyi méretét. Akkor kerül sor 0. generációs szemétgyqjtésre, amikor a legutóbbi szemétgyqjtés óta végrehajtott foglalások meghaladják ezt a méretet. A 0. generációs memória méretét a szemétgyqjtQ szabályozza, és a méret egy alkalmazás végrehajtása során változhat. Egy 0. generációs szemétgyqjtés végén a 0. generációs halommemória mérete tulajdonképpen 0 bájt. Ez a számláló azt a foglalási méretet mutatja (bájtban), amely kiváltaná a következQ 0. generációs szemétgyqjtést. A rendszer a szemétgyqjtések végén frissíti a számlálót, nem az egyes foglalások után. GEN1_HEAP_SIZE_COUNTER_00E_NAME=1. generációs halommemória mérete (bájt) GEN1_HEAP_SIZE_COUNTER_00E_HELP=Ez a számláló az 1. generációs memória pillanatnyi méretét mutatja bájtban, nem jelzi azonban az 1. generációs memória maximális méretét. Ebben a generációban nem foglalhatók le objektumok közvetlenül, csak korábbi 0. generációs szemétgyqjtések során elQléptetéssel juthatnak ebbe a generációba. A rendszer a szemétgyqjtések végén frissíti a számlálót, nem az egyes foglalások után. GEN2_HEAP_SIZE_COUNTER_00E_NAME=2. generációs halommemória mérete (bájt) GEN2_HEAP_SIZE_COUNTER_00E_HELP=Ez a számláló a 2. generációs memória pillanatnyi méretét mutatja bájtban. Ebben a generációban nem foglalhatók le objektumok közvetlenül, csak korábbi 1. generációs szemétgyqjtések során az 1. generációból elQléptetéssel juthatnak ebbe a generációba. A rendszer a szemétgyqjtések végén frissíti a számlálót, nem az egyes foglalások után. LARGE_OBJECT_SIZE_COUNTER_00E_NAME=Nagy objektumok halommemóriájának mérete (bájt) LARGE_OBJECT_SIZE_COUNTER_00E_HELP=Ez a számláló a nagy objektumok halommemóriájának pillanatnyi méretét mutatja bájtban. A szemétgyqjtQ egy adott küszöbértéknél nagyobb objektumokat tekint nagy objektumnak, és ezek számára közvetlenül foglal helyet egy speciális halommemóriában. Ezeket az objektumokat a rendszer nem lépteti végig a generációkon. A CLR 1.1-es és újabb verzióiban 85 000 bájt a küszöbérték. A rendszer a szemétgyqjtések végén frissíti ezt a számlálót, nem az egyes foglalások után. SURVIVE_FINALIZE_COUNTER_00E_NAME=Véglegesítés után fennmaradt SURVIVE_FINALIZE_COUNTER_00E_HELP=Ez a számláló azoknak a szemétgyqjtésen átesett objektumoknak a számát mutatja, amelyek azért élték túl a szemétgyqjtést, mert véglegesítésre várnak. Ha ezek az objektumok más objektumokra mutató hivatkozásokat tartalmaznak, akkor azok az objektumok is túlélik a szemétgyqjtést, de a számuk nem tartozik bele e számláló értékébe. A  0. generációból elQléptetett véglegesítésre váró memória és az  1. generációból elQléptetett véglegesítésre váró memória számláló mutatja a véglegesítés miatt a szemétgyqjtést túlélQ teljes memóriaméretet. A számláló nem összesített értéket jelez, a rendszer minden szemétgyqjtés végén frissíti az adott szemétgyqjtést túlélQ objektumok számával. A számláló célja annak az erQforrástöbbletnek a jelzése, amelyet az alkalmazás a véglegesítés miatt igényel. NUM_HANDLES_COUNTER_00E_NAME=Szemétgyqjtési leírók száma NUM_HANDLES_COUNTER_00E_HELP=Ez a számláló a jelenleg használatban levQ szemétgyqjtési leírók pillanatnyi számát mutatja. A szemétgyqjtési leírók a közös nyelvi futtató környezet és a felügyelt környezet szempontjából külsQ erQforrásokhoz tartozó leírók. A leírók kis területet foglalnak el a szemétgyqjtQ által kezelt halommemóriában, de egyes esetekben jelentQs mennyiségq nem felügyelt erQforrást igényelhetnek. ALLOCATION_RATE_COUNTER_00E_NAME=Foglalás gyakorisága (bájt/mp) ALLOCATION_RATE_COUNTER_00E_HELP=Ez a számláló a szemétgyqjtQ által kezelt halommemóriában másodpercenként lefoglalt bájtok számát mutatja. A rendszer a szemétgyqjtések végén frissíti a számlálót, nem az egyes foglalások után. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. INDUCED_GC_COUNTER_00E_NAME=ElQidézett szemétgyqjtések száma INDUCED_GC_COUNTER_00E_HELP=Ez a számláló azt a legmagasabb értéket mutatja, ahányszor a szemétgyqjtésre a GC.Collect metódus explicit hívása miatt került sor. Általában célszerq a szemétgyqjtQre bízni a szemétgyqjtések gyakoriságának meghatározását. PER_TIME_IN_GC_COUNTER_00E_NAME=Szemétgyqjtéssel töltött idQ aránya (%) PER_TIME_IN_GC_COUNTER_00E_HELP=Ez a számláló azt mutatja, hogy a rendszer a legutóbbi szemétgyqjtési ciklus óta eltelt idQ hány százalékát töltötte szemétgyqjtéssel. A számláló általában azt jelzi, hogy a szemétgyqjtQ mennyit dolgozott az alkalmazás helyett a memória összegyqjtésével és tömörítésével. A rendszer a szemétgyqjtések végén frissíti a számlálót, és a számláló nem átlagot jelez, hanem a legutóbbi megfigyelt értéket mutatja. PER_TIME_IN_GC_COUNTER_BASE_00E_NAME=Nem jelenik meg. PER_TIME_IN_GC_COUNTER_BASE_00E_HELP=Nem jelenik meg. TOTAL_HEAP_SIZE_COUNTER_00E_NAME=Az összes halommemória mérete (bájt) TOTAL_HEAP_SIZE_COUNTER_00E_HELP=Ez a számláló a következQ négy számláló értékének összegét mutatja: 0. generációs halommemória mérete, 1. generációs halommemória mérete, 2. generációs halommemória mérete és Nagy objektumok halommemóriájának mérete. A számláló a szemétgyqjtQ által kezelt halommemóriákból pillanatnyilag lefoglalt memória méretét jelzi bájtban. TOTAL_COMMITTED_MEM_COUNTER_00E_NAME=Lefoglalt memória teljes mérete (bájt) TOTAL_COMMITTED_MEM_COUNTER_00E_HELP=Ez a számláló a szemétgyqjtQ által jelenleg lefoglalt virtuális memória méretét mutatja bájtban. (A lefoglalt memória az a fizikai memória, amelynek számára a rendszer területet foglalt le a merevlemezen levQ lapozófájlban.) TOTAL_RESERVED_MEM_COUNTER_00E_NAME=Fenntartott memória teljes mérete (bájt) TOTAL_RESERVED_MEM_COUNTER_00E_HELP=Ez a számláló a szemétgyqjtQ által jelenleg fenntartott virtuális memória méretét mutatja bájtban. (A fenntartott memória az a virtuális memória, amelyet a rendszer lefoglalt az alkalmazás számára, de amelybQl még nem használt merevlemezen levQ vagy fizikai memórialapokat.) GC_PINNED_OBJECTS_00E_NAME=Rögzített objektumok száma GC_PINNED_OBJECTS_00E_HELP=Ez a számláló a legutóbbi szemétgyqjtés során talált rögzített objektumok számát mutatja. A számláló csak azokban a halommemóriákban tartja számon a rögzített objektumokat, amelyekben ténylegesen történt szemétgyqjtés. Például egy 0. generációs szemétgyqjtés után a számláló csak a 0. generációs halommemóriában levQ rögzített objektumok számát jelzi. Azok az objektumok tekintendQk rögzített objektumnak, amelyeket a szemétgyqjtQ nem tud mozgatni a memóriában. GC_SINKBLOCKS_00E_NAME=Használatban levQ szinkronizálási blokkok száma GC_SINKBLOCKS_00E_HELP=Ez a számláló a használatban levQ szinkronizálási blokkok pillanatnyi számát mutatja. A szinkronizálási blokkok olyan objektumonkénti adatszerkezetek, amelyeket a rendszer a szinkronizálási adatok tárolásához foglal le. A szinkronizálási blokkok a felügyelt objektumokra mutató gyenge hivatkozásokat tartalmaznak, ezért szükséges, hogy a szemétgyqjtQ megvizsgálja Qket. A szinkronizálási blokkok nem kizárólag szinkronizálási adatokat, hanem COM-együttmqködési metaadatokat is tárolhatnak. A számláló jelzi a szinkronizálási eszközök nagy igénybevételéhez kapcsolódó teljesítményproblémákat. DotNetCLR_Loading_OBJECT_00E_NAME=.NET CLR  betöltés DotNetCLR_Loading_OBJECT_00E_HELP=A közös nyelvi futtató környezet osztálybetöltQjére vonatkozó statisztikák LOADING_CLASSES_TOTAL_00E_NAME=Betöltött osztályok száma összesen LOADING_CLASSES_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta az összes szerelvényben betöltött osztályok összesített számát mutatja. LOADING_TIME_00E_NAME=Betöltéssel töltött idQ aránya (%) LOADING_TIME_00E_HELP=JövQbeli használatra fenntartva. LOADING_ASMSEARCHLEN_00E_NAME=Szerelvény keresési hossza LOADING_ASMSEARCHLEN_00E_HELP=JövQbeli használatra fenntartva. LOADING_LOADFAILURES_TOTAL_00E_NAME=Betöltési hibák száma összesen LOADING_LOADFAILURES_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta hiba miatt be nem töltött osztályok legmagasabb számát mutatja. Ezeknek a betöltési hibáknak számos oka lehet, például nem megfelelQ biztonsági szint vagy érvénytelen formátum. A részletekrQl a teljesítményelemzést végzQ szolgáltatások súgójában olvashat bQvebben. LOADING_LOADFAILURES_INST_00E_NAME=Betöltési hibák gyakorisága (hiba/mp) LOADING_LOADFAILURES_INST_00E_HELP=Ez a számláló a hiba miatt másodpercenként be nem töltött osztályok számát mutatja. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. Ezeknek a betöltési hibáknak számos oka lehet, például nem megfelelQ biztonsági szint vagy érvénytelen formátum. A részletekrQl a teljesítményelemzést végzQ szolgáltatások súgójában olvashat bQvebben. LOADING_HEAPSIZE_00E_NAME=A betöltési halommemória mérete (bájt) LOADING_HEAPSIZE_00E_HELP=Ez a számláló az osztálybetöltQ által az összes alkalmazástartományban lefoglalt memória pillanatnyi méretét mutatja bájtban. (A lefoglalt memória az a fizikai memória, amelynek számára a rendszer területet foglalt le a merevlemezen levQ lapozófájlban.) LOADING_APPDOMAINS_UNLOADED_TOTAL_00E_NAME=Memóriából eltávolított alkalmazástartományok száma összesen LOADING_APPDOMAINS_UNLOADED_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta a memóriából eltávolított alkalmazástartományok összesített számát mutatja. Ha a rendszer egy alkalmazástartományt többször betölt a memóriába, majd eltávolít onnan, akkor ez a számláló minden egyes eltávolítást külön számol. LOADING_APPDOMAINS_UNLOADED_INST_00E_NAME=Alkalmazástartományok memóriából való eltávolításának gyakorisága (eltávolítás/mp) LOADING_APPDOMAINS_UNLOADED_INST_00E_HELP=Ez a számláló a memóriából másodpercenként eltávolított alkalmazástartományok számát mutatja. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. LOADING_CLASSES_CUR_00E_NAME=Betöltött osztályok pillanatnyi száma LOADING_CLASSES_CUR_00E_HELP=Ez a számláló az összes szerelvényben betöltött osztályok pillanatnyi számát mutatja. LOADING_CLASSES_INST_00E_NAME=Osztályok betöltésének gyakorisága (betöltés/mp) LOADING_CLASSES_INST_00E_HELP=Ez a számláló az összes szerelvényben másodpercenként betöltött osztályok számát mutatja. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. LOADING_APPDOMAINS_CUR_00E_NAME=Alkalmazástartományok pillanatnyi száma LOADING_APPDOMAINS_CUR_00E_HELP=Ez a számláló az ebben az alkalmazásban betöltött alkalmazástartományok pillanatnyi számát mutatja. Az alkalmazástartományok biztonságos és sokoldalú feldolgozási egységet biztosítanak, amelynek használatával a közös nyelvi futtató környezet el tudja különíteni az egy folyamatban futó alkalmazásokat. LOADING_APPDOMAINS_TOTAL_00E_NAME=Alkalmazástartományok száma összesen LOADING_APPDOMAINS_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta betöltött alkalmazástartományok legmagasabb számát mutatja. Az alkalmazástartományok biztonságos és sokoldalú feldolgozási egységet biztosítanak, amelynek használatával a közös nyelvi futtató környezet el tudja különíteni az egy folyamatban futó alkalmazásokat. LOADING_APPDOMAINS_INST_00E_NAME=Alkalmazástartományok betöltésének gyakorisága (betöltés/mp) LOADING_APPDOMAINS_INST_00E_HELP=Ez a számláló a másodpercenként betöltött alkalmazástartományok számát mutatja. Az alkalmazástartományok biztonságos és sokoldalú feldolgozási egységet biztosítanak, amelynek használatával a közös nyelvi futtató környezet el tudja különíteni az egy folyamatban futó alkalmazásokat. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. LOADING_ASSEMBLIES_CUR_00E_NAME=Szerelvények pillanatnyi száma LOADING_ASSEMBLIES_CUR_00E_HELP=Ez a számláló az ezen alkalmazás összes alkalmazástartományában betöltött szerelvények pillanatnyi számát mutatja. Ha egy szerelvényt a rendszer több alkalmazástartományból is betölt tartománysemleges módon, akkor ez a számláló azt csak egy betöltésnek tekinti. A szerelvények betölthetQk tartománysemleges módon, ha kódjukat az összes alkalmazástartomány megoszthatja, illetve tartományspecifikus módon, ha kódjukat egy alkalmazástartomány a sajátjaként kezeli. LOADING_ASSEMBLIES_TOTAL_00E_NAME=Szerelvények száma összesen LOADING_ASSEMBLIES_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta betöltött szerelvények összesített számát mutatja. Ha egy szerelvényt a rendszer több alkalmazástartományból is betölt tartománysemleges módon, akkor ez a számláló azt csak egy betöltésnek tekinti. A szerelvények betölthetQk tartománysemleges módon, ha kódjukat az összes alkalmazástartomány megoszthatja, illetve tartományspecifikus módon, ha kódjukat egy alkalmazástartomány a sajátjaként kezeli. LOADING_ASSEMBLIES_INST_00E_NAME=Szerelvények betöltésének gyakorisága (betöltés/mp) LOADING_ASSEMBLIES_INST_00E_HELP=Ez a számláló az összes alkalmazástartományban másodpercenként betöltött szerelvények számát mutatja. Ha egy szerelvényt a rendszer több alkalmazástartományból is betölt tartománysemleges módon, akkor ez a számláló azt csak egy betöltésnek tekinti. A szerelvények betölthetQk tartománysemleges módon, ha kódjukat az összes alkalmazástartomány megoszthatja, illetve tartományspecifikus módon, ha kódjukat egy alkalmazástartomány a sajátjaként kezeli. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. DotNetCLR_Jit_OBJECT_00E_NAME=.NET CLR  igény szerinti fordítás DotNetCLR_Jit_OBJECT_00E_HELP=A közös nyelvi futtató környezet igény szerinti fordítási szolgáltatására vonatkozó statisztikák TOTAL_METHODS_JITTED_00E_NAME=Igény szerint fordított metódusok száma TOTAL_METHODS_JITTED_00E_HELP=Ez a számláló az alkalmazás elindítása óta a közös nyelvi futtató környezet igény szerinti fordítója által igény szerint fordított metódusok összesített számát mutatja. A számláló értéke nem tartalmazza az igény szerinti fordításra elQkészített metódusok számát. JITTED_IL_CUR_00E_NAME=Igény szerint fordított közbensQ nyelvq kód mennyisége (bájt) JITTED_IL_CUR_00E_HELP=Ez a számláló az alkalmazás elindítása óta igény szerint fordított közbensQ nyelvq kód összesített méretét mutatja bájtban. A számláló értéke pontosan megegyezik az  Igény szerint fordított közbensQ nyelvq kód összesen számláló értékével. JITTED_IL_TOTAL_00E_NAME=Igény szerint fordított közbensQ nyelvq kód összesen (bájt) JITTED_IL_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta igény szerint fordított közbensQ nyelvq kód összesített méretét mutatja bájtban. A számláló értéke pontosan megegyezik az  Igény szerint fordított közbensQ nyelvq kód mennyisége számláló értékével. JITTED_IL_INST_00E_NAME=KözbensQ nyelvq kód igény szerinti fordításának sebessége (bájt/mp) JITTED_IL_INST_00E_HELP=Ez a számláló az igény szerint másodpercenként lefordított metódusok számát mutatja. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. JIT_FAILURES_00E_NAME=Szokásos igény szerinti fordítási hibák száma JIT_FAILURES_00E_HELP=Ez a számláló az alkalmazás elindítása óta hiba miatt sikertelen igény szerinti metódusfordítások legmagasabb számát mutatja. Ilyen sikertelen fordítás akkor következhet be, ha a közbensQ nyelvq kód nem ellenQrizhetQ, vagy ha belsQ hiba történik az igény szerinti fordítóban. TIME_IN_JIT_00E_NAME=Igény szerinti fordítással töltött idQ aránya (%) TIME_IN_JIT_00E_HELP=Ez a számláló azt mutatja, hogy a rendszer a legutóbbi igény szerinti fordítási ciklus óta eltelt idQ hány százalékát töltötte igény szerinti fordítással. A rendszer az igény szerinti fordítási ciklusok végén frissíti a számlálót. Az igény szerinti fordítási ciklus az a ciklus, amelyben a rendszer lefordít egy metódust és annak függQségeit. TIME_IN_JIT_BASE_00E_NAME=Nem jelenik meg. TIME_IN_JIT_BASE_00E_HELP=Nem jelenik meg. DotNetCLR_Interop_OBJECT_00E_NAME=.NET CLR  együttmqködés DotNetCLR_Interop_OBJECT_00E_HELP=A közös nyelvi futtató környezet együttmqködési szolgáltatására vonatkozó statisztikák CURRENT_CCW_00E_NAME=COM által hívható burkolók száma CURRENT_CCW_00E_HELP=Ez a számláló a COM által hívható burkolók (CCW-k) pillanatnyi számát mutatja. Egy COM által hívható burkoló tulajdonképpen annak a felügyelt .NET-objektumnak a helyettesítQje (proxyja), amelyre egy (vagy több) nem felügyelt COM-ügyfél hivatkozik. A számláló a nem felügyelt COM-kódból hivatkozott felügyelt objektumok számát jelzi. CURRENT_STUBS_00E_NAME=Stubok száma CURRENT_STUBS_00E_HELP=Ez a számláló a közös nyelvi futtató környezet által létrehozott kódcsonkok pillanatnyi számát mutatja. A kódcsonkok felelQsek az argumentumok és visszatérési értékek felügyelt és nem felügyelt kód közötti átadásra való felsorakoztatásáért a COM-együttmqködési vagy PInvoke hívások során. NUM_MARSHALLING_00E_NAME=Átadás-elQkészítések száma NUM_MARSHALLING_00E_HELP=Ez a számláló azt mutatja, hogy az alkalmazás elindítása óta összesen hányszor került sor argumentumok és visszatérési értékek felügyelt és nem felügyelt kód közötti átadásra való felsorakoztatására. A számláló értéke nem tartalmazza a kódba beágyazott kódcsonkok által végrehajtott felsorakoztatásokat. (A kódcsonkok felelQsek az argumentumok és visszatérési értékek átadásra való felsorakoztatásáért.) A kódcsonkok általában akkor ágyazódnak be a kódba, ha kicsi a felsorakoztatáshoz kapcsolódó többlet erQforrásigény. TOTAL_TLB_IMPORTS_00E_NAME=Típustár-importálások gyakorisága (importálás/mp) TOTAL_TLB_IMPORTS_00E_HELP=JövQbeli használatra fenntartva. TOTAL_TLB_EXPORTS_00E_NAME=Típustár-exportálások gyakorisága (exportálás/mp) TOTAL_TLB_EXPORTS_00E_HELP=JövQbeli használatra fenntartva. DotNetCLR_LocksAndThreads_OBJECT_00E_NAME=.NET CLR  zárolások és szálak DotNetCLR_LocksAndThreads_OBJECT_00E_HELP=A közös nyelvi futtató környezet zárolásaira és szálaira vonatkozó statisztikák CONTENTION_TOTAL_00E_NAME=Versenyhelyzetek száma összesen CONTENTION_TOTAL_00E_HELP=Ez a számláló azt mutatja, hogy a közös nyelvi futtató környezetben futó szálak összesen hányszor próbáltak sikertelenül felügyelt zárolást szerezni. Felügyelt zárolás többféleképpen szerezhetQ: a C#  lock utasításával, a System.Monitor.Enter metódus hívásával vagy a MethodImplOptions.Synchronized egyéni attribútum használatával. CONTENTION_INST_00E_NAME=Versenyhelyzetek gyakorisága (1/mp) CONTENTION_INST_00E_HELP=Ez a számláló azt mutatja, hogy a futtató környezetben futó szálak milyen gyakran próbáltak sikertelenül felügyelt zárolást szerezni. Felügyelt zárolás többféleképpen szerezhetQ: a C#  lock utasításával, a System.Monitor.Enter metódus hívásával vagy a MethodImplOptions.Synchronized egyéni attribútum használatával. QUEUE_LENGTH_CUR_00E_NAME=Pillanatnyi sorhossz QUEUE_LENGTH_CUR_00E_HELP=Ez a számláló azt mutatja, hogy az alkalmazásban jelenleg összesen hány szál várakozik felügyelt zárolásra. A számláló nem idQbeli átlagot jelez, hanem a legutóbbi megfigyelt értéket mutatja. QUEUE_LENGTH_TOTAL_00E_NAME=Maximális sorhossz QUEUE_LENGTH_TOTAL_00E_HELP=Ez a számláló azt mutatja, hogy az alkalmazás elindítása óta összesen hány szál várakozott felügyelt zárolásra. QUEUE_LENGTH_INST_00E_NAME=Átlagos sorhossz QUEUE_LENGTH_INST_00E_HELP=Ez a számláló azt mutatja, hogy az alkalmazásban másodpercenként hány szál várakozik valamilyen zárolásra. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. CURRENT_LOGICAL_THREADS_00E_NAME=Jelenlegi logikai szálak száma CURRENT_LOGICAL_THREADS_00E_HELP=Ez a számláló az alkalmazás jelenlegi .NET-szálobjektumainak számát mutatja. .NET-szálobjektum a System.Threading.Thread objektum újabb hívásakor jön létre, vagy akkor, amikor egy nem felügyelt szál bekerül a felügyelt környezetbe. A számláló értékébe a futó és a leállított szálak is beleszámítanak. A számláló nem idQbeli átlagot jelez, hanem a legutóbbi megfigyelt értéket mutatja. CURRENT_PHYSICAL_THREADS_00E_NAME=Jelenlegi fizikai szálak száma CURRENT_PHYSICAL_THREADS_00E_HELP=Ez a számláló azoknak az operációs rendszerbeli natív szálaknak a számát mutatja, amelyeknek létrehozója és tulajdonosa a közös nyelvi futtató környezet, és amelyek a .NET-szálobjektumok alapjául szolgálnak. A számláló értékébe nem számítanak bele a közös nyelvi futtató környezet által a belsQ mqveletekhez használt szálak. A számláló által nyomon követett szálak az operációs rendszer folyamataiban futó szálak részhalmazát alkotják. RECOGNIZED_THREADS_CUR_00E_NAME=Jelenlegi felismert szálak száma RECOGNIZED_THREADS_CUR_00E_HELP=Ez a számláló a közös nyelvi futtató környezet által jelenleg felismert szálak számát mutatja. Ezekhez a szálakhoz tartozik megfelelQ .NET-szálobjektum. Ezeket a szálakat nem a közös nyelvi futtató környezet hozta létre. Létrehozásuk a futtató környezeten kívül történt, de azóta legalább egyszer futottak már a közös nyelvi futtató környezetben. A számláló csak az egyedi szálakat követi nyomon, az azonos szálazonosítóval a közös nyelvi futtató környezetbe újból belépQ, illetve a szál leállása után újból létrehozott szálakat nem tekinti két külön szálnak. RECOGNIZED_THREADS_TOTAL_00E_NAME=Felismert szálak száma összesen RECOGNIZED_THREADS_TOTAL_00E_HELP=Ez a számláló a közös nyelvi futtató környezet által az alkalmazás elindítása óta felismert szálak összesített számát mutatja. Ezekhez a szálakhoz tartozik megfelelQ .NET-szálobjektum. Ezeket a szálakat nem a közös nyelvi futtató környezet hozta létre. Létrehozásuk a futtató környezeten kívül történt, de azóta legalább egyszer futottak már a közös nyelvi futtató környezetben. A számláló csak az egyedi szálakat követi nyomon, az azonos szálazonosítóval a közös nyelvi futtató környezetbe újból belépQ, illetve a szál leállása után újból létrehozott szálakat nem tekinti két külön szálnak. RECOGNIZED_THREADS_INST_00E_NAME=Felismert szálak gyakorisága (szál/mp) RECOGNIZED_THREADS_INST_00E_HELP=Ez a számláló a közös nyelvi futtató környezet által másodpercenként felismert szálak számát mutatja. Ezekhez a szálakhoz tartozik megfelelQ .NET-szálobjektum. Ezeket a szálakat nem a közös nyelvi futtató környezet hozta létre. Létrehozásuk a futtató környezeten kívül történt, de azóta legalább egyszer futottak már a közös nyelvi futtató környezetben. A számláló csak az egyedi szálakat követi nyomon, az azonos szálazonosítóval a közös nyelvi futtató környezetbe újból belépQ, illetve a szál leállása után újból létrehozott szálakat nem tekinti két külön szálnak. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. DotNetCLR_Security_OBJECT_00E_NAME=.NET CLR  biztonság DotNetCLR_Security_OBJECT_00E_HELP=A közös nyelvi futtató környezet biztonsági szolgáltatására vonatkozó statisztikák SECURITY_TOTALRTCHECKS_00E_NAME=Futásidejq vizsgálatok száma összesen SECURITY_TOTALRTCHECKS_00E_HELP=Ez a számláló az alkalmazás elindítása óta a kódelérés biztonsága (Code Access Security  CAS) futásidejq vizsgálatainak összesített számát mutatja. A kódelérés biztonságának futásidejq vizsgálatára akkor kerül sor, amikor egy hívó olyan felet hív, amelyhez meghatározott engedély szükséges. A futásidejq vizsgálatot a hívó minden hívás esetén elvégzi a hívó aktuális szálvermének vizsgálatával. Ez a számláló a  Verembejárás mélysége számlálóval együtt használva jelzi a biztonsági vizsgálatok által okozott teljesítményveszteséget. SECURITY_TIMEAUTHORIZE_00E_NAME=Aláírás-hitelesítéssel töltött idQ aránya (%) SECURITY_TIMEAUTHORIZE_00E_HELP=JövQbeli használatra fenntartva. SECURITY_LINKCHECKS_00E_NAME=Kódszerkesztés közben elvégzett vizsgálatok száma SECURITY_LINKCHECKS_00E_HELP=Ez a számláló az alkalmazás elindítása óta a kódelérés biztonsága (Code Access Security  CAS) kódszerkesztés (linkelés) közben végzett vizsgálatainak összesített számát mutatja. A kódelérés biztonságának kódszerkesztés közbeni vizsgálatára akkor kerül sor, amikor egy hívó olyan felet hív, amelyhez az igény szerinti fordítás idején meghatározott engedély szükséges. A kódszerkesztés közbeni vizsgálatot a rendszer minden hívóra egyszer végzi el. Ez a számláló nem jelez komoly teljesítményproblémákat, csak a biztonsági rendszer aktivitását mutatja. SECURITY_TIMERTCHECKS_00E_NAME=Futásidejq vizsgálattal töltött idQ aránya (%) SECURITY_TIMERTCHECKS_00E_HELP=Ez a számláló azt mutatja, hogy a rendszer a legutóbbi vizsgálat óta eltelt idQ hány százalékát töltötte a kódelérés biztonságának futásidejq vizsgálatával. A kódelérés biztonsága lehetQvé teszi, hogy meghatározott megbízhatósági szinteket rendeljenek a kódhoz, és a segítségével a kód azonosítója alapján adhatók engedélyek a megbízhatósági szintnek megfelelQen. A rendszer a futásidejq biztonsági vizsgálatok végén frissíti a számlálót, és a számláló nem átlagot jelez, hanem a legutóbbi megfigyelt értéket mutatja. SECURITY_TIMERTCHECKS_BASE_00E_NAME=Nem jelenik meg. SECURITY_TIMERTCHECKS_BASE_00E_HELP=Nem jelenik meg. SECURITY_DEPTHSECURITY_00E_NAME=Verembejárás mélysége SECURITY_DEPTHSECURITY_00E_HELP=Ez a számláló a verem mélységét mutatja a kódelérés biztonságának legutóbbi futásidejq vizsgálata során. A kódelérés biztonságának futásidejq vizsgálatát a rendszer a verem bejárásával végzi. A számláló nem átlagot jelez, hanem a legutóbbi megfigyelt értéket mutatja. DotNetCLR_Remoting_OBJECT_00E_NAME=.NET CLR  távoli eljáráshívás DotNetCLR_Remoting_OBJECT_00E_HELP=A közös nyelvi futtató környezet távoli eljáráshívási szolgáltatására vonatkozó statisztikák CONTEXT_REMOTECALLS_INST_00E_NAME=Távoli hívások gyakorisága (hívás/mp) CONTEXT_REMOTECALLS_INST_00E_HELP=Ez a számláló a másodpercenként kezdeményezett távoli eljáráshívások számát mutatja. Minden olyan hívás távoli eljáráshívásnak tekintendQ, amely a hívó alkalmazástartományán kívüli objektumra irányul. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. CONTEXT_CHANNELS_00E_NAME=Csatornák száma CONTEXT_CHANNELS_00E_HELP=Ez a számláló az alkalmazás elindítása óta az összes alkalmazástartományban bejegyzett távoli eljáráshívási csatornák összesített számát mutatja. A csatornákat a rendszer a távoli objektumoknak küldött és az azoktól érkezQ üzenetek továbbítására használja. CONTEXT_PROXIES_00E_NAME=Környezeti proxyk száma CONTEXT_PROXIES_00E_HELP=Ez a számláló a folyamat elindítása óta ebben a folyamatban létrehozott távoli eljáráshívási proxyobjektumok összesített számát mutatja. A proxyobjektumok a távoli objektumok helyettesítQjeként szolgálnak, és biztosítják, hogy a proxyra irányuló hívások eljussanak a távoli objektumok megfelelQ példányához. CONTEXT_CLASSES_00E_NAME=Környezethez kötött betöltött osztályok száma CONTEXT_CLASSES_00E_HELP=Ez a számláló a környezethez kötött és jelenleg betöltött osztályok pillanatnyi számát mutatja. Azokat az osztályokat nevezik környezethez kötött osztálynak, amelyek egy környezethez köthetQk. A környezethez kötött osztályok környezeti attribútumokkal rendelkeznek, amelyek használati szabályokat adnak meg a szinkronizáláshoz, a szálaffinitáshoz, a tranzakciókhoz stb. CONTEXT_OBJALLOC_00E_NAME=Környezethez kötött objektumfoglalások gyakorisága (foglalás/mp) CONTEXT_OBJALLOC_00E_HELP=Ez a számláló a másodpercenként lefoglalt, környezethez kötött objektumok számát mutatja. Azon osztályok példányait nevezik környezethez kötött objektumnak, amelyek egy környezethez köthetQk. A környezethez kötött osztályok környezeti attribútumokkal rendelkeznek, amelyek használati szabályokat adnak meg a szinkronizáláshoz, a szálaffinitáshoz, a tranzakciókhoz stb. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. CONTEXT_CONTEXTS_00E_NAME=Környezetek száma CONTEXT_CONTEXTS_00E_HELP=Ez a számláló az alkalmazásban levQ távoli eljáráshívási környezetek pillanatnyi számát mutatja. Egy környezet tulajdonképpen egy olyan határ, amelyen belül azonos használati szabályokkal (pl. szinkronizálással, szálaffinitással, tranzakciókkal stb.) rendelkezQ objektumok gyqjteménye található. CONTEXT_REMOTECALLS_TOTAL_00E_NAME=Távoli hívások száma összesen CONTEXT_REMOTECALLS_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta kezdeményezett távoli eljáráshívások összesített számát mutatja. Minden olyan hívás távoli eljáráshívásnak tekintendQ, amely a hívó alkalmazástartományán kívüli objektumra irányul. DotNetCLR_Excep_OBJECT_00E_NAME=.NET CLR  kivételek DotNetCLR_Excep_OBJECT_00E_HELP=A közös nyelvi futtató környezet kivételkezelésére vonatkozó futásidejq statisztikák EXCEP_THROWN_TOTAL_00E_NAME=Kiváltott kivételek száma EXCEP_THROWN_TOTAL_00E_HELP=Ez a számláló az alkalmazás elindítása óta kiváltott kivételek összesített számát mutatja. Értékébe beleszámítanak mind a .NET-kivételek, mind a nem felügyelt kódból kiváltott és .NET-kivétellé konvertált kivételek (például egy nem felügyelt kódból kiváltott NULL mutatóhivatkozás miatti kivételt a rendszer újra kivált a felügyelt kódból a .NET rendszer System.NullReferenceException kivételeként). Ez a számláló mind a kezelt, mind a nem kezelt kivételek számát mutatja. Az újból kiváltott kivételek kétszer számítanak. Kivételeknek csak ritka esetekben szabad bekövetkezniük, a program normális végrehajtása során nem. EXCEP_THROWN_INST_00E_NAME=Kivételkiváltás gyakorisága (kivétel/mp) EXCEP_THROWN_INST_00E_HELP=Ez a számláló a másodpercenként kiváltott kivételek számát mutatja. Értékébe beleszámítanak mind a .NET-kivételek, mind a nem felügyelt kódból kiváltott és .NET-kivétellé konvertált kivételek (például egy nem felügyelt kódból kiváltott NULL mutatóhivatkozás miatti kivételt a rendszer újra kivált a felügyelt kódból a .NET rendszer System.NullReferenceException kivételeként). Ez a számláló mind a kezelt, mind a nem kezelt kivételek számát mutatja. Kivételeknek csak ritka esetekben szabad bekövetkezniük, a program normális végrehajtása során nem. E számláló célja az, hogy jelezze a túl gyakori (>100/s) kivételek miatti esetleges teljesítményproblémákat. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. TOTAL_EXCEP_FILTERS_RUN_00E_NAME=SzqrQfuttatás gyakorisága (szqrés/mp) TOTAL_EXCEP_FILTERS_RUN_00E_HELP=Ez a számláló a másodpercenként végrehajtott .NET-kivételszqrQk számát mutatja. A kivételszqrQk állapítják meg, hogy kell-e kezelni az egyes kivételeket, vagy sem. Ez a számláló a kivételszqrQk kiértékelésének gyakoriságát mutatja függetlenül attól, hogy a rendszer végül kezelte-e a kivételt, vagy nem. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. TOTAL_EXCEP_FINALLYS_RUN_00E_NAME=Finally blokkok gyakorisága (blokk/mp) TOTAL_EXCEP_FINALLYS_RUN_00E_HELP=Ez a számláló a másodpercenként végrehajtott Finally blokkok számát mutatja. A Finally blokkot a rendszer mindenképpen végrehajtja függetlenül attól, hogy hogyan lépett ki a Try blokkból. A számláló csak a kivételkezelés során végrehajtott Finally blokkokat számolja, a normális kódvégrehajtási szekvenciában levQket nem. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. EXCEPT_STACK_DEPTH_00E_NAME=Kiváltás és kezelés közötti átlagos veremmélység (keret/mp) EXCEPT_STACK_DEPTH_00E_HELP=Ez a számláló azt mutatja, hogy egy .NET-kivételt kiváltó kerettQl indulva a rendszer másodpercenként hány veremkeretet lép át a kivételt kezelQ keretig. A rendszer nullázza a számlálót, amikor belép egy kivételkezelQbe. Így a számláló beágyazott kivételek esetén a kezelQk közötti veremmélységet jelzi. A számláló nem idQbeli átlagot jelez, hanem a két legutóbbi mintában megfigyelt érték különbségének és a mintavételi idQköznek a hányadosát mutatja. DotNetCLR_Memory_OBJECT_010_NAME=Memoria CLR .NET DotNetCLR_Memory_OBJECT_010_HELP=Contatori per l'heap del Garbage Collector CLR. GEN0_COLLECTIONS_COUNTER_010_NAME=Raccolte di generazione 0 GEN0_COLLECTIONS_COUNTER_010_HELP=Questo contatore indica il numero di volte che gli oggetti di generazione 0 (allocati più di recente) vengono raccolti nel Garbage Collector (GC generazione 0) dall'avvio dell'applicazione. La raccolta di generazione 0 avviene quando la memoria disponibile non è sufficiente a soddisfare una richiesta di allocazione. Al termine della raccolta, il contatore viene incrementato. Le raccolte delle generazioni superiori includono tutte quelle delle generazioni inferiori. Se viene eseguita la raccolta di una generazione superiore (generazione 1 o 2), il contatore viene incrementato in modo esplicito. Il valore del contatore _Global_ non è preciso e deve essere ignorato. Il contatore indica l'ultimo valore rilevato. GEN1_COLLECTIONS_COUNTER_010_NAME=Raccolte di generazione 1 GEN1_COLLECTIONS_COUNTER_010_HELP=Questo contatore indica il numero di volte che gli oggetti di generazione 1 vengono raccolti nel Garbage Collector dall'avvio dell'applicazione. Al termine di una raccolta di generazione 1, il contatore viene incrementato. Le raccolte delle generazioni superiori includono tutte quelle delle generazioni inferiori. Se viene eseguita la raccolta di una generazione superiore (generazione 2), il contatore viene incrementato in modo esplicito. Il valore del contatore _Global_ non è preciso e deve essere ignorato. Il contatore indica l'ultimo valore rilevato. GEN2_COLLECTIONS_COUNTER_010_NAME=Raccolte di generazione 2 GEN2_COLLECTIONS_COUNTER_010_HELP=Questo contatore indica il numero di volte che gli oggetti di generazione 2 (più vecchi) vengono raccolti nel Garbage Collector dall'avvio dell'applicazione. Al termine di una raccolta di generazione 2 (Garbage Collection completo), il contatore viene incrementato. Il valore del contatore _Global_ non è preciso e deve essere ignorato. Il contatore indica l'ultimo valore rilevato. GEN0_BYTES_PROMOTED_COUNTER_010_NAME=Memoria promossa dalla generazione 0 GEN0_BYTES_PROMOTED_COUNTER_010_HELP=Questo contatore indica i byte di memoria non raccolti dal Garbage Collector e promossi dalla generazione 0 alla generazione 1. Gli oggetti promossi solo perché in attesa di completamento non vengono conteggiati. Il contatore non è cumulativo e indica il valore rilevato al termine dell'ultimo Garbage Collection. GEN1_BYTES_PROMOTED_COUNTER_010_NAME=Memoria promossa dalla generazione 1 GEN1_BYTES_PROMOTED_COUNTER_010_HELP=Questo contatore indica i byte di memoria non raccolti dal Garbage Collector e promossi dalla generazione 1 alla generazione 2. Gli oggetti promossi solo perché in attesa di completamento non vengono conteggiati. Il contatore non è cumulativo e indica il valore rilevato al termine dell'ultimo Garbage Collection. Se l'ultima raccolta è relativa alla sola generazione 0, il contatore viene azzerato. GEN0_PROMOTION_RATE_010_NAME=Byte di generazione 0 promossi/sec GEN0_PROMOTION_RATE_010_HELP=Questo contatore indica il numero di byte promossi dalla generazione 0 (più recente) alla generazione 1 nell'arco di un secondo. Gli oggetti promossi solo perché in attesa di completamento non vengono conteggiati. La memoria viene promossa quando non è raccolta dal Garbage Collector. Lo scopo di questo contatore è indicare il numero degli oggetti di durata relativamente lunga che vengono creati ogni secondo. Il contatore viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. GEN1_PROMOTION_RATE_010_NAME=Byte di generazione 1 promossi/sec GEN1_PROMOTION_RATE_010_HELP=Questo contatore indica il numero di byte promossi dalla generazione 1 alla generazione 2 (più vecchia) nell'arco di un secondo. Gli oggetti promossi solo perché in attesa di completamento non vengono conteggiati. La memoria viene promossa quando non è raccolta dal Garbage Collector. Nessun oggetto può essere promosso dalla generazione 2. Lo scopo di questo contatore è indicare il numero degli oggetti di durata molto lunga che vengono creati ogni secondo. Il contatore viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_010_NAME=Memoria di completamento promossa dalla generazione 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_010_HELP=Questo contatore indica i byte di memoria promossi dalla generazione 0 alla generazione 1 solo perché in attesa di completamento. Il contatore non è cumulativo e indica il valore rilevato al termine dell'ultimo Garbage Collection. PROCESS_ID_010_NAME=ID processo PROCESS_ID_010_HELP=Questo contatore indica l'ID di processo dell'istanza di processo CLR monitorato. Il valore visualizzato sarà 0 fino a dopo il primo Garbage Collection. GEN0_HEAP_SIZE_COUNTER_010_NAME=Dimensione heap di generazione 0 GEN0_HEAP_SIZE_COUNTER_010_HELP=Questo contatore indica il numero massimo di byte che possono essere allocati nella generazione 0, ma non riporta il numero di byte che vi sono attualmente allocati. Quando le allocazioni eseguite dopo l'ultimo Garbage Collection superano questa dimensione, viene avviata una raccolta di generazione 0. La dimensione per la generazione 0 viene regolata dal Garbage Collector e può variare durante l'esecuzione dell'applicazione. Infatti, al termine di una raccolta di generazione 0 la dimensione dell'heap di generazione 0 è di 0 byte. Questo contatore indica la dimensione in byte delle allocazioni oltre la quale viene avviata la successiva raccolta di generazione 0. Viene aggiornato al termine del Garbage Collection, non dopo ogni singola allocazione. GEN1_HEAP_SIZE_COUNTER_010_NAME=Dimensione heap di generazione 1 GEN1_HEAP_SIZE_COUNTER_010_HELP=Questo contatore indica il numero di byte attualmente presenti nella generazione 1 e non la dimensione massima di questa generazione. Gli oggetti non vengono allocati direttamente, ma vengono promossi dalle precedenti raccolte di generazione 0. Il contatore viene aggiornato al termine del Garbage Collection, non dopo ogni singola allocazione. GEN2_HEAP_SIZE_COUNTER_010_NAME=Dimensione heap di generazione 2 GEN2_HEAP_SIZE_COUNTER_010_HELP=Questo contatore indica il numero di byte attualmente presenti nella generazione 2. Gli oggetti non vengono allocati direttamente in questa generazione, ma promossi dalla generazione 1 durante le precedenti raccolte di generazione 1. Il contatore viene aggiornato al termine del Garbage Collection, non dopo ogni singola allocazione. LARGE_OBJECT_SIZE_COUNTER_010_NAME=Dimensione heap oggetti grandi LARGE_OBJECT_SIZE_COUNTER_010_HELP=Questo contatore indica la dimensione corrente in byte dell'heap degli oggetti grandi. Gli oggetti con dimensione superiore alla soglia vengono gestiti dal Garbage Collector come oggetti grandi e allocati direttamente in un heap speciale senza la possibilità di essere promossi da una generazione all'altra. In CLR v1.1 e versione successiva questa soglia è pari a 85000 byte. Il contatore viene aggiornato al termine del Garbage Collection, non dopo ogni singola allocazione. SURVIVE_FINALIZE_COUNTER_010_NAME=Rimanenti dopo la finalizzazione SURVIVE_FINALIZE_COUNTER_010_HELP=Questo contatore indica il numero degli oggetti esclusi dalla raccolta nel Garbage Collector perché in attesa di completamento. Se questi oggetti fanno riferimento ad altri oggetti, anche questi ultimi restano esclusi e non vengono conteggiati. I contatori "Memoria di completamento promossa dalla generazione 0" e "Memoria di completamento promossa dalla generazione 1" indicano tutta la memoria liberata a causa del completamento degli oggetti. Il contatore non è cumulativo e viene aggiornato al termine di ogni Garbage Collection, includendo solo gli oggetti esclusi in attesa di completamento durante quel particolare GC. Lo scopo di questo contatore è indicare l'ulteriore overhead a cui l'applicazione potrebbe essere sottoposta dall'operazione di completamento. NUM_HANDLES_COUNTER_010_NAME=Handle GC NUM_HANDLES_COUNTER_010_HELP=Questo contatore indica il numero degli handle GC attualmente in uso. Si tratta di handle di risorse esterne al CLR e all'ambiente gestito. Gli handle occupano una quantità limitata di memoria nell'heap GC, ma potrebbero richiedere un maggiore utilizzo di risorse non gestite. ALLOCATION_RATE_COUNTER_010_NAME=Byte allocati/sec ALLOCATION_RATE_COUNTER_010_HELP=Questo contatore indica il numero di byte allocati nell'heap GC nell'arco di un secondo. Viene aggiornato al termine di ogni Garbage Collection, non dopo ogni singola allocazione. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. INDUCED_GC_COUNTER_010_NAME=GC indotti INDUCED_GC_COUNTER_010_HELP=Questo contatore indica il numero massimo di raccolte nel Garbage Collector eseguite in seguito a una chiamata esplicita a GC.Collect. Si consiglia di lasciare al Garbage Collector il compito di regolare la frequenza delle raccolte. PER_TIME_IN_GC_COUNTER_010_NAME=Percentuale tempo in GC PER_TIME_IN_GC_COUNTER_010_HELP=Indica (in percentuale) il tempo trascorso durante l'esecuzione di un Garbage Collection (GC) a partire dall'ultimo ciclo GC. Può essere considerato come un indicatore del lavoro svolto dal Garbage Collector per conto dell'applicazione allo scopo di raccogliere e compattare la memoria. Il contatore viene aggiornato solo al termine di ogni Garbage Collection e il valore che indica rappresenta l'ultimo valore rilevato, non una media. PER_TIME_IN_GC_COUNTER_BASE_010_NAME=Non visualizzato PER_TIME_IN_GC_COUNTER_BASE_010_HELP=Non visualizzato. TOTAL_HEAP_SIZE_COUNTER_010_NAME=Byte in tutti gli heap TOTAL_HEAP_SIZE_COUNTER_010_HELP=Rappresenta la somma dei quattro contatori seguenti: Dimensione heap di generazione 0, Dimensione heap di generazione 1, Dimensione heap di generazione 2 e Dimensione heap oggetti grandi. Indica in byte la memoria corrente allocata negli heap GC. TOTAL_COMMITTED_MEM_COUNTER_010_NAME=Totale byte di cui è stato eseguito il commit TOTAL_COMMITTED_MEM_COUNTER_010_HELP=Questo contatore indica la quantità di memoria virtuale (in byte) di cui il Garbage Collector ha eseguito il commit (è la memoria fisica per la quale è stato riservato lo spazio nel file di paging del disco). TOTAL_RESERVED_MEM_COUNTER_010_NAME=Totale byte riservati TOTAL_RESERVED_MEM_COUNTER_010_HELP=Questo contatore indica la quantità di memoria virtuale (in byte) attualmente riservata dal Garbage Collector (è lo spazio di memoria virtuale riservato per l'applicazione, senza utilizzare il disco o pagine della memoria principale). GC_PINNED_OBJECTS_010_NAME=Oggetti bloccati GC_PINNED_OBJECTS_010_HELP=Questo contatore indica il numero degli oggetti bloccati incontrati durante l'ultimo Garbage Collection. Tiene conto dei soli oggetti bloccati contenuti negli heap raccolti nel Garbage Collector. Ad esempio, se avviene una raccolta di generazione 0, vengono enumerati solo gli oggetti bloccati contenuti nell'heap della generazione 0. Sono bloccati gli oggetti che il Garbage Collector non è in grado di spostare all'interno della memoria. GC_SINKBLOCKS_010_NAME=Blocchi Sink in uso GC_SINKBLOCKS_010_HELP=Questo contatore indica il numero dei blocchi Sync attualmente in uso. I blocchi Sync sono strutture di dati progetto, allocate per memorizzare le informazioni di sincronizzazione. Contengono riferimenti deboli a oggetti gestiti e devono essere esaminati dal Garbage Collector. Oltre a contenere le informazioni di sincronizzazione, i blocchi Sync possono contenere anche i metadati per l'interoperabilità COM. Lo scopo di questo contatore è indicare i problemi di prestazioni legati all'uso intensivo delle primitive di sincronizzazione. DotNetCLR_Loading_OBJECT_010_NAME=Caricamento CLR .NET DotNetCLR_Loading_OBJECT_010_HELP=Statistiche del caricatore di classe CLR. LOADING_CLASSES_TOTAL_010_NAME=Totale classi caricate LOADING_CLASSES_TOTAL_010_HELP=Questo contatore indica il numero complessivo delle classi caricate in tutti gli assembly dall'avvio dell'applicazione. LOADING_TIME_010_NAME=Percentuale tempo di caricamento LOADING_TIME_010_HELP=Riservato per utilizzi futuri. LOADING_ASMSEARCHLEN_010_NAME=Lunghezza ricerca assembly LOADING_ASMSEARCHLEN_010_HELP=Riservato per utilizzi futuri. LOADING_LOADFAILURES_TOTAL_010_NAME=Totale errori di caricamento LOADING_LOADFAILURES_TOTAL_010_HELP=Questo contatore indica il numero massimo delle classi che non è stato possibile caricare dall'avvio dell'applicazione. Gli errori di caricamento possono avere varie cause, dal livello di sicurezza inadeguato al formato non valido. Per ulteriori dettagli, vedere la Guida dei servizi di profilo. LOADING_LOADFAILURES_INST_010_NAME=Percentuale errori di caricamento LOADING_LOADFAILURES_INST_010_HELP=Questo contatore indica il numero delle classi non caricate nell'arco di un secondo. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. Gli errori di caricamento possono avere varie cause, dal livello di sicurezza inadeguato al formato non valido. Per ulteriori dettagli, vedere la Guida dei servizi di profilo. LOADING_HEAPSIZE_010_NAME=Byte nell'heap del caricatore LOADING_HEAPSIZE_010_HELP=Questo contatore indica la quantità di memoria (in byte) di cui il caricatore di classe ha eseguito il commit per tutti i domini applicazioni (è la memoria fisica per la quale è stato riservato lo spazio nel file di paging del disco). LOADING_APPDOMAINS_UNLOADED_TOTAL_010_NAME=Totale domini applicazioni scaricati LOADING_APPDOMAINS_UNLOADED_TOTAL_010_HELP=Questo contatore indica il numero complessivo dei domini applicazioni scaricati dall'avvio dell'applicazione. Se uno stesso dominio applicazione viene caricato e scaricato più volte, ogni scaricamento viene conteggiato come operazione a sé stante. LOADING_APPDOMAINS_UNLOADED_INST_010_NAME=Percentuale domini applicazioni scaricati LOADING_APPDOMAINS_UNLOADED_INST_010_HELP=Questo contatore indica il numero dei domini applicazioni scaricati nell'arco di un secondo. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. LOADING_CLASSES_CUR_010_NAME=Classi attualmente caricate LOADING_CLASSES_CUR_010_HELP=Questo contatore indica il numero delle classi attualmente caricate in tutti gli assembly. LOADING_CLASSES_INST_010_NAME=Percentuale classi caricate LOADING_CLASSES_INST_010_HELP=Questo contatore indica il numero delle classi caricate in tutti gli assembly nell'arco di un secondo. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. LOADING_APPDOMAINS_CUR_010_NAME=Domini applicazioni attuali LOADING_APPDOMAINS_CUR_010_HELP=Questo contatore indica il numero dei domini applicazioni attualmente caricati nell'applicazione. I domini applicazioni costituiscono un'unità di elaborazione protetta e versatile che può essere utilizzata dal CLR per garantire l'isolamento delle applicazioni in esecuzione nello stesso processo. LOADING_APPDOMAINS_TOTAL_010_NAME=Totale domini applicazioni LOADING_APPDOMAINS_TOTAL_010_HELP=Questo contatore indica il numero massimo dei domini applicazioni caricati dall'avvio di questa applicazione. I domini applicazioni costituiscono un'unità di elaborazione protetta e versatile che può essere utilizzata dal CLR per garantire l'isolamento delle applicazioni in esecuzione nello stesso processo. LOADING_APPDOMAINS_INST_010_NAME=Percentuale domini applicazioni LOADING_APPDOMAINS_INST_010_HELP=Questo contatore indica il numero dei domini applicazioni caricati nell'arco di un secondo. I domini applicazioni costituiscono un'unità di elaborazione protetta e versatile che può essere utilizzata dal CLR per garantire l'isolamento delle applicazioni in esecuzione nello stesso processo. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. LOADING_ASSEMBLIES_CUR_010_NAME=Assembly attuali LOADING_ASSEMBLIES_CUR_010_HELP=Questo contatore indica il numero degli assembly attualmente caricati in tutti i domini applicazioni di questa applicazione. Se un assembly viene caricato da più domini applicazioni come modulo indipendente dal dominio, il contatore viene incrementato una sola volta. Gli assembly possono essere caricati come moduli indipendenti dal dominio, se contengono codice che può essere condiviso da tutti i domini applicazioni, oppure come moduli specifici di un dominio, se contengono codice privato di un determinato dominio applicazione. LOADING_ASSEMBLIES_TOTAL_010_NAME=Totale assembly LOADING_ASSEMBLIES_TOTAL_010_HELP=Questo contatore indica il numero complessivo degli assembly caricati dall'avvio dell'applicazione. Se un assembly viene caricato da più domini applicazioni come modulo indipendente dal dominio, il contatore viene incrementato una sola volta. Gli assembly possono essere caricati come moduli indipendenti dal dominio, se contengono codice che può essere condiviso da tutti i domini applicazioni, oppure come moduli specifici di un dominio, se contengono codice privato di un determinato dominio applicazione. LOADING_ASSEMBLIES_INST_010_NAME=Percentuale assembly LOADING_ASSEMBLIES_INST_010_HELP=Questo contatore indica il numero degli assembly caricati in tutti i domini applicazioni nell'arco di un secondo. Se un assembly viene caricato da più domini come modulo indipendente dal dominio, il contatore viene incrementato una sola volta. Gli assembly possono essere caricati come moduli indipendenti dal dominio, se contengono codice che può essere condiviso da tutti i domini applicazioni, oppure come moduli specifici di un dominio, se contengono codice privato di un determinato dominio applicazione. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. DotNetCLR_Jit_OBJECT_010_NAME=JIT CLR .NET DotNetCLR_Jit_OBJECT_010_HELP=Statistiche del JIT CLR. TOTAL_METHODS_JITTED_010_NAME=Metodi compilati Just-In-Time TOTAL_METHODS_JITTED_010_HELP=Questo contatore indica il numero dei metodi compilati dal compilatore Just-In-Time (JIT) CLR, a partire dall'avvio dell'applicazione. I metodi compilati PreJit non vengono inclusi nel conteggio. JITTED_IL_CUR_010_NAME=Byte IL compilati Just-In-Time JITTED_IL_CUR_010_HELP=Questo contatore indica il numero dei byte IL compilati dal compilatore Just-In-Time (JIT), a partire dall'avvio dell'applicazione. Equivale esattamente al contatore "Totale byte IL compilati Just-In-Time". JITTED_IL_TOTAL_010_NAME=Totale byte IL compilati Just-In-Time JITTED_IL_TOTAL_010_HELP=Questo contatore indica il numero dei byte IL compilati dal compilatore Just-In-Time (JIT), a partire dall'avvio dell'applicazione. Equivale esattamente al contatore "Byte IL compilati Just-In-Time". JITTED_IL_INST_010_NAME=Byte IL compilati Just-In-Time/sec JITTED_IL_INST_010_HELP=Questo contatore indica il numero dei byte IL compilati Just-In-Time nell'arco di un secondo. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. JIT_FAILURES_010_NAME=Errori JIT standard JIT_FAILURES_010_HELP=Questo contatore indica il numero massimo dei metodi che il compilatore JIT non è riuscito a compilare, a partire dall'avvio dell'applicazione. Questo problema si verifica se non è possibile controllare l'IL o in seguito a un errore interno del compilatore JIT. TIME_IN_JIT_010_NAME=Percentuale tempo in JIT TIME_IN_JIT_010_HELP=Questo contatore indica (in percentuale) il tempo trascorso in compilazione JIT dall'ultima fase di compilazione JIT. Questo contatore viene aggiornato al termine di ogni fase di compilazione JIT. Una fase di compilazione JIT corrisponde al tempo di compilazione di un metodo e delle relative dipendenze. TIME_IN_JIT_BASE_010_NAME=Non visualizzato TIME_IN_JIT_BASE_010_HELP=Non visualizzato. DotNetCLR_Interop_OBJECT_010_NAME=Interoperabilità CLR .NET DotNetCLR_Interop_OBJECT_010_HELP=Statistiche dell'interoperabilità CLR. CURRENT_CCW_010_NAME=CCW CURRENT_CCW_010_HELP=Questo contatore indica il numero di CCW (COM-Callable-Wrappers) attuale. I CCW sono proxy per oggetti gestiti .NET a cui viene fatto riferimento da client COM non gestiti. Ha lo scopo di indicare il numero degli oggetti gestiti a cui viene fatto riferimento da codice COM non gestito. CURRENT_STUBS_010_NAME=Stub CURRENT_STUBS_010_HELP=Questo contatore indica il numero attuale degli stub creati dal CLR. Durante le chiamate all'interoperabilità COM o PInvoke, gli stub sono responsabili del marshalling degli argomenti e dei valori restituiti fra il codice gestito e quello non gestito e viceversa. NUM_MARSHALLING_010_NAME=Marshalling NUM_MARSHALLING_010_HELP=Questo contatore indica il numero complessivo delle volte in cui argomenti e valori restituiti sono stati sottoposti a marshalling dal codice gestito a quello non gestito e viceversa, a partire dall'avvio dell'applicazione. Se gli stub vengono resi inline, il contatore non viene incrementato. Gli stub sono responsabili del marshalling di argomenti e valori restituiti e vengono resi inline in genere quando l'overhead di marshalling è limitato. TOTAL_TLB_IMPORTS_010_NAME=Importazioni TLB/sec TOTAL_TLB_IMPORTS_010_HELP=Riservato per utilizzi futuri. TOTAL_TLB_EXPORTS_010_NAME=Esportazioni TLB/sec TOTAL_TLB_EXPORTS_010_HELP=Riservato per utilizzi futuri. DotNetCLR_LocksAndThreads_OBJECT_010_NAME=LocksAndThreads CLR .NET DotNetCLR_LocksAndThreads_OBJECT_010_HELP=Statistiche riguardanti i blocchi e i thread CLR. CONTENTION_TOTAL_010_NAME=Totale conflitti CONTENTION_TOTAL_010_HELP=Questo contatore indica il numero complessivo delle volte in cui i thread del CLR hanno tentato, senza riuscirvi, di acquisire blocchi gestiti. I blocchi gestiti possono essere acquisiti in vari modi: mediante l'istruzione "lock", in C#, oppure chiamando System.Monitor.Enter o utilizzando l'attributo personalizzato MethodImplOptions.Synchronized. CONTENTION_INST_010_NAME=Conflitti/sec CONTENTION_INST_010_HELP=Frequenza con la quale i thread del runtime tentano di acquisire, senza riuscirvi, un blocco gestito. I blocchi gestiti possono essere acquisiti in vari modi: mediante l'istruzione "lock", in C#, oppure chiamando System.Monitor.Enter o utilizzando l'attributo personalizzato MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_010_NAME=Lunghezza attuale coda QUEUE_LENGTH_CUR_010_HELP=Questo contatore indica il numero complessivo dei thread attualmente in attesa di acquisire un blocco gestito nell'applicazione. Il contatore non rappresenta una media rispetto al tempo, ma indica l'ultimo valore rilevato. QUEUE_LENGTH_TOTAL_010_NAME=Lunghezza massima coda QUEUE_LENGTH_TOTAL_010_HELP=Questo contatore indica il numero complessivo dei thread che sono rimasti in attesa di acquisire un blocco gestito, a partire dall'avvio dell'applicazione. QUEUE_LENGTH_INST_010_NAME=Lunghezza coda/sec QUEUE_LENGTH_INST_010_HELP=Questo contatore indica il numero dei thread al secondo in attesa di acquisire un blocco dell'applicazione. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. CURRENT_LOGICAL_THREADS_010_NAME=Thread logici attuali CURRENT_LOGICAL_THREADS_010_HELP=Questo contatore indica il numero degli oggetti thread .NET attualmente presenti nell'applicazione. Gli oggetti thread .NET vengono creati mediante nuovi System.Threading.Thread oppure quando un thread non gestito entra nell'ambiente gestito. Questo contatore mantiene il conteggio sia dei thread in esecuzione che di quelli interrotti. Non rappresenta una media rispetto al tempo, ma indica semplicemente l'ultimo valore rilevato. CURRENT_PHYSICAL_THREADS_010_NAME=Thread fisici attuali CURRENT_PHYSICAL_THREADS_010_HELP=Questo contatore indica il numero dei thread nativi del sistema operativo, creati dal CLR e di sua proprietà, che agiscono da thread sottostanti per gli oggetti thread .NET. Nel conteggio non vengono inclusi i thread utilizzati dal CLR nelle sue operazioni interne. È un sottoinsieme dei thread del processo del sistema operativo. RECOGNIZED_THREADS_CUR_010_NAME=Thread riconosciuti attuali RECOGNIZED_THREADS_CUR_010_HELP=Questo contatore indica il numero dei thread attualmente riconosciuti dal CLR, ai quali è associato un oggetto thread .NET. Questi thread non vengono creati dal CLR, ma al suo esterno, e sono stati eseguiti nel CLR almeno una volta. Vengono presi in considerazione solo i thread univoci. I thread che rientrano nel CLR o ricreati dopo l'uscita, senza cambiare ID, vengono conteggiati una volta sola. RECOGNIZED_THREADS_TOTAL_010_NAME=Totale thread riconosciuti RECOGNIZED_THREADS_TOTAL_010_HELP=Questo contatore indica il numero complessivo dei thread riconosciuti dal CLR dall'avvio dell'applicazione. A questi thread sono associati altrettanti oggetti thread .NET. Questi thread non vengono creati dal CLR, ma al suo esterno, e sono stati eseguiti nel CLR almeno una volta. Vengono presi in considerazione solo i thread univoci. I thread che rientrano nel CLR o ricreati dopo l'uscita, senza cambiare ID, vengono conteggiati una volta sola. RECOGNIZED_THREADS_INST_010_NAME=Thread riconosciuti/sec RECOGNIZED_THREADS_INST_010_HELP=Questo contatore indica il numero dei thread riconosciuti dal CLR nell'arco di un secondo. A questi thread sono associati altrettanti oggetti thread .NET. Questi thread non vengono creati dal CLR, ma al suo esterno, e sono stati eseguiti nel CLR almeno una volta. Vengono presi in considerazione solo i thread univoci. I thread che rientrano nel CLR o ricreati dopo l'uscita, senza cambiare ID, vengono conteggiati una volta sola. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. DotNetCLR_Security_OBJECT_010_NAME=Protezione CLR .NET DotNetCLR_Security_OBJECT_010_HELP=Statistiche sulla sicurezza CLR. SECURITY_TOTALRTCHECKS_010_NAME=Totale controlli runtime SECURITY_TOTALRTCHECKS_010_HELP=Questo contatore indica il numero complessivo dei controlli runtime di sicurezza dall'accesso di codice (CAS, Code Access Security) eseguiti dall'avvio dell'applicazione. I controlli runtime CAS vengono eseguiti quando un chiamante effettua una chiamata a un destinatario che richiede una particolare autorizzazione. Il controllo runtime viene eseguito su tutte le chiamate effettuate dal chiamante, esaminandone lo stack dei thread attuali. Insieme con "Profondità stack", questo contatore è un indicatore del calo di prestazioni dovuto ai controlli di sicurezza. SECURITY_TIMEAUTHORIZE_010_NAME=Percentuale tempo impiegato per l'autenticazione del segnale SECURITY_TIMEAUTHORIZE_010_HELP=Riservato per utilizzi futuri. SECURITY_LINKCHECKS_010_NAME=Controlli Linktime SECURITY_LINKCHECKS_010_HELP=Questo contatore indica il numero complessivo dei controlli di sicurezza dall'accesso di codice (CAS, Code Access Security) di tipo Linktime eseguiti dall'avvio dell'applicazione. I controlli CAS di tipo Linktime vengono eseguiti quando un chiamante effettua una chiamata a un destinatario che richiede una particolare autorizzazione durante la compilazione JIT. I controlli Linktime vengono eseguiti una volta per chiamante. Questo contatore non viene usato per segnalare gravi problemi di prestazioni, ma è un indicatore dell'attività del sistema di sicurezza. SECURITY_TIMERTCHECKS_010_NAME=Percentuale tempo impiegato in controlli runtime SECURITY_TIMERTCHECKS_010_HELP=Questo contatore indica (in percentuale) il tempo trascorso nell'esecuzione di controlli runtime di sicurezza dall'accesso di codice (CAS, Code Access Security), dopo l'ultimo controllo. La sicurezza dall'accesso di codice supporta vari livelli di attendibilità del codice, la cui applicazione dipende dall'identità del codice stesso. Questo contatore viene aggiornato al termine del controllo runtime di sicurezza e rappresenta l'ultimo valore rilevato, non una media. SECURITY_TIMERTCHECKS_BASE_010_NAME=Non visualizzato SECURITY_TIMERTCHECKS_BASE_010_HELP=Non visualizzato. SECURITY_DEPTHSECURITY_010_NAME=Profondità stack SECURITY_DEPTHSECURITY_010_HELP=Questo contatore indica la profondità dello stack durante l'ultimo controllo runtime di sicurezza dall'accesso di codice (CAS, Code Access Security). Il controllo viene eseguito effettuando il crawling dello stack. Il contatore non rappresenta una media, ma indica semplicemente l'ultimo valore rilevato. DotNetCLR_Remoting_OBJECT_010_NAME=Servizi remoti CLR .NET DotNetCLR_Remoting_OBJECT_010_HELP=Statistiche relative ai servizi remoti di CLR .NET. CONTEXT_REMOTECALLS_INST_010_NAME=Chiamate remote/sec CONTEXT_REMOTECALLS_INST_010_HELP=Questo contatore indica il numero delle chiamate a procedura remota eseguite nell'arco di un secondo. Una chiamata a procedura remota è una chiamata a un oggetto situato al di fuori del dominio applicazione del chiamante. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. CONTEXT_CHANNELS_010_NAME=Canali CONTEXT_CHANNELS_010_HELP=Questo contatore indica il numero complessivo dei canali remoti registrati in tutti i domini applicazioni dall'avvio dell'applicazione. I canali vengono utilizzati per trasportare messaggi da e verso gli oggetti remoti. CONTEXT_PROXIES_010_NAME=Proxy di contesto CONTEXT_PROXIES_010_HELP=Questo contatore indica il numero complessivo degli oggetti proxy remoti creati nel processo a partire dal suo avvio. Gli oggetti proxy costituiscono una rappresentazione degli oggetti remoti e assicurano che tutte le chiamate ai singoli proxy vengano inoltrate all'istanza corretta dell'oggetto remoto. CONTEXT_CLASSES_010_NAME=Classi legate al contesto caricate CONTEXT_CLASSES_010_HELP=Questo contatore indica il numero delle classi legate al contesto attualmente caricate. Sono classi legate al contesto le classi che possono essere associate a un contesto specifico. Queste classi sono contrassegnate con gli attributi di contesto, che definiscono le regole riguardanti la sincronizzazione, l'affinità di thread, le transazioni e così via. CONTEXT_OBJALLOC_010_NAME=Oggetti legati al contesto allocati/sec CONTEXT_OBJALLOC_010_HELP=Questo contatore indica il numero degli oggetti legati al contesto allocati nell'arco di un secondo. Sono oggetti legati al contesto le istanze delle classi che possono essere associate a contesti specifici. Queste classi sono contrassegnate con attributi di contesto che definiscono le regole riguardanti la sincronizzazione, l'affinità di thread, le transazioni e così via. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. CONTEXT_CONTEXTS_010_NAME=Contesti CONTEXT_CONTEXTS_010_HELP=Questo contatore indica il numero corrente dei contesti remoti dell'applicazione. Un contesto è un insieme di oggetti con le stesse regole di sincronizzazione, affinità di thread, transazioni e così via. CONTEXT_REMOTECALLS_TOTAL_010_NAME=Chiamate remote complessive CONTEXT_REMOTECALLS_TOTAL_010_HELP=Questo contatore indica il numero complessivo delle chiamate a procedura remota dall'avvio dell'applicazione. Una chiamata a procedura remota è una chiamata a un oggetto situato al di fuori del dominio applicazione del chiamante. DotNetCLR_Excep_OBJECT_010_NAME=Eccezioni CLR .NET DotNetCLR_Excep_OBJECT_010_HELP=Statistiche runtime sulla gestione delle eccezioni CLR. EXCEP_THROWN_TOTAL_010_NAME=Eccezioni EXCEP_THROWN_TOTAL_010_HELP=Questo contatore indica il numero complessivo delle eccezioni generate dall'avvio dell'applicazione. Vengono prese in considerazione sia le eccezioni .NET, sia le eccezioni non gestite convertite in eccezioni .NET (ad esempio, un'eccezione dovuta a un riferimento a un puntatore nullo nel codice non gestito, nel codice gestito viene nuovamente generata come System.NullReferenceException .NET). Vengono conteggiate sia le eccezioni gestite, sia quelle non gestite. Quelle nuovamente generate vengono conteggiate una seconda volta. Le eccezioni dovrebbero presentarsi di rado, poiché non fanno parte del flusso normale del programma. EXCEP_THROWN_INST_010_NAME=Eccezioni/sec EXCEP_THROWN_INST_010_HELP=Questo contatore indica il numero delle eccezioni generate nell'arco di un secondo. Vengono prese in considerazione sia le eccezioni .NET, sia le eccezioni non gestite convertite in eccezioni .NET (ad esempio, un'eccezione dovuta a un riferimento a un puntatore nullo nel codice non gestito, nel codice gestito viene nuovamente generata come System.NullReferenceException .NET). Vengono conteggiate sia le eccezioni gestite, sia quelle non gestite. Le eccezioni dovrebbero presentarsi di rado, poiché non fanno parte del flusso normale del programma. Il contatore è un indicatore dei potenziali problemi di prestazioni dovuti a una frequenza elevata delle eccezioni (superiore alle 100 eccezioni al secondo). Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. TOTAL_EXCEP_FILTERS_RUN_010_NAME=Filtri/sec TOTAL_EXCEP_FILTERS_RUN_010_HELP=Questo contatore indica il numero dei filtri eccezioni .NET eseguiti nell'arco di un secondo. I filtri eccezioni stabiliscono se le varie eccezioni debbano essere gestite oppure no. Il contatore riporta la frequenza con cui vengono valutati questi filtri, indipendentemente dal fatto che le eccezioni vengano gestite oppure no. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. TOTAL_EXCEP_FINALLYS_RUN_010_NAME=Blocchi finally/sec TOTAL_EXCEP_FINALLYS_RUN_010_HELP=Questo contatore indica il numero dei blocchi finally eseguiti nell'arco di un secondo. I blocchi finally vengono eseguiti indipendentemente dall'esito dei rispettivi blocchi try. Vengono conteggiati solo i blocchi finally eseguiti per le eccezioni, mentre i blocchi finally incontrati nel percorso normale del codice vengono ignorati dal contatore. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. EXCEPT_STACK_DEPTH_010_NAME=Frame da generato a gestito/sec EXCEPT_STACK_DEPTH_010_HELP=Questo contatore indica il numero di frame dello stack attraversati in un secondo, a partire dal frame che ha generato l'eccezione .NET per raggiungere il frame che ha gestito l'eccezione. Poiché il contatore viene azzerato all'ingresso in un gestore di eccezioni, per le eccezioni annidate mostra la profondità dello stack da gestore a gestore. Il contatore non rappresenta una media rispetto al tempo, ma viene ottenuto calcolando la differenza fra i valori degli ultimi due campioni e dividendo il risultato per la durata dell'intervallo di campionamento. DotNetCLR_Memory_OBJECT_011_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_011_HELP=CLR ¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0 Ò0ü0×0n0«0¦0ó0¿0ü0g0Y00 GEN0_COLLECTIONS_COUNTER_011_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0¸0§0Í0ì0ü0·0ç0ó0 0 ª0Ö0¸0§0¯0È0 (g°en0rRŠ0S_f0g0Nju°eW0D0) L00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0 (Gen 0 GC) U0Œ0_0ÞVpe’0hˆ:yW0~0Y00Gen 0 GC o00¸0§0Í0ì0ü0·0ç0ó0 0 n0)R(uïSý€j0á0â0ê0L00rRŠ0S_f0‰Bl’0ASR€n_0[0j0D0h0M0k0zvuW0~0Y00S0n0«0¦0ó0¿0ü0o0 Gen 0 GC n0gŒ_k0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00°eW0D0¸0§0Í0ì0ü0·0ç0ó0n0 GC o0äSD0¸0§0Í0ì0ü0·0ç0ó0n0 GC ’0Y0y0f0+T0~0Y00S0n0«0¦0ó0¿0ü0o00°eW0D0¸0§0Í0ì0ü0·0ç0ó0 (Gen 1 ~0_0o0 Gen 2) n0 GC L0zvuY0‹0h0M0k0f:y„vk0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00_Global_ counter n0$Po0ckºxg0o0j0D0n0g0!q–‰Y0‹0y0M0g0Y00S0n0«0¦0ó0¿0ü0o0g°en0$P’0hˆ:yW0~0Y00 GEN1_COLLECTIONS_COUNTER_011_NAME=# Gen 1 Collections GEN1_COLLECTIONS_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0¸0§0Í0ì0ü0·0ç0ó0 1 ª0Ö0¸0§0¯0È0L00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0U0Œ0_0ÞVpe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0 Gen 1 GC n0gŒ_k0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00°eW0D0¸0§0Í0ì0ü0·0ç0ó0n0 GC o0äSD0¸0§0Í0ì0ü0·0ç0ó0n0 GC ’0Y0y0f0+T0~0Y00S0n0«0¦0ó0¿0ü0o00°eW0D0¸0§0Í0ì0ü0·0ç0ó0 (Gen 2) n0 GC L0zvuY0‹0h0M0k0f:y„vk0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00_Global_ counter n0$Po0ckºxg0o0j0D0n0g0!q–‰Y0‹0y0M0g0Y00S0n0«0¦0ó0¿0ü0o0g°en0$P’0hˆ:yW0~0Y00 GEN2_COLLECTIONS_COUNTER_011_NAME=# Gen 2 Collections GEN2_COLLECTIONS_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0¸0§0Í0ì0ü0·0ç0ó0 2 ª0Ö0¸0§0¯0È0 (ˆ0Š0äSD0) L00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0U0Œ0_0ÞVpe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0 Gen 2 GC n0gŒ_k0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y0 (Õ0ë0 GC h0‚0|Tp0Œ0~0Y0)0_Global_ counter n0$Po0ckºxg0o0j0D0n0g0!q–‰Y0‹0y0M0g0Y00S0n0«0¦0ó0¿0ü0o0gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00 GEN0_BYTES_PROMOTED_COUNTER_011_NAME=Promoted Memory from Gen 0 GEN0_BYTES_PROMOTED_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0 (GC) ’0€H0œbD0f00¸0§0Í0ì0ü0·0ç0ó0 0 K0‰0¸0§0Í0ì0ü0·0ç0ó0 1 k0 NMO YÛcW0_0á0â0ê0n0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0k0o00XSk0Œ[†NY0‹0n0’0…_d0_00`0Q0k0 NMO YÛcW0_0ª0Ö0¸0§0¯0È0o0+T0~0[0“00S0n0«0¦0ó0¿0ü0o00gŒ_n0 GC n0gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00S0Œ0o0/}Mz«0¦0ó0¿0ü0g0o0B0Š0~0[0“00 GEN1_BYTES_PROMOTED_COUNTER_011_NAME=Promoted Memory from Gen 1 GEN1_BYTES_PROMOTED_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0 (GC) ’0€H0œbD0f00¸0§0Í0ì0ü0·0ç0ó0 1 K0‰0¸0§0Í0ì0ü0·0ç0ó0 2 k0 NMO YÛcW0_0á0â0ê0n0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00XSk0Œ[†NY0‹0n0’0…_d0_00`0Q0k0 NMO YÛcW0_0ª0Ö0¸0§0¯0È0o0+T0~0[0“00S0n0«0¦0ó0¿0ü0o0gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00S0Œ0o0/}Mz«0¦0ó0¿0ü0g0o0B0Š0~0[0“00S0n0«0¦0ó0¿0ü0o00gŒ_n0 GC L0 Gen 0 GC n00n04XTo000 k0ê0»0Ã0È0U0Œ0~0Y00 GEN0_PROMOTION_RATE_011_NAME=Gen 0 Promoted Bytes/Sec GEN0_PROMOTION_RATE_011_HELP=S0n0«0¦0ó0¿0ü0o00¸0§0Í0ì0ü0·0ç0ó0 0 (Nju°eW0D0) K0‰0¸0§0Í0ì0ü0·0ç0ó0 1 k0 NMO YÛcW0_0á0â0ê0n0ÎkÒyn0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00XSk0Œ[†NY0‹0n0’0…_d0_00`0Q0k0 NMO YÛcW0_0ª0Ö0¸0§0¯0È0o0+T0~0[0“00á0â0ê0o00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0’0€H0œbO0h0 NMO YÛcW0~0Y00S0n0«0¦0ó0¿0ü0o00ÎkÒy\ObU0Œ0‹0Ôk„vk0w•š}M0Y0‹0ª0Ö0¸0§0¯0È0k0¢•Y0‹0¤0ó0Ç0£0±0ü0¿0h0W0f0Ç0¶0¤0ó0U0Œ0~0W0_00S0n0«0¦0ó0¿0ü0o00µ0ó0×0ë0n0Bf“•“•”–g0RQ0‰0Œ0_00gŒ_n0 2 d0 n0µ0ó0×0ë0“•g0³‰ß[U0Œ0_0$Pn0UD0hˆ:yW0~0Y00 GEN1_PROMOTION_RATE_011_NAME=Gen 1 Promoted Bytes/Sec GEN1_PROMOTION_RATE_011_HELP=S0n0«0¦0ó0¿0ü0o00¸0§0Í0ì0ü0·0ç0ó0 1 K0‰0¸0§0Í0ì0ü0·0ç0ó0 2 (NjuäSD0) k02“0`0á0â0ê0n0ÎkÒyn0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00XSk0Œ[†NY0‹0n0’0…_d0_00`0Q0k0 NMO YÛcW0_0ª0Ö0¸0§0¯0È0o0+T0~0[0“00á0â0ê0o00¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0’0€H0œbO0h0 NMO YÛcW0~0Y00¸0§0Í0ì0ü0·0ç0ó0 2 o0NjuäSD0_000S0n0!ko0B0Š0~0[0“00S0n0«0¦0ó0¿0ü0o00ÎkÒy\ObU0Œ0‹0^—8^k0w•š}M0Y0‹0ª0Ö0¸0§0¯0È0k0¢•Y0‹0¤0ó0Ç0£0±0ü0¿0h0W0f0Ç0¶0¤0ó0U0Œ0~0W0_00S0n0«0¦0ó0¿0ü0o00µ0ó0×0ë0n0Bf“•“•”–g0RQ0‰0Œ0_00gŒ_n0 2 d0 n0µ0ó0×0ë0“•g0³‰ß[U0Œ0_0$Pn0UD0hˆ:yW0~0Y00 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_011_NAME=Promoted Finalization-Memory from Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00XSk0Œ[†NY0‹0n0’0…_d0_00`0Q0k0¸0§0Í0ì0ü0·0ç0ó0 0 K0‰0¸0§0Í0ì0ü0·0ç0ó0 1 k0 NMO YÛcW0_0á0â0ê0n0ÎkÒyn0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00gŒ_n0 GC n0gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00S0Œ0o0/}Mz«0¦0ó0¿0ü0g0o0B0Š0~0[0“00 PROCESS_ID_011_NAME=Process ID PROCESS_ID_011_HELP=S0n0«0¦0ó0¿0ü0o00ãv–‰þ[aŒg0B0‹0 CLR ×0í0»0¹0 ¤0ó0¹0¿0ó0¹0n0×0í0»0¹0 ID ’0hˆ:yW0~0Y00hˆ:yU0Œ0‹0$Po00gRn0¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0L0B}†NY0‹0~0g0 0 g0Y00 GEN0_HEAP_SIZE_COUNTER_011_NAME=Gen 0 heap size GEN0_HEAP_SIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¸0§0Í0ì0ü0·0ç0ó0 0 (Gen 0) k0rRŠ0S_f0‰0Œ0‹0g'Yn0Ð0¤0È0pe’0hˆ:yW0~0Y00¸0§0Í0ì0ü0·0ç0ó0 0 k0rRŠ0S_f0‰0Œ0_0þs(Wn0Ð0¤0È0peo0:yW0~0[0“00Gen 0 GC o00gŒ_n0 GC åNeg0rRŠ0S_f0L0S0n0µ0¤0º0’0…H0‹0h0zvuW0~0Y00Gen 0 µ0¤0º0o0¬0Ù0ü0¸0 ³0ì0¯0¿0ü0k0ˆ0c0f0¿ŠteU0Œ00¢0×0ê0±0ü0·0ç0ó0n0Ÿ[Lˆ-Nk0 YôfW0~0Y00Gen 0 ³0ì0¯0·0ç0ó0n0gŒ_k0 Gen 0 Ò0ü0×0n0µ0¤0º0o0Ÿ[›–k0 0 Ð0¤0È0g0Y00S0n0«0¦0ó0¿0ü0o00!kn0 Gen 0 GC ’0zvuU0[0‹0rRŠ0S_f0n0µ0¤0º0’0Ð0¤0È0g0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0 GC n0gŒ_k0ôf°eU0Œ0~0Y00rRŠ0S_f0T0h0k0o0ôf°eU0Œ0~0[0“00 GEN1_HEAP_SIZE_COUNTER_011_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¸0§0Í0ì0ü0·0ç0ó0 1 (Gen 1) n0þs(Wn0Ð0¤0È0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0g0o0 Gen 1 n0g'Yµ0¤0º0’0hˆ:yW0~0[0“00ª0Ö0¸0§0¯0È0o0S0n0¸0§0Í0ì0ü0·0ç0ó0g0o0ôv¥crRŠ0S_f0‰0Œ0~0[0“00ª0Ö0¸0§0¯0È0o0MRn0 Gen 0 GC K0‰0 NMO YÛcU0Œ0~0Y00S0n0«0¦0ó0¿0ü0o0 GC n0gŒ_k0ôf°eU0Œ0~0Y00rRŠ0S_f0T0h0k0o0ôf°eU0Œ0~0[0“00 GEN2_HEAP_SIZE_COUNTER_011_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00¸0§0Í0ì0ü0·0ç0ó0 2 (Gen 2) n0þs(Wn0Ð0¤0È0pe’0hˆ:yW0~0Y00ª0Ö0¸0§0¯0È0o0S0n0¸0§0Í0ì0ü0·0ç0ó0g0o0ôv¥crRŠ0S_f0‰0Œ0~0[0“00ª0Ö0¸0§0¯0È0o0MRn0 Gen 1 GC -Nk0 Gen 1 K0‰0 NMO YÛcU0Œ0~0Y00S0n0«0¦0ó0¿0ü0o0 GC n0gŒ_k0ôf°eU0Œ0~0Y00rRŠ0S_f0T0h0k0o0ôf°eU0Œ0~0[0“00 LARGE_OBJECT_SIZE_COUNTER_011_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00'YM0D0ª0Ö0¸0§0¯0È0n0Ò0ü0×0n0þs(Wn0µ0¤0º0’0Ð0¤0È0peg0hˆ:yW0~0Y00W0M0D0$Pˆ0Š0'YM0D0ª0Ö0¸0§0¯0È0o00¬0Ù0ü0¸0 ³0ì0¯0¿0ü0k0ˆ0c0f0'YM0D0ª0Ö0¸0§0¯0È0h0W0f0qb0Œ00yr%Rj0Ò0ü0×0k0ôv¥crRŠ0S_f0‰0Œ0~0Y00S0Œ0‰0o0!kn0¸0§0Í0ì0ü0·0ç0ó0k0 NMO YÛcU0Œ0~0[0“00CLR v1.1 åN Ng0o00S0n0W0M0D0$Po0 85000 Ð0¤0È0k0j0Š0~0Y00S0n0«0¦0ó0¿0ü0o0 GC n0gŒ_k0ôf°eU0Œ00rRŠ0S_f0T0h0k0o0ôf°eU0Œ0~0[0“00 SURVIVE_FINALIZE_COUNTER_011_NAME=Finalization Survivors SURVIVE_FINALIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00Œ[†NY0‹0n0’0…_d0_00k00¬0Ù0ü0¸0 ³0ì0¯0È0’0€H0œbD0f0³0ì0¯0È0U0Œ0_0ª0Ö0¸0§0¯0È0n0pe’0hˆ:yW0~0Y00S0Œ0‰0n0ª0Ö0¸0§0¯0È0L0ÖNn0ª0Ö0¸0§0¯0È0x0n0ÂSgq’0cc0f0D0‹0j0‰0p00]0Œ0‰0n0ª0Ö0¸0§0¯0È0‚0 TØik0€H0œbM0~0Y0L00S0n0«0¦0ó0¿0ü0g0o0«0¦0ó0È0U0Œ0~0[0“00"Promoted Finalization-Memory from Gen 0" J0ˆ0s0 "Promoted Finalization-Memory from Gen 1" «0¦0ó0¿0ü0o00Œ[†NY0‹0_00k0€H0l0D0_0Y0y0f0á0â0ê0’0hˆW0~0Y00S0n0«0¦0ó0¿0ü0o0/}Mz«0¦0ó0¿0ü0g0o0B0Š0~0[0“00S0n0«0¦0ó0¿0ü0o00S0n0yrš[n0 GC “•k0uM0‹kc0_0«0¦0ó0È0pe`0Q0’0Oc0f0 GC n0gŒ_k0ôf°eU0Œ0~0Y00S0n0«0¦0ó0¿0ü0o00Œ[†NY0‹0_00k0¢0×0ê0±0ü0·0ç0ó0L0S0F0€0‹0ý Rn0ª0ü0Ð0ü0Ø0Ã0É0’0:yY0ˆ0F0Ç0¶0¤0ó0U0Œ0~0W0_00 NUM_HANDLES_COUNTER_011_NAME=# GC Handles NUM_HANDLES_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o0þs(WO(uU0Œ0f0D0‹0 GC Ï0ó0É0ë0n0peW[’0hˆ:yW0~0Y00GCHandles o0 LR n0Yèh0Þ0Í0ü0¸0°tƒXn0ê0½0ü0¹0x0n0Ï0ó0É0ë0g0Y00Ï0ó0É0ë0o0 GCHeap k0\Ï‘n0á0â0ê0’0ÝOcW0~0Y0L00»Œ(un0›cK0‹0¢0ó0Þ0Í0ü0¸0 ê0½0ü0¹0k0j0‹0ïSý€'`L0B0Š0~0Y00 ALLOCATION_RATE_COUNTER_011_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o0 GC Ò0ü0×0k0rRŠ0S_f0‰0Œ0_0ÎkÒyn0Ð0¤0È0‡s’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0rRŠ0S_f0T0h0g0o0j0O00T GC n0B}†NT0h0k0ôf°eU0Œ0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 INDUCED_GC_COUNTER_011_NAME=# Induced GC INDUCED_GC_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o0 GC.Collect x0n0f:y„vj0|Ts0úQW0n0_00k0¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0L0Lˆ0Œ0_0g'Yn0ÞVpe’0hˆ:yW0~0Y00GC n0hTâlpe’0¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0k0T0[0f0J0O0n0‚0ˆ0D0¹eÕlg0Y00 PER_TIME_IN_GC_COUNTER_011_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_011_HELP=GC n0 % Time o00gŒ_n0 GC µ0¤0¯0ë0åNeg0¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0 (GC) ’0LˆF0_00k0L}NW0_0Bf“•n0Ñ0ü0»0ó0Æ0ü0¸0’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o008^0¬0Ù0ü0¸0 ³0ì0¯0·0ç0ó0L00¢0×0ê0±0ü0·0ç0ó0n0ãN0Š0k0á0â0ê0’0ÎSÆ–W0f0³0ó0Ñ0¯0È0S’0Lˆc0_0h0D0F0¤0ó0¸0±0ü0¿0ü0g0Y00S0n0«0¦0ó0¿0ü0o0ÎkÞVn0 GC n0gŒ_k0n00ôf°eU0Œ0~0Y00«0¦0ó0¿0ü0n0$Po0s^GW$Pg0o0j0O00gŒ_k0³‰ß[W0_0$P’0ÍS fW0~0Y00 PER_TIME_IN_GC_COUNTER_BASE_011_NAME=Not Displayed PER_TIME_IN_GC_COUNTER_BASE_011_HELP=hˆ:yU0Œ0f0D0~0[0“00 TOTAL_HEAP_SIZE_COUNTER_011_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o0!kn0 4 d0n0«0¦0ó0¿0ü0n0TŠg0Y00Gen 0 Ò0ü0×0 µ0¤0º00Gen 1 Ò0ü0×0 µ0¤0º00Gen 2 Ò0ü0×0 µ0¤0º0 J0ˆ0s0'YM0D0ª0Ö0¸0§0¯0È0n0Ò0ü0×0 µ0¤0º00S0n0«0¦0ó0¿0ü0o0 GC Ò0ü0×0k0rRŠ0S_f0‰0Œ0_0þs(Wn0Ð0¤0È0pe’0:yW0~0Y00 TOTAL_COMMITTED_MEM_COUNTER_011_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00þs(W¬0Ù0ü0¸0 ³0ì0¯0¿0ü0k0ˆ0c0f0³0ß0Ã0È0U0Œ0f0D0‹0îNó`á0â0ê0’0Ð0¤0È0peg0hˆ:yW0~0Y00(³0ß0Ã0È0 á0â0ê0o00Ç0£0¹0¯0n0Ú0ü0¸0ó0°0 Õ0¡0¤0ë0k0¹0Ú0ü0¹0L0ˆN}U0Œ0f0D0‹0irt„vj0á0â0ê0g0Y0)0 TOTAL_RESERVED_MEM_COUNTER_011_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_011_HELP=S0n0«0¦0ó0¿0ü0o00þs(W¬0Ù0ü0¸0 ³0ì0¯0¿0ü0k0ˆ0c0f0³0ß0Ã0È0U0Œ0f0D0‹0îNó`á0â0ê0’0Ð0¤0È0peg0hˆ:yW0~0Y00(ˆN}U0Œ0_0á0â0ê0o0¢0×0ê0±0ü0·0ç0ó0k0ˆN}U0Œ0_0îNó`á0â0ê0 ¹0Ú0ü0¹0g00Ç0£0¹0¯00~0_0o0á0¤0ó0 á0â0ê0 Ú0ü0¸0o0UO‚0O(uU0Œ0f0D0~0[0“0)0 GC_PINNED_OBJECTS_011_NAME=# of Pinned Objects GC_PINNED_OBJECTS_011_HELP=S0n0«0¦0ó0¿0ü0o0gŒ_n0 GC g0‹‰d0K0c0_0Ô0ó0bk0ª0Ö0¸0§0¯0È0n0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0¬0Ù0ü0¸0 ³0ì0¯0È0U0Œ0_0Ò0ü0×0n0-Nn0Ô0ó0bk0ª0Ö0¸0§0¯0È0n0Å`1Xn00’0Š2“W0~0Y00_0h0H0p0 Gen 0 GC o00¸0§0Í0ì0ü0·0ç0ó0 0 Ò0ü0×0…Qg0n00Ô0ó0bk0ª0Ö0¸0§0¯0È0n0Rc’0uX0~0Y00¬0Ù0ü0¸0 ³0ì0¯0¿0ü0o00Ô0ó0bk0ª0Ö0¸0§0¯0È0’0á0â0ê0…Qg0ûyÕRY0‹0S0h0o0g0M0~0[0“00 GC_SINKBLOCKS_011_NAME=# of Sink Blocks in use GC_SINKBLOCKS_011_HELP=S0n0«0¦0ó0¿0ü0o0þs(WO(uU0Œ0f0D0‹0 Sync Ö0í0Ã0¯0pe’0hˆ:yW0~0Y00Sync Ö0í0Ã0¯0o00¹0È0ì0ü0¸0n0 TgÅ`1Xk0_00k0rRŠ0S_f0‰0Œ0_0ª0Ö0¸0§0¯0È0T0h0n0Ç0ü0¿0Ëi g0Y00Sync Ö0í0Ã0¯0o0Þ0Í0ü0¸0 ª0Ö0¸0§0¯0È0k01_D0ÂSgq’0ÝOcW00¬0Ù0ü0¸0 ³0ì0¯0¿0ü0k0ˆ0c0f0¹0­0ã0ó0U0Œ0‹0Å_‰L0B0Š0~0Y00Sync Ö0í0Ã0¯0o0 TgÅ`1X’0ÝOX[Y0‹0`0Q0k0P–‰0Z00COM øv’NK(u_jý€á0¿0Ç0ü0¿0‚0ÝOX[g0M0~0Y00S0n0«0¦0ó0¿0ü0o00 Tg×0ê0ß0Æ0£0Ö0’0;˜A~k0O(uY0‹0S0h0k0ˆ0c0f0uX0‹0OUL˜’0cXdY0‹0ˆ0F0k0Ç0¶0¤0ó0U0Œ0~0W0_00 DotNetCLR_Loading_OBJECT_011_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_011_HELP=CLR ¯0é0¹0 í0ü0À0ü0n0q}Š LOADING_CLASSES_TOTAL_011_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0Y0y0f0n0¢0»0ó0Ö0ê0k0­Š0¼~0Œ0_0¯0é0¹0n0/}Mzpe’0hˆ:yW0~0Y00 LOADING_TIME_011_NAME=% Time Loading LOADING_TIME_011_HELP=\eg)R(uY0‹0_00k0ˆN}U0Œ0f0D0~0Y00 LOADING_ASMSEARCHLEN_011_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_011_HELP=\eg)R(uY0‹0_00k0ˆN}U0Œ0f0D0~0Y00 LOADING_LOADFAILURES_TOTAL_011_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0­Š0¼0g0M0j0K0c0_0¯0é0¹0n0g'Ype’0hˆ:yW0~0Y00­Š0¼0k01YWeW0_0t1uo00ASRj0»0­0å0ê0Æ0£00~0_0o0“•Uc0_0Õ0©0ü0Þ0Ã0È0h0K00D00D00€H0‰0Œ0~0Y00sŠ0}k0d0D0f0o00×0í0Õ0¡0¤0ë0 µ0ü0Ó0¹0n0Ø0ë0×0g0ÂSgqg0W0f0O0`0U0D00 LOADING_LOADFAILURES_INST_011_NAME=Rate of Load Failures LOADING_LOADFAILURES_INST_011_HELP=S0n0«0¦0ó0¿0ü0o0­Š0¼0g0M0j0K0c0_0¯0é0¹0n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00­Š0¼0k01YWeW0_0t1uo00ASRj0»0­0å0ê0Æ0£00~0_0o0“•Uc0_0Õ0©0ü0Þ0Ã0È0h0K00D00D00€H0‰0Œ0~0Y00sŠ0}k0d0D0f0o00×0í0Õ0¡0¤0ë0 µ0ü0Ó0¹0n0Ø0ë0×0g0ÂSgqg0W0f0O0`0U0D00 LOADING_HEAPSIZE_011_NAME=Bytes in Loader Heap LOADING_HEAPSIZE_011_HELP=S0n0«0¦0ó0¿0ü0o00þs(W0Y0y0f0n0 AppDomains g0¯0é0¹0 í0ü0À0ü0k0ˆ0c0f0³0ß0Ã0È0U0Œ0f0D0‹0á0â0ê0’0Ð0¤0È0peg0hˆ:yW0~0Y00(³0ß0Ã0È0 á0â0ê0o00Ç0£0¹0¯0n0Ú0ü0¸0ó0°0 Õ0¡0¤0ë0k0¹0Ú0ü0¹0L0ˆN}U0Œ0f0D0‹0irt„vj0á0â0ê0g0Y0)0 LOADING_APPDOMAINS_UNLOADED_TOTAL_011_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0¢0ó0í0ü0É0U0Œ0_0 AppDomains n0TŠpe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00AppDomain L0­Š0¼~0Œ00]0W0f0‰peÞV¢0ó0í0ü0É0U0Œ0_04XTo00T¢0ó0í0ü0É0’0%R0k0«0¦0ó0È0W0~0Y00 LOADING_APPDOMAINS_UNLOADED_INST_011_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0ó0í0ü0É0U0Œ0_0 AppDomains n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:y W0~0Y00 LOADING_CLASSES_CUR_011_NAME=Current Classes Loaded LOADING_CLASSES_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o0Y0y0f0n0¢0»0ó0Ö0ê0k0­Š0¼~0Œ0_0þs(Wn0¯0é0¹0pe’0hˆ:yW0~0Y00 LOADING_CLASSES_INST_011_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_011_HELP=S0n0«0¦0ó0¿0ü0o0Y0y0f0n0¢0»0ó0Ö0ê0k0­Š0¼~0Œ0_0¯0é0¹0n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 LOADING_APPDOMAINS_CUR_011_NAME=Current appdomains LOADING_APPDOMAINS_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o0S0n0¢0×0ê0±0ü0·0ç0ó0k0­Š0¼~0Œ0_0þs(Wn0 AppDomains pe’0hˆ:yW0~0Y00AppDomains (¢0×0ê0±0ü0·0ç0ó0 É0á0¤0ó0) o0‰[hQg0Y(un0×0í0»0¹0 æ0Ë0Ã0È0’0Ðc›OW0~0Y00CLR o0S0Œ0’0O(uW0f00 TX0×0í0»0¹0…Qg0Ÿ[LˆU0Œ0f0D0‹0¢0×0ê0±0ü0·0ç0ó0n0“•n0Râ–’0Ðc›OY0‹0S0h0L0g0M0~0Y00 LOADING_APPDOMAINS_TOTAL_011_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0­Š0¼~0Œ0_0g'Yn0 AppDomains pe’0hˆ:yW0~0Y00AppDomains (¢0×0ê0±0ü0·0ç0ó0 É0á0¤0ó0) o0‰[hQg0Y(un0×0í0»0¹0 æ0Ë0Ã0È0’0Ðc›OW0~0Y00CLR o0S0Œ0’0O(uW0f00 TX0×0í0»0¹0…Qg0Ÿ[LˆU0Œ0f0D0‹0¢0×0ê0±0ü0·0ç0ó0n0“•n0Râ–’0Ðc›OY0‹0S0h0L0g0M0~0Y00 LOADING_APPDOMAINS_INST_011_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_011_HELP=S0n0«0¦0ó0¿0ü0o0 ­Š0¼~0Œ0_0 AppDomains n0ÎkÒyn0pe’0hˆ:yW0~0Y00AppDomains (¢0×0ê0±0ü0·0ç0ó0 É0á0¤0ó0) o0‰[hQg0Y(un0×0í0»0¹0 æ0Ë0Ã0È0’0Ðc›OW0~0Y00CLR o0S0Œ0’0O(uW0f00 TX0×0í0»0¹0…Qg0Ÿ[LˆU0Œ0f0D0‹0¢0×0ê0±0ü0·0ç0ó0n0“•n0Râ–’0Ðc›OY0‹0S0h0L0g0M0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 LOADING_ASSEMBLIES_CUR_011_NAME=Current Assemblies LOADING_ASSEMBLIES_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o0S0n0¢0×0ê0±0ü0·0ç0ó0n0Y0y0f0n0 AppDomains g0­Š0¼~0Œ0_0¢0»0ó0Ö0ê0n0þs(Wn0pe’0hˆ:yW0~0Y00¢0»0ó0Ö0ê0L0‰pen0 AppDomains K0‰0É0á0¤0ó0-NËzg0­Š0¼~0Œ0_04XTo00S0n0«0¦0ó0¿0ü0o0 1 ¦^`0Q0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00¢0»0ó0Ö0ê0o00³0ü0É0L0Y0y0f0n0 AppDomains g0qQ gg0M0‹04XTo00É0á0¤0ó0-NËzg0­Š0¼~0Œ0~0Y00~0_0o00³0ü0É0L0 AppDomain k0×0é0¤0Ù0ü0È0g0B0‹0h0M0o00É0á0¤0ó0úV gh0W0f0­Š0¼~0Œ0~0Y00 LOADING_ASSEMBLIES_TOTAL_011_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg­Š0¼~0Œ0_0TŠn0¢0»0ó0Ö0ê0pe’0hˆ:yW0~0Y00¢0»0ó0Ö0ê0L0‰pen0 AppDomains K0‰0É0á0¤0ó0-NËzg0­Š0¼~0Œ0_04XTo00S0n0«0¦0ó0¿0ü0o0 1 ¦^`0Q0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00¢0»0ó0Ö0ê0o00³0ü0É0L0Y0y0f0n0 AppDomains g0qQ gg0M0‹04XTo00É0á0¤0ó0-NËzg0­Š0¼~0Œ0~0Y00~0_0o00³0ü0É0L0 AppDomain k0×0é0¤0Ù0ü0È0g0B0‹0h0M0o00É0á0¤0ó0úV gh0W0f0­Š0¼~0Œ0~0Y00 LOADING_ASSEMBLIES_INST_011_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00Y0y0f0n0 AppDomains g0­Š0¼~0Œ0_0¢0»0ó0Ö0ê0n0ÎkÒyn0pe’0hˆ:yW0~0Y00¢0»0ó0Ö0ê0L0‰pen0 AppDomains K0‰0É0á0¤0ó0-NËzg0­Š0¼~0Œ0_04XTo00S0n0«0¦0ó0¿0ü0o0 1 ¦^`0Q0¤0ó0¯0ê0á0ó0È0U0Œ0~0Y00¢0»0ó0Ö0ê0o00³0ü0É0L0Y0y0f0n0 AppDomains g0qQ gg0M0‹04XTo00É0á0¤0ó0-NËzg0­Š0¼~0Œ0~0Y00~0_0o00³0ü0É0L0 AppDomain k0×0é0¤0Ù0ü0È0g0B0‹0h0M0o00É0á0¤0ó0úV gh0W0f0­Š0¼~0Œ0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 DotNetCLR_Jit_OBJECT_011_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_011_HELP=CLR Jit n0q}Šg0Y00 TOTAL_METHODS_JITTED_011_NAME=# of Methods Jitted TOTAL_METHODS_JITTED_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg CLR JIT ³0ó0Ñ0¤0é0k0ˆ0c0f0 Just-In-Time (JIT) k0³0ó0Ñ0¤0ë0U0Œ0_0á0½0Ã0É0n0TŠpe’0hˆ:yW0~0Y00 JITTED_IL_CUR_011_NAME=# of IL Bytes Jitted JITTED_IL_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0K0‰0O(uU0Œ0_0TŠn0 IL Ð0¤0È0’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00"Total # of IL Bytes Jitted" «0¦0ó0¿0ü0h0~0c0_0O0 T$Pg0Y00 JITTED_IL_TOTAL_011_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0K0‰0O(uU0Œ0_0TŠn0 IL Ð0¤0È0’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00"# of IL Bytes Jitted" «0¦0ó0¿0ü0h0Œ[hQk0 T$Pg0Y00 JITTED_IL_INST_011_NAME=IL Bytes Jitted / sec JITTED_IL_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00O(uU0Œ0_0 IL Ð0¤0È0n0ÎkÒyn0rRT’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 JIT_FAILURES_011_NAME=Standard Jit Failures JIT_FAILURES_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg JIT ³0ó0Ñ0¤0é0L0 JIT k01YWeW0_0g'Yn0á0½0Ã0É0pe’0hˆ:yW0~0Y001YWeo0 IL ’0i<Šg0M0j0K0c0_04XT0~0_0o0 JIT ³0ó0Ñ0¤0é0k0…Qè¨0é0ü0L0uX0_04XTk0zvuW0~0Y00 TIME_IN_JIT_011_NAME=% Time in Jit TIME_IN_JIT_011_HELP=S0n0«0¦0ó0¿0ü0o00gŒ_n0 JIT ³0ó0Ñ0¤0ë0n0µkŽ–åNeg0JIT ³0ó0Ñ0¤0é0’0LˆF0_00k0L}NW0_0Bf“•n0Ñ0ü0»0ó0Æ0ü0¸0’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00ÎkÞVn0 JIT ³0ó0Ñ0¤0ë0n0µkŽ–n0gŒ_k0ôf°eU0Œ0~0Y00«0¦0ó0¿0ü0n0$Po00s^GW$Pg0o0j0O00gŒ_k0³‰ß[W0_0$P’0ÍS fW0~0Y00JIT ³0ó0Ñ0¤0ë0n0µkŽ–o00á0½0Ã0É0J0ˆ0s0]0n0OX[¢•ÂOL0³0ó0Ñ0¤0ë0U0Œ0_0µkŽ–’0hˆW0~0Y00 TIME_IN_JIT_BASE_011_NAME=Not Displayed TIME_IN_JIT_BASE_011_HELP=hˆ:yU0Œ0f0D0~0[0“00 DotNetCLR_Interop_OBJECT_011_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_011_HELP=CLR øv’NK(u_jý€n0q}Šg0Y00 CURRENT_CCW_011_NAME=# of CCWs CURRENT_CCW_011_HELP=S0n0«0¦0ó0¿0ü0o00Com |Ts0úQW0ïSý€é0Ã0Ñ0ü0 (CCWs) n0þs(Wn0pe’0hˆ:yW0~0Y00CCW o00¢0ó0Þ0Í0ü0¸0n0 COM ¯0é0¤0¢0ó0È0K0‰0ÂSgqU0Œ0f0D0‹0 .NET Þ0Í0ü0¸0 ª0Ö0¸0§0¯0È0n0×0í0­0·0g0Y00S0n0«0¦0ó0¿0ü0o00¢0ó0Þ0Í0ü0¸0n0 COM ¯0é0¤0¢0ó0È0K0‰0ÂSgqU0Œ0f0D0‹0Þ0Í0ü0¸0 ª0Ö0¸0§0¯0È0n0pe’0:yY0ˆ0F0k0Ç0¶0¤0ó0U0Œ0~0W0_00 CURRENT_STUBS_011_NAME=# of Stubs CURRENT_STUBS_011_HELP=S0n0«0¦0ó0¿0ü0o00CLR g0\ObU0Œ0_0þs(Wn0¹0¿0Ö0pe’0hˆ:yW0~0Y00¹0¿0Ö0o0_peJ0ˆ0s0;bŠ0$P’0Þ0Í0ü0¸0K0‰0¢0ó0Þ0Í0ü0¸0 ³0ü0É0x00~0_0o0¢0ó0Þ0Í0ü0¸0K0‰0Þ0Í0ü0¸0 ³0ü0É0x0Þ0ü0·0ã0ê0ó0°0Y0‹0y_îv’0cc0f0D0~0Y00S0Œ0o0 COM øv’NK(u_jý€|Ts0úQW00~0_0o0 PInvoke |Ts0úQW0-Nk0Lˆ0Œ0~0Y00 NUM_MARSHALLING_011_NAME=# of marshalling NUM_MARSHALLING_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0_peh0;bŠ0$PL0Þ0Í0ü0¸0K0‰0¢0ó0Þ0Í0ü0¸0 ³0ü0É0k00~0_0¢0ó0Þ0Í0ü0¸0K0‰0Þ0Í0ü0¸0 ³0ü0É0k0Þ0ü0·0ã0ê0ó0°0U0Œ0_0TŠÞVpe’0hˆ:yW0~0Y00S0n0«0¦0ó0È0o0¹0¿0Ö0L0¤0ó0é0¤0ó0n04XTo0¤0ó0¯0ê0á0ó0È0U0Œ0~0[0“00(¹0¿0Ö0o0_peJ0ˆ0s0;bŠ0$P’0Þ0ü0·0ã0ê0ó0°0Y0‹0y_îv’0cc0f0D0~0Y0)0¹0¿0Ö0o00Þ0ü0·0ã0ê0ó0°0n0ª0ü0Ð0ü0Ø0Ã0É0L0\U0D04XTo008^¤0ó0é0¤0ó0k0j0Š0~0Y00 TOTAL_TLB_IMPORTS_011_NAME=# of TLB imports / sec TOTAL_TLB_IMPORTS_011_HELP=\eg)R(uY0‹0_00k0ˆN}U0Œ0f0D0~0Y00 TOTAL_TLB_EXPORTS_011_NAME=# of TLB exports / sec TOTAL_TLB_EXPORTS_011_HELP=\eg)R(uY0‹0_00k0ˆN}U0Œ0f0D0~0Y00 DotNetCLR_LocksAndThreads_OBJECT_011_NAME=.NET CLR LocksAndThreads DotNetCLR_LocksAndThreads_OBJECT_011_HELP=CLR í0Ã0¯0J0ˆ0s0¹0ì0Ã0É0n0q}Šg0Y00 CONTENTION_TOTAL_011_NAME=Total # of Contentions CONTENTION_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00CLR …Qn0¹0ì0Ã0É0L0Þ0Í0ü0¸0 í0Ã0¯0’0ÖS—_W0ˆ0F0h0W0f01YWeW0_0ÞVpen0TŠ’0hˆ:yW0~0Y00Þ0Í0ü0¸0 í0Ã0¯0’0ÖS—_Y0‹0k0o0D00D00j0¹eÕlL0B0Š0~0Y00_0h0H0p00C# …Qn0 "lock" ¹0Æ0ü0È0á0ó0È0’0O(uY0‹00System.Monitor.Enter ’0|Ts0úQY00MethodImplOptions.Synchronized custom ^\'`’0O(uY0‹00j0i00 CONTENTION_INST_011_NAME=Contention Rate / sec CONTENTION_INST_011_HELP=é0ó0¿0¤0à0n0¹0ì0Ã0É0L0Þ0Í0ü0¸0 í0Ã0¯0’0ÖS—_W0ˆ0F0h0W0f01YWeW0_0rRTg0Y00Þ0Í0ü0¸0 í0Ã0¯0’0ÖS—_Y0‹0k0o0!kn0ˆ0F0j0¹eÕlL0B0Š0~0Y00C# n0 "lock" ¹0Æ0ü0È0á0ó0È0’0O(uY0‹00System.Monitor.Enter n0|Ts0úQW0’0Y0‹00~0_0o0 MethodImplOptions.Synchronized «0¹0¿0à0^\'`’0O(uY0‹00 QUEUE_LENGTH_CUR_011_NAME=Current Queue Length QUEUE_LENGTH_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o0þs(W¢0×0ê0±0ü0·0ç0ó0g0Þ0Í0ü0¸0 í0Ã0¯0’0ÖS—_W0ˆ0F0h0…_c0f0D0‹0¹0ì0Ã0É0n0TŠpe’0hˆ:yW0~0Y00S0n0«0¦0ó0È0o0hQSOn0s^GWg0o0j0O00gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00 QUEUE_LENGTH_TOTAL_011_NAME=Queue Length Peak QUEUE_LENGTH_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYW0f0K0‰00Þ0Í0ü0¸0 í0Ã0¯0n0ÖS—_’0…_c0f0D0‹0¹0ì0Ã0É0n0TŠpe’0hˆ:yW0~0Y00 QUEUE_LENGTH_INST_011_NAME=Queue Length / sec QUEUE_LENGTH_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0g0í0Ã0¯0n0ÖS—_’0…_c0f0D0‹0¹0ì0Ã0É0n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 CURRENT_LOGICAL_THREADS_011_NAME=# of current logical Threads CURRENT_LOGICAL_THREADS_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0…Qn0 .NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0n0þs(Wn0pe’0hˆ:yW0~0Y00.NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0o0°eW0D0 System.Threading.Thread k0ˆ0c0f0\ObU0Œ0‹0K00~0_0o0¢0ó0Þ0Í0ü0¸0 ¹0ì0Ã0É0L0Þ0Í0ü0¸0°tƒXk0eQc0_0h0M0k0\ObU0Œ0~0Y00S0n0«0¦0ó0¿0ü0o00Ÿ[Lˆ-Nn0¹0ì0Ã0É0J0ˆ0s0-NbkW0_0¹0ì0Ã0É0n0!N¹en0«0¦0ó0È0’0­}cW0~0Y00S0n0«0¦0ó0È0o0hQSOn0s^GWg0o0j0O00gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00 CURRENT_PHYSICAL_THREADS_011_NAME=# of current physical Threads CURRENT_PHYSICAL_THREADS_011_HELP=S0n0«0¦0ó0¿0ü0o00CLR k0ˆ0c0f0\ObU0Œ0@b gU0Œ0f00.NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0n0úWk0j0‹0¹0ì0Ã0É0h0W0f0ÕR\OY0‹0Í0¤0Æ0£0Ö0n0 OS ¹0ì0Ã0É0n0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0n0$Po00…QèÍd\Og0 CLR k0ˆ0c0f0O(uU0Œ0‹0¹0ì0Ã0É0’0+T0~0[0“00OS ×0í0»0¹0n0¹0ì0Ã0É0n0µ0Ö0»0Ã0È0g0Y00 RECOGNIZED_THREADS_CUR_011_NAME=# of current recognized threads RECOGNIZED_THREADS_CUR_011_HELP=S0n0«0¦0ó0¿0ü0o00þs(W CLR k0ˆ0c0f0ŠX‹U0Œ0f0D0‹0¹0ì0Ã0É0pe’0hˆ:yW0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o00¹0ì0Ã0É0h0¢•#ØNQ0‰0Œ0_0NôY0‹0 .NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0’0cc0f0D0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o0 CLR k0ˆ0c0f0\ObU0Œ0Z00CLR n0Yèg0\ObU0Œ0~0Y0L00CLR …Qg0\j0O0h0‚0 1 ¦^o0Ÿ[LˆU0Œ0f0D0~0Y00Å`1XL0Š2“U0Œ0‹0n0o0Nan0¹0ì0Ã0É0n00g0Y00 TX0¹0ì0Ã0É0 ID g0 CLR k0Qs0+T~0Œ0_0Š00~0_0B}†NŒ_k0Q\ObU0Œ0_0¹0ì0Ã0É0o0 2 ¦^îvo0«0¦0ó0È0U0Œ0~0[0“00 RECOGNIZED_THREADS_TOTAL_011_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0n0‹•ËYåNeg CLR k0ˆ0c0f0ŠX‹U0Œ0_0¹0ì0Ã0É0TŠpe’0hˆ:yW0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o00¹0ì0Ã0É0h0¢•#ØNQ0‰0Œ0_0NôY0‹0 .NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0’0cc0f0D0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o0 CLR k0ˆ0c0f0\ObU0Œ0Z00CLR n0Yèg0\ObU0Œ0~0Y0L00CLR …Qg0\j0O0h0‚0 1 ¦^o0Ÿ[LˆU0Œ0f0D0~0Y00Å`1XL0Š2“U0Œ0‹0n0o0Nan0¹0ì0Ã0É0n00g0Y00 TX0¹0ì0Ã0É0 ID g0 CLR k0Qs0+T~0Œ0_0Š00~0_0B}†NŒ_k0Q\ObU0Œ0_0¹0ì0Ã0É0o0 2 ¦^îvo0«0¦0ó0È0U0Œ0~0[0“00 RECOGNIZED_THREADS_INST_011_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00CLR k0ˆ0c0f0ŠX‹U0Œ0_0¹0ì0Ã0É0n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o00¹0ì0Ã0É0h0¢•#ØNQ0‰0Œ0_0NôY0‹0 .NET ¹0ì0Ã0É0 ª0Ö0¸0§0¯0È0’0cc0f0D0~0Y00S0Œ0‰0n0¹0ì0Ã0É0o0 CLR k0ˆ0c0f0\ObU0Œ0Z00CLR n0Yèg0\ObU0Œ0~0Y0L00CLR …Qg0\j0O0h0‚0 1 ¦^o0Ÿ[LˆU0Œ0f0D0~0Y00Å`1XL0Š2“U0Œ0‹0n0o0Nan0¹0ì0Ã0É0n00g0Y00 TX0¹0ì0Ã0É0 ID g0 CLR k0Qs0+T~0Œ0_0Š00~0_0B}†NŒ_k0Q\ObU0Œ0_0¹0ì0Ã0É0o0 2 ¦^îvo0«0¦0ó0È0U0Œ0~0[0“00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 DotNetCLR_Security_OBJECT_011_NAME=.NET CLR Security DotNetCLR_Security_OBJECT_011_HELP=CLR »0­0å0ê0Æ0£0n0q}Šg0Y00 SECURITY_TOTALRTCHECKS_011_NAME=Total Runtime Checks SECURITY_TOTALRTCHECKS_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0n0‹•ËYåNeg0Ÿ[LˆU0Œ0_0é0ó0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 (CAS) Á0§0Ã0¯0n0TŠpe’0hˆ:yW0~0Y00é0ó0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 (CAS) Á0§0Ã0¯0o00|Ts0úQW0CQL0|Ts0úQW0HQk0yr%Rn0¢0¯0»0¹0)jP–’0‰BlW0f0|Ts0úQW0_0h0M0k0Ÿ[LˆU0Œ0~0Y00|Ts0úQW0CQL0ÎkÞV|Ts0úQY0T0h0k0é0ó0¿0¤0à0 Á0§0Ã0¯0L0Ÿ[LˆU0Œ0~0Y00~0_0|Ts0úQW0CQn0þs(Wn0¹0ì0Ã0É0 ¹0¿0Ã0¯0’0¿Šy0‹0S0h0k0ˆ0c0f0Á0§0Ã0¯0L0Ÿ[LˆU0Œ0~0Y00"Stack Walk Depth" h0qQk0O(uU0Œ0‹0S0n0«0¦0ó0¿0ü0o00»0­0å0ê0Æ0£0 Á0§0Ã0¯0n0Ñ0Õ0©0ü0Þ0ó0¹0 Ú0Ê0ë0Æ0£0’0:yW0~0Y00 SECURITY_TIMEAUTHORIZE_011_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_011_HELP=\eg)R(uY0‹0_00k0ˆN}U0Œ0f0D0~0Y00 SECURITY_LINKCHECKS_011_NAME=# Link Time Checks SECURITY_LINKCHECKS_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYW0f0åNegn0ê0ó0¯0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 (CAS) Á0§0Ã0¯0n0TŠpe’0hˆ:yW0~0Y00ê0ó0¯0¿0¤0à0 CAS Á0§0Ã0¯0o00JIT ³0ó0Ñ0¤0ë0Bfk00|Ts0úQW0CQL0|Ts0úQW0HQk0yr%Rn0¢0¯0»0¹0)jP–’0‰BlW0f0|Ts0úQW0_0h0M0k0Ÿ[LˆU0Œ0~0Y00ê0ó0¯0¿0¤0à0 CAS Á0§0Ã0¯0o0|Ts0úQW0T0h0k0 1 ¦^Ÿ[LˆU0Œ0~0Y00S0n0«0¦0ó0È0o0Í‘'Yj0Ñ0Õ0©0ü0Þ0ó0¹0OUL˜’0:yY0‚0n0g0o0j0O00»0­0å0ê0Æ0£0 ·0¹0Æ0à0n0ÕR\O’0:yY0‚0n0g0Y00 SECURITY_TIMERTCHECKS_011_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_011_HELP=S0n0«0¦0ó0¿0ü0o00gŒ_n0Á0§0Ã0¯0åNeg0é0ó0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 (CAS) Á0§0Ã0¯0’0LˆF0_00k0L}NW0_0Bf“•n0Ñ0ü0»0ó0Æ0ü0¸0’0hˆ:yW0~0Y00CAS o0³0ü0É0k0puj0‹0Ä{òVg0n0áO<˜’0NH0~0Y00³0ü0É0n0 ID k0“_c0f0S0n0puj0‹0áO<˜ì0Ù0ë0’0i(uW0~0Y00S0n0«0¦0ó0¿0ü0o0é0ó0¿0¤0à0n0»0­0å0ê0Æ0£0 Á0§0Ã0¯0n0gŒ_k0ôf°eU0Œ0~0Y00«0¦0ó0¿0ü0n0$Po0s^GW$Pg0o0j0O00gŒ_k0³‰ß[W0_0$P’0ÍS fW0~0Y00 SECURITY_TIMERTCHECKS_BASE_011_NAME=Not Displayed SECURITY_TIMERTCHECKS_BASE_011_HELP=hˆ:yU0Œ0f0D0~0[0“00 SECURITY_DEPTHSECURITY_011_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_011_HELP=S0n0«0¦0ó0¿0ü0o0gŒ_n0é0ó0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 Á0§0Ã0¯0Bfn0¹0¿0Ã0¯0n0ñmU0’0hˆ:yW0~0Y00é0ó0¿0¤0à0 ³0ü0É0 ¢0¯0»0¹0 »0­0å0ê0Æ0£0 Á0§0Ã0¯0o0¹0¿0Ã0¯0’0¯0í0ü0ë0W0f0Ÿ[LˆU0Œ0~0Y00S0n0«0¦0ó0È0o0hQSOn0s^GWg0o0j0O00gŒ_k0³‰ß[U0Œ0_0$P’0hˆ:yW0~0Y00 DotNetCLR_Remoting_OBJECT_011_NAME=.NET CLR Remoting DotNetCLR_Remoting_OBJECT_011_HELP=CLR ê0â0ü0È0æQtn0q}Šg0Y00 CONTEXT_REMOTECALLS_INST_011_NAME=Remote Calls/sec CONTEXT_REMOTECALLS_INST_011_HELP=S0n0«0¦0ó0¿0ü0o00ê0â0ü0È0 ×0í0·0ü0¸0ã0n0|Ts0úQW0L0j0U0Œ0_0ÎkÒyn0ÞVpe’0hˆ:yW0~0Y00ê0â0ü0È0 ×0í0·0ü0¸0ã0n0|Ts0úQW0o00|Ts0úQW0CQn0 AppDomain åNYn0ª0Ö0¸0§0¯0È0k0j0U0Œ0_0|Ts0úQW0Y0y0f0’0+T0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 CONTEXT_CHANNELS_011_NAME=Channels CONTEXT_CHANNELS_011_HELP=S0n0«0¦0ó0¿0ü0o00¢0×0ê0±0ü0·0ç0ó0L0‹•ËYU0Œ0f0åNeg0Y0y0f0n0 AppDomain g0{v2“U0Œ0f0D0‹0ê0â0ü0È0æQtÁ0ã0Í0ë0n0TŠpe’0hˆ:yW0~0Y00Á0ã0Í0ë0o0ê0â0ü0È0 ª0Ö0¸0§0¯0È0“•g0á0Ã0»0ü0¸0’0áOY0‹0n0k0O(uU0Œ0~0Y00 CONTEXT_PROXIES_011_NAME=Context Proxies CONTEXT_PROXIES_011_HELP=S0n0«0¦0ó0¿0ü0o00×0í0»0¹0L0‹•ËYU0Œ0f0åNeg0S0n0×0í0»0¹0g0\ObU0Œ0_0ê0â0ü0È0æQt ×0í0­0·0 ª0Ö0¸0§0¯0È0n0TŠpe’0hˆ:yW0~0Y00×0í0­0·0 ª0Ö0¸0§0¯0È0o0ê0â0ü0È0 ª0Ö0¸0§0¯0È0’0ãNhˆW0f0ÕR\OW00×0í0­0·0k0J0Q0‹0Y0y0f0n0|Ts0úQW0o00ê0â0ü0È0 ª0Ö0¸0§0¯0È0 ¤0ó0¹0¿0ó0¹0k0ckºxk0âŽU0Œ0‹0S0h0’0ºxŸ[k0W0~0Y00 CONTEXT_CLASSES_011_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_011_HELP=S0n0«0¦0ó0¿0ü0o00­Š0¼~0Œ0_0 context-bound ¯0é0¹0n0þs(Wpe’0hˆ:yW0~0Y00³0ó0Æ0­0¹0È0k0Øb_gY0‹0S0h0n0g0M0‹0¯0é0¹0o0 context-bound ¯0é0¹0h0|Tp0Œ0~0Y00context-bound ¯0é0¹0o00 Tg0¹0ì0Ã0É0^˜100)0wS0‹0ïSý€'`n0B0‹0Ñ0Õ0©0ü0Þ0ó0¹0OUL˜’0cXdY0‹0ˆ0F0k0Ç0¶0¤0ó0U0Œ0~0W0_00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 TOTAL_EXCEP_FILTERS_RUN_011_NAME=# of Filters / sec TOTAL_EXCEP_FILTERS_RUN_011_HELP=S0n0«0¦0ó0¿0ü0o00.NET ‹OYÕ0£0ë0¿0ü0L0Ÿ[LˆU0Œ0_0ÎkÒyn0pe’0hˆ:yW0~0Y00‹OYÕ0£0ë0¿0ü0o0‹OYL0æQtU0Œ0‹0y0M0K0i0F0K0’0UŠ¡OW0~0Y00S0n0«0¦0ó0¿0ü0o00‹OYL0æQtU0Œ0_0K0i0F0K0k0o0¢•ÂOj0O00‹OYÕ0£0ë0¿0ü0L0UŠ¡OU0Œ0_0rRT’0Š2“W0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 TOTAL_EXCEP_FINALLYS_RUN_011_NAME=# of Finallys / sec TOTAL_EXCEP_FINALLYS_RUN_011_HELP=S0n0«0¦0ó0¿0ü0o0 finally Ö0í0Ã0¯0L0Ÿ[LˆU0Œ0_0ÎkÒyn0pe’0hˆ:yW0~0Y00finally Ö0í0Ã0¯0o00try Ö0í0Ã0¯0L0i0n0ˆ0F0k0Ÿ[LˆU0Œ0_0K0k0o0¢•ÂOj0O0Å_Z0Ÿ[LˆU0Œ0‹0ˆ0F0k0j0c0f0D0~0Y00‹OYk0Ÿ[LˆU0Œ0_0 finally Ö0í0Ã0¯0`0Q0L0«0¦0ó0È0U0Œ0~0Y008^n0³0ü0É0 Ñ0¹0n0 finally Ö0í0Ã0¯0o0S0n0«0¦0ó0¿0ü0g0o0«0¦0ó0È0U0Œ0~0[0“00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 EXCEPT_STACK_DEPTH_011_NAME=Throw To Catch Depth / sec EXCEPT_STACK_DEPTH_011_HELP=S0n0«0¦0ó0¿0ü0o00.NET ‹OY’0‹OY’0æQtY0‹0Õ0ì0ü0à0k0¹0í0ü0W0_0Õ0ì0ü0à0K0‰0ûyU0Œ0_0¹0¿0Ã0¯0 Õ0ì0ü0à0n0ÎkÒyn0pe’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o00‹OYÏ0ó0É0é0ü0L0eQ›RU0Œ0‹0h0 0 k0ê0»0Ã0È0U0Œ00eQŒ0P[k0j0c0_0‹OYo0Ï0ó0É0é0ü0k0¹0¿0Ã0¯0n0ñmU0’0hˆ:yW0~0Y00S0n0«0¦0ó0¿0ü0o0hQSOn0s^GWg0o0j0O00µ0ó0×0ë0“•”–n0™}š}Bf“•g0rRc0_0gŒ_n0 2 d0n0µ0ó0×0ë0n0“•g0³‰ß[U0Œ0_0$Pn0UD0’0hˆ:yW0~0Y00 DotNetCLR_Memory_OBJECT_012_NAME=.NET CLR Memory DotNetCLR_Memory_OBJECT_012_HELP=CLR ¬D¾ÀÉ ÂÑÉ´ ™×ÐÅ ³\Õ tδÆ0Ñ…ÇȲä². GEN0_COLLECTIONS_COUNTER_012_NAME=# Gen 0 Collections GEN0_COLLECTIONS_COUNTER_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ 08Á³ ¬´Ì(¬¥Ç \Íü­ÐÅ `Õù²´ 8Á³)¬ ¬D¾ÀÉ ÂÑÉ´(Gen 0 GC) ŸÖÂ|¹ \ÔÜÂiÕȲä². Gen 0 GC”² 08Á³ÐÅ ¬À©Æ ¬¥²\Õ Tº¨º¬¹¬ `Õù² ”Æ­Ì´ Tº¨º¬¹ô¼ä² ÈDÇ Lµ ¼ÝÀiÕȲä². tÇ tδÆ0Ñ”² Gen 0 GC¬ ]° ° Lµ ɬiÕȲä². ¨ºà´ XÕÇ 8Á³ GC”² ÁÀÇ 8Á³ GCÐÅ ìÓhÕ´À»\¸, tÇ tδÆ0Ñ”² ÁÀÇ 8Á³(Gen 1 ¶”² Gen 2) GC¬ ¼ÝÀ`Õ LµÈ¹ä² …ºÜÂÈ<Ç\¸ ɬiÕȲä². _Global_ counter ¬@Ç ÈUÖXÕÀÉ JÅ<ÇÀ»\¸ 4»ÜÂXÕ”² ƒ¬tÇ ‹ÈµÂȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². GEN1_COLLECTIONS_COUNTER_012_NAME=# Gen 1 Collections GEN1_COLLECTIONS_COUNTER_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ 18Á³ ¬´Ì¬ ¬D¾ÀÉ ÂÑÉ´ ŸÖÂ|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² Gen 1 GC¬ ]° ° Lµ ɬiÕȲä². ¨ºà´ XÕÇ 8Á³ GC”² ÁÀÇ 8Á³ GCÐÅ ìÓhÕ´À»\¸, tÇ tδÆ0Ñ”² ÁÀÇ 8Á³(Gen 2) GC¬ ¼ÝÀ`Õ Lµ …ºÜÂÈ<Ç\¸ ɬiÕȲä². _Global_ counter ¬@Ç ÈUÖXÕÀÉ JÅ<ÇÀ»\¸ 4»ÜÂXÕ”² ƒ¬tÇ ‹ÈµÂȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². GEN2_COLLECTIONS_COUNTER_012_NAME=# Gen 2 Collections GEN2_COLLECTIONS_COUNTER_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ 28Á³ ¬´Ì($Ƙ·´ 8Á³)¬ ¬D¾ÀÉ ÂÑÉ´ ŸÖÂ|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² Gen 2 GC(È´Ì GC|·à¬Ä³ hÕ)¬ ]° ° Lµ ɬiÕȲä². _Global_ counter ¬@Ç ÈUÖXÕÀÉ JÅ<ÇÀ»\¸ 4»ÜÂXÕ”² ƒ¬tÇ ‹ÈµÂȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². GEN0_BYTES_PROMOTED_COUNTER_012_NAME=Promoted Memory from Gen 0 GEN0_BYTES_PROMOTED_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅଠ¨°DÅ 08Á³ÐÅÁ 18Á³\¸ ÂÉtÇ $Æx¹ Tº¨º¬¹ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ ÂÉtÇ $Æx¹ ¬´Ì”² tÇ tδÆ0ÑÐÅ ìÓhÕ´ÀÉ JŵÂȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ GC¬ ]° ° Lµ ­0Ì´ ¬DÇ \ÔÜÂXÕpº, ²È tδÆ0Ѭ DÅٲȲä². GEN1_BYTES_PROMOTED_COUNTER_012_NAME=Promoted Memory from Gen 1 GEN1_BYTES_PROMOTED_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅଠ¨°DÅ 18Á³ÐÅÁ 28Á³\¸ ÂÉtÇ $Æx¹ Tº¨º¬¹ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ ÂÉtÇ $Æx¹ ¬´Ì”² tÇ tδÆ0ÑÐÅ ìÓhÕ´ÀÉ JŵÂȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ GC¬ ]° ° Lµ ­0Ì´ ¬DÇ \ÔÜÂXÕpº, ²È tδÆ0Ѭ DÅٲȲä². ȹÀÉɹ GC¬ Gen 0 GCпxÇ ½¬°Æ tδÆ0Ñ”² 0<Ç\¸ ä²Ü $ÁÈ)´È²ä². GEN0_PROMOTION_RATE_012_NAME=Gen 0 Promoted Bytes/Sec GEN0_PROMOTION_RATE_012_HELP=tÇ tδÆ0Ñ”² Í ù² 08Á³(¬¥Ç \Íü­ 8Á³)ÐÅÁ 18Á³\¸ ÂÉtÇ $Æx¹ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ ÂÉtÇ $Æx¹ ¬´Ì”² tÇ tδÆ0ÑÐÅ ìÓhÕ´ÀÉ JŵÂȲä². Tº¨º¬¹”² ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅଠ¨°<Çtº ÂÉtÇ $Æ…¹È²ä². tÇ tδÆ0Ñ”² Í ù² ̹䴴ÅÀÉ”², ÁÀ³È<Ç\¸ Â…ºtÇ 4® ¬´Ì|¹ \ÔÜÂXÕij]¸ µÇxÇ´ÈÅ<Çpº, ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². GEN1_PROMOTION_RATE_012_NAME=Gen 1 Promoted Bytes/Sec GEN1_PROMOTION_RATE_012_HELP=tÇ tδÆ0Ñ”² Í ù² 18Á³ÐÅÁ 28Á³(¬¥Ç $Ƙ·´ 8Á³)\¸ ÂÉtÇ $Æx¹ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ ÂÉtÇ $Æx¹ ¬´Ì”² tÇ tδÆ0ÑÐÅ ìÓhÕ´ÀÉ JŵÂȲä². Tº¨º¬¹”² ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅଠ¨°<Çtº ÂÉtÇ $Æt¹ÀÉ̹ ¬¥Ç $Ƙ·´ 8Á³xÇ 28Á³ÐÅÁ”² T³ tÇÁÀ ÂÉtÇ $Æt¹ÀÉ JŵÂȲä². tÇ tδÆ0Ñ”² Í ù² ̹䴴ÅÀÉ”², ÁÀ³È<Ç\¸ Â…ºtÇ 4® ¬´Ì|¹ \ÔÜÂXÕij]¸ µÇxÇ´ÈÅ<Çpº, ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_012_NAME=Promoted Finalization-Memory from Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_012_HELP=tÇ tδÆ0Ñ”² …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ 08Á³ÐÅÁ 18Á³\¸ ÂÉtÇ ,Æ|·¬ Tº¨º¬¹ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ȹÀÉɹ GC¬ ]° ° Lµ ­0Ì´ ¬DÇ \ÔÜÂXÕpº ²È tδÆ0Ѭ DÅٲȲä². PROCESS_ID_012_NAME=Process ID PROCESS_ID_012_HELP=tÇ tδÆ0Ñ”² ¨ºÈ²0ÑÁ¹ ÉxÇ CLR Õ\¸8Á¤Â xǤÂ4ѤÂXÇ Õ\¸8Á¤Â ID|¹ \ÔÜÂiÕȲä². «Ì ˆ¼øÉ ¬D¾ÀÉ ÂÑÉ ÜÂL®ÀÉ \ÔÜ´”² ¬@Ç 0…ÇȲä². GEN0_HEAP_SIZE_COUNTER_012_NAME=Gen 0 heap size GEN0_HEAP_SIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² Gen 0ÐÅ `Õù²´ Ö¬Ç ¼tÇ¸Ò ¬ DÅȲ|· 08Á³(Gen 0)ÐÅ `Õù² ´  ˆÇ”² \ͳ ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². Gen 0 GC”² ȹÀÉɹ GC tÇÄÖÐÅ `Õù²´ ¼tǸҬ tÇ lÐ0®ô¼ä² tÐ Lµ ¸Ò¬¹p¬)´È²ä². Gen 0 lÐ0®”² ¬D¾ÀÉ ÂÑÉ0®ÐÅÁ pÈÈXÕpº QÇ©Æ Õ\¸ø­¨·tÇ ä‰Õ´”² Ù³HÅ À¼½¬ ´  ˆÇµÂȲä². Gen 0 ÂÑÉtÇ ]° ° Lµ Gen 0 ™×XÇ lÐ0®”² äÂÈ\¸ 0¼tǸÒtÇÀ»\¸ tδÆ0Ñ”² ä²LÇ Gen 0 GC|¹ ¸Ò¬¹p¬XÕ”² `Õù² lÐ0®|¹ ¼tÇ¸Ò è²Ç\¸ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¼tǸҬ `Õù² ´ LµÈ¹ä² ÅÅp³tǸÒ´ÀÉ JÅଠGC¬ ]° ° Lµ ÅÅp³tǸÒ)´È²ä². GEN1_HEAP_SIZE_COUNTER_012_NAME=Gen 1 heap size GEN1_HEAP_SIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² Gen 1XÇ \ͳ lÐ0®¬ DÅȲ|· 18Á³(Gen 1)XÇ Ö¬Ç ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². tÇ 8Á³ÐÅ”² ¬´Ì¬ ÁÉÈ `Õù²´ÀÉ JÅ<Çpº, ³à tÇ 8Á³”² tÇÈ Gen 0 GCÐÅÁ ÂÉtÇ $Æx¹ ¬´Ì\¸ l­1Á)´È²ä². tÇ tδÆ0Ñ”² ¼tǸҬ `Õù² ´ LµÈ¹ä² ÅÅp³tǸÒ´ÀÉ JÅଠGC¬ ]° ° Lµ ÅÅp³tǸÒ)´È²ä². GEN2_HEAP_SIZE_COUNTER_012_NAME=Gen 2 heap size GEN2_HEAP_SIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² 28Á³(Gen 2)XÇ Ö¬Ç ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². tÇ 8Á³ÐÅ”² ¬´Ì¬ ÁÉÈ `Õù²´ÀÉ JÅ<Çpº, ³à tÇ 8Á³”² tÇÈ Gen 1 GC Ù³HÅ Gen 1ÐÅÁ ÂÉtÇ $Æx¹ ¬´Ì\¸ l­1Á)´È²ä². tÇ tδÆ0Ñ”² ¼tǸҬ `Õù² ´ LµÈ¹ä² ÅÅp³tǸÒ´ÀÉ JÅଠGC¬ ]° ° Lµ ÅÅp³tǸÒ)´È²ä². LARGE_OBJECT_SIZE_COUNTER_012_NAME=Large Object Heap size LARGE_OBJECT_SIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ³Ö ¬´Ì ™×XÇ Ö¬Ç ¼tÇ¸Ò lÐ0®|¹ \ÔÜÂiÕȲä². „ÇĬ¬ô¼ä² pÐ ¬´Ì”² ¬D¾ÀÉ ÂÑÉ0®ÐÅÁ ³Ö ¬´Ì\¸ ˜Ì¬¹´pº, ¹Òļ\Õ ™×ÐÅ ÁÉÈ `Õù²XÕ0® Lµ8»ÐÅ tÇ ¬´Ì”² 8Á³ ¬ÐÅ ÂÉtÇ $Æt¹ÀÉ JŵÂȲä². CLR v1.1 tÇÁÀÐÅÁ tÇ „ÇĬ¬@Ç 85000¼tǸ҅ÇȲä². tÇ tδÆ0Ñ”² ¼tǸҬ `Õù² ´ LµÈ¹ä² ÅÅp³tǸÒ´ÀÉ JÅଠGC¬ ]° ° Lµ ÅÅp³tǸÒ)´È²ä². SURVIVE_FINALIZE_COUNTER_012_NAME=Finalization Survivors SURVIVE_FINALIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ´ ¬´Ì ÉÐÅÁ …È̸ ³0® ÉtÇ|·”² tÇ Ç\¸ ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅଠ¨°@Ç ¬´ÌXÇ Â|¹ \ÔÜÂiÕȲä². ¬´Ì¬ ä²x¹ ¬´Ì|¹ 8ÌpÈXÕ”² ½¬°Æ, 8ÌpÈ´”² ¬´Ìij ¬D¾ÀÉ ÂÑÉ´ÀÉ JÅÀÉ̹ tÇ tδÆ0ÑÐÅ”² \ÔÜ´ÀÉ JŵÂȲä². "Promoted Finalization-Memory from Gen 0" ¼ "Promoted Finalization-Memory from Gen 1" tδÆ0Ñ”² …È̸\¸ xÇtÕ ¨°DÅ ˆÇ”² ¨ºà´ Tº¨º¬¹|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ²È tδÆ0Ѭ DÅȲpº, ¬ GC¬ ]° ° LµÈ¹ä² ÅÅp³tǸÒ´´Å tÕù² GC¬ ‰Õ´ ÄÖ ¨°DÅ ˆÇ”² ¬´ÌXÇ Â̹DÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² …È̸\¸ xÇtÕ QÇ©Æ Õ\¸ø­¨·ÐÅ ¼ÝÀ`Õ  ˆÇ”² ”ͬ $Æ„¼äÕÜ´|¹ \ÔÜÂXÕ0® ÇtÕ µÇxÇ´ÈŵÂȲä². NUM_HANDLES_COUNTER_012_NAME=# GC Handles NUM_HANDLES_COUNTER_012_HELP=tÇ tδÆ0Ñ”² Ö¬Ç ¬À©Æ ÉxÇ GC xÕä´XÇ Â|¹ \ÔÜÂiÕȲä². GCHandles”² CLR ¼ ­¬¹´”² XÖ½¬ xÆ€½ÐÅ ˆÇ”² ¬¹ŒÁ¤ÂÐÅ ³\Õ xÕä´…ÇȲä². xÕä´@Ç GCHeapÐÅÁ È@Ç ‘ÅXÇ Tº¨º¬¹|¹ ¬À©ÆXÕÀÉ̹ ι@Ç ‘ÅXÇ ­¬¹´ÀÉ JÅ”² ¬¹ŒÁ¤Â|¹ ¬À©Æ`Õ  ˆÇµÂȲä². ALLOCATION_RATE_COUNTER_012_NAME=Allocated Bytes/sec ALLOCATION_RATE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² GC ™×ÐÅ `Õù²´”² Í ù² ¼tÇ¸Ò D¾(ÇDÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¼tǸҬ `Õù² ´ LµÈ¹ä² ÅÅp³tǸÒ´ÀÉ JÅଠ¬ GC¬ ]° ° LµÈ¹ä² ÅÅp³tǸÒ)´È²ä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². INDUCED_GC_COUNTER_012_NAME=# Induced GC INDUCED_GC_COUNTER_012_HELP=tÇ tδÆ0Ñ”² GC.CollectÐÅ ³\Õ 8ÖœÍ\¸ xÇtÕ ‰Õ´ ¬D¾ÀÉ ÂÑÉXÇ \ͳ Â|¹ \ÔÜÂiÕȲä². GCÐÅÁ tÕù² ÂÑÉ H¾Ä³|¹ ÇÙ³<Ç\¸ pÈÈXÕŒ¬ XÕ”² ƒ¬tÇ ‹ÈµÂȲä². PER_TIME_IN_GC_COUNTER_012_NAME=% Time in GC PER_TIME_IN_GC_COUNTER_012_HELP=GCÐÅÁ % ܬ@Ç È¹ÀÉɹ GC üÈ0® tÇÄÖÐÅ GC(¬D¾ÀÉ ÂÑÉ)|¹ ‰ÕXÕ”² p³ ŒÁ”Æ´ ܬXÇ 1¼„½(Ç…ÇȲä². |ǼÈ<Ç\¸ tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·DÇ ³àÂXÕìÅ, ¬D¾ÀÉ ÂÑÉ0®¬ Tº¨º¬¹|¹ ÂÑÉXÕଠUÅ•ÍXÕ0® ÇtÕ ‰Õ\Õ ‘ÇÅÅDÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¬ GC¬ ]° ° LµÈ¹ä² ÅÅp³tǸÒ´pº \ÔÜ´”² ¬@Ç ÉÓà­¬tÇ DÅ̲ ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ ˜°ÀÐŰȲä². PER_TIME_IN_GC_COUNTER_BASE_012_NAME=Not Displayed PER_TIME_IN_GC_COUNTER_BASE_012_HELP=\ÔÜ´ÀÉ JŵÂȲä². TOTAL_HEAP_SIZE_COUNTER_012_NAME=# Bytes in all Heaps TOTAL_HEAP_SIZE_COUNTER_012_HELP=tÇ tδÆ0Ñ”² Gen 0 Heap Size, Gen 1 Heap Size, Gen 2 Heap Size, Large Object Heap Size ñ´ $± ¬ tδÆ0Ñ ¬XÇ iÕDÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² GC ™×ÐÅ Ö¬Ç `Õù²´ Tº¨º¬¹|¹ ¼tÇ¸Ò è²Ç\¸ ˜°ÀÐŰȲä². TOTAL_COMMITTED_MEM_COUNTER_012_NAME=# Total committed Bytes TOTAL_COMMITTED_MEM_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ0®ÐÅÁ Ö¬Ç äÎ ¼\Õ ¬ÁÀ Tº¨º¬¹XÇ ‘ÅDÇ ¼tÇ¸Ò è²Ç\¸ \ÔÜÂiÕȲä². äÎ ¼\Õ Tº¨º¬¹”² µ¤ÂlÐ ˜ÓtÇÕÉ Ó|ÇÐÅ õ¬¬tÇ Æ}Å´ äÂÈ Tº¨º¬¹…ÇȲä². TOTAL_RESERVED_MEM_COUNTER_012_NAME=# Total reserved Bytes TOTAL_RESERVED_MEM_COUNTER_012_HELP=tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ0®ÐÅÁ Ö¬Ç Æ}Å\Õ ¬ÁÀ Tº¨º¬¹XÇ ‘ÅDÇ ¼tÇ¸Ò è²Ç\¸ \ÔÜÂiÕȲä². Æ}Å\Õ Tº¨º¬¹”² QÇ©Æ Õ\¸ø­¨·ÐÅ Æ}Å´´Å ˆÇ<Çpº µ¤ÂlÐ ¶”² üÈ Tº¨º¬¹ ˜ÓtÇÀÉÐÅÁ DÅÁÉ ¬À©ÆXÕÀÉ JÅ@Ç ¬ÁÀ Tº¨º¬¹ õ¬¬…ÇȲä². GC_PINNED_OBJECTS_012_NAME=# of Pinned Objects GC_PINNED_OBJECTS_012_HELP=tÇ tδÆ0Ñ”² ȹÀÉɹ GCÐÅÁ ¼¬¬´ à¬È ¬´ÌXÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¬D¾ÀÉ ÂÑÉ´ ™×ÐÅÁ̹ à¬È ¬´ÌXÇ Â|¹ Ĭ°ÀiÕȲä². Æ|¹ ä´´Å, Gen 0 GC”² 08Á³ ™×XÇ à¬È ¬´Ì̹ ôÅp¬iÕȲä². ¬D¾ÀÉ ÂÑÉ0®”² Tº¨º¬¹ÐÅÁ à¬È ¬´Ì|¹ tÇÙ³`Õ  ÆŵÂȲä². GC_SINKBLOCKS_012_NAME=# of Sink Blocks in use GC_SINKBLOCKS_012_HELP=tÇ tδÆ0Ñ”² Ö¬Ç ¬À©Æ ÉxÇ Ù³0®TÖ ¾]¸XÇ Â|¹ \ÔÜÂiÕȲä². Ù³0®TÖ ¾]¸@Ç Ù³0®TÖ Èô¼|¹ È¥ÇXÕ0® ÇtÕ ¬ ¬´ÌÐÅ `Õù²´”² p³tÇ0Ñ l­pÈ\¸Á, ­¬¹´”² ¬´Ì\¸XÇ }Å\Õ 8ÌpÈ|¹ ¬ÀÉpº ¬D¾ÀÉ ÂÑÉ0®|¹ µÑtÕ ¤ÂÎݲ´´Å|Å iÕȲä². Ù³0®TÖ ¾]¸ÐÅ”² Ù³0®TÖ Èô¼Ð¿ DÅȲ|· COM interop TºÀÐp³tÇ0Ñij È¥Ç`Õ  ˆÇµÂȲä². tÇ tδÆ0Ñ”² Ù³0®TÖ 0®ø¼ ÖÝÂDÇ ±4» ιtÇ ¬À©ÆˆÕDÇ Lµ ¼ÝÀ`Õ  ˆÇ”² 1Á¥² 8»È|¹ \ÔÜÂXÕ0® ÇtÕ µÇxÇ´ÈŵÂȲä². DotNetCLR_Loading_OBJECT_012_NAME=.NET CLR Loading DotNetCLR_Loading_OBJECT_012_HELP=CLR tИ·¤Â \¸T³ÐÅ ³\Õ µÑĬ…ÇȲä². LOADING_CLASSES_TOTAL_012_NAME=Total Classes Loaded LOADING_CLASSES_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ¨ºà´ ´ÅHÁ¾¬¹ÐÅ \¸Ü´´ tИ·¤ÂXÇ ²È´ Â|¹ \ÔÜÂiÕȲä². LOADING_TIME_012_NAME=% Time Loading LOADING_TIME_012_HELP=ä²LÇÐÅ ¬À©ÆXÕij]¸ Æ}Å)´È²ä². LOADING_ASMSEARCHLEN_012_NAME=Assembly Search Length LOADING_ASMSEARCHLEN_012_HELP=ä²LÇÐÅ ¬À©ÆXÕij]¸ Æ}Å)´È²ä². LOADING_LOADFAILURES_TOTAL_012_NAME=Total # of Load Failures LOADING_LOADFAILURES_TOTAL_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ \¸Ü´XÕÀÉ »º\Õ tИ·¤ÂXÇ \ͳ Â|¹ \ÔÜÂiÕȲä². ô¼HÅ €½qÈ ¶”² ˜Ç»º´ ÖÝÂ<Ç\¸ xÇtÕ tИ·¤Â|¹ \¸Ü´XÕÀÉ »º`Õ  ˆÇµÂȲä². Ç8Á\Õ ´°©Æ@Ç Õ\¸ Ó|ÇÁ¹ ÁD¾¤Â ijÀÆйDÇ 8ÌpÈXÕíÂÜÂ$Æ. LOADING_LOADFAILURES_INST_012_NAME=Rate of Load Failures LOADING_LOADFAILURES_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² \¸Ü´XÕÀÉ »º\Õ tИ·¤ÂXÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². ô¼HÅ €½qÈ ¶”² ˜Ç»º´ ÖÝÂ<Ç\¸ xÇtÕ tИ·¤Â|¹ \¸Ü´XÕÀÉ »º`Õ  ˆÇµÂȲä². Ç8Á\Õ ´°©Æ@Ç Õ\¸ Ó|ÇÁ¹ ÁD¾¤Â ijÀÆйDÇ 8ÌpÈXÕíÂÜÂ$Æ. LOADING_HEAPSIZE_012_NAME=Bytes in Loader Heap LOADING_HEAPSIZE_012_HELP=tÇ tδÆ0Ñ”² ¨ºà´ AppDomainÐÅ tИ·¤Â \¸T³¬ äÎ ¼\Õ Tº¨º¬¹ lÐ0®|¹ ¼tÇ¸Ò è²Ç\¸ \ÔÜÂiÕȲä². äÎ ¼\Õ Tº¨º¬¹”² µ¤ÂlÐ ˜ÓtÇÕÉ Ó|ÇÐÅ õ¬¬tÇ Æ}Å´ äÂÈ Tº¨º¬¹…ÇȲä². LOADING_APPDOMAINS_UNLOADED_TOTAL_012_NAME=Total appdomains unloaded LOADING_APPDOMAINS_UNLOADED_TOTAL_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ¸Å\¸Ü´´ Í AppDomainXÇ Â|¹ \ÔÜÂiÕȲä². AppDomaintÇ ìÅì· ˆ¼ \¸Ü´´à¬ ¸Å\¸Ü´´ ½¬°Æ, tÇ tδÆ0Ñ”² ¬ ¸Å\¸Ü´ ‘ÇÅÅDÇ Ä¼Ä³\¸ ˜Ì¬¹iÕȲä². LOADING_APPDOMAINS_UNLOADED_INST_012_NAME=Rate of appdomains unloaded LOADING_APPDOMAINS_UNLOADED_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² ¸Å\¸Ü´´ AppDomainXÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². LOADING_CLASSES_CUR_012_NAME=Current Classes Loaded LOADING_CLASSES_CUR_012_HELP=tÇ tδÆ0Ñ”² ¨ºà´ ´ÅHÁ¾¬¹ÐÅ Ö¬Ç \¸Ü´´ tИ·¤ÂXÇ Â|¹ \ÔÜÂiÕȲä². LOADING_CLASSES_INST_012_NAME=Rate of Classes Loaded LOADING_CLASSES_INST_012_HELP=tÇ tδÆ0Ñ”² ¨ºà´ ´ÅHÁ¾¬¹ÐÅ Í ù² \¸Ü´´ tИ·¤ÂXÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². LOADING_APPDOMAINS_CUR_012_NAME=Current appdomains LOADING_APPDOMAINS_CUR_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·ÐÅ Ö¬Ç \¸Ü´´ AppDomainXÇ Â|¹ \ÔÜÂiÕȲä². AppDomain(QÇ©Æ Õ\¸ø­¨· ijTºxÇ)@Ç Ù³|Ç\Õ Õ\¸8Á¤ÂÐÅÁ ä‰Õ´”² QÇ©Æ Õ\¸ø­¨·ä´DÇ ©¬¬¹Ü¤Ð0® ÇtÕ CLRÐÅÁ ¬À©Æ`Õ  ˆÇ”² HÅÈXÕଠ5ǵÑ1ÁˆÇ”² ˜Ì¬¹ è²Ç|¹ Èõ¬iÕȲä². LOADING_APPDOMAINS_TOTAL_012_NAME=Total Appdomains LOADING_APPDOMAINS_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ \¸Ü´´ AppDomainXÇ \ͳ Â|¹ \ÔÜÂiÕȲä². AppDomain(QÇ©Æ Õ\¸ø­¨· ijTºxÇ)@Ç Ù³|Ç\Õ Õ\¸8Á¤ÂÐÅÁ ä‰Õ´”² QÇ©Æ Õ\¸ø­¨·ä´DÇ ©¬¬¹Ü¤Ð0® ÇtÕ CLRÐÅÁ ¬À©Æ`Õ  ˆÇ”² HÅÈXÕଠ5ǵÑ1ÁˆÇ”² ˜Ì¬¹ è²Ç|¹ Èõ¬iÕȲä². LOADING_APPDOMAINS_INST_012_NAME=Rate of appdomains LOADING_APPDOMAINS_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² \¸Ü´´”² AppDomainXÇ Â|¹ \ÔÜÂiÕȲä². AppDomain(QÇ©Æ Õ\¸ø­¨· ijTºxÇ)@Ç Ù³|Ç\Õ Õ\¸8Á¤ÂÐÅÁ ä‰Õ´”² QÇ©Æ Õ\¸ø­¨·ä´DÇ ©¬¬¹Ü¤Ð0® ÇtÕ CLRÐÅÁ ¬À©Æ`Õ  ˆÇ”² HÅÈXÕଠ5ǵÑ1ÁˆÇ”² ˜Ì¬¹ è²Ç|¹ Èõ¬iÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². LOADING_ASSEMBLIES_CUR_012_NAME=Current Assemblies LOADING_ASSEMBLIES_CUR_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·XÇ ¨ºà´ AppDomainÐÅ Ö¬Ç \¸Ü´´ ´ÅHÁ¾¬¹XÇ Â|¹ \ÔÜÂiÕȲä². ìÅì· AppDomainÐÅÁ ´ÅHÁ¾¬¹¬ ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´´ ½¬°Æ, tÇ tδÆ0Ñ”² \Õ ˆ¼Ì¹ ɬiÕȲä². ´ÅHÁ¾¬¹”², tÕù² TÏÜ´¬ ¨ºà´ AppDomainÐÅÁ õ¬ Ç ´  ˆÇ”² ½¬°ÆÐÅ”² ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´ ´  ˆÇà¬, TÏÜ´¬ ¹ÒÈ AppDomain È©ÆxÇ ½¬°ÆÐÅ”² ijTºxÇļ\¸ \¸Ü´ ´  ˆÇµÂȲä². LOADING_ASSEMBLIES_TOTAL_012_NAME=Total Assemblies LOADING_ASSEMBLIES_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ \¸Ü´´ Í ´ÅHÁ¾¬¹XÇ Â|¹ \ÔÜÂiÕȲä². ìÅì· AppDomainÐÅÁ ´ÅHÁ¾¬¹¬ ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´´ ½¬°Æ, tÇ tδÆ0Ñ”² \Õ ˆ¼Ì¹ ɬiÕȲä². ´ÅHÁ¾¬¹”², tÕù² TÏÜ´¬ ¨ºà´ AppDomainÐÅÁ õ¬ Ç ´  ˆÇ”² ½¬°ÆÐÅ”² ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´ ´  ˆÇà¬, TÏÜ´¬ ¹ÒÈ AppDomain È©ÆxÇ ½¬°ÆÐÅ”² ijTºxÇļ\¸ \¸Ü´ ´  ˆÇµÂȲä². LOADING_ASSEMBLIES_INST_012_NAME=Rate of Assemblies LOADING_ASSEMBLIES_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² ¨ºà´ AppDomainÐÅ \¸Ü´´”² ´ÅHÁ¾¬¹XÇ Â|¹ \ÔÜÂiÕȲä². ìÅì· AppDomainÐÅÁ ´ÅHÁ¾¬¹¬ ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´´ ½¬°Æ, tÇ tδÆ0Ñ”² \Õ ˆ¼Ì¹ ɬiÕȲä². ´ÅHÁ¾¬¹”², tÕù² TÏÜ´¬ ¨ºà´ AppDomainÐÅÁ õ¬ Ç ´  ˆÇ”² ½¬°ÆÐÅ”² ijTºxÇ ɽ¹È<Ç\¸ \¸Ü´ ´  ˆÇà¬, TÏÜ´¬ ¹ÒÈ AppDomain È©ÆxÇ ½¬°ÆÐÅ”² ijTºxÇļ\¸ \¸Ü´ ´  ˆÇµÂȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². DotNetCLR_Jit_OBJECT_012_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_012_HELP=CLR JITÐÅ ³\Õ µÑĬ…ÇȲä². TOTAL_METHODS_JITTED_012_NAME=# of Methods Jitted TOTAL_METHODS_JITTED_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ CLR JIT ôÎ Ó|Çì·\¸ JIT(Just-In-Time) ôÎ Ó|Ç´ Í TºÁÜ´XÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0ÑÐÅ”² ø»¬¹ JIT ôÎ Ó|Ç´ TºÁÜ´”² ìÓhÕ´ÀÉ JŵÂȲä². JITTED_IL_CUR_012_NAME=# of IL Bytes Jitted JITTED_IL_CUR_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ JIT ôÎ Ó|Ç´ ILXÇ Í ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0ÑXÇ ¬@Ç "Total # of IL Bytes Jitted" tδÆ0ÑXÇ ¬ü¬ Ù³|ÇiÕȲä². JITTED_IL_TOTAL_012_NAME=Total # of IL Bytes Jitted JITTED_IL_TOTAL_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ JIT ôÎ Ó|Ç´ ILXÇ Í ¼tÇ¸Ò Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0ÑXÇ ¬@Ç "# of IL Bytes Jitted" tδÆ0ÑXÇ ¬ü¬ Ù³|ÇiÕȲä². JITTED_IL_INST_012_NAME=IL Bytes Jitted / sec JITTED_IL_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² JIT ôÎ Ó|Ç´”² ILXÇ ¼tÇ¸Ò D¾(ÇDÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². JIT_FAILURES_012_NAME=Standard Jit Failures JIT_FAILURES_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ JIT ôÎ Ó|Çì·¬ JIT ôÎ Ó|ÇXÕÀÉ »º\Õ TºÁÜ´XÇ \ͳ Â|¹ \ÔÜÂiÕȲä². ILDÇ UÖxÇ`Õ  ÆÅp¬˜° JIT ôÎ Ó|Çì· ´°€½ÐÅ $ÆX¹¬ ˆÇ”² ½¬°ÆÐÅ ôÎ Ó|Ç $ÆX¹¬ ¼ÝÀ`Õ  ˆÇµÂȲä². TIME_IN_JIT_012_NAME=% Time in Jit TIME_IN_JIT_012_HELP=tÇ tδÆ0Ñ”² ȹÀÉɹ JIT ôÎ Ó|Ç è²Ä¬ tÇÄÖÐÅ JIT ôÎ Ó|ÇÐÅ ŒÁ”Æ´ ܬXÇ 1¼„½(ÇDÇ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¬ JIT ôÎ Ó|Ç è²Ä¬¬ ]° ° LµÈ¹ä² ÅÅp³tǸÒ)´È²ä². JIT ôÎ Ó|Ç è²Ä¬”² TºÁÜ´@Æ tÕù² …ÈÁ1ÁtÇ ôÎ Ó|Ç´”² è²Ä¬|¹ ¬¬¹µÐȲä². TIME_IN_JIT_BASE_012_NAME=Not Displayed TIME_IN_JIT_BASE_012_HELP=\ÔÜ´ÀÉ JŵÂȲä². DotNetCLR_Interop_OBJECT_012_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_012_HELP=CLR interopÐÅ ³\Õ µÑĬ…ÇȲä². CURRENT_CCW_012_NAME=# of CCWs CURRENT_CCW_012_HELP=tÇ tδÆ0Ñ”² CCW(Com-Callable-Wrappers)XÇ Ö¬Ç Â|¹ \ÔÜÂiÕȲä². CCW”² .NETXÇ ­¬¹´ÀÉ JÅ”² COM tÐ|·tǸŸÒÐÅÁ 8ÌpÈXÕ”² ­¬¹´”² ¬´ÌÐÅ ³\Õ Õ]¸ÜÂ…ÇȲä². tÇ tδÆ0Ñ”² ­¬¹´ÀÉ JÅ”² COM TÏÜ´ÐÅÁ 8ÌpÈXÕ”² ­¬¹´”² ¬´ÌXÇ Â|¹ \ÔÜÂXÕ0® ÇtÕ µÇxÇ´ÈŵÂȲä². CURRENT_STUBS_012_NAME=# of Stubs CURRENT_STUBS_012_HELP=tÇ tδÆ0Ñ”² CLRÐÅÁ ̹ഠ¤ÂAÑXÇ Ö¬Ç Â|¹ \ÔÜÂiÕȲä². ¤ÂAÑ@Ç COM Interop 8ÖœÍ ¶”² PInvoke 8ÖœÍDÇ ‰ÕXÕ”² Ù³HÅ xÇ ¼ ¼XÖ ¬DÇ ­¬¹ TÏÜ´ÐÅÁ D¾­¬¹ TÏÜ´\¸ ȹìÀÁ¹iÕȲä². NUM_MARSHALLING_012_NAME=# of marshalling NUM_MARSHALLING_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ xÇ ¼ ¼XÖ ¬DÇ ­¬¹ TÏÜ´ÐÅÁ D¾­¬¹ TÏÜ´\¸ ȹìÀÁ¹\Õ Í ŸÖÂ|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ¤ÂAÑtÇ xÇ|·xÇxÇ ½¬°ÆÐÅ”² ɬXÕÀÉ JŵÂȲä². ¤ÂAÑ@Ç xÇ ¼ ¼XÖ ¬DÇ È¹ìÀÁ¹iÕȲä². |ǼÈ<Ç\¸ ¤ÂAÑ@Ç È¹ìÀÁ¹´”² $Æ„¼äÕÜ´¬ ÈDÇ Lµ xÇ|·xÇ)´È²ä². TOTAL_TLB_IMPORTS_012_NAME=# of TLB imports / sec TOTAL_TLB_IMPORTS_012_HELP=ä²LÇÐÅ ¬À©ÆXÕij]¸ Æ}Å)´È²ä². TOTAL_TLB_EXPORTS_012_NAME=# of TLB exports / sec TOTAL_TLB_EXPORTS_012_HELP=ä²LÇÐÅ ¬À©ÆXÕij]¸ Æ}Å)´È²ä². DotNetCLR_LocksAndThreads_OBJECT_012_NAME=.NET CLR LocksAndThreads DotNetCLR_LocksAndThreads_OBJECT_012_HELP=CLR  Ç® ¼ ¤Â¸Ü´ÐÅ ³\Õ µÑĬ…ÇȲä². CONTENTION_TOTAL_012_NAME=Total # of Contentions CONTENTION_TOTAL_012_HELP=tÇ tδÆ0Ñ”² CLRXÇ ¤Â¸Ü´¬ ­¬¹´”²  Ç® ÁÀÜЬ ´”² p³ äÂ(Ó\Õ Í ŸÖÂ|¹ \ÔÜÂiÕȲä². C#ÐÅÁ "lock" 8»DÇ Á¸ÅXÕp¬˜° System.Monitor.Enter|¹ 8ÖœÍXÕp¬˜° MethodImplOptions.Synchronized ¬À©ÆÇ ÀÉÈ ¹Ò1ÁDÇ ¬À©ÆXÕ”² ñ´, ìÅì· ¬ÀÉ )¼•¼<Ç\¸ ­¬¹´”²  Ç® ÁÀÜЬ ´  ˆÇµÂȲä². CONTENTION_INST_012_NAME=Contention Rate / sec CONTENTION_INST_012_HELP=ð·ÀЄÇXÇ ¤Â¸Ü´¬ ­¬¹´”²  Ç® ÁÀÜЬ ´”² p³ äÂ(Ó\Õ D¾(Ç…ÇȲä². C#ÐÅÁ "lock" 8»DÇ Á¸ÅXÕp¬˜° System.Monitor.Enter|¹ 8ÖœÍXÕp¬˜° MethodImplOptions.Synchronized ¬À©ÆÇ ÀÉÈ ¹Ò1ÁDÇ ¬À©ÆXÕ”² ñ´, ìÅì· ¬ÀÉ )¼•¼<Ç\¸ ­¬¹´”²  Ç® ÁÀÜЬ ´  ˆÇµÂȲä². QUEUE_LENGTH_CUR_012_NAME=Current Queue Length QUEUE_LENGTH_CUR_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·ÐÅÁ ­¬¹´”²  Ç®DÇ ÜÂij\Õ Í ŸÖÂ|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². QUEUE_LENGTH_TOTAL_012_NAME=Queue Length Peak QUEUE_LENGTH_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ­¬¹´”²  Ç®DÇ ÜÂij\Õ ¤Â¸Ü´XÇ ÍÂ|¹ \ÔÜÂiÕȲä². QUEUE_LENGTH_INST_012_NAME=Queue Length / sec QUEUE_LENGTH_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² QÇ©Æ Õ\¸ø­¨·ÐÅÁ  Ç®DÇ ÜÂij\Õ ¤Â¸Ü´XÇ Â|¹ \ÔÜÂiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². CURRENT_LOGICAL_THREADS_012_NAME=# of current logical Threads CURRENT_LOGICAL_THREADS_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·ÐÅ ˆÇ”² .NET ¤Â¸Ü´ ¬´ÌXÇ Ö¬Ç Â|¹ \ÔÜÂiÕȲä². .NET ¤Â¸Ü´ ¬´Ì”² System.Threading.ThreadÐÅ XÇtÕ Ì¹ä´´ÅÀÉp¬˜° ­¬¹´ÀÉ JÅ”² ¤Â¸Ü´¬ ­¬¹´”² XÖ½¬ÐŠ䴴Ŭ Lµ ̹䴴ÅÑÉȲä². tÇ tδÆ0Ñ”² äÂ‰Õ ÉxÇ ¤Â¸Ü´@Æ ÉÀÉ´ ¤Â¸Ü´ ¨ºP´|¹ ìÓhÕiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². CURRENT_PHYSICAL_THREADS_012_NAME=# of current physical Threads CURRENT_PHYSICAL_THREADS_012_HELP=tÇ tδÆ0Ñ”² .NET ¤Â¸Ü´XÇ ´°€½ ¤Â¸Ü´\¸ ¬À©Æ´Ä³]¸ CLRÐÅÁ ̹ä´à¬ ŒÁ ÇXÕ”² ÐÆÜ OS ¤Â¸Ü´XÇ Â|¹ \ÔÜÂiÕȲä². CLR ´°€½ ‘ÇÅÅÐÅ ¬À©Æ´”² ¤Â¸Ü´”² OS Õ\¸8Á¤ÂXÇ ¤Â¸Ü´ XÕÇ ÑÉiÕtÇÀ»\¸ tÇ tδÆ0Ñ ¬ÐÅ ìÓhÕ´ÀÉ JŵÂȲä². RECOGNIZED_THREADS_CUR_012_NAME=# of current recognized threads RECOGNIZED_THREADS_CUR_012_HELP=tÇ tδÆ0Ñ”² CLRÐÅÁ Ö¬Ç xÇÝÂXÕ”² ¤Â¸Ü´XÇ Â|¹ \ÔÜÂXÕpº, tÇ ¤Â¸Ü´ÐÅ”² tÕù²´”² .NET ¤Â¸Ü´ ¬´Ì¬ ˆÇµÂȲä². tÇ ¤Â¸Ü´”² CLRÐÅÁ ̹䴴ÅÀÉÀÉ JÅ<Çpº, CLR xÆ€½ÐÅÁ ̹䴴Å8È CLR ´°€½ÐÅÁ È´Åij \Õ ˆ¼ tÇÁÀ ä‰Õ´ ¤Â¸Ü´…ÇȲä². ଠÇ\Õ ¤Â¸Ü´Ì¹ ”ÍÈ´pº CLRÐÅ ä²Ü ¬À©Æ´”² ¤Â¸Ü´ ID ¶”² ¤Â¸Ü´ …È̸ ÄÖÐÅ ä²Ü ̹䴴ÅÄÉ ¤Â¸Ü´”² \Õ ˆ¼Ì¹ Ĭ°À)´È²ä². RECOGNIZED_THREADS_TOTAL_012_NAME=# of total recognized threads RECOGNIZED_THREADS_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ CLRÐÅÁ xÇÝÂ\Õ ¤Â¸Ü´XÇ ÍÂ|¹ \ÔÜÂXÕpº, tÇ ¤Â¸Ü´ÐÅ”² tÕù²´”² .NET ¤Â¸Ü´ ¬´Ì¬ ˆÇµÂȲä². tÇ ¤Â¸Ü´”² CLRÐÅÁ ̹䴴ÅÀÉÀÉ JÅ<Çpº, CLR xÆ€½ÐÅÁ ̹䴴Å8È CLR ´°€½ÐÅÁ È´Åij \Õ ˆ¼ tÇÁÀ ä‰Õ´ ¤Â¸Ü´…ÇȲä². ଠÇ\Õ ¤Â¸Ü´Ì¹ ”ÍÈ´pº CLRÐÅ ä²Ü ¬À©Æ´”² ¤Â¸Ü´ ID ¶”² ¤Â¸Ü´ …È̸ ÄÖÐÅ ä²Ü ̹䴴ÅÄÉ ¤Â¸Ü´”² \Õ ˆ¼Ì¹ Ĭ°À)´È²ä². RECOGNIZED_THREADS_INST_012_NAME=rate of recognized threads / sec RECOGNIZED_THREADS_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² CLRÐÅÁ xÇÝÂ\Õ ¤Â¸Ü´XÇ Â|¹ \ÔÜÂXÕpº, tÇ ¤Â¸Ü´ÐÅ”² tÕù²´”² .NET ¤Â¸Ü´ ¬´Ì¬ ˆÇµÂȲä². tÇ ¤Â¸Ü´”² CLRÐÅÁ ̹䴴ÅÀÉÀÉ JÅ<Çpº, CLR xÆ€½ÐÅÁ ̹䴴Å8È CLR ´°€½ÐÅÁ È´Åij \Õ ˆ¼ tÇÁÀ ä‰Õ´ ¤Â¸Ü´…ÇȲä². ଠÇ\Õ ¤Â¸Ü´Ì¹ ”ÍÈ´pº CLRÐÅ ä²Ü ¬À©Æ´”² ¤Â¸Ü´ ID ¶”² ¤Â¸Ü´ …È̸ ÄÖÐÅ ä²Ü ̹䴴ÅÄÉ ¤Â¸Ü´”² \Õ ˆ¼Ì¹ Ĭ°À)´È²ä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². DotNetCLR_Security_OBJECT_012_NAME=.NET CLR Security DotNetCLR_Security_OBJECT_012_HELP=CLR ô¼HÅÐÅ ³\Õ µÑĬ…ÇȲä². SECURITY_TOTALRTCHECKS_012_NAME=Total Runtime Checks SECURITY_TOTALRTCHECKS_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ‰Õ´ ð·ÀÐ„Ç CAS(TÏÜ´ aÅ8Á¤Â ô¼HÅ) €¬¬ÀXÇ ÍÂ|¹ \ÔÜÂiÕȲä². ð·ÀÐ„Ç CAS €¬¬À”² ¹ÒÈ Œ­\ÕDÇ ”Æ­ÌXÕ0® ÇtÕ 8ÖœÍǬ 8ÖœÍ ÂàÂÇ|¹ 8ÖœÍ`Õ Lµ ¼ÝÀiÕȲä². ð·ÀÐ„Ç €¬¬À”² 8ÖœÍÇXÇ ¬ 8ÖœÍÐÅ ³tÕ ‰Õ´pº, 8ÖœÍÇXÇ Ö¬Ç ¤Â¸Ü´ ¤ÂÝÐDÇ €¬¬ÀiÕȲä². tÇ tδÆ0Ñ|¹ "Stack Walk Depth"@Æ hÕØ® ¬À©ÆXÕtº ô¼HÅ €¬¬ÀXÇ 1Á¥² ÈXÕ ìÅ€½|¹ LÅ  ˆÇµÂȲä². SECURITY_TIMEAUTHORIZE_012_NAME=% Time Sig. Authenticating SECURITY_TIMEAUTHORIZE_012_HELP=ä²LÇÐÅ ¬À©ÆXÕij]¸ Æ}Å)´È²ä². SECURITY_LINKCHECKS_012_NAME=# Link Time Checks SECURITY_LINKCHECKS_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ‰Õ´ Á¹lÐÀÐ„Ç CAS(TÏÜ´ aÅ8Á¤Â ô¼HÅ) €¬¬ÀXÇ ÍÂ|¹ \ÔÜÂiÕȲä². Á¹lÐÀÐ„Ç CAS €¬¬À”² JIT ôÎ Ó|Ç Ü ¹ÒÈ Œ­\ÕDÇ ”Æ­ÌXÕ0® ÇtÕ 8ÖœÍǬ 8ÖœÍ ÂàÂÇ|¹ 8ÖœÍ`Õ Lµ ¼ÝÀiÕȲä². Á¹lÐÀÐ„Ç €¬¬À”² 8ÖœÍÇù² \Õ ˆ¼)Å ‰Õ)´È²ä². tÇ tδÆ0ÑXÇ ¬@Ç ô¼HŠܤÂ\ÑXÇ \ÖÙ³DÇ \ÔÜÂ`Õ Ð¿ ì¬\Õ 1Á¥² 8»È|¹ XÇø»XÕÀÉ”² JŵÂȲä². SECURITY_TIMERTCHECKS_012_NAME=% Time in RT checks SECURITY_TIMERTCHECKS_012_HELP=tÇ tδÆ0Ñ”² ȹÀÉɹ CAS(TÏÜ´ aÅ8Á¤Â ô¼HÅ) €¬¬À tÇÄÖÐÅ ð·ÀÐ„Ç CAS €¬¬À|¹ ‰ÕXÕ”² p³ ŒÁ”Æ´ ܬXÇ 1¼„½(ÇDÇ \ÔÜÂiÕȲä². CAS|¹ ¬À©ÆXÕtº Á\¸ ä²x¹ ÂÉ<Ç\¸ TÏÜ´|¹ à°¸`Õ  ˆÇ<Çpº TÏÜ´ IDÐÅ 0µ|· tÇì·\Õ à°¸ ÂÉDÇ È©Æ`Õ  ˆÇµÂȲä². tÇ tδÆ0Ñ”² ð·ÀÐ„Ç ô¼HÅ €¬¬À¬ ]° ° Lµ ÅÅp³tǸÒ)´È²ä². tÇ tδÆ0ÑXÇ ¬@Ç ÉÓà­¬tÇ DÅȲ|· ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². SECURITY_TIMERTCHECKS_BASE_012_NAME=Not Displayed SECURITY_TIMERTCHECKS_BASE_012_HELP=\ÔÜ´ÀÉ JŵÂȲä². SECURITY_DEPTHSECURITY_012_NAME=Stack Walk Depth SECURITY_DEPTHSECURITY_012_HELP=tÇ tδÆ0Ñ”² ȹÀÉɹ CAS €¬¬À ijHÅXÇ ¤ÂÝÐ J®tÇ|¹ \ÔÜÂiÕȲä². ð·ÀÐ„Ç CAS €¬¬À”² ¤ÂÝÐDÇ ÐÐÉÀXÕìÅ ‰Õ)´È²ä². tÇ tδÆ0Ñ”² ÉÓà­¬tÇ DÅȲ|· ȹÀÉɹ<Ç\¸ ­0Ì´ ¬DÇ \ÔÜÂiÕȲä². DotNetCLR_Remoting_OBJECT_012_NAME=.NET CLR Remoting DotNetCLR_Remoting_OBJECT_012_HELP=CLR RemotingÐÅ ³\Õ µÑĬ…ÇȲä². CONTEXT_REMOTECALLS_INST_012_NAME=Remote Calls/sec CONTEXT_REMOTECALLS_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² 8֜ʹ”² ÐÆ©¬ Õ\¸ÜÂÈ 8ÖœÍ Â|¹ \ÔÜÂiÕȲä². ÐÆ©¬ Õ\¸ÜÂÈ 8ÖœÍ@Ç 8ÖœÍÇXÇ AppDomain xÆ€½ÐÅ ˆÇ”² ¬´ÌÐÅ ³\Õ 8֜ͅÇȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². CONTEXT_CHANNELS_012_NAME=Channels CONTEXT_CHANNELS_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ ¨ºà´ AppDomainÐÅ ñ´]¸´ ÐÆ©¬ ḎXÇ ÍÂ|¹ \ÔÜÂiÕȲä². Ḏ@Ç ÐÆ©¬ ¬´Ì ¬ÐÅ TºÜÂÀÉ|¹ È¡ÁXÕ”² p³ ¬À©Æ)´È²ä². CONTEXT_PROXIES_012_NAME=Context Proxies CONTEXT_PROXIES_012_HELP=tÇ tδÆ0Ñ”² Õ\¸8Á¤Â¬ Ü‘Ç´ tÇÄÖЊ̹䴴ÅÄÉ ÐÆ©¬ Õ]¸Ü ¬´ÌXÇ ÍÂ|¹ \ÔÜÂiÕȲä². Õ]¸Ü”² ÐÆ©¬ ¬´Ì|¹ ³\ÔXÕpº, Õ]¸ÜÂÐÅ ³\Õ ¨ºà´ 8ÖœÍtÇ ,Ƽx¹ ÐÆ©¬ ¬´Ì xǤÂ4ѤÂÐÅ È체ij]¸ iÕȲä². CONTEXT_CLASSES_012_NAME=Context-Bound Classes Loaded CONTEXT_CLASSES_012_HELP=tÇ tδÆ0Ñ”² Ö¬Ç \¸Ü´´ èÎMÑ¤Â¸Ò ¼xÇ)µ´ tИ·¤ÂXÇ Â|¹ \ÔÜÂiÕȲä². èÎMѤ¸ÒÐÅ ¼xÇ)µ`Õ  ˆÇ”² tИ·¤Â|¹ èÎMѤ¸ÒÐÅ ¼xÇ)µ´ tИ·¤Â|·à¬ iÕȲä². èÎMѤ¸ÒÐÅ ¼xÇ)µ´ tИ·¤ÂÐÅ”², Ù³0®TÖ, ¤Â¸Ü´ Á8Öij, ¸Òœ·­ÇXÁ ñ´ÐÅ ³\Õ ¬À©Æ Ü­YÎDÇ Èõ¬XÕ”² èÎMÑ¤Â¸Ò ¹Ò1ÁtÇ \ÔÜÂ)´È²ä². CONTEXT_OBJALLOC_012_NAME=Context-Bound Objects Alloc / sec CONTEXT_OBJALLOC_012_HELP=tÇ tδÆ0Ñ”² Í ù² `Õù²´”² èÎMÑ¤Â¸Ò ¼xÇ)µ ¬´ÌXÇ Â|¹ \ÔÜÂiÕȲä². èÎMѤ¸ÒÐÅ ¼xÇ)µ`Õ  ˆÇ”² tИ·¤ÂXÇ xǤÂ4ѤÂ|¹ èÎMÑ¤Â¸Ò ¼xÇ)µ ¬´Ì|·à¬ iÕȲä². èÎMÑ¤Â¸Ò ¼xÇ)µ tИ·¤ÂÐÅ”², Ù³0®TÖ, ¤Â¸Ü´ Á8Öij, ¸Òœ·­ÇXÁ ñ´ÐÅ ³\Õ ¬À©Æ Ü­YÎDÇ Èõ¬XÕ”² èÎMÑ¤Â¸Ò ¹Ò1ÁtÇ \ÔÜÂ)´È²ä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². CONTEXT_CONTEXTS_012_NAME=Contexts CONTEXT_CONTEXTS_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·ÐÅ ˆÇ”² ÐÆ©¬ èÎMѤ¸ÒXÇ Ö¬Ç Â|¹ \ÔÜÂiÕȲä². èÎMѤ¸Ҕ² Ù³0®TÖ, ¤Â¸Ü´ Á8Öij, ¸Òœ·­ÇXÁ ñ´ü¬ ¬tÇ Ù³|Ç\Õ ¬À©Æ Ü­YÎDÇ ¬ÀÉ”² ¬´ÌXÇ ìÎ ¸XÁDÇ ìÓhÕXÕ”² ½¬Ä¬…ÇȲä². CONTEXT_REMOTECALLS_TOTAL_012_NAME=Total Remote Calls CONTEXT_REMOTECALLS_TOTAL_012_HELP=tÇ tδÆ0Ñ”² tÇ QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ 8֜ʹ Í ÐÆ©¬ Õ\¸ÜÂÈXÇ 8ÖœÍ Â|¹ \ÔÜÂiÕȲä². ÐÆ©¬ Õ\¸ÜÂÈ 8ÖœÍ@Ç 8ÖœÍÇXÇ AppDomain xÆ€½ÐÅ ˆÇ”² ¬´ÌÐÅ ³\Õ 8֜ͅÇȲä². DotNetCLR_Excep_OBJECT_012_NAME=.NET CLR Exceptions DotNetCLR_Excep_OBJECT_012_HELP=CLR ÆxÆ ˜Ì¬¹ÐÅ ³\Õ ð·ÀÐ„Ç µÑĬ…ÇȲä². EXCEP_THROWN_TOTAL_012_NAME=# of Exceps Thrown EXCEP_THROWN_TOTAL_012_HELP=tÇ tδÆ0Ñ”² QÇ©Æ Õ\¸ø­¨·tÇ Ü‘Ç´ tÇÄÖÐÅ throw´ Í ÆxÆXÇ Â|¹ \ÔÜÂiÕȲä². ìÅ0®ÐÅ”² .NET ÆxÆ ¼ .NET ÆxÆ\¸ À¼XÖ´”² ­¬¹´ÀÉ JÅ”² ÆxƬ ìÓhÕ)´È²ä². Æ|¹ ä´´Å D¾­¬¹ TÏÜ´XÇ null ìÓxÇ0Ñ 8ÌpÈ ÆxÆ”² ­¬¹ TÏÜ´ÐÅÁ .NET System.NullReferenceException<Ç\¸ ä²Ü throw)´È²ä². tÇ tδÆ0ÑÐÅ”² ˜Ì¬¹´”² ÆxÆ@Æ ˜Ì¬¹´ÀÉ JÅ”² ÆxƬ ¨ºP´ ìÓhÕ)´È²ä². ä²Ü throw´”² ÆxÆ”² tÇ tδÆ0ÑÐÅ ä²Ü Ĭ°À)´È²ä². ÆxÆ”² DÅüÈ Ü´8» ½¬°ÆÐÅ̹ ˜°ÀИ°|Å XÕpº Õ\¸ø­¨·XÇ ÈÁÀÈxÇ È´Å Pׄ¹ÐÅ”² tȬÇXÕÀÉ JŵÂȲä². EXCEP_THROWN_INST_012_NAME=# of Exceps Thrown / sec EXCEP_THROWN_INST_012_HELP=tÇ tδÆ0Ñ”² Í ù² throw´”² ÆxÆXÇ Â|¹ \ÔÜÂiÕȲä². ìÅ0®ÐÅ”² .NET ÆxÆ ¼ .NET ÆxÆ\¸ À¼XÖ´”² ­¬¹´ÀÉ JÅ”² ÆxƬ ìÓhÕ)´È²ä². Æ|¹ ä´´Å D¾­¬¹ TÏÜ´ÐÅÁXÇ null ìÓxÇ0Ñ 8ÌpÈ ÆxÆ”² ­¬¹ TÏÜ´ÐÅÁ .NET System.NullReferenceException<Ç\¸ ä²Ü throw)´È²ä². tÇ tδÆ0ÑÐÅ”² ˜Ì¬¹´”² ÆxÆ@Æ ˜Ì¬¹´ÀÉ JÅ”² ÆxƬ ¨ºP´ ìÓhÕ)´È²ä². ä²Ü throw´”² ÆxÆ”² tÇ tδÆ0ÑÐÅ ä²Ü Ĭ°À)´È²ä². ÆxÆ”² DÅüÈ Ü´8» ½¬°ÆÐÅ̹ ˜°ÀИ°|Å XÕpº Õ\¸ø­¨·XÇ ÈÁÀÈxÇ È´Å Pׄ¹ÐÅ”² tȬÇXÕÀÉ JŵÂȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². TOTAL_EXCEP_FILTERS_RUN_012_NAME=# of Filters / sec TOTAL_EXCEP_FILTERS_RUN_012_HELP=tÇ tδÆ0Ñ”² Í ù² ä‰Õ´ .NET ÆxÆ DÕ0ÑXÇ Â|¹ \ÔÜÂiÕȲä². ÆxÆ DÕ0Ñ”² ÆxÆ|¹ ˜Ì¬¹`ÕÀÉ ìÅ€½|¹ UÖxÇiÕȲä². tÇ tδÆ0Ñ”² ÆxƬ ˜Ì¬¹´ÈÅ”²ÀÉ ìÅ€½@Æ”² ÁÀ­ ÆÅtÇ, ä‰Õ´ ÆxÆ DÕ0ÑXÇ D¾(ÇDÇ ”ÍÈiÕȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². TOTAL_EXCEP_FINALLYS_RUN_012_NAME=# of Finallys / sec TOTAL_EXCEP_FINALLYS_RUN_012_HELP=tÇ tδÆ0Ñ”² Í ù² ä‰Õ´ finally ¾]¸XÇ Â|¹ \ÔÜÂiÕȲä². finally ¾]¸@Ç try ¾]¸tÇ …È̸´ )¼ÝÂÐÅ ­Ä¬ ÆÅtÇ ä‰Õ)´È²ä². tÇ tδÆ0Ñ”² ÆxÆÐÅ ³tÕ ä‰Õ´ finally ¾]¸Ì¹DÇ Ä¬°ÀXÕpº |Ǽ TÏÜ´ ½¬\¸ÐÅ ³\Õ finally ¾]¸@Ç Ä¬°ÀXÕÀÉ JŵÂȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². EXCEPT_STACK_DEPTH_012_NAME=Throw To Catch Depth / sec EXCEPT_STACK_DEPTH_012_HELP=tÇ tδÆ0Ñ”² Í ù² .NET ÆxÆ|¹ throw\Õ Õ¸„ÇÐÅÁ ÆxÆ|¹ ˜Ì¬¹\Õ Õ¸„Ç<Ç\¸ À¼XÖ´ ¤ÂÝÐ Õ¸„ÇXÇ Â|¹ \ÔÜÂiÕȲä². ÆxÆ ˜Ì¬¹0®¬ ä‰Õ´tº tÇ tδÆ0ÑXÇ ¬@Ç 0<Ç\¸ ä²Ü $ÁÈ)´È²ä². 0µ|·Á É©Ì´ ÆxÆ”² ˜Ì¬¹0® ¬XÇ ¤ÂÝÐ J®tÇ|¹ ˜°ÀÐŰȲä². tÇ tδÆ0Ñ”² ܬù² ÉÓà­¬DÇ ˜°Àд°”² ƒ¬tÇ DÅȲ|· ȹÀÉɹ P´ ØÀ ÕÐÅÁ ­0Ì´ ¬XÇ (ÌtÇ|¹ ØÀ Õ ¬ ¬©¬<Ç\¸ ˜°² ¬DÇ \ÔÜÂiÕȲä². DotNetCLR_Memory_OBJECT_013_NAME=. NET CLR-geheugen DotNetCLR_Memory_OBJECT_013_HELP=Tellers voor CLR-garbagecollection. GEN0_COLLECTIONS_COUNTER_013_NAME=Aantal verzamelingen van generatie 0 GEN0_COLLECTIONS_COUNTER_013_HELP=Met deze teller wordt het aantal keren aangegeven dat generatie 0-objecten (de jongste, meest recentelijk toegewezen) door de Garbage Collector zijn verzameld (Gen 0 GC) sinds de toepassing is gestart. Gen 0 GC vindt plaats als het beschikbare geheugen in generatie 0 onvoldoende is om aan een toewijzingsaanvraag te voldoen. De teller wordt aan het einde van een Gen 0 GC vergroot. GC's van een hogere generatie bevatten alle GC's van een lagere generatie. Deze teller wordt expliciet verhoogd als garbagecollection van een hogere generatie (Gen 1 of Gen 2) plaatsvindt. De waarde voor _Global_ counter is niet nauwkeurig en dient te worden genegeerd. Met deze teller wordt de laatst waargenomen waarde bijgehouden. GEN1_COLLECTIONS_COUNTER_013_NAME=Aantal verzamelingen van generatie 1 GEN1_COLLECTIONS_COUNTER_013_HELP=Met deze teller wordt het aantal keren aangegeven dat generatie 1-objecten door de Garbage Collector zijn verzameld sinds de toepassing is gestart. Aan het einde van een Gen 1 GC wordt de teller verhoogd. GC's van een hogere generatie bevatten alle GC's van een lagere generatie. Deze teller wordt expliciet verhoogd als garbagecollection van een hogere generatie (Gen 2) plaatsvindt. De waarde voor _Global_ counter is niet nauwkeurig en dient te worden genegeerd. Met deze teller wordt de laatst waargenomen waarde bijgehouden. GEN2_COLLECTIONS_COUNTER_013_NAME=Aantal verzamelingen van generatie 2 GEN2_COLLECTIONS_COUNTER_013_HELP=Met deze teller wordt het aantal keren aangegeven dat generatie 2-objecten (ouder) door de Garbage Collector zijn verzameld sinds de toepassing is gestart. Aan het einde van een Gen 2 GC (ook wel volledige GC genoemd) wordt de teller verhoogd. De waarde voor _Global_ counter is niet nauwkeurig en dient te worden genegeerd. Met deze teller wordt de laatst waargenomen waarde bijgehouden. GEN0_BYTES_PROMOTED_COUNTER_013_NAME=Bevorderd geheugen uit generatie 0 GEN0_BYTES_PROMOTED_COUNTER_013_HELP=Met deze teller wordt het aantal bytes aan geheugen weergegeven dat garbagecollection (GC) heeft overleefd en van generatie 0 naar generatie 1 wordt bevorderd. Objecten die uitsluitend worden bevorderd omdat ze nog moeten worden voltooid, worden niet opgenomen in deze telling. Met deze teller wordt de waarde weergegeven die aan het einde van de laatste GC is waargenomen; het is geen cumulatieve teller. GEN1_BYTES_PROMOTED_COUNTER_013_NAME=Bevorderd geheugen uit generatie 1 GEN1_BYTES_PROMOTED_COUNTER_013_HELP=Met deze teller wordt het aantal bytes aan geheugen weergegeven dat garbagecollection (GC) heeft overleefd en van generatie 1 naar generatie 2 wordt bevorderd. Objecten die uitsluitend worden bevorderd omdat ze nog moeten worden voltooid, worden niet opgenomen in deze telling. Met deze teller wordt de waarde weergegeven die aan het einde van de laatste GC is waargenomen; het is geen cumulatieve teller. De teller wordt opnieuw op 0 ingesteld als de laatste GC uitsluitend een Gen 0 GC was. GEN0_PROMOTION_RATE_013_NAME=Uit generatie 0 bevorderde bytes/sec. GEN0_PROMOTION_RATE_013_HELP=Met deze teller wordt het aantal bytes per seconde bijgehouden dat van generatie 0 (jongste) naar generatie 1 wordt bevorderd. Objecten die uitsluitend worden bevorderd omdat ze nog moeten worden voltooid, worden niet opgenomen in deze telling. Geheugen wordt bevorderd wanneer het een garbagecollection overleeft. Deze teller is ontworpen als indicator van relatief langlevende objecten die per seconde worden gemaakt. Met de teller wordt het waargenomen verschil tussen de waarden in de laatste twee controles gedeeld door de duur van het controle-interval. GEN1_PROMOTION_RATE_013_NAME=Uit generatie 1 bevorderde bytes/sec. GEN1_PROMOTION_RATE_013_HELP=Met deze teller wordt het aantal bytes per seconde bijgehouden dat van generatie 1 naar generatie 2 (oudste) wordt bevorderd. Objecten die uitsluitend worden bevorderd omdat ze nog moeten worden voltooid, worden niet opgenomen in deze telling. Geheugen wordt bevorderd wanneer het een garbagecollection overleeft. Uit generatie 2 wordt niets bevorderd, omdat dit de oudste generatie is. Deze teller is ontworpen als indicator van zeer langlevende objecten die per seconde worden gemaakt. Met deze teller wordt het waargenomen verschil tussen de waarden in de laatste twee controles gedeeld door de duur van het controle-interval. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_013_NAME=Uit generatie 0 bevorderd voltooiingsgeheugen GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_013_HELP=Door deze teller worden de bytes aan geheugen weergegeven die van generatie 0 naar generatie 1 worden bevorderd omdat ze nog moeten worden voltooid. Met deze teller wordt de waarde aan het einde van de laatste GC weergegeven; het is geen cumulatieve teller. PROCESS_ID_013_NAME=Proces-id PROCESS_ID_013_HELP=Deze teller laat de proces-id zien van het CLR-procesexemplaar dat wordt gevolgd. De weergegeven waarde wordt 0 na de eerste garbagecollection. GEN0_HEAP_SIZE_COUNTER_013_NAME=Heap-grootte in generatie 0 GEN0_HEAP_SIZE_COUNTER_013_HELP=Met deze teller wordt het maximum aantal bytes weergegeven dat in generatie 0 (Gen 0) kan worden toegewezen. Het huidige toegewezen aantal bytes in generatie 0 wordt niet door deze teller weergegeven. Een Gen 0 GC wordt gestart wanneer de toewijzingen sinds de laatste GC dit aantal bytes overschrijden. De grootte van generatie 0 wordt door de Garbage Collector aangegeven en kan tijdens het uitvoeren van de toepassing veranderen. Aan het einde van een generatie 0-verzameling is de heap-grootte van generatie 0 gelijk aan 0 bytes. Met de teller wordt de toewijzingsgrootte (in bytes) weergegeven, waarbij het uitvoeren van de volgende Gen 0 GC wordt gestart. De teller wordt aan het einde van een GC bijgewerkt en niet na elke toewijzing. GEN1_HEAP_SIZE_COUNTER_013_NAME=Heap-grootte in generatie 1 GEN1_HEAP_SIZE_COUNTER_013_HELP=Met deze teller wordt het huidige aantal bytes in generatie 1 (Gen 1) aangegeven. De teller geeft niet de maximale grootte van generatie 1 aan. Objecten worden in deze generatie niet direct toegewezen, maar worden bevorderd uit eerdere GC's in generatie 0. De teller wordt aan het einde van een GC bijgewerkt en niet bij elke toewijzing. GEN2_HEAP_SIZE_COUNTER_013_NAME=Heap-grootte in generatie 2 GEN2_HEAP_SIZE_COUNTER_013_HELP=Met deze teller wordt het huidige aantal bytes in generatie 2 (Gen 2) aangegeven. Objecten worden in deze generatie niet direct toegewezen, maar worden bevorderd uit eerdere GC's in generatie 1. De teller wordt aan het einde van een GC bijgewerkt en niet bij elke toewijzing. LARGE_OBJECT_SIZE_COUNTER_013_NAME=Grootte van object-heap voor grote objecten LARGE_OBJECT_SIZE_COUNTER_013_HELP=Met deze teller wordt de huidige grootte van de object-heap voor grote objecten in bytes weergegeven. Objecten die groter zijn dan een drempelwaarde, worden door de Garbage Collector als groot object beschouwd en worden direct in een speciale heap toegewezen en niet naar een andere generatie bevorderd. In CLR v1.1 en hoger is deze drempelwaarde gelijk aan 85000 bytes. Deze teller wordt aan het einde van een GC bijgewerkt en niet bij elke toewijzing. SURVIVE_FINALIZE_COUNTER_013_NAME=Overlevers vanwege voltooiing SURVIVE_FINALIZE_COUNTER_013_HELP=Met deze teller wordt het aantal objecten weergegeven dat met garbagecollection is verkregen en een verzameling overleeft omdat ze nog moeten worden voltooid. Als deze objecten verwijzingen naar andere objecten bevatten, overleven die objecten wel maar worden ze niet geteld. Al het geheugen dat vanwege voltooiing heeft overleefd, wordt weergegeven met de tellers 'Uit generatie 0 bevorderd voltooiingsgeheugen' en 'Uit generatie 1 bevorderd voltooiingsgeheugen'. Dit is geen cumulatieve teller, maar wordt aan het einde van elke GC met alleen het aantal overlevenden gedurende deze specifieke GC bijgewerkt. Deze teller is ontworpen om de extra overhead aan te geven die de toepassing mogelijk vanwege voltooiing oploopt. NUM_HANDLES_COUNTER_013_NAME=Aantal GC-koppelingen NUM_HANDLES_COUNTER_013_HELP=Met deze teller wordt het momenteel gebruikte aantal GC-ingangen aangegeven. GC-ingangen zijn ingangen naar bronnen buiten CLR en de beheerde omgeving. Ingangen nemen kleine hoeveelheden geheugen in de GC-heap in beslag maar mogelijk dure onbeheerde hulpbronnen. ALLOCATION_RATE_COUNTER_013_NAME=Toegewezen bytes/sec. ALLOCATION_RATE_COUNTER_013_HELP=Met deze teller wordt het aantal bytes aangegeven dat per seconde aan de GC-heap wordt toegewezen. De teller wordt aan het einde van elke GC bijgewerkt en niet na elke toewijzing. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. INDUCED_GC_COUNTER_013_NAME=Aantal aangeroepen GC's INDUCED_GC_COUNTER_013_HELP=Met deze teller wordt het hoogste aantal keren aangegeven dat een garbagecollection heeft plaatsgevonden als gevolg van de expliciete aanroep GC.Collect. Het wordt aanbevolen de frequentie voor het verzamelen door de GC te laten bepalen. PER_TIME_IN_GC_COUNTER_013_NAME=GC-tijd in % PER_TIME_IN_GC_COUNTER_013_HELP=GC-tijd in % is tijd die is gespendeerd aan het uitvoeren van een garbagecollection sinds de laatste GC-cyclus. Deze teller is meestal een indicator van het werk dat door de Garbage Collector voor de toepassing is uitgevoerd om geheugen te verzamelen en comprimeren. Deze teller wordt alleen aan het einde van elke GC bijgewerkt. De waarde geeft de laatst waargenomen waarde weer en geen gemiddelde. PER_TIME_IN_GC_COUNTER_BASE_013_NAME=Niet weergegeven PER_TIME_IN_GC_COUNTER_BASE_013_HELP=Niet weergegeven. TOTAL_HEAP_SIZE_COUNTER_013_NAME=Aantal bytes in alle heaps TOTAL_HEAP_SIZE_COUNTER_013_HELP=Met deze teller wordt de som van vier andere tellers weergegeven: Heap-grootte in generatie 0, Heap-grootte in generatie 1, Heap-grootte in generatie 2 en Grootte van object-heap voor grote objecten. Het momenteel toegewezen geheugen in bytes op de GC-heaps wordt met de teller aangegeven. TOTAL_COMMITTED_MEM_COUNTER_013_NAME=Totaal aantal toegewezen bytes TOTAL_COMMITTED_MEM_COUNTER_013_HELP=Met deze teller wordt de hoeveelheid virtueel geheugen (in bytes) aangegeven die momenteel door de Garbage Collector is toegewezen. (Toegewezen geheugen is het fysieke geheugen waarvoor ruimte op het schijfwisselbestand is gereserveerd). TOTAL_RESERVED_MEM_COUNTER_013_NAME=Totaal aantal gereserveerde bytes TOTAL_RESERVED_MEM_COUNTER_013_HELP=Met deze teller wordt de hoeveelheid virtueel geheugen (in bytes) aangegeven die momenteel door de Garbage Collector is gereserveerd. (Gereserveerd geheugen is de virtuele hoeveelheid geheugen die voor de toepassing is gereserveerd, maar waarvoor geen gebruik is gemaakt van een schijf of pagina's in het hoofdgeheugen.) GC_PINNED_OBJECTS_013_NAME=Aantal vastgemaakte objecten GC_PINNED_OBJECTS_013_HELP=Met deze teller wordt het aantal vastgemaakte objecten aangegeven dat tijdens de laatste GC is gevonden. Alleen vastgemaakte objecten in heaps die tijdens garbagecollection zijn verzameld worden geregistreerd. Een GC van generatie 0 levert bijvoorbeeld alleen een opsomming van vastgemaakte objecten in de heap van generatie 0 op. Een vastgemaakt object kan door de Garbage Collector niet in het geheugen worden geplaatst. GC_SINKBLOCKS_013_NAME=Aantal gebruikte synchronisatieblokken GC_SINKBLOCKS_013_HELP=Met deze teller wordt het momenteel gebruikte aantal synchronisatieblokken aangegeven. Synchronisatieblokken zijn op object geordende gegevensstructuren die worden aangewezen voor de opslag van synchronisatiegegevens. Synchronisatieblokken bevatten zwakke verwijzingen naar begeleide objecten en moeten door de Garbage Collector worden gescand. Synchronisatieblokken zijn niet beperkt tot het opslaan van synchronisatiegegevens maar kunnen tevens COM-interop-metagegevens opslaan. Deze teller is ontworpen om prestatieproblemen bij veelvuldig gebruik van synchronisatieprimitieven aan te geven. DotNetCLR_Loading_OBJECT_013_NAME=.NET CLR-laadgegevens DotNetCLR_Loading_OBJECT_013_HELP=Statistieken voor het CLR-programma voor het laden van klassen. LOADING_CLASSES_TOTAL_013_NAME=Totaal aantal geladen klassen LOADING_CLASSES_TOTAL_013_HELP=Met deze teller wordt het cumulatieve aantal klassen aangegeven dat sinds de start van de toepassing in alle assembly's is geladen. LOADING_TIME_013_NAME=Laadtijd in % LOADING_TIME_013_HELP=Gereserveerd voor toekomstig gebruik. LOADING_ASMSEARCHLEN_013_NAME=Zoeklengte van assembly LOADING_ASMSEARCHLEN_013_HELP=Gereserveerd voor toekomstig gebruik. LOADING_LOADFAILURES_TOTAL_013_NAME=Totaal aantal mislukte laadpogingen LOADING_LOADFAILURES_TOTAL_013_HELP=Met deze teller wordt het hoogste aantal klassen aangegeven sinds de toepassing is gestart waarvoor het laden is mislukt. Dit mislukken kan vele oorzaken hebben, zoals onvoldoende beveiliging of een ongeldige indeling. Meer details worden in de Help voor profielservices gegeven. LOADING_LOADFAILURES_INST_013_NAME=Frequentie van mislukte laadpogingen LOADING_LOADFAILURES_INST_013_HELP=Met deze teller wordt het aantal klassen per seconde aangegeven waarvoor het laden is mislukt. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. Dit mislukken kan vele oorzaken hebben, zoals onvoldoende beveiliging of een ongeldige indeling. Meer details worden in de Help voor profielservices gegeven. LOADING_HEAPSIZE_013_NAME=Bytes in laad-heap LOADING_HEAPSIZE_013_HELP=Deze teller geeft de huidige grootte weer (in bytes) van het geheugen dat is toegekend door de klassenlader voor alle AppDomains. (Het toegekende geheugen is het fysieke geheugen waarvoor ruimte is gereserveerd in het schijfwisselbestand.) LOADING_APPDOMAINS_UNLOADED_TOTAL_013_NAME=Totaal aantal appdomains dat is verwijderd LOADING_APPDOMAINS_UNLOADED_TOTAL_013_HELP=Deze teller geeft het totaal aantal AppDomains weer dat is verwijderd sinds de toepassing is gestart. Als een AppDomain meerdere keren wordt geladen en verwijderd, wordt elke verwijdering afzonderlijk meegeteld. LOADING_APPDOMAINS_UNLOADED_INST_013_NAME=Frequentie waarmee appdomains worden verwijderd LOADING_APPDOMAINS_UNLOADED_INST_013_HELP=Deze teller geeft het aantal AppDomains weer dat per seconde wordt verwijderd. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. LOADING_CLASSES_CUR_013_NAME=Huidige geladen klassen LOADING_CLASSES_CUR_013_HELP=Deze teller geeft het aantal klassen weer dat momenteel in alle assembly's is geladen. LOADING_CLASSES_INST_013_NAME=Frequentie waarmee klassen worden geladen LOADING_CLASSES_INST_013_HELP=Deze teller geeft het aantal klassen weer dat per seconde wordt geladen in alle assembly's. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. LOADING_APPDOMAINS_CUR_013_NAME=Huidige appdomains LOADING_APPDOMAINS_CUR_013_HELP=Deze teller geeft het huidige aantal AppDomains weer dat in deze toepassing is geladen. AppDomains (toepassingsdomeinen) zijn veilige en veelzijdige verwerkingseenheden die de CLR kan gebruiken voor het scheiden van toepassingen die binnen hetzelfde proces worden uitgevoerd. LOADING_APPDOMAINS_TOTAL_013_NAME=Totaal aantal Appdomains LOADING_APPDOMAINS_TOTAL_013_HELP=Deze teller geeft het maximum aantal AppDomains weer dat is geladen nadat deze toepassing is gestart. AppDomains (toepassingsdomeinen) zijn veilige en veelzijdige verwerkingseenheden die de CLR kan gebruiken voor het scheiden van toepassingen die binnen hetzelfde proces worden uitgevoerd. LOADING_APPDOMAINS_INST_013_NAME=Frequentie van appdomains LOADING_APPDOMAINS_INST_013_HELP=Deze teller geeft het aantal AppDomains weer dat per seconde wordt geladen. AppDomains (toepassingsdomeinen) zijn veilige en veelzijdige verwerkingseenheden die de CLR kan gebruiken voor het scheiden van toepassingen die binnen hetzelfde proces worden uitgevoerd. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. LOADING_ASSEMBLIES_CUR_013_NAME=Huidige assembly's LOADING_ASSEMBLIES_CUR_013_HELP=Deze teller geeft het aantal assembly's weer dat is geladen voor alle AppDomains in deze toepassing. Als de assembly wordt geladen als domeinneutraal vanuit meerdere AppDomains, wordt de teller met één verhoogd. Assembly's kunnen worden geladen als domeinneutraal als hun code kan worden gedeeld door alle AppDomains. Assembly's kunnen worden geladen als domeinspecifiek als hun code een privécode is voor het AppDomain. LOADING_ASSEMBLIES_TOTAL_013_NAME=Totaal aantal assembly's LOADING_ASSEMBLIES_TOTAL_013_HELP=Deze teller geeft het totaal aantal assembly's weer dat is geladen nadat deze toepassing is gestart. Als de assembly wordt geladen als domeinneutraal vanuit meerdere AppDomains, wordt de teller met één verhoogd. Assembly's kunnen worden geladen als domeinneutraal als hun code kan worden gedeeld door alle AppDomains. Assembly's kunnen worden geladen als domeinspecifiek als hun code een privécode is voor het AppDomain. LOADING_ASSEMBLIES_INST_013_NAME=Frequentie van assembly's LOADING_ASSEMBLIES_INST_013_HELP=Deze teller geeft het aantal assembly's weer dat per seconde wordt geladen voor alle AppDomains. Als de assembly wordt geladen als domeinneutraal vanuit meerdere AppDomains, wordt de teller met één verhoogd. Assembly's kunnen worden geladen als domeinneutraal als hun code kan worden gedeeld door alle AppDomains. Assembly's kunnen worden geladen als domeinspecifiek als hun code een privécode is voor het AppDomain. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. DotNetCLR_Jit_OBJECT_013_NAME=.NET CLR JIT DotNetCLR_Jit_OBJECT_013_HELP=Statistieken voor CLR JIT. TOTAL_METHODS_JITTED_013_NAME=Aantal met JIT gecompileerde methoden TOTAL_METHODS_JITTED_013_HELP=Deze teller geeft het totaal aantal methoden weer dat is gecompileerd door het CLR JIT-compileerprogramma (Just In Time), sinds de toepassing is gestart. Deze teller telt methoden die voor deze fase zijn gecompileerd niet mee. JITTED_IL_CUR_013_NAME=Aantal IL-bytes dat met JIT is gecompileerd JITTED_IL_CUR_013_HELP=Deze teller geeft het totaal aantal IL-bytes weer dat met JIT is gecompileerd sinds de toepassing is gestart. Deze teller komt precies overeen met de teller 'Totaal aantal IL-bytes dat met JIT is gecompileerd'. JITTED_IL_TOTAL_013_NAME=Totaal aantal IL-bytes dat met JIT is gecompileerd JITTED_IL_TOTAL_013_HELP=Deze teller geeft het totaal aantal IL-bytes weer dat met JIT is gecompileerd sinds de toepassing is gestart. Deze teller komt precies overeen met de teller 'Aantal IL-bytes dat met JIT is gecompileerd'. JITTED_IL_INST_013_NAME=IL-bytes die met JIT zijn gecompileerd/sec. JITTED_IL_INST_013_HELP=Deze teller geeft de frequentie weer waarmee IL-bytes met JIT per seconde worden gecompileerd. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. JIT_FAILURES_013_NAME=JIT-standaardfouten JIT_FAILURES_013_HELP=Deze teller geeft het hoogste aantal methoden weer dat niet met JIT is gecompileerd sinds de toepassing is gestart. Deze fout kan optreden als de IL niet kan worden geverifieerd of als er een interne fout is opgetreden in het JIT-compileerprogramma. TIME_IN_JIT_013_NAME=% tijd in JIT TIME_IN_JIT_013_HELP=Deze teller geeft het percentage weer van de tijd die nodig is voor een JIT-compilatie in verhouding tot de laatste JIT-compilatiefase. Deze teller wordt aan het eind van iedere JIT-compilatiefase bijgewerkt. Een JIT-compilatiefase is de fase waarin een methode en de bijbehorende afhankelijkheden worden gecompileerd. TIME_IN_JIT_BASE_013_NAME=Niet weergegeven TIME_IN_JIT_BASE_013_HELP=Niet weergegeven. DotNetCLR_Interop_OBJECT_013_NAME=.NET CLR-interop DotNetCLR_Interop_OBJECT_013_HELP=Statistieken voor CLR-interop. CURRENT_CCW_013_NAME=Aantal CCW's CURRENT_CCW_013_HELP=Deze teller geeft het huidige aantal CCW's (Com-Callable-Wrappers) weer. Een CCW is een proxy voor een begeleid .NET-object waarnaar wordt verwezen vanaf een of meer COM-clients zonder begeleiding. Deze teller is bedoeld om het aantal objecten met begeleiding aan te geven waarnaar wordt verwezen door COM-code zonder begeleiding. CURRENT_STUBS_013_NAME=Aantal stubs CURRENT_STUBS_013_HELP=Deze teller geeft het huidige aantal stubs weer dat is gemaakt door de CLR. Stubs zijn verantwoordelijk voor het marshallen van argumenten. Bovendien retourneren stubs waarden van begeleide code naar onbegeleide code en omgekeerd, tijdens een COM Interop-aanroep of PInvoke-aanroep. NUM_MARSHALLING_013_NAME=Aantal marshal-bewerkingen NUM_MARSHALLING_013_HELP=Deze teller geeft het totaal aantal keren weer dat argumenten en retourwaarden zijn gemarshald van begeleide code naar onbegeleide code en omgekeerd sinds de toepassing is gestart. Deze teller wordt niet verhoogd als de stubs in lijn worden geplaatst. (Stubs zijn verantwoordelijk voor het marshallen van argumenten en retourwaarden.) Stubs worden normaal gesproken in lijn geplaatst als de marshal-overhead klein is. TOTAL_TLB_IMPORTS_013_NAME=Aantal TLB-importbewerkingen/sec. TOTAL_TLB_IMPORTS_013_HELP=Gereserveerd voor toekomstig gebruik. TOTAL_TLB_EXPORTS_013_NAME=Aantal TLB-exportbewerkingen/sec. TOTAL_TLB_EXPORTS_013_HELP=Gereserveerd voor toekomstig gebruik. DotNetCLR_LocksAndThreads_OBJECT_013_NAME=.NET CLR-vergrendelingen en -threads DotNetCLR_LocksAndThreads_OBJECT_013_HELP=Statistieken voor CLR-vergrendelingen en -threads. CONTENTION_TOTAL_013_NAME=Totaal aantal conflicten CONTENTION_TOTAL_013_HELP=Deze teller geeft het totaal aantal keren weer dat threads in de CLR een mislukte poging hebben gedaan een begeleide vergrendeling op te halen. Begeleide vergrendelingen kunnen op allerlei manieren worden opgehaald: door de instructie 'lock' in C#, door System.Monitor.Enter op te roepen of door het aangepaste attribuut MethodImplOptions.Synchronized te gebruiken. CONTENTION_INST_013_NAME=Conflictfrequentie/sec. CONTENTION_INST_013_HELP=Frequentie waarmee threads tijdens runtime een mislukte poging doen een begeleide vergrendeling op te halen. Begeleide vergrendelingen kunnen op allerlei manieren worden opgehaald: door de instructie 'lock' in C#, door System.Monitor.Enter op te roepen of door het aangepaste attribuut MethodImplOptions.Synchronized te gebruiken. QUEUE_LENGTH_CUR_013_NAME=Huidige rijlengte QUEUE_LENGTH_CUR_013_HELP=Deze teller geeft het totaal aantal threads weer dat momenteel wacht totdat een bepaalde begeleide vergrendeling kan worden opgehaald in de toepassing. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om de laatst waargenomen waarde. QUEUE_LENGTH_TOTAL_013_NAME=Maximale rijlengte QUEUE_LENGTH_TOTAL_013_HELP=Deze teller geeft het totaal aantal threads weer dat wacht totdat een bepaalde vergrendeling kan worden opgehaald, nadat de toepassing is gestart. QUEUE_LENGTH_INST_013_NAME=Rijlengte/sec. QUEUE_LENGTH_INST_013_HELP=Deze teller geeft het aantal threads per seconde weer dat wacht totdat een bepaalde vergrendeling kan worden opgehaald in de toepassing. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. CURRENT_LOGICAL_THREADS_013_NAME=Aantal huidige logische threads CURRENT_LOGICAL_THREADS_013_HELP=Deze teller geeft het aantal huidige .NET-threadobjecten in de toepassing weer. Een .NET-threadobject wordt gemaakt via een nieuw System.Threading.Thread-object of wanneer een onbegeleide thread de begeleide omgeving binnengaat. Deze teller houdt het aantal actieve en beëindigde threads bij. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om de laatst waargenomen waarde. CURRENT_PHYSICAL_THREADS_013_NAME=Aantal huidige fysieke threads CURRENT_PHYSICAL_THREADS_013_HELP=Deze teller geeft het aantal besturingssysteemeigen threads weer dat is gemaakt door de CLR en waarvan de CLR eigenaar is, en dat fungeert als onderliggende threads voor .NET-threadobjecten. De threads die worden gebruikt door de CLR voor interne bewerkingen worden niet meegeteld. Dit is een subset van de threads in het besturingssysteemproces. RECOGNIZED_THREADS_CUR_013_NAME=Aantal huidige herkende threads RECOGNIZED_THREADS_CUR_013_HELP=Deze teller geeft het aantal threads weer dat momenteel wordt herkend door de CLR. Aan deze threads is een corresponderend .NET-threadobject gekoppeld. Deze threads worden niet gemaakt door de CLR, maar zijn wel minimaal eenmaal uitgevoerd binnen de CLR. Alleen unieke threads worden getraceerd. Threads met dezelfde thread-id die de CLR opnieuw binnengaan of opnieuw worden gemaakt nadat de thread is afgesloten, worden niet tweemaal geteld. RECOGNIZED_THREADS_TOTAL_013_NAME=Totaal aantal herkende threads RECOGNIZED_THREADS_TOTAL_013_HELP=Deze teller geeft het totaal aantal threads weer dat is herkend door de CLR nadat deze toepassing is gestart. Aan deze threads is een corresponderend .NET-threadobject gekoppeld. Deze threads worden niet gemaakt door de CLR, maar zijn wel minimaal eenmaal uitgevoerd binnen de CLR. Alleen unieke threads worden getraceerd. Threads met dezelfde thread-id die de CLR opnieuw binnengaan of opnieuw worden gemaakt nadat de thread is afgesloten, worden niet tweemaal geteld. RECOGNIZED_THREADS_INST_013_NAME=Frequentie van herkende threads/sec. RECOGNIZED_THREADS_INST_013_HELP=Deze teller geeft het aantal threads per seconde weer dat is herkend door de CLR. Aan deze threads is een corresponderend .NET-threadobject gekoppeld. Deze threads worden niet gemaakt door de CLR, maar zijn wel minimaal eenmaal uitgevoerd binnen de CLR. Alleen unieke threads worden getraceerd. Threads met dezelfde thread-id die de CLR opnieuw binnengaan of opnieuw worden gemaakt nadat de thread is afgesloten, worden niet tweemaal geteld. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. DotNetCLR_Security_OBJECT_013_NAME=.NET CLR-beveiliging DotNetCLR_Security_OBJECT_013_HELP=Statistieken voor CLR-beveiliging. SECURITY_TOTALRTCHECKS_013_NAME=Totaal aantal runtime-controles SECURITY_TOTALRTCHECKS_013_HELP=Deze teller geeft het totaal aantal CAS-runtime-controles (Code Access Security) weer dat is uitgevoerd nadat de toepassing is gestart. CAS-runtime-controles worden uitgevoerd wanneer er een aanroep wordt gedaan voor een bepaalde machtiging. De runtime-controle wordt bij iedere aanroep uitgevoerd door de aanroepfunctie. De huidige thread-stack van de aanroepfunctie wordt gecontroleerd. In combinatie met 'Diepte van stack' geeft deze teller de prestatiestraf voor beveiligingscontroles aan. SECURITY_TIMEAUTHORIZE_013_NAME=% tijd voor handtekeningverificatie SECURITY_TIMEAUTHORIZE_013_HELP=Gereserveerd voor toekomstig gebruik. SECURITY_LINKCHECKS_013_NAME=Aantal verbindingstijdcontroles SECURITY_LINKCHECKS_013_HELP=Deze teller geeft het totaal aantal CAS-verbindingstijdcontroles (Code Access Security) weer nadat de toepassing is gestart. CAS-verbindingstijdcontroles worden uitgevoerd wanneer een bepaalde machtiging gedurende JIT-compilatietijd wordt aangeroepen. Per aanroepfunctie wordt één verbindingstijdcontrole uitgevoerd. Deze teller geeft geen ernstige prestatieproblemen aan, maar wel de activiteit van het beveiligingssysteem. SECURITY_TIMERTCHECKS_013_NAME=% tijd in RT-controles SECURITY_TIMERTCHECKS_013_HELP=Deze teller geeft het percentage weer van de tijd die nodig is voor het uitvoeren van CAS-runtime-controles (Code Access Security) in verhouding tot de laatste controle. Met CAS kunt u toestaan code in bepaalde mate te vertrouwen. De mate van vertrouwen wordt afgedwongen afhankelijk van de code-id. Deze teller wordt aan het eind van een runtime-beveiligingscontrole bijgewerkt. De teller geeft de laatst geobserveerde waarde weer. Het gaat hierbij niet om een gemiddelde. SECURITY_TIMERTCHECKS_BASE_013_NAME=Niet weergegeven SECURITY_TIMERTCHECKS_BASE_013_HELP=Niet weergegeven. SECURITY_DEPTHSECURITY_013_NAME=Diepte van stack SECURITY_DEPTHSECURITY_013_HELP=Deze teller geeft de diepte van de stack weer tijdens de laatste CAS-runtime-controle. De CAS-runtime-controle wordt uitgevoerd door te zoeken in de stack. Deze teller geeft geen gemiddelde weer, maar de laatst waargenomen waarde. DotNetCLR_Remoting_OBJECT_013_NAME=.NET CLR - externe toegang DotNetCLR_Remoting_OBJECT_013_HELP=Statistieken voor externe toegang voor CLR. CONTEXT_REMOTECALLS_INST_013_NAME=Externe aanroepen/sec. CONTEXT_REMOTECALLS_INST_013_HELP=Deze teller geeft het aantal externe procedureaanroepen per seconde weer. Een procedureaanroep is een aanroep van een object buiten het AppDomain van de aanroepfunctie. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. CONTEXT_CHANNELS_013_NAME=Kanalen CONTEXT_CHANNELS_013_HELP=Deze teller geeft het totaal aantal externe kanalen weer dat is geregistreerd voor alle AppDomains nadat de toepassing is gestart. Met kanalen kunt u berichten transporteren naar en van externe objecten. CONTEXT_PROXIES_013_NAME=Contextproxy's CONTEXT_PROXIES_013_HELP=Deze teller geeft het totaal aantal externe proxyobjecten weer dat is gemaakt tijdens dit proces nadat het proces is gestart. Een proxyobject vertegenwoordigt de externe objecten en zorgt ervoor dat alle aanroepen die worden gedaan op de proxy worden doorgestuurd naar het juiste exemplaar van het externe object. CONTEXT_CLASSES_013_NAME=Contextgebonden klassen zijn geladen CONTEXT_CLASSES_013_HELP=Deze teller geeft het huidige aantal contextgebonden klassen weer dat is geladen. Klassen die aan een context kunnen worden gebonden, worden contextgebonden klassen genoemd. Contextgebonden klassen worden gemarkeerd met contextattributen die gebruiksregels leveren voor synchronisatie, threadaffiniteit, transacties, enzovoort. CONTEXT_OBJALLOC_013_NAME=Toekenning van contextgebonden objecten/sec. CONTEXT_OBJALLOC_013_HELP=Deze teller geeft het aantal contextgebonden objecten weer dat per seconde wordt toegekend. Exemplaren van klassen die aan een context kunnen worden gebonden, worden contextgebonden objecten genoemd. Contextgebonden klassen worden gemarkeerd met contextattributen die gebruiksregels leveren voor synchronisatie, threadaffiniteit, transacties, enzovoort. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. CONTEXT_CONTEXTS_013_NAME=Contexten CONTEXT_CONTEXTS_013_HELP=Deze teller geeft het huidige aantal externe contexten in de toepassing weer. Een context is een bepaald bereik dat een verzameling objecten bevat met dezelfde gebruiksregels voor bijvoorbeeld synchronisatie, threadaffiniteit en transacties. CONTEXT_REMOTECALLS_TOTAL_013_NAME=Totaal aantal externe aanroepen CONTEXT_REMOTECALLS_TOTAL_013_HELP=Deze teller geeft het totaal aantal externe procedureaanroepen weer dat heeft plaatsgevonden nadat deze toepassing is gestart. Een externe-procedureaanroep is een aanroep van een object buiten het AppDomain van de aanroepfunctie. DotNetCLR_Excep_OBJECT_013_NAME=.NET CLR-uitzonderingen DotNetCLR_Excep_OBJECT_013_HELP=Runtime-statistieken over de afhandeling van CLR-uitzonderingen. EXCEP_THROWN_TOTAL_013_NAME=Aantal opgetreden uitzonderingen EXCEP_THROWN_TOTAL_013_HELP=Deze teller geeft het totaal aantal uitzonderingen weer dat is opgetreden nadat de toepassing is gestart. Hiertoe behoren zowel .NET-uitzonderingen als onbegeleide uitzonderingen die worden geconverteerd naar .NET-uitzonderingen. Een uitzondering bij een verwijzing naar een Null-aanwijzer in onbegeleide code treedt opnieuw op in begeleide code als een .NET System.NullReferenceException. Deze teller houdt zowel afgehandelde als onafgehandelde uitzonderingen bij. Uitzonderingen die opnieuw optreden, worden opnieuw meegeteld. Uitzonderingen mogen echter maar zelden optreden en niet tijdens de normale loop van het programma. EXCEP_THROWN_INST_013_NAME=Aantal opgetreden uitzonderingen/sec. EXCEP_THROWN_INST_013_HELP=Deze teller geeft het aantal uitzonderingen weer dat per seconde optreedt. Hiertoe behoren zowel .NET-uitzonderingen als onbegeleide uitzonderingen die worden geconverteerd naar .NET-uitzonderingen. Een uitzondering bij een verwijzing naar een Null-aanwijzer in onbegeleide code treedt opnieuw op in begeleide code met begeleiding als een .NET System.NullReferenceException. Deze teller houdt zowel afgehandelde als onafgehandelde uitzonderingen bij. Uitzonderingen mogen echter maar zelden optreden en niet tijdens de normale loop van het programma. Deze teller is bedoeld als indicator voor potentiële prestatieproblemen als gevolg van een grote hoeveelheid (>100) opgetreden uitzonderingen. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. TOTAL_EXCEP_FILTERS_RUN_013_NAME=Aantal filters/sec. TOTAL_EXCEP_FILTERS_RUN_013_HELP=Deze teller geeft het aantal .NET-uitzonderingsfilters weer dat per seconde wordt uitgevoerd. Met een uitzonderingsfilter wordt geëvalueerd of een uitzondering moet worden verwerkt of niet. Deze teller houdt de frequentie bij van de uitzonderingsfilters die worden geëvalueerd, of de uitzondering is afgehandeld of niet. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. TOTAL_EXCEP_FINALLYS_RUN_013_NAME=Aantal finally-blokken/sec. TOTAL_EXCEP_FINALLYS_RUN_013_HELP=Deze teller geeft het aantal finally-blokken weer dat per seconde wordt uitgevoerd. Een finally-blok wordt gegarandeerd uitgevoerd, hoe het try-blok ook is afgesloten. Alleen de finally-blokken die worden uitgevoerd voor een uitzondering worden meegeteld. Finally-blokken in normale codepaden worden niet meegeteld door deze teller. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. EXCEPT_STACK_DEPTH_013_NAME=Frames tussen optreden en oplossen/sec. EXCEPT_STACK_DEPTH_013_HELP=Deze teller geeft het aantal stack-frames per seconde weer dat is doorlopen van het frame dat de .NET-uitzondering heeft veroorzaakt tot het frame dat de uitzondering heeft afgehandeld. Deze teller wordt opnieuw ingesteld op 0 wanneer u een uitzonderingshandler gebruikt. Geneste uitzonderingen brengen de handler terug naar de diepte van de handlerstack. Het gaat hierbij niet om een gemiddelde over een tijdsperiode, maar om het verschil tussen de waarden van de laatste twee controles, gedeeld door de duur van het controle-interval. DotNetCLR_Memory_OBJECT_014_NAME=.NET CLR-minne DotNetCLR_Memory_OBJECT_014_HELP=Tellere for CLR-heap i Garbage Collection. GEN0_COLLECTIONS_COUNTER_014_NAME=Antall Gen 0-samlinger GEN0_COLLECTIONS_COUNTER_014_HELP=Telleren viser antall ganger Garbage Collection (Gen 0 GC) er utført på generasjon 0-objekter (de nyeste og sist tildelte) siden programmet ble startet. Gen 0 GC forekommer når det tilgjengelige minnet i generasjon 0 ikke er stort nok til at en tildelingsforespørsel kan kjøres. Denne telleren økes på slutten av en Gen 0 GC. GCer med høyere generasjoner inneholder alle GCer med lavere generasjoner. Denne telleren økes eksplisitt når en GC med høyere generasjon (Gen 1 eller Gen 2) utføres. Tellerverdien for _Global_ er ikke riktig og bør ignoreres. Denne telleren viser den sist observerte verdien. GEN1_COLLECTIONS_COUNTER_014_NAME=Antall Gen 1-samlinger GEN1_COLLECTIONS_COUNTER_014_HELP=Telleren viser antall ganger Garbage Collection er utført på generasjon 1-objekter siden programmet ble startet. Telleren økes på slutten av en Gen 1 GC. GCer med høyere generasjon inneholder alle GCer med lavere generasjon. Denne telleren økes eksplisitt når en GC med høyere generasjon (Gen 2) utføres. Tellerverdien for _Global_ er ikke riktig og bør ignoreres. Denne telleren viser den sist observerte verdien. GEN2_COLLECTIONS_COUNTER_014_NAME=Antall Gen 2-samlinger GEN2_COLLECTIONS_COUNTER_014_HELP=Telleren viser antall ganger Garbage Collection er utført på generasjon 2-objekter (eldre) siden programmet ble startet. Telleren økes på slutten av en Gen 2 GC (også kalt fullstendig GC). Tellerverdien for _Global_ er ikke riktig og bør ignoreres. Denne telleren viser den sist observerte verdien. GEN0_BYTES_PROMOTED_COUNTER_014_NAME=Forfremmet minne fra Gen 0 GEN0_BYTES_PROMOTED_COUNTER_014_HELP=Telleren viser antall byte i minnet som ikke Garbage Collection blir utført på, og som forfremmes fra generasjon 0 til generasjon 1. Objekter som forfremmes bare fordi de venter på å bli sluttbehandlet, er ikke inkludert i denne telleren. Denne telleren viser verdien som ble observert på slutten av siste GC. Dette er ikke en akkumulert teller. GEN1_BYTES_PROMOTED_COUNTER_014_NAME=Forfremmet minne fra Gen 1 GEN1_BYTES_PROMOTED_COUNTER_014_HELP=Telleren viser antall byte i minnet som ikke Garbage Collection blir utført på, og som forfremmes fra generasjon 1 til generasjon 2. Objekter som forfremmes bare fordi de venter på å bli sluttbehandlet, er ikke inkludert i denne telleren. Denne telleren viser verdien som ble observert på slutten av siste GC. Dette er ikke en akkumulert teller. Telleren tilbakestilles til 0 hvis siste GC bare var en Gen 0 GC. GEN0_PROMOTION_RATE_014_NAME=Gen 0-forfremmede byte / sek GEN0_PROMOTION_RATE_014_HELP=Telleren viser antall byte per sekund som forfremmes fra generasjon 0 (nyeste) til generasjon 1. Objekter som forfremmes bare fordi de venter på å bli sluttbehandlet, er ikke inkludert i denne telleren. Minne forfremmes når Garbage Collection ikke utføres. Denne telleren ble utarbeidet som en indikator for antall varige objekter som blir opprettet per sekund. Denne telleren viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. GEN1_PROMOTION_RATE_014_NAME=Gen 1-forfremmede byte / sek GEN1_PROMOTION_RATE_014_HELP=Telleren viser antall byte per sekund som forfremmes fra generasjon 1 til generasjon 2 (eldste). Objekter som forfremmes bare fordi de venter på å bli sluttbehandlet, er ikke inkludert i denne telleren. Minne forfremmes når Garbage Collection ikke utføres. Ingenting forfremmes fra generasjon 2 fordi den er eldst. Denne telleren ble utarbeidet som en indikator for antall varige objekter som blir opprettet per sekund. Denne telleren viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_014_NAME=Forfremmet sluttbehandlingsminne fra Gen 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_014_HELP=Telleren viser antall byte med minne som forfremmes fra generasjon 0 til generasjon 1, bare fordi de venter på å bli sluttbehandlet. Denne telleren viser verdien som ble observert på slutten av siste GC. Dette er ikke en akkumulert teller. PROCESS_ID_014_NAME=Prosess-ID PROCESS_ID_014_HELP=Denne telleren viser prosess-IDen til CLR-prosessforekomsten som overvåkes. Verdien som vises, vil være 0 frem til etter den første datasaneringen. GEN0_HEAP_SIZE_COUNTER_014_NAME=Heap-størrelse for Gen 0 GEN0_HEAP_SIZE_COUNTER_014_HELP=Telleren viser maksimalt antall byte som kan tildeles i generasjon 0 (Gen 0). Den angir ikke gjeldende antall byte som er tildelt til Gen 0. En Gen 0 GC utløses når tildelingene siden forrige GC overstiger denne størrelsen. Gen 0-størrelsen finjusteres av Garbage Collector, og kan endres under kjøringen av programmet. På slutten av en Gen 0-samling er faktisk størrelsen på Gen 0-heapen 0 byte. Denne telleren viser størrelsen (i byte) for tildelinger som vil utløse neste Gen 0 GC. Denne telleren oppdateres på slutten av en GC. Den oppdateres ikke for hver tildeling. GEN1_HEAP_SIZE_COUNTER_014_NAME=Heap-størrelse for Gen 1 GEN1_HEAP_SIZE_COUNTER_014_HELP=Telleren viser gjeldende antall byte i generasjon 1 (Gen 1). Telleren viser ikke maksimumsstørrelsen for Gen 1. Objekter er ikke direkte tildelt i denne generasjonen. De forfremmes fra de forrige Gen 0 GCene. Denne telleren oppdateres på slutten av en GC. Den oppdateres ikke for hver tildeling. GEN2_HEAP_SIZE_COUNTER_014_NAME=Heap-størrelse for Gen 2 GEN2_HEAP_SIZE_COUNTER_014_HELP=Telleren viser gjeldende antall byte i generasjon 2 (Gen 2). Objekter er ikke tildelt direkte i denne generasjonen. De forfremmes fra Gen 1 i løpet av de forrige Gen 1 GCene. Denne telleren oppdateres på slutten av en GC. Den oppdateres ikke for hver tildeling. LARGE_OBJECT_SIZE_COUNTER_014_NAME=Heap-størrelse for store objekter LARGE_OBJECT_SIZE_COUNTER_014_HELP=Telleren viser gjeldende heap-størrelse for store objekter i byte. Objekter som er større enn en terskel, behandles som store objekter av Garbage Collector, og disse tildeles direkte til en spesial-heap. De forfremmes ikke til høyere generasjoner. I CLR 1.1 og høyere er denne terskelen på 85000 byte. Denne telleren oppdateres på slutten av en GC. Den oppdateres ikke for hver tildeling. SURVIVE_FINALIZE_COUNTER_014_NAME=Ikke samlet før sluttbehandling SURVIVE_FINALIZE_COUNTER_014_HELP=Telleren viser antall objekter i Garbage Collection som ikke blir samlet, fordi de venter på å bli sluttbehandlet. Hvis disse objektene inneholder referanser til andre objekter, blir heller ikke disse objektene samlet, men telles ikke av denne telleren. Tellerne Forfremmet sluttbehandlingsminne fra Gen 0 og Forfremmet sluttbehandlingsminne fra Gen 1 representerer alt minnet som ikke ble samlet på grunn av sluttbehandling. Denne telleren er ikke en akkumulert teller. Den oppdateres på slutten av hver GC, med telling av objekter GC ikke ble utført på i løpet av bare denne bestemte GCen. Denne telleren ble utarbeidet til å angi ekstra byte som programmet kan ha behov for på grunn av sluttbehandlingen. NUM_HANDLES_COUNTER_014_NAME=Antall GC-referanser NUM_HANDLES_COUNTER_014_HELP=Telleren viser gjeldende antall GC-referanser som er i bruk. Dette er referanser til ressurser utenfor CLR og det forvaltede miljøet. Referanser tar opp små mengder minne i GC-heapen, men noen ganger store mengder uforvaltede ressurser. ALLOCATION_RATE_COUNTER_014_NAME=Tildelte byte / sek ALLOCATION_RATE_COUNTER_014_HELP=Telleren viser hvor mange byte som tildeles per sekund til GC-heapen. Telleren oppdateres på slutten av hver GC, ikke ved hver tildeling. Denne telleren viser ikke gjennomsnittet over tid. Den viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. INDUCED_GC_COUNTER_014_NAME=Antall innlagte GCer INDUCED_GC_COUNTER_014_HELP=Telleren viser hvor mange ganger en Garbage Collection ble utført på grunn av et eksplisitt kall til GC.Collect. Det anbefales at GC finjusterer hyppigheten av samlingene. PER_TIME_IN_GC_COUNTER_014_NAME=GC-varighet i prosent PER_TIME_IN_GC_COUNTER_014_HELP=GC-varighet i prosent er hvor lenge, i prosent, det tok å utføre en GC siden forrige GC-syklus. Denne telleren er vanligvis en indikator på arbeidet som utføres av Garbage Collector, slik at minne samles og komprimeres. Denne telleren oppdateres bare på slutten av en GC, og tellerverdien gjenspeiler den sist observerte verdien. Det er ikke en gjennomsnittsverdi. PER_TIME_IN_GC_COUNTER_BASE_014_NAME=Ikke vist PER_TIME_IN_GC_COUNTER_BASE_014_HELP=Ikke vist. TOTAL_HEAP_SIZE_COUNTER_014_NAME=Antall byte i alle heaper TOTAL_HEAP_SIZE_COUNTER_014_HELP=Telleren er summen av fire andre tellere - Heap-størrelse for Gen 0, Heap-størrelse for Gen 1, Heap-størrelse for Gen 2 og Heap-størrelse for store objekter. Denne telleren angir gjeldende minne, i byte, som er tildelt for GC-heaper. TOTAL_COMMITTED_MEM_COUNTER_014_NAME=Antall tildelte byte TOTAL_COMMITTED_MEM_COUNTER_014_HELP=Telleren viser mengden virtuelt minne (i byte) som for øyeblikket er tildelt av Garbage Collector. (Tildelt minne er det fysiske minnet det er reservert plass for i vekslefilen.) TOTAL_RESERVED_MEM_COUNTER_014_NAME=Antall reserverte byte TOTAL_RESERVED_MEM_COUNTER_014_HELP=Telleren viser mengden virtuelt minne (i byte) som i øyeblikket er reservert av Garbage Collector. (Reservert minne er plassen for virtuelt minne som er reservert for programmet, men ingen disk- eller hovedminnesider er brukt.) GC_PINNED_OBJECTS_014_NAME=Antall låste objekter GC_PINNED_OBJECTS_014_HELP=Telleren viser antall låste objekter som ble oppdaget under siste GC. Denne telleren sporer de låste objektene bare i heaper der Garbage Collection ble utført. Det vil si at en Gen 0 GC ville forårsaket opplisting av låste objekter bare i heapen for generasjon 0. Et låst objekt er et objekt som Garbage Collector ikke kan flytte i minnet. GC_SINKBLOCKS_014_NAME=Antall mottakerblokker i bruk GC_SINKBLOCKS_014_HELP=Telleren viser gjeldende antall synkroniseringsblokker i bruk. Synkroniseringsblokker er datastrukturer per objekt som er tildelt for lagring av synkroniseringsinformasjon. De inneholder svake referanser til forvaltede objekter, og må skannes av Garbage Collector. I tillegg er de ikke begrenset til bare å kunne lagre synkroniseringsinformasjon, men kan også lagre metadata for COM-interoperabilitet. Denne telleren ble utarbeidet for å angi ytelsesproblemer med hyppig bruk av synkroniseringsprimitiver. DotNetCLR_Loading_OBJECT_014_NAME=.NET CLR-lasting DotNetCLR_Loading_OBJECT_014_HELP=Statistikk for lasting av CLR-klasse. LOADING_CLASSES_TOTAL_014_NAME=Totalt antall klasser som er lastet LOADING_CLASSES_TOTAL_014_HELP=Telleren viser det akkumulerte antallet klasser som er lastet i alle samlinger siden programmet ble startet. LOADING_TIME_014_NAME=Lastingstid i prosent LOADING_TIME_014_HELP=Reservert for fremtidig bruk. LOADING_ASMSEARCHLEN_014_NAME=Søkelengde for samling LOADING_ASMSEARCHLEN_014_HELP=Reservert for fremtidig bruk. LOADING_LOADFAILURES_TOTAL_014_NAME=Totalt antall lastingsfeil LOADING_LOADFAILURES_TOTAL_014_HELP=Telleren viser hvor mange klasser som ikke ble lastet siden programmet ble startet. Disse lastingsfeilene kan skyldes mange ting, som utilstrekkelig sikkerhet eller ugyldig format. Du finner mer informasjon i hjelpen for profileringstjenester. LOADING_LOADFAILURES_INST_014_NAME=Hyppigheten av lastingsfeil LOADING_LOADFAILURES_INST_014_HELP=Telleren viser antall klasser per sekund som ikke ble lastet. Telleren viser ikke gjennomsnitt over tid, men den viser forskjellen mellom verdier observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. Lastingsfeilene kan skyldes mange ting, som utilstrekkelig sikkerhet eller ugyldig format. Du finner mer informasjon i hjelpen for profileringstjenester. LOADING_HEAPSIZE_014_NAME=Byte i lastingsheap LOADING_HEAPSIZE_014_HELP=Telleren viser gjeldende størrelse (i byte) på minnet som er tildelt av klasselasteren på tvers av alle programdomener. (Tildelt minne er det fysiske minnet det er reservert plass for i vekslefilen.) LOADING_APPDOMAINS_UNLOADED_TOTAL_014_NAME=Totalt antall programdomener som ble lastet ut LOADING_APPDOMAINS_UNLOADED_TOTAL_014_HELP=Telleren viser totalt antall programdomener som ikke ble lastet siden programmet ble startet. Hvis et programdomene lastes og lastes ut flere ganger, blir hver utlasting registrert separat av telleren. LOADING_APPDOMAINS_UNLOADED_INST_014_NAME=Hyppigheten av programdomener som lastes ut LOADING_APPDOMAINS_UNLOADED_INST_014_HELP=Telleren viser antall programdomener som lastes ut per sekund. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. LOADING_CLASSES_CUR_014_NAME=Gjeldende antall klasser som er lastet LOADING_CLASSES_CUR_014_HELP=Telleren viser gjeldende antall klasser som er lastet i alle samlinger. LOADING_CLASSES_INST_014_NAME=Hyppigheten på klasser som er lastet LOADING_CLASSES_INST_014_HELP=Telleren viser antall klasser som lastes per sekund i alle samlinger. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. LOADING_APPDOMAINS_CUR_014_NAME=Gjeldende programdomener LOADING_APPDOMAINS_CUR_014_HELP=Telleren viser gjeldende antall programdomener som er lastet i dette programmet. Programdomener inneholder en sikker og fleksibel behandlingsenhet som CLR kan bruke til å skille programmer som kjører i samme prosess. LOADING_APPDOMAINS_TOTAL_014_NAME=Totale programdomener LOADING_APPDOMAINS_TOTAL_014_HELP=Telleren viser det største antall programdomener som ble lastet siden programmet ble startet. Programdomener inneholder en sikker og fleksibel behandlingsenhet som CLR kan bruke til å skille programmer som kjører i samme prosess. LOADING_APPDOMAINS_INST_014_NAME=Hyppigheten av programdomener LOADING_APPDOMAINS_INST_014_HELP=Telleren viser antall programdomener som lastes per sekund. Programdomener inneholder en sikker og fleksibel behandlingsenhet som CLR kan bruke til å skille programmer som kjører i samme prosess. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. LOADING_ASSEMBLIES_CUR_014_NAME=Gjeldende samlinger LOADING_ASSEMBLIES_CUR_014_HELP=Telleren viser gjeldende antall samlinger som ble lastet på tvers av alle programdomener i programmet. Hvis samlingen er lastet som domenenøytral fra flere programdomener, økes telleres bare en gang. Samlinger kan lastes som domenenøytrale når koden kan deles av alle programdomener, eller de kan lastes som domenespesifikke når koden er forbundet med programdomenet. LOADING_ASSEMBLIES_TOTAL_014_NAME=Totalt antall samlinger LOADING_ASSEMBLIES_TOTAL_014_HELP=Telleren viser totalt antall samlinger som er lastet siden programmet startet. Hvis samlingen er lastet som domenenøytral fra flere programdomener, økes telleres bare en gang. Samlinger kan lastes som domenenøytrale når koden kan deles av alle programdomener, eller de kan lastes som domenespesifikke når koden er forbundet med programdomenet. LOADING_ASSEMBLIES_INST_014_NAME=Hyppigheten av samlinger LOADING_ASSEMBLIES_INST_014_HELP=Telleren viser antall samlinger som ble lastet per sekund på tvers av alle programdomener. Hvis samlingen er lastet som domenenøytral fra flere programdomener, økes telleres bare en gang. Samlinger kan lastes som domenenøytrale når koden kan deles av alle programdomener, eller de kan lastes som domenespesifikke når koden er forbundet med programdomenet. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. DotNetCLR_Jit_OBJECT_014_NAME=.NET CLR JIT DotNetCLR_Jit_OBJECT_014_HELP=Statistikk for CLR JIT. TOTAL_METHODS_JITTED_014_NAME=Antall kompilert med JIT-metoder TOTAL_METHODS_JITTED_014_HELP=Telleren viser totalt antall metoder som ble JIT-kompilert (Just In Time) med CLR JIT-kompileringsfunksjonen siden programmet ble startet. Denne telleren inneholder ikke forhånds-JIT-metoder. JITTED_IL_CUR_014_NAME=Antall JIT-kompilerte IL-byte JITTED_IL_CUR_014_HELP=Telleren viser totalt antall IL-byte som ble JIT-kompilert (Just In Time) siden programmet ble startet. Telleren er identisk med telleren Totalt antall JIT-kompilerte IL-byte. JITTED_IL_TOTAL_014_NAME=Totalt antall JIT-kompilerte IL-byte JITTED_IL_TOTAL_014_HELP=Telleren viser totalt antall JIT-kompilerte (Just In Time) IL-byte siden programmet startet. Telleren er identisk med telleren Antall JIT-kompilerte IL-byte. JITTED_IL_INST_014_NAME=JIT-kompilerte IL-byte / sek JITTED_IL_INST_014_HELP=Telleren viser hyppigheten på JIT-kompilerte (Just In Time) IL-byte per sekund. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. JIT_FAILURES_014_NAME=Standard JIT-feil JIT_FAILURES_014_HELP=Telleren viser største antall metoder som ikke ble kompilert med JIT-kompilering (Just In Time) siden programmet startet. Denne feilen kan oppstå hvis IL ikke kan verifiseres eller hvis det oppstod en intern feil i JIT-kompileringen. TIME_IN_JIT_014_NAME=JIT-varighet i prosent TIME_IN_JIT_014_HELP=Telleren viser hvor lang tid i prosent som er brukt på JIT-kompilering (Just In Time) siden forrige JIT-kompileringsfase. Denne telleren oppdateres på slutten av hver JIT-kompileringsfase. En JIT-kompileringsfase er prosessen da en metode og dens avhengigheter kompileres. TIME_IN_JIT_BASE_014_NAME=Ikke vist TIME_IN_JIT_BASE_014_HELP=Ikke vist. DotNetCLR_Interop_OBJECT_014_NAME=.NET CLR Interop DotNetCLR_Interop_OBJECT_014_HELP=Statistikk for CLR Interop. CURRENT_CCW_014_NAME=Antall CCWer CURRENT_CCW_014_HELP=Telleren viser gjeldende antall CCWer (Com-Callable-Wrap). En CCW er en proxy for .NET-forvaltede objekter som har referanse fra uforvaltede COM-klienter. Denne telleren ble utarbeidet for å angi antall forvaltede objekter som har referanse fra uforvaltede COM-koder. CURRENT_STUBS_014_NAME=Antall stubber CURRENT_STUBS_014_HELP=Telleren viser gjeldende antall stubber opprettet av CLR. Stubber skal formidle argumenter og returnere verdier fra forvaltede og uforvaltede koder og omvendt, i løpet av et COM Interop-kall eller PInvoke-kall. NUM_MARSHALLING_014_NAME=Antall formidlinger NUM_MARSHALLING_014_HELP=Telleren viser totalt antall ganger argumenter og returverdier er formidlet fra forvaltede til uforvaltede koder og omvendt, siden programmet ble startet. Denne telleren økes ikke hvis stubber innebygges. (Stubber skal formidle argumenter og returverdier.) Stubber innebygges vanligvis hvis det er lite ekstra formidling. TOTAL_TLB_IMPORTS_014_NAME=Antall TLB-importer / sek TOTAL_TLB_IMPORTS_014_HELP=Reservert for fremtidig bruk. TOTAL_TLB_EXPORTS_014_NAME=Antall TLB-eksporter / sek TOTAL_TLB_EXPORTS_014_HELP=Reservert for fremtidig bruk. DotNetCLR_LocksAndThreads_OBJECT_014_NAME=.NET CLR-låser og tråder DotNetCLR_LocksAndThreads_OBJECT_014_HELP=Statistikk for CLR-låser og -tråder. CONTENTION_TOTAL_014_NAME=Antall konflikter CONTENTION_TOTAL_014_HELP=Telleren viser totalt antall ganger tråder i CLR har forsøkt å oppnå forvaltet låsing uten å lykkes. Forvaltede låser kan oppnås på mange måter, for eksempel med lock-setningen i C#, ved å sende et kall til System.Monitor.Enter eller ved å bruke det egendefinerte attributtet MethodImplOptions.Synchronized. CONTENTION_INST_014_NAME=Konflikthyppighet/sek CONTENTION_INST_014_HELP=Hvor ofte tråder i kjøretiden forsøker å oppnå forvaltet låsing uten å lykkes. Forvaltede låser kan oppnås på mange måter, for eksempel med lock-setningen i C#, ved å sende et kall til System.Monitor.Enter eller ved å bruke det egendefinerte attributtet MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_014_NAME=Gjeldende kølengde QUEUE_LENGTH_CUR_014_HELP=Telleren viser totalt antall tråder som venter på å oppnå forvaltet låsing i programmet. Telleren viser ikke gjennomsnitt over tid, men viser sist observerte verdi. QUEUE_LENGTH_TOTAL_014_NAME=Største kølengde QUEUE_LENGTH_TOTAL_014_HELP=Telleren viser totalt antall tråder som ventet på å oppnå forvaltet låsing siden programmet ble startet. QUEUE_LENGTH_INST_014_NAME=Kølengde/sek QUEUE_LENGTH_INST_014_HELP=Telleren viser antall tråder per sekund som venter på å oppnå en låsing i programmet. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. CURRENT_LOGICAL_THREADS_014_NAME=Antall gjeldende logiske tråder CURRENT_LOGICAL_THREADS_014_HELP=Telleren viser antall gjeldende .NET-trådobjekter i programmet. Et .NET-trådobjekt er enten opprettet med en ny System.Threading.Thread, eller når en uforvaltet tråd legges inn i det forvaltede miljøet. Denne telleren vedlikeholder tellingen av både tråder som kjører, og som er stoppet. Telleren viser ikke gjennomsnitt over tid, men viser sist observerte verdi. CURRENT_PHYSICAL_THREADS_014_NAME=Antall gjeldende fysiske tråder CURRENT_PHYSICAL_THREADS_014_HELP=Telleren viser antall opprinnelige OS-tråder opprettet og eid av CLR, som skal fungere som underliggende tråder for .NET-trådobjekter. Denne tellerens verdi inneholder ikke tråder brukt av CLR i interne operasjoner, men er et delsett av tråder i OS-prosessen. RECOGNIZED_THREADS_CUR_014_NAME=Antall gjeldende godkjente tråder RECOGNIZED_THREADS_CUR_014_HELP=Telleren viser antall tråder som i øyeblikket er godkjent av CLR. De har et tilsvarende tilknyttet .NET-trådobjekt. Disse trådene er opprettet utenfor CLR, men er senere kjørt i CLR minst en gang. Bare unike tråder spores. Tråder med samme tråd-ID som brukes flere ganger i CLR, eller tråder som gjenopprettes etter engangsbruk, telles ikke to ganger. RECOGNIZED_THREADS_TOTAL_014_NAME=Antall godkjente tråder RECOGNIZED_THREADS_TOTAL_014_HELP=Telleren viser totalt antall tråder som er godkjent av CLR siden programmet ble startet. Disse trådene har et tilsvarende tilknyttet .NET-trådobjekt. Disse trådene er opprettet utenfor CLR, men er senere kjørt i CLR minst en gang. Bare unike tråder spores. Tråder med samme tråd-ID som brukes flere ganger i CLR, eller tråder som gjenopprettes etter engangsbruk, telles ikke to ganger. RECOGNIZED_THREADS_INST_014_NAME=hyppighet for godkjente tråder / sek RECOGNIZED_THREADS_INST_014_HELP=Telleren viser antall tråder per sekund som er godkjent av CLR. Disse trådene har et tilsvarende tilknyttet .NET-trådobjekt. Disse trådene er opprettet utenfor CLR, men er senere kjørt i CLR minst en gang. Bare unike tråder spores. Tråder med samme tråd-ID som brukes flere ganger i CLR, eller tråder som gjenopprettes etter engangsbruk, telles ikke to ganger. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. DotNetCLR_Security_OBJECT_014_NAME=.NET CLR-sikkerhet DotNetCLR_Security_OBJECT_014_HELP=Statistikk for CLR-sikkerhet. SECURITY_TOTALRTCHECKS_014_NAME=Antall kjøretidskontroller SECURITY_TOTALRTCHECKS_014_HELP=Telleren viser antall CAS-kjøretidskontroller (Code Access Security) som er utført siden programmet startet. CAS-kjøretidskontroller utføres når noen sender et kall for å be om en bestemt tillatelse. Kjøretidskontrollen utføres på alle kall, og den analyserer trådstakken for hver oppkaller. Denne telleren sammen med Stakkdybde angir ytelsesstraff for sikkerhetskontroller. SECURITY_TIMEAUTHORIZE_014_NAME=Tid for signaturgodkjenning i prosent SECURITY_TIMEAUTHORIZE_014_HELP=Reservert for fremtidig bruk. SECURITY_LINKCHECKS_014_NAME=Antall koblingstidskontroller SECURITY_LINKCHECKS_014_HELP=Telleren viser antall CAS-kontroller (Code Access Security) for koblingstid siden programmet startet. Disse kontrollene utføres når noen sender et kall for å be om en bestemt tillatelse under en JIT-kompilering (Just In Time). Koblingstidskontroll utføres en gang per oppkaller. Denne tellingen angir ikke alvorlige ytelsesfeil, men måler aktiviteter i sikkerhetssystemet. SECURITY_TIMERTCHECKS_014_NAME=Tid for RT-kontroller i prosent SECURITY_TIMERTCHECKS_014_HELP=Telleren viser tiden i prosent for CAS-kontroller (Code Access Security) for kjøretid siden forrige kontroll. CAS klarerer koden til en viss grad og forsterker de ulike klareringsnivåene avhengig av kode-IDen. Denne telleren oppdateres på slutten av sikkerhetskontrollen av kjøretiden og representerer den sist observerte verdien. Telleren viser ikke et gjennomsnitt. SECURITY_TIMERTCHECKS_BASE_014_NAME=Ikke vist SECURITY_TIMERTCHECKS_BASE_014_HELP=Ikke vist. SECURITY_DEPTHSECURITY_014_NAME=Stakkdybde SECURITY_DEPTHSECURITY_014_HELP=Telleren viser dybden av stakken i løpet av forrige CAS-kontroll (Code Access Security) for kjøretid. Kontrollen utføres ved å krype i stakken. Denne telleren viser ikke gjennomsnitt, bare sist observerte verdi. DotNetCLR_Remoting_OBJECT_014_NAME=.NET CLR-fjernstyring DotNetCLR_Remoting_OBJECT_014_HELP=Statistikk for CLR-fjernstyring. CONTEXT_REMOTECALLS_INST_014_NAME=Eksterne kall / sek CONTEXT_REMOTECALLS_INST_014_HELP=Telleren viser antall eksterne prosedyrekall startet per sekund. Et eksternt prosedyrekall er et kall til et objekt utenfor oppkallerens programdomene. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. CONTEXT_CHANNELS_014_NAME=Kanaler CONTEXT_CHANNELS_014_HELP=Telleren viser totalt antall eksterne kanaler som er registrert på tvers av alle programdomener siden programmet ble startet. Kanaler brukes til å overføre meldinger til og fra eksterne objekter. CONTEXT_PROXIES_014_NAME=Kontekstproxyer CONTEXT_PROXIES_014_HELP=Telleren viser totalt antall eksterne proxyobjekter som er opprettet i denne prosessen siden den startet. Proxyobjekter fungerer på vegne av de eksterne objektene og sikrer at alle kall fra proxyen videresendes til den riktige eksterne objektforekomsten. CONTEXT_CLASSES_014_NAME=Kontekstbundne klasser som er lastet CONTEXT_CLASSES_014_HELP=Telleren viser gjeldende antall kontekstbundne klasser som er lastet. Klasser som kan knyttes til en kontekst, kalles kontekstbundne klasser. Disse er merket med kontekstattributter som inneholder bruksregler for synkronisering, trådaffinitet, transaksjoner osv. CONTEXT_OBJALLOC_014_NAME=Kontekstbundet objekttildeling / sek CONTEXT_OBJALLOC_014_HELP=Telleren viser antall kontekstbundne objekter som tildeles per sekund. Forekomster av klasser som kan knyttes til en kontekst, kalles kontekstbundne objekter. Kontekstbundne klasser er merket med kontekstattributter, som inneholder bruksregler for synkronisering, trådaffinitet, transaksjoner osv. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. CONTEXT_CONTEXTS_014_NAME=Kontekster CONTEXT_CONTEXTS_014_HELP=Telleren viser gjeldende antall eksterne kontekster i programmet. En kontekst er en grenselinje som inneholder en samling objekter med samme bruksregler som synkronisering, trådaffinitet, transaksjoner osv. CONTEXT_REMOTECALLS_TOTAL_014_NAME=Antall eksterne kall CONTEXT_REMOTECALLS_TOTAL_014_HELP=Telleren viser antall eksterne prosedyrekall siden programmet ble startet. Et eksternt prosedyrekall er et kall til et objekt utenfor oppkallerens programdomene. DotNetCLR_Excep_OBJECT_014_NAME=.NET CLR-unntak DotNetCLR_Excep_OBJECT_014_HELP=Kjøretidsstatistikk for CLR-unntaksbehandling. EXCEP_THROWN_TOTAL_014_NAME=Antall unntak som ble iverksatt EXCEP_THROWN_TOTAL_014_HELP=Telleren viser totalt antall unntak som ble iverksatt siden programmet startet. Disse inkluderer både .NET-unntak og ubehandlede unntak som blir konvertert til .NET-unntak. NULL-pekerreferanseunntak i uforvaltet kode ville for eksempel blitt iverksatt på nytt i forvaltet kode, som en .NET System.NullReferenceException. Denne telleren inneholder både behandlede og ubehandlede unntak. Unntak som iverksettes på nytt, telles på nytt. Unntak bør bare iverksettes i spesielle situasjoner, og ikke i programmets vanlige kontrollflyt. EXCEP_THROWN_INST_014_NAME=Antall unntak som ble iverksatt / sek EXCEP_THROWN_INST_014_HELP=Telleren viser antall unntak som ble iverksatt per sekund. Dette inkluderer både .NET-unntak og ubehandlede unntak som blir konvertert til .NET-unntak. NULL-pekerreferanseunntak i uforvaltet kode ville for eksempel blitt iverksatt på nytt i forvaltet kode, som en .NET System.NullReferenceException. Denne telleren inneholder både behandlede og ubehandlede unntak. Unntak som iverksettes på nytt, telles på nytt. Unntak bør bare iverksettes i spesielle situasjoner, og ikke i programmets vanlige kontrollflyt. Denne telleren ble utarbeidet som en indikator på mulige ytelsesproblemer på grunn av stor (>100s) hyppighet av unntak. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. TOTAL_EXCEP_FILTERS_RUN_014_NAME=Antall filtre / sek TOTAL_EXCEP_FILTERS_RUN_014_HELP=Telleren viser antall .NET-unntaksfiltre som startes per sekund. Et unntaksfilter vurderer om et unntak skal behandles eller ikke. Denne telleren måler hyppigheten av unntaksfiltre som vurderes, uavhengig av om unntaket ble behandlet eller ikke. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. TOTAL_EXCEP_FINALLYS_RUN_014_NAME=Antall avslutninger / sek TOTAL_EXCEP_FINALLYS_RUN_014_HELP=Telleren viser antall avslutningsblokker som utføres per sekund. En avslutningsblokk kjøres uavhengig av hvordan forsøksblokken ble avsluttet. Bare avslutningsblokker som kjøres for et unntak, telles. Avslutningsblokker for vanlige kodebaner telles ikke av denne telleren. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. EXCEPT_STACK_DEPTH_014_NAME=Iverksettelse for å få dybde / sek EXCEPT_STACK_DEPTH_014_HELP=Telleren viser antall stakkrammer som er traversert fra rammen som forårsaket .NET-unntaket til rammen som behandlet unntaket, per sekund. Denne telleren settes tilbake til 0 når en unntaksbehandling angis, slik at nestede unntak viser behandling for behandlingsstakkdybde. Telleren viser ikke gjennomsnitt over tid, men viser forskjellen mellom verdiene som ble observert i de to siste eksemplene, delt på varigheten av eksempelintervallet. DotNetCLR_Memory_OBJECT_015_NAME=Pami .NET CLR DotNetCLR_Memory_OBJECT_015_HELP=Liczniki stosu zebranego przez moduB Garbage Collector [rodowiska CLR. GEN0_COLLECTIONS_COUNTER_015_NAME=Liczba operacji gromadzenia obiektów pokolenia 0 GEN0_COLLECTIONS_COUNTER_015_HELP=Ten licznik wy[wietla liczb operacji gromadzenia obiektów pokolenia 0 (najmBodsze, ostatnio przydzielone) przez moduB Garbage Collector (Gen 0 GC) od uruchomienia aplikacji. Operacja Gen 0 GC wystpuje, kiedy ilo[ pamici w pokoleniu 0 nie wystarcza do speBnienia |daD alokacji. Ten licznik jest zwikszany po zakoDczeniu operacji Gen 0 GC. Kolekcje Garbage pokoleD o wy|szych numerach zawieraj wszystkie kolekcje pokoleD o ni|szych numerach. Licznik jest jawnie zwikszany, gdy moduB Garbage Collector wykonuje operacj gromadzenia obiektów pokolenia o wy|szym numerze (pokolenia 1 lub 2). Warto[ licznika _Global_ jest niedokBadna i nale|y j ignorowa. Licznik ten wskazuje ostatni odczytan warto[. GEN1_COLLECTIONS_COUNTER_015_NAME=Liczba operacji gromadzenia obiektów pokolenia 1 GEN1_COLLECTIONS_COUNTER_015_HELP=Ten licznik wy[wietla liczb operacji gromadzenia obiektów pokolenia 1 przez moduB Garbage Collector od uruchomienia aplikacji. Ten licznik jest zwikszany po zakoDczeniu operacji Gen 1 GC. Licznik jest jawnie zwikszany, gdy moduB Garbage Collector wykonuje operacj gromadzenia obiektów pokolenia o wy|szym numerze (pokolenie 2). Warto[ licznika _Global_ jest niedokBadna i nale|y j ignorowa. Licznik ten wskazuje ostatni odczytan warto[. GEN2_COLLECTIONS_COUNTER_015_NAME=Liczba operacji gromadzenia obiektów pokolenia 2 GEN2_COLLECTIONS_COUNTER_015_HELP=Ten licznik wy[wietla liczb operacji gromadzenia obiektów pokolenia 2 (starsze) przez moduB Garbage Collector od uruchomienia aplikacji. Ten licznik jest zwikszany po zakoDczeniu operacji Gen 2 GC (zwanej tak|e peBn operacj GC). Warto[ licznika _Global_ jest niedokBadna i nale|y j ignorowa. Licznik ten wskazuje ostatni odczytan warto[. GEN0_BYTES_PROMOTED_COUNTER_015_NAME=Pami awansowana z pokolenia 0 GEN0_BYTES_PROMOTED_COUNTER_015_HELP=Ten licznik wskazuje liczb bajtów pamici, które zostaBy pominite w operacji wyrzucania elementów bezu|ytecznych i awansowane z pokolenia 0 na pokolenie 1; licznik nie uwzgldnia obiektów, które zostaBy awansowane wyBcznie z powodu oczekiwania na zakoDczenie przetwarzania. Licznik wskazuje warto[ odczytan po zakoDczeniu ostatniej operacji wyrzucania elementów bezu|ytecznych  nie jest to licznik kumulowany. GEN1_BYTES_PROMOTED_COUNTER_015_NAME=Pami awansowana z pokolenia 1 GEN1_BYTES_PROMOTED_COUNTER_015_HELP=Ten licznik wskazuje liczb bajtów pamici, które zostaBy pominite w operacji wyrzucania elementów bezu|ytecznych i awansowane z pokolenia 1 na pokolenie 2; licznik nie uwzgldnia obiektów, które zostaBy awansowane wyBcznie z powodu oczekiwania na zakoDczenie przetwarzania. Licznik wskazuje warto[ odczytan po zakoDczeniu ostatniej operacji wyrzucania elementów bezu|ytecznych  nie jest to licznik kumulowany. Licznik ten jest resetowany do warto[ci 0, je[li ostatnio wykonana zostaBa tylko operacja Gen 0 GC. GEN0_PROMOTION_RATE_015_NAME=Bajty awansowane z pokolenia 0 na sekund GEN0_PROMOTION_RATE_015_HELP=Ten licznik wskazuje liczb bajtów pokolenia 0 (najmBodszych) awansowanych w cigu sekundy na bajty pokolenia 1; licznik nie uwzgldnia obiektów, które zostaBy awansowane wyBcznie z powodu oczekiwania na zakoDczenie przetwarzania. Awansowana jest pami, która zostaBa pominita przy operacji wyrzucania elementów bezu|ytecznych. Licznik wskazuje liczb tworzonych na sekund obiektów o stosunkowo dBugim czasie istnienia. Warto[ licznika to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. GEN1_PROMOTION_RATE_015_NAME=Bajty awansowane z pokolenia 1 na sekund GEN1_PROMOTION_RATE_015_HELP=Ten licznik wskazuje liczb bajtów pokolenia 1 awansowanych w cigu sekundy na bajty pokolenia 2 (najstarsze); licznik nie uwzgldnia obiektów, które zostaBy awansowane wyBcznie z powodu oczekiwania na zakoDczenie przetwarzania. Awansowana jest pami, która zostaBa pominita przy operacji wyrzucania elementów bezu|ytecznych. Bajty pokolenia 2 nie s awansowane, poniewa| s one najstarsze. Licznik wskazuje liczb tworzonych na sekund obiektów o bardzo dBugim czasie istnienia. Warto[ licznika to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_015_NAME=Pami przetwarzania koDcowego awansowana z pokolenia 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_015_HELP=Ten licznik wskazuje liczb bajtów pamici awansowanych z pokolenia 0 na pokolenie 1 wyBcznie z powodu oczekiwania na zakoDczenie przetwarzania. Licznik wskazuje warto[ odczytan po zakoDczeniu ostatniej operacji GC  nie jest to licznik kumulowany. PROCESS_ID_015_NAME=Identyfikator procesu PROCESS_ID_015_HELP=Ten licznik wy[wietla identyfikator procesu monitorowanego wystpienia aparatu CLR. Wy[wietlana warto[ bdzie równa 0 do czasu pierwszego wyrzucania elementów bezu|ytecznych. GEN0_HEAP_SIZE_COUNTER_015_NAME=Rozmiar sterty pokolenia 0 GEN0_HEAP_SIZE_COUNTER_015_HELP=Ten licznik wskazuje maksymaln liczb bajtów, jaka mo|e zosta przydzielona w pokoleniu 0; licznik nie wskazuje liczby bajtów aktualnie przydzielonych w pokoleniu 0. Gdy rozmiar pamici przydzielanej od czasu wykonania ostatniej operacji GC przekracza rozmiar okre[lony przez ten licznik, wykonywana jest operacja Gen 0 GC. Rozmiar pokolenia 0 dostrajany jest przez moduB Garbage Collector i mo|e ulega zmianie w czasie wykonywania aplikacji. Po zakoDczeniu operacji gromadzenia bajtów pokolenia 0 rozmiar stosu pokolenia 0 wynosi 0 bajtów; licznik wskazuje rozmiar przydzielanej pamici (w bajtach), dla jakiego zostanie wykonana nastpna operacja Gen 0 GC. Licznik ten aktualizowany jest po zakoDczeniu operacji GC; nie jest on aktualizowany po ka|dej operacji przydzielenia pamici. GEN1_HEAP_SIZE_COUNTER_015_NAME=Rozmiar sterty pokolenia 1 GEN1_HEAP_SIZE_COUNTER_015_HELP=Ten licznik wskazuje bie|c liczb bajtów pokolenia 1 (Gen 1); licznik ten nie wskazuje maksymalnego rozmiaru pokolenia 1. Miejsce w tym pokoleniu nie jest przydzielane obiektom bezpo[rednio  obiekty s awansowane w wyniku wcze[niejszych operacji Gen 0 GC. Licznik jest aktualizowany po zakoDczeniu operacji GC; nie jest on aktualizowany po ka|dej operacji przydzielenia pamici. GEN2_HEAP_SIZE_COUNTER_015_NAME=Rozmiar sterty pokolenia 2 GEN2_HEAP_SIZE_COUNTER_015_HELP=Ten licznik wskazuje bie|c liczb bajtów pokolenia 2 (Gen 2). Miejsce w tym pokoleniu nie jest przydzielane obiektom bezpo[rednio  obiekty s awansowane w wyniku wcze[niejszych operacji Gen 1 GC. Licznik jest aktualizowany po zakoDczeniu operacji GC; nie jest on aktualizowany po ka|dej operacji przydzielenia pamici. LARGE_OBJECT_SIZE_COUNTER_015_NAME=Rozmiar sterty obiektów wielkich LARGE_OBJECT_SIZE_COUNTER_015_HELP=Ten licznik wy[wietla bie|cy rozmiar (w bajtach) stosu du|ych obiektów. Obiekty, których rozmiar przekracza warto[ progow, s traktowane przez moduB zbierajcy elementy bezu|yteczne jako du|e obiekty i miejsce dla nich jest przydzielane bezpo[rednio w specjalnym stosie; te obiekty nie s awansowane na obiekty wy|szych pokoleD. W aparacie CLR w wersji 1.1 i wy|szych ta warto[ progowa jest równa 85 000 bajtów. Ten licznik jest aktualizowany po zakoDczeniu wyrzucania elementów bezu|ytecznych; nie jest aktualizowany przy ka|dej alokacji. SURVIVE_FINALIZE_COUNTER_015_NAME=Rozbitkowie przetwarzania koDcowego SURVIVE_FINALIZE_COUNTER_015_HELP=Ten licznik wskazuje liczb obiektów, które w czasie zbierania obiektów przez moduB Garbage Collector zostaBy pominite, poniewa| oczekuj na zakoDczenie przetwarzania. Je[li obiekty zawieraj odniesienia do innych obiektów, te obiekty równie| s pomijane w operacji zbierania, lecz nie s one zliczane przez ten licznik; caBkowity rozmiar pamici, która zostaBa pominita z powodu oczekiwania na zakoDczenie przetwarzania, wskazywany jest przez liczniki  Pami przetwarzania koDcowego awansowana z pokolenia 0 oraz  Pami przetwarzania koDcowego awansowana z pokolenia 1 . Ten licznik nie jest licznikiem kumulowanym; jest on aktualizowany po zakoDczeniu ka|dej operacji GC przy u|yciu liczby obiektów, które zostaBy pominite tylko w czasie okre[lonej operacji GC. Licznik ten wskazuje dodatkowe zasoby, które mog by wymagane przez aplikacj w zwizku z koDcowymi operacjami przetwarzania. NUM_HANDLES_COUNTER_015_NAME=Uchwyty GC NUM_HANDLES_COUNTER_015_HELP=Ten licznik wskazuje liczb aktualnie u|ywanych uchwytów GC. Uchwyty GC to uchwyty zwizane z zasobami zewntrznymi z punktu widzenia [rodowiska CLR i [rodowiska zarzdzanego. Uchwyty zajmuj niewiele miejsca w pamici w stosie GCHeap, lecz mog powodowa du|e obci|enie w wypadku niezarzdzanych zasobów. ALLOCATION_RATE_COUNTER_015_NAME=Liczba przydzielanych bajtów na sekund ALLOCATION_RATE_COUNTER_015_HELP=Ten licznik wskazuje liczb bajtów przydzielanych na sekund w stosie GC. Licznik aktualizowany jest po zakoDczeniu ka|dej operacji GC; nie jest on aktualizowany po ka|dej operacji przydzielenia pamici. Licznik nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. INDUCED_GC_COUNTER_015_NAME=Liczba wywoBanych operacji GC INDUCED_GC_COUNTER_015_HELP=Ten licznik wskazuje najwiksz liczb operacji wyrzucania elementów bezu|ytecznych wykonanych w wyniku jawnego wywoBania elementu GC.Collect. Warto zezwoli, aby moduB wyrzucajcy elementy bezu|yteczne dostrajaB czstotliwo[ zbierania obiektów w kolekcjach. PER_TIME_IN_GC_COUNTER_015_NAME=Czas dziaBania moduBu GC [%] PER_TIME_IN_GC_COUNTER_015_HELP=Czas dziaBania moduBu wyrzucajcego elementy bezu|yteczne to wyra|ony w procentach czas przeznaczony na operacj zbierania obiektów przez moduB wyrzucajcy elementy bezu|yteczne od chwili zakoDczenia ostatniego cyklu moduBu wyrzucajcego elementy bezu|yteczne. Zazwyczaj licznik wskazuje ilo[ pracy wykonanej w imieniu aplikacji przez moduB wyrzucajcy elementy bezu|yteczne w celu zebrania i skompaktowania pamici. Licznik aktualizowany jest wyBcznie po zakoDczeniu ka|dej operacji wyrzucania elementw bezu|ytecznych i jego warto[ reprezentuje ostatni odczytan warto[; nie jest to warto[ [rednia. PER_TIME_IN_GC_COUNTER_BASE_015_NAME=Niewy[wietlane PER_TIME_IN_GC_COUNTER_BASE_015_HELP=Niewy[wietlane. TOTAL_HEAP_SIZE_COUNTER_015_NAME=Liczba bajtów we wszystkich stertach TOTAL_HEAP_SIZE_COUNTER_015_HELP=Ten licznik reprezentuje sum warto[ci pozostaBych czterech liczników: Rozmiar stosu pokolenia 0, Rozmiar stosu pokolenia 1, Rozmiar stosu pokolenia 2 oraz Rozmiar stosu obiektów wielkich. Ten licznik wskazuje rozmiar (w bajtach) aktualnie przydzielonej pamici w stosach GC. TOTAL_COMMITTED_MEM_COUNTER_015_NAME=Suma zarezerwowanych bajtów TOTAL_COMMITTED_MEM_COUNTER_015_HELP=Ten licznik wskazuje rozmiar (w bajtach) pamici wirtualnej zarezerwowanej aktualnie przez moduB GC. (Pami zarezerwowana to pami fizyczna, dla której zostaBo zarezerwowane miejsce w pliku stronicowania na dysku). TOTAL_RESERVED_MEM_COUNTER_015_NAME=Suma zastrze|onych bajtów TOTAL_RESERVED_MEM_COUNTER_015_HELP=Ten licznik wskazuje rozmiar (w bajtach) zastrze|onej przez moduB GC pamici wirtualnej. (Pami zastrze|ona to obszar pamici, który zostaB zarezerwowany dla aplikacji bez u|ycia stron pamici dyskowej lub pamici gBównej). GC_PINNED_OBJECTS_015_NAME=Liczba unieruchomionych obiektów GC_PINNED_OBJECTS_015_HELP=Ten licznik wskazuje liczb unieruchomionych obiektów napotkanych w czasie ostatniej operacji GC. Licznik sBu|y do [ledzenia tylko unieruchomionych obiektów znajdujcych si w stosach, które zostaBy zebrane przez moduB Garbage Collector; np. wykonanie operacji Gen 0 GC spowoduje wyliczenie tylko tych unieruchomionych obiektów, które znajduj si w stosie pokolenia 0. Unieruchomiony obiekt to obiekt, który nie mo|e zosta przeniesiony w pamici przez moduB Garbage Collector. GC_SINKBLOCKS_015_NAME=Liczba u|ywanych bloków synchronizacji GC_SINKBLOCKS_015_HELP=Ten licznik wskazuje aktualn liczb u|ywanych bloków synchronizacji. Bloki synchronizacji to zwizane z obiektami struktury danych przydzielone w celu przechowywania informacji o synchronizacji. Bloki synchronizacji zawieraj odwoBania sBabe do zarzdzanych obiektów i musz by skanowane przez moduB Garbage Collector. Oprócz informacji o synchronizacji w blokach synchronizacji mog by tak|e przechowywane metadane wspóBdziaBania modelu COM. Licznik mo|e sBu|y jako wskaznik problemów wydajno[ciowych zwizanych z intensywnym u|yciem pierwotnych obiektów synchronizacji. DotNetCLR_Loading_OBJECT_015_NAME=Aadowanie .NET CLR DotNetCLR_Loading_OBJECT_015_HELP=Statystyka moduBu Badujcego klasy CLR. LOADING_CLASSES_TOTAL_015_NAME=Suma zaBadowanych klas LOADING_CLASSES_TOTAL_015_HELP=Ten licznik wskazuje skumulowan liczb klas zaBadowanych do wszystkich zestawów od chwili uruchomienia tej aplikacji. LOADING_TIME_015_NAME=Czas Badowania [%] LOADING_TIME_015_HELP=Zarezerwowane do u|ytku w przyszBo[ci. LOADING_ASMSEARCHLEN_015_NAME=DBugo[ przeszukiwania zestawu LOADING_ASMSEARCHLEN_015_HELP=Zarezerwowane do u|ytku w przyszBo[ci. LOADING_LOADFAILURES_TOTAL_015_NAME=Suma bBdów w czasie Badowania LOADING_LOADFAILURES_TOTAL_015_HELP=Ten licznik wskazuje maksymaln liczb klas, które od chwili uruchomienia aplikacji nie zostaBy zaBadowane z powodu bBdu. Mo|e istnie wiele przyczyn wystpienia bBdów w czasie Badowania, np. nieodpowiednie ustawienia zabezpieczeD lub niedozwolony format. SzczegóBowe informacje mo|na znalez w pomocy usBug profilowania. LOADING_LOADFAILURES_INST_015_NAME=Czsto[ bBdów w czasie Badowania LOADING_LOADFAILURES_INST_015_HELP=Ten licznik wskazuje liczb bBdów Badowania klas na sekund. Licznik nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. Mo|e istnie wiele przyczyn wystpienia bBdów w czasie Badowania, np. nieodpowiednie ustawienia zabezpieczeD lub niedozwolony format. SzczegóBowe informacje mo|na znalez w pomocy usBug profilowania. LOADING_HEAPSIZE_015_NAME=Liczba bajtów w stercie moduBu Badujcego LOADING_HEAPSIZE_015_HELP=Ten licznik wskazuje aktualny rozmiar (w bajtach) pamici zarezerwowanej przez moduB Badujcy klasy dla wszystkich domen aplikacji. (Pami zarezerwowana to pami fizyczna, dla której zostaBo zarezerwowane miejsce w pliku stronicowania na dysku). LOADING_APPDOMAINS_UNLOADED_TOTAL_015_NAME=Suma zwolnionych domen aplikacji LOADING_APPDOMAINS_UNLOADED_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb domen aplikacji zwolnionych od chwili uruchomienia tej aplikacji. Je[li domena aplikacji zostanie wielokrotnie zaBadowana i zwolniona, ka|da z tych operacji zwolnienia zostanie zliczona w liczniku. LOADING_APPDOMAINS_UNLOADED_INST_015_NAME=Szybko[ zwalniania domen aplikacji LOADING_APPDOMAINS_UNLOADED_INST_015_HELP=Ten licznik wskazuje liczb zwalnianych domen aplikacji na sekund. Licznik nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. LOADING_CLASSES_CUR_015_NAME=Aktualnie zaBadowane klasy LOADING_CLASSES_CUR_015_HELP=Ten licznik wskazuje liczb klas zaBadowanych aktualnie do wszystkich zestawów. LOADING_CLASSES_INST_015_NAME=Szybko[ Badowania klas LOADING_CLASSES_INST_015_HELP=Ten licznik wskazuje liczb klas Badowanych w cigu sekundy do wszystkich zestawów. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. LOADING_APPDOMAINS_CUR_015_NAME=Aktualna liczba domen aplikacji LOADING_APPDOMAINS_CUR_015_HELP=Ten licznik wskazuje liczb domen aplikacji aktualnie zaBadowanych w tej aplikacji. Domeny aplikacji to bezpieczne i elastyczne jednostki przetwarzania, które mog by u|ywane w [rodowisku CLR w celu rozdzielenia aplikacji uruchomionych w tym samym procesie. LOADING_APPDOMAINS_TOTAL_015_NAME=Suma domen aplikacji LOADING_APPDOMAINS_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb domen aplikacji zaBadowanych od chwili uruchomienia aplikacji. Domeny aplikacji to bezpieczne i elastyczne jednostki przetwarzania, które mog by u|ywane w [rodowisku CLR w celu rozdzielenia aplikacji uruchomionych w tym samym procesie. LOADING_APPDOMAINS_INST_015_NAME=Szybko[ Badowania domen aplikacji LOADING_APPDOMAINS_INST_015_HELP=Ten licznik wskazuje liczb Badowanych w cigu sekundy domen aplikacji. Domeny aplikacji to bezpieczne i uniwersalne jednostki przetwarzania, które mog by u|ywane w [rodowisku CLR w celu rozdzielenia aplikacji uruchomionych w tym samym procesie. Licznik nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. LOADING_ASSEMBLIES_CUR_015_NAME=Aktualna liczba zestawów LOADING_ASSEMBLIES_CUR_015_HELP=Ten licznik wskazuje liczb aktualnie zaBadowanych w tej aplikacji zestawów dla wszystkich domen aplikacji. Je[li zestaw Badowany jest z wielu domen aplikacji jako neutralny dla domen, wówczas licznik zwikszany jest tylko raz. Zestawy mog by Badowane jako neutralne dla domen, gdy ich kod mo|e by udostpniony wszystkim domenom aplikacji, albo mog by Badowane jako specyficzne dla domeny, gdy ich kod jest prywatnym kodem okre[lonej domeny aplikacji. LOADING_ASSEMBLIES_TOTAL_015_NAME=Suma zestawów LOADING_ASSEMBLIES_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb zestawów zaBadowanych od chwili uruchomienia aplikacji. Je[li zestaw Badowany jest z wielu domen aplikacji jako neutralny dla domen, wówczas licznik zwikszany jest tylko raz. Zestawy mog by Badowane jako neutralne dla domen, gdy ich kod mo|e by udostpniony wszystkim domenom aplikacji, albo mog by Badowane jako specyficzne dla domeny, gdy ich kod jest prywatnym kodem okre[lonej domeny aplikacji. LOADING_ASSEMBLIES_INST_015_NAME=Szybko[ Badowania zestawów LOADING_ASSEMBLIES_INST_015_HELP=Ten licznik wskazuje liczb Badowanych w cigu sekundy zestawów dla wszystkich domen aplikacji. Je[li zestaw Badowany jest z wielu domen aplikacji jako neutralny dla domen, wówczas licznik ten zwikszany jest tylko raz. Zestawy mog by Badowane jako neutralne dla domen, gdy ich kod mo|e by udostpniony wszystkim domenom aplikacji, albo mog by Badowane jako specyficzne dla domeny, gdy ich kod jest prywatnym kodem okre[lonej domeny aplikacji. Licznik nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. DotNetCLR_Jit_OBJECT_015_NAME=Kompilator JIT dla .NET CLR DotNetCLR_Jit_OBJECT_015_HELP=Statystyka kompilatora JIT dla CLR. TOTAL_METHODS_JITTED_015_NAME=Liczba metod skompilowanych w trybie JIT TOTAL_METHODS_JITTED_015_HELP=Ten licznik wskazuje caBkowit liczb metod skompilowanych przy u|yciu kompilatora just in time (JIT) w [rodowisku CLR od chwili uruchomienia aplikacji. W liczniku nie s uwzgldnione metody prekompilowane przy u|yciu kompilatora JIT. JITTED_IL_CUR_015_NAME=Liczba bajtów IL skompilowanych w trybie JIT JITTED_IL_CUR_015_HELP=Ten licznik wskazuje caBkowit liczb bajtów IL skompilowanych przy u|yciu kompilatora JIT od chwili uruchomienia aplikacji. Licznik jest dokBadnym odpowiednikiem licznika  CaBkowita liczba bajtów IL skompilowanych w trybie JIT . JITTED_IL_TOTAL_015_NAME=CaBkowita liczba bajtów IL skompilowanych w trybie JIT JITTED_IL_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb bajtów IL skompilowanych przy u|yciu kompilatora JIT od chwili uruchomienia aplikacji. Licznik ten jest dokBadnym odpowiednikiem licznika  Liczba bajtów IL skompilowanych w trybie JIT . JITTED_IL_INST_015_NAME=Liczba bajtów IL skompilowanych w trybie JIT na sekund JITTED_IL_INST_015_HELP=Ten licznik wskazuje liczb bajtów IL kompilowanych na sekund w trybie JIT. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. JIT_FAILURES_015_NAME=Standardowe bBdy kompilatora JIT JIT_FAILURES_015_HELP=Ten licznik wskazuje caBkowit liczb metod, których kompilacja przy u|yciu kompilatora JIT nie powiodBa si (od chwili uruchomienia aplikacji). Taki bBd mo|e wystpi wówczas, gdy nie mo|na sprawdzi poprawno[ci bajtów IL lub gdy wystpi wewntrzny bBd kompilatora JIT. TIME_IN_JIT_015_NAME=Czas dziaBania kompilatora JIT [%] TIME_IN_JIT_015_HELP=Ten licznik wskazuje wyra|ony w procentach czas wykonywania kompilacji JIT liczony od chwili zakoDczenia poprzedniej fazy kompilacji JIT. Licznik ten aktualizowany jest po zakoDczeniu ka|dej fazy kompilacji JIT. Faza kompilacji JIT to faza, w której kompilowana jest okre[lona metoda oraz jej zale|no[ci. TIME_IN_JIT_BASE_015_NAME=Niewy[wietlane TIME_IN_JIT_BASE_015_HELP=Niewy[wietlane. DotNetCLR_Interop_OBJECT_015_NAME=WspóBdziaBanie .NET CLR DotNetCLR_Interop_OBJECT_015_HELP=Statystyka wspóBdziaBania CLR. CURRENT_CCW_015_NAME=Liczba otok CCW CURRENT_CCW_015_HELP=Ten licznik wskazuje aktualn liczb otok CCW (Com-Callable-Wrapper). Otoka CCW to obiekt po[redniczcy (proxy) dla zarzdzanego na platformie .NET obiektu, do którego odwoBuj si niezarzdzane obiekty klientów platformy COM. Licznik wskazuje liczb zarzdzanych obiektów, do których odwoBuje si niezarzdzany kod modelu COM. CURRENT_STUBS_015_NAME=Liczba wycinków kodu CURRENT_STUBS_015_HELP=Ten licznik wskazuje aktualn liczb wycinków kodu utworzonych w [rodowisku CLR. W czasie realizacji wywoBaD wspóBdziaBania COM lub wywoBaD PInvoke procedury po[redniczce odpowiedzialne s za organizowanie argumentów oraz warto[ci zwracanych z kodu zarzdzanego do kodu niezarzdzanego lub odwrotnie. NUM_MARSHALLING_015_NAME=Liczba operacji organizowania NUM_MARSHALLING_015_HELP=Ten licznik wskazuje caBkowit liczb wykonanych od chwili uruchomienia aplikacji operacji organizowania argumentów i warto[ci zwracanych z kodu zarzdzanego do kodu niezarzdzanego lub odwrotnie. Licznik nie jest zwikszany, je[li wykonywane wycinki kodu s wbudowane. (Wycinki kodu s odpowiedzialne za organizowanie argumentów oraz zwracanych warto[ci). Wycinki kodu s zazwyczaj wbudowane, je[li dodatkowe zasoby wymagane w czasie organizowania s niewielkie. TOTAL_TLB_IMPORTS_015_NAME=Liczba operacji importu buforów TLB na sekund TOTAL_TLB_IMPORTS_015_HELP=Zarezerwowane do u|ytku w przyszBo[ci. TOTAL_TLB_EXPORTS_015_NAME=Liczba operacji importu buforów TLB na sekund TOTAL_TLB_EXPORTS_015_HELP=Zarezerwowane do u|ytku w przyszBo[ci. DotNetCLR_LocksAndThreads_OBJECT_015_NAME=Blokady i wtki .NET CLR DotNetCLR_LocksAndThreads_OBJECT_015_HELP=Statystyka blokad i wtków CLR. CONTENTION_TOTAL_015_NAME=Suma niezgodno[ci CONTENTION_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb nieudanych prób uzyskania przez wtki [rodowiska CLR zarzdzanych blokad. Istnieje wiele sposobów uzyskiwania zarzdzanych blokad (np. przy u|yciu instrukcji  lock w jzyku C#, przez wywoBanie elementu System.Monitor.Enter albo przy u|yciu atrybutu niestandardowego MethodImplOptions.Synchronized). CONTENTION_INST_015_NAME=Liczba niezgodno[ci na sekund CONTENTION_INST_015_HELP=Czstotliwo[ nieudanych prób uzyskania przez wtki zarzdzanych blokad w trakcie dziaBania. Istnieje wiele sposobów uzyskiwania zarzdzanych blokad (np. przy u|yciu instrukcji  lock w jzyku C#, przez wywoBanie elementu System.Monitor.Enter albo przy u|yciu atrybutu niestandardowego MethodImplOptions.Synchronized). QUEUE_LENGTH_CUR_015_NAME=Aktualna dBugo[ kolejki QUEUE_LENGTH_CUR_015_HELP=Ten licznik wskazuje caBkowit liczb wtków aplikacji oczekujcych aktualnie na uzyskanie zarzdzanej blokady. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ostatnia odczytana warto[. QUEUE_LENGTH_TOTAL_015_NAME=Najwiksza dBugo[ kolejki QUEUE_LENGTH_TOTAL_015_HELP=Ten licznik wskazuje najwiksz od chwili uruchomienia aplikacji liczb wtków oczekujcych jednocze[nie na uzyskanie zarzdzanej blokady. QUEUE_LENGTH_INST_015_NAME=DBugo[ kolejki na sekund QUEUE_LENGTH_INST_015_HELP=Ten licznik wskazuje liczb wtków w aplikacji oczekujcych w cigu sekundy na uzyskanie blokady. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. CURRENT_LOGICAL_THREADS_015_NAME=Aktualna liczba wtków logicznych CURRENT_LOGICAL_THREADS_015_HELP=Ten licznik wskazuje aktualn liczb obiektów wtków .NET w aplikacji. Obiekt wtku .NET tworzony jest przy u|yciu elementu System.Threading.Thread lub w chwili, gdy niezarzdzany wtek pojawia si w zarzdzanym [rodowisku. Licznik okre[la liczb wtków dziaBajcych oraz zatrzymanych. Licznik nie wskazuje warto[ci [redniej; jego warto[ to ostatnia odczytana warto[. CURRENT_PHYSICAL_THREADS_015_NAME=Aktualna liczba wtków fizycznych CURRENT_PHYSICAL_THREADS_015_HELP=Ten licznik wskazuje liczb macierzystych wtków systemu operacyjnego utworzonych i zarzdzanych przez [rodowisko CLR, które dziaBaj jako wtki podstawowe dla obiektów wtków .NET. W liczniku nie s uwzgldnione wtki u|ywane przez [rodowisko CLR w czasie wykonywania operacji wewntrznych; jest to podzbiór wtków u|ywanych w procesie systemu operacyjnego. RECOGNIZED_THREADS_CUR_015_NAME=Aktualna liczba rozpoznanych wtków RECOGNIZED_THREADS_CUR_015_HELP=Ten licznik wskazuje aktualn liczb wtków rozpoznanych przez [rodowisko CLR; z wtkami tymi skojarzone s odpowiednie obiekty wtków .NET. Wtki te nie zostaBy utworzone przez [rodowisko CLR; zostaBy one utworzone poza [rodowiskiem CLR, lecz byBy uruchomione w [rodowisku CLR co najmniej raz. Zledzone s tylko wtki unikatowe; wtki z okre[lonymi identyfikatorami, które uruchamiane s w [rodowisku CLR po raz kolejny albo s odtwarzane po ich zakoDczeniu, nie s zliczane podwójnie. RECOGNIZED_THREADS_TOTAL_015_NAME=Suma rozpoznanych wtków RECOGNIZED_THREADS_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb wtków, które od chwili uruchomienia tej aplikacji zostaBy rozpoznane przez [rodowisko CLR; z wtkami tymi skojarzone s odpowiednie obiekty wtków .NET. Wtki te nie zostaBy utworzone przez [rodowisko CLR; zostaBy one utworzone poza [rodowiskiem CLR, lecz byBy uruchomione w [rodowisku CLR co najmniej raz. Zledzone s tylko wtki unikatowe; wtki z okre[lonymi identyfikatorami, które uruchamiane s w [rodowisku CLR po raz kolejny albo s odtwarzane po ich zakoDczeniu, nie s zliczane podwójnie. RECOGNIZED_THREADS_INST_015_NAME=Liczba rozpoznanych wtków na sekund RECOGNIZED_THREADS_INST_015_HELP=Ten licznik wskazuje liczb wtków rozpoznawanych w cigu sekundy przez [rodowisko CLR; z wtkami tymi skojarzone s odpowiednie obiekty wtków .NET. Wtki te nie zostaBy utworzone przez [rodowisko CLR; zostaBy one utworzone poza [rodowiskiem CLR, lecz byBy uruchomione w [rodowisku CLR co najmniej raz. Zledzone s tylko wtki unikatowe; wtki z okre[lonymi identyfikatorami, które uruchamiane s w [rodowisku CLR po raz kolejny albo s odtwarzane po ich zakoDczeniu, nie s zliczane podwójnie. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. DotNetCLR_Security_OBJECT_015_NAME=Zabezpieczenia .NET CLR DotNetCLR_Security_OBJECT_015_HELP=Statystyka zabezpieczeD CLR. SECURITY_TOTALRTCHECKS_015_NAME=Suma sprawdzeD w czasie dziaBania SECURITY_TOTALRTCHECKS_015_HELP=Ten licznik wskazuje caBkowit liczb sprawdzeD typu CAS (Code Access Security) wykonanych od chwili uruchomienia aplikacji. Sprawdzenia typu CAS w czasie dziaBania wykonywane s w chwili, gdy obiekt wywoBujcy wywoBuje obiekt wywoBywany z |daniem uzyskania okre[lonego uprawnienia; sprawdzenie w czasie dziaBania wykonywane jest przy ka|dym wywoBaniu wykonywanym przez obiekt wywoBujcy; sprawdzenie to polega na zbadaniu aktualnego stosu wtków obiektu wywoBujcego. Licznik ten razem z licznikiem  GBboko[ przeszukiwania stosu mo|e by u|ywany jako wskaznik spadku wydajno[ci spowodowanego sprawdzaniem zabezpieczeD. SECURITY_TIMEAUTHORIZE_015_NAME=Czas uwierzytelniania przy u|yciu zasobu SIG [%] SECURITY_TIMEAUTHORIZE_015_HELP=Zarezerwowane do u|ytku w przyszBo[ci. SECURITY_LINKCHECKS_015_NAME=Liczba sprawdzeD w czasie poBczenia SECURITY_LINKCHECKS_015_HELP=Ten licznik wskazuje caBkowit liczb wykonanych od chwili uruchomienia tej aplikacji sprawdzeD typu CAS (Code Access Security). Sprawdzenia typu CAS w czasie poBczenia wykonywane s w chwili, gdy obiekt wywoBujcy wywoBuje obiekt wywoBywany z |daniem uzyskania okre[lonego uprawnienia w czasie kompilacji JIT; dla danego obiektu wywoBujcego sprawdzenie w czasie poBczenia wykonywane jest jeden raz. Warto[ tego licznika nie mo|e by u|ywana do wykrywania powa|nych problemów zwizanych z wydajno[ci; warto[ ta mo|e by u|ywana do monitorowania dziaBania systemu zabezpieczeD. SECURITY_TIMERTCHECKS_015_NAME=Czas wykonywania sprawdzeD w czasie dziaBania [%] SECURITY_TIMERTCHECKS_015_HELP=Ten licznik wskazuje okre[lony w procentach czas wykonywania sprawdzenia typu CAS (Code Access Security) kodu w czasie dziaBania obliczany od chwili wykonania ostatniego takiego sprawdzenia. U|ycie zabezpieczeD CAS pozwala na stosowanie ró|nych stopni zaufania wzgldem kodu i wymuszanie u|ycia odpowiedniego poziomu w zale|no[ci od identyfikatora kodu. Licznik jest aktualizowany po zakoDczeniu sprawdzenia zabezpieczeD w czasie dziaBania; reprezentuje on ostatnio odczytan warto[; nie jest to warto[ [rednia. SECURITY_TIMERTCHECKS_BASE_015_NAME=Niewy[wietlane SECURITY_TIMERTCHECKS_BASE_015_HELP=Niewy[wietlane. SECURITY_DEPTHSECURITY_015_NAME=GBboko[ przeszukiwania stosu SECURITY_DEPTHSECURITY_015_HELP=Ten licznik wskazuje gBboko[ stosu w czasie ostatniego sprawdzenia CAS (Code Access Security) w czasie dziaBania. Sprawdzenie CAS w czasie dziaBania polega na przeszukaniu stosu. Licznik ten nie wskazuje warto[ci [redniej; jego warto[ to ostatnia odczytana warto[. DotNetCLR_Remoting_OBJECT_015_NAME=UsBugi zdalne .NET CLR DotNetCLR_Remoting_OBJECT_015_HELP=Statystyka usBug zdalnych CLR. CONTEXT_REMOTECALLS_INST_015_NAME=WywoBania zdalne na sekund CONTEXT_REMOTECALLS_INST_015_HELP=Ten licznik wskazuje liczb wykonywanych w cigu sekundy wywoBaD procedur zdalnych. WywoBanie procedury zdalnej to wywoBanie dowolnego obiektu spoza domeny aplikacji obiektu wywoBujcego. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. CONTEXT_CHANNELS_015_NAME=KanaBy CONTEXT_CHANNELS_015_HELP=Ten licznik wskazuje caBkowit liczb zdalnych kanaBów zarejestrowanych od chwili uruchomienia aplikacji we wszystkich domenach aplikacji. KanaBy u|ywane s do odbierania komunikatów od obiektów zdalnych i wysyBania komunikatów do tych obiektów. CONTEXT_PROXIES_015_NAME=Kontekstowe obiekty po[redniczce CONTEXT_PROXIES_015_HELP=Ten licznik wskazuje caBkowit liczb zdalnych obiektów po[redniczcych (proxy) utworzonych w procesie od chwili jego uruchomienia. Obiekt po[redniczcy reprezentuje zdalny obiekt i zapewnia, |e wszystkie wywoBania tego obiektu po[redniczcego przesyBane s do odpowiedniego wystpienia obiektu zdalnego. CONTEXT_CLASSES_015_NAME=ZaBadowane klasy zwizane z kontekstem CONTEXT_CLASSES_015_HELP=Ten licznik wskazuje aktualn liczb zaBadowanych klas zwizanych z kontekstem. Klasy, które mog zosta powizane z kontekstem, nazywane s klasami zwizanymi z kontekstem; klasy zwizane z kontekstem oznaczane s przy u|yciu atrybutów kontekstu okre[lajcych zasady u|ycia dotyczce synchronizacji, koligacji wtków, transakcji itp. CONTEXT_OBJALLOC_015_NAME=Przydzielone obiekty zwizane z kontekstem na sekund CONTEXT_OBJALLOC_015_HELP=Ten licznik wskazuje liczb przydzielanych w cigu sekundy obiektów zwizanych z kontekstem. Wystpienia klas, które mog zosta powizane z kontekstem, nazywane s obiektami zwizanymi z kontekstem; klasy zwizane z kontekstem oznaczane s przy u|yciu atrybutów kontekstu okre[lajcych zasady u|ycia dotyczce synchronizacji, koligacji wtków, transakcji itp. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. CONTEXT_CONTEXTS_015_NAME=Konteksty CONTEXT_CONTEXTS_015_HELP=Ten licznik wskazuje aktualn liczb zdalnych kontekstów w aplikacji. Kontekst to obszar zawierajcy kolekcj obiektów z takimi samymi zasadami u|ycia dotyczcymi synchronizacji, koligacji wtków, transakcji itp. CONTEXT_REMOTECALLS_TOTAL_015_NAME=Suma zdalnych wywoBaD CONTEXT_REMOTECALLS_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb wywoBaD procedur zdalnych wykonanych od chwili uruchomienia aplikacji. WywoBanie procedury zdalnej to wywoBanie dowolnego obiektu spoza domeny aplikacji obiektu wywoBujcego. DotNetCLR_Excep_OBJECT_015_NAME=Wyjtki .NET CLR DotNetCLR_Excep_OBJECT_015_HELP=Statystyka dotyczca obsBugi wyjtków CLR w czasie dziaBania. EXCEP_THROWN_TOTAL_015_NAME=Liczba zgBoszonych wyjtków EXCEP_THROWN_TOTAL_015_HELP=Ten licznik wskazuje caBkowit liczb wyjtków, które zostaBy zgBoszone od chwili uruchomienia aplikacji. Uwzgldniane s zarówno wyjtki .NET, jak i niezarzdzane wyjtki, które konwertowane s na wyjtki .NET (np. wyjtek zerowej warto[ci wskaznika w niezarzdzanym kodzie zostanie ponownie zgBoszony w zarzdzanym kodzie jako wyjtek .NET System.NullReferenceException); w liczniku uwzgldniane s zarówno wyjtki obsBugiwane, jak i nieobsBugiwane. Wyjtki zgBaszane ponownie s zliczane ponownie. Wyjtki powinny wystpowa rzadko i nie powinno to mie miejsca w czasie realizacji zwykBego przepBywu sterowania programem. EXCEP_THROWN_INST_015_NAME=Liczba wyjtków na sekund EXCEP_THROWN_INST_015_HELP=Ten licznik wskazuje liczb wyjtków zgBaszanych w cigu sekundy. Uwzgldniane s zarówno wyjtki .NET, jak i niezarzdzane wyjtki, które konwertowane s na wyjtki .NET (np. wyjtek zerowej warto[ci wskaznika w niezarzdzanym kodzie zostanie ponownie zgBoszony w zarzdzanym kodzie jako wyjtek .NET System.NullReferenceException); w liczniku tym uwzgldniane s zarówno wyjtki obsBugiwane, jak i nieobsBugiwane. Wyjtki zgBaszane ponownie s zliczane ponownie. Wyjtki powinny wystpowa rzadko i nie powinno to mie miejsca w czasie realizacji zwykBego przepBywu sterowania programem; licznik sBu|y jako wskaznik potencjalnych problemów zwizanych z wydajno[ci, których przyczyn jest wysoka (>100/s) czstotliwo[ zgBaszania wyjtków. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. TOTAL_EXCEP_FILTERS_RUN_015_NAME=Liczba filtrów na sekund TOTAL_EXCEP_FILTERS_RUN_015_HELP=Ten licznik wskazuje liczb u|ywanych w cigu sekundy filtrów wyjtków .NET. Filtr wyjtków okre[la, czy wyjtek powinien zosta obsBu|ony. Licznik ten [ledzi wspóBczynnik u|ycia filtrów wyjtków bez wzgldu na to, czy okre[lony wyjtek zostaB obsBu|ony. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. TOTAL_EXCEP_FINALLYS_RUN_015_NAME=Liczba wykonywanych bloków finally na sekund TOTAL_EXCEP_FINALLYS_RUN_015_HELP=Ten licznik wskazuje liczb wykonywanych na sekund bloków instrukcji finally. Istnieje gwarancja, |e blok instrukcji finally zostanie wykonany bez wzgldu sposób zakoDczenia dziaBania bloku instrukcji try. Zliczane s tylko te bloki instrukcji finally, które wykonywane s z powodu wystpienia wyjtku; w liczniku tym nie s zliczane bloki instrukcji finally, które wykonane zostaBy w wyniku normalnego dziaBania kodu. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. EXCEPT_STACK_DEPTH_015_NAME=Liczba ramek od zgBoszenia do obsBugi na sekund EXCEPT_STACK_DEPTH_015_HELP=Ten licznik wskazuje liczb ramek stosu na sekund od ramki zgBaszajcej wyjtek .NET do ramki, która obsBu|yBa ten wyjtek. Licznik ten resetowany jest do warto[ci 0 w chwili, gdy wywoBywany jest kod moduBu obsBugi wyjtków, dlatego w wypadku wyjtków zagnie|d|onych wy[wietlana jest warto[ odpowiadajca odlegBo[ci w stosie midzy kodem moduBów obsBugi poszczególnych wyjtków. Licznik ten nie wskazuje warto[ci u[rednionej w czasie; jego warto[ to ró|nica midzy warto[ciami odczytanymi z ostatnich dwóch próbek podzielona przez dBugo[ interwaBu próbkowania. DotNetCLR_Memory_OBJECT_416_NAME=Memória do .NET CLR DotNetCLR_Memory_OBJECT_416_HELP=Contadores da Pilha Coletada pelo Garbage Collector do CLR. GEN0_COLLECTIONS_COUNTER_416_NAME=Nº de Coletas da Ger. 0 GEN0_COLLECTIONS_COUNTER_416_HELP=Esse contador exibe o número de vezes que os objetos da geração 0 (mais novos; alocados mais recentemente) foram coletados pelo Garbage Collector (Ger 0 GC) desde que o aplicativo foi iniciado. Ger 0 GC ocorre quando a memória disponível na geração 0 não é suficiente para atender a uma solicitação de alocação. Esse contador é incrementado ao final de uma coleta Ger 0 GC. Os GCs de geração maiores incluem todas as gerações menores de GCs. Esse contador é incrementado explicitamente quando uma geração maior do GC (Ger 1 ou Ger 2) ocorre. O valor _Global_ counter não é preciso e deve ser ignorado. Esse contador exibe o último valor observado. GEN1_COLLECTIONS_COUNTER_416_NAME=Nº de Coletas da Ger. 1 GEN1_COLLECTIONS_COUNTER_416_HELP=Esse contador exibe o número de vezes que os objetos da geração 1 foram coletados pelo Garbage Collector desde que o aplicativo foi iniciado. O contador é incrementado ao final de uma coleta Ger 1 GC. Os GCs de geração maiores incluem todas as gerações menores de GCs. Esse contador é incrementado explicitamente quando uma geração maior do GC (Ger 2) ocorre. O valor _Global_ counter não é preciso e deve ser ignorado. Esse contador exibe o último valor observado. GEN2_COLLECTIONS_COUNTER_416_NAME=Nº de Coletas da Ger 2 GEN2_COLLECTIONS_COUNTER_416_HELP=Esse contador exibe o número de vezes que objetos da geração 2 (mais antiga) foram coletados pelo Garbage Collector desde que o aplicativo foi iniciado. O contador é incrementado ao final do Ger 2 GC (também chamada de GC total). O valor _Global_ counter não é preciso e deve ser ignorado. Esse contador exibe o último valor observado. GEN0_BYTES_PROMOTED_COUNTER_416_NAME=Memória Promovida da Ger 0 GEN0_BYTES_PROMOTED_COUNTER_416_HELP=Esse contador exibe os bytes de memória que sobrevivem à coleta do Garbage Collector (GC) e são promovidos da geração 0 para a geração 1. Os objetos que são promovidos apenas porque estão aguardando a finalização não são incluídos nesse contador. Esse contador exibe o valor observado ao fim do último GC; ele não é um contador cumulativo. GEN1_BYTES_PROMOTED_COUNTER_416_NAME=Memória Promovida da Ger 1 GEN1_BYTES_PROMOTED_COUNTER_416_HELP=Esse contador exibe os bytes de memória que sobrevivem à coleta do Garbage Collector (GC) e são promovidos da geração 1 para a geração 2. Os objetos que são promovidos apenas porque estão aguardando a finalização não são incluídos nesse contador. Esse contador exibe o valor observado no fim do último GC; ele não é um contador cumulativo. O contador é redefinido como 0 se o último GC tiver sido apenas Ger 0 GC. GEN0_PROMOTION_RATE_416_NAME=Bytes Promovidos da Ger 0/s GEN0_PROMOTION_RATE_416_HELP=Esse contador exibe os bytes que são promovidos da geração 0 (mais nova) para a geração 1 por segundo. Os objetos que são promovidos apenas porque estão aguardando a finalização não são incluídos nesse contador. A memória é promovida quando sobrevive à coleta do Garbage Collector. Esse contador foi criado como indicador de objetos de vida útil relativamente longa, criados por segundo. Ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. GEN1_PROMOTION_RATE_416_NAME=Bytes Promovidos da Ger 1/s GEN1_PROMOTION_RATE_416_HELP=Esse contador exibe os bytes por segundo que são promovidos da geração 1 para a geração 2 (mais antiga). Os objetos que são promovidos apenas porque estão aguardando a finalização não são incluídos nesse contador. A memória é promovida quando sobrevive à coleta do Garbage Collector. Nenhum item é promovido da geração 2, pois ela é a mais antiga. Esse contador foi criado como indicador de objetos de vida útil relativamente longa, criados por segundo. Ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_416_NAME=Finalização Promovida - Memória da Ger 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_416_HELP=Esse contador exibe os bytes de memória que são promovidos da geração 0 para a geração 1 apenas porque estão aguardando a finalização. Esse contador exibe o valor observado no fim do último GC; ele não é um contador cumulativo. PROCESS_ID_416_NAME=Identificação do Processo PROCESS_ID_416_HELP=Este contador exibe a identificação do processo da instância do processo CLR que está sendo monitorado. O valor exibido será 0 até depois da coleta de lixo. GEN0_HEAP_SIZE_COUNTER_416_NAME=Tamanho da pilha da Ger 0 GEN0_HEAP_SIZE_COUNTER_416_HELP=Esse contador exibe a quantidade máxima de bytes que podem ser alocados na geração 0 (Ger 0). Ele não indica o número atual de bytes alocados na Ger 0. Ger 0 GC é disparado quando as alocações desde o último GC excedem esse tamanho. O tamanho da Ger 0 é ajustado pelo Garbage Collector e pode ser alterado durante a execução do aplicativo. No fim da coleta do Ger 0, o tamanho da pilha da Ger 0 é na verdade 0 bytes. Esse contador exibe o tamanho (em bytes) das alocações que deveriam disparar o próximo Ger 0 GC. O contador é atualizado no fim de um GC; ele não é atualizado a cada alocação. GEN1_HEAP_SIZE_COUNTER_416_NAME=Tamanho da pilha da Ger 1 GEN1_HEAP_SIZE_COUNTER_416_HELP=Esse contador exibe o número atual de bytes na geração 1 (Ger 1); o contador não exibe o número máximo da Ger 1. Os objetos não são diretamente alocados nessa geração; eles são promovidos dos Ger 0 GCs anteriores. Esse contador é atualizado no fim de um GC; ele não é atualizado a cada alocação. GEN2_HEAP_SIZE_COUNTER_416_NAME=Tamanho da pilha da Ger 2 GEN2_HEAP_SIZE_COUNTER_416_HELP=Esse contador exibe o número atual de bytes na geração 2 (Ger 2). Os objetos não são diretamente alocados nessa geração; eles são promovidos da Ger 1 durante os Ger 1 GCs anteriores. Esse contador é atualizado no fim de um GC; ele não é atualizado a cada alocação. LARGE_OBJECT_SIZE_COUNTER_416_NAME=Tamanho da Pilha de Objetos Grandes LARGE_OBJECT_SIZE_COUNTER_416_HELP=Este contador exibe o tamanho atual da Pilha de Objetos Grandes em bytes. Os objetos maiores que o limite são tratados como objetos grandes pelo Garbage Collector e são diretamente alocados em uma pilha especial; eles não são promovidos ao longo das gerações. No CLR v1.1 (e acima) este limite é igual a 85000 bytes. O contador é atualizado no fim de um GC; ele não é atualizado a cada alocação. SURVIVE_FINALIZE_COUNTER_416_NAME=Sobreviventes da Finalização SURVIVE_FINALIZE_COUNTER_416_HELP=Esse contador exibe o número de objetos coletados do Garbage Collector que sobreviveram a uma coleta porque estavam aguardando a finalização. Se esses objetos mantiverem referências a outros objetos, eles também sobreviverão, mas não serão contados por esse contador; os contadores "Finalização Promovida - Memória da Ger 0" e "Finalização Promovida - Memória da Ger 1" representam toda a memória que sobreviveu devido à finalização. Esse contador não é cumulativo; ele é atualizado no fim de cada GC apenas com a contagem de sobreviventes durante um GC específico. O contador foi criado para indicar as sobrecargas extras que o aplicativo poderá experimentar devido à finalização. NUM_HANDLES_COUNTER_416_NAME=Nº de Identificadores do GC NUM_HANDLES_COUNTER_416_HELP=Esse contador exibe o número atual de Identificadores do GC em uso. Os GCHandles identificam recursos externos para o CLR e o ambiente gerenciado. Os identificadores ocupam pouco espaço de memória no GCHeap, mas utilizam recursos caros que não estejam sendo gerenciados. ALLOCATION_RATE_COUNTER_416_NAME=Bytes Alocados/s ALLOCATION_RATE_COUNTER_416_HELP=Esse contador exibe a taxa de bytes por segundo alocados na Pilha do GC. Ele é atualizado no fim de cada GC, em vez de em cada alocação. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de tempo. INDUCED_GC_COUNTER_416_NAME=Nº de GCs Induzidos INDUCED_GC_COUNTER_416_HELP=Esse contador exibe o número máximo de vezes que a coleta do Garbage Collector foi executada devido a uma chamada explícita para GC.Collect. É uma boa idéia permitir que o GC ajuste a freqüência das coletas. PER_TIME_IN_GC_COUNTER_416_NAME=% de Tempo Gasto em GC PER_TIME_IN_GC_COUNTER_416_HELP=% de Tempo Gasto em GC é a porcentagem de tempo transcorrido que foi gasto na execução de um GC (Garbage Collector) desde o último ciclo do GC. Esse contador geralmente é um indicador do trabalho concluído pelo Garbage Collector em nome do aplicativo para coletar e compactar memória. Esse contador é atualizado apenas ao final de cada GC, e o valor do contador reflete o último valor observado; não é uma média. PER_TIME_IN_GC_COUNTER_BASE_416_NAME=Não Exibido PER_TIME_IN_GC_COUNTER_BASE_416_HELP=Não Exibido. TOTAL_HEAP_SIZE_COUNTER_416_NAME=Nº de Bytes em Todas as Pilhas TOTAL_HEAP_SIZE_COUNTER_416_HELP=Esse contador reúne a soma de quatro outros contadores: Tamanho em Bytes da Pilha da Ger 0, Tamanho em Bytes da Pilha da Ger 1, Tamanho em Bytes da Pilha da Ger 2 e Tamanho em Bytes da Pilha de Objetos Grandes. Esse contador indica a memória atual alocada em bytes nas Pilhas do GC. TOTAL_COMMITTED_MEM_COUNTER_416_NAME=Nº Total de Bytes Confirmados TOTAL_COMMITTED_MEM_COUNTER_416_HELP=Esse contador exibe a quantidade de memória virtual (em bytes) confirmada atualmente pelo Garbage Collector. (A memória confirmada é a memória física para a qual foi reservado espaço no arquivo de paginação de disco.) TOTAL_RESERVED_MEM_COUNTER_416_NAME=Nº Total de Bytes Reservados TOTAL_RESERVED_MEM_COUNTER_416_HELP=Esse contador exibe a quantidade de memória virtual (em bytes) reservada atualmente pelo Garbage Collector. (A memória reservada é o espaço de memória virtual reservado para o aplicativo sem que nenhuma página de memória principal ou de disco tenha sido usada.) GC_PINNED_OBJECTS_416_NAME=Nº de Objetos Afixados GC_PINNED_OBJECTS_416_HELP=Esse contador exibe o número de objetos afixados que foram encontrados no último GC. Esse contador controla os objetos afixados apenas nas pilhas que foram coletadas do Garbage Collector, isto é, Ger 0 GC causaria apenas a enumeração dos objetos afixados na pilha de geração 0. O Garbage Collector não pode mover um objeto afixado da memória. GC_SINKBLOCKS_416_NAME=Nº de Blocos de Sincronização em Uso GC_SINKBLOCKS_416_HELP=Esse contador exibe o número atual dos blocos Sync em uso. Os blocos Sync são estruturas de dados por objeto alocadas para repositório de informações de sincronização. Os blocos Sync mantêm fracas referências com os objetos gerenciados e precisam ser examinados pelo Garbage Collector. Os blocos Sync não estão limitados ao repositório de informações de sincronização e também podem armazenar metadados interoperacionais COM. Esse contador foi criado para indicar problemas de desempenho com os primitivos de sincronização mais utilizados. DotNetCLR_Loading_OBJECT_416_NAME=Carregamento do .NET CLR DotNetCLR_Loading_OBJECT_416_HELP=Estatísticas para Carregadores de Classe CLR. LOADING_CLASSES_TOTAL_416_NAME=Nº Total de Classes Carregadas LOADING_CLASSES_TOTAL_416_HELP=Esse contador exibe o número cumulativo de classes carregadas em todos os módulos (assemblies) desde que este aplicativo foi iniciado. LOADING_TIME_416_NAME=% de Tempo de Carregamento LOADING_TIME_416_HELP=Reservado para uso futuro. LOADING_ASMSEARCHLEN_416_NAME=Extensão da Pesquisa do Módulo (Assembly) LOADING_ASMSEARCHLEN_416_HELP=Reservado para uso futuro. LOADING_LOADFAILURES_TOTAL_416_NAME=Nº Total Falhas de Carregamento LOADING_LOADFAILURES_TOTAL_416_HELP=Esse contador exibe o número máximo de classes nas quais houve falha de carregamento desde que o aplicativo foi iniciado. Essas falhas de carregamento poderiam ocorrer devido a muitos motivos como segurança inadequada ou formato ilegal. Informações detalhadas poderão ser encontradas na ajuda dos serviços de criação de perfis. LOADING_LOADFAILURES_INST_416_NAME=Taxa de Falhas de Carregamento LOADING_LOADFAILURES_INST_416_HELP=Esse contador exibe o número de classes nas quais houve falha de carregamento por segundo. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos divida pela duração do intervalo de tempo. Essas falhas de carregamento poderiam ocorrer devido a muitos motivos, como, por exemplo, segurança inadequada ou formato ilegal. Informações detalhas poderão ser encontradas na ajuda dos serviços de criação de perfis. LOADING_HEAPSIZE_416_NAME=Bytes na Pilha do Carregador LOADING_HEAPSIZE_416_HELP=Esse contador exibe o tamanho atual (em bytes) da memória confirmada pelo carregador de classes por todos os AppDomains. (A memória confirmada é a memória física para a qual foi reservado espaço no arquivo de paginação de disco.) LOADING_APPDOMAINS_UNLOADED_TOTAL_416_NAME=Nº total de AppDomains não carregados LOADING_APPDOMAINS_UNLOADED_TOTAL_416_HELP=Esse contador exibe o número total de AppDomains não carregados desde que o aplicativo foi iniciado. Se um AppDomain for carregado e descarregado várias vezes, esse contador contará cada um desses descarregamentos separadamente. LOADING_APPDOMAINS_UNLOADED_INST_416_NAME=Taxa de AppDomains não carregados LOADING_APPDOMAINS_UNLOADED_INST_416_HELP=Esse contador exibe o número de AppDomains não carregados por segundo. O contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. LOADING_CLASSES_CUR_416_NAME=Classes Carregadas Atualmente LOADING_CLASSES_CUR_416_HELP=Esse contador exibe o número atual de classes carregadas em todos os módulos (assemblies). LOADING_CLASSES_INST_416_NAME=Taxa de Classes Carregadas LOADING_CLASSES_INST_416_HELP=Esse contador exibe o número de classes carregadas por segundo em todos os Módulos (Assemblies). O contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. LOADING_APPDOMAINS_CUR_416_NAME=AppDomains Atuais LOADING_APPDOMAINS_CUR_416_HELP=Esse contador exibe o número atual de AppDomains carregados neste aplicativo. Os AppDomains (domínios de aplicativos) fornecem uma unidade de processamento segura e versátil que o CLR pode usar para isolar os aplicativos que estejam executando o mesmo processo. LOADING_APPDOMAINS_TOTAL_416_NAME=Nº Total de Appdomains LOADING_APPDOMAINS_TOTAL_416_HELP=Esse contador exibe o número máximo de AppDomains carregados neste aplicativo desde que este aplicativo foi iniciado. Os AppDomains (domínios de aplicativos) fornecem uma unidade de processamento segura e versátil que o CLR pode usar para isolar os aplicativos que estejam executando o mesmo processo. LOADING_APPDOMAINS_INST_416_NAME=Taxa de AppDomains LOADING_APPDOMAINS_INST_416_HELP=Esse contador exibe o número máximo de AppDomains carregados neste aplicativo por segundo. Os AppDomains (domínios de aplicativos) fornecem uma unidade de processamento segura e versátil que o CLR pode usar para isolar os aplicativos que estejam executando o mesmo processo. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. LOADING_ASSEMBLIES_CUR_416_NAME=Módulos (Assemblies) Atuais LOADING_ASSEMBLIES_CUR_416_HELP=Esse contador exibe o número atual de Módulos (Assemblies) carregados por todos os AppDomains neste aplicativo. Se o Módulo (Assembly) for carregado como um domínio neutro de vários AppDomains, esse contador será aumentado apenas uma vez. Os Módulos (Assemblies) podem ser carregados como domínios neutros quando seu código pode ser compartilhado por todos os AppDomains, ou carregados como domínios específicos quando seu código é privativo de um AppDomain. LOADING_ASSEMBLIES_TOTAL_416_NAME=Nº Total de Módulos (Assemblies) LOADING_ASSEMBLIES_TOTAL_416_HELP=Esse contador exibe o número total de Módulos (Assemblies) carregados desde que este aplicativo foi iniciado. Se o Módulo (Assembly) for carregado como um domínio neutro de vários AppDomains, esse contador será aumentado apenas uma vez. Os Módulos (Assemblies) podem ser carregados como domínios neutros quando seu código pode ser compartilhado por todos os AppDomains, ou carregados como domínios específicos quando seu código é privativo de um AppDomain. LOADING_ASSEMBLIES_INST_416_NAME=Taxa de Módulos (Assemblies) LOADING_ASSEMBLIES_INST_416_HELP=Esse contador exibe o número atual de Módulos (Assemblies) carregados por todos os AppDomains por segundo. Se o Módulo (Assembly) for carregado como um domínio neutro de vários AppDomains, esse contador será aumentado apenas uma vez. Os Módulos (Assemblies) podem ser carregados como domínios neutros quando seu código pode ser compartilhado por todos os AppDomains, ou carregados como domínios específicos quando seu código é privativo de um AppDomain. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. DotNetCLR_Jit_OBJECT_416_NAME=Compilador JIT do .NET CLR DotNetCLR_Jit_OBJECT_416_HELP=Estatísticas do Compilador JIT do CLR. TOTAL_METHODS_JITTED_416_NAME=Nº de Métodos com Compilação JIT TOTAL_METHODS_JITTED_416_HELP=Esse contador exibe o número total de métodos compilados JIT (Just-In-Time) pelo compilador JIT do CLR desde que o aplicativo foi iniciado. Esse contador não inclui os métodos pré-compilados JIT. JITTED_IL_CUR_416_NAME=Nº de Bytes de IL com Compilação JIT JITTED_IL_CUR_416_HELP=Esse contador exibe o número total de bytes de IL com compilação JIT desde que o aplicativo foi iniciado. Ele equivale exatamente ao contador "Nº Total de Bytes de IL com Compilação JIT". JITTED_IL_TOTAL_416_NAME=Nº Total de Bytes de IL com Compilação JIT JITTED_IL_TOTAL_416_HELP=Esse contador exibe o número total de bytes IL com compilação JIT desde que o aplicativo foi iniciado. Ele equivale exatamente ao contador "Nº de Bytes de IL com Compilação JIT". JITTED_IL_INST_416_NAME=Bytes de IL com Compilação JIT/s JITTED_IL_INST_416_HELP=Esse contador exibe a taxa usada pelos bytes de IL para realizar a compilação JIT por segundo. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pelo intervalo de exemplo. JIT_FAILURES_416_NAME=Falhas Padrão na Compilação JIT JIT_FAILURES_416_HELP=Esse contador exibe o número máximo de métodos nos quais o compilador JIT não conseguiu realizar a compilação JIT desde que o aplicativo foi iniciado. Essa falha poderá ocorrer se o IL não for verificado ou se houver um erro interno no compilador JIT. TIME_IN_JIT_416_NAME=% de Tempo Gasto no Compilador JIT TIME_IN_JIT_416_HELP=Esse contador exibe a porcentagem de tempo de compilação transcorrida desde a última fase da compilação JIT. Ele é atualizado no fim de cada fase da compilação JIT. Uma fase da compilação JIT é a fase onde um método e suas dependências são compilados. TIME_IN_JIT_BASE_416_NAME=Não Exibido TIME_IN_JIT_BASE_416_HELP=Não Exibido. DotNetCLR_Interop_OBJECT_416_NAME=Interoperabilidade do .NET CLR DotNetCLR_Interop_OBJECT_416_HELP=Estatísticas de interoperabilidade do CLR. CURRENT_CCW_416_NAME=Nº de CCWs CURRENT_CCW_416_HELP=Esse contador exibe o número atual de recipientes CCWs (Com-Callable-Wrappers). Um CCW é um proxy para o objeto gerenciado .NET que esteja sendo referenciado de clientes COM não gerenciados. Esse contador for criado para indicar o número de objetos gerenciados que estejam sendo referenciados pelo código COM não gerenciado. CURRENT_STUBS_416_NAME=Nº de Fragmentos de Código CURRENT_STUBS_416_HELP=Esse contador exibe o número atual de fragmentos de código criados pelo CLR. Os fragmentos de código são responsáveis pelos argumentos de marshalling valores de retorno de código gerenciado para não gerenciado e vice-versa, durante uma chamada de Interoperabilidade COM ou uma chamada PInvoke. NUM_MARSHALLING_416_NAME=Nº de marshalling NUM_MARSHALLING_416_HELP=Esse contador exibe o número total de vezes que os argumentos e os valores de retorno foram empacotados de código gerenciado para não gerenciado e vice-versa, desde que o aplicativo foi iniciado. Esse contador não é aumentado se os fragmentos de código estiverem entre linhas. (Os fragmentos de código são responsáveis pelos argumentos de empacotamento e valores de retorno.) Os marshalling de código geralmente ficam entre linhas se a sobrecarga for pequena. TOTAL_TLB_IMPORTS_416_NAME=Nº de Importações TLB/s TOTAL_TLB_IMPORTS_416_HELP=Reservado para uso futuro. TOTAL_TLB_EXPORTS_416_NAME=Nº de Exportações TLB/s TOTAL_TLB_EXPORTS_416_HELP=Reservado para uso futuro. DotNetCLR_LocksAndThreads_OBJECT_416_NAME=Bloqueios e Segmentos do .NET CLR DotNetCLR_LocksAndThreads_OBJECT_416_HELP=Estatísticas dos Bloqueios e Segmentos do CLR. CONTENTION_TOTAL_416_NAME=Nº Total de Contenções CONTENTION_TOTAL_416_HELP=Esse contador exibe o número total de vezes que os segmentos no CLR tentaram adquirir, sem êxito, um bloqueio gerenciado. Os bloqueios gerenciados podem ser adquiridos de várias maneiras: por meio da instrução "lock" em C# ou pela chamada System.Monitor.Enter, ou ainda pela utilização do atributo personalizado MethodImplOptions.Synchronized. CONTENTION_INST_416_NAME=Taxa de Contenção/s CONTENTION_INST_416_HELP=Taxa na qual os segmentos, em tempo de execução, tentam adquirir um bloqueio gerenciado sem êxito. Os bloqueios gerenciados podem ser adquiridos de várias maneiras: pela instrução "lock" em C#, ou pela chamada System.Monitor.Enter, ou ainda pela utilização do atributo personalizado MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_416_NAME=Tamanho Atual da Fila QUEUE_LENGTH_CUR_416_HELP=Esse contador exibe o número total de segmentos que estão aguardando para adquirir alguns bloqueios gerenciados no aplicativo. Esse contador não é uma média sobre um período de tempo; ele exibe o último valor observado. QUEUE_LENGTH_TOTAL_416_NAME=Tamanho Máximo da Fila QUEUE_LENGTH_TOTAL_416_HELP=Esse contador exibe o número total de segmentos que aguardaram para adquirir alguns bloqueios gerenciados desde que o aplicativo foi iniciado. QUEUE_LENGTH_INST_416_NAME=Tamanho da Fila/s QUEUE_LENGTH_INST_416_HELP=Esse contador exibe o número de segmentos por segundo aguardando para adquirir alguns bloqueios no aplicativo. Esse contador não é uma média sobre o período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. CURRENT_LOGICAL_THREADS_416_NAME=Nº de segmentos lógicos atuais CURRENT_LOGICAL_THREADS_416_HELP=Esse contador exibe o número de objetos de segmento .NET no aplicativo. Um objeto de segmento .NET é criado pelo novo System.Threading.Thread ou quando um segmento não gerenciado entra no ambiente gerenciado. Esse contador mantém o contador executando e parando os segmentos. Ele não é uma média sobre um período de tempo; o contador apenas exibe o último valor observado. CURRENT_PHYSICAL_THREADS_416_NAME=Nº de segmentos físicos atuais CURRENT_PHYSICAL_THREADS_416_HELP=Esse contador exibe o número de segmentos do sistema operacional nativo criados e de propriedade do CLR para agir como segmentos subjacentes dos objetos de segmento do .NET. Esse valor do contador não inclui os segmentos usados pelo CLR em suas operações internas; ele é um subconjunto dos segmentos no processo do sistema operacional. RECOGNIZED_THREADS_CUR_416_NAME=Nº de segmentos reconhecidos atuais RECOGNIZED_THREADS_CUR_416_HELP=Esse contador exibe o número de segmentos que são reconhecidos atualmente pelo CLR; os segmentos possuem um objeto de segmento do .NET correspondente que está associado a eles. Esses segmentos não são criados pelo CLR; eles são criados fora do CLR, mas, logo após a criação, são executados no CLR pelo menos uma vez. Apenas os segmentos exclusivos são controlados; os segmentos com a mesma identificação de segmento que forem reinseridos no CLR ou recriados depois da saída do segmento não serão contados duas vezes. RECOGNIZED_THREADS_TOTAL_416_NAME=Nº total de segmentos reconhecidos RECOGNIZED_THREADS_TOTAL_416_HELP=Esse contador exibe o número total de segmentos que foram reconhecidos atualmente pelo CLR desde que este aplicativo foi iniciado; os segmentos possuem um objeto de segmento do .NET correspondente que está associado a eles. Esses segmentos não são criados pelo CLR; eles são criados fora do CLR, mas, logo após a criação, são executados no CLR pelo menos uma vez. Apenas os segmentos exclusivos são controlados; os segmentos com a mesma identificação de segmento que forem reinseridos no CLR ou recriados depois da saída do segmento não serão contados duas vezes. RECOGNIZED_THREADS_INST_416_NAME=taxa de segmentos reconhecidos/s RECOGNIZED_THREADS_INST_416_HELP=Esse contador exibe o número total de segmentos por segundo que foram reconhecidos pelo CLR; os segmentos possuem um objeto de segmento do .NET correspondente que está associado a eles. Esses segmentos não são criados pelo CLR; eles são criados fora do CLR, mas, logo após a criação, são executados no CLR pelo menos uma vez. Apenas os segmentos exclusivos são controlados; os segmentos com a mesma identificação de segmento que forem reinseridos no CLR ou recriados depois da saída do segmento não serão contados duas vezes. O contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. DotNetCLR_Security_OBJECT_416_NAME=Segurança do .NET CLR DotNetCLR_Security_OBJECT_416_HELP=Estatísticas de Segurança do CLR. SECURITY_TOTALRTCHECKS_416_NAME=Nº Total de Verificações em TE SECURITY_TOTALRTCHECKS_416_HELP=Esse contador exibe o número total de verificações da Segurança do Acesso ao Código (CAS, Code Access Security) em tempo de execução (TE) realizadas desde que o aplicativo foi iniciado. As verificações CAS em tempo de execução são realizadas quando um chamador chama um receptor solicitando uma permissão específica; a verificação é feita pelo exame da pilha de segmentos atual do chamador. Usado junto com "Extensão do Exame da Pilha", esse contador indica as penalidades para o desempenho das verificações de segurança. SECURITY_TIMEAUTHORIZE_416_NAME=% de Tempo de Autenticação de Assinatura SECURITY_TIMEAUTHORIZE_416_HELP=Reservado para uso futuro. SECURITY_LINKCHECKS_416_NAME=Nº de Verificações de Tempo do Link SECURITY_LINKCHECKS_416_HELP=Esse contador exibe o número total de verificações da Segurança do Acesso ao Código (CAS, Code Access Security) do tempo de vinculação realizadas desde que o aplicativo foi iniciado. As verificações CAS do tempo de vinculação são realizadas quando um chamador chama um receptor solicitando uma permissão específica no tempo de compilação JIT; a verificação é feita uma vez para cada chamador. Esse contador não indica problemas de desempenho sérios; ele indica a atividade do sistema de segurança. SECURITY_TIMERTCHECKS_416_NAME=% de Tempo de Verificações em TE SECURITY_TIMERTCHECKS_416_HELP=Esse contador exibe a porcentagem de tempo transcorrido que foi gasto na execução das verificações CAS desde a última verificação desse tipo. A verificação CAS permite que o código se torne confiável em vários níveis e reforça esses níveis de confiança, dependendo da identidade do código. Esse contador é atualizado no fim de uma verificação de segurança em tempo de execução; ele representa o último valor observado, mas não é uma media. SECURITY_TIMERTCHECKS_BASE_416_NAME=Não Exibido SECURITY_TIMERTCHECKS_BASE_416_HELP=Não Exibido. SECURITY_DEPTHSECURITY_416_NAME=Extensão do Exame da Pilha SECURITY_DEPTHSECURITY_416_HELP=Esse contador exibe a extensão da pilha durante a última verificação CAS em tempo de execução. Essa verificação é realizada por meio de pesquisa na pilha. Esse contador não é uma média; ele apenas exibe o último valor observado. DotNetCLR_Remoting_OBJECT_416_NAME=Sistema de Interação Remota do .NET CLR DotNetCLR_Remoting_OBJECT_416_HELP=Estatísticas do Sistema de Interação Remota do CLR. CONTEXT_REMOTECALLS_INST_416_NAME=Chamadas Remotas/s CONTEXT_REMOTECALLS_INST_416_HELP=Esse contador exibe o número de chamadas de procedimento remoto feitas por segundo. Uma chamada de procedimento remoto é uma chamada sobre qualquer objeto fora do AppDomain do chamador. O contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. CONTEXT_CHANNELS_416_NAME=Canais CONTEXT_CHANNELS_416_HELP=Esse contador exibe o número total de canais remotos registrados em todos os AppDomains desde que o aplicativo foi iniciado. Os canais são usados para transportar mensagens para e de objetos remotos. CONTEXT_PROXIES_416_NAME=Proxies de Contexto CONTEXT_PROXIES_416_HELP=Esse contador exibe o número total de objetos de proxy remotos criados nesse processo desde o início do processo. O objeto de proxy age como um representante dos objetos remotos e asseguram que todas as chamadas feitas no proxy serão encaminhadas para a instância do objeto remoto. CONTEXT_CLASSES_416_NAME=Classes Associadas a um Contexto Carregadas CONTEXT_CLASSES_416_HELP=Esse contador exibe o número atual das classes associadas a um contexto que estão carregadas. As classes que podem ser associadas a um contexto são chamadas de classes associadas a um contexto; elas são marcadas com Atributos de Contexto que fornecem regras de uso para sincronização, afinidade de segmento, transações, etc. CONTEXT_OBJALLOC_416_NAME=Alocação de Objetos Associados ao Contexto/s CONTEXT_OBJALLOC_416_HELP=Esse contador exibe o número de objetos associados ao contexto alocados por segundo. As instâncias de classes que podem ser associadas a um contexto são chamadas de objetos associados a um contexto; as classes associadas a um contexto são marcadas com Atributos de Contexto que fornecem regras de uso para sincronização, afinidade de segmento, transações, etc. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. CONTEXT_CONTEXTS_416_NAME=Contextos CONTEXT_CONTEXTS_416_HELP=Esse contador exibe o número atual de contextos remotos no aplicativo. Um contexto é um limite externo que contém um conjunto de objetos com as mesmas regras de uso, como, por exemplo, sincronização, afinidade de segmento, transações, etc. CONTEXT_REMOTECALLS_TOTAL_416_NAME=Nº Total de Chamadas Remotas CONTEXT_REMOTECALLS_TOTAL_416_HELP=Esse contador exibe o número total de chamadas de procedimento remoto realizadas desde que este aplicativo foi iniciado. Uma chamada de procedimento remoto é uma chamada sobre qualquer objeto fora do AppDomain do chamador. DotNetCLR_Excep_OBJECT_416_NAME=Exceções do .NET CLR DotNetCLR_Excep_OBJECT_416_HELP=Estatísticas em tempo de execução de tratamento de exceção do CLR. EXCEP_THROWN_TOTAL_416_NAME=Nº de Exceções Iniciadas EXCEP_THROWN_TOTAL_416_HELP=Esse contador exibe o número total de exceções iniciadas desde que o aplicativo foi iniciado. Nelas estão incluídas as exceções do .NET e as exceções não gerenciadas que são convertidas em exceções do .NET. Por exemplo, a exceção de referência do ponteiro nulo em código não gerenciado seria reiniciado em código gerenciado como um System.NullReferenceException do .NET; esse contador inclui exceções tratadas e não tratadas. As exceções que são reiniciadas seriam contadas novamente. Elas deveriam ocorrer apenas em situações raras e não no fluxo de controle normal do programa. EXCEP_THROWN_INST_416_NAME=Nº de Exceções Iniciadas/s EXCEP_THROWN_INST_416_HELP=Esse contador exibe o número total de exceções iniciadas por segundo desde que o aplicativo foi iniciado. Nelas estão incluídas as exceções do .NET e as exceções não gerenciadas que são convertidas em exceções do .NET. Por exemplo, a exceção de referência do ponteiro nulo em código não gerenciado seria reiniciado em código gerenciado como um System.NullReferenceException do .NET; esse contador inclui exceções tratadas e não tratadas. As exceções deveriam ocorrer apenas em situações raras e não no fluxo de controle normal do programa. Esse contador foi criado como um indicador de problemas de desempenho em potencial devido a grande taxa (>100s) de exceções iniciadas. O contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. TOTAL_EXCEP_FILTERS_RUN_416_NAME=Nº de Filtros/s TOTAL_EXCEP_FILTERS_RUN_416_HELP=Esse contador exibe o número de filtros de exceção do .NET executados por segundo. Um filtro de exceção avalia se uma exceção pode ser tratada ou não. Esse contador controla a taxa de filtros de exceção avaliados; independentemente da exceção ter sido ou não tratada. Esse contador não é uma média sobre um período de tempo; ele exibe a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. TOTAL_EXCEP_FINALLYS_RUN_416_NAME=Nº de Finallys/s TOTAL_EXCEP_FINALLYS_RUN_416_HELP=Esse contador exibe o número de blocos Finally executado por segundo. Um bloco Finally será executado independentemente do modo que o bloco Try tenha sido encerrado. Apenas os blocos Finally que são executados para uma exceção são contados; os blocos Finally nos caminhos de código normal não são contados por esse contador. O contador não é uma média sobre um período de tempo; ele mostra a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. EXCEPT_STACK_DEPTH_416_NAME=Extensão do Início ao Tratamento/s EXCEPT_STACK_DEPTH_416_HELP=Esse contador exibe o número de molduras da pilha desviadas de uma moldura que iniciou a exceção do .NET até a moldura que tratou a exceção por segundo. Esse contador é redefinido como 0 quando um manipulador de exceção é fornecido; desse modo, as exceções aninhadas mostrariam o manipulador para tratar a extensão da pilha do manipulador. Esse contador não é uma média sobre um período de tempo; ele mostra a diferença entre os valores observados nos dois últimos exemplos dividida pela duração do intervalo de exemplo. DotNetCLR_Memory_OBJECT_816_NAME=Memória de .NET CLR DotNetCLR_Memory_OBJECT_816_HELP=Contadores para a pilha de Libertação da Memória CLR. GEN0_COLLECTIONS_COUNTER_816_NAME=N.º de Recolhas de Geração 0 GEN0_COLLECTIONS_COUNTER_816_HELP=Este contador apresenta o número de vezes que os objectos de geração 0 (mais novos; atribuídos mais recentemente) são libertados da memória (GC de Ger 0) desde o início da aplicação. GC de Ger 0 ocorre quando a memória disponível na geração 0 não é suficiente para satisfazer um pedido de atribuição. Este contador é incrementado no final de uma GC de Ger 0. As GCs de geração superior incluem todas as GCs de geração inferior. Este contador é incrementado explicitamente quando ocorre uma GC de geração superior (Ger 1 ou Ger 2). O valor de contador _Global_ não é preciso e deve ser ignorado. Este contador apresenta o último valor observado. GEN1_COLLECTIONS_COUNTER_816_NAME=N.º de Recolhas de Geração 1 GEN1_COLLECTIONS_COUNTER_816_HELP=Este contador apresenta o número de vezes que os objectos de geração 1 são libertados da memória desde o início da aplicação. O contador é incrementado no final de uma GC de Ger 1. As GCs de geração superior incluem todas as GCs de geração inferior. Este contador é incrementado explicitamente quando ocorre uma GC de geração superior (Ger 2). O valor de contador _Global_ não é preciso e deve ser ignorado. Este contador apresenta o último valor observado. GEN2_COLLECTIONS_COUNTER_816_NAME=N.º de Recolhas da Geração 2 GEN2_COLLECTIONS_COUNTER_816_HELP=Este contador apresenta o número de vezes que os objectos de geração 2 (mais antigos) são libertados da memória desde o início da aplicação. O contador é incrementado no final de uma GC de Ger 2 (também denominada GC integral). O valor de contador _Global_ não é preciso e deve ser ignorado. Este contador apresenta o último valor observado. GEN0_BYTES_PROMOTED_COUNTER_816_NAME=Memória Promovida da Geração 0 GEN0_BYTES_PROMOTED_COUNTER_816_HELP=Este contador apresenta os bytes de memória que sobrevivem à libertação da memória (GC) e que são promovidos da geração 0 para a geração 1; os objectos promovidos apenas porque aguardam finalização não são incluídos neste contador. Este contador apresenta o valor observado no final da última GC; não é um contador cumulativo. GEN1_BYTES_PROMOTED_COUNTER_816_NAME=Memória Promovida da Geração 1 GEN1_BYTES_PROMOTED_COUNTER_816_HELP=Este contador apresenta os bytes de memória que sobrevivem à libertação da memória (GC) e são promovidos da geração 1 para a geração 2; os objectos promovidos apenas porque aguardam finalização não são incluídos neste contador. Este contador apresenta o valor observado no final da última GC; não é um contador cumulativo. Este contador é apenas reposto para 0 se a última GC tiver sido uma GC de Ger 0. GEN0_PROMOTION_RATE_816_NAME=Bytes/Seg. Promovidos da Geração 0 GEN0_PROMOTION_RATE_816_HELP=Este contador apresenta os bytes por segundo que são promovidos da geração 0 (mais nova) para a geração 1; os objectos promovidos apenas porque aguardam finalização não são incluídos neste contador. A memória é promovida quando sobrevive a uma libertação da memória. Este contador foi concebido como indicador do número de objectos relativamente duradouros criados por segundo. Este contador apresenta a diferença entre os valores observados nas duas últimas amostras divididos pela duração do intervalo de amostragem. GEN1_PROMOTION_RATE_816_NAME=Bytes/Seg. Promovidos da Geração 1 GEN1_PROMOTION_RATE_816_HELP=Este contador apresenta os bytes por segundo que são promovidos da geração 1 para a geração 2 (mais antiga); os objectos promovidos apenas porque aguardam finalização não são incluídos neste contador. A memória é promovida quando sobrevive a uma libertação da memória. Nada é promovido da geração 2 porque é a mais antiga. Este contador foi concebido como indicador do número de objectos extremamente duradouros criados por segundo. Este contador apresenta a diferença entre os valores observados nas duas últimas amostras divididos pela duração do intervalo de amostragem. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_816_NAME=Finalização Promovida - Memória da Geração 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_816_HELP=Este contador apresenta os bytes de memória que são promovidos da geração 0 para a geração 1 apenas porque aguardam finalização. Este contador apresenta o valor observado no final da última GC; não é um contador cumulativo. PROCESS_ID_816_NAME=ID do Processo PROCESS_ID_816_HELP=Este contador apresenta o ID de processo da instância do processo CLR que está a ser monitorizada. O valor apresentado será 0 até depois da primeira libertação da memória. GEN0_HEAP_SIZE_COUNTER_816_NAME=Tamanho da pilha da geração 0 GEN0_HEAP_SIZE_COUNTER_816_HELP=Este contador apresenta o número máximo de bytes que podem ser atribuídos na geração 0 (Ger 0); não indica o número actual de bytes atribuídos na Ger 0. Uma GC de Ger 0 é accionada quando as atribuições desde a última GC tiverem excedido este tamanho. O tamanho da Ger 0 é optimizado pelo Garbage Collector e pode ser alterado durante a execução da aplicação. No final de uma recolha Ger 0, o tamanho da pilha Ger 0 é, de facto, 0 bytes; este contador apresenta o tamanho (em bytes) das atribuições que iriam accionar a próxima Ger 0 GC. Este contador é actualizado no final de uma GC; não é actualizado em todas as atribuições. GEN1_HEAP_SIZE_COUNTER_816_NAME=Tamanho da pilha da geração 1 GEN1_HEAP_SIZE_COUNTER_816_HELP=Este contador apresenta o número actual de bytes na geração 1 (Ger 1); este contador não apresenta o tamanho máximo da Geração 1. Os objectos não são atribuídos directamente nesta geração; são promovidos de GCs de Ger 0 anteriores. Este contador é actualizado no final de uma GC; não é actualizado em todas as atribuições. GEN2_HEAP_SIZE_COUNTER_816_NAME=Tamanho da pilha da geração 2 GEN2_HEAP_SIZE_COUNTER_816_HELP=Este contador apresenta o número actual de bytes na geração 2 (Ger 2). Os objectos não são atribuídos directamente nesta geração; são promovidos da Ger 1 durante as GCs da Ger 1 anteriores. Este contador é actualizado no final de uma GC; não é actualizado em todas as atribuições. LARGE_OBJECT_SIZE_COUNTER_816_NAME=Tamanho da Pilha de Objectos Grandes LARGE_OBJECT_SIZE_COUNTER_816_HELP=Este contador apresenta o tamanho actual, em bytes, da Área Dinâmica para Dados de Objectos Grandes. Os objectos maiores que um limiar são processados como objectos grandes pelo Garbage Collector e são alocados directamente a uma área dinâmica para dados especial; não são promovidos pelas gerações. No CLR v1.1 e versões superiores, este limiar é igual a 85000 bytes. Este contador é actualizado no final de um GC; não é actualizado em todas as alocações. SURVIVE_FINALIZE_COUNTER_816_NAME=Sobreviventes da Finalização SURVIVE_FINALIZE_COUNTER_816_HELP=Este contador apresenta o número de objectos libertados da memória que sobrevivem a uma recolha porque aguardam finalização. Se estes objectos tiverem referências a outros objectos, então esses objectos também sobrevivem mas não são contabilizados por este contador; os contadores 'Finalização Promovida - Memória da Geração 0' e 'Finalização Promovida - Memória da Geração 1' representam toda a memória que sobreviveu devido à finalização. Este contador não é cumulativo; é actualizado no final de cada GC com a contagem dos sobreviventes apenas durante essa GC específica. Este contador foi concebido para indicar a sobrecarga extra em que a aplicação pode incorrer devido à finalização. NUM_HANDLES_COUNTER_816_NAME=N.º de Identificadores de GC NUM_HANDLES_COUNTER_816_HELP=Este contador apresenta o número actual de Identificadores de GC em utilização. Os GCHandles são identificadores para recursos externos ao CLR e ao ambiente gerido. Os identificadores ocupam pequenas quantidades de memória em GCHeap, mas recursos não geridos possivelmente dispendiosos. ALLOCATION_RATE_COUNTER_816_NAME=Bytes/seg. atribuídos ALLOCATION_RATE_COUNTER_816_HELP=Este contador apresenta a taxa de bytes por segundo atribuída na Pilha GC. Este contador é actualizado no final de cada GC; não em cada atribuição. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. INDUCED_GC_COUNTER_816_NAME=N.º de GC Induzidas INDUCED_GC_COUNTER_816_HELP=Este contador apresenta o número máximo de vezes que uma libertação da memória foi efectuada devido a uma chamada explícita para GC.Collect. Recomenda-se que seja a GC a optimizar a frequência das respectivas recolhas. PER_TIME_IN_GC_COUNTER_816_NAME=% de Tempo na GC PER_TIME_IN_GC_COUNTER_816_HELP=% de Tempo na GC é a percentagem de tempo decorrido despendido na execução de uma libertação de memória (GC) desde o último ciclo de GC. Este contador é normalmente um indicador do trabalho efectuado pelo Garbage Collector em nome da aplicação para recolher e compactar memória. Este contador é actualizado apenas no final de cada GC e o valor do contador reflecte o último valor observado; não consiste numa média. PER_TIME_IN_GC_COUNTER_BASE_816_NAME=Não Apresentado PER_TIME_IN_GC_COUNTER_BASE_816_HELP=Não Apresentado. TOTAL_HEAP_SIZE_COUNTER_816_NAME=N.º de Bytes em todas as Pilhas TOTAL_HEAP_SIZE_COUNTER_816_HELP=Este contador é a soma de quatro outros contadores; Tamanho da Pilha de Ger 0; Tamanho da Pilha de Ger 1; Tamanho da Pilha de Ger 2 e Tamanho da Pilha de Objectos Grandes. Este contador indica a memória actual atribuída em bytes nas Pilhas GC. TOTAL_COMMITTED_MEM_COUNTER_816_NAME=N.º Total de Bytes consolidados TOTAL_COMMITTED_MEM_COUNTER_816_HELP=Este contador apresenta a quantidade de memória virtual (em bytes) consolidada actualmente pelo Garbage Collector. (Memória consolidada é a memória física para a qual foi reservado espaço no ficheiro de paginação do disco). TOTAL_RESERVED_MEM_COUNTER_816_NAME=N.º Total de Bytes reservados TOTAL_RESERVED_MEM_COUNTER_816_HELP=Este contador apresenta a quantidade de memória virtual (em bytes) reservada actualmente pelo Garbage Collector. (Memória reservada é o espaço de memória virtual reservado para a aplicação, mas não foram utilizadas páginas da memória principal ou disco.) GC_PINNED_OBJECTS_816_NAME=N.º de Objectos Fixos GC_PINNED_OBJECTS_816_HELP=Este contador apresenta o número de objectos fixos encontrados na última GC. Este contador controla apenas os objectos fixos nas pilhas sujeitas à libertação da memória, por exemplo, uma GC de Ger 0 causaria a enumeração de objectos fixos apenas na pilha de geração 0. Um objecto fixo é aquele que o Garbage Collector não consegue mover na memória. GC_SINKBLOCKS_816_NAME=N.º de Blocos de Sinc. em Utilização GC_SINKBLOCKS_816_HELP=Este contador apresenta o número actual de blocos de sincronização em utilização. Os blocos de sincronização são estruturas de dados por objecto atribuídas para armazenar informações de sincronização. Os blocos de sincronização contêm referências ligeiras a objectos geridos e devem ser pesquisados pelo Garbage Collector. Os blocos de sincronização não estão limitados ao armazenamento de informações de sincronização e também podem armazenar metadados de interoperabilidade COM. Este contador foi concebido para indicar problemas de desempenho com grande utilização de tipos primitivos de sincronização. DotNetCLR_Loading_OBJECT_816_NAME=Carregamento de .NET CLR DotNetCLR_Loading_OBJECT_816_HELP=Estatísticas para o Carregador de Classes CLR. LOADING_CLASSES_TOTAL_816_NAME=Total de Classes Carregadas LOADING_CLASSES_TOTAL_816_HELP=Este contador apresenta o número cumulativo de classes carregadas em todas as Assemblagens desde o início desta aplicação. LOADING_TIME_816_NAME=% do Tempo de Carregamento LOADING_TIME_816_HELP=Reservado para utilização futura. LOADING_ASMSEARCHLEN_816_NAME=Comprimento de Pesquisa da Assemblagem LOADING_ASMSEARCHLEN_816_HELP=Reservado para utilização futura. LOADING_LOADFAILURES_TOTAL_816_NAME=N.º Total de Falhas no Carregamento LOADING_LOADFAILURES_TOTAL_816_HELP=Este contador apresenta o número máximo de classes com falha no carregamento desde o início da aplicação. Estas falhas no carregamento podem dever-se a muitos motivos como, por exemplo, segurança indevida ou formato inválido. É possível obter detalhes completos na ajuda relativa aos serviços de criação de perfis. LOADING_LOADFAILURES_INST_816_NAME=Taxa de Falhas no Carregamento LOADING_LOADFAILURES_INST_816_HELP=Este contador apresenta o número de classes com falhas no carregamento por segundo. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. Estas falhas no carregamento podem dever-se a muitos motivos como, por exemplo, segurança indevida ou formato inválido. É possível obter detalhes completos na ajuda relativa aos serviços de criação de perfis. LOADING_HEAPSIZE_816_NAME=Bytes na Pilha do Carregador LOADING_HEAPSIZE_816_HELP=Este contador apresenta o tamanho actual (em bytes) da memória consolidada pelo carregador de classes em todos os AppDomains. (Memória consolidada é a memória física para a qual foi reservado espaço no ficheiro de paginação do disco.) LOADING_APPDOMAINS_UNLOADED_TOTAL_816_NAME=Total de domínios de aplicação descarregados LOADING_APPDOMAINS_UNLOADED_TOTAL_816_HELP=Este contador apresenta o número total de AppDomains descarregados desde o início da aplicação. Se um AppDomain for carregado e descarregado várias vezes, este contador conta cada um dos descarregamentos em separado. LOADING_APPDOMAINS_UNLOADED_INST_816_NAME=Taxa de domínios de aplicação descarregados LOADING_APPDOMAINS_UNLOADED_INST_816_HELP=Este contador apresenta o número de AppDomains descarregados por segundo. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. LOADING_CLASSES_CUR_816_NAME=Classes Carregadas Actualmente LOADING_CLASSES_CUR_816_HELP=Este contador apresenta o número actual de classes carregadas em todas as Assemblagens. LOADING_CLASSES_INST_816_NAME=Taxa de Classes Carregadas LOADING_CLASSES_INST_816_HELP=Este contador apresenta o número de classes carregadas por segundo em todas as Assemblagens. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. LOADING_APPDOMAINS_CUR_816_NAME=Domínios de aplicação actuais LOADING_APPDOMAINS_CUR_816_HELP=Este contador apresenta o número actual de AppDomains carregados nesta aplicação. Os AppDomains (domínios de aplicação) fornecem uma unidade de processamento segura e versátil que pode ser utilizada por CLR para proporcionar o isolamento entre aplicações em execução no mesmo processo. LOADING_APPDOMAINS_TOTAL_816_NAME=Total de Appdomains LOADING_APPDOMAINS_TOTAL_816_HELP=Este contador apresenta o número máximo de AppDomains carregados desde o início desta aplicação. Os AppDomains (domínios de aplicação) fornecem uma unidade de processamento segura e versátil que pode ser utilizada por CLR para proporcionar o isolamento entre aplicações em execução no mesmo processo. LOADING_APPDOMAINS_INST_816_NAME=Taxa de domínios de aplicação LOADING_APPDOMAINS_INST_816_HELP=Este contador apresenta o número de AppDomains carregados por segundo. Os AppDomains (domínios de aplicação) fornecem uma unidade de processamento segura e versátil que pode ser utilizada por CLR para proporcionar o isolamento entre aplicações em execução no mesmo processo. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. LOADING_ASSEMBLIES_CUR_816_NAME=Assemblagens Actuais LOADING_ASSEMBLIES_CUR_816_HELP=Este contador apresenta o número actual de Assemblagens carregadas em todos os AppDomains nesta aplicação. Se a Assemblagem for carregada como neutra no domínio entre múltiplos AppDomains, então este contador só é incrementado uma vez. É possível carregar assemblagens como neutras no domínio quando o respectivo código pode ser partilhado por todos os AppDomains ou podem ser carregadas como específicas do domínio quando o respectivo código é privado do AppDomain. LOADING_ASSEMBLIES_TOTAL_816_NAME=Total de Assemblagens LOADING_ASSEMBLIES_TOTAL_816_HELP=Este contador apresenta o número total de Assemblagens carregadas desde o início desta aplicação. Se a Assemblagem for carregada como neutra no domínio entre múltiplos AppDomains, então este contador só é incrementado uma vez. É possível carregar assemblagens como neutras no domínio quando o respectivo código pode ser partilhado por todos os AppDomains ou podem ser carregadas como específicas do domínio quando o respectivo código é privado do AppDomain. LOADING_ASSEMBLIES_INST_816_NAME=Taxa de Assemblagens LOADING_ASSEMBLIES_INST_816_HELP=Este contador apresenta o número de Assemblagens carregadas em todos os AppDomains por segundo. Se a Assemblagem for carregada como neutra no domínio entre múltiplos AppDomains, então este contador só é incrementado uma vez. É possível carregar assemblagens como neutras no domínio quando o respectivo código pode ser partilhado por todos os AppDomains ou podem ser carregadas como específicas do domínio quando o respectivo código é privado do AppDomain. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. DotNetCLR_Jit_OBJECT_816_NAME=JIT de .NET CLR DotNetCLR_Jit_OBJECT_816_HELP=Estatísticas para JIT de CLR. TOTAL_METHODS_JITTED_816_NAME=N.º de Métodos com Compilação JIT TOTAL_METHODS_JITTED_816_HELP=Este contador apresenta o número total de métodos compilados Just-In-Time (JIT) pelo compilador JIT de CLR desde o início da aplicação. Este contador não inclui métodos anteriores à compilação JIT. JITTED_IL_CUR_816_NAME=N.º de Bytes de IL com Compilação JIT JITTED_IL_CUR_816_HELP=Este contador apresenta o total de bytes de IL com compilação JIT desde o início da aplicação. Este contador é exactamente equivalente ao "N.º Total de Bytes de IL com Compilação JIT". JITTED_IL_TOTAL_816_NAME=N.º Total de Bytes de IL com Compilação JIT JITTED_IL_TOTAL_816_HELP=Este contador apresenta o total de bytes de IL com compilação JIT desde o início da aplicação. Este contador é exactamente equivalente ao "N.º de Bytes de IL com Compilação JIT". JITTED_IL_INST_816_NAME=Bytes de IL com Compilação JIT/ seg. JITTED_IL_INST_816_HELP=Este contador apresenta a taxa a que os bytes de IL passam pela compilação JIT por segundo. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. JIT_FAILURES_816_NAME=Falhas no JIT Padrão JIT_FAILURES_816_HELP=Este contador apresenta o número máximo de métodos com falhas na compilação JIT pelo compilador JIT desde o início da aplicação. Esta falha pode ocorrer se não for possível verificar o IL ou se ocorrer um erro interno no compilador JIT. TIME_IN_JIT_816_NAME=% de Tempo na Compilação JIT TIME_IN_JIT_816_HELP=Este contador apresenta a percentagem de tempo decorrido despendido na compilação JIT desde a última etapa de compilação JIT. Este contador é actualizado no final de cada etapa de compilação JIT. Uma etapa de compilação JIT é a etapa em que um método e as respectivas dependências são compiladas. TIME_IN_JIT_BASE_816_NAME=Não Apresentado TIME_IN_JIT_BASE_816_HELP=Não Apresentado. DotNetCLR_Interop_OBJECT_816_NAME=Interoperabilidade de .NET CLR DotNetCLR_Interop_OBJECT_816_HELP=Estatísticas para Interoperabilidade de CLR. CURRENT_CCW_816_NAME=N.º de CCWs CURRENT_CCW_816_HELP=Este contador apresenta o número actual de Com-Callable-Wrappers (CCW). Um CCW é um proxy para o objecto gerido .NET referido por clientes COM não geridos. Este contador foi concebido para indicar o número de objectos geridos referidos pelo código COM não gerido. CURRENT_STUBS_816_NAME=N.º de Stubs CURRENT_STUBS_816_HELP=Este contador apresenta o número actual de stubs criados pelo CLR. Os stubs são responsáveis pelo marshalling de argumentos e valores de retorno de código gerido para não gerido e vice-versa; durante uma chamada COM Interop ou PInvoke. NUM_MARSHALLING_816_NAME=N.º de marshalling NUM_MARSHALLING_816_HELP=Este contador apresenta o número total de vezes que os argumentos e os valores de retorno foram submetidos a marshalling de código gerido para não gerido e vice-versa desde o início da aplicação. Este contador não é incrementado se os stubs estiverem incorporados. (Os stubs são responsáveis pelo marshalling de argumentos e valores de retorno). Os stubs ficam normalmente inline se a sobrecarga de marshalling for pequena. TOTAL_TLB_IMPORTS_816_NAME=N.º de importações de TLB / seg. TOTAL_TLB_IMPORTS_816_HELP=Reservado para utilização futura. TOTAL_TLB_EXPORTS_816_NAME=N.º de exportações de TLB / seg. TOTAL_TLB_EXPORTS_816_HELP=Reservado para utilização futura. DotNetCLR_LocksAndThreads_OBJECT_816_NAME=Bloqueios e Threads de .NET CLR DotNetCLR_LocksAndThreads_OBJECT_816_HELP=Estatísticas para Bloqueios e Threads CLR. CONTENTION_TOTAL_816_NAME=N.º Total de Contenções CONTENTION_TOTAL_816_HELP=Este contador apresenta o número total de vezes que os threads no CLR tentaram adquirir sem êxito um bloqueio gerido. É possível adquirir bloqueios geridos de várias maneiras: através da instrução "lock" em C# ou da chamada para System.Monitor.Enter, ou utilizando o atributo personalizado MethodImplOptions.Synchronized. CONTENTION_INST_816_NAME=Taxa de Contenção / seg. CONTENTION_INST_816_HELP=Frequência com que os threads tentam adquirir sem êxito, em tempo de execução, um bloqueio gerido. É possível adquirir bloqueios geridos de várias maneiras: através da instrução "lock" de C# ou da chamada para System.Monitor.Enter, ou utilizando o atributo personalizado MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_816_NAME=Comprimento da Fila Actual QUEUE_LENGTH_CUR_816_HELP=Este contador apresenta o número total de threads que aguardam a aquisição de algum bloqueio gerido na aplicação. Este contador não consiste numa média temporal; apresenta o último valor observado. QUEUE_LENGTH_TOTAL_816_NAME=Comprimento Máximo da Fila QUEUE_LENGTH_TOTAL_816_HELP=Este contador apresenta o número total de threads que aguardaram a aquisição de algum bloqueio gerido desde o início da aplicação. QUEUE_LENGTH_INST_816_NAME=Comprimento da Fila / seg QUEUE_LENGTH_INST_816_HELP=Este contador apresenta o número de threads por segundo que aguardam a aquisição de algum bloqueio na aplicação. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. CURRENT_LOGICAL_THREADS_816_NAME=N.º de Threads lógicos actuais CURRENT_LOGICAL_THREADS_816_HELP=Este contador apresenta o número actual de objectos de thread .NET na aplicação. Um objecto de thread .NET é criado por um novo valor System.Threading.Thread ou quando um thread não gerido entra no ambiente gerido. Este contador mantém a contagem dos threads em execução e parados. Este contador não consiste numa média temporal; apresenta apenas o último valor observado. CURRENT_PHYSICAL_THREADS_816_NAME=N.º de Threads físicos actuais CURRENT_PHYSICAL_THREADS_816_HELP=Este contador apresenta o número de threads nativos do SO criados e pertencentes ao CLR que deverão agir como threads subjacentes para objectos de thread .NET. Este valor do contador não inclui os threads utilizados pelo CLR nas respectivas operações internas; trata-se de um subconjunto dos threads no processo do SO. RECOGNIZED_THREADS_CUR_816_NAME=N.º de threads reconhecidos actuais RECOGNIZED_THREADS_CUR_816_HELP=Este contador apresenta o número de threads reconhecidos actualmente pelo CLR; têm um objecto de thread .NET correspondente associado. Estes threads não são criados pelo CLR; são criados fora do CLR mas, a partir desse momento, foram executados no CLR pelo menos uma vez. Só são controlados os threads únicos; os threads com o mesmo ID de thread reintroduzidos no CLR ou recriados após a saída do thread não são contabilizados duas vezes. RECOGNIZED_THREADS_TOTAL_816_NAME=N.º total de threads reconhecidos RECOGNIZED_THREADS_TOTAL_816_HELP=Este contador apresenta o número total de threads reconhecidos pelo CLR desde o início desta aplicação; estes threads têm um objecto de thread .NET correspondente associado. Estes threads não são criados pelo CLR; são criados fora do CLR mas, a partir desse momento, foram executados no CLR pelo menos uma vez. Só são controlados os threads únicos; os threads com o mesmo ID de thread reintroduzidos no CLR ou recriados após a saída do thread não são contabilizados duas vezes. RECOGNIZED_THREADS_INST_816_NAME=taxa de threads reconhecidos / seg. RECOGNIZED_THREADS_INST_816_HELP=Este contador apresenta o número de threads por segundo reconhecidos pelo CLR; estes threads têm um objecto de thread .NET correspondente associado. Estes threads não são criados pelo CLR; são criados fora do CLR mas, a partir desse momento, foram executados no CLR pelo menos uma vez. Só são controlados os threads únicos; os threads com o mesmo ID de thread reintroduzidos no CLR ou recriados após a saída do thread não são contabilizados duas vezes. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. DotNetCLR_Security_OBJECT_816_NAME=Segurança de .NET CLR DotNetCLR_Security_OBJECT_816_HELP=Estatísticas para Segurança de CLR. SECURITY_TOTALRTCHECKS_816_NAME=Total de Verificações em Tempo de Execução SECURITY_TOTALRTCHECKS_816_HELP=Este contador apresenta o número total de verificações de Segurança de Acesso a Código (CAS) em tempo de execução efectuadas desde o início da aplicação. As verificações de CAS em tempo de execução são executadas quando um autor de chamada efectua uma chamada para um receptor de chamadas a solicitar uma determinada permissão; a verificação em tempo de execução é efectuada em todas as chamadas do autor da chamada; a verificação é feita examinando a pilha actual de threads do autor da chamada. Utilizado em conjunto com "Profundidade do Percurso da Pilha", este contador é indicativo da penalização de desempenho para verificações de segurança. SECURITY_TIMEAUTHORIZE_816_NAME=% de Tempo para Autenticação da Assinatura SECURITY_TIMEAUTHORIZE_816_HELP=Reservado para utilização futura. SECURITY_LINKCHECKS_816_NAME=N.º de Verificações em Tempo de Ligação SECURITY_LINKCHECKS_816_HELP=Este contador apresenta o número total de verificações de Segurança de Acesso a Código (CAS) em tempo de ligação desde o início da aplicação. As verificações de CAS em tempo de ligação são executadas quando um autor de chamada efectua uma chamada para um receptor de chamadas a solicitar uma determinada permissão no tempo de compilação JIT; a verificação em tempo de ligação é efectuada uma vez por autor de chamada. Esta contagem não é indicativa de problemas graves de desempenho; é indicativa da actividade do sistema de segurança. SECURITY_TIMERTCHECKS_816_NAME=% de Tempo em verificações RT SECURITY_TIMERTCHECKS_816_HELP=Este contador apresenta a percentagem de tempo decorrido despendido na execução de verificações de Segurança de Acesso a Código (CAS) em tempo de execução desde a última verificação desse tipo. A CAS permite vários níveis de fidedignidade do código e implementa-os consoante a identidade do código. Este contador é actualizado no final de uma verificação de segurança em tempo de execução; representa o último valor observado; não consiste numa média. SECURITY_TIMERTCHECKS_BASE_816_NAME=Não Apresentado SECURITY_TIMERTCHECKS_BASE_816_HELP=Não Apresentado. SECURITY_DEPTHSECURITY_816_NAME=Profundidade do Percurso da Pilha SECURITY_DEPTHSECURITY_816_HELP=Este contador apresenta a profundidade da pilha durante essa última verificação de Segurança de Acesso a Código (CAS) em tempo de execução. A verificação de Segurança de Acesso a Código em tempo de execução é efectuada através da pesquisa da pilha. Este contador não consiste numa média; apresenta apenas o último valor observado. DotNetCLR_Remoting_OBJECT_816_NAME=Comunicação Remota .NET CLR DotNetCLR_Remoting_OBJECT_816_HELP=Estatísticas de Comunicação Remota de CLR. CONTEXT_REMOTECALLS_INST_816_NAME=Chamadas Remotas/seg. CONTEXT_REMOTECALLS_INST_816_HELP=Este contador apresenta o número de chamadas de procedimento remotas invocadas por segundo. Uma chamada de procedimento remota é uma chamada para qualquer objecto fora do AppDomain do autor da chamada. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. CONTEXT_CHANNELS_816_NAME=Canais CONTEXT_CHANNELS_816_HELP=Este contador apresenta o número total de canais de comunicação remota registados em todos os AppDomains desde o início da aplicação. São utilizados canais para transportar as mensagens de e para objectos remotos. CONTEXT_PROXIES_816_NAME=Proxies de Contexto CONTEXT_PROXIES_816_HELP=Este contador apresenta o número total de objectos proxy de comunicação remota criados neste processo desde o início do processo. Os objectos proxy agem como representantes dos objectos remotos e asseguram que todas as chamadas efectuadas no proxy são reencaminhadas para a instância correcta do objecto remoto. CONTEXT_CLASSES_816_NAME=Classes Dependentes do Contexto Carregadas CONTEXT_CLASSES_816_HELP=Este contador apresenta o número actual de classes dependentes do contexto carregadas. As classes que podem estar dependentes de um contexto denominam-se classes dependentes do contexto; estas classes são marcadas com Atributos de Contexto, que fornecem regras de utilização para sincronização; afinidade de threads, transacções, etc. CONTEXT_OBJALLOC_816_NAME=Objectos Dependentes do Contexto Atribuídos / seg. CONTEXT_OBJALLOC_816_HELP=Este contador apresenta o número de objectos dependentes do contexto atribuídos por segundo. As instâncias de classes que podem estar dependentes de um contexto denominam-se objectos dependentes do contexto; essas classes são marcadas com Atributos de Contexto, que fornecem as regras de utilização para sincronização; afinidade de threads, transacções, etc. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. CONTEXT_CONTEXTS_816_NAME=Contextos CONTEXT_CONTEXTS_816_HELP=Este contador apresenta o número actual de contextos de comunicação remota na aplicação. Um contexto é um limite que contém uma colecção de objectos com as mesmas regras de utilização, tais como sincronização; afinidade de threads; transacções, etc. CONTEXT_REMOTECALLS_TOTAL_816_NAME=Total de Chamadas Remotas CONTEXT_REMOTECALLS_TOTAL_816_HELP=Este contador apresenta o número total de chamadas de procedimento remoto invocadas desde o início desta aplicação. Uma chamada de procedimento remoto é uma chamada para qualquer objecto fora do AppDomain do autor da chamada. DotNetCLR_Excep_OBJECT_816_NAME=Excepções de .NET CLR DotNetCLR_Excep_OBJECT_816_HELP=Estatísticas em tempo de execução do processamento de excepções de CLR. EXCEP_THROWN_TOTAL_816_NAME=N.º de Excepções Iniciadas EXCEP_THROWN_TOTAL_816_HELP=Este contador apresenta o número total de excepções geradas desde o início da aplicação. Inclui as excepções .NET e não geridas que são convertidas em excepções .NET, por exemplo, uma excepção de referência de ponteiro nulo em código não gerido seria novamente gerada em código gerido como um valor .NET System.NullReferenceException; este contador inclui excepções processadas e não processadas. As excepções novamente geradas seriam contabilizadas de novo. As excepções só devem ocorrer em situações raras e não no fluxo de controlo normal do programa. EXCEP_THROWN_INST_816_NAME=N.º de Excepções Geradas / seg. EXCEP_THROWN_INST_816_HELP=Este contador apresenta o número de excepções geradas por segundo. Inclui excepções .NET e excepções não geridas que são convertidas em excepções .NET, por exemplo, uma excepção de referência de ponteiro nulo em código não gerido seria novamente gerada em código gerido como um valor .NET System.NullReferenceException; este contador inclui excepções processadas e não processadas. As excepções só devem ocorrer em situações raras e não no fluxo de controlo normal do programa; este contador foi concebido como indicador de possíveis problemas de desempenho devido a uma elevada taxa de excepções geradas (>100). Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. TOTAL_EXCEP_FILTERS_RUN_816_NAME=N.º de Filtros / seg. TOTAL_EXCEP_FILTERS_RUN_816_HELP=Este contador apresenta o número de filtros de excepção .NET executados por segundo. Um filtro de excepção avalia se uma excepção deve, ou não, ser processada. Este contador controla a taxa de filtros de excepção avaliados, independentemente de a excepção ter, ou não, sido processada. Este contador não consiste numa média ao longo do tempo; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. TOTAL_EXCEP_FINALLYS_RUN_816_NAME=N.º de Bloqueios Finally / seg. TOTAL_EXCEP_FINALLYS_RUN_816_HELP=Este contador apresenta o número de bloqueios Finally executados por segundo. Um bloqueio Finally é sempre executado independentemente da saída do bloqueio Try. Só são contabilizados os bloqueios Finally executados para uma excepção; os bloqueios Finally em caminhos de código normal não são contabilizadas por este contador. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. EXCEPT_STACK_DEPTH_816_NAME=Profundidade de Throw a Catch / seg. EXCEPT_STACK_DEPTH_816_HELP=Este contador apresenta o número de estruturas de pilha percorridas desde a estrutura que gerou a excepção .NET até à estrutura que processou a excepção por segundo. Este contador é reposto para 0 quando um processador de excepções é iniciado; deste modo, as excepções aninhadas deveriam apresentar a profundidade da pilha entre processadores. Este contador não consiste numa média temporal; apresenta a diferença entre os valores observados nos dois últimos exemplos divididos pela duração do intervalo de amostragem. DotNetCLR_Memory_OBJECT_019_NAME=0<OBL CLR .NET DotNetCLR_Memory_OBJECT_019_HELP=!G5BG8:8 4;O :CG8 A1>@I8:0 <CA>@0 CLR. GEN0_COLLECTIONS_COUNTER_019_NAME=!1>@>2 "<CA>@0" 4;O ?>:>;5=8O 0 GEN0_COLLECTIONS_COUNTER_019_HELP='8A;> ?@>F54C@ A1>@:8 <CA>@0, :>B>@K5 1K;8 2K?>;=5=K A <><5=B0 70?CA:0 ?@8;>65=8O 4;O >1J5:B>2 ?>:>;5=8O 0 (A0<>3> <;04H53> ?>:>;5=8O - >1J5:B>2, @07<5I5==KE 2 ?0<OB8 A0<K<8 ?>A;54=8<8). !1>@:0 <CA>@0 4;O ?>:>;5=8O 0 8=8F88@C5BAO, :>340 A2>1>4=>9 ?0<OB8 ?>:>;5=8O 0 >:07K205BAO =54>AB0B>G=> 4;O C4>2;5B2>@5=8O >G5@54=>3> 70?@>A0 =0 2K45;5=85 ?0<OB8. =0G5=85 AG5BG8:0 C25;8G8205BAO 2 :>=F5 ?@>F54C@K A1>@:8 <CA>@0 ?>:>;5=8O 0. !1>@:0 <CA>@0 4;O AB0@H53> ?>:>;5=8O 2:;NG05B A1>@:C <CA>@0 4;O 2A5E 1>;55 <;04H8E ?>:>;5=89. =0G5=85 40==>3> AG5BG8:0 C25;8G8205BAO O2=K< >1@07>< ?@8 A1>@:5 <CA>@0 4;O 1>;55 AB0@H53> ?>:>;5=8O (1 8;8 2). =0G5=85 AG5BG8:0 _Global_ AG8B05BAO =5?@028;L=K< 8 4>;6=> 83=>@8@>20BLAO. -B>B AG5BG8: ?>:07K205B ?>A;54=55 70@538AB@8@>20==>5 7=0G5=85. GEN1_COLLECTIONS_COUNTER_019_NAME=!1>@>2 "<CA>@0" 4;O ?>:>;5=8O 1 GEN1_COLLECTIONS_COUNTER_019_HELP='8A;> ?@>F54C@ A1>@:8 <CA>@0, 2K?>;=5==KE 4;O >1J5:B>2 ?>:>;5=8O 1 A <><5=B0 70?CA:0 ?@8;>65=8O. =0G5=85 AG5BG8:0 C25;8G8205BAO 2 :>=F5 ?@>F54C@K A1>@:8 <CA>@0 4;O ?>:>;5=8O 1. !1>@:0 <CA>@0 4;O AB0@H53> ?>:>;5=8O 2:;NG05B A1>@:C <CA>@0 4;O 2A5E 1>;55 <;04H8E ?>:>;5=89. =0G5=85 40==>3> AG5BG8:0 C25;8G8205BAO O2=K< >1@07>< ?@8 A1>@:5 <CA>@0 1>;55 AB0@H53> ?>:>;5=8O (2). =0G5=85 AG5BG8:0 _Global_ AG8B05BAO =5?@028;L=K< 8 4>;6=> 83=>@8@>20BLAO. -B>B AG5BG8: ?>:07K205B ?>A;54=55 70@538AB@8@>20==>5 7=0G5=85. GEN2_COLLECTIONS_COUNTER_019_NAME=!1>@>2 "<CA>@0" 4;O ?>:>;5=8O 2 GEN2_COLLECTIONS_COUNTER_019_HELP='8A;> ?@>F54C@ A1>@:8 <CA>@0, 2K?>;=5==KE 4;O >1J5:B>2 ?>:>;5=8O 2 (AB0@H53>) A <><5=B0 70?CA:0 ?@8;>65=8O. =0G5=85 AG5BG8:0 C25;8G8205BAO 2 :>=F5 ?@>F54C@K A1>@:8 <CA>@0 ?>:>;5=8O 2 (B0: =07K205<>9 ?>;=>9 A1>@:8 <CA>@0). =0G5=85 AG5BG8:0 _Global_ AG8B05BAO =5?@028;L=K< 8 4>;6=> 83=>@8@>20BLAO. -B>B AG5BG8: ?>:07K205B ?>A;54=55 70@538AB@8@>20==>5 7=0G5=85. GEN0_BYTES_PROMOTED_COUNTER_019_NAME=0<OBL, C=0A;54>20==0O 87 ?>:>;5=8O 0 GEN0_BYTES_PROMOTED_COUNTER_019_HELP='8A;> 109B>2 ?0<OB8, >AB02H8EAO ?>A;5 A1>@:8 <CA>@0 8 ?5@52545==KE 87 ?>:>;5=8O 0 2 ?>:>;5=85 1; 745AL =5 CG8BK20NBAO >1J5:BK, ?5@5E>4OI85 2 AB0@H55 ?>:>;5=85 ;8HL 2 A8;C B>3>, GB> >=8 >6840NB D8=0;870F88. -B>B AG5BG8: ?>:07K205B 7=0G5=85, 70@538AB@8@>20==>5 2 :>=F5 ?>A;54=59 A1>@:8 <CA>@0; >= =5 O2;O5BAO =0:>?8B5;L=K< AG5BG8:><. GEN1_BYTES_PROMOTED_COUNTER_019_NAME=0<OBL, C=0A;54>20==0O 87 ?>:>;5=8O 1 GEN1_BYTES_PROMOTED_COUNTER_019_HELP='8A;> 109B>2 ?0<OB8, >AB02H8EAO ?>A;5 A1>@:8 <CA>@0 8 ?5@52545==KE 87 ?>:>;5=8O 1 2 ?>:>;5=85 2; 745AL =5 CG8BK20NBAO >1J5:BK, ?5@5E>4OI85 2 AB0@H55 ?>:>;5=85 ;8HL 2 A8;C B>3>, GB> >=8 >6840NB D8=0;870F88. -B>B AG5BG8: ?>:07K205B 7=0G5=85, 70@538AB@8@>20==>5 2 :>=F5 ?>A;54=59 A1>@:8 <CA>@0; >= =5 O2;O5BAO =0:>?8B5;L=K< AG5BG8:><. !G5BG8: >1=C;O5BAO, 5A;8 ?>A;54=OO A1>@:0 <CA>@0 70B@>=C;0 ;8HL ?>:>;5=85 0. GEN0_PROMOTION_RATE_019_NAME=0A;54C5<KE 87 ?>:>;5=8O 0 109B/A5: GEN0_PROMOTION_RATE_019_HELP='8A;> 109B>2 ?0<OB8, ?5@52>48<KE 2 A5:C=4C 87 ?>:>;5=8O 0 (A0<>3> <;04H53>) 2 ?>:>;5=85 1; 745AL =5 CG8BK20NBAO >1J5:BK, ?5@5E>4OI85 2 AB0@H55 ?>:>;5=85 ;8HL 2 A8;C B>3>, GB> >=8 >6840NB D8=0;870F88.  A;54CNI55 ?>:>;5=85 ?5@52>48BAO ?0<OBL, >AB02H0OAO ?>A;5 A1>@:8 <CA>@0. 0==K9 AG5BG8: A;C68B 8=48:0B>@>< B5<?>2 A>740=8O >B=>A8B5;L=> 4>;3>25G=KE >1J5:B>2. = ?>:07K205B @07=>ABL @57C;LB0B>2 42CE ?>A;54=8E 87<5@5=89, 45;5==CN =0 ?@>4>;68B5;L=>ABL 8=B5@20;0 <564C 70<5@0<8. GEN1_PROMOTION_RATE_019_NAME=0A;54C5<KE 87 ?>:>;5=8O 1 109B/A5: GEN1_PROMOTION_RATE_019_HELP='8A;> 109B>2 ?0<OB8, ?5@52>48<KE 2 A5:C=4C 87 ?>:>;5=8O 1 2 ?>:>;5=85 2 (A0<>5 AB0@H55); 745AL =5 CG8BK20NBAO >1J5:BK, ?5@5E>4OI85 2 AB0@H55 ?>:>;5=85 ;8HL 2 A8;C B>3>, GB> >=8 >6840NB D8=0;870F88.  A;54CNI55 ?>:>;5=85 ?5@52>48BAO ?0<OBL, >AB02H0OAO ?>A;5 A1>@:8 <CA>@0. 7 ?>:>;5=8O 2 :0: A0<>3> AB0@H53> =8:0:85 >1J5:BK =5 ?5@52>4OBAO. 0==K9 AG5BG8: A;C68B 8=48:0B>@>< B5<?>2 A>740=8O A0<KE 4>;3>25G=KE >1J5:B>2. = ?>:07K205B @07=>ABL @57C;LB0B>2 42CE ?>A;54=8E 87<5@5=89, 45;5==CN =0 ?@>4>;68B5;L=>ABL 8=B5@20;0 <564C 70<5@0<8. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_019_NAME=6840NI0O 2K?>;=5=8O >?5@0F88 Finalize ?0<OBL, =0A;54C5<0O 87 ?>:>;5=8O 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_019_HELP='8A;> 109B>2 ?0<OB8, ?5@52545==KE 87 ?>:>;5=8O 0 2 ?>:>;5=85 1 ;8HL 2 A8;C B>3>, GB> >=8 >6840NB D8=0;870F88. -B>B AG5BG8: ?>:07K205B 7=0G5=85, 70@538AB@8@>20==>5 2 :>=F5 ?>A;54=59 A1>@:8 <CA>@0; >= =5 O2;O5BAO =0:>?8B5;L=K< AG5BG8:><. PROCESS_ID_019_NAME=45=B8D8:0B>@ ?@>F5AA0 PROCESS_ID_019_HELP=0==K9 AG5BG8: ?>:07K205B 845=B8D8:0B>@ =01;N405<>3> M:75<?;O@0 ?@>F5AA0 CLR. B>1@0605<>5 7=0G5=85 1C45B @02=> =C;N 4> ?5@2>9 A1>@:8 <CA>@0. GEN0_HEAP_SIZE_COUNTER_019_NAME= 07<5@ :CG8 ?>:>;5=8O 0 GEN0_HEAP_SIZE_COUNTER_019_HELP=0:A8<0;L=>5 G8A;> 109B>2, :>B>@K5 <>3CB 1KBL 2K45;5=K 2 ?0<OB8 ?>:>;5=8O 0 (MB> =5 B5:CI55 G8A;> 2K45;5==KE 109B>2 ?>:>;5=8O 0). >340 >1J5< ?0<OB8, 2K45;5==>9 A <><5=B0 ?@54K4CI59 A1>@:8 <CA>@0, ?@52KA8B MB> 7=0G5=85, 70?CA:05BAO =>20O A1>@:0 <CA>@0 4;O ?>:>;5=8O 0. 07<5@ ?0<OB8 ?>:>;5=8O 0 =0AB@08205BAO A1>@I8:>< <CA>@0 8 <>65B 1KBL 87<5=5= 2 E>45 2K?>;=5=8O ?@8;>65=8O.  :>=F5 A1>@:8 <CA>@0 4;O ?>:>;5=8O 0 @07<5@ :CG8 ?>:>;5=8O 0 D0:B8G5A:8 @025= 0; 40==K9 AG5BG8: ?>:07K205B @07<5@ 2K45;5==>9 ?0<OB8 (2 109B0E), :>B>@K9 8=8F88@C5B >G5@54=CN A1>@:C <CA>@0 4;O ?>:>;5=8O 0. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 A1>@:8 <CA>@0, 0 =5 ?@8 :064>< 2K45;5=88 ?0<OB8. GEN1_HEAP_SIZE_COUNTER_019_NAME= 07<5@ :CG8 ?>:>;5=8O 1 GEN1_HEAP_SIZE_COUNTER_019_HELP="5:CI55 G8A;> 109B>2 2 ?>:>;5=88 1 (MB> =5 <0:A8<0;L=K9 @07<5@ ?0<OB8 ?>:>;5=8O 1). 0<OBL 4;O >1J5:B>2 MB>3> ?>:>;5=8O =5 2K45;O5BAO =5?>A@54AB25==>: >1J5:BK ?5@540NBAO 87 ?@54K4CI8E A1>@>: <CA>@0 4;O ?>:>;5=8O 0. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 A1>@:8 <CA>@0, 0 =5 ?@8 :064>< 2K45;5=88 ?0<OB8. GEN2_HEAP_SIZE_COUNTER_019_NAME= 07<5@ :CG8 ?>:>;5=8O 2 GEN2_HEAP_SIZE_COUNTER_019_HELP="5:CI55 G8A;> 109B>2 2 ?>:>;5=88 2. 0<OBL 4;O >1J5:B>2 MB>3> ?>:>;5=8O =5 2K45;O5BAO =5?>A@54AB25==>: >1J5:BK ?5@540NBAO 87 ?>:>;5=8O 1 2 @57C;LB0B5 ?@54K4CI8E A1>@>: <CA>@0 4;O ?>:>;5=8O 1. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 A1>@:8 <CA>@0, 0 =5 ?@8 :064>< 2K45;5=88 ?0<OB8. LARGE_OBJECT_SIZE_COUNTER_019_NAME= 07<5@ :CG8 4;O <0AA82=KE >1J5:B>2 LARGE_OBJECT_SIZE_COUNTER_019_HELP=0==K9 AG5BG8: ?>:07K205B B5:CI89 @07<5@ :CG8 1>;LH8E >1J5:B>2 2 109B0E. 1J5:BK, @07<5@ :>B>@KE ?@52KH05B CAB0=>2;5==K9 ?>@>3, @0AA<0B@820NBAO A1>@I8:>< <CA>@0 :0: 1>;LH85 >1J5:BK 8 @07<5I0NBAO =5?>A@54AB25==> 2 >A>1>9 :CG5; >=8 =5 ?5@540NBAO <564C ?>:>;5=8O<8.  A@545 CLR 25@A88 1.1 8 2KH5 40==K9 ?>@>3 @025= 85000 109B0<. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 A1>@:8 <CA>@0, 0 =5 ?@8 :064>< 2K45;5=88 ?0<OB8. SURVIVE_FINALIZE_COUNTER_019_NAME=1J5:B>2, >AB02H8EAO ?>A;5 A1>@:8 <CA>@0 SURVIVE_FINALIZE_COUNTER_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> >1J5:B>2, :>B>@K5 =5 1K;8 C40;5=K ?@8 A1>@5 "<CA>@0" , B. :. >6840;8 2K?>;=5=8O >?5@0F88 Finalize. A;8 MB8 >1J5:BK A>45@60B AAK;:8 =0 4@C385 >1J5:BK, B5 B0:65 A>E@0=OBAO, => =5 1C4CB ?>4AG8B0=K 40==K< AG5BG8:><; AG5BG8:8 "6840NI0O 2K?>;=5=8O >?5@0F88 Finalize ?0<OBL, =0A;54C5<0O 87 ?>:>;5=8O 0" 8 "6840NI0O 2K?>;=5=8O >?5@0F88 Finalize ?0<OBL, =0A;54C5<0O 87 ?>:>;5=8O 1" ?@54AB02;ONB A>1>9 2AN ?0<OBL, A>45@68<>5 :>B>@>9 A>E@0=8;>AL 2 A8;C >6840=8O 2K?>;=5=8O >?5@0F88 Finalize. -B>B AG5BG8: =5 O2;O5BAO =0:>?8B5;L=K<; 4;O :064>9 A1>@:8 <CA>@0 2 =53> 70=>A8BAO G8A;> >1J5:B>2, =5 C40;5==KE 8<5==> 2> 2@5<O MB>9 A1>@:8 <CA>@0. -B>B AG5BG8: C:07K205B =0 4>?>;=8B5;L=K5 =0:;04=K5 @0AE>4K, :>B>@K5 =5A5B ?@8;>65=85 ?> ?@8G8=5 2K?>;=5=8O >?5@0F88 Finalize. NUM_HANDLES_COUNTER_019_NAME=#:070B5;59 GC NUM_HANDLES_COUNTER_019_HELP=-B>B AG5BG8: ?>:07K205B B5:CI55 G8A;> 8A?>;L7C5<KE C:070B5;59 A1>@:8 <CA>@0. #:070B5;8 A1>@:8 <CA>@0 ?@54AB02;ONB A>1>9 C:070B5;8 =0 @5AC@AK, :>B>@K5 O2;ONBAO 2=5H=8<8 ?> >B=>H5=8N : CLR 8 C?@02;O5<>9 A@545. #:070B5;8 70=8<0NB =51>;LH>9 >1J5< :CG8 A1>@:8 <CA>@0, => O2;ONBAO ?>B5=F80;L=> =5C?@02;O5<K<8 @5AC@A0<8 A 2KA>:8< @0AE>4>< ?0<OB8. ALLOCATION_RATE_COUNTER_019_NAME=K45;5=> 109B/A5: ALLOCATION_RATE_COUNTER_019_HELP='8A;> 109B>2, 2K45;O5<KE 2 A5:C=4C 2 :CG5 A1>@:8 <CA>@0. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 :064>3> F8:;0 A1>@:8 <CA>@0, 0 =5 ?@8 :064>< 2K45;5=88 ?0<OB8. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. INDUCED_GC_COUNTER_019_NAME=@8=C48B5;L=KE GC INDUCED_GC_COUNTER_019_HELP=8:>2>5 G8A;> ?@>F54C@ A1>@:8 <CA>@0, 2K?>;=5==KE 2 @57C;LB0B5 ?@O<>3> 2K7>20 <5B>40 GC.Collect. 5:><5=4C5BAO ?@54>AB028BL A1>@I8:C <CA>@0 2>7<>6=>ABL A0<>AB>OB5;L=> >?@545;OBL G0AB>BC A1>@:8 <CA>@0. PER_TIME_IN_GC_COUNTER_019_NAME=% 2@5<5=8 2 GC PER_TIME_IN_GC_COUNTER_019_HELP=% 2@5<5=8 A1>@:8 <CA>@0 - MB> ?@>F5=B 2@5<5=8, 70B@0G5==>3> =0 A1>@:C <CA>@0 A <><5=B0 7025@H5=8O ?>A;54=53> F8:;0 A1>@:8. -B>B AG5BG8: >1KG=> <>65B A;C68BL 8=48:0B>@>< @01>BK ?> A1>@:5 8 C?;>B=5=8N ?0<OB8, :>B>@CN 2K?>;=O5B A1>@I8: <CA>@0 ?> ?>@CG5=8N ?@8;>65=8O. -B>B AG5BG8: >1=>2;O5BAO B>;L:> 2 :>=F5 :064>9 A1>@:8 <CA>@0, 0 53> 7=0G5=85 A>>B25BAB2C5B ?>A;54=5<C 87<5@5==><C 7=0G5=8N, 0 =5 A@54=5<C 7=0G5=8N. PER_TIME_IN_GC_COUNTER_BASE_019_NAME=5 >B>1@0605BAO PER_TIME_IN_GC_COUNTER_BASE_019_HELP=5 ?>:070=> TOTAL_HEAP_SIZE_COUNTER_019_NAME=09B 2> 2A5E :CG0E TOTAL_HEAP_SIZE_COUNTER_019_HELP=-B>B AG5BG8: ?>:07K205B AC<<C G5BK@5E 4@C38E AG5BG8:>2: " 07<5@ :CG8 ?>:>;5=8O 0" , " 07<5@ :CG8 ?>:>;5=8O 1" , " 07<5@ :CG8 ?>:>;5=8O 2" 8 " 07<5@ :CG8 4;O <0AA82=KE >1J5:B>2". -B>B AG5BG8: ?>:07K205B B5:CI89 >1J5< ?0<OB8, 2K45;5==>9 2 :CG0E A1>@:8 <CA>@0. TOTAL_COMMITTED_MEM_COUNTER_019_NAME=A53> D8:A8@>20=> 109B TOTAL_COMMITTED_MEM_COUNTER_019_HELP=-B>B AG5BG8: ?>:07K205B >1J5< 28@BC0;L=>9 ?0<OB8 (2 109B0E), :>B>@CN A1>@I8: <CA>@0 70D8:A8@>20; =0 B5:CI89 <><5=B. ($8:A8@>20==0O ?0<OBL - MB> D878G5A:0O ?0<OBL, 4;O :>B>@>9 2 D09;5 ?>4:0G:8 =0 48A:5 70@575@28@>20=> <5AB>). TOTAL_RESERVED_MEM_COUNTER_019_NAME=A53> 70@575@28@>20=> 109B TOTAL_RESERVED_MEM_COUNTER_019_HELP=-B>B AG5BG8: ?>:07K205B >1J5< 28@BC0;L=>9 ?0<OB8 (2 109B0E), :>B>@CN =0 B5:CI89 <><5=B 70@575@28@>20; A1>@I8: <CA>@0. (0@575@28@>20==0O ?0<OBL - MB> 28@BC0;L=0O ?0<OBL, 70@575@28@>20==0O 4;O ?@8;>65=8O, ?@8 B>< GB> AB@0=8FK >A=>2=>9 ?0<OB8 8 48A:>2>5 ?@>AB@0=AB2> =5 8A?>;L7>20;8AL.) GC_PINNED_OBJECTS_019_NAME=0:@5?;5==KE >1J5:B>2 GC_PINNED_OBJECTS_019_HELP='8A;> 70:@5?;5==KE >1J5:B>2, >1=0@C65==KE ?@8 ?>A;54=59 A1>@:5 <CA>@0. #G8BK20NBAO B>;L:> 70:@5?;5==K5 >1J5:BK 2 :CG0E, >1@01>B0==KE A1>@I8:>< <CA>@0; =0?@8<5@, ?@8 A1>@:5 <CA>@0 4;O ?>:>;5=8O 0 70:@5?;5==K5 >1J5:BK 1C4CB ?>4AG8BK20BLAO B>;L:> 2 :CG5 ?>:>;5=8O 0. 0:@5?;5==K< =07K205BAO >1J5:B, :>B>@K9 =5 <>65B 1KBL ?5@5<5I5= 2 ?0<OB8 A1>@I8:>< <CA>@0. GC_SINKBLOCKS_019_NAME=A?>;L7C5BAO 1;>:>2 A8=E@>=870F88 GC_SINKBLOCKS_019_HELP="5:CI55 G8A;> 8A?>;L7C5<KE 1;>:>2 A8=E@>=870F88. ;>:8 A8=E@>=870F88 - MB> AB@C:BC@K 40==KE, 2K45;O5<K5 4;O :064>3> >1J5:B0 A F5;LN E@0=5=8O 8=D>@<0F88 > A8=E@>=870F88. ;>:8 A8=E@>=870F88 A>45@60B A;01K5 AAK;:8 =0 C?@02;O5<K5 >1J5:BK 8 4>;6=K ?@>A<0B@820BLAO A1>@I8:>< <CA>@0. ><8<> 40==KE > A8=E@>=870F88, 2 1;>:0E A8=E@>=870F88 <>3CB B0:65 E@0=8BLAO <5B040==K5 COM-2708<>459AB28O. 0==K9 AG5BG8: 1K; 22545= 4;O B>3>, GB>1K A83=0;878@>20BL > ?@>1;5<0E ?@>872>48B5;L=>AB8 2 A;CG0OE 8=B5=A82=>3> 8A?>;L7>20=8O ?@8<8B82>2 A8=E@>=870F88. DotNetCLR_Loading_OBJECT_019_NAME=03@C7:0 CLR .NET DotNetCLR_Loading_OBJECT_019_HELP=!B0B8AB8:0 703@C7:8 :;0AA>2 CLR. LOADING_CLASSES_TOTAL_019_NAME=A53> 703@C65=> :;0AA>2 LOADING_CLASSES_TOTAL_019_HELP=!>2>:C?=>5 G8A;> :;0AA>2, 703@C65==KE 2> 2A5E A1>@:0E A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. LOADING_TIME_019_NAME=% 2@5<5=8 =0 703@C7:C LOADING_TIME_019_HELP=0@575@28@>20=> 4;O 8A?>;L7>20=8O 2 1C4CI5<. LOADING_ASMSEARCHLEN_019_NAME=;8B5;L=>ABL ?>8A:0 A1>@:8 LOADING_ASMSEARCHLEN_019_HELP=0@575@28@>20=> 4;O 8A?>;L7>20=8O 2 1C4CI5<. LOADING_LOADFAILURES_TOTAL_019_NAME=A53> A1>52 ?@8 703@C7:5 LOADING_LOADFAILURES_TOTAL_019_HELP=-B>B AG5BG8: ?>:07K205B ?8:>2>5 7=0G5=85 G8A;0 A1>52 ?@8 703@C7:5 :;0AA>2 A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. !1>8 ?@8 703@C7:5 <>3CB 2>7=8:0BL ?> @07;8G=K< ?@8G8=0<, =0?@8<5@, 2 A8;C =54>AB0B>G=>AB8 70I8BK 8;8 =54>?CAB8<>AB8 D>@<0B0. >4@>1=CN 8=D>@<0F8N <>6=> =09B8 2 A?@02:5 ?> A>>B25BAB2CNI8< A;C610<. LOADING_LOADFAILURES_INST_019_NAME='0AB>B0 A1>52 ?@8 703@C7:5 LOADING_LOADFAILURES_INST_019_HELP='8A;> =5C40G=KE ?>?KB>: 703@C7:8 :;0AA>2 2 A5:C=4C. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. !1>8 ?@8 703@C7:5 <>3CB 2>7=8:0BL ?> @07;8G=K< ?@8G8=0<, =0?@8<5@, 2 A8;C =54>AB0B>G=>AB8 70I8BK 8;8 =54>?CAB8<>AB8 D>@<0B0. >4@>1=CN 8=D>@<0F8N <>6=> =09B8 2 A?@02:5 ?> A>>B25BAB2CNI8< A;C610<. LOADING_HEAPSIZE_019_NAME=09B 2 :CG5 703@C7G8:0 LOADING_HEAPSIZE_019_HELP="5:CI89 @07<5@ ?0<OB8 (2 109B0E), 2K45;5==>9 703@C7G8:>< :;0AA>2 ?> 2A5< 4><5=0< ?@8;>65=89. (K45;5==0O ?0<OBL - MB> D878G5A:0O ?0<OBL, 4;O :>B>@>9 2 D09;5 ?>4:0G:8 =0 48A:5 70@575@28@>20=> <5AB>.) LOADING_APPDOMAINS_UNLOADED_TOTAL_019_NAME=A53> 2K3@C65=> 4><5=>2 ?@8;>65=89 LOADING_APPDOMAINS_UNLOADED_TOTAL_019_HELP=1I55 G8A;> 4><5=>2 ?@8;>65=89, 2K3@C65==KE A <><5=B0 70?CA:0 ?@8;>65=8O. A;8 4><5= ?@8;>65=8O 703@C605BAO 8 2K3@C605BAO =5A:>;L:> @07, :0640O 87 MB8E 2K3@C7>: CG8BK205BAO 2 AG5BG8:5 :0: >B45;L=0O 2K3@C7:0. LOADING_APPDOMAINS_UNLOADED_INST_019_NAME='0AB>B0 2K3@C7>: 4><5=>2 ?@8;>65=89 LOADING_APPDOMAINS_UNLOADED_INST_019_HELP='8A;> 4><5=>2 ?@8;>65=89, 2K3@C605<KE 2 A5:C=4C. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. LOADING_CLASSES_CUR_019_NAME=03@C65=> :;0AA>2 =0 B5:CI89 <><5=B LOADING_CLASSES_CUR_019_HELP="5:CI55 G8A;> :;0AA>2, 703@C65==KE 2> 2A5E A1>@:0E. LOADING_CLASSES_INST_019_NAME='0AB>B0 703@C7>: :;0AA>2 LOADING_CLASSES_INST_019_HELP='8A;> :;0AA>2, 703@C605<KE 2 A5:C=4C ?> 2A5< A1>@:0<. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. LOADING_APPDOMAINS_CUR_019_NAME="5:CI8E 4><5=>2 ?@8;>65=89 LOADING_APPDOMAINS_CUR_019_HELP="5:CI55 G8A;> 4><5=>2 ?@8;>65=89, 703@C65==KE 2 40==>< ?@8;>65=88. ><5= ?@8;>65=8O ?@54AB02;O5B A>1>9 70I8I5==K9 C=825@A0;L=K9 1;>: >1@01>B:8, :>B>@K9 <>65B 8A?>;L7>20BLAO A@54>9 CLR 4;O @073@0=8G5=8O ?@8;>65=89, 70?CI5==KE 2 @0<:0E >4=>3> ?@>F5AA0. LOADING_APPDOMAINS_TOTAL_019_NAME=A53> 4><5=>2 ?@8;>65=89 LOADING_APPDOMAINS_TOTAL_019_HELP=8:>2>5 G8A;> 4><5=>2 ?@8;>65=89, 703@C65==KE A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. ><5= ?@8;>65=8O ?@54AB02;O5B A>1>9 70I8I5==K9 C=825@A0;L=K9 1;>: >1@01>B:8, :>B>@K9 <>65B 8A?>;L7>20BLAO A@54>9 CLR 4;O @073@0=8G5=8O ?@8;>65=89, 70?CI5==KE 2 @0<:0E >4=>3> ?@>F5AA0. LOADING_APPDOMAINS_INST_019_NAME='0AB>B0 703@C7>: 4><5=>2 ?@8;>65=89 LOADING_APPDOMAINS_INST_019_HELP='8A;> 4><5=>2 ?@8;>65=89, 703@C605<KE 2 A5:C=4C. ><5= ?@8;>65=8O ?@54AB02;O5B A>1>9 70I8I5==K9 C=825@A0;L=K9 1;>: >1@01>B:8, :>B>@K9 <>65B 8A?>;L7>20BLAO A@54>9 CLR 4;O @073@0=8G5=8O ?@8;>65=89, 70?CI5==KE 2 @0<:0E >4=>3> ?@>F5AA0. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. LOADING_ASSEMBLIES_CUR_019_NAME="5:CI55 G8A;> A1>@>: LOADING_ASSEMBLIES_CUR_019_HELP="5:CI55 G8A;> A1>@>:, 703@C65==KE 2 40==>< 2 ?@8;>65=88 ?> 2A5< 4><5=0< ?@8;>65=89. A;8 A1>@:0 703@C605BAO 87 =5A:>;L:8E 4><5=>2 ?@8;>65=89 :0: =57028A8<0O >B 4><5=0, AG5BG8: C25;8G8205BAO B>;L:> >48= @07. !1>@:8 <>3CB 703@C60BLAO :0: =57028A8<K5 >B 4><5=>2, 5A;8 8E :>4 <>65B A>2<5AB=> 8A?>;L7>20BLAO 2A5<8 4><5=0<8 ?@8;>65=89, 8;8 :0: A1>@:8 :>=:@5B=>3> 4><5=0, 5A;8 :>4 A1>@:8 4>ABC?5= B>;L:> 4;O >?@545;5==>3> 4><5=0 ?@8;>65=8O. LOADING_ASSEMBLIES_TOTAL_019_NAME=1I55 G8A;> A1>@>: LOADING_ASSEMBLIES_TOTAL_019_HELP=1I55 G8A;> A1>@>:, 703@C65==KE A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. A;8 A1>@:0 703@C605BAO 87 =5A:>;L:8E 4><5=>2 ?@8;>65=89 :0: =57028A8<0O >B 4><5=0, AG5BG8: C25;8G8205BAO B>;L:> >48= @07. !1>@:8 <>3CB 703@C60BLAO :0: =57028A8<K5 >B 4><5=>2, 5A;8 8E :>4 <>65B A>2<5AB=> 8A?>;L7>20BLAO 2A5<8 4><5=0<8 ?@8;>65=89, 8;8 :0: A1>@:8 :>=:@5B=>3> 4><5=0, 5A;8 :>4 A1>@:8 4>ABC?5= B>;L:> 4;O >?@545;5==>3> 4><5=0 ?@8;>65=8O. LOADING_ASSEMBLIES_INST_019_NAME='0AB>B0 703@C7>: A1>@>: LOADING_ASSEMBLIES_INST_019_HELP='8A;> A1>@>:, 703@C605<KE 2 A5:C=4C ?> 2A5< 4><5=0< ?@8;>65=89. A;8 A1>@:0 703@C605BAO 87 =5A:>;L:8E 4><5=>2 ?@8;>65=89 :0: =57028A8<0O >B 4><5=0, AG5BG8: C25;8G8205BAO B>;L:> >48= @07. !1>@:8 <>3CB 703@C60BLAO :0: =57028A8<K5 >B 4><5=>2, 5A;8 8E :>4 <>65B A>2<5AB=> 8A?>;L7>20BLAO 2A5<8 4><5=0<8 ?@8;>65=89, 8;8 :0: A1>@:8 :>=:@5B=>3> 4><5=0, 5A;8 :>4 A1>@:8 4>ABC?5= B>;L:> 4;O >?@545;5==>3> 4><5=0 ?@8;>65=8O. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. DotNetCLR_Jit_OBJECT_019_NAME=><?8;OF8O ?> B@51>20=8N (JIT) CLR .NET DotNetCLR_Jit_OBJECT_019_HELP=!B0B8AB8:0 JIT-:><?8;OB>@0 CLR. TOTAL_METHODS_JITTED_019_NAME=B:><?8;8@>20==KE <5B>4>2 ?> B@51>20=8N TOTAL_METHODS_JITTED_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> <5B>4>2, >B:><?8;8@>20==KE JIT-:><?8;OB>@>< CLR A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. -B>B AG5BG8: =5 CG8BK205B ?@5420@8B5;L=> >B:><?8;8@>20==K5 <5B>4K. JITTED_IL_CUR_019_NAME=B:><?8;8@>20==KE 109B>2 IL ?> B@51>20=8N JITTED_IL_CUR_019_HELP=1I55 G8A;> 109B>2 IL, >1@01>B0==KE JIT-:><?8;OB>@>< A <><5=B0 70?CA:0 ?@8;>65=8O. -B>B AG5BG8: M:2820;5=B5= AG5BG8:C "A53> >B:><?8;8@>20==KE 109B>2 IL ?> B@51>20=8N". JITTED_IL_TOTAL_019_NAME=A53> >B:><?8;8@>20==KE 109B>2 IL ?> B@51>20=8N JITTED_IL_TOTAL_019_HELP=1I55 G8A;> 109B>2 IL, >1@01>B0==KE JIT-:><?8;OB>@>< A <><5=B0 70?CA:0 ?@8;>65=8O. -B>B AG5BG8: M:2820;5=B5= AG5BG8:C "B:><?8;8@>20==KE 109B>2 IL ?> B@51>20=8N". JITTED_IL_INST_019_NAME=B:><?8;8@>20==KE 109B>2 IL ?> B@51>20=8N/A5: JITTED_IL_INST_019_HELP='8A;> 109B>2 IL, >1@010BK205<KE 2 A5:C=4C JIT-:><?8;OB>@><. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. JIT_FAILURES_019_NAME=#@>25=L A1>52 ?@8 :><?8;OF88 ?> B@51>20=8N JIT_FAILURES_019_HELP=8:>2>5 G8A;> <5B>4>2, :>B>@K5 =5 C40;>AL >1@01>B0BL JIT-:><?8;OB>@>< A <><5=B0 70?CA:0 ?@8;>65=8O. "0:85 A1>8 2>7=8:0NB 2 A;CG05 =52>7<>6=>AB8 ?@>25@:8 :>40 IL 8;8 ?@8 >1=0@C65=88 2=CB@5==59 >H81:8 2 JIT-:><?8;OB>@5. TIME_IN_JIT_019_NAME=% 2@5<5=8 =0 :><?8;OF8N ?> B@51>20=8N TIME_IN_JIT_019_HELP=-B>B AG5BG8: ?>:07K205B ?@>F5=B 2@5<5=8, 70B@0G5==>3> =0 :><?8;OF8N ?> B@51>20=8N, =0G8=0O A ?>A;54=59 D07K >?5@0B82=>9 :><?8;OF88. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 :064>9 D07K :><?8;OF88 ?> B@51>20=8N. $070 :><?8;OF88 ?> B@51>20=8N - MB> D070 :><?8;OF88 <5B>40 8 :><?>=5=B>2, >B :>B>@KE >= 7028A8B. TIME_IN_JIT_BASE_019_NAME=5 >B>1@0605BAO TIME_IN_JIT_BASE_019_HELP=5 ?>:070=> DotNetCLR_Interop_OBJECT_019_NAME=708<>459AB285 CLR .NET DotNetCLR_Interop_OBJECT_019_HELP=!B0B8AB8:0 2708<>459AB28O CLR. CURRENT_CCW_019_NAME=>;8G5AB2> CCW CURRENT_CCW_019_HELP="5:CI55 G8A;> 2K7K205<KE >1>;>G5: COM (CCW). CCW ?@54AB02;O5B ?@>:A8->1J5:B 4;O C?@02;O5<>3> >1J5:B0 .NET, C:070==>3> AAK;:>9 87 =5C?@02;O5<>3> :;85=B0 COM. 0==K9 AG5BG8: ?>:07K205B G8A;> C?@02;O5<KE >1J5:B>2, C:07K205<KE AAK;:0<8 87 =5C?@02;O5<>3> :>40 COM. CURRENT_STUBS_019_NAME=>;8G5AB2> AC@@>30B>2 CURRENT_STUBS_019_HELP="5:CI55 G8A;> AC@@>30B>2, A>740==KE A@54>9 CLR. !C@@>30BK >15A?5G820NB <0@H0;8@>20=85 0@3C<5=B>2 8 2>72@0I05<KE 7=0G5=89 87 C?@02;O5<>3> :>40 2 =5C?@02;O5<K9 8 >1@0B=>, 2K?>;=O5<>5 2> 2@5<O 2K7>20 COM-2708<>459AB28O 8;8 DC=:F88 PInvoke. NUM_MARSHALLING_019_NAME='8A;> C?0:>2>: NUM_MARSHALLING_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> C?0:>2>: 8 ?5@540G 0@3C<5=B>2 8 2>72@0I05<KE 7=0G5=89 87 C?@02;O5<>3> 2 =5C?@02;O5<K9 :>4 8 >1@0B=> A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. @8@0I5=85 7=0G5=8O AG5BG8:0 =5 ?@>8AE>48B, 5A;8 AC@@>30BK O2;ONBAO 2AB@>5==K<8. (!C@@>30BK >B25G0NB 70 C?0:>2:C 0@3C<5=B>2 8 2>72@0I05<KE 7=0G5=89). 1KG=> AC@@>30BK 2AB@0820NBAO 2 :>4, 5A;8 =0:;04=K5 @0AE>4K =0 C?0:>2:C =525;8:8. TOTAL_TLB_IMPORTS_019_NAME='8A;> 8<?>@B>2 TLB / A5: TOTAL_TLB_IMPORTS_019_HELP=0@575@28@>20=> 4;O 8A?>;L7>20=8O 2 1C4CI5<. TOTAL_TLB_EXPORTS_019_NAME='8A;> M:A?>@B>2 TLB / A5: TOTAL_TLB_EXPORTS_019_HELP=0@575@28@>20=> 4;O 8A?>;L7>20=8O 2 1C4CI5<. DotNetCLR_LocksAndThreads_OBJECT_019_NAME=;>:8@>2:8 8 ?>B>:8 CLR .NET DotNetCLR_LocksAndThreads_OBJECT_019_HELP=!B0B8AB8:0 1;>:8@>2>: 8 ?>B>:>2 CLR. CONTENTION_TOTAL_019_NAME=A53> :>=D;8:B>2 CONTENTION_TOTAL_019_HELP=1I55 G8A;> =5C40G=KE ?>?KB>: ?>B>:>2 CLR CAB0=>28BL C?@02;O5<CN 1;>:8@>2:C. #?@02;O5<K5 1;>:8@>2:8 <>3CB CAB0=02;820BLAO @07=K<8 A?>A>10<8: A ?><>ILN >?5@0B>@0 C# "lock", ?CB5< 2K7>20 <5B>40 System.Monitor.Enter 8;8 A 8A?>;L7>20=85< =0AB@08205<>3> 0B@81CB0 MethodImplOptions.Synchronized. CONTENTION_INST_019_NAME='0AB>B0 :>=D;8:B>2/A5: CONTENTION_INST_019_HELP='0AB>B0 =5C40G=KE ?>?KB>: ?>B>:>2 A@54K 2K?>;=5=8O CAB0=>28BL C?@02;O5<CN 1;>:8@>2:C. #?@02;O5<K5 1;>:8@>2:8 <>3CB CAB0=02;820BLAO @07=K<8 A?>A>10<8: A ?><>ILN >?5@0B>@0 C# "lock", ?CB5< 2K7>20 <5B>40 System.Monitor.Enter 8;8 A 8A?>;L7>20=85< =0AB@08205<>3> 0B@81CB0 MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_019_NAME="5:CI0O 4;8=0 >G5@548 QUEUE_LENGTH_CUR_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> ?>B>:>2, >6840NI8E 2 B5:CI89 <><5=B ?>;CG5=8O C?@02;O5<KE 1;>:8@>2>: 2 ?@8;>65=88. -B>B AG5BG8: ?>:07K205B =5 A@54=55 7=0G5=85 70 ?@><56CB>: 2@5<5=8, 0 ?>A;54=55 87<5@5==>5 7=0G5=85. QUEUE_LENGTH_TOTAL_019_NAME=8:>20O 4;8=0 >G5@548 QUEUE_LENGTH_TOTAL_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> ?>B>:>2, >68402H8E ?>;CG5=8O C?@02;O5<KE 1;>:8@>2>: A <><5=B0 70?CA:0 ?@8;>65=8O. QUEUE_LENGTH_INST_019_NAME=;8=0 >G5@548/A5: QUEUE_LENGTH_INST_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> ?>B>:>2 2 A5:C=4C, >6840NI8E ?>;CG5=8O C?@02;O5<KE 1;>:8@>2>: 2 ?@8;>65=88. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. CURRENT_LOGICAL_THREADS_019_NAME="5:CI8E ;>38G5A:8E ?>B>:>2 CURRENT_LOGICAL_THREADS_019_HELP='8A;> B5:CI8E >1J5:B>2 ?>B>:>2 .NET 2 ?@8;>65=88. 1J5:B ?>B>:0 .NET A>7405BAO =>2K< :;0AA>< System.Threading.Thread 8;8 ?@8 2E>45 =5C?@02;O5<>3> ?>B>:0 2 C?@02;O5<CN A@54C.  40==>< AG5BG8:5 CG8BK20NBAO :0: 2K?>;=O5<K5, B0: 8 C65 >AB0=>2;5==K5 ?>B>:8. !G5BG8: =5 CA@54=O5BAO ?> 2@5<5=8: >= ?@>AB> ?>:07K205B ?>A;54=55 70@538AB@8@>20==>5 7=0G5=85. CURRENT_PHYSICAL_THREADS_019_NAME="5:CI8E D878G5A:8E ?>B>:>2 CURRENT_PHYSICAL_THREADS_019_HELP='8A;> A>1AB25==KE ?>B>:>2 !, ?@8=04;560I8E A@545 CLR, :>B>@K5 A>740=K 5N 2 :0G5AB25 107>2KE ?>B>:>2 4;O >1J5:B>2 ?>B>:>2 .NET.  MB>< AG5BG8:5 =5 CG8BK20NBAO ?>B>:8, 8A?>;L7C5<K5 A@54>9 CLR 2 A2>8E 2=CB@5==8E >?5@0F8OE; >= >B@0605B ?>4<=>65AB2> ?>B>:>2 2 ?@>F5AA5 !. RECOGNIZED_THREADS_CUR_019_NAME="5:CI8E >?>7=0==KE ?>B>:>2 RECOGNIZED_THREADS_CUR_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> ?>B>:>2, :>B>@K5 =0 B5:CI89 <><5=B >?>7=0; CLR; :064><C 87 =8E =07=0G5= A>>B25BAB2CNI89 >1J5:B ?>B>:0 .NET. -B8 ?>B>:8 =5 A>740=K CLR; >=8 A>740=K 2=5 CLR, => ?> <5=LH59 <5@5 >48= @07 2K?>;=O;8AL 2=CB@8 CLR. >4AG8BK20NBAO B>;L:> C=8:0;L=K5 ?>B>:8; ?>B>:8 A >48=0:>2K<8 845=B8D8:0B>@0<8, ?>B>:8, ?>2B>@=> ?>?040NI85 2 CLR 8;8 ?>2B>@=> A>740205<K5 ?>A;5 2KE>40, ?>4AG8BK20NBAO B>;L:> >48= @07. RECOGNIZED_THREADS_TOTAL_019_NAME=A53> >?>7=0=> ?>B>:>2 RECOGNIZED_THREADS_TOTAL_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> ?>B>:>2, >?>7=0==KE CLR A <><5=B0 70?CA:0 ?@8;>65=8O; :064><C 87 =8E =07=0G5= A>>B25BAB2CNI89 >1J5:B ?>B>:0 .NET. -B8 ?>B>:8 =5 A>740=K CLR; >=8 A>740=K 2=5 CLR, => ?> <5=LH59 <5@5 >48= @07 2K?>;=O;8AL 2=CB@8 CLR. >4AG8BK20NBAO B>;L:> C=8:0;L=K5 ?>B>:8; ?>B>:8 A >48=0:>2K<8 845=B8D8:0B>@0<8, ?>B>:8, ?>2B>@=> ?>?040NI85 2 CLR 8;8 ?>2B>@=> A>740205<K5 ?>A;5 2KE>40, ?>4AG8BK20NBAO B>;L:> >48= @07. RECOGNIZED_THREADS_INST_019_NAME=G0AB>B0 >?>7=020=8O ?>B>:>2/A5: RECOGNIZED_THREADS_INST_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> ?>B>:>2, :>B>@K5 >?>7=020;8AL CLR, 2 A5:C=4C; :064><C 87 MB8E ?>B>:>2 =07=0G5= A>>B25BAB2CNI89 >1J5:B ?>B>:0 .NET. -B8 ?>B>:8 =5 A>740=K CLR; >=8 A>740=K 2=5 CLR, => ?> <5=LH59 <5@5 >48= @07 2K?>;=O;8AL 2=CB@8 CLR. >4AG8BK20NBAO B>;L:> C=8:0;L=K5 ?>B>:8; ?>B>:8 A >48=0:>2K<8 845=B8D8:0B>@0<8, ?>B>:8, ?>2B>@=> ?>?040NI85 2 CLR 8;8 ?>2B>@=> A>740205<K5 ?>A;5 2KE>40, ?>4AG8BK20NBAO B>;L:> >48= @07. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. DotNetCLR_Security_OBJECT_019_NAME=57>?0A=>ABL CLR .NET DotNetCLR_Security_OBJECT_019_HELP=!B0B8AB8:0 157>?0A=>AB8 CLR. SECURITY_TOTALRTCHECKS_019_NAME=A53> ?@>25@>: ?@8 2K?>;=5=88 SECURITY_TOTALRTCHECKS_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> ?@>25@>: CAS (@073@0=8G5=85 4>ABC?0 :>40) 2 E>45 2K?>;=5=8O, >ACI5AB2;5==KE A <><5=B0 70?CA:0 ?@8;>65=8O. @>25@:8 CAS 2 E>45 2K?>;=5=8O >ACI5AB2;ONBAO, :>340 2K7K20NI89 >1J5:B ?>AK;05B 2K7>2 2K7K205<><C >1J5:BC A 70?@>A>< >?@545;5==KE ?>;=><>G89; ?@>25@:0 2 E>45 2K?>;=5=8O >ACI5AB2;O5BAO 4;O :064>3> 2K7>20 A> AB>@>=K 2K7K20NI53> >1J5:B0 ?CB5< ?@>25@:8 B5:CI53> AB5:0 ?>B>:>2 2K7K20NI53> >1J5:B0. -B>B AG5BG8: A>2<5AB=> A> AG5BG8:>< ";C18=0 ?@>A<>B@0 AB5:0" ?>72>;O5B >F5=8BL ?045=85 ?@>872>48B5;L=>AB8 87-70 ?@>25@>: 157>?0A=>AB8. SECURITY_TIMEAUTHORIZE_019_NAME=% ?@>25@:8 ?>4;8==>AB8 ?> 2@5<5==K< A83=0;0< SECURITY_TIMEAUTHORIZE_019_HELP=0@575@28@>20=> 4;O 8A?>;L7>20=8O 2 1C4CI5<. SECURITY_LINKCHECKS_019_NAME=@>25@>: 2> 2@5<O :><?>=>2:8 SECURITY_LINKCHECKS_019_HELP=-B>B AG5BG8: ?>:07K205B >1I55 G8A;> ?@>25@>: CAS (@073@0=8G5=85 4>ABC?0 :>40) 2 E>45 :><?>=>2:8, >ACI5AB2;5==>5 A <><5=B0 70?CA:0 ?@8;>65=8O. @>25@:8 CAS 2 E>45 :><?>=>2:8 >ACI5AB2;ONBAO, :>340 2K7K20NI89 >1J5:B ?@>872>48B 2K7>2 2K7K205<>3> >1J5:B0 A 70?@>A>< >?@545;5==KE ?>;=><>G89 2> 2@5<O :><?8;OF88 ?> B@51>20=8N; ?@>25@:8 2 E>45 :><?>=>2:8 >ACI5AB2;ONBAO >48= @07 4;O :064>3> 2K7K20NI53> >1J5:B0. -B>B AG5BG8: =5 405B 206=>9 8=D>@<0F88 > ?@>872>48B5;L=>AB8 A8AB5<K, => O2;O5BAO 8=48:0B>@>< 459AB289 A8AB5<K ?> >15A?5G5=8N 157>?0A=>AB8. SECURITY_TIMERTCHECKS_019_NAME=% 2@5<5=8 =0 ?@>25@:8 ?@8 2K?>;=5=88 SECURITY_TIMERTCHECKS_019_HELP=-B>B AG5BG8: ?>:07K205B ?@>F5=B 2@5<5=8, 70B@0G5==>3> =0 >ACI5AB2;5=85 ?@>25@>: CAS (@073@0=8G5=85 4>ABC?0 :>40) 2 E>45 2K?>;=5=8O A <><5=B0 ?>A;54=59 B0:>9 ?@>25@:8. CAS ?>72>;O5B 8A?>;L7>20BL 4;O :>40 @07;8G=K5 AB5?5=8 4>25@8O 8 CAB0=02;820BL AB5?5=8 4>25@8O 2 7028A8<>AB8 >B 845=B8D8:0B>@0 :>40. -B>B AG5BG8: >1=>2;O5BAO 2 :>=F5 ?@>25@:8 157>?0A=>AB8 2 E>45 2K?>;=5=8O; >= >B>1@0605B =5 A@54=55, 0 87<5@5==>5 7=0G5=85. SECURITY_TIMERTCHECKS_BASE_019_NAME=5 >B>1@0605BAO SECURITY_TIMERTCHECKS_BASE_019_HELP=5 ?>:070=> SECURITY_DEPTHSECURITY_019_NAME=;C18=0 ?@>E>40 AB5:0 SECURITY_DEPTHSECURITY_019_HELP=-B>B AG5BG8: ?>:07K205B 3;C18=C AB5:0 2> 2@5<O ?>A;54=59 ?@>25@:8 CAS 2 E>45 2K?>;=5=8O. @>25@:0 CAS 2 E>45 2K?>;=5=8O >ACI5AB2;O5BAO ?CB5< ?@>A<>B@0 AB5:0. -B>B AG5BG8: ?>:07K205B =5 A@54=55 7=0G5=85, 0 ?>A;54=55 87<5@5==>5 7=0G5=85. DotNetCLR_Remoting_OBJECT_019_NAME=#40;5==0O @01>B0 A CLR .NET DotNetCLR_Remoting_OBJECT_019_HELP=!B0B8AB8:0 C40;5==>3> 2708<>459AB28O A CLR. CONTEXT_REMOTECALLS_INST_019_NAME=#40;5==KE 2K7>2>2/A5: CONTEXT_REMOTECALLS_INST_019_HELP='8A;> C40;5==KE 2K7>2>2 ?@>F54C@ 2 A5:C=4C. #40;5==K9 2K7>2 ?@>F54C@K - MB> 2K7>2 ;N1>3> >1J5:B0, =0E>4OI53>AO 2=5 4><5=0 ?@8;>65=8O 2K7K20NI59 ?@>3@0<<K. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. CONTEXT_CHANNELS_019_NAME=0=0;>2 CONTEXT_CHANNELS_019_HELP=1I55 G8A;> :0=0;>2 C40;5==>3> 2708<>459AB28O, 70@538AB@8@>20==KE ?> 2A5< 4><5=0< ?@8;>65=89 A <><5=B0 70?CA:0 ?@8;>65=8O. 0=0;K A;C60B 4;O ?5@540G8 A>>1I5=89 2 C40;5==K5 >1J5:BK 8 >1@0B=>. CONTEXT_PROXIES_019_NAME=>=B5:AB=KE ?>A@54=8:>2 CONTEXT_PROXIES_019_HELP=1I55 G8A;> ?@>:A8->1J5:B>2 C40;5==>3> 2708<>459AB28O, A>740==KE 2 40==>< ?@>F5AA5 A <><5=B0 53> 70?CA:0. @>:A8->1J5:B 2KABC?05B 2 :0G5AB25 ?@54AB028B5;O C40;5==KE >1J5:B>2, >15A?5G820O ?5@5=0?@02;5=85 :064>3> 2K7>20 ?@>:A8->1J5:B0 2 A>>B25BAB2CNI89 M:75<?;O@ C40;5==>3> >1J5:B0. CONTEXT_CLASSES_019_NAME=03@C65=> :>=B5:AB=>-?@82O70==KE :;0AA>2 CONTEXT_CLASSES_019_HELP="5:CI55 G8A;> 703@C65==KE :>=B5:AB=KE :;0AA>2. >=B5:AB=K<8 =07K20NBAO :;0AAK, :>B>@K5 <>3CB 1KBL ?@82O70=K : >?@545;5==><C :>=B5:ABC; >=8 A=0160NBAO 0B@81CB0<8 :>=B5:AB0, CAB0=02;820NI8<8 ?@028;0 8A?>;L7>20=8O 4;O A8=E@>=870F88, >?@545;5=8O AE>4AB20 ?>B>:>2, 2K?>;=5=8O B@0=70:F89 8 B. ?. CONTEXT_OBJALLOC_019_NAME=>=B5:AB=>-?@82O70==KE >1J5:B>2/A5: CONTEXT_OBJALLOC_019_HELP='8A;> :>=B5:AB=KE >1J5:B>2, :>B>@K< 2 A5:C=4C 2K45;O5BAO ?0<OBL. -:75<?;O@K :;0AA>2, :>B>@K5 <>3CB 1KBL ?@82O70=K : >?@545;5==><C :>=B5:ABC, =07K20NBAO :>=B5:AB=K<8 >1J5:B0<8; >=8 A=0160NBAO 0B@81CB0<8 :>=B5:AB0, CAB0=02;820NI8<8 ?@028;0 8A?>;L7>20=8O 4;O A8=E@>=870F88, >?@545;5=8O AE>4AB20 ?>B>:>2, 2K?>;=5=8O B@0=70:F89 8 B. ?. !G5BG8: =5 CA@54=O5BAO ?> 2@5<5=8: >= ?>:07K205B @07=>ABL @57C;LB0B>2 42CE ?>A;54=8E 87<5@5=89, 45;5==CN =0 ?@>4>;68B5;L=>ABL 8=B5@20;0 <564C 70<5@0<8. CONTEXT_CONTEXTS_019_NAME=>=B5:AB>2 CONTEXT_CONTEXTS_019_HELP="5:CI55 G8A;> :>=B5:AB>2 C40;5==>3> 2708<>459AB28O 2 ?@8;>65=88. >=B5:AB >?@545;O5B 3@0=8FK :>;;5:F88 >1J5:B>2 A >48=0:>2K<8 ?@028;0<8 8A?>;L7>20=8O, =0?@8<5@ 4;O A8=E@>=870F88, >?@545;5=8O AE>4AB20 ?>B>:>2, 2K?>;=5=8O B@0=70:F89 8 B. ?. CONTEXT_REMOTECALLS_TOTAL_019_NAME=A53> C40;5==KE 2K7>2>2 CONTEXT_REMOTECALLS_TOTAL_019_HELP=1I55 G8A;> C40;5==KE 2K7>2>2 ?@>F54C@ A <><5=B0 70?CA:0 40==>3> ?@8;>65=8O. #40;5==K9 2K7>2 ?@>F54C@K - MB> 2K7>2 ;N1>3> >1J5:B0, =0E>4OI53>AO 2=5 4><5=0 ?@8;>65=8O 2K7K20NI59 ?@>3@0<<K. DotNetCLR_Excep_OBJECT_019_NAME=A:;NG5=89 CLR .NET DotNetCLR_Excep_OBJECT_019_HELP=!B0B8AB8:0 >1@01>B:8 8A:;NG5=89 CLR 2> 2@5<O 2K?>;=5=8O. EXCEP_THROWN_TOTAL_019_NAME='8A;> 8A:;NG5=89 EXCEP_THROWN_TOTAL_019_HELP=1I55 G8A;> 8A:;NG5=89, A35=5@8@>20==KE A <><5=B0 70?CA:0 ?@8;>65=8O. !N40 2:;NG0NBAO :0: 8A:;NG5=8O .NET, B0: 8 ?@5>1@07>20==K5 2 =8E =5C?@02;O5<K5 8A:;NG5=8O; =0?@8<5@, 8A:;NG5=85, 2K720==>5 AAK;:>9 =0 ?CAB>9 C:070B5;L 2 =5C?@02;O5<>< :>45, ?>2B>@=> 35=5@8@C5BAO 2 C?@02;O5<>< :>45 :0: 8A:;NG5=85 .NET System.NullReferenceException.  MB>< AG5BG8:5 CG8BK20NBAO :0: >1@01>B0==K5, B0: 8 =5>1@01>B0==K5 8A:;NG5=8O. >2B>@=> A35=5@8@>20==K5 8A:;NG5=8O 70AG8BK20NBAO :0: =>2K5. @54?>;0305BAO, GB> 8A:;NG5=8O 2>7=8:0NB ;8HL 2 @54:8E A;CG0OE 8 =5 ?@>8AE>4OB ?@8 =>@<0;L=>< E>45 2K?>;=5=8O ?@>3@0<<K. EXCEP_THROWN_INST_019_NAME='8A;> 8A:;NG5=89/A5: EXCEP_THROWN_INST_019_HELP='8A;> 8A:;NG5=89, 35=5@8@C5<KE 2 A5:C=4C. !N40 2:;NG0NBAO :0: 8A:;NG5=8O .NET, B0: 8 ?@5>1@07>20==K5 2 =8E =5C?@02;O5<K5 8A:;NG5=8O; =0?@8<5@, 8A:;NG5=85, 2K720==>5 AAK;:>9 =0 ?CAB>9 C:070B5;L 2 =5C?@02;O5<>< :>45, ?>2B>@=> 35=5@8@C5BAO 2 C?@02;O5<>< :>45 :0: 8A:;NG5=85 .NET System.NullReferenceException.  MB>< AG5BG8:5 CG8BK20NBAO :0: >1@01>B0==K5, B0: 8 =5>1@01>B0==K5 8A:;NG5=8O. @54?>;0305BAO, GB> 8A:;NG5=8O 2>7=8:0NB ;8HL 2 @54:8E A;CG0OE 8 =5 ?@>8AE>4OB ?@8 =>@<0;L=>< E>45 2K?>;=5=8O ?@>3@0<<K; 40==K9 AG5BG8: 1K; 22545= 4;O B>3>, GB>1K A83=0;878@>20BL > ?>B5=F80;L=KE ?@>1;5<0E ?@>872>48B5;L=>AB8 2 A;CG0OE, :>340 G0AB>B0 35=5@0F88 8A:;NG5=89 A;8H:>< 25;8:0 (>100). -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. TOTAL_EXCEP_FILTERS_RUN_019_NAME=$8;LB@>2/A5: TOTAL_EXCEP_FILTERS_RUN_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> D8;LB@>2 8A:;NG5=89 .NET, 2K?>;=5==KE 2 A5:C=4C. $8;LB@ 8A:;NG5=89 >?@545;O5B, 4>;6=> ;8 8A:;NG5=85 >1@010BK20BLAO. -B>B AG5BG8: >BA;568205B G0AB>BC 2K?>;=5=8O D8;LB@>2 8A:;NG5=89 2=5 7028A8<>AB8 >B B>3>, 1K;> ;8 >1@01>B0=> 8A:;NG5=85. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. TOTAL_EXCEP_FINALLYS_RUN_019_NAME=:>=G0B5;L=KE 1;>:>2/A5: TOTAL_EXCEP_FINALLYS_RUN_019_HELP=-B>B AG5BG8: ?>:07K205B G8A;> >:>=G0B5;L=KE 1;>:>2, 2K?>;=5==KE 2 A5:C=4C. :>=G0B5;L=K5 1;>:8 >1O70B5;L=> 2K?>;=ONBAO 2=5 7028A8<>AB8 >B B>3>, :0: 1K; 2K?>;=5= 2KE>4 87 ?@>1=>3> 1;>:0. #G8BK20NBAO B>;L:> >:>=G0B5;L=K5 1;>:8, 2K?>;=5==K5 4;O 8A:;NG5=89; >:>=G0B5;L=K5 1;>:8 2 25B2OE >1KG=>3> :>40 MB8< AG5BG8:>< 83=>@8@CNBAO. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. EXCEPT_STACK_DEPTH_019_NAME=;C18=0 >B 2K40G8 4> 70E20B0 EXCEPT_STACK_DEPTH_019_HELP='8A;> :04@>2 AB5:0, ?@>945==KE 70 A5:C=4C >B :04@0, A35=5@8@>202H53> 8A:;NG5=85 .NET, : :04@C, >1@01>B02H5<C MB> 8A:;NG5=85. -B>B AG5BG8: >1=C;O5BAO ?@8 2E>45 2 >1@01>BG8: 8A:;NG5=8O, ?>MB><C 4;O 2;>65==KE 8A:;NG5=89 1C45B ?>:070=0 3;C18=0 AB5:0 >B >4=>3> >1@01>BG8:0 4> 4@C3>3>. -B>B AG5BG8: =5 >15A?5G8205B CA@54=5=85 ?> 2@5<5=8; >= ?>:07K205B >B=>H5=85 @07=>AB8 <564C 7=0G5=8O<8, =01;N405<K<8 2 42CE ?>A;54=8E 87<5@5=8OE, : 8=B5@20;C <564C 87<5@5=8O<8. DotNetCLR_Memory_OBJECT_01D_NAME=.NET CLR-minne DotNetCLR_Memory_OBJECT_01D_HELP=Räknare för CLR:s sopinsamlingsheap. GEN0_COLLECTIONS_COUNTER_01D_NAME=Antal generation 0-insamlingar GEN0_COLLECTIONS_COUNTER_01D_HELP=Den här räknaren visar hur många gånger objekt i generation 0 (den yngsta, senast tilldelade) sopinsamlats sedan programstarten. Sopinsamling för generation 0 sker när det tillgängliga minnet i generation 0 inte räcker för en tilldelningsbegäran. Räknaren inkrementeras när en sopinsamling för generation 0 slutförs. Sopinsamlingar för högre generationer tar med alla sopinsamlingar för lägre generationer. Räknaren inkrementeras explicit när en sopinsamling för en högre generation (generation 1 eller 2) görs. Värdet _Global_counter är inte exakt och ska ignoreras. Den här räknaren visar det senaste observerade värdet. GEN1_COLLECTIONS_COUNTER_01D_NAME=Antal generation 1-insamlingar GEN1_COLLECTIONS_COUNTER_01D_HELP=Den här räknaren visar hur många gånger objekt i generation 1 har sopinsamlats sedan programstarten. Räknaren inkrementeras när en sopinsamling för generation 1 slutförs. Sopinsamlingar för högre generationer tar med alla sopinsamlingar för lägre generationer. Räknaren inkrementeras explicit när en sopinsamling för en högre generation (generation 2) görs. Värdet _Global_counter är inte exakt och ska ignoreras. Den här räknaren visar det senaste observerade värdet. GEN2_COLLECTIONS_COUNTER_01D_NAME=Antal generation 2-insamlingar GEN2_COLLECTIONS_COUNTER_01D_HELP=Den här räknaren visar hur många gånger objekt i generation 2 (äldre objekt) har sopinsamlats sedan programstarten. Räknaren inkrementeras när en sopinsamling för generation 2 slutförs (kallas även fullständig sopinsamling). Värdet _Global_counter är inte exakt och ska ignoreras. Den här räknaren visar det senaste observerade värdet. GEN0_BYTES_PROMOTED_COUNTER_01D_NAME=Minne upphöjt från generation 0 GEN0_BYTES_PROMOTED_COUNTER_01D_HELP=Den här räknaren visar hur många byte minne som överlever sopinsamlingen och överförs från generation 0 till generation 1. Objekt som överförs bara för att de väntar på att slutföras tas inte med i räknaren. Räknaren visar det värde som observerades i slutet av den senaste sopinsamlingen. Det är inte en kumulativ räknare. GEN1_BYTES_PROMOTED_COUNTER_01D_NAME=Minne upphöjt från generation 1 GEN1_BYTES_PROMOTED_COUNTER_01D_HELP=Den här räknaren visar hur många byte minne som överlever sopinsamlingen och överförs från generation 1 till generation 2. Objekt som överförs bara för att de väntar på att slutföras tas inte med i räknaren. Räknaren visar det värde som observerades i slutet av den senaste sopinsamlingen. Det är inte en kumulativ räknare. Räknaren nollställs om den senaste sopinsamlingen var enbart för generation 0. GEN0_PROMOTION_RATE_01D_NAME=Mängden byte/sekund upphöjd från generation 0 GEN0_PROMOTION_RATE_01D_HELP=Den här räknaren visar antal byte per sekund som överförs från generation 0 (den yngsta) till generation 1. Objekt som överförs bara för att de väntar på att slutföras tas inte med i räknaren. Minne överförs när det har överlevt en skräpinsamling. Den här räknaren skapades som en indikator på hur många relativt långlivade objekt som skapats per sekund. Räknaren visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. GEN1_PROMOTION_RATE_01D_NAME=Mängden byte/sekund upphöjd från generation 1 GEN1_PROMOTION_RATE_01D_HELP=Den här räknaren visar antal byte per sekund som överförs från generation 1 till generation 2 (den äldsta). Objekt som överförs bara för att de väntar på att slutföras tas inte med i räknaren. Minne överförs när det har överlevt en skräpinsamling. Ingenting överförs från generation 2 eftersom den är äldst. Den här räknaren skapades som en indikator på hur många mycket långlivade objekt som skapats per sekund. Räknaren visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_01D_NAME=Väntande minne upphöjt från generation 0 GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_01D_HELP=Den här räknaren visar antal byte minne som överförs från generation 0 till generation 1 bara för att de väntar på att slutföras. Den här räknaren visar det värde som observerades vid slutet av den senaste sopinsamlingen. Det är inte en kumulativ räknare. PROCESS_ID_01D_NAME=Process-ID PROCESS_ID_01D_HELP=Den här räknaren visar process-ID:t för den CLR-processinstans som övervakas. Värdet som visas är 0 tills efter den första skräpinsamlingen. GEN0_HEAP_SIZE_COUNTER_01D_NAME=Heap-storlek för generation 0 GEN0_HEAP_SIZE_COUNTER_01D_HELP=Den här räknaren visar maximalt antal byte som kan tilldelas i generation 0. Den indikerar inte aktuellt antal byte tilldelade i generation 0. En sopinsamling för generation 0 aktiveras när tilldelningarna sedan den senaste sopinsamlingen överskrider denna storlek. Storleken för generation 0 ställs in av sopinsamlingen och kan ändras när programmet körs. När insamlingen för generation 0 är klar är heapen för generation 0 faktiskt 0 byte. Räknaren visar storleken (i byte) på tilldelningar som skulle utlösa nästa sopinsamling för generation 0. Räknaren uppdateras efter varje sopinsamling, inte efter varje tilldelning. GEN1_HEAP_SIZE_COUNTER_01D_NAME=Heap-storlek för generation 1 GEN1_HEAP_SIZE_COUNTER_01D_HELP=Den här räknaren visar nuvarande antal byte i generation 1. Räknaren visar inte maximal storlek för generation 1. Objekt tilldelas inte direkt i den här generationen, de överförs från tidigare sopinsamlingar för generation 0. Räknaren uppdateras efter varje sopinsamling, inte efter varje tilldelning. GEN2_HEAP_SIZE_COUNTER_01D_NAME=Heap-storlek för generation 2 GEN2_HEAP_SIZE_COUNTER_01D_HELP=Den här räknaren visar aktuellt antal byte i generation 2. Räknaren visar inte maximal storlek för generation 1. Objekt tilldelas inte direkt i den här generationen, de överförs från tidigare sopinsamlingar för generation 1. Räknaren uppdateras efter varje sopinsamling, inte efter varje tilldelning. LARGE_OBJECT_SIZE_COUNTER_01D_NAME=Heap-storlek för stora objekt LARGE_OBJECT_SIZE_COUNTER_01D_HELP=Den här räknaren visar aktuell storlek för heapen för stora objekt i byte. Objekt som är större än ett tröskelvärde behandlas som stora objekt av skräpinsamlaren och tilldelas direkt till en särskild heap. De överförs inte via generationerna. I CLR v1.1 och högre är tröskelvärdet 85 000 byte. Räknaren uppdateras efter varje skräpinsamling, inte efter varje tilldelning. SURVIVE_FINALIZE_COUNTER_01D_NAME=Överlevande objekt SURVIVE_FINALIZE_COUNTER_01D_HELP=Den här räknaren visar antalet sopinsamlade objekt som överlevt en insamling eftersom de väntar på att slutföras. Om dessa objekt innehåller referenser till andra objekt överlever även dessa objekt, men de räknas inte av den här räknaren. Räknarna "Väntande minne överfört från generation 0" och "Väntande minne överfört från generation 1" representerar allt minne som överlevt på grund av slutförande. Räknaren är inte kumulativ, den uppdateras efter varje sophämtning med antalet överlevande för enbart den sopinsamlingen. Räknaren är avsedd att visa den extra minnesbelastning programmet kan ge upphov till på grund av slutförande. NUM_HANDLES_COUNTER_01D_NAME=Antal GC-referenser NUM_HANDLES_COUNTER_01D_HELP=Den här räknaren visar nuvarande antal handles för sopinsamling. Handles för sopinsamling är handles till resurser utanför CLR och den hanterade miljön. Handles tar upp liten plats i minnet i sopinsamlingens heap men kan vara kostsamma för resurser som inte hanteras. ALLOCATION_RATE_COUNTER_01D_NAME=Allokerade byte/sekund ALLOCATION_RATE_COUNTER_01D_HELP=Den här räknaren visar antal byte per sekund som tilldelas i sopinsamlingens heap. Räknaren uppdateras efter varje sopinsamling, inte efter varje tilldelning. Räknaren är inte ett medelvärde över tiden, den visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. INDUCED_GC_COUNTER_01D_NAME=Antal framkallade GC INDUCED_GC_COUNTER_01D_HELP=Den här räknaren visar det högsta antal gånger en sopinsamling utförts på grund av ett explicit anrop till GC.Collect. Det är god sed att låta sopinsamlingen ställa in hur ofta insamlingarna görs. PER_TIME_IN_GC_COUNTER_01D_NAME=Tid i GC i procent PER_TIME_IN_GC_COUNTER_01D_HELP=Procentuell tid med sopinsamling är den andel av tiden som sopinsamling utförts sedan den senaste sopinsamlingscykeln. Räknaren är oftast en indikator på det arbete med att samla in och packa minne som utförts av sopinsamlingen för programmets räkning. Räknaren uppdateras bara efter varje sopinsamling och värdet visar det senaste observerade värdet, inte ett medelvärde. PER_TIME_IN_GC_COUNTER_BASE_01D_NAME=Inte visat PER_TIME_IN_GC_COUNTER_BASE_01D_HELP=Visas inte. TOTAL_HEAP_SIZE_COUNTER_01D_NAME=Mängden byte i alla heaps TOTAL_HEAP_SIZE_COUNTER_01D_HELP=Den här räknaren är summan av fyra andra räknare: Heapstorlek för generation 0, Heapstorlek för generation 1, Heapstorlek för generation 2 och Heapstorlek för stora objekt. Räknaren visar aktuell minnestilldelning för sopinsamlingens heapar. TOTAL_COMMITTED_MEM_COUNTER_01D_NAME=Total mängd allokerade byte TOTAL_COMMITTED_MEM_COUNTER_01D_HELP=Den här räknaren visar total mängd virtuellt minne (i byte) som allokerats för sopinsamling (allokerat minne är det fysiska minne för vilket utrymme har reserverats i diskens sidindelningsfil). TOTAL_RESERVED_MEM_COUNTER_01D_NAME=Total mängd reserverade byte TOTAL_RESERVED_MEM_COUNTER_01D_HELP=Den här räknaren visar mängden virtuellt minne (i byte) som för närvarande är reserverad av sopinsamlingen (reserverat minne är det virtuella minnesutrymme som reserverats för programmet utan att några sidor på disken eller i huvudminnet har använts). GC_PINNED_OBJECTS_01D_NAME=Antal fasta objekt GC_PINNED_OBJECTS_01D_HELP=Den här räknaren visar antalet fasta objekt som påträffades under den senaste sopinsamlingen. Räknaren spårar bara fasta objekt i heapar som sopinsamlas. En sopinsamling för generation 0 skulle bara medföra räkning av antal fasta objekt i heapen för generation 0. Ett fast objekt är ett objekt som inte kan flyttas i minnet av sopinsamlingen. GC_SINKBLOCKS_01D_NAME=Antal synkroniseringsblock som används GC_SINKBLOCKS_01D_HELP=Den här räknaren visar hur många synkblock som används. Synkblock är objektspecifika datastrukturer som tilldelas för lagring av synkroniseringsinformation. Synkblock innehåller svaga referenser till hanterade objekt och måste sökas igenom av sopinsamlingen. Synkblock är inte begränsade till lagring av synkroniseringsinformation och kan också innehålla COM-interop-metadata. DotNetCLR_Loading_OBJECT_01D_NAME=.NET CLR-inläsning DotNetCLR_Loading_OBJECT_01D_HELP=Statistik för CLR-klassinläsaren. LOADING_CLASSES_TOTAL_01D_NAME=Totalt antal klasser som lästs in LOADING_CLASSES_TOTAL_01D_HELP=Den här räknaren visar det kumulativa antalet klasser som har lästs in i alla sammansättningar sedan tillämpningen startades. LOADING_TIME_01D_NAME=Tid för inläsning i procent LOADING_TIME_01D_HELP=Reserverad för framtida användning. LOADING_ASMSEARCHLEN_01D_NAME=Söklängd för sammansättning LOADING_ASMSEARCHLEN_01D_HELP=Reserverad för framtida användning. LOADING_LOADFAILURES_TOTAL_01D_NAME=Totalt antal inläsningsfel LOADING_LOADFAILURES_TOTAL_01D_HELP=Den här räknaren visar det högsta antalet klasser som inte har kunnat läsas in sedan tillämpningen startades. Inläsningsfelen kan bero på många olika saker, bland annat otillräcklig säkerhet och ogiltigt format. Fullständig information finns i hjälpen för profiltjänster. LOADING_LOADFAILURES_INST_01D_NAME=Frekvens för inläsningsfel LOADING_LOADFAILURES_INST_01D_HELP=Den här räknaren visar hur många klasser som inte kunde läsas in per sekund. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. Inläsningsfelen kan bero på många olika saker, bland annat otillräcklig säkerhet och felaktigt format. Fullständig information finns i hjälpen för profiltjänster. LOADING_HEAPSIZE_01D_NAME=Byte i laddar-heap LOADING_HEAPSIZE_01D_HELP=Den här räknaren visar aktuell storlek (i byte) för det minne som är allokerat av klassinläsaren över alla tillämpningsdomäner (allokerat minne är fysiskt minne som utrymme har reserverats för på diskens sidindelningsfil). LOADING_APPDOMAINS_UNLOADED_TOTAL_01D_NAME=Totalt antal inaktiveringar av tillämpningsdomäner LOADING_APPDOMAINS_UNLOADED_TOTAL_01D_HELP=Den här räknaren visar totalt antal inaktiverade tillämpningsdomäner sedan tillämpningen startades. Om en tillämpningsdomän läses in och inaktiveras flera gånger räknas varje inaktivering separat. LOADING_APPDOMAINS_UNLOADED_INST_01D_NAME=Frekvens för inaktiverade tillämpningsdomäner LOADING_APPDOMAINS_UNLOADED_INST_01D_HELP=Den här räknaren visar antalet inaktiverade tillämpningsdomäner per sekund. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan värdena som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. LOADING_CLASSES_CUR_01D_NAME=Aktuellt antal inlästa klasser LOADING_CLASSES_CUR_01D_HELP=Den här räknaren visar aktuellt antal inlästa klasser i alla sammansättningar. LOADING_CLASSES_INST_01D_NAME=Frekvens för inlästa klasser LOADING_CLASSES_INST_01D_HELP=Den här räknaren visar hur många klasser som läses in per sekund i alla sammansättningar. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. LOADING_APPDOMAINS_CUR_01D_NAME=Aktuellt antal tillämpningsdomäner LOADING_APPDOMAINS_CUR_01D_HELP=Den här räknaren visar aktuellt antal inlästa tillämpningsdomäner i det här tillämpningsprogrammet. En tillämpningsdomän (AppDomain) är en säker och flexibel bearbetningsenhet som CLR kan använda för att isolera olika program som kör samma process. LOADING_APPDOMAINS_TOTAL_01D_NAME=Totalt antal tillämpningsdomäner LOADING_APPDOMAINS_TOTAL_01D_HELP=Den här räknaren visar det högsta antal tillämpningsdomäner som lästs in sedan tillämpningen startades. En tillämpningsdomän (AppDomain) är en säker och flexibel bearbetningsenhet som CLR kan använda för att isolera olika program som kör samma process. LOADING_APPDOMAINS_INST_01D_NAME=Frekvens för tillämpningsdomäner LOADING_APPDOMAINS_INST_01D_HELP=Den här räknaren visar hur många tillämpningsdomäner som läses in per sekund. En tillämpningsdomän (AppDomain) är en säker och flexibel bearbetningsenhet som CLR kan använda för att isolera olika program som kör samma process. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. LOADING_ASSEMBLIES_CUR_01D_NAME=Aktuellt antal sammansättningar LOADING_ASSEMBLIES_CUR_01D_HELP=Den här räknaren visar det aktuella antalet inlästa sammansättningar för alla tillämpningsdomäner i det här tillämpningsprogrammet. Om sammansättningen är inläst som domänneutral från flera tillämpningsdomäner inkrementeras räknaren bara en gång. Sammansättningar kan läsas in som domänneutrala om deras kod kan delas av alla tillämpningsdomäner eller läsas in som domänspecifika om koden är privat för en tillämpningsdomän. LOADING_ASSEMBLIES_TOTAL_01D_NAME=Totalt antal sammansättningar LOADING_ASSEMBLIES_TOTAL_01D_HELP=Den här räknaren visar det totala antalet inlästa sammansättningar sedan programstarten. Om sammansättningen är inläst som domänneutral från flera tillämpningsdomäner inkrementeras räknaren bara en gång. Sammansättningar kan läsas in som domänneutrala om deras kod kan delas av alla tillämpningsdomäner eller läsas in som domänspecifika om koden är privat för en tillämpningsdomän. LOADING_ASSEMBLIES_INST_01D_NAME=Frekvens för sammansättningar LOADING_ASSEMBLIES_INST_01D_HELP=Den här räknaren visar antalet inlästa sammansättningar för alla tillämpningsdomäner per sekund. Om sammansättningen är inläst som domänneutral från flera tillämpningsdomäner inkrementeras räknaren bara en gång. Sammansättningar kan läsas in som domänneutrala om deras kod kan delas av alla tillämpningsdomäner eller läsas in som domänspecifika om koden är privat för en tillämpningsdomän. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan de värden som observerats vid de två senaste samplingarna delat med samplingsintervallets längd. DotNetCLR_Jit_OBJECT_01D_NAME=JIT-kompilering för .NET CLR DotNetCLR_Jit_OBJECT_01D_HELP=Statistik för JIT-kompilering för CLR. TOTAL_METHODS_JITTED_01D_NAME=Antal JIT-kompilerade metoder TOTAL_METHODS_JITTED_01D_HELP=Den här räknaren visar det totala antalet metoder som JIT-kompilerats (Just-In-Time) av CLR JIT-kompilatorn sedan programstarten. Räknaren tar inte med metoder som JIT-kompilerats i förväg. JITTED_IL_CUR_01D_NAME=Mängd JIT-kompilerade IL-byte JITTED_IL_CUR_01D_HELP=Den här räknaren visar totalt antal JIT-kompilerade IL-byte sedan programstarten. Räknarens värde är exakt samma som räknaren "Totalt antal JIT-kompilerade IL-byte". JITTED_IL_TOTAL_01D_NAME=Total mängd JIT-kompilerade IL-byte JITTED_IL_TOTAL_01D_HELP=Den här räknaren visar totalt antal JIT-kompilerade IL-byte sedan programstarten. Räknarens värde är exakt samma som räknaren "Antal JIT-kompilerade IL-byte". JITTED_IL_INST_01D_NAME=Mängd JIT-kompilerade IL-byte/sekund JITTED_IL_INST_01D_HELP=Den här räknaren visar hur många IL-byte som JIT-kompileras per sekund. Räknaren är inte ett medelvärde över tiden, utan visar skillnaden mellan de värden som observerats vid de senaste två samplingarna delat med samplingsintervallets längd. JIT_FAILURES_01D_NAME=Standardfel för JIT-kompilatorn JIT_FAILURES_01D_HELP=Den här räknaren visar det högsta antal metoder som JIT-kompilatorn har misslyckats med att kompilera sedan programstarten. Felet kan uppstå om IL inte kan verifieras eller om ett internt fel uppstår i JIT-kompilatorn. TIME_IN_JIT_01D_NAME=Tid för JIT-kompilering i procent TIME_IN_JIT_01D_HELP=Den här räknaren visar den procentuella andelen förfluten tid som ägnats åt JIT-kompilering sedan den senaste JIT-kompileringsfasen. Räknaren uppdateras efter varje JIT-kompileringsfas. En JIT-kompileringsfas är den fas i vilken en metod och dess beroenden kompileras. TIME_IN_JIT_BASE_01D_NAME=Inte visat TIME_IN_JIT_BASE_01D_HELP=Visas inte. DotNetCLR_Interop_OBJECT_01D_NAME=.NET CLR-interop DotNetCLR_Interop_OBJECT_01D_HELP=Statistik för CLR-interop. CURRENT_CCW_01D_NAME=Antal CCW CURRENT_CCW_01D_HELP=Den här räknaren visar aktuellt antal CCW:er (Com-Callable-Wrappers). En CCW är en proxy för det .NET-hanterade objekt som refereras från ohanterade COM-klienter. Räknaren är avsedd att indikera antalet hanterade objekt som refereras av oförvaltad COM-kod. CURRENT_STUBS_01D_NAME=Antal stub-rutiner CURRENT_STUBS_01D_HELP=Den här räknaren visar antalet stub-rutiner som skapats av CLR. Stub-rutiner konverterar argument och returvärden från förvaltad till oförvaltad kod och tvärt om, under COM-interop-anrop eller PInvoke-anrop. NUM_MARSHALLING_01D_NAME=Antal konverteringar NUM_MARSHALLING_01D_HELP=Den här räknaren visar antalet gånger som argument och returvärden har konverterats från förvaltad till oförvaltad kod och vice versa sedan tillämpningsprogrammet startades. Räknaren ökas inte om stub-rutinerna är infogade. (Stub-rutiner används för att konvertera argument och returvärden). Stub-rutiner är vanligtvis infogade om konverteringsbelastningen är liten. TOTAL_TLB_IMPORTS_01D_NAME=Antal TLB-importer/sekund TOTAL_TLB_IMPORTS_01D_HELP=Reserverad för framtida användning. TOTAL_TLB_EXPORTS_01D_NAME=Antal TLB-exporter/sekund TOTAL_TLB_EXPORTS_01D_HELP=Reserverad för framtida användning. DotNetCLR_LocksAndThreads_OBJECT_01D_NAME=.NET CLR-lås och -trådar DotNetCLR_LocksAndThreads_OBJECT_01D_HELP=Statistik för CLR-lås och -trådar. CONTENTION_TOTAL_01D_NAME=Totalt antal konflikter CONTENTION_TOTAL_01D_HELP=Den här räknaren visar det totala antal gånger CLR-trådar inte har lyckats erhålla ett hanterat lås. Hanterade lås kan erhållas på flera sätt: genom lock-satsen i C#, genom att anropa System.Monitor.Enter eller genom att använda det anpassade attributet MethodImplOptions.Synchronized. CONTENTION_INST_01D_NAME=Antal konflikter/sekund CONTENTION_INST_01D_HELP=Anger med vilken frekvens trådar i körningsmiljön inte har lyckats att erhålla ett hanterat lås. Hanterade lås kan erhållas på flera sätt: genom en lock-sats i C#, genom att anropa System.Monitor.Enter eller genom att använda det anpassade attributet MethodImplOptions.Synchronized. QUEUE_LENGTH_CUR_01D_NAME=Aktuell kölängd QUEUE_LENGTH_CUR_01D_HELP=Den här räknaren visar det totala antalet trådar som för närvarande väntar på att erhålla hanterade lås i tillämpningsprogrammet. Räknaren visar inte medelvärdet över tiden utan det senast observerade värdet. QUEUE_LENGTH_TOTAL_01D_NAME=Maximal kölängd QUEUE_LENGTH_TOTAL_01D_HELP=Den här räknaren visar det totala antalet trådar som har väntat på att erhålla hanterade lås sedan tillämpningsprogrammet startades. QUEUE_LENGTH_INST_01D_NAME=Kölängd/sekund QUEUE_LENGTH_INST_01D_HELP=Den här räknaren visar antalet trådar per sekund som väntar på att erhålla hanterade lås i tillämpningsprogrammet. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. CURRENT_LOGICAL_THREADS_01D_NAME=Aktuellt antal logiska trådar CURRENT_LOGICAL_THREADS_01D_HELP=Den här räknaren visar det aktuella antalet .NET-trådobjekt i tillämpningsprogrammet. Ett .NET-trådobjekt skapas av System.Threading.Thread eller när en ohanterad tråd körs i den hanterade miljön. Räknaren håller reda på antalet trådar som körs eller som har stoppats. Räknaren visar inte medelvärdet över tiden utan visar endast det senast observerade värdet. CURRENT_PHYSICAL_THREADS_01D_NAME=Aktuellt antal fysiska trådar CURRENT_PHYSICAL_THREADS_01D_HELP=Den här räknaren visar antalet lokala OS-trådar som har skapats och ägs av CLR för att fungera som underliggande trådar för .NET-trådobjekt. Räknaren tar inte med trådarna som används av CLR för interna åtgärder. Den är en delmängd av trådarna i OS-processen. RECOGNIZED_THREADS_CUR_01D_NAME=Aktuellt antal identifierade trådar RECOGNIZED_THREADS_CUR_01D_HELP=Den här räknaren visar antalet trådar som för närvarande har identifierats av CLR. För dessa trådar finns ett motsvarande .NET-trådobjekt som associerats med dem. Dessa trådar skapas inte av CLR, de skapas utanför CLR, men de har körts minst en gång i CLR-miljön. Endast unika trådar spåras. Trådar med samma tråd-ID som körs på nytt i CLR-miljön eller som skapas på nytt efter att de lämnat CLR-miljön räknas endast en gång. RECOGNIZED_THREADS_TOTAL_01D_NAME=Totalt antal identifierade trådar RECOGNIZED_THREADS_TOTAL_01D_HELP=Den här räknaren visar det totala antalet trådar som har identifierats av CLR sedan tillämpningsprogrammet startades. För dessa trådar finns ett motsvarande .NET-trådobjekt som associerats med dem. Trådarna skapas inte av CLR, de skapas utanför CLR, men de har körts minst en gång i CLR-miljön. Endast unika trådar spåras. Trådar med samma tråd-ID som körs på nytt i CLR-miljön eller som skapas på nytt efter att de lämnat CLR-miljön räknas endast en gång. RECOGNIZED_THREADS_INST_01D_NAME=Frekvens för identifierade trådar/sekund RECOGNIZED_THREADS_INST_01D_HELP=Den här räknaren visar det antal trådar per sekund som har identifierats av CLR. För dessa trådar finns ett motsvarande .NET-trådobjekt som associerats med dem. Trådarna skapas inte av CLR, de skapas utanför CLR, men de har körts minst en gång i CLR-miljön. Endast unika trådar spåras. Trådar med samma tråd-ID som körs på nytt i CLR-miljön eller som skapas på nytt efter att de lämnat CLR-miljön räknas endast en gång. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. DotNetCLR_Security_OBJECT_01D_NAME=.NET CLR-säkerhet DotNetCLR_Security_OBJECT_01D_HELP=Statistik för CLR-säkerhet. SECURITY_TOTALRTCHECKS_01D_NAME=Totalt antal körningskontroller SECURITY_TOTALRTCHECKS_01D_HELP=Den här räknaren visar det totala antalet CAS-körningskontroller (Code Access Security) som utförts sedan tillämpningsprogrammet startades. CAS-körningskontroller utförs när en anropare anropar en anropsmottagare och begär en särskild behörighet. Körningskontrollen utförs vid varje anrop från anroparen genom att anroparens aktuella trådstack undersöks. Används räknaren tillsammans med räknaren Stackdjup indikeras prestandabelastningen vid säkerhetskontroller. SECURITY_TIMEAUTHORIZE_01D_NAME=Tid för signaturautentisering i procent SECURITY_TIMEAUTHORIZE_01D_HELP=Reserverad för framtida användning. SECURITY_LINKCHECKS_01D_NAME=Antal länktidskontroller SECURITY_LINKCHECKS_01D_HELP=Den här räknaren visar det totala antalet CAS-länktidskontroller (Code Access Security) sedan tillämpningsprogrammet startades. CAS-länktidskontroller utförs när en anropare anropar en anropsmottagare och begär en särskild behörighet under JIT-kompilering. Länktidskontroller utförs en gång per anropare. Räknaren är inte en indikation på allvarliga prestandaproblem utan på säkerhetssystemets aktivitet. SECURITY_TIMERTCHECKS_01D_NAME=Tid för körningskontroller i procent SECURITY_TIMERTCHECKS_01D_HELP=Den här räknaren visar procentandelen förfluten tid som använts för CAS-körningskontroller sedan den senaste körningskontrollen. CAS (Code Access Security) gör att kod kan anges som betrodd på olika nivåer och de olika förtroendenivåerna används beroende på kodidentitet. Räknaren uppdateras i slutet av varje CAS-körningskontroll och den anger det senast observerade värdet, inte medelvärdet. SECURITY_TIMERTCHECKS_BASE_01D_NAME=Inte visat SECURITY_TIMERTCHECKS_BASE_01D_HELP=Visas inte. SECURITY_DEPTHSECURITY_01D_NAME=Stackdjup SECURITY_DEPTHSECURITY_01D_HELP=Den här räknaren visar stackens djup under den senaste CAS-körningskontrollen. CAS-körningskontrollerna utförs genom att stacken analyseras. Räknaren visar inte medelvärdet utan visar det senast observerade värdet. DotNetCLR_Remoting_OBJECT_01D_NAME=.NET CLR-fjärranrop DotNetCLR_Remoting_OBJECT_01D_HELP=Statistik för CLR-fjärranrop. CONTEXT_REMOTECALLS_INST_01D_NAME=Fjärranrop/sekund CONTEXT_REMOTECALLS_INST_01D_HELP=Den här räknaren visar antalet fjärranrop per sekund. Ett fjärranrop är ett anrop till ett objekt utanför anroparens tillämpningsdomän. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. CONTEXT_CHANNELS_01D_NAME=Kanaler CONTEXT_CHANNELS_01D_HELP=Den här räknaren visar det totala antalet fjärrkanaler som registrerats över alla tillämpningsdomäner sedan tillämpningsprogrammet startades. Kanaler används för att transportera meddelanden till och från fjärrobjekt. CONTEXT_PROXIES_01D_NAME=Kontextproxy CONTEXT_PROXIES_01D_HELP=Den här räknaren visar det totala antalet fjärrproxyobjekt som skapats i den här processen sedan den startades. Proxyobjekt fungerar som representanter för fjärrobjekt och de ser till att alla proxyanrop vidarebefordras till rätt fjärrobjekt. CONTEXT_CLASSES_01D_NAME=Inlästa kontextbundna klasser CONTEXT_CLASSES_01D_HELP=Den här räknaren visar det aktuella antalet kontextbundna klasser som lästs in. Klasser som kan bindas till en kontext kallas kontextbundna klasser. Kontextbundna klasser deklareras med kontextattribut som tillhandahåller regler för synkronisering, trådtilldelning, transaktioner osv. CONTEXT_OBJALLOC_01D_NAME=Antal allokerade kontextbundna objekt/sekund CONTEXT_OBJALLOC_01D_HELP=Den här räknaren visar antalet allokerade kontextbundna objekt per sekund. Instanser av klasser som kan bindas till en kontext kallas kontextbundna objekt. Kontextbundna klasser deklareras med kontextattribut som tillhandahåller regler för synkronisering, trådtilldelning, transaktioner osv. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. CONTEXT_CONTEXTS_01D_NAME=Kontexter CONTEXT_CONTEXTS_01D_HELP=Den här räknaren visar det aktuella antalet fjärrkontexter i tillämpningsprogrammet. En kontext är en begränsad mängd som innehåller en samling objekt med samma användningsregler, till exempel regler för synkronisering, trådtilldelning, transaktioner osv. CONTEXT_REMOTECALLS_TOTAL_01D_NAME=Totalt antal fjärranrop CONTEXT_REMOTECALLS_TOTAL_01D_HELP=Den här räknaren visar det totala antalet fjärranrop sedan tillämpningsprogrammet startades. Ett fjärranrop är ett anrop till ett objekt utanför anroparens tillämpningsdomän. DotNetCLR_Excep_OBJECT_01D_NAME=.NET CLR-undantag DotNetCLR_Excep_OBJECT_01D_HELP=Körningsstatistik för CLR-undantagshantering. EXCEP_THROWN_TOTAL_01D_NAME=Antal undantag som utlösts EXCEP_THROWN_TOTAL_01D_HELP=Den här räknaren visar det totala antalet undantag som har utlösts sedan tillämpningsprogrammet startades. Dessa omfattar både .NET-undantag och ohanterade undantag som konverteras till .NET-undantag. Undantag för NULL-pekarreferenser i oförvaltad kod skulle till exempel utlösas igen i förvaltad kod som System.NullReferenceException. Räknaren tar med både hanterade och ohanterade undantag. Undantag som utlöses igen räknas igen. Undantag uppstår endast i sällsynta fall och inte i det normala kontrollflödet för tillämpningsprogrammet. EXCEP_THROWN_INST_01D_NAME=Antal undantag som utlöses/sekund EXCEP_THROWN_INST_01D_HELP=Den här räknaren visar antalet undantag som utlöses per sekund. Dessa omfattar både .NET-undantag och ohanterade undantag som konverteras till .NET-undantag. Undantag för NULL-pekarreferenser i oförvaltad kod skulle till exempel utlösas igen i förvaltad kod som System.NullReferenceException. Räknaren tar med både hanterade och ohanterade undantag. Undantag uppstår endast i sällsynta fall och inte i det normala kontrollflödet för tillämpningsprogrammet. Räknaren skapades för att indikera eventuella prestandaproblem på grund av att många (>100/s) undantag utlöses. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. TOTAL_EXCEP_FILTERS_RUN_01D_NAME=Antal filter/sekund TOTAL_EXCEP_FILTERS_RUN_01D_HELP=Den här räknaren visar antalet .NET-undantagsfilter som körs per sekund. Ett undantagsfilter utvärderar om ett undantag ska hanteras eller inte. Räknaren räknar undantagsfiltren oavsett om undantagen hanteras eller inte. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. TOTAL_EXCEP_FINALLYS_RUN_01D_NAME=Antal finally-block per sekund TOTAL_EXCEP_FINALLYS_RUN_01D_HELP=Den här räknaren visar antalet finally-block som körs per sekund. Ett finally-block körs oavsett hur try-blocket avslutades. Endast finally-block som körs för undantag räknas. Finally-block i normala kodsökvägar räknas inte. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. EXCEPT_STACK_DEPTH_01D_NAME=Antal skickade till uppsamlingsdjup/sekund EXCEPT_STACK_DEPTH_01D_HELP=Den här räknaren visar antalet stackramar som skickas från ramen som utlöste .NET-undantaget till ramen som hanterar undantaget per sekund. Räknaren ställs om till 0 när en undantagshanterare används så att kapslade undantag visar stackdjupet för hanterare-till-hanterare. Räknaren visar inte medelvärdet över tiden utan skillnaden mellan värdena som observerats under de senaste två samplingarna delat med samplingsintervallets varaktighet. DotNetCLR_Memory_OBJECT_01F_NAME=.NET CLR Bellei DotNetCLR_Memory_OBJECT_01F_HELP=CLR At11 Toplanan y11n sayaçlar1. GEN0_COLLECTIONS_COUNTER_01F_NAME=Gen 0 Toplamalar1 Say1s1 GEN0_COLLECTIONS_COUNTER_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri ku_ak 0 nesneleri (en yeni, son ayr1lm1_ olan) için at1k toplama (Gen 0 GC) say1s1n1 gösterir. Ku_ak 0'daki kullan1labilir bellek ay1rma istei için yeterli olmad11 durumda Gen 0 GC olu_ur. Bu sayaç Gen 0 GC sonunda artar. Yüksek ku_ak GC'leri alçak ku_aklar1n tümünü içerir. Yüksek ku_ak (Gen 1 veya Gen 2) GC olu_tuunda sayaç belirgin bir _ekilde artar. _Global_ sayaç deeri tam doru deildir ve gözard1 edilmelidir. Bu sayaç gözlenen en son deeri görüntüler. GEN1_COLLECTIONS_COUNTER_01F_NAME=Gen 1 Toplamalar1 Say1s1 GEN1_COLLECTIONS_COUNTER_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri ku_ak 1 nesneleri için at1k toplama say1s1n1 gösterir. Bu sayaç Gen 1 GC sonunda artar. Yüksek ku_ak GC'leri alçak ku_aklar1n tümünü içerir. Yüksek ku_ak (Gen 2) GC olu_tuunda sayaç belirgin bir _ekilde artar. _Global_ sayaç deeri tam doru deildir ve gözard1 edilmelidir. Bu sayaç gözlenen en son deeri görüntüler. GEN2_COLLECTIONS_COUNTER_01F_NAME=Gen 2 Toplamalar1 Say1s1 GEN2_COLLECTIONS_COUNTER_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri ku_ak 2 nesneleri (daha eski) için at1k toplama say1s1n1 gösterir. Bu sayaç Gen 2 GC (tam GC olarak da adland1r1l1r) sonunda artar. _Global_ sayaç deeri tam doru deildir ve gözard1 edilmelidir. Bu sayaç gözlenen en son deeri görüntüler. GEN0_BYTES_PROMOTED_COUNTER_01F_NAME=Gen 0'dan Yükseltilen Bellek GEN0_BYTES_PROMOTED_COUNTER_01F_HELP=Bu sayaç at1k toplama (GC) i_lemi d1_1nda kalan ve ku_ak 0'dan ku_ak 1'e yükseltilen bellei bayt cinsinden görüntüler; tamamlanmay1 bekledikleri için yükseltilen nesneler bu sayaçta görüntülenmez. Sayaç, son GC i_leminden sonra gözlenen deeri görüntüler; kümülatifi gösteren bir sayaç deildir. GEN1_BYTES_PROMOTED_COUNTER_01F_NAME=Gen 1'den Yükseltilen Bellek GEN1_BYTES_PROMOTED_COUNTER_01F_HELP=Bu sayaç at1k toplama (GC) i_lemi d1_1nda kalan ve ku_ak 1'den ku_ak 2'ye yükseltilen bellei bayt cinsinden görüntüler; tamamlanmay1 bekledikleri için yükseltilen nesneler bu sayaçta görüntülenmez. Sayaç, son GC i_leminden sonra gözlenen deeri görüntüler; kümülatifi gösteren bir sayaç deildir. Son GC yaln1zca Gen 0 GC ise bu sayaç s1f1rlan1r. GEN0_PROMOTION_RATE_01F_NAME=Yükseltilen Gen 0 Bayt/Sn GEN0_PROMOTION_RATE_01F_HELP=Bu sayaç ku_ak 0'dan (en yeni) ku_ak 1'e saniyede yükseltilen bayt miktar1n1 görüntüler; yaln1zca tamamlanmay1 bekledikleri için yükseltilmi_ olan nesneler bu sayaçta görüntülenmez. At1k toplama i_leminin d1_1nda kalan bellek yükseltilir. Sayaç, saniyede olu_turulan ya_am süresi dierlerine göre daha uzun nesnelerin göstergesi olarak tasarlanm1_t1r. Bu sayaç, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. GEN1_PROMOTION_RATE_01F_NAME=Yükseltilen Gen 1 Bayt/Sn GEN1_PROMOTION_RATE_01F_HELP=Bu sayaç bir saniyede, ku_ak 1'den ku_ak 2'ye (en eski) yükseltilen baytlar1 görüntüler; tamamlanmay1 bekledikleri için yükseltilen nesneler bu sayaçta görüntülenmez. At1k toplama i_leminin d1_1nda kalan bellek yükseltilir. Ku_ak 2 en eski olduu için bu bölümden yükseltme gerçekle_mez. Sayaç, saniyede olu_turulan ya_am süresi dierlerine göre daha uzun nesnelerin göstergesi olarak tasarlanm1_t1r. Bu sayaç, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_01F_NAME=Gen 0'dan Yükseltilen Tamamlama Bellei GEN0_FINALIZATION_BYTES_PROMOTED_COUNTER_01F_HELP=Bu sayaç, yaln1zca tamamlanmay1 bekledikleri için ku_ak 0'dan ku_ak 1'e yükseltilen bellei bayt cinsinden görüntüler. Sayaç, son GC i_leminden sonra gözlenen deeri görüntüler; kümülatifi gösteren bir sayaç deildir. PROCESS_ID_01F_NAME=0_lem Kimlii PROCESS_ID_01F_HELP=Bu sayaç izlenmekte olan CLR i_lemi örneinin i_lem kimliini görüntüler. 0lk at1k toplan1ncaya kadar görüntülenen deer 0 olacakt1r. GEN0_HEAP_SIZE_COUNTER_01F_NAME=Gen 0 y11n boyutu GEN0_HEAP_SIZE_COUNTER_01F_HELP=Bu sayaç ku_ak 0'da (gen 0) ayr1labilecek en fazla bayt miktar1n1 görüntüler; Gen 0 içinde geçerli olarak ayr1lm1_ olan bayt miktar1n1 görüntülemez. Son GC'den beri yap1lan ay1rmalar bu boyutu geçtiinde bir Gen 0 GC tetiklenir. Gen 0 boyutu At1k Toplay1c1 taraf1ndan ayarlan1r ve uygulaman1n çal1_t1r1lmas1 s1ras1nda dei_iklie urayabilir. Gen 0 toplama i_lemi sonunda Gen 0 y11n1 boyutu asl1nda 0 baytt1r; bu sayaç bir sonraki Gen 0 GC'yi tetikleyecek ay1rma boyutunu (bayt cinsinden) görüntüler. Sayaç, GC sonunda güncelle_tirilir, her ay1rma i_leminden sonra güncelle_tirilmez. GEN1_HEAP_SIZE_COUNTER_01F_NAME=Gen 1 y11n boyutu GEN1_HEAP_SIZE_COUNTER_01F_HELP=Bu sayaç, ku_ak 1'deki (Gen 1) geçerli bayt miktar1n1 görüntüler; Gen 1'in en yüksek boyutunu görüntülemez. Bu ku_akta nesneler dorudan ayr1lmaz; önceki Gen 0 GC'lerden yükseltilir. Sayaç, GC sonunda güncelle_tirilir, her ay1rma i_leminden sonra güncelle_tirilmez. GEN2_HEAP_SIZE_COUNTER_01F_NAME=Gen 2 y11n boyutu GEN2_HEAP_SIZE_COUNTER_01F_HELP=Bu sayaç, ku_ak 2'deki (Gen 2) geçerli bayt miktar1n1 görüntüler. Bu ku_akta nesneler dorudan ayr1lmaz; önceki Gen 1'lerden Gen 1 GC i_lemi s1ras1nda yükseltilir. Sayaç, GC sonunda güncelle_tirilir, her ay1rma i_leminden sonra güncelle_tirilmez. LARGE_OBJECT_SIZE_COUNTER_01F_NAME=Büyük Nesne Y11n boyutu LARGE_OBJECT_SIZE_COUNTER_01F_HELP=Bu sayaç, geçerli Büyük Nesne Y11n1 boyutunu bayt cinsinden görüntüler. Bir e_ikten büyük olan nesneler At1k Toplay1c1 taraf1ndan büyük nesne olarak deerlendirilir ve dorudan bir özel y11n içinde ayr1l1rlar; ku_aklar aras1nda yükseltilmezler. CLR v1.1 ve üstünde bu e_ik 85000 bayta e_ittir. Bu sayaç GC i_leminin sonunda güncelle_tirilir; her ay1rmadan sonra güncelle_tirilmez. SURVIVE_FINALIZE_COUNTER_01F_NAME=Sonland1rmadan Kurtulanlar SURVIVE_FINALIZE_COUNTER_01F_HELP=Bu sayaç tamamlanmay1 bekledikleri için toplama i_lemi d1_1nda kalan at1k toplanm1_ nesne say1s1n1 görüntüler. Bu nesneler dier nesnelere ba_vurular içeriyorsa, bu nesneler de d1_ar1da kal1r ancak sayaç taraf1ndan say1lmaz; "Gen 0'dan Yükseltilen Tamamlama Bellei" ve "Gen 1'den Yükseltilen Tamamlama Bellei" sayaçlar1 tamamlanma sonucunda d1_ar1da kalan tüm bellei gösterir. Bu sayaç bir kümülatif sayac1 deildir, belirli bir GC i_lemi s1ras1nda d1_ar1da kalanlarla her GC i_lemi sonunda güncelle_tirilir. Sayaç, uygulaman1n tamamlanmas1 sonucu urayabilecei ek yükü belirtecek _ekilde tasarlanm1_t1r. NUM_HANDLES_COUNTER_01F_NAME=GC Tutamaçlar1 Say1s1 NUM_HANDLES_COUNTER_01F_HELP=Bu sayaç kullan1lmakta olan GC 0_leyicilerinin say1s1n1 gösterir. GC 0_leyicileri CLR ve yönetilen ortama göre d1_ar1da kalan kaynaklar1n i_leyicileridir. 0_leyiciler GC Y11n1nda fazla bellek gerektirmez ancak yönetilmeyen kaynaklar için daha pahal1d1rlar. ALLOCATION_RATE_COUNTER_01F_NAME=Ayr1lan Bayt/sn ALLOCATION_RATE_COUNTER_01F_HELP=Bu sayaç, GC Y11n1nda saniyede ayr1lan bayt h1z1n1 görüntüler. Bu sayaç her ay1rma sonunda deil, her GC i_lemi sonunda güncelle_tirilir. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. INDUCED_GC_COUNTER_01F_NAME=Uyar1lm1_ GC Say1s1 INDUCED_GC_COUNTER_01F_HELP=Bu sayaç, GC.Collect'e yap1lan belirgin bir çar1 sonucunda gerçekle_tirilen at1k toplama i_lemi zirve say1s1n1 görüntüler. GC'nin kendi toplama i_lemlerinin s1kl11n1 ayarlamas1na izin vermek iyi bir yöntemdir. PER_TIME_IN_GC_COUNTER_01F_NAME=GC'de Harcanan % Zaman PER_TIME_IN_GC_COUNTER_01F_HELP=GC 0_leminde Harcanan % Zaman, son GC dönü_ünden beri at1k toplama (GC) i_leminde harcanan zaman1 yüzde olarak gösterimidir. Bu sayaç, genellikle bellei toplay1p s1k1_t1racak uygulama ad1na i_i yapan At1k Toplay1c1'n1n gerçekle_tirdii i_in bir göstergesidir. Bu sayaç yaln1zca her GC i_leminden sonra güncelle_tirilir ve sayaçta son gözlenen deer okunur; ortalama deer deildir. PER_TIME_IN_GC_COUNTER_BASE_01F_NAME=Görüntülenmiyor PER_TIME_IN_GC_COUNTER_BASE_01F_HELP=Görüntülenmiyor. TOTAL_HEAP_SIZE_COUNTER_01F_NAME=Tüm Y11nlardaki Bayt Miktar1 TOTAL_HEAP_SIZE_COUNTER_01F_HELP=Bu sayaç, a_a1da belirtilen dört sayac1n toplam1d1r: Gen 0 Y11n Boyutu; Gen 1 Y11n Boyutu; Gen 2 Y11n Boyutu ve Büyük Nesne Y11n Boyutu. Sayaç, GC Y11nlar1nda geçerli olarak ayr1lan bellei bayt cinsinden görüntüler. TOTAL_COMMITTED_MEM_COUNTER_01F_NAME=Toplam Ayr1lan Bayt Miktar1 TOTAL_COMMITTED_MEM_COUNTER_01F_HELP=Bu sayaç, At1k Toplay1c1 taraf1ndan ayr1lan sanal bellek miktar1n1 (bayt cinsinden) görüntüler. (Ayr1lan bellek, disk bellei dosyas1nda fiziksel olarak ayr1lan bellek alan1d1r). TOTAL_RESERVED_MEM_COUNTER_01F_NAME=Ayr1lan Toplam Bayt Miktar1 TOTAL_RESERVED_MEM_COUNTER_01F_HELP=Bu sayaç, At1k Toplay1c1 taraf1ndan ayr1lm1_ olan sanal bellek miktar1n1 bayt cinsinden görüntüler. (Ayr1lm1_ bellek, uygulama için ayr1lm1_ sanal bellek alan1d1r ancak disk veya ana bellek sayfalar1 kullan1lmaz.) GC_PINNED_OBJECTS_01F_NAME=0li_tirilmi_ Nesne Say1s1 GC_PINNED_OBJECTS_01F_HELP=Bu sayaç, son GC i_leminde kar_1la_1lan ili_tirilmi_ nesne say1s1n1 görüntüler. Sayaç yaln1zca at1k toplanm1_ y11nlarda bulunan ili_tirilmi_ nesneleri izler, örn. bir Gen 0 GC i_lemi ili_tirilmi_ nesnelerin yaln1zca ku_ak 0 y11n1nda numaraland1r1lmas1na neden olur. 0li_tirilmi_ nesne At1k Toplay1c1 taraf1ndan bellek içinde yeri dei_tirilemeyen nesnedir. GC_SINKBLOCKS_01F_NAME=Kullan1mda Olan E_itleme Bloklar1 Say1s1 GC_SINKBLOCKS_01F_HELP=Bu sayaç, kullan1lmakta olan e_itleme blok say1s1n1 görüntüler. E_itleme bloklar1, e_itleme bilgilerini depolamak için ayr1lan nesne ba_1na veri yap1lar1d1r. E_itleme bloklar1 yönetilen nesnelere zay1f ba_vurular içerir ve At1k Toplay1c1 taraf1ndan taranmas1 gerekir. E_itleme bloklar1 e_itleme bilgilerinin yan1 s1ra COM birlikte çal1_ma meta verilerini de depolayabilir. Bu sayaç eski e_itleme yöntemlerinin youn olarak kullan1lmas1 sonucu ortaya ç1kan performans sorunlar1n1 göstermek için tasarlanm1_t1r. DotNetCLR_Loading_OBJECT_01F_NAME=.NET CLR Yükleniyor DotNetCLR_Loading_OBJECT_01F_HELP=CLR S1n1f Yükleyicisi 0statistikleri. LOADING_CLASSES_TOTAL_01F_NAME=Yüklenen Toplam S1n1f LOADING_CLASSES_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri tüm Derlemelerde yüklenen s1n1flar1n kümülatif say1s1n1 gösterir. LOADING_TIME_01F_NAME=% Yükleme Süresi LOADING_TIME_01F_HELP=Daha sonraki kullan1mlar için ayr1lm1_. LOADING_ASMSEARCHLEN_01F_NAME=Derleme Arama Uzunluu LOADING_ASMSEARCHLEN_01F_HELP=Daha sonraki kullan1mlar için ayr1lm1_. LOADING_LOADFAILURES_TOTAL_01F_NAME=Toplam Yükleme Hatas1 Say1s1 LOADING_LOADFAILURES_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri yüklemesi ba_ar1s1z olan s1n1flar1n en yüksek say1s1n1 görüntüler. Bu yükleme hatalar1 yetersiz güvenlik veya geçersiz biçim gibi birçok nedenden kaynaklanabilir. Daha ayr1nt1l1 bilgi için profil hizmetleri yard1m1na bakabilirsiniz. LOADING_LOADFAILURES_INST_01F_NAME=Yükleme Hatalar1 H1z1 LOADING_LOADFAILURES_INST_01F_HELP=Bu sayaç, saniyede yüklemesi ba_ar1s1z olan s1n1f say1s1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. Bu yükleme hatalar1 yetersiz güvenlik veya geçersiz biçim gibi birçok nedenden kaynaklanabilir. Daha ayr1nt1l1 bilgi için profil hizmetleri yard1m1na bakabilirsiniz. LOADING_HEAPSIZE_01F_NAME=Yükleyici Y11n1 Bayt Say1s1 LOADING_HEAPSIZE_01F_HELP=Bu sayaç, tüm Uygulama Etki Alanlar1 aras1nda s1n1f yükleyicisi taraf1ndan ayr1lan geçerli bellek boyutunu bayt cinsinden görüntüler. (Ayr1lan bellek, disk bellei dosyas1nda fiziksel olarak ayr1lan bellek alan1d1r.) LOADING_APPDOMAINS_UNLOADED_TOTAL_01F_NAME=Toplam yüklemesi kald1r1lan uygulama etki alanlar1 LOADING_APPDOMAINS_UNLOADED_TOTAL_01F_HELP=Bu sayaç, uygulaman1n ba_lang1c1ndan beri yüklemesi kald1r1lm1_ olan toplam Uygulama Etki Alan1 say1s1n1 görüntüler. Bir Uygulama Etki Alan1 birden fazla kez yüklenip kald1r1l1rsa, sayaç her kald1rma i_lemini ayr1 olarak sayar. LOADING_APPDOMAINS_UNLOADED_INST_01F_NAME=Yüklemesi kald1r1lan uygulama etki alanlar1 h1z1 LOADING_APPDOMAINS_UNLOADED_INST_01F_HELP=Bu sayaç, saniyede yüklemesi kald1r1lan Uygulama Etki Alan1 say1s1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. LOADING_CLASSES_CUR_01F_NAME=Geçerli Yüklü S1n1f Say1s1 LOADING_CLASSES_CUR_01F_HELP=Bu sayaç, tüm Derlemelerde yüklü olan s1n1f say1s1n1 görüntüler. LOADING_CLASSES_INST_01F_NAME=S1n1flar1n Yüklenme H1z1 LOADING_CLASSES_INST_01F_HELP=Bu sayaç, tüm Derlemelerde saniyede yüklenen s1n1f say1s1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. LOADING_APPDOMAINS_CUR_01F_NAME=Geçerli uygulama etki alanlar1 LOADING_APPDOMAINS_CUR_01F_HELP=Bu sayaç, uygulamada yüklü olan geçerli Uygulama Etki Alan1 say1s1n1 görüntüler. Uygulama Etki Alanlar1, CLR'nin ayn1 i_lemde çal1_an uygulamalar aras1nda izolasyon salamas1 amac1yla kullanabilecei güvenli ve çok yönlü i_leme birimi salar. LOADING_APPDOMAINS_TOTAL_01F_NAME=Toplam Uygulama Etki Alan1 LOADING_APPDOMAINS_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri yüklenen Uygulama Etki Alan1n1n en yüksek say1s1n1 görüntüler. Uygulama Etki Alanlar1, CLR'nin ayn1 i_lemde çal1_an uygulamalar aras1nda izolasyon salamas1 amac1yla kullanabilecei güvenli ve çok yönlü i_leme birimi salar. LOADING_APPDOMAINS_INST_01F_NAME=Uygulama Etki Alan1 H1z1 LOADING_APPDOMAINS_INST_01F_HELP=Bu sayaç, saniyede yüklenen Uygulama Etki Alan1 say1s1n1 görüntüler. Uygulama Etki Alanlar1, CLR'nin ayn1 i_lemde çal1_an uygulamalar aras1nda izolasyon salamas1 amac1yla kullanabilecei güvenli ve çok yönlü i_leme birimi salar. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. LOADING_ASSEMBLIES_CUR_01F_NAME=Geçerli Derlemeler LOADING_ASSEMBLIES_CUR_01F_HELP=Bu sayaç, bu uygulamadaki tüm Uygulama Etki Alanlar1nda yüklü olan geçerli Derleme say1s1n1 görüntüler. Derleme birden fazla Uygulama Etki Alan1ndan herhangi bir etki alan1ndan ba1ms1z olarak yüklenirse sayaç yaln1zca bir kez art1r1l1r. Derlemeler, kodlar1 tüm Uygulama Etki Alanlar1 taraf1ndan payla_1labildiinde etki alan1ndan ba1ms1z veya kodlar1 Uygulama Etki Alan1na özel olduunda etki alan1na ba1ml1 yüklenebilir. LOADING_ASSEMBLIES_TOTAL_01F_NAME=Toplam Derlemeler LOADING_ASSEMBLIES_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri yüklenen toplam Derleme say1s1n1 görüntüler. Derleme birden fazla Uygulama Etki Alan1ndan herhangi bir etki alan1ndan ba1ms1z olarak yüklenirse sayaç yaln1zca bir kez art1r1l1r. Derlemeler, kodlar1 tüm Uygulama Etki Alanlar1 taraf1ndan payla_1labildiinde etki alan1ndan ba1ms1z veya kodlar1 Uygulama Etki Alan1na özel olduunda etki alan1na ba1ml1 yüklenebilir. LOADING_ASSEMBLIES_INST_01F_NAME=Derleme H1z1 LOADING_ASSEMBLIES_INST_01F_HELP=Bu sayaç, tüm Uygulama Etki Alanlar1 aras1nda saniyede yüklenen Derleme say1s1n1 görüntüler. Derleme birden fazla Uygulama Etki Alan1ndan herhangi bir etki alan1ndan ba1ms1z olarak yüklenirse sayaç yaln1zca bir kez art1r1l1r. Derlemeler, kodlar1 tüm Uygulama Etki Alanlar1 taraf1ndan payla_1labildiinde etki alan1ndan ba1ms1z veya kodlar1 Uygulama Etki Alan1na özel olduunda etki alan1na ba1ml1 yüklenebilir. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. DotNetCLR_Jit_OBJECT_01F_NAME=.NET CLR Jit DotNetCLR_Jit_OBJECT_01F_HELP=CLR Jit 0statistikleri. TOTAL_METHODS_JITTED_01F_NAME=An1nda Derlenen Yöntem Say1s1 TOTAL_METHODS_JITTED_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri CLR JIT derleyicisi taraf1ndan an1nda (Just-In-Time - JIT) derlenen toplam yöntem say1s1n1 görüntüler. Sayaç, an1nda derleme öncesi olan yöntemleri içermez. JITTED_IL_CUR_01F_NAME=An1nda Derlenen IL Bayt1 Say1s1 JITTED_IL_CUR_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri an1nda derlenen toplam IL bayt miktar1n1 görüntüler. Sayaç, "An1nda Derlenen Toplam IL Bayt1 Say1s1" sayac1na tamam1yla e_deerdir. JITTED_IL_TOTAL_01F_NAME=An1nda Derlenen Toplam IL Bayt Miktar1 JITTED_IL_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri an1nda derlenen toplam IL bayt miktar1n1 görüntüler. Sayaç, "An1nda Derlenen IL Bayt1 Say1s1" sayac1na tamam1yla e_deerdir. JITTED_IL_INST_01F_NAME=An1nda Derlenen IL Bayt1 / sn JITTED_IL_INST_01F_HELP=Bu sayaç, IL Baytlar1n1n saniyedeki an1nda derlenme h1z1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. JIT_FAILURES_01F_NAME=Standart An1nda Derleme Hata Say1s1 JIT_FAILURES_01F_HELP=Bu sayaç, uygulama ba_lang1c1ndan beri JIT derleyicisinin an1nda derleyemedii en fazla yöntem say1s1n1 görüntüler. IL dorulanam1yorsa veya JIT derleyicisinde bir iç hata varsa, bu hatayla kar_1la_abilirsiniz. TIME_IN_JIT_01F_NAME=% An1nda Derleme Süresi TIME_IN_JIT_01F_HELP=Bu sayaç, son an1nda derleme a_amas1ndan beri an1nda derleme s1ras1nda harcanan süreyi yüzde olarak görüntüler. Sayaç her an1nda derleme a_amas1ndan sonra güncelle_tirilir. An1nda derleme evresi, bir yöntem ve ba1ml1lar1n1n derlenmesi durumudur. TIME_IN_JIT_BASE_01F_NAME=Görüntülenmiyor TIME_IN_JIT_BASE_01F_HELP=Görüntülenmiyor. DotNetCLR_Interop_OBJECT_01F_NAME=.NET CLR Birlikte Çal1_ma DotNetCLR_Interop_OBJECT_01F_HELP=CLR birlikte çal1_ma istatistikleri. CURRENT_CCW_01F_NAME=CCW Say1s1 CURRENT_CCW_01F_HELP=Bu sayaç, geçerli Com Çar1labilir Paket (Com-Callable-Wrapper - CCW) say1s1n1 görüntüler. CCW, .NET yönetilen nesnesine yönetilmeyen COM istemcileri taraf1ndan ba_vurulduu durumda kullan1lan proxy'dir. Sayaç, yönetilmeyen COM kodu taraf1ndan ba_vurulan yönetilen nesnelerin say1s1n1 göstermek için tasarlanm1_t1r. CURRENT_STUBS_01F_NAME=Saptama Say1s1 CURRENT_STUBS_01F_HELP=Bu sayaç, CLR taraf1ndan olu_turulan saptama say1s1n1 görüntüler. Saptamalar, bir COM Birlikte Çal1_ma aramas1 veya PInvoke aramas1 s1ras1nda s1ralama ba1ms1z dei_kenleri ve yönetilen koddan yönetilmeyene ve yönetilmeyenden yönetilen koda döndürülen deerlerden sorumludur. NUM_MARSHALLING_01F_NAME=S1ralama Say1s1 NUM_MARSHALLING_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra ba1ms1z dei_kenler ve dönen deerler üzerinde yönetilen koddan yönetilmeyene ve yönetilmeyenden yönetilen koda s1ralama i_lemi uygulanma say1s1n1 görüntüler. Saptamalar s1n1rlar içindeyse, sayaç artmaz. (Saptamalar, s1ralama i_lemi uygulanan ba1ms1z dei_kenler ve dönen deerlerden sorumludur). S1ralama i_lemi uygulama yükü azsa, Saptamalar genellikle s1n1rlar içinde kal1r. TOTAL_TLB_IMPORTS_01F_NAME=TLB almalar1 say1s1 / sn. TOTAL_TLB_IMPORTS_01F_HELP=Daha sonraki kullan1mlar için ayr1lm1_. TOTAL_TLB_EXPORTS_01F_NAME=TLB verme say1s1 / sn. TOTAL_TLB_EXPORTS_01F_HELP=Daha sonraki kullan1mlar için ayr1lm1_. DotNetCLR_LocksAndThreads_OBJECT_01F_NAME=.NET CLR Kilitleri ve 0_ Parçac1klar1 DotNetCLR_LocksAndThreads_OBJECT_01F_HELP=CLR Kilitleri ve 0_ Parçac1klar1 0statistikleri. CONTENTION_TOTAL_01F_NAME=Toplam Çak1_ma Say1s1 CONTENTION_TOTAL_01F_HELP=Bu sayaç, CLR'de yönetilen bir kilide ba_ar1s1z bir eri_im denemesi yapm1_ toplam i_ parçac11 say1s1n1 görüntüler. Yönetilen kilitlere birçok yoldan eri_ilebilir; C# içinde belirtilen "kilit" ifadesi yoluyla, System.Monitor.Enter'1 ça1rarak veya MethodImplOptions.Synchronized özel özniteliini kullanarak. CONTENTION_INST_01F_NAME=Çak1_ma Oran1 / sn. CONTENTION_INST_01F_HELP=Yönetilen bir kilide çal1_ma zaman1nda ba_ar1s1z bir eri_im denemesi yapm1_ i_ parçac1klar1 oran1. Yönetilen kilitlere birçok yoldan eri_ilebilir; C# içinde belirtilen "kilit" ifadesi yoluyla, System.Monitor.Enter'1 ça1rarak veya MethodImplOptions.Synchronized özel özniteliini kullanarak. QUEUE_LENGTH_CUR_01F_NAME=Geçerli S1ra Uzunluu QUEUE_LENGTH_CUR_01F_HELP=Bu sayaç, uygulamada yönetilen baz1 kilitlere eri_meyi bekleyen toplam i_ parçac11 say1s1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, yaln1zca en son gözlenen deerleri görüntüler. QUEUE_LENGTH_TOTAL_01F_NAME=S1ra Uzunluu En Üst Deeri QUEUE_LENGTH_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra yönetilen baz1 kilitlere eri_mek üzere bekletilen toplam i_ parçac11 say1s1n1 görüntüler. QUEUE_LENGTH_INST_01F_NAME=S1ra Uzunluu / sn. QUEUE_LENGTH_INST_01F_HELP=Bu sayaç, uygulamadaki baz1 yerleri kilitlemek için bekleyen saniyede i_lenen i_ parçac11 say1s1n1 görüntüler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. CURRENT_LOGICAL_THREADS_01F_NAME=Geçerli mant1ksal 0_ Parçac1klar1 say1s1 CURRENT_LOGICAL_THREADS_01F_HELP=Bu sayaç, uygulamadaki geçerli .NET i_ parçac11 nesnelerinin say1s1n1 görüntüler. Bir .NET i_ parçac11 nesnesi yeni System.Threading.Thread taraf1ndan olu_turulur ya da yönetilemeyen bir i_ parçac11 yönetilen bir ortama girdiinde olu_ur. Bu sayaçlar, çal1_an ve durdurulan i_ parçac1klar1n1n say1s1n1 saklar. Bu sayaç, bir ortalama süre deerini göstermez, yaln1zca en son gözlenen deerleri görüntüler. CURRENT_PHYSICAL_THREADS_01F_NAME=Geçerli fiziksel 0_ Parçac1klar1 say1s1 CURRENT_PHYSICAL_THREADS_01F_HELP=Bu sayaç, .NET i_ parçac11 nesneleri için alt i_ parçac1klar1 olarak davranmak üzere CLR taraf1ndan olu_turulan ve sahiplenilen kendi 0_letim Sistemi i_ parçac1klar1n1n say1s1n1 görüntüler. Bu sayaç deeri, CLR taraf1ndan iç i_lemlerinde kullan1lan i_ parçac1klar1n1 içermez; bu, 0_letim Sistemi i_leminde kullan1lan i_ parçac1klar1n1n bir alt kümesidir. RECOGNIZED_THREADS_CUR_01F_NAME=Geçerli tan1nan i_ parçac1klar1 say1s1 RECOGNIZED_THREADS_CUR_01F_HELP=Bu sayaç, CLR taraf1ndan geçerli olarak tan1nan i_ parçac11 say1s1n1 görüntüler; bu i_ parçac1klar1n1n ili_kili olduklar1 bir .NET i_ parçac11 nesnesi vard1r. Bu i_ parçac1klar1 CLR taraf1ndan olu_turulmaz, CLR d1_1nda olu_turulur ancak en az bir kere CLR içinde çal1_t1r1l1r. Yaln1zca benzersiz i_ parçac1klar1 izlenir; CLR'ye yeniden giren ya da i_ parçac11ndan sonra olu_turulmu_ ayn1 kimlik numaras1na sahip i_ parçac1klar1 iki kere say1lmaz. RECOGNIZED_THREADS_TOTAL_01F_NAME=Tan1nan i_ parçac1klar1n1n toplam say1s1 / sn. RECOGNIZED_THREADS_TOTAL_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra CLR taraf1ndan tan1nan toplam i_ parçac11 say1s1n1 görüntüler; bu i_ parçac1klar1n1n ili_kili olduklar1 bir .NET i_ parçac11 nesnesi vard1r. Bu i_ parçac1klar1 CLR taraf1ndan olu_turulmaz, CLR d1_1nda olu_turulur ancak en az bir kere CLR içinde çal1_t1r1l1r. Yaln1zca benzersiz i_ parçac1klar1 izlenir; CLR'ye yeniden giren ya da i_ parçac11ndan sonra olu_turulmu_ ayn1 kimlik numaras1na sahip i_ parçac1klar1 iki kere say1lmaz. RECOGNIZED_THREADS_INST_01F_NAME=Tan1nan i_ parçac1klar1 h1z1 / sn. RECOGNIZED_THREADS_INST_01F_HELP=Bu sayaç, CLR taraf1ndan tan1nan saniyede i_lenen i_ parçac11 say1s1n1 görüntüler; bu i_ parçac1klar1n1n ili_kili olduklar1 bir .NET i_ parçac11 nesnesi vard1r. Bu i_ parçac1klar1 CLR taraf1ndan olu_turulmaz, CLR d1_1nda olu_turulur ancak en az bir kere CLR içinde çal1_t1r1l1r. Yaln1zca benzersiz i_ parçac1klar1 izlenir; CLR'ye yeniden giren ya da i_ parçac11ndan sonra olu_turulmu_ ayn1 kimlik numaras1na sahip i_ parçac1klar1 iki kere say1lmaz. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. DotNetCLR_Security_OBJECT_01F_NAME=.NET CLR Güvenlii DotNetCLR_Security_OBJECT_01F_HELP=CLR Güvenlii 0statistikleri. SECURITY_TOTALRTCHECKS_01F_NAME=Toplam Çal1_ma Zaman1 Denetimi Say1s1 SECURITY_TOTALRTCHECKS_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra gerçekle_tirilen toplam çal1_ma zaman1 Kod Eri_im Güvenlii denetimlerinin say1s1n1 görüntüler. Çal1_ma zaman1 CAS denetimleri, özel bir izin gerektiren çar1lan tarafa bir çar1 yap1ld11nda gerçekle_tirilir; Çal1_ma zaman1 denetimi ça1ran taraf1ndan yap1lan her çar1da uygulan1r; denetim ça1ran1n geçerli i_ parças1 y11n1n1 inceleyerek yap1l1r. "Y11n 0lerleme Derinlii" ile birlikte kullan1lan bu sayaç, güvenlik denetimlerindeki performans ba_ar1s1zl1klar1n1n göstergesidir. SECURITY_TIMEAUTHORIZE_01F_NAME=0mza Dorulama Süresi Yüzdesi SECURITY_TIMEAUTHORIZE_01F_HELP=Daha sonraki kullan1mlar için ayr1lm1_. SECURITY_LINKCHECKS_01F_NAME=Balant1 Süresi Denetimi Say1s1 SECURITY_LINKCHECKS_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra toplam balant1 süresi Kod Eri_im Güvenlii (CAS) denetimi say1s1n1 görüntüler. Balant1 süresi CAS denetimleri, JIT derleme süresinde özel bir izin gerektiren çar1lan tarafa bir çar1 yap1ld11nda gerçekle_tirilir; balant1 süresi denetimleri her çar1 yapan için gerçekle_tirilir. Bu sayaç, ciddi performans sorunlar1n1n göstergesi deildir, güvenlik sistemi etkinliini gösterir. SECURITY_TIMERTCHECKS_01F_NAME=RT denetimleri süresi yüzdesi SECURITY_TIMERTCHECKS_01F_HELP=Bu sayaç, en son denetimden sonra çal1_ma zaman1 Kod Eri_im Güvenlii (CAS) denetimleri gerçekle_tirilirken geçen zaman yüzdesini görüntüler. CAS, kodun dei_en derecelere güvenmesini salar ve bu dei_en güvenlik düzeylerinin kod tan1mlar1na ba1ml1 olmas1n1 salar. Bu sayaç, çal1_ma zaman1 güvenlik denetimi sonunda güncelle_tirilir ve en son al1nan deeri temsil eder; ortalama deer deildir. SECURITY_TIMERTCHECKS_BASE_01F_NAME=Görüntülenmiyor SECURITY_TIMERTCHECKS_BASE_01F_HELP=Görüntülenmiyor. SECURITY_DEPTHSECURITY_01F_NAME=Y11n 0lerleme Derinlii SECURITY_DEPTHSECURITY_01F_HELP=Bu sayaç, en son çal1_ma zaman1 Kod Eri_im Güvenlii denetimi s1ras1nda y11n derinliini görüntüler. Çal1_ma Zaman1 Kod Eri_im Güvenlii, y11n1 yava_ yava_ i_leyerek gerçekle_tirilir. Bu sayaç zamana bal1 bir ortalama deildir, örnek aral1k ile bölünen son iki örnekten al1nan deerler aras1ndaki fark1 görüntüler. DotNetCLR_Remoting_OBJECT_01F_NAME=.NET CLR Uzaktan Eri_im DotNetCLR_Remoting_OBJECT_01F_HELP=CLR Uzaktan Yönetim 0statistikleri. CONTEXT_REMOTECALLS_INST_01F_NAME=Uzaktan Çar1lar / sn. CONTEXT_REMOTECALLS_INST_01F_HELP=Bu sayaç, saniyede çar1lan uzak yordam çar1s1 say1s1n1 görüntüler. Uzak yordam çar1s1, ça1ranlar1n Uygulama Etki Alan1 d1_1ndaki nesnelere yapt11 çar1d1r. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. CONTEXT_CHANNELS_01F_NAME=Kanal Say1s1 CONTEXT_CHANNELS_01F_HELP=Bu sayaç, uygulama ba_lat1ld1ktan sonra tüm Uygulama Etki Alanlar1nda kaydedilen uzak kanallar1n toplam say1s1n1 görüntüler. Kanallar, uzak nesnelere ve uzak nesnelerden ileti ta_1mak için kullan1l1r. CONTEXT_PROXIES_01F_NAME=Balam Proxy Say1s1 CONTEXT_PROXIES_01F_HELP=Bu sayaç, i_lem ba_lat1ld1ktan sonra bu i_lemde olu_turulan uzak proxy nesnelerinin say1s1n1 görüntüler. Proxy nesnesi uzak nesnenin temsilcisi gibi davran1r ve proxy'de yap1lan tüm aramalar1n doru uzak nesne kopyas1na iletilip iletilmediini denetler. CONTEXT_CLASSES_01F_NAME=Yüklenen Balamla S1n1rl1 S1n1f Say1s1 CONTEXT_CLASSES_01F_HELP=Bu sayaç yüklenen balamla s1n1rl1 s1n1flar1n geçerli say1s1n1 görüntüler. Balamla s1n1rlanan s1n1flara, balamla s1n1rl1 s1n1f denir ve bu s1n1flar e_itleme, i_ parçac11 benze_mesi, i_lemler gibi kullan1m kurallar1 salayan Balam Öznitelikleri ile i_aretlenir. CONTEXT_OBJALLOC_01F_NAME=Ayr1lm1_ Balamla S1n1rl1 Nesne Say1s1 / sn. CONTEXT_OBJALLOC_01F_HELP=Bu sayaç, saniyede ayr1lan balamla s1n1rl1 nesne say1s1n1 görüntüler. Balamla s1n1rlanabilen s1n1f kopyalar1, balamla s1n1rl1 nesneler olarak adland1r1l1r; balamla s1n1rl1 s1n1flar, e_itleme, i_ parçac11 benze_mesi, i_lemler gibi ayn1 kullan1m kurallar1n1 salayan Balam Öznitelikleri ile i_aretlenir. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. CONTEXT_CONTEXTS_01F_NAME=Balam Say1s1 CONTEXT_CONTEXTS_01F_HELP=Bu sayaç, uygulamadaki uzak balamlar1n geçerli say1s1n1 görüntüler. Balam, e_itleme, i_ parçac11 benze_mesi, i_lemler gibi ayn1 kullan1m kurallar1na sahip bir nesne topluluunu içeren s1n1rd1r. CONTEXT_REMOTECALLS_TOTAL_01F_NAME=Toplam Uzaktan Arama Say1s1 CONTEXT_REMOTECALLS_TOTAL_01F_HELP=Bu sayaç, uygulaman1n ba_lat1lmas1ndan sonra çar1lan toplam uzak yordam çar1s1 say1s1n1 görüntüler. Uzak yordam çar1s1, ça1ranlar1n Uygulama Etki Alan1 d1_1ndaki nesnelere yapt11 çar1d1r. DotNetCLR_Excep_OBJECT_01F_NAME=.NET CLR Özel Durumlar1 DotNetCLR_Excep_OBJECT_01F_HELP=CLR özel durumu i_lemesi ile ilgili çal1_ma zaman1 istatistikleri. EXCEP_THROWN_TOTAL_01F_NAME=Olu_an Özel Durum Say1s1 EXCEP_THROWN_TOTAL_01F_HELP=Bu sayaç, uygulaman1n ba_lat1lmas1ndan sonra olu_an toplam özel durum say1s1n1 görüntüler. Bunlar, .NET özel durumlar1n1 ve .NET özel durumuna dönü_türülen yönetilemeyen özel durumlar1 içerir; örnein, yönetilemeyen kod içindeki bo_ i_aretçi referans1 özel durumu, yönetilen kodda .NET System.NullReferenceException olarak yeniden olu_abilir; bu sayaç yönetilen ve yönetilemeyen özel durumlar1 içerir. Yeniden olu_an özel durumlar da yeniden say1labilir. Özel durumlar yaln1zca baz1 durumlarda olu_mal1 ve program1n normal denetim ak1_1nda yer almamal1d1r. EXCEP_THROWN_INST_01F_NAME=Olu_an Özel Durum Say1s1 / sn EXCEP_THROWN_INST_01F_HELP=Bu sayaç, saniyede olu_an özel durum say1s1n1 görüntüler. Bunlar, .NET özel durumlar1n1 ve .NET özel durumuna dönü_türülen yönetilemeyen özel durumlar1 içerir; örnein, yönetilemeyen kod içindeki bo_ i_aretçi ba_vurusu özel durumu, yönetilen kodda .NET System.NullReferenceException olarak yeniden olu_turulabilir; bu sayaç yönetilen ve yönetilemeyen özel durumlar1 içerir. Özel durumlar yaln1zca baz1 durumlarda olu_mal1 ve program1n normal denetim ak1_1nda yer almamal1d1r; bu sayaç, olu_an özel durum oran1n1n geni_ olmas1 (>100) nedeniyle bir olas1 performans sorunlar1 göstergesi olarak tasarlanm1_t1r. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. TOTAL_EXCEP_FILTERS_RUN_01F_NAME=Süzgeç Say1s1 / sn. TOTAL_EXCEP_FILTERS_RUN_01F_HELP=Bu sayaç saniyede yürütülen .NET özel durum filtrelerinin say1s1n1 görüntüler. Özel durum filtresi, özel durumun i_lenmesi gerekip gerekmediini belirler. Bu sayaç belirlenen özel durum filtresi oran1n1 (özel durumun i_lenip i_lenmediini dikkate almaz) izler. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. TOTAL_EXCEP_FINALLYS_RUN_01F_NAME=Son Blok Say1s1 / sn. TOTAL_EXCEP_FINALLYS_RUN_01F_HELP=Bu sayaç, saniyede yürütülen son bloklar1n say1s1n1 görüntüler. Son blok, deneme bloklar1ndan nas1l ç1k1ld11 göz önünde bulundurulmadan mutlaka yürütülür. Yaln1zca özel bir durum için yürütülen son bloklar say1l1r; normal kod yollar1ndaki son bloklar bu sayaç taraf1ndan say1lmaz. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. EXCEPT_STACK_DEPTH_01F_NAME=Yakalamak Derinlii Olu_turma Say1s1 / sn. EXCEPT_STACK_DEPTH_01F_HELP=Bu sayaç, .NET özel durumunu olu_turan çerçeveden saniyede özel durumu yöneten çerçeveye geçi_ salayan y11n çerçeveleri say1s1n1 görüntüler. Özel durum i_leyicisi girildiinde, bu sayaca 0 deeri atan1r; böylece iç içe geçen özel durumlar i_leyici y11n1 derinliine, i_leyiciyi gösterir. Bu sayaç, bir ortalama süre deerini göstermez, son iki örnekte gözlenen deerler aras1ndaki fark1n örnek aral11n1n süresine bölümü sonucu bulunan deeri görüntüler. ding-libs-0.6.2/ini/ini.d/test.conf000066400000000000000000000013751417260640400170070ustar00rootroot00000000000000 data = ds,mf.ds,mf.ds,m.ds,mds.,fmds. dskjh = mdsmdssm ,md.sd, C1 = "abcd" ;test data ;more data = "nmjdsbfmsdn" s = "nmjdsbfmsdn HEX1 = 'ABV1' HEX2 = 'ABV' [ ttt ] C2 ='AbBB' int=-44i44 int2=-66U c = [ dddd1 ] DC1 = 123U f=-9.0.0 DC2 = -235L DC3 = -345.8907 [ ttt2 ] v=55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555 v1=55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555.55555555555555555555555555555555 C3 = -34756.56 C4 = .9 LN = Line 1: 1234567890 Line 2: 1234567890 Line 3: 1234567890 ding-libs-0.6.2/ini/ini2.d/000077500000000000000000000000001417260640400152355ustar00rootroot00000000000000ding-libs-0.6.2/ini/ini2.d/real16be.conf000066400000000000000000000045621417260640400175140ustar00rootroot00000000000000þÿ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini2.d/real16le.conf000066400000000000000000000045621417260640400175260ustar00rootroot00000000000000ÿþ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini2.d/real32be.conf000066400000000000000000000113441417260640400175060ustar00rootroot00000000000000þÿ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini2.d/real32le.conf000066400000000000000000000113441417260640400175200ustar00rootroot00000000000000ÿþ// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini2.d/real8.conf000066400000000000000000000022731417260640400171230ustar00rootroot00000000000000// This is a real file with some comments [config] version = 0.1 /**/ [monitor] description = Monitor Configuration sbusTimeout = 10 sbusAddress = unix:path=/var/lib/sss/pipes/private/dbus servicePingTime = 10 bad_number = 5a /* Service section defines * which service are allowed. */ [services] description = Local service configuration activeServices = dp, nss, pam, info [services/dp] description = Data Provider Configuration command = /usr/libexec/sssd/sssd_dp [services/nss] description = NSS Responder Configuration unixSocket = /var/lib/sss/pipes/nss command = /usr/libexec/sssd/sssd_nss [services/pam] command = /usr/libexec/sssd/sssd_pam description = PAM Responder Configuration unixSocket = /var/lib/sss/pipes/pam [services/info] description = InfoPipe Configuration command = ./sbin/sssd_info [domains/LOCAL] description = Reserved domain for local configurations legacy = FALSE enumerate = 3 [domains/EXAMPLE.COM] description = Example domain served by IPA provider = ipa server = otheripabackupserver.example.com enumerate = 0 binary_test = '010203' binary_test_two = '0A0b0C' int32_t = -1000000000 uint32_t = 3000000000 int64_t = -1000000000123 uint64_t = 3000000000123 ding-libs-0.6.2/ini/ini_augment.c000066400000000000000000000713751417260640400166320ustar00rootroot00000000000000/* INI LIBRARY Module represents part of the INI interface. The main function in this module allows to merge snippets of different config files. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "ini_defines.h" #include "path_utils.h" /* Constants to match */ #define INI_CURRENT_DIR "." #define INI_PARENT_DIR ".." /* Size of incremental growth for ref of the array of strings */ #define INI_AUG_ARR_SIZE_INC 50 /* Function to add an error to the array */ static void ini_aug_add_string(struct ref_array *ra, const char *format, ...) { va_list args; char *result = NULL; TRACE_FLOW_ENTRY(); va_start(args, format); if(vasprintf(&result, format, args )) { TRACE_INFO_STRING("String:", result); /* This is a best effort assignment. error is not checked */ (void)ref_array_append(ra, (void *)&result); } va_end(args); TRACE_FLOW_EXIT(); } /* Add error about opening directory */ static void add_dir_open_error(int error, char *dirname, struct ref_array *ra_err) { TRACE_FLOW_ENTRY(); switch(error) { case EACCES: ini_aug_add_string(ra_err, "Permission denied opening %s.", dirname); break; case EMFILE: case ENFILE: ini_aug_add_string(ra_err, "Too many file descriptors in use while opening %s.", dirname); break; case ENOENT: ini_aug_add_string(ra_err, "Directory %s does not exist.", dirname); break; case ENOTDIR: ini_aug_add_string(ra_err, "Path %s is not a directory.", dirname); break; case ENOMEM: ini_aug_add_string(ra_err, "Insufficient memory while opening %s.", dirname); break; default: ini_aug_add_string(ra_err, "Unknown error while opening %s.", dirname); break; } TRACE_FLOW_EXIT(); } /* Cleanup callback for regex array */ static void regex_cleanup(void *elem, ref_array_del_enum type, void *data) { TRACE_FLOW_ENTRY(); regfree(*((regex_t **)elem)); free(*((regex_t **)elem)); TRACE_FLOW_EXIT(); } /* Prepare array of regular expressions */ static int ini_aug_regex_prepare(const char *patterns[], struct ref_array *ra_err, struct ref_array **ra_regex) { int error = EOK; int reg_err = 0; char const *pat = NULL; struct ref_array *ra = NULL; regex_t *preg = NULL; size_t buf_size = 0; char *err_str = NULL; size_t i; TRACE_FLOW_ENTRY(); if (patterns) { /* Create array to mark bad patterns */ error = ref_array_create(&ra, sizeof(regex_t *), INI_AUG_ARR_SIZE_INC, regex_cleanup, NULL); if (error) { TRACE_ERROR_NUMBER("Failed to create array.", error); return error; } /* Run through the list and save precompiled patterns */ for (i = 0; patterns[i] != NULL; i++) { pat = patterns[i]; TRACE_INFO_STRING("Pattern:", pat); preg = calloc(1, sizeof(regex_t)); if (preg == NULL) { TRACE_ERROR_NUMBER("Failed to create array.", ENOMEM); ref_array_destroy(ra); return ENOMEM; } reg_err = regcomp(preg, pat, REG_NOSUB); if (reg_err) { /* Get size, allocate buffer, record error... */ buf_size = regerror(reg_err, preg, NULL, 0); err_str = malloc (buf_size); if (err_str == NULL) { TRACE_ERROR_NUMBER("Failed to create array.", ENOMEM); ref_array_destroy(ra); free(preg); return ENOMEM; } regerror(reg_err, preg, err_str, buf_size); free(preg); ini_aug_add_string(ra_err, "Failed to process expression: %s." " Compilation returned error: %s", pat, err_str); free(err_str); /* All error processing is done - advance to next pattern */ pat++; continue; } /* In case of no error add compiled expression into the buffer */ error = ref_array_append(ra, (void *)&preg); if (error) { TRACE_ERROR_NUMBER("Failed to add element to array.", error); ref_array_destroy(ra); free(preg); return error; } } } *ra_regex = ra; /* ref_array_debug(*ra_regex, 1); */ TRACE_FLOW_EXIT(); return EOK; } /* Match file name */ static bool ini_aug_match_name(char *name, struct ref_array *ra_regex) { uint32_t len = 0; uint32_t i = 0; bool match = false; regex_t *preg = NULL; TRACE_FLOW_ENTRY(); len = ref_array_len(ra_regex); if (len == 0) { /* List is empty - nothing to do */ TRACE_FLOW_EXIT(); return true; } TRACE_INFO_STRING("Name to match:", name); TRACE_INFO_NUMBER("Number of regexes:", len); /* ref_array_debug(ra_regex, 1);*/ for (i = 0; i < len; i++) { preg = *((regex_t **)ref_array_get(ra_regex, i, NULL)); if (preg == NULL) continue; if (regexec(preg, name, 0, NULL, 0) == 0) { TRACE_INFO_NUMBER("Name matched regex number:", i); match = true; break; } } TRACE_FLOW_EXIT(); return match; } /* Check if this is a file and validate permission */ static bool ini_check_file_perm(char *name, struct access_check *check_perm, struct ref_array *ra_err) { bool ret = false; int error = EOK; struct stat file_info; TRACE_FLOW_ENTRY(); errno = 0; if (stat(name, &file_info) == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to get file stats", error); ini_aug_add_string(ra_err, "Failed to read metadata for file %s." " Skipping.", name); return false; } if (!S_ISREG(file_info.st_mode)) { ini_aug_add_string(ra_err, "File %s is not a regular file. Skipping.", name); return false; } if ((check_perm) && (check_perm->flags)) { error = access_check_int(&file_info, check_perm->flags, check_perm->uid, check_perm->gid, check_perm->mode, check_perm->mask); if(error) { TRACE_ERROR_NUMBER("Access check returned", error); ini_aug_add_string(ra_err, "File %s did not pass access check. Skipping.", name); return false; } } ret = true; TRACE_FLOW_EXIT(); return ret; } /* Sort array */ static void ini_aug_sort_list(struct ref_array *ra_list) { unsigned len = 0, j = 0, k = 0; char **item1 = NULL; char **item2 = NULL; TRACE_FLOW_ENTRY(); len = ref_array_len(ra_list); if (len == 0) return; /* If have trace output array before sorting */ /* #ifdef HAVE_TRACE for (i = 0; i < len; i++) { TRACE_INFO_STRING("Before:", *((char **) ref_array_get(ra_list, i, NULL))); } #endif */ for (k = 0; k < len-1; k++) { j = k + 1; while (j > 0) { item1 = (char **) ref_array_get(ra_list, j - 1, NULL); item2 = (char **) ref_array_get(ra_list, j, NULL); /* Swap items if they are not NULL and string comparison * indicates that they need to be swapped or if the first * one is NULL but second is not. That would push * NULL elements of the array to the end of the array. */ if (((item1 && item2) && (strcoll(*item1,*item2)) > 0) || (!item1 && item2)) { ref_array_swap(ra_list, j - 1, j); } j--; } } /* And after sorting */ /* #ifdef HAVE_TRACE for (i = 0; i < len; i++) { TRACE_INFO_STRING("After:", *((char **) ref_array_get(ra_list, i, NULL))); } #endif */ TRACE_FLOW_EXIT(); } /* Construct snippet lists based on the directory */ static int ini_aug_construct_list(char *dirname , const char *patterns[], struct access_check *check_perm, struct ref_array *ra_list, struct ref_array *ra_err) { int error = EOK; DIR *dir = NULL; struct dirent *entryp = NULL; char *snipname = NULL; char fullname[PATH_MAX + 1] = {0}; struct ref_array *ra_regex = NULL; bool match = false; TRACE_FLOW_ENTRY(); /* Prepare patterns */ error = ini_aug_regex_prepare(patterns, ra_err, &ra_regex); if (error) { TRACE_ERROR_NUMBER("Failed to prepare regex array.", error); return error; } /* Open directory */ errno = 0; dir = opendir(dirname); if (!dir) { error = errno; if (error == ENOMEM) { TRACE_ERROR_NUMBER("No memory to open dir.", ENOMEM); ref_array_destroy(ra_regex); return ENOMEM; } /* Log an error, it is a recoverable error */ add_dir_open_error(error, dirname, ra_err); ref_array_destroy(ra_regex); return EOK; } /* Loop through the directory */ while (true) { errno = 0; entryp = readdir(dir); if (entryp == NULL && errno != 0) { error = errno; TRACE_ERROR_NUMBER("Failed to read directory.", error); ref_array_destroy(ra_regex); closedir(dir); return error; } /* Stop looping if we reached the end */ if (entryp == NULL) break; TRACE_INFO_STRING("Processing", entryp->d_name); /* Always skip current and parent dirs */ if ((strncmp(entryp->d_name, INI_CURRENT_DIR, sizeof(INI_CURRENT_DIR)) == 0) || (strncmp(entryp->d_name, INI_PARENT_DIR, sizeof(INI_PARENT_DIR)) == 0)) continue; error = path_concat(fullname, PATH_MAX, dirname, entryp->d_name); if (error != EOK) { TRACE_ERROR_NUMBER("path_concat failed.", error); ref_array_destroy(ra_regex); closedir(dir); return error; } /* Match names */ match = ini_aug_match_name(entryp->d_name, ra_regex); if (match) { if(ini_check_file_perm(fullname, check_perm, ra_err)) { /* Dup name and add to the array */ snipname = NULL; snipname = strdup(fullname); if (snipname == NULL) { TRACE_ERROR_NUMBER("Failed to dup string.", ENOMEM); ref_array_destroy(ra_regex); closedir(dir); return ENOMEM; } error = ref_array_append(ra_list, (void *)&snipname); if (error) { TRACE_ERROR_NUMBER("No memory to add file to " "the snippet list.", ENOMEM); ref_array_destroy(ra_regex); closedir(dir); return ENOMEM; } } } else { TRACE_INFO_STRING("File did not match provided patterns." " Skipping:", fullname); } } closedir(dir); ref_array_destroy(ra_regex); ini_aug_sort_list(ra_list); TRACE_FLOW_EXIT(); return EOK; } /* Construct the full dir path */ static int ini_aug_expand_path(const char *path, char **fullname) { int error = EOK; char *dirname = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Input path", path); dirname = malloc(PATH_MAX + 1); if (!dirname) { TRACE_ERROR_NUMBER("Failed to allocate memory for file path.", ENOMEM); return ENOMEM; } /* Make the path */ error = make_normalized_absolute_path(dirname, PATH_MAX, path); if (error) { TRACE_ERROR_NUMBER("Failed to resolve path", error); free(dirname); /* This is a recoverable error */ *fullname = NULL; } else *fullname = dirname; TRACE_INFO_STRING("Output path", *fullname); TRACE_FLOW_EXIT(); return EOK; } /* Prepare the lists of the files that need to be merged */ static int ini_aug_preprare(const char *path, const char *patterns[], struct access_check *check_perm, struct ref_array *ra_list, struct ref_array *ra_err) { int error = EOK; char *dirname = NULL; TRACE_FLOW_ENTRY(); /* Contruct path */ error = ini_aug_expand_path(path, &dirname); if (error) { TRACE_ERROR_NUMBER("Failed to allocate memory for dir path.", error); return error; } /* Was it a good path? */ if (!dirname) { TRACE_ERROR_NUMBER("Failed to resolve path", error); ini_aug_add_string(ra_err, "Could not resolve directory path %s.", path); /* Path might not exist so it is a recoverable error */ return EOK; } /* Construct snipet lists */ error = ini_aug_construct_list(dirname, patterns, check_perm, ra_list, ra_err); free(dirname); TRACE_FLOW_EXIT(); return error; } /* Cleanup callback for string arrays */ static void array_cleanup(void *elem, ref_array_del_enum type, void *data) { TRACE_FLOW_ENTRY(); free(*((char **)elem)); TRACE_FLOW_EXIT(); } /* Check that sections are in the given list */ static int ini_aug_match_sec(struct ini_cfgobj *snip_cfg, struct ref_array *ra_regex, struct ref_array *ra_err, char *snip_name, bool *skip) { int error = EOK; char **section_list = NULL; char **section_iter = NULL; int size = 0; bool match = false; int match_count = 0; int section_count = 0; TRACE_FLOW_ENTRY(); section_list = ini_get_section_list(snip_cfg, &size, &error); if (error) { TRACE_ERROR_NUMBER("Failed create section list", error); return error; } if (section_list == NULL) { /* No sections in the file */ ini_aug_add_string(ra_err, "No sections found in file %s. Skipping.", snip_name); *skip = true; TRACE_FLOW_EXIT(); return EOK; } section_iter = section_list; while (*section_iter) { match = ini_aug_match_name(*section_iter, ra_regex); if (match) { match_count++; TRACE_INFO_STRING("Matched section", *section_iter); } else { TRACE_INFO_STRING("Section not matched", *section_iter); ini_aug_add_string(ra_err, "Section [%s] found in file %s is" " not allowed.", *section_iter, snip_name); } section_count++; section_iter++; } ini_free_section_list(section_list); /* Just in case check that we processed anything */ if (section_count == 0) { TRACE_INFO_STRING("No sections found in file. Skipping:", snip_name); *skip = true; TRACE_FLOW_EXIT(); return EOK; } /* Were all sections matched? */ if (section_count != match_count) { /* Snippet containes sections that are not allowed */ ini_aug_add_string(ra_err, "File %s contains sections that" " are not allowed. Skipping.", snip_name); *skip = true; TRACE_FLOW_EXIT(); return EOK; } /* Everything matched OK so we give green light to merge */ TRACE_INFO_STRING("File will be included", snip_name); *skip = false; TRACE_FLOW_EXIT(); return EOK; } /* Apply snippets */ static int ini_aug_apply(struct ini_cfgobj *cfg, struct ref_array *ra_list, const char *sections[], int error_level, uint32_t collision_flags, uint32_t parse_flags, uint32_t merge_flags, struct ref_array *ra_err, struct ref_array *ra_ok, struct ini_cfgobj **out_cfg) { int error = EOK; uint32_t len = 0; uint32_t i = 0; uint32_t j = 0; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgobj *snip_cfg = NULL; struct ini_cfgobj *res_cfg = NULL; struct ini_cfgobj *tmp_cfg = NULL; char **error_list = NULL; unsigned cnt = 0; bool skip = false; struct ref_array *ra_regex = NULL; char *snip_name = NULL; char **snip_name_ptr = NULL; TRACE_FLOW_ENTRY(); error = ini_config_copy(cfg, &res_cfg); if (error) { TRACE_ERROR_NUMBER("Failed to copy config object", error); *out_cfg = NULL; return error; } len = ref_array_len(ra_list); if (len == 0) { /* List is empty - nothing to do */ *out_cfg = res_cfg; TRACE_FLOW_EXIT(); return EOK; } /* Prepare patterns */ error = ini_aug_regex_prepare(sections, ra_err, &ra_regex); if (error) { TRACE_ERROR_NUMBER("Failed to prepare regex array.", error); *out_cfg = res_cfg; return error; } /* Loop through the snippets */ for (i = 0; i < len; i++) { /* Prepare config object */ error = ini_config_create(&snip_cfg); if (error) { TRACE_ERROR_NUMBER("Failed to create config object", error); goto err; } /* Process snippet */ snip_name_ptr = (char **)ref_array_get (ra_list, i, NULL); if (snip_name_ptr == NULL) continue; snip_name = *snip_name_ptr; if (snip_name == NULL) continue; TRACE_INFO_STRING("Processing", snip_name); /* Open file */ error = ini_config_file_open(snip_name, INI_META_NONE, &file_ctx); if (error) { TRACE_ERROR_NUMBER("Failed to open snippet.", error); ini_aug_add_string(ra_err, "Failed to open file %s.", snip_name); ini_config_destroy(snip_cfg); /* We can recover so go on */ continue; } TRACE_INFO_NUMBER("Error level:", error_level); TRACE_INFO_NUMBER("Collision flags:", collision_flags); TRACE_INFO_NUMBER("Parse level:", parse_flags); /* Read config */ error = ini_config_parse(file_ctx, error_level, collision_flags, parse_flags, snip_cfg); ini_config_file_destroy(file_ctx); file_ctx = NULL; if (error) { TRACE_ERROR_NUMBER("Failed to parse configuration.", error); cnt = ini_config_error_count(snip_cfg); if (cnt) { ini_aug_add_string(ra_err, "Errors detected while parsing: %s.", snip_name); /* Extract errors */ error = ini_config_get_errors(snip_cfg, &error_list); if (error) { TRACE_ERROR_NUMBER("Can't get errors.", error); ini_config_destroy(snip_cfg); goto err; } /* Copy errors into error array */ for (j=0; j< cnt; j++) { ini_aug_add_string(ra_err, error_list[j]); } ini_config_free_errors(error_list); } /* The snippet was malformed, this is OK, go on */ if (error_level != INI_STOP_ON_NONE) { ini_aug_add_string(ra_err, "Due to errors file %s is not considered." " Skipping.", snip_name); ini_config_destroy(snip_cfg); continue; } /* If we are told to not stop try to process anyway */ } /* Validate that file contains only allowed sections */ if (sections) { /* Use a safe default, function should update it anyways * but it is better to not merge than to allow bad snippet */ skip = true; error = ini_aug_match_sec(snip_cfg, ra_regex, ra_err, snip_name, &skip); if (error) { TRACE_ERROR_NUMBER("Failed to validate section.", error); ini_config_destroy(snip_cfg); goto err; } } /* Merge */ if (!skip) { /* col_debug_collection(res_cfg->cfg, COL_TRAVERSE_DEFAULT); */ error = ini_config_merge(res_cfg, snip_cfg, merge_flags, &tmp_cfg); if (error) { if (error == ENOMEM) { TRACE_ERROR_NUMBER("Merge failed.", error); ini_config_destroy(snip_cfg); goto err; } else if ((error == EEXIST) && ((ini_flags_have(INI_MS_DETECT, merge_flags) && ((merge_flags & INI_MV2S_MASK) != INI_MV2S_ERROR)) || ((!ini_flags_have(INI_MS_ERROR, merge_flags)) && ((merge_flags & INI_MV2S_MASK) == INI_MV2S_DETECT)))) { TRACE_ERROR_NUMBER("Got error in detect mode", error); /* Fall through! */ ini_aug_add_string(ra_err, "Duplicate section detected " "in snippet: %s.", snip_name); } else { ini_aug_add_string(ra_err, "Errors during merge." " Snippet ignored %s.", snip_name); /* The snippet failed to merge, this is OK, go on */ TRACE_INFO_NUMBER("Merge failure.Continue. Error", error); ini_config_destroy(snip_cfg); continue; } } TRACE_INFO_STRING("Merged file.", snip_name); /* col_debug_collection(tmp_cfg->cfg, COL_TRAVERSE_DEFAULT); */ ini_config_destroy(res_cfg); res_cfg = tmp_cfg; /* Record that snippet was successfully merged */ ini_aug_add_string(ra_ok, "%s", snip_name); } /* Cleanup */ ini_config_destroy(snip_cfg); } ref_array_destroy(ra_regex); *out_cfg = res_cfg; TRACE_FLOW_EXIT(); return error; err: ini_config_destroy(res_cfg); ref_array_destroy(ra_regex); if (ini_config_copy(cfg, &res_cfg)) { TRACE_ERROR_NUMBER("Failed to copy config object", error); *out_cfg = NULL; return error; } *out_cfg = res_cfg; return error; } /* Function to merge additional snippets of the config file * from a provided directory. */ int ini_config_augment(struct ini_cfgobj *base_cfg, const char *path, const char *patterns[], const char *sections[], struct access_check *check_perm, int error_level, uint32_t collision_flags, uint32_t parse_flags, uint32_t merge_flags, struct ini_cfgobj **result_cfg, struct ref_array **error_list, struct ref_array **success_list) { int error = EOK; /* The internal list that will hold snippet file names */ struct ref_array *ra_list = NULL; /* List of error strings that will be returned to the caller */ struct ref_array *ra_err = NULL; /* List of files that were merged */ struct ref_array *ra_ok = NULL; /* Check arguments */ if (base_cfg == NULL) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } if (result_cfg == NULL) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Create arrays for lists */ if ((ref_array_create(&ra_list, sizeof(char *), INI_AUG_ARR_SIZE_INC, array_cleanup, NULL) != 0) || (ref_array_create(&ra_err, sizeof(char *), INI_AUG_ARR_SIZE_INC * 5, array_cleanup, NULL) != 0) || (ref_array_create(&ra_ok, sizeof(char *), INI_AUG_ARR_SIZE_INC * 5, array_cleanup, NULL) != 0)) { TRACE_ERROR_NUMBER("Failed to allocate memory for arrays.", ENOMEM); ref_array_destroy(ra_list); ref_array_destroy(ra_err); ref_array_destroy(ra_ok); return ENOMEM; } /* Construct snipet lists */ error = ini_aug_preprare(path, patterns, check_perm, ra_list, ra_err); if (error) { TRACE_ERROR_NUMBER("Failed to prepare lists of snippets.", error); ref_array_destroy(ra_list); ref_array_destroy(ra_err); ref_array_destroy(ra_ok); return error; } /* Apply snippets */ error = ini_aug_apply(base_cfg, ra_list, sections, error_level, collision_flags, parse_flags, merge_flags, ra_err, ra_ok, result_cfg); /* Cleanup */ ref_array_destroy(ra_list); if (error_list) { *error_list = ra_err; } else { ref_array_destroy(ra_err); } if (success_list) { *success_list = ra_ok; } else { ref_array_destroy(ra_ok); } TRACE_FLOW_EXIT(); return error; } ding-libs-0.6.2/ini/ini_augment_ut.c000066400000000000000000000252031417260640400173270ustar00rootroot00000000000000/* INI LIBRARY Unit test for the comment object. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "collection_tools.h" #include "path_utils.h" int verbose = 0; #define INIOUT(foo) \ do { \ if (verbose) { printf("%30s(%4d): ",__FUNCTION__,__LINE__); foo; } \ } while(0) typedef int (*test_fn)(void); void print_list(struct ref_array *list); int print_list_to_file(struct ref_array *list, const char *filename, const char *mode); static int expand_path(const char *path, char **fullname); /* Construct the full dir path */ static int expand_path(const char *path, char **fullname) { int error = EOK; char *dirname = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Input path", path); dirname = malloc(PATH_MAX + 1); if (!dirname) { INIOUT(printf("Failed to allocate memory for file path.")); return ENOMEM; } /* Make the path */ error = make_normalized_absolute_path(dirname, PATH_MAX, path); if (error) { INIOUT(printf("Failed to resolve path %d\n", error)); free(dirname); return error; } else *fullname = dirname; TRACE_INFO_STRING("Output path", *fullname); TRACE_FLOW_EXIT(); return EOK; } static int prepare_results(const char *srcdir, const char *srcfile, const char *destfile) { int error = EOK; char *exp_src= NULL; FILE *fsrc = NULL; FILE *fout = NULL; char *line = NULL; size_t len = 0; ssize_t rd; TRACE_FLOW_ENTRY(); error = expand_path(srcdir, &exp_src); if (error) { INIOUT(printf("Expand path returned error %d\n", error)); return error; } INIOUT(printf("Source file: %s\n", srcfile)); INIOUT(printf("Output file: %s\n", destfile)); fsrc = fopen(srcfile, "r"); if (!fsrc) { error = errno; free(exp_src); INIOUT(printf("Failed to open source file %d\n", error)); return error; } fout = fopen(destfile, "w"); if (!fsrc) { error = errno; fclose(fsrc); free(exp_src); INIOUT(printf("Failed to open output file %d\n", error)); return error; } INIOUT(printf("Path %s\n", exp_src)); while ((rd = getline(&line, &len, fsrc)) != -1) { if (strchr(line, '%')) fprintf(fout, line, exp_src, "/ini/ini.d"); else fprintf(fout, "%s", line); } if (line) free(line); fclose(fsrc); fclose(fout); free(exp_src); TRACE_FLOW_EXIT(); return EOK; } /* Function to print contents of the list */ void print_list(struct ref_array *list) { uint32_t i = 0; char *ret = NULL; void *ptr = NULL; for (;;) { ptr = ref_array_get(list, i, &ret); if (ptr) { INIOUT(printf("%s\n", ret)); i++; } else break; } } /* Function to print contents of the list */ int print_list_to_file(struct ref_array *list, const char *filename, const char *mode) { uint32_t i = 0; char *ret = NULL; void *ptr = NULL; FILE *file = NULL; file = fopen(filename, mode); if (file) { for (;;) { ptr = ref_array_get(list, i, &ret); if (ptr) { fprintf(file,"%s\n", ret); i++; } else break; } } else { printf("Failed to open file for results\n"); return -1; } fclose(file); return 0; } /* Basic test */ static int basic_test(void) { int error = EOK; char indir[PATH_MAX]; char srcname[PATH_MAX]; char filename[PATH_MAX]; char resname[PATH_MAX]; char command[PATH_MAX * 3]; char *builddir = NULL; char *srcdir = NULL; struct ini_cfgobj *in_cfg = NULL; struct ini_cfgobj *result_cfg = NULL; struct ref_array *error_list = NULL; struct ref_array *success_list = NULL; struct access_check ac = { INI_ACCESS_CHECK_MODE, 0, 0, 0444, 0444 }; /* Match all that do not start with 'r' * and end with '.conf' and then match all * ending with '.conf' */ const char *patterns[] = { "#", "^[^r][a-z]*\\.conf$", "^real\\.conf$", NULL }; /* Match only the config, monitor, domains, services, and provider * sections */ const char *sections[] = { "config", "monitor", "domains", "services", "provider", NULL }; INIOUT(printf("<==== Start ====>\n")); srcdir = getenv("srcdir"); builddir = getenv("builddir"); snprintf(indir, PATH_MAX, "%s/ini/ini.d", (srcdir == NULL) ? "." : srcdir); /* When run in dev environment there can be some temp files which * we need to clean. */ snprintf(command, PATH_MAX * 3, "rm %s/*~ > /dev/null 2>&1", indir); (void)system(command); /* Make the file path independent */ snprintf(srcname, PATH_MAX, "%s/ini/ini.d/merge.validator", (srcdir == NULL) ? "." : srcdir); snprintf(filename, PATH_MAX, "%s/merge.validator.in", (builddir == NULL) ? "." : builddir); snprintf(resname, PATH_MAX, "%s/merge.validator.out", (builddir == NULL) ? "." : builddir); /* Prepare results file so that we can compare results */ error = prepare_results(srcdir, srcname, filename); if (error) { INIOUT(printf("Failed to results file. Error %d.\n", error)); return error; } /* Create config collection */ error = ini_config_create(&in_cfg); if (error) { INIOUT(printf("Failed to create collection. Error %d.\n", error)); return error; } error = ini_config_augment(in_cfg, indir, patterns, sections, &ac, INI_STOP_ON_NONE, INI_MV1S_DETECT|INI_MV2S_DETECT|INI_MS_DETECT, INI_PARSE_NOSPACE|INI_PARSE_NOTAB, INI_MV2S_DETECT|INI_MS_DETECT, &result_cfg, &error_list, &success_list); if (error) { INIOUT(printf("Augmentation failed with error %d!\n", error)); } print_list(error_list); print_list(success_list); if (!result_cfg) { error = -1; printf("Configuration is empty.\n"); } else INIOUT(col_debug_collection(result_cfg->cfg, COL_TRAVERSE_DEFAULT)); /* Print results to file */ if ((print_list_to_file(error_list, resname, "w")) || (print_list_to_file(success_list, resname, "a"))) { printf("Failed to save results in %s.\n", resname); ref_array_destroy(error_list); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); return -1; } /* NOTE: The order of the scanning of the files in the ini.d directory * is not predicatble so before comparing the results we have to sort * them since otherwise the projected output and real output might * not match. */ snprintf(command, PATH_MAX * 3, "sort %s > %s2", filename, filename); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run first sort command %d %d.\n", error, WEXITSTATUS(error)); ref_array_destroy(error_list); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); return -1; } snprintf(command, PATH_MAX * 3, "sort %s > %s2", resname, resname); error = system(command); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run second sort command %d %d.\n", error, WEXITSTATUS(error)); ref_array_destroy(error_list); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); return -1; } snprintf(command, PATH_MAX * 3, "diff -q %s2 %s2", filename, resname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", filename, resname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run diff command %d %d.\n", error, WEXITSTATUS(error)); ref_array_destroy(error_list); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); return -1; } /* Cleanup */ ref_array_destroy(error_list); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); INIOUT(printf("<==== End ====>\n")); return error; } int main(int argc, char *argv[]) { int error = EOK; test_fn tests[] = { basic_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } INIOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed with error %d!\n", error); return error; } } INIOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_augment_ut_check.c000066400000000000000000000261761417260640400204760ustar00rootroot00000000000000/* INI LIBRARY Check based unit test for ini_config_augment. Copyright (C) Alexander Scheel 2017 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" static int write_to_file(char *path, char *text) { FILE *f = fopen(path, "w"); int bytes = 0; if (f == NULL) return 1; bytes = fprintf(f, "%s", text); if (bytes != strlen(text)) { return 1; } return fclose(f); } static int exists_array(const char *needle, char **haystack, uint32_t count) { uint32_t i = 0; for (i = 0; i < count; i++) { fprintf(stderr, "%s == %s?\n", needle, haystack[i]); if (strcmp(needle, haystack[i]) == 0) { return 1; } } return 0; } START_TEST(test_ini_augment_merge_sections) { char base_path[PATH_MAX]; char augment_path[PATH_MAX]; char config_base[] = "[section]\n" "key1 = first\n" "key2 = exists\n"; char config_augment[] = "[section]\n" "key1 = augment\n" "key3 = exists\n"; const char *builddir; uint32_t flags[3] = { INI_MS_DETECT , INI_MS_DETECT | INI_MS_PRESERVE, INI_MS_DETECT | INI_MS_OVERWRITE }; int expected_attributes_counts[3] = { 3, 2, 2 }; const char *test_sections[3] = { "section", "section", "section" }; const char *test_attributes[3] = { "key3", "key1", "key1" }; const char *test_attribute_values[3] = {"exists", "first", "augment" }; int ret; int iter; builddir = getenv("builddir"); if (builddir == NULL) { builddir = "."; } snprintf(base_path, PATH_MAX, "%s/tmp_augment_base.conf", builddir); snprintf(augment_path, PATH_MAX, "%s/tmp_augment_augment.conf", builddir); ret = write_to_file(base_path, config_base); fail_unless(ret == 0, "Failed to write %s: ret %d.\n", base_path, ret); write_to_file(augment_path, config_augment); fail_unless(ret == 0, "Failed to write %s: ret %d.\n", augment_path, ret); for (iter = 0; iter < 3; iter++) { uint32_t merge_flags = flags[iter]; int expected_attributes_count = expected_attributes_counts[iter]; const char *test_section = test_sections[iter]; const char *test_attribute = test_attributes[iter]; const char *test_attribute_value = test_attribute_values[iter]; struct ini_cfgobj *in_cfg; struct ini_cfgobj *result_cfg; struct ini_cfgfile *file_ctx; struct ref_array *error_list; struct ref_array *success_list; char **sections; int sections_count; char **attributes; int attributes_count; struct value_obj *val; char *val_str; /* Match only augment.conf */ const char *m_patterns[] = { "^tmp_augment_augment.conf$", NULL }; /* Match all sections */ const char *m_sections[] = { ".*", NULL }; /* Create config collection */ ret = ini_config_create(&in_cfg); fail_unless(ret == EOK, "Failed to create collection. Error %d\n", ret); /* Open base.conf */ ret = ini_config_file_open(base_path, 0, &file_ctx); fail_unless(ret == EOK, "Failed to open file. Error %d\n", ret); /* Seed in_cfg with base.conf */ ret = ini_config_parse(file_ctx, 1, 0, 0, in_cfg); fail_unless(ret == EOK, "Failed to parse file context. Error %d\n", ret); /* Update base.conf with augment.conf */ ret = ini_config_augment(in_cfg, builddir, m_patterns, m_sections, NULL, INI_STOP_ON_NONE, 0, INI_PARSE_NOSPACE|INI_PARSE_NOTAB, merge_flags, &result_cfg, &error_list, &success_list); /* We always expect EEXIST due to DETECT being set. */ fail_unless(ret == EEXIST, "Failed to augment context. Error %d\n", ret); if (result_cfg) { ini_config_destroy(in_cfg); in_cfg = result_cfg; result_cfg = NULL; } /* Get a list of sections from the resulting cfg. */ sections = ini_get_section_list(in_cfg, §ions_count, &ret); fail_unless(ret == EOK, "Failed to get section list. Error %d\n", ret); /* Validate that the tested section exists. */ ret = exists_array(test_section, sections, sections_count); fail_if(ret == 0, "Failed to find expected section.\n"); /* Get a list of attributes from the resulting cfg. */ attributes = ini_get_attribute_list(in_cfg, test_section, &attributes_count, &ret); fail_unless(ret == EOK, "Failed to get attribute list. Error %d\n", ret); /* Validate that the expected number of attributes exist. This * distinguishes MERGE from PRESERVE/OVERWRITE. */ fail_unless(expected_attributes_count == attributes_count, "Expected %d attributes, but received %d.\n", expected_attributes_count, attributes_count); /* Validate that the test attribute exists. This distinguishes * PRESERVE from OVERWRITE. */ ret = exists_array(test_attribute, attributes, attributes_count); fail_if(ret == 0, "Failed to find expected attribute.\n"); ret = ini_get_config_valueobj(test_section, test_attribute, in_cfg, 0, &val); fail_unless(ret == EOK, "Failed to load value object. Error %d\n", ret); val_str = ini_get_string_config_value(val, &ret); fail_unless(ret == EOK, "Failed to get config value. Error %d\n", ret); /* Validate the value of the test attribute. */ ret = strcmp(val_str, test_attribute_value); fail_unless(ret == 0, "Attribute %s didn't have expected value of " "(%s): saw %s\n", test_attribute, test_attribute_value, val_str); /* Cleanup */ free(val_str); ini_free_attribute_list(attributes); ini_free_section_list(sections); ref_array_destroy(error_list); ini_config_file_destroy(file_ctx); ref_array_destroy(success_list); ini_config_destroy(in_cfg); ini_config_destroy(result_cfg); } remove(base_path); remove(augment_path); } END_TEST START_TEST(test_ini_augment_empty_dir) { int ret; struct ini_cfgobj *ini_cfg; struct ini_cfgfile *file_ctx; struct value_obj *vo; const char *patterns[] = { ".*", NULL }; const char *sections[] = { ".*", NULL }; char **section_list; char **attrs_list; struct ini_cfgobj *result_cfg = NULL; int size; char empty_dir_path[PATH_MAX] = {0}; const char *builddir; int32_t val; char base_cfg[] = "[section_one]\n" "one = 1\n"; builddir = getenv("builddir"); if (builddir == NULL) { builddir = "."; } ret = snprintf(empty_dir_path, PATH_MAX, "%s/tmp_empty_dir", builddir); fail_if(ret > PATH_MAX || ret < 0, "snprintf failed\n"); ret = ini_config_file_from_mem(base_cfg, strlen(base_cfg), &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); ret = ini_config_create(&ini_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_ERROR, INI_MV1S_ALLOW, 0, ini_cfg); fail_unless(ret == EOK, "Failed to parse configuration. Error %d.\n", ret); /* Create an empty directory */ ret = mkdir(empty_dir_path, 0700); if (ret == -1) { ret = errno; fail_if(ret != EEXIST, "Failed to create empty directory. Error %d.\n", errno); } ret = ini_config_augment(ini_cfg, empty_dir_path, patterns, sections, NULL, INI_STOP_ON_ANY, INI_MV1S_OVERWRITE, INI_PARSE_NOWRAP, INI_MV2S_OVERWRITE, &result_cfg, NULL, NULL); fail_unless(ret == EOK); /* If the snippet directory is empty, result_cfg should be the original * ini_cfg and not NULL */ fail_if(result_cfg == NULL); /* Now check if the content of result_cfg is what we expected */ section_list = ini_get_section_list(result_cfg, &size, NULL); fail_unless(size == 1); fail_unless(strcmp(section_list[0], "section_one") == 0); attrs_list = ini_get_attribute_list(result_cfg, section_list[0], &size, NULL); fail_unless(size == 1); fail_unless(strcmp(attrs_list[0], "one") == 0); ret = ini_get_config_valueobj(section_list[0], attrs_list[0], result_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == 0); val = ini_get_int32_config_value(vo, 1, 100, NULL); fail_unless(val == 1, "Expected attribute value not found.\n"); ini_free_attribute_list(attrs_list); ini_free_section_list(section_list); ini_config_destroy(result_cfg); ini_config_destroy(ini_cfg); ini_config_file_destroy(file_ctx); remove(empty_dir_path); } END_TEST static Suite *ini_augment_suite(void) { Suite *s = suite_create("ini_augment_suite"); TCase *tc_augment = tcase_create("ini_augment"); tcase_add_test(tc_augment, test_ini_augment_merge_sections); tcase_add_test(tc_augment, test_ini_augment_empty_dir); suite_add_tcase(s, tc_augment); return s; } int main(void) { int number_failed; Suite *s = ini_augment_suite(); SRunner *sr = srunner_create(s); srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/ini/ini_comment.c000066400000000000000000000505071417260640400166260ustar00rootroot00000000000000/* INI LIBRARY Object to handle comments Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include "trace.h" #include "ref_array.h" #include "simplebuffer.h" #include "ini_comment.h" #include "ini_defines.h" /* The lines will increment in this number */ #define INI_COMMENT_BLOCK 10 /* Default comment length */ #define INI_COMMENT_LEN 100 /***************************/ /* Internal comment states */ /***************************/ /* Empty - initial */ #define INI_COMMENT_EMPTY 0 /* Read - read from file */ #define INI_COMMENT_READ 1 /* Comment was altered */ #define INI_COMMENT_CHANGED 2 /*********************************/ /* Modes to wrap ref array calls */ /*********************************/ #define INI_COMMENT_MODE_BUILD 1 #define INI_COMMENT_MODE_APPEND 2 #define INI_COMMENT_MODE_INSERT 3 #define INI_COMMENT_MODE_REPLACE 4 #define INI_COMMENT_MODE_REMOVE 5 #define INI_COMMENT_MODE_CLEAR 6 /****************************************/ /* Internal structure to hold a comment */ /****************************************/ struct ini_comment { struct ref_array *ra; uint32_t state; }; /****************************************/ /* Destroy the comment object */ void ini_comment_destroy(struct ini_comment *ic) { TRACE_FLOW_ENTRY(); if (ic) { /* Function will check for NULL */ ref_array_destroy(ic->ra); free(ic); } TRACE_FLOW_EXIT(); } /* Cleanup callback */ static void ini_comment_cb(void *elem, ref_array_del_enum type, void *data) { TRACE_FLOW_ENTRY(); simplebuffer_free(*((struct simplebuffer **)elem)); TRACE_FLOW_EXIT(); } /* Create a comment object */ int ini_comment_create(struct ini_comment **ic) { int error = EOK; struct ref_array *ra = NULL; struct ini_comment *ic_new = NULL; TRACE_FLOW_ENTRY(); error = ref_array_create(&ra, sizeof(struct simplebuffer *), INI_COMMENT_BLOCK, ini_comment_cb, NULL); if (error) { TRACE_ERROR_NUMBER("Error creating ref array", error); return error; } ic_new = malloc(sizeof(struct ini_comment)); if (!ic_new) { TRACE_ERROR_NUMBER("Memory allocation error", ENOMEM); ref_array_destroy(ra); return ENOMEM; } /* Initialize members here */ ic_new->ra = ra; ic_new->state = INI_COMMENT_EMPTY; *ic = ic_new; TRACE_FLOW_EXIT(); return error; } /* Callback to copy comment */ static int ini_comment_copy_cb(void *elem, void *new_elem) { int error = EOK; struct simplebuffer *sb = NULL; struct simplebuffer *sb_new = NULL; TRACE_FLOW_ENTRY(); error = simplebuffer_alloc(&sb_new); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer", error); return error; } sb = *((struct simplebuffer **)elem); error = simplebuffer_add_str(sb_new, (const char *)simplebuffer_get_buf(sb), simplebuffer_get_len(sb), INI_COMMENT_LEN); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer", error); simplebuffer_free(sb_new); return error; } *((struct simplebuffer **)new_elem) = sb_new; TRACE_FLOW_EXIT(); return error; } /* Create a copy of the comment object */ int ini_comment_copy(struct ini_comment *ic, struct ini_comment **ic_copy) { int error = EOK; struct ref_array *ra = NULL; struct ini_comment *ic_new = NULL; TRACE_FLOW_ENTRY(); error = ref_array_copy(ic->ra, ini_comment_copy_cb, ini_comment_cb, NULL, &ra); if (error) { TRACE_ERROR_NUMBER("Error creating a copy of ref array", error); return error; } ic_new = malloc(sizeof(struct ini_comment)); if (!ic_new) { TRACE_ERROR_NUMBER("Memory allocation error", ENOMEM); ref_array_destroy(ra); return ENOMEM; } /* Initialize members here */ ic_new->ra = ra; ic_new->state = ic->state; *ic_copy = ic_new; TRACE_FLOW_EXIT(); return error; } /* * Modify the comment object */ static int ini_comment_modify(struct ini_comment *ic, int mode, uint32_t idx, const char *line, uint32_t length) { int error = EOK; struct simplebuffer *elem = NULL; struct simplebuffer *empty = NULL; char *input = NULL; uint32_t i, len = 0; uint32_t input_len = 0; TRACE_FLOW_ENTRY(); if (!ic) { TRACE_ERROR_NUMBER("Invalid comment object", EINVAL); return EINVAL; } if (mode == INI_COMMENT_MODE_BUILD) { /* * Can use this function only if object is empty or * reading from the file. */ if ((ic->state != INI_COMMENT_EMPTY) && (ic->state != INI_COMMENT_READ)) { TRACE_ERROR_NUMBER("Invalid use of the function", EINVAL); return EINVAL; } } /* Make sure that we ignore "line" in reset case */ if (mode != INI_COMMENT_MODE_CLEAR) memcpy(&input, &line, sizeof(char *)); if (mode != INI_COMMENT_MODE_REMOVE) { error = simplebuffer_alloc(&elem); if (error) { TRACE_ERROR_NUMBER("Allocate buffer for the comment", error); return error; } if (input) { if (length == 0) input_len = strlen(input); else input_len = length; error = simplebuffer_add_str(elem, input, input_len, INI_COMMENT_LEN); } else { error = simplebuffer_add_str(elem, "", 0, INI_COMMENT_LEN); } if (error) { TRACE_ERROR_NUMBER("Allocate buffer for the comment", error); simplebuffer_free(elem); return error; } } /* Do action depending on mode */ switch (mode) { case INI_COMMENT_MODE_BUILD: TRACE_INFO_STRING("BUILD mode", ""); error = ref_array_append(ic->ra, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to append line to an array", error); simplebuffer_free(elem); return error; } break; case INI_COMMENT_MODE_APPEND: TRACE_INFO_STRING("Append mode", ""); error = ref_array_append(ic->ra, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to append line to an array", error); simplebuffer_free(elem); return error; } break; case INI_COMMENT_MODE_INSERT: TRACE_INFO_STRING("Insert mode", ""); len = ref_array_len(ic->ra); if (idx > len) { /* Fill in empty lines */ for (i = 0; i < (idx-len); i++) { error = simplebuffer_alloc(&empty); if (error) { TRACE_ERROR_NUMBER("Allocate buffer for the comment", error); simplebuffer_free(elem); return error; } error = simplebuffer_add_str(elem, NULL, 0, INI_COMMENT_LEN); if (error) { TRACE_ERROR_NUMBER("Make comment empty", error); simplebuffer_free(empty); simplebuffer_free(elem); return error; } error = ref_array_append(ic->ra, (void *)&empty); if (error) { TRACE_ERROR_NUMBER("Append problem", error); simplebuffer_free(empty); simplebuffer_free(elem); return error; } } /* Append last line */ error = ref_array_append(ic->ra, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to append last line", error); simplebuffer_free(elem); return error; } } else { /* Insert inside the array */ error = ref_array_insert(ic->ra, idx, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to append last line", error); simplebuffer_free(elem); return error; } } break; case INI_COMMENT_MODE_REPLACE: TRACE_INFO_STRING("Replace mode", ""); error = ref_array_replace(ic->ra, idx, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to replace", error); simplebuffer_free(elem); return error; } break; case INI_COMMENT_MODE_REMOVE: TRACE_INFO_STRING("Remove mode", ""); error = ref_array_remove(ic->ra, idx); if (error) { TRACE_ERROR_NUMBER("Failed to remove", error); return error; } break; case INI_COMMENT_MODE_CLEAR: TRACE_INFO_STRING("Clear mode", ""); error = ref_array_replace(ic->ra, idx, (void *)&elem); if (error) { TRACE_ERROR_NUMBER("Failed to replace", error); simplebuffer_free(elem); return error; } break; default : TRACE_ERROR_STRING("Coding error", ""); simplebuffer_free(elem); return EINVAL; } /* Change state */ if (INI_COMMENT_MODE_BUILD) ic->state = INI_COMMENT_READ; else ic->state = INI_COMMENT_CHANGED; TRACE_FLOW_EXIT(); return error; } /* * Build up a comment object - use this when reading * comments from a file. */ int ini_comment_build(struct ini_comment *ic, const char *line) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_BUILD, 0, line, 0); TRACE_FLOW_NUMBER("ini_comment_build - Returning", error); return error; } /* * Build up a comment object - use this when reading * comments from a file. */ int ini_comment_build_wl(struct ini_comment *ic, const char *line, uint32_t length) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_BUILD, 0, line, length); TRACE_FLOW_NUMBER("ini_comment_build - Returning", error); return error; } /* * Modify comment by instering a line. */ int ini_comment_insert(struct ini_comment *ic, uint32_t idx, const char *line) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_INSERT, idx, line, 0); TRACE_FLOW_NUMBER("ini_comment_insert - Returning", error); return error; } /* Modify comment by appending a line. */ int ini_comment_append(struct ini_comment *ic, const char *line) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_APPEND, 0, line, 0); TRACE_FLOW_NUMBER("ini_comment_append - Returning", error); return error; } /* Remove line from the comment.*/ int ini_comment_remove(struct ini_comment *ic, uint32_t idx) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_REMOVE, idx, NULL, 0); TRACE_FLOW_NUMBER("ini_comment_remove - Returning", error); return error; } /* Clear line in the comment. Line is replaced with an empty line */ int ini_comment_clear(struct ini_comment *ic, uint32_t idx) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_CLEAR, idx, NULL, 0); TRACE_FLOW_NUMBER("ini_comment_clear - Returning", error); return error; } /* Replace a line in the comment */ int ini_comment_replace(struct ini_comment *ic, uint32_t idx, const char *line) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_comment_modify(ic, INI_COMMENT_MODE_REPLACE, idx, line, 0); TRACE_FLOW_NUMBER("ini_comment_replace - Returning", error); return error; } /* Reset the comment - clean all lines.*/ int ini_comment_reset(struct ini_comment *ic) { int error = EOK; TRACE_FLOW_ENTRY(); if (!ic) { TRACE_ERROR_NUMBER("Invalid comment object", EINVAL); return EINVAL; } /* Reset comment if it is not empty */ if (ic->state != INI_COMMENT_EMPTY) { ref_array_reset(ic->ra); ic->state = INI_COMMENT_CHANGED; } TRACE_FLOW_EXIT(); return error; } /* Get number of lines */ int ini_comment_get_numlines(struct ini_comment *ic, uint32_t *num) { int error = EOK; TRACE_FLOW_ENTRY(); if ((!ic) || (!num)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } error = ref_array_getlen(ic->ra, num); TRACE_FLOW_NUMBER("ini_comment_get_numlines - Returning", error); return error; } /* Get line */ int ini_comment_get_line(struct ini_comment *ic, uint32_t idx, char **line, uint32_t *line_len) { int error = EOK; void *res = NULL; struct simplebuffer *sb = NULL; const unsigned char *ln; TRACE_FLOW_ENTRY(); if ((!ic) || (!line)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } res = ref_array_get(ic->ra, idx, (void *)&sb); if (!res) { error = EINVAL; *line = NULL; if (line_len) line_len = 0; } else { ln = simplebuffer_get_buf(sb); memcpy(line, &ln, sizeof(char *)); if (line_len) *line_len = simplebuffer_get_len(sb); } TRACE_FLOW_NUMBER("ini_comment_get_line - Returning", error); return error; } /* Swap lines */ int ini_comment_swap(struct ini_comment *ic, uint32_t idx1, uint32_t idx2) { int error = EOK; TRACE_FLOW_ENTRY(); if (!ic) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } if (idx1 != idx2) { if ((error = ref_array_swap(ic->ra, idx1, idx2))) { TRACE_ERROR_NUMBER("Failed to swap", error); return error; } ic->state = INI_COMMENT_CHANGED; } TRACE_FLOW_EXIT(); return error; } /* Add one comment to another */ int ini_comment_add(struct ini_comment *ic_to_add, struct ini_comment *ic) { int error = EOK; struct simplebuffer *sb = NULL; struct simplebuffer *sb_new = NULL; void *res = NULL; uint32_t len = 0; int i; TRACE_FLOW_ENTRY(); len = ref_array_len(ic_to_add->ra); for (i = 0; i< len; i++) { /* Get data element */ res = ref_array_get(ic_to_add->ra, i, (void *)(&sb)); if (!res) { TRACE_ERROR_NUMBER("Failed to get comment element", error); return error; } /* Create a storage a for a copy */ error = simplebuffer_alloc(&sb_new); if (error) { TRACE_ERROR_NUMBER("Allocate buffer for the comment", error); return error; } /* Copy actual data */ error = simplebuffer_add_str(sb_new, (const char *)simplebuffer_get_buf(sb), simplebuffer_get_len(sb), INI_COMMENT_LEN); if (error) { TRACE_ERROR_NUMBER("Failed to append line to an array", error); simplebuffer_free(sb_new); return error; } /* Append it to the array */ error = ref_array_append(ic->ra, (void *)&sb_new); if (error) { TRACE_ERROR_NUMBER("Failed to append element to an array", error); simplebuffer_free(sb_new); return error; } } TRACE_FLOW_EXIT(); return error; } /* Serialize comment */ int ini_comment_serialize (struct ini_comment *ic, struct simplebuffer *sbobj) { int error = EOK; uint32_t num = 0; uint32_t i = 0; uint32_t len = 0; char *commentline = NULL; TRACE_FLOW_ENTRY(); /* Get number of lines in the comment */ error = ini_comment_get_numlines(ic, &num); if (error) { TRACE_ERROR_NUMBER("Failed to get number of lines", error); return error; } for (i = 0; i < num; i++) { len = 0; commentline = NULL; error = ini_comment_get_line(ic, i, &commentline, &len); if (error) { TRACE_ERROR_NUMBER("Failed to get line", error); return error; } error = simplebuffer_add_raw(sbobj, commentline, len, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add comment", error); return error; } error = simplebuffer_add_cr(sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to add CR", error); return error; } } TRACE_FLOW_EXIT(); return error; } /* Internal function to print comment */ void ini_comment_print(struct ini_comment *ic, FILE *file) { int len; int i; struct simplebuffer *sb = NULL; TRACE_FLOW_ENTRY(); if (!file) { TRACE_ERROR_NUMBER("Invalid file argument", EINVAL); return; } if (ic) { len = ref_array_len(ic->ra); for (i = 0; i < len; i++) { ref_array_get(ic->ra, i, (void *)(&sb)); fprintf(file, "%s\n", simplebuffer_get_buf(sb)); } } TRACE_FLOW_EXIT(); } /* Construct a comment out of array or strings. */ int ini_comment_construct(const char *comments[], size_t count_comment, struct ini_comment **ic) { int error = EOK; size_t cnt = 0; struct ini_comment *new_ic = NULL; TRACE_FLOW_ENTRY(); if (!ic) { TRACE_ERROR_STRING("Invalid argument","comment object"); return EINVAL; } if (comments) { error = ini_comment_create(&new_ic); if (error) { TRACE_ERROR_NUMBER("Failed to create comment object", error); return error; } if (count_comment) { /* Base the number of lines on count */ for (cnt = 0; cnt < count_comment; cnt++) { error = ini_comment_append(new_ic, comments[cnt]); if (error) { TRACE_ERROR_NUMBER("Failed to append comment in for loop.", error); ini_comment_destroy(new_ic); return error; } } } else { /* Assume that the list is NULL terminated */ while (comments[cnt]) { error = ini_comment_append(new_ic, comments[cnt]); if (error) { TRACE_ERROR_NUMBER("Failed to append comment in for loop.", error); ini_comment_destroy(new_ic); return error; } cnt++; } } *ic = new_ic; } else { /* No comments! */ *ic = NULL; } TRACE_FLOW_EXIT(); return EOK; } ding-libs-0.6.2/ini/ini_comment.h000066400000000000000000000076451417260640400166400ustar00rootroot00000000000000/* INI LIBRARY Header file for comment object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_COMMENT_H #define INI_COMMENT_H #include #include #include "simplebuffer.h" #ifndef EOK #define EOK 0 #endif struct ini_comment; /** * Create a comment object */ int ini_comment_create(struct ini_comment **ic); /** * Construct a comment out of array or strings. * * If count is 0 then the array of strings must * be NULL terminated i.e. last entry in the array * should point to a NULL string. * If it is not NULL it specifies the number of * strings expected to be in the array. */ int ini_comment_construct(const char **comments, size_t count_comment, struct ini_comment **ic); /** * Destroy the comment object */ void ini_comment_destroy(struct ini_comment *ic); /** * Build up a comment object - use this when reading * comments from a file. */ int ini_comment_build(struct ini_comment *ic, const char *line); /** * Build up a comment object - use this when reading * comments from a file when length is known. */ int ini_comment_build_wl(struct ini_comment *ic, const char *line, uint32_t length); /** * Modify comment by instering a line. * * idx can be: * 0 - as first * 1 - after first * 2 - after second * ... * If greater than number of lines * missing lines are added automatically * as empty lines */ int ini_comment_insert(struct ini_comment *ic, uint32_t idx, const char *line); /** * Modify comment by appending a line. */ int ini_comment_append(struct ini_comment *ic, const char *line); /** * Remove line from the comment. */ int ini_comment_remove(struct ini_comment *ic, uint32_t idx); /** * Clear line in the comment. * Line is replaced with an empty line */ int ini_comment_clear(struct ini_comment *ic, uint32_t idx); /** * Replace a line in the comment */ int ini_comment_replace(struct ini_comment *ic, uint32_t idx, const char *line); /** * Reset the comment - clean all lines. */ int ini_comment_reset(struct ini_comment *ic); /** * Get number of lines */ int ini_comment_get_numlines(struct ini_comment *ic, uint32_t *num); /** * Get line */ int ini_comment_get_line(struct ini_comment *ic, uint32_t idx, char **line, uint32_t *line_len); /** * Swap lines */ int ini_comment_swap(struct ini_comment *ic, uint32_t idx1, uint32_t idx2); /** * Create a copy of the comment object */ int ini_comment_copy(struct ini_comment *ic, struct ini_comment **ic_copy); /** * Add one comment to another */ int ini_comment_add(struct ini_comment *ic_to_add, struct ini_comment *ic); /** * Serialize comment */ int ini_comment_serialize(struct ini_comment *ic, struct simplebuffer *sbobj); /** * Internal function to print comment */ void ini_comment_print(struct ini_comment *ic, FILE *file); #endif ding-libs-0.6.2/ini/ini_comment_ut.c000066400000000000000000000302521417260640400173310ustar00rootroot00000000000000/* INI LIBRARY Unit test for the comment object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #define TRACE_HOME #include "trace.h" #include "ini_comment.h" int verbose = 0; #define INIOUT(foo) \ do { \ if (verbose) foo; \ } while(0) typedef int (*test_fn)(void); static int file_test(void) { int error = EOK; struct ini_comment *ic = NULL; if ((error = ini_comment_create(&ic)) || (error = ini_comment_build(ic, ";Line 0")) || (error = ini_comment_build(ic, ";Line 1")) || (error = ini_comment_build(ic, ";Line 2"))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); ini_comment_destroy(ic); return error; } static int construct_test(void) { int error = EOK; struct ini_comment *ic = NULL; const char *comments[] = { ";Line1", ";Line2", ";Line3", NULL }; error = ini_comment_construct(comments, 0, &ic); if (error) { printf("Failed to create comment object %d\n", error); return error; } INIOUT(printf("<==== Constructed Comment 1 ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); ini_comment_destroy(ic); error = ini_comment_construct(comments, 2, &ic); if (error) { printf("Failed to create comment object %d\n", error); return error; } INIOUT(printf("<==== Constructed Comment 2 ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); ini_comment_destroy(ic); return error; } static int alter_test(void) { int error = EOK; struct ini_comment *ic = NULL; uint32_t i, num = 0; char *line = NULL; const char *expected[] = { ";Line 0 inserted", ";Line 1 inserted", "", "", ";Line 3 replaced", "", ";Line 4" }; if ((error = ini_comment_create(&ic)) || (error = ini_comment_build(ic, ";Line 0")) || (error = ini_comment_build(ic, NULL)) || (error = ini_comment_build(ic, ";Line 2")) || (error = ini_comment_build(ic, ";Line 3")) || (error = ini_comment_build(ic, ""))) { printf("Failed to create comment object\n"); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); if ((error = ini_comment_append(ic, ";Line 4")) || (error = ini_comment_clear(ic, 2)) || (error = ini_comment_replace(ic, 3, ";Line 3 replaced")) || (error = ini_comment_remove(ic, 0)) || (error = ini_comment_insert(ic, 0, ";Line 0 inserted")) || (error = ini_comment_insert(ic, 1, ";Line 1 inserted"))) { printf("Failed to create comment object\n"); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); error = ini_comment_get_numlines(ic, &num); if (error) { printf("Failed to get number of lines.\n"); ini_comment_destroy(ic); return error; } for (i = 0; i < num; i++) { error = ini_comment_get_line(ic, i, &line, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); return error; } if (strcmp(line, expected[i]) != 0) { printf("Lines do not match.\n"); printf("GOT: %s\n", line); printf("EXP: %s\n", expected[i]); ini_comment_destroy(ic); return error; } } INIOUT(printf("\n\nSwap test\n\n")); if ((error = ini_comment_swap(ic, 0 , 6)) || (error = ini_comment_swap(ic, 1 , 5)) || (error = ini_comment_swap(ic, 2 , 4))) { printf("Failed to swap lines.\n"); ini_comment_destroy(ic); return error; } for (i = 0; i < num; i++) { error = ini_comment_get_line(ic, i, &line, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); return error; } if (strcmp(line, expected[6 - i]) != 0) { printf("Lines do not match.\n"); printf("GOT: %s\n", line); printf("EXP: %s\n", expected[6 - i]); ini_comment_destroy(ic); return error; } } ini_comment_destroy(ic); return error; } static int copy_test(void) { int error = EOK; struct ini_comment *ic = NULL; struct ini_comment *ic_copy = NULL; char *line = NULL; char *line_copy = NULL; uint32_t i, num = 0; INIOUT(printf("\n\nCopy test\n\n")); if ((error = ini_comment_create(&ic)) || (error = ini_comment_build(ic, ";Line 0")) || (error = ini_comment_build(ic, ";Line 1")) || (error = ini_comment_build(ic, ";Line 2"))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); if ((error = ini_comment_copy(ic, &ic_copy))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment Copy====>\n")); INIOUT(ini_comment_print(ic_copy, stdout)); INIOUT(printf("<=================>\n")); error = ini_comment_get_numlines(ic, &num); if (error) { printf("Failed to get number of lines.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_copy); return error; } for (i = 0; i < num; i++) { error = ini_comment_get_line(ic, i, &line, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_copy); return error; } error = ini_comment_get_line(ic_copy, i, &line_copy, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_copy); return error; } if (strcmp(line, line_copy) != 0) { printf("Lines do not match.\n"); printf("Source: %s\n", line); printf("Copy: %s\n", line_copy); ini_comment_destroy(ic); ini_comment_destroy(ic_copy); return -1; } } ini_comment_destroy(ic); ini_comment_destroy(ic_copy); return error; } static int add_test(void) { int error = EOK; struct ini_comment *ic = NULL; struct ini_comment *ic_to_add = NULL; struct ini_comment *ic_cmp = NULL; uint32_t i, num1 = 0, num2 = 0; char *line1 = NULL; char *line2 = NULL; INIOUT(printf("\n\nAdd test\n\n")); if ((error = ini_comment_create(&ic)) || (error = ini_comment_build(ic, ";Line 0")) || (error = ini_comment_build(ic, ";Line 1")) || (error = ini_comment_build(ic, ";Line 2"))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); if ((error = ini_comment_create(&ic_to_add)) || (error = ini_comment_build(ic_to_add, ";Line 3")) || (error = ini_comment_build(ic_to_add, ";Line 4")) || (error = ini_comment_build(ic_to_add, ";Line 5"))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic); return error; } INIOUT(printf("<==== Comment To Add ====>\n")); INIOUT(ini_comment_print(ic_to_add, stdout)); INIOUT(printf("<=================>\n")); error = ini_comment_add(ic_to_add, ic); if (error) { printf("Failed to add one comment to another.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_to_add); return error; } INIOUT(printf("<==== Merged Comment ====>\n")); INIOUT(ini_comment_print(ic, stdout)); INIOUT(printf("<=================>\n")); if ((error = ini_comment_create(&ic_cmp)) || (error = ini_comment_build(ic_cmp, ";Line 0")) || (error = ini_comment_build(ic_cmp, ";Line 1")) || (error = ini_comment_build(ic_cmp, ";Line 2")) || (error = ini_comment_build(ic_cmp, ";Line 3")) || (error = ini_comment_build(ic_cmp, ";Line 4")) || (error = ini_comment_build(ic_cmp, ";Line 5"))) { printf("Failed to create comment object %d\n", error); ini_comment_destroy(ic_cmp); return error; } ini_comment_destroy(ic_to_add); error = ini_comment_get_numlines(ic, &num1); if (error) { printf("Failed to get number of lines.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return error; } error = ini_comment_get_numlines(ic, &num2); if (error) { printf("Failed to get number of lines.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return error; } if (num1 != num2) { printf("Sizes are different.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return -1; } for (i = 0; i < num1; i++) { line1 = NULL; error = ini_comment_get_line(ic, i, &line1, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return error; } line2 = NULL; error = ini_comment_get_line(ic_cmp, i, &line2, NULL); if (error) { printf("Failed to get line.\n"); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return error; } if (strcmp(line1, line2) != 0) { printf("Lines do not match.\n"); printf("1st: %s\n", line1); printf("2nd: %s\n", line2); ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return -1; } } ini_comment_destroy(ic); ini_comment_destroy(ic_cmp); return error; } int main(int argc, char *argv[]) { int error = EOK; test_fn tests[] = { file_test, alter_test, copy_test, add_test, construct_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } INIOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { INIOUT(printf("Failed with error %d!\n", error)); return error; } } INIOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_config.c000066400000000000000000001045411417260640400164270ustar00rootroot00000000000000/* INI LIBRARY Reading configuration from INI file and storing as a collection. Copyright (C) Dmitri Pal 2009 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "path_utils.h" #include "ini_defines.h" #include "ini_metadata.h" #include "ini_config.h" /* Temporarily move the parsing function here */ /* THIS FUNCTION WILL BE REMOVED AS SOON AS WE SWITCH TO THE NEW INTERFACE */ /* Reads a line from the file */ static int read_line(FILE *file, char *buf, int read_size, char **key, char **value, int *length, int *ext_error) { char *res; int len; char *buffer; int i; char *eq; TRACE_FLOW_STRING("read_line", "Entry"); *ext_error = 0; buffer = buf; /* Get data from file */ res = fgets(buffer, read_size - 1, file); if (res == NULL) { TRACE_ERROR_STRING("Read nothing", ""); return RET_EOF; } /* Make sure the buffer is NULL terminated */ buffer[read_size - 1] = '\0'; len = strlen(buffer); if (len == 0) { TRACE_ERROR_STRING("Nothing was read.", ""); return RET_EMPTY; } /* Added \r just in case we deal with Windows in future */ if ((buffer[len - 1] != '\n') && (buffer[len - 1] != '\r')) { TRACE_ERROR_STRING("String it too big!", ""); *ext_error = ERR_LONGDATA; return RET_ERROR; } /* Ingnore comments */ if ((*buffer == ';') || (*buffer == '#')) { TRACE_FLOW_STRING("Comment", buf); return RET_COMMENT; } TRACE_INFO_STRING("BUFFER before trimming:", buffer); /* Trucate trailing spaces and CRs */ /* Make sure not to step before the beginning */ while (len && isspace(buffer[len - 1])) { buffer[len - 1] = '\0'; len--; } TRACE_INFO_STRING("BUFFER after trimming trailing spaces:", buffer); /* Trucate leading spaces */ while (isspace(*buffer)) { buffer++; len--; } TRACE_INFO_STRING("BUFFER after trimming leading spaces:", buffer); TRACE_INFO_NUMBER("BUFFER length:", len); /* Empty line */ if (len == 0) { TRACE_FLOW_STRING("Empty line", buf); return RET_EMPTY; } /* Section */ if (*buffer == '[') { if (buffer[len-1] != ']') { TRACE_ERROR_STRING("Invalid format for section", buf); *ext_error = ERR_NOCLOSESEC; return RET_ERROR; } buffer++; len--; while (isspace(*buffer)) { buffer++; len--; } if (len == 0) { TRACE_ERROR_STRING("Invalid format for section", buf); *ext_error = ERR_NOSECTION; return RET_ERROR; } buffer[len - 1] = '\0'; len--; while (isspace(buffer[len - 1])) { buffer[len - 1] = '\0'; len--; } if (len >= MAX_KEY) { TRACE_ERROR_STRING("Section name is too long", buf); *ext_error = ERR_SECTIONLONG; return RET_ERROR; } *key = buffer; return RET_SECTION; } /* Assume we are dealing with the K-V here */ /* Find "=" */ eq = strchr(buffer, '='); if (eq == NULL) { TRACE_ERROR_STRING("No equal sign", buf); *ext_error = ERR_NOEQUAL; return RET_INVALID; } len -= eq-buffer; /* Strip spaces around "=" */ i = eq - buffer - 1; while ((i >= 0) && isspace(buffer[i])) i--; if (i < 0) { TRACE_ERROR_STRING("No key", buf); *ext_error = ERR_NOKEY; return RET_INVALID; } /* Copy key into provided buffer */ if(i >= MAX_KEY) { TRACE_ERROR_STRING("Key name is too long", buf); *ext_error = ERR_LONGKEY; return RET_INVALID; } *key = buffer; buffer[i + 1] = '\0'; TRACE_INFO_STRING("KEY:", *key); eq++; len--; while (isspace(*eq)) { eq++; len--; } *value = eq; /* Make sure we include trailing 0 into data */ *length = len + 1; TRACE_INFO_STRING("VALUE:", *value); TRACE_INFO_NUMBER("LENGTH:", *length); TRACE_FLOW_STRING("read_line", "Exit"); return RET_PAIR; } /************************************************************/ /* REMOVE FUNCTION ABOVE */ /************************************************************/ /***************************************************************************/ /* Function to read single ini file and pupulate * the provided collection with subcollcetions from the file */ static int ini_to_collection(FILE *file, const char *config_filename, struct collection_item *ini_config, int error_level, struct collection_item **error_list, struct collection_item *lines) { int error; int status; int section_count = 0; char *key = NULL; char *value = NULL; struct collection_item *current_section = NULL; int length; int ext_err = -1; struct parse_error pe; int line = 0; int created = 0; char buf[BUFFER_SIZE+1]; TRACE_FLOW_STRING("ini_to_collection", "Entry"); /* Open the collection of errors */ if (error_list != NULL) { *error_list = NULL; error = col_create_collection(error_list, INI_ERROR, COL_CLASS_INI_PERROR); if (error) { TRACE_ERROR_NUMBER("Failed to create error collection", error); return error; } /* Add file name as the first item */ error = col_add_str_property(*error_list, NULL, INI_ERROR_NAME, config_filename, 0); if (error) { TRACE_ERROR_NUMBER("Failed to and name to collection", error); col_destroy_collection(*error_list); return error; } created = 1; } /* Read file lines */ while (1) { /* Always read one less than the buffer */ status = read_line(file, buf, BUFFER_SIZE+1, &key, &value, &length, &ext_err); if (status == RET_EOF) break; line++; switch (status) { case RET_PAIR: #ifdef HAVE_VALIDATION /* Add line to the collection of lines. * It is pretty safe in this case to just type cast the value to * int32_t since it is unrealistic that ini file will ever have * so many lines. */ if (lines) { error = col_add_int_property(lines, NULL, key, (int32_t)line); if (error) { TRACE_ERROR_NUMBER("Failed to add line to line collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } #endif /* HAVE_VALIDATION */ /* Do we have a section at the top of the file ? */ if (section_count == 0) { /* Check if collection already exists */ error = col_get_collection_reference(ini_config, ¤t_section, INI_DEFAULT_SECTION); if (error != EOK) { /* Create default collection */ if ((error = col_create_collection(¤t_section, INI_DEFAULT_SECTION, COL_CLASS_INI_SECTION)) || (error = col_add_collection_to_collection(ini_config, NULL,NULL, current_section, COL_ADD_MODE_REFERENCE))) { TRACE_ERROR_NUMBER("Failed to create collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } section_count++; } /* Put value into the collection */ error = col_insert_str_property(current_section, NULL, COL_DSP_END, NULL, 0, COL_INSERT_DUPOVER, key, value, length); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to add pair to collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } break; case RET_SECTION: #ifdef HAVE_VALIDATION /* Add line to the collection of lines */ if (lines) { /* For easier search make line numbers for the sections negative. * This would allow differentiating sections and attributes. * It is pretty safe in this case to just type cast the value to * int32_t since it is unrealistic that ini file will ever have * so many lines. */ error = col_add_int_property(lines, NULL, key, (int32_t)(-1 * line)); if (error) { TRACE_ERROR_NUMBER("Failed to add line to line collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } #endif /* HAVE_VALIDATION */ /* Read a new section */ col_destroy_collection(current_section); current_section = NULL; error = col_get_collection_reference(ini_config, ¤t_section, key); if (error != EOK) { /* Create default collection */ if ((error = col_create_collection(¤t_section, key, COL_CLASS_INI_SECTION)) || (error = col_add_collection_to_collection(ini_config, NULL, NULL, current_section, COL_ADD_MODE_REFERENCE))) { TRACE_ERROR_NUMBER("Failed to add collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } section_count++; break; case RET_EMPTY: TRACE_INFO_STRING("Empty string", ""); break; case RET_COMMENT: TRACE_INFO_STRING("Comment", ""); break; case RET_ERROR: /* Try to add to the error list only if it is present */ if (error_list) { pe.line = line; pe.error = ext_err; error = col_add_binary_property(*error_list, NULL, ERROR_TXT, &pe, sizeof(pe)); if (error) { TRACE_ERROR_NUMBER("Failed to add error to collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } /* Exit if there was an error parsing file */ if (error_level != INI_STOP_ON_NONE) { TRACE_ERROR_STRING("Invalid format of the file", ""); col_destroy_collection(current_section); return EIO; } break; case RET_INVALID: default: /* Try to add to the error list only if it is present */ if (error_list) { pe.line = line; pe.error = ext_err; error = col_add_binary_property(*error_list, NULL, WARNING_TXT, &pe, sizeof(pe)); if (error) { TRACE_ERROR_NUMBER("Failed to add warning to collection", error); col_destroy_collection(current_section); if (created) { col_destroy_collection(*error_list); *error_list = NULL; } return error; } } /* Exit if we are told to exit on warnings */ if (error_level == INI_STOP_ON_ANY) { TRACE_ERROR_STRING("Invalid format of the file", ""); if (created) col_destroy_collection(current_section); return EIO; } TRACE_ERROR_STRING("Invalid string", ""); break; } ext_err = -1; } /* Note: File is not closed on this level any more. * It opened on the level above, checked and closed there. * It is not the responsibility of this function to close * file any more. */ COL_DEBUG_COLLECTION(ini_config); col_destroy_collection(current_section); COL_DEBUG_COLLECTION(ini_config); TRACE_FLOW_STRING("ini_to_collection", "Success Exit"); return EOK; } /*********************************************************************/ /* Function to free configuration */ void free_ini_config(struct collection_item *ini_config) { TRACE_FLOW_STRING("free_ini_config", "Entry"); col_destroy_collection(ini_config); TRACE_FLOW_STRING("free_ini_config", "Exit"); } /* Function to free configuration error list */ void free_ini_config_errors(struct collection_item *error_set) { TRACE_FLOW_STRING("free_ini_config_errors", "Entry"); col_destroy_collection(error_set); TRACE_FLOW_STRING("free_ini_config_errors", "Exit"); } #ifdef HAVE_VALIDATION /* Function to free configuration lines list. * * The following doxygen description is moved here. * When the function gets exposed move it into * the header file. */ /** * @brief Function to free lines object. * * EXPERIMENTAL. Reserved for future use. * * @param[in] lines Lines object. * */ void free_ini_config_lines(struct collection_item *lines) { TRACE_FLOW_STRING("free_ini_config_lines", "Entry"); col_destroy_collection(lines); TRACE_FLOW_STRING("free_ini_config_lines", "Exit"); } #endif /* HAVE_VALIDATION */ /* Read configuration information from a file */ int config_from_file(const char *application, const char *config_filename, struct collection_item **ini_config, int error_level, struct collection_item **error_list) { int error; TRACE_FLOW_STRING("config_from_file", "Entry"); error = config_from_file_with_metadata(application, config_filename, ini_config, error_level, error_list, 0, NULL); TRACE_FLOW_NUMBER("config_from_file. Returns", error); return error; } /* Read configuration information from a file descriptor */ int config_from_fd(const char *application, int fd, const char *config_source, struct collection_item **ini_config, int error_level, struct collection_item **error_list) { int error; TRACE_FLOW_STRING("config_from_fd", "Entry"); error = config_from_fd_with_metadata(application, fd, config_source, ini_config, error_level, error_list, 0, NULL); TRACE_FLOW_NUMBER("config_from_fd. Returns", error); return error; } /* Low level function that prepares the collection * and calls parser. */ static int config_with_metadata(const char *application, FILE *config_file, const char *config_source, struct collection_item **ini_config, int error_level, struct collection_item **error_list, uint32_t metaflags, struct collection_item **metadata) { int error; int created = 0; struct collection_item *lines = NULL; #ifdef HAVE_VALIDATION int created_lines = 0; #endif TRACE_FLOW_STRING("config_from_file", "Entry"); /* Now we check arguments in the calling functions. */ /* Create collection if needed */ if (*ini_config == NULL) { error = col_create_collection(ini_config, application, COL_CLASS_INI_CONFIG); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to create collection", error); return error; } created = 1; } /* Is the collection of the right class? */ else if (((col_is_of_class(*ini_config, COL_CLASS_INI_CONFIG))== 0) && ((col_is_of_class(*ini_config, COL_CLASS_INI_META))== 0)) { TRACE_ERROR_NUMBER("Wrong collection type", EINVAL); return EINVAL; } #ifdef HAVE_VALIDATION /* This code is preserved for future use */ error = col_create_collection(lines, application, COL_CLASS_INI_LINES); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to create collection", error); if (created) { col_destroy_collection(*ini_config); *ini_config = NULL; } return error; } created_lines = 1; #else /* Until we implement validation do not read the lines. */ lines = NULL; #endif /* HAVE_VALIDATION */ /* Do the actual work - for now do not read lines.*/ error = ini_to_collection(config_file, config_source, *ini_config, error_level, error_list, lines); /* In case of error when we created collection - delete it */ if (error && created) { col_destroy_collection(*ini_config); *ini_config = NULL; } /* FIXME - put lines collection into the metadata */ TRACE_FLOW_NUMBER("config_from_file. Returns", error); return error; } /* Function to read the ini file from fd * with meta data. */ int config_from_fd_with_metadata(const char *application, int ext_fd, const char *config_filename, struct collection_item **ini_config, int error_level, struct collection_item **error_list, uint32_t metaflags, struct collection_item **metadata) { int error = EOK; int file_error = EOK; int save_error = 0; int fd = -1; FILE *config_file = NULL; char abs_name[PATH_MAX + 1]; char buff[CONVERSION_BUFFER]; TRACE_FLOW_STRING("config_from_fd_with_metadata", "Entry"); /* We need to check arguments before we can move on, * and start allocating memory. */ if ((ini_config == NULL) || (application == NULL)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Prepare meta data */ error = prepare_metadata(metaflags, metadata, &save_error); if (error) { TRACE_ERROR_NUMBER("Failed to prepare metadata", error); return error; } errno = 0; if (ext_fd == -1) { /* No file descriptor so use name */ config_file = fopen(config_filename, "r"); } else { /* Create a copy of the descriptor so that we can close it if needed */ fd = dup(ext_fd); if (fd != -1) config_file = fdopen(fd, "r"); } file_error = errno; if (save_error) { /* Record the result of the open file operation in metadata */ snprintf(buff, CONVERSION_BUFFER, "%d", file_error); error = col_add_str_property(*metadata, INI_META_SEC_ERROR, INI_META_KEY_READ_ERROR, buff, 0); if (error) { /* Something is really wrong if we failed here */ TRACE_ERROR_NUMBER("Failed to save file open error", error); if (config_file) fclose(config_file); return error; } } if(!config_file) { TRACE_ERROR_NUMBER("Failed to open file", file_error); return file_error; } /* Normalize path for reporting purposes */ error = make_normalized_absolute_path(abs_name, PATH_MAX, config_filename); if(error) { TRACE_ERROR_NUMBER("Failed to resolve path", error); fclose(config_file); return error; } if (metadata) { /* Collect meta data before actually parsing the file */ error = collect_metadata(metaflags, metadata, config_file, abs_name); if(error) { TRACE_ERROR_NUMBER("Failed to collect metadata", error); fclose(config_file); return error; } } if (!(metaflags & INI_META_ACTION_NOPARSE)) { /* Parse data if needed */ error = config_with_metadata(application, config_file, abs_name, ini_config, error_level, error_list, metaflags, metadata); } /* We opened the file we close it */ fclose(config_file); TRACE_FLOW_NUMBER("config_from_fd_with_metadata. Returns", error); return error; } /* Function to read the ini file with metadata * using file name. */ int config_from_file_with_metadata(const char *application, const char *config_filename, struct collection_item **ini_config, int error_level, struct collection_item **error_list, uint32_t metaflags, struct collection_item **metadata) { int error = EOK; TRACE_FLOW_STRING("config_from_file_with_metadata", "Entry"); error = config_from_fd_with_metadata(application, -1, config_filename, ini_config, error_level, error_list, metaflags, metadata); TRACE_FLOW_STRING("config_from_file_with_metadata", "Exit"); return error; } /* Read default config file and then overwrite it with a specific one * from the directory */ int config_for_app_with_metadata(const char *application, const char *config_file, const char *config_dir, struct collection_item **ini_config, int error_level, struct collection_item **error_set, uint32_t metaflags, struct collection_item **meta_default, struct collection_item **meta_appini) { int error = EOK; char *file_name; struct collection_item *error_list_common = NULL; struct collection_item *error_list_specific = NULL; struct collection_item **pass_common = NULL; struct collection_item **pass_specific = NULL; int created = 0; int tried = 0; int noents = 0; TRACE_FLOW_STRING("config_for_app", "Entry"); if (ini_config == NULL) { TRACE_ERROR_NUMBER("Invalid parameter", EINVAL); return EINVAL; } if ((config_file == NULL) && (config_dir == NULL)) { TRACE_ERROR_NUMBER("Noop call of the function is invalid", EINVAL); return EINVAL; } /* Prepare error collection pointers */ if (error_set != NULL) { TRACE_INFO_STRING("Error set is not NULL", "preparing error set"); pass_common = &error_list_common; pass_specific = &error_list_specific; *error_set = NULL; /* Construct the overarching error collection */ error = col_create_collection(error_set, FILE_ERROR_SET, COL_CLASS_INI_PESET); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to create collection", error); return error; } } else { TRACE_INFO_STRING("No error set. Errors will not be captured", ""); pass_common = NULL; pass_specific = NULL; } /* Create collection if needed */ if (*ini_config == NULL) { TRACE_INFO_STRING("New config collection. Allocate.", ""); error = col_create_collection(ini_config, application, COL_CLASS_INI_CONFIG); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to create collection", error); if (error_set) { col_destroy_collection(*error_set); *error_set = NULL; } return error; } created = 1; } /* Is the collection of the right class? */ else if ((col_is_of_class(*ini_config, COL_CLASS_INI_CONFIG) == 0) && (col_is_of_class(*ini_config, COL_CLASS_INI_META) == 0)) { TRACE_ERROR_NUMBER("Wrong collection type", EINVAL); return EINVAL; } /* Read master file */ if (config_file != NULL) { TRACE_INFO_STRING("Reading master file:", config_file); /* Get configuration information from the file */ error = config_from_file_with_metadata(application, config_file, ini_config, error_level, pass_common, metaflags, meta_default); tried++; /* ENOENT and EOK are Ok */ if (error) { if (error != ENOENT) { TRACE_ERROR_NUMBER("Failed to read master file", error); /* In case of error when we created collection - delete it */ if(error && created) { col_destroy_collection(*ini_config); *ini_config = NULL; } /* We do not clear the error_set here */ return error; } else noents++; } /* Add error results if any to the overarching error collection */ if ((pass_common != NULL) && (*pass_common != NULL)) { TRACE_INFO_STRING("Process errors resulting from file:", config_file); error = col_add_collection_to_collection(*error_set, NULL, NULL, *pass_common, COL_ADD_MODE_EMBED); if (error) { if (created) { col_destroy_collection(*ini_config); *ini_config = NULL; } if (error_set) { col_destroy_collection(*error_set); *error_set = NULL; } TRACE_ERROR_NUMBER("Failed to add error collection to another error collection", error); return error; } } } if (config_dir != NULL) { /* Get specific application file */ file_name = malloc(strlen(config_dir) + strlen(application) + NAME_OVERHEAD); if (file_name == NULL) { error = ENOMEM; TRACE_ERROR_NUMBER("Failed to allocate memory for file name", error); /* In case of error when we created collection - delete it */ if(created) { col_destroy_collection(*ini_config); *ini_config = NULL; } if (error_set) { col_destroy_collection(*error_set); *error_set = NULL; } return error; } /* It is safe to use sprintf() here */ sprintf(file_name, "%s%s%s.conf", config_dir, SLASH, application); TRACE_INFO_STRING("Opening file:", file_name); /* Read specific file */ error = config_from_file_with_metadata(application, file_name, ini_config, error_level, pass_specific, metaflags, meta_appini); tried++; free(file_name); /* ENOENT and EOK are Ok */ if (error) { if (error != ENOENT) { TRACE_ERROR_NUMBER("Failed to read specific application file", error); /* In case of error when we created collection - delete it */ if (error && created) { col_destroy_collection(*ini_config); *ini_config = NULL; } /* We do not clear the error_set here */ return error; } else noents++; } /* Add error results if any to the overarching error collection */ if ((pass_specific != NULL) && (*pass_specific != NULL)) { error = col_add_collection_to_collection(*error_set, NULL, NULL, *pass_specific, COL_ADD_MODE_EMBED); if (error) { if (created) { col_destroy_collection(*ini_config); *ini_config = NULL; } if (error_set) { col_destroy_collection(*error_set); *error_set = NULL; } TRACE_ERROR_NUMBER("Failed to add error collection to another error collection", error); return error; } } } /* If we failed to read or access file as many * times as we tried and we told to stop on any errors * we should report an error. */ TRACE_INFO_NUMBER("Tried:", tried); TRACE_INFO_NUMBER("Noents:", noents); if ((tried == noents) && (error_level == INI_STOP_ON_ANY)) { TRACE_ERROR_NUMBER("Fail to read or access all the files tried", ENOENT); if (created) { col_destroy_collection(*ini_config); *ini_config = NULL; } if (error_set) { col_destroy_collection(*error_set); *error_set = NULL; } return ENOENT; } TRACE_FLOW_STRING("config_to_collection", "Exit"); return EOK; } /* Function to return configuration data * for the application without meta data. */ int config_for_app(const char *application, const char *config_file, const char *config_dir, struct collection_item **ini_config, int error_level, struct collection_item **error_set) { int error = EOK; TRACE_FLOW_STRING("config_for_app", "Entry"); error = config_for_app_with_metadata(application, config_file, config_dir, ini_config, error_level, error_set, 0, NULL, NULL); TRACE_FLOW_NUMBER("config_for_app. Returning", error); return error; } ding-libs-0.6.2/ini/ini_config.cfg.doxy.in000066400000000000000000001755711417260640400203460ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "libini_config" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = "The $name class" \ "The $name widget" \ "The $name file" \ is \ provides \ specifies \ contains \ represents \ a \ an \ the # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@/ini_configobj.h @srcdir@/ini_configmod.h # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.c *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *_ut.c config.h # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = NO # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = YES #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES ding-libs-0.6.2/ini/ini_config.h000066400000000000000000002005311417260640400164300ustar00rootroot00000000000000/* INI LIBRARY Header file for reading configuration from INI file and storing as a collection. Copyright (C) Dmitri Pal 2009 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_CONFIG_H #define INI_CONFIG_H #include #include #include #include #include #include "collection.h" /** @mainpage The INI configuration interface * * The goal of the this interface is to allow applications * to read configuration from the INI file. * * So why yet another library to read data from INI file? * As we started the SSSD project we looked around for a * open source library that would meet the following * requirements: * - Is written in C (not C++) * - Is lightweight. * - Has an live community. * - Supported on multiple platforms . * - Can evolve as we build SSSD solution. * - Can deal with different types of values including arrays. * - Can deal with sections that are related to each other * and can form a hierarchy of sections. * - Has a compatible license we can use. * * We have seen several solutions but none was able to address our * requirements fully. As a result we started developing our own * INI parsing library. It is currently stable, however there is * a list of the enhancements that we eventually plan to implement. * One of the most interesting future features is the grammar * validation utility. It is targeted at helping to diagnose * a misconfiguration. * * Currently INI parser allows reading and merging INI files * and getting a resulting configuration in one object. * * One of the main differences of this interface is that * the library is created with the idea of reading the configuration * data not managing it. Thus currently you will not find * any function that alters the configuration data read from the files. * There is a set of proposed enhancements to be able to manipulate * the configuration data and save it back but there have been no real * driver for it. This API is focused on letting applications read data * from a file (or files) and interpret it, not to generate configuration * files. There are all sorts of different tools that already do that. * * The INI configuration interface uses COLLECTION (see libcollection * interface) to store data internally. * * Concepts: * - The INI file consists of the key value pairs. * - The keys and values are separated by the equal sign. * The spaces around equal sign are trimmed. Everything before the equal * sign is the key, everything after is the value. * - Comments are the lines that start with ";" or "#" in the first * position of the line. * - Library currently does not support multi-line values. * - The keys and values are read and stored in the internal * collection. * - More than one file can constitute the configuration for the application. * For example there can be a generic file in the /etc that * contains configuration for all the applications of this class running * on the box and then there might be a special file * with parameters specific for the application in the * /etc/whatever.d directory. Interface allows reading * both files in one call. The specific configuration for application * will overwrite the generic one. * - If there is no section in the file or there are key value pairs * declared before the first section those pairs will be placed into * the default section. * - The values are treated as strings. Spaces are trimmed at the beginning * and the end of the value. The value ends at the end of the line. * If values is too long an error will be returned. * - Parsing of the values happens when the caller tries to interpret * the value. The caller can use different functions to do this. * The value can be treated as numeric, logical, string, binary, * array of strings or array of numbers. In case of arrays the functions * accept separators that will be used to slice the value into the array * elements. * - If there is any error parsing the section and key values it can be * intercepted by the caller. There are different modes that the library * supports regarding error handling. See details in the description * of the individual functions. */ /** * @defgroup ini_config INI configuration interface * @{ */ /** * @defgroup constants Constants * @{ */ /** * @brief Name of the default section. * * This is the name of the implied section where orphan key-value * pairs will be put. */ #define INI_DEFAULT_SECTION "default" /** * @defgroup classes Collection classes * * INI uses COLLECTION library to store data. * It creates different objects with implied internal structure. * To be able to validate the objects * it is a good practice to define a class for each type of * the object. * * This section contains constants that define * internal collection classes used by INI interface. * They are exposed so that if you use collection for * other purposes you can make sure that the object classes * do not overlap. It is a good practice to avoid * them overlapping. Non-overlapping class space * would make internal type checking more effective * so that if an object of the wrong class is passed to * some interface the interface would be able to * check and detect an error. * * @{ */ /** @brief Base for the class definitions. */ #define COL_CLASS_INI_BASE 20000 /** * @brief Class for the configuration object. * * The configuration object consists of the collection * of collections where each sub collection is a section. * Application however should not assume that this always * be the case. Use only INI interface functions * get data from the configuration object. * Do not use the raw collection interface to get * data. */ #define COL_CLASS_INI_CONFIG COL_CLASS_INI_BASE + 0 /** * @brief A one level collection of key value pairs * where values are always strings. */ #define COL_CLASS_INI_SECTION COL_CLASS_INI_BASE + 1 /** * @brief A one level collection of parse errors. * * Collection stores \ref parse_error structures. */ #define COL_CLASS_INI_PERROR COL_CLASS_INI_BASE + 2 /** * @brief Collection of error collections. * * When multiple files are read during one call * each file has its own set of parsing errors * and warnings. This is the collection * of such sets. */ #define COL_CLASS_INI_PESET COL_CLASS_INI_BASE + 3 /** * @brief Collection of metadata. * * Collection that stores metadata. */ #define COL_CLASS_INI_META COL_CLASS_INI_BASE + 4 /** * @} */ /** * @defgroup errorlevel Error tolerance constants * * Constants in this section define what to do if * error or warning encountered while parsing the INI file. * * @{ */ /** @brief Fail if any problem is detected. */ #define INI_STOP_ON_ANY 0 /** @brief Best effort - do not fail. */ #define INI_STOP_ON_NONE 1 /** @brief Fail on errors only. */ #define INI_STOP_ON_ERROR 2 /** * @} */ /** * @defgroup parseerr Parsing errors and warnings * * @{ */ /** @brief Line is too long (Error). */ #define ERR_LONGDATA 1 /** @brief No closing bracket in section definition (Error). */ #define ERR_NOCLOSESEC 2 /** @brief Section name is missing (Error). */ #define ERR_NOSECTION 3 /** @brief Section name too long (Error). */ #define ERR_SECTIONLONG 4 /** @brief No equal sign (Error). */ #define ERR_NOEQUAL 5 /** @brief No key before equal sign (Error). */ #define ERR_NOKEY 6 /** @brief Key is too long (Error). */ #define ERR_LONGKEY 7 /** @brief Failed to read line (Error). */ #define ERR_READ 8 /** @brief Line starts with space when it should not (Error). */ #define ERR_SPACE 9 /** @brief Size of the error array. */ #define ERR_MAXPARSE ERR_SPACE /** * @} */ /** * @defgroup gramerr Grammar errors and warnings * * Placeholder for now. Reserved for future use. * * @{ */ #define ERR_MAXGRAMMAR 0 /** * @} */ /** * @defgroup valerr Validation errors and warnings * * Placeholder for now. Reserved for future use. * * @{ */ #define ERR_MAXVALID 0 /** * @} */ /** * @defgroup accesscheck Access control check flags * * @{ */ /** * @brief Validate access mode * * If this flag is specified the mode parameter * will be matched against the permissions set on the file * using the provided mask. */ #define INI_ACCESS_CHECK_MODE 0x00000001 /** * @brief Validate uid * * Provided uid will be checked against uid * of the file. */ #define INI_ACCESS_CHECK_UID 0x00000002 /** * @brief Validate gid * * Provided gid will be checked against gid * of the file. */ #define INI_ACCESS_CHECK_GID 0x00000004 /** * @} */ /** * @} */ /** * @defgroup structures Structures * @{ */ /** @brief Structure that holds error number and * line number for the encountered error. */ struct parse_error { unsigned line; int error; }; /** * @} */ /** * @defgroup metadata Meta data * * Metadata is a collection of a similar structure as any ini file. * The difference is that there are some predefined sections * and attributes inside these sections. * Using meta flags one can specify what section he is interested * in including into the meta data. If a flag for a corresponding * meta data section is specified the data for this section will * be included into the meta data collection. The caller can then * use meta data collection to get items from it and then get * a specific value using a corresponding conversion function. * * Think about the meta data as an INI file that looks like this: * * * [ACCESS] * - uid = \ * - gid = \ * - perm = \ * - name = \ * - created = \ * - modified = \ * - ... * * [ERROR] * - read_error = * - ... * * [TBD] * - ... * * * * The names of the keys and sections provide an example * of how the meta data is structured. Look information * about specific sections and available keys in this manual * to get the exact set of currently supported sections * and keys. * * @{ */ /** * @brief Collect only meta data. * * Special flag that indicates that only meta data * needs to be collected. No parsing should be performed. * */ #define INI_META_ACTION_NOPARSE 0x10000000 /** * @defgroup metasection Meta data section names * * @{ */ /** * @brief Meta data section that stores file access information * and ownership. */ #define INI_META_SEC_ACCESS "ACCESS" /** * @brief Meta data "access" section flag to include access section * into the output. */ #define INI_META_SEC_ACCESS_FLAG 0x00000001 /** * @defgroup metaaccesskeys Key names available in the "ACCESS" section * * @{ * */ /** * @brief The value for this key will store user ID of the INI file owner. * */ #define INI_META_KEY_UID "uid" /** * @brief The value for this key will store group ID of the INI file owner. * */ #define INI_META_KEY_GID "gid" /** * @brief The value for this key will store INI file access permissions. * */ #define INI_META_KEY_PERM "perm" /** * @brief The value for this key will store INI file device ID. * */ #define INI_META_KEY_DEV "dev" /** * @brief The value for this key will store INI file inode number. * */ #define INI_META_KEY_INODE "inode" /** * @brief The value for this key will store INI file modification time stamp. * */ #define INI_META_KEY_MODIFIED "modified" /** * @brief The value for this key will store INI file full name. * */ #define INI_META_KEY_NAME "name" /** * @} */ /** * @brief Meta data section that stores error related information. */ #define INI_META_SEC_ERROR "ERROR" /** * @brief Meta data "error" section flag to include access section * into the output. */ #define INI_META_SEC_ERROR_FLAG 0x00000002 /** * @defgroup metaerrorkeys Key names available in the "ERROR" section * * @{ * */ /** * @brief The value for this key will store read error when file was opened. * * If file was opened by caller first but this section was requested * the value will be zero. */ #define INI_META_KEY_READ_ERROR "read_error" /** * @} */ /** * @} */ /** * @} */ /** * @defgroup functions Functions * @{ */ /** * @brief Read configuration information from a file. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] config_filename Name of the config file, * if NULL the configuration * collection will be empty. * @param[out] ini_config If *ini_config is NULL * a new ini object will be * allocated, otherwise * the one that is pointed to * will be updated. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_list List of errors for the file * detected during parsing. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EMOMEM - No memory. * @return Any error returned by fopen(). * */ int config_from_file(const char *application, const char *config_filename, struct collection_item **ini_config, int error_level, struct collection_item **error_list); /** * @brief Read configuration information from a file descriptor. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] fd Previously opened file * descriptor for the config file. * @param[in] config_source Name of the file being parsed, * for use when printing the error * list. * @param[out] ini_config If *ini_config is NULL * a new ini object will be * allocated, otherwise * the one that is pointed to * will be updated. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_list List of errors for the file * detected during parsing. * * @return 0 - Success. * @return EMOMEM - No memory. * @return EINVAL - Invalid parameter. * */ int config_from_fd(const char *application, int fd, const char *config_source, struct collection_item **ini_config, int error_level, struct collection_item **error_list); /** * @brief Read configuration information from a file with * additional meta data. * * Meta data consists of addition information about * the file for example when it was created * or who is the owner. For the detailed description * of the meta data content and structure see * \ref metadata "meta data" section. * * If the metadata argument is not NULL * the calling function MUST always free meta data since it can * be allocated even if the function returned error. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] config_filename Name of the config file, * if NULL the configuration * collection will be empty. * @param[out] ini_config If *ini_config is NULL * a new ini object will be * allocated, otherwise * the one that is pointed to * will be updated. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_list List of errors for the file * detected during parsing. * @param[in] metaflags A bit mask of flags that define * what kind of metadata should * be collected. * @param[out] metadata Collection of metadata * values. See \ref metadata "meta data" * section for more details. * Can be NULL. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EMOMEM - No memory. * @return Any error returned by fopen(). * * */ int config_from_file_with_metadata( const char *application, const char *config_filename, struct collection_item **ini_config, int error_level, struct collection_item **error_list, uint32_t metaflags, struct collection_item **metadata); /** * @brief Read configuration information from a file descriptor * with additional meta data. * * Meta data consists of addition information about * the file for example when it was created * or who is the owner. For the detailed description * of the meta data content and structure see * \ref metadata "meta data" section. * * If the metadata argument is not NULL * the calling function MUST always free meta data since it can * be allocated even if the function returned error. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] fd Previously opened file * descriptor for the config file. * @param[in] config_source Name of the file being parsed, * for use when printing the error * list. * @param[out] ini_config If *ini_config is NULL * a new ini object will be * allocated, otherwise * the one that is pointed to * will be updated. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_list List of errors for the file * detected during parsing. * @param[in] metaflags A bit mask of flags that define * what kind of metadata should * be collected. * @param[out] metadata Collection of metadata * values. See \ref metadata "meta data" * section for more details. * Can be NULL. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EMOMEM - No memory. * */ int config_from_fd_with_metadata( const char *application, int fd, const char *config_source, struct collection_item **ini_config, int error_level, struct collection_item **error_list, uint32_t metaflags, struct collection_item **metadata); /** * @brief Read default configuration file and then * overwrite it with a specific one from the directory. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] config_file Name of the configuration file, * with default settings for all * appplications. * @param[in] config_dir Name of the directory where * the configuration files for * different applications reside. * Function will look for file * with the name constructed by * appending ".ini" to the end of * the "application" argument. * @param[out] ini_config A new configuration object. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_set Collection of error lists. * One list per file. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EMOMEM - No memory. * @return Any error returned by fopen(). */ int config_for_app(const char *application, const char *config_file, const char *config_dir, struct collection_item **ini_config, int error_level, struct collection_item **error_set); /** * @brief Read default configuration file and then * overwrite it with a specific one from the directory. * * If requested collect meta data for both. * * If the metadata argument is not NULL * the calling function MUST always free meta data since it can * be allocated even if the function returned error. * * @param[in] application Name of the application, * will be used as name of * the collection. * @param[in] config_file Name of the configuration file, * with default settings for all * appplications. * @param[in] config_dir Name of the directory where * the configuration files for * different applications reside. * Function will look for file * with the name constructed by * appending ".ini" to the end of * the "application" argument. * @param[out] ini_config A new configuration object. * @param[in] error_level Break for errors, warnings * or best effort (don't break). * @param[out] error_set Collection of error lists. * One list per file. * @param[in] metaflags A bit mask of flags that define * what kind of metadata should * be collected. * @param[out] meta_default Collection of metadata * values for the default common * config file for all applications. * See \ref metadata "meta data" * section for more details. * Can be NULL. * @param[out] meta_appini Collection of metadata * values for the application * specific config file. * See \ref metadata "meta data" * section for more details. * Can be NULL. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EMOMEM - No memory. * @return Any error returned by fopen(). */ int config_for_app_with_metadata( const char *application, const char *config_file, const char *config_dir, struct collection_item **ini_config, int error_level, struct collection_item **error_set, uint32_t metaflags, struct collection_item **meta_default, struct collection_item **meta_appini); /** * * @brief Function to check ownership and permissions * * The function allow caller to make decision * if the configuration file is from a trusted source * or not. * * The flags control how to perform check. * See \ref accesscheck "Access control check flags" * section for more information. * * @param[in] metadata Meta data object. * Can't be NULL. * @param[in] flags How and what to check. * Must be nonzero. * @param[in] uid UID to check. * @param[in] gid GID to check. * @param[in] mode Mode to check. * Only permission bits * are used. * @param[in] mask Which mode bits to check. * If 0 all permision bits * are checked. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EACCESS - File properties do not match provided * access parameters. */ int config_access_check(struct collection_item *metadata, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask); /** * @brief Function compares two meta data objects * * Function compares two meta data objects * to determine whether the configuration * has changed since last time the meta data * was collected. * The function checks three things about the * file: * - time stamp * - device ID * - i-node * If any of those changes function will indicate * that configuration changed. * * @param[in] metadata Recent meta data object. * @param[in] saved_metadata Previously saved meta * data object. * @param[out] changed Will be set to a nonzero value * if the configuration has changed. * * @return 0 - No internal error * @return EINVAL - Invalid argument * @return ENOENT - Expected value is missing * @return ENOMEM - No memory */ int config_changed(struct collection_item *metadata, struct collection_item *saved_metadata, int *changed); /** * @brief Function to free configuration object. * * @param[in] ini_config Configuration object. * */ void free_ini_config(struct collection_item *ini_config); /** * @brief Function to free configuration errors. * * @param[in] error_set Configuration error set object. * */ void free_ini_config_errors(struct collection_item *error_set); /** * @brief Function to free metadata. * * @param[in] metadata Configuration meta data object. * */ void free_ini_config_metadata(struct collection_item *metadata); /** * @brief Print errors and warnings that were detected while parsing one file. * * @param[in] file File descriptor. * @param[in] error_list List of the parsing errors. * */ void print_file_parsing_errors(FILE *file, struct collection_item *error_list); /** * @brief Print errors and warnings that were detected * parsing configuration as a whole. * * Use this function to print results of the config_for_app() call. * * @param[in] file File descriptor. * @param[in] error_set List of lists of the parsing errors. * */ void print_config_parsing_errors(FILE *file, struct collection_item *error_set); /** * @brief Get list of sections. * * Get list of sections from the configuration object * as an array of strings. * Function allocates memory for the array of the sections. * Use \ref free_section_list() to free allocated memory. * * @param[in] ini_config Configuration object. * @param[out] size If not NULL parameter will * receive number of sections * in the configuration. * @param[out] error If not NULL parameter will * receive the error code. * 0 - Success. * EINVAL - Invalid parameter. * ENOMEM - No memory. * * @return Array of strings. */ char **get_section_list(struct collection_item *ini_config, int *size, int *error); /** * @brief Free list of sections. * * The section array created by \ref get_section_list() * should be freed using this function. * * @param[in] section_list Array of strings returned by * \ref get_section_list() function. */ void free_section_list(char **section_list); /** * @brief Get list of attributes. * * Get list of attributes in a section as an array of strings. * Function allocates memory for the array of attributes. * Use \ref free_attribute_list() to free allocated memory. * * @param[in] ini_config Configuration object. * @param[in] section Section name. * @param[out] size If not NULL parameter will * receive number of attributes * in the section. * @param[out] error If not NULL parameter will * receive the error code. * 0 - Success. * EINVAL - Invalid parameter. * ENOMEM - No memory. * * @return Array of strings. */ char **get_attribute_list(struct collection_item *ini_config, const char *section, int *size, int *error); /** * @brief Free list of attributes. * * The attribute array created by \ref get_attribute_list() * should be freed using this function. * * @param[in] attr_list Array of strings returned by * \ref get_attribute_list() function. */ void free_attribute_list(char **attr_list); /** * @brief Get a configuration item form the configuration. * * Check return error code first. If the function returns * an error there is a serious problem. * Then check if item is found. Function will set * item parameter to NULL if no attribute with * provided name is found in the collection. * * @param[in] section Section name. * If NULL assumed default. * @param[in] name Attribute name to find. * @param[in] ini_config Configuration object to search. * @param[out] item Element of configuration * collection. * Will be set to NULL if * element with the given name * is not found. * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. * */ int get_config_item(const char *section, const char *name, struct collection_item *ini_config, struct collection_item **item); /** * @brief Convert item value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an integer number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from INT_MIN to INT_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int get_int_config_value(struct collection_item *item, int strict, int def, int *error); /** * @brief Convert item value to long number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into a long number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from LONG_MIN to LONG_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ long get_long_config_value(struct collection_item *item, int strict, long def, int *error); /** * @brief Convert item value to unsigned integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an unsigned integer number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to UINT_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned get_unsigned_config_value(struct collection_item *item, int strict, unsigned def, int *error); /** * @brief Convert item value to unsigned long number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an unsigned long number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULONG_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned long get_ulong_config_value(struct collection_item *item, int strict, unsigned long def, int *error); /** * @brief Convert item value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an int32_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from INT_MIN to INT_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int32_t get_int32_config_value(struct collection_item *item, int strict, int32_t def, int *error); /** * @brief Convert item value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an uint32_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULONG_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ uint32_t get_uint32_config_value(struct collection_item *item, int strict, uint32_t def, int *error); /** * @brief Convert item value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an int64_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from LLONG_MIN to LLONG_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int64_t get_int64_config_value(struct collection_item *item, int strict, int64_t def, int *error); /** * @brief Convert item value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an uint64_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULLONG_MAX. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ uint64_t get_uint64_config_value(struct collection_item *item, int strict, uint64_t def, int *error); /** * @brief Convert item value to floating point number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into a floating point number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ double get_double_config_value(struct collection_item *item, int strict, double def, int *error); /** * @brief Convert item value into a logical value. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into a Boolean. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned char get_bool_config_value(struct collection_item *item, unsigned char def, int *error); /** * @brief Get string configuration value * * Function creates a copy of the string value stored in the item. * Returned value needs to be freed after use. * If error occurred the returned value will be NULL. * * @param[in] item Item to use. * It must be retrieved using * \ref get_config_item(). * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - ENOMEM - No memory. * * @return Copy of the string or NULL. */ char *get_string_config_value(struct collection_item *item, int *error); /** * @brief Function returns the string stored in the item. * * Function returns a reference to the string value * stored inside the item. This string can't be altered. * The string will go out of scope if the item is deleted. * * @param[in] item Item to use. * It must be retrieved using * \ref get_config_item(). * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * * @return String from the item. */ const char *get_const_string_config_value(struct collection_item *item, int *error); /** * @brief Convert item value into a binary sequence. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into a sequence of bytes. * Any of the conversion functions * can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * The function allocates memory. * It is the responsibility of the caller to free it after use. * Use \ref free_bin_config_value() for this purpose. * Functions will return NULL if conversion failed. * * Function assumes that the value being interpreted * has a special format. * The string should be taken in single quotes * and consist of hex encoded value represented by * two hex digits per byte. * Case does not matter. * * Example: '0a2BFeCc' * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[out] length Variable that optionally receives * the length of the binary * sequence. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ENOMEM - No memory. * * @return Converted value. * In case of failure the function returns NULL. */ char *get_bin_config_value(struct collection_item *item, int *length, int *error); /** * @brief Free binary buffer * * Free binary value returned by \ref get_bin_config_value(). * * @param[in] bin Binary buffer to free. * */ void free_bin_config_value(char *bin); /** * @brief Convert value to an array of strings. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an array of strings. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * Separator string includes up to three different separators. * If separator NULL, comma is assumed. * The spaces are trimmed automatically around separators * in the string. * The function drops empty tokens from the list. * This means that the string like this: "apple, ,banana, ,orange ," * will be translated into the list of three items: * "apple","banana" and "orange". * * The length of the allocated array is returned in "size". * Size and error parameters can be NULL. * Use \ref free_string_config_array() to free the array after use. * * The array is always NULL terminated so * it is safe not to get size and just loop until * array element is NULL. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] sep String cosisting of separator * symbols. For example: ",.;" would mean * that comma, dot and semicolon * should be treated as separators * in the value. * @param[out] size Variable that optionally receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of strings. * In case of failure the function returns NULL. */ char **get_string_config_array(struct collection_item *item, const char *sep, int *size, int *error); /** * @brief Convert value to an array of strings. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an array of strings. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * Separator string includes up to three different separators. * If separator NULL, comma is assumed. * The spaces are trimmed automatically around separators * in the string. * The function does not drop empty tokens from the list. * This means that the string like this: "apple, ,banana, ,orange ," * will be translated into the list of five items: * "apple", "", "banana", "" and "orange". * * The length of the allocated array is returned in "size". * Size and error parameters can be NULL. * Use \ref free_string_config_array() to free the array after use. * * The array is always NULL terminated so * it is safe not to get size and just loop until * array element is NULL. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[in] sep String cosisting of separator * symbols. For example: ",.;" would mean * that comma, dot and semicolon * should be treated as separators * in the value. * @param[out] size Variable that optionally receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of strings. * In case of failure the function returns NULL. */ char **get_raw_string_config_array(struct collection_item *item, const char *sep, int *size, int *error); /** * @brief Convert value to an array of long values. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an array of long values. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * Separators inside the string are detected automatically. * The spaces are trimmed automatically around separators * in the string. * * The length of the allocated array is returned in "size". * Size parameter can't be NULL. * * Use \ref free_long_config_array() to free the array after use. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[out] size Variable that receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ERANGE - Value is out of range. * - ENOMEM - No memory. * * @return Array of long values. * In case of failure the function returns NULL. */ long *get_long_config_array(struct collection_item *item, int *size, int *error); /** * @brief Convert value to an array of floating point values. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration item * into an array of floating point values. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the item. * The results can be different depending upon * how the caller tries to interpret the value. * * Separators inside the string are detected automatically. * The spaces are trimmed automatically around separators * in the string. * * The length of the allocated array is returned in "size". * Size parameter can't be NULL. * * Use \ref free_double_config_array() to free the array after use. * * @param[in] item Item to interpret. * It must be retrieved using * \ref get_config_item(). * @param[out] size Variable that receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of floating point values. * In case of failure the function returns NULL. */ double *get_double_config_array(struct collection_item *item, int *size, int *error); /** * @brief Free array of string values. * * Use this function to free the array returned by * \ref get_string_config_array() or by * \ref get_raw_string_config_array(). * * @param[in] str_config Array of string values. */ void free_string_config_array(char **str_config); /** * @brief Free array of long values. * * Use this function to free the array returned by * \ref get_long_config_array(). * * @param[in] array Array of long values. */ void free_long_config_array(long *array); /** * @brief Free array of floating pointer values. * * Use this function to free the array returned by * \ref get_double_config_array(). * * @param[in] array Array of floating pointer values. */ void free_double_config_array(double *array); /** * @} */ #endif ding-libs-0.6.2/ini/ini_config.pc.in000066400000000000000000000005531417260640400172120ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: ini_config Description: Library to process config files in INI format into a libcollection data structure Version: @INI_CONFIG_VERSION@ Requires: basicobjects ref_array collection Libs: -L${libdir} -lini_config Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/ini/ini_config_priv.h000066400000000000000000000064211417260640400174720ustar00rootroot00000000000000/* INI LIBRARY Header for the internal structures used by INI interface. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_CONFIG_PRIV_H #define INI_CONFIG_PRIV_H #include #include #include #include "collection.h" #include "simplebuffer.h" #include "ini_comment.h" /* Configuration object */ struct ini_cfgobj { /* For now just a collection */ struct collection_item *cfg; /* Boundary */ uint32_t boundary; /* Last comment */ struct ini_comment *last_comment; /* Last search state */ char *section; char *name; int section_len; int name_len; struct collection_iterator *iterator; /* Collection of errors detected during parsing */ struct collection_item *error_list; /* Count of error lines */ unsigned count; /*... */ /* Statistics? Timestamps? When created? Modified? - TBD */ /*... */ }; /* Configuration file object */ struct ini_cfgfile { /***********************************/ /* Externally controlled variables */ /***********************************/ /* File name for the configuration file */ char *filename; /* File stream */ FILE *file; /* What meta data to collect */ uint32_t metadata_flags; /**********************/ /* Internal variables */ /**********************/ /* File stats */ struct stat file_stats; /* Were stats read ? */ int stats_read; /* Internal buffer */ struct simplebuffer *file_data; /* BOM indicator */ enum index_utf_t bom; }; /* Parsing error */ struct ini_parse_error { unsigned line; int error; }; /* Internal cleanup callback */ void ini_cleanup_cb(const char *property, int property_len, int type, void *data, int length, void *custom_data); /* Get parsing error */ const char *ini_get_error_str(int parsing_error, int family); /* Check if collision flags are valid */ int valid_collision_flags(uint32_t collision_flags); /* Empty section */ int empty_section(struct collection_item *sec); /* Internal access check function */ int access_check_int(struct stat *file_stats, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask); struct ini_errmsg; struct ini_errobj { size_t count; struct ini_errmsg *first_msg; struct ini_errmsg *last_msg; struct ini_errmsg *cur_msg; }; struct ini_errmsg { char *str; struct ini_errmsg *next; }; #endif ding-libs-0.6.2/ini/ini_config_ut.c000066400000000000000000001340651417260640400171430ustar00rootroot00000000000000/* INI LIBRARY Unit test for the INI library. Copyright (C) Dmitri Pal 2009 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #define TRACE_HOME #include "trace.h" #include "ini_config.h" #include "collection.h" #include "collection_tools.h" int verbose = 0; #define COLOUT(foo) \ do { \ if (verbose) foo; \ } while(0) static int basic_test(void) { int error; struct collection_item *ini_config = NULL; struct collection_item *error_set = NULL; error = config_for_app("test", NULL, NULL, &ini_config, INI_STOP_ON_NONE, &error_set); if (error != EINVAL) { printf("Expected error EINVAL got somethign else: %d\n", error); return EINVAL; } error = config_for_app("test", "foo", "bar", &ini_config, INI_STOP_ON_ANY, &error_set); if (error != ENOENT) { printf("Expected error ENOENT got somethign else: %d\n", error); return ENOENT; } error = config_for_app("test", "./ini.conf", "./ini.d", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { printf("Attempt to read configuration returned error: %d\n", error); return error; } COLOUT(col_debug_collection(ini_config,COL_TRAVERSE_DEFAULT)); COLOUT(col_print_collection(ini_config)); COLOUT(col_print_collection(error_set)); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_config_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); free_ini_config(ini_config); free_ini_config_errors(error_set); return 0; } static int single_file(void) { int error; struct collection_item *ini_config = NULL; struct collection_item *error_set = NULL; struct collection_item *metadata = NULL; uint32_t flags; error = config_from_file("test", "./not_exist_ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { COLOUT(printf("Attempt to read configuration returned error: %d." " EXPECTED.\n\n", error)); if(error != ENOENT) return error; } error = config_from_file("test", "./ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { printf("Attempt to read configuration returned error: %d\n", error); return error; } COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(col_print_collection(ini_config)); COLOUT(col_print_collection(error_set)); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_file_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); free_ini_config(ini_config); free_ini_config_errors(error_set); ini_config = NULL; error_set = NULL; COLOUT(printf("TEST WITH METADATA NO PARSE\n")); flags = INI_META_SEC_ACCESS_FLAG | INI_META_SEC_ERROR_FLAG | INI_META_ACTION_NOPARSE; error = config_from_file_with_metadata("test", "./ini.conf", &ini_config, INI_STOP_ON_NONE, NULL, flags, &metadata); if (error) { printf("Attempt to read configuration returned error: %d\n",error); if (metadata) { printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); } free_ini_config_metadata(metadata); return error; } if (ini_config) { printf("Expected no config but got some.\n"); col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT); free_ini_config(ini_config); printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); free_ini_config_metadata(metadata); return EINVAL; } COLOUT(printf("\n\nMeta data\n")); COLOUT(col_debug_collection(metadata, COL_TRAVERSE_DEFAULT)); free_ini_config_metadata(metadata); COLOUT(printf("\n\n----------------------\n")); error = config_from_file_with_metadata("test", "./ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set, 0, NULL); if (error) { printf("Attempt to read configuration returned error: %d\n",error); print_file_parsing_errors(stdout, error_set); free_ini_config_errors(error_set); return error; } COLOUT(printf("\n\n----------------------\n")); COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_file_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); free_ini_config(ini_config); free_ini_config_errors(error_set); return 0; } static int single_fd(void) { int error; struct collection_item *ini_config = NULL; struct collection_item *error_set = NULL; struct collection_item *metadata = NULL; uint32_t flags; int fd = open("./ini.conf", O_RDONLY); if (fd < 0) { error = errno; printf("Attempt to read configuration returned error: %d\n", error); return error; } error = config_from_fd("test", fd, "./ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { printf("Attempt to read configuration returned error: %d\n",error); return error; } COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(col_print_collection(ini_config)); COLOUT(col_print_collection(error_set)); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_file_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); free_ini_config(ini_config); free_ini_config_errors(error_set); close(fd); ini_config = NULL; error_set = NULL; COLOUT(printf("TEST WITH FILE FD & META DATA\n")); fd = open("./ini.conf", O_RDONLY); if (fd < 0) { error = errno; printf("Attempt to read configuration returned error: %d\n", error); return error; } flags = INI_META_SEC_ACCESS_FLAG | INI_META_SEC_ERROR_FLAG | INI_META_ACTION_NOPARSE; error = config_from_fd_with_metadata("test", fd, "./ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set, flags, &metadata); if (error) { printf("Attempt to read configuration returned error: %d\n",error); printf("\n\nErrors\n"); print_file_parsing_errors(stdout, error_set); free_ini_config_errors(error_set); if (metadata) { printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); } free_ini_config_metadata(metadata); return error; } if (ini_config) { printf("Expected no config but got some.\n"); col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT); free_ini_config(ini_config); return EINVAL; } COLOUT(printf("\n\nMeta data\n")); COLOUT(col_debug_collection(metadata, COL_TRAVERSE_DEFAULT)); free_ini_config_metadata(metadata); error = config_from_fd_with_metadata("test", fd, "./ini.conf", &ini_config, INI_STOP_ON_NONE, &error_set, 0, NULL); close(fd); if (error) { printf("Attempt to read configuration returned error: %d\n",error); printf("\n\nErrors\n"); print_file_parsing_errors(stdout, error_set); free_ini_config_errors(error_set); return error; } COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_file_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); free_ini_config(ini_config); free_ini_config_errors(error_set); return 0; } static int negative_test(void) { int error; unsigned int count; struct collection_item *ini_config = NULL; /* App name is null - expect failure */ error = config_for_app(NULL, NULL, NULL, NULL, INI_STOP_ON_NONE, NULL); if (!error) { printf("Expected error: %d got success\n", EINVAL); return -1; } /* Config collection storage is NULL - expect failure */ error = config_for_app("real", NULL, NULL, NULL, INI_STOP_ON_NONE, NULL); if (!error) { printf("Expected error: %d got success\n", EINVAL); return -1; } /* Config collection storage is NULL - expect failure */ error = config_for_app("real", "real.conf", NULL, NULL, INI_STOP_ON_NONE, NULL); if (!error) { printf("Expected error: %d got success\n", EINVAL); return -1; } /* Expect success but empty config */ error = config_for_app("real", "real.conf", NULL, &ini_config, INI_STOP_ON_NONE, NULL); if (error) { printf("Expected success got error: %d\n",error); return error; } count = 0; (void)col_get_collection_count(ini_config, &count); if (count > 1) { printf("Expected empty collection but" " got contents with %d elements\n", count); col_print_collection(ini_config); return -1; } free_ini_config(ini_config); return 0; } static int real_test(const char *file) { int error; struct collection_item *ini_config = NULL; struct collection_item *error_set = NULL; struct collection_iterator *iterator = NULL; struct collection_item *item = NULL; int type; COLOUT(printf("\n\n===== REAL TEST START ======\n")); COLOUT(printf("Reading collection\n")); error = config_for_app("real", file, "./ini.d", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { printf("Attempt to read configuration returned error: %d\n", error); return error; } COLOUT(printf("Debugging the config collection:\n")); COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Debugging the error collection:\n")); COLOUT(col_debug_collection(error_set, COL_TRAVERSE_DEFAULT)); COLOUT(printf("About to print parsing errors:\n")); COLOUT(printf("\n\n----------------------\n")); /* Output parsing errors (if any) */ COLOUT(print_config_parsing_errors(stdout, error_set)); COLOUT(printf("----------------------\n\n\n")); COLOUT(printf("About to bind iterator to print" " the config file contents.\n")); /* Bind iterator */ error = col_bind_iterator(&iterator, ini_config, COL_TRAVERSE_DEFAULT|COL_TRAVERSE_END); if (error) { printf("Failed to bind iterator: %d\n",error); col_destroy_collection(ini_config); col_destroy_collection(error_set); return error; } COLOUT(printf("About to start iteration loop.\n")); do { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { printf("Error iterating collection: %d", error); col_unbind_iterator(iterator); return error; } /* Are we done ? */ if (item == NULL) break; type = col_get_item_type(item); /* Start of the collection */ if (type == COL_TYPE_COLLECTION) COLOUT(printf("Contents of the application's configuration %s\n", col_get_item_property(item, NULL))); /* End of section */ else if (type == COL_TYPE_END) COLOUT(printf("\n")); /* Section header ? */ else if (type == COL_TYPE_COLLECTIONREF) COLOUT(printf("[%s]\n", col_get_item_property(item, NULL))); /* Anything else - we know they are all strings*/ else COLOUT(printf("%s = %s\n", col_get_item_property(item, NULL), (char *)col_get_item_data(item))); } while(1); /* Do not forget to unbind iterator - otherwise there will be a leak */ COLOUT(printf("About to clean up.\n")); col_unbind_iterator(iterator); free_ini_config(ini_config); free_ini_config_errors(error_set); return 0; } static int get_test(void) { int error; struct collection_item *ini_config = NULL; struct collection_item *error_set = NULL; struct collection_item *item = NULL; int number; long number_long; double number_double; unsigned number_unsigned; unsigned long number_ulong; unsigned char logical = 0; char *str; const char *cstr; const char *cstrn; void *binary; int length; int i = 0; char **strarray; char **strptr; int size; long *array; double *darray; char **prop_array; int32_t val_int32; uint32_t val_uint32; int64_t val_int64; uint64_t val_uint64; COLOUT(printf("\n\n===== GET TEST START ======\n")); COLOUT(printf("Reading collection\n")); error = config_for_app("real", NULL, "./ini.d", &ini_config, INI_STOP_ON_NONE, &error_set); if (error) { printf("Attempt to read configuration returned error: %d\n", error); return error; } COLOUT(printf("Debugging the config collection:\n")); COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); COLOUT(printf("Debugging the error collection:\n")); COLOUT(col_debug_collection(error_set, COL_TRAVERSE_DEFAULT)); free_ini_config_errors(error_set); COLOUT(printf("Negtive test - trying to get non" " existing key-value pair.\n")); /* Negative test */ item = NULL; error = get_config_item("monitor1", "description1", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should not be found */ if (item != NULL) { printf("Expected NULL but got something else!\n"); free_ini_config(ini_config); return -1; } /* Another negative test but section exists this time */ item = NULL; error = get_config_item("monitor", "description1", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should not be found */ if(item != NULL) { printf("Expected NULL but got something else!\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Trying to get an item.\n")); /* Positive test */ item = NULL; error = get_config_item("monitor", "description", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should be found */ if (item == NULL) { printf("Expected item but got something NULL!\n"); free_ini_config(ini_config); return -1; } COLOUT(col_debug_item(item)); COLOUT(printf("Get item as string without duplication" " from the NULL item.\n")); /* Get a string without duplicication */ /* Negative test */ cstrn = get_const_string_config_value(NULL, NULL); if (cstrn != NULL) { printf("Expected error got success.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Get item as string without duplication" "from the correct item.\n")); /* Now get string from the right item */ error = 0; cstr = get_const_string_config_value(item, &error); if (error) { printf("Expected success got error %d.\n", error); free_ini_config(ini_config); return error; } COLOUT(printf("Value: [%s]\n", cstr)); /* Same thing but create a dup */ COLOUT(printf("Get item as string with duplication" " from correct item.\n")); error = 0; str = get_string_config_value(item, &error); if (error) { printf("Expected success got error %d.\n", error); free_ini_config(ini_config); return error; } COLOUT(printf("Value: [%s]\n", str)); free(str); /* Get a badly formated number */ COLOUT(printf("Convert item to number with strict conversion.\n")); item = NULL; error = get_config_item("monitor", "bad_number", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should be found */ if (item == NULL) { printf("Expected item but got something NULL!\n"); free_ini_config(ini_config); return -1; } COLOUT(col_debug_item(item)); /* Now try to get value in different ways */ error = 0; number = get_int_config_value(item, 1, 10, &error); if (error) { /* We expected error in this case */ COLOUT(printf("Expected error.\n")); if(number != 10) { printf("It failed to set default value.\n"); free_ini_config(ini_config); return -1; } } COLOUT(printf("Convert item to number without strict conversion.\n")); error = 0; number = get_int_config_value(item, 0, 10, &error); if (error) { /* We expected error in this case */ printf("Did not expect error.\n"); free_ini_config(ini_config); return error; } if (number != 5) { /* We expected error in this case */ printf("We expected that the conversion will return 5.\n"); free_ini_config(ini_config); return -1; } /* Get real integer */ COLOUT(printf("Fetch another item from section \"domains/LOCAL\"" " named \"enumerate\".\n")); item = NULL; error = get_config_item("domains/LOCAL","enumerate", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should be found */ if (item == NULL) { printf("Expected success but got NULL.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Convert item to integer.\n")); /* Take number out of it */ error = 0; number = get_int_config_value(item, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); free_ini_config(ini_config); return error; } /* It is 3 in the file */ if (number != 3) { printf("We expected that the conversion will return 3.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Expected 3 got %d\n", number)); COLOUT(printf("Convert item to long.\n")); /* Take number out of it */ error = 0; number_long = get_long_config_value(item, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); free_ini_config(ini_config); return error; } /* It is 3 in the file */ if (number_long != 3) { printf("We expected that the conversion will return 3.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Expected 3 got %ld\n", number_long)); COLOUT(printf("Convert item to unsigned.\n")); /* Take number out of it */ error = 0; number_unsigned = get_unsigned_config_value(item, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); free_ini_config(ini_config); return error; } /* It is 3 in the file */ if(number_unsigned != 3) { printf("We expected that the conversion will return 3.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Expected 3 got %d\n", number_unsigned)); COLOUT(printf("Convert item to unsigned long.\n")); /* Take number out of it */ error = 0; number_ulong = get_ulong_config_value(item, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); free_ini_config(ini_config); return error; } /* It is 3 in the file */ if (number_ulong != 3) { printf("We expected that the conversion will return 3.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Expected 3 got %lu\n", number_ulong)); COLOUT(printf("Convert item to double.\n")); /* Take number out of it */ error = 0; number_double = get_double_config_value(item, 1, 100., &error); if (error) { printf("Did not expect error. Got %d\n", error); free_ini_config(ini_config); return error; } /* It is 3 in the file */ if (number_double != 3.) { printf("We expected that the conversion will return 3.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Expected 3 got %e\n", number_double)); COLOUT(printf("Convert item to bool.\n")); /* Take number out of it */ error = 0; logical = get_bool_config_value(item, 1, &error); if (!error) { printf("Expect error. Got success. Value %d\n", (int) logical); free_ini_config(ini_config); return -1; } /* Get real bool item and convert it */ COLOUT(printf("Get real bool item \"legacy\" and convert it.\n")); item = NULL; error = get_config_item("domains/LOCAL","legacy", ini_config, &item); if (error) { printf("Expected success but got error! %d\n",error); free_ini_config(ini_config); return error; } /* Item should be found */ if (item == NULL) { printf("Expected success but got NULL.\n"); free_ini_config(ini_config); return -1; } COLOUT(printf("Convert item to bool.\n")); error = 0; logical = get_bool_config_value(item, 1, &error); if (error) { printf("Expect success got error %d.\n", error); free_ini_config(ini_config); return error; } if (logical) { printf("Expected false but got true - bad.\n"); return -1; } COLOUT(printf("In the files it is FALSE so we got false.\n")); COLOUT(printf("Get binary item\n")); item = NULL; error = get_config_item("domains/EXAMPLE.COM", "binary_test", ini_config, &item); if (error) { printf("Expected success but got error! %d\n", error); free_ini_config(ini_config); return error; } /* Item should be found */ if (item == NULL) { printf("Expected success but got NULL.\n"); free_ini_config(ini_config); return -1; } COLOUT(col_debug_item(item)); error = 0; binary = get_bin_config_value(item, &length, &error); if (error) { printf("Expect success got error %d.\n", error); free_ini_config(ini_config); return error; } COLOUT(printf("Binary value (expect 123) = ")); COLOUT(for (i=0;i */ if (error_set) { printf("\n\nErrors\n"); col_debug_collection(error_set, COL_TRAVERSE_DEFAULT); } /* <==== end */ free_ini_config_errors(error_set); return error; } free_ini_config_errors(error_set); /* So we are here if we successfully got configuration. */ /* You can check ownership and permissions here in one call */ /* We will check just permissions here. */ error = config_access_check(metadata, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0440, /* Checking for r--r----- */ 0); /* This check is expected to fail since * the actual permissions on the test file are: rw-rw-r-- */ if (!error) { printf("Expected error got success!\n"); free_ini_config_metadata(metadata); free_ini_config(ini_config); return EACCES; } error = config_access_check(metadata, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0664, /* Checkling for rw-rw-r-- */ 0); if (error) { printf("Access check failed %d!\n", error); free_ini_config_metadata(metadata); free_ini_config(ini_config); return EACCES; } /* Use configuration */ COLOUT(printf("\n\nMeta data\n")); COLOUT(col_debug_collection(metadata, COL_TRAVERSE_DEFAULT)); free_ini_config_metadata(metadata); COLOUT(printf("\n\n----------------------\n")); COLOUT(printf("\n\nConfiguration\n")); COLOUT(col_debug_collection(ini_config, COL_TRAVERSE_DEFAULT)); free_ini_config(ini_config); return 0; } static int reload_test(void) { int error; struct collection_item *ini_config = NULL; struct collection_item *metadata = NULL; struct collection_item *saved_metadata = NULL; uint32_t flags; int changed = 0; int fd; COLOUT(printf("RELOAD TEST\n")); /* Assume we saved metadata at the beginning * when we opened the file and read configuration * for the first time. * Here we have to emulate it. */ flags = INI_META_SEC_ACCESS_FLAG | INI_META_ACTION_NOPARSE; error = config_from_file_with_metadata("test", "./ini.conf", &ini_config, 0, NULL, flags, &saved_metadata); if (error) { printf("Attempt to read configuration returned error: %d\n",error); free_ini_config_metadata(saved_metadata); return error; } /*****************************************/ /* We are reloading so we probably doing it becuase * we got a signal ot some kind of time out expired * and it might be time for us to check if we need * to reload. So assume it is time to check... */ /* It is safer to open file first */ fd = open("./ini.conf", O_RDONLY); if (fd < 0) { error = errno; printf("Attempt to read configuration returned error: %d\n", error); free_ini_config_metadata(saved_metadata); return error; } /* You migth be checking pretty frequently, once in 5 min for example * but the config usually does not change for months * so you do not want to do any extra processing every time you check. */ /* Do permission check here right away on the file, or... */ flags = INI_META_SEC_ACCESS_FLAG | INI_META_ACTION_NOPARSE; error = config_from_fd_with_metadata("test", fd, "./ini.conf", &ini_config, 0, NULL, flags, &metadata); if (error) { printf("Attempt to read configuration returned error: %d\n",error); if (metadata) { printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); } free_ini_config_metadata(metadata); free_ini_config_metadata(saved_metadata); close(fd); return error; } /* ...or you can do permission check here using the metadata * as it is done in the startup test. * For now we skip this part and move on. */ error = config_changed(metadata, saved_metadata, &changed); if (error) { printf("Internal error: %d\n",error); printf("\n\nSaved Meta data\n"); col_debug_collection(saved_metadata, COL_TRAVERSE_DEFAULT); printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); free_ini_config_metadata(saved_metadata); free_ini_config_metadata(metadata); close(fd); return error; } if (changed) { /* Read the config from the descriptor and use it. * Discard old saved meta data and save * the latest one for future use... */ /* Here it would be an error if it is different */ printf("Meta data is supposed to be same but different.\n"); printf("\n\nSaved Meta data\n"); col_debug_collection(saved_metadata, COL_TRAVERSE_DEFAULT); printf("\n\nMeta data\n"); col_debug_collection(metadata, COL_TRAVERSE_DEFAULT); } free_ini_config_metadata(saved_metadata); free_ini_config_metadata(metadata); close(fd); return 0; } int main(int argc, char *argv[]) { int error = EOK; char *srcdir = NULL; char *rundir = NULL; const char inidir[] = "/ini"; int len = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } COLOUT(printf("Start\n")); srcdir = getenv("srcdir"); if(srcdir) { len = strlen(srcdir) + sizeof(inidir); rundir = malloc(len); if (!rundir) { printf("Failed to allocate memory to store path" " to the test files %d.\n", ENOMEM); return -1; } snprintf(rundir, len, "%s%s", srcdir, inidir); errno = 0; if(chdir(rundir) != 0) { error = errno; free(rundir); printf("Failed to change directory, error %d\n", error); return error; } free(rundir); } if ((error = basic_test()) || (error = single_file()) || (error = single_fd()) || (error = negative_test()) || (error = real_test(NULL)) || /* This should result in merged configuration */ (error = real_test("./ini.conf")) || (error = startup_test()) || (error = reload_test()) || (error = get_test())) { printf("Test failed! Error %d.\n", error); return -1; } COLOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_configmod.c000066400000000000000000001522511417260640400171300ustar00rootroot00000000000000/* INI LIBRARY Implementation of the modification interface. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include "trace.h" #include "ref_array.h" #include "simplebuffer.h" #include "collection.h" #include "ini_comment.h" #include "ini_defines.h" #include "ini_valueobj.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "ini_configmod.h" /* Which kind of search we should use? */ #define EXACT(a) ((a == INI_VA_MOD_E) || (a == INI_VA_MODADD_E)) ? 1 : 0 static void cb(const char *property, int property_len, int type, void *data, int length, void *ext_data); /* Delete value by key or position */ int ini_config_delete_value(struct ini_cfgobj *ini_config, const char *section, int position, const char *key, int idx) { int error = EOK; struct value_obj *vo = NULL; struct collection_item *item = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (!key) { TRACE_ERROR_STRING("Invalid argument","key"); return EINVAL; } if (idx < 0) { TRACE_ERROR_STRING("Invalid argument","idx"); return EINVAL; } error = col_extract_item(ini_config->cfg, section, position, key, idx, COL_TYPE_ANY, &item); if (error) { TRACE_ERROR_NUMBER("Item not found or error", error); return error; } vo = *((struct value_obj **)(col_get_item_data(item))); value_destroy(vo); col_delete_item(item); TRACE_FLOW_EXIT(); return error; } /* Updates a comment for value that is found by seaching for a specific key */ int ini_config_update_comment(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *comments[], size_t count_comment, int idx) { int error = EOK; struct ini_comment *ic = NULL; struct value_obj *vo = NULL; struct collection_item *item = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (!key) { TRACE_ERROR_STRING("Invalid argument","key"); return EINVAL; } if (idx < 0) { TRACE_ERROR_STRING("Invalid argument","idx"); return EINVAL; } /* Look for the exact item */ error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, idx, 1, &item); if (error) { TRACE_ERROR_NUMBER("Item not found or error", error); return error; } /* If item not found return error */ if (!item) { TRACE_ERROR_NUMBER("Item not found.", ENOENT); return ENOENT; } /* Build comment */ if (comments) { error = ini_comment_construct(comments, count_comment, &ic); if (error) { TRACE_ERROR_NUMBER("Failed to construct comment", error); return error; } } vo = *((struct value_obj **)(col_get_item_data(item))); /* Replace comment with the new one. Old one is freed by the function */ error = value_put_comment(vo, ic); if (error) { TRACE_ERROR_NUMBER("Faile to update comment.", error); ini_comment_destroy(ic); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Add or modify a value that stores array of integers */ int ini_config_add_int_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int *value_int_arr, size_t count_int, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char **str_arr = NULL; size_t i = 0; size_t j = 0; TRACE_FLOW_ENTRY(); if (!count_int) { TRACE_ERROR_STRING("Invalid argument","count_int"); return EINVAL; } str_arr = calloc(count_int, sizeof(char *)); if (!str_arr) { TRACE_ERROR_STRING("Failed to allocate memory for string array", ENOMEM); return ENOMEM; } for (i = 0; i < count_int; i++) { ret = asprintf(&str_arr[i], "%d", value_int_arr[i]); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ for (j = 0; j < i; j++) free(str_arr[j]); free(str_arr); return ENOMEM; } } error = ini_config_add_str_arr_value(ini_config, section, key, str_arr, count_int, sep, comments, count_comment, border, position, other_key, idx, flags); for (i = 0; i < count_int; i++) free(str_arr[i]); free(str_arr); TRACE_FLOW_RETURN(error); return error; } /* Add or modify a value that stores array of long ints */ int ini_config_add_long_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, long *value_long_arr, size_t count_long, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char **str_arr = NULL; size_t i = 0; size_t j = 0; TRACE_FLOW_ENTRY(); if (!count_long) { TRACE_ERROR_STRING("Invalid argument","count_long"); return EINVAL; } str_arr = calloc(count_long, sizeof(char *)); if (!str_arr) { TRACE_ERROR_STRING("Failed to allocate memory for string array", ENOMEM); return ENOMEM; } for (i = 0; i < count_long; i++) { ret = asprintf(&str_arr[i], "%ld", value_long_arr[i]); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ for (j = 0; j < i; j++) free(str_arr[j]); free(str_arr); return ENOMEM; } } error = ini_config_add_str_arr_value(ini_config, section, key, str_arr, count_long, sep, comments, count_comment, border, position, other_key, idx, flags); for (i = 0; i < count_long; i++) free(str_arr[i]); free(str_arr); TRACE_FLOW_RETURN(error); return error; } /* Add or modify a value that stores array of doubles */ int ini_config_add_double_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, double *value_double_arr, size_t count_double, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char **str_arr = NULL; size_t i = 0; size_t j = 0; TRACE_FLOW_ENTRY(); if (!count_double) { TRACE_ERROR_STRING("Invalid argument","count_double"); return EINVAL; } str_arr = calloc(count_double, sizeof(char *)); if (!str_arr) { TRACE_ERROR_STRING("Failed to allocate memory for string array", ENOMEM); return ENOMEM; } for (i = 0; i < count_double; i++) { ret = asprintf(&str_arr[i], "%f", value_double_arr[i]); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ for (j = 0; j < i; j++) free(str_arr[j]); free(str_arr); return ENOMEM; } } error = ini_config_add_str_arr_value(ini_config, section, key, str_arr, count_double, sep, comments, count_comment, border, position, other_key, idx, flags); for (i = 0; i < count_double; i++) free(str_arr[i]); free(str_arr); TRACE_FLOW_RETURN(error); return error; } /* Add or modify a value that stores array of strings */ int ini_config_add_const_str_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *value_str_arr[], size_t count_str, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; size_t len = 0; size_t i = 0; struct simplebuffer *sbobj = NULL; char sp[3] = " "; TRACE_FLOW_ENTRY(); if (!count_str) { TRACE_ERROR_STRING("Invalid argument","count_str"); return EINVAL; } error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } sp[0] = sep; for (i = 0; i < count_str - 1; i++) { len = strlen(value_str_arr[i]); if ((error = simplebuffer_add_str(sbobj, value_str_arr[i], len, INI_VALUE_BLOCK)) || (error = simplebuffer_add_str(sbobj, sp, 2, INI_VALUE_BLOCK))) { TRACE_ERROR_NUMBER("String append failed.", error); simplebuffer_free(sbobj); return error; } } len = strlen(value_str_arr[count_str - 1]); error = simplebuffer_add_str(sbobj, value_str_arr[count_str - 1], len, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("String append failed.", error); simplebuffer_free(sbobj); return error; } error = ini_config_add_str_value(ini_config, section, key, (const char *)simplebuffer_get_buf(sbobj), comments, count_comment, border, position, other_key, idx, flags); simplebuffer_free(sbobj); TRACE_FLOW_RETURN(error); return error; } /* Add or modify a value that stores array of strings */ int ini_config_add_str_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, char *value_str_arr[], size_t count_str, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { const char **const_str_arr = (const char **)(intptr_t)value_str_arr; return ini_config_add_const_str_arr_value(ini_config, section, key, const_str_arr, count_str, sep, comments, count_comment, border, position, other_key, idx, flags); } /* Function to add integer value */ int ini_config_add_int_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%d", value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add long value */ int ini_config_add_long_value(struct ini_cfgobj *ini_config, const char *section, const char *key, long value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%ld", value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add ulong value */ int ini_config_add_ulong_value(struct ini_cfgobj *ini_config, const char *section, const char *key, unsigned long value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%lu", value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add unsigned value */ int ini_config_add_unsigned_value(struct ini_cfgobj *ini_config, const char *section, const char *key, unsigned value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%u", value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add int32 value */ int ini_config_add_int32_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int32_t value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%"PRId32, value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add uint32 value */ int ini_config_add_uint32_value(struct ini_cfgobj *ini_config, const char *section, const char *key, uint32_t value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%"PRIu32, value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add int64 value */ int ini_config_add_int64_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int64_t value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%"PRId64, value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add uint64 value */ int ini_config_add_uint64_value(struct ini_cfgobj *ini_config, const char *section, const char *key, uint64_t value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%"PRIu64, value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add double value */ int ini_config_add_double_value(struct ini_cfgobj *ini_config, const char *section, const char *key, double value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; int ret = 0; char *strval = NULL; TRACE_FLOW_ENTRY(); ret = asprintf(&strval, "%f", value); if (ret == -1) { TRACE_ERROR_NUMBER("Asprintf failed.", ret); /* The main reason is propbaly memory allocation */ return ENOMEM; } /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); TRACE_FLOW_RETURN(error); free(strval); return error; } /* Function to add binary value */ int ini_config_add_bin_value(struct ini_cfgobj *ini_config, const char *section, const char *key, void *value, size_t value_len, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; size_t i; char *strval = NULL; char *ptr = NULL; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if ((!value) && (value_len)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); return EINVAL; } /* The value is good so we can allocate memory for it */ strval = malloc(value_len * 2 + 3); if (strval == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); return ENOMEM; } strval[0] = '\''; /* Convert the value */ ptr = strval + 1; for (i = 0; i < value_len; i++) { sprintf(ptr, "%02x", *((unsigned char *)(value) + i)); ptr += 2; } strval[value_len * 2 + 1] = '\''; strval[value_len * 2 + 2] = '\0'; /* Call string function */ error = ini_config_add_str_value(ini_config, section, key, strval, comments, count_comment, border, position, other_key, idx, flags); free(strval); TRACE_FLOW_RETURN(error); return error; } /* Function to add string value */ int ini_config_add_str_value(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *value, const char **comments, size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags) { int error = EOK; struct ini_comment *ic = NULL; struct value_obj *vo = NULL; struct value_obj *old_vo = NULL; struct collection_item *item = NULL; const char sp_key[] = INI_SECTION_KEY; const char *key_ptr; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (!key) { TRACE_ERROR_STRING("Invalid argument","key"); return EINVAL; } if (!value) { TRACE_ERROR_STRING("Invalid argument","value"); return EINVAL; } if (idx < 0) { TRACE_ERROR_STRING("Invalid argument","idx"); return EINVAL; } switch (flags) { case INI_VA_NOCHECK: /* Just fall through */ break; case INI_VA_MOD: case INI_VA_MOD_E: /* Find the value by index. * If value is not found return error. */ error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, idx, EXACT(flags), &item); if (error) { TRACE_ERROR_NUMBER("Error " "looking for item.", error); return error; } break; case INI_VA_MODADD: error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, idx, 0, /* no exact */ &item); if ((error) && (error != ENOENT)) { TRACE_ERROR_NUMBER("Unexpected error " "looking for item.", error); return error; } break; case INI_VA_MODADD_E: /* Find the value by index. * If value is not found it is OK. */ error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, idx, 1, /* use exact */ &item); switch (error) { case EOK: /* we matched entry even with exact * just return it. */ break; case ENOENT: /* Entry can be missing or index was * to big. Try one more time without * exact flag */ error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, idx, 0, &item); if (error == EOK) { /* index was to big */ return ENOENT; } else if (error != EOK && error != ENOENT) { TRACE_ERROR_NUMBER("Unexpected error " "looking for item.", error); return error; } break; default: TRACE_ERROR_NUMBER("Unexpected error " "looking for item.", error); return error; } break; case INI_VA_DUPERROR: /* Find any instance */ error = col_get_dup_item(ini_config->cfg, section, key, COL_TYPE_ANY, 0, 0, &item); if ((error) && (error != ENOENT)) { TRACE_ERROR_NUMBER("Unexpected error " "looking for item.", error); return error; } if (!error) { TRACE_ERROR_NUMBER("Key exists " "this is error.", error); return EEXIST; } break; case INI_VA_CLEAN: /* Delete all instaces of the key first */ while (!error) { error = col_remove_item_with_cb( ini_config->cfg, section, COL_DSP_FIRSTDUP, key, 0, COL_TYPE_ANY, cb, NULL); if (error) { if (error != ENOENT) { TRACE_ERROR_NUMBER("Failed to clean " "the section.", error); return error; } else break; } } break; default: /* The new ones should be added here */ TRACE_ERROR_NUMBER("Flag is not implemented", ENOSYS); return ENOSYS; } /* Start with the comment */ if (comments) { error = ini_comment_construct(comments, count_comment, &ic); if (error) { TRACE_ERROR_NUMBER("Failed to construct comment", error); return error; } } /* Create value object */ error = value_create_new(value, strnlen(value, MAX_VALUE -1), INI_VALUE_CREATED, strnlen(key, MAX_KEY -1), border, ic, &vo); if (error) { TRACE_ERROR_NUMBER("Failed to construct value object.", error); ini_comment_destroy(ic); return error; } if (item) { /* If we have selected item remove old value */ old_vo = *((struct value_obj **)(col_get_item_data(item))); value_destroy(old_vo); /* Update the item with the new value */ error = col_modify_binary_item(item, NULL, &vo, sizeof(struct value_obj *)); if (error) { TRACE_ERROR_NUMBER("Failed to update item.", error); value_destroy(vo); return error; } } else { if (position == COL_DSP_FRONT) { key_ptr = sp_key; position = COL_DSP_AFTER; } else { key_ptr = other_key; } /* Add value to collection */ error = col_insert_binary_property(ini_config->cfg, section, position, key_ptr, idx, flags, key, &vo, sizeof(struct value_obj *)); } if (error) { TRACE_ERROR_NUMBER("Failed to insert value.", error); value_destroy(vo); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Function to add section */ int ini_config_add_section(struct ini_cfgobj *ini_config, const char *section, const char *comments[], size_t count_comment, int position, const char *other_section, int idx) { int error = EOK; struct ini_comment *ic = NULL; struct value_obj *vo = NULL; struct collection_item *item = NULL; struct collection_item *sec = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (position > COL_DSP_INDEX) { TRACE_ERROR_STRING("Invalid argument","position"); return EINVAL; } if (idx < 0) { TRACE_ERROR_STRING("Invalid argument","idx"); return EINVAL; } /* Check if section exists */ error = col_get_item(ini_config->cfg, section, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_ONELEVEL, &item); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } if (item) { TRACE_ERROR_STRING("Section already exists.", section); return EEXIST; } /* Create a new section */ error = col_create_collection(&sec, section, COL_CLASS_INI_SECTION); if (error) { TRACE_ERROR_NUMBER("Failed to create a section", error); return error; } /* Process comment */ if (comments) { error = ini_comment_construct(comments, count_comment, &ic); if (error) { TRACE_ERROR_NUMBER("Failed to construct comment", error); col_destroy_collection(sec); return error; } } /* Create value object */ error = value_create_new(section, strnlen(section, MAX_VALUE -1), INI_VALUE_CREATED, strlen(INI_SECTION_KEY), INI_WRAP_BOUNDARY, ic, &vo); if (error) { TRACE_ERROR_NUMBER("Failed to construct value object.", error); ini_comment_destroy(ic); col_destroy_collection(sec); return error; } /* Comment is now a part of value - no need to clean it seprately. */ /* Add value to section collection */ error = col_insert_binary_property(sec, NULL, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK, INI_SECTION_KEY, &vo, sizeof(struct value_obj *)); if (error) { TRACE_ERROR_NUMBER("Failed to add value object to section.", error); value_destroy(vo); col_destroy_collection(sec); return error; } /* Embed section collection */ /* Since there is no function to do addition of collection to * collection with disposition we will use a workaround. */ error = col_insert_property_with_ref(ini_config->cfg, NULL, position, other_section, idx, COL_INSERT_NOCHECK, section, COL_TYPE_COLLECTIONREF, (void *)(&sec), sizeof(struct collection_item **), NULL); if (error) { TRACE_ERROR_NUMBER("Failed to embed section", error); value_destroy(vo); col_destroy_collection(sec); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Function to add or remove comments for a section */ int ini_config_comment_section(struct ini_cfgobj *ini_config, const char *section, const char *comments[], size_t count_comment) { int error = EOK; struct ini_comment *ic = NULL; struct value_obj *vo = NULL; struct collection_item *item = NULL; struct collection_item *sec = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } /* Get the section */ error = col_get_item(ini_config->cfg, section, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_ONELEVEL, &item); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } /* If item not found return error */ if (!item) { TRACE_ERROR_NUMBER("Item not found.", ENOENT); return ENOENT; } /* Item is actually a section reference */ sec = *((struct collection_item **)col_get_item_data(item)); item = NULL; /* Now get the special item from the section collection */ error = col_get_item(sec, INI_SECTION_KEY, COL_TYPE_ANY, COL_TRAVERSE_ONELEVEL, &item); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } /* If item not found return error */ if (!item) { /* Something is really broken with the internal implementation * if we can't find the item, thus EINVAL. */ TRACE_ERROR_NUMBER("Item not found.", EINVAL); return EINVAL; } /* Item is actually a value object. */ vo = *((struct value_obj **)(col_get_item_data(item))); /* Build comment */ if (comments) { error = ini_comment_construct(comments, count_comment, &ic); if (error) { TRACE_ERROR_NUMBER("Failed to construct comment", error); return error; } } /* Replace comment with the new one. Old one is freed by the function */ error = value_put_comment(vo, ic); if (error) { TRACE_ERROR_NUMBER("Faile to update comment.", error); ini_comment_destroy(ic); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Function to rename section */ int ini_config_rename_section(struct ini_cfgobj *ini_config, const char *section, const char *newname) { int error = EOK; struct collection_item *item = NULL; struct collection_item *sec = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (!newname) { TRACE_ERROR_STRING("Invalid argument","newname"); return EINVAL; } /* Get the section */ error = col_get_item(ini_config->cfg, section, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_ONELEVEL, &item); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } /* If item not found return error */ if (!item) { TRACE_ERROR_NUMBER("Item not found.", ENOENT); return ENOENT; } /* Item is actually a section reference */ sec = *((struct collection_item **)col_get_item_data(item)); /* Change name only */ error = col_modify_item(item, newname, 0, NULL, 0); if (error) { TRACE_ERROR_NUMBER("Failed to change section name.", error); return error; } /* Change name of the embedded collection (for consistency) */ error = col_modify_item(sec, newname, 0, NULL, 0); if (error) { TRACE_ERROR_NUMBER("Failed to change section name " "inside the embedded collection.", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Cleanup collback */ static void cb(const char *property, int property_len, int type, void *data, int length, void *ext_data) { struct value_obj *vo; TRACE_FLOW_ENTRY(); if ((type == COL_TYPE_COLLECTIONREF) || (type == COL_TYPE_COLLECTION)) return; vo = *((struct value_obj **)(data)); value_destroy(vo); TRACE_FLOW_EXIT(); } /* Function to delete section by name */ int ini_config_delete_section_by_name(struct ini_cfgobj *ini_config, const char *section) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_config_delete_section_by_position(ini_config, COL_DSP_FIRSTDUP, section, 0); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Function to delete section by relative postion */ int ini_config_delete_section_by_position(struct ini_cfgobj *ini_config, int position, const char *section, int idx) { int error = EOK; struct collection_item *item = NULL; TRACE_FLOW_ENTRY(); /* Check arguments */ if (!ini_config) { TRACE_ERROR_STRING("Invalid argument","ini_config"); return EINVAL; } if (!section) { TRACE_ERROR_STRING("Invalid argument","section"); return EINVAL; } if (idx < 0) { TRACE_ERROR_STRING("Invalid argument","idx"); return EINVAL; } /* Extract section */ error = col_extract_item(ini_config->cfg, NULL, position, section, idx, COL_TYPE_ANY, &item); if (error) { TRACE_ERROR_NUMBER("Search for section failed.", error); return error; } /* If item not found return error */ if (!item) { TRACE_ERROR_NUMBER("Item not found.", ENOENT); return ENOENT; } /* Delete item and subcollection */ col_delete_item_with_cb(item, cb, NULL); TRACE_FLOW_EXIT(); return EOK; } ding-libs-0.6.2/ini/ini_configmod.h000066400000000000000000001036331417260640400171350ustar00rootroot00000000000000/* INI LIBRARY Interface that allows modification of the INI file. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_CONFIGMOD_H #define INI_CONFIGMOD_H /** * @defgroup insflags Flags used in add_xxx_value functions * * These flags control the behavior of the add_xxx_value functions. * Use these flags to specify how you want to process the key. * Do you want the function to replace an existing key? Or may be you want to * generate an error when function sees that there is a duplicate key? * Or may be you do not want to check anything and just add the key * to the section? * * Individual values provide more details about use. * * @{ */ enum INI_VA { /** @brief No check * * This is the default mode. Function will not perform * any checks for duplicates and will just add a key. */ INI_VA_NOCHECK = 0, /** * @brief Update a specific value (best effort). * * Value of the index is used to determine which one of the duplicates * needs to be updated. Index is 0-based. If the index is out of range * the function will do best effort and return the last instance of the key. * For example if you have five duplicates and you are searching for the tenth * the function will find and return the fifth instance. */ INI_VA_MOD = 1, /** * @brief Update a specific value (with error). * * Value of the index is used to determine which one of the duplicates * needs to be updated. Index is 0-based. If the value is not found or * the index is out of range the function returns ENOENT. * For example if you have five duplicates and you are searching for the tenth * the error ENOENT will be returned. */ INI_VA_MOD_E = 2, /** * @brief Update or add if not found (best effort). * * Function will check for duplicates and would overwrite the specified * key if found. * Value of the index is used to determine which one of the duplicates * needs to be updated. Index is 0-based. If the value is not found * the new value will be added following other position related arguments. * This option performs best effort search. * For example if you have five duplicates and you are searching for the tenth * the function will find and return fifth instance. */ INI_VA_MODADD = 3, /** * @brief Update or add if not found (with error). * * Function will check for duplicates and would overwrite the specified * key if found. * Value of the index is used to determine which one of the duplicates * needs to be updated. Index is 0-based. If the value is not found * the new value will be added following other position related arguments. * This option performs an exact search. * For example if you have five duplicates and you are searching for tenth * the error ENOENT will be returned. */ INI_VA_MODADD_E = 4, /** @brief Clean all duplicates. * * Find all instances of the specific key and remove them first. * Then add the new key respecting the position related arguments. */ INI_VA_CLEAN = 5, /** @brief Error if duplicate * * Return error EEXIST if an entry with the same key exists. */ INI_VA_DUPERROR = 6 }; /** * @} */ /** * @defgroup ini_mod API to create and modify configuration objects * * Functions in this section allow creation, modification * and deletion of sections and keys. * * Explanation of some of the common arguments: * * @param[in] position Specifies the position a key or a section * should be added to.\n\n * Options include: * - Last in the list * - First in the list * - N-th element of the list * - Before a specific element of the list * - After a specific element of the list * - As a first duplicate of a specific element * - As a last duplicate of a specific element * - As an N-th duplicate of a specific element * \n\n * Duplicates can be sequential or not, so there * are different constants that specify whether * to count all duplicates or just the ones that * go together.\n * @param[in] other_xxx Used in conjunction with 'position' constant. * In some cases it is convenient to add * a section or key immediately before * or after another section or key. * While 'position' defines * where it should be added, this parameter defines * the section or key to relate to. * @param[in] idx Index allows treating set of sections or keys * as an array and add Nth section or key. * @{ * */ /** * @brief Function to add a section. * * Function creates a new section in the specified position. * The position is relative to other sections. Duplicate sections * are not allowed. In case a duplicate section is detected function * will return error EEXIST. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to add. * @param[in] comments Array of comments. Can be NULL, if no comment is * needed for the section. It is expected that * comment lines start with the correct comment * symbol. Function does not check this. * Use empty string to express an empty line. * @param[in] count_comment Count of comments in the array. If 0, * the array is expected to be NULL terminated * and function will traverse array until its end. * @param[in] position A constant that specifies the way the * section should be added. For more information * see "disposition constants" section of * the collection (collection.h) interface. * The value is used only in the add operation * so see the explanation in the "insert" paragraph. * Since duplicate sections are not allowed * any constants that request addition of * a duplicate will cause function * to return an error. * @param[in] other_section Used in conjunction with position constant. * In some cases it is convenient to add * a section that is immediately before * or after another section. While position defines * where it should be added, this parameter defines * the section to relate to. * @param[in] idx Index, allows treating set of sections as * an array and add Nth section. * * @return 0 - Success. * @return EEXIST - Section already exists. * @return ENOSYS - Unknown position value. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_add_section(struct ini_cfgobj *ini_config, const char *section, const char *comments[], size_t count_comment, int position, const char *other_section, int idx); /** * @brief Function to update a comment for a section. * * Function finds a section and updates or removes its comment. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to change the comment for. * @param[in] comments Array of comments. Can be NULL if no comment is * needed for the section. It is expected that * comment lines start with the correct comment * symbol. Function does not check this. * Use empty string to express an empty line. * @param[in] count_comment Count of comments in the array. If 0 * the array is expected to be NULL terminated * and function will traverse array until its end. * * @return 0 - Success. * @return ENOENT - Section is not found. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_comment_section(struct ini_cfgobj *ini_config, const char *section, const char *comments[], size_t count_comment); /** * @brief Function to rename a section. * * Function finds a section and renames it. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to find. * @param[in] newname New section name. * * @return 0 - Success. * @return ENOENT - Section is not found. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_rename_section(struct ini_cfgobj *ini_config, const char *section, const char *newname); /** * @brief Function to delete a section by name. * * Function is a convenience wrapper around * \ref ini_config_delete_section_by_position function. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to delete. * * @return 0 - Success. * @return ENOENT - Section is not found. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_delete_section_by_name(struct ini_cfgobj *ini_config, const char *section); /** * @brief Function to delete a section by position or name. * * Function allows removing a specific section by its relative position * in the list of sections or by its name. * * @param[in] ini_config Configuration object to modify. * @param[in] position A constant that specifies the way the * section should be deleted. For more information * see "disposition constants" section of * the collection interface. The value is used * only in delete operation so see the explanation * in the "delete" paragraph. * There can't be duplicate sections. However * function respects all of the listed constants. * To find and delete a particular section * one can use COL_DSP_FIRSTDUP constant. * One should just expect that there is only * one instance of every section if any. * @param[in] section Used in conjunction with position constant. * In some cases it is convenient to add * a section immediately before * or after another value. While position defines * where it should be added, this parameter defines * the section to relate to. * @param[in] idx Index of the position. * For example one can specify * that the third section should be deleted. * * @return 0 - Success. * @return ENOENT - Section is not found. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_delete_section_by_position(struct ini_cfgobj *ini_config, int position, const char *section, int idx); /** * @brief Function to a add string value to a particular section. * * Depending on the flags function adds, or deletes and adds, or just modifies * the configuration value stored in the configuration object. * * \b NOTE: all other ini_config_add_xxx_value functions are implemented * as wrappers around this function so they have the same * behavior and logic. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to modify. * @param[in] key Key of the value to add or modify. * @param[in] value String that represents the value. * @param[in] comments Array of comments. Can be NULL if no comment is * needed for the section. It is expected that * comment lines start with the correct comment * symbol. Function does not check this. * Use empty string to express an empty line. * @param[in] count_comment Count of comments in the array. If 0, * the array is expected to be NULL terminated * and function will traverse array until its end. * @param[in] border The boundary the value should be wrapped at. * The usual value is 80 characters. * @param[in] position A constant that specifies the way the * value should be added. For more information * see "disposition constants" section of * the collection interface. The value is used * only in add operation so see the explanation * in the "insert" paragraph. * @param[in] other_key Used in conjunction with 'position' constant. * In some cases it is convenient to add * a value that should be placed immediately before * or after another value. While position defines * where it should be added, this parameter defines * the key to relate to. * @param[in] idx Index in the whole section or among * duplicates. For example one can specify * that the value should be added as a third * duplicate. This is convenient if INI file allows * duplicate keys. * @param[in] flags These constants define the main behavior of * the function. The function can thus be used * to build configuration object from scratch * (in this case no checks would be needed), * to modify a specific key which can be identified * by index among duplicate keys in the same * section. For more information see \ref insflags. * * @return 0 - Success. * @return EEXIST - The value already exists. * @return ENOENT - The value not found. * @return ENOSYS - Unknown flag or position value. * @return ENOMEM - No memory to add value. * @return EINVAL - Invalid argument. */ int ini_config_add_str_value(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an integer value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an integer argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_int_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a long value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a long integer argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_long_value(struct ini_cfgobj *ini_config, const char *section, const char *key, long value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an unsigned long value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an unsigned long integer argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_ulong_value(struct ini_cfgobj *ini_config, const char *section, const char *key, unsigned long value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an unsigned value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an unsigned argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_unsigned_value(struct ini_cfgobj *ini_config, const char *section, const char *key, unsigned value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an int32 value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an int32 argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_int32_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int32_t value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an uint32 value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an uint32 argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_uint32_value(struct ini_cfgobj *ini_config, const char *section, const char *key, uint32_t value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an int64 value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an int64 argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_int64_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int64_t value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add an uint64 value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * an uint64 argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_uint64_value(struct ini_cfgobj *ini_config, const char *section, const char *key, uint64_t value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a double value to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a double argument for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_double_value(struct ini_cfgobj *ini_config, const char *section, const char *key, double value, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a binary value to a particular section. * * Binary values are represented by a HEX string where two HEX digits * represent one byte of the source data. The value is surrounded * by a pair of single quotes. * * Function is similar to \ref ini_config_add_str_value except it uses * a void argument for the value input. The length of the data is specified by * by the value_len argument. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_bin_value(struct ini_cfgobj *ini_config, const char *section, const char *key, void *value, size_t value_len, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a value that consists of an array of constant strings * to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a string array argument and a count for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_const_str_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *value_str_arr[], size_t count_str, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a value that consists of an array of strings * to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a string array argument and a count for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_str_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, char *value_str_arr[], size_t count_str, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a value that consists of an array of integers * to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a integer array argument and a count for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_int_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, int *value_int_arr, size_t count_int, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a value that consists of an array of long integers * to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a long integer array argument and a count for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_long_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, long *value_long_arr, size_t count_long, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to add a value that consists of an array of doubles * to a particular section. * * Function is similar to \ref ini_config_add_str_value except it uses * a double array argument and a count for the value input. * * For logic, behavior and return values see \ref ini_config_add_str_value. */ int ini_config_add_double_arr_value(struct ini_cfgobj *ini_config, const char *section, const char *key, double *value_double_arr, size_t count_double, char sep, const char *comments[], size_t count_comment, int border, int position, const char *other_key, int idx, enum INI_VA flags); /** * @brief Function to delete a value. * * Function deletes a value specified either by key or by position. * For example the caller can remove first or last key of the section as well * as first, last or specific instance of a specific key. If key is searched * by index and index is out of range the function would return ENOENT * indicating that specifically requested key is not found. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to remove the key from. * @param[in] position A constant that specifies the way the * key should be removed. For more information * see "disposition constants" section of * the collection interface, and specifically * the "delete" paragraph. * @param[in] key Used in conjunction with 'position' constant. * Depending on the value of the position * argument the key argument can specify * the key to delete or the key that the delete * operation should be relative to. * @param[in] idx Index of duplicates. For example one can specify * that he wants to delete the third duplicate * of a specific key. If there are less duplicates, * i.e. the index is out of range, the function * will return ENOENT. * * @return 0 - Value was removed. * @return ENOENT - The value not found. */ int ini_config_delete_value(struct ini_cfgobj *ini_config, const char *section, int position, const char *key, int idx); /** * @brief Function to update a comment. * * Function can be used to find and modify a comment for a specific * key in a specific section. * * @param[in] ini_config Configuration object to modify. * @param[in] section Name of the section to find the key. * @param[in] key The key to find. * @param[in] comments The array of comments. Can be NULL. If NULL, * the existing comment will be removed if any. * The comment lines are expected to start with a * standard comment symbol. The function does not check this. * Use empty string to express an empty line. * @param[in] count_comment Count of comments. If 0 the comment is * constructed using array of strings above. * It is expected to be NULL terminated. * @param[in] idx Index of duplicates. For example one can specify * that he wants to find the third duplicate * of a specific key. If there are less duplicates, * i.e. the index is out of range, the function * will return ENOENT. * * @return 0 - Value was removed. * @return ENOENT - The value not found. */ int ini_config_update_comment(struct ini_cfgobj *ini_config, const char *section, const char *key, const char *comments[], size_t count_comment, int idx); /** * @} */ #endif ding-libs-0.6.2/ini/ini_configmod_ut.c000066400000000000000000001006141417260640400176340ustar00rootroot00000000000000/* INI LIBRARY Unit test for the configuration object modification API. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "collection_tools.h" #include "ini_configmod.h" #include "path_utils.h" int verbose = 0; #define WRAP_SIZE 80 #define INIOUT(foo) \ do { \ if (verbose) { printf("%30s(%4d): ",__FUNCTION__,__LINE__); foo; } \ } while(0) typedef int (*test_fn)(void); static void print_configuration(struct ini_cfgobj *in_cfg, FILE *file) { int error; struct simplebuffer *sbobj = NULL; uint32_t left = 0; error = simplebuffer_alloc(&sbobj); if (error) { printf("Failed to allocate buffer. Error %d.\n", error); return; } error = ini_config_serialize(in_cfg, sbobj); if (error) { printf("Failed to serialize. Error %d.\n", error); simplebuffer_free(sbobj); return; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(file), sbobj, &left); if (error) { printf("Failed to write back the configuration %d.\n", error); simplebuffer_free(sbobj); return; } } simplebuffer_free(sbobj); return; } /* Basic test */ static int basic_test(void) { int error = EOK; char indir[PATH_MAX]; char srcname[PATH_MAX]; char resname[PATH_MAX]; char command[PATH_MAX * 3]; char *builddir = NULL; char *srcdir = NULL; struct ini_cfgobj *in_cfg = NULL; char bin1[] = { 1, 2, 3 }; char bin2[] = { 10, 11, 12 }; FILE *file = NULL; const char *comment1[] = { "// This is a real file with some comments", "" }; const char *comment2[] = { "", "/**/" }; const char *comment3[] = { "", "/* Service section defines", " * which service are allowed.", " */ " }; const char *sec_com[] = { "" }; const char *const_str_arr[] = { "dp", "nss", "pam", "info" }; char **str_arr = (char **)(intptr_t)const_str_arr; INIOUT(printf("<==== Start ====>\n")); srcdir = getenv("srcdir"); builddir = getenv("builddir"); snprintf(indir, PATH_MAX, "%s/ini/ini.d", (srcdir == NULL) ? "." : srcdir); snprintf(srcname, PATH_MAX, "%s/ini/ini.d/real.conf", (srcdir == NULL) ? "." : srcdir); snprintf(resname, PATH_MAX, "%s/real.conf.manual", (builddir == NULL) ? "." : builddir); /* Create config collection */ error = ini_config_create(&in_cfg); if (error) { INIOUT(printf("Failed to create collection. Error %d.\n", error)); return error; } if ((error = ini_config_add_section( in_cfg, "config", comment1, 2, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "config", "version", "0.1", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "monitor", comment2, 2, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "monitor", "description", "Monitor Configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_int_value( in_cfg, "monitor", "sbusTimeout", 10, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "monitor", "sbusAddress", "unix:path=/var/lib/sss/pipes/private/dbus", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_unsigned_value( in_cfg, "monitor", "servicePingTime", 10, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "monitor", "bad_number", "5a", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "services", comment3, 4, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "services", "description", "Local service configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_arr_value( in_cfg, "services", "activeServices", str_arr, 4, ',', NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "services/dp", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "services/dp", "description", "Data Provider Configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/dp", "command", "/usr/libexec/sssd/sssd_dp", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "services/nss", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "services/nss", "description", "NSS Responder Configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/nss", "unixSocket", "/var/lib/sss/pipes/nss", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/nss", "command", "/usr/libexec/sssd/sssd_nss", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "services/pam", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "services/pam", "description", "PAM Responder Configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/pam", "unixSocket", "/var/lib/sss/pipes/pam", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/pam", "command", "/usr/libexec/sssd/sssd_pam", NULL, 0, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "services/info", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "services/info", "description", "InfoPipe Configuration", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "services/info", "command", "./sbin/sssd_info", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "domains", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "domains", "domainsOrder", " , LOCAL, , EXAMPLE.COM" ", , SOMEOTHER.COM , ,", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains", "badarray", " , , , , ,", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains", "somearray", ",", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains", "someotherarray", ", ;", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains", "justdelim", ":;,;", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains", "yetanother", "", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "domains/LOCAL", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "domains/LOCAL", "description", "Reserved domain for local configurations", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/LOCAL", "legacy", "FALSE", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_long_value( in_cfg, "domains/LOCAL", "enumerate", 3, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_section( in_cfg, "domains/EXAMPLE.COM", sec_com, 1, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "description", "Example domain served by IPA ", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "provider", "ipa", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "server", "ipaserver1.example.com", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "server", "ipabackupserver.example.com", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "legacy", "FALSE", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "server", "otheripabackupserver.example.com", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_int64_value( in_cfg, "domains/EXAMPLE.COM", "enumerate", 0, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_bin_value( in_cfg, "domains/EXAMPLE.COM", "binary_test", bin1, 3, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_bin_value( in_cfg, "domains/EXAMPLE.COM", "binary_test_two", bin2, 3, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "long_array", "1 2; 4' ;8p .16/ 32?", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "double_array", "1.1 2.222222; .4' . ;8p .16/ -32?", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "server", "yetanotheripabackupserver.example.com", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "empty_value", "", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "domains/EXAMPLE.COM", "space_value", "\" \"", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_int32_value( in_cfg, "domains/EXAMPLE.COM", "int32_t", -1000000000, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_uint32_value( in_cfg, "domains/EXAMPLE.COM", "uint32_t", 3000000000u, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_int64_value( in_cfg, "domains/EXAMPLE.COM", "int64_t", -1000000000123, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_uint64_value( in_cfg, "domains/EXAMPLE.COM", "uint64_t", 9223375036854775931u, NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK))) { INIOUT(printf("Failed to create configuration. Error %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } file = fopen(resname, "w"); print_configuration(in_cfg, file); fclose(file); ini_config_destroy(in_cfg); snprintf(command, PATH_MAX * 3, "diff -wi %s %s", srcname, resname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", srcname, resname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run diff command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("<==== End ====>\n")); return EOK; } static void make_results(const char *path) { FILE *file = NULL; file = fopen(path, "w"); fprintf(file, "// This is a test\n" "[one]\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "// This is a test\n" "key1 = value1b\n" "key2 = value2\n" "key3 = value3\n"); fclose(file); } /* Test duplicates */ static int dup_test(void) { int error = EOK; char srcname[PATH_MAX]; char resname[PATH_MAX]; char command[PATH_MAX * 3]; char *builddir = NULL; struct ini_cfgobj *in_cfg = NULL; FILE *file = NULL; const char *comment[] = { "// This is a test", NULL }; INIOUT(printf("<==== Start ====>\n")); builddir = getenv("builddir"); snprintf(srcname, PATH_MAX, "%s/modtest.conf.exp", (builddir == NULL) ? "." : builddir); snprintf(resname, PATH_MAX, "%s/modtest.conf.real", (builddir == NULL) ? "." : builddir); make_results(srcname); /* Create config collection */ error = ini_config_create(&in_cfg); if (error) { INIOUT(printf("Failed to create collection. Error %d.\n", error)); return error; } if ((error = ini_config_add_section( in_cfg, "one", NULL, 0, COL_DSP_END, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "one", "key2", "value2", NULL, 0, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key1", "value1a", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key3", "value3", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key2", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key1", "value1", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key1", "value1b", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key1", "value1c", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "one", "key1", "value1a_bis", NULL, 0, WRAP_SIZE, COL_DSP_NDUPNS, "key1", 2, INI_VA_NOCHECK))) { INIOUT(printf("Failed to create configuration. Error %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } /* Try to add another section "one" */ if (EEXIST != ini_config_add_section( in_cfg, "one", NULL, 0, COL_DSP_END, NULL, 0)) { INIOUT(printf("Expected error. Got %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } if ((error = ini_config_comment_section(in_cfg, "one", comment, 1))) { INIOUT(printf("Failed to add a comment %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } if ((error = ini_config_add_section( in_cfg, "two", NULL, 0, COL_DSP_FRONT, NULL, 0)) || (error = ini_config_add_str_value( in_cfg, "two", "key2", "value2", NULL, 0, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key1", "value1a", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key3", "value3", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key2", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key1", "value1", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key1", "value1b", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key1", "value1c", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, "key1", 0, INI_VA_NOCHECK)) || (error = ini_config_add_str_value( in_cfg, "two", "key1", "value1a_bis", NULL, 0, WRAP_SIZE, COL_DSP_NDUPNS, "key1", 2, INI_VA_NOCHECK))) { INIOUT(printf("Failed to add another section. Error %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } /* Rename section */ if ((error = ini_config_rename_section(in_cfg, "two", "three"))) { INIOUT(printf("Failed to rename a section %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } /* Delect section that is before section "one" */ if ((error = ini_config_delete_section_by_position(in_cfg, COL_DSP_BEFORE, "one", 0))) { INIOUT(printf("Failed to delete a section %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } /* Update comment */ if ((error = ini_config_update_comment(in_cfg, "one", "key1", comment, 1, 3))) { INIOUT(printf("Failed to update comment %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } /* Delete the key */ if ((error = ini_config_delete_value(in_cfg, "one", COL_DSP_NDUP, "key1", 4))) { INIOUT(printf("Failed to delete the key %d.\n", error)); print_configuration(in_cfg, stdout); ini_config_destroy(in_cfg); return error; } file = fopen(resname, "w"); print_configuration(in_cfg, file); fclose(file); ini_config_destroy(in_cfg); snprintf(command, PATH_MAX * 3, "diff -wi %s %s", srcname, resname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", srcname, resname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run diff command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("<==== End ====>\n")); return EOK; } int main(int argc, char *argv[]) { int error = EOK; test_fn tests[] = { basic_test, dup_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } INIOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed with error %d!\n", error); return error; } } INIOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_configmod_ut_check.c000066400000000000000000002050321417260640400207710ustar00rootroot00000000000000/* INI LIBRARY Unit test for the configuration object modification API. Copyright (C) Lukas Slebodnik 2015 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "collection_tools.h" #include "ini_configmod.h" #include "path_utils.h" #include "../basicobjects/simplebuffer.h" int verbose = 0; #define WRAP_SIZE 80 static void dump_configuration(struct ini_cfgobj *in_cfg, FILE *file) { int ret; struct simplebuffer *sbobj = NULL; void *buff; uint32_t len; ret = simplebuffer_alloc(&sbobj); fail_unless(ret == EOK, "Failed to allocate buffer. Error %d.\n", ret); ret = ini_config_serialize(in_cfg, sbobj); fail_unless(ret == EOK, "Failed to serialize. Error %d.\n", ret); buff = simplebuffer_get_vbuf(sbobj); len = simplebuffer_get_len(sbobj); ret = fwrite(buff, 1, len, file); fail_if(ret == -1, "Failed to write to file. Error: %d %s\n", ret, strerror(ret)); simplebuffer_free(sbobj); return; } static int call_diff(const char *function, const char *expected_cfg, size_t expected_cfg_len, const char *res_cfg, size_t res_cfg_len) { char expected_fn[PATH_MAX]; char res_fn[PATH_MAX]; char command[PATH_MAX * 3]; char *builddir; int ret; int expected_fd; int res_fd; builddir = getenv("builddir"); snprintf(expected_fn, PATH_MAX, "%s/expected.conf_%s_XXXXXX", (builddir == NULL) ? "." : builddir, function); snprintf(res_fn, PATH_MAX, "%s/result.conf_%s_XXXXXX", (builddir == NULL) ? "." : builddir, function); expected_fd = mkstemp(expected_fn); fail_if(expected_fd == -1, "mkstemp failed: %s\n", strerror(errno)); ret = write(expected_fd, expected_cfg, expected_cfg_len); fail_if(ret == -1, "Failed write to %s. Error %s\n", expected_fn, strerror(errno)); close(expected_fd); res_fd = mkstemp(res_fn); fail_if(res_fd == -1, "mkstemp failed: %s\n", strerror(errno)); ret = write(res_fd, res_cfg, res_cfg_len); fail_if(ret == -1, "Failed write to %s. Error %s\n", expected_fn, strerror(errno)); close(res_fd); snprintf(command, PATH_MAX * 3, "diff -wi %s %s", expected_fn, res_fn); ret = system(command); fail_if(ret == -1, "Failed to execute command:%s. Erorr %s\n", command, strerror(errno)); return EOK; } #define assert_configuration_equal(expected_cfg, expected_cfg_len, res_cfg) \ _assert_configuration_equal(expected_cfg, expected_cfg_len, res_cfg, \ __func__, __FILE__, __LINE__) static void _assert_configuration_equal(const char *expected_cfg, size_t expected_cfg_len, struct ini_cfgobj *res_cfg, const char *function, const char *file, int line) { char *res_buffer = NULL; size_t res_buffer_size; FILE *f_memstream; int ret; --expected_cfg_len; /* do not use trailing zero */ f_memstream = open_memstream(&res_buffer, &res_buffer_size); fail_if(f_memstream == NULL, "\n\t[%s:%d] open_memstream failed.", file, line); dump_configuration(res_cfg, f_memstream); fclose(f_memstream); fail_unless(expected_cfg_len == res_buffer_size, "\n\t[%s:%d] Size of expected config %zu and result config %d " "does not match. Res:%d\n", file, line, expected_cfg_len, res_buffer_size, call_diff(function, expected_cfg, expected_cfg_len, res_buffer, res_buffer_size)); ret = memcmp(res_buffer, expected_cfg, expected_cfg_len); fail_unless(ret == EOK, "\n\t[%s:%d] Configurations are not identical. Res:%d\n", file, line, call_diff(function, expected_cfg, expected_cfg_len, res_buffer, res_buffer_size)); free(res_buffer); } static struct ini_cfgobj *get_ini_config_from_str(char input_data[], size_t input_data_len) { struct ini_cfgobj *in_cfg; struct ini_cfgfile *file_ctx; int ret; ret = ini_config_create(&in_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_file_from_mem(input_data, input_data_len, &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_NONE, INI_MV1S_ALLOW, 0, in_cfg); fail_unless(ret == EOK, "Failed to parse config. Error %d.\n", ret); ini_config_file_destroy(file_ctx); return in_cfg; } START_TEST(test_delete_value_wrong_arguments) { int ret = EOK; struct ini_cfgobj *in_cfg = NULL; char exp_data[] = "[zero]\n" "[one]\n" "key1 = value1a\n"; in_cfg = get_ini_config_from_str(exp_data, sizeof(exp_data)); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); /* missing ini_config */ ret = ini_config_delete_value(NULL, "one", COL_DSP_NDUP, "key1", 0); fail_unless(ret == EINVAL, "delete value should fail. Error: %d", ret); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); /* missing section */ ret = ini_config_delete_value(in_cfg, NULL, COL_DSP_NDUP, "key1", 0); fail_unless(ret == EINVAL, "delete value should fail. Error: %d", ret); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); /* missing key */ ret = ini_config_delete_value(in_cfg, "one", COL_DSP_NDUP, NULL, 0); fail_unless(ret == EINVAL, "delete value should fail. Error: %d", ret); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); /* value index is too low */ ret = ini_config_delete_value(in_cfg, "one", COL_DSP_NDUP, "key1", -1); fail_unless(ret == EINVAL, "delete value should fail. Error: %d", ret); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); /* value index is too high */ ret = ini_config_delete_value(in_cfg, "one", COL_DSP_NDUP, "key1", 1); fail_unless(ret == ENOENT, "delete value should fail. Error: %d", ret); assert_configuration_equal(exp_data, sizeof(exp_data), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_delete_value) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key1 = first\n" "key1 = second\n" "key1 = third\n" "key1 = last\n"; char delete_first[] = "[zero]\n" "[one]\n" "key1 = first\n" "key1 = second\n" "key1 = third\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ret = ini_config_delete_value(in_cfg, "one", COL_DSP_NDUP, "key1", 3); fail_unless(ret == EOK, "delete value should fail. Error: %d", ret); assert_configuration_equal(delete_first, sizeof(delete_first), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_update_comments_wrong_arguments) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[one]\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "// This is a test\n" "key1 = value1b\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; const char *comment[] = { "// This is a test", NULL }; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing ini_config */ ret = ini_config_update_comment(NULL, "one", "key1", comment, 1, 3); fail_unless(ret == EINVAL, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing section */ ret = ini_config_update_comment(in_cfg, NULL, "key1", comment, 1, 3); fail_unless(ret == EINVAL, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing key */ ret = ini_config_update_comment(in_cfg, "one", NULL, comment, 1, 3); fail_unless(ret == EINVAL, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* wrong section */ ret = ini_config_update_comment(in_cfg, "noexist", "key1", comment, 1, 3); fail_unless(ret == ENOENT, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* wrong key */ ret = ini_config_update_comment(in_cfg, "one", "noexist", comment, 1, 3); fail_unless(ret == ENOENT, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* value index is too low */ ret = ini_config_update_comment(in_cfg, "one", "key1", comment, 1, -1); fail_unless(ret == EINVAL, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* value index is too high */ ret = ini_config_update_comment(in_cfg, "one", "key1", comment, 1, 5); fail_unless(ret == ENOENT, "update commants should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_update_comments) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[one]\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "key1 = value1b\n" "// this is a comment\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; char exp_data_1comment[] = "[one]\n" "// This is a test1\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "key1 = value1b\n" "// this is a comment\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; char exp_data_2comments[] = "[one]\n" "// This is a test1\n" "// This is a test2\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "key1 = value1b\n" "// this is a comment\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; char exp_data_1comment_after2[] = "[one]\n" "key1 = value1\n" "key1 = value1a\n" "// This is a test1\n" "key1 = value1a_bis\n" "key1 = value1b\n" "// this is a comment\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; char exp_replaced[] = "[one]\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "key1 = value1b\n" "// This is a test1\n" "// This is a test2\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; char exp_removed_comment[] = "[one]\n" "key1 = value1\n" "key1 = value1a\n" "key1 = value1a_bis\n" "key1 = value1b\n" "key1 = value1c\n" "key2 = value2\n" "key3 = value3\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; const char *empty_comment[] = { NULL }; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add comments with size */ ret = ini_config_update_comment(in_cfg, "one", "key1", comments, 1, 0); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_data_1comment, sizeof(exp_data_1comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add comments with size */ ret = ini_config_update_comment(in_cfg, "one", "key1", comments, 2, 0); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_data_2comments, sizeof(exp_data_2comments), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add comments (NULL terminated array), size is 0 */ ret = ini_config_update_comment(in_cfg, "one", "key1", comments, 0, 0); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_data_2comments, sizeof(exp_data_2comments), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add comments (NULL terminated array), size is 0 */ ret = ini_config_update_comment(in_cfg, "one", "key1", comments, 1, 2); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_data_1comment_after2, sizeof(exp_data_1comment_after2), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* replace comment */ ret = ini_config_update_comment(in_cfg, "one", "key1", comments, 0, 4); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_replaced, sizeof(exp_replaced), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* remove comment */ ret = ini_config_update_comment(in_cfg, "one", "key1", empty_comment, 0, 4); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_removed_comment, sizeof(exp_removed_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* remove comment (2nd way; argument is NULL) */ ret = ini_config_update_comment(in_cfg, "one", "key1", NULL, 0, 4); fail_unless(ret == EOK, "update commants should fail. Error: %d", ret); assert_configuration_equal(exp_removed_comment, sizeof(exp_removed_comment), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_wrong_arguments) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key1 = value1a\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing ini_config */ ret = ini_config_add_str_value(NULL, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == EINVAL, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing section */ ret = ini_config_add_str_value(in_cfg, NULL, "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == EINVAL, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing key */ ret = ini_config_add_str_value(in_cfg, "one", NULL, "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == EINVAL, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* missing value */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", NULL, comments, 2, WRAP_SIZE, COL_DSP_END, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == EINVAL, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* wrong index */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, "key1", -1, INI_VA_NOCHECK); fail_unless(ret == EINVAL, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* wrong flag */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, "key1", 0, 0xff); fail_unless(ret == ENOSYS, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add duplicate for missing key */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == ENOENT, "Add str should fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_simple) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; char add_new_value_to_end[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n" "newkey = newvalue\n"; char add_new_value_to_end_with_comment[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n" "// This is a test1\n" "// This is a test2\n" "newkey = newvalue\n"; char add_new_value_to_front[] = "[zero]\n" "[one]\n" "newkey = newvalue\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_to_front_with_comment[] = "[zero]\n" "[one]\n" "// This is a test1\n" "// This is a test2\n" "newkey = newvalue\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_after_key1[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "newkey = newvalue\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_before_key2[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "newkey = newvalue\n" "key2 = value2a\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Simple add new value to end of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_end, sizeof(add_new_value_to_end), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value with comment to end of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_end_with_comment, sizeof(add_new_value_to_end_with_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Simple add new value to the begin of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_front, sizeof(add_new_value_to_front), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value with comment to the begin of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_front_with_comment, sizeof(add_new_value_to_front_with_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with index 0 */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with index 1 (index ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 1, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with very big index (index ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 1000, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value before "key2" */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_before_key2, sizeof(add_new_value_before_key2), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_duplicate) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; char add_first_duplicate[] = "[zero]\n" "[one]\n" "key0 = newvalue\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; char add_first_duplicate_for_multi[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = newvalue\n" "key1 = value1a\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; char add_last_duplicate[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = newvalue\n" "// This is a test1\n" "key2 = value2a\n"; char add_duplicate_with_index1[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "// This is a test1\n" "// This is a test2\n" "key1 = newvalue\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* cannot add key as the first duplicate for non-existing key */ ret = ini_config_add_str_value(in_cfg, "one", "noexist", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == ENOENT, "Add duplicate key must fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* cannot add key as the last duplicate for non-existing key */ ret = ini_config_add_str_value(in_cfg, "one", "noexist", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == ENOENT, "Add duplicate key must fail. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate value */ ret = ini_config_add_str_value(in_cfg, "one", "key0", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate, sizeof(add_first_duplicate), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate value with other_key (reference key is ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "key0", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, "key2", 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate, sizeof(add_first_duplicate), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate value with index (index is ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "key0", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, "key0", 1, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate, sizeof(add_first_duplicate), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate value with multiple keys */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate_for_multi, sizeof(add_first_duplicate_for_multi), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate as last */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_last_duplicate, sizeof(add_last_duplicate), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate with index 0 (the same as COL_DSP_FIRSTDUP) */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate_for_multi, sizeof(add_first_duplicate_for_multi), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate with index and other_key (other_key is ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, "key0", 0, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_first_duplicate_for_multi, sizeof(add_first_duplicate_for_multi), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate with big index (the same as COL_DSP_NDUP) */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 100, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_last_duplicate, sizeof(add_last_duplicate), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Add duplicate with index 1 */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", comments, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 1, INI_VA_NOCHECK); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_duplicate_with_index1, sizeof(add_duplicate_with_index1), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_update_specific_value) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = value1d\n" "key2 = value2\n" "key3 = value3\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; char modify_existing_value[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "// This is a test1\n" "// This is a test2\n" "key1 = newvalue\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = value1d\n" "key2 = value2\n" "key3 = value3\n"; char modify_existing_value_index[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = newvalue\n" "key2 = value2\n" "key3 = value3\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* update of non-existing value fails */ ret = ini_config_add_str_value(in_cfg, "one", "key4", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MOD); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_MOD will not add key for non-existing value * even with proper position flag. This is difference between * INI_VA_MOD and INI_VA_MODADD */ ret = ini_config_add_str_value(in_cfg, "one", "key1.x", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_MOD); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + update of non-existing value fails */ ret = ini_config_add_str_value(in_cfg, "one", "key4", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MOD_E); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MOD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value, sizeof(modify_existing_value), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will update existing value */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MOD_E); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value, sizeof(modify_existing_value), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value using index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 3, INI_VA_MOD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will update existing value using index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 3, INI_VA_MOD_E); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value using big index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 1000, INI_VA_MOD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will NOT update existing value using big index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 1000, INI_VA_MOD_E); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_update_MODADD) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = value1d\n" "key2 = value2\n" "key3 = value3\n"; char modify_add_non_existing_value[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = value1d\n" "key1.x = newvalue\n" "key2 = value2\n" "key3 = value3\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; char modify_existing_value[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "// This is a test1\n" "// This is a test2\n" "key1 = newvalue\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = value1d\n" "key2 = value2\n" "key3 = value3\n"; char modify_existing_value_index[] = "[zero]\n" "[one]\n" "key0 = valuer0\n" "key1 = value1a\n" "key1 = value1b\n" "key1 = value1c\n" "key1 = newvalue\n" "key2 = value2\n" "key3 = value3\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* update of non-existing value fails with wrong position */ ret = ini_config_add_str_value(in_cfg, "one", "key4", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MODADD); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_MODADD will add key for non-existing value*/ ret = ini_config_add_str_value(in_cfg, "one", "key1.x", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_MODADD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_add_non_existing_value, sizeof(modify_add_non_existing_value), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + update of non-existing value fails */ ret = ini_config_add_str_value(in_cfg, "one", "key4", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MODADD_E); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MODADD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value, sizeof(modify_existing_value), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will update existing value */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_MODADD_E); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value, sizeof(modify_existing_value), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value using index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 3, INI_VA_MODADD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will update existing value using index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 3, INI_VA_MODADD_E); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add will update existing value using big index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 1000, INI_VA_MODADD); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(modify_existing_value_index, sizeof(modify_existing_value_index), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* strict flag + add will NOT update existing value using big index */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 1000, INI_VA_MODADD_E); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); } END_TEST /* INI_VA_CLEAN does not have effect to operation without duplicit key */ START_TEST(test_add_str_simple_clean) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; const char *comments[] = { "// This is a test1", "// This is a test2", NULL }; char add_new_value_to_end[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n" "newkey = newvalue\n"; char add_new_value_to_end_with_comment[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n" "// This is a test1\n" "// This is a test2\n" "newkey = newvalue\n"; char add_new_value_to_front[] = "[zero]\n" "[one]\n" "newkey = newvalue\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_to_front_with_comment[] = "[zero]\n" "[one]\n" "// This is a test1\n" "// This is a test2\n" "newkey = newvalue\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_after_key1[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "newkey = newvalue\n" "key1 = value1b\n" "key2 = value2a\n"; char add_new_value_before_key2[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "newkey = newvalue\n" "key2 = value2a\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Simple add new value to end of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_end, sizeof(add_new_value_to_end), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value with comment to end of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_END, NULL, 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_end_with_comment, sizeof(add_new_value_to_end_with_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* Simple add new value to the begin of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_front, sizeof(add_new_value_to_front), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value with comment to the begin of section */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", comments, 2, WRAP_SIZE, COL_DSP_FRONT, NULL, 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_to_front_with_comment, sizeof(add_new_value_to_front_with_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with index 0 */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with index 1 (index ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 1, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value after "key1" with very big index (index ignored) */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_AFTER, "key1", 1000, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_after_key1, sizeof(add_new_value_after_key1), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* add new value before "key2" */ ret = ini_config_add_str_value(in_cfg, "one", "newkey", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_CLEAN); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_new_value_before_key2, sizeof(add_new_value_before_key2), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_duplicate_error) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "key2 = value2a\n"; char add_non_existing_value[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "key1.x = newvalue\n" "key2 = value2a\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key0", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key2", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_LASTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, NULL, 0, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_NDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_NDUP will return error due to nonexisting duplicate * (index and other_key are ignored. */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, "key1", 1, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_DUPERROR will return EEXIST for duplicit key * and COL_DSP_NDUP will return error due to nonexisting duplicate * big index is ignored. */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 100, INI_VA_DUPERROR); fail_unless(ret == EEXIST, "Failed to add str. Error: %d", ret); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* entry will be added with INI_VA_DUPERROR and non-existing key. */ ret = ini_config_add_str_value(in_cfg, "one", "key1.x", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_BEFORE, "key2", 0, INI_VA_DUPERROR); fail_unless(ret == EOK, "Failed to add str. Error: %d", ret); assert_configuration_equal(add_non_existing_value, sizeof(add_non_existing_value), in_cfg); ini_config_destroy(in_cfg); } END_TEST START_TEST(test_add_str_duplicate_clean) { int ret = EOK; struct ini_cfgobj *in_cfg; char input_data[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; char only_removed_key[] = "[zero]\n" "[one]\n" "key1 = value1a\n" "key1 = value1b\n" "// This is a test1\n" "key2 = value2a\n"; char only_removed_all_duplicates[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "// This is a test1\n" "key2 = value2a\n"; char only_removed_key_with_comment[] = "[zero]\n" "[one]\n" "key0 = value0a\n" "key1 = value1a\n" "key1 = value1b\n"; in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove duplicit key * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key0", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_key, sizeof(only_removed_key), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove app duplicit keys * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_all_duplicates, sizeof(only_removed_all_duplicates), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove app duplicit keys * and COL_DSP_FIRSTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key2", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_FIRSTDUP, NULL, 0, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_key_with_comment, sizeof(only_removed_key_with_comment), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove all duplicit keys * and COL_DSP_LASTDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_LASTDUP, NULL, 0, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_all_duplicates, sizeof(only_removed_all_duplicates), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove all duplicit keys * and COL_DSP_NDUP will return error due to nonexisting duplicate */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 0, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_all_duplicates, sizeof(only_removed_all_duplicates), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove all duplicit keys * and COL_DSP_NDUP will return error due to nonexisting duplicate * (index and other_key are ignored. */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, "key1", 1, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_all_duplicates, sizeof(only_removed_all_duplicates), in_cfg); ini_config_destroy(in_cfg); in_cfg = get_ini_config_from_str(input_data, sizeof(input_data)); assert_configuration_equal(input_data, sizeof(input_data), in_cfg); /* INI_VA_CLEAN will remove all duplicit keys * and COL_DSP_NDUP will return error due to nonexisting duplicate * big index is ignored. */ ret = ini_config_add_str_value(in_cfg, "one", "key1", "newvalue", NULL, 0, WRAP_SIZE, COL_DSP_NDUP, NULL, 100, INI_VA_CLEAN); fail_unless(ret == ENOENT, "Failed to add str. Error: %d", ret); assert_configuration_equal(only_removed_all_duplicates, sizeof(only_removed_all_duplicates), in_cfg); ini_config_destroy(in_cfg); } END_TEST static Suite *ini_configmod_utils_suite(void) { Suite *s = suite_create("ini_configmod"); TCase *tc_delete_properties = tcase_create("delete_properties"); tcase_add_test(tc_delete_properties, test_delete_value_wrong_arguments); tcase_add_test(tc_delete_properties, test_delete_value); suite_add_tcase(s, tc_delete_properties); TCase *tc_update_comments = tcase_create("update_comments"); tcase_add_test(tc_update_comments, test_update_comments_wrong_arguments); tcase_add_test(tc_update_comments, test_update_comments); suite_add_tcase(s, tc_update_comments); TCase *tc_add_string = tcase_create("add_string"); tcase_add_test(tc_add_string, test_add_str_wrong_arguments); tcase_add_test(tc_add_string, test_add_str_simple); tcase_add_test(tc_add_string, test_add_str_duplicate); tcase_add_test(tc_add_string, test_add_str_update_specific_value); tcase_add_test(tc_add_string, test_add_str_update_MODADD); tcase_add_test(tc_add_string, test_add_str_simple_clean); tcase_add_test(tc_add_string, test_add_str_duplicate_clean); tcase_add_test(tc_add_string, test_add_str_duplicate_error); suite_add_tcase(s, tc_add_string); return s; } int main(void) { int number_failed; Suite *s = ini_configmod_utils_suite(); SRunner *sr = srunner_create(s); /* If CK_VERBOSITY is set, use that, otherwise it defaults to CK_NORMAL */ srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/ini/ini_configobj.c000066400000000000000000001501221417260640400171160ustar00rootroot00000000000000/* INI LIBRARY Module represents interface to the main INI object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #include /* For error text */ #include #define _(String) gettext (String) #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "ini_defines.h" #include "ini_valueobj.h" #include "ini_configobj.h" /* Internal structure used during the merge operation */ struct merge_data { struct collection_item *ci; uint32_t flags; int error; int found; }; /* Callback */ void ini_cleanup_cb(const char *property, int property_len, int type, void *data, int length, void *custom_data) { struct value_obj *vo = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Cleaning ", property); /* Banary items are the values */ if(type == COL_TYPE_BINARY) { vo = *((struct value_obj **)(data)); value_destroy(vo); } TRACE_FLOW_EXIT(); } /* Clean the search state */ void ini_config_clean_state(struct ini_cfgobj *ini_config) { TRACE_FLOW_ENTRY(); if (ini_config) { if (ini_config->iterator) col_unbind_iterator(ini_config->iterator); ini_config->iterator = NULL; free(ini_config->section); ini_config->section = NULL; free(ini_config->name); ini_config->name = NULL; ini_config->section_len = 0; ini_config->name_len = 0; } TRACE_FLOW_EXIT(); } /* Traverse the collection and clean the object */ void ini_config_destroy(struct ini_cfgobj *ini_config) { TRACE_FLOW_ENTRY(); ini_config_clean_state(ini_config); if (ini_config) { if (ini_config->cfg) { col_destroy_collection_with_cb(ini_config->cfg, ini_cleanup_cb, NULL); } if (ini_config->last_comment) { ini_comment_destroy(ini_config->last_comment); } if (ini_config->error_list) { col_destroy_collection(ini_config->error_list); } free(ini_config); } TRACE_FLOW_EXIT(); } /* Create a config object */ int ini_config_create(struct ini_cfgobj **ini_config) { int error = EOK; struct ini_cfgobj *new_co = NULL; TRACE_FLOW_ENTRY(); if (!ini_config) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } new_co = malloc(sizeof(struct ini_cfgobj)); if (!new_co) { TRACE_ERROR_NUMBER("Failed to allocate memory", ENOMEM); return ENOMEM; } new_co->cfg = NULL; new_co->boundary = INI_WRAP_BOUNDARY; new_co->last_comment = NULL; new_co->section = NULL; new_co->name = NULL; new_co->section_len = 0; new_co->name_len = 0; new_co->iterator = NULL; new_co->error_list = NULL; new_co->count = 0; /* Create a collection to hold configuration data */ error = col_create_collection(&(new_co->cfg), INI_CONFIG_NAME, COL_CLASS_INI_CONFIG); if (error != EOK) { TRACE_ERROR_NUMBER("Failed to create collection.", error); ini_config_destroy(new_co); return error; } /* Create error list collection */ error = col_create_collection(&(new_co->error_list), INI_ERROR, COL_CLASS_INI_PERROR); if (error) { TRACE_ERROR_NUMBER("Failed to create error list", error); ini_config_destroy(new_co); return error; } *ini_config = new_co; TRACE_FLOW_EXIT(); return error; } /* Callback to set the boundary */ static int ini_boundary_cb(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy) { int error = EOK; struct value_obj *vo = NULL; uint32_t boundary; TRACE_FLOW_ENTRY(); boundary = *((uint32_t *)(custom_data)); /* Banary items are the values */ if(type == COL_TYPE_BINARY) { vo = *((struct value_obj **)(data)); error = value_set_boundary(vo, boundary); } TRACE_FLOW_EXIT(); return error; } /* Set the folding boundary for multiline values. * Use before serializing and saving to a file if the * default boundary of 80 characters does not work for you. */ int ini_config_set_wrap(struct ini_cfgobj *ini_config, uint32_t boundary) { int error = EOK; TRACE_FLOW_ENTRY(); if (!ini_config) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } ini_config->boundary = boundary; error = col_traverse_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT, ini_boundary_cb, (void *)(&(ini_config->boundary))); if (error) { TRACE_ERROR_NUMBER("Failed to set wrapping boundary", error); return error; } TRACE_FLOW_EXIT(); return error; } /* Configuration copy callback */ static int ini_copy_cb(struct collection_item *item, void *ext_data, int *skip) { int error = EOK; struct value_obj *vo = NULL; struct value_obj *new_vo = NULL; TRACE_FLOW_ENTRY(); *skip = 0; /* Binary items are the values */ if(col_get_item_type(item) == COL_TYPE_BINARY) { vo = *((struct value_obj **)(col_get_item_data(item))); error = value_copy(vo, &new_vo); if (error) { TRACE_ERROR_NUMBER("Failed to copy value", error); return error; } error = col_modify_binary_item(item, NULL, &new_vo, sizeof(struct value_obj *)); if (error) { TRACE_ERROR_NUMBER("Failed to copy value", error); value_destroy(new_vo); return error; } } TRACE_FLOW_EXIT(); return error; } /* Check flags for flag */ int ini_flags_have(uint32_t flag, uint32_t flags) { switch (flag) { case INI_MS_MERGE: case INI_MS_ERROR: case INI_MS_OVERWRITE: case INI_MS_PRESERVE: return flag == (flags & INI_MS_MODE_MASK); case INI_MS_DETECT: return flag == (flags & INI_MS_DETECT); default: TRACE_ERROR_NUMBER("Unsupported flag", flag); } return 0; } /* Copy configuration */ int ini_config_copy(struct ini_cfgobj *ini_config, struct ini_cfgobj **ini_new) { int error = EOK; struct ini_cfgobj *new_co = NULL; TRACE_FLOW_ENTRY(); if ((!ini_config) || (!ini_new)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Create a new configuration object */ new_co = malloc(sizeof(struct ini_cfgobj)); if (!new_co) { TRACE_ERROR_NUMBER("Failed to allocate memory", ENOMEM); return ENOMEM; } new_co->cfg = NULL; new_co->boundary = ini_config->boundary; new_co->last_comment = NULL; new_co->section = NULL; new_co->name = NULL; new_co->section_len = 0; new_co->name_len = 0; new_co->iterator = NULL; new_co->error_list = NULL; new_co->count = 0; error = col_copy_collection_with_cb(&(new_co->cfg), ini_config->cfg, INI_CONFIG_NAME, COL_COPY_NORMAL, ini_copy_cb, NULL); if (error) { TRACE_ERROR_NUMBER("Failed to copy collection", error); ini_config_destroy(new_co); return error; } if (ini_config->last_comment) { error = ini_comment_copy(ini_config->last_comment, &(new_co->last_comment)); if (error) { TRACE_ERROR_NUMBER("Failed to copy comment", error); ini_config_destroy(new_co); return error; } } *ini_new = new_co; TRACE_FLOW_EXIT(); return error; } /* Callback to process merging of the sections */ static int merge_section_handler(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy) { int error = EOK; struct value_obj *vo = NULL; struct value_obj *new_vo = NULL; struct value_obj *vo_old = NULL; struct merge_data *passed_data; struct collection_item *acceptor = NULL; struct collection_item *item = NULL; unsigned insertmode; uint32_t mergemode; int suppress = 0; int doinsert = 0; TRACE_FLOW_ENTRY(); if ((type != COL_TYPE_BINARY) || ((type == COL_TYPE_BINARY) && (strncmp(property, INI_SECTION_KEY, sizeof(INI_SECTION_KEY)) == 0))) { /* Skip items we do not care about */ TRACE_FLOW_EXIT(); return EOK; } /* Get value */ vo = *((struct value_obj **)(data)); /* Copy it */ error = value_copy(vo, &new_vo); if (error) { TRACE_ERROR_NUMBER("Failed to copy value", error); return error; } passed_data = (struct merge_data *)(custom_data); acceptor = passed_data->ci; mergemode = passed_data->flags & INI_MV2S_MASK; switch (mergemode) { case INI_MV2S_ERROR: insertmode = COL_INSERT_DUPERROR; doinsert = 1; break; case INI_MV2S_PRESERVE: insertmode = COL_INSERT_DUPERROR; doinsert = 1; suppress = 1; break; case INI_MV2S_ALLOW: insertmode = COL_INSERT_NOCHECK; doinsert = 1; break; case INI_MV2S_OVERWRITE: /* Special handling */ case INI_MV2S_DETECT: default: break; } /* Do not insert but search for dups first */ if (!doinsert) { TRACE_INFO_STRING("Overwrite mode. Looking for:", property); error = col_get_item(acceptor, property, COL_TYPE_BINARY, COL_TRAVERSE_DEFAULT, &item); if (error) { TRACE_ERROR_NUMBER("Failed searching for dup", error); value_destroy(new_vo); return error; } /* Check if there is a dup */ if (item) { /* Check if we are in the detect mode */ if (mergemode == INI_MV2S_DETECT) { passed_data->error = EEXIST; doinsert = 1; insertmode = COL_INSERT_NOCHECK; } else { /* We are in the OVERWRITE mode. * Dup exists - update it. */ vo_old = *((struct value_obj **)(col_get_item_data(item))); error = col_modify_binary_item(item, NULL, &new_vo, sizeof(struct value_obj *)); if (error) { TRACE_ERROR_NUMBER("Failed updating the value", error); value_destroy(new_vo); return error; } /* If we failed to update it is better to leak then crash, * so destroy original value only on the successful update. */ value_destroy(vo_old); } } else { /* No dup found so we can insert with no check */ doinsert = 1; insertmode = COL_INSERT_NOCHECK; } } if (doinsert) { /* Add value to collection */ error = col_insert_binary_property(acceptor, NULL, COL_DSP_END, NULL, 0, insertmode, property, &new_vo, sizeof(struct value_obj *)); if (error) { value_destroy(new_vo); if ((suppress) && (error == EEXIST)) { /* We are here is we do not allow dups * but found one and need to ignore it. */ TRACE_INFO_STRING("Preseved exisitng value", property); error = 0; } else { /* Check if this is a critical error or not */ if ((mergemode == INI_MV2S_ERROR) && (error == EEXIST)) { TRACE_ERROR_NUMBER("Failed to add value object to " "the section in error mode ", error); passed_data->error = EEXIST; *dummy = 1; } else { TRACE_ERROR_NUMBER("Failed to add value object" " to the section", error); return error; } } } } TRACE_FLOW_EXIT(); return error; } /* Internal function to merge two configs */ static int merge_two_sections(struct collection_item *donor, struct collection_item *acceptor, uint32_t flags) { int error = EOK; struct merge_data data; TRACE_FLOW_ENTRY(); data.ci = acceptor; data.flags = flags; data.error = 0; data.found = 0; error = col_traverse_collection(donor, COL_TRAVERSE_ONELEVEL, merge_section_handler, (void *)(&data)); if (error) { TRACE_ERROR_NUMBER("Merge values failed", error); return error; } TRACE_FLOW_EXIT(); return data.error; } /* Callback to process the accepting config */ static int acceptor_handler(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy) { int error = EOK; struct merge_data *passed_data; struct collection_item *acceptor = NULL; struct collection_item *donor = NULL; uint32_t mergemode; TRACE_FLOW_ENTRY(); /* This callback is called when the dup section is found */ passed_data = (struct merge_data *)(custom_data); passed_data->found = 1; donor = passed_data->ci; acceptor = *((struct collection_item **)(data)); mergemode = passed_data->flags & INI_MS_MODE_MASK; if (passed_data->flags & INI_MS_DETECT) { TRACE_INFO_STRING("Detect mode", ""); passed_data->error = EEXIST; } switch (mergemode) { case INI_MS_ERROR: /* Report error and return */ TRACE_INFO_STRING("Error ", "duplicate section"); passed_data->error = EEXIST; break; case INI_MS_PRESERVE: /* Preserve what we have */ TRACE_INFO_STRING("Preserve mode", ""); break; case INI_MS_OVERWRITE: /* Empty existing section */ TRACE_INFO_STRING("Ovewrite mode", ""); error = empty_section(acceptor); if (error) { TRACE_ERROR_NUMBER("Failed to " "empty section", error); return error; } error = merge_two_sections(donor, acceptor, passed_data->flags); if (error) { TRACE_ERROR_NUMBER("Failed to merge " "sections", error); if (error == EEXIST) { passed_data->error = error; } return error; } break; case INI_MS_MERGE: /* Merge */ default: TRACE_INFO_STRING("Merge mode", ""); error = merge_two_sections(donor, acceptor, passed_data->flags); if (error) { if (error != EEXIST) { TRACE_ERROR_NUMBER("Failed to merge " "sections", error); return error; } if (!(passed_data->flags & INI_MS_DETECT)) { passed_data->error = error; } error = EOK; } break; } if (error == EOK) { *dummy = 1; } TRACE_FLOW_EXIT(); return error; } /* Callback to process the donating config */ static int donor_handler(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *dummy) { int error = EOK; struct merge_data *passed_data; struct merge_data acceptor_data; struct collection_item *new_ci = NULL; TRACE_FLOW_ENTRY(); *dummy = 0; /* Opaque data passed to callback is merge data */ passed_data = (struct merge_data *)(custom_data); TRACE_INFO_STRING("Property: ", property); TRACE_INFO_NUMBER("Type is: ", type); TRACE_INFO_NUMBER("Flags: ", passed_data->flags); /* All sections are subcollections */ if(type == COL_TYPE_COLLECTIONREF) { /* Prepare data for the next callback */ acceptor_data.flags = passed_data->flags; acceptor_data.ci = *((struct collection_item **)(data)); acceptor_data.error = 0; acceptor_data.found = 0; /* Try to find same section as the current one */ error = col_get_item_and_do(passed_data->ci, property, COL_TYPE_COLLECTIONREF, COL_TRAVERSE_ONELEVEL, acceptor_handler, (void *)(&acceptor_data)); if (error) { TRACE_ERROR_NUMBER("Critical error", error); return error; } /* Was duplicate found ? */ if (acceptor_data.found) { /* Check for logical error. It can be only EEXIST */ if (acceptor_data.error) { /* Save error anyway */ passed_data->error = acceptor_data.error; /* If it is section DETECT or MERGE+DETECT */ if (ini_flags_have(INI_MS_DETECT, passed_data->flags) || (!ini_flags_have(INI_MS_ERROR, passed_data->flags) && ((passed_data->flags & INI_MV2S_MASK) == INI_MV2S_DETECT))) { TRACE_INFO_NUMBER("Non-critical error", acceptor_data.error); } else { /* In any other mode we need to stop */ TRACE_INFO_NUMBER("Merge error detected", acceptor_data.error); /* Force stop */ *dummy = 1; } } } else { /* Not found? Then create a copy... */ error = col_copy_collection_with_cb(&new_ci, acceptor_data.ci, NULL, COL_COPY_NORMAL, ini_copy_cb, NULL); if (error) { TRACE_ERROR_NUMBER("Failed to copy collection", error); return error; } /* ... and embed into the existing collection */ error = col_add_collection_to_collection(passed_data->ci, NULL, NULL, new_ci, COL_ADD_MODE_EMBED); if (error) { TRACE_ERROR_NUMBER("Failed to copy collection", error); col_destroy_collection(new_ci); return error; } } } TRACE_FLOW_EXIT(); return EOK; } static int merge_comment(struct ini_cfgobj *donor, struct ini_cfgobj *acceptor) { int error = EOK; TRACE_FLOW_ENTRY(); if (donor->last_comment) { if (acceptor->last_comment) { error = ini_comment_add(donor->last_comment, acceptor->last_comment); if (error) { TRACE_ERROR_NUMBER("Merge comment failed", error); return error; } } else { error = ini_comment_copy(donor->last_comment, &(acceptor->last_comment)); if (error) { TRACE_ERROR_NUMBER("Copy comment failed", error); return error; } } } TRACE_FLOW_EXIT(); return EOK; } /* Internal function to merge two configs */ static int merge_configs(struct ini_cfgobj *donor, struct ini_cfgobj *acceptor, uint32_t collision_flags) { int error = EOK; struct merge_data data; TRACE_FLOW_ENTRY(); data.ci = acceptor->cfg; data.flags = collision_flags; data.error = 0; data.found = 0; /* Loop through the donor collection calling * donor_handler callback for every section we find. */ error = col_traverse_collection(donor->cfg, COL_TRAVERSE_ONELEVEL, donor_handler, (void *)(&data)); if (error) { TRACE_ERROR_NUMBER("Merge failed", error); return error; } /* Check if we got error */ if ((data.error) && (ini_flags_have(INI_MS_ERROR, collision_flags) || ((collision_flags & INI_MV2S_MASK) == INI_MV2S_ERROR))) { TRACE_ERROR_NUMBER("Got error in error mode", data.error); return data.error; } /* If boundaries are different re-align the values */ if (acceptor->boundary != donor->boundary) { error = ini_config_set_wrap(acceptor, acceptor->boundary); if (error) { TRACE_ERROR_NUMBER("Failed to re-align", error); return error; } } /* Merge last comment */ error = merge_comment(donor, acceptor); if (error) { TRACE_ERROR_NUMBER("Failed to merge comment", error); return error; } /* Check if we got error */ if ((data.error) && (ini_flags_have(INI_MS_DETECT, collision_flags) || ((collision_flags & INI_MV2S_MASK) == INI_MV2S_DETECT))) { TRACE_ERROR_NUMBER("Got error in error or detect mode", data.error); error = data.error; } TRACE_FLOW_EXIT(); return error; } /* Check if collision flags are valid */ int valid_collision_flags(uint32_t collision_flags) { uint32_t flag; TRACE_FLOW_ENTRY(); flag = collision_flags & INI_MV1S_MASK; if ((flag != INI_MV1S_OVERWRITE) && (flag != INI_MV1S_ERROR) && (flag != INI_MV1S_PRESERVE) && (flag != INI_MV1S_ALLOW) && (flag != INI_MV1S_DETECT)) { TRACE_ERROR_STRING("Invalid value collision flag",""); return 0; } flag = collision_flags & INI_MV2S_MASK; if ((flag != INI_MV2S_OVERWRITE) && (flag != INI_MV2S_ERROR) && (flag != INI_MV2S_PRESERVE) && (flag != INI_MV2S_ALLOW) && (flag != INI_MV2S_DETECT)) { TRACE_ERROR_STRING("Invalid value cross-section collision flag",""); return 0; } /* Any combination of DETECT and a MODE flag is valid. */ flag = collision_flags & INI_MS_MODE_MASK; if ((flag != INI_MS_MERGE) && (flag != INI_MS_OVERWRITE) && (flag != INI_MS_ERROR) && (flag != INI_MS_PRESERVE)) { TRACE_ERROR_STRING("Invalid section collision flag",""); return 0; } TRACE_FLOW_EXIT(); return 1; } /* Merge two configurations together creating a new one */ int ini_config_merge(struct ini_cfgobj *first, struct ini_cfgobj *second, uint32_t collision_flags, struct ini_cfgobj **result) { int error = EOK; struct ini_cfgobj *new_co = NULL; TRACE_FLOW_ENTRY(); /* Check input params */ if ((!first) || (!second) || (!result)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Check collision flags */ if (!valid_collision_flags(collision_flags)) { TRACE_ERROR_NUMBER("Invalid flags.", EINVAL); return EINVAL; } /* NOTE: We assume that the configuration we merge to * is consistent regarding duplicate values. * For example, if the duplicates are not allowed, * the parsing function should have been instructed * to not allow duplicates. * If in future we decide to be explicite we would need * to introduce a "compacting" function and call it here * after we create a copy. * For now it is treated as a corner case and thus not worth * implementing. */ /* Create a new config object */ error = ini_config_copy(first, &new_co); if (error) { TRACE_ERROR_NUMBER("Failed to copy configuration", error); return error; } /* Merge configs */ error = merge_configs(second, new_co, collision_flags); if (error) { TRACE_ERROR_NUMBER("Failed to merge configuration", error); if ((error == EEXIST) && ((ini_flags_have(INI_MS_DETECT, collision_flags) && ((collision_flags & INI_MV2S_MASK) != INI_MV2S_ERROR)) || (!ini_flags_have(INI_MS_ERROR, collision_flags) && ((collision_flags & INI_MV2S_MASK) == INI_MV2S_DETECT)))) { TRACE_ERROR_NUMBER("Got error in detect mode", error); /* Fall through! */ } else { /* Got an error in any other mode */ TRACE_ERROR_NUMBER("Got error in non detect mode", error); ini_config_destroy(new_co); return error; } } *result = new_co; TRACE_FLOW_EXIT(); return error; } /* How many errors do we have in the list ? */ unsigned ini_config_error_count(struct ini_cfgobj *cfg_ctx) { unsigned count = 0; TRACE_FLOW_ENTRY(); count = cfg_ctx->count; TRACE_FLOW_EXIT(); return count; } /* Free error strings */ void ini_config_free_errors(char **errors) { TRACE_FLOW_ENTRY(); col_free_property_list(errors); TRACE_FLOW_EXIT(); } /* Get the list of error strings */ int ini_config_get_errors(struct ini_cfgobj *cfg_ctx, char ***errors) { char **errlist = NULL; struct collection_iterator *iterator = NULL; int error; struct collection_item *item = NULL; struct ini_parse_error *pe; unsigned int count = 0; char *line; TRACE_FLOW_ENTRY(); /* If we have something to print print it */ if ((!errors) || (!cfg_ctx)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } errlist = calloc(cfg_ctx->count + 1, sizeof(char *)); if (!errlist) { TRACE_ERROR_NUMBER("Failed to allocate memory for errors.", ENOMEM); return ENOMEM; } /* Bind iterator */ error = col_bind_iterator(&iterator, cfg_ctx->error_list, COL_TRAVERSE_DEFAULT); if (error) { TRACE_ERROR_NUMBER("Faile to bind iterator:", error); ini_config_free_errors(errlist); return error; } while(1) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { TRACE_ERROR_NUMBER("Error iterating collection", error); col_unbind_iterator(iterator); ini_config_free_errors(errlist); return error; } /* Are we done ? */ if (item == NULL) break; /* Process collection header */ if (col_get_item_type(item) == COL_TYPE_COLLECTION) { continue; } else { /* Put error into provided format */ pe = (struct ini_parse_error *)(col_get_item_data(item)); /* Would be nice to have asprintf function... * ...but for now we know that all the errors * are pretty short and will fir into the predefined * error length buffer. */ line = malloc(MAX_ERROR_LINE + 1); if (!line) { TRACE_ERROR_NUMBER("Failed to get memory for error.", ENOMEM); col_unbind_iterator(iterator); ini_config_free_errors(errlist); return ENOMEM; } snprintf(line, MAX_ERROR_LINE, LINE_FORMAT, col_get_item_property(item, NULL), pe->error, pe->line, ini_get_error_str(pe->error, INI_FAMILY_PARSING)); errlist[count] = line; count++; } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); *errors = errlist; TRACE_FLOW_EXIT(); return error; } int ini_rules_read_from_file(const char *filename, struct ini_cfgobj **_rules_obj) { int ret; struct ini_cfgfile *cfgfile = NULL; if (_rules_obj == NULL) { return EINVAL; } ret = ini_config_create(_rules_obj); if (ret != EOK) { return ret; } ret = ini_config_file_open(filename, 0, &cfgfile); if (ret != EOK) { goto done; } ret = ini_config_parse(cfgfile, 0, INI_MV1S_ALLOW, 0, *_rules_obj); if (ret != EOK) { goto done; } done: if (ret != EOK) { ini_config_destroy(*_rules_obj); *_rules_obj = NULL; } ini_config_file_destroy(cfgfile); return ret; } /* This is used for testing only */ static int ini_dummy_noerror(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { return 0; } /* This is used for testing only */ static int ini_dummy_error(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { return ini_errobj_add_msg(errobj, "Error"); } static int is_allowed_section(const char *tested_section, char **allowed_sections, size_t num_sec, regex_t *allowed_sections_re, size_t num_sec_re, int case_insensitive) { int ret; int i; if (case_insensitive) { for (i = 0; i < num_sec; i++) { if (strcasecmp(tested_section, allowed_sections[i]) == 0) { return 1; } } } else { /* case sensitive */ for (i = 0; i < num_sec; i++) { if (strcmp(tested_section, allowed_sections[i]) == 0) { return 1; } } } for (i = 0; i < num_sec_re; i++) { ret = regexec(&allowed_sections_re[i], tested_section, 0, NULL, 0); if (ret == 0) { return 1; } } return 0; } static int ini_allowed_sections(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { struct value_obj *vo = NULL; int ret; char *regex_str = NULL; char **allowed_sections = NULL; char *insensitive_str; char **cfg_sections = NULL; int num_cfg_sections; char **attributes = NULL; int num_attributes; size_t num_sec = 0; size_t num_sec_re = 0; regex_t *allowed_sections_re = NULL; size_t buf_size; int reg_err; int is_allowed; int case_insensitive = 0; int regcomp_flags = REG_NOSUB; int i; /* Get number of 'section' and 'section_re' attributes * in this rule */ attributes = ini_get_attribute_list(rules_obj, rule_name, &num_attributes, NULL); if (attributes == NULL) { ret = ENOMEM; goto done; } for (i = 0; i < num_attributes; i++) { if (strcmp("section", attributes[i]) == 0) { num_sec++; } if (strcmp("section_re", attributes[i]) == 0) { num_sec_re++; } } ini_free_attribute_list(attributes); if (num_sec == 0 && num_sec_re == 0) { /* This rule is empty. */ ret = ini_errobj_add_msg(errobj, "No allowed sections specified. " "Use 'section = default' to allow only " "default section"); goto done; } ret = ini_get_config_valueobj(rule_name, "case_insensitive", rules_obj, INI_GET_NEXT_VALUE, &vo); if (ret) { goto done; } if (vo) { insensitive_str = ini_get_string_config_value(vo, &ret); if (ret) { goto done; } if (strcasecmp(insensitive_str, "yes") == 0 || strcasecmp(insensitive_str, "true") == 0 || strcmp(insensitive_str, "1") == 0) { case_insensitive = 1; regcomp_flags |= REG_ICASE; } free(insensitive_str); } /* Create arrays for section_re regexes and section name * strings. */ allowed_sections = calloc(num_sec + 1, sizeof(char *)); if (allowed_sections == NULL) { ret = ENOMEM; goto done; } allowed_sections_re = calloc(num_sec_re + 1, sizeof(regex_t)); if (allowed_sections_re == NULL) { ret = ENOMEM; goto done; } /* Get all allowed section names and store them to * allowed_sections array */ for (i = 0; i < num_sec; i++) { ret = ini_get_config_valueobj(rule_name, "section", rules_obj, INI_GET_NEXT_VALUE, &vo); if (ret) { goto done; } allowed_sections[i] = ini_get_string_config_value(vo, &ret); if (ret) { goto done; } } /* Get all regular section_re regular expresions and * store them to allowed_sections_re array */ for (i = 0; i < num_sec_re; i++) { ret = ini_get_config_valueobj(rule_name, "section_re", rules_obj, INI_GET_NEXT_VALUE, &vo); if (ret) { goto done; } regex_str = ini_get_string_config_value(vo, &ret); if (ret) { goto done; } reg_err = regcomp(&allowed_sections_re[i], regex_str, regcomp_flags); if (reg_err) { char *err_str; buf_size = regerror(reg_err, &allowed_sections_re[i], NULL, 0); err_str = malloc(buf_size); if (err_str == NULL) { ret = ENOMEM; goto done; } regerror(reg_err, &allowed_sections_re[i], err_str, buf_size); ret = ini_errobj_add_msg(errobj, "Validator failed to use regex [%s]:[%s]", regex_str, err_str); free(err_str); ret = ret ? ret : EINVAL; goto done; } free(regex_str); regex_str = NULL; } /* Finally get list of all sections in configuration and * check if they are matched by some string in allowed_sections * or regex in allowed_sections_re */ cfg_sections = ini_get_section_list(config_obj, &num_cfg_sections, &ret); if (ret != EOK) { goto done; } for (i = 0; i < num_cfg_sections; i++) { is_allowed = is_allowed_section(cfg_sections[i], allowed_sections, num_sec, allowed_sections_re, num_sec_re, case_insensitive); if (!is_allowed) { ret = ini_errobj_add_msg(errobj, "Section [%s] is not allowed. " "Check for typos.", cfg_sections[i]); if (ret) { goto done; } } } ret = EOK; done: if (allowed_sections != NULL) { for (i = 0; allowed_sections[i] != NULL; i++) { free(allowed_sections[i]); } free(allowed_sections); } if (allowed_sections_re != NULL) { for (i = 0; i < num_sec_re; i++) { regfree(&allowed_sections_re[i]); } free(allowed_sections_re); } ini_free_section_list(cfg_sections); free(regex_str); return ret; } static int check_if_allowed(char *section, char *attr, char **allowed, int num_allowed, struct ini_errobj *errobj) { int is_allowed = 0; int ret; int i; for (i = 0; i < num_allowed; i++) { if (strcmp(attr, allowed[i]) == 0) { is_allowed = 1; break; } } if (!is_allowed) { ret = ini_errobj_add_msg(errobj, "Attribute '%s' is not allowed in " "section '%s'. Check for typos.", attr, section); return ret; } return 0; } static int ini_allowed_options(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { struct value_obj *vo = NULL; int ret; char *section_regex; int num_sections; char **sections = NULL; char **attributes = NULL; int num_attributes; int num_opts = 0; int i; int a; regex_t preg; size_t buf_size; char *err_str = NULL; int reg_err; char **allowed = NULL; /* Get section regex */ ret = ini_get_config_valueobj(rule_name, "section_re", rules_obj, INI_GET_FIRST_VALUE, &vo); if (ret != 0) { return ret; } if (vo == NULL) { ret = ini_errobj_add_msg(errobj, "Validator misses 'section_re' parameter"); if (ret) { return ret; } return EINVAL; } section_regex = ini_get_string_config_value(vo, NULL); if (section_regex == NULL || section_regex[0] == '\0') { ret = ini_errobj_add_msg(errobj, "Validator misses 'section_re' parameter"); if (ret) { return ret; } free(section_regex); return EINVAL; } /* compile the regular expression */ reg_err = regcomp(&preg, section_regex, REG_NOSUB); if (reg_err) { buf_size = regerror(reg_err, &preg, NULL, 0); err_str = malloc(buf_size); if (err_str == NULL) { ret = ENOMEM; goto done; } regerror(reg_err, &preg, err_str, buf_size); ret = ini_errobj_add_msg(errobj, "Cannot compile regular expression from " "option 'section_re'. Error: '%s'", err_str); ret = ret ? ret : EINVAL; goto done; } /* Get all sections from config_obj */ sections = ini_get_section_list(config_obj, &num_sections, &ret); if (ret != EOK) { goto done; } /* Get number of 'option' attributes in this rule * and create an array long enough to store them all */ attributes = ini_get_attribute_list(rules_obj, rule_name, &num_attributes, NULL); if (attributes == NULL) { ret = ENOMEM; goto done; } for (i = 0; i < num_attributes; i++) { if (strcmp("option", attributes[i]) == 0) { num_opts++; } } ini_free_attribute_list(attributes); attributes = NULL; allowed = calloc(num_opts + 1, sizeof(char *)); if (allowed == NULL) { ret = ENOMEM; goto done; } for (i = 0; i < num_opts; i++) { ret = ini_get_config_valueobj(rule_name, "option", rules_obj, INI_GET_NEXT_VALUE, &vo); if (ret) { goto done; } allowed[i] = ini_get_string_config_value(vo, &ret); if (ret) { goto done; } } for (i = 0; i < num_sections; i++) { if (regexec(&preg, sections[i], 0, NULL, 0) == 0) { /* Regex matched section */ /* Get options from this section */ attributes = ini_get_attribute_list(config_obj, sections[i], &num_attributes, NULL); if (attributes == NULL) { ret = ENOMEM; goto done; } for (a = 0; a < num_attributes; a++) { ret = check_if_allowed(sections[i], attributes[a], allowed, num_opts, errobj); if (ret != 0) { goto done; } } ini_free_attribute_list(attributes); attributes = NULL; } } ret = 0; done: if (allowed != NULL) { for (i = 0; allowed[i] != NULL; i++) { free(allowed[i]); } free(allowed); } ini_free_section_list(sections); free(section_regex); ini_free_attribute_list(attributes); regfree(&preg); free(err_str); return ret; } static ini_validator_func * get_validator(char *validator_name, struct ini_validator **validators) { struct ini_validator *ext_validator; /* First we check all internal validators */ if (strcmp(validator_name, "ini_dummy_noerror") == 0) { return ini_dummy_noerror; } else if (strcmp(validator_name, "ini_dummy_error") == 0) { return ini_dummy_error; } else if (strcmp(validator_name, "ini_allowed_options") == 0) { return ini_allowed_options; } else if (strcmp(validator_name, "ini_allowed_sections") == 0) { return ini_allowed_sections; } if (validators == NULL) { return NULL; } for (; *validators != NULL; ++validators) { ext_validator = *validators; /* Skip invalid external validator. Name is required */ if (ext_validator->name == NULL) { continue; } if (strcmp(validator_name, ext_validator->name) == 0) { return ext_validator->func; } } return NULL; } int ini_rules_check(struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_validator **extra_validators, struct ini_errobj *errobj) { char **sections; int ret; int num_sections; char *vname; ini_validator_func *vfunc; struct value_obj *vo = NULL; struct ini_errobj *localerr = NULL; int i; /* Get all sections from the rules object */ sections = ini_get_section_list(rules_obj, &num_sections, &ret); if (ret != EOK) { return ret; } /* Now iterate through all the sections. If the section * name begins with a prefix "rule/", then it is a rule * name. */ for (i = 0; i < num_sections; i++) { if (!strncmp(sections[i], "rule/", sizeof("rule/") - 1)) { ret = ini_get_config_valueobj(sections[i], "validator", rules_obj, INI_GET_FIRST_VALUE, &vo); if (ret != 0) { /* Failed to get value object. This should not * happen. */ continue; } if (vo == NULL) { ret = ini_errobj_add_msg(errobj, "Rule '%s' has no validator.", sections[i]); if (ret != EOK) { return ret; } /* Skip problematic rule */ continue; } vname = ini_get_string_config_value(vo, NULL); vfunc = get_validator(vname, extra_validators); if (vfunc == NULL) { ret = ini_errobj_add_msg(errobj, "Rule '%s' uses unknown " "validator '%s'.", sections[i], vname); if (ret != EOK) { goto done; } /* Skip problematic rule */ free(vname); continue; } free(vname); /* Do not pass global errobj to validators, they * could corrupt it. Create local one for each * validator. */ ret = ini_errobj_create(&localerr); if (ret != EOK) { goto done; } ret = vfunc(sections[i], rules_obj, config_obj, localerr, NULL); if (ret != 0) { /* Just report the error and continue normally, * maybe there are some errors in localerr */ ret = ini_errobj_add_msg(errobj, "Rule '%s' returned error code '%d'", sections[i], ret); if (ret != EOK) { goto done; } } /* Bad validator could destroy the localerr, check * for NULL */ if (localerr == NULL) { continue; } ini_errobj_reset(localerr); while (!ini_errobj_no_more_msgs(localerr)) { ret = ini_errobj_add_msg(errobj, "[%s]: %s", sections[i], ini_errobj_get_msg(localerr)); if (ret != EOK) { goto done; } ini_errobj_next(localerr); } ini_errobj_destroy(&localerr); } } ret = EOK; done: ini_free_section_list(sections); ini_errobj_destroy(&localerr); return ret; } /* This is just convenience function, so that * we manipulate with ini_rules_* functions. */ void ini_rules_destroy(struct ini_cfgobj *rules) { ini_config_destroy(rules); } int ini_errobj_create(struct ini_errobj **_errobj) { struct ini_errobj *new_errobj = NULL; if (_errobj == NULL) { return EINVAL; } new_errobj = calloc(1, sizeof(struct ini_errobj)); if (new_errobj == NULL) { return ENOMEM; } *_errobj = new_errobj; return EOK; } void ini_errobj_destroy(struct ini_errobj **errobj) { struct ini_errmsg *to_remove; if (errobj == NULL || *errobj == NULL) { return; } while ((*errobj)->first_msg) { to_remove = (*errobj)->first_msg; (*errobj)->first_msg = (*errobj)->first_msg->next; free(to_remove->str); free(to_remove); } free(*errobj); *errobj = NULL; } int ini_errobj_add_msg(struct ini_errobj *errobj, const char *format, ...) { int ret; va_list args; struct ini_errmsg *new; new = calloc(1, sizeof(struct ini_errmsg)); if (new == NULL) { return ENOMEM; } va_start(args, format); ret = vasprintf(&new->str, format, args); va_end(args); if (ret == -1) { free(new); return ENOMEM; } if (errobj->count == 0) { /* First addition to the list, all pointers are NULL */ errobj->first_msg = new; errobj->last_msg = new; errobj->cur_msg = new; errobj->count++; } else { errobj->last_msg->next = new; errobj->last_msg = errobj->last_msg->next; errobj->count++; } return EOK; } void ini_errobj_reset(struct ini_errobj *errobj) { errobj->cur_msg = errobj->first_msg; } const char *ini_errobj_get_msg(struct ini_errobj *errobj) { if (errobj->cur_msg != NULL) { return errobj->cur_msg->str; } /* Should this be allowed? */ return NULL; } void ini_errobj_next(struct ini_errobj *errobj) { if (errobj->cur_msg != NULL) { errobj->cur_msg = errobj->cur_msg->next; } /* If we can not move next, just return */ return; } int ini_errobj_no_more_msgs(struct ini_errobj *errobj) { return errobj->cur_msg == NULL; } size_t ini_errobj_count(struct ini_errobj *errobj) { return errobj->count; } ding-libs-0.6.2/ini/ini_configobj.h000066400000000000000000002441641417260640400171350ustar00rootroot00000000000000/* INI LIBRARY Header file for the ini configuration interface. THIS IS THE PREFERRED INTERFACE TO USE. Copyright (C) Dmitri Pal 2010 - 2012 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_CONFIGOBJ_H #define INI_CONFIGOBJ_H #include #include #include #include #include #include "simplebuffer.h" #include "ini_valueobj.h" #ifndef DING_ATTR_FORMAT # if ((__GNUC__ > 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3))) # define DING_ATTR_FORMAT(fmt, args) __attribute__((__format__(__printf__, fmt, args))) # else # define DING_ATTR_FORMAT(fmt, args) # endif #endif /** @mainpage The INI configuration interface * * The goal of the this interface is to allow applications * to read configuration from an INI file. * * So why yet another library to read data from an INI file? * As we started the SSSD project we looked around for a * open source library that would meet the following * requirements: * - Is written in C (not C++) * - Is lightweight. * - Has an live community. * - Supported on multiple platforms . * - Can evolve as we build SSSD solution. * - Can deal with different types of values including arrays. * - Can deal with sections that are related to each other * and can form a hierarchy of sections. * - Has a compatible license we can use. * * We have seen several solutions but none was able to fully address * our requirements. As a result we started developing our own * INI parsing library. * * Currently INI parser allows reading and merging INI files * and getting a resulting configuration in one object. * * One of the main advantages of this interface is that * the library is created with the idea of reading the configuration * data, not managing it. Thus currently you will not find * any function that alters the configuration data read from the files. * There is a set of proposed enhancements to be able to manipulate * the configuration data and save it back but there has been no real * driver for it. This API is focused on letting applications read data * from a file (or files) and interpret it, not to generate configuration * files. There are all sorts of different tools that already do that. * * The INI configuration interface uses COLLECTION (see libcollection * interface) to store data internally. * * Concepts: * - INI file consists of the key value pairs. * - Keys and values are separated by the equal sign. * Spaces around equal sign are trimmed. Everything before the equal * sign is the key, everything after is the value. * - Comments are the lines that start with ";" or "#" in the first * position of the line. * - Library now supports multi-line values. Values that span across multiple * lines should start with a single space on every new line. * - After being read both keys and values are stored in the internal * objects. * - Application configuration can consist from multiple files. * For example, there can be a generic file in /etc containing * configuration for all applications of a particular class running * on a box and then there might be a special file * with parameters specific for each application in the * /etc/whatever.d directory. Interface does not allow reading * multiple files in one call. Instead files need to be read separately * and then merged together. A helper function to do so might be added * later. * - If there is no section in the file or there are key value pairs * declared before the first section, those pairs will be placed into * the default section with the name "default". * - All values are treated as strings. Spaces are trimmed at the beginning * and the end of the value. The value ends at the end of the line. * If values is too long, an error will be returned. * - Parsing of a value happens when a caller tries to interpret * the value. The caller can use different functions to do this. * The value can be treated as numeric, logical, string, binary, * array of strings or array of numbers. In case of arrays parsing functions * accept separators that will be used to slice the value into the array * of elements. * - If there is any error parsing section and key values it can be * intercepted by the caller. There are different modes that the library * supports regarding error handling. See details in the description * of individual functions. * - The library allows ini files with fragmented sections. This means that * a section can be scattered across the file. Flags control what to * do in such situation. * - The library allows storing and retrieving multiple key value pairs with * the same key in one section. * * There is a deprecated interface that can be found in ini_config.h. * This interface is supported only for backwards compatibility and should * not be used. */ /** * @defgroup structures Structures * * All structures used in the interface should be treated as internal opaque objects. * * @{ * * @} */ /** * @defgroup bomType Types of configutration file encodings * * Constants that define how configuration file is encoded. * * @{ */ /** Enumeration of the encoding types. */ enum index_utf_t { INDEX_UTF32BE = 0, /**< The file is encoded in 'big-endian' 32-bit */ INDEX_UTF32LE = 1, /**< The file is encoded in 'little-endian' 32-bit */ INDEX_UTF16BE = 2, /**< The file is encoded in 'big-endian' 16-bit */ INDEX_UTF16LE = 3, /**< The file is encoded in 'little-endian' 16-bit */ INDEX_UTF8 = 4, /**< The file is encoded in standard UTF8 but has BOM */ INDEX_UTF8NOBOM = 5 /**< The file is encoded in standard UTF8 without BOM */ }; /** * @} */ /** * @defgroup errorlevel Error tolerance constants * * Constants in this section define what to do if * error or warning encountered while parsing the INI file. * * @{ */ /** Enumeration of error levels. */ enum ERR_LEVEL { INI_STOP_ON_ANY = 0, /**< Fail if any problem is detected. */ INI_STOP_ON_NONE = 1, /**< Best effort - do not fail. */ INI_STOP_ON_ERROR = 2 /**< Fail on errors only. */ }; /** * @} */ /** * @defgroup parseerr Parsing errors and warnings * * Parsing errors and warnings * * @{ */ /** Enumeration of parsing errors. */ enum ERR_PARSE { ERR_LONGDATA = 1, /**< Line is too long (Error). */ ERR_NOCLOSESEC, /**< No closing bracket in section definition (Error). */ ERR_NOSECTION, /**< Section name is missing (Error). */ ERR_SECTIONLONG, /**< Section name too long (Error). */ ERR_NOEQUAL, /**< No equal sign (Error). */ ERR_NOKEY, /**< No key before equal sign (Error). */ ERR_LONGKEY, /**< Key is too long (Error). */ ERR_READ, /**< Failed to read line (Error). */ ERR_SPACE, /**< Line starts with space when it should not (Error). */ ERR_DUPKEY, /**< Duplicate key is not allowed (Error). */ ERR_DUPKEYSEC, /**< Duplicate key is detected while merging sections (Error). */ ERR_DUPSECTION, /**< Duplicate section is not allowed (Error). */ ERR_SPECIAL, /**< Line contains invalid characters (Error). */ ERR_TAB, /**< Line starts with tab when it should not (Error). */ ERR_BADCOMMENT, /**< End of file while processing comment (Error). */ ERR_MAXPARSE = ERR_BADCOMMENT /**< Special value. Size of the error array. */ }; /** * @} */ /** * @defgroup metacollect Constants that define what meta data to collect * * Constants in this section define what meta data to collect * * * @{ */ /** @brief Do not collect any data. */ #define INI_META_NONE 0 /** @brief Collect file stats. */ #define INI_META_STATS 1 /** * @} */ /** * @defgroup accesscheck Access control check flags * * @{ */ /** * @brief Validate access mode * * If this flag is specified the mode parameter * will be matched against the permissions set on the file * using the provided mask. */ #define INI_ACCESS_CHECK_MODE 0x00000001 /** * @brief Validate uid * * Provided uid will be checked against uid * of the file. */ #define INI_ACCESS_CHECK_UID 0x00000002 /** * @brief Validate gid * * Provided gid will be checked against gid * of the file. */ #define INI_ACCESS_CHECK_GID 0x00000004 /** * @} */ /** * @defgroup collisionflags Flags that define collision resolution logic. * * @{ */ /** * @defgroup onesecvalue Colliding values come from one section * * Flags that define collision resolution logic for values in * the same section. * These flags should be used during parsing to handle duplicate * keys in the same section of the ini file. * * @{ */ /** @brief Value with same key is overwritten */ #define INI_MV1S_OVERWRITE 0x0000 /** @brief Collision causes error */ #define INI_MV1S_ERROR 0x0001 /** @brief Second value is discarded */ #define INI_MV1S_PRESERVE 0x0002 /** @brief Duplicates are allowed */ #define INI_MV1S_ALLOW 0x0003 /** @brief Duplicates are allowed but errors are logged */ #define INI_MV1S_DETECT 0x0004 /** * @} */ /** * @defgroup twosecvalue Colliding values come from two sections * * Flags that define collision resolution logic between two values * that come from two sections with the same name. * These flags should be used during parsing to handle duplicate * keys coming from the same section scattered across the ini file. * These flags also can be used to specify the rules of merging * values that come from two different configuration files. * * @{ */ /** @brief Value with same key is overwritten */ #define INI_MV2S_OVERWRITE 0x0000 /** @brief Collision causes error */ #define INI_MV2S_ERROR 0x0010 /** @brief Second value is discarded */ #define INI_MV2S_PRESERVE 0x0020 /** @brief Duplicates are allowed */ #define INI_MV2S_ALLOW 0x0030 /** @brief Duplicates are allowed but errors are logged */ #define INI_MV2S_DETECT 0x0040 /** * @} */ /** * @defgroup mergesec Collision in two sections * * Flags that define collision resolution logic between two sections. * These flags should be used during parsing to handle duplicate * sections scattered across the ini file. * These flags also can be used to specify the rules of merging * sections that come from two different configuration files. * * @{ */ /** @brief Sections are merged */ #define INI_MS_MERGE 0x0000 /** @brief Collision causes error */ #define INI_MS_ERROR 0x0100 /** @brief First section is discarded */ #define INI_MS_OVERWRITE 0x0200 /** @brief Second section is discarded */ #define INI_MS_PRESERVE 0x0300 /** @brief Log errors if duplicate sections are detected; non-exclusive */ /** This defaults to MERGE, but can be used with OVERWRITE and PRESERVE **/ #define INI_MS_DETECT 0x0400 /** * @} */ /** * @} */ /** * @defgroup parseflags Flags that define parsing rules * * Flags that define how the file should be parsed. * * @{ */ /** @brief Suppress multi line value wrapping */ #define INI_PARSE_NOWRAP 0x0001 /** @brief No spaces are allowed to the left of the key */ #define INI_PARSE_NOSPACE 0x0002 /** @brief No tabs are allowed to the left of the key */ #define INI_PARSE_NOTAB 0x0004 /** @brief Do not allow C-style comments */ #define INI_PARSE_NO_C_COMMENTS 0x0008 /** @brief Skip lines that are not KVPs */ #define INI_PARSE_IGNORE_NON_KVP 0x0010 /** * @} */ /** * @defgroup searchmode Constants that define how to look for a value * * Configuration file can allow several keys with the same name * in one section. Use the constants below to define which * value you are looking for. * You can search for the next value only if you are looking * for the same section and key as in the previous search. If you * specify INI_GET_NEXT_VALUE but the section or key is * different from the values that were used in the previous search * the value will be ignored and the function will act as if * INI_GET_FIRST_VALUE is specified. * This functionality allows creating an attribute list and * actually fetching every value including duplicate values * in a single loop. * * @{ */ /** Enumeration of parsing errors. */ enum INI_GET { INI_GET_FIRST_VALUE, /**< Get the first value (default). */ INI_GET_NEXT_VALUE, /**< Look for the next value in the section */ INI_GET_LAST_VALUE /**< Look for the last value in the section */ }; /** * @} */ /** * @defgroup augment Constants and structures related to augmentation. * * @{ */ /** Structure to pass access check parameters to augmentation function. * */ struct access_check { uint32_t flags; /**< Define what to check. * One can check file * permissions with mask, * uid, and gid of the file. * See \ref accesscheck constants. */ uid_t uid; /**< Expected uid of the file. */ gid_t gid; /**< Expected gid of the file.*/ mode_t mode; /**< Expected mode of the file. */ mode_t mask; /**< Mask to use in the mode check. * Mask is always adjusted to * include at least S_IRWXU, * S_IRWXG and S_IRWXO. */ }; /** Enumeration of augmentation modes. */ enum augmode { INI_AUG_ANY = 0, /**< Allow any augmentation. */ INI_AUG_ADD = 1, /**< Allow only new sections. */ INI_AUG_OVER = 2 /**< Allow section updates. */ }; /** * @} */ /** * @brief Name of the default section. * * This is the name of the implied section where orphan key-value * pairs will be put. */ #define INI_DEFAULT_SECTION "default" /** * @defgroup structures Structures * @{ */ struct ini_cfgobj; struct ini_cfgfile; /** @brief Structure that holds error number and * line number for the encountered error. */ struct ini_parse_error; /** * @} */ /** * @defgroup ini_core Core interface functions * * Functions in this section allow manipulation with the configuration file, * parsing data from the configuration file and storing it in a configuration * object, merging configuration objects and other operations. * * For functions to create or alter configuration object in memory * see \ref ini_mod. * * @{ * */ /** * @brief Create a configuration object. * * Allocates an object that will store configuration data. * Configuration object is populated by parsing a file. * * @param[out] ini_config Configuration object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_create(struct ini_cfgobj **ini_config); /** * @brief Destroy a configuration object. * * Frees configuration data. * * @param[in] ini_config Configuration object. * */ void ini_config_destroy(struct ini_cfgobj *ini_config); /** * @brief Flush cached search data. * * Frees cached search data. This will cause * any iteration over the same keys to start over. * * @param[in] ini_config Configuration object. * */ void ini_config_clean_state(struct ini_cfgobj *ini_config); /** * @brief Create a configuration file object. * * Create a file object for parsing a configuration file. * * A "configuration file object" is different from * a "configuration object". The former stores metadata * about a file the configuration data is read from, * while the latter holds the configuration itself. * * @param[in] filename Name or path to the ini file. * This argument can contain * a short or a fully qualified * file name. If a short name is * specified the full path * will be resolved internally. * @param[in] metadata_flags Flags that specify what additional * data if any needs to be collected * about the ini file. See \ref metacollect. * @param[out] file_ctx Configuration file object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_file_open(const char *filename, uint32_t metadata_flags, struct ini_cfgfile **file_ctx); /** * @brief Create a configuration file object using memory buffer. * * Create a file object for parsing a configuration file. * Configuration will use provided memory instead of the actual file. * * A "configuration file object" is different from * a "configuration object". The former stores metadata * about a file the configuration data is read from, * while the latter holds the configuration itself. * * @param[in] data_buf In memory configuration data. * Needs to be NULL terminated. * @param[in] data_len Length of memory data * not including terminating NULL. * @param[out] file_ctx Configuration file object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_file_from_mem(void *data_buf, uint32_t data_len, struct ini_cfgfile **file_ctx); /** * @brief Close configuration file after parsing * * Closes file but keeps the context. File can be reopened * and reread using \ref ini_config_file_reopen function. * * @param[in] file_ctx Configuration file object. * */ void ini_config_file_close(struct ini_cfgfile *file_ctx); /** * @brief Reopen the configuration file * * Creates a new file object from the original one. * The file configuration objects then can be compared * to determine whether the file actually changed. * * @param[in] file_ctx_in Original configuration file object. * @param[out] file_ctx_out A new configuration file object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_file_reopen(struct ini_cfgfile *file_ctx_in, struct ini_cfgfile **file_ctx_out); /** * @brief Close configuration file and free all data * * Closes file and frees the context. * * @param[in] file_ctx Configuration file object. * */ void ini_config_file_destroy(struct ini_cfgfile *file_ctx); /** * @brief Save configuration in a backup configuration file * * Creates a backup version of the data in a given configuration file. * It is expected that file context was created by some open or reopen * function first. Then the caller can make this call to save the data * aside before parsing the configuration file and making changes to it. * * The caller can specify a backup directory to save the file in. * If directory is not specified then a current working directory will * be used. If the directory is invalid or caller does not have access to it * an error will be returned. * *>The template specifies the file name to use for the backup. *>For example: *> my_file.conf.%d.save *> my_file%d.conf.bak *>The template can contain only one '%d' placeholder. This placeholder * will be replaced by a number. If previously created backup files * are found in the given directory. The function will start with 1 and will * try to find an available unused file name in the given directory * up until it reaches the limit specified in the max_num argument. * Function will return EEXIST if it runs out of attempts to save the file. * * The caller can optionally pass an access structure. The access structure * would specify what mode and ownership to use for the newly created file. * If the access structure is not specified the access data of the original * file context will be used. If file object does not have stats explicitly * read at the time when the object is created then the stats will be collected * but not saved. If the file was a memory mapped file and no access * structure is passed in, the function will use effective UID and GID of the * running process and mode will be set to: S_IFREG | S_IRUSR | S_IWUSR * * @param[in] file_ctx File context of the file to backup. * @param[in] backup_dir Path to backup directory. Can be NULL. * @param[in] backup_tpl File name template with %d placeholder. * @param[in] backup_access Optional access overwrite structure. * See \ref access_check for more details. * @param[in] max_num Maximum number of retries to try to create * a specific backup file. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EIXIST - All possible backup file names are already taken. * @return ENOMEM - No memory. * * Function can return other errors that standard libc functions line open, * chmod, and chown return. */ int ini_config_file_backup(struct ini_cfgfile *file_ctx, const char *backup_dir, const char *backup_tpl, struct access_check *backup_access, unsigned max_num); /** * @brief Change permissions and ownership of the file * * Function changes access mode and permissions of the file associated * with the given context. If there is no file associated with the context * because the context is created using a memory buffer, then the function * will return an error EINVAL. * * @param[in] file_ctx File context of the file to change access. * @param[in] new_access Structure that defines what access should * be set on the file. * See \ref access_check for more details. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * * Function can return other errors that standard chmod and chown * functions return. */ int ini_config_change_access(struct ini_cfgfile *file_ctx, struct access_check *new_access); /** * @brief Save configuration in a file * * Function is a wrapper around \ref ini_config_save_as with * argument filename as NULL. * * For more information see \ref ini_config_save_as. */ int ini_config_save(struct ini_cfgfile *file_ctx, struct access_check *new_access, struct ini_cfgobj *ini_config); /* Save configuration in a file using existing context but with a new name */ /** * @brief Save configuration with a new name. * * Function uses an existing file context but a new file name. * The file context will be used to perform operation to save file. * By default the ownership, mode and BOM of the new file will be derived * from the existing context. The rest of the context will be reinitialized. * Configuration will be serialized and saved in the file using encoding * specified by BOM type. The BOM prefix will also be added if needed. * After saving the file the function initializes the context and reads the * file back. At this moment the file context is ready for the parsing * again. * * @param[in] file_ctx File context to use for saving. * @param[in] filename Name of the file to save into. If NULL * the file name of the context will be used. * If the context was originally created * as a memory mapped configuration buffer * and filename is NULL the function will * return error EINVAL. * @param[in] new_access Structure that defines what access should * be set on the file. * See \ref access_check for more details. * @param[in] ini_config Configuration to save. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * * Function can return other errors that standard open, chmod and chown * functions return. */ int ini_config_save_as(struct ini_cfgfile *file_ctx, const char *filename, struct access_check *new_access, struct ini_cfgobj *ini_config); /** * @brief Return the encoding indicator. * * When the file object is created the configuration data is inspected for * encoding indicator called BOM. This function returns a constant that * indicates what type of BOM was detected. * * @param[in] file_ctx File context. * * Function returns the constant of type enum index_utf_t. */ enum index_utf_t ini_config_get_bom(struct ini_cfgfile *file_ctx); /** * @brief Set the encoding indicator. * * When the file object is created the configuration data is inspected for * encoding indicator called BOM. The BOM indicator is recorded in the file * object and used when the file is saved. If the caller wants to change * the encoding before saving he can use this function to alter the BOM type. * * @param[in] file_ctx File context. * @param[in] bom BOM type indicator to set. * * * @return 0 - Success. * @return EINVAL - Invalid parameter. */ int ini_config_set_bom(struct ini_cfgfile *file_ctx, enum index_utf_t bom); /** * @brief Check parsing errors count * * Query the configuration file object about * how many parsing errors were found during last * parsing operation. * * @param[in] ini_config Configuration object. * * @return Number of errors. */ unsigned ini_config_error_count(struct ini_cfgobj *ini_config); /** * @brief Get array of parsing errors * * Function returns a newly allocated array of strings * that should be later freed by the \ref ini_config_free_errors * function. * Array can be referenced as a normal array of strings. * The NULL entry indicates the end of the array. * * @param[in] ini_config Configuration object. * @param[out] errors Array of error strings. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_get_errors(struct ini_cfgobj *ini_config, char ***errors); /** * @brief Free array of parsing errors * * Free array of parsing errors previously allocated * by using \ref ini_config_get_errors function. * * @param[in] errors Array of error strings. * */ void ini_config_free_errors(char **errors); /** * @brief Print errors to a file * * Prints array of parsing errors previously allocated * by using \ref ini_config_get_errors function into * a provided file. * * @param[in] file File or stream to send errors to. * @param[in] error_list Array of error strings. * */ void ini_config_print_errors(FILE *file, char **error_list); /** * @brief Get the fully resolved file name * * Returns the full name to the configuration file * that was resolved by the library. * * @param[in] file_ctx Configuration file object. * * @return Full file name. */ const char *ini_config_get_filename(struct ini_cfgfile *file_ctx); /** * @brief Get pointer to collected stat data * * Returns the pointer to the internal stat structure. * If stat data was not collected when the file was open * function would return NULL. * * @param[in] file_ctx Configuration file object. * * @return Pointer to the stat structure. */ const struct stat *ini_config_get_stat(struct ini_cfgfile *file_ctx); /** * @brief Print file context * * Function is useful for debugging purposes only. * * @param[in] file_ctx Configuration file object. * */ void ini_config_file_print(struct ini_cfgfile *file_ctx); /** * @brief Check file properties * * Before parsing it makes sense to make sure * that the file you are trying to read is properly * owned and has proper permissions. * * @param[in] file_ctx Configuration file object. * @param[in] flags Define what to check. * One can check file * permissions with mask, * uid, and gid of the file. * See \ref accesscheck. * @param[in] uid Expected uid of the file. * @param[in] gid Expected gid of the file. * @param[in] mode Expected mode of the file. * @param[in] mask Mask to use in the mode check. * Mask is always adjusted to * include at least S_IRWXU, * S_IRWXG and S_IRWXO * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EACCES - File attributes do no match expectations. */ int ini_config_access_check(struct ini_cfgfile *file_ctx, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask); /** * @brief Check if file has changed * * Compares two configuration file objects. * Determines if two objects are different * by comparing: * - time stamp * - device ID * - i-node * * Function can be used to check if the file * has changed since last time the it was read. * * Note: If the file was deleted and quickly * re-created the kernel seems to restore the same i-node. * The stat structure keeps time granularity of seconds. * As a result if the file is quickly recreated * with the same contents like in the unit test the check * would assume that file did not change. * This is why the unit test has a one second delay. * * @param[in] file_ctx1 First configuration file object. * @param[in] file_ctx2 Second configuration file object. * @param[out] changed A value will be set to 0 if * the objects are same and to 1 * if they are different. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return EACCES - File attributes do no match expectations. */ int ini_config_changed(struct ini_cfgfile *file_ctx1, struct ini_cfgfile *file_ctx2, int *changed); /** * @brief Parse the file and populate a configuration object * * Function parses the file. It is assumed that * the configuration object was just created. * Using a non empty configuration object in * a parsing operation would fail with EINVAL. * * @param[in] file_ctx Configuration file object. * @param[in] error_level Flags that control actions * in case of parsing error. * See \ref errorlevel. * @param[in] collision_flags Flags that control handling * of the duplicate sections or keys. * See \ref collisionflags. * @param[in] parse_flags Flags that control parsing process, * for example how to handle spaces at * the beginning of the line. * See \ref parseflags. * @param[out] ini_config Configuration object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_parse(struct ini_cfgfile *file_ctx, int error_level, uint32_t collision_flags, uint32_t parse_flags, struct ini_cfgobj *ini_config); /** * @brief Create a copy of the configuration object * * Function creates a deep copy of all the configuration data. * Error list created during parsing is not copied over. * * @param[in] ini_config Original configuration object. * @param[out] ini_new A new configuration object. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_copy(struct ini_cfgobj *ini_config, struct ini_cfgobj **ini_new); /** * @brief Merge two configuration objects * * Function merges configuration objects and creates * a new resulting object out of the two. * IMPORTANT: Use same collision flags for reading * of the files and then merging. * Mixing the flags would lead to strange results * that would be hard to debug. * * * @param[in] first A base object * the other object will * be merged with. * @param[in] second The object that will * be merged to the first one. * @param[in] collision_flags Flags that control handling * of the duplicate sections or keys. * See \ref collisionflags. * @param[out] result A new configuration object, * the result of the merge. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_merge(struct ini_cfgobj *first, struct ini_cfgobj *second, uint32_t collision_flags, struct ini_cfgobj **result); /** * @brief Augment configuration * * Function merges the main configuration file * with the configuration file snippets * read from a specified directory * ordered according to the locale setting. * * @param[in] base_cfg A configuration object * that will be augmented. * @param[in] path Path to a directory where * configuration snippets * will be read from. * @param[in] patterns List of regular expressions * that the name of a snippet file * has to match to be considered * for merge. These use POSIX Basic Regular * Expressions. * @param[in] sections List of regular expressions * that the section names in the snippet * file need to match. If file contains * sections that do not match any patterns * the file is skipped and error is recorded. * These use POSIX Basic Regular Expressions. * @param[in] check_perm Pointer to structure that * holds criteria for the * access check. * @param[in] error_level Flags that control actions * in case of parsing error in a snippet file. * See \ref errorlevel. * @param[in] collision_flags These flags control how the potential * collisions between keys and sections * within the snippet file will be handled. * For more information * see \ref collisionflags. * @param[in] parse_flags Flags that control parsing process, * for example how to handle spaces at * the beginning of the line. * See \ref parseflags. * @param[in] merge_flags Flags that control handling * of the duplicate sections or keys * during merging of the snippets. * They are different from the collision flags * because duplicate sections and keys inside * are snippets most likely will be handled as * 'last value wins' while during merge * the attempt to overwrite * a specific section might be treated as * an error. * See \ref mergesec. * @param[out] result_cfg A new configuration object, * the result of the merge. * @param[out] error_list List of strings that * contains all encountered * errors. * It can be NULL, in this case list of errors * is not populated. * @param[out] success_list List of strings that * contains file names of snippets that were * successfully merged. * It can be NULL, in this case list of files * is not populated. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_augment(struct ini_cfgobj *base_cfg, const char *path, const char *patterns[], const char *sections[], struct access_check *check_perm, int error_level, uint32_t collision_flags, uint32_t parse_flags, uint32_t merge_flags, struct ini_cfgobj **result_cfg, struct ref_array **error_list, struct ref_array **success_list); /** * @brief Set the folding boundary * * Set the folding boundary for multiline values. * Use before serializing and saving to a file if the * default boundary of 80 characters does not work for you. * * @param[in] ini_config Configuration object. * @param[in] boundary Wrapping boundary. * * @return 0 - Success. * @return EINVAL - Invalid parameter. */ int ini_config_set_wrap(struct ini_cfgobj *ini_config, uint32_t boundary); /** * @brief Serialize configuration object * * Serialize configuration object into provided buffer. * Use buffer object functions to manipulate or save * the buffer to a file/stream. * * @param[in] ini_config Configuration object. * @param[out] sbobj Serialized configuration. * * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. */ int ini_config_serialize(struct ini_cfgobj *ini_config, struct simplebuffer *sbobj); /* Functions that add, modify or delete sections and values in * the configuration object can be found in section \ref ini_mod. */ /** * @} */ /** * @defgroup ini_section_and_attr Section and attribute management * * Functions in this section allow getting the lists of * sections in the configuration file and keys in a section * as arrays of strings. * * @{ * */ /** * @brief Get list of sections. * * Get list of sections from the configuration object * as an array of strings. * Function allocates memory for the array of the sections. * Use \ref ini_free_section_list() to free allocated memory. * * @param[in] ini_config Configuration object. * @param[out] size If not NULL parameter will * receive number of sections * in the configuration. * @param[out] error If not NULL parameter will * receive the error code. * 0 - Success. * EINVAL - Invalid parameter. * ENOMEM - No memory. * * @return Array of strings. */ char **ini_get_section_list(struct ini_cfgobj *ini_config, int *size, int *error); /** * @brief Free list of sections. * * The section array created by \ref ini_get_section_list() * should be freed using this function. * * @param[in] section_list Array of strings returned by * \ref ini_get_section_list() function. */ void ini_free_section_list(char **section_list); /** * @brief Get list of attributes. * * Get list of attributes in a section as an array of strings. * Function allocates memory for the array of attributes. * Use \ref ini_free_attribute_list() to free allocated memory. * * @param[in] ini_config Configuration object. * @param[in] section Section name. * @param[out] size If not NULL parameter will * receive number of attributes * in the section. * @param[out] error If not NULL parameter will * receive the error code. * 0 - Success. * EINVAL - Invalid parameter. * ENOMEM - No memory. * * @return Array of strings. */ char **ini_get_attribute_list(struct ini_cfgobj *ini_config, const char *section, int *size, int *error); /** * @brief Free list of attributes. * * The attribute array created by \ref ini_get_attribute_list() * should be freed using this function. * * @param[in] attr_list Array of strings returned by * \ref ini_get_attribute_list() function. */ void ini_free_attribute_list(char **attr_list); /** * @} */ /** * @defgroup ini_value Value management * * This section contains value management functions. These functions * can be used to interpret values that are stored in the configuration * object in memory. * * @{ * */ /** * @brief Retrieve a value object form the configuration. * * Check return error code first. If the function returns * an error there is a serious problem. * Then check if object is found. Function will set * vo parameter to NULL if no attribute with * provided name is found in the collection. * * @param[in] section Section name. * If NULL assumed default. * @param[in] name Attribute name to find. * @param[in] ini_config Configuration object to search. * @param[in] mode See \ref searchmode "search mode" * section for more info. * @param[out] vo Value object. * Will be set to NULL if * element with the given name * is not found. * @return 0 - Success. * @return EINVAL - Invalid parameter. * @return ENOMEM - No memory. * */ int ini_get_config_valueobj(const char *section, const char *name, struct ini_cfgobj *ini_config, int mode, struct value_obj **vo); /** * @brief Convert value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an int number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from INT_MIN to INT_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int ini_get_int_config_value(struct value_obj *vo, int strict, int def, int *error); /** * @brief Convert value object to a unsigned number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an unsigned number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to UINT_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned ini_get_unsigned_config_value(struct value_obj *vo, int strict, unsigned def, int *error); /** * @brief Convert value to long number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into a long number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from LONG_MIN to LONG_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ long ini_get_long_config_value(struct value_obj *vo, int strict, long def, int *error); /** * @brief Convert value to unsigned long number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an unsigned long number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULONG_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned long ini_get_ulong_config_value(struct value_obj *vo, int strict, unsigned long def, int *error); /** * @brief Convert value to int32_t number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an int32_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from INT_MIN to INT_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int32_t ini_get_int32_config_value(struct value_obj *vo, int strict, int32_t def, int *error); /** * @brief Convert value to uint32_t number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration value * into an uint32_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULONG_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ uint32_t ini_get_uint32_config_value(struct value_obj *vo, int strict, uint32_t def, int *error); /** * @brief Convert value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an int64_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from LLONG_MIN to LLONG_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ int64_t ini_get_int64_config_value(struct value_obj *vo, int strict, int64_t def, int *error); /** * @brief Convert value to integer number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an uint64_t number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * The value range is from 0 to ULLONG_MAX. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ERANGE - Value is out of range. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ uint64_t ini_get_uint64_config_value(struct value_obj *vo, int strict, uint64_t def, int *error); /** * @brief Convert value to floating point number. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into a floating point number. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * If "strict" parameter is non zero the function will fail * if there are more characters after the last digit. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] strict Fail the function if * the symbol after last digit * is not valid. * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ double ini_get_double_config_value(struct value_obj *vo, int strict, double def, int *error); /** * @brief Convert value into a logical value. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into a Boolean. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] def Default value to use if * conversion failed. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * * @return Converted value. * In case of failure the function returns default value and * sets error code into the provided variable. */ unsigned char ini_get_bool_config_value(struct value_obj *vo, unsigned char def, int *error); /** * @brief Get the copy of string stored in the configuration value * * Function creates a copy of the string value stored in * the configuration element. * Returned value needs to be freed after use. * If error occurred the returned value will be NULL. * * @param[in] vo Value object to use. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - ENOMEM - No memory. * * @return Copy of the string or NULL. */ char *ini_get_string_config_value(struct value_obj *vo, int *error); /** * @brief Get the string stored in the configuration value * * Function returns a reference to the string value * stored inside the configuration element. This string can't be altered. * The string will go out of scope if the value object is deleted. * * @param[in] vo Value object to use. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * * @return String from the value object. */ const char *ini_get_const_string_config_value(struct value_obj *vo, int *error); /** * @brief Convert value into a binary sequence. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into a sequence of bytes. * Any of the conversion functions * can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * The function allocates memory. * It is the responsibility of the caller to free it after use. * Use \ref ini_free_bin_config_value() for this purpose. * Functions will return NULL if conversion failed. * * Function assumes that the value being interpreted * has a special format. * The string should be taken in single quotes * and consist of hex encoded value represented by * two hex digits per byte. * Case does not matter. * * Example: '0a2BFeCc' * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[out] length Variable that optionally receives * the length of the binary * sequence. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed due * invalid characters. * - ENOMEM - No memory. * * @return Converted value. * In case of failure the function returns NULL. */ char *ini_get_bin_config_value(struct value_obj *vo, int *length, int *error); /** * @brief Free binary buffer * * Free binary value returned by \ref ini_get_bin_config_value(). * * @param[in] bin Binary buffer to free. * */ void ini_free_bin_config_value(char *bin); /** * @brief Convert value to an array of strings. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration value object * into an array of strings. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * Separator string includes up to three different separators. * If separator NULL, comma is assumed. * The spaces are trimmed automatically around separators * in the string. * The function drops empty tokens from the list. * This means that the string like this: "apple, ,banana, ,orange ," * will be translated into the list of three items: * "apple","banana" and "orange". * * The length of the allocated array is returned in "size". * Size and error parameters can be NULL. * Use \ref ini_free_string_config_array() to free the array after use. * * The array is always NULL terminated so * it is safe not to get size and just loop until * array element is NULL. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] sep String cosisting of separator * symbols. For example: ",.;" would mean * that comma, dot and semicolon * should be treated as separators * in the value. * @param[out] size Variable that optionally receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of strings. * In case of failure the function returns NULL. */ char **ini_get_string_config_array(struct value_obj *vo, const char *sep, int *size, int *error); /** * @brief Convert value to an array of strings. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an array of strings. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * Separator string includes up to three different separators. * If separator NULL, comma is assumed. * The spaces are trimmed automatically around separators * in the string. * The function does not drop empty tokens from the list. * This means that the string like this: "apple, ,banana, ,orange ," * will be translated into the list of five items: * "apple", "", "banana", "" and "orange". * * The length of the allocated array is returned in "size". * Size and error parameters can be NULL. * Use \ref ini_free_string_config_array() to free the array after use. * * The array is always NULL terminated so * it is safe not to get size and just loop until * array element is NULL. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[in] sep String cosisting of separator * symbols. For example: ",.;" would mean * that comma, dot and semicolon * should be treated as separators * in the value. * @param[out] size Variable that optionally receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of strings. * In case of failure the function returns NULL. */ char **ini_get_raw_string_config_array(struct value_obj *vo, const char *sep, int *size, int *error); /** * @brief Convert value to an array of long values. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an array of long values. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * Separators inside the string are detected automatically. * The spaces are trimmed automatically around separators * in the string. * * The length of the allocated array is returned in "size". * Size parameter can't be NULL. * * Use \ref ini_free_long_config_array() to free the array after use. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[out] size Variable that receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ERANGE - Value is out of range. * - ENOMEM - No memory. * * @return Array of long values. * In case of failure the function returns NULL. */ long *ini_get_long_config_array(struct value_obj *vo, int *size, int *error); /** * @brief Convert value to an array of floating point values. * * This is a conversion function. * It converts the value read from the INI file * and stored in the configuration element * into an array of floating point values. Any of the conversion * functions can be used to try to convert the value * stored as a string inside the value object. * The result can be different depending upon * how the caller tries to interpret the value. * * Separators inside the string are detected automatically. * The spaces are trimmed automatically around separators * in the string. * * The length of the allocated array is returned in "size". * Size parameter can't be NULL. * * Use \ref ini_free_double_config_array() to free the array after use. * * @param[in] vo Value object to interpret. * It must be retrieved using * \ref ini_get_config_valueobj(). * @param[out] size Variable that receives * the size of the array. * @param[out] error Variable will get the value * of the error code if * error happened. * Can be NULL. In this case * function does not set * the code. * Codes: * - 0 - Success. * - EINVAL - Argument is invalid. * - EIO - Conversion failed. * - ENOMEM - No memory. * * @return Array of floating point values. * In case of failure the function returns NULL. */ double *ini_get_double_config_array(struct value_obj *vo, int *size, int *error); /** * @brief Free array of string values. * * Use this function to free the array returned by * \ref ini_get_string_config_array() or by * \ref ini_get_raw_string_config_array(). * * @param[in] str_config Array of string values. */ void ini_free_string_config_array(char **str_config); /** * @brief Free array of long values. * * Use this function to free the array returned by * \ref ini_get_long_config_array(). * * @param[in] array Array of long values. */ void ini_free_long_config_array(long *array); /** * @brief Free array of floating pointer values. * * Use this function to free the array returned by * \ref ini_get_double_config_array(). * * @param[in] array Array of floating pointer values. */ void ini_free_double_config_array(double *array); /** @brief Structure that holds error messages * generated by validators. */ struct ini_errobj; /** * @brief Create structure to hold error messages. * * This function initiates structure that can be used to * hold error messages from generators. To add messages to * the structure use \ref ini_errobj_add_msg. * * @param[out] _errobj container for errors. * * @return Zero on success, nonzero value in case of error. */ int ini_errobj_create(struct ini_errobj **_errobj); /** * @brief Free structure that holds error messages. * * This function is used to free structure * previously created by \ref ini_errobj_create. * * @param[in] errobj container for errors. */ void ini_errobj_destroy(struct ini_errobj **errobj); /** * @brief Add new printf formated message to errobj. * * This function initiates structure that can be used to * hold error messages from generators. To add messages to * the structure use \ref ini_errobj_add_msg. * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. * @param[in] format printf format string * * @return Zero on success, nonzero value in case of error. */ int ini_errobj_add_msg(struct ini_errobj *errobj, const char *format, ...) DING_ATTR_FORMAT(2, 3); /** * @brief Reset iterator in errobj. * * After calling this function, the iterator in errobj * will point to the first error message. Use this if * you need to accesss the list multiple times in a loop. * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. */ void ini_errobj_reset(struct ini_errobj *errobj); /** * @brief Get pointer to current message in errobj. * * This function returns pointer to current message * pointed by the internal iterator. The returned string can * not be changed and will point to valid data only * until \ref ini_errobj_destroy is called. * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. * @return String inside the errobj structure. String * is valid until errobj is destroyed. */ const char *ini_errobj_get_msg(struct ini_errobj *errobj); /** * @brief Move to the next message in errobj. * * This function moves the internal iterator of errobj * to the next message in list. * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. */ void ini_errobj_next(struct ini_errobj *errobj); /** * @brief Check if errobj has more messages. * * This function returns true if errobj's internal iterator * reached end of list and no longer points to a message * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. * @return True if internal iterator reached end of list. */ int ini_errobj_no_more_msgs(struct ini_errobj *errobj); /** * @brief Return number of messages in errobj * * This function returns number of messages inside errobj * * @param[in] errobj container for errors previously * created by \ref ini_errobj_create. * @return Number of messages stored in errobj. */ size_t ini_errobj_count(struct ini_errobj *errobj); typedef int (ini_validator_func)(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data); typedef int (ini_schema_validator_func)(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_errobj *errobj, void **data); /** @brief Structure used to define application specific * (external to libini) validator */ struct ini_validator { const char *name; ini_validator_func *func; /* currently unused, for future expansion */ ini_schema_validator_func *schema_validator; }; /** * @brief Read rules from INI file * * This function is used to read rules from INI file * and store them in config object. This special * config object is passed to \ref ini_rules_check * together with config object representing the * configuration that will be checked. * * @param[in] filename Name of file with rules * @param[out] _rules_obj config object representing the rules * @return Zero on success. Non zero value on error. */ int ini_rules_read_from_file(const char *filename, struct ini_cfgobj **_rules_obj); /** * @brief Check configuration file using rules * * This function is used to check if configuration * file applies to rules previously loaded by * \ref ini_rules_read_from_file. Any errors * detected in the configuration are stored in the * errobj structure. Error code returned by this * function indicates some internal error with * validators or memory allocation error (not * rule violation). * * @param[in] rules_obj config object representing the rules * @param[in] config_obj config object representing the * configuration * @param[in] extra_validators NULL terminated array of external * validators. Can be NULL if no external * validators are used. * * @param[in] errobj errobj to store generated errors * from validators. * * @return Zero on success. Non zero value on error. */ int ini_rules_check(struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_validator **extra_validators, struct ini_errobj *errobj); /** * @brief Free the rules * * This function is just wrapper around ini_config_destroy */ void ini_rules_destroy(struct ini_cfgobj *ini_config); /** * @} */ #endif ding-libs-0.6.2/ini/ini_defines.h000066400000000000000000000101221417260640400165730ustar00rootroot00000000000000/* INI LIBRARY Header file for the internal constants for the INI interface. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_DEFINES_H #define INI_DEFINES_H #include #define NAME_OVERHEAD 10 #define SLASH "/" /* Name of the special collection used to store parsing errors */ #define FILE_ERROR_SET "ini_file_error_set" /* Text error strings used when errors are printed out */ #define WARNING_TXT _("Warning") #define ERROR_TXT _("Error") /* For parse errors */ #define WRONG_COLLECTION _("Passed in list is not a list of parse errors.\n") #define FAILED_TO_PROCCESS _("Internal Error. Failed to process error list.\n") #define ERROR_HEADER _("Parsing errors and warnings in file: %s\n") /* For grammar errors */ #define WRONG_GRAMMAR _("Passed in list is not a list of grammar errors.\n") #define FAILED_TO_PROC_G _("Internal Error. Failed to process list of grammar errors.\n") #define ERROR_HEADER_G _("Logical errors and warnings in file: %s\n") /* For validation errors */ #define WRONG_VALIDATION _("Passed in list is not a list of validation errors.\n") #define FAILED_TO_PROC_V _("Internal Error. Failed to process list of validation errors.\n") #define ERROR_HEADER_V _("Validation errors and warnings in file: %s\n") #define LINE_FORMAT _("%s (%d) on line %d: %s") #define MAX_ERROR_LINE 120 /* Codes that parsing function can return */ #define RET_PAIR 0 #define RET_COMMENT 1 #define RET_SECTION 2 #define RET_INVALID 3 #define RET_EMPTY 4 #define RET_EOF 5 #define RET_ERROR 6 #define INI_ERROR "errors" #define INI_METADATA "meta" #define INI_ERROR_NAME "errname" #define INI_CONFIG_NAME "INI" #define INI_SECTION_KEY "[" /* Internal sizes. MAX_KEY is defined in config.h */ #define MAX_VALUE PATH_MAX #define BUFFER_SIZE MAX_KEY + MAX_VALUE + 3 /* Beffer length used for int to string conversions */ #define CONVERSION_BUFFER 80 /* Size of the block for a value */ #define INI_VALUE_BLOCK 100 /* Default boundary */ #define INI_WRAP_BOUNDARY 80 /* This constant belongs here. */ #define COL_CLASS_INI_BASE 20000 #define COL_CLASS_INI_CONFIG COL_CLASS_INI_BASE + 0 #define COL_CLASS_INI_SECTION COL_CLASS_INI_BASE + 1 /** * @brief Name of the default section. * * This is the name of the implied section where orphan key-value * pairs will be put. */ #define INI_DEFAULT_SECTION "default" /** * @brief A one level collection of parse errors. * * Collection stores \ref parse_error structures. */ #define COL_CLASS_INI_PERROR COL_CLASS_INI_BASE + 2 /** * @brief Collection of metadata. * * Collection that stores metadata. */ #define COL_CLASS_INI_META COL_CLASS_INI_BASE + 4 /* Family of errors */ #define INI_FAMILY_PARSING 0 #define INI_FAMILY_VALIDATION 1 #define INI_FAMILY_GRAMMAR 2 #define INI_MV1S_MASK 0x000F /* Merge values options mask * for one section */ #define INI_MV2S_MASK 0x00F0 /* Merge values options mask * for two sections. */ #define INI_MS_MASK 0x0F00 /* Merge section options mask */ #define INI_MS_MODE_MASK 0x0300 /* Merge section merge mode mask */ /* Different error string functions can be passed as callbacks */ typedef const char * (*error_fn)(int error); int ini_flags_have(uint32_t flag, uint32_t flags); #endif ding-libs-0.6.2/ini/ini_fileobj.c000066400000000000000000001335141417260640400165760ustar00rootroot00000000000000/* INI LIBRARY File context related functions Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #include #include #include "trace.h" #include "ini_defines.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "path_utils.h" #define ICONV_BUFFER 5000 #define BOM4_SIZE 4 #define BOM3_SIZE 3 #define BOM2_SIZE 2 static const char *encodings[] = { "UTF-32BE", "UTF-32LE", "UTF-16BE", "UTF-16LE", "UTF-8", "UTF-8" }; /* Close file but not destroy the object */ void ini_config_file_close(struct ini_cfgfile *file_ctx) { TRACE_FLOW_ENTRY(); if(file_ctx) { if(file_ctx->file) { fclose(file_ctx->file); file_ctx->file = NULL; } } TRACE_FLOW_EXIT(); } /* Close file context and destroy the object */ void ini_config_file_destroy(struct ini_cfgfile *file_ctx) { TRACE_FLOW_ENTRY(); if(file_ctx) { free(file_ctx->filename); simplebuffer_free(file_ctx->file_data); if(file_ctx->file) fclose(file_ctx->file); free(file_ctx); } TRACE_FLOW_EXIT(); } /* How much I plan to read? */ static size_t how_much_to_read(size_t left, size_t increment) { if(left > increment) return increment; else return left; } static enum index_utf_t check_bom(enum index_utf_t ind, unsigned char *buffer, size_t len, size_t *bom_shift) { TRACE_FLOW_ENTRY(); if (len >= BOM4_SIZE) { if ((buffer[0] == 0x00) && (buffer[1] == 0x00) && (buffer[2] == 0xFE) && (buffer[3] == 0xFF)) { TRACE_FLOW_RETURN(INDEX_UTF32BE); *bom_shift = BOM4_SIZE; return INDEX_UTF32BE; } else if ((buffer[0] == 0xFF) && (buffer[1] == 0xFE) && (buffer[2] == 0x00) && (buffer[3] == 0x00)) { TRACE_FLOW_RETURN(INDEX_UTF32LE); *bom_shift = BOM4_SIZE; return INDEX_UTF32LE; } } if (len >= BOM3_SIZE) { if ((buffer[0] == 0xEF) && (buffer[1] == 0xBB) && (buffer[2] == 0xBF)) { TRACE_FLOW_RETURN(INDEX_UTF8); *bom_shift = BOM3_SIZE; return INDEX_UTF8; } } if (len >= BOM2_SIZE) { if ((buffer[0] == 0xFE) && (buffer[1] == 0xFF)) { TRACE_FLOW_RETURN(INDEX_UTF16BE); *bom_shift = BOM2_SIZE; return INDEX_UTF16BE; } else if ((buffer[0] == 0xFF) && (buffer[1] == 0xFE)) { TRACE_FLOW_RETURN(INDEX_UTF16LE); *bom_shift = BOM2_SIZE; return INDEX_UTF16LE; } } TRACE_FLOW_RETURN(ind); return ind; } static int read_chunk(FILE *file, size_t left, size_t increment, char *position, size_t *read_num) { int error = EOK; size_t to_read = 0; size_t read_cnt = 0; TRACE_FLOW_ENTRY(); to_read = how_much_to_read(left, increment); TRACE_INFO_NUMBER("About to read", to_read); read_cnt = fread(position, to_read, 1, file); TRACE_INFO_NUMBER("Read", read_cnt * to_read); if (read_cnt == 0) { error = ferror(file); if (error) { TRACE_ERROR_NUMBER("Failed to read data from file", error); return error; } error = feof(file); if(error) { TRACE_FLOW_EXIT(); return EOK; } TRACE_ERROR_NUMBER("Failed to read data from file", EIO); return EIO; } *read_num = to_read; TRACE_FLOW_EXIT(); return error; } /* Function useful for debugging */ /* static void print_buffer(char *read_buffer, int len) { int i; for (i=0; i < len; i++) { printf("%02X ", (unsigned char)read_buffer[i]); } printf("\n"); } */ /* Internal initialization part */ static int initialize_conv(unsigned char *read_buf, size_t read_cnt, int *initialized, size_t *bom_shift, enum index_utf_t *in_ind, iconv_t *conv) { int error = EOK; enum index_utf_t ind = INDEX_UTF8NOBOM; TRACE_FLOW_ENTRY(); if (*initialized == 0) { TRACE_INFO_STRING("Reading first time.","Checking BOM"); ind = check_bom(ind, (unsigned char *)read_buf, read_cnt, bom_shift); TRACE_INFO_STRING("Converting to", encodings[INDEX_UTF8NOBOM]); TRACE_INFO_STRING("Converting from", encodings[ind]); errno = 0; *conv = iconv_open(encodings[INDEX_UTF8], encodings[ind]); if (*conv == (iconv_t) -1) { error = errno; TRACE_ERROR_NUMBER("Failed to create converter", error); return error; } *initialized = 1; *in_ind = ind; } else *bom_shift = 0; TRACE_FLOW_EXIT(); return error; } /* Internal conversion part */ static int common_file_convert(FILE *file, struct ini_cfgfile *file_ctx, uint32_t size) { int error = EOK; size_t read_cnt = 0; size_t total_read = 0; size_t in_buffer = 0; iconv_t conv = (iconv_t)-1; size_t conv_res = 0; char read_buf[ICONV_BUFFER+1]; char result_buf[ICONV_BUFFER]; char *src, *dest; size_t to_convert = 0; size_t room_left = 0; size_t bom_shift = 0; int initialized = 0; enum index_utf_t ind = INDEX_UTF8NOBOM; TRACE_FLOW_ENTRY(); do { /* print_buffer(read_buf, ICONV_BUFFER); */ error = read_chunk(file, size - total_read, ICONV_BUFFER - in_buffer, read_buf + in_buffer, &read_cnt); /* print_buffer(read_buf, ICONV_BUFFER); */ if (error) { if (conv != (iconv_t) -1) iconv_close(conv); TRACE_ERROR_NUMBER("Failed to read chunk", error); return error; } /* Prepare source buffer for conversion */ src = read_buf; to_convert = read_cnt + in_buffer; in_buffer = 0; /* Do initialization if needed */ error = initialize_conv((unsigned char *)read_buf, read_cnt, &initialized, &bom_shift, &ind, &conv); if (error) { TRACE_ERROR_NUMBER("Failed to initialize", error); return error; } src += bom_shift; to_convert -= bom_shift; total_read += read_cnt; file_ctx->bom = ind; TRACE_INFO_NUMBER("Total read", total_read); do { /* Do conversion */ dest = result_buf; room_left = ICONV_BUFFER; TRACE_INFO_NUMBER("To convert", to_convert); TRACE_INFO_NUMBER("Room left", room_left); TRACE_INFO_NUMBER("Total read", total_read); errno = 0; conv_res = iconv(conv, &src, &to_convert, &dest, &room_left); if (conv_res == (size_t) -1) { error = errno; switch(error) { case EILSEQ: TRACE_ERROR_NUMBER("Invalid multibyte encoding", error); iconv_close(conv); return error; case EINVAL: /* We need to just read more if we can */ TRACE_INFO_NUMBER("Incomplete sequence len", src - read_buf); TRACE_INFO_NUMBER("File size.", size); if (total_read == size) { /* Or return error if we can't */ TRACE_ERROR_NUMBER("Incomplete sequence", error); iconv_close(conv); return error; } memmove(read_buf, src, to_convert); in_buffer = to_convert; break; case E2BIG: TRACE_INFO_STRING("No room in the output buffer.", ""); error = simplebuffer_add_raw(file_ctx->file_data, result_buf, ICONV_BUFFER - room_left, ICONV_BUFFER); if (error) { TRACE_ERROR_NUMBER("Failed to store converted bytes", error); iconv_close(conv); return error; } continue; default: TRACE_ERROR_NUMBER("Unexpected internal error", error); iconv_close(conv); return ENOTSUP; } } /* The whole buffer was sucessfully converted */ error = simplebuffer_add_raw(file_ctx->file_data, result_buf, ICONV_BUFFER - room_left, ICONV_BUFFER); if (error) { TRACE_ERROR_NUMBER("Failed to store converted bytes", error); iconv_close(conv); return error; } /* TRACE_INFO_STRING("Saved procesed portion.", (char *)simplebuffer_get_vbuf(file_ctx->file_data)); */ break; } while (1); } while (total_read < size); iconv_close(conv); /* Open file */ TRACE_INFO_STRING("File data", (char *)simplebuffer_get_vbuf(file_ctx->file_data)); TRACE_INFO_NUMBER("File len", simplebuffer_get_len(file_ctx->file_data)); TRACE_INFO_NUMBER("Size", size); errno = 0; file_ctx->file = fmemopen(simplebuffer_get_vbuf(file_ctx->file_data), simplebuffer_get_len(file_ctx->file_data), "r"); if (!(file_ctx->file)) { error = errno; TRACE_ERROR_NUMBER("Failed to open file", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Internal common initialization part */ static int common_file_init(struct ini_cfgfile *file_ctx, void *data_buf, uint32_t data_len) { int error = EOK; FILE *file = NULL; int stat_ret = 0; uint32_t size = 0; void *internal_data = NULL; uint32_t internal_len = 0; unsigned char alt_buffer[2] = {0, 0}; uint32_t alt_buffer_len = 1; TRACE_FLOW_ENTRY(); if (data_buf) { if(data_len) { internal_data = data_buf; internal_len = data_len; } else { /* If buffer is empty fmemopen will return an error. * This will prevent creation of adefault config object. * Instead we will use buffer that has at least one character. */ internal_data = alt_buffer; internal_len = alt_buffer_len; } TRACE_INFO_NUMBER("Inside file_init len", internal_len); TRACE_INFO_STRING("Inside file_init data:", (char *)internal_data); file = fmemopen(internal_data, internal_len, "r"); if (!file) { error = errno; TRACE_ERROR_NUMBER("Failed to memmap file", error); return error; } size = internal_len; } else { TRACE_INFO_STRING("File", file_ctx->filename); /* Open file to get its size */ errno = 0; file = fopen(file_ctx->filename, "r"); if (!file) { error = errno; TRACE_ERROR_NUMBER("Failed to open file", error); return error; } /* Get the size of the file */ errno = 0; stat_ret = fstat(fileno(file), &(file_ctx->file_stats)); if (stat_ret == -1) { error = errno; fclose(file); TRACE_ERROR_NUMBER("Failed to get file stats", error); return error; } size = file_ctx->file_stats.st_size; } /* Trick to overcome the fact that * fopen and fmemopen behave differently when file * is 0 length */ if (size) { error = common_file_convert(file, file_ctx, size); if (error) { TRACE_ERROR_NUMBER("Failed to convert file", error); fclose(file); return error; } } else { TRACE_INFO_STRING("File is 0 length",""); errno = 0; file_ctx->file = fdopen(fileno(file), "r"); if (!(file_ctx->file)) { error = errno; fclose(file); TRACE_ERROR_NUMBER("Failed to fdopen file", error); return error; } } fclose(file); /* Collect stats */ if (file_ctx->metadata_flags & INI_META_STATS) { file_ctx->stats_read = 1; } else { memset(&(file_ctx->file_stats), 0, sizeof(struct stat)); file_ctx->stats_read = 0; } TRACE_FLOW_EXIT(); return EOK; } /* Create a file object for parsing a config file */ int ini_config_file_open(const char *filename, uint32_t metadata_flags, struct ini_cfgfile **file_ctx) { int error = EOK; struct ini_cfgfile *new_ctx = NULL; TRACE_FLOW_ENTRY(); if ((!filename) || (!file_ctx)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Allocate structure */ new_ctx = malloc(sizeof(struct ini_cfgfile)); if (!new_ctx) { TRACE_ERROR_NUMBER("Failed to allocate file ctx.", ENOMEM); return ENOMEM; } new_ctx->filename = NULL; new_ctx->file = NULL; new_ctx->file_data = NULL; new_ctx->bom = INDEX_UTF8NOBOM; error = simplebuffer_alloc(&(new_ctx->file_data)); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer ctx.", error); ini_config_file_destroy(new_ctx); return error; } /* Store flags */ new_ctx->metadata_flags = metadata_flags; /* Construct the full file path */ new_ctx->filename = malloc(PATH_MAX + 1); if (!(new_ctx->filename)) { ini_config_file_destroy(new_ctx); TRACE_ERROR_NUMBER("Failed to allocate memory for file path.", ENOMEM); return ENOMEM; } /* Construct path */ error = make_normalized_absolute_path(new_ctx->filename, PATH_MAX, filename); if(error) { TRACE_ERROR_NUMBER("Failed to resolve path", error); ini_config_file_destroy(new_ctx); return error; } /* Do common init */ error = common_file_init(new_ctx, NULL, 0); if(error) { TRACE_ERROR_NUMBER("Failed to do common init", error); ini_config_file_destroy(new_ctx); return error; } *file_ctx = new_ctx; TRACE_FLOW_EXIT(); return error; } /* Create a file object from a memory buffer */ int ini_config_file_from_mem(void *data_buf, uint32_t data_len, struct ini_cfgfile **file_ctx) { int error = EOK; struct ini_cfgfile *new_ctx = NULL; TRACE_FLOW_ENTRY(); if ((!data_buf) || (!file_ctx)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Allocate structure */ new_ctx = malloc(sizeof(struct ini_cfgfile)); if (!new_ctx) { TRACE_ERROR_NUMBER("Failed to allocate file ctx.", ENOMEM); return ENOMEM; } new_ctx->filename = NULL; new_ctx->file = NULL; new_ctx->file_data = NULL; new_ctx->metadata_flags = 0; new_ctx->bom = INDEX_UTF8NOBOM; error = simplebuffer_alloc(&(new_ctx->file_data)); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer ctx.", error); ini_config_file_destroy(new_ctx); return error; } /* Put an empty string into the file name */ new_ctx->filename = strdup(""); if (!(new_ctx->filename)) { ini_config_file_destroy(new_ctx); TRACE_ERROR_NUMBER("Failed to put empty string into filename.", ENOMEM); return ENOMEM; } /* Do common init */ error = common_file_init(new_ctx, data_buf, data_len); if(error) { TRACE_ERROR_NUMBER("Failed to do common init", error); ini_config_file_destroy(new_ctx); return error; } *file_ctx = new_ctx; TRACE_FLOW_EXIT(); return error; } /* Create a file object from existing one */ int ini_config_file_reopen(struct ini_cfgfile *file_ctx_in, struct ini_cfgfile **file_ctx_out) { int error = EOK; struct ini_cfgfile *new_ctx = NULL; TRACE_FLOW_ENTRY(); if ((!file_ctx_in) || (!file_ctx_out)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Allocate structure */ new_ctx = malloc(sizeof(struct ini_cfgfile)); if (!new_ctx) { TRACE_ERROR_NUMBER("Failed to allocate file ctx.", ENOMEM); return ENOMEM; } new_ctx->file = NULL; new_ctx->file_data = NULL; new_ctx->filename = NULL; error = simplebuffer_alloc(&(new_ctx->file_data)); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer ctx.", error); ini_config_file_destroy(new_ctx); return error; } /* Store flags */ new_ctx->metadata_flags = file_ctx_in->metadata_flags; /* Copy full file path */ errno = 0; new_ctx->filename = strndup(file_ctx_in->filename, PATH_MAX); if (!(new_ctx->filename)) { error = errno; ini_config_file_destroy(new_ctx); TRACE_ERROR_NUMBER("Failed to allocate memory for file path.", error); return error; } new_ctx->bom = file_ctx_in->bom; /* Do common init */ error = common_file_init(new_ctx, NULL, 0); if(error) { TRACE_ERROR_NUMBER("Failed to do common init", error); ini_config_file_destroy(new_ctx); return error; } *file_ctx_out = new_ctx; TRACE_FLOW_EXIT(); return error; } /* Function to construct file name */ static int create_file_name(const char *dir, const char *tpl, unsigned count, char **filename) { char *resolved = NULL; char *full_name = NULL; int ret = 0; const char *dir_to_use; char dirbuf[PATH_MAX * 2 + 1]; TRACE_FLOW_ENTRY(); /* We checked the template so it should be safe */ ret = asprintf(&resolved, tpl, count); if (ret == -1) { TRACE_ERROR_NUMBER("First asprintf falied.", ENOMEM); return ENOMEM; } /* If directory is not provided use current */ if (dir) dir_to_use = dir; else { memset(dirbuf, 0 , PATH_MAX * 2 + 1); dir_to_use = getcwd(dirbuf, PATH_MAX * 2); } ret = asprintf(&full_name, "%s/%s", dir_to_use, resolved); free(resolved); if (ret == -1) { TRACE_ERROR_NUMBER("Second asprintf falied.", ENOMEM); return ENOMEM; } *filename = full_name; TRACE_FLOW_EXIT(); return EOK; } /* Function to determine which permissions to use */ static int determine_permissions(struct ini_cfgfile *file_ctx, struct access_check *overwrite, uid_t *uid_ptr, gid_t *gid_ptr, mode_t *mode_ptr) { int error = EOK; uid_t uid = 0; gid_t gid = 0; mode_t mode = 0; struct stat stats; int ret = 0; TRACE_FLOW_ENTRY(); /* Prepare default uid, gid, mode */ if (file_ctx->stats_read) { uid = file_ctx->file_stats.st_uid; gid = file_ctx->file_stats.st_gid; mode = file_ctx->file_stats.st_mode; } else if (*(file_ctx->filename) != '\0') { /* If file name is known check the file */ memset(&stats, 0, sizeof(struct stat)); ret = stat(file_ctx->filename, &stats); if (ret == -1) { error = errno; TRACE_ERROR_NUMBER("Stat falied.", error); return error; } uid = stats.st_uid; gid = stats.st_gid; mode = stats.st_mode; } else { /* Use process properties */ uid = geteuid(); gid = getegid(); /* Regular file that can be read or written by owner only */ mode = S_IRUSR | S_IWUSR; } /* If caller specified "overwrite" data overwrite the defaults */ if (overwrite) { overwrite->flags &= INI_ACCESS_CHECK_MODE | INI_ACCESS_CHECK_GID | INI_ACCESS_CHECK_UID; if (overwrite->flags == 0) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Mode is specified */ if (overwrite->flags & INI_ACCESS_CHECK_MODE) { mode = overwrite->mode; } /* Check uid */ if (overwrite->flags & INI_ACCESS_CHECK_UID) { uid = overwrite->uid; } /* Check gid */ if (overwrite->flags & INI_ACCESS_CHECK_GID) { gid = overwrite->gid; } } *uid_ptr = uid; *gid_ptr = gid; *mode_ptr = mode; TRACE_FLOW_EXIT(); return EOK; } /* Create file and set proper permissions */ static int open_new_file(const char *filename, uid_t uid, gid_t gid, mode_t mode, int check, int *fd_ptr) { int error = EOK; int ret = 0; int fd; TRACE_FLOW_ENTRY(); if (check) { errno = 0; fd = open(filename, O_RDONLY); if (fd != -1) { close(fd); TRACE_ERROR_NUMBER("File already exists.", error); return EEXIST; } else { error = errno; if (error == EACCES) { TRACE_ERROR_NUMBER("Failed to open file.", error); return error; } } } /* Keep in mind that umask of the process has impactm, see man pages. */ errno = 0; fd = creat(filename, mode); if (fd == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to create file.", error); return error; } errno = 0; ret = fchmod(fd, mode); if (ret == -1) { error = errno; close(fd); TRACE_ERROR_NUMBER("Failed to chmod file.", error); return error; } errno = 0; ret = fchown(fd, uid, gid); if (ret == -1) { error = errno; close(fd); TRACE_ERROR_NUMBER("Failed to chown file.", error); return error; } *fd_ptr = fd; TRACE_FLOW_EXIT(); return EOK; } /* Function to do the encoding */ static int do_encoding(struct ini_cfgfile *file_ctx, struct simplebuffer *sb) { int error = EOK; iconv_t encoder; char *src, *dest; size_t to_convert = 0; size_t room_left = 0; char result_buf[ICONV_BUFFER]; size_t conv_res = 0; TRACE_FLOW_ENTRY(); encoder = iconv_open(encodings[file_ctx->bom], encodings[INDEX_UTF8NOBOM]); if (encoder == (iconv_t) -1) { error = errno; TRACE_ERROR_NUMBER("Failed to create converter", error); return error; } src = (char *)simplebuffer_get_vbuf(file_ctx->file_data); to_convert = (size_t)simplebuffer_get_len(file_ctx->file_data); do { /* There is only one loop since everything is already read. * We loop only if output buffer is not enough. */ dest = result_buf; room_left = ICONV_BUFFER; errno = 0; conv_res = iconv(encoder, &src, &to_convert, &dest, &room_left); if (conv_res == (size_t) -1) { error = errno; switch(error) { case EILSEQ: TRACE_ERROR_NUMBER("Invalid multibyte encoding", error); iconv_close(encoder); return error; case EINVAL: TRACE_ERROR_NUMBER("Incomplete sequence", error); iconv_close(encoder); return error; case E2BIG: TRACE_INFO_STRING("No room in the output buffer.", ""); error = simplebuffer_add_raw(sb, result_buf, ICONV_BUFFER - room_left, ICONV_BUFFER); if (error) { TRACE_ERROR_NUMBER("Failed to store converted bytes", error); iconv_close(encoder); return error; } continue; default: TRACE_ERROR_NUMBER("Unexpected internal error", error); iconv_close(encoder); return ENOTSUP; } } /* The whole buffer was sucessfully converted */ error = simplebuffer_add_raw(sb, result_buf, ICONV_BUFFER - room_left, ICONV_BUFFER); if (error) { TRACE_ERROR_NUMBER("Failed to store converted bytes", error); iconv_close(encoder); return error; } /* TRACE_INFO_STRING("Saved procesed portion.", (char *)simplebuffer_get_vbuf(sb)); */ break; } while(1); iconv_close(encoder); TRACE_FLOW_EXIT(); return EOK; } /* Function to do the encoding */ static int write_bom(int fd, enum index_utf_t bom) { unsigned char buffer[4]; size_t size = 0; ssize_t ret; int error = EOK; TRACE_FLOW_ENTRY(); switch (bom) { case INDEX_UTF32BE: buffer[0] = 0x00; buffer[1] = 0x00; buffer[2] = 0xFE; buffer[3] = 0xFF; size = BOM4_SIZE; break; case INDEX_UTF32LE: buffer[0] = 0xFF; buffer[1] = 0xFE; buffer[2] = 0x00; buffer[3] = 0x00; size = BOM4_SIZE; break; case INDEX_UTF8: buffer[0] = 0xEF; buffer[1] = 0xBB; buffer[2] = 0xBF; size = BOM3_SIZE; break; case INDEX_UTF16BE: buffer[0] = 0xFE; buffer[1] = 0xFF; size = BOM2_SIZE; break; case INDEX_UTF16LE: buffer[0] = 0xFF; buffer[1] = 0xFE; size = BOM2_SIZE; break; default: /* Should not happen - but then size will be 0 and * nothing will be written*/ TRACE_ERROR_NUMBER("Invalid bom type", bom); break; } ret = write(fd, buffer, size); if (ret == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to write bom bytes.", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Function to write to file */ static int write_to_file(struct ini_cfgfile *file_ctx, const char *filename, struct access_check *overwrite, int check) { int error = EOK; uid_t uid = 0; gid_t gid = 0; mode_t mode = 0; int fd = -1; uint32_t left = 0; struct simplebuffer *sb = NULL; struct simplebuffer *sb_ptr = NULL; TRACE_FLOW_ENTRY(); /* Determine which permissions and ownership to use */ error = determine_permissions(file_ctx, overwrite, &uid, &gid, &mode); if (error) { TRACE_ERROR_NUMBER("Failed to determine permissions.", error); return error; } /* Open file and set proper permissions and ownership */ error = open_new_file(filename, uid, gid, mode, check, &fd); if (error) { TRACE_ERROR_NUMBER("Failed to open new file.", error); return error; } /* Write to file */ if (file_ctx->bom != INDEX_UTF8NOBOM) { if (file_ctx->bom != INDEX_UTF8) { error = simplebuffer_alloc(&sb); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer for conversion", error); close(fd); return error; } /* Convert buffer */ error = do_encoding(file_ctx, sb); if (error) { TRACE_ERROR_NUMBER("Failed to re-encode", error); simplebuffer_free(sb); /* Checks for NULL */ close(fd); return error; } sb_ptr = sb; } else sb_ptr = file_ctx->file_data; /* Write bom into file */ error = write_bom(fd, file_ctx->bom); if (error) { TRACE_ERROR_NUMBER("Failed to save bom", error); simplebuffer_free(sb); /* Checks for NULL */ close(fd); return error; } } else sb_ptr = file_ctx->file_data; left = simplebuffer_get_len(sb_ptr); do { error = simplebuffer_write(fd, sb_ptr, &left); if (error) { TRACE_ERROR_NUMBER("Failed to write data", error); simplebuffer_free(sb); /* Checks for NULL */ close(fd); return error; } } while (left > 0); simplebuffer_free(sb); /* Checks for NULL */ close(fd); TRACE_FLOW_EXIT(); return error; } /* Function to check the template * Template is allowed to have '%%' as many times and caller wants * but only one %d. No other combination with a percent is allowed. */ static int check_template(const char *tpl) { char *ptr; char *ptr_pcnt = NULL; TRACE_FLOW_ENTRY(); /* To be able to scan const char we need a non const pointer */ ptr = (char *)(intptr_t)tpl; for (;;) { /* Find first % */ ptr = strchr(ptr, '%'); if (ptr == NULL) { TRACE_ERROR_NUMBER("No '%%d' found in format", EINVAL); return EINVAL; } else { /* Found */ if (*(ptr + 1) == 'd') { ptr_pcnt = ptr + 2; /* We got a valid %d. Check the rest of the string. */ for (;;) { ptr_pcnt = strchr(ptr_pcnt, '%'); if (ptr_pcnt) { ptr_pcnt++; if (*ptr_pcnt != '%') { TRACE_ERROR_NUMBER("Single '%%' " "symbol after '%%d'.", EINVAL); return EINVAL; } ptr_pcnt++; } else break; } break; } /* This is %% - skip */ else if (*(ptr + 1) == '%') { ptr += 2; continue; } else { TRACE_ERROR_NUMBER("Single '%%' " "symbol before '%%d'.", EINVAL); return EINVAL; } } } TRACE_FLOW_EXIT(); return EOK; } /* Backup a file */ int ini_config_file_backup(struct ini_cfgfile *file_ctx, const char *backup_dir, const char *backup_tpl, struct access_check *backup_access, unsigned max_num) { int error = EOK; DIR *ddir = NULL; char *filename = NULL; unsigned i; TRACE_FLOW_ENTRY(); if (file_ctx == NULL) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } if (backup_tpl == NULL) { TRACE_ERROR_NUMBER("Name template is required.", EINVAL); return EINVAL; } /* Check the template */ error = check_template(backup_tpl); if (error) { TRACE_ERROR_NUMBER("Name template is invalid.", error); return error; } if (backup_dir) { /* Check that directory exists */ errno = 0; ddir = opendir(backup_dir); if (!ddir) { error = errno; TRACE_ERROR_NUMBER("Something is wrong with the directory.", error); return error; } } for (i = 1; i <= max_num; i++) { error = create_file_name(backup_dir, backup_tpl, i, &filename); if (error) { TRACE_ERROR_NUMBER("Failed to create path.", error); if (ddir) closedir(ddir); return error; } error = write_to_file(file_ctx, filename, backup_access, 1); free(filename); if (error) { if ((error == EEXIST) || (error == EACCES)) { /* There is a file that already exists, * we need to retry. */ TRACE_INFO_STRING("File existis.", "Retrying."); continue; } TRACE_ERROR_NUMBER("Failed to write file.", error); if (ddir) closedir(ddir); return error; } break; } if (ddir) closedir(ddir); TRACE_FLOW_EXIT(); return error; } /* Change access and ownership */ int ini_config_change_access(struct ini_cfgfile *file_ctx, struct access_check *new_access) { int error = EOK; uid_t uid = 0; gid_t gid = 0; mode_t mode = 0; int ret; TRACE_FLOW_ENTRY(); /* Check that file has name */ if (*(file_ctx->filename) == '\0') { TRACE_ERROR_NUMBER("Invalid file context.", EINVAL); return EINVAL; } if (!(new_access)) { TRACE_ERROR_NUMBER("Access structure is required.", EINVAL); return EINVAL; } /* Determine which permissions and ownership to use */ error = determine_permissions(file_ctx, new_access, &uid, &gid, &mode); if (error) { TRACE_ERROR_NUMBER("Failed to determine permissions.", error); return error; } errno = 0; ret = chmod(file_ctx->filename, mode); if (ret == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to chmod file.", error); return error; } errno = 0; ret = chown(file_ctx->filename, uid, gid); if (ret == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to chown file.", error); return error; } if (file_ctx->metadata_flags & INI_META_STATS) { file_ctx->stats_read = 1; ret = stat(file_ctx->filename, &(file_ctx->file_stats)); if (ret == -1) { error = errno; TRACE_ERROR_NUMBER("Failed to get file stats", error); return error; } } else { memset(&(file_ctx->file_stats), 0, sizeof(struct stat)); file_ctx->stats_read = 0; } TRACE_FLOW_EXIT(); return error; } /* Save configuration in a file */ int ini_config_save(struct ini_cfgfile *file_ctx, struct access_check *new_access, struct ini_cfgobj *ini_config) { int error = EOK; TRACE_FLOW_ENTRY(); error = ini_config_save_as(file_ctx, NULL, new_access, ini_config); TRACE_FLOW_EXIT(); return error; } /* Save configuration in a file using existing context but with a new name */ int ini_config_save_as(struct ini_cfgfile *file_ctx, const char *filename, struct access_check *new_access, struct ini_cfgobj *ini_config) { int error = EOK; struct simplebuffer *sbobj = NULL; TRACE_FLOW_ENTRY(); if (*(file_ctx->filename) == '\0') { TRACE_ERROR_NUMBER("Attempt to use wrong file context", EINVAL); return EINVAL; } error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer.", error); return error; } error = ini_config_serialize(ini_config, sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to serialize.", error); simplebuffer_free(sbobj); return error; } /* Close the internal file handle we control */ ini_config_file_close(file_ctx); /* Free old buffer and assign a new one */ simplebuffer_free(file_ctx->file_data); file_ctx->file_data = sbobj; sbobj = NULL; if (filename) { /* Clean existing file name */ free(file_ctx->filename); file_ctx->filename = NULL; /* Allocate new */ file_ctx->filename = malloc(PATH_MAX + 1); if (!(file_ctx->filename)) { TRACE_ERROR_NUMBER("Failed to allocate memory for file path.", ENOMEM); return ENOMEM; } /* Construct path */ error = make_normalized_absolute_path(file_ctx->filename, PATH_MAX, filename); if(error) { TRACE_ERROR_NUMBER("Failed to resolve path", error); return error; } } /* Write the buffer we have to the file */ error = write_to_file(file_ctx, file_ctx->filename, new_access, 0); if (error) { TRACE_ERROR_NUMBER("Failed to write file.", error); return error; } /* Free again to truncate and prepare for re-read */ simplebuffer_free(file_ctx->file_data); file_ctx->file_data = NULL; error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate buffer.", error); return error; } file_ctx->file_data = sbobj; /* Reopen and re-read */ error = common_file_init(file_ctx, NULL, 0); if(error) { TRACE_ERROR_NUMBER("Failed to do common init", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Get the BOM type */ enum index_utf_t ini_config_get_bom(struct ini_cfgfile *file_ctx) { enum index_utf_t ret; TRACE_FLOW_ENTRY(); ret = file_ctx->bom; TRACE_FLOW_EXIT(); return ret; } /* Set the BOM type */ int ini_config_set_bom(struct ini_cfgfile *file_ctx, enum index_utf_t bom) { TRACE_FLOW_ENTRY(); if (file_ctx == NULL) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } file_ctx->bom = bom; TRACE_FLOW_EXIT(); return EOK; } /* Get the fully resolved file name */ const char *ini_config_get_filename(struct ini_cfgfile *file_ctx) { const char *ret; TRACE_FLOW_ENTRY(); ret = file_ctx->filename; TRACE_FLOW_EXIT(); return ret; } /* Get pointer to stat structure */ const struct stat *ini_config_get_stat(struct ini_cfgfile *file_ctx) { const struct stat *ret; TRACE_FLOW_ENTRY(); if (file_ctx->stats_read) ret = &(file_ctx->file_stats); else ret = NULL; TRACE_FLOW_EXIT(); return ret; } /* Check access */ int access_check_int(struct stat *file_stats, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask) { mode_t st_mode; TRACE_FLOW_ENTRY(); flags &= INI_ACCESS_CHECK_MODE | INI_ACCESS_CHECK_GID | INI_ACCESS_CHECK_UID; if (flags == 0) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Check mode */ if (flags & INI_ACCESS_CHECK_MODE) { TRACE_INFO_NUMBER("File mode as saved.", file_stats->st_mode); st_mode = file_stats->st_mode; st_mode &= S_IRWXU | S_IRWXG | S_IRWXO; TRACE_INFO_NUMBER("File mode adjusted.", st_mode); TRACE_INFO_NUMBER("Mode as provided.", mode); mode &= S_IRWXU | S_IRWXG | S_IRWXO; TRACE_INFO_NUMBER("Mode adjusted.", mode); /* Adjust mask */ if (mask == 0) mask = S_IRWXU | S_IRWXG | S_IRWXO; else mask &= S_IRWXU | S_IRWXG | S_IRWXO; if ((mode & mask) != (st_mode & mask)) { TRACE_INFO_NUMBER("File mode:", (mode & mask)); TRACE_INFO_NUMBER("Mode adjusted.", (st_mode & mask)); TRACE_ERROR_NUMBER("Access denied.", EACCES); return EACCES; } } /* Check uid */ if (flags & INI_ACCESS_CHECK_UID) { if (file_stats->st_uid != uid) { TRACE_ERROR_NUMBER("GID:", file_stats->st_uid); TRACE_ERROR_NUMBER("GID passed in.", uid); TRACE_ERROR_NUMBER("Access denied.", EACCES); return EACCES; } } /* Check gid */ if (flags & INI_ACCESS_CHECK_GID) { if (file_stats->st_gid != gid) { TRACE_ERROR_NUMBER("GID:", file_stats->st_gid); TRACE_ERROR_NUMBER("GID passed in.", gid); TRACE_ERROR_NUMBER("Access denied.", EACCES); return EACCES; } } TRACE_FLOW_EXIT(); return EOK; } /* Check access */ int ini_config_access_check(struct ini_cfgfile *file_ctx, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask) { int error = EOK; TRACE_FLOW_ENTRY(); if (file_ctx == NULL) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } if (file_ctx->stats_read == 0) { TRACE_ERROR_NUMBER("Stats were not collected.", EINVAL); return EINVAL; } error = access_check_int(&(file_ctx->file_stats), flags, uid, gid, mode, mask); TRACE_FLOW_EXIT(); return error; } /* Determines if two file contexts are different by comparing: * - time stamp * - device ID * - i-node */ int ini_config_changed(struct ini_cfgfile *file_ctx1, struct ini_cfgfile *file_ctx2, int *changed) { TRACE_FLOW_ENTRY(); if ((file_ctx1 == NULL) || (file_ctx2 == NULL) || (changed == NULL)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } if ((file_ctx1->stats_read == 0) || (file_ctx2->stats_read == 0)) { TRACE_ERROR_NUMBER("Stats were not collected.", EINVAL); return EINVAL; } *changed = 0; /* Unfortunately the time is not granular enough * to detect the change if run during the unit test. * In future when a more granular version of stat * is available we should switch to it and update * the unit test. */ if((file_ctx1->file_stats.st_mtime != file_ctx2->file_stats.st_mtime) || (file_ctx1->file_stats.st_dev != file_ctx2->file_stats.st_dev) || (file_ctx1->file_stats.st_ino != file_ctx2->file_stats.st_ino)) { TRACE_INFO_STRING("File changed!", ""); *changed = 1; } TRACE_FLOW_EXIT(); return EOK; } /* Print the file object contents */ void ini_config_file_print(struct ini_cfgfile *file_ctx) { TRACE_FLOW_ENTRY(); if (file_ctx == NULL) { printf("No file object\n."); } else { printf("File name: %s\n", (file_ctx->filename) ? file_ctx->filename : "NULL"); printf("File is %s\n", (file_ctx->file) ? "open" : "closed"); printf("File BOM %d\n", file_ctx->bom); printf("Metadata flags %u\n", file_ctx->metadata_flags); printf("Stats flag st_dev %li\n", file_ctx->file_stats.st_dev); printf("Stats flag st_ino %li\n", file_ctx->file_stats.st_ino); printf("Stats flag st_mode %u\n", file_ctx->file_stats.st_mode); printf("Stats flag st_nlink %li\n", file_ctx->file_stats.st_nlink); printf("Stats flag st_uid %u\n", file_ctx->file_stats.st_uid); printf("Stats flag st_gid %u\n", file_ctx->file_stats.st_gid); printf("Stats flag st_rdev %li\n", file_ctx->file_stats.st_rdev); printf("Stats flag st_size %lu\n", file_ctx->file_stats.st_size); printf("Stats flag st_blocks %li\n", file_ctx->file_stats.st_blocks); printf("Stats flag st_atime %ld\n", file_ctx->file_stats.st_atime); printf("Stats flag st_mtime %ld\n", file_ctx->file_stats.st_mtime); printf("Stats flag st_ctime %ld\n", file_ctx->file_stats.st_ctime); } TRACE_FLOW_EXIT(); } ding-libs-0.6.2/ini/ini_get_array.c000066400000000000000000000247001417260640400171350ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for arrays of values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_defines.h" #include "ini_config.h" /* * Internal contants to indicate how * to process the lists of strings. */ #define EXCLUDE_EMPTY 0 #define INCLUDE_EMPTY 1 /* Arrays of stings */ static char **get_str_cfg_array(struct collection_item *item, int include, const char *sep, int *size, int *error) { char *copy = NULL; char *dest = NULL; char locsep[4]; int lensep; char *buff; int count = 0; int len = 0; int resume_len; char **array; char *start; int i, j; int dlen; TRACE_FLOW_STRING("get_str_cfg_array", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Handle the separators */ if (sep == NULL) { locsep[0] = ','; locsep[1] = '\0'; lensep = 2; } else { strncpy(locsep, sep, 3); locsep[3] = '\0'; lensep = strlen(locsep) + 1; } /* Allocate memory for the copy of the string */ copy = malloc(col_get_item_length(item)); if (copy == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Loop through the string */ dest = copy; buff = col_get_item_data(item); start = buff; dlen = col_get_item_length(item); for(i = 0; i < dlen; i++) { for(j = 0; j < lensep; j++) { if(buff[i] == locsep[j]) { /* If we found one of the separators trim spaces around */ resume_len = len; while (len > 0) { if (isspace(start[len - 1])) len--; else break; } TRACE_INFO_STRING("Current:", start); TRACE_INFO_NUMBER("Length:", len); if (len > 0) { /* Save block aside */ memcpy(dest, start, len); count++; dest += len; *dest = '\0'; dest++; } else if(include) { count++; *dest = '\0'; dest++; } if (locsep[j] == '\0') break; /* We are done */ /* Move forward and trim spaces if any */ start += resume_len + 1; i++; TRACE_INFO_STRING("Other pointer :", buff + i); while ((i < dlen) && (isspace(*start))) { i++; start++; } len = -1; /* Len will be increased in the loop */ i--; /* i will be increas so we need to step back */ TRACE_INFO_STRING("Remaining buffer after triming spaces:", start); break; } } len++; } /* Now we know how many items are there in the list */ array = malloc((count + 1) * sizeof(char *)); if (array == NULL) { free(copy); TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Loop again to fill in the pointers */ start = copy; for (i = 0; i < count; i++) { TRACE_INFO_STRING("Token :", start); TRACE_INFO_NUMBER("Item :", i); array[i] = start; /* Move to next item */ while(*start) start++; start++; } array[count] = NULL; if (error) *error = EOK; if (size) *size = count; /* If count is 0 the copy needs to be freed */ if (count == 0) free(copy); TRACE_FLOW_STRING("get_str_cfg_array", "Exit"); /* coverity[leaked_storage : SUPPRESS] */ /* false positive warning */ return array; } /* Get array of strings from item eliminating empty tokens */ char **get_string_config_array(struct collection_item *item, const char *sep, int *size, int *error) { TRACE_FLOW_STRING("get_string_config_array", "Called."); return get_str_cfg_array(item, EXCLUDE_EMPTY, sep, size, error); } /* Get array of strings from item preserving empty tokens */ char **get_raw_string_config_array(struct collection_item *item, const char *sep, int *size, int *error) { TRACE_FLOW_STRING("get_raw_string_config_array", "Called."); return get_str_cfg_array(item, INCLUDE_EMPTY, sep, size, error); } /* Special function to free string config array */ void free_string_config_array(char **str_config) { TRACE_FLOW_STRING("free_string_config_array", "Entry"); if (str_config != NULL) { if (*str_config != NULL) free(*str_config); free(str_config); } TRACE_FLOW_STRING("free_string_config_array", "Exit"); } /* Get an array of long values. * NOTE: For now I leave just one function that returns numeric arrays. * In future if we need other numeric types we can change it to do strtoll * internally and wrap it for backward compatibility. */ long *get_long_config_array(struct collection_item *item, int *size, int *error) { const char *str; char *endptr; long val = 0; long *array; int count = 0; int err; TRACE_FLOW_STRING("get_long_config_array", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING) || (size == NULL)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Assume that we have maximum number of different numbers */ array = (long *)malloc(sizeof(long) * col_get_item_length(item)/2); if (array == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Now parse the string */ str = (const char *)col_get_item_data(item); while (*str) { errno = 0; val = strtol(str, &endptr, 10); err = errno; if (err) { TRACE_ERROR_NUMBER("Conversion failed", err); free(array); if (error) *error = err; return NULL; } if (endptr == str) { TRACE_ERROR_NUMBER("Nothing processed", EIO); free(array); if (error) *error = EIO; return NULL; } /* Save value */ array[count] = val; count++; /* Are we done? */ if (*endptr == 0) break; /* Advance to the next valid number */ for (str = endptr; *str; str++) { if (isdigit(*str) || (*str == '-') || (*str == '+')) break; } } *size = count; if (error) *error = EOK; TRACE_FLOW_NUMBER("get_long_config_value returning", val); return array; } /* Get an array of double values */ double *get_double_config_array(struct collection_item *item, int *size, int *error) { const char *str; char *endptr; double val = 0; double *array; int count = 0; struct lconv *loc; TRACE_FLOW_STRING("get_double_config_array", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING) || (size == NULL)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Assume that we have maximum number of different numbers */ array = (double *)malloc(sizeof(double) * col_get_item_length(item)/2); if (array == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Get locale information so that we can check for decimal point character. * Based on the man pages it is unclear if this is an allocated memory or not. * Seems like it is a static thread or process local structure so * I will not try to free it after use. */ loc = localeconv(); /* Now parse the string */ str = (const char *)col_get_item_data(item); while (*str) { TRACE_INFO_STRING("String to convert",str); errno = 0; val = strtod(str, &endptr); if ((errno == ERANGE) || ((errno != 0) && (val == 0)) || (endptr == str)) { TRACE_ERROR_NUMBER("Conversion failed", EIO); free(array); if (error) *error = EIO; return NULL; } /* Save value */ array[count] = val; count++; /* Are we done? */ if (*endptr == 0) break; TRACE_INFO_STRING("End pointer after conversion",endptr); /* Advance to the next valid number */ for (str = endptr; *str; str++) { if (isdigit(*str) || (*str == '-') || (*str == '+') || /* It is ok to do this since the string is null terminated */ ((*str == *(loc->decimal_point)) && isdigit(str[1]))) break; } } *size = count; if (error) *error = EOK; TRACE_FLOW_NUMBER("get_double_config_value returning", val); return array; } /* Special function to free long config array */ void free_long_config_array(long *array) { if (array != NULL) free(array); } /* Special function to free double config array */ void free_double_config_array(double *array) { if (array != NULL) free(array); } ding-libs-0.6.2/ini/ini_get_array_valueobj.c000066400000000000000000000267121417260640400210310ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for arrays of values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2012 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_defines.h" #include "ini_configobj.h" /* * Internal contants to indicate how * to process the lists of strings. */ #define EXCLUDE_EMPTY 0 #define INCLUDE_EMPTY 1 /* Maximum number of separators supported. Do not make it less than 3. */ #define MAX_SEP_LEN 3 /* Arrays of stings */ static char **get_str_cfg_array(struct value_obj *vo, int include, const char *sep, int *size, int *error) { char *copy = NULL; char *dest = NULL; char locsep[MAX_SEP_LEN + 1]; uint32_t lensep; const char *buff; uint32_t count = 0; uint32_t len = 0; uint32_t resume_len; char **array; const char *start; char *start_array; uint32_t i, j; uint32_t dlen; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Get value and length - no error checking as we checked it above * and there is no other reson the function could to fail. */ value_get_concatenated(vo, &buff); value_get_concatenated_len(vo, &dlen); /* Handle the separators */ if (sep == NULL) { locsep[0] = ','; locsep[1] = '\0'; lensep = 2; } else { strncpy(locsep, sep, MAX_SEP_LEN); locsep[MAX_SEP_LEN] = '\0'; lensep = strlen(locsep) + 1; } /* Allocate memory for the copy of the string */ TRACE_INFO_NUMBER("Length to allocate is :", dlen); /* Always reserve one more byte * for the case when the string consist of delimeters */ copy = malloc(dlen + 1); if (copy == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Suppress warning */ start = buff; /* Loop through the string */ dest = copy; for(i = 0; i < dlen; i++) { for(j = 0; j < lensep; j++) { if(buff[i] == locsep[j]) { /* If we found one of the separators trim spaces around */ resume_len = len; while (len > 0) { if (isspace(start[len - 1])) len--; else break; } TRACE_INFO_STRING("Current:", start); TRACE_INFO_NUMBER("Length:", len); if (len > 0) { /* Save block aside */ memcpy(dest, start, len); count++; dest += len; *dest = '\0'; dest++; } else if(include) { count++; *dest = '\0'; dest++; } /* Move forward and trim spaces if any */ start += resume_len + 1; i++; TRACE_INFO_STRING("Other pointer :", buff + i); while ((i < dlen) && (isspace(*start))) { i++; start++; } len = -1; /* Len will be increased in the loop */ i--; /* i will be increased so we need to step back */ TRACE_INFO_STRING("Remaining buffer after triming spaces:", start); break; } } len++; } /* Save last segment */ TRACE_INFO_STRING("Current:", start); TRACE_INFO_NUMBER("Length:", len); if (len > 0) { /* Save block aside */ memcpy(dest, start, len); count++; dest += len; *dest = '\0'; } else if(include && dlen && count) { TRACE_INFO_NUMBER("Include :", include); TRACE_INFO_NUMBER("dlen :", dlen); TRACE_INFO_NUMBER("Count :", count); count++; *dest = '\0'; } /* Now we know how many items are there in the list */ array = malloc((count + 1) * sizeof(char *)); if (array == NULL) { free(copy); TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Loop again to fill in the pointers */ start_array = copy; for (i = 0; i < count; i++) { TRACE_INFO_STRING("Token :", start_array); TRACE_INFO_NUMBER("Item :", i); array[i] = start_array; /* Move to next item */ while(*start_array) start_array++; start_array++; } array[count] = NULL; if (error) *error = EOK; if (size) *size = count; /* If count is 0 the copy needs to be freed */ if (count == 0) free(copy); TRACE_FLOW_EXIT(); return array; } /* Get array of strings from item eliminating empty tokens */ char **ini_get_string_config_array(struct value_obj *vo, const char *sep, int *size, int *error) { TRACE_FLOW_ENTRY(); return get_str_cfg_array(vo, EXCLUDE_EMPTY, sep, size, error); } /* Get array of strings from item preserving empty tokens */ char **ini_get_raw_string_config_array(struct value_obj *vo, const char *sep, int *size, int *error) { TRACE_FLOW_ENTRY(); return get_str_cfg_array(vo, INCLUDE_EMPTY, sep, size, error); } /* Special function to free string config array */ void ini_free_string_config_array(char **str_config) { TRACE_FLOW_ENTRY(); if (str_config != NULL) { if (*str_config != NULL) free(*str_config); free(str_config); } TRACE_FLOW_EXIT(); } /* Get an array of long values. * NOTE: For now I leave just one function that returns numeric arrays. * In future if we need other numeric types we can change it to do strtoll * internally and wrap it for backward compatibility. */ long *ini_get_long_config_array(struct value_obj *vo, int *size, int *error) { const char *str; char *endptr; long val = 0; long *array; uint32_t count = 0; int err; uint32_t dlen; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid value object argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Do we have the size ? */ if (size == NULL) { TRACE_ERROR_NUMBER("Invalid size argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Get value and length - no error checking as we checked it above * and there is no other reson the function could to fail. */ value_get_concatenated(vo, &str); value_get_concatenated_len(vo, &dlen); /* Assume that we have maximum number of different numbers */ array = (long *)malloc(sizeof(long) * dlen/2); if (array == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Now parse the string */ while (*str) { errno = 0; val = strtol(str, &endptr, 10); err = errno; if (err) { TRACE_ERROR_NUMBER("Conversion failed", err); free(array); if (error) *error = err; return NULL; } if (endptr == str) { TRACE_ERROR_NUMBER("Nothing processed", EIO); free(array); if (error) *error = EIO; return NULL; } /* Save value */ array[count] = val; count++; /* Are we done? */ if (*endptr == 0) break; /* Advance to the next valid number */ for (str = endptr; *str; str++) { if (isdigit(*str) || (*str == '-') || (*str == '+')) break; } } *size = count; if (error) *error = EOK; TRACE_FLOW_EXIT(); return array; } /* Get an array of double values */ double *ini_get_double_config_array(struct value_obj *vo, int *size, int *error) { const char *str; char *endptr; double val = 0; double *array; int count = 0; struct lconv *loc; uint32_t dlen; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid value object argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Do we have the size ? */ if (size == NULL) { TRACE_ERROR_NUMBER("Invalid size argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Get value and length - no error checking as we checked it above * and there is no other reson the function could to fail. */ value_get_concatenated(vo, &str); value_get_concatenated_len(vo, &dlen); /* Assume that we have maximum number of different numbers */ array = (double *)malloc(sizeof(double) * dlen/2); if (array == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Get locale information so that we can check for decimal point character. * Based on the man pages it is unclear if this is an allocated memory or not. * Seems like it is a static thread or process local structure so * I will not try to free it after use. */ loc = localeconv(); /* Now parse the string */ while (*str) { TRACE_INFO_STRING("String to convert",str); errno = 0; val = strtod(str, &endptr); if ((errno == ERANGE) || ((errno != 0) && (val == 0)) || (endptr == str)) { TRACE_ERROR_NUMBER("Conversion failed", EIO); free(array); if (error) *error = EIO; return NULL; } /* Save value */ array[count] = val; count++; /* Are we done? */ if (*endptr == 0) break; TRACE_INFO_STRING("End pointer after conversion",endptr); /* Advance to the next valid number */ for (str = endptr; *str; str++) { if (isdigit(*str) || (*str == '-') || (*str == '+') || /* It is ok to do this since the string is null terminated */ ((*str == *(loc->decimal_point)) && isdigit(str[1]))) break; } } *size = count; if (error) *error = EOK; TRACE_FLOW_EXIT(); return array; } /* Special function to free long config array */ void ini_free_long_config_array(long *array) { free(array); } /* Special function to free double config array */ void ini_free_double_config_array(double *array) { free(array); } ding-libs-0.6.2/ini/ini_get_value.c000066400000000000000000000406011417260640400171310ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for single values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_defines.h" #include "ini_config.h" /* Function to get value from the configuration handle */ int get_config_item(const char *section, const char *name, struct collection_item *ini_config, struct collection_item **item) { int error = EOK; struct collection_item *section_handle = NULL; const char *to_find; char default_section[] = INI_DEFAULT_SECTION; TRACE_FLOW_STRING("get_config_item", "Entry"); /* Do we have the accepting memory ? */ if (item == NULL) { TRACE_ERROR_NUMBER("No buffer - invalid argument.", EINVAL); return EINVAL; } /* Is the collection of a right type */ if ((col_is_of_class(ini_config, COL_CLASS_INI_CONFIG) == 0) && (col_is_of_class(ini_config, COL_CLASS_INI_META) == 0)) { TRACE_ERROR_NUMBER("Wrong collection type", EINVAL); return EINVAL; } *item = NULL; if (section == NULL) to_find = default_section; else to_find = section; TRACE_INFO_STRING("Getting Name:", name); TRACE_INFO_STRING("In Section:", section); /* Get Subcollection */ error = col_get_collection_reference(ini_config, §ion_handle, to_find); /* Check error */ if (error && (error != ENOENT)) { TRACE_ERROR_NUMBER("Failed to get section", error); return error; } /* Did we find a section */ if ((error == ENOENT) || (section_handle == NULL)) { /* We have not found section - return success */ TRACE_FLOW_STRING("get_value_from_config", "No such section"); return EOK; } /* Get item */ error = col_get_item(section_handle, name, COL_TYPE_STRING, COL_TRAVERSE_ONELEVEL, item); /* Make sure we free the section we found */ col_destroy_collection(section_handle); TRACE_FLOW_NUMBER("get_config_item returning", error); return error; } /* Get long long value from config item */ static long long get_llong_config_value(struct collection_item *item, int strict, long long def, int *error) { int err; const char *str; char *endptr; long long val = 0; TRACE_FLOW_STRING("get_llong_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Try to parse the value */ str = (const char *)col_get_item_data(item); errno = 0; val = strtoll(str, &endptr, 10); err = errno; /* Check for various possible errors */ if (err != 0) { TRACE_ERROR_NUMBER("Conversion failed", err); if (error) *error = err; return def; } /* Other error cases */ if ((endptr == str) || (strict && (*endptr != '\0'))) { TRACE_ERROR_NUMBER("More characters or nothing processed", EIO); if (error) *error = EIO; return def; } TRACE_FLOW_NUMBER("get_llong_config_value returning", (long)val); return val; } /* Get unsigned long long value from config item */ static unsigned long long get_ullong_config_value(struct collection_item *item, int strict, unsigned long long def, int *error) { int err; const char *str; char *endptr; unsigned long long val = 0; TRACE_FLOW_STRING("get_ullong_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Try to parse the value */ str = (const char *)col_get_item_data(item); errno = 0; val = strtoull(str, &endptr, 10); err = errno; /* Check for various possible errors */ if (err != 0) { TRACE_ERROR_NUMBER("Conversion failed", err); if (error) *error = err; return def; } /* Other error cases */ if ((endptr == str) || (strict && (*endptr != '\0'))) { TRACE_ERROR_NUMBER("More characters or nothing processed", EIO); if (error) *error = EIO; return def; } TRACE_FLOW_NUMBER("get_ullong_config_value returning", val); return val; } /* Get integer value from config item */ int get_int_config_value(struct collection_item *item, int strict, int def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_STRING("get_int_config_value", "Entry"); val = get_llong_config_value(item, strict, def, &err); if (err == 0) { if ((val > INT_MAX) || (val < INT_MIN)) { val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("get_int_config_value returning", (int)val); return (int)val; } /* Get unsigned integer value from config item */ unsigned get_unsigned_config_value(struct collection_item *item, int strict, unsigned def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_STRING("get_unsigned_config_value", "Entry"); val = get_ullong_config_value(item, strict, def, &err); if (err == 0) { if (val > UINT_MAX) { val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("get_unsigned_config_value returning", (unsigned)val); return (unsigned)val; } /* Get long value from config item */ long get_long_config_value(struct collection_item *item, int strict, long def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_STRING("get_long_config_value", "Entry"); val = get_llong_config_value(item, strict, def, &err); if (err == 0) { if ((val > LONG_MAX) || (val < LONG_MIN)) { val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("get_long_config_value returning", (long)val); return (long)val; } /* Get unsigned long value from config item */ unsigned long get_ulong_config_value(struct collection_item *item, int strict, unsigned long def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_STRING("get_ulong_config_value", "Entry"); val = get_ullong_config_value(item, strict, def, &err); if (err == 0) { if (val > ULONG_MAX) { val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("get_ulong_config_value returning", (unsigned long)val); return (unsigned long)val; } /* Get int32_t value from config item */ int32_t get_int32_config_value(struct collection_item *item, int strict, int32_t def, int *error) { int val = 0; TRACE_FLOW_STRING("get_int32_config_value", "Entry"); val = get_int_config_value(item, strict, (int)def, error); TRACE_FLOW_SNUMBER("get_int32_config_value returning", (int32_t)val); return (int32_t)val; } /* Get uint32_t value from config item */ uint32_t get_uint32_config_value(struct collection_item *item, int strict, uint32_t def, int *error) { unsigned val = 0; TRACE_FLOW_STRING("get_uint32_config_value", "Entry"); val = get_unsigned_config_value(item, strict, (unsigned)def, error); TRACE_FLOW_NUMBER("get_uint32_config_value returning", (uint32_t)val); return (uint32_t)val; } /* Get int64_t value from config item */ int64_t get_int64_config_value(struct collection_item *item, int strict, int64_t def, int *error) { long long val = 0; TRACE_FLOW_STRING("get_int64_config_value", "Entry"); val = get_llong_config_value(item, strict, (long long)def, error); TRACE_FLOW_SLNUMBER("get_int64_config_value returning", (int64_t)val); return (int64_t)val; } /* Get uint64_t value from config item */ uint64_t get_uint64_config_value(struct collection_item *item, int strict, uint64_t def, int *error) { unsigned long long val = 0; TRACE_FLOW_STRING("get_uint64_config_value", "Entry"); val = get_ullong_config_value(item, strict, (unsigned long long)def, error); TRACE_FLOW_LNUMBER("get_uint64_config_value returning", (uint64_t)val); return (uint64_t)val; } /* Get double value */ double get_double_config_value(struct collection_item *item, int strict, double def, int *error) { const char *str; char *endptr; double val = 0; TRACE_FLOW_STRING("get_double_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Try to parse the value */ str = (const char *)col_get_item_data(item); errno = 0; val = strtod(str, &endptr); /* Check for various possible errors */ if ((errno == ERANGE) || ((errno != 0) && (val == 0)) || (endptr == str)) { TRACE_ERROR_NUMBER("Conversion failed", EIO); if (error) *error = EIO; return def; } if (strict && (*endptr != '\0')) { TRACE_ERROR_NUMBER("More characters than expected", EIO); if (error) *error = EIO; val = def; } TRACE_FLOW_DOUBLE("get_double_config_value returning", val); return val; } /* Get boolean value */ unsigned char get_bool_config_value(struct collection_item *item, unsigned char def, int *error) { const char *str; int len; TRACE_FLOW_STRING("get_bool_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; str = (const char *)col_get_item_data(item); len = col_get_item_length(item); /* Try to parse the value */ if ((strncasecmp(str, "true", len) == 0) || (strncasecmp(str, "yes", len) == 0)) { TRACE_FLOW_STRING("Returning", "true"); return '\1'; } else if ((strncasecmp(str, "false", len) == 0) || (strncasecmp(str, "no", len) == 0)) { TRACE_FLOW_STRING("Returning", "false"); return '\0'; } TRACE_ERROR_STRING("Returning", "error"); if (error) *error = EIO; return def; } /* Return a string out of the value */ char *get_string_config_value(struct collection_item *item, int *error) { char *str = NULL; TRACE_FLOW_STRING("get_string_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } str = strdup((const char *)col_get_item_data(item)); if (str == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } if (error) *error = EOK; TRACE_FLOW_STRING("get_string_config_value returning", str); return str; } /* Get string from item */ const char *get_const_string_config_value(struct collection_item *item, int *error) { const char *str; TRACE_FLOW_STRING("get_const_string_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } str = (const char *)col_get_item_data(item); if (error) *error = EOK; TRACE_FLOW_STRING("get_const_string_config_value returning", str); return str; } /* A special hex format is assumed. * The string should be taken in single quotes * and consist of hex encoded value two hex digits per byte. * Example: '0A2BFECC' * Case does not matter. */ char *get_bin_config_value(struct collection_item *item, int *length, int *error) { unsigned i; char *value = NULL; const char *buff; int size = 0; unsigned char hex; unsigned len; const char *str; TRACE_FLOW_STRING("get_bin_config_value", "Entry"); /* Do we have the item ? */ if ((item == NULL) || (col_get_item_type(item) != COL_TYPE_STRING)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Check the length */ len = col_get_item_length(item)-1; if ((len%2) != 0) { TRACE_ERROR_STRING("Invalid length for binary data", ""); if (error) *error = EINVAL; return NULL; } str = (const char *)col_get_item_data(item); /* Is the format correct ? */ if ((*str != '\'') || (str[len -1] != '\'')) { TRACE_ERROR_STRING("String is not escaped",""); if (error) *error = EIO; return NULL; } /* Check that all the symbols are ok */ buff = str + 1; len -= 2; for (i = 0; i < len; i += 2) { if (!isxdigit(buff[i]) || !isxdigit(buff[i + 1])) { TRACE_ERROR_STRING("Invalid encoding for binary data", buff + i); if (error) *error = EIO; return NULL; } } /* The value is good so we can allocate memory for it */ value = malloc(len / 2); if (value == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Convert the value */ for (i = 0; i < len; i += 2) { if (isdigit(buff[i])) { if (isdigit(buff[i+1])) hex = 16 * (buff[i] - '0') + (buff[i+1] - '0'); else hex = 16 * (buff[i] - '0') + (tolower(buff[i+1]) - 'a' + 10); } else { if (isdigit(buff[i+1])) hex = 16 * (tolower(buff[i]) - 'a') + (buff[i+1] - '0'); else hex = 16 * (tolower(buff[i]) - 'a' + 10) + (tolower(buff[i+1]) - 'a' + 10); } value[size] = (char)(hex); size++; } if (error) *error = EOK; if (length) *length = size; TRACE_FLOW_STRING("get_bin_config_value", "Exit"); return value; } /* Function to free binary configuration value */ void free_bin_config_value(char *value) { if (value) free(value); } ding-libs-0.6.2/ini/ini_get_valueobj.c000066400000000000000000000540201417260640400176240ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for single values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2012 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_defines.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "ini_valueobj.h" /* Macro co convert to HEX value */ #define HEXVAL(c) (isdigit(c) ? (c - '0') : (tolower(c) - 'a') + 10) static int is_same_section(struct ini_cfgobj *ini_config, const char *section) { int len = 0; TRACE_FLOW_ENTRY(); /* If section is not defined it is different */ if (ini_config->section == NULL) { TRACE_FLOW_RETURN(0); return 0; } len = strlen(section); /* If values are same this is the same section */ if ((strncasecmp(ini_config->section, section, ini_config->section_len) == 0) && (ini_config->section_len == len)) { TRACE_FLOW_RETURN(1); return 1; } /* Otherwise the values are different */ TRACE_FLOW_RETURN(0); return 0; } static int is_same_name(struct ini_cfgobj *ini_config, const char *name, int name_len) { TRACE_FLOW_ENTRY(); /* If name is not defined it is different */ if (ini_config->name == NULL) { TRACE_FLOW_RETURN(0); return 0; } /* If values are same this is the same value */ if ((strncasecmp(ini_config->name, name, ini_config->name_len) == 0) && (ini_config->name_len == name_len)) { TRACE_FLOW_RETURN(1); return 1; } /* Otherwise the values are different */ TRACE_FLOW_RETURN(0); return 0; } /* Function to get value object from the configuration handle */ int ini_get_config_valueobj(const char *section, const char *name, struct ini_cfgobj *ini_config, int mode, struct value_obj **vo) { int error = EOK; struct collection_item *section_handle = NULL; struct collection_item *item = NULL; struct collection_item *last_found = NULL; const char *to_find; char default_section[] = INI_DEFAULT_SECTION; uint64_t hash = 0; int len = 0, name_len = 0; TRACE_FLOW_ENTRY(); /* Do we have the accepting memory ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument vo.", EINVAL); return EINVAL; } *vo = NULL; if (ini_config == NULL) { TRACE_ERROR_NUMBER("Invalid argument ini_config.", EINVAL); return EINVAL; } if ((mode < INI_GET_FIRST_VALUE) || (mode > INI_GET_LAST_VALUE)) { TRACE_ERROR_NUMBER("Invalid argument mode:", mode); return EINVAL; } /* Do we have a name ? */ if (name == NULL) { TRACE_ERROR_NUMBER("Name is NULL it will not be found.", EINVAL); return EINVAL; } /* Empty section means look for the default one */ if (section == NULL) to_find = default_section; else to_find = section; TRACE_INFO_STRING("Getting Name:", name); TRACE_INFO_STRING("In Section:", to_find); /* Make sure we start over if this is the first value */ if (mode == INI_GET_FIRST_VALUE) ini_config_clean_state(ini_config); /* Are we looking in the same section ? */ if (!is_same_section(ini_config, to_find)) { /* This is a different section */ ini_config_clean_state(ini_config); /* Get Subcollection */ error = col_get_collection_reference(ini_config->cfg, §ion_handle, to_find); /* Check error */ if (error && (error != ENOENT)) { TRACE_ERROR_NUMBER("Failed to get section", error); return error; } /* Did we find a section */ if ((error == ENOENT) || (section_handle == NULL)) { /* We have not found section - return success */ TRACE_FLOW_EXIT(); return EOK; } /* Create an iterator */ error = col_bind_iterator(&(ini_config->iterator), section_handle, COL_TRAVERSE_ONELEVEL); /* Make sure we free the section we found */ col_destroy_collection(section_handle); /* Check error */ if (error) { TRACE_ERROR_NUMBER("Failed to bind to section", error); return error; } /* Save section */ ini_config->section_len = strlen(to_find); ini_config->section = strndup(to_find, ini_config->section_len); /* Check error */ if (ini_config->section == NULL) { TRACE_ERROR_NUMBER("Failed to save section name ", ENOMEM); ini_config_clean_state(ini_config); return ENOMEM; } } hash = col_make_hash(name, 0, &name_len); /* Check if this is the same name */ if (!is_same_name(ini_config, name, name_len)) { TRACE_INFO_STRING("Saved name:", ini_config->name); TRACE_INFO_STRING("Passed name:", name); TRACE_INFO_NUMBER("Length of the saved name", ini_config->name_len); TRACE_INFO_NUMBER("Length of the passed name", name_len); col_rewind_iterator(ini_config->iterator); free(ini_config->name); ini_config->name = NULL; ini_config->name_len = 0; } /* Iterate through the section */ do { /* Loop through a collection */ error = col_iterate_collection(ini_config->iterator, &item); if (error) { TRACE_ERROR_NUMBER("Failed to iterate", error); ini_config_clean_state(ini_config); return error; } /* Are we done ? */ if (item == NULL) { /* We looped to the end and found last value */ if ((mode == INI_GET_LAST_VALUE) && (last_found)) { item = last_found; break; } /* There is nothing left to look for */ ini_config_clean_state(ini_config); TRACE_FLOW_EXIT(); return EOK; } if ((hash == col_get_item_hash(item)) && (col_get_item_type(item) == COL_TYPE_BINARY) && (strncasecmp(col_get_item_property(item, &len), name, name_len) == 0) && (len == name_len)) { TRACE_INFO_STRING("Item is found", name); last_found = item; if (mode == INI_GET_LAST_VALUE) continue; break; } } while(1); if (!is_same_name(ini_config, name, name_len)) { /* Save name */ ini_config->name_len = name_len; ini_config->name = strndup(name, name_len); /* Check error */ if (ini_config->name == NULL) { TRACE_ERROR_NUMBER("Failed to save key name ", ENOMEM); ini_config_clean_state(ini_config); return ENOMEM; } } *vo = *((struct value_obj **)(col_get_item_data(item))); TRACE_FLOW_EXIT(); return error; } /* Get long long value from config value object */ static long long ini_get_llong_config_value(struct value_obj *vo, int strict, long long def, int *error) { int err; const char *str; char *endptr; long long val = 0; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); /* Try to parse the value */ errno = 0; val = strtoll(str, &endptr, 10); err = errno; /* Check for various possible errors */ if (err != 0) { TRACE_ERROR_NUMBER("Conversion failed", err); if (error) *error = err; return def; } /* Other error cases */ if ((endptr == str) || (strict && (*endptr != '\0'))) { TRACE_ERROR_NUMBER("More characters or nothing processed", EIO); if (error) *error = EIO; return def; } TRACE_FLOW_NUMBER("ini_get_llong_config_value returning", (long)val); return val; } /* Get unsigned long long value from config value object */ static unsigned long long ini_get_ullong_config_value(struct value_obj *vo, int strict, unsigned long long def, int *error) { int err; const char *str; char *endptr; unsigned long long val = 0; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); errno = 0; val = strtoull(str, &endptr, 10); err = errno; /* Check for various possible errors */ if (err != 0) { TRACE_ERROR_NUMBER("Conversion failed", err); if (error) *error = err; return def; } /* Other error cases */ if ((endptr == str) || (strict && (*endptr != '\0'))) { TRACE_ERROR_NUMBER("More characters or nothing processed", EIO); if (error) *error = EIO; return def; } TRACE_FLOW_NUMBER("ini_get_ullong_config_value returning", val); return val; } /* Get integer value from config value */ int ini_get_int_config_value(struct value_obj *vo, int strict, int def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_llong_config_value(vo, strict, def, &err); if (err == 0) { if ((val > INT_MAX) || (val < INT_MIN)) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_int_config_value returning", (int)val); return (int)val; } /* Get unsigned integer value from config value object */ unsigned ini_get_unsigned_config_value(struct value_obj *vo, int strict, unsigned def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_ullong_config_value(vo, strict, def, &err); if (err == 0) { if (val > UINT_MAX) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_unsigned_config_value returning", (unsigned)val); return (unsigned)val; } /* Get long value from config value object */ long ini_get_long_config_value(struct value_obj *vo, int strict, long def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_llong_config_value(vo, strict, def, &err); if (err == 0) { if ((val > LONG_MAX) || (val < LONG_MIN)) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_long_config_value returning", (long)val); return (long)val; } /* Get unsigned long value from config value object */ unsigned long ini_get_ulong_config_value(struct value_obj *vo, int strict, unsigned long def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_ullong_config_value(vo, strict, def, &err); if (err == 0) { if (val > ULONG_MAX) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_ulong_config_value returning", (unsigned long)val); return (unsigned long)val; } /* Get int32_t value from config value object */ int32_t ini_get_int32_config_value(struct value_obj *vo, int strict, int32_t def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_llong_config_value(vo, strict, def, &err); if (err == 0) { if ((val > INT32_MAX) || (val < INT32_MIN)) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_int32_config_value returning", (int32_t)val); return (int32_t)val; } /* Get uint32_t value from config value object */ uint32_t ini_get_uint32_config_value(struct value_obj *vo, int strict, uint32_t def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_ullong_config_value(vo, strict, def, &err); if (err == 0) { if (val > UINT32_MAX) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_uint32_config_value returning", (uint32_t)val); return (uint32_t)val; } /* Get int64_t value from config value ovject */ int64_t ini_get_int64_config_value(struct value_obj *vo, int strict, int64_t def, int *error) { long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_llong_config_value(vo, strict, def, &err); if (err == 0) { if ((val > INT64_MAX) || (val < INT64_MIN)) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_int64_config_value returning", (int64_t)val); return (int64_t)val; } /* Get uint64_t value from config value object */ uint64_t ini_get_uint64_config_value(struct value_obj *vo, int strict, uint64_t def, int *error) { unsigned long long val = 0; int err = 0; TRACE_FLOW_ENTRY(); val = ini_get_ullong_config_value(vo, strict, def, &err); if (err == 0) { if (val > UINT64_MAX) { TRACE_ERROR_NUMBER("Value is out of range", ERANGE); val = def; err = ERANGE; } } if (error) *error = err; TRACE_FLOW_NUMBER("ini_get_uint64_config_value returning", (uint64_t)val); return (uint64_t)val; } /* Get double value */ double ini_get_double_config_value(struct value_obj *vo, int strict, double def, int *error) { const char *str; char *endptr; double val = 0; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Get value - no error checking as we checked it above * and there is no other reason the function could fail. */ value_get_concatenated(vo, &str); errno = 0; val = strtod(str, &endptr); /* Check for various possible errors */ if ((errno == ERANGE) || ((errno != 0) && (val == 0)) || (endptr == str)) { TRACE_ERROR_NUMBER("Conversion failed", EIO); if (error) *error = EIO; return def; } if (strict && (*endptr != '\0')) { TRACE_ERROR_NUMBER("More characters than expected", EIO); if (error) *error = EIO; val = def; } TRACE_FLOW_DOUBLE("ini_get_double_config_value returning", val); return val; } /* Get boolean value */ unsigned char ini_get_bool_config_value(struct value_obj *vo, unsigned char def, int *error) { const char *str; uint32_t len = 0; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return def; } if (error) *error = EOK; /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); value_get_concatenated_len(vo, &len); /* Try to parse the value */ if ((strncasecmp(str, "true", len) == 0) || (strncasecmp(str, "yes", len) == 0)) { TRACE_FLOW_STRING("Returning", "true"); return '\1'; } else if ((strncasecmp(str, "false", len) == 0) || (strncasecmp(str, "no", len) == 0)) { TRACE_FLOW_STRING("Returning", "false"); return '\0'; } TRACE_ERROR_STRING("Returning", "error"); if (error) *error = EIO; return def; } /* Return a string out of the value */ char *ini_get_string_config_value(struct value_obj *vo, int *error) { const char *str = NULL; char *ret_str = NULL; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); ret_str = strdup(str); if (ret_str == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } if (error) *error = EOK; TRACE_FLOW_STRING("ini_get_string_config_value returning", str); return ret_str; } /* Get string from the value object */ const char *ini_get_const_string_config_value(struct value_obj *vo, int *error) { const char *str; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); if (error) *error = EOK; TRACE_FLOW_STRING("ini_get_const_string_config_value returning", str); return str; } /* A special hex format is assumed. * The string should be taken in single quotes * and consist of hex encoded value two hex digits per byte. * Example: '0A2BFECC' * Case does not matter. */ char *ini_get_bin_config_value(struct value_obj *vo, int *length, int *error) { int i; char *value = NULL; const char *buff; int size = 0; uint32_t len = 0; const char *str; TRACE_FLOW_ENTRY(); /* Do we have the vo ? */ if (vo == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } if (error) *error = EOK; /* Get value - no error checking as we checked it above * and there is no other reson the function could fail. */ value_get_concatenated(vo, &str); /* Check the length */ value_get_concatenated_len(vo, &len); if ((len%2) != 0) { TRACE_ERROR_STRING("Invalid length for binary data", ""); if (error) *error = EINVAL; return NULL; } /* Is the format correct ? */ if ((*str != '\'') || (str[len -1] != '\'')) { TRACE_ERROR_STRING("String is not escaped",""); if (error) *error = EIO; return NULL; } /* Check that all the symbols are ok */ buff = str + 1; len -= 2; for (i = 0; i < len; i++) { if (!isxdigit(buff[i])) { TRACE_ERROR_STRING("Invalid encoding for binary data", buff); if (error) *error = EIO; return NULL; } } /* The value is good so we can allocate memory for it */ value = malloc(len / 2); if (value == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); if (error) *error = ENOMEM; return NULL; } /* Convert the value */ for (i = 0; i < len; i += 2) { value[size] = (char)(16 * HEXVAL(buff[i]) + HEXVAL(buff[i+1])); size++; } if (error) *error = EOK; if (length) *length = size; TRACE_FLOW_STRING("ini_get_bin_config_value", "Exit"); return value; } /* Function to free binary configuration value */ void ini_free_bin_config_value(char *value) { free(value); } ding-libs-0.6.2/ini/ini_list.c000066400000000000000000000070411417260640400161320ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for single values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_config.h" /* The section array should be freed using this function */ void free_section_list(char **section_list) { TRACE_FLOW_STRING("free_section_list","Entry"); col_free_property_list(section_list); TRACE_FLOW_STRING("free_section_list","Exit"); } /* The section array should be freed using this function */ void free_attribute_list(char **section_list) { TRACE_FLOW_STRING("free_attribute_list","Entry"); col_free_property_list(section_list); TRACE_FLOW_STRING("free_attribute_list","Exit"); } /* Get list of sections as an array of strings. * Function allocates memory for the array of the sections. */ char **get_section_list(struct collection_item *ini_config, int *size, int *error) { char **list; TRACE_FLOW_STRING("get_section_list","Entry"); /* Do we have the item ? */ if ((ini_config == NULL) || ((col_is_of_class(ini_config, COL_CLASS_INI_CONFIG) == 0) && (col_is_of_class(ini_config, COL_CLASS_INI_META) == 0))) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Pass it to the function from collection API */ list = col_collection_to_list(ini_config, size, error); TRACE_FLOW_STRING("get_section_list returning", ((list == NULL) ? "NULL" : list[0])); return list; } /* Get list of attributes in a section as an array of strings. * Function allocates memory for the array of the strings. */ char **get_attribute_list(struct collection_item *ini_config, const char *section, int *size, int *error) { struct collection_item *subcollection = NULL; char **list; int err; TRACE_FLOW_STRING("get_attribute_list","Entry"); /* Do we have the item ? */ if ((ini_config == NULL) || ((col_is_of_class(ini_config, COL_CLASS_INI_CONFIG) == 0) && (col_is_of_class(ini_config, COL_CLASS_INI_META) == 0)) || (section == NULL)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Fetch section */ err = col_get_collection_reference(ini_config, &subcollection, section); /* Check error */ if (err && (subcollection == NULL)) { TRACE_ERROR_NUMBER("Failed to get section", err); if (error) *error = EINVAL; return NULL; } /* Pass it to the function from collection API */ list = col_collection_to_list(subcollection, size, error); col_destroy_collection(subcollection); TRACE_FLOW_STRING("get_attribute_list returning", ((list == NULL) ? "NULL" : list[0])); return list; } ding-libs-0.6.2/ini/ini_list_valueobj.c000066400000000000000000000074341417260640400200270ustar00rootroot00000000000000/* INI LIBRARY Value interpretation functions for single values and corresponding memory cleanup functions. Copyright (C) Dmitri Pal 2012 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_configobj.h" #include "ini_config_priv.h" /* The section array should be freed using this function */ void ini_free_section_list(char **section_list) { TRACE_FLOW_ENTRY(); col_free_property_list(section_list); TRACE_FLOW_EXIT(); } /* The section array should be freed using this function */ void ini_free_attribute_list(char **section_list) { TRACE_FLOW_ENTRY(); col_free_property_list(section_list); TRACE_FLOW_EXIT(); } /* Get list of sections as an array of strings. * Function allocates memory for the array of the sections. */ char **ini_get_section_list(struct ini_cfgobj *ini_config, int *size, int *error) { char **list; TRACE_FLOW_ENTRY(); /* Do we have the configuration object ? */ if (ini_config == NULL) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Pass it to the function from collection API */ list = col_collection_to_list(ini_config->cfg, size, error); TRACE_FLOW_STRING("ini_get_section_list returning", ((list == NULL) ? "NULL" : list[0])); return list; } /* Get list of attributes in a section as an array of strings. * Function allocates memory for the array of the strings. */ char **ini_get_attribute_list(struct ini_cfgobj *ini_config, const char *section, int *size, int *error) { struct collection_item *subcollection = NULL; char **list; int err; int i = 0; TRACE_FLOW_ENTRY(); /* Do we have the configuration object ? */ if (ini_config == NULL) { TRACE_ERROR_NUMBER("Invalid configuration object argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Do we have the section ? */ if (section == NULL) { TRACE_ERROR_NUMBER("Invalid section argument.", EINVAL); if (error) *error = EINVAL; return NULL; } /* Fetch section */ err = col_get_collection_reference(ini_config->cfg, &subcollection, section); /* Check error */ if (err && (subcollection == NULL)) { TRACE_ERROR_NUMBER("Failed to get section", err); if (error) *error = EINVAL; return NULL; } /* Pass it to the function from collection API */ list = col_collection_to_list(subcollection, size, error); col_destroy_collection(subcollection); /* Our list of attributes has a special extra attribute - remove it */ if ((list != NULL) && (list[0] != NULL)) { free(list[0]); while(list[i + 1] != NULL) { list[i] = list[i + 1]; i++; } list[i] = NULL; } if (size) (*size)--; TRACE_FLOW_STRING("ini_get_attribute_list returning", ((list == NULL) ? "NULL" : list[0])); return list; } ding-libs-0.6.2/ini/ini_metadata.c000066400000000000000000000371701417260640400167450ustar00rootroot00000000000000/* INI LIBRARY Functions to process metadata. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include "collection.h" #include "collection_tools.h" #include "trace.h" #include "ini_config.h" #include "ini_metadata.h" #define INI_METADATA "meta" /* Beffer length used for int to string conversions */ #define CONVERSION_BUFFER 80 /* Invalid file mode */ #define WRONG_FMODE 0x80000000 /* Prepare metadata */ int prepare_metadata(uint32_t metaflags, struct collection_item **metadata, int *save_error) { int error = EOK; struct collection_item *metasec = NULL; TRACE_FLOW_STRING("prepare_metadata", "Entry"); /* Are we supposed to collect or process meta data ? */ if (!metadata) { TRACE_FLOW_STRING("No meta data", "Exit"); return EOK; } /* Allocate metadata */ error = col_create_collection(metadata, INI_METADATA, COL_CLASS_INI_META); if (error) { TRACE_ERROR_NUMBER("Failed to create meta data", error); return error; } /* Check and create section for file error if needed */ if (metaflags & INI_META_SEC_ERROR_FLAG) { /* Create ERROR collection */ if ((error = col_create_collection(&metasec, INI_META_SEC_ERROR, COL_CLASS_INI_SECTION)) || (error = col_add_collection_to_collection( *metadata, NULL, NULL, metasec, COL_ADD_MODE_REFERENCE))) { TRACE_ERROR_NUMBER("Failed to create error section", error); col_destroy_collection(metasec); col_destroy_collection(*metadata); *metadata = NULL; return error; } /* If we are here we would have to save file open error */ *save_error = 1; col_destroy_collection(metasec); } TRACE_FLOW_STRING("prepare_metadata", "Exit"); return error; } /* Collect metadata for the file */ int collect_metadata(uint32_t metaflags, struct collection_item **metadata, FILE *config_file, const char *config_filename) { int error = EOK; struct collection_item *metasec = NULL; int filedes; struct stat file_stats; char buff[CONVERSION_BUFFER]; TRACE_FLOW_STRING("collect_metadata", "Entry"); /* Check and create section for file error if needed */ if (metaflags & INI_META_SEC_ACCESS_FLAG) { /* Create ACCESS collection */ error = col_create_collection(&metasec, INI_META_SEC_ACCESS, COL_CLASS_INI_SECTION); if (error) { TRACE_ERROR_NUMBER("Failed to create access section.", error); col_destroy_collection(metasec); return error; } filedes = fileno(config_file); /* Collect statistics */ errno = 0; if (fstat(filedes, &file_stats) < 0) { error = errno; TRACE_ERROR_NUMBER("Failed to get statistics.", error); col_destroy_collection(metasec); return error; } /* Record statistics */ /* UID */ snprintf(buff, CONVERSION_BUFFER, "%lu", (unsigned long)file_stats.st_uid); error = col_add_str_property(metasec, NULL, INI_META_KEY_UID, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save uid", error); col_destroy_collection(metasec); return error; } /* GID */ snprintf(buff, CONVERSION_BUFFER, "%lu", (unsigned long)file_stats.st_gid); error = col_add_str_property(metasec, NULL, INI_META_KEY_GID, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save gid", error); col_destroy_collection(metasec); return error; } /* PERMISSIONS */ snprintf(buff, CONVERSION_BUFFER, "%lu", (unsigned long)file_stats.st_mode); error = col_add_str_property(metasec, NULL, INI_META_KEY_PERM, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save permissions", error); col_destroy_collection(metasec); return error; } /* Modification time stamp */ snprintf(buff, CONVERSION_BUFFER, "%ld", (long int)file_stats.st_mtime); error = col_add_str_property(metasec, NULL, INI_META_KEY_MODIFIED, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save modification time", error); col_destroy_collection(metasec); return error; } /* Name */ error = col_add_str_property(metasec, NULL, INI_META_KEY_NAME, config_filename, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save file name", error); col_destroy_collection(metasec); return error; } /* The device ID can actualy be bigger than * 32-bits according to the type sizes. * However it is probaly not going to happen * on a real system. * Add a check for this case. */ if (file_stats.st_dev > ULONG_MAX) { TRACE_ERROR_NUMBER("Device is out of range", ERANGE); col_destroy_collection(metasec); return ERANGE; } /* Device ID */ TRACE_INFO_LNUMBER("Device ID", file_stats.st_dev); snprintf(buff, CONVERSION_BUFFER, "%lu", (unsigned long)file_stats.st_dev); error = col_add_str_property(metasec, NULL, INI_META_KEY_DEV, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save inode", error); col_destroy_collection(metasec); return error; } /* i-node */ snprintf(buff, CONVERSION_BUFFER, "%lu", (unsigned long)file_stats.st_ino); error = col_add_str_property(metasec, NULL, INI_META_KEY_INODE, buff, 0); if (error) { TRACE_ERROR_NUMBER("Failed to save inode", error); col_destroy_collection(metasec); return error; } /* Add section to metadata */ error = col_add_collection_to_collection( *metadata, NULL, NULL, metasec, COL_ADD_MODE_REFERENCE); col_destroy_collection(metasec); if (error) { TRACE_ERROR_NUMBER("Failed to save file name", error); return error; } } TRACE_FLOW_STRING("collect_metadata", "Exit"); return error; } /* Function to free metadata */ void free_ini_config_metadata(struct collection_item *metadata) { TRACE_FLOW_STRING("free_ini_config_metadata", "Entry"); col_destroy_collection(metadata); TRACE_FLOW_STRING("free_ini_config_metadata", "Exit"); } /* Function to check uid or gid */ static int check_id(struct collection_item *metadata, unsigned long id, const char *key) { int error = EOK; struct collection_item *item = NULL; unsigned long fid; TRACE_FLOW_STRING("check_id", "Entry"); TRACE_INFO_STRING("Key", key); error = get_config_item(INI_META_SEC_ACCESS, key, metadata, &item); if (error) { TRACE_ERROR_NUMBER("Internal collection error.", error); return error; } /* Entry is supposed to be there so it is an error * is the item is not found. */ if (item == NULL) { TRACE_ERROR_NUMBER("Expected item is not found.", ENOENT); return ENOENT; } fid = get_ulong_config_value(item, 1, -1, &error); if ((error) || (fid == -1)) { TRACE_ERROR_NUMBER("Conversion failed", EINVAL); return EINVAL; } if (id != fid) { TRACE_ERROR_NUMBER("File ID:", fid); TRACE_ERROR_NUMBER("ID passed in.", id); TRACE_ERROR_NUMBER("Access denied.", EACCES); return EACCES; } TRACE_FLOW_STRING("check_id", "Exit"); return EOK; } /* Function to check access */ int config_access_check(struct collection_item *metadata, uint32_t flags, uid_t uid, gid_t gid, mode_t mode, mode_t mask) { int error = EOK; struct collection_item *item = NULL; mode_t f_mode; TRACE_FLOW_STRING("config_access_check", "Entry"); flags &= INI_ACCESS_CHECK_MODE | INI_ACCESS_CHECK_GID | INI_ACCESS_CHECK_UID; if ((metadata == NULL) || (flags == 0)) { TRACE_ERROR_NUMBER("Invalid parameter.", EINVAL); return EINVAL; } /* Check that metadata is actually metadata */ if(!col_is_of_class(metadata, COL_CLASS_INI_META)) { TRACE_ERROR_NUMBER("Invalid collection.", EINVAL); return EINVAL; } /* Check mode */ if (flags & INI_ACCESS_CHECK_MODE) { error = get_config_item(INI_META_SEC_ACCESS, INI_META_KEY_PERM, metadata, &item); if (error) { TRACE_ERROR_NUMBER("Internal collection error.", error); return error; } /* Entry is supposed to be there so it is an error * is the item is not found. */ if (item == NULL) { TRACE_ERROR_NUMBER("Expected item is not found.", ENOENT); return ENOENT; } f_mode = (mode_t)get_ulong_config_value(item, 1, WRONG_FMODE, &error); if ((error) || (f_mode == WRONG_FMODE)) { TRACE_ERROR_NUMBER("Conversion failed", error); return ENOENT; } TRACE_INFO_NUMBER("File mode as saved.", f_mode); f_mode &= S_IRWXU | S_IRWXG | S_IRWXO; TRACE_INFO_NUMBER("File mode adjusted.", f_mode); TRACE_INFO_NUMBER("Mode as provided.", mode); mode &= S_IRWXU | S_IRWXG | S_IRWXO; TRACE_INFO_NUMBER("Mode adjusted.", mode); /* Adjust mask */ if (mask == 0) mask = S_IRWXU | S_IRWXG | S_IRWXO; else mask &= S_IRWXU | S_IRWXG | S_IRWXO; if ((mode & mask) != (f_mode & mask)) { TRACE_INFO_NUMBER("File mode:", (mode & mask)); TRACE_INFO_NUMBER("Mode adjusted.", (f_mode & mask)); TRACE_ERROR_NUMBER("Access denied.", EACCES); return EACCES; } } /* Check uid */ if (flags & INI_ACCESS_CHECK_UID) { error = check_id(metadata, (unsigned long)uid, INI_META_KEY_UID); if (error) { TRACE_ERROR_NUMBER("Check for UID failed.", error); return error; } } /* Check gid */ if (flags & INI_ACCESS_CHECK_GID) { error = check_id(metadata, (unsigned long)gid, INI_META_KEY_GID); if (error) { TRACE_ERROR_NUMBER("Check for UID failed.", error); return error; } } TRACE_FLOW_STRING("config_access_check", "Exit"); return error; } static unsigned long get_checked_value(struct collection_item *metadata, const char *key, int *err) { int error = EOK; struct collection_item *item = NULL; unsigned long value; TRACE_FLOW_STRING("get_checked_value", "Entry"); TRACE_INFO_STRING("Key", key); error = get_config_item(INI_META_SEC_ACCESS, key, metadata, &item); if (error) { TRACE_ERROR_NUMBER("Internal collection error.", error); *err = error; return 0; } /* Entry is supposed to be there so it is an error * is the item is not found. */ if (item == NULL) { TRACE_ERROR_NUMBER("Expected item is not found.", ENOENT); *err = ENOENT; return 0; } value = get_ulong_config_value(item, 1, -1, &error); if ((error) || (value == -1)) { TRACE_ERROR_NUMBER("Conversion failed", EINVAL); *err = EINVAL; return 0; } *err = 0; TRACE_FLOW_NUMBER("get_checked_value Returning", value); return value; } /* Function to check whether the configuration is different */ int config_changed(struct collection_item *metadata, struct collection_item *saved_metadata, int *changed) { int error = EOK; struct collection_item *md[2]; unsigned long value[3][2]; const char *key[] = { INI_META_KEY_MODIFIED, INI_META_KEY_DEV, INI_META_KEY_INODE }; int i, j; TRACE_FLOW_STRING("config_changed", "Entry"); if ((!metadata) || (!saved_metadata) || (!changed) || (!col_is_of_class(metadata, COL_CLASS_INI_META)) || (!col_is_of_class(saved_metadata, COL_CLASS_INI_META))) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); return EINVAL; } md[0] = metadata; md[1] = saved_metadata; /* Get three values from each collection and compare them */ for (i = 0; i < 3; i++) { for (j = 0; j < 2; j++) { value[i][j] = get_checked_value(md[j], key[i] , &error); if (error) { TRACE_ERROR_NUMBER("Failed to get section.", error); return error; } } if (value[i][0] != value[i][1]) { *changed = 1; break; } } TRACE_FLOW_STRING("config_changed", "Exit"); return error; } ding-libs-0.6.2/ini/ini_metadata.h000066400000000000000000000024331417260640400167440ustar00rootroot00000000000000/* INI LIBRARY Header file for the meta data related functions. Copyright (C) Dmitri Pal 2009 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_METADATA_H #define INI_METADATA_H #include #include #include "collection.h" /* Prepare metadata */ int prepare_metadata(uint32_t metaflags, struct collection_item **metadata, int *save_error); /* Collect metadata for the file */ int collect_metadata(uint32_t metaflags, struct collection_item **metadata, FILE *config_file, const char *config_filename); #endif ding-libs-0.6.2/ini/ini_parse.c000066400000000000000000001444541417260640400163030ustar00rootroot00000000000000/* INI LIBRARY Low level parsing functions Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include /* For error text */ #include #define _(String) gettext (String) #include "trace.h" #include "ini_defines.h" #include "ini_valueobj.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "collection.h" #include "collection_queue.h" #define INI_WARNING 0xA0000000 /* Warning bit */ struct parser_obj { /* Externally passed and saved data */ FILE *file; struct collection_item *top; struct collection_item *el; const char *filename; struct ini_cfgobj *co; /* Level of error reporting */ int error_level; /* Collistion flags */ uint32_t collision_flags; /* Parseing flags */ uint32_t parse_flags; /* Wrapping boundary */ uint32_t boundary; /* Action queue */ struct collection_item *queue; /* Last error */ uint32_t last_error; /* Last line number */ uint32_t linenum; /* Line number of the last found key */ uint32_t keylinenum; /* Line number of the last found section */ uint32_t seclinenum; /* Internal variables */ struct collection_item *sec; struct collection_item *merge_sec; struct ini_comment *ic; char *last_read; uint32_t last_read_len; int inside_comment; char *key; uint32_t key_len; struct ref_array *raw_lines; struct ref_array *raw_lengths; char *merge_key; struct value_obj *merge_vo; /* Merge error */ uint32_t merge_error; int ret; }; typedef int (*action_fn)(struct parser_obj *); #define PARSE_ACTION "action" /* Actions */ #define PARSE_READ 0 /* Read from the file */ #define PARSE_INSPECT 1 /* Process read string */ #define PARSE_POST 2 /* Reading is complete */ #define PARSE_ERROR 3 /* Handle error */ #define PARSE_DONE 4 /* We are done */ /* Declarations of the reusble functions: */ static int complete_value_processing(struct parser_obj *po); static int save_error(struct collection_item *el, unsigned line, int error, const char *err_txt); static int is_just_spaces(const char *str, uint32_t len) { uint32_t i; TRACE_FLOW_ENTRY(); for (i = 0; i < len; i++) { if (!isspace(str[i])) return 0; } TRACE_FLOW_EXIT(); return 1; } /* Functions checks whether the line * starts with the sequence of allowed blank characters. * If spaces are allowed - function will say that line * is OK. If tabls are allowed the function also would * say that line is OK. If the mixture of both is allowed * the line is OK too. * Any other character will cause an error. */ static int is_allowed_spaces(const char *str, uint32_t len, uint32_t parse_flags, int *error) { uint32_t i; int line_ok = 1; TRACE_FLOW_ENTRY(); for (i = 0; i < len; i++) { if ((str[i] == ' ') && (parse_flags & INI_PARSE_NOSPACE)) { /* Leading spaces are not allowed */ *error = ERR_SPACE; line_ok = 0; break; } else if ((str[i] == '\t') && (parse_flags & INI_PARSE_NOTAB)) { /* Leading tabs are not allowed */ *error = ERR_TAB; line_ok = 0; break; } else if ((str[i] == '\f') || (str[i] == '\n') || (str[i] == '\r') || (str[i] == '\v')) { *error = ERR_SPECIAL; line_ok = 0; break; } if (!isblank(str[i])) break; } TRACE_FLOW_EXIT(); return line_ok; } /* Destroy parser object */ static void parser_destroy(struct parser_obj *po) { TRACE_FLOW_ENTRY(); if(po) { col_destroy_queue(po->queue); col_destroy_collection_with_cb(po->sec, ini_cleanup_cb, NULL); ini_comment_destroy(po->ic); value_destroy_arrays(po->raw_lines, po->raw_lengths); if (po->last_read) free(po->last_read); if (po->key) free(po->key); col_destroy_collection_with_cb(po->top, ini_cleanup_cb, NULL); free(po); } TRACE_FLOW_EXIT(); } /* Create parse object * * It assumes that the ini collection * has been precreated. */ static int parser_create(struct ini_cfgobj *co, FILE *file, const char *config_filename, int error_level, uint32_t collision_flags, uint32_t parse_flags, struct parser_obj **po) { int error = EOK; struct parser_obj *new_po = NULL; unsigned count = 0; TRACE_FLOW_ENTRY(); /* Make sure that all the parts are initialized */ if ((!po) || (!co) || (!(co->cfg)) || (!file) || (!config_filename)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } error = col_get_collection_count(co->cfg, &count); if (error) { TRACE_ERROR_NUMBER("Failed to check object size", error); return error; } if (count != 1) { TRACE_ERROR_NUMBER("Configuration is not empty", EINVAL); return EINVAL; } new_po = malloc(sizeof(struct parser_obj)); if (!new_po) { TRACE_ERROR_NUMBER("No memory", ENOMEM); return ENOMEM; } /* Save external data */ new_po->file = file; new_po->el = co->error_list; new_po->filename = config_filename; new_po->error_level = error_level; new_po->collision_flags = collision_flags; new_po->parse_flags = parse_flags; new_po->boundary = co->boundary; new_po->co = co; /* Initialize internal varibles */ new_po->sec = NULL; new_po->merge_sec = NULL; new_po->ic = NULL; new_po->last_error = 0; new_po->linenum = 0; new_po->keylinenum = 0; new_po->seclinenum = 0; new_po->last_read = NULL; new_po->last_read_len = 0; new_po->inside_comment = 0; new_po->key = NULL; new_po->key_len = 0; new_po->raw_lines = NULL; new_po->raw_lengths = NULL; new_po->ret = EOK; new_po->merge_key = NULL; new_po->merge_vo = NULL; new_po->merge_error = 0; new_po->top = NULL; new_po->queue = NULL; /* Create top collection */ error = col_create_collection(&(new_po->top), INI_CONFIG_NAME, COL_CLASS_INI_CONFIG); if (error) { TRACE_ERROR_NUMBER("Failed to create top collection", error); parser_destroy(new_po); return error; } /* Create a queue */ error = col_create_queue(&(new_po->queue)); if (error) { TRACE_ERROR_NUMBER("Failed to create queue", error); parser_destroy(new_po); return error; } error = col_enqueue_unsigned_property(new_po->queue, PARSE_ACTION, PARSE_READ); if (error) { TRACE_ERROR_NUMBER("Failed to create queue", error); parser_destroy(new_po); return error; } *po = new_po; TRACE_FLOW_EXIT(); return error; } /* Function to read next line from the file */ static int parser_read(struct parser_obj *po) { int error = EOK; char *buffer = NULL; ssize_t res = 0; size_t len = 0; int32_t i = 0; uint32_t action; TRACE_FLOW_ENTRY(); /* Adjust line number */ (po->linenum)++; /* Get line from the file */ res = getline(&buffer, &len, po->file); if (res == -1) { if (feof(po->file)) { TRACE_FLOW_STRING("Read nothing", ""); if (po->inside_comment) { action = PARSE_ERROR; po->last_error = ERR_BADCOMMENT; } else action = PARSE_POST; } else { TRACE_ERROR_STRING("Error reading", ""); action = PARSE_ERROR; po->last_error = ERR_READ; } if(buffer) free(buffer); } else { /* Read Ok */ len = res; TRACE_INFO_STRING("Read line ok:", buffer); TRACE_INFO_NUMBER("Length:", len); TRACE_INFO_NUMBER("Strlen:", strlen(buffer)); if (buffer[0] == '\0') { /* Empty line - read again (should not ever happen) */ action = PARSE_READ; free(buffer); } else { /* Trim end line */ i = len - 1; while ((i >= 0) && ((buffer[i] == '\r') || (buffer[i] == '\n'))) { TRACE_INFO_NUMBER("Offset:", i); TRACE_INFO_NUMBER("Code:", buffer[i]); buffer[i] = '\0'; i--; } po->last_read = buffer; po->last_read_len = i + 1; action = PARSE_INSPECT; TRACE_INFO_STRING("Line:", po->last_read); TRACE_INFO_NUMBER("Linelen:", po->last_read_len); } } /* Move to the next action */ error = col_enqueue_unsigned_property(po->queue, PARSE_ACTION, action); if (error) { TRACE_ERROR_NUMBER("Failed to schedule an action", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Find if there is a collistion */ static int check_section_collision(struct parser_obj *po) { int error = EOK; struct collection_item *item = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Searching for:", col_get_item_property(po->sec, NULL)); error = col_get_item(po->top, col_get_item_property(po->sec, NULL), COL_TYPE_COLLECTIONREF, COL_TRAVERSE_DEFAULT, &item); if (error) { TRACE_ERROR_NUMBER("Failed searching for dup", error); return error; } /* Check if there is a dup */ if (item) { TRACE_INFO_STRING("Collision found:", col_get_item_property(item, NULL)); /* Get the actual section collection instead of reference */ po->merge_sec = *((struct collection_item **) (col_get_item_data(item))); } else { TRACE_INFO_STRING("Collision not found.", ""); po->merge_sec = NULL; } TRACE_FLOW_EXIT(); return EOK; } /* Clean all items in the section */ int empty_section(struct collection_item *sec) { int error = EOK; struct collection_item *item = NULL; struct collection_item *save_item = NULL; struct value_obj *vo = NULL; int work_to_do = 1; TRACE_FLOW_ENTRY(); do { item = NULL; error = col_extract_item_from_current(sec, COL_DSP_FRONT, NULL, 0, COL_TYPE_ANY, &item); if ((error) && (error != ENOENT)) { TRACE_ERROR_NUMBER("Failed to extract item.", error); return error; } if (item) { TRACE_INFO_STRING("Item found:", col_get_item_property(item, NULL)); if (strncmp(col_get_item_property(item, NULL), INI_SECTION_KEY, 1) == 0) { /* Just ignore the first item */ save_item = item; continue; } vo = *((struct value_obj **)(col_get_item_data(item))); value_destroy(vo); col_delete_item(item); } else { TRACE_INFO_STRING("No more items:", ""); /* Restore saved item */ error = col_insert_item(sec, NULL, save_item, COL_DSP_END, NULL, 0, COL_INSERT_NOCHECK); if (error) { TRACE_ERROR_NUMBER("Failed to restore item.", error); return error; } work_to_do = 0; } } while (work_to_do); TRACE_FLOW_EXIT(); return EOK; } /* Merge contents of the section */ static int merge_section(struct parser_obj *po) { int error = EOK; struct collection_item *item = NULL; struct value_obj *vo = NULL; int work_to_do = 1; const char *key; TRACE_FLOW_ENTRY(); do { TRACE_INFO_STRING("Top of the merge loop", ""); item = NULL; error = col_extract_item_from_current(po->sec, COL_DSP_FRONT, NULL, 0, COL_TYPE_ANY, &item); if ((error) && (error != ENOENT)) { TRACE_ERROR_NUMBER("Failed to extract item.", error); return error; } if (item) { TRACE_INFO_STRING("Item found:", col_get_item_property(item, NULL)); if (strncmp(col_get_item_property(item, NULL), INI_SECTION_KEY, 1) == 0) { /* Just ignore the first item */ vo = *((struct value_obj **)(col_get_item_data(item))); value_destroy(vo); col_delete_item(item); continue; } po->merge_vo = *((struct value_obj **)(col_get_item_data(item))); key = col_get_item_property(item, NULL); /* To be able to use po->merge_key in the loop * we have to overcome constraints imposed by * the "const" declaration. */ memcpy(&(po->merge_key), &key, sizeof(char *)); /* Use the value processing function to inser the value */ error = complete_value_processing(po); /* In case of error value is already cleaned */ po->merge_vo = NULL; po->merge_key = NULL; col_delete_item(item); /* Now we can check the error */ if (error) { TRACE_ERROR_NUMBER("Failed to merge item.", error); return error; } } else { TRACE_INFO_STRING("No more items:", ""); work_to_do = 0; } } while (work_to_do); /* If we reached this place the incoming section is empty. * but just to be safe clean with callback. */ col_destroy_collection_with_cb(po->sec, ini_cleanup_cb, NULL); po->sec = NULL; TRACE_FLOW_EXIT(); return EOK; } /* Function to read next line from the file */ static int parser_save_section(struct parser_obj *po) { int error = EOK; uint32_t mergemode; int merge = 0; TRACE_FLOW_ENTRY(); if (po->sec) { TRACE_INFO_STRING("Section exists.", ""); /* First detect if we have collision */ error = check_section_collision(po); if (error) { TRACE_ERROR_NUMBER("Failed to check for collision", error); return error; } if (po->merge_sec) { TRACE_INFO_STRING("Merge collision detected", ""); mergemode = po->collision_flags & INI_MS_MODE_MASK; switch (mergemode) { case INI_MS_ERROR: /* Report error and return */ TRACE_INFO_STRING("Reporting error", "duplicate section"); error = save_error(po->el, po->seclinenum, ERR_DUPSECTION, ERROR_TXT); if (error) { TRACE_ERROR_NUMBER("Failed to " "save error", error); return error; } /* Return error */ TRACE_FLOW_RETURN(EEXIST); return EEXIST; case INI_MS_PRESERVE: /* Delete new section */ TRACE_INFO_STRING("Preserve mode", ""); col_destroy_collection_with_cb( po->sec, ini_cleanup_cb, NULL); po->sec = NULL; break; case INI_MS_OVERWRITE: /* Empty existing section */ TRACE_INFO_STRING("Ovewrite mode", ""); error = empty_section(po->merge_sec); if (error) { TRACE_ERROR_NUMBER("Failed to " "empty section", error); return error; } merge = 1; break; case INI_MS_MERGE: /* Merge */ default: TRACE_INFO_STRING("Merge mode", ""); merge = 1; break; } if (po->collision_flags & INI_MS_DETECT) { po->merge_error = EEXIST; error = save_error(po->el, po->seclinenum, ERR_DUPSECTION, ERROR_TXT); if (error) { TRACE_ERROR_NUMBER("Failed to " "save error", error); return error; } } if (merge) { error = merge_section(po); if (error) { TRACE_ERROR_NUMBER("Failed to merge section", error); return error; } } po->merge_sec = NULL; } else { /* Add section to configuration */ TRACE_INFO_STRING("Now adding collection", ""); error = col_add_collection_to_collection(po->top, NULL, NULL, po->sec, COL_ADD_MODE_EMBED); if (error) { TRACE_ERROR_NUMBER("Failed to embed section", error); return error; } po->sec = NULL; } } TRACE_FLOW_EXIT(); return EOK; } /* Complete value processing */ static int complete_value_processing(struct parser_obj *po) { int error = EOK; int error2 = EOK; struct value_obj *vo = NULL; struct value_obj *vo_old = NULL; unsigned insertmode; uint32_t mergemode; int suppress = 0; int doinsert = 0; struct collection_item *item = NULL; struct collection_item *section = NULL; int merging = 0; TRACE_FLOW_ENTRY(); if (po->merge_sec) { TRACE_INFO_STRING("Processing value in merge mode", ""); section = po->merge_sec; merging = 1; } else if(!(po->sec)) { TRACE_INFO_STRING("Creating default section", ""); /* If there is not open section create a default one */ error = col_create_collection(&po->sec, INI_DEFAULT_SECTION, COL_CLASS_INI_SECTION); if (error) { TRACE_ERROR_NUMBER("Failed to create default section", error); return error; } section = po->sec; } else { TRACE_INFO_STRING("Processing value in normal mode", ""); section = po->sec; } if (merging) { TRACE_INFO_STRING("Using merge key:", po->merge_key); vo = po->merge_vo; /* We are adding to the merge section so use MV2S flags. * But flags are done in such a way that deviding MV2S by MV1S mask * will translate MV2S flags into MV1S so we can use * MV1S constants. */ TRACE_INFO_NUMBER("Collisions flags:", po->collision_flags); mergemode = (po->collision_flags & INI_MV2S_MASK) / INI_MV1S_MASK; } else { /* Construct value object from what we have */ error = value_create_from_refarray(po->raw_lines, po->raw_lengths, po->keylinenum, INI_VALUE_READ, po->key_len, po->boundary, po->ic, &vo); if (error) { TRACE_ERROR_NUMBER("Failed to create value object", error); return error; } /* Forget about the arrays. They are now owned by the value object */ po->ic = NULL; po->raw_lines = NULL; po->raw_lengths = NULL; mergemode = po->collision_flags & INI_MV1S_MASK; } switch (mergemode) { case INI_MV1S_ERROR: insertmode = COL_INSERT_DUPERROR; doinsert = 1; break; case INI_MV1S_PRESERVE: insertmode = COL_INSERT_DUPERROR; doinsert = 1; suppress = 1; break; case INI_MV1S_ALLOW: insertmode = COL_INSERT_NOCHECK; doinsert = 1; break; case INI_MV1S_OVERWRITE: /* Special handling */ case INI_MV1S_DETECT: default: break; } /* Do not insert but search for dups first */ if (!doinsert) { TRACE_INFO_STRING("Overwrite mode. Looking for:", (char *)(merging ? po->merge_key : po->key)); error = col_get_item(section, merging ? po->merge_key : po->key, COL_TYPE_BINARY, COL_TRAVERSE_DEFAULT, &item); if (error) { TRACE_ERROR_NUMBER("Failed searching for dup", error); value_destroy(vo); return error; } /* Check if there is a dup */ if (item) { /* Check if we are in the detect mode */ if (mergemode == INI_MV1S_DETECT) { po->merge_error = EEXIST; /* There is a dup - inform user about it and continue */ error = save_error(po->el, merging ? po->seclinenum : po->keylinenum, merging ? ERR_DUPKEYSEC : ERR_DUPKEY, ERROR_TXT); if (error) { TRACE_ERROR_NUMBER("Failed to save error", error); value_destroy(vo); return error; } doinsert = 1; insertmode = COL_INSERT_NOCHECK; } else { /* Dup exists - update it */ vo_old = *((struct value_obj **)(col_get_item_data(item))); error = col_modify_binary_item(item, NULL, &vo, sizeof(struct value_obj *)); if (error) { TRACE_ERROR_NUMBER("Failed updating the value", error); value_destroy(vo); return error; } /* If we failed to update it is better to leak then crash, * so destroy original value only on the successful update. */ value_destroy(vo_old); } } else { /* No dup found so we can insert with no check */ doinsert = 1; insertmode = COL_INSERT_NOCHECK; } } if (doinsert) { /* Add value to collection */ error = col_insert_binary_property(section, NULL, COL_DSP_END, NULL, 0, insertmode, merging ? po->merge_key : po->key, &vo, sizeof(struct value_obj *)); if (error) { value_destroy(vo); if ((suppress) && (error == EEXIST)) { TRACE_INFO_STRING("Preseved exisitng value", (char *)(merging ? po->merge_key : po->key)); } else { /* Check if this is a critical error or not */ if ((mergemode == INI_MV1S_ERROR) && (error == EEXIST)) { TRACE_ERROR_NUMBER("Failed to add value object " "to the section", error); error2 = save_error(po->el, merging ? po->seclinenum : po->keylinenum, merging ? ERR_DUPKEYSEC : ERR_DUPKEY, ERROR_TXT); if (error2) { TRACE_ERROR_NUMBER("Failed to save error", error2); return error2; } return error; } else { TRACE_ERROR_NUMBER("Failed to add value object" " to the section", error); return error; } } } } if (!merging) { free(po->key); po->key = NULL; po->key_len = 0; } TRACE_FLOW_EXIT(); return EOK; } /* Process comment */ static int handle_comment(struct parser_obj *po, uint32_t *action) { int error = EOK; TRACE_FLOW_ENTRY(); /* We got a comment */ if (po->key) { /* Previous value if any is complete */ error = complete_value_processing(po); if (error) { TRACE_ERROR_NUMBER("Failed to finish saving value", error); return error; } } if (!(po->ic)) { /* Create a new comment */ error = ini_comment_create(&(po->ic)); if (error) { TRACE_ERROR_NUMBER("Failed to create comment", error); return error; } } /* Add line to comment */ error = ini_comment_build_wl(po->ic, po->last_read, po->last_read_len); if (error) { TRACE_ERROR_NUMBER("Failed to add line to comment", error); return error; } /* * We are done with the comment line. * Free it since comment keeps a copy. */ free(po->last_read); po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; TRACE_FLOW_EXIT(); return EOK; } /* Handle key-value pair */ static int handle_kvp(struct parser_obj *po, uint32_t *action) { int error = EOK; char *eq = NULL; uint32_t len = 0; char *dupval = NULL; char *str; uint32_t full_len; TRACE_FLOW_ENTRY(); str = po->last_read; full_len = po->last_read_len; TRACE_INFO_STRING("Last read:", str); /* Trim spaces at the beginning */ while ((full_len > 0) && (isspace(*(str)))) { str++; full_len--; } /* Check if we have the key */ if (*(str) == '=') { TRACE_ERROR_STRING("No key", str); if (po->parse_flags & INI_PARSE_IGNORE_NON_KVP) { /* Clean everything as if nothing happened */ free(po->last_read); po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; } else { po->last_error = ERR_NOKEY; *action = PARSE_ERROR; } TRACE_FLOW_EXIT(); return EOK; } /* Find "=" */ eq = strchr(str, '='); if (eq == NULL) { if (po->parse_flags & INI_PARSE_IGNORE_NON_KVP) { /* Clean everything as if nothing happened */ free(po->last_read); po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; } else { TRACE_ERROR_STRING("No equal sign", str); po->last_error = ERR_NOEQUAL; *action = PARSE_ERROR; } TRACE_FLOW_EXIT(); return EOK; } /* Strip spaces around "=" */ /* Since eq > str we can substract 1 */ len = eq - str - 1; while ((len > 0) && (isspace(*(str + len)))) len--; /* Adjust length properly */ len++; /* Check the key length */ if(len >= MAX_KEY) { TRACE_ERROR_STRING("Key name is too long", str); po->last_error = ERR_LONGKEY; *action = PARSE_ERROR; TRACE_FLOW_EXIT(); return EOK; } if (po->key) { /* Complete processing of the previous value */ error = complete_value_processing(po); if (error) { TRACE_ERROR_NUMBER("Failed to complete value processing", error); TRACE_FLOW_EXIT(); return error; } } /* Dup the key name */ po->key = malloc(len + 1); if (!(po->key)) { TRACE_ERROR_NUMBER("Failed to dup key", ENOMEM); TRACE_FLOW_EXIT(); return ENOMEM; } memcpy(po->key, str, len); *(po->key + len) = '\0'; po->key_len = len; TRACE_INFO_STRING("Key:", po->key); TRACE_INFO_NUMBER("Keylen:", po->key_len); len = full_len - (eq - str) - 1; /* Trim spaces after equal sign */ eq++; while (isspace(*eq)) { eq++; len--; } TRACE_INFO_STRING("VALUE:", eq); TRACE_INFO_NUMBER("LENGTH:", len); /* Dup the part of the value */ dupval = malloc(len + 1); if (!dupval) { TRACE_ERROR_NUMBER("Failed to dup value", ENOMEM); TRACE_FLOW_EXIT(); return ENOMEM; } memcpy(dupval, eq, len); *(dupval + len) = '\0'; /* Create new arrays */ error = value_create_arrays(&(po->raw_lines), &(po->raw_lengths)); if (error) { TRACE_ERROR_NUMBER("Failed to create arrays", error); free(dupval); TRACE_FLOW_EXIT(); return error; } /* Save a duplicated part in the value */ error = value_add_to_arrays(dupval, len, po->raw_lines, po->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to add value to arrays", error); free(dupval); TRACE_FLOW_EXIT(); return error; } /* Save the line number of the last found key */ po->keylinenum = po->linenum; /* Prepare for reading */ free(po->last_read); po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; TRACE_FLOW_EXIT(); return EOK; } /* Process line starts with space */ static int handle_space(struct parser_obj *po, uint32_t *action) { int error = EOK; int space_err = 0; TRACE_FLOW_ENTRY(); if (po->parse_flags & INI_PARSE_NOWRAP) { /* In this case an empty line is a comment. */ if (is_just_spaces(po->last_read, po->last_read_len)) { error = handle_comment(po, action); TRACE_FLOW_EXIT(); return error; } /* Wrapping is not allowed */ if (!is_allowed_spaces(po->last_read, po->last_read_len, po->parse_flags, &space_err)) { *action = PARSE_ERROR; po->last_error = space_err; error = EOK; } else { /* Allowed spaces will be trimmed * inside KVP processing. */ error = handle_kvp(po, action); } TRACE_FLOW_EXIT(); return error; } /* Do we have current value object? */ if (po->key) { /* This is a new line in a folded value */ error = value_add_to_arrays(po->last_read, po->last_read_len, po->raw_lines, po->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to add line to value", error); return error; } /* Do not free the line, it is now an element of the array */ po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; } else { /* Check if this is a completely empty line */ if (is_just_spaces(po->last_read, po->last_read_len)) { error = handle_comment(po, action); if (error) { TRACE_ERROR_NUMBER("Failed to process comment", error); return error; } } else { /* We do not have an active value * but have a line is starting with a space. * For now it is error. * We can change it in future if * people find it being too restrictive */ *action = PARSE_ERROR; po->last_error = ERR_SPACE; } } TRACE_FLOW_EXIT(); return EOK; } /* Parse and process section */ static int handle_section(struct parser_obj *po, uint32_t *action) { int error = EOK; char *start; char *end; char *dupval; uint32_t len; TRACE_FLOW_ENTRY(); /* We are safe to substract 1 * since we know that there is at * least one character on the line * based on the check above. */ end = po->last_read + po->last_read_len - 1; while (isspace(*end)) end--; if (*end != ']') { *action = PARSE_ERROR; po->last_error = ERR_NOCLOSESEC; return EOK; } /* Skip spaces at the beginning of the section name */ start = po->last_read + 1; while (isspace(*start)) start++; /* Check if there is a section name */ if (start == end) { *action = PARSE_ERROR; po->last_error = ERR_NOSECTION; return EOK; } /* Skip spaces at the end of the section name */ end--; while (isspace(*end)) end--; /* We got section name */ len = end - start + 1; if (len > MAX_KEY) { *action = PARSE_ERROR; po->last_error = ERR_SECTIONLONG; return EOK; } if (po->key) { /* Complete processing of the previous value */ error = complete_value_processing(po); if (error) { TRACE_ERROR_NUMBER("Failed to complete value processing", error); return error; } } /* Save section if we have one*/ error = parser_save_section(po); if (error) { TRACE_ERROR_NUMBER("Failed to save section", error); return error; } /* Dup the name */ dupval = malloc(len + 1); if (!dupval) { TRACE_ERROR_NUMBER("Failed to dup section name", ENOMEM); return ENOMEM; } memcpy(dupval, start, len); dupval[len] = '\0'; /* Create a new section */ error = col_create_collection(&po->sec, dupval, COL_CLASS_INI_SECTION); if (error) { TRACE_ERROR_NUMBER("Failed to create a section", error); free(dupval); return error; } /* But if there is just a comment then create a special key */ po->key_len = sizeof(INI_SECTION_KEY) - 1; po->key = strndup(INI_SECTION_KEY, sizeof(INI_SECTION_KEY)); /* Create new arrays */ error = value_create_arrays(&(po->raw_lines), &(po->raw_lengths)); if (error) { TRACE_ERROR_NUMBER("Failed to create arrays", error); free(dupval); return error; } /* Save a duplicated part in the value */ error = value_add_to_arrays(dupval, len, po->raw_lines, po->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to add value to the arrays", error); free(dupval); return error; } /* Save the line number of the last found key */ po->seclinenum = po->linenum; /* Complete processing of this value. * A new section will be created inside and a special * value will be added. */ error = complete_value_processing(po); if (error) { TRACE_ERROR_NUMBER("Failed to complete value processing", error); return error; } /* We are done dealing with section */ free(po->last_read); po->last_read = NULL; po->last_read_len = 0; *action = PARSE_READ; TRACE_FLOW_EXIT(); return EOK; } static int check_for_comment(char *buffer, uint32_t buffer_len, int allow_c_comments, int *inside_comment) { int pos; int is_comment = 0; TRACE_FLOW_ENTRY(); if (*inside_comment) { /* We are already inside the comment * and we are looking for the end of the comment */ if (buffer_len) { pos = buffer_len - 1; while(isspace(buffer[pos]) && pos > 0) pos--; /* Check for comment at the end of the line */ if ((pos > 1) && (buffer[pos] == '/') && (buffer[pos - 1] == '*')) { *inside_comment = 0; } } is_comment = 1; } else { /* We do not allow spaces in front of comments * so we expect the comment to start right away. */ if ((buffer[0] == '\0') || (buffer[0] == ';') || (buffer[0] == '#')) { is_comment = 1; } else if ((allow_c_comments) && (buffer_len > 1)) { if (buffer[0] == '/') { if (buffer[1] == '/') is_comment = 1; else if (buffer[1] == '*') { is_comment = 1; *inside_comment = 1; /* Here we need to check whether this comment ends * on this line or not */ pos = buffer_len - 1; while(isspace(buffer[pos]) && pos > 0) pos--; /* Check for comment at the end of the line * but make sure we have at least two asterisks */ if ((pos > 2) && (buffer[pos] == '/') && (buffer[pos - 1] == '*')) { *inside_comment = 0; } } } } } TRACE_FLOW_EXIT(); return is_comment; } /* Inspect the line */ static int parser_inspect(struct parser_obj *po) { int error = EOK; uint32_t action = PARSE_DONE; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Buffer:", po->last_read); TRACE_INFO_NUMBER("In comment:", po->inside_comment); if (check_for_comment(po->last_read, po->last_read_len, !(po->parse_flags & INI_PARSE_NO_C_COMMENTS), &(po->inside_comment))) { error = handle_comment(po, &action); if (error) { TRACE_ERROR_NUMBER("Failed to process comment", error); return error; } } else if (isspace(*(po->last_read))) { error = handle_space(po, &action); if (error) { TRACE_ERROR_NUMBER("Failed to process line wrapping", error); return error; } } else if (*(po->last_read) == '[') { error = handle_section(po, &action); if (error) { TRACE_ERROR_NUMBER("Failed to save section", error); return error; } } else { error = handle_kvp(po, &action); if (error) { TRACE_ERROR_NUMBER("Failed to save kvp", error); return error; } } /* Move to the next action */ error = col_enqueue_unsigned_property(po->queue, PARSE_ACTION, action); if (error) { TRACE_ERROR_NUMBER("Failed to schedule an action", error); return error; } TRACE_FLOW_EXIT(); return error; } /* Complete file processing */ static int parser_post(struct parser_obj *po) { int error = EOK; TRACE_FLOW_ENTRY(); /* If there was just a comment at the bottom * put it directly into the config object */ if((po->ic) && (!(po->key))) { if (po->co->last_comment) { error = ini_comment_add(po->ic, po->co->last_comment); if (error) { TRACE_ERROR_NUMBER("Failed to merge comment", error); return error; } } else { error = ini_comment_copy(po->ic, &(po->co->last_comment)); if (error) { TRACE_ERROR_NUMBER("Failed to copy comment", error); return error; } } ini_comment_destroy(po->ic); po->ic = NULL; } /* If there is a key being processed add it */ if (po->key) { error = complete_value_processing(po); if (error) { TRACE_ERROR_NUMBER("Failed to complete value processing", error); return error; } } /* If we are done save the section */ error = parser_save_section(po); if (error) { TRACE_ERROR_NUMBER("Failed to save section", error); return error; } /* Move to the next action */ error = col_enqueue_unsigned_property(po->queue, PARSE_ACTION, PARSE_DONE); if (error) { TRACE_ERROR_NUMBER("Failed to schedule an action", error); return error; } TRACE_FLOW_EXIT(); return EOK; } static int save_error(struct collection_item *el, unsigned line, int inerr, const char *err_txt) { int error = EOK; struct ini_parse_error pe; TRACE_FLOW_ENTRY(); /* Clear the warning bit */ pe.error = inerr; pe.line = line; error = col_add_binary_property(el, NULL, err_txt, &pe, sizeof(pe)); TRACE_FLOW_RETURN(error); return error; } /* Error and warning processing */ static int parser_error(struct parser_obj *po) { int error = EOK; uint32_t action; const char *err_str; TRACE_FLOW_ENTRY(); if (po->last_error & INI_WARNING) err_str = WARNING_TXT; else err_str = ERROR_TXT; error = save_error(po->el, po->linenum, po->last_error & ~INI_WARNING, err_str); if (error) { TRACE_ERROR_NUMBER("Failed to add error to error list", error); return error; } if (po->last_error == ERR_BADCOMMENT) { /* Avoid endless loop */ action = PARSE_DONE; po->ret = EIO; } else if (po->error_level == INI_STOP_ON_ANY) { action = PARSE_DONE; if (po->last_error & INI_WARNING) po->ret = EILSEQ; else po->ret = EIO; } else if (po->error_level == INI_STOP_ON_NONE) { if (po->last_error != ERR_READ) { action = PARSE_READ; if (po->ret == 0) { if (po->last_error & INI_WARNING) po->ret = EILSEQ; else po->ret = EIO; } /* It it was warning but now if it is an error * bump to return code to indicate error. */ else if((po->ret == EILSEQ) && (!(po->last_error & INI_WARNING))) po->ret = EIO; } else { /* Avoid endless loop */ action = PARSE_DONE; po->ret = EIO; } } else { /* Stop on error */ if (po->last_error & INI_WARNING) { action = PARSE_READ; po->ret = EILSEQ; } else { action = PARSE_DONE; po->ret = EIO; } } /* Prepare for reading */ if (action == PARSE_READ) { if (po->last_read) { free(po->last_read); po->last_read = NULL; po->last_read_len = 0; } } else { /* If we are done save the section */ error = parser_save_section(po); if (error) { TRACE_ERROR_NUMBER("Failed to save section", error); /* If merging sections should produce error and we got error * or if we merge sections but dup values produce error and * we got error then it is not a fatal error so we need to handle * it nicely and suppress it here. We already in the procees * of handling another error and merge error does not matter here. * We check for reverse condition and return error, * otherwise fall through. */ if (!(((ini_flags_have(INI_MS_ERROR, po->collision_flags)) && (error == EEXIST)) || (ini_flags_have(INI_MS_ERROR, po->collision_flags) && ((po->collision_flags & INI_MV2S_MASK) == INI_MV2S_ERROR) && (error == EEXIST)))) { return error; } } } /* Move to the next action */ error = col_enqueue_unsigned_property(po->queue, PARSE_ACTION, action); if (error) { TRACE_ERROR_NUMBER("Failed to schedule an action", error); return error; } TRACE_FLOW_EXIT(); return EOK; } /* Run parser */ static int parser_run(struct parser_obj *po) { int error = EOK; struct collection_item *item = NULL; uint32_t action = 0; action_fn operations[] = { parser_read, parser_inspect, parser_post, parser_error, NULL }; TRACE_FLOW_ENTRY(); while(1) { /* Get next action */ item = NULL; error = col_dequeue_item(po->queue, &item); if (error) { TRACE_ERROR_NUMBER("Failed to get action", error); return error; } /* Get action, run operation */ action = *((uint32_t *)(col_get_item_data(item))); col_delete_item(item); if (action == PARSE_DONE) { TRACE_INFO_NUMBER("We are done", error); /* Report merge error in detect mode * if no other error was detected. */ if ((po->ret == 0) && (po->merge_error != 0) && ((po->collision_flags & INI_MV1S_DETECT) || (po->collision_flags & INI_MV2S_DETECT) || (po->collision_flags & INI_MS_DETECT))) po->ret = po->merge_error; error = po->ret; break; } error = operations[action](po); if (error) { TRACE_ERROR_NUMBER("Failed to perform an action", error); return error; } } TRACE_FLOW_EXIT(); return error; } /* Top level wrapper around the parser */ int ini_config_parse(struct ini_cfgfile *file_ctx, int error_level, uint32_t collision_flags, uint32_t parse_flags, struct ini_cfgobj *ini_config) { int error = EOK; struct parser_obj *po = NULL; uint32_t fl1, fl2, fl3; TRACE_FLOW_ENTRY(); if ((!ini_config) || (!(ini_config->cfg))) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } if (!file_ctx) { TRACE_ERROR_NUMBER("Invalid file context", EINVAL); return EINVAL; } if (!valid_collision_flags(collision_flags)) { TRACE_ERROR_NUMBER("Invalid flags.", EINVAL); return EINVAL; } if ((error_level != INI_STOP_ON_ANY) && (error_level != INI_STOP_ON_NONE) && (error_level != INI_STOP_ON_ERROR)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } error = parser_create(ini_config, file_ctx->file, file_ctx->filename, error_level, collision_flags, parse_flags, &po); if (error) { TRACE_ERROR_NUMBER("Failed to perform an action", error); return error; } error = parser_run(po); if (error) { fl1 = collision_flags & INI_MS_MODE_MASK; fl2 = collision_flags & INI_MV1S_MASK; fl3 = collision_flags & INI_MV2S_MASK; if ((error == EEXIST) && ((ini_flags_have(INI_MS_DETECT, collision_flags) && (fl1 != INI_MS_ERROR) && (fl2 != INI_MV1S_ERROR) && (fl3 != INI_MV2S_ERROR)) || ((fl2 == INI_MV1S_DETECT) && (fl1 != INI_MS_ERROR) && (fl3 != INI_MV2S_ERROR)) || ((fl3 == INI_MV2S_DETECT) && (fl1 != INI_MS_ERROR) && (fl2 != INI_MV1S_ERROR)))) { TRACE_ERROR_NUMBER("No error in detect mode", error); /* Fall through */ } else { TRACE_ERROR_NUMBER("Failed to parse file", error); TRACE_ERROR_NUMBER("Mode", collision_flags); col_get_collection_count(ini_config->error_list, &(ini_config->count)); if(ini_config->count) (ini_config->count)--; parser_destroy(po); return error; } } /* If should be empty anyways */ col_destroy_collection_with_cb(ini_config->cfg, ini_cleanup_cb, NULL); ini_config->cfg = po->top; po->top = NULL; parser_destroy(po); TRACE_FLOW_EXIT(); return error; } ding-libs-0.6.2/ini/ini_parse_ut.c000066400000000000000000003036441417260640400170110ustar00rootroot00000000000000/* INI LIBRARY Unit test for the parser object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #include "ini_defines.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "simplebuffer.h" #include "path_utils.h" #define TRACE_HOME #include "trace.h" #include "collection_tools.h" int verbose = 0; char *confdir = NULL; #define NUM_TESTS 14 #define VAL_SIZE 100 #define INIOUT(foo) \ do { \ if (verbose) foo; \ } while(0) typedef int (*test_fn)(void); static int test_one_file(const char *in_filename, const char *out_filename, int edge, int in_mem) { int error = EOK; struct ini_cfgfile *file_ctx = NULL; FILE *ff = NULL; struct ini_cfgobj *ini_config = NULL; struct ini_cfgobj *ini_copy = NULL; char **error_list = NULL; struct simplebuffer *sbobj = NULL; uint32_t left = 0; uint32_t stream_len = 0; void *stream_data = NULL; struct stat file_stats; int stat_ret = 0; FILE *file = NULL; INIOUT(printf("<==== Testing file %s ====>\n", in_filename)); /* Create config collection */ error = ini_config_create(&ini_config); if (error) { printf("Failed to create collection. Error %d.\n", error); return error; } if (in_mem) { /* Get file stats */ errno = 0; stat_ret = stat(in_filename, &file_stats); if (stat_ret == -1) { error = errno; printf("Failed to get file stats. Error %d.\n", error); ini_config_destroy(ini_config); return error; } /* Allocate memory to store file */ errno = 0; stream_len = file_stats.st_size; stream_data = malloc(file_stats.st_size + 1); if (!stream_data) { error = errno; printf("Failed to allocate memory for stream. Error %d.\n", error); ini_config_destroy(ini_config); return error; } *((unsigned char *)(stream_data) + stream_len) = '\0'; /* Open file */ errno = 0; file = fopen(in_filename, "r"); if (!stream_data) { error = errno; printf("Failed to open file to prepare stream. Error %d.\n", error); free(stream_data); ini_config_destroy(ini_config); return error; } /* Read file into memory */ errno = 0; fread(stream_data, stream_len, 1, file); error = ferror(file); if (error) { printf("Failed to read stream data. Error %d.\n", error); free(stream_data); fclose(file); ini_config_destroy(ini_config); return error; } fclose(file); INIOUT(printf("Data len %u\n", stream_len)); INIOUT(printf("Data:\n%s\n", (char *)stream_data)); error = ini_config_file_from_mem(stream_data, stream_len, &file_ctx); if (error) { printf("Failed to open from memory. Error %d.\n", error); free(stream_data); ini_config_destroy(ini_config); return error; } } else { error = ini_config_file_open(in_filename, 0, /* TBD */ &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", in_filename, error); ini_config_destroy(ini_config); return error; } } error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, /* TBD */ 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); if (ini_config_error_count(ini_config)) { if (in_mem) { INIOUT(printf("Errors detected while parsing" " configuration stored in memory: %s\n", in_filename)); } else { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); } ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } /* If we are testing memory mapped, return error */ if (in_mem) { free(stream_data); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } } if (in_mem) free(stream_data); ini_config_file_destroy(file_ctx); INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); /* Copy configuration */ error = ini_config_copy(ini_config, &ini_copy); if (error) { printf("Failed to copy configuration. Error %d.\n", error); ini_config_destroy(ini_config); return error; } ini_config_destroy(ini_config); ini_config = ini_copy; INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); error = ini_config_set_wrap(ini_config, edge); if (error) { printf("Failed to set custom wrapper. Error %d.\n", error); ini_config_destroy(ini_config); return error; } error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); ini_config_destroy(ini_config); return error; } error = ini_config_serialize(ini_config, sbobj); if (error != EOK) { printf("Failed to serialize configuration. Error %d.\n", error); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } errno = 0; ff = fopen(out_filename, "w"); if(!ff) { error = errno; printf("Failed to open file [%s] for writing. Error %d.\n", out_filename, error); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(ff), sbobj, &left); if (error) { printf("Failed to write back the configuration %d.\n", error); simplebuffer_free(sbobj); ini_config_destroy(ini_config); fclose(ff); return error; } } ini_config_destroy(ini_config); simplebuffer_free(sbobj); fclose(ff); return EOK; } /* Run tests for multiple files */ static int read_save_test(void) { int error = EOK; int i = 0; int edge = 5; char infile[PATH_MAX]; char outfile[PATH_MAX]; char *srcdir = NULL; const char *files[] = { "real", "mysssd", "ipa", "test", "smerge", "real8", "real16be", "real16le", "real32be", "real32le", "symbols", NULL }; INIOUT(printf("<==== Read save test ====>\n")); srcdir = getenv("srcdir"); while(files[i]) { for ( edge = 10; edge < 100; edge +=19) { snprintf(infile, PATH_MAX, "%s/ini/ini.d/%s.conf", (srcdir == NULL) ? "." : srcdir, files[i]); snprintf(outfile, PATH_MAX, "./%s_%d.conf.out", files[i], edge); error = test_one_file(infile, outfile, edge, 0); INIOUT(printf("Test for file: %s returned %d\n", files[i], error)); if (error) return error; } i++; } INIOUT(printf("<==== Read save test end ====>\n")); return EOK; } /* Run tests for multiple files */ static int read_mem_test(void) { int error = EOK; int i = 0; int edge = 5; char infile[PATH_MAX]; char outfile[PATH_MAX]; char *srcdir = NULL; const char *files[] = { "real", "mysssd", "ipa", "test", "smerge", "real8", "real16be", "real16le", "real32be", "real32le", "symbols", "new_line", NULL }; INIOUT(printf("<==== Read mem test ====>\n")); srcdir = getenv("srcdir"); while(files[i]) { for ( edge = 15; edge < 100; edge +=25) { snprintf(infile, PATH_MAX, "%s/ini/ini.d/%s.conf", (srcdir == NULL) ? "." : srcdir, files[i]); snprintf(outfile, PATH_MAX, "./%s_%d.conf.mem.out", files[i], edge); error = test_one_file(infile, outfile, edge, 1); INIOUT(printf("Test for file: %s returned %d\n", files[i], error)); if ((error) && (strncmp(files[i], "test", 4) != 0)) return error; } i++; } INIOUT(printf("<==== Read mem test end ====>\n")); return EOK; } /* Run tests for multiple files */ static int read_again_test(void) { int error = EOK; int i = 0; int edge = 5; char infile[PATH_MAX]; char outfile[PATH_MAX]; char command[PATH_MAX * 3]; const char *files[] = { "real", "mysssd", "ipa", "test", "smerge", "real8", "real16be", "real16le", "real32be", "real32le", "symbols", NULL }; INIOUT(printf("<==== Read again test ====>\n")); while(files[i]) { for ( edge = 10; edge < 100; edge +=19) { snprintf(infile, PATH_MAX, "./%s_%d.conf.out", files[i], edge); snprintf(outfile, PATH_MAX, "./%s_%d.conf.2.out", files[i], edge); error = test_one_file(infile, outfile, edge, 0); INIOUT(printf("Test for file: %s returned %d\n", files[i], error)); if (error) break; snprintf(command, PATH_MAX * 3, "diff -q %s %s", infile, outfile); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", infile, outfile, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run copy command %d %d.\n", error, WEXITSTATUS(error)); error = -1; break; } } i++; } INIOUT(printf("<==== Read again test end ====>\n")); return error; } static int create_expect(const char *checkname) { FILE *ff; int error = EOK; errno = 0; ff = fopen(checkname, "w"); if(!ff) { error = errno; printf("Failed to open file %s for writing. Error %d.\n", checkname, error); return error; } /* Ovewrite */ fprintf(ff,"#Hoho section\n"); fprintf(ff,"[hoho]\n"); fprintf(ff,"#Hoho value\n"); fprintf(ff,"val = hoho\n"); fprintf(ff,"#End of hoho\n"); fprintf(ff,"#Start of section\n"); fprintf(ff,"[foo]\n"); fprintf(ff,"#Second value\n"); fprintf(ff,"bar = second value\n"); fprintf(ff,"#End of section\n"); /* Preserve */ fprintf(ff,"#Hoho section\n"); fprintf(ff,"[hoho]\n"); fprintf(ff,"#Hoho value\n"); fprintf(ff,"val = hoho\n"); fprintf(ff,"#End of hoho\n"); fprintf(ff,"#Start of section\n"); fprintf(ff,"[foo]\n"); fprintf(ff,"#First value\n"); fprintf(ff,"bar = first value\n"); fprintf(ff,"#End of section\n"); /* Allow */ fprintf(ff,"#Hoho section\n"); fprintf(ff,"[hoho]\n"); fprintf(ff,"#Hoho value\n"); fprintf(ff,"val = hoho\n"); fprintf(ff,"#End of hoho\n"); fprintf(ff,"#Start of section\n"); fprintf(ff,"[foo]\n"); fprintf(ff,"#First value\n"); fprintf(ff,"bar = first value\n"); fprintf(ff,"#Second value\n"); fprintf(ff,"bar = second value\n"); fprintf(ff,"#End of section\n"); /* Detect */ fprintf(ff,"#Hoho section\n"); fprintf(ff,"[hoho]\n"); fprintf(ff,"#Hoho value\n"); fprintf(ff,"val = hoho\n"); fprintf(ff,"#End of hoho\n"); fprintf(ff,"#Start of section\n"); fprintf(ff,"[foo]\n"); fprintf(ff,"#First value\n"); fprintf(ff,"bar = first value\n"); fprintf(ff,"#Second value\n"); fprintf(ff,"bar = second value\n"); fprintf(ff,"#End of section\n"); fclose(ff); return EOK; } /* Check merge modes */ static int merge_values_test(void) { int error = EOK; int i; struct ini_cfgfile *file_ctx = NULL; FILE *ff = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; struct simplebuffer *sbobj = NULL; uint32_t left = 0; uint32_t mflags[] = { INI_MV1S_OVERWRITE, INI_MV1S_ERROR, INI_MV1S_PRESERVE, INI_MV1S_ALLOW, INI_MV1S_DETECT }; const char *mstr[] = { "OVERWRITE", "ERROR", "PRESERVE", "ALLOW", "DETECT" }; char filename[PATH_MAX]; const char *resname = "./merge.conf.out"; const char *checkname = "./expect.conf.out"; char command[PATH_MAX * 3]; char *srcdir = NULL; INIOUT(printf("<==== Merge values test ====>\n")); srcdir = getenv("srcdir"); snprintf(filename, PATH_MAX, "%s/ini/ini.d/foo.conf.in", (srcdir == NULL) ? "." : srcdir); error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } for (i = 0; i < 5; i++) { INIOUT(printf("<==== Testing mode %s ====>\n", mstr[i])); /* Create config collection */ ini_config = NULL; error = ini_config_create(&ini_config); if (error) { printf("Failed to create collection. Error %d.\n", error); simplebuffer_free(sbobj); return error; } file_ctx = NULL; error = ini_config_file_open(filename, 0, /* TBD */ &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", filename, error); printf("Src dir is [%s].\n", (srcdir == NULL) ? "NOT DEFINED" : srcdir); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } error = ini_config_parse(file_ctx, INI_STOP_ON_ANY, mflags[i], 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } if (((mflags[i] != INI_MV1S_ERROR) && (mflags[i]!= INI_MV1S_DETECT)) || ((mflags[i] = INI_MV1S_ERROR) && (error != EEXIST)) || ((mflags[i] = INI_MV1S_DETECT) && (error != EEXIST))) { printf("This is unexpected error %d in mode %d\n", error, mflags[i]); ini_config_destroy(ini_config); simplebuffer_free(sbobj); ini_config_file_destroy(file_ctx); return error; } /* We do not return here intentionally */ } ini_config_file_destroy(file_ctx); INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); error = ini_config_serialize(ini_config, sbobj); if (error != EOK) { printf("Failed to serialize configuration. Error %d.\n", error); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } ini_config_destroy(ini_config); } errno = 0; ff = fopen(resname, "w"); if(!ff) { error = errno; printf("Failed to open file for writing. Error %d.\n", error); simplebuffer_free(sbobj); return error; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(ff), sbobj, &left); if (error) { printf("Failed to write back the configuration %d.\n", error); simplebuffer_free(sbobj); fclose(ff); return error; } } simplebuffer_free(sbobj); fclose(ff); error = create_expect(checkname); if (error) { printf("Failed to create file with expected contents %d.\n", error); return error; } snprintf(command, PATH_MAX * 3, "diff -q %s %s", resname, checkname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", resname, checkname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run copy command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("<==== Merge values test end ====>\n")); return error; } /* Check merge modes */ static int merge_section_test(void) { int error = EOK; int i, j; struct ini_cfgfile *file_ctx = NULL; FILE *ff = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; struct simplebuffer *sbobj = NULL; uint32_t left = 0; uint32_t msecflags[] = { INI_MS_MERGE, INI_MS_ERROR, INI_MS_OVERWRITE, INI_MS_PRESERVE, INI_MS_DETECT }; uint32_t mflags[] = { INI_MV2S_OVERWRITE, INI_MV2S_ERROR, INI_MV2S_PRESERVE, INI_MV2S_ALLOW, INI_MV2S_DETECT }; const char *secmstr[] = { "MERGE", "ERROR", "OVERWRITE", "PRESERVE", "DETECT" }; const char *mstr[] = { "OVERWRITE", "ERROR", "PRESERVE", "ALLOW", "DETECT" }; char filename[PATH_MAX]; char checkname[PATH_MAX]; char resname[PATH_MAX]; char command[PATH_MAX * 3]; char mode[VAL_SIZE]; char *srcdir = NULL; char *builddir = NULL; INIOUT(printf("<==== Merge section test ====>\n")); srcdir = getenv("srcdir"); builddir = getenv("builddir"); snprintf(filename, PATH_MAX, "%s/ini/ini.d/smerge.conf", (srcdir == NULL) ? "." : srcdir); snprintf(checkname, PATH_MAX, "%s/ini/ini.d/sexpect.conf", (srcdir == NULL) ? "." : srcdir); snprintf(resname, PATH_MAX, "%s/smerge.conf.out", (builddir == NULL) ? "." : builddir); error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } for (i = 0; i < 5; i++) { for (j = 0; j < 5; j++) { INIOUT(printf("<==== Testing mode %s + %s ====>\n", secmstr[i], mstr[j])); snprintf(mode, VAL_SIZE, "# Section mode: %s, value mode: %s\n", secmstr[i], mstr[j]); error = simplebuffer_add_str(sbobj, mode, strlen(mode), VAL_SIZE); if (error) { TRACE_ERROR_NUMBER("Failed to add string.", error); simplebuffer_free(sbobj); return error; } /* Create config collection */ ini_config = NULL; error = ini_config_create(&ini_config); if (error) { printf("Failed to create collection. " "Error %d.\n", error); simplebuffer_free(sbobj); return error; } file_ctx = NULL; error = ini_config_file_open(filename, 0, /* TBD */ &file_ctx); if (error) { printf("Failed to open file %s for reading. " "Error %d.\n", filename, error); printf("Source is %s.\n", (srcdir == NULL) ? "NOT Defined" : srcdir); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } error = ini_config_parse(file_ctx, INI_STOP_ON_ANY, msecflags[i] | mflags[j], 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. " "Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } if (((msecflags[i] == INI_MS_ERROR) && (error == EEXIST)) || ((msecflags[i] == INI_MS_DETECT) && (error == EEXIST)) || ((msecflags[i] == INI_MS_MERGE) && ((mflags[j] == INI_MV2S_ERROR) || (mflags[j] == INI_MV2S_DETECT)) && (error == EEXIST))) { INIOUT(printf("This is an expected error " "%d in mode %d + %d\n", error, msecflags[i], mflags[j])); /* We do not return here intentionally */ } else { printf("This is unexpected error %d in mode %d + %d\n", error, msecflags[i], mflags[j]); ini_config_destroy(ini_config); simplebuffer_free(sbobj); ini_config_file_destroy(file_ctx); return error; } } ini_config_file_destroy(file_ctx); INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); error = ini_config_serialize(ini_config, sbobj); if (error != EOK) { printf("Failed to serialize configuration. " "Error %d.\n", error); ini_config_destroy(ini_config); simplebuffer_free(sbobj); return error; } ini_config_destroy(ini_config); } } errno = 0; ff = fopen(resname, "w"); if(!ff) { error = errno; printf("Failed to open file for writing. Error %d.\n", error); simplebuffer_free(sbobj); return error; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(ff), sbobj, &left); if (error) { printf("Failed to write back the configuration %d.\n", error); simplebuffer_free(sbobj); fclose(ff); return error; } } simplebuffer_free(sbobj); fclose(ff); snprintf(command, PATH_MAX * 3, "diff -q %s %s", resname, checkname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", resname, checkname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run diff command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("<==== Merge section test end ====>\n")); return error; } static int read_one_file(char *name, struct ini_cfgobj *ini_config, uint32_t collision_flags) { int error = EOK; struct ini_cfgfile *file_ctx = NULL; char **error_list = NULL; INIOUT(printf("Reading file %s\n", name)); file_ctx = NULL; error = ini_config_file_open(name, 0, &file_ctx); if (error) { printf("Failed to open file %s for reading. " "Error %d.\n", name, error); return error; } INIOUT(printf("Parsing file %s\n", name)); error = ini_config_parse(file_ctx, INI_STOP_ON_ANY, collision_flags, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. " "Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } ini_config_file_destroy(file_ctx); return error; } ini_config_file_destroy(file_ctx); INIOUT(printf("Successfully parsed file %s\n", name)); return EOK; } /* Check merge modes */ static int merge_file_test(void) { int error = EOK; int i, j; struct ini_cfgobj *ini_config_first = NULL; struct ini_cfgobj *ini_config_second = NULL; struct ini_cfgobj *ini_config_result = NULL; struct simplebuffer *sbobj = NULL; uint32_t left = 0; FILE *ff = NULL; uint32_t msecflags[] = { INI_MS_MERGE, INI_MS_ERROR, INI_MS_OVERWRITE, INI_MS_PRESERVE, INI_MS_DETECT }; uint32_t m2flags[] = { INI_MV2S_OVERWRITE, INI_MV2S_ERROR, INI_MV2S_PRESERVE, INI_MV2S_ALLOW, INI_MV2S_DETECT }; uint32_t m1flags[] = { INI_MV1S_OVERWRITE, INI_MV1S_ERROR, INI_MV1S_PRESERVE, INI_MV1S_ALLOW, INI_MV1S_DETECT }; const char *secmstr[] = { "MERGE", "ERROR", "OVERWRITE", "PRESERVE", "DETECT" }; const char *mstr[] = { "OVERWRITE", "ERROR", "PRESERVE", "ALLOW", "DETECT" }; char firstname[PATH_MAX]; char secondname[PATH_MAX]; char resname[PATH_MAX]; char checkname[PATH_MAX]; char command[PATH_MAX * 3]; char msg[VAL_SIZE]; char mode[VAL_SIZE]; char *srcdir = NULL; char *builddir = NULL; uint32_t collision_flags; uint32_t ms_subst; uint32_t mv1s_subst; uint32_t mv2s_subst; INIOUT(printf("<==== Merge file test ====>\n")); srcdir = getenv("srcdir"); builddir = getenv("builddir"); snprintf(firstname, PATH_MAX, "%s/ini/ini.d/first.conf", (srcdir == NULL) ? "." : srcdir); snprintf(secondname, PATH_MAX, "%s/ini/ini.d/second.conf", (srcdir == NULL) ? "." : srcdir); snprintf(checkname, PATH_MAX, "%s/ini/ini.d/mergecheck.conf", (srcdir == NULL) ? "." : srcdir); snprintf(resname, PATH_MAX, "%s/mergecheck.conf.out", (builddir == NULL) ? "." : builddir); error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } for (i = 0; i < 5; i++) { for (j = 0; j < 5; j++) { INIOUT(printf("<==== Testing mode %s + %s ====>\n", secmstr[i], mstr[j])); snprintf(mode, VAL_SIZE, "# Section mode: %s, value mode: %s\n", secmstr[i], mstr[j]); error = simplebuffer_add_str(sbobj, mode, strlen(mode), VAL_SIZE); if (error) { TRACE_ERROR_NUMBER("Failed to add string.", error); simplebuffer_free(sbobj); return error; } /* Create first config collection */ ini_config_first = NULL; error = ini_config_create(&ini_config_first); if (error) { printf("Failed to create collection. " "Error %d.\n", error); simplebuffer_free(sbobj); return error; } /* Create second config collection */ ini_config_second = NULL; error = ini_config_create(&ini_config_second); if (error) { printf("Failed to create collection. " "Error %d.\n", error); ini_config_destroy(ini_config_first); simplebuffer_free(sbobj); return error; } /* IMPORTANT: Use same collision flags for reading * of the files and then merging. * Mixing the flags would lead to strange results * that would be hard to debug. */ /* However here for purely testing purposes * we will not use error modes in parsing * otherwise we will not be able to try to merge. * Instead we replace the error and detect modes * with allow or merge mode. */ /* The test actually does not fail in the case of * PRESERVE + ERROR becuase it should fail at * the stage of reading file but we suppress * it so we can try the merge. * As a result the mode PRESERVE + ERROR * acts as PRESERVE + ALLOW and does not return an error. * The same thing happens with PRESERVE + DETECT mode. * It might be confusing if someone tries to decipher * the tests, so this comment should help. */ if ((msecflags[i] == INI_MS_ERROR) || (msecflags[i] == INI_MS_DETECT)) { ms_subst = msecflags[i]; } else { ms_subst = INI_MS_MERGE; } if ((m2flags[j] == INI_MV2S_ERROR) || (m2flags[j] == INI_MV2S_DETECT)) { mv1s_subst = INI_MV1S_ALLOW; mv2s_subst = INI_MV2S_ALLOW; } else { mv1s_subst = m1flags[j]; mv2s_subst = m2flags[j]; } collision_flags = mv1s_subst | mv2s_subst | ms_subst; error = read_one_file(firstname, ini_config_first, collision_flags); if (error) { printf("Failed to read %s. " "Error %d.\n", firstname, error); printf("Source is %s.\n", (srcdir == NULL) ? "NOT Defined" : srcdir); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); simplebuffer_free(sbobj); return error; } error = read_one_file(secondname, ini_config_second, collision_flags); if (error) { printf("Failed to read %s. " "Error %d.\n", secondname, error); printf("Source is %s.\n", (srcdir == NULL) ? "NOT Defined" : srcdir); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); simplebuffer_free(sbobj); return error; } INIOUT(col_debug_collection(ini_config_first->cfg, COL_TRAVERSE_ONELEVEL)); INIOUT(col_debug_collection(ini_config_second->cfg, COL_TRAVERSE_ONELEVEL)); ini_config_result = NULL; error = ini_config_merge(ini_config_first, ini_config_second, msecflags[i] | m2flags[j] | m1flags[j], &ini_config_result); if (error) { if ((error == EEXIST) && ((msecflags[i] == INI_MS_ERROR) || (m2flags[j] == INI_MV2S_ERROR))) { snprintf(msg, sizeof(msg) -1, "# This is an expected error " "%d in mode %d + %d + %d\n\n", error, msecflags[i], m2flags[j], m1flags[j]); INIOUT(printf("%s", msg)); error = simplebuffer_add_str(sbobj, msg, strlen(msg), VAL_SIZE); if (error) { TRACE_ERROR_NUMBER("Failed to add string.", error); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); simplebuffer_free(sbobj); return error; } ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); continue; } else if ((error == EEXIST) && ((msecflags[i] == INI_MS_DETECT) || ((msecflags[i] != INI_MS_ERROR) && (m2flags[j] == INI_MV2S_DETECT)))) { snprintf(msg, sizeof(msg) -1, "# This is an expected error " "%d in mode %d + %d + %d\n\n", error, msecflags[i], m2flags[j], m1flags[j]); INIOUT(printf("%s", msg)); error = simplebuffer_add_str(sbobj, msg, strlen(msg), VAL_SIZE); if (error) { TRACE_ERROR_NUMBER("Failed to add string.", error); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); simplebuffer_free(sbobj); return error; } /* Falling throught here */ } else { TRACE_ERROR_NUMBER("Failed to merge.", error); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); simplebuffer_free(sbobj); return error; } } INIOUT(col_debug_collection(ini_config_result->cfg, COL_TRAVERSE_DEFAULT)); error = ini_config_serialize(ini_config_result, sbobj); if (error) { printf("Failed to serialize configuration. " "Error %d.\n", error); ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); ini_config_destroy(ini_config_result); simplebuffer_free(sbobj); return error; } ini_config_destroy(ini_config_first); ini_config_destroy(ini_config_second); ini_config_destroy(ini_config_result); } } errno = 0; ff = fopen(resname, "w"); if(!ff) { error = errno; printf("Failed to open file for writing. Error %d.\n", error); simplebuffer_free(sbobj); return error; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(ff), sbobj, &left); if (error) { printf("Failed to write back the configuration %d.\n", error); simplebuffer_free(sbobj); fclose(ff); return error; } } simplebuffer_free(sbobj); fclose(ff); snprintf(command,PATH_MAX * 3, "diff -q %s %s", resname, checkname); error = system(command); INIOUT(printf("Comparison of %s %s returned: %d\n", resname, checkname, error)); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run diff command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("<==== Merge section file end ====>\n")); return EOK; } static int startup_test(void) { int error = EOK; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; char infile[PATH_MAX]; char outfile[PATH_MAX]; char command[PATH_MAX * 3]; char *srcdir = NULL; char *builddir; const struct stat *file_stat; INIOUT(printf("<==== Startup test ====>\n")); srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/foo.conf.in", (srcdir == NULL) ? "." : srcdir); builddir = getenv("builddir"); snprintf(outfile, PATH_MAX, "%s/foo.conf", (builddir == NULL) ? "." : builddir); snprintf(command, PATH_MAX * 3, "cp %s %s", infile, outfile); INIOUT(printf("Running command '%s'\n", command)); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run copy command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("Running chmod 660 on file '%s'\n", outfile)); error = chmod(outfile, S_IRUSR | S_IWUSR); if(error) { error = errno; printf("Failed to run chmod command %d.\n", error); return error; } /* Open config file not collecting stats */ error = ini_config_file_open(outfile, 0, &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", outfile, error); return error; } file_stat = ini_config_get_stat(file_ctx); if (file_stat) { printf("Expected NULL got not NULL!\n"); return EINVAL; } /* We will check just permissions here. */ error = ini_config_access_check(file_ctx, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0440, /* Checking for r--r----- */ 0); /* This check is expected to fail since * we did not collect stats */ ini_config_file_destroy(file_ctx); if (!error) { printf("Expected error got success!\n"); return EACCES; } /* Open config file */ error = ini_config_file_open(outfile, INI_META_STATS, &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", outfile, error); return error; } /* Get stats */ file_stat = ini_config_get_stat(file_ctx); if (!file_stat) { printf("Expected not NULL got NULL!\n"); return EINVAL; } INIOUT(printf("File was modified at: %d seconds since Jan 1 1970.\n", (int)(file_stat->st_mtime))); /* We will check just permissions here. */ error = ini_config_access_check(file_ctx, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0440, /* Checking for r--r----- */ 0); /* This check is expected to fail since * the actual permissions on the test file are: rw------- */ if (!error) { printf("Expected error got success!\n"); ini_config_file_destroy(file_ctx); return EACCES; } error = ini_config_access_check( file_ctx, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0600, /* Checkling for rw------- */ 0); if (error) { printf("Access check failed %d!\n", error); ini_config_file_destroy(file_ctx); return EACCES; } /* Create config object */ error = ini_config_create(&ini_config); if (error) { printf("Failed to create collection. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } /* We do not return here intentionally */ } ini_config_file_destroy(file_ctx); INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); ini_config_destroy(ini_config); INIOUT(printf("<==== Startup test end ====>\n")); return 0; } static int reload_test(void) { int error = EOK; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgfile *file_ctx_new = NULL; char infile[PATH_MAX]; char outfile[PATH_MAX]; char command[PATH_MAX * 3]; char *srcdir; char *builddir; int changed = 0; INIOUT(printf("<==== Reload test ====>\n")); srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/foo.conf.in", (srcdir == NULL) ? "." : srcdir); builddir = getenv("builddir"); snprintf(outfile, PATH_MAX, "%s/foo.conf", (builddir == NULL) ? "." : builddir); snprintf(command, PATH_MAX * 3, "cp %s %s", infile, outfile); INIOUT(printf("Running command '%s'\n", command)); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run copy command %d %d.\n", error, WEXITSTATUS(error)); return -1; } INIOUT(printf("Running chmod 660 on file '%s'\n", outfile)); error = chmod(outfile, S_IRUSR | S_IWUSR); if (error) { error = errno; printf("Failed to run chmod command %d.\n", error); return error; } INIOUT(printf("About to open file: %s'\n", outfile)); /* Open config file */ error = ini_config_file_open(outfile, INI_META_STATS, &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", outfile, error); return error; } INIOUT(printf("About to check access to the file.\n")); error = ini_config_access_check( file_ctx, INI_ACCESS_CHECK_MODE, /* add uid & gui flags * in real case */ 0, /* <- will be real uid in real case */ 0, /* <- will be real gid in real case */ 0600, /* Checkling for rw------- */ 0); if (error) { printf("Access check failed %d!\n", error); ini_config_file_destroy(file_ctx); return EACCES; } /* ... Create config object and read configuration - not shown here. * See other examples ... */ INIOUT(printf("About to close file.\n")); /* Now close file but leave the context around */ ini_config_file_close(file_ctx); INIOUT(printf("About to reopen file.\n")); /* Some time passed and we received a signal to reload... */ error = ini_config_file_reopen(file_ctx, &file_ctx_new); if (error) { printf("Failed to re-open file for reading. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } INIOUT(printf("About to check if the file changed.\n")); changed = 0; error = ini_config_changed(file_ctx, file_ctx_new, &changed); if (error) { printf("Failed to compare files. Error %d.\n", error); ini_config_file_destroy(file_ctx); ini_config_file_destroy(file_ctx_new); return error; } /* Check if file changed */ if (changed) { printf("File changed when it shouldn't. This is unexpected error.\n"); ini_config_file_print(file_ctx); ini_config_file_print(file_ctx_new); ini_config_file_destroy(file_ctx); ini_config_file_destroy(file_ctx_new); return EINVAL; } INIOUT(printf("File did not change - expected. Close and force the change!.\n")); /* Close file */ ini_config_file_destroy(file_ctx_new); INIOUT(printf("To force the change delete the file: %s\n", outfile)); /* Emulate as if file changed */ errno = 0; if (unlink(outfile)) { error = errno; printf("Failed to delete file %d.\n", error); ini_config_file_destroy(file_ctx); return error; } sleep(1); snprintf(command, PATH_MAX * 3, "cp %s %s", infile, outfile); INIOUT(printf("Copy file again with command '%s'\n", command)); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to run copy command %d %d.\n", error, WEXITSTATUS(error)); ini_config_file_destroy(file_ctx); return -1; } INIOUT(printf("Read file again.\n")); /* Read again */ file_ctx_new = NULL; error = ini_config_file_reopen(file_ctx, &file_ctx_new); if (error) { printf("Failed to re-open file for reading. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } INIOUT(printf("Check if it changed.\n")); changed = 0; error = ini_config_changed(file_ctx, file_ctx_new, &changed); if (error) { printf("Failed to compare files. Error %d.\n", error); ini_config_file_destroy(file_ctx); ini_config_file_destroy(file_ctx_new); return error; } INIOUT(printf("Changed value is %d.\n", changed)); /* Check if file changed */ if (!changed) { printf("File did not change when it should. This is an error.\n"); ini_config_file_print(file_ctx); ini_config_file_print(file_ctx_new); ini_config_file_destroy(file_ctx); ini_config_file_destroy(file_ctx_new); return EINVAL; } INIOUT(printf("File changed!\n")); INIOUT(ini_config_file_print(file_ctx)); INIOUT(ini_config_file_print(file_ctx_new)); /* We do not need original context any more. */ ini_config_file_destroy(file_ctx); /* New context is now original context */ file_ctx = file_ctx_new; /* ... Create config object and read configuration - not shown here. * See other examples ... */ ini_config_file_destroy(file_ctx); INIOUT(printf("<==== Reload test end ====>\n")); return 0; } static int test_one_array(struct ini_cfgobj *ini_config, const char *section, const char *value, int raw, int expect, const char *sep, const char *message) { struct value_obj *vo = NULL; int error = 0; int size = 0; char **strarray; char **strptr; int i; INIOUT(printf("%s",message)); vo = NULL; error = ini_get_config_valueobj(section, value, ini_config, INI_GET_FIRST_VALUE, &vo); if(error) { printf("Expected success but got error! %d\n",error); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL. Section %s value %s, %s\n", section, value, raw ? "raw" : "interpreted"); return -1; } INIOUT(value_print(value, vo)); INIOUT(printf("Get str array with size.\n")); error = 0; if (raw) strarray = ini_get_raw_string_config_array(vo, sep, &size, &error); else strarray = ini_get_string_config_array(vo, sep, &size, &error); if (error) { printf("Expect success got error %d.\n", error); return error; } /* Can be used with this cycle */ strptr = strarray; while (*strptr != NULL) { INIOUT(printf("[%s]\n",*strptr)); strptr++; } if (size != expect) { printf("Expected %d but got %d.\n", expect, size); ini_free_string_config_array(strarray); return -1; } /* Can be used with this cycle */ INIOUT(for (i=0; i\n")); INIOUT(printf("Creating configuration object\n")); /* Create config collection */ error = ini_config_create(&ini_config); if (error) { printf("Failed to create collection. Error %d.\n", error); return error; } srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/real.conf", (srcdir == NULL) ? "." : srcdir); INIOUT(printf("Reading file %s\n", infile)); error = ini_config_file_open(infile, 0, &file_ctx); if (error) { printf("Failed to open file for reading. Error %d.\n", error); ini_config_destroy(ini_config); return error; } error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, /* Merge section but allow duplicates */ INI_MS_MERGE | INI_MV1S_ALLOW | INI_MV2S_ALLOW, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } /* We do not return here intentionally */ } ini_config_file_destroy(file_ctx); INIOUT(printf("Negtive test - trying to get non" " existing key-value pair.\n")); /* Negative test */ vo = NULL; error = ini_get_config_valueobj("monitor1", "description1", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Values should not be found */ if (vo != NULL) { printf("Expected NULL but got something else!\n"); ini_config_destroy(ini_config); return -1; } /* Another negative test but section exists this time */ vo = NULL; error = ini_get_config_valueobj("monitor", "description1", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Valueobj should not be found */ if(vo != NULL) { printf("Expected NULL but got something else!\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Trying to get a value.\n")); /* Positive test */ vo = NULL; error = ini_get_config_valueobj("monitor", "description", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected value but got NULL!\n"); ini_config_destroy(ini_config); return -1; } INIOUT(value_print("description", vo)); INIOUT(printf("Get values as string without duplication" " from the NULL valueobj.\n")); /* Get a string without duplicication */ /* Negative test */ cstrn = ini_get_const_string_config_value(NULL, NULL); if (cstrn != NULL) { printf("Expected error got success.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Get value as string without duplication" "from the correct value object.\n")); /* Now get string from the right value object */ error = 0; cstr = ini_get_const_string_config_value(vo, &error); if (error) { printf("Expected success got error %d.\n", error); ini_config_destroy(ini_config); return error; } INIOUT(printf("Value: [%s]\n", cstr)); /* Same thing but create a dup */ INIOUT(printf("Get value as string with duplication" " from correct value object.\n")); error = 0; str = ini_get_string_config_value(vo, &error); if (error) { printf("Expected success got error %d.\n", error); ini_config_destroy(ini_config); return error; } INIOUT(printf("Value: [%s]\n", str)); free(str); /* Get a badly formated number */ INIOUT(printf("Convert value to number with strict conversion.\n")); vo = NULL; error = ini_get_config_valueobj("monitor", "bad_number", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected value but got something NULL!\n"); ini_config_destroy(ini_config); return -1; } INIOUT(value_print("bad_number", vo)); /* Now try to get value in different ways */ error = 0; number = ini_get_int_config_value(vo, 1, 10, &error); if (error) { /* We expected error in this case */ INIOUT(printf("Expected error.\n")); if(number != 10) { printf("It failed to set default value.\n"); ini_config_destroy(ini_config); return -1; } } else { printf("Expected error got success.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Convert value to number without strict conversion.\n")); error = 0; number = ini_get_int_config_value(vo, 0, 10, &error); if (error) { printf("Did not expect error.\n"); ini_config_destroy(ini_config); return error; } if (number != 5) { printf("We expected that the conversion will return 5.\n"); ini_config_destroy(ini_config); return -1; } /* Get real integer */ INIOUT(printf("Fetch another value from section \"domains/LOCAL\"" " named \"enumerate\".\n")); vo = NULL; error = ini_get_config_valueobj("domains/LOCAL", "enumerate", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Convert value to integer.\n")); /* Take number out of it */ error = 0; number = ini_get_int_config_value(vo, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); ini_config_destroy(ini_config); return error; } /* It is 3 in the file */ if (number != 3) { printf("We expected that the conversion will return 3.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Expected 3 got %d\n", number)); INIOUT(printf("Convert value to long.\n")); /* Take number out of it */ error = 0; number_long = ini_get_long_config_value(vo, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); ini_config_destroy(ini_config); return error; } /* It is 3 in the file */ if (number_long != 3) { printf("We expected that the conversion will return 3.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Expected 3 got %ld\n", number_long)); INIOUT(printf("Convert value to unsigned.\n")); /* Take number out of it */ error = 0; number_unsigned = ini_get_unsigned_config_value(vo, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); ini_config_destroy(ini_config); return error; } /* It is 3 in the file */ if (number_unsigned != 3) { printf("We expected that the conversion will return 3.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Expected 3 got %d\n", number_unsigned)); INIOUT(printf("Convert value to unsigned long.\n")); /* Take number out of it */ error = 0; number_ulong = ini_get_ulong_config_value(vo, 1, 100, &error); if (error) { printf("Did not expect error. Got %d\n", error); ini_config_destroy(ini_config); return error; } /* It is 3 in the file */ if (number_ulong != 3) { printf("We expected that the conversion will return 3.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Expected 3 got %lu\n", number_ulong)); INIOUT(printf("Convert value to double.\n")); /* Take number out of it */ error = 0; number_double = ini_get_double_config_value(vo, 1, 100., &error); if (error) { printf("Did not expect error. Got %d\n", error); ini_config_destroy(ini_config); return error; } /* It is 3 in the file */ if (number_double != 3.) { printf("We expected that the conversion will return 3.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Expected 3 got %e\n", number_double)); INIOUT(printf("Convert value to bool.\n")); /* Take number out of it */ error = 0; logical = ini_get_bool_config_value(vo, 1, &error); if (!error) { printf("Expect error. Got success. Value %d\n", (int) logical); ini_config_destroy(ini_config); return -1; } /* Get real bool values and convert it */ INIOUT(printf("Get real bool value \"legacy\" and convert it.\n")); vo = NULL; error = ini_get_config_valueobj("domains/LOCAL", "legacy", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n",error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Convert values to bool.\n")); error = 0; logical = ini_get_bool_config_value(vo, 1, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } if (logical) { printf("Expected false but got true - bad.\n"); return -1; } INIOUT(printf("In the files it is FALSE so we got false.\n")); INIOUT(printf("Get binary value\n")); vo = NULL; error = ini_get_config_valueobj("domains/EXAMPLE.COM", "binary_test", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(value_print("binary_test", vo)); error = 0; binary = ini_get_bin_config_value(vo, &length, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } INIOUT(printf("Binary value (expect 123) = ")); INIOUT(for (i = 0; i < length; i++) { printf("%d",*((unsigned char*)(binary) + i)); if (*((unsigned char*)(binary) + i) != (i + 1)) bad_val = 1; }); INIOUT(printf("\n")); ini_free_bin_config_value(binary); if (bad_val) { printf("Unexpected binary value.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Get another binary value\n")); bad_val = 0; vo = NULL; error = ini_get_config_valueobj("domains/EXAMPLE.COM", "binary_test_two", ini_config, INI_GET_FIRST_VALUE, &vo); if (error) { printf("Expected success but got error! %d\n", error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(value_print("binary_test_two", vo)); error = 0; binary = ini_get_bin_config_value(vo, &length, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } INIOUT(printf("Binary value (expect abc) = ")); INIOUT(for (i = 0; i < length; i++) { printf("%x",*((unsigned char*)(binary) + i)); if (*((unsigned char*)(binary) + i) - 10 != i) bad_val = 1; }); INIOUT(printf("\n")); ini_free_bin_config_value(binary); if (bad_val) { printf("Unexpected binary value.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("Get string array value\n")); vo = NULL; error = ini_get_config_valueobj("domains", "domainsorder", ini_config, INI_GET_FIRST_VALUE, &vo); if(error) { printf("Expected success but got error! %d\n",error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(value_print("domainsorder", vo)); INIOUT(printf("Get str array without size.\n")); error = 0; strarray = ini_get_string_config_array(vo, ",", NULL, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } /* Can be used with this cycle */ strptr = strarray; while (*strptr != NULL) { INIOUT(printf("[%s]\n",*strptr)); strptr++; } ini_free_string_config_array(strarray); INIOUT(printf("Get raw str array without size.\n")); error = 0; strarray = ini_get_raw_string_config_array(vo, ",", NULL, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } /* Can be used with this cycle */ strptr = strarray; while (*strptr != NULL) { INIOUT(printf("[%s]\n",*strptr)); strptr++; } ini_free_string_config_array(strarray); INIOUT(printf("Get str array with size.\n")); error = 0; size = 0; strarray = ini_get_string_config_array(vo, ",", &size, &error); if (error) { printf("Expect success got error %d.\n", error); ini_config_destroy(ini_config); return error; } /* Can be used with this cycle */ INIOUT(for (i=0;i\n\n")); return EOK; } static int space_test(void) { int error; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; char infile[PATH_MAX]; char *srcdir = NULL; unsigned errnum; int i; uint32_t flags[] = { INI_PARSE_NOWRAP, INI_PARSE_NOWRAP | INI_PARSE_NOSPACE, INI_PARSE_NOWRAP | INI_PARSE_NOTAB, INI_PARSE_NOWRAP | INI_PARSE_NOSPACE | INI_PARSE_NOTAB }; INIOUT(printf("\n\n<==== SPACE TEST START =====>\n")); srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/space.conf", (srcdir == NULL) ? "." : srcdir); for (i = 0; i < 4; i++ ) { INIOUT(printf("Reading file %s\n", infile)); error = ini_config_file_open(infile, 0, &file_ctx); if (error) { printf("Failed to open file for reading. Error %d.\n", error); return error; } INIOUT(printf("Creating configuration object\n")); error = ini_config_create(&ini_config); if (error) { printf("Failed to create object. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } INIOUT(printf("Parsing\n")); error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, flags[i], ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); errnum = ini_config_error_count(ini_config); if (errnum) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } if (((i == 0) && (errnum != 0)) || ((i == 1) && (errnum != 3)) || ((i == 2) && (errnum != 3)) || ((i == 3) && (errnum != 4))) { printf("Failed to open file for reading. Error %d.\n", error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return -1; } /* We do not return here intentionally */ } INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); ini_config_destroy(ini_config); ini_config_file_destroy(file_ctx); } INIOUT(printf("\n<==== SPACE TEST END =====>\n\n")); return EOK; } static int trim_test(void) { int error; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; char infile[PATH_MAX]; char *srcdir = NULL; const char *value; struct value_obj *vo = NULL; INIOUT(printf("\n\n<==== TRIM TEST START =====>\n")); srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/real.conf", (srcdir == NULL) ? "." : srcdir); INIOUT(printf("Reading file %s\n", infile)); error = ini_config_file_open(infile, 0, &file_ctx); if (error) { printf("Failed to open file for reading. Error %d.\n", error); return error; } INIOUT(printf("Creating configuration object\n")); error = ini_config_create(&ini_config); if (error) { printf("Failed to create object. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } INIOUT(printf("Parsing\n")); error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. " "Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } ini_config_file_destroy(file_ctx); return error; } INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); ini_config_file_destroy(file_ctx); vo = NULL; error = ini_get_config_valueobj("domains/EXAMPLE.COM", "description", ini_config, INI_GET_FIRST_VALUE, &vo); if(error) { printf("Expected success but got error! %d\n",error); ini_config_destroy(ini_config); return error; } /* Value should be found */ if (vo == NULL) { printf("Expected success but got NULL.\n"); ini_config_destroy(ini_config); return -1; } value = ini_get_const_string_config_value(vo, NULL); if (value == NULL) { printf("No value.\n"); ini_config_destroy(ini_config); return -1; } if(value[strlen(value) - 1] == ' ') { printf("Trailing space is not trimmed.\n"); ini_config_destroy(ini_config); return -1; } INIOUT(printf("[%s]\n", value)); ini_config_destroy(ini_config); INIOUT(printf("\n<==== TRIM TEST END =====>\n\n")); return EOK; } static int comment_test(void) { int error; struct ini_cfgfile *file_ctx = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; char infile[PATH_MAX]; char *srcdir = NULL; int err_count = 0; INIOUT(printf("\n\n<==== COMMENT TEST START =====>\n")); srcdir = getenv("srcdir"); snprintf(infile, PATH_MAX, "%s/ini/ini.d/comment.conf", (srcdir == NULL) ? "." : srcdir); INIOUT(printf("Reading file %s\n", infile)); error = ini_config_file_open(infile, 0, &file_ctx); if (error) { printf("Failed to open file for reading. Error %d.\n", error); return error; } INIOUT(printf("Creating configuration object\n")); error = ini_config_create(&ini_config); if (error) { printf("Failed to create object. Error %d.\n", error); ini_config_file_destroy(file_ctx); return error; } INIOUT(printf("Parsing\n")); error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. " "Error %d.\n", error)); err_count = ini_config_error_count(ini_config); if (err_count) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); } } INIOUT(col_debug_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT)); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); if(err_count != 4) { printf("Expected 4 errors got: %d\n", err_count); return 1; } INIOUT(printf("\n<==== COMMENT TEST END =====>\n\n")); return EOK; } static void create_boms(void) { FILE *f; f = fopen("bom2be","wb"); fprintf(f,"%c%c", 0xFE, 0xFF); fclose(f); f = fopen("bom2le","wb"); fprintf(f,"%c%c", 0xFF, 0xFE); fclose(f); f = fopen("bom4be","wb"); fprintf(f,"%c%c%c%c", 0x00, 0x00, 0xFE, 0xFF); fclose(f); f = fopen("bom4le","wb"); fprintf(f,"%c%c%c%c", 0xFF, 0xFE, 0x00, 0x00); fclose(f); f = fopen("bom3","wb"); fprintf(f,"%c%c%c", 0xEF, 0xBB, 0xBF); fclose(f); } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { read_save_test, read_again_test, read_mem_test, merge_values_test, merge_section_test, merge_file_test, startup_test, reload_test, get_test, space_test, trim_test, comment_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } /* Create boms in case we want to create more test files */ create_boms(); INIOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); fflush(NULL); if (error) { INIOUT(printf("Failed with error %d!\n", error)); return error; } } INIOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_parse_ut_check.c000066400000000000000000000243641417260640400201450ustar00rootroot00000000000000/* INI LIBRARY Check based unit test for ini parser. Copyright (C) Michal Zidek 2016 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #define TEST_DIR_PATH "" START_TEST(test_ini_parse_non_kvp) { int ret; struct ini_cfgobj *ini_cfg; int value; struct ini_cfgfile *file_ctx; struct value_obj *vo; char non_kvp_cfg[] = "[section_before]\n" "one = 1\n" "[section_non_kvp]\n" "two = 2\n" "non_kvp\n" "three = 3\n" "=nonkvp\n" "[section_after]\n" "four = 4\n"; ret = ini_config_file_from_mem(non_kvp_cfg, strlen(non_kvp_cfg), &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); /* First try without the INI_PARSE_IGNORE_NON_KVP. This should fail * with error. */ ret = ini_config_create(&ini_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_ERROR, INI_MV1S_ALLOW, 0, ini_cfg); fail_if(ret != 5, "Expected error was not found.\n"); ini_config_destroy(ini_cfg); ini_config_file_destroy(file_ctx); /* Now try with INI_PARSE_IGNORE_NON_KVP. We should have no errors * and all the surounding configuration should be valid */ ret = ini_config_file_from_mem(non_kvp_cfg, strlen(non_kvp_cfg), &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); ret = ini_config_create(&ini_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_ERROR, INI_MV1S_ALLOW, INI_PARSE_IGNORE_NON_KVP, ini_cfg); fail_unless(ret == EOK, "ini_config_parse returned %d\n", ret); /* Now check if the surrounding configuration is OK */ /* section_before */ ret = ini_get_config_valueobj("section_before", "one", ini_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == EOK, "ini_get_config_valueobj returned %d\n: %s", ret, strerror(ret)); value = ini_get_int_config_value(vo, 1, -1, &ret); fail_unless(ret == EOK, "ini_get_int_config_value returned %d\n: %s", ret, strerror(ret)); fail_unless(ret == EOK); fail_if(value != 1, "Expected value 1 got %d\n", value); /* section_non_kvp */ ret = ini_get_config_valueobj("section_non_kvp", "two", ini_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == EOK); value = ini_get_int_config_value(vo, 1, -1, &ret); fail_unless(ret == EOK); fail_if(value != 2, "Expected value 2 got %d\n", value); ret = ini_get_config_valueobj("section_non_kvp", "three", ini_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == EOK); value = ini_get_int_config_value(vo, 1, -1, &ret); fail_unless(ret == EOK); fail_if(value != 3, "Expected value 3 got %d\n", value); /* section_after */ ret = ini_get_config_valueobj("section_after", "four", ini_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == EOK); value = ini_get_int_config_value(vo, 1, -1, &ret); fail_unless(ret == EOK); fail_if(value != 4, "Expected value 4 got %d\n", value); ini_config_destroy(ini_cfg); ini_config_file_destroy(file_ctx); } END_TEST START_TEST(test_ini_parse_section_key_conflict) { /* * This tests the behavior of ini_config_parse to ensure correct handling * of conflicts between sections and keys of the same name. There are * three possibilities for conflict: * * 1. Inside a section, between the section name and a key name * 2. Between a default-section key name and a section name * 3. Between a key name in a different section and a section name * * In case (1), parsing finished without an error. However, when * trying to select a value object inside a section, the returned * object was an unchecked cast from the section's data, and not the * attribute's data. In cases (2) and (3), the parser segfaulted while * trying to merge a section with an attribute. */ char config1[] = "[a]\n" "a=a\n"; char config2[] = "a=b\n" "[a]\n" "c=d\n"; char config3[] = "[a]\n" "b=c\n" "[b]\n" "a=d\n"; char *file_contents[] = {config1, config2, config3, NULL}; size_t iter; struct ini_cfgobj *ini_config = NULL; struct ini_cfgfile *file_ctx = NULL; int ret; int i; int j; char **sections = NULL; int sections_count = 0; int sections_error = 0; char **attributes = NULL; int attributes_count = 0; int attributes_error = 0; struct value_obj *val = NULL; char *val_str = NULL; for (iter = 0; file_contents[iter] != NULL; iter++) { ret = ini_config_create(&ini_config); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_file_from_mem(file_contents[iter], strlen(file_contents[iter]), &file_ctx); fail_unless(ret == EOK, "Failed to load file. Error %d.\n", ret); ret = ini_config_parse(file_ctx, 1, 0, 0, ini_config); fail_unless(ret == EOK, "Failed to parse file. Error %d.\n", ret); sections = ini_get_section_list(ini_config, §ions_count, §ions_error); fail_unless(sections_error == EOK, "Failed to get sections. Error %d.\n", sections_error); for (i = 0; i < sections_count; i++) { attributes = ini_get_attribute_list(ini_config, sections[i], &attributes_count, &attributes_error); fail_unless(attributes_error == EOK, "Failed to get attributes. Error %d.\n", attributes_error); for (j = 0; j < attributes_count; j++) { ret = ini_get_config_valueobj(sections[i], attributes[j], ini_config, 0, &val); fail_unless(ret == EOK, "Failed to get attribute. Error %d.\n", ret); val_str = ini_get_string_config_value(val, &ret); fail_unless(ret == EOK, "Failed to get attribute as string. Error %d.\n", ret); fail_unless(val_str != NULL, "Failed to get attribute as string: was NULL.\n"); free(val_str); } ini_free_attribute_list(attributes); } ini_free_section_list(sections); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); } } END_TEST /* Maybe we should test even bigger values? */ #define VALUE_LEN 10000 /* The +100 is space for section name and key name. */ #define CFGBUF_LEN (VALUE_LEN + 100) START_TEST(test_ini_long_value) { int ret; struct ini_cfgobj *ini_cfg; struct ini_cfgfile *file_ctx; struct value_obj *vo; char big_val_cfg[CFGBUF_LEN] = {0}; char value[VALUE_LEN] = {0}; char *value_got; /* The value is just a lot of As ending with '\0'*/ memset(value, 'A', VALUE_LEN - 1); /* Create config file */ ret = snprintf(big_val_cfg, CFGBUF_LEN, "[section]\nkey=%s", value); ret = ini_config_file_from_mem(big_val_cfg, strlen(big_val_cfg), &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); ret = ini_config_create(&ini_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_ERROR, INI_MV1S_ALLOW, 0, ini_cfg); fail_if(ret != 0, "Failed to parse config. Error %d.\n", ret); ret = ini_get_config_valueobj("section", "key", ini_cfg, INI_GET_FIRST_VALUE, &vo); fail_unless(ret == EOK, "ini_get_config_valueobj returned %d\n: %s", ret, strerror(ret)); value_got = ini_get_string_config_value(vo, &ret); fail_unless(ret == EOK, "ini_get_int_config_value returned %d\n: %s", ret, strerror(ret)); fail_unless(strcmp(value, value_got) == 0, "Expected and found values differ!\n"); free(value_got); ini_config_destroy(ini_cfg); ini_config_file_destroy(file_ctx); } END_TEST static Suite *ini_parse_suite(void) { Suite *s = suite_create("ini_parse_suite"); TCase *tc_parse = tcase_create("ini_parse"); tcase_add_test(tc_parse, test_ini_parse_non_kvp); tcase_add_test(tc_parse, test_ini_parse_section_key_conflict); tcase_add_test(tc_parse, test_ini_long_value); suite_add_tcase(s, tc_parse); return s; } int main(void) { int number_failed; Suite *s = ini_parse_suite(); SRunner *sr = srunner_create(s); /* If CK_VERBOSITY is set, use that, otherwise it defaults to CK_NORMAL */ srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/ini/ini_print.c000066400000000000000000000360441417260640400163200ustar00rootroot00000000000000/* INI LIBRARY Parsing functions of the INI interface Copyright (C) Dmitri Pal 2009 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include /* For error text */ #include #define _(String) gettext (String) /* INI file is used as a collection */ #include "trace.h" #include "collection.h" #include "collection_tools.h" #include "ini_defines.h" #include "ini_configobj.h" #include "ini_config_priv.h" /* Following declarations are from header file ini_config.h. This file was not * included, because we don't want on include header file * with old interface(ini_config.h) and new interface(ini_configobj.h) * into the one file. */ void print_config_parsing_errors(FILE *file, struct collection_item *error_set); void print_file_parsing_errors(FILE *file, struct collection_item *error_list); /*============================================================*/ /* The following classes moved here from the public header * They are reserved for future use. * * NOTE: before exposing these constants again in the common header * check that the class IDs did not get reused over time by * other classes. */ /** * @brief Collection of error collections. * * When multiple files are read during one call * each file has its own set of parsing errors * and warnings. This is the collection * of such sets. */ #define COL_CLASS_INI_PESET COL_CLASS_INI_BASE + 3 /** @brief Collection of grammar errors. * * Reserved for future use. */ #define COL_CLASS_INI_GERROR COL_CLASS_INI_BASE + 5 /** @brief Collection of validation errors. * * Reserved for future use. */ #define COL_CLASS_INI_VERROR COL_CLASS_INI_BASE + 6 /** * @} */ /** * @defgroup gramerr Grammar errors and warnings * * Placeholder for now. Reserved for future use. * * @{ */ #define ERR_MAXGRAMMAR 0 /** * @} */ /** * @defgroup valerr Validation errors and warnings * * Placeholder for now. Reserved for future use. * * @{ */ #define ERR_MAXVALID 0 /** * @} */ #ifdef HAVE_VALIDATION /** @brief Collection of lines from the INI file. * * Reserved for future use */ #define COL_CLASS_INI_LINES COL_CLASS_INI_BASE + 7 #endif /* HAVE_VALIDATION */ /*============================================================*/ /* Function to return parsing error */ static const char *parsing_error_str(int parsing_error) { const char *placeholder= _("Unknown pasing error."); const char *str_error[] = { _("Data is too long."), _("No closing bracket."), _("Section name is missing."), _("Section name is too long."), _("Equal sign is missing."), _("Property name is missing."), _("Property name is too long."), _("Failed to read line."), _("Invalid space character at the " "beginning of the line."), _("Duplicate key is not allowed."), _("Duplicate key is detected while " "merging sections."), _("Duplicate section is not allowed."), _("Invalid character at the " "beginning of the line."), _("Invalid tab character at the " "beginning of the line."), _("Incomplete comment at the " "end of the file.") }; /* Check the range */ if ((parsing_error < 1) || (parsing_error > ERR_MAXPARSE)) return placeholder; else return str_error[parsing_error-1]; } /* Function to return grammar error. * This function is currently not used. * It is planned to be used by the INI * file grammar parser. * * The following doxygen description is moved here. * When the function gets exposed move it into * the header file. */ /** @brief Function to return a grammar error in template. * * EXPERIMENTAL. Reserved for future use. * * This error is returned when the template * is translated into the grammar object. * * @param[in] grammar_error Error code for the grammar error. * * @return Error string. */ static const char *grammar_error_str(int grammar_error) { const char *placeholder= _("Unknown grammar error."); /* THIS IS A TEMPORARY PLACEHOLDER !!!! */ const char *str_error[] = { _(""), _(""), _(""), _(""), _(""), _(""), _("") }; /* Check the range */ if ((grammar_error < 1) || (grammar_error > ERR_MAXGRAMMAR)) return placeholder; else return str_error[grammar_error-1]; } /* Function to return validation error. * This function is currently not used. * It is planned to be used by the INI * file grammar validator. * * The following doxygen description is moved here. * When the function gets exposed move it into * the header file. */ /** @brief Function to return a validation error. * * EXPERIMENTAL. Reserved for future use. * * This is the error that it is returned when * the INI file is validated against the * grammar object. * * @param[in] validation_error Error code for the validation error. * * @return Error string. */ static const char *validation_error_str(int validation_error) { const char *placeholder= _("Unknown validation error."); /* THIS IS A TEMPORARY PLACEHOLDER !!!! */ const char *str_error[] = { _(""), _(""), _(""), _(""), _(""), _(""), _("") }; /* Check the range */ if ((validation_error < 1) || (validation_error > ERR_MAXVALID)) return placeholder; else return str_error[validation_error-1]; } /* Wrapper to print errors */ const char *ini_get_error_str(int error, int family) { const char *val; TRACE_FLOW_ENTRY(); switch(family) { case INI_FAMILY_PARSING: val = parsing_error_str(error); break; case INI_FAMILY_VALIDATION: val = validation_error_str(error); break; case INI_FAMILY_GRAMMAR: val = grammar_error_str(error); break; default: val = _("Unknown error category."); break; } TRACE_FLOW_EXIT(); return val; } /* Internal function that prints errors */ static void print_error_list(FILE *file, struct collection_item *error_list, int cclass, char *wrong_col_error, char *failed_to_process, char *error_header, char *line_format, int family) { struct collection_iterator *iterator; int error; struct collection_item *item = NULL; struct ini_parse_error *pe; unsigned int count; TRACE_FLOW_STRING("print_error_list", "Entry"); /* If we have something to print print it */ if (error_list == NULL) { TRACE_ERROR_STRING("No error list",""); return; } /* Make sure we go the right collection */ if (!col_is_of_class(error_list, cclass)) { TRACE_ERROR_STRING("Wrong collection class:", wrong_col_error); fprintf(file,"%s\n", wrong_col_error); return; } /* Bind iterator */ error = col_bind_iterator(&iterator, error_list, COL_TRAVERSE_DEFAULT); if (error) { TRACE_ERROR_STRING("Error (bind):", failed_to_process); fprintf(file, "%s\n", failed_to_process); return; } while(1) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { TRACE_ERROR_STRING("Error (iterate):", failed_to_process); fprintf(file, "%s\n", failed_to_process); col_unbind_iterator(iterator); return; } /* Are we done ? */ if (item == NULL) break; /* Process collection header */ if (col_get_item_type(item) == COL_TYPE_COLLECTION) { col_get_collection_count(item, &count); if (count <= 2) break; } else if (col_get_item_type(item) == COL_TYPE_STRING) { fprintf(file, error_header, (char *)col_get_item_data(item)); } else { /* Put error into provided format */ pe = (struct ini_parse_error *)(col_get_item_data(item)); fprintf(file, line_format, col_get_item_property(item, NULL), /* Error or warning */ pe->error, /* Error */ pe->line, /* Line */ ini_get_error_str(pe->error, family)); /* Error str */ } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); TRACE_FLOW_STRING("print_error_list", "Exit"); } /* Print errors and warnings that were detected while parsing one file */ void print_file_parsing_errors(FILE *file, struct collection_item *error_list) { print_error_list(file, error_list, COL_CLASS_INI_PERROR, WRONG_COLLECTION, FAILED_TO_PROCCESS, ERROR_HEADER, LINE_FORMAT, INI_FAMILY_PARSING); } void print_grammar_errors(FILE *file, struct collection_item *error_list); /* Print errors and warnings that were detected while processing grammar. * * The following doxygen description is moved here. * When the function gets exposed move it into * the header file and remove prototype from this file. */ /** * @brief Print errors and warnings that were detected while * checking grammar of the template. * * EXPERIMENTAL. Reserved for future use. * * @param[in] file File descriptor. * @param[in] error_list List of the parsing errors. * */ void print_grammar_errors(FILE *file, struct collection_item *error_list) { print_error_list(file, error_list, COL_CLASS_INI_GERROR, WRONG_GRAMMAR, FAILED_TO_PROC_G, ERROR_HEADER_G, LINE_FORMAT, INI_FAMILY_GRAMMAR); } void print_validation_errors(FILE *file, struct collection_item *error_list); /* Print errors and warnings that were detected while validating INI file. * * The following doxygen description is moved here. * When the function gets exposed move it into * the header file and remove prototype from this file. */ /** * @brief Print errors and warnings that were detected while * checking INI file against the grammar object. * * EXPERIMENTAL. Reserved for future use. * * @param[in] file File descriptor. * @param[in] error_list List of the parsing errors. * */ void print_validation_errors(FILE *file, struct collection_item *error_list) { print_error_list(file, error_list, COL_CLASS_INI_VERROR, WRONG_VALIDATION, FAILED_TO_PROC_V, ERROR_HEADER_V, LINE_FORMAT, INI_FAMILY_VALIDATION); } /* Print errors and warnings that were detected while parsing * the whole configuration */ void print_config_parsing_errors(FILE *file, struct collection_item *error_list) { struct collection_iterator *iterator; int error; struct collection_item *item = NULL; struct collection_item *file_errors = NULL; TRACE_FLOW_STRING("print_config_parsing_errors", "Entry"); /* If we have something to print print it */ if (error_list == NULL) { TRACE_ERROR_STRING("No error list", ""); return; } /* Make sure we go the right collection */ if (!col_is_of_class(error_list, COL_CLASS_INI_PESET)) { TRACE_ERROR_STRING("Wrong collection class:", WRONG_COLLECTION); fprintf(file, "%s\n", WRONG_COLLECTION); return; } /* Bind iterator */ error = col_bind_iterator(&iterator, error_list, COL_TRAVERSE_DEFAULT); if (error) { TRACE_ERROR_STRING("Error (bind):", FAILED_TO_PROCCESS); fprintf(file,"%s\n", FAILED_TO_PROCCESS); return; } while(1) { /* Loop through a collection */ error = col_iterate_collection(iterator, &item); if (error) { TRACE_ERROR_STRING("Error (iterate):", FAILED_TO_PROCCESS); fprintf(file, "%s\n", FAILED_TO_PROCCESS); col_unbind_iterator(iterator); return; } /* Are we done ? */ if (item == NULL) break; /* Print per file sets of errors */ if (col_get_item_type(item) == COL_TYPE_COLLECTIONREF) { /* Extract a sub collection */ error = col_get_reference_from_item(item, &file_errors); if (error) { TRACE_ERROR_STRING("Error (extract):", FAILED_TO_PROCCESS); fprintf(file, "%s\n", FAILED_TO_PROCCESS); col_unbind_iterator(iterator); return; } print_file_parsing_errors(file, file_errors); col_destroy_collection(file_errors); } } /* Do not forget to unbind iterator - otherwise there will be a leak */ col_unbind_iterator(iterator); TRACE_FLOW_STRING("print_config_parsing_errors", "Exit"); } /* Function to print errors from the list */ void ini_config_print_errors(FILE *file, char **error_list) { unsigned count = 0; TRACE_FLOW_ENTRY(); if (!error_list) { TRACE_FLOW_STRING("List is empty.", ""); return; } while (error_list[count]) { fprintf(file, "%s\n", error_list[count]); count++; } TRACE_FLOW_EXIT(); return; } ding-libs-0.6.2/ini/ini_save_ut.c000066400000000000000000000202661417260640400166310ustar00rootroot00000000000000/* INI LIBRARY Unit test for the configuration object modification API. Copyright (C) Dmitri Pal 2014 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "collection_tools.h" #include "path_utils.h" int verbose = 0; #define WRAP_SIZE 80 #define INIOUT(foo) \ do { \ if (verbose) { printf("%30s(%4d): ",__FUNCTION__,__LINE__); foo; } \ } while(0) typedef int (*test_fn)(void); /* Basic test */ static int basic_test(void) { int error = EOK; char srcname[PATH_MAX]; char resname[PATH_MAX]; char cmpname[PATH_MAX]; char command[PATH_MAX * 3]; struct ini_cfgfile *file_ctx = NULL; char baktpl[] = "test_real_%d.conf.save"; char *builddir = NULL; char *srcdir = NULL; struct ini_cfgobj *ini_config = NULL; char **error_list = NULL; int i; struct access_check acc = { INI_ACCESS_CHECK_MODE, /* Use only mode */ 0, /* Ignore uid */ 0, /* Ignore gid */ 0770, 0 }; /* Mask is ignored */ struct access_check new_access = { INI_ACCESS_CHECK_MODE, /* Use only mode */ 0, /* Ignore uid */ 0, /* Ignore gid */ 0660, 0 }; /* Mask is ignored */ const char *cmp_files[] = { "real16be.conf", "real16le.conf", "real32le.conf", "real32be.conf" }; enum index_utf_t bom; enum index_utf_t bom_ar[] = { INDEX_UTF16BE, INDEX_UTF16LE, INDEX_UTF32LE, INDEX_UTF32BE }; INIOUT(printf("<==== Start of basic test ====>\n")); srcdir = getenv("srcdir"); builddir = getenv("builddir"); snprintf(srcname, PATH_MAX, "%s/ini/ini2.d/real8.conf", (srcdir == NULL) ? "." : srcdir); /* Create config collection */ error = ini_config_create(&ini_config); if (error) { printf("Failed to create configuration. Error %d.\n", error); return error; } error = ini_config_file_open(srcname, INI_META_STATS, &file_ctx); if (error) { printf("Failed to open file %s for reading. Error %d.\n", srcname, error); ini_config_destroy(ini_config); return error; } error = ini_config_parse(file_ctx, INI_STOP_ON_NONE, 0, 0, ini_config); if (error) { INIOUT(printf("Failed to parse configuration. Error %d.\n", error)); if (ini_config_error_count(ini_config)) { INIOUT(printf("Errors detected while parsing: %s\n", ini_config_get_filename(file_ctx))); ini_config_get_errors(ini_config, &error_list); INIOUT(ini_config_print_errors(stdout, error_list)); ini_config_free_errors(error_list); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } } bom = ini_config_get_bom(file_ctx); INIOUT(printf("BOM %d\n", bom)); for (i = 0; i < 4; i++) { INIOUT(printf("Processing file %s\n", cmp_files[i])); /* Create backup */ error = ini_config_file_backup(file_ctx, (builddir == NULL) ? "." : builddir, baktpl, &acc, 1000); if (error) { printf("Failed to create backup file. Error %d.\n", error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } /* Set a new bom */ error = ini_config_set_bom(file_ctx, bom_ar[i]); if (error) { printf("Failed to set bom. Error %d.\n", error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } /* Save as a different file */ INIOUT(printf("Saving as file %s\n", cmp_files[i])); snprintf(resname, PATH_MAX, "%s/test_%s", (builddir == NULL) ? "." : builddir, cmp_files[i]); error = ini_config_save_as(file_ctx, resname, &acc, ini_config); if (error) { printf("Failed to save file as %s. Error %d.\n", resname, error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } /* Do comparison of the original file with the created one */ INIOUT(printf("Comparing file %s\n", cmp_files[i])); snprintf(cmpname, PATH_MAX, "%s/ini/ini2.d/%s", (srcdir == NULL) ? "." : srcdir, cmp_files[i]); snprintf(command, PATH_MAX * 3, "cmp -l -b %s %s", resname, cmpname); error = system(command); if ((error) || (WEXITSTATUS(error))) { printf("Failed to compare files %d %d.\n", error, WEXITSTATUS(error)); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return -1; } /* Change access to the saved file */ INIOUT(printf("Changing access to file %s\n", cmp_files[i])); error = ini_config_change_access(file_ctx, &new_access); if (error) { printf("Failed to change access for file %s. Error %d.\n", resname, error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } /* Check that access is as expected */ INIOUT(printf("Check access to the file %s\n", cmp_files[i])); error = ini_config_access_check(file_ctx, INI_ACCESS_CHECK_MODE, 0, 0, 0660, 0); if (error) { printf("Failed to check access %s. Error %d.\n", resname, error); ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); return error; } } ini_config_file_destroy(file_ctx); ini_config_destroy(ini_config); INIOUT(printf("<==== END ====>\n")); return 0; } int main(int argc, char *argv[]) { int error = EOK; test_fn tests[] = { basic_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } INIOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { printf("Failed with error %d!\n", error); return error; } } INIOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/ini_serialize.c000066400000000000000000000055441417260640400171540ustar00rootroot00000000000000/* INI LIBRARY Module contains functions to serialize configuration object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include "simplebuffer.h" #include "collection.h" #include "ini_valueobj.h" #include "ini_defines.h" #include "ini_configobj.h" #include "ini_config_priv.h" #include "trace.h" /* Callback */ static int ini_serialize_cb(const char *property, int property_len, int type, void *data, int length, void *custom_data, int *stop) { int error = EOK; struct simplebuffer *sbobj; struct value_obj *vo; TRACE_FLOW_ENTRY(); /* Banary items are the values */ if(type == COL_TYPE_BINARY) { sbobj = (struct simplebuffer *)custom_data; vo = *((struct value_obj **)(data)); error = value_serialize(vo, property, sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to serizlize value", error); *stop = 1; } } TRACE_FLOW_EXIT(); return error; } /* Traverse the collection and build the serialization object */ int ini_config_serialize(struct ini_cfgobj *ini_config, struct simplebuffer *sbobj) { int error = EOK; TRACE_FLOW_ENTRY(); if (!ini_config) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } if (ini_config->cfg) { error = col_traverse_collection(ini_config->cfg, COL_TRAVERSE_DEFAULT, ini_serialize_cb, (void *)sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to serialize collection", error); return error; } } if (ini_config->last_comment) { error = ini_comment_serialize(ini_config->last_comment, sbobj); if (error) { TRACE_ERROR_NUMBER("Failed serialize comment", error); return error; } } TRACE_FLOW_EXIT(); return error; } ding-libs-0.6.2/ini/ini_validators_ut_check.c000066400000000000000000001046061417260640400212010ustar00rootroot00000000000000/* INI LIBRARY Unit test for the configuration file validators API. Copyright (C) Michal Zidek 2016 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include #include #include #include /* #define TRACE_LEVEL 7 */ #define TRACE_HOME #include "trace.h" #include "ini_configobj.h" #include "ini_config_priv.h" #define TEST_DIR_PATH "" #define TEST_RULES_FILE TEST_DIR_PATH"test_rules.ini" static void create_rules_from_str(const char *rules, struct ini_cfgobj **_rules_obj) { FILE *file; size_t written; int ret; /* We want to test actual reading from file using * ini_rules_read_from_file, so we create the file here */ file = fopen(TEST_RULES_FILE, "w"); fail_if(file == NULL, "fopen() failed: %s", strerror(errno)); written = fwrite(rules, 1, strlen(rules), file); fail_unless(written == strlen(rules)); /* allow reading */ ret = chmod(TEST_RULES_FILE, 0664); fail_unless(ret == 0, "chmod() failed: %s", strerror(errno)); fclose(file); ret = ini_rules_read_from_file(TEST_RULES_FILE, _rules_obj); fail_unless(ret == 0, "read_rules_from_file() failed: %s", strerror(ret)); } static struct ini_cfgobj *get_ini_config_from_str(char input_data[], size_t input_data_len) { struct ini_cfgobj *in_cfg; struct ini_cfgfile *file_ctx; int ret; ret = ini_config_create(&in_cfg); fail_unless(ret == EOK, "Failed to create config. Error %d.\n", ret); ret = ini_config_file_from_mem(input_data, input_data_len, &file_ctx); fail_unless(ret == EOK, "Failed to load config. Error %d.\n", ret); ret = ini_config_parse(file_ctx, INI_STOP_ON_NONE, INI_MV1S_ALLOW, 0, in_cfg); fail_unless(ret == EOK, "Failed to parse config. Error %d.\n", ret); ini_config_file_destroy(file_ctx); return in_cfg; } START_TEST(test_ini_errobj) { struct ini_errobj *errobj; int ret; const char TEST_MSG1[] = "Test message one."; const char TEST_MSG2[] = "Test message two."; const char TEST_MSG3[] = "Test message three."; ret = ini_errobj_create(NULL); fail_unless(ret == EINVAL, "ini_errobj_create(NULL) failed with wrong error [%s]", strerror(ret)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); /* We just created the errobj, it should be empty */ fail_unless(ini_errobj_no_more_msgs(errobj)); /* Now add three messages, after adding each message, * check if the errobj has correct content. */ ret = ini_errobj_add_msg(errobj, TEST_MSG1); fail_if(ret != 0, "ini_errobj_add_msg() failed: %s", strerror(ret)); fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG1, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG1 was not found."); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ret = ini_errobj_add_msg(errobj, TEST_MSG2); fail_if(ret != 0, "ini_errobj_add_msg() failed: %s", strerror(ret)); ini_errobj_reset(errobj); /* strart from first message */ fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG1, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG1 was not found."); ini_errobj_next(errobj); fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG2, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG2 was not found."); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ret = ini_errobj_add_msg(errobj, TEST_MSG3); fail_if(ret != 0, "ini_errobj_add_msg() failed: %s", strerror(ret)); ini_errobj_reset(errobj); /* strart from first message */ fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG1, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG1 was not found."); ini_errobj_next(errobj); fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG2, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG2 was not found."); ini_errobj_next(errobj); fail_if(ini_errobj_no_more_msgs(errobj)); ret = strcmp(TEST_MSG3, ini_errobj_get_msg(errobj)); fail_if(ret != 0, "TEST_MSG3 was not found."); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); } END_TEST START_TEST(test_ini_noerror) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; char input_rules[] = "[rule/always_succeed]\n" "validator = ini_dummy_noerror\n"; char input_cfg[] = "[section]\n" "# Content of this file should not matter\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_error) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; const char *errmsg; char input_rules[] = "[rule/generate_error]\n" "validator = ini_dummy_error\n"; char input_wrong_rule[] = "[rule/generate_error]\n" "valid = ini_dummy_error\n"; char input_cfg[] = "[section]\n" "# Content of this file should not matter\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate exactly one error */ fail_if(ini_errobj_no_more_msgs(errobj)); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/generate_error]: Error"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); /* test rule with missing validator */ create_rules_from_str(input_wrong_rule, &rules_obj); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate exactly one error */ fail_if(ini_errobj_no_more_msgs(errobj)); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/generate_error' has no validator."); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); ini_config_destroy(cfg_obj); } END_TEST START_TEST(test_unknown_validator) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; char input_rules[] = "[rule/always_succeed]\n" "validator = nonexistent_validator\n"; char input_cfg[] = "[section]\n" "# Content of this file should not matter\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate exactly one error */ fail_if(ini_errobj_no_more_msgs(errobj)); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST static int custom_noerror(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { return 0; } static int custom_error(const char *rule_name, struct ini_cfgobj *rules_obj, struct ini_cfgobj *config_obj, struct ini_errobj *errobj, void **data) { return ini_errobj_add_msg(errobj, "Error"); } START_TEST(test_custom_noerror) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; struct ini_validator *noerror[] = { &(struct ini_validator){ "custom_noerror", custom_noerror, NULL }, NULL }; struct ini_validator *missing_name[] = { &(struct ini_validator){ NULL, custom_noerror, NULL }, &(struct ini_validator){ "custom_noerror", custom_noerror, NULL }, NULL }; char input_rules[] = "[rule/custom_succeed]\n" "validator = custom_noerror\n"; char input_cfg[] = "[section]\n" "# Content of this file should not matter\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); /* Pass the custom validator to ini_rules_check() */ ret = ini_rules_check(rules_obj, cfg_obj, noerror, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate no errors */ fail_unless(ini_errobj_no_more_msgs(errobj)); /* Pass wrong external validator to ini_rules_check() */ /* It should be skipped */ ret = ini_rules_check(rules_obj, cfg_obj, missing_name, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate no errors */ fail_unless(ini_errobj_no_more_msgs(errobj), "%s", ini_errobj_get_msg(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_custom_error) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; struct ini_validator *error[] = { &(struct ini_validator){ "custom_error", custom_error, NULL }, NULL }; struct ini_validator *missing_function[] = { &(struct ini_validator){ "custom_noerror", NULL, NULL }, NULL }; const char *errmsg; char input_rules[] = "[rule/custom_error]\n" "validator = custom_error\n"; char input_cfg[] = "[section]\n" "# Content of this file should not matter\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); /* Pass the custom validator to ini_rules_check() */ ret = ini_rules_check(rules_obj, cfg_obj, error, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate one error */ fail_if(ini_errobj_no_more_msgs(errobj)); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/custom_error]: Error"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); /* Pass the custom validator to ini_rules_check() */ ret = ini_rules_check(rules_obj, cfg_obj, missing_function, errobj); /* Should generate one error for missing validator */ fail_if(ini_errobj_no_more_msgs(errobj)); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/custom_error' uses unknown validator " "'custom_error'."); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); ini_config_destroy(cfg_obj); } END_TEST START_TEST(test_ini_allowed_options_ok) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/options_for_foo]\n" "validator = ini_allowed_options\n" "section_re = ^foo$\n" "option = bar\n" "option = baz\n"; /* Should check only foo section, other sections are * irrelevant and can contain any option */ char input_cfg[] = "[foo]\n" "bar = 0\n" "baz = 0\n" "[oof]\n" "opt1 = 1\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate no errors */ fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_options_no_section) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; size_t num_err; const char *errmsg; /* Ommit section_re to generate error */ char input_rules[] = "[rule/options_for_foo]\n" "validator = ini_allowed_options\n" /* "section_re = ^foo$\n" */ "option = bar\n" "option = baz\n"; /* section_re without value */ char input_rules2[] = "[rule/options_for_foo]\n" "validator = ini_allowed_options\n" "section_re = \n" "option = bar\n" "option = baz\n"; /* Make 4 typos */ char input_cfg[] = "[foo]\n" "bar = 0\n" "baz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors (one from rules_check and one * from the validator itself) */ fail_if(ini_errobj_no_more_msgs(errobj)); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/options_for_foo' returned error code '22'"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/options_for_foo]: Validator misses 'section_re' " "parameter"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); /* the second test with missing value for section_re */ create_rules_from_str(input_rules2, &rules_obj); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors (one from rules_check and one * from the validator itself) */ fail_if(ini_errobj_no_more_msgs(errobj)); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/options_for_foo' returned error code '22'"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/options_for_foo]: Validator misses 'section_re' " "parameter"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); ini_config_destroy(cfg_obj); } END_TEST START_TEST(test_ini_allowed_options_wrong_regex) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; size_t num_err; const char *errmsg; /* Ommit section_re to generate error */ char input_rules[] = "[rule/options_for_foo]\n" "validator = ini_allowed_options\n" "section_re = ^foo[$\n" "option = bar\n" "option = baz\n"; /* Make 4 typos */ char input_cfg[] = "[foo]\n" "bar = 0\n" "baz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors (one from rules_check and one * from the validator itself) */ fail_if(ini_errobj_no_more_msgs(errobj)); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/options_for_foo' returned error code '22'"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); /* Different versions of libc produce slightly different error strings * in this case. For simplicity compare against all of them. */ errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/options_for_foo]: Cannot compile regular expression " "from option 'section_re'. " "Error: 'Unmatched [ or [^'"); if (ret != 0) { ret = strcmp(errmsg, "[rule/options_for_foo]: Cannot compile regular " "expression from option 'section_re'. " "Error: 'brackets ([ ]) not balanced'"); } if (ret != 0) { ret = strcmp(errmsg, "[rule/options_for_foo]: Cannot compile regular " "expression from option 'section_re'. " "Error: 'Unmatched [, [^, [:, [., or [='"); } fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_options_typos) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; size_t num_err; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/options_for_foo]\n" "validator = ini_allowed_options\n" "section_re = ^foo$\n" "option = bar\n" "option = baz\n"; /* Make 4 typos */ char input_cfg[] = "[foo]\n" "br = 0\n" "bra = 0\n" "abr = 0\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 4 errors */ fail_if(ini_errobj_no_more_msgs(errobj)); num_err = ini_errobj_count(errobj); fail_unless(num_err == 4, "Expected 4 errors, got %d", num_err); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_str_ok) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "section = foo\n" "section = bar\n"; /* Make 4 typos */ char input_cfg[] = "[foo]\n" "br = 0\n" "bra = 0\n" "[bar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 0 errors */ fail_unless(ini_errobj_no_more_msgs(errobj), "Unexpected errors found: [%s]", ini_errobj_get_msg(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_str_typos) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int num_err; int ret; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "section = foo\n" "section = bar\n"; /* Make 4 typos */ char input_cfg[] = "[fooo]\n" "br = 0\n" "bra = 0\n" "[baar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors */ fail_if(ini_errobj_no_more_msgs(errobj), "Expected 2 errors but none found"); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_str_insensitive) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; int i; /* Only bar and baz are allowed for foo section */ char input_rules_template[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "case_insensitive = %s\n" "section = foo\n" "section = bar\n"; char input_rules[sizeof(input_rules_template) + 10]; const char *case_insensitive_values[] = { "yes", "Yes", "true", "True", "1", NULL }; /* Make 4 typos */ char input_cfg[] = "[FOo]\n" "br = 0\n" "bra = 0\n" "[baR]\n" "abz = 0\n"; cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); for (i = 0; case_insensitive_values[i] != NULL; i++) { sprintf(input_rules, input_rules_template, case_insensitive_values[i]); create_rules_from_str(input_rules, &rules_obj); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed for case_insensitive = %s: %s", case_insensitive_values[i], strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed for case_insensitive = %s: %s", case_insensitive_values[i], strerror(ret)); /* Should generate 0 errors */ fail_unless(ini_errobj_no_more_msgs(errobj), "Unexpected errors found for case_insensitive = %s: [%s]", case_insensitive_values[i], ini_errobj_get_msg(errobj)); ini_errobj_destroy(&errobj); ini_rules_destroy(rules_obj); } ini_config_destroy(cfg_obj); } END_TEST START_TEST(test_ini_allowed_sections_re_ok) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "section_re = ^foo*$\n" "section_re = bar\n"; char input_cfg[] = "[foooooooooooo]\n" "br = 0\n" "bra = 0\n" "[my_bar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 0 errors */ fail_unless(ini_errobj_no_more_msgs(errobj), "Unexpected errors found"); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_re_typos) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int num_err; int ret; char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "section_re = ^foo*$\n" "section_re = bar\n"; /* Make 4 typos */ char input_cfg[] = "[fooooooOooooo]\n" "br = 0\n" "bra = 0\n" "[my_bra]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors */ fail_if(ini_errobj_no_more_msgs(errobj), "Expected 2 errors but none found"); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_re_insensitive) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int ret; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "case_insensitive = yes\n" "section_re = ^foo*$\n" "section_re = bar\n"; /* Make 4 typos */ char input_cfg[] = "[FOoOoOoOoOOOOooo]\n" "br = 0\n" "bra = 0\n" "[my_Bar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 0 errors */ fail_unless(ini_errobj_no_more_msgs(errobj), "Unexpected errors found"); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_missing_section) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int num_err; int ret; const char *errmsg; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n"; /* Make 4 typos */ char input_cfg[] = "[fooo]\n" "br = 0\n" "bra = 0\n" "[baar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 1 errors */ fail_if(ini_errobj_no_more_msgs(errobj), "Expected 1 errors but none found"); num_err = ini_errobj_count(errobj); fail_unless(num_err == 1, "Expected 1 errors, got %d", num_err); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/section_list]: No allowed sections specified. " "Use 'section = default' to allow only default section"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST START_TEST(test_ini_allowed_sections_wrong_regex) { struct ini_cfgobj *rules_obj; struct ini_cfgobj *cfg_obj; struct ini_errobj *errobj; int num_err; int ret; const char *errmsg; /* Only bar and baz are allowed for foo section */ char input_rules[] = "[rule/section_list]\n" "validator = ini_allowed_sections\n" "section_re = ^foo\\(*$\n"; /* Make 4 typos */ char input_cfg[] = "[fooo]\n" "br = 0\n" "bra = 0\n" "[baar]\n" "abz = 0\n"; create_rules_from_str(input_rules, &rules_obj); cfg_obj = get_ini_config_from_str(input_cfg, sizeof(input_cfg)); ret = ini_errobj_create(&errobj); fail_unless(ret == 0, "ini_errobj_create() failed: %s", strerror(ret)); ret = ini_rules_check(rules_obj, cfg_obj, NULL, errobj); fail_unless(ret == 0, "ini_rules_check() failed: %s", strerror(ret)); /* Should generate 2 errors */ fail_if(ini_errobj_no_more_msgs(errobj), "Expected 2 errors but none found"); num_err = ini_errobj_count(errobj); fail_unless(num_err == 2, "Expected 2 errors, got %d", num_err); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "Rule 'rule/section_list' returned error code '22'"); fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); errmsg = ini_errobj_get_msg(errobj); ret = strcmp(errmsg, "[rule/section_list]: Validator failed to use regex " "[^foo\\(*$]:[Unmatched ( or \\(]"); if (ret !=0) { ret = strcmp(errmsg, "[rule/section_list]: Validator failed to use regex " "[^foo\\(*$]:[parentheses not balanced]"); } fail_unless(ret == 0, "Got msg: [%s]", errmsg); ini_errobj_next(errobj); fail_unless(ini_errobj_no_more_msgs(errobj)); ini_errobj_destroy(&errobj); ini_config_destroy(cfg_obj); ini_rules_destroy(rules_obj); } END_TEST static Suite *ini_validators_utils_suite(void) { Suite *s = suite_create("ini_validators"); TCase *tc_infrastructure = tcase_create("infrastructure"); tcase_add_test(tc_infrastructure, test_ini_errobj); tcase_add_test(tc_infrastructure, test_ini_noerror); tcase_add_test(tc_infrastructure, test_ini_error); tcase_add_test(tc_infrastructure, test_unknown_validator); tcase_add_test(tc_infrastructure, test_custom_noerror); tcase_add_test(tc_infrastructure, test_custom_error); TCase *tc_allowed_options = tcase_create("ini_allowed_options"); tcase_add_test(tc_allowed_options, test_ini_allowed_options_ok); tcase_add_test(tc_allowed_options, test_ini_allowed_options_no_section); tcase_add_test(tc_allowed_options, test_ini_allowed_options_wrong_regex); tcase_add_test(tc_allowed_options, test_ini_allowed_options_typos); TCase *tc_allowed_sections = tcase_create("ini_allowed_sections"); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_str_ok); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_str_typos); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_str_insensitive); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_re_ok); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_re_typos); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_re_insensitive); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_missing_section); tcase_add_test(tc_allowed_sections, test_ini_allowed_sections_wrong_regex); suite_add_tcase(s, tc_infrastructure); suite_add_tcase(s, tc_allowed_options); suite_add_tcase(s, tc_allowed_sections); return s; } int main(void) { int number_failed; Suite *s = ini_validators_utils_suite(); SRunner *sr = srunner_create(s); /* If CK_VERBOSITY is set, use that, otherwise it defaults to CK_NORMAL */ srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/ini/ini_valueobj.c000066400000000000000000000762701417260640400170000ustar00rootroot00000000000000/* INI LIBRARY Module represents interface to the value object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #include "config.h" #include #include #include #include #include "simplebuffer.h" #include "ref_array.h" #include "ini_comment.h" #include "ini_defines.h" #include "ini_valueobj.h" #include "trace.h" struct value_obj { struct ref_array *raw_lines; struct ref_array *raw_lengths; struct simplebuffer *unfolded; uint32_t origin; uint32_t line; uint32_t keylen; uint32_t boundary; struct ini_comment *ic; }; /* The length of " =" which is 3 */ #define INI_FOLDING_OVERHEAD 3 /* Array growth */ #define INI_ARRAY_GROW 2 /* Equal sign */ #define INI_EQUAL_SIGN " = " #define INI_OPEN_BR "[" #define INI_CLOSE_BR "]" /* Unfold the value represented by the array */ static int value_unfold(struct ref_array *raw_lines, struct ref_array *raw_lengths, struct simplebuffer **unfolded) { int error; struct simplebuffer *oneline = NULL; uint32_t len = 0; char *ptr = NULL; uint32_t i = 0; char *part = NULL; TRACE_FLOW_ENTRY(); error = simplebuffer_alloc(&oneline); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } for (;;) { /* Get line */ ptr = ref_array_get(raw_lines, i, NULL); if (ptr) { /* Get its length */ ref_array_get(raw_lengths, i, (void *)&len); part = *((char **)(ptr)); TRACE_INFO_STRING("Value:", part); TRACE_INFO_NUMBER("Lenght:", len); error = simplebuffer_add_raw(oneline, part, len, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add string", error); simplebuffer_free(oneline); return error; } i++; } else break; } *unfolded = oneline; TRACE_FLOW_EXIT(); return error; } static int save_portion(struct ref_array *raw_lines, struct ref_array *raw_lengths, const char* buf, uint32_t len) { int error = EOK; char *copy = NULL; uint32_t adj = 0; TRACE_FLOW_ENTRY(); /* Add leading space only if there is * a) no space * b) it is not an empty line * c) it is now a first line */ if ((buf[0] != ' ') && (buf[0] != '\t') && (len != 0) && (ref_array_len(raw_lines) != 0)) adj = 1; copy = malloc(len + adj + 1); if (!copy) { TRACE_ERROR_NUMBER("Failed to allocate memory", ENOMEM); return ENOMEM; } memcpy(copy + adj, buf, len); len += adj; copy[len] = 0; /* If the section being saved is not starting * with space add a space. */ if (adj) copy[0] = ' '; error = ref_array_append(raw_lines, (void *)(©)); if (error) { TRACE_ERROR_NUMBER("Failed to append line", error); free(copy); return error; } error = ref_array_append(raw_lengths, (void *)(&len)); if (error) { TRACE_ERROR_NUMBER("Failed to append length", error); return error; } TRACE_INFO_STRING("Added string:", (char *)copy); TRACE_INFO_NUMBER("Added number:", len); TRACE_FLOW_EXIT(); return EOK; } /* Function to create a folded value out of the unfolded string */ static int value_fold(struct simplebuffer *unfolded, uint32_t key_len, uint32_t fold_bound, struct ref_array *raw_lines, struct ref_array *raw_lengths) { int error = EOK; const char *buf; uint32_t len = 0; /* Full length of the buffer */ uint32_t fold_place = 0; /* Potential folding place */ uint32_t best_place = 0; /* Dynamic folding boundary */ uint32_t next_place = 0; /* Position of the found space */ uint32_t fold_len = 0; /* Determined length of the substring */ uint32_t idx = 0; /* Counter of lines */ uint32_t i = 0; /* Internal counter */ uint32_t resume_place = 0; /* Place we resume parsing */ uint32_t start_place = 0; /* Start of the string */ int done = 0; /* Are we done? */ TRACE_FLOW_ENTRY(); /* Reset arrays */ ref_array_reset(raw_lines); ref_array_reset(raw_lengths); /* Get the buffer info */ len = simplebuffer_get_len(unfolded); if (!len) { /* Nothing to fold */ TRACE_FLOW_EXIT(); return EOK; } buf = (const char *)simplebuffer_get_buf(unfolded); TRACE_INFO_STRING("Unfolded value:", buf); /* Make sure that we have at least one character to fold */ if (fold_bound == 0) fold_bound++; while (!done) { /* Determine the max length of the line */ if (idx == 0) { if (fold_bound > (key_len + INI_FOLDING_OVERHEAD)) { best_place = fold_bound - key_len - INI_FOLDING_OVERHEAD; } else best_place = 0; } else { best_place = fold_bound; /* Starting with the second line if we plan * to add space ourselves factor it into folding * boadary */ if ((buf[start_place] != ' ') && (buf[start_place] != '\t')) best_place--; } TRACE_INFO_NUMBER("Best place", best_place); fold_place = start_place; next_place = start_place; best_place += start_place; /* Parse the buffer from the right place */ for (i = resume_place; i <= len; i++) { /* Check for folding opportunity */ if (i == len) { next_place = i; done = 1; } /* * Fold if we found the separator or the first line * is too long right away */ else if (((!((best_place > 0) && (idx == 0) && (i == 0))) && ((buf[i] == ' ') || (buf[i] == '\t'))) || ((best_place == 0) && (i == 0))) { next_place = i; TRACE_INFO_NUMBER("Next place:", next_place); } else continue; if ((next_place > best_place) || (next_place == 0)) { if ((fold_place == start_place) && (next_place != 0)) { /* Our first found folding place * is already after the preferred * folding place. Time to fold then... */ fold_len = next_place - start_place; } else { /* We will use the previous * folding place. */ fold_len = fold_place - start_place; } TRACE_INFO_NUMBER("Fold len:", fold_len); error = save_portion(raw_lines, raw_lengths, buf + start_place, fold_len); if (error) { TRACE_ERROR_NUMBER("Failed to save", error); return error; } start_place += fold_len; /* * This will force the re-processing * of the same space but it is * helpful in case the middle portion * of the value is beyond our folding limit. */ resume_place = next_place; if (fold_len == 0) resume_place++; idx++; break; } else { /* Case when next_place <= best_place */ fold_place = next_place; } } /* Save last portion */ if (done) { if (next_place - start_place) { error = save_portion(raw_lines, raw_lengths, buf + start_place, next_place - start_place); if (error) { TRACE_ERROR_NUMBER("Failed to save last chunk", error); return error; } idx++; } } } TRACE_FLOW_EXIT(); return error; } static int trim_last(struct value_obj *vo) { int error = EOK; uint32_t last = 0; uint32_t len = 0; uint32_t idx = 0; char *ptr = NULL; char *part = NULL; TRACE_FLOW_ENTRY(); last = ref_array_len(vo->raw_lengths); if (last) { last--; ref_array_get(vo->raw_lengths, last, (void *)&len); if (len) { ptr = ref_array_get(vo->raw_lines, last, NULL); if (ptr) { part = *((char **)ptr); TRACE_INFO_STRING("Value", part); TRACE_INFO_NUMBER("Length", len); idx = len - 1; TRACE_INFO_NUMBER("Start index", idx); while((idx) && (isspace(part[idx]))) idx--; if (idx != len - 1) { TRACE_INFO_NUMBER("End index", idx); len = idx + 1; error = ref_array_replace(vo->raw_lengths, last, (void *)&len); if (error) { TRACE_ERROR_NUMBER("Failed to update length", error); return error; } } } } } TRACE_FLOW_EXIT(); return error; } /* Create value from a referenced array */ int value_create_from_refarray(struct ref_array *raw_lines, struct ref_array *raw_lengths, uint32_t line, uint32_t origin, uint32_t key_len, uint32_t boundary, struct ini_comment *ic, struct value_obj **vo) { int error = EOK; struct value_obj *new_vo = NULL; TRACE_FLOW_ENTRY(); if ((!raw_lines) || (!raw_lengths) || (!vo)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } new_vo = malloc(sizeof(struct value_obj)); if (!new_vo) { TRACE_ERROR_NUMBER("No memory", ENOMEM); return ENOMEM; } /* We are not using references here since * it will be inconsistent with the way * how comment is handled. * We could have added references here and make * comment keep references but it seems to be * and overhead in this case. */ new_vo->raw_lines = raw_lines; new_vo->raw_lengths = raw_lengths; new_vo->origin = origin; new_vo->line = line; new_vo->keylen = key_len; new_vo->boundary = boundary; new_vo->ic = ic; /* Last line might have spaces at the end, trim them */ error = trim_last(new_vo); if (error) { TRACE_ERROR_NUMBER("Failed to trim last", error); value_destroy(new_vo); return error; } error = value_unfold(new_vo->raw_lines, new_vo->raw_lengths, &(new_vo->unfolded)); if (error) { TRACE_ERROR_NUMBER("Failed to unfold", error); value_destroy(new_vo); return error; } TRACE_INFO_STRING("Unfolded:", (const char *)simplebuffer_get_buf(new_vo->unfolded)); *vo = new_vo; TRACE_FLOW_EXIT(); return error; } /* Cleanup callback for lines array */ void value_lines_cleanup_cb(void *elem, ref_array_del_enum type, void *data) { char *part; TRACE_FLOW_ENTRY(); part = *((char **)(elem)); TRACE_INFO_STRING("Freeing:", part); free(part); TRACE_FLOW_EXIT(); } /* Create a pair of arrays */ int value_create_arrays(struct ref_array **raw_lines, struct ref_array **raw_lengths) { int error = EOK; struct ref_array *new_lines = NULL; struct ref_array *new_lengths = NULL; TRACE_FLOW_ENTRY(); error = ref_array_create(&new_lines, sizeof(char *), INI_ARRAY_GROW, value_lines_cleanup_cb, NULL); if (error) { TRACE_ERROR_NUMBER("Failed to create lines array", error); return error; } error = ref_array_create(&new_lengths, sizeof(uint32_t), INI_ARRAY_GROW, NULL, NULL); if (error) { TRACE_ERROR_NUMBER("Failed to create lengths array", error); ref_array_destroy(new_lines); return error; } *raw_lines = new_lines; *raw_lengths = new_lengths; TRACE_FLOW_EXIT(); return EOK; } /* Add a raw string to the arrays */ int value_add_to_arrays(const char *strvalue, uint32_t len, struct ref_array *raw_lines, struct ref_array *raw_lengths) { int error = EOK; TRACE_FLOW_ENTRY(); error = ref_array_append(raw_lines, (void *)(&strvalue)); if (error) { TRACE_ERROR_NUMBER("Failed to add to lines array", error); return error; } error = ref_array_append(raw_lengths, (void *)(&len)); if (error) { TRACE_ERROR_NUMBER("Failed to add to lengths array", error); return error; } TRACE_FLOW_EXIT(); return error; } /* Destroy arrays */ void value_destroy_arrays(struct ref_array *raw_lines, struct ref_array *raw_lengths) { TRACE_FLOW_ENTRY(); /* Function checks validity inside */ ref_array_destroy(raw_lines); /* Function checks validity inside */ ref_array_destroy(raw_lengths); TRACE_FLOW_EXIT(); } /* Destroy a value object */ void value_destroy(struct value_obj *vo) { TRACE_FLOW_ENTRY(); if (vo) { /* Free arrays if any */ value_destroy_arrays(vo->raw_lines, vo->raw_lengths); /* Free the simple buffer if any */ simplebuffer_free(vo->unfolded); /* Function checks validity inside */ ini_comment_destroy(vo->ic); free(vo); } TRACE_FLOW_EXIT(); } /* Create value object from string buffer */ int value_create_new(const char *strvalue, uint32_t length, uint32_t origin, uint32_t key_len, uint32_t boundary, struct ini_comment *ic, struct value_obj **vo) { int error = EOK; struct value_obj *new_vo = NULL; struct simplebuffer *oneline = NULL; TRACE_FLOW_ENTRY(); if ((!strvalue) || (!vo)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Create buffer to hold the value */ error = simplebuffer_alloc(&oneline); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } /* Put value into the buffer */ error = simplebuffer_add_str(oneline, strvalue, length, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add string", error); simplebuffer_free(oneline); return error; } /* Acllocate new INI value structure */ new_vo = malloc(sizeof(struct value_obj)); if (!new_vo) { TRACE_ERROR_NUMBER("No memory", ENOMEM); simplebuffer_free(oneline); return ENOMEM; } new_vo->origin = origin; /* Line is not known in this case */ new_vo->line = 0; new_vo->ic = ic; new_vo->unfolded = oneline; new_vo->keylen = key_len; new_vo->boundary = boundary; new_vo->raw_lines = NULL; new_vo->raw_lengths = NULL; error = value_create_arrays(&(new_vo->raw_lines), &(new_vo->raw_lengths)); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); value_destroy(new_vo); return error; } /* Create arrays by folding the value */ error = value_fold(new_vo->unfolded, new_vo->keylen, new_vo->boundary, new_vo->raw_lines, new_vo->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); value_destroy(new_vo); return error; } *vo = new_vo; TRACE_FLOW_EXIT(); return error; } /* Create a copy of the value */ int value_copy(struct value_obj *vo, struct value_obj **copy_vo) { int error = EOK; struct value_obj *new_vo = NULL; struct simplebuffer *oneline = NULL; TRACE_FLOW_ENTRY(); if ((!copy_vo) || (!vo)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Create buffer to hold the value */ error = simplebuffer_alloc(&oneline); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } /* Put value into the buffer */ error = simplebuffer_add_str(oneline, (const char *)simplebuffer_get_buf(vo->unfolded), simplebuffer_get_len(vo->unfolded), INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add string", error); simplebuffer_free(oneline); return error; } /* Acllocate new INI value structure */ new_vo = malloc(sizeof(struct value_obj)); if (!new_vo) { TRACE_ERROR_NUMBER("No memory", ENOMEM); simplebuffer_free(oneline); return ENOMEM; } new_vo->origin = vo->origin; new_vo->line = vo->line; new_vo->unfolded = oneline; new_vo->keylen = vo->keylen; new_vo->boundary = vo->boundary; new_vo->raw_lines = NULL; new_vo->raw_lengths = NULL; new_vo->ic = NULL; error = value_create_arrays(&(new_vo->raw_lines), &(new_vo->raw_lengths)); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); value_destroy(new_vo); return error; } /* Create arrays by folding the value */ error = value_fold(new_vo->unfolded, new_vo->keylen, new_vo->boundary, new_vo->raw_lines, new_vo->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); value_destroy(new_vo); return error; } /* Copy comment */ if (vo->ic) { error = ini_comment_copy(vo->ic, &new_vo->ic); if (error) { TRACE_ERROR_NUMBER("Failed to copy comment", error); value_destroy(new_vo); return error; } } *copy_vo = new_vo; TRACE_INFO_STRING("Orig value:", (const char *)simplebuffer_get_buf(vo->unfolded)); TRACE_INFO_STRING("Copy value:", (const char *)simplebuffer_get_buf(new_vo->unfolded)); TRACE_INFO_NUMBER("Orig value num lines:", ref_array_len(vo->raw_lengths)); TRACE_INFO_NUMBER("Copy value num lines:", ref_array_len(new_vo->raw_lengths)); TRACE_FLOW_EXIT(); return error; } /* Get concatenated value */ int value_get_concatenated(struct value_obj *vo, const char **fullstr) { TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } if (!fullstr) { TRACE_ERROR_NUMBER("Invalid output value", EINVAL); return EINVAL; } *fullstr = (const char *)simplebuffer_get_buf(vo->unfolded); TRACE_FLOW_EXIT(); return EOK; } /* Get length of the concatenated value */ int value_get_concatenated_len(struct value_obj *vo, uint32_t *len) { TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } if (!len) { TRACE_ERROR_NUMBER("Invalid output value", EINVAL); return EINVAL; } *len = simplebuffer_get_len(vo->unfolded); TRACE_FLOW_EXIT(); return EOK; } /* Get value's origin */ int value_get_origin(struct value_obj *vo, uint32_t *origin) { TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } if (!origin) { TRACE_ERROR_NUMBER("Invalid output value", EINVAL); return EINVAL; } *origin = vo->origin; TRACE_FLOW_EXIT(); return EOK; } /* Get value's line */ int value_get_line(struct value_obj *vo, uint32_t *line) { TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } if (!line) { TRACE_ERROR_NUMBER("Invalid output value", EINVAL); return EINVAL; } *line = vo->line; TRACE_FLOW_EXIT(); return EOK; } /* Update key length */ int value_set_keylen(struct value_obj *vo, uint32_t key_len) { int error = EOK; TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } vo->keylen = key_len; /* Fold in new value */ error = value_fold(vo->unfolded, vo->keylen, vo->boundary, vo->raw_lines, vo->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); /* In this case nothing to free here but * the object might be unsiable */ return error; } TRACE_FLOW_EXIT(); return EOK; } /* Change boundary */ int value_set_boundary(struct value_obj *vo, uint32_t boundary) { int error = EOK; TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid object", EINVAL); return EINVAL; } vo->boundary = boundary; /* Fold in new value */ error = value_fold(vo->unfolded, vo->keylen, vo->boundary, vo->raw_lines, vo->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); /* In this case nothing to free here but * the object might be unusable */ return error; } TRACE_FLOW_EXIT(); return EOK; } /* Update value */ int value_update(struct value_obj *vo, const char *value, uint32_t length, uint32_t origin, uint32_t boundary) { int error = EOK; struct simplebuffer *oneline = NULL; if ((!value) || (!vo)) { TRACE_ERROR_NUMBER("Invalid argument", EINVAL); return EINVAL; } /* Create buffer to hold the value */ error = simplebuffer_alloc(&oneline); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } /* Put value into the buffer */ error = simplebuffer_add_str(oneline, value, length, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add string", error); simplebuffer_free(oneline); return error; } simplebuffer_free(vo->unfolded); vo->origin = origin; vo->unfolded = oneline; vo->boundary = boundary; /* Fold in new value */ error = value_fold(vo->unfolded, vo->keylen, vo->boundary, vo->raw_lines, vo->raw_lengths); if (error) { TRACE_ERROR_NUMBER("Failed to fold", error); /* In this case nothing to free here but * the object might be unsiable */ return error; } TRACE_FLOW_EXIT(); return error; } /* Get comment from the value */ int value_extract_comment(struct value_obj *vo, struct ini_comment **ic) { int error = EOK; TRACE_FLOW_ENTRY(); if ((!vo) || (!ic)) { TRACE_ERROR_NUMBER("Invalid input parameter", EINVAL); return EINVAL; } *ic = vo->ic; vo->ic = NULL; TRACE_FLOW_EXIT(); return error; } /* Set comment into the value */ int value_put_comment(struct value_obj *vo, struct ini_comment *ic) { int error = EOK; TRACE_FLOW_ENTRY(); if (!vo) { TRACE_ERROR_NUMBER("Invalid input parameter", EINVAL); return EINVAL; } if (vo->ic != ic) { /* Remove existing comment if any */ ini_comment_destroy(vo->ic); } vo->ic = ic; TRACE_FLOW_EXIT(); return error; } /* Serialize value */ int value_serialize(struct value_obj *vo, const char *key, struct simplebuffer *sbobj) { int error = EOK; uint32_t i = 0; uint32_t len = 0; char *ptr = NULL; char *part = NULL; int sec = 0; uint32_t vln = 0; TRACE_FLOW_ENTRY(); TRACE_INFO_STRING("Serializing key:", key); if (!vo) { TRACE_ERROR_NUMBER("Invalid input parameter", EINVAL); return EINVAL; } /* Put comment first */ if (vo->ic) { error = ini_comment_serialize(vo->ic, sbobj); if (error) { TRACE_ERROR_NUMBER("Failed serialize comment", error); return error; } } /* Handle the case it is a section key */ if (strncmp(key, INI_SECTION_KEY, sizeof(INI_SECTION_KEY)) == 0) sec = 1; if (sec) { error = simplebuffer_add_str(sbobj, INI_OPEN_BR, sizeof(INI_OPEN_BR) - 1, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add opening section bracket", error); return error; } } else { error = simplebuffer_add_str(sbobj, key, vo->keylen, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add key", error); return error; } error = simplebuffer_add_str(sbobj, INI_EQUAL_SIGN, sizeof(INI_EQUAL_SIGN) - 1, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add equal sign", error); return error; } } if (vo->raw_lines) { vln = ref_array_len(vo->raw_lines); TRACE_INFO_NUMBER("Number of lines:", vln); #ifdef HAVE_TRACE ref_array_debug(vo->raw_lines, 0); ref_array_debug(vo->raw_lengths, 1); #endif for (i = 0; i < vln; i++) { /* Get line */ ptr = ref_array_get(vo->raw_lines, i, NULL); if (ptr) { /* Get its length */ len = 0; ref_array_get(vo->raw_lengths, i, (void *)&len); part = *((char **)(ptr)); TRACE_INFO_STRING("Value:", part); TRACE_INFO_NUMBER("Lenght:", len); error = simplebuffer_add_raw(sbobj, part, len, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add value", error); return error; } } if (!sec) { error = simplebuffer_add_cr(sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to add CR", error); return error; } } } if ((!vln) && (!sec)) { error = simplebuffer_add_cr(sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to add CR", error); return error; } } } if (sec) { error = simplebuffer_add_str(sbobj, INI_CLOSE_BR, sizeof(INI_CLOSE_BR) - 1, INI_VALUE_BLOCK); if (error) { TRACE_ERROR_NUMBER("Failed to add closing bracket", error); return error; } error = simplebuffer_add_cr(sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to add CR", error); return error; } } TRACE_INFO_STRING("Buffer:", (const char *)simplebuffer_get_buf(sbobj)); TRACE_FLOW_EXIT(); return error; } /* Merge comment from one value into another */ int value_merge_comment(struct value_obj *vo_donor, struct value_obj *vo) { int error = EOK; TRACE_FLOW_ENTRY(); if ((!vo) || (!vo_donor)) { TRACE_ERROR_NUMBER("Invalid input parameter", EINVAL); return EINVAL; } if (vo_donor->ic) { /* If there is something to add */ if (vo->ic) { /* Merge comments if both present */ error = ini_comment_add(vo_donor->ic, vo->ic); if (error) { TRACE_ERROR_NUMBER("Failed to merge the comment", error); return error; } } else { /* Copy comment if only donor present */ error = ini_comment_copy(vo_donor->ic, &(vo->ic)); if (error) { TRACE_ERROR_NUMBER("Failed to merge the comment", error); return error; } } } TRACE_FLOW_EXIT(); return error; } /* Print value */ void value_print(const char *key, struct value_obj *vo) { int error = EOK; struct simplebuffer *sbobj = NULL; TRACE_FLOW_ENTRY(); error = simplebuffer_alloc(&sbobj); if (error) { printf("Failed to allocate dynamic string %d.\n", error); return; } /* Serialize */ error = value_serialize(vo, key, sbobj); if (error) { printf("Failed to serialize a value object %d.\n", error); simplebuffer_free(sbobj); return; } printf("%s", simplebuffer_get_buf(sbobj)); simplebuffer_free(sbobj); TRACE_FLOW_EXIT(); } ding-libs-0.6.2/ini/ini_valueobj.h000066400000000000000000000112521417260640400167720ustar00rootroot00000000000000/* INI LIBRARY Header file for the value object. Copyright (C) Dmitri Pal 2010 INI Library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. INI Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with INI Library. If not, see . */ #ifndef INI_VALUEOBJ_H #define INI_VALUEOBJ_H #include "ref_array.h" #include "simplebuffer.h" #include "ini_comment.h" struct value_obj; #define INI_VALUE_READ 0 /* Value is read from the file */ #define INI_VALUE_CREATED 1 /* Value is created in memory */ /* * Create value from a referenced array. * * NOTE: arrays and comment are NOT treated as * objects that keep reference count. * They are created externally and passed in * as separate parts that are glued together * by the value object. * The caller should not free it himself * (only in case of failure) since * after the call the arrays and comment * are owned by the value object and will * be freed when it is destroyed. */ int value_create_from_refarray(struct ref_array *raw_lines, struct ref_array *raw_lengths, uint32_t line, uint32_t origin, uint32_t key_len, uint32_t boundary, struct ini_comment *ic, struct value_obj **vo); /* Cleanup callback for lines array */ void value_lines_cleanup_cb(void *elem, ref_array_del_enum type, void *data); /* Create a pair of arrays */ int value_create_arrays(struct ref_array **raw_lines, struct ref_array **raw_lengths); /* Add a raw read line to the arrays */ int value_add_to_arrays(const char *strvalue, uint32_t len, struct ref_array *raw_lines, struct ref_array *raw_lengths); /* Create a pair of arrays */ void value_destroy_arrays(struct ref_array *raw_lines, struct ref_array *raw_lengths); /* Create value object from string buffer. * NOTE: see note above * in the description of the * value_create_from_refarray function. */ int value_create_new(const char *strvalue, uint32_t length, uint32_t origin, uint32_t key_len, uint32_t boundary, struct ini_comment *ic, struct value_obj **vo); /* Create a copy of the value */ int value_copy(struct value_obj *vo, struct value_obj **copy_vo); /* Destroy a value object */ void value_destroy(struct value_obj *vo); /* Get concatenated value */ int value_get_concatenated(struct value_obj *vo, const char **fullstr); /* Get length of the concatenated value */ int value_get_concatenated_len(struct value_obj *vo, uint32_t *len); /* Get value's origin */ int value_get_origin(struct value_obj *vo, uint32_t *origin); /* Get value's line */ int value_get_line(struct value_obj *vo, uint32_t *line); /* Update key length */ int value_set_keylen(struct value_obj *vo, uint32_t key_len); /* Change boundary */ int value_set_boundary(struct value_obj *vo, uint32_t boundary); /* Update value */ int value_update(struct value_obj *vo, const char *value, uint32_t length, uint32_t origin, uint32_t boundary); /* Get comment from the value */ int value_extract_comment(struct value_obj *vo, struct ini_comment **ic); /* Set comment into the value */ int value_put_comment(struct value_obj *vo, struct ini_comment *ic); /* Merge comment from one value into another */ int value_merge_comment(struct value_obj *vo_donor, struct value_obj *vo); /* Serialize value */ int value_serialize(struct value_obj *vo, const char *key, struct simplebuffer *sbobj); /* Print value */ void value_print(const char *key, struct value_obj *vo); #endif ding-libs-0.6.2/ini/ini_valueobj_ut.c000066400000000000000000000456621417260640400175110ustar00rootroot00000000000000/* INI LIBRARY Unit test for the value object. Copyright (C) Dmitri Pal 2010 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 . */ #include "config.h" #include /* for errors */ #include #include #include #include #include #include "ini_valueobj.h" #include "ini_defines.h" #define TRACE_HOME #include "trace.h" #define TEST_SIZE 80 int verbose = 0; #define VOOUT(foo) \ do { \ if (verbose) foo; \ } while(0) typedef int (*test_fn)(void); static int create_comment(int i, struct ini_comment **ic) { int error = EOK; const char *template = ";Line 0 of the value %d"; char comment[TEST_SIZE]; struct ini_comment *new_ic = NULL; TRACE_FLOW_ENTRY(); snprintf(comment, TEST_SIZE, template, i); if ((error = ini_comment_create(&new_ic)) || (error = ini_comment_build(new_ic, comment)) || (error = ini_comment_build(new_ic, NULL)) || (error = ini_comment_build(new_ic, "#This is the second line")) || (error = ini_comment_build(new_ic, ";This is the third line")) || (error = ini_comment_build(new_ic, ""))) { printf("Failed to create comment object. Error %d.\n", error); ini_comment_destroy(new_ic); return -1; } *ic = new_ic; TRACE_FLOW_EXIT(); return EOK; } /* Save value to the file */ /* NOTE: might be moved into the API in future */ static int save_value(FILE *ff, const char *key, struct value_obj *vo) { int error = EOK; struct simplebuffer *sbobj = NULL; uint32_t left = 0; TRACE_FLOW_ENTRY(); error = simplebuffer_alloc(&sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to allocate dynamic string.", error); return error; } /* Serialize */ error = value_serialize(vo, key, sbobj); if (error) { printf("Failed to serialize a value object %d.\n", error); simplebuffer_free(sbobj); return error; } /* Add CR */ error = simplebuffer_add_cr(sbobj); if (error) { TRACE_ERROR_NUMBER("Failed to add CR", error); simplebuffer_free(sbobj); return error; } /* Save */ left = simplebuffer_get_len(sbobj); while (left > 0) { error = simplebuffer_write(fileno(ff), sbobj, &left); if (error) { printf("Failed to write value object %d.\n", error); simplebuffer_free(sbobj); return error; } } simplebuffer_free(sbobj); TRACE_FLOW_EXIT(); return EOK; } /* Test to create value object using arrays */ static int other_create_test(FILE *ff, struct value_obj **vo) { int error = EOK; struct value_obj *new_vo = NULL; struct ref_array *raw_lines; struct ref_array *raw_lengths; struct ini_comment *ic = NULL; struct ini_comment *ic2 = NULL; char *val; const char *vallines[] = { "Domain1,", " Domain2 ,", " Domain3 " }; const char *fullstr; const char *expected = "Domain1, Domain2 , Domain3"; int i; uint32_t origin = 0; uint32_t line = 0; uint32_t len = 0; uint32_t expected_len = 0; TRACE_FLOW_ENTRY(); /* Create a pair of arrays */ error = value_create_arrays(&raw_lines, &raw_lengths); if (error) { printf("Failed to create arrays %d.\n", error); return error; } for (i=0; i< 3; i++) { errno = 0; val = strdup(vallines[i]); if (val == NULL) { error = errno; printf("Failed to dup memory %d.\n", error); value_destroy_arrays(raw_lines, raw_lengths); return error; } /* Add line to the arrays */ error = value_add_to_arrays(val, strlen(val), raw_lines, raw_lengths); if (error) { printf("Failed to add to arrays %d.\n", error); value_destroy_arrays(raw_lines, raw_lengths); return error; } } /* Create a comment */ error = create_comment(1000, &ic); if (error) { printf("Failed to create comment %d.\n", error); value_destroy_arrays(raw_lines, raw_lengths); return error; } /* Create object */ error = value_create_from_refarray(raw_lines, raw_lengths, 1, INI_VALUE_READ, 3, 70, ic, &new_vo); if (error) { printf("Failed to create comment %d.\n", error); value_destroy_arrays(raw_lines, raw_lengths); ini_comment_destroy(ic); return error; } /* Save value to the file */ error = save_value(ff, "baz", new_vo); if (error) { printf("Failed to save value to file %d.\n", error); value_destroy(new_vo); return error; } /* Now do assertions and modifications to the object */ /* NOTE: Below this line do not need to free arrays or comment * they became internal parts of the value object * and will be freed as a part of it. */ /* Get concatenated value */ error = value_get_concatenated(new_vo, &fullstr); if (error) { printf("Failed to get the string %d.\n", error); value_destroy(new_vo); return error; } /* Get length of the concatenated value */ value_get_concatenated_len(new_vo, &len); expected_len = strlen(expected); if ((len != expected_len) || (strncmp(fullstr, expected, expected_len + 1) != 0)) { printf("The expected value is different.\n"); printf("The expected value is %s\n", expected); printf("The real value is %s\n", fullstr); printf("The expected len is %d, real %d.\n", expected_len, len); value_destroy(new_vo); return EINVAL; } /* Get value's origin */ error = value_get_origin(new_vo, &origin); if (error) { printf("Failed to get origin %d.\n", error); value_destroy(new_vo); return error; } if (origin != INI_VALUE_READ) { printf("The expected origin is different.\n%d\n", origin); value_destroy(new_vo); return EINVAL; } /* Get value's line */ error = value_get_line(new_vo, &line); if (error) { printf("Failed to get origin %d.\n", error); value_destroy(new_vo); return error; } if (line != 1) { printf("The expected line is different.\n%d\n", origin); value_destroy(new_vo); return EINVAL; } /* Get comment from the value */ ic = NULL; error = value_extract_comment(new_vo, &ic); if (error) { printf("Failed to extract comment %d.\n", error); value_destroy(new_vo); return error; } if (ic == NULL) { printf("The expected comment to be there.\n"); value_destroy(new_vo); return error; } VOOUT(ini_comment_print(ic, stdout)); /* Get comment again */ ic2 = NULL; error = value_extract_comment(new_vo, &ic2); if (error) { printf("Failed to extract comment %d.\n", error); value_destroy(new_vo); ini_comment_destroy(ic); return error; } if (ic2 != NULL) { printf("The expected NO comment to be there.\n"); value_destroy(new_vo); ini_comment_destroy(ic); /* No free for ic2 since it is the same object */ /* But this should not happen anyways - * it will be coding error. */ return EINVAL; } /* Put comment back */ error = value_put_comment(new_vo, ic); if (error) { printf("Failed to put comment back %d.\n", error); value_destroy(new_vo); ini_comment_destroy(ic); return error; } /* Save value to the file */ error = save_value(ff, "bar", new_vo); if (error) { printf("Failed to save value to file %d.\n", error); value_destroy(new_vo); return error; } *vo = new_vo; TRACE_FLOW_EXIT(); return EOK; } /* Modify the value object */ static int modify_test(FILE *ff, struct value_obj *vo) { int error = EOK; const char *strval = "Domain100, Domain200, Domain300"; TRACE_FLOW_ENTRY(); /* Update key length */ error = value_set_keylen(vo, strlen("foobar")); if (error) { printf("Failed to change key length %d.\n", error); return error; } /* Update value */ error = value_update(vo, strval, strlen(strval), INI_VALUE_CREATED, 10); if (error) { printf("Failed to update value %d.\n", error); return error; } /* Save value to the file */ error = save_value(ff, "foobar", vo); if (error) { printf("Failed to save value to file %d.\n", error); return error; } TRACE_FLOW_EXIT(); return EOK; } static int vo_basic_test(void) { int error = EOK; const char *strvalue = "Test multi_word_value_that_will_" "be_split_between_several_lines_!"; /* Other testing can be done with the following string: * const char *strvalue = "Test multi word value that " * "will be split between several lines"; */ struct value_obj *vo = NULL; uint32_t wrap = 0; struct ini_comment *ic = NULL; FILE *ff = NULL; TRACE_FLOW_ENTRY(); errno = 0; ff = fopen("test.ini","wt"); if (ff == NULL) { error = errno; printf("Failed to open file. Error %d.\n", error); return error; } for (wrap = 0; wrap < 80; wrap++) { ic = NULL; error = create_comment(wrap, &ic); if (error) { printf("Failed to create a new comment object %d.\n", error); fclose(ff); return error; } vo = NULL; error = value_create_new(strvalue, strlen(strvalue), INI_VALUE_CREATED, 3, wrap, ic, &vo); if (error) { printf("Failed to create a new value object %d.\n", error); ini_comment_destroy(ic); fclose(ff); return error; } error = save_value(ff, "key", vo); if (error) { printf("Failed to save value to file %d.\n", error); value_destroy(vo); fclose(ff); return error; } value_destroy(vo); } vo = NULL; /* Run other create test here */ error = other_create_test(ff, &vo); if (error) { printf("Create test failed %d.\n", error); fclose(ff); return error; } /* Run modify test here */ error = modify_test(ff, vo); if (error) { printf("Modify test failed %d.\n", error); fclose(ff); value_destroy(vo); return error; } value_destroy(vo); ic = NULL; error = create_comment(100, &ic); if (error) { printf("Failed to create a new comment object %d.\n", error); fclose(ff); return error; } ini_comment_print(ic, ff); ini_comment_destroy(ic); fclose(ff); TRACE_FLOW_EXIT(); return EOK; } static int vo_copy_test(void) { int error = EOK; const char *strvalue = "Test multi word value that " "will be split between several lines"; struct value_obj *vo = NULL; struct value_obj *vo_copy = NULL; uint32_t wrap = 0; struct ini_comment *ic = NULL; FILE *ff = NULL; char comment[100]; TRACE_FLOW_ENTRY(); VOOUT(printf("Copy test\n")); errno = 0; ff = fopen("test.ini","a"); if (ff == NULL) { error = errno; printf("Failed to open file. Error %d.\n", error); return error; } error = ini_comment_create(&ic); if (error) { printf("Failed to create comment object\n"); fclose(ff); return -1; } error = ini_comment_append(ic, "#This is a copy test!"); if (error) { printf("Failed to add a line to the comment %d.\n", error); ini_comment_destroy(ic); fclose(ff); return error; } error = ini_comment_append(ic, "#Replacable comment line"); if (error) { printf("Failed to add a line to the comment %d.\n", error); ini_comment_destroy(ic); fclose(ff); return error; } error = value_create_new(strvalue, strlen(strvalue), INI_VALUE_CREATED, 3, 20, ic, &vo); if (error) { printf("Failed to create a new value object %d.\n", error); ini_comment_destroy(ic); fclose(ff); return error; } error = save_value(ff, "key", vo); if (error) { printf("Failed to save value to file %d.\n", error); value_destroy(vo); fclose(ff); return error; } for (wrap = 0; wrap < 80; wrap++) { TRACE_INFO_NUMBER("Iteration:", wrap); vo_copy = NULL; error = value_copy(vo, &vo_copy); if (error) { printf("Failed to create a new value object %d.\n", error); value_destroy(vo); fclose(ff); return error; } error = value_set_boundary(vo_copy, wrap); if (error) { printf("Failed to set boundary %d.\n", error); value_destroy(vo); value_destroy(vo_copy); fclose(ff); return error; } /* Get comment from the value */ ic = NULL; error = value_extract_comment(vo_copy, &ic); if (error) { printf("Failed to extract comment %d.\n", error); value_destroy(vo); value_destroy(vo_copy); fclose(ff); return error; } /* Replace comment in the value */ snprintf(comment, TEST_SIZE, ";This is value with boundary %d", wrap); VOOUT(printf("Comment: %s\n", comment)); error = ini_comment_replace(ic, 1, comment); if (error) { printf("Failed to replace comment %d.\n", error); value_destroy(vo); value_destroy(vo_copy); fclose(ff); return error; } /* Set comment into the value */ error = value_put_comment(vo_copy, ic); if (error) { printf("Failed to set comment %d.\n", error); value_destroy(vo); value_destroy(vo_copy); fclose(ff); return error; } error = save_value(ff, "key", vo_copy); if (error) { printf("Failed to save value to file %d.\n", error); value_destroy(vo); value_destroy(vo_copy); fclose(ff); return error; } value_destroy(vo_copy); } value_destroy(vo); fclose(ff); TRACE_FLOW_EXIT(); return EOK; } static int vo_show_test(void) { VOOUT(system("cat test.ini")); return EOK; } static int vo_mc_test(void) { int error = EOK; struct value_obj *vo1 = NULL; struct value_obj *vo2 = NULL; struct ini_comment *ic = NULL; TRACE_FLOW_ENTRY(); VOOUT(printf("<=== Merge Comment Test ===>\n")); error = create_comment(1, &ic); if (error) { printf("Failed to create a new comment object %d.\n", error); return error; } error = value_create_new("test1", 5, INI_VALUE_CREATED, 3, 80, ic, &vo1); if (error) { printf("Failed to create the first value object %d.\n", error); ini_comment_destroy(ic); return error; } error = create_comment(2, &ic); if (error) { printf("Failed to create a new comment object %d.\n", error); value_destroy(vo1); return error; } error = value_create_new("test2", 5, INI_VALUE_CREATED, 3, 80, ic, &vo2); if (error) { printf("Failed to create the second value object %d.\n", error); ini_comment_destroy(ic); value_destroy(vo1); return error; } /* Merge comment from one value into another */ error = value_merge_comment(vo2, vo1); if (error) { printf("Failed to merge comments %d.\n", error); value_destroy(vo1); value_destroy(vo2); return error; } value_destroy(vo2); VOOUT(printf("<=== Key ===>\n")); VOOUT(value_print("key", vo1)); error = value_extract_comment(vo1, &ic); if (error) { printf("Failed to extract comment %d.\n", error); value_destroy(vo1); return error; } value_destroy(vo1); VOOUT(printf("<=== Comment ===>\n")); VOOUT(ini_comment_print(ic, stdout)); ini_comment_destroy(ic); TRACE_FLOW_EXIT(); return EOK; } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { vo_basic_test, vo_copy_test, vo_show_test, vo_mc_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } VOOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { VOOUT(printf("Failed with error %d!\n", error)); return error; } } VOOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/ini/libini_config.sym000066400000000000000000000115131417260640400175000ustar00rootroot00000000000000INI_CONFIG_1.1.0 { global: /* ini_config.h */ config_from_file; config_from_fd; config_from_file_with_metadata; config_from_fd_with_metadata; config_for_app; config_for_app_with_metadata; config_access_check; config_changed; free_ini_config; free_ini_config_errors; free_ini_config_metadata; print_file_parsing_errors; print_config_parsing_errors; get_section_list; free_section_list; get_attribute_list; free_attribute_list; get_config_item; get_int_config_value; get_long_config_value; get_unsigned_config_value; get_ulong_config_value; get_int32_config_value; get_uint32_config_value; get_int64_config_value; get_uint64_config_value; get_double_config_value; get_bool_config_value; get_string_config_value; get_const_string_config_value; get_bin_config_value; free_bin_config_value; get_string_config_array; get_raw_string_config_array; get_long_config_array; get_double_config_array; free_string_config_array; free_long_config_array; free_double_config_array; /* ini_configobj.h */ ini_config_create; ini_config_destroy; ini_config_clean_state; ini_config_file_open; ini_config_file_from_mem; ini_config_file_close; ini_config_file_reopen; ini_config_file_destroy; ini_config_error_count; ini_config_get_errors; ini_config_free_errors; ini_config_print_errors; ini_config_get_filename; ini_config_get_stat; ini_config_file_print; ini_config_access_check; ini_config_changed; ini_config_parse; ini_config_copy; ini_config_merge; ini_config_set_wrap; ini_config_serialize; ini_get_section_list; ini_free_section_list; ini_get_attribute_list; ini_free_attribute_list; ini_get_config_valueobj; ini_get_int_config_value; ini_get_unsigned_config_value; ini_get_long_config_value; ini_get_ulong_config_value; ini_get_int32_config_value; ini_get_uint32_config_value; ini_get_int64_config_value; ini_get_uint64_config_value; ini_get_double_config_value; ini_get_bool_config_value; ini_get_string_config_value; ini_get_const_string_config_value; ini_get_bin_config_value; ini_free_bin_config_value; ini_get_string_config_array; ini_get_raw_string_config_array; ini_get_long_config_array; ini_get_double_config_array; ini_free_string_config_array; ini_free_long_config_array; ini_free_double_config_array; /* ini_valueobj.h */ value_create_from_refarray; value_lines_cleanup_cb; value_create_arrays; value_add_to_arrays; value_destroy_arrays; value_create_new; value_copy; value_destroy; value_get_concatenated; value_get_concatenated_len; value_get_origin; value_get_line; value_set_keylen; value_set_boundary; value_update; value_extract_comment; value_put_comment; value_merge_comment; value_serialize; value_print; /* ini_comment.h */ ini_comment_create; ini_comment_destroy; ini_comment_build; ini_comment_build_wl; ini_comment_insert; ini_comment_append; ini_comment_remove; ini_comment_clear; ini_comment_replace; ini_comment_reset; ini_comment_get_numlines; ini_comment_get_line; ini_comment_swap; ini_comment_copy; ini_comment_add; ini_comment_serialize; ini_comment_print; local: *; }; INI_CONFIG_1.2.0 { global: /* ini_configobj.h */ ini_config_augment; /* ini_comment.h */ ini_comment_construct; /* ini_configmod.h */ ini_config_add_section; ini_config_comment_section; ini_config_rename_section; ini_config_delete_section_by_name; ini_config_delete_section_by_position; ini_config_add_str_value; ini_config_add_int_value; ini_config_add_long_value; ini_config_add_ulong_value; ini_config_add_unsigned_value; ini_config_add_int32_value; ini_config_add_uint32_value; ini_config_add_int64_value; ini_config_add_uint64_value; ini_config_add_double_value; ini_config_add_bin_value; ini_config_add_const_str_arr_value; ini_config_add_str_arr_value; ini_config_add_int_arr_value; ini_config_add_long_arr_value; ini_config_add_double_arr_value; ini_config_delete_value; ini_config_update_comment; ini_config_file_backup; ini_config_change_access; ini_config_save; ini_config_save_as; ini_config_get_bom; ini_config_set_bom; } INI_CONFIG_1.1.0; INI_CONFIG_1.3.0 { global: /* ini_configobj.h */ ini_errobj_create; ini_errobj_destroy; ini_errobj_add_msg; ini_errobj_reset; ini_errobj_get_msg; ini_errobj_count; ini_errobj_next; ini_errobj_no_more_msgs; ini_rules_read_from_file; ini_rules_check; ini_rules_destroy; } INI_CONFIG_1.2.0; ding-libs-0.6.2/ini/m4/000077500000000000000000000000001417260640400144725ustar00rootroot00000000000000ding-libs-0.6.2/ini/m4/libbasicobjects.m4000066400000000000000000000002011417260640400200470ustar00rootroot00000000000000AC_SUBST(BASICOBJS_OBJ) AC_SUBST(BASICOBJS_CFLAGS) AC_SUBST(BASICOBJS_LIBS) PKG_CHECK_MODULES(BASICOBJS, basicobjects >= 0.1.0) ding-libs-0.6.2/ini/m4/libcollection.m4000066400000000000000000000003041417260640400175530ustar00rootroot00000000000000AC_SUBST(COLLECTION_OBJ) AC_SUBST(COLLECTION_CFLAGS) AC_SUBST(COLLECTION_LIBS) PKG_CHECK_MODULES(COLLECTION, collection >= 0.5.0,,AC_MSG_ERROR([libcollection development package not installed])) ding-libs-0.6.2/ini/m4/libpath_utils.m4000066400000000000000000000002031417260640400175720ustar00rootroot00000000000000AC_SUBST(PATH_UTILS_OBJ) AC_SUBST(PATH_UTILS_CFLAGS) AC_SUBST(PATH_UTILS_LIBS) PKG_CHECK_MODULES(PATH_UTILS, path_utils >= 0.2.0) ding-libs-0.6.2/ini/m4/libref_array.m4000066400000000000000000000002711417260640400173750ustar00rootroot00000000000000AC_SUBST(REFARRAY_OBJ) AC_SUBST(REFARRAY_CFLAGS) AC_SUBST(REFARRAY_LIBS) PKG_CHECK_MODULES(REFARRAY, ref_array >= 0.1.0,,AC_MSG_ERROR([librefarray development package not installed])) ding-libs-0.6.2/m4/000077500000000000000000000000001417260640400137135ustar00rootroot00000000000000ding-libs-0.6.2/m4/ld-version-script.m4000066400000000000000000000031731417260640400175450ustar00rootroot00000000000000# ld-version-script.m4 serial 4 dnl Copyright (C) 2008-2016 Free Software Foundation, Inc. dnl This file is free software; the Free Software Foundation dnl gives unlimited permission to copy and/or distribute it, dnl with or without modifications, as long as this notice is preserved. dnl From Simon Josefsson # FIXME: The test below returns a false positive for mingw # cross-compiles, 'local:' statements does not reduce number of # exported symbols in a DLL. Use --disable-ld-version-script to work # around the problem. # gl_LD_VERSION_SCRIPT # -------------------- # Check if LD supports linker scripts, and define automake conditional # HAVE_LD_VERSION_SCRIPT if so. AC_DEFUN([gl_LD_VERSION_SCRIPT], [ AC_ARG_ENABLE([ld-version-script], [AS_HELP_STRING([--enable-ld-version-script], [enable linker version script (default is enabled when possible)])], [have_ld_version_script=$enableval], [AC_CACHE_CHECK([if LD -Wl,--version-script works], [gl_cv_sys_ld_version_script], [gl_cv_sys_ld_version_script=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -Wl,--version-script=conftest.map" echo foo >conftest.map AC_LINK_IFELSE([AC_LANG_PROGRAM([], [])], [], [cat > conftest.map < Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ /*****************************************************************************/ /******************************** Documentation ******************************/ /*****************************************************************************/ /*****************************************************************************/ /******************************* Include Files *******************************/ /*****************************************************************************/ #include #include #include #include #include #include #include #include #include "path_utils.h" /*****************************************************************************/ /****************************** Internal Defines *****************************/ /*****************************************************************************/ /*****************************************************************************/ /************************** Internal Type Definitions ************************/ /*****************************************************************************/ /*****************************************************************************/ /********************** External Function Declarations *********************/ /*****************************************************************************/ /*****************************************************************************/ /********************** Internal Function Declarations *********************/ /*****************************************************************************/ /*****************************************************************************/ /************************* External Global Variables ***********************/ /*****************************************************************************/ /*****************************************************************************/ /************************* Internal Global Variables ***********************/ /*****************************************************************************/ /*****************************************************************************/ /**************************** Inline Functions *****************************/ /*****************************************************************************/ /*****************************************************************************/ /*************************** Internal Functions ****************************/ /*****************************************************************************/ /*****************************************************************************/ /**************************** Exported Functions ***************************/ /*****************************************************************************/ const char *path_utils_error_string(int error) { switch(error) { case SUCCESS: return _("Success"); case PATH_UTILS_ERROR_NOT_FULLY_NORMALIZED: return _("Path could not be fully normalized"); } return NULL; } static int dot_to_absolute(char *rel_path, int rel_path_size) { char tmp_path[PATH_MAX]; if (strcmp(rel_path, ".") == 0) { if (getcwd(rel_path, rel_path_size) == NULL) { if (errno == ERANGE) return ENOBUFS; else return errno; } } else if (strcmp(rel_path, "..") == 0) { if (getcwd(tmp_path, sizeof(tmp_path)) == NULL) { if (errno == ERANGE) return ENOBUFS; else return errno; } strncpy(rel_path, dirname(tmp_path), rel_path_size); if (rel_path[rel_path_size-1] != '\0') return ENOBUFS; } return SUCCESS; } int get_basename(char *base_name, size_t base_name_size, const char *path) { char tmp_path[PATH_MAX]; int ret; if (!path) return EINVAL; if (!base_name || base_name_size < 1) return ENOBUFS; /* coverity[buffer_size_warning : SUPPRESS] */ /* false positive warning */ strncpy(tmp_path, path, sizeof(tmp_path)); if (tmp_path[sizeof(tmp_path)-1] != '\0') return ENOBUFS; strncpy(base_name, basename(tmp_path), base_name_size); if (base_name[base_name_size-1] != '\0') return ENOBUFS; ret = dot_to_absolute(base_name, base_name_size); if (ret != SUCCESS) { return ret; } return SUCCESS; } int get_dirname(char *dir_path, size_t dir_path_size, const char *path) { char tmp_path[PATH_MAX]; int ret; if (!path) return EINVAL; if (!dir_path || dir_path_size < 1) return ENOBUFS; /* coverity[buffer_size_warning : SUPPRESS] */ /* false positive warning */ strncpy(tmp_path, path, sizeof(tmp_path)); if (tmp_path[sizeof(tmp_path)-1] != '\0') return ENOBUFS; strncpy(dir_path, dirname(tmp_path), dir_path_size); if (dir_path[dir_path_size-1] != '\0') return ENOBUFS; ret = dot_to_absolute(dir_path, dir_path_size); if (ret != SUCCESS) { return ret; } return SUCCESS; } int get_directory_and_base_name(char *dir_path, size_t dir_path_size, char *base_name, size_t base_name_size, const char *path) { char tmp_path[PATH_MAX]; int ret; if (!path) return EINVAL; if (!dir_path || dir_path_size < 1) return ENOBUFS; if (!base_name || base_name_size < 1) return ENOBUFS; /* coverity[buffer_size_warning : SUPPRESS] */ /* false positive warning */ strncpy(tmp_path, path, sizeof(tmp_path)); if (tmp_path[sizeof(tmp_path)-1] != '\0') return ENOBUFS; strncpy(base_name, basename(tmp_path), base_name_size); if (base_name[base_name_size-1] != '\0') return ENOBUFS; /* coverity[buffer_size_warning : SUPPRESS] */ /* false positive warning */ strncpy(tmp_path, path, sizeof(tmp_path)); if (tmp_path[sizeof(tmp_path)-1] != '\0') return ENOBUFS; strncpy(dir_path, dirname(tmp_path), dir_path_size); if (dir_path[dir_path_size-1] != '\0') return ENOBUFS; ret = dot_to_absolute(dir_path, dir_path_size); if (ret != SUCCESS) { return ret; } if (strcmp(base_name, ".") == 0) { strncpy(base_name, "", base_name_size); if (base_name[base_name_size-1] != '\0') return ENOBUFS; } return SUCCESS; } bool is_absolute_path(const char *path) { if (!path) return false; return path[0] == '/'; } int path_concat(char *path, size_t path_size, const char *head, const char *tail) { int ret; const char *p, *src; char *dst, *dst_end; if (!path || path_size < 1) return ENOBUFS; dst = path; dst_end = path + path_size - 1; /* -1 allows for NULL terminator */ if (head && *head) { /* walk to end of head */ for (p = head; *p; p++); /* skip any trailing slashes in head */ for (p--; p > head && *p == '/'; p--); /* If the length of head exceeds the buffer size, fail */ if ((p - head) > path_size-1) { ret = ENOBUFS; goto fail; } /* Copy head into path */ for (src = head; src <= p && dst < dst_end;) { *dst++ = *src++; } } if (tail && *tail) { /* skip any leading slashes in tail */ for (p = tail; *p && *p == '/'; p++); if (dst > path) /* insert single slash between head & tail * Making sure not to add an extra if the * preceding character is also a slash * (such as the case where head was the * special-case "/". */ if (dst < dst_end && *(dst-1) != '/') { *dst++ = '/'; } /* Copy the tail into the path */ for (src = p; *src && dst < dst_end;) { *dst++ = *src++; } /* If we got past dst_end and there is more data * in the src buffer, we should return ENOBUFS */ if (*src) { ret = ENOBUFS; /* failed to copy everything */ goto fail; } } *dst = 0; return SUCCESS; fail: /* On failure, set the buffer to the empty string for safety */ *path = '\0'; return ret; } int make_path_absolute(char *absolute_path, size_t absolute_path_size, const char *path) { int result = SUCCESS; const char *src; char *dst, *dst_end; if (!absolute_path || absolute_path_size < 1) return ENOBUFS; dst = absolute_path; dst_end = absolute_path + absolute_path_size - 1; /* -1 allows for NULL terminator */ if (is_absolute_path(path)) { for (src = path; *src && dst < dst_end;) *dst++ = *src++; *dst = 0; if (dst > dst_end || *src) result = ENOBUFS; return result; } if ((getcwd(absolute_path, absolute_path_size) == NULL)) { if (errno == ERANGE) return ENOBUFS; else return errno; } for (dst = absolute_path; *dst && dst < dst_end; dst++); if (!(path && *path)) return result; if (dst > dst_end) { *absolute_path = 0; return ENOBUFS; } *dst++ = '/'; if (dst > dst_end) { *absolute_path = 0; return ENOBUFS; } for (src = path; *src && dst < dst_end;) *dst++ = *src++; if (*src) return ENOBUFS; /* failed to copy everything */ *dst = 0; return result; } char **split_path(const char *path, int *count) { int n_components, component_len, total_component_len, alloc_len; const char *start, *end; char *mem_block, **array_ptr, *component_ptr; if (count) *count = 0; if (!path) return NULL; /* If path is absolute add in special "/" root component */ if (*path == '/') { n_components = 1; total_component_len = 2; } else { n_components = 0; total_component_len = 0; } /* Scan for components, keep several counts */ for (start = end = path; *start; start = end) { for (start = end; *start && *start == '/'; start++); for (end = start; *end && *end != '/'; end++); if ((component_len = end - start) == 0) break; n_components++; total_component_len += component_len + 1; } /* * Allocate a block big enough for component array (with trailing NULL * entry, hence n_components+1) and enough room for a copy of each NULL * terminated component. We'll copy the components into the same allocation * block after the end of the pointer array. */ alloc_len = ((n_components+1) * sizeof(char *)) + total_component_len; if ((mem_block = malloc(alloc_len)) == NULL) { if (count) *count = -1; return NULL; } /* component array */ array_ptr = (char **)mem_block; /* components copied after end of array */ component_ptr = mem_block + ((n_components+1)*sizeof(char *)); /* If path is absolute add in special "/" root component */ if (*path == '/') { *array_ptr++ = component_ptr; *component_ptr++ = '/'; *component_ptr++ = 0; } for (start = end = path; *start; start = end) { for (start = end; *start && *start == '/'; start++); for (end = start; *end && *end != '/'; end++); if ((end - start) == 0) break; *array_ptr++ = component_ptr; while (start < end) *component_ptr++ = *start++; *component_ptr++ = 0; } *array_ptr = NULL; if (count) *count = n_components; return (char **)mem_block; } int normalize_path(char *normalized_path, size_t normalized_path_size, const char *path) { int result = SUCCESS; int component_len; bool is_absolute, can_backup; const char *start, *end; char *dst, *dst_end, *p, *limit; if (!normalized_path || normalized_path_size < 1) return ENOBUFS; dst = normalized_path; dst_end = normalized_path + normalized_path_size - 1; /* -1 allows for NULL terminator */ can_backup = true; if (!path || !*path) { if (dst > dst_end) { *dst = 0; return ENOBUFS; } *dst++ = '.'; *dst = 0; return result; } if ((is_absolute = *path == '/')) { if (dst < dst_end) { *dst++ = '/'; } else { *dst = 0; return ENOBUFS; } } for (start = end = path; *start; start = end) { for (start = end; *start && *start == '/'; start++); for (end = start; *end && *end != '/'; end++); if ((component_len = end - start) == 0) break; if (component_len == 1 && start[0] == '.') continue; if (component_len == 2 && start[0] == '.' && start[1] == '.' && can_backup) { /* back up one level */ if ((is_absolute && dst == normalized_path+1) || (!is_absolute && dst == normalized_path)) { if (is_absolute) continue; can_backup = false; result = PATH_UTILS_ERROR_NOT_FULLY_NORMALIZED; } else { if (is_absolute) limit = normalized_path+1; else limit = normalized_path; for (p = dst-1; p >= limit && *p != '/'; p--); if (p < limit) dst = limit; else dst = p; continue; } } if ((end-start) > (dst_end-dst)) { return ENOBUFS; } if ((dst > normalized_path) && (dst < dst_end) && (dst[-1] != '/')) *dst++ = '/'; while ((start < end) && (dst < dst_end)) *dst++ = *start++; } if (dst == normalized_path) { if (is_absolute) *dst++ = '/'; else *dst++ = '.'; } *dst = 0; return result; } int common_path_prefix(char *common_path, size_t common_path_size, int *common_count, const char *path1, const char *path2) { int count1, count2, min_count, i, n_common, result; char **split1, **split2; char *dst, *dst_end, *src; if (!common_path || common_path_size < 1) return ENOBUFS; result = SUCCESS; n_common = 0; split1 = split_path(path1, &count1); split2 = split_path(path2, &count2); if (count1 <= count2) min_count = count1; else min_count = count2; if (min_count <= 0 || !split1 || !split2 ) { result = SUCCESS; *common_path = 0; goto done; } for (n_common = 0; n_common < min_count; n_common++) { if (strcmp(split1[n_common], split2[n_common]) != 0) break; } if (n_common == 0) { result = SUCCESS; *common_path = 0; goto done; } dst = common_path; dst_end = common_path + common_path_size - 1; /* -1 allows for NULL terminator */ for (i = 0; i < n_common; i++) { for (src = split1[i]; *src && dst < dst_end;) *dst++ = *src++; if (dst == dst_end && *src) { *dst = 0; result = ENOBUFS; goto done; } if (dst[-1] != '/' && i < n_common-1) { /* insert path separator */ if (dst == dst_end) { *dst = 0; result = ENOBUFS; goto done; } *dst++ = '/'; } } *dst = 0; done: free(split1); free(split2); if (common_count) *common_count = n_common; return result; } int make_normalized_absolute_path(char *result_path, size_t result_path_size, const char *path) { int error; char absolute_path[PATH_MAX]; if (!result_path || result_path_size < 1) return ENOBUFS; *result_path = 0; if ((error = make_path_absolute(absolute_path, sizeof(absolute_path), path)) != SUCCESS) return error; if ((error = normalize_path(result_path, result_path_size, absolute_path)) != SUCCESS) return error; return SUCCESS; } int find_existing_directory_ancestor(char *ancestor, size_t ancestor_size, const char *path) { int error; char dir_path[PATH_MAX]; struct stat info; if (!ancestor || ancestor_size < 1) return ENOBUFS; *ancestor = 0; /* coverity[buffer_size_warning : SUPPRESS] */ /* false positive warning */ strncpy(dir_path, path, sizeof(dir_path)); if (dir_path[sizeof(dir_path)-1] != '\0') return ENOBUFS; while (strcmp(dir_path, "/") != 0) { if (lstat(dir_path, &info) < 0) { error = errno; if (error != ENOENT) return error; } else { if (S_ISDIR(info.st_mode)) break; } error = get_dirname(dir_path, sizeof(dir_path), dir_path); if (error != SUCCESS) { return error; } } strncpy(ancestor, dir_path, ancestor_size); if (ancestor[ancestor_size-1] != '\0') return ENOBUFS; return SUCCESS; } int directory_list(const char *path, bool recursive, directory_list_callback_t callback, void *user_data) { DIR *dir; struct dirent *entry; struct stat info; int error = 0; char entry_path[PATH_MAX]; bool prune = false; if (!(dir = opendir(path))) { error = errno; return error; } for (entry = readdir(dir); entry; entry = readdir(dir)) { if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) { continue; } error = path_concat(entry_path, sizeof(entry_path), path, entry->d_name); if (error != SUCCESS) { closedir(dir); /* Don't bother checking the return here. * The path_concat error is more important */ return error; } if (lstat(entry_path, &info) < 0) { continue; } prune = !callback(path, entry->d_name, entry_path, &info, user_data); if (S_ISDIR(info.st_mode)) { if (recursive && !prune) { error = directory_list(entry_path, recursive, callback, user_data); if (error != SUCCESS) { closedir(dir); /* Don't bother checking the return here. * The directory_list error is more important */ return error; } } } } error = closedir(dir); if (error) { return error; } return SUCCESS; } bool is_ancestor_path(const char *ancestor, const char *path) { char **path_components, **ancestor_components; int i, path_count, ancestor_count; bool result = false; path_components = split_path(path, &path_count); ancestor_components = split_path(ancestor, &ancestor_count); if (!path_components || !ancestor_components) { goto exit; } if (ancestor_count >= path_count) { goto exit; } for (i = 0; i < ancestor_count; i++) { if (strcmp(path_components[i], ancestor_components[i]) != 0) { goto exit; } } result = true; exit: free(path_components); free(ancestor_components); return result; } ding-libs-0.6.2/path_utils/path_utils.cfg.doxy.in000066400000000000000000001755151417260640400220110ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "path_utils" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = "The $name class" \ "The $name widget" \ "The $name file" \ is \ provides \ specifies \ contains \ represents \ a \ an \ the # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@ # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.c *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *_ut.c config.h # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = NO # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = YES #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES ding-libs-0.6.2/path_utils/path_utils.h000066400000000000000000000423131417260640400200770ustar00rootroot00000000000000/* Authors: John Dennis Copyright (C) 2009 Red Hat This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #ifndef PATH_UTILS_H #define PATH_UTILS_H /*****************************************************************************/ /******************************** Documentation ******************************/ /*****************************************************************************/ /** @mainpage Pathname manipulation utilities * * This library contains a set of utilities designed to extract info from * and manipulate path names. * */ /*****************************************************************************/ /******************************* Include Files *******************************/ /*****************************************************************************/ #include #include #include #include /*****************************************************************************/ /*********************************** Defines *********************************/ /*****************************************************************************/ /** * @defgroup constants Constants * @{ */ #ifndef _ #define _(String) gettext(String) #endif /** * @brief SUCCESS (=0) is returned by all functions in the path_utils * library on success. */ #ifndef SUCCESS #define SUCCESS 0 #endif /** * @} */ /** * @defgroup errors Error codes and macros * @{ */ #define PATH_UTILS_ERROR_BASE -3000 #define PATH_UTILS_ERROR_LIMIT (PATH_UTILS_ERROR_BASE+20) /** * @brief You can use this macro to check if an error code is one of * the internal path_utils codes. */ #define IS_PATH_UTILS_ERROR(error) (((error) >= PATH_UTILS_ERROR_BASE) && ((error) < PATH_UTILS_ERROR_LIMIT)) /** @brief A path cannot be normalized due to too many parent links * * Returned when a relative path contains too many parent (\c "..") links. * Please see the documentation of \c normalize_path() for full explanation. */ #define PATH_UTILS_ERROR_NOT_FULLY_NORMALIZED (PATH_UTILS_ERROR_BASE + 1) /** * @} */ /*****************************************************************************/ /******************************* Type Definitions ****************************/ /*****************************************************************************/ /*****************************************************************************/ /************************* External Global Variables ***********************/ /*****************************************************************************/ /*****************************************************************************/ /**************************** Exported Functions ***************************/ /*****************************************************************************/ /** * @defgroup functions Functions * @{ */ /** @brief Given an error code return the string description. * * @param[in] error The error code * * @return Error string. If error code is not recognized \c NULL is returned. */ const char *path_utils_error_string(int error); /** @brief Get the basename component of a path * * Given a path, copy the basename component (in the usual case, the part * following the final "/") into the buffer \c base_name * whose length is \c base_name_size. If the path does not contain a slash, * \c get_basename() returns a copy of path. * * @param[out] base_name The basename component * @param[in] base_name_size The size of the base_name buffer * @param[in] path The full path to parse * * @return \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS if the buffer space is too small * \li \c EINVAL The path was a NULL pointer */ int get_basename(char *base_name, size_t base_name_size, const char *path); /** @brief Copy the directory components of a path * * Given a path, copy the directory components (in the usual case, the path * up to, but not including the final "/") into the buffer \c dir_path whose * length is \c dir_path_size. If the path does not contain a slash, * \c get_dirname() returns the current working directory. * * @param[out] dir_path The directory component * @param[in] dir_path_size The size of the dir_path buffer * @param[in] path The full path to parse * * @return \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS If the buffer space is too small * \li \c EACCES Permission to read or search a component of the filename was denied. * \li \c ENAMETOOLONG The size of the null-terminated pathname exceeds PATH_MAX bytes. * \li \c ENOENT The current working directory has been unlinked. * \li \c EINVAL The path was a NULL pointer */ int get_dirname(char *dir_path, size_t dir_path_size, const char *path); /** @brief Get the basaname and directory components of a path * * Given a path, copy the directory components into the buffer \c dir_path whose * length is \c dir_path_size and copy the basename component into the buffer * \c base_name whose length is \c base_name_size. * * @param[out] base_name The basename component * @param[in] base_name_size The size of the base_name buffer * @param[out] dir_path The directory component * @param[in] dir_path_size The size of the dir_path buffer * @param[in] path The full path to parse * * @return \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS If the buffer space is too small * \li \c EACCES Permission to read or search a component of the filename was denied. * \li \c ENAMETOOLONG The size of the null-terminated pathname exceeds PATH_MAX bytes. * \li \c ENOENT The current working directory has been unlinked. * \li \c EINVAL The path was a NULL pointer */ int get_directory_and_base_name(char *dir_path, size_t dir_path_size, char *base_name, size_t base_name_size, const char *path); /** @brief Tell if path is absolute or relative * * @param[in] path The path to check * * @return \c true if the path is absolute, \c false otherwise. */ bool is_absolute_path(const char *path); /** @brief Concatenate two components of a path * * Given two paths, \c head & \c tail, copy their concatenation into the * buffer \c path whose length is \c path_size. * * @param[out] path The full path * @param[in] path_size The size of the path buffer * @param[in] head The first component of the path * @param[in] tail The second component of the path * * @return \c SUCCESS if successful, non-zero error code otherwise. * \li \c ENOBUFS If the buffer space is too small. In this case, * path will be set to an empty string. */ int path_concat(char *path, size_t path_size, const char *head, const char *tail); /** @brief Convert a path into absolute * * Given a path make it absolute storing the absolute path in into the buffer * \c absolute_path whose length is \c absolute_path_size. * * Returns \c SUCCESS if successful, non-zero error code otherwise. Possible errors: * \li \c ENOBUFS If the buffer space is too small * \li \c ENOMEM If user memory cannot be mapped * \li \c ENOENT If directory does not exist (i.e. it has been deleted) * \li \c EFAULT If memory access violation occurs while copying * \li \c EINVAL The path was a NULL pointer */ int make_path_absolute(char *absolute_path, size_t absolute_path_size, const char *path); /** @brief Split a file system path into individual components. * * Split a file system path into individual components. Return a pointer to an * array of char pointers, each array entry is a pointer to a copy of the * component. As a special case if the path begins with / then the first * component is "/" so the caller can identify the pah as absolute with the * first component being the root. The last entry in the array is \c NULL serving * as a termination sentinel. An optional integer count parameter can be * provided, which if non-NULL will have the number of components written into * it. Thus the caller can iterate on the array until it sees a \c NULL pointer or * iterate count times indexing the array. * * The caller is responsible for calling \c free() on the returned array. This * frees both the array of component pointers and the copies of each component * in one operation because the copy of each component is stored in the same * allocation block. * * The original path parameter is not modified. * * In the event of an error \c NULL is returned and count (if specified) will be -1. * * Examples: * * \code * char **components, **component; * int i; * * components = split_path(path, NULL); * for (component = components; *component; component++) * printf("\"%s\" ", *component); * free(components); * \endcode * * -OR- * * \code * components = split_path(path, &count); * for (i = 0; i < count; i++) * printf("\"%s\" ", components[i]); * free(components); * \endcode * * @param[in] path The original path * @param[out] count The number of components the path was split into * * @return An array of char pointers, each array entry is a pointer to a * copy of the component or NULL on error. */ char **split_path(const char *path, int *count); /** @brief Normalizes a path * * Normalizes a path copying the resulting normalized path into the buffer * \c normalized_path whose length is \c normalized_size. * * A path is normalized when: * \li only 1 slash separates all path components * \li there are no \c . path components (except if \c . is the only component) * \li there are no \c .. path components * * The input path may either be an absolute path or a path fragment. * * As a special case if the input path is \c NULL, the empty string \c "", * or \c "." the returned normalized path will be \c ".". * * \c ".." path components point to the parent directory which effectively * means poping the parent off the path. But what happens when there are * more \c ".." path components than ancestors in the path? The answer depends * on whether the path is an absolute path or a path fragment. If the path is * absolute then the extra \c ".." components which would move above the root * (/) are simply ignored. This effectively limits the path to the root. * However if the path is not absolute, rather it is a path fragment, and * there are more \c ".." components than ancestors which can be "popped off" * then as many \c ".." components will be popped off the fragement as * possible without changing the meaning of the path fragment. In this case * some extra \c ".." components will be left in the path and the function * will return the error \c ERROR_COULD_NOT_NORMALIZE_PATH_FULLY. However the * function will still normalize as much of the path fragment as is possible. * The behavior of \c ".." components when the input path is a fragment is * adopted because after normalizing a path fragment then the normalized path * fragment if made absolute should reference the same file system name as if * the unnormalized fragment were made absolute. Note this also means * \c ERROR_COULD_NOT_NORMALIZE_PATH_FULLY will never be returned if the input * path is absolute. * * @returns \c SUCCESS if successful, non-zero error code otherwise. Possible * errors: * \li \c ENOBUFS If the buffer space is too small * \li \c ERROR_COULD_NOT_NORMALIZE_PATH_FULLY If not all \c ".." path components could be removed */ int normalize_path(char *normalized_path, size_t normalized_path_size, const char *path); /** @brief Find the common prefix between two paths * * Finds the common prefix between two paths, returns the common prefix and * optionally the count of how many path components were common between the * two paths (if \c common_count is non-NULL). Please note that for absolute * paths, the \c "/" root prefix is treated as a common components, so the * paths \c "/usr/lib" and \c "/usr/share" would have two common components - * \c "/" and \c "/usr". * * Contrary to some other implementations, \c common_path_prefix() works on * path components, not characters, which guarantees at least some level of * sanity of the returned prefixes (for example, the common prefix of * \c "/usr/share" and \c "/usr/src" would be \c "/usr") * * @returns \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS if the buffer space is too small */ int common_path_prefix(char *common_path, size_t common_path_size, int *common_count, const char *path1, const char *path2); /** @brief Make the input path absolute if it's not already, then normalize it. * * @returns \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS if the buffer space is too small */ int make_normalized_absolute_path(char *result_path, size_t result_path_size, const char *path); /** * Find the first path component which is an existing directory by walking from * the tail of the path to it's head, return the path of the existing directory. * * If the pathname is relative and does not contain a directory, the current * directory is returned as parent. * * @returns \c SUCCESS if successful, non-zero error code otherwise. * Possible errors: * \li \c ENOBUFS if the buffer space is too small * \li \c EACCES Search permission is denied for one of the directories. * \li \c ELOOP Too many symbolic links encountered while traversing the path. * \li \c ENAMETOOLONG File name too long. * \li \c ENOMEM Out of memory (i.e., kernel memory). */ int find_existing_directory_ancestor(char *ancestor, size_t ancestor_size, const char *path); /** @brief callback for the \c directory_list() function * * Please see the description of \c directory_list() to see more * details about this callback * * @param[in] directory Directory name of the visited path * @param[in] base_name Base name of the visited path * @param[in] path Full name of the visited path * @param[in] info Info about the visited directory * @param[in] user_data Callback data passed by caller * * @returns if \c false, do not recursively descend into the directory, * descend if \c true */ typedef bool (*directory_list_callback_t)(const char *directory, const char *base_name, const char *path, struct stat *info, void *user_data); /** @brief Walk a directory. * * Walk a directory. If \c recursive is \c true child directories will be * descended into. The supplied callback is invoked for each entry in the * directory. * * The callback is provided with the directory name, basename, the full * pathname (i.e. directory name + basename) a stat structure for the path * item and a pointer to any user supplied data specified in the \c user_data * parameter. If the callback returns \c false for a directory the recursive * descent into that directory does not occur thus effectively "pruning" * the tree. * * @param[in] path The path to examine * @param[in] recursive Whether to recursively examine entries in the directory * @param[in] callback The callback to invoke for each entry * @param[in] user_data The data to pass into the callback * * @returns SUCCESS if successfull, an error code if not. */ int directory_list(const char *path, bool recursive, directory_list_callback_t callback, void *user_data); /** @brief Tell if one path is ancestor of another * * Test to see if the path passed in the \c ancestor parameter is an ancestor * of the path passed in the path parameter returning true if it is, \c false * otherwise. * * The test is "static" as such it is performed on the string components in * each path. Live symbolic links in the file system are not taken into * consideration. The test operates by splitting each path into it's individual * components and then comparing each component pairwise for string * equality. Both paths mush share a common root component for the test to be * meaningful (e.g. don't attempt to compare an absolute path with a relative * path). * * Example: * \code * is_ancestor_path("/a/b/c" "/a/b/c/d") => true * is_ancestor_path("/a/b/c/d" "/a/b/c/d") => false // equal, not ancestor * is_ancestor_path("/a/x/c" "/a/b/c/d") => false * \endcode * * @returns \c true if \c ancestor is an ancestor of \c path */ bool is_ancestor_path(const char *ancestor, const char *path); /** * @} */ #endif /* PATH_UTILS_H */ ding-libs-0.6.2/path_utils/path_utils.pc.in000066400000000000000000000004421417260640400206540ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: path_utils Description: Utility functions to manipulate filesystem pathnames Version: @PATH_UTILS_VERSION@ Libs: -L${libdir} -lpath_utils Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/path_utils/path_utils_ut.c000066400000000000000000000551101417260640400206010ustar00rootroot00000000000000/* path_utils - unit tests Authors: Jakub Hrozek Copyright (C) 2009 Red Hat 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 . */ #include "config.h" #include #include #include #include #include #include "path_utils.h" #define fail_unless_str_equal(a, b) do { \ fail_unless(strcmp(a, b) == 0, \ "The strings '%s' and '%s' are different, expected same", \ a, b); \ } while(0); #define DIR_TEMPLATE "test-directory-list-dir-XXXXXX" #define SUBDIR "test-directory-list-subdir" #define SUBSUBDIR "test-directory-list-subsubdir" char *dlist_dir; char *dlist_subdir; char *dlist_subsubdir; /**** get_dirname ****/ START_TEST(test_dirname) { char p[PATH_MAX]; char cwd[PATH_MAX]; fail_unless(get_dirname(p, PATH_MAX, "/foo/bar") == SUCCESS); fail_unless_str_equal(p, "/foo"); fail_unless(get_dirname(p, PATH_MAX, "/") == SUCCESS); fail_unless_str_equal(p, "/"); fail_unless(get_dirname(p, PATH_MAX, "/foo") == SUCCESS); fail_unless_str_equal(p, "/"); fail_unless(get_dirname(p, PATH_MAX, "//foo//bar") == SUCCESS); fail_unless_str_equal(p, "//foo"); fail_unless(get_dirname(p, PATH_MAX, "//foo//") == SUCCESS); fail_unless(!strcmp(p, "/") || !strcmp(p, "//")); fail_unless(get_dirname(p, PATH_MAX, "foo//bar") == SUCCESS); fail_unless_str_equal(p, "foo"); fail_unless(get_dirname(p, PATH_MAX, "foo//////bar") == SUCCESS); fail_unless_str_equal(p, "foo"); /* if pathname does not contain a slash, dirname returns cwd */ fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); fail_unless(get_dirname(p, PATH_MAX, "foo") == SUCCESS); fail_unless_str_equal(p, cwd); fail_unless(get_dirname(p, PATH_MAX, ".") == SUCCESS); fail_unless_str_equal(p, cwd); fail_unless(get_dirname(p, PATH_MAX, "..") == SUCCESS); fail_unless_str_equal(p, cwd); fail_unless(get_dirname(p, PATH_MAX, "") == SUCCESS); fail_unless_str_equal(p, cwd); } END_TEST START_TEST(test_dirname_neg) { char neg[3]; char p[PATH_MAX]; fail_if(get_dirname(neg, 3, "/foo/bar") == SUCCESS); fail_unless(get_dirname(p, PATH_MAX, NULL) == EINVAL); } END_TEST /**** get_basename ****/ START_TEST(test_basename) { char p[PATH_MAX]; char cwd[PATH_MAX]; fail_unless(get_basename(p, PATH_MAX, "/foo/bar") == SUCCESS); fail_unless_str_equal(p, "bar"); fail_unless(get_basename(p, PATH_MAX, "/foo/") == SUCCESS); fail_unless_str_equal(p, "foo"); fail_unless(get_basename(p, PATH_MAX, "foo") == SUCCESS); fail_unless_str_equal(p, "foo"); fail_unless(get_basename(p, PATH_MAX, "/") == SUCCESS); fail_unless_str_equal(p, "/"); fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); fail_unless(get_basename(p, PATH_MAX, ".") == SUCCESS); fail_unless_str_equal(p, cwd); fail_unless(get_basename(p, PATH_MAX, "") == SUCCESS); fail_unless_str_equal(p, cwd); } END_TEST START_TEST(test_basename_neg) { char neg[3]; char p[PATH_MAX]; fail_if(get_basename(neg, 3, "/foo/bar") == SUCCESS); fail_unless(get_basename(p, PATH_MAX, NULL) == EINVAL); } END_TEST /**** is_absolute_path ****/ START_TEST(test_is_absolute_path) { fail_unless(is_absolute_path("") == false); fail_unless(is_absolute_path("foo/bar") == false); fail_unless(is_absolute_path("/foo/bar") == true); fail_unless(is_absolute_path("/foo") == true); fail_unless(is_absolute_path("/") == true); } END_TEST /**** get_dirname_and_basename ****/ /* Just a couple of basic tests - get_dirname_and_basename() * uses get_dirname() and get_basename() under the hood which * are tested enough in their specific tests */ START_TEST(test_dirname_and_basename) { char dir[PATH_MAX]; char base[PATH_MAX]; char cwd[PATH_MAX]; int ret; ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, "/foo/bar"); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, "/foo"); fail_unless_str_equal(base, "bar"); ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, "/foo"); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, "/"); fail_unless_str_equal(base, "foo"); ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, "/"); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, "/"); fail_unless_str_equal(base, "/"); fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, "foo"); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, cwd); fail_unless_str_equal(base, "foo"); ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, ""); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, cwd); fail_unless_str_equal(base, ""); ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, "."); fail_unless(ret == SUCCESS); fail_unless_str_equal(dir, cwd); fail_unless_str_equal(base, ""); } END_TEST START_TEST(test_dirname_and_basename_neg) { char dir[PATH_MAX]; char base[PATH_MAX]; int ret; ret = get_directory_and_base_name(dir, PATH_MAX, base, PATH_MAX, NULL); fail_unless(ret == EINVAL); } END_TEST /**** path_concat ****/ START_TEST(test_path_concat) { char p[PATH_MAX]; char p2[9]; fail_unless(path_concat(p, PATH_MAX, "/foo", "bar") == SUCCESS); fail_unless_str_equal(p, "/foo/bar"); fail_unless(path_concat(p, PATH_MAX, "/foo", "/bar") == SUCCESS); fail_unless_str_equal(p, "/foo/bar"); fail_unless(path_concat(p, PATH_MAX, "/foo/", "/bar") == SUCCESS); fail_unless_str_equal(p, "/foo/bar"); fail_unless(path_concat(p, PATH_MAX, "/foo", "") == SUCCESS); fail_unless_str_equal(p, "/foo"); fail_unless(path_concat(p, PATH_MAX, "foo", NULL) == SUCCESS); fail_unless_str_equal(p, "foo"); fail_unless(path_concat(p, PATH_MAX, "", "foo") == SUCCESS); fail_unless_str_equal(p, "foo"); fail_unless(path_concat(p, PATH_MAX, "/", "foo") == SUCCESS); fail_unless_str_equal(p, "/foo"); fail_unless(path_concat(p, PATH_MAX, "/foo", "/") == SUCCESS); fail_unless_str_equal(p, "/foo/"); fail_unless(path_concat(p, PATH_MAX, "/foo", "bar/") == SUCCESS); fail_unless_str_equal(p, "/foo/bar/"); fail_unless(path_concat(p, PATH_MAX, NULL, "foo") == SUCCESS); fail_unless_str_equal(p, "foo"); /* on-by-one */ fail_unless(path_concat(p2, 9, "/foo", "bar") == SUCCESS); fail_unless_str_equal(p2, "/foo/bar"); } END_TEST START_TEST(test_path_concat_neg) { char small[3]; char small2[5]; char small3[7]; char p2[10]; /* these two test different conditions */ /* Test if head is longer than the buffer */ fail_unless(path_concat(small, 3, "/foo", "bar") == ENOBUFS); /* On ENOBUFS, path should be empty */ fail_unless_str_equal(small, ""); /* Test if head is the same length as the buffer */ fail_unless(path_concat(small2, 5, "/foo", "bar") == ENOBUFS); /* On ENOBUFS, path should be empty */ fail_unless_str_equal(small2, ""); /* Test if head+tail is the longer than the buffer */ fail_unless(path_concat(small3, 7, "/foo", "bar") == ENOBUFS); /* On ENOBUFS, path should be empty */ fail_unless_str_equal(small3, ""); /* off-by-one */ /* Fill with garbage data for now */ memset(p2, 'Z', 9); p2[9] = '\0'; fail_unless(path_concat(p2, 8, "/foo", "bar") == ENOBUFS); /* Make sure we don't write past the end of the buffer */ fail_unless(p2[8] == 'Z', "Got [%d]", p2[8]); /* On ENOBUFS, path should be empty */ fail_unless_str_equal(p2, ""); } END_TEST /**** make_path_absolute ****/ START_TEST(test_make_path_absolute) { char p[PATH_MAX]; char p2[PATH_MAX]; char cwd[PATH_MAX]; char *buf; size_t buf_len; int res; fail_unless(make_path_absolute(p, PATH_MAX, "/foo") == SUCCESS); fail_unless_str_equal(p, "/foo"); fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); fail_unless(make_path_absolute(p, PATH_MAX, "foo") == SUCCESS); res = snprintf(p2, PATH_MAX, "%s/foo", cwd); fail_if((res < 0) || (res >= PATH_MAX)); fail_unless_str_equal(p, p2); fail_unless(make_path_absolute(p, PATH_MAX, "") == SUCCESS); fail_unless_str_equal(p, cwd); /* on-by-one; 2 = terminating null + path delimeter */ buf_len = strlen(cwd) + strlen("foo") + 2; buf = malloc(buf_len); fail_if(buf == NULL); fail_unless(make_path_absolute(buf, buf_len, "foo") == SUCCESS); free(buf); } END_TEST START_TEST(test_make_path_absolute_neg) { char small[1]; char cwd[PATH_MAX]; char *small2; int small_len; fail_unless(make_path_absolute(small, 1, "/foo") == ENOBUFS); fail_unless(make_path_absolute(NULL, 1, "/foo") == ENOBUFS); /* off-by-one */ fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); small_len = strlen(cwd) + strlen("foo") + 1; small2 = malloc(small_len); fail_if(small2 == NULL); fail_unless(make_path_absolute(small2, small_len, "foo") == ENOBUFS); free(small2); /* just enough space for cwd */ small_len = strlen(cwd) + 1; small2 = malloc(small_len); fail_if(small2 == NULL); fail_unless(make_path_absolute(small2, small_len, "foo") == ENOBUFS); free(small2); } END_TEST /**** make_normalized_absolute_path ****/ START_TEST(test_make_normalized_absolute_path) { char p[PATH_MAX]; char p2[PATH_MAX]; char cwd[PATH_MAX]; int res; fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); fail_unless(make_normalized_absolute_path(p, PATH_MAX, "foo/baz/../bar") == SUCCESS); res = snprintf(p2, PATH_MAX, "%s/foo/bar", cwd); fail_if((res < 0) || (res >= PATH_MAX)); fail_unless_str_equal(p, p2); fail_unless(make_normalized_absolute_path(p, PATH_MAX, "/foo/../bar") == SUCCESS); fail_unless_str_equal(p, "/bar"); fail_unless(make_normalized_absolute_path(p, PATH_MAX, "/foo/../baz/../bar") == SUCCESS); fail_unless_str_equal(p, "/bar"); } END_TEST START_TEST(test_make_normalized_absolute_path_neg) { char small[1]; fail_unless(make_path_absolute(small, 1, "/foo") == ENOBUFS); fail_unless(make_path_absolute(NULL, 1, "/foo") == ENOBUFS); } END_TEST /**** split_path ****/ START_TEST(test_split_path) { char **array; int n; array = split_path("/foo/bar", &n); fail_if(array == NULL); fail_unless(n == 3); if (array) { fail_unless_str_equal(array[0], "/"); fail_unless_str_equal(array[1], "foo"); fail_unless_str_equal(array[2], "bar"); free(array); } array = split_path("/foo/../bar", &n); fail_if(array == NULL); fail_unless(n == 4); if (array) { fail_unless_str_equal(array[0], "/"); fail_unless_str_equal(array[1], "foo"); fail_unless_str_equal(array[2], ".."); fail_unless_str_equal(array[3], "bar"); free(array); } array = split_path("/foo/bar", NULL); fail_if(array == NULL); if (array) { fail_unless_str_equal(array[0], "/"); fail_unless_str_equal(array[1], "foo"); fail_unless_str_equal(array[2], "bar"); free(array); } array = split_path("foo/bar", &n); fail_if(array == NULL); fail_unless(n == 2); if (array) { fail_unless_str_equal(array[0], "foo"); fail_unless_str_equal(array[1], "bar"); free(array); } array = split_path(".", &n); fail_if(array == NULL); fail_unless(n == 1); if (array) { fail_unless_str_equal(array[0], "."); free(array); } array = split_path("foo", &n); fail_if(array == NULL); fail_unless(n == 1); if (array) { fail_unless_str_equal(array[0], "foo"); free(array); } /* one might expect { "" } or outright NULL, but we agreed not to * do changes beyond bugfixes at this point */ array = split_path("", &n); fail_if(array == NULL); fail_unless(n == 0); if (array) { fail_unless(array[0] == NULL); free(array); } } END_TEST START_TEST(test_split_path_neg) { char **array; int n; array = split_path(NULL, &n); fail_unless(array == NULL); array = split_path(NULL, NULL); fail_unless(array == NULL); } END_TEST /**** normalize_path ****/ START_TEST(test_normalize_path) { char norm[PATH_MAX]; char small[8]; fail_unless(normalize_path(norm, PATH_MAX, "/foo/../bar") == SUCCESS); fail_unless_str_equal(norm, "/bar"); fail_unless(normalize_path(norm, PATH_MAX, "/foo/../baz/../bar") == SUCCESS); fail_unless_str_equal(norm, "/bar"); fail_unless(normalize_path(norm, PATH_MAX, "foo/baz/../bar") == SUCCESS); fail_unless_str_equal(norm, "foo/bar"); fail_unless(normalize_path(norm, PATH_MAX, "/foo/./bar") == SUCCESS); fail_unless_str_equal(norm, "/foo/bar"); fail_unless(normalize_path(norm, PATH_MAX, "/foo//bar") == SUCCESS); fail_unless_str_equal(norm, "/foo/bar"); fail_unless(normalize_path(norm, PATH_MAX, "/foo//bar") == SUCCESS); fail_unless_str_equal(norm, "/foo/bar"); fail_unless(normalize_path(norm, PATH_MAX, "") == SUCCESS); fail_unless_str_equal(norm, "."); fail_unless(normalize_path(norm, PATH_MAX, "/../..") == SUCCESS); fail_unless_str_equal(norm, "/"); /* on-by-one */ fail_unless(normalize_path(small, 8, "foo/baz/../bar") == SUCCESS); fail_unless_str_equal(small, "foo/bar"); } END_TEST START_TEST(test_normalize_path_neg) { char norm[PATH_MAX]; char small[4]; fail_unless(normalize_path(norm, PATH_MAX, "foo/../..") == PATH_UTILS_ERROR_NOT_FULLY_NORMALIZED); /* with a buffer of 4 chars, this would test off-by-one error */ fail_unless(normalize_path(small, 4, "/foo/../bar") == ENOBUFS); } END_TEST /**** common_path_prefix ****/ START_TEST(test_common_path_prefix) { char common[PATH_MAX]; char small[5]; int count; fail_unless(common_path_prefix(common, PATH_MAX, &count, "/usr/lib", "/usr/share") == SUCCESS); fail_unless_str_equal(common, "/usr"); fail_unless(count == 2); fail_unless(common_path_prefix(common, PATH_MAX, NULL, "/usr/lib", "/usr/share") == SUCCESS); fail_unless_str_equal(common, "/usr"); fail_unless(common_path_prefix(common, PATH_MAX, &count, "/usr/lib", "/usr/lab") == SUCCESS); fail_unless_str_equal(common, "/usr"); fail_unless(count == 2); fail_unless(common_path_prefix(common, PATH_MAX, &count, "foo", "bar") == SUCCESS); fail_unless_str_equal(common, ""); fail_unless(count == 0); fail_unless(common_path_prefix(common, PATH_MAX, &count, "/", "/") == SUCCESS); fail_unless_str_equal(common, "/"); fail_unless(count == 1); fail_unless(common_path_prefix(common, PATH_MAX, &count, NULL, "/usr/share") == SUCCESS); fail_unless_str_equal(common, ""); fail_unless(count == 0); /* on-by-one */ fail_unless(common_path_prefix(small, 5, NULL, "/usr/lib", "/usr/share") == SUCCESS); fail_unless_str_equal(small, "/usr"); } END_TEST START_TEST(test_common_path_prefix_neg) { char small[1]; char small2[4]; int count; fail_unless(common_path_prefix(small, 1, &count, "/usr/lib", "/usr/share") == ENOBUFS); fail_unless(common_path_prefix(NULL, PATH_MAX, &count, "/usr/lib", "/usr/share") == ENOBUFS); /* off-by-one */ fail_unless(common_path_prefix(small2, 4, NULL, "/usr/lib", "/usr/share") == ENOBUFS); } END_TEST /**** find_existing_directory_ancestor ****/ START_TEST(test_find_existing_directory_ancestor) { char p[PATH_MAX]; char cwd[PATH_MAX]; fail_unless(find_existing_directory_ancestor(p, PATH_MAX, "/etc/passwd") == SUCCESS); fail_unless_str_equal(p, "/etc"); /* if pathname does not contain a slash, the parent is cwd */ fail_if(getcwd(cwd, PATH_MAX) == NULL, "getcwd failed"); fail_unless(find_existing_directory_ancestor(p, PATH_MAX, "foo/bar") == SUCCESS); fail_unless_str_equal(p, cwd); } END_TEST START_TEST(test_find_existing_directory_ancestor_neg) { char small[4]; fail_unless(find_existing_directory_ancestor(small, 4, "/etc/passwd") == ENOBUFS); fail_unless(find_existing_directory_ancestor(NULL, 4, "/etc/passwd") == ENOBUFS); } END_TEST /**** directory_list ****/ static void setup_directory_list(void) { char *s = NULL; int ret; s = strdup(DIR_TEMPLATE); fail_unless(s != NULL, "strdup failed\n"); if (!s) return; dlist_dir = mkdtemp(s); fail_unless(dlist_dir != NULL, "mkstemp failed [%d][%s]", errno, strerror(errno)); ret = asprintf(&dlist_subdir, "%s/%s", dlist_dir, SUBDIR); fail_unless(ret != 1, "strdup failed\n"); ret = mkdir(dlist_subdir, 0700); fail_unless(ret != -1, "mkdir %s failed [%d][%s]", dlist_subdir, errno, strerror(errno)); ret = asprintf(&dlist_subsubdir, "%s/%s", dlist_subdir, SUBSUBDIR); fail_unless(ret != 1, "strdup failed\n"); ret = mkdir(dlist_subsubdir, 0700); fail_unless(ret != -1, "mkdir %s failed [%d][%s]", dlist_subsubdir, errno, strerror(errno)); } static void teardown_directory_list(void) { int ret; if (dlist_subsubdir) { ret = rmdir(dlist_subsubdir); fail_unless(ret != -1, "unlink %s failed [%d][%s]", dlist_subsubdir, errno, strerror(errno)); free(dlist_subsubdir); dlist_subsubdir = NULL; } if (dlist_subdir) { ret = rmdir(dlist_subdir); fail_unless(ret != -1, "unlink %s failed [%d][%s]", dlist_subdir, errno, strerror(errno)); free(dlist_subdir); dlist_subdir = NULL; } if (dlist_dir) { ret = rmdir(dlist_dir); fail_unless(ret != -1, "unlink %s failed [%d][%s]", dlist_dir, errno, strerror(errno)); free(dlist_dir); dlist_dir = NULL; } } static bool dirlist_cb_nonrecursive(const char *directory, const char *base_name, const char *path, struct stat *info, void *user_data) { int *data = (int *) user_data; fail_unless_str_equal(path, dlist_subdir); fail_unless(*data == 123); return true; } static bool dirlist_cb_recursive(const char *directory, const char *base_name, const char *path, struct stat *info, void *user_data) { bool *seen_child = (bool *) user_data; static bool seen_parent = false; if (!seen_parent) { fail_unless_str_equal(path, dlist_subdir); seen_parent = true; } else { *seen_child = true; fail_unless_str_equal(path, dlist_subsubdir); seen_parent = false; } return true; } START_TEST(test_directory_list) { int data = 123; bool seen_child; fail_unless(directory_list(dlist_dir, false, dirlist_cb_nonrecursive, &data) == SUCCESS); seen_child = false; fail_unless(directory_list(dlist_dir, true, dirlist_cb_recursive, &seen_child) == SUCCESS); fail_unless(seen_child == true); seen_child = false; fail_unless(directory_list(dlist_dir, false, dirlist_cb_recursive, &seen_child) == SUCCESS); fail_unless(seen_child == false); } END_TEST START_TEST(test_directory_list_neg) { fail_if(directory_list("/not/here", false, dirlist_cb_nonrecursive, NULL) == SUCCESS); fail_if(directory_list("/etc/passwd", false, dirlist_cb_nonrecursive, NULL) == SUCCESS); } END_TEST /**** is_ancestor_path ****/ START_TEST(test_is_ancestor_path) { fail_unless(is_ancestor_path("/a/b/c", "/a/b/c/d") == true); /* equal, not ancestor */ fail_unless(is_ancestor_path("/a/b/c/d", "/a/b/c/d") == false); fail_unless(is_ancestor_path("/a/x/c", "/a/b/c/d") == false); fail_unless(is_ancestor_path(NULL, "/a/b/c/d") == false); fail_unless(is_ancestor_path("/a/x/c", NULL) == false); fail_unless(is_ancestor_path(NULL, NULL) == false); fail_unless(is_ancestor_path("", "") == false); } END_TEST static Suite *path_utils_suite(void) { Suite *s = suite_create("path_utils"); TCase *tc_path_utils = tcase_create("path_utils"); TCase *tc_directory_list = tcase_create("path_utils_directory_list"); tcase_add_test(tc_path_utils, test_dirname); tcase_add_test(tc_path_utils, test_dirname_neg); tcase_add_test(tc_path_utils, test_basename); tcase_add_test(tc_path_utils, test_basename_neg); tcase_add_test(tc_path_utils, test_dirname_and_basename); tcase_add_test(tc_path_utils, test_dirname_and_basename_neg); tcase_add_test(tc_path_utils, test_is_absolute_path); tcase_add_test(tc_path_utils, test_path_concat); tcase_add_test(tc_path_utils, test_path_concat_neg); tcase_add_test(tc_path_utils, test_split_path); tcase_add_test(tc_path_utils, test_split_path_neg); tcase_add_test(tc_path_utils, test_make_path_absolute); tcase_add_test(tc_path_utils, test_make_path_absolute_neg); tcase_add_test(tc_path_utils, test_normalize_path); tcase_add_test(tc_path_utils, test_normalize_path_neg); tcase_add_test(tc_path_utils, test_make_normalized_absolute_path); tcase_add_test(tc_path_utils, test_make_normalized_absolute_path_neg); tcase_add_test(tc_path_utils, test_common_path_prefix); tcase_add_test(tc_path_utils, test_common_path_prefix_neg); tcase_add_test(tc_path_utils, test_find_existing_directory_ancestor); tcase_add_test(tc_path_utils, test_find_existing_directory_ancestor_neg); tcase_add_test(tc_path_utils, test_is_ancestor_path); tcase_add_checked_fixture(tc_directory_list, setup_directory_list, teardown_directory_list); tcase_add_test(tc_directory_list, test_directory_list); tcase_add_test(tc_directory_list, test_directory_list_neg); suite_add_tcase(s, tc_path_utils); suite_add_tcase(s, tc_directory_list); return s; } int main(void) { int number_failed; Suite *s = path_utils_suite(); SRunner *sr = srunner_create(s); /* If CK_VERBOSITY is set, use that, otherwise it defaults to CK_NORMAL */ srunner_run_all(sr, CK_ENV); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } ding-libs-0.6.2/refarray/000077500000000000000000000000001417260640400152065ustar00rootroot00000000000000ding-libs-0.6.2/refarray/README.ref_array000066400000000000000000000000731417260640400200370ustar00rootroot00000000000000Documentation for libref_array can be found in ref_array.h ding-libs-0.6.2/refarray/libref_array.sym000066400000000000000000000006041417260640400204010ustar00rootroot00000000000000REF_ARRAY_0.1.1 { global: ref_array_create; ref_array_getref; ref_array_destroy; ref_array_append; ref_array_get; ref_array_getlen; ref_array_len; ref_array_insert; ref_array_replace; ref_array_remove; ref_array_swap; ref_array_reset; ref_array_debug; local: *; }; REF_ARRAY_0.1.4 { global: ref_array_copy; } REF_ARRAY_0.1.1; ding-libs-0.6.2/refarray/ref_array.c000066400000000000000000000341731417260640400173340ustar00rootroot00000000000000/* REF ARRAY Implementation of the dynamic array with reference count. Copyright (C) Dmitri Pal 2009 This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License along with this program. If not, see . */ #include "config.h" #include /* for errors */ #include #include #include #include #include "ref_array.h" #include "trace.h" /* The structure used in referenced array */ struct ref_array { void *storage; /* The storage buffer */ size_t elsize; /* Size of one element in the buffer */ uint32_t size; /* Size of the storage in items */ uint32_t grow_by; /* What increment use to reallocate memory */ uint32_t len; /* Number of the elements in the array */ uint32_t refcount; /* Reference count */ ref_array_fn cb; /* Cleanup callback */ void *cb_data; /* Caller's callback data */ }; /****************************************************/ /* INTERNAL FUNCTIONS */ /****************************************************/ static int ref_array_grow(struct ref_array *ra) { int error = EOK; void *newbuf = NULL; TRACE_FLOW_ENTRY(); TRACE_INFO_NUMBER("Current length: ", ra->len); TRACE_INFO_NUMBER("Current size: ", ra->size); /* Grow buffer if needed */ newbuf = realloc(ra->storage, (ra->size + ra->grow_by) * ra->elsize); if (newbuf == NULL) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); return ENOMEM; } ra->storage = newbuf; ra->size += ra->grow_by; TRACE_INFO_NUMBER("Final size: ", ra->size); TRACE_FLOW_RETURN(error); return error; } /****************************************************/ /* PUBLIC FUNCTIONS */ /****************************************************/ /* Create referenced array */ int ref_array_create(struct ref_array **ra, size_t elemsz, uint32_t grow_by, ref_array_fn cb, void *data) { struct ref_array *new_ra = NULL; TRACE_FLOW_ENTRY(); if (!ra) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } if ((!elemsz) || (!grow_by)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); return EINVAL; } new_ra = (struct ref_array *)malloc(sizeof(struct ref_array)); if (!new_ra) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); return ENOMEM; } new_ra->storage = NULL; new_ra->elsize = elemsz; new_ra->size = 0; new_ra->grow_by = grow_by; new_ra->len = 0; new_ra->refcount = 1; new_ra->cb = cb; new_ra->cb_data = data; *ra = new_ra; TRACE_FLOW_EXIT(); return EOK; } /* Get new reference to an array */ struct ref_array *ref_array_getref(struct ref_array *ra) { TRACE_FLOW_ENTRY(); /* Check if array is not NULL */ if (ra) { TRACE_INFO_NUMBER("Increasing reference count. Current: ", ra->refcount); /* Increase reference count */ ra->refcount++; TRACE_INFO_NUMBER("Increased reference count. New: ", ra->refcount); } else { TRACE_ERROR_STRING("Uninitialized array.", "Returning NULL"); } TRACE_FLOW_EXIT(); return ra; } /* Delete the array */ void ref_array_destroy(struct ref_array *ra) { int idx; TRACE_FLOW_ENTRY(); /* Check if array is not NULL */ if (!ra) { TRACE_INFO_STRING("Uninitialized array.", "Might be Ok..."); return; } TRACE_INFO_NUMBER("Current reference count: ", ra->refcount); if (ra->refcount) { /* Decrease reference count */ ra->refcount--; if (ra->refcount == 0) { TRACE_INFO_NUMBER("It is time to delete array. Count:", ra->refcount); if (ra->cb) { for (idx = 0; idx < ra->len; idx++) { ra->cb((unsigned char *)(ra->storage) + idx * ra->elsize, REF_ARRAY_DESTROY, ra->cb_data); } } free(ra->storage); free(ra); } } else { /* Should never be here... * This can happen if the caller by mistake would try to * destroy the object from within the callback. Brrr.... */ TRACE_ERROR_STRING("Reference count is 0.", "Coding error???"); } TRACE_FLOW_EXIT(); } /* Add new element to the array */ int ref_array_append(struct ref_array *ra, void *element) { int error = EOK; TRACE_FLOW_ENTRY(); if ((!ra) || (!element)) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } /* Do we have enough room for a new element? */ if (ra->size == ra->len) { error = ref_array_grow(ra); if (error) { TRACE_ERROR_NUMBER("Failed to grow array.", error); return error; } } /* Copy element */ memcpy((unsigned char *)(ra->storage) + ra->len * ra->elsize, element, ra->elsize); ra->len++; TRACE_INFO_NUMBER("Length after append: ", ra->len); TRACE_FLOW_EXIT(); return error; } /* Get element */ void *ref_array_get(struct ref_array *ra, uint32_t idx, void *acptr) { TRACE_FLOW_ENTRY(); if (!ra) { TRACE_ERROR_STRING("Uninitialized argument.", ""); return NULL; } if (idx >= ra->len) { TRACE_INFO_NUMBER("Invalid idx.", idx); return NULL; } TRACE_INFO_NUMBER("Index: ", idx); if (acptr) { TRACE_INFO_STRING("Copying data.", ""); memcpy(acptr, (unsigned char *)(ra->storage) + idx * ra->elsize, ra->elsize); } TRACE_FLOW_EXIT(); return (unsigned char *)(ra->storage) + idx * ra->elsize; } /* Get length */ int ref_array_getlen(struct ref_array *ra, uint32_t *len) { TRACE_FLOW_ENTRY(); if ((!ra) || (!len)) { TRACE_ERROR_STRING("Uninitialized argument.", ""); return EINVAL; } *len = ra->len; TRACE_FLOW_EXIT(); return EOK; } /* Alternative function to get length */ uint32_t ref_array_len(struct ref_array *ra) { TRACE_FLOW_ENTRY(); if (!ra) { TRACE_ERROR_STRING("Uninitialized argument.", ""); errno = EINVAL; return 0; } TRACE_FLOW_EXIT(); return ra->len; } /* Insert a new element into the array */ int ref_array_insert(struct ref_array *ra, uint32_t idx, void *element) { int error = EOK; uint32_t i; TRACE_FLOW_ENTRY(); if ((!ra) || (!element)) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } if (idx > ra->len) { TRACE_ERROR_NUMBER("Index is out of range", ERANGE); return ERANGE; } /* Do we have enough room for a new element? */ if (ra->size == ra->len) { error = ref_array_grow(ra); if (error) { TRACE_ERROR_NUMBER("Failed to grow array.", error); return error; } } /* Shift elements right */ for (i = ra->len; i >= (idx + 1); i--) { memcpy((unsigned char *)(ra->storage) + i * ra->elsize, (unsigned char *)(ra->storage) + (i - 1) * ra->elsize, ra->elsize); } /* Overwrite element */ memcpy((unsigned char *)(ra->storage) + idx * ra->elsize, element, ra->elsize); ra->len++; TRACE_FLOW_EXIT(); return error; } /* Replace element in the array */ int ref_array_replace(struct ref_array *ra, uint32_t idx, void *element) { int error = EOK; TRACE_FLOW_ENTRY(); if ((!ra) || (!element)) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } if (idx > ra->len) { TRACE_ERROR_NUMBER("Index is out of range", ERANGE); return ERANGE; } /* Clear old element */ if (ra->cb) ra->cb((unsigned char *)(ra->storage) + idx * ra->elsize, REF_ARRAY_DELETE, ra->cb_data); /* Overwrite element */ memcpy((unsigned char *)(ra->storage) + idx * ra->elsize, element, ra->elsize); TRACE_FLOW_EXIT(); return error; } /* Remove element from the array */ int ref_array_remove(struct ref_array *ra, uint32_t idx) { int error = EOK; uint32_t i; TRACE_FLOW_ENTRY(); if (!ra) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } if (idx >= ra->len) { TRACE_ERROR_NUMBER("Index is out of range", ERANGE); return ERANGE; } /* Clear old element */ if (ra->cb) ra->cb((unsigned char *)(ra->storage) + idx * ra->elsize, REF_ARRAY_DELETE, ra->cb_data); /* Shift elements left */ for (i = idx + 1; i < ra->len; i++) { memcpy((unsigned char *)(ra->storage) + (i - 1) * ra->elsize, (unsigned char *)(ra->storage) + i * ra->elsize, ra->elsize); } ra->len--; TRACE_FLOW_EXIT(); return error; } /* Reset array */ void ref_array_reset(struct ref_array *ra) { int idx; TRACE_FLOW_ENTRY(); /* Check if array is not NULL */ if (!ra) { TRACE_ERROR_STRING("Uninitialized array.", "Coding error???"); return; } if (ra->cb) { for (idx = 0; idx < ra->len; idx++) { ra->cb((unsigned char *)(ra->storage) + idx * ra->elsize, REF_ARRAY_DESTROY, ra->cb_data); } } free(ra->storage); ra->storage = NULL; ra->size = 0; ra->len = 0; TRACE_FLOW_EXIT(); } /* Swap two elements in the array */ int ref_array_swap(struct ref_array *ra, uint32_t idx1, uint32_t idx2) { int error = EOK; void *temp = NULL; TRACE_FLOW_ENTRY(); if (!ra) { TRACE_ERROR_NUMBER("Uninitialized argument.", EINVAL); return EINVAL; } if ((idx1 >= ra->len) || (idx2 >= ra->len)) { TRACE_ERROR_NUMBER("Index is out of range", ERANGE); return ERANGE; } if (idx1 == idx2) { TRACE_FLOW_STRING("ref_array_swap", "Noop return"); return EOK; } temp = malloc(ra->elsize); if (!temp) { TRACE_FLOW_STRING("Failed to allocate memory for temp storage.", ""); return ENOMEM; } memcpy(temp, (unsigned char *)(ra->storage) + idx2 * ra->elsize, ra->elsize); memcpy((unsigned char *)(ra->storage) + idx2 * ra->elsize, (unsigned char *)(ra->storage) + idx1 * ra->elsize, ra->elsize); memcpy((unsigned char *)(ra->storage) + idx1 * ra->elsize, temp, ra->elsize); free(temp); TRACE_FLOW_EXIT(); return error; } /* Copy array */ int ref_array_copy(struct ref_array *ra, ref_array_copy_cb copy_cb, ref_array_fn cb, void *data, struct ref_array **copy_ra) { int error = EOK; int idx; struct ref_array *new_ra = NULL; void *src; void *dst; TRACE_FLOW_ENTRY(); /* Check if array is not NULL */ if ((!ra) || (!copy_ra)) { TRACE_ERROR_NUMBER("Invalid argument.", EINVAL); return EINVAL; } new_ra = (struct ref_array *)malloc(sizeof(struct ref_array)); if (!new_ra) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); return ENOMEM; } new_ra->storage = calloc(ra->size, ra->elsize); if (!(new_ra->storage)) { TRACE_ERROR_NUMBER("Failed to allocate memory.", ENOMEM); free(new_ra); return ENOMEM; } new_ra->elsize = ra->elsize; new_ra->size = ra->size; new_ra->grow_by = ra->grow_by; new_ra->len = 0; new_ra->refcount = 1; new_ra->cb = cb; new_ra->cb_data = data; for (idx = 0; idx < ra->len; idx++) { if (copy_cb) { src = (void *)((unsigned char *)(ra->storage) + idx * ra->elsize); dst = (void *)((unsigned char *)(new_ra->storage) + idx * new_ra->elsize); error = copy_cb(src, (void *)(dst)); if (error) { TRACE_ERROR_NUMBER("Failed to copy data.", error); ref_array_destroy(new_ra); return error; } } else { memcpy((unsigned char *)(new_ra->storage) + idx * new_ra->elsize, (unsigned char *)(ra->storage) + idx * ra->elsize, new_ra->elsize); } (new_ra->len)++; } *copy_ra = new_ra; TRACE_FLOW_EXIT(); return error; } /* Debug function */ void ref_array_debug(struct ref_array *ra, int num) { int i,j; if (!ra) { printf("\nARRAY is NULL\n"); return; } printf("\nARRAY DUMP START\n"); printf("Length = %u\n", ra->len); printf("Size = %u\n", ra->size); printf("Element = %u\n", (unsigned int)(ra->elsize)); printf("Grow by = %u\n", ra->grow_by); printf("Count = %u\n", ra->refcount); printf("ARRAY:\n"); for (i = 0; i < ra->len; i++) { for (j = 0; j < ra->elsize; j++) { printf("%02x", *((unsigned char *)(ra->storage) + i * ra->elsize + j)); } if (num == 0) { printf("\n%s\n", *((char **)((unsigned char *)(ra->storage) + i * ra->elsize))); } else if (num > 0) { printf("\n%d\n", *((uint32_t *)((unsigned char *)(ra->storage) + i * ra->elsize))); } else { printf("\nIt is an object.\n"); } } printf("\nARRAY DUMP END\n\n"); } ding-libs-0.6.2/refarray/ref_array.cfg.doxy.in000066400000000000000000001755171417260640400212500ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "libref_array" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = "The $name class" \ "The $name widget" \ "The $name file" \ is \ provides \ specifies \ contains \ represents \ a \ an \ the # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = NO # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@ # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.c *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *_ut.c config.h # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = NO # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = YES #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = NO # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES ding-libs-0.6.2/refarray/ref_array.h000066400000000000000000000266131417260640400173410ustar00rootroot00000000000000/* REF ARRAY Header file for of the dynamic array with reference count. Copyright (C) Dmitri Pal 2009 This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License along with this program. If not, see . */ #ifndef REF_ARRAY_H #define REF_ARRAY_H #include #include struct ref_array; #ifndef EOK #define EOK 0 #endif /** @mainpage The Referenced Array Interface * * The referenced array interface is a dynamically allocated * array of data of any type. The array can be shared by * multiple objects to avoid data duplication. * * The array is created once and then any number of * the references can be requested. The references are pointers * to the array. Each reference must be freed after use. * Freeing last reference to the array would free the array's storage. * * The array does not have any knowledge of the data type * of the actual data stored in the array. All elements of the array * are of the same size as prescribed by caller when the array is created. * The caller can potentially mix different types of data in the array * but this should be done with caution. * * At the moment the interface is not complete. * It provides basic functionality required to support other * components. In future it might make sense to add entry points * to insert and delete elements from the array. * Current use cases do not require this kind of * functionality so it is left out of the implementation. * */ /** * @defgroup ref_array Interface * @{ */ /** * @brief Enumeration of the delete modes * * When the array is destroyed each element of the array * most likely needs to be freed. Same is true when an element * is removed from the array. However the caller might need * to do different things with the data depending on whether * the array is destroyed or whether the element is removed. * This enumeration defines constants that you used to indicate * which operation was performed. */ typedef enum { REF_ARRAY_DESTROY, REF_ARRAY_DELETE, } ref_array_del_enum; /** * @brief Element cleanup callback * * Callback that can be provided by a caller * to free data when the storage is actually destroyed. * * @param[in] elem Pointer to the array element. * @param[in] type Type of the operation performed. * @param[in] data Application data that can be used * inside the callback. * No return value. */ typedef void (*ref_array_fn)(void *elem, ref_array_del_enum type, void *data); /** * @brief Copy callback * * Callback that can be provided by a caller * to copy elements of the array. * * @param[in] elem Pointer to the array element. * @param[out] new_elem Pointer to pointer to the new element. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * * Callback can return other errors and the implementor's discretion. */ typedef int (*ref_array_copy_cb)(void *elem, void *new_elem); /** * @brief Create referenced array * * @param[out] ra Newly created array object. * @param[in] elem Element size in bytes. * @param[in] grow_by Defines how many elements * should be allocated together * as one chunk. * @param[in] cb Cleanup callback. * @param[in] data Caller supplied data * passed to cleanup callback. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int ref_array_create(struct ref_array **ra, size_t elem, uint32_t grow_by, ref_array_fn cb, void *data); /** * @brief Get new reference to an array * * @param[in] ra Existing array object. * * @return A new reference to an array object. * @return NULL - Invalid argument. */ struct ref_array *ref_array_getref(struct ref_array *ra); /** * @brief Delete the array * * @param[in] ra Existing array object * or a reference. * */ void ref_array_destroy(struct ref_array *ra); /** * @brief Add new element to the array * * Appends an element to the end of the array. * * @param[in] ra Existing array object. * @param[in] element Pointer to data. * The number of bytes * defined at the array creation * as the array size will be copied * into the array element. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int ref_array_append(struct ref_array *ra, void *element); /** * @brief Get element data * * Retrieves data from the array element. * * @param[in] ra Existing array object. * @param[in] idx Index of the array element. * @param[in] acptr Pointer to the memory * where the element's data * will be copied. Can be NULL. * In this case nothing is copied. * * @return Pointer to the data stored in the element. * Conventionally it should be a const pointer, * however such declaration would make using * variable that receives the result of this * function immutable. This is very inconvenient * because such variable should be able to * point to data related to multiple elements * of the array. * * @return Pointer to the element's data. * @return NULL if index is out of range. */ void *ref_array_get(struct ref_array *ra, uint32_t idx, void *acptr); /** * @brief Get array length * * Determines length of the array. * * @param[in] ra Existing array object. * @param[out] len Variable will receive * the length of the array. * * @return 0 - Success. * @return EINVAL - Invalid argument. */ int ref_array_getlen(struct ref_array *ra, uint32_t *len); /** * @brief Array length * * Alternative function to get length. * * @param[in] ra Existing array object. * * @return Length of the array. Returns 0 if the array is invalid. */ uint32_t ref_array_len(struct ref_array *ra); /** * @brief Insert a new element into the array * * Inserts an element into the array. * If idx is 0 the element will be added * to the beginning of the array, * if idx is 1 the element will be added * after the first element of the array * and so on. * If index is greater than the number of * elements in the array the function * returns error. * * @param[in] ra Existing array object. * @param[in] idx Index of the array element. * @param[in] element Pointer to data. * The number of bytes * defined at the array creation * as the array size will be copied * into the array element. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return ERANGE - Index is our of range. */ int ref_array_insert(struct ref_array *ra, uint32_t idx, void *element); /** * @brief Replace element in the array * * Replace an element of the array * identified by index with a new value. * If index is greater than the number of * elements in the array the function * returns error. * * @param[in] ra Existing array object. * @param[in] idx Index of the array element. * @param[in] element Pointer to data. * The number of bytes * defined at the array creation * as the array size will be copied * into the array element. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. * @return ERANGE - Index is our of range. */ int ref_array_replace(struct ref_array *ra, uint32_t idx, void *element); /** * @brief Remove element from the array * * The element is removed and the length * is decreased by 1. * If index is greater than the number of * elements in the array the function * returns error. * * @param[in] ra Existing array object. * @param[in] idx Index of the array element. * * @return 0 - Success. * @return EINVAL - Invalid argument. * @return ERANGE - Index is our of range. */ int ref_array_remove(struct ref_array *ra, uint32_t idx); /** * @brief Swap two elements in the array * * If any of the indexes is greater than * the number of elements in the array * the function returns error. * * @param[in] ra Existing array object. * @param[in] idx1 Index of the array element. * @param[in] idx2 Index of the array element. * * @return 0 - Success. * @return EINVAL - Invalid argument. * @return ERANGE - Index is our of range. * @return ENOMEM - No memory. */ int ref_array_swap(struct ref_array *ra, uint32_t idx1, uint32_t idx2); /** * @brief Reset array * * Function clears all contents without destroying * the object. The delete callback will be called * for every element of the array from the beginning * to the end passing in REF_ARRAY_DESTROY value. * All the storage for the array will be deallocated. * After the call the array will be empty as if just created. * * * @param[in] ra Existing array object. * No return value. * */ void ref_array_reset(struct ref_array *ra); /** * @brief Copy array * * Function copies all contents calling a provided * callback for every entry of the array. * * * @param[in] ra Existing array object to copy. * @param[in] copy_cb Copy callback. * @param[in] cb Cleanup callback, will be used * to clean data in the array copy. * @param[in] data Caller supplied data * passed to cleanup callback. * @param[out] copy_ra Newly allocated copy. * * @return 0 - Success. * @return ENOMEM - No memory. * @return EINVAL - Invalid argument. */ int ref_array_copy(struct ref_array *ra, ref_array_copy_cb copy_cb, ref_array_fn cb, void *data, struct ref_array **copy_ra); /** * @brief Print array for debugging purposes. * * Prints array internals. * * @param[in] ra Existing array object. * @param[in] num If num is 0 elements will be printed as strings. * If num is greater than 0 elements will be printed as * decimal numbers. Otherwise element will not be * interpreted in concrete way. * * No return value. */ void ref_array_debug(struct ref_array *ra, int num); /** * @} */ #endif ding-libs-0.6.2/refarray/ref_array.pc.in000066400000000000000000000004311417260640400201070ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ Name: ref_array Description: A dynamically-growing, reference-counted array Version: @REF_ARRAY_VERSION@ Libs: -L${libdir} -lref_array Cflags: -I${includedir} URL: https://github.com/SSSD/ding-libs ding-libs-0.6.2/refarray/ref_array_ut.c000066400000000000000000000454651417260640400200520ustar00rootroot00000000000000/* REF ARRAY Implementation of the dynamic array with reference count. Copyright (C) Dmitri Pal 2009 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 . */ #include "config.h" #include /* for errors */ #include #include #include #include #include "ref_array.h" #define TRACE_HOME #include "trace.h" int verbose = 0; #define RAOUT(foo) \ do { \ if (verbose) foo; \ } while(0) typedef int (*test_fn)(void); /* Basic test */ static int ref_array_basic_test(void) { const char *line1 = "line1"; const char *line2 = "line2"; const char *line3 = "line3"; const char *line4 = "line4"; const char *line5 = "line5"; const char *line6 = "line6"; uint32_t i; struct ref_array *ra; struct ref_array *ra2; int error = EOK; uint32_t len = 0; uint32_t other_len = 0; char *ret; char *elem; void *ptr; error = ref_array_create(&ra, sizeof(char *), 1, NULL, NULL); if (error) { printf("Failed to create array %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line1); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 1 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line2); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 2 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line3); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 3 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line4); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 4 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line5); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 5 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line6); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 6 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); RAOUT(printf("\n\nTest 1 - Printing lines.\n\n")); error = ref_array_getlen(ra, &other_len); if (error) { ref_array_destroy(ra); printf("Failed to get length %d\n", error); return error; } len = ref_array_len(ra); if (len != other_len) { ref_array_destroy(ra); printf("Lengths do not match:\n"); printf("Len : %d\n", len); printf("Get Len: %d\n", other_len); return EFAULT; } for (i = 0; i < len; i++) { ref_array_get(ra, i, &ret); RAOUT(printf("%s\n", ret)); } RAOUT(printf("\n\nTest 2 - Creating reference and then printing lines.\n\n")); ra2 = ref_array_getref(ra); ref_array_destroy(ra); for (i = 0; i < len; i++) { ret = *((char **)ref_array_get(ra2, i, NULL)); RAOUT(printf("%s\n", ret)); } RAOUT(printf("\n\nTest 3 - Get elements with copying.\n\n")); for (i = 0; i < len; i++) { ref_array_get(ra2, i, &ret); RAOUT(printf("%s\n", ret)); } RAOUT(printf("\n\nTest 4a - Get elements with copying and assignment.\n\n")); /* This is a bad practice to use one variable * as a parameter and as an acceptor for the return value. * See next example for a better way to do it. */ for (i = 0; i < len; i++) { ret = *((char **)ref_array_get(ra2, i, &ret)); RAOUT(printf("%s\n", ret)); } RAOUT(printf("\n\nTest 4b - Get elements with copying and assignment.\n\n")); for (i = 0; i < len; i++) { ret = *((char **)ref_array_get(ra2, i, &elem)); RAOUT(printf("%s\n", ret)); RAOUT(printf("%s\n", elem)); if (strcmp(ret, elem) != 0) { ref_array_destroy(ra2); printf("\nRetrieved strings were expected to be same,\n"); printf("but they are not:\n"); printf("By pointer:[%s]\nAs element:[%s]\n", ret, elem); return EFAULT; } } RAOUT(printf("\n\nTest 5 - While loop up.\n\n")); i = 0; for (;;) { ptr = ref_array_get(ra2, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } RAOUT(printf("\n\nTest 6 - While loop down.\n\n")); i = len - 1; for (;;) { ptr = ref_array_get(ra2, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i--; } else break; } RAOUT(printf("\n\nDone!!!\n\n")); ref_array_destroy(ra2); return EOK; } static void array_cleanup(void *elem, ref_array_del_enum type, void *data) { RAOUT(printf("%s%s\n", (char *)data, *((char **)elem))); free(*((char **)elem)); } /* Free test */ static int ref_array_free_test(void) { const char *line1 = "line1"; const char *line2 = "line2"; const char *line3 = "line3"; const char *line4 = "line4"; char text[] = "Deleting: "; char *str; uint32_t i; struct ref_array *ra; int error = EOK; char *ret; void *ptr; error = ref_array_create(&ra, sizeof(char *), 1, array_cleanup, (char *)text); if (error) { printf("Failed to create array %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); str = strdup(line1); error = ref_array_append(ra, &str); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 1 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); str = strdup(line2); error = ref_array_append(ra, &str); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 2 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); str = strdup(line3); error = ref_array_append(ra, &str); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 3 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); str = strdup(line4); error = ref_array_append(ra, &str); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 4 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } RAOUT(printf("\n\nDone!!!\n\n")); ref_array_destroy(ra); return EOK; } static int ref_array_adv_test(void) { int error = EOK; const char *lines[] = { "line0", "line1", "line2", "line3", "line4", "line5", "line6", "line7", "line8", "line9" }; char text[] = "Deleting: "; char *str; uint32_t i; struct ref_array *ra; char *ret; void *ptr; int expected[] = { 0, 1, 7, 8, 9 }; int expected2[] = { 1, 7, 8, 9, 0 }; error = ref_array_create(&ra, sizeof(char *), 1, array_cleanup, (char *)text); if (error) { printf("Failed to create array %d\n", error); return error; } for (i = 0; i < 5;i++) { str = strdup(lines[i]); error = ref_array_append(ra, &str); if (error) { ref_array_destroy(ra); printf("Failed to append line %d, error %d\n", i, error); return error; } } RAOUT(printf("\nInitial array.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } /* Try to remove invalid entry */ error = ref_array_remove(ra, 1000); if (error != ERANGE) { ref_array_destroy(ra); printf("Removing entry expected error got success.\n"); return -1; } /* Try to insert invalid entry */ error = ref_array_insert(ra, 1000, &text); if (error != ERANGE) { ref_array_destroy(ra); printf("Inserting entry expected error got success.\n"); return -1; } /* Try to replace invalid entry */ error = ref_array_replace(ra, 1000, &text); if (error != ERANGE) { ref_array_destroy(ra); printf("Replacing entry expected error got success.\n"); return -1; } /* Insert several entries */ for (i = 9; i > 4; i--) { str = strdup(lines[i]); error = ref_array_insert(ra, 9 - i, &str); if (error) { ref_array_destroy(ra); free(str); printf("Failed to insert line %d, error %d\n", i, error); return error; } } /* Displpay array contents */ RAOUT(printf("\nArray with inserted values.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } /* Replace everything */ for (i = 0; i < 10;i++) { str = strdup(lines[i]); error = ref_array_replace(ra, i, &str); if (error) { ref_array_destroy(ra); free(str); printf("Failed to replace line %d, error %d\n", i, error); return error; } } /* Displpay array contents */ RAOUT(printf("\nArray with replaced values.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } /* Reset */ ref_array_reset(ra); /* Displpay array contents */ RAOUT(printf("\nEmpty array.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } /* Add everything */ for (i = 0; i < 10;i++) { str = strdup(lines[i]); error = ref_array_insert(ra, i, &str); if (error) { ref_array_destroy(ra); free(str); printf("Failed to insert into array %d\n", error); return error; } } /* Displpay array contents */ RAOUT(printf("\nAll added back.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } /* Remove part */ for (i = 0; i < 5;i++) { error = ref_array_remove(ra, 2); if (error) { ref_array_destroy(ra); printf("Failed to remive item from array %d\n", error); return error; } } /* Displpay array contents */ RAOUT(printf("\nCleaned array.\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("%s\n", ret)); i++; } else break; } RAOUT(printf("\n\nChecking for expected contents\n\n")); i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("Comparing:\n[%s]\n[%s]\n\n", ret, lines[expected[i]])); if (strcmp(ret, lines[expected[i]]) != 0) { printf("Unexpected contents of the array.\n"); ref_array_destroy(ra); return -1; } i++; } else break; } RAOUT(printf("\n\nSwap test\n\n")); if ((error = ref_array_swap(ra, 0, 1)) || (error = ref_array_swap(ra, 1, 2)) || (error = ref_array_swap(ra, 2, 3)) || (error = ref_array_swap(ra, 3, 4))) { ref_array_destroy(ra); printf("Failed to to swap %d\n", error); return error; } i = 0; for (;;) { ptr = ref_array_get(ra, i, &ret); if (ptr) { RAOUT(printf("Comparing:\n[%s]\n[%s]\n\n", ret, lines[expected2[i]])); if (strcmp(ret, lines[expected2[i]]) != 0) { printf("Unexpected contents of the array.\n"); ref_array_destroy(ra); return -1; } i++; } else break; } RAOUT(printf("\n\nDone!!!\n\n")); ref_array_destroy(ra); return EOK; } static int copy_cb(void *elem, void *new_elem) { char *ne = NULL; ne = strdup(*((char **)elem)); *((char **)new_elem) = ne; RAOUT(printf("Source: %s\nCopy:%s\n", *((char **)elem), ne)); return EOK; } static int ref_array_copy_test(void) { const char *line1 = "line1"; const char *line2 = "line2"; const char *line3 = "line3"; const char *line4 = "line4"; const char *line5 = "line5"; const char *line6 = "line6"; uint32_t i; struct ref_array *ra; struct ref_array *ra2; int error = EOK; uint32_t len = 6; char text[] = "Deleting: "; error = ref_array_create(&ra, sizeof(char *), 1, NULL, NULL); if (error) { printf("Failed to create array %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line1); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 1 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line2); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 2 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line3); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 3 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line4); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 4 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line5); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 5 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); error = ref_array_append(ra, &line6); if (error) { ref_array_destroy(ra); printf("Failed to append to array line 6 %d\n", error); return error; } RAOUT(ref_array_debug(ra, 0)); RAOUT(printf("\n\nCopy lines.\n\n")); error = ref_array_copy(ra, copy_cb, array_cleanup, (char *)text, &ra2); if (error) { ref_array_destroy(ra); printf("Failed to copy array %d\n", error); return error; } for (i = 0; i < len; i++) { if (strcmp(*((char **)ref_array_get(ra, i, NULL)), *((char **)ref_array_get(ra2, i, NULL))) != 0) { printf("\nRetrieved strings were expected to be same,\n"); printf("but they are not:\n"); printf("First:[%s]\nSecond:[%s]\n", *((char **)ref_array_get(ra, i, NULL)), *((char **)ref_array_get(ra2, i, NULL))); ref_array_destroy(ra); ref_array_destroy(ra2); return EFAULT; } } RAOUT(printf("\n\nSource array.\n\n")); RAOUT(ref_array_debug(ra, 0)); ref_array_destroy(ra); RAOUT(printf("\n\nAbout to destroy a copy.\n\n")); RAOUT(ref_array_debug(ra2, 0)); ref_array_destroy(ra2); RAOUT(printf("\n\nDone!!!\n\n")); return EOK; } static int ref_array_copy_num_test(void) { uint32_t i,j,k; struct ref_array *ra; struct ref_array *ra2; int error = EOK; uint32_t len = 5; error = ref_array_create(&ra, sizeof(uint32_t), 1, NULL, NULL); if (error) { printf("Failed to create array %d\n", error); return error; } RAOUT(ref_array_debug(ra, 1)); for (i = 0; i < len; i++) { error = ref_array_append(ra, &i); if (error) { ref_array_destroy(ra); printf("Failed to append number to array %d\n", error); return error; } RAOUT(ref_array_debug(ra, 1)); } RAOUT(printf("\n\nCopy num test.\n\n")); error = ref_array_copy(ra, NULL, NULL, NULL, &ra2); if (error) { ref_array_destroy(ra); printf("Failed to copy array %d\n", error); return error; } for (i = 0; i < len; i++) { j = *((uint32_t *)(ref_array_get(ra, i, NULL))); k = *((uint32_t *)(ref_array_get(ra2, i, NULL))); if (j != k) { printf("\nRetrieved values were expected to be same,\n"); printf("but they are not:\n"); printf("First:[%d]\nSecond:[%d]\n", j, k); ref_array_destroy(ra); ref_array_destroy(ra2); return EFAULT; } } ref_array_destroy(ra); ref_array_destroy(ra2); RAOUT(printf("\n\nDone!!!\n\n")); return EOK; } /* Main function of the unit test */ int main(int argc, char *argv[]) { int error = 0; test_fn tests[] = { ref_array_basic_test, ref_array_free_test, ref_array_adv_test, ref_array_copy_test, ref_array_copy_num_test, NULL }; test_fn t; int i = 0; char *var; if ((argc > 1) && (strcmp(argv[1], "-v") == 0)) verbose = 1; else { var = getenv("COMMON_TEST_VERBOSE"); if (var) verbose = 1; } RAOUT(printf("Start\n")); while ((t = tests[i++])) { error = t(); if (error) { RAOUT(printf("Failed with error %d!\n", error)); return error; } } RAOUT(printf("Success!\n")); return 0; } ding-libs-0.6.2/scripts/000077500000000000000000000000001417260640400150625ustar00rootroot00000000000000ding-libs-0.6.2/scripts/release.sh000077500000000000000000000014051417260640400170410ustar00rootroot00000000000000#!/bin/bash function config() { autoreconf -i -f || return $? ./configure } SAVED_PWD=$PWD version=`grep '\[VERSION_NUMBER], \[.*\]' version.m4 |grep '[0-9]\+\.[0-9]\+\.[0-9]\+' -o` tag=$(echo ${version} | tr "." "_") trap "cd $SAVED_PWD; rm -rf ding-libs-${version} ding-libs-${version}.tar" EXIT git archive --format=tar --prefix=ding-libs-${version}/ ding_libs-${tag} > ding-libs-${version}.tar if [ $? -ne 0 ]; then echo "Cannot perform git-archive, check if tag ding_libs-$tag is present in git tree" exit 1 fi tar xf ding-libs-${version}.tar pushd ding-libs-${version} config || exit 1 make dist-gzip || exit 1 # also builds docs popd mv ding-libs-${version}/ding-libs-${version}.tar.gz . gpg --detach-sign --armor ding-libs-${version}.tar.gz ding-libs-0.6.2/trace/000077500000000000000000000000001417260640400144715ustar00rootroot00000000000000ding-libs-0.6.2/trace/trace.h000066400000000000000000000144541417260640400157500ustar00rootroot00000000000000/* COMMON TRACE Common header file for tracing. Copyright (C) Dmitri Pal 2009 This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License along with this program. If not, see . */ #ifndef COMMON_TRACE_H #define COMMON_TRACE_H #ifdef TRACE_LEVEL #define HAVE_TRACE #include /* The trace level is a bit mask */ #define TRACE_FLOW 0x0000001 /* - trace messages that are entry exit into functions */ #define TRACE_ERROR 0x0000002 /* - trace messages that are errors */ #define TRACE_INFO 0x0000004 /* - trace things that are informational */ #ifdef TRACE_HOME /* Define this in the module that contains main */ unsigned trace_level = TRACE_LEVEL; #else extern unsigned trace_level; #endif /* TRACE_HOME */ #endif /* TRACE_LEVEL */ #ifdef HAVE_TRACE /* Tracing strings */ #define TRACE_STRING(level, msg, str) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %s\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (str != NULL) ? str : "(null)"); \ } \ } while(0) /* Tracing unsigned numbers */ #define TRACE_NUMBER(level, msg, num) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %lu\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (unsigned long int)(num)); \ } \ } while(0) /* Tracing signed numbers */ #define TRACE_SNUMBER(level, msg, num) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %ld\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (long int)(num)); \ } \ } while(0) /* Tracing long numbers */ #define TRACE_LNUMBER(level, msg, num) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %llu\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (unsigned long long int)(num)); \ } \ } while(0) /* Tracing signed long numbers */ #define TRACE_SLNUMBER(level, msg, num) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %lld\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (long long int)(num)); \ } \ } while(0) /* Tracing doubles */ #define TRACE_DOUBLE(level, msg, num) \ do { \ if (level & trace_level) { \ printf("[DEBUG] %40s (%4d) %s%s %e\n", \ __FILE__, __LINE__, \ (level == TRACE_ERROR) ? "ERROR-> " : "", \ (msg != NULL) ? msg : "MISSING MESSAGE", \ (double)(num)); \ } \ } while(0) #define TRACE_RETURN(flow, val) \ do { \ char mstr[200]; \ sprintf(mstr, "%s returning:", __FUNCTION__); \ flow(mstr, val); \ } while(0) /* Assertion */ #define TRACE_ASSERT(expression) expression ? : printf("ASSERTION FAILED\n") #else /* HAVE_TRACE */ /* Noop in case the tracing is disabled */ #define TRACE_STRING(level, msg, str) #define TRACE_NUMBER(level, msg, num) #define TRACE_SNUMBER(level, msg, num) #define TRACE_LNUMBER(level, msg, num) #define TRACE_SLNUMBER(level, msg, num) #define TRACE_DOUBLE(level, msg, num) #define TRACE_RETURN(flow, val) #define TRACE_ASSERT(expression) #endif /* HAVE_TRACE */ /* Convenience wrappers for strings */ #define TRACE_FLOW_STRING(msg, str) TRACE_STRING(TRACE_FLOW, msg, str) #define TRACE_ERROR_STRING(msg, str) TRACE_STRING(TRACE_ERROR, msg, str) #define TRACE_INFO_STRING(msg, str) TRACE_STRING(TRACE_INFO, msg, str) /* Convenience wrappers for unsigned numbers */ #define TRACE_FLOW_NUMBER(msg, num) TRACE_NUMBER(TRACE_FLOW, msg, num) #define TRACE_ERROR_NUMBER(msg, num) TRACE_NUMBER(TRACE_ERROR, msg, num) #define TRACE_INFO_NUMBER(msg, num) TRACE_NUMBER(TRACE_INFO, msg, num) /* Convenience wrappers for signed numbers */ #define TRACE_FLOW_SNUMBER(msg, num) TRACE_SNUMBER(TRACE_FLOW, msg, num) #define TRACE_ERROR_SNUMBER(msg, num) TRACE_SNUMBER(TRACE_ERROR, msg, num) #define TRACE_INFO_SNUMBER(msg, num) TRACE_SNUMBER(TRACE_INFO, msg, num) /* Convenience wrappers for 64-bit long unsigned numbers */ #define TRACE_FLOW_LNUMBER(msg, num) TRACE_LNUMBER(TRACE_FLOW, msg, num) #define TRACE_ERROR_LNUMBER(msg, num) TRACE_LNUMBER(TRACE_ERROR, msg, num) #define TRACE_INFO_LNUMBER(msg, num) TRACE_LNUMBER(TRACE_INFO, msg, num) /* Convenience wrappers for 64-bit long signed numbers */ #define TRACE_FLOW_SLNUMBER(msg, num) TRACE_SLNUMBER(TRACE_FLOW, msg, num) #define TRACE_ERROR_SLNUMBER(msg, num) TRACE_SLNUMBER(TRACE_ERROR, msg, num) #define TRACE_INFO_SLNUMBER(msg, num) TRACE_SLNUMBER(TRACE_INFO, msg, num) /* Convenience wrappers for numbers */ #define TRACE_FLOW_DOUBLE(msg, num) TRACE_DOUBLE(TRACE_FLOW, msg, num) #define TRACE_ERROR_DOUBLE(msg, num) TRACE_DOUBLE(TRACE_ERROR, msg, num) #define TRACE_INFO_DOUBLE(msg, num) TRACE_DOUBLE(TRACE_INFO, msg, num) /* Some other nice wrappers for function entry and exit */ #define TRACE_FLOW_ENTRY() TRACE_FLOW_STRING(__FUNCTION__, "Entry") #define TRACE_FLOW_EXIT() TRACE_FLOW_STRING(__FUNCTION__, "Exit") #define TRACE_FLOW_RETURN(val) TRACE_RETURN(TRACE_FLOW_NUMBER, val) #endif /* COMMON_TRACE_H */ ding-libs-0.6.2/version.m4000066400000000000000000000013171417260640400153240ustar00rootroot00000000000000# Primary version number m4_define([VERSION_NUMBER], [0.6.2]) # If the PRERELEASE_VERSION_NUMBER is set, we'll append # it to the release tag when creating an RPM or SRPM # This is intended for build systems to create snapshot # RPMs. The format should be something like: # .20090915gitf1bcde7 # and would result in an SRPM looking like: # ding-libs-0.1.0-0.20090915gitf1bcde7.fc13.src.rpm m4_define([PRERELEASE_VERSION_NUMBER], []) m4_define([PATH_UTILS_VERSION_NUMBER], [0.2.1]) m4_define([DHASH_VERSION_NUMBER], [0.5.0]) m4_define([COLLECTION_VERSION_NUMBER], [0.7.0]) m4_define([REF_ARRAY_VERSION_NUMBER], [0.1.5]) m4_define([BASICOBJECTS_VERSION_NUMBER], [0.1.1]) m4_define([INI_CONFIG_VERSION_NUMBER], [1.3.1])