- GNU LESSER GENERAL PUBLIC LICENSE\r
- Version 2.1, February 1999\r
-\r
- Copyright (C) 1991, 1999 Free Software Foundation, Inc.\r
- 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
- Everyone is permitted to copy and distribute verbatim copies\r
- of this license document, but changing it is not allowed.\r
-\r
-[This is the first released version of the Lesser GPL. It also counts\r
- as the successor of the GNU Library Public License, version 2, hence\r
- the version number 2.1.]\r
-\r
- Preamble\r
-\r
- The licenses for most software are designed to take away your\r
-freedom to share and change it. By contrast, the GNU General Public\r
-Licenses are intended to guarantee your freedom to share and change\r
-free software--to make sure the software is free for all its users.\r
-\r
- This license, the Lesser General Public License, applies to some\r
-specially designated software packages--typically libraries--of the\r
-Free Software Foundation and other authors who decide to use it. You\r
-can use it too, but we suggest you first think carefully about whether\r
-this license or the ordinary General Public License is the better\r
-strategy to use in any particular case, based on the explanations below.\r
-\r
- When we speak of free software, we are referring to freedom of use,\r
-not price. Our General Public Licenses are designed to make sure that\r
-you have the freedom to distribute copies of free software (and charge\r
-for this service if you wish); that you receive source code or can get\r
-it if you want it; that you can change the software and use pieces of\r
-it in new free programs; and that you are informed that you can do\r
-these things.\r
-\r
- To protect your rights, we need to make restrictions that forbid\r
-distributors to deny you these rights or to ask you to surrender these\r
-rights. These restrictions translate to certain responsibilities for\r
-you if you distribute copies of the library or if you modify it.\r
-\r
- For example, if you distribute copies of the library, whether gratis\r
-or for a fee, you must give the recipients all the rights that we gave\r
-you. You must make sure that they, too, receive or can get the source\r
-code. If you link other code with the library, you must provide\r
-complete object files to the recipients, so that they can relink them\r
-with the library after making changes to the library and recompiling\r
-it. And you must show them these terms so they know their rights.\r
-\r
- We protect your rights with a two-step method: (1) we copyright the\r
-library, and (2) we offer you this license, which gives you legal\r
-permission to copy, distribute and/or modify the library.\r
-\r
- To protect each distributor, we want to make it very clear that\r
-there is no warranty for the free library. Also, if the library is\r
-modified by someone else and passed on, the recipients should know\r
-that what they have is not the original version, so that the original\r
-author's reputation will not be affected by problems that might be\r
-introduced by others.\r
-\r
- Finally, software patents pose a constant threat to the existence of\r
-any free program. We wish to make sure that a company cannot\r
-effectively restrict the users of a free program by obtaining a\r
-restrictive license from a patent holder. Therefore, we insist that\r
-any patent license obtained for a version of the library must be\r
-consistent with the full freedom of use specified in this license.\r
-\r
- Most GNU software, including some libraries, is covered by the\r
-ordinary GNU General Public License. This license, the GNU Lesser\r
-General Public License, applies to certain designated libraries, and\r
-is quite different from the ordinary General Public License. We use\r
-this license for certain libraries in order to permit linking those\r
-libraries into non-free programs.\r
-\r
- When a program is linked with a library, whether statically or using\r
-a shared library, the combination of the two is legally speaking a\r
-combined work, a derivative of the original library. The ordinary\r
-General Public License therefore permits such linking only if the\r
-entire combination fits its criteria of freedom. The Lesser General\r
-Public License permits more lax criteria for linking other code with\r
-the library.\r
-\r
- We call this license the "Lesser" General Public License because it\r
-does Less to protect the user's freedom than the ordinary General\r
-Public License. It also provides other free software developers Less\r
-of an advantage over competing non-free programs. These disadvantages\r
-are the reason we use the ordinary General Public License for many\r
-libraries. However, the Lesser license provides advantages in certain\r
-special circumstances.\r
-\r
- For example, on rare occasions, there may be a special need to\r
-encourage the widest possible use of a certain library, so that it becomes\r
-a de-facto standard. To achieve this, non-free programs must be\r
-allowed to use the library. A more frequent case is that a free\r
-library does the same job as widely used non-free libraries. In this\r
-case, there is little to gain by limiting the free library to free\r
-software only, so we use the Lesser General Public License.\r
-\r
- In other cases, permission to use a particular library in non-free\r
-programs enables a greater number of people to use a large body of\r
-free software. For example, permission to use the GNU C Library in\r
-non-free programs enables many more people to use the whole GNU\r
-operating system, as well as its variant, the GNU/Linux operating\r
-system.\r
-\r
- Although the Lesser General Public License is Less protective of the\r
-users' freedom, it does ensure that the user of a program that is\r
-linked with the Library has the freedom and the wherewithal to run\r
-that program using a modified version of the Library.\r
-\r
- The precise terms and conditions for copying, distribution and\r
-modification follow. Pay close attention to the difference between a\r
-"work based on the library" and a "work that uses the library". The\r
-former contains code derived from the library, whereas the latter must\r
-be combined with the library in order to run.\r
-\r
- GNU LESSER GENERAL PUBLIC LICENSE\r
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\r
-\r
- 0. This License Agreement applies to any software library or other\r
-program which contains a notice placed by the copyright holder or\r
-other authorized party saying it may be distributed under the terms of\r
-this Lesser General Public License (also called "this License").\r
-Each licensee is addressed as "you".\r
-\r
- A "library" means a collection of software functions and/or data\r
-prepared so as to be conveniently linked with application programs\r
-(which use some of those functions and data) to form executables.\r
-\r
- The "Library", below, refers to any such software library or work\r
-which has been distributed under these terms. A "work based on the\r
-Library" means either the Library or any derivative work under\r
-copyright law: that is to say, a work containing the Library or a\r
-portion of it, either verbatim or with modifications and/or translated\r
-straightforwardly into another language. (Hereinafter, translation is\r
-included without limitation in the term "modification".)\r
-\r
- "Source code" for a work means the preferred form of the work for\r
-making modifications to it. For a library, complete source code means\r
-all the source code for all modules it contains, plus any associated\r
-interface definition files, plus the scripts used to control compilation\r
-and installation of the library.\r
-\r
- Activities other than copying, distribution and modification are not\r
-covered by this License; they are outside its scope. The act of\r
-running a program using the Library is not restricted, and output from\r
-such a program is covered only if its contents constitute a work based\r
-on the Library (independent of the use of the Library in a tool for\r
-writing it). Whether that is true depends on what the Library does\r
-and what the program that uses the Library does.\r
- \r
- 1. You may copy and distribute verbatim copies of the Library's\r
-complete source code as you receive it, in any medium, provided that\r
-you conspicuously and appropriately publish on each copy an\r
-appropriate copyright notice and disclaimer of warranty; keep intact\r
-all the notices that refer to this License and to the absence of any\r
-warranty; and distribute a copy of this License along with the\r
-Library.\r
-\r
- You may charge a fee for the physical act of transferring a copy,\r
-and you may at your option offer warranty protection in exchange for a\r
-fee.\r
-\r
- 2. You may modify your copy or copies of the Library or any portion\r
-of it, thus forming a work based on the Library, and copy and\r
-distribute such modifications or work under the terms of Section 1\r
-above, provided that you also meet all of these conditions:\r
-\r
- a) The modified work must itself be a software library.\r
-\r
- b) You must cause the files modified to carry prominent notices\r
- stating that you changed the files and the date of any change.\r
-\r
- c) You must cause the whole of the work to be licensed at no\r
- charge to all third parties under the terms of this License.\r
-\r
- d) If a facility in the modified Library refers to a function or a\r
- table of data to be supplied by an application program that uses\r
- the facility, other than as an argument passed when the facility\r
- is invoked, then you must make a good faith effort to ensure that,\r
- in the event an application does not supply such function or\r
- table, the facility still operates, and performs whatever part of\r
- its purpose remains meaningful.\r
-\r
- (For example, a function in a library to compute square roots has\r
- a purpose that is entirely well-defined independent of the\r
- application. Therefore, Subsection 2d requires that any\r
- application-supplied function or table used by this function must\r
- be optional: if the application does not supply it, the square\r
- root function must still compute square roots.)\r
-\r
-These requirements apply to the modified work as a whole. If\r
-identifiable sections of that work are not derived from the Library,\r
-and can be reasonably considered independent and separate works in\r
-themselves, then this License, and its terms, do not apply to those\r
-sections when you distribute them as separate works. But when you\r
-distribute the same sections as part of a whole which is a work based\r
-on the Library, the distribution of the whole must be on the terms of\r
-this License, whose permissions for other licensees extend to the\r
-entire whole, and thus to each and every part regardless of who wrote\r
-it.\r
-\r
-Thus, it is not the intent of this section to claim rights or contest\r
-your rights to work written entirely by you; rather, the intent is to\r
-exercise the right to control the distribution of derivative or\r
-collective works based on the Library.\r
-\r
-In addition, mere aggregation of another work not based on the Library\r
-with the Library (or with a work based on the Library) on a volume of\r
-a storage or distribution medium does not bring the other work under\r
-the scope of this License.\r
-\r
- 3. You may opt to apply the terms of the ordinary GNU General Public\r
-License instead of this License to a given copy of the Library. To do\r
-this, you must alter all the notices that refer to this License, so\r
-that they refer to the ordinary GNU General Public License, version 2,\r
-instead of to this License. (If a newer version than version 2 of the\r
-ordinary GNU General Public License has appeared, then you can specify\r
-that version instead if you wish.) Do not make any other change in\r
-these notices.\r
-\r
- Once this change is made in a given copy, it is irreversible for\r
-that copy, so the ordinary GNU General Public License applies to all\r
-subsequent copies and derivative works made from that copy.\r
-\r
- This option is useful when you wish to copy part of the code of\r
-the Library into a program that is not a library.\r
-\r
- 4. You may copy and distribute the Library (or a portion or\r
-derivative of it, under Section 2) in object code or executable form\r
-under the terms of Sections 1 and 2 above provided that you accompany\r
-it with the complete corresponding machine-readable source code, which\r
-must be distributed under the terms of Sections 1 and 2 above on a\r
-medium customarily used for software interchange.\r
-\r
- If distribution of object code is made by offering access to copy\r
-from a designated place, then offering equivalent access to copy the\r
-source code from the same place satisfies the requirement to\r
-distribute the source code, even though third parties are not\r
-compelled to copy the source along with the object code.\r
-\r
- 5. A program that contains no derivative of any portion of the\r
-Library, but is designed to work with the Library by being compiled or\r
-linked with it, is called a "work that uses the Library". Such a\r
-work, in isolation, is not a derivative work of the Library, and\r
-therefore falls outside the scope of this License.\r
-\r
- However, linking a "work that uses the Library" with the Library\r
-creates an executable that is a derivative of the Library (because it\r
-contains portions of the Library), rather than a "work that uses the\r
-library". The executable is therefore covered by this License.\r
-Section 6 states terms for distribution of such executables.\r
-\r
- When a "work that uses the Library" uses material from a header file\r
-that is part of the Library, the object code for the work may be a\r
-derivative work of the Library even though the source code is not.\r
-Whether this is true is especially significant if the work can be\r
-linked without the Library, or if the work is itself a library. The\r
-threshold for this to be true is not precisely defined by law.\r
-\r
- If such an object file uses only numerical parameters, data\r
-structure layouts and accessors, and small macros and small inline\r
-functions (ten lines or less in length), then the use of the object\r
-file is unrestricted, regardless of whether it is legally a derivative\r
-work. (Executables containing this object code plus portions of the\r
-Library will still fall under Section 6.)\r
-\r
- Otherwise, if the work is a derivative of the Library, you may\r
-distribute the object code for the work under the terms of Section 6.\r
-Any executables containing that work also fall under Section 6,\r
-whether or not they are linked directly with the Library itself.\r
-\r
- 6. As an exception to the Sections above, you may also combine or\r
-link a "work that uses the Library" with the Library to produce a\r
-work containing portions of the Library, and distribute that work\r
-under terms of your choice, provided that the terms permit\r
-modification of the work for the customer's own use and reverse\r
-engineering for debugging such modifications.\r
-\r
- You must give prominent notice with each copy of the work that the\r
-Library is used in it and that the Library and its use are covered by\r
-this License. You must supply a copy of this License. If the work\r
-during execution displays copyright notices, you must include the\r
-copyright notice for the Library among them, as well as a reference\r
-directing the user to the copy of this License. Also, you must do one\r
-of these things:\r
-\r
- a) Accompany the work with the complete corresponding\r
- machine-readable source code for the Library including whatever\r
- changes were used in the work (which must be distributed under\r
- Sections 1 and 2 above); and, if the work is an executable linked\r
- with the Library, with the complete machine-readable "work that\r
- uses the Library", as object code and/or source code, so that the\r
- user can modify the Library and then relink to produce a modified\r
- executable containing the modified Library. (It is understood\r
- that the user who changes the contents of definitions files in the\r
- Library will not necessarily be able to recompile the application\r
- to use the modified definitions.)\r
-\r
- b) Use a suitable shared library mechanism for linking with the\r
- Library. A suitable mechanism is one that (1) uses at run time a\r
- copy of the library already present on the user's computer system,\r
- rather than copying library functions into the executable, and (2)\r
- will operate properly with a modified version of the library, if\r
- the user installs one, as long as the modified version is\r
- interface-compatible with the version that the work was made with.\r
-\r
- c) Accompany the work with a written offer, valid for at\r
- least three years, to give the same user the materials\r
- specified in Subsection 6a, above, for a charge no more\r
- than the cost of performing this distribution.\r
-\r
- d) If distribution of the work is made by offering access to copy\r
- from a designated place, offer equivalent access to copy the above\r
- specified materials from the same place.\r
-\r
- e) Verify that the user has already received a copy of these\r
- materials or that you have already sent this user a copy.\r
-\r
- For an executable, the required form of the "work that uses the\r
-Library" must include any data and utility programs needed for\r
-reproducing the executable from it. However, as a special exception,\r
-the materials to be distributed need not include anything that is\r
-normally distributed (in either source or binary form) with the major\r
-components (compiler, kernel, and so on) of the operating system on\r
-which the executable runs, unless that component itself accompanies\r
-the executable.\r
-\r
- It may happen that this requirement contradicts the license\r
-restrictions of other proprietary libraries that do not normally\r
-accompany the operating system. Such a contradiction means you cannot\r
-use both them and the Library together in an executable that you\r
-distribute.\r
-\r
- 7. You may place library facilities that are a work based on the\r
-Library side-by-side in a single library together with other library\r
-facilities not covered by this License, and distribute such a combined\r
-library, provided that the separate distribution of the work based on\r
-the Library and of the other library facilities is otherwise\r
-permitted, and provided that you do these two things:\r
-\r
- a) Accompany the combined library with a copy of the same work\r
- based on the Library, uncombined with any other library\r
- facilities. This must be distributed under the terms of the\r
- Sections above.\r
-\r
- b) Give prominent notice with the combined library of the fact\r
- that part of it is a work based on the Library, and explaining\r
- where to find the accompanying uncombined form of the same work.\r
-\r
- 8. You may not copy, modify, sublicense, link with, or distribute\r
-the Library except as expressly provided under this License. Any\r
-attempt otherwise to copy, modify, sublicense, link with, or\r
-distribute the Library is void, and will automatically terminate your\r
-rights under this License. However, parties who have received copies,\r
-or rights, from you under this License will not have their licenses\r
-terminated so long as such parties remain in full compliance.\r
-\r
- 9. You are not required to accept this License, since you have not\r
-signed it. However, nothing else grants you permission to modify or\r
-distribute the Library or its derivative works. These actions are\r
-prohibited by law if you do not accept this License. Therefore, by\r
-modifying or distributing the Library (or any work based on the\r
-Library), you indicate your acceptance of this License to do so, and\r
-all its terms and conditions for copying, distributing or modifying\r
-the Library or works based on it.\r
-\r
- 10. Each time you redistribute the Library (or any work based on the\r
-Library), the recipient automatically receives a license from the\r
-original licensor to copy, distribute, link with or modify the Library\r
-subject to these terms and conditions. You may not impose any further\r
-restrictions on the recipients' exercise of the rights granted herein.\r
-You are not responsible for enforcing compliance by third parties with\r
-this License.\r
-\r
- 11. If, as a consequence of a court judgment or allegation of patent\r
-infringement or for any other reason (not limited to patent issues),\r
-conditions are imposed on you (whether by court order, agreement or\r
-otherwise) that contradict the conditions of this License, they do not\r
-excuse you from the conditions of this License. If you cannot\r
-distribute so as to satisfy simultaneously your obligations under this\r
-License and any other pertinent obligations, then as a consequence you\r
-may not distribute the Library at all. For example, if a patent\r
-license would not permit royalty-free redistribution of the Library by\r
-all those who receive copies directly or indirectly through you, then\r
-the only way you could satisfy both it and this License would be to\r
-refrain entirely from distribution of the Library.\r
-\r
-If any portion of this section is held invalid or unenforceable under any\r
-particular circumstance, the balance of the section is intended to apply,\r
-and the section as a whole is intended to apply in other circumstances.\r
-\r
-It is not the purpose of this section to induce you to infringe any\r
-patents or other property right claims or to contest validity of any\r
-such claims; this section has the sole purpose of protecting the\r
-integrity of the free software distribution system which is\r
-implemented by public license practices. Many people have made\r
-generous contributions to the wide range of software distributed\r
-through that system in reliance on consistent application of that\r
-system; it is up to the author/donor to decide if he or she is willing\r
-to distribute software through any other system and a licensee cannot\r
-impose that choice.\r
-\r
-This section is intended to make thoroughly clear what is believed to\r
-be a consequence of the rest of this License.\r
-\r
- 12. If the distribution and/or use of the Library is restricted in\r
-certain countries either by patents or by copyrighted interfaces, the\r
-original copyright holder who places the Library under this License may add\r
-an explicit geographical distribution limitation excluding those countries,\r
-so that distribution is permitted only in or among countries not thus\r
-excluded. In such case, this License incorporates the limitation as if\r
-written in the body of this License.\r
-\r
- 13. The Free Software Foundation may publish revised and/or new\r
-versions of the Lesser General Public License from time to time.\r
-Such new versions will be similar in spirit to the present version,\r
-but may differ in detail to address new problems or concerns.\r
-\r
-Each version is given a distinguishing version number. If the Library\r
-specifies a version number of this License which applies to it and\r
-"any later version", you have the option of following the terms and\r
-conditions either of that version or of any later version published by\r
-the Free Software Foundation. If the Library does not specify a\r
-license version number, you may choose any version ever published by\r
-the Free Software Foundation.\r
-\r
- 14. If you wish to incorporate parts of the Library into other free\r
-programs whose distribution conditions are incompatible with these,\r
-write to the author to ask for permission. For software which is\r
-copyrighted by the Free Software Foundation, write to the Free\r
-Software Foundation; we sometimes make exceptions for this. Our\r
-decision will be guided by the two goals of preserving the free status\r
-of all derivatives of our free software and of promoting the sharing\r
-and reuse of software generally.\r
-\r
- NO WARRANTY\r
-\r
- 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO\r
-WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.\r
-EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR\r
-OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY\r
-KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE\r
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\r
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE\r
-LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME\r
-THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.\r
-\r
- 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN\r
-WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY\r
-AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU\r
-FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR\r
-CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE\r
-LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING\r
-RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A\r
-FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF\r
-SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH\r
-DAMAGES.\r
-\r
- END OF TERMS AND CONDITIONS\r
-\r
- How to Apply These Terms to Your New Libraries\r
-\r
- If you develop a new library, and you want it to be of the greatest\r
-possible use to the public, we recommend making it free software that\r
-everyone can redistribute and change. You can do so by permitting\r
-redistribution under these terms (or, alternatively, under the terms of the\r
-ordinary General Public License).\r
-\r
- To apply these terms, attach the following notices to the library. It is\r
-safest to attach them to the start of each source file to most effectively\r
-convey the exclusion of warranty; and each file should have at least the\r
-"copyright" line and a pointer to where the full notice is found.\r
-\r
- <one line to give the library's name and a brief idea of what it does.>\r
- Copyright (C) <year> <name of author>\r
-\r
- This library is free software; you can redistribute it and/or\r
- modify it under the terms of the GNU Lesser General Public\r
- License as published by the Free Software Foundation; either\r
- version 2 of the License, or (at your option) any later version.\r
-\r
- This library is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
- Lesser General Public License for more details.\r
-\r
- You should have received a copy of the GNU Lesser General Public\r
- License along with this library; if not, write to the Free Software\r
- Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
-\r
-Also add information on how to contact you by electronic and paper mail.\r
-\r
-You should also get your employer (if you work as a programmer) or your\r
-school, if any, to sign a "copyright disclaimer" for the library, if\r
-necessary. Here is a sample; alter the names:\r
-\r
- Yoyodyne, Inc., hereby disclaims all copyright interest in the\r
- library `Frob' (a library for tweaking knobs) written by James Random Hacker.\r
-\r
- <signature of Ty Coon>, 1 April 1990\r
- Ty Coon, President of Vice\r
-\r
-That's all there is to it!\r
-\r
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL. It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+ Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+ This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it. You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+ When we speak of free software, we are referring to freedom of use,
+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 this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+ To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights. These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+ For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you. You must make sure that they, too, receive or can get the source
+code. If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it. And you must show them these terms so they know their rights.
+
+ We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+ To protect each distributor, we want to make it very clear that
+there is no warranty for the free library. Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+ Finally, software patents pose a constant threat to the existence of
+any free program. We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder. Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+ Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License. This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License. We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+ When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library. The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom. The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+ We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License. It also provides other free software developers Less
+of an advantage over competing non-free programs. These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries. However, the Lesser license provides advantages in certain
+special circumstances.
+
+ For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard. To achieve this, non-free programs must be
+allowed to use the library. A more frequent case is that a free
+library does the same job as widely used non-free libraries. In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+ In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software. For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+ Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+ The precise terms and conditions for copying, distribution and
+modification follow. Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library". The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+ GNU LESSER GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+ A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+ The "Library", below, refers to any such software library or work
+which has been distributed under these terms. A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language. (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+ "Source code" for a work means the preferred form of the work for
+making modifications to it. For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+ Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it). Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+ 1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+ You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+ 2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) The modified work must itself be a software library.
+
+ b) You must cause the files modified to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ c) You must cause the whole of the work to be licensed at no
+ charge to all third parties under the terms of this License.
+
+ d) If a facility in the modified Library refers to a function or a
+ table of data to be supplied by an application program that uses
+ the facility, other than as an argument passed when the facility
+ is invoked, then you must make a good faith effort to ensure that,
+ in the event an application does not supply such function or
+ table, the facility still operates, and performs whatever part of
+ its purpose remains meaningful.
+
+ (For example, a function in a library to compute square roots has
+ a purpose that is entirely well-defined independent of the
+ application. Therefore, Subsection 2d requires that any
+ application-supplied function or table used by this function must
+ be optional: if the application does not supply it, the square
+ root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library. To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License. (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.) Do not make any other change in
+these notices.
+
+ Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+ This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+ 4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+ If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+ 5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library". Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+ However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library". The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+ When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library. The
+threshold for this to be true is not precisely defined by law.
+
+ If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work. (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+ Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+ 6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+ You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License. You must supply a copy of this License. If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License. Also, you must do one
+of these things:
+
+ a) Accompany the work with the complete corresponding
+ machine-readable source code for the Library including whatever
+ changes were used in the work (which must be distributed under
+ Sections 1 and 2 above); and, if the work is an executable linked
+ with the Library, with the complete machine-readable "work that
+ uses the Library", as object code and/or source code, so that the
+ user can modify the Library and then relink to produce a modified
+ executable containing the modified Library. (It is understood
+ that the user who changes the contents of definitions files in the
+ Library will not necessarily be able to recompile the application
+ to use the modified definitions.)
+
+ b) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (1) uses at run time a
+ copy of the library already present on the user's computer system,
+ rather than copying library functions into the executable, and (2)
+ will operate properly with a modified version of the library, if
+ the user installs one, as long as the modified version is
+ interface-compatible with the version that the work was made with.
+
+ c) Accompany the work with a written offer, valid for at
+ least three years, to give the same user the materials
+ specified in Subsection 6a, above, for a charge no more
+ than the cost of performing this distribution.
+
+ d) If distribution of the work is made by offering access to copy
+ from a designated place, offer equivalent access to copy the above
+ specified materials from the same place.
+
+ e) Verify that the user has already received a copy of these
+ materials or that you have already sent this user a copy.
+
+ For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it. However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+ It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system. Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+ 7. 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 not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+ a) Accompany the combined library with a copy of the same work
+ based on the Library, uncombined with any other library
+ facilities. This must be distributed under the terms of the
+ Sections above.
+
+ b) Give prominent notice with the combined library of the fact
+ that part of it is a work based on the Library, and explaining
+ where to find the accompanying uncombined form of the same work.
+
+ 8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License. Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License. However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+ 9. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Library or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+ 10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+ 11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all. For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+ 12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded. In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+ 13. The Free Software Foundation may publish revised and/or new
+versions of the 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
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation. If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+ 14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission. For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this. Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+ NO WARRANTY
+
+ 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "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
+LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY 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
+LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Libraries
+
+ If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change. You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+ To apply these terms, attach the following notices to the library. It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the library's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This 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 2 of the License, or (at your option) any later version.
+
+ This 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 this library; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the
+ library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+ <signature of Ty Coon>, 1 April 1990
+ Ty Coon, President of Vice
+
+That's all there is to it!
+
-The MIT License (MIT)\r
-Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved\r
-\r
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\r
-\r
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\r
-\r
+The MIT License (MIT)
+Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
CAPI_FLAGS = $(COMMON_FLAGS)
TIZEN_FLAGS = $(COMMON_FLAGS) -DTIZENAPP
-LIBDIR_COMMON =
-LIBDIR_CAPI = $(LIBDIR_COMMON)
+LIBDIR_COMMON =
+LIBDIR_CAPI = $(LIBDIR_COMMON)
LIBDIR_TIZEN = $(LIBDIR_COMMON) -L/usr/lib/osp
COMMON_LDFLAGS = -ldl -lpthread -lrt -lecore -levas -lecore_input -leina -lecore_x -lcapi-system-runtime-info -lcapi-appfw-application -lX11 -lXext
Copyright (c) 2013 Samsung Electronics Co., Ltd. All rights reserved.
Except as noted, this software is licensed under Lesser GNU Public License , Version 2.1.
Please, see the LICENSE.LGPLv2.1 file for Lesser General Public License terms and conditions.
-
+
Several source codes may have its original copyright owner and/or
be licensed under other than Lesser GNU Public License , Version 2.1, say, MIT License.
Please, see copyright and license comments section in the header of each file,
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <pthread.h>
da_user_data_2_chart_data callback, void* user_data)
{
chart_interval_callback* newelem;
-
+
newelem = (chart_interval_callback*)malloc(sizeof(chart_interval_callback));
newelem->chart_handle = charthandle;
newelem->series_handle = series_handle;
newelem->user_data = user_data;
chm.interval_for_series[charthandle][series_handle % 10] = interval;
-
+
switch(interval)
{
case CHART_INTERVAL_10MSEC:
static void remove_all_callback_list()
{
chart_interval_callback* cur;
-
+
pthread_mutex_lock(&chm.interval_10ms.list_mutex);
while(chm.interval_10ms.callback_list != NULL)
{
void da_mark(chart_color color, char* mark_text)
{
DECLARE_CHART_VARIABLE;
-
+
probeBlockStart();
-
+
setProbePoint(&probeInfo);
PREPARE_LOCAL_BUF();
// check if there is available chart handle slot
if(chm.chart_handle_index + 1 >= MAX_CHART_HANDLE)
return ERR_MAX_CHART_NUMBER;
-
+
// check if chart_name is null
if(chart_name == NULL)
return ERR_WRONG_PARAMETER;
-
+
probeBlockStart();
ret = ++(chm.chart_handle_index);
PACK_COMMON_END(ret, 0, 2);
PACK_CUSTOM(0, 0, chart_name, 0, 0.0f);
FLUSH_LOCAL_BUF();
-
+
probeBlockEnd();
-
+
return ret;
}
series_type type, chart_color color)
{
DECLARE_CHART_VARIABLE;
-
+
// check if charthandle is valid handle or not
if(charthandle <= 0 || charthandle > chm.chart_handle_index)
return ERR_WRONG_HANDLE;
-
+
// chech if extra parameter is valid
if(seriesname == NULL)
return ERR_WRONG_PARAMETER;
// check if there is available series spot
if(chm.series_handle_index[(int)charthandle] + 1 >= MAX_SERIES_PER_CHART)
return ERR_MAX_CHART_NUMBER;
-
+
probeBlockStart();
ret = ++(chm.series_handle_index[charthandle]);
ret += (10 * charthandle);
-
+
setProbePoint(&probeInfo);
PREPARE_LOCAL_BUF();
FLUSH_LOCAL_BUF();
probeBlockEnd();
-
+
return ret;
}
-
+
da_handle da_create_default_series(da_handle charthandle, char* seriesname)
{
return da_create_series(charthandle, seriesname,
int cindex, sindex;
cindex = (int)(series_handle / 10);
sindex = series_handle % 10;
-
+
// check series handle
if(cindex <= 0 || cindex > chm.chart_handle_index)
return ERR_WRONG_HANDLE;
-
+
if(sindex > chm.series_handle_index[(int)cindex])
return ERR_WRONG_HANDLE;
-
+
// check rest parameters
if(interval == CHART_NO_CYCLE && callback != NULL)
return ERR_WRONG_PARAMETER;
void da_log(da_handle series_handle, float uservalue)
{
DECLARE_CHART_VARIABLE;
-
+
// chech if series handle is valid
int cindex, sindex;
cindex = (int)(series_handle / 10);
sindex = series_handle % 10;
-
+
if(cindex <= 0 || cindex > chm.chart_handle_index)
return;
-
+
if(sindex > chm.series_handle_index[(int)cindex])
return;
-
+
probeBlockStart();
-
+
setProbePoint(&probeInfo);
PREPARE_LOCAL_BUF();
PACK_COMMON_END(0, 0, 2);
PACK_CUSTOM(series_handle, 0, "", 0, uservalue);
FLUSH_LOCAL_BUF();
-
+
probeBlockEnd();
}
-/*\r
- * DA probe\r
- *\r
- * Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.\r
- *\r
- * Contact: \r
- *\r
- * Jaewon Lim <jaewon81.lim@samsung.com>\r
- * Woojin Jung <woojin2.jung@samsung.com>\r
- * Juyoung Kim <j0.kim@samsung.com>\r
- * \r
- * This library is free software; you can redistribute it and/or modify it under\r
- * the terms of the GNU Lesser General Public License as published by the\r
- * Free Software Foundation; either version 2.1 of the License, or (at your option)\r
- * any later version.\r
- * \r
- * This library is distributed in the hope that it will be useful, but WITHOUT ANY\r
- * WARRANTY; without even the implied warranty of MERCHANTABILITY or\r
- * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public\r
- * License for more details.\r
- *\r
- * You should have received a copy of the GNU Lesser General Public License\r
- * along with this library; if not, write to the Free Software Foundation, Inc., 51\r
- * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\r
- *\r
- * Contributors:\r
- * - S-Core Co., Ltd\r
- * \r
- */\r
-\r
-#ifndef __DA_CHART_H__\r
-#define __DA_CHART_H__\r
-\r
-#ifdef __cplusplus\r
-extern "C" {\r
-#endif\r
-\r
-// Error code \r
-#define ERR_MAX_CHART_NUMBER -1001 // no more chart or series can be added\r
-#define ERR_WRONG_HANDLE -1002 // chart or series handle is wrong handle\r
-#define ERR_WRONG_PARAMETER -1003 // wrong parameter\r
-\r
-typedef enum\r
-{\r
- CHART_TYPE_AUTO = 0,\r
- CHART_TYPE_LINE = 1,\r
- CHART_TYPE_BAR = 2,\r
- CHART_TYPE_AREA = 3,\r
- CHART_TYPE_STEP = 4\r
-} series_type;\r
-\r
-typedef enum\r
-{\r
- CHART_COLOR_AUTO = 0,\r
- CHART_COLOR_BLUE = 1,\r
- CHART_COLOR_GREEN = 2,\r
- CHART_COLOR_RED = 3,\r
- CHART_COLOR_BROWN = 4,\r
- CHART_COLOR_PURPLE = 5,\r
- CHART_COLOR_NAVY = 6,\r
- CHART_COLOR_CHOCOLATE = 7,\r
- CHART_COLOR_INDIGO = 8,\r
- CHART_COLOR_MAGENTA = 9,\r
- CHART_COLOR_TEAL = 10\r
-} chart_color;\r
-\r
-typedef enum\r
-{\r
- CHART_NO_CYCLE = 0,\r
- CHART_INTERVAL_10MSEC = 1,\r
- CHART_INTERVAL_100MSEC = 2,\r
- CHART_INTERVAL_1SEC = 3\r
-} chart_interval;\r
-\r
-typedef int da_handle;\r
-typedef float (* da_user_data_2_chart_data) (void* data_addr);\r
-\r
-\r
-// api definition\r
-#ifdef _USE_DA_\r
-\r
-extern da_handle da_create_chart (char* chart_name);\r
-extern da_handle da_create_series (da_handle charthandle, char* seriesname,\r
- series_type type, chart_color color);\r
-extern da_handle da_create_default_series (da_handle charthandle, char* seriesname);\r
-extern int da_set_callback (da_handle series_handle, da_user_data_2_chart_data callback,\r
- void* data_addr, chart_interval interval);\r
-extern void da_log (da_handle series_handle, float uservalue);\r
-\r
-\r
-extern void da_mark (chart_color color, char* mark_text);\r
-\r
-#else // _USE_DA_ (do not use da custom chart)\r
-\r
-#define da_create_chart(a) 0\r
-#define da_create_series(a, b, c, d) 0\r
-#define da_create_default_series(a, b) 0\r
-#define da_set_callback(a, b, c, d) 0\r
-#define da_log(a, b)\r
-\r
-\r
-#define da_mark(color, text)\r
-\r
-#endif // _USE_DA_\r
-\r
-#ifdef __cplusplus\r
-}\r
-#endif\r
-\r
-#endif // __DA_CHART_H__\r
+/*
+ * DA probe
+ *
+ * Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
+ *
+ * Contact:
+ *
+ * Jaewon Lim <jaewon81.lim@samsung.com>
+ * Woojin Jung <woojin2.jung@samsung.com>
+ * Juyoung Kim <j0.kim@samsung.com>
+ *
+ * This 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 2.1 of the License, or (at your option)
+ * any later version.
+ *
+ * This 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 this library; if not, write to the Free Software Foundation, Inc., 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Contributors:
+ * - S-Core Co., Ltd
+ *
+ */
+
+#ifndef __DA_CHART_H__
+#define __DA_CHART_H__
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// Error code
+#define ERR_MAX_CHART_NUMBER -1001 // no more chart or series can be added
+#define ERR_WRONG_HANDLE -1002 // chart or series handle is wrong handle
+#define ERR_WRONG_PARAMETER -1003 // wrong parameter
+
+typedef enum
+{
+ CHART_TYPE_AUTO = 0,
+ CHART_TYPE_LINE = 1,
+ CHART_TYPE_BAR = 2,
+ CHART_TYPE_AREA = 3,
+ CHART_TYPE_STEP = 4
+} series_type;
+
+typedef enum
+{
+ CHART_COLOR_AUTO = 0,
+ CHART_COLOR_BLUE = 1,
+ CHART_COLOR_GREEN = 2,
+ CHART_COLOR_RED = 3,
+ CHART_COLOR_BROWN = 4,
+ CHART_COLOR_PURPLE = 5,
+ CHART_COLOR_NAVY = 6,
+ CHART_COLOR_CHOCOLATE = 7,
+ CHART_COLOR_INDIGO = 8,
+ CHART_COLOR_MAGENTA = 9,
+ CHART_COLOR_TEAL = 10
+} chart_color;
+
+typedef enum
+{
+ CHART_NO_CYCLE = 0,
+ CHART_INTERVAL_10MSEC = 1,
+ CHART_INTERVAL_100MSEC = 2,
+ CHART_INTERVAL_1SEC = 3
+} chart_interval;
+
+typedef int da_handle;
+typedef float (* da_user_data_2_chart_data) (void* data_addr);
+
+
+// api definition
+#ifdef _USE_DA_
+
+extern da_handle da_create_chart (char* chart_name);
+extern da_handle da_create_series (da_handle charthandle, char* seriesname,
+ series_type type, chart_color color);
+extern da_handle da_create_default_series (da_handle charthandle, char* seriesname);
+extern int da_set_callback (da_handle series_handle, da_user_data_2_chart_data callback,
+ void* data_addr, chart_interval interval);
+extern void da_log (da_handle series_handle, float uservalue);
+
+
+extern void da_mark (chart_color color, char* mark_text);
+
+#else // _USE_DA_ (do not use da custom chart)
+
+#define da_create_chart(a) 0
+#define da_create_series(a, b, c, d) 0
+#define da_create_default_series(a, b) 0
+#define da_set_callback(a, b, c, d) 0
+#define da_log(a, b)
+
+
+#define da_mark(color, text)
+
+#endif // _USE_DA_
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // __DA_CHART_H__
-/*\r
- * DA probe\r
- *\r
- * Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.\r
- *\r
- * Contact: \r
- *\r
- * Jaewon Lim <jaewon81.lim@samsung.com>\r
- * Woojin Jung <woojin2.jung@samsung.com>\r
- * Juyoung Kim <j0.kim@samsung.com>\r
- * \r
- * This library is free software; you can redistribute it and/or modify it under\r
- * the terms of the GNU Lesser General Public License as published by the\r
- * Free Software Foundation; either version 2.1 of the License, or (at your option)\r
- * any later version.\r
- * \r
- * This library is distributed in the hope that it will be useful, but WITHOUT ANY\r
- * WARRANTY; without even the implied warranty of MERCHANTABILITY or\r
- * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public\r
- * License for more details.\r
- *\r
- * You should have received a copy of the GNU Lesser General Public License\r
- * along with this library; if not, write to the Free Software Foundation, Inc., 51\r
- * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\r
- *\r
- * Contributors:\r
- * - S-Core Co., Ltd\r
- * \r
- */\r
-\r
-#define _USE_DA_\r
-#include "da_chart.h"\r
-\r
-// =====================================================================\r
-// api definition\r
-// =====================================================================\r
-\r
-void da_mark(chart_color color, char* mark_text)\r
-{\r
-}\r
-\r
-da_handle da_create_chart(char* chart_name)\r
-{\r
- return 0;\r
-}\r
-\r
-da_handle da_create_series(da_handle charthandle, char* seriesname,\r
- series_type type, chart_color color)\r
-{\r
- return 0;\r
-}\r
- \r
-da_handle da_create_default_series(da_handle charthandle, char* seriesname)\r
-{\r
- return 0;\r
-}\r
-\r
-int da_set_callback(da_handle series_handle, da_user_data_2_chart_data callback, void* data_addr, chart_interval interval)\r
-{\r
- return 0;\r
-}\r
-\r
-void da_log(da_handle series_handle, float uservalue)\r
-{\r
-}\r
+/*
+ * DA probe
+ *
+ * Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
+ *
+ * Contact:
+ *
+ * Jaewon Lim <jaewon81.lim@samsung.com>
+ * Woojin Jung <woojin2.jung@samsung.com>
+ * Juyoung Kim <j0.kim@samsung.com>
+ *
+ * This 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 2.1 of the License, or (at your option)
+ * any later version.
+ *
+ * This 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 this library; if not, write to the Free Software Foundation, Inc., 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Contributors:
+ * - S-Core Co., Ltd
+ *
+ */
+
+#define _USE_DA_
+#include "da_chart.h"
+
+// =====================================================================
+// api definition
+// =====================================================================
+
+void da_mark(chart_color color, char* mark_text)
+{
+}
+
+da_handle da_create_chart(char* chart_name)
+{
+ return 0;
+}
+
+da_handle da_create_series(da_handle charthandle, char* seriesname,
+ series_type type, chart_color color)
+{
+ return 0;
+}
+
+da_handle da_create_default_series(da_handle charthandle, char* seriesname)
+{
+ return 0;
+}
+
+int da_set_callback(da_handle series_handle, da_user_data_2_chart_data callback, void* data_addr, chart_interval interval)
+{
+ return 0;
+}
+
+void da_log(da_handle series_handle, float uservalue)
+{
+}
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <dlfcn.h>
int strtab_idx = sec_hdr[symtab_idx].sh_link;
if(likely((strtab_idx != 0) && (sec_hdr[strtab_idx].sh_type == SHT_STRTAB))) // associated string table is valid
{
- pdata = (symdata_t*)malloc(sizeof(symdata_t) +
+ pdata = (symdata_t*)malloc(sizeof(symdata_t) +
sec_hdr[symtab_idx].sh_size +
sec_hdr[strtab_idx].sh_size);
for (cnt = 0; cnt < size; ++cnt)
{
struct link_map* map;
-
+
if(find_symbol_hash(array[cnt], &foundsym) <= 0) // not found or error
{
status[cnt] = dladdr1 (array[cnt], &info[cnt], (void**)&map, RTLD_DL_LINKMAP);
total += (strlen (info[cnt].dli_fname ?: "")
+ strlen (info[cnt].dli_sname ?: "")
+ 3 + WORD_WIDTH + 3 + WORD_WIDTH + 5);
-
+
/* The load bias is more useful to the user than the load
address. The use of these addresses is to calculate an
address in the ELF file, so its prelinked bias is not
for (cnt = 0; cnt < size; ++cnt)
{
result[cnt] = last;
-
+
if(chararr[cnt] != NULL) // there is a cache
{
last += (1 + sprintf(last, "%s", chararr[cnt]));
// We found no symbol name to use, so describe it as relative to the file.
if (info[cnt].dli_sname == NULL)
info[cnt].dli_saddr = info[cnt].dli_fbase;
-
+
if (info[cnt].dli_sname == NULL && info[cnt].dli_saddr == 0)
{
tstrlen = sprintf (last, "%s(%s) [%p]", info[cnt].dli_fname ?: "", info[cnt].dli_sname ?: "", array[cnt]);
sign = '-';
offset = info[cnt].dli_saddr - array[cnt];
}
-
+
tstrlen = sprintf (last, "%s(%s%c%#tx) [%p]",
info[cnt].dli_fname ?: "",
info[cnt].dli_sname ?: "",
tstrlen = sprintf (last, "[%p]", array[cnt]);
}
tstrlen++;
-
+
add_symbol_hash(array[cnt], last, tstrlen);
-
+
last += tstrlen;
- }
+ }
}
assert (last <= (char *) result + size * sizeof (char *) + total);
for (cnt = 0; cnt < size; ++cnt)
{
struct link_map* map;
-
+
if(find_symbol_hash(array[cnt], &foundsym) <= 0) // not found or error
{
status[cnt] = dladdr1 (array[cnt], &info[cnt], (void**)&map, RTLD_DL_LINKMAP);
if(info[cnt].dli_sname == NULL)
{
char filepath[FILEPATH_MAX]; // for file path
-
+
/* If this is the main program the information is incomplete. */
if (map->l_name[0] == '\0' && map->l_type == lt_executable)
{
filepath[0] = '\0';
strcat(filepath, map->l_name);
}
-
+
symdata_t* pdata = _get_symboldata(filepath);
if(pdata != NULL)
{
ElfW(Sym) * sym_ent = pdata->symtab;
char* strtab = pdata->strtab;
int i, num_syms = pdata->symhdr.sh_size / pdata->symhdr.sh_entsize;
-
+
for(i = 0; i < num_syms; ++i)
{
if (ELFW(ST_TYPE) (sym_ent[i].st_info) != STT_TLS
total += (strlen (info[cnt].dli_fname ?: "")
+ strlen (info[cnt].dli_sname ?: "")
+ 3 + WORD_WIDTH + 3 + WORD_WIDTH + 5);
-
+
/* The load bias is more useful to the user than the load
address. The use of these addresses is to calculate an
address in the ELF file, so its prelinked bias is not
for (cnt = 0; cnt < size; ++cnt)
{
result[cnt] = last;
-
+
if(chararr[cnt] != NULL) // there is a cache
{
last += (1 + sprintf(last, "%s", chararr[cnt]));
// We found no symbol name to use, so describe it as relative to the file.
if (info[cnt].dli_sname == NULL)
info[cnt].dli_saddr = info[cnt].dli_fbase;
-
+
if (info[cnt].dli_sname == NULL && info[cnt].dli_saddr == 0)
{
tstrlen = sprintf (last, "%s(%s) [%p]", info[cnt].dli_fname ?: "", info[cnt].dli_sname ?: "", array[cnt]);
sign = '-';
offset = info[cnt].dli_saddr - array[cnt];
}
-
+
tstrlen = sprintf (last, "%s(%s%c%#tx) [%p]",
info[cnt].dli_fname ?: "",
info[cnt].dli_sname ?: "",
tstrlen = sprintf (last, "[%p]", array[cnt]);
}
tstrlen++;
-
+
add_symbol_hash(array[cnt], last, tstrlen);
-
+
last += tstrlen;
- }
+ }
}
assert (last <= (char *) result + size * sizeof (char *) + total);
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#include <assert.h> // for assert
if(unlikely(key == NULL))
return NULL;
-
+
keylen = strlen(key);
// pthread_mutex_lock(&glist_mutex); // this is commented because of static function
{
element_t* elm;
int ret = 0;
-
+
pthread_mutex_lock(&glist_mutex);
elm = find_element(key);
if(elm != NULL)
int remove_all_glist()
{
element_t* elm;
-
+
pthread_mutex_lock(&glist_mutex);
while(gsymbol_list != NULL)
{
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Nikita Kalyazin <n.kalyazin@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h> // for sprintf
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Nikita Kalyazin <n.kalyazin@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __BIN_PROTO_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#ifndef _DAHELPER_H_
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DAPROBE_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#ifndef __DAUTIL_H__
-/* The MIT License\r
-\r
- Copyright (c) 2008, by Attractive Chaos <attractivechaos@aol.co.uk>\r
-\r
- Permission is hereby granted, free of charge, to any person obtaining\r
- a copy of this software and associated documentation files (the\r
- "Software"), to deal in the Software without restriction, including\r
- without limitation the rights to use, copy, modify, merge, publish,\r
- distribute, sublicense, and/or sell copies of the Software, and to\r
- permit persons to whom the Software is furnished to do so, subject to\r
- the following conditions:\r
-\r
- The above copyright notice and this permission notice shall be\r
- included in all copies or substantial portions of the Software.\r
-\r
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,\r
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r
- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\r
- BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\r
- ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r
- CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r
- SOFTWARE.\r
-*/\r
-\r
-/*\r
- An example:\r
-\r
-#include "khash.h"\r
-KHASH_MAP_INIT_INT(32, char)\r
-int main() {\r
- int ret, is_missing;\r
- khiter_t k;\r
- khash_t(32) *h = kh_init(32);\r
- k = kh_put(32, h, 5, &ret);\r
- if (!ret) kh_del(32, h, k);\r
- kh_value(h, k) = 10;\r
- k = kh_get(32, h, 10);\r
- is_missing = (k == kh_end(h));\r
- k = kh_get(32, h, 5);\r
- kh_del(32, h, k);\r
- for (k = kh_begin(h); k != kh_end(h); ++k)\r
- if (kh_exist(h, k)) kh_value(h, k) = 1;\r
- kh_destroy(32, h);\r
- return 0;\r
-}\r
-*/\r
-\r
-/*\r
- 2008-09-19 (0.2.3):\r
-\r
- * Corrected the example\r
- * Improved interfaces\r
-\r
- 2008-09-11 (0.2.2):\r
-\r
- * Improved speed a little in kh_put()\r
-\r
- 2008-09-10 (0.2.1):\r
-\r
- * Added kh_clear()\r
- * Fixed a compiling error\r
-\r
- 2008-09-02 (0.2.0):\r
-\r
- * Changed to token concatenation which increases flexibility.\r
-\r
- 2008-08-31 (0.1.2):\r
-\r
- * Fixed a bug in kh_get(), which has not been tested previously.\r
-\r
- 2008-08-31 (0.1.1):\r
-\r
- * Added destructor\r
-*/\r
-\r
-\r
-#ifndef __AC_KHASH_H\r
-#define __AC_KHASH_H\r
-\r
-#define AC_VERSION_KHASH_H "0.2.2"\r
-\r
-#include <stdio.h>\r
-#include <stdint.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-typedef uint32_t khint_t;\r
-typedef khint_t khiter_t;\r
-\r
-#define __ac_HASH_PRIME_SIZE 32\r
-static const uint32_t __ac_prime_list[__ac_HASH_PRIME_SIZE] =\r
-{\r
- 0ul, 3ul, 11ul, 23ul, 53ul,\r
- 97ul, 193ul, 389ul, 769ul, 1543ul,\r
- 3079ul, 6151ul, 12289ul, 24593ul, 49157ul,\r
- 98317ul, 196613ul, 393241ul, 786433ul, 1572869ul,\r
- 3145739ul, 6291469ul, 12582917ul, 25165843ul, 50331653ul,\r
- 100663319ul, 201326611ul, 402653189ul, 805306457ul, 1610612741ul,\r
- 3221225473ul, 4294967291ul\r
-};\r
-\r
-#define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)\r
-#define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)\r
-#define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)\r
-#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))\r
-#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))\r
-#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))\r
-#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))\r
-\r
-static const double __ac_HASH_UPPER = 0.77;\r
-\r
-#define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \\r
- typedef struct { \\r
- khint_t n_buckets, size, n_occupied, upper_bound; \\r
- uint32_t *flags; \\r
- khkey_t *keys; \\r
- khval_t *vals; \\r
- } kh_##name##_t; \\r
- static inline kh_##name##_t *kh_init_##name() { \\r
- return (kh_##name##_t*)calloc(1, sizeof(kh_##name##_t)); \\r
- } \\r
- static inline void kh_destroy_##name(kh_##name##_t *h) \\r
- { \\r
- if (h) { \\r
- free(h->keys); free(h->flags); \\r
- free(h->vals); \\r
- free(h); \\r
- } \\r
- } \\r
- static inline void kh_clear_##name(kh_##name##_t *h) \\r
- { \\r
- if (h && h->flags) { \\r
- memset(h->flags, 0xaa, ((h->n_buckets>>4) + 1) * sizeof(uint32_t)); \\r
- h->size = h->n_occupied = 0; \\r
- } \\r
- } \\r
- static inline khint_t kh_get_##name(kh_##name##_t *h, khkey_t key) \\r
- { \\r
- if (h->n_buckets) { \\r
- khint_t inc, k, i, last; \\r
- k = __hash_func(key); i = k % h->n_buckets; \\r
- inc = 1 + k % (h->n_buckets - 1); last = i; \\r
- while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \\r
- if (i + inc >= h->n_buckets) i = i + inc - h->n_buckets; \\r
- else i += inc; \\r
- if (i == last) return h->n_buckets; \\r
- } \\r
- return __ac_iseither(h->flags, i)? h->n_buckets : i; \\r
- } else return 0; \\r
- } \\r
- static inline void kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \\r
- { \\r
- uint32_t *new_flags = 0; \\r
- khint_t j = 1; \\r
- { \\r
- khint_t t = __ac_HASH_PRIME_SIZE - 1; \\r
- while (__ac_prime_list[t] > new_n_buckets) { \\r
- --t; \\r
- } \\r
- new_n_buckets = __ac_prime_list[t+1]; \\r
- if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0; \\r
- else { \\r
- new_flags = (uint32_t*)malloc(((new_n_buckets>>4) + 1) * sizeof(uint32_t)); \\r
- memset(new_flags, 0xaa, ((new_n_buckets>>4) + 1) * sizeof(uint32_t)); \\r
- if (h->n_buckets < new_n_buckets) { \\r
- h->keys = (khkey_t*)realloc(h->keys, new_n_buckets * sizeof(khkey_t)); \\r
- if (kh_is_map) \\r
- h->vals = (khval_t*)realloc(h->vals, new_n_buckets * sizeof(khval_t)); \\r
- } \\r
- } \\r
- } \\r
- if (j) { \\r
- for (j = 0; j != h->n_buckets; ++j) { \\r
- if (__ac_iseither(h->flags, j) == 0) { \\r
- khkey_t key = h->keys[j]; \\r
- khval_t val; \\r
- if (kh_is_map) val = h->vals[j]; \\r
- __ac_set_isdel_true(h->flags, j); \\r
- while (1) { \\r
- khint_t inc, k, i; \\r
- k = __hash_func(key); \\r
- i = k % new_n_buckets; \\r
- inc = 1 + k % (new_n_buckets - 1); \\r
- while (!__ac_isempty(new_flags, i)) { \\r
- if (i + inc >= new_n_buckets) i = i + inc - new_n_buckets; \\r
- else i += inc; \\r
- } \\r
- __ac_set_isempty_false(new_flags, i); \\r
- if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { \\r
- { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \\r
- if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \\r
- __ac_set_isdel_true(h->flags, i); \\r
- } else { \\r
- h->keys[i] = key; \\r
- if (kh_is_map) h->vals[i] = val; \\r
- break; \\r
- } \\r
- } \\r
- } \\r
- } \\r
- if (h->n_buckets > new_n_buckets) { \\r
- h->keys = (khkey_t*)realloc(h->keys, new_n_buckets * sizeof(khkey_t)); \\r
- if (kh_is_map) \\r
- h->vals = (khval_t*)realloc(h->vals, new_n_buckets * sizeof(khval_t)); \\r
- } \\r
- free(h->flags); \\r
- h->flags = new_flags; \\r
- h->n_buckets = new_n_buckets; \\r
- h->n_occupied = h->size; \\r
- h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \\r
- } \\r
- } \\r
- static inline khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \\r
- { \\r
- khint_t x; \\r
- if (h->n_occupied >= h->upper_bound) { \\r
- if (h->n_buckets > (h->size<<1)) kh_resize_##name(h, h->n_buckets - 1); \\r
- else kh_resize_##name(h, h->n_buckets + 1); \\r
- } \\r
- { \\r
- khint_t inc, k, i, site, last; \\r
- x = site = h->n_buckets; k = __hash_func(key); i = k % h->n_buckets; \\r
- if (__ac_isempty(h->flags, i)) x = i; \\r
- else { \\r
- inc = 1 + k % (h->n_buckets - 1); last = i; \\r
- while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \\r
- if (__ac_isdel(h->flags, i)) site = i; \\r
- if (i + inc >= h->n_buckets) i = i + inc - h->n_buckets; \\r
- else i += inc; \\r
- if (i == last) { x = site; break; } \\r
- } \\r
- if (x == h->n_buckets) { \\r
- if (__ac_isempty(h->flags, i) && site != h->n_buckets) x = site; \\r
- else x = i; \\r
- } \\r
- } \\r
- } \\r
- if (__ac_isempty(h->flags, x)) { \\r
- h->keys[x] = key; \\r
- __ac_set_isboth_false(h->flags, x); \\r
- ++h->size; ++h->n_occupied; \\r
- *ret = 1; \\r
- } else if (__ac_isdel(h->flags, x)) { \\r
- h->keys[x] = key; \\r
- __ac_set_isboth_false(h->flags, x); \\r
- ++h->size; \\r
- *ret = 2; \\r
- } else *ret = 0; \\r
- return x; \\r
- } \\r
- static inline void kh_del_##name(kh_##name##_t *h, khint_t x) \\r
- { \\r
- if (x != h->n_buckets && !__ac_iseither(h->flags, x)) { \\r
- __ac_set_isdel_true(h->flags, x); \\r
- --h->size; \\r
- } \\r
- }\r
-\r
-/* --- BEGIN OF HASH FUNCTIONS --- */\r
-\r
-#define kh_int_hash_func(key) (uint32_t)(key)\r
-#define kh_int_hash_equal(a, b) (a == b)\r
-#define kh_int64_hash_func(key) (uint32_t)((key)>>33^(key)^(key)<<11)\r
-#define kh_int64_hash_equal(a, b) (a == b)\r
-static inline khint_t __ac_X31_hash_string(const char *s)\r
-{\r
- khint_t h = *s;\r
- if (h)\r
- {\r
- for (++s ; *s; ++s)\r
- {\r
- h = (h << 5) - h + *s;\r
- }\r
- }\r
- return h;\r
-}\r
-#define kh_str_hash_func(key) __ac_X31_hash_string(key)\r
-#define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)\r
-\r
-/* --- END OF HASH FUNCTIONS --- */\r
-\r
-/* Other necessary macros... */\r
-\r
-#define khash_t(name) kh_##name##_t\r
-\r
-#define kh_init(name) kh_init_##name()\r
-#define kh_destroy(name, h) kh_destroy_##name(h)\r
-#define kh_clear(name, h) kh_clear_##name(h)\r
-#define kh_resize(name, h, s) kh_resize_##name(h, s)\r
-#define kh_put(name, h, k, r) kh_put_##name(h, k, r)\r
-#define kh_get(name, h, k) kh_get_##name(h, k)\r
-#define kh_del(name, h, k) kh_del_##name(h, k)\r
-\r
-#define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))\r
-#define kh_key(h, x) ((h)->keys[x])\r
-#define kh_val(h, x) ((h)->vals[x])\r
-#define kh_value(h, x) ((h)->vals[x])\r
-#define kh_begin(h) (khint_t)(0)\r
-#define kh_end(h) ((h)->n_buckets)\r
-#define kh_size(h) ((h)->size)\r
-#define kh_n_buckets(h) ((h)->n_buckets)\r
-\r
-/* More conenient interfaces */\r
-\r
-#define KHASH_SET_INIT_INT(name) \\r
- KHASH_INIT(name, uint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)\r
-\r
-#define KHASH_MAP_INIT_INT(name, khval_t) \\r
- KHASH_INIT(name, uint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)\r
-\r
-#define KHASH_SET_INIT_INT64(name) \\r
- KHASH_INIT(name, uint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)\r
-\r
-#define KHASH_MAP_INIT_INT64(name, khval_t) \\r
- KHASH_INIT(name, uint64_t, khval_t, 1, kh_int64_hash_func, kh_int64_hash_equal)\r
-\r
-typedef const char *kh_cstr_t;\r
-#define KHASH_SET_INIT_STR(name) \\r
- KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)\r
-\r
-#define KHASH_MAP_INIT_STR(name, khval_t) \\r
- KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)\r
-\r
-#endif /* __AC_KHASH_H */\r
+/* The MIT License
+
+ Copyright (c) 2008, by Attractive Chaos <attractivechaos@aol.co.uk>
+
+ Permission is hereby granted, free of charge, to any person obtaining
+ a copy of this software and associated documentation files (the
+ "Software"), to deal in the Software without restriction, including
+ without limitation the rights to use, copy, modify, merge, publish,
+ distribute, sublicense, and/or sell copies of the Software, and to
+ permit persons to whom the Software is furnished to do so, subject to
+ the following conditions:
+
+ The above copyright notice and this permission notice shall be
+ included in all copies or substantial portions of the Software.
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ SOFTWARE.
+*/
+
+/*
+ An example:
+
+#include "khash.h"
+KHASH_MAP_INIT_INT(32, char)
+int main() {
+ int ret, is_missing;
+ khiter_t k;
+ khash_t(32) *h = kh_init(32);
+ k = kh_put(32, h, 5, &ret);
+ if (!ret) kh_del(32, h, k);
+ kh_value(h, k) = 10;
+ k = kh_get(32, h, 10);
+ is_missing = (k == kh_end(h));
+ k = kh_get(32, h, 5);
+ kh_del(32, h, k);
+ for (k = kh_begin(h); k != kh_end(h); ++k)
+ if (kh_exist(h, k)) kh_value(h, k) = 1;
+ kh_destroy(32, h);
+ return 0;
+}
+*/
+
+/*
+ 2008-09-19 (0.2.3):
+
+ * Corrected the example
+ * Improved interfaces
+
+ 2008-09-11 (0.2.2):
+
+ * Improved speed a little in kh_put()
+
+ 2008-09-10 (0.2.1):
+
+ * Added kh_clear()
+ * Fixed a compiling error
+
+ 2008-09-02 (0.2.0):
+
+ * Changed to token concatenation which increases flexibility.
+
+ 2008-08-31 (0.1.2):
+
+ * Fixed a bug in kh_get(), which has not been tested previously.
+
+ 2008-08-31 (0.1.1):
+
+ * Added destructor
+*/
+
+
+#ifndef __AC_KHASH_H
+#define __AC_KHASH_H
+
+#define AC_VERSION_KHASH_H "0.2.2"
+
+#include <stdio.h>
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+
+typedef uint32_t khint_t;
+typedef khint_t khiter_t;
+
+#define __ac_HASH_PRIME_SIZE 32
+static const uint32_t __ac_prime_list[__ac_HASH_PRIME_SIZE] =
+{
+ 0ul, 3ul, 11ul, 23ul, 53ul,
+ 97ul, 193ul, 389ul, 769ul, 1543ul,
+ 3079ul, 6151ul, 12289ul, 24593ul, 49157ul,
+ 98317ul, 196613ul, 393241ul, 786433ul, 1572869ul,
+ 3145739ul, 6291469ul, 12582917ul, 25165843ul, 50331653ul,
+ 100663319ul, 201326611ul, 402653189ul, 805306457ul, 1610612741ul,
+ 3221225473ul, 4294967291ul
+};
+
+#define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
+#define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
+#define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
+#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
+#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
+#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
+#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
+
+static const double __ac_HASH_UPPER = 0.77;
+
+#define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
+ typedef struct { \
+ khint_t n_buckets, size, n_occupied, upper_bound; \
+ uint32_t *flags; \
+ khkey_t *keys; \
+ khval_t *vals; \
+ } kh_##name##_t; \
+ static inline kh_##name##_t *kh_init_##name() { \
+ return (kh_##name##_t*)calloc(1, sizeof(kh_##name##_t)); \
+ } \
+ static inline void kh_destroy_##name(kh_##name##_t *h) \
+ { \
+ if (h) { \
+ free(h->keys); free(h->flags); \
+ free(h->vals); \
+ free(h); \
+ } \
+ } \
+ static inline void kh_clear_##name(kh_##name##_t *h) \
+ { \
+ if (h && h->flags) { \
+ memset(h->flags, 0xaa, ((h->n_buckets>>4) + 1) * sizeof(uint32_t)); \
+ h->size = h->n_occupied = 0; \
+ } \
+ } \
+ static inline khint_t kh_get_##name(kh_##name##_t *h, khkey_t key) \
+ { \
+ if (h->n_buckets) { \
+ khint_t inc, k, i, last; \
+ k = __hash_func(key); i = k % h->n_buckets; \
+ inc = 1 + k % (h->n_buckets - 1); last = i; \
+ while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
+ if (i + inc >= h->n_buckets) i = i + inc - h->n_buckets; \
+ else i += inc; \
+ if (i == last) return h->n_buckets; \
+ } \
+ return __ac_iseither(h->flags, i)? h->n_buckets : i; \
+ } else return 0; \
+ } \
+ static inline void kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \
+ { \
+ uint32_t *new_flags = 0; \
+ khint_t j = 1; \
+ { \
+ khint_t t = __ac_HASH_PRIME_SIZE - 1; \
+ while (__ac_prime_list[t] > new_n_buckets) { \
+ --t; \
+ } \
+ new_n_buckets = __ac_prime_list[t+1]; \
+ if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0; \
+ else { \
+ new_flags = (uint32_t*)malloc(((new_n_buckets>>4) + 1) * sizeof(uint32_t)); \
+ memset(new_flags, 0xaa, ((new_n_buckets>>4) + 1) * sizeof(uint32_t)); \
+ if (h->n_buckets < new_n_buckets) { \
+ h->keys = (khkey_t*)realloc(h->keys, new_n_buckets * sizeof(khkey_t)); \
+ if (kh_is_map) \
+ h->vals = (khval_t*)realloc(h->vals, new_n_buckets * sizeof(khval_t)); \
+ } \
+ } \
+ } \
+ if (j) { \
+ for (j = 0; j != h->n_buckets; ++j) { \
+ if (__ac_iseither(h->flags, j) == 0) { \
+ khkey_t key = h->keys[j]; \
+ khval_t val; \
+ if (kh_is_map) val = h->vals[j]; \
+ __ac_set_isdel_true(h->flags, j); \
+ while (1) { \
+ khint_t inc, k, i; \
+ k = __hash_func(key); \
+ i = k % new_n_buckets; \
+ inc = 1 + k % (new_n_buckets - 1); \
+ while (!__ac_isempty(new_flags, i)) { \
+ if (i + inc >= new_n_buckets) i = i + inc - new_n_buckets; \
+ else i += inc; \
+ } \
+ __ac_set_isempty_false(new_flags, i); \
+ if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { \
+ { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
+ if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
+ __ac_set_isdel_true(h->flags, i); \
+ } else { \
+ h->keys[i] = key; \
+ if (kh_is_map) h->vals[i] = val; \
+ break; \
+ } \
+ } \
+ } \
+ } \
+ if (h->n_buckets > new_n_buckets) { \
+ h->keys = (khkey_t*)realloc(h->keys, new_n_buckets * sizeof(khkey_t)); \
+ if (kh_is_map) \
+ h->vals = (khval_t*)realloc(h->vals, new_n_buckets * sizeof(khval_t)); \
+ } \
+ free(h->flags); \
+ h->flags = new_flags; \
+ h->n_buckets = new_n_buckets; \
+ h->n_occupied = h->size; \
+ h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
+ } \
+ } \
+ static inline khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \
+ { \
+ khint_t x; \
+ if (h->n_occupied >= h->upper_bound) { \
+ if (h->n_buckets > (h->size<<1)) kh_resize_##name(h, h->n_buckets - 1); \
+ else kh_resize_##name(h, h->n_buckets + 1); \
+ } \
+ { \
+ khint_t inc, k, i, site, last; \
+ x = site = h->n_buckets; k = __hash_func(key); i = k % h->n_buckets; \
+ if (__ac_isempty(h->flags, i)) x = i; \
+ else { \
+ inc = 1 + k % (h->n_buckets - 1); last = i; \
+ while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
+ if (__ac_isdel(h->flags, i)) site = i; \
+ if (i + inc >= h->n_buckets) i = i + inc - h->n_buckets; \
+ else i += inc; \
+ if (i == last) { x = site; break; } \
+ } \
+ if (x == h->n_buckets) { \
+ if (__ac_isempty(h->flags, i) && site != h->n_buckets) x = site; \
+ else x = i; \
+ } \
+ } \
+ } \
+ if (__ac_isempty(h->flags, x)) { \
+ h->keys[x] = key; \
+ __ac_set_isboth_false(h->flags, x); \
+ ++h->size; ++h->n_occupied; \
+ *ret = 1; \
+ } else if (__ac_isdel(h->flags, x)) { \
+ h->keys[x] = key; \
+ __ac_set_isboth_false(h->flags, x); \
+ ++h->size; \
+ *ret = 2; \
+ } else *ret = 0; \
+ return x; \
+ } \
+ static inline void kh_del_##name(kh_##name##_t *h, khint_t x) \
+ { \
+ if (x != h->n_buckets && !__ac_iseither(h->flags, x)) { \
+ __ac_set_isdel_true(h->flags, x); \
+ --h->size; \
+ } \
+ }
+
+/* --- BEGIN OF HASH FUNCTIONS --- */
+
+#define kh_int_hash_func(key) (uint32_t)(key)
+#define kh_int_hash_equal(a, b) (a == b)
+#define kh_int64_hash_func(key) (uint32_t)((key)>>33^(key)^(key)<<11)
+#define kh_int64_hash_equal(a, b) (a == b)
+static inline khint_t __ac_X31_hash_string(const char *s)
+{
+ khint_t h = *s;
+ if (h)
+ {
+ for (++s ; *s; ++s)
+ {
+ h = (h << 5) - h + *s;
+ }
+ }
+ return h;
+}
+#define kh_str_hash_func(key) __ac_X31_hash_string(key)
+#define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)
+
+/* --- END OF HASH FUNCTIONS --- */
+
+/* Other necessary macros... */
+
+#define khash_t(name) kh_##name##_t
+
+#define kh_init(name) kh_init_##name()
+#define kh_destroy(name, h) kh_destroy_##name(h)
+#define kh_clear(name, h) kh_clear_##name(h)
+#define kh_resize(name, h, s) kh_resize_##name(h, s)
+#define kh_put(name, h, k, r) kh_put_##name(h, k, r)
+#define kh_get(name, h, k) kh_get_##name(h, k)
+#define kh_del(name, h, k) kh_del_##name(h, k)
+
+#define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))
+#define kh_key(h, x) ((h)->keys[x])
+#define kh_val(h, x) ((h)->vals[x])
+#define kh_value(h, x) ((h)->vals[x])
+#define kh_begin(h) (khint_t)(0)
+#define kh_end(h) ((h)->n_buckets)
+#define kh_size(h) ((h)->size)
+#define kh_n_buckets(h) ((h)->n_buckets)
+
+/* More conenient interfaces */
+
+#define KHASH_SET_INIT_INT(name) \
+ KHASH_INIT(name, uint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)
+
+#define KHASH_MAP_INIT_INT(name, khval_t) \
+ KHASH_INIT(name, uint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)
+
+#define KHASH_SET_INIT_INT64(name) \
+ KHASH_INIT(name, uint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)
+
+#define KHASH_MAP_INIT_INT64(name, khval_t) \
+ KHASH_INIT(name, uint64_t, khval_t, 1, kh_int64_hash_func, kh_int64_hash_equal)
+
+typedef const char *kh_cstr_t;
+#define KHASH_SET_INIT_STR(name) \
+ KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)
+
+#define KHASH_MAP_INIT_STR(name, khval_t) \
+ KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)
+
+#endif /* __AC_KHASH_H */
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __PROBEINFO_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <app.h>
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <appfw/app.h>
if(isOptionEnabled(OPT_EVENT))
{
setProbePoint(&probeInfo);
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_UIEVENT,
API_ID_on_orientation_changed,
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DA_EVENT_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include "daprobe.h"
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
//#include <stdio.h>
HW_EVENT_LOG(_EVENT_TOUCH, _TOUCH_PRESSED, )
PRE_UNCONDITIONAL_BLOCK_END();
-
+
DECLARE_VARIABLE_EVENT;
int x, y;
-
+
PRE_PROBEBLOCK_BEGIN_EVENT(evas_event_feed_mouse_down, LIBEVAS, EVENT_TYPE_DOWN);
evas_pointer_output_xy_get(e, &x, &y);
- PRE_PROBEBLOCK_END_EVENT();
-
+ PRE_PROBEBLOCK_END_EVENT();
+
evas_event_feed_mouse_downp(e, b, flags, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_DOWN, "%d", b);
-}
+}
void evas_event_feed_mouse_up(Evas *e, int b, Evas_Button_Flags flags,
unsigned int timestamp, const void *data)
{
static void (*evas_event_feed_mouse_upp)(Evas *e, int b, Evas_Button_Flags flags, unsigned int timestamp, const void *data);
-
+
DECLARE_VARIABLE_EVENT;
int x, y;
-
+
PRE_PROBEBLOCK_BEGIN_EVENT(evas_event_feed_mouse_up, LIBEVAS, EVENT_TYPE_UP);
evas_pointer_output_xy_get(e, &x, &y);
- PRE_PROBEBLOCK_END_EVENT();
-
+ PRE_PROBEBLOCK_END_EVENT();
+
evas_event_feed_mouse_upp(e, b, flags, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_UP, "%d", b);
}
unsigned int timestamp, const void *data)
{
static void (*evas_event_feed_mouse_movep)(Evas *e, int x, int y, unsigned int timestamp, const void *data);
-
+
BEFORE_ORIGINAL_EVENT(evas_event_feed_mouse_move, LIBEVAS, EVENT_TYPE_MOVE);
-
+
evas_event_feed_mouse_movep(e, x, y, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_MOVE, "%u", timestamp);
}
static void (*evas_event_feed_multi_downp)(Evas *e, int d, int x, int y, double rad, double radx, double rady, double pres, double ang, double fx, double fy, Evas_Button_Flags flags, unsigned int timestamp, const void *data);
BEFORE_ORIGINAL_EVENT(evas_event_feed_multi_down, LIBEVAS, EVENT_TYPE_DOWN);
-
+
evas_event_feed_multi_downp(e, d, x, y, rad, radx,
rady, pres, ang, fx, fy, flags, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_DOWN, "%d", d);
}
static void (*evas_event_feed_multi_upp)(Evas *e, int d, int x, int y, double rad, double radx, double rady, double pres, double ang, double fx, double fy, Evas_Button_Flags flags, unsigned int timestamp, const void *data);
BEFORE_ORIGINAL_EVENT(evas_event_feed_multi_up, LIBEVAS, EVENT_TYPE_UP);
-
+
evas_event_feed_multi_upp(e, d, x, y, rad, radx, rady,
pres, ang, fx, fy, flags, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_UP, "%d", d);
}
static void (*evas_event_feed_multi_movep)(Evas *e, int d, int x, int y, double rad, double radx, double rady, double pres, double ang, double fx, double fy, unsigned int timestamp, const void *data);
BEFORE_ORIGINAL_EVENT(evas_event_feed_multi_move, LIBEVAS, EVENT_TYPE_MOVE);
-
+
evas_event_feed_multi_movep(e, d, x, y, rad, radx, rady,
pres, ang, fx, fy, timestamp, data);
-
+
AFTER_ORIGINAL_EVENT(EVENT_TYPE_MOVE, "%d", d);
}
*/
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DA_IO_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h>
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h>
{
static FILE* (*fopenp)(const char* filename, const char* mode);
FILE* fret;
-
+
BEFORE_ORIGINAL_FILE_NOFILTER(fopen, LIBC);
_filepath = (char*)filename;
-
+
fret = fopenp(filename, mode);
AFTER_PACK_ORIGINAL_FILEP(API_ID_fopen,
bfiltering = false;
PRE_PROBEBLOCK_BEGIN();
GET_FD_FROM_FILEP(stream);
- if(_fd != -1) {
+ if(_fd != -1) {
_fstatret = fstat(_fd, &_statbuf);
- }
+ }
PRE_PROBEBLOCK_END();
ret = fclosep(stream);
long int lret;
BEFORE_ORIGINAL_FILE(ftell, LIBC);
-
+
lret = ftellp(stream);
AFTER_PACK_ORIGINAL_FILEP(API_ID_ftell,
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DA_MEMORY_H__
* SeqNumber`,ApiName`,Time`,Pid`,Tid`,InputParm`,Return`,PCAddr`,Error`,
* Size`,MemoryAPIType`,Addr`,\n
* callstack_start`,callstack`,callstack_end
- *
+ *
********************************************************************/
#endif // __DA_MEMORY_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h>
pret = memsetp(memblock, c, n);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_memset,
PACK_COMMON_END(pret, newerrno, blockresult);
PACK_MEMORY(n, MEMORY_API_MANAGE, pret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return pret;
ret = memcmpp(ptr1, ptr2, num);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_memcmp,
PACK_COMMON_END(ret, newerrno, blockresult);
PACK_MEMORY(num, MEMORY_API_MANAGE, ret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return ret;
pret = memcpyp(destination, source, num);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_memcpy,
PACK_COMMON_END(pret, newerrno, blockresult);
PACK_MEMORY(num, MEMORY_API_MANAGE, pret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return pret;
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Woojin Jung <woojin2.jung@samsung.com>
* Jaewon Lim <jaewon81.lim@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h>
}
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void__operator_new___std__size_t_size__throw__std__bad_alloc_,
PACK_COMMON_END(pret, newerrno, blockresult);
PACK_MEMORY(size, MEMORY_API_ALLOC, pret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return pret;
deletep(ptr);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void_operator_delete_void__ptr__throw__,
PACK_COMMON_END(0, newerrno, blockresult);
PACK_MEMORY(0, MEMORY_API_FREE, ptr);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
}
deletep(ptr);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void_operator_delete___void__ptr__throw__,
PACK_COMMON_END(0, newerrno, blockresult);
PACK_MEMORY(0, MEMORY_API_FREE, ptr);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
}
}
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void__operator_new_std__size_t_size__const_std__nothrow_t__nothrow__throw__,
PACK_COMMON_END(pret, newerrno, blockresult);
PACK_MEMORY(size, MEMORY_API_ALLOC, pret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return pret;
}
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void__operator_new___std__size_t_size__const_std__nothrow_t__nothrow__throw__,
PACK_COMMON_END(pret, newerrno, blockresult);
PACK_MEMORY(size, MEMORY_API_ALLOC, pret);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
return pret;
deletep(ptr, nothrow);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void_operator_delete_void__ptr__const_std__nothrow_t__nothrow__throw__,
PACK_COMMON_END(0, newerrno, blockresult);
PACK_MEMORY(0, MEMORY_API_FREE, ptr);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
}
deletep(ptr, nothrow);
POST_PACK_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_MEMORY,
API_ID_void_operator_delete___void__ptr__const_std__nothrow_t__nothrow__throw__,
PACK_COMMON_END(0, newerrno, blockresult);
PACK_MEMORY(0, MEMORY_API_FREE, ptr);
FLUSH_LOCAL_BUF();
-
+
POST_PACK_PROBEBLOCK_END();
}
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Hyunjong Park <phjwithyou.park@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#include <stdlib.h> // for malloc
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Woojin Jung <woojin2.jung@samsung.com>
* Jaewon Lim <jaewon81.lim@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DA_SYNC_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Woojin Jung <woojin2.jung@samsung.com>
* Jaewon Lim <jaewon81.lim@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#ifndef __DA_THREAD_H__
static enum DaOptions _sopt = OPT_THREAD;
-int pthread_mutex_init(pthread_mutex_t *mutex,
+int pthread_mutex_init(pthread_mutex_t *mutex,
const pthread_mutexattr_t *attr) {
static int (*pthread_mutex_initp)(pthread_mutex_t *mutex,
const pthread_mutexattr_t *attr);
ret = pthread_mutex_initp(mutex, attr);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_mutex_init,
- ret, mutex, SYNC_PTHREAD_MUTEX,
+ ret, mutex, SYNC_PTHREAD_MUTEX,
SYNC_API_OTHER, "pp", mutex, attr);
return ret;
ret = pthread_mutex_destroyp(mutex);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_mutex_destroy,
- ret, mutex, SYNC_PTHREAD_MUTEX,
+ ret, mutex, SYNC_PTHREAD_MUTEX,
SYNC_API_OTHER, "p", mutex);
return ret;
int pthread_mutex_lock(pthread_mutex_t *mutex) {
static int (*pthread_mutex_lockp)(pthread_mutex_t *mutex);
-
+
DECLARE_VARIABLE_STANDARD;
GET_REAL_FUNC(pthread_mutex_lock, LIBPTHREAD);
postBlockEnd();
}
-
+
return ret;
}
ret = pthread_mutex_trylockp(mutex);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_mutex_trylock,
- ret, mutex, SYNC_PTHREAD_MUTEX,
+ ret, mutex, SYNC_PTHREAD_MUTEX,
SYNC_API_TRY_ACQUIRE, "p", mutex);
-
+
return ret;
}
ret = pthread_mutex_unlockp(mutex);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_mutex_unlock,
- ret, mutex, SYNC_PTHREAD_MUTEX,
+ ret, mutex, SYNC_PTHREAD_MUTEX,
SYNC_API_RELEASE, "p", mutex);
-
+
return ret;
}
return ret;
}
-int pthread_mutexattr_setprioceiling(pthread_mutexattr_t *attr,
+int pthread_mutexattr_setprioceiling(pthread_mutexattr_t *attr,
int prioceiling) {
static int (*pthread_mutexattr_setprioceilingp)(
pthread_mutexattr_t *attr, int prioceiling);
return ret;
}
-int pthread_mutexattr_getprotocol(const pthread_mutexattr_t *attr,
+int pthread_mutexattr_getprotocol(const pthread_mutexattr_t *attr,
int *protocol) {
static int (*pthread_mutexattr_getprotocolp)(
const pthread_mutexattr_t *attr, int *protocol);
return ret;
}
-int pthread_mutexattr_setprotocol(pthread_mutexattr_t *attr,
+int pthread_mutexattr_setprotocol(pthread_mutexattr_t *attr,
int protocol) {
static int (*pthread_mutexattr_setprotocolp)(
pthread_mutexattr_t *attr, int protocol);
return ret;
}
-int pthread_mutexattr_getpshared(const pthread_mutexattr_t *attr,
+int pthread_mutexattr_getpshared(const pthread_mutexattr_t *attr,
int *pshared) {
static int (*pthread_mutexattr_getpsharedp)(
const pthread_mutexattr_t *attr, int *pshared);
return ret;
}
-int pthread_mutexattr_setpshared(pthread_mutexattr_t *attr,
+int pthread_mutexattr_setpshared(pthread_mutexattr_t *attr,
int pshared) {
static int (*pthread_mutexattr_setpsharedp)(
pthread_mutexattr_t *attr, int pshared);
ret = pthread_cond_initp(cond, attr);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_cond_init,
- ret, cond, SYNC_PTHREAD_COND_VARIABLE,
+ ret, cond, SYNC_PTHREAD_COND_VARIABLE,
SYNC_API_OTHER, "pp", cond, attr);
return ret;
ret = pthread_cond_destroyp(cond);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_cond_destroy,
- ret, cond, SYNC_PTHREAD_COND_VARIABLE,
+ ret, cond, SYNC_PTHREAD_COND_VARIABLE,
SYNC_API_OTHER, "p", cond);
return ret;
PRE_PROBEBLOCK_BEGIN();
// send WAIT_START log
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_SYNC,
API_ID_pthread_cond_wait,
ret = pthread_cond_signalp(cond);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_cond_signal,
- ret, cond, SYNC_PTHREAD_COND_VARIABLE,
+ ret, cond, SYNC_PTHREAD_COND_VARIABLE,
SYNC_API_NOTIFY, "p", cond);
-
+
return ret;
}
ret = pthread_cond_broadcastp(cond);
AFTER_PACK_ORIGINAL_SYNC(API_ID_pthread_cond_broadcast,
- ret, cond, SYNC_PTHREAD_COND_VARIABLE,
+ ret, cond, SYNC_PTHREAD_COND_VARIABLE,
SYNC_API_NOTIFY_ALL, "p", cond);
-
+
return ret;
}
int pthread_rwlock_init(pthread_rwlock_t *rwlock,
const pthread_rwlockattr_t *attr);
int pthread_rwlock_destroy(pthread_rwlock_t *rwlock);
-int pthread_rwlock_rdlock(pthread_rwlock_t *rwlock);
+int pthread_rwlock_rdlock(pthread_rwlock_t *rwlock);
int pthread_rwlock_wrlock(pthread_rwlock_t *rwlock);
int pthread_rwlock_timedrdlock(pthread_rwlock_t *rwlock,
const struct timespec *abs_timeout);
int pthread_barrier_wait(pthread_barrier_t *barrier);
int pthread_barrierattr_init(pthread_barrierattr_t *attr);
int pthread_barrierattr_destroy(pthread_barrierattr_t *attr);
-int pthread_barrierattr_getpshared(const pthread_barrierattr_t *attr,
+int pthread_barrierattr_getpshared(const pthread_barrierattr_t *attr,
int *pshared);
-int pthread_barrierattr_setpshared(pthread_barrierattr_t,
+int pthread_barrierattr_setpshared(pthread_barrierattr_t,
int pshared);
*/
PRE_UNCONDITIONAL_BLOCK_BEGIN();
pSelf = pthread_self();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_THREAD,
API_ID__da_cleanup_handler,
PACK_COMMON_END(0, 0, 1);
PACK_THREAD(pSelf, THREAD_PTHREAD, THREAD_API_INTERNAL_STOP);
FLUSH_LOCAL_BUF();
-
+
PRE_UNCONDITIONAL_BLOCK_END();
return;
PRE_UNCONDITIONAL_BLOCK_BEGIN();
pSelf = pthread_self();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_THREAD,
API_ID__da_ThreadProc,
PACK_COMMON_END(0, 0, 1);
PACK_THREAD(pSelf, THREAD_PTHREAD, THREAD_API_INTERNAL_START);
FLUSH_LOCAL_BUF();
-
+
PRE_UNCONDITIONAL_BLOCK_END();
// restore cancellation state
PRE_UNCONDITIONAL_BLOCK_BEGIN();
pSelf = pthread_self();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_THREAD,
API_ID__da_ThreadProc,
PACK_COMMON_END(ret, 0, 1);
PACK_THREAD(pSelf, THREAD_PTHREAD, THREAD_API_INTERNAL_STOP);
FLUSH_LOCAL_BUF();
-
+
PRE_UNCONDITIONAL_BLOCK_END();
-
+
free(ptrc);
return ret;
}
-int pthread_create(pthread_t *thread, const pthread_attr_t *attr,
+int pthread_create(pthread_t *thread, const pthread_attr_t *attr,
void *(*start_routine) (void*), void *arg)
{
static int (*pthread_createp)(pthread_t *thread,
if(blockresult)
{
- probeBlockStart();
- thread_routine_call *ptrc =
+ probeBlockStart();
+ thread_routine_call *ptrc =
(thread_routine_call *) malloc(sizeof(thread_routine_call));
ptrc->thread_routine = start_routine;
ptrc->argument = arg;
}
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_create,
- ret, *thread, THREAD_API_START,
+ ret, *thread, THREAD_API_START,
"pppp", thread, attr, start_routine, arg);
return ret;
GET_REAL_FUNC(pthread_join, LIBPTHREAD);
PRE_PROBEBLOCK_BEGIN();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_THREAD,
API_ID_pthread_join,
PACK_COMMON_END(0, 0, blockresult);
PACK_THREAD(thread, THREAD_PTHREAD, THREAD_API_WAIT_START);
FLUSH_LOCAL_BUF();
-
+
PRE_PROBEBLOCK_END();
ret = pthread_joinp(thread, retval);
PACK_COMMON_END(ret, errno, blockresult);
PACK_THREAD(thread, THREAD_PTHREAD, THREAD_API_WAIT_END);
FLUSH_LOCAL_BUF();
-
+
postBlockEnd();
}
-
- return ret;
+
+ return ret;
}
void pthread_exit(void *retval)
PRE_PROBEBLOCK_BEGIN();
newerrno = 0;
pSelf = pthread_self();
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_THREAD,
API_ID_pthread_exit,
PACK_COMMON_END(0, 0, blockresult);
PACK_THREAD(pSelf, THREAD_PTHREAD, THREAD_API_EXIT);
FLUSH_LOCAL_BUF();
-
+
PRE_PROBEBLOCK_END();
pthread_exitp(retval);
BEFORE_ORIGINAL_THREAD(pthread_self, LIBPTHREAD);
ret_pthr = pthread_selfp();
-
+
newerrno = errno;
if(postBlockBegin(blockresult)) {
ret = pthread_setcancelstatep(state, oldstate);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_setcancelstate,
- ret, pSelf, THREAD_API_OTHER,
+ ret, pSelf, THREAD_API_OTHER,
"dp", state, oldstate);
return ret;
ret = pthread_setcanceltypep(type, oldtype);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_setcanceltype,
- ret, pSelf, THREAD_API_OTHER,
+ ret, pSelf, THREAD_API_OTHER,
"dp", type, oldtype);
return ret;
return ret;
}
-int pthread_attr_destroy(pthread_attr_t *attr)
+int pthread_attr_destroy(pthread_attr_t *attr)
{
pthread_t thread = 0;
static int (*pthread_attr_destroyp)(pthread_attr_t *attr);
ret = pthread_attr_getdetachstatep(attr, detachstate);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getdetachstate,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, detachstate);
return ret;
int pthread_attr_setdetachstate(pthread_attr_t *attr, int detachstate)
{
pthread_t thread = 0;
- static int (*pthread_attr_setdetachstatep)(pthread_attr_t *attr,
+ static int (*pthread_attr_setdetachstatep)(pthread_attr_t *attr,
int detachstate);
BEFORE_ORIGINAL_THREAD(pthread_attr_setdetachstate, LIBPTHREAD);
ret = pthread_attr_setdetachstatep(attr, detachstate);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setdetachstate,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pd", attr, detachstate);
return ret;
ret = pthread_attr_getstacksizep(attr, stacksize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getstacksize,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, stacksize);
return ret;
int pthread_attr_setstacksize(pthread_attr_t *attr, size_t stacksize)
{
pthread_t thread = 0;
- static int (*pthread_attr_setstacksizep)(pthread_attr_t *attr,
+ static int (*pthread_attr_setstacksizep)(pthread_attr_t *attr,
size_t stacksize);
BEFORE_ORIGINAL_THREAD(pthread_attr_setstacksize, LIBPTHREAD);
ret = pthread_attr_setstacksizep(attr, stacksize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setstacksize,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"px", attr, stacksize);
return ret;
ret = pthread_attr_getstackaddrp(attr, stackaddr);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getstackaddr,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, stackaddr);
return ret;
int pthread_attr_setstackaddr(pthread_attr_t *attr, void *stackaddr)
{
pthread_t thread = 0;
- static int (*pthread_attr_setstackaddrp)(pthread_attr_t *attr,
+ static int (*pthread_attr_setstackaddrp)(pthread_attr_t *attr,
void *stackaddr);
BEFORE_ORIGINAL_THREAD(pthread_attr_setstackaddr, LIBPTHREAD);
ret = pthread_attr_setstackaddrp(attr, stackaddr);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setstackaddr,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, stackaddr);
return ret;
ret = pthread_attr_getinheritschedp(attr, inheritsched);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getinheritsched,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, inheritsched);
return ret;
int pthread_attr_setinheritsched(pthread_attr_t *attr, int inheritsched)
{
pthread_t thread = 0;
- static int (*pthread_attr_setinheritschedp)(pthread_attr_t *attr,
+ static int (*pthread_attr_setinheritschedp)(pthread_attr_t *attr,
int inheritsched);
BEFORE_ORIGINAL_THREAD(pthread_attr_setinheritsched, LIBPTHREAD);
ret = pthread_attr_setinheritschedp(attr, inheritsched);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setinheritsched,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pd", attr, inheritsched);
return ret;
ret = pthread_attr_getschedparamp(attr, param);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getschedparam,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, param);
return ret;
}
-int pthread_attr_setschedparam(pthread_attr_t *attr,
+int pthread_attr_setschedparam(pthread_attr_t *attr,
const struct sched_param *param)
{
pthread_t thread = 0;
ret = pthread_attr_setschedparamp(attr, param);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setschedparam,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, param);
return ret;
ret = pthread_attr_getschedpolicyp(attr, policy);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getschedpolicy,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, policy);
return ret;
int pthread_attr_setschedpolicy(pthread_attr_t *attr, int policy)
{
pthread_t thread = 0;
- static int (*pthread_attr_setschedpolicyp)(pthread_attr_t *attr,
+ static int (*pthread_attr_setschedpolicyp)(pthread_attr_t *attr,
int policy);
BEFORE_ORIGINAL_THREAD(pthread_attr_setschedpolicy, LIBPTHREAD);
ret = pthread_attr_setschedpolicyp(attr, policy);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setschedpolicy,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pd", attr, policy);
return ret;
ret = pthread_attr_getguardsizep(attr, guardsize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getguardsize,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, guardsize);
return ret;
int pthread_attr_setguardsize(pthread_attr_t *attr, size_t guardsize)
{
pthread_t thread = 0;
- static int (*pthread_attr_setguardsizep)(pthread_attr_t *attr,
+ static int (*pthread_attr_setguardsizep)(pthread_attr_t *attr,
size_t guardsize);
BEFORE_ORIGINAL_THREAD(pthread_attr_setguardsize, LIBPTHREAD);
ret = pthread_attr_setguardsizep(attr, guardsize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setguardsize,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"px", attr, guardsize);
return ret;
ret = pthread_attr_getscopep(attr, contentionscope);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getscope,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pp", attr, contentionscope);
return ret;
int pthread_attr_setscope(pthread_attr_t *attr, int contentionscope)
{
pthread_t thread = 0;
- static int (*pthread_attr_setscopep)(pthread_attr_t *attr,
+ static int (*pthread_attr_setscopep)(pthread_attr_t *attr,
int contentionscope);
BEFORE_ORIGINAL_THREAD(pthread_attr_setscope, LIBPTHREAD);
ret = pthread_attr_setscopep(attr, contentionscope);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setscope,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"pd", attr, contentionscope);
return ret;
}
-int pthread_attr_getstack(const pthread_attr_t *attr,
+int pthread_attr_getstack(const pthread_attr_t *attr,
void **stackaddr, size_t *stacksize)
{
pthread_t thread = 0;
ret = pthread_attr_getstackp(attr, stackaddr, stacksize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_getstack,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"ppp", attr, stackaddr, stacksize);
return ret;
ret = pthread_attr_setstackp(attr, stackaddr, stacksize);
AFTER_PACK_ORIGINAL_THREAD(API_ID_pthread_attr_setstack,
- ret, thread, THREAD_API_OTHER,
+ ret, thread, THREAD_API_OTHER,
"ppx", attr, stackaddr, stacksize);
return ret;
GET_REAL_FUNC_TIZEN(_ZN5Tizen3App5UiApp11RemoveFrameERKNS_2Ui8Controls5FrameE, LIBOSP_UIFW, uiapp_removeframep);
probeBlockStart();
-
+
PREPARE_LOCAL_BUF();
-
+
frame.IsInTouchMode();
if((bOption = isOptionEnabled(OPT_UI)))
{
Control* parent = NULL;
setProbePoint(&probeInfo);
-
+
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_result_UiApp__RemoveFrame_const_Tizen__Ui__Controls__Frame__frame_,
"p", &frame);
ret = (this->*uiapp_removeframep)(frame);
probeBlockStart();
-
+
if(bOption)
{
PACK_RETURN_END(ret);
}
-
+
FLUSH_LOCAL_BUF();
-
+
probeBlockEnd();
-
+
return ret;
}
{
Control* parent = NULL;
setProbePoint(&probeInfo);
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_void_Control__SetName_const_Tizen__Base__String__name_,
if(isOptionEnabled(OPT_UI))
{
setProbePoint(&probeInfo);
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_result_Container__AddControl_const_Control__control_,
if((bOption = isOptionEnabled(OPT_UI)))
{
setProbePoint(&probeInfo);
-
+
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_result_Container__RemoveControl_const_Control__control_,
"p", &control);
{
PACK_RETURN_END(ret);
}
-
- FLUSH_LOCAL_BUF();
+
+ FLUSH_LOCAL_BUF();
probeBlockEnd();
-
+
return ret;
}
{
PACK_RETURN_END(ret);
}
-
- FLUSH_LOCAL_BUF();
+
+ FLUSH_LOCAL_BUF();
probeBlockEnd();
if((bOption = isOptionEnabled(OPT_UI)))
{
setProbePoint(&probeInfo);
-
+
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_result_Container__RemoveControl_int_index_,
"d", index);
FLUSH_LOCAL_BUF();
probeBlockEnd();
-
+
return ret;
}
{
Control* pcontrol = NULL;
setProbePoint(&probeInfo);
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_UICONTROL,
API_ID_void_Container__RemoveAllControls_void_,
*
* Copyright (File::*c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <FIo.h>
if(E_SUCCESS == File::GetAttributes(this->GetName(), attr))
size = attr.GetFileSize();
WcharToChar(temp_path,filePath.GetPointer());
- WcharToChar(temp_mode,openMode.GetPointer());
-
+ WcharToChar(temp_mode,openMode.GetPointer());
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_RESOURCE, API_ID_result_File__Construct_const_Tizen__Base__String__filePath__const_Tizen__Base__String__openMode__bool_createParentDirectories_,
"ssd", temp_path, temp_mode, createParentDirectories);
PACK_COMMON_END(ret, ret, blockresult);
PACK_RESOURCE(0, (unsigned long)this, FD_API_OPEN, size, temp_path);
FLUSH_LOCAL_BUF();
-
+
postBlockEnd();
}
postBlockEnd();
}
-
+
return ret;
}
PACK_COMMON_END(ret, ret, blockresult);
PACK_RESOURCE(nRead, (unsigned long)this, FD_API_READ_END, size, temp);
FLUSH_LOCAL_BUF();
-
+
postBlockEnd();
}
}
result Mutex::Create(const Tizen::Base::String& name) {
- typedef result
+ typedef result
(Mutex::*methodType)(const Tizen::Base::String& name);
static methodType Createp = 0;
result ret;
}
result Mutex::Release(void) {
- typedef result
+ typedef result
(Mutex::*methodType)(void);
static methodType Releasep = 0;
result ret;
}
result Mutex::TryToAcquire(void) {
- typedef result
+ typedef result
(Mutex::*methodType)(void);
static methodType TryToAcquirep = 0;
result ret;
result Semaphore::Create(int count) {
- typedef result
+ typedef result
(Semaphore::*methodType)(int count);
static methodType Createp = 0;
result ret;
}
result Semaphore::Create(const Tizen::Base::String& name, int count) {
- typedef result
+ typedef result
(Semaphore::*methodType)(const Tizen::Base::String& name, int count);
static methodType Createp = 0;
result ret;
}
result Semaphore::TryToAcquire(void) {
- typedef result
+ typedef result
(Semaphore::*methodType)(void);
static methodType TryToAcquirep = 0;
result ret;
}
result Semaphore::Release(void) {
- typedef result
+ typedef result
(Semaphore::*methodType)(void);
static methodType Releasep = 0;
result ret;
result Monitor::Construct(void) {
- typedef result
+ typedef result
(Monitor::*methodType)(void);
static methodType Constructp = 0;
result ret;
}
result Monitor::Exit(void) {
- typedef result
+ typedef result
(Monitor::*methodType)(void);
static methodType Exitp = 0;
result ret;
}
result Monitor::Notify(void) {
- typedef result
+ typedef result
(Monitor::*methodType)(void);
static methodType Notifyp = 0;
result ret;
}
result Monitor::NotifyAll(void) {
- typedef result
+ typedef result
(Monitor::*methodType)(void);
static methodType NotifyAllp = 0;
result ret;
return ret;
}
-result EventDrivenThread::Construct(const Tizen::Base::String &name, long stackSize,
+result EventDrivenThread::Construct(const Tizen::Base::String &name, long stackSize,
ThreadPriority priority) {
typedef result
(Thread::*methodType)(const Tizen::Base::String &name, long stackSize,
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
//#include <stdio.h>
static Evas_Object * (*elm_win_addp)(Evas_Object *parent, const char* name, Elm_Win_Type type);
BEFORE_ORIGINAL_SNAPSHOT(elm_win_add, LIBELEMENTARY);
-
+
ret = elm_win_addp(parent, name, type);
-
+
AFTER_ORIGINAL_SNAPSHOT(ret);
-
+
return ret;
}
BEFORE_ORIGINAL_SNAPSHOT(elm_controlbar_add, LIBELEMENTARY);
ret = elm_controlbar_addp(parent);
-
+
AFTER_ORIGINAL_SNAPSHOT(ret);
return ret;
-
+
// ecore_evas_callback_post_render_set(ecore_evas_ecore_evas_get(evas_object_evas_get(parent)), _cbecore);
}
BEFORE_ORIGINAL_SNAPSHOT(elm_naviframe_add, LIBELEMENTARY);
ret = elm_naviframe_addp(parent);
-
+
AFTER_ORIGINAL_SNAPSHOT(ret);
return ret;
BEFORE_ORIGINAL_SNAPSHOT(elm_pager_add, LIBELEMENTARY);
ret = elm_pager_addp(parent);
-
+
AFTER_ORIGINAL_SNAPSHOT(ret);
return ret;
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#ifndef __DA_SNAPSHOT_H__
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <Evas.h>
typedef bool (_DisplayManager::*methodtype)(_RootVisualElement& root, bool check);
static methodtype mp;
bool ret;
-
+
GET_REAL_FUNC_TIZEN(_ZN5Tizen2Ui10Animations15_DisplayManager6RenderERNS1_18_RootVisualElementEb, LIBOSP_UIFW, mp);
probeBlockStart();
probeBlockEnd();
typedef result (_DisplayManager::*methodtype)(_RootVisualElement& root);
static methodtype mp;
result ret;
-
+
GET_REAL_FUNC_TIZEN(_ZN5Tizen2Ui10Animations15_DisplayManager10PostRenderERNS1_18_RootVisualElementE, LIBOSP_UIFW, mp);
probeBlockStart();
probeBlockEnd();
typedef result (_DisplayManager::*methodtype)(void);
static methodtype mp;
result ret;
-
+
GET_REAL_FUNC_TIZEN(_ZN5Tizen2Ui10Animations15_DisplayManager5FlushEv, LIBOSP_UIFW, mp);
probeBlockStart();
probeBlockEnd();
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Jaewon Lim <jaewon81.lim@samsung.com>
* Woojin Jung <woojin2.jung@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
*
* Contributors:
* - S-Core Co., Ltd
- *
+ *
*/
#include "daprobe.h"
char scene_name[50];
WcharToChar(scene_name, sceneid.GetPointer());
-
+
PREPARE_LOCAL_BUF();
PACK_COMMON_BEGIN(MSG_PROBE_SCENE,
API_ID_void_SceneManagerEventListener__OnSceneTransitionCompleted_const_SceneId__previousSceneId__const_SceneId__currentSceneId_,
*
* Copyright (c) 2000 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
*
- * Contact:
+ * Contact:
*
* Woojin Jung <woojin2.jung@samsung.com>
* Jaewon Lim <jaewon81.lim@samsung.com>
* Juyoung Kim <j0.kim@samsung.com>
* Anastasia Lyupa <a.lyupa@samsung.com>
- *
+ *
* This 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 2.1 of the License, or (at your option)
* any later version.
- *
+ *
* This 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
* Contributors:
* - S-Core Co., Ltd
* - Samsung RnD Institute Russia
- *
+ *
*/
#include <stdio.h>
for(i = PROFIL_TRIM_STACK_DEPTH; i < sample_info_array[index].bt_size; i++)
{
stringlen = strlen(strings[i - PROFIL_TRIM_STACK_DEPTH]) + 14;
- if(log->length + stringlen >= bufsize + initsize)
+ if(log->length + stringlen >= bufsize + initsize)
break;
log->length += sprintf(log->data + log->length, "%010u`,%s`,",
for(i = 0; i < sample_info_array[index].bt_size; i++)
{
stringlen = strlen(strings[i]) + 14;
- if(log->length + stringlen >= bufsize + initsize)
+ if(log->length + stringlen >= bufsize + initsize)
break;
log->length += sprintf(log->data + log->length, "%010u`,%s`,",
void *profil_log_func(void *data)
{
probeBlockStart();
-
+
sigset_t profsigmask;
sigemptyset(&profsigmask);
sigaddset(&profsigmask, SIGPROF);
elapsed_time_array[elapsed_time_index].self = this;
elapsed_time_index++;
- } while(0);
+ } while(0);
probeBlockEnd();
pthread_sigmask(SIG_SETMASK, &oldsigmask, NULL);
int i;
for(i = 0; i < elapsed_time_index; i++)
{
- sample_info_array[sample_write_index].bt_array[i + 1]
+ sample_info_array[sample_write_index].bt_array[i + 1]
= elapsed_time_array[i].self;
}
sample_info_array[sample_write_index].bt_size = elapsed_time_index + 1;
projects / platform / core / system / swap-probe.git / commitdiff