From b7adc70ea474f7448c6185081ad9fc87b0b47cf0 Mon Sep 17 00:00:00 2001 From: Cameron Gutman Date: Sun, 26 Jul 2026 18:09:53 -0500 Subject: [PATCH] Import minimal set of code from h264bitstream needed for SPS fixups --- .gitmodules | 3 - app/app.pro | 4 +- h264bitstream/LICENSE | 504 ++++++++++++++++++++++++++++++++ h264bitstream/bs.h | 275 +++++++++++++++++ h264bitstream/h264_nal.c | 147 ++++++++++ h264bitstream/h264_stream.c | 504 ++++++++++++++++++++++++++++++++ h264bitstream/h264_stream.h | 154 ++++++++++ h264bitstream/h264bitstream | 1 - h264bitstream/h264bitstream.pro | 14 +- 9 files changed, 1590 insertions(+), 16 deletions(-) create mode 100644 h264bitstream/LICENSE create mode 100644 h264bitstream/bs.h create mode 100644 h264bitstream/h264_nal.c create mode 100644 h264bitstream/h264_stream.c create mode 100644 h264bitstream/h264_stream.h delete mode 160000 h264bitstream/h264bitstream diff --git a/.gitmodules b/.gitmodules index a06cac7e..2eeecaf9 100644 --- a/.gitmodules +++ b/.gitmodules @@ -7,6 +7,3 @@ [submodule "app/SDL_GameControllerDB"] path = app/SDL_GameControllerDB url = https://github.com/gabomdq/SDL_GameControllerDB.git -[submodule "h264bitstream/h264bitstream"] - path = h264bitstream/h264bitstream - url = https://github.com/cgutman/h264bitstream.git diff --git a/app/app.pro b/app/app.pro index b18d29b5..159c87eb 100644 --- a/app/app.pro +++ b/app/app.pro @@ -512,8 +512,8 @@ win32:CONFIG(release, debug|release): LIBS += -L$$OUT_PWD/../h264bitstream/relea else:win32:CONFIG(debug, debug|release): LIBS += -L$$OUT_PWD/../h264bitstream/debug/ -lh264bitstream else:unix: LIBS += -L$$OUT_PWD/../h264bitstream/ -lh264bitstream -INCLUDEPATH += $$PWD/../h264bitstream/h264bitstream -DEPENDPATH += $$PWD/../h264bitstream/h264bitstream +INCLUDEPATH += $$PWD/../h264bitstream +DEPENDPATH += $$PWD/../h264bitstream !winrt { win32:CONFIG(release, debug|release): LIBS += -L$$OUT_PWD/../AntiHooking/release/ -lAntiHooking diff --git a/h264bitstream/LICENSE b/h264bitstream/LICENSE new file mode 100644 index 00000000..28f18896 --- /dev/null +++ b/h264bitstream/LICENSE @@ -0,0 +1,504 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/h264bitstream/bs.h b/h264bitstream/bs.h new file mode 100644 index 00000000..5560be90 --- /dev/null +++ b/h264bitstream/bs.h @@ -0,0 +1,275 @@ +#ifndef _H264_BS_H +#define _H264_BS_H 1 + +#include +#include +#include + +#ifdef __cplusplus +extern "C" { +#endif + +typedef struct +{ + uint8_t* start; + uint8_t* p; + uint8_t* end; + int bits_left; +} bs_t; + +#define _OPTIMIZE_BS_ 1 + +#if ( _OPTIMIZE_BS_ > 0 ) +#ifndef FAST_U8 +#define FAST_U8 +#endif +#endif + +static bs_t* bs_new(uint8_t* buf, size_t size); +static void bs_free(bs_t* b); +static bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size); +static uint32_t bs_byte_aligned(bs_t* b); +static int bs_eof(bs_t* b); +static int bs_overrun(bs_t* b); +static int bs_pos(bs_t* b); + +static uint32_t bs_read_u1(bs_t* b); +static void bs_skip_u1(bs_t* b); +static uint32_t bs_read_u(bs_t* b, int n); +static void bs_skip_u(bs_t* b, int n); +static uint32_t bs_read_u8(bs_t* b); +static uint32_t bs_read_ue(bs_t* b); +static int32_t bs_read_se(bs_t* b); + +static void bs_write_u1(bs_t* b, uint32_t v); +static void bs_write_u(bs_t* b, int n, uint32_t v); +static void bs_write_u8(bs_t* b, uint32_t v); +static void bs_write_ue(bs_t* b, uint32_t v); +static void bs_write_se(bs_t* b, int32_t v); + +// IMPLEMENTATION + +static inline bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size) +{ + b->start = buf; + b->p = buf; + b->end = buf + size; + b->bits_left = 8; + return b; +} + +static inline bs_t* bs_new(uint8_t* buf, size_t size) +{ + bs_t* b = (bs_t*)malloc(sizeof(bs_t)); + bs_init(b, buf, size); + return b; +} + +static inline void bs_free(bs_t* b) +{ + free(b); +} + +static inline uint32_t bs_byte_aligned(bs_t* b) +{ + return (b->bits_left == 8); +} + +static inline int bs_eof(bs_t* b) { if (b->p >= b->end) { return 1; } else { return 0; } } + +static inline int bs_overrun(bs_t* b) { if (b->p > b->end) { return 1; } else { return 0; } } + +static inline int bs_pos(bs_t* b) { if (b->p > b->end) { return (b->end - b->start); } else { return (b->p - b->start); } } + +static inline uint32_t bs_read_u1(bs_t* b) +{ + uint32_t r = 0; + + b->bits_left--; + + if (! bs_eof(b)) + { + r = ((*(b->p)) >> b->bits_left) & 0x01; + } + + if (b->bits_left == 0) { b->p ++; b->bits_left = 8; } + + return r; +} + +static inline void bs_skip_u1(bs_t* b) +{ + b->bits_left--; + if (b->bits_left == 0) { b->p ++; b->bits_left = 8; } +} + +static inline uint32_t bs_read_u(bs_t* b, int n) +{ + uint32_t r = 0; + int i; + for (i = 0; i < n; i++) + { + r |= ( bs_read_u1(b) << ( n - i - 1 ) ); + } + return r; +} + +static inline void bs_skip_u(bs_t* b, int n) +{ + int i; + for ( i = 0; i < n; i++ ) + { + bs_skip_u1( b ); + } +} + +static inline uint32_t bs_read_u8(bs_t* b) +{ +#ifdef FAST_U8 + if (b->bits_left == 8 && ! bs_eof(b)) // can do fast read + { + uint32_t r = b->p[0]; + b->p++; + return r; + } +#endif + return bs_read_u(b, 8); +} + +static inline uint32_t bs_read_ue(bs_t* b) +{ + int32_t r = 0; + int i = 0; + + while( (bs_read_u1(b) == 0) && (i < 32) && (!bs_eof(b)) ) + { + i++; + } + r = bs_read_u(b, i); + r += (1 << i) - 1; + return r; +} + +static inline int32_t bs_read_se(bs_t* b) +{ + int32_t r = bs_read_ue(b); + if (r & 0x01) + { + r = (r+1)/2; + } + else + { + r = -(r/2); + } + return r; +} + +static inline void bs_write_u1(bs_t* b, uint32_t v) +{ + b->bits_left--; + + if (! bs_eof(b)) + { + (*(b->p)) &= ~(0x01 << b->bits_left); + (*(b->p)) |= ((v & 0x01) << b->bits_left); + } + + if (b->bits_left == 0) { b->p ++; b->bits_left = 8; } +} + +static inline void bs_write_u(bs_t* b, int n, uint32_t v) +{ + int i; + for (i = 0; i < n; i++) + { + bs_write_u1(b, (v >> ( n - i - 1 ))&0x01 ); + } +} + +static inline void bs_write_u8(bs_t* b, uint32_t v) +{ +#ifdef FAST_U8 + if (b->bits_left == 8 && ! bs_eof(b)) // can do fast write + { + b->p[0] = v; + b->p++; + return; + } +#endif + bs_write_u(b, 8, v); +} + +static inline void bs_write_ue(bs_t* b, uint32_t v) +{ + static const int len_table[256] = + { + 1, + 1, + 2,2, + 3,3,3,3, + 4,4,4,4,4,4,4,4, + 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + }; + + int len; + + if (v == 0) + { + bs_write_u1(b, 1); + } + else + { + v++; + + if (v >= 0x01000000) + { + len = 24 + len_table[ v >> 24 ]; + } + else if(v >= 0x00010000) + { + len = 16 + len_table[ v >> 16 ]; + } + else if(v >= 0x00000100) + { + len = 8 + len_table[ v >> 8 ]; + } + else + { + len = len_table[ v ]; + } + + bs_write_u(b, 2*len-1, v); + } +} + +static inline void bs_write_se(bs_t* b, int32_t v) +{ + if (v <= 0) + { + bs_write_ue(b, -v*2); + } + else + { + bs_write_ue(b, v*2 - 1); + } +} + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/h264bitstream/h264_nal.c b/h264bitstream/h264_nal.c new file mode 100644 index 00000000..d73fc932 --- /dev/null +++ b/h264bitstream/h264_nal.c @@ -0,0 +1,147 @@ +#include +#include + +#include "h264_stream.h" + +h264_stream_t* h264_new() +{ + h264_stream_t* h = (h264_stream_t*)calloc(1, sizeof(h264_stream_t)); + h->nal = (nal_t*)calloc(1, sizeof(nal_t)); + h->sps = (sps_t*)calloc(1, sizeof(sps_t)); + return h; +} + +void h264_free(h264_stream_t* h) +{ + free(h->nal); + free(h->sps); + free(h); +} + +int find_nal_unit(uint8_t* buf, int size, int* nal_start, int* nal_end) +{ + int i; + *nal_start = 0; + *nal_end = 0; + + i = 0; + while ( + (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0x01) && + (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0 || buf[i+3] != 0x01) + ) + { + i++; + if (i+4 >= size) { return 0; } + } + + if (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0x01) + { + i++; + } + + if (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0x01) { return 0; } + i+= 3; + *nal_start = i; + + while ( + (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0) && + (buf[i] != 0 || buf[i+1] != 0 || buf[i+2] != 0x01) + ) + { + i++; + if (i+3 >= size) { *nal_end = size; return -1; } + } + + *nal_end = i; + return (*nal_end - *nal_start); +} + +int rbsp_to_nal(const uint8_t* rbsp_buf, const int* rbsp_size, uint8_t* nal_buf, int* nal_size) +{ + int i; + int j = 1; + int count = 0; + + if (*nal_size > 0) { nal_buf[0] = 0x00; } + + for ( i = 0; i < *rbsp_size ; ) + { + if ( j >= *nal_size ) + { + return -1; + } + + if ( ( count == 2 ) && !(rbsp_buf[i] & 0xFC) ) + { + nal_buf[j] = 0x03; + j++; + count = 0; + continue; + } + nal_buf[j] = rbsp_buf[i]; + if ( rbsp_buf[i] == 0x00 ) + { + count++; + } + else + { + count = 0; + } + i++; + j++; + } + + *nal_size = j; + return j; +} + +int nal_to_rbsp(const uint8_t* nal_buf, int* nal_size, uint8_t* rbsp_buf, int* rbsp_size) +{ + int i; + int j = 0; + int count = 0; + + for( i = 0; i < *nal_size; i++ ) + { + if( ( count == 2 ) && ( nal_buf[i] < 0x03) ) + { + return -1; + } + + if( ( count == 2 ) && ( nal_buf[i] == 0x03) ) + { + if((i < *nal_size - 1) && (nal_buf[i+1] > 0x03)) + { + return -1; + } + + if(i == *nal_size - 1) + { + break; + } + + i++; + count = 0; + } + + if ( j >= *rbsp_size ) + { + return -1; + } + + rbsp_buf[j] = nal_buf[i]; + if(nal_buf[i] == 0x00) + { + count++; + } + else + { + count = 0; + } + j++; + } + + *nal_size = i; + *rbsp_size = j; + return j; +} diff --git a/h264bitstream/h264_stream.c b/h264bitstream/h264_stream.c new file mode 100644 index 00000000..9cd8ec0b --- /dev/null +++ b/h264bitstream/h264_stream.c @@ -0,0 +1,504 @@ +#include +#include +#include + +#include "bs.h" +#include "h264_stream.h" + +int read_nal_unit(h264_stream_t* h, uint8_t* buf, int size) +{ + nal_t* nal = h->nal; + + int nal_size = size; + int rbsp_size = size; + uint8_t* rbsp_buf = (uint8_t*)calloc(1, rbsp_size); + + int rc = nal_to_rbsp(buf, &nal_size, rbsp_buf, &rbsp_size); + if (rc < 0) { free(rbsp_buf); return -1; } + + bs_t* b = bs_new(rbsp_buf, rbsp_size); + bs_skip_u(b, 1); + nal->nal_ref_idc = bs_read_u(b, 2); + nal->nal_unit_type = bs_read_u(b, 5); + + if (nal->nal_unit_type == NAL_UNIT_TYPE_SPS) + { + read_seq_parameter_set_rbsp(h->sps, b); + read_rbsp_trailing_bits(b); + } + else + { + bs_free(b); + free(rbsp_buf); + return -1; + } + + if (bs_overrun(b)) { bs_free(b); free(rbsp_buf); return -1; } + + bs_free(b); + free(rbsp_buf); + + return nal_size; +} + +void read_seq_parameter_set_rbsp(sps_t* sps, bs_t* b) +{ + int i; + + memset(sps, 0, sizeof(sps_t)); + sps->chroma_format_idc = 1; + + sps->profile_idc = bs_read_u8(b); + sps->constraint_set0_flag = bs_read_u1(b); + sps->constraint_set1_flag = bs_read_u1(b); + sps->constraint_set2_flag = bs_read_u1(b); + sps->constraint_set3_flag = bs_read_u1(b); + sps->constraint_set4_flag = bs_read_u1(b); + sps->constraint_set5_flag = bs_read_u1(b); + bs_skip_u(b, 2); + sps->level_idc = bs_read_u8(b); + sps->seq_parameter_set_id = bs_read_ue(b); + + if( sps->profile_idc == 100 || sps->profile_idc == 110 || + sps->profile_idc == 122 || sps->profile_idc == 244 || + sps->profile_idc == 44 || sps->profile_idc == 83 || + sps->profile_idc == 86 || sps->profile_idc == 118 || + sps->profile_idc == 128 || sps->profile_idc == 138 || + sps->profile_idc == 139 || sps->profile_idc == 134 + ) + { + sps->chroma_format_idc = bs_read_ue(b); + if( sps->chroma_format_idc == 3 ) + { + sps->residual_colour_transform_flag = bs_read_u1(b); + } + sps->bit_depth_luma_minus8 = bs_read_ue(b); + sps->bit_depth_chroma_minus8 = bs_read_ue(b); + sps->qpprime_y_zero_transform_bypass_flag = bs_read_u1(b); + sps->seq_scaling_matrix_present_flag = bs_read_u1(b); + if( sps->seq_scaling_matrix_present_flag ) + { + for( i = 0; i < ((sps->chroma_format_idc != 3) ? 8 : 12); i++ ) + { + sps->seq_scaling_list_present_flag[ i ] = bs_read_u1(b); + if( sps->seq_scaling_list_present_flag[ i ] ) + { + if( i < 6 ) + { + read_scaling_list( b, sps->ScalingList4x4[ i ], 16, + &( sps->UseDefaultScalingMatrix4x4Flag[ i ] ) ); + } + else + { + read_scaling_list( b, sps->ScalingList8x8[ i - 6 ], 64, + &( sps->UseDefaultScalingMatrix8x8Flag[ i - 6 ] ) ); + } + } + } + } + } + sps->log2_max_frame_num_minus4 = bs_read_ue(b); + sps->pic_order_cnt_type = bs_read_ue(b); + if( sps->pic_order_cnt_type == 0 ) + { + sps->log2_max_pic_order_cnt_lsb_minus4 = bs_read_ue(b); + } + else if( sps->pic_order_cnt_type == 1 ) + { + sps->delta_pic_order_always_zero_flag = bs_read_u1(b); + sps->offset_for_non_ref_pic = bs_read_se(b); + sps->offset_for_top_to_bottom_field = bs_read_se(b); + sps->num_ref_frames_in_pic_order_cnt_cycle = bs_read_ue(b); + for( i = 0; i < sps->num_ref_frames_in_pic_order_cnt_cycle; i++ ) + { + sps->offset_for_ref_frame[ i ] = bs_read_se(b); + } + } + sps->num_ref_frames = bs_read_ue(b); + sps->gaps_in_frame_num_value_allowed_flag = bs_read_u1(b); + sps->pic_width_in_mbs_minus1 = bs_read_ue(b); + sps->pic_height_in_map_units_minus1 = bs_read_ue(b); + sps->frame_mbs_only_flag = bs_read_u1(b); + if( !sps->frame_mbs_only_flag ) + { + sps->mb_adaptive_frame_field_flag = bs_read_u1(b); + } + sps->direct_8x8_inference_flag = bs_read_u1(b); + sps->frame_cropping_flag = bs_read_u1(b); + if( sps->frame_cropping_flag ) + { + sps->frame_crop_left_offset = bs_read_ue(b); + sps->frame_crop_right_offset = bs_read_ue(b); + sps->frame_crop_top_offset = bs_read_ue(b); + sps->frame_crop_bottom_offset = bs_read_ue(b); + } + sps->vui_parameters_present_flag = bs_read_u1(b); + if( sps->vui_parameters_present_flag ) + { + read_vui_parameters(sps, b); + } +} + +void read_scaling_list(bs_t* b, int* scalingList, int sizeOfScalingList, int* useDefaultScalingMatrixFlag ) +{ + int lastScale = 8; + int nextScale = 8; + int delta_scale; + for( int j = 0; j < sizeOfScalingList; j++ ) + { + if( nextScale != 0 ) + { + delta_scale = bs_read_se(b); + nextScale = ( lastScale + delta_scale + 256 ) % 256; + useDefaultScalingMatrixFlag[0] = ( j == 0 && nextScale == 0 ); + } + scalingList[ j ] = ( nextScale == 0 ) ? lastScale : nextScale; + lastScale = scalingList[ j ]; + } +} + +void read_vui_parameters(sps_t* sps, bs_t* b) +{ + sps->vui.aspect_ratio_info_present_flag = bs_read_u1(b); + if( sps->vui.aspect_ratio_info_present_flag ) + { + sps->vui.aspect_ratio_idc = bs_read_u8(b); + if( sps->vui.aspect_ratio_idc == SAR_Extended ) + { + sps->vui.sar_width = bs_read_u(b, 16); + sps->vui.sar_height = bs_read_u(b, 16); + } + } + sps->vui.overscan_info_present_flag = bs_read_u1(b); + if( sps->vui.overscan_info_present_flag ) + { + sps->vui.overscan_appropriate_flag = bs_read_u1(b); + } + sps->vui.video_signal_type_present_flag = bs_read_u1(b); + if( sps->vui.video_signal_type_present_flag ) + { + sps->vui.video_format = bs_read_u(b, 3); + sps->vui.video_full_range_flag = bs_read_u1(b); + sps->vui.colour_description_present_flag = bs_read_u1(b); + if( sps->vui.colour_description_present_flag ) + { + sps->vui.colour_primaries = bs_read_u8(b); + sps->vui.transfer_characteristics = bs_read_u8(b); + sps->vui.matrix_coefficients = bs_read_u8(b); + } + } + sps->vui.chroma_loc_info_present_flag = bs_read_u1(b); + if( sps->vui.chroma_loc_info_present_flag ) + { + sps->vui.chroma_sample_loc_type_top_field = bs_read_ue(b); + sps->vui.chroma_sample_loc_type_bottom_field = bs_read_ue(b); + } + sps->vui.timing_info_present_flag = bs_read_u1(b); + if( sps->vui.timing_info_present_flag ) + { + sps->vui.num_units_in_tick = bs_read_u(b, 32); + sps->vui.time_scale = bs_read_u(b, 32); + sps->vui.fixed_frame_rate_flag = bs_read_u1(b); + } + sps->vui.nal_hrd_parameters_present_flag = bs_read_u1(b); + if( sps->vui.nal_hrd_parameters_present_flag ) + { + read_hrd_parameters(&sps->hrd_nal, b); + } + sps->vui.vcl_hrd_parameters_present_flag = bs_read_u1(b); + if( sps->vui.vcl_hrd_parameters_present_flag ) + { + read_hrd_parameters(&sps->hrd_vcl, b); + } + if( sps->vui.nal_hrd_parameters_present_flag || sps->vui.vcl_hrd_parameters_present_flag ) + { + sps->vui.low_delay_hrd_flag = bs_read_u1(b); + } + sps->vui.pic_struct_present_flag = bs_read_u1(b); + sps->vui.bitstream_restriction_flag = bs_read_u1(b); + if( sps->vui.bitstream_restriction_flag ) + { + sps->vui.motion_vectors_over_pic_boundaries_flag = bs_read_u1(b); + sps->vui.max_bytes_per_pic_denom = bs_read_ue(b); + sps->vui.max_bits_per_mb_denom = bs_read_ue(b); + sps->vui.log2_max_mv_length_horizontal = bs_read_ue(b); + sps->vui.log2_max_mv_length_vertical = bs_read_ue(b); + sps->vui.num_reorder_frames = bs_read_ue(b); + sps->vui.max_dec_frame_buffering = bs_read_ue(b); + } +} + +void read_hrd_parameters(hrd_t* hrd, bs_t* b) +{ + hrd->cpb_cnt_minus1 = bs_read_ue(b); + hrd->bit_rate_scale = bs_read_u(b, 4); + hrd->cpb_size_scale = bs_read_u(b, 4); + for( int SchedSelIdx = 0; SchedSelIdx <= hrd->cpb_cnt_minus1; SchedSelIdx++ ) + { + hrd->bit_rate_value_minus1[ SchedSelIdx ] = bs_read_ue(b); + hrd->cpb_size_value_minus1[ SchedSelIdx ] = bs_read_ue(b); + hrd->cbr_flag[ SchedSelIdx ] = bs_read_u1(b); + } + hrd->initial_cpb_removal_delay_length_minus1 = bs_read_u(b, 5); + hrd->cpb_removal_delay_length_minus1 = bs_read_u(b, 5); + hrd->dpb_output_delay_length_minus1 = bs_read_u(b, 5); + hrd->time_offset_length = bs_read_u(b, 5); +} + +void read_rbsp_trailing_bits(bs_t* b) +{ + bs_skip_u(b, 1); + + while( !bs_byte_aligned(b) ) + { + bs_skip_u(b, 1); + } +} + +int write_nal_unit(h264_stream_t* h, uint8_t* buf, int size) +{ + nal_t* nal = h->nal; + + int nal_size = size; + int rbsp_size = size; + uint8_t* rbsp_buf = (uint8_t*)calloc(1, rbsp_size); + + bs_t* b = bs_new(rbsp_buf, rbsp_size); + bs_write_u(b, 1, 0); + bs_write_u(b, 2, nal->nal_ref_idc); + bs_write_u(b, 5, nal->nal_unit_type); + + if( nal->nal_unit_type == NAL_UNIT_TYPE_SPS ) + { + write_seq_parameter_set_rbsp(h->sps, b); + write_rbsp_trailing_bits(b); + } + else + { + bs_free(b); + free(rbsp_buf); + return -1; + } + + if (bs_overrun(b)) { bs_free(b); free(rbsp_buf); return -1; } + + rbsp_size = bs_pos(b); + int rc = rbsp_to_nal(rbsp_buf, &rbsp_size, buf, &nal_size); + if (rc < 0) { bs_free(b); free(rbsp_buf); return -1; } + + bs_free(b); + free(rbsp_buf); + + return nal_size; +} + +void write_seq_parameter_set_rbsp(sps_t* sps, bs_t* b) +{ + int i; + + bs_write_u8(b, sps->profile_idc); + bs_write_u1(b, sps->constraint_set0_flag); + bs_write_u1(b, sps->constraint_set1_flag); + bs_write_u1(b, sps->constraint_set2_flag); + bs_write_u1(b, sps->constraint_set3_flag); + bs_write_u1(b, sps->constraint_set4_flag); + bs_write_u1(b, sps->constraint_set5_flag); + bs_write_u(b, 2, 0); + bs_write_u8(b, sps->level_idc); + bs_write_ue(b, sps->seq_parameter_set_id); + + if( sps->profile_idc == 100 || sps->profile_idc == 110 || + sps->profile_idc == 122 || sps->profile_idc == 244 || + sps->profile_idc == 44 || sps->profile_idc == 83 || + sps->profile_idc == 86 || sps->profile_idc == 118 || + sps->profile_idc == 128 || sps->profile_idc == 138 || + sps->profile_idc == 139 || sps->profile_idc == 134 + ) + { + bs_write_ue(b, sps->chroma_format_idc); + if( sps->chroma_format_idc == 3 ) + { + bs_write_u1(b, sps->residual_colour_transform_flag); + } + bs_write_ue(b, sps->bit_depth_luma_minus8); + bs_write_ue(b, sps->bit_depth_chroma_minus8); + bs_write_u1(b, sps->qpprime_y_zero_transform_bypass_flag); + bs_write_u1(b, sps->seq_scaling_matrix_present_flag); + if( sps->seq_scaling_matrix_present_flag ) + { + for( i = 0; i < 8; i++ ) + { + bs_write_u1(b, sps->seq_scaling_list_present_flag[ i ]); + if( sps->seq_scaling_list_present_flag[ i ] ) + { + if( i < 6 ) + { + write_scaling_list( b, sps->ScalingList4x4[ i ], 16, + &( sps->UseDefaultScalingMatrix4x4Flag[ i ] ) ); + } + else + { + write_scaling_list( b, sps->ScalingList8x8[ i - 6 ], 64, + &( sps->UseDefaultScalingMatrix8x8Flag[ i - 6 ] ) ); + } + } + } + } + } + bs_write_ue(b, sps->log2_max_frame_num_minus4); + bs_write_ue(b, sps->pic_order_cnt_type); + if( sps->pic_order_cnt_type == 0 ) + { + bs_write_ue(b, sps->log2_max_pic_order_cnt_lsb_minus4); + } + else if( sps->pic_order_cnt_type == 1 ) + { + bs_write_u1(b, sps->delta_pic_order_always_zero_flag); + bs_write_se(b, sps->offset_for_non_ref_pic); + bs_write_se(b, sps->offset_for_top_to_bottom_field); + bs_write_ue(b, sps->num_ref_frames_in_pic_order_cnt_cycle); + for( i = 0; i < sps->num_ref_frames_in_pic_order_cnt_cycle; i++ ) + { + bs_write_se(b, sps->offset_for_ref_frame[ i ]); + } + } + bs_write_ue(b, sps->num_ref_frames); + bs_write_u1(b, sps->gaps_in_frame_num_value_allowed_flag); + bs_write_ue(b, sps->pic_width_in_mbs_minus1); + bs_write_ue(b, sps->pic_height_in_map_units_minus1); + bs_write_u1(b, sps->frame_mbs_only_flag); + if( !sps->frame_mbs_only_flag ) + { + bs_write_u1(b, sps->mb_adaptive_frame_field_flag); + } + bs_write_u1(b, sps->direct_8x8_inference_flag); + bs_write_u1(b, sps->frame_cropping_flag); + if( sps->frame_cropping_flag ) + { + bs_write_ue(b, sps->frame_crop_left_offset); + bs_write_ue(b, sps->frame_crop_right_offset); + bs_write_ue(b, sps->frame_crop_top_offset); + bs_write_ue(b, sps->frame_crop_bottom_offset); + } + bs_write_u1(b, sps->vui_parameters_present_flag); + if( sps->vui_parameters_present_flag ) + { + write_vui_parameters(sps, b); + } +} + +void write_scaling_list(bs_t* b, int* scalingList, int sizeOfScalingList, int* useDefaultScalingMatrixFlag ) +{ + int lastScale = 8; + int nextScale = 8; + int delta_scale; + for( int j = 0; j < sizeOfScalingList; j++ ) + { + if( nextScale != 0 ) + { + nextScale = scalingList[ j ]; + if (useDefaultScalingMatrixFlag[0]) { nextScale = 0; } + delta_scale = (nextScale - lastScale) % 256 ; + bs_write_se(b, delta_scale); + } + lastScale = scalingList[ j ]; + } +} + +void write_vui_parameters(sps_t* sps, bs_t* b) +{ + bs_write_u1(b, sps->vui.aspect_ratio_info_present_flag); + if( sps->vui.aspect_ratio_info_present_flag ) + { + bs_write_u8(b, sps->vui.aspect_ratio_idc); + if( sps->vui.aspect_ratio_idc == SAR_Extended ) + { + bs_write_u(b, 16, sps->vui.sar_width); + bs_write_u(b, 16, sps->vui.sar_height); + } + } + bs_write_u1(b, sps->vui.overscan_info_present_flag); + if( sps->vui.overscan_info_present_flag ) + { + bs_write_u1(b, sps->vui.overscan_appropriate_flag); + } + bs_write_u1(b, sps->vui.video_signal_type_present_flag); + if( sps->vui.video_signal_type_present_flag ) + { + bs_write_u(b, 3, sps->vui.video_format); + bs_write_u1(b, sps->vui.video_full_range_flag); + bs_write_u1(b, sps->vui.colour_description_present_flag); + if( sps->vui.colour_description_present_flag ) + { + bs_write_u8(b, sps->vui.colour_primaries); + bs_write_u8(b, sps->vui.transfer_characteristics); + bs_write_u8(b, sps->vui.matrix_coefficients); + } + } + bs_write_u1(b, sps->vui.chroma_loc_info_present_flag); + if( sps->vui.chroma_loc_info_present_flag ) + { + bs_write_ue(b, sps->vui.chroma_sample_loc_type_top_field); + bs_write_ue(b, sps->vui.chroma_sample_loc_type_bottom_field); + } + bs_write_u1(b, sps->vui.timing_info_present_flag); + if( sps->vui.timing_info_present_flag ) + { + bs_write_u(b, 32, sps->vui.num_units_in_tick); + bs_write_u(b, 32, sps->vui.time_scale); + bs_write_u1(b, sps->vui.fixed_frame_rate_flag); + } + bs_write_u1(b, sps->vui.nal_hrd_parameters_present_flag); + if( sps->vui.nal_hrd_parameters_present_flag ) + { + write_hrd_parameters(&sps->hrd_nal, b); + } + bs_write_u1(b, sps->vui.vcl_hrd_parameters_present_flag); + if( sps->vui.vcl_hrd_parameters_present_flag ) + { + write_hrd_parameters(&sps->hrd_vcl, b); + } + if( sps->vui.nal_hrd_parameters_present_flag || sps->vui.vcl_hrd_parameters_present_flag ) + { + bs_write_u1(b, sps->vui.low_delay_hrd_flag); + } + bs_write_u1(b, sps->vui.pic_struct_present_flag); + bs_write_u1(b, sps->vui.bitstream_restriction_flag); + if( sps->vui.bitstream_restriction_flag ) + { + bs_write_u1(b, sps->vui.motion_vectors_over_pic_boundaries_flag); + bs_write_ue(b, sps->vui.max_bytes_per_pic_denom); + bs_write_ue(b, sps->vui.max_bits_per_mb_denom); + bs_write_ue(b, sps->vui.log2_max_mv_length_horizontal); + bs_write_ue(b, sps->vui.log2_max_mv_length_vertical); + bs_write_ue(b, sps->vui.num_reorder_frames); + bs_write_ue(b, sps->vui.max_dec_frame_buffering); + } +} + +void write_hrd_parameters(hrd_t* hrd, bs_t* b) +{ + bs_write_ue(b, hrd->cpb_cnt_minus1); + bs_write_u(b, 4, hrd->bit_rate_scale); + bs_write_u(b, 4, hrd->cpb_size_scale); + for( int SchedSelIdx = 0; SchedSelIdx <= hrd->cpb_cnt_minus1; SchedSelIdx++ ) + { + bs_write_ue(b, hrd->bit_rate_value_minus1[ SchedSelIdx ]); + bs_write_ue(b, hrd->cpb_size_value_minus1[ SchedSelIdx ]); + bs_write_u1(b, hrd->cbr_flag[ SchedSelIdx ]); + } + bs_write_u(b, 5, hrd->initial_cpb_removal_delay_length_minus1); + bs_write_u(b, 5, hrd->cpb_removal_delay_length_minus1); + bs_write_u(b, 5, hrd->dpb_output_delay_length_minus1); + bs_write_u(b, 5, hrd->time_offset_length); +} + +void write_rbsp_trailing_bits(bs_t* b) +{ + bs_write_u(b, 1, 1); + + while( !bs_byte_aligned(b) ) + { + bs_write_u(b, 1, 0); + } +} diff --git a/h264bitstream/h264_stream.h b/h264bitstream/h264_stream.h new file mode 100644 index 00000000..5e6d3af1 --- /dev/null +++ b/h264bitstream/h264_stream.h @@ -0,0 +1,154 @@ +#ifndef _H264_STREAM_H +#define _H264_STREAM_H 1 + +#include + +#include "bs.h" + +#ifdef __cplusplus +extern "C" { +#endif + +typedef struct +{ + int cpb_cnt_minus1; + int bit_rate_scale; + int cpb_size_scale; + int bit_rate_value_minus1[32]; + int cpb_size_value_minus1[32]; + int cbr_flag[32]; + int initial_cpb_removal_delay_length_minus1; + int cpb_removal_delay_length_minus1; + int dpb_output_delay_length_minus1; + int time_offset_length; +} hrd_t; + +typedef struct +{ + int profile_idc; + int constraint_set0_flag; + int constraint_set1_flag; + int constraint_set2_flag; + int constraint_set3_flag; + int constraint_set4_flag; + int constraint_set5_flag; + int reserved_zero_2bits; + int level_idc; + int seq_parameter_set_id; + int chroma_format_idc; + int residual_colour_transform_flag; + int bit_depth_luma_minus8; + int bit_depth_chroma_minus8; + int qpprime_y_zero_transform_bypass_flag; + int seq_scaling_matrix_present_flag; + int seq_scaling_list_present_flag[12]; + int ScalingList4x4[6][16]; + int UseDefaultScalingMatrix4x4Flag[6]; + int ScalingList8x8[6][64]; + int UseDefaultScalingMatrix8x8Flag[6]; + int log2_max_frame_num_minus4; + int pic_order_cnt_type; + int log2_max_pic_order_cnt_lsb_minus4; + int delta_pic_order_always_zero_flag; + int offset_for_non_ref_pic; + int offset_for_top_to_bottom_field; + int num_ref_frames_in_pic_order_cnt_cycle; + int offset_for_ref_frame[256]; + int num_ref_frames; + int gaps_in_frame_num_value_allowed_flag; + int pic_width_in_mbs_minus1; + int pic_height_in_map_units_minus1; + int frame_mbs_only_flag; + int mb_adaptive_frame_field_flag; + int direct_8x8_inference_flag; + int frame_cropping_flag; + int frame_crop_left_offset; + int frame_crop_right_offset; + int frame_crop_top_offset; + int frame_crop_bottom_offset; + int vui_parameters_present_flag; + + struct + { + int aspect_ratio_info_present_flag; + int aspect_ratio_idc; + int sar_width; + int sar_height; + int overscan_info_present_flag; + int overscan_appropriate_flag; + int video_signal_type_present_flag; + int video_format; + int video_full_range_flag; + int colour_description_present_flag; + int colour_primaries; + int transfer_characteristics; + int matrix_coefficients; + int chroma_loc_info_present_flag; + int chroma_sample_loc_type_top_field; + int chroma_sample_loc_type_bottom_field; + int timing_info_present_flag; + int num_units_in_tick; + int time_scale; + int fixed_frame_rate_flag; + int nal_hrd_parameters_present_flag; + int vcl_hrd_parameters_present_flag; + int low_delay_hrd_flag; + int pic_struct_present_flag; + int bitstream_restriction_flag; + int motion_vectors_over_pic_boundaries_flag; + int max_bytes_per_pic_denom; + int max_bits_per_mb_denom; + int log2_max_mv_length_horizontal; + int log2_max_mv_length_vertical; + int num_reorder_frames; + int max_dec_frame_buffering; + } vui; + + hrd_t hrd_nal; + hrd_t hrd_vcl; + +} sps_t; + +typedef struct +{ + int nal_ref_idc; + int nal_unit_type; +} nal_t; + +typedef struct +{ + nal_t* nal; + sps_t* sps; +} h264_stream_t; + +h264_stream_t* h264_new(); +void h264_free(h264_stream_t* h); + +int find_nal_unit(uint8_t* buf, int size, int* nal_start, int* nal_end); + +int rbsp_to_nal(const uint8_t* rbsp_buf, const int* rbsp_size, uint8_t* nal_buf, int* nal_size); +int nal_to_rbsp(const uint8_t* nal_buf, int* nal_size, uint8_t* rbsp_buf, int* rbsp_size); + +int read_nal_unit(h264_stream_t* h, uint8_t* buf, int size); +int write_nal_unit(h264_stream_t* h, uint8_t* buf, int size); + +void read_seq_parameter_set_rbsp(sps_t* sps, bs_t* b); +void read_scaling_list(bs_t* b, int* scalingList, int sizeOfScalingList, int* useDefaultScalingMatrixFlag); +void read_vui_parameters(sps_t* sps, bs_t* b); +void read_hrd_parameters(hrd_t* hrd, bs_t* b); +void read_rbsp_trailing_bits(bs_t* b); + +void write_seq_parameter_set_rbsp(sps_t* sps, bs_t* b); +void write_scaling_list(bs_t* b, int* scalingList, int sizeOfScalingList, int* useDefaultScalingMatrixFlag); +void write_vui_parameters(sps_t* sps, bs_t* b); +void write_hrd_parameters(hrd_t* hrd, bs_t* b); +void write_rbsp_trailing_bits(bs_t* b); + +#define NAL_UNIT_TYPE_SPS 7 +#define SAR_Extended 255 + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/h264bitstream/h264bitstream b/h264bitstream/h264bitstream deleted file mode 160000 index 34f3c58a..00000000 --- a/h264bitstream/h264bitstream +++ /dev/null @@ -1 +0,0 @@ -Subproject commit 34f3c58afa3c47b6cf0a49308a68cbf89c5e0bff diff --git a/h264bitstream/h264bitstream.pro b/h264bitstream/h264bitstream.pro index 1fca7276..337bbaeb 100644 --- a/h264bitstream/h264bitstream.pro +++ b/h264bitstream/h264bitstream.pro @@ -24,16 +24,10 @@ include(../globaldefs.pri) QMAKE_CFLAGS += -std=gnu99 } -SRC_DIR = $$PWD/h264bitstream - SOURCES += \ - $$SRC_DIR/h264_nal.c \ - $$SRC_DIR/h264_sei.c \ - $$SRC_DIR/h264_stream.c + h264_nal.c \ + h264_stream.c HEADERS += \ - $$SRC_DIR/bs.h \ - $$SRC_DIR/h264_sei.h \ - $$SRC_DIR/h264_stream.h - -INCLUDEPATH += $$INC_DIR + bs.h \ + h264_stream.h