ample-1.0/src/ 40755 0 0 0 10534757175 10307 5 ustar 0 0 ample-1.0/src/main/ 40755 0 0 0 10534757175 11233 5 ustar 0 0 ample-1.0/src/main/assembly/ 40755 0 0 0 10535500150 13026 5 ustar 0 0 ample-1.0/src/main/bin/ 40755 0 0 0 10562312626 11770 5 ustar 0 0 ample-1.0/src/main/config/ 40755 0 0 0 10534757176 12501 5 ustar 0 0 ample-1.0/src/main/java/ 40755 0 0 0 10534763577 12157 5 ustar 0 0 ample-1.0/src/main/java/de/ 40755 0 0 0 10534757176 12545 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/ 40755 0 0 0 10534757176 13665 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/ 40755 0 0 0 10534757176 14272 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/st/ 40755 0 0 0 10534763065 14712 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/st/ample/ 40755 0 0 0 10535750765 16014 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/ 40755 0 0 0 10536230474 16732 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/st/ample/runtime/ 40755 0 0 0 10535306125 17462 5 ustar 0 0 ample-1.0/src/main/java/de/unisb/cs/st/ample/test/ 40755 0 0 0 10535742141 16760 5 ustar 0 0 ample-1.0/src/main/java/java/ 40755 0 0 0 10535306135 13060 5 ustar 0 0 ample-1.0/src/main/java/java/lang/ 40755 0 0 0 10535306136 14002 5 ustar 0 0 ample-1.0/src/main/java/java/lang/ample/ 40755 0 0 0 10535306136 15100 5 ustar 0 0 ample-1.0/src/main/resources/ 40755 0 0 0 10534757176 13246 5 ustar 0 0 ample-1.0/src/site/ 40755 0 0 0 10534757176 11254 5 ustar 0 0 ample-1.0/src/site/apt/ 40755 0 0 0 10534757176 12040 5 ustar 0 0 ample-1.0/src/test/ 40755 0 0 0 10534757176 11267 5 ustar 0 0 ample-1.0/src/test/java/ 40755 0 0 0 10534757176 12210 5 ustar 0 0 ample-1.0/src/test/java/de/ 40755 0 0 0 10534757176 12600 5 ustar 0 0 ample-1.0/src/test/java/de/unisb/ 40755 0 0 0 10534757176 13720 5 ustar 0 0 ample-1.0/src/test/java/de/unisb/cs/ 40755 0 0 0 10534757176 14325 5 ustar 0 0 ample-1.0/src/test/java/de/unisb/cs/st/ 40755 0 0 0 10544672134 14742 5 ustar 0 0 ample-1.0/src/test/java/de/unisb/cs/st/ample/ 40755 0 0 0 10544672134 16040 5 ustar 0 0 ample-1.0/src/test/java/de/unisb/cs/st/ample/test/ 40755 0 0 0 10550703155 17012 5 ustar 0 0 ample-1.0/src/test/resources/ 40755 0 0 0 10534757176 13301 5 ustar 0 0 ample-1.0/checkstyle.xml 100644 0 0 24311 10516143714 12502 0 ustar 0 0
ample-1.0/LICENSE-APACHE.txt 100644 0 0 26136 10161362341 12366 0 ustar 0 0
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
ample-1.0/LICENSE-ASM.txt 100644 0 0 2747 10562311034 12045 0 ustar 0 0 Copyright (c) 2000-2005 INRIA, France Telecom
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holders nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
ample-1.0/LICENSE.txt 100644 0 0 43103 10444354236 11450 0 ustar 0 0 GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
51 Franklin Street, 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.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
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 Program or any portion
of it, thus forming a work based on the Program, 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) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
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 Program, 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 Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) 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; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, 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 executable. However, as a
special exception, the source code 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.
If distribution of executable or 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 counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program 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.
5. 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 Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program 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 to
this License.
7. 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 Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program 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 Program.
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.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program 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.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies 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 Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, 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
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. 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 PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
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.
Copyright (C)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.
ample-1.0/pom.xml 100644 0 0 25440 10562310347 11142 0 ustar 0 0
4.0.0de.unisb.cs.stampleAMPLEAutomatic defect localization based on method call sequences.1.0jarhttp://www.st.cs.uni-sb.de/2004dallmeierValentin Dallmeierdallmeier@cs.uni-sb.dehttp://www.st.cs.uni-sb.de/~dallmeier/Software Engineering Group at Saarland Universityhttp://www.st.cs.uni-sb.de/2Continuumhttp://kubrick:8080/continuum/mailtruetruetruetrue
dallmeier@st.cs.uni-sb.de
Eclipse Public License (EPL)http://www.opensource.org/licenses/eclipse-1.0.txtmanualscm:svn+ssh://ssh.st.cs.uni-sb.de/home/SVN/dallmeier/devel/ample/trunkscm:svn+ssh://ssh.st.cs.uni-sb.de/home/SVN/dallmeier/devel/ample/trunkSoftware Engineering Group at Saarland Universityhttp://www.st.cs.uni-sb.de/junitjunit4.1testcommons-collectionscommons-collections1.0commons-langcommons-lang2.1log4jlog4j1.2.13asmasm2.2.1compileorg.softevoutil0.1compileasmasm-commons2.2.1compileasmasm-util2.2.1compilest.cs.uni-sb.deSoftware Engineering Chair repositorydefaulthttp://www.st.cs.uni-sb.de/maven2codehaus-m2-repositoryCodehaus Maven 2.x Repositoryhttp://repository.codehaus.orgorg.apache.maven.pluginsmaven-compiler-plugin1.51.5maven-assembly-pluginsrc/main/assembly/bin.xmlsrc/main/assembly/src.xmlorg.apache.maven.pluginsmaven-clover-plugin1.5pre-siteinstrumentorg.codehaus.mojocobertura-maven-plugincleanorg.apache.maven.pluginsmaven-project-info-reports-plugincimdependencieslicenseindexsummaryscmproject-teamorg.apache.maven.pluginsmaven-checkstyle-plugincheckstyle.xmlorg.apache.maven.pluginsmaven-clover-pluginorg.codehaus.mojofindbugs-maven-pluginMax1.0-beta-1org.apache.maven.pluginsmaven-javadoc-plugin128m512morg.apache.maven.pluginsmaven-jxr-pluginorg.apache.maven.pluginsmaven-surefire-report-pluginorg.codehaus.mojocobertura-maven-pluginorg.apache.maven.pluginsmaven-pmd-plugintrue1.5org.codehaus.mojotaglist-maven-pluginTODOFIXMEXXXorg.apache.maven.pluginsmaven-jar-pluginde.unisb.cs.st.ample.runtime.InstrumenterTrue
ample-1.0/README.txt 100644 0 0 3616 10562324437 11311 0 ustar 0 0 ============= Release notes Ample 1.0 ===============
This is a reimplementation of the original engine. It no longer requires
instrumentation before a program can be analyzed. Ample uses the agent
interface in JDK 1.5 to analyze patterns on the fly.
Before you start:
================
- You need to edit all scripts found in "bin" and specify the installation
directory of Ample and the JDK.
- In order for Ample to work in all environments (programs that use their
own classloaders), we need to patch the system library and add a class
java.lang.ample.CallSequenceSetRecorder . The package provides a script
"bin/updatejre.sh" to do exactly this for you (tested only with Linux
JDKs). The sole parameter for the script is the installation directory of
the JDK you want to use.
Collecting Patterns:
===================
To collect patterns from a run, you need to invoke the virtual machine
such that the Ample agent is loaded prior to the execution of the program.
There is a script "bin/runample.sh" that sets up an appropriate classpath
and passes the required parameters. Remember to specify required values
in the script before you use it.
Note: You can pass two properties that influence the way Ample records
patterns:
ample.patternfile the name of the file were patterns are stored (default "patterns.ser")
ample.windowsize the size of the call window used (default 5)
Example: To store patterns with a window size of 5 in file "failingpatterns.ser",
run
bin/runample.sh -Dample.patternfile=failingpatterns.ser -Dample.windowsize=5
Calcualting a Ranking:
=====================
To calculate a ranking from at least one failing and one or
more passing pattern sets, you can execute script "bin/rankpatterns.sh".
The first parameter for the script is the name of the file with failing
patterns, subsequent parameters are the passing pattern files. The ranking
is output to standard out.
ample-1.0/src/main/assembly/bin.xml 100644 0 0 3031 10535500150 14412 0 ustar 0 0
bintar.gzREADME*LICENSE*NOTICE*src/main/binbin*.py*.shunix0755src/main/configconfig*unix0644targetlib*.jarlibjunit:junit
ample-1.0/src/main/assembly/src.xml 100644 0 0 1155 10476037307 14453 0 ustar 0 0
srctar.gztar.bz2zipREADME*LICENSE*NOTICE*pom.xmlcheckstyle.xmlsrc
ample-1.0/src/main/bin/rankpatterns.sh 100644 0 0 643 10562312625 15117 0 ustar 0 0 # JAVA_HOME
JAVA_HOME=
# Installation directory
INSTALL=
#========================== No need to edit anything from here =========================
LIBDIR=${INSTALL}/lib
for jar in $( find $LIBDIR -name "*.jar" | sort -r )
do
CLASSPATH=$jar:${CLASSPATH}
done
# remove last ':'
CLASSPATH=${CLASSPATH:0:${#CLASSPATH} - 1}
$JAVA_HOME/bin/java -Xmx1000M -classpath $CLASSPATH de.unisb.cs.st.ample.eval.Ranker "$@"
ample-1.0/src/main/bin/runample.sh 100644 0 0 670 10535306046 14226 0 ustar 0 0 # JAVA_HOME
JAVA_HOME=
# Installation directory
INSTALL=
#========================== No need to edit anything from here =========================
LIBDIR=${INSTALL}/lib
for jar in $( find $LIBDIR -name "*.jar" | sort -r )
do
CLASSPATH=$jar:${CLASSPATH}
done
# remove last ':'
CLASSPATH=${CLASSPATH:0:${#CLASSPATH} - 1}
$JAVA_HOME/bin/java -Xmx1000M -Xbootclasspath/a:$CLASSPATH -javaagent:$INSTALL/lib/ample-0.1-SNAPSHOT.jar "$@"
ample-1.0/src/main/bin/updatejre.sh 100644 0 0 464 10535310526 14365 0 ustar 0 0 # Installation directory
INSTALL=
VERSION=0.1
#========================== No need to edit anything from here =========================
LIBDIR=${INSTALL}/lib
cd $INSTALL
rm -rf java
jar xvf $LIBDIR/ample-$VERSION.jar java/lang
mv java $1/jre/lib
cd $1/jre/lib
jar ufv rt.jar java/lang/ample/*
rm -rf java
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/Pattern.java 100644 0 0 3223 10536257402 21307 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
public class Pattern {
private String[] methodNames = null;
private int numberOfOccurences = 0;
private boolean isHashCodeUpToDate = false;
private int hashValue = 0;
public Pattern(String[] methodNames, int numberOfOccurences) {
super();
this.methodNames = methodNames;
this.numberOfOccurences = numberOfOccurences;
}
public String[] getMethodNames() {
return methodNames;
}
public int getNumberOfOccurences() {
return numberOfOccurences;
}
private void updateHash(int value) {
int highorder = hashValue & 0xf8000000;
hashValue = hashValue << 5;
hashValue = hashValue ^ (highorder >> 27);
hashValue = hashValue ^ value;
}
public int hashCode() {
if (!isHashCodeUpToDate) {
for (int counter = 0; counter < methodNames.length; counter++) {
updateHash(methodNames[counter].hashCode());
}
isHashCodeUpToDate = true;
}
return hashValue;
}
public boolean equals(Object object) {
Pattern peer = (Pattern) object;
if (peer.methodNames.length != methodNames.length) {
return false;
} else {
for (int counter = 0; counter < methodNames.length; counter++) {
if (!methodNames[counter].equals(peer.methodNames[counter])) {
return false;
}
}
return true;
}
}
public String toString() {
StringBuffer result = new StringBuffer("*" + numberOfOccurences + "*" + " #" + hashCode() + "# ");
for (int counter = 0; counter < methodNames.length; counter++) {
result.append(methodNames[counter]);
if (counter != methodNames.length - 1) {
result.append(" | ");
}
}
return result.toString();
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/PatternSet.java 100644 0 0 12276 10536235334 22013 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
import java.io.BufferedInputStream;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
public class PatternSet {
HashMap> patternSet = null;
public PatternSet() {
patternSet = new HashMap>();
}
public PatternSet(HashMap> patternSet) {
this.patternSet = patternSet;
}
public HashMap> getPatternSet() {
return patternSet;
}
@SuppressWarnings("unchecked")
public PatternSet merge(PatternSet newPatterns) {
PatternSet result = new PatternSet();
Iterator classNameIterator;
classNameIterator = patternSet.keySet().iterator();
while (classNameIterator.hasNext()) {
String className = classNameIterator.next();
HashSet clone = (HashSet) patternSet.get(className).clone();
result.patternSet.put(className, clone);
}
classNameIterator = newPatterns.patternSet.keySet().iterator();
while (classNameIterator.hasNext()) {
String className = classNameIterator.next();
if (!result.patternSet.containsKey(className)) {
HashSet clone = (HashSet) newPatterns.patternSet.get(className).clone();
result.patternSet.put(className, clone) ;
} else {
result.patternSet.get(className).addAll(newPatterns.patternSet.get(className));
}
}
return result;
}
public String toString() {
StringBuffer result = new StringBuffer(1000000);
for (String className : patternSet.keySet()) {
result.append(className);
result.append('\n');
HashSet patterns = patternSet.get(className);
for (Pattern pattern : patterns) {
result.append('\t');
result.append(pattern.toString());
result.append('\n');
}
}
return result.toString();
}
public PatternSet intersect(PatternSet cutPatterns) {
PatternSet result = new PatternSet();
for (String className : patternSet.keySet()) {
if (cutPatterns.patternSet.containsKey(className)) {
HashSet patterns = patternSet.get(className);
HashSet cutClassPatterns = cutPatterns.patternSet.get(className);
HashSet commonPatterns = new HashSet();
for (Pattern pattern : patterns) {
if (cutClassPatterns.contains(pattern)) {
commonPatterns.add(pattern);
}
}
if (commonPatterns.size() > 0) {
result.patternSet.put(className, commonPatterns);
}
}
}
return result;
}
public boolean containsPattern(String className, Pattern pattern) {
HashSet patterns = patternSet.get(className);
if (patterns != null && patterns.contains(pattern)) {
return true;
} else {
return false;
}
}
public boolean containsPatternsForClass(String className) {
return patternSet.containsKey(className);
}
@SuppressWarnings("unchecked")
public PatternSet subtract(PatternSet subtractPatterns) {
PatternSet result = new PatternSet();
for (String className : patternSet.keySet()) {
if (!subtractPatterns.patternSet.containsKey(className)) {
HashSet clone = (HashSet) patternSet.get(className).clone();
result.patternSet.put(className, clone);
} else {
HashSet remainingPatterns = new HashSet();
HashSet subtractClassPatterns = subtractPatterns.patternSet.get(className);
HashSet patterns = patternSet.get(className);
for (Pattern pattern : patterns) {
if (!subtractClassPatterns.contains(pattern)) {
remainingPatterns.add(pattern);
}
}
if (remainingPatterns.size() > 0) {
result.patternSet.put(className, remainingPatterns);
}
}
}
return result;
}
public static PatternSet readPatternSetFromFile(File patternFile) throws IOException {
HashMap> patternSet;
DataInputStream dataInputStream;
FileInputStream fileInputStream = null;
patternSet = new HashMap>();
try {
fileInputStream = new FileInputStream(patternFile);
dataInputStream = new DataInputStream(new BufferedInputStream(fileInputStream));
int windowSize = dataInputStream.readInt();
int numberOfClasses = dataInputStream.readInt();
for (int counter = 0; counter < numberOfClasses; counter++) {
String className = dataInputStream.readUTF();
int numberOfPatterns = dataInputStream.readInt();
for (int counter2 = 0; counter2 < numberOfPatterns; counter2++) {
int numberOfOccurences = dataInputStream.readInt();
String[] methodNames = new String[windowSize];
for (int counter3 = 0; counter3 < windowSize; counter3++) {
methodNames[counter3] = dataInputStream.readUTF();
}
Pattern pattern = new Pattern(methodNames, numberOfOccurences);
HashSet patterns = patternSet.get(className);
if (patterns == null) {
patterns = new HashSet();
patternSet.put(className, patterns);
}
patterns.add(pattern);
}
}
return new PatternSet(patternSet);
} finally {
if (fileInputStream != null) {
try {
fileInputStream.close();
} catch (IOException finalizeException) {
//ignore exception
}
}
}
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/PatternSetDisplayer.java 100644 0 0 1001 10536223016 23622 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
import java.io.File;
import java.io.IOException;
public class PatternSetDisplayer {
public static void main(String[] args) throws IOException {
if (args.length != 1) {
System.out.println("Usage: ");
return;
} else {
System.out.println("Patterns in file \"" + new File(args[0]).getAbsolutePath() + "\"");
PatternSet patternSet = PatternSet.readPatternSetFromFile(new File(args[0]));
System.out.println(patternSet.toString());
}
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/RankedElement.java 100644 0 0 1337 10536256416 22420 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
import java.text.DecimalFormat;
public class RankedElement implements Comparable {
private String className;
private double value;
private static final DecimalFormat valueFormatter = new DecimalFormat("0.00");
public RankedElement(String className, double value) {
super();
this.className = className;
this.value = value;
}
public int compareTo(Object object) {
RankedElement peer = (RankedElement) object;
if (peer.value < value) {
return -1;
} else {
return +1;
}
}
public String getClassName() {
return className;
}
public double getValue() {
return value;
}
public String toString() {
return valueFormatter.format(value) + " " + className;
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/Ranker.java 100644 0 0 1605 10556144015 21113 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
import java.io.File;
import java.io.IOException;
import java.util.Vector;
public class Ranker {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
if (args.length != 2 ) {
System.out.println("Usage: +");
return;
} else {
PatternSet badPatterns = PatternSet.readPatternSetFromFile(new File(args[0]));
Vector goodPatternSets = new Vector();
for (int counter = 1; counter < args.length; counter++) {
goodPatternSets.add(PatternSet.readPatternSetFromFile(new File(args[counter])));
}
RankingCalculator ranker = new RankingCalculator(badPatterns, goodPatternSets);
Vector ranking = ranker.calculateRanking();
for (RankedElement element : ranking) {
System.out.println(element);
}
}
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/eval/RankingCalculator.java 100644 0 0 4243 10536261510 23273 0 ustar 0 0 package de.unisb.cs.st.ample.eval;
import java.util.Collections;
import java.util.Vector;
public class RankingCalculator {
private Vector goodRunPatterns;
private PatternSet badRunPatterns;
private boolean verbose = false;
public RankingCalculator(PatternSet badRunPatterns, Vector goodRunPatterns) {
this.badRunPatterns = badRunPatterns;
this.goodRunPatterns = goodRunPatterns;
}
@SuppressWarnings("unchecked")
public Vector calculateRanking() {
Vector result = new Vector();
PatternSet allPatterns = new PatternSet();
allPatterns = allPatterns.merge(badRunPatterns);
for (PatternSet patterns : goodRunPatterns) {
allPatterns = allPatterns.merge(patterns);
}
for (String className : allPatterns.getPatternSet().keySet()) {
if (verbose) {
System.out.println("Calculating ranking for class " + className);
}
if (badRunPatterns.containsPatternsForClass(className)) {
int numberOfPatterns = 0;
double patternWeightSum = 0;
for (Pattern pattern : allPatterns.getPatternSet().get(className)) {
patternWeightSum += calculatePatternWeight(className, pattern);
numberOfPatterns++;
}
double averagePatternWeight = (double) (patternWeightSum/((double) numberOfPatterns));
result.add(new RankedElement(className, averagePatternWeight));
}
}
Collections.sort(result);
return result;
}
private double calculatePatternWeight(String className, Pattern pattern) {
double result = 0;
if (verbose) {
System.out.println("Calculating weight of pattern " + pattern);
}
for (PatternSet patternSet : goodRunPatterns) {
int counter = 0;
if (patternSet.containsPattern(className, pattern)) {
if (verbose) {
System.out.println("Pattern is in good run #" + counter);
}
result += (double) ((double) 1)/((double) goodRunPatterns.size());
}
counter++;
}
if (badRunPatterns.containsPattern(className, pattern)) {
if (verbose) {
System.out.println("Pattern is in bad run ");
}
result = (double) (((double) 1) - result);
}
if (verbose) {
System.out.println("Pattern weight: " + result);
}
return result;
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/runtime/CallSequenceClassVisitor.java 100644 0 0 5444 10562307732 25350 0 ustar 0 0 package de.unisb.cs.st.ample.runtime;
import java.util.HashSet;
import org.objectweb.asm.ClassAdapter;
import org.objectweb.asm.ClassVisitor;
import org.objectweb.asm.FieldVisitor;
import org.objectweb.asm.MethodVisitor;
import org.objectweb.asm.Opcodes;
import org.softevo.util.asm.ClassIdentifierMap;
import org.softevo.util.asm.IdentifierMap;
public class CallSequenceClassVisitor extends ClassAdapter implements Opcodes {
private String className = null;
private String superClassName = null;
protected String test = null;
private IdentifierMap methodIdentifierMap;
private int classIdentifier;
private boolean isTopLevelClass;
private boolean identifierFieldAdded = false;
private boolean isInterface = false;
private HashSet preloadedClasses;
public CallSequenceClassVisitor(ClassVisitor classVisitor,
IdentifierMap methodIdentifierMap, int classIdentifier, HashSet preloadedClasses) {
super(classVisitor);
this.methodIdentifierMap = methodIdentifierMap;
this.classIdentifier = classIdentifier;
this.preloadedClasses = preloadedClasses;
}
@Override
public void visit(int version, int access, String name, String signature, String superName, String[] interfaces) {
this.className = name;
this.superClassName = superName;
this.isTopLevelClass = superName.startsWith("java/lang") || superName.startsWith("sun") || preloadedClasses.contains(superName);
this.isInterface = (access & ACC_INTERFACE) > 0;
// System.out.println("Is interface: " + isInterface);
super.visit(version, access, name, signature, superName, interfaces);
}
@Override
public MethodVisitor visitMethod(int access, String name, String desc, String signature, String[] exceptions) {
if (!isInterface && ((access & (ACC_NATIVE | ACC_ABSTRACT)) == 0)) {
if (isTopLevelClass && !identifierFieldAdded) {
super.visitField(ACC_PROTECTED, IdentifierFieldSetConstructorVisitor.FIELD_OBJECTID, "I", null, null);
identifierFieldAdded = true;
}
int methodIdentifier = methodIdentifierMap.getIdentifier(className, name, desc, access);
MethodVisitor writeVisitor = super.visitMethod(access, name, desc, signature, exceptions);
if (name.equals("") && isTopLevelClass) {
MethodVisitor fieldSetVisitor = new IdentifierFieldSetConstructorVisitor(writeVisitor, className, superClassName);
MethodVisitor startEndVisitor = new StartEndTracingMethodVisitor(fieldSetVisitor, access, className, name, desc, methodIdentifier, classIdentifier);
return startEndVisitor;
} else {
MethodVisitor startEndVisitor = new StartEndTracingMethodVisitor(writeVisitor, access, className, name, desc, methodIdentifier, classIdentifier);
return startEndVisitor;
}
} else {
return super.visitMethod(access, name, desc, signature, exceptions);
}
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/runtime/IdentifierFieldSetConstructorVisitor.java 100644 0 0 2267 10535504710 27761 0 ustar 0 0 package de.unisb.cs.st.ample.runtime;
import org.objectweb.asm.MethodAdapter;
import org.objectweb.asm.MethodVisitor;
import org.objectweb.asm.Opcodes;
public class IdentifierFieldSetConstructorVisitor extends MethodAdapter implements Opcodes {
public static final String FIELD_OBJECTID = "___objectid";
private boolean isConstructorInstrumented = false;
private String superClassName;
private String className;
public IdentifierFieldSetConstructorVisitor(MethodVisitor methodVisitor, String className,
String superClassName) {
super(methodVisitor);
this.className = className;
this.superClassName = superClassName;
}
@Override
public void visitMethodInsn(int opCode, String owner, String name, String desc) {
super.visitMethodInsn(opCode, owner, name, desc);
if (!isConstructorInstrumented && (opCode == INVOKESPECIAL) &&
name.equals("") && owner.equals(superClassName)) {
isConstructorInstrumented = true;
super.visitVarInsn(ALOAD, 0);
super.visitMethodInsn(INVOKESTATIC, "java/lang/ample/CallSequenceSetRecorder", "getNextId", "()I");
super.visitFieldInsn(PUTFIELD, className, "___objectid", "I");
}
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/runtime/Instrumenter.java 100644 0 0 10137 10562312567 23152 0 ustar 0 0 package de.unisb.cs.st.ample.runtime;
import java.io.PrintWriter;
import java.lang.instrument.ClassFileTransformer;
import java.lang.instrument.IllegalClassFormatException;
import java.lang.instrument.Instrumentation;
import java.security.ProtectionDomain;
import java.util.HashSet;
import org.objectweb.asm.ClassReader;
import org.objectweb.asm.ClassWriter;
import org.objectweb.asm.util.TraceClassVisitor;
import org.softevo.util.asm.ClassIdentifierMap;
import org.softevo.util.asm.IdentifierMap;
public class Instrumenter implements ClassFileTransformer {
public static final String TRACECLASSNAME = "java/lang/ample/CallSequenceSetRecorder";
private IdentifierMap methodIdentifierMap = null;
private ClassIdentifierMap classIdentifierMap = null;
private static Instrumenter singletonInstance = null;
private HashSet preloadedClasses = null;
private HashSet forbiddenClasses = null;
private HashSet applicationClasses = null;
private Instrumenter() {
methodIdentifierMap = new IdentifierMap();
classIdentifierMap = new ClassIdentifierMap();
preloadedClasses = new HashSet();
applicationClasses = new HashSet();
createForbiddenClasses();
}
private void createForbiddenClasses() {
forbiddenClasses = new HashSet();
forbiddenClasses.add("java/util/LinkedList");
forbiddenClasses.add("java/util/Queue");
forbiddenClasses.add("java/util/AbstractSequentialList");
forbiddenClasses.add("java/util/LinkedList$Entry");
forbiddenClasses.add("java/util/HashMap$KeySet");
forbiddenClasses.add("java/util/HashMap$KeyIterator");
forbiddenClasses.add("java/util/HashMap$HashIterator");
forbiddenClasses.add("java/io/DataOutputStream");
forbiddenClasses.add("java/io/DataOutput");
}
public static void premain(String agentArgs, Instrumentation inst) {
singletonInstance = new Instrumenter();
java.lang.ample.CallSequenceSetRecorder.classIdentifierMap = singletonInstance.classIdentifierMap;
java.lang.ample.CallSequenceSetRecorder.methodIdentifierMap = singletonInstance.methodIdentifierMap;
java.lang.ample.CallSequenceSetRecorder.applicationClasses = singletonInstance.applicationClasses;
inst.addTransformer(singletonInstance);
Class[] loadedClasses = inst.getAllLoadedClasses();
for (int counter = 0; counter < loadedClasses.length; counter++) {
String className = loadedClasses[counter].getName().replace('.', '/');
singletonInstance.preloadedClasses.add(className);
// System.out.println(className);
}
singletonInstance.preloadedClasses.addAll(singletonInstance.forbiddenClasses);
}
public byte[] transform(ClassLoader loader, String className,
Class classBeingRedefined, ProtectionDomain protectionDomain,
byte[] classBytes)
throws IllegalClassFormatException {
try {
if (!className.startsWith("de/unisb") && !className.startsWith("java/lang") &&
!className.startsWith("sun") && !forbiddenClasses.contains(className)) {
if (loader != null) {
applicationClasses.add(className);
}
return transform(classBytes, className);
} else {
return classBytes;
}
} catch (Throwable oops) {
oops.printStackTrace(System.out);
return classBytes;
}
}
protected byte[] transform(byte[] classBytes, String className) {
ClassReader classReader = new ClassReader(classBytes);
ClassWriter classWriter = new ClassWriter(true);
CallSequenceClassVisitor visitor = new CallSequenceClassVisitor(classWriter, methodIdentifierMap,
classIdentifierMap.getIdentifier(className),
preloadedClasses);
classReader.accept(visitor, false);
byte[] bytes = classWriter.toByteArray();
return bytes;
}
public Instrumenter getInstrumenter() {
return singletonInstance;
}
private static void displayClass(byte[] classBytes) {
ClassReader classReader;
TraceClassVisitor traceVisitor;
classReader = new ClassReader(classBytes);
traceVisitor = new TraceClassVisitor(new PrintWriter(System.out));
classReader.accept(traceVisitor, false);
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/runtime/StartEndTracingMethodVisitor.java 100644 0 0 7677 10562307714 26225 0 ustar 0 0 /*
*
*/
package de.unisb.cs.st.ample.runtime;
import org.objectweb.asm.Label;
import org.objectweb.asm.MethodVisitor;
import org.objectweb.asm.Opcodes;
import org.objectweb.asm.commons.LocalVariablesSorter;
public class StartEndTracingMethodVisitor extends LocalVariablesSorter implements Opcodes {
private Label methodStartLabel;
private Label methodEndLabel;
private Label exceptionHandlerStartLabel;
private int methodIdentifier;
private int classIdentifier;
private int access;
private String name;
private String className;
private boolean isConstructor = false;
private boolean isConstructorStartInstrumented = false;
private int newInstructionCounter = 0;
public StartEndTracingMethodVisitor(MethodVisitor visitor, int access, String className,
String name, String desc, int methodIdentifier,
int classIdentifier) {
super(access, desc, visitor);
this.methodIdentifier = methodIdentifier;
this.classIdentifier = classIdentifier;
this.access = access;
this.name = name;
this.className = className;
isConstructor = name.equals("");
}
@Override
public void visitMethodInsn(int opCode, String owner, String name, String desc) {
super.visitMethodInsn(opCode, owner, name, desc);
if (isConstructor && !isConstructorStartInstrumented) {
if (opCode == INVOKESPECIAL && name.equals("")) {
if (newInstructionCounter == 0) {
addMethodStartCode();
isConstructorStartInstrumented = true;
} else {
newInstructionCounter--;
}
}
}
}
@Override
public void visitInsn(int opcode) {
if ((opcode == ARETURN) || (opcode == IRETURN) || (opcode == DRETURN) || (opcode == LRETURN) || (opcode == FRETURN)
|| (opcode == RETURN)) {
addMethodEndCode();
}
super.visitInsn(opcode);
}
protected void addMethodEndCode() {
super.visitLdcInsn(new Integer(methodIdentifier));
super.visitLdcInsn(new Integer(classIdentifier));
if ((access & ACC_STATIC) == 0 ) {
super.visitVarInsn(ALOAD, 0);
super.visitFieldInsn(GETFIELD, className, IdentifierFieldSetConstructorVisitor.FIELD_OBJECTID, "I");
super.visitMethodInsn(INVOKESTATIC, Instrumenter.TRACECLASSNAME, "dynamicMethodEnded", "(III)V");
} else {
super.visitMethodInsn(INVOKESTATIC, Instrumenter.TRACECLASSNAME, "staticMethodEnded", "(II)V");
}
}
@Override
public void visitTypeInsn(int opcode, String desc) {
if (isConstructor && !isConstructorStartInstrumented && (opcode == NEW)) {
newInstructionCounter++;
}
super.visitTypeInsn(opcode, desc);
}
protected void addMethodStartCode() {
methodStartLabel = new Label();
super.visitLabel(methodStartLabel);
super.visitLdcInsn(new Integer(methodIdentifier));
super.visitLdcInsn(new Integer(classIdentifier));
if ((access & ACC_STATIC) == 0) {
super.visitVarInsn(ALOAD, 0);
super.visitFieldInsn(GETFIELD, className, IdentifierFieldSetConstructorVisitor.FIELD_OBJECTID, "I");
super.visitMethodInsn(INVOKESTATIC, Instrumenter.TRACECLASSNAME, "dynamicMethodStarted",
"(III)V");
} else {
super.visitMethodInsn(INVOKESTATIC, Instrumenter.TRACECLASSNAME, "staticMethodStarted", "(II)V");
}
}
@Override
public void visitCode() {
super.visitCode();
if (!isConstructor) {
addMethodStartCode();
}
}
@Override
public void visitEnd() {
int exceptionVariableIndex = -1;
if (methodStartLabel != null) {
methodEndLabel = new Label();
exceptionHandlerStartLabel = new Label();
super.visitLabel(methodEndLabel);
super.visitLabel(exceptionHandlerStartLabel);
exceptionVariableIndex = newLocal(1);
super.visitVarInsn(ASTORE, exceptionVariableIndex);
addMethodEndCode();
super.visitVarInsn(ALOAD, exceptionVariableIndex);
super.visitInsn(ATHROW);
super.visitTryCatchBlock(methodStartLabel, methodEndLabel, exceptionHandlerStartLabel, null);
} else {
throw new RuntimeException("Method start label is null: " + className + "." + name);
}
super.visitEnd();
}
}
ample-1.0/src/main/java/de/unisb/cs/st/ample/test/RuntimeTest.java 100644 0 0 4501 10536036074 22205 0 ustar 0 0 package de.unisb.cs.st.ample.test;
import java.lang.ample.CallSequenceSetRecorder;
import org.softevo.util.asm.ClassIdentifierMap;
import org.softevo.util.asm.IdentifierMap;
public class RuntimeTest {
/**
* @param args
*/
public static void main(String[] args) {
CallSequenceSetRecorder.classIdentifierMap = new ClassIdentifierMap();
CallSequenceSetRecorder.classIdentifierMap.getIdentifier("RuntimeTest");
CallSequenceSetRecorder.classIdentifierMap.getIdentifier("RuntimeTest2");
CallSequenceSetRecorder.classIdentifierMap.getIdentifier("RuntimeTest3");
CallSequenceSetRecorder.methodIdentifierMap = new IdentifierMap();
CallSequenceSetRecorder.methodIdentifierMap.getIdentifier("RuntimeTest", "static1", "([Ljava/langString;)V", 0) ;
CallSequenceSetRecorder.methodIdentifierMap.getIdentifier("RuntimeTest", "static2", "([Ljava/langString;)V", 0) ;
CallSequenceSetRecorder.methodIdentifierMap.getIdentifier("RuntimeTest", "dynamic1", "([Ljava/langString;)V", 0) ;
CallSequenceSetRecorder.methodIdentifierMap.getIdentifier("RuntimeTest", "dynamic2", "([Ljava/langString;)V", 0) ;
CallSequenceSetRecorder.staticMethodStarted(0, 0);
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodStarted(3, 2, 2);
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(3, 2, 2);
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
CallSequenceSetRecorder.staticMethodEnded(0, 0);
/*for (int counter = 0; counter < 10; counter++) {
CallSequenceSetRecorder.dynamicMethodStarted(2, 1, 1);
for (int counter2 = 0; counter2 < 10; counter2++) {
CallSequenceSetRecorder.dynamicMethodStarted(3, 1, 1);
CallSequenceSetRecorder.dynamicMethodEnded(3, 1, 1);
}
CallSequenceSetRecorder.dynamicMethodEnded(2, 1, 1);
}
CallSequenceSetRecorder.staticMethodEnded(0, 0);*/
new Thread(new CallSequenceSetRecorder.ShutdownThread()).run();
}
}
ample-1.0/src/main/java/java/lang/ample/CallSequenceSetRecorder.java 100644 0 0 27527 10562324147 22605 0 ustar 0 0 package java.lang.ample;
import java.io.BufferedOutputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Stack;
import org.softevo.util.asm.ClassIdentifierMap;
import org.softevo.util.asm.IdentifierMap;
public class CallSequenceSetRecorder {
private static final String REVISION = "2";
public static final int METHODID_UNDEF = -1;
public static final int OBJECTID_STATIC = -2;
private static HashMap> threadIdToCallStackMap;
private static HashMap>> classIdToObjectWindowsMapMap;
private static HashMap> classIdToPatternSetMap;
private static Object lock = new Object();
private static int idCounter = 0;
private static int windowSize = -1;
public static IdentifierMap methodIdentifierMap = null;
public static ClassIdentifierMap classIdentifierMap = null;
public static HashSet applicationClasses = null;
private static boolean ignoreInterClassCalls = true;
private static boolean filterBootstrapLoaderClasses = true;
private static String patternFileName;
static {
Runtime.getRuntime().addShutdownHook(new Thread(new ShutdownThread()));
threadIdToCallStackMap = new HashMap>();
classIdToObjectWindowsMapMap = new HashMap>>();
classIdToPatternSetMap = new HashMap>();
if (System.getProperty("ample.windowsize") != null) {
windowSize = Integer.parseInt(System.getProperty("ample.windowsize"));
} else {
windowSize = 5;
}
patternFileName = System.getProperty("ample.patternfile", "patterns.ser");
}
public static int getCurrentThreadId() {
return System.identityHashCode(Thread.currentThread());
}
private static String getClassName(int classId) {
return classIdentifierMap.getClassName(classId);
}
private static String getMethodName(int methodId) {
if (methodId != METHODID_UNDEF) {
return methodIdentifierMap.getMethodIdentifier(methodId).toString();
} else {
return "UNDEFINED";
}
}
public static void staticMethodEnded(int methodId, int classId) {
synchronized (lock) {
Stack callStack = getOrCreateCallStackOfCurrentThread();
if (callStack.size() > 0) {
StackEntry entry = callStack.pop();
if (!entry.isStatic() || (entry.methodId != methodId)) {
throw new RuntimeException("Expected end of static method " + getMethodName(entry.methodId) +
" but found end of " + entry.objectId + "." +
getMethodName(methodId));
}
} else {
throw new RuntimeException("Empty stack at end of method " + getMethodName(methodId));
}
}
}
public static void staticMethodStarted(int methodId, int classId) {
synchronized (lock) {
getOrCreateCallStackOfCurrentThread().push(new StackEntry(methodId, classId, OBJECTID_STATIC));
}
}
public static void dynamicMethodEnded(int methodId, int classId, int objectId) {
synchronized (lock) {
Stack callStack = getOrCreateCallStackOfCurrentThread();
if (callStack.size() > 0) {
StackEntry entry = callStack.pop();
if ((entry.objectId != objectId) || (entry.methodId != methodId)) {
throw new RuntimeException("CallStack mismatch: Expected end of dynamic method " +
entry.objectId + "." + getMethodName(entry.methodId) +
" but got " + objectId + "." + getMethodName(methodId));
}
} else {
throw new RuntimeException("Empty call stack at end of method " + getMethodName(methodId));
}
}
}
public static void dynamicMethodStarted(int methodId, int classId, int objectId) {
synchronized (lock) {
Stack callStack = getOrCreateCallStackOfCurrentThread();
if (callStack.size() > 0) {
StackEntry entry = callStack.peek();
if (!entry.isStatic()) {
if (!ignoreInterClassCalls || (entry.objectId != objectId)) {
updateCallWindow(getOrCreateCallWindow(entry.classId, entry.objectId), entry.classId, methodId);
}
}
}
callStack.push(new StackEntry(methodId, classId, objectId));
}
}
protected static void updateCallWindow(LinkedList callWindow, int classId, int calledMethodId) {
synchronized (lock) {
if (callWindow.size() < (windowSize - 1)) {
callWindow.add(calledMethodId);
} else {
if (callWindow.size() == (windowSize)) {
callWindow.removeFirst();
}
callWindow.add(calledMethodId);
Integer[] calledMethods = callWindow.toArray(new Integer[callWindow.size()]);
int[] primitiveCalledMethods = new int[calledMethods.length];
for (int counter = 0; counter < primitiveCalledMethods.length; counter++) {
primitiveCalledMethods[counter] = calledMethods[counter];
}
Pattern pattern = new Pattern(primitiveCalledMethods);
HashMap patternSet = getOrCreatePatternSetForClass(classId);
Pattern storedPattern = patternSet.get(pattern);
if (storedPattern != null) {
storedPattern.increaseNumberOfOccurences();
} else {
patternSet.put(pattern, pattern);
}
}
}
}
protected static HashMap getOrCreatePatternSetForClass(int classId) {
HashMap result;
synchronized (lock) {
result = classIdToPatternSetMap.get(classId);
if (result == null) {
result = new HashMap();
classIdToPatternSetMap.put(classId, result);
}
return result;
}
}
protected static LinkedList getOrCreateCallWindow(int classId, int objectId) {
synchronized (lock) {
HashMap> objectIdToCallWindowMap = classIdToObjectWindowsMapMap.get(classId);
if (objectIdToCallWindowMap == null) {
objectIdToCallWindowMap = new HashMap>();
classIdToObjectWindowsMapMap.put(classId, objectIdToCallWindowMap);
}
LinkedList result = objectIdToCallWindowMap.get(objectId);
if (result == null) {
result = new LinkedList();
objectIdToCallWindowMap.put(objectId, result);
}
return result;
}
}
protected static Stack getOrCreateCallStackOfCurrentThread() {
synchronized (lock) {
int threadId = getCurrentThreadId();
Stack result = threadIdToCallStackMap.get(threadId);
if (result == null) {
result = new Stack();
threadIdToCallStackMap.put(threadId, result);
}
return result;
}
}
public static int getNextId() {
synchronized(lock) {
int result = idCounter;
idCounter++;
return result;
}
}
private static class Pattern {
private int[] calledMethods = null;
private int numberOfOccurences = 1;
private int hashValue = 0;
private boolean isHashCodeUpToDate = false;
public Pattern(int[] calledMethods) {
this.calledMethods = calledMethods;
}
private void updateHash(int value) {
int highorder = hashValue & 0xf8000000;
hashValue = hashValue << 5;
hashValue = hashValue ^ (highorder >> 27);
hashValue = hashValue ^ value;
}
public int hashCode() {
if (!isHashCodeUpToDate) {
for (int counter = 0; counter < calledMethods.length; counter++) {
updateHash(calledMethods[counter]);
}
isHashCodeUpToDate = true;
}
return hashValue;
}
public boolean equals(Object object) {
Pattern peer = (Pattern) object;
if (peer.calledMethods.length != calledMethods.length) {
return false;
} else {
for (int counter = 0; counter < calledMethods.length; counter++) {
if (calledMethods[counter] != peer.calledMethods[counter]) {
return false;
}
}
return true;
}
}
public void increaseNumberOfOccurences() {
numberOfOccurences++;
}
public int getNumberOfOccurences() {
return numberOfOccurences;
}
public String toString() {
StringBuffer result = new StringBuffer("#" + numberOfOccurences + " ");
for (int counter = 0; counter < calledMethods.length; counter++) {
result.append(calledMethods[counter]);
if (counter != calledMethods.length - 1) {
result.append(',');
}
}
return result.toString();
}
}
private static void writePatternSetMap(File file) throws IOException {
FileOutputStream fileOutputStream = null;
try {
fileOutputStream = new FileOutputStream(file);
BufferedOutputStream bufferedOutputStream = new BufferedOutputStream(fileOutputStream, 32768);
DataOutputStream dataOutputStream = new DataOutputStream(bufferedOutputStream);
dataOutputStream.writeInt(windowSize);
Iterator classIdIterator = classIdToPatternSetMap.keySet().iterator();
int numberOfApplicationClassesWithPatterns = 0;
while (classIdIterator.hasNext()) {
int classId = classIdIterator.next();
String className = getClassName(classId);
if (!filterBootstrapLoaderClasses || applicationClasses.contains(className)) {
numberOfApplicationClassesWithPatterns++;
}
}
dataOutputStream.writeInt(numberOfApplicationClassesWithPatterns);
classIdIterator = classIdToPatternSetMap.keySet().iterator();
while (classIdIterator.hasNext()) {
int classId = classIdIterator.next();
String className = getClassName(classId);
if (!filterBootstrapLoaderClasses || applicationClasses.contains(className)) {
dataOutputStream.writeUTF(getClassName(classId));
HashMap patterns = classIdToPatternSetMap.get(classId);
dataOutputStream.writeInt(patterns.size());
Iterator patternIterator = patterns.keySet().iterator();
while (patternIterator.hasNext()) {
Pattern pattern = patternIterator.next();
dataOutputStream.writeInt(pattern.numberOfOccurences);
for (int counter = 0; counter < pattern.calledMethods.length; counter++) {
dataOutputStream.writeUTF(getMethodName(pattern.calledMethods[counter]));
}
}
}
}
dataOutputStream.flush();
dataOutputStream.close();
} finally {
if (fileOutputStream != null) {
try {
fileOutputStream.close();
} catch (IOException finalizeException) {
//ignore exception
}
}
}
}
private static class StackEntry {
private int methodId;
private int classId;
private int objectId;
public StackEntry( int methodId, int classId, int objectId) {
this.classId = classId;
this.methodId = methodId;
this.objectId = objectId;
}
private boolean isStatic() {
return objectId == OBJECTID_STATIC;
}
public String toString() {
StringBuffer result = new StringBuffer();
result.append("Object #" + objectId + " " + getMethodName(methodId));
return result.toString();
}
}
public static class ShutdownThread implements Runnable {
public void run() {
try {
synchronized(lock) {
Iterator classIterator = classIdToObjectWindowsMapMap.keySet().iterator();
while (classIterator.hasNext()) {
int classId = classIterator.next();
HashMap> objectWindowsMap = classIdToObjectWindowsMapMap.get(classId);
Iterator objectIdIterator = objectWindowsMap.keySet().iterator();
while (objectIdIterator.hasNext()) {
int objectId = objectIdIterator.next();
LinkedList callSequence = objectWindowsMap.get(objectId);
if (callSequence.size() < windowSize) {
int numberOfElementsToAdd = windowSize - callSequence.size();
for (int counter = 0; counter < numberOfElementsToAdd; counter++) {
updateCallWindow(callSequence, classId, METHODID_UNDEF);
}
}
}
}
writePatternSetMap(new File(patternFileName));
}
} catch (Exception serializeException) {
System.out.println("An exception occured serializing:");
serializeException.printStackTrace(System.out);
}
}
}
}
ample-1.0/src/site/apt/faq.apt 100644 0 0 1512 10476037307 13401 0 ustar 0 0 ------
FAQ
------
FAQ
TODO - write this document
* The APT format
This document is written in APT:
APT stands for "Almost Plain Text". APT is a format thats takes the hassle
out of writing documentation by striving for simplicity. APT syntax
resembles plain-text more than it resembles markup languages such as HTML,
and the following document contains some examples of available APT
formatting. The following sections contain formatted text that demonstrates
the use of APT to create paragraphs, headers, sections, lists, code samples,
figures, tables, rules, breaks, and text level elements such as font styles,
anchors, and special characters.
** More about the APT format
{{{http://maven.apache.org/guides/mini/guide-apt-format.html}The APT format}}
on maven.apache.org.
ample-1.0/src/site/apt/howto.apt 100644 0 0 1520 10476037307 13771 0 ustar 0 0 ------
How-To
------
How-To
TODO - write this document
* The APT format
This document is written in APT:
APT stands for "Almost Plain Text". APT is a format thats takes the hassle
out of writing documentation by striving for simplicity. APT syntax
resembles plain-text more than it resembles markup languages such as HTML,
and the following document contains some examples of available APT
formatting. The following sections contain formatted text that demonstrates
the use of APT to create paragraphs, headers, sections, lists, code samples,
figures, tables, rules, breaks, and text level elements such as font styles,
anchors, and special characters.
** More about the APT format
{{{http://maven.apache.org/guides/mini/guide-apt-format.html}The APT format}}
on maven.apache.org.
ample-1.0/src/site/apt/tips.apt 100644 0 0 1514 10476037307 13613 0 ustar 0 0 ------
TIPS
------
TIPS
TODO - write this document
* The APT format
This document is written in APT:
APT stands for "Almost Plain Text". APT is a format thats takes the hassle
out of writing documentation by striving for simplicity. APT syntax
resembles plain-text more than it resembles markup languages such as HTML,
and the following document contains some examples of available APT
formatting. The following sections contain formatted text that demonstrates
the use of APT to create paragraphs, headers, sections, lists, code samples,
figures, tables, rules, breaks, and text level elements such as font styles,
anchors, and special characters.
** More about the APT format
{{{http://maven.apache.org/guides/mini/guide-apt-format.html}The APT format}}
on maven.apache.org.
ample-1.0/src/site/site.xml 100644 0 0 1357 10476037307 13035 0 ustar 0 0
CoolToolhttp://maven.apache.org/images/apache-maven-project.pnghttp://www.st.cs.uni-sb.de/http://maven.apache.org/images/maven-small.gif
${reports}
ample-1.0/src/test/java/de/unisb/cs/st/ample/test/CallInformation.java 100644 0 0 1006 10544675774 23052 0 ustar 0 0 package de.unisb.cs.st.ample.test;
public class CallInformation implements Comparable {
private int numberOfExecutions;
private int position;
public CallInformation(int position, int numberOfExecutions) {
this.position = position;
this.numberOfExecutions = numberOfExecutions;
}
public int getNumberOfExecutions() {
return numberOfExecutions;
}
public int getPosition() {
return position;
}
public int compareTo(Object object) {
return ((CallInformation) object).position - position;
}
}
ample-1.0/src/test/java/de/unisb/cs/st/ample/test/ClassesGenerator.java 100644 0 0 14326 10550703156 23245 0 ustar 0 0 package de.unisb.cs.st.ample.test;
import java.io.File;
import java.io.IOException;
import java.util.Collections;
import java.util.Comparator;
import java.util.Hashtable;
import java.util.Vector;
import org.apache.commons.io.FileUtils;
import org.softevo.util.datastructures.Graph;
import org.softevo.util.datastructures.GraphEdge;
import org.softevo.util.datastructures.GraphNode;
public class ClassesGenerator {
private Graph callGraph = null;
private Hashtable classNameToInformationMap;
private File targetDirectory;
private String packageName = "generated";
public ClassesGenerator(Graph callGraph,
Hashtable classNameToInformationMap,
File targetDirectory) {
this.callGraph = callGraph;
this.classNameToInformationMap = classNameToInformationMap;
this.targetDirectory = targetDirectory;
}
public void generateClasses() throws IOException {
System.out.println("Cleaning target directory " + targetDirectory);
FileUtils.cleanDirectory(targetDirectory);
File packageDirectory = new File(targetDirectory + File.separator + packageName);
packageDirectory.mkdirs();
for (String className : classNameToInformationMap.keySet()) {
String javaClass;
if (!className.equals("Main")) {
javaClass = generateClass(classNameToInformationMap.get(className));
} else {
MethodInformation methodInformation = new MethodInformation("Main", null, "main");
GraphNode graphNode = callGraph.getNodeForData(methodInformation);
javaClass = generateMainClass(graphNode);
}
File targetFile = new File(packageDirectory + File.separator + className + ".java");
FileUtils.writeStringToFile(targetFile, javaClass, "ISO-8859-1");
}
}
public static String getCounterIdentifier(String methodIdentifier, String objectIdentifier, int position) {
return "counter_" + methodIdentifier + "_" + objectIdentifier + "_" + position;
}
public Vector> sortEdges(Vector> edges) {
Vector> result = new Vector>(edges);
Collections.sort(result, new Comparator>() {
public int compare(GraphEdge first, GraphEdge second) {
return first.getData().compareTo(second.getData());
}
});
return result;
}
protected String generateClass(ClassInformation classInformation) {
StringBuffer result = new StringBuffer("package " + packageName + ";\n\n");
result.append("public class " + classInformation.getClassName() + " {\n\n");
for (String objectIdentifier : classInformation.getObjectIdentifiers()) {
result.append("\tpublic static " + classInformation.getClassName() + " " +
objectIdentifier + " = new " + classInformation.getClassName() + "(\"" +
objectIdentifier + "\");\n\n");
}
for (String objectIdentifier : classInformation.getObjectIdentifiers()) {
for (String methodIdentifier : classInformation.getMethodIdentifiers()) {
MethodInformation methodInformation = new MethodInformation(classInformation.getClassName(), objectIdentifier, methodIdentifier);
GraphNode graphNode = callGraph.getNodeForData(methodInformation);
for (GraphEdge edge : graphNode.getOutgoingEdges()) {
result.append("\tprivate static int " + getCounterIdentifier(methodIdentifier, objectIdentifier, edge.getData().getPosition()) +
" = " + edge.getData().getNumberOfExecutions() + ";\n\n");
}
}
}
result.append("\tprivate String objectIdentifier = null;\n\n");
result.append("\tpublic " + classInformation.getClassName() + "(String objectIdentifier) {\n");
result.append("\t\tthis.objectIdentifier = objectIdentifier;\n");
result.append("\t}\n\n");
for (String methodIdentifier : classInformation.getMethodIdentifiers()) {
result.append("\tpublic void " + methodIdentifier + "() {\n");
for (String objectIdentifier : classInformation.getObjectIdentifiers()) {
MethodInformation methodInformation = new MethodInformation(classInformation.getClassName(), objectIdentifier, methodIdentifier);
GraphNode graphNode = callGraph.getNodeForData(methodInformation);
result.append("\t\tif (objectIdentifier.equals(\"" + objectIdentifier + "\") {\n");
Vector> sortedEdges = sortEdges(graphNode.getOutgoingEdges());
for (GraphEdge edge : sortedEdges) {
GraphNode targetNode = edge.getEndNode();
MethodInformation targetMethod = targetNode.getData();
String counterIdentifier = getCounterIdentifier(methodIdentifier, objectIdentifier, edge.getData().getPosition());
result.append("\t\t\tif (" + counterIdentifier + " > 0) {\n");
result.append("\t\t\t\t" + counterIdentifier + "--;\n");
result.append("\t\t\t\t" + targetMethod.getClassName() + "." + targetMethod.getObjectIdentifier() + "." + targetMethod.getMethodIdentifier() + "();\n");
result.append("\t\t\t}\n");
}
result.append("\t\t}\n");
}
result.append("\t}\n\n");
}
result.append("}\n");
return result.toString();
}
protected String generateMainClass(GraphNode mainNode) {
StringBuffer result = new StringBuffer("package " + packageName + ";\n\n");
result.append("public class Main {\n\n");
result.append("\tpublic static void main(String[] args) {\n");
Vector> sortedEdges = sortEdges(mainNode.getOutgoingEdges());
for (GraphEdge edge : sortedEdges) {
MethodInformation targetInformation = (MethodInformation) edge.getEndNode().getData();
result.append("\t\tfor (int counter = 0; counter < " + edge.getData().getNumberOfExecutions() + "; counter++) {\n");
result.append("\t\t\t" + targetInformation.getClassName() + "." + targetInformation.getClassName() + "." + targetInformation.getMethodIdentifier() + "();\n");
result.append("\t\t}\n");
}
result.append("\t}\n");
result.append("}\n");
return result.toString();
}
}
ample-1.0/src/test/java/de/unisb/cs/st/ample/test/ClassInformation.java 100644 0 0 2002 10544674114 23224 0 ustar 0 0 package de.unisb.cs.st.ample.test;
import java.util.HashSet;
public class ClassInformation {
private HashSet objectIdentifiers;
private HashSet methodIdentifiers;
private String className;
public ClassInformation(String className) {
super();
this.objectIdentifiers = new HashSet();
this.methodIdentifiers = new HashSet();
this.className = className;
}
public HashSet getMethodIdentifiers() {
return methodIdentifiers;
}
public HashSet getObjectIdentifiers() {
return objectIdentifiers;
}
public void addMethodIdentifier(String methodIdentifier) {
this.methodIdentifiers.add(methodIdentifier);
}
public void addObjectIdentifier(String objectIdentifier) {
this.objectIdentifiers.add(objectIdentifier);
}
public String getClassName() {
return className;
}
public int hashCode() {
return className.hashCode();
}
public boolean equals(Object object) {
return ((ClassInformation) object).className.equals(className);
}
}
ample-1.0/src/test/java/de/unisb/cs/st/ample/test/MethodInformation.java 100644 0 0 1625 10544675062 23414 0 ustar 0 0 package de.unisb.cs.st.ample.test;
public class MethodInformation {
private String className;
private String objectIdentifier;
private String methodIdentifier;
public MethodInformation(String className, String objectIdentifier, String methodIdentifier) {
super();
this.className = className;
this.objectIdentifier = objectIdentifier;
this.methodIdentifier = methodIdentifier;
}
public String getClassName() {
return className;
}
public String getMethodIdentifier() {
return methodIdentifier;
}
public String getObjectIdentifier() {
return objectIdentifier;
}
public int hashCode() {
return (className + methodIdentifier + objectIdentifier).hashCode();
}
public boolean equals(Object object) {
return ((MethodInformation) object).toString().equals(toString());
}
public String toString() {
return objectIdentifier + "#" + className + "." + methodIdentifier;
}
}
ample-1.0/src/test/java/de/unisb/cs/st/ample/test/RandomCallGraphGenerator.java 100644 0 0 12340 10550703155 24637 0 ustar 0 0 package de.unisb.cs.st.ample.test;
import java.io.File;
import java.util.HashSet;
import java.util.Hashtable;
import org.softevo.util.datastructures.Graph;
import org.softevo.util.datastructures.GraphNode;
public class RandomCallGraphGenerator {
private double methodCallDensity;
private int numberOfObjectsPerClass;
private int numberOfMethodsPerClass;
private int numberOfClasses;
private int meanNumberOfCallExecutions;
private Hashtable classNameToInformationMap;
private Graph callGraph;
public RandomCallGraphGenerator(int numberOfClasses, int numberOfMethodsPerClass,
int numberOfObjectsPerClass, double methodCallDensity,
int meanNumberOfCallExecutions) {
this.numberOfClasses = numberOfClasses;
this.numberOfMethodsPerClass = numberOfMethodsPerClass;
this.numberOfObjectsPerClass = numberOfObjectsPerClass;
this.methodCallDensity = methodCallDensity;
this.meanNumberOfCallExecutions = meanNumberOfCallExecutions;
}
private int getRandomValue(int baseValue) {
return ((int) ((double) baseValue * (Math.random() * 0.4d + 0.8d)));
}
private Hashtable generateClassNameToInformationMap() {
Hashtable result = new Hashtable();
int numberOfClasses = getRandomValue(this.numberOfClasses);
for (int counter = 0; counter < numberOfClasses; counter++) {
String className = "GeneratedClass" + counter;
int numberOfObjects = getRandomValue(this.numberOfObjectsPerClass);
ClassInformation classInformation = new ClassInformation(className);
for (int counter2 = 0; counter2 < numberOfObjects; counter2++) {
classInformation.addObjectIdentifier("object" + counter2);
}
int numberOfMethods = getRandomValue(this.numberOfMethodsPerClass);
for (int counter2 = 0; counter2 < numberOfMethods; counter2++) {
classInformation.addMethodIdentifier("method" + counter2);
}
result.put(className, classInformation);
}
return result;
}
private Graph generateCallGraph(Hashtable classNameToInformationMap) {
Graph result = new Graph();
for (String className : classNameToInformationMap.keySet()) {
ClassInformation classInformation = classNameToInformationMap.get(className);
for (String objectIdentifier : classInformation.getObjectIdentifiers()) {
for (String methodIdentifier : classInformation.getMethodIdentifiers()) {
result.createNode(new MethodInformation(className, objectIdentifier, methodIdentifier));
}
}
}
for (String className : classNameToInformationMap.keySet()) {
ClassInformation classInformation = classNameToInformationMap.get(className);
for (String objectIdentifier : classInformation.getObjectIdentifiers()) {
for (String methodIdentifier : classInformation.getMethodIdentifiers()) {
MethodInformation methodInformation = new MethodInformation(className, objectIdentifier, methodIdentifier);
GraphNode startNode = result.getNodeForData(methodInformation);
int counter = 0;
for (GraphNode graphNode : result.getNodes()) {
if (Math.random() < methodCallDensity) {
int numberOfCallExecutions = getRandomValue(meanNumberOfCallExecutions);
result.createEdge(new CallInformation(counter, numberOfCallExecutions), startNode, graphNode);
counter++;
}
}
}
}
}
MethodInformation mainMethodInformation = new MethodInformation("Main", null, "main");
GraphNode mainNode = result.createNode(mainMethodInformation);
HashSet visitedClassesList = new HashSet();
int counter = 0;
for (GraphNode graphNode : result.getNodes()) {
if (!visitedClassesList.contains(graphNode.getData().getClassName())) {
visitedClassesList.add(graphNode.getData().getClassName());
int numberOfExecutions = getRandomValue(meanNumberOfCallExecutions);
result.createEdge(new CallInformation(counter, numberOfExecutions), mainNode, graphNode);
counter++;
}
}
ClassInformation mainClassInformation = new ClassInformation("Main");
classNameToInformationMap.put("Main", mainClassInformation);
return result;
}
public void generateCallGraph() {
classNameToInformationMap = generateClassNameToInformationMap();
callGraph = generateCallGraph(classNameToInformationMap);
}
public Graph getCallGraph() {
return callGraph;
}
public Hashtable getClassNameToInformationMap() {
return classNameToInformationMap;
}
public static void main(String[] args) throws Exception {
RandomCallGraphGenerator generator = new RandomCallGraphGenerator(5, 2, 3, 0.5, 5);
generator.generateCallGraph();
ClassesGenerator classGenerator = new ClassesGenerator(generator.getCallGraph(), generator.getClassNameToInformationMap(),
new File("/Users/dallmeier/tmp/testclasses"));
classGenerator.generateClasses();
}
}