Skip to content
Commits on Source (29)
Hide whitespace changes
Inline Side-by-side
COPYING deleted 100644 → 0
View file @ efd852af
Copyright © 2018-2019, VideoLAN and dav1d authors
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.
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.
LICENSE.md 0 → 100644
View file @ d260418a
### 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>.
README.md
View file @ d260418a
......@@ -18,9 +18,8 @@ In the future, this project will host simple tools or simple wrappings *(like, f
## License
**dav1d** is released under a very liberal license, a contrario from the other VideoLAN projects, so that it can be embedded anywhere, including non-open-source software; or even drivers, to allow the creation of hybrid decoders.
The reasoning behind this decision is the same as for libvorbis, see [RMS on vorbis](https://lwn.net/2001/0301/a/rms-ov-license.php3).
This fork of **dav1d** is released under the GNU GPL version 3 or, at your option, any later version.
Upstream is under the BSD 2-clause license.
# Roadmap
......@@ -62,7 +61,7 @@ See the [contributions document](CONTRIBUTING.md).
There is no CLA.
People will keep their copyright and their authorship rights, while adhering to the BSD 2-clause license.
People will keep their copyright and their authorship rights, while adhering to the GNU GPL.
VideoLAN will only have the collective work rights.
......
include/common/bitdepth.h
View file @ d260418a
......@@ -51,6 +51,7 @@ typedef int16_t coef;
#define HIGHBD_CALL_SUFFIX /* nothing */
#define HIGHBD_TAIL_SUFFIX /* nothing */
#define bitdepth_from_max(x) 8
#define bd_idx_from_max(x) 0
#elif BITDEPTH == 16
typedef uint16_t pixel;
typedef int32_t coef;
......@@ -65,6 +66,7 @@ static inline void pixel_set(pixel *const dst, const int val, const int num) {
#define HIGHBD_CALL_SUFFIX , f->bitdepth_max
#define HIGHBD_TAIL_SUFFIX , bitdepth_max
#define bitdepth_from_max(bitdepth_max) (32 - clz(bitdepth_max))
#define bd_idx_from_max(bitdepth_max) (bitdepth_max == 0xfff) + 1
#define bitfn(x) x##_16bpc
#define PXSTRIDE(x) (x >> 1)
#define highbd_only(x) x
......
include/dav1d/dav1d.h
View file @ d260418a
......@@ -65,7 +65,8 @@ typedef struct Dav1dSettings {
int operating_point; ///< select an operating point for scalable AV1 bitstreams (0 - 31)
int all_layers; ///< output all spatial layers of a scalable AV1 biststream
unsigned frame_size_limit; ///< maximum frame size, in pixels (0 = unlimited)
uint8_t reserved[32]; ///< reserved for future use
int gpu;
uint8_t reserved[28]; ///< reserved for future use
Dav1dPicAllocator allocator;
Dav1dLogger logger;
} Dav1dSettings;
......
include/dav1d/headers.h
View file @ d260418a
......@@ -88,10 +88,10 @@ typedef struct Dav1dWarpedMotionParams {
} Dav1dWarpedMotionParams;
enum Dav1dPixelLayout {
DAV1D_PIXEL_LAYOUT_I400, ///< monochrome
DAV1D_PIXEL_LAYOUT_I420, ///< 4:2:0 planar
DAV1D_PIXEL_LAYOUT_I422, ///< 4:2:2 planar
DAV1D_PIXEL_LAYOUT_I444, ///< 4:4:4 planar
DAV1D_PIXEL_LAYOUT_I400 = 0, ///< monochrome
DAV1D_PIXEL_LAYOUT_I420 = 1, ///< 4:2:0 planar
DAV1D_PIXEL_LAYOUT_I422 = 2, ///< 4:2:2 planar
DAV1D_PIXEL_LAYOUT_I444 = 3, ///< 4:4:4 planar
};
enum Dav1dFrameType {
......
meson.build
View file @ d260418a
......@@ -112,6 +112,8 @@ else
thread_compat_dep = []
endif
vulkan_dependency = dependency('vulkan')
# Header checks
......@@ -377,6 +379,30 @@ endif
glsl_compiler = find_program('glslangValidator')
shader_names = ['cdef', 'sgr', 'wiener']
bitdepths = ['8', '10', '12']
shaders = []
foreach n : shader_names
foreach bd : bitdepths
shaders += custom_target(
n + '_' + bd + 'bpc_shader.h',
output: n + '_' + bd + 'bpc_shader.h',
input: 'shaders/' + n + '.comp',
command: [
glsl_compiler,
'-DBITDEPTH=' + bd,
'-V',
'--vn', '@BASENAME@_' + bd + 'bpc_code',
'@INPUT@',
'-o', '@OUTPUT@',
],
)
endforeach
endforeach
#
# Include subdir meson.build files
# The order is important!
......
shaders/cdef.comp 0 → 100644
View file @ d260418a
/*
* Copyright © 2019 Pablo Stebler
*
* 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/>.
*/
#version 450
#extension GL_EXT_shader_8bit_storage: require
#extension GL_EXT_shader_16bit_storage: require
#if BITDEPTH == 8
#define pixel uint8_t
#else
#define pixel uint16_t
#endif
struct BlockParams {
int y_lvl;
int uv_lvl;
uint dir; // TODO uint8_t
uint variance;
};
layout (local_size_x_id = 0, local_size_y_id = 1) in;
layout (constant_id = 1) const uint BH = 8; // 8, 16
layout (constant_id = 2) const uint BSZ_IDX = 0; // 0, 1, 2
layout (constant_id = 3) const uint PL_IDX = 0; // 0: y, 1: u or v
const uint BSZX = BSZ_IDX == 0 ? 8 : 4;
const uint BSZY = BSZ_IDX == 2 ? 4 : 8;
const uint DIRS_422[8] = { 7, 0, 2, 4, 5, 6, 6, 6 };
const uint INT16_MAX = 32767;
const int cdef_directions[8 /* dir */][2 /* pass */] = { // TODO change to int8_t
{ -1 * 12 + 1, -2 * 12 + 2 },
{ 0 * 12 + 1, -1 * 12 + 2 },
{ 0 * 12 + 1, 0 * 12 + 2 },
{ 0 * 12 + 1, 1 * 12 + 2 },
{ 1 * 12 + 1, 2 * 12 + 2 },
{ 1 * 12 + 0, 2 * 12 + 1 },
{ 1 * 12 + 0, 2 * 12 + 0 },
{ 1 * 12 + 0, 2 * 12 - 1 },
};
layout (set = 0, binding = 0) readonly buffer Tmp {
uint16_t tmp[];
};
layout (set = 0, binding = 1) writeonly buffer Dst {
pixel dst[];
};
layout (set = 0, binding = 2) readonly buffer Params {
int bs;
int damping;
BlockParams bps[];
};
int apply_sign(const int v, const int s) {
return s < 0 ? -v : v;
}
int adjust_strength(const int strength, const uint var) {
if (!bool(var)) return 0;
const int i = bool(var >> 6) ? min(findMSB(var >> 6), 12) : 0;
return (strength * (4 + i) + 8) >> 4;
}
int constrain(const int diff, const int threshold, const int damping) {
if (!bool(threshold)) return 0;
const int shift = max(0, damping - findMSB(threshold));
return apply_sign(min(abs(diff), max(0, threshold - (abs(diff) >> shift))),
diff);
}
void main() {
const uint bx = gl_GlobalInvocationID.x;
const uint by = gl_GlobalInvocationID.y;
const uint byp = PL_IDX == 0 ? by : by & (BH - 1);
BlockParams bp = bps[bs * byp + bx];
const int lvl = PL_IDX == 0 ? bp.y_lvl : bp.uv_lvl;
if (lvl == 0) return;
int pri_lvl = (lvl >> 2) << (BITDEPTH - 8);
int sec_lvl = lvl & 3;
sec_lvl += int(sec_lvl == 3);
sec_lvl <<= (BITDEPTH - 8);
uint dir = bp.dir;
const uint variance = bp.variance;
if (BSZ_IDX == 1) dir = DIRS_422[dir];
if (pri_lvl == 0) dir = 0;
if (BSZ_IDX == 0) pri_lvl = adjust_strength(pri_lvl, variance);
const int pri_tap = 4 - ((pri_lvl >> (BITDEPTH - 8)) & 1);
const uint s = BSZX * bs + 4; // TODO rename
uint y_start = BSZY * by + 2;
if (PL_IDX == 1 && by >= BH) y_start += 4;
uint y_end = y_start + BSZY;
for (uint y = y_start; y < y_end; y++) {
for (uint x = BSZX * bx + 2; x < BSZX * bx + BSZX + 2; x++) {
int sum = 0;
const int px = int(tmp[s * y + x]);
int vmax = px, vmin = px;
int pri_tap_k = pri_tap;
for (int k = 0; k < 2; k++) {
const int off1 = cdef_directions[dir][k];
const int p0 = int(tmp[s * y + x + off1]);
const int p1 = int(tmp[s * y + x - off1]);
sum += pri_tap_k * constrain(p0 - px, pri_lvl, damping);
sum += pri_tap_k * constrain(p1 - px, pri_lvl, damping);
pri_tap_k -= (pri_tap_k << 1) - 6;
if (p0 != INT16_MAX) vmax = max(p0, vmax);
if (p1 != INT16_MAX) vmax = max(p1, vmax);
vmin = min(p0, vmin);
vmin = min(p1, vmin);
const int off2 = cdef_directions[(dir + 2) & 7][k];
const int s0 = int(tmp[s * y + x + off2]);
const int s1 = int(tmp[s * y + x - off2]);
const int off3 = cdef_directions[(dir + 6) & 7][k];
const int s2 = int(tmp[s * y + x + off3]);
const int s3 = int(tmp[s * y + x - off3]);
if (s0 != INT16_MAX) vmax = max(s0, vmax);
if (s1 != INT16_MAX) vmax = max(s1, vmax);
if (s2 != INT16_MAX) vmax = max(s2, vmax);
if (s3 != INT16_MAX) vmax = max(s3, vmax);
vmin = min(s0, vmin);
vmin = min(s1, vmin);
vmin = min(s2, vmin);
vmin = min(s3, vmin);
const int sec_tap = 2 - k;
sum += sec_tap * constrain(s0 - px, sec_lvl, damping);
sum += sec_tap * constrain(s1 - px, sec_lvl, damping);
sum += sec_tap * constrain(s2 - px, sec_lvl, damping);
sum += sec_tap * constrain(s3 - px, sec_lvl, damping);
}
dst[s * y + x] = pixel(clamp(px + ((8 + sum - int(sum < 0)) >> 4), vmin, vmax));
}
}
}
shaders/sgr.comp 0 → 100644
View file @ d260418a
/*
* Copyright © 2019 Pablo Stebler
*
* 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/>.
*/
#version 450
#extension GL_EXT_shader_explicit_arithmetic_types_int8: require
#extension GL_EXT_shader_explicit_arithmetic_types_int16: require
#if BITDEPTH == 8
#define pixel uint8_t
#else
#define pixel uint16_t
#endif
struct Params {
int16_t off;
int16_t s0;
int16_t s1;
int16_t w0;
int16_t w1;
};
layout (local_size_x_id = 0, local_size_y = 7) in;
layout (constant_id = 0) const uint SHM_STRIDE = 18; // k * 16 + 2
layout (constant_id = 1) const uint WSZY = 5; // 5, 10
const uint SHM_HEIGHT = 7 * WSZY;
const uint TMP_STRIDE = 48 * (SHM_STRIDE + 4);
const uint DST_STRIDE = 48 * SHM_STRIDE;
const int sgr_x_by_x[256] = int[256]( // TODO convert to uint8_t
255, 128, 85, 64, 51, 43, 37, 32, 28, 26, 23, 21, 20, 18, 17,
16, 15, 14, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9,
8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6,
6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
0
);
layout (set = 0, binding = 0) readonly buffer Tmp {
pixel tmp[(SHM_HEIGHT + 4) * TMP_STRIDE];
};
layout (set = 0, binding = 1) writeonly buffer Dst {
pixel dst[SHM_HEIGHT * DST_STRIDE];
};
layout (set = 0, binding = 2) readonly buffer ParamsArray {
Params params[48];
};
shared int A5[SHM_HEIGHT * SHM_STRIDE];
shared uint8_t B5[SHM_HEIGHT * SHM_STRIDE];
shared int A3[SHM_HEIGHT * SHM_STRIDE];
shared uint8_t B3[SHM_HEIGHT * SHM_STRIDE];
int boxsum3_row_a(uint x, uint y) {
uint ym = TMP_STRIDE * y;
return int(tmp[ym + x - 1]) * tmp[ym + x - 1] +
int(tmp[ym + x]) * tmp[ym + x] +
int(tmp[ym + x + 1]) * tmp[ym + x + 1];
}
int boxsum3_row_b(uint x, uint y) {
uint ym = TMP_STRIDE * y;
return int(tmp[ym + x - 1]) + tmp[ym + x] + tmp[ym + x + 1];
}
void boxsum3(uint xw, uint xl, uint x, uint y) {
int a = boxsum3_row_a(x, y + 1) +
boxsum3_row_a(x, y + 2) +
boxsum3_row_a(x, y + 3);
int b = boxsum3_row_b(x, y + 1) +
boxsum3_row_b(x, y + 2) +
boxsum3_row_b(x, y + 3);
int p = max(a * 9 - b * b, 0);
int z = (p * params[xw].s1 + (1 << 19)) >> 20;
int v = sgr_x_by_x[min(z, 255)];
A3[SHM_STRIDE * y + xl] = (v * b * 455 + (1 << 11)) >> 12;
B3[SHM_STRIDE * y + xl] = uint8_t(255 - v);
}
int boxsum5_row_a(uint x, uint y) {
uint ym = TMP_STRIDE * y;
return int(tmp[ym + x - 2]) * tmp[ym + x - 2] +
int(tmp[ym + x - 1]) * tmp[ym + x - 1] +
int(tmp[ym + x]) * tmp[ym + x] +
int(tmp[ym + x + 1]) * tmp[ym + x + 1] +
int(tmp[ym + x + 2]) * tmp[ym + x + 2];
}
int boxsum5_row_b(uint x, uint y) {
uint ym = TMP_STRIDE * y;
return int(tmp[ym + x - 2]) + tmp[ym + x - 1] + tmp[ym + x] +
tmp[ym + x + 1] + tmp[ym + x + 2];
}
void boxsum5(uint xw, uint xl, uint x, uint y) {
int a = boxsum5_row_a(x, y) +
boxsum5_row_a(x, y + 1) +
boxsum5_row_a(x, y + 2) +
boxsum5_row_a(x, y + 3) +
boxsum5_row_a(x, y + 4);
int b = boxsum5_row_b(x, y) +
boxsum5_row_b(x, y + 1) +
boxsum5_row_b(x, y + 2) +
boxsum5_row_b(x, y + 3) +
boxsum5_row_b(x, y + 4);
int p = max(a * 25 - b * b, 0);
int z = (p * params[xw].s0 + (1 << 19)) >> 20;
int v = sgr_x_by_x[min(z, 255)];
A5[SHM_STRIDE * y + xl] = (v * b * 164 + (1 << 11)) >> 12;
B5[SHM_STRIDE * y + xl] = uint8_t(255 - v);
}
int filter3(uint xl, uint x, uint y) {
uint ym = SHM_STRIDE * y;
uint ym0 = SHM_STRIDE * (y - 1);
uint ym1 = SHM_STRIDE * (y + 1);
int a0 = int(B3[ym + xl]) + B3[ym + xl - 1] + B3[ym + xl + 1] +
B3[ym0 + xl] + B3[ym1 + xl];
int a1 = int(B3[ym0 + xl - 1]) + B3[ym0 + xl + 1] + B3[ym1 + xl - 1] +
B3[ym1 + xl + 1];
int a = 4 * a0 + 3 * a1 + 4 * 5 + 3 * 4;
int b0 = A3[ym + xl] + A3[ym + xl - 1] + A3[ym + xl + 1] + A3[ym0 + xl] +
A3[ym1 + xl];
int b1 = A3[ym0 + xl - 1] + A3[ym0 + xl + 1] + A3[ym1 + xl - 1] +
A3[ym1 + xl + 1];
int b = 4 * b0 + 3 * b1;
return (a * tmp[TMP_STRIDE * (y + 2) + x] + b + (1 << 8)) >> 9;
}
int filter5(uint xl, uint x, uint y) {
uint ym = SHM_STRIDE * y;
uint ym0 = SHM_STRIDE * (y - 1);
uint ym1 = SHM_STRIDE * (y + 1);
if ((y & 1) == 1) {
int a0 = int(B5[ym0 + xl]) + B5[ym1 + xl];
int a1 = int(B5[ym0 + xl - 1]) + B5[ym0 + xl + 1] + B5[ym1 + xl - 1] +
B5[ym1 + xl + 1];
int a = 6 * a0 + 5 * a1 + 6 * 2 + 5 * 4;
int b0 = A5[ym0 + xl] + A5[ym1 + xl];
int b1 = A5[ym0 + xl - 1] + A5[ym0 + xl + 1] + A5[ym1 + xl - 1] +
A5[ym1 + xl + 1];
int b = 6 * b0 + 5 * b1;
return (a * tmp[TMP_STRIDE * (y + 2) + x] + b + (1 << 8)) >> 9;
}
int a0 = int(B5[ym + xl]);
int a1 = int(B5[ym + xl - 1]) + B5[ym + xl + 1];
int a = 6 * a0 + 5 * a1 + 6 + 5 * 2;
int b0 = A5[ym + xl];
int b1 = A5[ym + xl - 1] + A5[ym + xl + 1];
int b = 6 * b0 + 5 * b1;
return (a * tmp[TMP_STRIDE * (y + 2) + x] + b + (1 << 7)) >> 8;
}
void main() {
uint xw = gl_WorkGroupID.x;
uint xl = gl_LocalInvocationID.x;
uint x = (SHM_STRIDE + 4) * xw + xl + 2 + params[xw].off;
uint xo = SHM_STRIDE * xw + xl;
uint yw = gl_GlobalInvocationID.y;
uint y0 = WSZY * yw;
uint y1 = WSZY * yw + WSZY;
if (params[xw].s0 != -1) {
boxsum5(xw, xl, x, y0);
boxsum5(xw, xl, x, y0 + 1);
boxsum5(xw, xl, x, y0 + 2);
boxsum5(xw, xl, x, y0 + 3);
boxsum5(xw, xl, x, y0 + 4);
if (WSZY == 10) {
boxsum5(xw, xl, x, y0 + 5);
boxsum5(xw, xl, x, y0 + 6);
boxsum5(xw, xl, x, y0 + 7);
boxsum5(xw, xl, x, y0 + 8);
boxsum5(xw, xl, x, y0 + 9);
}
}
if (params[xw].s1 != -1) {
boxsum3(xw, xl, x, y0);
boxsum3(xw, xl, x, y0 + 1);
boxsum3(xw, xl, x, y0 + 2);
boxsum3(xw, xl, x, y0 + 3);
boxsum3(xw, xl, x, y0 + 4);
if (WSZY == 10) {
boxsum3(xw, xl, x, y0 + 5);
boxsum3(xw, xl, x, y0 + 6);
boxsum3(xw, xl, x, y0 + 7);
boxsum3(xw, xl, x, y0 + 8);
boxsum3(xw, xl, x, y0 + 9);
}
}
memoryBarrierShared();
barrier();
if (params[xw].s0 == -1) {
#define filter3_only(y)\
t = filter3(xl, x, y);\
u = int(tmp[TMP_STRIDE * (y + 2) + x]) << 4;\
v = (u << 7) + params[xw].w1 * (t - u);\
dst[DST_STRIDE * (y) + xo] = pixel(clamp((v + (1 << 10)) >> 11, 0, 255));
int t, u, v;
filter3_only(y0);
filter3_only(y0 + 1);
filter3_only(y0 + 2);
filter3_only(y0 + 3);
filter3_only(y0 + 4);
if (WSZY == 10) {
filter3_only(y0 + 5);
filter3_only(y0 + 6);
filter3_only(y0 + 7);
filter3_only(y0 + 8);
filter3_only(y0 + 9);
}
#undef filter3_only
} else if (params[xw].s1 == -1) {
#define filter5_only(y)\
t = filter5(xl, x, y);\
u = int(tmp[TMP_STRIDE * (y + 2) + x]) << 4;\
v = (u << 7) + params[xw].w0 * (t - u);\
dst[DST_STRIDE * (y) + xo] = pixel(clamp((v + (1 << 10)) >> 11, 0, 255));
int t, u, v;
filter5_only(y0);
filter5_only(y0 + 1);
filter5_only(y0 + 2);
filter5_only(y0 + 3);
filter5_only(y0 + 4);
if (WSZY == 10) {
filter5_only(y0 + 5);
filter5_only(y0 + 6);
filter5_only(y0 + 7);
filter5_only(y0 + 8);
filter5_only(y0 + 9);
}
#undef filter5_only
} else {
#define filter_both(y)\
t5 = filter5(xl, x, y);\
t3 = filter3(xl, x, y);\
u = int(tmp[TMP_STRIDE * (y + 2) + x]) << 4;\
v = (u << 7) + params[xw].w0 * (t5 - u) + params[xw].w1 * (t3 - u);\
dst[DST_STRIDE * (y) + xo] = pixel(clamp((v + (1 << 10)) >> 11, 0, 255));
int t5, t3, u, v;
filter_both(y0);
filter_both(y0 + 1);
filter_both(y0 + 2);
filter_both(y0 + 3);
filter_both(y0 + 4);
if (WSZY == 10) {
filter_both(y0 + 5);
filter_both(y0 + 6);
filter_both(y0 + 7);
filter_both(y0 + 8);
filter_both(y0 + 9);
}
#undef filter_both
}
}
shaders/t.txt 0 → 100644
View file @ d260418a
2 - 131 --> 3 - 130 --> 0 - 127
130 - 259 --> 131 - 258 --> 128 - 255
136 - 265 --> 137 - 264 --> 134 - 261
A5: 4
B5: 1
A3: 4
B3: 1
tot: 10
shaders/wiener.comp 0 → 100644
View file @ d260418a
/*
* Copyright © 2019 Pablo Stebler
*
* 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/>.
*/
#version 450
#extension GL_EXT_shader_8bit_storage: require
#extension GL_EXT_shader_explicit_arithmetic_types_int16: require
#if BITDEPTH == 8
#define pixel uint8_t
#else
#define pixel uint16_t
#endif
struct Params {
int16_t off;
int16_t filterh[7];
int16_t filterv[7];
};
layout (local_size_x_id = 0, local_size_y = 7) in;
layout (constant_id = 0) const uint SHM_STRIDE = 16; // k * 16, <= 384
layout (constant_id = 1) const uint WSZY = 6; // 6, 10
const uint SHM_HEIGHT = 7 * WSZY;
const uint TMP_STRIDE = 48 * (SHM_STRIDE + 6);
layout (set = 0, binding = 0) readonly buffer Tmp {
pixel tmp[SHM_HEIGHT * TMP_STRIDE];
};
layout (set = 0, binding = 1) writeonly buffer Dst {
pixel dst[SHM_HEIGHT * TMP_STRIDE];
};
layout (set = 0, binding = 2) readonly buffer ParamsArray {
Params params[48];
};
shared uint16_t hor[SHM_HEIGHT * SHM_STRIDE];
#if BITDEPTH == 8
const int bitdepth_max = 0xff;
#elif BITDEPTH == 10
const int bitdepth_max = 0x3ff;
#else
const int bitdepth_max = 0xfff;
#endif
const int round_bits_h = 3 + int(BITDEPTH == 12) * 2;
const int rounding_off_h = 1 << (round_bits_h - 1);
const int clip_limit = 1 << (BITDEPTH + 1 + 7 - round_bits_h);
const int round_bits_v = 11 - int(BITDEPTH == 12) * 2;
const int rounding_off_v = 1 << (round_bits_v - 1);
const int round_offset = 1 << (BITDEPTH + (round_bits_v - 1));
void hor_pass(uint xw, uint xl, uint x, uint y) {
const uint ym = TMP_STRIDE * y;
int sum = (int(tmp[ym + x + 3]) << 7) + (1 << (BITDEPTH + 6));
sum += int(tmp[ym + x]) * params[xw].filterh[0];
sum += int(tmp[ym + x + 1]) * params[xw].filterh[1];
sum += int(tmp[ym + x + 2]) * params[xw].filterh[2];
sum += int(tmp[ym + x + 3]) * params[xw].filterh[3];
sum += int(tmp[ym + x + 4]) * params[xw].filterh[4];
sum += int(tmp[ym + x + 5]) * params[xw].filterh[5];
sum += int(tmp[ym + x + 6]) * params[xw].filterh[6];
const uint v = clamp((sum + rounding_off_h) >> round_bits_h, 0, clip_limit - 1);
hor[(y << 6) + xl] = uint16_t(v);
}
void ver_pass(uint xw, uint xl, uint x, uint y) {
const uint ym = y << 6;
int sum = (int(hor[ym + SHM_STRIDE * 3 + xl]) << 7) - round_offset;
sum += int(hor[ym + xl]) * params[xw].filterv[0];
sum += int(hor[ym + SHM_STRIDE + xl]) * params[xw].filterv[1];
sum += int(hor[ym + SHM_STRIDE * 2 + xl]) * params[xw].filterv[2];
sum += int(hor[ym + SHM_STRIDE * 3 + xl]) * params[xw].filterv[3];
sum += int(hor[ym + SHM_STRIDE * 4 + xl]) * params[xw].filterv[4];
sum += int(hor[ym + SHM_STRIDE * 5 + xl]) * params[xw].filterv[5];
sum += int(hor[ym + SHM_STRIDE * 6 + xl]) * params[xw].filterv[6];
const uint v = clamp((sum + rounding_off_v) >> round_bits_v, 0, bitdepth_max);
dst[TMP_STRIDE * y + x] = pixel(v);
}
void main() {
const uint xw = gl_WorkGroupID.x;
const uint xl = gl_LocalInvocationID.x;
const uint x = SHM_HEIGHT * xw + xl + params[xw].off;
const uint yw = gl_GlobalInvocationID.y;
hor_pass(xw, xl, x, WSZY * yw);
hor_pass(xw, xl, x, WSZY * yw + 1);
hor_pass(xw, xl, x, WSZY * yw + 2);
hor_pass(xw, xl, x, WSZY * yw + 3);
hor_pass(xw, xl, x, WSZY * yw + 4);
hor_pass(xw, xl, x, WSZY * yw + 5);
if (WSZY == 10) {
hor_pass(xw, xl, x, WSZY * yw + 6);
hor_pass(xw, xl, x, WSZY * yw + 7);
hor_pass(xw, xl, x, WSZY * yw + 8);
hor_pass(xw, xl, x, WSZY * yw + 9);
}
memoryBarrierShared();
barrier();
ver_pass(xw, xl, x, WSZY * yw);
ver_pass(xw, xl, x, WSZY * yw + 1);
ver_pass(xw, xl, x, WSZY * yw + 2);
ver_pass(xw, xl, x, WSZY * yw + 3);
ver_pass(xw, xl, x, WSZY * yw + 4);
ver_pass(xw, xl, x, WSZY * yw + 5);
if (WSZY == 10) {
ver_pass(xw, xl, x, WSZY * yw + 6);
ver_pass(xw, xl, x, WSZY * yw + 7);
ver_pass(xw, xl, x, WSZY * yw + 8);
ver_pass(xw, xl, x, WSZY * yw + 9);
}
}
src/cdef.h
View file @ d260418a
......@@ -46,6 +46,13 @@ typedef const pixel (*const_left_pixel_row_2px)[2];
typedef const void *const_left_pixel_row_2px;
#endif
#ifdef BITDEPTH
bitfn_decls(void dav1d_cdef_padding, uint16_t *tmp, const ptrdiff_t tmp_stride,
const pixel *src, const ptrdiff_t src_stride,
const pixel (*left)[2], pixel *const top[2],
const int w, const int h, const enum CdefEdgeFlags edges);
#endif
// CDEF operates entirely on pre-filter data; if bottom/right edges are
// present (according to $edges), then the pre-filter data is located in
// $dst. However, the edge pixels above $dst may be post-filter, so in
......
src/cdef_apply_tmpl.c
View file @ d260418a
......@@ -27,6 +27,7 @@
#include "config.h"
#include <stdio.h>
#include <string.h>
#include "common/intops.h"
......@@ -85,6 +86,11 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
const Av1Filter *const lflvl,
const int by_start, const int by_end)
{
/*struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t0 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;*/
int count = 0;
const int bitdepth_min_8 = BITDEPTH == 8 ? 0 : f->cur.p.bpc - 8;
const Dav1dDSPContext *const dsp = f->dsp;
enum CdefEdgeFlags edges = CDEF_HAVE_BOTTOM | (by_start > 0 ? CDEF_HAVE_TOP : 0);
......@@ -118,7 +124,7 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
edges &= ~CDEF_HAVE_LEFT;
edges |= CDEF_HAVE_RIGHT;
for (int sbx = 0, last_skip = 1; sbx < sb64w; sbx++, edges |= CDEF_HAVE_LEFT) {
const int sb128x = sbx >>1;
const int sb128x = sbx >> 1;
const int sb64_idx = ((by & sbsz) >> 3) + (sbx & 1);
const int cdef_idx = lflvl[sb128x].cdef_idx[sb64_idx];
if (cdef_idx == -1 ||
......@@ -141,6 +147,7 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
// go to the next block
const unsigned bx_mask = 3U << (bx & 14);
const int by_idx = by & 30, bx_idx = (bx & 16) >> 4;
//printf("%d %d %d %d %d\n", sb128x, bx, bx_idx, by_idx, bx_mask);
if (!((lflvl[sb128x].noskip_mask[by_idx + 0][bx_idx] |
lflvl[sb128x].noskip_mask[by_idx + 1][bx_idx]) & bx_mask))
{
......@@ -171,6 +178,7 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
const int dir = dsp->cdef.dir(bptrs[0], f->cur.stride[0],
&variance HIGHBD_CALL_SUFFIX);
if (y_lvl) {
count++;
dsp->cdef.fb[0](bptrs[0], f->cur.stride[0], lr_bak[bit][0],
(pixel *const [2]) {
&f->lf.cdef_line_ptr[tf][0][0][bx * 4],
......@@ -181,10 +189,11 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
damping, edges HIGHBD_CALL_SUFFIX);
}
if (uv_lvl && has_chroma) {
const int uvdir =
const int uvdir = // TODO uv_dir
f->cur.p.layout != DAV1D_PIXEL_LAYOUT_I422 ? dir :
((uint8_t[]) { 7, 0, 2, 4, 5, 6, 6, 6 })[dir];
for (int pl = 1; pl <= 2; pl++) {
count++;
dsp->cdef.fb[uv_idx](bptrs[pl], f->cur.stride[1],
lr_bak[bit][pl],
(pixel *const [2]) {
......@@ -211,10 +220,37 @@ void bytefn(dav1d_cdef_brow)(Dav1dFrameContext *const f,
iptrs[1] += sbsz * 4 >> ss_hor;
iptrs[2] += sbsz * 4 >> ss_hor;
}
if (count) {
/*for (int j = 0; j < 8; j++) {
for (int i = 0; i < 4; i++) {
for (int k = 0; k < 8; k++) {
printf("%02x ", ptrs[0][f->cur.stride[0] * j + 8 * i + k]);
}
printf(" ");
}
puts("");
}*/
/*for (int pl = 2; pl <= 2; pl++) {
for (int j = 0; j < 4; j++) {
for (int i = 0; i < 8; i++) {
for (int k = 0; k < 4; k++) {
printf("%02x ", ptrs[pl][f->cur.stride[1] * j + 4 * i + k]);
}
printf(" ");
}
puts("");
}
puts("");
}*/
}
ptrs[0] += 8 * PXSTRIDE(f->cur.stride[0]);
ptrs[1] += 8 * PXSTRIDE(f->cur.stride[1]) >> ss_ver;
ptrs[2] += 8 * PXSTRIDE(f->cur.stride[1]) >> ss_ver;
f->lf.top_pre_cdef_toggle ^= 1;
}
/*clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t1 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;
if (count) printf("cdef %d %d %d %lu\n", by_start, by_end, count, t1 - t0);*/
}
src/cdef_tmpl.c
View file @ d260418a
......@@ -53,11 +53,11 @@ static inline void fill(uint16_t *tmp, const ptrdiff_t stride,
}
}
static void padding(uint16_t *tmp, const ptrdiff_t tmp_stride,
const pixel *src, const ptrdiff_t src_stride,
const pixel (*left)[2], pixel *const top[2],
const int w, const int h,
const enum CdefEdgeFlags edges)
void bitfn(dav1d_cdef_padding)(uint16_t *tmp, const ptrdiff_t tmp_stride,
const pixel *src, const ptrdiff_t src_stride,
const pixel (*left)[2], pixel *const top[2],
const int w, const int h,
const enum CdefEdgeFlags edges)
{
// fill extended input buffer
int x_start = -2, x_end = w + 2, y_start = -2, y_end = h + 2;
......@@ -117,7 +117,7 @@ cdef_filter_block_c(pixel *dst, const ptrdiff_t dst_stride,
const int bitdepth_min_8 = bitdepth_from_max(bitdepth_max) - 8;
const int pri_tap = 4 - ((pri_strength >> bitdepth_min_8) & 1);
padding(tmp, tmp_stride, dst, dst_stride, left, top, w, h, edges);
bitfn(dav1d_cdef_padding)(tmp, tmp_stride, dst, dst_stride, left, top, w, h, edges);
// run actual filter
for (int y = 0; y < h; y++) {
......
src/decode.c
View file @ d260418a
......@@ -49,6 +49,7 @@
#include "src/tables.h"
#include "src/thread_task.h"
#include "src/warpmv.h"
#include "src/vk/init.h"
static void init_quant_tables(const Dav1dSequenceHeader *const seq_hdr,
const Dav1dFrameHeader *const frame_hdr,
......
src/internal.h
View file @ d260418a
......@@ -29,6 +29,7 @@
#define DAV1D_SRC_INTERNAL_H
#include <stdatomic.h>
#include <vulkan/vulkan.h>
#include "dav1d/data.h"
......@@ -130,9 +131,18 @@ struct Dav1dContext {
unsigned frame_size_limit;
int drain;
int gpu;
Dav1dLogger logger;
};
enum Dav1dVkState {
DAV1D_VK_STATE_UNKNOWN = 0,
DAV1D_VK_STATE_DISABLED,
DAV1D_VK_STATE_ENABLED,
DAV1D_VK_STATE_OUTDATED, // only for cdef
} state;
struct Dav1dFrameContext {
Dav1dRef *seq_hdr_ref;
Dav1dSequenceHeader *seq_hdr;
......@@ -238,6 +248,78 @@ struct Dav1dFrameContext {
int titsati_sz, titsati_init[3];
int inited;
} tile_thread;
struct VkContext { // TODO Vk should be a suffix to avoid potential collision
int enabled;
uint32_t max_csms;
uint32_t max_cwgs;
VkDevice device;
VkQueue queue;
pthread_mutex_t *queue_lock;
uint32_t memory_type_index;
VkPipelineLayout pipeline_layout;
VkCommandPool command_pool;
VkFence fence;
struct VkCdefContext {
enum Dav1dVkState state;
VkBuffer buffers[5];
VkDeviceMemory memory;
VkShaderModule shader_module;
VkPipeline pipelines[2];
VkDescriptorSet descriptor_sets[2];
VkCommandBuffer command_buffers[2];
uint16_t *tmp_y;
pixel *dst_y;
int32_t *bs;
int32_t *damping;
struct VkCdefBlockParams {
int y_lvl;
int uv_lvl;
unsigned dir;
unsigned variance;
} *bps;
uint16_t *tmp_uv;
pixel *dst_uv;
uint32_t tmp_y_stride;
uint32_t tmp_uv_stride;
} cdef[3 /* bitdepth */][2 /* height */][3 /* layout */];
struct VkLrContext {
enum Dav1dVkState state;
VkBuffer buffers[3];
VkDeviceMemory memory;
VkShaderModule shader_module;
VkPipeline pipeline;
VkDescriptorSet descriptor_set;
VkCommandBuffer command_buffer;
pixel *tmp;
pixel *dst;
void *params;
uint32_t shm_stride;
uint32_t tmp_stride;
struct VkLrUnit {
int w;
int h;
pixel *p;
ptrdiff_t p_stride; // TODO always the same?
int start; // TODO remove
} units[48];
int bx; // TODO uint8_t
} lr[2 /* type */][3 /* bitdepth */][2 /* height */];
} vk;
};
struct VkWienerParams {
int16_t offset;
int16_t filterh[7];
int16_t filterv[7];
};
struct VkSgrParams {
int16_t offset;
int16_t s0;
int16_t s1;
int16_t w0;
int16_t w1;
};
struct Dav1dTileState {
......
src/lib.c
View file @ d260418a
......@@ -45,6 +45,7 @@
#include "src/thread_task.h"
#include "src/wedge.h"
#include "src/film_grain.h"
#include "src/vk/init.h"
static COLD void init_internal(void) {
dav1d_init_wedge_masks();
......@@ -68,6 +69,7 @@ COLD void dav1d_default_settings(Dav1dSettings *const s) {
s->operating_point = 0;
s->all_layers = 1; // just until the tests are adjusted
s->frame_size_limit = 0;
s->gpu = 0;
}
static void close_internal(Dav1dContext **const c_out, int flush);
......@@ -128,6 +130,7 @@ COLD int dav1d_open(Dav1dContext **const c_out, const Dav1dSettings *const s) {
memset(c->frame_thread.out_delayed, 0,
sizeof(*c->frame_thread.out_delayed) * c->n_fc);
}
if (s->gpu && init_vk(c)) goto error;
for (int n = 0; n < s->n_frame_threads; n++) {
Dav1dFrameContext *const f = &c->fc[n];
f->c = c;
......
src/looprestoration.h
View file @ d260418a
......@@ -46,6 +46,13 @@ typedef const pixel (*const_left_pixel_row)[4];
typedef const void *const_left_pixel_row;
#endif
#ifdef BITDEPTH
bitfn_decls(void dav1d_lr_padding, pixel *dst, const ptrdiff_t dst_stride,
const pixel *p, const ptrdiff_t p_stride, const pixel (*left)[4],
const pixel *lpf, const ptrdiff_t lpf_stride,
int unit_w, const int stripe_h, const enum LrEdgeFlags edges);
#endif
// Although the spec applies restoration filters over 4x4 blocks, the wiener
// filter can be applied to a bigger surface.
// * w is constrained by the restoration unit size (w <= 256)
......
src/looprestoration_tmpl.c
View file @ d260418a
......@@ -27,6 +27,7 @@
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include "common/intops.h"
......@@ -39,10 +40,12 @@
// TODO Reuse p when no padding is needed (add and remove lpf pixels in p)
// TODO Chroma only requires 2 rows of padding.
static void padding(pixel *dst, const pixel *p, const ptrdiff_t p_stride,
const pixel (*left)[4],
const pixel *lpf, const ptrdiff_t lpf_stride,
int unit_w, const int stripe_h, const enum LrEdgeFlags edges)
void bitfn(dav1d_lr_padding)(pixel *dst, const ptrdiff_t dst_stride,
const pixel *p, const ptrdiff_t p_stride,
const pixel (*left)[4],
const pixel *lpf, const ptrdiff_t lpf_stride,
int unit_w, const int stripe_h,
const enum LrEdgeFlags edges)
{
const int have_left = !!(edges & LR_HAVE_LEFT);
const int have_right = !!(edges & LR_HAVE_RIGHT);
......@@ -58,45 +61,45 @@ static void padding(pixel *dst, const pixel *p, const ptrdiff_t p_stride,
const pixel *const above_1 = lpf;
const pixel *const above_2 = above_1 + PXSTRIDE(lpf_stride);
pixel_copy(dst_l, above_1, unit_w);
pixel_copy(dst_l + REST_UNIT_STRIDE, above_1, unit_w);
pixel_copy(dst_l + 2 * REST_UNIT_STRIDE, above_2, unit_w);
pixel_copy(dst_l + dst_stride, above_1, unit_w);
pixel_copy(dst_l + 2 * dst_stride, above_2, unit_w);
} else {
// Pad with first row
pixel_copy(dst_l, p, unit_w);
pixel_copy(dst_l + REST_UNIT_STRIDE, p, unit_w);
pixel_copy(dst_l + 2 * REST_UNIT_STRIDE, p, unit_w);
pixel_copy(dst_l + dst_stride, p, unit_w);
pixel_copy(dst_l + 2 * dst_stride, p, unit_w);
if (have_left) {
pixel_copy(dst_l, &left[0][1], 3);
pixel_copy(dst_l + REST_UNIT_STRIDE, &left[0][1], 3);
pixel_copy(dst_l + 2 * REST_UNIT_STRIDE, &left[0][1], 3);
pixel_copy(dst_l + dst_stride, &left[0][1], 3);
pixel_copy(dst_l + 2 * dst_stride, &left[0][1], 3);
}
}
pixel *dst_tl = dst_l + 3 * REST_UNIT_STRIDE;
pixel *dst_tl = dst_l + 3 * dst_stride;
if (edges & LR_HAVE_BOTTOM) {
// Copy next loop filtered rows
const pixel *const below_1 = lpf + 6 * PXSTRIDE(lpf_stride);
const pixel *const below_2 = below_1 + PXSTRIDE(lpf_stride);
pixel_copy(dst_tl + stripe_h * REST_UNIT_STRIDE, below_1, unit_w);
pixel_copy(dst_tl + (stripe_h + 1) * REST_UNIT_STRIDE, below_2, unit_w);
pixel_copy(dst_tl + (stripe_h + 2) * REST_UNIT_STRIDE, below_2, unit_w);
pixel_copy(dst_tl + stripe_h * dst_stride, below_1, unit_w);
pixel_copy(dst_tl + (stripe_h + 1) * dst_stride, below_2, unit_w);
pixel_copy(dst_tl + (stripe_h + 2) * dst_stride, below_2, unit_w);
} else {
// Pad with last row
const pixel *const src = p + (stripe_h - 1) * PXSTRIDE(p_stride);
pixel_copy(dst_tl + stripe_h * REST_UNIT_STRIDE, src, unit_w);
pixel_copy(dst_tl + (stripe_h + 1) * REST_UNIT_STRIDE, src, unit_w);
pixel_copy(dst_tl + (stripe_h + 2) * REST_UNIT_STRIDE, src, unit_w);
pixel_copy(dst_tl + stripe_h * dst_stride, src, unit_w);
pixel_copy(dst_tl + (stripe_h + 1) * dst_stride, src, unit_w);
pixel_copy(dst_tl + (stripe_h + 2) * dst_stride, src, unit_w);
if (have_left) {
pixel_copy(dst_tl + stripe_h * REST_UNIT_STRIDE, &left[stripe_h - 1][1], 3);
pixel_copy(dst_tl + (stripe_h + 1) * REST_UNIT_STRIDE, &left[stripe_h - 1][1], 3);
pixel_copy(dst_tl + (stripe_h + 2) * REST_UNIT_STRIDE, &left[stripe_h - 1][1], 3);
pixel_copy(dst_tl + stripe_h * dst_stride, &left[stripe_h - 1][1], 3);
pixel_copy(dst_tl + (stripe_h + 1) * dst_stride, &left[stripe_h - 1][1], 3);
pixel_copy(dst_tl + (stripe_h + 2) * dst_stride, &left[stripe_h - 1][1], 3);
}
}
// Inner UNIT_WxSTRIPE_H
for (int j = 0; j < stripe_h; j++) {
pixel_copy(dst_tl + 3 * have_left, p + 3 * have_left, unit_w - 3 * have_left);
dst_tl += REST_UNIT_STRIDE;
dst_tl += dst_stride;
p += PXSTRIDE(p_stride);
}
......@@ -106,8 +109,8 @@ static void padding(pixel *dst, const pixel *p, const ptrdiff_t p_stride,
// Pad 3x(STRIPE_H+6) with last column
for (int j = 0; j < stripe_h + 6; j++) {
pixel_set(pad, *row_last, 3);
pad += REST_UNIT_STRIDE;
row_last += REST_UNIT_STRIDE;
pad += dst_stride;
row_last += dst_stride;
}
}
......@@ -115,14 +118,14 @@ static void padding(pixel *dst, const pixel *p, const ptrdiff_t p_stride,
// Pad 3x(STRIPE_H+6) with first column
for (int j = 0; j < stripe_h + 6; j++) {
pixel_set(dst, *dst_l, 3);
dst += REST_UNIT_STRIDE;
dst_l += REST_UNIT_STRIDE;
dst += dst_stride;
dst_l += dst_stride;
}
} else {
dst += 3 * REST_UNIT_STRIDE;
dst += 3 * dst_stride;
for (int j = 0; j < stripe_h; j++) {
pixel_copy(dst, &left[j][1], 3);
dst += REST_UNIT_STRIDE;
dst += dst_stride;
}
}
}
......@@ -143,11 +146,12 @@ static void wiener_c(pixel *p, const ptrdiff_t p_stride,
pixel tmp[70 /*(64 + 3 + 3)*/ * REST_UNIT_STRIDE];
pixel *tmp_ptr = tmp;
padding(tmp, p, p_stride, left, lpf, lpf_stride, w, h, edges);
bitfn(dav1d_lr_padding)(tmp, REST_UNIT_STRIDE, p, p_stride, left, lpf,
lpf_stride, w, h, edges);
// Values stored between horizontal and vertical filtering don't
// fit in a uint8_t.
uint16_t hor[70 /*(64 + 3 + 3)*/ * REST_UNIT_STRIDE];
uint16_t hor[70 /*(64 + 3 + 3)*/ * REST_UNIT_STRIDE]; // TODO 384?
uint16_t *hor_ptr = hor;
const int bitdepth = bitdepth_from_max(bitdepth_max);
......@@ -184,6 +188,19 @@ static void wiener_c(pixel *p, const ptrdiff_t p_stride,
iclip_pixel((sum + rounding_off_v) >> round_bits_v);
}
}
/*for (int j = 0; j < 12; j++) {
for (int i = 0; i < 20; i++) {
printf("%04x ", hor[j * REST_UNIT_STRIDE + i]);
}
puts("");
}*/
/*puts("");
for (int j = 0; j < 8; j++) {
for (int i = 0; i < 24; i++) {
printf("%02x ", p[j * PXSTRIDE(p_stride) + i]);
}
puts("");
}*/
}
// Sum over a 3x3 area
......@@ -455,6 +472,12 @@ static void selfguided_filter(coef *dst, const pixel *src,
AA += step * REST_UNIT_STRIDE;
BB += step * REST_UNIT_STRIDE;
}
/*for (int j = 0; j < 8; j++) {
for (int i = 0; i < 24; i++) {
printf("%02x ", A[j * REST_UNIT_STRIDE + i] & 0xff);
}
puts("");
}*/
src += 3 * REST_UNIT_STRIDE + 3;
if (n == 25) {
......@@ -522,17 +545,20 @@ static void selfguided_c(pixel *p, const ptrdiff_t p_stride,
// of padding above and below
pixel tmp[70 /*(64 + 3 + 3)*/ * REST_UNIT_STRIDE];
padding(tmp, p, p_stride, left, lpf, lpf_stride, w, h, edges);
bitfn(dav1d_lr_padding)(tmp, REST_UNIT_STRIDE, p, p_stride, left, lpf,
lpf_stride, w, h, edges);
// Selfguided filter outputs to a maximum stripe height of 64 and a
// maximum restoration width of 384 (256 * 1.5)
coef dst[64 * 384];
pixel *pp = p;
// both r1 and r0 can't be zero
if (!dav1d_sgr_params[sgr_idx][0]) {
const int s1 = dav1d_sgr_params[sgr_idx][3];
selfguided_filter(dst, tmp, REST_UNIT_STRIDE, w, h, 9, s1 HIGHBD_TAIL_SUFFIX);
const int w1 = (1 << 7) - sgr_w[1];
//printf("%d\n", w1);
for (int j = 0; j < h; j++) {
for (int i = 0; i < w; i++) {
const int u = (p[i] << 4);
......@@ -545,6 +571,7 @@ static void selfguided_c(pixel *p, const ptrdiff_t p_stride,
const int s0 = dav1d_sgr_params[sgr_idx][2];
selfguided_filter(dst, tmp, REST_UNIT_STRIDE, w, h, 25, s0 HIGHBD_TAIL_SUFFIX);
const int w0 = sgr_w[0];
//printf("%d\n", w0);
for (int j = 0; j < h; j++) {
for (int i = 0; i < w; i++) {
const int u = (p[i] << 4);
......@@ -559,6 +586,7 @@ static void selfguided_c(pixel *p, const ptrdiff_t p_stride,
const int s1 = dav1d_sgr_params[sgr_idx][3];
const int w0 = sgr_w[0];
const int w1 = (1 << 7) - w0 - sgr_w[1];
//printf("%d %d\n", w0, w1);
selfguided_filter(dst, tmp, REST_UNIT_STRIDE, w, h, 25, s0 HIGHBD_TAIL_SUFFIX);
selfguided_filter(dst1, tmp, REST_UNIT_STRIDE, w, h, 9, s1 HIGHBD_TAIL_SUFFIX);
for (int j = 0; j < h; j++) {
......@@ -571,6 +599,14 @@ static void selfguided_c(pixel *p, const ptrdiff_t p_stride,
p += PXSTRIDE(p_stride);
}
}
/*puts("");
printf("%d %d\n", dav1d_sgr_params[sgr_idx][2], dav1d_sgr_params[sgr_idx][3]);
for (int j = 0; j < 8; j++) {
for (int i = 24; i < 48; i++) {
printf("%02x ", pp[j * PXSTRIDE(p_stride) + i]);
}
puts("");
}*/
}
COLD void bitfn(dav1d_loop_restoration_dsp_init)(Dav1dLoopRestorationDSPContext *const c) {
......
src/lr_apply_tmpl.c
View file @ d260418a
......@@ -28,10 +28,12 @@
#include "config.h"
#include <stdio.h>
#include <time.h>
#include "common/intops.h"
#include "src/lr_apply.h"
#include "src/vk/looprestoration.h"
enum LrRestorePlanes {
LR_RESTORE_Y = 1 << 0,
......@@ -149,11 +151,13 @@ void bytefn(dav1d_lr_copy_lpf)(Dav1dFrameContext *const f,
}
}
static void lr_stripe(const Dav1dFrameContext *const f, pixel *p,
static void lr_stripe(Dav1dFrameContext *const f, pixel *p,
const pixel (*left)[4], int x, int y,
const int plane, const int unit_w, const int row_h,
const Av1RestorationUnit *const lr, enum LrEdgeFlags edges)
{
static uint64_t ttt_w = 0; // TODO remove
static uint64_t ttt_s = 0; // TODO remove
const Dav1dDSPContext *const dsp = f->dsp;
const int chroma = !!plane;
const int ss_ver = chroma & (f->sr_cur.p.p.layout == DAV1D_PIXEL_LAYOUT_I420);
......@@ -187,12 +191,46 @@ static void lr_stripe(const Dav1dFrameContext *const f, pixel *p,
edges |= LR_HAVE_BOTTOM;
}
if (lr->type == DAV1D_RESTORATION_WIENER) {
dsp->lr.wiener(p, p_stride, left, lpf, lpf_stride, unit_w, stripe_h,
filterh, filterv, edges HIGHBD_CALL_SUFFIX);
struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t0 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;
int vk = f->vk.enabled;
if (vk) {
if (bitfn(wiener_vk)(&f->vk, p, p_stride, left, lpf, lpf_stride,
unit_w, stripe_h, filterh, filterv, edges
HIGHBD_CALL_SUFFIX)) {
vk = 0;
}
}
if (!vk) {
dsp->lr.wiener(p, p_stride, left, lpf, lpf_stride, unit_w,
stripe_h, filterh, filterv, edges
HIGHBD_CALL_SUFFIX);
}
clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t1 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;
ttt_w += t1 - t0;
//printf("wiener %d %d %lu %lu\n", unit_w, stripe_h, t1 - t0, ttt_w);
} else {
assert(lr->type == DAV1D_RESTORATION_SGRPROJ);
dsp->lr.selfguided(p, p_stride, left, lpf, lpf_stride, unit_w, stripe_h,
lr->sgr_idx, lr->sgr_weights, edges HIGHBD_CALL_SUFFIX);
struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t0 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;
int vk = f->vk.enabled;
if (vk) {
if (bitfn(sgr_vk)(&f->vk, p, p_stride, left, lpf, lpf_stride, unit_w, stripe_h,
lr->sgr_idx, lr->sgr_weights, edges HIGHBD_CALL_SUFFIX)) {
vk = 0;
}
}
if (!vk) {
dsp->lr.selfguided(p, p_stride, left, lpf, lpf_stride, unit_w, stripe_h,
lr->sgr_idx, lr->sgr_weights, edges HIGHBD_CALL_SUFFIX);
}
clock_gettime(CLOCK_MONOTONIC, &ts);
uint64_t t1 = 1000000000ULL * ts.tv_sec + ts.tv_nsec;
ttt_s += t1 - t0;
//printf("sgr %d %d %lu %lu\n", unit_w, stripe_h, t1 - t0, ttt_s);
}
left += stripe_h;
......@@ -213,7 +251,7 @@ static void backup4xU(pixel (*dst)[4], const pixel *src, const ptrdiff_t src_str
pixel_copy(dst, src, 4);
}
static void lr_sbrow(const Dav1dFrameContext *const f, pixel *p, const int y,
static void lr_sbrow(Dav1dFrameContext *const f, pixel *p, const int y,
const int w, const int h, const int row_h, const int plane)
{
const int chroma = !!plane;
......@@ -310,4 +348,10 @@ void bytefn(dav1d_lr_sbrow)(Dav1dFrameContext *const f, pixel *const dst[3],
lr_sbrow(f, dst[2] - offset_uv * PXSTRIDE(dst_stride[1]), y_stripe,
w, h, row_h, 2);
}
const int bd_idx = bd_idx_from_max(f->bitdepth_max);
for (int h_idx = 0; h_idx < 2; h_idx++) {
if (f->vk.lr[0][bd_idx][h_idx].bx) bitfn(wiener_dispatch_vk)(&f->vk, h_idx HIGHBD_CALL_SUFFIX);
if (f->vk.lr[1][bd_idx][h_idx].bx) bitfn(sgr_dispatch_vk)(&f->vk, h_idx HIGHBD_CALL_SUFFIX);
}
}

VideoLAN code repository instance