Compare commits
28 Commits
24 changed files with 1638 additions and 99 deletions
@ -0,0 +1,674 @@ |
|||||||
|
GNU GENERAL PUBLIC LICENSE |
||||||
|
Version 3, 29 June 2007 |
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> |
||||||
|
Everyone is permitted to copy and distribute verbatim copies |
||||||
|
of this license document, but changing it is not allowed. |
||||||
|
|
||||||
|
Preamble |
||||||
|
|
||||||
|
The GNU General Public License is a free, copyleft license for |
||||||
|
software and other kinds of works. |
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed |
||||||
|
to take away your freedom to share and change the works. By contrast, |
||||||
|
the GNU General Public License is intended to guarantee your freedom to |
||||||
|
share and change all versions of a program--to make sure it remains free |
||||||
|
software for all its users. We, the Free Software Foundation, use the |
||||||
|
GNU General Public License for most of our software; it applies also to |
||||||
|
any other work released this way by its authors. You can apply it to |
||||||
|
your programs, too. |
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not |
||||||
|
price. Our General Public Licenses are designed to make sure that you |
||||||
|
have the freedom to distribute copies of free software (and charge for |
||||||
|
them if you wish), that you receive source code or can get it if you |
||||||
|
want it, that you can change the software or use pieces of it in new |
||||||
|
free programs, and that you know you can do these things. |
||||||
|
|
||||||
|
To protect your rights, we need to prevent others from denying you |
||||||
|
these rights or asking you to surrender the rights. Therefore, you have |
||||||
|
certain responsibilities if you distribute copies of the software, or if |
||||||
|
you modify it: responsibilities to respect the freedom of others. |
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether |
||||||
|
gratis or for a fee, you must pass on to the recipients the same |
||||||
|
freedoms that you received. You must make sure that they, too, receive |
||||||
|
or can get the source code. And you must show them these terms so they |
||||||
|
know their rights. |
||||||
|
|
||||||
|
Developers that use the GNU GPL protect your rights with two steps: |
||||||
|
(1) assert copyright on the software, and (2) offer you this License |
||||||
|
giving you legal permission to copy, distribute and/or modify it. |
||||||
|
|
||||||
|
For the developers' and authors' protection, the GPL clearly explains |
||||||
|
that there is no warranty for this free software. For both users' and |
||||||
|
authors' sake, the GPL requires that modified versions be marked as |
||||||
|
changed, so that their problems will not be attributed erroneously to |
||||||
|
authors of previous versions. |
||||||
|
|
||||||
|
Some devices are designed to deny users access to install or run |
||||||
|
modified versions of the software inside them, although the manufacturer |
||||||
|
can do so. This is fundamentally incompatible with the aim of |
||||||
|
protecting users' freedom to change the software. The systematic |
||||||
|
pattern of such abuse occurs in the area of products for individuals to |
||||||
|
use, which is precisely where it is most unacceptable. Therefore, we |
||||||
|
have designed this version of the GPL to prohibit the practice for those |
||||||
|
products. If such problems arise substantially in other domains, we |
||||||
|
stand ready to extend this provision to those domains in future versions |
||||||
|
of the GPL, as needed to protect the freedom of users. |
||||||
|
|
||||||
|
Finally, every program is threatened constantly by software patents. |
||||||
|
States should not allow patents to restrict development and use of |
||||||
|
software on general-purpose computers, but in those that do, we wish to |
||||||
|
avoid the special danger that patents applied to a free program could |
||||||
|
make it effectively proprietary. To prevent this, the GPL assures that |
||||||
|
patents cannot be used to render the program non-free. |
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and |
||||||
|
modification follow. |
||||||
|
|
||||||
|
TERMS AND CONDITIONS |
||||||
|
|
||||||
|
0. Definitions. |
||||||
|
|
||||||
|
"This License" refers to version 3 of the GNU General Public License. |
||||||
|
|
||||||
|
"Copyright" also means copyright-like laws that apply to other kinds of |
||||||
|
works, such as semiconductor masks. |
||||||
|
|
||||||
|
"The Program" refers to any copyrightable work licensed under this |
||||||
|
License. Each licensee is addressed as "you". "Licensees" and |
||||||
|
"recipients" may be individuals or organizations. |
||||||
|
|
||||||
|
To "modify" a work means to copy from or adapt all or part of the work |
||||||
|
in a fashion requiring copyright permission, other than the making of an |
||||||
|
exact copy. The resulting work is called a "modified version" of the |
||||||
|
earlier work or a work "based on" the earlier work. |
||||||
|
|
||||||
|
A "covered work" means either the unmodified Program or a work based |
||||||
|
on the Program. |
||||||
|
|
||||||
|
To "propagate" a work means to do anything with it that, without |
||||||
|
permission, would make you directly or secondarily liable for |
||||||
|
infringement under applicable copyright law, except executing it on a |
||||||
|
computer or modifying a private copy. Propagation includes copying, |
||||||
|
distribution (with or without modification), making available to the |
||||||
|
public, and in some countries other activities as well. |
||||||
|
|
||||||
|
To "convey" a work means any kind of propagation that enables other |
||||||
|
parties to make or receive copies. Mere interaction with a user through |
||||||
|
a computer network, with no transfer of a copy, is not conveying. |
||||||
|
|
||||||
|
An interactive user interface displays "Appropriate Legal Notices" |
||||||
|
to the extent that it includes a convenient and prominently visible |
||||||
|
feature that (1) displays an appropriate copyright notice, and (2) |
||||||
|
tells the user that there is no warranty for the work (except to the |
||||||
|
extent that warranties are provided), that licensees may convey the |
||||||
|
work under this License, and how to view a copy of this License. If |
||||||
|
the interface presents a list of user commands or options, such as a |
||||||
|
menu, a prominent item in the list meets this criterion. |
||||||
|
|
||||||
|
1. Source Code. |
||||||
|
|
||||||
|
The "source code" for a work means the preferred form of the work |
||||||
|
for making modifications to it. "Object code" means any non-source |
||||||
|
form of a work. |
||||||
|
|
||||||
|
A "Standard Interface" means an interface that either is an official |
||||||
|
standard defined by a recognized standards body, or, in the case of |
||||||
|
interfaces specified for a particular programming language, one that |
||||||
|
is widely used among developers working in that language. |
||||||
|
|
||||||
|
The "System Libraries" of an executable work include anything, other |
||||||
|
than the work as a whole, that (a) is included in the normal form of |
||||||
|
packaging a Major Component, but which is not part of that Major |
||||||
|
Component, and (b) serves only to enable use of the work with that |
||||||
|
Major Component, or to implement a Standard Interface for which an |
||||||
|
implementation is available to the public in source code form. A |
||||||
|
"Major Component", in this context, means a major essential component |
||||||
|
(kernel, window system, and so on) of the specific operating system |
||||||
|
(if any) on which the executable work runs, or a compiler used to |
||||||
|
produce the work, or an object code interpreter used to run it. |
||||||
|
|
||||||
|
The "Corresponding Source" for a work in object code form means all |
||||||
|
the source code needed to generate, install, and (for an executable |
||||||
|
work) run the object code and to modify the work, including scripts to |
||||||
|
control those activities. However, it does not include the work's |
||||||
|
System Libraries, or general-purpose tools or generally available free |
||||||
|
programs which are used unmodified in performing those activities but |
||||||
|
which are not part of the work. For example, Corresponding Source |
||||||
|
includes interface definition files associated with source files for |
||||||
|
the work, and the source code for shared libraries and dynamically |
||||||
|
linked subprograms that the work is specifically designed to require, |
||||||
|
such as by intimate data communication or control flow between those |
||||||
|
subprograms and other parts of the work. |
||||||
|
|
||||||
|
The Corresponding Source need not include anything that users |
||||||
|
can regenerate automatically from other parts of the Corresponding |
||||||
|
Source. |
||||||
|
|
||||||
|
The Corresponding Source for a work in source code form is that |
||||||
|
same work. |
||||||
|
|
||||||
|
2. Basic Permissions. |
||||||
|
|
||||||
|
All rights granted under this License are granted for the term of |
||||||
|
copyright on the Program, and are irrevocable provided the stated |
||||||
|
conditions are met. This License explicitly affirms your unlimited |
||||||
|
permission to run the unmodified Program. The output from running a |
||||||
|
covered work is covered by this License only if the output, given its |
||||||
|
content, constitutes a covered work. This License acknowledges your |
||||||
|
rights of fair use or other equivalent, as provided by copyright law. |
||||||
|
|
||||||
|
You may make, run and propagate covered works that you do not |
||||||
|
convey, without conditions so long as your license otherwise remains |
||||||
|
in force. You may convey covered works to others for the sole purpose |
||||||
|
of having them make modifications exclusively for you, or provide you |
||||||
|
with facilities for running those works, provided that you comply with |
||||||
|
the terms of this License in conveying all material for which you do |
||||||
|
not control copyright. Those thus making or running the covered works |
||||||
|
for you must do so exclusively on your behalf, under your direction |
||||||
|
and control, on terms that prohibit them from making any copies of |
||||||
|
your copyrighted material outside their relationship with you. |
||||||
|
|
||||||
|
Conveying under any other circumstances is permitted solely under |
||||||
|
the conditions stated below. Sublicensing is not allowed; section 10 |
||||||
|
makes it unnecessary. |
||||||
|
|
||||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
||||||
|
|
||||||
|
No covered work shall be deemed part of an effective technological |
||||||
|
measure under any applicable law fulfilling obligations under article |
||||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
||||||
|
similar laws prohibiting or restricting circumvention of such |
||||||
|
measures. |
||||||
|
|
||||||
|
When you convey a covered work, you waive any legal power to forbid |
||||||
|
circumvention of technological measures to the extent such circumvention |
||||||
|
is effected by exercising rights under this License with respect to |
||||||
|
the covered work, and you disclaim any intention to limit operation or |
||||||
|
modification of the work as a means of enforcing, against the work's |
||||||
|
users, your or third parties' legal rights to forbid circumvention of |
||||||
|
technological measures. |
||||||
|
|
||||||
|
4. Conveying Verbatim Copies. |
||||||
|
|
||||||
|
You may convey verbatim copies of the Program's source code as you |
||||||
|
receive it, in any medium, provided that you conspicuously and |
||||||
|
appropriately publish on each copy an appropriate copyright notice; |
||||||
|
keep intact all notices stating that this License and any |
||||||
|
non-permissive terms added in accord with section 7 apply to the code; |
||||||
|
keep intact all notices of the absence of any warranty; and give all |
||||||
|
recipients a copy of this License along with the Program. |
||||||
|
|
||||||
|
You may charge any price or no price for each copy that you convey, |
||||||
|
and you may offer support or warranty protection for a fee. |
||||||
|
|
||||||
|
5. Conveying Modified Source Versions. |
||||||
|
|
||||||
|
You may convey a work based on the Program, or the modifications to |
||||||
|
produce it from the Program, in the form of source code under the |
||||||
|
terms of section 4, provided that you also meet all of these conditions: |
||||||
|
|
||||||
|
a) The work must carry prominent notices stating that you modified |
||||||
|
it, and giving a relevant date. |
||||||
|
|
||||||
|
b) The work must carry prominent notices stating that it is |
||||||
|
released under this License and any conditions added under section |
||||||
|
7. This requirement modifies the requirement in section 4 to |
||||||
|
"keep intact all notices". |
||||||
|
|
||||||
|
c) You must license the entire work, as a whole, under this |
||||||
|
License to anyone who comes into possession of a copy. This |
||||||
|
License will therefore apply, along with any applicable section 7 |
||||||
|
additional terms, to the whole of the work, and all its parts, |
||||||
|
regardless of how they are packaged. This License gives no |
||||||
|
permission to license the work in any other way, but it does not |
||||||
|
invalidate such permission if you have separately received it. |
||||||
|
|
||||||
|
d) If the work has interactive user interfaces, each must display |
||||||
|
Appropriate Legal Notices; however, if the Program has interactive |
||||||
|
interfaces that do not display Appropriate Legal Notices, your |
||||||
|
work need not make them do so. |
||||||
|
|
||||||
|
A compilation of a covered work with other separate and independent |
||||||
|
works, which are not by their nature extensions of the covered work, |
||||||
|
and which are not combined with it such as to form a larger program, |
||||||
|
in or on a volume of a storage or distribution medium, is called an |
||||||
|
"aggregate" if the compilation and its resulting copyright are not |
||||||
|
used to limit the access or legal rights of the compilation's users |
||||||
|
beyond what the individual works permit. Inclusion of a covered work |
||||||
|
in an aggregate does not cause this License to apply to the other |
||||||
|
parts of the aggregate. |
||||||
|
|
||||||
|
6. Conveying Non-Source Forms. |
||||||
|
|
||||||
|
You may convey a covered work in object code form under the terms |
||||||
|
of sections 4 and 5, provided that you also convey the |
||||||
|
machine-readable Corresponding Source under the terms of this License, |
||||||
|
in one of these ways: |
||||||
|
|
||||||
|
a) Convey the object code in, or embodied in, a physical product |
||||||
|
(including a physical distribution medium), accompanied by the |
||||||
|
Corresponding Source fixed on a durable physical medium |
||||||
|
customarily used for software interchange. |
||||||
|
|
||||||
|
b) Convey the object code in, or embodied in, a physical product |
||||||
|
(including a physical distribution medium), accompanied by a |
||||||
|
written offer, valid for at least three years and valid for as |
||||||
|
long as you offer spare parts or customer support for that product |
||||||
|
model, to give anyone who possesses the object code either (1) a |
||||||
|
copy of the Corresponding Source for all the software in the |
||||||
|
product that is covered by this License, on a durable physical |
||||||
|
medium customarily used for software interchange, for a price no |
||||||
|
more than your reasonable cost of physically performing this |
||||||
|
conveying of source, or (2) access to copy the |
||||||
|
Corresponding Source from a network server at no charge. |
||||||
|
|
||||||
|
c) Convey individual copies of the object code with a copy of the |
||||||
|
written offer to provide the Corresponding Source. This |
||||||
|
alternative is allowed only occasionally and noncommercially, and |
||||||
|
only if you received the object code with such an offer, in accord |
||||||
|
with subsection 6b. |
||||||
|
|
||||||
|
d) Convey the object code by offering access from a designated |
||||||
|
place (gratis or for a charge), and offer equivalent access to the |
||||||
|
Corresponding Source in the same way through the same place at no |
||||||
|
further charge. You need not require recipients to copy the |
||||||
|
Corresponding Source along with the object code. If the place to |
||||||
|
copy the object code is a network server, the Corresponding Source |
||||||
|
may be on a different server (operated by you or a third party) |
||||||
|
that supports equivalent copying facilities, provided you maintain |
||||||
|
clear directions next to the object code saying where to find the |
||||||
|
Corresponding Source. Regardless of what server hosts the |
||||||
|
Corresponding Source, you remain obligated to ensure that it is |
||||||
|
available for as long as needed to satisfy these requirements. |
||||||
|
|
||||||
|
e) Convey the object code using peer-to-peer transmission, provided |
||||||
|
you inform other peers where the object code and Corresponding |
||||||
|
Source of the work are being offered to the general public at no |
||||||
|
charge under subsection 6d. |
||||||
|
|
||||||
|
A separable portion of the object code, whose source code is excluded |
||||||
|
from the Corresponding Source as a System Library, need not be |
||||||
|
included in conveying the object code work. |
||||||
|
|
||||||
|
A "User Product" is either (1) a "consumer product", which means any |
||||||
|
tangible personal property which is normally used for personal, family, |
||||||
|
or household purposes, or (2) anything designed or sold for incorporation |
||||||
|
into a dwelling. In determining whether a product is a consumer product, |
||||||
|
doubtful cases shall be resolved in favor of coverage. For a particular |
||||||
|
product received by a particular user, "normally used" refers to a |
||||||
|
typical or common use of that class of product, regardless of the status |
||||||
|
of the particular user or of the way in which the particular user |
||||||
|
actually uses, or expects or is expected to use, the product. A product |
||||||
|
is a consumer product regardless of whether the product has substantial |
||||||
|
commercial, industrial or non-consumer uses, unless such uses represent |
||||||
|
the only significant mode of use of the product. |
||||||
|
|
||||||
|
"Installation Information" for a User Product means any methods, |
||||||
|
procedures, authorization keys, or other information required to install |
||||||
|
and execute modified versions of a covered work in that User Product from |
||||||
|
a modified version of its Corresponding Source. The information must |
||||||
|
suffice to ensure that the continued functioning of the modified object |
||||||
|
code is in no case prevented or interfered with solely because |
||||||
|
modification has been made. |
||||||
|
|
||||||
|
If you convey an object code work under this section in, or with, or |
||||||
|
specifically for use in, a User Product, and the conveying occurs as |
||||||
|
part of a transaction in which the right of possession and use of the |
||||||
|
User Product is transferred to the recipient in perpetuity or for a |
||||||
|
fixed term (regardless of how the transaction is characterized), the |
||||||
|
Corresponding Source conveyed under this section must be accompanied |
||||||
|
by the Installation Information. But this requirement does not apply |
||||||
|
if neither you nor any third party retains the ability to install |
||||||
|
modified object code on the User Product (for example, the work has |
||||||
|
been installed in ROM). |
||||||
|
|
||||||
|
The requirement to provide Installation Information does not include a |
||||||
|
requirement to continue to provide support service, warranty, or updates |
||||||
|
for a work that has been modified or installed by the recipient, or for |
||||||
|
the User Product in which it has been modified or installed. Access to a |
||||||
|
network may be denied when the modification itself materially and |
||||||
|
adversely affects the operation of the network or violates the rules and |
||||||
|
protocols for communication across the network. |
||||||
|
|
||||||
|
Corresponding Source conveyed, and Installation Information provided, |
||||||
|
in accord with this section must be in a format that is publicly |
||||||
|
documented (and with an implementation available to the public in |
||||||
|
source code form), and must require no special password or key for |
||||||
|
unpacking, reading or copying. |
||||||
|
|
||||||
|
7. Additional Terms. |
||||||
|
|
||||||
|
"Additional permissions" are terms that supplement the terms of this |
||||||
|
License by making exceptions from one or more of its conditions. |
||||||
|
Additional permissions that are applicable to the entire Program shall |
||||||
|
be treated as though they were included in this License, to the extent |
||||||
|
that they are valid under applicable law. If additional permissions |
||||||
|
apply only to part of the Program, that part may be used separately |
||||||
|
under those permissions, but the entire Program remains governed by |
||||||
|
this License without regard to the additional permissions. |
||||||
|
|
||||||
|
When you convey a copy of a covered work, you may at your option |
||||||
|
remove any additional permissions from that copy, or from any part of |
||||||
|
it. (Additional permissions may be written to require their own |
||||||
|
removal in certain cases when you modify the work.) You may place |
||||||
|
additional permissions on material, added by you to a covered work, |
||||||
|
for which you have or can give appropriate copyright permission. |
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, for material you |
||||||
|
add to a covered work, you may (if authorized by the copyright holders of |
||||||
|
that material) supplement the terms of this License with terms: |
||||||
|
|
||||||
|
a) Disclaiming warranty or limiting liability differently from the |
||||||
|
terms of sections 15 and 16 of this License; or |
||||||
|
|
||||||
|
b) Requiring preservation of specified reasonable legal notices or |
||||||
|
author attributions in that material or in the Appropriate Legal |
||||||
|
Notices displayed by works containing it; or |
||||||
|
|
||||||
|
c) Prohibiting misrepresentation of the origin of that material, or |
||||||
|
requiring that modified versions of such material be marked in |
||||||
|
reasonable ways as different from the original version; or |
||||||
|
|
||||||
|
d) Limiting the use for publicity purposes of names of licensors or |
||||||
|
authors of the material; or |
||||||
|
|
||||||
|
e) Declining to grant rights under trademark law for use of some |
||||||
|
trade names, trademarks, or service marks; or |
||||||
|
|
||||||
|
f) Requiring indemnification of licensors and authors of that |
||||||
|
material by anyone who conveys the material (or modified versions of |
||||||
|
it) with contractual assumptions of liability to the recipient, for |
||||||
|
any liability that these contractual assumptions directly impose on |
||||||
|
those licensors and authors. |
||||||
|
|
||||||
|
All other non-permissive additional terms are considered "further |
||||||
|
restrictions" within the meaning of section 10. If the Program as you |
||||||
|
received it, or any part of it, contains a notice stating that it is |
||||||
|
governed by this License along with a term that is a further |
||||||
|
restriction, you may remove that term. If a license document contains |
||||||
|
a further restriction but permits relicensing or conveying under this |
||||||
|
License, you may add to a covered work material governed by the terms |
||||||
|
of that license document, provided that the further restriction does |
||||||
|
not survive such relicensing or conveying. |
||||||
|
|
||||||
|
If you add terms to a covered work in accord with this section, you |
||||||
|
must place, in the relevant source files, a statement of the |
||||||
|
additional terms that apply to those files, or a notice indicating |
||||||
|
where to find the applicable terms. |
||||||
|
|
||||||
|
Additional terms, permissive or non-permissive, may be stated in the |
||||||
|
form of a separately written license, or stated as exceptions; |
||||||
|
the above requirements apply either way. |
||||||
|
|
||||||
|
8. Termination. |
||||||
|
|
||||||
|
You may not propagate or modify a covered work except as expressly |
||||||
|
provided under this License. Any attempt otherwise to propagate or |
||||||
|
modify it is void, and will automatically terminate your rights under |
||||||
|
this License (including any patent licenses granted under the third |
||||||
|
paragraph of section 11). |
||||||
|
|
||||||
|
However, if you cease all violation of this License, then your |
||||||
|
license from a particular copyright holder is reinstated (a) |
||||||
|
provisionally, unless and until the copyright holder explicitly and |
||||||
|
finally terminates your license, and (b) permanently, if the copyright |
||||||
|
holder fails to notify you of the violation by some reasonable means |
||||||
|
prior to 60 days after the cessation. |
||||||
|
|
||||||
|
Moreover, your license from a particular copyright holder is |
||||||
|
reinstated permanently if the copyright holder notifies you of the |
||||||
|
violation by some reasonable means, this is the first time you have |
||||||
|
received notice of violation of this License (for any work) from that |
||||||
|
copyright holder, and you cure the violation prior to 30 days after |
||||||
|
your receipt of the notice. |
||||||
|
|
||||||
|
Termination of your rights under this section does not terminate the |
||||||
|
licenses of parties who have received copies or rights from you under |
||||||
|
this License. If your rights have been terminated and not permanently |
||||||
|
reinstated, you do not qualify to receive new licenses for the same |
||||||
|
material under section 10. |
||||||
|
|
||||||
|
9. Acceptance Not Required for Having Copies. |
||||||
|
|
||||||
|
You are not required to accept this License in order to receive or |
||||||
|
run a copy of the Program. Ancillary propagation of a covered work |
||||||
|
occurring solely as a consequence of using peer-to-peer transmission |
||||||
|
to receive a copy likewise does not require acceptance. However, |
||||||
|
nothing other than this License grants you permission to propagate or |
||||||
|
modify any covered work. These actions infringe copyright if you do |
||||||
|
not accept this License. Therefore, by modifying or propagating a |
||||||
|
covered work, you indicate your acceptance of this License to do so. |
||||||
|
|
||||||
|
10. Automatic Licensing of Downstream Recipients. |
||||||
|
|
||||||
|
Each time you convey a covered work, the recipient automatically |
||||||
|
receives a license from the original licensors, to run, modify and |
||||||
|
propagate that work, subject to this License. You are not responsible |
||||||
|
for enforcing compliance by third parties with this License. |
||||||
|
|
||||||
|
An "entity transaction" is a transaction transferring control of an |
||||||
|
organization, or substantially all assets of one, or subdividing an |
||||||
|
organization, or merging organizations. If propagation of a covered |
||||||
|
work results from an entity transaction, each party to that |
||||||
|
transaction who receives a copy of the work also receives whatever |
||||||
|
licenses to the work the party's predecessor in interest had or could |
||||||
|
give under the previous paragraph, plus a right to possession of the |
||||||
|
Corresponding Source of the work from the predecessor in interest, if |
||||||
|
the predecessor has it or can get it with reasonable efforts. |
||||||
|
|
||||||
|
You may not impose any further restrictions on the exercise of the |
||||||
|
rights granted or affirmed under this License. For example, you may |
||||||
|
not impose a license fee, royalty, or other charge for exercise of |
||||||
|
rights granted under this License, and you may not initiate litigation |
||||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that |
||||||
|
any patent claim is infringed by making, using, selling, offering for |
||||||
|
sale, or importing the Program or any portion of it. |
||||||
|
|
||||||
|
11. Patents. |
||||||
|
|
||||||
|
A "contributor" is a copyright holder who authorizes use under this |
||||||
|
License of the Program or a work on which the Program is based. The |
||||||
|
work thus licensed is called the contributor's "contributor version". |
||||||
|
|
||||||
|
A contributor's "essential patent claims" are all patent claims |
||||||
|
owned or controlled by the contributor, whether already acquired or |
||||||
|
hereafter acquired, that would be infringed by some manner, permitted |
||||||
|
by this License, of making, using, or selling its contributor version, |
||||||
|
but do not include claims that would be infringed only as a |
||||||
|
consequence of further modification of the contributor version. For |
||||||
|
purposes of this definition, "control" includes the right to grant |
||||||
|
patent sublicenses in a manner consistent with the requirements of |
||||||
|
this License. |
||||||
|
|
||||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free |
||||||
|
patent license under the contributor's essential patent claims, to |
||||||
|
make, use, sell, offer for sale, import and otherwise run, modify and |
||||||
|
propagate the contents of its contributor version. |
||||||
|
|
||||||
|
In the following three paragraphs, a "patent license" is any express |
||||||
|
agreement or commitment, however denominated, not to enforce a patent |
||||||
|
(such as an express permission to practice a patent or covenant not to |
||||||
|
sue for patent infringement). To "grant" such a patent license to a |
||||||
|
party means to make such an agreement or commitment not to enforce a |
||||||
|
patent against the party. |
||||||
|
|
||||||
|
If you convey a covered work, knowingly relying on a patent license, |
||||||
|
and the Corresponding Source of the work is not available for anyone |
||||||
|
to copy, free of charge and under the terms of this License, through a |
||||||
|
publicly available network server or other readily accessible means, |
||||||
|
then you must either (1) cause the Corresponding Source to be so |
||||||
|
available, or (2) arrange to deprive yourself of the benefit of the |
||||||
|
patent license for this particular work, or (3) arrange, in a manner |
||||||
|
consistent with the requirements of this License, to extend the patent |
||||||
|
license to downstream recipients. "Knowingly relying" means you have |
||||||
|
actual knowledge that, but for the patent license, your conveying the |
||||||
|
covered work in a country, or your recipient's use of the covered work |
||||||
|
in a country, would infringe one or more identifiable patents in that |
||||||
|
country that you have reason to believe are valid. |
||||||
|
|
||||||
|
If, pursuant to or in connection with a single transaction or |
||||||
|
arrangement, you convey, or propagate by procuring conveyance of, a |
||||||
|
covered work, and grant a patent license to some of the parties |
||||||
|
receiving the covered work authorizing them to use, propagate, modify |
||||||
|
or convey a specific copy of the covered work, then the patent license |
||||||
|
you grant is automatically extended to all recipients of the covered |
||||||
|
work and works based on it. |
||||||
|
|
||||||
|
A patent license is "discriminatory" if it does not include within |
||||||
|
the scope of its coverage, prohibits the exercise of, or is |
||||||
|
conditioned on the non-exercise of one or more of the rights that are |
||||||
|
specifically granted under this License. You may not convey a covered |
||||||
|
work if you are a party to an arrangement with a third party that is |
||||||
|
in the business of distributing software, under which you make payment |
||||||
|
to the third party based on the extent of your activity of conveying |
||||||
|
the work, and under which the third party grants, to any of the |
||||||
|
parties who would receive the covered work from you, a discriminatory |
||||||
|
patent license (a) in connection with copies of the covered work |
||||||
|
conveyed by you (or copies made from those copies), or (b) primarily |
||||||
|
for and in connection with specific products or compilations that |
||||||
|
contain the covered work, unless you entered into that arrangement, |
||||||
|
or that patent license was granted, prior to 28 March 2007. |
||||||
|
|
||||||
|
Nothing in this License shall be construed as excluding or limiting |
||||||
|
any implied license or other defenses to infringement that may |
||||||
|
otherwise be available to you under applicable patent law. |
||||||
|
|
||||||
|
12. No Surrender of Others' Freedom. |
||||||
|
|
||||||
|
If conditions are imposed on you (whether by court order, agreement or |
||||||
|
otherwise) that contradict the conditions of this License, they do not |
||||||
|
excuse you from the conditions of this License. If you cannot convey a |
||||||
|
covered work so as to satisfy simultaneously your obligations under this |
||||||
|
License and any other pertinent obligations, then as a consequence you may |
||||||
|
not convey it at all. For example, if you agree to terms that obligate you |
||||||
|
to collect a royalty for further conveying from those to whom you convey |
||||||
|
the Program, the only way you could satisfy both those terms and this |
||||||
|
License would be to refrain entirely from conveying the Program. |
||||||
|
|
||||||
|
13. Use with the GNU Affero General Public License. |
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, you have |
||||||
|
permission to link or combine any covered work with a work licensed |
||||||
|
under version 3 of the GNU Affero General Public License into a single |
||||||
|
combined work, and to convey the resulting work. The terms of this |
||||||
|
License will continue to apply to the part which is the covered work, |
||||||
|
but the special requirements of the GNU Affero General Public License, |
||||||
|
section 13, concerning interaction through a network will apply to the |
||||||
|
combination as such. |
||||||
|
|
||||||
|
14. Revised Versions of this License. |
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of |
||||||
|
the GNU General Public License from time to time. Such new versions will |
||||||
|
be similar in spirit to the present version, but may differ in detail to |
||||||
|
address new problems or concerns. |
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the |
||||||
|
Program specifies that a certain numbered version of the GNU General |
||||||
|
Public License "or any later version" applies to it, you have the |
||||||
|
option of following the terms and conditions either of that numbered |
||||||
|
version or of any later version published by the Free Software |
||||||
|
Foundation. If the Program does not specify a version number of the |
||||||
|
GNU General Public License, you may choose any version ever published |
||||||
|
by the Free Software Foundation. |
||||||
|
|
||||||
|
If the Program specifies that a proxy can decide which future |
||||||
|
versions of the GNU General Public License can be used, that proxy's |
||||||
|
public statement of acceptance of a version permanently authorizes you |
||||||
|
to choose that version for the Program. |
||||||
|
|
||||||
|
Later license versions may give you additional or different |
||||||
|
permissions. However, no additional obligations are imposed on any |
||||||
|
author or copyright holder as a result of your choosing to follow a |
||||||
|
later version. |
||||||
|
|
||||||
|
15. Disclaimer of Warranty. |
||||||
|
|
||||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
||||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
||||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
||||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
||||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
||||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
||||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
||||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
||||||
|
|
||||||
|
16. Limitation of Liability. |
||||||
|
|
||||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
||||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
||||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
||||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
||||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
||||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
||||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
||||||
|
SUCH DAMAGES. |
||||||
|
|
||||||
|
17. Interpretation of Sections 15 and 16. |
||||||
|
|
||||||
|
If the disclaimer of warranty and limitation of liability provided |
||||||
|
above cannot be given local legal effect according to their terms, |
||||||
|
reviewing courts shall apply local law that most closely approximates |
||||||
|
an absolute waiver of all civil liability in connection with the |
||||||
|
Program, unless a warranty or assumption of liability accompanies a |
||||||
|
copy of the Program in return for a fee. |
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS |
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs |
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest |
||||||
|
possible use to the public, the best way to achieve this is to make it |
||||||
|
free software which everyone can redistribute and change under these terms. |
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest |
||||||
|
to attach them to the start of each source file to most effectively |
||||||
|
state the exclusion of warranty; and each file should have at least |
||||||
|
the "copyright" line and a pointer to where the full notice is found. |
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.> |
||||||
|
Copyright (C) <year> <name of author> |
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify |
||||||
|
it under the terms of the GNU General Public License as published by |
||||||
|
the Free Software Foundation, either version 3 of the License, or |
||||||
|
(at your option) any later version. |
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful, |
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||||
|
GNU General Public License for more details. |
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License |
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>. |
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail. |
||||||
|
|
||||||
|
If the program does terminal interaction, make it output a short |
||||||
|
notice like this when it starts in an interactive mode: |
||||||
|
|
||||||
|
<program> Copyright (C) <year> <name of author> |
||||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
||||||
|
This is free software, and you are welcome to redistribute it |
||||||
|
under certain conditions; type `show c' for details. |
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate |
||||||
|
parts of the General Public License. Of course, your program's commands |
||||||
|
might be different; for a GUI interface, you would use an "about box". |
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or school, |
||||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary. |
||||||
|
For more information on this, and how to apply and follow the GNU GPL, see |
||||||
|
<https://www.gnu.org/licenses/>. |
||||||
|
|
||||||
|
The GNU General Public License does not permit incorporating your program |
||||||
|
into proprietary programs. If your program is a subroutine library, you |
||||||
|
may consider it more useful to permit linking proprietary applications with |
||||||
|
the library. If this is what you want to do, use the GNU Lesser General |
||||||
|
Public License instead of this License. But first, please read |
||||||
|
<https://www.gnu.org/licenses/why-not-lgpl.html>. |
After Width: | Height: | Size: 36 KiB |
@ -0,0 +1,86 @@ |
|||||||
|
#version 430 |
||||||
|
#extension GL_ARB_gpu_shader_fp64 : enable |
||||||
|
|
||||||
|
#define MAX_SEGMENTS 32 |
||||||
|
|
||||||
|
layout (local_size_x=MAX_SEGMENTS, local_size_y=1, local_size_z=1) in; |
||||||
|
|
||||||
|
layout(std430, binding = 0) buffer PositionBuffer { |
||||||
|
dvec2 X[]; |
||||||
|
}; |
||||||
|
|
||||||
|
layout(std430, binding = 1) buffer VelocityBuffer { |
||||||
|
dvec2 V[]; |
||||||
|
}; |
||||||
|
|
||||||
|
layout(std430, binding = 2) buffer InverseMassBuffer { |
||||||
|
double W[]; |
||||||
|
}; |
||||||
|
|
||||||
|
layout(std430, binding = 3) buffer LengthBuffer { |
||||||
|
double L[]; |
||||||
|
}; |
||||||
|
|
||||||
|
layout(std430, binding = 4) buffer IndexBuffer { |
||||||
|
uint indices[]; |
||||||
|
}; |
||||||
|
|
||||||
|
layout(std430, binding = 5) buffer SegmentCountBuffer { |
||||||
|
uint segmentCounts[]; |
||||||
|
}; |
||||||
|
|
||||||
|
uniform double h; |
||||||
|
uniform double gravity; |
||||||
|
uniform uint substeps; |
||||||
|
|
||||||
|
shared dvec2 P[MAX_SEGMENTS]; |
||||||
|
|
||||||
|
// distance constraint |
||||||
|
void solveConstraint(uint segmentId, uint gIndex){ |
||||||
|
double w1 = segmentId == 0 ? 0.0 : W[gIndex - 1]; |
||||||
|
double w2 = W[gIndex]; |
||||||
|
|
||||||
|
dvec2 s = (segmentId == 0 ? dvec2(0, 0) : P[segmentId - 1]) - P[segmentId]; |
||||||
|
dvec2 n = normalize(s); |
||||||
|
double l = length(s); |
||||||
|
|
||||||
|
dvec2 deltaP1 = n * -w1 / (w1 + w2) * (l - L[gIndex]); |
||||||
|
dvec2 deltaP2 = n * w2 / (w1 + w2) * (l - L[gIndex]); |
||||||
|
|
||||||
|
if (segmentId > 0) |
||||||
|
P[segmentId - 1] += deltaP1; |
||||||
|
P[segmentId] += deltaP2; |
||||||
|
} |
||||||
|
|
||||||
|
// No need for synchronization, because each pendulum gets its own warp |
||||||
|
void main() { |
||||||
|
uint pendulumId = gl_WorkGroupID.x; |
||||||
|
uint i_off = indices[pendulumId]; |
||||||
|
uint segmentCount = segmentCounts[pendulumId]; |
||||||
|
uint localId = gl_LocalInvocationID.x; |
||||||
|
uint gIndex = i_off + localId; |
||||||
|
|
||||||
|
// discard unneeded local threads for segments |
||||||
|
if (localId >= segmentCount) |
||||||
|
return; |
||||||
|
|
||||||
|
// substepping is not parallelizable |
||||||
|
for (int k = 0; k < substeps; k++){ |
||||||
|
|
||||||
|
// explicit integration with gravity as external force |
||||||
|
V[gIndex] = V[gIndex] + dvec2(0, -gravity * h); |
||||||
|
P[localId] = X[gIndex] + V[gIndex] * h; |
||||||
|
|
||||||
|
// every segment depends on its neighbour, so we can not parallelize all constraints |
||||||
|
// only parallelize those, who are independent of each other, skipping every second segment |
||||||
|
if (localId % 2 == 0){ |
||||||
|
solveConstraint(localId, i_off + localId); |
||||||
|
if (localId + 1 < segmentCount) |
||||||
|
solveConstraint(localId + 1, gIndex + 1); |
||||||
|
} |
||||||
|
|
||||||
|
// update position and velocity |
||||||
|
V[gIndex] = (P[localId] - X[gIndex]) / h; |
||||||
|
X[gIndex] = P[localId]; |
||||||
|
} |
||||||
|
} |
@ -0,0 +1,21 @@ |
|||||||
|
#version 330 core |
||||||
|
|
||||||
|
out vec4 FragColor; |
||||||
|
|
||||||
|
in vec3 color; |
||||||
|
|
||||||
|
uniform bool drawPoints; |
||||||
|
|
||||||
|
void main() { |
||||||
|
if (drawPoints){ |
||||||
|
vec2 coord = gl_PointCoord - vec2(0.5); |
||||||
|
if (length(coord) > 0.5) |
||||||
|
discard; |
||||||
|
if (length(coord) > 0.4) |
||||||
|
FragColor = vec4(1, 1, 1, 1); |
||||||
|
else |
||||||
|
FragColor = vec4(0, 0, 0, 1); |
||||||
|
} else { |
||||||
|
FragColor = vec4(color, 1); |
||||||
|
} |
||||||
|
} |
@ -0,0 +1,11 @@ |
|||||||
|
#version 330 core |
||||||
|
|
||||||
|
out vec4 FragColor; |
||||||
|
|
||||||
|
in vec2 texCoord; |
||||||
|
|
||||||
|
uniform sampler2D quadTexture; |
||||||
|
|
||||||
|
void main() { |
||||||
|
FragColor = texture(quadTexture, texCoord); |
||||||
|
} |
@ -0,0 +1,9 @@ |
|||||||
|
<RCC> |
||||||
|
<qresource prefix="/shaders/"> |
||||||
|
<file>vertex_pendula.glsl</file> |
||||||
|
<file>fragment_pendula.glsl</file> |
||||||
|
<file>vertex_quad.glsl</file> |
||||||
|
<file>fragment_quad.glsl</file> |
||||||
|
<file>compute.glsl</file> |
||||||
|
</qresource> |
||||||
|
</RCC> |
@ -0,0 +1,27 @@ |
|||||||
|
#version 330 core |
||||||
|
|
||||||
|
layout (location = 0) in vec3 vPos; |
||||||
|
layout (location = 1) in vec3 vColor; |
||||||
|
layout (location = 2) in float vMassRadius; |
||||||
|
|
||||||
|
uniform mat3 VP; |
||||||
|
|
||||||
|
uniform bool drawPoints; |
||||||
|
uniform int simulationSizePixels; |
||||||
|
uniform float simulationSizeMeters; |
||||||
|
uniform float depthOffset; |
||||||
|
|
||||||
|
out vec3 color; |
||||||
|
|
||||||
|
void main() { |
||||||
|
gl_Position = vec4(VP * vPos, 1.0); |
||||||
|
if (drawPoints){ |
||||||
|
// Points always on top of neighbouring lines |
||||||
|
gl_Position.z -= depthOffset * 0.5; |
||||||
|
|
||||||
|
// PointSize is diameter in Pixels |
||||||
|
gl_PointSize = vMassRadius / simulationSizeMeters * simulationSizePixels * 2; |
||||||
|
} else { |
||||||
|
color = vColor; |
||||||
|
} |
||||||
|
} |
@ -0,0 +1,11 @@ |
|||||||
|
#version 330 core |
||||||
|
|
||||||
|
layout (location = 0) in vec2 vPos; |
||||||
|
layout (location = 1) in vec2 vTex; |
||||||
|
|
||||||
|
out vec2 texCoord; |
||||||
|
|
||||||
|
void main() { |
||||||
|
gl_Position = vec4(vPos, 0, 1); |
||||||
|
texCoord = vTex; |
||||||
|
} |
@ -1,19 +1,42 @@ |
|||||||
#include <QOpenGLWidget> |
#pragma once |
||||||
#include <QOpenGLFunctions> |
|
||||||
|
|
||||||
|
|
||||||
|
#include <QOpenGLWidget> |
||||||
|
#include <QOpenGLFunctions_3_3_Core> |
||||||
|
#include <QMatrix3x3> |
||||||
|
|
||||||
|
class Pendulum; |
||||||
class Simulation; |
class Simulation; |
||||||
class FPS; |
class QOpenGLShaderProgram; |
||||||
|
class Overlay; |
||||||
|
|
||||||
class GLWidget : public QOpenGLWidget, protected QOpenGLFunctions { |
class GLWidget : public QOpenGLWidget, protected QOpenGLFunctions_3_3_Core { |
||||||
public: |
public: |
||||||
explicit GLWidget(Simulation *); |
explicit GLWidget(Simulation *); |
||||||
|
Overlay * overlay; |
||||||
protected: |
protected: |
||||||
void paintEvent(QPaintEvent* e) override; |
|
||||||
void timerEvent(QTimerEvent* e) override; |
void timerEvent(QTimerEvent* e) override; |
||||||
|
void initializeGL() override; |
||||||
|
void paintGL() override; |
||||||
|
void resizeGL(int w, int h) override; |
||||||
|
public slots: |
||||||
|
void showMassesChanged(int state); |
||||||
|
private slots: |
||||||
|
void uploadStaticDataToGPU(); |
||||||
|
void changePosition(); |
||||||
private: |
private: |
||||||
|
QOpenGLShaderProgram * pendulaProgram; |
||||||
|
GLuint VAO; |
||||||
|
GLuint positionVBO; |
||||||
|
GLuint colorVBO; |
||||||
|
GLuint massRadiiVBO; |
||||||
|
GLuint EBO; |
||||||
|
GLsizei indexCount = 0; |
||||||
|
GLsizei positionCount = 0; |
||||||
|
QMatrix3x3 VP; |
||||||
|
int simulationSizePixels; |
||||||
|
float depthOffset; |
||||||
|
bool showMasses; |
||||||
|
|
||||||
Simulation * simulation; |
Simulation * simulation; |
||||||
FPS * fps; |
|
||||||
static bool AnyDialogOpen(); |
static bool AnyDialogOpen(); |
||||||
}; |
}; |
@ -0,0 +1,176 @@ |
|||||||
|
#include "Overlay.h" |
||||||
|
#include "FPS.h" |
||||||
|
#include <QPainter> |
||||||
|
#include <QOpenGLShaderProgram> |
||||||
|
#include "Simulation.h" |
||||||
|
#include <iostream> |
||||||
|
#include <QOpenGLTexture> |
||||||
|
#include <sstream> |
||||||
|
#include <iomanip> |
||||||
|
|
||||||
|
Overlay::Overlay(Simulation * simulation) : simulation(simulation) { |
||||||
|
fps = new FPS; |
||||||
|
fps->setUpdateInterval(500); |
||||||
|
} |
||||||
|
|
||||||
|
void Overlay::init() { |
||||||
|
initializeOpenGLFunctions(); |
||||||
|
|
||||||
|
program = new QOpenGLShaderProgram; |
||||||
|
program->addShaderFromSourceFile(QOpenGLShader::Vertex, ":/shaders/vertex_quad.glsl"); |
||||||
|
program->addShaderFromSourceFile(QOpenGLShader::Fragment, ":/shaders/fragment_quad.glsl"); |
||||||
|
program->link(); |
||||||
|
|
||||||
|
float quadVertices[] = { |
||||||
|
-1, 1, 0, 1, // top left
|
||||||
|
-1, -1, 0, 0, // bottom left
|
||||||
|
1, -1, 1, 0, // bottom right
|
||||||
|
1, 1, 1, 1 // top right
|
||||||
|
}; |
||||||
|
|
||||||
|
GLuint indices[] = { |
||||||
|
0, 1, 2, 2, 3, 0 |
||||||
|
}; |
||||||
|
|
||||||
|
glGenVertexArrays(1, &VAO); |
||||||
|
glBindVertexArray(VAO); |
||||||
|
|
||||||
|
GLuint VBO; |
||||||
|
glGenBuffers(1, &VBO); |
||||||
|
glBindBuffer(GL_ARRAY_BUFFER, VBO); |
||||||
|
glBufferData(GL_ARRAY_BUFFER, sizeof(quadVertices), quadVertices, GL_STATIC_DRAW); |
||||||
|
|
||||||
|
GLuint EBO; |
||||||
|
glGenBuffers(1, &EBO); |
||||||
|
glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, EBO); |
||||||
|
glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW); |
||||||
|
|
||||||
|
glVertexAttribPointer(0, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(float), nullptr); |
||||||
|
glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 4 * sizeof(float), (GLvoid*) (2 * sizeof(float))); |
||||||
|
glEnableVertexAttribArray(0); |
||||||
|
glEnableVertexAttribArray(1); |
||||||
|
|
||||||
|
glBindVertexArray(0); |
||||||
|
} |
||||||
|
|
||||||
|
void Overlay::draw() { |
||||||
|
int w = viewportSize.width(); |
||||||
|
int h = (viewportSize.height() - simulationRect.height()) / 2; |
||||||
|
|
||||||
|
// Top HUD with Energy Plot
|
||||||
|
{ |
||||||
|
glViewport(0, viewportSize.height() - h, w, h); |
||||||
|
|
||||||
|
QImage hud(w, h, QImage::Format_RGBA8888); |
||||||
|
hud.fill(Qt::transparent); |
||||||
|
|
||||||
|
QPainter p(&hud); |
||||||
|
p.setPen(Qt::white); |
||||||
|
auto font = p.font(); |
||||||
|
font.setPixelSize(15); |
||||||
|
p.setFont(font); |
||||||
|
|
||||||
|
auto m = p.fontMetrics(); |
||||||
|
|
||||||
|
double pot = simulation->potentialEnergy; |
||||||
|
double kin = simulation->kineticEnergy; |
||||||
|
double total = pot + kin; |
||||||
|
|
||||||
|
QColor empty(50, 50, 50); |
||||||
|
QColor full(80, 80, 80); |
||||||
|
|
||||||
|
// Total energy bar
|
||||||
|
{ |
||||||
|
double lossPercentage = (1 - total / energyLimit) * 100; |
||||||
|
|
||||||
|
std::stringstream text; |
||||||
|
text << std::fixed << std::setprecision(0) << "Total Energy: " << total << " J"; |
||||||
|
text << " --- "; |
||||||
|
text << "Loss: " << std::setprecision(1) << lossPercentage << " %"; |
||||||
|
QString totalText = QString::fromStdString(text.str()); |
||||||
|
|
||||||
|
int x = int(total / energyLimit * w); |
||||||
|
|
||||||
|
p.fillRect(0, 0, w, h / 2, empty); |
||||||
|
p.fillRect(0, 0, x, h / 2, full); |
||||||
|
p.drawLine(x, 0, x, h / 2); |
||||||
|
p.drawText(0, 0, w, h / 2, Qt::AlignCenter | Qt::AlignVCenter, totalText); |
||||||
|
} |
||||||
|
|
||||||
|
// Split energy bar
|
||||||
|
{ |
||||||
|
int potX = total == 0 ? int(0.5 * w) : int(pot / total * w); |
||||||
|
p.fillRect(0, h / 2, w, h / 2, empty); |
||||||
|
p.fillRect(0, h / 2, potX, h / 2, full); |
||||||
|
|
||||||
|
std::stringstream text; |
||||||
|
text << std::fixed << std::setprecision(0) << "Potential: " << pot << " J"; |
||||||
|
QString potText = QString::fromStdString(text.str()); |
||||||
|
|
||||||
|
text = std::stringstream(); |
||||||
|
text << std::fixed << std::setprecision(0) << "Kinetic: " << kin << " J"; |
||||||
|
QString kinText = QString::fromStdString(text.str()); |
||||||
|
|
||||||
|
int textWidth1 = m.horizontalAdvance(potText); |
||||||
|
int textWidth2 = m.horizontalAdvance(kinText); |
||||||
|
int x1 = (w - textWidth1) / 4; |
||||||
|
int x2 = (w - textWidth2) / 4 * 3; |
||||||
|
|
||||||
|
p.drawLine(potX, h / 2, potX, h); |
||||||
|
p.drawText(x1, h / 2, textWidth1, h / 2, Qt::AlignCenter | Qt::AlignVCenter, potText); |
||||||
|
p.drawText(x2, h / 2, textWidth2, h / 2, Qt::AlignCenter | Qt::AlignVCenter, kinText); |
||||||
|
} |
||||||
|
|
||||||
|
p.drawLine(0, 0, w, 0); |
||||||
|
p.drawLine(0, h / 2, w, h / 2); |
||||||
|
p.drawLine(0, h - 1, w, h - 1); |
||||||
|
|
||||||
|
drawTexture(&hud); |
||||||
|
} |
||||||
|
|
||||||
|
// Bottom HUD with FPS and UPS
|
||||||
|
{ |
||||||
|
glViewport(0, 0, w, h); |
||||||
|
|
||||||
|
QImage hud(w, h, QImage::Format_RGBA8888); |
||||||
|
|
||||||
|
// Background
|
||||||
|
hud.fill(Qt::transparent); |
||||||
|
|
||||||
|
QPainter p(&hud); |
||||||
|
|
||||||
|
// FPS
|
||||||
|
{ |
||||||
|
p.setPen(Qt::white); |
||||||
|
auto font = p.font(); |
||||||
|
font.setPixelSize(15); |
||||||
|
p.setFont(font); |
||||||
|
fps->newFrame(); |
||||||
|
std::stringstream text; |
||||||
|
text << "FPS: " << fps->current << "\n"; |
||||||
|
text << "UPS: " << simulation->ups->current; |
||||||
|
p.drawText(0, 0, 100, h, Qt::AlignBottom | Qt::AlignLeft, QString::fromStdString(text.str())); |
||||||
|
} |
||||||
|
drawTexture(&hud); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void Overlay::resize(QSize newViewportSize, QRect newSimulationRect) { |
||||||
|
viewportSize = newViewportSize; |
||||||
|
simulationRect = newSimulationRect; |
||||||
|
} |
||||||
|
|
||||||
|
void Overlay::drawTexture(QImage *image) { |
||||||
|
glBindVertexArray(VAO); |
||||||
|
program->bind(); |
||||||
|
|
||||||
|
QOpenGLTexture texture(image->mirrored()); |
||||||
|
texture.bind(); |
||||||
|
|
||||||
|
glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_INT, nullptr); |
||||||
|
} |
||||||
|
|
||||||
|
void Overlay::resetEnergyLimit() { |
||||||
|
simulation->updateEnergy(); |
||||||
|
energyLimit = simulation->kineticEnergy + simulation->potentialEnergy; |
||||||
|
} |
@ -0,0 +1,29 @@ |
|||||||
|
#include <QRect> |
||||||
|
|
||||||
|
#include <QOpenGLExtraFunctions> |
||||||
|
|
||||||
|
class QOpenGLWidget; |
||||||
|
class FPS; |
||||||
|
class QOpenGLShaderProgram; |
||||||
|
class QOpenGLTexture; |
||||||
|
class Simulation; |
||||||
|
|
||||||
|
class Overlay : public QObject, protected QOpenGLExtraFunctions { |
||||||
|
Q_OBJECT |
||||||
|
|
||||||
|
FPS * fps; |
||||||
|
QSize viewportSize; |
||||||
|
QRect simulationRect; |
||||||
|
QOpenGLShaderProgram * program; |
||||||
|
GLuint VAO; |
||||||
|
void drawTexture(QImage *image); |
||||||
|
Simulation * simulation; |
||||||
|
double energyLimit = 0; |
||||||
|
public slots: |
||||||
|
void resetEnergyLimit(); |
||||||
|
public: |
||||||
|
explicit Overlay(Simulation *); |
||||||
|
void init(); |
||||||
|
void draw(); |
||||||
|
void resize(QSize newViewportSize, QRect newSimulationRect); |
||||||
|
}; |
@ -1,20 +1,23 @@ |
|||||||
|
#pragma once |
||||||
|
|
||||||
#include <vector> |
#include <vector> |
||||||
#include <QVector2D> |
#include <QVector2D> |
||||||
#include <QColor> |
#include <QColor> |
||||||
#include "Vector.h" |
#include "Vector.h" |
||||||
|
|
||||||
class QPainter; |
class GLWidget; |
||||||
|
|
||||||
class Pendulum { |
class Pendulum { |
||||||
public: |
public: |
||||||
explicit Pendulum(const std::vector<double> &M, |
explicit Pendulum(const std::vector<double> &M, |
||||||
const std::vector<double> &L, |
const std::vector<double> &L, |
||||||
QColor color, double startAngle); |
QColor color, double startAngle); |
||||||
|
|
||||||
void draw(QPainter*, double) const; |
|
||||||
void update(double, double); |
void update(double, double); |
||||||
|
double potentialEnergy(double gravity) const; |
||||||
|
double kineticEnergy() const; |
||||||
private: |
private: |
||||||
|
friend class GLWidget; |
||||||
|
friend class Simulation; |
||||||
std::vector<Vector> X, V; |
std::vector<Vector> X, V; |
||||||
std::vector<double> M, L; |
std::vector<double> M, L; |
||||||
QColor color; |
QColor color; |
||||||
|
@ -1,55 +1,259 @@ |
|||||||
#include "Simulation.h" |
#include "Simulation.h" |
||||||
#include "Pendulum.h" |
|
||||||
#include <QPainter> |
#include <QPainter> |
||||||
#include <QTimer> |
#include <QTimer> |
||||||
#include <QThread> |
#include <QThread> |
||||||
#include <omp.h> |
#include <omp.h> |
||||||
#include <iostream> |
#include <iostream> |
||||||
|
#include "FPS.h" |
||||||
|
#include "Pendulum.h" |
||||||
|
#include <QOpenGLContext> |
||||||
|
#include <QOpenGLShaderProgram> |
||||||
|
#include <QOffscreenSurface> |
||||||
|
|
||||||
Simulation::Simulation() { |
Simulation::Simulation() { |
||||||
|
ups = new FPS; |
||||||
|
ups->setUpdateInterval(100); |
||||||
timer = new QTimer(this); |
timer = new QTimer(this); |
||||||
QTimer::connect(timer, &QTimer::timeout, this, &Simulation::update); |
QTimer::connect(timer, &QTimer::timeout, this, &Simulation::update); |
||||||
timer->setInterval(updateInterval); |
timer->setInterval(updateInterval); |
||||||
timer->start(); |
timer->start(); |
||||||
lastUpdate = system_clock::now(); |
|
||||||
}; |
}; |
||||||
|
|
||||||
void Simulation::draw(QPainter *p, int screenSize) { |
void Simulation::initialize() { |
||||||
double scale = screenSize * 0.95 / size; |
|
||||||
|
// OpenGL Offscreen functions
|
||||||
|
{ |
||||||
|
context = new QOpenGLContext; |
||||||
|
auto format = QSurfaceFormat::defaultFormat(); |
||||||
|
format.setVersion(4, 3); |
||||||
|
context->setFormat(format); |
||||||
|
context->create(); |
||||||
|
context->makeCurrent(offSurface); |
||||||
|
f = new QOpenGLFunctions_4_3_Core; |
||||||
|
if (!f->initializeOpenGLFunctions()){ |
||||||
|
std::string message = "OpenGL 4.3 is required for Compute Shaders! Falling back to CPU-Multithreading."; |
||||||
|
printf("%s\n", message.c_str()); |
||||||
|
useGPUAcceleration = false; |
||||||
|
emit gpuNotSupported(message); |
||||||
|
} else if (!context->hasExtension("GL_ARB_gpu_shader_fp64")){ |
||||||
|
std::string message = "Double precision not supported by OpenGL! Falling back to CPU-Multithreading."; |
||||||
|
printf("%s\n", message.c_str()); |
||||||
|
useGPUAcceleration = false; |
||||||
|
emit gpuNotSupported(message); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
if (!useGPUAcceleration){ |
||||||
|
context->doneCurrent(); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
|
||||||
|
// Read GPU Limits
|
||||||
|
{ |
||||||
|
for (int i = 0; i < 3; i++){ |
||||||
|
f->glGetIntegeri_v(GL_MAX_COMPUTE_WORK_GROUP_COUNT, i, gpuLimits.maxWGCount + i); |
||||||
|
f->glGetIntegeri_v(GL_MAX_COMPUTE_WORK_GROUP_SIZE, i, gpuLimits.maxWGSize + i); |
||||||
|
} |
||||||
|
f->glGetIntegerv(GL_MAX_COMPUTE_WORK_GROUP_INVOCATIONS, &gpuLimits.maxWGInvocations); |
||||||
|
|
||||||
|
printf("Max work group count: (%d, %d, %d)\n", gpuLimits.maxWGCount[0], gpuLimits.maxWGCount[1], gpuLimits.maxWGCount[2]); |
||||||
|
printf("Max work group size: (%d, %d, %d)\n", gpuLimits.maxWGSize[0], gpuLimits.maxWGSize[1], gpuLimits.maxWGSize[2]); |
||||||
|
printf("Max work group invocations (x * y * z): %d\n", gpuLimits.maxWGInvocations); |
||||||
|
} |
||||||
|
|
||||||
|
// Shader
|
||||||
|
{ |
||||||
|
program = new QOpenGLShaderProgram; |
||||||
|
program->addShaderFromSourceFile(QOpenGLShader::Compute, ":/shaders/compute.glsl"); |
||||||
|
program->link(); |
||||||
|
|
||||||
|
f->glGenBuffers(6, &SSBO.positions); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 0, SSBO.positions); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 1, SSBO.velocities); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 2, SSBO.invMasses); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 3, SSBO.lengths); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 4, SSBO.indices); |
||||||
|
f->glBindBufferBase(GL_SHADER_STORAGE_BUFFER, 5, SSBO.segmentCounts); |
||||||
|
} |
||||||
|
|
||||||
for (const auto pendulum : pendula) |
context->doneCurrent(); |
||||||
pendulum->draw(p, scale); |
|
||||||
} |
} |
||||||
|
|
||||||
void Simulation::update() { |
// When the layout changes
|
||||||
auto thisUpdate = system_clock::now(); |
void Simulation::updateGPUData() { |
||||||
auto ms = (int)duration_cast<milliseconds>(thisUpdate - lastUpdate).count(); |
context->makeCurrent(offSurface); |
||||||
lastUpdate = thisUpdate; |
|
||||||
|
std::vector<GLdouble> positions; |
||||||
|
std::vector<GLdouble> velocities; |
||||||
|
std::vector<GLdouble> invMasses; |
||||||
|
std::vector<GLdouble> lengths; |
||||||
|
std::vector<GLuint> indices; |
||||||
|
std::vector<GLuint> segmentCounts; |
||||||
|
|
||||||
|
GLuint currentIndex = 0; |
||||||
|
for (const Pendulum * p : pendula){ |
||||||
|
indices.push_back(currentIndex); |
||||||
|
currentIndex += p->X.size(); |
||||||
|
segmentCounts.push_back(p->X.size()); |
||||||
|
for (size_t i = 0; i < p->X.size(); i++){ |
||||||
|
positions.push_back(p->X[i].x); |
||||||
|
positions.push_back(p->X[i].y); |
||||||
|
velocities.push_back(p->V[i].x); |
||||||
|
velocities.push_back(p->V[i].y); |
||||||
|
invMasses.push_back(1.0 / p->M[i]); |
||||||
|
lengths.push_back(p->L[i]); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
auto posSize = GLsizeiptr(positions.size() * sizeof(GLdouble)); |
||||||
|
auto velSize = GLsizeiptr(velocities.size() * sizeof(GLdouble)); |
||||||
|
auto invMassSize = GLsizeiptr(invMasses.size() * sizeof(GLdouble)); |
||||||
|
auto lengthSize = GLsizeiptr(lengths.size() * sizeof(GLdouble)); |
||||||
|
auto indicesSize = GLsizeiptr(indices.size() * sizeof(GLuint)); |
||||||
|
auto segmentCountsSize = GLsizeiptr(segmentCounts.size() * sizeof(GLuint)); |
||||||
|
|
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.positions); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, posSize, positions.data(), GL_DYNAMIC_DRAW); |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.velocities); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, velSize, velocities.data(), GL_DYNAMIC_DRAW); |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.invMasses); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, invMassSize, invMasses.data(), GL_STATIC_DRAW); |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.lengths); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, lengthSize, lengths.data(), GL_STATIC_DRAW); |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.indices); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, indicesSize, indices.data(), GL_STATIC_DRAW); |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.segmentCounts); |
||||||
|
f->glBufferData(GL_SHADER_STORAGE_BUFFER, segmentCountsSize, segmentCounts.data(), GL_STATIC_DRAW); |
||||||
|
|
||||||
|
context->doneCurrent(); |
||||||
|
} |
||||||
|
|
||||||
|
// Every few milliseconds
|
||||||
|
void Simulation::update() { |
||||||
if (!isPlaying) |
if (!isPlaying) |
||||||
return; |
return; |
||||||
|
|
||||||
double h = (timescale * updateInterval) / 1000; |
ups->newFrame(); |
||||||
|
|
||||||
|
double h = (timescale * updateInterval) / 1000 / substeps; |
||||||
|
|
||||||
|
semaphore.acquire(); |
||||||
|
|
||||||
h /= substeps; |
double newPotentialEnergy = 0; |
||||||
|
double newKineticEnergy = 0; |
||||||
|
|
||||||
#pragma omp parallel for |
if (useGPUAcceleration) { |
||||||
for (int i = 0; i < pendula.size(); i++) // NOLINT(*-loop-convert) // no ranged based for msvc
|
context->makeCurrent(offSurface); |
||||||
for (int k = 0; k < substeps; k++) |
program->bind(); |
||||||
pendula[i]->update(h, gravity); |
f->glUniform1d(program->uniformLocation("h"), h); |
||||||
|
f->glUniform1d(program->uniformLocation("gravity"), gravity); |
||||||
|
f->glUniform1ui(program->uniformLocation("substeps"), substeps); |
||||||
|
|
||||||
|
f->glDispatchCompute(pendula.size(), 1, 1); |
||||||
|
f->glMemoryBarrier(GL_SHADER_STORAGE_BARRIER_BIT); |
||||||
|
|
||||||
|
// Read updated positions
|
||||||
|
{ |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.positions); |
||||||
|
auto * newPositions = (double*) f->glMapBuffer(GL_SHADER_STORAGE_BUFFER, GL_READ_ONLY); |
||||||
|
int index = 0; |
||||||
|
for (Pendulum * p : pendula){ |
||||||
|
for (Vector &point : p->X){ |
||||||
|
point.x = newPositions[index++]; |
||||||
|
point.y = newPositions[index++]; |
||||||
|
} |
||||||
|
} |
||||||
|
f->glUnmapBuffer(GL_SHADER_STORAGE_BUFFER); |
||||||
|
} |
||||||
|
|
||||||
|
// Read updated velocities
|
||||||
|
{ |
||||||
|
f->glBindBuffer(GL_SHADER_STORAGE_BUFFER, SSBO.velocities); |
||||||
|
auto * newVelocities = (double*) f->glMapBuffer(GL_SHADER_STORAGE_BUFFER, GL_READ_ONLY); |
||||||
|
int index = 0; |
||||||
|
for (Pendulum * p : pendula){ |
||||||
|
for (Vector &velocity : p->V){ |
||||||
|
velocity.x = newVelocities[index++]; |
||||||
|
velocity.y = newVelocities[index++]; |
||||||
|
} |
||||||
|
} |
||||||
|
f->glUnmapBuffer(GL_SHADER_STORAGE_BUFFER); |
||||||
|
} |
||||||
|
|
||||||
|
#pragma omp parallel for |
||||||
|
for (int i = 0; i < pendula.size(); i++){ // NOLINT(*-loop-convert) not ranged based for msvc
|
||||||
|
double localPotentialEnergy = pendula[i]->potentialEnergy(gravity); |
||||||
|
double localKineticEnergy = pendula[i]->kineticEnergy(); |
||||||
|
#pragma omp atomic |
||||||
|
newPotentialEnergy += localPotentialEnergy; |
||||||
|
#pragma omp atomic |
||||||
|
newKineticEnergy += localKineticEnergy; |
||||||
|
} |
||||||
|
context->doneCurrent(); |
||||||
|
} else { |
||||||
|
// CPU-Multithreading
|
||||||
|
#pragma omp parallel for |
||||||
|
for (int i = 0; i < pendula.size(); i++){ // NOLINT(*-loop-convert) not ranged based for msvc
|
||||||
|
for (int k = 0; k < substeps; k++) |
||||||
|
pendula[i]->update(h, gravity); |
||||||
|
double localPotentialEnergy = pendula[i]->potentialEnergy(gravity); |
||||||
|
double localKineticEnergy = pendula[i]->kineticEnergy(); |
||||||
|
#pragma omp atomic |
||||||
|
newPotentialEnergy += localPotentialEnergy; |
||||||
|
#pragma omp atomic |
||||||
|
newKineticEnergy += localKineticEnergy; |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
potentialEnergy = newPotentialEnergy; |
||||||
|
kineticEnergy = newKineticEnergy; |
||||||
|
|
||||||
|
emit positionChanged(); |
||||||
} |
} |
||||||
|
|
||||||
void Simulation::clearPendula() { |
void Simulation::clearPendula() { |
||||||
auto deleteLater = pendula; |
semaphore.acquire(); |
||||||
|
|
||||||
|
for (Pendulum* &p : pendula){ |
||||||
|
delete p; |
||||||
|
p = nullptr; |
||||||
|
} |
||||||
|
|
||||||
pendula.clear(); |
pendula.clear(); |
||||||
pendula.shrink_to_fit(); |
pendula.shrink_to_fit(); |
||||||
QThread::usleep(500000); |
|
||||||
for (auto p : deleteLater) |
updateEnergy(); |
||||||
delete p; |
if (useGPUAcceleration) |
||||||
|
updateGPUData(); |
||||||
|
|
||||||
|
emit layoutChanged(); |
||||||
} |
} |
||||||
|
|
||||||
void Simulation::addPendula(const std::vector<Pendulum *> &add) { |
void Simulation::addPendula(const std::vector<Pendulum *> &add) { |
||||||
|
semaphore.acquire(); |
||||||
|
|
||||||
for (auto p : add) |
for (auto p : add) |
||||||
pendula.push_back(p); |
pendula.push_back(p); |
||||||
|
|
||||||
|
updateEnergy(); |
||||||
|
if (useGPUAcceleration) |
||||||
|
updateGPUData(); |
||||||
|
|
||||||
|
emit layoutChanged(); |
||||||
|
} |
||||||
|
|
||||||
|
void Simulation::updateEnergy() { |
||||||
|
potentialEnergy = kineticEnergy = 0; |
||||||
|
for (auto p : pendula){ |
||||||
|
potentialEnergy += p->potentialEnergy(gravity); |
||||||
|
kineticEnergy += p->kineticEnergy(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void Simulation::useGPUChanged(int state) { |
||||||
|
useGPUAcceleration = state == Qt::Checked; |
||||||
|
if (useGPUAcceleration) |
||||||
|
updateGPUData(); |
||||||
} |
} |
||||||
|
|
||||||
|
@ -1,21 +1,26 @@ |
|||||||
#include <QApplication> |
#include <QApplication> |
||||||
#include <QSurfaceFormat> |
#include <QSurfaceFormat> |
||||||
#include "MainWindow.h" |
#include "MainWindow.h" |
||||||
#include <omp.h> |
#include <QIcon> |
||||||
#include <chrono> |
#include <QThread> |
||||||
#include <iostream> |
|
||||||
|
|
||||||
using namespace std::chrono; |
|
||||||
|
|
||||||
int main(int argc, char* argv[]) { |
int main(int argc, char* argv[]) { |
||||||
QApplication app(argc, argv); |
QSurfaceFormat fmt = QSurfaceFormat::defaultFormat(); |
||||||
|
fmt.setDepthBufferSize(24); |
||||||
QSurfaceFormat fmt; |
fmt.setSamples(8); |
||||||
fmt.setSamples(4); |
fmt.setSwapInterval(1); |
||||||
|
fmt.setVersion(3, 3); |
||||||
|
fmt.setProfile(QSurfaceFormat::CoreProfile); |
||||||
QSurfaceFormat::setDefaultFormat(fmt); |
QSurfaceFormat::setDefaultFormat(fmt); |
||||||
|
|
||||||
|
QApplication app(argc, argv); |
||||||
|
|
||||||
MainWindow w; |
MainWindow w; |
||||||
|
w.setWindowTitle("Pendulum Laboratory"); |
||||||
|
w.setWindowIcon(QIcon(":/icons/app_icon.ico")); |
||||||
w.show(); |
w.show(); |
||||||
|
|
||||||
|
w.simulationThread->start(); |
||||||
|
|
||||||
return QApplication::exec(); |
return QApplication::exec(); |
||||||
} |
} |
||||||
|
Loading…
Reference in new issue