diff --git a/3rdparty/iaxclient-1 b/3rdparty/iaxclient-1 deleted file mode 160000 index f98d600..0000000 --- a/3rdparty/iaxclient-1 +++ /dev/null @@ -1 +0,0 @@ -Subproject commit f98d600a7711611a863c14b6584e1f0d23c74900 diff --git a/3rdparty/iaxclient-2/COPYING.LIB b/3rdparty/iaxclient-2/COPYING.LIB new file mode 100644 index 0000000..c4792dd --- /dev/null +++ b/3rdparty/iaxclient-2/COPYING.LIB @@ -0,0 +1,515 @@ + + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 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. +^L + 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. +^L + 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. +^L + 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. +^L + 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. +^L + 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. +^L + 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. +^L + 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 +^L + 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 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 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/3rdparty/iaxclient-2/README b/3rdparty/iaxclient-2/README new file mode 100644 index 0000000..04c1b5d --- /dev/null +++ b/3rdparty/iaxclient-2/README @@ -0,0 +1,154 @@ +======================================================================= +BUILDING THE LIBRARY: (tested on Gentoo/Ubuntu/Windows XP/Windows 7) + +* Linux: +first Install dev tools (gcc, cmake, make, ..) +sudo apt-get install build-essential cmake libopenal-dev libopenal1 +mkdir build/ +cd build/ +cmake ../lib +make + +- Iaxclient: +cd lib +mkdir build && cd build +cmake .. +make + +======================================================================= +BUILDING THE CLIENT + +cd .. +cd simpleclient +make + +======================================================================= +LICENSES + + +The iaxclient library itself, is provided under the terms of the LGPL: + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Library General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Library General Public License for more details. + + You should have received a copy of the GNU Library General Public + License along with this library; if not, write to the Free + Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, + MA 02111-1307, USA + +The iaxclient library may also include, when compiled, works distributed +under other licenses. See those directories and source files for +specifics. These include: + + libiax: (c) 2001 Mark Spencer under the LGPL. + libiax2: (c) 2001 Mark Spencer under the LGPL. + gsm encoder: Copyright 1992, 1993, 1994 by Jutta Degener + and Carsten Bormann, Technische Universitaet Berlin + (free license, terms in gsm/copyright) + portaudio: Copyright (c) 1999-2000 Ross Bencina and Phil Burk + Modified BSD style license, in portaudio/LICENSE.txt + + sox tools: compand.c: Copyright 1999 Chris Bagwell And + Nick Bailey + resample.c: (not currently used) Copyright 1991 + Lance Norskog And Sundry Contributors, + free licenses in source files. + libspeex: (c) various authors + BSD-like license. + + +======================================================================= +CONTRIBUTORS: + +IAXCLIENT itself was contributed to by: + +Steve Kann +Shawn Lawrence +Faizan "Tili" Naqvi [Win32 VC++ build/client] +Scott Lambert [FreeBSD build changes] +Michael Van Donselaar [Win32/MinGW build directions, UI changes, IAXComm phone ] +Steven Sokol [ Debugging, Blind Transfer ] +Stephan Kauss [ 32-bit alignment for IAX2 ] +Stephen Uhler [Solaris build, tkiaxphone] +Steve Underwood [PLC implementation from spandsp] +Jean-Denis Girard [URL Receive implementation] +Panfilov Dmitry [Basic ALSA-native audio driver] +Mihai Balea +Bill Welch [Project files for several MS development environments] + + +In addition to including libiax, IAXCLIENT is also based in part on code +included in test clients within libiax itself. + +The included sub-libraries, including libiax, libiax2, gsm, portaudio, +and the sox-derived filters, were developed by others, as noted in above +and in their sources. We couldn't have built IAXCLIENT (or, it would +have been much more difficult!) without the great work from these +projects. + +======================================================================= +LIBRARY ORGANIZATION/DESIGN/CODING CONVENTION NOTES + +The iaxclient library is designed to be a small, simple library that +encapsulates all that you need in order to make IAX protocol telephony +programs. + +All exported symbols should be prefixed with "iaxc_", to avoid namespace +collisions/pollution in programs using this library. + +The header file "iaxclient.h" should contain those declarations needed +by client programs, but not rely on other headers (i.e. those from +included libraries). The "iaxclient-lib.h" header file is the main +header file for the library's internal declarations. + + +========================================================================= + +CODECS + +The codec API is pretty straightforward; just use any of the existing +available codecs as a guide. The only place in the main code they +interface is the switch in audio_encode.c:create_codec + +ILBC + +Lots of people are enamored with iLBC lately, so I put this together for +them. Personally, I prefer speex, because it seems to sound just as +good, but has no license restrictions. With proper compilation options +(i.e. use it's SSE optimizations), it can be made even faster than the +iLBC reference. + +There is glue to build iaxclient with iLBC available in the source, but +the source to iLBC itself is _not_ included. This is primarily because +of the licensing issues. + +I'm not a lawyer, but it appears that iLBC's license would make it +impossible to build iaxclient and link it with a GPL front-end, meaning +a library built this way is no longer something that could be considered +LGPL. However, you could probably build a client using iLBC and +distribute it legally, if you follow the rules in the LGPL. So, this is +an issue for you and your legal counsel to figure out. + +To actually build iaxclient with iLBC, though is very easy. Just make a +directory under lib named iLBC, and drop the iLBC reference sources into +it, then change CODEC_ILBC=0 to CODEC_ILBC=1 in the Makefile, and away +you go. + +The source presently is set up for the draft-5 version. + +The iLBC license and software can be found here +http://www.ilbcfreeware.org/software.html +(sources are also in asterisk). + +========================================================================= + +AUDIO DRIVERS + +Use alsa diff --git a/3rdparty/iaxclient-2/lib/AL/al.h b/3rdparty/iaxclient-2/lib/AL/al.h new file mode 100644 index 0000000..413b383 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/al.h @@ -0,0 +1,656 @@ +#ifndef AL_AL_H +#define AL_AL_H + +#if defined(__cplusplus) +extern "C" { +#endif + +#ifndef AL_API + #if defined(AL_LIBTYPE_STATIC) + #define AL_API + #elif defined(_WIN32) + #define AL_API __declspec(dllimport) + #else + #define AL_API extern + #endif +#endif + +#if defined(_WIN32) + #define AL_APIENTRY __cdecl +#else + #define AL_APIENTRY +#endif + + +/** Deprecated macro. */ +#define OPENAL +#define ALAPI AL_API +#define ALAPIENTRY AL_APIENTRY +#define AL_INVALID (-1) +#define AL_ILLEGAL_ENUM AL_INVALID_ENUM +#define AL_ILLEGAL_COMMAND AL_INVALID_OPERATION + +/** Supported AL version. */ +#define AL_VERSION_1_0 +#define AL_VERSION_1_1 + +/** 8-bit boolean */ +typedef char ALboolean; + +/** character */ +typedef char ALchar; + +/** signed 8-bit 2's complement integer */ +typedef signed char ALbyte; + +/** unsigned 8-bit integer */ +typedef unsigned char ALubyte; + +/** signed 16-bit 2's complement integer */ +typedef short ALshort; + +/** unsigned 16-bit integer */ +typedef unsigned short ALushort; + +/** signed 32-bit 2's complement integer */ +typedef int ALint; + +/** unsigned 32-bit integer */ +typedef unsigned int ALuint; + +/** non-negative 32-bit binary integer size */ +typedef int ALsizei; + +/** enumerated 32-bit value */ +typedef int ALenum; + +/** 32-bit IEEE754 floating-point */ +typedef float ALfloat; + +/** 64-bit IEEE754 floating-point */ +typedef double ALdouble; + +/** void type (for opaque pointers only) */ +typedef void ALvoid; + + +/* Enumerant values begin at column 50. No tabs. */ + +/** "no distance model" or "no buffer" */ +#define AL_NONE 0 + +/** Boolean False. */ +#define AL_FALSE 0 + +/** Boolean True. */ +#define AL_TRUE 1 + + +/** + * Relative source. + * Type: ALboolean + * Range: [AL_TRUE, AL_FALSE] + * Default: AL_FALSE + * + * Specifies if the Source has relative coordinates. + */ +#define AL_SOURCE_RELATIVE 0x202 + + +/** + * Inner cone angle, in degrees. + * Type: ALint, ALfloat + * Range: [0 - 360] + * Default: 360 + * + * The angle covered by the inner cone, where the source will not attenuate. + */ +#define AL_CONE_INNER_ANGLE 0x1001 + +/** + * Outer cone angle, in degrees. + * Range: [0 - 360] + * Default: 360 + * + * The angle covered by the outer cone, where the source will be fully + * attenuated. + */ +#define AL_CONE_OUTER_ANGLE 0x1002 + +/** + * Source pitch. + * Type: ALfloat + * Range: [0.5 - 2.0] + * Default: 1.0 + * + * A multiplier for the frequency (sample rate) of the source's buffer. + */ +#define AL_PITCH 0x1003 + +/** + * Source or listener position. + * Type: ALfloat[3], ALint[3] + * Default: {0, 0, 0} + * + * The source or listener location in three dimensional space. + * + * OpenAL, like OpenGL, uses a right handed coordinate system, where in a + * frontal default view X (thumb) points right, Y points up (index finger), and + * Z points towards the viewer/camera (middle finger). + * + * To switch from a left handed coordinate system, flip the sign on the Z + * coordinate. + */ +#define AL_POSITION 0x1004 + +/** + * Source direction. + * Type: ALfloat[3], ALint[3] + * Default: {0, 0, 0} + * + * Specifies the current direction in local space. + * A zero-length vector specifies an omni-directional source (cone is ignored). + */ +#define AL_DIRECTION 0x1005 + +/** + * Source or listener velocity. + * Type: ALfloat[3], ALint[3] + * Default: {0, 0, 0} + * + * Specifies the current velocity in local space. + */ +#define AL_VELOCITY 0x1006 + +/** + * Source looping. + * Type: ALboolean + * Range: [AL_TRUE, AL_FALSE] + * Default: AL_FALSE + * + * Specifies whether source is looping. + */ +#define AL_LOOPING 0x1007 + +/** + * Source buffer. + * Type: ALuint + * Range: any valid Buffer. + * + * Specifies the buffer to provide sound samples. + */ +#define AL_BUFFER 0x1009 + +/** + * Source or listener gain. + * Type: ALfloat + * Range: [0.0 - ] + * + * A value of 1.0 means unattenuated. Each division by 2 equals an attenuation + * of about -6dB. Each multiplicaton by 2 equals an amplification of about + * +6dB. + * + * A value of 0.0 is meaningless with respect to a logarithmic scale; it is + * silent. + */ +#define AL_GAIN 0x100A + +/** + * Minimum source gain. + * Type: ALfloat + * Range: [0.0 - 1.0] + * + * The minimum gain allowed for a source, after distance and cone attenation is + * applied (if applicable). + */ +#define AL_MIN_GAIN 0x100D + +/** + * Maximum source gain. + * Type: ALfloat + * Range: [0.0 - 1.0] + * + * The maximum gain allowed for a source, after distance and cone attenation is + * applied (if applicable). + */ +#define AL_MAX_GAIN 0x100E + +/** + * Listener orientation. + * Type: ALfloat[6] + * Default: {0.0, 0.0, -1.0, 0.0, 1.0, 0.0} + * + * Effectively two three dimensional vectors. The first vector is the front (or + * "at") and the second is the top (or "up"). + * + * Both vectors are in local space. + */ +#define AL_ORIENTATION 0x100F + +/** + * Source state (query only). + * Type: ALint + * Range: [AL_INITIAL, AL_PLAYING, AL_PAUSED, AL_STOPPED] + */ +#define AL_SOURCE_STATE 0x1010 + +/** Source state value. */ +#define AL_INITIAL 0x1011 +#define AL_PLAYING 0x1012 +#define AL_PAUSED 0x1013 +#define AL_STOPPED 0x1014 + +/** + * Source Buffer Queue size (query only). + * Type: ALint + * + * The number of buffers queued using alSourceQueueBuffers, minus the buffers + * removed with alSourceUnqueueBuffers. + */ +#define AL_BUFFERS_QUEUED 0x1015 + +/** + * Source Buffer Queue processed count (query only). + * Type: ALint + * + * The number of queued buffers that have been fully processed, and can be + * removed with alSourceUnqueueBuffers. + * + * Looping sources will never fully process buffers because they will be set to + * play again for when the source loops. + */ +#define AL_BUFFERS_PROCESSED 0x1016 + +/** + * Source reference distance. + * Type: ALfloat + * Range: [0.0 - ] + * Default: 1.0 + * + * The distance in units that no attenuation occurs. + * + * At 0.0, no distance attenuation ever occurs on non-linear attenuation models. + */ +#define AL_REFERENCE_DISTANCE 0x1020 + +/** + * Source rolloff factor. + * Type: ALfloat + * Range: [0.0 - ] + * Default: 1.0 + * + * Multiplier to exaggerate or diminish distance attenuation. + * + * At 0.0, no distance attenuation ever occurs. + */ +#define AL_ROLLOFF_FACTOR 0x1021 + +/** + * Outer cone gain. + * Type: ALfloat + * Range: [0.0 - 1.0] + * Default: 0.0 + * + * The gain attenuation applied when the listener is outside of the source's + * outer cone. + */ +#define AL_CONE_OUTER_GAIN 0x1022 + +/** + * Source maximum distance. + * Type: ALfloat + * Range: [0.0 - ] + * Default: +inf + * + * The distance above which the source is not attenuated any further with a + * clamped distance model, or where attenuation reaches 0.0 gain for linear + * distance models with a default rolloff factor. + */ +#define AL_MAX_DISTANCE 0x1023 + +/** Source buffer position, in seconds */ +#define AL_SEC_OFFSET 0x1024 +/** Source buffer position, in sample frames */ +#define AL_SAMPLE_OFFSET 0x1025 +/** Source buffer position, in bytes */ +#define AL_BYTE_OFFSET 0x1026 + +/** + * Source type (query only). + * Type: ALint + * Range: [AL_STATIC, AL_STREAMING, AL_UNDETERMINED] + * + * A Source is Static if a Buffer has been attached using AL_BUFFER. + * + * A Source is Streaming if one or more Buffers have been attached using + * alSourceQueueBuffers. + * + * A Source is Undetermined when it has the NULL buffer attached using + * AL_BUFFER. + */ +#define AL_SOURCE_TYPE 0x1027 + +/** Source type value. */ +#define AL_STATIC 0x1028 +#define AL_STREAMING 0x1029 +#define AL_UNDETERMINED 0x1030 + +/** Buffer format specifier. */ +#define AL_FORMAT_MONO8 0x1100 +#define AL_FORMAT_MONO16 0x1101 +#define AL_FORMAT_STEREO8 0x1102 +#define AL_FORMAT_STEREO16 0x1103 + +/** Buffer frequency (query only). */ +#define AL_FREQUENCY 0x2001 +/** Buffer bits per sample (query only). */ +#define AL_BITS 0x2002 +/** Buffer channel count (query only). */ +#define AL_CHANNELS 0x2003 +/** Buffer data size (query only). */ +#define AL_SIZE 0x2004 + +/** + * Buffer state. + * + * Not for public use. + */ +#define AL_UNUSED 0x2010 +#define AL_PENDING 0x2011 +#define AL_PROCESSED 0x2012 + + +/** No error. */ +#define AL_NO_ERROR 0 + +/** Invalid name paramater passed to AL call. */ +#define AL_INVALID_NAME 0xA001 + +/** Invalid enum parameter passed to AL call. */ +#define AL_INVALID_ENUM 0xA002 + +/** Invalid value parameter passed to AL call. */ +#define AL_INVALID_VALUE 0xA003 + +/** Illegal AL call. */ +#define AL_INVALID_OPERATION 0xA004 + +/** Not enough memory. */ +#define AL_OUT_OF_MEMORY 0xA005 + + +/** Context string: Vendor ID. */ +#define AL_VENDOR 0xB001 +/** Context string: Version. */ +#define AL_VERSION 0xB002 +/** Context string: Renderer ID. */ +#define AL_RENDERER 0xB003 +/** Context string: Space-separated extension list. */ +#define AL_EXTENSIONS 0xB004 + + +/** + * Doppler scale. + * Type: ALfloat + * Range: [0.0 - ] + * Default: 1.0 + * + * Scale for source and listener velocities. + */ +#define AL_DOPPLER_FACTOR 0xC000 +AL_API void AL_APIENTRY alDopplerFactor(ALfloat value); + +/** + * Doppler velocity (deprecated). + * + * A multiplier applied to the Speed of Sound. + */ +#define AL_DOPPLER_VELOCITY 0xC001 +AL_API void AL_APIENTRY alDopplerVelocity(ALfloat value); + +/** + * Speed of Sound, in units per second. + * Type: ALfloat + * Range: [0.0001 - ] + * Default: 343.3 + * + * The speed at which sound waves are assumed to travel, when calculating the + * doppler effect. + */ +#define AL_SPEED_OF_SOUND 0xC003 +AL_API void AL_APIENTRY alSpeedOfSound(ALfloat value); + +/** + * Distance attenuation model. + * Type: ALint + * Range: [AL_NONE, AL_INVERSE_DISTANCE, AL_INVERSE_DISTANCE_CLAMPED, + * AL_LINEAR_DISTANCE, AL_LINEAR_DISTANCE_CLAMPED, + * AL_EXPONENT_DISTANCE, AL_EXPONENT_DISTANCE_CLAMPED] + * Default: AL_INVERSE_DISTANCE_CLAMPED + * + * The model by which sources attenuate with distance. + * + * None - No distance attenuation. + * Inverse - Doubling the distance halves the source gain. + * Linear - Linear gain scaling between the reference and max distances. + * Exponent - Exponential gain dropoff. + * + * Clamped variations work like the non-clamped counterparts, except the + * distance calculated is clamped between the reference and max distances. + */ +#define AL_DISTANCE_MODEL 0xD000 +AL_API void AL_APIENTRY alDistanceModel(ALenum distanceModel); + +/** Distance model value. */ +#define AL_INVERSE_DISTANCE 0xD001 +#define AL_INVERSE_DISTANCE_CLAMPED 0xD002 +#define AL_LINEAR_DISTANCE 0xD003 +#define AL_LINEAR_DISTANCE_CLAMPED 0xD004 +#define AL_EXPONENT_DISTANCE 0xD005 +#define AL_EXPONENT_DISTANCE_CLAMPED 0xD006 + +/** Renderer State management. */ +AL_API void AL_APIENTRY alEnable(ALenum capability); +AL_API void AL_APIENTRY alDisable(ALenum capability); +AL_API ALboolean AL_APIENTRY alIsEnabled(ALenum capability); + +/** State retrieval. */ +AL_API const ALchar* AL_APIENTRY alGetString(ALenum param); +AL_API void AL_APIENTRY alGetBooleanv(ALenum param, ALboolean *values); +AL_API void AL_APIENTRY alGetIntegerv(ALenum param, ALint *values); +AL_API void AL_APIENTRY alGetFloatv(ALenum param, ALfloat *values); +AL_API void AL_APIENTRY alGetDoublev(ALenum param, ALdouble *values); +AL_API ALboolean AL_APIENTRY alGetBoolean(ALenum param); +AL_API ALint AL_APIENTRY alGetInteger(ALenum param); +AL_API ALfloat AL_APIENTRY alGetFloat(ALenum param); +AL_API ALdouble AL_APIENTRY alGetDouble(ALenum param); + +/** + * Error retrieval. + * + * Obtain the first error generated in the AL context since the last check. + */ +AL_API ALenum AL_APIENTRY alGetError(void); + +/** + * Extension support. + * + * Query for the presence of an extension, and obtain any appropriate function + * pointers and enum values. + */ +AL_API ALboolean AL_APIENTRY alIsExtensionPresent(const ALchar *extname); +AL_API void* AL_APIENTRY alGetProcAddress(const ALchar *fname); +AL_API ALenum AL_APIENTRY alGetEnumValue(const ALchar *ename); + + +/** Set Listener parameters */ +AL_API void AL_APIENTRY alListenerf(ALenum param, ALfloat value); +AL_API void AL_APIENTRY alListener3f(ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +AL_API void AL_APIENTRY alListenerfv(ALenum param, const ALfloat *values); +AL_API void AL_APIENTRY alListeneri(ALenum param, ALint value); +AL_API void AL_APIENTRY alListener3i(ALenum param, ALint value1, ALint value2, ALint value3); +AL_API void AL_APIENTRY alListeneriv(ALenum param, const ALint *values); + +/** Get Listener parameters */ +AL_API void AL_APIENTRY alGetListenerf(ALenum param, ALfloat *value); +AL_API void AL_APIENTRY alGetListener3f(ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +AL_API void AL_APIENTRY alGetListenerfv(ALenum param, ALfloat *values); +AL_API void AL_APIENTRY alGetListeneri(ALenum param, ALint *value); +AL_API void AL_APIENTRY alGetListener3i(ALenum param, ALint *value1, ALint *value2, ALint *value3); +AL_API void AL_APIENTRY alGetListeneriv(ALenum param, ALint *values); + + +/** Create Source objects. */ +AL_API void AL_APIENTRY alGenSources(ALsizei n, ALuint *sources); +/** Delete Source objects. */ +AL_API void AL_APIENTRY alDeleteSources(ALsizei n, const ALuint *sources); +/** Verify a handle is a valid Source. */ +AL_API ALboolean AL_APIENTRY alIsSource(ALuint source); + +/** Set Source parameters. */ +AL_API void AL_APIENTRY alSourcef(ALuint source, ALenum param, ALfloat value); +AL_API void AL_APIENTRY alSource3f(ALuint source, ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +AL_API void AL_APIENTRY alSourcefv(ALuint source, ALenum param, const ALfloat *values); +AL_API void AL_APIENTRY alSourcei(ALuint source, ALenum param, ALint value); +AL_API void AL_APIENTRY alSource3i(ALuint source, ALenum param, ALint value1, ALint value2, ALint value3); +AL_API void AL_APIENTRY alSourceiv(ALuint source, ALenum param, const ALint *values); + +/** Get Source parameters. */ +AL_API void AL_APIENTRY alGetSourcef(ALuint source, ALenum param, ALfloat *value); +AL_API void AL_APIENTRY alGetSource3f(ALuint source, ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +AL_API void AL_APIENTRY alGetSourcefv(ALuint source, ALenum param, ALfloat *values); +AL_API void AL_APIENTRY alGetSourcei(ALuint source, ALenum param, ALint *value); +AL_API void AL_APIENTRY alGetSource3i(ALuint source, ALenum param, ALint *value1, ALint *value2, ALint *value3); +AL_API void AL_APIENTRY alGetSourceiv(ALuint source, ALenum param, ALint *values); + + +/** Play, replay, or resume (if paused) a list of Sources */ +AL_API void AL_APIENTRY alSourcePlayv(ALsizei n, const ALuint *sources); +/** Stop a list of Sources */ +AL_API void AL_APIENTRY alSourceStopv(ALsizei n, const ALuint *sources); +/** Rewind a list of Sources */ +AL_API void AL_APIENTRY alSourceRewindv(ALsizei n, const ALuint *sources); +/** Pause a list of Sources */ +AL_API void AL_APIENTRY alSourcePausev(ALsizei n, const ALuint *sources); + +/** Play, replay, or resume a Source */ +AL_API void AL_APIENTRY alSourcePlay(ALuint source); +/** Stop a Source */ +AL_API void AL_APIENTRY alSourceStop(ALuint source); +/** Rewind a Source (set playback postiton to beginning) */ +AL_API void AL_APIENTRY alSourceRewind(ALuint source); +/** Pause a Source */ +AL_API void AL_APIENTRY alSourcePause(ALuint source); + +/** Queue buffers onto a source */ +AL_API void AL_APIENTRY alSourceQueueBuffers(ALuint source, ALsizei nb, const ALuint *buffers); +/** Unqueue processed buffers from a source */ +AL_API void AL_APIENTRY alSourceUnqueueBuffers(ALuint source, ALsizei nb, ALuint *buffers); + + +/** Create Buffer objects */ +AL_API void AL_APIENTRY alGenBuffers(ALsizei n, ALuint *buffers); +/** Delete Buffer objects */ +AL_API void AL_APIENTRY alDeleteBuffers(ALsizei n, const ALuint *buffers); +/** Verify a handle is a valid Buffer */ +AL_API ALboolean AL_APIENTRY alIsBuffer(ALuint buffer); + +/** Specifies the data to be copied into a buffer */ +AL_API void AL_APIENTRY alBufferData(ALuint buffer, ALenum format, const ALvoid *data, ALsizei size, ALsizei freq); + +/** Set Buffer parameters, */ +AL_API void AL_APIENTRY alBufferf(ALuint buffer, ALenum param, ALfloat value); +AL_API void AL_APIENTRY alBuffer3f(ALuint buffer, ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +AL_API void AL_APIENTRY alBufferfv(ALuint buffer, ALenum param, const ALfloat *values); +AL_API void AL_APIENTRY alBufferi(ALuint buffer, ALenum param, ALint value); +AL_API void AL_APIENTRY alBuffer3i(ALuint buffer, ALenum param, ALint value1, ALint value2, ALint value3); +AL_API void AL_APIENTRY alBufferiv(ALuint buffer, ALenum param, const ALint *values); + +/** Get Buffer parameters. */ +AL_API void AL_APIENTRY alGetBufferf(ALuint buffer, ALenum param, ALfloat *value); +AL_API void AL_APIENTRY alGetBuffer3f(ALuint buffer, ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +AL_API void AL_APIENTRY alGetBufferfv(ALuint buffer, ALenum param, ALfloat *values); +AL_API void AL_APIENTRY alGetBufferi(ALuint buffer, ALenum param, ALint *value); +AL_API void AL_APIENTRY alGetBuffer3i(ALuint buffer, ALenum param, ALint *value1, ALint *value2, ALint *value3); +AL_API void AL_APIENTRY alGetBufferiv(ALuint buffer, ALenum param, ALint *values); + +/** Pointer-to-function type, useful for dynamically getting AL entry points. */ +typedef void (AL_APIENTRY *LPALENABLE)(ALenum capability); +typedef void (AL_APIENTRY *LPALDISABLE)(ALenum capability); +typedef ALboolean (AL_APIENTRY *LPALISENABLED)(ALenum capability); +typedef const ALchar* (AL_APIENTRY *LPALGETSTRING)(ALenum param); +typedef void (AL_APIENTRY *LPALGETBOOLEANV)(ALenum param, ALboolean *values); +typedef void (AL_APIENTRY *LPALGETINTEGERV)(ALenum param, ALint *values); +typedef void (AL_APIENTRY *LPALGETFLOATV)(ALenum param, ALfloat *values); +typedef void (AL_APIENTRY *LPALGETDOUBLEV)(ALenum param, ALdouble *values); +typedef ALboolean (AL_APIENTRY *LPALGETBOOLEAN)(ALenum param); +typedef ALint (AL_APIENTRY *LPALGETINTEGER)(ALenum param); +typedef ALfloat (AL_APIENTRY *LPALGETFLOAT)(ALenum param); +typedef ALdouble (AL_APIENTRY *LPALGETDOUBLE)(ALenum param); +typedef ALenum (AL_APIENTRY *LPALGETERROR)(void); +typedef ALboolean (AL_APIENTRY *LPALISEXTENSIONPRESENT)(const ALchar *extname); +typedef void* (AL_APIENTRY *LPALGETPROCADDRESS)(const ALchar *fname); +typedef ALenum (AL_APIENTRY *LPALGETENUMVALUE)(const ALchar *ename); +typedef void (AL_APIENTRY *LPALLISTENERF)(ALenum param, ALfloat value); +typedef void (AL_APIENTRY *LPALLISTENER3F)(ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +typedef void (AL_APIENTRY *LPALLISTENERFV)(ALenum param, const ALfloat *values); +typedef void (AL_APIENTRY *LPALLISTENERI)(ALenum param, ALint value); +typedef void (AL_APIENTRY *LPALLISTENER3I)(ALenum param, ALint value1, ALint value2, ALint value3); +typedef void (AL_APIENTRY *LPALLISTENERIV)(ALenum param, const ALint *values); +typedef void (AL_APIENTRY *LPALGETLISTENERF)(ALenum param, ALfloat *value); +typedef void (AL_APIENTRY *LPALGETLISTENER3F)(ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +typedef void (AL_APIENTRY *LPALGETLISTENERFV)(ALenum param, ALfloat *values); +typedef void (AL_APIENTRY *LPALGETLISTENERI)(ALenum param, ALint *value); +typedef void (AL_APIENTRY *LPALGETLISTENER3I)(ALenum param, ALint *value1, ALint *value2, ALint *value3); +typedef void (AL_APIENTRY *LPALGETLISTENERIV)(ALenum param, ALint *values); +typedef void (AL_APIENTRY *LPALGENSOURCES)(ALsizei n, ALuint *sources); +typedef void (AL_APIENTRY *LPALDELETESOURCES)(ALsizei n, const ALuint *sources); +typedef ALboolean (AL_APIENTRY *LPALISSOURCE)(ALuint source); +typedef void (AL_APIENTRY *LPALSOURCEF)(ALuint source, ALenum param, ALfloat value); +typedef void (AL_APIENTRY *LPALSOURCE3F)(ALuint source, ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +typedef void (AL_APIENTRY *LPALSOURCEFV)(ALuint source, ALenum param, const ALfloat *values); +typedef void (AL_APIENTRY *LPALSOURCEI)(ALuint source, ALenum param, ALint value); +typedef void (AL_APIENTRY *LPALSOURCE3I)(ALuint source, ALenum param, ALint value1, ALint value2, ALint value3); +typedef void (AL_APIENTRY *LPALSOURCEIV)(ALuint source, ALenum param, const ALint *values); +typedef void (AL_APIENTRY *LPALGETSOURCEF)(ALuint source, ALenum param, ALfloat *value); +typedef void (AL_APIENTRY *LPALGETSOURCE3F)(ALuint source, ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +typedef void (AL_APIENTRY *LPALGETSOURCEFV)(ALuint source, ALenum param, ALfloat *values); +typedef void (AL_APIENTRY *LPALGETSOURCEI)(ALuint source, ALenum param, ALint *value); +typedef void (AL_APIENTRY *LPALGETSOURCE3I)(ALuint source, ALenum param, ALint *value1, ALint *value2, ALint *value3); +typedef void (AL_APIENTRY *LPALGETSOURCEIV)(ALuint source, ALenum param, ALint *values); +typedef void (AL_APIENTRY *LPALSOURCEPLAYV)(ALsizei n, const ALuint *sources); +typedef void (AL_APIENTRY *LPALSOURCESTOPV)(ALsizei n, const ALuint *sources); +typedef void (AL_APIENTRY *LPALSOURCEREWINDV)(ALsizei n, const ALuint *sources); +typedef void (AL_APIENTRY *LPALSOURCEPAUSEV)(ALsizei n, const ALuint *sources); +typedef void (AL_APIENTRY *LPALSOURCEPLAY)(ALuint source); +typedef void (AL_APIENTRY *LPALSOURCESTOP)(ALuint source); +typedef void (AL_APIENTRY *LPALSOURCEREWIND)(ALuint source); +typedef void (AL_APIENTRY *LPALSOURCEPAUSE)(ALuint source); +typedef void (AL_APIENTRY *LPALSOURCEQUEUEBUFFERS)(ALuint source, ALsizei nb, const ALuint *buffers); +typedef void (AL_APIENTRY *LPALSOURCEUNQUEUEBUFFERS)(ALuint source, ALsizei nb, ALuint *buffers); +typedef void (AL_APIENTRY *LPALGENBUFFERS)(ALsizei n, ALuint *buffers); +typedef void (AL_APIENTRY *LPALDELETEBUFFERS)(ALsizei n, const ALuint *buffers); +typedef ALboolean (AL_APIENTRY *LPALISBUFFER)(ALuint buffer); +typedef void (AL_APIENTRY *LPALBUFFERDATA)(ALuint buffer, ALenum format, const ALvoid *data, ALsizei size, ALsizei freq); +typedef void (AL_APIENTRY *LPALBUFFERF)(ALuint buffer, ALenum param, ALfloat value); +typedef void (AL_APIENTRY *LPALBUFFER3F)(ALuint buffer, ALenum param, ALfloat value1, ALfloat value2, ALfloat value3); +typedef void (AL_APIENTRY *LPALBUFFERFV)(ALuint buffer, ALenum param, const ALfloat *values); +typedef void (AL_APIENTRY *LPALBUFFERI)(ALuint buffer, ALenum param, ALint value); +typedef void (AL_APIENTRY *LPALBUFFER3I)(ALuint buffer, ALenum param, ALint value1, ALint value2, ALint value3); +typedef void (AL_APIENTRY *LPALBUFFERIV)(ALuint buffer, ALenum param, const ALint *values); +typedef void (AL_APIENTRY *LPALGETBUFFERF)(ALuint buffer, ALenum param, ALfloat *value); +typedef void (AL_APIENTRY *LPALGETBUFFER3F)(ALuint buffer, ALenum param, ALfloat *value1, ALfloat *value2, ALfloat *value3); +typedef void (AL_APIENTRY *LPALGETBUFFERFV)(ALuint buffer, ALenum param, ALfloat *values); +typedef void (AL_APIENTRY *LPALGETBUFFERI)(ALuint buffer, ALenum param, ALint *value); +typedef void (AL_APIENTRY *LPALGETBUFFER3I)(ALuint buffer, ALenum param, ALint *value1, ALint *value2, ALint *value3); +typedef void (AL_APIENTRY *LPALGETBUFFERIV)(ALuint buffer, ALenum param, ALint *values); +typedef void (AL_APIENTRY *LPALDOPPLERFACTOR)(ALfloat value); +typedef void (AL_APIENTRY *LPALDOPPLERVELOCITY)(ALfloat value); +typedef void (AL_APIENTRY *LPALSPEEDOFSOUND)(ALfloat value); +typedef void (AL_APIENTRY *LPALDISTANCEMODEL)(ALenum distanceModel); + +#if defined(__cplusplus) +} /* extern "C" */ +#endif + +#endif /* AL_AL_H */ diff --git a/3rdparty/iaxclient-2/lib/AL/alc.h b/3rdparty/iaxclient-2/lib/AL/alc.h new file mode 100644 index 0000000..294e8b3 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/alc.h @@ -0,0 +1,237 @@ +#ifndef AL_ALC_H +#define AL_ALC_H + +#if defined(__cplusplus) +extern "C" { +#endif + +#ifndef ALC_API + #if defined(AL_LIBTYPE_STATIC) + #define ALC_API + #elif defined(_WIN32) + #define ALC_API __declspec(dllimport) + #else + #define ALC_API extern + #endif +#endif + +#if defined(_WIN32) + #define ALC_APIENTRY __cdecl +#else + #define ALC_APIENTRY +#endif + + +/** Deprecated macro. */ +#define ALCAPI ALC_API +#define ALCAPIENTRY ALC_APIENTRY +#define ALC_INVALID 0 + +/** Supported ALC version? */ +#define ALC_VERSION_0_1 1 + +/** Opaque device handle */ +typedef struct ALCdevice_struct ALCdevice; +/** Opaque context handle */ +typedef struct ALCcontext_struct ALCcontext; + +/** 8-bit boolean */ +typedef char ALCboolean; + +/** character */ +typedef char ALCchar; + +/** signed 8-bit 2's complement integer */ +typedef signed char ALCbyte; + +/** unsigned 8-bit integer */ +typedef unsigned char ALCubyte; + +/** signed 16-bit 2's complement integer */ +typedef short ALCshort; + +/** unsigned 16-bit integer */ +typedef unsigned short ALCushort; + +/** signed 32-bit 2's complement integer */ +typedef int ALCint; + +/** unsigned 32-bit integer */ +typedef unsigned int ALCuint; + +/** non-negative 32-bit binary integer size */ +typedef int ALCsizei; + +/** enumerated 32-bit value */ +typedef int ALCenum; + +/** 32-bit IEEE754 floating-point */ +typedef float ALCfloat; + +/** 64-bit IEEE754 floating-point */ +typedef double ALCdouble; + +/** void type (for opaque pointers only) */ +typedef void ALCvoid; + + +/* Enumerant values begin at column 50. No tabs. */ + +/** Boolean False. */ +#define ALC_FALSE 0 + +/** Boolean True. */ +#define ALC_TRUE 1 + +/** Context attribute: Hz. */ +#define ALC_FREQUENCY 0x1007 + +/** Context attribute: Hz. */ +#define ALC_REFRESH 0x1008 + +/** Context attribute: AL_TRUE or AL_FALSE. */ +#define ALC_SYNC 0x1009 + +/** Context attribute: requested Mono (3D) Sources. */ +#define ALC_MONO_SOURCES 0x1010 + +/** Context attribute: requested Stereo Sources. */ +#define ALC_STEREO_SOURCES 0x1011 + +/** No error. */ +#define ALC_NO_ERROR 0 + +/** Invalid device handle. */ +#define ALC_INVALID_DEVICE 0xA001 + +/** Invalid context handle. */ +#define ALC_INVALID_CONTEXT 0xA002 + +/** Invalid enum parameter passed to an ALC call. */ +#define ALC_INVALID_ENUM 0xA003 + +/** Invalid value parameter passed to an ALC call. */ +#define ALC_INVALID_VALUE 0xA004 + +/** Out of memory. */ +#define ALC_OUT_OF_MEMORY 0xA005 + + +/** Runtime ALC version. */ +#define ALC_MAJOR_VERSION 0x1000 +#define ALC_MINOR_VERSION 0x1001 + +/** Context attribute list properties. */ +#define ALC_ATTRIBUTES_SIZE 0x1002 +#define ALC_ALL_ATTRIBUTES 0x1003 + +/** String for the default device specifier. */ +#define ALC_DEFAULT_DEVICE_SPECIFIER 0x1004 +/** + * String for the given device's specifier. + * + * If device handle is NULL, it is instead a null-char separated list of + * strings of known device specifiers (list ends with an empty string). + */ +#define ALC_DEVICE_SPECIFIER 0x1005 +/** String for space-separated list of ALC extensions. */ +#define ALC_EXTENSIONS 0x1006 + + +/** Capture extension */ +#define ALC_EXT_CAPTURE 1 +/** + * String for the given capture device's specifier. + * + * If device handle is NULL, it is instead a null-char separated list of + * strings of known capture device specifiers (list ends with an empty string). + */ +#define ALC_CAPTURE_DEVICE_SPECIFIER 0x310 +/** String for the default capture device specifier. */ +#define ALC_CAPTURE_DEFAULT_DEVICE_SPECIFIER 0x311 +/** Number of sample frames available for capture. */ +#define ALC_CAPTURE_SAMPLES 0x312 + + +/** Enumerate All extension */ +#define ALC_ENUMERATE_ALL_EXT 1 +/** String for the default extended device specifier. */ +#define ALC_DEFAULT_ALL_DEVICES_SPECIFIER 0x1012 +/** + * String for the given extended device's specifier. + * + * If device handle is NULL, it is instead a null-char separated list of + * strings of known extended device specifiers (list ends with an empty string). + */ +#define ALC_ALL_DEVICES_SPECIFIER 0x1013 + + +/** Context management. */ +ALC_API ALCcontext* ALC_APIENTRY alcCreateContext(ALCdevice *device, const ALCint* attrlist); +ALC_API ALCboolean ALC_APIENTRY alcMakeContextCurrent(ALCcontext *context); +ALC_API void ALC_APIENTRY alcProcessContext(ALCcontext *context); +ALC_API void ALC_APIENTRY alcSuspendContext(ALCcontext *context); +ALC_API void ALC_APIENTRY alcDestroyContext(ALCcontext *context); +ALC_API ALCcontext* ALC_APIENTRY alcGetCurrentContext(void); +ALC_API ALCdevice* ALC_APIENTRY alcGetContextsDevice(ALCcontext *context); + +/** Device management. */ +ALC_API ALCdevice* ALC_APIENTRY alcOpenDevice(const ALCchar *devicename); +ALC_API ALCboolean ALC_APIENTRY alcCloseDevice(ALCdevice *device); + + +/** + * Error support. + * + * Obtain the most recent Device error. + */ +ALC_API ALCenum ALC_APIENTRY alcGetError(ALCdevice *device); + +/** + * Extension support. + * + * Query for the presence of an extension, and obtain any appropriate + * function pointers and enum values. + */ +ALC_API ALCboolean ALC_APIENTRY alcIsExtensionPresent(ALCdevice *device, const ALCchar *extname); +ALC_API void* ALC_APIENTRY alcGetProcAddress(ALCdevice *device, const ALCchar *funcname); +ALC_API ALCenum ALC_APIENTRY alcGetEnumValue(ALCdevice *device, const ALCchar *enumname); + +/** Query function. */ +ALC_API const ALCchar* ALC_APIENTRY alcGetString(ALCdevice *device, ALCenum param); +ALC_API void ALC_APIENTRY alcGetIntegerv(ALCdevice *device, ALCenum param, ALCsizei size, ALCint *values); + +/** Capture function. */ +ALC_API ALCdevice* ALC_APIENTRY alcCaptureOpenDevice(const ALCchar *devicename, ALCuint frequency, ALCenum format, ALCsizei buffersize); +ALC_API ALCboolean ALC_APIENTRY alcCaptureCloseDevice(ALCdevice *device); +ALC_API void ALC_APIENTRY alcCaptureStart(ALCdevice *device); +ALC_API void ALC_APIENTRY alcCaptureStop(ALCdevice *device); +ALC_API void ALC_APIENTRY alcCaptureSamples(ALCdevice *device, ALCvoid *buffer, ALCsizei samples); + +/** Pointer-to-function type, useful for dynamically getting ALC entry points. */ +typedef ALCcontext* (ALC_APIENTRY *LPALCCREATECONTEXT)(ALCdevice *device, const ALCint *attrlist); +typedef ALCboolean (ALC_APIENTRY *LPALCMAKECONTEXTCURRENT)(ALCcontext *context); +typedef void (ALC_APIENTRY *LPALCPROCESSCONTEXT)(ALCcontext *context); +typedef void (ALC_APIENTRY *LPALCSUSPENDCONTEXT)(ALCcontext *context); +typedef void (ALC_APIENTRY *LPALCDESTROYCONTEXT)(ALCcontext *context); +typedef ALCcontext* (ALC_APIENTRY *LPALCGETCURRENTCONTEXT)(void); +typedef ALCdevice* (ALC_APIENTRY *LPALCGETCONTEXTSDEVICE)(ALCcontext *context); +typedef ALCdevice* (ALC_APIENTRY *LPALCOPENDEVICE)(const ALCchar *devicename); +typedef ALCboolean (ALC_APIENTRY *LPALCCLOSEDEVICE)(ALCdevice *device); +typedef ALCenum (ALC_APIENTRY *LPALCGETERROR)(ALCdevice *device); +typedef ALCboolean (ALC_APIENTRY *LPALCISEXTENSIONPRESENT)(ALCdevice *device, const ALCchar *extname); +typedef void* (ALC_APIENTRY *LPALCGETPROCADDRESS)(ALCdevice *device, const ALCchar *funcname); +typedef ALCenum (ALC_APIENTRY *LPALCGETENUMVALUE)(ALCdevice *device, const ALCchar *enumname); +typedef const ALCchar* (ALC_APIENTRY *LPALCGETSTRING)(ALCdevice *device, ALCenum param); +typedef void (ALC_APIENTRY *LPALCGETINTEGERV)(ALCdevice *device, ALCenum param, ALCsizei size, ALCint *values); +typedef ALCdevice* (ALC_APIENTRY *LPALCCAPTUREOPENDEVICE)(const ALCchar *devicename, ALCuint frequency, ALCenum format, ALCsizei buffersize); +typedef ALCboolean (ALC_APIENTRY *LPALCCAPTURECLOSEDEVICE)(ALCdevice *device); +typedef void (ALC_APIENTRY *LPALCCAPTURESTART)(ALCdevice *device); +typedef void (ALC_APIENTRY *LPALCCAPTURESTOP)(ALCdevice *device); +typedef void (ALC_APIENTRY *LPALCCAPTURESAMPLES)(ALCdevice *device, ALCvoid *buffer, ALCsizei samples); + +#if defined(__cplusplus) +} +#endif + +#endif /* AL_ALC_H */ diff --git a/3rdparty/iaxclient-2/lib/AL/alext.h b/3rdparty/iaxclient-2/lib/AL/alext.h new file mode 100644 index 0000000..7d2a952 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/alext.h @@ -0,0 +1,400 @@ +/** + * OpenAL cross platform audio library + * Copyright (C) 2008 by authors. + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Library General Public + * License as published by the Free Software Foundation; either + * version 2 of the License, or (at your option) any later version. + * + * This library is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Library General Public License for more details. + * + * You should have received a copy of the GNU Library General Public + * License along with this library; if not, write to the + * Free Software Foundation, Inc., 59 Temple Place - Suite 330, + * Boston, MA 02111-1307, USA. + * Or go to http://www.gnu.org/copyleft/lgpl.html + */ + +#ifndef AL_ALEXT_H +#define AL_ALEXT_H + +#include +/* Define int64_t and uint64_t types */ +#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L +#include +#elif defined(_WIN32) && defined(__GNUC__) +#include +#elif defined(_WIN32) +typedef __int64 int64_t; +typedef unsigned __int64 uint64_t; +#else +/* Fallback if nothing above works */ +#include +#endif + +#include "alc.h" +#include "al.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#ifndef AL_LOKI_IMA_ADPCM_format +#define AL_LOKI_IMA_ADPCM_format 1 +#define AL_FORMAT_IMA_ADPCM_MONO16_EXT 0x10000 +#define AL_FORMAT_IMA_ADPCM_STEREO16_EXT 0x10001 +#endif + +#ifndef AL_LOKI_WAVE_format +#define AL_LOKI_WAVE_format 1 +#define AL_FORMAT_WAVE_EXT 0x10002 +#endif + +#ifndef AL_EXT_vorbis +#define AL_EXT_vorbis 1 +#define AL_FORMAT_VORBIS_EXT 0x10003 +#endif + +#ifndef AL_LOKI_quadriphonic +#define AL_LOKI_quadriphonic 1 +#define AL_FORMAT_QUAD8_LOKI 0x10004 +#define AL_FORMAT_QUAD16_LOKI 0x10005 +#endif + +#ifndef AL_EXT_float32 +#define AL_EXT_float32 1 +#define AL_FORMAT_MONO_FLOAT32 0x10010 +#define AL_FORMAT_STEREO_FLOAT32 0x10011 +#endif + +#ifndef AL_EXT_double +#define AL_EXT_double 1 +#define AL_FORMAT_MONO_DOUBLE_EXT 0x10012 +#define AL_FORMAT_STEREO_DOUBLE_EXT 0x10013 +#endif + +#ifndef AL_EXT_MULAW +#define AL_EXT_MULAW 1 +#define AL_FORMAT_MONO_MULAW_EXT 0x10014 +#define AL_FORMAT_STEREO_MULAW_EXT 0x10015 +#endif + +#ifndef AL_EXT_ALAW +#define AL_EXT_ALAW 1 +#define AL_FORMAT_MONO_ALAW_EXT 0x10016 +#define AL_FORMAT_STEREO_ALAW_EXT 0x10017 +#endif + +#ifndef ALC_LOKI_audio_channel +#define ALC_LOKI_audio_channel 1 +#define ALC_CHAN_MAIN_LOKI 0x500001 +#define ALC_CHAN_PCM_LOKI 0x500002 +#define ALC_CHAN_CD_LOKI 0x500003 +#endif + +#ifndef AL_EXT_MCFORMATS +#define AL_EXT_MCFORMATS 1 +#define AL_FORMAT_QUAD8 0x1204 +#define AL_FORMAT_QUAD16 0x1205 +#define AL_FORMAT_QUAD32 0x1206 +#define AL_FORMAT_REAR8 0x1207 +#define AL_FORMAT_REAR16 0x1208 +#define AL_FORMAT_REAR32 0x1209 +#define AL_FORMAT_51CHN8 0x120A +#define AL_FORMAT_51CHN16 0x120B +#define AL_FORMAT_51CHN32 0x120C +#define AL_FORMAT_61CHN8 0x120D +#define AL_FORMAT_61CHN16 0x120E +#define AL_FORMAT_61CHN32 0x120F +#define AL_FORMAT_71CHN8 0x1210 +#define AL_FORMAT_71CHN16 0x1211 +#define AL_FORMAT_71CHN32 0x1212 +#endif + +#ifndef AL_EXT_MULAW_MCFORMATS +#define AL_EXT_MULAW_MCFORMATS 1 +#define AL_FORMAT_MONO_MULAW 0x10014 +#define AL_FORMAT_STEREO_MULAW 0x10015 +#define AL_FORMAT_QUAD_MULAW 0x10021 +#define AL_FORMAT_REAR_MULAW 0x10022 +#define AL_FORMAT_51CHN_MULAW 0x10023 +#define AL_FORMAT_61CHN_MULAW 0x10024 +#define AL_FORMAT_71CHN_MULAW 0x10025 +#endif + +#ifndef AL_EXT_IMA4 +#define AL_EXT_IMA4 1 +#define AL_FORMAT_MONO_IMA4 0x1300 +#define AL_FORMAT_STEREO_IMA4 0x1301 +#endif + +#ifndef AL_EXT_STATIC_BUFFER +#define AL_EXT_STATIC_BUFFER 1 +typedef ALvoid (AL_APIENTRY*PFNALBUFFERDATASTATICPROC)(const ALint,ALenum,ALvoid*,ALsizei,ALsizei); +#ifdef AL_ALEXT_PROTOTYPES +AL_API ALvoid AL_APIENTRY alBufferDataStatic(const ALint buffer, ALenum format, ALvoid *data, ALsizei len, ALsizei freq); +#endif +#endif + +#ifndef ALC_EXT_EFX +#define ALC_EXT_EFX 1 +#include "efx.h" +#endif + +#ifndef ALC_EXT_disconnect +#define ALC_EXT_disconnect 1 +#define ALC_CONNECTED 0x313 +#endif + +#ifndef ALC_EXT_thread_local_context +#define ALC_EXT_thread_local_context 1 +typedef ALCboolean (ALC_APIENTRY*PFNALCSETTHREADCONTEXTPROC)(ALCcontext *context); +typedef ALCcontext* (ALC_APIENTRY*PFNALCGETTHREADCONTEXTPROC)(void); +#ifdef AL_ALEXT_PROTOTYPES +ALC_API ALCboolean ALC_APIENTRY alcSetThreadContext(ALCcontext *context); +ALC_API ALCcontext* ALC_APIENTRY alcGetThreadContext(void); +#endif +#endif + +#ifndef AL_EXT_source_distance_model +#define AL_EXT_source_distance_model 1 +#define AL_SOURCE_DISTANCE_MODEL 0x200 +#endif + +#ifndef AL_SOFT_buffer_sub_data +#define AL_SOFT_buffer_sub_data 1 +#define AL_BYTE_RW_OFFSETS_SOFT 0x1031 +#define AL_SAMPLE_RW_OFFSETS_SOFT 0x1032 +typedef ALvoid (AL_APIENTRY*PFNALBUFFERSUBDATASOFTPROC)(ALuint,ALenum,const ALvoid*,ALsizei,ALsizei); +#ifdef AL_ALEXT_PROTOTYPES +AL_API ALvoid AL_APIENTRY alBufferSubDataSOFT(ALuint buffer,ALenum format,const ALvoid *data,ALsizei offset,ALsizei length); +#endif +#endif + +#ifndef AL_SOFT_loop_points +#define AL_SOFT_loop_points 1 +#define AL_LOOP_POINTS_SOFT 0x2015 +#endif + +#ifndef AL_EXT_FOLDBACK +#define AL_EXT_FOLDBACK 1 +#define AL_EXT_FOLDBACK_NAME "AL_EXT_FOLDBACK" +#define AL_FOLDBACK_EVENT_BLOCK 0x4112 +#define AL_FOLDBACK_EVENT_START 0x4111 +#define AL_FOLDBACK_EVENT_STOP 0x4113 +#define AL_FOLDBACK_MODE_MONO 0x4101 +#define AL_FOLDBACK_MODE_STEREO 0x4102 +typedef void (AL_APIENTRY*LPALFOLDBACKCALLBACK)(ALenum,ALsizei); +typedef void (AL_APIENTRY*LPALREQUESTFOLDBACKSTART)(ALenum,ALsizei,ALsizei,ALfloat*,LPALFOLDBACKCALLBACK); +typedef void (AL_APIENTRY*LPALREQUESTFOLDBACKSTOP)(void); +#ifdef AL_ALEXT_PROTOTYPES +AL_API void AL_APIENTRY alRequestFoldbackStart(ALenum mode,ALsizei count,ALsizei length,ALfloat *mem,LPALFOLDBACKCALLBACK callback); +AL_API void AL_APIENTRY alRequestFoldbackStop(void); +#endif +#endif + +#ifndef ALC_EXT_DEDICATED +#define ALC_EXT_DEDICATED 1 +#define AL_DEDICATED_GAIN 0x0001 +#define AL_EFFECT_DEDICATED_DIALOGUE 0x9001 +#define AL_EFFECT_DEDICATED_LOW_FREQUENCY_EFFECT 0x9000 +#endif + +#ifndef AL_SOFT_buffer_samples +#define AL_SOFT_buffer_samples 1 +/* Channel configurations */ +#define AL_MONO_SOFT 0x1500 +#define AL_STEREO_SOFT 0x1501 +#define AL_REAR_SOFT 0x1502 +#define AL_QUAD_SOFT 0x1503 +#define AL_5POINT1_SOFT 0x1504 +#define AL_6POINT1_SOFT 0x1505 +#define AL_7POINT1_SOFT 0x1506 + +/* Sample types */ +#define AL_BYTE_SOFT 0x1400 +#define AL_UNSIGNED_BYTE_SOFT 0x1401 +#define AL_SHORT_SOFT 0x1402 +#define AL_UNSIGNED_SHORT_SOFT 0x1403 +#define AL_INT_SOFT 0x1404 +#define AL_UNSIGNED_INT_SOFT 0x1405 +#define AL_FLOAT_SOFT 0x1406 +#define AL_DOUBLE_SOFT 0x1407 +#define AL_BYTE3_SOFT 0x1408 +#define AL_UNSIGNED_BYTE3_SOFT 0x1409 + +/* Storage formats */ +#define AL_MONO8_SOFT 0x1100 +#define AL_MONO16_SOFT 0x1101 +#define AL_MONO32F_SOFT 0x10010 +#define AL_STEREO8_SOFT 0x1102 +#define AL_STEREO16_SOFT 0x1103 +#define AL_STEREO32F_SOFT 0x10011 +#define AL_QUAD8_SOFT 0x1204 +#define AL_QUAD16_SOFT 0x1205 +#define AL_QUAD32F_SOFT 0x1206 +#define AL_REAR8_SOFT 0x1207 +#define AL_REAR16_SOFT 0x1208 +#define AL_REAR32F_SOFT 0x1209 +#define AL_5POINT1_8_SOFT 0x120A +#define AL_5POINT1_16_SOFT 0x120B +#define AL_5POINT1_32F_SOFT 0x120C +#define AL_6POINT1_8_SOFT 0x120D +#define AL_6POINT1_16_SOFT 0x120E +#define AL_6POINT1_32F_SOFT 0x120F +#define AL_7POINT1_8_SOFT 0x1210 +#define AL_7POINT1_16_SOFT 0x1211 +#define AL_7POINT1_32F_SOFT 0x1212 + +/* Buffer attributes */ +#define AL_INTERNAL_FORMAT_SOFT 0x2008 +#define AL_BYTE_LENGTH_SOFT 0x2009 +#define AL_SAMPLE_LENGTH_SOFT 0x200A +#define AL_SEC_LENGTH_SOFT 0x200B + +typedef void (AL_APIENTRY*LPALBUFFERSAMPLESSOFT)(ALuint,ALuint,ALenum,ALsizei,ALenum,ALenum,const ALvoid*); +typedef void (AL_APIENTRY*LPALBUFFERSUBSAMPLESSOFT)(ALuint,ALsizei,ALsizei,ALenum,ALenum,const ALvoid*); +typedef void (AL_APIENTRY*LPALGETBUFFERSAMPLESSOFT)(ALuint,ALsizei,ALsizei,ALenum,ALenum,ALvoid*); +typedef ALboolean (AL_APIENTRY*LPALISBUFFERFORMATSUPPORTEDSOFT)(ALenum); +#ifdef AL_ALEXT_PROTOTYPES +AL_API void AL_APIENTRY alBufferSamplesSOFT(ALuint buffer, ALuint samplerate, ALenum internalformat, ALsizei samples, ALenum channels, ALenum type, const ALvoid *data); +AL_API void AL_APIENTRY alBufferSubSamplesSOFT(ALuint buffer, ALsizei offset, ALsizei samples, ALenum channels, ALenum type, const ALvoid *data); +AL_API void AL_APIENTRY alGetBufferSamplesSOFT(ALuint buffer, ALsizei offset, ALsizei samples, ALenum channels, ALenum type, ALvoid *data); +AL_API ALboolean AL_APIENTRY alIsBufferFormatSupportedSOFT(ALenum format); +#endif +#endif + +#ifndef AL_SOFT_direct_channels +#define AL_SOFT_direct_channels 1 +#define AL_DIRECT_CHANNELS_SOFT 0x1033 +#endif + +#ifndef ALC_SOFT_loopback +#define ALC_SOFT_loopback 1 +#define ALC_FORMAT_CHANNELS_SOFT 0x1990 +#define ALC_FORMAT_TYPE_SOFT 0x1991 + +/* Sample types */ +#define ALC_BYTE_SOFT 0x1400 +#define ALC_UNSIGNED_BYTE_SOFT 0x1401 +#define ALC_SHORT_SOFT 0x1402 +#define ALC_UNSIGNED_SHORT_SOFT 0x1403 +#define ALC_INT_SOFT 0x1404 +#define ALC_UNSIGNED_INT_SOFT 0x1405 +#define ALC_FLOAT_SOFT 0x1406 + +/* Channel configurations */ +#define ALC_MONO_SOFT 0x1500 +#define ALC_STEREO_SOFT 0x1501 +#define ALC_QUAD_SOFT 0x1503 +#define ALC_5POINT1_SOFT 0x1504 +#define ALC_6POINT1_SOFT 0x1505 +#define ALC_7POINT1_SOFT 0x1506 + +typedef ALCdevice* (ALC_APIENTRY*LPALCLOOPBACKOPENDEVICESOFT)(const ALCchar*); +typedef ALCboolean (ALC_APIENTRY*LPALCISRENDERFORMATSUPPORTEDSOFT)(ALCdevice*,ALCsizei,ALCenum,ALCenum); +typedef void (ALC_APIENTRY*LPALCRENDERSAMPLESSOFT)(ALCdevice*,ALCvoid*,ALCsizei); +#ifdef AL_ALEXT_PROTOTYPES +ALC_API ALCdevice* ALC_APIENTRY alcLoopbackOpenDeviceSOFT(const ALCchar *deviceName); +ALC_API ALCboolean ALC_APIENTRY alcIsRenderFormatSupportedSOFT(ALCdevice *device, ALCsizei freq, ALCenum channels, ALCenum type); +ALC_API void ALC_APIENTRY alcRenderSamplesSOFT(ALCdevice *device, ALCvoid *buffer, ALCsizei samples); +#endif +#endif + +#ifndef AL_EXT_STEREO_ANGLES +#define AL_EXT_STEREO_ANGLES 1 +#define AL_STEREO_ANGLES 0x1030 +#endif + +#ifndef AL_EXT_SOURCE_RADIUS +#define AL_EXT_SOURCE_RADIUS 1 +#define AL_SOURCE_RADIUS 0x1031 +#endif + +#ifndef AL_SOFT_source_latency +#define AL_SOFT_source_latency 1 +#define AL_SAMPLE_OFFSET_LATENCY_SOFT 0x1200 +#define AL_SEC_OFFSET_LATENCY_SOFT 0x1201 +typedef int64_t ALint64SOFT; +typedef uint64_t ALuint64SOFT; +typedef void (AL_APIENTRY*LPALSOURCEDSOFT)(ALuint,ALenum,ALdouble); +typedef void (AL_APIENTRY*LPALSOURCE3DSOFT)(ALuint,ALenum,ALdouble,ALdouble,ALdouble); +typedef void (AL_APIENTRY*LPALSOURCEDVSOFT)(ALuint,ALenum,const ALdouble*); +typedef void (AL_APIENTRY*LPALGETSOURCEDSOFT)(ALuint,ALenum,ALdouble*); +typedef void (AL_APIENTRY*LPALGETSOURCE3DSOFT)(ALuint,ALenum,ALdouble*,ALdouble*,ALdouble*); +typedef void (AL_APIENTRY*LPALGETSOURCEDVSOFT)(ALuint,ALenum,ALdouble*); +typedef void (AL_APIENTRY*LPALSOURCEI64SOFT)(ALuint,ALenum,ALint64SOFT); +typedef void (AL_APIENTRY*LPALSOURCE3I64SOFT)(ALuint,ALenum,ALint64SOFT,ALint64SOFT,ALint64SOFT); +typedef void (AL_APIENTRY*LPALSOURCEI64VSOFT)(ALuint,ALenum,const ALint64SOFT*); +typedef void (AL_APIENTRY*LPALGETSOURCEI64SOFT)(ALuint,ALenum,ALint64SOFT*); +typedef void (AL_APIENTRY*LPALGETSOURCE3I64SOFT)(ALuint,ALenum,ALint64SOFT*,ALint64SOFT*,ALint64SOFT*); +typedef void (AL_APIENTRY*LPALGETSOURCEI64VSOFT)(ALuint,ALenum,ALint64SOFT*); +#ifdef AL_ALEXT_PROTOTYPES +AL_API void AL_APIENTRY alSourcedSOFT(ALuint source, ALenum param, ALdouble value); +AL_API void AL_APIENTRY alSource3dSOFT(ALuint source, ALenum param, ALdouble value1, ALdouble value2, ALdouble value3); +AL_API void AL_APIENTRY alSourcedvSOFT(ALuint source, ALenum param, const ALdouble *values); +AL_API void AL_APIENTRY alGetSourcedSOFT(ALuint source, ALenum param, ALdouble *value); +AL_API void AL_APIENTRY alGetSource3dSOFT(ALuint source, ALenum param, ALdouble *value1, ALdouble *value2, ALdouble *value3); +AL_API void AL_APIENTRY alGetSourcedvSOFT(ALuint source, ALenum param, ALdouble *values); +AL_API void AL_APIENTRY alSourcei64SOFT(ALuint source, ALenum param, ALint64SOFT value); +AL_API void AL_APIENTRY alSource3i64SOFT(ALuint source, ALenum param, ALint64SOFT value1, ALint64SOFT value2, ALint64SOFT value3); +AL_API void AL_APIENTRY alSourcei64vSOFT(ALuint source, ALenum param, const ALint64SOFT *values); +AL_API void AL_APIENTRY alGetSourcei64SOFT(ALuint source, ALenum param, ALint64SOFT *value); +AL_API void AL_APIENTRY alGetSource3i64SOFT(ALuint source, ALenum param, ALint64SOFT *value1, ALint64SOFT *value2, ALint64SOFT *value3); +AL_API void AL_APIENTRY alGetSourcei64vSOFT(ALuint source, ALenum param, ALint64SOFT *values); +#endif +#endif + +#ifndef ALC_EXT_DEFAULT_FILTER_ORDER +#define ALC_EXT_DEFAULT_FILTER_ORDER 1 +#define ALC_DEFAULT_FILTER_ORDER 0x1100 +#endif + +#ifndef AL_SOFT_deferred_updates +#define AL_SOFT_deferred_updates 1 +#define AL_DEFERRED_UPDATES_SOFT 0xC002 +typedef ALvoid (AL_APIENTRY*LPALDEFERUPDATESSOFT)(void); +typedef ALvoid (AL_APIENTRY*LPALPROCESSUPDATESSOFT)(void); +#ifdef AL_ALEXT_PROTOTYPES +AL_API ALvoid AL_APIENTRY alDeferUpdatesSOFT(void); +AL_API ALvoid AL_APIENTRY alProcessUpdatesSOFT(void); +#endif +#endif + +#ifndef AL_SOFT_block_alignment +#define AL_SOFT_block_alignment 1 +#define AL_UNPACK_BLOCK_ALIGNMENT_SOFT 0x200C +#define AL_PACK_BLOCK_ALIGNMENT_SOFT 0x200D +#endif + +#ifndef AL_SOFT_MSADPCM +#define AL_SOFT_MSADPCM 1 +#define AL_FORMAT_MONO_MSADPCM_SOFT 0x1302 +#define AL_FORMAT_STEREO_MSADPCM_SOFT 0x1303 +#endif + +#ifndef AL_SOFT_source_length +#define AL_SOFT_source_length 1 +/*#define AL_BYTE_LENGTH_SOFT 0x2009*/ +/*#define AL_SAMPLE_LENGTH_SOFT 0x200A*/ +/*#define AL_SEC_LENGTH_SOFT 0x200B*/ +#endif + +#ifndef ALC_SOFT_pause_device +#define ALC_SOFT_pause_device 1 +typedef void (ALC_APIENTRY*LPALCDEVICEPAUSESOFT)(ALCdevice *device); +typedef void (ALC_APIENTRY*LPALCDEVICERESUMESOFT)(ALCdevice *device); +#ifdef AL_ALEXT_PROTOTYPES +ALC_API void ALC_APIENTRY alcDevicePauseSOFT(ALCdevice *device); +ALC_API void ALC_APIENTRY alcDeviceResumeSOFT(ALCdevice *device); +#endif +#endif + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/AL/efx-creative.h b/3rdparty/iaxclient-2/lib/AL/efx-creative.h new file mode 100644 index 0000000..0a04c98 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/efx-creative.h @@ -0,0 +1,3 @@ +/* The tokens that would be defined here are already defined in efx.h. This + * empty file is here to provide compatibility with Windows-based projects + * that would include it. */ diff --git a/3rdparty/iaxclient-2/lib/AL/efx-presets.h b/3rdparty/iaxclient-2/lib/AL/efx-presets.h new file mode 100644 index 0000000..86dcbda --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/efx-presets.h @@ -0,0 +1,402 @@ +/* Reverb presets for EFX */ + +#ifndef EFX_PRESETS_H +#define EFX_PRESETS_H + +#ifndef EFXEAXREVERBPROPERTIES_DEFINED +#define EFXEAXREVERBPROPERTIES_DEFINED +typedef struct { + float flDensity; + float flDiffusion; + float flGain; + float flGainHF; + float flGainLF; + float flDecayTime; + float flDecayHFRatio; + float flDecayLFRatio; + float flReflectionsGain; + float flReflectionsDelay; + float flReflectionsPan[3]; + float flLateReverbGain; + float flLateReverbDelay; + float flLateReverbPan[3]; + float flEchoTime; + float flEchoDepth; + float flModulationTime; + float flModulationDepth; + float flAirAbsorptionGainHF; + float flHFReference; + float flLFReference; + float flRoomRolloffFactor; + int iDecayHFLimit; +} EFXEAXREVERBPROPERTIES, *LPEFXEAXREVERBPROPERTIES; +#endif + +/* Default Presets */ + +#define EFX_REVERB_PRESET_GENERIC \ + { 1.0000f, 1.0000f, 0.3162f, 0.8913f, 1.0000f, 1.4900f, 0.8300f, 1.0000f, 0.0500f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PADDEDCELL \ + { 0.1715f, 1.0000f, 0.3162f, 0.0010f, 1.0000f, 0.1700f, 0.1000f, 1.0000f, 0.2500f, 0.0010f, { 0.0000f, 0.0000f, 0.0000f }, 1.2691f, 0.0020f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ROOM \ + { 0.4287f, 1.0000f, 0.3162f, 0.5929f, 1.0000f, 0.4000f, 0.8300f, 1.0000f, 0.1503f, 0.0020f, { 0.0000f, 0.0000f, 0.0000f }, 1.0629f, 0.0030f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_BATHROOM \ + { 0.1715f, 1.0000f, 0.3162f, 0.2512f, 1.0000f, 1.4900f, 0.5400f, 1.0000f, 0.6531f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 3.2734f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_LIVINGROOM \ + { 0.9766f, 1.0000f, 0.3162f, 0.0010f, 1.0000f, 0.5000f, 0.1000f, 1.0000f, 0.2051f, 0.0030f, { 0.0000f, 0.0000f, 0.0000f }, 0.2805f, 0.0040f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_STONEROOM \ + { 1.0000f, 1.0000f, 0.3162f, 0.7079f, 1.0000f, 2.3100f, 0.6400f, 1.0000f, 0.4411f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.1003f, 0.0170f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_AUDITORIUM \ + { 1.0000f, 1.0000f, 0.3162f, 0.5781f, 1.0000f, 4.3200f, 0.5900f, 1.0000f, 0.4032f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.7170f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CONCERTHALL \ + { 1.0000f, 1.0000f, 0.3162f, 0.5623f, 1.0000f, 3.9200f, 0.7000f, 1.0000f, 0.2427f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.9977f, 0.0290f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CAVE \ + { 1.0000f, 1.0000f, 0.3162f, 1.0000f, 1.0000f, 2.9100f, 1.3000f, 1.0000f, 0.5000f, 0.0150f, { 0.0000f, 0.0000f, 0.0000f }, 0.7063f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_ARENA \ + { 1.0000f, 1.0000f, 0.3162f, 0.4477f, 1.0000f, 7.2400f, 0.3300f, 1.0000f, 0.2612f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.0186f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_HANGAR \ + { 1.0000f, 1.0000f, 0.3162f, 0.3162f, 1.0000f, 10.0500f, 0.2300f, 1.0000f, 0.5000f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.2560f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CARPETEDHALLWAY \ + { 0.4287f, 1.0000f, 0.3162f, 0.0100f, 1.0000f, 0.3000f, 0.1000f, 1.0000f, 0.1215f, 0.0020f, { 0.0000f, 0.0000f, 0.0000f }, 0.1531f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_HALLWAY \ + { 0.3645f, 1.0000f, 0.3162f, 0.7079f, 1.0000f, 1.4900f, 0.5900f, 1.0000f, 0.2458f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.6615f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_STONECORRIDOR \ + { 1.0000f, 1.0000f, 0.3162f, 0.7612f, 1.0000f, 2.7000f, 0.7900f, 1.0000f, 0.2472f, 0.0130f, { 0.0000f, 0.0000f, 0.0000f }, 1.5758f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ALLEY \ + { 1.0000f, 0.3000f, 0.3162f, 0.7328f, 1.0000f, 1.4900f, 0.8600f, 1.0000f, 0.2500f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 0.9954f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.1250f, 0.9500f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FOREST \ + { 1.0000f, 0.3000f, 0.3162f, 0.0224f, 1.0000f, 1.4900f, 0.5400f, 1.0000f, 0.0525f, 0.1620f, { 0.0000f, 0.0000f, 0.0000f }, 0.7682f, 0.0880f, { 0.0000f, 0.0000f, 0.0000f }, 0.1250f, 1.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CITY \ + { 1.0000f, 0.5000f, 0.3162f, 0.3981f, 1.0000f, 1.4900f, 0.6700f, 1.0000f, 0.0730f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 0.1427f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_MOUNTAINS \ + { 1.0000f, 0.2700f, 0.3162f, 0.0562f, 1.0000f, 1.4900f, 0.2100f, 1.0000f, 0.0407f, 0.3000f, { 0.0000f, 0.0000f, 0.0000f }, 0.1919f, 0.1000f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_QUARRY \ + { 1.0000f, 1.0000f, 0.3162f, 0.3162f, 1.0000f, 1.4900f, 0.8300f, 1.0000f, 0.0000f, 0.0610f, { 0.0000f, 0.0000f, 0.0000f }, 1.7783f, 0.0250f, { 0.0000f, 0.0000f, 0.0000f }, 0.1250f, 0.7000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PLAIN \ + { 1.0000f, 0.2100f, 0.3162f, 0.1000f, 1.0000f, 1.4900f, 0.5000f, 1.0000f, 0.0585f, 0.1790f, { 0.0000f, 0.0000f, 0.0000f }, 0.1089f, 0.1000f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PARKINGLOT \ + { 1.0000f, 1.0000f, 0.3162f, 1.0000f, 1.0000f, 1.6500f, 1.5000f, 1.0000f, 0.2082f, 0.0080f, { 0.0000f, 0.0000f, 0.0000f }, 0.2652f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_SEWERPIPE \ + { 0.3071f, 0.8000f, 0.3162f, 0.3162f, 1.0000f, 2.8100f, 0.1400f, 1.0000f, 1.6387f, 0.0140f, { 0.0000f, 0.0000f, 0.0000f }, 3.2471f, 0.0210f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_UNDERWATER \ + { 0.3645f, 1.0000f, 0.3162f, 0.0100f, 1.0000f, 1.4900f, 0.1000f, 1.0000f, 0.5963f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 7.0795f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 1.1800f, 0.3480f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DRUGGED \ + { 0.4287f, 0.5000f, 0.3162f, 1.0000f, 1.0000f, 8.3900f, 1.3900f, 1.0000f, 0.8760f, 0.0020f, { 0.0000f, 0.0000f, 0.0000f }, 3.1081f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 1.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_DIZZY \ + { 0.3645f, 0.6000f, 0.3162f, 0.6310f, 1.0000f, 17.2300f, 0.5600f, 1.0000f, 0.1392f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.4937f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.8100f, 0.3100f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_PSYCHOTIC \ + { 0.0625f, 0.5000f, 0.3162f, 0.8404f, 1.0000f, 7.5600f, 0.9100f, 1.0000f, 0.4864f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 2.4378f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 4.0000f, 1.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +/* Castle Presets */ + +#define EFX_REVERB_PRESET_CASTLE_SMALLROOM \ + { 1.0000f, 0.8900f, 0.3162f, 0.3981f, 0.1000f, 1.2200f, 0.8300f, 0.3100f, 0.8913f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 1.9953f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.1380f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_SHORTPASSAGE \ + { 1.0000f, 0.8900f, 0.3162f, 0.3162f, 0.1000f, 2.3200f, 0.8300f, 0.3100f, 0.8913f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0230f, { 0.0000f, 0.0000f, 0.0000f }, 0.1380f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_MEDIUMROOM \ + { 1.0000f, 0.9300f, 0.3162f, 0.2818f, 0.1000f, 2.0400f, 0.8300f, 0.4600f, 0.6310f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 1.5849f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.1550f, 0.0300f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_LARGEROOM \ + { 1.0000f, 0.8200f, 0.3162f, 0.2818f, 0.1259f, 2.5300f, 0.8300f, 0.5000f, 0.4467f, 0.0340f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0160f, { 0.0000f, 0.0000f, 0.0000f }, 0.1850f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_LONGPASSAGE \ + { 1.0000f, 0.8900f, 0.3162f, 0.3981f, 0.1000f, 3.4200f, 0.8300f, 0.3100f, 0.8913f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0230f, { 0.0000f, 0.0000f, 0.0000f }, 0.1380f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_HALL \ + { 1.0000f, 0.8100f, 0.3162f, 0.2818f, 0.1778f, 3.1400f, 0.7900f, 0.6200f, 0.1778f, 0.0560f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0240f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_CUPBOARD \ + { 1.0000f, 0.8900f, 0.3162f, 0.2818f, 0.1000f, 0.6700f, 0.8700f, 0.3100f, 1.4125f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 3.5481f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 0.1380f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CASTLE_COURTYARD \ + { 1.0000f, 0.4200f, 0.3162f, 0.4467f, 0.1995f, 2.1300f, 0.6100f, 0.2300f, 0.2239f, 0.1600f, { 0.0000f, 0.0000f, 0.0000f }, 0.7079f, 0.0360f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.3700f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_CASTLE_ALCOVE \ + { 1.0000f, 0.8900f, 0.3162f, 0.5012f, 0.1000f, 1.6400f, 0.8700f, 0.3100f, 1.0000f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0340f, { 0.0000f, 0.0000f, 0.0000f }, 0.1380f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 5168.6001f, 139.5000f, 0.0000f, 0x1 } + +/* Factory Presets */ + +#define EFX_REVERB_PRESET_FACTORY_SMALLROOM \ + { 0.3645f, 0.8200f, 0.3162f, 0.7943f, 0.5012f, 1.7200f, 0.6500f, 1.3100f, 0.7079f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.7783f, 0.0240f, { 0.0000f, 0.0000f, 0.0000f }, 0.1190f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_SHORTPASSAGE \ + { 0.3645f, 0.6400f, 0.2512f, 0.7943f, 0.5012f, 2.5300f, 0.6500f, 1.3100f, 1.0000f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0380f, { 0.0000f, 0.0000f, 0.0000f }, 0.1350f, 0.2300f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_MEDIUMROOM \ + { 0.4287f, 0.8200f, 0.2512f, 0.7943f, 0.5012f, 2.7600f, 0.6500f, 1.3100f, 0.2818f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0230f, { 0.0000f, 0.0000f, 0.0000f }, 0.1740f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_LARGEROOM \ + { 0.4287f, 0.7500f, 0.2512f, 0.7079f, 0.6310f, 4.2400f, 0.5100f, 1.3100f, 0.1778f, 0.0390f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0230f, { 0.0000f, 0.0000f, 0.0000f }, 0.2310f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_LONGPASSAGE \ + { 0.3645f, 0.6400f, 0.2512f, 0.7943f, 0.5012f, 4.0600f, 0.6500f, 1.3100f, 1.0000f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0370f, { 0.0000f, 0.0000f, 0.0000f }, 0.1350f, 0.2300f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_HALL \ + { 0.4287f, 0.7500f, 0.3162f, 0.7079f, 0.6310f, 7.4300f, 0.5100f, 1.3100f, 0.0631f, 0.0730f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0270f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_CUPBOARD \ + { 0.3071f, 0.6300f, 0.2512f, 0.7943f, 0.5012f, 0.4900f, 0.6500f, 1.3100f, 1.2589f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.9953f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 0.1070f, 0.0700f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_COURTYARD \ + { 0.3071f, 0.5700f, 0.3162f, 0.3162f, 0.6310f, 2.3200f, 0.2900f, 0.5600f, 0.2239f, 0.1400f, { 0.0000f, 0.0000f, 0.0000f }, 0.3981f, 0.0390f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2900f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_FACTORY_ALCOVE \ + { 0.3645f, 0.5900f, 0.2512f, 0.7943f, 0.5012f, 3.1400f, 0.6500f, 1.3100f, 1.4125f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.0000f, 0.0380f, { 0.0000f, 0.0000f, 0.0000f }, 0.1140f, 0.1000f, 0.2500f, 0.0000f, 0.9943f, 3762.6001f, 362.5000f, 0.0000f, 0x1 } + +/* Ice Palace Presets */ + +#define EFX_REVERB_PRESET_ICEPALACE_SMALLROOM \ + { 1.0000f, 0.8400f, 0.3162f, 0.5623f, 0.2818f, 1.5100f, 1.5300f, 0.2700f, 0.8913f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.1640f, 0.1400f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_SHORTPASSAGE \ + { 1.0000f, 0.7500f, 0.3162f, 0.5623f, 0.2818f, 1.7900f, 1.4600f, 0.2800f, 0.5012f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0190f, { 0.0000f, 0.0000f, 0.0000f }, 0.1770f, 0.0900f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_MEDIUMROOM \ + { 1.0000f, 0.8700f, 0.3162f, 0.5623f, 0.4467f, 2.2200f, 1.5300f, 0.3200f, 0.3981f, 0.0390f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0270f, { 0.0000f, 0.0000f, 0.0000f }, 0.1860f, 0.1200f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_LARGEROOM \ + { 1.0000f, 0.8100f, 0.3162f, 0.5623f, 0.4467f, 3.1400f, 1.5300f, 0.3200f, 0.2512f, 0.0390f, { 0.0000f, 0.0000f, 0.0000f }, 1.0000f, 0.0270f, { 0.0000f, 0.0000f, 0.0000f }, 0.2140f, 0.1100f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_LONGPASSAGE \ + { 1.0000f, 0.7700f, 0.3162f, 0.5623f, 0.3981f, 3.0100f, 1.4600f, 0.2800f, 0.7943f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0250f, { 0.0000f, 0.0000f, 0.0000f }, 0.1860f, 0.0400f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_HALL \ + { 1.0000f, 0.7600f, 0.3162f, 0.4467f, 0.5623f, 5.4900f, 1.5300f, 0.3800f, 0.1122f, 0.0540f, { 0.0000f, 0.0000f, 0.0000f }, 0.6310f, 0.0520f, { 0.0000f, 0.0000f, 0.0000f }, 0.2260f, 0.1100f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_CUPBOARD \ + { 1.0000f, 0.8300f, 0.3162f, 0.5012f, 0.2239f, 0.7600f, 1.5300f, 0.2600f, 1.1220f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.9953f, 0.0160f, { 0.0000f, 0.0000f, 0.0000f }, 0.1430f, 0.0800f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_COURTYARD \ + { 1.0000f, 0.5900f, 0.3162f, 0.2818f, 0.3162f, 2.0400f, 1.2000f, 0.3800f, 0.3162f, 0.1730f, { 0.0000f, 0.0000f, 0.0000f }, 0.3162f, 0.0430f, { 0.0000f, 0.0000f, 0.0000f }, 0.2350f, 0.4800f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_ICEPALACE_ALCOVE \ + { 1.0000f, 0.8400f, 0.3162f, 0.5623f, 0.2818f, 2.7600f, 1.4600f, 0.2800f, 1.1220f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.1610f, 0.0900f, 0.2500f, 0.0000f, 0.9943f, 12428.5000f, 99.6000f, 0.0000f, 0x1 } + +/* Space Station Presets */ + +#define EFX_REVERB_PRESET_SPACESTATION_SMALLROOM \ + { 0.2109f, 0.7000f, 0.3162f, 0.7079f, 0.8913f, 1.7200f, 0.8200f, 0.5500f, 0.7943f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0130f, { 0.0000f, 0.0000f, 0.0000f }, 0.1880f, 0.2600f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_SHORTPASSAGE \ + { 0.2109f, 0.8700f, 0.3162f, 0.6310f, 0.8913f, 3.5700f, 0.5000f, 0.5500f, 1.0000f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0160f, { 0.0000f, 0.0000f, 0.0000f }, 0.1720f, 0.2000f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_MEDIUMROOM \ + { 0.2109f, 0.7500f, 0.3162f, 0.6310f, 0.8913f, 3.0100f, 0.5000f, 0.5500f, 0.3981f, 0.0340f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0350f, { 0.0000f, 0.0000f, 0.0000f }, 0.2090f, 0.3100f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_LARGEROOM \ + { 0.3645f, 0.8100f, 0.3162f, 0.6310f, 0.8913f, 3.8900f, 0.3800f, 0.6100f, 0.3162f, 0.0560f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0350f, { 0.0000f, 0.0000f, 0.0000f }, 0.2330f, 0.2800f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_LONGPASSAGE \ + { 0.4287f, 0.8200f, 0.3162f, 0.6310f, 0.8913f, 4.6200f, 0.6200f, 0.5500f, 1.0000f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0310f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2300f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_HALL \ + { 0.4287f, 0.8700f, 0.3162f, 0.6310f, 0.8913f, 7.1100f, 0.3800f, 0.6100f, 0.1778f, 0.1000f, { 0.0000f, 0.0000f, 0.0000f }, 0.6310f, 0.0470f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2500f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_CUPBOARD \ + { 0.1715f, 0.5600f, 0.3162f, 0.7079f, 0.8913f, 0.7900f, 0.8100f, 0.5500f, 1.4125f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.7783f, 0.0180f, { 0.0000f, 0.0000f, 0.0000f }, 0.1810f, 0.3100f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPACESTATION_ALCOVE \ + { 0.2109f, 0.7800f, 0.3162f, 0.7079f, 0.8913f, 1.1600f, 0.8100f, 0.5500f, 1.4125f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 1.0000f, 0.0180f, { 0.0000f, 0.0000f, 0.0000f }, 0.1920f, 0.2100f, 0.2500f, 0.0000f, 0.9943f, 3316.1001f, 458.2000f, 0.0000f, 0x1 } + +/* Wooden Galleon Presets */ + +#define EFX_REVERB_PRESET_WOODEN_SMALLROOM \ + { 1.0000f, 1.0000f, 0.3162f, 0.1122f, 0.3162f, 0.7900f, 0.3200f, 0.8700f, 1.0000f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0290f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_SHORTPASSAGE \ + { 1.0000f, 1.0000f, 0.3162f, 0.1259f, 0.3162f, 1.7500f, 0.5000f, 0.8700f, 0.8913f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 0.6310f, 0.0240f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_MEDIUMROOM \ + { 1.0000f, 1.0000f, 0.3162f, 0.1000f, 0.2818f, 1.4700f, 0.4200f, 0.8200f, 0.8913f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0290f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_LARGEROOM \ + { 1.0000f, 1.0000f, 0.3162f, 0.0891f, 0.2818f, 2.6500f, 0.3300f, 0.8200f, 0.8913f, 0.0660f, { 0.0000f, 0.0000f, 0.0000f }, 0.7943f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_LONGPASSAGE \ + { 1.0000f, 1.0000f, 0.3162f, 0.1000f, 0.3162f, 1.9900f, 0.4000f, 0.7900f, 1.0000f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.4467f, 0.0360f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_HALL \ + { 1.0000f, 1.0000f, 0.3162f, 0.0794f, 0.2818f, 3.4500f, 0.3000f, 0.8200f, 0.8913f, 0.0880f, { 0.0000f, 0.0000f, 0.0000f }, 0.7943f, 0.0630f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_CUPBOARD \ + { 1.0000f, 1.0000f, 0.3162f, 0.1413f, 0.3162f, 0.5600f, 0.4600f, 0.9100f, 1.1220f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0280f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_COURTYARD \ + { 1.0000f, 0.6500f, 0.3162f, 0.0794f, 0.3162f, 1.7900f, 0.3500f, 0.7900f, 0.5623f, 0.1230f, { 0.0000f, 0.0000f, 0.0000f }, 0.1000f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_WOODEN_ALCOVE \ + { 1.0000f, 1.0000f, 0.3162f, 0.1259f, 0.3162f, 1.2200f, 0.6200f, 0.9100f, 1.1220f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 0.7079f, 0.0240f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 4705.0000f, 99.6000f, 0.0000f, 0x1 } + +/* Sports Presets */ + +#define EFX_REVERB_PRESET_SPORT_EMPTYSTADIUM \ + { 1.0000f, 1.0000f, 0.3162f, 0.4467f, 0.7943f, 6.2600f, 0.5100f, 1.1000f, 0.0631f, 0.1830f, { 0.0000f, 0.0000f, 0.0000f }, 0.3981f, 0.0380f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPORT_SQUASHCOURT \ + { 1.0000f, 0.7500f, 0.3162f, 0.3162f, 0.7943f, 2.2200f, 0.9100f, 1.1600f, 0.4467f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 0.7943f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.1260f, 0.1900f, 0.2500f, 0.0000f, 0.9943f, 7176.8999f, 211.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPORT_SMALLSWIMMINGPOOL \ + { 1.0000f, 0.7000f, 0.3162f, 0.7943f, 0.8913f, 2.7600f, 1.2500f, 1.1400f, 0.6310f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.7943f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.1790f, 0.1500f, 0.8950f, 0.1900f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_SPORT_LARGESWIMMINGPOOL \ + { 1.0000f, 0.8200f, 0.3162f, 0.7943f, 1.0000f, 5.4900f, 1.3100f, 1.1400f, 0.4467f, 0.0390f, { 0.0000f, 0.0000f, 0.0000f }, 0.5012f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.2220f, 0.5500f, 1.1590f, 0.2100f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_SPORT_GYMNASIUM \ + { 1.0000f, 0.8100f, 0.3162f, 0.4467f, 0.8913f, 3.1400f, 1.0600f, 1.3500f, 0.3981f, 0.0290f, { 0.0000f, 0.0000f, 0.0000f }, 0.5623f, 0.0450f, { 0.0000f, 0.0000f, 0.0000f }, 0.1460f, 0.1400f, 0.2500f, 0.0000f, 0.9943f, 7176.8999f, 211.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPORT_FULLSTADIUM \ + { 1.0000f, 1.0000f, 0.3162f, 0.0708f, 0.7943f, 5.2500f, 0.1700f, 0.8000f, 0.1000f, 0.1880f, { 0.0000f, 0.0000f, 0.0000f }, 0.2818f, 0.0380f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SPORT_STADIUMTANNOY \ + { 1.0000f, 0.7800f, 0.3162f, 0.5623f, 0.5012f, 2.5300f, 0.8800f, 0.6800f, 0.2818f, 0.2300f, { 0.0000f, 0.0000f, 0.0000f }, 0.5012f, 0.0630f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +/* Prefab Presets */ + +#define EFX_REVERB_PRESET_PREFAB_WORKSHOP \ + { 0.4287f, 1.0000f, 0.3162f, 0.1413f, 0.3981f, 0.7600f, 1.0000f, 1.0000f, 1.0000f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_PREFAB_SCHOOLROOM \ + { 0.4022f, 0.6900f, 0.3162f, 0.6310f, 0.5012f, 0.9800f, 0.4500f, 0.1800f, 1.4125f, 0.0170f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0150f, { 0.0000f, 0.0000f, 0.0000f }, 0.0950f, 0.1400f, 0.2500f, 0.0000f, 0.9943f, 7176.8999f, 211.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PREFAB_PRACTISEROOM \ + { 0.4022f, 0.8700f, 0.3162f, 0.3981f, 0.5012f, 1.1200f, 0.5600f, 0.1800f, 1.2589f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0110f, { 0.0000f, 0.0000f, 0.0000f }, 0.0950f, 0.1400f, 0.2500f, 0.0000f, 0.9943f, 7176.8999f, 211.2000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PREFAB_OUTHOUSE \ + { 1.0000f, 0.8200f, 0.3162f, 0.1122f, 0.1585f, 1.3800f, 0.3800f, 0.3500f, 0.8913f, 0.0240f, { 0.0000f, 0.0000f, -0.0000f }, 0.6310f, 0.0440f, { 0.0000f, 0.0000f, 0.0000f }, 0.1210f, 0.1700f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 107.5000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_PREFAB_CARAVAN \ + { 1.0000f, 1.0000f, 0.3162f, 0.0891f, 0.1259f, 0.4300f, 1.5000f, 1.0000f, 1.0000f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 1.9953f, 0.0120f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +/* Dome and Pipe Presets */ + +#define EFX_REVERB_PRESET_DOME_TOMB \ + { 1.0000f, 0.7900f, 0.3162f, 0.3548f, 0.2239f, 4.1800f, 0.2100f, 0.1000f, 0.3868f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 1.6788f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 0.1770f, 0.1900f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_PIPE_SMALL \ + { 1.0000f, 1.0000f, 0.3162f, 0.3548f, 0.2239f, 5.0400f, 0.1000f, 0.1000f, 0.5012f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 2.5119f, 0.0150f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DOME_SAINTPAULS \ + { 1.0000f, 0.8700f, 0.3162f, 0.3548f, 0.2239f, 10.4800f, 0.1900f, 0.1000f, 0.1778f, 0.0900f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0420f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.1200f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PIPE_LONGTHIN \ + { 0.2560f, 0.9100f, 0.3162f, 0.4467f, 0.2818f, 9.2100f, 0.1800f, 0.1000f, 0.7079f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 0.7079f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_PIPE_LARGE \ + { 1.0000f, 1.0000f, 0.3162f, 0.3548f, 0.2239f, 8.4500f, 0.1000f, 0.1000f, 0.3981f, 0.0460f, { 0.0000f, 0.0000f, 0.0000f }, 1.5849f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_PIPE_RESONANT \ + { 0.1373f, 0.9100f, 0.3162f, 0.4467f, 0.2818f, 6.8100f, 0.1800f, 0.1000f, 0.7079f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.0000f, 0.0220f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 20.0000f, 0.0000f, 0x0 } + +/* Outdoors Presets */ + +#define EFX_REVERB_PRESET_OUTDOORS_BACKYARD \ + { 1.0000f, 0.4500f, 0.3162f, 0.2512f, 0.5012f, 1.1200f, 0.3400f, 0.4600f, 0.4467f, 0.0690f, { 0.0000f, 0.0000f, -0.0000f }, 0.7079f, 0.0230f, { 0.0000f, 0.0000f, 0.0000f }, 0.2180f, 0.3400f, 0.2500f, 0.0000f, 0.9943f, 4399.1001f, 242.9000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_OUTDOORS_ROLLINGPLAINS \ + { 1.0000f, 0.0000f, 0.3162f, 0.0112f, 0.6310f, 2.1300f, 0.2100f, 0.4600f, 0.1778f, 0.3000f, { 0.0000f, 0.0000f, -0.0000f }, 0.4467f, 0.0190f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.2500f, 0.0000f, 0.9943f, 4399.1001f, 242.9000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_OUTDOORS_DEEPCANYON \ + { 1.0000f, 0.7400f, 0.3162f, 0.1778f, 0.6310f, 3.8900f, 0.2100f, 0.4600f, 0.3162f, 0.2230f, { 0.0000f, 0.0000f, -0.0000f }, 0.3548f, 0.0190f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.2500f, 0.0000f, 0.9943f, 4399.1001f, 242.9000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_OUTDOORS_CREEK \ + { 1.0000f, 0.3500f, 0.3162f, 0.1778f, 0.5012f, 2.1300f, 0.2100f, 0.4600f, 0.3981f, 0.1150f, { 0.0000f, 0.0000f, -0.0000f }, 0.1995f, 0.0310f, { 0.0000f, 0.0000f, 0.0000f }, 0.2180f, 0.3400f, 0.2500f, 0.0000f, 0.9943f, 4399.1001f, 242.9000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_OUTDOORS_VALLEY \ + { 1.0000f, 0.2800f, 0.3162f, 0.0282f, 0.1585f, 2.8800f, 0.2600f, 0.3500f, 0.1413f, 0.2630f, { 0.0000f, 0.0000f, -0.0000f }, 0.3981f, 0.1000f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.3400f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 107.5000f, 0.0000f, 0x0 } + +/* Mood Presets */ + +#define EFX_REVERB_PRESET_MOOD_HEAVEN \ + { 1.0000f, 0.9400f, 0.3162f, 0.7943f, 0.4467f, 5.0400f, 1.1200f, 0.5600f, 0.2427f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0290f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0800f, 2.7420f, 0.0500f, 0.9977f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_MOOD_HELL \ + { 1.0000f, 0.5700f, 0.3162f, 0.3548f, 0.4467f, 3.5700f, 0.4900f, 2.0000f, 0.0000f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.1100f, 0.0400f, 2.1090f, 0.5200f, 0.9943f, 5000.0000f, 139.5000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_MOOD_MEMORY \ + { 1.0000f, 0.8500f, 0.3162f, 0.6310f, 0.3548f, 4.0600f, 0.8200f, 0.5600f, 0.0398f, 0.0000f, { 0.0000f, 0.0000f, 0.0000f }, 1.1220f, 0.0000f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.4740f, 0.4500f, 0.9886f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +/* Driving Presets */ + +#define EFX_REVERB_PRESET_DRIVING_COMMENTATOR \ + { 1.0000f, 0.0000f, 3.1623f, 0.5623f, 0.5012f, 2.4200f, 0.8800f, 0.6800f, 0.1995f, 0.0930f, { 0.0000f, 0.0000f, 0.0000f }, 0.2512f, 0.0170f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 1.0000f, 0.2500f, 0.0000f, 0.9886f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DRIVING_PITGARAGE \ + { 0.4287f, 0.5900f, 0.3162f, 0.7079f, 0.5623f, 1.7200f, 0.9300f, 0.8700f, 0.5623f, 0.0000f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0160f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.1100f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_DRIVING_INCAR_RACER \ + { 0.0832f, 0.8000f, 0.3162f, 1.0000f, 0.7943f, 0.1700f, 2.0000f, 0.4100f, 1.7783f, 0.0070f, { 0.0000f, 0.0000f, 0.0000f }, 0.7079f, 0.0150f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 10268.2002f, 251.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DRIVING_INCAR_SPORTS \ + { 0.0832f, 0.8000f, 0.3162f, 0.6310f, 1.0000f, 0.1700f, 0.7500f, 0.4100f, 1.0000f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 0.5623f, 0.0000f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 10268.2002f, 251.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DRIVING_INCAR_LUXURY \ + { 0.2560f, 1.0000f, 0.3162f, 0.1000f, 0.5012f, 0.1300f, 0.4100f, 0.4600f, 0.7943f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 1.5849f, 0.0100f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 10268.2002f, 251.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_DRIVING_FULLGRANDSTAND \ + { 1.0000f, 1.0000f, 0.3162f, 0.2818f, 0.6310f, 3.0100f, 1.3700f, 1.2800f, 0.3548f, 0.0900f, { 0.0000f, 0.0000f, 0.0000f }, 0.1778f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 10420.2002f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_DRIVING_EMPTYGRANDSTAND \ + { 1.0000f, 1.0000f, 0.3162f, 1.0000f, 0.7943f, 4.6200f, 1.7500f, 1.4000f, 0.2082f, 0.0900f, { 0.0000f, 0.0000f, 0.0000f }, 0.2512f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.0000f, 0.9943f, 10420.2002f, 250.0000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_DRIVING_TUNNEL \ + { 1.0000f, 0.8100f, 0.3162f, 0.3981f, 0.8913f, 3.4200f, 0.9400f, 1.3100f, 0.7079f, 0.0510f, { 0.0000f, 0.0000f, 0.0000f }, 0.7079f, 0.0470f, { 0.0000f, 0.0000f, 0.0000f }, 0.2140f, 0.0500f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 155.3000f, 0.0000f, 0x1 } + +/* City Presets */ + +#define EFX_REVERB_PRESET_CITY_STREETS \ + { 1.0000f, 0.7800f, 0.3162f, 0.7079f, 0.8913f, 1.7900f, 1.1200f, 0.9100f, 0.2818f, 0.0460f, { 0.0000f, 0.0000f, 0.0000f }, 0.1995f, 0.0280f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2000f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CITY_SUBWAY \ + { 1.0000f, 0.7400f, 0.3162f, 0.7079f, 0.8913f, 3.0100f, 1.2300f, 0.9100f, 0.7079f, 0.0460f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0280f, { 0.0000f, 0.0000f, 0.0000f }, 0.1250f, 0.2100f, 0.2500f, 0.0000f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CITY_MUSEUM \ + { 1.0000f, 0.8200f, 0.3162f, 0.1778f, 0.1778f, 3.2800f, 1.4000f, 0.5700f, 0.2512f, 0.0390f, { 0.0000f, 0.0000f, -0.0000f }, 0.8913f, 0.0340f, { 0.0000f, 0.0000f, 0.0000f }, 0.1300f, 0.1700f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 107.5000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_CITY_LIBRARY \ + { 1.0000f, 0.8200f, 0.3162f, 0.2818f, 0.0891f, 2.7600f, 0.8900f, 0.4100f, 0.3548f, 0.0290f, { 0.0000f, 0.0000f, -0.0000f }, 0.8913f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 0.1300f, 0.1700f, 0.2500f, 0.0000f, 0.9943f, 2854.3999f, 107.5000f, 0.0000f, 0x0 } + +#define EFX_REVERB_PRESET_CITY_UNDERPASS \ + { 1.0000f, 0.8200f, 0.3162f, 0.4467f, 0.8913f, 3.5700f, 1.1200f, 0.9100f, 0.3981f, 0.0590f, { 0.0000f, 0.0000f, 0.0000f }, 0.8913f, 0.0370f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.1400f, 0.2500f, 0.0000f, 0.9920f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CITY_ABANDONED \ + { 1.0000f, 0.6900f, 0.3162f, 0.7943f, 0.8913f, 3.2800f, 1.1700f, 0.9100f, 0.4467f, 0.0440f, { 0.0000f, 0.0000f, 0.0000f }, 0.2818f, 0.0240f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.2000f, 0.2500f, 0.0000f, 0.9966f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +/* Misc. Presets */ + +#define EFX_REVERB_PRESET_DUSTYROOM \ + { 0.3645f, 0.5600f, 0.3162f, 0.7943f, 0.7079f, 1.7900f, 0.3800f, 0.2100f, 0.5012f, 0.0020f, { 0.0000f, 0.0000f, 0.0000f }, 1.2589f, 0.0060f, { 0.0000f, 0.0000f, 0.0000f }, 0.2020f, 0.0500f, 0.2500f, 0.0000f, 0.9886f, 13046.0000f, 163.3000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_CHAPEL \ + { 1.0000f, 0.8400f, 0.3162f, 0.5623f, 1.0000f, 4.6200f, 0.6400f, 1.2300f, 0.4467f, 0.0320f, { 0.0000f, 0.0000f, 0.0000f }, 0.7943f, 0.0490f, { 0.0000f, 0.0000f, 0.0000f }, 0.2500f, 0.0000f, 0.2500f, 0.1100f, 0.9943f, 5000.0000f, 250.0000f, 0.0000f, 0x1 } + +#define EFX_REVERB_PRESET_SMALLWATERROOM \ + { 1.0000f, 0.7000f, 0.3162f, 0.4477f, 1.0000f, 1.5100f, 1.2500f, 1.1400f, 0.8913f, 0.0200f, { 0.0000f, 0.0000f, 0.0000f }, 1.4125f, 0.0300f, { 0.0000f, 0.0000f, 0.0000f }, 0.1790f, 0.1500f, 0.8950f, 0.1900f, 0.9920f, 5000.0000f, 250.0000f, 0.0000f, 0x0 } + +#endif /* EFX_PRESETS_H */ diff --git a/3rdparty/iaxclient-2/lib/AL/efx.h b/3rdparty/iaxclient-2/lib/AL/efx.h new file mode 100644 index 0000000..5776698 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/AL/efx.h @@ -0,0 +1,761 @@ +#ifndef AL_EFX_H +#define AL_EFX_H + + +#include "alc.h" +#include "al.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#define ALC_EXT_EFX_NAME "ALC_EXT_EFX" + +#define ALC_EFX_MAJOR_VERSION 0x20001 +#define ALC_EFX_MINOR_VERSION 0x20002 +#define ALC_MAX_AUXILIARY_SENDS 0x20003 + + +/* Listener properties. */ +#define AL_METERS_PER_UNIT 0x20004 + +/* Source properties. */ +#define AL_DIRECT_FILTER 0x20005 +#define AL_AUXILIARY_SEND_FILTER 0x20006 +#define AL_AIR_ABSORPTION_FACTOR 0x20007 +#define AL_ROOM_ROLLOFF_FACTOR 0x20008 +#define AL_CONE_OUTER_GAINHF 0x20009 +#define AL_DIRECT_FILTER_GAINHF_AUTO 0x2000A +#define AL_AUXILIARY_SEND_FILTER_GAIN_AUTO 0x2000B +#define AL_AUXILIARY_SEND_FILTER_GAINHF_AUTO 0x2000C + + +/* Effect properties. */ + +/* Reverb effect parameters */ +#define AL_REVERB_DENSITY 0x0001 +#define AL_REVERB_DIFFUSION 0x0002 +#define AL_REVERB_GAIN 0x0003 +#define AL_REVERB_GAINHF 0x0004 +#define AL_REVERB_DECAY_TIME 0x0005 +#define AL_REVERB_DECAY_HFRATIO 0x0006 +#define AL_REVERB_REFLECTIONS_GAIN 0x0007 +#define AL_REVERB_REFLECTIONS_DELAY 0x0008 +#define AL_REVERB_LATE_REVERB_GAIN 0x0009 +#define AL_REVERB_LATE_REVERB_DELAY 0x000A +#define AL_REVERB_AIR_ABSORPTION_GAINHF 0x000B +#define AL_REVERB_ROOM_ROLLOFF_FACTOR 0x000C +#define AL_REVERB_DECAY_HFLIMIT 0x000D + +/* EAX Reverb effect parameters */ +#define AL_EAXREVERB_DENSITY 0x0001 +#define AL_EAXREVERB_DIFFUSION 0x0002 +#define AL_EAXREVERB_GAIN 0x0003 +#define AL_EAXREVERB_GAINHF 0x0004 +#define AL_EAXREVERB_GAINLF 0x0005 +#define AL_EAXREVERB_DECAY_TIME 0x0006 +#define AL_EAXREVERB_DECAY_HFRATIO 0x0007 +#define AL_EAXREVERB_DECAY_LFRATIO 0x0008 +#define AL_EAXREVERB_REFLECTIONS_GAIN 0x0009 +#define AL_EAXREVERB_REFLECTIONS_DELAY 0x000A +#define AL_EAXREVERB_REFLECTIONS_PAN 0x000B +#define AL_EAXREVERB_LATE_REVERB_GAIN 0x000C +#define AL_EAXREVERB_LATE_REVERB_DELAY 0x000D +#define AL_EAXREVERB_LATE_REVERB_PAN 0x000E +#define AL_EAXREVERB_ECHO_TIME 0x000F +#define AL_EAXREVERB_ECHO_DEPTH 0x0010 +#define AL_EAXREVERB_MODULATION_TIME 0x0011 +#define AL_EAXREVERB_MODULATION_DEPTH 0x0012 +#define AL_EAXREVERB_AIR_ABSORPTION_GAINHF 0x0013 +#define AL_EAXREVERB_HFREFERENCE 0x0014 +#define AL_EAXREVERB_LFREFERENCE 0x0015 +#define AL_EAXREVERB_ROOM_ROLLOFF_FACTOR 0x0016 +#define AL_EAXREVERB_DECAY_HFLIMIT 0x0017 + +/* Chorus effect parameters */ +#define AL_CHORUS_WAVEFORM 0x0001 +#define AL_CHORUS_PHASE 0x0002 +#define AL_CHORUS_RATE 0x0003 +#define AL_CHORUS_DEPTH 0x0004 +#define AL_CHORUS_FEEDBACK 0x0005 +#define AL_CHORUS_DELAY 0x0006 + +/* Distortion effect parameters */ +#define AL_DISTORTION_EDGE 0x0001 +#define AL_DISTORTION_GAIN 0x0002 +#define AL_DISTORTION_LOWPASS_CUTOFF 0x0003 +#define AL_DISTORTION_EQCENTER 0x0004 +#define AL_DISTORTION_EQBANDWIDTH 0x0005 + +/* Echo effect parameters */ +#define AL_ECHO_DELAY 0x0001 +#define AL_ECHO_LRDELAY 0x0002 +#define AL_ECHO_DAMPING 0x0003 +#define AL_ECHO_FEEDBACK 0x0004 +#define AL_ECHO_SPREAD 0x0005 + +/* Flanger effect parameters */ +#define AL_FLANGER_WAVEFORM 0x0001 +#define AL_FLANGER_PHASE 0x0002 +#define AL_FLANGER_RATE 0x0003 +#define AL_FLANGER_DEPTH 0x0004 +#define AL_FLANGER_FEEDBACK 0x0005 +#define AL_FLANGER_DELAY 0x0006 + +/* Frequency shifter effect parameters */ +#define AL_FREQUENCY_SHIFTER_FREQUENCY 0x0001 +#define AL_FREQUENCY_SHIFTER_LEFT_DIRECTION 0x0002 +#define AL_FREQUENCY_SHIFTER_RIGHT_DIRECTION 0x0003 + +/* Vocal morpher effect parameters */ +#define AL_VOCAL_MORPHER_PHONEMEA 0x0001 +#define AL_VOCAL_MORPHER_PHONEMEA_COARSE_TUNING 0x0002 +#define AL_VOCAL_MORPHER_PHONEMEB 0x0003 +#define AL_VOCAL_MORPHER_PHONEMEB_COARSE_TUNING 0x0004 +#define AL_VOCAL_MORPHER_WAVEFORM 0x0005 +#define AL_VOCAL_MORPHER_RATE 0x0006 + +/* Pitchshifter effect parameters */ +#define AL_PITCH_SHIFTER_COARSE_TUNE 0x0001 +#define AL_PITCH_SHIFTER_FINE_TUNE 0x0002 + +/* Ringmodulator effect parameters */ +#define AL_RING_MODULATOR_FREQUENCY 0x0001 +#define AL_RING_MODULATOR_HIGHPASS_CUTOFF 0x0002 +#define AL_RING_MODULATOR_WAVEFORM 0x0003 + +/* Autowah effect parameters */ +#define AL_AUTOWAH_ATTACK_TIME 0x0001 +#define AL_AUTOWAH_RELEASE_TIME 0x0002 +#define AL_AUTOWAH_RESONANCE 0x0003 +#define AL_AUTOWAH_PEAK_GAIN 0x0004 + +/* Compressor effect parameters */ +#define AL_COMPRESSOR_ONOFF 0x0001 + +/* Equalizer effect parameters */ +#define AL_EQUALIZER_LOW_GAIN 0x0001 +#define AL_EQUALIZER_LOW_CUTOFF 0x0002 +#define AL_EQUALIZER_MID1_GAIN 0x0003 +#define AL_EQUALIZER_MID1_CENTER 0x0004 +#define AL_EQUALIZER_MID1_WIDTH 0x0005 +#define AL_EQUALIZER_MID2_GAIN 0x0006 +#define AL_EQUALIZER_MID2_CENTER 0x0007 +#define AL_EQUALIZER_MID2_WIDTH 0x0008 +#define AL_EQUALIZER_HIGH_GAIN 0x0009 +#define AL_EQUALIZER_HIGH_CUTOFF 0x000A + +/* Effect type */ +#define AL_EFFECT_FIRST_PARAMETER 0x0000 +#define AL_EFFECT_LAST_PARAMETER 0x8000 +#define AL_EFFECT_TYPE 0x8001 + +/* Effect types, used with the AL_EFFECT_TYPE property */ +#define AL_EFFECT_NULL 0x0000 +#define AL_EFFECT_REVERB 0x0001 +#define AL_EFFECT_CHORUS 0x0002 +#define AL_EFFECT_DISTORTION 0x0003 +#define AL_EFFECT_ECHO 0x0004 +#define AL_EFFECT_FLANGER 0x0005 +#define AL_EFFECT_FREQUENCY_SHIFTER 0x0006 +#define AL_EFFECT_VOCAL_MORPHER 0x0007 +#define AL_EFFECT_PITCH_SHIFTER 0x0008 +#define AL_EFFECT_RING_MODULATOR 0x0009 +#define AL_EFFECT_AUTOWAH 0x000A +#define AL_EFFECT_COMPRESSOR 0x000B +#define AL_EFFECT_EQUALIZER 0x000C +#define AL_EFFECT_EAXREVERB 0x8000 + +/* Auxiliary Effect Slot properties. */ +#define AL_EFFECTSLOT_EFFECT 0x0001 +#define AL_EFFECTSLOT_GAIN 0x0002 +#define AL_EFFECTSLOT_AUXILIARY_SEND_AUTO 0x0003 + +/* NULL Auxiliary Slot ID to disable a source send. */ +#define AL_EFFECTSLOT_NULL 0x0000 + + +/* Filter properties. */ + +/* Lowpass filter parameters */ +#define AL_LOWPASS_GAIN 0x0001 +#define AL_LOWPASS_GAINHF 0x0002 + +/* Highpass filter parameters */ +#define AL_HIGHPASS_GAIN 0x0001 +#define AL_HIGHPASS_GAINLF 0x0002 + +/* Bandpass filter parameters */ +#define AL_BANDPASS_GAIN 0x0001 +#define AL_BANDPASS_GAINLF 0x0002 +#define AL_BANDPASS_GAINHF 0x0003 + +/* Filter type */ +#define AL_FILTER_FIRST_PARAMETER 0x0000 +#define AL_FILTER_LAST_PARAMETER 0x8000 +#define AL_FILTER_TYPE 0x8001 + +/* Filter types, used with the AL_FILTER_TYPE property */ +#define AL_FILTER_NULL 0x0000 +#define AL_FILTER_LOWPASS 0x0001 +#define AL_FILTER_HIGHPASS 0x0002 +#define AL_FILTER_BANDPASS 0x0003 + + +/* Effect object function types. */ +typedef void (AL_APIENTRY *LPALGENEFFECTS)(ALsizei, ALuint*); +typedef void (AL_APIENTRY *LPALDELETEEFFECTS)(ALsizei, const ALuint*); +typedef ALboolean (AL_APIENTRY *LPALISEFFECT)(ALuint); +typedef void (AL_APIENTRY *LPALEFFECTI)(ALuint, ALenum, ALint); +typedef void (AL_APIENTRY *LPALEFFECTIV)(ALuint, ALenum, const ALint*); +typedef void (AL_APIENTRY *LPALEFFECTF)(ALuint, ALenum, ALfloat); +typedef void (AL_APIENTRY *LPALEFFECTFV)(ALuint, ALenum, const ALfloat*); +typedef void (AL_APIENTRY *LPALGETEFFECTI)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETEFFECTIV)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETEFFECTF)(ALuint, ALenum, ALfloat*); +typedef void (AL_APIENTRY *LPALGETEFFECTFV)(ALuint, ALenum, ALfloat*); + +/* Filter object function types. */ +typedef void (AL_APIENTRY *LPALGENFILTERS)(ALsizei, ALuint*); +typedef void (AL_APIENTRY *LPALDELETEFILTERS)(ALsizei, const ALuint*); +typedef ALboolean (AL_APIENTRY *LPALISFILTER)(ALuint); +typedef void (AL_APIENTRY *LPALFILTERI)(ALuint, ALenum, ALint); +typedef void (AL_APIENTRY *LPALFILTERIV)(ALuint, ALenum, const ALint*); +typedef void (AL_APIENTRY *LPALFILTERF)(ALuint, ALenum, ALfloat); +typedef void (AL_APIENTRY *LPALFILTERFV)(ALuint, ALenum, const ALfloat*); +typedef void (AL_APIENTRY *LPALGETFILTERI)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETFILTERIV)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETFILTERF)(ALuint, ALenum, ALfloat*); +typedef void (AL_APIENTRY *LPALGETFILTERFV)(ALuint, ALenum, ALfloat*); + +/* Auxiliary Effect Slot object function types. */ +typedef void (AL_APIENTRY *LPALGENAUXILIARYEFFECTSLOTS)(ALsizei, ALuint*); +typedef void (AL_APIENTRY *LPALDELETEAUXILIARYEFFECTSLOTS)(ALsizei, const ALuint*); +typedef ALboolean (AL_APIENTRY *LPALISAUXILIARYEFFECTSLOT)(ALuint); +typedef void (AL_APIENTRY *LPALAUXILIARYEFFECTSLOTI)(ALuint, ALenum, ALint); +typedef void (AL_APIENTRY *LPALAUXILIARYEFFECTSLOTIV)(ALuint, ALenum, const ALint*); +typedef void (AL_APIENTRY *LPALAUXILIARYEFFECTSLOTF)(ALuint, ALenum, ALfloat); +typedef void (AL_APIENTRY *LPALAUXILIARYEFFECTSLOTFV)(ALuint, ALenum, const ALfloat*); +typedef void (AL_APIENTRY *LPALGETAUXILIARYEFFECTSLOTI)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETAUXILIARYEFFECTSLOTIV)(ALuint, ALenum, ALint*); +typedef void (AL_APIENTRY *LPALGETAUXILIARYEFFECTSLOTF)(ALuint, ALenum, ALfloat*); +typedef void (AL_APIENTRY *LPALGETAUXILIARYEFFECTSLOTFV)(ALuint, ALenum, ALfloat*); + +#ifdef AL_ALEXT_PROTOTYPES +AL_API ALvoid AL_APIENTRY alGenEffects(ALsizei n, ALuint *effects); +AL_API ALvoid AL_APIENTRY alDeleteEffects(ALsizei n, const ALuint *effects); +AL_API ALboolean AL_APIENTRY alIsEffect(ALuint effect); +AL_API ALvoid AL_APIENTRY alEffecti(ALuint effect, ALenum param, ALint iValue); +AL_API ALvoid AL_APIENTRY alEffectiv(ALuint effect, ALenum param, const ALint *piValues); +AL_API ALvoid AL_APIENTRY alEffectf(ALuint effect, ALenum param, ALfloat flValue); +AL_API ALvoid AL_APIENTRY alEffectfv(ALuint effect, ALenum param, const ALfloat *pflValues); +AL_API ALvoid AL_APIENTRY alGetEffecti(ALuint effect, ALenum param, ALint *piValue); +AL_API ALvoid AL_APIENTRY alGetEffectiv(ALuint effect, ALenum param, ALint *piValues); +AL_API ALvoid AL_APIENTRY alGetEffectf(ALuint effect, ALenum param, ALfloat *pflValue); +AL_API ALvoid AL_APIENTRY alGetEffectfv(ALuint effect, ALenum param, ALfloat *pflValues); + +AL_API ALvoid AL_APIENTRY alGenFilters(ALsizei n, ALuint *filters); +AL_API ALvoid AL_APIENTRY alDeleteFilters(ALsizei n, const ALuint *filters); +AL_API ALboolean AL_APIENTRY alIsFilter(ALuint filter); +AL_API ALvoid AL_APIENTRY alFilteri(ALuint filter, ALenum param, ALint iValue); +AL_API ALvoid AL_APIENTRY alFilteriv(ALuint filter, ALenum param, const ALint *piValues); +AL_API ALvoid AL_APIENTRY alFilterf(ALuint filter, ALenum param, ALfloat flValue); +AL_API ALvoid AL_APIENTRY alFilterfv(ALuint filter, ALenum param, const ALfloat *pflValues); +AL_API ALvoid AL_APIENTRY alGetFilteri(ALuint filter, ALenum param, ALint *piValue); +AL_API ALvoid AL_APIENTRY alGetFilteriv(ALuint filter, ALenum param, ALint *piValues); +AL_API ALvoid AL_APIENTRY alGetFilterf(ALuint filter, ALenum param, ALfloat *pflValue); +AL_API ALvoid AL_APIENTRY alGetFilterfv(ALuint filter, ALenum param, ALfloat *pflValues); + +AL_API ALvoid AL_APIENTRY alGenAuxiliaryEffectSlots(ALsizei n, ALuint *effectslots); +AL_API ALvoid AL_APIENTRY alDeleteAuxiliaryEffectSlots(ALsizei n, const ALuint *effectslots); +AL_API ALboolean AL_APIENTRY alIsAuxiliaryEffectSlot(ALuint effectslot); +AL_API ALvoid AL_APIENTRY alAuxiliaryEffectSloti(ALuint effectslot, ALenum param, ALint iValue); +AL_API ALvoid AL_APIENTRY alAuxiliaryEffectSlotiv(ALuint effectslot, ALenum param, const ALint *piValues); +AL_API ALvoid AL_APIENTRY alAuxiliaryEffectSlotf(ALuint effectslot, ALenum param, ALfloat flValue); +AL_API ALvoid AL_APIENTRY alAuxiliaryEffectSlotfv(ALuint effectslot, ALenum param, const ALfloat *pflValues); +AL_API ALvoid AL_APIENTRY alGetAuxiliaryEffectSloti(ALuint effectslot, ALenum param, ALint *piValue); +AL_API ALvoid AL_APIENTRY alGetAuxiliaryEffectSlotiv(ALuint effectslot, ALenum param, ALint *piValues); +AL_API ALvoid AL_APIENTRY alGetAuxiliaryEffectSlotf(ALuint effectslot, ALenum param, ALfloat *pflValue); +AL_API ALvoid AL_APIENTRY alGetAuxiliaryEffectSlotfv(ALuint effectslot, ALenum param, ALfloat *pflValues); +#endif + +/* Filter ranges and defaults. */ + +/* Lowpass filter */ +#define AL_LOWPASS_MIN_GAIN (0.0f) +#define AL_LOWPASS_MAX_GAIN (1.0f) +#define AL_LOWPASS_DEFAULT_GAIN (1.0f) + +#define AL_LOWPASS_MIN_GAINHF (0.0f) +#define AL_LOWPASS_MAX_GAINHF (1.0f) +#define AL_LOWPASS_DEFAULT_GAINHF (1.0f) + +/* Highpass filter */ +#define AL_HIGHPASS_MIN_GAIN (0.0f) +#define AL_HIGHPASS_MAX_GAIN (1.0f) +#define AL_HIGHPASS_DEFAULT_GAIN (1.0f) + +#define AL_HIGHPASS_MIN_GAINLF (0.0f) +#define AL_HIGHPASS_MAX_GAINLF (1.0f) +#define AL_HIGHPASS_DEFAULT_GAINLF (1.0f) + +/* Bandpass filter */ +#define AL_BANDPASS_MIN_GAIN (0.0f) +#define AL_BANDPASS_MAX_GAIN (1.0f) +#define AL_BANDPASS_DEFAULT_GAIN (1.0f) + +#define AL_BANDPASS_MIN_GAINHF (0.0f) +#define AL_BANDPASS_MAX_GAINHF (1.0f) +#define AL_BANDPASS_DEFAULT_GAINHF (1.0f) + +#define AL_BANDPASS_MIN_GAINLF (0.0f) +#define AL_BANDPASS_MAX_GAINLF (1.0f) +#define AL_BANDPASS_DEFAULT_GAINLF (1.0f) + + +/* Effect parameter ranges and defaults. */ + +/* Standard reverb effect */ +#define AL_REVERB_MIN_DENSITY (0.0f) +#define AL_REVERB_MAX_DENSITY (1.0f) +#define AL_REVERB_DEFAULT_DENSITY (1.0f) + +#define AL_REVERB_MIN_DIFFUSION (0.0f) +#define AL_REVERB_MAX_DIFFUSION (1.0f) +#define AL_REVERB_DEFAULT_DIFFUSION (1.0f) + +#define AL_REVERB_MIN_GAIN (0.0f) +#define AL_REVERB_MAX_GAIN (1.0f) +#define AL_REVERB_DEFAULT_GAIN (0.32f) + +#define AL_REVERB_MIN_GAINHF (0.0f) +#define AL_REVERB_MAX_GAINHF (1.0f) +#define AL_REVERB_DEFAULT_GAINHF (0.89f) + +#define AL_REVERB_MIN_DECAY_TIME (0.1f) +#define AL_REVERB_MAX_DECAY_TIME (20.0f) +#define AL_REVERB_DEFAULT_DECAY_TIME (1.49f) + +#define AL_REVERB_MIN_DECAY_HFRATIO (0.1f) +#define AL_REVERB_MAX_DECAY_HFRATIO (2.0f) +#define AL_REVERB_DEFAULT_DECAY_HFRATIO (0.83f) + +#define AL_REVERB_MIN_REFLECTIONS_GAIN (0.0f) +#define AL_REVERB_MAX_REFLECTIONS_GAIN (3.16f) +#define AL_REVERB_DEFAULT_REFLECTIONS_GAIN (0.05f) + +#define AL_REVERB_MIN_REFLECTIONS_DELAY (0.0f) +#define AL_REVERB_MAX_REFLECTIONS_DELAY (0.3f) +#define AL_REVERB_DEFAULT_REFLECTIONS_DELAY (0.007f) + +#define AL_REVERB_MIN_LATE_REVERB_GAIN (0.0f) +#define AL_REVERB_MAX_LATE_REVERB_GAIN (10.0f) +#define AL_REVERB_DEFAULT_LATE_REVERB_GAIN (1.26f) + +#define AL_REVERB_MIN_LATE_REVERB_DELAY (0.0f) +#define AL_REVERB_MAX_LATE_REVERB_DELAY (0.1f) +#define AL_REVERB_DEFAULT_LATE_REVERB_DELAY (0.011f) + +#define AL_REVERB_MIN_AIR_ABSORPTION_GAINHF (0.892f) +#define AL_REVERB_MAX_AIR_ABSORPTION_GAINHF (1.0f) +#define AL_REVERB_DEFAULT_AIR_ABSORPTION_GAINHF (0.994f) + +#define AL_REVERB_MIN_ROOM_ROLLOFF_FACTOR (0.0f) +#define AL_REVERB_MAX_ROOM_ROLLOFF_FACTOR (10.0f) +#define AL_REVERB_DEFAULT_ROOM_ROLLOFF_FACTOR (0.0f) + +#define AL_REVERB_MIN_DECAY_HFLIMIT AL_FALSE +#define AL_REVERB_MAX_DECAY_HFLIMIT AL_TRUE +#define AL_REVERB_DEFAULT_DECAY_HFLIMIT AL_TRUE + +/* EAX reverb effect */ +#define AL_EAXREVERB_MIN_DENSITY (0.0f) +#define AL_EAXREVERB_MAX_DENSITY (1.0f) +#define AL_EAXREVERB_DEFAULT_DENSITY (1.0f) + +#define AL_EAXREVERB_MIN_DIFFUSION (0.0f) +#define AL_EAXREVERB_MAX_DIFFUSION (1.0f) +#define AL_EAXREVERB_DEFAULT_DIFFUSION (1.0f) + +#define AL_EAXREVERB_MIN_GAIN (0.0f) +#define AL_EAXREVERB_MAX_GAIN (1.0f) +#define AL_EAXREVERB_DEFAULT_GAIN (0.32f) + +#define AL_EAXREVERB_MIN_GAINHF (0.0f) +#define AL_EAXREVERB_MAX_GAINHF (1.0f) +#define AL_EAXREVERB_DEFAULT_GAINHF (0.89f) + +#define AL_EAXREVERB_MIN_GAINLF (0.0f) +#define AL_EAXREVERB_MAX_GAINLF (1.0f) +#define AL_EAXREVERB_DEFAULT_GAINLF (1.0f) + +#define AL_EAXREVERB_MIN_DECAY_TIME (0.1f) +#define AL_EAXREVERB_MAX_DECAY_TIME (20.0f) +#define AL_EAXREVERB_DEFAULT_DECAY_TIME (1.49f) + +#define AL_EAXREVERB_MIN_DECAY_HFRATIO (0.1f) +#define AL_EAXREVERB_MAX_DECAY_HFRATIO (2.0f) +#define AL_EAXREVERB_DEFAULT_DECAY_HFRATIO (0.83f) + +#define AL_EAXREVERB_MIN_DECAY_LFRATIO (0.1f) +#define AL_EAXREVERB_MAX_DECAY_LFRATIO (2.0f) +#define AL_EAXREVERB_DEFAULT_DECAY_LFRATIO (1.0f) + +#define AL_EAXREVERB_MIN_REFLECTIONS_GAIN (0.0f) +#define AL_EAXREVERB_MAX_REFLECTIONS_GAIN (3.16f) +#define AL_EAXREVERB_DEFAULT_REFLECTIONS_GAIN (0.05f) + +#define AL_EAXREVERB_MIN_REFLECTIONS_DELAY (0.0f) +#define AL_EAXREVERB_MAX_REFLECTIONS_DELAY (0.3f) +#define AL_EAXREVERB_DEFAULT_REFLECTIONS_DELAY (0.007f) + +#define AL_EAXREVERB_DEFAULT_REFLECTIONS_PAN_XYZ (0.0f) + +#define AL_EAXREVERB_MIN_LATE_REVERB_GAIN (0.0f) +#define AL_EAXREVERB_MAX_LATE_REVERB_GAIN (10.0f) +#define AL_EAXREVERB_DEFAULT_LATE_REVERB_GAIN (1.26f) + +#define AL_EAXREVERB_MIN_LATE_REVERB_DELAY (0.0f) +#define AL_EAXREVERB_MAX_LATE_REVERB_DELAY (0.1f) +#define AL_EAXREVERB_DEFAULT_LATE_REVERB_DELAY (0.011f) + +#define AL_EAXREVERB_DEFAULT_LATE_REVERB_PAN_XYZ (0.0f) + +#define AL_EAXREVERB_MIN_ECHO_TIME (0.075f) +#define AL_EAXREVERB_MAX_ECHO_TIME (0.25f) +#define AL_EAXREVERB_DEFAULT_ECHO_TIME (0.25f) + +#define AL_EAXREVERB_MIN_ECHO_DEPTH (0.0f) +#define AL_EAXREVERB_MAX_ECHO_DEPTH (1.0f) +#define AL_EAXREVERB_DEFAULT_ECHO_DEPTH (0.0f) + +#define AL_EAXREVERB_MIN_MODULATION_TIME (0.04f) +#define AL_EAXREVERB_MAX_MODULATION_TIME (4.0f) +#define AL_EAXREVERB_DEFAULT_MODULATION_TIME (0.25f) + +#define AL_EAXREVERB_MIN_MODULATION_DEPTH (0.0f) +#define AL_EAXREVERB_MAX_MODULATION_DEPTH (1.0f) +#define AL_EAXREVERB_DEFAULT_MODULATION_DEPTH (0.0f) + +#define AL_EAXREVERB_MIN_AIR_ABSORPTION_GAINHF (0.892f) +#define AL_EAXREVERB_MAX_AIR_ABSORPTION_GAINHF (1.0f) +#define AL_EAXREVERB_DEFAULT_AIR_ABSORPTION_GAINHF (0.994f) + +#define AL_EAXREVERB_MIN_HFREFERENCE (1000.0f) +#define AL_EAXREVERB_MAX_HFREFERENCE (20000.0f) +#define AL_EAXREVERB_DEFAULT_HFREFERENCE (5000.0f) + +#define AL_EAXREVERB_MIN_LFREFERENCE (20.0f) +#define AL_EAXREVERB_MAX_LFREFERENCE (1000.0f) +#define AL_EAXREVERB_DEFAULT_LFREFERENCE (250.0f) + +#define AL_EAXREVERB_MIN_ROOM_ROLLOFF_FACTOR (0.0f) +#define AL_EAXREVERB_MAX_ROOM_ROLLOFF_FACTOR (10.0f) +#define AL_EAXREVERB_DEFAULT_ROOM_ROLLOFF_FACTOR (0.0f) + +#define AL_EAXREVERB_MIN_DECAY_HFLIMIT AL_FALSE +#define AL_EAXREVERB_MAX_DECAY_HFLIMIT AL_TRUE +#define AL_EAXREVERB_DEFAULT_DECAY_HFLIMIT AL_TRUE + +/* Chorus effect */ +#define AL_CHORUS_WAVEFORM_SINUSOID (0) +#define AL_CHORUS_WAVEFORM_TRIANGLE (1) + +#define AL_CHORUS_MIN_WAVEFORM (0) +#define AL_CHORUS_MAX_WAVEFORM (1) +#define AL_CHORUS_DEFAULT_WAVEFORM (1) + +#define AL_CHORUS_MIN_PHASE (-180) +#define AL_CHORUS_MAX_PHASE (180) +#define AL_CHORUS_DEFAULT_PHASE (90) + +#define AL_CHORUS_MIN_RATE (0.0f) +#define AL_CHORUS_MAX_RATE (10.0f) +#define AL_CHORUS_DEFAULT_RATE (1.1f) + +#define AL_CHORUS_MIN_DEPTH (0.0f) +#define AL_CHORUS_MAX_DEPTH (1.0f) +#define AL_CHORUS_DEFAULT_DEPTH (0.1f) + +#define AL_CHORUS_MIN_FEEDBACK (-1.0f) +#define AL_CHORUS_MAX_FEEDBACK (1.0f) +#define AL_CHORUS_DEFAULT_FEEDBACK (0.25f) + +#define AL_CHORUS_MIN_DELAY (0.0f) +#define AL_CHORUS_MAX_DELAY (0.016f) +#define AL_CHORUS_DEFAULT_DELAY (0.016f) + +/* Distortion effect */ +#define AL_DISTORTION_MIN_EDGE (0.0f) +#define AL_DISTORTION_MAX_EDGE (1.0f) +#define AL_DISTORTION_DEFAULT_EDGE (0.2f) + +#define AL_DISTORTION_MIN_GAIN (0.01f) +#define AL_DISTORTION_MAX_GAIN (1.0f) +#define AL_DISTORTION_DEFAULT_GAIN (0.05f) + +#define AL_DISTORTION_MIN_LOWPASS_CUTOFF (80.0f) +#define AL_DISTORTION_MAX_LOWPASS_CUTOFF (24000.0f) +#define AL_DISTORTION_DEFAULT_LOWPASS_CUTOFF (8000.0f) + +#define AL_DISTORTION_MIN_EQCENTER (80.0f) +#define AL_DISTORTION_MAX_EQCENTER (24000.0f) +#define AL_DISTORTION_DEFAULT_EQCENTER (3600.0f) + +#define AL_DISTORTION_MIN_EQBANDWIDTH (80.0f) +#define AL_DISTORTION_MAX_EQBANDWIDTH (24000.0f) +#define AL_DISTORTION_DEFAULT_EQBANDWIDTH (3600.0f) + +/* Echo effect */ +#define AL_ECHO_MIN_DELAY (0.0f) +#define AL_ECHO_MAX_DELAY (0.207f) +#define AL_ECHO_DEFAULT_DELAY (0.1f) + +#define AL_ECHO_MIN_LRDELAY (0.0f) +#define AL_ECHO_MAX_LRDELAY (0.404f) +#define AL_ECHO_DEFAULT_LRDELAY (0.1f) + +#define AL_ECHO_MIN_DAMPING (0.0f) +#define AL_ECHO_MAX_DAMPING (0.99f) +#define AL_ECHO_DEFAULT_DAMPING (0.5f) + +#define AL_ECHO_MIN_FEEDBACK (0.0f) +#define AL_ECHO_MAX_FEEDBACK (1.0f) +#define AL_ECHO_DEFAULT_FEEDBACK (0.5f) + +#define AL_ECHO_MIN_SPREAD (-1.0f) +#define AL_ECHO_MAX_SPREAD (1.0f) +#define AL_ECHO_DEFAULT_SPREAD (-1.0f) + +/* Flanger effect */ +#define AL_FLANGER_WAVEFORM_SINUSOID (0) +#define AL_FLANGER_WAVEFORM_TRIANGLE (1) + +#define AL_FLANGER_MIN_WAVEFORM (0) +#define AL_FLANGER_MAX_WAVEFORM (1) +#define AL_FLANGER_DEFAULT_WAVEFORM (1) + +#define AL_FLANGER_MIN_PHASE (-180) +#define AL_FLANGER_MAX_PHASE (180) +#define AL_FLANGER_DEFAULT_PHASE (0) + +#define AL_FLANGER_MIN_RATE (0.0f) +#define AL_FLANGER_MAX_RATE (10.0f) +#define AL_FLANGER_DEFAULT_RATE (0.27f) + +#define AL_FLANGER_MIN_DEPTH (0.0f) +#define AL_FLANGER_MAX_DEPTH (1.0f) +#define AL_FLANGER_DEFAULT_DEPTH (1.0f) + +#define AL_FLANGER_MIN_FEEDBACK (-1.0f) +#define AL_FLANGER_MAX_FEEDBACK (1.0f) +#define AL_FLANGER_DEFAULT_FEEDBACK (-0.5f) + +#define AL_FLANGER_MIN_DELAY (0.0f) +#define AL_FLANGER_MAX_DELAY (0.004f) +#define AL_FLANGER_DEFAULT_DELAY (0.002f) + +/* Frequency shifter effect */ +#define AL_FREQUENCY_SHIFTER_MIN_FREQUENCY (0.0f) +#define AL_FREQUENCY_SHIFTER_MAX_FREQUENCY (24000.0f) +#define AL_FREQUENCY_SHIFTER_DEFAULT_FREQUENCY (0.0f) + +#define AL_FREQUENCY_SHIFTER_MIN_LEFT_DIRECTION (0) +#define AL_FREQUENCY_SHIFTER_MAX_LEFT_DIRECTION (2) +#define AL_FREQUENCY_SHIFTER_DEFAULT_LEFT_DIRECTION (0) + +#define AL_FREQUENCY_SHIFTER_DIRECTION_DOWN (0) +#define AL_FREQUENCY_SHIFTER_DIRECTION_UP (1) +#define AL_FREQUENCY_SHIFTER_DIRECTION_OFF (2) + +#define AL_FREQUENCY_SHIFTER_MIN_RIGHT_DIRECTION (0) +#define AL_FREQUENCY_SHIFTER_MAX_RIGHT_DIRECTION (2) +#define AL_FREQUENCY_SHIFTER_DEFAULT_RIGHT_DIRECTION (0) + +/* Vocal morpher effect */ +#define AL_VOCAL_MORPHER_MIN_PHONEMEA (0) +#define AL_VOCAL_MORPHER_MAX_PHONEMEA (29) +#define AL_VOCAL_MORPHER_DEFAULT_PHONEMEA (0) + +#define AL_VOCAL_MORPHER_MIN_PHONEMEA_COARSE_TUNING (-24) +#define AL_VOCAL_MORPHER_MAX_PHONEMEA_COARSE_TUNING (24) +#define AL_VOCAL_MORPHER_DEFAULT_PHONEMEA_COARSE_TUNING (0) + +#define AL_VOCAL_MORPHER_MIN_PHONEMEB (0) +#define AL_VOCAL_MORPHER_MAX_PHONEMEB (29) +#define AL_VOCAL_MORPHER_DEFAULT_PHONEMEB (10) + +#define AL_VOCAL_MORPHER_MIN_PHONEMEB_COARSE_TUNING (-24) +#define AL_VOCAL_MORPHER_MAX_PHONEMEB_COARSE_TUNING (24) +#define AL_VOCAL_MORPHER_DEFAULT_PHONEMEB_COARSE_TUNING (0) + +#define AL_VOCAL_MORPHER_PHONEME_A (0) +#define AL_VOCAL_MORPHER_PHONEME_E (1) +#define AL_VOCAL_MORPHER_PHONEME_I (2) +#define AL_VOCAL_MORPHER_PHONEME_O (3) +#define AL_VOCAL_MORPHER_PHONEME_U (4) +#define AL_VOCAL_MORPHER_PHONEME_AA (5) +#define AL_VOCAL_MORPHER_PHONEME_AE (6) +#define AL_VOCAL_MORPHER_PHONEME_AH (7) +#define AL_VOCAL_MORPHER_PHONEME_AO (8) +#define AL_VOCAL_MORPHER_PHONEME_EH (9) +#define AL_VOCAL_MORPHER_PHONEME_ER (10) +#define AL_VOCAL_MORPHER_PHONEME_IH (11) +#define AL_VOCAL_MORPHER_PHONEME_IY (12) +#define AL_VOCAL_MORPHER_PHONEME_UH (13) +#define AL_VOCAL_MORPHER_PHONEME_UW (14) +#define AL_VOCAL_MORPHER_PHONEME_B (15) +#define AL_VOCAL_MORPHER_PHONEME_D (16) +#define AL_VOCAL_MORPHER_PHONEME_F (17) +#define AL_VOCAL_MORPHER_PHONEME_G (18) +#define AL_VOCAL_MORPHER_PHONEME_J (19) +#define AL_VOCAL_MORPHER_PHONEME_K (20) +#define AL_VOCAL_MORPHER_PHONEME_L (21) +#define AL_VOCAL_MORPHER_PHONEME_M (22) +#define AL_VOCAL_MORPHER_PHONEME_N (23) +#define AL_VOCAL_MORPHER_PHONEME_P (24) +#define AL_VOCAL_MORPHER_PHONEME_R (25) +#define AL_VOCAL_MORPHER_PHONEME_S (26) +#define AL_VOCAL_MORPHER_PHONEME_T (27) +#define AL_VOCAL_MORPHER_PHONEME_V (28) +#define AL_VOCAL_MORPHER_PHONEME_Z (29) + +#define AL_VOCAL_MORPHER_WAVEFORM_SINUSOID (0) +#define AL_VOCAL_MORPHER_WAVEFORM_TRIANGLE (1) +#define AL_VOCAL_MORPHER_WAVEFORM_SAWTOOTH (2) + +#define AL_VOCAL_MORPHER_MIN_WAVEFORM (0) +#define AL_VOCAL_MORPHER_MAX_WAVEFORM (2) +#define AL_VOCAL_MORPHER_DEFAULT_WAVEFORM (0) + +#define AL_VOCAL_MORPHER_MIN_RATE (0.0f) +#define AL_VOCAL_MORPHER_MAX_RATE (10.0f) +#define AL_VOCAL_MORPHER_DEFAULT_RATE (1.41f) + +/* Pitch shifter effect */ +#define AL_PITCH_SHIFTER_MIN_COARSE_TUNE (-12) +#define AL_PITCH_SHIFTER_MAX_COARSE_TUNE (12) +#define AL_PITCH_SHIFTER_DEFAULT_COARSE_TUNE (12) + +#define AL_PITCH_SHIFTER_MIN_FINE_TUNE (-50) +#define AL_PITCH_SHIFTER_MAX_FINE_TUNE (50) +#define AL_PITCH_SHIFTER_DEFAULT_FINE_TUNE (0) + +/* Ring modulator effect */ +#define AL_RING_MODULATOR_MIN_FREQUENCY (0.0f) +#define AL_RING_MODULATOR_MAX_FREQUENCY (8000.0f) +#define AL_RING_MODULATOR_DEFAULT_FREQUENCY (440.0f) + +#define AL_RING_MODULATOR_MIN_HIGHPASS_CUTOFF (0.0f) +#define AL_RING_MODULATOR_MAX_HIGHPASS_CUTOFF (24000.0f) +#define AL_RING_MODULATOR_DEFAULT_HIGHPASS_CUTOFF (800.0f) + +#define AL_RING_MODULATOR_SINUSOID (0) +#define AL_RING_MODULATOR_SAWTOOTH (1) +#define AL_RING_MODULATOR_SQUARE (2) + +#define AL_RING_MODULATOR_MIN_WAVEFORM (0) +#define AL_RING_MODULATOR_MAX_WAVEFORM (2) +#define AL_RING_MODULATOR_DEFAULT_WAVEFORM (0) + +/* Autowah effect */ +#define AL_AUTOWAH_MIN_ATTACK_TIME (0.0001f) +#define AL_AUTOWAH_MAX_ATTACK_TIME (1.0f) +#define AL_AUTOWAH_DEFAULT_ATTACK_TIME (0.06f) + +#define AL_AUTOWAH_MIN_RELEASE_TIME (0.0001f) +#define AL_AUTOWAH_MAX_RELEASE_TIME (1.0f) +#define AL_AUTOWAH_DEFAULT_RELEASE_TIME (0.06f) + +#define AL_AUTOWAH_MIN_RESONANCE (2.0f) +#define AL_AUTOWAH_MAX_RESONANCE (1000.0f) +#define AL_AUTOWAH_DEFAULT_RESONANCE (1000.0f) + +#define AL_AUTOWAH_MIN_PEAK_GAIN (0.00003f) +#define AL_AUTOWAH_MAX_PEAK_GAIN (31621.0f) +#define AL_AUTOWAH_DEFAULT_PEAK_GAIN (11.22f) + +/* Compressor effect */ +#define AL_COMPRESSOR_MIN_ONOFF (0) +#define AL_COMPRESSOR_MAX_ONOFF (1) +#define AL_COMPRESSOR_DEFAULT_ONOFF (1) + +/* Equalizer effect */ +#define AL_EQUALIZER_MIN_LOW_GAIN (0.126f) +#define AL_EQUALIZER_MAX_LOW_GAIN (7.943f) +#define AL_EQUALIZER_DEFAULT_LOW_GAIN (1.0f) + +#define AL_EQUALIZER_MIN_LOW_CUTOFF (50.0f) +#define AL_EQUALIZER_MAX_LOW_CUTOFF (800.0f) +#define AL_EQUALIZER_DEFAULT_LOW_CUTOFF (200.0f) + +#define AL_EQUALIZER_MIN_MID1_GAIN (0.126f) +#define AL_EQUALIZER_MAX_MID1_GAIN (7.943f) +#define AL_EQUALIZER_DEFAULT_MID1_GAIN (1.0f) + +#define AL_EQUALIZER_MIN_MID1_CENTER (200.0f) +#define AL_EQUALIZER_MAX_MID1_CENTER (3000.0f) +#define AL_EQUALIZER_DEFAULT_MID1_CENTER (500.0f) + +#define AL_EQUALIZER_MIN_MID1_WIDTH (0.01f) +#define AL_EQUALIZER_MAX_MID1_WIDTH (1.0f) +#define AL_EQUALIZER_DEFAULT_MID1_WIDTH (1.0f) + +#define AL_EQUALIZER_MIN_MID2_GAIN (0.126f) +#define AL_EQUALIZER_MAX_MID2_GAIN (7.943f) +#define AL_EQUALIZER_DEFAULT_MID2_GAIN (1.0f) + +#define AL_EQUALIZER_MIN_MID2_CENTER (1000.0f) +#define AL_EQUALIZER_MAX_MID2_CENTER (8000.0f) +#define AL_EQUALIZER_DEFAULT_MID2_CENTER (3000.0f) + +#define AL_EQUALIZER_MIN_MID2_WIDTH (0.01f) +#define AL_EQUALIZER_MAX_MID2_WIDTH (1.0f) +#define AL_EQUALIZER_DEFAULT_MID2_WIDTH (1.0f) + +#define AL_EQUALIZER_MIN_HIGH_GAIN (0.126f) +#define AL_EQUALIZER_MAX_HIGH_GAIN (7.943f) +#define AL_EQUALIZER_DEFAULT_HIGH_GAIN (1.0f) + +#define AL_EQUALIZER_MIN_HIGH_CUTOFF (4000.0f) +#define AL_EQUALIZER_MAX_HIGH_CUTOFF (16000.0f) +#define AL_EQUALIZER_DEFAULT_HIGH_CUTOFF (6000.0f) + + +/* Source parameter value ranges and defaults. */ +#define AL_MIN_AIR_ABSORPTION_FACTOR (0.0f) +#define AL_MAX_AIR_ABSORPTION_FACTOR (10.0f) +#define AL_DEFAULT_AIR_ABSORPTION_FACTOR (0.0f) + +#define AL_MIN_ROOM_ROLLOFF_FACTOR (0.0f) +#define AL_MAX_ROOM_ROLLOFF_FACTOR (10.0f) +#define AL_DEFAULT_ROOM_ROLLOFF_FACTOR (0.0f) + +#define AL_MIN_CONE_OUTER_GAINHF (0.0f) +#define AL_MAX_CONE_OUTER_GAINHF (1.0f) +#define AL_DEFAULT_CONE_OUTER_GAINHF (1.0f) + +#define AL_MIN_DIRECT_FILTER_GAINHF_AUTO AL_FALSE +#define AL_MAX_DIRECT_FILTER_GAINHF_AUTO AL_TRUE +#define AL_DEFAULT_DIRECT_FILTER_GAINHF_AUTO AL_TRUE + +#define AL_MIN_AUXILIARY_SEND_FILTER_GAIN_AUTO AL_FALSE +#define AL_MAX_AUXILIARY_SEND_FILTER_GAIN_AUTO AL_TRUE +#define AL_DEFAULT_AUXILIARY_SEND_FILTER_GAIN_AUTO AL_TRUE + +#define AL_MIN_AUXILIARY_SEND_FILTER_GAINHF_AUTO AL_FALSE +#define AL_MAX_AUXILIARY_SEND_FILTER_GAINHF_AUTO AL_TRUE +#define AL_DEFAULT_AUXILIARY_SEND_FILTER_GAINHF_AUTO AL_TRUE + + +/* Listener parameter value ranges and defaults. */ +#define AL_MIN_METERS_PER_UNIT FLT_MIN +#define AL_MAX_METERS_PER_UNIT FLT_MAX +#define AL_DEFAULT_METERS_PER_UNIT (1.0f) + + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* AL_EFX_H */ diff --git a/3rdparty/iaxclient-2/lib/CMakeLists.txt b/3rdparty/iaxclient-2/lib/CMakeLists.txt new file mode 100644 index 0000000..6df08a7 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/CMakeLists.txt @@ -0,0 +1,147 @@ +cmake_minimum_required(VERSION 2.8) + +include_directories("gsm/inc/") +include_directories("libiax2/src/") +include_directories("libspeex/include/") +include_directories("portmixer/px_common/") +set(ENABLE_SPEEX 1) + +set(IAXCLIENT_BASE_SOURCES + audio_encode.c + audio_file.c + codec_alaw.c + codec_gsm.c + codec_ulaw.c + iaxclient_lib.c + #audio_openal.c + #audio_portaudio.c + audio_alsa.c +) + +set(LIBIAX2_SOURCES + libiax2/src/iax.c + libiax2/src/iax2-parser.c + libiax2/src/jitterbuf.c + libiax2/src/md5.c +) + +set(GSM_SOURCES + gsm/src/add.c + gsm/src/code.c + gsm/src/debug.c + gsm/src/decode.c + gsm/src/gsm_create.c + gsm/src/gsm_decode.c + gsm/src/gsm_destroy.c + gsm/src/gsm_encode.c + gsm/src/gsm_explode.c + gsm/src/gsm_implode.c + gsm/src/gsm_option.c + gsm/src/gsm_print.c + gsm/src/long_term.c + gsm/src/lpc.c + gsm/src/preprocess.c + gsm/src/rpe.c + gsm/src/short_term.c + gsm/src/table.c +) + +if (WIN32) + list(APPEND IAXCLIENT_BASE_SOURCES + winfuncs.c) +else() + list(APPEND IAXCLIENT_BASE_SOURCES + unixfuncs.c) +endif(WIN32) + +if (ENABLE_SPEEX) + list(APPEND IAXCLIENT_BASE_SOURCES codec_speex.c) + + if (SYSTEM_SPEEX) + set(Speex_FIND_REQUIRED TRUE) + set(Speexdsp_FIND_REQUIRED TRUE) + find_package(Speex) + find_package(Speexdsp) + endif(SYSTEM_SPEEX) + + if (SPEEX_FOUND AND SPEEXDSP_FOUND) + include_directories(${SPEEX_INCLUDE_DIR} ${SPEEXDSP_INCLUDE_DIR}) + message(STATUS "Using speex includes at: ${SPEEX_INCLUDE_DIR}") + message(STATUS "Using speex libraries: ${SPEEX_LIBRARIES}") + message(STATUS "Using speex extended library includes at: ${SPEEXDSP_INCLUDE_DIR}") + message(STATUS "Using speex extended library libraries: ${SPEEXDSP_LIBRARIES}") + else(SPEEX_FOUND AND SPEEXDSP_FOUND) + set(SPEEX_SOURCES + libspeex/bits.c + libspeex/cb_search.c + libspeex/exc_10_16_table.c + libspeex/exc_10_32_table.c + libspeex/exc_20_32_table.c + libspeex/exc_5_256_table.c + libspeex/exc_5_64_table.c + libspeex/exc_8_128_table.c + libspeex/filters.c + libspeex/gain_table.c + libspeex/gain_table_lbr.c + libspeex/hexc_10_32_table.c + libspeex/hexc_table.c + libspeex/high_lsp_tables.c + libspeex/jitter.c + libspeex/lbr_48k_tables.c + libspeex/lpc.c + libspeex/lsp.c + libspeex/lsp_tables_nb.c + libspeex/ltp.c + libspeex/math_approx.c + libspeex/mdf.c + libspeex/medfilter.c + libspeex/misc.c + libspeex/modes.c + libspeex/nb_celp.c + libspeex/preprocess.c + libspeex/quant_lsp.c + libspeex/sb_celp.c + libspeex/smallft.c + libspeex/speex.c + libspeex/speex_callbacks.c + libspeex/speex_header.c + libspeex/stereo.c + libspeex/vbr.c + libspeex/vq.c + ) + + include_directories(${PROJECT_SOURCE_DIR}/3rdparty/iaxclient/lib/libspeex/include) + endif(SPEEX_FOUND AND SPEEXDSP_FOUND) +endif(ENABLE_SPEEX) + +if (APPLE) + add_definitions(-DMACOSX) +endif(APPLE) + +list(APPEND IAXCLIENT_BASE_SOURCES spandsp/plc.c) + +add_definitions(-DLIBIAX) + +# for GSM +add_definitions(-DHAS_STRING_H -DHAS_STDLIB_H) +add_definitions(-DCODEC_GSM) + + +include_directories(${PROJECT_SOURCE_DIR}) +include_directories(${PROJECT_SOURCE_DIR}/libiax2/src) +include_directories(${PROJECT_SOURCE_DIR}/gsm/inc) + + +add_library(iaxclient_lib STATIC + ${IAXCLIENT_BASE_SOURCES} + ${GSM_SOURCES} + ${SPEEX_SOURCES} + ${LIBIAX2_SOURCES}) + +if (WIN32) + target_link_libraries(iaxclient_lib ${CMAKE_THREAD_LIBS_INIT} + ${SPEEX_LIBRARIES} ${SPEEXDSP_LIBRARIES} ${GSM_LIBRARIES} Ws2_32 OpenAl32) +else() + target_link_libraries(iaxclient_lib ${CMAKE_THREAD_LIBS_INIT} + ${SPEEX_LIBRARIES} ${SPEEXDSP_LIBRARIES} ${GSM_LIBRARIES} ) +endif(WIN32) diff --git a/3rdparty/iaxclient-2/lib/TODO b/3rdparty/iaxclient-2/lib/TODO new file mode 100644 index 0000000..efdcd9f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/TODO @@ -0,0 +1,101 @@ +TODO items: + + +1) Audio driver work: + Properly abstract audio drivers (currently, we use only + portaudio, but we may also want to support others. + The most likely candidate here would be zaptel devices. + + Instead of the "switch" statements in the code, define an audio + driver structure, with + + - function pointers for actual driver entry points. + initialization: (scans available devices, sets up data + structures) + destruction: (stops everything, cleans up) + "start": starts audio for a particular call? + "stop": stops audio for a particular call? + "playsound": plays a particular sound: can be used for + incoming call notification, ringback, dialtone etc? + "select": select input and output devices to use? + [maybe extend this for zap devices to have "ring", etc + functions?] + + + - Common audio driver data members: + a) perhaps an array of devices the driver has found, + with for each device, a device name, an + indication of whether this device is the default + input or output, and whether this device + supports input, output, or both. + + For portaudio, we probably want to switch to the "standard" + portaudio callback interface, and away from pablio, which isn't + really robust enough for our needs once we do this stuff. + + + +2) Codecs: (I think that someone is working on this) + + Currently, the library assumes that all calls will be GSM only, + and further assumes that all frames will be 20ms. It can + control the frame size (within reason) for frames it sends out, + but should deal gracefully with incoming frames that aren't + 20ms. + + Codecs should probably be implemented via a similar set of + structure abstractions as audio drivers, above. They also need + to handle incoming packets which may switch formats abruptly(?). + +DONE (or, at least, mostly done): +============================================================== +Call handling + currently, the library really only supports one call, and not + very well. It should have a collection of calls (either an + array, or a linked list), and keep track of the current state of + each call. + + An array might be easiest to manage, and would map well to a + softphone client. We would then just refer to calls by their + index, and a GUI client might present these like call + appearances on their display. + + Incoming calls might come in on the first free call appearance, + and outgoing calls by default would do the same. + + The state of each call might be similar to phonecore + (incoming_incomplete, incoming, outgoing_incomplete, outgoing), + but we'd also have to keep track of which call, if any, we + currenly have "selected" -- i.e. which one we should connect to + the audio system. + + We'd need to send events to the client whenever a call changed + "state" in any way. + + We can make the number of calls in the array defined at runtime + when the library is initialized. A very simple client like + testcall would just ask for a single call, so it wouldn't have + to worry about a lot of this. + +Events: + We might want to consolidate the (currently three) callbacks + that the library makes to clients, into a single callback, that + passes back a structure with event info. I was thinking of a + structure with an event type, and then a union of different + structures depending on the event type. + + The only thing is that we might want to decide whether or not, + or how clients will "register" for different event types, even + if they're handled through the same callback mechanism. + + Ideally, the library would handle all of the events itself, via + some "default" handlers. (I.e. for messages, it might just print + them to stdout or stderr. For incoming calls, it might accept + them by default). + + So, the choices then are whether the client should register for + individual events, or perhaps it can just decline events as they + happen, and then the library could handle them. + + + diff --git a/3rdparty/iaxclient-2/lib/audio_alsa.c b/3rdparty/iaxclient-2/lib/audio_alsa.c new file mode 100644 index 0000000..600fe85 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_alsa.c @@ -0,0 +1,277 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2006 Panfilov Dmitry + * + * Contributors: + * Panfilov Dmitry + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + * + */ + +#include "iaxclient_lib.h" +#include + +static snd_pcm_t *stream_out; +static snd_pcm_t *stream_in; + +#define FRAMES_PER_BUFFER 80 /* 80 frames == 10ms */ + + +static int alsa_play_sound(struct iaxc_sound *inSound, int ring) { + return 0; +} + +int alsa_stop_sound(int soundID) { + return 0; +} + + +int alsa_start (struct iaxc_audio_driver *d ) { + return 0; +} + +int alsa_stop (struct iaxc_audio_driver *d ) { + return 0; +} + +void alsa_shutdown_audio() +{ + return; +} + + +int alsa_input(struct iaxc_audio_driver *d, void *samples, int *nSamples) { + + /* we don't return partial buffers */ + long r; + long byteread=*nSamples; + static int h; + *nSamples=0; + snd_pcm_start(stream_in); + if(h==1) { h=0; return 0;} + do{ + r = snd_pcm_readi(stream_in, samples, byteread); + if (r == -EAGAIN){ + continue; + } + if (r == - EPIPE) { + snd_pcm_prepare(stream_in); + continue; + } + samples += (r * 2); + byteread -= r; + *nSamples += r; + }while(r >=0 && byteread >0); + h=1; + return 0; +} + +int alsa_output(struct iaxc_audio_driver *d, void *samples, int nSamples) { + + long r; + snd_pcm_start(stream_out); + while (nSamples > 0) { + r = snd_pcm_writei(stream_out, samples, nSamples); + if (r == -EAGAIN){ + continue; + } + if (r == - EPIPE) { + snd_pcm_prepare(stream_out); + continue; + } + if (r < 0) { + fprintf(stderr, "r=%d\n",r); + } + samples += r * 2; + nSamples -= r; + } + return 0; +} + +int alsa_select_devices (struct iaxc_audio_driver *d, int input, int output, int ring) { + return 0; +} + +int alsa_selected_devices (struct iaxc_audio_driver *d, int *input, int *output, int *ring) { + *input = 0; + *output = 0; + *ring = 0; + return 0; +} + +int alsa_destroy (struct iaxc_audio_driver *d ) +{ + /* TODO: something should happen here */ + return 0; +} + +double alsa_input_level_get(struct iaxc_audio_driver *d){ + return -1; +} + +double alsa_output_level_get(struct iaxc_audio_driver *d){ + return -1; +} + +int alsa_input_level_set(struct iaxc_audio_driver *d, double level){ + return -1; +} + +int alsa_output_level_set(struct iaxc_audio_driver *d, double level){ + return -1; +} + + +/* initialize audio driver */ +int alsa_initialize (struct iaxc_audio_driver *d ,int sample_rate) { + int i; + int err; + short buf[128]; + snd_pcm_hw_params_t *hw_params; + snd_pcm_sw_params_t *sw_params; + + if ((err = snd_pcm_open (&stream_out, "default", SND_PCM_STREAM_PLAYBACK, 0)) < 0) { + fprintf (stderr, "cannot open audio device default (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_malloc (&hw_params)) < 0) { + fprintf (stderr, "cannot allocate hardware parameter structure (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_any (stream_out, hw_params)) < 0) { + fprintf (stderr, "cannot initialize hardware parameter structure (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_access (stream_out, hw_params, SND_PCM_ACCESS_RW_INTERLEAVED)) < 0) { + fprintf (stderr, "cannot set access type (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_format (stream_out, hw_params, SND_PCM_FORMAT_S16_LE)) < 0) { + fprintf (stderr, "cannot set sample format (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_rate (stream_out, hw_params, sample_rate, 0)) < 0) { + fprintf (stderr, "cannot set sample rate (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_channels (stream_out, hw_params, 1)) < 0) { + fprintf (stderr, "cannot set channel count (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params (stream_out, hw_params)) < 0) { + fprintf (stderr, "cannot set parameters (%s)\n", + snd_strerror (err)); + exit (1); + } + + snd_pcm_sw_params_malloc(&sw_params); + + err = snd_pcm_sw_params_current(stream_out, sw_params); + if (err < 0) { + printf("Unable to determine current swparams for playback: %s\n", snd_strerror(err)); + return err; + } + err = snd_pcm_sw_params_set_start_threshold(stream_out, sw_params, 80); + if (err < 0) { + fprintf(stderr, "Unable to set start threshold mode for playback: %s\n", snd_strerror(err)); + return err; + } + err = snd_pcm_sw_params(stream_out, sw_params); + if (err < 0) { + fprintf(stderr, "Unable to set sw params for playback: %s\n", snd_strerror(err)); + return err; + } + + if ((err = snd_pcm_open (&stream_in, "default", SND_PCM_STREAM_CAPTURE, 0)) < 0) { + fprintf (stderr, "cannot open audio device default (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_any (stream_in, hw_params)) < 0) { + fprintf (stderr, "cannot initialize hardware parameter structure (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_access (stream_in, hw_params, SND_PCM_ACCESS_RW_INTERLEAVED)) < 0) { + fprintf (stderr, "cannot set access type (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_format (stream_in, hw_params, SND_PCM_FORMAT_S16_LE)) < 0) { + fprintf (stderr, "cannot set sample format (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_rate (stream_in, hw_params, sample_rate, 0)) < 0) { + fprintf (stderr, "cannot set sample rate (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params_set_channels (stream_in, hw_params, 1)) < 0) { + fprintf (stderr, "cannot set channel count (%s)\n", + snd_strerror (err)); + exit (1); + } + if ((err = snd_pcm_hw_params (stream_in, hw_params)) < 0) { + fprintf (stderr, "cannot set parameters (%s)\n", + snd_strerror (err)); + exit (1); + } + + err = snd_pcm_sw_params_current(stream_in, sw_params); + if (err < 0) { + printf("Unable to determine current swparams for playback: %s\n", snd_strerror(err)); + return err; + } + err = snd_pcm_sw_params_set_start_threshold(stream_in, sw_params, 80); + if (err < 0) { + fprintf(stderr, "Unable to set start threshold mode for playback: %s\n", snd_strerror(err)); + return err; + } + err = snd_pcm_sw_params(stream_in, sw_params); + if (err < 0) { + fprintf(stderr, "Unable to set sw params for playback: %s\n", snd_strerror(err)); + return err; + } + + + if ((err = snd_pcm_prepare (stream_in)) < 0) { + fprintf (stderr, "cannot prepare audio interface for use (%s)\n", + snd_strerror (err)); + exit (1); + } + + if ((err = snd_pcm_prepare (stream_out)) < 0) { + fprintf (stderr, "cannot prepare audio interface for use (%s)\n", + snd_strerror (err)); + exit (1); + } + + d->initialize = alsa_initialize; + d->destroy = alsa_destroy; + d->select_devices = alsa_select_devices; + d->selected_devices = alsa_selected_devices; + d->start = alsa_start; + d->stop = alsa_stop; + d->output = alsa_output; + d->input = alsa_input; + d->input_level_get = alsa_input_level_get; + d->input_level_set = alsa_input_level_set; + d->output_level_get = alsa_output_level_get; + d->output_level_set = alsa_output_level_set; + d->play_sound = alsa_play_sound; + d->stop_sound = alsa_stop_sound; + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/audio_alsa.h b/3rdparty/iaxclient-2/lib/audio_alsa.h new file mode 100644 index 0000000..77f1e84 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_alsa.h @@ -0,0 +1,20 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#ifndef _AUDIO_ALSA_H +#define _AUDIO_ALSA_H + +int alsa_initialize(); + +#endif diff --git a/3rdparty/iaxclient-2/lib/audio_encode.c b/3rdparty/iaxclient-2/lib/audio_encode.c new file mode 100644 index 0000000..1b5a7cb --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_encode.c @@ -0,0 +1,414 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Michael Van Donselaar + * Shawn Lawrence + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "audio_encode.h" +#include "iaxclient_lib.h" +#include "libiax2/src/iax-client.h" +#ifdef CODEC_GSM +#include "codec_gsm.h" +#endif +#include "codec_ulaw.h" +#include "codec_alaw.h" + +#include "codec_speex.h" +#include + +#ifdef CODEC_ILBC +#include "codec_ilbc.h" +#endif + +float iaxci_silence_threshold = AUDIO_ENCODE_SILENCE_DB; + +static float input_level = 0.0f; +static float output_level = 0.0f; + +static SpeexPreprocessState *st = NULL; +static int speex_state_size = 0; +static int speex_state_rate = 0; + +int iaxci_filters = IAXC_FILTER_AGC|IAXC_FILTER_DENOISE|IAXC_FILTER_AAGC|IAXC_FILTER_CN; + +/* use to measure time since last audio was processed */ +static struct timeval timeLastInput ; +static struct timeval timeLastOutput ; + +static struct iaxc_speex_settings speex_settings = +{ + 1, /* decode_enhance */ + -1, /* float quality */ + -1, /* bitrate */ + 0, /* vbr */ + 0, /* abr */ + 3 /* complexity */ +}; + + +static float vol_to_db(float vol) +{ + /* avoid calling log10() on zero which yields inf or + * negative numbers which yield nan */ + if ( vol <= 0.0f ) + return AUDIO_ENCODE_SILENCE_DB; + else + return log10f(vol) * 20.0f; +} + +static int do_level_callback() +{ + static struct timeval last = {0,0}; + struct timeval now; + float input_db; + float output_db; + + now = iax_tvnow(); + + if ( last.tv_sec != 0 && iaxci_usecdiff(&now, &last) < 100000 ) + return 0; + + last = now; + + /* if input has not been processed in the last second, set to silent */ + input_db = iaxci_usecdiff(&now, &timeLastInput) < 1000000 ? + vol_to_db(input_level) : AUDIO_ENCODE_SILENCE_DB; + + /* if output has not been processed in the last second, set to silent */ + output_db = iaxci_usecdiff(&now, &timeLastOutput) < 1000000 ? + vol_to_db(output_level) : AUDIO_ENCODE_SILENCE_DB; + + iaxci_do_levels_callback(input_db, output_db); + + return 0; +} + +static void set_speex_filters() +{ + int i; + + if ( !st ) + return; + + i = 1; /* always make VAD decision */ + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_VAD, &i); + i = (iaxci_filters & IAXC_FILTER_AGC) ? 1 : 0; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_AGC, &i); + i = (iaxci_filters & IAXC_FILTER_DENOISE) ? 1 : 0; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_DENOISE, &i); + + /* + * We can tweak these parameters to play with VAD sensitivity. + * For now, we use the default values since it seems they are a good starting point. + * However, if need be, this is the code that needs to change + */ + i = 35; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_PROB_START, &i); + i = 20; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_PROB_CONTINUE, &i); +} + +static void calculate_level(short *audio, int len, float *level) +{ + int big_sample = 0; + int i; + + for ( i = 0; i < len; i++ ) + { + const int sample = abs(audio[i]); + big_sample = sample > big_sample ? + sample : big_sample; + } + + *level += ((float)big_sample / 32767.0f - *level) / 5.0f; +} + + +static int input_postprocess(void *audio, int len, int rate) +{ + static float lowest_volume = 1.0f; + float volume; + int silent = 0; + + if ( !st || speex_state_size != len || speex_state_rate != rate ) + { + if (st) + speex_preprocess_state_destroy(st); + st = speex_preprocess_state_init(len,rate); + speex_state_size = len; + speex_state_rate = rate; + set_speex_filters(); + } + + calculate_level((short *)audio, len, &input_level); + + /* only preprocess if we're interested in VAD, AGC, or DENOISE */ + if ( (iaxci_filters & (IAXC_FILTER_DENOISE | IAXC_FILTER_AGC)) || + iaxci_silence_threshold > 0.0f ) + silent = !speex_preprocess(st, (spx_int16_t *)audio, NULL); + + /* Analog AGC: Bring speex AGC gain out to mixer, with lots of hysteresis */ + /* use a higher continuation threshold for AAGC than for VAD itself */ + if ( !silent && + iaxci_silence_threshold != 0.0f && + (iaxci_filters & IAXC_FILTER_AGC) && + (iaxci_filters & IAXC_FILTER_AAGC) + ) + { + static int i = 0; + + i++; + + if ( (i & 0x3f) == 0 ) + { + float loudness; +#ifdef SPEEX_PREPROCESS_GET_AGC_LOUDNESS + speex_preprocess_ctl(st, SPEEX_PREPROCESS_GET_AGC_LOUDNESS, &loudness); +#else + loudness = st->loudness2; +#endif + if ( loudness > 8000.0f || loudness < 4000.0f ) + { + const float level = iaxc_input_level_get(); + + if ( loudness > 16000.0f && level > 0.5f ) + { + /* lower quickly if we're really too hot */ + iaxc_input_level_set(level - 0.2f); + } + else if ( loudness > 8000.0f && level >= 0.15f ) + { + /* lower less quickly if we're a bit too hot */ + iaxc_input_level_set(level - 0.1f); + } + else if ( loudness < 4000.0f && level <= 0.9f ) + { + /* raise slowly if we're cold */ + iaxc_input_level_set(level + 0.1f); + } + } + } + } + + /* This is ugly. Basically just don't get volume level if speex thought + * we were silent. Just set it to 0 in that case */ + if ( iaxci_silence_threshold > 0.0f && silent ) + input_level = 0.0f; + + do_level_callback(); + + volume = vol_to_db(input_level); + + if ( volume < lowest_volume ) + lowest_volume = volume; + + if ( iaxci_silence_threshold > 0.0f ) + return silent; + else + return volume < iaxci_silence_threshold; +} + +static int output_postprocess(void *audio, int len) +{ + calculate_level((short *)audio, len, &output_level); + + do_level_callback(); + + return 0; +} + +static struct iaxc_audio_codec *create_codec(int format) +{ + switch (format & IAXC_AUDIO_FORMAT_MASK) + { +#ifdef CODEC_GSM + case IAXC_FORMAT_GSM: + return codec_audio_gsm_new(); +#endif + case IAXC_FORMAT_ULAW: + return codec_audio_ulaw_new(); + case IAXC_FORMAT_ALAW: + return codec_audio_alaw_new(); + case IAXC_FORMAT_SPEEX: + return codec_audio_speex_new(&speex_settings); +#ifdef CODEC_ILBC + case IAXC_FORMAT_ILBC: + return codec_audio_ilbc_new(); +#endif + default: + /* ERROR: codec not supported */ + fprintf(stderr, "ERROR: Codec not supported: %d\n", format); + return NULL; + } +} + +EXPORT void iaxc_set_speex_settings(int decode_enhance, float quality, + int bitrate, int vbr, int abr, int complexity) +{ + speex_settings.decode_enhance = decode_enhance; + speex_settings.quality = quality; + speex_settings.bitrate = bitrate; + speex_settings.vbr = vbr; + speex_settings.abr = abr; + speex_settings.complexity = complexity; +} + +int audio_send_encoded_audio(struct iaxc_call *call, int callNo, void *data, + int format, int samples) +{ + unsigned char outbuf[1024]; + int outsize = 1024; + int silent; + int insize = samples; + + /* update last input timestamp */ + timeLastInput = iax_tvnow(); + + silent = input_postprocess(data, insize, 8000); + + if(silent) + { + if(!call->tx_silent) + { /* send a Comfort Noise Frame */ + call->tx_silent = 1; + if ( iaxci_filters & IAXC_FILTER_CN ) + iax_send_cng(call->session, 10, NULL, 0); + } + return 0; /* poof! no encoding! */ + } + + /* we're going to send voice now */ + call->tx_silent = 0; + + /* destroy encoder if it is incorrect type */ + if(call->encoder && call->encoder->format != format) + { + call->encoder->destroy(call->encoder); + call->encoder = NULL; + } + + /* just break early if there's no format defined: this happens for the + * first couple of frames of new calls */ + if(format == 0) return 0; + + /* create encoder if necessary */ + if(!call->encoder) + { + call->encoder = create_codec(format); + } + + if(!call->encoder) + { + /* ERROR: no codec */ + fprintf(stderr, "ERROR: Codec could not be created: %d\n", format); + return 0; + } + + if(call->encoder->encode(call->encoder, &insize, (short *)data, + &outsize, outbuf)) + { + /* ERROR: codec error */ + fprintf(stderr, "ERROR: encode error: %d\n", format); + return 0; + } + + if(samples-insize == 0) + { + fprintf(stderr, "ERROR encoding (no samples output (samples=%d)\n", samples); + return -1; + } + + // Send the encoded audio data back to the app if required + // TODO: fix the stupid way in which the encoded audio size is returned + if ( iaxc_get_audio_prefs() & IAXC_AUDIO_PREF_RECV_LOCAL_ENCODED ) + iaxci_do_audio_callback(callNo, 0, IAXC_SOURCE_LOCAL, 1, + call->encoder->format & IAXC_AUDIO_FORMAT_MASK, + sizeof(outbuf) - outsize, outbuf); + + if(iax_send_voice(call->session,format, outbuf, + sizeof(outbuf) - outsize, samples-insize) == -1) + { + fprintf(stderr, "Failed to send voice! %s\n", iax_errstr); + return -1; + } + + return 0; +} + +/* decode encoded audio; return the number of bytes decoded + * negative indicates error */ +int audio_decode_audio(struct iaxc_call * call, void * out, void * data, int len, + int format, int * samples) +{ + int insize = len; + int outsize = *samples; + + timeLastOutput = iax_tvnow(); + + if ( format == 0 ) + { + fprintf(stderr, "audio_decode_audio: Format is zero (should't happen)!\n"); + return -1; + } + + /* destroy decoder if it is incorrect type */ + if ( call->decoder && call->decoder->format != format ) + { + call->decoder->destroy(call->decoder); + call->decoder = NULL; + } + + /* create decoder if necessary */ + if ( !call->decoder ) + { + call->decoder = create_codec(format); + } + + if ( !call->decoder ) + { + fprintf(stderr, "ERROR: Codec could not be created: %d\n", + format); + return -1; + } + + if ( call->decoder->decode(call->decoder, + &insize, (unsigned char *)data, + &outsize, (short *)out) ) + { + fprintf(stderr, "ERROR: decode error: %d\n", format); + return -1; + } + + output_postprocess(out, *samples - outsize); + + *samples = outsize; + return len - insize; +} + +EXPORT int iaxc_get_filters(void) +{ + return iaxci_filters; +} + +EXPORT void iaxc_set_filters(int filters) +{ + iaxci_filters = filters; + set_speex_filters(); +} + +EXPORT void iaxc_set_silence_threshold(float thr) +{ + iaxci_silence_threshold = thr; + set_speex_filters(); +} + diff --git a/3rdparty/iaxclient-2/lib/audio_encode.h b/3rdparty/iaxclient-2/lib/audio_encode.h new file mode 100644 index 0000000..d3dc561 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_encode.h @@ -0,0 +1,33 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#ifndef _AUDIO_ENCODE_H +#define _AUDIO_ENCODE_H + +/* Minimum dB possible in the iaxclient world. This level + * is intended to represent silence. + */ +#define AUDIO_ENCODE_SILENCE_DB -99.0f + +struct iaxc_call; +struct iax_event; + +int audio_send_encoded_audio(struct iaxc_call * most_recent_answer, int callNo, + void * data, int iEncodeType, int samples); + +int audio_decode_audio(struct iaxc_call * p, void * out, void * data, int len, + int iEncodeType, int * samples); + +#endif + diff --git a/3rdparty/iaxclient-2/lib/audio_file.c b/3rdparty/iaxclient-2/lib/audio_file.c new file mode 100644 index 0000000..90c5e04 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_file.c @@ -0,0 +1,130 @@ +/* + * iaxclient_lib: An Inter-Asterisk eXchange communication library + * + * Module: audio_file + * Purpose: Audio code to read/write to files + * based on audio_portaudio, originally Developed by: Shawn Lawrence, Terrace Communications Inc. + * Developed by: Steve Kann + * Creation Date: October 30, 2003 + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + * + * IAX library Copyright (c) 2001 Linux Support Services + * IAXlib is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + * + * This library uses the PortAudio Portable Audio Library + * For more information see: http://www.portaudio.com + * PortAudio Copyright (c) 1999-2000 Ross Bencina and Phil Burk + * + */ + +#include "iaxclient_lib.h" + +typedef short SAMPLE; + +static FILE *inFile=NULL, *outFile=NULL; + +#define FRAMES_PER_BUFFER 80 /* 80 frames == 10ms */ + + +static int file_play_sound(struct iaxc_sound *inSound, int ring) { + return 0; +} + +static int file_stop_sound(int soundID) { + return 0; +} + + +static int file_start (struct iaxc_audio_driver *d ) { + return 0; +} + +static int file_stop (struct iaxc_audio_driver *d ) { + return 0; +} + +/* not used +static void file_shutdown_audio() { + return; +} +*/ + +static int file_input(struct iaxc_audio_driver *d, void *samples, int *nSamples) { + *nSamples = 0; + return 0; +} + +static int file_output(struct iaxc_audio_driver *d, void *samples, int nSamples) { + + if(outFile) { + fwrite(samples, sizeof(SAMPLE), nSamples, outFile); + } + return 0; +} + +static int file_select_devices (struct iaxc_audio_driver *d, int input, int output, int ring) { + return 0; +} + +static int file_selected_devices (struct iaxc_audio_driver *d, int *input, int *output, int *ring) { + *input = 0; + *output = 0; + *ring = 0; + return 0; +} + +static int file_destroy (struct iaxc_audio_driver *d ) +{ + /* TODO: something should happen here */ + return 0; +} + +static float file_input_level_get(struct iaxc_audio_driver *d){ + return -1; +} + +static float file_output_level_get(struct iaxc_audio_driver *d){ + return -1; +} + +static int file_input_level_set(struct iaxc_audio_driver *d, float level){ + return -1; +} + +static int file_output_level_set(struct iaxc_audio_driver *d, float level){ + return -1; +} + +EXPORT int iaxc_set_files(FILE *input, FILE *output) { + inFile = input; + outFile = output; + return 0; +} + + +/* initialize audio driver */ +int file_initialize (struct iaxc_audio_driver *d , int sample_rate) { + + if(sample_rate != 8000 ) return -1; + + /* setup methods */ + d->initialize = file_initialize; + d->destroy = file_destroy; + d->select_devices = file_select_devices; + d->selected_devices = file_selected_devices; + d->start = file_start; + d->stop = file_stop; + d->output = file_output; + d->input = file_input; + d->input_level_get = file_input_level_get; + d->input_level_set = file_input_level_set; + d->output_level_get = file_output_level_get; + d->output_level_set = file_output_level_set; + d->play_sound = file_play_sound; + d->stop_sound = file_stop_sound; + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/audio_file.h b/3rdparty/iaxclient-2/lib/audio_file.h new file mode 100644 index 0000000..51f8008 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_file.h @@ -0,0 +1,18 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003 HorizonLive.com, (c) 2004, Horizon Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ +#ifndef _AUDIO_FILE_H +#define _AUDIO_FILE_H + +int file_initialize(struct iaxc_audio_driver *d , int sample_rate); + +#endif diff --git a/3rdparty/iaxclient-2/lib/audio_openal.c b/3rdparty/iaxclient-2/lib/audio_openal.c new file mode 100644 index 0000000..68d6594 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_openal.c @@ -0,0 +1,323 @@ +#include "iaxclient_lib.h" + +#ifdef __APPLE__ +#include +#include +#elif defined(OPENALSDK) +#include +#include +#else +#include "AL/al.h" +#include "AL/alc.h" +#endif + +struct openal_priv_data +{ + int sample_rate; + int num_buffers; + int buffers_head; + int buffers_tail; + int buffers_free; + ALuint* buffers; + ALCcontext* out_ctx; + ALuint source; + ALCdevice* in_dev; + float input_level; + float output_level; +}; + +static struct iaxc_audio_device device = { + "default", + IAXC_AD_INPUT | IAXC_AD_OUTPUT | IAXC_AD_RING | IAXC_AD_INPUT_DEFAULT | IAXC_AD_OUTPUT_DEFAULT | IAXC_AD_RING_DEFAULT, + 0 +}; + +static int openal_error(const char* function, int err) +{ + fprintf(stderr, "OpenAl function %s failed with code %d\n", function, err); + return -1; +} + +int openal_input(struct iaxc_audio_driver *d, void *samples, int *nSamples) +{ + int err; + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + + ALCint available; + ALCsizei request; + + alcGetIntegerv(priv->in_dev, ALC_CAPTURE_SAMPLES, sizeof(available), &available); + /* do not return less data than caller wanted, iaxclient does not like it */ + request = (available < *nSamples) ? 0 : *nSamples; + if (request > 0) + { + err = alcGetError(priv->in_dev); + alcCaptureSamples(priv->in_dev, samples, request); + err = alcGetError(priv->in_dev); + if (err) + { + openal_error("alcCaptureSamples", err); + *nSamples = 0; + return 1; + } + // software mute, but keep data flowing for sync purposes + if (priv->input_level == 0) + { + memset(samples, 0, 2 * request); + } + } + *nSamples = request; + + return 0; +} + +static void openal_unqueue(struct openal_priv_data* priv) +{ + int i; + ALint err; + ALint processed; + + alGetSourcei(priv->source, AL_BUFFERS_PROCESSED, &processed); + +#ifdef OPENAL_DEBUG + { + ALint queued; + ALint state; + + alGetSourcei(priv->source, AL_BUFFERS_QUEUED, &queued); + alGetSourcei(priv->source, AL_SOURCE_STATE, &state); + + fprintf(stderr, "free: %d processed: %d queued: %d head: %d tail: %d state: %d\n", + priv->buffers_free, processed, queued, priv->buffers_head, priv->buffers_tail, state); + } +#endif + + alGetError(); + for(i = 0; i < processed; i++) + { + alSourceUnqueueBuffers(priv->source, 1, priv->buffers + priv->buffers_tail); + err = alGetError(); + if (err) + { + openal_error("alSourceUnqueueBuffers", err); + break; + } + if (++priv->buffers_tail >= priv->num_buffers) + { + priv->buffers_tail = 0; + } + ++priv->buffers_free; + } +} + +int openal_output(struct iaxc_audio_driver *d, void *samples, int nSamples) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + + openal_unqueue(priv); + /* If we run out of buffers, wait for an arbitrary number to become free */ + if (priv->buffers_free == 0) + { + while(priv->buffers_free < 4) + { + iaxc_millisleep(100); + openal_unqueue(priv); + } + } + + if (priv->buffers_free > 0) + { + ALuint buffer = priv->buffers[priv->buffers_head++]; + if (priv->buffers_head >= priv->num_buffers) + { + priv->buffers_head = 0; + } + + alBufferData(buffer, AL_FORMAT_MONO16, samples, nSamples * 2, priv->sample_rate); + alSourceQueueBuffers(priv->source, 1, &buffer); + --priv->buffers_free; + + /* delay start of output until we have 2 buffers */ + if (priv->buffers_free == priv->num_buffers - 2) + { + ALint state; + + alGetSourcei(priv->source, AL_SOURCE_STATE, &state); + if (state != AL_PLAYING) + { +#ifdef OPENAL_DEBUG + fprintf(stderr, "calling alSourcePlay\n"); +#endif + alSourcePlay(priv->source); + } + } + } else { + fprintf(stderr, "openal_output buffer overflow\n"); + return 1; + } + + return 0; +} + +int openal_select_devices(struct iaxc_audio_driver *d, int input, int output, int ring) +{ + return (input != 0 || output !=0 || ring != 0) ? -1 : 0; +} + +int openal_selected_devices(struct iaxc_audio_driver *d, int *input, int *output, int *ring) +{ + *input = 0; + *output = 0; + *ring = 0; + + return 0; +} + +/* + Apparently iaxclient calls openal_start a gazillion times and doesn't call openal_stop. + So let's just make them no-ops. +*/ +int openal_start(struct iaxc_audio_driver *d) +{ + int iret = 0; + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + if (priv) /* just to stop compiler noise */ + iret = 0; + return iret; +} + +int openal_stop(struct iaxc_audio_driver *d) +{ + int iret = 0; + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + if (priv) /* just to stop compiler noise */ + iret = 0; + return iret; +} + +float openal_input_level_get(struct iaxc_audio_driver *d) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + + return priv->input_level; +} + +float openal_output_level_get(struct iaxc_audio_driver *d) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + + return priv->output_level; +} + +int openal_input_level_set(struct iaxc_audio_driver *d, float level) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + priv->input_level = (level < 0.5) ? 0 : 1; + + return 0; +} + +int openal_output_level_set(struct iaxc_audio_driver *d, float level) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + priv->output_level = level; + alSourcef(priv->source, AL_GAIN, level); + + return 0; +} + +int openal_play_sound(struct iaxc_sound *s, int ring) +{ + return 0; +} + +int openal_stop_sound(int id) +{ + return 0; +} + +int openal_mic_boost_get(struct iaxc_audio_driver *d) +{ + return 0; +} + +int openal_mic_boost_set(struct iaxc_audio_driver *d, int enable) +{ + return 0; +} + +int openal_destroy(struct iaxc_audio_driver *d) +{ + struct openal_priv_data* priv = (struct openal_priv_data*)(d->priv); + + alcCaptureStop(priv->in_dev); + alcCaptureCloseDevice(priv->in_dev); + alDeleteSources(1, &priv->source); + + return 0; +} + +int openal_initialize(struct iaxc_audio_driver *d, int sample_rate) +{ + struct openal_priv_data* priv = malloc(sizeof(struct openal_priv_data)); + int err = alGetError(); + d->priv = priv; + + // First we are looking for output device + priv->out_ctx = alcGetCurrentContext(); + + if( priv->out_ctx == NULL ) { // FGCom standalone only + ALCdevice* out_dev = alcOpenDevice(NULL); + if (out_dev == 0) return openal_error("alcOpenDevice", alGetError()); + + priv->out_ctx = alcCreateContext(out_dev, 0); + if (priv->out_ctx == 0) return openal_error("alcCreateContext", alGetError()); + } + + alcMakeContextCurrent(priv->out_ctx); + if ((err = alGetError())) return openal_error("alcMakeContextCurrent", err); + + // Then we look for input device + priv->in_dev = alcCaptureOpenDevice(NULL, 8000, AL_FORMAT_MONO16, 800); + if (!priv->in_dev) return openal_error("alcCaptureOpenDevice", alGetError()); + if ((err = alGetError())) return openal_error("alcCaptureOpenDevice1", alGetError()); + + alcCaptureStart(priv->in_dev); + if ((err = alGetError())) return openal_error("alcCaptureStart", err); + + priv->sample_rate = sample_rate; + priv->num_buffers = 20; + priv->input_level = 0; + priv->output_level = 1; + priv->buffers_head = 0; + priv->buffers_tail = 0; + priv->buffers_free = priv->num_buffers; + priv->buffers = (ALuint*)malloc(sizeof(ALuint) * priv->num_buffers); + + alGenBuffers(priv->num_buffers, priv->buffers); + if ((err = alGetError())) return openal_error("alGenBuffers", err); + + alGenSources(1, &priv->source); + if ((err = alGetError())) return openal_error("alGenSources", err); + + d->initialize = openal_initialize; + d->destroy = openal_destroy; + d->select_devices = openal_select_devices; + d->selected_devices = openal_selected_devices; + d->start = openal_start; + d->stop = openal_stop; + d->output = openal_output; + d->input = openal_input; + d->input_level_get = openal_input_level_get; + d->input_level_set = openal_input_level_set; + d->output_level_get = openal_output_level_get; + d->output_level_set = openal_output_level_set; + d->mic_boost_get = openal_mic_boost_get; + d->mic_boost_set = openal_mic_boost_set; + d->play_sound = openal_play_sound; + d->stop_sound = openal_stop_sound; + d->nDevices = 1; + d->devices = &device; + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/audio_openal.h b/3rdparty/iaxclient-2/lib/audio_openal.h new file mode 100644 index 0000000..a698235 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_openal.h @@ -0,0 +1,6 @@ +#ifndef _AUDIO_OPENAL_H +#define _AUDIO_OPENAL_H + +int openal_initialize(); + +#endif diff --git a/3rdparty/iaxclient-2/lib/audio_portaudio.c b/3rdparty/iaxclient-2/lib/audio_portaudio.c new file mode 100644 index 0000000..9295b64 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_portaudio.c @@ -0,0 +1,1159 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Michael Van Donselaar + * Shawn Lawrence + * Erik Bunce + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + * + * Module: audio_portaudio + * Purpose: Audio code to provide portaudio driver support for IAX library + * Developed by: Shawn Lawrence, Terrace Communications Inc. + * Creation Date: April 18, 2003 + * + * This library uses the PortAudio Portable Audio Library + * For more information see: http://www.portaudio.com/ + * PortAudio Copyright (c) 1999-2000 Ross Bencina and Phil Burk + * + */ + +#if defined(WIN32) || defined(_WIN32_WCE) +#include +#define strcasecmp _stricmp +#else +#include +#endif + +#include +#include "audio_portaudio.h" +#include "iaxclient_lib.h" +#include "portmixer.h" + +#ifdef USE_MEC2 +#define DO_EC +#include "mec3.h" +static echo_can_state_t *ec; +#endif + +#ifdef SPAN_EC +#define DO_EC +#include "ec/echo.h" +static echo_can_state_t *ec; +#endif + +#if defined(SPEEX_EC) && ! defined (WIN32) +#define DO_EC +#define restrict __restrict +#include "speex/speex_echo.h" +static SpeexEchoState *ec; +#endif + +#define EC_RING_SZ 8192 /* must be pow(2) */ + + +typedef short SAMPLE; + +static PaStream *iStream, *oStream, *aStream; +static PxMixer *iMixer = NULL, *oMixer = NULL; + +static int selectedInput, selectedOutput, selectedRing; + +static int sample_rate = 8000; +static int mixers_initialized; + + +#define MAX_SAMPLE_RATE 48000 +#ifndef MS_PER_FRAME +# define MS_PER_FRAME 40 +#endif +#define SAMPLES_PER_FRAME (MS_PER_FRAME * sample_rate / 1000) + +/* static frame buffer allocation */ +#define MAX_SAMPLES_PER_FRAME (MS_PER_FRAME * MAX_SAMPLE_RATE / 1000) + +/* echo_tail length, in frames must be pow(2) for mec/span ? */ +#define ECHO_TAIL 4096 + +/* RingBuffer Size; Needs to be Pow(2), 1024 = 512 samples = 64ms */ +#ifndef OUTRBSZ +# define OUTRBSZ 32768 +#endif + +/* Input ringbuffer size; this doesn't seem to be as critical, and making it big + * causes issues when we're answering calls, etc., and the audio system is running + * but not being drained */ +#ifndef INRBSZ +# define INRBSZ 2048 +#endif + +/* TUNING: The following constants may help in tuning for situations + * where you are getting audio-level under/overruns. + * + * If you are running iaxclient on a system where you cannot get + * low-latency scheduling, you may need to increase these. This tends + * to be an issue on non-MacOSX unix systems, when you are not running + * as root, and cannot ask the OS for higher priority. + * + * RBOUTTARGET: This a target size of the output ringbuffer, in milliseconds, + * where audio for your speakers goes after being decoded and mixed, and + * before the audio callback asks for it. It can get larger than this + * (up to OUTRBSZ, above), but when it does, for a bit, we will start + * dropping some frames. For no drops at all, this needs to be set to + * contain the number of samples in your largest scheduling gap + * + * PA_NUMBUFFERS: This is the number of buffers that the low-level + * operating system driver will use, for buffering our output (and also + * our input) between the soundcard and portaudio. This should also be + * set to the maximum scheduling delay. Some drivers, though, will + * callback _into_ portaudio with a higher priority, so this doesn't + * necessarily need to be as big as RBOUTMAXSZ, although on linux, it + * does. The default is to leave this up to portaudio.. + */ + +/* 80ms if average outRing length is more than this many bytes, start dropping */ +#ifndef RBOUTTARGET +# define RBOUTTARGET (80) +#endif + +/* size in bytes of ringbuffer target */ +#define RBOUTTARGET_BYTES (RBOUTTARGET * (sample_rate / 1000) * sizeof(SAMPLE)) + +static char inRingBuf[INRBSZ], outRingBuf[OUTRBSZ]; +static PaUtilRingBuffer inRing, outRing; + +static int outRingLenAvg; + +static int oneStream; +static int auxStream; +static int virtualMonoIn; +static int virtualMonoOut; +static int virtualMonoRing; + +static int running; + +static struct iaxc_sound *sounds; +static int nextSoundId = 1; + +static MUTEX sound_lock; + +/* forward declarations */ +static int pa_start (struct iaxc_audio_driver *d ); +static void handle_paerror(PaError err, char * where); +static int pa_input_level_set(struct iaxc_audio_driver *d, float level); +static float pa_input_level_get(struct iaxc_audio_driver *d); + +/* scan devices and stash pointers to dev structures. + * But, these structures only remain valid while Pa is initialized, + * which, with pablio, is only while it's running! + * Also, storing these things in two separate arrays loses the actual + * PaDeviceID's associated with devices (since their index in these + * input/output arrays isn't the same as their index in the combined + * array */ +static int scan_devices(struct iaxc_audio_driver *d) +{ + int nDevices; + int i; + + d->nDevices = nDevices = Pa_GetDeviceCount(); + d->devices = (struct iaxc_audio_device *) + malloc(nDevices * sizeof(struct iaxc_audio_device)); + + for ( i=0; i < nDevices; i++ ) + { + const PaDeviceInfo *pa; + struct iaxc_audio_device *dev; + + pa=Pa_GetDeviceInfo(i); + dev = &(d->devices[i]); + + if ( pa ) //frik: under Terminal Services this is NULL + { + dev->name = (char *)pa->name; + dev->devID = i; + dev->capabilities = 0; + + if ( pa->maxInputChannels > 0 ) + dev->capabilities |= IAXC_AD_INPUT; + + if ( pa->maxOutputChannels > 0 ) + { + dev->capabilities |= IAXC_AD_OUTPUT; + dev->capabilities |= IAXC_AD_RING; + } + + if ( i == Pa_GetDefaultInputDevice() ) + dev->capabilities |= IAXC_AD_INPUT_DEFAULT; + + if ( i == Pa_GetDefaultOutputDevice() ) + { + dev->capabilities |= IAXC_AD_OUTPUT_DEFAULT; + dev->capabilities |= IAXC_AD_RING_DEFAULT; + } + } + else //frik: under Terminal Services + { + dev->name = "Not usable device"; + dev->devID = i; + dev->capabilities = 0; + } + } + + return 0; +} + +static void mono2stereo(SAMPLE *out, SAMPLE *in, int nSamples) +{ + int i; + //fprintf(stderr, "mono2stereo: %d samples\n", nSamples); + for ( i=0; i < nSamples; i++ ) + { + *(out++) = *in; + *(out++) = *(in++); + } +} + +static void stereo2mono(SAMPLE *out, SAMPLE *in, int nSamples) +{ + int i; + //fprintf(stderr, "stereo2mono: %d samples\n", nSamples); + for ( i=0; i < nSamples; i++ ) + { + *(out) = *(in++); + out++; in++; + //*(out++) += *(in++); + } +} + +static void mix_slin(short *dst, short *src, int samples, int virtualMono) +{ + int i=0,val=0; + for ( i=0; i < samples; i++ ) + { + if ( virtualMono ) + val = ((short *)dst)[2*i] + ((short *)src)[i]; + else + val = ((short *)dst)[i] + ((short *)src)[i]; + + if ( val > 0x7fff ) + { + val = 0x7fff-1; + } else if (val < -0x7fff) + { + val = -0x7fff+1; + } + + if ( virtualMono ) + { + dst[2*i] = val; + dst[2*i+1] = val; + } else + { + dst[i] = val; + } + + } +} + +static int pa_mix_sounds (void *outputBuffer, unsigned long frames, int channel, int virtualMono) +{ + struct iaxc_sound *s; + struct iaxc_sound **sp; + unsigned long outpos; + + MUTEXLOCK(&sound_lock); + /* mix each sound into the outputBuffer */ + sp = &sounds; + while ( sp && *sp ) + { + s = *sp; + outpos = 0; + + if ( s->channel == channel ) + { + /* loop over the sound until we've played it enough + * times, or we've filled the outputBuffer */ + for(;;) + { + int n; + + if ( outpos == frames ) + break; /* we've filled the buffer */ + if ( s->pos == s->len ) + { + if ( s->repeat == 0 ) + { + // XXX free the sound + // structure, and maybe the + // buffer! + (*sp) = s->next; + if(s->malloced) + free(s->data); + free(s); + break; + } + s->pos = 0; + s->repeat--; + } + + /* how many frames do we add in this loop? */ + n = (frames - outpos) < (unsigned long)(s->len - s->pos) ? + (frames - outpos) : + (unsigned long)(s->len - s->pos); + + /* mix in the frames */ + mix_slin((short *)outputBuffer + outpos, + s->data+s->pos, n, virtualMono); + + s->pos += n; + outpos += n; + } + } + if ( *sp ) /* don't advance if we removed this member */ + sp = &((*sp)->next); + } + MUTEXUNLOCK(&sound_lock); + return 0; +} + +static int pa_play_sound(struct iaxc_sound *inSound, int ring) +{ + struct iaxc_sound *sound; + + sound = (struct iaxc_sound *)malloc(sizeof(struct iaxc_sound)); + if ( !sound ) + return 1; + + *sound = *inSound; + + MUTEXLOCK(&sound_lock); + sound->channel = ring; + sound->id = nextSoundId++; + sound->pos = 0; + + sound->next = sounds; + sounds = sound; + MUTEXUNLOCK(&sound_lock); + + if ( !running ) + pa_start(NULL); /* XXX fixme: start/stop semantics */ + + return sound->id; +} + +static int pa_stop_sound(int soundID) +{ + struct iaxc_sound **sp; + int retval = 1; /* not found */ + + MUTEXLOCK(&sound_lock); + for ( sp = &sounds; *sp; (*sp) = (*sp)->next ) + { + struct iaxc_sound *s = *sp; + if ( s->id == soundID ) + { + if ( s->malloced ) + free(s->data); + /* remove from list */ + (*sp) = s->next; + free(s); + + retval= 0; /* found */ + break; + } + } + MUTEXUNLOCK(&sound_lock); + + return retval; /* found? */ +} + +static void iaxc_echo_can(short *inputBuffer, short *outputBuffer, int n) +{ + static PaUtilRingBuffer ecOutRing; + static char outRingBuf[EC_RING_SZ]; + static long bias = 0; + short delayedBuf[1024]; + int i; + + /* remove bias -- whether ec is on or not. */ + for ( i = 0; i < n; i++ ) + { + bias += ((((long int) inputBuffer[i]) << 15) - bias) >> 14; + inputBuffer[i] -= (short int) (bias >> 15); + } + + /* if ec is off, clear ec state -- this way, we start fresh if/when + * it's turned back on. */ + if ( !(iaxc_get_filters() & IAXC_FILTER_ECHO) ) + { +#if defined(DO_EC) + if ( ec ) + { +#if defined(USE_MEC2) || defined(SPAN_EC) + echo_can_free(ec); + ec = NULL; +#elif defined(SPEEX_EC) + speex_echo_state_destroy(ec); + ec = NULL; +#endif + } +#endif + + return; + } + + /* we want echo cancellation */ + +#if defined(DO_EC) + if ( !ec ) + { + PaUtil_InitializeRingBuffer(&ecOutRing, 1, EC_RING_SZ, &outRingBuf); +#if defined(USE_MEC2) || defined(SPAN_EC) + ec = echo_can_create(ECHO_TAIL, 0); +#elif defined(SPEEX_EC) + ec = speex_echo_state_init(SAMPLES_PER_FRAME, ECHO_TAIL); +#endif + } +#endif + + /* fill ecOutRing */ +// PaUtil_WriteRingBuffer(&ecOutRing, outputBuffer, n * 2); + PaUtil_WriteRingBuffer(&ecOutRing, outputBuffer, n * 2); + + // Make sure we have enough buffer. + // Currently, just one SAMPLES_PER_FRAME's worth. + if ( PaUtil_GetRingBufferWriteAvailable(&ecOutRing) < ((n + SAMPLES_PER_FRAME) * 2) ) + return; + + PaUtil_ReadRingBuffer(&ecOutRing, delayedBuf, n * 2); + +#if defined(DO_EC) && defined(SPEEX_EC) + { + short cancelledBuffer[1024]; + + speex_echo_cancel(ec, inputBuffer, delayedBuf, + cancelledBuffer, NULL); + + for ( i = 0; i < n; i++ ) + inputBuffer[i] = cancelledBuffer[i]; + } +#endif + +#if defined(USE_MEC2) || defined(SPAN_EC) + for ( i = 0; i < n; i++ ) + inputBuffer[i] = echo_can_update(ec, delayedBuf[i], + inputBuffer[i]); +#endif +} + +static int pa_callback(void *inputBuffer, void *outputBuffer, + unsigned long samplesPerFrame, + const PaStreamCallbackTimeInfo* outTime, + PaStreamCallbackFlags statusFlags, + void *userData) +{ + int totBytes = samplesPerFrame * sizeof(SAMPLE); + + short virtualInBuffer[MAX_SAMPLES_PER_FRAME * 2]; + short virtualOutBuffer[MAX_SAMPLES_PER_FRAME * 2]; + +#if 0 + /* I think this can't happen */ + if(virtualMono && samplesPerFrame > SAMPLES_PER_FRAME) { + fprintf(stderr, "ERROR: buffer in callback is too big!\n"); + exit(1); + } +#endif + + if ( outputBuffer ) + { + int bWritten; + /* output underflow might happen here */ + if (virtualMonoOut) + { + bWritten = PaUtil_ReadRingBuffer(&outRing, virtualOutBuffer, + totBytes); + /* we zero "virtualOutBuffer", then convert the whole thing, + * yes, because we use virtualOutBuffer for ec below */ + if ( bWritten < totBytes ) + { + memset(((char *)virtualOutBuffer) + bWritten, + 0, totBytes - bWritten); + //fprintf(stderr, "*U*"); + } + mono2stereo((SAMPLE *)outputBuffer, virtualOutBuffer, + samplesPerFrame); + } + else + { + bWritten = PaUtil_ReadRingBuffer(&outRing, outputBuffer, totBytes); + if ( bWritten < totBytes) + { + memset((char *)outputBuffer + bWritten, + 0, totBytes - bWritten); + //fprintf(stderr, "*U*"); + } + } + + /* zero underflowed space [ silence might be more golden + * than garbage? ] */ + + pa_mix_sounds(outputBuffer, samplesPerFrame, 0, virtualMonoOut); + + if(!auxStream) + pa_mix_sounds(outputBuffer, samplesPerFrame, 1, virtualMonoOut); + } + + + if ( inputBuffer ) + { + /* input overflow might happen here */ + if ( virtualMonoIn ) + { + stereo2mono(virtualInBuffer, (SAMPLE *)inputBuffer, + samplesPerFrame); + iaxc_echo_can(virtualInBuffer, virtualOutBuffer, + samplesPerFrame); + + PaUtil_WriteRingBuffer(&inRing, virtualInBuffer, totBytes); + } + else + { + iaxc_echo_can((short *)inputBuffer, + (short *)outputBuffer, + samplesPerFrame); + + PaUtil_WriteRingBuffer(&inRing, inputBuffer, totBytes); + } + } + + return 0; +} + +static int pa_aux_callback(void *inputBuffer, void *outputBuffer, + unsigned long samplesPerFrame, + const PaStreamCallbackTimeInfo* outTime, + PaStreamCallbackFlags statusFlags, + void *userData) +{ + int totBytes = samplesPerFrame * sizeof(SAMPLE) * (virtualMonoRing + 1); + + if ( outputBuffer ) + { + memset((char *)outputBuffer, 0, totBytes); + pa_mix_sounds(outputBuffer, samplesPerFrame, 1, virtualMonoRing); + } + return 0; +} + +static int pa_open(int single, int inMono, int outMono) +{ + PaError err; + PaDeviceInfo *result; + + struct PaStreamParameters in_stream_params, out_stream_params, no_device; + in_stream_params.device = selectedInput; + in_stream_params.channelCount = (inMono ? 1 : 2); + in_stream_params.sampleFormat = paInt16; + result = (PaDeviceInfo *)Pa_GetDeviceInfo(selectedInput); + if ( result == NULL ) return -1; + in_stream_params.suggestedLatency = result->defaultLowInputLatency; + in_stream_params.hostApiSpecificStreamInfo = NULL; + + out_stream_params.device = selectedOutput; + out_stream_params.channelCount = (outMono ? 1 : 2); + out_stream_params.sampleFormat = paInt16; + result = (PaDeviceInfo *)Pa_GetDeviceInfo(selectedOutput); + if ( result == NULL ) return -1; + out_stream_params.suggestedLatency = result->defaultLowOutputLatency; + out_stream_params.hostApiSpecificStreamInfo = NULL; + + no_device.device = paNoDevice; + no_device.channelCount = 0; + no_device.sampleFormat = paInt16; + result = (PaDeviceInfo *)Pa_GetDeviceInfo(selectedInput); + if ( result == NULL ) return -1; + no_device.suggestedLatency = result->defaultLowInputLatency; // FEEDBACK - unsure if appropriate + no_device.hostApiSpecificStreamInfo = NULL; + + if ( single ) + { + err = Pa_OpenStream(&iStream, + &in_stream_params, + &out_stream_params, + sample_rate, + paFramesPerBufferUnspecified, //FEEBACK - unsure if appropriate + paNoFlag, + (PaStreamCallback *)pa_callback, + NULL); + if (err != paNoError) return -1; + oStream = iStream; + oneStream = 1; + } else + { + err = Pa_OpenStream(&iStream, + &in_stream_params, + &no_device, + sample_rate, + paFramesPerBufferUnspecified, //FEEBACK - unsure if appropriate + paNoFlag, + (PaStreamCallback *)pa_callback, + NULL); + if ( err != paNoError ) return -1; + + err = Pa_OpenStream(&oStream, + &no_device, + &out_stream_params, + sample_rate, + paFramesPerBufferUnspecified, //FEEBACK - unsure if appropriate + paNoFlag, + (PaStreamCallback *)pa_callback, + NULL); + + if ( err != paNoError ) + { + Pa_CloseStream(iStream); + iStream = NULL; + return -1; + } + oneStream = 0; + } + + virtualMonoIn = (inMono ? 0 : 1); + virtualMonoOut = (outMono ? 0 : 1); + return 0; +} + +/* some commentary here: + * 1: MacOSX: MacOSX often needs "virtual mono" and a single stream. + * That doesn't work for some USB devices (a Platronics headset), so + * mono in, virtual mono out, and mono in/out are also tried. + * + * 2: Unix/OSS: most cards are OK with real mono, and a single stream. + * Except some. For those, a single open with real mono will succeed, + * but execution will fail. Maybe others will open OK with a single + * stream, and real mono, but fail later? Two stream mono is tried first, + * since it reportedly provides better sound quality with ALSA + * and Sound Blaster Live. + * + * The failure mode I saw with a volunteer was that reads/writes would + * return -enodev (down in the portaudio code). Bummer. + * + * Win32 works fine, in all cases, with a single stream and real mono, + * so far. + * + * We could probably do this more cleanly, because there are still cases + * where we will fail (i.e. if the user has only mono in and out on a Mac). + * + * */ +static int pa_openstreams (struct iaxc_audio_driver *d ) +{ + int err; + +#ifdef LINUX + err = pa_open(0, 1, 1) && /* two stream mono */ + pa_open(1, 1, 1) && /* one stream mono */ + pa_open(0, 0, 0); /* two stream stereo */ +#else +#ifdef MACOSX + err = pa_open(1, 0, 0) && /* one stream stereo */ + pa_open(1, 1, 0) && /* one stream mono in stereo out */ + pa_open(1, 1, 1) && /* one stream mono */ + pa_open(0, 0, 0); /* two stream stereo */ +#else + err = pa_open(1, 1, 1) && /* one stream mono */ + pa_open(1, 0, 0) && /* one stream stereo */ + pa_open(1, 1, 0) && /* one stream mono in stereo out */ + pa_open(0, 0, 0); /* two stream stereo */ +#endif /*MACOSX */ +#endif /* LINUX */ + + if (err) + { + handle_paerror(err, "Unable to open streams"); + return -1; + } + return 0; +} + +static int pa_openauxstream (struct iaxc_audio_driver *d ) +{ + PaError err; + + struct PaStreamParameters ring_stream_params; + + // setup the ring parameters + ring_stream_params.device = selectedRing; + ring_stream_params.sampleFormat = paInt16; + ring_stream_params.suggestedLatency = + Pa_GetDeviceInfo(selectedRing)->defaultLowOutputLatency; + ring_stream_params.hostApiSpecificStreamInfo = NULL; + + // first we'll try mono + ring_stream_params.channelCount = 1; + + err = Pa_OpenStream(&aStream, + NULL, + &ring_stream_params, + sample_rate, + paFramesPerBufferUnspecified, //FEEBACK - unsure if appropriate + paNoFlag, + (PaStreamCallback *)pa_aux_callback, + NULL); + + if ( err != paNoError ) + { + // next we'll try virtual mono (stereo) + ring_stream_params.channelCount = 1; + + err = Pa_OpenStream(&aStream, + NULL, + &ring_stream_params, + sample_rate, + paFramesPerBufferUnspecified, //FEEBACK - unsure if appropriate + paNoFlag, + (PaStreamCallback *)pa_aux_callback, + NULL); + } + + // mmok, failure... + if ( err != paNoError ) + { + // fprintf(stderr, "Failure opening ring device with params: id: %d, output %d, default output %d\n", + // selectedRing, selectedOutput, Pa_GetDefaultOutputDevice()); + + handle_paerror(err, "opening separate ring stream"); + return -1; + } + + // Determine whether virtual mono is being used + virtualMonoRing = ring_stream_params.channelCount - 1; + + return 0; +} + +static int pa_start(struct iaxc_audio_driver *d) +{ + static int errcnt = 0; + + if ( running ) + return 0; + + /* re-open mixers if necessary */ + if ( iMixer ) + { + Px_CloseMixer(iMixer); + iMixer = NULL; + } + + if ( oMixer ) + { + Px_CloseMixer(oMixer); + oMixer = NULL; + } + + if ( errcnt > 5 ) + { + iaxci_usermsg(IAXC_TEXT_TYPE_FATALERROR, + "iaxclient audio: Can't open Audio Device. " + "Perhaps you do not have an input or output device?"); + /* OK, we'll give the application the option to abort or + * not here, but we will throw a fatal error anyway */ + iaxc_millisleep(1000); + //return -1; // Give Up. Too many errors. + } + + /* flush the ringbuffers */ + PaUtil_InitializeRingBuffer(&inRing, 1, INRBSZ, inRingBuf); + PaUtil_InitializeRingBuffer(&outRing, 1, OUTRBSZ, outRingBuf); + + if ( pa_openstreams(d) ) + { + errcnt++; + return -1; + } + + errcnt = 0; // only count consecutive errors. + + if ( Pa_StartStream(iStream) != paNoError ) + return -1; + + iMixer = Px_OpenMixer(iStream, 0); + + if ( !oneStream ) + { + PaError err = Pa_StartStream(oStream); + oMixer = Px_OpenMixer(oStream, 0); + if ( err != paNoError ) + { + Pa_StopStream(iStream); + return -1; + } + } + + if ( selectedRing != selectedOutput ) + { + auxStream = 1; + } + else + { + auxStream = 0; + } + + if ( auxStream ) + { + pa_openauxstream(d); + if ( Pa_StartStream(aStream) != paNoError ) + { + auxStream = 0; + } + } + + /* select the microphone as the input source */ + if ( iMixer != NULL && !mixers_initialized ) + { + /* First, select the "microphone" device, if it's available */ + /* try the new method, reverting to the old if it fails */ + if ( Px_SetCurrentInputSourceByName( iMixer, "microphone" ) != 0 ) + { + int n = Px_GetNumInputSources( iMixer ) - 1; + for ( ; n > 0; --n ) + { + if ( !strcasecmp("microphone", + Px_GetInputSourceName(iMixer, n)) ) + { + Px_SetCurrentInputSource( iMixer, n ); + } + } + } + + /* try to set the microphone boost -- we just turn off this + * "boost" feature, because it often leads to clipping, which + * we can't fix later -- but we can deal with low input levels + * much more gracefully */ + Px_SetMicrophoneBoost( iMixer, 0 ); + + /* If the input level is very low, raise it up a bit. + * Otherwise, AGC cannot detect speech, and cannot adjust + * levels */ + if ( pa_input_level_get(d) < 0.5f ) + pa_input_level_set(d, 0.6f); + mixers_initialized = 1; + } + + running = 1; + return 0; +} + +static int pa_stop (struct iaxc_audio_driver *d ) +{ + PaError err; + + if ( !running ) + return 0; + + if ( sounds ) + return 0; + + err = Pa_AbortStream(iStream); + err = Pa_CloseStream(iStream); + + if ( !oneStream ) + { + err = Pa_AbortStream(oStream); + err = Pa_CloseStream(oStream); + } + + if ( auxStream ) + { + err = Pa_AbortStream(aStream); + err = Pa_CloseStream(aStream); + } + + running = 0; + return 0; +} + +/* Mihai: apparently nobody loves this function. Some actually hate it. + * I bet if it's gone, no one will miss it. Such a cold, cold world! +static void pa_shutdown() +{ + CloseAudioStream( iStream ); + if(!oneStream) CloseAudioStream( oStream ); + if(auxStream) CloseAudioStream( aStream ); +} +*/ + +static void handle_paerror(PaError err, char * where) +{ + fprintf(stderr, "PortAudio error at %s: %s\n", where, + Pa_GetErrorText(err)); +} + +static int pa_input(struct iaxc_audio_driver *d, void *samples, int *nSamples) +{ + int bytestoread; + + bytestoread = *nSamples * sizeof(SAMPLE); + + /* we don't return partial buffers */ + if ( PaUtil_GetRingBufferWriteAvailable(&inRing) < bytestoread ) + { + *nSamples = 0; + return 0; + } + + PaUtil_ReadRingBuffer(&inRing, samples, bytestoread); + + return 0; +} + +static int pa_output(struct iaxc_audio_driver *d, void *samples, int nSamples) +{ + int bytestowrite = nSamples * sizeof(SAMPLE); + int outRingLen; + + outRingLen = PaUtil_GetRingBufferWriteAvailable(&outRing); + outRingLenAvg = (outRingLenAvg * 9 + outRingLen ) / 10; + + /* if we've got a big output buffer, drop this */ + if (outRingLen > (int)RBOUTTARGET_BYTES && + outRingLenAvg > (int)RBOUTTARGET_BYTES) + { + //fprintf(stderr, "*O*"); + return outRingLen/2; + } + + //if(rb_GetRingBufferWriteAvailable(&outRing) < bytestowrite) + // fprintf(stderr, "O"); + + PaUtil_WriteRingBuffer(&outRing, samples, bytestowrite); + + return (outRingLen + bytestowrite)/2; + +} + +static int pa_select_devices(struct iaxc_audio_driver *d, int input, + int output, int ring) +{ + selectedInput = input; + selectedOutput = output; + selectedRing = ring; + if ( running ) + { + /* stop/start audio, in order to switch devices */ + pa_stop(d); + pa_start(d); + } + else + { + /* start/stop audio, in order to initialize mixers and levels */ + pa_start(d); + pa_stop(d); + } + return 0; +} + +static int pa_selected_devices(struct iaxc_audio_driver *d, int *input, + int *output, int *ring) +{ + *input = selectedInput; + *output = selectedOutput; + *ring = selectedRing; + return 0; +} + +static int pa_destroy(struct iaxc_audio_driver *d) +{ + if( iMixer ) + { + Px_CloseMixer(iMixer); + iMixer = NULL; + } + if ( oMixer ) + { + Px_CloseMixer(oMixer); + oMixer = NULL; + } + if ( d ) + { + if ( d->devices ) + { + free(d->devices); + d->devices= NULL; + } + } + return Pa_Terminate(); +} + +static float pa_input_level_get(struct iaxc_audio_driver *d) +{ + /* iMixer should be non-null if we using either one or two streams */ + if ( !iMixer ) + return -1; + + /* make sure this device supports input volume controls */ + if ( Px_GetNumInputSources( iMixer ) == 0 ) + return -1; + + return Px_GetInputVolume(iMixer); +} + +static float pa_output_level_get(struct iaxc_audio_driver *d) +{ + PxMixer *mix; + + /* oMixer may be null if we're using one stream, + in which case, iMixer should not be null, + if it is, return an error */ + + if ( oMixer ) + mix = oMixer; + else if ( iMixer ) + mix = iMixer; + else + return -1; + + /* prefer the pcm output, but default to the master output */ + if ( Px_SupportsPCMOutputVolume(mix) ) + return Px_GetPCMOutputVolume(mix); + else + return Px_GetMasterVolume(mix); +} + +static int pa_input_level_set(struct iaxc_audio_driver *d, float level) +{ + /* make sure this device supports input volume controls */ + if ( !iMixer || Px_GetNumInputSources(iMixer) == 0 ) + return -1; + + Px_SetInputVolume(iMixer, level); + + return 0; +} + +static int pa_output_level_set(struct iaxc_audio_driver *d, float level) +{ + PxMixer *mix; + + if ( oMixer ) + mix = oMixer; + else if ( iMixer ) + mix = iMixer; + else + return -1; + + /* prefer the pcm output, but default to the master output */ + if ( Px_SupportsPCMOutputVolume(mix) ) + Px_SetPCMOutputVolume(mix, level); + else + Px_SetMasterVolume(mix, level); + + return 0; +} + +static int pa_mic_boost_get(struct iaxc_audio_driver* d) +{ + if ( !iMixer ) + return -1; + + return Px_GetMicrophoneBoost(iMixer); +} + +int pa_mic_boost_set(struct iaxc_audio_driver* d, int enable) +{ + if ( !iMixer ) + return -1; + + return Px_SetMicrophoneBoost(iMixer, enable); +} + +/* initialize audio driver */ +static int _pa_initialize (struct iaxc_audio_driver *d, int sr) +{ + PaError err; + + sample_rate = sr; + + /* initialize portaudio */ + if ( paNoError != (err = Pa_Initialize()) ) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, "Failed Pa_Initialize"); + return err; + } + + /* scan devices */ + scan_devices(d); + + /* setup methods */ + d->initialize = pa_initialize; + d->destroy = pa_destroy; + d->select_devices = pa_select_devices; + d->selected_devices = pa_selected_devices; + d->start = pa_start; + d->stop = pa_stop; + d->output = pa_output; + d->input = pa_input; + d->input_level_get = pa_input_level_get; + d->input_level_set = pa_input_level_set; + d->output_level_get = pa_output_level_get; + d->output_level_set = pa_output_level_set; + d->play_sound = pa_play_sound; + d->stop_sound = pa_stop_sound; + d->mic_boost_get = pa_mic_boost_get; + d->mic_boost_set = pa_mic_boost_set; + + /* setup private data stuff */ + selectedInput = Pa_GetDefaultInputDevice(); + selectedOutput = Pa_GetDefaultOutputDevice(); + selectedRing = Pa_GetDefaultOutputDevice(); + sounds = NULL; + MUTEXINIT(&sound_lock); + + PaUtil_InitializeRingBuffer(&inRing, 1, INRBSZ, inRingBuf); + PaUtil_InitializeRingBuffer(&outRing, 1, OUTRBSZ, outRingBuf); + + running = 0; + + return 0; +} + +/* standard initialization: Do the normal initialization, and then + also initialize mixers and levels */ +int pa_initialize(struct iaxc_audio_driver *d, int sr) +{ + _pa_initialize(d, sr); + + /* TODO: Kludge alert. We only do the funny audio start-stop + * business if iaxci_audio_output_mode is not set. This is a + * hack to allow certain specific users of iaxclient to avoid + * certain problems associated with portaudio initialization + * hitting a deadlock condition. + */ + if ( iaxci_audio_output_mode ) + return 0; + + /* start/stop audio, in order to initialize mixers and levels */ + pa_start(d); + pa_stop(d); + + return 0; +} + +/* alternate initialization: delay mixer/level initialization until + we actually start the device. This is somewhat useful when you're about to start + the device as soon as you've initialized it, and want to avoid the time it + takes to start/stop the device before starting it again */ +int pa_initialize_deferred(struct iaxc_audio_driver *d, int sr) +{ + _pa_initialize(d, sr); + return 0; +} + diff --git a/3rdparty/iaxclient-2/lib/audio_portaudio.h b/3rdparty/iaxclient-2/lib/audio_portaudio.h new file mode 100644 index 0000000..099cc1c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/audio_portaudio.h @@ -0,0 +1,27 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#ifndef _AUDIO_PORTAUDIO_H +#define _AUDIO_PORTAUDIO_H + +#include "iaxclient_lib.h" + +/* normal initialization */ +int pa_initialize (struct iaxc_audio_driver *d, int sr); + +/* faster initialization which defers initialization of mixers and levels + until the device is started */ +int pa_initialize_deferred (struct iaxc_audio_driver *d, int sr); + +#endif diff --git a/3rdparty/iaxclient-2/lib/codec_alaw.c b/3rdparty/iaxclient-2/lib/codec_alaw.c new file mode 100644 index 0000000..4064c06 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_alaw.c @@ -0,0 +1,159 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2004 Cyril VELTER + * + * Contributors: + * Cyril VELTER + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "codec_alaw.h" +#include "iaxclient_lib.h" + +#if defined(_MSC_VER) +#define INLINE __inline +#else +#define INLINE inline +#endif + +struct state { + plc_state_t plc; +}; + +static INLINE short int alawdecode (unsigned char alaw) +{ + int value; + int segment; + + /* Mask value */ + alaw ^= 0x55; + + /* Extract and scale value */ + value = (alaw & 0x0f) << 4; + + /* Extract segment number */ + segment = (alaw & 0x70) >> 4; + + /* Compute value */ + switch (segment) { + case 0: + break; + case 1: + value += 0x100; + break; + default: + value += 0x100; + value <<= segment - 1; + } + + /* Extract sign */ + return (alaw & 0x80) ? value : -value; +} + +static INLINE unsigned char alawencode (short int linear) +{ + int mask = 0x55; + int segment; + unsigned char alaw; + + static int segments[8] = {0xFF, 0x1FF, 0x3FF, 0x7FF, 0xFFF, 0x1FFF, 0x3FFF, 0x7FFF}; + + if (linear >= 0) + { + /* Sign (7th) bit = 1 */ + mask |= 0x80; + } + else + { + /* Sign (7th) bit = 0 */ + linear = -linear; + } + + /* Find the segment */ + for (segment = 0;segment < 8;segment++) + if (linear <= segments[segment]) + break; + + /* Combine the sign, segment, and quantization bits. */ + + if (segment < 8) + { + if (segment < 2) + alaw = (linear >> 4) & 0x0F; + else + alaw = (linear >> (segment + 3)) & 0x0F; + + return ((alaw | (segment << 4)) ^ mask); + } + else + /* out of range, return maximum value. */ + return (0x7F ^ mask); +} + +static int decode ( struct iaxc_audio_codec *c, + int *inlen, unsigned char *in, int *outlen, short *out ) { + struct state *state = (struct state *)(c->decstate); + short *orig_out = out; + short sample; + + + if(*inlen == 0) { + int interp_len = 160; + if(*outlen < interp_len) interp_len = *outlen; + plc_fillin(&state->plc,out,interp_len); + *outlen -= interp_len; + return 0; + } + + + while ((*inlen > 0) && (*outlen > 0)) { + sample = alawdecode((unsigned char)*(in++)); + *(out++) = sample; + (*inlen)--; (*outlen)--; + } + plc_rx(&state->plc, orig_out, (int)(out - orig_out)); + + return 0; +} + +static int encode ( struct iaxc_audio_codec *c, + int *inlen, short *in, int *outlen, unsigned char *out ) { + + while ((*inlen > 0) && (*outlen > 0)) { + *(out++) = alawencode(*(in++)); + (*inlen)--; (*outlen)--; + } + + return 0; +} + +static void destroy ( struct iaxc_audio_codec *c) { + free(c); +} + +struct iaxc_audio_codec *codec_audio_alaw_new() { + + struct iaxc_audio_codec *c = (struct iaxc_audio_codec *)calloc(1, sizeof(struct iaxc_audio_codec)); + + if(!c) return c; + + strcpy(c->name,"alaw"); + c->format = IAXC_FORMAT_ALAW; + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + /* really, we can use less, but don't want to */ + c->minimum_frame_size = 160; + + /* decoder state, used for interpolation */ + c->decstate = calloc(sizeof(struct state),1); + plc_init(&((struct state *)c->decstate)->plc); + + return c; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_alaw.h b/3rdparty/iaxclient-2/lib/codec_alaw.h new file mode 100644 index 0000000..bc4d213 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_alaw.h @@ -0,0 +1,14 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2004 Cyril VELTER + * + * Contributors: + * Cyril VELTER + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +struct iaxc_audio_codec *codec_audio_alaw_new(); diff --git a/3rdparty/iaxclient-2/lib/codec_ffmpeg.c b/3rdparty/iaxclient-2/lib/codec_ffmpeg.c new file mode 100644 index 0000000..ec96f0f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ffmpeg.c @@ -0,0 +1,748 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Peter Grayson + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + * + * A video codec using the ffmpeg library. + * + * TODO: this code still uses its own slicing mechanism + * It should be converted to use the API provided in slice.[ch] + */ + +#include + +#include "codec_ffmpeg.h" +#include "iaxclient_lib.h" + +#ifdef WIN32 +#include "libavcodec/avcodec.h" +#else +#include +#endif + +struct slice_header_t +{ + unsigned char version; + unsigned short source_id; + unsigned char frame_index; + unsigned char slice_index; + unsigned char num_slices; +}; + +struct encoder_ctx +{ + AVCodecContext * avctx; + AVFrame * picture; + + struct slice_header_t slice_header; + + unsigned char *frame_buf; + int frame_buf_len; +}; + +struct decoder_ctx +{ + AVCodecContext * avctx; + AVFrame * picture; + + struct slice_header_t slice_header; + int frame_size; + + unsigned char * frame_buf; + int frame_buf_len; +}; + +static struct slice_set_t * g_slice_set = 0; + +static enum CodecID map_iaxc_codec_to_avcodec(int format) +{ + switch (format) + { + case IAXC_FORMAT_H261: + return CODEC_ID_H261; + + case IAXC_FORMAT_H263: + return CODEC_ID_H263; + + case IAXC_FORMAT_H263_PLUS: + return CODEC_ID_H263P; + + case IAXC_FORMAT_MPEG4: + return CODEC_ID_MPEG4; + + case IAXC_FORMAT_H264: + return CODEC_ID_H264; + + case IAXC_FORMAT_THEORA: + return CODEC_ID_THEORA; + + default: + return CODEC_ID_NONE; + } +} + +static void destroy(struct iaxc_video_codec *c) +{ + if (c) + { + struct encoder_ctx *e = (struct encoder_ctx *) c->encstate; + struct decoder_ctx *d = (struct decoder_ctx *) c->decstate; + + if (e) + { + av_freep(&e->avctx); + av_freep(&e->picture); + if (e->frame_buf) + free(e->frame_buf); + free(e); + } + + if (d) + { + av_freep(&d->avctx); + av_freep(&d->picture); + if (d->frame_buf) + free(d->frame_buf); + free(d); + } + + free(c); + } +} + +static void reset_decoder_frame_state(struct decoder_ctx * d) +{ + memset(d->frame_buf, 0, d->frame_buf_len); + d->frame_size = 0; + d->slice_header.slice_index = 0; +} + +static int frame_to_frame_xlate(AVCodecContext * avctx, AVFrame * picture, + int * outlen, char * out) +{ + int line; + + *outlen = avctx->width * avctx->height * 6 / 4; + + for ( line = 0; line < avctx->height / 2; ++line ) + { + /* y even */ + memcpy(out + avctx->width * (2 * line + 0), + picture->data[0] + (2 * line + 0) * picture->linesize[0], + avctx->width); + + /* y odd */ + memcpy(out + avctx->width * (2 * line + 1), + picture->data[0] + (2 * line + 1) * picture->linesize[0], + avctx->width); + + /* u + v */ + memcpy(out + avctx->width * avctx->height + + line * avctx->width / 2, + picture->data[1] + line * picture->linesize[1], + avctx->width / 2); + + memcpy(out + avctx->width * avctx->height * 5 / 4 + + line * avctx->width / 2, + picture->data[2] + line * picture->linesize[2], + avctx->width / 2); + } + + return 0; +} + +static int pass_frame_to_decoder(AVCodecContext * avctx, AVFrame * picture, + int inlen, unsigned char * in, int * outlen, char * out) +{ + int bytes_decoded; + int got_picture; + + bytes_decoded = avcodec_decode_video(avctx, picture, &got_picture, + in, inlen); + + if ( bytes_decoded != inlen ) + { + fprintf(stderr, + "codec_ffmpeg: decode: failed to decode whole frame %d / %d\n", + bytes_decoded, inlen); + return -1; + } + + if ( !got_picture ) + { + fprintf(stderr, + "codec_ffmpeg: decode: failed to get picture\n"); + return -1; + } + + frame_to_frame_xlate(avctx, picture, outlen, out); + + return 0; +} + +static char *parse_slice_header(char * in, struct slice_header_t * slice_header) +{ + slice_header->version = in[0]; + slice_header->source_id = (in[1] << 8) | in[2]; + slice_header->frame_index = in[3]; + slice_header->slice_index = in[4]; + slice_header->num_slices = in[5]; + + if ( slice_header->version != 0 ) + { + fprintf(stderr, + "codec_ffmpeg: decode: unknown slice header version %d\n", + slice_header->version); + return 0; + } + + return in + 6; +} + +static int decode_iaxc_slice(struct iaxc_video_codec * c, int inlen, + char * in, int * outlen, char * out) +{ + struct decoder_ctx *d = (struct decoder_ctx *) c->decstate; + struct slice_header_t * sh_saved = &d->slice_header; + struct slice_header_t sh_this; + char * inp; + int ret; + + inp = parse_slice_header(in, &sh_this); + + if ( !inp ) + return -1; + + inlen -= inp - in; + + if ( sh_this.source_id == sh_saved->source_id ) + { + unsigned char frame_delta; + + frame_delta = sh_this.frame_index - sh_saved->frame_index; + + if ( frame_delta > 20 ) + { + /* This is an old slice. It's too late, we ignore it. */ + return 1; + } + else if ( frame_delta > 0 ) + { + /* This slice belongs to a future frame */ + if ( sh_saved->slice_index > 0 ) + { + /* We have received slices for a previous + * frame (e.g. the one we were previously + * working on), so we go ahead and send this + * partial frame to the decoder and get setup + * for the new frame. + */ + + ret = pass_frame_to_decoder(d->avctx, d->picture, + d->frame_size, d->frame_buf, + outlen, out); + + reset_decoder_frame_state(d); + + if ( ret ) + return -1; + } + + sh_saved->frame_index = sh_this.frame_index; + } + } + else + { + sh_saved->source_id = sh_this.source_id; + sh_saved->frame_index = sh_this.frame_index; + sh_saved->slice_index = 0; + d->frame_size = 0; + } + + if ( c->fragsize * sh_this.slice_index + inlen > d->frame_buf_len ) + { + fprintf(stderr, + "codec_ffmpeg: decode: slice overflows decoder frame buffer\n"); + return -1; + } + + memcpy(d->frame_buf + c->fragsize * sh_this.slice_index, + inp, inlen); + sh_saved->slice_index++; + d->frame_size = c->fragsize * sh_this.slice_index + inlen; + + if ( sh_saved->slice_index < sh_this.num_slices ) + { + /* Do not decode yet, there are more slices coming for + * this frame. + */ + return 1; + } + + ret = pass_frame_to_decoder(d->avctx, d->picture, d->frame_size, + d->frame_buf, outlen, out); + + reset_decoder_frame_state(d); + + if ( ret ) + return -1; + + return 0; +} + +static int decode_rtp_slice(struct iaxc_video_codec * c, + int inlen, char * in, int * outlen, char * out) +{ + struct decoder_ctx *d = (struct decoder_ctx *) c->decstate; + int ret = 1; + + while ( inlen ) + { + int bytes_decoded; + int got_picture; + + bytes_decoded = avcodec_decode_video(d->avctx, d->picture, + &got_picture, (unsigned char *)in, inlen); + + if ( bytes_decoded < 0 ) + { + fprintf(stderr, + "codec_ffmpeg: decode: error decoding frame\n"); + return -1; + } + + inlen -= bytes_decoded; + in += bytes_decoded; + + if ( got_picture && ret == 0) + { + fprintf(stderr, + "codec_ffmpeg: decode: unexpected second frame\n"); + return -1; + } + + if ( got_picture ) + { + frame_to_frame_xlate(d->avctx, d->picture, outlen, out); + ret = 0; + } + } + + return ret; +} + +static void slice_encoded_frame(struct slice_header_t * sh, + struct slice_set_t * slice_set, + unsigned char * in, int inlen, int fragsize) +{ + sh->num_slices = slice_set->num_slices = (inlen - 1) / fragsize + 1; + + for (sh->slice_index = 0; sh->slice_index < sh->num_slices; + ++sh->slice_index) + { + int slice_size = (sh->slice_index == sh->num_slices - 1) ? + inlen % fragsize : fragsize; + + slice_set->size[sh->slice_index] = slice_size + 6; + slice_set->data[sh->slice_index][0] = sh->version; + slice_set->data[sh->slice_index][1] = sh->source_id >> 8; + slice_set->data[sh->slice_index][2] = sh->source_id & 0xff; + slice_set->data[sh->slice_index][3] = sh->frame_index; + slice_set->data[sh->slice_index][4] = sh->slice_index; + slice_set->data[sh->slice_index][5] = sh->num_slices; + + memcpy(&slice_set->data[sh->slice_index][6], in, slice_size); + + in += slice_size; + } + + sh->frame_index++; +} + +static int encode(struct iaxc_video_codec *c, + int inlen, char * in, struct slice_set_t * slice_set) +{ + struct encoder_ctx *e = (struct encoder_ctx *) c->encstate; + int encoded_size; + + avcodec_get_frame_defaults(e->picture); + + e->picture->data[0] = (unsigned char *)in; + e->picture->data[1] = (unsigned char *)in + + e->avctx->width * e->avctx->height; + e->picture->data[2] = (unsigned char *)in + + e->avctx->width * e->avctx->height * 5 / 4; + + e->picture->linesize[0] = e->avctx->width; + e->picture->linesize[1] = e->avctx->width / 2; + e->picture->linesize[2] = e->avctx->width / 2; + + /* TODO: investigate setting a real pts value */ + e->picture->pts = AV_NOPTS_VALUE; + + /* TODO: investigate quality */ + e->picture->quality = 10; + + g_slice_set = slice_set; + slice_set->num_slices = 0; + + encoded_size = avcodec_encode_video(e->avctx, + e->frame_buf, e->frame_buf_len, e->picture); + + if (!encoded_size) + { + fprintf(stderr, "codec_ffmpeg: encode failed\n"); + return -1; + } + + slice_set->key_frame = e->avctx->coded_frame->key_frame; + + /* This is paranoia, of course. */ + g_slice_set = 0; + + /* We are in one of two modes here. + * + * The first possibility is that the codec supports rtp + * packetization. In this case, the slice_set has already been + * filled via encode_rtp_callback() calls made during the call + * to avcodec_encode_video(). + * + * The second possibility is that we have one big encoded frame + * that we need to slice-up ourselves. + */ + + if (!e->avctx->rtp_payload_size) + slice_encoded_frame(&e->slice_header, slice_set, + e->frame_buf, encoded_size, c->fragsize); + + return 0; +} + +void encode_rtp_callback(struct AVCodecContext *avctx, void *data, int size, + int mb_nb) +{ + memcpy(&g_slice_set->data[g_slice_set->num_slices], data, size); + g_slice_set->size[g_slice_set->num_slices] = size; + g_slice_set->num_slices++; +} + +struct iaxc_video_codec *codec_video_ffmpeg_new(int format, int w, int h, + int framerate, int bitrate, + int fragsize) +{ + struct encoder_ctx *e; + struct decoder_ctx *d; + AVCodec *codec; + int ff_enc_id, ff_dec_id; + char *name; + + struct iaxc_video_codec *c = calloc(sizeof(struct iaxc_video_codec), 1); + + if (!c) + { + fprintf(stderr, + "codec_ffmpeg: failed to allocate video context\n"); + return NULL; + } + + avcodec_init(); + avcodec_register_all(); + + c->format = format; + c->width = w; + c->height = h; + c->framerate = framerate; + c->bitrate = bitrate; + /* TODO: Is a fragsize of zero valid? If so, there's a divide + * by zero error to contend with. + */ + c->fragsize = fragsize; + + c->encode = encode; + c->decode = decode_iaxc_slice; + c->destroy = destroy; + + c->encstate = calloc(sizeof(struct encoder_ctx), 1); + if (!c->encstate) + goto bail; + e = c->encstate; + e->avctx = avcodec_alloc_context(); + if (!e->avctx) + goto bail; + e->picture = avcodec_alloc_frame(); + if (!e->picture) + goto bail; + /* The idea here is that the encoded frame that will land in this + * buffer will be no larger than the size of an uncompressed 32-bit + * rgb frame. + * + * TODO: Is this assumption really valid? + */ + e->frame_buf_len = w * h * 4; + e->frame_buf = malloc(e->frame_buf_len); + if (!e->frame_buf) + goto bail; + + c->decstate = calloc(sizeof(struct decoder_ctx), 1); + if (!c->decstate) + goto bail; + d = c->decstate; + d->avctx = avcodec_alloc_context(); + if (!d->avctx) + goto bail; + d->picture = avcodec_alloc_frame(); + if (!d->picture) + goto bail; + d->frame_buf_len = e->frame_buf_len; + d->frame_buf = malloc(d->frame_buf_len); + if (!d->frame_buf) + goto bail; + + e->slice_header.version = 0; + srandom(time(0)); + e->slice_header.source_id = random() & 0xffff; + + e->avctx->time_base.num = 1; + e->avctx->time_base.den = framerate; + + e->avctx->width = w; + e->avctx->height = h; + + e->avctx->bit_rate = bitrate; + + /* This determines how often i-frames are sent */ + e->avctx->gop_size = framerate * 3; + e->avctx->pix_fmt = PIX_FMT_YUV420P; + e->avctx->has_b_frames = 0; + + e->avctx->mb_qmin = e->avctx->qmin = 10; + e->avctx->mb_qmax = e->avctx->qmax = 10; + + e->avctx->lmin = 2 * FF_QP2LAMBDA; + e->avctx->lmax = 10 * FF_QP2LAMBDA; + e->avctx->global_quality = FF_QP2LAMBDA * 2; + e->avctx->qblur = 0.5; + e->avctx->global_quality = 10; + + e->avctx->flags |= CODEC_FLAG_PSNR; + e->avctx->flags |= CODEC_FLAG_QSCALE; + + e->avctx->mb_decision = FF_MB_DECISION_SIMPLE; + + ff_enc_id = ff_dec_id = map_iaxc_codec_to_avcodec(format); + + /* Note, when fragsize is used (non-zero) ffmpeg will use a "best + * effort" strategy: the fragment size will be fragsize +/- 20% + */ + + switch (format) + { + + case IAXC_FORMAT_H261: + /* TODO: H261 only works with specific resolutions. */ + name = "H.261"; + break; + + case IAXC_FORMAT_H263: + /* TODO: H263 only works with specific resolutions. */ + name = "H.263"; + e->avctx->flags |= CODEC_FLAG_AC_PRED; + if (fragsize) + { + c->decode = decode_rtp_slice; + e->avctx->rtp_payload_size = fragsize; + e->avctx->flags |= + CODEC_FLAG_TRUNCATED | CODEC_FLAG2_STRICT_GOP; + e->avctx->rtp_callback = encode_rtp_callback; + d->avctx->flags |= CODEC_FLAG_TRUNCATED; + } + break; + + case IAXC_FORMAT_H263_PLUS: + /* Although the encoder is CODEC_ID_H263P, the decoder + * is the regular h.263, so we handle this special case + * here. + */ + ff_dec_id = CODEC_ID_H263; + name = "H.263+"; + e->avctx->flags |= CODEC_FLAG_AC_PRED; + if (fragsize) + { + c->decode = decode_rtp_slice; + e->avctx->rtp_payload_size = fragsize; + e->avctx->flags |= + CODEC_FLAG_TRUNCATED | + CODEC_FLAG_H263P_SLICE_STRUCT | + CODEC_FLAG2_STRICT_GOP | + CODEC_FLAG2_LOCAL_HEADER; + e->avctx->rtp_callback = encode_rtp_callback; + d->avctx->flags |= CODEC_FLAG_TRUNCATED; + } + break; + + case IAXC_FORMAT_MPEG4: + name = "MPEG4"; + c->decode = decode_rtp_slice; + e->avctx->rtp_payload_size = fragsize; + e->avctx->rtp_callback = encode_rtp_callback; + e->avctx->flags |= + CODEC_FLAG_TRUNCATED | + CODEC_FLAG_H263P_SLICE_STRUCT | + CODEC_FLAG2_STRICT_GOP | + CODEC_FLAG2_LOCAL_HEADER; + + d->avctx->flags |= CODEC_FLAG_TRUNCATED; + break; + + case IAXC_FORMAT_H264: + name = "H.264"; + + /* + * Encoder flags + */ + + /* Headers are not repeated */ + /* e->avctx->flags |= CODEC_FLAG_GLOBAL_HEADER; */ + + /* Slower, less blocky */ + /* e->avctx->flags |= CODEC_FLAG_LOOP_FILTER; */ + + e->avctx->flags |= CODEC_FLAG_PASS1; + /* e->avctx->flags |= CODEC_FLAG_PASS2; */ + + /* Compute psnr values at encode-time (avctx->error[]) */ + /* e->avctx->flags |= CODEC_FLAG_PSNR; */ + + /* e->avctx->flags2 |= CODEC_FLAG2_8X8DCT; */ + + /* Access Unit Delimiters */ + e->avctx->flags2 |= CODEC_FLAG2_AUD; + + /* Allow b-frames to be used as reference */ + /* e->avctx->flags2 |= CODEC_FLAG2_BPYRAMID; */ + + /* b-frame rate distortion optimization */ + /* e->avctx->flags2 |= CODEC_FLAG2_BRDO; */ + + /* e->avctx->flags2 |= CODEC_FLAG2_FASTPSKIP; */ + + /* Multiple references per partition */ + /* e->avctx->flags2 |= CODEC_FLAG2_MIXED_REFS; */ + + /* Weighted biprediction for b-frames */ + /* e->avctx->flags2 |= CODEC_FLAG2_WPRED; */ + + /* + * Decoder flags + */ + + /* Do not draw edges */ + /* d->avctx->flags |= CODEC_FLAG_EMU_EDGE; */ + + /* Decode grayscale only */ + /* d->avctx->flags |= CODEC_FLAG_GRAY; */ + + /* d->avctx->flags |= CODEC_FLAG_LOW_DELAY; */ + + /* Allow input bitstream to be randomly truncated */ + /* d->avctx->flags |= CODEC_FLAG_TRUNCATED; */ + + /* Allow out-of-spec speed tricks */ + /* d->avctx->flags2 |= CODEC_FLAG2_FAST; */ + break; + + case IAXC_FORMAT_THEORA: + /* TODO: ffmpeg only has a theora decoder. Until it has + * an encoder also, we cannot use ffmpeg for theora. + */ + name = "Theora"; + break; + + default: + fprintf(stderr, "codec_ffmpeg: unsupported format (0x%08x)\n", + format); + goto bail; + } + + strcpy(c->name, "ffmpeg-"); + strncat(c->name, name, sizeof(c->name)); + + /* Get the codecs */ + codec = avcodec_find_encoder(ff_enc_id); + if (!codec) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "codec_ffmpeg: cannot find encoder %d\n", + ff_enc_id); + goto bail; + } + + if (avcodec_open(e->avctx, codec)) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "codec_ffmpeg: cannot open encoder %s\n", name); + goto bail; + } + + codec = avcodec_find_decoder(ff_dec_id); + if (!codec) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "codec_ffmpeg: cannot find decoder %d\n", + ff_dec_id); + goto bail; + } + if (avcodec_open(d->avctx, codec)) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "codec_ffmpeg: cannot open decoder %s\n", name); + goto bail; + } + + { + enum PixelFormat fmts[] = { PIX_FMT_YUV420P, -1 }; + if (d->avctx->get_format(d->avctx, fmts) != PIX_FMT_YUV420P) + { + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "codec_ffmpeg: cannot set decode format to YUV420P\n"); + goto bail; + } + } + + return c; + +bail: + destroy(c); + return 0; +} + +int codec_video_ffmpeg_check_codec(int format) +{ + AVCodec *codec; + enum CodecID codec_id; + + /* These functions are idempotent, so it is okay that we + * may call them elsewhere at a different time. + */ + avcodec_init(); + avcodec_register_all(); + + codec_id = map_iaxc_codec_to_avcodec(format); + + if (codec_id == CODEC_ID_NONE) + return 0; + + codec = avcodec_find_encoder(codec_id); + + return codec ? 1 : 0; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_ffmpeg.h b/3rdparty/iaxclient-2/lib/codec_ffmpeg.h new file mode 100644 index 0000000..acc8307 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ffmpeg.h @@ -0,0 +1,20 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Peter Grayson + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + * + * A video codec using the ffmpeg library. + */ + +struct iaxc_video_codec *codec_video_ffmpeg_new(int format, int w, int h, int framerate, int bitrate, int fragsize); + +int codec_video_ffmpeg_check_codec(int format); diff --git a/3rdparty/iaxclient-2/lib/codec_gsm.c b/3rdparty/iaxclient-2/lib/codec_gsm.c new file mode 100644 index 0000000..0f6ac9f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_gsm.c @@ -0,0 +1,127 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "codec_gsm.h" +#include "iaxclient_lib.h" +#include "gsm.h" + +struct state { + gsm gsmstate; + plc_state_t plc; +}; + + +static void destroy ( struct iaxc_audio_codec *c) { + + struct state * encstate = (struct state *) c->encstate; + struct state * decstate = (struct state *) c->decstate; + + gsm_destroy(encstate->gsmstate); + gsm_destroy(decstate->gsmstate); + free(c->encstate); + free(c->decstate); + free(c); +} + + +static int decode ( struct iaxc_audio_codec *c, + int *inlen, unsigned char *in, int *outlen, short *out ) { + struct state * decstate = (struct state *) c->decstate; + + /* use generic interpolation */ + if(*inlen == 0) { + int interp_len = 160; + if(*outlen < interp_len) interp_len = *outlen; + plc_fillin(&decstate->plc,out,interp_len); + *outlen -= interp_len; + return 0; + } + + /* need to decode minimum of 33 bytes to 160 byte output */ + while( (*inlen >= 33) && (*outlen >= 160) ) { + if(gsm_decode(decstate->gsmstate, in, out)) + { + fprintf(stderr, "codec_gsm: gsm_decode returned error\n"); + return -1; + } + + /* push decoded data to interpolation buffer */ + plc_rx(&decstate->plc,out,160); + + /* we used 33 bytes of input, and 160 bytes of output */ + *inlen -= 33; + in += 33; + *outlen -= 160; + out += 160; + } + + return 0; +} + +static int encode ( struct iaxc_audio_codec *c, + int *inlen, short *in, int *outlen, unsigned char *out ) { + + struct state * encstate = (struct state *) c->encstate; + + + /* need to encode minimum of 160 bytes to 33 byte output */ + while( (*inlen >= 160) && (*outlen >= 33) ) { + gsm_encode(encstate->gsmstate, in, out); + + /* we used 160 bytes of input, and 33 bytes of output */ + *inlen -= 160; + in += 160; + *outlen -= 33; + out += 33; + } + + return 0; +} + +struct iaxc_audio_codec *codec_audio_gsm_new() { + + struct state * encstate; + struct state * decstate; + struct iaxc_audio_codec *c = (struct iaxc_audio_codec *)calloc(sizeof(struct iaxc_audio_codec),1); + + + if(!c) return c; + + strcpy(c->name,"gsm 06.10"); + c->format = IAXC_FORMAT_GSM; + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + c->minimum_frame_size = 160; + + c->encstate = calloc(sizeof(struct state),1); + c->decstate = calloc(sizeof(struct state),1); + + /* leaks a bit on no-memory */ + if(!(c->encstate && c->decstate)) + return NULL; + + encstate = (struct state *) c->encstate; + decstate = (struct state *) c->decstate; + + encstate->gsmstate = gsm_create(); + decstate->gsmstate = gsm_create(); + + if(!(encstate->gsmstate && decstate->gsmstate)) + return NULL; + + return c; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_gsm.h b/3rdparty/iaxclient-2/lib/codec_gsm.h new file mode 100644 index 0000000..2407066 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_gsm.h @@ -0,0 +1,15 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +struct iaxc_audio_codec *codec_audio_gsm_new(); diff --git a/3rdparty/iaxclient-2/lib/codec_ilbc.c b/3rdparty/iaxclient-2/lib/codec_ilbc.c new file mode 100644 index 0000000..a0da40b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ilbc.c @@ -0,0 +1,115 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "codec_ilbc.h" +#include "iaxclient_lib.h" +#include "iLBC/iLBC_encode.h" +#include "iLBC/iLBC_decode.h" + + +static void destroy ( struct iaxc_audio_codec *c) { + free(c->encstate); + free(c->decstate); + free(c); +} + + +static int decode ( struct iaxc_audio_codec *c, + int *inlen, char *in, int *outlen, short *out ) { + + float fbuf[240]; + int i; + + if(*inlen == 0) { + //fprintf(stderr, "ILBC Interpolate\n"); + iLBC_decode(fbuf, NULL, c->decstate, 0); + for(i=0;i<240;i++) + out[i] = fbuf[i]; + *outlen -= 240; + return 0; + } + + + /* need to decode minimum of 33 bytes to 160 byte output */ + if( (*inlen < 50) || (*outlen < 240) ) { + fprintf(stderr, "codec_ilbc: inlen = %d outlen= %d\n",*inlen,*outlen); + return -1; + } + + while( (*inlen >= 50) && (*outlen >= 240) ) { + iLBC_decode(fbuf, in, c->decstate, 1); + for(i=0;i<240;i++) + out[i] = fbuf[i]; + + out += 240; + *outlen -= 240; + in += 50; + *inlen -= 50; + } + + return 0; +} + +static int encode ( struct iaxc_audio_codec *c, + int *inlen, short *in, int *outlen, char *out ) { + + float fbuf[240]; + int i; + + while( (*inlen >= 240) && (*outlen >= 50) ) { + + for(i=0;i<240;i++) + fbuf[i] = in[i]; + + iLBC_encode(out,fbuf, c->encstate); + + out += 50; + *outlen -= 50; + in += 240; + *inlen -= 240; + } + + return 0; +} + +struct iaxc_audio_codec *codec_audio_ilbc_new() { + struct iaxc_audio_codec *c = calloc(sizeof(struct iaxc_audio_codec),1); + + + if(!c) return c; + + strcpy(c->name,"iLBC"); + c->format = IAXC_FORMAT_ILBC; + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + c->minimum_frame_size = 240; + + c->encstate = calloc(sizeof(iLBC_Enc_Inst_t),1); + c->decstate = calloc(sizeof(iLBC_Dec_Inst_t),1); + + /* leaks a bit on no-memory */ + if(!(c->encstate && c->decstate)) + return NULL; + + /* the 30 parameters are used for the latest iLBC sources, in + * http://www.ietf.org/internet-drafts/draft-ietf-avt-ilbc-codec-05.txt + * as used in asterisk-CVS as of 14 Oct 2004 */ + initEncode(c->encstate, 30); + initDecode(c->decstate, 30, 1); /* use enhancer */ + + return c; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_ilbc.h b/3rdparty/iaxclient-2/lib/codec_ilbc.h new file mode 100644 index 0000000..ee9889b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ilbc.h @@ -0,0 +1,15 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +struct iaxc_audio_codec *codec_audio_ilbc_new(); diff --git a/3rdparty/iaxclient-2/lib/codec_speex.c b/3rdparty/iaxclient-2/lib/codec_speex.c new file mode 100644 index 0000000..0a97149 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_speex.c @@ -0,0 +1,190 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2004, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "codec_speex.h" +#include "iaxclient_lib.h" +#include "speex/speex.h" + +struct State +{ + void *state; + int frame_size; + SpeexBits bits; +}; + + +static void destroy ( struct iaxc_audio_codec *c) +{ + struct State * encstate = (struct State *) c->encstate; + struct State * decstate = (struct State *) c->decstate; + + speex_bits_destroy(&encstate->bits); + speex_bits_destroy(&decstate->bits); + speex_encoder_destroy(encstate->state); + speex_decoder_destroy(decstate->state); + + free(c->encstate); + free(c->decstate); + + free(c); +} + + +static int decode( struct iaxc_audio_codec *c, + int *inlen, unsigned char *in, int *outlen, short *out ) +{ + struct State * decstate = (struct State *) c->decstate; + + if ( *inlen == 0 ) + { + speex_decode_int(decstate->state, NULL, out); + *outlen -= decstate->frame_size; + return 0; + } + + speex_bits_read_from(&decstate->bits, (char *) in, *inlen); + *inlen = 0; + + while ( speex_bits_remaining(&decstate->bits) && + *outlen >= decstate->frame_size ) + { + int ret = speex_decode_int(decstate->state, &decstate->bits, out); + + // from speex/speex.h, speex_decode returns: + // @return return status (0 for no error, -1 for end of stream, -2 other) + if (ret == 0) + { + /* one frame of output */ + *outlen -= decstate->frame_size; + out += decstate->frame_size; + } else if (ret == -1) + { + /* at end of stream, or just a terminator */ + int bits_left = speex_bits_remaining(&decstate->bits) % 8; + if(bits_left >= 5) + speex_bits_advance(&decstate->bits, bits_left); + else + break; + } else + { + /* maybe there's not a whole frame somehow? */ + fprintf(stderr, "decode_int returned non-zero => %d\n",ret); + break; + } + } + return 0; +} + +static int encode( struct iaxc_audio_codec *c, + int *inlen, short *in, int *outlen, unsigned char *out ) +{ + int bytes; + struct State * encstate = (struct State *) c->encstate; + + /* need to encode minimum of encstate->frame_size samples */ + + /* only add terminator at end of bits */ + speex_bits_reset(&encstate->bits); + + /* need to encode minimum of encstate->frame_size samples */ + while(*inlen >= encstate->frame_size) + { + //fprintf(stderr, "encode: inlen=%d outlen=%d\n", *inlen, *outlen); + speex_encode_int(encstate->state, in, &encstate->bits); + *inlen -= encstate->frame_size; + in += encstate->frame_size; + } + + /* add terminator */ + speex_bits_pack(&encstate->bits, 15, 5); + + bytes = speex_bits_write(&encstate->bits, (char *) out, *outlen); + + /* can an error happen here? no bytes? */ + *outlen -= bytes; + + return 0; +} + +struct iaxc_audio_codec *codec_audio_speex_new(struct iaxc_speex_settings *set) +{ + struct State * encstate; + struct State * decstate; + struct iaxc_audio_codec *c = (struct iaxc_audio_codec *)calloc(sizeof(struct iaxc_audio_codec),1); + const SpeexMode *sm; + + if(!c) + return c; + + strcpy(c->name,"speex"); + c->format = IAXC_FORMAT_SPEEX; + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + c->encstate = calloc(sizeof(struct State),1); + c->decstate = calloc(sizeof(struct State),1); + + /* leaks a bit on no-memory */ + if(!(c->encstate && c->decstate)) + return NULL; + + encstate = (struct State *) c->encstate; + decstate = (struct State *) c->decstate; + + sm = speex_lib_get_mode(SPEEX_MODEID_NB); + + encstate->state = speex_encoder_init(sm); + decstate->state = speex_decoder_init(sm); + speex_bits_init(&encstate->bits); + speex_bits_init(&decstate->bits); + speex_bits_reset(&encstate->bits); + speex_bits_reset(&decstate->bits); + + speex_decoder_ctl(decstate->state, SPEEX_SET_ENH, &set->decode_enhance); + + speex_encoder_ctl(encstate->state, SPEEX_SET_COMPLEXITY, &set->complexity); + + if(set->quality >= 0) { + if(set->vbr) { + speex_encoder_ctl(encstate->state, SPEEX_SET_VBR_QUALITY, &set->quality); + } else { + int quality = (int)set->quality; + speex_encoder_ctl(encstate->state, SPEEX_SET_QUALITY, &quality); + } + } + if(set->bitrate >= 0) + speex_encoder_ctl(encstate->state, SPEEX_SET_BITRATE, &set->bitrate); + if(set->vbr) + speex_encoder_ctl(encstate->state, SPEEX_SET_VBR, &set->vbr); + if(set->abr) + speex_encoder_ctl(encstate->state, SPEEX_SET_ABR, &set->abr); + + /* set up frame sizes (normally, this is 20ms worth) */ + speex_encoder_ctl(encstate->state,SPEEX_GET_FRAME_SIZE,&encstate->frame_size); + speex_decoder_ctl(decstate->state,SPEEX_GET_FRAME_SIZE,&decstate->frame_size); + + c->minimum_frame_size = 160; + + if(encstate->frame_size > c->minimum_frame_size) + c->minimum_frame_size = encstate->frame_size; + if(decstate->frame_size > c->minimum_frame_size) + c->minimum_frame_size = decstate->frame_size; + + if(!(encstate->state && decstate->state)) + return NULL; + + return c; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_speex.h b/3rdparty/iaxclient-2/lib/codec_speex.h new file mode 100644 index 0000000..72e5682 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_speex.h @@ -0,0 +1,26 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "speex/speex.h" + +struct iaxc_speex_settings { + int decode_enhance; + float quality; + int bitrate; + int vbr; + int abr; /* abr bitrate */ + int complexity; +}; + +struct iaxc_audio_codec *codec_audio_speex_new(struct iaxc_speex_settings *settings); diff --git a/3rdparty/iaxclient-2/lib/codec_theora.c b/3rdparty/iaxclient-2/lib/codec_theora.c new file mode 100644 index 0000000..cfa4e25 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_theora.c @@ -0,0 +1,502 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Mihai Balea + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +/* + * Some comments about Theora streaming + * Theora video codec has two problems when it comes to streaming + * and broadcasting video: + * + * - Large headers that need to be passed from the encoder to the decoder + * to initialize it. The conventional wisdom says we should transfer the + * headers out of band, but that complicates things with IAX, which does + * not have a separate signalling channel. Also, it makes things really + * difficult in a video conference scenario, where video gets switched + * between participants regularly. To solve this issue, we initialize + * the encoder and the decoder at the same time, using the headers from + * the local encoder to initialize the decoder. This works if the + * endpoints use the exact same version of Theora and the exact same + * parameters for initialization. + * + * - No support for splitting the frame into multiple slices. Frames can + * be relatively large. For a 320x240 video stream, you can see key + * frames larger than 9KB, which is the maximum UDP packet size on Mac + * OS X. To work around this limitation, we use the slice API to fragment + * encoded frames to a reasonable size that UDP can safely transport + * + * Other miscellaneous comments: + * + * - For quality reasons, when we detect a video stream switch, we reject all + * incoming frames until we receive a key frame. + * + * - Theora only accepts video that has dimensions multiple of 16. If we combine + * his with a 4:3 aspect ratio requirement, we get a very limited number + * of available resolutions. To work around this limitation, we pad the video + * on encoding, up to the closest multiple of 16. On the decoding side, we + * remove the padding. This way, video resolution can be any multiple of 2 + * + * We should probably look more into this (how to deal with missing and + * out of order slices) + */ + +#include +#include "iaxclient_lib.h" +#include "video.h" +#include "slice.h" +#include "codec_theora.h" +#include + +#define MAX_SLICE_SIZE 8000 + +struct theora_decoder +{ + theora_state td; + theora_info ti; + theora_comment tc; + struct deslicer_context *dsc; + int got_key_frame; +}; + +struct theora_encoder +{ + theora_state td; + theora_info ti; + theora_comment tc; + int needs_padding; + struct slicer_context *sc; + unsigned char *pad_buffer; +}; + +static void destroy( struct iaxc_video_codec *c) +{ + struct theora_encoder *e; + struct theora_decoder *d; + + if ( !c ) + return; + + if ( c->encstate ) + { + e = (struct theora_encoder *)c->encstate; + if ( e->pad_buffer ) + free(e->pad_buffer); + if ( e->sc ) + free_slicer_context(e->sc); + theora_comment_clear(&e->tc); + theora_info_clear(&e->ti); + theora_clear(&e->td); + free(e); + } + if ( c->decstate ) + { + d = (struct theora_decoder *)c->decstate; + if ( d->dsc ) + free_deslicer_context(d->dsc); + theora_comment_clear(&d->tc); + theora_info_clear(&d->ti); + theora_clear(&d->td); + free(c->decstate); + } + free(c); +} + +static int decode(struct iaxc_video_codec *c, int inlen, const char *in, + int *outlen, char *out) +{ + struct theora_decoder *d; + ogg_packet op; + yuv_buffer picture; + unsigned int line; + int my_out_len; + int w, h, ph; + int flen; + char *frame; + + // Sanity checks + if ( !c || !c->decstate || !in || inlen <= 0 || !out || !outlen ) + return -1; + + // Assemble slices + d = (struct theora_decoder *)c->decstate; + if ( !d->dsc ) + return -1; + + frame = deslice(in, inlen, &flen, d->dsc); + if ( frame == NULL ) + return 1; + + /* decode into an OP structure */ + memset(&op, 0, sizeof(op)); + op.bytes = flen; + op.packet = (unsigned char *)frame; + + /* reject all incoming frames until we get a key frame */ + if ( !d->got_key_frame ) + { + if ( theora_packet_iskeyframe(&op) ) + d->got_key_frame = 1; + else + return 1; + } + + if ( theora_decode_packetin(&d->td, &op) == OC_BADPACKET ) + { + fprintf(stderr, + "codec_theora: warning: theora_decode_packetin says bad packet\n"); + return -1; + } + + w = d->ti.frame_width; + h = d->ti.frame_height; + ph = d->ti.height; + + my_out_len = d->ti.frame_width * d->ti.frame_height * 3 / 2; + + /* make sure we have enough room for the goodies */ + if ( *outlen < my_out_len ) + { + fprintf(stderr, "codec_theora: not enough room for decoding\n"); + return -1; + } + + /* finally, here's where we get our goodies */ + if ( theora_decode_YUVout(&d->td, &picture) ) + { + fprintf(stderr, "codec_theora: error getting our goodies\n"); + return -1; + } + + //clear output + memset(out, 127, my_out_len); + + for( line = 0 ; line < d->ti.frame_height / 2 ; line++ ) + { + // Y-even + memcpy(out + picture.y_width * 2 * line, + picture.y + 2 * line * picture.y_stride, + picture.y_width); + // Y-odd + memcpy(out + picture.y_width * (2 * line + 1), + picture.y + (2 * line + 1) * picture.y_stride, + picture.y_width); + // U + V + memcpy(out + (d->ti.frame_width * d->ti.frame_height) + line * d->ti.frame_width / 2, + picture.u + line * picture.uv_stride, + picture.uv_width); + memcpy(out + (d->ti.frame_width * d->ti.frame_height * 5 / 4) + line * d->ti.frame_width / 2, + picture.v + line * picture.uv_stride, + picture.uv_width); + } + + *outlen = my_out_len; + + return 0; +} + +// Pads a w by h frame to bring it up to pw by ph size using value +static void pad_channel(const char *src, int w, int h, unsigned char *dst, + int pw, int ph, unsigned char value) +{ + int i; + + if ( w == pw ) + { + // We don't need to pad each line, just copy the data + memcpy(dst, src, w * h); + } else + { + // We DO need to pad each line + for ( i=0 ; iencstate || !in || !slice_set ) + return -1; + + e = (struct theora_encoder *)c->encstate; + + // Prepare the YUV buffer + if ( e->needs_padding ) + { + // We copy a padded image into the pad buffer and set up the pointers + // Use pad_channel for each of the YUV channels + // Use a pad value of 0 for luma and 128 for chroma + pad_channel(in, + e->ti.frame_width, + e->ti.frame_height, + e->pad_buffer, + e->ti.width, + e->ti.height, + 0); + + pad_channel(in + e->ti.frame_width * e->ti.frame_height, + e->ti.frame_width / 2, + e->ti.frame_height / 2, + e->pad_buffer + e->ti.width * e->ti.height, + e->ti.width / 2, + e->ti.height / 2, + 128); + + pad_channel(in + e->ti.frame_width * e->ti.frame_height * 5 / 4, + e->ti.frame_width / 2, + e->ti.frame_height / 2, + e->pad_buffer + e->ti.width * e->ti.height * 5 / 4, + e->ti.width / 2, + e->ti.height / 2, + 128); + + picture.y = e->pad_buffer; + } else + { + // use the original buffer + picture.y = (unsigned char *)in; + } + picture.u = picture.y + e->ti.width * e->ti.height; + picture.v = picture.u + e->ti.width * e->ti.height / 4; + picture.y_width = e->ti.width; + picture.y_height = e->ti.height; + picture.y_stride = e->ti.width; + picture.uv_width = e->ti.width / 2; + picture.uv_height = e->ti.height / 2; + picture.uv_stride = e->ti.width / 2; + + // Send data in for encoding + if ( theora_encode_YUVin(&e->td, &picture) ) + { + fprintf(stderr, "codec_theora: failed theora_encode_YUVin\n"); + return -1; + } + + // Get data from the encoder + if ( theora_encode_packetout(&e->td, 0, &op) != 1 ) + { + fprintf(stderr, "codec_theora: failed theora_encode_packetout\n"); + return -1; + } + + // Check to see if we have a key frame + slice_set->key_frame = theora_packet_iskeyframe(&op) == 1; + + // Slice the frame + slice((char *)op.packet, op.bytes, slice_set, e->sc); + + return 0; +} + +struct iaxc_video_codec *codec_video_theora_new(int format, int w, int h, + int framerate, int bitrate, int fragsize) +{ + struct iaxc_video_codec *c; + struct theora_encoder *e; + struct theora_decoder *d; + unsigned short source_id; + ogg_packet headerp, commentp, tablep; + + /* Basic sanity checks */ + if ( w <= 0 || h <= 0 || framerate <= 0 || bitrate <= 0 || fragsize <= 0 ) + { + fprintf(stderr, "codec_theora: bogus codec params: %d %d %d %d %d\n", + w, h, framerate, bitrate, fragsize); + return NULL; + } + + if ( w % 2 || h % 2 ) + { + fprintf(stderr, "codec_theora: video dimensions must be multiples of 2\n"); + return NULL; + } + + if ( fragsize > MAX_SLICE_SIZE ) + fragsize = MAX_SLICE_SIZE; + + c = (struct iaxc_video_codec *)calloc(sizeof(struct iaxc_video_codec), 1); + + if ( !c ) + goto bail; + + c->decstate = calloc(sizeof(struct theora_decoder), 1); + + if ( !c->decstate ) + goto bail; + + c->encstate = calloc(sizeof(struct theora_encoder), 1); + + if ( !c->encstate ) + goto bail; + + c->format = format; + c->width = w; + c->height = h; + c->framerate = framerate; + c->bitrate = bitrate; + c->fragsize = fragsize; + + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + e = (struct theora_encoder *)c->encstate; + d = (struct theora_decoder *)c->decstate; + + // Initialize slicer + // Generate random source id + srand((unsigned int)time(0)); + source_id = rand() & 0xffff; + e->sc = create_slicer_context(source_id, fragsize); + if ( !e->sc ) + goto bail; + + + /* set up some parameters in the contexts */ + + theora_info_init(&e->ti); + + /* set up common parameters */ + e->ti.frame_width = w; + e->ti.frame_height = h; + e->ti.width = ((w - 1) / 16 + 1) * 16; + e->ti.height = ((h - 1) / 16 + 1) * 16; + e->ti.offset_x = 0; + e->ti.offset_y = 0; + + // We set up a padded frame with dimensions that are multiple of 16 + // We allocate a buffer to hold this frame + e->needs_padding = e->ti.width != e->ti.frame_width || + e->ti.height != e->ti.frame_height; + + if ( e->needs_padding ) + { + e->pad_buffer = (unsigned char *) + malloc(e->ti.width * e->ti.height * 3 / 2); + + if ( !e->pad_buffer ) + goto bail; + } + else + { + e->pad_buffer = 0; + } + + e->ti.fps_numerator = framerate; + e->ti.fps_denominator = 1; + + e->ti.aspect_numerator = 1; + e->ti.aspect_denominator = 1; + + e->ti.colorspace = OC_CS_UNSPECIFIED; + e->ti.pixelformat = OC_PF_420; + + e->ti.target_bitrate = bitrate; + + e->ti.quality = 0; + + e->ti.dropframes_p = 0; + e->ti.quick_p = 1; + e->ti.keyframe_auto_p = 0; + e->ti.keyframe_frequency = framerate; + e->ti.keyframe_frequency_force = framerate; + e->ti.keyframe_data_target_bitrate = bitrate * 3; + e->ti.keyframe_auto_threshold = 80; + e->ti.keyframe_mindistance = 8; + e->ti.noise_sensitivity = 0; + + if ( theora_encode_init(&e->td, &e->ti) ) + goto bail; + + // Obtain the encoder headers and set up the decoder headers from + // data in the encoder headers + memset(&headerp, 0, sizeof(headerp)); + memset(&commentp, 0, sizeof(commentp)); + memset(&tablep, 0, sizeof(tablep)); + + // Set up the decoder using the encoder headers + theora_info_init(&d->ti); + theora_comment_init(&d->tc); + theora_comment_init(&e->tc); + + if ( theora_encode_header(&e->td, &headerp) ) + goto bail; + + headerp.b_o_s = 1; + + if ( theora_decode_header(&d->ti, &d->tc, &headerp) ) + goto bail; + + if ( theora_encode_comment(&e->tc, &commentp) ) + goto bail; + + if ( theora_decode_header(&d->ti, &d->tc, &commentp) ) + goto bail; + + theora_comment_clear(&e->tc); + + if ( theora_encode_tables(&e->td, &tablep) ) + goto bail; + + if ( theora_decode_header(&d->ti, &d->tc, &tablep) ) + goto bail; + + if ( theora_decode_init(&d->td, &d->ti) ) + goto bail; + + d->got_key_frame = 0; + + // Initialize deslicer context + d->dsc = create_deslicer_context(c->fragsize); + if ( !d->dsc ) + goto bail; + + strcpy(c->name, "Theora"); + return c; + +bail: + fprintf(stderr, "codec_theora: failed to initialize encoder or decoder\n"); + + if ( c ) + { + if ( c->encstate ) + { + e = (struct theora_encoder *)c->encstate; + if ( e->sc ) + free_slicer_context(e->sc); + free(c->encstate); + } + if ( c->decstate ) + { + d = (struct theora_decoder *)c->decstate; + if ( d->dsc ) + free_deslicer_context(d->dsc); + free(c->decstate); + } + free(c); + } + + return NULL; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_theora.h b/3rdparty/iaxclient-2/lib/codec_theora.h new file mode 100644 index 0000000..ddda931 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_theora.h @@ -0,0 +1,17 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Mihai Balea + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +struct iaxc_video_codec *codec_video_theora_new(int format, int w, int h, + int framerate, int bitrate, int fragsize); diff --git a/3rdparty/iaxclient-2/lib/codec_ulaw.c b/3rdparty/iaxclient-2/lib/codec_ulaw.c new file mode 100644 index 0000000..4910e0d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ulaw.c @@ -0,0 +1,152 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "codec_ulaw.h" +#include "iaxclient_lib.h" + +struct state { + plc_state_t plc; +}; + +static short ulaw_2lin [256]; +static unsigned char lin_2ulaw [16384]; +static int initialized=0; + +/* this looks similar to asterisk, but comes from public domain code by craig reese + I've just followed asterisk's table sizes for lin_2u, and also too lazy to do binary arith to decide which + iterations to skip -- this way we get the same result.. */ +static void initialize() { + int i; + + /* ulaw_2lin */ + for(i=0;i<256;i++) { + int b = ~i; + int exp_lut[8] = {0,132,396,924,1980,4092,8316,16764}; + int sign, exponent, mantissa, sample; + + sign = (b & 0x80); + exponent = (b >> 4) & 0x07; + mantissa = b & 0x0F; + sample = exp_lut[exponent] + (mantissa << (exponent + 3)); + if (sign != 0) sample = -sample; + ulaw_2lin[i] = sample; + } + + /* lin_2ulaw */ + for(i=-32767;i<32768;i+=4) { + int sample = i; + int exp_lut[256] = {0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, + 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, + 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, + 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}; + int sign, exponent, mantissa; + unsigned char ulawbyte; + + /* Get the sample into sign-magnitude. */ + sign = (sample >> 8) & 0x80; /* set aside the sign */ + if (sign != 0) sample = -sample; /* get magnitude */ + if (sample > 32635) sample = 32635; /* clip the magnitude */ + + /* Convert from 16 bit linear to ulaw. */ + sample = sample + 0x84; + exponent = exp_lut[(sample >> 7) & 0xFF]; + mantissa = (sample >> (exponent + 3)) & 0x0F; + ulawbyte = ~(sign | (exponent << 4) | mantissa); + if (ulawbyte == 0) ulawbyte = 0x02; /* optional CCITT trap */ + + lin_2ulaw[((unsigned short)i) >> 2] = ulawbyte; + } + + initialized = 1; +} + +static void destroy ( struct iaxc_audio_codec *c) { + if ( c->decstate ) + free(c->decstate); + free(c); +} + + +static int decode ( struct iaxc_audio_codec *c, + int *inlen, unsigned char *in, int *outlen, short *out ) { + struct state *state = (struct state *)c->decstate; + short *orig_out = out; + short sample; + + if(*inlen == 0) { + int interp_len = 160; + if(*outlen < interp_len) interp_len = *outlen; + plc_fillin(&state->plc,out,interp_len); + *outlen -= interp_len; + return 0; + } + + while ((*inlen > 0) && (*outlen > 0)) { + sample = ulaw_2lin[(unsigned char)*(in++)]; + *(out++) = sample; + (*inlen)--; (*outlen)--; + } + plc_rx(&state->plc, orig_out, (int)(out - orig_out)); + + return 0; +} + +static int encode ( struct iaxc_audio_codec *c, + int *inlen, short *in, int *outlen, unsigned char *out ) { + + while ((*inlen > 0) && (*outlen > 0)) { + *(out++) = lin_2ulaw[((unsigned short)*(in++)) >> 2]; + (*inlen)--; (*outlen)--; + } + + return 0; +} + + +struct iaxc_audio_codec *codec_audio_ulaw_new() { + + struct iaxc_audio_codec *c = (struct iaxc_audio_codec *)calloc(sizeof(struct iaxc_audio_codec),1); + + if(!c) return c; + + if(!initialized) initialize(); + + strcpy(c->name,"ulaw"); + c->format = IAXC_FORMAT_ULAW; + c->encode = encode; + c->decode = decode; + c->destroy = destroy; + + /* really, we can use less, but don't want to */ + c->minimum_frame_size = 160; + + /* decoder state, used for interpolation */ + c->decstate = calloc(sizeof(struct state),1); + plc_init(&((struct state *)c->decstate)->plc); + + return c; +} + diff --git a/3rdparty/iaxclient-2/lib/codec_ulaw.h b/3rdparty/iaxclient-2/lib/codec_ulaw.h new file mode 100644 index 0000000..26cf413 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/codec_ulaw.h @@ -0,0 +1,15 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +struct iaxc_audio_codec *codec_audio_ulaw_new(); diff --git a/3rdparty/iaxclient-2/lib/gsm/copyright b/3rdparty/iaxclient-2/lib/gsm/copyright new file mode 100644 index 0000000..eba0e52 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/copyright @@ -0,0 +1,16 @@ +Copyright 1992, 1993, 1994 by Jutta Degener and Carsten Bormann, +Technische Universitaet Berlin + +Any use of this software is permitted provided that this notice is not +removed and that neither the authors nor the Technische Universitaet Berlin +are deemed to have made any representations as to the suitability of this +software for any purpose nor are held responsible for any defects of +this software. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + +As a matter of courtesy, the authors request to be informed about uses +this software has found, about bugs in this software, and about any +improvements that may be of general interest. + +Berlin, 28.11.1994 +Jutta Degener +Carsten Bormann diff --git a/3rdparty/iaxclient-2/lib/gsm/inc/config.h b/3rdparty/iaxclient-2/lib/gsm/inc/config.h new file mode 100644 index 0000000..1fb3d70 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/inc/config.h @@ -0,0 +1,37 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/*$Header$*/ + +#ifndef CONFIG_H +#define CONFIG_H + +/*efine SIGHANDLER_T int / * signal handlers are void */ +/*efine HAS_SYSV_SIGNAL 1 / * sigs not blocked/reset? */ + +#define HAS_STDLIB_H 1 /* /usr/include/stdlib.h */ +/*efine HAS_LIMITS_H 1 / * /usr/include/limits.h */ +#define HAS_FCNTL_H 1 /* /usr/include/fcntl.h */ +/*efine HAS_ERRNO_DECL 1 / * errno.h declares errno */ + +#define HAS_FSTAT 1 /* fstat syscall */ +#define HAS_FCHMOD 1 /* fchmod syscall */ +#define HAS_CHMOD 1 /* chmod syscall */ +#define HAS_FCHOWN 1 /* fchown syscall */ +#define HAS_CHOWN 1 /* chown syscall */ +/*efine HAS__FSETMODE 1 / * _fsetmode -- set file mode */ + +#define HAS_STRING_H 1 /* /usr/include/string.h */ +/*efine HAS_STRINGS_H 1 / * /usr/include/strings.h */ + +#define HAS_UNISTD_H 1 /* /usr/include/unistd.h */ +#define HAS_UTIME 1 /* POSIX utime(path, times) */ +/*efine HAS_UTIMES 1 / * use utimes() syscall instead */ +#define HAS_UTIME_H 1 /* UTIME header file */ +/*efine HAS_UTIMBUF 1 / * struct utimbuf */ +/*efine HAS_UTIMEUSEC 1 / * microseconds in utimbuf? */ + +#endif /* CONFIG_H */ diff --git a/3rdparty/iaxclient-2/lib/gsm/inc/gsm.h b/3rdparty/iaxclient-2/lib/gsm/inc/gsm.h new file mode 100644 index 0000000..81065e5 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/inc/gsm.h @@ -0,0 +1,71 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/*$Header$*/ + +#ifndef GSM_H +#define GSM_H + +#ifdef __cplusplus +# define NeedFunctionPrototypes 1 +#endif + +#if __STDC__ +# define NeedFunctionPrototypes 1 +#endif + +#ifdef _NO_PROTO +# undef NeedFunctionPrototypes +#endif + +#ifdef NeedFunctionPrototypes +# include /* for FILE * */ +#endif + +#undef GSM_P +#if NeedFunctionPrototypes +# define GSM_P( protos ) protos +#else +# define GSM_P( protos ) ( /* protos */ ) +#endif + +/* + * Interface + */ + +typedef struct gsm_state * gsm; +typedef short gsm_signal; /* signed 16 bit */ +typedef unsigned char gsm_byte; +typedef gsm_byte gsm_frame[33]; /* 33 * 8 bits */ + +#define GSM_MAGIC 0xD /* 13 kbit/s RPE-LTP */ + +#define GSM_PATCHLEVEL 10 +#define GSM_MINOR 0 +#define GSM_MAJOR 1 + +#define GSM_OPT_VERBOSE 1 +#define GSM_OPT_FAST 2 +#define GSM_OPT_LTP_CUT 3 +#define GSM_OPT_WAV49 4 +#define GSM_OPT_FRAME_INDEX 5 +#define GSM_OPT_FRAME_CHAIN 6 + +extern gsm gsm_create GSM_P((void)); +extern void gsm_destroy GSM_P((gsm)); + +extern int gsm_print GSM_P((FILE *, gsm, gsm_byte *)); +extern int gsm_option GSM_P((gsm, int, int *)); + +extern void gsm_encode GSM_P((gsm, gsm_signal *, gsm_byte *)); +extern int gsm_decode GSM_P((gsm, gsm_byte *, gsm_signal *)); + +extern int gsm_explode GSM_P((gsm, gsm_byte *, gsm_signal *)); +extern void gsm_implode GSM_P((gsm, gsm_signal *, gsm_byte *)); + +#undef GSM_P + +#endif /* GSM_H */ diff --git a/3rdparty/iaxclient-2/lib/gsm/inc/private.h b/3rdparty/iaxclient-2/lib/gsm/inc/private.h new file mode 100644 index 0000000..19c14ce --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/inc/private.h @@ -0,0 +1,308 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/*$Header$*/ + +#ifndef PRIVATE_H +#define PRIVATE_H + +typedef short word; /* 16 bit signed int */ +typedef long longword; /* 32 bit signed int */ + +typedef unsigned short uword; /* unsigned word */ +typedef unsigned long ulongword; /* unsigned longword */ + +struct gsm_state { + + word dp0[ 280 ]; + + word z1; /* preprocessing.c, Offset_com. */ + longword L_z2; /* Offset_com. */ + int mp; /* Preemphasis */ + + word u[8]; /* short_term_aly_filter.c */ + word LARpp[2][8]; /* */ + word j; /* */ + + word ltp_cut; /* long_term.c, LTP crosscorr. */ + word nrp; /* 40 */ /* long_term.c, synthesis */ + word v[9]; /* short_term.c, synthesis */ + word msr; /* decoder.c, Postprocessing */ + + char verbose; /* only used if !NDEBUG */ + char fast; /* only used if FAST */ + + char wav_fmt; /* only used if WAV49 defined */ + unsigned char frame_index; /* odd/even chaining */ + unsigned char frame_chain; /* half-byte to carry forward */ +}; + + +#define MIN_WORD (-32767 - 1) +#define MAX_WORD 32767 + +#define MIN_LONGWORD (-2147483647 - 1) +#define MAX_LONGWORD 2147483647 + +#ifdef SASR /* flag: >> is a signed arithmetic shift right */ +#undef SASR +#define SASR(x, by) ((x) >> (by)) +#else +#define SASR(x, by) ((x) >= 0 ? (x) >> (by) : (~(-((x) + 1) >> (by)))) +#endif /* SASR */ + +#include "proto.h" + +/* + * Prototypes from add.c + */ +extern word gsm_mult P((word a, word b)); +extern longword gsm_L_mult P((word a, word b)); +extern word gsm_mult_r P((word a, word b)); + +extern word gsm_div P((word num, word denum)); + +extern word gsm_add P(( word a, word b )); +extern longword gsm_L_add P(( longword a, longword b )); + +extern word gsm_sub P((word a, word b)); +extern longword gsm_L_sub P((longword a, longword b)); + +extern word gsm_abs P((word a)); + +extern word gsm_norm P(( longword a )); + +extern longword gsm_L_asl P((longword a, int n)); +extern word gsm_asl P((word a, int n)); + +extern longword gsm_L_asr P((longword a, int n)); +extern word gsm_asr P((word a, int n)); + +/* + * Inlined functions from add.h + */ + +/* + * #define GSM_MULT_R(a, b) (* word a, word b, !(a == b == MIN_WORD) *) \ + * (0x0FFFF & SASR(((longword)(a) * (longword)(b) + 16384), 15)) + */ +#define GSM_MULT_R(a, b) /* word a, word b, !(a == b == MIN_WORD) */ \ + (SASR( ((longword)(a) * (longword)(b) + 16384), 15 )) + +# define GSM_MULT(a,b) /* word a, word b, !(a == b == MIN_WORD) */ \ + (SASR( ((longword)(a) * (longword)(b)), 15 )) + +# define GSM_L_MULT(a, b) /* word a, word b */ \ + (((longword)(a) * (longword)(b)) << 1) + +#if defined(__GNUC__) && defined(__i386__) + +static __inline__ int GSM_L_ADD(int a, int b) +{ + __asm__ __volatile__( + + "addl %2,%0; jno 0f; movl $0x7fffffff,%0; adcl $0,%0; 0:" + : "=r" (a) + : "0" (a), "ir" (b) + : "cc" + ); + return(a); +} + +static __inline__ short GSM_ADD(short a, short b) +{ + __asm__ __volatile__( + "addw %2,%0; jno 0f; movw $0x7fff,%0; adcw $0,%0; 0:" + : "=r" (a) + : "0" (a), "ir" (b) + : "cc" + ); + return(a); +} + +static __inline__ short GSM_SUB(short a, short b) +{ + __asm__ __volatile__( + "subw %2,%0; jno 0f; movw $0x7fff,%0; adcw $0,%0; 0:" + : "=r" (a) + : "0" (a), "ir" (b) + : "cc" + ); + return(a); +} + +#else + +# define GSM_L_ADD(a, b) \ + ( (a) < 0 ? ( (b) >= 0 ? (a) + (b) \ + : (utmp = (ulongword)-((a) + 1) + (ulongword)-((b) + 1)) \ + >= MAX_LONGWORD ? MIN_LONGWORD : -(longword)utmp-2 ) \ + : ((b) <= 0 ? (a) + (b) \ + : (utmp = (ulongword)(a) + (ulongword)(b)) >= MAX_LONGWORD \ + ? MAX_LONGWORD : utmp)) + +/* + * # define GSM_ADD(a, b) \ + * ((ltmp = (longword)(a) + (longword)(b)) >= MAX_WORD \ + * ? MAX_WORD : ltmp <= MIN_WORD ? MIN_WORD : ltmp) + */ +/* Nonportable, but faster: */ + +#define GSM_ADD(a, b) \ + (short) ((ulongword)((ltmp = (longword)(a) + (longword)(b)) - MIN_WORD) > \ + MAX_WORD - MIN_WORD ? (ltmp > 0 ? MAX_WORD : MIN_WORD) : ltmp) + +# define GSM_SUB(a, b) \ + ((ltmp = (longword)(a) - (longword)(b)) >= MAX_WORD \ + ? MAX_WORD : ltmp <= MIN_WORD ? MIN_WORD : ltmp) + +#endif + +# define GSM_ABS(a) ((a) < 0 ? ((a) == MIN_WORD ? MAX_WORD : -(a)) : (a)) + +/* Use these if necessary: + +# define GSM_MULT_R(a, b) gsm_mult_r(a, b) +# define GSM_MULT(a, b) gsm_mult(a, b) +# define GSM_L_MULT(a, b) gsm_L_mult(a, b) + +# define GSM_L_ADD(a, b) gsm_L_add(a, b) +# define GSM_ADD(a, b) gsm_add(a, b) +# define GSM_SUB(a, b) gsm_sub(a, b) + +# define GSM_ABS(a) gsm_abs(a) + +*/ + +/* + * More prototypes from implementations.. + */ +extern void Gsm_Coder P(( + struct gsm_state * S, + word * s, /* [0..159] samples IN */ + word * LARc, /* [0..7] LAR coefficients OUT */ + word * Nc, /* [0..3] LTP lag OUT */ + word * bc, /* [0..3] coded LTP gain OUT */ + word * Mc, /* [0..3] RPE grid selection OUT */ + word * xmaxc,/* [0..3] Coded maximum amplitude OUT */ + word * xMc /* [13*4] normalized RPE samples OUT */)); + +extern void Gsm_Long_Term_Predictor P(( /* 4x for 160 samples */ + struct gsm_state * S, + word * d, /* [0..39] residual signal IN */ + word * dp, /* [-120..-1] d' IN */ + word * e, /* [0..40] OUT */ + word * dpp, /* [0..40] OUT */ + word * Nc, /* correlation lag OUT */ + word * bc /* gain factor OUT */)); + +extern void Gsm_LPC_Analysis P(( + struct gsm_state * S, + word * s, /* 0..159 signals IN/OUT */ + word * LARc)); /* 0..7 LARc's OUT */ + +extern void Gsm_Preprocess P(( + struct gsm_state * S, + word * s, word * so)); + +extern void Gsm_Encoding P(( + struct gsm_state * S, + word * e, + word * ep, + word * xmaxc, + word * Mc, + word * xMc)); + +extern void Gsm_Short_Term_Analysis_Filter P(( + struct gsm_state * S, + word * LARc, /* coded log area ratio [0..7] IN */ + word * d /* st res. signal [0..159] IN/OUT */)); + +extern void Gsm_Decoder P(( + struct gsm_state * S, + word * LARcr, /* [0..7] IN */ + word * Ncr, /* [0..3] IN */ + word * bcr, /* [0..3] IN */ + word * Mcr, /* [0..3] IN */ + word * xmaxcr, /* [0..3] IN */ + word * xMcr, /* [0..13*4] IN */ + word * s)); /* [0..159] OUT */ + +extern void Gsm_Decoding P(( + struct gsm_state * S, + word xmaxcr, + word Mcr, + word * xMcr, /* [0..12] IN */ + word * erp)); /* [0..39] OUT */ + +extern void Gsm_Long_Term_Synthesis_Filtering P(( + struct gsm_state* S, + word Ncr, + word bcr, + word * erp, /* [0..39] IN */ + word * drp)); /* [-120..-1] IN, [0..40] OUT */ + +void Gsm_RPE_Decoding P(( + struct gsm_state *S, + word xmaxcr, + word Mcr, + word * xMcr, /* [0..12], 3 bits IN */ + word * erp)); /* [0..39] OUT */ + +void Gsm_RPE_Encoding P(( + struct gsm_state * S, + word * e, /* -5..-1][0..39][40..44 IN/OUT */ + word * xmaxc, /* OUT */ + word * Mc, /* OUT */ + word * xMc)); /* [0..12] OUT */ + +extern void Gsm_Short_Term_Synthesis_Filter P(( + struct gsm_state * S, + word * LARcr, /* log area ratios [0..7] IN */ + word * drp, /* received d [0...39] IN */ + word * s)); /* signal s [0..159] OUT */ + +extern void Gsm_Update_of_reconstructed_short_time_residual_signal P(( + word * dpp, /* [0...39] IN */ + word * ep, /* [0...39] IN */ + word * dp)); /* [-120...-1] IN/OUT */ + +/* + * Tables from table.c + */ +#ifndef GSM_TABLE_C + +extern word gsm_A[8], gsm_B[8], gsm_MIC[8], gsm_MAC[8]; +extern word gsm_INVA[8]; +extern word gsm_DLB[4], gsm_QLB[4]; +extern word gsm_H[11]; +extern word gsm_NRFAC[8]; +extern word gsm_FAC[8]; + +#endif /* GSM_TABLE_C */ + +/* + * Debugging + */ +#ifdef NDEBUG + +# define gsm_debug_words(a, b, c, d) /* nil */ +# define gsm_debug_longwords(a, b, c, d) /* nil */ +# define gsm_debug_word(a, b) /* nil */ +# define gsm_debug_longword(a, b) /* nil */ + +#else /* !NDEBUG => DEBUG */ + + extern void gsm_debug_words P((char * name, int, int, word *)); + extern void gsm_debug_longwords P((char * name, int, int, longword *)); + extern void gsm_debug_longword P((char * name, longword)); + extern void gsm_debug_word P((char * name, word)); + +#endif /* !NDEBUG */ + +#include "unproto.h" + +#endif /* PRIVATE_H */ diff --git a/3rdparty/iaxclient-2/lib/gsm/inc/proto.h b/3rdparty/iaxclient-2/lib/gsm/inc/proto.h new file mode 100644 index 0000000..87cf05e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/inc/proto.h @@ -0,0 +1,65 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/*$Header$*/ + +#ifndef PROTO_H +#define PROTO_H + +#if __cplusplus +# define NeedFunctionPrototypes 1 +#endif + +#if __STDC__ +# define NeedFunctionPrototypes 1 +#endif + +#ifdef _NO_PROTO +# undef NeedFunctionPrototypes +#endif + +#undef P /* gnu stdio.h actually defines this... */ +#undef P0 +#undef P1 +#undef P2 +#undef P3 +#undef P4 +#undef P5 +#undef P6 +#undef P7 +#undef P8 + +#if NeedFunctionPrototypes + +# define P( protos ) protos + +# define P0() (void) +# define P1(x, a) (a) +# define P2(x, a, b) (a, b) +# define P3(x, a, b, c) (a, b, c) +# define P4(x, a, b, c, d) (a, b, c, d) +# define P5(x, a, b, c, d, e) (a, b, c, d, e) +# define P6(x, a, b, c, d, e, f) (a, b, c, d, e, f) +# define P7(x, a, b, c, d, e, f, g) (a, b, c, d, e, f, g) +# define P8(x, a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h) + +#else /* !NeedFunctionPrototypes */ + +# define P( protos ) ( /* protos */ ) + +# define P0() () +# define P1(x, a) x a; +# define P2(x, a, b) x a; b; +# define P3(x, a, b, c) x a; b; c; +# define P4(x, a, b, c, d) x a; b; c; d; +# define P5(x, a, b, c, d, e) x a; b; c; d; e; +# define P6(x, a, b, c, d, e, f) x a; b; c; d; e; f; +# define P7(x, a, b, c, d, e, f, g) x a; b; c; d; e; f; g; +# define P8(x, a, b, c, d, e, f, g, h) x a; b; c; d; e; f; g; h; + +#endif /* !NeedFunctionPrototypes */ + +#endif /* PROTO_H */ diff --git a/3rdparty/iaxclient-2/lib/gsm/inc/unproto.h b/3rdparty/iaxclient-2/lib/gsm/inc/unproto.h new file mode 100644 index 0000000..ccd5651 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/inc/unproto.h @@ -0,0 +1,23 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/*$Header$*/ + +#ifdef PROTO_H /* sic */ +#undef PROTO_H + +#undef P +#undef P0 +#undef P1 +#undef P2 +#undef P3 +#undef P4 +#undef P5 +#undef P6 +#undef P7 +#undef P8 + +#endif /* PROTO_H */ diff --git a/3rdparty/iaxclient-2/lib/gsm/libgsm.prj b/3rdparty/iaxclient-2/lib/gsm/libgsm.prj new file mode 100644 index 0000000..f908e56 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/libgsm.prj @@ -0,0 +1,65 @@ +; Wedit project file. Syntax: Name = value +[libgsm] +PrjFiles=18 +File1=SRC\TABLE.C +File2=SRC\SHORT_TERM.C +File3=SRC\RPE.C +File4=SRC\PREPROCESS.C +File5=SRC\LPC.C +File6=SRC\LONG_TERM.C +File7=SRC\GSM_PRINT.C +File8=SRC\GSM_OPTION.C +File9=SRC\GSM_IMPLODE.C +File10=SRC\GSM_EXPLODE.C +File11=SRC\GSM_ENCODE.C +File12=SRC\GSM_DESTROY.C +File13=SRC\GSM_DECODE.C +File14=SRC\GSM_CREATE.C +File15=SRC\DECODE.C +File16=SRC\DEBUG.C +File17=SRC\CODE.C +File18=SRC\ADD.C +UserCount=1 +User1=ADMINISTRATOR +CmsDirectory=Z:\utils\tools\IAX\DLL\gsm\CMS +PutOptions=4 +GetOptions=0 +FileOptions=0 +LockOptions=1 +UsersOptions=1 +ProjectFlags=0 +ExtraCmsFilesCount=0 +File19=SRC\LPC.C +File20=SRC\PREPROCESS.C +File21=SRC\RPE.C +File22=SRC\SHORT_TERM.C +File23=SRC\TABLE.C +Frame=0 108 765 642 +StatusBar=0,0,0,0 +Name=libgsm +CurrentFile= +OpenFiles=0 +ProjectPath=Z:\UTILS\TOOLS\IAX\DLL\GSM +SourcesDir=Z:\utils\tools\IAX\DLL\gsm +Defines= +Includes=c:\programme\lcc\include;z:\utils\tools\iax\dll\gsm\inc +Libraries= +LinkerArgs= +ProjectTime=1218 +MakeName=c:\programme\lcc\bin\make.exe +MakeDir=Z:\utils\tools\IAX\DLL\gsm\lcc +Exe=z:\utils\tools\iax\dll\gsm\lcc\libgsm.lib +DebuggerArguments= +DbgExeName=z:\utils\tools\iax\dll\gsm\lcc\libgsm.lib +DbgDir=z:\utils\tools\iax\dll\gsm\lcc +CompilerFlags=1032 +FortranFlags=0 +EiffelFlags=0 +Useframework=0 +NumberOfBreakpoints=0 +ErrorFile= +NrOfFileProcessors=0 +UserName=ADMINISTRATOR +OpenFile1="z:\utils\tools\iax\dll\gsm\src\table.c" 18 146 204 820 391 +OpenFile2="c:\test\ax\gsm\src\code.c" 12 181 233 877 610 +File24=C:\PROGRAMME\LCC\LIB\LIBC.LIB diff --git a/3rdparty/iaxclient-2/lib/gsm/readme b/3rdparty/iaxclient-2/lib/gsm/readme new file mode 100644 index 0000000..cb6af85 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/readme @@ -0,0 +1,37 @@ + +GSM 06.10 13 kbit/s RPE/LTP speech compression available +-------------------------------------------------------- + +The Communications and Operating Systems Research Group (KBS) at the +Technische Universitaet Berlin is currently working on a set of +UNIX-based tools for computer-mediated telecooperation that will be +made freely available. + +As part of this effort we are publishing an implementation of the +European GSM 06.10 provisional standard for full-rate speech +transcoding, prI-ETS 300 036, which uses RPE/LTP (residual pulse +excitation/long term prediction) coding at 13 kbit/s. + +GSM 06.10 compresses frames of 160 13-bit samples (8 kHz sampling +rate, i.e. a frame rate of 50 Hz) into 260 bits; for compatibility +with typical UNIX applications, our implementation turns frames of 160 +16-bit linear samples into 33-byte frames (1650 Bytes/s). +The quality of the algorithm is good enough for reliable speaker +recognition; even music often survives transcoding in recognizable +form (given the bandwidth limitations of 8 kHz sampling rate). + +The interfaces offered are a front end modelled after compress(1), and +a library API. Compression and decompression run faster than realtime +on most SPARCstations. The implementation has been verified against the +ETSI standard test patterns. + +Jutta Degener (jutta@cs.tu-berlin.de) +Carsten Bormann (cabo@cs.tu-berlin.de) + +Communications and Operating Systems Research Group, TU Berlin +Fax: +49.30.31425156, Phone: +49.30.31424315 + +-- +Copyright 1992 by Jutta Degener and Carsten Bormann, Technische +Universitaet Berlin. See the accompanying file "COPYRIGHT" for +details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. diff --git a/3rdparty/iaxclient-2/lib/gsm/src/add.c b/3rdparty/iaxclient-2/lib/gsm/src/add.c new file mode 100644 index 0000000..d8a21c0 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/add.c @@ -0,0 +1,235 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +/* + * See private.h for the more commonly used macro versions. + */ + +#include +#include + +#include "private.h" +#include "gsm.h" +#include "proto.h" + +#define saturate(x) \ + ((x) < MIN_WORD ? MIN_WORD : (x) > MAX_WORD ? MAX_WORD: (x)) + +word gsm_add P2((a,b), word a, word b) +{ + longword sum = (longword)a + (longword)b; + return (word) saturate(sum); +} + +word gsm_sub P2((a,b), word a, word b) +{ + longword diff = (longword)a - (longword)b; + return (word) saturate(diff); +} + +word gsm_mult P2((a,b), word a, word b) +{ + if (a == MIN_WORD && b == MIN_WORD) return MAX_WORD; + else return SASR( (longword)a * (longword)b, 15 ); +} + +word gsm_mult_r P2((a,b), word a, word b) +{ + if (b == MIN_WORD && a == MIN_WORD) return MAX_WORD; + else { + longword prod = (longword)a * (longword)b + 16384; + prod >>= 15; + return prod & 0xFFFF; + } +} + +word gsm_abs P1((a), word a) +{ + return a < 0 ? (a == MIN_WORD ? MAX_WORD : -a) : a; +} + +longword gsm_L_mult P2((a,b),word a, word b) +{ + assert( a != MIN_WORD || b != MIN_WORD ); + return ((longword)a * (longword)b) << 1; +} + +longword gsm_L_add P2((a,b), longword a, longword b) +{ + if (a < 0) { + if (b >= 0) return a + b; + else { + ulongword A = (ulongword)-(a + 1) + (ulongword)-(b + 1); + return A >= MAX_LONGWORD ? MIN_LONGWORD :-(longword)A-2; + } + } + else if (b <= 0) return a + b; + else { + ulongword A = (ulongword)a + (ulongword)b; + return A > MAX_LONGWORD ? MAX_LONGWORD : A; + } +} + +longword gsm_L_sub P2((a,b), longword a, longword b) +{ + if (a >= 0) { + if (b >= 0) return a - b; + else { + /* a>=0, b<0 */ + + ulongword A = (ulongword)a + -(b + 1); + return A >= MAX_LONGWORD ? MAX_LONGWORD : (A + 1); + } + } + else if (b <= 0) return a - b; + else { + /* a<0, b>0 */ + + ulongword A = (ulongword)-(a + 1) + b; + return A >= MAX_LONGWORD ? MIN_LONGWORD : -(longword)A - 1; + } +} + +static unsigned char const bitoff[ 256 ] = { + 8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, + 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, + 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 +}; + +word gsm_norm P1((a), longword a ) +/* + * the number of left shifts needed to normalize the 32 bit + * variable L_var1 for positive values on the interval + * + * with minimum of + * minimum of 1073741824 (01000000000000000000000000000000) and + * maximum of 2147483647 (01111111111111111111111111111111) + * + * + * and for negative values on the interval with + * minimum of -2147483648 (-10000000000000000000000000000000) and + * maximum of -1073741824 ( -1000000000000000000000000000000). + * + * in order to normalize the result, the following + * operation must be done: L_norm_var1 = L_var1 << norm( L_var1 ); + * + * (That's 'ffs', only from the left, not the right..) + */ +{ + assert(a != 0); + + if (a < 0) { + if (a <= -1073741824) return 0; + a = ~a; + } + + return a & 0xffff0000 + ? ( a & 0xff000000 + ? -1 + bitoff[ 0xFF & (a >> 24) ] + : 7 + bitoff[ 0xFF & (a >> 16) ] ) + : ( a & 0xff00 + ? 15 + bitoff[ 0xFF & (a >> 8) ] + : 23 + bitoff[ 0xFF & a ] ); +} + +longword gsm_L_asl P2((a,n), longword a, int n) +{ + if (n >= 32) return 0; + if (n <= -32) return -(a < 0); + if (n < 0) return gsm_L_asr(a, -n); + return a << n; +} + +word gsm_asl P2((a,n), word a, int n) +{ + if (n >= 16) return 0; + if (n <= -16) return -(a < 0); + if (n < 0) return gsm_asr(a, -n); + return a << n; +} + +longword gsm_L_asr P2((a,n), longword a, int n) +{ + if (n >= 32) return -(a < 0); + if (n <= -32) return 0; + if (n < 0) return a << -n; + +# ifdef SASR + return a >> n; +# else + if (a >= 0) return a >> n; + else return -(longword)( -(ulongword)a >> n ); +# endif +} + +word gsm_asr P2((a,n), word a, int n) +{ + if (n >= 16) return -(a < 0); + if (n <= -16) return 0; + if (n < 0) return a << -n; + +# ifdef SASR + return a >> n; +# else + if (a >= 0) return a >> n; + else return -(word)( -(uword)a >> n ); +# endif +} + +/* + * (From p. 46, end of section 4.2.5) + * + * NOTE: The following lines gives [sic] one correct implementation + * of the div(num, denum) arithmetic operation. Compute div + * which is the integer division of num by denum: with denum + * >= num > 0 + */ + +word gsm_div P2((num,denum), word num, word denum) +{ + longword L_num = num; + longword L_denum = denum; + word div = 0; + int k = 15; + + /* The parameter num sometimes becomes zero. + * Although this is explicitly guarded against in 4.2.5, + * we assume that the result should then be zero as well. + */ + + /* assert(num != 0); */ + + assert(num >= 0 && denum >= num); + if (num == 0) + return 0; + + while (k--) { + div <<= 1; + L_num <<= 1; + + if (L_num >= L_denum) { + L_num -= L_denum; + div++; + } + } + + return div; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/code.c b/3rdparty/iaxclient-2/lib/gsm/src/code.c new file mode 100644 index 0000000..98ad884 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/code.c @@ -0,0 +1,100 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "config.h" + + +//#ifdef HAS_STDLIB_H +#include +//#else +# include "proto.h" +# include "string.h" + //extern char * memcpy P((char *, char *, int)); +//#endif + +#include "private.h" +#include "gsm.h" +#include "proto.h" + +/* + * 4.2 FIXED POINT IMPLEMENTATION OF THE RPE-LTP CODER + */ + +void Gsm_Coder P8((S,s,LARc,Nc,bc,Mc,xmaxc,xMc), + + struct gsm_state * S, + + word * s, /* [0..159] samples IN */ + +/* + * The RPE-LTD coder works on a frame by frame basis. The length of + * the frame is equal to 160 samples. Some computations are done + * once per frame to produce at the output of the coder the + * LARc[1..8] parameters which are the coded LAR coefficients and + * also to realize the inverse filtering operation for the entire + * frame (160 samples of signal d[0..159]). These parts produce at + * the output of the coder: + */ + + word * LARc, /* [0..7] LAR coefficients OUT */ + +/* + * Procedure 4.2.11 to 4.2.18 are to be executed four times per + * frame. That means once for each sub-segment RPE-LTP analysis of + * 40 samples. These parts produce at the output of the coder: + */ + + word * Nc, /* [0..3] LTP lag OUT */ + word * bc, /* [0..3] coded LTP gain OUT */ + word * Mc, /* [0..3] RPE grid selection OUT */ + word * xmaxc,/* [0..3] Coded maximum amplitude OUT */ + word * xMc /* [13*4] normalized RPE samples OUT */ +) +{ + int k; + word * dp = S->dp0 + 120; /* [ -120...-1 ] */ + word * dpp = dp; /* [ 0...39 ] */ + + static word e[50]; + + word so[160]; + + Gsm_Preprocess (S, s, so); + Gsm_LPC_Analysis (S, so, LARc); + Gsm_Short_Term_Analysis_Filter (S, LARc, so); + + for (k = 0; k <= 3; k++, xMc += 13) { + + Gsm_Long_Term_Predictor ( S, + so+k*40, /* d [0..39] IN */ + dp, /* dp [-120..-1] IN */ + e + 5, /* e [0..39] OUT */ + dpp, /* dpp [0..39] OUT */ + Nc++, + bc++); + + Gsm_RPE_Encoding ( S, + e + 5, /* e ][0..39][ IN/OUT */ + xmaxc++, Mc++, xMc ); + /* + * Gsm_Update_of_reconstructed_short_time_residual_signal + * ( dpp, e + 5, dp ); + */ + + { register int i; + register longword ltmp; + for (i = 0; i <= 39; i++) + dp[ i ] = GSM_ADD( e[5 + i], dpp[i] ); + } + dp += 40; + dpp += 40; + + } + (void)memcpy( (char *)S->dp0, (char *)(S->dp0 + 160), + 120 * sizeof(*S->dp0) ); +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/debug.c b/3rdparty/iaxclient-2/lib/gsm/src/debug.c new file mode 100644 index 0000000..22dfa80 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/debug.c @@ -0,0 +1,76 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" + +#ifndef NDEBUG + +/* If NDEBUG _is_ defined and no debugging should be performed, + * calls to functions in this module are #defined to nothing + * in private.h. + */ + +#include +#include "proto.h" + +void gsm_debug_words P4( (name, from, to, ptr), + char * name, + int from, + int to, + word * ptr) +{ + int nprinted = 0; + + fprintf( stderr, "%s [%d .. %d]: ", name, from, to ); + while (from <= to) { + fprintf(stderr, "%d ", ptr[ from ] ); + from++; + if (nprinted++ >= 7) { + nprinted = 0; + if (from < to) putc('\n', stderr); + } + } + putc('\n', stderr); +} + +void gsm_debug_longwords P4( (name, from, to, ptr), + char * name, + int from, + int to, + longword * ptr) +{ + int nprinted = 0; + + fprintf( stderr, "%s [%d .. %d]: ", name, from, to ); + while (from <= to) { + + fprintf(stderr, "%d ", ptr[ from ] ); + from++; + if (nprinted++ >= 7) { + nprinted = 0; + if (from < to) putc('\n', stderr); + } + } + putc('\n', stderr); +} + +void gsm_debug_longword P2( (name, value), + char * name, + longword value ) +{ + fprintf(stderr, "%s: %d\n", name, (long)value ); +} + +void gsm_debug_word P2( (name, value), + char * name, + word value ) +{ + fprintf(stderr, "%s: %d\n", name, (long)value); +} + +#endif diff --git a/3rdparty/iaxclient-2/lib/gsm/src/decode.c b/3rdparty/iaxclient-2/lib/gsm/src/decode.c new file mode 100644 index 0000000..34e5586 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/decode.c @@ -0,0 +1,63 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include + +#include "private.h" +#include "gsm.h" +#include "proto.h" + +/* + * 4.3 FIXED POINT IMPLEMENTATION OF THE RPE-LTP DECODER + */ + +static void Postprocessing P2((S,s), + struct gsm_state * S, + register word * s) +{ + register int k; + register word msr = S->msr; + register longword ltmp; /* for GSM_ADD */ + register word tmp; + + for (k = 160; k--; s++) { + tmp = GSM_MULT_R( msr, 28180 ); + msr = GSM_ADD(*s, tmp); /* Deemphasis */ + *s = GSM_ADD(msr, msr) & 0xFFF8; /* Truncation & Upscaling */ + } + S->msr = msr; +} + +void Gsm_Decoder P8((S,LARcr, Ncr,bcr,Mcr,xmaxcr,xMcr,s), + struct gsm_state * S, + + word * LARcr, /* [0..7] IN */ + + word * Ncr, /* [0..3] IN */ + word * bcr, /* [0..3] IN */ + word * Mcr, /* [0..3] IN */ + word * xmaxcr, /* [0..3] IN */ + word * xMcr, /* [0..13*4] IN */ + + word * s) /* [0..159] OUT */ +{ + int j, k; + word erp[40], wt[160]; + word * drp = S->dp0 + 120; + + for (j=0; j <= 3; j++, xmaxcr++, bcr++, Ncr++, Mcr++, xMcr += 13) { + + Gsm_RPE_Decoding( S, *xmaxcr, *Mcr, xMcr, erp ); + Gsm_Long_Term_Synthesis_Filtering( S, *Ncr, *bcr, erp, drp ); + + for (k = 0; k <= 39; k++) wt[ j * 40 + k ] = drp[ k ]; + } + + Gsm_Short_Term_Synthesis_Filter( S, LARcr, wt, s ); + Postprocessing(S, s); +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_create.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_create.c new file mode 100644 index 0000000..a59aa2f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_create.c @@ -0,0 +1,45 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +static char const ident[] = "$Header$"; + +#include "config.h" + +#ifdef HAS_STRING_H +#include +#else +# include "proto.h" + extern char * memset P((char *, int, int)); +#endif + +#ifdef HAS_STDLIB_H +# include +#else +# ifdef HAS_MALLOC_H +# include +# else + extern char * malloc(); +# endif +#endif + +#include + +#include "gsm.h" +#include "private.h" +#include "proto.h" + +gsm gsm_create P0() +{ + gsm r; + + r = (gsm)malloc(sizeof(struct gsm_state)); + if (!r) return r; + + memset((char *)r, 0, sizeof(*r)); + r->nrp = 40; + + return r; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_decode.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_decode.c new file mode 100644 index 0000000..7318ba2 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_decode.c @@ -0,0 +1,361 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +int gsm_decode P3((s, c, target), gsm s, gsm_byte * c, gsm_signal * target) +{ + word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; + +#ifdef WAV49 + if (s->wav_fmt) { + + uword sr = 0; + + s->frame_index = !s->frame_index; + if (s->frame_index) { + + sr = *c++; + LARc[0] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 2; + LARc[1] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 4; + LARc[2] = sr & 0x1f; sr >>= 5; + LARc[3] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 2; + LARc[4] = sr & 0xf; sr >>= 4; + LARc[5] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; /* 5 */ + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[0] = sr & 0x7f; sr >>= 7; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[0] = sr & 0x3f; sr >>= 6; + xmc[0] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[1] = sr & 0x7; sr >>= 3; + xmc[2] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + xmc[5] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 10 */ + xmc[6] = sr & 0x7; sr >>= 3; + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[9] = sr & 0x7; sr >>= 3; + xmc[10] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[1] = sr & 0x7f; sr >>= 7; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[1] = sr & 0x3f; sr >>= 6; + xmc[13] = sr & 0x7; sr >>= 3; + sr = *c++; /* 15 */ + xmc[14] = sr & 0x7; sr >>= 3; + xmc[15] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + xmc[18] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[19] = sr & 0x7; sr >>= 3; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[22] = sr & 0x7; sr >>= 3; + xmc[23] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; /* 20 */ + Nc[2] = sr & 0x7f; sr >>= 7; + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[2] = sr & 0x3f; sr >>= 6; + xmc[26] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[27] = sr & 0x7; sr >>= 3; + xmc[28] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + xmc[31] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[32] = sr & 0x7; sr >>= 3; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + sr = *c++; /* 25 */ + xmc[35] = sr & 0x7; sr >>= 3; + xmc[36] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[3] = sr & 0x7f; sr >>= 7; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[3] = sr & 0x3f; sr >>= 6; + xmc[39] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[40] = sr & 0x7; sr >>= 3; + xmc[41] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 30 */ + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + xmc[44] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[45] = sr & 0x7; sr >>= 3; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[48] = sr & 0x7; sr >>= 3; + xmc[49] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + + s->frame_chain = sr & 0xf; + } + else { + sr = s->frame_chain; + sr |= (uword)*c++ << 4; /* 1 */ + LARc[0] = sr & 0x3f; sr >>= 6; + LARc[1] = sr & 0x3f; sr >>= 6; + sr = *c++; + LARc[2] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 3; + LARc[3] = sr & 0x1f; sr >>= 5; + LARc[4] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; + LARc[5] = sr & 0xf; sr >>= 4; + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr = *c++; /* 5 */ + Nc[0] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[0] = sr & 0x3f; sr >>= 6; + xmc[0] = sr & 0x7; sr >>= 3; + xmc[1] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[2] = sr & 0x7; sr >>= 3; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[5] = sr & 0x7; sr >>= 3; + xmc[6] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 10 */ + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + xmc[9] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[10] = sr & 0x7; sr >>= 3; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[1] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[1] = sr & 0x3f; sr >>= 6; + xmc[13] = sr & 0x7; sr >>= 3; + xmc[14] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 15 */ + xmc[15] = sr & 0x7; sr >>= 3; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[18] = sr & 0x7; sr >>= 3; + xmc[19] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + xmc[22] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[23] = sr & 0x7; sr >>= 3; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[2] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; /* 20 */ + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[2] = sr & 0x3f; sr >>= 6; + xmc[26] = sr & 0x7; sr >>= 3; + xmc[27] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[28] = sr & 0x7; sr >>= 3; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[31] = sr & 0x7; sr >>= 3; + xmc[32] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + xmc[35] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 25 */ + xmc[36] = sr & 0x7; sr >>= 3; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[3] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[3] = sr & 0x3f; sr >>= 6; + xmc[39] = sr & 0x7; sr >>= 3; + xmc[40] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[41] = sr & 0x7; sr >>= 3; + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + sr = *c++; /* 30 */ + xmc[44] = sr & 0x7; sr >>= 3; + xmc[45] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + xmc[48] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[49] = sr & 0x7; sr >>= 3; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + } + } + else +#endif + { + /* GSM_MAGIC = (*c >> 4) & 0xF; */ + + if (((*c >> 4) & 0x0F) != GSM_MAGIC) return -1; + + LARc[0] = (*c++ & 0xF) << 2; /* 1 */ + LARc[0] |= (*c >> 6) & 0x3; + LARc[1] = *c++ & 0x3F; + LARc[2] = (*c >> 3) & 0x1F; + LARc[3] = (*c++ & 0x7) << 2; + LARc[3] |= (*c >> 6) & 0x3; + LARc[4] = (*c >> 2) & 0xF; + LARc[5] = (*c++ & 0x3) << 2; + LARc[5] |= (*c >> 6) & 0x3; + LARc[6] = (*c >> 3) & 0x7; + LARc[7] = *c++ & 0x7; + Nc[0] = (*c >> 1) & 0x7F; + bc[0] = (*c++ & 0x1) << 1; + bc[0] |= (*c >> 7) & 0x1; + Mc[0] = (*c >> 5) & 0x3; + xmaxc[0] = (*c++ & 0x1F) << 1; + xmaxc[0] |= (*c >> 7) & 0x1; + xmc[0] = (*c >> 4) & 0x7; + xmc[1] = (*c >> 1) & 0x7; + xmc[2] = (*c++ & 0x1) << 2; + xmc[2] |= (*c >> 6) & 0x3; + xmc[3] = (*c >> 3) & 0x7; + xmc[4] = *c++ & 0x7; + xmc[5] = (*c >> 5) & 0x7; + xmc[6] = (*c >> 2) & 0x7; + xmc[7] = (*c++ & 0x3) << 1; /* 10 */ + xmc[7] |= (*c >> 7) & 0x1; + xmc[8] = (*c >> 4) & 0x7; + xmc[9] = (*c >> 1) & 0x7; + xmc[10] = (*c++ & 0x1) << 2; + xmc[10] |= (*c >> 6) & 0x3; + xmc[11] = (*c >> 3) & 0x7; + xmc[12] = *c++ & 0x7; + Nc[1] = (*c >> 1) & 0x7F; + bc[1] = (*c++ & 0x1) << 1; + bc[1] |= (*c >> 7) & 0x1; + Mc[1] = (*c >> 5) & 0x3; + xmaxc[1] = (*c++ & 0x1F) << 1; + xmaxc[1] |= (*c >> 7) & 0x1; + xmc[13] = (*c >> 4) & 0x7; + xmc[14] = (*c >> 1) & 0x7; + xmc[15] = (*c++ & 0x1) << 2; + xmc[15] |= (*c >> 6) & 0x3; + xmc[16] = (*c >> 3) & 0x7; + xmc[17] = *c++ & 0x7; + xmc[18] = (*c >> 5) & 0x7; + xmc[19] = (*c >> 2) & 0x7; + xmc[20] = (*c++ & 0x3) << 1; + xmc[20] |= (*c >> 7) & 0x1; + xmc[21] = (*c >> 4) & 0x7; + xmc[22] = (*c >> 1) & 0x7; + xmc[23] = (*c++ & 0x1) << 2; + xmc[23] |= (*c >> 6) & 0x3; + xmc[24] = (*c >> 3) & 0x7; + xmc[25] = *c++ & 0x7; + Nc[2] = (*c >> 1) & 0x7F; + bc[2] = (*c++ & 0x1) << 1; /* 20 */ + bc[2] |= (*c >> 7) & 0x1; + Mc[2] = (*c >> 5) & 0x3; + xmaxc[2] = (*c++ & 0x1F) << 1; + xmaxc[2] |= (*c >> 7) & 0x1; + xmc[26] = (*c >> 4) & 0x7; + xmc[27] = (*c >> 1) & 0x7; + xmc[28] = (*c++ & 0x1) << 2; + xmc[28] |= (*c >> 6) & 0x3; + xmc[29] = (*c >> 3) & 0x7; + xmc[30] = *c++ & 0x7; + xmc[31] = (*c >> 5) & 0x7; + xmc[32] = (*c >> 2) & 0x7; + xmc[33] = (*c++ & 0x3) << 1; + xmc[33] |= (*c >> 7) & 0x1; + xmc[34] = (*c >> 4) & 0x7; + xmc[35] = (*c >> 1) & 0x7; + xmc[36] = (*c++ & 0x1) << 2; + xmc[36] |= (*c >> 6) & 0x3; + xmc[37] = (*c >> 3) & 0x7; + xmc[38] = *c++ & 0x7; + Nc[3] = (*c >> 1) & 0x7F; + bc[3] = (*c++ & 0x1) << 1; + bc[3] |= (*c >> 7) & 0x1; + Mc[3] = (*c >> 5) & 0x3; + xmaxc[3] = (*c++ & 0x1F) << 1; + xmaxc[3] |= (*c >> 7) & 0x1; + xmc[39] = (*c >> 4) & 0x7; + xmc[40] = (*c >> 1) & 0x7; + xmc[41] = (*c++ & 0x1) << 2; + xmc[41] |= (*c >> 6) & 0x3; + xmc[42] = (*c >> 3) & 0x7; + xmc[43] = *c++ & 0x7; /* 30 */ + xmc[44] = (*c >> 5) & 0x7; + xmc[45] = (*c >> 2) & 0x7; + xmc[46] = (*c++ & 0x3) << 1; + xmc[46] |= (*c >> 7) & 0x1; + xmc[47] = (*c >> 4) & 0x7; + xmc[48] = (*c >> 1) & 0x7; + xmc[49] = (*c++ & 0x1) << 2; + xmc[49] |= (*c >> 6) & 0x3; + xmc[50] = (*c >> 3) & 0x7; + xmc[51] = *c & 0x7; /* 33 */ + } + + Gsm_Decoder(s, LARc, Nc, bc, Mc, xmaxc, xmc, target); + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_destroy.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_destroy.c new file mode 100644 index 0000000..4807c0a --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_destroy.c @@ -0,0 +1,26 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "gsm.h" +#include "config.h" +#include "proto.h" + +#ifdef HAS_STDLIB_H +# include +#else +# ifdef HAS_MALLOC_H +# include +# else + extern void free(); +# endif +#endif + +void gsm_destroy P1((S), gsm S) +{ + if (S) free((char *)S); +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_encode.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_encode.c new file mode 100644 index 0000000..6233830 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_encode.c @@ -0,0 +1,451 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" +#include "gsm.h" +#include "proto.h" + +void gsm_encode P3((s, source, c), gsm s, gsm_signal * source, gsm_byte * c) +{ + word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; + + Gsm_Coder(s, source, LARc, Nc, bc, Mc, xmaxc, xmc); + + + /* variable size + + GSM_MAGIC 4 + + LARc[0] 6 + LARc[1] 6 + LARc[2] 5 + LARc[3] 5 + LARc[4] 4 + LARc[5] 4 + LARc[6] 3 + LARc[7] 3 + + Nc[0] 7 + bc[0] 2 + Mc[0] 2 + xmaxc[0] 6 + xmc[0] 3 + xmc[1] 3 + xmc[2] 3 + xmc[3] 3 + xmc[4] 3 + xmc[5] 3 + xmc[6] 3 + xmc[7] 3 + xmc[8] 3 + xmc[9] 3 + xmc[10] 3 + xmc[11] 3 + xmc[12] 3 + + Nc[1] 7 + bc[1] 2 + Mc[1] 2 + xmaxc[1] 6 + xmc[13] 3 + xmc[14] 3 + xmc[15] 3 + xmc[16] 3 + xmc[17] 3 + xmc[18] 3 + xmc[19] 3 + xmc[20] 3 + xmc[21] 3 + xmc[22] 3 + xmc[23] 3 + xmc[24] 3 + xmc[25] 3 + + Nc[2] 7 + bc[2] 2 + Mc[2] 2 + xmaxc[2] 6 + xmc[26] 3 + xmc[27] 3 + xmc[28] 3 + xmc[29] 3 + xmc[30] 3 + xmc[31] 3 + xmc[32] 3 + xmc[33] 3 + xmc[34] 3 + xmc[35] 3 + xmc[36] 3 + xmc[37] 3 + xmc[38] 3 + + Nc[3] 7 + bc[3] 2 + Mc[3] 2 + xmaxc[3] 6 + xmc[39] 3 + xmc[40] 3 + xmc[41] 3 + xmc[42] 3 + xmc[43] 3 + xmc[44] 3 + xmc[45] 3 + xmc[46] 3 + xmc[47] 3 + xmc[48] 3 + xmc[49] 3 + xmc[50] 3 + xmc[51] 3 + */ + +#ifdef WAV49 + + if (s->wav_fmt) { + s->frame_index = !s->frame_index; + if (s->frame_index) { + + uword sr; + + sr = 0; + sr = sr >> 6 | LARc[0] << 10; + sr = sr >> 6 | LARc[1] << 10; + *c++ = sr >> 4; + sr = sr >> 5 | LARc[2] << 11; + *c++ = sr >> 7; + sr = sr >> 5 | LARc[3] << 11; + sr = sr >> 4 | LARc[4] << 12; + *c++ = sr >> 6; + sr = sr >> 4 | LARc[5] << 12; + sr = sr >> 3 | LARc[6] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | LARc[7] << 13; + sr = sr >> 7 | Nc[0] << 9; + *c++ = sr >> 5; + sr = sr >> 2 | bc[0] << 14; + sr = sr >> 2 | Mc[0] << 14; + sr = sr >> 6 | xmaxc[0] << 10; + *c++ = sr >> 3; + sr = sr >> 3 | xmc[0] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[1] << 13; + sr = sr >> 3 | xmc[2] << 13; + sr = sr >> 3 | xmc[3] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[4] << 13; + sr = sr >> 3 | xmc[5] << 13; + sr = sr >> 3 | xmc[6] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[7] << 13; + sr = sr >> 3 | xmc[8] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[9] << 13; + sr = sr >> 3 | xmc[10] << 13; + sr = sr >> 3 | xmc[11] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[12] << 13; + sr = sr >> 7 | Nc[1] << 9; + *c++ = sr >> 5; + sr = sr >> 2 | bc[1] << 14; + sr = sr >> 2 | Mc[1] << 14; + sr = sr >> 6 | xmaxc[1] << 10; + *c++ = sr >> 3; + sr = sr >> 3 | xmc[13] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[14] << 13; + sr = sr >> 3 | xmc[15] << 13; + sr = sr >> 3 | xmc[16] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[17] << 13; + sr = sr >> 3 | xmc[18] << 13; + sr = sr >> 3 | xmc[19] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[20] << 13; + sr = sr >> 3 | xmc[21] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[22] << 13; + sr = sr >> 3 | xmc[23] << 13; + sr = sr >> 3 | xmc[24] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[25] << 13; + sr = sr >> 7 | Nc[2] << 9; + *c++ = sr >> 5; + sr = sr >> 2 | bc[2] << 14; + sr = sr >> 2 | Mc[2] << 14; + sr = sr >> 6 | xmaxc[2] << 10; + *c++ = sr >> 3; + sr = sr >> 3 | xmc[26] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[27] << 13; + sr = sr >> 3 | xmc[28] << 13; + sr = sr >> 3 | xmc[29] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[30] << 13; + sr = sr >> 3 | xmc[31] << 13; + sr = sr >> 3 | xmc[32] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[33] << 13; + sr = sr >> 3 | xmc[34] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[35] << 13; + sr = sr >> 3 | xmc[36] << 13; + sr = sr >> 3 | xmc[37] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[38] << 13; + sr = sr >> 7 | Nc[3] << 9; + *c++ = sr >> 5; + sr = sr >> 2 | bc[3] << 14; + sr = sr >> 2 | Mc[3] << 14; + sr = sr >> 6 | xmaxc[3] << 10; + *c++ = sr >> 3; + sr = sr >> 3 | xmc[39] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[40] << 13; + sr = sr >> 3 | xmc[41] << 13; + sr = sr >> 3 | xmc[42] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[43] << 13; + sr = sr >> 3 | xmc[44] << 13; + sr = sr >> 3 | xmc[45] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[46] << 13; + sr = sr >> 3 | xmc[47] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[48] << 13; + sr = sr >> 3 | xmc[49] << 13; + sr = sr >> 3 | xmc[50] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[51] << 13; + sr = sr >> 4; + *c = sr >> 8; + s->frame_chain = *c; + } + else { + uword sr; + + sr = 0; + sr = sr >> 4 | s->frame_chain << 12; + sr = sr >> 6 | LARc[0] << 10; + *c++ = sr >> 6; + sr = sr >> 6 | LARc[1] << 10; + *c++ = sr >> 8; + sr = sr >> 5 | LARc[2] << 11; + sr = sr >> 5 | LARc[3] << 11; + *c++ = sr >> 6; + sr = sr >> 4 | LARc[4] << 12; + sr = sr >> 4 | LARc[5] << 12; + *c++ = sr >> 6; + sr = sr >> 3 | LARc[6] << 13; + sr = sr >> 3 | LARc[7] << 13; + *c++ = sr >> 8; + sr = sr >> 7 | Nc[0] << 9; + sr = sr >> 2 | bc[0] << 14; + *c++ = sr >> 7; + sr = sr >> 2 | Mc[0] << 14; + sr = sr >> 6 | xmaxc[0] << 10; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[0] << 13; + sr = sr >> 3 | xmc[1] << 13; + sr = sr >> 3 | xmc[2] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[3] << 13; + sr = sr >> 3 | xmc[4] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[5] << 13; + sr = sr >> 3 | xmc[6] << 13; + sr = sr >> 3 | xmc[7] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[8] << 13; + sr = sr >> 3 | xmc[9] << 13; + sr = sr >> 3 | xmc[10] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[11] << 13; + sr = sr >> 3 | xmc[12] << 13; + *c++ = sr >> 8; + sr = sr >> 7 | Nc[1] << 9; + sr = sr >> 2 | bc[1] << 14; + *c++ = sr >> 7; + sr = sr >> 2 | Mc[1] << 14; + sr = sr >> 6 | xmaxc[1] << 10; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[13] << 13; + sr = sr >> 3 | xmc[14] << 13; + sr = sr >> 3 | xmc[15] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[16] << 13; + sr = sr >> 3 | xmc[17] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[18] << 13; + sr = sr >> 3 | xmc[19] << 13; + sr = sr >> 3 | xmc[20] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[21] << 13; + sr = sr >> 3 | xmc[22] << 13; + sr = sr >> 3 | xmc[23] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[24] << 13; + sr = sr >> 3 | xmc[25] << 13; + *c++ = sr >> 8; + sr = sr >> 7 | Nc[2] << 9; + sr = sr >> 2 | bc[2] << 14; + *c++ = sr >> 7; + sr = sr >> 2 | Mc[2] << 14; + sr = sr >> 6 | xmaxc[2] << 10; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[26] << 13; + sr = sr >> 3 | xmc[27] << 13; + sr = sr >> 3 | xmc[28] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[29] << 13; + sr = sr >> 3 | xmc[30] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[31] << 13; + sr = sr >> 3 | xmc[32] << 13; + sr = sr >> 3 | xmc[33] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[34] << 13; + sr = sr >> 3 | xmc[35] << 13; + sr = sr >> 3 | xmc[36] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[37] << 13; + sr = sr >> 3 | xmc[38] << 13; + *c++ = sr >> 8; + sr = sr >> 7 | Nc[3] << 9; + sr = sr >> 2 | bc[3] << 14; + *c++ = sr >> 7; + sr = sr >> 2 | Mc[3] << 14; + sr = sr >> 6 | xmaxc[3] << 10; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[39] << 13; + sr = sr >> 3 | xmc[40] << 13; + sr = sr >> 3 | xmc[41] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[42] << 13; + sr = sr >> 3 | xmc[43] << 13; + *c++ = sr >> 8; + sr = sr >> 3 | xmc[44] << 13; + sr = sr >> 3 | xmc[45] << 13; + sr = sr >> 3 | xmc[46] << 13; + *c++ = sr >> 7; + sr = sr >> 3 | xmc[47] << 13; + sr = sr >> 3 | xmc[48] << 13; + sr = sr >> 3 | xmc[49] << 13; + *c++ = sr >> 6; + sr = sr >> 3 | xmc[50] << 13; + sr = sr >> 3 | xmc[51] << 13; + *c++ = sr >> 8; + } + } + + else + +#endif /* WAV49 */ + { + + *c++ = ((GSM_MAGIC & 0xF) << 4) /* 1 */ + | ((LARc[0] >> 2) & 0xF); + *c++ = ((LARc[0] & 0x3) << 6) + | (LARc[1] & 0x3F); + *c++ = ((LARc[2] & 0x1F) << 3) + | ((LARc[3] >> 2) & 0x7); + *c++ = ((LARc[3] & 0x3) << 6) + | ((LARc[4] & 0xF) << 2) + | ((LARc[5] >> 2) & 0x3); + *c++ = ((LARc[5] & 0x3) << 6) + | ((LARc[6] & 0x7) << 3) + | (LARc[7] & 0x7); + *c++ = ((Nc[0] & 0x7F) << 1) + | ((bc[0] >> 1) & 0x1); + *c++ = ((bc[0] & 0x1) << 7) + | ((Mc[0] & 0x3) << 5) + | ((xmaxc[0] >> 1) & 0x1F); + *c++ = ((xmaxc[0] & 0x1) << 7) + | ((xmc[0] & 0x7) << 4) + | ((xmc[1] & 0x7) << 1) + | ((xmc[2] >> 2) & 0x1); + *c++ = ((xmc[2] & 0x3) << 6) + | ((xmc[3] & 0x7) << 3) + | (xmc[4] & 0x7); + *c++ = ((xmc[5] & 0x7) << 5) /* 10 */ + | ((xmc[6] & 0x7) << 2) + | ((xmc[7] >> 1) & 0x3); + *c++ = ((xmc[7] & 0x1) << 7) + | ((xmc[8] & 0x7) << 4) + | ((xmc[9] & 0x7) << 1) + | ((xmc[10] >> 2) & 0x1); + *c++ = ((xmc[10] & 0x3) << 6) + | ((xmc[11] & 0x7) << 3) + | (xmc[12] & 0x7); + *c++ = ((Nc[1] & 0x7F) << 1) + | ((bc[1] >> 1) & 0x1); + *c++ = ((bc[1] & 0x1) << 7) + | ((Mc[1] & 0x3) << 5) + | ((xmaxc[1] >> 1) & 0x1F); + *c++ = ((xmaxc[1] & 0x1) << 7) + | ((xmc[13] & 0x7) << 4) + | ((xmc[14] & 0x7) << 1) + | ((xmc[15] >> 2) & 0x1); + *c++ = ((xmc[15] & 0x3) << 6) + | ((xmc[16] & 0x7) << 3) + | (xmc[17] & 0x7); + *c++ = ((xmc[18] & 0x7) << 5) + | ((xmc[19] & 0x7) << 2) + | ((xmc[20] >> 1) & 0x3); + *c++ = ((xmc[20] & 0x1) << 7) + | ((xmc[21] & 0x7) << 4) + | ((xmc[22] & 0x7) << 1) + | ((xmc[23] >> 2) & 0x1); + *c++ = ((xmc[23] & 0x3) << 6) + | ((xmc[24] & 0x7) << 3) + | (xmc[25] & 0x7); + *c++ = ((Nc[2] & 0x7F) << 1) /* 20 */ + | ((bc[2] >> 1) & 0x1); + *c++ = ((bc[2] & 0x1) << 7) + | ((Mc[2] & 0x3) << 5) + | ((xmaxc[2] >> 1) & 0x1F); + *c++ = ((xmaxc[2] & 0x1) << 7) + | ((xmc[26] & 0x7) << 4) + | ((xmc[27] & 0x7) << 1) + | ((xmc[28] >> 2) & 0x1); + *c++ = ((xmc[28] & 0x3) << 6) + | ((xmc[29] & 0x7) << 3) + | (xmc[30] & 0x7); + *c++ = ((xmc[31] & 0x7) << 5) + | ((xmc[32] & 0x7) << 2) + | ((xmc[33] >> 1) & 0x3); + *c++ = ((xmc[33] & 0x1) << 7) + | ((xmc[34] & 0x7) << 4) + | ((xmc[35] & 0x7) << 1) + | ((xmc[36] >> 2) & 0x1); + *c++ = ((xmc[36] & 0x3) << 6) + | ((xmc[37] & 0x7) << 3) + | (xmc[38] & 0x7); + *c++ = ((Nc[3] & 0x7F) << 1) + | ((bc[3] >> 1) & 0x1); + *c++ = ((bc[3] & 0x1) << 7) + | ((Mc[3] & 0x3) << 5) + | ((xmaxc[3] >> 1) & 0x1F); + *c++ = ((xmaxc[3] & 0x1) << 7) + | ((xmc[39] & 0x7) << 4) + | ((xmc[40] & 0x7) << 1) + | ((xmc[41] >> 2) & 0x1); + *c++ = ((xmc[41] & 0x3) << 6) /* 30 */ + | ((xmc[42] & 0x7) << 3) + | (xmc[43] & 0x7); + *c++ = ((xmc[44] & 0x7) << 5) + | ((xmc[45] & 0x7) << 2) + | ((xmc[46] >> 1) & 0x3); + *c++ = ((xmc[46] & 0x1) << 7) + | ((xmc[47] & 0x7) << 4) + | ((xmc[48] & 0x7) << 1) + | ((xmc[49] >> 2) & 0x1); + *c++ = ((xmc[49] & 0x3) << 6) + | ((xmc[50] & 0x7) << 3) + | (xmc[51] & 0x7); + + } +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_explode.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_explode.c new file mode 100644 index 0000000..a906fc2 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_explode.c @@ -0,0 +1,417 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" +#include "gsm.h" +#include "proto.h" + +int gsm_explode P3((s, c, target), gsm s, gsm_byte * c, gsm_signal * target) +{ +# define LARc target +# define Nc *((gsm_signal (*) [17])(target + 8)) +# define bc *((gsm_signal (*) [17])(target + 9)) +# define Mc *((gsm_signal (*) [17])(target + 10)) +# define xmaxc *((gsm_signal (*) [17])(target + 11)) + + +#ifdef WAV49 + if (s->wav_fmt) { + + uword sr = 0; + + if (s->frame_index == 1) { + + sr = *c++; + LARc[0] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 2; + LARc[1] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 4; + LARc[2] = sr & 0x1f; sr >>= 5; + LARc[3] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 2; + LARc[4] = sr & 0xf; sr >>= 4; + LARc[5] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; /* 5 */ + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[0] = sr & 0x7f; sr >>= 7; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[0] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 12) + xmc[0] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[1] = sr & 0x7; sr >>= 3; + xmc[2] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + xmc[5] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 10 */ + xmc[6] = sr & 0x7; sr >>= 3; + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[9] = sr & 0x7; sr >>= 3; + xmc[10] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[1] = sr & 0x7f; sr >>= 7; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[1] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 29 - 13) + + xmc[13] = sr & 0x7; sr >>= 3; + sr = *c++; /* 15 */ + xmc[14] = sr & 0x7; sr >>= 3; + xmc[15] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + xmc[18] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[19] = sr & 0x7; sr >>= 3; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[22] = sr & 0x7; sr >>= 3; + xmc[23] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; /* 20 */ + Nc[2] = sr & 0x7f; sr >>= 7; + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[2] = sr & 0x3f; sr >>= 6; + +#undef xmc +#define xmc (target + 46 - 26) + + xmc[26] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[27] = sr & 0x7; sr >>= 3; + xmc[28] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + xmc[31] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[32] = sr & 0x7; sr >>= 3; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + sr = *c++; /* 25 */ + xmc[35] = sr & 0x7; sr >>= 3; + xmc[36] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[3] = sr & 0x7f; sr >>= 7; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[3] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 63 - 39) + + xmc[39] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[40] = sr & 0x7; sr >>= 3; + xmc[41] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 30 */ + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + xmc[44] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[45] = sr & 0x7; sr >>= 3; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[48] = sr & 0x7; sr >>= 3; + xmc[49] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + + s->frame_chain = sr & 0xf; + } + else { + sr = s->frame_chain; + sr |= (uword)*c++ << 4; /* 1 */ + LARc[0] = sr & 0x3f; sr >>= 6; + LARc[1] = sr & 0x3f; sr >>= 6; + sr = *c++; + LARc[2] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 3; + LARc[3] = sr & 0x1f; sr >>= 5; + LARc[4] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; + LARc[5] = sr & 0xf; sr >>= 4; + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr = *c++; /* 5 */ + Nc[0] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[0] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 12) + xmc[0] = sr & 0x7; sr >>= 3; + xmc[1] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[2] = sr & 0x7; sr >>= 3; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[5] = sr & 0x7; sr >>= 3; + xmc[6] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 10 */ + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + xmc[9] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[10] = sr & 0x7; sr >>= 3; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[1] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[1] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 29 - 13) + + xmc[13] = sr & 0x7; sr >>= 3; + xmc[14] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 15 */ + xmc[15] = sr & 0x7; sr >>= 3; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[18] = sr & 0x7; sr >>= 3; + xmc[19] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + xmc[22] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[23] = sr & 0x7; sr >>= 3; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[2] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; /* 20 */ + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[2] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (target + 46 - 26) + xmc[26] = sr & 0x7; sr >>= 3; + xmc[27] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[28] = sr & 0x7; sr >>= 3; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[31] = sr & 0x7; sr >>= 3; + xmc[32] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + xmc[35] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 25 */ + xmc[36] = sr & 0x7; sr >>= 3; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[3] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[3] = sr & 0x3f; sr >>= 6; + +#undef xmc +#define xmc (target + 63 - 39) + + xmc[39] = sr & 0x7; sr >>= 3; + xmc[40] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[41] = sr & 0x7; sr >>= 3; + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + sr = *c++; /* 30 */ + xmc[44] = sr & 0x7; sr >>= 3; + xmc[45] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + xmc[48] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[49] = sr & 0x7; sr >>= 3; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + } + } + else +#endif + { + /* GSM_MAGIC = (*c >> 4) & 0xF; */ + + if (((*c >> 4) & 0x0F) != GSM_MAGIC) return -1; + + LARc[0] = (*c++ & 0xF) << 2; /* 1 */ + LARc[0] |= (*c >> 6) & 0x3; + LARc[1] = *c++ & 0x3F; + LARc[2] = (*c >> 3) & 0x1F; + LARc[3] = (*c++ & 0x7) << 2; + LARc[3] |= (*c >> 6) & 0x3; + LARc[4] = (*c >> 2) & 0xF; + LARc[5] = (*c++ & 0x3) << 2; + LARc[5] |= (*c >> 6) & 0x3; + LARc[6] = (*c >> 3) & 0x7; + LARc[7] = *c++ & 0x7; + + Nc[0] = (*c >> 1) & 0x7F; + + bc[0] = (*c++ & 0x1) << 1; + bc[0] |= (*c >> 7) & 0x1; + + Mc[0] = (*c >> 5) & 0x3; + + xmaxc[0] = (*c++ & 0x1F) << 1; + xmaxc[0] |= (*c >> 7) & 0x1; + +#undef xmc +#define xmc (target + 12) + + xmc[0] = (*c >> 4) & 0x7; + xmc[1] = (*c >> 1) & 0x7; + xmc[2] = (*c++ & 0x1) << 2; + xmc[2] |= (*c >> 6) & 0x3; + xmc[3] = (*c >> 3) & 0x7; + xmc[4] = *c++ & 0x7; + xmc[5] = (*c >> 5) & 0x7; + xmc[6] = (*c >> 2) & 0x7; + xmc[7] = (*c++ & 0x3) << 1; /* 10 */ + xmc[7] |= (*c >> 7) & 0x1; + xmc[8] = (*c >> 4) & 0x7; + xmc[9] = (*c >> 1) & 0x7; + xmc[10] = (*c++ & 0x1) << 2; + xmc[10] |= (*c >> 6) & 0x3; + xmc[11] = (*c >> 3) & 0x7; + xmc[12] = *c++ & 0x7; + + Nc[1] = (*c >> 1) & 0x7F; + + bc[1] = (*c++ & 0x1) << 1; + bc[1] |= (*c >> 7) & 0x1; + + Mc[1] = (*c >> 5) & 0x3; + + xmaxc[1] = (*c++ & 0x1F) << 1; + xmaxc[1] |= (*c >> 7) & 0x1; + +#undef xmc +#define xmc (target + 29 - 13) + + xmc[13] = (*c >> 4) & 0x7; + xmc[14] = (*c >> 1) & 0x7; + xmc[15] = (*c++ & 0x1) << 2; + xmc[15] |= (*c >> 6) & 0x3; + xmc[16] = (*c >> 3) & 0x7; + xmc[17] = *c++ & 0x7; + xmc[18] = (*c >> 5) & 0x7; + xmc[19] = (*c >> 2) & 0x7; + xmc[20] = (*c++ & 0x3) << 1; + xmc[20] |= (*c >> 7) & 0x1; + xmc[21] = (*c >> 4) & 0x7; + xmc[22] = (*c >> 1) & 0x7; + xmc[23] = (*c++ & 0x1) << 2; + xmc[23] |= (*c >> 6) & 0x3; + xmc[24] = (*c >> 3) & 0x7; + xmc[25] = *c++ & 0x7; + + Nc[2] = (*c >> 1) & 0x7F; + + bc[2] = (*c++ & 0x1) << 1; /* 20 */ + bc[2] |= (*c >> 7) & 0x1; + + Mc[2] = (*c >> 5) & 0x3; + + xmaxc[2] = (*c++ & 0x1F) << 1; + xmaxc[2] |= (*c >> 7) & 0x1; + +#undef xmc +#define xmc (target + 46 - 26) + + xmc[26] = (*c >> 4) & 0x7; + xmc[27] = (*c >> 1) & 0x7; + xmc[28] = (*c++ & 0x1) << 2; + xmc[28] |= (*c >> 6) & 0x3; + xmc[29] = (*c >> 3) & 0x7; + xmc[30] = *c++ & 0x7; + xmc[31] = (*c >> 5) & 0x7; + xmc[32] = (*c >> 2) & 0x7; + xmc[33] = (*c++ & 0x3) << 1; + xmc[33] |= (*c >> 7) & 0x1; + xmc[34] = (*c >> 4) & 0x7; + xmc[35] = (*c >> 1) & 0x7; + xmc[36] = (*c++ & 0x1) << 2; + xmc[36] |= (*c >> 6) & 0x3; + xmc[37] = (*c >> 3) & 0x7; + xmc[38] = *c++ & 0x7; + + Nc[3] = (*c >> 1) & 0x7F; + + bc[3] = (*c++ & 0x1) << 1; + bc[3] |= (*c >> 7) & 0x1; + + Mc[3] = (*c >> 5) & 0x3; + + xmaxc[3] = (*c++ & 0x1F) << 1; + xmaxc[3] |= (*c >> 7) & 0x1; + +#undef xmc +#define xmc (target + 63 - 39) + + xmc[39] = (*c >> 4) & 0x7; + xmc[40] = (*c >> 1) & 0x7; + xmc[41] = (*c++ & 0x1) << 2; + xmc[41] |= (*c >> 6) & 0x3; + xmc[42] = (*c >> 3) & 0x7; + xmc[43] = *c++ & 0x7; /* 30 */ + xmc[44] = (*c >> 5) & 0x7; + xmc[45] = (*c >> 2) & 0x7; + xmc[46] = (*c++ & 0x3) << 1; + xmc[46] |= (*c >> 7) & 0x1; + xmc[47] = (*c >> 4) & 0x7; + xmc[48] = (*c >> 1) & 0x7; + xmc[49] = (*c++ & 0x1) << 2; + xmc[49] |= (*c >> 6) & 0x3; + xmc[50] = (*c >> 3) & 0x7; + xmc[51] = *c & 0x7; /* 33 */ + } + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_implode.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_implode.c new file mode 100644 index 0000000..453b8cf --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_implode.c @@ -0,0 +1,515 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +void gsm_implode P3((s, source, c), gsm s, gsm_signal * source, gsm_byte * c) +{ + /* variable size index + + GSM_MAGIC 4 - + + LARc[0] 6 0 + LARc[1] 6 1 + LARc[2] 5 2 + LARc[3] 5 3 + LARc[4] 4 4 + LARc[5] 4 5 + LARc[6] 3 6 + LARc[7] 3 7 + + Nc[0] 7 8 + bc[0] 2 9 + Mc[0] 2 10 + xmaxc[0] 6 11 + xmc[0] 3 12 + xmc[1] 3 13 + xmc[2] 3 14 + xmc[3] 3 15 + xmc[4] 3 16 + xmc[5] 3 17 + xmc[6] 3 18 + xmc[7] 3 19 + xmc[8] 3 20 + xmc[9] 3 21 + xmc[10] 3 22 + xmc[11] 3 23 + xmc[12] 3 24 + + Nc[1] 7 25 + bc[1] 2 26 + Mc[1] 2 27 + xmaxc[1] 6 28 + xmc[13] 3 29 + xmc[14] 3 30 + xmc[15] 3 31 + xmc[16] 3 32 + xmc[17] 3 33 + xmc[18] 3 34 + xmc[19] 3 35 + xmc[20] 3 36 + xmc[21] 3 37 + xmc[22] 3 38 + xmc[23] 3 39 + xmc[24] 3 40 + xmc[25] 3 41 + + Nc[2] 7 42 + bc[2] 2 43 + Mc[2] 2 44 + xmaxc[2] 6 45 + xmc[26] 3 46 + xmc[27] 3 47 + xmc[28] 3 48 + xmc[29] 3 49 + xmc[30] 3 50 + xmc[31] 3 51 + xmc[32] 3 52 + xmc[33] 3 53 + xmc[34] 3 54 + xmc[35] 3 55 + xmc[36] 3 56 + xmc[37] 3 57 + xmc[38] 3 58 + + Nc[3] 7 59 + bc[3] 2 60 + Mc[3] 2 61 + xmaxc[3] 6 62 + xmc[39] 3 63 + xmc[40] 3 64 + xmc[41] 3 65 + xmc[42] 3 66 + xmc[43] 3 67 + xmc[44] 3 68 + xmc[45] 3 69 + xmc[46] 3 70 + xmc[47] 3 71 + xmc[48] 3 72 + xmc[49] 3 73 + xmc[50] 3 74 + xmc[51] 3 75 + */ + + /* There are 76 parameters per frame. The first eight are + * unique. The remaining 68 are four identical subframes of + * 17 parameters each. gsm_implode converts from a representation + * of these parameters as values in one array of signed words + * to the "packed" version of a GSM frame. + */ + +# define LARc source +# define Nc *((gsm_signal (*) [17])(source + 8)) +# define bc *((gsm_signal (*) [17])(source + 9)) +# define Mc *((gsm_signal (*) [17])(source + 10)) +# define xmaxc *((gsm_signal (*) [17])(source + 11)) + +#ifdef WAV49 + if (s->wav_fmt) { + + uword sr = 0; + if (s->frame_index == 0) { + + sr = *c++; + LARc[0] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 2; + LARc[1] = sr & 0x3f; sr >>= 6; + sr |= (uword)*c++ << 4; + LARc[2] = sr & 0x1f; sr >>= 5; + LARc[3] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 2; + LARc[4] = sr & 0xf; sr >>= 4; + LARc[5] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; /* 5 */ + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[0] = sr & 0x7f; sr >>= 7; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[0] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 12) + xmc[0] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[1] = sr & 0x7; sr >>= 3; + xmc[2] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + xmc[5] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 10 */ + xmc[6] = sr & 0x7; sr >>= 3; + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[9] = sr & 0x7; sr >>= 3; + xmc[10] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[1] = sr & 0x7f; sr >>= 7; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[1] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 29 - 13) + xmc[13] = sr & 0x7; sr >>= 3; + sr = *c++; /* 15 */ + xmc[14] = sr & 0x7; sr >>= 3; + xmc[15] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + xmc[18] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[19] = sr & 0x7; sr >>= 3; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[22] = sr & 0x7; sr >>= 3; + xmc[23] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; /* 20 */ + Nc[2] = sr & 0x7f; sr >>= 7; + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[2] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 46 - 26) + xmc[26] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[27] = sr & 0x7; sr >>= 3; + xmc[28] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + xmc[31] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[32] = sr & 0x7; sr >>= 3; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + sr = *c++; /* 25 */ + xmc[35] = sr & 0x7; sr >>= 3; + xmc[36] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 4; + Nc[3] = sr & 0x7f; sr >>= 7; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 1; + xmaxc[3] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 63 - 39) + + xmc[39] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[40] = sr & 0x7; sr >>= 3; + xmc[41] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 30 */ + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + xmc[44] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[45] = sr & 0x7; sr >>= 3; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[48] = sr & 0x7; sr >>= 3; + xmc[49] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + + s->frame_chain = sr & 0xf; + } + else { + sr = s->frame_chain; + sr |= (uword)*c++ << 4; /* 1 */ + LARc[0] = sr & 0x3f; sr >>= 6; + LARc[1] = sr & 0x3f; sr >>= 6; + sr = *c++; + LARc[2] = sr & 0x1f; sr >>= 5; + sr |= (uword)*c++ << 3; + LARc[3] = sr & 0x1f; sr >>= 5; + LARc[4] = sr & 0xf; sr >>= 4; + sr |= (uword)*c++ << 2; + LARc[5] = sr & 0xf; sr >>= 4; + LARc[6] = sr & 0x7; sr >>= 3; + LARc[7] = sr & 0x7; sr >>= 3; + sr = *c++; /* 5 */ + Nc[0] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[0] = sr & 0x3; sr >>= 2; + Mc[0] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[0] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 12) + xmc[0] = sr & 0x7; sr >>= 3; + xmc[1] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[2] = sr & 0x7; sr >>= 3; + xmc[3] = sr & 0x7; sr >>= 3; + xmc[4] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[5] = sr & 0x7; sr >>= 3; + xmc[6] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; /* 10 */ + xmc[7] = sr & 0x7; sr >>= 3; + xmc[8] = sr & 0x7; sr >>= 3; + xmc[9] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[10] = sr & 0x7; sr >>= 3; + xmc[11] = sr & 0x7; sr >>= 3; + xmc[12] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[1] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[1] = sr & 0x3; sr >>= 2; + Mc[1] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[1] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 29 - 13) + xmc[13] = sr & 0x7; sr >>= 3; + xmc[14] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 15 */ + xmc[15] = sr & 0x7; sr >>= 3; + xmc[16] = sr & 0x7; sr >>= 3; + xmc[17] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[18] = sr & 0x7; sr >>= 3; + xmc[19] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[20] = sr & 0x7; sr >>= 3; + xmc[21] = sr & 0x7; sr >>= 3; + xmc[22] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[23] = sr & 0x7; sr >>= 3; + xmc[24] = sr & 0x7; sr >>= 3; + xmc[25] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[2] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; /* 20 */ + bc[2] = sr & 0x3; sr >>= 2; + Mc[2] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[2] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 46 - 26) + xmc[26] = sr & 0x7; sr >>= 3; + xmc[27] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[28] = sr & 0x7; sr >>= 3; + xmc[29] = sr & 0x7; sr >>= 3; + xmc[30] = sr & 0x7; sr >>= 3; + sr = *c++; + xmc[31] = sr & 0x7; sr >>= 3; + xmc[32] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[33] = sr & 0x7; sr >>= 3; + xmc[34] = sr & 0x7; sr >>= 3; + xmc[35] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; /* 25 */ + xmc[36] = sr & 0x7; sr >>= 3; + xmc[37] = sr & 0x7; sr >>= 3; + xmc[38] = sr & 0x7; sr >>= 3; + sr = *c++; + Nc[3] = sr & 0x7f; sr >>= 7; + sr |= (uword)*c++ << 1; + bc[3] = sr & 0x3; sr >>= 2; + Mc[3] = sr & 0x3; sr >>= 2; + sr |= (uword)*c++ << 5; + xmaxc[3] = sr & 0x3f; sr >>= 6; +#undef xmc +#define xmc (source + 63 - 39) + + xmc[39] = sr & 0x7; sr >>= 3; + xmc[40] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[41] = sr & 0x7; sr >>= 3; + xmc[42] = sr & 0x7; sr >>= 3; + xmc[43] = sr & 0x7; sr >>= 3; + sr = *c++; /* 30 */ + xmc[44] = sr & 0x7; sr >>= 3; + xmc[45] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 2; + xmc[46] = sr & 0x7; sr >>= 3; + xmc[47] = sr & 0x7; sr >>= 3; + xmc[48] = sr & 0x7; sr >>= 3; + sr |= (uword)*c++ << 1; + xmc[49] = sr & 0x7; sr >>= 3; + xmc[50] = sr & 0x7; sr >>= 3; + xmc[51] = sr & 0x7; sr >>= 3; + } + } + else +#endif + { + + *c++ = ((GSM_MAGIC & 0xF) << 4) /* 1 */ + | ((LARc[0] >> 2) & 0xF); + *c++ = ((LARc[0] & 0x3) << 6) + | (LARc[1] & 0x3F); + *c++ = ((LARc[2] & 0x1F) << 3) + | ((LARc[3] >> 2) & 0x7); + *c++ = ((LARc[3] & 0x3) << 6) + | ((LARc[4] & 0xF) << 2) + | ((LARc[5] >> 2) & 0x3); + *c++ = ((LARc[5] & 0x3) << 6) + | ((LARc[6] & 0x7) << 3) + | (LARc[7] & 0x7); + + + *c++ = ((Nc[0] & 0x7F) << 1) + + + | ((bc[0] >> 1) & 0x1); + *c++ = ((bc[0] & 0x1) << 7) + + + | ((Mc[0] & 0x3) << 5) + + | ((xmaxc[0] >> 1) & 0x1F); + *c++ = ((xmaxc[0] & 0x1) << 7) + +#undef xmc +#define xmc (source + 12) + + | ((xmc[0] & 0x7) << 4) + | ((xmc[1] & 0x7) << 1) + | ((xmc[2] >> 2) & 0x1); + *c++ = ((xmc[2] & 0x3) << 6) + | ((xmc[3] & 0x7) << 3) + | (xmc[4] & 0x7); + *c++ = ((xmc[5] & 0x7) << 5) /* 10 */ + | ((xmc[6] & 0x7) << 2) + | ((xmc[7] >> 1) & 0x3); + *c++ = ((xmc[7] & 0x1) << 7) + | ((xmc[8] & 0x7) << 4) + | ((xmc[9] & 0x7) << 1) + | ((xmc[10] >> 2) & 0x1); + *c++ = ((xmc[10] & 0x3) << 6) + | ((xmc[11] & 0x7) << 3) + | (xmc[12] & 0x7); + + + *c++ = ((Nc[1] & 0x7F) << 1) + + + | ((bc[1] >> 1) & 0x1); + *c++ = ((bc[1] & 0x1) << 7) + + + | ((Mc[1] & 0x3) << 5) + + + | ((xmaxc[1] >> 1) & 0x1F); + *c++ = ((xmaxc[1] & 0x1) << 7) + +#undef xmc +#define xmc (source + 29 - 13) + + | ((xmc[13] & 0x7) << 4) + | ((xmc[14] & 0x7) << 1) + | ((xmc[15] >> 2) & 0x1); + *c++ = ((xmc[15] & 0x3) << 6) + | ((xmc[16] & 0x7) << 3) + | (xmc[17] & 0x7); + *c++ = ((xmc[18] & 0x7) << 5) + | ((xmc[19] & 0x7) << 2) + | ((xmc[20] >> 1) & 0x3); + *c++ = ((xmc[20] & 0x1) << 7) + | ((xmc[21] & 0x7) << 4) + | ((xmc[22] & 0x7) << 1) + | ((xmc[23] >> 2) & 0x1); + *c++ = ((xmc[23] & 0x3) << 6) + | ((xmc[24] & 0x7) << 3) + | (xmc[25] & 0x7); + + + *c++ = ((Nc[2] & 0x7F) << 1) /* 20 */ + + + | ((bc[2] >> 1) & 0x1); + *c++ = ((bc[2] & 0x1) << 7) + + + | ((Mc[2] & 0x3) << 5) + + + | ((xmaxc[2] >> 1) & 0x1F); + *c++ = ((xmaxc[2] & 0x1) << 7) + +#undef xmc +#define xmc (source + 46 - 26) + + | ((xmc[26] & 0x7) << 4) + | ((xmc[27] & 0x7) << 1) + | ((xmc[28] >> 2) & 0x1); + *c++ = ((xmc[28] & 0x3) << 6) + | ((xmc[29] & 0x7) << 3) + | (xmc[30] & 0x7); + *c++ = ((xmc[31] & 0x7) << 5) + | ((xmc[32] & 0x7) << 2) + | ((xmc[33] >> 1) & 0x3); + *c++ = ((xmc[33] & 0x1) << 7) + | ((xmc[34] & 0x7) << 4) + | ((xmc[35] & 0x7) << 1) + | ((xmc[36] >> 2) & 0x1); + *c++ = ((xmc[36] & 0x3) << 6) + | ((xmc[37] & 0x7) << 3) + | (xmc[38] & 0x7); + + + *c++ = ((Nc[3] & 0x7F) << 1) + + + | ((bc[3] >> 1) & 0x1); + *c++ = ((bc[3] & 0x1) << 7) + + + | ((Mc[3] & 0x3) << 5) + + + | ((xmaxc[3] >> 1) & 0x1F); + *c++ = ((xmaxc[3] & 0x1) << 7) + +#undef xmc +#define xmc (source + 63 - 39) + + | ((xmc[39] & 0x7) << 4) + | ((xmc[40] & 0x7) << 1) + | ((xmc[41] >> 2) & 0x1); + *c++ = ((xmc[41] & 0x3) << 6) /* 30 */ + | ((xmc[42] & 0x7) << 3) + | (xmc[43] & 0x7); + *c++ = ((xmc[44] & 0x7) << 5) + | ((xmc[45] & 0x7) << 2) + | ((xmc[46] >> 1) & 0x3); + *c++ = ((xmc[46] & 0x1) << 7) + | ((xmc[47] & 0x7) << 4) + | ((xmc[48] & 0x7) << 1) + | ((xmc[49] >> 2) & 0x1); + *c++ = ((xmc[49] & 0x3) << 6) + | ((xmc[50] & 0x7) << 3) + | (xmc[51] & 0x7); + } +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_option.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_option.c new file mode 100644 index 0000000..2807801 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_option.c @@ -0,0 +1,69 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +int gsm_option P3((r, opt, val), gsm r, int opt, int * val) +{ + int result = -1; + + switch (opt) { + case GSM_OPT_LTP_CUT: +#ifdef LTP_CUT + result = r->ltp_cut; + if (val) r->ltp_cut = *val; +#endif + break; + + case GSM_OPT_VERBOSE: +#ifndef NDEBUG + result = r->verbose; + if (val) r->verbose = *val; +#endif + break; + + case GSM_OPT_FAST: + +#if defined(FAST) && defined(USE_FLOAT_MUL) + result = r->fast; + if (val) r->fast = !!*val; +#endif + break; + + case GSM_OPT_FRAME_CHAIN: + +#ifdef WAV49 + result = r->frame_chain; + if (val) r->frame_chain = *val; +#endif + break; + + case GSM_OPT_FRAME_INDEX: + +#ifdef WAV49 + result = r->frame_index; + if (val) r->frame_index = *val; +#endif + break; + + case GSM_OPT_WAV49: + +#ifdef WAV49 + result = r->wav_fmt; + if (val) r->wav_fmt = !!*val; +#endif + break; + + default: + break; + } + return result; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/gsm_print.c b/3rdparty/iaxclient-2/lib/gsm/src/gsm_print.c new file mode 100644 index 0000000..af745bc --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/gsm_print.c @@ -0,0 +1,167 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +int gsm_print P3((f, s, c), FILE * f, gsm s, gsm_byte * c) +{ + word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; + + /* GSM_MAGIC = (*c >> 4) & 0xF; */ + + if (((*c >> 4) & 0x0F) != GSM_MAGIC) return -1; + + LARc[0] = (*c++ & 0xF) << 2; /* 1 */ + LARc[0] |= (*c >> 6) & 0x3; + LARc[1] = *c++ & 0x3F; + LARc[2] = (*c >> 3) & 0x1F; + LARc[3] = (*c++ & 0x7) << 2; + LARc[3] |= (*c >> 6) & 0x3; + LARc[4] = (*c >> 2) & 0xF; + LARc[5] = (*c++ & 0x3) << 2; + LARc[5] |= (*c >> 6) & 0x3; + LARc[6] = (*c >> 3) & 0x7; + LARc[7] = *c++ & 0x7; + + + Nc[0] = (*c >> 1) & 0x7F; + bc[0] = (*c++ & 0x1) << 1; + bc[0] |= (*c >> 7) & 0x1; + Mc[0] = (*c >> 5) & 0x3; + xmaxc[0] = (*c++ & 0x1F) << 1; + xmaxc[0] |= (*c >> 7) & 0x1; + xmc[0] = (*c >> 4) & 0x7; + xmc[1] = (*c >> 1) & 0x7; + xmc[2] = (*c++ & 0x1) << 2; + xmc[2] |= (*c >> 6) & 0x3; + xmc[3] = (*c >> 3) & 0x7; + xmc[4] = *c++ & 0x7; + xmc[5] = (*c >> 5) & 0x7; + xmc[6] = (*c >> 2) & 0x7; + xmc[7] = (*c++ & 0x3) << 1; /* 10 */ + xmc[7] |= (*c >> 7) & 0x1; + xmc[8] = (*c >> 4) & 0x7; + xmc[9] = (*c >> 1) & 0x7; + xmc[10] = (*c++ & 0x1) << 2; + xmc[10] |= (*c >> 6) & 0x3; + xmc[11] = (*c >> 3) & 0x7; + xmc[12] = *c++ & 0x7; + + Nc[1] = (*c >> 1) & 0x7F; + bc[1] = (*c++ & 0x1) << 1; + bc[1] |= (*c >> 7) & 0x1; + Mc[1] = (*c >> 5) & 0x3; + xmaxc[1] = (*c++ & 0x1F) << 1; + xmaxc[1] |= (*c >> 7) & 0x1; + xmc[13] = (*c >> 4) & 0x7; + xmc[14] = (*c >> 1) & 0x7; + xmc[15] = (*c++ & 0x1) << 2; + xmc[15] |= (*c >> 6) & 0x3; + xmc[16] = (*c >> 3) & 0x7; + xmc[17] = *c++ & 0x7; + xmc[18] = (*c >> 5) & 0x7; + xmc[19] = (*c >> 2) & 0x7; + xmc[20] = (*c++ & 0x3) << 1; + xmc[20] |= (*c >> 7) & 0x1; + xmc[21] = (*c >> 4) & 0x7; + xmc[22] = (*c >> 1) & 0x7; + xmc[23] = (*c++ & 0x1) << 2; + xmc[23] |= (*c >> 6) & 0x3; + xmc[24] = (*c >> 3) & 0x7; + xmc[25] = *c++ & 0x7; + + + Nc[2] = (*c >> 1) & 0x7F; + bc[2] = (*c++ & 0x1) << 1; /* 20 */ + bc[2] |= (*c >> 7) & 0x1; + Mc[2] = (*c >> 5) & 0x3; + xmaxc[2] = (*c++ & 0x1F) << 1; + xmaxc[2] |= (*c >> 7) & 0x1; + xmc[26] = (*c >> 4) & 0x7; + xmc[27] = (*c >> 1) & 0x7; + xmc[28] = (*c++ & 0x1) << 2; + xmc[28] |= (*c >> 6) & 0x3; + xmc[29] = (*c >> 3) & 0x7; + xmc[30] = *c++ & 0x7; + xmc[31] = (*c >> 5) & 0x7; + xmc[32] = (*c >> 2) & 0x7; + xmc[33] = (*c++ & 0x3) << 1; + xmc[33] |= (*c >> 7) & 0x1; + xmc[34] = (*c >> 4) & 0x7; + xmc[35] = (*c >> 1) & 0x7; + xmc[36] = (*c++ & 0x1) << 2; + xmc[36] |= (*c >> 6) & 0x3; + xmc[37] = (*c >> 3) & 0x7; + xmc[38] = *c++ & 0x7; + + Nc[3] = (*c >> 1) & 0x7F; + bc[3] = (*c++ & 0x1) << 1; + bc[3] |= (*c >> 7) & 0x1; + Mc[3] = (*c >> 5) & 0x3; + xmaxc[3] = (*c++ & 0x1F) << 1; + xmaxc[3] |= (*c >> 7) & 0x1; + + xmc[39] = (*c >> 4) & 0x7; + xmc[40] = (*c >> 1) & 0x7; + xmc[41] = (*c++ & 0x1) << 2; + xmc[41] |= (*c >> 6) & 0x3; + xmc[42] = (*c >> 3) & 0x7; + xmc[43] = *c++ & 0x7; /* 30 */ + xmc[44] = (*c >> 5) & 0x7; + xmc[45] = (*c >> 2) & 0x7; + xmc[46] = (*c++ & 0x3) << 1; + xmc[46] |= (*c >> 7) & 0x1; + xmc[47] = (*c >> 4) & 0x7; + xmc[48] = (*c >> 1) & 0x7; + xmc[49] = (*c++ & 0x1) << 2; + xmc[49] |= (*c >> 6) & 0x3; + xmc[50] = (*c >> 3) & 0x7; + xmc[51] = *c & 0x7; /* 33 */ + + fprintf(f, + "LARc:\t%2.2d %2.2d %2.2d %2.2d %2.2d %2.2d %2.2d %2.2d\n", + LARc[0],LARc[1],LARc[2],LARc[3],LARc[4],LARc[5],LARc[6],LARc[7]); + + fprintf(f, "#1: Nc %4.4d bc %d Mc %d xmaxc %d\n", + Nc[0], bc[0], Mc[0], xmaxc[0]); + fprintf(f, +"\t%.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d\n", + xmc[0],xmc[1],xmc[2],xmc[3],xmc[4],xmc[5],xmc[6], + xmc[7],xmc[8],xmc[9],xmc[10],xmc[11],xmc[12] ); + + fprintf(f, "#2: Nc %4.4d bc %d Mc %d xmaxc %d\n", + Nc[1], bc[1], Mc[1], xmaxc[1]); + fprintf(f, +"\t%.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d\n", + xmc[13+0],xmc[13+1],xmc[13+2],xmc[13+3],xmc[13+4],xmc[13+5], + xmc[13+6], xmc[13+7],xmc[13+8],xmc[13+9],xmc[13+10],xmc[13+11], + xmc[13+12] ); + + fprintf(f, "#3: Nc %4.4d bc %d Mc %d xmaxc %d\n", + Nc[2], bc[2], Mc[2], xmaxc[2]); + fprintf(f, +"\t%.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d\n", + xmc[26+0],xmc[26+1],xmc[26+2],xmc[26+3],xmc[26+4],xmc[26+5], + xmc[26+6], xmc[26+7],xmc[26+8],xmc[26+9],xmc[26+10],xmc[26+11], + xmc[26+12] ); + + fprintf(f, "#4: Nc %4.4d bc %d Mc %d xmaxc %d\n", + Nc[3], bc[3], Mc[3], xmaxc[3]); + fprintf(f, +"\t%.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d %.2d\n", + xmc[39+0],xmc[39+1],xmc[39+2],xmc[39+3],xmc[39+4],xmc[39+5], + xmc[39+6], xmc[39+7],xmc[39+8],xmc[39+9],xmc[39+10],xmc[39+11], + xmc[39+12] ); + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/k6opt.h b/3rdparty/iaxclient-2/lib/gsm/src/k6opt.h new file mode 100644 index 0000000..16ea2ac --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/k6opt.h @@ -0,0 +1,84 @@ +/* k6opt.h vector functions optimized for MMX extensions to x86 + * + * Copyright (C) 1999 by Stanley J. Brooks + * + * Any use of this software is permitted provided that this notice is not + * removed and that neither the authors nor the Technische Universitaet Berlin + * are deemed to have made any representations as to the suitability of this + * software for any purpose nor are held responsible for any defects of + * this software. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE; + * not even the implied warranty of MERCHANTABILITY or FITNESS FOR + * A PARTICULAR PURPOSE. + * + * Chicago, 03.12.1999 + * Stanley J. Brooks + */ + +extern void Weighting_filter P2((e, x), + const word * e, /* signal [-5..0.39.44] IN */ + word * x /* signal [0..39] OUT */ +) +; + +extern longword k6maxcc P3((wt,dp,Nc_out), + const word *wt, + const word *dp, + word * Nc_out /* OUT */ +) +; +/* + * k6maxmin(p,n,out[]) + * input p[n] is array of shorts (require n>0) + * returns (long) maximum absolute value.. + * if out!=NULL, also returns out[0] the maximum and out[1] the minimum + */ +extern longword k6maxmin P3((p,n,out), + const word *p, + int n, + word *out /* out[0] is max, out[1] is min */ +) +; + +extern longword k6iprod P3((p,q,n), + const word *p, + const word *q, + int n +) +; + +/* + * k6vsraw(p,n,bits) + * input p[n] is array of shorts (require n>0) + * shift/round each to the right by bits>=0 bits. + */ +extern void k6vsraw P3((p,n,bits), + const word *p, + int n, + int bits +) +; + +/* + * k6vsllw(p,n,bits) + * input p[n] is array of shorts (require n>0) + * shift each to the left by bits>=0 bits. + */ +extern void k6vsllw P3((p,n,bits), + const word *p, + int n, + int bits +) +; + +#if 1 /* there isn't any significant speed gain from mmx here: */ +extern void Short_term_analysis_filteringx P4((u0,rp0,k_n,s), + register word * u0, + register word * rp0, /* [0..7] IN */ + register int k_n, /* k_end - k_start */ + register word * s /* [0..n-1] IN/OUT */ +) +; +/* +#define Short_term_analysis_filtering Short_term_analysis_filteringx +*/ +#endif diff --git a/3rdparty/iaxclient-2/lib/gsm/src/k6opt.s b/3rdparty/iaxclient-2/lib/gsm/src/k6opt.s new file mode 100644 index 0000000..3be5c18 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/k6opt.s @@ -0,0 +1,755 @@ +/* k6opt.s vector functions optimized for MMX extensions to x86 + * + * Copyright (C) 1999 by Stanley J. Brooks + * + * Any use of this software is permitted provided that this notice is not + * removed and that neither the authors nor the Technische Universitaet Berlin + * are deemed to have made any representations as to the suitability of this + * software for any purpose nor are held responsible for any defects of + * this software. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE; + * not even the implied warranty of MERCHANTABILITY or FITNESS FOR + * A PARTICULAR PURPOSE. + * + * Chicago, 03.12.1999 + * Stanley J. Brooks + */ + + .file "k6opt.s" + .version "01.01" +/* gcc2_compiled.: */ +.section .rodata + .align 4 + .type coefs,@object + .size coefs,24 +coefs: + .value -134 + .value -374 + .value 0 + .value 2054 + .value 5741 + .value 8192 + .value 5741 + .value 2054 + .value 0 + .value -374 + .value -134 + .value 0 +.text + .align 4 +/* void Weighting_filter (const short *e, short *x) */ +.globl Weighting_filter + .type Weighting_filter,@function +Weighting_filter: + pushl %ebp + movl %esp,%ebp + pushl %edi + pushl %esi + pushl %ebx + movl 12(%ebp),%edi + movl 8(%ebp),%ebx + addl $-10,%ebx + emms + movl $0x1000,%eax; movd %eax,%mm5 /* for rounding */ + movq coefs,%mm1 + movq coefs+8,%mm2 + movq coefs+16,%mm3 + xorl %esi,%esi + .p2align 2 +.L21: + movq (%ebx,%esi,2),%mm0 + pmaddwd %mm1,%mm0 + + movq 8(%ebx,%esi,2),%mm4 + pmaddwd %mm2,%mm4 + paddd %mm4,%mm0 + + movq 16(%ebx,%esi,2),%mm4 + pmaddwd %mm3,%mm4 + paddd %mm4,%mm0 + + movq %mm0,%mm4 + punpckhdq %mm0,%mm4 /* mm4 has high int32 of mm0 dup'd */ + paddd %mm4,%mm0; + + paddd %mm5,%mm0 /* add for roundoff */ + psrad $13,%mm0 + packssdw %mm0,%mm0 + movd %mm0,%eax /* ax has result */ + movw %ax,(%edi,%esi,2) + incl %esi + cmpl $39,%esi + jle .L21 + emms + popl %ebx + popl %esi + popl %edi + leave + ret +.Lfe1: + .size Weighting_filter,.Lfe1-Weighting_filter + +.macro ccstep n +.if \n + movq \n(%edi),%mm1 + movq \n(%esi),%mm2 +.else + movq (%edi),%mm1 + movq (%esi),%mm2 +.endif + pmaddwd %mm2,%mm1 + paddd %mm1,%mm0 +.endm + + .align 4 +/* long k6maxcc(const short *wt, const short *dp, short *Nc_out) */ +.globl k6maxcc + .type k6maxcc,@function +k6maxcc: + pushl %ebp + movl %esp,%ebp + pushl %edi + pushl %esi + pushl %ebx + emms + movl 8(%ebp),%edi + movl 12(%ebp),%esi + movl $0,%edx /* will be maximum inner-product */ + movl $40,%ebx + movl %ebx,%ecx /* will be index of max inner-product */ + subl $80,%esi + .p2align 2 +.L41: + movq (%edi),%mm0 + movq (%esi),%mm2 + pmaddwd %mm2,%mm0 + ccstep 8 + ccstep 16 + ccstep 24 + ccstep 32 + ccstep 40 + ccstep 48 + ccstep 56 + ccstep 64 + ccstep 72 + + movq %mm0,%mm1 + punpckhdq %mm0,%mm1 /* mm1 has high int32 of mm0 dup'd */ + paddd %mm1,%mm0; + movd %mm0,%eax /* eax has result */ + + cmpl %edx,%eax + jle .L40 + movl %eax,%edx + movl %ebx,%ecx + .p2align 2 +.L40: + subl $2,%esi + incl %ebx + cmpl $120,%ebx + jle .L41 + movl 16(%ebp),%eax + movw %cx,(%eax) + movl %edx,%eax + emms + popl %ebx + popl %esi + popl %edi + leave + ret +.Lfe2: + .size k6maxcc,.Lfe2-k6maxcc + + + .align 4 +/* long k6iprod (const short *p, const short *q, int n) */ +.globl k6iprod + .type k6iprod,@function +k6iprod: + pushl %ebp + movl %esp,%ebp + pushl %edi + pushl %esi + emms + pxor %mm0,%mm0 + movl 8(%ebp),%esi + movl 12(%ebp),%edi + movl 16(%ebp),%eax + leal -32(%esi,%eax,2),%edx /* edx = top - 32 */ + + cmpl %edx,%esi; ja .L202 + + .p2align 2 +.L201: + ccstep 0 + ccstep 8 + ccstep 16 + ccstep 24 + + addl $32,%esi + addl $32,%edi + cmpl %edx,%esi; jbe .L201 + + .p2align 2 +.L202: + addl $24,%edx /* now edx = top-8 */ + cmpl %edx,%esi; ja .L205 + + .p2align 2 +.L203: + ccstep 0 + + addl $8,%esi + addl $8,%edi + cmpl %edx,%esi; jbe .L203 + + .p2align 2 +.L205: + addl $4,%edx /* now edx = top-4 */ + cmpl %edx,%esi; ja .L207 + + movd (%edi),%mm1 + movd (%esi),%mm2 + pmaddwd %mm2,%mm1 + paddd %mm1,%mm0 + + addl $4,%esi + addl $4,%edi + + .p2align 2 +.L207: + addl $2,%edx /* now edx = top-2 */ + cmpl %edx,%esi; ja .L209 + + movswl (%edi),%eax + movd %eax,%mm1 + movswl (%esi),%eax + movd %eax,%mm2 + pmaddwd %mm2,%mm1 + paddd %mm1,%mm0 + + .p2align 2 +.L209: + movq %mm0,%mm1 + punpckhdq %mm0,%mm1 /* mm1 has high int32 of mm0 dup'd */ + paddd %mm1,%mm0; + movd %mm0,%eax /* eax has result */ + + emms + popl %esi + popl %edi + leave + ret +.Lfe3: + .size k6iprod,.Lfe3-k6iprod + + + .align 4 +/* void k6vsraw P3((short *p, int n, int bits) */ +.globl k6vsraw + .type k6vsraw,@function +k6vsraw: + pushl %ebp + movl %esp,%ebp + pushl %esi + movl 8(%ebp),%esi + movl 16(%ebp),%ecx + andl %ecx,%ecx; jle .L399 + movl 12(%ebp),%eax + leal -16(%esi,%eax,2),%edx /* edx = top - 16 */ + emms + movd %ecx,%mm3 + movq ones,%mm2 + psllw %mm3,%mm2; psrlw $1,%mm2 + cmpl %edx,%esi; ja .L306 + + .p2align 2 +.L302: /* 8 words per iteration */ + movq (%esi),%mm0 + movq 8(%esi),%mm1 + paddsw %mm2,%mm0 + psraw %mm3,%mm0; + paddsw %mm2,%mm1 + psraw %mm3,%mm1; + movq %mm0,(%esi) + movq %mm1,8(%esi) + addl $16,%esi + cmpl %edx,%esi + jbe .L302 + + .p2align 2 +.L306: + addl $12,%edx /* now edx = top-4 */ + cmpl %edx,%esi; ja .L310 + + .p2align 2 +.L308: /* do up to 6 words, two at a time */ + movd (%esi),%mm0 + paddsw %mm2,%mm0 + psraw %mm3,%mm0; + movd %mm0,(%esi) + addl $4,%esi + cmpl %edx,%esi + jbe .L308 + + .p2align 2 +.L310: + addl $2,%edx /* now edx = top-2 */ + cmpl %edx,%esi; ja .L315 + + movzwl (%esi),%eax + movd %eax,%mm0 + paddsw %mm2,%mm0 + psraw %mm3,%mm0; + movd %mm0,%eax + movw %ax,(%esi) + + .p2align 2 +.L315: + emms +.L399: + popl %esi + leave + ret +.Lfe4: + .size k6vsraw,.Lfe4-k6vsraw + + .align 4 +/* void k6vsllw P3((short *p, int n, int bits) */ +.globl k6vsllw + .type k6vsllw,@function +k6vsllw: + pushl %ebp + movl %esp,%ebp + pushl %esi + movl 8(%ebp),%esi + movl 16(%ebp),%ecx + andl %ecx,%ecx; jle .L499 + movl 12(%ebp),%eax + leal -16(%esi,%eax,2),%edx /* edx = top - 16 */ + emms + movd %ecx,%mm3 + cmpl %edx,%esi; ja .L406 + + .p2align 2 +.L402: /* 8 words per iteration */ + movq (%esi),%mm0 + movq 8(%esi),%mm1 + psllw %mm3,%mm0; + psllw %mm3,%mm1; + movq %mm0,(%esi) + movq %mm1,8(%esi) + addl $16,%esi + cmpl %edx,%esi + jbe .L402 + + .p2align 2 +.L406: + addl $12,%edx /* now edx = top-4 */ + cmpl %edx,%esi; ja .L410 + + .p2align 2 +.L408: /* do up to 6 words, two at a time */ + movd (%esi),%mm0 + psllw %mm3,%mm0; + movd %mm0,(%esi) + addl $4,%esi + cmpl %edx,%esi + jbe .L408 + + .p2align 2 +.L410: + addl $2,%edx /* now edx = top-2 */ + cmpl %edx,%esi; ja .L415 + + movzwl (%esi),%eax + movd %eax,%mm0 + psllw %mm3,%mm0; + movd %mm0,%eax + movw %ax,(%esi) + + .p2align 2 +.L415: + emms +.L499: + popl %esi + leave + ret +.Lfe5: + .size k6vsllw,.Lfe5-k6vsllw + + +.section .rodata + .align 4 + .type extremes,@object + .size extremes,8 +extremes: + .long 0x80008000 + .long 0x7fff7fff + .type ones,@object + .size ones,8 +ones: + .long 0x00010001 + .long 0x00010001 + +.text + .align 4 +/* long k6maxmin (const short *p, int n, short *out) */ +.globl k6maxmin + .type k6maxmin,@function +k6maxmin: + pushl %ebp + movl %esp,%ebp + pushl %esi + emms + movl 8(%ebp),%esi + movl 12(%ebp),%eax + leal -8(%esi,%eax,2),%edx + + cmpl %edx,%esi + jbe .L52 + movd extremes,%mm0 + movd extremes+4,%mm1 + jmp .L58 + + .p2align 2 +.L52: + movq (%esi),%mm0 /* mm0 will be max's */ + movq %mm0,%mm1 /* mm1 will be min's */ + addl $8,%esi + cmpl %edx,%esi + ja .L56 + + .p2align 2 +.L54: + movq (%esi),%mm2 + + movq %mm2,%mm3 + pcmpgtw %mm0,%mm3 /* mm3 is bitmask for words where mm2 > mm0 */ + movq %mm3,%mm4 + pand %mm2,%mm3 /* mm3 is mm2 masked to new max's */ + pandn %mm0,%mm4 /* mm4 is mm0 masked to its max's */ + por %mm3,%mm4 + movq %mm4,%mm0 /* now mm0 is updated max's */ + + movq %mm1,%mm3 + pcmpgtw %mm2,%mm3 /* mm3 is bitmask for words where mm2 < mm1 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new min's */ + pandn %mm1,%mm3 /* mm3 is mm1 masked to its min's */ + por %mm3,%mm2 + movq %mm2,%mm1 /* now mm1 is updated min's */ + + addl $8,%esi + cmpl %edx,%esi + jbe .L54 + + .p2align 2 +.L56: /* merge down the 4-word max/mins to lower 2 words */ + + movq %mm0,%mm2 + psrlq $32,%mm2 + movq %mm2,%mm3 + pcmpgtw %mm0,%mm3 /* mm3 is bitmask for words where mm2 > mm0 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new max's */ + pandn %mm0,%mm3 /* mm3 is mm0 masked to its max's */ + por %mm3,%mm2 + movq %mm2,%mm0 /* now mm0 is updated max's */ + + movq %mm1,%mm2 + psrlq $32,%mm2 + movq %mm1,%mm3 + pcmpgtw %mm2,%mm3 /* mm3 is bitmask for words where mm2 < mm1 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new min's */ + pandn %mm1,%mm3 /* mm3 is mm1 masked to its min's */ + por %mm3,%mm2 + movq %mm2,%mm1 /* now mm1 is updated min's */ + + .p2align 2 +.L58: + addl $4,%edx /* now dx = top-4 */ + cmpl %edx,%esi + ja .L62 + /* here, there are >= 2 words of input remaining */ + movd (%esi),%mm2 + + movq %mm2,%mm3 + pcmpgtw %mm0,%mm3 /* mm3 is bitmask for words where mm2 > mm0 */ + movq %mm3,%mm4 + pand %mm2,%mm3 /* mm3 is mm2 masked to new max's */ + pandn %mm0,%mm4 /* mm4 is mm0 masked to its max's */ + por %mm3,%mm4 + movq %mm4,%mm0 /* now mm0 is updated max's */ + + movq %mm1,%mm3 + pcmpgtw %mm2,%mm3 /* mm3 is bitmask for words where mm2 < mm1 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new min's */ + pandn %mm1,%mm3 /* mm3 is mm1 masked to its min's */ + por %mm3,%mm2 + movq %mm2,%mm1 /* now mm1 is updated min's */ + + addl $4,%esi + + .p2align 2 +.L62: + /* merge down the 2-word max/mins to 1 word */ + + movq %mm0,%mm2 + psrlq $16,%mm2 + movq %mm2,%mm3 + pcmpgtw %mm0,%mm3 /* mm3 is bitmask for words where mm2 > mm0 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new max's */ + pandn %mm0,%mm3 /* mm3 is mm0 masked to its max's */ + por %mm3,%mm2 + movd %mm2,%ecx /* cx is max so far */ + + movq %mm1,%mm2 + psrlq $16,%mm2 + movq %mm1,%mm3 + pcmpgtw %mm2,%mm3 /* mm3 is bitmask for words where mm2 < mm1 */ + pand %mm3,%mm2 /* mm2 is mm2 masked to new min's */ + pandn %mm1,%mm3 /* mm3 is mm1 masked to its min's */ + por %mm3,%mm2 + movd %mm2,%eax /* ax is min so far */ + + addl $2,%edx /* now dx = top-2 */ + cmpl %edx,%esi + ja .L65 + + /* here, there is one word of input left */ + cmpw (%esi),%cx + jge .L64 + movw (%esi),%cx + .p2align 2 +.L64: + cmpw (%esi),%ax + jle .L65 + movw (%esi),%ax + + .p2align 2 +.L65: /* (finally!) cx is the max, ax the min */ + movswl %cx,%ecx + movswl %ax,%eax + + movl 16(%ebp),%edx /* ptr to output max,min vals */ + andl %edx,%edx; jz .L77 + movw %cx,(%edx) /* max */ + movw %ax,2(%edx) /* min */ + .p2align 2 +.L77: + /* now calculate max absolute val */ + negl %eax + cmpl %ecx,%eax + jge .L81 + movl %ecx,%eax + .p2align 2 +.L81: + emms + popl %esi + leave + ret +.Lfe6: + .size k6maxmin,.Lfe6-k6maxmin + +/* void Short_term_analysis_filtering (short *u0, const short *rp0, int kn, short *s) */ + .equiv pm_u0,8 + .equiv pm_rp0,12 + .equiv pm_kn,16 + .equiv pm_s,20 + .equiv lv_u_top,-4 + .equiv lv_s_top,-8 + .equiv lv_rp,-40 /* local version of rp0 with each word twice */ + .align 4 +.globl Short_term_analysis_filteringx + .type Short_term_analysis_filteringx,@function +Short_term_analysis_filteringx: + pushl %ebp + movl %esp,%ebp + subl $40,%esp + pushl %edi + pushl %esi + + movl pm_rp0(%ebp),%esi; + leal lv_rp(%ebp),%edi; + cld + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + emms + movl $0x4000,%eax; + movd %eax,%mm4; + punpckldq %mm4,%mm4 /* (0x00004000,0x00004000) for rounding dword product pairs */ + + movl pm_u0(%ebp),%eax + addl $16,%eax + movl %eax,lv_u_top(%ebp) /* UTOP */ + movl pm_s(%ebp),%edx /* edx is local s ptr throughout below */ + movl pm_kn(%ebp),%eax + leal (%edx,%eax,2),%eax + movl %eax,lv_s_top(%ebp) + cmpl %eax,%edx + jae .L179 + .p2align 2 +.L181: + leal lv_rp(%ebp),%esi /* RP */ + movl pm_u0(%ebp),%edi /* U */ + movw (%edx),%ax /* (0,DI) */ + roll $16,%eax + movw (%edx),%ax /* (DI,DI) */ + .p2align 2 +.L185: /* RP is %esi */ + movl %eax,%ecx + movw (%edi),%ax /* (DI,U) */ + movd (%esi),%mm3 /* mm3 is (0,0,RP,RP) */ + movw %cx,(%edi) + + movd %eax,%mm2 /* mm2 is (0,0,DI,U) */ + rorl $16,%eax + movd %eax,%mm1 /* mm1 is (0,0,U,DI) */ + + movq %mm1,%mm0 + pmullw %mm3,%mm0 + pmulhw %mm3,%mm1 + punpcklwd %mm1,%mm0 /* mm0 is (RP*U,RP*DI) */ + paddd %mm4,%mm0 /* mm4 is 0x00004000,0x00004000 */ + psrad $15,%mm0 /* (RP*U,RP*DI) adjusted */ + packssdw %mm0,%mm0 /* (*,*,RP*U,RP*DI) adjusted and saturated to word */ + paddsw %mm2,%mm0 /* mm0 is (?,?, DI', U') */ + movd %mm0,%eax /* (DI,U') */ + + addl $2,%edi + addl $4,%esi + cmpl lv_u_top(%ebp),%edi + jb .L185 + + rorl $16,%eax + movw %ax,(%edx) /* last DI goes to *s */ + addl $2,%edx /* next s */ + cmpl lv_s_top(%ebp),%edx + jb .L181 + .p2align 2 +.L179: + emms + popl %esi + popl %edi + leave + ret +.Lfe7: + .size Short_term_analysis_filteringx,.Lfe7-Short_term_analysis_filteringx + +.end + +/* 'as' macro's seem to be case-insensitive */ +.macro STEP n +.if \n + movd \n(%esi),%mm3 /* mm3 is (0,0,RP,RP) */ +.else + movd (%esi),%mm3 /* mm3 is (0,0,RP,RP) */ +.endif + movq %mm5,%mm1; + movd %mm4,%ecx; movw %cx,%ax /* (DI,U) */ + psllq $48,%mm1; psrlq $16,%mm4; por %mm1,%mm4 + psllq $48,%mm0; psrlq $16,%mm5; por %mm0,%mm5 + + movd %eax,%mm2 /* mm2 is (0,0,DI,U) */ + rorl $16,%eax + movd %eax,%mm1 /* mm1 is (0,0,U,DI) */ + + movq %mm1,%mm0 + pmullw %mm3,%mm0 + pmulhw %mm3,%mm1 + punpcklwd %mm1,%mm0 /* mm0 is (RP*U,RP*DI) */ + paddd %mm6,%mm0 /* mm6 is 0x00004000,0x00004000 */ + psrad $15,%mm0 /* (RP*U,RP*DI) adjusted */ + packssdw %mm0,%mm0 /* (*,*,RP*U,RP*DI) adjusted and saturated to word */ + paddsw %mm2,%mm0 /* mm0 is (?,?, DI', U') */ + movd %mm0,%eax /* (DI,U') */ +.endm + +/* void Short_term_analysis_filtering (short *u0, const short *rp0, int kn, short *s) */ + .equiv pm_u0,8 + .equiv pm_rp0,12 + .equiv pm_kn,16 + .equiv pm_s,20 + .equiv lv_rp_top,-4 + .equiv lv_s_top,-8 + .equiv lv_rp,-40 /* local version of rp0 with each word twice */ + .align 4 +.globl Short_term_analysis_filteringx + .type Short_term_analysis_filteringx,@function +Short_term_analysis_filteringx: + pushl %ebp + movl %esp,%ebp + subl $56,%esp + pushl %edi + pushl %esi + pushl %ebx + + movl pm_rp0(%ebp),%esi; + leal lv_rp(%ebp),%edi; + cld + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + lodsw; stosw; stosw + movl %edi,lv_rp_top(%ebp) + emms + + movl $0x4000,%eax; + movd %eax,%mm6; + punpckldq %mm6,%mm6 /* (0x00004000,0x00004000) for rounding dword product pairs */ + + movl pm_u0(%ebp),%ebx + movq (%ebx),%mm4; movq 8(%ebx),%mm5 /* the 8 u's */ + movl pm_s(%ebp),%edx /* edx is local s ptr throughout below */ + movl pm_kn(%ebp),%eax + leal (%edx,%eax,2),%eax + movl %eax,lv_s_top(%ebp) + cmpl %eax,%edx + jae .L179 + .p2align 2 +.L181: + leal lv_rp(%ebp),%esi /* RP */ + movw (%edx),%ax /* (0,DI) */ + roll $16,%eax + movw (%edx),%ax /* (DI,DI) */ + movd %eax,%mm0 + .p2align 2 +.L185: /* RP is %esi */ + step 0 + step 4 + step 8 + step 12 +/* + step 16 + step 20 + step 24 + step 28 +*/ + addl $16,%esi + cmpl lv_rp_top(%ebp),%esi + jb .L185 + + rorl $16,%eax + movw %ax,(%edx) /* last DI goes to *s */ + addl $2,%edx /* next s */ + cmpl lv_s_top(%ebp),%edx + jb .L181 +.L179: + movq %mm4,(%ebx); movq %mm5,8(%ebx) /* the 8 u's */ + emms + popl %ebx + popl %esi + popl %edi + leave + ret +.Lfe7: + .size Short_term_analysis_filteringx,.Lfe7-Short_term_analysis_filteringx + .ident "GCC: (GNU) 2.95.2 19991109 (Debian GNU/Linux)" diff --git a/3rdparty/iaxclient-2/lib/gsm/src/long_term.c b/3rdparty/iaxclient-2/lib/gsm/src/long_term.c new file mode 100644 index 0000000..15ae21e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/long_term.c @@ -0,0 +1,954 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" +#ifdef K6OPT +#include "k6opt.h" +#endif +/* + * 4.2.11 .. 4.2.12 LONG TERM PREDICTOR (LTP) SECTION + */ + + +/* + * This module computes the LTP gain (bc) and the LTP lag (Nc) + * for the long term analysis filter. This is done by calculating a + * maximum of the cross-correlation function between the current + * sub-segment short term residual signal d[0..39] (output of + * the short term analysis filter; for simplification the index + * of this array begins at 0 and ends at 39 for each sub-segment of the + * RPE-LTP analysis) and the previous reconstructed short term + * residual signal dp[ -120 .. -1 ]. A dynamic scaling must be + * performed to avoid overflow. + */ + + /* The next procedure exists in six versions. First two integer + * version (if USE_FLOAT_MUL is not defined); then four floating + * point versions, twice with proper scaling (USE_FLOAT_MUL defined), + * once without (USE_FLOAT_MUL and FAST defined, and fast run-time + * option used). Every pair has first a Cut version (see the -C + * option to toast or the LTP_CUT option to gsm_option()), then the + * uncut one. (For a detailed explanation of why this is altogether + * a bad idea, see Henry Spencer and Geoff Collyer, ``#ifdef Considered + * Harmful''.) + */ + +#ifndef USE_FLOAT_MUL + +#ifdef LTP_CUT + +static void Cut_Calculation_of_the_LTP_parameters P5((st, d,dp,bc_out,Nc_out), + + struct gsm_state * st, + + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + word Nc, bc; + word wt[40]; + + longword L_result; + longword L_max, L_power; + word R, S, dmax, scal, best_k; + word ltp_cut; + + register word temp, wt_k; + + /* Search of the optimum scaling of d[0..39]. + */ + dmax = 0; + for (k = 0; k <= 39; k++) { + temp = d[k]; + temp = GSM_ABS( temp ); + if (temp > dmax) { + dmax = temp; + best_k = k; + } + } + temp = 0; + if (dmax == 0) scal = 0; + else { + assert(dmax > 0); + temp = gsm_norm( (longword)dmax << 16 ); + } + if (temp > 6) scal = 0; + else scal = 6 - temp; + assert(scal >= 0); + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + wt_k = SASR(d[best_k], scal); + + for (lambda = 40; lambda <= 120; lambda++) { + L_result = (longword)wt_k * dp[best_k - lambda]; + if (L_result > L_max) { + Nc = lambda; + L_max = L_result; + } + } + *Nc_out = Nc; + L_max <<= 1; + + /* Rescaling of L_max + */ + assert(scal <= 100 && scal >= -100); + L_max = L_max >> (6 - scal); /* sub(6, scal) */ + + assert( Nc <= 120 && Nc >= 40); + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + L_power = 0; + for (k = 0; k <= 39; k++) { + + register longword L_temp; + + L_temp = SASR( dp[k - Nc], 3 ); + L_power += L_temp * L_temp; + } + L_power <<= 1; /* from L_MULT */ + + /* Normalization of L_max and L_power + */ + + if (L_max <= 0) { + *bc_out = 0; + return; + } + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + temp = gsm_norm( L_power ); + + R = SASR( L_max << temp, 16 ); + S = SASR( L_power << temp, 16 ); + + /* Coding of the LTP gain + */ + + /* Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + for (bc = 0; bc <= 2; bc++) if (R <= gsm_mult(S, gsm_DLB[bc])) break; + *bc_out = bc; +} + +#endif /* LTP_CUT */ + +static void Calculation_of_the_LTP_parameters P4((d,dp,bc_out,Nc_out), + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + word Nc, bc; + word wt[40]; + + longword L_max, L_power; + word R, S, dmax, scal; + register word temp; + + /* Search of the optimum scaling of d[0..39]. + */ + dmax = 0; + + for (k = 0; k <= 39; k++) { + temp = d[k]; + temp = GSM_ABS( temp ); + if (temp > dmax) dmax = temp; + } + + temp = 0; + if (dmax == 0) scal = 0; + else { + assert(dmax > 0); + temp = gsm_norm( (longword)dmax << 16 ); + } + + if (temp > 6) scal = 0; + else scal = 6 - temp; + + assert(scal >= 0); + + /* Initialization of a working array wt + */ + + for (k = 0; k <= 39; k++) wt[k] = SASR( d[k], scal ); + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ +# ifdef K6OPT + L_max = k6maxcc(wt,dp,&Nc); +# else + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + + for (lambda = 40; lambda <= 120; lambda++) { + +# undef STEP +# define STEP(k) (longword)wt[k] * dp[k - lambda] + + register longword L_result; + + L_result = STEP(0) ; L_result += STEP(1) ; + L_result += STEP(2) ; L_result += STEP(3) ; + L_result += STEP(4) ; L_result += STEP(5) ; + L_result += STEP(6) ; L_result += STEP(7) ; + L_result += STEP(8) ; L_result += STEP(9) ; + L_result += STEP(10) ; L_result += STEP(11) ; + L_result += STEP(12) ; L_result += STEP(13) ; + L_result += STEP(14) ; L_result += STEP(15) ; + L_result += STEP(16) ; L_result += STEP(17) ; + L_result += STEP(18) ; L_result += STEP(19) ; + L_result += STEP(20) ; L_result += STEP(21) ; + L_result += STEP(22) ; L_result += STEP(23) ; + L_result += STEP(24) ; L_result += STEP(25) ; + L_result += STEP(26) ; L_result += STEP(27) ; + L_result += STEP(28) ; L_result += STEP(29) ; + L_result += STEP(30) ; L_result += STEP(31) ; + L_result += STEP(32) ; L_result += STEP(33) ; + L_result += STEP(34) ; L_result += STEP(35) ; + L_result += STEP(36) ; L_result += STEP(37) ; + L_result += STEP(38) ; L_result += STEP(39) ; + + if (L_result > L_max) { + + Nc = lambda; + L_max = L_result; + } + } +# endif + *Nc_out = Nc; + + L_max <<= 1; + + /* Rescaling of L_max + */ + assert(scal <= 100 && scal >= -100); + L_max = L_max >> (6 - scal); /* sub(6, scal) */ + + assert( Nc <= 120 && Nc >= 40); + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + L_power = 0; + for (k = 0; k <= 39; k++) { + + register longword L_temp; + + L_temp = SASR( dp[k - Nc], 3 ); + L_power += L_temp * L_temp; + } + L_power <<= 1; /* from L_MULT */ + + /* Normalization of L_max and L_power + */ + + if (L_max <= 0) { + *bc_out = 0; + return; + } + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + temp = gsm_norm( L_power ); + + R = SASR( L_max << temp, 16 ); + S = SASR( L_power << temp, 16 ); + + /* Coding of the LTP gain + */ + + /* Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + for (bc = 0; bc <= 2; bc++) if (R <= gsm_mult(S, gsm_DLB[bc])) break; + *bc_out = bc; +} + +#else /* USE_FLOAT_MUL */ + +#ifdef LTP_CUT + +static void Cut_Calculation_of_the_LTP_parameters P5((st, d,dp,bc_out,Nc_out), + struct gsm_state * st, /* IN */ + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + word Nc, bc; + word ltp_cut; + + float wt_float[40]; + float dp_float_base[120], * dp_float = dp_float_base + 120; + + longword L_max, L_power; + word R, S, dmax, scal; + register word temp; + + /* Search of the optimum scaling of d[0..39]. + */ + dmax = 0; + + for (k = 0; k <= 39; k++) { + temp = d[k]; + temp = GSM_ABS( temp ); + if (temp > dmax) dmax = temp; + } + + temp = 0; + if (dmax == 0) scal = 0; + else { + assert(dmax > 0); + temp = gsm_norm( (longword)dmax << 16 ); + } + + if (temp > 6) scal = 0; + else scal = 6 - temp; + + assert(scal >= 0); + ltp_cut = (longword)SASR(dmax, scal) * st->ltp_cut / 100; + + + /* Initialization of a working array wt + */ + + for (k = 0; k < 40; k++) { + register word w = SASR( d[k], scal ); + if (w < 0 ? w > -ltp_cut : w < ltp_cut) { + wt_float[k] = 0.0; + } + else { + wt_float[k] = w; + } + } + for (k = -120; k < 0; k++) dp_float[k] = dp[k]; + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + + for (lambda = 40; lambda <= 120; lambda += 9) { + + /* Calculate L_result for l = lambda .. lambda + 9. + */ + register float *lp = dp_float - lambda; + + register float W; + register float a = lp[-8], b = lp[-7], c = lp[-6], + d = lp[-5], e = lp[-4], f = lp[-3], + g = lp[-2], h = lp[-1]; + register float E; + register float S0 = 0, S1 = 0, S2 = 0, S3 = 0, S4 = 0, + S5 = 0, S6 = 0, S7 = 0, S8 = 0; + +# undef STEP +# define STEP(K, a, b, c, d, e, f, g, h) \ + if ((W = wt_float[K]) != 0.0) { \ + E = W * a; S8 += E; \ + E = W * b; S7 += E; \ + E = W * c; S6 += E; \ + E = W * d; S5 += E; \ + E = W * e; S4 += E; \ + E = W * f; S3 += E; \ + E = W * g; S2 += E; \ + E = W * h; S1 += E; \ + a = lp[K]; \ + E = W * a; S0 += E; } else (a = lp[K]) + +# define STEP_A(K) STEP(K, a, b, c, d, e, f, g, h) +# define STEP_B(K) STEP(K, b, c, d, e, f, g, h, a) +# define STEP_C(K) STEP(K, c, d, e, f, g, h, a, b) +# define STEP_D(K) STEP(K, d, e, f, g, h, a, b, c) +# define STEP_E(K) STEP(K, e, f, g, h, a, b, c, d) +# define STEP_F(K) STEP(K, f, g, h, a, b, c, d, e) +# define STEP_G(K) STEP(K, g, h, a, b, c, d, e, f) +# define STEP_H(K) STEP(K, h, a, b, c, d, e, f, g) + + STEP_A( 0); STEP_B( 1); STEP_C( 2); STEP_D( 3); + STEP_E( 4); STEP_F( 5); STEP_G( 6); STEP_H( 7); + + STEP_A( 8); STEP_B( 9); STEP_C(10); STEP_D(11); + STEP_E(12); STEP_F(13); STEP_G(14); STEP_H(15); + + STEP_A(16); STEP_B(17); STEP_C(18); STEP_D(19); + STEP_E(20); STEP_F(21); STEP_G(22); STEP_H(23); + + STEP_A(24); STEP_B(25); STEP_C(26); STEP_D(27); + STEP_E(28); STEP_F(29); STEP_G(30); STEP_H(31); + + STEP_A(32); STEP_B(33); STEP_C(34); STEP_D(35); + STEP_E(36); STEP_F(37); STEP_G(38); STEP_H(39); + + if (S0 > L_max) { L_max = S0; Nc = lambda; } + if (S1 > L_max) { L_max = S1; Nc = lambda + 1; } + if (S2 > L_max) { L_max = S2; Nc = lambda + 2; } + if (S3 > L_max) { L_max = S3; Nc = lambda + 3; } + if (S4 > L_max) { L_max = S4; Nc = lambda + 4; } + if (S5 > L_max) { L_max = S5; Nc = lambda + 5; } + if (S6 > L_max) { L_max = S6; Nc = lambda + 6; } + if (S7 > L_max) { L_max = S7; Nc = lambda + 7; } + if (S8 > L_max) { L_max = S8; Nc = lambda + 8; } + + } + *Nc_out = Nc; + + L_max <<= 1; + + /* Rescaling of L_max + */ + assert(scal <= 100 && scal >= -100); + L_max = L_max >> (6 - scal); /* sub(6, scal) */ + + assert( Nc <= 120 && Nc >= 40); + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + L_power = 0; + for (k = 0; k <= 39; k++) { + + register longword L_temp; + + L_temp = SASR( dp[k - Nc], 3 ); + L_power += L_temp * L_temp; + } + L_power <<= 1; /* from L_MULT */ + + /* Normalization of L_max and L_power + */ + + if (L_max <= 0) { + *bc_out = 0; + return; + } + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + temp = gsm_norm( L_power ); + + R = SASR( L_max << temp, 16 ); + S = SASR( L_power << temp, 16 ); + + /* Coding of the LTP gain + */ + + /* Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + for (bc = 0; bc <= 2; bc++) if (R <= gsm_mult(S, gsm_DLB[bc])) break; + *bc_out = bc; +} + +#endif /* LTP_CUT */ + +static void Calculation_of_the_LTP_parameters P4((d,dp,bc_out,Nc_out), + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + word Nc, bc; + + float wt_float[40]; + float dp_float_base[120], * dp_float = dp_float_base + 120; + + longword L_max, L_power; + word R, S, dmax, scal; + register word temp; + + /* Search of the optimum scaling of d[0..39]. + */ + dmax = 0; + + for (k = 0; k <= 39; k++) { + temp = d[k]; + temp = GSM_ABS( temp ); + if (temp > dmax) dmax = temp; + } + + temp = 0; + if (dmax == 0) scal = 0; + else { + assert(dmax > 0); + temp = gsm_norm( (longword)dmax << 16 ); + } + + if (temp > 6) scal = 0; + else scal = 6 - temp; + + assert(scal >= 0); + + /* Initialization of a working array wt + */ + + for (k = 0; k < 40; k++) wt_float[k] = SASR( d[k], scal ); + for (k = -120; k < 0; k++) dp_float[k] = dp[k]; + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + + for (lambda = 40; lambda <= 120; lambda += 9) { + + /* Calculate L_result for l = lambda .. lambda + 9. + */ + register float *lp = dp_float - lambda; + + register float W; + register float a = lp[-8], b = lp[-7], c = lp[-6], + d = lp[-5], e = lp[-4], f = lp[-3], + g = lp[-2], h = lp[-1]; + register float E; + register float S0 = 0, S1 = 0, S2 = 0, S3 = 0, S4 = 0, + S5 = 0, S6 = 0, S7 = 0, S8 = 0; + +# undef STEP +# define STEP(K, a, b, c, d, e, f, g, h) \ + W = wt_float[K]; \ + E = W * a; S8 += E; \ + E = W * b; S7 += E; \ + E = W * c; S6 += E; \ + E = W * d; S5 += E; \ + E = W * e; S4 += E; \ + E = W * f; S3 += E; \ + E = W * g; S2 += E; \ + E = W * h; S1 += E; \ + a = lp[K]; \ + E = W * a; S0 += E + +# define STEP_A(K) STEP(K, a, b, c, d, e, f, g, h) +# define STEP_B(K) STEP(K, b, c, d, e, f, g, h, a) +# define STEP_C(K) STEP(K, c, d, e, f, g, h, a, b) +# define STEP_D(K) STEP(K, d, e, f, g, h, a, b, c) +# define STEP_E(K) STEP(K, e, f, g, h, a, b, c, d) +# define STEP_F(K) STEP(K, f, g, h, a, b, c, d, e) +# define STEP_G(K) STEP(K, g, h, a, b, c, d, e, f) +# define STEP_H(K) STEP(K, h, a, b, c, d, e, f, g) + + STEP_A( 0); STEP_B( 1); STEP_C( 2); STEP_D( 3); + STEP_E( 4); STEP_F( 5); STEP_G( 6); STEP_H( 7); + + STEP_A( 8); STEP_B( 9); STEP_C(10); STEP_D(11); + STEP_E(12); STEP_F(13); STEP_G(14); STEP_H(15); + + STEP_A(16); STEP_B(17); STEP_C(18); STEP_D(19); + STEP_E(20); STEP_F(21); STEP_G(22); STEP_H(23); + + STEP_A(24); STEP_B(25); STEP_C(26); STEP_D(27); + STEP_E(28); STEP_F(29); STEP_G(30); STEP_H(31); + + STEP_A(32); STEP_B(33); STEP_C(34); STEP_D(35); + STEP_E(36); STEP_F(37); STEP_G(38); STEP_H(39); + + if (S0 > L_max) { L_max = S0; Nc = lambda; } + if (S1 > L_max) { L_max = S1; Nc = lambda + 1; } + if (S2 > L_max) { L_max = S2; Nc = lambda + 2; } + if (S3 > L_max) { L_max = S3; Nc = lambda + 3; } + if (S4 > L_max) { L_max = S4; Nc = lambda + 4; } + if (S5 > L_max) { L_max = S5; Nc = lambda + 5; } + if (S6 > L_max) { L_max = S6; Nc = lambda + 6; } + if (S7 > L_max) { L_max = S7; Nc = lambda + 7; } + if (S8 > L_max) { L_max = S8; Nc = lambda + 8; } + } + *Nc_out = Nc; + + L_max <<= 1; + + /* Rescaling of L_max + */ + assert(scal <= 100 && scal >= -100); + L_max = L_max >> (6 - scal); /* sub(6, scal) */ + + assert( Nc <= 120 && Nc >= 40); + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + L_power = 0; + for (k = 0; k <= 39; k++) { + + register longword L_temp; + + L_temp = SASR( dp[k - Nc], 3 ); + L_power += L_temp * L_temp; + } + L_power <<= 1; /* from L_MULT */ + + /* Normalization of L_max and L_power + */ + + if (L_max <= 0) { + *bc_out = 0; + return; + } + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + temp = gsm_norm( L_power ); + + R = SASR( L_max << temp, 16 ); + S = SASR( L_power << temp, 16 ); + + /* Coding of the LTP gain + */ + + /* Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + for (bc = 0; bc <= 2; bc++) if (R <= gsm_mult(S, gsm_DLB[bc])) break; + *bc_out = bc; +} + +#ifdef FAST +#ifdef LTP_CUT + +static void Cut_Fast_Calculation_of_the_LTP_parameters P5((st, + d,dp,bc_out,Nc_out), + struct gsm_state * st, /* IN */ + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + register float wt_float; + word Nc, bc; + word wt_max, best_k, ltp_cut; + + float dp_float_base[120], * dp_float = dp_float_base + 120; + + register float L_result, L_max, L_power; + + wt_max = 0; + + for (k = 0; k < 40; ++k) { + if ( d[k] > wt_max) wt_max = d[best_k = k]; + else if (-d[k] > wt_max) wt_max = -d[best_k = k]; + } + + assert(wt_max >= 0); + wt_float = (float)wt_max; + + for (k = -120; k < 0; ++k) dp_float[k] = (float)dp[k]; + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + + for (lambda = 40; lambda <= 120; lambda++) { + L_result = wt_float * dp_float[best_k - lambda]; + if (L_result > L_max) { + Nc = lambda; + L_max = L_result; + } + } + + *Nc_out = Nc; + if (L_max <= 0.) { + *bc_out = 0; + return; + } + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + dp_float -= Nc; + L_power = 0; + for (k = 0; k < 40; ++k) { + register float f = dp_float[k]; + L_power += f * f; + } + + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + /* Coding of the LTP gain + * Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + lambda = L_max / L_power * 32768.; + for (bc = 0; bc <= 2; ++bc) if (lambda <= gsm_DLB[bc]) break; + *bc_out = bc; +} + +#endif /* LTP_CUT */ + +static void Fast_Calculation_of_the_LTP_parameters P4((d,dp,bc_out,Nc_out), + register word * d, /* [0..39] IN */ + register word * dp, /* [-120..-1] IN */ + word * bc_out, /* OUT */ + word * Nc_out /* OUT */ +) +{ + register int k, lambda; + word Nc, bc; + + float wt_float[40]; + float dp_float_base[120], * dp_float = dp_float_base + 120; + + register float L_max, L_power; + + for (k = 0; k < 40; ++k) wt_float[k] = (float)d[k]; + for (k = -120; k < 0; ++k) dp_float[k] = (float)dp[k]; + + /* Search for the maximum cross-correlation and coding of the LTP lag + */ + L_max = 0; + Nc = 40; /* index for the maximum cross-correlation */ + + for (lambda = 40; lambda <= 120; lambda += 9) { + + /* Calculate L_result for l = lambda .. lambda + 9. + */ + register float *lp = dp_float - lambda; + + register float W; + register float a = lp[-8], b = lp[-7], c = lp[-6], + d = lp[-5], e = lp[-4], f = lp[-3], + g = lp[-2], h = lp[-1]; + register float E; + register float S0 = 0, S1 = 0, S2 = 0, S3 = 0, S4 = 0, + S5 = 0, S6 = 0, S7 = 0, S8 = 0; + +# undef STEP +# define STEP(K, a, b, c, d, e, f, g, h) \ + W = wt_float[K]; \ + E = W * a; S8 += E; \ + E = W * b; S7 += E; \ + E = W * c; S6 += E; \ + E = W * d; S5 += E; \ + E = W * e; S4 += E; \ + E = W * f; S3 += E; \ + E = W * g; S2 += E; \ + E = W * h; S1 += E; \ + a = lp[K]; \ + E = W * a; S0 += E + +# define STEP_A(K) STEP(K, a, b, c, d, e, f, g, h) +# define STEP_B(K) STEP(K, b, c, d, e, f, g, h, a) +# define STEP_C(K) STEP(K, c, d, e, f, g, h, a, b) +# define STEP_D(K) STEP(K, d, e, f, g, h, a, b, c) +# define STEP_E(K) STEP(K, e, f, g, h, a, b, c, d) +# define STEP_F(K) STEP(K, f, g, h, a, b, c, d, e) +# define STEP_G(K) STEP(K, g, h, a, b, c, d, e, f) +# define STEP_H(K) STEP(K, h, a, b, c, d, e, f, g) + + STEP_A( 0); STEP_B( 1); STEP_C( 2); STEP_D( 3); + STEP_E( 4); STEP_F( 5); STEP_G( 6); STEP_H( 7); + + STEP_A( 8); STEP_B( 9); STEP_C(10); STEP_D(11); + STEP_E(12); STEP_F(13); STEP_G(14); STEP_H(15); + + STEP_A(16); STEP_B(17); STEP_C(18); STEP_D(19); + STEP_E(20); STEP_F(21); STEP_G(22); STEP_H(23); + + STEP_A(24); STEP_B(25); STEP_C(26); STEP_D(27); + STEP_E(28); STEP_F(29); STEP_G(30); STEP_H(31); + + STEP_A(32); STEP_B(33); STEP_C(34); STEP_D(35); + STEP_E(36); STEP_F(37); STEP_G(38); STEP_H(39); + + if (S0 > L_max) { L_max = S0; Nc = lambda; } + if (S1 > L_max) { L_max = S1; Nc = lambda + 1; } + if (S2 > L_max) { L_max = S2; Nc = lambda + 2; } + if (S3 > L_max) { L_max = S3; Nc = lambda + 3; } + if (S4 > L_max) { L_max = S4; Nc = lambda + 4; } + if (S5 > L_max) { L_max = S5; Nc = lambda + 5; } + if (S6 > L_max) { L_max = S6; Nc = lambda + 6; } + if (S7 > L_max) { L_max = S7; Nc = lambda + 7; } + if (S8 > L_max) { L_max = S8; Nc = lambda + 8; } + } + *Nc_out = Nc; + + if (L_max <= 0.) { + *bc_out = 0; + return; + } + + /* Compute the power of the reconstructed short term residual + * signal dp[..] + */ + dp_float -= Nc; + L_power = 0; + for (k = 0; k < 40; ++k) { + register float f = dp_float[k]; + L_power += f * f; + } + + if (L_max >= L_power) { + *bc_out = 3; + return; + } + + /* Coding of the LTP gain + * Table 4.3a must be used to obtain the level DLB[i] for the + * quantization of the LTP gain b to get the coded version bc. + */ + lambda = L_max / L_power * 32768.; + for (bc = 0; bc <= 2; ++bc) if (lambda <= gsm_DLB[bc]) break; + *bc_out = bc; +} + +#endif /* FAST */ +#endif /* USE_FLOAT_MUL */ + + +/* 4.2.12 */ + +static void Long_term_analysis_filtering P6((bc,Nc,dp,d,dpp,e), + word bc, /* IN */ + word Nc, /* IN */ + register word * dp, /* previous d [-120..-1] IN */ + register word * d, /* d [0..39] IN */ + register word * dpp, /* estimate [0..39] OUT */ + register word * e /* long term res. signal [0..39] OUT */ +) +/* + * In this part, we have to decode the bc parameter to compute + * the samples of the estimate dpp[0..39]. The decoding of bc needs the + * use of table 4.3b. The long term residual signal e[0..39] + * is then calculated to be fed to the RPE encoding section. + */ +{ + register int k; + register longword ltmp; + +# undef STEP +# define STEP(BP) \ + for (k = 0; k <= 39; k++) { \ + dpp[k] = GSM_MULT_R( BP, dp[k - Nc]); \ + e[k] = (word) GSM_SUB( d[k], dpp[k] ); \ + } + + switch (bc) { + case 0: STEP( 3277 ); break; + case 1: STEP( 11469 ); break; + case 2: STEP( 21299 ); break; + case 3: STEP( 32767 ); break; + } +} + +void Gsm_Long_Term_Predictor P7((S,d,dp,e,dpp,Nc,bc), /* 4x for 160 samples */ + + struct gsm_state * S, + + word * d, /* [0..39] residual signal IN */ + word * dp, /* [-120..-1] d' IN */ + + word * e, /* [0..39] OUT */ + word * dpp, /* [0..39] OUT */ + word * Nc, /* correlation lag OUT */ + word * bc /* gain factor OUT */ +) +{ + assert( d ); assert( dp ); assert( e ); + assert( dpp); assert( Nc ); assert( bc ); + +#if defined(FAST) && defined(USE_FLOAT_MUL) + if (S->fast) +#if defined (LTP_CUT) + if (S->ltp_cut) + Cut_Fast_Calculation_of_the_LTP_parameters(S, + d, dp, bc, Nc); + else +#endif /* LTP_CUT */ + Fast_Calculation_of_the_LTP_parameters(d, dp, bc, Nc ); + else +#endif /* FAST & USE_FLOAT_MUL */ +#ifdef LTP_CUT + if (S->ltp_cut) + Cut_Calculation_of_the_LTP_parameters(S, d, dp, bc, Nc); + else +#endif + Calculation_of_the_LTP_parameters(d, dp, bc, Nc); + + Long_term_analysis_filtering( *bc, *Nc, dp, d, dpp, e ); +} + +/* 4.3.2 */ +void Gsm_Long_Term_Synthesis_Filtering P5((S,Ncr,bcr,erp,drp), + struct gsm_state * S, + + word Ncr, + word bcr, + register word * erp, /* [0..39] IN */ + register word * drp /* [-120..-1] IN, [-120..40] OUT */ +) +/* + * This procedure uses the bcr and Ncr parameter to realize the + * long term synthesis filtering. The decoding of bcr needs + * table 4.3b. + */ +{ + register longword ltmp; /* for ADD */ + register int k; + word brp, drpp, Nr; + + /* Check the limits of Nr. + */ + Nr = Ncr < 40 || Ncr > 120 ? S->nrp : Ncr; + S->nrp = Nr; + assert(Nr >= 40 && Nr <= 120); + + /* Decoding of the LTP gain bcr + */ + brp = gsm_QLB[ bcr ]; + + /* Computation of the reconstructed short term residual + * signal drp[0..39] + */ + assert(brp != MIN_WORD); + + for (k = 0; k <= 39; k++) { + drpp = GSM_MULT_R( brp, drp[ k - Nr ] ); + drp[k] = GSM_ADD( erp[k], drpp ); + } + + /* + * Update of the reconstructed short term residual signal + * drp[ -1..-120 ] + */ + + for (k = 0; k <= 119; k++) drp[ -120 + k ] = drp[ -80 + k ]; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/lpc.c b/3rdparty/iaxclient-2/lib/gsm/src/lpc.c new file mode 100644 index 0000000..4ec52ee --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/lpc.c @@ -0,0 +1,371 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +#ifdef K6OPT +#include "k6opt.h" +#endif + +#undef P + +/* + * 4.2.4 .. 4.2.7 LPC ANALYSIS SECTION + */ + +/* 4.2.4 */ + + +static void Autocorrelation P2((s, L_ACF), + word * s, /* [0..159] IN/OUT */ + longword * L_ACF) /* [0..8] OUT */ +/* + * The goal is to compute the array L_ACF[k]. The signal s[i] must + * be scaled in order to avoid an overflow situation. + */ +{ + register int k, i; + + word temp, smax, scalauto; + +#ifdef USE_FLOAT_MUL + float float_s[160]; +#endif + + /* Dynamic scaling of the array s[0..159] + */ + + /* Search for the maximum. + */ +#ifndef K6OPT + smax = 0; + for (k = 0; k <= 159; k++) { + temp = GSM_ABS( s[k] ); + if (temp > smax) smax = temp; + } +#else + { + longword lmax; + lmax = k6maxmin(s,160,NULL); + smax = (lmax > MAX_WORD) ? MAX_WORD : lmax; + } +#endif + /* Computation of the scaling factor. + */ + if (smax == 0) scalauto = 0; + else { + assert(smax > 0); + scalauto = 4 - gsm_norm( (longword)smax << 16 );/* sub(4,..) */ + } + + /* Scaling of the array s[0...159] + */ + + if (scalauto > 0) { +# ifndef K6OPT + +# ifdef USE_FLOAT_MUL +# define SCALE(n) \ + case n: for (k = 0; k <= 159; k++) \ + float_s[k] = (float) \ + (s[k] = GSM_MULT_R(s[k], 16384 >> (n-1)));\ + break; +# else +# define SCALE(n) \ + case n: for (k = 0; k <= 159; k++) \ + s[k] = GSM_MULT_R( s[k], 16384 >> (n-1) );\ + break; +# endif /* USE_FLOAT_MUL */ + + switch (scalauto) { + SCALE(1) + SCALE(2) + SCALE(3) + SCALE(4) + } +# undef SCALE + +# else /* K6OPT */ + k6vsraw(s,160,scalauto); +# endif + } +# ifdef USE_FLOAT_MUL + else for (k = 0; k <= 159; k++) float_s[k] = (float) s[k]; +# endif + + /* Compute the L_ACF[..]. + */ +#ifndef K6OPT + { +# ifdef USE_FLOAT_MUL + register float * sp = float_s; + register float sl = *sp; + +# define STEP(k) L_ACF[k] += (longword)(sl * sp[ -(k) ]); +# else + word * sp = s; + word sl = *sp; + +# define STEP(k) L_ACF[k] += ((longword)sl * sp[ -(k) ]); +# endif + +# define NEXTI sl = *++sp + + + for (k = 9; k--; L_ACF[k] = 0) ; + + STEP (0); + NEXTI; + STEP(0); STEP(1); + NEXTI; + STEP(0); STEP(1); STEP(2); + NEXTI; + STEP(0); STEP(1); STEP(2); STEP(3); + NEXTI; + STEP(0); STEP(1); STEP(2); STEP(3); STEP(4); + NEXTI; + STEP(0); STEP(1); STEP(2); STEP(3); STEP(4); STEP(5); + NEXTI; + STEP(0); STEP(1); STEP(2); STEP(3); STEP(4); STEP(5); STEP(6); + NEXTI; + STEP(0); STEP(1); STEP(2); STEP(3); STEP(4); STEP(5); STEP(6); STEP(7); + + for (i = 8; i <= 159; i++) { + + NEXTI; + + STEP(0); + STEP(1); STEP(2); STEP(3); STEP(4); + STEP(5); STEP(6); STEP(7); STEP(8); + } + + for (k = 9; k--; L_ACF[k] <<= 1) ; + + } + +#else + { + int k; + for (k=0; k<9; k++) { + L_ACF[k] = 2*k6iprod(s,s+k,160-k); + } + } +#endif + /* Rescaling of the array s[0..159] + */ + if (scalauto > 0) { + assert(scalauto <= 4); +#ifndef K6OPT + for (k = 160; k--; *s++ <<= scalauto) ; +# else /* K6OPT */ + k6vsllw(s,160,scalauto); +# endif + } +} + +#if defined(USE_FLOAT_MUL) && defined(FAST) + +static void Fast_Autocorrelation P2((s, L_ACF), + word * s, /* [0..159] IN/OUT */ + longword * L_ACF) /* [0..8] OUT */ +{ + register int k, i; + float f_L_ACF[9]; + float scale; + + float s_f[160]; + register float *sf = s_f; + + for (i = 0; i < 160; ++i) sf[i] = s[i]; + for (k = 0; k <= 8; k++) { + register float L_temp2 = 0; + register float *sfl = sf - k; + for (i = k; i < 160; ++i) L_temp2 += sf[i] * sfl[i]; + f_L_ACF[k] = L_temp2; + } + scale = MAX_LONGWORD / f_L_ACF[0]; + + for (k = 0; k <= 8; k++) { + L_ACF[k] = f_L_ACF[k] * scale; + } +} +#endif /* defined (USE_FLOAT_MUL) && defined (FAST) */ + +/* 4.2.5 */ + +static void Reflection_coefficients P2( (L_ACF, r), + longword * L_ACF, /* 0...8 IN */ + register word * r /* 0...7 OUT */ +) +{ + register int i, m, n; + register word temp; + register longword ltmp; + word ACF[9]; /* 0..8 */ + word P[ 9]; /* 0..8 */ + word K[ 9]; /* 2..8 */ + + /* Schur recursion with 16 bits arithmetic. + */ + + if (L_ACF[0] == 0) { + for (i = 8; i--; *r++ = 0) ; + return; + } + + assert( L_ACF[0] != 0 ); + temp = gsm_norm( L_ACF[0] ); + + assert(temp >= 0 && temp < 32); + + /* ? overflow ? */ + for (i = 0; i <= 8; i++) ACF[i] = SASR( L_ACF[i] << temp, 16 ); + + /* Initialize array P[..] and K[..] for the recursion. + */ + + for (i = 1; i <= 7; i++) K[ i ] = ACF[ i ]; + for (i = 0; i <= 8; i++) P[ i ] = ACF[ i ]; + + /* Compute reflection coefficients + */ + for (n = 1; n <= 8; n++, r++) { + + temp = P[1]; + temp = GSM_ABS(temp); + if (P[0] < temp) { + for (i = n; i <= 8; i++) *r++ = 0; + return; + } + + *r = gsm_div( temp, P[0] ); + + assert(*r >= 0); + if (P[1] > 0) *r = -*r; /* r[n] = sub(0, r[n]) */ + assert (*r != MIN_WORD); + if (n == 8) return; + + /* Schur recursion + */ + temp = GSM_MULT_R( P[1], *r ); + P[0] = GSM_ADD( P[0], temp ); + + for (m = 1; m <= 8 - n; m++) { + temp = GSM_MULT_R( K[ m ], *r ); + P[m] = GSM_ADD( P[ m+1 ], temp ); + + temp = GSM_MULT_R( P[ m+1 ], *r ); + K[m] = GSM_ADD( K[ m ], temp ); + } + } +} + +/* 4.2.6 */ + +static void Transformation_to_Log_Area_Ratios P1((r), + register word * r /* 0..7 IN/OUT */ +) +/* + * The following scaling for r[..] and LAR[..] has been used: + * + * r[..] = integer( real_r[..]*32768. ); -1 <= real_r < 1. + * LAR[..] = integer( real_LAR[..] * 16384 ); + * with -1.625 <= real_LAR <= 1.625 + */ +{ + register word temp; + register int i; + + + /* Computation of the LAR[0..7] from the r[0..7] + */ + for (i = 1; i <= 8; i++, r++) { + + temp = *r; + temp = GSM_ABS(temp); + assert(temp >= 0); + + if (temp < 22118) { + temp >>= 1; + } else if (temp < 31130) { + assert( temp >= 11059 ); + temp -= 11059; + } else { + assert( temp >= 26112 ); + temp -= 26112; + temp <<= 2; + } + + *r = *r < 0 ? -temp : temp; + assert( *r != MIN_WORD ); + } +} + +/* 4.2.7 */ + +static void Quantization_and_coding P1((LAR), + register word * LAR /* [0..7] IN/OUT */ +) +{ + register word temp; + longword ltmp; + + + /* This procedure needs four tables; the following equations + * give the optimum scaling for the constants: + * + * A[0..7] = integer( real_A[0..7] * 1024 ) + * B[0..7] = integer( real_B[0..7] * 512 ) + * MAC[0..7] = maximum of the LARc[0..7] + * MIC[0..7] = minimum of the LARc[0..7] + */ + +# undef STEP +# define STEP( A, B, MAC, MIC ) \ + temp = GSM_MULT( A, *LAR ); \ + temp = GSM_ADD( temp, B ); \ + temp = GSM_ADD( temp, 256 ); \ + temp = SASR( temp, 9 ); \ + *LAR = temp>MAC ? MAC - MIC : (tempfast) Fast_Autocorrelation (s, L_ACF ); + else +#endif + Autocorrelation (s, L_ACF ); + Reflection_coefficients (L_ACF, LARc ); + Transformation_to_Log_Area_Ratios (LARc); + Quantization_and_coding (LARc); +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/preprocess.c b/3rdparty/iaxclient-2/lib/gsm/src/preprocess.c new file mode 100644 index 0000000..83c3f6a --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/preprocess.c @@ -0,0 +1,129 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +/* 4.2.0 .. 4.2.3 PREPROCESSING SECTION + * + * After A-law to linear conversion (or directly from the + * Ato D converter) the following scaling is assumed for + * input to the RPE-LTP algorithm: + * + * in: 0.1.....................12 + * S.v.v.v.v.v.v.v.v.v.v.v.v.*.*.* + * + * Where S is the sign bit, v a valid bit, and * a "don't care" bit. + * The original signal is called sop[..] + * + * out: 0.1................... 12 + * S.S.v.v.v.v.v.v.v.v.v.v.v.v.0.0 + */ + + +void Gsm_Preprocess P3((S, s, so), + struct gsm_state * S, + word * s, + word * so ) /* [0..159] IN/OUT */ +{ + + word z1 = S->z1; + longword L_z2 = S->L_z2; + word mp = S->mp; + + word s1; + + + word SO; + + longword ltmp; /* for ADD */ + ulongword utmp; /* for L_ADD */ + + register int k = 160; + + while (k--) { + + /* 4.2.1 Downscaling of the input signal + */ + /* SO = SASR( *s, 3 ) << 2;*/ + SO = SASR( *s, 1 ) & ~3; + s++; + + assert (SO >= -0x4000); /* downscaled by */ + assert (SO <= 0x3FFC); /* previous routine. */ + + + /* 4.2.2 Offset compensation + * + * This part implements a high-pass filter and requires extended + * arithmetic precision for the recursive part of this filter. + * The input of this procedure is the array so[0...159] and the + * output the array sof[ 0...159 ]. + */ + /* Compute the non-recursive part + */ + + s1 = SO - z1; /* s1 = gsm_sub( *so, z1 ); */ + z1 = SO; + + assert(s1 != MIN_WORD); + + /* SJB Remark: float might be faster than the mess that follows */ + + /* Compute the recursive part + */ + + /* Execution of a 31 bv 16 bits multiplication + */ + { + word msp, lsp; + longword L_s2; + longword L_temp; + + L_s2 = s1; + L_s2 <<= 15; +#ifndef __GNUC__ + msp = SASR( L_z2, 15 ); + lsp = L_z2 & 0x7fff; /* gsm_L_sub(L_z2,(msp<<15)); */ + + L_s2 += GSM_MULT_R( lsp, 32735 ); + L_temp = (longword)msp * 32735; /* GSM_L_MULT(msp,32735) >> 1;*/ + L_z2 = GSM_L_ADD( L_temp, L_s2 ); + /* above does L_z2 = L_z2 * 0x7fd5/0x8000 + L_s2 */ +#else + L_z2 = ((long long)L_z2*32735 + 0x4000)>>15; + /* alternate (ansi) version of above line does slightly different rounding: + * L_temp = L_z2 >> 9; + * L_temp += L_temp >> 5; + * L_temp = (++L_temp) >> 1; + * L_z2 = L_z2 - L_temp; + */ + L_z2 = GSM_L_ADD(L_z2,L_s2); +#endif + /* Compute sof[k] with rounding + */ + L_temp = GSM_L_ADD( L_z2, 16384 ); + + /* 4.2.3 Preemphasis + */ + + msp = GSM_MULT_R( mp, -28180 ); + mp = SASR( L_temp, 15 ); + *so++ = GSM_ADD( mp, msp ); + } + } + + S->z1 = z1; + S->L_z2 = L_z2; + S->mp = mp; +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/rpe.c b/3rdparty/iaxclient-2/lib/gsm/src/rpe.c new file mode 100644 index 0000000..80cce0b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/rpe.c @@ -0,0 +1,491 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" + +/* 4.2.13 .. 4.2.17 RPE ENCODING SECTION + */ + +/* 4.2.13 */ +#ifdef K6OPT +#include "k6opt.h" +#else +static void Weighting_filter P2((e, x), + register word * e, /* signal [-5..0.39.44] IN */ + word * x /* signal [0..39] OUT */ +) +/* + * The coefficients of the weighting filter are stored in a table + * (see table 4.4). The following scaling is used: + * + * H[0..10] = integer( real_H[ 0..10] * 8192 ); + */ +{ + /* word wt[ 50 ]; */ + + register longword L_result; + register int k /* , i */ ; + + /* Initialization of a temporary working array wt[0...49] + */ + + /* for (k = 0; k <= 4; k++) wt[k] = 0; + * for (k = 5; k <= 44; k++) wt[k] = *e++; + * for (k = 45; k <= 49; k++) wt[k] = 0; + * + * (e[-5..-1] and e[40..44] are allocated by the caller, + * are initially zero and are not written anywhere.) + */ + e -= 5; + + /* Compute the signal x[0..39] + */ + for (k = 0; k <= 39; k++) { + + L_result = 8192 >> 1; + + /* for (i = 0; i <= 10; i++) { + * L_temp = GSM_L_MULT( wt[k+i], gsm_H[i] ); + * L_result = GSM_L_ADD( L_result, L_temp ); + * } + */ + +#undef STEP +#define STEP( i, H ) (e[ k + i ] * (longword)H) + + /* Every one of these multiplications is done twice -- + * but I don't see an elegant way to optimize this. + * Do you? + */ + +#ifdef STUPID_COMPILER + L_result += STEP( 0, -134 ) ; + L_result += STEP( 1, -374 ) ; + /* + STEP( 2, 0 ) */ + L_result += STEP( 3, 2054 ) ; + L_result += STEP( 4, 5741 ) ; + L_result += STEP( 5, 8192 ) ; + L_result += STEP( 6, 5741 ) ; + L_result += STEP( 7, 2054 ) ; + /* + STEP( 8, 0 ) */ + L_result += STEP( 9, -374 ) ; + L_result += STEP( 10, -134 ) ; +#else + L_result += + STEP( 0, -134 ) + + STEP( 1, -374 ) + /* + STEP( 2, 0 ) */ + + STEP( 3, 2054 ) + + STEP( 4, 5741 ) + + STEP( 5, 8192 ) + + STEP( 6, 5741 ) + + STEP( 7, 2054 ) + /* + STEP( 8, 0 ) */ + + STEP( 9, -374 ) + + STEP(10, -134 ) + ; +#endif + + /* L_result = GSM_L_ADD( L_result, L_result ); (* scaling(x2) *) + * L_result = GSM_L_ADD( L_result, L_result ); (* scaling(x4) *) + * + * x[k] = SASR( L_result, 16 ); + */ + + /* 2 adds vs. >>16 => 14, minus one shift to compensate for + * those we lost when replacing L_MULT by '*'. + */ + + L_result = SASR( L_result, 13 ); + x[k] = (word) (L_result < MIN_WORD ? MIN_WORD + : (L_result > MAX_WORD ? MAX_WORD : L_result)); + } +} +#endif /* K6OPT */ + +/* 4.2.14 */ + +static void RPE_grid_selection P3((x,xM,Mc_out), + word * x, /* [0..39] IN */ + word * xM, /* [0..12] OUT */ + word * Mc_out /* OUT */ +) +/* + * The signal x[0..39] is used to select the RPE grid which is + * represented by Mc. + */ +{ + /* register word temp1; */ + register int /* m, */ i; + register longword L_result, L_temp; + longword EM; /* xxx should be L_EM? */ + word Mc; + + longword L_common_0_3; + + EM = 0; + Mc = 0; + + /* for (m = 0; m <= 3; m++) { + * L_result = 0; + * + * + * for (i = 0; i <= 12; i++) { + * + * temp1 = SASR( x[m + 3*i], 2 ); + * + * assert(temp1 != MIN_WORD); + * + * L_temp = GSM_L_MULT( temp1, temp1 ); + * L_result = GSM_L_ADD( L_temp, L_result ); + * } + * + * if (L_result > EM) { + * Mc = m; + * EM = L_result; + * } + * } + */ + +#undef STEP +#define STEP( m, i ) L_temp = SASR( x[m + 3 * i], 2 ); \ + L_result += L_temp * L_temp; + + /* common part of 0 and 3 */ + + L_result = 0; + STEP( 0, 1 ); STEP( 0, 2 ); STEP( 0, 3 ); STEP( 0, 4 ); + STEP( 0, 5 ); STEP( 0, 6 ); STEP( 0, 7 ); STEP( 0, 8 ); + STEP( 0, 9 ); STEP( 0, 10); STEP( 0, 11); STEP( 0, 12); + L_common_0_3 = L_result; + + /* i = 0 */ + + STEP( 0, 0 ); + L_result <<= 1; /* implicit in L_MULT */ + EM = L_result; + + /* i = 1 */ + + L_result = 0; + STEP( 1, 0 ); + STEP( 1, 1 ); STEP( 1, 2 ); STEP( 1, 3 ); STEP( 1, 4 ); + STEP( 1, 5 ); STEP( 1, 6 ); STEP( 1, 7 ); STEP( 1, 8 ); + STEP( 1, 9 ); STEP( 1, 10); STEP( 1, 11); STEP( 1, 12); + L_result <<= 1; + if (L_result > EM) { + Mc = 1; + EM = L_result; + } + + /* i = 2 */ + + L_result = 0; + STEP( 2, 0 ); + STEP( 2, 1 ); STEP( 2, 2 ); STEP( 2, 3 ); STEP( 2, 4 ); + STEP( 2, 5 ); STEP( 2, 6 ); STEP( 2, 7 ); STEP( 2, 8 ); + STEP( 2, 9 ); STEP( 2, 10); STEP( 2, 11); STEP( 2, 12); + L_result <<= 1; + if (L_result > EM) { + Mc = 2; + EM = L_result; + } + + /* i = 3 */ + + L_result = L_common_0_3; + STEP( 3, 12 ); + L_result <<= 1; + if (L_result > EM) { + Mc = 3; + EM = L_result; + } + + /**/ + + /* Down-sampling by a factor 3 to get the selected xM[0..12] + * RPE sequence. + */ + for (i = 0; i <= 12; i ++) xM[i] = x[Mc + 3*i]; + *Mc_out = Mc; +} + +/* 4.12.15 */ + +static void APCM_quantization_xmaxc_to_exp_mant P3((xmaxc,exp_out,mant_out), + word xmaxc, /* IN */ + word * exp_out, /* OUT */ + word * mant_out ) /* OUT */ +{ + word exp, mant; + + /* Compute exponent and mantissa of the decoded version of xmaxc + */ + + exp = 0; + if (xmaxc > 15) exp = SASR(xmaxc, 3) - 1; + mant = xmaxc - (exp << 3); + + if (mant == 0) { + exp = -4; + mant = 7; + } + else { + while (mant <= 7) { + mant = mant << 1 | 1; + exp--; + } + mant -= 8; + } + + assert( exp >= -4 && exp <= 6 ); + assert( mant >= 0 && mant <= 7 ); + + *exp_out = exp; + *mant_out = mant; +} + +static void APCM_quantization P5((xM,xMc,mant_out,exp_out,xmaxc_out), + word * xM, /* [0..12] IN */ + + word * xMc, /* [0..12] OUT */ + word * mant_out, /* OUT */ + word * exp_out, /* OUT */ + word * xmaxc_out /* OUT */ +) +{ + int i, itest; + + word xmax, xmaxc, temp, temp1, temp2; + word exp, mant; + + + /* Find the maximum absolute value xmax of xM[0..12]. + */ + + xmax = 0; + for (i = 0; i <= 12; i++) { + temp = xM[i]; + temp = GSM_ABS(temp); + if (temp > xmax) xmax = temp; + } + + /* Qantizing and coding of xmax to get xmaxc. + */ + + exp = 0; + temp = SASR( xmax, 9 ); + itest = 0; + + for (i = 0; i <= 5; i++) { + + itest |= (temp <= 0); + temp = SASR( temp, 1 ); + + assert(exp <= 5); + if (itest == 0) exp++; /* exp = add (exp, 1) */ + } + + assert(exp <= 6 && exp >= 0); + temp = exp + 5; + + assert(temp <= 11 && temp >= 0); + xmaxc = gsm_add( SASR(xmax, temp), exp << 3 ); + + /* Quantizing and coding of the xM[0..12] RPE sequence + * to get the xMc[0..12] + */ + + APCM_quantization_xmaxc_to_exp_mant( xmaxc, &exp, &mant ); + + /* This computation uses the fact that the decoded version of xmaxc + * can be calculated by using the exponent and the mantissa part of + * xmaxc (logarithmic table). + * So, this method avoids any division and uses only a scaling + * of the RPE samples by a function of the exponent. A direct + * multiplication by the inverse of the mantissa (NRFAC[0..7] + * found in table 4.5) gives the 3 bit coded version xMc[0..12] + * of the RPE samples. + */ + + + /* Direct computation of xMc[0..12] using table 4.5 + */ + + assert( exp <= 4096 && exp >= -4096); + assert( mant >= 0 && mant <= 7 ); + + temp1 = 6 - exp; /* normalization by the exponent */ + temp2 = gsm_NRFAC[ mant ]; /* inverse mantissa */ + + for (i = 0; i <= 12; i++) { + + assert(temp1 >= 0 && temp1 < 16); + + temp = xM[i] << temp1; + temp = GSM_MULT( temp, temp2 ); + temp = SASR(temp, 12); + xMc[i] = temp + 4; /* see note below */ + } + + /* NOTE: This equation is used to make all the xMc[i] positive. + */ + + *mant_out = mant; + *exp_out = exp; + *xmaxc_out = xmaxc; +} + +/* 4.2.16 */ + +static void APCM_inverse_quantization P4((xMc,mant,exp,xMp), + register word * xMc, /* [0..12] IN */ + word mant, + word exp, + register word * xMp) /* [0..12] OUT */ +/* + * This part is for decoding the RPE sequence of coded xMc[0..12] + * samples to obtain the xMp[0..12] array. Table 4.6 is used to get + * the mantissa of xmaxc (FAC[0..7]). + */ +{ + int i; + word temp, temp1, temp2, temp3; + longword ltmp; + + assert( mant >= 0 && mant <= 7 ); + + temp1 = gsm_FAC[ mant ]; /* see 4.2-15 for mant */ + temp2 = gsm_sub( 6, exp ); /* see 4.2-15 for exp */ + temp3 = gsm_asl( 1, gsm_sub( temp2, 1 )); + + for (i = 13; i--;) { + + assert( *xMc <= 7 && *xMc >= 0 ); /* 3 bit unsigned */ + + /* temp = gsm_sub( *xMc++ << 1, 7 ); */ + temp = (*xMc++ << 1) - 7; /* restore sign */ + assert( temp <= 7 && temp >= -7 ); /* 4 bit signed */ + + temp <<= 12; /* 16 bit signed */ + temp = GSM_MULT_R( temp1, temp ); + temp = GSM_ADD( temp, temp3 ); + *xMp++ = gsm_asr( temp, temp2 ); + } +} + +/* 4.2.17 */ + +static void RPE_grid_positioning P3((Mc,xMp,ep), + word Mc, /* grid position IN */ + register word * xMp, /* [0..12] IN */ + register word * ep /* [0..39] OUT */ +) +/* + * This procedure computes the reconstructed long term residual signal + * ep[0..39] for the LTP analysis filter. The inputs are the Mc + * which is the grid position selection and the xMp[0..12] decoded + * RPE samples which are upsampled by a factor of 3 by inserting zero + * values. + */ +{ + int i = 13; + + assert(0 <= Mc && Mc <= 3); + + switch (Mc) { + case 3: *ep++ = 0; + case 2: do { + *ep++ = 0; + case 1: *ep++ = 0; + case 0: *ep++ = *xMp++; + } while (--i); + } + while (++Mc < 4) *ep++ = 0; + + /* + + int i, k; + for (k = 0; k <= 39; k++) ep[k] = 0; + for (i = 0; i <= 12; i++) { + ep[ Mc + (3*i) ] = xMp[i]; + } + */ +} + +/* 4.2.18 */ + +/* This procedure adds the reconstructed long term residual signal + * ep[0..39] to the estimated signal dpp[0..39] from the long term + * analysis filter to compute the reconstructed short term residual + * signal dp[-40..-1]; also the reconstructed short term residual + * array dp[-120..-41] is updated. + */ + +#if 0 /* Has been inlined in code.c */ +void Gsm_Update_of_reconstructed_short_time_residual_signal P3((dpp, ep, dp), + word * dpp, /* [0...39] IN */ + word * ep, /* [0...39] IN */ + word * dp) /* [-120...-1] IN/OUT */ +{ + int k; + + for (k = 0; k <= 79; k++) + dp[ -120 + k ] = dp[ -80 + k ]; + + for (k = 0; k <= 39; k++) + dp[ -40 + k ] = gsm_add( ep[k], dpp[k] ); +} +#endif /* Has been inlined in code.c */ + +void Gsm_RPE_Encoding P5((S,e,xmaxc,Mc,xMc), + + struct gsm_state * S, + + word * e, /* -5..-1][0..39][40..44 IN/OUT */ + word * xmaxc, /* OUT */ + word * Mc, /* OUT */ + word * xMc) /* [0..12] OUT */ +{ + word x[40]; + word xM[13], xMp[13]; + word mant, exp; + + Weighting_filter(e, x); + RPE_grid_selection(x, xM, Mc); + + APCM_quantization( xM, xMc, &mant, &exp, xmaxc); + APCM_inverse_quantization( xMc, mant, exp, xMp); + + RPE_grid_positioning( *Mc, xMp, e ); + +} + +void Gsm_RPE_Decoding P5((S, xmaxcr, Mcr, xMcr, erp), + struct gsm_state * S, + + word xmaxcr, + word Mcr, + word * xMcr, /* [0..12], 3 bits IN */ + word * erp /* [0..39] OUT */ +) +{ + word exp, mant; + word xMp[ 13 ]; + + APCM_quantization_xmaxc_to_exp_mant( xmaxcr, &exp, &mant ); + APCM_inverse_quantization( xMcr, mant, exp, xMp ); + RPE_grid_positioning( Mcr, xMp, erp ); + +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/short_term.c b/3rdparty/iaxclient-2/lib/gsm/src/short_term.c new file mode 100644 index 0000000..e7dd754 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/short_term.c @@ -0,0 +1,452 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +#include +#include + +#include "private.h" + +#include "gsm.h" +#include "proto.h" +#ifdef K6OPT +#include "k6opt.h" + +#define Short_term_analysis_filtering Short_term_analysis_filteringx + +#endif +/* + * SHORT TERM ANALYSIS FILTERING SECTION + */ + +/* 4.2.8 */ + +static void Decoding_of_the_coded_Log_Area_Ratios P2((LARc,LARpp), + word * LARc, /* coded log area ratio [0..7] IN */ + word * LARpp) /* out: decoded .. */ +{ + register word temp1 /* , temp2 */; + register long ltmp; /* for GSM_ADD */ + + /* This procedure requires for efficient implementation + * two tables. + * + * INVA[1..8] = integer( (32768 * 8) / real_A[1..8]) + * MIC[1..8] = minimum value of the LARc[1..8] + */ + + /* Compute the LARpp[1..8] + */ + + /* for (i = 1; i <= 8; i++, B++, MIC++, INVA++, LARc++, LARpp++) { + * + * temp1 = GSM_ADD( *LARc, *MIC ) << 10; + * temp2 = *B << 1; + * temp1 = GSM_SUB( temp1, temp2 ); + * + * assert(*INVA != MIN_WORD); + * + * temp1 = GSM_MULT_R( *INVA, temp1 ); + * *LARpp = GSM_ADD( temp1, temp1 ); + * } + */ + +#undef STEP +#define STEP( B, MIC, INVA ) \ + temp1 = (word) GSM_ADD( *LARc++, MIC ) << 10; \ + temp1 = (word) GSM_SUB( temp1, B << 1 ); \ + temp1 = (word) GSM_MULT_R( INVA, temp1 ); \ + *LARpp++ = (word) GSM_ADD( temp1, temp1 ); + + STEP( 0, -32, 13107 ); + STEP( 0, -32, 13107 ); + STEP( 2048, -16, 13107 ); + STEP( -2560, -16, 13107 ); + + STEP( 94, -8, 19223 ); + STEP( -1792, -8, 17476 ); + STEP( -341, -4, 31454 ); + STEP( -1144, -4, 29708 ); + + /* NOTE: the addition of *MIC is used to restore + * the sign of *LARc. + */ +} + +/* 4.2.9 */ +/* Computation of the quantized reflection coefficients + */ + +/* 4.2.9.1 Interpolation of the LARpp[1..8] to get the LARp[1..8] + */ + +/* + * Within each frame of 160 analyzed speech samples the short term + * analysis and synthesis filters operate with four different sets of + * coefficients, derived from the previous set of decoded LARs(LARpp(j-1)) + * and the actual set of decoded LARs (LARpp(j)) + * + * (Initial value: LARpp(j-1)[1..8] = 0.) + */ + +static void Coefficients_0_12 P3((LARpp_j_1, LARpp_j, LARp), + register word * LARpp_j_1, + register word * LARpp_j, + register word * LARp) +{ + register int i; + register longword ltmp; + + for (i = 1; i <= 8; i++, LARp++, LARpp_j_1++, LARpp_j++) { + *LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 )); + *LARp = GSM_ADD( *LARp, SASR( *LARpp_j_1, 1)); + } +} + +static void Coefficients_13_26 P3((LARpp_j_1, LARpp_j, LARp), + register word * LARpp_j_1, + register word * LARpp_j, + register word * LARp) +{ + register int i; + register longword ltmp; + for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) { + *LARp = GSM_ADD( SASR( *LARpp_j_1, 1), SASR( *LARpp_j, 1 )); + } +} + +static void Coefficients_27_39 P3((LARpp_j_1, LARpp_j, LARp), + register word * LARpp_j_1, + register word * LARpp_j, + register word * LARp) +{ + register int i; + register longword ltmp; + + for (i = 1; i <= 8; i++, LARpp_j_1++, LARpp_j++, LARp++) { + *LARp = GSM_ADD( SASR( *LARpp_j_1, 2 ), SASR( *LARpp_j, 2 )); + *LARp = GSM_ADD( *LARp, SASR( *LARpp_j, 1 )); + } +} + + +static void Coefficients_40_159 P2((LARpp_j, LARp), + register word * LARpp_j, + register word * LARp) +{ + register int i; + + for (i = 1; i <= 8; i++, LARp++, LARpp_j++) + *LARp = *LARpp_j; +} + +/* 4.2.9.2 */ + +static void LARp_to_rp P1((LARp), + register word * LARp) /* [0..7] IN/OUT */ +/* + * The input of this procedure is the interpolated LARp[0..7] array. + * The reflection coefficients, rp[i], are used in the analysis + * filter and in the synthesis filter. + */ +{ + register int i; + register word temp; + register longword ltmp; + + for (i = 1; i <= 8; i++, LARp++) { + + /* temp = GSM_ABS( *LARp ); + * + * if (temp < 11059) temp <<= 1; + * else if (temp < 20070) temp += 11059; + * else temp = GSM_ADD( temp >> 2, 26112 ); + * + * *LARp = *LARp < 0 ? -temp : temp; + */ + + if (*LARp < 0) { + temp = *LARp == MIN_WORD ? MAX_WORD : -(*LARp); + *LARp = - ((temp < 11059) ? temp << 1 + : ((temp < 20070) ? temp + 11059 + : GSM_ADD( temp >> 2, 26112 ))); + } else { + temp = *LARp; + *LARp = (temp < 11059) ? temp << 1 + : ((temp < 20070) ? temp + 11059 + : GSM_ADD( temp >> 2, 26112 )); + } + } +} + + +/* 4.2.10 */ +#ifndef Short_term_analysis_filtering + +/* SJB Remark: + * I tried 2 MMX versions of this function, neither is significantly + * faster than the C version which follows. MMX might be useful if + * one were processing 2 input streams in parallel. + */ +static void Short_term_analysis_filtering P4((u0,rp0,k_n,s), + register word * u0, + register word * rp0, /* [0..7] IN */ + register int k_n, /* k_end - k_start */ + register word * s /* [0..n-1] IN/OUT */ +) +/* + * This procedure computes the short term residual signal d[..] to be fed + * to the RPE-LTP loop from the s[..] signal and from the local rp[..] + * array (quantized reflection coefficients). As the call of this + * procedure can be done in many ways (see the interpolation of the LAR + * coefficient), it is assumed that the computation begins with index + * k_start (for arrays d[..] and s[..]) and stops with index k_end + * (k_start and k_end are defined in 4.2.9.1). This procedure also + * needs to keep the array u0[0..7] in memory for each call. + */ +{ + register word * u_top = u0 + 8; + register word * s_top = s + k_n; + + while (s < s_top) { + register word *u, *rp ; + register longword di, u_out; + di = u_out = *s; + for (rp=rp0, u=u0; u>15); + di = di + (((rpi*ui)+0x4000)>>15); + /* make the common case fastest: */ + if ((u_out == (word)u_out) && (di == (word)di)) continue; + /* otherwise do slower fixup (saturation) */ + if (u_out>MAX_WORD) u_out=MAX_WORD; + else if (u_outMAX_WORD) di=MAX_WORD; + else if (div; + register int i; + register longword sri; + + while (k--) { + sri = *wt++; + for (i = 8; i--;) { + register longword tmp1, tmp2; + + /* sri = GSM_SUB( sri, gsm_mult_r( rrp[i], v[i] ) ); + */ + tmp1 = rrp[i]; + tmp2 = v[i]; + + tmp2 = (( tmp1 * tmp2 + 16384) >> 15) ; + /* saturation done below */ + sri -= tmp2; + if (sri != (word)sri) { + sri = (sri<0)? MIN_WORD:MAX_WORD; + } + /* v[i+1] = GSM_ADD( v[i], gsm_mult_r( rrp[i], sri ) ); + */ + + tmp1 = (( tmp1 * sri + 16384) >> 15) ; + /* saturation done below */ + tmp1 += v[i]; + if (tmp1 != (word)tmp1) { + tmp1 = (tmp1<0)? MIN_WORD:MAX_WORD; + } + v[i+1] = (word) tmp1; + } + *sr++ = v[0] = (word) sri; + } +} + + +#if defined(FAST) && defined(USE_FLOAT_MUL) + +static void Fast_Short_term_synthesis_filtering P5((S,rrp,k,wt,sr), + struct gsm_state * S, + register word * rrp, /* [0..7] IN */ + register int k, /* k_end - k_start */ + register word * wt, /* [0..k-1] IN */ + register word * sr /* [0..k-1] OUT */ +) +{ + register word * v = S->v; + register int i; + + float va[9], rrpa[8]; + register float scalef = 3.0517578125e-5, temp; + + for (i = 0; i < 8; ++i) { + va[i] = v[i]; + rrpa[i] = (float)rrp[i] * scalef; + } + while (k--) { + register float sri = *wt++; + for (i = 8; i--;) { + sri -= rrpa[i] * va[i]; + if (sri < -32768.) sri = -32768.; + else if (sri > 32767.) sri = 32767.; + + temp = va[i] + rrpa[i] * sri; + if (temp < -32768.) temp = -32768.; + else if (temp > 32767.) temp = 32767.; + va[i+1] = temp; + } + *sr++ = va[0] = sri; + } + for (i = 0; i < 9; ++i) v[i] = va[i]; +} + +#endif /* defined(FAST) && defined(USE_FLOAT_MUL) */ + +void Gsm_Short_Term_Analysis_Filter P3((S,LARc,s), + + struct gsm_state * S, + + word * LARc, /* coded log area ratio [0..7] IN */ + word * s /* signal [0..159] IN/OUT */ +) +{ + word * LARpp_j = S->LARpp[ S->j ]; + word * LARpp_j_1 = S->LARpp[ S->j ^= 1 ]; + + word LARp[8]; +#undef FILTER +#if defined(FAST) && defined(USE_FLOAT_MUL) +# define FILTER (* (S->fast \ + ? Fast_Short_term_analysis_filtering \ + : Short_term_analysis_filtering )) + +#else +# define FILTER Short_term_analysis_filtering +#endif + + Decoding_of_the_coded_Log_Area_Ratios( LARc, LARpp_j ); + + Coefficients_0_12( LARpp_j_1, LARpp_j, LARp ); + LARp_to_rp( LARp ); + FILTER( S->u, LARp, 13, s); + + Coefficients_13_26( LARpp_j_1, LARpp_j, LARp); + LARp_to_rp( LARp ); + FILTER( S->u, LARp, 14, s + 13); + + Coefficients_27_39( LARpp_j_1, LARpp_j, LARp); + LARp_to_rp( LARp ); + FILTER( S->u, LARp, 13, s + 27); + + Coefficients_40_159( LARpp_j, LARp); + LARp_to_rp( LARp ); + FILTER( S->u, LARp, 120, s + 40); + +} + +void Gsm_Short_Term_Synthesis_Filter P4((S, LARcr, wt, s), + struct gsm_state * S, + + word * LARcr, /* received log area ratios [0..7] IN */ + word * wt, /* received d [0..159] IN */ + + word * s /* signal s [0..159] OUT */ +) +{ + word * LARpp_j = S->LARpp[ S->j ]; + word * LARpp_j_1 = S->LARpp[ S->j ^=1 ]; + + word LARp[8]; + +#undef FILTER +#if defined(FAST) && defined(USE_FLOAT_MUL) + +# define FILTER (* (S->fast \ + ? Fast_Short_term_synthesis_filtering \ + : Short_term_synthesis_filtering )) +#else +# define FILTER Short_term_synthesis_filtering +#endif + + Decoding_of_the_coded_Log_Area_Ratios( LARcr, LARpp_j ); + + Coefficients_0_12( LARpp_j_1, LARpp_j, LARp ); + LARp_to_rp( LARp ); + FILTER( S, LARp, 13, wt, s ); + + Coefficients_13_26( LARpp_j_1, LARpp_j, LARp); + LARp_to_rp( LARp ); + FILTER( S, LARp, 14, wt + 13, s + 13 ); + + Coefficients_27_39( LARpp_j_1, LARpp_j, LARp); + LARp_to_rp( LARp ); + FILTER( S, LARp, 13, wt + 27, s + 27 ); + + Coefficients_40_159( LARpp_j, LARp ); + LARp_to_rp( LARp ); + FILTER(S, LARp, 120, wt + 40, s + 40); +} diff --git a/3rdparty/iaxclient-2/lib/gsm/src/table.c b/3rdparty/iaxclient-2/lib/gsm/src/table.c new file mode 100644 index 0000000..16a0411 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/gsm/src/table.c @@ -0,0 +1,63 @@ +/* + * Copyright 1992 by Jutta Degener and Carsten Bormann, Technische + * Universitaet Berlin. See the accompanying file "COPYRIGHT" for + * details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + */ + +/* $Header$ */ + +/* Most of these tables are inlined at their point of use. + */ + +/* 4.4 TABLES USED IN THE FIXED POINT IMPLEMENTATION OF THE RPE-LTP + * CODER AND DECODER + * + * (Most of them inlined, so watch out.) + */ + +#define GSM_TABLE_C +#include "private.h" +#include "gsm.h" + +/* Table 4.1 Quantization of the Log.-Area Ratios + */ +/* i 1 2 3 4 5 6 7 8 */ +word gsm_A[8] = {20480, 20480, 20480, 20480, 13964, 15360, 8534, 9036}; +word gsm_B[8] = { 0, 0, 2048, -2560, 94, -1792, -341, -1144}; +word gsm_MIC[8] = { -32, -32, -16, -16, -8, -8, -4, -4 }; +word gsm_MAC[8] = { 31, 31, 15, 15, 7, 7, 3, 3 }; + + +/* Table 4.2 Tabulation of 1/A[1..8] + */ +word gsm_INVA[8]={ 13107, 13107, 13107, 13107, 19223, 17476, 31454, 29708 }; + + +/* Table 4.3a Decision level of the LTP gain quantizer + */ +/* bc 0 1 2 3 */ +word gsm_DLB[4] = { 6554, 16384, 26214, 32767 }; + + +/* Table 4.3b Quantization levels of the LTP gain quantizer + */ +/* bc 0 1 2 3 */ +word gsm_QLB[4] = { 3277, 11469, 21299, 32767 }; + + +/* Table 4.4 Coefficients of the weighting filter + */ +/* i 0 1 2 3 4 5 6 7 8 9 10 */ +word gsm_H[11] = {-134, -374, 0, 2054, 5741, 8192, 5741, 2054, 0, -374, -134 }; + + +/* Table 4.5 Normalized inverse mantissa used to compute xM/xmax + */ +/* i 0 1 2 3 4 5 6 7 */ +word gsm_NRFAC[8] = { 29128, 26215, 23832, 21846, 20165, 18725, 17476, 16384 }; + + +/* Table 4.6 Normalized direct mantissa used to compute xM/xmax + */ +/* i 0 1 2 3 4 5 6 7 */ +word gsm_FAC[8] = { 18431, 20479, 22527, 24575, 26623, 28671, 30719, 32767 }; diff --git a/3rdparty/iaxclient-2/lib/iaxclient.h b/3rdparty/iaxclient-2/lib/iaxclient.h new file mode 100644 index 0000000..b2b6008 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/iaxclient.h @@ -0,0 +1,1404 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Frik Strecker + * Mihai Balea + * Peter Grayson + * Bill Cholewka + * Erik Bunce + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ +#ifndef _iaxclient_h +#define _iaxclient_h + +#ifdef __cplusplus +extern "C" { +#endif + +/*! + \file iaxclient.h + \brief The IAXClient API + + + + \note This is the include file which declares all external API functions to + IAXClient. It should include all functions and declarations needed + by IAXClient library users, but not include internal structures, or + require the inclusion of library internals (or sub-libraries) +*/ + +#ifndef DOXYGEN_SHOULD_SKIP_THIS +#ifdef _MSC_VER +typedef int socklen_t; +#endif +#if defined(WIN32) || defined(_WIN32_WCE) +#include "winsock2.h" +#else +#include +#endif + +// FlightGear modification: for FreeBSD compat +#if !defined(WIN32) + #include // for struct timeval +#endif + +#ifdef BUILDING_DLL +# if defined(WIN32) || defined(_WIN32_WCE) +# ifdef _MSC_VER +# define EXPORT __declspec(dllexport) +# else +# define EXPORT __stdcall __declspec(dllexport) +# endif +# else +# define EXPORT +#endif +#else +# define EXPORT +#endif +#endif /* DOXYGEN_SHOULD_SKIP_THIS */ + +#if defined(WIN32) || defined(_WIN32_WCE) +#if defined(_MSC_VER) + typedef int (__stdcall *iaxc_sendto_t)(SOCKET, const void *, size_t, int, + const struct sockaddr *, socklen_t); + typedef int (__stdcall *iaxc_recvfrom_t)(SOCKET, void *, size_t, int, + struct sockaddr *, socklen_t *); +#else + typedef int PASCAL (*iaxc_sendto_t)(SOCKET, const char *, int, int, + const struct sockaddr *, int); + typedef int PASCAL (*iaxc_recvfrom_t)(SOCKET, char *, int, int, + struct sockaddr *, int *); +#endif +#else + /*! + Defines the portotype for an application provided sendto implementation. + */ + typedef int (*iaxc_sendto_t)(int, const void *, size_t, int, + const struct sockaddr *, socklen_t); + /*! + Defines the portotype for an application provided recvfrom implementation. + */ + typedef int (*iaxc_recvfrom_t)(int, void *, size_t, int, + struct sockaddr *, socklen_t *); +#endif + +/*! + Mask containing all potentially valid audio formats +*/ +#define IAXC_AUDIO_FORMAT_MASK ((1<<16)-1) + +/*! + Mask containing all potentially valid video formats +*/ +#define IAXC_VIDEO_FORMAT_MASK (((1<<25)-1) & ~IAXC_AUDIO_FORMAT_MASK) + +/* payload formats : WARNING: must match libiax values!!! */ +/* Data formats for capabilities and frames alike */ +#define IAXC_FORMAT_G723_1 (1 << 0) /*!< G.723.1 compression */ +#define IAXC_FORMAT_GSM (1 << 1) /*!< GSM compression */ +#define IAXC_FORMAT_ULAW (1 << 2) /*!< Raw mu-law data (G.711) */ +#define IAXC_FORMAT_ALAW (1 << 3) /*!< Raw A-law data (G.711) */ +#define IAXC_FORMAT_G726 (1 << 4) /*!< ADPCM, 32kbps */ +#define IAXC_FORMAT_ADPCM (1 << 5) /*!< ADPCM IMA */ +#define IAXC_FORMAT_SLINEAR (1 << 6) /*!< Raw 16-bit Signed Linear (8000 Hz) PCM */ +#define IAXC_FORMAT_LPC10 (1 << 7) /*!< LPC10, 180 samples/frame */ +#define IAXC_FORMAT_G729A (1 << 8) /*!< G.729a Audio */ +#define IAXC_FORMAT_SPEEX (1 << 9) /*!< Speex Audio */ +#define IAXC_FORMAT_ILBC (1 << 10) /*!< iLBC Audio */ + +#define IAXC_FORMAT_MAX_AUDIO (1 << 15) /*!< Maximum audio format value */ +#define IAXC_FORMAT_JPEG (1 << 16) /*!< JPEG Images */ +#define IAXC_FORMAT_PNG (1 << 17) /*!< PNG Images */ +#define IAXC_FORMAT_H261 (1 << 18) /*!< H.261 Video */ +#define IAXC_FORMAT_H263 (1 << 19) /*!< H.263 Video */ +#define IAXC_FORMAT_H263_PLUS (1 << 20) /*!< H.263+ Video */ +#define IAXC_FORMAT_H264 (1 << 21) /*!< H264 Video */ +#define IAXC_FORMAT_MPEG4 (1 << 22) /*!< MPEG4 Video */ +#define IAXC_FORMAT_THEORA (1 << 24) /*!< Theora Video */ +#define IAXC_FORMAT_MAX_VIDEO (1 << 24) /*!< Maximum Video format value*/ + +#define IAXC_EVENT_TEXT 1 /*!< Indicates a text event */ +#define IAXC_EVENT_LEVELS 2 /*!< Indicates a level event */ +#define IAXC_EVENT_STATE 3 /*!< Indicates a call state change event */ +#define IAXC_EVENT_NETSTAT 4 /*!< Indicates a network statistics update event */ +#define IAXC_EVENT_URL 5 /*!< Indicates a URL push via IAX(2) */ +#define IAXC_EVENT_VIDEO 6 /*!< Indicates a video event */ +#define IAXC_EVENT_REGISTRATION 8 /*!< Indicates a registration event */ +#define IAXC_EVENT_DTMF 9 /*!< Indicates a DTMF event */ +#define IAXC_EVENT_AUDIO 10 /*!< Indicates an audio event */ +#define IAXC_EVENT_VIDEOSTATS 11 /*!< Indicates a video statistics update event */ +#define IAXC_EVENT_VIDCAP_ERROR 12 /*!< Indicates a video capture error occurred */ +#define IAXC_EVENT_VIDCAP_DEVICE 13 /*!< Indicates a possible video capture device insertion/removal */ + +#define IAXC_CALL_STATE_FREE 0 /*!< Indicates a call slot is free */ +#define IAXC_CALL_STATE_ACTIVE (1<<1) /*!< Indicates a call is active */ +#define IAXC_CALL_STATE_OUTGOING (1<<2) /*!< Indicates a call is outgoing */ +#define IAXC_CALL_STATE_RINGING (1<<3) /*!< Indicates a call is ringing */ +#define IAXC_CALL_STATE_COMPLETE (1<<4) /*!< Indicates a completed call */ +#define IAXC_CALL_STATE_SELECTED (1<<5) /*!< Indicates the call is selected */ +#define IAXC_CALL_STATE_BUSY (1<<6) /*!< Indicates a call is busy */ +#define IAXC_CALL_STATE_TRANSFER (1<<7) /*!< Indicates the call transfer has been released */ +#define IAXC_CALL_STATE_KEYED (1<<8) /*!< Indicates the call radio is activated */ + +/*! Indicates that text is for an IAXClient status change */ +#define IAXC_TEXT_TYPE_STATUS 1 +/*! Indicates that text is an IAXClient warning message */ +#define IAXC_TEXT_TYPE_NOTICE 2 +/*! Represents that text is for an IAXClient error message */ +#define IAXC_TEXT_TYPE_ERROR 3 +/*! + Represents that text is for an IAXClient fatal error message. + + The User Agent should probably display error message text, then die +*/ +#define IAXC_TEXT_TYPE_FATALERROR 4 +/*! Represents a message sent from the server across the IAX stream*/ +#define IAXC_TEXT_TYPE_IAX 5 + +/* registration replys, corresponding to IAX_EVENTs*/ +#define IAXC_REGISTRATION_REPLY_ACK 18 /*!< Indicates the registration was accepted (See IAX_EVENT_REGACC) */ +#define IAXC_REGISTRATION_REPLY_REJ 30 /*!< Indicates the registration was rejected (See IAX_EVENT_REGREJ) */ +#define IAXC_REGISTRATION_REPLY_TIMEOUT 6 /*!< Indicates the registration timed out (See IAX_EVENT_TIMEOUT) */ + +#define IAXC_URL_URL 1 /*!< URL received */ +#define IAXC_URL_LDCOMPLETE 2 /*!< URL loading complete */ +#define IAXC_URL_LINKURL 3 /*!< URL link request */ +#define IAXC_URL_LINKREJECT 4 /*!< URL link reject */ +#define IAXC_URL_UNLINK 5 /*!< URL unlink */ + +/* The source of the video or audio data triggering the event. */ +#define IAXC_SOURCE_LOCAL 1 /*!< Indicates that the event data source is local */ +#define IAXC_SOURCE_REMOTE 2 /*!< Indicates that the event data source is remote */ + +/*! + The maximum size of a string contained within an event + */ +#define IAXC_EVENT_BUFSIZ 256 + +/*! + A structure containing information about an audio level event. +*/ +struct iaxc_ev_levels { + /*! + The input level in dB. + */ + float input; + + /*! + The output level in dB. + */ + float output; +}; + +/*! + A structure containing information about a text event. +*/ +struct iaxc_ev_text { + /*! + The type of text event. + + Valid values are from the IAXC_TEXT_TYPE_{} family of defines. + \see IAXC_TEXT_TYPE_STATUS, IAXC_TEXT_TYPE_NOTICE, IAXC_TEXT_TYPE_ERROR, + IAXC_TEXT_TYPE_FATALERROR, IAXC_TEXT_TYPE_IAX + */ + int type; + + /*! + The call the text is associated with or -1 if general text. + */ + int callNo; + + /*! + The UTF8 encoded text of the message. + */ + char message[IAXC_EVENT_BUFSIZ]; +}; + +/*! + A structure containing information about a call state change event. +*/ +struct iaxc_ev_call_state { + /*! + The call number whose state this is + */ + int callNo; + + /*! + The call state represented using the IAXC_CALL_STATE_{} defines. + + \see IAXC_CALL_STATE_FREE, IAXC_CALL_STATE_ACTIVE, IAXC_CALL_STATE_OUTGOING, + IAXC_CALL_STATE_RINGING, IAXC_CALL_STATE_COMPLETE, IAXC_CALL_STATE_SELECTED, + IAXC_CALL_STATE_BUSY, IAXC_CALL_STATE_TRANSFER + */ + int state; + + /*! + The audio format of the call. + + \see IAXC_FORMAT_G723_1, IAXC_FORMAT_GSM, IAXC_FORMAT_ULAW, IAXC_FORMAT_ALAW, + IAXC_FORMAT_G726, IAXC_FORMAT_ADPCM, IAXC_FORMAT_SLINEAR, IAXC_FORMAT_LPC10, + IAXC_FORMAT_G729A, IAXC_FORMAT_SPEEX, IAXC_FORMAT_ILBC, IAXC_FORMAT_MAX_AUDIO + */ + int format; + + /*! + The audio format of the call. + + \see IAXC_FORMAT_JPEG, IAXC_FORMAT_PNG, IAXC_FORMAT_H261, IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, IAXC_FORMAT_H264, IAXC_FORMAT_MPEG4, + IAXC_FORMAT_THEORA, IAXC_FORMAT_MAX_VIDEO + */ + int vformat; + + /*! + The remote number. + */ + char remote[IAXC_EVENT_BUFSIZ]; + + /*! + The remote name. + */ + char remote_name[IAXC_EVENT_BUFSIZ]; + + /*! + The local number. + */ + char local[IAXC_EVENT_BUFSIZ]; + + /*! + The local calling context. + */ + char local_context[IAXC_EVENT_BUFSIZ]; +}; + +/*! + A structure containing information about a set of network statistics. +*/ +struct iaxc_netstat { + /*! + The amount of observed jitter. + */ + int jitter; + + /*! + The lost frame percentage. + */ + int losspct; + + /*! + The number of missing frames. + */ + int losscnt; + + /*! + The number of frames received. + */ + int packets; + + /*! + The observed delay. + */ + int delay; + + /*! + The number of frames dropped. + */ + int dropped; + + /*! + The number of frames received out of order. + */ + int ooo; +}; + +/*! + A structure containing information about a network statistics event. +*/ +struct iaxc_ev_netstats { + /*! + The call whose statistics these are. + */ + int callNo; + + /*! + The Round Trip Time + */ + int rtt; + + /*! + The locally observed network statistics. + */ + struct iaxc_netstat local; + + /*! + The remotely (peer) observed network statistics. + */ + struct iaxc_netstat remote; +}; + +/*! + A structure containing video statistics data. +*/ +struct iaxc_video_stats +{ + unsigned long received_slices; /*!< Number of received slices. */ + unsigned long acc_recv_size; /*!< Accumulated size of inbound slices. */ + unsigned long sent_slices; /*!< Number of sent slices. */ + unsigned long acc_sent_size; /*!< Accumulated size of outbound slices. */ + + unsigned long dropped_frames; /*!< Number of frames dropped by the codec (incomplete frames). */ + unsigned long inbound_frames; /*!< Number of frames decoded by the codec (complete frames). */ + unsigned long outbound_frames; /*!< Number of frames sent to the encoder. */ + + float avg_inbound_fps; /*!< Average fps of inbound complete frames. */ + unsigned long avg_inbound_bps; /*!< Average inbound bitrate. */ + float avg_outbound_fps; /*!< Average fps of outbound frames. */ + unsigned long avg_outbound_bps; /*!< Average outbound bitrate. */ + + struct timeval start_time; /*!< Timestamp of the moment we started measuring. */ +}; + +/*! + A structure containing information about a video statistics event. +*/ +struct iaxc_ev_video_stats { + /*! + The call whose statistics these are. + */ + int callNo; + + /*! + The video statistics for the call. + */ + struct iaxc_video_stats stats; +}; + +/*! + A structure containing information about an URL event. +*/ +struct iaxc_ev_url { + /*! + The call this is for. + */ + int callNo; + + /*! + The type of URL received. See the IAXC_URL_{} defines. + + \see IAXC_URL_URL, IAXC_URL_LINKURL, IAXC_URL_LDCOMPLETE, IAXC_URL_UNLINK, + IAXC_URL_LINKREJECT + */ + int type; + + /*! + The received URL. + */ + char url[IAXC_EVENT_BUFSIZ]; +}; + +/*! + A structure containing data for a video event. +*/ +struct iaxc_ev_video { + /*! + The call this video data is for. + + Will be -1 for local video. + */ + int callNo; + + /*! + Timestamp of the video + */ + unsigned int ts; + + /*! + The format of the video data. + + \see IAXC_FORMAT_JPEG, IAXC_FORMAT_PNG, IAXC_FORMAT_H261, IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, IAXC_FORMAT_H264, IAXC_FORMAT_MPEG4, + IAXC_FORMAT_THEORA, IAXC_FORMAT_MAX_VIDEO + */ + int format; + + /*! + The width of the video. + */ + int width; + + /*! + The height of the video. + */ + int height; + + /*! + Is the data encoded. + + 1 for encoded data, 0 for raw. + */ + int encoded; + + /*! + The source of the data. + + \see IAXC_SOURCE_LOCAL, IAXC_SOURCE_REMOTE + */ + int source; + + /*! + The size of the video data in bytes. + */ + int size; + + /*! + The buffer containing the video data. + */ + char *data; +}; + +/*! + A structure containing data for an audio event. +*/ +struct iaxc_ev_audio +{ + /*! + The call this audio data is for. + */ + int callNo; + + /*! + Timestamp of the video + */ + unsigned int ts; + + /*! + The format of the data. + + \see IAXC_FORMAT_G723_1, IAXC_FORMAT_GSM, IAXC_FORMAT_ULAW, IAXC_FORMAT_ALAW, + IAXC_FORMAT_G726, IAXC_FORMAT_ADPCM, IAXC_FORMAT_SLINEAR, IAXC_FORMAT_LPC10, + IAXC_FORMAT_G729A, IAXC_FORMAT_SPEEX, IAXC_FORMAT_ILBC, IAXC_FORMAT_MAX_AUDIO + */ + int format; + + /*! + Is the data encoded. + + 1 for encoded data, 0 for raw. + */ + int encoded; + + /*! + The source of the data. + + \see IAXC_SOURCE_LOCAL, IAXC_SOURCE_REMOTE + */ + int source; + + /*! + The size of the audio data in bytes. + */ + int size; + + /*! + The buffer containing the audio data. + */ + unsigned char *data; +}; + +/*! + A structure containing information about a registration event +*/ +struct iaxc_ev_registration { + /*! + Indicates the registration id this event corresponds to. + + \see iaxc_register + */ + int id; + + /*! + The registration reply. + + The values are from the IAXC_REGISTRATION_REPLY_{} family of macros. + \see IAX_EVENT_REGACC, IAX_EVENT_REGREJ, IAX_EVENT_TIMEOUT + */ + int reply; + + /*! + The number of 'voicemail' messages. + */ + int msgcount; +}; + +/*! + A structure containing information about a DTMF event + */ +struct iaxc_ev_dtmf { + /*! + The call this DTMF event is for. + */ + int callNo; + + /*! + The digit represented by this DTMF tone + */ + char digit; +}; + +/*! + A structure describing a single IAXClient event. +*/ +typedef struct iaxc_event_struct { + /*! + Points to the next entry in the event queue + \internal + */ + struct iaxc_event_struct *next; + + /*! + The type uses one of the IAXC_EVENT_{} macros to describe which type of + event is being presented + */ + int type; + int radioNo; + + /*! + Contains the data specific to the type of event. + */ + union { + /*! Contains level data if type = IAXC_EVENT_LEVELS */ + struct iaxc_ev_levels levels; + /*! Contains text data if type = IAXC_EVENT_TEXT */ + struct iaxc_ev_text text; + /*! Contains call state data if type = IAXC_EVENT_STATE */ + struct iaxc_ev_call_state call; + /*! Contains network statistics if type = IAXC_EVENT_NETSTAT */ + struct iaxc_ev_netstats netstats; + /*! Contains video statistics if type = IAXC_EVENT_VIDEOSTATS */ + struct iaxc_ev_video_stats videostats; + /*! Contains url data if type = IAXC_EVENT_URL */ + struct iaxc_ev_url url; + /*! Contains video data if type = IAXC_EVENT_VIDEO */ + struct iaxc_ev_video video; + /*! Contains audio data if type = IAXC_EVENT_AUDIO */ + struct iaxc_ev_audio audio; + /*! Contains registration data if type = IAXC_EVENT_REGISTRATION */ + struct iaxc_ev_registration reg; + /*! Contains DTMF data if type = IAXC_EVENT_DTMF */ + struct iaxc_ev_dtmf dtmf; + } ev; +} iaxc_event; + +/*! + Defines the prototype for event callback handlers + \param e The event structure being passed to the callback + + \return The result of processing the event; > 0 if successfully handled the event, 0 if not handled, < 0 to indicate an error occurred processing the event. +*/ +typedef int (*iaxc_event_callback_t)(iaxc_event e); + +/*! + Sets the callback to call with IAXClient events + \param func The callback function to call with events +*/ +EXPORT void iaxc_set_event_callback(iaxc_event_callback_t func); + +/*! + Sets iaxclient to post a pointer to a copy of event using o/s specific Post method + \param handle + \param id +*/ +EXPORT int iaxc_set_event_callpost(void *handle, int id); + +/*! + frees event delivered via o/s specific Post method + \param e The event to free +*/ +EXPORT void iaxc_free_event(iaxc_event *e); + + +/* Event Accessors */ +/*! + Returns the levels data associated with event \a e. + \param e The event to retrieve the levels from. +*/ +EXPORT struct iaxc_ev_levels *iaxc_get_event_levels(iaxc_event *e); + +/*! + Returns the text data associated with event \a e. + \param e The event to retrieve text from. +*/ +EXPORT struct iaxc_ev_text *iaxc_get_event_text(iaxc_event *e); + +/*! + Returns the event state data associated with event \a e. + \param e The event to retrieve call state from. +*/ +EXPORT struct iaxc_ev_call_state *iaxc_get_event_state(iaxc_event *e); + +/*! + Set Preferred UDP Port: + \param sourceUdpPort The source UDP port to prefer + 0 Use the default port (4569), <0 Uses a dynamically assigned port, and + >0 tries to bind to the specified port + + \note must be called before iaxc_initialize() +*/ +EXPORT void iaxc_set_preferred_source_udp_port(int sourceUdpPort); + +/*! + Returns the UDP port that has been bound to. + + \return The UDP port bound to; -1 if no port or +*/ +EXPORT int iaxc_get_bind_port(); + +/*! + Initializes the IAXClient library + \param num_calls The maximum number of simultaneous calls to handle. + + This initializes the IAXClient +*/ +EXPORT int iaxc_initialize(int num_calls); + +/*! + Shutsdown the IAXClient library. + + This should be called by applications utilizing iaxclient before they exit. + It dumps all calls, and releases any audio/video drivers being used. + + \note It is unsafe to call most IAXClient API's after calling this! +*/ +EXPORT void iaxc_shutdown(); + +/*! + Sets the formats to be used + \param preferred The single preferred audio format + \param allowed A mask containing all audio formats to allow + + \see IAXC_FORMAT_G723_1, IAXC_FORMAT_GSM, IAXC_FORMAT_ULAW, IAXC_FORMAT_ALAW, + IAXC_FORMAT_G726, IAXC_FORMAT_ADPCM, IAXC_FORMAT_SLINEAR, IAXC_FORMAT_LPC10, + IAXC_FORMAT_G729A, IAXC_FORMAT_SPEEX, IAXC_FORMAT_ILBC, IAXC_FORMAT_MAX_AUDIO +*/ +EXPORT void iaxc_set_formats(int preferred, int allowed); + +/*! + Sets the minimum outgoing frame size. + \param samples The minimum number of samples to include in an outgoing frame. +*/ +EXPORT void iaxc_set_min_outgoing_framesize(int samples); + +/*! + Sets the caller id \a name and \a number. + \param name The caller id name. + \param number The caller id number. +*/ +EXPORT void iaxc_set_callerid(const char * name, const char * number); + +/*! + Starts all the internal processing thread(s). + + \note Should be called after iaxc_initialize, but before any call processing + related functions. +*/ +EXPORT int iaxc_start_processing_thread(); + +/*! + Stops all the internal processing thread(s). + + \note Should be called before iaxc_shutdown. +*/ +EXPORT int iaxc_stop_processing_thread(); + +/*! + Initiates a call to an end point + \param num The entity to call in the format of [user[:password]]@@peer[:portno][/exten[@@context]] + + \return The call number upon sucess; -1 otherwise. + + \note This is the same as calling iaxc_call_ex(num, NULL, NULL, 1). +*/ +EXPORT int iaxc_call(const char * num); + +/*! + Initiates a call to an end point + \param num The entity to call in the format of [user[:password]]@@peer[:portno][/exten[@@context]] + \param callerid_name The local caller id name to use + \param callerid_number The local caller id number to use + \param video 0 indicates no-video. Any non-zero value indicates video is requested + + \return The call number upon sucess; -1 otherwise. +*/ +EXPORT int iaxc_call_ex(const char* num, const char* callerid_name, const char* callerid_number, int video); + +/*! + Unregisters IAXClient from a server + \param id The registration number returned by iaxc_register. +*/ +EXPORT int iaxc_unregister( int id ); + +/*! + Registers the IAXClient instance with an IAX server + \param user The username to register as + \param pass The password to register with + \param host The address of the host/peer to register with + + \return The registration id number upon success; -1 otherwise. +*/ +EXPORT int iaxc_register(const char * user, const char * pass, const char * host); + +/*! + Registers the IAXClient instance with an IAX server + \param user The username to register as + \param pass The password to register with + \param host The address of the host/peer to register with + \param refresh The registration refresh period + + \return The registration id number upon success; -1 otherwise. +*/ +EXPORT int iaxc_register_ex(const char * user, const char * pass, const char * host, int refresh); + +/*! + Respond to incoming call \a callNo as busy. +*/ +EXPORT void iaxc_send_busy_on_incoming_call(int callNo); + +/*! + Answers the incoming call \a callNo. + \param callNo The number of the call to answer. +*/ +EXPORT void iaxc_answer_call(int callNo); + +/*! + Radio Transmitter and Receiver Control Activiate + \param callNo The number of the call to activate +*/ +EXPORT void iaxc_key_radio(int callNo); + +/*! + Radio Transmitter and Receiver Control Deactivate + \param callNo The number of the call to deactivate +*/ +EXPORT void iaxc_unkey_radio(int callNo); + +/*! + Initiate a blind call transfer of \a callNo to \a number. + \param callNo The active call to transfer. + \param number The number to transfer the call to. See draft-guy-iax-03 section 8.4.1 for further details. +*/ +EXPORT void iaxc_blind_transfer_call(int callNo, const char * number); + +/*! + Setup a transfer of \a sourceCallNo to \a targetCallNo. + \param sourceCallNo The number of the active call session to transfer. + \param targetCallNo The active call session to be transferred to. + + This is used in performing as the final step in an attended call transfer. +*/ +EXPORT void iaxc_setup_call_transfer(int sourceCallNo, int targetCallNo); + +/*! + Hangs up and frees all non-free calls. +*/ +EXPORT void iaxc_dump_all_calls(void); + +/*! + Hangs up and frees call \a callNo + \param callNo The call number to reject. +*/ +EXPORT void iaxc_dump_call_number( int callNo ); + +/*! + Hangs up and frees the currently selected call. +*/ +EXPORT void iaxc_dump_call(void); + +/*! + Rejects the currently selected call. + + \note This is pretty much a useless API, since the act of selecting a call + will answer it. +*/ +EXPORT void iaxc_reject_call(void); + +/*! + Rejects the incoming call \a callNo. + \param callNo The call number to reject. +*/ +EXPORT void iaxc_reject_call_number(int callNo); + +/*! + Sends a DTMF digit to the currently selected call. + \param digit The DTMF digit to send (0-9, A-D, *, #). +*/ +EXPORT void iaxc_send_dtmf(char digit); + +/*! + Sends text to the currently selected call. +*/ +EXPORT void iaxc_send_text(const char * text); + +/*! + Sends \a text to call \a callNo +*/ +EXPORT void iaxc_send_text_call(int callNo, const char * text); + +/*! + Sends a URL across the currently selected call + \param url The URL to send across. + \param link If non-zero the URL is a link +*/ +EXPORT void iaxc_send_url(const char *url, int link); /* link == 1 ? AST_HTML_LINKURL : AST_HTML_URL */ + +/*! + Suspends thread execution for an interval measured in milliseconds + \param ms The number of milliseconds to sleep +*/ +EXPORT void iaxc_millisleep(long ms); + +/*! + Sets the silence threshold to \a thr. + \param thr The threshold value in dB. A value of 0.0f effectively mutes audio input. +*/ +EXPORT void iaxc_set_silence_threshold(float thr); + +/*! + Sets the audio output to \a mode. + \param mode The audio mode 0 indicates remote audio should be played; non-zero prevents remote audio from being played. +*/ +EXPORT void iaxc_set_audio_output(int mode); + +/*! + Sets \a callNo as the currently selected call + \param callNo The call to select or < 0 to indicate no selected call. + + \note Will answer an incoming ringing call as a side effect. Personally I + believe this behavior is undesirable and feel it renders iaxc_reject_call + pretty much useless. +*/ +EXPORT int iaxc_select_call(int callNo); + +/*! + Returns the first free call number. +*/ +EXPORT int iaxc_first_free_call(); + +/*! + Returns the number of the currently selected call. +*/ +EXPORT int iaxc_selected_call(); + +/*! + Causes the audio channel for \a callNo to QUELCH (be squelched). + \param callNo The number of the active, accepted call to quelch. + \param MOH If non-zero Music On Hold should be played on the QUELCH'd call. +*/ +EXPORT int iaxc_quelch(int callNo, int MOH); + +/*! + Causes the audio channel for \a callNo to be UNQUELCH (unsquelched). +*/ +EXPORT int iaxc_unquelch(int callNo); + +/*! + Returns the current mic boost setting. + + \return 0 if mic boost is disabled; otherwise non-zero. +*/ +EXPORT int iaxc_mic_boost_get( void ) ; + +/*! + Sets the mic boost setting. + \param enable If non-zero enable the mic boost; otherwise disable. +*/ +EXPORT int iaxc_mic_boost_set( int enable ) ; + +/*! + Returns a copy of IAXClient library version + \param ver A buffer to store the version string in. It MUST be at least + IAXC_EVENT_BUFSIZ bytes in size. + + \return the version string (as stored in \a ver). +*/ +EXPORT char* iaxc_version(char *ver); + +/*! + Fine tune jitterbuffer control + \param value +*/ +EXPORT void iaxc_set_jb_target_extra( long value ); + +/*! + Application-defined networking; give substitute sendto and recvfrom + functions. + \param st The send function to use. + \param rf The receive function to use. + + \note Must be called before iaxc_initialize! +*/ +EXPORT void iaxc_set_networking(iaxc_sendto_t st, iaxc_recvfrom_t rf) ; + +/*! + wrapper for libiax2 get_netstats + \param call + \param rtt + \param local + \param remote +*/ +EXPORT int iaxc_get_netstats(int call, int *rtt, struct iaxc_netstat *local, struct iaxc_netstat *remote); + +/*! + A structure containing information about a video capture device. +*/ +struct iaxc_video_device { + /*! + The "human readable" name of the device + */ + const char *name; + + /*! + unique id of the device + */ + const char *id_string; + + /*! + iaxclient id of the device + */ + int id; +}; + +#define IAXC_AD_INPUT (1<<0) /*!< Device is usable for input*/ +#define IAXC_AD_OUTPUT (1<<1) /*!< Device is usable for output */ +#define IAXC_AD_RING (1<<2) /*!< Device is usable for ring */ +#define IAXC_AD_INPUT_DEFAULT (1<<3) /*!< Indicates the default input device */ +#define IAXC_AD_OUTPUT_DEFAULT (1<<4) /*!< Indicates the default output device */ +#define IAXC_AD_RING_DEFAULT (1<<5) /*!< Indicates the default ring device */ + +/*! + A structure containing information about an audio device. +*/ +struct iaxc_audio_device { + /*! + The "human readable" name of the device + */ + const char * name; + + /*! + Capability flags, defined using the IAXC_AD_{} macros. + */ + long capabilities; + + /*! + The device driver specific ID. + */ + int devID; +}; + +/*! Get audio device information: + \param devs Returns an array of iaxc_audio_device structures. + The array will will be valid as long as iaxc is initialized. + \param nDevs Returns the number of devices in the devs array + \param input Returns the currently selected input device + \param output Returns the currently selected output device + \param ring Returns the currently selected ring device + */ +EXPORT int iaxc_audio_devices_get(struct iaxc_audio_device **devs, int *nDevs, int *input, int *output, int *ring); + +/*! + Sets the current audio devices + \param input The device to use for audio input + \param output The device to use for audio output + \param ring The device to use to present ring sounds + */ +EXPORT int iaxc_audio_devices_set(int input, int output, int ring); + +/*! + Get the audio device input level. + + \return the input level in the range of 0.0f minimum to 1.0f maximum. + */ +EXPORT float iaxc_input_level_get(); + +/*! + Get the audio device output level. + + \return the input level in the range of 0.0f minimum to 1.0f maximum. + */ +EXPORT float iaxc_output_level_get(); + +/*! + Sets the audio input level to \a level. + \param level The level in the range from 0.0f (min) to 1.0f (max). +*/ +EXPORT int iaxc_input_level_set(float level); + +/*! + Sets the audio output level to \a level. + \param level The level in the range from 0.0f (min) to 1.0f (max). + */ +EXPORT int iaxc_output_level_set(float level); + +/*! + A structure describing a sound to IAXClient +*/ +struct iaxc_sound { + short *data; /*!< Sound sample data in 8KHz 16-bit signed format. */ + long len; /*!< Length of sample in frames. */ + int malloced; /*!< Should the library free() the data after it is played? */ + int channel; /*!< The channel used: 0 for output, 1 for ring. */ + int repeat; /*!< Number of times to repeat (-1 = infinite). */ + long pos; /*!< \internal use: current play position. */ + int id; /*!< \internal use: sound ID. */ + struct iaxc_sound *next; /*!< \internal use: next in list. */ +}; + +/*! + Play a sound. + \param sound An iaxc_sound structure. + \param ring 0 to play through output device or 1 to play through the "ring" device. + + \return The id number of the sound being played +*/ +EXPORT int iaxc_play_sound(struct iaxc_sound *sound, int ring); + +/*! + Stop sound \a id from being played. + \param id The id of a sound to stop as returned from iaxc_play_sound. +*/ +EXPORT int iaxc_stop_sound(int id); + +#define IAXC_FILTER_DENOISE (1<<0) /*!< Noise reduction filter */ +#define IAXC_FILTER_AGC (1<<1) /*!< Automatic Gain Control */ +#define IAXC_FILTER_ECHO (1<<2) /*!< Echo cancellation filter */ +#define IAXC_FILTER_AAGC (1<<3) /*!< Analog (mixer-based) Automatic Gain Control */ +#define IAXC_FILTER_CN (1<<4) /*!< Send Comfort Noise (CN) frames when silence is detected */ + +/*! + Returns the set of audio filters being applied. + + The IAXC_FILTER_{} defines are used to specify the filters. + \see IAXC_FILTER_DENOISE, IAXC_FILTER_AGC, IAXC_FILTER_ECHO, IAXC_FILTER_AAGC, + IAXC_FILTER_CN + */ +EXPORT int iaxc_get_filters(void); + +/*! + Sets the current audio filters to apply. + \param filters The combination of all the audio filters to use (IAXC_FILTER_{} defines). + + The IAXC_FILTER_{} defines are used to specify the filters. + \see IAXC_FILTER_DENOISE, IAXC_FILTER_AGC, IAXC_FILTER_ECHO, IAXC_FILTER_AAGC, + IAXC_FILTER_CN + */ +EXPORT void iaxc_set_filters(int filters); + +/*! + Sets speex specific codec settings + \param decode_enhance 1/0 perceptual enhancement for decoder + \param quality: Generally, set either quality (0-9) or bitrate. -1 for "default" + \param bitrate in kbps. Applies to CBR only; -1 for default. + (overrides "quality" for CBR mode) + \param vbr Variable bitrate mode: 0/1 + \param abr mode/rate: 0 for not ABR, bitrate for ABR mode + \param complexity Algorithmic complexity. Think -N for gzip. + Higher numbers take more CPU for better quality. 3 is + default and good choice. + + A good choice is (1,-1,-1,0,8000,3): 8kbps ABR + */ +EXPORT void iaxc_set_speex_settings(int decode_enhance, float quality, int bitrate, int vbr, int abr, int complexity); + +/* + Functions and flags for setting and getting audio callback preferences + The application can request to receive local/remote, raw/encoded audio + through the callback mechanism. Please note that changing callback + settings will overwrite all previous settings. +*/ +/*! + Indicates the preference that local audio should be passed to the registered callback in a raw 8KHz 16-bit signed format. +*/ +#define IAXC_AUDIO_PREF_RECV_LOCAL_RAW (1 << 0) + +/*! + Indicates the preference that local audio should be passed to the registered callback in the current encoded format. +*/ +#define IAXC_AUDIO_PREF_RECV_LOCAL_ENCODED (1 << 1) + +/*! + Indicates the preference that remote audio should be passed to the registered callback in a raw 8KHz 16-bit signed format. +*/ +#define IAXC_AUDIO_PREF_RECV_REMOTE_RAW (1 << 2) + +/*! + Indicates the preference that remote audio should be passed to the registered callback in the current encoded format. +*/ +#define IAXC_AUDIO_PREF_RECV_REMOTE_ENCODED (1 << 3) + +/*! + Indicates the preference that sending of audio should be disabled. +*/ +#define IAXC_AUDIO_PREF_SEND_DISABLE (1 << 4) + +/*! + Returns the various audio delivery preferences. + + The preferences are represented using the AIXC_AUDIO_PREF_{} family of defines. +*/ +EXPORT unsigned int iaxc_get_audio_prefs(void); + +/*! + Set the various audio delivery preferences + \param prefs The desired preferences to use. They are represented using the AIXC_AUDIO_PREF_{} family of defines. + + \return 0 on success and -1 on error. + + \see IAXC_AUDIO_PREF_RECV_LOCAL_RAW, IAXC_AUDIO_PREF_RECV_LOCAL_ENCODED, + IAXC_AUDIO_PREF_RECV_REMOTE_RAW, IAXC_AUDIO_PREF_RECV_REMOTE_ENCODED, + IAXC_AUDIO_PREF_SEND_DISABLE + */ +EXPORT int iaxc_set_audio_prefs(unsigned int prefs); + +/*! + Get video capture device information. + WARNING: the array pointed to by parameter 'devs' below is owned + by iaxclient, and may be freed on subsequent calls to + this function. + \param devs Returns an array of iaxc_video_device structures. + The array will only be valid until this function is + called again (if the device list changes), or until + iaxc is shutdown. + \param nDevs Returns the number of devices in the devs array + \param devId Returns the id of the currently selected video capture device + + \return -1 on error, 0 if no change to the device list, 1 if it's been updated + */ +EXPORT int iaxc_video_devices_get(struct iaxc_video_device **devs, int *nDevs, int *devId); + +/*! + Sets the current video capture device + \param devId The id of the device to use for video capture + */ +EXPORT int iaxc_video_device_set(int devId); + +/* + * Acceptable range for video rezolution + */ +#define IAXC_VIDEO_MAX_WIDTH 704 /*!< Maximum video width */ +#define IAXC_VIDEO_MAX_HEIGHT 576 /*!< Maximum video height */ +#define IAXC_VIDEO_MIN_WIDTH 80 /*!< Minimum video width */ +#define IAXC_VIDEO_MIN_HEIGHT 60 /*!< Minimum video height */ + +/* + Video callback preferences + The client application can obtain any combination of + remote/local, encoded/raw video through the event callback + mechanism + Use these flags to specify what kind of video do you want to receive + */ + +/*! + Indicates the preference that local video should be passed to the registered callback in a raw format (typically YUV420). +*/ +#define IAXC_VIDEO_PREF_RECV_LOCAL_RAW (1 << 0) + +/*! + Indicates the preference that local video should be passed to the registered callback in the current encoded format. +*/ +#define IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED (1 << 1) + +/*! + Indicates the preference that remote video should be passed to the registered callback in a raw format (typically YUV420). +*/ +#define IAXC_VIDEO_PREF_RECV_REMOTE_RAW (1 << 2) + +/*! + Indicates the preference that remote video should be passed to the registered callback in the current encoded format. +*/ +#define IAXC_VIDEO_PREF_RECV_REMOTE_ENCODED (1 << 3) + +/*! + Indicates the preference that sending of video should be disabled. +*/ +#define IAXC_VIDEO_PREF_SEND_DISABLE (1 << 4) + +/*! + This flag specifies that you want raw video in RGB32 format + + RGB32: FFRRGGBB aligned 4 bytes per pixel + When this flag is set, iaxclient will convert YUV420 raw video into + RGB32 before passing it to the main app. + */ +#define IAXC_VIDEO_PREF_RECV_RGB32 (1 << 5) + +/*! + Use this flag to disable/enable camera hardware + */ +#define IAXC_VIDEO_PREF_CAPTURE_DISABLE (1 << 6) + +/*! + Returns the current video preferences. + + The preferences are represented using the AIXC_VIDEO_PREF_{} family of macros. + + \see IAXC_VIDEO_PREF_RECV_LOCAL_RAW, IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED, + IAXC_VIDEO_PREF_RECV_REMOTE_RAW, IAXC_VIDEO_PREF_RECV_REMOTE_ENCODED, + IAXC_VIDEO_PREF_SEND_DISABLE, IAXC_VIDEO_PREF_RECV_RGB32, + IAXC_VIDEO_PREF_CAPTURE_DISABLE +*/ +EXPORT unsigned int iaxc_get_video_prefs(void); + +/*! + Sets the current video preferences. + \param prefs The desired preferences to use. They are represented using the IAXC_VIDEO_PREF_{} family of defines. + + Please note that this overwrites all previous preferences. In other + words, a read-modify-write must be done to change a single preference. + + \return 0 on success and -1 on error. + + \see IAXC_VIDEO_PREF_RECV_LOCAL_RAW, IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED, + IAXC_VIDEO_PREF_RECV_REMOTE_RAW, IAXC_VIDEO_PREF_RECV_REMOTE_ENCODED, + IAXC_VIDEO_PREF_SEND_DISABLE, IAXC_VIDEO_PREF_RECV_RGB32, + IAXC_VIDEO_PREF_CAPTURE_DISABLE + */ +EXPORT int iaxc_set_video_prefs(unsigned int prefs); + +/*! + Returns the video format settings + \param preferred Receives the single preferred video format + \param allowed Receives the mask of the allowed video formats + + \see IAXC_FORMAT_JPEG, IAXC_FORMAT_PNG, IAXC_FORMAT_H261, IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, IAXC_FORMAT_H264, IAXC_FORMAT_MPEG4, + IAXC_FORMAT_THEORA, IAXC_FORMAT_MAX_VIDEO +*/ +EXPORT void iaxc_video_format_get_cap(int *preferred, int *allowed); + +/*! + Sets the video format capabilities + \param preferred The single preferred video format + \param allowed The mask of the allowed video formats + + \see IAXC_FORMAT_JPEG, IAXC_FORMAT_PNG, IAXC_FORMAT_H261, IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, IAXC_FORMAT_H264, IAXC_FORMAT_MPEG4, + IAXC_FORMAT_THEORA, IAXC_FORMAT_MAX_VIDEO +*/ +EXPORT void iaxc_video_format_set_cap(int preferred, int allowed); + +/*! + Sets the allowed/preferred video formats + \param preferred The single preferred video format + \param allowed The mask of the allowed video formats + \param framerate The video frame rate in fps. + \param bitrate The video bitrate in bps. + \param width The width of the video. + \param height The height of the video. + \param fs The video fragment size. + + \see IAXC_FORMAT_JPEG, IAXC_FORMAT_PNG, IAXC_FORMAT_H261, IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, IAXC_FORMAT_H264, IAXC_FORMAT_MPEG4, + IAXC_FORMAT_THEORA, IAXC_FORMAT_MAX_VIDEO +*/ +EXPORT void iaxc_video_format_set(int preferred, int allowed, int framerate, int bitrate, int width, int height, int fs); + +/*! + Change video params for the current call on the fly + This will destroy the existing encoder and create a new one + use negative values for parameters that should not change + \param framerate The video frame rate in fps. + \param bitrate The video bitrate in bps. + \param width The width of the video. + \param height The height of the video. + \param fs The video fragment size. +*/ +EXPORT void iaxc_video_params_change(int framerate, int bitrate, int width, int height, int fs); + +/*! Set holding frame to be used in some kind of video calls */ +EXPORT int iaxc_set_holding_frame(char *); + +/*! + Helper function to control use of jitter buffer for video events + + \todo make this a video pref, perhaps? +*/ + +EXPORT int iaxc_video_bypass_jitter(int); + +/*! + Returns 1 if the default camera is working; 0 otherwise + */ +EXPORT int iaxc_is_camera_working(); + +/*! + Converts a YUV420 image to RGB32 + \param width The width of the image + \param height The height of the image + \param src The buffer containing the source image + \param dest The buffer to write the converted image to. The buffer should be \a width * height * 4 bytes in size. + + Converts the image based on the forumulas found at + http://en.wikipedia.org/wiki/YUV +*/ +EXPORT void iaxc_YUV420_to_RGB32(int width, int height, const char *src, char *dest); + +/* + * Test mode functionality + * In test mode, iaxclient will do the following: + * - skip audio and video hardware initialization + * - wait for outgoing media to be provided by the main application + * - return incoming media to the calling application if required, via callbacks + * - not generate any meaningful statistics + * Test mode is designed to be used without a GUI, and with multiple instances of iaxclient + * running on the same machine. However, some applications might actually benefit from having + * this level of control. + * iaxc_set_test_mode() should be called before iaxc_initialize() + */ +EXPORT void iaxc_set_test_mode(int); + +/*! + \brief Sends compressed audio data to the currently selected call. + \param data compressed audio data + \param size Size of the compressed audio data in bytes + \param samples The number of (uncompressed) samples represented by the compressed audio data. We normally use 20ms packets at a sampling rate of 8000Hz, so this would be 160. + + \note Data must be in the audio format that was negotiated for the current call + otherwise bad magic may occur on the recieving side. +*/ +EXPORT int iaxc_push_audio(void *data, unsigned int size, unsigned int samples); + +/*! + \brief Sends compressed video data to the currently selected call. + \param data compressed video data + \param size Size of the compressed video data in bytes + \param fragment If true, split video frames larger than the current fragsize into multiple fragments, otherwise send the data as jumbo frames. + + \note Data must be in the video format that was negotiated for the current call + otherwise bad magic may occur on the recieving side. +*/ +EXPORT int iaxc_push_video(void *data, unsigned int size, int fragment); + +/*! + Sets the IAX debug set to \a enable. + \param enable If non-zero enable iax protocol debugging +*/ +EXPORT void iaxc_debug_iax_set(int enable); + +/*! + Sets radioNo + \param radioNo The number of the radio +*/ +EXPORT void iaxc_set_radiono(int radioNo); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/iaxclient_lib.c b/3rdparty/iaxclient-2/lib/iaxclient_lib.c new file mode 100644 index 0000000..ec2a259 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/iaxclient_lib.c @@ -0,0 +1,1986 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Michael Van Donselaar + * Shawn Lawrence + * Frik Strecker + * Mihai Balea + * Peter Grayson + * Bill Cholewka + * Erik Bunce + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include + +#if defined(WIN32) || defined(_WIN32_WCE) +#include +#endif + +/* Win32 has _vsnprintf instead of vsnprintf */ +#if ! HAVE_VSNPRINTF +# if HAVE__VSNPRINTF +# define vsnprintf _vsnprintf +# endif +#endif + +#include "iaxclient_lib.h" +#include "audio_portaudio.h" +#include "audio_encode.h" +#ifdef USE_VIDEO +#include "video.h" +#endif +#include "iax-client.h" +#include "jitterbuf.h" + +#include + +#ifdef AUDIO_ALSA +#include "audio_alsa.h" +#endif + +#define IAXC_ERROR IAXC_TEXT_TYPE_ERROR +#define IAXC_STATUS IAXC_TEXT_TYPE_STATUS +#define IAXC_NOTICE IAXC_TEXT_TYPE_NOTICE + +#define DEFAULT_CALLERID_NAME "Not Available" +#define DEFAULT_CALLERID_NUMBER "7005551212" + +#undef JB_DEBUGGING + +/* global test mode flag */ +int test_mode = 0; + +/* configurable jitterbuffer options */ +static long jb_target_extra = -1; + +struct iaxc_registration +{ + struct iax_session *session; + struct timeval last; + char host[256]; + char user[256]; + char pass[256]; + long refresh; + int id; + struct iaxc_registration *next; +}; + +static int next_registration_id = 0; +static struct iaxc_registration *registrations = NULL; + +static struct iaxc_audio_driver audio_driver; + +static int audio_format_capability; +static int audio_format_preferred; + +// Audio callback behavior +// By default apps should let iaxclient handle audio +static unsigned int audio_prefs = 0; + +void * post_event_handle = NULL; +int post_event_id = 0; + +static int minimum_outgoing_framesize = 160; /* 20ms */ + +static MUTEX iaxc_lock; +static MUTEX event_queue_lock; + +static int iaxci_bound_port = -1; + +// default to use port 4569 unless set by iaxc_set_preferred_source_udp_port +static int source_udp_port = IAX_DEFAULT_PORTNO; + +int iaxci_audio_output_mode = 0; // Normal + +int selected_call; // XXX to be protected by mutex? +struct iaxc_call* calls; +int max_calls; // number of calls for this library session +static int radioNo = -1; + +static void service_network(); +static int service_audio(); + +/* external global networking replacements */ +static iaxc_sendto_t iaxc_sendto = (iaxc_sendto_t)sendto; +static iaxc_recvfrom_t iaxc_recvfrom = (iaxc_recvfrom_t)recvfrom; + + +static THREAD main_proc_thread; +#if defined(WIN32) || defined(_WIN32_WCE) +static THREADID main_proc_thread_id; +#endif + +/* 0 running, 1 should quit, -1 not running */ +static int main_proc_thread_flag = -1; + +static iaxc_event_callback_t iaxc_event_callback = NULL; + +// Internal queue of events, waiting to be posted once the library +// lock is released. +static iaxc_event *event_queue = NULL; + +// Lock the library +static void get_iaxc_lock() +{ + MUTEXLOCK(&iaxc_lock); +} + +int try_iaxc_lock() +{ + return MUTEXTRYLOCK(&iaxc_lock); +} + +// Unlock the library and post any events that were queued in the meantime +void put_iaxc_lock() +{ + iaxc_event *prev, *event; + + MUTEXLOCK(&event_queue_lock); + event = event_queue; + event_queue = NULL; + MUTEXUNLOCK(&event_queue_lock); + + MUTEXUNLOCK(&iaxc_lock); + + while (event) + { + iaxci_post_event(*event); + prev = event; + event = event->next; + free(prev); + } +} + +EXPORT void iaxc_set_audio_output(int mode) +{ + iaxci_audio_output_mode = mode; +} + +long iaxci_usecdiff(struct timeval * t0, struct timeval * t1) +{ + return (t0->tv_sec - t1->tv_sec) * 1000000L + t0->tv_usec - t1->tv_usec; +} + +long iaxci_msecdiff(struct timeval * t0, struct timeval * t1) +{ + return iaxci_usecdiff(t0, t1) / 1000L; +} + +EXPORT void iaxc_set_event_callback(iaxc_event_callback_t func) +{ + iaxc_event_callback = func; +} + +EXPORT int iaxc_set_event_callpost(void *handle, int id) +{ + post_event_handle = handle; + post_event_id = id; + iaxc_event_callback = iaxci_post_event_callback; + return 0; +} + +EXPORT void iaxc_free_event(iaxc_event *e) +{ + free(e); +} + +EXPORT struct iaxc_ev_levels *iaxc_get_event_levels(iaxc_event *e) +{ + return &e->ev.levels; +} + +EXPORT struct iaxc_ev_text *iaxc_get_event_text(iaxc_event *e) +{ + return &e->ev.text; +} + +EXPORT struct iaxc_ev_call_state *iaxc_get_event_state(iaxc_event *e) +{ + return &e->ev.call; +} + +// Messaging functions +static void default_message_callback(const char * message) +{ + //fprintf(stderr, "IAXCLIENT: %s\n", message); +} + +// Post Events back to clients +void iaxci_post_event(iaxc_event e) +{ + if ( e.type == 0 ) + { + iaxci_usermsg(IAXC_ERROR, + "Error: something posted to us an invalid event"); + return; + } + + e.radioNo = radioNo; + + if ( MUTEXTRYLOCK(&iaxc_lock) ) + { + iaxc_event **tail; + + /* We could not obtain the lock. Queue the event. */ + MUTEXLOCK(&event_queue_lock); + tail = &event_queue; + e.next = NULL; + while ( *tail ) + tail = &(*tail)->next; + *tail = (iaxc_event *)malloc(sizeof(iaxc_event)); + memcpy(*tail, &e, sizeof(iaxc_event)); + MUTEXUNLOCK(&event_queue_lock); + return; + } + + /* TODO: This is not the best. Since we were able to get the + * lock, we decide that it is okay to go ahead and do the + * callback to the application. This is really nasty because + * it gives the appearance of serialized callbacks, but in + * reality, we could callback an application multiple times + * simultaneously. So, as things stand, an application must + * do some locking in their callback function to make it + * reentrant. Barf. More ideally, iaxclient would guarantee + * serialized callbacks to the application. + */ + MUTEXUNLOCK(&iaxc_lock); + + if ( iaxc_event_callback ) + { + int rv; + + rv = iaxc_event_callback(e); + + if ( e.type == IAXC_EVENT_VIDEO ) + { + /* We can free the frame data once it is off the + * event queue and has been processed by the client. + */ + free(e.ev.video.data); + } + else if ( e.type == IAXC_EVENT_AUDIO ) + { + free(e.ev.audio.data); + } + + if ( rv < 0 ) + default_message_callback( + "IAXCLIENT: BIG PROBLEM, event callback returned failure!"); + // > 0 means processed + if ( rv > 0 ) + return; + + // else, fall through to "defaults" + } + + switch ( e.type ) + { + case IAXC_EVENT_TEXT: + default_message_callback(e.ev.text.message); + // others we just ignore too + return; + } +} + + +void iaxci_usermsg(int type, const char *fmt, ...) +{ + va_list args; + iaxc_event e; + + e.type = IAXC_EVENT_TEXT; + e.ev.text.type = type; + e.ev.text.callNo = -1; + va_start(args, fmt); + vsnprintf(e.ev.text.message, IAXC_EVENT_BUFSIZ, fmt, args); + va_end(args); + + iaxci_post_event(e); +} + + +void iaxci_do_levels_callback(float input, float output) +{ + iaxc_event e; + e.type = IAXC_EVENT_LEVELS; + e.ev.levels.input = input; + e.ev.levels.output = output; + iaxci_post_event(e); +} + +void iaxci_do_state_callback(int callNo) +{ + iaxc_event e; + if ( callNo < 0 || callNo >= max_calls ) + return; + e.type = IAXC_EVENT_STATE; + e.ev.call.callNo = callNo; + e.ev.call.state = calls[callNo].state; + e.ev.call.format = calls[callNo].format; + e.ev.call.vformat = calls[callNo].vformat; + strncpy(e.ev.call.remote, calls[callNo].remote, IAXC_EVENT_BUFSIZ); + strncpy(e.ev.call.remote_name, calls[callNo].remote_name, IAXC_EVENT_BUFSIZ); + strncpy(e.ev.call.local, calls[callNo].local, IAXC_EVENT_BUFSIZ); + strncpy(e.ev.call.local_context, calls[callNo].local_context, IAXC_EVENT_BUFSIZ); + iaxci_post_event(e); +} + +void iaxci_do_registration_callback(int id, int reply, int msgcount) +{ + iaxc_event e; + e.type = IAXC_EVENT_REGISTRATION; + e.ev.reg.id = id; + e.ev.reg.reply = reply; + e.ev.reg.msgcount = msgcount; + iaxci_post_event(e); +} + +void iaxci_do_audio_callback(int callNo, unsigned int ts, int source, + int encoded, int format, int size, unsigned char *data) +{ + iaxc_event e; + + e.type = IAXC_EVENT_AUDIO; + e.ev.audio.ts = ts; + e.ev.audio.encoded = encoded; + assert(source == IAXC_SOURCE_REMOTE || source == IAXC_SOURCE_LOCAL); + e.ev.audio.source = source; + e.ev.audio.size = size; + e.ev.audio.callNo = callNo; + e.ev.audio.format = format; + + e.ev.audio.data = (unsigned char *)malloc(size); + + if ( !e.ev.audio.data ) + { + iaxci_usermsg(IAXC_ERROR, + "failed to allocate memory for audio event"); + return; + } + + memcpy(e.ev.audio.data, data, size); + + iaxci_post_event(e); +} + +void iaxci_do_dtmf_callback(int callNo, char digit) +{ + iaxc_event e; + e.type = IAXC_EVENT_DTMF; + e.ev.dtmf.callNo = callNo; + e.ev.dtmf.digit = digit; + iaxci_post_event(e); +} + +static int iaxc_remove_registration_by_id(int id) +{ + struct iaxc_registration *curr, *prev; + int count = 0; + for ( prev = NULL, curr = registrations; curr != NULL; + prev = curr, curr = curr->next ) + { + if ( curr->id == id ) + { + count++; + if ( curr->session != NULL ) + iax_destroy( curr->session ); + if ( prev != NULL ) + prev->next = curr->next; + else + registrations = curr->next; + free( curr ); + break; + } + } + return count; +} + +EXPORT int iaxc_first_free_call() +{ + int i; + for ( i = 0; i < max_calls; i++ ) + if ( calls[i].state == IAXC_CALL_STATE_FREE ) + return i; + + return -1; +} + + +static void iaxc_clear_call(int toDump) +{ + // XXX libiax should handle cleanup, I think.. + calls[toDump].state = IAXC_CALL_STATE_FREE; + calls[toDump].format = 0; + calls[toDump].vformat = 0; + calls[toDump].session = NULL; + iaxci_do_state_callback(toDump); +} + +/* select a call. */ +/* XXX Locking?? Start/stop audio?? */ +EXPORT int iaxc_select_call(int callNo) +{ + // continue if already selected? + //if ( callNo == selected_call ) return; + + if ( callNo >= max_calls ) + { + iaxci_usermsg(IAXC_ERROR, "Error: tried to select out_of_range call %d", callNo); + return -1; + } + + // callNo < 0 means no call selected (i.e. all on hold) + if ( callNo < 0 ) + { + if ( selected_call >= 0 ) + { + calls[selected_call].state &= ~IAXC_CALL_STATE_SELECTED; + } + selected_call = callNo; + return 0; + } + + // de-select and notify the old call if not also the new call + if ( callNo != selected_call ) + { + if ( selected_call >= 0 ) + { + calls[selected_call].state &= ~IAXC_CALL_STATE_SELECTED; + iaxci_do_state_callback(selected_call); + } + selected_call = callNo; + calls[selected_call].state |= IAXC_CALL_STATE_SELECTED; + } + + // if it's an incoming call, and ringing, answer it. + if ( !(calls[selected_call].state & IAXC_CALL_STATE_OUTGOING) && + (calls[selected_call].state & IAXC_CALL_STATE_RINGING) ) + { + iaxc_answer_call(selected_call); + } else + { + // otherwise just update state (answer does this for us) + iaxci_do_state_callback(selected_call); + } + + return 0; +} + +/* external API accessor */ +EXPORT int iaxc_selected_call() +{ + return selected_call; +} + +EXPORT void iaxc_set_networking(iaxc_sendto_t st, iaxc_recvfrom_t rf) +{ + iaxc_sendto = st; + iaxc_recvfrom = rf; +} + +EXPORT void iaxc_set_jb_target_extra( long value ) +{ + /* store in jb_target_extra, a static global */ + jb_target_extra = value; +} + +static void jb_errf(const char *fmt, ...) +{ + va_list args; + char buf[1024]; + + va_start(args, fmt); + vsnprintf(buf, 1024, fmt, args); + va_end(args); + + iaxci_usermsg(IAXC_ERROR, buf); +} + +static void jb_warnf(const char *fmt, ...) +{ + va_list args; + char buf[1024]; + + va_start(args, fmt); + vsnprintf(buf, 1024, fmt, args); + va_end(args); + + iaxci_usermsg(IAXC_NOTICE, buf); +} + +#ifdef JB_DEBUGGING +static void jb_dbgf(const char *fmt, ...) +{ + va_list args; + + va_start(args, fmt); + vfprintf(stderr, fmt, args); + va_end(args); +} +#endif + +static void setup_jb_output() +{ +#ifdef JB_DEBUGGING + jb_setoutput(jb_errf, jb_warnf, jb_dbgf); +#else + jb_setoutput(jb_errf, jb_warnf, NULL); +#endif +} + +// Note: Must be called before iaxc_initialize() +EXPORT void iaxc_set_preferred_source_udp_port(int port) +{ + source_udp_port = port; +} + +/* For "slow" systems. See iax.c code */ +EXPORT int iaxc_video_bypass_jitter(int mode) +{ + /* TODO: + * 1. When switching from jitter to no-jitter the buffer must be + * flushed of queued video packet and must be sent a key-frame + * to redraw the screen (partially done). + * 2. When switching from no-jitter to jitter we must drop all + * enqueued events prior the mode change (must be touched + * iax_sched_del and iax_get_event). + */ + return iax_video_bypass_jitter(calls[selected_call].session,mode); +} + +EXPORT int iaxc_get_bind_port() +{ + return iaxci_bound_port; +} + +EXPORT int iaxc_initialize(int num_calls) +{ + printf("ESTOY IAXC 0\n"); + int i; + int port; + + os_init(); + + setup_jb_output(); + + MUTEXINIT(&iaxc_lock); + MUTEXINIT(&event_queue_lock); + + iaxc_set_audio_prefs(0); + + if ( iaxc_recvfrom != (iaxc_recvfrom_t)recvfrom ) + iax_set_networking(iaxc_sendto, iaxc_recvfrom); + + /* Note that iax_init() only sets up the receive port when the + * sendto/recvfrom functions have not been replaced. We need + * to call iaxc_init in either case because there is other + * initialization beyond the socket setup that needs to be done. + */ + if ( (port = iax_init(source_udp_port)) < 0 ) + { + iaxci_usermsg(IAXC_ERROR, + "Fatal error: failed to initialize iax with port %d", + port); + return -1; + } + + if ( iaxc_recvfrom == (iaxc_recvfrom_t)recvfrom ) + iaxci_bound_port = port; + else + iaxci_bound_port = -1; + + /* tweak the jitterbuffer settings */ + iax_set_jb_target_extra( jb_target_extra ); + + max_calls = num_calls; + /* initialize calls */ + if ( max_calls <= 0 ) + max_calls = 1; /* 0 == Default? */ + + /* calloc zeroes for us */ + calls = (struct iaxc_call *)calloc(sizeof(struct iaxc_call), max_calls); + if ( !calls ) + { + iaxci_usermsg(IAXC_ERROR, "Fatal error: can't allocate memory"); + return -1; + } + + selected_call = -1; + + for ( i = 0; i < max_calls; i++ ) + { + strncpy(calls[i].callerid_name, DEFAULT_CALLERID_NAME, IAXC_EVENT_BUFSIZ); + strncpy(calls[i].callerid_number, DEFAULT_CALLERID_NUMBER, IAXC_EVENT_BUFSIZ); + } + printf("ESTOY IAXC\n"); + + if ( alsa_initialize(&audio_driver, 8000) ) + { + iaxci_usermsg(IAXC_ERROR, "failed alsa_initialize"); + return -1; + } +#ifdef USE_VIDEO + if ( video_initialize() ) + iaxci_usermsg(IAXC_ERROR, + "iaxc_initialize: cannot initialize video!\n"); +#endif + + /* Default audio format capabilities */ + audio_format_capability = + IAXC_FORMAT_ULAW | + IAXC_FORMAT_ALAW | +#ifdef CODEC_GSM + IAXC_FORMAT_GSM | +#endif + IAXC_FORMAT_SPEEX; + audio_format_preferred = IAXC_FORMAT_SPEEX; + + return 0; +} + +EXPORT void iaxc_shutdown() +{ + iaxc_dump_all_calls(); + + get_iaxc_lock(); + + if ( !test_mode ) + { + audio_driver.destroy(&audio_driver); +#ifdef USE_VIDEO + video_destroy(); +#endif + } + + /* destroy enocders and decoders for all existing calls */ + if ( calls ) + { + int i; + for ( i=0 ; idestroy(calls[i].encoder); + if ( calls[i].decoder ) + calls[i].decoder->destroy(calls[i].decoder); + if ( calls[i].vencoder ) + calls[i].vencoder->destroy(calls[i].vencoder); + if ( calls[i].vdecoder ) + calls[i].vdecoder->destroy(calls[i].vdecoder); + } + free(calls); + calls = NULL; + } + put_iaxc_lock(); +#ifdef WIN32 + //closesocket(iax_get_fd()); //fd: +#endif + + free(calls); + + MUTEXDESTROY(&event_queue_lock); + MUTEXDESTROY(&iaxc_lock); +} + + +EXPORT void iaxc_set_formats(int preferred, int allowed) +{ + audio_format_capability = allowed; + audio_format_preferred = preferred; +} + +EXPORT void iaxc_set_min_outgoing_framesize(int samples) +{ + minimum_outgoing_framesize = samples; +} + +EXPORT void iaxc_set_callerid(const char * name, const char * number) +{ + int i; + + for ( i = 0; i < max_calls; i++ ) + { + strncpy(calls[i].callerid_name, name, IAXC_EVENT_BUFSIZ); + strncpy(calls[i].callerid_number, number, IAXC_EVENT_BUFSIZ); + } +} + +static void iaxc_note_activity(int callNo) +{ + if ( callNo < 0 ) + return; + calls[callNo].last_activity = iax_tvnow(); +} + +static void iaxc_refresh_registrations() +{ + struct iaxc_registration *cur; + struct timeval now; + + now = iax_tvnow(); + + for ( cur = registrations; cur != NULL; cur = cur->next ) + { + // If there is less than three seconds before the registration is about + // to expire, renew it. + if ( iaxci_usecdiff(&now, &cur->last) > (cur->refresh - 3) * 1000 *1000 ) + { + if ( cur->session != NULL ) + { + iax_destroy( cur->session ); + } + cur->session = iax_session_new(); + if ( !cur->session ) + { + iaxci_usermsg(IAXC_ERROR, "Can't make new registration session"); + return; + } + iax_register(cur->session, cur->host, cur->user, cur->pass, cur->refresh); + cur->last = now; + } + } +} + +#define LOOP_SLEEP 5 // In ms +static THREADFUNCDECL(main_proc_thread_func) +{ + static int refresh_registration_count = 0; + + THREADFUNCRET(ret); + + /* Increase Priority */ + iaxci_prioboostbegin(); + + while ( !main_proc_thread_flag ) + { + get_iaxc_lock(); + + service_network(); + if ( !test_mode ) + service_audio(); + + // Check registration refresh once a second + if ( refresh_registration_count++ > 1000/LOOP_SLEEP ) + { + iaxc_refresh_registrations(); + refresh_registration_count = 0; + } + + put_iaxc_lock(); + + iaxc_millisleep(LOOP_SLEEP); + } + + /* Decrease priority */ + iaxci_prioboostend(); + + main_proc_thread_flag = -1; + + return ret; +} + +EXPORT int iaxc_start_processing_thread() +{ + main_proc_thread_flag = 0; + + if ( THREADCREATE(main_proc_thread_func, NULL, main_proc_thread, + main_proc_thread_id) == THREADCREATE_ERROR) + return -1; + + return 0; +} + +EXPORT int iaxc_stop_processing_thread() +{ + if ( main_proc_thread_flag >= 0 ) + { + main_proc_thread_flag = 1; + THREADJOIN(main_proc_thread); + } + + return 0; +} + +static int service_audio() +{ + /* TODO: maybe we shouldn't allocate 8kB on the stack here. */ + short buf [4096]; + + int want_send_audio = + selected_call >= 0 && + ((calls[selected_call].state & IAXC_CALL_STATE_OUTGOING) || + (calls[selected_call].state & IAXC_CALL_STATE_COMPLETE)) + && !(audio_prefs & IAXC_AUDIO_PREF_SEND_DISABLE); + + int want_local_audio = + (audio_prefs & IAXC_AUDIO_PREF_RECV_LOCAL_RAW) || + (audio_prefs & IAXC_AUDIO_PREF_RECV_LOCAL_ENCODED); + + if ( want_local_audio || want_send_audio ) + { + for ( ;; ) + { + int to_read; + int cmin; + + audio_driver.start(&audio_driver); + + /* use codec minimum if higher */ + cmin = want_send_audio && calls[selected_call].encoder ? + calls[selected_call].encoder->minimum_frame_size : + 1; + + to_read = cmin > minimum_outgoing_framesize ? + cmin : minimum_outgoing_framesize; + + /* Round up to the next multiple */ + if ( to_read % cmin ) + to_read += cmin - (to_read % cmin); + + if ( to_read > (int)(sizeof(buf) / sizeof(short)) ) + { + fprintf(stderr, + "internal error: to_read > sizeof(buf)\n"); + exit(1); + } + + /* Currently pa gives us either all the bits we ask for or none */ + if ( audio_driver.input(&audio_driver, buf, &to_read) ) + { + iaxci_usermsg(IAXC_ERROR, "ERROR reading audio\n"); + break; + } + + /* Frame was not available */ + if ( !to_read ) + break; + + if ( audio_prefs & IAXC_AUDIO_PREF_RECV_LOCAL_RAW ) + iaxci_do_audio_callback(selected_call, 0, + IAXC_SOURCE_LOCAL, 0, 0, + to_read * 2, (unsigned char *)buf); + + if ( want_send_audio ) + audio_send_encoded_audio(&calls[selected_call], + selected_call, buf, + calls[selected_call].format & + IAXC_AUDIO_FORMAT_MASK, + to_read); + } + } + else + { + static int i = 0; + + audio_driver.stop(&audio_driver); + + /*! + \deprecated + Q: Why do we continuously send IAXC_EVENT_LEVELS events + when there is no selected call? + + A: So that certain users of iaxclient do not have to + reset their vu meters when a call ends -- they can just + count on getting level callbacks. This is a bit of a hack + so any applications relying on this behavior should maybe + be changed. + */ + if ( i++ % 50 == 0 ) + iaxci_do_levels_callback(AUDIO_ENCODE_SILENCE_DB, + AUDIO_ENCODE_SILENCE_DB); + } + + return 0; +} + +/* handle IAX text events */ +static void handle_text_event(struct iax_event *e, int callNo) +{ + iaxc_event ev; + int len; + + if ( callNo < 0 ) + return; + + memset(&ev, 0, sizeof(iaxc_event)); + ev.type = IAXC_EVENT_TEXT; + ev.ev.text.type = IAXC_TEXT_TYPE_IAX; + ev.ev.text.callNo = callNo; + + len = e->datalen <= IAXC_EVENT_BUFSIZ - 1 ? e->datalen : IAXC_EVENT_BUFSIZ - 1; + strncpy(ev.ev.text.message, (char *) e->data, len); + iaxci_post_event(ev); +} + +/* handle IAX URL events */ +void handle_url_event( struct iax_event *e, int callNo ) +{ + iaxc_event ev; + + if ( callNo < 0 ) + return; + + ev.ev.url.callNo = callNo; + ev.type = IAXC_EVENT_URL; + strcpy( ev.ev.url.url, "" ); + + switch ( e->subclass ) + { + case AST_HTML_URL: + ev.ev.url.type = IAXC_URL_URL; + if ( e->datalen ) + { + if ( e->datalen > IAXC_EVENT_BUFSIZ ) + { + fprintf( stderr, "ERROR: URL too long %d > %d\n", + e->datalen, IAXC_EVENT_BUFSIZ ); + } else + { + strncpy( ev.ev.url.url, (char *) e->data, e->datalen ); + } + } + /* fprintf( stderr, "URL:%s\n", ev.ev.url.url ); */ + break; + case AST_HTML_LINKURL: + ev.ev.url.type = IAXC_URL_LINKURL; + /* fprintf( stderr, "LINKURL event\n" ); */ + break; + case AST_HTML_LDCOMPLETE: + ev.ev.url.type = IAXC_URL_LDCOMPLETE; + /* fprintf( stderr, "LDCOMPLETE event\n" ); */ + break; + case AST_HTML_UNLINK: + ev.ev.url.type = IAXC_URL_UNLINK; + /* fprintf( stderr, "UNLINK event\n" ); */ + break; + case AST_HTML_LINKREJECT: + ev.ev.url.type = IAXC_URL_LINKREJECT; + /* fprintf( stderr, "LINKREJECT event\n" ); */ + break; + default: + fprintf( stderr, "Unknown URL event %d\n", e->subclass ); + break; + } + iaxci_post_event( ev ); +} + +/* DANGER: bad things can happen if iaxc_netstat != iax_netstat.. */ +EXPORT int iaxc_get_netstats(int call, int *rtt, struct iaxc_netstat *local, + struct iaxc_netstat *remote) +{ + return iax_get_netstats(calls[call].session, rtt, + (struct iax_netstat *)local, + (struct iax_netstat *)remote); +} + +/* handle IAX text events */ +static void generate_netstat_event(int callNo) +{ + iaxc_event ev; + + if ( callNo < 0 ) + return; + + ev.type = IAXC_EVENT_NETSTAT; + ev.ev.netstats.callNo = callNo; + + /* only post the event if the session is valid, etc */ + if ( !iaxc_get_netstats(callNo, &ev.ev.netstats.rtt, + &ev.ev.netstats.local, &ev.ev.netstats.remote)) + iaxci_post_event(ev); +} + +static void handle_audio_event(struct iax_event *e, int callNo) +{ + int total_consumed = 0; + short fr[4096]; + const int fr_samples = sizeof(fr) / sizeof(short); + int samples, format; +#ifdef WIN32 + int cycles_max = 100; //fd: +#endif + struct iaxc_call *call; + + if ( callNo < 0 ) + return; + + call = &calls[callNo]; + + if ( callNo != selected_call ) + { + /* drop audio for unselected call? */ + return; + } + + samples = fr_samples; + format = call->format & IAXC_AUDIO_FORMAT_MASK; + + do + { + int bytes_decoded; + + int mainbuf_delta = fr_samples - samples; + + bytes_decoded = audio_decode_audio(call, + fr, + e->data + total_consumed, + e->datalen - total_consumed, + format, + &samples); + + if ( bytes_decoded < 0 ) + { + iaxci_usermsg(IAXC_STATUS, + "Bad or incomplete voice packet. Unable to decode. dropping"); + return; + } + + /* Pass encoded audio back to the app if required */ + if ( audio_prefs & IAXC_AUDIO_PREF_RECV_REMOTE_ENCODED ) + iaxci_do_audio_callback(callNo, e->ts, IAXC_SOURCE_REMOTE, + 1, format & IAXC_AUDIO_FORMAT_MASK, + e->datalen - total_consumed, + e->data + total_consumed); + +#ifdef WIN32 + //fd: start: for some reason it loops here. Try to avoid it + cycles_max--; + if ( cycles_max < 0 ) + { + iaxc_millisleep(0); + } + //fd: end +#endif + total_consumed += bytes_decoded; + if ( audio_prefs & IAXC_AUDIO_PREF_RECV_REMOTE_RAW ) + { + // audio_decode_audio returns the number of samples. + // We are using 16 bit samples, so we need to double + // the number to obtain the size in bytes. + // format will also be 0 since this is raw audio + int size = (fr_samples - samples - mainbuf_delta) * 2; + iaxci_do_audio_callback(callNo, e->ts, IAXC_SOURCE_REMOTE, + 0, 0, size, (unsigned char *)fr); + } + + if ( iaxci_audio_output_mode ) + continue; + + if ( !test_mode ) + audio_driver.output(&audio_driver, fr, + fr_samples - samples - mainbuf_delta); + + } while ( total_consumed < e->datalen ); +} + +#ifdef USE_VIDEO +static void handle_video_event(struct iax_event *e, int callNo) +{ + struct iaxc_call *call; + + if ( callNo < 0 ) + return; + + if ( e->datalen == 0 ) + { + iaxci_usermsg(IAXC_STATUS, "Received 0-size packet. Unable to decode."); + return; + } + + call = &calls[callNo]; + + if ( callNo != selected_call ) + { + /* drop video for unselected call? */ + return; + } + + if ( call->vformat ) + { + if ( video_recv_video(call, selected_call, e->data, + e->datalen, e->ts, call->vformat) < 0 ) + { + iaxci_usermsg(IAXC_STATUS, + "Bad or incomplete video packet. Unable to decode."); + return; + } + } +} +#endif /* USE_VIDEO */ + +static void iaxc_handle_network_event(struct iax_event *e, int callNo) +{ + if ( callNo < 0 ) + return; + + iaxc_note_activity(callNo); + + switch ( e->etype ) + { + case IAX_EVENT_NULL: + break; + case IAX_EVENT_HANGUP: + iaxci_usermsg(IAXC_STATUS, "Call disconnected by remote"); + // XXX does the session go away now? + iaxc_clear_call(callNo); + break; + case IAX_EVENT_REJECT: + iaxci_usermsg(IAXC_STATUS, "Call rejected by remote"); + iaxc_clear_call(callNo); + break; + case IAX_EVENT_ACCEPT: + calls[callNo].format = e->ies.format & IAXC_AUDIO_FORMAT_MASK; + calls[callNo].vformat = e->ies.format & IAXC_VIDEO_FORMAT_MASK; +#ifdef USE_VIDEO + if ( !(e->ies.format & IAXC_VIDEO_FORMAT_MASK) ) + { + iaxci_usermsg(IAXC_NOTICE, + "Failed video codec negotiation."); + } +#endif + iaxci_usermsg(IAXC_STATUS,"Call %d accepted", callNo); + break; + case IAX_EVENT_ANSWER: + calls[callNo].state &= ~IAXC_CALL_STATE_RINGING; + calls[callNo].state |= IAXC_CALL_STATE_COMPLETE; + iaxci_do_state_callback(callNo); + iaxci_usermsg(IAXC_STATUS,"Call %d answered", callNo); + //iaxc_answer_call(callNo); + // notify the user? + break; + case IAX_EVENT_BUSY: + calls[callNo].state &= ~IAXC_CALL_STATE_RINGING; + calls[callNo].state |= IAXC_CALL_STATE_BUSY; + iaxci_do_state_callback(callNo); + iaxci_usermsg(IAXC_STATUS, "Call %d busy", callNo); + break; + case IAX_EVENT_VOICE: + handle_audio_event(e, callNo); + if ( (calls[callNo].state & IAXC_CALL_STATE_OUTGOING) && + (calls[callNo].state & IAXC_CALL_STATE_RINGING) ) + { + calls[callNo].state &= ~IAXC_CALL_STATE_RINGING; + calls[callNo].state |= IAXC_CALL_STATE_COMPLETE; + iaxci_do_state_callback(callNo); + iaxci_usermsg(IAXC_STATUS,"Call %d progress", + callNo); + } + break; +#ifdef USE_VIDEO + case IAX_EVENT_VIDEO: + handle_video_event(e, callNo); + break; +#endif + case IAX_EVENT_TEXT: + handle_text_event(e, callNo); + break; + case IAX_EVENT_RINGA: + calls[callNo].state |= IAXC_CALL_STATE_RINGING; + iaxci_do_state_callback(callNo); + iaxci_usermsg(IAXC_STATUS,"Call %d ringing", callNo); + break; + case IAX_EVENT_PONG: + generate_netstat_event(callNo); + break; + case IAX_EVENT_URL: + handle_url_event(e, callNo); + break; + case IAX_EVENT_CNG: + /* ignore? */ + break; + case IAX_EVENT_TIMEOUT: + iax_hangup(e->session, "Call timed out"); + iaxci_usermsg(IAXC_STATUS, "Call %d timed out.", callNo); + iaxc_clear_call(callNo); + break; + case IAX_EVENT_TRANSFER: + calls[callNo].state |= IAXC_CALL_STATE_TRANSFER; + iaxci_do_state_callback(callNo); + iaxci_usermsg(IAXC_STATUS,"Call %d transfer released", callNo); + break; + case IAX_EVENT_DTMF: + iaxci_do_dtmf_callback(callNo,e->subclass); + iaxci_usermsg(IAXC_STATUS, "DTMF digit %c received", e->subclass); + break; + default: + iaxci_usermsg(IAXC_STATUS, "Unknown event: %d for call %d", e->etype, callNo); + break; + } +} + +EXPORT int iaxc_unregister( int id ) +{ + int count = 0; + get_iaxc_lock(); + count = iaxc_remove_registration_by_id(id); + put_iaxc_lock(); + return count; +} + +EXPORT int iaxc_register(const char * user, const char * pass, const char * host) +{ + return iaxc_register_ex(user, pass, host, 60); +} + +EXPORT int iaxc_register_ex(const char * user, const char * pass, const char * host, int refresh) +{ + struct iaxc_registration *newreg; + + newreg = (struct iaxc_registration *)malloc(sizeof (struct iaxc_registration)); + if ( !newreg ) + { + iaxci_usermsg(IAXC_ERROR, "Can't make new registration"); + return -1; + } + + get_iaxc_lock(); + newreg->session = iax_session_new(); + if ( !newreg->session ) + { + iaxci_usermsg(IAXC_ERROR, "Can't make new registration session"); + put_iaxc_lock(); + return -1; + } + + newreg->last = iax_tvnow(); + newreg->refresh = refresh; + + strncpy(newreg->host, host, 256); + strncpy(newreg->user, user, 256); + strncpy(newreg->pass, pass, 256); + + /* send out the initial registration with refresh seconds */ + iax_register(newreg->session, host, user, pass, refresh); + + /* add it to the list; */ + newreg->id = ++next_registration_id; + newreg->next = registrations; + registrations = newreg; + + put_iaxc_lock(); + return newreg->id; +} + +static void codec_destroy( int callNo ) +{ + if ( calls[callNo].encoder ) + { + calls[callNo].encoder->destroy( calls[callNo].encoder ); + calls[callNo].encoder = NULL; + } + if ( calls[callNo].decoder ) + { + calls[callNo].decoder->destroy( calls[callNo].decoder ); + calls[callNo].decoder = NULL; + } + if ( calls[callNo].vdecoder ) + { + calls[callNo].vdecoder->destroy(calls[callNo].vdecoder); + calls[callNo].vdecoder = NULL; + } + if ( calls[callNo].vencoder ) + { + calls[callNo].vencoder->destroy(calls[callNo].vencoder); + calls[callNo].vencoder = NULL; + } +} + +EXPORT int iaxc_call(const char * num) +{ + return iaxc_call_ex(num, NULL, NULL, 1); +} + +EXPORT int iaxc_call_ex(const char *num, const char* callerid_name, const char* callerid_number, int video) +{ + int video_format_capability = 0; + int video_format_preferred = 0; + int callNo = -1; + struct iax_session *newsession; + char *ext = strstr(num, "/"); + + get_iaxc_lock(); + + // if no call is selected, get a new appearance + if ( selected_call < 0 ) + { + callNo = iaxc_first_free_call(); + } else + { + // use selected call if not active, otherwise, get a new appearance + if ( calls[selected_call].state & IAXC_CALL_STATE_ACTIVE ) + { + callNo = iaxc_first_free_call(); + } else + { + callNo = selected_call; + } + } + + if ( callNo < 0 ) + { + iaxci_usermsg(IAXC_STATUS, "No free call appearances"); + goto iaxc_call_bail; + } + + newsession = iax_session_new(); + if ( !newsession ) + { + iaxci_usermsg(IAXC_ERROR, "Can't make new session"); + goto iaxc_call_bail; + } + + calls[callNo].session = newsession; + + codec_destroy( callNo ); + + if ( ext ) + { + strncpy(calls[callNo].remote_name, num, IAXC_EVENT_BUFSIZ); + strncpy(calls[callNo].remote, ++ext, IAXC_EVENT_BUFSIZ); + } else + { + strncpy(calls[callNo].remote_name, num, IAXC_EVENT_BUFSIZ); + strncpy(calls[callNo].remote, "" , IAXC_EVENT_BUFSIZ); + } + + if ( callerid_number != NULL ) + strncpy(calls[callNo].callerid_number, callerid_number, IAXC_EVENT_BUFSIZ); + + if ( callerid_name != NULL ) + strncpy(calls[callNo].callerid_name, callerid_name, IAXC_EVENT_BUFSIZ); + + strncpy(calls[callNo].local , calls[callNo].callerid_name, IAXC_EVENT_BUFSIZ); + strncpy(calls[callNo].local_context, "default", IAXC_EVENT_BUFSIZ); + + calls[callNo].state = IAXC_CALL_STATE_ACTIVE | IAXC_CALL_STATE_OUTGOING; + + /* reset activity and ping "timers" */ + iaxc_note_activity(callNo); + calls[callNo].last_ping = calls[callNo].last_activity; + +#ifdef USE_VIDEO + if ( video ) + iaxc_video_format_get_cap(&video_format_preferred, &video_format_capability); +#endif + + iaxci_usermsg(IAXC_NOTICE, "Originating an %s call", + video_format_preferred ? "audio+video" : "audio only"); + iax_call(calls[callNo].session, calls[callNo].callerid_number, + calls[callNo].callerid_name, num, NULL, 0, + audio_format_preferred | video_format_preferred, + audio_format_capability | video_format_capability); + + // does state stuff also + iaxc_select_call(callNo); + +iaxc_call_bail: + put_iaxc_lock(); + + return callNo; +} + +EXPORT void iaxc_send_busy_on_incoming_call(int callNo) +{ + if ( callNo < 0 ) + return; + + iax_busy(calls[callNo].session); +} + +EXPORT void iaxc_answer_call(int callNo) +{ + if ( callNo < 0 ) + return; + + calls[callNo].state |= IAXC_CALL_STATE_COMPLETE; + calls[callNo].state &= ~IAXC_CALL_STATE_RINGING; + iax_answer(calls[callNo].session); + iaxci_do_state_callback(callNo); +} + +EXPORT void iaxc_blind_transfer_call(int callNo, const char * dest_extension) +{ + if ( callNo < 0 || !(calls[callNo].state & IAXC_CALL_STATE_ACTIVE) ) + return; + + iax_transfer(calls[callNo].session, dest_extension); +} + +EXPORT void iaxc_setup_call_transfer(int sourceCallNo, int targetCallNo) +{ + if ( sourceCallNo < 0 || targetCallNo < 0 || + !(calls[sourceCallNo].state & IAXC_CALL_STATE_ACTIVE) || + !(calls[targetCallNo].state & IAXC_CALL_STATE_ACTIVE) ) + return; + + iax_setup_transfer(calls[sourceCallNo].session, calls[targetCallNo].session); +} + +static void iaxc_dump_one_call(int callNo) +{ + if ( callNo < 0 ) + return; + if ( calls[callNo].state == IAXC_CALL_STATE_FREE ) + return; + + iax_hangup(calls[callNo].session,"Dumped Call"); + iaxci_usermsg(IAXC_STATUS, "Hanging up call %d", callNo); + iaxc_clear_call(callNo); +} + +EXPORT void iaxc_dump_all_calls(void) +{ + int callNo; + get_iaxc_lock(); + for ( callNo = 0; callNo < max_calls; callNo++ ) + iaxc_dump_one_call(callNo); + put_iaxc_lock(); +} + + +EXPORT void iaxc_dump_call_number( int callNo ) +{ + if ( ( callNo >= 0 ) && ( callNo < max_calls ) ) + { + get_iaxc_lock(); + iaxc_dump_one_call(callNo); + put_iaxc_lock(); + } +} + +EXPORT void iaxc_dump_call(void) +{ + if ( selected_call >= 0 ) + { + get_iaxc_lock(); + iaxc_dump_one_call(selected_call); + put_iaxc_lock(); + } +} + +EXPORT void iaxc_reject_call(void) +{ + if ( selected_call >= 0 ) + { + iaxc_reject_call_number(selected_call); + } +} + +EXPORT void iaxc_reject_call_number( int callNo ) +{ + if ( ( callNo >= 0 ) && ( callNo < max_calls ) ) + { + get_iaxc_lock(); + iax_reject(calls[callNo].session, "Call rejected manually."); + iaxc_clear_call(callNo); + put_iaxc_lock(); + } +} + +EXPORT void iaxc_send_dtmf(char digit) +{ + if ( selected_call >= 0 ) + { + get_iaxc_lock(); + if ( calls[selected_call].state & IAXC_CALL_STATE_ACTIVE ) + iax_send_dtmf(calls[selected_call].session,digit); + put_iaxc_lock(); + } +} + +EXPORT void iaxc_send_text(const char * text) +{ + if ( selected_call >= 0 ) + { + get_iaxc_lock(); + if ( calls[selected_call].state & IAXC_CALL_STATE_ACTIVE ) + iax_send_text(calls[selected_call].session, text); + put_iaxc_lock(); + } +} + +EXPORT void iaxc_send_text_call(int callNo, const char * text) +{ + if ( callNo < 0 || !(calls[callNo].state & IAXC_CALL_STATE_ACTIVE) ) + return; + + get_iaxc_lock(); + if ( calls[callNo].state & IAXC_CALL_STATE_ACTIVE ) + iax_send_text(calls[callNo].session, text); + put_iaxc_lock(); +} + +EXPORT void iaxc_send_url(const char * url, int link) +{ + if ( selected_call >= 0 ) + { + get_iaxc_lock(); + if ( calls[selected_call].state & IAXC_CALL_STATE_ACTIVE ) + iax_send_url(calls[selected_call].session, url, link); + put_iaxc_lock(); + } +} + +static int iaxc_find_call_by_session(struct iax_session *session) +{ + int i; + for ( i = 0; i < max_calls; i++ ) + if ( calls[i].session == session ) + return i; + return -1; +} + +static struct iaxc_registration *iaxc_find_registration_by_session( + struct iax_session *session) +{ + struct iaxc_registration *reg; + for (reg = registrations; reg != NULL; reg = reg->next) + if ( reg->session == session ) + break; + return reg; +} + +static void iaxc_handle_regreply(struct iax_event *e, struct iaxc_registration *reg) +{ + iaxci_do_registration_callback(reg->id, e->etype, e->ies.msgcount); + + // XXX I think the session is no longer valid.. at least, that's + // what miniphone does, and re-using the session doesn't seem to + // work! + iax_destroy(reg->session); + reg->session = NULL; + + if ( e->etype == IAX_EVENT_REGREJ ) + { + // we were rejected, so end the registration + iaxc_remove_registration_by_id(reg->id); + } +} + +/* this is what asterisk does */ +static int iaxc_choose_codec(int formats) +{ + int i; + static int codecs[] = + { + IAXC_FORMAT_ULAW, + IAXC_FORMAT_ALAW, + IAXC_FORMAT_SLINEAR, + IAXC_FORMAT_G726, + IAXC_FORMAT_ADPCM, + IAXC_FORMAT_GSM, + IAXC_FORMAT_ILBC, + IAXC_FORMAT_SPEEX, + IAXC_FORMAT_LPC10, + IAXC_FORMAT_G729A, + IAXC_FORMAT_G723_1, + + /* To negotiate video codec */ + IAXC_FORMAT_JPEG, + IAXC_FORMAT_PNG, + IAXC_FORMAT_H261, + IAXC_FORMAT_H263, + IAXC_FORMAT_H263_PLUS, + IAXC_FORMAT_MPEG4, + IAXC_FORMAT_H264, + IAXC_FORMAT_THEORA, + }; + for ( i = 0; i < (int)(sizeof(codecs) / sizeof(int)); i++ ) + if ( codecs[i] & formats ) + return codecs[i]; + return 0; +} + +static void iaxc_handle_connect(struct iax_event * e) +{ +#ifdef USE_VIDEO + int video_format_capability; + int video_format_preferred; +#endif + int video_format = 0; + int format = 0; + int callno; + + callno = iaxc_first_free_call(); + + if ( callno < 0 ) + { + iaxci_usermsg(IAXC_STATUS, + "%i \n Incoming Call, but no appearances", + callno); + // XXX Reject this call!, or just ignore? + //iax_reject(e->session, "Too many calls, we're busy!"); + iax_accept(e->session, audio_format_preferred & e->ies.capability); + iax_busy(e->session); + return; + } + + /* negotiate codec */ + /* first, try _their_ preferred format */ + format = audio_format_capability & e->ies.format; + if ( !format ) + { + /* then, try our preferred format */ + format = audio_format_preferred & e->ies.capability; + } + + if ( !format ) + { + /* finally, see if we have one in common */ + format = audio_format_capability & e->ies.capability; + + /* now choose amongst these, if we got one */ + if ( format ) + { + format = iaxc_choose_codec(format); + } + } + + if ( !format ) + { + iax_reject(e->session, "Could not negotiate common codec"); + return; + } + +#ifdef USE_VIDEO + iaxc_video_format_get_cap(&video_format_preferred, + &video_format_capability); + + /* first, see if they even want video */ + video_format = (e->ies.format & IAXC_VIDEO_FORMAT_MASK); + + if ( video_format ) + { + /* next, try _their_ preferred format */ + video_format &= video_format_capability; + + if ( !video_format ) + { + /* then, try our preferred format */ + video_format = video_format_preferred & + (e->ies.capability & IAXC_VIDEO_FORMAT_MASK); + } + + if ( !video_format ) + { + /* finally, see if we have one in common */ + video_format = video_format_capability & + (e->ies.capability & IAXC_VIDEO_FORMAT_MASK); + + /* now choose amongst these, if we got one */ + if ( video_format ) + { + video_format = iaxc_choose_codec(video_format); + } + } + + /* All video negotiations failed, then warn */ + if ( !video_format ) + { + iaxci_usermsg(IAXC_NOTICE, + "Notice: could not negotiate common video codec"); + iaxci_usermsg(IAXC_NOTICE, + "Notice: switching to audio-only call"); + } + } +#endif /* USE_VIDEO */ + + calls[callno].vformat = video_format; + calls[callno].format = format; + + if ( e->ies.called_number ) + strncpy(calls[callno].local, e->ies.called_number, + IAXC_EVENT_BUFSIZ); + else + strncpy(calls[callno].local, "unknown", + IAXC_EVENT_BUFSIZ); + + if ( e->ies.called_context ) + strncpy(calls[callno].local_context, e->ies.called_context, + IAXC_EVENT_BUFSIZ); + else + strncpy(calls[callno].local_context, "", + IAXC_EVENT_BUFSIZ); + + if ( e->ies.calling_number ) + strncpy(calls[callno].remote, e->ies.calling_number, + IAXC_EVENT_BUFSIZ); + else + strncpy(calls[callno].remote, "unknown", + IAXC_EVENT_BUFSIZ); + + if ( e->ies.calling_name ) + strncpy(calls[callno].remote_name, e->ies.calling_name, + IAXC_EVENT_BUFSIZ); + else + strncpy(calls[callno].remote_name, "unknown", + IAXC_EVENT_BUFSIZ); + + iaxc_note_activity(callno); + iaxci_usermsg(IAXC_STATUS, "Call from (%s)", calls[callno].remote); + + codec_destroy( callno ); + + calls[callno].session = e->session; + calls[callno].state = IAXC_CALL_STATE_ACTIVE|IAXC_CALL_STATE_RINGING; + + iax_accept(calls[callno].session, format | video_format); + iax_ring_announce(calls[callno].session); + + iaxci_do_state_callback(callno); + + iaxci_usermsg(IAXC_STATUS, "Incoming call on line %d", callno); +} + +static void service_network() +{ + struct iax_event *e = 0; + int callNo; + struct iaxc_registration *reg; + + while ( (e = iax_get_event(0)) ) + { +#ifdef WIN32 + iaxc_millisleep(0); //fd: +#endif + // first, see if this is an event for one of our calls. + callNo = iaxc_find_call_by_session(e->session); + if ( e->etype == IAX_EVENT_NULL ) + { + // Should we do something here? + // Right now we do nothing, just go with the flow + // and let the event be deallocated. + } else if ( callNo >= 0 ) + { + iaxc_handle_network_event(e, callNo); + } else if ( (reg = iaxc_find_registration_by_session(e->session)) != NULL ) + { + iaxc_handle_regreply(e,reg); + } else if ( e->etype == IAX_EVENT_REGACK || e->etype == IAX_EVENT_REGREJ ) + { + iaxci_usermsg(IAXC_ERROR, "Unexpected registration reply"); + } else if ( e->etype == IAX_EVENT_REGREQ ) + { + iaxci_usermsg(IAXC_ERROR, + "Registration requested by someone, but we don't understand!"); + } else if ( e->etype == IAX_EVENT_CONNECT ) + { + iaxc_handle_connect(e); + } else if ( e->etype == IAX_EVENT_TIMEOUT ) + { + iaxci_usermsg(IAXC_STATUS, + "Timeout for a non-existant session. Dropping", + e->etype); + } else + { + iaxci_usermsg(IAXC_ERROR, + "Event (type %d) for a non-existant session. Dropping", + e->etype); + } + iax_event_free(e); + } +} + +EXPORT int iaxc_audio_devices_get(struct iaxc_audio_device **devs, int *nDevs, + int *input, int *output, int *ring) +{ + if ( test_mode ) + return 0; + + *devs = audio_driver.devices; + *nDevs = audio_driver.nDevices; + audio_driver.selected_devices(&audio_driver, input, output, ring); + return 0; +} + +EXPORT int iaxc_audio_devices_set(int input, int output, int ring) +{ + int ret; + + if ( test_mode ) + return 0; + + get_iaxc_lock(); + ret = audio_driver.select_devices(&audio_driver, input, output, ring); + put_iaxc_lock(); + return ret; +} + +EXPORT float iaxc_input_level_get() +{ + if ( test_mode ) + return 0; + + return audio_driver.input_level_get(&audio_driver); +} + +EXPORT float iaxc_output_level_get() +{ + if ( test_mode ) + return 0; + + return audio_driver.output_level_get(&audio_driver); +} + +EXPORT int iaxc_input_level_set(float level) +{ + if ( test_mode ) + return 0; + + return audio_driver.input_level_set(&audio_driver, level); +} + +EXPORT int iaxc_output_level_set(float level) +{ + if ( test_mode ) + return 0; + + return audio_driver.output_level_set(&audio_driver, level); +} + +EXPORT int iaxc_play_sound(struct iaxc_sound *s, int ring) +{ + int ret; + + if ( test_mode ) + return 0; + + get_iaxc_lock(); + ret = audio_driver.play_sound(s,ring); + put_iaxc_lock(); + return ret; +} + +EXPORT int iaxc_stop_sound(int id) +{ + int ret; + + if ( test_mode ) + return 0; + + get_iaxc_lock(); + ret = audio_driver.stop_sound(id); + put_iaxc_lock(); + return ret; +} + +EXPORT int iaxc_quelch(int callNo, int MOH) +{ + struct iax_session *session = calls[callNo].session; + if ( !session ) + return -1; + + return iax_quelch_moh(session, MOH); +} + +EXPORT int iaxc_unquelch(int call) +{ + return iax_unquelch(calls[call].session); +} + +EXPORT int iaxc_mic_boost_get( void ) +{ + return audio_driver.mic_boost_get( &audio_driver ) ; +} + +EXPORT int iaxc_mic_boost_set( int enable ) +{ + return audio_driver.mic_boost_set( &audio_driver, enable ) ; +} + +EXPORT char* iaxc_version(char * ver) +{ +#ifndef LIBVER +#define LIBVER "" +#endif + strncpy(ver, LIBVER, IAXC_EVENT_BUFSIZ); + return ver; +} + +EXPORT unsigned int iaxc_get_audio_prefs(void) +{ + return audio_prefs; +} + +EXPORT int iaxc_set_audio_prefs(unsigned int prefs) +{ + unsigned int prefs_mask = + IAXC_AUDIO_PREF_RECV_LOCAL_RAW | + IAXC_AUDIO_PREF_RECV_LOCAL_ENCODED | + IAXC_AUDIO_PREF_RECV_REMOTE_RAW | + IAXC_AUDIO_PREF_RECV_REMOTE_ENCODED | + IAXC_AUDIO_PREF_SEND_DISABLE; + + if ( prefs & ~prefs_mask ) + return -1; + + audio_prefs = prefs; + return 0; +} + +EXPORT void iaxc_set_test_mode(int tm) +{ + test_mode = tm; +} + +EXPORT int iaxc_push_audio(void *data, unsigned int size, unsigned int samples) +{ + struct iaxc_call *call; + + if ( selected_call < 0 ) + return -1; + + call = &calls[selected_call]; + + if ( audio_prefs & IAXC_AUDIO_PREF_SEND_DISABLE ) + return 0; + + //fprintf(stderr, "iaxc_push_audio: sending audio size %d\n", size); + + if ( iax_send_voice(call->session, call->format, data, size, samples) == -1 ) + { + fprintf(stderr, "iaxc_push_audio: failed to send audio frame of size %d on call %d\n", size, selected_call); + return -1; + } + + return 0; +} + +EXPORT void iaxc_key_radio(int callNo) +{ + if ( callNo < 0 ) + return; + + iax_key_radio(calls[callNo].session); +} + +EXPORT void iaxc_unkey_radio(int callNo) +{ + if ( callNo < 0 ) + return; + + iax_unkey_radio(calls[callNo].session); +} + +EXPORT void iaxc_set_radiono(int r) +{ + radioNo = r; +} + +void iaxc_debug_iax_set(int enable) +{ +#ifdef DEBUG_SUPPORT + if (enable) + iax_enable_debug(); + else + iax_disable_debug(); +#endif +} diff --git a/3rdparty/iaxclient-2/lib/iaxclient_lib.h b/3rdparty/iaxclient-2/lib/iaxclient_lib.h new file mode 100644 index 0000000..5a28ba7 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/iaxclient_lib.h @@ -0,0 +1,268 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Michael Van Donselaar + * Shawn Lawrence + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ +#ifndef _iaxclient_lib_h +#define _iaxclient_lib_h + +#ifdef __cplusplus +extern "C" { +#endif + + +/* This is the internal include file for IAXCLIENT -- externally + * accessible APIs should be declared in iaxclient.h */ + +#ifdef HAVE_CONFIG_H +//#include "config.h" +#endif + +#include +#include + +#if defined(WIN32) || defined(_WIN32_WCE) +#include "winpoop.h" +#if !defined(_WIN32_WCE) +#include +#endif +#include +#include + +#else +#include +#include +#include +#include +#include +#endif + +#ifdef USE_FFMPEG +// To access to check_ff function +#include "codec_ffmpeg.h" +#endif + +#include +#include +#include "spandsp/plc.h" + + + +/* os-dependent macros, etc */ +#if defined(WIN32) || defined(_WIN32_WCE) +#define THREAD HANDLE +#define THREADID unsigned +#define THREADCREATE(func, args, thread, id) \ +(thread = (HANDLE)_beginthreadex(NULL, 0, func, (PVOID)args, 0, &id)) +#define THREADCREATE_ERROR NULL +#define THREADFUNCDECL(func) unsigned __stdcall func(PVOID args) +#define THREADFUNCRET(r) int r = 0 +#define THREADJOIN(t) +/* causes deadlock with wx GUI on MSW */ +/* #define THREADJOIN(t) WaitForSingleObject(t, INFINITE) */ +#ifndef _WIN32_WINNT +extern WINBASEAPI BOOL WINAPI TryEnterCriticalSection( LPCRITICAL_SECTION lpCriticalSection ); +#endif +#define MUTEX CRITICAL_SECTION +#define MUTEXINIT(m) InitializeCriticalSection(m) +#define MUTEXLOCK(m) EnterCriticalSection(m) +#define MUTEXTRYLOCK(m) (!TryEnterCriticalSection(m)) +#define MUTEXUNLOCK(m) LeaveCriticalSection(m) +#define MUTEXDESTROY(m) DeleteCriticalSection(m) + +#else +#define THREAD pthread_t +#define THREADID unsigned /* unused for Posix Threads */ +#define THREADCREATE(func, args, thread, id) \ +pthread_create(&thread, NULL, func, args) +#define THREADCREATE_ERROR -1 +#define THREADFUNCDECL(func) void * func(void *args) +#define THREADFUNCRET(r) void * r = 0 +#define THREADJOIN(t) pthread_join(t, 0) +#define MUTEX pthread_mutex_t +#define MUTEXINIT(m) pthread_mutex_init(m, NULL) //TODO: check error +#define MUTEXLOCK(m) pthread_mutex_lock(m) +#define MUTEXTRYLOCK(m) pthread_mutex_trylock(m) +#define MUTEXUNLOCK(m) pthread_mutex_unlock(m) +#define MUTEXDESTROY(m) pthread_mutex_destroy(m) +#endif + +#ifdef MACOSX +#include +#include +#include +#include +#endif + +#define MAXARGS 10 +#define MAXARG 256 +#define MAX_SESSIONS 4 +#define OUT_INTERVAL 20 + +/* millisecond interval to time out calls */ +#define IAXC_CALL_TIMEOUT 30000 + + +void os_init(void); +void iaxci_usermsg(int type, const char *fmt, ...); +void iaxci_do_levels_callback(float input, float output); +void iaxci_do_audio_callback(int callNo, unsigned int ts, int remote, + int encoded, int format, int size, unsigned char *data); + +#include "iaxclient.h" + +struct iaxc_audio_driver { + /* data */ + char *name; /* driver name */ + struct iaxc_audio_device *devices; /* list of devices */ + int nDevices; /* count of devices */ + void *priv; /* pointer to private data */ + + /* methods */ + int (*initialize)(struct iaxc_audio_driver *d, int sample_rate); + int (*destroy)(struct iaxc_audio_driver *d); /* free resources */ + int (*select_devices)(struct iaxc_audio_driver *d, int input, int output, int ring); + int (*selected_devices)(struct iaxc_audio_driver *d, int *input, int *output, int *ring); + + /* + * select_ring ? + * set_latency + */ + + int (*start)(struct iaxc_audio_driver *d); + int (*stop)(struct iaxc_audio_driver *d); + int (*output)(struct iaxc_audio_driver *d, void *samples, int nSamples); + int (*input)(struct iaxc_audio_driver *d, void *samples, int *nSamples); + + /* levels */ + float (*input_level_get)(struct iaxc_audio_driver *d); + float (*output_level_get)(struct iaxc_audio_driver *d); + int (*input_level_set)(struct iaxc_audio_driver *d, float level); + int (*output_level_set)(struct iaxc_audio_driver *d, float level); + + /* sounds */ + int (*play_sound)(struct iaxc_sound *s, int ring); + int (*stop_sound)(int id); + + /* mic boost */ + int (*mic_boost_get)(struct iaxc_audio_driver *d ) ; + int (*mic_boost_set)(struct iaxc_audio_driver *d, int enable); +}; + +struct iaxc_audio_codec { + char name[256]; + int format; + int minimum_frame_size; + void *encstate; + void *decstate; + int (*encode) ( struct iaxc_audio_codec *codec, int *inlen, short *in, int *outlen, unsigned char *out ); + int (*decode) ( struct iaxc_audio_codec *codec, int *inlen, unsigned char *in, int *outlen, short *out ); + void (*destroy) ( struct iaxc_audio_codec *codec); +}; + +#define MAX_TRUNK_LEN (1<<16) +#define MAX_NO_SLICES 32 + +struct slice_set_t +{ + int num_slices; + int key_frame; + int size[MAX_NO_SLICES]; + char data[MAX_NO_SLICES][MAX_TRUNK_LEN]; +}; + +struct iaxc_video_codec { + char name[256]; + int format; + int width; + int height; + int framerate; + int bitrate; + int fragsize; + int params_changed; + void *encstate; + void *decstate; + struct iaxc_video_stats video_stats; + int (*encode)(struct iaxc_video_codec * codec, int inlen, + const char * in, struct slice_set_t * out); + int (*decode)(struct iaxc_video_codec * codec, int inlen, + const char * in, int * outlen, char * out); + void (*destroy)(struct iaxc_video_codec * codec); +}; + + + +struct iaxc_call { + /* to be replaced with codec-structures, with codec-private data */ + struct iaxc_audio_codec *encoder; + struct iaxc_audio_codec *decoder; + struct iaxc_video_codec *vencoder; + struct iaxc_video_codec *vdecoder; + int vformat; + + /* the "state" of this call */ + int state; + char remote[IAXC_EVENT_BUFSIZ]; + char remote_name[IAXC_EVENT_BUFSIZ]; + char local[IAXC_EVENT_BUFSIZ]; + char local_context[IAXC_EVENT_BUFSIZ]; + + /* Outbound CallerID */ + char callerid_name[IAXC_EVENT_BUFSIZ]; + char callerid_number[IAXC_EVENT_BUFSIZ]; + + /* reset whenever we receive packets from remote */ + struct timeval last_activity; + struct timeval last_ping; + + /* our negotiated format */ + int format; + + /* we've sent a silent frame since the last audio frame */ + int tx_silent; + + struct iax_session *session; +}; + +#include "audio_encode.h" + +#ifdef AUDIO_PA + #include "audio_portaudio.h" +#endif + +#include "audio_file.h" + +#include "audio_alsa.h" + +extern int iaxci_audio_output_mode; + +int iaxci_post_event_callback(iaxc_event e); + +/* post an event to the application */ +void iaxci_post_event(iaxc_event e); + +/* parameters for callback */ +extern void * post_event_handle; +extern int post_event_id; + +/* Priority boost support */ +extern int iaxci_prioboostbegin(void); +extern int iaxci_prioboostend(void); + +long iaxci_usecdiff(struct timeval *t0, struct timeval *t1); +long iaxci_msecdiff(struct timeval *t0, struct timeval *t1); + +#ifdef __cplusplus +} +#endif +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/AUTHORS b/3rdparty/iaxclient-2/lib/libiax2/AUTHORS new file mode 100644 index 0000000..e69de29 diff --git a/3rdparty/iaxclient-2/lib/libiax2/COPYING b/3rdparty/iaxclient-2/lib/libiax2/COPYING new file mode 100644 index 0000000..6757284 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/COPYING @@ -0,0 +1,416 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 675 Mass Ave, Cambridge, MA 02139, USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + + + + + + + + + + + + + + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + + + + + + + + + + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + + + + + + + + + + + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + + + + + + + + + + + + + + + + Appendix: How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) 19yy + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) 19yy name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/3rdparty/iaxclient-2/lib/libiax2/COPYING.LIB b/3rdparty/iaxclient-2/lib/libiax2/COPYING.LIB new file mode 100644 index 0000000..161a3d1 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/COPYING.LIB @@ -0,0 +1,482 @@ + GNU LIBRARY GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111-1307, 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 library GPL. It is + numbered 2 because it goes with version 2 of the ordinary GPL.] + + 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 Library General Public License, applies to some +specially designated Free Software Foundation software, and to any +other libraries whose authors decide to use it. You can use it for +your libraries, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if +you distribute copies of the 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 a program 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. + + Our method of protecting your rights has two steps: (1) copyright +the library, and (2) offer you this license which gives you legal +permission to copy, distribute and/or modify the library. + + Also, for each distributor's protection, we want to make certain +that everyone understands that there is no warranty for this free +library. If the library is modified by someone else and passed on, we +want its recipients to know that what they have is not the original +version, so that any problems introduced by others will not reflect on +the original authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that companies distributing free +software will individually obtain patent licenses, thus in effect +transforming the program into proprietary software. To prevent this, +we have made it clear that any patent must be licensed for everyone's +free use or not licensed at all. + + Most GNU software, including some libraries, is covered by the ordinary +GNU General Public License, which was designed for utility programs. This +license, the GNU Library General Public License, applies to certain +designated libraries. This license is quite different from the ordinary +one; be sure to read it in full, and don't assume that anything in it is +the same as in the ordinary license. + + The reason we have a separate public license for some libraries is that +they blur the distinction we usually make between modifying or adding to a +program and simply using it. Linking a program with a library, without +changing the library, is in some sense simply using the library, and is +analogous to running a utility program or application program. However, in +a textual and legal sense, the linked executable is a combined work, a +derivative of the original library, and the ordinary General Public License +treats it as such. + + Because of this blurred distinction, using the ordinary General +Public License for libraries did not effectively promote software +sharing, because most developers did not use the libraries. We +concluded that weaker conditions might promote sharing better. + + However, unrestricted linking of non-free programs would deprive the +users of those programs of all benefit from the free status of the +libraries themselves. This Library General Public License is intended to +permit developers of non-free programs to use free libraries, while +preserving your freedom as a user of such programs to change the free +libraries that are incorporated in them. (We have not seen how to achieve +this as regards changes in header files, but we have achieved it as regards +changes in the actual functions of the Library.) The hope is that this +will lead to faster development of free libraries. + + 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, while the latter only +works together with the library. + + Note that it is possible for a library to be covered by the ordinary +General Public License rather than by this special one. + + GNU LIBRARY GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library which +contains a notice placed by the copyright holder or other authorized +party saying it may be distributed under the terms of this Library +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 compile 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) 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. + + c) 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. + + d) 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 source code distributed need not include anything that is normally +distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + 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 to +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 Library 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 + + Appendix: 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 Library General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Library General Public License for more details. + + You should have received a copy of the GNU Library General Public + License along with this library; if not, write to the Free + Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, + MA 02111-1307, 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/3rdparty/iaxclient-2/lib/libiax2/ChangeLog b/3rdparty/iaxclient-2/lib/libiax2/ChangeLog new file mode 100644 index 0000000..311fecb --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/ChangeLog @@ -0,0 +1,21 @@ +libiax +====== + +version 0.2.3: + * Allow password to be passed in connect + +version 0.2.2 (Nov 13th, 2001): + * HTML Unlink requests + * HTML Reject link requests + * Text frames + +version 0.2.1 (Oct 20th, 2001): + * More space for challenge in IAX + * Fixed strncpy security bug + * Accept larger packets + * Handle out of order packets better + * Implemented send_url + * Added an iax-config script :-) + +version 0.2.0 (Oct 10th, 2001): + * Initial Public Release diff --git a/3rdparty/iaxclient-2/lib/libiax2/INSTALL b/3rdparty/iaxclient-2/lib/libiax2/INSTALL new file mode 100644 index 0000000..23e5f25 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/INSTALL @@ -0,0 +1,236 @@ +Installation Instructions +************************* + +Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005 Free +Software Foundation, Inc. + +This file is free documentation; the Free Software Foundation gives +unlimited permission to copy, distribute and modify it. + +Basic Installation +================== + +These are generic installation instructions. + + The `configure' shell script attempts to guess correct values for +various system-dependent variables used during compilation. It uses +those values to create a `Makefile' in each directory of the package. +It may also create one or more `.h' files containing system-dependent +definitions. Finally, it creates a shell script `config.status' that +you can run in the future to recreate the current configuration, and a +file `config.log' containing compiler output (useful mainly for +debugging `configure'). + + It can also use an optional file (typically called `config.cache' +and enabled with `--cache-file=config.cache' or simply `-C') that saves +the results of its tests to speed up reconfiguring. (Caching is +disabled by default to prevent problems with accidental use of stale +cache files.) + + If you need to do unusual things to compile the package, please try +to figure out how `configure' could check whether to do them, and mail +diffs or instructions to the address given in the `README' so they can +be considered for the next release. If you are using the cache, and at +some point `config.cache' contains results you don't want to keep, you +may remove or edit it. + + The file `configure.ac' (or `configure.in') is used to create +`configure' by a program called `autoconf'. You only need +`configure.ac' if you want to change it or regenerate `configure' using +a newer version of `autoconf'. + +The simplest way to compile this package is: + + 1. `cd' to the directory containing the package's source code and type + `./configure' to configure the package for your system. If you're + using `csh' on an old version of System V, you might need to type + `sh ./configure' instead to prevent `csh' from trying to execute + `configure' itself. + + Running `configure' takes awhile. While running, it prints some + messages telling which features it is checking for. + + 2. Type `make' to compile the package. + + 3. Optionally, type `make check' to run any self-tests that come with + the package. + + 4. Type `make install' to install the programs and any data files and + documentation. + + 5. You can remove the program binaries and object files from the + source code directory by typing `make clean'. To also remove the + files that `configure' created (so you can compile the package for + a different kind of computer), type `make distclean'. There is + also a `make maintainer-clean' target, but that is intended mainly + for the package's developers. If you use it, you may have to get + all sorts of other programs in order to regenerate files that came + with the distribution. + +Compilers and Options +===================== + +Some systems require unusual options for compilation or linking that the +`configure' script does not know about. Run `./configure --help' for +details on some of the pertinent environment variables. + + You can give `configure' initial values for configuration parameters +by setting variables in the command line or in the environment. Here +is an example: + + ./configure CC=c89 CFLAGS=-O2 LIBS=-lposix + + *Note Defining Variables::, for more details. + +Compiling For Multiple Architectures +==================================== + +You can compile the package for more than one kind of computer at the +same time, by placing the object files for each architecture in their +own directory. To do this, you must use a version of `make' that +supports the `VPATH' variable, such as GNU `make'. `cd' to the +directory where you want the object files and executables to go and run +the `configure' script. `configure' automatically checks for the +source code in the directory that `configure' is in and in `..'. + + If you have to use a `make' that does not support the `VPATH' +variable, you have to compile the package for one architecture at a +time in the source code directory. After you have installed the +package for one architecture, use `make distclean' before reconfiguring +for another architecture. + +Installation Names +================== + +By default, `make install' installs the package's commands under +`/usr/local/bin', include files under `/usr/local/include', etc. You +can specify an installation prefix other than `/usr/local' by giving +`configure' the option `--prefix=PREFIX'. + + You can specify separate installation prefixes for +architecture-specific files and architecture-independent files. If you +pass the option `--exec-prefix=PREFIX' to `configure', the package uses +PREFIX as the prefix for installing programs and libraries. +Documentation and other data files still use the regular prefix. + + In addition, if you use an unusual directory layout you can give +options like `--bindir=DIR' to specify different values for particular +kinds of files. Run `configure --help' for a list of the directories +you can set and what kinds of files go in them. + + If the package supports it, you can cause programs to be installed +with an extra prefix or suffix on their names by giving `configure' the +option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. + +Optional Features +================= + +Some packages pay attention to `--enable-FEATURE' options to +`configure', where FEATURE indicates an optional part of the package. +They may also pay attention to `--with-PACKAGE' options, where PACKAGE +is something like `gnu-as' or `x' (for the X Window System). The +`README' should mention any `--enable-' and `--with-' options that the +package recognizes. + + For packages that use the X Window System, `configure' can usually +find the X include and library files automatically, but if it doesn't, +you can use the `configure' options `--x-includes=DIR' and +`--x-libraries=DIR' to specify their locations. + +Specifying the System Type +========================== + +There may be some features `configure' cannot figure out automatically, +but needs to determine by the type of machine the package will run on. +Usually, assuming the package is built to be run on the _same_ +architectures, `configure' can figure that out, but if it prints a +message saying it cannot guess the machine type, give it the +`--build=TYPE' option. TYPE can either be a short name for the system +type, such as `sun4', or a canonical name which has the form: + + CPU-COMPANY-SYSTEM + +where SYSTEM can have one of these forms: + + OS KERNEL-OS + + See the file `config.sub' for the possible values of each field. If +`config.sub' isn't included in this package, then this package doesn't +need to know the machine type. + + If you are _building_ compiler tools for cross-compiling, you should +use the option `--target=TYPE' to select the type of system they will +produce code for. + + If you want to _use_ a cross compiler, that generates code for a +platform different from the build platform, you should specify the +"host" platform (i.e., that on which the generated programs will +eventually be run) with `--host=TYPE'. + +Sharing Defaults +================ + +If you want to set default values for `configure' scripts to share, you +can create a site shell script called `config.site' that gives default +values for variables like `CC', `cache_file', and `prefix'. +`configure' looks for `PREFIX/share/config.site' if it exists, then +`PREFIX/etc/config.site' if it exists. Or, you can set the +`CONFIG_SITE' environment variable to the location of the site script. +A warning: not all `configure' scripts look for a site script. + +Defining Variables +================== + +Variables not defined in a site shell script can be set in the +environment passed to `configure'. However, some packages may run +configure again during the build, and the customized values of these +variables may be lost. In order to avoid this problem, you should set +them in the `configure' command line, using `VAR=value'. For example: + + ./configure CC=/usr/local2/bin/gcc + +causes the specified `gcc' to be used as the C compiler (unless it is +overridden in the site shell script). Here is a another example: + + /bin/bash ./configure CONFIG_SHELL=/bin/bash + +Here the `CONFIG_SHELL=/bin/bash' operand causes subsequent +configuration-related scripts to be executed by `/bin/bash'. + +`configure' Invocation +====================== + +`configure' recognizes the following options to control how it operates. + +`--help' +`-h' + Print a summary of the options to `configure', and exit. + +`--version' +`-V' + Print the version of Autoconf used to generate the `configure' + script, and exit. + +`--cache-file=FILE' + Enable the cache: use and save the results of the tests in FILE, + traditionally `config.cache'. FILE defaults to `/dev/null' to + disable caching. + +`--config-cache' +`-C' + Alias for `--cache-file=config.cache'. + +`--quiet' +`--silent' +`-q' + Do not print messages saying which checks are being made. To + suppress all normal output, redirect it to `/dev/null' (any error + messages will still be shown). + +`--srcdir=DIR' + Look for the package's source code in directory DIR. Usually + `configure' can determine that directory automatically. + +`configure' also accepts some other, not widely useful, options. Run +`configure --help' for more details. + diff --git a/3rdparty/iaxclient-2/lib/libiax2/Makefile.am b/3rdparty/iaxclient-2/lib/libiax2/Makefile.am new file mode 100644 index 0000000..40d3da5 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/Makefile.am @@ -0,0 +1,6 @@ +SUBDIRS = src + +bin_SCRIPTS=iax-config +BUILT_SCOURCES=iax-config +EXTRA_DIST=iax.spec libiax2.vcproj +iax-config: iax-config.in diff --git a/3rdparty/iaxclient-2/lib/libiax2/NEWS b/3rdparty/iaxclient-2/lib/libiax2/NEWS new file mode 100644 index 0000000..233df64 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/NEWS @@ -0,0 +1,12 @@ +libiax +====== + +0.2.3: + +0.2.2: + +0.2.1: + +0.2.0 (Oct 10th, 2001): + Initial Release. Hooray! Rejoice! :) + diff --git a/3rdparty/iaxclient-2/lib/libiax2/README b/3rdparty/iaxclient-2/lib/libiax2/README new file mode 100644 index 0000000..72f5e9e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/README @@ -0,0 +1,4 @@ +libiax: An implementation of the Inter-Asterisk eXchange protocol distributed +under the terms of the GNU Lesser General Public License + +Written by Mark Spencer diff --git a/3rdparty/iaxclient-2/lib/libiax2/bootstrap.sh b/3rdparty/iaxclient-2/lib/libiax2/bootstrap.sh new file mode 100644 index 0000000..640caa7 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/bootstrap.sh @@ -0,0 +1,6 @@ +echo If this fails you probably need to download the latest +echo libtool,aclocal,autoconf and automake +libtoolize --force +aclocal --force +autoconf -f +automake -acf diff --git a/3rdparty/iaxclient-2/lib/libiax2/build.sh b/3rdparty/iaxclient-2/lib/libiax2/build.sh new file mode 100644 index 0000000..9dfda77 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/build.sh @@ -0,0 +1,13 @@ +echo configuring automake +./bootstrap.sh +echo configuring libiax2 +./configure --enable-newjb +echo building libiax2 +make +echo +echo +echo '##################################################################' +echo '# #' +echo '# If all is well, enter "make install" to complete installation. #' +echo '# #' +echo '##################################################################' diff --git a/3rdparty/iaxclient-2/lib/libiax2/configure.in b/3rdparty/iaxclient-2/lib/libiax2/configure.in new file mode 100644 index 0000000..24d5dc2 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/configure.in @@ -0,0 +1,40 @@ +dnl Yo Yo Yo +AC_INIT(src/iax.c) +AM_INIT_AUTOMAKE([iax], [0.2.3]) + + +dnl Check for various goodies +AC_PROG_CC +AM_PROG_LIBTOOL +dnl LIBTOOL="$LIBTOOL --silent" +AC_PROG_INSTALL + +dnl Check for libraries +dnl None available + +dnl Check header files +AC_HEADER_STDC + +AC_CHECK_FUNCS(gettimeofday) + +AC_SUBST(LIBS) + +AC_ARG_ENABLE(snomhack, [ --enable-snomhack Use slower memset for SNOM phoneem ],,enable_snomhack=no) +AC_ARG_ENABLE(extreme_debug, [ --enable-extreme-debug Compile with extreme debugging code enabled ],,enable_extreme_debug=no) +if test "$enable_snomhack" = yes ; then + AC_DEFINE(SNOM_HACK) +fi + +if test "$enable_extreme_debug" = yes ; then + AC_DEFINE(EXTREME_DEBUG) +fi + +AC_SUBST(IAX_VERSION) + +AC_OUTPUT([ +Makefile +src/Makefile +iax.spec +iax-config],[case "$CONFIG_FILES" in +*iax-config*)chmod +x iax-config;; +esac]) diff --git a/3rdparty/iaxclient-2/lib/libiax2/depcomp b/3rdparty/iaxclient-2/lib/libiax2/depcomp new file mode 100644 index 0000000..04701da --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/depcomp @@ -0,0 +1,530 @@ +#! /bin/sh +# depcomp - compile a program generating dependencies as side-effects + +scriptversion=2005-07-09.11 + +# Copyright (C) 1999, 2000, 2003, 2004, 2005 Free Software Foundation, Inc. + +# This program is free software; you can redistribute it and/or modify +# it under the terms of the GNU General Public License as published by +# the Free Software Foundation; either version 2, or (at your option) +# any later version. + +# This program is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +# GNU General Public License for more details. + +# You should have received a copy of the GNU General Public License +# along with this program; if not, write to the Free Software +# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA +# 02110-1301, USA. + +# As a special exception to the GNU General Public License, if you +# distribute this file as part of a program that contains a +# configuration script generated by Autoconf, you may include it under +# the same distribution terms that you use for the rest of that program. + +# Originally written by Alexandre Oliva . + +case $1 in + '') + echo "$0: No command. Try \`$0 --help' for more information." 1>&2 + exit 1; + ;; + -h | --h*) + cat <<\EOF +Usage: depcomp [--help] [--version] PROGRAM [ARGS] + +Run PROGRAMS ARGS to compile a file, generating dependencies +as side-effects. + +Environment variables: + depmode Dependency tracking mode. + source Source file read by `PROGRAMS ARGS'. + object Object file output by `PROGRAMS ARGS'. + DEPDIR directory where to store dependencies. + depfile Dependency file to output. + tmpdepfile Temporary file to use when outputing dependencies. + libtool Whether libtool is used (yes/no). + +Report bugs to . +EOF + exit $? + ;; + -v | --v*) + echo "depcomp $scriptversion" + exit $? + ;; +esac + +if test -z "$depmode" || test -z "$source" || test -z "$object"; then + echo "depcomp: Variables source, object and depmode must be set" 1>&2 + exit 1 +fi + +# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. +depfile=${depfile-`echo "$object" | + sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} +tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} + +rm -f "$tmpdepfile" + +# Some modes work just like other modes, but use different flags. We +# parameterize here, but still list the modes in the big case below, +# to make depend.m4 easier to write. Note that we *cannot* use a case +# here, because this file can only contain one case statement. +if test "$depmode" = hp; then + # HP compiler uses -M and no extra arg. + gccflag=-M + depmode=gcc +fi + +if test "$depmode" = dashXmstdout; then + # This is just like dashmstdout with a different argument. + dashmflag=-xM + depmode=dashmstdout +fi + +case "$depmode" in +gcc3) +## gcc 3 implements dependency tracking that does exactly what +## we want. Yay! Note: for some reason libtool 1.4 doesn't like +## it if -MD -MP comes after the -MF stuff. Hmm. + "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" + stat=$? + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile" + exit $stat + fi + mv "$tmpdepfile" "$depfile" + ;; + +gcc) +## There are various ways to get dependency output from gcc. Here's +## why we pick this rather obscure method: +## - Don't want to use -MD because we'd like the dependencies to end +## up in a subdir. Having to rename by hand is ugly. +## (We might end up doing this anyway to support other compilers.) +## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like +## -MM, not -M (despite what the docs say). +## - Using -M directly means running the compiler twice (even worse +## than renaming). + if test -z "$gccflag"; then + gccflag=-MD, + fi + "$@" -Wp,"$gccflag$tmpdepfile" + stat=$? + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile" + exit $stat + fi + rm -f "$depfile" + echo "$object : \\" > "$depfile" + alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz +## The second -e expression handles DOS-style file names with drive letters. + sed -e 's/^[^:]*: / /' \ + -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" +## This next piece of magic avoids the `deleted header file' problem. +## The problem is that when a header file which appears in a .P file +## is deleted, the dependency causes make to die (because there is +## typically no way to rebuild the header). We avoid this by adding +## dummy dependencies for each header file. Too bad gcc doesn't do +## this for us directly. + tr ' ' ' +' < "$tmpdepfile" | +## Some versions of gcc put a space before the `:'. On the theory +## that the space means something, we add a space to the output as +## well. +## Some versions of the HPUX 10.20 sed can't process this invocation +## correctly. Breaking it into two sed invocations is a workaround. + sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" + rm -f "$tmpdepfile" + ;; + +hp) + # This case exists only to let depend.m4 do its work. It works by + # looking at the text of this script. This case will never be run, + # since it is checked for above. + exit 1 + ;; + +sgi) + if test "$libtool" = yes; then + "$@" "-Wp,-MDupdate,$tmpdepfile" + else + "$@" -MDupdate "$tmpdepfile" + fi + stat=$? + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile" + exit $stat + fi + rm -f "$depfile" + + if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files + echo "$object : \\" > "$depfile" + + # Clip off the initial element (the dependent). Don't try to be + # clever and replace this with sed code, as IRIX sed won't handle + # lines with more than a fixed number of characters (4096 in + # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; + # the IRIX cc adds comments like `#:fec' to the end of the + # dependency line. + tr ' ' ' +' < "$tmpdepfile" \ + | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ + tr ' +' ' ' >> $depfile + echo >> $depfile + + # The second pass generates a dummy entry for each header file. + tr ' ' ' +' < "$tmpdepfile" \ + | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ + >> $depfile + else + # The sourcefile does not contain any dependencies, so just + # store a dummy comment line, to avoid errors with the Makefile + # "include basename.Plo" scheme. + echo "#dummy" > "$depfile" + fi + rm -f "$tmpdepfile" + ;; + +aix) + # The C for AIX Compiler uses -M and outputs the dependencies + # in a .u file. In older versions, this file always lives in the + # current directory. Also, the AIX compiler puts `$object:' at the + # start of each line; $object doesn't have directory information. + # Version 6 uses the directory in both cases. + stripped=`echo "$object" | sed 's/\(.*\)\..*$/\1/'` + tmpdepfile="$stripped.u" + if test "$libtool" = yes; then + "$@" -Wc,-M + else + "$@" -M + fi + stat=$? + + if test -f "$tmpdepfile"; then : + else + stripped=`echo "$stripped" | sed 's,^.*/,,'` + tmpdepfile="$stripped.u" + fi + + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile" + exit $stat + fi + + if test -f "$tmpdepfile"; then + outname="$stripped.o" + # Each line is of the form `foo.o: dependent.h'. + # Do two passes, one to just change these to + # `$object: dependent.h' and one to simply `dependent.h:'. + sed -e "s,^$outname:,$object :," < "$tmpdepfile" > "$depfile" + sed -e "s,^$outname: \(.*\)$,\1:," < "$tmpdepfile" >> "$depfile" + else + # The sourcefile does not contain any dependencies, so just + # store a dummy comment line, to avoid errors with the Makefile + # "include basename.Plo" scheme. + echo "#dummy" > "$depfile" + fi + rm -f "$tmpdepfile" + ;; + +icc) + # Intel's C compiler understands `-MD -MF file'. However on + # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c + # ICC 7.0 will fill foo.d with something like + # foo.o: sub/foo.c + # foo.o: sub/foo.h + # which is wrong. We want: + # sub/foo.o: sub/foo.c + # sub/foo.o: sub/foo.h + # sub/foo.c: + # sub/foo.h: + # ICC 7.1 will output + # foo.o: sub/foo.c sub/foo.h + # and will wrap long lines using \ : + # foo.o: sub/foo.c ... \ + # sub/foo.h ... \ + # ... + + "$@" -MD -MF "$tmpdepfile" + stat=$? + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile" + exit $stat + fi + rm -f "$depfile" + # Each line is of the form `foo.o: dependent.h', + # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. + # Do two passes, one to just change these to + # `$object: dependent.h' and one to simply `dependent.h:'. + sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" + # Some versions of the HPUX 10.20 sed can't process this invocation + # correctly. Breaking it into two sed invocations is a workaround. + sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | + sed -e 's/$/ :/' >> "$depfile" + rm -f "$tmpdepfile" + ;; + +tru64) + # The Tru64 compiler uses -MD to generate dependencies as a side + # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. + # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put + # dependencies in `foo.d' instead, so we check for that too. + # Subdirectories are respected. + dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` + test "x$dir" = "x$object" && dir= + base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` + + if test "$libtool" = yes; then + # With Tru64 cc, shared objects can also be used to make a + # static library. This mecanism is used in libtool 1.4 series to + # handle both shared and static libraries in a single compilation. + # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. + # + # With libtool 1.5 this exception was removed, and libtool now + # generates 2 separate objects for the 2 libraries. These two + # compilations output dependencies in in $dir.libs/$base.o.d and + # in $dir$base.o.d. We have to check for both files, because + # one of the two compilations can be disabled. We should prefer + # $dir$base.o.d over $dir.libs/$base.o.d because the latter is + # automatically cleaned when .libs/ is deleted, while ignoring + # the former would cause a distcleancheck panic. + tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 + tmpdepfile2=$dir$base.o.d # libtool 1.5 + tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 + tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 + "$@" -Wc,-MD + else + tmpdepfile1=$dir$base.o.d + tmpdepfile2=$dir$base.d + tmpdepfile3=$dir$base.d + tmpdepfile4=$dir$base.d + "$@" -MD + fi + + stat=$? + if test $stat -eq 0; then : + else + rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" + exit $stat + fi + + for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" + do + test -f "$tmpdepfile" && break + done + if test -f "$tmpdepfile"; then + sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" + # That's a tab and a space in the []. + sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" + else + echo "#dummy" > "$depfile" + fi + rm -f "$tmpdepfile" + ;; + +#nosideeffect) + # This comment above is used by automake to tell side-effect + # dependency tracking mechanisms from slower ones. + +dashmstdout) + # Important note: in order to support this mode, a compiler *must* + # always write the preprocessed file to stdout, regardless of -o. + "$@" || exit $? + + # Remove the call to Libtool. + if test "$libtool" = yes; then + while test $1 != '--mode=compile'; do + shift + done + shift + fi + + # Remove `-o $object'. + IFS=" " + for arg + do + case $arg in + -o) + shift + ;; + $object) + shift + ;; + *) + set fnord "$@" "$arg" + shift # fnord + shift # $arg + ;; + esac + done + + test -z "$dashmflag" && dashmflag=-M + # Require at least two characters before searching for `:' + # in the target name. This is to cope with DOS-style filenames: + # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. + "$@" $dashmflag | + sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" + rm -f "$depfile" + cat < "$tmpdepfile" > "$depfile" + tr ' ' ' +' < "$tmpdepfile" | \ +## Some versions of the HPUX 10.20 sed can't process this invocation +## correctly. Breaking it into two sed invocations is a workaround. + sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" + rm -f "$tmpdepfile" + ;; + +dashXmstdout) + # This case only exists to satisfy depend.m4. It is never actually + # run, as this mode is specially recognized in the preamble. + exit 1 + ;; + +makedepend) + "$@" || exit $? + # Remove any Libtool call + if test "$libtool" = yes; then + while test $1 != '--mode=compile'; do + shift + done + shift + fi + # X makedepend + shift + cleared=no + for arg in "$@"; do + case $cleared in + no) + set ""; shift + cleared=yes ;; + esac + case "$arg" in + -D*|-I*) + set fnord "$@" "$arg"; shift ;; + # Strip any option that makedepend may not understand. Remove + # the object too, otherwise makedepend will parse it as a source file. + -*|$object) + ;; + *) + set fnord "$@" "$arg"; shift ;; + esac + done + obj_suffix="`echo $object | sed 's/^.*\././'`" + touch "$tmpdepfile" + ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" + rm -f "$depfile" + cat < "$tmpdepfile" > "$depfile" + sed '1,2d' "$tmpdepfile" | tr ' ' ' +' | \ +## Some versions of the HPUX 10.20 sed can't process this invocation +## correctly. Breaking it into two sed invocations is a workaround. + sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" + rm -f "$tmpdepfile" "$tmpdepfile".bak + ;; + +cpp) + # Important note: in order to support this mode, a compiler *must* + # always write the preprocessed file to stdout. + "$@" || exit $? + + # Remove the call to Libtool. + if test "$libtool" = yes; then + while test $1 != '--mode=compile'; do + shift + done + shift + fi + + # Remove `-o $object'. + IFS=" " + for arg + do + case $arg in + -o) + shift + ;; + $object) + shift + ;; + *) + set fnord "$@" "$arg" + shift # fnord + shift # $arg + ;; + esac + done + + "$@" -E | + sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ + -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | + sed '$ s: \\$::' > "$tmpdepfile" + rm -f "$depfile" + echo "$object : \\" > "$depfile" + cat < "$tmpdepfile" >> "$depfile" + sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" + rm -f "$tmpdepfile" + ;; + +msvisualcpp) + # Important note: in order to support this mode, a compiler *must* + # always write the preprocessed file to stdout, regardless of -o, + # because we must use -o when running libtool. + "$@" || exit $? + IFS=" " + for arg + do + case "$arg" in + "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") + set fnord "$@" + shift + shift + ;; + *) + set fnord "$@" "$arg" + shift + shift + ;; + esac + done + "$@" -E | + sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile" + rm -f "$depfile" + echo "$object : \\" > "$depfile" + . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" + echo " " >> "$depfile" + . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile" + rm -f "$tmpdepfile" + ;; + +none) + exec "$@" + ;; + +*) + echo "Unknown depmode $depmode" 1>&2 + exit 1 + ;; +esac + +exit 0 + +# Local Variables: +# mode: shell-script +# sh-indentation: 2 +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "scriptversion=" +# time-stamp-format: "%:y-%02m-%02d.%02H" +# time-stamp-end: "$" +# End: diff --git a/3rdparty/iaxclient-2/lib/libiax2/gen.sh b/3rdparty/iaxclient-2/lib/libiax2/gen.sh new file mode 100644 index 0000000..08c7e93 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/gen.sh @@ -0,0 +1,20 @@ +#!/bin/sh + +# +# Run this to generate a new configure script and such :) +# +# -- Rob +# + + +(libtoolize --version) < /dev/null > /dev/null 2>&1 || { + echo; + echo "You must have libtool installed to compile libiax"; + echo; + exit; +} + +libtoolize --copy --force +aclocal +autoconf +automake diff --git a/3rdparty/iaxclient-2/lib/libiax2/iax-config.in b/3rdparty/iaxclient-2/lib/libiax2/iax-config.in new file mode 100644 index 0000000..a4e82c3 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/iax-config.in @@ -0,0 +1,74 @@ +#!/bin/sh +iax_libs="-L/usr/lib -liax" +iax_cflags="" + +prefix=@prefix@ +exec_prefix=@exec_prefix@ +exec_prefix_set=no + +usage="\ +Usage: iax-config [--prefix[=DIR]] [--exec-prefix[=DIR]] [--version] [--libs] [--cflags]" + +if test $# -eq 0; then + echo "${usage}" 1>&2 + exit 1 +fi + +while test $# -gt 0; do + case "$1" in + -*=*) optarg=`echo "$1" | sed 's/[-_a-zA-Z0-9]*=//'` ;; + *) optarg= ;; + esac + + case $1 in + --prefix=*) + prefix=$optarg + if test $exec_prefix_set = no ; then + exec_prefix=$optarg + fi + ;; + --prefix) + echo $prefix + ;; + --exec-prefix=*) + exec_prefix=$optarg + exec_prefix_set=yes + ;; + --exec-prefix) + echo $exec_prefix + ;; + --version) + echo @VERSION@ + ;; + --cflags) +# if test ${prefix}/include/iax != /usr/include/iax ; then + includes=-I${prefix}/include/iax + for i in $iax_cflags ; do + if test $i = -I${prefix}/include ; then + includes="" + fi + done +# fi + echo $includes $iax_cflags + ;; + --libs) + my_iax_libs= + libdirs=-L${exec_prefix}/lib + for i in $iax_libs ; do + if test $i != -L${exec_prefix}/lib ; then + if test -z "$my_iax_libs" ; then + my_iax_libs="$i" + else + my_iax_libs="$my_iax_libs $i" + fi + fi + done + echo $libdirs $my_iax_libs + ;; + *) + echo "${usage}" 1>&2 + exit 1 + ;; + esac + shift +done diff --git a/3rdparty/iaxclient-2/lib/libiax2/iax.spec.in b/3rdparty/iaxclient-2/lib/libiax2/iax.spec.in new file mode 100644 index 0000000..1fc057d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/iax.spec.in @@ -0,0 +1,91 @@ +%define name @PACKAGE@ +%define version @VERSION@ +%define release 1 +%define prefix /usr + +Summary: IAX (Inter Asterisk eXchange) Library +Name: %{name} +Version: %{version} +Release: %{release} +Copyright: LGPL +Group: Development/Libraries +Source: %{name}-%{version}.tar.gz +URL: http://www.linux-support.net/ +Distribution: RedHat Linux +Vendor: Linux Support Services +Packager: Rob Flynn +BuildRoot: /var/tmp/%{name}-%{version}-root + +%description +Inter Asterisk eXchange, lovingly called IAX (pronounced: eeks), is the protocol used by the Asterisk PBX +system for inter-asterisk-communication. Other applications may use libiax to communicate with each other +and other asterisk servers. IAX is a high performance, feature rich protocol unrelated +to SIP or H.323. Its single-socket design allows it to interoperate with NAT and PAT +masquerade firewalls. It supports internationalization, remote dialplans, +and voice, HTML, image, DTMF, and video content. For more information see +http://www.gnophone.com. + +%package devel +Summary: IAX (Inter Asterisk eXchange) Development Package +Group: Development/Libraries +Requires: iax + +%description devel +Inter Asterisk eXchange, lovingly called IAX (pronounced: eeks), is the protocol used by the Asterisk PBX +system for inter-asterisk-communication. Other applications may use libiax to communicate with each other +and other asterisk servers. IAX is a high performance, feature rich protocol unrelated +to SIP or H.323. Its single-socket design allows it to interoperate with NAT and PAT +masquerade firewalls. It supports internationalization, remote dialplans, +and voice, HTML, image, DTMF, and video content. For more information see +http://www.gnophone.com. + +This package contains all of the development files that you will need in order to compile IAX applications. + +%prep + +%setup + +%build +CFLAGS="$RPM_OPT_FLAGS" ./configure --prefix=%{prefix} --enable-autoupdate +make + +%install +rm -rf $RPM_BUILD_ROOT +make prefix=$RPM_BUILD_ROOT%{prefix} install-strip + +%files +%defattr(-,root,root) +%doc NEWS COPYING AUTHORS README +%{prefix}/lib + +%files devel +%defattr(-,root,root) +%{prefix}/include/iax +%{prefix}/bin/* + +%clean +rm -r $RPM_BUILD_ROOT + +%changelog +* Tue Nov 13 2001 Rob Flynn (0.2.2 release) +- HTML Unlink requests +- HTML Reject link requests +- Text frames + +* Sat Oct 20 2001 Rob Flynn (0.2.1 release) +- More space for challenge in IAX +- Fixed strncpy security bug +- Accept larger packets +- Handle out of order packets better +- Implemented send_url +- Added an iax-config script :-) + +* Wed Oct 10 2001 Rob Flynn (0.2.0 release) +- Initial public release + +%post + +%preun + +%postun + diff --git a/3rdparty/iaxclient-2/lib/libiax2/install-sh b/3rdparty/iaxclient-2/lib/libiax2/install-sh new file mode 100644 index 0000000..4d4a951 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/install-sh @@ -0,0 +1,323 @@ +#!/bin/sh +# install - install a program, script, or datafile + +scriptversion=2005-05-14.22 + +# This originates from X11R5 (mit/util/scripts/install.sh), which was +# later released in X11R6 (xc/config/util/install.sh) with the +# following copyright and license. +# +# Copyright (C) 1994 X Consortium +# +# Permission is hereby granted, free of charge, to any person obtaining a copy +# of this software and associated documentation files (the "Software"), to +# deal in the Software without restriction, including without limitation the +# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or +# sell copies of the Software, and to permit persons to whom the Software is +# furnished to do so, subject to the following conditions: +# +# The above copyright notice and this permission notice shall be included in +# all copies or substantial portions of the Software. +# +# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN +# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- +# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. +# +# Except as contained in this notice, the name of the X Consortium shall not +# be used in advertising or otherwise to promote the sale, use or other deal- +# ings in this Software without prior written authorization from the X Consor- +# tium. +# +# +# FSF changes to this file are in the public domain. +# +# Calling this script install-sh is preferred over install.sh, to prevent +# `make' implicit rules from creating a file called install from it +# when there is no Makefile. +# +# This script is compatible with the BSD install script, but was written +# from scratch. It can only install one file at a time, a restriction +# shared with many OS's install programs. + +# set DOITPROG to echo to test this script + +# Don't use :- since 4.3BSD and earlier shells don't like it. +doit="${DOITPROG-}" + +# put in absolute paths if you don't have them in your path; or use env. vars. + +mvprog="${MVPROG-mv}" +cpprog="${CPPROG-cp}" +chmodprog="${CHMODPROG-chmod}" +chownprog="${CHOWNPROG-chown}" +chgrpprog="${CHGRPPROG-chgrp}" +stripprog="${STRIPPROG-strip}" +rmprog="${RMPROG-rm}" +mkdirprog="${MKDIRPROG-mkdir}" + +chmodcmd="$chmodprog 0755" +chowncmd= +chgrpcmd= +stripcmd= +rmcmd="$rmprog -f" +mvcmd="$mvprog" +src= +dst= +dir_arg= +dstarg= +no_target_directory= + +usage="Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE + or: $0 [OPTION]... SRCFILES... DIRECTORY + or: $0 [OPTION]... -t DIRECTORY SRCFILES... + or: $0 [OPTION]... -d DIRECTORIES... + +In the 1st form, copy SRCFILE to DSTFILE. +In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. +In the 4th, create DIRECTORIES. + +Options: +-c (ignored) +-d create directories instead of installing files. +-g GROUP $chgrpprog installed files to GROUP. +-m MODE $chmodprog installed files to MODE. +-o USER $chownprog installed files to USER. +-s $stripprog installed files. +-t DIRECTORY install into DIRECTORY. +-T report an error if DSTFILE is a directory. +--help display this help and exit. +--version display version info and exit. + +Environment variables override the default commands: + CHGRPPROG CHMODPROG CHOWNPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG +" + +while test -n "$1"; do + case $1 in + -c) shift + continue;; + + -d) dir_arg=true + shift + continue;; + + -g) chgrpcmd="$chgrpprog $2" + shift + shift + continue;; + + --help) echo "$usage"; exit $?;; + + -m) chmodcmd="$chmodprog $2" + shift + shift + continue;; + + -o) chowncmd="$chownprog $2" + shift + shift + continue;; + + -s) stripcmd=$stripprog + shift + continue;; + + -t) dstarg=$2 + shift + shift + continue;; + + -T) no_target_directory=true + shift + continue;; + + --version) echo "$0 $scriptversion"; exit $?;; + + *) # When -d is used, all remaining arguments are directories to create. + # When -t is used, the destination is already specified. + test -n "$dir_arg$dstarg" && break + # Otherwise, the last argument is the destination. Remove it from $@. + for arg + do + if test -n "$dstarg"; then + # $@ is not empty: it contains at least $arg. + set fnord "$@" "$dstarg" + shift # fnord + fi + shift # arg + dstarg=$arg + done + break;; + esac +done + +if test -z "$1"; then + if test -z "$dir_arg"; then + echo "$0: no input file specified." >&2 + exit 1 + fi + # It's OK to call `install-sh -d' without argument. + # This can happen when creating conditional directories. + exit 0 +fi + +for src +do + # Protect names starting with `-'. + case $src in + -*) src=./$src ;; + esac + + if test -n "$dir_arg"; then + dst=$src + src= + + if test -d "$dst"; then + mkdircmd=: + chmodcmd= + else + mkdircmd=$mkdirprog + fi + else + # Waiting for this to be detected by the "$cpprog $src $dsttmp" command + # might cause directories to be created, which would be especially bad + # if $src (and thus $dsttmp) contains '*'. + if test ! -f "$src" && test ! -d "$src"; then + echo "$0: $src does not exist." >&2 + exit 1 + fi + + if test -z "$dstarg"; then + echo "$0: no destination specified." >&2 + exit 1 + fi + + dst=$dstarg + # Protect names starting with `-'. + case $dst in + -*) dst=./$dst ;; + esac + + # If destination is a directory, append the input filename; won't work + # if double slashes aren't ignored. + if test -d "$dst"; then + if test -n "$no_target_directory"; then + echo "$0: $dstarg: Is a directory" >&2 + exit 1 + fi + dst=$dst/`basename "$src"` + fi + fi + + # This sed command emulates the dirname command. + dstdir=`echo "$dst" | sed -e 's,/*$,,;s,[^/]*$,,;s,/*$,,;s,^$,.,'` + + # Make sure that the destination directory exists. + + # Skip lots of stat calls in the usual case. + if test ! -d "$dstdir"; then + defaultIFS=' + ' + IFS="${IFS-$defaultIFS}" + + oIFS=$IFS + # Some sh's can't handle IFS=/ for some reason. + IFS='%' + set x `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'` + shift + IFS=$oIFS + + pathcomp= + + while test $# -ne 0 ; do + pathcomp=$pathcomp$1 + shift + if test ! -d "$pathcomp"; then + $mkdirprog "$pathcomp" + # mkdir can fail with a `File exist' error in case several + # install-sh are creating the directory concurrently. This + # is OK. + test -d "$pathcomp" || exit + fi + pathcomp=$pathcomp/ + done + fi + + if test -n "$dir_arg"; then + $doit $mkdircmd "$dst" \ + && { test -z "$chowncmd" || $doit $chowncmd "$dst"; } \ + && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } \ + && { test -z "$stripcmd" || $doit $stripcmd "$dst"; } \ + && { test -z "$chmodcmd" || $doit $chmodcmd "$dst"; } + + else + dstfile=`basename "$dst"` + + # Make a couple of temp file names in the proper directory. + dsttmp=$dstdir/_inst.$$_ + rmtmp=$dstdir/_rm.$$_ + + # Trap to clean up those temp files at exit. + trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 + trap '(exit $?); exit' 1 2 13 15 + + # Copy the file name to the temp name. + $doit $cpprog "$src" "$dsttmp" && + + # and set any options; do chmod last to preserve setuid bits. + # + # If any of these fail, we abort the whole thing. If we want to + # ignore errors from any of these, just make sure not to ignore + # errors from the above "$doit $cpprog $src $dsttmp" command. + # + { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } \ + && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } \ + && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } \ + && { test -z "$chmodcmd" || $doit $chmodcmd "$dsttmp"; } && + + # Now rename the file to the real destination. + { $doit $mvcmd -f "$dsttmp" "$dstdir/$dstfile" 2>/dev/null \ + || { + # The rename failed, perhaps because mv can't rename something else + # to itself, or perhaps because mv is so ancient that it does not + # support -f. + + # Now remove or move aside any old file at destination location. + # We try this two ways since rm can't unlink itself on some + # systems and the destination file might be busy for other + # reasons. In this case, the final cleanup might fail but the new + # file should still install successfully. + { + if test -f "$dstdir/$dstfile"; then + $doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null \ + || $doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null \ + || { + echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2 + (exit 1); exit 1 + } + else + : + fi + } && + + # Now rename the file to the real destination. + $doit $mvcmd "$dsttmp" "$dstdir/$dstfile" + } + } + fi || { (exit 1); exit 1; } +done + +# The final little trick to "correctly" pass the exit status to the exit trap. +{ + (exit 0); exit 0 +} + +# Local variables: +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "scriptversion=" +# time-stamp-format: "%:y-%02m-%02d.%02H" +# time-stamp-end: "$" +# End: diff --git a/3rdparty/iaxclient-2/lib/libiax2/libiax2.vcproj b/3rdparty/iaxclient-2/lib/libiax2/libiax2.vcproj new file mode 100644 index 0000000..1c14f6d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/libiax2.vcproj @@ -0,0 +1,242 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/libiax2/missing b/3rdparty/iaxclient-2/lib/libiax2/missing new file mode 100644 index 0000000..894e786 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/missing @@ -0,0 +1,360 @@ +#! /bin/sh +# Common stub for a few missing GNU programs while installing. + +scriptversion=2005-06-08.21 + +# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005 +# Free Software Foundation, Inc. +# Originally by Fran,cois Pinard , 1996. + +# This program is free software; you can redistribute it and/or modify +# it under the terms of the GNU General Public License as published by +# the Free Software Foundation; either version 2, or (at your option) +# any later version. + +# This program is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +# GNU General Public License for more details. + +# You should have received a copy of the GNU General Public License +# along with this program; if not, write to the Free Software +# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA +# 02110-1301, USA. + +# As a special exception to the GNU General Public License, if you +# distribute this file as part of a program that contains a +# configuration script generated by Autoconf, you may include it under +# the same distribution terms that you use for the rest of that program. + +if test $# -eq 0; then + echo 1>&2 "Try \`$0 --help' for more information" + exit 1 +fi + +run=: + +# In the cases where this matters, `missing' is being run in the +# srcdir already. +if test -f configure.ac; then + configure_ac=configure.ac +else + configure_ac=configure.in +fi + +msg="missing on your system" + +case "$1" in +--run) + # Try to run requested program, and just exit if it succeeds. + run= + shift + "$@" && exit 0 + # Exit code 63 means version mismatch. This often happens + # when the user try to use an ancient version of a tool on + # a file that requires a minimum version. In this case we + # we should proceed has if the program had been absent, or + # if --run hadn't been passed. + if test $? = 63; then + run=: + msg="probably too old" + fi + ;; + + -h|--h|--he|--hel|--help) + echo "\ +$0 [OPTION]... PROGRAM [ARGUMENT]... + +Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an +error status if there is no known handling for PROGRAM. + +Options: + -h, --help display this help and exit + -v, --version output version information and exit + --run try to run the given command, and emulate it if it fails + +Supported PROGRAM values: + aclocal touch file \`aclocal.m4' + autoconf touch file \`configure' + autoheader touch file \`config.h.in' + automake touch all \`Makefile.in' files + bison create \`y.tab.[ch]', if possible, from existing .[ch] + flex create \`lex.yy.c', if possible, from existing .c + help2man touch the output file + lex create \`lex.yy.c', if possible, from existing .c + makeinfo touch the output file + tar try tar, gnutar, gtar, then tar without non-portable flags + yacc create \`y.tab.[ch]', if possible, from existing .[ch] + +Send bug reports to ." + exit $? + ;; + + -v|--v|--ve|--ver|--vers|--versi|--versio|--version) + echo "missing $scriptversion (GNU Automake)" + exit $? + ;; + + -*) + echo 1>&2 "$0: Unknown \`$1' option" + echo 1>&2 "Try \`$0 --help' for more information" + exit 1 + ;; + +esac + +# Now exit if we have it, but it failed. Also exit now if we +# don't have it and --version was passed (most likely to detect +# the program). +case "$1" in + lex|yacc) + # Not GNU programs, they don't have --version. + ;; + + tar) + if test -n "$run"; then + echo 1>&2 "ERROR: \`tar' requires --run" + exit 1 + elif test "x$2" = "x--version" || test "x$2" = "x--help"; then + exit 1 + fi + ;; + + *) + if test -z "$run" && ($1 --version) > /dev/null 2>&1; then + # We have it, but it failed. + exit 1 + elif test "x$2" = "x--version" || test "x$2" = "x--help"; then + # Could not run --version or --help. This is probably someone + # running `$TOOL --version' or `$TOOL --help' to check whether + # $TOOL exists and not knowing $TOOL uses missing. + exit 1 + fi + ;; +esac + +# If it does not exist, or fails to run (possibly an outdated version), +# try to emulate it. +case "$1" in + aclocal*) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified \`acinclude.m4' or \`${configure_ac}'. You might want + to install the \`Automake' and \`Perl' packages. Grab them from + any GNU archive site." + touch aclocal.m4 + ;; + + autoconf) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified \`${configure_ac}'. You might want to install the + \`Autoconf' and \`GNU m4' packages. Grab them from any GNU + archive site." + touch configure + ;; + + autoheader) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified \`acconfig.h' or \`${configure_ac}'. You might want + to install the \`Autoconf' and \`GNU m4' packages. Grab them + from any GNU archive site." + files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` + test -z "$files" && files="config.h" + touch_files= + for f in $files; do + case "$f" in + *:*) touch_files="$touch_files "`echo "$f" | + sed -e 's/^[^:]*://' -e 's/:.*//'`;; + *) touch_files="$touch_files $f.in";; + esac + done + touch $touch_files + ;; + + automake*) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. + You might want to install the \`Automake' and \`Perl' packages. + Grab them from any GNU archive site." + find . -type f -name Makefile.am -print | + sed 's/\.am$/.in/' | + while read f; do touch "$f"; done + ;; + + autom4te) + echo 1>&2 "\ +WARNING: \`$1' is needed, but is $msg. + You might have modified some files without having the + proper tools for further handling them. + You can get \`$1' as part of \`Autoconf' from any GNU + archive site." + + file=`echo "$*" | sed -n 's/.*--output[ =]*\([^ ]*\).*/\1/p'` + test -z "$file" && file=`echo "$*" | sed -n 's/.*-o[ ]*\([^ ]*\).*/\1/p'` + if test -f "$file"; then + touch $file + else + test -z "$file" || exec >$file + echo "#! /bin/sh" + echo "# Created by GNU Automake missing as a replacement of" + echo "# $ $@" + echo "exit 0" + chmod +x $file + exit 1 + fi + ;; + + bison|yacc) + echo 1>&2 "\ +WARNING: \`$1' $msg. You should only need it if + you modified a \`.y' file. You may need the \`Bison' package + in order for those modifications to take effect. You can get + \`Bison' from any GNU archive site." + rm -f y.tab.c y.tab.h + if [ $# -ne 1 ]; then + eval LASTARG="\${$#}" + case "$LASTARG" in + *.y) + SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` + if [ -f "$SRCFILE" ]; then + cp "$SRCFILE" y.tab.c + fi + SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` + if [ -f "$SRCFILE" ]; then + cp "$SRCFILE" y.tab.h + fi + ;; + esac + fi + if [ ! -f y.tab.h ]; then + echo >y.tab.h + fi + if [ ! -f y.tab.c ]; then + echo 'main() { return 0; }' >y.tab.c + fi + ;; + + lex|flex) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified a \`.l' file. You may need the \`Flex' package + in order for those modifications to take effect. You can get + \`Flex' from any GNU archive site." + rm -f lex.yy.c + if [ $# -ne 1 ]; then + eval LASTARG="\${$#}" + case "$LASTARG" in + *.l) + SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` + if [ -f "$SRCFILE" ]; then + cp "$SRCFILE" lex.yy.c + fi + ;; + esac + fi + if [ ! -f lex.yy.c ]; then + echo 'main() { return 0; }' >lex.yy.c + fi + ;; + + help2man) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified a dependency of a manual page. You may need the + \`Help2man' package in order for those modifications to take + effect. You can get \`Help2man' from any GNU archive site." + + file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` + if test -z "$file"; then + file=`echo "$*" | sed -n 's/.*--output=\([^ ]*\).*/\1/p'` + fi + if [ -f "$file" ]; then + touch $file + else + test -z "$file" || exec >$file + echo ".ab help2man is required to generate this page" + exit 1 + fi + ;; + + makeinfo) + echo 1>&2 "\ +WARNING: \`$1' is $msg. You should only need it if + you modified a \`.texi' or \`.texinfo' file, or any other file + indirectly affecting the aspect of the manual. The spurious + call might also be the consequence of using a buggy \`make' (AIX, + DU, IRIX). You might want to install the \`Texinfo' package or + the \`GNU make' package. Grab either from any GNU archive site." + # The file to touch is that specified with -o ... + file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` + if test -z "$file"; then + # ... or it is the one specified with @setfilename ... + infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` + file=`sed -n '/^@setfilename/ { s/.* \([^ ]*\) *$/\1/; p; q; }' $infile` + # ... or it is derived from the source name (dir/f.texi becomes f.info) + test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info + fi + # If the file does not exist, the user really needs makeinfo; + # let's fail without touching anything. + test -f $file || exit 1 + touch $file + ;; + + tar) + shift + + # We have already tried tar in the generic part. + # Look for gnutar/gtar before invocation to avoid ugly error + # messages. + if (gnutar --version > /dev/null 2>&1); then + gnutar "$@" && exit 0 + fi + if (gtar --version > /dev/null 2>&1); then + gtar "$@" && exit 0 + fi + firstarg="$1" + if shift; then + case "$firstarg" in + *o*) + firstarg=`echo "$firstarg" | sed s/o//` + tar "$firstarg" "$@" && exit 0 + ;; + esac + case "$firstarg" in + *h*) + firstarg=`echo "$firstarg" | sed s/h//` + tar "$firstarg" "$@" && exit 0 + ;; + esac + fi + + echo 1>&2 "\ +WARNING: I can't seem to be able to run \`tar' with the given arguments. + You may want to install GNU tar or Free paxutils, or check the + command line arguments." + exit 1 + ;; + + *) + echo 1>&2 "\ +WARNING: \`$1' is needed, and is $msg. + You might have modified some files without having the + proper tools for further handling them. Check the \`README' file, + it often tells you about the needed prerequisites for installing + this package. You may also peek at any GNU archive site, in case + some other package would contain this missing \`$1' program." + exit 1 + ;; +esac + +exit 0 + +# Local variables: +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "scriptversion=" +# time-stamp-format: "%:y-%02m-%02d.%02H" +# time-stamp-end: "$" +# End: diff --git a/3rdparty/iaxclient-2/lib/libiax2/mkinstalldirs b/3rdparty/iaxclient-2/lib/libiax2/mkinstalldirs new file mode 100644 index 0000000..259dbfc --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/mkinstalldirs @@ -0,0 +1,158 @@ +#! /bin/sh +# mkinstalldirs --- make directory hierarchy + +scriptversion=2005-06-29.22 + +# Original author: Noah Friedman +# Created: 1993-05-16 +# Public domain. +# +# This file is maintained in Automake, please report +# bugs to or send patches to +# . + +errstatus=0 +dirmode= + +usage="\ +Usage: mkinstalldirs [-h] [--help] [--version] [-m MODE] DIR ... + +Create each directory DIR (with mode MODE, if specified), including all +leading file name components. + +Report bugs to ." + +# process command line arguments +while test $# -gt 0 ; do + case $1 in + -h | --help | --h*) # -h for help + echo "$usage" + exit $? + ;; + -m) # -m PERM arg + shift + test $# -eq 0 && { echo "$usage" 1>&2; exit 1; } + dirmode=$1 + shift + ;; + --version) + echo "$0 $scriptversion" + exit $? + ;; + --) # stop option processing + shift + break + ;; + -*) # unknown option + echo "$usage" 1>&2 + exit 1 + ;; + *) # first non-opt arg + break + ;; + esac +done + +for file +do + if test -d "$file"; then + shift + else + break + fi +done + +case $# in + 0) exit 0 ;; +esac + +# Solaris 8's mkdir -p isn't thread-safe. If you mkdir -p a/b and +# mkdir -p a/c at the same time, both will detect that a is missing, +# one will create a, then the other will try to create a and die with +# a "File exists" error. This is a problem when calling mkinstalldirs +# from a parallel make. We use --version in the probe to restrict +# ourselves to GNU mkdir, which is thread-safe. +case $dirmode in + '') + if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then + echo "mkdir -p -- $*" + exec mkdir -p -- "$@" + else + # On NextStep and OpenStep, the `mkdir' command does not + # recognize any option. It will interpret all options as + # directories to create, and then abort because `.' already + # exists. + test -d ./-p && rmdir ./-p + test -d ./--version && rmdir ./--version + fi + ;; + *) + if mkdir -m "$dirmode" -p --version . >/dev/null 2>&1 && + test ! -d ./--version; then + echo "mkdir -m $dirmode -p -- $*" + exec mkdir -m "$dirmode" -p -- "$@" + else + # Clean up after NextStep and OpenStep mkdir. + for d in ./-m ./-p ./--version "./$dirmode"; + do + test -d $d && rmdir $d + done + fi + ;; +esac + +for file +do + case $file in + /*) pathcomp=/ ;; + *) pathcomp= ;; + esac + oIFS=$IFS + IFS=/ + set fnord $file + shift + IFS=$oIFS + + for d + do + test "x$d" = x && continue + + pathcomp=$pathcomp$d + case $pathcomp in + -*) pathcomp=./$pathcomp ;; + esac + + if test ! -d "$pathcomp"; then + echo "mkdir $pathcomp" + + mkdir "$pathcomp" || lasterr=$? + + if test ! -d "$pathcomp"; then + errstatus=$lasterr + else + if test ! -z "$dirmode"; then + echo "chmod $dirmode $pathcomp" + lasterr= + chmod "$dirmode" "$pathcomp" || lasterr=$? + + if test ! -z "$lasterr"; then + errstatus=$lasterr + fi + fi + fi + fi + + pathcomp=$pathcomp/ + done +done + +exit $errstatus + +# Local Variables: +# mode: shell-script +# sh-indentation: 2 +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "scriptversion=" +# time-stamp-format: "%:y-%02m-%02d.%02H" +# time-stamp-end: "$" +# End: diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/Makefile.am b/3rdparty/iaxclient-2/lib/libiax2/src/Makefile.am new file mode 100644 index 0000000..ac02c62 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/Makefile.am @@ -0,0 +1,22 @@ +AM_CFLAGS = -Wall -O2 +AM_CFLAGS += -g -Wall -Wstrict-prototypes -I . +AM_CFLAGS += -DDEBUG_SUPPORT -DLIBIAX +AM_CFLAGS += -fsigned-char +# -DDEBUG_DEFAULT +AM_CFLAGS += $(UCFLAGS) + + +pkgdir = $(libdir) +pkg_LTLIBRARIES=libiax.la +libiax_la_SOURCES = iax2-parser.c iax.c md5.c jitterbuf.c +EXTRA_DIST = md5.h frame.h iax-client.h iax2.h iax2-parser.h jitterbuf.h + +install-data-local: + mkdir -p $(includedir)/iax + install -m 644 md5.h $(includedir)/iax + install -m 644 frame.h $(includedir)/iax + install -m 644 iax.h $(includedir)/iax + install -m 644 iax2.h $(includedir)/iax + install -m 644 iax2-parser.h $(includedir)/iax + install -m 644 iax-client.h $(includedir)/iax + diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/answer.h b/3rdparty/iaxclient-2/lib/libiax2/src/answer.h new file mode 100644 index 0000000..2a03420 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/answer.h @@ -0,0 +1,237 @@ +/* + * Signed 16-bit audio data + * + * Source: answer.raw + * + * Copyright (C) 1999, Mark Spencer and Linux Support Services + * + * Distributed under the terms of the GNU General Public License + * + */ + +static signed short answer[] = { +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 0x19b7, 0x0245, 0xeee5, 0xb875, 0xd9a4, 0x6018, 0x660a, 0xc3c6, +0x8741, 0xff55, 0x4c2e, 0x2146, 0xfed2, 0xf079, 0xcbd4, 0xe561, 0x3c41, 0x3166, +0xd425, 0xdc59, 0x2748, 0x087d, 0xc72b, 0xfe3a, 0x4681, 0x14c6, 0xcf45, 0xdd38, +0xf8dd, 0x0a39, 0x3a5a, 0x32b9, 0xbfec, 0x957f, 0x15a3, 0x70f4, 0x1d95, 0xbfc4, +0xd367, 0xfda0, 0x0dc0, 0x29eb, 0x1fc2, 0xd684, 0xcab1, 0x19c7, 0x29ef, 0xe679, +0xe9d0, 0x2b82, 0x151a, 0xca9f, 0xdb68, 0x1f4a, 0x271c, 0x0e2a, 0xfb32, 0xd1b2, +0xc8ff, 0x2382, 0x6380, 0x0a52, 0xa118, 0xccbf, 0x2ddc, 0x33fd, 0x0964, 0xf2a4, +0xdd81, 0xe092, 0x1a00, 0x325c, 0xf5e3, 0xd6a1, 0x0b6c, 0x1c75, 0xe4f8, 0xe07c, +0x2082, 0x2b3e, 0xf445, 0xdaa9, 0xea13, 0xff3c, 0x245c, 0x35c1, 0xf308, 0xab53, +0xdf59, 0x4698, 0x3f3b, 0xe7f7, 0xca84, 0xed4d, 0x0c3f, 0x1e94, 0x1c2d, 0xf06f, +0xd4df, 0xff34, 0x23d8, 0x001e, 0xe3f1, 0x0b15, 0x2113, 0xf3fd, 0xd768, 0xf9a0, +0x1d31, 0x1c6e, 0x0797, 0xe3a0, 0xce6c, 0xfd7b, 0x422a, 0x2c4c, 0xd364, 0xbf42, +0x0278, 0x303e, 0x1c51, 0xf737, 0xe25a, 0xe75f, 0x0a8f, 0x22ab, 0x05f4, 0xe3f9, +0xf8c4, 0x1705, 0x0162, 0xe49f, 0xfb8b, 0x1e2b, 0x13ac, 0xf044, 0xe07b, 0xf01a, +0x1567, 0x2cbf, 0x0b75, 0xd01b, 0xd206, 0x1563, 0x38d7, 0x0f2e, 0xdb32, 0xdc30, +0x023b, 0x1e44, 0x16eb, 0xf5f7, 0xe425, 0xfa33, 0x14d5, 0x0968, 0xeff2, 0xf762, +0x1137, 0x0e59, 0xf13a, 0xe651, 0xff41, 0x1d60, 0x18fd, 0xf1e6, 0xd75f, 0xf097, +0x20ec, 0x27fa, 0xfba4, 0xd5b8, 0xe68e, 0x1657, 0x2518, 0x04f6, 0xe5a3, 0xe976, +0x0578, 0x18fa, 0x0a92, 0xec0a, 0xef2a, 0x111f, 0x12f4, 0xeec3, 0xe95e, 0x0d3a, +0x18fd, 0xff72, 0xeefc, 0xf114, 0xfaaa, 0x14ee, 0x21db, 0xf56e, 0xcb49, 0xf621, +0x3323, 0x1947, 0xe017, 0xe7e9, 0x0819, 0x0707, 0x084c, 0x0f57, 0xf152, 0xdf92, +0x104a, 0x28eb, 0xedcc, 0xd4ad, 0x1415, 0x296d, 0xed9a, 0xdf57, 0x0cc2, 0x0d95, +0xf7b5, 0x0deb, 0x0b34, 0xd713, 0xea08, 0x38d6, 0x216d, 0xc727, 0xdc32, 0x2cd2, +0x1822, 0xe2d5, 0xfeb3, 0x106c, 0xe6e5, 0xf81e, 0x2fe8, 0x01af, 0xc180, 0x037a, +0x42d8, 0xf88d, 0xc344, 0x0a4f, 0x2c4e, 0xf19d, 0xebeb, 0x162c, 0xf9e9, 0xde93, +0x1b56, 0x2c60, 0xd8aa, 0xce3e, 0x2a41, 0x2eeb, 0xdab1, 0xde32, 0x1c32, 0x0aba, +0xeabe, 0x1008, 0x136d, 0xda2f, 0xec3b, 0x31dd, 0x1130, 0xca79, 0xf5b8, 0x3423, +0x0274, 0xd27d, 0x035e, 0x1e68, 0xf641, 0xf904, 0x1691, 0xef7d, 0xd57a, 0x1c3b, +0x3c23, 0xe881, 0xc274, 0x0af5, 0x2962, 0xfa34, 0xf676, 0x0f71, 0xefcc, 0xe01f, +0x19e7, 0x276f, 0xe694, 0xe134, 0x1c3a, 0x0e8b, 0xd8e7, 0xfa81, 0x2f8b, 0x07c5, +0xd904, 0xf6fa, 0x0ca5, 0xf9a2, 0x0dc7, 0x2623, 0xec54, 0xbe23, 0x02b6, 0x4296, +0x10cd, 0xda61, 0xf11c, 0x0103, 0xf41c, 0x10b4, 0x2a03, 0xf63c, 0xce1a, 0xfdbd, +0x1fb4, 0xfc51, 0xf727, 0x1c8a, 0x04ff, 0xcf41, 0xec05, 0x2913, 0x1ce8, 0xf70c, +0xf744, 0xede8, 0xdd77, 0x0d99, 0x43f1, 0x119c, 0xc14f, 0xd60e, 0x17cb, 0x1e19, +0x0d4e, 0x0c95, 0xeed1, 0xcdf4, 0xf7a5, 0x331f, 0x1cd0, 0xeb17, 0xf082, 0xfb19, +0xe899, 0xfdeb, 0x323c, 0x2036, 0xdad3, 0xd134, 0xfd03, 0x1345, 0x1c10, 0x2239, +0xf656, 0xbc22, 0xdc3f, 0x3392, 0x3d59, 0xfd77, 0xdb4d, 0xe23f, 0xedbe, 0x0f7e, +0x35cc, 0x1947, 0xd5dc, 0xd1bf, 0x035d, 0x16fc, 0x1174, 0x1675, 0x0249, 0xd2d4, +0xd851, 0x184d, 0x32fe, 0x0f91, 0xee14, 0xe1e6, 0xdf9b, 0x016b, 0x3668, 0x2b2b, +0xe20c, 0xc554, 0xf257, 0x1c05, 0x1fc5, 0x14f0, 0xf891, 0xd41c, 0xdf83, 0x1865, +0x2de1, 0x0b16, 0xed58, 0xea0c, 0xea79, 0xfbd9, 0x22af, 0x2732, 0xf62f, 0xd389, +0xe7d9, 0x0b39, 0x1cdc, 0x1de3, 0x038a, 0xd809, 0xd5f7, 0x0b55, 0x305e, 0x1910, +0xf02e, 0xe089, 0xe7c7, 0x0195, 0x2265, 0x21da, 0xf743, 0xd8f2, 0xe978, 0x09a1, +0x190a, 0x17c5, 0x045a, 0xe46d, 0xdd06, 0xffb2, 0x2293, 0x1cfe, 0xfd4d, 0xe4f9, +0xe310, 0xfaf1, 0x1d22, 0x2376, 0x0113, 0xde3a, 0xe21b, 0x0204, 0x1ba1, 0x1bd6, +0x0333, 0xe563, 0xe104, 0xfd51, 0x1bc1, 0x1ccf, 0x0285, 0xe757, 0xe35e, 0xfaf2, +0x185d, 0x1d46, 0x06b7, 0xec13, 0xe108, 0xef6e, 0x121d, 0x2a17, 0x16a6, 0xe32c, +0xc9a9, 0xf070, 0x2f48, 0x3788, 0xfa4e, 0xc32a, 0xd9c2, 0x1fa1, 0x36fe, 0x07fa, +0xd9e4, 0xe577, 0x0e5e, 0x1755, 0xfb53, 0xed71, 0x0540, 0x19e0, 0x0301, 0xdc97, +0xe391, 0x1937, 0x367c, 0x0bc9, 0xca4c, 0xc96b, 0x105d, 0x461f, 0x2416, 0xd481, +0xbc97, 0xf8b7, 0x39af, 0x2ec9, 0xecc6, 0xcb50, 0xeee3, 0x1ffe, 0x1e8e, 0xf700, +0xe66a, 0xff58, 0x149f, 0x02e5, 0xe792, 0xf2d8, 0x1a4d, 0x225a, 0xf642, 0xce7f, +0xe6a6, 0x25e2, 0x38f5, 0x01d0, 0xc50f, 0xd243, 0x19bd, 0x3fc6, 0x14f0, 0xd2d7, +0xcdb6, 0x069a, 0x2ffe, 0x1847, 0xe6f8, 0xdf0a, 0x0337, 0x1a90, 0x067a, 0xeb5b, +0xf541, 0x143b, 0x14f2, 0xf092, 0xdc02, 0xfb91, 0x28a3, 0x2274, 0xeaa8, 0xc9e7, +0xef48, 0x2d01, 0x322e, 0xf6d2, 0xc7cb, 0xe13b, 0x1fda, 0x3217, 0x0458, 0xd690, +0xe2bf, 0x11c4, 0x21d5, 0x0291, 0xe5c8, 0xf3a9, 0x12ba, 0x11aa, 0xf22b, 0xe627, +0x03ec, 0x219a, 0x1036, 0xe2f2, 0xd93f, 0x059c, 0x2ed6, 0x1b75, 0xe227, 0xce55, +0xfb19, 0x2de0, 0x2477, 0xed08, 0xd148, 0xf307, 0x21d4, 0x2002, 0xf543, 0xdeac, +0xf7f9, 0x18a9, 0x11d6, 0xf0ef, 0xe8e4, 0x05ea, 0x1ba5, 0x0727, 0xe448, 0xe748, +0x100e, 0x265e, 0x07fc, 0xdbae, 0xde78, 0x0efa, 0x2ce0, 0x0f94, 0xddf1, 0xd9ea, +0x0797, 0x28f6, 0x12eb, 0xe60c, 0xdf46, 0x0469, 0x1fbb, 0x0ced, 0xe9f6, 0xe95f, +0x09fe, 0x1ab9, 0x02cb, 0xe5a4, 0xef2a, 0x1327, 0x1d7b, 0xfd07, 0xde3d, 0xed9c, +0x17e5, 0x22e7, 0xfe3a, 0xdb38, 0xe9b9, 0x161a, 0x2416, 0x0175, 0xde3d, 0xe9de, +0x1294, 0x1fc9, 0x00ea, 0xe2a7, 0xeee2, 0x1298, 0x1a7d, 0xfc1d, 0xe3bb, 0xf47a, +0x1642, 0x185e, 0xf727, 0xe1af, 0xf709, 0x19c3, 0x18e7, 0xf50d, 0xe010, 0xf75b, +0x1a9c, 0x18d8, 0xf4c5, 0xe0c9, 0xf865, 0x1a1c, 0x16d5, 0xf3a6, 0xe257, 0xfaf2, +0x1a44, 0x14d5, 0xf34f, 0xe4b6, 0xfc77, 0x17d5, 0x0ff8, 0xf133, 0xe8b7, 0x0344, +0x1a37, 0x0ad5, 0xe95e, 0xe61a, 0x08a5, 0x227e, 0x0e33, 0xe4a7, 0xdd70, 0x03b0, +0x25f4, 0x17b2, 0xec0a, 0xdb4e, 0xf898, 0x1ba3, 0x18f6, 0xf973, 0xe87f, 0xf77a, +0x0b93, 0x096c, 0xfb0e, 0xfb03, 0x0896, 0x0940, 0xf51d, 0xe904, 0xfdc7, 0x1dda, +0x1bf9, 0xf29b, 0xd37f, 0xea1b, 0x1f37, 0x3175, 0x07eb, 0xd3f7, 0xd46b, 0x077d, +0x2eeb, 0x1e67, 0xeeae, 0xd8c7, 0xef85, 0x1119, 0x18d3, 0x088e, 0xf953, 0xf5ad, +0xf556, 0xf63d, 0x0234, 0x167a, 0x19a1, 0xfbf9, 0xd873, 0xdd4b, 0x0f06, 0x3748, +0x21e6, 0xe181, 0xc032, 0xe79a, 0x2bec, 0x3e76, 0x0b1b, 0xce41, 0xcb23, 0xff96, +0x2d79, 0x26d1, 0xfcc7, 0xdf8a, 0xe525, 0xfd83, 0x10f1, 0x16d7, 0x0f50, 0xfaea, +0xe3f1, 0xe20f, 0x0158, 0x27d9, 0x2866, 0xf96f, 0xcb34, 0xd563, 0x11d6, 0x3d25, +0x2424, 0xe254, 0xc2c9, 0xe7cd, 0x248d, 0x34f5, 0x0c42, 0xdcd0, 0xd827, 0xfa65, +0x19eb, 0x1b50, 0x0721, 0xf396, 0xeb9c, 0xefde, 0x0016, 0x1594, 0x1cc1, 0x0658, +0xe22b, 0xd852, 0xfb3e, 0x2923, 0x2c78, 0xfc87, 0xcdb5, 0xd69c, 0x0e3c, 0x3527, +0x201f, 0xe993, 0xcf9e, 0xeb21, 0x183f, 0x25ea, 0x0c93, 0xed4d, 0xe5f9, 0xf548, +0x07fb, 0x117c, 0x0ff2, 0x0398, 0xf08c, 0xe628, 0xf489, 0x143b, 0x2419, 0x0ccf, +0xe2cc, 0xd5a6, 0xf861, 0x2615, 0x2a1b, 0xfeb4, 0xd543, 0xdc53, 0x09b4, 0x2901, +0x19ff, 0xf24a, 0xde86, 0xeec4, 0x0b7b, 0x1733, 0x0d0a, 0xfc24, 0xf1bb, 0xf110, +0xfa03, 0x0a0f, 0x15d4, 0x0e21, 0xf435, 0xe17e, 0xee90, 0x1225, 0x2527, 0x0efa, +0xe61f, 0xd916, 0xf7b8, 0x1f50, 0x2326, 0x0099, 0xe01e, 0xe473, 0x0491, 0x1b37, +0x1360, 0xfb17, 0xecd9, 0xf20d, 0x0051, 0x0aec, 0x0d4a, 0x073d, 0xfa5a, 0xeeb8, +0xf165, 0x0516, 0x17dc, 0x12da, 0xf71b, 0xe213, 0xed85, 0x0eef, 0x20c8, 0x0e09, +0xebcc, 0xe0d4, 0xf848, 0x1637, 0x19d6, 0x026b, 0xec09, 0xed00, 0xff9b, 0x0e5a, +0x0d6b, 0x026c, 0xf865, 0xf4da, 0xf888, 0x025a, 0x0cbb, 0x0d53, 0xff96, 0xeefa, +0xee80, 0x021c, 0x15d6, 0x126a, 0xf9c1, 0xe724, 0xf017, 0x0aa1, 0x18b6, 0x0b4e, +0xf2d7, 0xea91, 0xf957, 0x0cac, 0x1061, 0x03f4, 0xf6ad, 0xf476, 0xfbdf, 0x0489, +0x08b1, 0x06df, 0xffcf, 0xf766, 0xf537, 0xfddf, 0x0ad4, 0x0e15, 0x01da, 0xf205, +0xf0a0, 0x0082, 0x1066, 0x0e41, 0xfc71, 0xef1b, 0xf4ad, 0x05cd, 0x0f32, 0x07ed, +0xf9c8, 0xf401, 0xfa93, 0x04af, 0x088c, 0x04a7, 0xfe15, 0xf9f1, 0xfa64, 0xff1e, +0x0539, 0x078c, 0x02af, 0xfa1a, 0xf69d, 0xfd09, 0x075b, 0x0a3d, 0x01f2, 0xf761, +0xf642, 0xffa7, 0x08f3, 0x0830, 0xff05, 0xf7db, 0xf9bc, 0x0174, 0x068b, 0x04b2, +0xfeff, 0xfb39, 0xfc1a, 000000, 0x0371, 0x03d7, 0x00fe, 0xfd37, 0xfbe0, 0xfe78, +0x02af, 0x044a, 0x0180, 0xfd43, 0xfc00, 0xfed1, 0x02aa, 0x0346, 0x00dd, 0xfde0, +0xfbfe, 0x0114, 0x0987, 0x04bc, 0xf49d, 0xf23a, 0x06ab, 0x162e, 0x0544, 0xe76b, +0xea25, 0x1015, 0x2474, 0x0431, 0xd7d3, 0xe1ec, 0x1923, 0x2df5, 0x01cd, 0xd386, +0xe3d9, 0x1b9d, 0x2c62, 0xfeb8, 0xd31a, 0xe6ba, 0x1dbd, 0x2abb, 0xfbab, 0xd2ed, +0xe9ab, 0x1fa7, 0x28ef, 0xf8b3, 0xd2f5, 0xeca5, 0x2160, 0x26fd, 0xf5d7, 0xd334, +0xefa1, 0x22e5, 0x24ea, 0xf31b, 0xd3a9, 0xf29f, 0x2435, 0x22b6, 0xf07e, 0xd44e, +0xf59b, 0x2551, 0x2067, 0xee08, 0xd527, 0xf88e, 0x2639, 0x1e00, 0xebb6, 0xd62d, +0xfb77, 0x26eb, 0x1b85, 0xe98b, 0xd75f, 0xfe51, 0x276b, 0x18f9, 0xe78e, 0xd8b9, +0x011a, 0x27b6, 0x1660, 0xe5bb, 0xda3a, 0x03cc, 0x27cf, 0x13bd, 0xe415, 0xdbdf, +0x066a, 0x27b7, 0x1117, 0xe29e, 0xdda5, 0x08ec, 0x276e, 0x0e6d, 0xe154, 0xdf89, +0x0b52, 0x26f6, 0x0bc7, 0xe039, 0xe185, 0x0d96, 0x2653, 0x0924, 0xdf4e, 0xe399, +0x0fb9, 0x2584, 0x068b, 0xde93, 0xe5c0, 0x11b8, 0x248e, 0x03fd, 0xde08, 0xe7f8, +0x1390, 0x2372, 0x0180, 0xddaa, 0xea3c, 0x1544, 0x2231, 0xff12, 0xdd7a, 0xec89, +0x16cf, 0x20d0, 0xfcb9, 0xdd77, 0xeedb, 0x1831, 0x1f52, 0xfa77, 0xdd9f, 0xf132, +0x1969, 0x1db7, 0xf850, 0xddf1, 0xf385, 0x1a75, 0x1c06, 0xf645, 0xde6b, 0xf5d7, +0x1b5b, 0x1a3f, 0xf457, 0xdf0d, 0xf820, 0x1c13, 0x1867, 0xf288, 0xdfd2, 0xfa5f, +0x1ca1, 0x167f, 0xf0db, 0xe0ba, 0xfc92, 0x1d06, 0x148b, 0xef50, 0xe1c1, 0xfeb5, +0x1d43, 0x1290, 0xede9, 0xe2e6, 0x00c6, 0x1d58, 0x108e, 0xeca7, 0xe426, 0x02c4, +0x1d45, 0x0e8a, 0xeb8a, 0xe57f, 0x04a9, 0x1d0e, 0x0c87, 0xea92, 0xe6ec, 0x0677, +0x1cb2, 0x0a87, 0xe9be, 0xe86e, 0x082a, 0x1c34, 0x088b, 0xe912, 0xe9fe, 0x09c1, +0x1b95, 0x069c, 0xe88c, 0xeb9c, 0x0b3a, 0x1ad9, 0x04b6, 0xe82a, 0xed43, 0x0c96, +0x1a00, 0x02df, 0xe7eb, 0xeef3, 0x0dd0, 0x190d, 0x0116, 0xe7d0, 0xf0a8, 0x0eec, +0x1804, 0xff61, 0xe7d8, 0xf25d, 0x0fe6, 0x16e3, 0xfdc0, 0xe800, 0xf412, 0x10bf, +0x15b1, 0xfc36, 0xe848, 0xf5c5, 0x1176, 0x146e, 0xfac2, 0xe8ad, 0xf771, 0x120d, +0x1320, 0xf969, 0xe92e, 0xf913, 0x1282, 0x11c4, 0xf828, 0xe9cb, 0xfaac, 0x12d8, +0x1062, 0xf703, 0xea7e, 0xfc38, 0x130e, 0x0efa, 0xf5fb, 0xeb49, 0xfdb5, 0x1325, +0x0d8e, 0xf50e, 0xec26, 0xff20, 0x131e, 0x0c21, 0xf43f, 0xed15, 0x007a, 0x12fa, +0x0ab6, 0xf38d, 0xee15, 0x01be, 0x12bd, 0x094f, 0xf2f9, 0xef22, 0x02ef, 0x1265, +0x07f0, 0xf283, 0xf037, 0x0408, 0x11f6, 0x0699, 0xf226, 0xf156, 0x050a, 0x1170, +0x054b, 0xf1e8, 0xf27a, 0x05f4, 0x10d8, 0x040c, 0xf1c5, 0xf3a3, 0x06c2, 0x102c, +0x02da, 0xf1bc, 0xf4cc, 0x0779, 0x0f71, 0x01b7, 0xf1cc, 0xf5f5, 0x0815, 0x0ea7, +0x00a8, 0xf1f4, 0xf719, 0x0899, 0x0dd2, 0xffab, 0xf233, 0xf839, 0x0902, 0x0cf4, +0xfec0, 0xf288, 0xf950, 0x0952, 0x0c0e, 0xfdec, 0xf2ee, 0xfa5d, 0x0989, 0x0b23, +0xfd2d, 0xf368, 0xfb62, 0x09a7, 0x0a35, 0xfc85, 0xf3f1, 0xfc58, 0x09af, 0x0946, +0xfbf2, 0xf488, 0xfd3f, 0x09a1, 0x0859, 0xfb77, 0xf52c, 0xfe17, 0x097d, 0x076f, +0xfb14, 0xf5d8, 0xfede, 0x0945, 0x068a, 0xfac6, 0xf68d, 0xff93, 0x08fb, 0x05ad, +0xfa8e, 0xf747, 0x0034, 0x08a1, 0x04da, 0xfa6f, 0xf805, 0x00c2, 0x0836, 0x0410, +0xfa63, 0xf8c6, 0x013c, 0x07bf, 0x0354, 0xfa6c, 0xf985, 0x01a1, 0x073b, 0x02a4, +0xfa8a, 0xfa43, 0x01f1, 0x06af, 0x0204, 0xfab9, 0xfafc, 0x022c, 0x0619, 0x0175, +0xfafa, 0xfbae, 0x0252, 0x057f, 0x00f6, 0xfb4b, 0xfc5a, 0x0263, 0x04e0, 0x008b, +0xfbaa, 0xfcfa, 0x0262, 0x0440, 0x0032, 0xfc16, 0xfd90, 0x024b, 0x03a0, 0xffec, +0xfc8c, 0xfe19, 0x0225, 0x0301, 0xffb9, 0xfd0c, 0xfe93, 0x01ea, 0x0267, 0xff9c, +0xfd95, 0xfefe, 0x01a0, 0x01d3, 0xff90, 0xfe22, 0xff5a, 0x0147, 0x0145, 0xff99, +0xfeb3, 0xffa1, 0x00e0, 0x00c3, 0xffb6, 0xff46, 0xffd9, 0x006d, 0x004b, 0xffe5, +0xffda, 0xfffc, 000000, 0xfffe, 000000, 0xffff, 000000, 0xffff, 0xffff, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000 }; diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/busy.h b/3rdparty/iaxclient-2/lib/libiax2/src/busy.h new file mode 100644 index 0000000..2c642fa --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/busy.h @@ -0,0 +1,55 @@ +/* busy.h: Generated from frequencies 480 and 620 + by gensound. 400 samples */ +static short busy[400] = { + 0, 13697, 24766, 31109, 31585, 26222, 16198, 3569, + -9162, -19575, -25812, -26935, -23069, -15322, -5493, 4339, + 12277, 16985, 17934, 15440, 10519, 4585, -908, -4827, + -6592, -6269, -4489, -2220, -467, 30, -983, -3203, + -5839, -7844, -8215, -6301, -2035, 3975, 10543, 16141, + 19260, 18787, 14322, 6338, -3845, -14296, -22858, -27611, + -27309, -21691, -11585, 1213, 14285, 25068, 31388, 31915, + 26457, 16010, 2568, -11282, -22885, -30054, -31509, -27120, + -17908, -5805, 6760, 17379, 24147, 26028, 23020, 16094, + 6931, -2478, -10279, -15136, -16474, -14538, -10253, -4949, + 0, 3515, 5052, 4688, 3045, 1069, -268, -272, + 1269, 3996, 7067, 9381, 9889, 7910, 3365, -3123, + -10320, -16622, -20424, -20510, -16384, -8448, 2006, 13026, + 22383, 28040, 28613, 23696, 13996, 1232, -12193, -23670, + -30918, -32459, -27935, -18190, -5103, 8795, 20838, 28764, + 31164, 27753, 19395, 7893, -4412, -15136, -22342, -24909, + -22717, -16609, -8143, 780, 8361, 13272, 14909, 13455, + 9758, 5067, 678, -2387, -3624, -3133, -1538, 224, + 1209, 751, -1315, -4580, -8145, -10848, -11585, -9628, + -4878, 2038, 9844, 16867, 21403, 22124, 18429, 10638, + 0, -11524, -21643, -28211, -29702, -25561, -16364, -3737, + 9946, 22044, 30180, 32733, 29182, 20210, 7573, -6269, + -18655, -27259, -30558, -28117, -20645, -9807, 2148, 12878, + 20426, 23599, 22173, 16865, 9117, 731, -6552, -11426, + -13269, -12216, -9050, -4941, -1118, 1460, 2335, 1635, + 0, -1635, -2335, -1460, 1118, 4941, 9050, 12216, + 13269, 11426, 6552, -731, -9117, -16865, -22173, -23599, + -20426, -12878, -2148, 9807, 20645, 28117, 30558, 27259, + 18655, 6269, -7573, -20210, -29182, -32733, -30180, -22044, + -9946, 3737, 16364, 25561, 29702, 28211, 21643, 11524, + 0, -10638, -18429, -22124, -21403, -16867, -9844, -2038, + 4878, 9628, 11585, 10848, 8145, 4580, 1315, -751, + -1209, -224, 1538, 3133, 3624, 2387, -678, -5067, + -9758, -13455, -14909, -13272, -8361, -780, 8143, 16609, + 22717, 24909, 22342, 15136, 4412, -7893, -19395, -27753, + -31164, -28764, -20838, -8795, 5103, 18190, 27935, 32459, + 30918, 23670, 12193, -1232, -13996, -23696, -28613, -28040, + -22383, -13026, -2006, 8448, 16384, 20510, 20424, 16622, + 10320, 3123, -3365, -7910, -9889, -9381, -7067, -3996, + -1269, 272, 268, -1069, -3045, -4688, -5052, -3515, + 0, 4949, 10253, 14538, 16474, 15136, 10279, 2478, + -6931, -16094, -23020, -26028, -24147, -17379, -6760, 5805, + 17908, 27120, 31509, 30054, 22885, 11282, -2568, -16010, + -26457, -31915, -31388, -25068, -14285, -1213, 11585, 21691, + 27309, 27611, 22858, 14296, 3845, -6338, -14322, -18787, + -19260, -16141, -10543, -3975, 2035, 6301, 8215, 7844, + 5839, 3203, 983, -30, 467, 2220, 4489, 6269, + 6592, 4827, 908, -4585, -10519, -15440, -17934, -16985, + -12277, -4339, 5493, 15322, 23069, 26935, 25812, 19575, + 9162, -3569, -16198, -26222, -31585, -31109, -24766, -13697, + +}; diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/dialtone.h b/3rdparty/iaxclient-2/lib/libiax2/src/dialtone.h new file mode 100644 index 0000000..09b8814 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/dialtone.h @@ -0,0 +1,105 @@ +/* dialtone.h: Generated from frequencies 350 and 440 + by gensound. 800 samples */ +static short dialtone[800] = { + 0, 9997, 19004, 26133, 30692, 32251, 30690, 26206, + 19286, 10657, 1206, -8116, -16396, -22848, -26895, -28221, + -26797, -22878, -16960, -9723, -1954, 5545, 12044, 16954, + 19887, 20687, 19434, 16420, 12107, 7061, 1881, -2866, + -6721, -9365, -10657, -10634, -9491, -7547, -5190, -2822, + -801, 607, 1263, 1168, 454, -633, -1784, -2669, + -2993, -2548, -1247, 855, 3558, 6538, 9388, 11665, + 12955, 12933, 11408, 8370, 3996, -1349, -7152, -12797, + -17635, -21060, -22583, -21895, -18914, -13807, -6985, 934, + 9180, 16913, 23309, 27654, 29422, 28342, 24429, 17998, + 9630, 123, -9589, -18538, -25813, -30667, -32588, -31360, + -27088, -20185, -11332, -1411, 8594, 17694, 24997, 29805, + 31675, 30473, 26374, 19844, 11585, 2455, -6618, -14745, + -21156, -25284, -26815, -25713, -22213, -16785, -10073, -2824, + 4203, 10318, 14969, 17794, 18653, 17628, 14998, 11197, + 6753, 2217, -1899, -5189, -7386, -8388, -8261, -7212, + -5555, -3657, -1881, -536, 169, 157, -515, -1664, + -3009, -4217, -4954, -4940, -3996, -2080, 697, 4081, + 7689, 11059, 13710, 15199, 15187, 13489, 10114, 5272, + -630, -7031, -13263, -18632, -22491, -24320, -23794, -20823, + -15582, -8498, -218, 8457, 16651, 23507, 28276, 30407, + 29606, 25876, 19524, 11134, 1511, -8401, -17616, -25208, + -30406, -32682, -31800, -27845, -21215, -12576, -2796, 7150, + 16278, 23700, 28713, 30868, 30015, 26312, 20199, 12351, + 3598, -5164, -13071, -19378, -23531, -25223, -24413, -21318, + -16384, -10218, -3526, 2980, 8655, 12985, 15642, 16505, + 15661, 13381, 10073, 6228, 2348, -1110, -3796, -5495, + -6152, -5863, -4853, -3434, -1954, -744, -62, -60, + -757, -2037, -3664, -5317, -6637, -7283, -6985, -5590, + -3096, 334, 4390, 8631, 12544, 15605, 17339, 17393, + 15582, 11928, 6672, 258, -6705, -13506, -19403, -23711, + -25879, -25558, -22653, -17341, -10061, -1480, 7570, 16185, + 23475, 28661, 31164, 30670, 27167, 20951, 12603, 2930, + -7116, -16540, -24401, -29915, -32533, -32003, -28391, -22075, + -13704, -4128, 5690, 14781, 22262, 27432, 29838, 29319, + 26014, 20339, 12940, 4614, -3777, -11401, -17540, -21660, + -23463, -22908, -20199, -15755, -10150, -4044, 1898, 7079, + 11030, 13459, 14268, 13555, 11585, 8745, 5487, 2268, + -511, -2559, -3716, -3975, -3468, -2440, -1206, -101, + 578, 618, -78, -1470, -3382, -5524, -7531, -9018, + -9630, -9103, -7308, -4280, -226, 4483, 9357, 13829, + 17329, 19352, 19524, 17659, 13788, 8177, 1302, -6184, + -13528, -19945, -24710, -27240, -27167, -24381, -19058, -11646, + -2830, 6539, 15528, 23219, 28806, 31685, 31520, 28282, + 22254, 14010, 4355, -5759, -15331, -23411, -29203, -32144, + -31966, -28714, -22748, -14695, -5384, 4241, 13228, 20707, + 25981, 28600, 28391, 25479, 20256, 13337, 5482, -2482, + -9761, -15668, -19694, -21556, -21215, -18865, -14902, -9864, + -4366, 975, 5614, 9130, 11270, 11967, 11332, 9628, + 7223, 4536, 1976, -113, -1495, -2071, -1882, -1102, + 0, 1102, 1882, 2071, 1495, 113, -1976, -4536, + -7223, -9628, -11332, -11967, -11270, -9130, -5614, -975, + 4366, 9864, 14902, 18865, 21215, 21556, 19694, 15668, + 9761, 2482, -5482, -13337, -20256, -25479, -28391, -28600, + -25981, -20707, -13228, -4241, 5384, 14695, 22748, 28714, + 31966, 32144, 29203, 23411, 15331, 5759, -4355, -14010, + -22254, -28282, -31520, -31685, -28806, -23219, -15528, -6539, + 2830, 11646, 19058, 24381, 27167, 27240, 24710, 19945, + 13528, 6184, -1302, -8177, -13788, -17659, -19524, -19352, + -17329, -13829, -9357, -4483, 226, 4280, 7308, 9103, + 9630, 9018, 7531, 5524, 3382, 1470, 78, -618, + -578, 101, 1206, 2440, 3468, 3975, 3716, 2559, + 511, -2268, -5487, -8745, -11585, -13555, -14268, -13459, + -11030, -7079, -1898, 4044, 10150, 15755, 20199, 22908, + 23463, 21660, 17540, 11401, 3777, -4614, -12940, -20339, + -26014, -29319, -29838, -27432, -22262, -14781, -5690, 4128, + 13704, 22075, 28391, 32003, 32533, 29915, 24401, 16540, + 7116, -2930, -12603, -20951, -27167, -30670, -31164, -28661, + -23475, -16185, -7570, 1480, 10061, 17341, 22653, 25558, + 25879, 23711, 19403, 13506, 6705, -258, -6672, -11928, + -15582, -17393, -17339, -15605, -12544, -8631, -4390, -334, + 3096, 5590, 6985, 7283, 6637, 5317, 3664, 2037, + 757, 60, 62, 744, 1954, 3434, 4853, 5863, + 6152, 5495, 3796, 1110, -2348, -6228, -10073, -13381, + -15661, -16505, -15642, -12985, -8655, -2980, 3526, 10218, + 16384, 21318, 24413, 25223, 23531, 19378, 13071, 5164, + -3598, -12351, -20199, -26312, -30015, -30868, -28713, -23700, + -16278, -7150, 2796, 12576, 21215, 27845, 31800, 32682, + 30406, 25208, 17616, 8401, -1511, -11134, -19524, -25876, + -29606, -30407, -28276, -23507, -16651, -8457, 218, 8498, + 15582, 20823, 23794, 24320, 22491, 18632, 13263, 7031, + 630, -5272, -10114, -13489, -15187, -15199, -13710, -11059, + -7689, -4081, -697, 2080, 3996, 4940, 4954, 4217, + 3009, 1664, 515, -157, -169, 536, 1881, 3657, + 5555, 7212, 8261, 8388, 7386, 5189, 1899, -2217, + -6753, -11197, -14998, -17628, -18653, -17794, -14969, -10318, + -4203, 2824, 10073, 16785, 22213, 25713, 26815, 25284, + 21156, 14745, 6618, -2455, -11585, -19844, -26374, -30473, + -31675, -29805, -24997, -17694, -8594, 1411, 11332, 20185, + 27088, 31360, 32588, 30667, 25813, 18538, 9589, -123, + -9630, -17998, -24429, -28342, -29422, -27654, -23309, -16913, + -9180, -934, 6985, 13807, 18914, 21895, 22583, 21060, + 17635, 12797, 7152, 1349, -3996, -8370, -11408, -12933, + -12955, -11665, -9388, -6538, -3558, -855, 1247, 2548, + 2993, 2669, 1784, 633, -454, -1168, -1263, -607, + 801, 2822, 5190, 7547, 9491, 10634, 10657, 9365, + 6721, 2866, -1881, -7061, -12107, -16420, -19434, -20687, + -19887, -16954, -12044, -5545, 1954, 9723, 16960, 22878, + 26797, 28221, 26895, 22848, 16396, 8116, -1206, -10657, + -19286, -26206, -30690, -32251, -30692, -26133, -19004, -9997, + +}; diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/frame.h b/3rdparty/iaxclient-2/lib/libiax2/src/frame.h new file mode 100644 index 0000000..f33f79c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/frame.h @@ -0,0 +1,144 @@ +/* + * libiax: An implementation of the Inter-Asterisk eXchange protocol + * + * Asterisk internal frame definitions. + * + * Copyright (C) 1999, Mark Spencer + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser General Public License. Other components of + * Asterisk are distributed under The GNU General Public License + * only. + */ + +#ifndef _LIBIAX_FRAME_H +#define _LIBIAX_FRAME_H + +#if defined(__cplusplus) || defined(c_plusplus) +extern "C" { +#endif + +/* Frame types */ +#define AST_FRAME_DTMF 1 /* A DTMF digit, subclass is the digit */ +#define AST_FRAME_VOICE 2 /* Voice data, subclass is AST_FORMAT_* */ +#define AST_FRAME_VIDEO 3 /* Video frame, maybe?? :) */ +#define AST_FRAME_CONTROL 4 /* A control frame, subclass is AST_CONTROL_* */ +#define AST_FRAME_NULL 5 /* An empty, useless frame */ +#define AST_FRAME_IAX 6 /* Inter Aterisk Exchange private frame type */ +#define AST_FRAME_TEXT 7 /* Text messages */ +#define AST_FRAME_IMAGE 8 /* Image Frames */ +#define AST_FRAME_HTML 9 /* HTML Frames */ +#define AST_FRAME_CNG 10 /* Comfort Noise frame (subclass is level of CNG in -dBov) */ + +/* HTML subclasses */ +#define AST_HTML_URL 1 /* Sending a URL */ +#define AST_HTML_DATA 2 /* Data frame */ +#define AST_HTML_BEGIN 4 /* Beginning frame */ +#define AST_HTML_END 8 /* End frame */ +#define AST_HTML_LDCOMPLETE 16 /* Load is complete */ +#define AST_HTML_NOSUPPORT 17 /* Peer is unable to support HTML */ +#define AST_HTML_LINKURL 18 /* Send URL and track */ +#define AST_HTML_UNLINK 19 /* Request no more linkage */ +#define AST_HTML_LINKREJECT 20 /* Reject LINKURL */ + +/* Data formats for capabilities and frames alike */ +/*! G.723.1 compression */ +#define AST_FORMAT_G723_1 (1 << 0) + /*! GSM compression */ +#define AST_FORMAT_GSM (1 << 1) + /*! Raw mu-law data (G.711) */ +#define AST_FORMAT_ULAW (1 << 2) + /*! Raw A-law data (G.711) */ +#define AST_FORMAT_ALAW (1 << 3) + /*! ADPCM (G.726, 32kbps) */ +#define AST_FORMAT_G726 (1 << 4) + /*! ADPCM (IMA) */ +#define AST_FORMAT_ADPCM (1 << 5) + /*! Raw 16-bit Signed Linear (8000 Hz) PCM */ +#define AST_FORMAT_SLINEAR (1 << 6) + /*! LPC10, 180 samples/frame */ +#define AST_FORMAT_LPC10 (1 << 7) + /*! G.729A audio */ +#define AST_FORMAT_G729A (1 << 8) + /*! SpeeX Free Compression */ +#define AST_FORMAT_SPEEX (1 << 9) + /*! iLBC Free Compression */ +#define AST_FORMAT_ILBC (1 << 10) + /*! Maximum audio format */ +#define AST_FORMAT_MAX_AUDIO (1 << 15) + /*! JPEG Images */ +#define AST_FORMAT_JPEG (1 << 16) + /*! PNG Images */ +#define AST_FORMAT_PNG (1 << 17) + /*! H.261 Video */ +#define AST_FORMAT_H261 (1 << 18) + /*! H.263 Video */ +#define AST_FORMAT_H263 (1 << 19) + /*! H.263+ Video */ +#define AST_FORMAT_H263p (1 << 20) + /*! H.264 Video*/ +#define AST_FORMAT_H264 (1 << 21) + /*! MPEG4 Video*/ +#define AST_FORMAT_MPEG4 (1 << 22) + /*! Theora Video */ +#define AST_FORMAT_THEORA (1 << 24) + /*! Max one */ +#define AST_FORMAT_MAX_VIDEO (1 << 24) + +/* Control frame types */ +#define AST_CONTROL_HANGUP 1 /* Other end has hungup */ +#define AST_CONTROL_RING 2 /* Local ring */ +#define AST_CONTROL_RINGING 3 /* Remote end is ringing */ +#define AST_CONTROL_ANSWER 4 /* Remote end has answered */ +#define AST_CONTROL_BUSY 5 /* Remote end is busy */ +#define AST_CONTROL_TAKEOFFHOOK 6 /* Make it go off hook */ +#define AST_CONTROL_OFFHOOK 7 /* Line is off hook */ +#define AST_CONTROL_CONGESTION 8 /* Congestion (circuits busy) */ +#define AST_CONTROL_FLASH 9 /* Flash hook */ +#define AST_CONTROL_WINK 10 /* Wink */ +#define AST_CONTROL_OPTION 11 /* Set an option */ +#define AST_CONTROL_KEY 12 /* Key Radio */ +#define AST_CONTROL_UNKEY 13 /* Unkey Radio */ + +#define AST_FRIENDLY_OFFSET 64 /* Reserved header space */ + +struct ast_frame { + /*! Kind of frame */ + int frametype; + /*! Subclass, frame dependent */ + int subclass; + /*! Length of data */ + int datalen; + /*! Number of 8khz samples in this frame */ + int samples; + /*! Was the data malloc'd? i.e. should we free it when we discard the f +rame? */ + int mallocd; + /*! How far into "data" the data really starts */ + int offset; + /*! Optional source of frame for debugging */ + char *src; + /*! Pointer to actual data */ + void *data; + /*! Next/Prev for linking stand alone frames */ + struct ast_frame *prev; + /*! Next/Prev for linking stand alone frames */ + struct ast_frame *next; + /* Unused except + if debugging is turned on, but left + in the struct + so that it can be turned on without + requiring a r +ecompile of the whole thing */ +}; + + + +#if defined(__cplusplus) || defined(c_plusplus) +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax-client.h b/3rdparty/iaxclient-2/lib/libiax2/src/iax-client.h new file mode 100644 index 0000000..9685239 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax-client.h @@ -0,0 +1,256 @@ +/* + * Asterisk -- A telephony toolkit for Linux. + * + * Implementation of Inter-Asterisk eXchange + * + * Copyright (C) 1999, Mark Spencer + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser General Public License (LGPL) + */ + +#ifndef _ASTERISK_IAX_CLIENT_H +#define _ASTERISK_IAX_CLIENT_H + +#if defined(_MSC_VER) +/* disable zero-sized array in struct/union warning */ +#pragma warning(disable:4200) +#endif + +#ifdef WIN32 +#define socklen_t int +#endif + +#include "frame.h" +#include "iax2.h" +#include "iax2-parser.h" + +#define MAXSTRLEN 80 + +#define IAX_AUTHMETHOD_PLAINTEXT IAX_AUTH_PLAINTEXT +#define IAX_AUTHMETHOD_MD5 IAX_AUTH_MD5 + +extern char iax_errstr[]; + +struct iax_session; + + +#define IAX_EVENT_CONNECT 0 /* Connect a new call */ +#define IAX_EVENT_ACCEPT 1 /* Accept a call */ +#define IAX_EVENT_HANGUP 2 /* Hang up a call */ +#define IAX_EVENT_REJECT 3 /* Rejected call */ +#define IAX_EVENT_VOICE 4 /* Voice Data */ +#define IAX_EVENT_DTMF 5 /* A DTMF Tone */ +#define IAX_EVENT_TIMEOUT 6 /* Connection timeout... session + will be a pointer to free()'d + memory! */ +#define IAX_EVENT_LAGRQ 7 /* Lag request -- Internal use only */ +#define IAX_EVENT_LAGRP 8 /* Lag Measurement. See event.lag */ +#define IAX_EVENT_RINGA 9 /* Announce we/they are ringing */ +#define IAX_EVENT_PING 10 /* Ping -- internal use only */ +#define IAX_EVENT_PONG 11 /* Pong -- internal use only */ +#define IAX_EVENT_BUSY 12 /* Report a line busy */ +#define IAX_EVENT_ANSWER 13 /* Answer the line */ + +#define IAX_EVENT_IMAGE 14 /* Send/Receive an image */ +#define IAX_EVENT_AUTHRQ 15 /* Authentication request */ +#define IAX_EVENT_AUTHRP 16 /* Authentication reply */ + +#define IAX_EVENT_REGREQ 17 /* Registration request */ +#define IAX_EVENT_REGACK 18 /* Registration reply */ +#define IAX_EVENT_URL 19 /* URL received */ +#define IAX_EVENT_LDCOMPLETE 20 /* URL loading complete */ + +#define IAX_EVENT_TRANSFER 21 /* Transfer has taken place */ + +#define IAX_EVENT_DPREQ 22 /* Dialplan request */ +#define IAX_EVENT_DPREP 23 /* Dialplan reply */ +#define IAX_EVENT_DIAL 24 /* Dial on a TBD call */ + +#define IAX_EVENT_QUELCH 25 /* Quelch Audio */ +#define IAX_EVENT_UNQUELCH 26 /* Unquelch Audio */ + +#define IAX_EVENT_UNLINK 27 /* Unlink */ +#define IAX_EVENT_LINKREJECT 28 /* Link Rejection */ +#define IAX_EVENT_TEXT 29 /* Text Frame :-) */ +#define IAX_EVENT_REGREJ 30 /* Registration reply */ +#define IAX_EVENT_LINKURL 31 /* Unlink */ +#define IAX_EVENT_CNG 32 /* Comfort-noise (almost silence) */ +#define IAX_EVENT_POKE 33 +#define IAX_EVENT_VIDEO 34 /* Send/receive video */ +#define IAX_EVENT_KEY 35 /* Radio Control Key */ +#define IAX_EVENT_UNKEY 36 /* Radio Control UnKey */ + + +/* moved from iax.c to support attended transfer */ +#define IAX_EVENT_REREQUEST 999 +#define IAX_EVENT_TXREPLY 1000 +#define IAX_EVENT_TXREJECT 1001 +#define IAX_EVENT_TXACCEPT 1002 +#define IAX_EVENT_TXREADY 1003 + +/* + * Null event. We use it to notify back the caller that a frame has been + * received and is queued for delivery + * Applciations should simply ignore it + */ +#define IAX_EVENT_NULL 65535 + +#define IAX_SCHEDULE_FUZZ 0 /* ms of fuzz to drop */ + +#if defined(WIN32) +typedef int PASCAL (*iax_sendto_t)(SOCKET, const char *, int, int, + const struct sockaddr *, int); +typedef int PASCAL (*iax_recvfrom_t)(SOCKET, char *, int, int, + struct sockaddr *, int *); +#else +typedef int (*iax_sendto_t)(int, const void *, size_t, int, + const struct sockaddr *, socklen_t); +typedef int (*iax_recvfrom_t)(int, void *, size_t, int, + struct sockaddr *, socklen_t *); +#endif + +struct iax_event { + int etype; /* Type of event */ + int subclass; /* Subclass data (event specific) */ + unsigned int ts; /* Timestamp */ + struct iax_session *session; /* Applicable session */ + int datalen; /* Length of raw data */ + struct iax_ies ies; /* IE's for IAX2 frames */ + unsigned char data[0]; /* Raw data if applicable */ +}; + +#if defined(__cplusplus) +extern "C" +{ +#endif + +/* All functions return 0 on success and -1 on failure unless otherwise + specified */ + +/* Called to initialize IAX structures and sockets. Returns actual + portnumber (which it will try preferred portno first, but if not + take what it can get */ +extern int iax_init(int preferredportno); + +/* Get filedescriptor for IAX to use with select or gtk_input_add */ +extern int iax_get_fd(void); + +/* Find out how many milliseconds until the next scheduled event */ +extern int iax_time_to_next_event(void); + +/* Generate a new IAX session */ +extern struct iax_session *iax_session_new(void); + +/* Return exactly one iax event (if there is one pending). If blocking is + non-zero, IAX will block until some event is received */ +extern struct iax_event *iax_get_event(int blocking); + + +extern int iax_auth_reply(struct iax_session *session, char *password, + char *challenge, int methods); + +/* Free an event */ +extern void iax_event_free(struct iax_event *event); + +struct sockaddr_in; + +/* Front ends for sending events */ +extern int iax_send_dtmf(struct iax_session *session, char digit); +extern int iax_send_voice(struct iax_session *session, int format, unsigned char *data, int datalen, int samples); +extern int iax_send_cng(struct iax_session *session, int level, unsigned char *data, int datalen); +extern int iax_send_image(struct iax_session *session, int format, unsigned char *data, int datalen); +extern int iax_send_url(struct iax_session *session, const char *url, int link); +extern int iax_send_text(struct iax_session *session, const char *text); +extern int iax_send_ping(struct iax_session *session); +extern int iax_load_complete(struct iax_session *session); +extern int iax_reject(struct iax_session *session, char *reason); +extern int iax_busy(struct iax_session *session); +extern int iax_congestion(struct iax_session *session); +extern int iax_hangup(struct iax_session *session, char *byemsg); +extern int iax_call(struct iax_session *session, const char *cidnum, const char *cidname, const char *ich, const char *lang, int wait, int format, int capability); +extern int iax_accept(struct iax_session *session, int format); +extern int iax_answer(struct iax_session *session); +extern int iax_sendurl(struct iax_session *session, char *url); +extern int iax_send_unlink(struct iax_session *session); +extern int iax_send_link_reject(struct iax_session *session); +extern int iax_ring_announce(struct iax_session *session); +extern struct sockaddr_in iax_get_peer_addr(struct iax_session *session); +extern int iax_register(struct iax_session *session, const char *hostname, const char *peer, const char *secret, int refresh); +extern int iax_unregister(struct iax_session *session, const char *hostname, const char *peer, const char *secret, const char *reason); +extern int iax_lag_request(struct iax_session *session); +extern int iax_dial(struct iax_session *session, char *number); /* Dial on a TBD call */ +extern int iax_dialplan_request(struct iax_session *session, char *number); /* Request dialplan status for number */ +extern int iax_quelch(struct iax_session *session); +extern int iax_unquelch(struct iax_session * session); +extern int iax_transfer(struct iax_session *session, const char *number); +extern int iax_quelch_moh(struct iax_session *session, int MOH); +extern int iax_send_video(struct iax_session *session, int format, unsigned char *data, int datalen, int fullframe); +extern int iax_send_video_trunk(struct iax_session *session, int format, char *data, int datalen, int fullframe, int ntrunk); +extern int iax_key_radio(struct iax_session *session); +extern int iax_unkey_radio(struct iax_session *session); + +extern void iax_destroy(struct iax_session * session); + +extern void iax_enable_debug(void); +extern void iax_disable_debug(void); + +extern struct timeval iax_tvnow(void); + +/* For attended transfer, application create a new session, + * make a call on the new session. + * On answer of the new session, call iax_setup_transfer and wait for + * IAX_EVENT_TXREADY when both sides are completed succefully or + * IAX_EVENT_TXREJECT for either side. + * If there are music on hold the it will be stopped by this library. + */ +extern int iax_setup_transfer(struct iax_session *s0, struct iax_session *s1); + +struct iax_netstat { + int jitter; + int losspct; + int losscnt; + int packets; + int delay; + int dropped; + int ooo; +}; +/* fills in rtt, and an iax_netstat structure for each of local/remote directions of call */ +extern int iax_get_netstats(struct iax_session *s, int *rtt, struct iax_netstat *local, struct iax_netstat *remote); + + +extern void iax_set_private(struct iax_session *s, void *pvt); +extern void *iax_get_private(struct iax_session *s); +extern void iax_set_sendto(struct iax_session *s, iax_sendto_t sendto); + +/* to use application networking instead of internal, set call this instead of iax_init, + * and pass in sendto and recvfrom replacements. blocking reads may not be implemented */ +extern void iax_set_networking(iax_sendto_t st, iax_recvfrom_t rf); + +/* destroy an iax session */ +extern void iax_session_destroy(struct iax_session **session); + +/* To control use of jitter buffer for video event */ +int iax_video_bypass_jitter(struct iax_session*, int ); + +/* Handle externally received frames */ +struct iax_event *iax_net_process(unsigned char *buf, int len, struct sockaddr_in *sin); +extern unsigned int iax_session_get_capability(struct iax_session *s); +extern char iax_pref_codec_add(struct iax_session *session, unsigned int format); +extern void iax_pref_codec_del(struct iax_session *session, unsigned int format); +extern int iax_pref_codec_get(struct iax_session *session, unsigned int *array, int len); + +/* Fine tune jitterbuffer */ +extern void iax_set_jb_target_extra( long value ); + +/* Portable 'decent' random number generation */ +extern void iax_seed_random(void); +extern int iax_random(void); + +#if defined(__cplusplus) +} +#endif + +#endif /* _ASTERISK_IAX_CLIENT_H */ diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax.c b/3rdparty/iaxclient-2/lib/libiax2/src/iax.c new file mode 100644 index 0000000..2e21a0c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax.c @@ -0,0 +1,3548 @@ + /* + * libiax: An implementation of Inter-Asterisk eXchange + * + * Copyright (C) 2001, Linux Support Services, Inc. + * + * Mark Spencer + * Frik Strecker + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#if defined(WIN32) || defined(_WIN32_WCE) +#undef __STRICT_ANSI__ //for strdup with ms +#include "winpoop.h" +#if defined(_WIN32_WCE) +#define strdup _strdup +#else +#include +#include +#include +#include +#endif +#include +#include +#include +#include +#include +#include + +#if !defined(_WIN32_WCE) +#include +#endif + +#define snprintf _snprintf + +#if defined(_MSC_VER) +#define close closesocket +#if !defined(_WIN32_WCE) +#define inline __inline +#endif +#endif + +#else // !#if defined(WIN32) || defined(_WIN32_WCE) +#include +#include +#include +#include // gettimeofday +#ifndef HAVE_GETTIMEOFDAY +#define HAVE_GETTIMEOFDAY 1 +#endif +#include + +#ifdef __GNUC__ +#ifndef __USE_SVID +#define __USE_SVID +#endif +#endif + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +// FlightGear: Modified to include FreeBSD +#if !defined(MACOSX) && !defined(__OpenBSD__) && !defined(__FreeBSD__) +#include +#if !defined(SOLARIS) +#include +#endif +#endif + +#endif // #if defined(WIN32) || defined(_WIN32_WCE) yes or no + +#ifndef _MSC_VER +#endif + +#include "jitterbuf.h" +#include "iax-client.h" +#include "md5.h" + +/* Define socket options for IAX2 sockets, based on platform + * availability of flags */ +#if defined(WIN32) || defined(_WIN32_WCE) +#define IAX_SOCKOPTS 0 +#else +#ifdef MACOSX +#define IAX_SOCKOPTS MSG_DONTWAIT +#else +#if defined(SOLARIS) || defined(__OpenBSD__) +#define IAX_SOCKOPTS MSG_DONTWAIT +#else /* Linux and others */ +#define IAX_SOCKOPTS MSG_DONTWAIT | MSG_NOSIGNAL +#endif +#endif +#endif + + +#ifdef SNOM_HACK +/* The snom phone seems to improperly execute memset in some cases */ +#include "../../snom_phonecore2/include/snom_memset.h" +#endif + +/* Voice TS Prediction causes libiax2 to clean up the timestamps on + * outgoing frames. It works best with either continuous voice, or + * callers who call iax_send_cng to indicate DTX for silence */ +#define USE_VOICE_TS_PREDICTION + +#define MIN_RETRY_TIME 10 +#define MAX_RETRY_TIME 4000 +#define MEMORY_SIZE 1000 + +#define TRANSFER_NONE 0 +#define TRANSFER_BEGIN 1 +#define TRANSFER_READY 2 +#define TRANSFER_REL 3 + +/* Video frames bypass jitterbuffer */ +static int video_bypass_jitterbuffer = 0; + +/* To use or not to use the jitterbuffer */ +static int iax_use_jitterbuffer = 1; + +/* UDP Socket (file descriptor) */ +static int netfd = -1; + +/* Max timeouts */ +static const int maxretries = 10; + +/* configurable jitterbuffer options */ +static long jb_target_extra = -1; + +/* external global networking replacements */ +static iax_sendto_t iax_sendto = (iax_sendto_t) sendto; +static iax_recvfrom_t iax_recvfrom = (iax_recvfrom_t) recvfrom; + +/* ping interval (seconds) */ +static int ping_time = 10; +static void send_ping(void *session); + +struct iax_session { + /* Private data */ + void *pvt; + /* session-local Sendto function */ + iax_sendto_t sendto; + /* Is voice quelched (e.g. hold) */ + int quelch; + /* Codec Pref Order */ + char codec_order[32]; + /* Codec Pref Order Index*/ + int codec_order_len; + /* Last received voice format */ + int voiceformat; + /* Last transmitted voice format */ + int svoiceformat; + /* Last received video format */ + int videoformat; + /* Last transmitted video format */ + int svideoformat; + /* Per session capability */ + int capability; + /* Last received timestamp */ + unsigned int last_ts; + /* Last transmitted timestamp */ + unsigned int lastsent; + /* Timestamp of the last transmitted video frame */ + unsigned int lastvsent; +#ifdef USE_VOICE_TS_PREDICTION + /* Next predicted voice ts */ + unsigned int nextpred; + /* True if the last voice we transmitted was not silence/CNG */ + int notsilenttx; +#endif + /* Our last measured ping time */ + unsigned int pingtime; + /* Address of peer */ + struct sockaddr_in peeraddr; + /* Our call number */ + int callno; + /* Peer's call number */ + int peercallno; + /* Our next outgoing sequence number */ + unsigned char oseqno; + /* Next sequence number they have not yet acknowledged */ + unsigned char rseqno; + /* Our last received incoming sequence number */ + unsigned char iseqno; + /* Last acknowledged sequence number */ + unsigned char aseqno; + /* Last sequence number we VNAKd */ + unsigned char lastvnak; + /* Time value that we base our transmission on */ + struct timeval offset; + /* Time value we base our delivery on */ + struct timeval rxcore; + /* Current link state */ + int state; + /* Unregister reason */ + char unregreason[MAXSTRLEN]; + /* Expected Username */ + char username[MAXSTRLEN]; + /* Expected Secret */ + char secret[MAXSTRLEN]; + /* Refresh if applicable */ + int refresh; + + /* ping scheduler id */ + int pingid; + + /* Transfer stuff */ + struct sockaddr_in transfer; + int transferring; + int transfercallno; + int transferid; + int transferpeer; /* for attended transfer */ + int transfer_moh; /* for music on hold while performing attended transfer */ + + jitterbuf *jb; + + struct iax_netstat remote_netstats; + + /* For linking if there are multiple connections */ + struct iax_session *next; +}; + +char iax_errstr[256]; + + +#define IAXERROR snprintf(iax_errstr, sizeof(iax_errstr), + +#define DEBUG_SUPPORT 1 +#define DEBUG_DEFAULT 1 + +#ifdef DEBUG_SUPPORT + +#ifdef DEBUG_DEFAULT +static int debug = 1; +#else +static int debug = 0; +#endif + +void iax_enable_debug(void) +{ + debug = 1; +} + +void iax_disable_debug(void) +{ + debug = 0; +} + +void iax_enable_jitterbuffer(void) +{ + iax_use_jitterbuffer = 1; +} + +void iax_disable_jitterbuffer(void) +{ + iax_use_jitterbuffer = 0; +} + +void iax_set_private(struct iax_session *s, void *ptr) +{ + s->pvt = ptr; +} + +void *iax_get_private(struct iax_session *s) +{ + return s->pvt; +} + +void iax_set_sendto(struct iax_session *s, iax_sendto_t ptr) +{ + s->sendto = ptr; +} + +/* This is a little strange, but to debug you call DEBU(G "Hello World!\n"); */ +#if defined(WIN32) || defined(_WIN32_WCE) +#define G __FILE__, __LINE__, +#else +#define G __FILE__, __LINE__, __PRETTY_FUNCTION__, +#endif + +#define DEBU __debug +#if defined(WIN32) || defined(_WIN32_WCE) +static int __debug(const char *file, int lineno, const char *fmt, ...) +{ + va_list args; + va_start(args, fmt); + if (debug) { + fprintf(stderr, "%s line %d: ", file, lineno); + vfprintf(stderr, fmt, args); + } + va_end(args); + return 0; +} +#else +static int __debug(const char *file, int lineno, const char *func, const char *fmt, ...) +{ + va_list args; + va_start(args, fmt); + if (debug) { + fprintf(stderr, "%s line %d in %s: ", file, lineno, func); + vfprintf(stderr, fmt, args); + } + va_end(args); + return 0; +} +#endif +#else /* No debug support */ + +#if defined(WIN32) || defined(_WIN32_WCE) +#define DEBU +#else +#define DEBU(fmt...) \ + do {} while(0) +#endif +#define G +#endif + +void iax_seed_random() +{ +#if defined(HAVE_SRANDOMDEV) + srandomdev(); +#elif defined(HAVE_SRANDOM) + srandom((unsigned int)time(0)); +#elif defined(HAVE_SRAND48) + srand48((long int)time(0)); +#else + srand((unsigned int)time(0)); +#endif +} + +int iax_random() +{ +#if defined(HAVE_RANDOM) + return (int)random(); +#elif defined(HAVE_LRAND48) + return (int)lrand48(); +#else + return rand(); +#endif +} + +typedef void (*sched_func)(void *); + +struct iax_sched { + /* These are scheduled things to be delivered */ + struct timeval when; + /* If event is non-NULL then we're delivering an event */ + struct iax_event *event; + /* If frame is non-NULL then we're transmitting a frame */ + struct iax_frame *frame; + /* If func is non-NULL then we should call it */ + sched_func func; + /* and pass it this argument */ + void *arg; + /* Easy linking */ + struct iax_sched *next; +}; + +static struct iax_sched *schedq = NULL; +static struct iax_session *sessions = NULL; +static int callnums = 1; + +unsigned int iax_session_get_capability(struct iax_session *s) +{ + return s->capability; +} + +static int inaddrcmp(struct sockaddr_in *sin1, struct sockaddr_in *sin2) +{ + return (sin1->sin_addr.s_addr != sin2->sin_addr.s_addr) || (sin1->sin_port != sin2->sin_port); +} + +static int iax_sched_add(struct iax_event *event, struct iax_frame *frame, sched_func func, void *arg, int ms) +{ + + /* Schedule event to be delivered to the client + in ms milliseconds from now, or a reliable frame to be retransmitted */ + struct iax_sched *sched, *cur, *prev = NULL; + + if (!event && !frame && !func) { + DEBU(G "No event, no frame, no func? what are we scheduling?\n"); + return -1; + } + + //fprintf(stderr, "scheduling event %d ms from now\n", ms); + sched = (struct iax_sched*)malloc(sizeof(struct iax_sched)); + if (sched) { + memset(sched, 0, sizeof(struct iax_sched)); + sched->when = iax_tvnow(); + sched->when.tv_sec += (ms / 1000); + ms = ms % 1000; + sched->when.tv_usec += (ms * 1000); + if (sched->when.tv_usec > 1000000) { + sched->when.tv_usec -= 1000000; + sched->when.tv_sec++; + } + sched->event = event; + sched->frame = frame; + sched->func = func; + sched->arg = arg; + /* Put it in the list, in order */ + cur = schedq; + while(cur && ((cur->when.tv_sec < sched->when.tv_sec) || + ((cur->when.tv_usec <= sched->when.tv_usec) && + (cur->when.tv_sec == sched->when.tv_sec)))) { + prev = cur; + cur = cur->next; + } + sched->next = cur; + if (prev) { + prev->next = sched; + } else { + schedq = sched; + } + return 0; + } else { + DEBU(G "Out of memory!\n"); + return -1; + } +} + +static int iax_sched_del(struct iax_event *event, struct iax_frame *frame, sched_func func, void *arg, int all) +{ + struct iax_sched *cur, *tmp, *prev = NULL; + + cur = schedq; + while (cur) { + if (cur->event == event && cur->frame == frame && cur->func == func && cur->arg == arg) { + if (prev) + prev->next = cur->next; + else + schedq = cur->next; + tmp = cur; + cur = cur->next; + free(tmp); + if (!all) + return -1; + } else { + prev = cur; + cur = cur->next; + } + } + return 0; +} + + +int iax_time_to_next_event(void) +{ + struct timeval tv; + struct iax_sched *cur = schedq; + int ms, min = 999999999; + + /* If there are no pending events, we don't need to timeout */ + if (!cur) + return -1; + tv = iax_tvnow(); + while(cur) { + ms = (cur->when.tv_sec - tv.tv_sec) * 1000 + + (cur->when.tv_usec - tv.tv_usec) / 1000; + if (ms < min) + min = ms; + cur = cur->next; + } + if (min < 0) + min = 0; + return min; +} + +struct iax_session *iax_session_new(void) +{ + struct iax_session *s; + s = calloc(1, sizeof(struct iax_session)); + if (s) { + jb_conf jbconf; + + /* Initialize important fields */ + s->voiceformat = -1; + s->svoiceformat = -1; + s->videoformat = -1; + /* Default pingtime to 100 ms -- should cover most decent net connections */ + s->pingtime = 100; + /* XXX Not quite right -- make sure it's not in use, but that won't matter + unless you've had at least 65k calls. XXX */ + s->callno = callnums++; + if (callnums > 32767) + callnums = 1; + s->peercallno = 0; + s->lastvnak = -1; + s->transferpeer = 0; /* for attended transfer */ + s->next = sessions; + s->sendto = iax_sendto; + s->pingid = -1; + +#ifdef USE_VOICE_TS_PREDICTION + s->nextpred = 0; +#endif + + s->jb = jb_new(); + if ( !s->jb ) + { + free(s); + return 0; + } + jbconf.max_jitterbuf = 0; + jbconf.resync_threshold = 1000; + jbconf.max_contig_interp = 0; + jbconf.target_extra = jb_target_extra; + jb_setconf(s->jb, &jbconf); + + sessions = s; + } + return s; +} + +static int iax_session_valid(struct iax_session *session) +{ + /* Return -1 on a valid iax session pointer, 0 on a failure */ + struct iax_session *cur = sessions; + while(cur) { + if (session == cur) + return -1; + cur = cur->next; + } + return 0; +} + +int iax_get_netstats(struct iax_session *session, int *rtt, struct iax_netstat *local, struct iax_netstat *remote) +{ + jb_info stats; + + if(!iax_session_valid(session)) return -1; + + *rtt = session->pingtime; + + *remote = session->remote_netstats; + + jb_getinfo(session->jb, &stats); + + local->jitter = stats.jitter; + /* XXX: should be short-term loss pct.. */ + if(stats.frames_in == 0) stats.frames_in = 1; + local->losspct = stats.losspct/1000; + local->losscnt = stats.frames_lost; + local->packets = stats.frames_in; + local->delay = stats.current - stats.min; + local->dropped = stats.frames_dropped; + local->ooo = stats.frames_ooo; + + return 0; +} + +#ifdef USE_VOICE_TS_PREDICTION +static void add_ms(struct timeval *tv, int ms) +{ + tv->tv_usec += ms * 1000; + if (tv->tv_usec > 999999) { + tv->tv_sec += tv->tv_usec / 1000000; + tv->tv_usec %= 1000000; + } + + if (tv->tv_usec < 0) { + tv->tv_sec += (tv->tv_usec / 1000000 - 1); + tv->tv_usec = (tv->tv_usec % 1000000) + 1000000; + } +} +#endif + +static int calc_timestamp(struct iax_session *session, unsigned int ts, struct ast_frame *f) +{ + int ms; + struct timeval tv; + int voice = 0; + int video = 0; + int genuine = 0; + + if ( f && f->frametype == AST_FRAME_VOICE ) + { + voice = 1; + } else if ( f && f->frametype == AST_FRAME_VIDEO ) + { + video = 1; + } else if (!f || f->frametype == AST_FRAME_IAX) + { + genuine = 1; + } + + /* If this is the first packet we're sending, get our + offset now. */ + if (!session->offset.tv_sec && !session->offset.tv_usec) + session->offset = iax_tvnow(); + + /* If the timestamp is specified, just use their specified + timestamp no matter what. Usually this is done for + special cases. */ + if (ts) + { + if ( f && session ) + session->lastsent = ts; + return ts; + } + + /* Otherwise calculate the timestamp from the current time */ + tv = iax_tvnow(); + + /* Calculate the number of milliseconds since we sent the first packet */ + ms = (tv.tv_sec - session->offset.tv_sec) * 1000 + + (tv.tv_usec - session->offset.tv_usec) / 1000; + + if (ms < 0) + ms = 0; + + if(voice) { +#ifdef USE_VOICE_TS_PREDICTION + /* If we haven't most recently sent silence, and we're + * close in time, use predicted time */ + if(session->notsilenttx && abs(ms - session->nextpred) <= 240) { + /* Adjust our txcore, keeping voice and non-voice + * synchronized */ + add_ms(&session->offset, (int)(ms - session->nextpred)/10); + + if(!session->nextpred) + session->nextpred = ms; + ms = session->nextpred; + } else { + /* in this case, just use the actual time, since + * we're either way off (shouldn't happen), or we're + * ending a silent period -- and seed the next predicted + * time. Also, round ms to the next multiple of + * frame size (so our silent periods are multiples + * of frame size too) */ + int diff = ms % (f->samples / 8); + if(diff) + ms += f->samples/8 - diff; + session->nextpred = ms; + } + session->notsilenttx = 1; +#else + if(ms <= session->lastsent) + ms = session->lastsent + 3; +#endif + } else if ( video ) { + /* + * IAX2 draft 03 says that timestamps MUST be in order. + * It does not say anything about several frames having the same timestamp + * When transporting video, we can have a frame that spans multiple iax packets + * (so called slices), so it would make sense to use the same timestamp for all of + * them + * We do want to make sure that frames don't go backwards though + */ + if ( (unsigned int)ms < session->lastsent ) + ms = session->lastsent; + } else { + /* On a dataframe, use last value + 3 (to accomodate jitter buffer shrinking) + if appropriate unless it's a genuine frame */ + if (genuine) { + if ((unsigned int)ms <= session->lastsent) + ms = session->lastsent + 3; + } else if (abs(ms - session->lastsent) <= 240) { + ms = session->lastsent + 3; + } + + } + + /* Record the last sent packet for future reference */ + /* unless an AST_FRAME_IAX */ + if (!genuine) + session->lastsent = ms; + +#ifdef USE_VOICE_TS_PREDICTION + /* set next predicted ts based on 8khz samples */ + if(voice) + session->nextpred += f->samples / 8; +#endif + + return ms; +} + +static unsigned char get_n_bits_at(unsigned char *data, int n, int bit) +{ + int byte = bit / 8; /* byte containing first bit */ + int rem = 8 - (bit % 8); /* remaining bits in first byte */ + unsigned char ret = 0; + + if (n <= 0 || n > 8) + return 0; + + if (rem < n) { + ret = (data[byte] << (n - rem)); + ret |= (data[byte + 1] >> (8 - n + rem)); + } else { + ret = (data[byte] >> (rem - n)); + } + + return (ret & (0xff >> (8 - n))); +} + +static int speex_get_wb_sz_at(unsigned char *data, int len, int bit) +{ + static int SpeexWBSubModeSz[] = { + 0, 36, 112, 192, + 352, 0, 0, 0 }; + int off = bit; + unsigned char c; + + /* skip up to two wideband frames */ + if (((len * 8 - off) >= 5) && + get_n_bits_at(data, 1, off)) { + c = get_n_bits_at(data, 3, off + 1); + off += SpeexWBSubModeSz[c]; + + if (((len * 8 - off) >= 5) && + get_n_bits_at(data, 1, off)) { + c = get_n_bits_at(data, 3, off + 1); + off += SpeexWBSubModeSz[c]; + + if (((len * 8 - off) >= 5) && + get_n_bits_at(data, 1, off)) { + /* too many in a row */ + DEBU(G "\tCORRUPT too many wideband streams in a row\n"); + return -1; + } + } + + } + return off - bit; +} + +static int speex_get_samples(unsigned char *data, int len) +{ + static int SpeexSubModeSz[] = { + 0, 43, 119, 160, + 220, 300, 364, 492, + 79, 0, 0, 0, + 0, 0, 0, 0 }; + static int SpeexInBandSz[] = { + 1, 1, 4, 4, + 4, 4, 4, 4, + 8, 8, 16, 16, + 32, 32, 64, 64 }; + int bit = 0; + int cnt = 0; + int off = 0; + unsigned char c; + + DEBU(G "speex_get_samples(%d)\n", len); + while ((len * 8 - bit) >= 5) { + /* skip wideband frames */ + off = speex_get_wb_sz_at(data, len, bit); + if (off < 0) { + DEBU(G "\tERROR reading wideband frames\n"); + break; + } + bit += off; + + if ((len * 8 - bit) < 5) { + DEBU(G "\tERROR not enough bits left after wb\n"); + break; + } + + /* get control bits */ + c = get_n_bits_at(data, 5, bit); + DEBU(G "\tCONTROL: %d at %d\n", c, bit); + bit += 5; + + if (c == 15) { + DEBU(G "\tTERMINATOR\n"); + break; + } else if (c == 14) { + /* in-band signal; next 4 bits contain signal id */ + c = get_n_bits_at(data, 4, bit); + bit += 4; + DEBU(G "\tIN-BAND %d bits\n", SpeexInBandSz[c]); + bit += SpeexInBandSz[c]; + } else if (c == 13) { + /* user in-band; next 5 bits contain msg len */ + c = get_n_bits_at(data, 5, bit); + bit += 5; + DEBU(G "\tUSER-BAND %d bytes\n", c); + bit += c * 8; + } else if (c > 8) { + DEBU(G "\tUNKNOWN sub-mode %d\n", c); + break; + } else { + /* skip number bits for submode (less the 5 control bits) */ + DEBU(G "\tSUBMODE %d %d bits\n", c, SpeexSubModeSz[c]); + bit += SpeexSubModeSz[c] - 5; + + cnt += 160; /* new frame */ + } + } + DEBU(G "\tSAMPLES: %d\n", cnt); + return cnt; +} + +static inline int get_interp_len(int format) +{ + return (format == AST_FORMAT_ILBC) ? 30 : 20; +} + +static int get_sample_cnt(struct iax_event *e) +{ + int cnt = 0; + + /* + * In the case of zero length frames, do not return a cnt of 0 + */ + if ( e->datalen == 0 ) { + return get_interp_len( e->subclass ) * 8; + } + + switch (e->subclass) { + case AST_FORMAT_SPEEX: + cnt = speex_get_samples(e->data, e->datalen); + break; + case AST_FORMAT_G723_1: + cnt = 240; /* FIXME Not always the case */ + break; + case AST_FORMAT_ILBC: + cnt = 240 * (e->datalen / 50); + break; + case AST_FORMAT_GSM: + cnt = 160 * (e->datalen / 33); + break; + case AST_FORMAT_G729A: + cnt = 160 * (e->datalen / 20); + break; + case AST_FORMAT_SLINEAR: + cnt = e->datalen / 2; + break; + case AST_FORMAT_LPC10: + cnt = 22 * 8 + (((char *)(e->data))[7] & 0x1) * 8; + break; + case AST_FORMAT_ULAW: + case AST_FORMAT_ALAW: + cnt = e->datalen; + break; + case AST_FORMAT_ADPCM: + case AST_FORMAT_G726: + cnt = e->datalen * 2; + break; + default: + return 0; + } + return cnt; +} + +static int iax_xmit_frame(struct iax_frame *f) +{ + int res; +#ifdef DEBUG_SUPPORT + if (debug) { + struct ast_iax2_full_hdr *h = (struct ast_iax2_full_hdr *)f->data; + + if (ntohs(h->scallno) & IAX_FLAG_FULL) + iax_showframe(f, NULL, 0, f->transfer ? + &(f->session->transfer) : + &(f->session->peeraddr), + f->datalen - sizeof(struct ast_iax2_full_hdr)); + } +#endif + if(!iax_session_valid(f->session)) { + return 0; + } + + /* Send the frame raw */ + res = f->session->sendto(netfd, (const char *) f->data, f->datalen, + IAX_SOCKOPTS, f->transfer ? + (struct sockaddr *)&(f->session->transfer) : + (struct sockaddr *)&(f->session->peeraddr), + sizeof(f->session->peeraddr)); + return res; +} + +static int iax_reliable_xmit(struct iax_frame *f) +{ + struct iax_frame *fc; + struct ast_iax2_full_hdr *fh; + fh = (struct ast_iax2_full_hdr *) f->data; + if (!fh->type) { + return -2; + } + fc = (struct iax_frame *)malloc(sizeof(struct iax_frame)); + if (fc) { + /* Make a copy of the frame */ + memcpy(fc, f, sizeof(struct iax_frame)); + /* And a copy of the data if applicable */ + if (!fc->data || !fc->datalen) { + IAXERROR "No frame data?"); + DEBU(G "No frame data?\n"); + return -1; + } else { + fc->data = (char *)malloc(fc->datalen); + if (!fc->data) { + DEBU(G "Out of memory\n"); + IAXERROR "Out of memory\n"); + return -1; + } + memcpy(fc->data, f->data, f->datalen); + iax_sched_add(NULL, fc, NULL, NULL, fc->retrytime); + return iax_xmit_frame(fc); + } + } else + return -1; +} + +void iax_set_networking(iax_sendto_t st, iax_recvfrom_t rf) +{ + iax_sendto = st; + iax_recvfrom = rf; +} + +void iax_set_jb_target_extra( long value ) +{ + /* store in jb_target_extra, a static global */ + jb_target_extra = value ; +} + +int iax_init(int preferredportno) +{ + int portno = preferredportno; +#ifndef _MSC_VER // avoid compare of address of imported function + /* MSVC only - In certain circumstances the addresses placed in iax_sendto and iax_recvfrom + can be an offset to a jump table, making a compare of the current address to the address + of the actual imported function fail. */ + //if (iax_recvfrom == (iax_recvfrom_t)recvfrom) +#endif // !_MSC_VER + { + struct sockaddr_in sin; + socklen_t sinlen; + int flags; + int bufsize = 128 * 1024; + + if (netfd > -1) + { + /* Okay, just don't do anything */ + DEBU(G "Already initialized."); + return 0; + } + netfd = (int)socket(AF_INET, SOCK_DGRAM, IPPROTO_IP); + if (netfd < 0) + { + DEBU(G "Unable to allocate UDP socket\n"); + IAXERROR "Unable to allocate UDP socket\n"); + return -1; + } + + if (preferredportno == 0) + preferredportno = IAX_DEFAULT_PORTNO; + + if (preferredportno < 0) + preferredportno = 0; + + sin.sin_family = AF_INET; + sin.sin_addr.s_addr = 0; + sin.sin_port = htons((short)preferredportno); + if (bind(netfd, (struct sockaddr *) &sin, sizeof(sin)) < 0) + { +#if defined(WIN32) || defined(_WIN32_WCE) + if (WSAGetLastError() == WSAEADDRINUSE) +#else + if (errno == EADDRINUSE) +#endif + { + /*the port is already in use, so bind to a free port chosen by the IP stack*/ + DEBU(G "Unable to bind to preferred port - port is in use. Trying to bind to a free one"); + sin.sin_port = htons((short)0); + if (bind(netfd, (struct sockaddr *) &sin, sizeof(sin)) < 0) + { + IAXERROR "Unable to bind UDP socket\n"); + return -1; + } + } else + { + IAXERROR "Unable to bind UDP socket\n"); + return -1; + } + } + + sinlen = sizeof(sin); + if (getsockname(netfd, (struct sockaddr *) &sin, &sinlen) < 0) + { + close(netfd); + netfd = -1; + DEBU(G "Unable to figure out what I'm bound to."); + IAXERROR "Unable to determine bound port number."); + return -1; + } +#if defined(WIN32) || defined(_WIN32_WCE) + flags = 1; + if (ioctlsocket(netfd,FIONBIO,(unsigned long *) &flags)) + { + closesocket(netfd); + netfd = -1; + DEBU(G "Unable to set non-blocking mode."); + IAXERROR "Unable to set non-blocking mode."); + return -1; + } + +#else + if ((flags = fcntl(netfd, F_GETFL)) < 0) + { + close(netfd); + netfd = -1; + DEBU(G "Unable to retrieve socket flags."); + IAXERROR "Unable to retrieve socket flags."); + return -1; + } + if (fcntl(netfd, F_SETFL, flags | O_NONBLOCK) < 0) + { + close(netfd); + netfd = -1; + DEBU(G "Unable to set non-blocking mode."); + IAXERROR "Unable to set non-blocking mode."); + return -1; + } +#endif + /* Mihai: increase UDP socket buffers to avoid packet loss. */ + if (setsockopt(netfd, SOL_SOCKET, SO_RCVBUF, (char *)&bufsize, + sizeof(bufsize)) < 0) + { + DEBU(G "Unable to set receive buffer size."); + IAXERROR "Unable to set receive buffer size."); + } + + /* set send buffer size too */ + if (setsockopt(netfd, SOL_SOCKET, SO_SNDBUF, (char *)&bufsize, + sizeof(bufsize)) < 0) + { + DEBU(G "Unable to set send buffer size."); + IAXERROR "Unable to set send buffer size."); + } + + portno = ntohs(sin.sin_port); + DEBU(G "Started on port %d\n", portno); + } + + iax_seed_random(); + callnums = 1 + (int)(32767.0 * (iax_random() / (RAND_MAX + 1.0))); + + return portno; +} + +static void destroy_session(struct iax_session *session); + +static void convert_reply(char *out, unsigned char *in) +{ + int x; + for (x=0;x<16;x++) + sprintf(out + (x << 1), "%2.2x", (int)in[x]); +} + +static unsigned char compress_subclass(int subclass) +{ + int x; + int power=-1; + /* If it's 128 or smaller, just return it */ + if (subclass < IAX_FLAG_SC_LOG) + return subclass; + /* Otherwise find its power */ + for (x = 0; x < IAX_MAX_SHIFT; x++) { + if (subclass & (1 << x)) { + if (power > -1) { + DEBU(G "Can't compress subclass %d\n", subclass); + return 0; + } else + power = x; + } + } + return power | IAX_FLAG_SC_LOG; +} + +static int iax_send(struct iax_session *pvt, struct ast_frame *f, unsigned int ts, int seqno, int now, int transfer, int final, int fullframe) +{ + /* Queue a packet for delivery on a given private structure. Use "ts" for + timestamp, or calculate if ts is 0. Send immediately without retransmission + or delayed, with retransmission */ + struct ast_iax2_full_hdr *fh; + struct ast_iax2_mini_hdr *mh; + struct ast_iax2_video_hdr *vh; + //unsigned char buf[5120]; //fd: changed max packet size[5120]; + unsigned char buf[32 * 1024]; //Mihai: let's see if this is where it crashes + + struct iax_frame *fr; + int res; + int sendmini=0; + unsigned int lastsent; + unsigned int fts; + + if (!pvt) + { + IAXERROR "No private structure for packet?\n"); + return -1; + } + + /* this must come before the next call to calc_timestamp() since + calc_timestamp() will change lastsent to the returned value */ + lastsent = pvt->lastsent; + + /* Calculate actual timestamp */ + fts = calc_timestamp(pvt, ts, f); + + if (((fts & 0xFFFF0000L) == (lastsent & 0xFFFF0000L)) + /* High two bits are the same on timestamp, or sending on a trunk */ && + (f->frametype == AST_FRAME_VOICE) + /* is a voice frame */ && + (f->subclass == pvt->svoiceformat) + /* is the same type */ ) + { + /* Force immediate rather than delayed transmission */ + now = 1; + /* Mark that mini-style frame is appropriate */ + sendmini = 1; + } + + /* Bitmask taken from chan_iax2.c... I must ask Mark Spencer for this? I think not... */ + if ( f->frametype == AST_FRAME_VIDEO ) + { + /* Check if the timestamp has rolled over or if the video codec has changed */ + if ( ((fts & 0xFFFF8000L) == (pvt->lastvsent & 0xFFFF8000L)) && + (f->subclass == pvt->svideoformat) + ) + { + /* send a mini video frame immediately */ + now = 1; + sendmini = 1; + } else + { + /* we want to send a fullframe and be able to retransmit it */ + now = 0; + sendmini = 0; + } + pvt->lastvsent = fts; + } + + /* if requested, force a full frame */ + if ( fullframe ) + { + now = 0; + sendmini = 0; + } + + /* Allocate an iax_frame */ + if (now) + { + fr = (struct iax_frame *) buf; + } else + { + fr = iax_frame_new(DIRECTION_OUTGRESS, f->datalen); + if ( fr == NULL ) + { + IAXERROR "Out of memory\n"); + return -1; + } + } + + /* Copy our prospective frame into our immediate or retransmitted wrapper */ + iax_frame_wrap(fr, f); + + fr->ts = fts; + if (!fr->ts) + { + IAXERROR "timestamp is 0?\n"); + if (!now) + iax_frame_free(fr); + return -1; + } + + fr->callno = pvt->callno; + fr->transfer = transfer; + fr->final = final; + fr->session = pvt; + if (!sendmini) + { + /* We need a full frame */ + if (seqno > -1) + fr->oseqno = seqno; + else + fr->oseqno = pvt->oseqno++; + fr->iseqno = pvt->iseqno; + fh = (struct ast_iax2_full_hdr *)(((char *)fr->af.data) - sizeof(struct ast_iax2_full_hdr)); + fh->scallno = htons(fr->callno | IAX_FLAG_FULL); + fh->ts = htonl(fr->ts); + fh->oseqno = fr->oseqno; + if (transfer) + { + fh->iseqno = 0; + } else + fh->iseqno = fr->iseqno; + /* Keep track of the last thing we've acknowledged */ + pvt->aseqno = fr->iseqno; + fh->type = fr->af.frametype & 0xFF; + if (f->frametype == AST_FRAME_VIDEO) + fh->csub = compress_subclass(fr->af.subclass & ~0x1) | ((fr->af.subclass & 0x1) << 6); + else + fh->csub = compress_subclass(fr->af.subclass); + if (transfer) + { + fr->dcallno = pvt->transfercallno; + } else + fr->dcallno = pvt->peercallno; + fh->dcallno = htons(fr->dcallno); + fr->datalen = fr->af.datalen + sizeof(struct ast_iax2_full_hdr); + fr->data = fh; + fr->retries = maxretries; + /* Retry after 2x the ping time has passed */ + fr->retrytime = pvt->pingtime * 2; + if (fr->retrytime < MIN_RETRY_TIME) + fr->retrytime = MIN_RETRY_TIME; + if (fr->retrytime > MAX_RETRY_TIME) + fr->retrytime = MAX_RETRY_TIME; + /* Acks' don't get retried */ + if ((f->frametype == AST_FRAME_IAX) && (f->subclass == IAX_COMMAND_ACK)) + fr->retries = -1; + if (f->frametype == AST_FRAME_VOICE) + { + pvt->svoiceformat = f->subclass; + } + else if (f->frametype == AST_FRAME_VIDEO) + { + pvt->svideoformat = f->subclass & ~0x1; + } + if (now) + { + res = iax_xmit_frame(fr); + } else + res = iax_reliable_xmit(fr); + } else + { + if (fr->af.frametype == AST_FRAME_VIDEO) + { + /* Video frame have no sequence number */ + fr->oseqno = -1; + fr->iseqno = -1; + vh = (struct ast_iax2_video_hdr *)(((char* )fr->af.data) - sizeof(struct ast_iax2_video_hdr)); + vh->zeros = 0; + vh->callno = htons(0x8000 | fr->callno); + vh->ts = htons((fr->ts & 0x7FFF) | (fr->af.subclass & 0x1 ? 0x8000 : 0)); + fr->datalen = fr->af.datalen + sizeof(struct ast_iax2_video_hdr); + fr->data = vh; + fr->retries = -1; + res = iax_xmit_frame(fr); + } else + { + /* Mini-frames have no sequence number */ + fr->oseqno = -1; + fr->iseqno = -1; + /* Mini frame will do */ + mh = (struct ast_iax2_mini_hdr *)(((char *)fr->af.data) - sizeof(struct ast_iax2_mini_hdr)); + mh->callno = htons(fr->callno); + mh->ts = htons(fr->ts & 0xFFFF); + fr->datalen = fr->af.datalen + sizeof(struct ast_iax2_mini_hdr); + fr->data = mh; + fr->retries = -1; + res = iax_xmit_frame(fr); + } + } + if( !now && fr!=NULL ) + iax_frame_free( fr ); + return res; +} + +#if 0 +static int iax_predestroy(struct iax_session *pvt) +{ + if (!pvt) { + return -1; + } + if (!pvt->alreadygone) { + /* No more pings or lagrq's */ + if (pvt->pingid > -1) + ast_sched_del(sched, pvt->pingid); + if (pvt->lagid > -1) + ast_sched_del(sched, pvt->lagid); + if (pvt->autoid > -1) + ast_sched_del(sched, pvt->autoid); + if (pvt->initid > -1) + ast_sched_del(sched, pvt->initid); + pvt->pingid = -1; + pvt->lagid = -1; + pvt->autoid = -1; + pvt->initid = -1; + pvt->alreadygone = 1; + } + return 0; +} +#endif + +static int __send_command(struct iax_session *i, char type, int command, + unsigned int ts, unsigned char *data, int datalen, int seqno, + int now, int transfer, int final, int fullframe, int samples) +{ + struct ast_frame f; + f.frametype = type; + f.subclass = command; + f.datalen = datalen; + f.samples = samples; + f.mallocd = 0; + f.offset = 0; +#ifdef __GNUC__ + f.src = (char *) __FUNCTION__; +#else + f.src = (char *) __FILE__; +#endif + f.data = data; + return iax_send(i, &f, ts, seqno, now, transfer, final, fullframe); +} + +static int send_command(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen, int seqno) +{ + return __send_command(i, type, command, ts, data, datalen, seqno, 0, 0, 0, 0, 0); +} + +static int send_command_video(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen, int seqno, int fullframe) +{ + return __send_command(i, type, command, ts, data, datalen, seqno, 1, 0, 0, fullframe, 0); +} + +static int send_command_final(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen, int seqno) +{ +#if 0 + /* It is assumed that the callno has already been locked */ + iax_predestroy(i); +#endif + int r; + r = __send_command(i, type, command, ts, data, datalen, seqno, 0, 0, 1, 0, 0); + if (r >= 0) destroy_session(i); + return r; +} + +static int send_command_immediate(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen, int seqno) +{ + return __send_command(i, type, command, ts, data, datalen, seqno, 1, 0, 0, 0, 0); +} + +static int send_command_transfer(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen) +{ + return __send_command(i, type, command, ts, data, datalen, 0, 0, 1, 0, 0, 0); +} + +static int send_command_samples(struct iax_session *i, char type, int command, unsigned int ts, unsigned char *data, int datalen, int seqno, int samples) +{ + return __send_command(i, type, command, ts, data, datalen, seqno, 0, 0, 0, 0, samples); +} + +int iax_key_radio(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_KEY, 0, NULL, 0, -1); +} + +int iax_unkey_radio(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_UNKEY, 0, NULL, 0, -1); +} + +int iax_transfer(struct iax_session *session, const char *number) +{ + static int res; //Return Code + struct iax_ie_data ied; //IE Data Structure (Stuff To Send) + + // Clear The Memory Used For IE Buffer + memset(&ied, 0, sizeof(ied)); + + // Copy The Transfer Destination Into The IE Structure + iax_ie_append_str(&ied, IAX_IE_CALLED_NUMBER, number); + + // Send The Transfer Command - Asterisk Will Handle The Rest! + res = send_command(session, AST_FRAME_IAX, IAX_COMMAND_TRANSFER, 0, ied.buf, ied.pos, -1); + + // Return Success + return 0; +} + +static void stop_transfer(struct iax_session *session) +{ + struct iax_sched *sch; + + sch = schedq; + while(sch) { + if (sch->frame && (sch->frame->session == session)) + sch->frame->retries = -1; + sch = sch->next; + } +} /* stop_transfer */ + +static void complete_transfer(struct iax_session *session, int peercallno, int xfr2peer, int preserveSeq) +{ + jb_frame frame; + + session->peercallno = peercallno; + /* Change from transfer to session now */ + if (xfr2peer) { + memcpy(&session->peeraddr, &session->transfer, sizeof(session->peeraddr)); + memset(&session->transfer, 0, sizeof(session->transfer)); + session->transferring = TRANSFER_NONE; + session->transferpeer = 0; + session->transfer_moh = 0; + /* Force retransmission of a real voice packet, and reset all timing */ + session->svoiceformat = -1; + session->voiceformat = 0; + session->svideoformat = -1; + session->videoformat = 0; + } + + memset(&session->rxcore, 0, sizeof(session->rxcore)); + memset(&session->offset, 0, sizeof(session->offset)); + + /* Reset jitterbuffer */ + while(jb_getall(session->jb,&frame) == JB_OK) + iax_event_free((struct iax_event *)frame.data); + + jb_reset(session->jb); + + if (! preserveSeq) + { + /* Reset sequence numbers */ + session->aseqno = 0; + session->oseqno = 0; + session->iseqno = 0; + } + + session->lastsent = 0; + session->last_ts = 0; + session->pingtime = 30; + /* We have to dump anything we were going to (re)transmit now that we've been + transferred since they're all invalid and for the old host. */ + stop_transfer(session); +} /* complete_transfer */ + +int iax_setup_transfer(struct iax_session *org_session, struct iax_session *new_session) +{ + int res; + struct iax_ie_data ied0; + struct iax_ie_data ied1; + + struct iax_session *s0 = org_session; + struct iax_session *s1 = new_session; + + int transfer_id = 1 + (int)(32767.0 * (iax_random() / (RAND_MAX + 1.0))); + + memset(&ied0, 0, sizeof(ied0)); + + memset(&ied1, 0, sizeof(ied1)); + + /* reversed setup */ + iax_ie_append_addr(&ied0, IAX_IE_APPARENT_ADDR, &s1->peeraddr); + iax_ie_append_short(&ied0, IAX_IE_CALLNO, s1->peercallno); + iax_ie_append_int(&ied0, IAX_IE_TRANSFERID, transfer_id); + + iax_ie_append_addr(&ied1, IAX_IE_APPARENT_ADDR, &s0->peeraddr); + iax_ie_append_short(&ied1, IAX_IE_CALLNO, s0->peercallno); + iax_ie_append_int(&ied1, IAX_IE_TRANSFERID, transfer_id); + + s0->transfer = s1->peeraddr; + s1->transfer = s0->peeraddr; + + s0->transferid = transfer_id; + s1->transferid = transfer_id; + + s0->transfercallno = s0->peercallno; + s1->transfercallno = s1->peercallno; + + s0->transferring = TRANSFER_BEGIN; + s1->transferring = TRANSFER_BEGIN; + + s0->transferpeer = s1->callno; + s1->transferpeer = s0->callno; +#ifdef DEBUG_SUPPORT + if (debug) { + DEBU(G "iax_setup_transfer(%d, %d) transfer_id=%d\n", s0->callno, s1->callno, transfer_id); + DEBU(G "\torg: callno=%d peercallno=%d peeraddr=%s peerport=%d\n", s0->callno, s0->peercallno, inet_ntoa(s0->peeraddr.sin_addr), ntohs(s0->peeraddr.sin_port)); + DEBU(G "\tnew: callno=%d peercallno=%d peeraddr=%s peerport=%d\n", s1->callno, s1->peercallno, inet_ntoa(s1->peeraddr.sin_addr), ntohs(s1->peeraddr.sin_port)); + } +#endif + + res = send_command(s0, AST_FRAME_IAX, IAX_COMMAND_TXREQ, 0, ied0.buf, ied0.pos, -1); + if (res < 0) { + return -1; + } + + res = send_command(s1, AST_FRAME_IAX, IAX_COMMAND_TXREQ, 0, ied1.buf, ied1.pos, -1); + if (res < 0) { + return -1; + } + + return 0; +} + +static int iax_finish_transfer(struct iax_session *s, short new_peer) +{ + int res; + struct iax_ie_data ied; + + memset(&ied, 0, sizeof(ied)); + + iax_ie_append_short(&ied, IAX_IE_CALLNO, new_peer); + + res = send_command(s, AST_FRAME_IAX, IAX_COMMAND_TXREL, 0, ied.buf, ied.pos, -1); + + complete_transfer(s, new_peer, 0, 1); + + return res; + +} + +static struct iax_session *iax_find_session2(short callno) +{ + struct iax_session *cur = sessions; + + while(cur) { + if (callno == cur->callno && callno != 0) { + return cur; + } + cur = cur->next; + } + + return NULL; +} + +static int iax_handle_txready(struct iax_session *s) +{ + struct iax_session *s0, *s1; + short s0_org_peer, s1_org_peer; + + if (s->transfer_moh) { + s->transfer_moh = 0; + iax_unquelch(s); + } + + complete_transfer(s, s->peercallno, 0, 1); + + s->transferring = TRANSFER_REL; + + s0 = s; + s1 = iax_find_session2(s0->transferpeer); + + if (s1 != NULL && + s1->callno == s0->transferpeer && + s0->transferring == TRANSFER_REL && + s1->transferring == TRANSFER_REL) { + + s0_org_peer = s0->peercallno; + s1_org_peer = s1->peercallno; + + iax_finish_transfer(s0, s1_org_peer); + iax_finish_transfer(s1, s0_org_peer); + return 1; + } + + return 0; +} + +static void iax_handle_txreject(struct iax_session *s) +{ + struct iax_session *s0, *s1; + + s0 = s; + s1 = iax_find_session2(s0->transferpeer); + if (s1 != NULL && + s0->transferpeer == s1->callno && + s1->transferring) { + if (s1->transfer_moh) { + s1->transfer_moh = 0; + send_command_immediate(s1, AST_FRAME_IAX, IAX_COMMAND_UNQUELCH, 0, NULL, 0, s1->iseqno); + } + } + if (s0->transfer_moh) { + s0->transfer_moh = 0; + send_command_immediate(s0, AST_FRAME_IAX, IAX_COMMAND_UNQUELCH, 0, NULL, 0, s0->iseqno); + } + + memset(&s->transfer, 0, sizeof(s->transfer)); + s->transferring = TRANSFER_NONE; + s->transferpeer = 0; + s->transfer_moh = 0; +} + +static void destroy_session(struct iax_session *session) +{ + struct iax_session *cur, *prev=NULL; + struct iax_sched *curs, *prevs=NULL, *nexts=NULL; + int loop_cnt=0; + curs = schedq; + while(curs) { + nexts = curs->next; + if (curs->frame && curs->frame->session == session) { + /* Just mark these frames as if they've been sent */ + curs->frame->retries = -1; + } else if (curs->event && curs->event->session == session) { + if (prevs) + prevs->next = nexts; + else + schedq = nexts; + if (curs->event) + iax_event_free(curs->event); + free(curs); + } else { + prevs = curs; + } + curs = nexts; + loop_cnt++; + } + + cur = sessions; + while(cur) { + if (cur == session) { + jb_frame frame; + + if (prev) + prev->next = session->next; + else + sessions = session->next; + + while(jb_getall(session->jb,&frame) == JB_OK) + iax_event_free((struct iax_event *)frame.data); + + jb_destroy(session->jb); + + free(session); + return; + } + prev = cur; + cur = cur->next; + } +} + +static int iax_send_lagrp(struct iax_session *session, unsigned int ts); +static int iax_send_pong(struct iax_session *session, unsigned int ts); + +static struct iax_event *handle_event(struct iax_event *event) +{ + /* We have a candidate event to be delievered. Be sure + the session still exists. */ + if (event) + { + if ( event->etype == IAX_EVENT_NULL ) return event; + if (iax_session_valid(event->session)) + { + /* Lag requests are never actually sent to the client, but + other than that are handled as normal packets */ + switch(event->etype) + { + /* the user on the outside may need to look at the session so we will not free + it here anymore we will test for hangup event in iax_event_free and do it + there. + */ + case IAX_EVENT_REJECT: + case IAX_EVENT_HANGUP: + /* Destroy this session -- it's no longer valid */ + destroy_session(event->session); + return event; + case IAX_EVENT_LAGRQ: + event->etype = IAX_EVENT_LAGRP; + iax_send_lagrp(event->session, event->ts); + iax_event_free(event); + break; + case IAX_EVENT_PING: + event->etype = IAX_EVENT_PONG; + iax_send_pong(event->session, event->ts); + iax_event_free(event); + break; + case IAX_EVENT_POKE: + event->etype = IAX_EVENT_PONG; + iax_send_pong(event->session, event->ts); + destroy_session(event->session); + iax_event_free(event); + break; + default: + return event; + } + } else + iax_event_free(event); + } + return NULL; +} + +static int iax2_vnak(struct iax_session *session) +{ + /* send vnak just once for a given sequence number */ + if ( (unsigned char)(session->lastvnak - session->iseqno) < 128 ) + { + return 0; + } + + session->lastvnak = session->iseqno; + return send_command_immediate(session, AST_FRAME_IAX, IAX_COMMAND_VNAK, 0, NULL, 0, session->iseqno); +} + +int iax_send_dtmf(struct iax_session *session, char digit) +{ + return send_command(session, AST_FRAME_DTMF, digit, 0, NULL, 0, -1); +} + +int iax_send_voice(struct iax_session *session, int format, unsigned char *data, int datalen, int samples) +{ + /* Send a (possibly compressed) voice frame */ + if (!session->quelch) + return send_command_samples(session, AST_FRAME_VOICE, format, 0, data, datalen, -1, samples); + return 0; +} + +int iax_send_cng(struct iax_session *session, int level, unsigned char *data, + int datalen) +{ +#ifdef USE_VOICE_TS_PREDICTION + session->notsilenttx = 0; +#endif + return send_command(session, AST_FRAME_CNG, level, 0, data, datalen, -1); +} + +int iax_send_image(struct iax_session *session, int format, unsigned char *data, + int datalen) +{ + /* Send an image frame */ + return send_command(session, AST_FRAME_IMAGE, format, 0, data, datalen, -1); +} + +int iax_send_video(struct iax_session *session, int format, unsigned char *data, + int datalen, int fullframe) +{ + if (!session->quelch) + { + int res = send_command_video(session, AST_FRAME_VIDEO, format, + 0, data, datalen, -1, fullframe); + return res; + } + return 0; +} + +int iax_send_video_trunk(struct iax_session *session, int format, + char *data, int datalen, int fullframe, int ntrunk) +{ + static int my_lastts = 0; + + if ( ntrunk == 0 ) + my_lastts = calc_timestamp(session, 0, NULL); + + if ( !session->quelch ) + { + return send_command_video(session, AST_FRAME_VIDEO, format, + my_lastts, (unsigned char *)data, datalen, -1, + fullframe); + } + return 0; +} + +int iax_video_bypass_jitter(struct iax_session *s, int mode) +{ + video_bypass_jitterbuffer = mode; + return 0; +} + +int iax_register(struct iax_session *session, const char *server, const char *peer, const char *secret, int refresh) +{ + /* Send a registration request */ + char tmp[256]; + char *p; + int res; + int portno = IAX_DEFAULT_PORTNO; + struct iax_ie_data ied; + struct hostent *hp; + + tmp[255] = '\0'; + strncpy(tmp, server, sizeof(tmp) - 1); + p = strchr(tmp, ':'); + if (p) { + *p = '\0'; + portno = atoi(p+1); + } + + memset(&ied, 0, sizeof(ied)); + if (secret) + strncpy(session->secret, secret, sizeof(session->secret) - 1); + else + strcpy(session->secret, ""); + + memset(&session->unregreason, 0, sizeof(session->unregreason)); + + /* Connect first */ + hp = gethostbyname(tmp); + if (!hp) { + snprintf(iax_errstr, sizeof(iax_errstr), "Invalid hostname: %s", tmp); + return -1; + } + memcpy(&session->peeraddr.sin_addr, hp->h_addr, sizeof(session->peeraddr.sin_addr)); + session->peeraddr.sin_port = htons(portno); + session->peeraddr.sin_family = AF_INET; + strncpy(session->username, peer, sizeof(session->username) - 1); + session->refresh = refresh; + iax_ie_append_str(&ied, IAX_IE_USERNAME, peer); + iax_ie_append_short(&ied, IAX_IE_REFRESH, refresh); + res = send_command(session, AST_FRAME_IAX, IAX_COMMAND_REGREQ, 0, ied.buf, ied.pos, -1); + return res; +} + +int iax_unregister(struct iax_session *session, const char *server, const char *peer, const char *secret, const char *reason) +{ + /* Send an unregistration request */ + char tmp[256]; + char *p; + int portno = IAX_DEFAULT_PORTNO; + struct iax_ie_data ied; + struct hostent *hp; + + tmp[255] = '\0'; + strncpy(tmp, server, sizeof(tmp) - 1); + p = strchr(tmp, ':'); + if (p) { + *p = '\0'; + portno = atoi(p+1); + } + + memset(&ied, 0, sizeof(ied)); + if (secret) + strncpy(session->secret, secret, sizeof(session->secret) - 1); + else + strcpy(session->secret, ""); + + if (reason && strlen(reason)) + strncpy(session->unregreason, reason, sizeof(session->unregreason) - 1); + else + strcpy(session->unregreason, "Unspecified"); + + /* Connect first */ + hp = gethostbyname(tmp); + if (!hp) { + snprintf(iax_errstr, sizeof(iax_errstr), "Invalid hostname: %s", tmp); + return -1; + } + memcpy(&session->peeraddr.sin_addr, hp->h_addr, sizeof(session->peeraddr.sin_addr)); + session->peeraddr.sin_port = htons(portno); + session->peeraddr.sin_family = AF_INET; + strncpy(session->username, peer, sizeof(session->username) - 1); + iax_ie_append_str(&ied, IAX_IE_USERNAME, peer); + iax_ie_append_str(&ied, IAX_IE_CAUSE, session->unregreason); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_REGREL, 0, ied.buf, ied.pos, -1); +} + +int iax_reject(struct iax_session *session, char *reason) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_CAUSE, reason ? reason : "Unspecified"); + return send_command_final(session, AST_FRAME_IAX, IAX_COMMAND_REJECT, 0, ied.buf, ied.pos, -1); +} + +int iax_hangup(struct iax_session *session, char *byemsg) +{ + struct iax_ie_data ied; + iax_sched_del(NULL, NULL, send_ping, (void *) session, 1); + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_CAUSE, byemsg ? byemsg : "Normal clearing"); + return send_command_final(session, AST_FRAME_IAX, IAX_COMMAND_HANGUP, 0, ied.buf, ied.pos, -1); +} + +int iax_sendurl(struct iax_session *session, char *url) +{ + return send_command(session, AST_FRAME_HTML, AST_HTML_URL, 0, + (unsigned char *)url, (int)strlen(url), -1); +} + +int iax_ring_announce(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_RINGING, 0, NULL, 0, -1); +} + +int iax_lag_request(struct iax_session *session) +{ + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_LAGRQ, 0, NULL, 0, -1); +} + +int iax_busy(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_BUSY, 0, NULL, 0, -1); +} + +int iax_congestion(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_CONGESTION, 0, NULL, 0, -1); +} + + +int iax_accept(struct iax_session *session, int format) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_int(&ied, IAX_IE_FORMAT, format); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_ACCEPT, 0, ied.buf, ied.pos, -1); +} + +int iax_answer(struct iax_session *session) +{ + return send_command(session, AST_FRAME_CONTROL, AST_CONTROL_ANSWER, 0, NULL, 0, -1); +} + +int iax_load_complete(struct iax_session *session) +{ + return send_command(session, AST_FRAME_HTML, AST_HTML_LDCOMPLETE, 0, NULL, 0, -1); +} + +int iax_send_url(struct iax_session *session, const char *url, int link) +{ + return send_command(session, AST_FRAME_HTML, + link ? AST_HTML_LINKURL : AST_HTML_URL, 0, + (unsigned char *)url, (int)strlen(url), -1); +} + +int iax_send_text(struct iax_session *session, const char *text) +{ + return send_command(session, AST_FRAME_TEXT, 0, 0, + (unsigned char *)text, (int)strlen(text) + 1, -1); +} + +int iax_send_unlink(struct iax_session *session) +{ + return send_command(session, AST_FRAME_HTML, AST_HTML_UNLINK, 0, NULL, 0, -1); +} + +int iax_send_link_reject(struct iax_session *session) +{ + return send_command(session, AST_FRAME_HTML, AST_HTML_LINKREJECT, 0, NULL, 0, -1); +} + +static int iax_send_pong(struct iax_session *session, unsigned int ts) +{ + struct iax_ie_data ied; + jb_info stats; + + memset(&ied, 0, sizeof(ied)); + + jb_getinfo(session->jb, &stats); + + iax_ie_append_int(&ied,IAX_IE_RR_JITTER, stats.jitter); + /* XXX: should be short-term loss pct.. */ + if(stats.frames_in == 0) stats.frames_in = 1; + iax_ie_append_int(&ied,IAX_IE_RR_LOSS, + ((0xff & (stats.losspct/1000)) << 24 | + (stats.frames_lost & 0x00ffffff))); + iax_ie_append_int(&ied,IAX_IE_RR_PKTS, stats.frames_in); + iax_ie_append_short(&ied,IAX_IE_RR_DELAY, + (unsigned short)(stats.current - stats.min)); + iax_ie_append_int(&ied,IAX_IE_RR_DROPPED, stats.frames_dropped); + iax_ie_append_int(&ied,IAX_IE_RR_OOO, stats.frames_ooo); + + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_PONG, ts, ied.buf, ied.pos, -1); +} + +/* external API; deprecated since we send pings ourselves now (finally) */ +int iax_send_ping(struct iax_session *session) +{ + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_PING, 0, NULL, 0, -1); +} + +/* scheduled ping sender; sends ping, then reschedules */ +static void send_ping(void *s) +{ + struct iax_session *session = (struct iax_session *)s; + + /* important, eh? */ + if(!iax_session_valid(session)) return; + + send_command(session, AST_FRAME_IAX, IAX_COMMAND_PING, 0, NULL, 0, -1); + session->pingid = iax_sched_add(NULL,NULL, send_ping, (void *)session, ping_time * 1000); + return; +} + +static int iax_send_lagrp(struct iax_session *session, unsigned int ts) +{ + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_LAGRP, ts, NULL, 0, -1); +} + +static int iax_send_txcnt(struct iax_session *session) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_int(&ied, IAX_IE_TRANSFERID, session->transferid); + return send_command_transfer(session, AST_FRAME_IAX, IAX_COMMAND_TXCNT, 0, ied.buf, ied.pos); +} + +static int iax_send_txrej(struct iax_session *session) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_int(&ied, IAX_IE_TRANSFERID, session->transferid); + return send_command_transfer(session, AST_FRAME_IAX, IAX_COMMAND_TXREJ, 0, ied.buf, ied.pos); +} + +static int iax_send_txaccept(struct iax_session *session) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_int(&ied, IAX_IE_TRANSFERID, session->transferid); + return send_command_transfer(session, AST_FRAME_IAX, IAX_COMMAND_TXACC, 0, ied.buf, ied.pos); +} + +static int iax_send_txready(struct iax_session *session) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + /* see asterisk chan_iax2.c */ + iax_ie_append_short(&ied, IAX_IE_CALLNO, session->callno); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_TXREADY, 0, ied.buf, ied.pos, -1); +} + +int iax_auth_reply(struct iax_session *session, char *password, char *challenge, int methods) +{ + char reply[16]; + struct MD5Context md5; + char realreply[256]; + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + if ((methods & IAX_AUTH_MD5) && challenge) { + MD5Init(&md5); + MD5Update(&md5, (const unsigned char *) challenge, + (unsigned int)strlen(challenge)); + MD5Update(&md5, (const unsigned char *) password, + (unsigned int)strlen(password)); + MD5Final((unsigned char *) reply, &md5); + memset(realreply, 0, sizeof(realreply)); + convert_reply(realreply, (unsigned char *) reply); + iax_ie_append_str(&ied, IAX_IE_MD5_RESULT, realreply); + } else { + iax_ie_append_str(&ied, IAX_IE_PASSWORD, password); + } + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_AUTHREP, 0, ied.buf, ied.pos, -1); +} + +static int iax_regauth_reply(struct iax_session *session, char *password, char *challenge, int methods) +{ + char reply[16]; + struct MD5Context md5; + char realreply[256]; + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_USERNAME, session->username); + if ((methods & IAX_AUTHMETHOD_MD5) && challenge) { + MD5Init(&md5); + MD5Update(&md5, (const unsigned char *) challenge, + (unsigned int)strlen(challenge)); + MD5Update(&md5, (const unsigned char *) password, + (unsigned int)strlen(password)); + MD5Final((unsigned char *) reply, &md5); + memset(realreply, 0, sizeof(realreply)); + convert_reply(realreply, (unsigned char *) reply); + iax_ie_append_str(&ied, IAX_IE_MD5_RESULT, realreply); + } else { + iax_ie_append_str(&ied, IAX_IE_PASSWORD, password); + } + if (strlen(session->unregreason)) { /* Non-zero unregreason length indicates REGREL */ + iax_ie_append_str(&ied, IAX_IE_CAUSE, session->unregreason); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_REGREL, 0, ied.buf, ied.pos, -1); + } else { + iax_ie_append_short(&ied, IAX_IE_REFRESH, session->refresh); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_REGREQ, 0, ied.buf, ied.pos, -1); + } +} + + +int iax_dial(struct iax_session *session, char *number) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_CALLED_NUMBER, number); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_DIAL, 0, ied.buf, ied.pos, -1); +} + +int iax_quelch(struct iax_session *session) +{ + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_QUELCH, 0, NULL, 0, -1); +} + +int iax_unquelch(struct iax_session *session) +{ + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_UNQUELCH, 0, NULL, 0, -1); +} + +int iax_dialplan_request(struct iax_session *session, char *number) +{ + struct iax_ie_data ied; + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_CALLED_NUMBER, number); + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_DPREQ, 0, ied.buf, ied.pos, -1); +} + +static inline int which_bit(unsigned int i) +{ + char x; + for(x = 0; x < 32; x++) { + if ((1U << x) == i) { + return x + 1; + } + } + return 0; +} + +char iax_pref_codec_add(struct iax_session *session, unsigned int format) +{ + int diff = (int) 'A'; + session->codec_order[session->codec_order_len++] = (which_bit(format)) + diff; + session->codec_order[session->codec_order_len] = '\0'; + return session->codec_order[session->codec_order_len-1]; +} + + +void iax_pref_codec_del(struct iax_session *session, unsigned int format) +{ + int diff = (int) 'A'; + int x; + char old[32]; + char remove = which_bit(format) + diff; + + strncpy(old, session->codec_order, sizeof(old)); + session->codec_order_len = 0; + + for (x = 0; x < (int) strlen(old); x++) { + if (old[x] != remove) { + session->codec_order[session->codec_order_len++] = old[x]; + } + } + session->codec_order[session->codec_order_len] = '\0'; +} + +int iax_pref_codec_get(struct iax_session *session, unsigned int *array, int len) +{ + int diff = (int) 'A'; + int x; + + for (x = 0; x < session->codec_order_len && x < len; x++) { + array[x] = (1 << (session->codec_order[x] - diff - 1)); + } + + return x; +} + +int iax_call(struct iax_session *session, const char *cidnum, const char *cidname, const char *ich, const char *lang, int wait, int formats, int capabilities) +{ + char tmp[256]=""; + char *part1, *part2; + int res; + int portno; + char *username, *hostname, *secret, *context, *exten, *dnid; + struct iax_ie_data ied; + struct hostent *hp; + /* We start by parsing up the temporary variable which is of the form of: + [user@]peer[:portno][/exten[@context]] */ + if (!ich) { + IAXERROR "Invalid IAX Call Handle\n"); + DEBU(G "Invalid IAX Call Handle\n"); + return -1; + } + memset(&ied, 0, sizeof(ied)); + strncpy(tmp, ich, sizeof(tmp) - 1); + iax_ie_append_short(&ied, IAX_IE_VERSION, IAX_PROTO_VERSION); + if (cidnum) + iax_ie_append_str(&ied, IAX_IE_CALLING_NUMBER, cidnum); + if (cidname) + iax_ie_append_str(&ied, IAX_IE_CALLING_NAME, cidname); + + if (session->codec_order_len) { + iax_ie_append_str(&ied, IAX_IE_CODEC_PREFS, session->codec_order); + } + + session->capability = capabilities; + session->pingid = iax_sched_add(NULL,NULL, send_ping, (void *)session, 2 * 1000); + + /* XXX We should have a preferred format XXX */ + iax_ie_append_int(&ied, IAX_IE_FORMAT, formats); + iax_ie_append_int(&ied, IAX_IE_CAPABILITY, capabilities); + if (lang) + iax_ie_append_str(&ied, IAX_IE_LANGUAGE, lang); + + /* Part 1 is [user[:password]@]peer[:port] */ + part1 = strtok(tmp, "/"); + + /* Part 2 is exten[@context] if it is anything all */ + part2 = strtok(NULL, "/"); + + if (strchr(part1, '@')) { + username = strtok(part1, "@"); + hostname = strtok(NULL, "@"); + } else { + username = NULL; + hostname = part1; + } + + if (username && strchr(username, ':')) { + username = strtok(username, ":"); + secret = strtok(NULL, ":"); + } else + secret = NULL; + + if(username) + strncpy(session->username, username, sizeof(session->username) - 1); + + if(secret) + strncpy(session->secret, secret, sizeof(session->secret) - 1); + + if (strchr(hostname, ':')) { + strtok(hostname, ":"); + portno = atoi(strtok(NULL, ":")); + } else { + portno = IAX_DEFAULT_PORTNO; + } + if (part2) { + exten = strtok(part2, "@"); + dnid = exten; + context = strtok(NULL, "@"); + } else { + exten = NULL; + dnid = NULL; + context = NULL; + } + if (username) + iax_ie_append_str(&ied, IAX_IE_USERNAME, username); + if (exten && strlen(exten)) + iax_ie_append_str(&ied, IAX_IE_CALLED_NUMBER, exten); + if (dnid && strlen(dnid)) + iax_ie_append_str(&ied, IAX_IE_DNID, dnid); + if (context && strlen(context)) + iax_ie_append_str(&ied, IAX_IE_CALLED_CONTEXT, context); + + /* Setup host connection */ + hp = gethostbyname(hostname); + if (!hp) { + snprintf(iax_errstr, sizeof(iax_errstr), "Invalid hostname: %s", hostname); + return -1; + } + memcpy(&session->peeraddr.sin_addr, hp->h_addr, sizeof(session->peeraddr.sin_addr)); + session->peeraddr.sin_port = htons(portno); + session->peeraddr.sin_family = AF_INET; + res = send_command(session, AST_FRAME_IAX, IAX_COMMAND_NEW, 0, ied.buf, ied.pos, -1); + if (res < 0) + return res; + if (wait) { + DEBU(G "Waiting not yet implemented\n"); + return -1; + } + return res; +} + +static int calc_rxstamp(struct iax_session *session) +{ + struct timeval tv; + int ms; + + if (!session->rxcore.tv_sec && !session->rxcore.tv_usec) { + session->rxcore = iax_tvnow(); + } + tv = iax_tvnow(); + + ms = (tv.tv_sec - session->rxcore.tv_sec) * 1000 + + (tv.tv_usec - session->rxcore.tv_usec) / 1000; + return ms; +} + +#ifdef notdef_cruft +static int match(struct sockaddr_in *sin, short callno, short dcallno, struct iax_session *cur) +{ + if ((cur->peeraddr.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->peeraddr.sin_port == sin->sin_port)) { + /* This is the main host */ + if ((cur->peercallno == callno) || + ((dcallno == cur->callno) && !cur->peercallno)) { + /* That's us. Be sure we keep track of the peer call number */ + cur->peercallno = callno; + return 1; + } + } + if ((cur->transfer.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->transfer.sin_port == sin->sin_port) && (cur->transferring)) { + /* We're transferring */ + if (dcallno == cur->callno) + return 1; + } + return 0; +} +#endif + +/* splitted match into 2 passes otherwise causing problem of matching + up the wrong session using the dcallno and the peercallno because + during a transfer (2 IAX channels on the same client/system) the + same peercallno (from two different asterisks) exist in more than + one session. + */ +static int forward_match(struct sockaddr_in *sin, short callno, short dcallno, struct iax_session *cur) +{ + if ((cur->transfer.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->transfer.sin_port == sin->sin_port) && (cur->transferring)) { + /* We're transferring */ + if (dcallno == cur->callno) + { + return 1; + } + } + + if ((cur->peeraddr.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->peeraddr.sin_port == sin->sin_port)) { + if (dcallno == cur->callno && dcallno != 0) { + /* That's us. Be sure we keep track of the peer call number */ + if (cur->peercallno == 0) { + cur->peercallno = callno; + } + else if ( cur->peercallno != callno ) + { + // print a warning when the callno's don't match + fprintf( stderr, "WARNING: peercallno does not match callno" + ", peercallno => %d, callno => %d, dcallno => %d", + cur->peercallno, callno, dcallno ) ; + return 0 ; + } + return 1; + } + } + + return 0; +} + +static int reverse_match(struct sockaddr_in *sin, short callno, struct iax_session *cur) +{ + if ((cur->transfer.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->transfer.sin_port == sin->sin_port) && (cur->transferring)) { + /* We're transferring */ + if (callno == cur->peercallno) { + return 1; + } + } + if ((cur->peeraddr.sin_addr.s_addr == sin->sin_addr.s_addr) && + (cur->peeraddr.sin_port == sin->sin_port)) { + if (callno == cur->peercallno) { + return 1; + } + } + + return 0; +} + +static struct iax_session *iax_find_session(struct sockaddr_in *sin, + short callno, + short dcallno, + int makenew) +{ + struct iax_session *cur = sessions; + while(cur) { + if (forward_match(sin, callno, dcallno, cur)) { + return cur; + } + cur = cur->next; + } + + cur = sessions; + while(cur) { + if (reverse_match(sin, callno, cur)) { + return cur; + } + cur = cur->next; + } + + if (makenew && !dcallno) { + cur = iax_session_new(); + cur->peercallno = callno; + cur->peeraddr.sin_addr.s_addr = sin->sin_addr.s_addr; + cur->peeraddr.sin_port = sin->sin_port; + cur->peeraddr.sin_family = AF_INET; + cur->pingid = iax_sched_add(NULL,NULL, send_ping, (void *)cur, 2 * 1000); + DEBU(G "Making new session, peer callno %d, our callno %d\n", callno, cur->callno); + } else { + DEBU(G "No session, peer = %d, us = %d\n", callno, dcallno); + } + return cur; +} + +#ifdef EXTREME_DEBUG +static int display_time(int ms) +{ + static int oldms = -1; + if (oldms < 0) { + DEBU(G "First measure\n"); + oldms = ms; + return 0; + } + DEBU(G "Time from last frame is %d ms\n", ms - oldms); + oldms = ms; + return 0; +} +#endif + +/* From chan_iax2/steve davies: need to get permission from steve or digium, I guess */ +static long unwrap_timestamp(long ts, long last) +{ + int x; + + if ( (ts & 0xFFFF0000) == (last & 0xFFFF0000) ) { + x = ts - last; + if (x < -50000) { + /* Sudden big jump backwards in timestamp: + What likely happened here is that miniframe + timestamp has circled but we haven't gotten the + update from the main packet. We'll just pretend + that we did, and update the timestamp + appropriately. */ + ts = ( (last & 0xFFFF0000) + 0x10000) | (ts & 0xFFFF); + DEBU(G "schedule_delivery: pushed forward timestamp\n"); + } + if (x > 50000) { + /* Sudden apparent big jump forwards in timestamp: + What's likely happened is this is an old miniframe + belonging to the previous top-16-bit timestamp that + has turned up out of order. Adjust the timestamp + appropriately. */ + ts = ( (last & 0xFFFF0000) - 0x10000) | (ts & 0xFFFF); + DEBU(G "schedule_delivery: pushed back timestamp\n"); + } + } + else if ( (ts & 0xFFFF8000L) == (last & 0xFFFF8000L) ) { + x = ts - last; + if (x < -50000) { + /* Sudden big jump backwards in timestamp: + What likely happened here is that miniframe + timestamp has circled but we haven't gotten the + update from the main packet. We'll just pretend + that we did, and update the timestamp + appropriately. */ + ts = ( (last & 0xFFFF8000L) + 0x10000) | (ts & 0xFFFF); + DEBU(G "schedule_delivery: pushed forward timestamp\n"); + } + if (x > 50000) { + /* Sudden apparent big jump forwards in timestamp: + * What's likely happened is this is an old miniframe + * belonging to the previous top-16-bit timestamp that + * has turned up out of order. Adjust the timestamp + * appropriately. */ + ts = ( (last & 0xFFFF8000L) - 0x10000) | (ts & 0xFFFF); + DEBU(G "schedule_delivery: pushed back timestamp\n"); + } + } + return ts; +} + + +static struct iax_event *schedule_delivery(struct iax_event *e, unsigned int ts, int updatehistory) +{ + /* + * This is the core of the IAX jitterbuffer delivery mechanism: + * Dynamically adjust the jitterbuffer and decide how long to wait + * before delivering the packet. + */ + +#ifdef EXTREME_DEBUG + DEBU(G "[%p] We are at %d, packet is for %d\n", e->session, calc_rxstamp(e->session), ts); +#endif + + /* insert into jitterbuffer */ + /* TODO: Perhaps we could act immediately if it's not droppable and late */ + if ( !iax_use_jitterbuffer || + (e->etype == IAX_EVENT_VIDEO && + video_bypass_jitterbuffer) ) + { + iax_sched_add(e, NULL, NULL, NULL, 0); + return NULL; + } else + { + int type = JB_TYPE_CONTROL; + int len = 0; + + if(e->etype == IAX_EVENT_VOICE) + { + type = JB_TYPE_VOICE; + /* The frame time only has an effect for voice */ + len = get_sample_cnt(e) / 8; + } else if(e->etype == IAX_EVENT_VIDEO) + { + type = JB_TYPE_VIDEO; + } else if(e->etype == IAX_EVENT_CNG) + { + type = JB_TYPE_SILENCE; + } + + /* unwrap timestamp */ + ts = unwrap_timestamp(ts,e->session->last_ts); + + /* move forward last_ts if it's greater. We do this _after_ + * unwrapping, because asterisk _still_ has cases where it + * doesn't send full frames when it ought to */ + if(ts > e->session->last_ts) + { + e->session->last_ts = ts; + } + + if(jb_put(e->session->jb, e, type, len, ts, + calc_rxstamp(e->session)) == JB_DROP) + { + iax_event_free(e); + } + } + + return NULL; +} + +static int uncompress_subclass(unsigned char csub) +{ + /* If the SC_LOG flag is set, return 2^csub otherwise csub */ + if (csub & IAX_FLAG_SC_LOG) + return 1 << (csub & ~IAX_FLAG_SC_LOG & IAX_MAX_SHIFT); + else + return csub; +} + +static void iax_handle_vnak(struct iax_session *session, struct ast_iax2_full_hdr *fh) +{ + struct iax_sched *sch, *list, *l, *tmp; + + /* + * According to the IAX2 02 draft, we MUST immediately retransmit all frames + * with higher sequence number than the VNAK's iseqno + * However, it seems that the right thing to do would be to retransmit + * frames with sequence numbers higher OR EQUAL to VNAK's iseqno. + */ + sch = schedq; + list = NULL; + while ( sch != NULL ) + { + if ( sch->frame != NULL && + sch->frame->session == session + ) + { + /* + * We want to check if our frame's oseqno is greater or equal than + * the VNAK's iseqno, but we need to take into account sequence + * number wrap-arounds + * session->rseqno is our last acknowledged sequence number, so + * we use that as a base + */ + if ( (unsigned char)(fh->iseqno - session->rseqno) <= (unsigned char)(sch->frame->oseqno - session->rseqno) ) + { + /* + * We cannot retransmit immediately, since the frames are ordered by retransmit time + * We need to collect them and orrange them in ascending order of their oseqno + */ + tmp = (struct iax_sched *)calloc(1, sizeof(struct iax_sched)); + tmp->frame = sch->frame; + + if ( list == NULL || + (list->frame->oseqno - session->rseqno) > (tmp->frame->oseqno - session->rseqno) + ) + { + tmp->next = list; + list = tmp; + } else + { + l = list; + while ( l != NULL ) + { + if ( l->next == NULL || + (l->next->frame->oseqno - session->rseqno) > (tmp->frame->oseqno - session->rseqno) + ) + { + tmp->next = l->next; + l->next = tmp; + break; + } + l = l->next; + } + } + } + } + sch = sch->next; + } + + /* Transmit collected frames and free the space */ + while ( list != NULL ) + { + tmp = list; + iax_xmit_frame(tmp->frame); + list = list->next; + free(tmp); + } +} + +static struct iax_event *iax_header_to_event(struct iax_session *session, struct ast_iax2_full_hdr *fh, int datalen, struct sockaddr_in *sin) +{ + struct iax_event *e; + struct iax_sched *sch; + unsigned int ts; + int subclass; + int nowts; + int updatehistory = 1; + ts = ntohl(fh->ts); + + if (fh->type==AST_FRAME_VIDEO) + subclass = uncompress_subclass(fh->csub & ~0x40) | ((fh->csub >> 6) & 0x1); + else + subclass = uncompress_subclass(fh->csub); + + /* don't run last_ts backwards; i.e. for retransmits and the like */ + if (ts > session->last_ts && + (fh->type == AST_FRAME_IAX && + subclass != IAX_COMMAND_ACK && + subclass != IAX_COMMAND_PONG && + subclass != IAX_COMMAND_LAGRP)) + { + session->last_ts = ts; + } + +#ifdef DEBUG_SUPPORT + if (debug) + iax_showframe(NULL, fh, 1, sin, datalen); +#endif + + /* Get things going with it, timestamp wise, if we + haven't already. */ + + /* Handle implicit ACKing unless this is an INVAL, and only if this is + from the real peer, not the transfer peer */ + if ( !inaddrcmp(sin, &session->peeraddr) && + ( subclass != IAX_COMMAND_INVAL || + fh->type != AST_FRAME_IAX + ) + ) + { + unsigned char x; + /* XXX This code is not very efficient. Surely there is a better way which still + properly handles boundary conditions? XXX */ + /* First we have to qualify that the ACKed value is within our window */ + for (x=session->rseqno; x != session->oseqno; x++) + if (fh->iseqno == x) + break; + if ((x != session->oseqno) || (session->oseqno == fh->iseqno)) + { + /* The acknowledgement is within our window. Time to acknowledge everything + that it says to */ + for (x=session->rseqno; x != fh->iseqno; x++) + { + /* Ack the packet with the given timestamp */ + DEBU(G "Cancelling transmission of packet %d\n", x); + sch = schedq; + while(sch) + { + if ( sch->frame && + sch->frame->session == session && + sch->frame->oseqno == x + ) + sch->frame->retries = -1; + sch = sch->next; + } + } + /* Note how much we've received acknowledgement for */ + session->rseqno = fh->iseqno; + } else + DEBU(G "Received iseqno %d not within window %d->%d\n", fh->iseqno, session->rseqno, session->oseqno); + } + + /* Check where we are */ + if ((ntohs(fh->dcallno) & IAX_FLAG_RETRANS) || + ((fh->type != AST_FRAME_VOICE) && (fh->type != AST_FRAME_VIDEO))) + updatehistory = 0; + if ((session->iseqno != fh->oseqno) && + (session->iseqno || + ((subclass != IAX_COMMAND_TXREADY) && + (subclass != IAX_COMMAND_TXREL) && + (subclass != IAX_COMMAND_TXCNT) && + (subclass != IAX_COMMAND_TXACC)) || + (fh->type != AST_FRAME_IAX))) + { + if ( + ((subclass != IAX_COMMAND_ACK) && + (subclass != IAX_COMMAND_INVAL) && + (subclass != IAX_COMMAND_TXREADY) && + (subclass != IAX_COMMAND_TXREL) && + (subclass != IAX_COMMAND_TXCNT) && + (subclass != IAX_COMMAND_TXACC) && + (subclass != IAX_COMMAND_VNAK)) || + (fh->type != AST_FRAME_IAX)) + { + /* If it's not an ACK packet, it's out of order. */ + DEBU(G "Packet arrived out of order (expecting %d, got %d) (frametype = %d, subclass = %d)\n", + session->iseqno, fh->oseqno, fh->type, subclass); + + /* + * Check if session->iseqno > fh->oseqno, accounting for possible wrap around + * This is correct if the two values are not equal (which, in this case, is guaranteed) + */ + if ( (unsigned char)(session->iseqno - fh->oseqno) < 128 ) + { + /* If we've already seen it, ack it XXX There's a border condition here XXX */ + if ((fh->type != AST_FRAME_IAX) || + ((subclass != IAX_COMMAND_ACK) && (subclass != IAX_COMMAND_INVAL))) + { + DEBU(G "Acking anyway\n"); + /* XXX Maybe we should handle its ack to us, but then again, it's probably outdated anyway, and if + we have anything to send, we'll retransmit and get an ACK back anyway XXX */ + send_command_immediate(session, AST_FRAME_IAX, IAX_COMMAND_ACK, ts, NULL, 0,fh->iseqno); + } + } else + { + /* Send a VNAK requesting retransmission */ + iax2_vnak(session); + } + return NULL; + } + } else + { + /* Increment unless it's an ACK or VNAK */ + if (((subclass != IAX_COMMAND_ACK) && + (subclass != IAX_COMMAND_INVAL) && + (subclass != IAX_COMMAND_TXCNT) && + (subclass != IAX_COMMAND_TXACC) && + (subclass != IAX_COMMAND_VNAK)) || + (fh->type != AST_FRAME_IAX)) + session->iseqno++; + } + + e = (struct iax_event *)malloc(sizeof(struct iax_event) + datalen + 1); + + if (e) { + memset(e, 0, sizeof(struct iax_event) + datalen); + /* Set etype to some unknown value so do not inavertently + sending IAX_EVENT_CONNECT event, which is 0 to application. + */ + e->etype = -1; + e->session = session; + switch(fh->type) { + case AST_FRAME_DTMF: + e->etype = IAX_EVENT_DTMF; + e->subclass = subclass; + /* + We want the DTMF event deliver immediately so all I/O can be + terminate quickly in an IVR system. + e = schedule_delivery(e, ts, updatehistory); */ + break; + case AST_FRAME_VOICE: + e->etype = IAX_EVENT_VOICE; + e->subclass = subclass; + e->ts = ts; + session->voiceformat = subclass; + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + e->datalen = datalen; + } + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_FRAME_CNG: + e->etype = IAX_EVENT_CNG; + e->subclass = subclass; + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + e->datalen = datalen; + } + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_FRAME_IAX: + /* Parse IE's */ + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + e->datalen = datalen; + } + if (iax_parse_ies(&e->ies, e->data, e->datalen)) { + IAXERROR "Unable to parse IE's"); + free(e); + e = NULL; + break; + } + switch(subclass) { + case IAX_COMMAND_NEW: + /* This is a new, incoming call */ + /* save the capability for validation */ + session->capability = e->ies.capability; + if (e->ies.codec_prefs) { + strncpy(session->codec_order, + e->ies.codec_prefs, + sizeof(session->codec_order)); + session->codec_order_len = + (int)strlen(session->codec_order); + } + e->etype = IAX_EVENT_CONNECT; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_AUTHREQ: + /* This is a request for a call */ + e->etype = IAX_EVENT_AUTHRQ; + if (strlen(session->username) && !strcmp(e->ies.username, session->username) && + strlen(session->secret)) { + /* Hey, we already know this one */ + iax_auth_reply(session, session->secret, e->ies.challenge, e->ies.authmethods); + free(e); + e = NULL; + break; + } + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_HANGUP: + e->etype = IAX_EVENT_HANGUP; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_INVAL: + e->etype = IAX_EVENT_HANGUP; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_REJECT: + e->etype = IAX_EVENT_REJECT; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_ACK: + free(e); + e = NULL; + break; + case IAX_COMMAND_VNAK: + iax_handle_vnak(session, fh); + free(e); + e = NULL; + break; + case IAX_COMMAND_LAGRQ: + /* Pass this along for later handling */ + e->etype = IAX_EVENT_LAGRQ; + e->ts = ts; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_POKE: + e->etype = IAX_EVENT_POKE; + e->ts = ts; + break; + case IAX_COMMAND_PING: + /* PINGS and PONGS don't get scheduled; */ + e->etype = IAX_EVENT_PING; + e->ts = ts; + break; + case IAX_COMMAND_PONG: + e->etype = IAX_EVENT_PONG; + /* track weighted average of ping time */ + session->pingtime = ((2 * session->pingtime) + (calc_timestamp(session,0,NULL) - ts)) / 3; + session->remote_netstats.jitter = e->ies.rr_jitter; + session->remote_netstats.losspct = e->ies.rr_loss >> 24;; + session->remote_netstats.losscnt = e->ies.rr_loss & 0xffffff; + session->remote_netstats.packets = e->ies.rr_pkts; + session->remote_netstats.delay = e->ies.rr_delay; + session->remote_netstats.dropped = e->ies.rr_dropped; + session->remote_netstats.ooo = e->ies.rr_ooo; + break; + case IAX_COMMAND_ACCEPT: + if (e->ies.format & session->capability) { + e->etype = IAX_EVENT_ACCEPT; + } + else { + struct iax_ie_data ied; + /* Although this should not happen, we + * added this to make sure the + * negotiation protocol is enforced. + * For lack of event to notify the + * application we use the defined + * REJECT event. + */ + memset(&ied, 0, sizeof(ied)); + iax_ie_append_str(&ied, IAX_IE_CAUSE, "Unable to negotiate codec"); + send_command_final(session, AST_FRAME_IAX, IAX_COMMAND_REJECT, 0, ied.buf, ied.pos, -1); + e->etype = IAX_EVENT_REJECT; + } + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_REGACK: + e->etype = IAX_EVENT_REGACK; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_REGAUTH: + iax_regauth_reply(session, session->secret, e->ies.challenge, e->ies.authmethods); + free(e); + e = NULL; + break; + case IAX_COMMAND_REGREJ: + e->etype = IAX_EVENT_REGREJ; + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_LAGRP: + e->etype = IAX_EVENT_LAGRP; + nowts = calc_timestamp(session, 0, NULL); + e->ts = nowts - ts; + /* Can't call schedule_delivery since timestamp is non-normal */ + break;; + case IAX_COMMAND_TXREQ: + /* added check for defensive programming + * - in case the asterisk server + * or another client does not send the + * apparent transfer address + */ + if (e->ies.apparent_addr != NULL) { + /* so a full voice frame is sent on the + next voice output */ + session->svoiceformat = -1; + session->transfer = *e->ies.apparent_addr; + session->transfer.sin_family = AF_INET; + session->transfercallno = e->ies.callno; + session->transferring = TRANSFER_BEGIN; + session->transferid = e->ies.transferid; + iax_send_txcnt(session); + } + free(e); + e = NULL; + break; + case IAX_COMMAND_DPREP: + /* Received dialplan reply */ + e->etype = IAX_EVENT_DPREP; + /* Return immediately, makes no sense to schedule */ + break; + case IAX_COMMAND_TXCNT: + if (session->transferring) { + session->transfer = *sin; + iax_send_txaccept(session); + } + free(e); + e = NULL; + break; + case IAX_COMMAND_TXACC: + if (session->transferring) { + stop_transfer(session); + session->transferring = TRANSFER_READY; + iax_send_txready(session); + } + free(e); + e = NULL; + break; + case IAX_COMMAND_TXREL: + /* Release the transfer */ + send_command_immediate(session, AST_FRAME_IAX, IAX_COMMAND_ACK, ts, NULL, 0, fh->iseqno); + if (session->transferring) { + complete_transfer(session, e->ies.callno, 1, 0); + } + else { + complete_transfer(session, session->peercallno, 0, 1); + } + e->etype = IAX_EVENT_TRANSFER; + /* notify that asterisk no longer sitting between peers */ + e = schedule_delivery(e, ts, updatehistory); + break; + case IAX_COMMAND_QUELCH: + e->etype = IAX_EVENT_QUELCH; + session->quelch = 1; + break; + case IAX_COMMAND_UNQUELCH: + e->etype = IAX_EVENT_UNQUELCH; + session->quelch = 0; + break; + case IAX_COMMAND_TXREJ: + e->etype = IAX_EVENT_TXREJECT; + iax_handle_txreject(session); + break; + + case IAX_COMMAND_TXREADY: + send_command_immediate(session, AST_FRAME_IAX, IAX_COMMAND_ACK, ts, NULL, 0, fh->iseqno); + if (iax_handle_txready(session)) { + e->etype = IAX_EVENT_TXREADY; + } + else { + free(e); + e = NULL; + } + break; + default: + DEBU(G "Don't know what to do with IAX command %d\n", subclass); + free(e); + e = NULL; + } + break; + case AST_FRAME_CONTROL: + switch(subclass) { + case AST_CONTROL_ANSWER: + e->etype = IAX_EVENT_ANSWER; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_CONTROL_CONGESTION: + case AST_CONTROL_BUSY: + e->etype = IAX_EVENT_BUSY; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_CONTROL_RINGING: + e->etype = IAX_EVENT_RINGA; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_CONTROL_KEY: + e->etype = IAX_EVENT_KEY; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_CONTROL_UNKEY: + e->etype = IAX_EVENT_UNKEY; + e = schedule_delivery(e, ts, updatehistory); + break; + default: + DEBU(G "Don't know what to do with AST control %d\n", subclass); + free(e); + return NULL; + } + break; + case AST_FRAME_IMAGE: + e->etype = IAX_EVENT_IMAGE; + e->subclass = subclass; + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + } + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_FRAME_VIDEO: + e->etype = IAX_EVENT_VIDEO; + e->subclass = subclass; + e->ts = ts; + session->videoformat = e->subclass; + memcpy(e->data, fh->iedata, datalen); + e->datalen = datalen; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_FRAME_TEXT: + e->etype = IAX_EVENT_TEXT; + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + e->datalen = datalen; + } + e = schedule_delivery(e, ts, updatehistory); + break; + + case AST_FRAME_HTML: + switch(fh->csub) { + case AST_HTML_LINKURL: + e->etype = IAX_EVENT_LINKURL; + /* Fall through */ + case AST_HTML_URL: + if (e->etype == -1) + e->etype = IAX_EVENT_URL; + e->subclass = fh->csub; + e->datalen = datalen; + if (datalen) { + memcpy(e->data, fh->iedata, datalen); + } + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_HTML_LDCOMPLETE: + e->etype = IAX_EVENT_LDCOMPLETE; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_HTML_UNLINK: + e->etype = IAX_EVENT_UNLINK; + e = schedule_delivery(e, ts, updatehistory); + break; + case AST_HTML_LINKREJECT: + e->etype = IAX_EVENT_LINKREJECT; + e = schedule_delivery(e, ts, updatehistory); + break; + default: + DEBU(G "Don't know how to handle HTML type %d frames\n", fh->csub); + free(e); + return NULL; + } + break; + default: + DEBU(G "Don't know what to do with frame type %d\n", fh->type); + free(e); + return NULL; + } + } else + DEBU(G "Out of memory\n"); + + /* Already ack'd iax frames */ + if (session->aseqno != session->iseqno) { + send_command_immediate(session, AST_FRAME_IAX, IAX_COMMAND_ACK, ts, NULL, 0, fh->iseqno); + } + return e; +} + +/* Some parts taken from iax_miniheader_to_event and from from chan_iax2.c. We must inform Mark Spencer? */ +static struct iax_event *iax_videoheader_to_event(struct iax_session *session, + struct ast_iax2_video_hdr *vh, int datalen) +{ + struct iax_event * e; + + if ( session->videoformat <= 0 ) + { + DEBU(G "No last video format received on session %d\n", + session->callno); + return 0; + } + + e = (struct iax_event *)malloc(sizeof(struct iax_event) + datalen); + + if ( !e ) + { + DEBU(G "Out of memory\n"); + return 0; + } + + e->etype = IAX_EVENT_VIDEO; + e->session = session; + e->subclass = session->videoformat | (ntohs(vh->ts) & 0x8000 ? 1 : 0); + e->datalen = datalen; + memcpy(e->data, vh->data, e->datalen); + e->ts = (session->last_ts & 0xFFFF8000L) | (ntohs(vh->ts) & 0x7fff); + + return schedule_delivery(e, e->ts, 1); +} + +static struct iax_event *iax_miniheader_to_event(struct iax_session *session, + struct ast_iax2_mini_hdr *mh, int datalen) +{ + struct iax_event * e; + + if ( session->voiceformat <= 0 ) + { + DEBU(G "No last format received on session %d\n", session->callno); + return 0; + } + + e = (struct iax_event *)malloc(sizeof(struct iax_event) + datalen); + + if ( !e ) + { + DEBU(G "Out of memory\n"); + return 0; + } + + e->etype = IAX_EVENT_VOICE; + e->session = session; + e->subclass = session->voiceformat; + e->datalen = datalen; + memcpy(e->data, mh->data, datalen); + e->ts = (session->last_ts & 0xFFFF0000) | ntohs(mh->ts); + + return schedule_delivery(e, e->ts, 1); +} + +void iax_destroy(struct iax_session *session) +{ + destroy_session(session); +} + +static struct iax_event *iax_net_read(void) +{ + unsigned char buf[65536]; + int res; + struct sockaddr_in sin; + socklen_t sinlen; + struct iax_event *event; + + sinlen = sizeof(sin); + res = iax_recvfrom(netfd, (char *)buf, sizeof(buf), 0, (struct sockaddr *) &sin, &sinlen); + if (res < 0) { +#if defined(_WIN32_WCE) + if (WSAGetLastError() != WSAEWOULDBLOCK) { + DEBU(G "Error on read: %d\n", WSAGetLastError()); + IAXERROR "Read error on network socket: ???"); + } +#elif defined(WIN32) || defined(_WIN32_WCE) + if (WSAGetLastError() != WSAEWOULDBLOCK) { + DEBU(G "Error on read: %d\n", WSAGetLastError()); + IAXERROR "Read error on network socket: %s", strerror(errno)); + } +#else + if (errno != EAGAIN) { + DEBU(G "Error on read: %s\n", strerror(errno)); + IAXERROR "Read error on network socket: %s", strerror(errno)); + } +#endif + return NULL; + } + event = iax_net_process(buf, res, &sin); + if ( event == NULL ) + { + // We have received a frame. The corresponding event is queued + // We need to motify the entire stack of calling functions so they + // don't go to sleep thinking there are no more frames to process + // TODO: this is buttugly from a design point of view. Basically we + // change libiax2 behavior to accomodate iaxclient. + // There must be a way to do it better. + event = (struct iax_event *)malloc(sizeof(struct iax_event)); + if ( event != NULL ) event->etype = IAX_EVENT_NULL; + } + return event; +} + +static struct iax_session *iax_txcnt_session(struct ast_iax2_full_hdr *fh, int datalen, + struct sockaddr_in *sin, short callno, short dcallno) +{ + int subclass = uncompress_subclass(fh->csub); + unsigned char buf[ 65536 ]; /* allocated on stack with same size as iax_net_read() */ + struct iax_ies ies; + struct iax_session *cur; + + if ((fh->type != AST_FRAME_IAX) || (subclass != IAX_COMMAND_TXCNT) || (!datalen)) { + return NULL; /* special handling for TXCNT only */ + } + memcpy(buf, fh->iedata, datalen); /* prepare local buf for iax_parse_ies() */ + + if (iax_parse_ies(&ies, buf, datalen)) { + return NULL; /* Unable to parse IE's */ + } + if (!ies.transferid) { + return NULL; /* TXCNT without proper IAX_IE_TRANSFERID */ + } + for( cur=sessions; cur; cur=cur->next ) { + if ((cur->transferring) && (cur->transferid == (int) ies.transferid) && + (cur->callno == dcallno) && (cur->transfercallno == callno)) { + /* We're transferring --- + * skip address/port checking which would fail while + * remote peer behind symmetric NAT, verify + * transferid instead + */ + cur->transfer.sin_addr.s_addr = sin->sin_addr.s_addr; /* setup for further handling */ + cur->transfer.sin_port = sin->sin_port; + break; + } + } + return cur; +} + +struct iax_event *iax_net_process(unsigned char *buf, int len, struct sockaddr_in *sin) +{ + struct ast_iax2_full_hdr *fh = (struct ast_iax2_full_hdr *)buf; + struct ast_iax2_mini_hdr *mh = (struct ast_iax2_mini_hdr *)buf; + struct ast_iax2_video_hdr *vh = (struct ast_iax2_video_hdr *)buf; + struct iax_session *session; + + if (ntohs(fh->scallno) & IAX_FLAG_FULL) { + /* Full size header */ + if ((size_t)len < sizeof(struct ast_iax2_full_hdr)) { + DEBU(G "Short header received from %s\n", inet_ntoa(sin->sin_addr)); + IAXERROR "Short header received from %s\n", inet_ntoa(sin->sin_addr)); + return NULL; + } + /* We have a full header, process appropriately */ + session = iax_find_session(sin, + ntohs(fh->scallno) & ~IAX_FLAG_FULL, + ntohs(fh->dcallno) & ~IAX_FLAG_RETRANS, 1); + if (!session) + session = iax_txcnt_session(fh, + len - sizeof(struct ast_iax2_full_hdr), + sin, ntohs(fh->scallno) & ~IAX_FLAG_FULL, + ntohs(fh->dcallno) & ~IAX_FLAG_RETRANS); + if (session) + return iax_header_to_event(session, fh, len - sizeof(struct ast_iax2_full_hdr), sin); + DEBU(G "No session?\n"); + return NULL; + } else { + if ((size_t)len < sizeof(struct ast_iax2_mini_hdr)) { + DEBU(G "Short header received from %s\n", inet_ntoa(sin->sin_addr)); + IAXERROR "Short header received from %s\n", inet_ntoa(sin->sin_addr)); + return NULL; + } + /* Miniature, voice frame */ + if ((vh->zeros == 0) && (ntohs(vh->callno) & 0x8000)) + { + session = iax_find_session(sin, ntohs(vh->callno) & ~0x8000, 0, 0); + + if (session) + return iax_videoheader_to_event(session, vh, + len - sizeof(struct ast_iax2_video_hdr)); + } else { + /* audio frame */ + session = iax_find_session(sin, ntohs(fh->scallno), 0, 0); + if (session) + return iax_miniheader_to_event(session, mh, + len - sizeof(struct ast_iax2_mini_hdr)); + } + DEBU(G "No session?\n"); + return NULL; + } +} + +static struct iax_sched *iax_get_sched(struct timeval tv) +{ + struct iax_sched *cur, *prev=NULL; + cur = schedq; + /* Check the event schedule first. */ + while(cur) { + if ((tv.tv_sec > cur->when.tv_sec) || + ((tv.tv_sec == cur->when.tv_sec) && + (tv.tv_usec >= cur->when.tv_usec))) { + /* Take it out of the event queue */ + if (prev) { + prev->next = cur->next; + } else { + schedq = cur->next; + } + return cur; + } + cur = cur->next; + } + return NULL; +} + +struct iax_event *iax_get_event(int blocking) +{ + struct iax_event *event; + struct iax_frame *frame; + struct timeval tv; + struct iax_sched *cur; + struct iax_session *session; + + tv = iax_tvnow(); + + while((cur = iax_get_sched(tv))) + { + event = cur->event; + frame = cur->frame; + if (event) + { + /* See if this is an event we need to handle */ + event = handle_event(event); + if (event) + { + free(cur); + return event; + } + } else if(frame) + { + /* It's a frame, transmit it and schedule a retry */ + if (frame->retries < 0) + { + /* It's been acked. No need to send it. Destroy the old + frame. If final, destroy the session. */ + if (frame->final) + destroy_session(frame->session); + if (frame->data) + free(frame->data); + free(frame); + } else if (frame->retries == 0) + { + if (frame->transfer) + { + /* Send a transfer reject since we weren't able to connect */ + iax_send_txrej(frame->session); + if (frame->data) + free(frame->data); + free(frame); + free(cur); + break; + } else + { + /* We haven't been able to get an ACK on this packet. If a + final frame, destroy the session, otherwise, pass up timeout */ + if (frame->final) + { + destroy_session(frame->session); + if (frame->data) + free(frame->data); + free(frame); + } else + { + event = (struct iax_event *)malloc(sizeof(struct iax_event)); + if (event) + { + event->etype = IAX_EVENT_TIMEOUT; + event->session = frame->session; + if (frame->data) + free(frame->data); + free(frame); + free(cur); + return handle_event(event); + } + } + } + } else + { + struct ast_iax2_full_hdr *fh; + /* Decrement remaining retries */ + frame->retries--; + /* Multiply next retry time by 4, not above MAX_RETRY_TIME though */ + frame->retrytime *= 4; + /* Keep under 1000 ms if this is a transfer packet */ + if (!frame->transfer) + { + if (frame->retrytime > MAX_RETRY_TIME) + frame->retrytime = MAX_RETRY_TIME; + } else if (frame->retrytime > 1000) + frame->retrytime = 1000; + fh = (struct ast_iax2_full_hdr *)(frame->data); + fh->dcallno = htons(IAX_FLAG_RETRANS | frame->dcallno); + iax_xmit_frame(frame); + /* Schedule another retransmission */ + DEBU(G "Scheduling retransmission %d\n", frame->retries); + iax_sched_add(NULL, frame, NULL, NULL, frame->retrytime); + } + } else if (cur->func) + { + cur->func(cur->arg); + } + free(cur); + } + + /* get jitterbuffer-scheduled events */ + for ( session = sessions; session; session = session->next ) + { + int ret; + long now; + long next; + jb_frame frame; + + now = (tv.tv_sec - session->rxcore.tv_sec) * 1000 + + (tv.tv_usec - session->rxcore.tv_usec) / 1000; + + if ( now <= (next = jb_next(session->jb)) ) + continue; + + /* interp len no longer hardcoded, now determined by get_interp_len */ + ret = jb_get(session->jb,&frame,now,get_interp_len(session->voiceformat)); + + switch(ret) { + case JB_OK: + event = (struct iax_event *)frame.data; + event = handle_event(event); + if (event) { + return event; + } + break; + case JB_INTERP: + /* create an interpolation frame */ + //fprintf(stderr, "Making Interpolation frame\n"); + event = (struct iax_event *)malloc(sizeof(struct iax_event)); + if (event) { + event->etype = IAX_EVENT_VOICE; + event->subclass = session->voiceformat; + /* XXX: ??? applications probably ignore this anyway */ + event->ts = now; + event->session = session; + event->datalen = 0; + event = handle_event(event); + if(event) + return event; + } + break; + case JB_DROP: + iax_event_free((struct iax_event *)frame.data); + break; + case JB_NOFRAME: + case JB_EMPTY: + /* do nothing */ + break; + default: + /* shouldn't happen */ + break; + } + } + + /* Now look for networking events */ + if (blocking) { + /* Block until there is data if desired */ + fd_set fds; + int nextEventTime; + + FD_ZERO(&fds); + FD_SET(netfd, &fds); + + nextEventTime = iax_time_to_next_event(); + + if(nextEventTime < 0) select(netfd + 1, &fds, NULL, NULL, NULL); + else + { + struct timeval nextEvent; + + nextEvent.tv_sec = nextEventTime / 1000; + nextEvent.tv_usec = (nextEventTime % 1000) * 1000; + + select(netfd + 1, &fds, NULL, NULL, &nextEvent); + } + + } + event = iax_net_read(); + + return handle_event(event); +} + +struct sockaddr_in iax_get_peer_addr(struct iax_session *session) +{ + return session->peeraddr; +} + +void iax_session_destroy(struct iax_session **session) +{ + destroy_session(*session); + *session = NULL; +} + +void iax_event_free(struct iax_event *event) +{ + /* We gave the user a chance to play with the session now we need to + * destroy it if you are not calling this function on every event you + * read you are now going to leak sessions as well as events! + */ + switch(event->etype) { + case IAX_EVENT_REJECT: + case IAX_EVENT_HANGUP: + /* Destroy this session -- it's no longer valid */ + if (event->session) { /* maybe the user did it already */ + destroy_session(event->session); + } + break; + } + free(event); +} + +int iax_get_fd(void) +{ + /* Return our network file descriptor. The client can select on this + * (probably with other things, or can add it to a network add sort + * of gtk_input_add for example */ + return netfd; +} + +int iax_quelch_moh(struct iax_session *session, int MOH) +{ + struct iax_ie_data ied; //IE Data Structure (Stuff To Send) + memset(&ied, 0, sizeof(ied)); + + // You can't quelch the quelched + if (session->quelch == 1) + return -1; + + if (MOH) { + iax_ie_append(&ied, IAX_IE_MUSICONHOLD); + session->transfer_moh = 1; + } + + return send_command(session, AST_FRAME_IAX, IAX_COMMAND_QUELCH, 0, ied.buf, ied.pos, -1); +} + +struct timeval iax_tvnow(void) +{ + struct timeval tv; + + gettimeofday(&tv, 0); +#if 0 +#ifdef HAVE_GETTIMEOFDAY +#elif defined(_MSC_VER) + struct _timeb curSysTime; + + _ftime(&curSysTime); + tv.tv_sec = (long)curSysTime.time; + tv.tv_usec = curSysTime.millitm * 1000; +#else +//#error no gettimeofday or equivalent available +#endif +#endif + return tv; +} diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax.h b/3rdparty/iaxclient-2/lib/libiax2/src/iax.h new file mode 100644 index 0000000..8a0e3fe --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax.h @@ -0,0 +1,86 @@ +/* + * libIAX + * + * Implementation of Inter-IAXerisk eXchange + * + * Copyright (C) 1999, Mark Spencer + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +#ifndef _IAX_H +#define _IAX_H + +/* Max version of IAX protocol we support */ +#define IAX_PROTO_VERSION 1 + +#define IAX_MAX_CALLS 32768 + +#define IAX_FLAG_FULL 0x8000 + +#define IAX_FLAG_SC_LOG 0x80 + +#define IAX_MAX_SHIFT 0x1F + +/* Maximum size of an IAX frame (max size of UDP frame) */ +#define IAX_MAX_BUF_SIZE 65536 + +/* Subclass for IAX_FRAME_IAX */ +#define IAX_COMMAND_NEW 1 +#define IAX_COMMAND_PING 2 +#define IAX_COMMAND_PONG 3 +#define IAX_COMMAND_ACK 4 +#define IAX_COMMAND_HANGUP 5 +#define IAX_COMMAND_REJECT 6 +#define IAX_COMMAND_ACCEPT 7 +#define IAX_COMMAND_AUTHREQ 8 +#define IAX_COMMAND_AUTHREP 9 +#define IAX_COMMAND_INVAL 10 +#define IAX_COMMAND_LAGRQ 11 +#define IAX_COMMAND_LAGRP 12 +#define IAX_COMMAND_REGREQ 13 /* Registration request */ +#define IAX_COMMAND_REGAUTH 14 /* Registration authentication required */ +#define IAX_COMMAND_REGACK 15 /* Registration accepted */ +#define IAX_COMMAND_REGREJ 16 /* Registration rejected */ +#define IAX_COMMAND_REGREL 17 /* Force release of registration */ +#define IAX_COMMAND_VNAK 18 /* If we receive voice before valid first voice frame, send this */ +#define IAX_COMMAND_DPREQ 19 /* Request status of a dialplan entry */ +#define IAX_COMMAND_DPREP 20 /* Request status of a dialplan entry */ +#define IAX_COMMAND_DIAL 21 /* Request a dial on channel brought up TBD */ +#define IAX_COMMAND_TXREQ 22 /* Transfer Request */ +#define IAX_COMMAND_TXCNT 23 /* Transfer Connect */ +#define IAX_COMMAND_TXACC 24 /* Transfer Accepted */ +#define IAX_COMMAND_TXREADY 25 /* Transfer ready */ +#define IAX_COMMAND_TXREL 26 /* Transfer release */ +#define IAX_COMMAND_TXREJ 27 /* Transfer reject */ +#define IAX_COMMAND_QUELCH 28 /* Stop audio/video transmission */ +#define IAX_COMMAND_UNQUELCH 29 /* Resume audio/video transmission */ + +#define IAX_DEFAULT_REG_EXPIRE 60 + +#define IAX_DEFAULT_PORTNO 5036 + +/* Full frames are always delivered reliably */ +struct iax_full_hdr { + short callno; /* Source call number -- high bit must be 1 */ + short dcallno; /* Destination call number */ + unsigned int ts; /* 32-bit timestamp in milliseconds */ + unsigned short seqno; /* Packet number */ + char type; /* Frame type */ + unsigned char csub; /* Compressed subclass */ + char data[0]; +}; + +/* Mini header is used only for voice frames -- delivered unreliably */ +struct iax_mini_hdr { + short callno; /* Source call number -- high bit must be 0 */ + unsigned short ts; /* 16-bit Timestamp (high 16 bits from last IAX_full_hdr) */ + /* Frametype implicitly VOICE_FRAME */ + /* subclass implicit from last IAX_full_hdr */ + char data[0]; +}; + +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.c b/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.c new file mode 100644 index 0000000..78fcb07 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.c @@ -0,0 +1,822 @@ +/* + * Asterisk -- A telephony toolkit for Linux. + * + * Implementation of Inter-Asterisk eXchange + * + * Copyright (C) 2003-2004, Digium + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +#if defined(WIN32) || defined(_WIN32_WCE) +#include "winpoop.h" +#define snprintf _snprintf +#else +#include +#include +#include +#include +#endif + +#ifndef _MSC_VER +#include +#endif + +#include +#include +#include + +#include "frame.h" +#include "iax2.h" +#include "iax2-parser.h" + +static int frames = 0; +static int iframes = 0; +static int oframes = 0; + +#ifdef ALIGN32 +static unsigned int get_uint32(unsigned char *p) +{ + return (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]; +} + +static unsigned short get_uint16(unsigned char *p) +{ + return (p[0] << 8) | p[1] ; +} + +#else +#define get_uint32(p) (*((unsigned int *)(p))) +#define get_uint16(p) (*((unsigned short *)(p))) +#endif + + +static void internaloutput(const char *str) +{ + //printf(str); +} + +static void internalerror(const char *str) +{ + fprintf(stderr, "WARNING: %s", str); +} + +static void (*outputf)(const char *str) = internaloutput; +static void (*errorf)(const char *str) = internalerror; + +static void dump_addr(char *output, int maxlen, void *value, int len) +{ + struct sockaddr_in sin; + if (len == sizeof(sin)) { + memcpy(&sin, value, len); + snprintf(output, maxlen, "IPV4 %s:%d", inet_ntoa(sin.sin_addr), ntohs(sin.sin_port)); + } else { + snprintf(output, maxlen, "Invalid Address"); + } +} + +static void dump_string(char *output, int maxlen, void *value, int len) +{ + maxlen--; + if (maxlen > len) + maxlen = len; + strncpy(output,(const char *)value, maxlen); + output[maxlen] = '\0'; +} + +static void dump_int(char *output, int maxlen, void *value, int len) +{ + if (len == (int)sizeof(unsigned int)) + snprintf(output, maxlen, "%lu", (unsigned long)ntohl(get_uint32(value))); + else + snprintf(output, maxlen, "Invalid INT"); +} + +static void dump_short(char *output, int maxlen, void *value, int len) +{ + if (len == (int)sizeof(unsigned short)) + snprintf(output, maxlen, "%d", ntohs(get_uint16(value))); + else + snprintf(output, maxlen, "Invalid SHORT"); +} + +static void dump_byte(char *output, int maxlen, void *value, int len) +{ + if (len == (int)sizeof(unsigned char)) + snprintf(output, maxlen, "%d", *((unsigned char *)value)); + else + snprintf(output, maxlen, "Invalid BYTE"); +} + +static void dump_samprate(char *output, int maxlen, void *value, int len) +{ + char tmp[256]=""; + int sr; + if (len == (int)sizeof(unsigned short)) { + sr = ntohs(*((unsigned short *)value)); + if (sr & IAX_RATE_8KHZ) + strcat(tmp, ",8khz"); + if (sr & IAX_RATE_11KHZ) + strcat(tmp, ",11.025khz"); + if (sr & IAX_RATE_16KHZ) + strcat(tmp, ",16khz"); + if (sr & IAX_RATE_22KHZ) + strcat(tmp, ",22.05khz"); + if (sr & IAX_RATE_44KHZ) + strcat(tmp, ",44.1khz"); + if (sr & IAX_RATE_48KHZ) + strcat(tmp, ",48khz"); + if (strlen(tmp)) + strncpy(output, &tmp[1], maxlen - 1); + else + strncpy(output, "None specified!\n", maxlen - 1); + } else + snprintf(output, maxlen, "Invalid SHORT"); + +} + +static void dump_prov_ies(char *output, int maxlen, unsigned char *iedata, int len); +static void dump_prov(char *output, int maxlen, void *value, int len) +{ + dump_prov_ies(output, maxlen, (unsigned char *)value, len); +} + +static struct iax2_ie { + int ie; + char *name; + void (*dump)(char *output, int maxlen, void *value, int len); +} ies[] = { + { IAX_IE_CALLED_NUMBER, "CALLED NUMBER", dump_string }, + { IAX_IE_CALLING_NUMBER, "CALLING NUMBER", dump_string }, + { IAX_IE_CALLING_ANI, "ANI", dump_string }, + { IAX_IE_CALLING_NAME, "CALLING NAME", dump_string }, + { IAX_IE_CALLED_CONTEXT, "CALLED CONTEXT", dump_string }, + { IAX_IE_USERNAME, "USERNAME", dump_string }, + { IAX_IE_PASSWORD, "PASSWORD", dump_string }, + { IAX_IE_CAPABILITY, "CAPABILITY", dump_int }, + { IAX_IE_FORMAT, "FORMAT", dump_int }, + { IAX_IE_LANGUAGE, "LANGUAGE", dump_string }, + { IAX_IE_VERSION, "VERSION", dump_short }, + { IAX_IE_ADSICPE, "ADSICPE", dump_short }, + { IAX_IE_DNID, "DNID", dump_string }, + { IAX_IE_AUTHMETHODS, "AUTHMETHODS", dump_short }, + { IAX_IE_CHALLENGE, "CHALLENGE", dump_string }, + { IAX_IE_MD5_RESULT, "MD5 RESULT", dump_string }, + { IAX_IE_RSA_RESULT, "RSA RESULT", dump_string }, + { IAX_IE_APPARENT_ADDR, "APPARENT ADDRESS", dump_addr }, + { IAX_IE_REFRESH, "REFRESH", dump_short }, + { IAX_IE_DPSTATUS, "DIALPLAN STATUS", dump_short }, + { IAX_IE_CALLNO, "CALL NUMBER", dump_short }, + { IAX_IE_CAUSE, "CAUSE", dump_string }, + { IAX_IE_IAX_UNKNOWN, "UNKNOWN IAX CMD", dump_byte }, + { IAX_IE_MSGCOUNT, "MESSAGE COUNT", dump_short }, + { IAX_IE_AUTOANSWER, "AUTO ANSWER REQ" }, + { IAX_IE_TRANSFERID, "TRANSFER ID", dump_int }, + { IAX_IE_RDNIS, "REFERRING DNIS", dump_string }, + { IAX_IE_PROVISIONING, "PROVISIONING", dump_prov }, + { IAX_IE_AESPROVISIONING, "AES PROVISIONG" }, + { IAX_IE_DATETIME, "DATE TIME", dump_int }, + { IAX_IE_DEVICETYPE, "DEVICE TYPE", dump_string }, + { IAX_IE_SERVICEIDENT, "SERVICE IDENT", dump_string }, + { IAX_IE_FIRMWAREVER, "FIRMWARE VER", dump_short }, + { IAX_IE_FWBLOCKDESC, "FW BLOCK DESC", dump_int }, + { IAX_IE_FWBLOCKDATA, "FW BLOCK DATA" }, + { IAX_IE_PROVVER, "PROVISIONG VER", dump_int }, + { IAX_IE_CALLINGPRES, "CALLING PRESNTN", dump_byte }, + { IAX_IE_CALLINGTON, "CALLING TYPEOFNUM", dump_byte }, + { IAX_IE_CALLINGTNS, "CALLING TRANSITNET", dump_short }, + { IAX_IE_SAMPLINGRATE, "SAMPLINGRATE", dump_samprate }, + { IAX_IE_CODEC_PREFS, "CODEC_PREFS", dump_string }, + { IAX_IE_RR_JITTER, "RR_JITTER", dump_int }, + { IAX_IE_RR_LOSS, "RR_LOSS", dump_int }, + { IAX_IE_RR_PKTS, "RR_PKTS", dump_int }, + { IAX_IE_RR_DELAY, "RR_DELAY", dump_short }, + { IAX_IE_RR_DROPPED, "RR_DROPPED", dump_int }, + { IAX_IE_RR_OOO, "RR_OOO", dump_int }, +}; + +const char *iax_ie2str(int ie) +{ + int x; + for (x=0;x<(int)sizeof(ies) / (int)sizeof(ies[0]); x++) { + if (ies[x].ie == ie) + return ies[x].name; + } + return "Unknown IE"; +} + + +static void dump_prov_ies(char *output, int maxlen, unsigned char *iedata, int len) +{ + int ielen; + int ie; + int found; + char tmp[256]; + if (len < 2) + return; + strcpy(output, "\n"); + maxlen -= (int)strlen(output); output += strlen(output); + while(len > 2) { + ie = iedata[0]; + ielen = iedata[1]; + if (ielen + 2> len) { + snprintf(tmp, (int)sizeof(tmp), "Total Prov IE length of %d bytes exceeds remaining prov frame length of %d bytes\n", ielen + 2, len); + strncpy(output, tmp, maxlen - 1); + maxlen -= (int)strlen(output); output += strlen(output); + return; + } + found = 0; + if (!found) { + snprintf(tmp, (int)sizeof(tmp), " Unknown Prov IE %03d : Present\n", ie); + strncpy(output, tmp, maxlen - 1); + maxlen -= (int)strlen(output); output += strlen(output); + } + iedata += (2 + ielen); + len -= (2 + ielen); + } +} + +static void dump_ies(unsigned char *iedata, int len) +{ + int ielen; + int ie; + int x; + int found; + char interp[1024]; + char tmp[1024]; + if (len < 2) + return; + while(len > 2) { + ie = iedata[0]; + ielen = iedata[1]; + if (ielen + 2> len) { + snprintf(tmp, (int)sizeof(tmp), "Total IE length of %d bytes exceeds remaining frame length of %d bytes\n", ielen + 2, len); + outputf(tmp); + return; + } + found = 0; + for (x=0;x<(int)sizeof(ies) / (int)sizeof(ies[0]); x++) { + if (ies[x].ie == ie) { + if (ies[x].dump) { + ies[x].dump(interp, (int)sizeof(interp), iedata + 2, ielen); + snprintf(tmp, (int)sizeof(tmp), " %-15.15s : %s\n", ies[x].name, interp); + outputf(tmp); + } else { + if (ielen) + snprintf(interp, (int)sizeof(interp), "%d bytes", ielen); + else + strcpy(interp, "Present"); + snprintf(tmp, (int)sizeof(tmp), " %-15.15s : %s\n", ies[x].name, interp); + outputf(tmp); + } + found++; + } + } + if (!found) { + snprintf(tmp, (int)sizeof(tmp), " Unknown IE %03d : Present\n", ie); + outputf(tmp); + } + iedata += (2 + ielen); + len -= (2 + ielen); + } + outputf("\n"); +} + +void iax_showframe(struct iax_frame *f, struct ast_iax2_full_hdr *fhi, int rx, struct sockaddr_in *sin, int datalen) +{ + const char *frames[] = { + "(0?)", + "DTMF ", + "VOICE ", + "VIDEO ", + "CONTROL", + "NULL ", + "IAX ", + "TEXT ", + "IMAGE " }; + const char *iaxs[] = { + "(0?)", + "NEW ", + "PING ", + "PONG ", + "ACK ", + "HANGUP ", + "REJECT ", + "ACCEPT ", + "AUTHREQ", + "AUTHREP", + "INVAL ", + "LAGRQ ", + "LAGRP ", + "REGREQ ", + "REGAUTH", + "REGACK ", + "REGREJ ", + "REGREL ", + "VNAK ", + "DPREQ ", + "DPREP ", + "DIAL ", + "TXREQ ", + "TXCNT ", + "TXACC ", + "TXREADY", + "TXREL ", + "TXREJ ", + "QUELCH ", + "UNQULCH", + "POKE", + "PAGE", + "MWI", + "UNSUPPORTED", + "TRANSFER", + "PROVISION", + "FWDOWNLD", + "FWDATA" + }; + const char *cmds[] = { + "(0?)", + "HANGUP ", + "RING ", + "RINGING", + "ANSWER ", + "BUSY ", + "TKOFFHK ", + "OFFHOOK ", + "CONGESTION ", + "FLASH ", + "WINK ", + "OPTION " + }; + struct ast_iax2_full_hdr *fh; + char retries[20]; + char class2[20]; + char subclass2[20]; + const char *clas; + const char *subclass; + char tmp[256]; + + if (f) { + fh = (struct ast_iax2_full_hdr *)f->data; + snprintf(retries, (int)sizeof(retries), "%03d", f->retries); + } else { + fh = fhi; + if (ntohs(fh->dcallno) & IAX_FLAG_RETRANS) + strcpy(retries, "Yes"); + else + strcpy(retries, " No"); + } + if (!(ntohs(fh->scallno) & IAX_FLAG_FULL)) { + /* Don't mess with mini-frames */ + return; + } + if (fh->type >= (int)(sizeof(frames)/sizeof(char *))) { + snprintf(class2, (int)sizeof(class2), "(%d?)", fh->type); + clas = class2; + } else { + clas = frames[(int)fh->type]; + } + if (fh->type == AST_FRAME_DTMF) { + sprintf(subclass2, "%c", fh->csub); + subclass = subclass2; + } else if (fh->type == AST_FRAME_IAX) { + if (fh->csub >= (int)sizeof(iaxs)/(int)sizeof(iaxs[0])) { + snprintf(subclass2, (int)sizeof(subclass2), "(%d?)", fh->csub); + subclass = subclass2; + } else { + subclass = iaxs[(int)fh->csub]; + } + } else if (fh->type == AST_FRAME_CONTROL) { + if (fh->csub >= (int)(sizeof(cmds)/sizeof(char *))) { + snprintf(subclass2, (int)sizeof(subclass2), "(%d?)", fh->csub); + subclass = subclass2; + } else { + subclass = cmds[(int)fh->csub]; + } + } else { + snprintf(subclass2, (int)sizeof(subclass2), "%d", fh->csub); + subclass = subclass2; + } +snprintf(tmp, (int)sizeof(tmp), +"%s-Frame Retry[%s] -- OSeqno: %3.3d ISeqno: %3.3d Type: %s Subclass: %s\n", + (rx ? "Rx" : "Tx"), + retries, fh->oseqno, fh->iseqno, clas, subclass); + outputf(tmp); +snprintf(tmp, (int)sizeof(tmp), +" Timestamp: %05lums SCall: %5.5d DCall: %5.5d [%s:%d]\n", + (unsigned long)ntohl(fh->ts), + ntohs(fh->scallno) & ~IAX_FLAG_FULL, ntohs(fh->dcallno) & ~IAX_FLAG_RETRANS, + inet_ntoa(sin->sin_addr), ntohs(sin->sin_port)); + outputf(tmp); + if (fh->type == AST_FRAME_IAX) + dump_ies(fh->iedata, datalen); +} + +int iax_ie_append_raw(struct iax_ie_data *ied, unsigned char ie, const void *data, int datalen) +{ + char tmp[256]; + if (datalen > ((int)sizeof(ied->buf) - ied->pos)) { + snprintf(tmp, (int)sizeof(tmp), "Out of space for ie '%s' (%d), need %d have %d\n", iax_ie2str(ie), ie, datalen, (int)sizeof(ied->buf) - ied->pos); + errorf(tmp); + return -1; + } + ied->buf[ied->pos++] = ie; + ied->buf[ied->pos++] = datalen; + memcpy(ied->buf + ied->pos, data, datalen); + ied->pos += datalen; + return 0; +} + +int iax_ie_append_addr(struct iax_ie_data *ied, unsigned char ie, struct sockaddr_in *sin) +{ + return iax_ie_append_raw(ied, ie, sin, (int)sizeof(struct sockaddr_in)); +} + +int iax_ie_append_int(struct iax_ie_data *ied, unsigned char ie, unsigned int value) +{ + unsigned int newval; + newval = htonl(value); + return iax_ie_append_raw(ied, ie, &newval, (int)sizeof(newval)); +} + +int iax_ie_append_short(struct iax_ie_data *ied, unsigned char ie, unsigned short value) +{ + unsigned short newval; + newval = htons(value); + return iax_ie_append_raw(ied, ie, &newval, (int)sizeof(newval)); +} + +int iax_ie_append_str(struct iax_ie_data *ied, unsigned char ie, const char *str) +{ + return iax_ie_append_raw(ied, ie, str, (int)strlen(str)); +} + +int iax_ie_append_byte(struct iax_ie_data *ied, unsigned char ie, unsigned char dat) +{ + return iax_ie_append_raw(ied, ie, &dat, 1); +} + +int iax_ie_append(struct iax_ie_data *ied, unsigned char ie) +{ + return iax_ie_append_raw(ied, ie, NULL, 0); +} + +void iax_set_output(void (*func)(const char *)) +{ + outputf = func; +} + +void iax_set_error(void (*func)(const char *)) +{ + errorf = func; +} + +int iax_parse_ies(struct iax_ies *ies, unsigned char *data, int datalen) +{ + /* Parse data into information elements */ + int len; + int ie; + char tmp[256]; + memset(ies, 0, (int)sizeof(struct iax_ies)); + ies->msgcount = -1; + ies->firmwarever = -1; + ies->calling_ton = -1; + ies->calling_tns = -1; + ies->calling_pres = -1; + ies->samprate = IAX_RATE_8KHZ; + while(datalen >= 2) { + ie = data[0]; + len = data[1]; + if (len > datalen - 2) { + errorf("Information element length exceeds message size\n"); + return -1; + } + switch(ie) { + case IAX_IE_CALLED_NUMBER: + ies->called_number = (char *) data + 2; + break; + case IAX_IE_CALLING_NUMBER: + ies->calling_number = (char *) data + 2; + break; + case IAX_IE_CALLING_ANI: + ies->calling_ani = (char *) data + 2; + break; + case IAX_IE_CALLING_NAME: + ies->calling_name = (char *) data + 2; + break; + case IAX_IE_CALLED_CONTEXT: + ies->called_context = (char *) data + 2; + break; + case IAX_IE_USERNAME: + ies->username = (char *) data + 2; + break; + case IAX_IE_PASSWORD: + ies->password = (char *) data + 2; + break; + case IAX_IE_CAPABILITY: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting capability to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else + ies->capability = ntohl(get_uint32(data + 2)); + break; + case IAX_IE_FORMAT: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting format to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else + ies->format = ntohl(get_uint32(data + 2)); + break; + case IAX_IE_LANGUAGE: + ies->language = (char *) data + 2; + break; + case IAX_IE_CODEC_PREFS: + ies->codec_prefs = (char *) data + 2; + break; + case IAX_IE_VERSION: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting version to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->version = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_ADSICPE: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting adsicpe to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->adsicpe = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_SAMPLINGRATE: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting samplingrate to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->samprate = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_DNID: + ies->dnid = (char *) data + 2; + break; + case IAX_IE_RDNIS: + ies->rdnis = (char *) data + 2; + break; + case IAX_IE_AUTHMETHODS: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting authmethods to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->authmethods = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_CHALLENGE: + ies->challenge = (char *) data + 2; + break; + case IAX_IE_MD5_RESULT: + ies->md5_result = (char *) data + 2; + break; + case IAX_IE_RSA_RESULT: + ies->rsa_result = (char *) data + 2; + break; + case IAX_IE_APPARENT_ADDR: + ies->apparent_addr = ((struct sockaddr_in *)(data + 2)); + break; + case IAX_IE_REFRESH: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting refresh to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->refresh = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_DPSTATUS: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting dpstatus to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->dpstatus = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_CALLNO: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting callno to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->callno = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_CAUSE: + ies->cause = (char *) data + 2; + break; + case IAX_IE_CAUSECODE: + if (len != 1) { + snprintf(tmp, (int)sizeof(tmp), "Expecting causecode to be single byte but was %d\n", len); + errorf(tmp); + } else { + ies->causecode = data[2]; + } + break; + case IAX_IE_IAX_UNKNOWN: + if (len == 1) + ies->iax_unknown = data[2]; + else { + snprintf(tmp, (int)sizeof(tmp), "Expected single byte Unknown command, but was %d long\n", len); + errorf(tmp); + } + break; + case IAX_IE_MSGCOUNT: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting msgcount to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->msgcount = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_AUTOANSWER: + ies->autoanswer = 1; + break; + case IAX_IE_MUSICONHOLD: + ies->musiconhold = 1; + break; + case IAX_IE_TRANSFERID: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting transferid to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else + ies->transferid = ntohl(get_uint32(data + 2)); + break; + case IAX_IE_DATETIME: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting date/time to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else + ies->datetime = ntohl(get_uint32(data + 2)); + break; + case IAX_IE_FIRMWAREVER: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting firmwarever to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->firmwarever = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_DEVICETYPE: + ies->devicetype = (char *) data + 2; + break; + case IAX_IE_SERVICEIDENT: + ies->serviceident = (char *) data + 2; + break; + case IAX_IE_FWBLOCKDESC: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected block desc to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else + ies->fwdesc = ntohl(get_uint32(data + 2)); + break; + case IAX_IE_FWBLOCKDATA: + ies->fwdata = data + 2; + ies->fwdatalen = len; + break; + case IAX_IE_PROVVER: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected provisioning version to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->provverpres = 1; + ies->provver = ntohl(get_uint32(data + 2)); + } + break; + case IAX_IE_CALLINGPRES: + if (len == 1) + ies->calling_pres = data[2]; + else { + snprintf(tmp, (int)sizeof(tmp), "Expected single byte callingpres, but was %d long\n", len); + errorf(tmp); + } + break; + case IAX_IE_CALLINGTON: + if (len == 1) + ies->calling_ton = data[2]; + else { + snprintf(tmp, (int)sizeof(tmp), "Expected single byte callington, but was %d long\n", len); + errorf(tmp); + } + break; + case IAX_IE_CALLINGTNS: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expecting callingtns to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else + ies->calling_tns = ntohs(get_uint16(data + 2)); + break; + case IAX_IE_RR_JITTER: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected jitter rr to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->rr_jitter = ntohl(get_uint32(data + 2)); + } + break; + case IAX_IE_RR_LOSS: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected loss rr to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->rr_loss = ntohl(get_uint32(data + 2)); + } + break; + case IAX_IE_RR_PKTS: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected packets rr to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->rr_pkts = ntohl(get_uint32(data + 2)); + } + break; + case IAX_IE_RR_DELAY: + if (len != (int)sizeof(unsigned short)) { + snprintf(tmp, (int)sizeof(tmp), "Expected loss rr to be %d bytes long but was %d\n", (int)sizeof(unsigned short), len); + errorf(tmp); + } else { + ies->rr_delay = ntohs(get_uint16(data + 2)); + } + break; + case IAX_IE_RR_DROPPED: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected packets rr to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->rr_dropped = ntohl(get_uint32(data + 2)); + } + break; + case IAX_IE_RR_OOO: + if (len != (int)sizeof(unsigned int)) { + snprintf(tmp, (int)sizeof(tmp), "Expected packets rr to be %d bytes long but was %d\n", (int)sizeof(unsigned int), len); + errorf(tmp); + } else { + ies->rr_ooo = ntohl(get_uint32(data + 2)); + } + break; + default: + snprintf(tmp, (int)sizeof(tmp), "Ignoring unknown information element '%s' (%d) of length %d\n", iax_ie2str(ie), ie, len); + outputf(tmp); + } + /* Overwrite information element with 0, to null terminate previous portion */ + data[0] = 0; + datalen -= (len + 2); + data += (len + 2); + } + /* Null-terminate last field */ + *data = '\0'; + if (datalen) { + errorf("Invalid information element contents, strange boundary\n"); + return -1; + } + return 0; +} + +void iax_frame_wrap(struct iax_frame *fr, struct ast_frame *f) +{ + fr->af.frametype = f->frametype; + fr->af.subclass = f->subclass; + fr->af.mallocd = 0; /* Our frame is static relative to the container */ + fr->af.datalen = f->datalen; + fr->af.samples = f->samples; + fr->af.offset = AST_FRIENDLY_OFFSET; + fr->af.src = f->src; + fr->af.data = fr->afdata; + if (fr->af.datalen) + memcpy(fr->af.data, f->data, fr->af.datalen); +} + +struct iax_frame *iax_frame_new(int direction, int datalen) +{ + struct iax_frame *fr; + fr = (struct iax_frame *)malloc((int)sizeof(struct iax_frame) + datalen); + if (fr) { + fr->direction = direction; + fr->retrans = -1; + frames++; + if (fr->direction == DIRECTION_INGRESS) + iframes++; + else + oframes++; + } + return fr; +} + +void iax_frame_free(struct iax_frame *fr) +{ + /* Note: does not remove from scheduler! */ + if (fr->direction == DIRECTION_INGRESS) + iframes--; + else if (fr->direction == DIRECTION_OUTGRESS) + oframes--; + else { + errorf("Attempt to double free frame detected\n"); + return; + } + fr->direction = 0; + free(fr); + frames--; +} + +int iax_get_frames(void) { return frames; } +int iax_get_iframes(void) { return iframes; } +int iax_get_oframes(void) { return oframes; } diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.h b/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.h new file mode 100644 index 0000000..8238b2f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax2-parser.h @@ -0,0 +1,146 @@ +/* + * Asterisk -- A telephony toolkit for Linux. + * + * Implementation of Inter-Asterisk eXchange + * + * Copyright (C) 2003, Digium + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +#ifndef _IAX2_PARSER_H +#define _IAX2_PARSER_H + +struct iax_ies { + char *called_number; + char *calling_number; + char *calling_ani; + char *calling_name; + int calling_ton; + int calling_tns; + int calling_pres; + char *called_context; + char *username; + char *password; + unsigned int capability; + unsigned int format; + char *codec_prefs; + char *language; + int version; + unsigned short adsicpe; + char *dnid; + char *rdnis; + unsigned int authmethods; + char *challenge; + char *md5_result; + char *rsa_result; + struct sockaddr_in *apparent_addr; + unsigned short refresh; + unsigned short dpstatus; + unsigned short callno; + char *cause; + unsigned char causecode; + unsigned char iax_unknown; + int msgcount; + int autoanswer; + int musiconhold; + unsigned int transferid; + unsigned int datetime; + char *devicetype; + char *serviceident; + int firmwarever; + unsigned int fwdesc; + unsigned char *fwdata; + unsigned char fwdatalen; + unsigned int provver; + unsigned short samprate; + unsigned int provverpres; + unsigned int rr_jitter; + unsigned int rr_loss; + unsigned int rr_pkts; + unsigned short rr_delay; + unsigned int rr_dropped; + unsigned int rr_ooo; +}; + +#define DIRECTION_INGRESS 1 +#define DIRECTION_OUTGRESS 2 + +struct iax_frame { +#ifdef LIBIAX + struct iax_session *session; + struct iax_event *event; +#endif + + /* /Our/ call number */ + unsigned short callno; + /* /Their/ call number */ + unsigned short dcallno; + /* Start of raw frame (outgoing only) */ + void *data; + /* Length of frame (outgoing only) */ + int datalen; + /* How many retries so far? */ + int retries; + /* Outgoing relative timestamp (ms) */ + unsigned int ts; + /* How long to wait before retrying */ + int retrytime; + /* Are we received out of order? */ + int outoforder; + /* Have we been sent at all yet? */ + int sentyet; + /* Outgoing Packet sequence number */ + int oseqno; + /* Next expected incoming packet sequence number */ + int iseqno; + /* Non-zero if should be sent to transfer peer */ + int transfer; + /* Non-zero if this is the final message */ + int final; + /* Ingress or outgres */ + int direction; + /* Retransmission ID */ + int retrans; + /* Easy linking */ + struct iax_frame *next; + struct iax_frame *prev; + /* Actual, isolated frame header */ + struct ast_frame af; + unsigned char unused[AST_FRIENDLY_OFFSET]; + unsigned char afdata[0]; /* Data for frame */ +}; + +struct iax_ie_data { + unsigned char buf[1024]; + int pos; +}; + +/* Choose a different function for output */ +extern void iax_set_output(void (*output)(const char *data)); +/* Choose a different function for errors */ +extern void iax_set_error(void (*output)(const char *data)); +extern void iax_showframe(struct iax_frame *f, struct ast_iax2_full_hdr *fhi, int rx, struct sockaddr_in *sin, int datalen); + +extern const char *iax_ie2str(int ie); + +extern int iax_ie_append_raw(struct iax_ie_data *ied, unsigned char ie, const void *data, int datalen); +extern int iax_ie_append_addr(struct iax_ie_data *ied, unsigned char ie, struct sockaddr_in *sin); +extern int iax_ie_append_int(struct iax_ie_data *ied, unsigned char ie, unsigned int value); +extern int iax_ie_append_short(struct iax_ie_data *ied, unsigned char ie, unsigned short value); +extern int iax_ie_append_str(struct iax_ie_data *ied, unsigned char ie, const char *str); +extern int iax_ie_append_byte(struct iax_ie_data *ied, unsigned char ie, unsigned char dat); +extern int iax_ie_append(struct iax_ie_data *ied, unsigned char ie); +extern int iax_parse_ies(struct iax_ies *ies, unsigned char *data, int datalen); + +extern int iax_get_frames(void); +extern int iax_get_iframes(void); +extern int iax_get_oframes(void); + +extern void iax_frame_wrap(struct iax_frame *fr, struct ast_frame *f); +extern struct iax_frame *iax_frame_new(int direction, int datalen); +extern void iax_frame_free(struct iax_frame *fr); +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/iax2.h b/3rdparty/iaxclient-2/lib/libiax2/src/iax2.h new file mode 100644 index 0000000..1f9ae38 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/iax2.h @@ -0,0 +1,223 @@ +/* + * Asterisk -- A telephony toolkit for Linux. + * + * Implementation of Inter-Asterisk eXchange + * + * Copyright (C) 2003, Digium + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +#ifndef _IAX2_H +#define _IAX2_H + +/* Max version of IAX protocol we support */ +#define IAX_PROTO_VERSION 2 + +#define IAX_MAX_CALLS 32768 + +#define IAX_FLAG_FULL 0x8000 + +#define IAX_FLAG_RETRANS 0x8000 + +#define IAX_FLAG_SC_LOG 0x80 + +#define IAX_MAX_SHIFT 0x1F + +#define IAX_WINDOW 64 + +/* Subclass for AST_FRAME_IAX */ +#define IAX_COMMAND_NEW 1 +#define IAX_COMMAND_PING 2 +#define IAX_COMMAND_PONG 3 +#define IAX_COMMAND_ACK 4 +#define IAX_COMMAND_HANGUP 5 +#define IAX_COMMAND_REJECT 6 +#define IAX_COMMAND_ACCEPT 7 +#define IAX_COMMAND_AUTHREQ 8 +#define IAX_COMMAND_AUTHREP 9 +#define IAX_COMMAND_INVAL 10 +#define IAX_COMMAND_LAGRQ 11 +#define IAX_COMMAND_LAGRP 12 +#define IAX_COMMAND_REGREQ 13 /* Registration request */ +#define IAX_COMMAND_REGAUTH 14 /* Registration authentication required */ +#define IAX_COMMAND_REGACK 15 /* Registration accepted */ +#define IAX_COMMAND_REGREJ 16 /* Registration rejected */ +#define IAX_COMMAND_REGREL 17 /* Force release of registration */ +#define IAX_COMMAND_VNAK 18 /* If we receive voice before valid first voice frame, send this */ +#define IAX_COMMAND_DPREQ 19 /* Request status of a dialplan entry */ +#define IAX_COMMAND_DPREP 20 /* Request status of a dialplan entry */ +#define IAX_COMMAND_DIAL 21 /* Request a dial on channel brought up TBD */ +#define IAX_COMMAND_TXREQ 22 /* Transfer Request */ +#define IAX_COMMAND_TXCNT 23 /* Transfer Connect */ +#define IAX_COMMAND_TXACC 24 /* Transfer Accepted */ +#define IAX_COMMAND_TXREADY 25 /* Transfer ready */ +#define IAX_COMMAND_TXREL 26 /* Transfer release */ +#define IAX_COMMAND_TXREJ 27 /* Transfer reject */ +#define IAX_COMMAND_QUELCH 28 /* Stop audio/video transmission */ +#define IAX_COMMAND_UNQUELCH 29 /* Resume audio/video transmission */ +#define IAX_COMMAND_POKE 30 /* Like ping, but does not require an open connection */ +#define IAX_COMMAND_PAGE 31 /* Paging description */ +#define IAX_COMMAND_MWI 32 /* Stand-alone message waiting indicator */ +#define IAX_COMMAND_UNSUPPORT 33 /* Unsupported message received */ +#define IAX_COMMAND_TRANSFER 34 /* Request remote transfer */ +#define IAX_COMMAND_PROVISION 35 /* Provision device */ +#define IAX_COMMAND_FWDOWNL 36 /* Download firmware */ +#define IAX_COMMAND_FWDATA 37 /* Firmware Data */ + +#define IAX_DEFAULT_REG_EXPIRE 60 /* By default require re-registration once per minute */ + +#define IAX_LINGER_TIMEOUT 10 /* How long to wait before closing bridged call */ + +#define IAX_DEFAULT_PORTNO 4569 + +/* IAX Information elements */ +#define IAX_IE_CALLED_NUMBER 1 /* Number/extension being called - string */ +#define IAX_IE_CALLING_NUMBER 2 /* Calling number - string */ +#define IAX_IE_CALLING_ANI 3 /* Calling number ANI for billing - string */ +#define IAX_IE_CALLING_NAME 4 /* Name of caller - string */ +#define IAX_IE_CALLED_CONTEXT 5 /* Context for number - string */ +#define IAX_IE_USERNAME 6 /* Username (peer or user) for authentication - string */ +#define IAX_IE_PASSWORD 7 /* Password for authentication - string */ +#define IAX_IE_CAPABILITY 8 /* Actual codec capability - unsigned int */ +#define IAX_IE_FORMAT 9 /* Desired codec format - unsigned int */ +#define IAX_IE_LANGUAGE 10 /* Desired language - string */ +#define IAX_IE_VERSION 11 /* Protocol version - short */ +#define IAX_IE_ADSICPE 12 /* CPE ADSI capability - short */ +#define IAX_IE_DNID 13 /* Originally dialed DNID - string */ +#define IAX_IE_AUTHMETHODS 14 /* Authentication method(s) - short */ +#define IAX_IE_CHALLENGE 15 /* Challenge data for MD5/RSA - string */ +#define IAX_IE_MD5_RESULT 16 /* MD5 challenge result - string */ +#define IAX_IE_RSA_RESULT 17 /* RSA challenge result - string */ +#define IAX_IE_APPARENT_ADDR 18 /* Apparent address of peer - struct sockaddr_in */ +#define IAX_IE_REFRESH 19 /* When to refresh registration - short */ +#define IAX_IE_DPSTATUS 20 /* Dialplan status - short */ +#define IAX_IE_CALLNO 21 /* Call number of peer - short */ +#define IAX_IE_CAUSE 22 /* Cause - string */ +#define IAX_IE_IAX_UNKNOWN 23 /* Unknown IAX command - byte */ +#define IAX_IE_MSGCOUNT 24 /* How many messages waiting - short */ +#define IAX_IE_AUTOANSWER 25 /* Request auto-answering -- none */ +#define IAX_IE_MUSICONHOLD 26 /* Request musiconhold with QUELCH -- none or string */ +#define IAX_IE_TRANSFERID 27 /* Transfer Request Identifier -- int */ +#define IAX_IE_RDNIS 28 /* Referring DNIS -- string */ +#define IAX_IE_PROVISIONING 29 /* Provisioning info */ +#define IAX_IE_AESPROVISIONING 30 /* AES Provisioning info */ +#define IAX_IE_DATETIME 31 /* Date/Time */ +#define IAX_IE_DEVICETYPE 32 /* Device Type -- string */ +#define IAX_IE_SERVICEIDENT 33 /* Service Identifier -- string */ +#define IAX_IE_FIRMWAREVER 34 /* Firmware revision -- u16 */ +#define IAX_IE_FWBLOCKDESC 35 /* Firmware block description -- u32 */ +#define IAX_IE_FWBLOCKDATA 36 /* Firmware block of data -- raw */ +#define IAX_IE_PROVVER 37 /* Provisioning Version (u32) */ +#define IAX_IE_CALLINGPRES 38 /* Calling presentation (u8) */ +#define IAX_IE_CALLINGTON 39 /* Calling type of number (u8) */ +#define IAX_IE_CALLINGTNS 40 /* Calling transit network select (u16) */ +#define IAX_IE_SAMPLINGRATE 41 /* Supported sampling rates (u16) */ +#define IAX_IE_CAUSECODE 42 /* Hangup cause (u8) */ +#define IAX_IE_ENCRYPTION 43 /* Encryption format (u16) */ +#define IAX_IE_ENCKEY 44 /* Encryption key (raw) */ +#define IAX_IE_CODEC_PREFS 45 /* Codec Negotiation */ + +#define IAX_IE_RR_JITTER 46 /* Received jitter (as in RFC1889) u32 */ +#define IAX_IE_RR_LOSS 47 /* Received loss (high byte loss pct, low 24 bits loss count, as in rfc1889 */ +#define IAX_IE_RR_PKTS 48 /* Received frames (total frames received) u32 */ +#define IAX_IE_RR_DELAY 49 /* Max playout delay for received frames (in ms) u16 */ +#define IAX_IE_RR_DROPPED 50 /* Dropped frames (presumably by jitterbuf) u32 */ +#define IAX_IE_RR_OOO 51 /* Frames received Out of Order u32 */ + + + +#define IAX_AUTH_PLAINTEXT (1 << 0) +#define IAX_AUTH_MD5 (1 << 1) +#define IAX_AUTH_RSA (1 << 2) + +#define IAX_META_TRUNK 1 /* Trunk meta-message */ +#define IAX_META_VIDEO 2 /* Video frame */ + +#define IAX_RATE_8KHZ (1 << 0) /* 8khz sampling (default if absent) */ +#define IAX_RATE_11KHZ (1 << 1) /* 11.025khz sampling */ +#define IAX_RATE_16KHZ (1 << 2) /* 16khz sampling */ +#define IAX_RATE_22KHZ (1 << 3) /* 22.05khz sampling */ +#define IAX_RATE_44KHZ (1 << 4) /* 44.1khz sampling */ +#define IAX_RATE_48KHZ (1 << 5) /* 48khz sampling */ + +#define IAX_DPSTATUS_EXISTS (1 << 0) +#define IAX_DPSTATUS_CANEXIST (1 << 1) +#define IAX_DPSTATUS_NONEXISTANT (1 << 2) +#define IAX_DPSTATUS_IGNOREPAT (1 << 14) +#define IAX_DPSTATUS_MATCHMORE (1 << 15) + +#if defined(_MSC_VER) +#pragma pack(push,1) +#define __PACKED +#else +#define __PACKED __attribute__ ((__packed__)) +#endif + +/* Full frames are always delivered reliably */ +struct ast_iax2_full_hdr { + unsigned short scallno; /* Source call number -- high bit must be 1 */ + unsigned short dcallno; /* Destination call number -- high bit is 1 if retransmission */ + unsigned int ts; /* 32-bit timestamp in milliseconds (from 1st transmission) */ + unsigned char oseqno; /* Packet number (outgoing) */ + unsigned char iseqno; /* Packet number (next incoming expected) */ + char type; /* Frame type */ + unsigned char csub; /* Compressed subclass */ + unsigned char iedata[0]; +} __PACKED; + +/* Mini header is used only for voice frames -- delivered unreliably */ +struct ast_iax2_mini_hdr { + unsigned short callno; /* Source call number -- high bit must be 0, rest must be non-zero */ + unsigned short ts; /* 16-bit Timestamp (high 16 bits from last ast_iax2_full_hdr) */ + /* Frametype implicitly VOICE_FRAME */ + /* subclass implicit from last ast_iax2_full_hdr */ + unsigned char data[0]; +} __PACKED; + +struct ast_iax2_meta_hdr { + unsigned short zeros; /* Zeros field -- must be zero */ + unsigned char metacmd; /* Meta command */ + unsigned char cmddata; /* Command Data */ + unsigned char data[0]; +} __PACKED; + +struct ast_iax2_video_hdr { + unsigned short zeros; /* Zeros field -- must be zero */ + unsigned short callno; /* Video call number */ + unsigned short ts; /* Timestamp and mark if present */ + unsigned char data[0]; +} __PACKED; + +struct ast_iax2_meta_trunk_hdr { + unsigned int ts; /* 32-bit timestamp for all messages */ + unsigned char data[0]; +} __PACKED; + +struct ast_iax2_meta_trunk_entry { + unsigned short callno; /* Call number */ + unsigned short len; /* Length of data for this callno */ +} __PACKED; + +#define IAX_FIRMWARE_MAGIC 0x69617879 + +struct ast_iax2_firmware_header { + unsigned int magic; /* Magic number */ + unsigned short version; /* Software version */ + unsigned char devname[16]; /* Device */ + unsigned int datalen; /* Data length of file beyond header */ + unsigned char chksum[16]; /* Checksum of all data */ + unsigned char data[0]; +} __PACKED; + + +#if defined(_MSC_VER) +#pragma pack(pop) +#endif + +#undef __PACKED + +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.c b/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.c new file mode 100644 index 0000000..0d45024 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.c @@ -0,0 +1,833 @@ +/* + * jitterbuf: an application-independent jitterbuffer + * + * Copyrights: + * Copyright (C) 2004-2005, Horizon Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + * + * Copyright on this file is disclaimed to Digium for inclusion in Asterisk + */ + +#include +#include +#include +#include + +#include "jitterbuf.h" + +/* define these here, just for ancient compiler systems */ +#define JB_LONGMAX 2147483647L +#define JB_LONGMIN (-JB_LONGMAX - 1L) + +/* MS VC can't do __VA_ARGS__ */ +#if (defined(WIN32) || defined(_WIN32_WCE)) && defined(_MSC_VER) +#define jb_warn if (warnf) warnf +#define jb_err if (errf) errf +#define jb_dbg if (dbgf) dbgf + +#ifdef DEEP_DEBUG + #define jb_dbg2 if (dbgf) dbgf +#else + #define jb_dbg2 if (0) dbgf +#endif + +#else + +#define jb_warn(...) (warnf ? warnf(__VA_ARGS__) : (void)0) +#define jb_err(...) (errf ? errf(__VA_ARGS__) : (void)0) +#define jb_dbg(...) (dbgf ? dbgf(__VA_ARGS__) : (void)0) + +#ifdef DEEP_DEBUG +#define jb_dbg2(...) (dbgf ? dbgf(__VA_ARGS__) : (void)0) +#else +#define jb_dbg2(...) ((void)0) +#endif + +#endif + +static jb_output_function_t warnf, errf, dbgf; + +void jb_setoutput(jb_output_function_t err, jb_output_function_t warn, jb_output_function_t dbg) +{ + errf = err; + warnf = warn; + dbgf = dbg; +} + +static void increment_losspct(jitterbuf *jb) +{ + jb->info.losspct = (100000 + 499 * jb->info.losspct)/500; +} + +static void decrement_losspct(jitterbuf *jb) +{ + jb->info.losspct = (499 * jb->info.losspct)/500; +} + +void jb_reset(jitterbuf *jb) +{ + /* only save settings */ + jb_conf s = jb->info.conf; + memset(jb, 0, sizeof(*jb)); + jb->info.conf = s; + + /* initialize length, using the configured value */ + jb->info.current = jb->info.target = jb->info.conf.target_extra; + jb->info.silence_begin_ts = -1; +} + +jitterbuf * jb_new() +{ + jitterbuf *jb; + + if (!(jb = (jitterbuf *)malloc(sizeof(*jb)))) + return NULL; + + jb->info.conf.target_extra = JB_TARGET_EXTRA; + + jb_reset(jb); + + jb_dbg2("jb_new() = %x\n", jb); + return jb; +} + +void jb_destroy(jitterbuf *jb) +{ + jb_frame *frame; + jb_dbg2("jb_destroy(%x)\n", jb); + + /* free all the frames on the "free list" */ + frame = jb->free; + while (frame != NULL) { + jb_frame *next = frame->next; + free(frame); + frame = next; + } + + /* free ourselves! */ + free(jb); +} + + + +#if 0 +static int longcmp(const void *a, const void *b) +{ + return *(long *)a - *(long *)b; +} +#endif + +/* simple history manipulation */ +/* maybe later we can make the history buckets variable size, or something? */ +/* drop parameter determines whether we will drop outliers to minimize + * delay */ +static int history_put(jitterbuf *jb, long ts, long now, long ms) +{ + long delay = now - (ts - jb->info.resync_offset); + long threshold = 2 * jb->info.jitter + jb->info.conf.resync_threshold; + long kicked; + + /* don't add special/negative times to history */ + if (ts <= 0) + return 0; + + /* check for drastic change in delay */ + if (jb->info.conf.resync_threshold != -1) { + if (abs(delay - jb->info.last_delay) > threshold) { + jb->info.cnt_delay_discont++; + if (jb->info.cnt_delay_discont > 3) { + /* resync the jitterbuffer */ + jb->info.cnt_delay_discont = 0; + jb->hist_ptr = 0; + jb->hist_maxbuf_valid = 0; + + jb_warn("Resyncing the jb. last_delay %ld, this delay %ld, threshold %ld, new offset %ld\n", jb->info.last_delay, delay, threshold, ts - now); + jb->info.resync_offset = ts - now; + jb->info.last_delay = delay = 0; /* after resync, frame is right on time */ + } else { + return -1; + } + } else { + jb->info.last_delay = delay; + jb->info.cnt_delay_discont = 0; + } + } + + kicked = jb->history[jb->hist_ptr % JB_HISTORY_SZ]; + + jb->history[(jb->hist_ptr++) % JB_HISTORY_SZ] = delay; + + /* optimization; the max/min buffers don't need to be recalculated, + * if this packet's entry doesn't change them. This happens if this + * packet is not involved, _and_ any packet that got kicked out of + * the history is also not involved. We do a number of comparisons, + * but it's probably still worthwhile, because it will usually + * succeed, and should be a lot faster than going through all 500 + * packets in history */ + if (!jb->hist_maxbuf_valid) + return 0; + + /* don't do this until we've filled history + * (reduces some edge cases below) */ + if (jb->hist_ptr < JB_HISTORY_SZ) + goto invalidate; + + /* if the new delay would go into min */ + if (delay < jb->hist_minbuf[JB_HISTORY_MAXBUF_SZ-1]) + goto invalidate; + + /* or max.. */ + if (delay > jb->hist_maxbuf[JB_HISTORY_MAXBUF_SZ-1]) + goto invalidate; + + /* or the kicked delay would be in min */ + if (kicked <= jb->hist_minbuf[JB_HISTORY_MAXBUF_SZ-1]) + goto invalidate; + + if (kicked >= jb->hist_maxbuf[JB_HISTORY_MAXBUF_SZ-1]) + goto invalidate; + + /* if we got here, we don't need to invalidate, 'cause this delay didn't + * affect things */ + return 0; + /* end optimization */ + + +invalidate: + jb->hist_maxbuf_valid = 0; + return 0; +} + +static void history_calc_maxbuf(jitterbuf *jb) +{ + int i,j; + + if (jb->hist_ptr == 0) + return; + + + /* initialize maxbuf/minbuf to the latest value */ + for (i=0;ihist_maxbuf[i] = jb->history[(jb->hist_ptr-1) % JB_HISTORY_SZ]; + * jb->hist_minbuf[i] = jb->history[(jb->hist_ptr-1) % JB_HISTORY_SZ]; + */ + jb->hist_maxbuf[i] = JB_LONGMIN; + jb->hist_minbuf[i] = JB_LONGMAX; + } + + /* use insertion sort to populate maxbuf */ + /* we want it to be the top "n" values, in order */ + + /* start at the beginning, or JB_HISTORY_SZ frames ago */ + i = (jb->hist_ptr > JB_HISTORY_SZ) ? (jb->hist_ptr - JB_HISTORY_SZ) : 0; + + for (;ihist_ptr;i++) { + long toins = jb->history[i % JB_HISTORY_SZ]; + + /* if the maxbuf should get this */ + if (toins > jb->hist_maxbuf[JB_HISTORY_MAXBUF_SZ-1]) { + + /* insertion-sort it into the maxbuf */ + for (j=0;j jb->hist_maxbuf[j]) { + /* move over */ + memmove(jb->hist_maxbuf + j + 1, jb->hist_maxbuf + j, (JB_HISTORY_MAXBUF_SZ - (j + 1)) * sizeof(jb->hist_maxbuf[0])); + /* insert */ + jb->hist_maxbuf[j] = toins; + + break; + } + } + } + + /* if the minbuf should get this */ + if (toins < jb->hist_minbuf[JB_HISTORY_MAXBUF_SZ-1]) { + + /* insertion-sort it into the maxbuf */ + for (j=0;jhist_minbuf[j]) { + /* move over */ + memmove(jb->hist_minbuf + j + 1, jb->hist_minbuf + j, (JB_HISTORY_MAXBUF_SZ - (j + 1)) * sizeof(jb->hist_minbuf[0])); + /* insert */ + jb->hist_minbuf[j] = toins; + + break; + } + } + } + + if (0) { + int k; + fprintf(stderr, "toins = %ld\n", toins); + fprintf(stderr, "maxbuf ="); + for (k=0;khist_maxbuf[k]); + fprintf(stderr, "\nminbuf ="); + for (k=0;khist_minbuf[k]); + fprintf(stderr, "\n"); + } + } + + jb->hist_maxbuf_valid = 1; +} + +static void history_get(jitterbuf *jb) +{ + long max, min, jitter; + int index; + int count; + + if (!jb->hist_maxbuf_valid) + history_calc_maxbuf(jb); + + /* count is how many items in history we're examining */ + count = (jb->hist_ptr < JB_HISTORY_SZ) ? jb->hist_ptr : JB_HISTORY_SZ; + + /* index is the "n"ths highest/lowest that we'll look for */ + index = count * JB_HISTORY_DROPPCT / 100; + + /* sanity checks for index */ + if (index > (JB_HISTORY_MAXBUF_SZ - 1)) + index = JB_HISTORY_MAXBUF_SZ - 1; + + + if (index < 0) { + jb->info.min = 0; + jb->info.jitter = 0; + return; + } + + max = jb->hist_maxbuf[index]; + min = jb->hist_minbuf[index]; + + jitter = max - min; + + /* these debug stmts compare the difference between looking at the absolute jitter, and the + * values we get by throwing away the outliers */ + /* + fprintf(stderr, "[%d] min=%d, max=%d, jitter=%d\n", index, min, max, jitter); + fprintf(stderr, "[%d] min=%d, max=%d, jitter=%d\n", 0, jb->hist_minbuf[0], jb->hist_maxbuf[0], jb->hist_maxbuf[0]-jb->hist_minbuf[0]); + */ + + jb->info.min = min; + jb->info.jitter = jitter; +} + +/* returns 1 if frame was inserted into head of queue, 0 otherwise */ +static int queue_put(jitterbuf *jb, void *data, const enum jb_frame_type type, long ms, long ts) +{ + jb_frame *frame; + jb_frame *p; + int head = 0; + long resync_ts = ts - jb->info.resync_offset; + + if ((frame = jb->free)) { + jb->free = frame->next; + } else if (!(frame = (jb_frame *)malloc(sizeof(*frame)))) { + jb_err("cannot allocate frame\n"); + return 0; + } + + jb->info.frames_cur++; + + frame->data = data; + frame->ts = resync_ts; + frame->ms = ms; + frame->type = type; + + /* + * frames are a circular list, jb-frames points to to the lowest ts, + * jb->frames->prev points to the highest ts + */ + + if (!jb->frames) { /* queue is empty */ + jb->frames = frame; + frame->next = frame; + frame->prev = frame; + head = 1; + } else if (resync_ts < jb->frames->ts) { + frame->next = jb->frames; + frame->prev = jb->frames->prev; + + frame->next->prev = frame; + frame->prev->next = frame; + + /* frame is out of order */ + jb->info.frames_ooo++; + + jb->frames = frame; + head = 1; + } else { + p = jb->frames; + + /* frame is out of order */ + if (resync_ts < p->prev->ts) jb->info.frames_ooo++; + + while (resync_ts < p->prev->ts && p->prev != jb->frames) + p = p->prev; + + frame->next = p; + frame->prev = p->prev; + + frame->next->prev = frame; + frame->prev->next = frame; + } + return head; +} + +static long queue_next(jitterbuf *jb) +{ + if (jb->frames) + return jb->frames->ts; + else + return -1; +} + +static long queue_last(jitterbuf *jb) +{ + if (jb->frames) + return jb->frames->prev->ts; + else + return -1; +} + +static jb_frame *_queue_get(jitterbuf *jb, long ts, int all) +{ + jb_frame *frame; + frame = jb->frames; + + if (!frame) + return NULL; + + /*jb_warn("queue_get: ASK %ld FIRST %ld\n", ts, frame->ts); */ + + if (all || ts >= frame->ts) { + /* remove this frame */ + frame->prev->next = frame->next; + frame->next->prev = frame->prev; + + if (frame->next == frame) + jb->frames = NULL; + else + jb->frames = frame->next; + + + /* insert onto "free" single-linked list */ + frame->next = jb->free; + jb->free = frame; + + jb->info.frames_cur--; + + /* we return the frame pointer, even though it's on free list, + * but caller must copy data */ + return frame; + } + + return NULL; +} + +static jb_frame *queue_get(jitterbuf *jb, long ts) +{ + return _queue_get(jb,ts,0); +} + +static jb_frame *queue_getall(jitterbuf *jb) +{ + return _queue_get(jb,0,1); +} + +#if 0 +/* some diagnostics */ +static void jb_dbginfo(jitterbuf *jb) +{ + if (dbgf == NULL) + return; + + jb_dbg("\njb info: fin=%ld fout=%ld flate=%ld flost=%ld fdrop=%ld fcur=%ld\n", + jb->info.frames_in, jb->info.frames_out, jb->info.frames_late, jb->info.frames_lost, jb->info.frames_dropped, jb->info.frames_cur); + + jb_dbg("jitter=%ld current=%ld target=%ld min=%ld sil=%d len=%d len/fcur=%ld\n", + jb->info.jitter, jb->info.current, jb->info.target, jb->info.min, jb->info.silence_begin_ts, jb->info.current - jb->info.min, + jb->info.frames_cur ? (jb->info.current - jb->info.min)/jb->info.frames_cur : -8); + if (jb->info.frames_in > 0) + jb_dbg("jb info: Loss PCT = %ld%%, Late PCT = %ld%%\n", + jb->info.frames_lost * 100/(jb->info.frames_in + jb->info.frames_lost), + jb->info.frames_late * 100/jb->info.frames_in); + jb_dbg("jb info: queue %d -> %d. last_ts %d (queue len: %d) last_ms %d\n", + queue_next(jb), + queue_last(jb), + jb->info.next_voice_ts, + queue_last(jb) - queue_next(jb), + jb->info.last_voice_ms); +} +#endif + +#ifdef DEEP_DEBUG +static void jb_chkqueue(jitterbuf *jb) +{ + int i=0; + jb_frame *p = jb->frames; + + if (!p) { + return; + } + + do { + if (p->next == NULL) { + jb_err("Queue is BROKEN at item [%d]", i); + } + i++; + p=p->next; + } while (p->next != jb->frames); +} + +static void jb_dbgqueue(jitterbuf *jb) +{ + int i=0; + jb_frame *p = jb->frames; + + jb_dbg("queue: "); + + if (!p) { + jb_dbg("EMPTY\n"); + return; + } + + do { + jb_dbg("[%d]=%ld ", i++, p->ts); + p=p->next; + } while (p->next != jb->frames); + + jb_dbg("\n"); +} +#endif + +enum jb_return_code jb_put(jitterbuf *jb, void *data, const enum jb_frame_type type, long ms, long ts, long now) +{ + jb_dbg2("jb_put(%x,%x,%ld,%ld,%ld)\n", jb, data, ms, ts, now); + + jb->info.frames_in++; + + if (type == JB_TYPE_VOICE) { + /* presently, I'm only adding VOICE frames to history and drift + * calculations; mostly because with the IAX integrations, I'm + * sending retransmitted control frames with their awkward + * timestamps through + */ + if (history_put(jb,ts,now,ms)) + return JB_DROP; + } + + /* if put into head of queue, caller needs to reschedule */ + if (queue_put(jb,data,type,ms,ts)) { + return JB_SCHED; + } + + return JB_OK; +} + + +static enum jb_return_code _jb_get(jitterbuf *jb, jb_frame *frameout, long now, long interpl) +{ + jb_frame *frame; + long diff; + + /*if ((now - jb_next(jb)) > 2 * jb->info.last_voice_ms) jb_warn("SCHED: %ld", (now - jb_next(jb))); */ + /* get jitter info */ + history_get(jb); + + + /* target */ + jb->info.target = jb->info.jitter + jb->info.min + jb->info.conf.target_extra; + + /* if a hard clamp was requested, use it */ + if ((jb->info.conf.max_jitterbuf) && ((jb->info.target - jb->info.min) > jb->info.conf.max_jitterbuf)) { + jb_dbg("clamping target from %d to %d\n", (jb->info.target - jb->info.min), jb->info.conf.max_jitterbuf); + jb->info.target = jb->info.min + jb->info.conf.max_jitterbuf; + } + + diff = jb->info.target - jb->info.current; + + /* jb_warn("diff = %d lms=%d last = %d now = %d\n", diff, */ + /* jb->info.last_voice_ms, jb->info.last_adjustment, now); */ + + /* let's work on non-silent case first */ + if (!jb->info.silence_begin_ts) { + /* we want to grow */ + if ((diff > 0) && + /* we haven't grown in the delay length */ + (((jb->info.last_adjustment + JB_ADJUST_DELAY) < now) || + /* we need to grow more than the "length" we have left */ + (diff > queue_last(jb) - queue_next(jb)) ) ) { + /* grow by interp frame length */ + jb->info.current += interpl; + jb->info.next_voice_ts += interpl; + jb->info.last_voice_ms = interpl; + jb->info.last_adjustment = now; + jb->info.cnt_contig_interp++; + /* assume silence instead of continuing to interpolate */ + if (jb->info.conf.max_contig_interp && jb->info.cnt_contig_interp >= jb->info.conf.max_contig_interp) { + jb->info.silence_begin_ts = jb->info.next_voice_ts - jb->info.current; + } + jb_dbg("G"); + return JB_INTERP; + } + + frame = queue_get(jb, jb->info.next_voice_ts - jb->info.current); + + /* not a voice frame; just return it. */ + if (frame && frame->type != JB_TYPE_VOICE) { + /* track start of silence */ + if (frame->type == JB_TYPE_SILENCE) { + jb->info.silence_begin_ts = frame->ts; + jb->info.cnt_contig_interp = 0; + } + + *frameout = *frame; + jb->info.frames_out++; + jb_dbg("o"); + return JB_OK; + } + + /* voice frame is later than expected */ + if (frame && frame->ts + jb->info.current < jb->info.next_voice_ts) { + if (frame->ts + jb->info.current > jb->info.next_voice_ts - jb->info.last_voice_ms) { + /* either we interpolated past this frame in the last jb_get */ + /* or the frame is still in order, but came a little too quick */ + *frameout = *frame; + /* reset expectation for next frame */ + jb->info.next_voice_ts = frame->ts + jb->info.current + frame->ms; + jb->info.frames_out++; + decrement_losspct(jb); + jb->info.cnt_contig_interp = 0; + jb_dbg("v"); + return JB_OK; + } else { + /* voice frame is late */ + *frameout = *frame; + jb->info.frames_out++; + decrement_losspct(jb); + jb->info.frames_late++; + jb->info.frames_lost--; + jb_dbg("l"); + /*jb_warn("\nlate: wanted=%ld, this=%ld, next=%ld\n", jb->info.next_voice_ts - jb->info.current, frame->ts, queue_next(jb)); + jb_warninfo(jb); */ + return JB_DROP; + } + } + + /* keep track of frame sizes, to allow for variable sized-frames */ + if (frame && frame->ms > 0) { + jb->info.last_voice_ms = frame->ms; + } + + /* we want to shrink; shrink at 1 frame / 500ms */ + /* unless we don't have a frame, then shrink 1 frame */ + /* every 80ms (though perhaps we can shrink even faster */ + /* in this case) */ + if (diff < -jb->info.conf.target_extra && + ((!frame && jb->info.last_adjustment + 80 < now) || + (jb->info.last_adjustment + 500 < now))) { + + jb->info.last_adjustment = now; + jb->info.cnt_contig_interp = 0; + + if (frame) { + *frameout = *frame; + /* shrink by frame size we're throwing out */ + jb->info.current -= frame->ms; + jb->info.frames_out++; + decrement_losspct(jb); + jb->info.frames_dropped++; + jb_dbg("s"); + return JB_DROP; + } else { + /* shrink by last_voice_ms */ + jb->info.current -= jb->info.last_voice_ms; + jb->info.frames_lost++; + increment_losspct(jb); + jb_dbg("S"); + return JB_NOFRAME; + } + } + + /* lost frame */ + if (!frame) { + /* this is a bit of a hack for now, but if we're close to + * target, and we find a missing frame, it makes sense to + * grow, because the frame might just be a bit late; + * otherwise, we presently get into a pattern where we return + * INTERP for the lost frame, then it shows up next, and we + * throw it away because it's late */ + /* I've recently only been able to replicate this using + * iaxclient talking to app_echo on asterisk. In this case, + * my outgoing packets go through asterisk's (old) + * jitterbuffer, and then might get an unusual increasing delay + * there if it decides to grow?? */ + /* Update: that might have been a different bug, that has been fixed.. + * But, this still seemed like a good idea, except that it ended up making a single actual + * lost frame get interpolated two or more times, when there was "room" to grow, so it might + * be a bit of a bad idea overall */ + /*if (diff > -1 * jb->info.last_voice_ms) { + jb->info.current += jb->info.last_voice_ms; + jb->info.last_adjustment = now; + jb_warn("g"); + return JB_INTERP; + } */ + jb->info.frames_lost++; + increment_losspct(jb); + jb->info.next_voice_ts += interpl; + jb->info.last_voice_ms = interpl; + jb->info.cnt_contig_interp++; + /* assume silence instead of continuing to interpolate */ + if (jb->info.conf.max_contig_interp && jb->info.cnt_contig_interp >= jb->info.conf.max_contig_interp) { + jb->info.silence_begin_ts = jb->info.next_voice_ts - jb->info.current; + } + jb_dbg("L"); + return JB_INTERP; + } + + /* normal case; return the frame, increment stuff */ + *frameout = *frame; + jb->info.next_voice_ts += frame->ms; + jb->info.frames_out++; + jb->info.cnt_contig_interp = 0; + decrement_losspct(jb); + jb_dbg("v"); + return JB_OK; + } else { + /* TODO: after we get the non-silent case down, we'll make the + * silent case -- basically, we'll just grow and shrink faster + * here, plus handle next_voice_ts a bit differently */ + + /* to disable silent special case altogether, just uncomment this: */ + /* jb->info.silence_begin_ts = 0; */ + + /* shrink interpl len every 10ms during silence */ + if (diff < -jb->info.conf.target_extra && + jb->info.last_adjustment + 10 <= now) { + jb->info.current -= interpl; + jb->info.last_adjustment = now; + } + + frame = queue_get(jb, now - jb->info.current); + if (!frame) { + return JB_NOFRAME; + } else if (frame->type != JB_TYPE_VOICE) { + /* normal case; in silent mode, got a non-voice frame */ + *frameout = *frame; + jb->info.frames_out++; + return JB_OK; + } + if (frame->ts < jb->info.silence_begin_ts) { + /* voice frame is late */ + *frameout = *frame; + jb->info.frames_out++; + decrement_losspct(jb); + jb->info.frames_late++; + jb->info.frames_lost--; + jb_dbg("l"); + /*jb_warn("\nlate: wanted=%ld, this=%ld, next=%ld\n", jb->info.next_voice_ts - jb->info.current, frame->ts, queue_next(jb)); + jb_warninfo(jb); */ + return JB_DROP; + } else { + /* voice frame */ + /* try setting current to target right away here */ + jb->info.current = jb->info.target; + jb->info.silence_begin_ts = 0; + jb->info.next_voice_ts = frame->ts + jb->info.current + frame->ms; + jb->info.last_voice_ms = frame->ms; + jb->info.frames_out++; + decrement_losspct(jb); + *frameout = *frame; + jb_dbg("V"); + return JB_OK; + } + } +} + +long jb_next(jitterbuf *jb) +{ + if (jb->info.silence_begin_ts) { + if (jb->frames) { + long next = queue_next(jb); + history_get(jb); + /* shrink during silence */ + if (jb->info.target - jb->info.current < -jb->info.conf.target_extra) + return jb->info.last_adjustment + 10; + return next + jb->info.target; + } + else + return JB_LONGMAX; + } else { + return jb->info.next_voice_ts; + } +} + +enum jb_return_code jb_get(jitterbuf *jb, jb_frame *frameout, long now, long interpl) +{ + enum jb_return_code ret = _jb_get(jb, frameout, now, interpl); +#if 0 + static int lastts=0; + int thists = ((ret == JB_OK) || (ret == JB_DROP)) ? frameout->ts : 0; + jb_warn("jb_get(%x,%x,%ld) = %d (%d)\n", jb, frameout, now, ret, thists); + if (thists && thists < lastts) jb_warn("XXXX timestamp roll-back!!!\n"); + lastts = thists; +#endif + return ret; +} + +enum jb_return_code jb_getall(jitterbuf *jb, jb_frame *frameout) +{ + jb_frame *frame; + frame = queue_getall(jb); + + if (!frame) { + return JB_NOFRAME; + } + + *frameout = *frame; + return JB_OK; +} + + +enum jb_return_code jb_getinfo(jitterbuf *jb, jb_info *stats) +{ + history_get(jb); + + *stats = jb->info; + + return JB_OK; +} + +enum jb_return_code jb_setconf(jitterbuf *jb, jb_conf *conf) +{ + /* take selected settings from the struct */ + + jb->info.conf.max_jitterbuf = conf->max_jitterbuf; + jb->info.conf.resync_threshold = conf->resync_threshold; + jb->info.conf.max_contig_interp = conf->max_contig_interp; + + /* -1 indicates use of the default JB_TARGET_EXTRA value */ + jb->info.conf.target_extra = ( conf->target_extra == -1 ) + ? JB_TARGET_EXTRA + : conf->target_extra + ; + + /* update these to match new target_extra setting */ + jb->info.current = jb->info.conf.target_extra; + jb->info.target = jb->info.conf.target_extra; + + return JB_OK; +} + + diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.h b/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.h new file mode 100644 index 0000000..9c9225b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/jitterbuf.h @@ -0,0 +1,162 @@ +/* + * jitterbuf: an application-independent jitterbuffer + * + * Copyrights: + * Copyright (C) 2004-2005, Horizon Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + * + * Copyright on this file is disclaimed to Digium for inclusion in Asterisk + */ + +#ifndef _JITTERBUF_H_ +#define _JITTERBUF_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +/* configuration constants */ + /* Number of historical timestamps to use in calculating jitter and drift */ +#define JB_HISTORY_SZ 500 + /* what percentage of timestamps should we drop from the history when we examine it; + * this might eventually be something made configurable */ +#define JB_HISTORY_DROPPCT 3 + /* the maximum droppct we can handle (say it was configurable). */ +#define JB_HISTORY_DROPPCT_MAX 4 + /* the size of the buffer we use to keep the top and botton timestamps for dropping */ +#define JB_HISTORY_MAXBUF_SZ JB_HISTORY_SZ * JB_HISTORY_DROPPCT_MAX / 100 + /* amount of additional jitterbuffer adjustment */ +#define JB_TARGET_EXTRA 40 + /* ms between growing and shrinking; may not be honored if jitterbuffer runs out of space */ +#define JB_ADJUST_DELAY 40 + +enum jb_return_code { + /* return codes */ + JB_OK, /* 0 */ + JB_EMPTY, /* 1 */ + JB_NOFRAME, /* 2 */ + JB_INTERP, /* 3 */ + JB_DROP, /* 4 */ + JB_SCHED /* 5 */ +}; + +enum jb_frame_type { +/* frame types */ + JB_TYPE_CONTROL, /* 0 */ + JB_TYPE_VOICE, /* 1 */ + JB_TYPE_VIDEO, /* 2 - reserved */ + JB_TYPE_SILENCE /* 3 */ +}; + +typedef struct jb_conf { + /* settings */ + long max_jitterbuf; /* defines a hard clamp to use in setting the jitter buffer delay */ + long resync_threshold; /* the jb will resync when delay increases to (2 * jitter) + this param */ + long max_contig_interp; /* the max interp frames to return in a row */ + long target_extra; /* amount of additional jitterbuffer adjustment, overrides JB_TARGET_EXTRA */ +} jb_conf; + +typedef struct jb_info { + jb_conf conf; + + /* statistics */ + long frames_in; /* number of frames input to the jitterbuffer.*/ + long frames_out; /* number of frames output from the jitterbuffer.*/ + long frames_late; /* number of frames which were too late, and dropped.*/ + long frames_lost; /* number of missing frames.*/ + long frames_dropped; /* number of frames dropped (shrinkage) */ + long frames_ooo; /* number of frames received out-of-order */ + long frames_cur; /* number of frames presently in jb, awaiting delivery.*/ + long jitter; /* jitter measured within current history interval*/ + long min; /* minimum lateness within current history interval */ + long current; /* the present jitterbuffer adjustment */ + long target; /* the target jitterbuffer adjustment */ + long losspct; /* recent lost frame percentage (* 1000) */ + long next_voice_ts; /* the ts of the next frame to be read from the jb - in receiver's time */ + long last_voice_ms; /* the duration of the last voice frame */ + long silence_begin_ts; /* the time of the last CNG frame, when in silence */ + long last_adjustment; /* the time of the last adjustment */ + long last_delay; /* the last now added to history */ + long cnt_delay_discont; /* the count of discontinuous delays */ + long resync_offset; /* the amount to offset ts to support resyncs */ + long cnt_contig_interp; /* the number of contiguous interp frames returned */ +} jb_info; + +typedef struct jb_frame { + void *data; /* the frame data */ + long ts; /* the relative delivery time expected */ + long ms; /* the time covered by this frame, in sec/8000 */ + enum jb_frame_type type; /* the type of frame */ + struct jb_frame *next, *prev; +} jb_frame; + +typedef struct jitterbuf { + jb_info info; + + /* history */ + long history[JB_HISTORY_SZ]; /* history */ + int hist_ptr; /* points to index in history for next entry */ + long hist_maxbuf[JB_HISTORY_MAXBUF_SZ]; /* a sorted buffer of the max delays (highest first) */ + long hist_minbuf[JB_HISTORY_MAXBUF_SZ]; /* a sorted buffer of the min delays (lowest first) */ + int hist_maxbuf_valid; /* are the "maxbuf"/minbuf valid? */ + + jb_frame *frames; /* queued frames */ + jb_frame *free; /* free frames (avoid malloc?) */ +} jitterbuf; + + +/* new jitterbuf */ +jitterbuf * jb_new(void); + +/* destroy jitterbuf */ +void jb_destroy(jitterbuf *jb); + +/* reset jitterbuf */ +/* NOTE: The jitterbuffer should be empty before you call this, otherwise + * you will leak queued frames, and some internal structures */ +void jb_reset(jitterbuf *jb); + +/* queue a frame data=frame data, timings (in ms): ms=length of frame (for voice), ts=ts (sender's time) + * now=now (in receiver's time) return value is one of + * JB_OK: Frame added. Last call to jb_next() still valid + * JB_DROP: Drop this frame immediately + * JB_SCHED: Frame added. Call jb_next() to get a new time for the next frame + */ +enum jb_return_code jb_put(jitterbuf *jb, void *data, const enum jb_frame_type type, long ms, long ts, long now); + +/* get a frame for time now (receiver's time) return value is one of + * JB_OK: You've got frame! + * JB_DROP: Here's an audio frame you should just drop. Ask me again for this time.. + * JB_NOFRAME: There's no frame scheduled for this time. + * JB_INTERP: Please interpolate an interpl-length frame for this time (either we need to grow, or there was a lost frame) + * JB_EMPTY: The jb is empty. + */ +enum jb_return_code jb_get(jitterbuf *jb, jb_frame *frame, long now, long interpl); + +/* unconditionally get frames from jitterbuf until empty */ +enum jb_return_code jb_getall(jitterbuf *jb, jb_frame *frameout); + +/* when is the next frame due out, in receiver's time (0=EMPTY) + * This value may change as frames are added (esp non-audio frames) */ +long jb_next(jitterbuf *jb); + +/* get jitterbuf info: only "statistics" may be valid */ +enum jb_return_code jb_getinfo(jitterbuf *jb, jb_info *stats); + +/* set jitterbuf conf */ +enum jb_return_code jb_setconf(jitterbuf *jb, jb_conf *conf); + +typedef void (*jb_output_function_t)(const char *fmt, ...); +extern void jb_setoutput(jb_output_function_t err, jb_output_function_t warn, jb_output_function_t dbg); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/md5.c b/3rdparty/iaxclient-2/lib/libiax2/src/md5.c new file mode 100644 index 0000000..b154f6c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/md5.c @@ -0,0 +1,285 @@ +/* MD5 checksum routines used for authentication. Not covered by GPL, but + in the public domain as per the copyright below */ + +#ifdef FREEBSD +# include +#elif defined(LINUX) +# include +# include +# include +#elif defined(SOLARIS) + /* each solaris is different -- this won't work on 2.6 or 2.7 */ +# include /* Defines either _LITTLE_ENDIAN or _BIG_ENDIAN */ +# define __BIG_ENDIAN 4321 +# define __LITTLE_ENDIAN 1234 +# define BIG_ENDIAN 4321 +# define LITTLE_ENDIAN 1234 +# ifdef _LITTLE_ENDIAN +# define __BYTE_ORDER __LITTLE_ENDIAN +# define BYTE_ORDER LITTLE_ENDIAN +# else +# define __BYTE_ORDER __BIG_ENDIAN +# define BYTE_ORDER BIG_ENDIAN +# endif +#endif + +#if __BYTE_ORDER == __BIG_ENDIAN || BYTE_ORDER == BIG_ENDIAN +# define HIGHFIRST 1 +#elif __BYTE_ORDER == __LITTLE_ENDIAN || BYTE_ORDER == LITLE_ENDIAN +# undef HIGHFIRST +#else +# error "Please fix " +#endif + +/* + * This code implements the MD5 message-digest algorithm. + * The algorithm is due to Ron Rivest. This code was + * written by Colin Plumb in 1993, no copyright is claimed. + * This code is in the public domain; do with it what you wish. + * + * Equivalent code is available from RSA Data Security, Inc. + * This code has been tested against that, and is equivalent, + * except that you don't need to include two pages of legalese + * with every copy. + * + * To compute the message digest of a chunk of bytes, declare an + * MD5Context structure, pass it to MD5Init, call MD5Update as + * needed on buffers full of bytes, and then call MD5Final, which + * will fill a supplied 16-byte array with the digest. + */ +#include /* for memcpy() */ +#include "md5.h" + +#ifndef HIGHFIRST +#define byteReverse(buf, len) /* Nothing */ +#else +void byteReverse(uint8_t *buf, unsigned int longs); + +#ifndef ASM_MD5 +/* + * Note: this code is harmless on little-endian machines. + */ +void byteReverse(uint8_t *buf, unsigned int longs) +{ + uint32_t t; + do { + t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 | + ((unsigned) buf[1] << 8 | buf[0]); + *(uint32_t *) buf = t; + buf += 4; + } while (--longs); +} +#endif +#endif + +/* + * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious + * initialization constants. + */ +void MD5Init(struct MD5Context *ctx) +{ + ctx->buf[0] = 0x67452301; + ctx->buf[1] = 0xefcdab89; + ctx->buf[2] = 0x98badcfe; + ctx->buf[3] = 0x10325476; + + ctx->bits[0] = 0; + ctx->bits[1] = 0; +} + +/* + * Update context to reflect the concatenation of another buffer full + * of bytes. + */ +void MD5Update(struct MD5Context *ctx, uint8_t const *buf, unsigned int len) +{ + uint32_t t; + + /* Update bitcount */ + + t = ctx->bits[0]; + if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t) + ctx->bits[1]++; /* Carry from low to high */ + ctx->bits[1] += len >> 29; + + t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ + + /* Handle any leading odd-sized chunks */ + + if (t) { + uint8_t *p = (uint8_t *) ctx->in + t; + + t = 64 - t; + if (len < t) { + memcpy(p, buf, len); + return; + } + memcpy(p, buf, t); + byteReverse(ctx->in, 16); + MD5Transform(ctx->buf, (uint32_t *) ctx->in); + buf += t; + len -= t; + } + /* Process data in 64-byte chunks */ + + while (len >= 64) { + memcpy(ctx->in, buf, 64); + byteReverse(ctx->in, 16); + MD5Transform(ctx->buf, (uint32_t *) ctx->in); + buf += 64; + len -= 64; + } + + /* Handle any remaining bytes of data. */ + + memcpy(ctx->in, buf, len); +} + +/* + * Final wrapup - pad to 64-byte boundary with the bit pattern + * 1 0* (64-bit count of bits processed, MSB-first) + */ +void MD5Final(uint8_t digest[16], struct MD5Context *ctx) +{ + unsigned int count; + uint8_t *p; + + /* Compute number of bytes mod 64 */ + count = (ctx->bits[0] >> 3) & 0x3F; + + /* Set the first char of padding to 0x80. This is safe since there is + always at least one byte free */ + p = ctx->in + count; + *p++ = 0x80; + + /* Bytes of padding needed to make 64 bytes */ + count = 64 - 1 - count; + + /* Pad out to 56 mod 64 */ + if (count < 8) { + /* Two lots of padding: Pad the first block to 64 bytes */ + memset(p, 0, count); + byteReverse(ctx->in, 16); + MD5Transform(ctx->buf, (uint32_t *) ctx->in); + + /* Now fill the next block with 56 bytes */ + memset(ctx->in, 0, 56); + } else { + /* Pad block to 56 bytes */ + memset(p, 0, count - 8); + } + byteReverse(ctx->in, 14); + + /* Append length in bits and transform */ + ((uint32_t *) ctx->in)[14] = ctx->bits[0]; + ((uint32_t *) ctx->in)[15] = ctx->bits[1]; + + MD5Transform(ctx->buf, (uint32_t *) ctx->in); + byteReverse((uint8_t *) ctx->buf, 4); + memcpy(digest, ctx->buf, 16); + memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */ +} + +#ifndef ASM_MD5 + +/* The four core functions - F1 is optimized somewhat */ + +/* #define F1(x, y, z) (x & y | ~x & z) */ +#define F1(x, y, z) (z ^ (x & (y ^ z))) +#define F2(x, y, z) F1(z, x, y) +#define F3(x, y, z) (x ^ y ^ z) +#define F4(x, y, z) (y ^ (x | ~z)) + +/* This is the central step in the MD5 algorithm. */ +#define MD5STEP(f, w, x, y, z, data, s) \ + ( w += f(x, y, z) + data, w = w<>(32-s), w += x ) + +/* + * The core of the MD5 algorithm, this alters an existing MD5 hash to + * reflect the addition of 16 longwords of new data. MD5Update blocks + * the data and converts bytes into longwords for this routine. + */ +void MD5Transform(uint32_t buf[4], uint32_t const in[16]) +{ + uint32_t a, b, c, d; + + a = buf[0]; + b = buf[1]; + c = buf[2]; + d = buf[3]; + + MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); + MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); + MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); + MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); + MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); + MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); + MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); + MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); + MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); + MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); + MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); + MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); + MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); + MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); + MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); + MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); + + MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); + MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); + MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); + MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); + MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); + MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); + MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); + MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); + MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); + MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); + MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); + MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); + MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); + MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); + MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); + MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); + + MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); + MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); + MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); + MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); + MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); + MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); + MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); + MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); + MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); + MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); + MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); + MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); + MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); + MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); + MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); + MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); + + MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); + MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); + MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); + MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); + MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); + MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); + MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); + MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); + MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); + MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); + MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); + MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); + MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); + MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); + MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); + MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); + + buf[0] += a; + buf[1] += b; + buf[2] += c; + buf[3] += d; +} + +#endif diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/md5.h b/3rdparty/iaxclient-2/lib/libiax2/src/md5.h new file mode 100644 index 0000000..81c9e30 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/md5.h @@ -0,0 +1,27 @@ +#ifndef MD5_H +#define MD5_H + +#ifndef _MSC_VER +#include +#else +typedef unsigned int uint32_t; +typedef unsigned char uint8_t; +#endif + +struct MD5Context { + uint32_t buf[4]; + uint32_t bits[2]; + uint8_t in[64]; +}; + +void MD5Init(struct MD5Context *context); +void MD5Update(struct MD5Context *context, uint8_t const *buf, unsigned int len); +void MD5Final(uint8_t digest[16], struct MD5Context *context); +void MD5Transform(uint32_t buf[4], uint32_t const in[16]); + +/* + * This is needed to make RSAREF happy on some MS-DOS compilers. + */ +typedef struct MD5Context MD5_CTX; + +#endif /* !MD5_H */ diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.c b/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.c new file mode 100644 index 0000000..ab0dd84 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.c @@ -0,0 +1,776 @@ +/* + * Miniphone: A simple, command line telephone + * + * IAX Support for talking to Asterisk and other Gnophone clients + * + * Copyright (C) 1999, Linux Support Services, Inc. + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU General Public License + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "busy.h" +#include "dialtone.h" +#include "answer.h" +#include "ringtone.h" +#include "ring10.h" +#include "options.h" + +#define FRAME_SIZE 160 + +static char callerid[80]; + +struct peer { + int time; + gsm gsmin; + gsm gsmout; + + struct iax_session *session; + struct peer *next; +}; + +static char *audiodev = "/dev/dsp"; +static int audiofd = -1; +static struct peer *peers; +static int answered_call = 0; + +static struct peer *find_peer(struct iax_session *); +static int audio_setup(char *); +static void sighandler(int); +static void parse_args(FILE *, unsigned char *); +void do_iax_event(FILE *); +void call(FILE *, char *); +void answer_call(void); +void reject_call(void); +static void handle_event(FILE *, struct iax_event *e, struct peer *p); +void parse_cmd(FILE *, int, char **); +void issue_prompt(FILE *); +void dump_array(FILE *, char **); + +struct sound { + short *data; + int datalen; + int samplen; + int silencelen; + int repeat; +}; + +static int cursound = -1; + +static int sampsent = 0; +static int offset = 0; +static int silencelen = 0; +static int nosound = 0; + +static int offhook = 0; +static int ringing = 0; + +static int writeonly = 0; + +static struct iax_session *registry = NULL; +static struct timeval regtime; + +#define TONE_NONE -1 +#define TONE_RINGTONE 0 +#define TONE_BUSY 1 +#define TONE_CONGEST 2 +#define TONE_RINGER 3 +#define TONE_ANSWER 4 +#define TONE_DIALTONE 5 + +#define OUTPUT_NONE 0 +#define OUTPUT_SPEAKER 1 +#define OUTPUT_HANDSET 2 +#define OUTPUT_BOTH 3 + +static struct sound sounds[] = { + { ringtone, sizeof(ringtone)/2, 16000, 32000, 1 }, + { busy, sizeof(busy)/2, 4000, 4000, 1 }, + { busy, sizeof(busy)/2, 2000, 2000, 1 }, + { ring10, sizeof(ring10)/2, 16000, 32000, 1 }, + { answer, sizeof(answer)/2, 2200, 0, 0 }, + { dialtone, sizeof(dialtone)/2, 8000, 0, 1 }, +}; + +static char *help[] = { +"Welcome to the miniphone telephony client, the commands are as follows:\n", +"Help\t\t-\tDisplays this screen.", +"Help \t-\tInqueries specific information on a command.", +"Dial \t-\tDials the number supplied in the first arguement", +"Status\t\t-\tLists the current sessions and their current status.", +"Quit\t\t-\tShuts down the client.", +"", +0 +}; + +static short silence[FRAME_SIZE]; + +static struct peer *most_recent_answer; +static struct iax_session *newcall = 0; + +static struct peer *find_peer(struct iax_session *session) +{ + struct peer *cur = peers; + while(cur) { + if (cur->session == session) + return cur; + cur = cur->next; + } + return NULL; +} + +static int audio_setup(char *dev) +{ + int fd; + int fmt = AFMT_S16_LE; + int channels = 1; + int speed = 8000; + int fragsize = (40 << 16) | 6; + if ( (fd = open(dev, O_RDWR | O_NONBLOCK)) < 0) { + fprintf(stderr, "Unable to open audio device %s: %s\n", dev, strerror(errno)); + return -1; + } + if (ioctl(fd, SNDCTL_DSP_SETFMT, &fmt) || (fmt != AFMT_S16_LE)) { + fprintf(stderr, "Unable to set in signed linear format.\n"); + return -1; + } + if (ioctl(fd, SNDCTL_DSP_SETDUPLEX, 0)) { + fprintf(stderr, "Unable to set full duplex operation.\n"); + writeonly = 1; + /* return -1; */ + } + if (ioctl(fd, SNDCTL_DSP_CHANNELS, &channels) || (channels != 1)) { + fprintf(stderr, "Unable to set to mono\n"); + return -1; + } + if (ioctl(fd, SNDCTL_DSP_SPEED, &speed) || (speed != 8000)) { + fprintf(stderr, "Unable to set speed to 8000 hz\n"); + return -1; + } + if (ioctl(fd, SNDCTL_DSP_SETFRAGMENT, &fragsize)) { + fprintf(stderr, "Unable to set fragment size...\n"); + return -1; + } + + return fd; +} + +static int send_sound(int soundfd) +{ + /* Send FRAME_SIZE samples of whatever */ + short myframe[FRAME_SIZE]; + short *frame = NULL; + int total = FRAME_SIZE; + int amt=0; + int res; + int myoff; + audio_buf_info abi; + if (cursound > -1) { + res = ioctl(soundfd, SNDCTL_DSP_GETOSPACE ,&abi); + if (res) { + fprintf(stderr,"Unable to read output space\n"); + return -1; + } + /* Calculate how many samples we can send, max */ + if (total > (abi.fragments * abi.fragsize / 2)) + total = abi.fragments * abi.fragsize / 2; + res = total; + if (sampsent < sounds[cursound].samplen) { + myoff=0; + while(total) { + amt = total; + if (amt > (sounds[cursound].datalen - offset)) + amt = sounds[cursound].datalen - offset; + memcpy(myframe + myoff, sounds[cursound].data + offset, amt * 2); + total -= amt; + offset += amt; + sampsent += amt; + myoff += amt; + if (offset >= sounds[cursound].datalen) + offset = 0; + } + /* Set it up for silence */ + if (sampsent >= sounds[cursound].samplen) + silencelen = sounds[cursound].silencelen; + frame = myframe; + } else { + if (silencelen > 0) { + frame = silence; + silencelen -= res; + } else { + if (sounds[cursound].repeat) { + /* Start over */ + sampsent = 0; + offset = 0; + } else { + cursound = -1; + nosound = 0; + } + } + } +#if 0 + if (frame) + printf("res is %d, frame[0] is %d\n", res, frame[0]); +#endif + res = write(soundfd, frame, res * 2); + if (res > 0) + return 0; + return res; + } + return 0; +} + +static int iax_regtimeout(int timeout) +{ + if (timeout) { + gettimeofday(®time, NULL); + regtime.tv_sec += timeout; + } else { + regtime.tv_usec = 0; + regtime.tv_sec = 0; + } + return 0; +} + +static int check_iax_register(void) +{ + int res; + if (strlen(regpeer) && strlen(server)) { + registry = iax_session_new(); + + res = iax_register(registry, server,regpeer,regsecret, refresh); + + if (res) { + fprintf(stderr, "Failed registration: %s\n", iax_errstr); + return -1; + } + iax_regtimeout(5 * refresh / 6); + } else { + iax_regtimeout(0); + refresh = 60; + } + return 0; +} + +static int check_iax_timeout(void) +{ + struct timeval tv; + int ms; + if (!regtime.tv_usec || !regtime.tv_sec) + return -1; + gettimeofday(&tv, NULL); + if ((tv.tv_usec >= regtime.tv_usec) && (tv.tv_sec >= regtime.tv_sec)) { + check_iax_register(); + /* Have it check again soon */ + return 100; + } + ms = (regtime.tv_sec - tv.tv_sec) * 1000 + (regtime.tv_usec - tv.tv_usec) / 1000; + return ms; +} + +static int gentone(int sound, int uninterruptible) +{ + cursound = sound; + sampsent = 0; + offset = 0; + silencelen = 0; + nosound = uninterruptible; + printf("Sending tone %d\n", sound); + return 0; +} + +void +sighandler(int sig) +{ + if(sig == SIGHUP) { + puts("rehashing!"); + } else if(sig == SIGINT) { + static int prev = 0; + int cur; + + if ( (cur = time(0))-prev <= 5) { + printf("Terminating!\n"); + exit(0); + } else { + prev = cur; + printf("Press interrupt key again in the next %d seconds to really terminate\n", 5-(cur-prev)); + } + } +} + +void +parse_args(FILE *f, unsigned char *cmd) +{ + static char *argv[MAXARGS]; + unsigned char *parse = cmd; + int argc = 0, t = 0; + + // Don't mess with anything that doesn't exist... + if(!*parse) + return; + + bzero(argv, sizeof(argv)); + while(*parse) { + if(*parse < 33 || *parse > 128) { + *parse = 0, t++; + if(t > MAXARG) { + fprintf(f, "Warning: Argument exceeds maximum argument size, command ignored!\n"); + return; + } + } else if(t || !argc) { + if(argc == MAXARGS) { + fprintf(f, "Warning: Command ignored, too many arguments\n"); + return; + } + argv[argc++] = parse; + t = 0; + } + + parse++; + } + + if(argc) + parse_cmd(f, argc, argv); +} + +int +main(int argc, char *argv[]) +{ + int port; + int netfd; + int c, h=0, m, regm; + FILE *f; + int fd = STDIN_FILENO; + char rcmd[RBUFSIZE]; + fd_set readfd; + fd_set writefd; + struct timeval timer; + struct timeval *timerptr = NULL; + gsm_frame fo; + + load_options(); + + if (!strlen(callerid)) + gethostname(callerid, sizeof(callerid)); + + signal(SIGHUP, sighandler); + signal(SIGINT, sighandler); + + if ( !(f = fdopen(fd, "w+"))) { + fprintf(stderr, "Unable to create file on fd %d\n", fd); + return -1; + } + + if ( (audiofd = audio_setup(audiodev)) == -1) { + fprintf(stderr, "Fatal error: failed to open sound device"); + return -1; + } + + if ( (port = iax_init(0) < 0)) { + fprintf(stderr, "Fatal error: failed to initialize iax with port %d\n", port); + return -1; + } + + iax_set_formats(AST_FORMAT_GSM); + netfd = iax_get_fd(); + + check_iax_register(); + + fprintf(f, "Text Based Telephony Client.\n\n"); + issue_prompt(f); + + timer.tv_sec = 0; + timer.tv_usec = 0; + + while(1) { + FD_ZERO(&readfd); + FD_ZERO(&writefd); + FD_SET(fd, &readfd); + if(fd > h) + h = fd; + if(answered_call && !writeonly) { + FD_SET(audiofd, &readfd); + if(audiofd > h) + h = audiofd; + } + if (cursound > -1) { + FD_SET(audiofd, &writefd); + if (audiofd > h) + h = audiofd; + } + FD_SET(netfd, &readfd); + if(netfd > h) + h = netfd; + + if ( (c = select(h+1, &readfd, &writefd, 0, timerptr)) >= 0) { + if(FD_ISSET(fd, &readfd)) { + if ( ( fgets(&*rcmd, 256, f))) { + rcmd[strlen(rcmd)-1] = 0; + parse_args(f, &*rcmd); + } else fprintf(f, "Fatal error: failed to read data!\n"); + + issue_prompt(f); + } + if(answered_call) { + if(FD_ISSET(audiofd, &readfd)) { + static int ret, rlen = 0; + static short rbuf[FRAME_SIZE]; + + if ( (ret = read(audiofd, rbuf + rlen, 2 * (FRAME_SIZE-rlen))) == -1) { + puts("Failed to read audio."); + return -1; + } + rlen += ret/2; + if(rlen == FRAME_SIZE) { + rlen = 0; + + if(!most_recent_answer->gsmout) + most_recent_answer->gsmout = gsm_create(); + + gsm_encode(most_recent_answer->gsmout, rbuf, fo); + if(iax_send_voice(most_recent_answer->session, + AST_FORMAT_GSM, (char *)fo, sizeof(fo)) == -1) + puts("Failed to send voice!"); + } + } + } + do_iax_event(f); + m = iax_time_to_next_event(); + if(m > -1) { + timerptr = &timer; + timer.tv_sec = m /1000; + timer.tv_usec = (m % 1000) * 1000; + } else + timerptr = 0; + regm = check_iax_timeout(); + if (!timerptr || (m > regm)) { + timerptr = &timer; + timer.tv_sec = regm /1000; + timer.tv_usec = (regm % 1000) * 1000; + } + if (FD_ISSET(audiofd, &writefd)) { + send_sound(audiofd); + } + } else { + if(errno == EINTR) + continue; + fprintf(stderr, "Fatal error in select(): %s\n", strerror(errno)); + return -1; + } + } + return 0; +} + +void +do_iax_event(FILE *f) { + int sessions = 0; + struct iax_event *e = 0; + struct peer *peer; + + while ( (e = iax_get_event(0))) { + peer = find_peer(e->session); + if(peer) { + handle_event(f, e, peer); + } else if (e->session == registry) { + fprintf(stderr, "Registration complete: %s (%d)\n", + (e->event.regreply.status == IAX_REG_SUCCESS) ? "Success" : "Failed", + e->event.regreply.status); + registry = NULL; + } else { + if(e->etype != IAX_EVENT_CONNECT) { + fprintf(stderr, "Huh? This is an event for a non-existant session?\n"); + continue; + } + sessions++; + + if(sessions >= MAX_SESSIONS) { + fprintf(f, "Missed a call... too many sessions open.\n"); + } + + + if(e->event.connect.callerid && e->event.connect.dnid) + fprintf(f, "Call from '%s' for '%s'", e->event.connect.callerid, + e->event.connect.dnid); + else if(e->event.connect.dnid) { + fprintf(f, "Call from '%s'", e->event.connect.dnid); + } else if(e->event.connect.callerid) { + fprintf(f, "Call from '%s'", e->event.connect.callerid); + } else printf("Call from"); + fprintf(f, " (%s)\n", inet_ntoa(iax_get_peer_addr(e->session).sin_addr)); + + if(most_recent_answer) { + fprintf(f, "Incoming call ignored, there's already a call waiting for answer... \ +please accept or reject first\n"); + iax_reject(e->session, "Too many calls, we're busy!"); + } else { + if ( !(peer = malloc(sizeof(struct peer)))) { + fprintf(f, "Warning: Unable to allocate memory!\n"); + return; + } + + peer->time = time(0); + peer->session = e->session; + if (peer->gsmin) + free(peer->gsmin); + peer->gsmin = 0; + if (peer->gsmout) + free(peer->gsmout); + peer->gsmout = 0; + + peer->next = peers; + peers = peer; + + iax_accept(peer->session); + iax_ring_announce(peer->session); + most_recent_answer = peer; + ringing = 1; + gentone(TONE_RINGER, 0); + fprintf(f, "Incoming call!\n"); + } + issue_prompt(f); + } + iax_event_free(e); + } +} + +void +call(FILE *f, char *num) +{ + struct peer *peer; + + if(!newcall) + newcall = iax_session_new(); + else { + fprintf(f, "Already attempting to call somewhere, please cancel first!\n"); + return; + } + + if ( !(peer = malloc(sizeof(struct peer)))) { + fprintf(f, "Warning: Unable to allocate memory!\n"); + return; + } + + peer->time = time(0); + peer->session = newcall; + peer->gsmin = 0; + peer->gsmout = 0; + + peer->next = peers; + peers = peer; + + most_recent_answer = peer; + + offhook = 1; + + iax_call(peer->session, callerid, num, NULL, 10); +} + +void +answer_call(void) +{ + if(most_recent_answer) + iax_answer(most_recent_answer->session); + printf("Answering call!\n"); + answered_call = 1; + offhook = 1; + ringing = 0; + gentone(TONE_ANSWER, 1); +} + +void +reject_call(void) +{ + iax_reject(most_recent_answer->session, "Call rejected manually."); + most_recent_answer = 0; + ringing = 0; + gentone(TONE_NONE, 1); +} + +void +handle_event(FILE *f, struct iax_event *e, struct peer *p) +{ + short fr[FRAME_SIZE]; + int len; + + switch(e->etype) { + case IAX_EVENT_HANGUP: + iax_hangup(most_recent_answer->session, "Byeee!"); + fprintf(f, "Call disconnected by peer\n"); + free(most_recent_answer); + most_recent_answer = 0; + answered_call = 0; + peers = 0; + newcall = 0; + if (offhook) + gentone(TONE_CONGEST, 0); + break; + + case IAX_EVENT_REJECT: + fprintf(f, "Authentication was rejected\n"); + break; + case IAX_EVENT_ACCEPT: + fprintf(f, "Accepted...\n"); + issue_prompt(f); + break; + case IAX_EVENT_RINGA: + fprintf(f, "Ringing...\n"); + issue_prompt(f); + gentone(TONE_RINGTONE, 0); + break; + case IAX_EVENT_ANSWER: + answer_call(); + gentone(TONE_ANSWER, 1); + break; + case IAX_EVENT_VOICE: + switch(e->event.voice.format) { + case AST_FORMAT_GSM: + if(e->event.voice.datalen % 33) { + fprintf(stderr, "Weird gsm frame, not a multiple of 33.\n"); + break; + } + + if (!p->gsmin) + p->gsmin = gsm_create(); + + len = 0; + while(len < e->event.voice.datalen) { + if(gsm_decode(p->gsmin, e->event.voice.data + len, fr)) { + fprintf(stderr, "Bad GSM data\n"); + break; + } else { + int res; + + res = write(audiofd, fr, sizeof(fr)); + if (res < 0) + fprintf(f, "Write failed: %s\n", strerror(errno)); + } + len += 33; + } + break; + default : + fprintf(f, "Don't know how to handle that format %d\n", e->event.voice.format); + } + break; + default: + fprintf(f, "Unknown event: %d\n", e->etype); + } +} + +void +dump_call(void) +{ + if(most_recent_answer) + { + printf("Dumping call!\n"); + iax_hangup(most_recent_answer->session,""); + free(most_recent_answer); + } + answered_call = 0; + most_recent_answer = 0; + answered_call = 0; + peers = 0; + newcall = 0; + offhook = 0; + ringing = 0; + gentone(TONE_NONE, 0); +} + +void +parse_cmd(FILE *f, int argc, char **argv) +{ + if(!strcasecmp(argv[0], "HELP")) { + if(argc == 1) + dump_array(f, help); + else if(argc == 2) { + if(!strcasecmp(argv[1], "HELP")) + fprintf(f, "Help \t-\tDisplays general help or specific help on command if supplied an arguement\n"); + else if(!strcasecmp(argv[1], "QUIT")) + fprintf(f, "Quit\t\t-\tShuts down the miniphone\n"); + else fprintf(f, "No help available on %s\n", argv[1]); + } else { + fprintf(f, "Too many arguements for command help.\n"); + } + } else if(!strcasecmp(argv[0], "STATUS")) { + if(argc == 1) { + int c = 0; + struct peer *peerptr = peers; + + if(!peerptr) + fprintf(f, "No session matches found.\n"); + else while(peerptr) { + fprintf(f, "Listing sessions:\n\n"); + fprintf(f, "Session %d\n", ++c); + fprintf(f, "Session existed for %d seconds\n", (int)time(0)-peerptr->time); + if(answered_call) + fprintf(f, "Call answered.\n"); + else fprintf(f, "Call ringing.\n"); + + peerptr = peerptr->next; + } + } else fprintf(f, "Too many arguments for command status.\n"); + } else if(!strcasecmp(argv[0], "ANSWER")) { + if(argc > 1) + fprintf(f, "Too many arguements for command answer\n"); + else answer_call(); + } else if(!strcasecmp(argv[0], "REJECT")) { + if(argc > 1) + fprintf(f, "Too many arguements for command reject\n"); + else { + fprintf(f, "Rejecting current phone call.\n"); + reject_call(); + } + } else if (!strcasecmp(argv[0], "DUMP")) { + dump_call(); + } else if (!strcasecmp(argv[0], "HANGUP")) { + dump_call(); + } else if(!strcasecmp(argv[0], "CALL")) { + if(argc > 2) + fprintf(f, "Too many arguements for command call\n"); + else { + call(f, argv[1]); + } + } else if(!strcasecmp(argv[0], "QUIT")) { + if(argc > 1) + fprintf(f, "Too many arguements for command quit\n"); + else { + fprintf(f, "Good bye!\n"); + exit(1); + } + } else fprintf(f, "Unknown command of %s\n", argv[0]); +} + +void +issue_prompt(FILE *f) +{ + fprintf(f, "TeleClient> "); + fflush(f); +} + +void +dump_array(FILE *f, char **array) { + while(*array) + fprintf(f, "%s\n", *array++); +} diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.h b/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.h new file mode 100644 index 0000000..6e3677a --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/miniphone.h @@ -0,0 +1,6 @@ +#define RBUFSIZE 256 +#define MAXARGS 10 +#define MAXARG 256 +#define MAX_SESSIONS 4 + +extern void parse_cmd(FILE *, int, char **); diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/options.c b/3rdparty/iaxclient-2/lib/libiax2/src/options.c new file mode 100644 index 0000000..a01e3f8 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/options.c @@ -0,0 +1,137 @@ +/* + * Snomphone: IAX software for SNOM 100 Phone + * + * IAX Support for talking to Asterisk and other Gnophone clients + * + * Copyright (C) 1999, Linux Support Services, Inc. + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU General Public License + */ + +#define CONFIG_FILE "/etc/miniphone.conf" +#define USER_FILE "%s/.miniphone-conf" + +#include +#include +#include +#include + +char regpeer[256]; +char regsecret[256]; +char server[256]; +int refresh = 60; +char context[256]; +char language[256]; + +#define TYPE_STRING 0 +#define TYPE_INT 1 + +struct opt { + char *name; + void *where; + int len; + int type; +}; + +static struct opt opts[] = { + { "regpeer", regpeer, sizeof(regpeer), TYPE_STRING }, + { "regsecret", regsecret, sizeof(regsecret), TYPE_STRING }, + { "server", server, sizeof(server), TYPE_STRING }, + { "context", context, sizeof(context), TYPE_STRING }, + { "language", language, sizeof(language), TYPE_STRING }, + { "refresh", &refresh, sizeof(refresh), TYPE_INT }, +}; + +static int __load_options(char *filename) +{ + FILE *f; + int lineno = 0; + char buf[256]; + char *var, *value; + int x; + char *c; + f = fopen(filename, "r"); + if (!f) { + fprintf(stderr, "Failed to open '%s': %s\n", filename, strerror(errno)); + return -1; + } + while(!feof(f)) { + fgets(buf, sizeof(buf), f); + if (!feof(f)) { + /* Ditch comments */ + if ((c = strchr(buf, '#'))) + *c = 0; + lineno++; + /* Strip CR */ + buf[strlen(buf)-1] = '\0'; + if (strlen(buf)) { + var = strtok(buf, "="); + value = strtok(NULL, "="); + if (!var || !value) { + fprintf(stderr, "Syntax error line %d\n", lineno); + continue; + } + for (x=0;x + * + * This program is free software, distributed under the terms of + * the GNU General Public License + */ + +extern char regpeer[256]; +extern char regsecret[256]; +extern char regpeer[256]; +extern char server[256]; +extern int refresh; +extern char context[256]; +extern char language[256]; + +int save_options(void); +int load_options(void); diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/ring10.h b/3rdparty/iaxclient-2/lib/libiax2/src/ring10.h new file mode 100644 index 0000000..13fce37 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/ring10.h @@ -0,0 +1,1752 @@ +/* + * Signed 16-bit audio data + * + * Source: /home/markster/ring10.raw + * + * Copyright (C) 1999, Mark Spencer and Linux Support Services + * + * Distributed under the terms of the GNU General Public License + * + */ + +static signed short ring10[] = { +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 0x82a0, 0x8dc7, 0x607e, 0xc0c6, 0x2bd3, +0x8df5, 0x828d, 0x0716, 0xaca6, 0xcefe, 0x41df, 0xd185, 0x8aa3, 0x8b1a, 0x789b, +0x82a2, 0x804f, 0x7ea8, 0x8113, 0x7f7d, 0x7fff, 0x801e, 0x801d, 0x7f32, 0x82ec, +0x83e1, 0x7fb0, 0x7f71, 0x80de, 0x7f3d, 0x7fe3, 0x81b4, 0x7c37, 0x8553, 0x7b29, +0x7ede, 0xde6e, 0x0e64, 0xf9f4, 0x015e, 0x00f6, 0xfe56, 0x0019, 0xf8bb, 0xfd90, +0x08cc, 0x05ab, 0xfd0b, 0xf9c6, 0xf875, 0xf789, 0xfc74, 0x032e, 0xf97a, 0xf4bb, +0x0212, 0x006e, 0x03df, 0x17c5, 0x0f50, 0xfb23, 0xfdbd, 0xf7cf, 0xdf5b, 0xe2d3, +0xf111, 0xef27, 0x11c5, 0x33a4, 0x168d, 0x0145, 0x0494, 0xe85c, 0xdac3, 0xf0c7, +0xeea8, 0x0023, 0x3036, 0x252a, 0xffb7, 0x01d1, 0xf637, 0xd506, 0xe8eb, 0xf5ff, +0xe5ca, 0x1ec5, 0x3fa4, 0x0e3c, 0x1570, 0x2b37, 0xea23, 0xca43, 0xf392, 0xdf0e, +0xde40, 0x2e7c, 0x276f, 0x035c, 0x2ccc, 0x1acf, 0xcf4a, 0xeb5b, 0x0fb1, 0xe01a, +0x0c69, 0x3a97, 0xfb54, 0x0751, 0x20f1, 0xdce9, 0xd2a2, 0x19b3, 0x096f, 0xf1b6, +0x38de, 0x1f70, 0xf32b, 0x2569, 0x0650, 0xc3d7, 0xf1ad, 0x1aa5, 0xe87e, 0x0c7f, +0x406d, 0xffaa, 0x0ba8, 0x2e02, 0xe545, 0xcebb, 0x10fc, 0x0102, 0xded8, 0x2b7c, +0x2053, 0xec6f, 0x266e, 0x1770, 0xcb63, 0xf18e, 0x2015, 0xe6ef, 0xfe64, 0x3700, +0xf628, 0xfb00, 0x2e43, 0xee48, 0xcd4a, 0x1867, 0x0ec3, 0xdd77, 0x2291, 0x1c80, +0xe325, 0x19b7, 0x1719, 0xcb88, 0xeded, 0x258c, 0xe7e8, 0xf0c6, 0x2d21, 0xf3d5, +0xf494, 0x290d, 0xef7b, 0xca28, 0x12c8, 0x0d8d, 0xd5f3, 0x171d, 0x1994, 0xe0c0, +0x1348, 0x1929, 0xcf9b, 0xe6fb, 0x20ae, 0xe921, 0xed2b, 0x2c54, 0xf96e, 0xf19f, +0x21b6, 0xf12e, 0xc8b4, 0x0907, 0x0964, 0xd049, 0x0eb8, 0x1fa6, 0xe6b5, 0x0cec, +0x16b6, 0xcd0c, 0xda57, 0x17c9, 0xe440, 0xe2a2, 0x2b4d, 0xffa2, 0xec7e, 0x1ee9, +0xf674, 0xbfcb, 0xf769, 0x0402, 0xcfe8, 0x104b, 0x2734, 0xe7e9, 0x07d9, 0x19f4, +0xd032, 0xd00b, 0x0e46, 0xe17d, 0xe2d8, 0x3456, 0x0781, 0xed01, 0x238d, 0xfa72, +0xbb51, 0xf543, 0x050b, 0xccd5, 0x1491, 0x3358, 0xedad, 0x10c4, 0x283b, 0xd051, +0xc9e9, 0x11f8, 0xe2cb, 0xe534, 0x43aa, 0x1090, 0xf11b, 0x3267, 0x02c3, 0xb72d, +0xf9ac, 0x0fbd, 0xce45, 0x1d7b, 0x4389, 0xef2e, 0x1593, 0x348e, 0xd0cb, 0xca8c, +0x1f61, 0xe981, 0xdef7, 0x4774, 0x15ae, 0xefab, 0x3b28, 0x0a9e, 0xb2f6, 0xf9e9, +0x1976, 0xcc08, 0x15ab, 0x4534, 0xee6c, 0x159b, 0x3753, 0xcf09, 0xc69a, 0x2270, +0xf15c, 0xdee6, 0x48ce, 0x1af4, 0xf169, 0x3da0, 0x0d68, 0xb573, 0xff9e, 0x20ba, +0xcbfe, 0x142d, 0x4879, 0xed49, 0x1434, 0x3d96, 0xd714, 0xca99, 0x298b, 0xf708, +0xd92c, 0x4632, 0x1acc, 0xea6e, 0x3d2c, 0x1412, 0xb534, 0xfbfa, 0x24f9, 0xcd72, +0x0df9, 0x48f8, 0xeb87, 0x0bca, 0x3dd5, 0xd6cc, 0xc015, 0x2605, 0xfa87, 0xd1a9, +0x40d0, 0x1c59, 0xe0de, 0x34f9, 0x14c6, 0xaf61, 0xf2a5, 0x23e6, 0xc929, 0x01be, +0x4423, 0xe53b, 0x0182, 0x3c3a, 0xd758, 0xbb9d, 0x1fa9, 0xf454, 0xc611, 0x36e8, +0x18f7, 0xdac9, 0x2e8a, 0x126d, 0xac14, 0xead6, 0x2215, 0xc990, 0xf9f5, 0x43cb, +0xea01, 0xfcbf, 0x38fd, 0xd9f3, 0xb7cd, 0x1bc4, 0xfd41, 0xca56, 0x31e3, 0x1d4b, +0xdca2, 0x2a9f, 0x1c24, 0xb8aa, 0xeb59, 0x25d5, 0xd2d0, 0xfa10, 0x44fa, 0xefe0, +0xfced, 0x3ef4, 0xe9a1, 0xbdf0, 0x19ac, 0x0198, 0xca6f, 0x2f04, 0x25b6, 0xe187, +0x29ba, 0x250a, 0xbe42, 0xe40e, 0x24ef, 0xd75d, 0xf476, 0x44f8, 0xf719, 0xf7a1, +0x3c94, 0xf20e, 0xbcdf, 0x16a3, 0x07e8, 0xc8d4, 0x2a3e, 0x2b3f, 0xdf4e, 0x235d, +0x2c92, 0xc2c7, 0xdf39, 0x2873, 0xd790, 0xea2a, 0x47fd, 0xfd0e, 0xf0e3, 0x3bd8, +0xf4e9, 0xb265, 0x0c2c, 0x0751, 0xc302, 0x29bb, 0x37bd, 0xe138, 0x1e0c, 0x2d09, +0xbddb, 0xd246, 0x24c4, 0xd87a, 0xe5df, 0x4ff6, 0x08d6, 0xf0d8, 0x3d61, 0xf8bf, +0xaede, 0x0a36, 0x0df3, 0xc0f5, 0x23ec, 0x3e92, 0xe3d7, 0x1cad, 0x348e, 0xc0d6, +0xcd4e, 0x265c, 0xd9b6, 0xdf83, 0x510e, 0x0c41, 0xeece, 0x4153, 0xfeeb, 0xa9f6, +0x04b3, 0x12a4, 0xbf2f, 0x20d1, 0x42f4, 0xe1b1, 0x1b1e, 0x3980, 0xc2b4, 0xcb50, +0x2b74, 0xded0, 0xd835, 0x4e7a, 0x0b46, 0xe555, 0x4015, 0x0517, 0xaa54, 0x0504, +0x1932, 0xbc34, 0x1a77, 0x48b1, 0xe0bb, 0x149b, 0x3ba7, 0xc34a, 0xc481, 0x2bc2, +0xe401, 0xd20e, 0x4f53, 0x1389, 0xe3b7, 0x418b, 0x0a15, 0xa70d, 0x0024, 0x1f9f, +0xbf65, 0x142d, 0x4a81, 0xe0ca, 0x1152, 0x4325, 0xcb03, 0xc18a, 0x2b95, 0xeb45, +0xcf92, 0x4c54, 0x18ad, 0xe08b, 0x3f12, 0x1264, 0xa9fc, 0xfd97, 0x246f, 0xbf86, +0x0ce2, 0x4e7c, 0xe4f3, 0x0c20, 0x44e0, 0xd069, 0xbdcb, 0x2b8e, 0xf32d, 0xcad4, +0x464f, 0x1e76, 0xdf62, 0x3b07, 0x17ea, 0xaafb, 0xf5a0, 0x2835, 0xc7c2, 0x0842, +0x4d2b, 0xe634, 0x03ef, 0x42bc, 0xd7f2, 0xbb73, 0x2662, 0xf892, 0xc8b3, 0x3e30, +0x1f20, 0xdcca, 0x354a, 0x1c6b, 0xaf75, 0xf0f7, 0x2963, 0xc908, 0xfdbf, 0x4c3c, +0xebe5, 0x00e3, 0x44c4, 0xdf15, 0xb9e9, 0x243b, 0x00e9, 0xcb76, 0x3b53, 0x248e, +0xdc27, 0x2fcb, 0x22e5, 0xb66c, 0xec96, 0x2b19, 0xd0ef, 0xf97b, 0x48ae, 0xecc0, +0xf8b4, 0x411d, 0xe769, 0xb9f7, 0x1c41, 0x0022, 0xc369, 0x2ced, 0x23ac, 0xd8eb, +0x2522, 0x232a, 0xb611, 0xe19f, 0x2738, 0xd013, 0xece5, 0x434c, 0xf00e, 0xefcc, +0x3b79, 0xeb32, 0xb19c, 0x135e, 0x04ef, 0xc1b9, 0x27a8, 0x2992, 0xd7b3, 0x1ba5, +0x2481, 0xb8c5, 0xd97d, 0x246f, 0xd113, 0xe45d, 0x4486, 0xf7f7, 0xeb36, 0x395a, +0xf122, 0xaea5, 0x0c28, 0x05eb, 0xbde4, 0x2585, 0x36a2, 0xde67, 0x1b86, 0x2dac, +0xbd03, 0xd2b8, 0x2624, 0xd8b8, 0xe802, 0x521b, 0x0855, 0xefbc, 0x4048, 0xfad2, +0xafe2, 0x0fb1, 0x12b2, 0xc62c, 0x2c2a, 0x43f5, 0xe562, 0x1fcb, 0x3791, 0xc2ac, +0xd4d1, 0x2dfd, 0xde0a, 0xe53f, 0x5578, 0x0f49, 0xf2b6, 0x4609, 0x0105, 0xabf5, +0x09a8, 0x157e, 0xc286, 0x23e7, 0x425f, 0xe36a, 0x1d93, 0x3580, 0xbf80, 0xcaf2, +0x2a04, 0xf16e, 0xd92b, 0x0eaa, 0xf1a7, 0x1ddb, 0x5b52, 0x0665, 0xd2e3, 0x15f8, +0xf606, 0x9d42, 0xdba7, 0xf312, 0xd349, 0x21ed, 0x576a, 0x34e8, 0x2450, 0x2679, +0xdc01, 0xb506, 0xcb0f, 0xa454, 0xccf3, 0x2c13, 0x1673, 0xf8ca, 0x4ff1, 0x63ac, +0xec26, 0xd77c, 0xf1f9, 0xc268, 0xb11a, 0xdfe4, 0x02e7, 0x10f5, 0x3512, 0x19dd, +0x0edc, 0x3568, 0xf6f7, 0xbe10, 0xda93, 0xf4fe, 0xda03, 0xe293, 0x15dd, 0x15f3, +0x1ba5, 0x1521, 0x12e8, 0x23ab, 0x0fc3, 0xdb3e, 0xb671, 0xe960, 0xe13c, 0xc695, +0x1a81, 0x3d23, 0x1c56, 0x190d, 0x4234, 0x1970, 0xd784, 0xd86b, 0xb5e8, 0xc9f3, +0xeb89, 0xe344, 0x17ae, 0x5713, 0x37fc, 0xffe2, 0x36b3, 0x1dfe, 0xb963, 0xbf9c, +0xc9a1, 0xcc7b, 0xe409, 0x08a6, 0x2077, 0x3b4d, 0x3cba, 0x0553, 0x220e, 0x226e, +0xd219, 0xb7ec, 0xcb8b, 0xdf2a, 0xd0c7, 0xf5be, 0x2ff0, 0x42a6, 0x3c24, 0x25ae, +0x2d6d, 0x0d94, 0xde80, 0xb78b, 0xb12b, 0xdf7a, 0xde33, 0x0046, 0x47b1, 0x5170, +0x29c0, 0x2945, 0x3ab5, 0xf08f, 0xc806, 0xc229, 0xbbf4, 0xe40d, 0xf365, 0x0bfe, +0x448d, 0x5cd8, 0x1e52, 0x10ba, 0x3908, 0xefa4, 0xc243, 0xcf89, 0xd02d, 0xde92, +0xf8e0, 0x191e, 0x2f7b, 0x48e6, 0x1e38, 0x1074, 0x3785, 0xf8be, 0xbd1c, 0xc06b, +0xdc36, 0xdb97, 0xe3c0, 0x2042, 0x37c5, 0x36ff, 0x1b73, 0x2064, 0x2c9a, 0xefa2, +0xbf0c, 0xb7f0, 0xe221, 0xe243, 0xd998, 0x2263, 0x4bae, 0x3596, 0x18aa, 0x3763, +0x27d0, 0xdcc6, 0xcacc, 0xc06f, 0xd83d, 0xecfe, 0xeefa, 0x1ffa, 0x5052, 0x393f, +0x0af5, 0x3c9e, 0x316b, 0xd2df, 0xc575, 0xd3c8, 0xddd2, 0xdf98, 0xfbd7, 0x2929, +0x4879, 0x4052, 0x160c, 0x3708, 0x2b31, 0xdac6, 0xc0c3, 0xcfc0, 0xe71d, 0xddec, +0x0145, 0x3847, 0x457c, 0x356b, 0x214a, 0x3a5f, 0x1474, 0xd892, 0xc579, 0xc6a7, +0xe77a, 0xe4dc, 0x00ab, 0x3b89, 0x4eba, 0x290a, 0x16ea, 0x3dc6, 0x0956, 0xcc12, +0xc3bd, 0xc9e9, 0xe4be, 0xe60b, 0x0561, 0x3707, 0x4c82, 0x2444, 0x1406, 0x3a8e, +0xff5b, 0xc494, 0xbf9f, 0xcb26, 0xdfef, 0xe755, 0x1060, 0x334f, 0x40e5, 0x1f87, +0x16b9, 0x33e8, 0xfa6e, 0xc670, 0xb774, 0xcc17, 0xe18f, 0xdd0f, 0x102c, 0x3f0d, +0x4098, 0x1b95, 0x24b2, 0x315a, 0xe9d8, 0xc459, 0xb314, 0xc524, 0xe2a6, 0xe1cf, +0x100a, 0x44af, 0x455c, 0x1551, 0x264f, 0x2ab1, 0xd681, 0xb90c, 0xb4d6, 0xc68d, +0xddac, 0xef74, 0x1f57, 0x4357, 0x4192, 0x0e60, 0x1bcb, 0x20fd, 0xd477, 0xb435, +0xb3e3, 0xcdc3, 0xd9c4, 0xef97, 0x2384, 0x3b60, 0x34c9, 0x119d, 0x1f15, 0x0fb3, +0xd15d, 0xb30d, 0xa9e3, 0xd431, 0xdc02, 0xe98a, 0x2987, 0x4204, 0x290c, 0x1181, +0x2d0c, 0x0800, 0xcb55, 0xb8f5, 0xaaa6, 0xd49f, 0xe57c, 0xf063, 0x281c, 0x4c65, +0x2d19, 0x0cd2, 0x2ddb, 0xfefe, 0xc171, 0xbd4c, 0xb7c2, 0xd4c5, 0xe6f3, 0x0040, +0x2b86, 0x4b6d, 0x2ed1, 0x0ce3, 0x2d97, 0x01f9, 0xc2ad, 0xb8fc, 0xc53e, 0xe1cf, +0xea35, 0x0eb0, 0x38b8, 0x4a3b, 0x2a1e, 0x1457, 0x2a1e, 0xfbca, 0xcdf1, 0xbc93, +0xcc0b, 0xec27, 0xeb05, 0x144b, 0x4443, 0x496d, 0x2233, 0x2180, 0x30b2, 0xf03c, +0xcced, 0xbf0d, 0xcc55, 0xeec3, 0xf367, 0x186f, 0x45cd, 0x4e7d, 0x215a, 0x2485, +0x3122, 0xe7a8, 0xc40a, 0xbf85, 0xd4dd, 0xebe8, 0xf32b, 0x2121, 0x49bb, 0x4c61, +0x1af5, 0x1f88, 0x2c32, 0xe8c5, 0xc512, 0xc0b7, 0xdbf9, 0xe9ea, 0xf2f4, 0x2584, +0x43e2, 0x3e1b, 0x19cf, 0x28d2, 0x2442, 0xe27b, 0xc589, 0xbe8a, 0xdddc, 0xe567, +0xed4e, 0x27f2, 0x48cd, 0x3505, 0x0e88, 0x2cd5, 0x207d, 0xda54, 0xc1cf, 0xb8c1, +0xd925, 0xe569, 0xefd0, 0x2723, 0x4dd1, 0x38b2, 0x0de5, 0x2d90, 0x155b, 0xca06, +0xbab6, 0xbf37, 0xdd46, 0xe3fd, 0xfb50, 0x2e5d, 0x487b, 0x343e, 0x0abe, 0x25e9, +0x0f65, 0xcb83, 0xb474, 0xbc50, 0xe2ab, 0xe1df, 0xfd3e, 0x3672, 0x458b, 0x294e, +0x10fd, 0x2afa, 0x027f, 0xcae8, 0xb95b, 0xbc6f, 0xe536, 0xe3af, 0xfd1c, 0x3b18, +0x4cb1, 0x23ff, 0x13eb, 0x3353, 0xfb34, 0xc4aa, 0xb71a, 0xb9f2, 0xe1d7, 0xe97f, +0x058d, 0x3a0f, 0x4fcd, 0x2408, 0x11a3, 0x2fb9, 0xf271, 0xbb7f, 0xb447, 0xc317, +0xde44, 0xe56a, 0x110a, 0x3ccc, 0x494a, 0x1f80, 0x11af, 0x26a1, 0xeb09, 0xbcd0, +0xaf90, 0xc8d4, 0xe63f, 0xe47d, 0x1435, 0x3f4f, 0x3fbe, 0x17c7, 0x1a4f, 0x2393, +0xe191, 0xbfa1, 0xb0e4, 0xc7c9, 0xe2d9, 0xe363, 0x1625, 0x4320, 0x3da9, 0x11c4, +0x1e02, 0x1d1b, 0xd6be, 0xbe96, 0xb123, 0xc8a4, 0xe6ce, 0xef2e, 0x1c03, 0x4584, +0x3fd1, 0x1006, 0x20d8, 0x197b, 0xcf64, 0xb99e, 0xb693, 0xd396, 0xe8eb, 0xfb01, +0x2aca, 0x4b38, 0x3f87, 0x0de0, 0x1f2f, 0x1503, 0xd574, 0xba46, 0xb72d, 0xf07a, +0xfa16, 0xf608, 0x29c0, 0x3a7e, 0x42a7, 0x43ac, 0x2717, 0xec6f, 0xd732, 0xc1ac, +0xa146, 0xef37, 0x122b, 0x05c1, 0x5c67, 0x8e8c, 0x3d5e, 0x0043, 0x00d0, 0xb9ef, +0xa38d, 0xc8dd, 0xc921, 0x15c9, 0x5fe3, 0x531a, 0x477d, 0x5852, 0x1b9f, 0xb930, +0xd1b6, 0xde60, 0xbcce, 0xe7f7, 0x16b1, 0x2aeb, 0x4605, 0x3592, 0xfe8c, 0x0c1d, +0x1b24, 0xd084, 0xd667, 0x2736, 0x06f7, 0xdfa7, 0x1976, 0x0df9, 0xc5e8, 0x032b, +0x324e, 0xea0e, 0x1ab4, 0x46e4, 0xf72e, 0x0369, 0x0ef3, 0xbe35, 0xbd17, 0x10fd, +0xfb35, 0xeb3f, 0x4e43, 0x2da4, 0xfe31, 0x2f50, 0xf64c, 0xafd6, 0xe267, 0xfd01, +0xca77, 0x1087, 0x48c1, 0xfcf4, 0x1bb0, 0x31af, 0xd234, 0xc0cb, 0x054e, 0xec6b, +0xce29, 0x29db, 0x1bb4, 0xf0fd, 0x3608, 0x12eb, 0xbb40, 0xeaa8, 0x190f, 0xce00, +0xed59, 0x39ef, 0xf1f0, 0xfb2a, 0x3535, 0xe3b3, 0xbf33, 0x1a9b, 0x013b, 0xc2ab, +0x2976, 0x21e0, 0xd3d8, 0x1ca6, 0x14ae, 0xb242, 0xe538, 0x2958, 0xd98c, 0xf279, +0x4106, 0xf13e, 0xf68b, 0x3379, 0xe023, 0xb4a8, 0x104b, 0x0685, 0xcca4, 0x2e61, +0x2d96, 0xe2b8, 0x26ac, 0x2510, 0xc114, 0xd9e5, 0x1f91, 0xdbc9, 0xe515, 0x40bd, +0x0693, 0xff44, 0x3c5e, 0xf664, 0xb8dc, 0x0b37, 0x1314, 0xc29c, 0x161f, 0x3582, +0xe32e, 0x17c0, 0x2de6, 0xc7c1, 0xcfeb, 0x23a6, 0xe644, 0xe65f, 0x4256, 0xf765, +0xe698, 0x4148, 0xfbe1, 0xa6b4, 0x03fa, 0x1c92, 0xcb85, 0x1a54, 0x37af, 0xe830, +0x1b0b, 0x255d, 0xc13f, 0xd3d9, 0x205e, 0xde69, 0xe2ab, 0x48d5, 0x0931, 0xee2f, +0x3d79, 0x0658, 0xb36c, 0xf59e, 0x11f4, 0xd042, 0x110b, 0x2e1b, 0xe763, 0x2269, +0x3bda, 0xcefb, 0xd37b, 0x2d7f, 0xe9d7, 0xd48e, 0x3fd2, 0x0e86, 0xea62, 0x3cd5, +0x11e0, 0xc1dc, 0x08e0, 0x1f68, 0xd3f1, 0x1fc8, 0x3da6, 0xe12f, 0x1d62, 0x4060, +0xccb6, 0xd211, 0x316f, 0xf370, 0xe20e, 0x4657, 0x1280, 0xf30a, 0x3df0, 0x07fc, +0xb956, 0x023e, 0x1978, 0xcbba, 0x137d, 0x3ff7, 0xecbc, 0x1698, 0x3f29, 0xdf9f, +0xcc1c, 0x1bdc, 0xef17, 0xd3da, 0x346b, 0x1296, 0xeb25, 0x3885, 0x190f, 0xbf13, +0xfb71, 0x1df2, 0xc509, 0xffa2, 0x3a66, 0xe5fd, 0x04f6, 0x36be, 0xda99, 0xc67e, +0x1fc2, 0xef95, 0xcfa8, 0x39df, 0x0f1a, 0xd986, 0x2d7b, 0x0e88, 0xb2a2, 0xf40f, +0x1bd3, 0xc95c, 0x0511, 0x408d, 0xec48, 0x03d2, 0x3281, 0xd7a0, 0xb9a0, 0x13ab, +0xf02d, 0xc92c, 0x3af6, 0x26c0, 0xe5f8, 0x2de7, 0x18b9, 0xafd8, 0xddbf, 0x15bc, +0xc4d3, 0xf6dc, 0x4b73, 0xf89f, 0x018a, 0x3c4e, 0xdf11, 0xb20d, 0x12d7, 0xf511, +0xbf7e, 0x33aa, 0x286f, 0xe309, 0x3107, 0x1f74, 0xb1c3, 0xe10f, 0x1fd3, 0xc7d4, +0xef6e, 0x4b78, 0xf32f, 0xf8e5, 0x43cb, 0xe7da, 0xaf46, 0x115a, 0xfeb2, 0xbf7a, +0x2e9a, 0x2ed7, 0xde2f, 0x2807, 0x259c, 0xb09f, 0xd3d4, 0x2606, 0xd544, 0xeb3d, +0x5107, 0xfecf, 0xf63f, 0x4304, 0xedfe, 0xae0d, 0x0d7f, 0x0957, 0xc47d, 0x2f62, +0x3b51, 0xdfea, 0x2a01, 0x3390, 0xb825, 0xd3e9, 0x29f1, 0xd82e, 0xe2e3, 0x509a, +0x061c, 0xf530, 0x48b1, 0xf740, 0xabeb, 0x0d93, 0x0ed4, 0xbed0, 0x274e, 0x3e3b, +0xddc2, 0x2168, 0x35a1, 0xbbb0, 0xcedb, 0x2b94, 0xdd5b, 0xdd2d, 0x4e6a, 0x068d, +0xe741, 0x3eef, 0xfe34, 0xad12, 0x0bb7, 0x1a73, 0xbea5, 0x1c31, 0x4269, 0xdc1a, +0x1611, 0x37d6, 0xc048, 0xcaa3, 0x2f7e, 0xe59c, 0xd94c, 0x4ed8, 0x0af6, 0xe225, +0x3c84, 0xfd49, 0xa4b2, 0x048d, 0x1ed5, 0xc496, 0x1caa, 0x4641, 0xddd4, 0x1578, +0x37dc, 0xc13b, 0xcab7, 0x30dc, 0xfec0, 0xd462, 0x1387, 0x07dd, 0x14c1, 0x4b92, +0x0d74, 0xda49, 0x12de, 0x02fe, 0xb8fe, 0xeaae, 0x0363, 0xdab0, 0x23b0, 0x68fb, +0x3681, 0x1351, 0x29fc, 0xf22e, 0xb781, 0xd225, 0xc11d, 0xd7d8, 0x354d, 0x26b8, +0x09af, 0x60fa, 0x5f8c, 0xe302, 0xde80, 0xff6a, 0xbb95, 0xafec, 0x029f, 0x161d, +0x0fee, 0x3924, 0x2b6c, 0x1ed5, 0x24fe, 0xec7b, 0xc1fe, 0xe22b, 0xfbcd, 0xdc4d, +0xf3f7, 0x210f, 0x1d01, 0x1305, 0x1342, 0x1f6c, 0x0852, 0xfea5, 0xdd42, 0xc083, +0xf243, 0xde95, 0xd818, 0x23f7, 0x3eab, 0x0891, 0x1381, 0x52fd, 0xff10, 0xc983, +0xe091, 0xc3b8, 0xcafc, 0xe7d7, 0xfc8d, 0x2043, 0x559d, 0x2c2e, 0x0418, 0x4485, +0x0b4c, 0xb4e5, 0xc68e, 0xddbf, 0xd0b6, 0xdc81, 0x1e4b, 0x2d10, 0x365b, 0x2c50, +0x170a, 0x303e, 0x0a60, 0xcc89, 0xb88a, 0xdbc7, 0xe3e7, 0xcdd2, 0x0b38, 0x3c7e, +0x392b, 0x254c, 0x3272, 0x2fc9, 0xf0ee, 0xd4d8, 0xb5b4, 0xc03b, 0xdef0, 0xd8e9, +0x0edc, 0x533e, 0x46e4, 0x0fc4, 0x358a, 0x34b8, 0xd1c3, 0xbf29, 0xbb64, 0xbeea, +0xdb1c, 0xf31b, 0x17f1, 0x44fa, 0x4bfb, 0x0a36, 0x1fe2, 0x2ce9, 0xcf0d, 0xb605, +0xc6c6, 0xcc96, 0xcf30, 0xf9cd, 0x25fb, 0x36d1, 0x4086, 0x1499, 0x21d8, 0x287f, +0xde77, 0xb0fd, 0xba6d, 0xe0f5, 0xd3e4, 0xee77, 0x3561, 0x4077, 0x2baa, 0x1d38, +0x3753, 0x1587, 0xd2e2, 0xb252, 0xb44b, 0xe5a7, 0xdbb5, 0xe778, 0x3790, 0x55cb, +0x234e, 0x10ab, 0x42e9, 0x083e, 0xc15a, 0xc2a9, 0xbe30, 0xd7d1, 0xe76a, 0xfa22, +0x2b37, 0x53cb, 0x29a6, 0x0950, 0x4086, 0x0f68, 0xbba0, 0xb824, 0xcc9c, 0xd743, +0xd665, 0x06ae, 0x3597, 0x44f1, 0x2854, 0x19d4, 0x3395, 0xfe8f, 0xc1b9, 0xad2d, +0xc39d, 0xde05, 0xd850, 0x0bf2, 0x4266, 0x457f, 0x1d4b, 0x2284, 0x337f, 0xe442, +0xbc43, 0xb8ba, 0xc33a, 0xe0e4, 0xe8f8, 0x10b5, 0x4262, 0x4afc, 0x1744, 0x1d2b, +0x3125, 0xe2b5, 0xbcb6, 0xbdea, 0xccfd, 0xdfe5, 0xefed, 0x1bae, 0x3f5e, 0x451d, +0x167c, 0x1ea7, 0x2848, 0xdf70, 0xbb35, 0xbbfc, 0xd959, 0xe266, 0xec2b, 0x20e3, +0x435c, 0x3878, 0x0fee, 0x25e8, 0x1ba1, 0xdaf0, 0xc061, 0xb76f, 0xdd9c, 0xe727, +0xece4, 0x247e, 0x48ee, 0x303d, 0x099a, 0x320b, 0x19b9, 0xd0b8, 0xc508, 0xbe20, +0xd52c, 0xe430, 0xf5f1, 0x21d1, 0x4aae, 0x3670, 0x0bc4, 0x349a, 0x16c6, 0xc9e1, +0xbb8f, 0xc44e, 0xdbed, 0xde26, 0x03b2, 0x34c9, 0x4689, 0x30a8, 0x17ea, 0x33bd, +0x0b87, 0xcd79, 0xb9b9, 0xc3c1, 0xe227, 0xdffc, 0x07ae, 0x3deb, 0x4732, 0x25e8, +0x1ef9, 0x370f, 0xfb29, 0xcc78, 0xbf32, 0xc5c0, 0xe807, 0xe571, 0x074b, 0x4121, +0x4902, 0x1968, 0x206c, 0x3da5, 0xf467, 0xc9c7, 0xc240, 0xc6d8, 0xe2b1, 0xeca9, +0x0f7d, 0x3a80, 0x4ac1, 0x1bda, 0x1cdc, 0x3836, 0xee35, 0xc32e, 0xc0a2, 0xce3e, +0xdfd7, 0xe9c8, 0x162c, 0x3eb5, 0x48b0, 0x1a61, 0x1e8f, 0x2cf5, 0xe5c6, 0xbb80, +0xb378, 0xd228, 0xe3dd, 0xeba5, 0x2266, 0x46f5, 0x3e1f, 0x13fa, 0x26ea, 0x21ec, +0xd925, 0xbdc7, 0xb66d, 0xd76b, 0xe81e, 0xf025, 0x269d, 0x4d69, 0x3d40, 0x1027, +0x2c58, 0x1cc9, 0xd265, 0xbfd4, 0xbabe, 0xd919, 0xe822, 0xf931, 0x2bc9, 0x4c69, +0x3d20, 0x158d, 0x31ca, 0x1821, 0xce8a, 0xb8af, 0xba0f, 0xdfb6, 0xe677, 0xfd3b, +0x385e, 0x53d9, 0x3764, 0x14a8, 0x30af, 0x0a51, 0xcb95, 0xbad7, 0xbc48, 0xe366, +0xea7e, 0x06cf, 0x3f08, 0x53c7, 0x2fe0, 0x189d, 0x383f, 0x00fd, 0xc5f3, 0xbf0d, +0xc38f, 0xe4a3, 0xecee, 0x0ef5, 0x432c, 0x54a7, 0x2a15, 0x190d, 0x3675, 0xf7bc, +0xc3e0, 0xbc22, 0xc381, 0xe210, 0xec59, 0x15ed, 0x4300, 0x4fd8, 0x269c, 0x1bda, +0x324a, 0xed57, 0xbb9c, 0xb705, 0xceb8, 0xeb30, 0xed72, 0x1baa, 0x48ad, 0x4bd3, +0x1fde, 0x1ea9, 0x2826, 0xe505, 0xc2b3, 0xb577, 0xceec, 0xeeb9, 0xef73, 0x1fd5, +0x4c99, 0x41f7, 0x12c7, 0x24ad, 0x22eb, 0xd504, 0xbfe3, 0xba2a, 0xd063, 0xea6f, +0xf037, 0x1c9c, 0x4acf, 0x430c, 0x0b68, 0x200d, 0x1c9e, 0xcce4, 0xb9ad, 0xbc29, +0xd211, 0xe475, 0xfc21, 0x2910, 0x443b, 0x3a83, 0x0ef1, 0x2295, 0x15ac, 0xd00d, +0xb774, 0xbaff, 0xded3, 0xe41e, 0xf945, 0x331e, 0x49b7, 0x3276, 0x128d, 0x28c7, +0x08f2, 0xce8e, 0xbb2e, 0xb907, 0xe4c0, 0xe9f8, 0xf98a, 0x3323, 0x4a75, 0x2718, +0x0ddc, 0x3369, 0x0795, 0xc936, 0xc192, 0xc3cc, 0xe2b9, 0xe583, 0xfce9, 0x312f, +0x4951, 0x266f, 0x0ffe, 0x3698, 0x0679, 0xca63, 0xc301, 0xc844, 0xde4c, 0xe26e, +0x076e, 0x3283, 0x4507, 0x259a, 0x11af, 0x30ff, 0xfd1c, 0xc1b2, 0xb384, 0xc924, +0xe414, 0xde8f, 0x0781, 0x295f, 0x51b4, 0x5b09, 0x17c9, 0xf17b, 0xd9cd, 0xb11a, +0x8396, 0xbd98, 0x073f, 0x0598, 0x5258, 0x7bf8, 0x3dd3, 0x096d, 0xe7f8, 0xa966, +0x9271, 0xc3c7, 0xb173, 0xf5d9, 0x6db2, 0x3b89, 0x2231, 0x4aaf, 0x1c3b, 0xc115, +0xcb06, 0xd460, 0xbb98, 0x03f6, 0xf9d7, 0xecaf, 0x4aa5, 0x27cf, 0xcf8c, 0x0764, +0x3489, 0xd9cb, 0xf31b, 0x39b5, 0xebc3, 0xeb7f, 0x1192, 0xceee, 0xbd72, 0x16f9, +0x1b5a, 0xf888, 0x4a44, 0x34a8, 0xedd8, 0x18bb, 0xf8d6, 0xa74c, 0xd19c, 0x139c, +0xeaf7, 0x0d0b, 0x5317, 0x0e81, 0x0c44, 0x35bd, 0xe010, 0xb51d, 0x075b, 0xfc77, +0xc9ae, 0x2b95, 0x35a1, 0xf0e8, 0x2c61, 0x2481, 0xc370, 0xe826, 0x20b5, 0xd95a, +0xf832, 0x43e0, 0xf261, 0xf7ef, 0x414e, 0xf14b, 0xbf9e, 0x1c6c, 0x1380, 0xd3d1, +0x2650, 0x1f52, 0xd592, 0x1ddb, 0x2414, 0xc347, 0xebd1, 0x3e70, 0xf240, 0xeb89, +0x3d66, 0xf738, 0xe57b, 0x2fe8, 0xf22d, 0xbd68, 0x1e7b, 0x2466, 0xd858, 0x2613, +0x3122, 0xdc86, 0x16b9, 0x277b, 0xc324, 0xdb13, 0x2c78, 0xe8ab, 0xed0b, 0x49bb, +0x0342, 0xf02a, 0x3b6c, 0xf7d9, 0xb9c6, 0x0fd8, 0x1192, 0xc763, 0x12e5, 0x2738, +0xe26c, 0x1a89, 0x2a72, 0xcd72, 0xdca7, 0x27a9, 0xe962, 0xd98a, 0x271e, 0xf948, +0xe783, 0x29f0, 0x000e, 0xc137, 0x064c, 0x17e6, 0xcd48, 0x0efb, 0x329b, 0xdc50, +0xf9d6, 0x28fd, 0xd866, 0xc34b, 0x13df, 0xefa3, 0xdcbf, 0x3578, 0x09a7, 0xe33f, +0x2c3f, 0x02a6, 0xaa76, 0xf3eb, 0x1870, 0xc21d, 0x029e, 0x3d07, 0xedbb, 0x0a92, +0x33dc, 0xd94f, 0xc985, 0x15a5, 0xdf1c, 0xd3f5, 0x3f5e, 0x0fca, 0xe50f, 0x3b04, +0x1a3d, 0xb99b, 0xf6d1, 0x1c75, 0xcc21, 0x0987, 0x3e95, 0xed51, 0x0dcf, 0x3b32, +0xd980, 0xc6f7, 0x280e, 0xf587, 0xd3c2, 0x4871, 0x233c, 0xe02f, 0x3039, 0x183d, +0xaecf, 0xf137, 0x2776, 0xcc66, 0x0bf0, 0x5162, 0xeddf, 0x088c, 0x4536, 0xd457, +0xb205, 0x2315, 0xf51a, 0xc60d, 0x4281, 0x2682, 0xe5d9, 0x3aad, 0x1cab, 0xb02d, +0xf294, 0x20af, 0xbecb, 0x0084, 0x4c16, 0xeaf2, 0x054e, 0x449f, 0xdf02, 0xbd48, +0x25bf, 0xfda9, 0xcb15, 0x3a93, 0x1e9b, 0xddd4, 0x3408, 0x1f70, 0xb333, 0xf3df, +0x32ab, 0xd133, 0x014e, 0x52b2, 0xf138, 0xfe00, 0x4260, 0xe1f2, 0xbbac, 0x28bf, +0x0404, 0xcc81, 0x4649, 0x2e56, 0xdee8, 0x3677, 0x23ef, 0xabc0, 0xea62, 0x3159, +0xcf59, 0xfdcf, 0x575a, 0xf403, 0xfe40, 0x4759, 0xe094, 0xb225, 0x1ffa, 0xfefc, +0xc26f, 0x3a61, 0x2be1, 0xdb44, 0x2efe, 0x2504, 0xadcb, 0xe074, 0x2713, 0xc6d3, +0xecc2, 0x48d6, 0xea4d, 0xf2ec, 0x43a0, 0xe1fc, 0xaa5f, 0x1825, 0xffd7, 0xba38, +0x2bdb, 0x24a3, 0xce10, 0x1cd8, 0x1cfc, 0xab2e, 0xdc4d, 0x276d, 0xca22, 0xeb01, +0x4a08, 0xeb0e, 0xe94c, 0x3cd7, 0xe45f, 0xa6c6, 0x0f8c, 0x066f, 0xc2d2, 0x2a01, +0x2aea, 0xd9bf, 0x251a, 0x2933, 0xb64d, 0xd9b5, 0x26a1, 0xd2ba, 0xe822, 0x4af1, +0xfec7, 0xf323, 0x3fdf, 0xf78e, 0xb4c1, 0x0f7f, 0x0e1c, 0xc7ce, 0x25fb, 0x3129, +0xdeb5, 0x2268, 0x3385, 0xc266, 0xd9b6, 0x2efc, 0xddb0, 0xe00f, 0x45ac, 0x0168, +0xea8d, 0x3cd9, 0xfeda, 0xb603, 0x13c5, 0x166b, 0xc192, 0x1f5a, 0x3804, 0xda94, +0x15a3, 0x35b3, 0xc729, 0xd3ae, 0x2e68, 0xe359, 0xde70, 0x4764, 0x0725, 0xe6b1, +0x3882, 0xfed4, 0xad23, 0x0819, 0x16c2, 0xc15b, 0x1c91, 0x4358, 0xe49c, 0x1162, +0x35d1, 0xc8f8, 0xc74f, 0x2676, 0xe0e9, 0xd0d7, 0x4b09, 0x1cea, 0xedea, 0x3f3b, +0x11f4, 0xb09a, 0xfc73, 0x177b, 0xba40, 0x109f, 0x4fcb, 0xf285, 0x1d0f, 0x3dc2, +0xc588, 0xc98d, 0x329a, 0xfd8a, 0xcc33, 0x1573, 0x1810, 0x1532, 0x434e, 0x102d, +0xd555, 0x08d4, 0x0011, 0xb77c, 0xec37, 0x098c, 0xd4fc, 0x2033, 0x7926, 0x32be, +0xfe95, 0x28ab, 0xef9c, 0xa428, 0xcffc, 0xcbdf, 0xd07c, 0x3681, 0x2f87, 0x0680, +0x626e, 0x5e9c, 0xd624, 0xd9e4, 0x080a, 0xadfe, 0xa2f5, 0x12af, 0x142c, 0xffde, +0x3703, 0x3570, 0x269e, 0x24fb, 0xe8a1, 0xb7ec, 0xe753, 0xf82a, 0xce4d, 0x001a, +0x2e98, 0x1f84, 0x0eb8, 0x1beb, 0x2603, 0xfcff, 0xfd98, 0xd8c0, 0xc719, 0xfc52, +0xddd2, 0xe3ec, 0x2ee0, 0x4393, 0x042b, 0x1929, 0x569a, 0xef83, 0xc35d, 0xd9e5, +0xc6ce, 0xd1e0, 0xed86, 0x0b2a, 0x23b2, 0x504c, 0x20ad, 0x029d, 0x3b72, 0xf5a5, +0xad6b, 0xbe54, 0xddfc, 0xd162, 0xddcd, 0x2952, 0x324b, 0x3156, 0x1d3f, 0x12f5, +0x235b, 0xf27f, 0xc001, 0xb250, 0xdfdd, 0xe3f3, 0xd455, 0x14e4, 0x3c06, 0x3326, +0x1a60, 0x30e7, 0x24a0, 0xe2c3, 0xcd08, 0xb21c, 0xc75c, 0xdc66, 0xe088, 0x1e09, +0x54ef, 0x4197, 0x0dca, 0x356f, 0x22ce, 0xcaf2, 0xc0ce, 0xbc3d, 0xcfda, 0xe59b, +0xfe5c, 0x27b1, 0x4caa, 0x45a1, 0x0add, 0x274f, 0x1c6c, 0xcde6, 0xc343, 0xd011, +0xdf48, 0xe021, 0x0b0c, 0x335a, 0x3c8e, 0x345d, 0x0d86, 0x278e, 0x1b8f, 0xdc12, +0xbc28, 0xc6ff, 0xead3, 0xdba0, 0xfdee, 0x39b8, 0x3f03, 0x2143, 0x1858, 0x376b, +0x021b, 0xcaa8, 0xbb59, 0xc6f6, 0xef67, 0xe041, 0xf9ba, 0x3cd7, 0x4cfd, 0x168d, +0x1037, 0x3fec, 0xf71d, 0xbed3, 0xc8d6, 0xcbc6, 0xdd8f, 0xea8c, 0x09b1, 0x2e92, +0x4701, 0x1829, 0x091c, 0x3ad7, 0xfd4b, 0xb999, 0xbe68, 0xdc50, 0xdc39, 0xd663, +0x1009, 0x330e, 0x37f3, 0x1ad3, 0x1cca, 0x3476, 0xf66a, 0xc5e8, 0xbb6f, 0xd5e8, +0xe008, 0xd5ea, 0x10b5, 0x3f63, 0x3725, 0x1102, 0x2911, 0x3855, 0xe9cb, 0xc610, +0xc44b, 0xd547, 0xdd89, 0xe4aa, 0x195d, 0x4084, 0x3d9b, 0x10ab, 0x2a1f, 0x3667, +0xe38c, 0xc1a0, 0xc4c5, 0xdd94, 0xe21b, 0xe99c, 0x1f49, 0x4312, 0x3b69, 0x0f14, +0x2b3d, 0x2eaa, 0xdeab, 0xc00a, 0xc634, 0xe225, 0xe0e3, 0xf311, 0x2b9a, 0x44fd, +0x3881, 0x11ee, 0x2f2a, 0x2428, 0xdc87, 0xc347, 0xc2d0, 0xe6e0, 0xe5b0, 0xf196, +0x2d4e, 0x4a97, 0x3366, 0x1388, 0x3ae0, 0x1bf8, 0xd058, 0xc212, 0xc09b, 0xdbf3, +0xe25c, 0xfa1f, 0x3093, 0x4e94, 0x31f0, 0x12fe, 0x3bde, 0x11ad, 0xc841, 0xb8bd, +0xbe0b, 0xdd25, 0xdd7e, 0x0138, 0x3ac9, 0x4ccb, 0x2ba2, 0x1359, 0x3033, 0xfbc6, +0xc14d, 0xb543, 0xbd7e, 0xdcf8, 0xde2b, 0x0754, 0x388b, 0x409a, 0x1e0d, 0x134a, +0x2ba8, 0xeee4, 0xbe5b, 0xafaf, 0xbb90, 0xe059, 0xde74, 0x0736, 0x3d1c, 0x4310, +0x16f1, 0x1686, 0x2f2a, 0xe9de, 0xbe17, 0xb446, 0xc0ca, 0xdd27, 0xe1a0, 0x0ccd, +0x3c13, 0x4661, 0x1949, 0x196a, 0x2a50, 0xdf8d, 0xb6a7, 0xb25a, 0xc8aa, 0xdf0e, +0xe6dc, 0x19c8, 0x411d, 0x423f, 0x15db, 0x1a0d, 0x2316, 0xdf69, 0xba97, 0xb2a9, +0xd092, 0xe29a, 0xebf2, 0x2556, 0x4a3b, 0x3fb1, 0x16cb, 0x2603, 0x1c1b, 0xd67d, +0xbcf3, 0xb765, 0xdad1, 0xea4b, 0xf176, 0x27e4, 0x4d31, 0x3b4c, 0x0fab, 0x2ad5, +0x1a4d, 0xd10b, 0xbc49, 0xba78, 0xda1f, 0xe903, 0xffda, 0x308c, 0x4a2f, 0x38ce, +0x11cc, 0x299c, 0x105c, 0xcdc3, 0xba31, 0xc03e, 0xe616, 0xe849, 0xfec7, 0x37e1, +0x4e98, 0x3198, 0x12d8, 0x2aeb, 0x03e5, 0xcb29, 0xbccb, 0xc232, 0xe734, 0xeb9c, +0x07ed, 0x3d12, 0x4b48, 0x2515, 0x14e8, 0x330c, 0xfd19, 0xc86d, 0xc241, 0xca17, +0xe64b, 0xe918, 0x09ed, 0x3ba3, 0x4eee, 0x25e2, 0x167a, 0x38a6, 0xffcf, 0xcb0e, +0xc615, 0xd055, 0xe3d3, 0xeafc, 0x1602, 0x3e86, 0x49c2, 0x257e, 0x2166, 0x3bcd, +0xfc55, 0xc4ad, 0xbb87, 0xd6e3, 0xe7a1, 0xe64f, 0x1ddd, 0x4682, 0x4516, 0x1dee, +0x1dc5, 0x2b0d, 0xed86, 0xc590, 0xb97d, 0xd84f, 0xec06, 0xe368, 0x1c7f, 0x4cee, +0x3f07, 0x13c3, 0x289d, 0x28fb, 0xdcf0, 0xc5b7, 0xbdb7, 0xd4a7, 0xec46, 0xecd0, +0x1bda, 0x48cc, 0x4019, 0x0cd7, 0x23a7, 0x2698, 0xd5be, 0xbc3e, 0xb90e, 0xcc6c, +0xddf3, 0xf12b, 0x24f1, 0x4448, 0x3b5c, 0x118e, 0x2441, 0x1c2b, 0xd270, 0xb368, +0xb6c7, 0xdd46, 0xdf51, 0xefbb, 0x3138, 0x49d2, 0x3667, 0x1864, 0x2b86, 0x1073, +0xd35e, 0xbbf4, 0xb47a, 0xdfb4, 0xe8bb, 0xf6b2, 0x353a, 0x4fd4, 0x2e9f, 0x12a8, +0x323d, 0x07c8, 0xcb04, 0xc1fa, 0xbd57, 0xdf17, 0xe6e8, 0xfa82, 0x3052, 0x4c63, +0x2d83, 0x12bf, 0x3366, 0x0318, 0xc6dd, 0xbd85, 0xbc4f, 0xd9e1, 0xe604, 0x0814, +0x34df, 0x4a09, 0x2d9d, 0x148f, 0x2e79, 0xfba1, 0xc12c, 0xb277, 0xbf95, 0xdeb7, +0xe211, 0x10bc, 0x423c, 0x4956, 0x24f7, 0x1571, 0x2434, 0xebbb, 0xc333, 0xb587, +0xc733, 0xedc0, 0xebba, 0x0854, 0x3f2e, 0x6f7e, 0x4a81, 0x0e5e, 0x03fe, 0xcb43, +0xa313, 0xa8c3, 0xd5fe, 0x0fe0, 0x3ce3, 0x6922, 0x5cb3, 0x4541, 0x10b8, 0xc5c1, +0xb7c8, 0xca44, 0xca38, 0xd7f7, 0x38e7, 0x4e53, 0x1cb5, 0x3dfb, 0x3d19, 0x06ab, +0xeda0, 0xe9ef, 0xd83d, 0xf9bf, 0x0ebe, 0xca2a, 0x0a79, 0x510e, 0xf01d, 0xe7eb, +0x3be6, 0x1a2e, 0xf989, 0x353e, 0x099c, 0xe538, 0x16d7, 0xd697, 0xa93c, 0x0407, +0x1bee, 0xf75f, 0x46c6, 0x50e3, 0xf430, 0x1813, 0x169b, 0xaf5d, 0xc57c, 0x0fb5, +0xe638, 0xf7e9, 0x459c, 0x122e, 0x0654, 0x352e, 0xfc93, 0xc262, 0xf99c, 0x072c, +0xc8f1, 0x0bf2, 0x32cd, 0xf85b, 0x1790, 0x25c1, 0xde96, 0xd882, 0x18ea, 0xe834, +0xd77c, 0x3995, 0x1231, 0xeab1, 0x28e3, 0x0cfc, 0xc5ef, 0xf7bd, 0x18f1, 0xd03e, +0x057e, 0x320a, 0xe5e4, 0x07c7, 0x2d5d, 0xd88a, 0xc884, 0x2072, 0xfd6c, 0xd3d0, +0x2a59, 0x1066, 0xe564, 0x22a2, 0x047a, 0xb2ee, 0xeaad, 0x1c28, 0xcc6c, 0xf7e5, +0x3c36, 0xee88, 0xfbfb, 0x3085, 0xddf6, 0xb28a, 0x0aaf, 0xf456, 0xbc45, 0x223a, +0x21ed, 0xe31c, 0x2214, 0x1882, 0xb51a, 0xdbdc, 0x18ba, 0xc1ce, 0xe1c3, 0x397c, +0xed39, 0xf426, 0x3690, 0xe68c, 0xb498, 0x0e83, 0x00c5, 0xc494, 0x1ef7, 0x1b31, +0xdc33, 0x1f84, 0x1b7f, 0xb9c1, 0xdc07, 0x2246, 0xd5fb, 0xeaf7, 0x4a41, 0x042a, +0xed8c, 0x29a9, 0xf4c4, 0xbbf5, 0xffbd, 0x02b3, 0xd089, 0x2a98, 0x349a, 0xe5f4, +0x231d, 0x3682, 0xc042, 0xc757, 0x28ee, 0xe56b, 0xda47, 0x3eac, 0x0d7c, 0xfc17, +0x4512, 0x05d1, 0xbb63, 0x0fc8, 0x0da5, 0xb98f, 0x1ecc, 0x3aea, 0xdbbd, 0x1bd6, +0x4041, 0xd007, 0xd35e, 0x2aaf, 0xea38, 0xe711, 0x3e4a, 0xfa47, 0xef65, 0x3f02, +0xf730, 0xae98, 0x0fae, 0x1e19, 0xc953, 0x1ea3, 0x3db2, 0xe20d, 0x1043, 0x2d87, +0xc8ab, 0xca8a, 0x2270, 0xe769, 0xe021, 0x4751, 0x0a42, 0xed5b, 0x468e, 0x0a0e, +0xa823, 0xfc1e, 0x19ce, 0xc19e, 0x0fd8, 0x3c33, 0xe854, 0x1d91, 0x3f3f, 0xd03c, +0xd290, 0x2d60, 0xe292, 0xd443, 0x4229, 0x0590, 0xe446, 0x3c78, 0x0d2e, 0xbba0, +0x0b10, 0x1fdc, 0xccc6, 0x142f, 0x3174, 0xdc18, 0x1061, 0x371b, 0xd368, 0xd200, +0x2d59, 0xf1a5, 0xdc23, 0x3edd, 0x0fb6, 0xe812, 0x2f6f, 0x0a77, 0xb941, 0xfe00, +0x1d36, 0xcc9c, 0x11f2, 0x404a, 0xe70a, 0x0abc, 0x3965, 0xd3be, 0xbed2, 0x1fe7, +0xee09, 0xd03e, 0x3f07, 0x1799, 0xe33b, 0x342f, 0x1443, 0xb44b, 0xf906, 0x1979, +0xbeaf, 0x0a9f, 0x45b3, 0xe73c, 0x0a6f, 0x3e78, 0xd655, 0xc03d, 0x2087, 0xeb0b, +0xcf7a, 0x4395, 0x1915, 0xe1a6, 0x34d0, 0x134e, 0xac96, 0xeeeb, 0x1aa0, 0xc459, +0x0965, 0x4852, 0xe8bd, 0x0151, 0x3569, 0xd16f, 0xb855, 0x1c6f, 0xed54, 0xcabb, +0x428e, 0x1dfb, 0xdf3c, 0x323b, 0x15f0, 0xab84, 0xe597, 0x18a2, 0xc34f, 0x0120, +0x48dd, 0xedf1, 0x07d1, 0x3f6b, 0xd521, 0xb0ac, 0x1903, 0xf0c7, 0xc122, 0x3959, +0x22ad, 0xe010, 0x2ec7, 0x1837, 0xaaf6, 0xe170, 0x1e2b, 0xc7b9, 0xfdb5, 0x4c53, +0xebef, 0xfb34, 0x3ee4, 0xdef9, 0xb297, 0x1b34, 0xfd76, 0xc42a, 0x391e, 0x2b29, +0xde3f, 0x2dc8, 0x2491, 0xb2a5, 0xe544, 0x2b06, 0xcad8, 0xf507, 0x54ba, 0xf673, +0xfa92, 0x48ca, 0xe9a8, 0xafd3, 0x1ef7, 0x084a, 0xc383, 0x3a6e, 0x3354, 0xdbff, +0x2c3f, 0x2b2a, 0xb115, 0xe1c4, 0x348d, 0xd2d5, 0xf3b1, 0x5801, 0xf84b, 0xf5dc, +0x4897, 0xeba9, 0xac5a, 0x1d11, 0x0bb4, 0xbcd7, 0x32ed, 0x3809, 0xdc0a, 0x2aa8, +0x3035, 0xb63c, 0xddf9, 0x3359, 0xe1e6, 0xdc8c, 0x1666, 0xf007, 0x2428, 0x5dbe, +0x00c2, 0xd781, 0x22f0, 0xf405, 0xa1af, 0xed74, 0xf64b, 0xd808, 0x304e, 0x5c2f, +0x2e87, 0x2aaf, 0x32b5, 0xdc5e, 0xbf90, 0xd852, 0xad5b, 0xdde3, 0x38e2, 0x1923, +0x04d1, 0x62c4, 0x5bb8, 0xe529, 0xeaaf, 0xfd61, 0xc422, 0xc0df, 0xfa6b, 0x0d7b, +0x16ff, 0x3f3e, 0x1d78, 0x1a46, 0x3b1d, 0xf55f, 0xc829, 0xeeb5, 0x0157, 0xdd55, +0xf41a, 0x20b5, 0x1533, 0x2329, 0x1f7c, 0x1523, 0x1e43, 0x1419, 0xdc00, 0xbfc2, +0xfbcf, 0xe187, 0xd1ef, 0x2a18, 0x3c8b, 0x1862, 0x2179, 0x4380, 0x06a1, 0xdc67, +0xe0e4, 0xb854, 0xda4e, 0xf2b5, 0xe744, 0x1f54, 0x57ea, 0x2932, 0xfa55, 0x3961, +0x0fd9, 0xbac6, 0xcdda, 0xd258, 0xcf89, 0xe3ab, 0x0707, 0x1a3e, 0x3967, 0x30cc, +0x0264, 0x2d4f, 0x1e6c, 0xcc01, 0xb70b, 0xd1c4, 0xdac0, 0xca7b, 0xfba8, 0x26c2, +0x371b, 0x359b, 0x23c6, 0x2fb4, 0x0da1, 0xd9bd, 0xae9d, 0xb89c, 0xdb61, 0xcb90, +0x0132, 0x482d, 0x42cd, 0x1e49, 0x2e1f, 0x3691, 0xe7fa, 0xc93c, 0xba66, 0xbb0a, +0xe251, 0xe472, 0x0383, 0x3f08, 0x4cc8, 0x1215, 0x1c80, 0x3b71, 0xe4f3, 0xc431, +0xcbb0, 0xc403, 0xd2f9, 0xf12b, 0x1313, 0x2f50, 0x4774, 0x1313, 0x18c4, 0x4058, +0xed5d, 0xb643, 0xc25a, 0xd92a, 0xcdc3, 0xe267, 0x25f0, 0x37bf, 0x38e3, 0x1db0, +0x2909, 0x2dab, 0xe635, 0xb3fb, 0xb52f, 0xe71a, 0xdad1, 0xdbe5, 0x2dd4, 0x4a45, +0x2f11, 0x15fc, 0x375b, 0x1edc, 0xd95e, 0xc7dd, 0xb91d, 0xdb9a, 0xe8d2, 0xea7d, +0x243c, 0x50aa, 0x347a, 0x0b10, 0x3f2c, 0x24ae, 0xc984, 0xc48d, 0xccec, 0xd726, +0xda77, 0xf845, 0x2782, 0x491b, 0x3bb7, 0x1233, 0x3698, 0x200c, 0xcd29, 0xb25f, +0xc2ef, 0xdd85, 0xd457, 0xfe96, 0x3830, 0x43f0, 0x2e94, 0x1a60, 0x3369, 0x07e9, +0xcb4f, 0xb645, 0xba73, 0xdbb8, 0xdb8f, 0xffae, 0x3a33, 0x48d7, 0x2211, 0x15da, +0x362f, 0xfbd5, 0xc39a, 0xb7fb, 0xc2cf, 0xe1cd, 0xe2d2, 0x0604, 0x36c9, 0x495d, +0x209d, 0x15d2, 0x37e6, 0xf91a, 0xc431, 0xbe00, 0xccf7, 0xe3be, 0xe90a, 0x14f8, +0x3bed, 0x4775, 0x22c5, 0x1a55, 0x2eb8, 0xf7ab, 0xcbee, 0xbb0a, 0xd4b7, 0xea3e, +0xe43a, 0x18fd, 0x455e, 0x429e, 0x1d75, 0x27b4, 0x2e04, 0xeadd, 0xca0c, 0xb834, +0xcf7e, 0xebe8, 0xec12, 0x1d2b, 0x4ce6, 0x4388, 0x1410, 0x2882, 0x2863, 0xdbfa, +0xc201, 0xbc64, 0xd1a8, 0xe40d, 0xf23c, 0x21f6, 0x44ac, 0x3ed5, 0x105b, 0x1f33, +0x1ab9, 0xd393, 0xb879, 0xb8a2, 0xd559, 0xdf87, 0xf31b, 0x2555, 0x3b7c, 0x3066, +0x0f9b, 0x206c, 0x1043, 0xd352, 0xb6fe, 0xb4ae, 0xdacb, 0xdd79, 0xed28, 0x2944, +0x40cc, 0x26e3, 0x1073, 0x2c6d, 0x0a8e, 0xd1fe, 0xbe7c, 0xb79c, 0xdbb0, 0xe28f, +0xf1b8, 0x2782, 0x45d6, 0x288a, 0x146e, 0x3752, 0x08d7, 0xccea, 0xc003, 0xbd89, +0xda98, 0xe4f4, 0x0193, 0x3341, 0x4c65, 0x29eb, 0x1665, 0x385c, 0x0502, 0xcaf3, +0xbfdd, 0xc859, 0xe1b4, 0xe85f, 0x0f40, 0x394b, 0x49b1, 0x2907, 0x1adb, 0x324c, +0xf922, 0xc6e9, 0xb961, 0xcbdd, 0xe7b2, 0xe6bd, 0x11f6, 0x3fef, 0x46fb, 0x1df6, +0x1d0f, 0x2f40, 0xeef5, 0xc4a6, 0xb575, 0xcb9f, 0xe637, 0xea22, 0x1afc, 0x450f, +0x486c, 0x1ca2, 0x2081, 0x27c1, 0xe170, 0xbe81, 0xb610, 0xd4bd, 0xe951, 0xed82, +0x22d8, 0x4920, 0x44fd, 0x1967, 0x24be, 0x230d, 0xdd5b, 0xbd48, 0xb2b2, 0xd74f, +0xebd6, 0xf51e, 0x2d0e, 0x4f15, 0x406d, 0x18ea, 0x2d32, 0x1b37, 0xd68b, 0xc044, +0xb935, 0xdd2b, 0xe8ca, 0xf474, 0x309b, 0x54b6, 0x3c42, 0x14ba, 0x347b, 0x1910, +0xd0a8, 0xbcba, 0xb8c9, 0xdc46, 0xe9fe, 0xfff4, 0x3532, 0x5389, 0x3988, 0x14af, +0x3504, 0x102d, 0xc848, 0xb929, 0xbe6f, 0xdd0e, 0xe430, 0x059c, 0x3ba7, 0x4f58, +0x2e33, 0x10f0, 0x2a2f, 0xfdb9, 0xc2f6, 0xafbb, 0xbb99, 0xe4f6, 0xe5f2, 0x07f0, +0x3ce6, 0x4606, 0x2206, 0x1803, 0x2b80, 0xee52, 0xc24f, 0xb46d, 0xbb4a, 0xe32e, +0xe633, 0x0953, 0x4238, 0x4b00, 0x1a28, 0x1723, 0x280d, 0xe191, 0xbf29, 0xb512, +0xbb95, 0xe083, 0xee77, 0x11e1, 0x3d02, 0x4905, 0x18fb, 0x175c, 0x25d3, 0xdaba, +0xb4bd, 0xb51c, 0xcc2b, 0xe1c5, 0xed1f, 0x1d15, 0x42ae, 0x42e0, 0x12aa, 0x15c7, +0x1ce6, 0xdd86, 0xbb2e, 0xb339, 0xd4c6, 0xe6a3, 0xee5c, 0x246d, 0x4599, 0x378a, +0x117f, 0x247f, 0x1587, 0xd40f, 0xc211, 0xba12, 0xda04, 0xe9d2, 0xf097, 0x2593, +0x4a0d, 0x33f2, 0x0e58, 0x2f92, 0x1796, 0xd23e, 0xc5d1, 0xbd1d, 0xd6a8, 0xea03, +0xfd4b, 0x2b76, 0x4d07, 0x372b, 0x12c1, 0x3610, 0x1455, 0xc9fa, 0xc082, 0xc65f, +0xdbf3, 0xe5fa, 0x0864, 0x3695, 0x4d6d, 0x3441, 0x13be, 0x2f2f, 0x090c, 0xce34, +0xb830, 0xc505, 0xfada, 0xec81, 0xfb68, 0x2eba, 0x319e, 0x3ce2, 0x44fb, 0x1d01, +0xdd9d, 0xd66a, 0xb232, 0xa016, 0xf64b, 0xfff6, 0x09d5, 0x7376, 0x8570, 0x20f6, +0xfe82, 0xf200, 0x9a52, 0xa325, 0xc4f5, 0xcbde, 0x2c79, 0x67bb, 0x4c8f, 0x46a8, +0x523c, 0xf79d, 0xabd0, 0xda12, 0xcc15, 0xb71c, 0xf62d, 0x1e60, 0x327a, 0x4b18, +0x2770, 0xf598, 0x157f, 0x094e, 0xbe89, 0xebf7, 0x2a77, 0xf098, 0xe9ee, 0x28e2, +0xf32a, 0xc056, 0x237c, 0x271d, 0xe4a4, 0x3978, 0x35ba, 0xe536, 0x10f5, 0xfdaa, +0xa68b, 0xd3ea, 0x212f, 0xea07, 0x08a6, 0x5e96, 0x0ae2, 0x07c6, 0x37b6, 0xd70c, +0xb092, 0xfe7d, 0xf21a, 0xcad9, 0x34d2, 0x36e9, 0xf083, 0x37da, 0x22a5, 0xbc01, +0xdc00, 0x1395, 0xd553, 0xe5e3, 0x3bac, 0xfd08, 0xfe92, 0x3f5c, 0xee23, 0xbc45, +0x0d39, 0x0a9c, 0xc61a, 0x146f, 0x2951, 0xdb39, 0x171e, 0x293d, 0xc2e7, 0xdd20, +0x32b9, 0xe330, 0xd7b9, 0x3cc5, 0xf7d9, 0xdcad, 0x311b, 0xf1df, 0xb0b8, 0x105b, +0x1a8c, 0xca51, 0x1be5, 0x2f80, 0xd616, 0x11ca, 0x2652, 0xbc4e, 0xcb96, 0x21a7, +0xe4b4, 0xe253, 0x4487, 0x0196, 0xe674, 0x3516, 0xfb04, 0xb3bc, 0xfeb8, 0x1079, +0xc24e, 0x088e, 0x3298, 0xe80b, 0x14c1, 0x2ed3, 0xd1a8, 0xcf82, 0x2207, 0xee50, +0xcf02, 0x2dec, 0x08af, 0xe42a, 0x344d, 0x0fb2, 0xb971, 0xfa3f, 0x1df7, 0xd32e, +0x11cc, 0x3722, 0xda30, 0x07ac, 0x3d3f, 0xd7ab, 0xc34d, 0x271b, 0xfe76, 0xdbb3, +0x3d61, 0x18ed, 0xed9b, 0x3389, 0x0c14, 0xba7c, 0xf987, 0x187e, 0xcd50, 0x1066, +0x476b, 0xf480, 0x1314, 0x42bb, 0xe5fe, 0xc3be, 0x1389, 0xf39f, 0xd575, 0x3648, +0x1e47, 0xf2fa, 0x3e74, 0x234a, 0xbf4c, 0xf288, 0x221b, 0xc710, 0xfa3c, 0x5035, +0xfb9e, 0x0502, 0x44eb, 0xeee6, 0xc43e, 0x1d61, 0xfb1c, 0xc9de, 0x3c74, 0x2aae, +0xe190, 0x3674, 0x2619, 0xaff2, 0xe8b6, 0x2937, 0xc78c, 0xf5df, 0x540b, 0xfb05, +0x020b, 0x434b, 0xe0e6, 0xacc1, 0x10fc, 0xf91d, 0xbcee, 0x3592, 0x3566, 0xe36e, +0x337d, 0x30bf, 0xb32f, 0xd426, 0x2162, 0xc820, 0xe042, 0x4c56, 0xfe46, 0xf61f, +0x4a89, 0xf803, 0xad4d, 0x11a6, 0x0a6c, 0xb6d1, 0x253a, 0x3311, 0xd5a0, 0x2667, +0x3498, 0xb800, 0xd872, 0x2f83, 0xd41e, 0xe4e1, 0x5463, 0xf738, 0xea30, 0x492c, +0xf007, 0xaab2, 0x16ec, 0x11da, 0xc262, 0x2e37, 0x3e3b, 0xdd03, 0x22dd, 0x30e8, +0xb674, 0xd170, 0x2e2c, 0xdcd6, 0xe399, 0x56b9, 0x04f1, 0xea52, 0x4a44, 0xfd31, +0xa60d, 0x09bf, 0x162d, 0xbcc9, 0x1f55, 0x4352, 0xde68, 0x1cd9, 0x3c0d, 0xbf98, +0xc8d8, 0x2a1f, 0xdc64, 0xd503, 0x4d6c, 0x0785, 0xe7a8, 0x476e, 0xff01, 0xa5cd, +0x064f, 0x17bf, 0xbe55, 0x1800, 0x3b7b, 0xd4d9, 0x10f0, 0x3690, 0xbf8d, 0xc71e, +0x297a, 0xe393, 0xd729, 0x47fe, 0x0285, 0xda51, 0x391b, 0xfeb3, 0xa48e, 0xfbc3, +0x19a9, 0xc3a0, 0x108e, 0x3eae, 0xdebc, 0x0f12, 0x36a2, 0xc4c0, 0xbf91, 0x1e2f, +0xe5de, 0xd395, 0x4354, 0x10d5, 0xe319, 0x39c0, 0x0a87, 0xace4, 0xf7d2, 0x18b7, +0xc582, 0x0b6f, 0x3da5, 0xe290, 0x0dde, 0x3c3e, 0xcfe6, 0xc55b, 0x253d, 0xeca1, +0xcf94, 0x3b7a, 0x0f41, 0xdf74, 0x366b, 0x1370, 0xb644, 0xfb14, 0x1f1e, 0xc7c9, +0x07b4, 0x41e9, 0xe70d, 0x071d, 0x3d77, 0xdb66, 0xc478, 0x265f, 0xf916, 0xd180, +0x3ee6, 0x1beb, 0xdeb9, 0x31d9, 0x191a, 0xb479, 0xf52c, 0x2801, 0xccf7, 0x03d4, +0x4bd7, 0xedac, 0x016a, 0x3a65, 0xd6fc, 0xbe27, 0x2266, 0x07f4, 0xd0c6, 0x0dcf, +0x1281, 0x0eb0, 0x45e8, 0x1d9a, 0xd8e3, 0x05c1, 0x084a, 0xb5be, 0xdaec, 0x09a2, +0xe1b9, 0x11ee, 0x6086, 0x43d5, 0x17db, 0x2892, 0xfb50, 0xb60e, 0xc9f7, 0xc054, +0xc68d, 0x23e0, 0x2ffe, 0x062b, 0x4e99, 0x701f, 0xf80e, 0xd329, 0xff2c, 0xcb90, +0xa2d6, 0xed8c, 0x1910, 0x0699, 0x2f80, 0x3089, 0x1d1c, 0x374f, 0x03b2, 0xc14c, +0xd8b6, 0xfb3d, 0xd617, 0xe1a7, 0x22a2, 0x2021, 0x1a55, 0x1dcb, 0x2025, 0x150c, +0x0753, 0xe11c, 0xb5ad, 0xeb4f, 0xe450, 0xcc01, 0x1b1d, 0x3faa, 0x18aa, 0x0e6d, +0x4970, 0x17e5, 0xcba3, 0xd80b, 0xbb23, 0xc5d9, 0xe755, 0xf01c, 0x158e, 0x5028, +0x3e7d, 0xfcdb, 0x3482, 0x21eb, 0xbae5, 0xbfbe, 0xd2fb, 0xcfc4, 0xd821, 0x0aca, +0x27bb, 0x3924, 0x3d1e, 0x0e86, 0x271a, 0x205b, 0xd16c, 0xaf53, 0xc9df, 0xe377, +0xce6f, 0xfa21, 0x34f1, 0x4083, 0x3410, 0x259d, 0x319d, 0x06b6, 0xd9dc, 0xb750, +0xb2df, 0xde42, 0xd8e4, 0xfe96, 0x4970, 0x54f6, 0x25ba, 0x2520, 0x3c2e, 0xedea, +0xc061, 0xba0d, 0xba48, 0xde9c, 0xeb84, 0x0af2, 0x401e, 0x56b2, 0x1aa5, 0x0f66, +0x36cf, 0xe844, 0xb80e, 0xc1dd, 0xc246, 0xcece, 0xe9fe, 0x177a, 0x32d2, 0x4547, +0x1818, 0x0c52, 0x30b6, 0xec12, 0xaf1a, 0xb2f2, 0xcfa8, 0xd2b1, 0xdf9e, 0x2116, +0x3ab2, 0x35ab, 0x1b48, 0x247c, 0x25e1, 0xdedd, 0xb1e5, 0xaf2b, 0xdb4a, 0xe17b, +0xdfc7, 0x27da, 0x4f71, 0x34be, 0x0ed1, 0x2d58, 0x1ef5, 0xd091, 0xc1bb, 0xbe47, +0xd524, 0xeaee, 0xf469, 0x2112, 0x4cf4, 0x3d3e, 0x0aff, 0x304c, 0x281a, 0xcdc7, +0xbbed, 0xd088, 0xe04a, 0xdeea, 0xfee9, 0x2f94, 0x47fc, 0x3dff, 0x1a27, 0x31e9, +0x1deb, 0xd894, 0xbec6, 0xc6e8, 0xe5fc, 0xe340, 0x014d, 0x3cd1, 0x4e2f, 0x32bd, +0x1d0c, 0x372e, 0x0af1, 0xce88, 0xc502, 0xc97d, 0xe495, 0xeb9c, 0x0798, 0x374a, +0x4e4d, 0x2a7e, 0x16b3, 0x3ddd, 0x08ed, 0xc949, 0xc5ee, 0xce08, 0xdf28, 0xe8b7, +0x0fe9, 0x3689, 0x490a, 0x2817, 0x1714, 0x38c1, 0x0109, 0xc527, 0xc1af, 0xd087, +0xdced, 0xe41e, 0x12dc, 0x3476, 0x3cd2, 0x201b, 0x1cbb, 0x2e40, 0xf269, 0xc5fe, +0xb844, 0xcaac, 0xdf7f, 0xe02f, 0x0f09, 0x373a, 0x383b, 0x13eb, 0x21ef, 0x2cbc, +0xe41a, 0xc568, 0xb82e, 0xc319, 0xdca2, 0xe63b, 0x0f93, 0x3ca2, 0x4202, 0x11af, +0x2392, 0x2ac6, 0xd906, 0xb7d3, 0xb715, 0xce35, 0xdb89, 0xef49, 0x2213, 0x3ff6, +0x3f4b, 0x14d9, 0x2398, 0x1f27, 0xd7ab, 0xb866, 0xb50a, 0xd74b, 0xe11e, 0xf58b, +0x2ece, 0x467f, 0x3963, 0x1933, 0x2caa, 0x1426, 0xd5d8, 0xbe81, 0xb620, 0xdf76, +0xe789, 0xf65e, 0x349f, 0x505c, 0x3366, 0x16ea, 0x3646, 0x0f5a, 0xd18a, 0xc1b2, +0xb7f7, 0xdd2a, 0xeb2f, 0xfd79, 0x30f5, 0x516e, 0x31d6, 0x12af, 0x388a, 0x0be7, +0xca82, 0xbdf0, 0xbc89, 0xda3c, 0xe687, 0x06e8, 0x3695, 0x5204, 0x3323, 0x158c, +0x3447, 0x05f1, 0xca02, 0xb88d, 0xc1cf, 0xe381, 0xea5c, 0x110d, 0x40c6, 0x4e27, +0x2a69, 0x1e8c, 0x30b5, 0xf349, 0xc5eb, 0xb6f0, 0xc440, 0xe7cd, 0xebf2, 0x1281, +0x4308, 0x4ce7, 0x1f25, 0x1bf5, 0x2d5c, 0xe897, 0xc291, 0xb85f, 0xc6be, 0xe556, +0xf257, 0x1cc0, 0x442d, 0x4d14, 0x200a, 0x1f36, 0x26a6, 0xdf96, 0xbef2, 0xb898, +0xd0e1, 0xe9a1, 0xf513, 0x2536, 0x486a, 0x4666, 0x1bd4, 0x216e, 0x1a61, 0xd966, +0xbfd6, 0xb46f, 0xd414, 0xeb0f, 0xf5c1, 0x2917, 0x4b03, 0x3b01, 0x120a, 0x279d, +0x127b, 0xce60, 0xc0b2, 0xbaa1, 0xd93a, 0xea16, 0xf79d, 0x29e1, 0x4e28, 0x3952, +0x0c9b, 0x2918, 0x0da3, 0xc8e3, 0xbf5d, 0xbd5b, 0xd7be, 0xe6b5, 0xff78, 0x2bfe, +0x474e, 0x30ea, 0x0afb, 0x2996, 0x09da, 0xc618, 0xb66b, 0xc002, 0xde8f, 0xe009, +0x0068, 0x34b1, 0x479e, 0x290d, 0x1057, 0x2cf4, 0x0037, 0xc901, 0xba19, 0xc161, +0xe4c1, 0xe626, 0x06b7, 0x3bce, 0x46e6, 0x1fc6, 0x1c43, 0x37dd, 0xf4a3, 0xc6e9, +0xc0da, 0xc57a, 0xe45d, 0xe96e, 0x0b68, 0x3e09, 0x4c53, 0x1c9e, 0x1978, 0x350c, +0xec82, 0xc2fd, 0xc069, 0xc683, 0xdf64, 0xee42, 0x1619, 0x39da, 0x4685, 0x1dc8, +0x1c78, 0x2de4, 0xe52f, 0xbb56, 0xb88c, 0xd10f, 0xe424, 0xed39, 0x226e, 0x45c9, +0x4373, 0x1798, 0x1d16, 0x2213, 0xe050, 0xbf9c, 0xb315, 0xd32f, 0xe7c5, 0xec31, +0x23d2, 0x48dd, 0x38f4, 0x0de0, 0x25fc, 0x1996, 0xcef8, 0xbc82, 0xb55a, 0xd59c, +0xe89f, 0xefe0, 0x23a4, 0x4993, 0x37a4, 0x0c32, 0x2be5, 0x17d1, 0xcddd, 0xc07a, +0xb8e9, 0xd329, 0xe54b, 0xfb4e, 0x2cfc, 0x4d3a, 0x3bad, 0x0fee, 0x2b2b, 0x1047, +0xc712, 0xb4f7, 0xbbf0, 0xdc5f, 0xe2f3, 0xfef6, 0x224e, 0x4c36, 0x6c76, 0x2b5c, +0xfa57, 0xe594, 0xbdb1, 0x8b0a, 0xa7ca, 0x0160, 0x0786, 0x400c, 0x8424, 0x5796, +0x1be9, 0xf540, 0xbdf9, 0x9768, 0xc4df, 0xbd3d, 0xdd3d, 0x63d3, 0x4e65, 0x1fea, +0x4e57, 0x38bb, 0xd91b, 0xcd56, 0xe3ad, 0xbffd, 0xfbd6, 0x0607, 0xdb8e, 0x3ccb, +0x4192, 0xd6b0, 0xf73b, 0x42bf, 0xeff1, 0xe330, 0x3dbd, 0xfa84, 0xdccf, 0x13df, +0xde74, 0xb718, 0x0b45, 0x28d2, 0xfb25, 0x3fa0, 0x4276, 0xedb2, 0x1335, 0x0954, +0xadc9, 0xc6fc, 0x1522, 0xf53c, 0xfe45, 0x4b87, 0x18e7, 0x04a7, 0x3412, 0xee3f, +0xb321, 0xfd48, 0x04c9, 0xc508, 0x15a8, 0x372c, 0xeb2f, 0x165c, 0x2ca0, 0xce55, +0xd34d, 0x1c95, 0xe2fd, 0xdd7e, 0x3294, 0xf905, 0xe452, 0x34a4, 0x04d0, 0xbdd7, +0x0a01, 0x1d14, 0xce45, 0x0c02, 0x2888, 0xd716, 0x03dc, 0x2b4a, 0xd5cd, 0xd68c, +0x2ef2, 0xfc10, 0xda6f, 0x316f, 0x0773, 0xda8e, 0x2215, 0x0507, 0xb6f3, 0xfe70, +0x2a5d, 0xd6c8, 0x0b84, 0x4188, 0xe8c4, 0xfdd0, 0x2ec5, 0xd794, 0xc3a2, 0x2279, +0xf779, 0xd09d, 0x423d, 0x27fc, 0xe6f8, 0x2f40, 0x1b5a, 0xbc8b, 0xf157, 0x1fb4, +0xcaa0, 0xfa3a, 0x4232, 0xf922, 0x0ecb, 0x3f09, 0xe3ee, 0xc318, 0x1cef, 0xfdc1, +0xca4c, 0x2a22, 0x20f1, 0xe87d, 0x279c, 0x1afc, 0xbe72, 0xe720, 0x2220, 0xd1d4, +0xf6a7, 0x4e3e, 0xf5f4, 0xecca, 0x3b54, 0xf567, 0xb06f, 0x0a45, 0x0b98, 0xc973, +0x28f0, 0x2f21, 0xdfeb, 0x24a0, 0x2810, 0xaef4, 0xd207, 0x2ab3, 0xcd51, 0xdc82, +0x4ca3, 0xfdde, 0xef82, 0x40ab, 0xf143, 0xac33, 0x082b, 0xfdac, 0xb9b7, 0x28f3, +0x2b71, 0xd054, 0x2723, 0x3651, 0xb6cf, 0xd176, 0x2ba8, 0xd75d, 0xdb92, 0x450f, +0xfd8f, 0xec9c, 0x3e23, 0xf598, 0xaf02, 0x111a, 0x135a, 0xbd2d, 0x2334, 0x3d0a, +0xd3d8, 0x1768, 0x3bb0, 0xbab9, 0xc676, 0x311a, 0xe06f, 0xd889, 0x5018, 0x070b, +0xe756, 0x4942, 0xfd09, 0x9d71, 0x0bcc, 0x1bed, 0xb4ce, 0x1c66, 0x47ec, 0xdc5f, +0x1b74, 0x4238, 0xc481, 0xcf1b, 0x32f5, 0xe1ce, 0xda85, 0x4e4d, 0x0437, 0xe474, +0x4777, 0x07ed, 0xaff9, 0x127d, 0x24cd, 0xc370, 0x199d, 0x3e29, 0xd8bf, 0x14fd, +0x3d8b, 0xc8ea, 0xd1b6, 0x3766, 0xecd3, 0xda6f, 0x4fa7, 0x0ce7, 0xdddd, 0x4019, +0x0c05, 0xaedb, 0x0dbc, 0x2b4c, 0xcdd3, 0x1ddc, 0x470d, 0xe283, 0x1764, 0x40d4, +0xcabb, 0xcd66, 0x3585, 0xf1c2, 0xdda9, 0x4ffb, 0x11e4, 0xe28a, 0x415d, 0x12d2, +0xb486, 0x055e, 0x1fd4, 0xc66e, 0x12ca, 0x417e, 0xe4e2, 0x1229, 0x3e2a, 0xd10c, +0xc800, 0x29e0, 0xed4e, 0xd10c, 0x3fcc, 0x11a3, 0xe1f9, 0x3ad7, 0x16ca, 0xb727, +0x0155, 0x2400, 0xc8c6, 0x0c22, 0x40bf, 0xe1dc, 0x06e9, 0x3e89, 0xd924, 0xc59a, +0x27a2, 0xf22c, 0xcfad, 0x3f51, 0x14cd, 0xda51, 0x2f15, 0x1235, 0xae68, 0xedef, +0x1983, 0xc602, 0x06d9, 0x46e6, 0xe9de, 0x01cd, 0x3928, 0xd470, 0xb512, 0x15ff, +0xec31, 0xc9cd, 0x3f78, 0x243a, 0xe15e, 0x29ed, 0x1245, 0xaba1, 0xe5e9, 0x199e, +0xc296, 0xfe39, 0x4ac5, 0xeb5f, 0xfa56, 0x3c11, 0xd94f, 0xae50, 0x1511, 0xf001, +0xbde3, 0x36c2, 0x230d, 0xd7fe, 0x2c17, 0x1e3a, 0xaa06, 0xe31f, 0x226e, 0xc144, +0xf626, 0x4f4e, 0xeb1e, 0xf4dd, 0x3e8c, 0xdc0a, 0xaf47, 0x1e56, 0xfed8, 0xc48e, +0x3d56, 0x2b0f, 0xd682, 0x2918, 0x1dec, 0xa955, 0xe5bb, 0x2b6b, 0xc9b8, 0xfa77, +0x56f8, 0xf481, 0xfb61, 0x4479, 0xdf2e, 0xabca, 0x1c70, 0xffe7, 0xbc88, 0x3a59, +0x3826, 0xe054, 0x2f4b, 0x2c11, 0xb1dd, 0xe03e, 0x2b29, 0xc998, 0xf18d, 0x59ee, +0xf7ac, 0xf73d, 0x4d8e, 0xed67, 0xb1d8, 0x21a9, 0x1848, 0xccda, 0x07a8, 0xffcd, +0xfa23, 0x5aea, 0x3797, 0xd62f, 0x0ab0, 0x245e, 0xb225, 0xc27c, 0x09d2, 0xd863, +0xfe56, 0x5bb6, 0x4ddb, 0x2aa0, 0x3bda, 0x0b4a, 0xc172, 0xdcc2, 0xc178, 0xb04a, +0x211f, 0x3a69, 0xf99a, 0x3316, 0x7dfa, 0x1afe, 0xd954, 0x046d, 0xdf49, 0xb051, +0xdb3e, 0x09de, 0x0f9f, 0x347e, 0x2f84, 0x0af2, 0x3895, 0x1ade, 0xc5b6, 0xd468, +0xfe63, 0xe6d0, 0xddae, 0x14b5, 0x175e, 0x16c3, 0x1fae, 0x122e, 0x1fcb, 0x16f5, +0xef7f, 0xbe99, 0xdd8a, 0xf61b, 0xc6ce, 0x019a, 0x43c3, 0x2909, 0x1168, 0x39ad, +0x2f76, 0xde14, 0xddd2, 0xc963, 0xbd2a, 0xea45, 0xea62, 0x0266, 0x4616, 0x4e1c, +0x015e, 0x18de, 0x36f6, 0xcf20, 0xb656, 0xd210, 0xd017, 0xd8b3, 0xfb2f, 0x1950, +0x2b27, 0x3c69, 0x095e, 0x0ec5, 0x2d9c, 0xe85e, 0xb75b, 0xc4ac, 0xe1a3, 0xcfe0, +0xdf2a, 0x1a10, 0x3183, 0x376b, 0x1d4c, 0x237d, 0x185c, 0xe4f3, 0xbf7b, 0xab18, +0xcfc2, 0xd346, 0xe11c, 0x2903, 0x45ea, 0x24aa, 0x102b, 0x353d, 0x080f, 0xc677, +0xbdeb, 0xb32e, 0xd477, 0xe331, 0xef66, 0x2325, 0x4c5c, 0x27b3, 0xfaf5, 0x3106, +0x1252, 0xc709, 0xca81, 0xcbe5, 0xd04d, 0xdd4e, 0xfd3c, 0x1a5f, 0x3c21, 0x2935, +0x0252, 0x3750, 0x1e8e, 0xc8e4, 0xb83e, 0xd48f, 0xdc6e, 0xce04, 0x0585, 0x31bc, +0x360a, 0x2009, 0x14c2, 0x394e, 0x10a3, 0xc93d, 0xafa5, 0xd6b1, 0xef04, 0xcd94, +0x0467, 0x48be, 0x4051, 0x1437, 0x1fb5, 0x3cd3, 0xf79e, 0xcc8f, 0xc153, 0xcd1f, +0xeeb7, 0xe37c, 0x03cf, 0x4174, 0x4958, 0x1000, 0x1d3b, 0x4853, 0xf289, 0xbea9, +0xc9e2, 0xd4e7, 0xde7b, 0xe633, 0x1461, 0x3e75, 0x4911, 0x1b5a, 0x2106, 0x4059, +0xf467, 0xbf92, 0xc1f8, 0xd995, 0xdcf6, 0xe0ba, 0x1eb5, 0x4600, 0x4167, 0x1d25, +0x2ef9, 0x3639, 0xe56b, 0xc105, 0xc027, 0xd70a, 0xe1eb, 0xea01, 0x247e, 0x4c66, +0x3f10, 0x14c8, 0x3245, 0x3094, 0xdd32, 0xc132, 0xc147, 0xd9a1, 0xe18c, 0xeeb8, +0x2824, 0x4a69, 0x395c, 0x1015, 0x3040, 0x238d, 0xd48a, 0xc21b, 0xc53b, 0xdc6d, +0xe1ce, 0xf6ef, 0x2ad6, 0x46b7, 0x34da, 0x1114, 0x34eb, 0x1e8c, 0xd361, 0xbe8c, +0xc1c6, 0xe012, 0xdf71, 0xf81f, 0x3359, 0x4a06, 0x2d71, 0x1454, 0x38da, 0x0f58, +0xccf4, 0xbea1, 0xbbb5, 0xdb25, 0xe2c4, 0xfd77, 0x3627, 0x5121, 0x2c35, 0x15a0, +0x3989, 0x0018, 0xc03f, 0xbaf5, 0xc3cd, 0xe02b, 0xe6c9, 0x0e3d, 0x3eb5, 0x4d58, +0x26cb, 0x1318, 0x2fe0, 0xf891, 0xc27d, 0xb828, 0xc71e, 0xe21d, 0xe699, 0x15c5, +0x4058, 0x45ef, 0x2262, 0x1985, 0x28bc, 0xeca7, 0xc32c, 0xb7e4, 0xcfc1, 0xea07, +0xe4ac, 0x173a, 0x461c, 0x3eba, 0x15fa, 0x2087, 0x2703, 0xe29a, 0xc4b3, 0xb600, +0xc8f7, 0xe687, 0xe9ba, 0x15c4, 0x426b, 0x3e74, 0x0edd, 0x1f75, 0x23b8, 0xd925, +0xc0ab, 0xba1f, 0xcb2d, 0xe095, 0xeca2, 0x1990, 0x40e5, 0x3c5d, 0x1023, 0x24d2, +0x1ebd, 0xd280, 0xbab7, 0xba30, 0xd226, 0xe0d0, 0xf39a, 0x22d6, 0x4063, 0x34fc, +0x0f3b, 0x2825, 0x190f, 0xd310, 0xbcd9, 0xbd2e, 0xd80b, 0xdd5a, 0xf3ce, 0x2b22, +0x4783, 0x32fb, 0x13a4, 0x3361, 0x1484, 0xcf84, 0xc067, 0xc184, 0xdb6a, 0xe3e8, +0x0230, 0x3122, 0x4768, 0x320a, 0x16c1, 0x3427, 0x0aed, 0xc9bb, 0xba81, 0xc328, +0xe12c, 0xe1e3, 0x07e1, 0x3ec1, 0x4f67, 0x2ddc, 0x15f0, 0x2f32, 0xfe24, 0xc964, +0xbbfd, 0xc754, 0xe848, 0xe9ef, 0x1196, 0x41b3, 0x4b5f, 0x2760, 0x1f91, 0x35ce, +0xf3d5, 0xc722, 0xbfad, 0xcade, 0xe85a, 0xeaa5, 0x1660, 0x4809, 0x4c60, 0x1f11, +0x212f, 0x36b0, 0xefd1, 0xc764, 0xbc28, 0xc837, 0xe455, 0xec50, 0x1c88, 0x4b3c, +0x4de3, 0x2041, 0x28c6, 0x32d7, 0xe1ea, 0xbea7, 0xbd29, 0xd1a9, 0xe60c, 0xf02d, +0x2433, 0x4c51, 0x4811, 0x1816, 0x23ce, 0x292b, 0xdf35, 0xbcec, 0xb6b3, 0xd50d, +0xe49a, 0xee6a, 0x2b0c, 0x4b27, 0x39f9, 0x15f5, 0x29d8, 0x1859, 0xd36e, 0xc04c, +0xb5ab, 0xd4b0, 0xe461, 0xec0c, 0x2803, 0x4fb2, 0x371f, 0x0f49, 0x2de8, 0x1063, +0xc7dd, 0xbbcc, 0xb195, 0xcdad, 0xe2b5, 0xf6ed, 0x29d0, 0x4ac5, 0x31e4, 0x0aa9, +0x2acb, 0x0735, 0xbe72, 0xb39c, 0xb620, 0xd1d9, 0xdc5c, 0xfcdd, 0x307a, 0x46be, +0x2c7c, 0x0a2b, 0x22ab, 0xfca8, 0xc0ac, 0xafc4, 0xb815, 0xde74, 0xe13f, 0x0269, +0x370e, 0x4107, 0x21c4, 0x13c8, 0x26a3, 0xf061, 0xc3ac, 0xb5ad, 0xbbea, 0xe2b6, +0xe314, 0x03cd, 0x3a8a, 0x453e, 0x1c0b, 0x167a, 0x2afd, 0xe8ae, 0xc330, 0xbb1d, +0xbd71, 0xdff6, 0xea8c, 0x0cd6, 0x3cc1, 0x4b59, 0x1e08, 0x1762, 0x288a, 0xe327, +0xbcf5, 0xbc04, 0xcc41, 0xe3b8, 0xf214, 0x1f63, 0x40b7, 0x4556, 0x1932, 0x14e9, +0x22d4, 0xe5af, 0xc176, 0xbaf1, 0xd516, 0xeaa3, 0xed1a, 0x10a5, 0x4490, 0x6d0e, +0x387d, 0x06ad, 0xf979, 0xc011, 0x9e3c, 0xad92, 0xe582, 0x1234, 0x4531, 0x6a71, +0x4d3b, 0x3443, 0xfe14, 0xbf35, 0xb76f, 0xcbe7, 0xc8b4, 0xe9aa, 0x501f, 0x43d8, +0x1d18, 0x4560, 0x2e0d, 0xf4de, 0xea75, 0xe7b7, 0xd73f, 0x0fdc, 0x11cd, 0xd145, +0x29c3, 0x44d4, 0xdad6, 0xf4f0, 0x3e51, 0x092e, 0x07b6, 0x43ce, 0xfd5a, 0xf591, +0x1f19, 0xc2ea, 0xb2d7, 0x198e, 0x140f, 0xfa53, 0x5e12, 0x4564, 0xf1ae, 0x2e33, +0x0b49, 0xa4bb, 0xdaed, 0x1485, 0xdc90, 0x0cbf, 0x4f0d, 0x0854, 0x15b5, 0x3b75, +0xe6b5, 0xbe4e, 0x0981, 0xfc23, 0xc6c6, 0x22a2, 0x2984, 0xf1db, 0x27f9, 0x1ab0, +0xc60e, 0xe49e, 0x21a8, 0xd681, 0xe953, 0x41f4, 0xf337, 0xeb9d, 0x3560, 0xf514, +0xbd12, 0x135a, 0x1144, 0xc99f, 0x21e0, 0x2271, 0xd155, 0x1a35, 0x25a3, 0xbec7, +0xdc7d, 0x31ed, 0xe802, 0xe46d, 0x3ef6, 0xfc72, 0xeb7d, 0x2fc5, 0xecf1, 0xb132, +0x0d6d, 0x171d, 0xcaf3, 0x20be, 0x36cd, 0xdeff, 0x1430, 0x2c97, 0xc49c, 0xcab8, +0x247c, 0xe2b5, 0xd3f1, 0x3d93, 0x0c22, 0xee37, 0x3907, 0x01ea, 0xb32c, 0x07e5, +0x153f, 0xb7d0, 0x0a61, 0x333d, 0xdb8a, 0x1138, 0x3892, 0xcfca, 0xccd1, 0x2831, +0xeb12, 0xd73f, 0x357e, 0xfe1d, 0xe21b, 0x300a, 0xfded, 0xaf91, 0xffaf, 0x1ba1, +0xc5b1, 0x0c52, 0x3c73, 0xe33f, 0xfac8, 0x2338, 0xd7bc, 0xc7f4, 0x0f99, 0xe739, +0xd9e0, 0x3980, 0x0e6d, 0xe382, 0x335e, 0x15f9, 0xae82, 0xe698, 0x1c86, 0xca1d, +0xf6f1, 0x34d2, 0xf14d, 0x0fec, 0x3c9a, 0xdef1, 0xc8df, 0x20f3, 0xea68, 0xc50a, +0x33ef, 0x1185, 0xd7d4, 0x2ebc, 0x2178, 0xc1c1, 0xf72b, 0x2354, 0xd2eb, 0x0168, +0x30db, 0xe0a6, 0x05a6, 0x3bad, 0xdc09, 0xc45f, 0x276d, 0xfd11, 0xcf0a, 0x363e, +0x204b, 0xe4d0, 0x2851, 0x199c, 0xbc3c, 0xe9df, 0x1c38, 0xcf05, 0x03b3, 0x4c0e, +0xf6ee, 0x068d, 0x44a0, 0xe3e0, 0xb163, 0x17fa, 0xfdee, 0xc709, 0x37cd, 0x2e63, +0xea1c, 0x3531, 0x2ca0, 0xbf9e, 0xeeec, 0x2b06, 0xc5f7, 0xf1c8, 0x5385, 0xfc84, +0x0002, 0x49cb, 0xf52b, 0xbfbf, 0x204d, 0x04c6, 0xc649, 0x35e9, 0x30b9, 0xe658, +0x31b2, 0x2cb7, 0xb96b, 0xe5a8, 0x2f24, 0xd410, 0xf6ab, 0x5771, 0x04b9, 0xfc36, +0x3ec2, 0xecd7, 0xb28a, 0x1904, 0x0954, 0xc24d, 0x3764, 0x3ade, 0xddf2, 0x29ce, +0x3445, 0xb4d5, 0xd352, 0x2d79, 0xd037, 0xe09a, 0x535a, 0x01a5, 0xf095, 0x48ef, +0xf767, 0xa8aa, 0x11b3, 0x097b, 0xb15c, 0x2a36, 0x3db4, 0xd6cd, 0x24b8, 0x3712, +0xb430, 0xcdb4, 0x2b60, 0xd3aa, 0xe09b, 0x53eb, 0xfc4a, 0xea6b, 0x4b2a, 0xf90e, +0xa8c8, 0x1124, 0x129b, 0xbaac, 0x269d, 0x4030, 0xda96, 0x20e1, 0x3a2e, 0xbd1c, +0xd0d8, 0x3158, 0xdd88, 0xdee5, 0x57dc, 0x0a22, 0xeb70, 0x4be8, 0x027e, 0xa602, +0x0680, 0x1714, 0xbfed, 0x242e, 0x47b1, 0xe011, 0x1d8e, 0x3eca, 0xc029, 0xc616, +0x2e06, 0xe28f, 0xd4aa, 0x4f9e, 0x0f06, 0xe649, 0x438d, 0x0564, 0xa6f1, 0x02f6, +0x1bd3, 0xc020, 0x18b7, 0x4204, 0xd71b, 0x0fc8, 0x3e52, 0xc2b8, 0xbf78, 0x2bd7, +0xe6d3, 0xce7b, 0x47d7, 0x0a5d, 0xd7d4, 0x39c7, 0x074e, 0xa273, 0xfc77, 0x1fef, +0xbcf9, 0x0cec, 0x426a, 0xd4f2, 0x044f, 0x3d93, 0xc6ea, 0xbcdf, 0x2bd1, 0xed0b, +0xce10, 0x43d0, 0x0ca2, 0xd5d2, 0x35c4, 0x0c15, 0xa646, 0xfa2d, 0x2097, 0xc0dd, +0x0c2b, 0x439b, 0xdc9c, 0x059f, 0x3b30, 0xca4a, 0xbbcb, 0x2337, 0xe7a3, 0xc717, +0x3dae, 0x1491, 0xdc09, 0x3229, 0x0f3e, 0xac38, 0xf62a, 0x25d7, 0xcda9, 0xe86a, +0x0ccd, 0xe87d, 0x2a51, 0x46ee, 0xea42, 0xe40d, 0x22b1, 0xd631, 0xa84b, 0xf868, +0xe4f9, 0xdc35, 0x395d, 0x50be, 0x1fd6, 0x25ac, 0x1e57, 0xc641, 0xc358, 0xd0f2, +0xac56, 0xf1aa, 0x385d, 0x08e0, 0x0c0c, 0x6c90, 0x3d9a, 0xd534, 0xf575, 0xf32f, +0xb660, 0xc715, 0x00c3, 0x060a, 0x1cc0, 0x3bee, 0x0fef, 0x2648, 0x390e, 0xe520, +0xcaa4, 0xfc07, 0xfa8c, 0xcfc3, 0xff3b, 0x2146, 0x0eaa, 0x22f7, 0x21eb, 0x22a5, +0x2b3f, 0x140f, 0xd035, 0xce0d, 0x018b, 0xcdfd, 0xe402, 0x4024, 0x35a0, 0x11b4, +0x30f7, 0x48c6, 0xfc36, 0xe429, 0xd9e4, 0xb819, 0xe9ae, 0xecf6, 0xeaac, 0x339b, +0x5af6, 0x18c2, 0x0a7d, 0x49f9, 0xfaf8, 0xba8d, 0xd5ae, 0xd0dc, 0xd43b, 0xee6d, +0x117b, 0x23d1, 0x46ee, 0x29ad, 0x0339, 0x3a96, 0x1314, 0xc110, 0xbad0, 0xd9cf, +0xd706, 0xcd74, 0x0d91, 0x315e, 0x3f9c, 0x359b, 0x2190, 0x2aef, 0x0433, 0xcdb2, +0xa574, 0xc711, 0xe12e, 0xcf40, 0x197f, 0x5324, 0x3d77, 0x20a5, 0x375c, 0x2d03, +0xe262, 0xca54, 0xb0b0, 0xc640, 0xed6e, 0xe3a9, 0x14a7, 0x559a, 0x4789, 0x0af5, +0x2c0d, 0x3078, 0xd574, 0xc8f1, 0xc60c, 0xc4a3, 0xddbb, 0xf434, 0x12bf, 0x3a4f, +0x46b5, 0x0de9, 0x28f8, 0x3a3e, 0xd862, 0xb36e, 0xc4b9, 0xd290, 0xcc9e, 0xf150, +0x28e5, 0x36b7, 0x3727, 0x1942, 0x296a, 0x1f3b, 0xd304, 0xaa50, 0xb7e0, 0xe064, +0xcd60, 0xe774, 0x36d2, 0x4354, 0x256f, 0x16b9, 0x32a9, 0x04e9, 0xc94b, 0xbd89, +0xb4e8, 0xde63, 0xe6b3, 0xefc2, 0x2c99, 0x4d30, 0x244c, 0x0dd9, 0x4013, 0x0a25, +0xbf81, 0xc647, 0xc8d3, 0xd098, 0xddd7, 0x0729, 0x2f46, 0x49fe, 0x3186, 0x11dd, +0x33c9, 0x0a1a, 0xc455, 0xb4fe, 0xcbf9, 0xe01f, 0xd9c3, 0x0d63, 0x3ca9, 0x40e4, +0x2597, 0x1f85, 0x2fee, 0xf6c7, 0xc763, 0xb733, 0xcbd2, 0xe734, 0xe337, 0x11ef, +0x4379, 0x4377, 0x1865, 0x216c, 0x32c8, 0xee0c, 0xca47, 0xc04a, 0xd076, 0xe70b, +0xebed, 0x16a9, 0x3f81, 0x44ae, 0x16f6, 0x2266, 0x31f0, 0xe6d6, 0xc30d, 0xc333, +0xd87e, 0xe495, 0xf14b, 0x1f91, 0x3ab4, 0x3a37, 0x1822, 0x291b, 0x2bcf, 0xea2c, +0xc762, 0xbf57, 0xdd08, 0xe181, 0xec7b, 0x28f2, 0x456d, 0x366d, 0x1d72, 0x3891, +0x2266, 0xe229, 0xcd55, 0xbe26, 0xdad8, 0xe6b2, 0xf1ad, 0x2a59, 0x4ce7, 0x346f, +0x18da, 0x3eb3, 0x1a5c, 0xd0e6, 0xc45c, 0xbfe1, 0xd4d3, 0xe11f, 0x014a, 0x2f81, +0x4863, 0x3408, 0x1268, 0x31f4, 0x0ec8, 0xca3c, 0xb9fc, 0xc1dc, 0xdd52, 0xe093, +0x05ff, 0x33c3, 0x43d7, 0x2da7, 0x1671, 0x2bf0, 0x0034, 0xc97d, 0xb0c3, 0xbe5e, +0xe43b, 0xdb68, 0x0387, 0x3ae6, 0x3ee7, 0x1b43, 0x174b, 0x2d76, 0xf26e, 0xc68d, +0xb289, 0xbb76, 0xe0fe, 0xde57, 0x0305, 0x3b0e, 0x44f7, 0x17e8, 0x1ae0, 0x2e9e, +0xe6b9, 0xc23e, 0xb5b3, 0xbe35, 0xde8a, 0xe55c, 0x0e04, 0x3e2d, 0x4749, 0x1891, +0x1cce, 0x2c46, 0xe31a, 0xbc10, 0xb2be, 0xc7d4, 0xe1b0, 0xec58, 0x1b5f, 0x42a4, +0x4577, 0x18af, 0x206d, 0x2610, 0xe0cf, 0xbee7, 0xb63b, 0xd3ec, 0xe4ab, 0xed6c, +0x253f, 0x4a99, 0x42a8, 0x18da, 0x2a90, 0x2130, 0xd967, 0xc013, 0xb623, 0xd3d0, +0xe7d4, 0xf7c7, 0x2d1b, 0x4df4, 0x3dfe, 0x18d3, 0x2e94, 0x12e1, 0xceb7, 0xbc8b, +0xb721, 0xd9e6, 0xe7b6, 0xfe42, 0x37c7, 0x5256, 0x3916, 0x14fa, 0x2b19, 0x0829, +0xcbbc, 0xbc11, 0xba4e, 0xe0c8, 0xec3c, 0x04ba, 0x39d7, 0x4f48, 0x314f, 0x1b2a, +0x320f, 0xfbd4, 0xc7ad, 0xbe46, 0xbcb0, 0xdfec, 0xea9d, 0x0a76, 0x3eae, 0x51ce, +0x28b8, 0x15c7, 0x32b1, 0xf736, 0xc436, 0xbbe2, 0xc2bd, 0xe357, 0xecf4, 0x10c4, +0x40f6, 0x524e, 0x25cd, 0x19ce, 0x301e, 0xec1e, 0xbc6a, 0xbace, 0xd1d8, 0xe825, +0xec23, 0x1b1b, 0x4400, 0x482a, 0x1bce, 0x1896, 0x260d, 0xe7f6, 0xc325, 0xb5e4, +0xd101, 0xeabf, 0xea0d, 0x1d52, 0x47b3, 0x3cf0, 0x1282, 0x235d, 0x2050, 0xd9ae, +0xc4d9, 0xb970, 0xd086, 0xe87d, 0xea86, 0x1b23, 0x48b1, 0x3c02, 0x0e92, 0x2cb2, +0x2472, 0xd2cb, 0xbff8, 0xbc43, 0xce22, 0xe2d3, 0xf745, 0x2364, 0x47bb, 0x3e11, +0x1209, 0x2f53, 0x1fb0, 0xcfac, 0xba0d, 0xbeea, 0xd8e3, 0xde1c, 0xf854, 0x2f24, +0x49ea, 0x387f, 0x14be, 0x2de7, 0x1304, 0xd01b, 0xb948, 0xbc56, 0xe0d1, 0xe484, +0xff93, 0x3655, 0x488a, 0x2bf5, 0x16ba, 0x3637, 0x07aa, 0xcf32, 0xc24d, 0xc063, +0xe449, 0xe713, 0x01e8, 0x3b25, 0x4f83, 0x26c5, 0x1640, 0x3ab8, 0xff8c, 0xc83c, +0xbf7c, 0xc052, 0xdf32, 0xe807, 0x09ef, 0x390f, 0x4d01, 0x25f5, 0x19b1, 0x3685, +0xf201, 0xbb2e, 0xb561, 0xc59a, 0xdeac, 0xe81d, 0x110d, 0x2f0d, 0x5faf, 0x5bc4, +0x12fe, 0xf615, 0xda50, 0xa9ae, 0x886f, 0xcd18, 0x0718, 0x09f1, 0x5bb7, 0x7af7, +0x3e15, 0x0a73, 0xe799, 0xa715, 0x9c71, 0xc971, 0xb0a1, 0x07a7, 0x6f82, 0x3163, +0x2a82, 0x5398, 0x14c9, 0xbfc2, 0xd8b3, 0xd540, 0xc5ce, 0x0fda, 0xf099, 0xf1a7, +0x518e, 0x1c60, 0xcd84, 0x19da, 0x35b8, 0xd346, 0x03a1, 0x377b, 0xdf14, 0xefc5, +0x0c59, 0xc206, 0xc448, 0x2196, 0x11ee, 0xfe70, 0x4f48, 0x1fa8, 0xeb2d, 0x1d5b, +0xeaf2, 0x9f51, 0xdaef, 0x10e0, 0xe2b8, 0x140e, 0x4a7c, 0x0548, 0x11c6, 0x2b5c, +0xd063, 0xb9e9, 0x0c49, 0xee9f, 0xcd6b, 0x32da, 0x2204, 0xe702, 0x2c36, 0x195d, +0xbc4d, 0xef56, 0x1ea6, 0xd1a8, 0xfb24, 0x33f8, 0xe2fa, 0xffb5, 0x3ccd, 0xe4cb, +0xca25, 0x2563, 0x0355, 0xd2da, 0x2bb0, 0x137a, 0xd6ec, 0x2218, 0x1b95, 0xc3b7, +0xf854, 0x3722, 0xe6e8, 0xf671, 0x3596, 0xec18, 0xf030, 0x2d9c, 0xe6e7, 0xc2e9, +0x26d5, 0x1a49, 0xd733, 0x2bbd, 0x26a1, 0xdab2, 0x1ba0, 0x23f0, 0xc355, 0xe703, +0x2bce, 0xdc49, 0xf190, 0x496d, 0xfc6e, 0xf386, 0x3dfc, 0xf7e9, 0xbcff, 0x1444, +0x0996, 0xc579, 0x1fc6, 0x2a9c, 0xe722, 0x261f, 0x2af6, 0xc74c, 0xe3b8, 0x2a8b, +0xe105, 0xe8c4, 0x3bef, 0xfd9f, 0xefc2, 0x313f, 0xf888, 0xbeed, 0x0f0d, 0x10ba, +0xcf13, 0x2814, 0x3a0d, 0xdf51, 0x0dca, 0x2f8f, 0xccfa, 0xc831, 0x1d1f, 0xe940, +0xe8cf, 0x4a93, 0x0d52, 0xef83, 0x3c76, 0xfaba, 0xa5dd, 0x0126, 0x112f, 0xbdc7, +0x1a61, 0x422a, 0xe9fb, 0x1b1a, 0x3694, 0xc9c9, 0xce2b, 0x1ef2, 0xd732, 0xdc7b, +0x46da, 0xff7f, 0xe9fc, 0x46e1, 0x05ac, 0xaeb6, 0x0663, 0x159d, 0xc012, 0x1316, +0x34ba, 0xdd94, 0x12fd, 0x31f6, 0xc596, 0xcbff, 0x2ae2, 0xe4d5, 0xd6c1, 0x4927, +0x0b3d, 0xdd77, 0x3926, 0x07d1, 0xa2d2, 0xfb2e, 0x211d, 0xc317, 0x1769, 0x4b14, +0xe280, 0x1326, 0x411c, 0xc1e2, 0xbac5, 0x2cf6, 0xe603, 0xcb4b, 0x4ed8, 0x191b, +0xe401, 0x458d, 0x1545, 0xac87, 0x005f, 0x1e4a, 0xba9b, 0x0cc0, 0x467e, 0xe1cf, +0x11da, 0x478e, 0xd350, 0xc70d, 0x31c1, 0xf201, 0xce1e, 0x434c, 0x12d6, 0xdd0b, +0x3986, 0x1337, 0xaf6d, 0x006c, 0x2ca7, 0xc8ff, 0x0c23, 0x4bde, 0xe11d, 0x0318, +0x41ef, 0xd0e5, 0xbd29, 0x3042, 0xf8a0, 0xd014, 0x4ad2, 0x1b53, 0xda3d, 0x3aa3, +0x14be, 0xa4bb, 0xf7a1, 0x2b27, 0xc43a, 0x0948, 0x507e, 0xe296, 0x0297, 0x45db, +0xd510, 0xb990, 0x273a, 0xf430, 0xc750, 0x3f4c, 0x1a85, 0xdb6a, 0x3993, 0x1ab4, +0xadf3, 0xf5f6, 0x280d, 0xc5fc, 0xfe8a, 0x4668, 0xe58d, 0x011c, 0x457a, 0xdfc7, +0xbebe, 0x255e, 0xfae1, 0xcb02, 0x3a3a, 0x1b49, 0xd635, 0x2c90, 0x1a6d, 0xb0f1, +0xf0b7, 0x2851, 0xcb11, 0xfd3b, 0x4815, 0xe902, 0xf73a, 0x3af3, 0xde3a, 0xb633, +0x1a27, 0xfae7, 0xc8e7, 0x3373, 0x1efa, 0xdab3, 0x2af8, 0x1f54, 0xb3a4, 0xe5bd, +0x2010, 0xc657, 0xef33, 0x4332, 0xf32a, 0xf8bc, 0x3a43, 0xe716, 0xb380, 0x1025, +0xf94b, 0xbff8, 0x2cbe, 0x2722, 0xd958, 0x2238, 0x24de, 0xb4e0, 0xd8e0, 0x219f, +0xcbf4, 0xec3e, 0x4cc4, 0xf5db, 0xee65, 0x3cb1, 0xe88f, 0xad6b, 0x15fb, 0x0312, +0xbe65, 0x3207, 0x3441, 0xd731, 0x1ee6, 0x2923, 0xb321, 0xd7af, 0x26e1, 0xce3a, +0xeb73, 0x52d6, 0xfb3a, 0xed11, 0x3fa2, 0xeb93, 0xa537, 0x0fde, 0x078b, 0xbcc7, +0x2dd2, 0x39bf, 0xde73, 0x2216, 0x2ba5, 0xb204, 0xd113, 0x2873, 0xd059, 0xe433, +0x5331, 0x00f5, 0xede6, 0x41c9, 0xf3f8, 0xaa8c, 0x0f24, 0x06be, 0xb5e6, 0x29e9, +0x39f4, 0xda5d, 0x25b6, 0x2b84, 0xb07f, 0xd942, 0x36fe, 0xe8ec, 0xcdd1, 0x1733, +0x0849, 0x1aa1, 0x4558, 0xfb48, 0xd3ef, 0x11bd, 0xef48, 0xb142, 0xf697, 0xfdea, +0xd64a, 0x32a6, 0x6fed, 0x25f8, 0x0b17, 0x2a5c, 0xdff3, 0xaef4, 0xd4ec, 0xbcba, +0xe25d, 0x44cb, 0x234b, 0x1321, 0x73ba, 0x4da9, 0xced4, 0xe817, 0x007f, 0xa908, +0xb5df, 0x1df6, 0x1875, 0x0e2c, 0x3ec1, 0x2fcd, 0x272d, 0x2290, 0xe25c, 0xc07e, +0xf134, 0xfb4d, 0xd6f2, 0x0ad3, 0x3447, 0x223c, 0x13f1, 0x2272, 0x269f, 0x025a, +0x0161, 0xd722, 0xd224, 0x0308, 0xde38, 0xef78, 0x3c18, 0x42ed, 0x0555, 0x290a, +0x5400, 0xe6be, 0xca2d, 0xdae9, 0xc68f, 0xd7d0, 0xf47c, 0x10ed, 0x3184, 0x5941, +0x1cf6, 0x0891, 0x3a35, 0xeb6f, 0xae39, 0xc817, 0xe6f7, 0xd6ef, 0xebb0, 0x3372, +0x35f1, 0x34dd, 0x1e90, 0x16f7, 0x21a1, 0xf074, 0xc287, 0xb8c4, 0xe82d, 0xe6eb, +0xdb90, 0x1e19, 0x40af, 0x3208, 0x1a9a, 0x320f, 0x1b9a, 0xdeff, 0xcf46, 0xb4a3, +0xcbd7, 0xdf68, 0xe59a, 0x22fe, 0x55b5, 0x3892, 0x0be2, 0x396b, 0x1a98, 0xc635, +0xc146, 0xc092, 0xd361, 0xe7eb, 0x0383, 0x2879, 0x4c6a, 0x3c0d, 0x05ca, 0x2976, +0x14a9, 0xc798, 0xc116, 0xd2d8, 0xdd50, 0xdcd3, 0x0b09, 0x2bce, 0x3653, 0x2ab8, +0x0a52, 0x2aa9, 0x14b7, 0xd401, 0xb890, 0xcc60, 0xea88, 0xd5e4, 0xfe7d, 0x383b, +0x3ade, 0x1b88, 0x1ad7, 0x3ed1, 0x075f, 0xcd9c, 0xbbc4, 0xcbe8, 0xeb85, 0xd822, +0xfbc3, 0x3e44, 0x459b, 0x10ea, 0x17ee, 0x43df, 0xf7f9, 0xc0a0, 0xc419, 0xcf1f, +0xdea4, 0xe05f, 0x0678, 0x330f, 0x42d4, 0x111c, 0x0fba, 0x3f57, 0xf9a8, 0xb669, +0xbe1b, 0xe146, 0xdd9a, 0xd4be, 0x11a3, 0x389d, 0x37d6, 0x13b2, 0x1c70, 0x3370, +0xf10c, 0xc063, 0xb6e6, 0xd48a, 0xdc66, 0xd809, 0x1789, 0x3f92, 0x3566, 0x0e0f, +0x231e, 0x2ea3, 0xde28, 0xbb31, 0xba09, 0xcf05, 0xd866, 0xdfc8, 0x18f1, 0x3ecd, +0x369b, 0x0a8f, 0x2386, 0x2af2, 0xda2a, 0xb79e, 0xb7d0, 0xd687, 0xde35, 0xe721, +0x22ba, 0x4574, 0x3572, 0x0dd3, 0x2e06, 0x263b, 0xd7ab, 0xbfc7, 0xc2f6, 0xdf1b, +0xe1c3, 0xf1d5, 0x2cb4, 0x4e1c, 0x37cd, 0x115d, 0x35cd, 0x1fe6, 0xd779, 0xc301, +0xc58e, 0xe72d, 0xe5ce, 0xf960, 0x335a, 0x4fb4, 0x357b, 0x1898, 0x426e, 0x1cc2, +0xd473, 0xc727, 0xc831, 0xe1fb, 0xe68f, 0x072e, 0x3da1, 0x58d4, 0x39ac, 0x1d25, +0x4338, 0x1401, 0xcf2b, 0xbee6, 0xca41, 0xe875, 0xe64f, 0x1316, 0x4982, 0x5236, +0x2f67, 0x2085, 0x38b8, 0xfd01, 0xc7c8, 0xba93, 0xc979, 0xebc7, 0xea26, 0x168d, +0x477d, 0x4817, 0x212b, 0x1fdd, 0x335a, 0xef3e, 0xc484, 0xb895, 0xc9b8, 0xec42, +0xe805, 0x136b, 0x4a61, 0x4971, 0x17b6, 0x1f6a, 0x2f97, 0xe4b1, 0xc086, 0xb999, +0xcac9, 0xe5fd, 0xee0c, 0x1807, 0x412f, 0x460f, 0x166d, 0x1f4c, 0x29b3, 0xdc64, +0xb965, 0xb861, 0xd211, 0xe147, 0xeb99, 0x2193, 0x450f, 0x3ce4, 0x113e, 0x1f63, +0x1c84, 0xd769, 0xb874, 0xb487, 0xd682, 0xe1c9, 0xed74, 0x24b0, 0x43a4, 0x33ba, +0x0e1c, 0x2413, 0x10f7, 0xcdd3, 0xb977, 0xb8d7, 0xdbc4, 0xe37c, 0xf175, 0x272e, +0x457d, 0x2d0a, 0x07d0, 0x297e, 0x0f41, 0xca51, 0xb9f7, 0xbc9a, 0xdaa7, 0xddfe, +0xf766, 0x2c64, 0x4532, 0x2d7b, 0x0dd9, 0x2cf4, 0x0c17, 0xc90f, 0xb4bc, 0xc07f, +0xe270, 0xdce1, 0xfc63, 0x371a, 0x4749, 0x2579, 0x1187, 0x2dc1, 0xff1f, 0xc7eb, +0xb7f0, 0xc150, 0xe209, 0xe0bb, 0x0562, 0x39a6, 0x419b, 0x18df, 0x11d0, 0x32b0, +0xf640, 0xc162, 0xbaa8, 0xc92a, 0xe355, 0xdf42, 0x07ce, 0x3de6, 0x485f, 0x1a8d, +0x15e0, 0x345d, 0xf2a7, 0xc2b4, 0xbc48, 0xcb43, 0xe331, 0xe771, 0x171d, 0x41c7, +0x46e8, 0x1e6a, 0x1d99, 0x3169, 0xea47, 0xbb34, 0xb612, 0xcfe5, 0xe372, 0xe4f4, +0x1dce, 0x4978, 0x4538, 0x1abb, 0x1ff9, 0x2726, 0xe2ee, 0xbf5a, 0xb642, 0xd6a7, +0xeb65, 0xe981, 0x26c2, 0x5246, 0x3d0f, 0x142e, 0x2f6c, 0x28fc, 0xda88, 0xc3aa, +0xbdbe, 0xd749, 0xeb54, 0xf1e0, 0x25cd, 0x526c, 0x41ba, 0x10bf, 0x2fe6, 0x2449, +0xd374, 0xbfc4, 0xbbe2, 0xd283, 0xe25c, 0xf99f, 0x2cef, 0x4ac7, 0x3ddf, 0x17d9, +0x3082, 0x1925, 0xce89, 0xb6a1, 0xbc50, 0xe283, 0xe474, 0xfd8d, 0x3bcc, 0x4e96, +0x33c3, 0x167a, 0x2e47, 0x0a43, 0xcef1, 0xbc29, 0xba3d, 0xe1a3, 0xe5f7, 0xfe7c, +0x39db, 0x4bea, 0x270e, 0x128b, 0x30de, 0xfb59, 0xc505, 0xbdab, 0xbd60, 0xe0c5, +0xe64a, 0x0171, 0x35c3, 0x47fc, 0x21b5, 0x11b5, 0x30fa, 0xf4fc, 0xc06e, 0xbaa3, +0xbc7a, 0xd83f, 0xe4e1, 0x0b66, 0x373d, 0x497a, 0x2421, 0x109c, 0x26f1, 0xecb6, +0xbadf, 0xb11f, 0xc45d, 0xdf59, 0xe4b2, 0x1641, 0x3f59, 0x42bc, 0x1c1c, 0x129c, +0x1bee, 0xe133, 0xbe64, 0xb1ad, 0xcc9f, 0xec32, 0xe986, 0x19ae, 0x44e5, 0x3a19, +0x0e88, 0x1ade, 0x1f2c, 0xdec4, 0xc3cc, 0xb2ef, 0xdaab, 0xfd08, 0xe6a7, 0x1123, +0x3704, 0x3898, 0x3ad4, 0x346f, 0xfe92, 0xd1d3, 0xcc04, 0x9cbd, 0xc135, 0x02eb, +0xf63b, 0x365b, 0x8b58, 0x58ad, 0x0415, 0x0488, 0xcf1c, 0x8e64, 0xb611, 0xc2c4, +0xeda1, 0x4ea8, 0x63da, 0x49bb, 0x50ec, 0x3618, 0xc859, 0xb818, 0xe010, 0xbc83, +0xd14a, 0x1ad8, 0x32a9, 0x4030, 0x4434, 0x0f51, 0xf80f, 0x1895, 0xeaf8, 0xc48d, +0x175a, 0x2702, 0xe895, 0x0fd2, 0x2756, 0xcf30, 0xdfad, 0x3a11, 0xfb80, 0xfa5f, +0x565f, 0x121d, 0xf290, 0x2352, 0xddf3, 0xa5f4, 0xfe06, 0x187b, 0xde96, 0x3a13, +0x5105, 0xf698, 0x255a, 0x212e, 0xb7a3, 0xc5a7, 0x10d7, 0xdeff, 0xe90b, 0x551a, +0x1708, 0xfd81, 0x42e8, 0xf9ae, 0xb328, 0xf8c8, 0x0cd4, 0xc910, 0x1398, 0x3cf8, +0xe89b, 0x1c9d, 0x36c1, 0xcb0b, 0xcca6, 0x2759, 0xf1e2, 0xd264, 0x3d80, 0x146d, +0xe372, 0x36c2, 0x0ab3, 0xb2ef, 0x0a0e, 0x2e96, 0xc7be, 0x0dcf, 0x4ba5, 0xdcd8, +0xff1f, 0x391f, 0xcf51, 0xc4c3, 0x314b, 0xfef3, 0xd680, 0x41c6, 0x156e, 0xdd3b, +0x2eeb, 0x0886, 0xa9c9, 0xf3a6, 0x247e, 0xc927, 0x069f, 0x4a37, 0xe895, 0x0061, +0x378e, 0xd6a1, 0xb348, 0x1688, 0xf810, 0xc498, 0x323f, 0x1fc5, 0xe066, 0x29b3, +0x139d, 0xadbb, 0xe71a, 0x2c44, 0xcae3, 0xe8e1, 0x3f89, 0xe822, 0xf034, 0x367a, +0xdf30, 0xb32c, 0x1aba, 0x0281, 0xcc1b, 0x36c4, 0x14ca, 0xc6d5, 0x2590, 0x1c08, +0xa351, 0xd7ce, 0x2a74, 0xd59f, 0xf3fa, 0x477e, 0xf4e0, 0xf8ff, 0x3121, 0xdc01, +0xb775, 0x150c, 0xfcd8, 0xcc0d, 0x38c8, 0x2ece, 0xe423, 0x2849, 0x29b5, 0xc302, +0xda74, 0x1f47, 0xdd2f, 0xf247, 0x3ab2, 0xf2d7, 0x006a, 0x4787, 0xf2b8, 0xbc9f, +0x1f1c, 0x0ac7, 0xbde9, 0x23df, 0x2b4d, 0xd869, 0x1cf2, 0x2e59, 0xc8ac, 0xe6ca, +0x2cef, 0xd907, 0xf197, 0x4b23, 0xf20c, 0xef15, 0x4469, 0xf156, 0xb2a9, 0x1bfd, +0x127b, 0xca28, 0x306d, 0x3438, 0xdf08, 0x20cf, 0x27a1, 0xb9c7, 0xd8d7, 0x2741, +0xd309, 0xe588, 0x5056, 0x03d5, 0xef96, 0x4207, 0xfd8d, 0xae5f, 0x03b5, 0x0589, +0xbd38, 0x23af, 0x3a76, 0xe095, 0x2023, 0x3839, 0xc165, 0xd4ca, 0x2de1, 0xd781, +0xe09b, 0x50bd, 0x0340, 0xea0c, 0x4022, 0xf840, 0xad2c, 0x1331, 0x12e3, 0xc260, +0x2f2a, 0x3b6c, 0xd12c, 0x18a4, 0x3197, 0xb77c, 0xd13d, 0x2bd2, 0xd972, 0xe616, +0x52eb, 0x041e, 0xeb26, 0x3bdc, 0xf119, 0xa2b2, 0x06d5, 0x1049, 0xbd97, 0x289f, +0x44ee, 0xdf14, 0x1d7f, 0x34ac, 0xb7bb, 0xc690, 0x278a, 0xda25, 0xdff9, 0x579a, +0x080c, 0xe6ec, 0x4374, 0xfcbd, 0xa5be, 0x078c, 0x146b, 0xbb5b, 0x2164, 0x4262, +0xdc47, 0x1e50, 0x39f8, 0xbce7, 0xcbb4, 0x2afe, 0xdc45, 0xdb5e, 0x5409, 0x0b3a, +0xe53c, 0x4358, 0x02ae, 0xa896, 0x0857, 0x1af8, 0xc23a, 0x2352, 0x496b, 0xdfb5, +0x197e, 0x3ce3, 0xbe54, 0xc506, 0x3012, 0xe677, 0xd704, 0x5217, 0x11ee, 0xe2e7, +0x3fe4, 0x06fa, 0xa5a3, 0xfdcd, 0x181f, 0xbb44, 0x1747, 0x4a1f, 0xdca9, 0x10d6, +0x4291, 0xc4a6, 0xbd25, 0x2a87, 0xe605, 0xcbf6, 0x4b38, 0x15fb, 0xe0ad, 0x3f35, +0x0d36, 0xa652, 0x0068, 0x234a, 0xbde1, 0x11e2, 0x4aeb, 0xdbe0, 0x0a9d, 0x4344, +0xcb41, 0xbfb5, 0x3005, 0xef5d, 0xcc1b, 0x497b, 0x1516, 0xd825, 0x3b8a, 0x1677, +0xabc7, 0xfeb9, 0x2dcb, 0xc484, 0x08d9, 0x4f69, 0xe275, 0x041d, 0x4846, 0xd81a, +0xc055, 0x3307, 0xfcca, 0xce29, 0x4a68, 0x20cb, 0xd8f3, 0x379a, 0x1b24, 0xaf02, +0xfaf5, 0x36a2, 0xdc0c, 0xf2c4, 0x1be5, 0xefab, 0x3121, 0x54a4, 0xf198, 0xe7b1, +0x2ba4, 0xe144, 0xad6e, 0x0105, 0xf0a8, 0xe331, 0x4379, 0x5911, 0x2529, 0x2cc9, +0x279d, 0xcce3, 0xc4aa, 0xd6d0, 0xaebe, 0xee7a, 0x3b83, 0x0e08, 0x0c23, 0x6c6b, +0x4249, 0xd2d0, 0xee99, 0xf0dc, 0xb1d9, 0xc315, 0x0097, 0x05b2, 0x198e, 0x3a21, +0x0a87, 0x19af, 0x3001, 0xda73, 0xbf3b, 0xf320, 0xf1e8, 0xce48, 0xfde9, 0x1c97, +0x092a, 0x1c03, 0x1996, 0x174f, 0x1e06, 0x0784, 0xc7d4, 0xc266, 0xf6c0, 0xcc3e, +0xdd41, 0x35c9, 0x3070, 0x0e9b, 0x2df6, 0x46cc, 0xf777, 0xdb3b, 0xd86d, 0xb2ad, +0xdad5, 0xea97, 0xeb13, 0x2dfd, 0x5bf5, 0x1d45, 0x0c80, 0x4c6b, 0xf9d2, 0xb332, +0xd3b1, 0xcca7, 0xc90a, 0xeeb9, 0x1637, 0x2142, 0x4501, 0x2b65, 0x034c, 0x35ee, +0x0df0, 0xbcaf, 0xb962, 0xda48, 0xd509, 0xd169, 0x125a, 0x2f7e, 0x3ce9, 0x31e9, +0x1f9f, 0x25c3, 0xf9ce, 0xc7fa, 0xa4bc, 0xc4e4, 0xde14, 0xd114, 0x1820, 0x4ec1, +0x3955, 0x1716, 0x2ffb, 0x23e1, 0xd401, 0xc118, 0xaea8, 0xc267, 0xe761, 0xe650, +0x166b, 0x5317, 0x4508, 0x02ef, 0x256f, 0x2a58, 0xc9bf, 0xbfb1, 0xc690, 0xc4c0, +0xdb5a, 0xfc3e, 0x1d56, 0x406f, 0x4672, 0x07f9, 0x258b, 0x3563, 0xd0af, 0xad4b, +0xc62c, 0xd7ec, 0xd118, 0xfacb, 0x32c8, 0x3cf8, 0x3893, 0x1827, 0x2a88, 0x2056, +0xd2e0, 0xa9a8, 0xbc95, 0xe82d, 0xd209, 0xed42, 0x4049, 0x4bca, 0x27a4, 0x17b5, +0x33c7, 0x048c, 0xc896, 0xbbc4, 0xb5e8, 0xde55, 0xe670, 0xf26e, 0x319d, 0x5284, +0x20bb, 0x0a37, 0x3f54, 0x0425, 0xb7b6, 0xbeac, 0xc4a7, 0xd10a, 0xdf90, 0x067a, +0x32d8, 0x4def, 0x29e9, 0x0de0, 0x33b8, 0x00f9, 0xbb53, 0xb44c, 0xca99, 0xdcb3, +0xdf0d, 0x140a, 0x4211, 0x47c0, 0x2741, 0x1ffe, 0x3026, 0xf2ee, 0xc44d, 0xb8c2, +0xcbde, 0xe86b, 0xed77, 0x1b4d, 0x47ee, 0x4766, 0x1ae9, 0x2386, 0x33e9, 0xea57, +0xc4ae, 0xc182, 0xd3ec, 0xeae1, 0xf2fa, 0x1c99, 0x46ce, 0x4849, 0x16e5, 0x2357, +0x2d0d, 0xe171, 0xc2b4, 0xc619, 0xdb43, 0xe861, 0xf96a, 0x2580, 0x41a1, 0x3fcc, +0x14f6, 0x245e, 0x2692, 0xe3d9, 0xc4b2, 0xc084, 0xdcfb, 0xe481, 0xf277, 0x26e8, +0x4453, 0x3677, 0x1401, 0x2eb5, 0x1c61, 0xda3a, 0xc536, 0xbbc2, 0xd95f, 0xe409, +0xf088, 0x24e3, 0x4a50, 0x36ef, 0x1343, 0x3794, 0x1bd7, 0xd0b1, 0xbf04, 0xc0c0, +0xd999, 0xe102, 0xfe57, 0x307b, 0x4c60, 0x3446, 0x110b, 0x34af, 0x1719, 0xd246, +0xbe92, 0xc661, 0xdf01, 0xde95, 0x04b9, 0x34ae, 0x44b2, 0x2c3e, 0x140f, 0x311d, +0x09e5, 0xcd57, 0xb673, 0xc4ea, 0xe8e6, 0xdfae, 0x02f2, 0x3c51, 0x460d, 0x2037, +0x160e, 0x33a4, 0xffd5, 0xd044, 0xbb77, 0xbff6, 0xe547, 0xe2d3, 0x02a5, 0x3927, +0x483e, 0x1e84, 0x18a8, 0x35a4, 0xf428, 0xc4b4, 0xb810, 0xbe31, 0xdf3f, 0xe3b9, +0x070a, 0x3a6e, 0x4a01, 0x1d3d, 0x19b7, 0x312f, 0xe9ed, 0xb9d2, 0xb185, 0xc27d, +0xdf74, 0xeaac, 0x163c, 0x40b2, 0x480f, 0x196b, 0x1a68, 0x2946, 0xe387, 0xbd44, +0xb687, 0xcdd3, 0xe1c0, 0xe73f, 0x19c6, 0x454e, 0x4471, 0x1517, 0x1f37, 0x2415, +0xde12, 0xbc28, 0xb193, 0xce92, 0xe199, 0xeb2a, 0x208d, 0x45c9, 0x3dfd, 0x140f, +0x2554, 0x1b8d, 0xd3e4, 0xb631, 0xaeee, 0xd2a0, 0xe032, 0xeefc, 0x2bad, 0x4d46, +0x3a27, 0x0f3b, 0x24c9, 0x111e, 0xcdbf, 0xb6b5, 0xb194, 0xd7c9, 0xe60a, 0xf93b, +0x2f30, 0x4968, 0x3246, 0x1306, 0x2d46, 0x06e7, 0xc785, 0xba49, 0xb9ab, 0xde3a, +0xe629, 0xff26, 0x3a02, 0x5456, 0x30f0, 0x10ea, 0x3149, 0x0578, 0xc92c, 0xbe07, +0xc00c, 0xe26f, 0xec57, 0x0aaf, 0x3ec0, 0x560f, 0x2fbd, 0x16da, 0x3543, 0xfe12, +0xc441, 0xbe1e, 0xce80, 0xec2a, 0xeeda, 0x1761, 0x467e, 0x531c, 0x2945, 0x16f3, +0x30b3, 0xfa85, 0xc82a, 0xb95b, 0xd0b9, 0xf0bf, 0xecf0, 0x1a23, 0x4acc, 0x48e2, +0x1c65, 0x1e4d, 0x2902, 0xe8e0, 0xc9c2, 0xbc2f, 0xd2c0, 0xf22e, 0xed1c, 0x1844, +0x4b01, 0x4776, 0x146e, 0x2125, 0x2832, 0xde1c, 0xc52b, 0xbd52, 0xcf76, 0xec76, +0xf496, 0x1c9f, 0x4726, 0x432c, 0x116f, 0x25e7, 0x2766, 0xd731, 0xbc99, 0xc162, +0xd7c6, 0xe12d, 0xf3c2, 0x27ac, 0x489f, 0x3fb7, 0x11f9, 0x23e3, 0x1dd1, 0xd9f9, +0xbc81, 0xbc41, 0xe051, 0xe6f9, 0xf6af, 0x2df2, 0x4613, 0x2fe6, 0x12b9, 0x303c, +0x120f, 0xd130, 0xc1da, 0xbc62, 0xdb80, 0xe279, 0xf4be, 0x2c52, 0x4660, 0x275e, +0x0d1c, 0x3149, 0x075f, 0xc931, 0xbf24, 0xbaf3, 0xd888, 0xe2cc, 0xfb8b, 0x2cb6, +0x4a52, 0x29ea, 0x0caa, 0x3097, 0xff78, 0xbdf9, 0xb45b, 0xc1cb, 0xdd4e, 0xe310, +0x068a, 0x24f2, 0x54ac, 0x60d2, 0x1650, 0xf4c6, 0xe059, 0xb014, 0x83b1, 0xbc91, +0x02f9, 0x0157, 0x4fca, 0x7cb3, 0x41bb, 0x0df7, 0xea9f, 0xace6, 0x957f, 0xc6c1, +0xb25c, 0xf25c, 0x6d4a, 0x3c23, 0x2274, 0x5314, 0x2754, 0xc59a, 0xd13d, 0xdf25, +0xc110, 0x097d, 0xfee9, 0xe7e9, 0x4a58, 0x3073, 0xd0cf, 0x0834, 0x3f47, 0xde37, +0xefad, 0x3de0, 0xef24, 0xe80f, 0x1519, 0xd4ff, 0xbae7, 0x160b, 0x1ed5, 0xf6f3, +0x4a32, 0x391f, 0xed02, 0x1a95, 0x0194, 0xa798, 0xcdb4, 0x1870, 0xed7d, 0x0805, +0x5609, 0x1649, 0x0c10, 0x37fb, 0xe698, 0xb602, 0x0ab1, 0x02bc, 0xc982, 0x29a0, +0x3592, 0xeb4c, 0x26a0, 0x2b39, 0xc51e, 0xe028, 0x25df, 0xdd3d, 0xeb89, 0x3c7d, +0xf25b, 0xf2a8, 0x40cd, 0xf67a, 0xbd91, 0x18e1, 0x1367, 0xcbf7, 0x1e2b, 0x2469, +0xd608, 0x16f8, 0x2a0b, 0xc927, 0xe2cc, 0x37b1, 0xf346, 0xe694, 0x382d, 0xf93e, +0xe10a, 0x2a89, 0xf6d1, 0xba9a, 0x1681, 0x2591, 0xd24e, 0x187c, 0x2fad, 0xd8f6, +0x0b46, 0x2ae5, 0xc8c2, 0xd38a, 0x2a7a, 0xe7b1, 0xdcb3, 0x3e95, 0x03d8, 0xe5e1, +0x3718, 0x0451, 0xb6fc, 0x05d7, 0x1636, 0xc589, 0x0c0d, 0x2d31, 0xe2a5, 0x145e, +0x2ff3, 0xd16c, 0xd748, 0x2961, 0xeee4, 0xd89a, 0x2f77, 0x0413, 0xe432, 0x2a18, +0x07e4, 0xbf90, 0xffac, 0x1a5c, 0xce43, 0x0eae, 0x3e2a, 0xe525, 0xfcdf, 0x3412, +0xe19f, 0xc0d0, 0x160c, 0xf679, 0xdaf7, 0x3d0f, 0x184f, 0xe643, 0x3314, 0x0d97, +0xa9d1, 0xf210, 0x1e09, 0xc374, 0x0591, 0x4995, 0xef24, 0x05bf, 0x3aa6, 0xdaf6, +0xc1a1, 0x198b, 0xe5e1, 0xce1f, 0x40dc, 0x134c, 0xddc5, 0x3b68, 0x1d73, 0xb2c0, +0xf385, 0x2228, 0xc6a9, 0xff0d, 0x4056, 0xea16, 0x071a, 0x3ca3, 0xd74b, 0xbcb1, +0x210f, 0xf2c1, 0xcb2c, 0x414d, 0x1f07, 0xd958, 0x2f24, 0x195a, 0xa747, 0xe84d, +0x2605, 0xc501, 0xff0e, 0x4e0a, 0xea48, 0x02a4, 0x46c5, 0xd723, 0xafda, 0x23af, +0xf6a4, 0xbc7c, 0x3c45, 0x26f8, 0xdc74, 0x367d, 0x2543, 0xb0bd, 0xed3e, 0x27e5, +0xc333, 0xf8e2, 0x4d51, 0xeb5f, 0xfefc, 0x4865, 0xe34b, 0xb937, 0x2748, 0x0266, +0xc562, 0x3a6b, 0x25b1, 0xd774, 0x2daa, 0x2313, 0xb311, 0xef4a, 0x32e8, 0xcf60, +0xf8b2, 0x51fb, 0xee07, 0xf368, 0x44ab, 0xe548, 0xb2da, 0x24f2, 0x07b3, 0xc446, +0x3bc4, 0x2db3, 0xd779, 0x2ee4, 0x281e, 0xace1, 0xe4c5, 0x335a, 0xceab, 0xf17b, +0x55c7, 0xf4d4, 0xf24d, 0x4603, 0xeb3d, 0xaf65, 0x1bbf, 0x08f3, 0xbf31, 0x300f, +0x30d1, 0xd9cf, 0x29ba, 0x2ead, 0xb5b6, 0xdd53, 0x2dff, 0xcf0d, 0xe2d2, 0x4b14, +0xf7cf, 0xf104, 0x48fe, 0xf5f9, 0xb102, 0x175c, 0x0bd9, 0xbcb2, 0x27b4, 0x336a, +0xd7be, 0x2088, 0x3408, 0xbf37, 0xdc20, 0x3264, 0xdb9f, 0xe60e, 0x5013, 0xffb1, +0xe856, 0x4281, 0xff01, 0xb10f, 0x1094, 0x176a, 0xc863, 0x243b, 0x390b, 0xdf6d, +0x1d95, 0x3900, 0xc65f, 0xd25c, 0x2c3a, 0xe187, 0xdbeb, 0x465f, 0x0986, 0xeb79, +0x4044, 0x0711, 0xb0da, 0x0496, 0x1513, 0xc287, 0x187b, 0x3c78, 0xe032, 0x1521, +0x3c5f, 0xccc3, 0xcce1, 0x2b96, 0xe4ca, 0xd2ba, 0x430a, 0x0aa2, 0xdffc, 0x3ad9, +0x0be5, 0xaea0, 0x03b6, 0x1ba6, 0xbbed, 0x0db5, 0x4113, 0xdc05, 0x05bb, 0x3a65, +0xcc55, 0xc14b, 0x25ec, 0xe783, 0xd1d2, 0x4965, 0x1616, 0xdbb4, 0x3263, 0x0a8b, +0xa569, 0xf7cf, 0x1f57, 0xc4d2, 0x1559, 0x517f, 0xea47, 0x0848, 0x3a1f, 0xc9f1, +0xbb1e, 0x266f, 0xea60, 0xcd1c, 0x4d59, 0x23a6, 0xe328, 0x3b46, 0x19d2, 0xabe2, +0xf47d, 0x1e1a, 0xbcd3, 0x09ed, 0x4fb3, 0xe964, 0x0dbc, 0x485b, 0xd3bb, 0xbbbe, +0x2722, 0xffc5, 0xce39, 0x0d09, 0xfe2c, 0x112d, 0x596c, 0x16f5, 0xd170, 0x12a7, +0x07ab, 0xa521, 0xd945, 0x0290, 0xcf7b, 0x0c60, 0x5af6, 0x3c64, 0x1c78, 0x2c17, +0xf082, 0xb62e, 0xcf0c, 0xac7d, 0xba75, 0x27ac, 0x23af, 0xf129, 0x473d, 0x6f3b, +0xefd4, 0xd0fc, 0xfcb5, 0xc5fa, 0xa532, 0xe2aa, 0x08ff, 0x0704, 0x304a, 0x21e6, +0x0f85, 0x38c1, 0x010f, 0xbcdf, 0xd894, 0xf8ab, 0xd8c7, 0xe36a, 0x1b7a, 0x178e, +0x1a72, 0x1741, 0x157f, 0x1dd4, 0x0dfe, 0xe47e, 0xbdd3, 0xf139, 0xe9ae, 0xc861, +0x198e, 0x432e, 0x1c93, 0x1246, 0x4ca3, 0x23d4, 0xd5a3, 0xdda1, 0xc097, 0xcd1a, +0xeddd, 0xed1a, 0x1738, 0x5658, 0x41b1, 0xfba0, 0x3319, 0x2a1d, 0xc048, 0xc0cf, +0xd583, 0xd4c9, 0xdb7a, 0x070a, 0x2588, 0x3798, 0x3aa9, 0x0add, 0x25af, 0x2337, +0xd4c2, 0xb504, 0xca8a, 0xe4dd, 0xd039, 0xf1df, 0x2bb9, 0x3c1d, 0x3426, 0x22ac, +0x331f, 0x0f10, 0xdc7d, 0xbbe1, 0xb47c, 0xdb63, 0xd984, 0xfcbd, 0x450f, 0x5431, +0x271a, 0x210b, 0x3c62, 0xf43d, 0xc565, 0xc201, 0xc114, 0xe4f6, 0xee9b, 0x085b, +0x3cf5, 0x5653, 0x1e82, 0x0d52, 0x38a8, 0xf608, 0xc456, 0xce8b, 0xcfd1, 0xda08, +0xf0f6, 0x16f4, 0x3014, 0x4610, 0x1a46, 0x0c35, 0x36d1, 0xfb60, 0xbc9c, 0xbcea, +0xdb0c, 0xda74, 0xdb6c, 0x17ce, 0x3715, 0x33b3, 0x13c8, 0x1e7d, 0x290c, 0xe55b, +0xb756, 0xb135, 0xdad6, 0xde70, 0xd336, 0x1782, 0x43a0, 0x29e5, 0x03f8, 0x2c8f, +0x2768, 0xd396, 0xc0e1, 0xbc23, 0xccce, 0xdf32, 0xe829, 0x16bf, 0x4610, 0x3567, +0x012e, 0x312c, 0x3059, 0xcf4c, 0xbc48, 0xcf7d, 0xdb0c, 0xd4f7, 0xefe3, 0x2327, +0x3f5e, 0x34bf, 0x11d9, 0x3885, 0x2a09, 0xd700, 0xbd59, 0xc753, 0xde26, 0xd765, +0xf612, 0x31cc, 0x45d3, 0x2d56, 0x17c3, 0x3e94, 0x16b7, 0xce82, 0xc389, 0xc8ab, +0xdd9d, 0xdd82, 0xfe36, 0x3550, 0x4d5b, 0x2a45, 0x1384, 0x3ff2, 0x0ef3, 0xc81d, +0xbe61, 0xcce9, 0xe4aa, 0xe0ab, 0x0699, 0x385e, 0x486b, 0x2294, 0x15f0, 0x3d85, +0x01db, 0xc686, 0xc116, 0xcff5, 0xe34d, 0xe14b, 0x10c9, 0x3f07, 0x466b, 0x1f0d, +0x1d05, 0x3ab5, 0xf8ef, 0xc8ce, 0xc05e, 0xd357, 0xe7d4, 0xe29f, 0x13df, 0x471a, +0x4a47, 0x1c4c, 0x297f, 0x3e3f, 0xed74, 0xc6f8, 0xbfdc, 0xccde, 0xe3d5, 0xeaa0, +0x19ee, 0x4b1b, 0x4d49, 0x1865, 0x2976, 0x37a0, 0xe1a2, 0xb9e8, 0xba35, 0xd299, +0xde2b, 0xecfc, 0x27c6, 0x4ae2, 0x4564, 0x19a4, 0x28b5, 0x2426, 0xd885, 0xbc0a, +0xb90e, 0xd777, 0xe284, 0xf34a, 0x2d9a, 0x4813, 0x38b9, 0x14ee, 0x2c67, 0x1894, +0xd324, 0xbc7e, 0xb3bc, 0xda55, 0xe3e2, 0xef0a, 0x2fd7, 0x4da0, 0x2e6a, 0x0ee2, +0x326e, 0x0fc1, 0xcb23, 0xbee7, 0xb82c, 0xdaac, 0xe70d, 0xf676, 0x2c96, 0x4efe, +0x3180, 0x0f59, 0x3430, 0x0900, 0xc464, 0xbdf3, 0xbfd4, 0xdc18, 0xe54f, 0x02ac, +0x346a, 0x4ca2, 0x2bdb, 0x0ba0, 0x2ca5, 0x00e4, 0xc0c2, 0xb4ae, 0xbea2, 0xdd3b, +0xe1b5, 0x05e5, 0x36cd, 0x455d, 0x228c, 0x0f39, 0x2721, 0xf06a, 0xbe3c, 0xb625, +0xc315, 0xe0db, 0xe130, 0x0824, 0x3af9, 0x4450, 0x1a04, 0x1254, 0x2a20, 0xeab7, +0xbec0, 0xb857, 0xc3f1, 0xdf5a, 0xe831, 0x122e, 0x3daa, 0x44fa, 0x18f6, 0x1739, +0x28bb, 0xe41d, 0xbbf3, 0xb89c, 0xcff6, 0xe5c1, 0xea00, 0x1c60, 0x45d5, 0x43ef, +0x1c06, 0x2434, 0x292a, 0xe39e, 0xc2cb, 0xbd71, 0xd5c4, 0xe95c, 0xf5d3, 0x2a36, +0x4b75, 0x403d, 0x1c75, 0x32bf, 0x27ef, 0xdda2, 0xcb76, 0xc7c5, 0xdb1a, 0xe84b, +0xf612, 0x2b74, 0x5112, 0x4137, 0x18a7, 0x3889, 0x2791, 0xd8ed, 0xc90a, 0xc6c8, +0xd83c, 0xe5cf, 0x01d1, 0x32e1, 0x4e08, 0x3e77, 0x1bcc, 0x39cc, 0x1bcb, 0xcf7c, +0xbfad, 0xc693, 0xe1af, 0xe44a, 0x0379, 0x3b80, 0x5122, 0x34da, 0x12cd, 0x2ff7, +0x0b3f, 0xcb7c, 0xb95e, 0xc0f4, 0xe555, 0xe1ce, 0x01a1, 0x3cc9, 0x475e, 0x2196, +0x156a, 0x33d5, 0xf97d, 0xc4c1, 0xb9ed, 0xbd90, 0xe1db, 0xe24b, 0x021d, 0x3cfa, +0x4dca, 0x1ea3, 0x12f7, 0x33e9, 0xf159, 0xbf15, 0xb984, 0xbdf4, 0xd9dc, 0xe483, +0x0d28, 0x3bb5, 0x4aee, 0x1fcf, 0x1792, 0x2e75, 0xe773, 0xb55d, 0xaeed, 0xc525, +0xdc07, 0xe07a, 0x162d, 0x403a, 0x41df, 0x18e6, 0x1816, 0x22ca, 0xe0d7, 0xba3f, +0xab7d, 0xc6d9, 0xe296, 0xe464, 0x1a6b, 0x45ec, 0x3cb4, 0x1203, 0x21d7, 0x1e19, +0xd553, 0xc042, 0xb44a, 0xca17, 0xe29f, 0xe893, 0x1a35, 0x457e, 0x3ca4, 0x0eee, +0x274f, 0x1dc0, 0xd010, 0xbe2a, 0xb43a, 0xca4c, 0xe2e4, 0xf448, 0x246d, 0x4965, +0x3fdb, 0x10f7, 0x25b8, 0x162e, 0xcca7, 0xb882, 0xb947, 0xd7a5, 0xe438, 0xfea1, +0x33b7, 0x4cfe, 0x3b14, 0x1175, 0x24b7, 0x0bf7, 0xcecd, 0xbc06, 0xbdfc, 0xe81e, +0xee24, 0x01b0, 0x3af8, 0x476e, 0x28b0, 0x20d9, 0x3412, 0xf8f1, 0xc8c9, 0xbcf1, +0xbe75, 0xed66, 0xf061, 0x0477, 0x2e04, 0x4a13, 0x58d9, 0x3473, 0x0a86, 0xde23, +0xc927, 0xa391, 0xa85a, 0xfd01, 0x01c0, 0x26a1, 0x8016, 0x6b60, 0x1f2e, 0x05f0, +0xdab1, 0x948b, 0xb8c2, 0xc47d, 0xcb07, 0x3e6c, 0x61b3, 0x38d1, 0x421e, 0x423b, +0xe147, 0xbac6, 0xe0e9, 0xbe22, 0xd9dd, 0x0b3a, 0x03de, 0x31f4, 0x40dc, 0xf8e0, +0xf398, 0x2cdd, 0xec3a, 0xc582, 0x25ea, 0x1c58, 0xd8cd, 0x0700, 0x13d5, 0xbffb, +0xdfbf, 0x2eeb, 0xf5a6, 0x0a90, 0x5506, 0x0dfc, 0xf5d4, 0x194f, 0xd0b1, 0xa469, +0xf944, 0x0659, 0xe225, 0x3e8d, 0x4455, 0xf804, 0x285d, 0x16e8, 0xac54, 0xcbe6, +0x0dc1, 0xcfa2, 0xef3a, 0x51ba, 0x0cea, 0x02d9, 0x4169, 0xec8e, 0xb42c, 0x04b3, +0xfdcb, 0xc5c1, 0x233b, 0x2fa0, 0xe530, 0x27ec, 0x2937, 0xc096, 0xdeaa, 0x2435, +0xe010, 0xe6f7, 0x3e0a, 0xfd91, 0xeb2e, 0x333b, 0xf30c, 0xb2be, 0x1250, 0x1fd9, +0xc7fa, 0x1877, 0x3b5d, 0xdbdb, 0x0644, 0x23bb, 0xbdc0, 0xcc54, 0x2f0c, 0xf1f3, +0xe57b, 0x48e5, 0x082c, 0xe598, 0x360e, 0xf80f, 0xa876, 0x0659, 0x1b42, 0xc57b, +0x1fb9, 0x48cb, 0xe657, 0x1591, 0x3682, 0xcb26, 0xccd4, 0x2692, 0xe8fa, 0xda38, +0x445f, 0x1220, 0xf0e0, 0x3d8f, 0x09d0, 0xb6bc, 0x00e1, 0x260a, 0xd188, 0x0576, +0x3935, 0xef31, 0x1179, 0x33e9, 0xd401, 0xcde0, 0x2d56, 0xfa21, 0xdbb0, 0x4a3c, +0x1c17, 0xdc92, 0x334e, 0x1ceb, 0xb17d, 0xebbf, 0x27e0, 0xd919, 0x0f7e, 0x4a4b, +0xf20c, 0x107b, 0x3a20, 0xcab0, 0xba0a, 0x24cb, 0xf1fa, 0xcaf2, 0x3f6a, 0x2005, +0xe495, 0x30ba, 0x16ef, 0xb7a7, 0xec01, 0x1401, 0xc9b7, 0x05b6, 0x393b, 0xe12d, +0x07bf, 0x44cb, 0xdee8, 0xbd85, 0x23f1, 0xfc20, 0xc5f2, 0x2bd6, 0x194b, 0xdfc0, +0x26e3, 0x160b, 0xba3e, 0xf25d, 0x2457, 0xcdc4, 0x004b, 0x4634, 0xe4dc, 0xf4a7, +0x3d04, 0xdcc3, 0xb397, 0x1fb0, 0x0021, 0xcbc7, 0x37a0, 0x223d, 0xdd2e, 0x2e4a, +0x1e22, 0xae9d, 0xea89, 0x28db, 0xc94f, 0xf4c9, 0x4a0c, 0xf565, 0xfefa, 0x4525, +0xee89, 0xbfb1, 0x1b8b, 0xfa5c, 0xc436, 0x2f51, 0x24ca, 0xdfcd, 0x2cf4, 0x2a31, +0xbd55, 0xe94e, 0x2b96, 0xd147, 0xee2f, 0x4235, 0xf2bf, 0xf601, 0x3b75, 0xe821, +0xb876, 0x1f6c, 0x056a, 0xc597, 0x378b, 0x2e60, 0xd377, 0x1e9d, 0x283c, 0xb892, +0xdee1, 0x2781, 0xd1f0, 0xf4ba, 0x554c, 0x0123, 0xf9be, 0x420b, 0xea52, 0xaa76, +0x121d, 0x04f0, 0xbdca, 0x333f, 0x4315, 0xe753, 0x27d8, 0x325a, 0xb873, 0xd272, +0x2388, 0xcf65, 0xe913, 0x57fe, 0x07f4, 0xf542, 0x4773, 0xf6c7, 0xab18, 0x11a2, +0x0c42, 0xb926, 0x2816, 0x3c96, 0xde7c, 0x28fb, 0x3ab1, 0xb843, 0xd1f6, 0x2e08, +0xd30e, 0xdd67, 0x552d, 0x04b1, 0xe6f1, 0x4408, 0xfac7, 0xa436, 0x0956, 0x1138, +0xb9e0, 0x267a, 0x42e3, 0xd676, 0x199d, 0x3443, 0xb086, 0xc200, 0x28e5, 0xda7a, +0xd827, 0x53d9, 0x0bab, 0xe3c1, 0x40a6, 0xfc98, 0xa29e, 0x018f, 0x1105, 0xb6e7, +0x1b43, 0x498c, 0xdd00, 0x1541, 0x4138, 0xc0de, 0xbf2e, 0x283d, 0xe09c, 0xce50, +0x4aa8, 0x1053, 0xdfdb, 0x3f0a, 0x0676, 0xa0c4, 0xfe21, 0x1b86, 0xb753, 0x10a7, +0x4958, 0xd934, 0x0821, 0x3f0a, 0xc34f, 0xba57, 0x2b9e, 0xe817, 0xc7b8, 0x46a9, +0x0faa, 0xd39d, 0x38e6, 0x0b67, 0x9f2e, 0xfa87, 0x2298, 0xbafd, 0x0a31, 0x466b, +0xd41d, 0xfd51, 0x3a2b, 0xc101, 0xb40d, 0x2b20, 0xef1f, 0xc9c0, 0x46b9, 0x10a8, +0xce9c, 0x3371, 0x097d, 0x9c55, 0xf5c4, 0x3090, 0xd2df, 0xecd4, 0x147e, 0xe806, +0x2e2d, 0x4ebd, 0xe525, 0xe179, 0x26a7, 0xd61d, 0xaa44, 0x0053, 0xe8dc, 0xe136, +0x46b6, 0x57fc, 0x24b5, 0x2da9, 0x235d, 0xcd31, 0xca81, 0xd1c7, 0xaf26, 0xfdb0, +0x3bad, 0x09ac, 0x1da0, 0x74cf, 0x3a9c, 0xd9e6, 0xf662, 0xf1b3, 0xb74e, 0xc78b, +0x079d, 0x1303, 0x25f7, 0x3f88, 0x14f4, 0x2459, 0x2c9b, 0xdd69, 0xc8da, 0xfb0c, +0xfc56, 0xd94a, 0x0b6d, 0x29c0, 0x150a, 0x22e5, 0x1d92, 0x18ef, 0x1cfc, 0x0c23, +0xcdc3, 0xcd7b, 0x0116, 0xd225, 0xea05, 0x3ecf, 0x321c, 0x114b, 0x3429, 0x4818, +0xf80f, 0xe0f6, 0xd86d, 0xb88f, 0xe34c, 0xec85, 0xf335, 0x37f0, 0x5dfb, 0x1c42, +0x11db, 0x4f23, 0xfc26, 0xba44, 0xd5aa, 0xd324, 0xd1fd, 0xf17c, 0x1856, 0x276a, +0x4692, 0x286a, 0x0ba3, 0x3d7b, 0x1150, 0xc1ac, 0xbdf0, 0xe136, 0xd542, 0xcf26, +0x1384, 0x2faf, 0x3870, 0x2e2c, 0x2318, 0x28d4, 0xfdee, 0xcb16, 0xa730, 0xc88d, +0xdb00, 0xceb6, 0x1995, 0x4d9d, 0x384a, 0x1a5c, 0x3253, 0x2473, 0xd8f1, 0xc53c, +0xafa7, 0xc440, 0xe9ed, 0xe807, 0x176e, 0x51f8, 0x4372, 0x074b, 0x2912, 0x2b6d, +0xcf1e, 0xc37a, 0xc518, 0xc3a3, 0xdc9c, 0xfa3e, 0x1a98, 0x40fa, 0x4783, 0x0983, +0x2539, 0x3545, 0xd15a, 0xad3e, 0xc7ca, 0xd8f8, 0xd06d, 0xf96a, 0x3340, 0x3d0f, +0x375f, 0x19a1, 0x2cbe, 0x2480, 0xd619, 0xaa0f, 0xbfde, 0xe9c8, 0xd157, 0xf05e, +0x42af, 0x4a8c, 0x2ada, 0x1e55, 0x372a, 0x09e1, 0xcd35, 0xbbbe, 0xb8fb, 0xe193, +0xe480, 0xf329, 0x3476, 0x51aa, 0x233d, 0x1102, 0x44ce, 0x08c4, 0xbbca, 0xc158, +0xc692, 0xd1e1, 0xdde2, 0x0656, 0x33cd, 0x4f74, 0x2ddc, 0x0f4d, 0x394e, 0x09e6, +0xbe5c, 0xb5ad, 0xcc4d, 0xdc27, 0xdab2, 0x1043, 0x3ea4, 0x479b, 0x2b41, 0x1d61, +0x308b, 0xf8bb, 0xc464, 0xb735, 0xcd64, 0xe75e, 0xe437, 0x161f, 0x4870, 0x48ad, +0x1c9b, 0x1ea2, 0x33d1, 0xf0d7, 0xc828, 0xc0cf, 0xd2aa, 0xe99c, 0xeb83, 0x1a23, +0x47fe, 0x4a7b, 0x1905, 0x1e38, 0x324a, 0xe958, 0xc1e9, 0xc325, 0xd7e4, 0xe635, +0xf2dc, 0x2267, 0x3faa, 0x415f, 0x1a59, 0x202f, 0x2852, 0xe889, 0xc4bd, 0xbe6c, +0xdab6, 0xe56a, 0xef10, 0x26eb, 0x4556, 0x3a6e, 0x180a, 0x2a09, 0x1fb9, 0xde8b, +0xc5cf, 0xb9e8, 0xd7a7, 0xe7b9, 0xedd9, 0x2300, 0x49df, 0x37d1, 0x12a8, 0x2f9a, +0x18aa, 0xce1b, 0xbdb0, 0xbc6b, 0xd29e, 0xdeee, 0xf71a, 0x2781, 0x45f4, 0x339d, +0x0ccf, 0x2b8f, 0x12d6, 0xc8e8, 0xb6b6, 0xbda1, 0xd3af, 0xd912, 0xfe42, 0x2d6d, +0x3ef8, 0x304b, 0x1689, 0x29cf, 0x067c, 0xcba1, 0xb57d, 0xbede, 0xdf90, 0xdc36, +0xfffb, 0x3465, 0x3c40, 0x2128, 0x1a44, 0x31e1, 0xfd23, 0xcc9c, 0xbac3, 0xbc48, +0xdd17, 0xde23, 0xfd31, 0x3137, 0x4362, 0x1eee, 0x18fc, 0x32b8, 0xf20e, 0xc5cc, +0xbb44, 0xbdcc, 0xd9bd, 0xe2e3, 0x076b, 0x353c, 0x4892, 0x1e7b, 0x18f6, 0x30cf, +0xea76, 0xbae7, 0xb387, 0xc4fa, 0xdcc0, 0xe7b8, 0x15fe, 0x3d5b, 0x45ed, 0x199f, +0x192d, 0x2670, 0xe39c, 0xbd23, 0xb49a, 0xce79, 0xe000, 0xe7b3, 0x1c0b, 0x42fb, +0x4231, 0x1500, 0x214f, 0x24b7, 0xddd0, 0xbdaf, 0xb443, 0xd1d6, 0xe488, 0xf035, +0x248c, 0x481a, 0x412e, 0x17e3, 0x2a09, 0x1e55, 0xd730, 0xbb6d, 0xb458, 0xd6fe, +0xe4f4, 0xf65d, 0x30dd, 0x50e1, 0x3ee0, 0x15ff, 0x2a77, 0x133f, 0xd208, 0xbb41, +0xb5d0, 0xdc9b, 0xea0f, 0xfe2e, 0x33e8, 0x4ec6, 0x3729, 0x17b0, 0x327e, 0x0ae7, +0xcbb1, 0xbd40, 0xbbb0, 0xe021, 0xe92f, 0x0274, 0x3a54, 0x53fa, 0x3201, 0x1417, +0x340a, 0x073d, 0xcaf8, 0xbd21, 0xbddc, 0xdfe9, 0xebda, 0x0cee, 0x3df0, 0x5410, +0x3025, 0x16c7, 0x32e0, 0xfb90, 0xc1f6, 0xbac8, 0xcb01, 0xe852, 0xeb00, 0x14bb, +0x4362, 0x4e09, 0x267e, 0x175e, 0x2ea6, 0xf673, 0xc679, 0xb7ca, 0xce42, 0xef38, +0xea88, 0x19da, 0x4c19, 0x4976, 0x1f9b, 0x2155, 0x2984, 0xe747, 0xc939, 0xbc60, +0xced0, 0xf05b, 0xef4a, 0x1a1b, 0x4d06, 0x49db, 0x1707, 0x21a4, 0x261f, 0xdb58, +0xc42f, 0xbd07, 0xcd03, 0xeb57, 0xf6f1, 0x1fe4, 0x4885, 0x45cb, 0x1391, 0x2121, +0x232c, 0xd7ec, 0xbd29, 0xbf59, 0xd799, 0xe575, 0xf6b7, 0x28c6, 0x4774, 0x3e39, +0x1137, 0x1ef7, 0x1744, 0xd610, 0xbc35, 0xb9e4, 0xdd70, 0xe860, 0xf41e, 0x2929, +0x4423, 0x2e1c, 0x110a, 0x2d77, 0x0e41, 0xced2, 0xc1cd, 0xbb1d, 0xd9b8, 0xe41e, +0xf4ed, 0x2b8f, 0x4959, 0x2b92, 0x0f36, 0x32ac, 0x0962, 0xc983, 0xc063, 0xbadd, +0xd65d, 0xe557, 0xfe42, 0x2c4a, 0x49b0, 0x2cc4, 0x11af, 0x335e, 0x0099, 0xbfb6, +0xb950, 0xc282, 0xda13, 0xe2c3, 0x0c6b, 0x2301, 0x3d0d, 0x5b32, 0x2bf1, 0xf816, +0xd811, 0xc694, 0x94e5, 0xa76b, 0x02b3, 0xf90f, 0x23f0, 0x863b, 0x6a8b, 0x1164, +0xf826, 0xd412, 0x8d7c, 0xade7, 0xbb44, 0xce06, 0x446e, 0x60cd, 0x37d3, 0x464b, +0x4603, 0xdb1a, 0xadc9, 0xd748, 0xbb79, 0xd2d1, 0x0130, 0x0928, 0x3b0a, 0x4390, +0x0002, 0xef18, 0x25c7, 0xf662, 0xbcac, 0x1201, 0x1f14, 0xda32, 0xff28, 0x1fbe, +0xd1ed, 0xd6db, 0x389e, 0x0dbf, 0xf3fb, 0x488e, 0x1c7e, 0xe70e, 0x1374, 0xed9e, +0xa6a3, 0xedff, 0x24fa, 0xe3d7, 0x2454, 0x55ff, 0xfbf6, 0x19ad, 0x27e2, 0xbe48, +0xc206, 0x1296, 0xe45b, 0xdd35, 0x4db6, 0x1c33, 0xef46, 0x4348, 0x0b24, 0xb5eb, +0xf732, 0x126a, 0xcd2b, 0x063c, 0x37c5, 0xec01, 0x18d9, 0x3cc8, 0xd616, 0xd2bc, +0x273a, 0xf84b, 0xd381, 0x30e7, 0x1385, 0xdff9, 0x30f4, 0x18b0, 0xc10e, 0x0696, +0x364d, 0xd762, 0xfbf8, 0x3d8c, 0xe397, 0xf63d, 0x3932, 0xe0e0, 0xc7fb, 0x31c6, +0x0e47, 0xd472, 0x33f1, 0x19cb, 0xd9b6, 0x297e, 0x174d, 0xb770, 0xf385, 0x2b80, +0xd844, 0x020b, 0x44ae, 0xecdc, 0xffc6, 0x3c84, 0xe59b, 0xc239, 0x1b9c, 0x03d8, +0xcdfc, 0x284d, 0x2050, 0xe856, 0x29ba, 0x1da6, 0xc79c, 0xf13e, 0x2a8b, 0xdb89, +0xe7cf, 0x315a, 0xf321, 0xf5f9, 0x332c, 0xf230, 0xc508, 0x1566, 0x093d, 0xce9a, +0x23e7, 0x1dac, 0xd1bc, 0x1aa1, 0x2c3b, 0xbf9a, 0xd5cb, 0x286f, 0xe374, 0xeccb, +0x3bb8, 0xfa4b, 0xf5e8, 0x2f2d, 0xe9fe, 0xbb23, 0x0ce2, 0xff3a, 0xc469, 0x2484, +0x2c01, 0xe186, 0x1b3d, 0x26db, 0xc966, 0xd43c, 0x0cf6, 0xd3cc, 0xeaf1, 0x349d, +0xf49e, 0xfa1b, 0x3da3, 0xf2ae, 0xb5a2, 0x09f1, 0x0303, 0xbee6, 0x1c15, 0x2f77, +0xe137, 0x187e, 0x2a96, 0xc3d0, 0xd414, 0x1e88, 0xd685, 0xe774, 0x4a59, 0xfa19, +0xe6e2, 0x3f71, 0xf365, 0xa657, 0x0aac, 0x0b27, 0xbbf9, 0x22a4, 0x3896, 0xdde2, +0x1ea6, 0x2ddb, 0xb6a3, 0xcf13, 0x234d, 0xd209, 0xdfcd, 0x4de4, 0x0530, 0xf235, +0x458e, 0xfe1c, 0xaf9c, 0x04ff, 0x0ba8, 0xc04a, 0x1dfe, 0x3a8f, 0xe44e, 0x1ebd, +0x3786, 0xc838, 0xd340, 0x2d49, 0xe462, 0xdc75, 0x4606, 0x05e5, 0xe8d6, 0x3e07, +0x0367, 0xb349, 0x0d09, 0x1be3, 0xc56a, 0x2148, 0x4004, 0xd8d7, 0x1595, 0x3a7d, +0xc56d, 0xd126, 0x3261, 0xe7bb, 0xe124, 0x5308, 0x0eb8, 0xeb26, 0x437a, 0x042c, +0xaf26, 0x0eb2, 0x218d, 0xc6ad, 0x22c2, 0x4ab9, 0xe2d2, 0x1874, 0x40cd, 0xca8d, +0xc838, 0x2e68, 0xedb9, 0xd7fa, 0x4c7a, 0x1526, 0xe7cb, 0x4150, 0x0c9e, 0xae99, +0x0430, 0x20bb, 0xc1b5, 0x1187, 0x47d4, 0xe4da, 0x1440, 0x42ec, 0xcdff, 0xc6df, +0x2c13, 0xec08, 0xd2d5, 0x46ed, 0x0ef1, 0xdd36, 0x3d9e, 0x0f6f, 0xadf9, 0x0331, +0x2434, 0xc516, 0x0f43, 0x4485, 0xde32, 0x0700, 0x3d61, 0xce91, 0xbeff, 0x2926, +0xf4fa, 0xd134, 0x41a9, 0x1664, 0xdc49, 0x34e2, 0x1333, 0xace3, 0xf361, 0x1f70, +0xc693, 0x0699, 0x47e9, 0xe934, 0x0537, 0x4024, 0xd7ae, 0xba09, 0x1da8, 0xf1cd, +0xcbb4, 0x3981, 0x188e, 0xddeb, 0x326b, 0x1892, 0xb095, 0xf130, 0x20bc, 0xc29d, +0xf9a7, 0x3f9b, 0xe3d4, 0xfb7a, 0x3e64, 0xdf3d, 0xbe59, 0x2395, 0xf6d6, 0xc4b9, +0x3386, 0x1936, 0xd767, 0x2b7a, 0x1dd1, 0xb547, 0xeefe, 0x2814, 0xcaa5, 0xf817, +0x487c, 0xeb89, 0xf26b, 0x397c, 0xdf7f, 0xb39b, 0x1c04, 0xfe68, 0xc54d, 0x349f, +0x2a68, 0xdbdd, 0x22d6, 0x1ddd, 0xb0a0, 0xe0fa, 0x21cc, 0xc993, 0xf898, 0x52ec, +0xf689, 0xf70a, 0x426a, 0xe741, 0xaf61, 0x151d, 0xf921, 0xc0cc, 0x3886, 0x3002, +0xdf54, 0x2dc5, 0x25fe, 0xb022, 0xe019, 0x2b01, 0xdc46, 0xdf34, 0x113b, 0xf3ef, +0x2b9e, 0x5380, 0xf6a9, 0xdedb, 0x2143, 0xe2d9, 0xa1ed, 0xf09b, 0xf0dc, 0xdb67, +0x3407, 0x5e55, 0x32ca, 0x27e1, 0x25c5, 0xd709, 0xc36a, 0xcfc9, 0xa7f8, 0xea51, +0x3bd7, 0x0e16, 0x0801, 0x6978, 0x4f5b, 0xdcee, 0xefc1, 0xfe47, 0xbe36, 0xbc03, +0xf6fb, 0x0a54, 0x1b49, 0x3bd0, 0x15ec, 0x2382, 0x3cb2, 0xeb19, 0xc5aa, 0xedb7, +0xf957, 0xd7a6, 0xf768, 0x22e7, 0x17a3, 0x2061, 0x1ba7, 0x1fd9, 0x23d8, 0x0c01, +0xd667, 0xc4b5, 0xfb1e, 0xd994, 0xd7e9, 0x3398, 0x3e92, 0x166b, 0x27af, 0x4ec2, +0x0515, 0xd7d3, 0xde1a, 0xb994, 0xdcbe, 0xf079, 0xeced, 0x2d31, 0x5f61, 0x253a, +0x040a, 0x4aa6, 0x0dcf, 0xb7f1, 0xcf3e, 0xd1b1, 0xcf61, 0xe63f, 0x105c, 0x26cc, +0x431a, 0x31ef, 0x089d, 0x3279, 0x1505, 0xc9c8, 0xbc77, 0xd253, 0xdbe3, 0xd185, +0x028c, 0x2ef7, 0x3d5b, 0x2ff3, 0x2436, 0x2ecc, 0xffae, 0xd27d, 0xae72, 0xb7bb, +0xda8b, 0xd2ea, 0x0b5f, 0x4d03, 0x43e6, 0x19f3, 0x2a63, 0x2e3d, 0xdc83, 0xc2d3, +0xb8a6, 0xbf1e, 0xe681, 0xe9fe, 0x0c02, 0x47ed, 0x4b9b, 0x0b96, 0x1c09, 0x3193, +0xdad3, 0xc2e7, 0xcba3, 0xc7a2, 0xd979, 0xf765, 0x1768, 0x34eb, 0x4272, 0x0e6d, +0x1cba, 0x35bf, 0xe2f7, 0xb4ec, 0xc2dc, 0xdbc9, 0xd4b0, 0xeaf5, 0x2a04, 0x3d45, +0x3135, 0x163c, 0x29bf, 0x1de9, 0xd862, 0xb512, 0xbc25, 0xe60f, 0xdb2d, 0xe4e1, +0x2e4c, 0x46ed, 0x2280, 0x0c95, 0x3390, 0x0dba, 0xc912, 0xc227, 0xbe99, 0xd9c1, +0xe290, 0xed33, 0x2239, 0x44f4, 0x1ed4, 0x0166, 0x3720, 0x122c, 0xc1e5, 0xbe0b, +0xcc00, 0xd5f1, 0xd17f, 0xf3b3, 0x23a2, 0x3db4, 0x2624, 0x0cc4, 0x33e1, 0x1023, +0xc9ae, 0xb631, 0xc8cd, 0xdd8a, 0xceea, 0xfaf7, 0x3621, 0x3ded, 0x1ca5, 0x1b0d, +0x3ba6, 0x0216, 0xce92, 0xc394, 0xc90e, 0xdd1a, 0xd9c7, 0x0438, 0x3a3b, 0x43f5, +0x193b, 0x1b93, 0x427f, 0xfe8c, 0xc66d, 0xc591, 0xd58c, 0xe393, 0xe1bc, 0x0fe2, +0x3df6, 0x448e, 0x1c8a, 0x21c0, 0x3e71, 0xf9bd, 0xc96f, 0xc456, 0xd5d9, 0xe4b5, +0xe922, 0x1ce5, 0x418b, 0x417b, 0x1d09, 0x2518, 0x341d, 0xf03a, 0xcbea, 0xc1e1, +0xd6e8, 0xe7f3, 0xe55f, 0x1d2e, 0x4954, 0x3f9e, 0x1b23, 0x31e7, 0x3163, 0xe580, +0xcb7b, 0xbe90, 0xd27b, 0xe98e, 0xede5, 0x22f3, 0x51cc, 0x440f, 0x174a, 0x3744, +0x308b, 0xdab4, 0xc2e8, 0xc03f, 0xd50d, 0xe3f9, 0xf766, 0x2e0e, 0x4fbc, 0x4269, +0x17f2, 0x2ec2, 0x1f55, 0xd524, 0xbca2, 0xbb93, 0xda21, 0xe34e, 0xfad1, 0x31b6, +0x47da, 0x36e7, 0x19ff, 0x2ef6, 0x0ef3, 0xd0a0, 0xb94c, 0xb54a, 0xdd97, 0xe171, +0xf86b, 0x35bc, 0x47ba, 0x2983, 0x1694, 0x3324, 0x023b, 0xc961, 0xbc03, 0xb2d4, +0xd7d9, 0xe2e7, 0xf9f7, 0x3391, 0x4b1a, 0x23f3, 0x1255, 0x2f9f, 0xf2dd, 0xbf1b, +0xb8c8, 0xb595, 0xd67b, 0xe49e, 0x04eb, 0x3553, 0x491e, 0x20bc, 0x101c, 0x2d09, +0xefb9, 0xbc9b, 0xb456, 0xbc74, 0xdcb8, 0xe7e3, 0x1085, 0x3e2d, 0x4862, 0x20a4, +0x178e, 0x24e7, 0xe5be, 0xbfc5, 0xb5ac, 0xc6ce, 0xe4c1, 0xe9df, 0x156b, 0x41e6, +0x4347, 0x169b, 0x1dcf, 0x2537, 0xdbdb, 0xbd60, 0xb4ac, 0xc74f, 0xe58f, 0xf1d1, +0x1bdb, 0x438d, 0x41e3, 0x1215, 0x1c5f, 0x197b, 0xd34e, 0xbb05, 0xb7f2, 0xd3b2, +0xe362, 0xf0f9, 0x2581, 0x46a8, 0x3c22, 0x115f, 0x2009, 0x122f, 0xd304, 0xbd34, +0xb54b, 0xd890, 0xe911, 0xf7d8, 0x2be6, 0x4644, 0x3124, 0x11c4, 0x2d7b, 0x0ee0, +0xcfc2, 0xc445, 0xbf59, 0xdf01, 0xe6a3, 0xf6fe, 0x2fa7, 0x4f24, 0x32c6, 0x10fe, +0x360f, 0x14d0, 0xd1fe, 0xc5f6, 0xc3cd, 0xdf16, 0xe84d, 0x00f9, 0x3302, 0x4f34, +0x330f, 0x190f, 0x3c38, 0x0f70, 0xcd2f, 0xc1c9, 0xccf8, 0xe5e1, 0xe528, 0x0d0a, +0x3fdc, 0x4c89, 0x2965, 0x1572, 0x3558, 0x0773, 0xcf30, 0xbe56, 0xcfa1, 0xeeb4, +0xe390, 0x0d40, 0x446b, 0x47d6, 0x22c9, 0x1f4d, 0x33f7, 0xf611, 0xcd9c, 0xbd57, +0xc66d, 0xec7d, 0xe7bf, 0x0df9, 0x474d, 0x4b43, 0x1b2f, 0x1f2d, 0x35f1, 0xea3c, +0xc455, 0xbc6b, 0xc16f, 0xe41e, 0xef9d, 0x16e5, 0x457b, 0x4d9b, 0x1df1, 0x2052, +0x310e, 0xe35e, 0xbd3b, 0xbe4a, 0xd17b, 0xe63a, 0xf0dd, 0x2445, 0x4bde, 0x4c1f, +0x20d2, 0x25a1, 0x2da1, 0xe9a8, 0xc288, 0xb909, 0xd9c6, 0xee3e, 0xf6a6, 0x2ef9, +0x50a3, 0x43ee, 0x1dd3, 0x2eed, 0x2309, 0xe027, 0xcabc, 0xbd16, 0xdbde, 0xee25, +0xf339, 0x2c27, 0x5390, 0x40a0, 0x1b96, 0x375c, 0x1d2b, 0xd734, 0xc78b, 0xb807, +0xd541, 0xecee, 0xfe54, 0x2fa0, 0x5361, 0x3f28, 0x1522, 0x3393, 0x1266, 0xc88d, +0xbc85, 0xb8d2, 0xd4a8, 0xe5ab, 0x0438, 0x3396, 0x4c0c, 0x33cd, 0x0a79, 0x2169, +0xfe45, 0xc2f1, 0xb2f9, 0xb954, 0xe0e9, 0xe165, 0x029e, 0x2aa5, 0x318e, 0x465f, +0x33d0, 0x0444, 0xd0f3, 0xc734, 0xa46c, 0x9309, 0xec1b, 0xfbdf, 0x010e, 0x6440, +0x7e13, 0x1ed8, 0xeedd, 0xe7dd, 0x9c36, 0x94bd, 0xaeea, 0xb4e6, 0x08d9, 0x4ccc, +0x44d3, 0x3995, 0x43b3, 0xfbc8, 0xa9f8, 0xbc47, 0xb7e9, 0xb05c, 0xd4b9, 0x0205, +0x2fad, 0x38f1, 0x145d, 0xf759, 0x0aec, 0xf6cf, 0xb93a, 0xdb0a, 0x14b9, 0xe52f, +0xdb64, 0x2275, 0xfc04, 0xc169, 0x1482, 0x2708, 0xda58, 0x13ad, 0x34f3, 0xe68c, +0xf5c6, 0x0b27, 0xbfca, 0xc11f, 0x1a39, 0xf895, 0xf15a, 0x535e, 0x1fbe, 0xfd1c, +0x2fab, 0xeb46, 0xb207, 0xf114, 0xfe7d, 0xd0f4, 0x2a5f, 0x4be3, 0xf98f, 0x2db3, +0x365b, 0xcbe5, 0xd12f, 0x160e, 0xe93e, 0xe29c, 0x4478, 0x1d6f, 0x0413, 0x49f1, +0x0cdb, 0xc582, 0x08ff, 0x1ce3, 0xd295, 0x10d4, 0x44fb, 0xeff9, 0x15bb, 0x4310, +0xddfd, 0xd8c9, 0x34f7, 0xfaaf, 0xd716, 0x4457, 0x1cff, 0xe28a, 0x3514, 0x1237, +0xb5a9, 0x01cc, 0x3075, 0xd90a, 0x1130, 0x4b8f, 0xf1cd, 0x0fee, 0x37f4, 0xcf77, +0xc32c, 0x262d, 0xfb1f, 0xde11, 0x4cfa, 0x220f, 0xe7b6, 0x379f, 0x1630, 0xb473, +0xeb2b, 0x1f40, 0xcdde, 0xfb49, 0x44ba, 0xf7a8, 0x0b44, 0x3ad4, 0xdf56, 0xbc11, +0x192e, 0xfdae, 0xc1e6, 0x2be2, 0x260a, 0xe13b, 0x285b, 0x1e09, 0xb912, 0xe471, +0x2223, 0xd36d, 0xfe2f, 0x46c5, 0xe36b, 0xf7a8, 0x4755, 0xdf55, 0xa7b3, 0x1a23, +0x0b84, 0xc893, 0x2faf, 0x2991, 0xe2bb, 0x2481, 0x13cb, 0xb383, 0xe0a3, 0x1702, +0xc7e4, 0xf45d, 0x4b67, 0xf6a6, 0xf97a, 0x3e6f, 0xecd9, 0xadf3, 0xfeb4, 0xfd06, +0xc788, 0x1f7a, 0x200a, 0xe5ba, 0x31ba, 0x2511, 0xb3da, 0xe100, 0x2776, 0xc990, +0xe1ba, 0x44f0, 0xef0a, 0xe6e3, 0x3c2c, 0xf024, 0xb397, 0x1376, 0x054e, 0xc2a5, +0x2c7f, 0x2067, 0xc5d1, 0x227f, 0x2507, 0xa6ee, 0xd8b4, 0x2da2, 0xd0d2, 0xe5d2, +0x4ae3, 0xf3c8, 0xec01, 0x3d1d, 0xe4c8, 0xa76d, 0x0cd7, 0x02fe, 0xc051, 0x2a3f, +0x2ff4, 0xd96d, 0x206e, 0x2cdb, 0xbcc2, 0xcfce, 0x1d9e, 0xd936, 0xe286, 0x3c62, +0xf899, 0xf161, 0x4188, 0xfacc, 0xb89c, 0x13b2, 0x0f18, 0xbfc2, 0x1908, 0x2b9b, +0xdd40, 0x1c58, 0x31c8, 0xcc18, 0xe1de, 0x3029, 0xe1a2, 0xeab8, 0x4814, 0xf8bb, +0xec3b, 0x41cd, 0xfd3d, 0xbb42, 0x1ab1, 0x1bc5, 0xd03f, 0x2b94, 0x39e6, 0xe56b, +0x20f6, 0x302f, 0xc7e3, 0xe07e, 0x304b, 0xe35d, 0xef37, 0x556b, 0x0a77, 0xf3f3, +0x471e, 0x0715, 0xb6bf, 0x0a15, 0x15a7, 0xc8f0, 0x27ce, 0x49e1, 0xef3f, 0x24d8, +0x3fc8, 0xcf85, 0xd3a9, 0x2981, 0xe391, 0xe1e2, 0x5568, 0x1a44, 0xf6f8, 0x47a5, +0x0bb1, 0xb4f6, 0x0758, 0x180f, 0xc264, 0x1c7f, 0x4997, 0xe7b6, 0x1790, 0x3eec, +0xcc71, 0xc989, 0x25c5, 0xe0ff, 0xd5eb, 0x4cb5, 0x1585, 0xe9fb, 0x3f4e, 0x079f, +0xa4e8, 0xf8b6, 0x18b7, 0xbe0e, 0x140f, 0x4dcd, 0xe6f8, 0x106e, 0x3e48, 0xc659, +0xb8d1, 0x1fc6, 0xe2f7, 0xcafc, 0x4b21, 0x1aac, 0xddf9, 0x38ef, 0x0d86, 0xa172, +0xefb8, 0x1ae3, 0xb8b9, 0x022b, 0x4952, 0xe3b7, 0x0763, 0x3fb6, 0xcaa1, 0xb546, +0x2034, 0xe7b3, 0xc26e, 0x4341, 0x1b44, 0xd872, 0x37f9, 0x158c, 0xa302, 0xed16, +0x212e, 0xbda6, 0x0112, 0x4eb5, 0xe481, 0x0180, 0x448c, 0xd2be, 0xb34a, 0x2659, +0xf969, 0xc3e7, 0x4253, 0x2498, 0xd3ac, 0x2f84, 0x1c93, 0xa86a, 0xeae4, 0x2be9, +0xc824, 0xfb1e, 0x5254, 0xeb1f, 0xf85a, 0x40c6, 0xd602, 0xacc6, 0x20d2, 0xfcc1, +0xbfa1, 0x3d9b, 0x2b83, 0xd669, 0x2fcc, 0x202d, 0xa65f, 0xe170, 0x2e20, 0xdd4c, +0xe4e8, 0x1128, 0xe9c6, 0x2b2e, 0x54f5, 0xec68, 0xd881, 0x25b3, 0xe44f, 0x9e7f, +0xf130, 0xeb8e, 0xd492, 0x3413, 0x5451, 0x26e6, 0x289d, 0x2623, 0xcf51, 0xbd9d, +0xcfb5, 0xa20d, 0xdfe7, 0x36b7, 0x0cc4, 0x056d, 0x65fe, 0x4dbe, 0xdc03, 0xeb0b, +0xf3c5, 0xb95e, 0xbfab, 0xf463, 0x0575, 0x1cd4, 0x3d59, 0x1332, 0x1c9e, 0x36b2, +0xe6ff, 0xc1d2, 0xebab, 0xf875, 0xd9ed, 0xf751, 0x1ec8, 0x177a, 0x1fdf, 0x14b0, +0x158a, 0x1d8b, 0x09a1, 0xd3cc, 0xc301, 0xfa03, 0xda41, 0xd913, 0x31d2, 0x3bcd, +0x1398, 0x2276, 0x47f0, 0x04ad, 0xdb13, 0xde05, 0xbc40, 0xe0b4, 0xf233, 0xedf8, +0x2b4d, 0x5c62, 0x258d, 0x04db, 0x4756, 0x0b9d, 0xbaa9, 0xd2dc, 0xd3e6, 0xd2e5, +0xeb10, 0x1044, 0x260b, 0x4492, 0x307c, 0x0989, 0x37e3, 0x1952, 0xc9b1, 0xbe5d, +0xd980, 0xdd51, 0xcfb1, 0x0665, 0x3440, 0x3f66, 0x32e5, 0x2caa, 0x3828, 0x04a2, +0xd6f3, 0xb98c, 0xc152, 0xdc75, 0xd7fc, 0x131d, 0x50a8, 0x4584, 0x218f, 0x39e9, +0x3a8c, 0xe3c0, 0xca56, 0xc147, 0xc3c0, 0xe3a0, 0xec33, 0x13df, 0x4aaa, 0x4c83, +0x117c, 0x2896, 0x399a, 0xdc86, 0xc6f6, 0xcd47, 0xc6ce, 0xd9cc, 0xf86e, 0x19ad, +0x3a91, 0x491f, 0x123e, 0x24d9, 0x3cde, 0xe11b, 0xb37c, 0xc2df, 0xd7a4, 0xd130, +0xef29, 0x2c49, 0x3d20, 0x37d9, 0x16ea, 0x291c, 0x26ac, 0xda1f, 0xaaed, 0xb607, +0xe686, 0xd568, 0xe17d, 0x337f, 0x4b43, 0x2881, 0x1389, 0x38c7, 0x12c8, 0xcd26, +0xbcc3, 0xb56e, 0xdd1b, 0xe483, 0xea42, 0x2a90, 0x51ed, 0x261e, 0x0805, 0x4126, +0x1494, 0xbddc, 0xbaf3, 0xc450, 0xd324, 0xd5cd, 0xf712, 0x2ef6, 0x4d20, 0x2af3, +0x0e0c, 0x3762, 0x0ac6, 0xbe79, 0xae49, 0xc076, 0xd8d1, 0xd3ec, 0x0029, 0x3a43, +0x4756, 0x22ca, 0x1958, 0x35d2, 0xf721, 0xbeb2, 0xb3fe, 0xbef0, 0xda1f, 0xdc92, +0x07d3, 0x4050, 0x4bd0, 0x19d3, 0x154a, 0x3522, 0xefeb, 0xbbc4, 0xb715, 0xc994, +0xdf48, 0xe0b3, 0x1046, 0x40b6, 0x462c, 0x16f6, 0x1aab, 0x3230, 0xe981, 0xbd2a, +0xbab3, 0xd2a2, 0xe5c9, 0xe97f, 0x1c0b, 0x466f, 0x4272, 0x167d, 0x2642, 0x3042, +0xe930, 0xc684, 0xbe13, 0xdccc, 0xed63, 0xea9d, 0x2413, 0x5441, 0x43f9, 0x180c, +0x36e2, 0x2e3f, 0xdd7b, 0xc957, 0xc358, 0xdaa2, 0xeec1, 0xf6ba, 0x27c0, 0x5560, +0x448c, 0x1635, 0x38ef, 0x285a, 0xd524, 0xc336, 0xc6ef, 0xdd82, 0xe86a, 0x024a, +0x3514, 0x5243, 0x4024, 0x1679, 0x30ad, 0x19cb, 0xd2e3, 0xbea4, 0xc57f, 0xe4e0, +0xe5d6, 0xfff4, 0x3873, 0x4af7, 0x2f8e, 0x188b, 0x3243, 0x0881, 0xcd5e, 0xbb93, +0xbf31, 0xe52f, 0xe3f9, 0xfc94, 0x39c7, 0x4714, 0x1d41, 0x169d, 0x38c9, 0xfecd, +0xcb1a, 0xc0fc, 0xbdbe, 0xdc75, 0xe1b5, 0xfaa7, 0x3213, 0x48a1, 0x1b68, 0x15dc, +0x3a99, 0xf55f, 0xc01b, 0xbf71, 0xc2a6, 0xd4e4, 0xdf4d, 0x066a, 0x3170, 0x40f1, +0x1a26, 0x18e0, 0x342c, 0xedf9, 0xba41, 0xb3b4, 0xc38e, 0xd795, 0xe02b, 0x10cf, +0x387d, 0x3bf9, 0x151b, 0x1afe, 0x254b, 0xde99, 0xbc43, 0xb3bd, 0xc921, 0xde4a, +0xe189, 0x1332, 0x3ec6, 0x3af6, 0x0d82, 0x1fcf, 0x23ba, 0xd6bf, 0xb847, 0xb180, +0xcc73, 0xe0cc, 0xeb2b, 0x1cb5, 0x417e, 0x395b, 0x0e37, 0x260e, 0x1c37, 0xceea, +0xb693, 0xb466, 0xd44d, 0xde55, 0xeccf, 0x28e9, 0x4c64, 0x3a26, 0x1085, 0x2a16, +0x12d5, 0xcc04, 0xb7f6, 0xb4e4, 0xda25, 0xe424, 0xf801, 0x3387, 0x4c82, 0x2ff0, +0x133d, 0x33da, 0x0a6a, 0xc653, 0xba9f, 0xb9a4, 0xdb0d, 0xe2d3, 0xfd70, 0x3932, +0x535b, 0x2ec6, 0x131d, 0x36f2, 0x041c, 0xc4de, 0xbc13, 0xbb88, 0xdb49, 0xe632, +0x0792, 0x3bf9, 0x5215, 0x2df5, 0x197b, 0x38ba, 0xfc1c, 0xc000, 0xb9c1, 0xc559, +0xe3b9, 0xea55, 0x13bb, 0x45e0, 0x506f, 0x2598, 0x1a8a, 0x31d4, 0xf25d, 0xc2c1, +0xb752, 0xc926, 0xeaa3, 0xebad, 0x18ac, 0x4b3a, 0x4b14, 0x1dc9, 0x246e, 0x2f24, +0xe2ff, 0xc4be, 0xbca8, 0xccb7, 0xee7a, 0xf1d7, 0x1fad, 0x5446, 0x4e8c, 0x1a55, +0x2bfd, 0x2de3, 0xdbcc, 0xc7c4, 0xc19e, 0xcdf0, 0xeebf, 0x0347, 0x2b46, 0x50aa, +0x4efc, 0x1ae7, 0x2bc2, 0x29fc, 0xd661, 0xbcdd, 0xc496, 0xddc3, 0xe917, 0xff6c, +0x336f, 0x4f83, 0x433f, 0x1820, 0x2877, 0x176c, 0xd63d, 0xbf37, 0xbd41, 0xe3e4, +0xec70, 0xfccc, 0x35e8, 0x4cad, 0x2f68, 0x12a7, 0x2fac, 0x08d7, 0xcd76, 0xc4f5, +0xbf59, 0xdfbb, 0xe9f3, 0xfd34, 0x3194, 0x4aa3, 0x2767, 0x0f36, 0x33c2, 0x0048, +0xc54f, 0xc2fd, 0xbd10, 0xd605, 0xe41c, 0xff51, 0x2a83, 0x4801, 0x28e6, 0x0aff, +0x2f62, 0xfdb7, 0xbd39, 0xb775, 0xc18e, 0xd7dc, 0xe021, 0x0a7d, 0x33af, 0x423a, +0x2081, 0x0d26, 0x28f2, 0xf6aa, 0xc604, 0xb20f, 0xca22, 0xf929, 0xe0c9, 0xfe41, +0x2c91, 0x285c, 0x3479, 0x40e1, 0x11dd, 0xd23c, 0xd207, 0xa861, 0xa807, 0xfe96, +0xf904, 0x0d6b, 0x7934, 0x78f8, 0x0f08, 0xfce1, 0xe859, 0x8e1b, 0xa714, 0xc4a3, +0xd05d, 0x3229, 0x6379, 0x4af3, 0x48ea, 0x4a2d, 0xe67d, 0xa875, 0xd782, 0xc120, +0xb7cb, 0xfb9f, 0x1f2e, 0x34e8, 0x4bf0, 0x20cd, 0xf0b2, 0x1643, 0x0563, 0xbcd0, +0xf27f, 0x2741, 0xe7cd, 0xef58, 0x2d5f, 0xebc6, 0xc657, 0x2de0, 0x1cb6, 0xe47e, +0x4360, 0x2d6e, 0xe23e, 0x16ee, 0xf98d, 0xa445, 0xddbb, 0x207f, 0xe2c0, 0x123e, +0x5bce, 0x016d, 0x1099, 0x3582, 0xc93d, 0xb242, 0x0573, 0xeaa3, 0xcd42, 0x3ec8, +0x2edf, 0xedf6, 0x39f9, 0x19b8, 0xb85b, 0xe3bc, 0x1369, 0xd1a8, 0xf1db, 0x3e71, +0xf679, 0x05fa, 0x4211, 0xe5a8, 0xbfbb, 0x17fb, 0x0686, 0xc767, 0x1e4b, 0x24e5, +0xdea8, 0x2460, 0x26bf, 0xbfbf, 0xebef, 0x3662, 0xdb5b, 0xe735, 0x478f, 0xf36f, +0xe6aa, 0x3a12, 0xedab, 0xb885, 0x2168, 0x1a11, 0xd137, 0x2b7c, 0x29a9, 0xd6be, +0x2004, 0x24d0, 0xb744, 0xddad, 0x2f52, 0xe201, 0xeeef, 0x4b3b, 0xfc02, 0xef7b, +0x3d92, 0xf6b9, 0xb6be, 0x0b17, 0x0d77, 0xc534, 0x191c, 0x30b3, 0xe945, 0x23b0, +0x2f3b, 0xc9bb, 0xd7dc, 0x269c, 0xe46c, 0xd902, 0x3766, 0x0212, 0xeb25, 0x39af, +0x03e0, 0xb8e7, 0x077c, 0x169d, 0xcc6f, 0x1b10, 0x2e0e, 0xd19a, 0x0fd8, 0x38f6, +0xca91, 0xc8f9, 0x29d6, 0xf078, 0xdd5c, 0x3b96, 0x09ef, 0xf001, 0x3507, 0xfbb1, +0xb660, 0x03d5, 0x0e0a, 0xc387, 0x17f0, 0x3e5b, 0xe93c, 0x15a4, 0x38a5, 0xd46a, +0xc5fe, 0x1360, 0xe4bc, 0xda9b, 0x39bc, 0x0c8d, 0xef2a, 0x3f9f, 0x0fdb, 0xb193, +0xf8d2, 0x1694, 0xb855, 0xffea, 0x4558, 0xed39, 0x083b, 0x3cd1, 0xda45, 0xc36d, +0x1e6e, 0xe476, 0xc765, 0x430f, 0x19a5, 0xde45, 0x3c55, 0x16d3, 0xa619, 0xf171, +0x1f0a, 0xbe1b, 0x04f9, 0x4d9d, 0xeec4, 0x0d1f, 0x3e78, 0xccbe, 0xb49f, 0x1d9b, +0xeb29, 0xc2b6, 0x448d, 0x28e1, 0xe2a4, 0x3aab, 0x21b9, 0xad2c, 0xe5d9, 0x1d14, +0xbe21, 0xf5ec, 0x4db1, 0xef99, 0x030b, 0x4e45, 0xe3cc, 0xb105, 0x20c5, 0xfc50, +0xb9ac, 0x35e2, 0x2898, 0xd9cf, 0x3397, 0x236d, 0xace6, 0xea90, 0x2c38, 0xc65d, +0xf7eb, 0x5313, 0xe39f, 0xf211, 0x477a, 0xdbe9, 0xad7a, 0x1ffa, 0x0017, 0xc201, +0x3906, 0x27ff, 0xd56a, 0x2d70, 0x20b7, 0xa843, 0xe22b, 0x2d3a, 0xc8d1, 0xeff9, +0x5809, 0xf171, 0xf1ca, 0x4aa1, 0xe752, 0xa7f6, 0x1531, 0x03a8, 0xbd38, 0x3515, +0x35e4, 0xd873, 0x2cec, 0x2fa3, 0xaedb, 0xd92e, 0x2cc6, 0xccea, 0xe531, 0x5116, +0xf947, 0xf6dd, 0x4ce8, 0xef45, 0xaeac, 0x190f, 0x0bfc, 0xbc68, 0x2afb, 0x3612, +0xd723, 0x2687, 0x3899, 0xbdfb, 0xda26, 0x3069, 0xdbaf, 0xe6bf, 0x5016, 0x0057, +0xf1d5, 0x480e, 0xf64b, 0xad29, 0x13a0, 0x16f4, 0xc33e, 0x2614, 0x4041, 0xe193, +0x201a, 0x3648, 0xc1be, 0xd35e, 0x2aee, 0xe031, 0xe3b6, 0x52de, 0x0b18, 0xedc3, +0x4b67, 0x084a, 0xaf95, 0x0ccc, 0x1af7, 0xc089, 0x19da, 0x4369, 0xe6d2, 0x1d97, +0x422d, 0xcfe2, 0xd1f7, 0x2e93, 0xe6d4, 0xd904, 0x4acc, 0x0d46, 0xe47d, 0x425b, +0x0eb4, 0xb1bb, 0x06af, 0x2009, 0xc469, 0x12a4, 0x3fee, 0xdd98, 0x0e0f, 0x3d40, +0xcdb1, 0xc9b2, 0x2f38, 0xedc8, 0xcf7d, 0x42ef, 0x1026, 0xd9af, 0x3710, 0x1033, +0xad12, 0xfd62, 0x2285, 0xc358, 0x0c72, 0x48be, 0xe51c, 0x0a9a, 0x2ff8, 0xbdc8, +0xc28d, 0x2cc9, 0xfec9, 0xc7ca, 0x13e5, 0x17e1, 0x02ca, 0x35c6, 0x0fac, 0xcd93, +0xf8c0, 0xfbac, 0xbba6, 0xe67f, 0x0735, 0xd6a6, 0x1bde, 0x7350, 0x2eb9, 0xfad9, +0x2334, 0xeee4, 0xa104, 0xc9e5, 0xcf89, 0xd376, 0x2f8b, 0x2f58, 0x13f9, 0x6199, +0x5172, 0xd760, 0xdae6, 0x0109, 0xaaab, 0x9f01, 0x11f6, 0x1c74, 0xff8b, 0x303b, +0x3d89, 0x2a49, 0x1900, 0xe5d6, 0xbb94, 0xe00a, 0xeeb6, 0xce23, 0x0253, 0x3291, +0x20e8, 0x0d77, 0x2650, 0x2ac1, 0xf46d, 0xf971, 0xdbe5, 0xc599, 0xf13a, 0xdd86, +0xebfb, 0x30a4, 0x422d, 0x0726, 0x20e1, 0x53cf, 0xe990, 0xbf8d, 0xd717, 0xc738, +0xcc12, 0xed69, 0x1207, 0x2679, 0x4b59, 0x2072, 0x0f6e, 0x3b3c, 0xef93, 0xaf82, +0xc07e, 0xdcf5, 0xccea, 0xe17b, 0x31b5, 0x3ad1, 0x3673, 0x24ae, 0x1fad, 0x2260, +0xf0dd, 0xc29e, 0xb494, 0xe43c, 0xe377, 0xdb2b, 0x2318, 0x45fc, 0x34e0, 0x20c4, +0x3ea5, 0x232d, 0xdb31, 0xcc1d, 0xb320, 0xc65a, 0xdf18, 0xea47, 0x25f0, 0x5cd4, +0x4386, 0x10e7, 0x3d78, 0x214b, 0xc538, 0xbca9, 0xbe8b, 0xcd16, 0xe049, 0x05f5, +0x2fe8, 0x5197, 0x45f2, 0x0fc2, 0x2f2f, 0x1971, 0xc5a7, 0xb7fc, 0xca80, 0xd975, +0xd7df, 0x0c99, 0x3a4e, 0x3fc6, 0x30e6, 0x13a0, 0x2b87, 0x0f79, 0xcd82, 0xaf27, +0xc107, 0xe381, 0xd5f3, 0x035c, 0x44e6, 0x44fc, 0x1db9, 0x1e95, 0x3a4e, 0xf713, +0xc17f, 0xb545, 0xc44b, 0xea43, 0xe0b2, 0x034f, 0x458e, 0x4e96, 0x1557, 0x1819, +0x3caa, 0xeb53, 0xb81f, 0xc29d, 0xcb34, 0xd827, 0xea2e, 0x153f, 0x3683, 0x4599, +0x17a8, 0x1025, 0x3238, 0xefae, 0xb3df, 0xb7d0, 0xd811, 0xd6f7, 0xd85a, 0x1792, +0x3a94, 0x35ea, 0x1657, 0x21c8, 0x243d, 0xdfb1, 0xbb30, 0xb0e9, 0xceed, 0xddbf, +0xdff2, 0x1be1, 0x44e0, 0x3265, 0x0879, 0x260d, 0x1f6a, 0xcd4c, 0xba1b, 0xbafd, +0xcb3d, 0xd899, 0xeb07, 0x19d6, 0x3c13, 0x3544, 0x08ed, 0x2407, 0x1daa, 0xcd68, +0xb792, 0xbf01, 0xd1c2, 0xd611, 0xf34b, 0x259b, 0x3b2f, 0x2f39, 0x1053, 0x2d78, +0x1a05, 0xd265, 0xba97, 0xc02a, 0xdab7, 0xd903, 0xf86d, 0x2ff9, 0x403d, 0x28d3, +0x14a1, 0x34af, 0x0a0e, 0xcda4, 0xc3ac, 0xc13a, 0xdd8d, 0xe2ea, 0xfd27, 0x2eb2, +0x45ac, 0x26be, 0x14ec, 0x3dd9, 0x06bc, 0xc81d, 0xc6e2, 0xc719, 0xd8c3, 0xe5c7, +0x0b66, 0x32c9, 0x4b92, 0x2cb4, 0x19ce, 0x3c10, 0x0272, 0xc5eb, 0xbb96, 0xccd7, +0xe07a, 0xdfbb, 0x160a, 0x4341, 0x4749, 0x2676, 0x21c7, 0x2fd3, 0xf0d0, 0xc6ee, +0xb624, 0xcad8, 0xe85f, 0xe7c5, 0x1d81, 0x4b84, 0x45af, 0x1eba, 0x2c0d, 0x30c1, +0xe4ba, 0xca8d, 0xbdbe, 0xcc89, 0xed50, 0xf3dd, 0x2203, 0x5159, 0x4cd1, 0x1b22, +0x2e08, 0x3255, 0xe28f, 0xc7e6, 0xc2e3, 0xd510, 0xe8de, 0xfa14, 0x2846, 0x4a33, +0x4c04, 0x1fed, 0x2f64, 0x2cdb, 0xe195, 0xc51d, 0xc13f, 0xdb62, 0xe696, 0xfa3e, +0x31bd, 0x4d3c, 0x4355, 0x2150, 0x33b3, 0x204a, 0xe0d7, 0xc877, 0xbdd9, 0xdeff, +0xeb46, 0x0024, 0x3a0c, 0x5485, 0x3c57, 0x1fe4, 0x3a57, 0x110e, 0xd1f0, 0xc4f8, +0xbfae, 0xe303, 0xf0e8, 0x0757, 0x3795, 0x525c, 0x364d, 0x163e, 0x3411, 0x078d, +0xc95e, 0xbed3, 0xc146, 0xdd79, 0xe8cb, 0x0fb0, 0x3b8b, 0x4b40, 0x2f52, 0x1708, +0x2c9b, 0xf6f7, 0xc33e, 0xb8f8, 0xc0a0, 0xe27b, 0xe6d8, 0x0c22, 0x3d9b, 0x4878, +0x24a6, 0x186c, 0x2467, 0xe600, 0xc014, 0xb323, 0xbc0b, 0xe0eb, 0xe8da, 0x0f11, +0x3cef, 0x40c5, 0x12df, 0x1430, 0x227a, 0xdb2e, 0xb8c4, 0xb5de, 0xc528, 0xdd7a, +0xe824, 0x13d4, 0x3e15, 0x4384, 0x124e, 0x1469, 0x1e10, 0xd6df, 0xb7fb, 0xb8e3, +0xcdaf, 0xdd42, 0xecbb, 0x1e7d, 0x3c6f, 0x378a, 0x1149, 0x1e8a, 0x1b08, 0xd447, +0xb3c7, 0xb0b3, 0xd341, 0xe16d, 0xebda, 0x22db, 0x4450, 0x345d, 0x0fcd, 0x27aa, +0x137c, 0xcfd2, 0xc241, 0xbb1b, 0xd538, 0xe771, 0xf62c, 0x297f, 0x4c37, 0x3271, +0x103e, 0x360c, 0x143c, 0xc8cb, 0xc2e2, 0xc46f, 0xd919, 0xe83f, 0x0316, 0x2e44, +0x49f7, 0x320d, 0x1102, 0x34eb, 0x0f20, 0xc998, 0xc1e5, 0xc68b, 0xd8b7, 0xe3aa, +0x0e51, 0x3839, 0x473d, 0x306d, 0x1936, 0x313b, 0x023a, 0xca3b, 0xb9cb, 0xc4e8, +0xe9a8, 0xe8e8, 0x0e4f, 0x4390, 0x4a72, 0x23d2, 0x1d52, 0x31ca, 0xf0b0, 0xc813, +0xbd25, 0xc202, 0xe6ea, 0xee18, 0x12c8, 0x4476, 0x4b2e, 0x198b, 0x19a1, 0x2fcc, +0xe518, 0xbf8d, 0xbe9e, 0xcb6d, 0xe622, 0xee0e, 0x167e, 0x3fbf, 0x46fb, 0x1a7d, +0x1f4e, 0x2d08, 0xe17f, 0xbedd, 0xbaa3, 0xcc16, 0xe196, 0xeedc, 0x21cc, 0x44ed, +0x4348, 0x1a18, 0x2363, 0x242e, 0xdc65, 0xbd61, 0xb300, 0xcfa0, 0xe712, 0xe5c7, +0x169f, 0x5f17, 0x7299, 0x2bb1, 0x0b65, 0xe2fd, 0x9b1c, 0xa3b5, 0xaeb5, 0xe147, +0x3787, 0x593a, 0x5290, 0x4a3c, 0x2e69, 0xcbb4, 0xa91f, 0xc5a3, 0xbd85, 0xd07b, +0x1055, 0x3d01, 0x2411, 0x222c, 0x2b1a, 0x0b05, 0xffdc, 0xe3f2, 0xcf8c, 0xf390, +0x15ad, 0xd9f5, 0xc944, 0x2d37, 0x09de, 0xc93f, 0x0d00, 0x229d, 0x0eb5, 0x31fb, +0x193d, 0xdefd, 0x0b6e, 0xe2b8, 0x80c1, 0xd2cb, 0x1719, 0xe9c2, 0x3008, 0x6a8a, +0xfee8, 0x01bc, 0x299a, 0xb39d, 0xa48f, 0x0798, 0xe5e9, 0xddfa, 0x41e1, 0x17dc, +0xf43b, 0x3829, 0x05c3, 0xbd89, 0xf1bc, 0x0dab, 0xcd37, 0xfad8, 0x2e14, 0xf080, +0x107b, 0x24ea, 0xd852, 0xd4a0, 0x17fd, 0xfd24, 0xd818, 0x2b57, 0x168d, 0xdb81, +0x1759, 0x0cdb, 0xc867, 0xf2e6, 0x257d, 0xe349, 0xfff1, 0x39a1, 0xe33d, 0xee45, +0x2b9d, 0xe388, 0xc702, 0x21a8, 0x103e, 0xda0f, 0x2f4b, 0x1b70, 0xd6c1, 0x1b55, +0x104d, 0xb577, 0xe811, 0x28c6, 0xe0aa, 0xfee3, 0x4403, 0xf56f, 0xf711, 0x2c32, +0xe60a, 0xbd96, 0x0d61, 0x048f, 0xce3d, 0x272f, 0x325d, 0xf1c7, 0x2094, 0x1ff0, +0xc860, 0xe30a, 0x2515, 0xdac5, 0xe92d, 0x441f, 0x0548, 0xfb76, 0x3d79, 0xfd5c, +0xbecb, 0x1149, 0x13f9, 0xd214, 0x2a6f, 0x3388, 0xe6f8, 0x2190, 0x2948, 0xc4a5, +0xdd42, 0x2f43, 0xe6af, 0xf03f, 0x54db, 0x13d9, 0xfca6, 0x3215, 0xf506, 0xc57a, +0x12c0, 0x0f9f, 0xd3cc, 0x322e, 0x4301, 0xf273, 0x23ab, 0x356e, 0xd3b2, 0xd051, +0x21b7, 0xf281, 0xecda, 0x4489, 0x12f0, 0x0242, 0x4407, 0x06d1, 0xbafe, 0x0b6c, +0x1d26, 0xc6ee, 0x19bc, 0x44e9, 0xe86d, 0x13b7, 0x39ca, 0xd446, 0xd119, 0x2941, +0xee93, 0xe7c5, 0x4bc2, 0x0643, 0xe908, 0x4535, 0x0444, 0xaaed, 0x0a10, 0x21a1, +0xc807, 0x1964, 0x41d6, 0xe77b, 0x16b3, 0x34e4, 0xc869, 0xc8dc, 0x2196, 0xe4ba, +0xdb97, 0x4973, 0x106a, 0xe7d9, 0x3cc5, 0x0a39, 0xa769, 0xf083, 0x1925, 0xc4c2, +0x075d, 0x3c4a, 0xe3ca, 0x0d28, 0x38d3, 0xc8d1, 0xbd34, 0x29a4, 0xea91, 0xbfc6, +0x3ad0, 0x0fbe, 0xd348, 0x3125, 0x0f03, 0xa6a3, 0xf4e3, 0x222b, 0xbe73, 0x00e2, +0x3cfa, 0xd671, 0xff6d, 0x3893, 0xc753, 0xb6c9, 0x236e, 0xec95, 0xc571, 0x3925, +0x1324, 0xdbd6, 0x2c09, 0x07a8, 0xaa2d, 0xf242, 0x1fa6, 0xc716, 0x042c, 0x441c, +0xe490, 0xffd3, 0x3dc4, 0xdc2a, 0xb9f6, 0x1f30, 0xfbb0, 0xca2e, 0x371c, 0x2003, +0xddf1, 0x31fa, 0x2307, 0xb4d8, 0xf004, 0x2cbc, 0xc878, 0xf7c6, 0x4caf, 0xed6b, +0xfe78, 0x48e2, 0xe5f3, 0xb861, 0x209c, 0xffdd, 0xc990, 0x3a8f, 0x2235, 0xd8df, +0x3307, 0x26fb, 0xb85c, 0xf04e, 0x2cb8, 0xd049, 0xfa7c, 0x49ae, 0xedac, 0xfa25, +0x3f7d, 0xe587, 0xbae6, 0x1de2, 0x03f4, 0xc964, 0x35b0, 0x2bf3, 0xdcc1, 0x287a, +0x2509, 0xb53e, 0xdd34, 0x21f5, 0xd014, 0xf4e6, 0x5327, 0xfbed, 0xf63d, 0x422a, +0xebde, 0xadff, 0x109b, 0x03c0, 0xc66e, 0x34a1, 0x371f, 0xe1e5, 0x266b, 0x298a, +0xb6ec, 0xdb6e, 0x2815, 0xd421, 0xf019, 0x5352, 0xff26, 0xf3f2, 0x43a2, 0xf389, +0xb155, 0x11bc, 0x093e, 0xc3cf, 0x2cd7, 0x37d3, 0xe04d, 0x22e3, 0x2ecd, 0xb8a8, +0xd4f6, 0x2b5c, 0xd879, 0xe9c1, 0x5345, 0x0074, 0xeb1b, 0x3d0d, 0xf0a8, 0xa78e, +0x0f83, 0x1369, 0xc523, 0x2e80, 0x3d4c, 0xdb13, 0x1e41, 0x2ecc, 0xb34d, 0xd013, +0x2f65, 0xd81e, 0xe458, 0x57d2, 0x0406, 0xebe0, 0x457a, 0xf7e1, 0xa66e, 0x0b6f, +0x0e7a, 0xb8d1, 0x251b, 0x3fe1, 0xdd7d, 0x20b9, 0x3687, 0xbb17, 0xd0b9, 0x2e06, +0xd6de, 0xd8c9, 0x50ce, 0x0665, 0xe605, 0x3fce, 0xfc63, 0xac6f, 0x0f4a, 0x249e, +0xcfcc, 0xfc68, 0x0488, 0xeb03, 0x4794, 0x43ec, 0xda83, 0xf3bd, 0x2644, 0xc019, +0xac19, 0xfdb7, 0xdae0, 0xebc8, 0x4a7e, 0x4842, 0x204b, 0x2f4a, 0x0bd7, 0xb466, +0xc7b6, 0xc25a, 0x9ff5, 0xfeaa, 0x3147, 0xf5d6, 0x1606, 0x7098, 0x2536, 0xcb1f, +0xef7c, 0xd8bb, 0xa610, 0xc6a6, 0xf94d, 0x01cf, 0x2326, 0x2e92, 0xfa36, 0x1b23, +0x1fee, 0xc9e0, 0xbf64, 0xf0f7, 0xebf9, 0xcd60, 0xfed7, 0x1727, 0x0a34, 0x1723, +0x0a36, 0x0e7b, 0x18aa, 0xfc64, 0xb854, 0xc985, 0xfdd8, 0xc68b, 0xea58, 0x3e80, +0x2a34, 0x0ba2, 0x2d28, 0x367f, 0xec1b, 0xe1de, 0xce20, 0xb654, 0xf084, 0xed7d, +0xf556, 0x44c2, 0x5de8, 0x118c, 0x103a, 0x43c2, 0xea97, 0xbbb3, 0xd781, 0xd5a7, +0xe105, 0xfd04, 0x1bc6, 0x2dbd, 0x4a4e, 0x2262, 0x090c, 0x37f3, 0x0697, 0xc337, +0xc445, 0xe70d, 0xe217, 0xdb53, 0x1953, 0x38c9, 0x40c1, 0x2ede, 0x22c3, 0x260c, +0xfc8c, 0xcfd4, 0xb0e1, 0xd39e, 0xe34c, 0xdae1, 0x253f, 0x508f, 0x342f, 0x1aa5, +0x3628, 0x1e6e, 0xd753, 0xc9cd, 0xb7c4, 0xd23c, 0xef41, 0xeb30, 0x1cc2, 0x523c, +0x3c38, 0x02b5, 0x29f9, 0x28a2, 0xd759, 0xd1f8, 0xd1bf, 0xd245, 0xe508, 0xfe91, +0x19fc, 0x3b30, 0x3d9b, 0x0a4c, 0x2fd0, 0x37f4, 0xdc8c, 0xbe49, 0xd7b4, 0xe591, +0xd3af, 0xfd0f, 0x3070, 0x36f1, 0x325e, 0x18a4, 0x3386, 0x27ca, 0xdc73, 0xb513, +0xcdc8, 0xf809, 0xd5d9, 0xf013, 0x4334, 0x4964, 0x2395, 0x1b7b, 0x3c5a, 0x0fe4, +0xd7a3, 0xc6c6, 0xc6b6, 0xf0cf, 0xeb7d, 0xf80b, 0x3914, 0x525a, 0x2445, 0x1417, +0x4928, 0x0ff5, 0xc35d, 0xc78a, 0xd244, 0xdff9, 0xe35e, 0x07df, 0x35ae, 0x4ba7, +0x2974, 0x1106, 0x3cf3, 0x0fec, 0xc4b4, 0xb9c7, 0xd562, 0xe489, 0xd970, 0x0e52, +0x3f61, 0x43d6, 0x27aa, 0x2131, 0x364b, 0xfd16, 0xc955, 0xb961, 0xcde0, 0xe8ce, +0xe024, 0x0e4f, 0x4544, 0x4582, 0x18cd, 0x22be, 0x3a77, 0xf22e, 0xc4f3, 0xbabf, +0xcce0, 0xe32e, 0xe352, 0x12f7, 0x43a1, 0x4666, 0x1401, 0x1c0c, 0x30e6, 0xe619, +0xbb56, 0xbb95, 0xd491, 0xe00b, 0xe61a, 0x17a4, 0x3b47, 0x3b00, 0x10e7, 0x1c7e, +0x2707, 0xe361, 0xb750, 0xb2d2, 0xd7be, 0xdb41, 0xe145, 0x2096, 0x40ed, 0x319a, +0x118b, 0x2924, 0x1a2e, 0xd6af, 0xba5f, 0xad6c, 0xd2c9, 0xe064, 0xe67c, 0x25df, +0x4ea4, 0x3357, 0x0fc7, 0x312c, 0x1020, 0xc418, 0xb5ff, 0xb68a, 0xd4f7, 0xe2ef, +0xfb14, 0x2e11, 0x4c3e, 0x3280, 0x08fc, 0x2966, 0x0e36, 0xc69d, 0xb3ba, 0xbf26, +0xde72, 0xe461, 0x0918, 0x3887, 0x4967, 0x313c, 0x1236, 0x2763, 0x0526, 0xcb44, +0xb35a, 0xc8b5, 0xed8f, 0xdf83, 0x05bf, 0x41b2, 0x4548, 0x20ab, 0x1a30, 0x2bd9, +0xf884, 0xce0f, 0xb377, 0xc10c, 0xede8, 0xe5b7, 0x0520, 0x42f2, 0x4b64, 0x19c0, +0x1a50, 0x2fd7, 0xee52, 0xc8d4, 0xbcea, 0xc661, 0xe5d5, 0xe9b8, 0x0e4b, 0x42da, +0x4c23, 0x187a, 0x1ba9, 0x2fdd, 0xe89e, 0xbcad, 0xb84a, 0xd201, 0xe619, 0xeba8, +0x1a61, 0x40ef, 0x41b7, 0x151a, 0x1cbf, 0x2b05, 0xea44, 0xc1f8, 0xbc6c, 0xdb3c, +0xe422, 0xe69f, 0x208e, 0x4881, 0x3cc7, 0x1503, 0x2aa9, 0x27ed, 0xe431, 0xc5cc, +0xbdfa, 0xdd9a, 0xe8e9, 0xf074, 0x2496, 0x4a59, 0x3e74, 0x1374, 0x2e8f, 0x252c, +0xd82c, 0xba66, 0xbeda, 0xe1cc, 0xe3a5, 0xf456, 0x3043, 0x4df4, 0x382a, 0x0d8b, +0x25d9, 0x1516, 0xd249, 0xb805, 0xbbdd, 0xe317, 0xe31f, 0xf717, 0x307f, 0x4438, +0x2ce7, 0x1089, 0x29b8, 0x060d, 0xc757, 0xb6c7, 0xb848, 0xdd4c, 0xde36, 0xf60e, +0x341a, 0x45f6, 0x1fc8, 0x0b03, 0x2ed5, 0xff75, 0xc14a, 0xb3bb, 0xb4dc, 0xd6d2, +0xdc36, 0xfbb0, 0x356c, 0x49c3, 0x2300, 0x0fe9, 0x2f18, 0xf499, 0xb802, 0xb1b2, +0xc06f, 0xdc85, 0xde22, 0x0805, 0x3cc1, 0x488e, 0x1f2e, 0x11d7, 0x2c64, 0xf3b1, +0xbd78, 0xadbb, 0xc5eb, 0xe451, 0xde57, 0x0e82, 0x4140, 0x4137, 0x1916, 0x1b84, +0x28d4, 0xe639, 0xc1a0, 0xb2e7, 0xc697, 0xe4be, 0xdf87, 0x10dc, 0x49b4, 0x457d, +0x1479, 0x2405, 0x2b0f, 0xdcbe, 0xbefc, 0xb3a9, 0xc6dd, 0xe60b, 0xed45, 0x1b13, +0x497b, 0x4531, 0x1324, 0x24b0, 0x243c, 0xd210, 0xb83d, 0xb984, 0xd0bc, 0xe2a6, +0xf3b7, 0x2766, 0x4a82, 0x4204, 0x133f, 0x22b4, 0x1b4e, 0xd4a3, 0xba37, 0xbaaf, +0xdf26, 0xea12, 0xf84b, 0x3177, 0x4e17, 0x39af, 0x193b, 0x308a, 0x13c1, 0xd6b0, +0xc5d3, 0xbffc, 0xe599, 0xeec6, 0xff4d, 0x38ac, 0x5167, 0x346a, 0x1b9d, 0x376a, +0x0ce4, 0xd4a8, 0xc78f, 0xc195, 0xe4f4, 0xf0f5, 0x07bb, 0x3cdc, 0x5981, 0x3510, +0x1b26, 0x3a31, 0x03fb, 0xca72, 0xc53e, 0xcd25, 0xecab, 0xf768, 0x193e, 0x437d, +0x53af, 0x2c6f, 0x15b8, 0x31bf, 0xff10, 0xcc99, 0xc147, 0xd348, 0xee05, 0xee95, +0x1782, 0x2f2b, 0x4b20, 0x5a80, 0x2b14, 0xfd25, 0xdd6a, 0xccb5, 0x9c77, 0xbb91, +0x0abb, 0xfa6d, 0x308d, 0x8b3b, 0x6386, 0x0f1b, 0x0366, 0xd9a6, 0x969a, 0xbb36, +0xbe42, 0xd650, 0x4a43, 0x5e11, 0x39f6, 0x4e5f, 0x3f3f, 0xd1f7, 0xbac7, 0xda01, +0xb75e, 0xdb85, 0x0689, 0x0f50, 0x402d, 0x3a48, 0xf492, 0xf3ba, 0x232e, 0xe3c2, +0xc221, 0x1c7e, 0x103b, 0xda32, 0x0d99, 0x12a9, 0xc374, 0xe4a9, 0x2fee, 0xef59, +0xf571, 0x4551, 0x09ce, 0xee4d, 0x190c, 0xdd87, 0xa5eb, 0xf5c9, 0x0d02, 0xd8dd, +0x32e0, 0x4556, 0xf27b, 0x272d, 0x1a0f, 0xac2d, 0xc929, 0x0d48, 0xd065, 0xe73f, +0x4fb6, 0x0a4b, 0xfcc1, 0x4512, 0xed54, 0xb2b9, 0x0350, 0xfc0b, 0xbed7, 0x1926, +0x2f0c, 0xe1a6, 0x2871, 0x338a, 0xc365, 0xd8fc, 0x2261, 0xe12a, 0xda5e, 0x3836, +0x02a6, 0xeb2d, 0x3c29, 0xfc95, 0xb47f, 0x126c, 0x2240, 0xc4df, 0x1301, 0x42d9, +0xddbd, 0x05c8, 0x2ff4, 0xc609, 0xc9ef, 0x2ebd, 0xf193, 0xda07, 0x46da, 0x0cd3, +0xe052, 0x39eb, 0x0085, 0xa3df, 0xfdbd, 0x1d67, 0xc36d, 0x1321, 0x461a, 0xe3db, +0x121d, 0x3bc5, 0xce7e, 0xc611, 0x1e92, 0xe869, 0xd146, 0x3d6e, 0x12f6, 0xe781, +0x3a2e, 0x100e, 0xb4c0, 0xf87f, 0x2451, 0xce12, 0xfd54, 0x3b61, 0xe9af, 0x0485, +0x363a, 0xd7a5, 0xc531, 0x26b6, 0xfb26, 0xd3af, 0x4024, 0x13d3, 0xcf38, 0x31ca, +0x1fe6, 0xacba, 0xe830, 0x28d0, 0xd67b, 0x03f4, 0x4390, 0xeff5, 0x0d9b, 0x3cdc, +0xd2ef, 0xbce5, 0x1df5, 0xf194, 0xcc0a, 0x3c7b, 0x22be, 0xe9d0, 0x37e4, 0x1f21, +0xbf6a, 0xed14, 0x13f9, 0xccad, 0xfeed, 0x36f2, 0xe931, 0x0bd9, 0x4870, 0xe9a7, +0xc649, 0x2406, 0x009e, 0xc7de, 0x28c6, 0x1d14, 0xe19d, 0x2d2e, 0x24eb, 0xc1ae, +0xf293, 0x2948, 0xd034, 0xfc36, 0x4c80, 0xed33, 0xf76a, 0x4574, 0xe546, 0xb51f, +0x205e, 0x01e4, 0xc8f6, 0x3c9b, 0x2dfd, 0xe000, 0x3231, 0x23e4, 0xac3f, 0xe1e2, +0x2470, 0xc806, 0xf279, 0x51f9, 0xfc93, 0xfd3d, 0x471f, 0xf14b, 0xb564, 0x0d8d, +0xf7a1, 0xbaf7, 0x2ae2, 0x3330, 0xe3cf, 0x2876, 0x2f9d, 0xbe99, 0xd8ed, 0x2066, +0xcc5b, 0xe037, 0x444b, 0xfc55, 0xf1ae, 0x3dee, 0xedb1, 0xa9f3, 0x0f58, 0x052a, +0xb88b, 0x286b, 0x32e9, 0xd191, 0x1a2d, 0x2b19, 0xb1ba, 0xd055, 0x2574, 0xcd9d, +0xe17a, 0x4f5d, 0xf991, 0xe9c8, 0x4424, 0xee22, 0xa03f, 0x0b3e, 0x0833, 0xb2f6, +0x25d7, 0x3fb5, 0xd971, 0x1eca, 0x3552, 0xb55f, 0xc5ed, 0x2341, 0xd2b5, 0xd7c1, +0x523e, 0x069d, 0xe63d, 0x453d, 0xfaec, 0xa137, 0x0414, 0x12c4, 0xb981, 0x1bb8, +0x4054, 0xdb21, 0x1feb, 0x3f6a, 0xbc6b, 0xcb19, 0x2eaa, 0xdddc, 0xd782, 0x53f0, +0x0db9, 0xe5f5, 0x4ae5, 0x09f1, 0xaaaa, 0x08ea, 0x1b96, 0xc280, 0x22c4, 0x4ce0, +0xe24f, 0x1cfe, 0x4491, 0xc23a, 0xc424, 0x2faf, 0xe9a8, 0xd606, 0x50b8, 0x16c3, +0xe5a3, 0x41e4, 0x0b1a, 0xa940, 0xfef6, 0x1bdf, 0xbfb1, 0x1607, 0x4e4e, 0xe252, +0x116e, 0x44af, 0xc71f, 0xbeed, 0x2c56, 0xed57, 0xd13f, 0x46da, 0x1220, 0xdf44, +0x3fcf, 0x0e72, 0xa687, 0xfe99, 0x22c2, 0xc0f4, 0x10f5, 0x4ab0, 0xdcc9, 0x0862, +0x42d3, 0xcce8, 0xbf2b, 0x2c4a, 0xf130, 0xcf23, 0x47a0, 0x1557, 0xd894, 0x3b17, +0x15eb, 0xac91, 0xfc3e, 0x2839, 0xc889, 0x0a6b, 0x4a0a, 0xe524, 0x0571, 0x40a3, +0xd642, 0xc2d3, 0x2b1c, 0xfa19, 0xd4f9, 0x465b, 0x1ef6, 0xe106, 0x371e, 0x15ec, +0xb185, 0xfc2f, 0x2898, 0xcc97, 0x0b55, 0x4c1f, 0xebc4, 0x08bc, 0x3f08, 0xd705, +0xc599, 0x2bb5, 0x081d, 0xcd96, 0x0d3b, 0x0ffa, 0x0823, 0x3f09, 0x1a45, 0xdad9, +0x0662, 0x07b7, 0xbb6a, 0xde9a, 0x0740, 0xda46, 0x0e1e, 0x6549, 0x38b1, 0x04bd, +0x2510, 0xf943, 0xad98, 0xc9a0, 0xca5c, 0xcaba, 0x22c9, 0x2b10, 0x01f0, 0x511a, +0x637c, 0xe409, 0xcfea, 0xff1b, 0xbae4, 0x9b34, 0xfafc, 0x154f, 0xfdb5, 0x2da1, +0x2e82, 0x1b20, 0x2472, 0xf46c, 0xbc6b, 0xd8c3, 0xf895, 0xcd65, 0xe4ee, 0x20c1, +0x1821, 0x08d6, 0x178c, 0x2a03, 0x07e8, 0xfe05, 0xe136, 0xbccf, 0xeb99, 0xdae7, +0xd3aa, 0x1d70, 0x3e94, 0x094b, 0x0900, 0x5434, 0x0901, 0xc4b1, 0xdc6e, 0xc832, +0xca7f, 0xe370, 0xfc55, 0x19fb, 0x5037, 0x3174, 0xfe1c, 0x3bdc, 0x1079, 0xb5a5, +0xbd97, 0xde91, 0xd7dc, 0xd8e9, 0x1ed3, 0x2fd7, 0x3373, 0x2e1c, 0x130d, 0x2861, +0x0ada, 0xcec0, 0xaf81, 0xd3f1, 0xe991, 0xcbf7, 0x0636, 0x408c, 0x3d14, 0x22da, +0x2e7f, 0x334f, 0xf091, 0xd23f, 0xb6f6, 0xbe39, 0xe0ea, 0xdac6, 0x0ab7, 0x52de, +0x5241, 0x1a28, 0x36a7, 0x3ee4, 0xdc10, 0xbfb1, 0xc06c, 0xc69f, 0xdf82, 0xf62e, +0x1f54, 0x4e25, 0x578d, 0x17a6, 0x26c4, 0x37fc, 0xe05d, 0xc099, 0xcd8c, 0xd886, +0xd8c3, 0xfcba, 0x2d83, 0x3fa6, 0x48bb, 0x1e77, 0x2a31, 0x31eb, 0xe98e, 0xbcf5, +0xc196, 0xe4e4, 0xdb34, 0xf4b5, 0x398d, 0x47e8, 0x3526, 0x2168, 0x3d9a, 0x20eb, +0xddcb, 0xbe09, 0xb85c, 0xe775, 0xe3f6, 0xedd1, 0x3731, 0x576a, 0x2d99, 0x1229, +0x4011, 0x0fb4, 0xc58a, 0xc2e0, 0xc163, 0xd8b3, 0xe485, 0xfbc4, 0x28a2, 0x4aba, +0x2b57, 0x06a4, 0x385f, 0x150e, 0xc2cd, 0xb65c, 0xcd33, 0xde60, 0xd4fe, 0x0096, +0x3507, 0x45bc, 0x2781, 0x142c, 0x33ba, 0x049c, 0xc775, 0xb39c, 0xc6ec, 0xe39b, +0xd75b, 0x0203, 0x3c34, 0x4589, 0x1c2f, 0x171d, 0x336b, 0xeff6, 0xbf31, 0xb8c6, +0xc21c, 0xde19, 0xe412, 0x0b3a, 0x399a, 0x4631, 0x1799, 0x116c, 0x3085, 0xeefe, +0xbcec, 0xb922, 0xcdc6, 0xe051, 0xe2d7, 0x10d0, 0x38e1, 0x3dfb, 0x1356, 0x1516, +0x2876, 0xe6f8, 0xbb6a, 0xb636, 0xd128, 0xdda0, 0xdf16, 0x11df, 0x387e, 0x338c, +0x0c5c, 0x211c, 0x2422, 0xdca8, 0xbf10, 0xb435, 0xcd32, 0xde18, 0xe25f, 0x144e, +0x3fe0, 0x3472, 0x0753, 0x2b41, 0x27e8, 0xd555, 0xc117, 0xbddb, 0xcb8c, 0xdaa8, +0xee16, 0x185e, 0x406a, 0x394d, 0x0e4c, 0x3224, 0x2283, 0xcee6, 0xb78f, 0xbe46, +0xd600, 0xd73a, 0xf882, 0x2db5, 0x4253, 0x3500, 0x1558, 0x2eee, 0x13ba, 0xd1b3, +0xb80a, 0xbd32, 0xe28d, 0xdf23, 0xfd44, 0x3980, 0x4ace, 0x2d3f, 0x18f4, 0x34ae, +0x039f, 0xcc97, 0xbb5e, 0xbe2a, 0xe6fa, 0xe555, 0x023b, 0x3de8, 0x4db4, 0x2192, +0x1578, 0x3a68, 0xfe29, 0xc84a, 0xbd0b, 0xc1ef, 0xe3a9, 0xe936, 0x0a3b, 0x3ab4, +0x505a, 0x260d, 0x1903, 0x39c0, 0xf9ac, 0xc53b, 0xbc41, 0xcc45, 0xe5fc, 0xe843, +0x15b8, 0x436d, 0x4dae, 0x24c5, 0x212b, 0x33f2, 0xf1b2, 0xc3a3, 0xb509, 0xcd57, +0xe8db, 0xeb7c, 0x1d1e, 0x4aef, 0x4a01, 0x1af5, 0x24c7, 0x2df1, 0xe4a5, 0xc1ae, +0xb8ad, 0xd2c8, 0xe887, 0xee7b, 0x21d0, 0x4d5f, 0x4806, 0x171f, 0x2854, 0x27e5, +0xdd26, 0xc075, 0xb9c1, 0xd6dc, 0xe94e, 0xf760, 0x2a99, 0x4d0c, 0x4405, 0x1751, +0x2a63, 0x1e7d, 0xd670, 0xba60, 0xb674, 0xde00, 0xe8fc, 0xf57e, 0x3121, 0x51b2, +0x3a66, 0x11d4, 0x29d9, 0x107f, 0xd01f, 0xbbd1, 0xb864, 0xe08f, 0xea2a, 0xfafd, +0x34de, 0x5038, 0x3061, 0x1294, 0x3316, 0x07d3, 0xc6ab, 0xbd82, 0xc0f2, 0xe421, +0xebe4, 0x0398, 0x39c6, 0x54a2, 0x2e8b, 0x0e55, 0x3308, 0x0648, 0xc5ad, 0xbd8e, +0xc53c, 0xdfb2, 0xe8b4, 0x0f4a, 0x3d14, 0x4caa, 0x2bf1, 0x15bf, 0x2e89, 0xf945, +0xc136, 0xb890, 0xcaeb, 0xe950, 0xe7bf, 0x115d, 0x451b, 0x4aa1, 0x20cd, 0x1684, +0x2a91, 0xf0a3, 0xc5b7, 0xb815, 0xc9bf, 0xee16, 0xea12, 0x117d, 0x470b, 0x42c7, +0x113f, 0x1b7c, 0x2b91, 0xe191, 0xc212, 0xbd24, 0xc84b, 0xe419, 0xe8c1, 0x104f, +0x440c, 0x4662, 0x1122, 0x20a6, 0x2d8e, 0xda8b, 0xbcf3, 0xc089, 0xcbf5, 0xde1c, +0xf3c0, 0x2135, 0x414e, 0x3fd9, 0x15e1, 0x26f5, 0x292e, 0xdc7e, 0xb937, 0xb924, +0xd769, 0xe06d, 0xee92, 0x2aa0, 0x48ae, 0x379d, 0x15e3, 0x2afa, 0x167d, 0xd370, +0xbfeb, 0xb8aa, 0xd8da, 0xe695, 0xf331, 0x2abe, 0x4918, 0x2e1c, 0x0f19, 0x32cf, +0x0f46, 0xc822, 0xbf6b, 0xbca2, 0xdadc, 0xe628, 0xf835, 0x2cf1, 0x4b03, 0x2c10, +0x0df9, 0x358e, 0x0a2c, 0xc678, 0xc06b, 0xc05f, 0xd849, 0xe170, 0x02e1, 0x3324, +0x4bd0, 0x2fc8, 0x13c8, 0x3314, 0x0029, 0xbf2e, 0xb455, 0xc1d3, 0xe027, 0xe480, +0x0a7f, 0x2c7a, 0x5506, 0x634d, 0x2129, 0xfadf, 0xe1b5, 0xb620, 0x8bd2, 0xbfae, +0x0a2a, 0x0d5d, 0x5240, 0x8109, 0x4e83, 0x15cf, 0xf367, 0xba2c, 0x9d5f, 0xcd2e, +0xbdc8, 0xf85d, 0x6f35, 0x4484, 0x29e8, 0x54f0, 0x2a04, 0xcc06, 0xd6d5, 0xe253, +0xc387, 0x09da, 0xff4a, 0xebc6, 0x4eb3, 0x2edb, 0xcfcc, 0x0b9a, 0x3d1b, 0xdc1f, +0xf4a1, 0x3fae, 0xeb9b, 0xe915, 0x13be, 0xcb86, 0xb940, 0x1643, 0x18ee, 0xf7d9, +0x4acf, 0x30df, 0xe6dc, 0x16fe, 0xf4d5, 0x9c55, 0xcc79, 0x10aa, 0xe384, 0x0496, +0x4c2c, 0x0504, 0xff4c, 0x2d7e, 0xd93d, 0xacb4, 0x00e4, 0xf5af, 0xc18e, 0x2289, +0x2a64, 0xe0a9, 0x2089, 0x21b8, 0xbaf3, 0xdd89, 0x1ea4, 0xd2e4, 0xe648, 0x37ea, +0xec35, 0xe993, 0x35d6, 0xed2e, 0xbadd, 0x15b4, 0x0a9d, 0xc841, 0x1a7c, 0x191c, +0xcaef, 0x0f4e, 0x1fff, 0xbfae, 0xe155, 0x3460, 0xeb55, 0xe0b6, 0x3048, 0xf2f2, +0xddca, 0x235a, 0xee7f, 0xb7cc, 0x15dd, 0x2097, 0xce52, 0x180f, 0x2dcf, 0xd499, +0x0857, 0x29b8, 0xc4c2, 0xd000, 0x28ff, 0xe652, 0xde94, 0x43c5, 0x05e6, 0xe425, +0x356a, 0xfee7, 0xb2c1, 0x0914, 0x1584, 0xbe7b, 0x0e5a, 0x368a, 0xe276, 0x1274, +0x3391, 0xd008, 0xd357, 0x26c2, 0xec06, 0xdd61, 0x39e2, 0x0868, 0xe6f9, 0x3207, +0x091c, 0xbc0e, 0x0582, 0x1f6d, 0xd133, 0x1cab, 0x4d57, 0xeb81, 0x02e3, 0x3712, +0xde41, 0xc71f, 0x212b, 0xfb67, 0xe7a1, 0x504a, 0x23ac, 0xedd8, 0x3eb6, 0x157e, +0xad36, 0xfc30, 0x2995, 0xcb86, 0x10c5, 0x529b, 0xf7a7, 0x15fe, 0x4546, 0xdc21, +0xcaba, 0x26eb, 0xe984, 0xd493, 0x4c8e, 0x16e6, 0xe56c, 0x463b, 0x1cf9, 0xb4a9, +0xfd71, 0x24ab, 0xc8a4, 0x09c8, 0x41c1, 0xe4ff, 0x0a9c, 0x3d28, 0xd226, 0xc16f, +0x2d0a, 0xf732, 0xcb2f, 0x42b2, 0x1d8f, 0xd5f3, 0x2c26, 0x1649, 0xa7c7, 0xed21, +0x286f, 0xc688, 0x04e2, 0x51dd, 0xe73b, 0x0013, 0x46f0, 0xd1e8, 0xab29, 0x260f, +0xf7aa, 0xbdee, 0x402d, 0x25c0, 0xda8b, 0x3989, 0x21df, 0xa95c, 0xf0ed, 0x290b, +0xbd3d, 0xfb44, 0x4eba, 0xe63a, 0xfecd, 0x4a1d, 0xe177, 0xbc6f, 0x2af3, 0xfdf2, +0xc4cf, 0x3b3d, 0x1ebb, 0xd4a0, 0x319d, 0x221e, 0xaf94, 0xf1b0, 0x3313, 0xcaf9, +0xf7f2, 0x4fd1, 0xeb5b, 0xf54e, 0x3faa, 0xd925, 0xb016, 0x2624, 0x012e, 0xc2f3, +0x3e16, 0x255d, 0xce61, 0x2b67, 0x1e8d, 0xa020, 0xe075, 0x2e2f, 0xc930, 0xf3f3, +0x4f96, 0xe6da, 0xef8a, 0x43fb, 0xdd85, 0xab7b, 0x2022, 0xfe5f, 0xba39, 0x346d, +0x27b4, 0xd20a, 0x2bfd, 0x2882, 0xae6f, 0xe3d3, 0x2b38, 0xc9c6, 0xef8e, 0x49d8, +0xeade, 0xf2c2, 0x46de, 0xe8ca, 0xb2fe, 0x208e, 0x0855, 0xc5c4, 0x338e, 0x29eb, +0xd645, 0x257e, 0x260c, 0xb7e2, 0xebef, 0x3365, 0xd6d8, 0xf811, 0x518d, 0xf457, +0xf134, 0x4558, 0xf41a, 0xb66e, 0x1a28, 0x0bd1, 0xcaa3, 0x31f9, 0x3045, 0xe17a, +0x2ad4, 0x2f2d, 0xbd2b, 0xe13e, 0x2cfe, 0xd3bd, 0xea52, 0x4fb4, 0x020e, 0xf40a, +0x4278, 0xf8f7, 0xb45e, 0x127c, 0x0af1, 0xc2d1, 0x2b03, 0x36f1, 0xdd10, 0x20d2, +0x35ec, 0xc074, 0xd7bd, 0x2eef, 0xd9db, 0xe543, 0x52c9, 0x05cf, 0xec53, 0x41bb, +0xfa65, 0xaf2a, 0x15c6, 0x1274, 0xbe0e, 0x2c97, 0x448e, 0xdd59, 0x1c74, 0x3817, +0xbb2b, 0xcf5b, 0x2f9a, 0xdc0c, 0xe4f0, 0x586d, 0x096c, 0xe913, 0x42c2, 0xf921, +0xa4d2, 0x0f94, 0x157d, 0xbee7, 0x2a97, 0x46c2, 0xe0bf, 0x1d38, 0x3786, 0xb9af, +0xcb2a, 0x2dd9, 0xd952, 0xdcbe, 0x5596, 0x0bab, 0xea4b, 0x4531, 0xffe2, 0xa78b, +0x0c61, 0x136f, 0xb532, 0x2148, 0x44ae, 0xd96e, 0x195c, 0x392c, 0xb898, 0xc8e9, +0x3388, 0xef92, 0xcd85, 0x0ef6, 0xf796, 0x13e1, 0x506a, 0x028d, 0xcd42, 0x14f5, +0xf58e, 0x9d81, 0xe29f, 0xfb3c, 0xcd66, 0x1bbf, 0x6302, 0x30d7, 0x14e4, 0x29bc, +0xdf14, 0xae5e, 0xce80, 0xabdc, 0xca7e, 0x3503, 0x1ee4, 0xf688, 0x5aac, 0x62a7, +0xd87d, 0xd4d5, 0xfc76, 0xb6dd, 0xa5b5, 0xf6e7, 0x0b99, 0x0665, 0x381b, 0x1f19, +0x1206, 0x2ed5, 0xebdd, 0xb56d, 0xde2e, 0xf87e, 0xce4d, 0xed47, 0x2439, 0x121c, +0x1266, 0x1483, 0x16c8, 0x10fd, 0x0650, 0xd754, 0xbaff, 0xf7e2, 0xda39, 0xcd45, +0x2986, 0x40dc, 0x0e53, 0x182a, 0x50a1, 0x01de, 0xcb6e, 0xdc62, 0xb781, 0xcfc4, +0xee54, 0xf542, 0x2240, 0x5981, 0x2c5e, 0xf8e5, 0x3e3b, 0x0d29, 0xaf98, 0xc3b7, +0xd787, 0xd3b1, 0xe2e2, 0x19c0, 0x28df, 0x3943, 0x2fe3, 0x081e, 0x2922, 0x0f78, +0xc962, 0xb6cc, 0xd979, 0xe6a6, 0xd121, 0x07cf, 0x3500, 0x3ad0, 0x2c2a, 0x2624, +0x2c95, 0xfb6f, 0xd7be, 0xb61f, 0xc05e, 0xe300, 0xd931, 0x0c0c, 0x4eae, 0x4878, +0x15a7, 0x2a43, 0x31b1, 0xdd24, 0xc4ea, 0xbda7, 0xc680, 0xe6be, 0xf0c6, 0x13f8, +0x45f0, 0x4cdc, 0x09ee, 0x185b, 0x3039, 0xdd40, 0xc562, 0xd19d, 0xd51e, 0xdcc7, +0xfbf1, 0x1f9a, 0x3311, 0x4108, 0x10a0, 0x1d6d, 0x368a, 0xebc0, 0xbacd, 0xc61c, +0xe6be, 0xd8c6, 0xecc7, 0x2b4f, 0x3ad6, 0x3234, 0x16aa, 0x312b, 0x2c20, 0xe5cf, +0xbf0c, 0xc2d3, 0xef02, 0xde96, 0xe42b, 0x3264, 0x4f6e, 0x2b87, 0x1502, 0x434e, +0x2169, 0xd824, 0xcd4a, 0xcbe5, 0xe67d, 0xe8bc, 0xf5fe, 0x2bd2, 0x4fbf, 0x2b2a, +0x05aa, 0x4482, 0x2857, 0xcb20, 0xc28b, 0xdaa2, 0xe5a8, 0xd616, 0xfaa0, 0x2fc3, +0x4640, 0x2ce5, 0x0f5a, 0x3ab7, 0x1944, 0xcda3, 0xbbcb, 0xcda1, 0xe22a, 0xd491, +0x0143, 0x3873, 0x3fbe, 0x22bb, 0x1736, 0x3ae6, 0x0407, 0xc3a8, 0xb9c4, 0xc437, +0xdc67, 0xd7ba, 0x00f1, 0x3801, 0x41a0, 0x1951, 0x11c6, 0x35de, 0xf7fb, 0xbeac, +0xb811, 0xc658, 0xdc21, 0xd8e4, 0x060e, 0x39e5, 0x4146, 0x14d2, 0x16dd, 0x36f4, +0xed6d, 0xba86, 0xb9b4, 0xcb20, 0xdd7e, 0xdfe1, 0x0f15, 0x3b82, 0x3e9b, 0x1158, +0x1b8a, 0x323f, 0xe8e2, 0xbdfb, 0xb835, 0xd09f, 0xddf2, 0xdd36, 0x148a, 0x40d3, +0x3e5f, 0x13a7, 0x2794, 0x2f4a, 0xde17, 0xbd25, 0xb6e3, 0xcb99, 0xdc56, 0xe6b9, +0x1ce9, 0x4836, 0x40a4, 0x1189, 0x2c70, 0x2966, 0xd436, 0xb74c, 0xb722, 0xd074, +0xdc0f, 0xf37b, 0x2f67, 0x4c6c, 0x3aa1, 0x13df, 0x2e82, 0x1863, 0xcd4e, 0xbc3f, +0xbce0, 0xd9c4, 0xe1be, 0xfb8d, 0x359d, 0x4c01, 0x3625, 0x17b8, 0x32ce, 0x1032, +0xcc89, 0xbc30, 0xbdba, 0xe2ec, 0xe81c, 0x005e, 0x3db9, 0x512c, 0x2c97, 0x17fc, +0x380c, 0x06f5, 0xcdb1, 0xc0d4, 0xbe6b, 0xe241, 0xead9, 0x05a4, 0x3a27, 0x518a, +0x2c10, 0x187d, 0x3809, 0xfd0c, 0xc4ac, 0xbff0, 0xc939, 0xe3de, 0xe907, 0x0ded, +0x3e36, 0x4e75, 0x2456, 0x1759, 0x31b3, 0xf547, 0xc449, 0xba76, 0xcb7c, 0xe629, +0xeb17, 0x17cc, 0x43ae, 0x4970, 0x1dfb, 0x1c5c, 0x2c1b, 0xe97c, 0xc40d, 0xbedd, +0xd492, 0xe90c, 0xea14, 0x18aa, 0x44ec, 0x43bf, 0x15aa, 0x2421, 0x2f68, 0xe453, +0xc2c4, 0xbef4, 0xd4c2, 0xe5c8, 0xf22d, 0x2430, 0x475e, 0x4461, 0x187f, 0x2916, +0x2d8a, 0xe382, 0xc1ee, 0xc2fa, 0xe144, 0xe6ea, 0xf400, 0x30a7, 0x50eb, 0x4265, +0x1b39, 0x2f67, 0x2260, 0xde78, 0xc61b, 0xc3e2, 0xe4c5, 0xea6e, 0xf9b7, 0x32e4, +0x4b24, 0x330a, 0x1529, 0x377b, 0x1ad4, 0xd298, 0xc471, 0xc39e, 0xdfcf, 0xe493, +0xf83e, 0x339f, 0x5169, 0x3178, 0x0fe4, 0x3634, 0x10e7, 0xcad8, 0xc188, 0xc0cb, +0xd97a, 0xe36b, 0x01cf, 0x3255, 0x49ca, 0x2dc9, 0x1019, 0x33a3, 0x059a, 0xbd42, +0xb33f, 0xbe30, 0xd9b3, 0xdc31, 0x0338, 0x37ee, 0x44ae, 0x224f, 0x0cf2, 0x27ab, +0xf5dc, 0xbd67, 0xaf02, 0xbe02, 0xde1c, 0xd738, 0x02b2, 0x3eba, 0x4074, 0x174f, +0x1829, 0x2c82, 0xe72a, 0xbf61, 0xb6b3, 0xbe85, 0xe2b1, 0xe25f, 0x05c1, 0x4181, +0x4a2b, 0x1512, 0x1a96, 0x326a, 0xe3c7, 0xbc8c, 0xb7af, 0xbd6f, 0xd849, 0xe90a, +0x150e, 0x3ed0, 0x469e, 0x176f, 0x1b23, 0x2908, 0xdb26, 0xb2f3, 0xb1f8, 0xca6a, +0xdb06, 0xe6a5, 0x1fb9, 0x4383, 0x3e5d, 0x1596, 0x1e94, 0x1cb0, 0xd8cf, 0xba95, +0xaec4, 0xcef4, 0xe43f, 0xeaf7, 0x2443, 0x4766, 0x336a, 0x0e32, 0x27a3, 0x1356, +0xcd5d, 0xc150, 0xb6ba, 0xd1d8, 0xe528, 0xee84, 0x2426, 0x4adf, 0x3667, 0x10cd, +0x310e, 0x1388, 0xcbbb, 0xc47e, 0xbd1f, 0xd491, 0xe98e, 0x0244, 0x3289, 0x53b3, +0x3eb9, 0x1566, 0x3290, 0x11e3, 0xcc07, 0xc004, 0xc4fd, 0xe223, 0xed0a, 0x10ae, +0x3ff0, 0x5037, 0x36e6, 0x164f, 0x29a1, 0x0284, 0xcdb8, 0xbdcd, 0xc637, 0xed96, +0xeeb1, 0x0cd0, 0x4050, 0x49bb, 0x239a, 0x1780, 0x2eab, 0xf6b6, 0xce3d, 0xbc38, +0xc8a0, 0x00e6, 0xefad, 0x0021, 0x33f9, 0x3ae3, 0x3cd3, 0x3fb1, 0x1838, 0xd924, +0xd541, 0xaecf, 0xa5de, 0xf7be, 0xfc4c, 0x140b, 0x790a, 0x7937, 0x1616, 0xfecc, +0xe9f4, 0x93de, 0xa330, 0xc0f0, 0xcf7e, 0x2cbc, 0x6286, 0x4ccf, 0x462d, 0x450f, +0xe74f, 0xa99c, 0xd6b1, 0xc669, 0xba55, 0xfefe, 0x25a9, 0x3149, 0x43ec, 0x1f26, +0xede2, 0x0adf, 0xff6f, 0xbdad, 0xf121, 0x2c23, 0xf18d, 0xf0cc, 0x2718, 0xe6c1, +0xbbba, 0x1d92, 0x14c7, 0xde85, 0x3e57, 0x31f4, 0xe295, 0x0f8d, 0xf992, 0xa267, +0xd117, 0x1bec, 0xe179, 0x07c9, 0x5af9, 0x03a7, 0x02e9, 0x3014, 0xd04d, 0xa794, +0xfb7e, 0xf282, 0xc715, 0x36b9, 0x3764, 0xea25, 0x307a, 0x1cb0, 0xb2ec, 0xd406, +0x117c, 0xd2a9, 0xea54, 0x43e9, 0xfc21, 0xfaa3, 0x3fc1, 0xeafd, 0xb060, 0x0b4c, +0x0ff9, 0xc461, 0x1954, 0x3040, 0xd984, 0x1601, 0x2825, 0xbc3f, 0xdbce, 0x3875, +0xe248, 0xdd2e, 0x4e02, 0xfd2c, 0xd91c, 0x3749, 0xf658, 0xaa69, 0x13e1, 0x2498, +0xcc14, 0x21ba, 0x3a26, 0xdb15, 0x1623, 0x2c3d, 0xba40, 0xcd2e, 0x2cf5, 0xe4ae, +0xe186, 0x52e0, 0x0d31, 0xe5cf, 0x3778, 0xffc1, 0xac3d, 0xfddf, 0x1bac, 0xc8ec, +0x14d4, 0x4029, 0xe79d, 0x15d6, 0x3792, 0xcc34, 0xca86, 0x3225, 0xf50a, 0xcf32, +0x3e28, 0x12b9, 0xe181, 0x364b, 0x1002, 0xb4c9, 0x031c, 0x26d6, 0xd0a9, 0x1e6a, +0x443a, 0xd350, 0x08d3, 0x41ed, 0xc7a2, 0xb99c, 0x2fe3, 0xff21, 0xdc75, 0x4839, +0x19bb, 0xe84c, 0x32f7, 0x01b7, 0xaddf, 0xfef1, 0x1e1c, 0xcae8, 0x16e4, 0x4bda, +0xecbb, 0x0caf, 0x3f24, 0xe0dc, 0xc4bc, 0x18da, 0xf67e, 0xdd77, 0x3908, 0x10f4, +0xed5b, 0x4369, 0x1b8d, 0xb980, 0x0190, 0x297a, 0xc6e3, 0x009e, 0x4462, 0xea33, +0x0155, 0x3cba, 0xe27f, 0xcbef, 0x2bda, 0xf9a0, 0xd4bc, 0x439f, 0x150b, 0xd559, +0x344d, 0x1a5b, 0xaf57, 0xf935, 0x2de0, 0xcf9a, 0x0979, 0x49a9, 0xea95, 0x051a, +0x3cdb, 0xd6df, 0xbc25, 0x2174, 0xf28b, 0xc89b, 0x4222, 0x2645, 0xdfc1, 0x315e, +0x201e, 0xb2fc, 0xe3d4, 0x181b, 0xc442, 0xfd80, 0x4a43, 0xed31, 0xff1f, 0x4381, +0xdf06, 0xb4dc, 0x1fd7, 0xf6dc, 0xbffe, 0x3a30, 0x24f3, 0xd6d6, 0x297b, 0x1c5d, +0xaf37, 0xedb8, 0x286b, 0xc61d, 0xfe95, 0x515b, 0xe559, 0xf3c9, 0x4090, 0xd830, +0xae85, 0x1db8, 0xf7ec, 0xc607, 0x3f9f, 0x264d, 0xd94a, 0x2a8a, 0x1485, 0xa002, +0xdeaf, 0x235b, 0xc381, 0xfa49, 0x5796, 0xefa6, 0xf6b9, 0x4056, 0xd904, 0xa813, +0x17bf, 0xf931, 0xbf26, 0x3e31, 0x2c1d, 0xd50a, 0x2d55, 0x22b9, 0xa846, 0xdf9f, +0x28c5, 0xc598, 0xef6b, 0x51e5, 0xf17d, 0xfa6e, 0x46ce, 0xddcb, 0xac63, 0x1bcf, +0xff42, 0xc08e, 0x3b8a, 0x30ab, 0xd540, 0x2b2a, 0x2b14, 0xb01e, 0xe003, 0x2eb4, +0xd207, 0xf705, 0x5a04, 0xf5f1, 0xf4f2, 0x49c1, 0xe735, 0xac7d, 0x1ff2, 0x0bc1, +0xc150, 0x3a15, 0x3cd0, 0xdc44, 0x29ee, 0x3079, 0xb504, 0xdcbb, 0x2cd7, 0xcfca, +0xeed8, 0x5c84, 0xfe19, 0xf346, 0x4ec0, 0xf24e, 0xa9a2, 0x1b01, 0x120e, 0xbf61, +0x31bd, 0x3ed0, 0xdca8, 0x27d7, 0x3553, 0xb79f, 0xddc0, 0x376a, 0xd743, 0xea45, +0x592a, 0xf9f4, 0xe94c, 0x4a1d, 0xf552, 0xa9a1, 0x19d2, 0x14c6, 0xbc9b, 0x2b11, +0x3913, 0xd2dc, 0x1f02, 0x340a, 0xb6b6, 0xd426, 0x33f8, 0xd9a8, 0xdc7f, 0x5123, +0xfd3a, 0xde46, 0x40ce, 0xfa10, 0xa997, 0x14a8, 0x1bb4, 0xc08d, 0x2376, 0x3d24, +0xd503, 0x166b, 0x35f1, 0xbc86, 0xd0fa, 0x36e8, 0xf1a1, 0xd628, 0x16ed, 0xf145, +0x0d1a, 0x55e9, 0x09b3, 0xd0ea, 0x189e, 0xfae5, 0xa1d9, 0xe581, 0xfd1f, 0xd241, +0x1ffa, 0x5b9f, 0x2d05, 0x1f94, 0x316b, 0xe330, 0xba22, 0xd9ab, 0xb354, 0xcfaa, +0x3059, 0x1e34, 0xfcfc, 0x565e, 0x623a, 0xe738, 0xe027, 0xfe57, 0xc099, 0xb327, +0xf470, 0x0c3c, 0x0e38, 0x38fd, 0x1a11, 0x0892, 0x3339, 0xf5c3, 0xbab1, 0xe297, +0xf843, 0xce95, 0xe620, 0x1c2a, 0x09ee, 0x1283, 0x1b02, 0x1187, 0x188b, 0x0e86, +0xd87e, 0xb652, 0xeca9, 0xdb2d, 0xc7dd, 0x1fe5, 0x379e, 0x0fd2, 0x1c45, 0x4c2e, +0x1316, 0xd85d, 0xdfc8, 0xb6df, 0xc87f, 0xeb35, 0xe54a, 0x1628, 0x57e4, 0x3419, +0xff6c, 0x4156, 0x1c74, 0xb5b4, 0xca06, 0xd49b, 0xc6db, 0xdff3, 0x0f42, 0x1c9b, +0x38c2, 0x3cc3, 0x059b, 0x2a27, 0x2699, 0xce85, 0xb4f9, 0xd393, 0xdea9, 0xcdb3, +0x03e7, 0x3281, 0x3d54, 0x3c61, 0x2583, 0x2ce2, 0x0c86, 0xdb4d, 0xb3bf, 0xbb9c, +0xe353, 0xd3fa, 0x034f, 0x4cdb, 0x4ab4, 0x21fa, 0x2b59, 0x391f, 0xeb27, 0xc6cb, +0xb8e4, 0xba9a, 0xe811, 0xec0e, 0x0c31, 0x4bdb, 0x5772, 0x163d, 0x1a19, 0x3f4d, +0xe9e8, 0xc3a2, 0xce2a, 0xc788, 0xd9f4, 0xf83e, 0x1bc6, 0x3ce8, 0x5548, 0x1db0, +0x1a55, 0x4521, 0xf1e2, 0xb3ab, 0xc2fd, 0xdbe1, 0xd800, 0xed52, 0x2c30, 0x402d, +0x430b, 0x23ff, 0x260b, 0x2f76, 0xea68, 0xb3d7, 0xb28e, 0xe14a, 0xdd06, 0xe066, +0x33b3, 0x51ec, 0x33b4, 0x1667, 0x3052, 0x1b77, 0xd41e, 0xc1bd, 0xb6c4, 0xd7a4, +0xeae0, 0xe9c9, 0x2119, 0x50ee, 0x3348, 0x0504, 0x35a7, 0x2224, 0xc555, 0xbad4, +0xc362, 0xd0c4, 0xdade, 0xf6c3, 0x247a, 0x463c, 0x3726, 0x098e, 0x2ae9, 0x1a2f, +0xc9d7, 0xb0fe, 0xc012, 0xdaac, 0xd5e1, 0xf9b0, 0x351f, 0x47da, 0x2cc6, 0x10fb, +0x2d9f, 0x068e, 0xc5e3, 0xb7fe, 0xc297, 0xe2b0, 0xe422, 0x01db, 0x36ef, 0x48cb, +0x23b7, 0x10de, 0x3507, 0x0307, 0xc7bf, 0xbff3, 0xc77c, 0xe128, 0xe56e, 0x0857, +0x3924, 0x4aaf, 0x2249, 0x103e, 0x31eb, 0xfa7b, 0xc42a, 0xbff2, 0xca69, 0xdf50, +0xe715, 0x1070, 0x37d6, 0x4303, 0x1eac, 0x16ba, 0x3184, 0xf739, 0xc4f5, 0xba46, +0xcd7e, 0xe4d0, 0xe592, 0x10ee, 0x3d09, 0x4044, 0x17ce, 0x2016, 0x2f3f, 0xe9e5, +0xc633, 0xbad5, 0xc6f9, 0xdeac, 0xe624, 0x121c, 0x413b, 0x4301, 0x1783, 0x29fd, +0x2ba5, 0xdaa4, 0xbe2e, 0xbb8e, 0xcbc8, 0xdde4, 0xf1e9, 0x21db, 0x439b, 0x4190, +0x172e, 0x27a0, 0x21f8, 0xd636, 0xbad8, 0xb8bf, 0xd096, 0xdf64, 0xf8a8, 0x2b93, +0x443b, 0x3b96, 0x185e, 0x26da, 0x10a6, 0xd167, 0xbdb5, 0xb977, 0xdb3a, 0xe708, +0xfa86, 0x2f52, 0x4806, 0x3265, 0x17a3, 0x31bc, 0x0e05, 0xd510, 0xc461, 0xbd66, +0xe192, 0xed77, 0x0119, 0x32ba, 0x50ed, 0x31ea, 0x16d3, 0x36ec, 0x0732, 0xcfc7, +0xc460, 0xc184, 0xdf83, 0xea58, 0x0626, 0x3550, 0x5246, 0x2def, 0x16cd, 0x3427, +0xfd3a, 0xc953, 0xbd3c, 0xc544, 0xe4ec, 0xf153, 0x166b, 0x3e10, 0x4e6d, 0x26d4, +0x1968, 0x2f16, 0xf428, 0xcae0, 0xbedd, 0xccf8, 0xe956, 0xefa2, 0x1950, 0x4297, +0x4a75, 0x1de5, 0x1955, 0x29ba, 0xeb91, 0xc61c, 0xbb12, 0xce33, 0xe7ce, 0xefe6, +0x18c6, 0x3e32, 0x43c5, 0x1922, 0x1cc3, 0x20fd, 0xde2b, 0xbf55, 0xb70b, 0xd16f, +0xe788, 0xef8e, 0x20c4, 0x4654, 0x3d93, 0x11d7, 0x1d2e, 0x15c5, 0xd810, 0xc122, +0xb7df, 0xd5bd, 0xe934, 0xf5a0, 0x24cd, 0x4321, 0x356b, 0x10be, 0x2522, 0x0e25, +0xcdbf, 0xc120, 0xbd1c, 0xd9ef, 0xe950, 0xf8ec, 0x2940, 0x4a04, 0x31e9, 0x09bb, +0x2935, 0x0de2, 0xcd32, 0xc3e0, 0xc0ad, 0xd96f, 0xebee, 0x0617, 0x2f65, 0x4a9d, +0x32b8, 0x104d, 0x2b20, 0x042c, 0xc6fe, 0xc0fc, 0xccb1, 0xe4c6, 0xe7e5, 0x0a2f, +0x3646, 0x44a9, 0x27ed, 0x0f84, 0x2482, 0xf9ba, 0xc9c9, 0xbc46, 0xc6f1, 0xe7c9, +0xe7b4, 0x0935, 0x38ab, 0x3dfb, 0x17f4, 0x1202, 0x2366, 0xe8cf, 0xc894, 0xc02b, +0xc4e7, 0xe682, 0xe9b4, 0x07dc, 0x39bc, 0x4323, 0x1255, 0x11a3, 0x2383, 0xde38, +0xc201, 0xc28c, 0xc797, 0xe30e, 0xf319, 0x11aa, 0x3329, 0x3e07, 0x11d9, 0x1242, +0x2173, 0xdd6c, 0xbc12, 0xbfc4, 0xd3cc, 0xe301, 0xf14f, 0x1ed7, 0x3c0b, 0x3bbe, +0x150a, 0x16d9, 0x1504, 0xded6, 0xc844, 0xc0c3, 0xdedd, 0xf0d7, 0xf666, 0x25d8, +0x4424, 0x33d0, 0x130e, 0x2876, 0x1370, 0xd7a6, 0xcf17, 0xc604, 0xdfb9, 0xf3d2, +0xfde9, 0x29bc, 0x4a3a, 0x328f, 0x0b59, 0x293f, 0x0f84, 0xd398, 0xd04b, 0xc938, +0xdc96, 0xf077, 0x05ff, 0x2a1d, 0x46e9, 0x33e3, 0x0e06, 0x27af, 0x084b, 0xcbee, +0xc5ed, 0xce50, 0xe4ec, 0xee95, 0x0fc4, 0x3481, 0x4291, 0x2ab8, 0x0ee7, 0x217a, +0xfbca, 0xd072, 0xc584, 0xcdc2, 0xeeae, 0xf284, 0x0beb, 0x2a91, 0x499c, 0x4ab9, +0x1751, 0xfb4e, 0xdff4, 0xc548, 0xaa11, 0xcb25, 0x079b, 0x0c5f, 0x3e98, 0x6247, +0x3e07, 0x0f43, 0xf0e4, 0xca5f, 0xb34f, 0xd401, 0xc893, 0xf3d1, 0x4c26, 0x308b, +0x22b3, 0x41c0, 0x2279, 0xdc8b, 0xdff8, 0xe310, 0xcceb, 0x027f, 0xf615, 0xee06, +0x3db0, 0x2392, 0xe01d, 0x1366, 0x3415, 0xe34c, 0xf6fc, 0x29c3, 0xe8c4, 0xee7a, +0x0fa2, 0xddee, 0xd84b, 0x1d1b, 0x1722, 0xff58, 0x3ac2, 0x1f74, 0xf03f, 0x1870, +0xfcd6, 0xbff1, 0xe68f, 0x1180, 0xed1f, 0x0a12, 0x3895, 0x07ec, 0x0a31, 0x24b3, +0xe648, 0xc9fc, 0x0734, 0xf757, 0xd412, 0x1f4f, 0x1e8b, 0xee37, 0x1f0e, 0x1be3, +0xd43a, 0xefa3, 0x194b, 0xddce, 0xf237, 0x287d, 0xeedf, 0xf88e, 0x2f7f, 0xf704, +0xd874, 0x1c88, 0x0972, 0xd8d5, 0x1702, 0x0f28, 0xe05e, 0x15f4, 0x1a7c, 0xd9ff, +0xf6eb, 0x29b0, 0xf002, 0xf068, 0x23d5, 0xf4b8, 0xf046, 0x1d23, 0xf157, 0xd110, +0x1519, 0x14cc, 0xdede, 0x142d, 0x1a12, 0xe515, 0x0b1c, 0x1636, 0xd4d5, 0xe629, +0x1cf8, 0xe7c6, 0xea58, 0x2b1f, 0xfc3e, 0xeeea, 0x236a, 0xfb53, 0xcfca, 0x089d, +0x0488, 0xd160, 0x0a55, 0x141d, 0xe5cd, 0x107d, 0x186d, 0xd8c8, 0xeaf7, 0x1870, +0xe826, 0xe955, 0x18d7, 0xf4b0, 0xf2f4, 0x198f, 0xf637, 0xd898, 0x0a60, 0x099d, +0xe121, 0x112c, 0x19f0, 0xe9f0, 0x0257, 0x16f3, 0xea68, 0xe825, 0x11db, 0xf73d, +0xf784, 0x22c2, 0x01a7, 0xfa94, 0x2329, 0xff98, 0xd3ac, 0x066b, 0x0f20, 0xe092, +0x0cc3, 0x1ddc, 0xf6f5, 0x1320, 0x1de5, 0xe877, 0xf111, 0x167b, 0xeabe, 0xf59b, +0x2682, 0xf99e, 0xf763, 0x2689, 0x0359, 0xdfbd, 0x0e98, 0x0da2, 0xe78d, 0x0e20, +0x0ddb, 0xeff0, 0x11e2, 0x1312, 0xe459, 0xf4b0, 0x1704, 0xee92, 0xf4ab, 0x1ec2, +0xfc20, 0xf450, 0x169f, 0xfcad, 0xdbac, 0x0468, 0x089e, 0xe794, 0x0e53, 0x118e, +0xefe9, 0x0e4a, 0x169a, 0xe1da, 0xebc0, 0x15eb, 0xefcb, 0xf2ee, 0x1beb, 0xfce8, +0xfa9c, 0x1c17, 0xffdb, 0xe6b1, 0x0fc5, 0x065c, 0xe6be, 0x10a6, 0x0c31, 0xefee, +0x1306, 0x13f9, 0xe94c, 0xfe45, 0x19f0, 0xf32a, 0xfe85, 0x1905, 0xf62a, 0xfd6b, +0x1747, 0xf729, 0xeaea, 0x11d1, 0x0593, 0xf301, 0x1786, 0x0b5f, 0xf124, 0x0940, +0x0668, 0xe6ec, 0xfe96, 0x1506, 0xf474, 0x04f3, 0x1923, 0xf708, 0xfe00, 0x1197, +0xf0a5, 0xe784, 0x0dcb, 0xff73, 0xf084, 0x1476, 0x091e, 0xf640, 0x0af0, 0x0286, +0xe773, 0xfd6b, 0x0efa, 0xf175, 0xf89a, 0x07af, 0xf9a6, 0x0516, 0x128d, 0x00ff, +0xfb4e, 0x0ed0, 0xfc70, 0xe60e, 0xf53d, 0xf46c, 0xf494, 0x0bff, 0x1551, 0x06e1, +0x0c9f, 0x0f55, 0xefab, 0xed70, 0xf731, 0xf0fe, 0xfd13, 0x0d56, 0x068f, 0x0174, +0x0fee, 0xffe4, 0xea15, 0xfb9a, 0xffd4, 0xf166, 0xfe33, 0x0e6f, 0xfeb8, 0x0068, +0x0cad, 0xf543, 0xef47, 0x0118, 0xf5be, 0xeb4f, 0x04dc, 0x09b3, 0xf586, 0x0081, +0x05bb, 0xf123, 0xf60d, 0x03d9, 0xf8d9, 0xfe28, 0x0dac, 0xfb79, 0xf27c, 0xfe7f, +0xf2c5, 0xeeb0, 0x04d2, 0x030d, 0xfb07, 0x0e9e, 0x0d11, 0xf686, 0xfc94, 0xffbf, +0xed59, 0xf589, 0x05ab, 0xfa48, 0xffa7, 0x10c1, 0x014b, 0xfa25, 0x09af, 0xfdfc, +0xf0ef, 0x03b9, 0x0400, 0xf635, 0x063f, 0x0b0b, 0xf9ca, 0x03dd, 0x0d8d, 0xfce6, +0x00df, 0x0f4b, 0x024e, 0xff59, 0x0dc5, 0x0159, 0xf654, 0x067a, 0x0580, 0xfe5c, +0x0e74, 0x0f97, 0x0220, 0x099e, 0x09f1, 0xf6cc, 0xfa19, 0x04a0, 0xfb69, 0x0199, +0x10a2, 0x0726, 0x02f2, 0x0c0d, 0x00c5, 0xf7e4, 0x056d, 0x020c, 0xf921, 0x0880, +0x0a05, 0xfc9b, 0x05b1, 0x0ba8, 0xfd73, 0x0126, 0x0afa, 0xfedb, 0xfe8e, 0x0754, +0xff08, 0x010e, 0x0a12, 0xff2a, 0xfc7a, 0x0965, 0x0306, 0xfbf9, 0x0735, 0x05c2, +0xfdbe, 0x020b, 0x01d4, 0xfd23, 0x035d, 0x0690, 0x0006, 0x0536, 0x0b42, 0x02fd, +0x0048, 0x04d9, 0xffac, 0xfb96, 0x0522, 0x06ea, 0x01a3, 0x0640, 0x0721, 0x02e7, +0x04ad, 0x0494, 0xfe70, 0x009e, 0x0380, 0xfafb, 0xfecf, 0x0890, 0x0224, 0xffd6, +0x0613, 0x005f, 0xfada, 0x0129, 0xfdf3, 0xf949, 0x014d, 0x006d, 0xfa91, 0x0029, +0x002c, 0xf7d8, 0xff02, 0x0615, 0xfbc4, 0xfc2b, 0x035b, 0xfb89, 0xf601, 0xfa4f, +0xfabf, 0xfbd9, 0x00a3, 0xfe0a, 0xfbd4, 0x0009, 0xfe8b, 0xf866, 0xf96c, 0xfcbd, +0xf750, 0xf6d5, 0xfee5, 0xfea6, 0xfc47, 0x00a5, 0x013f, 0xfaa4, 0xf910, 0xf98a, +0xf6f0, 0xfa55, 0xfc01, 0xfac1, 0xff53, 0x001d, 0xfac1, 0xfb9d, 0xfef2, 0xf9c9, +0xf9ce, 0xff10, 0xfabf, 0xfab8, 0xfe59, 0xfa05, 0xfa90, 0x00a1, 0xff54, 0xfdbe, +0x0243, 0xff6b, 0xfac6, 0xfde2, 0xfc78, 0xf927, 0xfc12, 0xfe2f, 0xfc8a, 0xfe15, +0x00a9, 0xff55, 0x0011, 0x0049, 0xfbfb, 0xfa18, 0xfd23, 0xfbc7, 0xf7ac, 0xfd25, +0x019e, 0x0030, 0x02a9, 0x0344, 0x0053, 0x0036, 0x003f, 0xfc42, 0xfd77, 0x047f, +0x022f, 0xffd5, 0x0747, 0x065b, 0xffcd, 0x058c, 0x0801, 0x00b8, 0x029f, 0x057c, +0x0228, 0x02a9, 0x03ae, 0x0336, 0x052e, 0x06d3, 0x0355, 0x0367, 0x097b, 0x0767, +0x040b, 0x0708, 0x062b, 0x00f3, 0x010e, 0x0624, 0x0661, 0x0641, 0x0870, 0x08cf, +0x095c, 0x0672, 0x0114, 0x0064, 0x0450, 0x0372, 0x00f0, 0x074e, 0x0927, 0x0375, +0x04d0, 0x06fa, 0x0278, 0x00e0, 0x023e, 0x0105, 0x0392, 0x0478, 0x01dc, 0x0633, +0x06ad, 0x0137, 0x035b, 0x071e, 0x039a, 0x00b9, 0x0238, 0x0257, 0x03b3, 0x032c, +0x00b5, 0x062b, 0x0920, 0x0425, 0x05d7, 0x09b0, 0x0457, 0x011e, 0x02cb, 0x0112, +0x01e7, 0x03e0, 0x04a0, 0x09f0, 0x0993, 0x025d, 0x03ab, 0x06f0, 0x01ce, 0xffa9, +0x0343, 0x03bf, 0x02bc, 0x0192, 0x0175, 0x03f8, 0x025f, 0xfe13, 0xffaf, 0x037b, +0x017f, 0xff0d, 0x010c, 0x01cc, 0xff47, 0xfda7, 0xff79, 0xffc8, 0xfd08, 0xfdcd, +0x01e5, 0x03c0, 0x00fa, 0xfdf8, 0xfdb9, 0xff87, 0xff9b, 0xfbe2, 0xfeae, 0x0380, +0x0014, 0xfe6f, 0x0115, 0x0048, 0xfe1d, 0xff3b, 0xff7b, 0xff0a, 0x0012, 0xfed0, +0xfed6, 0xffe0, 0xfcbf, 0xfbdb, 0x005d, 0xffb1, 0xf9ae, 0xfb2b, 0x0004, 0xff44, +0xfc6c, 0xfb62, 0xfdf8, 0xff0d, 0xfbbb, 0xfae7, 0xfd8a, 0xfd70, 0xfaee, 0xfbe3, +0xfdf3, 0xfc89, 0xfa9a, 0xfb6e, 0xfd82, 0xfcb8, 0xfaa3, 0xfc2a, 0xfeb9, 0xfc5c, +0xf8a1, 0xfb85, 0x000c, 0xfee7, 0xfbc5, 0xfc1f, 0xfee8, 0xfdac, 0xfae0, 0xfc8b, +0xfef5, 0xfebd, 0xfdf5, 0xfec1, 0x0023, 0xff0f, 0xfc4a, 0xfdd7, 0x00f5, 0xfea6, +0xfd0c, 0x002f, 0x0087, 0xfc77, 0xfc93, 0x0024, 0x013b, 0x00dc, 0xfdb0, 0xfcbd, +0x0060, 0xfed8, 0xfc65, 0xfff5, 0x0160, 0xfef8, 0x0045, 0x0243, 0x0065, 0xfff6, +0x0124, 0x00f9, 0x00f5, 0x00ae, 0xff8e, 0x00df, 0x02e1, 0xffa3, 0xfea2, 0x0390, +0x035d, 0xff35, 0xff1f, 0x009b, 0x0048, 0xffed, 0x0005, 0xfff7, 0x0019, 0xff23, +0xfe36, 0xff91, 0x0112, 0x0088, 0xfff6, 0x00fa, 0x00a3, 0xfe18, 0xfe82, 0x01b6, +0x00ae, 0xfead, 0x018f, 0x02ef, 0x0126, 0x002b, 0xffb6, 0x01e3, 0x0382, 0x00b0, +0x00bd, 0x0402, 0x024e, 0x0002, 0x02e3, 0x0327, 0x00b6, 0x01cf, 0x02ca, 0x0250, +0x0280, 0x01bd, 0x021d, 0x04f6, 0x0340, 0xfee9, 0x0095, 0x0305, 0x00bc, 0x012c, +0x04fc, 0x0469, 0x0257, 0x027e, 0x0242, 0x01ad, 0x014b, 0x00c3, 0x0147, 0x037a, +0x036a, 0x00b5, 0x0068, 0x0121, 0xff9a, 0xfec8, 0x0143, 0x0151, 0xfd18, 0xfced, +0xffbd, 0x0066, 0x007d, 0xff3b, 0xfdd4, 0xfe9a, 0xff0d, 0xfdc1, 0xfe33, 0xffd7, +0xfd45, 0xfbe9, 0xffc6, 0xff2d, 0xfb3e, 0xfd69, 0x0057, 0xff59, 0xffc4, 0x00ad, +0x0017, 0xffc4, 0xfde4, 0xfc22, 0xfe08, 0x004b, 0xffd4, 0x0028, 0x0265, 0x00fa, +0xfdc5, 0xfe0b, 0xff0e, 0xfe78, 0xfdca, 0xfe74, 0xff9b, 0x005c, 0x0106, 0x00eb, +0x015c, 0x01a8, 0xff52, 0xfee2, 0x00ee, 0xffbe, 0xfec8, 0x010d, 0x01ab, 0x00d9, +0x0106, 0x010d, 0x00e8, 0x0118, 0x00e8, 0x012b, 0x02b4, 0x0211, 0xff7a, 0xff8e, +0x0115, 0x0100, 0x00de, 0x02dd, 0x0379, 0x00f9, 0xffd1, 0x0018, 0xfff6, 0xfffa, +0x000c, 0xfff1, 0x0004, 0x0012, 0xffc4, 0x009c, 0x010c, 0xfffb, 0xffe4, 0x001a, +0xfff2, 0xfffc, 0x0012, 0xffe2, 0x0015, 0x015a, 0x0257, 0x01c9, 0x004d, 0xfff9, +0xffdd, 0x0059, 0x019b, 0x004f, 0x0095, 0x030f, 0x0191, 0xff96, 0x015d, 0x0296, +0x01ee, 0x0205, 0x01f5, 0x0220, 0x0303, 0x0276, 0x01b6, 0x02a2, 0x02f4, 0x01f9, +0x0209, 0x01e3, 0x0073, 0x00ad, 0x0219, 0x0205, 0x00f2, 0x000a, 0xffc0, 0x00c9, +0x0105, 0xffac, 0x007c, 0x0198, 0x0051, 0xffcf, 0x001b, 0xfff4, 0x0001, 0x0002, +0xfffe, 0xfffb, 0x0005, 0xfffd, 0xfff3, 0x0025, 0xff14, 0xfe3b, 0xffa5, 0xfffc, +0xfee0, 0xff17, 0xffe8, 0x0010, 0xffec, 0x0017, 0xffe5, 0xff21, 0xfef3, 0xfef8, +0xff4b, 0x002c, 0xffc0, 0xfee9, 0xffc3, 0x001f, 0xff65, 0xffbc, 0x001d, 0xfff2, +000000, 0x0003, 0xfffc, 0xfffc, 0x000a, 0xffec, 0x0015, 0x0095, 0x002c, 0xffc9, +0x006a, 0x0078, 0xfff2, 0xfffb, 0x0006, 0xfffa, 0x0002, 0xfffd, 0x0004, 0xfff4, +0x0010, 0xfff2, 0xfff7, 0x003a, 0xfeb1, 0xfe3a, 0xfff4, 0x0020, 0xffde, 0x0015, +0xfff6, 000000, 0x0002, 0xfffc, 0x0001, 0xfffe, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, +000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000, 000000 }; diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/ringtone.h b/3rdparty/iaxclient-2/lib/libiax2/src/ringtone.h new file mode 100644 index 0000000..637021d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/ringtone.h @@ -0,0 +1,30 @@ +/* ringtone.h: Generated from frequencies 440 and 480 + by gensound. 200 samples */ +static short ringtone[200] = { + 0, 11581, 21659, 28927, 32445, 31764, 26981, 18727, + 8084, -3559, -14693, -23875, -29927, -32083, -30088, -24228, + -15290, -4453, 6864, 17195, 25212, 29902, 30693, 27526, + 20856, 11585, 944, -9673, -18899, -25560, -28837, -28357, + -24244, -17089, -7868, 2192, 11780, 19667, 24872, 26779, + 25212, 20450, 13179, 4396, -4731, -13019, -19421, -23164, + -23839, -21446, -16384, -9384, -1408, 6484, 13281, 18145, + 20517, 20182, 17286, 12301, 5951, -887, -7314, -12519, + -15886, -17068, -16017, -12983, -8458, -3109, 2327, 7142, + 10750, 12757, 13007, 11585, 8793, 5095, 1044, -2800, + -5951, -8053, -8921, -8560, -7141, -4967, -2421, 104, + 2260, 3791, 4567, 4589, 3977, 2941, 1733, 600, + -257, -722, -772, -481, 0, 481, 772, 722, + 257, -600, -1733, -2941, -3977, -4589, -4567, -3791, + -2260, -104, 2421, 4967, 7141, 8560, 8921, 8053, + 5951, 2800, -1044, -5095, -8793, -11585, -13007, -12757, + -10750, -7142, -2327, 3109, 8458, 12983, 16017, 17068, + 15886, 12519, 7314, 887, -5951, -12301, -17286, -20182, + -20517, -18145, -13281, -6484, 1408, 9384, 16384, 21446, + 23839, 23164, 19421, 13019, 4731, -4396, -13179, -20450, + -25212, -26779, -24872, -19667, -11780, -2192, 7868, 17089, + 24244, 28357, 28837, 25560, 18899, 9673, -944, -11585, + -20856, -27526, -30693, -29902, -25212, -17195, -6864, 4453, + 15290, 24228, 30088, 32083, 29927, 23875, 14693, 3559, + -8084, -18727, -26981, -31764, -32445, -28927, -21659, -11581, + +}; diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/winiphone.c b/3rdparty/iaxclient-2/lib/libiax2/src/winiphone.c new file mode 100644 index 0000000..0bc3147 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/winiphone.c @@ -0,0 +1,761 @@ +/* + * Miniphone: A simple, command line telephone + * + * IAX Support for talking to Asterisk and other Gnophone clients + * + * Copyright (C) 1999, Linux Support Services, Inc. + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU General Public License + */ + +/* #define PRINTCHUCK /* enable this to indicate chucked incomming packets */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "gsm.h" +#include "iax-client.h" +#include "frame.h" +#include "miniphone.h" + + +struct peer { + int time; + gsm gsmin; + gsm gsmout; + + struct iax_session *session; + struct peer *next; +}; + +static struct peer *peers; +static int answered_call = 0; + +/* stuff for wave audio device */ +HWAVEOUT wout; +HWAVEIN win; + +typedef struct whout { + WAVEHDR w; + short data[160]; + struct whout *next; +} WHOUT; + +WHOUT *outqueue = NULL; + +/* parameters for audio in */ +#define NWHIN 8 /* number of input buffer entries */ +/* NOTE the OUT_INTERVAL parameter *SHOULD* be more around 18 to 20 or so, since the packets should +be spaced by 20 milliseconds. However, in practice, especially in Windoze-95, setting it that high +caused underruns. 10 is just ever so slightly agressive, and the receiver has to chuck a packet +every now and then. Thats about the way it should be to be happy. */ +#define OUT_INTERVAL 10 /* number of ms to wait before sending more data to peer */ +/* parameters for audio out */ +#define OUT_DEPTH 12 /* number of outbut buffer entries */ +#define OUT_PAUSE_THRESHOLD 2 /* number of active entries needed to start output (for smoothing) */ + +/* audio input buffer headers */ +WAVEHDR whin[NWHIN]; +/* audio input buffers */ +char bufin[NWHIN][320]; + +/* initialize the sequence variables for the audio in stuff */ +unsigned int whinserial = 1,nextwhin = 1; + +static struct peer *find_peer(struct iax_session *); +static void parse_args(FILE *, unsigned char *); +void do_iax_event(FILE *); +void call(FILE *, char *); +void answer_call(void); +void reject_call(void); +static void handle_event(FILE *, struct iax_event *e, struct peer *p); +void parse_cmd(FILE *, int, char **); +void issue_prompt(FILE *); +void dump_array(FILE *, char **); + +static char *help[] = { +"Welcome to the miniphone telephony client, the commands are as follows:\n", +"Help\t\t-\tDisplays this screen.", +"Call \t-\tDials the number supplied.", +"Answer\t\t-\tAnswers an Inbound call.", +"Reject\t\t-\tRejects an Inbound call.", +"Dump\t\t-\tDumps (disconnects) the current call.", +"Dtmf \t-\tSends specified DTMF digit.", +"Status\t\t-\tLists the current sessions and their current status.", +"Quit\t\t-\tShuts down the client.", +"", +0 +}; + +static struct peer *most_recent_answer; +static struct iax_session *newcall = 0; + +/* holder of the time, relative to startup in system ticks. See our +gettimeofday() implementation */ +time_t startuptime; + +/* routine called at exit to shutdown audio I/O and close nicely. +NOTE: If all this isnt done, the system doesnt not handle this +cleanly and has to be rebooted. What a pile of doo doo!! */ +void killem(void) +{ + waveInStop(win); + waveInReset(win); + waveInClose(win); + waveOutReset(wout); + waveOutClose(wout); + WSACleanup(); /* dont forget socket stuff too */ + return; +} + +/* Win-doze doenst have gettimeofday(). This sux. So, what we did is +provide some gettimeofday-like functionality that works for our purposes. +In the main(), we take a sample of the system tick counter (into startuptime). +This function returns the relative time since program startup, more or less, +which is certainly good enough for our purposes. */ +void gettimeofday(struct timeval *tv, struct timezone *tz) +{ + long l = startuptime + GetTickCount(); + + tv->tv_sec = l / 1000; + tv->tv_usec = (l % 1000) * 1000; + return; +} + + +static struct peer *find_peer(struct iax_session *session) +{ + struct peer *cur = peers; + while(cur) { + if (cur->session == session) + return cur; + cur = cur->next; + } + return NULL; +} + +void +parse_args(FILE *f, unsigned char *cmd) +{ + static char *argv[MAXARGS]; + unsigned char *parse = cmd; + int argc = 0, t = 0; + + // Don't mess with anything that doesn't exist... + if(!*parse) + return; + + memset(argv, 0, sizeof(argv)); + while(*parse) { + if(*parse < 33 || *parse > 128) { + *parse = 0, t++; + if(t > MAXARG) { + fprintf(f, "Warning: Argument exceeds maximum argument size, command ignored!\n"); + return; + } + } else if(t || !argc) { + if(argc == MAXARGS) { + fprintf(f, "Warning: Command ignored, too many arguments\n"); + return; + } + argv[argc++] = parse; + t = 0; + } + + parse++; + } + + if(argc) + parse_cmd(f, argc, argv); +} + +/* handle all network requests, and a pending scheduled event, if any */ +void service_network(int netfd, FILE *f) +{ + fd_set readfd; + struct timeval dumbtimer; + + /* set up a timer that falls-through */ + dumbtimer.tv_sec = 0; + dumbtimer.tv_usec = 0; + + + for(;;) /* suck everything outa network stuff */ + { + FD_ZERO(&readfd); + FD_SET(netfd, &readfd); + if (select(netfd + 1, &readfd, 0, 0, &dumbtimer) > 0) + { + if (FD_ISSET(netfd,&readfd)) + { + do_iax_event(f); + (void) iax_time_to_next_event(); + } else break; + } else break; + } + do_iax_event(f); /* do pending event if any */ +} + + +int +main(int argc, char *argv[]) +{ + int port; + int netfd; + int c, i; + FILE *f; + char rcmd[RBUFSIZE]; + gsm_frame fo; + WSADATA foop; + time_t t; + WAVEFORMATEX wf; + WHOUT *wh,*wh1,*wh2; + unsigned long lastouttick = 0; + + + + /* get time of day in milliseconds, offset by tick count (see our + gettimeofday() implementation) */ + time(&t); + startuptime = ((t % 86400) * 1000) - GetTickCount(); + + f = stdout; + _dup2(fileno(stdout),fileno(stderr)); + + /* start up the windoze-socket layer stuff */ + if (WSAStartup(0x0101,&foop)) { + fprintf(stderr,"Fatal error: Falied to startup windows sockets\n"); + return -1; + } + + + /* setup the format for opening audio channels */ + wf.wFormatTag = WAVE_FORMAT_PCM; + wf.nChannels = 1; + wf.nSamplesPerSec = 8000; + wf.nAvgBytesPerSec = 16000; + wf.nBlockAlign = 2; + wf.wBitsPerSample = 16; + wf.cbSize = 0; + /* open the audio out channel */ + if (waveOutOpen(&wout,0,&wf,0,0,CALLBACK_NULL) != MMSYSERR_NOERROR) + { + fprintf(stderr,"Fatal Error: Failed to open wave output device\n"); + return -1; + } + /* open the audio in channel */ + if (waveInOpen(&win,0,&wf,0,0,CALLBACK_NULL) != MMSYSERR_NOERROR) + { + fprintf(stderr,"Fatal Error: Failed to open wave input device\n"); + waveOutReset(wout); + waveOutClose(wout); + return -1; + } + /* activate the exit handler */ + atexit(killem); + /* initialize the audio in buffer structures */ + memset(&whin,0,sizeof(whin)); + + if ( (port = iax_init(0) < 0)) { + fprintf(stderr, "Fatal error: failed to initialize iax with port %d\n", port); + return -1; + } + + + iax_set_formats(AST_FORMAT_GSM); + netfd = iax_get_fd(); + + fprintf(f, "Text Based Telephony Client.\n\n"); + issue_prompt(f); + + /* main tight loop */ + while(1) { + /* service the network stuff */ + service_network(netfd,f); + if (outqueue) /* if stuff in audio output queue, free it up if its available */ + { + /* go through audio output queue */ + for(wh = outqueue,wh1 = wh2 = NULL,i = 0; wh != NULL; wh = wh->next) + { + service_network(netfd,f); /* service network here for better performance */ + /* if last one was removed from queue, zot it here */ + if (i && wh1) + { + free(wh1); + wh1 = wh2; + } + i = 0; /* reset "last one removed" flag */ + if (wh->w.dwFlags & WHDR_DONE) /* if this one is done */ + { + /* prepare audio header */ + if ((c = waveOutUnprepareHeader(wout,&wh->w,sizeof(WAVEHDR))) != MMSYSERR_NOERROR) + { + fprintf(stderr,"Cannot unprepare audio out header, error %d\n",c); + exit(255); + } + if (wh1 != NULL) /* if there was a last one */ + { + wh1->next = wh->next; + } + if (outqueue == wh) /* is first one, so set outqueue to next one */ + { + outqueue = wh->next; + } + i = 1; /* set 'to free' flag */ + } + wh2 = wh1; /* save old,old wh pointer */ + wh1 = wh; /* save the old wh pointer */ + } + } + /* go through all audio in buffers, and prepare and queue ones that are currently idle */ + for(i = 0; i < NWHIN; i++) + { + service_network(netfd,f); /* service network stuff here for better performance */ + if (!(whin[i].dwFlags & WHDR_PREPARED)) /* if not prepared, do so */ + { + /* setup this input buffer header */ + memset(&whin[i],0,sizeof(WAVEHDR)); + whin[i].lpData = bufin[i]; + whin[i].dwBufferLength = 320; + whin[i].dwUser = whinserial++; /* set 'user data' to current serial number */ + /* prepare the buffer */ + if (waveInPrepareHeader(win,&whin[i],sizeof(WAVEHDR))) + { + fprintf(stderr,"Unable to prepare header for input\n"); + return -1; + } + /* add it to device (queue) */ + if (waveInAddBuffer(win,&whin[i],sizeof(WAVEHDR))) + { + fprintf(stderr,"Unable to prepare header for input\n"); + return -1; + } + } + waveInStart(win); /* start it (if not already started) */ + } + + /* if key pressed, do command stuff */ + if(_kbhit()) + { + if ( ( fgets(&*rcmd, 256, stdin))) { + rcmd[strlen(rcmd)-1] = 0; + parse_args(f, &*rcmd); + } else fprintf(f, "Fatal error: failed to read data!\n"); + + issue_prompt(f); + } + /* do audio input stuff for buffers that have received data from audio in device already. Must + do them in serial number order (the order in which they were originally queued). */ + if(answered_call) /* send audio only if call answered */ + { + for(;;) /* loop until all are found */ + { + for(i = 0; i < NWHIN; i++) /* find an available one that's the one we are looking for */ + { + service_network(netfd,f); /* service network here for better performance */ + /* if not time to send any more, dont */ + if (GetTickCount() < (lastouttick + OUT_INTERVAL)) + { + i = NWHIN; /* set to value that WILL exit loop */ + break; + } + if ((whin[i].dwUser == nextwhin) && (whin[i].dwFlags & WHDR_DONE)) { /* if audio is ready */ + + /* must have read exactly 320 bytes */ + if (whin[i].dwBytesRecorded != whin[i].dwBufferLength) + { + fprintf(stderr,"Short audio read, got %d bytes, expected %d bytes\n", whin[i].dwBytesRecorded, + whin[i].dwBufferLength); + return -1; + } + if(!most_recent_answer->gsmout) + most_recent_answer->gsmout = gsm_create(); + + service_network(netfd,f); /* service network here for better performance */ + /* encode the audio from the buffer into GSM format */ + gsm_encode(most_recent_answer->gsmout, (short *) ((char *) whin[i].lpData), fo); + if(iax_send_voice(most_recent_answer->session, + AST_FORMAT_GSM, (char *)fo, sizeof(gsm_frame)) == -1) + puts("Failed to send voice!"); + lastouttick = GetTickCount(); /* save time of last output */ + + /* unprepare (free) the header */ + waveInUnprepareHeader(win,&whin[i],sizeof(WAVEHDR)); + /* initialize the buffer */ + memset(&whin[i],0,sizeof(WAVEHDR)); + /* bump the serial number to look for the next time */ + nextwhin++; + /* exit the loop so that we can start at lowest buffer again */ + break; + } + } + if (i >= NWHIN) break; /* if all found, get out of loop */ + } + } + + } + return 0; +} + +void +do_iax_event(FILE *f) { + int sessions = 0; + struct iax_event *e = 0; + struct peer *peer; + + while ( (e = iax_get_event(0))) { + peer = find_peer(e->session); + if(peer) { + handle_event(f, e, peer); + } else { + if(e->etype != IAX_EVENT_CONNECT) { + fprintf(stderr, "Huh? This is an event for a non-existant session?\n"); + } + sessions++; + + if(sessions >= MAX_SESSIONS) { + fprintf(f, "Missed a call... too many sessions open.\n"); + } + + + if(e->event.connect.callerid && e->event.connect.dnid) + fprintf(f, "Call from '%s' for '%s'", e->event.connect.callerid, + e->event.connect.dnid); + else if(e->event.connect.dnid) { + fprintf(f, "Call from '%s'", e->event.connect.dnid); + } else if(e->event.connect.callerid) { + fprintf(f, "Call from '%s'", e->event.connect.callerid); + } else printf("Call from"); + fprintf(f, " (%s)\n", inet_ntoa(iax_get_peer_addr(e->session).sin_addr)); + + if(most_recent_answer) { + fprintf(f, "Incoming call ignored, there's already a call waiting for answer... \ +please accept or reject first\n"); + iax_reject(e->session, "Too many calls, we're busy!"); + } else { + if ( !(peer = malloc(sizeof(struct peer)))) { + fprintf(f, "Warning: Unable to allocate memory!\n"); + return; + } + + peer->time = time(0); + peer->session = e->session; + peer->gsmin = 0; + peer->gsmout = 0; + + peer->next = peers; + peers = peer; + + iax_accept(peer->session); + iax_ring_announce(peer->session); + most_recent_answer = peer; + fprintf(f, "Incoming call!\n"); + } + iax_event_free(e); + issue_prompt(f); + } + } +} + +void +call(FILE *f, char *num) +{ + struct peer *peer; + + if(!newcall) + newcall = iax_session_new(); + else { + fprintf(f, "Already attempting to call somewhere, please cancel first!\n"); + return; + } + + if ( !(peer = malloc(sizeof(struct peer)))) { + fprintf(f, "Warning: Unable to allocate memory!\n"); + return; + } + + peer->time = time(0); + peer->session = newcall; + peer->gsmin = 0; + peer->gsmout = 0; + + peer->next = peers; + peers = peer; + + most_recent_answer = peer; + + iax_call(peer->session, num, 10); +} + +void +answer_call(void) +{ + if(most_recent_answer) + iax_answer(most_recent_answer->session); + printf("Answering call!\n"); + answered_call = 1; +} + +void +dump_call(void) +{ + if(most_recent_answer) + { + iax_hangup(most_recent_answer->session,""); + free(most_recent_answer); + } + printf("Dumping call!\n"); + answered_call = 0; + most_recent_answer = 0; + answered_call = 0; + peers = 0; + newcall = 0; +} + +void +reject_call(void) +{ + iax_reject(most_recent_answer->session, "Call rejected manually."); + most_recent_answer = 0; +} + +void +handle_event(FILE *f, struct iax_event *e, struct peer *p) +{ + int len,n; + WHOUT *wh,*wh1; + short fr[160]; + static paused_xmit = 0; + + + switch(e->etype) { + case IAX_EVENT_HANGUP: + iax_hangup(most_recent_answer->session, "Byeee!"); + fprintf(f, "Call disconnected by peer\n"); + free(most_recent_answer); + most_recent_answer = 0; + answered_call = 0; + peers = 0; + newcall = 0; + + break; + + case IAX_EVENT_REJECT: + fprintf(f, "Authentication was rejected\n"); + break; + case IAX_EVENT_ACCEPT: + fprintf(f, "Waiting for answer... RING RING\n"); + issue_prompt(f); + break; + case IAX_EVENT_ANSWER: + answer_call(); + break; + case IAX_EVENT_VOICE: + switch(e->event.voice.format) { + case AST_FORMAT_GSM: + if(e->event.voice.datalen % 33) { + fprintf(stderr, "Weird gsm frame, not a multiple of 33.\n"); + break; + } + + if (!p->gsmin) + p->gsmin = gsm_create(); + + len = 0; + while(len < e->event.voice.datalen) { + if(gsm_decode(p->gsmin, (char *) e->event.voice.data + len, fr)) { + fprintf(stderr, "Bad GSM data\n"); + break; + } else { /* its an audio packet to be output to user */ + + /* get count of pending items in audio output queue */ + n = 0; + if (outqueue) + { /* determine number of pending out queue items */ + for(wh = outqueue; wh != NULL; wh = wh->next) + { + if (!(wh->w.dwFlags & WHDR_DONE)) n++; + } + } + /* if not too many, send to user, otherwise chuck packet */ + if (n <= OUT_DEPTH) /* if not to chuck packet */ + { + /* malloc the memory for the queue item */ + wh = (WHOUT *) malloc(sizeof(WHOUT)); + if (wh == (WHOUT *) NULL) /* if error, bail */ + { + fprintf(stderr,"Outa memory!!!!\n"); + exit(255); + } + /* initialize the queue entry */ + memset(wh,0,sizeof(WHOUT)); + /* copy the PCM data from the gsm conversion buffer */ + memcpy((char *)wh->data,(char *)fr,sizeof(fr)); + /* set parameters for data */ + wh->w.lpData = (char *) wh->data; + wh->w.dwBufferLength = 320; + + /* prepare buffer for output */ + if (waveOutPrepareHeader(wout,&wh->w,sizeof(WAVEHDR))) + { + fprintf(stderr,"Cannot prepare header for audio out\n"); + exit(255); + } + /* if not currently transmitting, hold off a couple of packets for + smooth sounding output */ + if ((!n) && (!paused_xmit)) + { + /* pause output (before starting) */ + waveOutPause(wout); + /* indicate as such */ + paused_xmit = 1; + } + /* queue packet for output on audio device */ + if (waveOutWrite(wout,&wh->w,sizeof(WAVEHDR))) + { + fprintf(stderr,"Cannot output to wave output device\n"); + exit(255); + } + /* if we are paused, and we have enough packets, start audio */ + if ((n > OUT_PAUSE_THRESHOLD) && paused_xmit) + { + /* start the output */ + waveOutRestart(wout); + /* indicate as such */ + paused_xmit = 0; + } + /* insert it onto tail of outqueue */ + if (outqueue == NULL) /* if empty queue */ + outqueue = wh; /* point queue to new entry */ + else /* otherwise is non-empty queue */ + { + wh1 = outqueue; + while(wh1->next) wh1 = wh1->next; /* find last entry in queue */ + wh1->next = wh; /* point it to new entry */ + } + } +#ifdef PRINTCHUCK + else printf("Chucking packet!!\n"); +#endif + } + len += 33; + } + break; + default : + fprintf(f, "Don't know how to handle that format %d\n", e->event.voice.format); + } + break; + case IAX_EVENT_RINGA: + break; + default: + fprintf(f, "Unknown event: %d\n", e->etype); + break; + } +} + +void +parse_cmd(FILE *f, int argc, char **argv) +{ + _strupr(argv[0]); + if(!strcmp(argv[0], "HELP")) { + if(argc == 1) + dump_array(f, help); + else if(argc == 2) { + if(!strcmp(argv[1], "HELP")) + fprintf(f, "Help \t-\tDisplays general help or specific help on command if supplied an arguement\n"); + else if(!strcmp(argv[1], "QUIT")) + fprintf(f, "Quit\t\t-\tShuts down the miniphone\n"); + else fprintf(f, "No help available on %s\n", argv[1]); + } else { + fprintf(f, "Too many arguements for command help.\n"); + } + } else if(!strcmp(argv[0], "STATUS")) { + if(argc == 1) { + int c = 0; + struct peer *peerptr = peers; + + if(!peerptr) + fprintf(f, "No session matches found.\n"); + else while(peerptr) { + fprintf(f, "Listing sessions:\n\n"); + fprintf(f, "Session %d\n", ++c); + fprintf(f, "Session existed for %d seconds\n", (int)time(0)-peerptr->time); + if(answered_call) + fprintf(f, "Call answered.\n"); + else fprintf(f, "Call ringing.\n"); + + peerptr = peerptr->next; + } + } else fprintf(f, "Too many arguments for command status.\n"); + } else if(!strcmp(argv[0], "ANSWER")) { + if(argc > 1) + fprintf(f, "Too many arguements for command answer\n"); + else answer_call(); + } else if(!strcmp(argv[0], "REJECT")) { + if(argc > 1) + fprintf(f, "Too many arguements for command reject\n"); + else { + fprintf(f, "Rejecting current phone call.\n"); + reject_call(); + } + } else if(!strcmp(argv[0], "CALL")) { + if(argc > 2) + fprintf(f, "Too many arguements for command call\n"); + else { + call(f, argv[1]); + } + } else if(!strcmp(argv[0], "DUMP")) { + if(argc > 1) + fprintf(f, "Too many arguements for command dump\n"); + else { + dump_call(); + } + } else if(!strcmp(argv[0], "DTMF")) { + if(argc > 2) + { + fprintf(f, "Too many arguements for command dtmf\n"); + return; + } + if (argc < 1) + { + fprintf(f, "Too many arguements for command dtmf\n"); + return; + } + if(most_recent_answer) + iax_send_dtmf(most_recent_answer->session,*argv[1]); + } else if(!strcmp(argv[0], "QUIT")) { + if(argc > 1) + fprintf(f, "Too many arguements for command quit\n"); + else { + fprintf(f, "Good bye!\n"); + exit(1); + } + } else fprintf(f, "Unknown command of %s\n", argv[0]); +} + +void +issue_prompt(FILE *f) +{ + fprintf(f, "TeleClient> "); + fflush(f); +} + +void +dump_array(FILE *f, char **array) { + while(*array) + fprintf(f, "%s\n", *array++); +} diff --git a/3rdparty/iaxclient-2/lib/libiax2/src/winpoop.h b/3rdparty/iaxclient-2/lib/libiax2/src/winpoop.h new file mode 100644 index 0000000..4e9d112 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libiax2/src/winpoop.h @@ -0,0 +1,52 @@ +/* + * Functions Windows doesn't have... but should + * Copyright(C) 2001, Linux Support Services, Inc. + * + * Distributed under GNU LGPL. + * + * These are NOT fully compliant with BSD 4.3 and are not + * threadsafe. + * + */ + +#ifndef _winpoop_h +#define _winpoop_h + +#if defined(_MSC_VER) +#define INLINE __inline +#define inline __inline +#define snprintf _snprintf +// should try without these +#pragma warning(disable: 4996 4244 4305 4018 4804) +#if defined(_WIN64) + typedef __int64 ssize_t; +#elif defined(_WIN32) + typedef __int32 ssize_t; +#endif +#else +#define INLINE inline +#endif + +#include // this include +#include // for open, close, write, read +#include + +void gettimeofday(struct timeval *tv, void /*struct timezone*/ *tz); + +static INLINE int inet_aton(char *cp, struct in_addr *inp) +{ + int a1, a2, a3, a4; + unsigned int saddr; + + if (sscanf(cp, "%d.%d.%d.%d", &a1, &a2, &a3, &a4) != 4) + return 0; + a1 &= 0xff; + a2 &= 0xff; + a3 &= 0xff; + a4 &= 0xff; + saddr = (a1 << 24) | (a2 << 16) | (a3 << 8) | a4; + inp->s_addr = htonl(saddr); + return 1; +} + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/ChangeLog b/3rdparty/iaxclient-2/lib/libspeex/ChangeLog new file mode 100644 index 0000000..c5f957f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/ChangeLog @@ -0,0 +1,4350 @@ +2005-05-09 21:27 jm + + * trunk/speex/include/speex/speex_echo.h, + trunk/speex/libspeex/mdf.c: Smoothed correlation/energy + +2005-05-09 21:03 jm + + * trunk/speex/include/speex/speex_echo.h, + trunk/speex/libspeex/mdf.c: Some more regularization work for mdf + +2005-05-09 18:15 jm + + * trunk/speex/libspeex/mdf.c: System in underdetermined, trying to + work around that. + +2005-05-08 04:49 jm + + * trunk/speex/include/speex/speex_echo.h, + trunk/speex/libspeex/mdf.c: Some more AEC cleanup. Played a bit + with echo energy estimation. + +2005-05-08 00:08 jm + + * trunk/speex/include/speex/speex_echo.h, + trunk/speex/include/speex/speex_preprocess.h, + trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/preprocess.c: + Simplified the code a lot. Put back the denoiser hooks for further + cancellation (changed spectral param to float* at least for now). + +2005-05-07 08:07 jm + + * trunk/speex/libspeex/mdf.c: trying some ideas for soft-decision + DTD based on residual-to-signal ratio + +2005-05-04 05:38 jm + + * trunk/speex/libspeex/misc.h: changed version number for those not + using autoconf + +2005-05-02 07:05 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/src/Makefile.am, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wav_io.h: support for top_builddir != top_srcdir + +2005-05-02 00:49 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h: Added some control on the + aggressiveness of the pitch predictor in the form of a + SPEEX_SET_PLC_TUNING call. + +2005-04-29 05:33 jm + + * trunk/speex/Speex.spec.in, trunk/speex/libspeex/arch.h, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Think I fixed the PLC slowdown due + to denorm/underflow. Also don't re- synthesize on encode (i.e. + don't overwrite input buffer). + +2005-04-25 18:21 jm + + * trunk/speex/libspeex/sb_celp.c: pseudo-stack optional for wideband + too + +2005-04-25 08:12 jm + + * trunk/speex/configure.ac, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/stack_alloc.h: Autodetection of C99 variable + arrays and alloca. The pseudo-stack is only used if nothing else + is available. + +2005-04-25 07:16 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c: + convert codebook data (signed char) to spx_word16_t in a cleaner + manner + +2005-04-25 06:16 jm + + * trunk/speex/configure.ac, trunk/speex/include/speex/speex.h, + trunk/speex/include/speex/speex_header.h, + trunk/speex/include/speex/speex_preprocess.h, + trunk/speex/include/speex/speex_stereo.h, + trunk/speex/include/speex/speex_types.h.in, + trunk/speex/libspeex/arch.h, trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/stereo.c, + trunk/speex/src/wav_io.c, trunk/speex/src/wav_io.h: Now + autodetects (and handles) size of integer types. + +2005-04-24 04:45 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/fixed_debug.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c: some cleaning up + +2005-04-24 03:23 jm + + * trunk/speex/libspeex/filters.c: fixed-point stuff + +2005-04-22 08:57 jm + + * trunk/speex/libspeex/filters_arm4.h: oops + +2005-04-22 07:39 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/fixed_arm4.h, + trunk/speex/libspeex/fixed_arm5e.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/fixed_generic.h, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/vq.c: More work on fixed-point operators + +2005-04-22 06:23 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/fixed_arm4.h, + trunk/speex/libspeex/fixed_arm5e.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/fixed_generic.h, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Added some more fixed-point + operators + +2005-04-22 04:40 jm + + * trunk/speex/TODO, trunk/speex/configure.ac, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Fixed-point improvements (moved some stuff to 16-bit arithmetic) + +2005-04-02 04:10 jm + + * trunk/speex/libspeex/arch.h: Oops, forgot to add MAC16_16_Q13 for + float too. + +2005-03-30 03:31 jm + + * trunk/speex/include/speex/speex.h, + trunk/speex/include/speex/speex_jitter.h, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c: Removed another bunch of warnings + (when using some of the -W options) + +2005-03-30 01:13 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_header.c: fixed-point cleanup, removed + some warnings + +2005-03-25 02:58 jm + + * trunk/speex/libspeex/medfilter.c, + trunk/speex/libspeex/medfilter.h: Median filter. May need that in + the future. + +2005-03-15 05:18 jm + + * trunk/speex/configure.ac, trunk/speex/include/speex/speex_bits.h, + trunk/speex/include/speex/speex_header.h, + trunk/speex/libspeex/arch.h, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/fixed_arm4.h, + trunk/speex/libspeex/fixed_arm5e.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/fixed_generic.h, + trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/misc.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/testenc.c: Merged a modified version of Jamey + Hicks' C55 patch, fixed a long-standing fixed-point wideband + overflow. Replaced some "+" and "-" with ADD() and SUB(). + +2005-03-11 20:08 jm + + * trunk/speex/libspeex/stack_alloc.h: Support for alloca (untested) + +2005-03-03 18:30 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search_sse.h, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp_sse.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/stack_alloc.h, trunk/speex/libspeex/vq.c: Now + possible to put temporary arrays directly on the (real) stack + +2005-03-03 06:08 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + First cleanup step for stack allocation + +2005-03-02 08:23 jm + + * trunk/speex/libspeex/cb_search.c: Comment + +2005-03-01 23:47 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c: cleanup + +2005-03-01 09:22 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h: + Reduced unnecessary buffers (reduced memory usage) + +2005-02-17 05:42 jm + + * trunk/speex/libspeex/ltp.c: oops, that should fix the float + version + +2005-02-09 09:13 jm + + * trunk/speex/libspeex/filters_arm4.h: Unrolled version of + filter_mem2 and iir_mem2 + +2005-02-09 09:13 jm + + * trunk/speex/libspeex/nb_celp.c: Added a shortcut for ringing + computation + +2005-02-09 08:32 jm + + * trunk/speex/libspeex/ltp_arm4.h: oops... + +2005-02-09 08:19 jm + + * trunk/speex/libspeex/ltp_arm4.h: added a shortcut to skip every + second sample in open-loop pitch + +2005-02-09 08:14 jm + + * trunk/speex/libspeex/ltp_arm4.h: reordering asm + +2005-02-09 08:02 jm + + * trunk/speex/libspeex/ltp_arm4.h: no "memory" clobbered in inline + asm + +2005-02-09 07:47 jm + + * trunk/speex/libspeex/vq_arm4.h: oops + +2005-02-09 07:34 jm + + * trunk/speex/libspeex/Makefile.am: ... + +2005-02-09 07:31 jm + + * trunk/speex/libspeex/fixed_arm4.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/vq.c: misc + optimizations + +2005-02-09 04:10 jm + + * trunk/speex/libspeex/filters.c: Cleared the last float ops from + the comb filter + +2005-02-09 03:56 jm + + * trunk/speex/libspeex/cb_search.c: Removed warning, unnecessary + variables + +2005-02-09 03:47 jm + + * trunk/speex/libspeex/ltp.c: oops... ANSI C fix + +2005-02-09 03:35 jm + + * trunk/speex/libspeex/cb_search.c: Special case for complexity=1 + +2005-02-09 02:56 jm + + * trunk/speex/libspeex/filters.c: Fixed-point-ized a critical divide + in the comb filter + +2005-02-08 23:54 jm + + * trunk/speex/libspeex/vq_arm4.h: ARM version of VQ quantizer, but + only for N=1 + +2005-02-08 22:29 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c: Make use of cb_search_arm4.h + +2005-02-08 22:28 jm + + * trunk/speex/libspeex/nb_celp.c: A bit less agressive on ringing + computation (complexity 0), but simplified memory update at end of + subframe + +2005-02-08 21:40 jm + + * trunk/speex/libspeex/fixed_arm4.h, + trunk/speex/libspeex/fixed_arm5e.h: ARM arch fixes, assembly + version of MULT16_32_Q15 and MULT16_32_Q14 + +2005-02-08 18:29 jm + + * trunk/speex/libspeex/nb_celp.c: removed some useless memory access + +2005-02-08 10:18 jm + + * trunk/speex/libspeex/cb_search_arm4.h: ARM assembly version of + compute_weighted_codebook() + +2005-02-08 06:23 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c: Some general (minor) optimizations + +2005-02-07 22:21 jm + + * trunk/speex/libspeex/lsp.c: changed 0.0 to 0 for fixed-point + version + +2005-02-07 22:06 jm + + * trunk/speex/libspeex/cb_search.c: Brought back a version + split_cb_search_shape_sign optimized for complexity 1 + +2005-02-07 21:14 jm + + * trunk/speex/libspeex/ltp.c: Removed unnecessary initialization + +2005-02-07 10:01 jm + + * trunk/speex/libspeex/filters_arm4.h, + trunk/speex/libspeex/ltp_arm4.h: added some %= signs for labels + +2005-02-07 09:03 jm + + * trunk/speex/libspeex/fixed_arm4.h, + trunk/speex/libspeex/fixed_arm5e.h, + trunk/speex/libspeex/ltp_arm4.h: oops. Fixed some bad copy/paste + +2005-02-07 08:46 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/arch.h, + trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters_arm4.h, + trunk/speex/libspeex/fixed_arm4.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp_arm4.h: ARM assembly version of + pitch_xcorr, moved all ARM assembly to separate files + +2005-02-07 04:00 jm + + * trunk/speex/libspeex/ltp.c: an alternative implementation of + pitch_xcorr for machines with enough registers (more than x86, + that is). + +2005-02-07 00:35 jm + + * trunk/speex/libspeex/fixed_arm5e.h: ARM assembly version of + DIV32_16 + +2005-02-05 23:23 jm + + * trunk/speex/libspeex/ltp.c: ARM assembly version of inner_prod + with 8x unrolling + +2005-02-05 08:16 jm + + * trunk/speex/libspeex/bits.c: removed unnecessary + (re)initialization of the bit packer bytes + +2005-02-05 07:43 jm + + * trunk/speex/libspeex/fixed_arm.h: That was renamed to + fixed_arm5e.h + +2005-02-05 07:42 jm + + * trunk/speex/configure.ac, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/arch.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/fixed_arm5e.h: Renamed --enable-arm-asm to + --enable-arm5e-asm to reflect the fact that these instructions + aren't supported everywhere. Also added --enable-arm4-asm. + +2005-02-05 06:37 jm + + * trunk/speex/libspeex/filters.c: ARM instruction scheduling for + iir_mem2 + +2005-02-05 06:00 jm + + * trunk/speex/libspeex/filters.c: More ARM stuff + +2005-02-05 05:38 jm + + * trunk/speex/libspeex/filters.c: Better instruction scheduling for + ARM + +2005-02-05 05:36 jm + + * trunk/speex/libspeex/filters.c: An ARM assembly implementation of + filters_mem2 -- work in progress + +2005-02-03 22:18 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Removed redundent filtering calls, + added complexity 0 (even more shortcuts) + +2005-02-02 19:20 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Misc fixed-point fixes + +2005-01-06 01:52 conrad + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/symbian/config.h: applied symbian related config and + casting diffs from Colin Ward + +2004-10-29 12:22 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/smallft.c, trunk/speex/libspeex/smallft.h: + Renamed the FFT in order to remove the symbol clash with Vorbis. + +2004-10-24 03:37 jm + + * trunk/speex/libspeex/cb_search.c: Shouldn't warn with fixed-point + anymore + +2004-10-10 02:38 conrad + + * trunk/speex/libspeex/Makefile.am, trunk/speex/src/Makefile.am, + trunk/speex/src/wave_out.h: Applied build system patch from Erik + de Castro Lopo; now builds on MinGW: * guard src/wave_out.h + against multiple includes * add @OGG_CFLAGS@ to INCLUDES in + subdirs + +2004-09-22 07:09 jm + + * trunk/speex/libspeex/nb_celp.c: Fixed scaling problem for + fixed-point + +2004-08-13 07:29 conrad + + * trunk/speex/configure.ac, trunk/speex/include/speex/Makefile.am, + trunk/speex/libspeex/Makefile.am: remove references to noglobals + stuff from build + +2004-08-11 00:56 conrad + + * trunk/speex/libspeex/modes.c: remove spurious #if 0 around + speex_lib_get_mode() definition. in other news, kfish is crazy. + +2004-08-10 06:40 conrad + + * trunk/speex/include/speex/speex.h, trunk/speex/libspeex/modes.c: + added speex_get_mode() function + +2004-08-10 06:22 conrad + + * trunk/speex/include/speex/speex.h, trunk/speex/libspeex/modes.c: + add explicit consts in front of speex_mode_list[] declarations + +2004-07-21 07:18 conrad + + * trunk/speex/include/speex/speex_noglobals.h, + trunk/speex/libspeex/modes_noglobals.c: remove unneeded public + constructors/destructors for _noglobals modes; replaced with + cleaner speex_mode_{new,destroy}() functions. + +2004-07-21 06:03 conrad + + * trunk/speex/include/speex/speex_noglobals.h, + trunk/speex/libspeex/modes_noglobals.c: add speex_mode_new() and + speex_mode_destroy() API calls to _noglobals API + +2004-07-16 06:32 conrad + + * trunk/speex/libspeex/modes_noglobals.c: add some (void *) casts in + calls to speex_free to stop random errors on random compilers ... + it must be almost time for beer + +2004-07-16 06:20 conrad + + * trunk/speex/include/speex/speex_noglobals.h, + trunk/speex/libspeex/modes_noglobals.c: add some attribution lines + to *_noglobals + +2004-07-16 06:11 conrad + + * trunk/speex/libspeex/modes_noglobals.c: add const to params_free() + functions + +2004-07-16 06:07 conrad + + * trunk/speex/libspeex/modes_noglobals.c: free alloc'd params in + malloc'd submodes + +2004-07-16 05:22 conrad + + * trunk/speex/libspeex/modes_noglobals.c: add include of + to modes_noglobals.c to remove *link* error on vc++ + +2004-07-15 07:52 jm + + * trunk/speex/Makefile.am, trunk/speex/include/speex/speex_echo.h, + trunk/speex/include/speex/speex_jitter.h, + trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/mdf.c: cleanup + in EC and hitter buffer. removed some automake options + +2004-07-15 04:31 conrad + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/lbr_48k_tables.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/math_approx.c, trunk/speex/libspeex/mdf.c, + trunk/speex/libspeex/misc.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes_noglobals.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/smallft.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/testdenoise.c, + trunk/speex/libspeex/testecho.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vq.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c, trunk/speex/src/wav_io.c, + trunk/speex/src/wave_out.c: added guarded #include "config.h" + throughout libspeex/ and src/ + +2004-07-15 01:55 conrad + + * trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/modes_noglobals.c, + trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h: added + const in front of vbr_*_thresh tables (internal change, affects + libspeex memory layout only; no impact on modes.c code). Patch + from Colin Ward. + +2004-07-15 01:38 conrad + + * trunk/speex/libspeex/modes_noglobals.c: remove empty statements + which codewarrior complains about. patch from Colin Ward. + +2004-07-14 04:34 conrad + + * trunk/speex/libspeex/modes_noglobals.c: minor fixes to + modes_noglobals.c + +2004-07-14 03:50 jm + + * trunk/speex/Makefile.am, trunk/speex/configure.in, + trunk/speex/include, trunk/speex/include/Makefile.am, + trunk/speex/include/speex, trunk/speex/include/speex/Makefile.am, + trunk/speex/include/speex/speex.h, + trunk/speex/include/speex/speex_bits.h, + trunk/speex/include/speex/speex_callbacks.h, + trunk/speex/include/speex/speex_echo.h, + trunk/speex/include/speex/speex_header.h, + trunk/speex/include/speex/speex_jitter.h, + trunk/speex/include/speex/speex_noglobals.h, + trunk/speex/include/speex/speex_preprocess.h, + trunk/speex/include/speex/speex_stereo.h, + trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/speex_echo.h, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, + trunk/speex/libspeex/speex_jitter.h, + trunk/speex/libspeex/speex_noglobals.h, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/testdenoise.c, + trunk/speex/libspeex/testecho.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/speex.m4, + trunk/speex/speex.pc.in, trunk/speex/src/Makefile.am, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Moved all + the includes from /usr/include to /usr/include/speex + +2004-07-10 00:12 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/mdf.c, + trunk/speex/libspeex/misc.h: minor stuff for 1.1.6 + +2004-07-09 18:56 jm + + * trunk/speex/libspeex/mdf.c: Echo canceller sucks less (cross-talk + detection works a bit better). + +2004-07-09 18:56 jm + + * trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/speex_jitter.h: Removed some warnings + +2004-07-09 07:06 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes_noglobals.c, + trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex_noglobals.h, + trunk/speex/libspeex/testecho.c: Symbian support by Conrad Parker + +2004-07-09 05:18 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.c: moved + the mode list back to modes.c + +2004-07-09 04:31 jm + + * trunk/speex/Makefile.am, trunk/speex/autogen.sh, + trunk/speex/configure.in, trunk/speex/libspeex/mdf.c: Separated + the version macros + +2004-07-09 04:28 jm + + * trunk/speex/libspeex/misc.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_header.c: + run-time calls for identifying the Speex version + +2004-07-08 05:26 jm + + * trunk/speex/libspeex/preprocess.c: Removed the frame probability + of speech presence and increased noise estimate by a constant + factor. + +2004-07-08 05:25 jm + + * trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/misc.h: ... + +2004-07-08 05:24 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/modes.h: + Rest of the modes.c split + +2004-07-08 05:23 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.c: Split + modes.c in two. Now modes.c only contains the mode struct + definitions + +2004-07-03 04:37 jm + + * trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/speex_jitter.h: Removed all the drift_average + crap and just kept the timing histogram. Simple and works good + now. + +2004-06-20 04:52 jm + + * trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/speex_jitter.h: Jitter buffer is now adaptive + and should resume properly when link is lost. + +2004-06-06 03:02 giles + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Recommit changes lost in server + migration. Original commit (r6809) 2004-06-04 00:54:26 -0400 (Fri, + 04 Jun 2004) by jm. Think I've got gapless working properly now. + Also, started implementing the speex_lib_ctl() interface and + simplified speex_bits_advance (patch by Alfr?\195?\169do Moreira) + +2004-05-26 15:26 jm + + * trunk/speex/libspeex/preprocess.c: oops... that wasn't ansi C + +2004-04-20 21:52 jm + + * trunk/speex/Speex.kdevelop, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: speex_encode/speex_decode are back to + using floats, new speex_encode_int and speex_decode_int for the + short version + +2004-04-10 07:56 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/testdenoise.c: At least the dereverb now has + a chance of working... + +2004-04-02 21:16 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/vq.c: Changed + some constants to single-precision + +2004-04-02 21:09 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/speex_echo.h: + Echo cancellor interface changed to short (instead of float) + +2004-04-02 21:08 jm + + * trunk/speex/libspeex/preprocess.c: changed constants to single + precision + +2004-03-31 04:17 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h: Fixed a minor memory + leak, added de-reverberation, fixed denoiser hook for residual + echo cancellation. + +2004-03-30 08:52 jm + + * trunk/speex/libspeex/sb_celp.c: oops, encoder calls + speex_encoder_ctl + +2004-02-18 07:20 jm + + * trunk/speex/.cvsignore, trunk/speex/ChangeLog, + trunk/speex/doc/.cvsignore, trunk/speex/libspeex/.cvsignore, + trunk/speex/src/.cvsignore: .cvsignore files + +2004-02-12 08:41 jm + + * trunk/speex/libspeex/sb_celp.c: Valgrind support for sb_celp.c too + +2004-02-12 08:30 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/stack_alloc.h: added extra valgrind checks + for the Speex stack + +2004-02-06 14:20 oddsock + + * trunk/speex/libspeex/quant_lsp.c: M_PI not defined on win32 (and + possibly other platforms) + +2004-01-21 19:50 jm + + * trunk/speex/libspeex/speex_echo.h, + trunk/speex/libspeex/speex_jitter.h, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/speex_stereo.h: include gards and c++ + compatibility (extern "C") + +2004-01-19 09:10 jm + + * trunk/speex/libspeex/ltp_sse.h: Now works on multiples of 8 + (instead of 40), so it's a bit more general + +2004-01-19 08:58 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/ltp.c: Fixed + FIXED_POINT bug caused during SSE-ification. + +2004-01-19 08:09 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search_sse.h, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h: VQ search has been SSE-ized. Not really + clean yet, though. + +2004-01-18 23:37 jm + + * trunk/speex/libspeex/lsp.c: Saves some useless "cos" calculations + +2004-01-18 08:20 jm + + * trunk/speex/libspeex/Makefile.am: The CVS tag was annoying + +2004-01-18 08:13 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search_sse.h: SSE speedup for the codebook + response part of split_cb_search_shape_sign + +2004-01-18 06:47 jm + + * trunk/speex/libspeex/ltp_sse.h: converted the inner product + function to SSE intrinsics too + +2004-01-17 20:52 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp_sse.h: faster + SSE implementation (reduced unaligned loads) + +2004-01-17 16:06 jm + + * trunk/speex/libspeex/lsp.c: replaced cos by an approximation for + the float version + +2004-01-16 08:07 jm + + * trunk/speex/libspeex/filters_sse.h: A couple 'const's to make that + compile cleanly + +2004-01-16 07:50 jm + + * trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters_sse.h: New SSE implementation based + on intrinsics instead of assembly + +2003-12-24 06:14 jm + + * trunk/speex/libspeex/fixed_arm.h: removed unnecessary 'volatile' + keyword + +2003-12-23 08:20 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h: + fixed-point: converted comb_gain + +2003-12-23 08:11 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c: fixed-point: some perceptual + enhancement coef converted. + +2003-12-05 14:59 jm + + * trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c: + more const stuff, fixed a stupid bug in sb_decoder_ctl + +2003-12-04 21:29 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/exc_10_16_table.c, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/exc_20_32_table.c, + trunk/speex/libspeex/exc_5_256_table.c, + trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, + trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/lbr_48k_tables.c, + trunk/speex/libspeex/lsp_tables_nb.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Added const's all over the place + +2003-12-01 01:00 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h: + fixed-point: comb filter, part 4.12 + +2003-11-30 22:22 jm + + * trunk/speex/libspeex/filters.c: fixed-point: comb filter, part III + +2003-11-30 20:23 jm + + * trunk/speex/libspeex/filters.c: fixed-point: comb filter, part II + +2003-11-30 19:38 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h: + fixed-point: started work on comb filter + +2003-11-30 17:56 jm + + * trunk/speex/libspeex/filters.c: fixed-point: oops, fixed another + overflow for 4 kbps mode. + +2003-11-30 16:43 jm + + * trunk/speex/libspeex/ltp.c: oops. Got pitch_unquant_3tap to + compile again with floating point. + +2003-11-30 16:35 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/quant_lsp.c: ... + +2003-11-30 07:11 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/sb_celp.c: + fixed-point: Think I got rid of all overflows I could find + +2003-11-30 05:46 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/filters.c, trunk/speex/libspeex/fixed_arm.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/fixed_generic.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c: fixed-point: Fixed several + overflows. Added an explicit saturation function + +2003-11-29 19:25 jm + + * trunk/speex/libspeex/fixed_debug.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c: fixed-point: fixed another overflow + problem + +2003-11-29 08:12 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/nb_celp.c: fixed-point: fixed some overflows + +2003-11-29 07:38 jm + + * trunk/speex/libspeex/fixed_debug.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c: debug code for fixed-point + operators. Already fixed an overflow in lsp code + +2003-11-29 07:03 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/arch.h, + trunk/speex/libspeex/fixed_arm.h, + trunk/speex/libspeex/fixed_debug.h, + trunk/speex/libspeex/fixed_generic.h, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c: separated fixed-point operators + in: generic, ARM, debug + +2003-11-29 05:17 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h: + fixed-point: pitch gain again + +2003-11-29 02:45 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c: + fixed-point: pitch gain stuff + +2003-11-28 05:39 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c: fixed-point: some work on pitch + gain, fixed a packet-loss bug + +2003-11-27 08:42 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: fixed-point: bw_lpc and lpc_to_lsp + are now done. + +2003-11-27 05:00 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/lsp.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + fixed-point: lsp_enforce_margin argument no longer a float + +2003-11-25 16:40 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/testenc.c: ... + +2003-11-25 06:58 jm + + * trunk/speex/libspeex/arch.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/testenc.c: fixed-point: done quantizing + open-loop pitch + +2003-11-21 06:59 jm + + * trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c: + fixed-point: wideband work (LSP and excitation gain decoding) + +2003-11-21 03:06 jm + + * trunk/speex/libspeex/arch.h, + trunk/speex/libspeex/lbr_48k_tables.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/sb_celp.c: fixed-point: converted pitch gain + computation in open-loop search + +2003-11-14 19:16 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + fixed-point: integerized pi_gain's + +2003-11-14 18:46 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + fixed-point: sb_celp gain quantization, fixed missing entry in + nb_celp gain + +2003-11-14 18:28 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/testenc_wb.c: + fixed-point: before I screw everything up... + +2003-11-14 18:04 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/sb_celp.c: + fixed-point: fixed float regression + +2003-11-14 17:48 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: cleanup + +2003-11-13 20:39 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/src/speexdec.c: spelling, cleanup + +2003-11-13 08:47 jm + + * trunk/speex/libspeex/sb_celp.c: ... + +2003-11-13 08:45 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/testenc_wb.c: + fixed-point: converting wideband excitation gain to int (halfway + done) + +2003-11-12 17:16 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/arch.h, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/sb_celp.c: put + all fixed-point macros in a separate file (arch.h), some cleanup + with wideband excitation gain + +2003-11-12 07:30 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: fixed-point: + excitation gain completely converted to fixed-point + +2003-11-12 06:00 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h: fixed-point: converting excitation gain + quantization (halfway done) + +2003-11-12 05:09 jm + + * trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_uwb.c: think I've fixed the + performance problem caused by underflows. + +2003-11-11 15:51 jm + + * trunk/speex/libspeex/filters.c: oops... fixed an #ifdef that + wasn't including compute_rms when compiling with SSE support. + +2003-11-11 07:33 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: fixed-point: increased precision + of the cos approximation, fixed some floating-point/fixed-point + mismatch + +2003-11-11 04:33 jm + + * trunk/speex/libspeex/sb_celp.c: fixed-point: some wideband work + +2003-11-11 00:19 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/vq.c: fixed-point: Defined fused multiply-add + operators and some ARM assembly to use it. + +2003-11-10 19:38 jm + + * trunk/speex/libspeex/filters.c: oops... + +2003-11-10 19:28 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c: + fixed-point: integerized pi_gain, pitch prediction error + accumulation in 64 bits (should make that 32 if possible). + +2003-11-10 17:17 jm + + * trunk/speex/libspeex/filters.c: fixed-point: integerized bandwidth + expansion + +2003-11-10 08:57 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c: + fixed-point: converted lsp_enforce_margin, some assembly ARM + optimizations + +2003-11-10 06:56 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/lsp.h, + trunk/speex/libspeex/nb_celp.c: fixed-point: integerized lsp + interpolation + +2003-11-10 06:27 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/nb_celp.c: + fixed-point: scaling functions are a bit less ugly, fine exc gain + quantization now done in the linear domain and it didn't change + anything + +2003-11-09 06:20 jm + + * trunk/speex/libspeex/ltp.c: removed sqrt's that ended up not being + used in some cases in the open-loop pitch function + +2003-11-08 06:52 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/testenc.c: fixed-point: removed some float + ops in lpc_to_lsp and wrote signal scaling functions (which need + to be improved). + +2003-11-07 08:34 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/math_approx.h, + trunk/speex/libspeex/nb_celp.c: fixed-point: acos function + approximated with fixed-point arithmetic + +2003-11-06 21:35 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/testenc_uwb.c: fixed-point: some ARM work + +2003-11-06 09:14 jm + + * trunk/speex/libspeex/math_approx.c: ... + +2003-11-06 08:41 jm + + * trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/math_approx.h: fixed-point: interger version + of sqrt function + +2003-11-03 08:59 jm + + * trunk/speex/libspeex/quant_lsp.c: fixed-point: integerized lsp + weight computation + +2003-11-02 07:44 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/testenc.c: + fixed-point: added code to count MIPS + +2003-11-02 06:59 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/vq.c: fixed-point: cleanup + +2003-11-02 06:38 jm + + * trunk/speex/libspeex/lsp.c: fixed-point: removed some float ops in + the LSP root search. + +2003-11-02 05:55 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.h: ... + +2003-11-02 05:08 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/quant_lsp.c: + fixed-point: cleaned up operators, removed a couple float ops, + fixed a MULT16_16 that had a 32-bit operand in ltp.c + +2003-11-01 17:42 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/quant_lsp.c: + fixed-point: cos approximation for lsp_to_lpc, removed some float + ops in LSP quantization (more to do). + +2003-10-28 01:02 jm + + * trunk/speex/libspeex/ltp.c: fixed-point: oops... + +2003-10-28 00:57 jm + + * trunk/speex/libspeex/ltp.c: fixed-point: pitch decoder (mostly) + converted + +2003-10-27 23:05 jm + + * trunk/speex/libspeex/misc.h: fixed-point: don't cast MUL* operands + to int. Compiler should generate better code now. + +2003-10-27 22:53 jm + + * trunk/speex/libspeex/ltp.c: fixed-point: excitation and error + computation for closed-loop search mostly converted + +2003-10-27 21:43 jm + + * trunk/speex/libspeex/ltp.c: fixed-point: integerized open-loop + pitch score computation + +2003-10-24 15:01 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.h: + fixed-point: open-loop score calculation converted + +2003-10-24 06:00 jm + + * trunk/speex/libspeex/ltp.c: ... + +2003-10-09 21:33 jm + + * trunk/speex/libspeex/sb_celp.c: output saturation for wideband + +2003-10-09 20:53 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/testenc.c: + output saturation for narrowband (need to do the same for + wideband) + +2003-10-09 06:51 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/quant_lsp.c: + fixed-point: LSP quantization cleanup + +2003-10-09 03:54 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/lsp.h, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: fixed-point: LSPs are now stored + quantized + +2003-10-08 22:31 jm + + * trunk/speex/AUTHORS, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + fixed-point: QMF entirely in fixed-point now + +2003-10-08 05:12 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/smallft.c: + fixed-point: converted QMF functions + +2003-10-08 05:11 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/smallft.c: fixed-point: rounding for shifts + +2003-10-08 05:09 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/smallft.c: fixed-point: merged floating-point + and fixed-point functions (LPC and open-loop pitch), converted the + gain search of the closed-loop pitch + +2003-10-08 05:06 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/smallft.c: fixed-point: LSP quantization + work, also LSP's are now in the angle domain + +2003-10-08 05:03 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/misc.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/preprocess.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/smallft.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_jitter.h, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/testdenoise.c, + trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_uwb.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: fixed-point: converted user-visible + functions to use "short" signals, fixed (fixed-point) bug in + comb-filter. + +2003-10-08 05:01 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/smallft.c: fixed-point: replace divisions by + shifts... + +2003-10-08 04:57 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/smallft.c: fixed-point: normalization + function, some work on pitch closed-loop search + +2003-10-08 04:56 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/smallft.c: + fixed-point: pitch stuff + +2003-10-08 04:53 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/smallft.c: fixed-point: conversion of the + open-loop pitch analysis + +2003-10-08 04:52 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/smallft.c: + fixed-point: computation of rms values in fp + +2003-10-08 04:50 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/smallft.c: + fixed-point: removed some float's in innovation search + +2003-10-08 04:49 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/smallft.c: + fixed-point: some innovation search details + +2003-10-08 04:47 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/smallft.c, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: fixed-point: + most of the innovation search converted + +2003-10-08 04:45 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/smallft.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h: fixed-point: some work on innovation + quantization + +2003-10-08 04:44 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/smallft.c: fixed-point: saturation for + lsp_to_lpc, probably not the best solution + +2003-10-08 04:42 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/smallft.c: + fixed-point: more conversion to spx_sig_t + +2003-10-08 04:40 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: fixed-point: + converted all signals to spx_sig_t + +2003-10-08 04:38 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lpc.h, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/testenc.c: fixed-point: more signal scaling + again, some auto-correlation work + +2003-10-08 04:37 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/testenc.c: + fixed-point: signal scaling... again + +2003-10-08 04:36 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c: more signal scaling + +2003-10-08 04:35 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c: + fixed-point: signals scaling + +2003-10-08 04:35 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/preprocess.c, trunk/speex/libspeex/stereo.c, + trunk/speex/src/speexdec.c: fixed-point: removed pre-emphasis, + more cleanup + +2003-10-08 04:33 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/sb_celp.c: fixed-point: more LPC/LSP cleanup + +2003-10-08 04:32 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_wb.c: fixed-point: LPC/LSP cleanup + +2003-10-08 04:31 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c: fixed-point: LPC and LSP types + changed to word16 + +2003-10-08 04:30 jm + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/lpc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + fixed-point: more lpc stuff + +2003-10-08 04:29 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c: + fixed-point: lpc stuff + +2003-10-08 04:29 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/misc.h: + fixed-point work on LSP's + +2003-10-08 04:27 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lpc.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/testenc.c, trunk/speex/src/speexdec.c: first + step in fixed-point port, converted the LPC filters + +2003-10-01 22:17 jm + + * trunk/speex/libspeex/lpc.c: improved LPC analysis (mostly for very + tonal signals) + +2003-09-30 00:44 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/preprocess.c, trunk/speex/src/speexdec.c: + denoiser tuning, Solaris support, small optimization in codebook + computations. + +2003-09-18 03:58 jm + + * trunk/speex/libspeex/jitter.c, trunk/speex/libspeex/mdf.c, + trunk/speex/libspeex/preprocess.c, trunk/speex/libspeex/smallft.c: + cleaning up for 1.1 + +2003-09-18 03:46 jm + + * trunk/speex/libspeex/testenc.c: oops... + +2003-09-18 03:34 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/testdenoise.c: Added probability of speech + presence to denoiser. + +2003-09-18 01:08 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h: cleanup + +2003-09-17 21:31 jm + + * trunk/speex/libspeex/preprocess.c: made a table-lookup version + instead of approximating using pow's + +2003-09-17 17:30 jm + + * trunk/speex/libspeex/preprocess.c: some AGC tuning + +2003-09-17 04:12 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h: based the AGC adaptation + decision on the MCRA stuff. + +2003-09-17 00:15 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h: added function to update + the estimates without applying denoising + +2003-09-16 23:44 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/testdenoise.c: cleaned up stuff that was no + longer necessary. + +2003-09-16 20:41 jm + + * trunk/speex/libspeex/speex_preprocess.h: implemented MCRA noise + adaptation + +2003-09-16 20:39 jm + + * trunk/speex/libspeex/preprocess.c: added MCRA noise estimation, + fixed stupid bug in a priori SNR adaptation + +2003-09-16 19:36 jm + + * trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/testdenoise.c: added sampling rate option to + preprocessor + +2003-09-16 18:35 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/smallft.c, trunk/speex/libspeex/smallft.h, + trunk/speex/libspeex/speex_echo.h, + trunk/speex/libspeex/speex_preprocess.h: smallft.h doesn't need to + be included from the .h files anymore + +2003-09-16 17:50 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/preprocess.c, + trunk/speex/libspeex/speex_denoise.h, + trunk/speex/libspeex/speex_preprocess.h, + trunk/speex/libspeex/testdenoise.c: Renamed the 'denoiser' to + 'preprocessor', added options to enable/disable the denoiser, the + agc and the vad. + +2003-09-16 01:51 jm + + * trunk/speex/libspeex/denoise.c: prevented the AGC from causing + clipping + +2003-09-02 06:26 jm + + * trunk/speex/libspeex/testenc.c: segmental SNR estimate works + +2003-08-26 05:42 jm + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/speex_bits.h: + fixed an "off by one". Moved definition of MAX_BYTES_PER_FRAME to + the .c file. + +2003-08-24 04:28 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Allow setting the decode submode in case it's not embedded in the + stream (which you shouldn't think about unless you know what + you're doing and want to be incompatible with everyone else) + +2003-08-23 03:10 jm + + * trunk/speex/libspeex/bits.c: oops... + +2003-08-22 22:01 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + added a call telling the codec not to encode the submode in the + frame. + +2003-08-22 21:44 jm + + * trunk/speex/libspeex/bits.c: speex_bits_write now properly inserts + a terminator before copying the data + +2003-08-22 21:30 jm + + * trunk/speex/libspeex/denoise.c: cleanup: separated VAD and AGC + from the denoising (put them in different functions) and added + some comments + +2003-08-22 20:17 jm + + * trunk/speex/libspeex/mdf.c: Added some comments + +2003-08-22 05:10 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/mdf.c, + trunk/speex/libspeex/speex_denoise.h, + trunk/speex/libspeex/testdenoise.c: Coupling between the echo + canceller and the denoiser so that residual echo can be removed. + +2003-08-21 23:25 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/speex_echo.h: + first shot at dealing with cross-talk + +2003-08-21 22:39 jm + + * trunk/speex/libspeex/mdf.c: Well, it seems like implementing the + algorithm correctly helps getting good results. + +2003-08-21 04:25 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/speex_echo.h: did + some cleanup. Still some work to do with adaptation rate + adjustment and cross-talk detection. + +2003-08-19 06:07 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/speex.h: minor stuff + +2003-08-19 05:47 jm + + * trunk/speex/libspeex/mdf.c: implemented destructor + +2003-08-19 03:59 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/speex_echo.h: + added normalization. Should be roughly equivalent to NLMS. + +2003-08-18 21:52 jm + + * trunk/speex/libspeex/mdf.c, trunk/speex/libspeex/speex_echo.h: + Initial checkin of MDF-based echo canceller (still incomplete) + +2003-08-12 17:17 jm + + * trunk/speex/libspeex/denoise.c: some tuning... + +2003-08-12 05:21 jm + + * trunk/speex/libspeex/denoise.c: Fixed a couple bugs, changed the + estimator to log-amplitude (second Ephraim-Malah paper). + +2003-08-10 06:35 jm + + * trunk/speex/libspeex/sb_celp.c: oops. + +2003-08-04 17:28 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/jitter.c: + removed debug stuff + +2003-08-04 17:17 jm + + * trunk/speex/libspeex/jitter.c, + trunk/speex/libspeex/speex_jitter.h: Adaptive (though not yet) + jitter buffer. + +2003-06-13 03:59 jm + + * trunk/speex/libspeex/hexc_table.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/stack_alloc.h: minor stuff... + +2003-06-03 21:21 jm + + * trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/hexc_table.c: codebook update for lsp bug + +2003-06-03 05:29 jm + + * trunk/speex/libspeex/modes.c: oops. Fixed a bug in frame size mode + query + +2003-05-30 21:36 jm + + * trunk/speex/libspeex/sb_celp.c: new high-band lsp margins + +2003-05-30 19:44 jm + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_bits.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: implemented new + speex_bits_insert_terminator call so that the number of frames in + a packet can be automatically determined. + +2003-05-25 04:13 jm + + * trunk/speex/libspeex/denoise.c: made the VAD a bit more sensitive + +2003-05-25 03:01 jm + + * trunk/speex/libspeex/denoise.c: VAD seems to work better, though + the code is now a complete mess :( + +2003-05-22 21:57 jm + + * trunk/speex/libspeex/denoise.c: fixed some variance estimation + problems. still some work to do. + +2003-05-22 16:25 jm + + * trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/speex_denoise.h: experimental sub-bands VAD + +2003-05-21 22:16 jm + + * trunk/speex/libspeex/denoise.c: oops... + +2003-05-21 22:05 jm + + * trunk/speex/libspeex/denoise.c: made the VAD less sensitive + +2003-05-21 21:20 jm + + * trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/speex_denoise.h, + trunk/speex/libspeex/testdenoise.c: improved the VAD with a simple + Markov chain. + +2003-05-21 19:53 jm + + * trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/speex_denoise.h, + trunk/speex/libspeex/testdenoise.c: added the "speex" prefix to + the denoising stuff + +2003-05-21 18:24 jm + + * trunk/speex/libspeex/denoise.c: returning VAD results in the + denoiser + +2003-05-21 06:03 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/modes.c, + trunk/speex/win32/libspeex/libspeex.dsp: minor compilation fixes + +2003-05-20 02:46 jm + + * trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/testdenoise.c: denoiser now behaves correctly + with 240-sample frames + +2003-05-17 05:46 jm + + * trunk/speex/libspeex/lpc.c: oops. Shouldn't have removed that in + the previous update + +2003-05-16 20:41 jm + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/lpc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + Minor cleanup (who needs reflection coefficients anyway) in LPC + code. + +2003-05-14 04:37 jm + + * trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/speex_denoise.h: Basic adaptive gain control + working + +2003-05-13 20:57 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/denoise.c, + trunk/speex/libspeex/lbr_48k_tables.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.h: + Merged an experimental (and non-standard) 4.8 kbps mode. Note that + this mode is completely independent from the other modes and + cannot be used in multi-rate operation. + +2003-05-12 01:23 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/smallft.h, + trunk/speex/libspeex/speex_denoise.h: made the code OK for + inclusion with C++ files. Merge some early AGC work. + +2003-05-12 01:02 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/denoise.h, + trunk/speex/libspeex/speex_denoise.h, + trunk/speex/libspeex/testdenoise.c: renamed denoise.h to + speex_denoise.h, removed some C++-style stuff + +2003-05-09 05:28 jm + + * trunk/speex/libspeex/nb_celp.c: oops... another stupid bug + +2003-05-08 04:27 jm + + * trunk/speex/libspeex/sb_celp.c: fixed bug (found by segher) where + lsp_enforce_margin would be called on x-domain (instead of angle + domain) LSP's. + +2003-05-08 04:04 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/smallft.c, + trunk/speex/libspeex/smallft.h, + trunk/speex/libspeex/testdenoise.c: the rest of the files for the + Ephraim-Malah denoiser + +2003-05-08 03:58 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/denoise.h: + modif to only adapt noise when 3 consecutive noise frames are + detected. + +2003-05-08 03:56 jm + + * trunk/speex/libspeex/denoise.c, trunk/speex/libspeex/denoise.h: + First version of denoiser (Epic contract) using Ephraim-Malah + algorithm + +2003-05-06 01:19 jm + + * trunk/speex/libspeex/ltp.c: oops... + +2003-05-05 23:34 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexenc.c: merged + some fixes in the main branch + +2003-05-02 02:08 jm + + * trunk/speex/libspeex/filters_sse.h, + trunk/speex/libspeex/ltp_sse.h: removed multi-line strings + +2003-03-22 19:19 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/doc/manual.pdf, trunk/speex/libspeex/misc.h, + trunk/speex/src/speexdec.1, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.1, trunk/speex/src/speexenc.c: cosmetic + fixes + +2003-03-19 01:07 jm + + * trunk/speex/libspeex/filters_sse.h: gets rid of some warnings + +2003-03-18 06:13 jm + + * trunk/speex/configure.in, trunk/speex/doc/Makefile.am, + trunk/speex/doc/manual.lyx, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/sb_celp.c: minor tweaks, removed some + warnings + +2003-03-17 22:40 jm + + * trunk/speex/Speex.spec.in, trunk/speex/configure.in, + trunk/speex/doc/manual.lyx, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/math_approx.c: manual update. Made libtool + use -version-info. removed math_approx tables when not needed. + +2003-03-10 17:16 jm + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_callbacks.h: Removed some gcc warnings + +2003-03-05 17:47 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/misc.h, trunk/speex/src/speexdec.1, + trunk/speex/src/speexenc.1: version number bump + +2003-03-05 17:46 jm + + * trunk/speex/libspeex/math_approx.c: oops... + +2003-03-03 06:52 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/speex_stereo.h, trunk/speex/src/speexenc.c: + build fix for FreeBSD (gnugetopt), allow VBR without DTX + +2003-03-03 03:36 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/modes.c: some tuning + +2003-02-05 06:03 jm + + * trunk/speex/configure.in, trunk/speex/libspeex/misc.h, + trunk/speex/src/speexenc.c: version change + +2003-02-05 06:01 jm + + * trunk/speex/libspeex/exc_10_16_table.c, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/exc_20_32_table.c, + trunk/speex/libspeex/exc_8_128_table.c: Added an entry with real + zeros to remove some artifacts in some transients when the energy + is quickly rising in the middle of a frame. + +2003-01-31 01:42 jm + + * trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/exc_10_16_table.c, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/exc_20_32_table.c, + trunk/speex/libspeex/exc_5_256_table.c, + trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, + trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/lsp_tables_nb.c, trunk/speex/libspeex/misc.h: + Some cleaning up that might help with MS compilers. + +2003-01-28 08:48 jm + + * trunk/speex/libspeex/filters_sse.h, trunk/speex/src/speexenc.c: + some rc2 fixes + +2003-01-28 08:15 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, + trunk/speex/libspeex/misc.h, trunk/speex/src/speexdec.1, + trunk/speex/src/speexenc.1: Preparing for rc2 + +2003-01-28 06:52 jm + + * trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c: Gain + codebook also converted to signed char. + +2003-01-28 05:22 jm + + * trunk/speex/libspeex/quant_lsp.c: oops... + +2003-01-28 00:50 jm + + * trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/lsp_tables_nb.c, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h: LSP codebooks are now signed + short instead of float, reducing size in binary by a factor of 4. + +2003-01-28 00:02 jm + + * trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/quant_lsp.c: Quantization for high-band LSP + codebook. + +2003-01-27 22:09 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/lsp_tables_nb.c, + trunk/speex/libspeex/quant_lsp.c: Some work for shrinking the LSP + codebook size + +2003-01-27 08:31 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/exc_10_16_table.c, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/exc_20_32_table.c, + trunk/speex/libspeex/exc_5_256_table.c, + trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/exc_8_256_table.c, + trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/hexc_table.c, trunk/speex/libspeex/modes.c: + Transformed all excitation codebooks into sighed short arrays, + reducing their size (in the final binary) by a factor of 4. + +2003-01-25 05:45 jm + + * trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, trunk/speex/libspeex/ltp.c: + Shrunk the pitch gain codebook by removing redundent data. + +2003-01-23 07:29 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_header.h: Fixed a bunch of typos + pointed to by: larry@doolittle.boa.org + +2003-01-17 05:15 jm + + * trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h, + trunk/speex/src/speexdec.c: oops... last minute fixes + +2003-01-15 07:51 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/vbr.c: oops... + I broke the 6 kbps mode. it's fixed now. + +2003-01-15 07:20 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/vbr.c: adjusted VBR for the new 4 kbps mode + (still early stage) + +2003-01-15 06:47 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/exc_20_32_table.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c: Added a new 3.95 kbps mode + +2003-01-13 22:29 jm + + * trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, trunk/speex/src/speexdec.c: + slightly changed the header format (still compatible) + +2003-01-11 01:32 jm + + * trunk/speex/libspeex/speex_header.c: oops... + +2003-01-11 01:24 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/speex_header.h, + trunk/speex/src/speexdec.1, trunk/speex/src/speexenc.1: misc. + +2003-01-10 07:27 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/vbr.c, trunk/speex/src/speexdec.c: mostly + wideband tuning... + +2003-01-09 16:30 jm + + * trunk/speex/libspeex/bits.c: Fixed (I think) potential overflow in + Speex Bits + +2003-01-08 21:59 jm + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/src/speexdec.c: Added a return value (error) to the + *ctl functions, added re-allocation to SpeexBits when buffer is + too small. + +2003-01-08 06:57 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.h: Fixed some bad + DTX/packet-loss/wideband interactions. + +2003-01-07 04:30 jm + + * trunk/speex/libspeex/misc.c, trunk/speex/libspeex/misc.h: oops! + stupid bug + +2003-01-07 04:11 jm + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex_bits.h, + trunk/speex/src/speexdec.c: Added some bounds checking when + reading bits, including a bug when forcing higher bit-rates + (force-wb on a narrowband stream). Some cleaning up too. + +2003-01-06 22:06 jm + + * trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Some stereo enhancements + +2003-01-06 20:43 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexdec.c: Used + the last 4 bits of mode1 for a CNG flag, plus some cleanup, bugfix + +2003-01-06 08:35 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + Cleaned up mem allocation in sb_celp.c like in nb_celp.c + +2003-01-06 06:53 jm + + * trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/stack_alloc.h: Replaced all the alloc's by + one big memory allocation for a whole state + +2003-01-06 05:56 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/stack_alloc.h: Think I made the stack + operations more portable in case sizeof(int) != sizeof(void*) + +2003-01-06 04:18 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_header.c: cleanup: all use of libc has + been moved to misc.c to make porting easier. + +2003-01-05 08:46 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/nb_celp.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wav_io.c: fixed some bugs in wave input: should + now handle extra chunks as well as extended "fmt " chunks. Also, + fixed a bug in invalid comment handling. + +2002-12-31 06:07 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/speex_stereo.h: documentation update + +2002-12-31 03:25 jm + + * trunk/speex/libspeex/sb_celp.c: Fixed a segfault in + wideband/ultra-wideband decoding when a packet is lost while in + NULL mode. + +2002-12-20 19:51 jm + + * trunk/speex/libspeex/nb_celp.c: removed debug printf... + +2002-12-20 17:45 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/vbr.c: + Allowed CNG in VBR mode + +2002-12-20 08:24 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/doc/manual.pdf, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/src/speexdec.1, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.1, + trunk/speex/src/speexenc.c: misc stuff for beta4 + +2002-12-20 07:16 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h: Improvements to the perceptual + enhancement code: smoother pitch comb filter, better tuning, and a + stupid bugfix (gain hard-coded to .5). + +2002-12-20 05:20 jm + + * trunk/speex/TODO, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/vbr.c, trunk/speex/src/speexdec.c: Think DTX + now works for wideband too + +2002-12-19 08:21 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h: + Started work on discontinuous transmission (DTX) + +2002-12-19 04:07 jm + + * trunk/speex/libspeex/lsp.c: Oops... this bug was found by Ming Wu + + +2002-12-15 06:45 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + ABR seems to work for wideband too... + +2002-12-15 06:01 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/src/speexenc.c: Average bit-rate (ABR) now seems to + work good for narrowband (no wideband yet, but shouldn't be hard) + +2002-12-15 04:45 jm + + * trunk/speex/libspeex/vq.c: Patch by Bernard Blackham + that speeds up the VQ N-best search. Can + reach up to 10-15% speed improvement on higher complexity + settings. + +2002-12-14 06:29 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/speex.h: More + ABR work... + +2002-12-13 22:59 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c: Starting (still incomplete) + average bit-rate (ABR) implementation + +2002-12-13 01:47 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: VAD should now work on wideband + too. + +2002-12-12 07:51 jm + + * trunk/speex/TODO, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/vbr.c, trunk/speex/src/speexenc.c: + Implemented VAD-only mode with comfort noise generation, did some + tuning to the VAD too. Next thing: adapt VAD-only to work with + wideband too. + +2002-12-12 03:28 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: First shot at high-band perceptual + enhancement + +2002-12-11 22:03 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/vbr.c: + Improvements to the way silence is handled in VBR. + +2002-12-11 08:24 jm + + * trunk/speex/libspeex/nb_celp.c: More 2.15 kbps tuning, improved + open-loop pitch estimation (less pitch doubling) + +2002-12-11 06:49 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h: + Big (hopefully) improvement in quality for the 2.15 kbps mode + (better excitation). + +2002-12-02 00:12 jm + + * trunk/speex/TODO, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h: + Implemented SPEEX_RESET_STATE and reduced memory allocation size. + +2002-11-30 05:24 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h: + Ultra-wideband VBR seems to work. Also, fixed a bug for wideband + VBR. + +2002-11-28 06:32 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h: Many improvements (hopefully) to + packet loss concealing, part of it from a patch sent by Guilhem + Tardy. + +2002-11-27 20:36 jm + + * trunk/speex/TODO, trunk/speex/libspeex/sb_celp.c: ... + +2002-11-27 05:22 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + wideband VBR seems to (almost) work. Need to adapt it to work on + ultra- wideband too. + +2002-11-27 02:54 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h: ... + +2002-11-15 06:26 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/vbr.c: Fixed a bug in the VBR analyzer, + trying to re-tune it... also, started implementing VBR for + wideband (still a big kludge for now). + +2002-11-14 04:49 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/stereo.c, trunk/speex/libspeex/vbr.c: Fixed + bugs in stereo and zero-mode and did some VBR tuning... it's + looking good. + +2002-11-14 00:51 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h: Trying a new VBR implementation... + still experimental + +2002-11-11 06:05 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/doc/manual.pdf, + trunk/speex/libspeex/speex_header.h, + trunk/speex/libspeex/speex_stereo.h, trunk/speex/src/speexdec.1, + trunk/speex/src/speexdec.c: Last updates (hopefully) for beta 3. + +2002-11-11 01:08 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/src/speexdec.1, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.1, trunk/speex/src/speexenc.c: Misc stuff + for beta 3 + +2002-11-10 05:17 jm + + * trunk/speex/Speex.spec.in, trunk/speex/configure.in, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Update for non-standard (not 8,16,32 + kHz) sampling rates, changed package name from "Speex" to "speex" + (removed capital S) and moved doc to the devel package. + +2002-11-09 06:00 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/sb_celp.c, + trunk/speex/src/speexdec.1, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.1, trunk/speex/src/speexenc.c, + trunk/speex/win32/libspeex/libspeex.dsp: Preparing for beta 3, + cleaned up the mode/bit-rate code in speexdec, updated the help + and man pages, updated MSVC project. + +2002-11-08 05:58 jm + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexenc.c: Some + temporary kludging to make ultra-wideband work... + +2002-11-08 05:00 jm + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c: + Fixed a couple stupid bugs + +2002-11-07 22:13 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Implemented stereo at the decoder side + +2002-11-07 06:10 jm + + * trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/stereo.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wav_io.c: First stereo support in encoder (might + be buggy), not in decoder yet. + +2002-11-06 21:27 jm + + * trunk/speex/TODO, trunk/speex/libspeex/lsp.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Misc. + cosmetic stuff + +2002-11-06 01:47 jm + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/lpc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Prevents a symbol name clash with the G729 version used by + OpenH323 + +2002-11-05 15:57 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/speex_stereo.h, + trunk/speex/libspeex/stereo.c: before my laptop drops dead... :( + +2002-11-04 03:00 jm + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc_uwb.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wav_io.c: Integrated "ultra-wideband" with + encoder/decoder. + +2002-11-02 15:27 jm + + * trunk/speex/libspeex/nb_celp.c: To make the OpenH323 people happy + (warning on Win32) + +2002-11-02 06:25 jm + + * trunk/speex/libspeex/sb_celp.c: Think I fixed the "ultra-wideband" + gain problem + +2002-11-02 06:08 jm + + * trunk/speex/libspeex/cb_search.c: Stupid bug :-< + +2002-11-01 03:50 jm + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexenc.c: VBR + quality is now a float parameter + +2002-10-30 22:12 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/math_approx.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc_uwb.c: Wideband code cleanup, first + shot at an "ultra-wideband" mode at 32 kHz, but still buggy. + +2002-10-30 20:27 jm + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/math_approx.c, + trunk/speex/libspeex/math_approx.h, + trunk/speex/libspeex/nb_celp.c: New cos approximation for slow + CPU's (don't use it on x86) + +2002-10-27 06:01 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp_sse.h, + trunk/speex/libspeex/misc.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Made the + code valid for a C++ compiler (void* stuff), plus some cleanup + +2002-10-27 02:59 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/stack_alloc.h, + trunk/speex/libspeex/testenc_wb.c: The temp stack is now void* + instead of float* + +2002-10-27 02:36 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/stack_alloc.h: ... + +2002-10-26 19:16 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/stack_alloc.h: Stack allocation cleanup... + +2002-10-26 04:51 jm + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/misc.h, trunk/speex/src/speexdec.c: Getting + ready for beta2 + +2002-10-26 04:37 jm + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters_sse.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp_sse.h: Added SSE support (gcc only) by + defining _USE_SSE + +2002-10-26 02:58 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: QMF optimizations by segher + +2002-10-25 04:11 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/nb_celp.c: Code cleanup + +2002-10-24 06:29 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c: Decoder optimizations, mostly when + perceptual enhancement is off. + +2002-10-24 03:59 jm + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c: More + cleanups, do something more intelligent with LPC->LSP + +2002-10-23 19:06 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c: fixed a double_codebook bug and + prevented pitch from doing weird things in VBR mode when the last + frame was vocoded. + +2002-10-23 16:35 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Compute impulse response of "perceptual synthesis filter" globally + and use it in pitch prediction to reduce some calculations. + +2002-10-23 06:24 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/nb_celp.c: + Continuing cleanup, removed unused functions, ... + +2002-10-23 06:10 jm + + * trunk/speex/libspeex/filters.c: ... + +2002-10-23 06:03 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/sb_celp.c: Merged split_cb_search_nogain and + split_cb_search_shape_sign so there's now only one search function + with an option to search for a sign or not. + +2002-10-23 05:18 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h: Re-wrote the signed search to be like + the unsigned one (should make them use the same code now) + +2002-10-23 02:56 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/sb_celp.c: Modified QMF filters so we don't + calculate useless (zeros) values. + +2002-10-23 00:53 jm + + * trunk/speex/libspeex/cb_search.c: Removed un-necessary copies and + re-ordered some calculations to make them faster. + +2002-10-22 19:29 jm + + * trunk/speex/libspeex/nb_celp.c: Prevents useless calculation of + perceptually-weighted frame + +2002-10-22 19:14 jm + + * trunk/speex/libspeex/nb_celp.c: Don't compute open-loop pitch when + mode has a per-subframe pitch and VBR is not used. This gains a + bit of CPU. + +2002-10-22 03:22 jm + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/stack_alloc.h: Slight optimization to the way + the target is updated in the search. Also fixed the stack PUSH. + +2002-10-22 01:50 jm + + * trunk/speex/libspeex/stack_alloc.h: oops... there was a bug in + PUSH (don't know what yet) + +2002-10-21 20:39 jm + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/stack_alloc.h, + trunk/speex/libspeex/testenc.c: Filter optimizations, cleanup, + removed the stack POP to simplify things and prevent errors + +2002-10-20 23:56 jm + + * trunk/speex/libspeex/nb_celp.c: Separated the enhanced LPC filter + in 2 + +2002-10-20 21:11 jm + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h: + Big cleanup, removed Direct-Form I filters + +2002-10-11 03:44 jm + + * trunk/speex/libspeex/ltp.c, trunk/speex/src/wave_out.c, + trunk/speex/src/wave_out.h: ... + +2002-10-11 03:39 jm + + * trunk/speex/COPYING, trunk/speex/Speex.spec.in, trunk/speex/TODO, + trunk/speex/libspeex/bits.c, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lpc.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, + trunk/speex/libspeex/stack_alloc.h, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c, trunk/speex/src/wav_io.c, + trunk/speex/src/wav_io.h: Changed license to BSD + +2002-10-10 04:49 jm + + * trunk/speex/Speex.spec.in, trunk/speex/libspeex/speex_callbacks.h: + Put manual in the right place + +2002-10-03 04:00 jmvalin + + * trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_callbacks.h, + trunk/speex/libspeex/testenc.c: Most of the request/callback + mechanism is implemented, not completely tested yet. + +2002-10-02 22:49 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_callbacks.h: First version of in-band + signalling and user callbacks + +2002-10-02 19:52 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_callbacks.c, + trunk/speex/libspeex/speex_callbacks.h: adding in-band signalling + and callback handling + +2002-10-02 04:24 jmvalin + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h: + Fixed (hopefully) once and for all the LSP root-finding problem. + We now try twice and if it still fails, we "create" a flat filter. + +2002-09-20 17:14 jmvalin + + * trunk/speex/TODO, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h: + ... + +2002-09-20 03:37 jmvalin + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c: Converted filters with memory to + direct form II transposed, this creates a "minor + incompatibility"... + +2002-09-18 22:01 jmvalin + + * trunk/speex/TODO, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/nb_celp.c, trunk/speex/src/speexdec.c: packet + loss handling... + +2002-09-18 07:35 jmvalin + + * trunk/speex/libspeex/ltp.c: Fixed a bug in the pitch_gain return + value (make all _unquant functions return a 3-tap gain) + +2002-09-13 20:08 jmvalin + + * trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_header.h: Doxygen... + +2002-09-12 15:11 jmvalin + + * trunk/speex/libspeex/speex_bits.h: Doxygen... + +2002-09-12 14:55 jmvalin + + * trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/speex.h: + Doxygen... + +2002-09-12 03:31 jmvalin + + * trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_header.h: More Doxygen doc + +2002-09-12 02:48 jmvalin + + * trunk/speex/Doxyfile, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_header.h: Comments for Doxygen + +2002-08-30 14:31 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/testenc.c: ... + +2002-08-30 04:04 jmvalin + + * trunk/speex/libspeex/misc.h: Just in case someone forgets to + define VERSION + +2002-08-27 20:57 jmvalin + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/src/speexdec.c: Moved + modeID check in nb_celp/sb_celp + +2002-08-27 07:29 jmvalin + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: speeded up lpc_to_lsp and + open-loop pitch estimation + +2002-08-22 21:17 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/getopt.c, trunk/speex/src/getopt1.c, + trunk/speex/src/speexdec.c: API change: a couple fields were + removed from SpeexMode because they can now be accessed through + the speex_mode_query call. Also, the "lost" argument has been + removed from speex_decode since a lost packet is now specified as + a NULL "bits" argument. + +2002-08-22 20:47 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.h: Added + query function for modes Support for modes > 7 at decoder + +2002-08-22 17:58 jmvalin + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/cb_search.c, trunk/speex/src/getopt.c, + trunk/speex/src/getopt.h, trunk/speex/src/getopt1.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wave_out.c, trunk/speex/src/wave_out.h, + trunk/speex/win32, trunk/speex/win32/libspeex, + trunk/speex/win32/libspeex/libspeex.dsp, + trunk/speex/win32/libspeex/libspeex.dsw, + trunk/speex/win32/speexdec, + trunk/speex/win32/speexdec/speexdec.dsp, + trunk/speex/win32/speexdec/speexdec.dsw, + trunk/speex/win32/speexenc, + trunk/speex/win32/speexenc/speexenc.dsp, + trunk/speex/win32/speexenc/speexenc.dsw: Win32 support, thanks to + john33 (Hydrogen Audio) + +2002-08-22 06:33 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c: Implemented packet loss + interpolation for wideband... not optimal yet... + +2002-08-22 05:49 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/testenc.c: The decode function can now do the + packet loss interpolation without the last bit-stream received... + for narrowband. Next: wideband. + +2002-08-22 05:07 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_bits.h: New very high quality modes for + narrowband and wideband by using a double codebook + +2002-08-16 18:24 jmvalin + + * trunk/speex/libspeex/sb_celp.c: Changed wideband quality mode to + adapt to better high-band spectral folding + +2002-08-16 07:08 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c: stupid VBR bug corrected + + improvements + +2002-08-16 06:02 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_wb.c: Improved spectral folding + wideband mode + +2002-08-15 20:08 jmvalin + + * trunk/speex/libspeex/cb_search.c: oops... + +2002-08-14 20:19 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c: + Cleaned up vocoder mode... + +2002-08-14 17:58 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex_bits.h: + Now the narrowband and wideband bit-streams are compatible and can + be decoded in either mode + +2002-08-13 21:11 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/speex_bits.h: + Make sure we don't destroy user buffer when SpeexBits is + destructed + +2002-08-13 20:58 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/testenc_wb.c: ... + +2002-08-08 20:53 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c: + Reduced number of bits to code subframe excitation gain on low + modes + +2002-08-02 14:39 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + removed debugging code + +2002-08-02 05:46 jmvalin + + * trunk/speex/libspeex/modes.c: Enhancer tuning... + +2002-08-02 04:00 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/configure.in, + trunk/speex/doc/manual.lyx, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Bug fixes, many leaks/errors fixed + thanks to valgrind. Some filter roundoff improvement kludge for + enhancer... + +2002-08-01 19:58 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Implemented "null mode", i.e. silence. Only submodeID is + transmitted + +2002-08-01 15:14 jmvalin + + * trunk/speex/libspeex/nb_celp.c: oops:-( + +2002-08-01 14:48 jmvalin + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/testenc.c: + oops... forgot to remove some useless stuff + +2002-08-01 14:45 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/post_filter.h, trunk/speex/libspeex/roots.c, + trunk/speex/libspeex/roots.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c: + Replaced the post-filter by a simple pitch comb filter plus an LPC + synthesis filter enhancer. + +2002-07-31 22:30 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Added + bit-rate information via speex_*_ctl calls, fixed stupid bug in + speexenc + +2002-07-30 06:03 jmvalin + + * trunk/speex/libspeex/filters.c: Think I got rid of all the + problems when the roots are wrong... + +2002-07-30 04:43 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_header.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: Fixed + post-filter producing NaN's, started writing some SSE code + +2002-07-29 04:38 jmvalin + + * trunk/speex/configure.in, trunk/speex/doc/manual.lyx, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/roots.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc.c, + trunk/speex/src/speexenc.c: added encoder complexity option + +2002-07-28 04:09 jmvalin + + * trunk/speex/doc/manual.lyx, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Allow more than one frame per packet + +2002-07-22 05:44 jmvalin + + * trunk/speex/libspeex/misc.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Replaced memmove by speex_move + +2002-07-22 04:46 jmvalin + + * trunk/speex/libspeex/misc.c, trunk/speex/libspeex/misc.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_header.c: Replaced all + malloc/calloc/free calls by speex_alloc/speex_free to ease + portability + +2002-07-20 04:58 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h: Implemented new "global" search + for the whole sub-frame, slight improvement over the regular + search, but it comes with increased CPU requirement. + +2002-07-20 02:27 jmvalin + + * trunk/speex/libspeex/cb_search.c: Removed redundent searches + +2002-07-20 02:08 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/vq.c, + trunk/speex/libspeex/vq.h: Added an n-best VQ search function in + order to simplify the code + +2002-07-19 19:21 jmvalin + + * trunk/speex/libspeex/filters.c: work around a convergence problem + in ploy_roots + +2002-07-19 18:48 jmvalin + + * trunk/speex/libspeex/filters.c, trunk/speex/libspeex/ltp.c: Fixed + a root stability bug... + +2002-07-19 18:15 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c: Fixed a pitch prediction bug when + pitch is forced (end=start) + +2002-07-18 22:55 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/exc_10_16_table.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/roots.c: Improved very low bit-rate (~5.9 + kbps) mode + +2002-07-17 06:35 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/configure.in, + trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/post_filter.c, trunk/speex/libspeex/roots.c, + trunk/speex/libspeex/roots.h: New post-filter based on a new way + of moving poles in the LPC polynomial + +2002-07-16 14:44 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/testenc_wb.c: + cleanup + +2002-07-11 06:10 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/libspeex/vbr.c, trunk/speex/src/speexenc.c: Completed + VBR for 0.5.0 release + +2002-07-10 20:45 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vbr.c: + More VBR work. Also added a 5.5 kbps mode and added frame-wide + pitch to comfort noise mode (now at 2.3 kbps). + +2002-07-08 18:06 jmvalin + + * trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h: Added + noise energy estimation and beginning of a VAD. + +2002-07-07 07:30 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/vbr.c, trunk/speex/libspeex/vbr.h: Improved + VBR by adding pitch and some constraints... + +2002-07-07 03:27 jmvalin + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/lpc.h, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/lsp.h: + license/header stuff + +2002-07-06 05:30 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h: Cleanup Put mode decision before + open-loops analysis Open-loop pitch analysis returns pitch "pseudo + gain" (bound to [0,1]) + +2002-07-05 16:01 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/lsp.h, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: code cleanup + +2002-07-05 06:51 jmvalin + + * trunk/speex/libspeex/modes.c: Played slightly with bit-rates... + +2002-07-04 21:55 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c: Trained some codebooks... + +2002-07-02 05:14 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/exc_5_256_table.c, + trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/gain_table_lbr.c, + trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/lsp_tables_nb.c, + trunk/speex/libspeex/lsp_tables_wb.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h: Cleaned up unused stuff and + licensed all codebooks under the BSD license + +2002-07-01 08:18 jmvalin + + * trunk/speex/libspeex/post_filter.c: Comments... + +2002-07-01 08:10 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h: First try at VBR... off by default + +2002-06-28 19:01 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/speex.h: Just + some cleanup and comments. + +2002-06-27 16:33 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexdec.c: + Oops... + +2002-06-27 07:23 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Created quality modes for wideband, + updated encoder. Getting close to 0.4.0 + +2002-06-26 20:59 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Added a comfort noise mode... + +2002-06-26 06:23 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/exc_8_128_table.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c: + Added narrowband mode at 11.75 kbps + +2002-06-25 18:46 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: First step + to variable bit-rate (VBR): it is now possible to change the modes + (bit-rate) of the encoder dynamically (decoder adjusts itself). + +2002-06-21 19:38 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/speex_header.h, trunk/speex/src/speexdec.c: + Improved (I think) quality in presence of packet loss... + +2002-06-18 21:22 jmvalin + + * trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + s/hanning/hamming/ for analysis window provides a slight + improvement + +2002-06-18 18:28 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/sb_celp.c: + Changed the LPC analysis window to an asymetric (pseudo-)Hanning + window so the lookahead necesary is now only 10 ms, making the + total algorithmic delay 30 ms (down from 40 ms). + +2002-06-17 07:14 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/sb_celp.c: ... + +2002-06-17 06:47 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/hexc_10_32_table.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.h, + trunk/speex/src/speexenc.c: New "low bit-rate" wideband mode + (20150 kbps) + +2002-06-13 05:12 jmvalin + + * trunk/speex/libspeex/sb_celp.c: folding mode is a bit better... + +2002-06-12 21:33 jmvalin + + * trunk/speex/Makefile.am, trunk/speex/configure.in, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.h, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c, + trunk/speex/src/wav_io.c: Speex *should* now work on big-endian + architectures. + +2002-06-12 08:33 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h, + trunk/speex/libspeex/testenc.c: Introduced bit-stream version + number (for compatibility) + +2002-06-12 06:39 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h: More header work + +2002-06-12 05:15 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/misc.c, + trunk/speex/libspeex/misc.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_header.c, + trunk/speex/libspeex/speex_header.h: Header work... + +2002-06-11 08:34 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/modes.c: + oops... + +2002-06-11 08:27 jmvalin + + * trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/gain_table_lbr.c, + trunk/speex/libspeex/modes.c: low bit-rate codebooks optimized + +2002-06-11 06:08 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/exc_10_32_table.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_header.h: Added low bit-rate (8 kbps) + narrowband mode. It is still sub-optimal but at least it seems to + work... + +2002-06-10 08:25 jmvalin + + * trunk/speex/libspeex/gain_table.c, trunk/speex/libspeex/ltp.c: + codebook retrained (again) + +2002-06-10 07:50 jmvalin + + * trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/gain_table.c: Codebooks retrained about 0.3 + dB in SNR + +2002-06-07 21:57 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/testenc.c: Implemented an n-best open-loop + pitch search to speed up the closed-loop search. Also fixed a bug + in open-loop pitch estimation. Some cleanup too as well as + PUSH/POP matching. + +2002-06-07 05:30 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/configure.in, + trunk/speex/libspeex/testenc_wb.c: Getting ready for 0.2.0 + +2002-06-07 05:11 jmvalin + + * trunk/speex/libspeex/sb_celp.c: Oops... screwed up in the order + +2002-06-07 04:55 jmvalin + + * trunk/speex/libspeex/sb_celp.c: Make sure the filters are always + stable in the LSP domain + +2002-06-07 04:30 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/hexc_table.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/sb_celp.c: Removed some warnings, fixed + posfilter mode for wideband + +2002-06-07 03:20 jmvalin + + * trunk/speex/doc/programming.html, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/hexc_table.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/testenc_wb.c: High-band (for wideband) is now + a shape-sign codebook, reducing search by a factor two + +2002-06-06 22:18 jmvalin + + * trunk/speex/libspeex/exc_5_256_table.c: Retrained (optimized) + codebook + +2002-06-06 22:08 jmvalin + + * trunk/speex/libspeex/exc_5_64_table.c: ... + +2002-06-06 19:12 jmvalin + + * trunk/speex/libspeex/exc_5_64_table.c: retrained the codebook + +2002-06-06 06:32 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/post_filter.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c: + New post-filter A(z/g1)/A(z/g2) + +2002-06-06 04:04 jmvalin + + * trunk/speex/libspeex/ltp.c: Fixed a bug allowing the pitch to be + larger than the maximum allowed (hence screwing up at the decoder) + +2002-06-05 06:07 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/speex_header.h, trunk/speex/src/Makefile.am, + trunk/speex/src/speexenc.c, trunk/speex/src/wav_io.c: Encoder now + understands wav files, slight modif to LSP quantization weighting + +2002-06-05 02:56 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/configure.in, + trunk/speex/html/index.html, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/nb_celp.c: + Constrain LSP's to produce a stable filter + +2002-06-04 04:10 jmvalin + + * trunk/speex/Speex.spec, trunk/speex/libspeex/nb_celp.c, + trunk/speex/src/speexdec.c: Last modifs for 0.1.2 + +2002-06-03 14:48 jmvalin + + * trunk/speex/libspeex/post_filter.h: ... + +2002-06-03 02:54 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Added + SPEEX_GET_FRAME_SIZE to speex_*_ctl calls + +2002-06-03 02:14 jmvalin + + * trunk/speex/OPTIMIZE, trunk/speex/Speex.spec, + trunk/speex/Speex.spec.in, trunk/speex/configure.in, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c: Added speex_ctl call to set codec + parameters (e.g. enable/disable post-filter) + +2002-06-03 00:51 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/post_filter.h: "unified" narrowband and + wideband post-filters + +2002-05-29 03:41 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/post_filter.c, + trunk/speex/libspeex/post_filter.h: Added a post-filter for + narrowband (and thus 0-4 kHz in wideband) + +2002-05-21 21:49 jmvalin + + * trunk/speex/html/index.html, trunk/speex/html/speex.png, + trunk/speex/html/speex.xcf, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/src/speexdec.c: Documentation, cleanup, comments + +2002-05-21 02:12 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_bits.h: API documentation + +2002-05-20 18:53 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Every + symbol in now has a speex_ prefix. + +2002-05-18 20:00 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/nb_celp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/speex_bits.h, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: FrameBits renamed to SpeexBits and a + "lost" argument was added to the decode function to handle lost + packets + +2002-05-16 19:16 jmvalin + + * trunk/speex/README, trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/sb_celp.c: Wideband quantization improved by + adding a sub-frame gain, codebook re-trained. + +2002-05-15 21:47 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/modes.c, trunk/speex/src/Makefile.am, + trunk/speex/src/speexenc.c: Removed narrowband 256x8 codebook from + build. + +2002-05-14 21:58 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/nb_celp.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: speexenc + and speexdec now use the Ogg bitstream. This is very preliminary + there are probably a couple dozens of bugs... + +2002-05-14 14:21 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_wb.c: ... + +2002-05-14 04:08 jmvalin + + * trunk/speex/libspeex/hexc_table.c: shouldn't have been deleted... + +2002-05-14 03:25 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/exc_5_256_table.c, + trunk/speex/libspeex/exc_5_64_table.c, + trunk/speex/libspeex/exc_8_256_table.c, + trunk/speex/libspeex/exc_gains_table.c, + trunk/speex/libspeex/exc_gains_wb2_table.c, + trunk/speex/libspeex/exc_gains_wb_table.c, + trunk/speex/libspeex/exc_sb_table.c, + trunk/speex/libspeex/exc_table.c, + trunk/speex/libspeex/exc_wb_table.c, + trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/lsp_tables_nb.c, + trunk/speex/libspeex/matrix.c, trunk/speex/libspeex/matrix.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/mpulse.h, trunk/speex/libspeex/nb_celp.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/stoc.c, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Big changes in both narrowband and + wideband. Retrained LSP codebook, replaced pseudo-multi-pulse by + split codebook (no gain) for narrowband. Changed gain-shape + approach to gain-only split-VQ for wideband. Wideband bit-rate + goes down (31.3 kbps to 26.9 kbps). Narrowband is about the same + (now 15.1 kbps). + +2002-05-09 03:55 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_modes.h: Last cleanup for 0.0.3 + +2002-05-07 19:51 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h: More comments + +2002-05-06 21:12 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + Finished cleaning up the sub-band mode + +2002-05-06 18:53 jmvalin + + * trunk/speex/libspeex/speex.h: Oops... forgot to add that + +2002-05-03 19:27 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Now, all the includes we need to use + Speex are speex.h and speex_bits.h + +2002-05-03 19:22 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/nb_celp.c, trunk/speex/libspeex/nb_celp.h, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: speex.[ch] + renamed to nb_celp.[ch] for consistency + +2002-05-03 19:13 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/bits.h, trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/mpulse.h, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_bits.h, + trunk/speex/libspeex/speex_modes.h: bits.h was renamed to + speex_bits to prevent name clashes + +2002-05-03 19:05 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex_modes.h: First part of VBR: High-band + excitation is coded or folded from low-band + +2002-05-02 22:36 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/sb_celp.c: fixed + two FIXME's + +2002-05-02 22:28 jmvalin + + * trunk/speex/TODO, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c: + implemented high-band spectral folding at the decoder + +2002-05-02 20:55 jmvalin + + * trunk/speex/libspeex/testdec.c: *** empty log message *** + +2002-05-02 20:55 jmvalin + + * trunk/speex/TODO, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/speex_modes.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_sb.c, + trunk/speex/libspeex/testenc_wb.c, trunk/speex/libspeex/vbr.h, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: + Unification of narrowband and wideband modes to simplify the API + +2002-04-29 22:45 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: Added simple (optional) + post-filter + +2002-04-29 11:12 jmvalin + + * trunk/speex/libspeex/cb_search.c: removed unused variable + +2002-04-29 09:59 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_sb.c: Decoder back in sync with the + encoder + +2002-04-24 21:53 jmvalin + + * trunk/speex/libspeex/ltp.c: pitch search now considers two ranges: + start < T < subframe and subframe < T < end + +2002-04-24 07:26 jmvalin + + * trunk/speex/libspeex/hexc_table.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: + Updated high-band codebook... + +2002-04-24 06:50 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/speex.c: Made the initial pitch search + open-loop. Removed some modulo and devide operations. + +2002-04-23 21:18 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c: + Fixed warnings + +2002-04-23 08:12 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/hexc_table.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/mpulse.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc_sb.c: + Many, many updates. Better split-VQ search, better handling of + pitch for periods shorter than subframe length. Slightly improved + multi-pulse search. + +2002-04-15 05:04 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/testenc_sb.c, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Moving on + for 0.0.2, updated the "real" encoder and decoder (speexenc, + speexdec). Fixed a memory leak. + +2002-04-14 04:05 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c: Got + rid of a couple mallocs... + +2002-04-12 22:58 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc_sb.c: Removed warnings, debug code + and un-necessary synthesis in coder + +2002-04-12 22:15 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c: + Speed improvements (got rid of a couple divide ops), cleanup... + +2002-04-12 05:58 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c: + Speed improvements: faster FIR filter and better algorithm for + updating target in split-codebook search. + +2002-04-10 20:57 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/testenc_sb.c: + Big code cleanup, some minor bug fixed too + +2002-04-10 07:42 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/vbr.c, + trunk/speex/libspeex/vbr.h: ... + +2002-04-10 05:46 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c: Think both encoder and decoder for + SB-CELP work... + +2002-04-09 23:33 jmvalin + + * trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc_sb.c: decoder stuff + +2002-04-09 08:08 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_sb.c: SB-CELP decoder (continued) + +2002-04-09 07:48 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/testenc_sb.c: SB-CELP work... more to go + +2002-04-09 07:23 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: More decoder work + +2002-04-09 06:44 jmvalin + + * trunk/speex/libspeex/sb_celp.c: Fixed a bug in the gain + quantization (it's now done in the log domain) + +2002-04-09 05:15 jmvalin + + * trunk/speex/libspeex/sb_celp.c: Fully quantized test encoder for + SB-CELP at (currently) 31.3 kbps. + +2002-04-09 02:20 jmvalin + + * trunk/speex/libspeex/testenc_sb.c: Test encoder for SB-CELP + +2002-04-08 23:01 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Quantizing high-band excitation + gains (SB-CELP). + +2002-04-08 19:08 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/high_lsp_tables.c, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/sb_celp.c: + Added LSP quantization for SB-CELP + +2002-04-08 06:26 jmvalin + + * trunk/speex/html/index.html, trunk/speex/libspeex/cb_search.c: + Removed useless stuff + +2002-04-08 06:23 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, + trunk/speex/libspeex/exc_sb_table.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/mpulse.c, trunk/speex/libspeex/mpulse.h, + trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h, + trunk/speex/libspeex/speex.c: Re-wrote the gain quantization for + split-VQ excitation. Added more bits and quantize one at a time. + +2002-04-05 19:51 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/speex.c: Cleaned up SB-CELP and added more + pulses and tracks for low-band. + +2002-04-04 23:36 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + Fixed interpolation bugs, ... + +2002-04-04 21:22 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h: Using spectral folding (ie + aliasing) for high-band excitation + +2002-04-03 05:02 jmvalin + + * trunk/speex/libspeex/sb_celp.c: ... + +2002-04-03 00:01 jmvalin + + * trunk/speex/libspeex/sb_celp.c, trunk/speex/libspeex/sb_celp.h: + more sub-band stuff... + +2002-04-02 22:58 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/sb_celp.c, + trunk/speex/libspeex/sb_celp.h, trunk/speex/libspeex/testenc.c, + trunk/speex/libspeex/testenc_wb.c: Adding sub-band CELP (SB-CELP) + -like encoding. Still incomplete. + +2002-03-27 22:36 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/mpulse.c: + code cleanup, some optimizations + +2002-03-27 21:16 jmvalin + + * trunk/speex/ChangeLog, trunk/speex/INSTALL, trunk/speex/README, + trunk/speex/TODO, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/speex.c, + trunk/speex/src/speexdec.c: All debug printf's are now within + #ifdef DEBUG + +2002-03-27 06:53 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/bits.h, + trunk/speex/src/speexdec.c, trunk/speex/src/speexenc.c: Added a + header to speex files. Should eventually choose a "real" magic + number for the format. + +2002-03-27 06:30 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/bits.h, + trunk/speex/src/Makefile.am, trunk/speex/src/speexdec.c, + trunk/speex/src/speexenc.c: Think the encoder and decoder work! + Still a couple fixes left... + +2002-03-27 03:40 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/bits.h, + trunk/speex/src/speexenc.c: Don't fill the last byte in the frame + before saving (saves a couple bits per frame). + +2002-03-26 23:56 jmvalin + + * trunk/speex/Makefile.am, trunk/speex/configure.in, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/testdec.c, + trunk/speex/src/speexenc.c: ... + +2002-03-26 20:48 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc_wb.c: Fixed pre-emphasis/de-emphasis + in the decoder for wideband (and narrowband). Now both should work + (really!) + +2002-03-25 20:06 jmvalin + + * trunk/speex/libspeex/mpulse.c: oops... + +2002-03-25 19:45 jmvalin + + * trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c: + Wideband encoding seems to work + +2002-03-25 19:38 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/mpulse.c, + trunk/speex/libspeex/mpulse.h: Multi-pulse narrowband seem to work + (encode+decode). Didn't test the wideband yet. + +2002-03-25 15:59 jmvalin + + * trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/mpulse.c, trunk/speex/libspeex/mpulse.h, + trunk/speex/libspeex/testenc.c, trunk/speex/libspeex/testenc_wb.c: + Multi-pulse quantization (not complete yet) + +2002-03-22 09:42 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/mpulse.c: Multi-pulse seems to work not too + bad (but disabled by default) + +2002-03-22 05:03 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/mpulse.c, trunk/speex/libspeex/mpulse.h, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/testenc.c: + Modified WB perceptual filter, starting a multi-pulse "branch" + +2002-03-20 06:59 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/matrix.c, + trunk/speex/libspeex/matrix.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/speex.c: Added joint optimization of + excitation gains + +2002-03-19 07:37 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_gains_wb2_table.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: crappy + wideband codec at 28.5 kbps... + +2002-03-18 05:25 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_gains_wb_table.c, + trunk/speex/libspeex/exc_wb_table.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/speex.c: Wideband almost done but buggy... + +2002-03-15 23:16 jmvalin + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc_wb.c: + Adjustable LPC analysis (lag windowing, noise floor), changed + wideband frame size + +2002-03-15 19:28 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h: wideband coexists with + narrowband now + +2002-03-15 08:06 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c: + OK, back to normal (narrowband codec works) + +2002-03-15 07:30 jmvalin + + * trunk/speex/libspeex/testenc_wb.c: Wideband encorer + +2002-03-15 07:30 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_wb_table.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/speex.c: More wideband stuff... + +2002-03-15 03:29 jmvalin + + * trunk/speex/libspeex/speex.c, trunk/speex/libspeex/testenc.c: + Oops... let's leave a working narrowband codec... + +2002-03-15 03:24 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/lsp_tables_wb.c, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: We're going wideband... + +2002-03-14 19:31 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Think the modularity stuff is mostly + done... + +2002-03-14 07:32 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Cleanup mostly done for the encoder. + All functions are now in the mode struct. + +2002-03-14 07:08 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/vq.c, trunk/speex/libspeex/vq.h: More cleanup + in codebook search... + +2002-03-14 03:58 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/modes.c, trunk/speex/libspeex/modes.h, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h, + trunk/speex/libspeex/testenc.c: Cleaning up the code and making it + easier to switch algorithms... + +2002-03-13 18:28 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/testdec.c: + Decoder seems to be working... + +2002-03-13 18:06 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: Decoder seems to work + +2002-03-13 07:29 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/speex.c: More decoder stuff + +2002-03-13 05:08 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/speex.c: Decoding of pitch (still untested) + +2002-03-13 02:45 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/bits.h, + trunk/speex/libspeex/quant_lsp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc.c: More + decoder work + +2002-03-13 00:31 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: Code cleanup, removed warnings + +2002-03-12 18:47 jmvalin + + * trunk/speex/html/index.html, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Some decoder stuff, web page update + +2002-03-11 19:32 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/bits.h, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: The encoder (testenc) now produces + a bitstream + +2002-03-11 18:34 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_gains_table.c, + trunk/speex/libspeex/exc_table.c, trunk/speex/libspeex/testenc.c: + Working demo at 14.5 kbps (fully quantized) + +2002-03-08 13:09 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/exc_table.c, trunk/speex/libspeex/speex.c: + Working demo... + +2002-03-07 21:55 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: The code is getting horribly messy, + but there's too much stuff that needs to be added: - Fractional + pitch - SNR measurements - Split-codebook search for excitation - + ... + +2002-03-05 17:02 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/stack_alloc.h, + trunk/speex/libspeex/stoc.c: Big cleanup... filter memories, stack + allocation, ... + +2002-03-01 20:54 jmvalin + + * trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: Some + early decoder stuff + +2002-03-01 15:40 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/bits.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc.c: + Integrating the modes and bitstream. + +2002-02-28 21:12 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/speex.c: Pitch + prediction stuff... + +2002-02-28 05:18 jmvalin + + * trunk/speex/libspeex/bits.c, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h: Bit manipulations seem to work... + +2002-02-28 01:32 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/bits.c, + trunk/speex/libspeex/bits.h, trunk/speex/libspeex/modes.c, + trunk/speex/libspeex/modes.h: Bit manipulation stuff + +2002-02-27 21:50 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Started the decoder part, I think we + now update filters in a better way to take into account the + encoding error. + +2002-02-27 19:32 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/stack_alloc.h: Added 3-tap pitch predictor by + analysis by synthesis + +2002-02-27 07:34 jmvalin + + * trunk/speex/libspeex/speex.c: First working demo of the encoder + (not fully quantized yet, no fancy pitch prediction, ...) + +2002-02-27 07:10 jmvalin + + * trunk/speex/libspeex/speex.c: Looks like W(z)=A(z/.9)/A(z/.5) + works now... + +2002-02-27 06:44 jmvalin + + * trunk/speex/libspeex/speex.c: For the 1000th time, I think I've + figured out the filter memory details for W(z)=A(z/.9)... now + let's try W(z)=A(z/.9)/A(z/.5) + +2002-02-26 22:19 jmvalin + + * trunk/speex/libspeex/speex.c: oops... buggy again... + +2002-02-26 21:35 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/filters.h, + trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: Think + the filter stuff works with W(z)=A(z/.9)/A(z/.5) + +2002-02-26 21:08 jmvalin + + * trunk/speex/libspeex/cb_search.c, trunk/speex/libspeex/speex.c: + This time the filters really work with W(z)=A(z/.9) + +2002-02-26 17:29 jmvalin + + * trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Think I figuring out the filter + stuff + +2002-02-25 08:46 jmvalin + + * trunk/speex/libspeex/Makefile.am, trunk/speex/libspeex/filters.c, + trunk/speex/libspeex/filters.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Fixed algorithmic errors, rewiting + the main subframe loop from scratch... + +2002-02-19 22:44 jmvalin + + * trunk/speex/libspeex/Makefile.am, + trunk/speex/libspeex/cb_search.c, + trunk/speex/libspeex/cb_search.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/stoc.c: Excitation codebook stuff, but it + doesn't work;-( + +2002-02-19 17:08 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Think I figured out the filter + memory (ringing) stuff, not too sure though. Added notion of + target signal and excitation. + +2002-02-19 03:14 jmvalin + + * trunk/speex/configure.in, trunk/speex/libspeex/Makefile.am: Forgot + the includes... + +2002-02-19 03:07 jmvalin + + * trunk/speex/Makefile.am, trunk/speex/configure.in, + trunk/speex/libspeex/Makefile.am: Makefile system seems to work + +2002-02-19 02:43 jmvalin + + * trunk/speex/AUTHORS, trunk/speex/COPYING, trunk/speex/ChangeLog, + trunk/speex/INSTALL, trunk/speex/NEWS, trunk/speex/README, + trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Checking in license stuff + +2002-02-19 00:27 jmvalin + + * trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c: + Some more comments + +2002-02-18 20:47 jmvalin + + * trunk/speex/libspeex/gain_table.c, + trunk/speex/libspeex/lsp_tables_nb.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/quant_lsp.c, + trunk/speex/libspeex/quant_lsp.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: Added both LSP and prediction gain + quantization... the code is a bit ugly but it seems to work. For + now we assume a fixed narrowband codebook... Next step: Analysis + by synthesis and excitation quantization + +2002-02-17 22:54 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: Save synthesized speech in second + file + +2002-02-17 00:05 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/speex.c: fixed a bug in in-place predictor. + Think most of the framework is now in place... + +2002-02-16 06:02 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/ltp.h, + trunk/speex/libspeex/speex.c: 3-tap pitch predictor seems to work + +2002-02-15 20:48 jmvalin + + * trunk/speex/libspeex/ltp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/testenc.c: Implementing a 3-tap long-term + predictor. Also changed frame size to 160 + +2002-02-15 08:14 jmvalin + + * trunk/speex/libspeex/ltp.c: Comments + +2002-02-15 07:39 jmvalin + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/ltp.c, + trunk/speex/libspeex/ltp.h, trunk/speex/libspeex/speex.c: Added + long-term prediction, fixed subframe bugs, maybe not fully + debugged + +2002-02-15 07:15 jmvalin + + * trunk/speex/libspeex/lsp.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc.c: + added perceptual weighting filter, bug fixes, fixed warnings + +2002-02-15 06:10 jmvalin + + * trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: Fixed + a couple bugs (notably in buffer) and added LSP interpolation + +2002-02-15 00:31 jmvalin + + * trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: Some + comments + +2002-02-14 23:46 jmvalin + + * trunk/speex/libspeex/speex.c, trunk/speex/libspeex/speex.h: Think + I have the LPC->LSP->LPC right this time + +2002-02-14 01:57 jmvalin + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/lsp.c, + trunk/speex/libspeex/lsp.h, trunk/speex/libspeex/speex.c: Oops... + now the LSPs are there. Also, lpcSize now represents the order + instead of the filter length (including a[0]=1). Cleaner that way + and more like what everybody else is doing. + +2002-02-14 01:31 jmvalin + + * trunk/speex/libspeex/lpc.c, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h: integrated LSPs + +2002-02-14 00:19 jmvalin + + * trunk/speex, trunk/speex/libspeex, trunk/speex/libspeex/lpc.c, + trunk/speex/libspeex/lpc.h, trunk/speex/libspeex/speex.c, + trunk/speex/libspeex/speex.h, trunk/speex/libspeex/testenc.c: + Initial commit, some LPC stuff is already there... + diff --git a/3rdparty/iaxclient-2/lib/libspeex/arch.h b/3rdparty/iaxclient-2/lib/libspeex/arch.h new file mode 100644 index 0000000..d54a40c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/arch.h @@ -0,0 +1,168 @@ +/* Copyright (C) 2003 Jean-Marc Valin */ +/** + @file arch.h + @brief Various architecture definitions Speex +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef ARCH_H +#define ARCH_H + +#include "speex/speex_types.h" + +#define ABS(x) ((x) < 0 ? (-(x)) : (x)) + +#ifdef FIXED_POINT + +typedef spx_int16_t spx_word16_t; +typedef spx_int32_t spx_word32_t; +#ifdef _MSC_VER +typedef __int64 spx_word64_t; +#else +typedef long long spx_word64_t; +#endif +typedef spx_word32_t spx_mem_t; +typedef spx_word16_t spx_coef_t; +typedef spx_word16_t spx_lsp_t; +typedef spx_word32_t spx_sig_t; + +#define LPC_SCALING 8192 +#define SIG_SCALING 16384 +#define LSP_SCALING 8192. +#define GAMMA_SCALING 32768. +#define GAIN_SCALING 64 +#define GAIN_SCALING_1 0.015625 + +#define LPC_SHIFT 13 +#define SIG_SHIFT 14 + +#define VERY_SMALL 0 + + +#ifdef ARM5E_ASM +#include "fixed_arm5e.h" +#elif defined (ARM4_ASM) +#include "fixed_arm4.h" +#elif defined (FIXED_DEBUG) +#include "fixed_debug.h" +#else +#include "fixed_generic.h" +#endif + + + +#else + +typedef float spx_mem_t; +typedef float spx_coef_t; +typedef float spx_lsp_t; +typedef float spx_sig_t; +typedef float spx_word16_t; +typedef float spx_word32_t; +typedef float spx_word64_t; + +#define LPC_SCALING 1. +#define SIG_SCALING 1. +#define LSP_SCALING 1. +#define GAMMA_SCALING 1. +#define GAIN_SCALING 1. +#define GAIN_SCALING_1 1. + +#define LPC_SHIFT 0 +#define SIG_SHIFT 0 + +#define VERY_SMALL 1e-15 + +#define NEG16(x) (-(x)) +#define NEG32(x) (-(x)) +#define EXTRACT16(x) (x) +#define EXTEND32(x) (x) +#define SHR16(a,shift) (a) +#define SHL16(a,shift) (a) +#define SHR32(a,shift) (a) +#define SHL32(a,shift) (a) +#define PSHR16(a,shift) (a) +#define PSHR32(a,shift) (a) +#define SATURATE16(x,a) (x) +#define SATURATE32(x,a) (x) + +#define PSHR(a,shift) (a) +#define SHR(a,shift) (a) +#define SHL(a,shift) (a) +#define SATURATE(x,a) (x) + +#define ADD16(a,b) ((a)+(b)) +#define SUB16(a,b) ((a)-(b)) +#define ADD32(a,b) ((a)+(b)) +#define SUB32(a,b) ((a)-(b)) +#define ADD64(a,b) ((a)+(b)) +#define MULT16_16_16(a,b) ((a)*(b)) +#define MULT16_16(a,b) ((spx_word32_t)(a)*(spx_word32_t)(b)) +#define MAC16_16(c,a,b) ((c)+(spx_word32_t)(a)*(spx_word32_t)(b)) + +#define MULT16_32_Q11(a,b) ((a)*(b)) +#define MULT16_32_Q13(a,b) ((a)*(b)) +#define MULT16_32_Q14(a,b) ((a)*(b)) +#define MULT16_32_Q15(a,b) ((a)*(b)) + +#define MAC16_32_Q11(c,a,b) ((c)+(a)*(b)) +#define MAC16_32_Q15(c,a,b) ((c)+(a)*(b)) + +#define MAC16_16_Q11(c,a,b) ((c)+(a)*(b)) +#define MAC16_16_Q13(c,a,b) ((c)+(a)*(b)) +#define MULT16_16_Q11_32(a,b) ((a)*(b)) +#define MULT16_16_Q13(a,b) ((a)*(b)) +#define MULT16_16_Q14(a,b) ((a)*(b)) +#define MULT16_16_Q15(a,b) ((a)*(b)) +#define MULT16_16_P15(a,b) ((a)*(b)) + +#define DIV32_16(a,b) ((a)/(b)) +#define DIV32(a,b) ((a)/(b)) + + +#endif + + +#ifdef CONFIG_TI_C55X + +/* 2 on TI C5x DSP */ +#define BYTES_PER_CHAR 2 +#define BITS_PER_CHAR 16 +#define LOG2_BITS_PER_CHAR 4 + +#else + +#define BYTES_PER_CHAR 1 +#define BITS_PER_CHAR 8 +#define LOG2_BITS_PER_CHAR 3 + +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/bits.c b/3rdparty/iaxclient-2/lib/libspeex/bits.c new file mode 100644 index 0000000..4569f14 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/bits.c @@ -0,0 +1,360 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: speex_bits.c + + Handles bit packing/unpacking + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "misc.h" + +/** Maximum size of the bit-stream (for fixed-size allocation) */ +#define MAX_BYTES_PER_FRAME (2000/BYTES_PER_CHAR) + +void speex_bits_init(SpeexBits *bits) +{ + bits->chars = (char*)speex_alloc(MAX_BYTES_PER_FRAME); + bits->buf_size = MAX_BYTES_PER_FRAME; + + bits->chars[0]=0; + bits->nbBits=0; + bits->charPtr=0; + bits->bitPtr=0; + bits->owner=1; + bits->overflow=0; +} + +void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size) +{ + bits->chars = (char*)buff; + bits->buf_size = buf_size; + + bits->chars[0]=0; + bits->nbBits=0; + bits->charPtr=0; + bits->bitPtr=0; + bits->owner=0; + bits->overflow=0; +} + +void speex_bits_destroy(SpeexBits *bits) +{ + if (bits->owner) + speex_free(bits->chars); + /* Will do something once the allocation is dynamic */ +} + +void speex_bits_reset(SpeexBits *bits) +{ + bits->chars[0]=0; + bits->nbBits=0; + bits->charPtr=0; + bits->bitPtr=0; + bits->overflow=0; +} + +void speex_bits_rewind(SpeexBits *bits) +{ + bits->charPtr=0; + bits->bitPtr=0; + bits->overflow=0; +} + +void speex_bits_read_from(SpeexBits *bits, char *chars, int len) +{ + int i; + if (len > bits->buf_size) + { + speex_warning_int("Packet if larger than allocated buffer: ", len); + if (bits->owner) + { + char *tmp = (char*)speex_realloc(bits->chars, len); + if (tmp) + { + bits->buf_size=len; + bits->chars=tmp; + } else { + len=bits->buf_size; + speex_warning("Could not resize input buffer: truncating input"); + } + } else { + speex_warning("Do not own input buffer: truncating input"); + len=bits->buf_size; + } + } + for (i=0;ichars[i]=chars[i]; + bits->nbBits=len<<3; + bits->charPtr=0; + bits->bitPtr=0; + bits->overflow=0; +} + +static void speex_bits_flush(SpeexBits *bits) +{ + int i; + int nchars = ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR); + if (bits->charPtr>0) + { + for (i=bits->charPtr;ichars[i-bits->charPtr]=bits->chars[i]; + } + bits->nbBits -= bits->charPtr<charPtr=0; +} + +void speex_bits_read_whole_bytes(SpeexBits *bits, char *chars, int nbytes) +{ + int i,pos; + int nchars = nbytes/BYTES_PER_CHAR; + + if (((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR)+nchars > bits->buf_size) + { + /* Packet is larger than allocated buffer */ + if (bits->owner) + { + char *tmp = (char*)speex_realloc(bits->chars, (bits->nbBits>>LOG2_BITS_PER_CHAR)+nchars+1); + if (tmp) + { + bits->buf_size=(bits->nbBits>>LOG2_BITS_PER_CHAR)+nchars+1; + bits->chars=tmp; + } else { + nchars=bits->buf_size-(bits->nbBits>>LOG2_BITS_PER_CHAR)-1; + speex_warning("Could not resize input buffer: truncating input"); + } + } else { + speex_warning("Do not own input buffer: truncating input"); + nchars=bits->buf_size; + } + } + + speex_bits_flush(bits); + pos=bits->nbBits>>LOG2_BITS_PER_CHAR; + for (i=0;ichars[pos+i]=chars[i]; + bits->nbBits+=nchars<bitPtr; + charPtr=bits->charPtr; + nbBits=bits->nbBits; + speex_bits_insert_terminator(bits); + bits->bitPtr=bitPtr; + bits->charPtr=charPtr; + bits->nbBits=nbBits; + + if (max_nchars > ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR)) + max_nchars = ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR); +#if BYTES_PER_CHAR==1 +#define HTOLS(A) (A) +#else +#define HTOLS(A) ((((A) >> 8)&0xff)|(((A) & 0xff)<<8)) +#endif + for (i=0;ichars[i]); + return max_nchars*BYTES_PER_CHAR; +} + +int speex_bits_write_whole_bytes(SpeexBits *bits, char *chars, int max_nbytes) +{ + int max_nchars = max_nbytes/BYTES_PER_CHAR; + int i; + if (max_nchars > ((bits->nbBits)>>LOG2_BITS_PER_CHAR)) + max_nchars = ((bits->nbBits)>>LOG2_BITS_PER_CHAR); + for (i=0;ichars[i]; + + if (bits->bitPtr>0) + bits->chars[0]=bits->chars[max_nchars]; + else + bits->chars[0]=0; + for (i=1;i<((bits->nbBits)>>LOG2_BITS_PER_CHAR)+1;i++) + bits->chars[i]=0; + bits->charPtr=0; + bits->nbBits &= (BITS_PER_CHAR-1); + return max_nchars*BYTES_PER_CHAR; +} + +void speex_bits_pack(SpeexBits *bits, int data, int nbBits) +{ + unsigned int d=data; + + if (bits->charPtr+((nbBits+bits->bitPtr)>>LOG2_BITS_PER_CHAR) >= bits->buf_size) + { + speex_warning("Buffer too small to pack bits"); + if (bits->owner) + { + int new_nchars = ((bits->buf_size+5)*3)>>1; + char *tmp = (char*)speex_realloc(bits->chars, new_nchars); + if (tmp) + { + speex_memset_bytes(tmp, 0, new_nchars); + bits->buf_size=new_nchars; + bits->chars=tmp; + } else { + speex_warning("Could not resize input buffer: not packing"); + return; + } + } else { + speex_warning("Do not own input buffer: not packing"); + return; + } + } + + while(nbBits) + { + int bit; + bit = (d>>(nbBits-1))&1; + bits->chars[bits->charPtr] |= bit<<(7-bits->bitPtr); + bits->bitPtr++; + + if (bits->bitPtr==8) + { + bits->bitPtr=0; + bits->charPtr++; + bits->chars[bits->charPtr] = 0; + } + bits->nbBits++; + nbBits--; + } +} + +int speex_bits_unpack_signed(SpeexBits *bits, int nbBits) +{ + unsigned int d=speex_bits_unpack_unsigned(bits,nbBits); + /* If number is negative */ + if (d>>(nbBits-1)) + { + d |= (-1)<charPtr<bitPtr+nbBits>bits->nbBits) + bits->overflow=1; + if (bits->overflow) + return 0; + while(nbBits) + { + d<<=1; + d |= (bits->chars[bits->charPtr]>>(BITS_PER_CHAR-1 - bits->bitPtr))&1; + bits->bitPtr++; + if (bits->bitPtr==BITS_PER_CHAR) + { + bits->bitPtr=0; + bits->charPtr++; + } + nbBits--; + } + return d; +} + +unsigned int speex_bits_peek_unsigned(SpeexBits *bits, int nbBits) +{ + unsigned int d=0; + int bitPtr, charPtr; + char *chars; + + if ((bits->charPtr<bitPtr+nbBits>bits->nbBits) + bits->overflow=1; + if (bits->overflow) + return 0; + + bitPtr=bits->bitPtr; + charPtr=bits->charPtr; + chars = bits->chars; + while(nbBits) + { + d<<=1; + d |= (chars[charPtr]>>(BITS_PER_CHAR-1 - bitPtr))&1; + bitPtr++; + if (bitPtr==BITS_PER_CHAR) + { + bitPtr=0; + charPtr++; + } + nbBits--; + } + return d; +} + +int speex_bits_peek(SpeexBits *bits) +{ + if ((bits->charPtr<bitPtr+1>bits->nbBits) + bits->overflow=1; + if (bits->overflow) + return 0; + return (bits->chars[bits->charPtr]>>(BITS_PER_CHAR-1 - bits->bitPtr))&1; +} + +void speex_bits_advance(SpeexBits *bits, int n) +{ + if (((bits->charPtr<bitPtr+n>bits->nbBits) || bits->overflow){ + bits->overflow=1; + return; + } + bits->charPtr += (bits->bitPtr+n) >> LOG2_BITS_PER_CHAR; /* divide by BITS_PER_CHAR */ + bits->bitPtr = (bits->bitPtr+n) & (BITS_PER_CHAR-1); /* modulo by BITS_PER_CHAR */ +} + +int speex_bits_remaining(SpeexBits *bits) +{ + if (bits->overflow) + return -1; + else + return bits->nbBits-((bits->charPtr<bitPtr); +} + +int speex_bits_nbytes(SpeexBits *bits) +{ + return ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR); +} + +void speex_bits_insert_terminator(SpeexBits *bits) +{ + if (bits->bitPtrbitPtr10) + N=10; + if (N<1) + N=1; + + params = (const split_cb_params *) par; + subvect_size = params->subvect_size; + nb_subvect = params->nb_subvect; + shape_cb_size = 1<shape_bits; + shape_cb = params->shape_cb; + have_sign = params->have_sign; + ALLOC(resp, shape_cb_size*subvect_size, spx_word16_t); +#ifdef _USE_SSE + ALLOC(resp2, (shape_cb_size*subvect_size)>>2, __m128); + ALLOC(E, shape_cb_size>>2, __m128); +#else + resp2 = resp; + ALLOC(E, shape_cb_size, spx_word32_t); +#endif + ALLOC(t, nsf, spx_word16_t); + ALLOC(e, nsf, spx_sig_t); + + /* FIXME: make that adaptive? */ + for (i=0;ishape_bits+have_sign); + + { + int rind; + spx_word16_t *res; + spx_word16_t sign=1; + rind = best_index; + if (rind>=shape_cb_size) + { + sign=-1; + rind-=shape_cb_size; + } + res = resp+rind*subvect_size; + if (sign>0) + for (m=0;m=shape_cb_size) + { + sign=-1; + rind-=shape_cb_size; + } + + q=subvect_size-m; +#ifdef FIXED_POINT + g=sign*shape_cb[rind*subvect_size+m]; + for (n=subvect_size*(i+1);n10) + N=10; + if (N<1) + N=1; + + if (N==1) + { + split_cb_search_shape_sign_N1(target,ak,awk1,awk2,par,p,nsf,exc,r,bits,stack,complexity,update_target); + return; + } + ALLOC(ot2, N, spx_word16_t*); + ALLOC(nt2, N, spx_word16_t*); + ALLOC(oind, N, int*); + ALLOC(nind, N, int*); + + params = (const split_cb_params *) par; + subvect_size = params->subvect_size; + nb_subvect = params->nb_subvect; + shape_cb_size = 1<shape_bits; + shape_cb = params->shape_cb; + have_sign = params->have_sign; + ALLOC(resp, shape_cb_size*subvect_size, spx_word16_t); +#ifdef _USE_SSE + ALLOC(resp2, (shape_cb_size*subvect_size)>>2, __m128); + ALLOC(E, shape_cb_size>>2, __m128); +#else + resp2 = resp; + ALLOC(E, shape_cb_size, spx_word32_t); +#endif + ALLOC(t, nsf, spx_word16_t); + ALLOC(e, nsf, spx_sig_t); + ALLOC(r2, nsf, spx_sig_t); + ALLOC(ind, nb_subvect, int); + + ALLOC(tmp, 2*N*nsf, spx_word16_t); + for (i=0;i=shape_cb_size) + { + sign=-1; + rind-=shape_cb_size; + } + res = resp+rind*subvect_size; + if (sign>0) + for (m=0;m=shape_cb_size) + { + sign=-1; + rind-=shape_cb_size; + } + + q=subvect_size-m; +#ifdef FIXED_POINT + g=sign*shape_cb[rind*subvect_size+m]; + for (n=subvect_size*(i+1);nm;n--) + { + for (q=(i+1)*subvect_size;qshape_bits+have_sign); + } + + /* Put everything back together */ + for (i=0;i=shape_cb_size) + { + sign=-1; + rind-=shape_cb_size; + } +#ifdef FIXED_POINT + if (sign==1) + { + for (j=0;jsubvect_size; + nb_subvect = params->nb_subvect; + //shape_cb_size = 1<shape_bits; + shape_cb = params->shape_cb; + have_sign = params->have_sign; + + ALLOC(ind, nb_subvect, int); + ALLOC(signs, nb_subvect, int); + + /* Decode codewords and gains */ + for (i=0;ishape_bits); + } + /* Compute decoded excitation */ + for (i=0;i +#include "misc.h" + +typedef struct split_cb_params { + int subvect_size; + int nb_subvect; + const signed char *shape_cb; + int shape_bits; + int have_sign; +} split_cb_params; + + +void split_cb_search_shape_sign( +spx_sig_t target[], /* target vector */ +spx_coef_t ak[], /* LPCs for this subframe */ +spx_coef_t awk1[], /* Weighted LPCs for this subframe */ +spx_coef_t awk2[], /* Weighted LPCs for this subframe */ +const void *par, /* Codebook/search parameters*/ +int p, /* number of LPC coeffs */ +int nsf, /* number of samples in subframe */ +spx_sig_t *exc, +spx_word16_t *r, +SpeexBits *bits, +char *stack, +int complexity, +int update_target +); + +void split_cb_shape_sign_unquant( +spx_sig_t *exc, +const void *par, /* non-overlapping codebook */ +int nsf, /* number of samples in subframe */ +SpeexBits *bits, +char *stack +); + + +void noise_codebook_quant( +spx_sig_t target[], /* target vector */ +spx_coef_t ak[], /* LPCs for this subframe */ +spx_coef_t awk1[], /* Weighted LPCs for this subframe */ +spx_coef_t awk2[], /* Weighted LPCs for this subframe */ +const void *par, /* Codebook/search parameters*/ +int p, /* number of LPC coeffs */ +int nsf, /* number of samples in subframe */ +spx_sig_t *exc, +spx_word16_t *r, +SpeexBits *bits, +char *stack, +int complexity, +int update_target +); + + +void noise_codebook_unquant( +spx_sig_t *exc, +const void *par, /* non-overlapping codebook */ +int nsf, /* number of samples in subframe */ +SpeexBits *bits, +char *stack +); + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/cb_search_arm4.h b/3rdparty/iaxclient-2/lib/libspeex/cb_search_arm4.h new file mode 100644 index 0000000..2452a5c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/cb_search_arm4.h @@ -0,0 +1,129 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File: cb_search.c (ARM4 version) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +static void compute_weighted_codebook(const signed char *shape_cb, const spx_sig_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) +{ + int i, j, k; + //const signed char *shape; + for (i=0;i + +static inline void _spx_mm_getr_ps (__m128 U, float *__Z, float *__Y, float *__X, float *__W) +{ + union { + float __a[4]; + __m128 __v; + } __u; + + __u.__v = U; + + *__Z = __u.__a[0]; + *__Y = __u.__a[1]; + *__X = __u.__a[2]; + *__W = __u.__a[3]; + +} + + +static void compute_weighted_codebook(const signed char *shape_cb, const spx_sig_t *_r, float *resp, __m128 *resp2, __m128 *E, int shape_cb_size, int subvect_size, char *stack) +{ + int i, j, k; + __m128 resj, EE; + VARDECL(__m128 *r); + VARDECL(__m128 *shape); + ALLOC(r, subvect_size, __m128); + ALLOC(shape, subvect_size, __m128); + for(j=0;j>2] = EE; + } +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_10_16_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_10_16_table.c new file mode 100644 index 0000000..98ae357 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_10_16_table.c @@ -0,0 +1,50 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_10_16_table.c + Codebook for excitation in narrowband CELP mode (3200 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_10_16_table[160] = { +22,39,14,44,11,35,-2,23,-4,6, +46,-28,13,-27,-23,12,4,20,-5,9, +37,-18,-23,23,0,9,-6,-20,4,-1, +-17,-5,-4,17,0,1,9,-2,1,2, +2,-12,8,-25,39,15,9,16,-55,-11, +9,11,5,10,-2,-60,8,13,-6,11, +-16,27,-47,-12,11,1,16,-7,9,-3, +-29,9,-14,25,-19,34,36,12,40,-10, +-3,-24,-14,-37,-21,-35,-2,-36,3,-6, +67,28,6,-17,-3,-12,-16,-15,-17,-7, +-59,-36,-13,1,7,1,2,10,2,11, +13,10,8,-2,7,3,5,4,2,2, +-3,-8,4,-5,6,7,-42,15,35,-2, +-46,38,28,-20,-9,1,7,-3,0,-2, +0,0,0,0,0,0,0,0,0,0, +-15,-28,52,32,5,-5,-17,-20,-10,-1}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_10_32_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_10_32_table.c new file mode 100644 index 0000000..1ee56a2 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_10_32_table.c @@ -0,0 +1,66 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_10_32_table.c + Codebook for excitation in narrowband CELP mode (4000 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_10_32_table[320] = { +7,17,17,27,25,22,12,4,-3,0, +28,-36,39,-24,-15,3,-9,15,-5,10, +31,-28,11,31,-21,9,-11,-11,-2,-7, +-25,14,-22,31,4,-14,19,-12,14,-5, +4,-7,4,-5,9,0,-2,42,-47,-16, +1,8,0,9,23,-57,0,28,-11,6, +-31,55,-45,3,-5,4,2,-2,4,-7, +-3,6,-2,7,-3,12,5,8,54,-10, +8,-7,-8,-24,-25,-27,-14,-5,8,5, +44,23,5,-9,-11,-11,-13,-9,-12,-8, +-29,-8,-22,6,-15,3,-12,-1,-5,-3, +34,-1,29,-16,17,-4,12,2,1,4, +-2,-4,2,-1,11,-3,-52,28,30,-9, +-32,25,44,-20,-24,4,6,-1,0,0, +0,0,0,0,0,0,0,0,0,0, +-25,-10,22,29,13,-13,-22,-13,-4,0, +-4,-16,10,15,-36,-24,28,25,-1,-3, +66,-33,-11,-15,6,0,3,4,-2,5, +24,-20,-47,29,19,-2,-4,-1,0,-1, +-2,3,1,8,-11,5,5,-57,28,28, +0,-16,4,-4,12,-6,-1,2,-20,61, +-9,24,-22,-42,29,6,17,8,4,2, +-65,15,8,10,5,6,5,3,2,-2, +-3,5,-9,4,-5,23,13,23,-3,-63, +3,-5,-4,-6,0,-3,23,-36,-46,9, +5,5,8,4,9,-5,1,-3,10,1, +-6,10,-11,24,-47,31,22,-12,14,-10, +6,11,-7,-7,7,-31,51,-12,-6,7, +6,-17,9,-11,-20,52,-19,3,-6,-6, +-8,-5,23,-41,37,1,-21,10,-14,8, +7,5,-15,-15,23,39,-26,-33,7,2, +-32,-30,-21,-8,4,12,17,15,14,11}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_20_32_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_20_32_table.c new file mode 100644 index 0000000..e4098b8 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_20_32_table.c @@ -0,0 +1,66 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_20_32_table.c + Codebook for excitation in narrowband CELP mode (2000 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_20_32_table[640] = { +12,32,25,46,36,33,9,14,-3,6,1,-8,0,-10,-5,-7,-7,-7,-5,-5, +31,-27,24,-32,-4,10,-11,21,-3,19,23,-9,22,24,-10,-1,-10,-13,-7,-11, +42,-33,31,19,-8,0,-10,-16,1,-21,-17,10,-8,14,8,4,11,-2,5,-2, +-33,11,-16,33,11,-4,9,-4,11,2,6,-5,8,-5,11,-4,-6,26,-36,-16, +0,4,-2,-8,12,6,-1,34,-46,-22,9,9,21,9,5,-66,-5,26,2,10, +13,2,19,9,12,-81,3,13,13,0,-14,22,-35,6,-7,-4,6,-6,10,-6, +-31,38,-33,0,-10,-11,5,-12,12,-17,5,0,-6,13,-9,10,8,25,33,2, +-12,8,-6,10,-2,21,7,17,43,5,11,-7,-9,-20,-36,-20,-23,-4,-4,-3, +27,-9,-9,-49,-39,-38,-11,-9,6,5,23,25,5,3,3,4,1,2,-3,-1, +87,39,17,-21,-9,-19,-9,-15,-13,-14,-17,-11,-10,-11,-8,-6,-1,-3,-3,-1, +-54,-34,-27,-8,-11,-4,-5,0,0,4,8,6,9,7,9,7,6,5,5,5, +48,10,19,-10,12,-1,9,-3,2,5,-3,2,-2,-2,0,-2,-26,6,9,-7, +-16,-9,2,7,7,-5,-43,11,22,-11,-9,34,37,-15,-13,-6,1,-1,1,1, +-64,56,52,-11,-27,5,4,3,1,2,1,3,-1,-4,-4,-10,-7,-4,-4,2, +-1,-7,-7,-12,-10,-15,-9,-5,-5,-11,-16,-13,6,16,4,-13,-16,-10,-4,2, +-47,-13,25,47,19,-14,-20,-8,-17,0,-3,-13,1,6,-17,-14,15,1,10,6, +-24,0,-10,19,-69,-8,14,49,17,-5,33,-29,3,-4,0,2,-8,5,-6,2, +120,-56,-12,-47,23,-9,6,-5,1,2,-5,1,-10,4,-1,-1,4,-1,0,-3, +30,-52,-67,30,22,11,-1,-4,3,0,7,2,0,1,-10,-4,-8,-13,5,1, +1,-1,5,13,-9,-3,-10,-62,22,48,-4,-6,2,3,5,1,1,4,1,13, +3,-20,10,-9,13,-2,-4,9,-20,44,-1,20,-32,-67,19,0,28,11,8,2, +-11,15,-19,-53,31,2,34,10,6,-4,-58,8,10,13,14,1,12,2,0,0, +-128,37,-8,44,-9,26,-3,18,2,6,11,-1,9,1,5,3,0,1,1,2, +12,3,-2,-3,7,25,9,18,-6,-37,3,-8,-16,3,-10,-7,17,-34,-44,11, +17,-15,-3,-16,-1,-13,11,-46,-65,-2,8,13,2,4,4,5,15,5,9,6, +0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, +-9,19,-12,12,-28,38,29,-1,12,2,5,23,-10,3,4,-15,21,-4,3,3, +6,17,-9,-4,-8,-20,26,5,-10,6,1,-19,18,-15,-12,47,-6,-2,-7,-9, +-1,-17,-2,-2,-14,30,-14,2,-7,-4,-1,-12,11,-25,16,-3,-12,11,-7,7, +-17,1,19,-28,31,-7,-10,7,-10,3,12,5,-16,6,24,41,-29,-54,0,1, +7,-1,5,-6,13,10,-4,-8,8,-9,-27,-53,-38,-1,10,19,17,16,12,12, +0,3,-7,-4,13,12,-31,-14,6,-5,3,5,17,43,50,25,10,1,-6,-2}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_5_256_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_5_256_table.c new file mode 100644 index 0000000..4137996 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_5_256_table.c @@ -0,0 +1,290 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_5_256_table.c + Codebook for excitation in narrowband CELP mode (12800 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_5_256_table[1280] = { +-8,-37,5,-43,5, +73,61,39,12,-3, +-61,-32,2,42,30, +-3,17,-27,9,34, +20,-1,-5,2,23, +-7,-46,26,53,-47, +20,-2,-33,-89,-51, +-64,27,11,15,-34, +-5,-56,25,-9,-1, +-29,1,40,67,-23, +-16,16,33,19,7, +14,85,22,-10,-10, +-12,-7,-1,52,89, +29,11,-20,-37,-46, +-15,17,-24,-28,24, +2,1,0,23,-101, +23,14,-1,-23,-18, +9,5,-13,38,1, +-28,-28,4,27,51, +-26,34,-40,35,47, +54,38,-54,-26,-6, +42,-25,13,-30,-36, +18,41,-4,-33,23, +-32,-7,-4,51,-3, +17,-52,56,-47,36, +-2,-21,36,10,8, +-33,31,19,9,-5, +-40,10,-9,-21,19, +18,-78,-18,-5,0, +-26,-36,-47,-51,-44, +18,40,27,-2,29, +49,-26,2,32,-54, +30,-73,54,3,-5, +36,22,53,10,-1, +-84,-53,-29,-5,3, +-44,53,-51,4,22, +71,-35,-1,33,-5, +-27,-7,36,17,-23, +-39,16,-9,-55,-15, +-20,39,-35,6,-39, +-14,18,48,-64,-17, +-15,9,39,81,37, +-68,37,47,-21,-6, +-104,13,6,9,-2, +35,8,-23,18,42, +45,21,33,-5,-49, +9,-6,-43,-56,39, +2,-16,-25,87,1, +-3,-9,17,-25,-11, +-9,-1,10,2,-14, +-14,4,-1,-10,28, +-23,40,-32,26,-9, +26,4,-27,-23,3, +42,-60,1,49,-3, +27,10,-52,-40,-2, +18,45,-23,17,-44, +3,-3,17,-46,52, +-40,-47,25,75,31, +-49,53,30,-30,-32, +-36,38,-6,-15,-16, +54,-27,-48,3,38, +-29,-32,-22,-14,-4, +-23,-13,32,-39,9, +8,-45,-13,34,-16, +49,40,32,31,28, +23,23,32,47,59, +-68,8,62,44,25, +-14,-24,-65,-16,36, +67,-25,-38,-21,4, +-33,-2,42,5,-63, +40,11,26,-42,-23, +-61,79,-31,23,-20, +10,-32,53,-25,-36, +10,-26,-5,3,0, +-71,5,-10,-37,1, +-24,21,-54,-17,1, +-29,-25,-15,-27,32, +68,45,-16,-37,-18, +-5,1,0,-77,71, +-6,3,-20,71,-67, +29,-35,10,-30,19, +4,16,17,5,0, +-14,19,2,28,26, +59,3,2,24,39, +55,-50,-45,-18,-17, +33,-35,14,-1,1, +8,87,-35,-29,0, +-27,13,-7,23,-13, +37,-40,50,-35,14, +19,-7,-14,49,54, +-5,22,-2,-29,-8, +-27,38,13,27,48, +12,-41,-21,-15,28, +7,-16,-24,-19,-20, +11,-20,9,2,13, +23,-20,11,27,-27, +71,-69,8,2,-6, +22,12,16,16,9, +-16,-8,-17,1,25, +1,40,-37,-33,66, +94,53,4,-22,-25, +-41,-42,25,35,-16, +-15,57,31,-29,-32, +21,16,-60,45,15, +-1,7,57,-26,-47, +-29,11,8,15,19, +-105,-8,54,27,10, +-17,6,-12,-1,-10, +4,0,23,-10,31, +13,11,10,12,-64, +23,-3,-8,-19,16, +52,24,-40,16,10, +40,5,9,0,-13, +-7,-21,-8,-6,-7, +-21,59,16,-53,18, +-60,11,-47,14,-18, +25,-13,-24,4,-39, +16,-28,54,26,-67, +30,27,-20,-52,20, +-12,55,12,18,-16, +39,-14,-6,-26,56, +-88,-55,12,25,26, +-37,6,75,0,-34, +-81,54,-30,1,-7, +49,-23,-14,21,10, +-62,-58,-57,-47,-34, +15,-4,34,-78,31, +25,-11,7,50,-10, +42,-63,14,-36,-4, +57,55,57,53,42, +-42,-1,15,40,37, +15,25,-11,6,1, +31,-2,-6,-1,-7, +-64,34,28,30,-1, +3,21,0,-88,-12, +-56,25,-28,40,8, +-28,-14,9,12,2, +-6,-17,22,49,-6, +-26,14,28,-20,4, +-12,50,35,40,13, +-38,-58,-29,17,30, +22,60,26,-54,-39, +-12,58,-28,-63,10, +-21,-8,-12,26,-62, +6,-10,-11,-22,-6, +-7,4,1,18,2, +-70,11,14,4,13, +19,-24,-34,24,67, +17,51,-21,13,23, +54,-30,48,1,-13, +80,26,-16,-2,13, +-4,6,-30,29,-24, +73,-58,30,-27,20, +-2,-21,41,45,30, +-27,-3,-5,-18,-20, +-49,-3,-35,10,42, +-19,-67,-53,-11,9, +13,-15,-33,-51,-30, +15,7,25,-30,4, +28,-22,-34,54,-29, +39,-46,20,16,34, +-4,47,75,1,-44, +-55,-24,7,-1,9, +-42,50,-8,-36,41, +68,0,-4,-10,-23, +-15,-50,64,36,-9, +-27,12,25,-38,-47, +-37,32,-49,51,-36, +2,-4,69,-26,19, +7,45,67,46,13, +-63,46,15,-47,4, +-41,13,-6,5,-21, +37,26,-55,-7,33, +-1,-28,10,-17,-64, +-14,0,-36,-17,93, +-3,-9,-66,44,-21, +3,-12,38,-6,-13, +-12,19,13,43,-43, +-10,-12,6,-5,9, +-49,32,-5,2,4, +5,15,-16,10,-21, +8,-62,-8,64,8, +79,-1,-66,-49,-18, +5,40,-5,-30,-45, +1,-6,21,-32,93, +-18,-30,-21,32,21, +-18,22,8,5,-41, +-54,80,22,-10,-7, +-8,-23,-64,66,56, +-14,-30,-41,-46,-14, +-29,-37,27,-14,42, +-2,-9,-29,34,14, +33,-14,22,4,10, +26,26,28,32,23, +-72,-32,3,0,-14, +35,-42,-78,-32,6, +29,-18,-45,-5,7, +-33,-45,-3,-22,-34, +8,-8,4,-51,-25, +-9,59,-78,21,-5, +-25,-48,66,-15,-17, +-24,-49,-13,25,-23, +-64,-6,40,-24,-19, +-11,57,-33,-8,1, +10,-52,-54,28,39, +49,34,-11,-61,-41, +-43,10,15,-15,51, +30,15,-51,32,-34, +-2,-34,14,18,16, +1,1,-3,-3,1, +1,-18,6,16,48, +12,-5,-42,7,36, +48,7,-20,-10,7, +12,2,54,39,-38, +37,54,4,-11,-8, +-46,-10,5,-10,-34, +46,-12,29,-37,39, +36,-11,24,56,17, +14,20,25,0,-25, +-28,55,-7,-5,27, +3,9,-26,-8,6, +-24,-10,-30,-31,-34, +18,4,22,21,40, +-1,-29,-37,-8,-21, +92,-29,11,-3,11, +73,23,22,7,4, +-44,-9,-11,21,-13, +11,9,-78,-1,47, +114,-12,-37,-19,-5, +-11,-22,19,12,-30, +7,38,45,-21,-8, +-9,55,-45,56,-21, +7,17,46,-57,-87, +-6,27,31,31,7, +-56,-12,46,21,-5, +-12,36,3,3,-21, +43,19,12,-7,9, +-14,0,-9,-33,-91, +7,26,3,-11,64, +83,-31,-46,25,2, +9,5,2,2,-1, +20,-17,10,-5,-27, +-8,20,8,-19,16, +-21,-13,-31,5,5, +42,24,9,34,-20, +28,-61,22,11,-39, +64,-20,-1,-30,-9, +-20,24,-25,-24,-29, +22,-60,6,-5,41, +-9,-87,14,34,15, +-57,52,69,15,-3, +-102,58,16,3,6, +60,-75,-32,26,7, +-57,-27,-32,-24,-21, +-29,-16,62,-46,31, +30,-27,-15,7,15}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_5_64_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_5_64_table.c new file mode 100644 index 0000000..2c66d51 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_5_64_table.c @@ -0,0 +1,98 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_5_64_table.c + Codebook for excitation in narrowband CELP mode (9600 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_5_64_table[320]={ +1,5,-15,49,-66, +-48,-4,50,-44,7, +37,16,-18,25,-26, +-26,-15,19,19,-27, +-47,28,57,5,-17, +-32,-41,68,21,-2, +64,56,8,-16,-13, +-26,-9,-16,11,6, +-39,25,-19,22,-31, +20,-45,55,-43,10, +-16,47,-40,40,-20, +-51,3,-17,-14,-15, +-24,53,-20,-46,46, +27,-68,32,3,-18, +-5,9,-31,16,-9, +-10,-1,-23,48,95, +47,25,-41,-32,-3, +15,-25,-55,36,41, +-27,20,5,13,14, +-22,5,2,-23,18, +46,-15,17,-18,-34, +-5,-8,27,-55,73, +16,2,-1,-17,40, +-78,33,0,2,19, +4,53,-16,-15,-16, +-28,-3,-13,49,8, +-7,-29,27,-13,32, +20,32,-61,16,14, +41,44,40,24,20, +7,4,48,-60,-77, +17,-6,-48,65,-15, +32,-30,-71,-10,-3, +-6,10,-2,-7,-29, +-56,67,-30,7,-5, +86,-6,-10,0,5, +-31,60,34,-38,-3, +24,10,-2,30,23, +24,-41,12,70,-43, +15,-17,6,13,16, +-13,8,30,-15,-8, +5,23,-34,-98,-4, +-13,13,-48,-31,70, +12,31,25,24,-24, +26,-7,33,-16,8, +5,-11,-14,-8,-65, +13,10,-2,-9,0, +-3,-68,5,35,7, +0,-31,-1,-17,-9, +-9,16,-37,-18,-1, +69,-48,-28,22,-21, +-11,5,49,55,23, +-86,-36,16,2,13, +63,-51,30,-11,13, +24,-18,-6,14,-19, +1,41,9,-5,27, +-36,-44,-34,-37,-21, +-26,31,-39,15,43, +5,-8,29,20,-8, +-20,-52,-28,-1,13, +26,-34,-10,-9,27, +-8,8,27,-66,4, +12,-22,49,10,-77, +32,-18,3,-38,12, +-3,-1,2,2,0}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/exc_8_128_table.c b/3rdparty/iaxclient-2/lib/libspeex/exc_8_128_table.c new file mode 100644 index 0000000..17ee64b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/exc_8_128_table.c @@ -0,0 +1,162 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: exc_8_128_table.c + Codebook for excitation in narrowband CELP mode (7000 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + + +const signed char exc_8_128_table[1024] = { +-14,9,13,-32,2,-10,31,-10, +-8,-8,6,-4,-1,10,-64,23, +6,20,13,6,8,-22,16,34, +7,42,-49,-28,5,26,4,-15, +41,34,41,32,33,24,23,14, +8,40,34,4,-24,-41,-19,-15, +13,-13,33,-54,24,27,-44,33, +27,-15,-15,24,-19,14,-36,14, +-9,24,-12,-4,37,-5,16,-34, +5,10,33,-15,-54,-16,12,25, +12,1,2,0,3,-1,-4,-4, +11,2,-56,54,27,-20,13,-6, +-46,-41,-33,-11,-5,7,12,14, +-14,-5,8,20,6,3,4,-8, +-5,-42,11,8,-14,25,-2,2, +13,11,-22,39,-9,9,5,-45, +-9,7,-9,12,-7,34,-17,-102, +7,2,-42,18,35,-9,-34,11, +-5,-2,3,22,46,-52,-25,-9, +-94,8,11,-5,-5,-5,4,-7, +-35,-7,54,5,-32,3,24,-9, +-22,8,65,37,-1,-12,-23,-6, +-9,-28,55,-33,14,-3,2,18, +-60,41,-17,8,-16,17,-11,0, +-11,29,-28,37,9,-53,33,-14, +-9,7,-25,-7,-11,26,-32,-8, +24,-21,22,-19,19,-10,29,-14, +0,0,0,0,0,0,0,0, +-5,-52,10,41,6,-30,-4,16, +32,22,-27,-22,32,-3,-28,-3, +3,-35,6,17,23,21,8,2, +4,-45,-17,14,23,-4,-31,-11, +-3,14,1,19,-11,2,61,-8, +9,-12,7,-10,12,-3,-24,99, +-48,23,50,-37,-5,-23,0,8, +-14,35,-64,-5,46,-25,13,-1, +-49,-19,-15,9,34,50,25,11, +-6,-9,-16,-20,-32,-33,-32,-27, +10,-8,12,-15,56,-14,-32,33, +3,-9,1,65,-9,-9,-10,-2, +-6,-23,9,17,3,-28,13,-32, +4,-2,-10,4,-16,76,12,-52, +6,13,33,-6,4,-14,-9,-3, +1,-15,-16,28,1,-15,11,16, +9,4,-21,-37,-40,-6,22,12, +-15,-23,-14,-17,-16,-9,-10,-9, +13,-39,41,5,-9,16,-38,25, +46,-47,4,49,-14,17,-2,6, +18,5,-6,-33,-22,44,50,-2, +1,3,-6,7,7,-3,-21,38, +-18,34,-14,-41,60,-13,6,16, +-24,35,19,-13,-36,24,3,-17, +-14,-10,36,44,-44,-29,-3,3, +-54,-8,12,55,26,4,-2,-5, +2,-11,22,-23,2,22,1,-25, +-39,66,-49,21,-8,-2,10,-14, +-60,25,6,10,27,-25,16,5, +-2,-9,26,-13,-20,58,-2,7, +52,-9,2,5,-4,-15,23,-1, +-38,23,8,27,-6,0,-27,-7, +39,-10,-14,26,11,-45,-12,9, +-5,34,4,-35,10,43,-22,-11, +56,-7,20,1,10,1,-26,9, +94,11,-27,-14,-13,1,-11,0, +14,-5,-6,-10,-4,-15,-8,-41, +21,-5,1,-28,-8,22,-9,33, +-23,-4,-4,-12,39,4,-7,3, +-60,80,8,-17,2,-6,12,-5, +1,9,15,27,31,30,27,23, +61,47,26,10,-5,-8,-12,-13, +5,-18,25,-15,-4,-15,-11,12, +-2,-2,-16,-2,-6,24,12,11, +-4,9,1,-9,14,-45,57,12, +20,-35,26,11,-64,32,-10,-10, +42,-4,-9,-16,32,24,7,10, +52,-11,-57,29,0,8,0,-6, +17,-17,-56,-40,7,20,18,12, +-6,16,5,7,-1,9,1,10, +29,12,16,13,-2,23,7,9, +-3,-4,-5,18,-64,13,55,-25, +9,-9,24,14,-25,15,-11,-40, +-30,37,1,-19,22,-5,-31,13, +-2,0,7,-4,16,-67,12,66, +-36,24,-8,18,-15,-23,19,0, +-45,-7,4,3,-13,13,35,5, +13,33,10,27,23,0,-7,-11, +43,-74,36,-12,2,5,-8,6, +-33,11,-16,-14,-5,-7,-3,17, +-34,27,-16,11,-9,15,33,-31, +8,-16,7,-6,-7,63,-55,-17, +11,-1,20,-46,34,-30,6,9, +19,28,-9,5,-24,-8,-23,-2, +31,-19,-16,-5,-15,-18,0,26, +18,37,-5,-15,-2,17,5,-27, +21,-33,44,12,-27,-9,17,11, +25,-21,-31,-7,13,33,-8,-25, +-7,7,-10,4,-6,-9,48,-82, +-23,-8,6,11,-23,3,-3,49, +-29,25,31,4,14,16,9,-4, +-18,10,-26,3,5,-44,-9,9, +-47,-55,15,9,28,1,4,-3, +46,6,-6,-38,-29,-31,-15,-6, +3,0,14,-6,8,-54,-50,33, +-5,1,-14,33,-48,26,-4,-5, +-3,-5,-3,-5,-28,-22,77,55, +-1,2,10,10,-9,-14,-66,-49, +11,-36,-6,-20,10,-10,16,12, +4,-1,-16,45,-44,-50,31,-2, +25,42,23,-32,-22,0,11,20, +-40,-35,-40,-36,-32,-26,-21,-13, +52,-22,6,-24,-20,17,-5,-8, +36,-25,-11,21,-26,6,34,-8, +7,20,-3,5,-25,-8,18,-5, +-9,-4,1,-9,20,20,39,48, +-24,9,5,-65,22,29,4,3, +-43,-11,32,-6,9,19,-27,-10, +-47,-14,24,10,-7,-36,-7,-1, +-4,-5,-5,16,53,25,-26,-29, +-4,-12,45,-58,-34,33,-5,2, +-1,27,-48,31,-15,22,-5,4, +7,7,-25,-3,11,-22,16,-12, +8,-3,7,-11,45,14,-73,-19, +56,-46,24,-20,28,-12,-2,-1, +-36,-3,-33,19,-6,7,2,-15, +5,-31,-45,8,35,13,20,0, +-9,48,-13,-43,-3,-13,2,-5, +72,-68,-27,2,1,-2,-7,5, +36,33,-40,-12,-4,-5,23,19}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/filters.c b/3rdparty/iaxclient-2/lib/libspeex/filters.c new file mode 100644 index 0000000..bfe7844 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/filters.c @@ -0,0 +1,636 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: filters.c + Various analysis/synthesis filters + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "filters.h" +#include "stack_alloc.h" +#include "misc.h" +#include "math_approx.h" +#include "ltp.h" +#include + +void bw_lpc(spx_word16_t gamma, const spx_coef_t *lpc_in, spx_coef_t *lpc_out, int order) +{ + int i; + spx_word16_t tmp=gamma; + lpc_out[0] = lpc_in[0]; + for (i=1;i max_val) + max_val = tmp; + } + + sig_shift=0; + while (max_val>16383) + { + sig_shift++; + max_val >>= 1; + } + + for (i=0;i= max_val) + max_val = tmp; + } + + sig_shift=0; + while (max_val>max_scale) + { + sig_shift++; + max_val >>= 1; + } + + for (i=0;i>1; + for (i=0;ilast_pitch=0; + mem->last_pitch_gain[0]=mem->last_pitch_gain[1]=mem->last_pitch_gain[2]=0; + mem->smooth_gain=1; +} + +#ifdef FIXED_POINT +#define COMB_STEP 32767 +#else +#define COMB_STEP 1.0 +#endif + +void comb_filter( +spx_sig_t *exc, /*decoded excitation*/ +spx_sig_t *new_exc, /*enhanced excitation*/ +spx_coef_t *ak, /*LPC filter coefs*/ +int p, /*LPC order*/ +int nsf, /*sub-frame size*/ +int pitch, /*pitch period*/ +spx_word16_t *pitch_gain, /*pitch gain (3-tap)*/ +spx_word16_t comb_gain, /*gain of comb filter*/ +CombFilterMem *mem +) +{ + int i; + spx_word16_t exc_energy=0, new_exc_energy=0; + spx_word16_t gain; + spx_word16_t step; + spx_word16_t fact; + + /*Compute excitation amplitude prior to enhancement*/ + exc_energy = compute_rms(exc, nsf); + /*for (i=0;ilast_pitch_gain); + if (g > 166) + comb_gain = MULT16_16_Q15(DIV32_16(SHL(165,15),g), comb_gain); + if (g < 64) + comb_gain = MULT16_16_Q15(SHL(g, 9), comb_gain); + } +#else + { + float g=0; + g = GAIN_SCALING_1*.5*(gain_3tap_to_1tap(pitch_gain)+gain_3tap_to_1tap(mem->last_pitch_gain)); + if (g>1.3) + comb_gain*=1.3/g; + if (g<.5) + comb_gain*=2.*g; + } +#endif + step = DIV32(COMB_STEP, nsf); + fact=0; + + /*Apply pitch comb-filter (filter out noise between pitch harmonics)*/ + for (i=0;ilast_pitch_gain[0],7),exc[i-mem->last_pitch+1]) + + MULT16_32_Q15(SHL16(mem->last_pitch_gain[1],7),exc[i-mem->last_pitch]) + + MULT16_32_Q15(SHL16(mem->last_pitch_gain[2],7),exc[i-mem->last_pitch-1]),2); + + new_exc[i] = exc[i] + MULT16_32_Q15(comb_gain, ADD32(MULT16_32_Q15(fact,exc1), MULT16_32_Q15(SUB16(COMB_STEP,fact), exc2))); + } + + mem->last_pitch_gain[0] = pitch_gain[0]; + mem->last_pitch_gain[1] = pitch_gain[1]; + mem->last_pitch_gain[2] = pitch_gain[2]; + mem->last_pitch = pitch; + + /*Amplitude after enhancement*/ + new_exc_energy = compute_rms(new_exc, nsf); + + if (exc_energy > new_exc_energy) + exc_energy = new_exc_energy; + + gain = DIV32_16(SHL32(EXTEND32(exc_energy),15),ADD16(1,new_exc_energy)); + +#ifdef FIXED_POINT + if (gain < 16384) + gain = 16384; +#else + if (gain < .5) + gain=.5; +#endif + +#ifdef FIXED_POINT + for (i=0;ismooth_gain = ADD16(MULT16_16_Q15(31457,mem->smooth_gain), MULT16_16_Q15(1311,gain)); + new_exc[i] = MULT16_32_Q15(mem->smooth_gain, new_exc[i]); + } +#else + for (i=0;ismooth_gain = .96*mem->smooth_gain + .04*gain; + new_exc[i] *= mem->smooth_gain; + } +#endif +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/filters.h b/3rdparty/iaxclient-2/lib/libspeex/filters.h new file mode 100644 index 0000000..de0b284 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/filters.h @@ -0,0 +1,89 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: filters.h + Various analysis/synthesis filters + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef FILTERS_H +#define FILTERS_H + +#include "misc.h" + +spx_word16_t compute_rms(const spx_sig_t *x, int len); +void signal_mul(const spx_sig_t *x, spx_sig_t *y, spx_word32_t scale, int len); +void signal_div(const spx_sig_t *x, spx_sig_t *y, spx_word32_t scale, int len); + +#ifdef FIXED_POINT + +int normalize16(const spx_sig_t *x, spx_word16_t *y, spx_sig_t max_scale, int len); + +#endif + +typedef struct CombFilterMem { + int last_pitch; + spx_word16_t last_pitch_gain[3]; + spx_word16_t smooth_gain; +} CombFilterMem; + + +void qmf_decomp(const spx_word16_t *xx, const spx_word16_t *aa, spx_sig_t *, spx_sig_t *y2, int N, int M, spx_word16_t *mem, char *stack); +void fir_mem_up(const spx_sig_t *x, const spx_word16_t *a, spx_sig_t *y, int N, int M, spx_word32_t *mem, char *stack); + + +void filter_mem2(const spx_sig_t *x, const spx_coef_t *num, const spx_coef_t *den, spx_sig_t *y, int N, int ord, spx_mem_t *mem); +void fir_mem2(const spx_sig_t *x, const spx_coef_t *num, spx_sig_t *y, int N, int ord, spx_mem_t *mem); +void iir_mem2(const spx_sig_t *x, const spx_coef_t *den, spx_sig_t *y, int N, int ord, spx_mem_t *mem); + +/* Apply bandwidth expansion on LPC coef */ +void bw_lpc(spx_word16_t , const spx_coef_t *lpc_in, spx_coef_t *lpc_out, int order); + + + +void syn_percep_zero(const spx_sig_t *x, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_sig_t *y, int N, int ord, char *stack); + +void residue_percep_zero(const spx_sig_t *xx, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_sig_t *y, int N, int ord, char *stack); + +void compute_impulse_response(const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack); + +void comb_filter_mem_init (CombFilterMem *mem); + +void comb_filter( +spx_sig_t *exc, /*decoded excitation*/ +spx_sig_t *new_exc, /*enhanced excitation*/ +spx_coef_t *ak, /*LPC filter coefs*/ +int p, /*LPC order*/ +int nsf, /*sub-frame size*/ +int pitch, /*pitch period*/ +spx_word16_t *pitch_gain, /*pitch gain (3-tap)*/ +spx_word16_t comb_gain, /*gain of comb filter*/ +CombFilterMem *mem +); + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/filters_arm4.h b/3rdparty/iaxclient-2/lib/libspeex/filters_arm4.h new file mode 100644 index 0000000..8a8a73b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/filters_arm4.h @@ -0,0 +1,375 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File: filters_arm4.h + ARM4-optimized filtering routines + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +int normalize16(const spx_sig_t *x, spx_word16_t *y, int max_scale, int len) +{ + int i; + spx_sig_t max_val=1; + int sig_shift; + int dead1, dead2, dead3, dead4, dead5, dead6; + + __asm__ __volatile__ ( + "\tmov %1, #1 \n" + "\tmov %3, #0 \n" + + ".normalize16loop1%=: \n" + + "\tldr %4, [%0], #4 \n" + "\tcmps %4, %1 \n" + "\tmovgt %1, %4 \n" + "\tcmps %4, %3 \n" + "\tmovlt %3, %4 \n" + + "\tsubs %2, %2, #1 \n" + "\tbne .normalize16loop1%=\n" + + "\trsb %3, %3, #0 \n" + "\tcmp %1, %3 \n" + "\tmovlt %1, %3 \n" + : "=r" (dead1), "=r" (max_val), "=r" (dead3), "=r" (dead4), + "=r" (dead5), "=r" (dead6) + : "0" (x), "2" (len) + : "cc"); + + sig_shift=0; + while (max_val>max_scale) + { + sig_shift++; + max_val >>= 1; + } + + __asm__ __volatile__ ( + ".normalize16loop%=: \n" + + "\tldr %4, [%0], #4 \n" + "\tldr %5, [%0], #4 \n" + "\tmov %4, %4, asr %3 \n" + "\tstrh %4, [%1], #2 \n" + "\tldr %4, [%0], #4 \n" + "\tmov %5, %5, asr %3 \n" + "\tstrh %5, [%1], #2 \n" + "\tldr %5, [%0], #4 \n" + "\tmov %4, %4, asr %3 \n" + "\tstrh %4, [%1], #2 \n" + "\tsubs %2, %2, #1 \n" + "\tmov %5, %5, asr %3 \n" + "\tstrh %5, [%1], #2 \n" + + "\tbge .normalize16loop%=\n" + : "=r" (dead1), "=r" (dead2), "=r" (dead3), "=r" (dead4), + "=r" (dead5), "=r" (dead6) + : "0" (x), "1" (y), "2" (len>>2), "3" (sig_shift) + : "cc", "memory"); + return sig_shift; +} + + +void filter_mem2(const spx_sig_t *x, const spx_coef_t *num, const spx_coef_t *den, spx_sig_t *y, int N, int ord, spx_mem_t *mem) +{ + int i,j; + spx_sig_t xi,yi,nyi; + + for (i=0;i + +void filter_mem2_10(const float *x, const float *_num, const float *_den, float *y, int N, int ord, float *_mem) +{ + __m128 num[3], den[3], mem[3]; + + int i; + + /* Copy numerator, denominator and memory to aligned xmm */ + for (i=0;i<2;i++) + { + mem[i] = _mm_loadu_ps(_mem+4*i); + num[i] = _mm_loadu_ps(_num+4*i+1); + den[i] = _mm_loadu_ps(_den+4*i+1); + } + mem[2] = _mm_setr_ps(_mem[8], _mem[9], 0, 0); + num[2] = _mm_setr_ps(_num[9], _num[10], 0, 0); + den[2] = _mm_setr_ps(_den[9], _den[10], 0, 0); + + for (i=0;i> (shift)) +#define SHL16(a,shift) ((a) << (shift)) +#define SHR32(a,shift) ((a) >> (shift)) +#define SHL32(a,shift) ((a) << (shift)) +#define PSHR16(a,shift) (SHR16((a)+(1<<((shift)-1)),shift)) +#define PSHR32(a,shift) (SHR32((a)+(1<<((shift)-1)),shift)) +#define SATURATE16(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) +#define SATURATE32(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) + +#define SHR(a,shift) ((a) >> (shift)) +#define SHL(a,shift) ((a) << (shift)) +#define SATURATE(x,a) ((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x)) +#define PSHR(a,shift) (SHR((a)+(1<<((shift)-1)),shift)) + +#define ADD16(a,b) ((a)+(b)) +#define SUB16(a,b) ((a)-(b)) +#define ADD32(a,b) ((a)+(b)) +#define SUB32(a,b) ((a)-(b)) +#define ADD64(a,b) ((a)+(b)) + + +/* result fits in 16 bits */ +#define MULT16_16_16(a,b) ((a)*(b)) + +#define MULT16_16(a,b) ((a)*(b)) + + + + +#define MAC16_16(c,a,b) (ADD32((c),MULT16_16((a),(b)))) +#define MULT16_32_Q12(a,b) ADD32(MULT16_16((a),SHR((b),12)), SHR(MULT16_16((a),((b)&0x00000fff)),12)) +#define MULT16_32_Q13(a,b) ADD32(MULT16_16((a),SHR((b),13)), SHR(MULT16_16((a),((b)&0x00001fff)),13)) +//#define MULT16_32_Q14(a,b) ADD32(MULT16_16((a),SHR((b),14)), SHR(MULT16_16((a),((b)&0x00003fff)),14)) +static inline spx_word32_t MULT16_32_Q14(spx_word16_t x, spx_word32_t y) { + int res; + int dummy; + asm ( + "smull %0,%1,%2,%3 \n\t" + "mov %0, %0, lsr #14 \n\t" + "add %0, %0, %1, lsl #18 \n\t" + : "=&r"(res), "=&r" (dummy) + : "r"(y),"r"((int)x)); + return(res); +} + +#define MULT16_32_Q11(a,b) ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11)) +#define MAC16_32_Q11(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11))) + +//#define MULT16_32_Q15(a,b) ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15)) +static inline spx_word32_t MULT16_32_Q15(spx_word16_t x, spx_word32_t y) { + int res; + int dummy; + asm ( + "smull %0,%1,%2,%3 \n\t" + "mov %0, %0, lsr #15 \n\t" + "add %0, %0, %1, lsl #17 \n\t" + : "=&r"(res), "=&r" (dummy) + : "r"(y),"r"((int)x)); + return(res); +} + +#define MAC16_32_Q15(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15))) + + +#define MAC16_16_Q11(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),11))) +#define MAC16_16_Q13(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),13))) + +#define MULT16_16_Q11_32(a,b) (SHR(MULT16_16((a),(b)),11)) +#define MULT16_16_Q13(a,b) (SHR(MULT16_16((a),(b)),13)) +#define MULT16_16_Q14(a,b) (SHR(MULT16_16((a),(b)),14)) +#define MULT16_16_Q15(a,b) (SHR(MULT16_16((a),(b)),15)) + +#define MULT16_16_P13(a,b) (SHR(ADD32(4096,MULT16_16((a),(b))),13)) +#define MULT16_16_P14(a,b) (SHR(ADD32(8192,MULT16_16((a),(b))),14)) +#define MULT16_16_P15(a,b) (SHR(ADD32(16384,MULT16_16((a),(b))),15)) + +#define MUL_16_32_R15(a,bh,bl) ADD32(MULT16_16((a),(bh)), SHR(MULT16_16((a),(bl)),15)) + + + +static inline short DIV32_16(int a, int b) +{ + int res=0; + int dead1, dead2, dead3, dead4, dead5; + __asm__ __volatile__ ( + "\teor %5, %0, %1\n" + "\tmovs %4, %0\n" + "\trsbmi %0, %0, #0 \n" + "\tmovs %4, %1\n" + "\trsbmi %1, %1, #0 \n" + "\tmov %4, #1\n" + + "\tsubs %3, %0, %1, asl #14 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #14 \n" + + "\tsubs %3, %0, %1, asl #13 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #13 \n" + + "\tsubs %3, %0, %1, asl #12 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #12 \n" + + "\tsubs %3, %0, %1, asl #11 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #11 \n" + + "\tsubs %3, %0, %1, asl #10 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #10 \n" + + "\tsubs %3, %0, %1, asl #9 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #9 \n" + + "\tsubs %3, %0, %1, asl #8 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #8 \n" + + "\tsubs %3, %0, %1, asl #7 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #7 \n" + + "\tsubs %3, %0, %1, asl #6 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #6 \n" + + "\tsubs %3, %0, %1, asl #5 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #5 \n" + + "\tsubs %3, %0, %1, asl #4 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #4 \n" + + "\tsubs %3, %0, %1, asl #3 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #3 \n" + + "\tsubs %3, %0, %1, asl #2 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #2 \n" + + "\tsubs %3, %0, %1, asl #1 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4, asl #1 \n" + + "\tsubs %3, %0, %1 \n" + "\tmovpl %0, %3 \n" + "\torrpl %2, %2, %4 \n" + + "\tmovs %5, %5, lsr #31 \n" + "\trsbne %2, %2, #0 \n" + : "=r" (dead1), "=r" (dead2), "=r" (res), + "=r" (dead3), "=r" (dead4), "=r" (dead5) + : "0" (a), "1" (b), "2" (res) + : "cc" + ); + return res; +} + +#define DIV32(a,b) (((signed int)(a))/((signed int)(b))) + + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/fixed_arm5e.h b/3rdparty/iaxclient-2/lib/libspeex/fixed_arm5e.h new file mode 100644 index 0000000..44479e5 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/fixed_arm5e.h @@ -0,0 +1,221 @@ +/* Copyright (C) 2003 Jean-Marc Valin */ +/** + @file fixed_generic.h + @brief ARM-tuned fixed-point operations +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef FIXED_ARM5E_H +#define FIXED_ARM5E_H + +#define NEG16(x) (-(x)) +#define NEG32(x) (-(x)) +#define EXTRACT16(x) ((spx_word16_t)x) +#define EXTEND32(x) ((spx_word32_t)x) +#define SHR16(a,shift) ((a) >> (shift)) +#define SHL16(a,shift) ((a) << (shift)) +#define SHR32(a,shift) ((a) >> (shift)) +#define SHL32(a,shift) ((a) << (shift)) +#define PSHR16(a,shift) (SHR16((a)+(1<<((shift)-1)),shift)) +#define PSHR32(a,shift) (SHR32((a)+(1<<((shift)-1)),shift)) +#define SATURATE16(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) +#define SATURATE32(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) + +#define SHR(a,shift) ((a) >> (shift)) +#define SHL(a,shift) ((a) << (shift)) +#define SATURATE(x,a) ((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x)) +#define PSHR(a,shift) (SHR((a)+(1<<((shift)-1)),shift)) + + +#define ADD16(a,b) ((short)((short)(a)+(short)(b))) +#define SUB16(a,b) ((a)-(b)) +#define ADD32(a,b) ((a)+(b)) +#define SUB32(a,b) ((a)-(b)) +#define ADD64(a,b) ((a)+(b)) + + +/* result fits in 16 bits */ +#define MULT16_16_16(a,b) (((short)(a))*((short)(b))) + +static inline spx_word32_t MULT16_16(spx_word16_t x, spx_word16_t y) { + int res; + asm ("smulbb %0,%1,%2;\n" + : "=&r"(res) + : "%r"(x),"r"(y)); + return(res); +} + +static inline spx_word32_t MAC16_16(spx_word32_t a, spx_word16_t x, spx_word32_t y) { + int res; + asm ("smlabb %0,%1,%2,%3;\n" + : "=&r"(res) + : "%r"(x),"r"(y),"r"(a)); + return(res); +} + +#define MULT16_32_Q12(a,b) ADD32(MULT16_16((a),SHR((b),12)), SHR(MULT16_16((a),((b)&0x00000fff)),12)) +#define MULT16_32_Q13(a,b) ADD32(MULT16_16((a),SHR((b),13)), SHR(MULT16_16((a),((b)&0x00001fff)),13)) +#define MULT16_32_Q14(a,b) ADD32(MULT16_16((a),SHR((b),14)), SHR(MULT16_16((a),((b)&0x00003fff)),14)) + +static inline spx_word32_t MULT16_32_Q15(spx_word16_t x, spx_word32_t y) { + int res; + asm ("smulwb %0,%1,%2;\n" + : "=&r"(res) + : "%r"(y<<1),"r"(x)); + return(res); +} +static inline spx_word32_t MAC16_32_Q15(spx_word32_t a, spx_word16_t x, spx_word32_t y) { + int res; + asm ("smlawb %0,%1,%2,%3;\n" + : "=&r"(res) + : "%r"(y<<1),"r"(x),"r"(a)); + return(res); +} +static inline spx_word32_t MULT16_32_Q11(spx_word16_t x, spx_word32_t y) { + int res; + asm ("smulwb %0,%1,%2;\n" + : "=&r"(res) + : "%r"(y<<5),"r"(x)); + return(res); +} +static inline spx_word32_t MAC16_32_Q11(spx_word32_t a, spx_word16_t x, spx_word32_t y) { + int res; + asm ("smlawb %0,%1,%2,%3;\n" + : "=&r"(res) + : "%r"(y<<5),"r"(x),"r"(a)); + return(res); +} + +#define MAC16_16_Q11(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),11))) +#define MAC16_16_Q13(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),13))) + +#define MULT16_16_Q11_32(a,b) (SHR(MULT16_16((a),(b)),11)) +#define MULT16_16_Q13(a,b) (SHR(MULT16_16((a),(b)),13)) +#define MULT16_16_Q14(a,b) (SHR(MULT16_16((a),(b)),14)) +#define MULT16_16_Q15(a,b) (SHR(MULT16_16((a),(b)),15)) + +#define MULT16_16_P13(a,b) (SHR(ADD32(4096,MULT16_16((a),(b))),13)) +#define MULT16_16_P14(a,b) (SHR(ADD32(8192,MULT16_16((a),(b))),14)) +#define MULT16_16_P15(a,b) (SHR(ADD32(16384,MULT16_16((a),(b))),15)) + +#define MUL_16_32_R15(a,bh,bl) ADD32(MULT16_16((a),(bh)), SHR(MULT16_16((a),(bl)),15)) + + +/* +#define DIV32_16(a,b) ((short)(((signed int)(a))/((short)(b)))) +*/ +static inline short DIV3216(int a, int b) +{ + int res=0; + int dead1, dead2, dead3, dead4, dead5; + __asm__ __volatile__ ( + "\teor %5, %0, %1\n" + "\tmovs %4, %0\n" + "\trsbmi %0, %0, #0 \n" + "\tmovs %4, %1\n" + "\trsbmi %1, %1, #0 \n" + "\tmov %4, #1\n" + + "\tsubs %3, %0, %1, asl #14 \n" + "\torrpl %2, %2, %4, asl #14 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #13 \n" + "\torrpl %2, %2, %4, asl #13 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #12 \n" + "\torrpl %2, %2, %4, asl #12 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #11 \n" + "\torrpl %2, %2, %4, asl #11 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #10 \n" + "\torrpl %2, %2, %4, asl #10 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #9 \n" + "\torrpl %2, %2, %4, asl #9 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #8 \n" + "\torrpl %2, %2, %4, asl #8 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #7 \n" + "\torrpl %2, %2, %4, asl #7 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #6 \n" + "\torrpl %2, %2, %4, asl #6 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #5 \n" + "\torrpl %2, %2, %4, asl #5 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #4 \n" + "\torrpl %2, %2, %4, asl #4 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #3 \n" + "\torrpl %2, %2, %4, asl #3 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #2 \n" + "\torrpl %2, %2, %4, asl #2 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1, asl #1 \n" + "\torrpl %2, %2, %4, asl #1 \n" + "\tmovpl %0, %3 \n" + + "\tsubs %3, %0, %1 \n" + "\torrpl %2, %2, %4 \n" + "\tmovpl %0, %3 \n" + + "\tmovs %5, %5, lsr #31 \n" + "\trsbne %2, %2, #0 \n" + : "=r" (dead1), "=r" (dead2), "=r" (res), + "=r" (dead3), "=r" (dead4), "=r" (dead5) + : "0" (a), "1" (b), "2" (res) + : "memory", "cc" + ); + return res; +} + + +#define DIV32(a,b) (((signed int)(a))/((signed int)(b))) + + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/fixed_debug.h b/3rdparty/iaxclient-2/lib/libspeex/fixed_debug.h new file mode 100644 index 0000000..ee003dd --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/fixed_debug.h @@ -0,0 +1,440 @@ +/* Copyright (C) 2003 Jean-Marc Valin */ +/** + @file fixed_debug.h + @brief Fixed-point operations with debugging +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef FIXED_DEBUG_H +#define FIXED_DEBUG_H + +#include + +extern long long spx_mips; +#define MIPS_INC spx_mips++, + +#define VERIFY_SHORT(x) ((x)<=32767&&(x)>=-32768) +#define VERIFY_INT(x) ((x)<=2147483647LL&&(x)>=-2147483648LL) + +static inline short NEG16(int x) +{ + int res; + if (!VERIFY_SHORT(x)) + { + fprintf (stderr, "NEG16: input is not short: %d\n", (int)x); + } + res = -x; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "NEG16: output is not short: %d\n", (int)res); + spx_mips++; + return res; +} +static inline int NEG32(long long x) +{ + long long res; + if (!VERIFY_INT(x)) + { + fprintf (stderr, "NEG16: input is not int: %d\n", (int)x); + } + res = -x; + if (!VERIFY_INT(res)) + fprintf (stderr, "NEG16: output is not int: %d\n", (int)res); + spx_mips++; + return res; +} + +static inline short EXTRACT16(int x) +{ + int res; + if (!VERIFY_SHORT(x)) + { + fprintf (stderr, "EXTRACT16: input is not short: %d\n", x); + } + res = x; + spx_mips++; + return res; +} + +static inline int EXTEND32(int x) +{ + int res; + if (!VERIFY_SHORT(x)) + { + fprintf (stderr, "EXTRACT16: input is not short: %d\n", x); + } + res = x; + spx_mips++; + return res; +} + +static inline short SHR16(int a, int shift) +{ + int res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(shift)) + { + fprintf (stderr, "SHR16: inputs are not short: %d %d\n", a, shift); + } + res = a>>shift; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "SHR16: output is not short: %d\n", res); + spx_mips++; + return res; +} +static inline short SHL16(int a, int shift) +{ + int res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(shift)) + { + fprintf (stderr, "SHR16: inputs are not short: %d %d\n", a, shift); + } + res = a<>shift; + if (!VERIFY_INT(res)) + fprintf (stderr, "SHR32: output is not int: %d\n", (int)res); + spx_mips++; + return res; +} +static inline int SHL32(long long a, int shift) +{ + long long res; + if (!VERIFY_INT(a) || !VERIFY_SHORT(shift)) + { + fprintf (stderr, "SHR32: inputs are not int: %d %d\n", (int)a, shift); + } + res = a<(a) ? (a) : (x)<-(a) ? -(a) : (x))) +#define SATURATE32(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) + +#define SHR(a,shift) ((a) >> (shift)) +#define SHL(a,shift) ((a) << (shift)) + +static inline short ADD16(int a, int b) +{ + int res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "ADD16: inputs are not short: %d %d\n", a, b); + } + res = a+b; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "ADD16: output is not short: %d\n", res); + spx_mips++; + return res; +} +static inline short SUB16(int a, int b) +{ + int res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "SUB16: inputs are not short: %d %d\n", a, b); + } + res = a-b; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "SUB16: output is not short: %d\n", res); + spx_mips++; + return res; +} + +static inline int ADD32(long long a, long long b) +{ + long long res; + if (!VERIFY_INT(a) || !VERIFY_INT(b)) + { + fprintf (stderr, "ADD32: inputs are not int: %d %d\n", (int)a, (int)b); + } + res = a+b; + if (!VERIFY_INT(res)) + fprintf (stderr, "ADD32: output is not int: %d\n", (int)res); + spx_mips++; + return res; +} + +static inline int SUB32(long long a, long long b) +{ + long long res; + if (!VERIFY_INT(a) || !VERIFY_INT(b)) + { + fprintf (stderr, "SUB32: inputs are not int: %d %d\n", (int)a, (int)b); + } + res = a-b; + if (!VERIFY_INT(res)) + fprintf (stderr, "SUB32: output is not int: %d\n", (int)res); + spx_mips++; + return res; +} + +#define ADD64(a,b) (MIPS_INC(a)+(b)) + +#define PSHR(a,shift) (SHR((a)+(1<<((shift)-1)),shift)) + +/* result fits in 16 bits */ +static inline short MULT16_16_16(int a, int b) +{ + int res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_16: inputs are not short: %d %d\n", a, b); + } + res = a*b; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_16: output is not short: %d\n", res); + spx_mips++; + return res; +} + +static inline int MULT16_16(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_16: output is not int: %d\n", (int)res); + spx_mips++; + return res; +} + +#define MAC16_16(c,a,b) (spx_mips--,ADD32((c),MULT16_16((a),(b)))) +#define MAC16_16_Q11(c,a,b) (ADD16((c),EXTRACT16(SHR32(MULT16_16((a),(b)),11)))) +#define MAC16_16_Q13(c,a,b) (ADD16((c),EXTRACT16(SHR32(MULT16_16((a),(b)),13)))) + +static inline int MULT16_32_QX(int a, long long b, int Q) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_INT(b)) + { + fprintf (stderr, "MULT16_32_Q%d: inputs are not short+int: %d %d\n", Q, (int)a, (int)b); + } + res = (((long long)a)*(long long)b) >> Q; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_32_Q%d: output is not int: %d*%d=%d\n", Q, (int)a, (int)b,(int)res); + spx_mips+=5; + return res; +} + + +#define MULT16_32_Q11(a,b) MULT16_32_QX(a,b,11) +#define MAC16_32_Q11(c,a,b) ADD32((c),MULT16_32_Q11((a),(b))) +#define MULT16_32_Q12(a,b) MULT16_32_QX(a,b,12) +#define MULT16_32_Q13(a,b) MULT16_32_QX(a,b,13) +#define MULT16_32_Q14(a,b) MULT16_32_QX(a,b,14) +#define MULT16_32_Q15(a,b) MULT16_32_QX(a,b,15) +#define MAC16_32_Q15(c,a,b) ADD32((c),MULT16_32_Q15((a),(b))) + +static inline int SATURATE(int a, int b) +{ + if (a>b) + a=b; + if (a<-b) + a = -b; + return a; +} + +static inline int MULT16_16_Q11_32(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_Q11: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res >>= 11; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_16_Q11: output is not short: %d*%d=%d\n", (int)a, (int)b, (int)res); + spx_mips+=3; + return res; +} +static inline short MULT16_16_Q13(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_Q13: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res >>= 13; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_Q13: output is not short: %d*%d=%d\n", a, b, (int)res); + spx_mips+=3; + return res; +} +static inline short MULT16_16_Q14(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_Q14: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res >>= 14; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_Q14: output is not short: %d\n", (int)res); + spx_mips+=3; + return res; +} +static inline short MULT16_16_Q15(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_Q15: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res >>= 15; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_Q15: output is not short: %d\n", (int)res); + spx_mips+=3; + return res; +} + +static inline short MULT16_16_P13(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_P13: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res += 4096; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_16_P13: overflow: %d*%d=%d\n", a, b, (int)res); + res >>= 13; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_P13: output is not short: %d*%d=%d\n", a, b, (int)res); + spx_mips+=4; + return res; +} +static inline short MULT16_16_P14(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_P14: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res += 8192; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_16_P14: overflow: %d*%d=%d\n", a, b, (int)res); + res >>= 14; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_P14: output is not short: %d*%d=%d\n", a, b, (int)res); + spx_mips+=4; + return res; +} +static inline short MULT16_16_P15(int a, int b) +{ + long long res; + if (!VERIFY_SHORT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "MULT16_16_P15: inputs are not short: %d %d\n", a, b); + } + res = ((long long)a)*b; + res += 16384; + if (!VERIFY_INT(res)) + fprintf (stderr, "MULT16_16_P15: overflow: %d*%d=%d\n", a, b, (int)res); + res >>= 15; + if (!VERIFY_SHORT(res)) + fprintf (stderr, "MULT16_16_P15: output is not short: %d*%d=%d\n", a, b, (int)res); + spx_mips+=4; + return res; +} + + +static inline int DIV32_16(long long a, long long b) +{ + long long res; + if (b==0) + { + fprintf(stderr, "DIV32_16: divide by zero: %d/%d\n", (int)a, (int)b); + return 0; + } + if (!VERIFY_INT(a) || !VERIFY_SHORT(b)) + { + fprintf (stderr, "DIV32_16: inputs are not int/short: %d %d\n", (int)a, (int)b); + } + res = a/b; + if (!VERIFY_SHORT(res)) + { + fprintf (stderr, "DIV32_16: output is not short: %d / %d = %d\n", (int)a,(int)b,(int)res); + if (res>32767) + res = 32767; + if (res<-32768) + res = -32768; + } + spx_mips+=20; + return res; +} +static inline int DIV32(long long a, long long b) +{ + long long res; + if (b==0) + { + fprintf(stderr, "DIV32: divide by zero: %d/%d\n", (int)a, (int)b); + return 0; + } + + if (!VERIFY_INT(a) || !VERIFY_INT(b)) + { + fprintf (stderr, "DIV32: inputs are not int/short: %d %d\n", (int)a, (int)b); + } + res = a/b; + if (!VERIFY_INT(res)) + fprintf (stderr, "DIV32: output is not int: %d\n", (int)res); + spx_mips+=36; + return res; +} + + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/fixed_generic.h b/3rdparty/iaxclient-2/lib/libspeex/fixed_generic.h new file mode 100644 index 0000000..6a40ad4 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/fixed_generic.h @@ -0,0 +1,103 @@ +/* Copyright (C) 2003 Jean-Marc Valin */ +/** + @file fixed_generic.h + @brief Generic fixed-point operations +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef FIXED_GENERIC_H +#define FIXED_GENERIC_H + +#define NEG16(x) (-(x)) +#define NEG32(x) (-(x)) +#define EXTRACT16(x) ((spx_word16_t)x) +#define EXTEND32(x) ((spx_word32_t)x) +#define SHR16(a,shift) ((a) >> (shift)) +#define SHL16(a,shift) ((a) << (shift)) +#define SHR32(a,shift) ((a) >> (shift)) +#define SHL32(a,shift) ((a) << (shift)) +#define PSHR16(a,shift) (SHR16((a)+(1<<((shift)-1)),shift)) +#define PSHR32(a,shift) (SHR32((a)+(1<<((shift)-1)),shift)) +#define SATURATE16(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) +#define SATURATE32(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) + +#define SHR(a,shift) ((a) >> (shift)) +#define SHL(a,shift) ((spx_word32_t)(a) << (shift)) +#define PSHR(a,shift) (SHR((a)+(1<<((shift)-1)),shift)) +#define SATURATE(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) + +static inline spx_word32_t slow_saturate(spx_word32_t x, spx_word16_t a) +{ + return (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))); +} + +#define ADD16(a,b) ((spx_word16_t)((spx_word16_t)(a)+(spx_word16_t)(b))) +#define SUB16(a,b) ((spx_word16_t)(a)-(spx_word16_t)(b)) +#define ADD32(a,b) ((spx_word32_t)(a)+(spx_word32_t)(b)) +#define SUB32(a,b) ((spx_word32_t)(a)-(spx_word32_t)(b)) +#define ADD64(a,b) ((spx_word64_t)(a)+(spx_word64_t)(b)) + + +/* result fits in 16 bits */ +#define MULT16_16_16(a,b) ((((spx_word16_t)(a))*((spx_word16_t)(b)))) + +/* (spx_word32_t)(spx_word16_t) gives TI compiler a hint that it's 16x16->32 multiply */ +#define MULT16_16(a,b) (((spx_word32_t)(spx_word16_t)(a))*((spx_word32_t)(spx_word16_t)(b))) + +#define MAC16_16(c,a,b) (ADD32((c),MULT16_16((a),(b)))) +#define MULT16_32_Q12(a,b) ADD32(MULT16_16((a),SHR((b),12)), SHR(MULT16_16((a),((b)&0x00000fff)),12)) +#define MULT16_32_Q13(a,b) ADD32(MULT16_16((a),SHR((b),13)), SHR(MULT16_16((a),((b)&0x00001fff)),13)) +#define MULT16_32_Q14(a,b) ADD32(MULT16_16((a),SHR((b),14)), SHR(MULT16_16((a),((b)&0x00003fff)),14)) + +#define MULT16_32_Q11(a,b) ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11)) +#define MAC16_32_Q11(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11))) + +#define MULT16_32_Q15(a,b) ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15)) +#define MAC16_32_Q15(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15))) + + +#define MAC16_16_Q11(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),11))) +#define MAC16_16_Q13(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),13))) + +#define MULT16_16_Q11_32(a,b) (SHR(MULT16_16((a),(b)),11)) +#define MULT16_16_Q13(a,b) (SHR(MULT16_16((a),(b)),13)) +#define MULT16_16_Q14(a,b) (SHR(MULT16_16((a),(b)),14)) +#define MULT16_16_Q15(a,b) (SHR(MULT16_16((a),(b)),15)) + +#define MULT16_16_P13(a,b) (SHR(ADD32(4096,MULT16_16((a),(b))),13)) +#define MULT16_16_P14(a,b) (SHR(ADD32(8192,MULT16_16((a),(b))),14)) +#define MULT16_16_P15(a,b) (SHR(ADD32(16384,MULT16_16((a),(b))),15)) + +#define MUL_16_32_R15(a,bh,bl) ADD32(MULT16_16((a),(bh)), SHR(MULT16_16((a),(bl)),15)) + +#define DIV32_16(a,b) ((spx_word16_t)(((spx_word32_t)(a))/((spx_word16_t)(b)))) +#define DIV32(a,b) (((spx_word32_t)(a))/((spx_word32_t)(b))) + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/gain_table.c b/3rdparty/iaxclient-2/lib/libspeex/gain_table.c new file mode 100644 index 0000000..54a5407 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/gain_table.c @@ -0,0 +1,160 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: gain_table.c + Codebook for 3-tap pitch prediction gain (128 entries) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +const signed char gain_cdbk_nb[384] = { +-32,-32,-32, +-28,-67,-5, +-42,-6,-32, +-57,-10,-54, +-16,27,-41, +19,-19,-40, +-45,24,-21, +-8,-14,-18, +1,14,-58, +-18,-88,-39, +-38,21,-18, +-19,20,-43, +10,17,-48, +-52,-58,-13, +-44,-1,-11, +-12,-11,-34, +14,0,-46, +-37,-35,-34, +-25,44,-30, +6,-4,-63, +-31,43,-41, +-23,30,-43, +-43,26,-14, +-33,1,-13, +-13,18,-37, +-46,-73,-45, +-36,24,-25, +-36,-11,-20, +-25,12,-18, +-36,-69,-59, +-45,6,8, +-22,-14,-24, +-1,13,-44, +-39,-48,-26, +-32,31,-37, +-33,15,-46, +-24,30,-36, +-41,31,-23, +-50,22,-4, +-22,2,-21, +-17,30,-34, +-7,-60,-28, +-38,42,-28, +-44,-11,21, +-16,8,-44, +-39,-55,-43, +-11,-35,26, +-9,0,-34, +-8,121,-81, +7,-16,-22, +-37,33,-31, +-27,-7,-36, +-34,70,-57, +-37,-11,-48, +-40,17,-1, +-33,6,-6, +-9,0,-20, +-21,69,-33, +-29,33,-31, +-55,12,-1, +-33,27,-22, +-50,-33,-47, +-50,54,51, +-1,-5,-44, +-4,22,-40, +-39,-66,-25, +-33,1,-26, +-24,-23,-25, +-11,21,-45, +-25,-45,-19, +-43,105,-16, +5,-21,1, +-16,11,-33, +-13,-99,-4, +-37,33,-15, +-25,37,-63, +-36,24,-31, +-53,-56,-38, +-41,-4,4, +-33,13,-30, +49,52,-94, +-5,-30,-15, +1,38,-40, +-23,12,-36, +-17,40,-47, +-37,-41,-39, +-49,34,0, +-18,-7,-4, +-16,17,-27, +30,5,-62, +4,48,-68, +-43,11,-11, +-18,19,-15, +-23,-62,-39, +-42,10,-2, +-21,-13,-13, +-9,13,-47, +-23,-62,-24, +-44,60,-21, +-18,-3,-52, +-22,22,-36, +-75,57,16, +-19,3,10, +-29,23,-38, +-5,-62,-51, +-51,40,-18, +-42,13,-24, +-34,14,-20, +-56,-75,-26, +-26,32,15, +-26,17,-29, +-7,28,-52, +-12,-30,5, +-5,-48,-5, +2,2,-43, +21,16,16, +-25,-45,-32, +-43,18,-10, +9,0,-1, +-1,7,-30, +19,-48,-4, +-28,25,-29, +-22,0,-31, +-32,17,-10, +-64,-41,-62, +-52,15,16, +-30,-22,-32, +-7,9,-38}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/gain_table_lbr.c b/3rdparty/iaxclient-2/lib/libspeex/gain_table_lbr.c new file mode 100644 index 0000000..24357f0 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/gain_table_lbr.c @@ -0,0 +1,64 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: gain_table_lbr.c + Codebook for 3-tap pitch prediction gain (32 entries) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +const signed char gain_cdbk_lbr[96] = { +-32,-32,-32, +-31,-58,-16, +-41,-24,-43, +-56,-22,-55, +-13,33,-41, +-4,-39,-9, +-41,15,-12, +-8,-15,-12, +1,2,-44, +-22,-66,-42, +-38,28,-23, +-21,14,-37, +0,21,-50, +-53,-71,-27, +-37,-1,-19, +-19,-5,-28, +6,65,-44, +-33,-48,-33, +-40,57,-14, +-17,4,-45, +-31,38,-33, +-23,28,-40, +-43,29,-12, +-34,13,-23, +-16,15,-27, +-14,-82,-15, +-31,25,-32, +-21,5,-5, +-47,-63,-51, +-46,12,3, +-28,-17,-29, +-10,14,-40}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/hexc_10_32_table.c b/3rdparty/iaxclient-2/lib/libspeex/hexc_10_32_table.c new file mode 100644 index 0000000..8dd408f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/hexc_10_32_table.c @@ -0,0 +1,66 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: hexc_10_32_table.c + Codebook for high-band excitation in SB-CELP mode (4000 bps) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +const signed char hexc_10_32_table[320] = { +-3, -2, -1, 0, -4, 5, 35, -40, -9, 13, +-44, 5, -27, -1, -7, 6, -11, 7, -8, 7, +19, -14, 15, -4, 9, -10, 10, -8, 10, -9, +-1, 1, 0, 0, 2, 5, -18, 22, -53, 50, +1, -23, 50, -36, 15, 3, -13, 14, -10, 6, +1, 5, -3, 4, -2, 5, -32, 25, 5, -2, +-1, -4, 1, 11, -29, 26, -6, -15, 30, -18, +0, 15, -17, 40, -41, 3, 9, -2, -2, 3, +-3, -1, -5, 2, 21, -6, -16, -21, 23, 2, +60, 15, 16, -16, -9, 14, 9, -1, 7, -9, +0, 1, 1, 0, -1, -6, 17, -28, 54, -45, +-1, 1, -1, -6, -6, 2, 11, 26, -29, -2, +46, -21, 34, 12, -23, 32, -23, 16, -10, 3, +66, 19, -20, 24, 7, 11, -3, 0, -3, -1, +-50, -46, 2, -18, -3, 4, -1, -2, 3, -3, +-19, 41, -36, 9, 11, -24, 21, -16, 9, -3, +-25, -3, 10, 18, -9, -2, -5, -1, -5, 6, +-4, -3, 2, -26, 21, -19, 35, -15, 7, -13, +17, -19, 39, -43, 48, -31, 16, -9, 7, -2, +-5, 3, -4, 9, -19, 27, -55, 63, -35, 10, +26, -44, -2, 9, 4, 1, -6, 8, -9, 5, +-8, -1, -3, -16, 45, -42, 5, 15, -16, 10, +0, 0, 0, 0, 0, 0, 0, 0, 0, 0, +-16, 24, -55, 47, -38, 27, -19, 7, -3, 1, +16, 27, 20, -19, 18, 5, -7, 1, -5, 2, +-6, 8, -22, 0, -3, -3, 8, -1, 7, -8, +1, -3, 5, 0, 17, -48, 58, -52, 29, -7, +-2, 3, -10, 6, -26, 58, -31, 1, -6, 3, +93, -29, 39, 3, 17, 5, 6, -1, -1, -1, +27, 13, 10, 19, -7, -34, 12, 10, -4, 9, +-76, 9, 8, -28, -2, -11, 2, -1, 3, 1, +-83, 38, -39, 4, -16, -6, -2, -5, 5, -2, +}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/hexc_table.c b/3rdparty/iaxclient-2/lib/libspeex/hexc_table.c new file mode 100644 index 0000000..268408a --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/hexc_table.c @@ -0,0 +1,162 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: hexc_table.c + Codebook for high-band excitation in SB-CELP mode (8000 bps with sign) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +const signed char hexc_table[1024] = { +-24, 21, -20, 5, -5, -7, 14, -10, +2, -27, 16, -20, 0, -32, 26, 19, +8, -11, -41, 31, 28, -27, -32, 34, +42, 34, -17, 22, -10, 13, -29, 18, +-12, -26, -24, 11, 22, 5, -5, -5, +54, -68, -43, 57, -25, 24, 4, 4, +26, -8, -12, -17, 54, 30, -45, 1, +10, -15, 18, -41, 11, 68, -67, 37, +-16, -24, -16, 38, -22, 6, -29, 30, +66, -27, 5, 7, -16, 13, 2, -12, +-7, -3, -20, 36, 4, -28, 9, 3, +32, 48, 26, 39, 3, 0, 7, -21, +-13, 5, -82, -7, 73, -20, 34, -9, +-5, 1, -1, 10, -5, -10, -1, 9, +1, -9, 10, 0, -14, 11, -1, -2, +-1, 11, 20, 96, -81, -22, -12, -9, +-58, 9, 24, -30, 26, -35, 27, -12, +13, -18, 56, -59, 15, -7, 23, -15, +-1, 6, -25, 14, -22, -20, 47, -11, +16, 2, 38, -23, -19, -30, -9, 40, +-11, 5, 4, -6, 8, 26, -21, -11, +127, 4, 1, 6, -9, 2, -7, -2, +-3, 7, -5, 10, -19, 7, -106, 91, +-3, 9, -4, 21, -8, 26, -80, 8, +1, -2, -10, -17, -17, -27, 32, 71, +6, -29, 11, -23, 54, -38, 29, -22, +39, 87, -31, -12, -20, 3, -2, -2, +2, 20, 0, -1, -35, 27, 9, -6, +-12, 3, -12, -6, 13, 1, 14, -22, +-59, -15, -17, -25, 13, -7, 7, 3, +0, 1, -7, 6, -3, 61, -37, -23, +-23, -29, 38, -31, 27, 1, -8, 2, +-27, 23, -26, 36, -34, 5, 24, -24, +-6, 7, 3, -59, 78, -62, 44, -16, +1, 6, 0, 17, 8, 45, 0, -110, +6, 14, -2, 32, -77, -56, 62, -3, +3, -13, 4, -16, 102, -15, -36, -1, +9, -113, 6, 23, 0, 9, 9, 5, +-8, -1, -14, 5, -12, 121, -53, -27, +-8, -9, 22, -13, 3, 2, -3, 1, +-2, -71, 95, 38, -19, 15, -16, -5, +71, 10, 2, -32, -13, -5, 15, -1, +-2, -14, -85, 30, 29, 6, 3, 2, +0, 0, 0, 0, 0, 0, 0, 0, +2, -65, -56, -9, 18, 18, 23, -14, +-2, 0, 12, -29, 26, -12, 1, 2, +-12, -64, 90, -6, 4, 1, 5, -5, +-110, -3, -31, 22, -29, 9, 0, 8, +-40, -5, 21, -5, -5, 13, 10, -18, +40, 1, 35, -20, 30, -28, 11, -6, +19, 7, 14, 18, -64, 9, -6, 16, +51, 68, 8, 16, 12, -8, 0, -9, +20, -22, 25, 7, -4, -13, 41, -35, +93, -18, -54, 11, -1, 1, -9, 4, +-66, 66, -31, 20, -22, 25, -23, 11, +10, 9, 19, 15, 11, -5, -31, -10, +-23, -28, -6, -6, -3, -4, 5, 3, +-28, 22, -11, -42, 25, -25, -16, 41, +34, 47, -6, 2, 42, -19, -22, 5, +-39, 32, 6, -35, 22, 17, -30, 8, +-26, -11, -11, 3, -12, 33, 33, -37, +21, -1, 6, -4, 3, 0, -5, 5, +12, -12, 57, 27, -61, -3, 20, -17, +2, 0, 4, 0, -2, -33, -58, 81, +-23, 39, -10, -5, 2, 6, -7, 5, +4, -3, -2, -13, -23, -72, 107, 15, +-5, 0, -7, -3, -6, 5, -4, 15, +47, 12, -31, 25, -16, 8, 22, -25, +-62, -56, -18, 14, 28, 12, 2, -11, +74, -66, 41, -20, -7, 16, -20, 16, +-8, 0, -16, 4, -19, 92, 12, -59, +-14, -39, 49, -25, -16, 23, -27, 19, +-3, -33, 19, 85, -29, 6, -7, -10, +16, -7, -12, 1, -6, 2, 4, -2, +64, 10, -25, 41, -2, -31, 15, 0, +110, 50, 69, 35, 28, 19, -10, 2, +-43, -49, -56, -15, -16, 10, 3, 12, +-1, -8, 1, 26, -12, -1, 7, -11, +-27, 41, 25, 1, -11, -18, 22, -7, +-1, -47, -8, 23, -3, -17, -7, 18, +-125, 59, -5, 3, 18, 1, 2, 3, +27, -35, 65, -53, 50, -46, 37, -21, +-28, 7, 14, -37, -5, -5, 12, 5, +-8, 78, -19, 21, -6, -16, 8, -7, +5, 2, 7, 2, 10, -6, 12, -60, +44, 11, -36, -32, 31, 0, 2, -2, +2, 1, -3, 7, -10, 17, -21, 10, +6, -2, 19, -2, 59, -38, -86, 38, +8, -41, -30, -45, -33, 7, 15, 28, +29, -7, 24, -40, 7, 7, 5, -2, +9, 24, -23, -18, 6, -29, 30, 2, +28, 49, -11, -46, 10, 43, -13, -9, +-1, -3, -7, -7, -17, -6, 97, -33, +-21, 3, 5, 1, 12, -43, -8, 28, +7, -43, -7, 17, -20, 19, -1, 2, +-13, 9, 54, 34, 9, -28, -11, -9, +-17, 110, -59, 44, -26, 0, 3, -12, +-47, 73, -34, -43, 38, -33, 16, -5, +-46, -4, -6, -2, -25, 19, -29, 28, +-13, 5, 14, 27, -40, -43, 4, 32, +-13, -2, -35, -4, 112, -42, 9, -12, +37, -28, 17, 14, -19, 35, -39, 23, +3, -14, -1, -57, -5, 94, -9, 3, +-39, 5, 30, -10, -32, 42, -13, -14, +-97, -63, 30, -9, 1, -7, 12, 5, +20, 17, -9, -36, -30, 25, 47, -9, +-15, 12, -22, 98, -8, -50, 15, -27, +21, -16, -11, 2, 12, -10, 10, -3, +33, 36, -96, 0, -17, 31, -9, 9, +3, -20, 13, -11, 8, -4, 10, -10, +9, 1, 112, -70, -27, 5, -21, 2, +-57, -3, -29, 10, 19, -21, 21, -10, +-66, -3, 91, -35, 30, -12, 0, -7, +59, -28, 26, 2, 14, -18, 1, 1, +11, 17, 20, -54, -59, 27, 4, 29, +32, 5, 19, 12, -4, 1, 7, -10, +5, -2, 10, 0, 23, -5, 28, -104, +46, 11, 16, 3, 29, 1, -8, -14, +1, 7, -50, 88, -62, 26, 8, -17, +-14, 50, 0, 32, -12, -3, -27, 18, +-8, -5, 8, 3, -20, -11, 37, -12, +9, 33, 46, -101, -1, -4, 1, 6, +-1, 28, -42, -15, 16, 5, -1, -2, +-55, 85, 38, -9, -4, 11, -2, -9, +-6, 3, -20, -10, -77, 89, 24, -3, +-104, -57, -26, -31, -20, -6, -9, 14, +20, -23, 46, -15, -31, 28, 1, -15, +-2, 6, -2, 31, 45, -76, 23, -25, +}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/high_lsp_tables.c b/3rdparty/iaxclient-2/lib/libspeex/high_lsp_tables.c new file mode 100644 index 0000000..e82e875 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/high_lsp_tables.c @@ -0,0 +1,163 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: high_lsp_tables.c + Codebooks for high-band LSPs in SB-CELP mode + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +const signed char high_lsp_cdbk[512]={ +39,12,-14,-20,-29,-61,-67,-76, +-32,-71,-67,68,77,46,34,5, +-13,-48,-46,-72,-81,-84,-60,-58, +-40,-28,82,93,68,45,29,3, +-19,-47,-28,-43,-35,-30,-8,-13, +-39,-91,-91,-123,-96,10,10,-6, +-18,-55,-60,-91,-56,-36,-27,-16, +-48,-75,40,28,-10,-28,35,9, +37,19,1,-20,-31,-41,-18,-25, +-35,-68,-80,45,27,-1,47,13, +0,-29,-35,-57,-50,-79,-73,-38, +-19,5,35,14,-10,-23,16,-8, +5,-24,-40,-62,-23,-27,-22,-16, +-18,-46,-72,-77,43,21,33,1, +-80,-70,-70,-64,-56,-52,-39,-33, +-31,-38,-19,-19,-15,32,33,-2, +7,-15,-15,-24,-23,-33,-41,-56, +-24,-57,5,89,64,41,27,5, +-9,-47,-60,-97,-97,-124,-20,-9, +-44,-73,31,29,-4,64,48,7, +-35,-57,0,-3,-26,-47,-3,-6, +-40,-76,-79,-48,12,81,55,10, +9,-24,-43,-73,-57,-69,16,5, +-28,-53,18,29,20,0,-4,-11, +6,-13,23,7,-17,-35,-37,-37, +-30,-68,-63,6,24,-9,-14,3, +21,-13,-27,-57,-49,-80,-24,-41, +-5,-16,-5,1,45,25,12,-7, +3,-15,-6,-16,-15,-8,6,-13, +-42,-81,-80,-87,14,1,-10,-3, +-43,-69,-46,-24,-28,-29,36,6, +-43,-56,-12,12,54,79,43,9, +54,22,2,8,-12,-43,-46,-52, +-38,-69,-89,-5,75,38,33,5, +-13,-53,-62,-87,-89,-113,-99,-55, +-34,-37,62,55,33,16,21,-2, +-17,-46,-29,-38,-38,-48,-39,-42, +-36,-75,-72,-88,-48,-30,21,2, +-15,-57,-64,-98,-84,-76,25,1, +-46,-80,-12,18,-7,3,34,6, +38,31,23,4,-1,20,14,-15, +-43,-78,-91,-24,14,-3,54,16, +0,-27,-28,-44,-56,-83,-92,-89, +-3,34,56,41,36,22,20,-8, +-7,-35,-42,-62,-49,3,12,-10, +-50,-87,-96,-66,92,70,38,9, +-70,-71,-62,-42,-39,-43,-11,-7, +-50,-79,-58,-50,-31,32,31,-6, +-4,-25,7,-17,-38,-70,-58,-27, +-43,-83,-28,59,36,20,31,2, +-27,-71,-80,-109,-98,-75,-33,-32, +-31,-2,33,15,-6,43,33,-5, +0,-22,-10,-27,-34,-49,-11,-20, +-41,-91,-100,-121,-39,57,41,10, +-19,-50,-38,-59,-60,-70,-18,-20, +-8,-31,-8,-15,1,-14,-26,-25, +33,21,32,17,1,-19,-19,-26, +-58,-81,-35,-22,45,30,11,-11, +3,-26,-48,-87,-67,-83,-58,3, +-1,-26,-20,44,10,25,39,5, +-9,-35,-27,-38,7,10,4,-9, +-42,-85,-102,-127,52,44,28,10, +-47,-61,-40,-39,-17,-1,-10,-33, +-42,-74,-48,21,-4,70,52,10}; + + +const signed char high_lsp_cdbk2[512]={ +-36,-62,6,-9,-10,-14,-56,23, +1,-26,23,-48,-17,12,8,-7, +23,29,-36,-28,-6,-29,-17,-5, +40,23,10,10,-46,-13,36,6, +4,-30,-29,62,32,-32,-1,22, +-14,1,-4,-22,-45,2,54,4, +-30,-57,-59,-12,27,-3,-31,8, +-9,5,10,-14,32,66,19,9, +2,-25,-37,23,-15,18,-38,-31, +5,-9,-21,15,0,22,62,30, +15,-12,-14,-46,77,21,33,3, +34,29,-19,50,2,11,9,-38, +-12,-37,62,1,-15,54,32,6, +2,-24,20,35,-21,2,19,24, +-13,55,4,9,39,-19,30,-1, +-21,73,54,33,8,18,3,15, +6,-19,-47,6,-3,-48,-50,1, +26,20,8,-23,-50,65,-14,-55, +-17,-31,-37,-28,53,-1,-17,-53, +1,57,11,-8,-25,-30,-37,64, +5,-52,-45,15,23,31,15,14, +-25,24,33,-2,-44,-56,-18,6, +-21,-43,4,-12,17,-37,20,-10, +34,15,2,15,55,21,-11,-31, +-6,46,25,16,-9,-25,-8,-62, +28,17,20,-32,-29,26,30,25, +-19,2,-16,-17,26,-51,2,50, +42,19,-66,23,29,-2,3,19, +-19,-37,32,15,6,30,-34,13, +11,-5,40,31,10,-42,4,-9, +26,-9,-70,17,-2,-23,20,-22, +-55,51,-24,-31,22,-22,15,-13, +3,-10,-28,-16,56,4,-63,11, +-18,-15,-18,-38,-35,16,-7,34, +-1,-21,-49,-47,9,-37,7,8, +69,55,20,6,-33,-45,-10,-9, +6,-9,12,71,15,-3,-42,-7, +-24,32,-35,-2,-42,-17,-5,0, +-2,-33,-54,13,-12,-34,47,23, +19,55,7,-8,74,31,14,16, +-23,-26,19,12,-18,-49,-28,-31, +-20,2,-14,-20,-47,78,40,13, +-23,-11,21,-6,18,1,47,5, +38,35,32,46,22,8,13,16, +-14,18,51,19,40,39,11,-26, +-1,-17,47,2,-53,-15,31,-22, +38,21,-15,-16,5,-33,53,15, +-38,86,11,-3,-24,49,13,-4, +-11,-18,28,20,-12,-27,-26,35, +-25,-35,-3,-20,-61,30,10,-55, +-12,-22,-52,-54,-14,19,-32,-12, +45,15,-8,-48,-9,11,-32,8, +-16,-34,-13,51,18,38,-2,-32, +-17,22,-2,-18,-28,-70,59,27, +-28,-19,-10,-20,-9,-9,-8,-21, +21,-8,35,-2,45,-3,-9,12, +0,30,7,-39,43,27,-38,-91, +30,26,19,-55,-4,63,14,-17, +13,9,13,2,7,4,6,61, +72,-1,-17,29,-1,-22,-17,8, +-28,-37,63,44,41,3,2,14, +9,-6,75,-8,-7,-12,-15,-12, +13,9,-4,30,-22,-65,15,0, +-45,4,-4,1,5,22,11,23}; diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex.h new file mode 100644 index 0000000..6eb1124 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex.h @@ -0,0 +1,410 @@ +/* Copyright (C) 2002 Jean-Marc Valin*/ +/** + @file speex.h + @brief Describes the different modes of the codec +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef SPEEX_H +#define SPEEX_H + +#include "speex/speex_bits.h" +#include "speex/speex_types.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/* Values allowed for *ctl() requests */ + +/** Set enhancement on/off (decoder only) */ +#define SPEEX_SET_ENH 0 +/** Get enhancement state (decoder only) */ +#define SPEEX_GET_ENH 1 + +/*Would be SPEEX_SET_FRAME_SIZE, but it's (currently) invalid*/ +/** Obtain frame size used by encoder/decoder */ +#define SPEEX_GET_FRAME_SIZE 3 + +/** Set quality value */ +#define SPEEX_SET_QUALITY 4 +/** Get current quality setting */ +/* #define SPEEX_GET_QUALITY 5 -- Doesn't make much sense, does it? */ + +/** Set sub-mode to use */ +#define SPEEX_SET_MODE 6 +/** Get current sub-mode in use */ +#define SPEEX_GET_MODE 7 + +/** Set low-band sub-mode to use (wideband only)*/ +#define SPEEX_SET_LOW_MODE 8 +/** Get current low-band mode in use (wideband only)*/ +#define SPEEX_GET_LOW_MODE 9 + +/** Set high-band sub-mode to use (wideband only)*/ +#define SPEEX_SET_HIGH_MODE 10 +/** Get current high-band mode in use (wideband only)*/ +#define SPEEX_GET_HIGH_MODE 11 + +/** Set VBR on (1) or off (0) */ +#define SPEEX_SET_VBR 12 +/** Get VBR status (1 for on, 0 for off) */ +#define SPEEX_GET_VBR 13 + +/** Set quality value for VBR encoding (0-10) */ +#define SPEEX_SET_VBR_QUALITY 14 +/** Get current quality value for VBR encoding (0-10) */ +#define SPEEX_GET_VBR_QUALITY 15 + +/** Set complexity of the encoder (0-10) */ +#define SPEEX_SET_COMPLEXITY 16 +/** Get current complexity of the encoder (0-10) */ +#define SPEEX_GET_COMPLEXITY 17 + +/** Set bit-rate used by the encoder (or lower) */ +#define SPEEX_SET_BITRATE 18 +/** Get current bit-rate used by the encoder or decoder */ +#define SPEEX_GET_BITRATE 19 + +/**Define a handler function for in-band Speex request*/ +#define SPEEX_SET_HANDLER 20 + +/**Define a handler function for in-band user-defined request*/ +#define SPEEX_SET_USER_HANDLER 22 + +/** Set sampling rate used in bit-rate computation */ +#define SPEEX_SET_SAMPLING_RATE 24 +/** Get sampling rate used in bit-rate computation */ +#define SPEEX_GET_SAMPLING_RATE 25 + +/** Reset the encoder/decoder memories to zero*/ +#define SPEEX_RESET_STATE 26 + +/** Get VBR info (mostly used internally) */ +#define SPEEX_GET_RELATIVE_QUALITY 29 + +/** Set VAD status (1 for on, 0 for off) */ +#define SPEEX_SET_VAD 30 + +/** Get VAD status (1 for on, 0 for off) */ +#define SPEEX_GET_VAD 31 + +/** Set Average Bit-Rate (ABR) to n bits per seconds */ +#define SPEEX_SET_ABR 32 +/** Get Average Bit-Rate (ABR) setting (in bps) */ +#define SPEEX_GET_ABR 33 + +/** Set DTX status (1 for on, 0 for off) */ +#define SPEEX_SET_DTX 34 +/** Get DTX status (1 for on, 0 for off) */ +#define SPEEX_GET_DTX 35 + +/** Set submode encoding in each frame (1 for yes, 0 for no, setting to no breaks the standard) */ +#define SPEEX_SET_SUBMODE_ENCODING 36 +/** */ +#define SPEEX_GET_SUBMODE_ENCODING 37 + +/*#define SPEEX_SET_LOOKAHEAD 38*/ +/** Returns the lookahead used by Speex */ +#define SPEEX_GET_LOOKAHEAD 39 + +/** Sets tuning for packet-loss concealment (expected loss rate) */ +#define SPEEX_SET_PLC_TUNING 40 +/** Gets tuning for PLC */ +#define SPEEX_GET_PLC_TUNING 41 + +/* Used internally, not to be used in applications */ +/** Used internally*/ +#define SPEEX_GET_PI_GAIN 100 +/** Used internally*/ +#define SPEEX_GET_EXC 101 +/** Used internally*/ +#define SPEEX_GET_INNOV 102 +/** Used internally*/ +#define SPEEX_GET_DTX_STATUS 103 + + +/* Preserving compatibility:*/ +/** Equivalent to SPEEX_SET_ENH */ +#define SPEEX_SET_PF 0 +/** Equivalent to SPEEX_GET_ENH */ +#define SPEEX_GET_PF 1 + + + + +/* Values allowed for mode queries */ +/** Query the frame size of a mode */ +#define SPEEX_MODE_FRAME_SIZE 0 + +/** Query the size of an encoded frame for a particular sub-mode */ +#define SPEEX_SUBMODE_BITS_PER_FRAME 1 + + + +#define SPEEX_LIB_GET_MAJOR_VERSION 1 +#define SPEEX_LIB_GET_MINOR_VERSION 3 +#define SPEEX_LIB_GET_MICRO_VERSION 5 +#define SPEEX_LIB_GET_EXTRA_VERSION 7 +#define SPEEX_LIB_GET_VERSION_STRING 9 + +/*#define SPEEX_LIB_SET_ALLOC_FUNC 10 +#define SPEEX_LIB_GET_ALLOC_FUNC 11 +#define SPEEX_LIB_SET_FREE_FUNC 12 +#define SPEEX_LIB_GET_FREE_FUNC 13 + +#define SPEEX_LIB_SET_WARNING_FUNC 14 +#define SPEEX_LIB_GET_WARNING_FUNC 15 +#define SPEEX_LIB_SET_ERROR_FUNC 16 +#define SPEEX_LIB_GET_ERROR_FUNC 17 +*/ + +/** Number of defined modes in Speex */ +#define SPEEX_NB_MODES 3 + +/** modeID for the defined narrowband mode */ +#define SPEEX_MODEID_NB 0 + +/** modeID for the defined wideband mode */ +#define SPEEX_MODEID_WB 1 + +/** modeID for the defined ultra-wideband mode */ +#define SPEEX_MODEID_UWB 2 + +#ifdef EPIC_48K +/** modeID for the Epic 48K mode */ +#define SPEEX_MODEID_NB_48K 1000 +#endif + +struct SpeexMode; + + +/* Prototypes for mode function pointers */ + +/** Encoder state initialization function */ +typedef void *(*encoder_init_func)(const struct SpeexMode *mode); + +/** Encoder state destruction function */ +typedef void (*encoder_destroy_func)(void *st); + +/** Main encoding function */ +typedef int (*encode_func)(void *state, void *in, SpeexBits *bits); + +/** Function for controlling the encoder options */ +typedef int (*encoder_ctl_func)(void *state, int request, void *ptr); + +/** Decoder state initialization function */ +typedef void *(*decoder_init_func)(const struct SpeexMode *mode); + +/** Decoder state destruction function */ +typedef void (*decoder_destroy_func)(void *st); + +/** Main decoding function */ +typedef int (*decode_func)(void *state, SpeexBits *bits, void *out); + +/** Function for controlling the decoder options */ +typedef int (*decoder_ctl_func)(void *state, int request, void *ptr); + + +/** Query function for a mode */ +typedef int (*mode_query_func)(const void *mode, int request, void *ptr); + +/** Struct defining a Speex mode */ +typedef struct SpeexMode { + /** Pointer to the low-level mode data */ + const void *mode; + + /** Pointer to the mode query function */ + mode_query_func query; + + /** The name of the mode (you should not rely on this to identify the mode)*/ + const char *modeName; + + /**ID of the mode*/ + int modeID; + + /**Version number of the bitstream (incremented every time we break + bitstream compatibility*/ + int bitstream_version; + + /** Pointer to encoder initialization function */ + encoder_init_func enc_init; + + /** Pointer to encoder destruction function */ + encoder_destroy_func enc_destroy; + + /** Pointer to frame encoding function */ + encode_func enc; + + /** Pointer to decoder initialization function */ + decoder_init_func dec_init; + + /** Pointer to decoder destruction function */ + decoder_destroy_func dec_destroy; + + /** Pointer to frame decoding function */ + decode_func dec; + + /** ioctl-like requests for encoder */ + encoder_ctl_func enc_ctl; + + /** ioctl-like requests for decoder */ + decoder_ctl_func dec_ctl; + +} SpeexMode; + +/** + * Returns a handle to a newly created Speex encoder state structure. For now, + * the "mode" argument can be &nb_mode or &wb_mode . In the future, more modes + * may be added. Note that for now if you have more than one channels to + * encode, you need one state per channel. + * + * @param mode The mode to use (either speex_nb_mode or speex_wb.mode) + * @return A newly created encoder + */ +void *speex_encoder_init(const SpeexMode *mode); + +/** Frees all resources associated to an existing Speex encoder state. + * @param state Encoder state to be destroyed */ +void speex_encoder_destroy(void *state); + +/** Uses an existing encoder state to encode one frame of speech pointed to by + "in". The encoded bit-stream is saved in "bits". + @param state Encoder state + @param in Frame that will be encoded with a +-2^15 range + @param bits Bit-stream where the data will be written + */ +int speex_encode(void *state, float *in, SpeexBits *bits); + +/** Uses an existing encoder state to encode one frame of speech pointed to by + "in". The encoded bit-stream is saved in "bits". + @param state Encoder state + @param in Frame that will be encoded with a +-2^15 range + @param bits Bit-stream where the data will be written + */ +int speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits); + +/** Used like the ioctl function to control the encoder parameters + * + * @param state Encoder state + * @param request ioctl-type request (one of the SPEEX_* macros) + * @param ptr Data exchanged to-from function + * @return 0 if frame needs not be transmitted (DTX only), 1 otherwise + */ +int speex_encoder_ctl(void *state, int request, void *ptr); + + +/** Returns a handle to a newly created decoder state structure. For now, + * the mode argument can be &nb_mode or &wb_mode . In the future, more modes + * may be added. Note that for now if you have more than one channels to + * decode, you need one state per channel. + * + * @param mode Speex mode (one of speex_nb_mode or speex_wb_mode) + * @return A newly created decoder state + */ +void *speex_decoder_init(const SpeexMode *mode); + +/** Frees all resources associated to an existing decoder state. + * + * @param state State to be destroyed + */ +void speex_decoder_destroy(void *state); + +/** Uses an existing decoder state to decode one frame of speech from + * bit-stream bits. The output speech is saved written to out. + * + * @param state Decoder state + * @param bits Bit-stream from which to decode the frame (NULL if the packet was lost) + * @param out Where to write the decoded frame + * @return return status (0 for no error, -1 for end of stream, -2 other) + */ +int speex_decode(void *state, SpeexBits *bits, float *out); + +/** Uses an existing decoder state to decode one frame of speech from + * bit-stream bits. The output speech is saved written to out. + * + * @param state Decoder state + * @param bits Bit-stream from which to decode the frame (NULL if the packet was lost) + * @param out Where to write the decoded frame + * @return return status (0 for no error, -1 for end of stream, -2 other) + */ +int speex_decode_int(void *state, SpeexBits *bits, spx_int16_t *out); + +/** Used like the ioctl function to control the encoder parameters + * + * @param state Decoder state + * @param request ioctl-type request (one of the SPEEX_* macros) + * @param ptr Data exchanged to-from function + * @return 0 for no error, 1 if a terminator is reached, 2 for another error + */ +int speex_decoder_ctl(void *state, int request, void *ptr); + + +/** Query function for mode information + * + * @param mode Speex mode + * @param request ioctl-type request (one of the SPEEX_* macros) + * @param ptr Data exchanged to-from function + */ +int speex_mode_query(const SpeexMode *mode, int request, void *ptr); + +/** Functions for controlling the behavior of libspeex + * @param request ioctl-type request (one of the SPEEX_LIB_* macros) + * @param ptr Data exchanged to-from function + */ +int speex_lib_ctl(int request, void *ptr); + +/** Default narrowband mode */ +extern const SpeexMode speex_nb_mode; + +/** Default wideband mode */ +extern const SpeexMode speex_wb_mode; + +/** Default "ultra-wideband" mode */ +extern const SpeexMode speex_uwb_mode; + +#ifdef EPIC_48K +/** 4.8 kbps narrowband mode */ +extern const SpeexMode speex_nb_48k_mode; +#endif + +/** List of all modes available */ +extern const SpeexMode * const speex_mode_list[SPEEX_NB_MODES]; + +/** Obtain one of the modes available */ +const SpeexMode * speex_lib_get_mode (int mode); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_bits.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_bits.h new file mode 100644 index 0000000..b77202f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_bits.h @@ -0,0 +1,151 @@ +/* Copyright (C) 2002 Jean-Marc Valin */ +/** + @file speex_bits.h + @brief Handles bit packing/unpacking +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef BITS_H +#define BITS_H + +#ifdef __cplusplus +extern "C" { +#endif + +/** Bit-packing data structure representing (part of) a bit-stream. */ +typedef struct SpeexBits { + char *chars; /**< "raw" data */ + int nbBits; /**< Total number of bits stored in the stream*/ + int charPtr; /**< Position of the byte "cursor" */ + int bitPtr; /**< Position of the bit "cursor" within the current char */ + int owner; /**< Does the struct "own" the "raw" buffer (member "chars") */ + int overflow;/**< Set to one if we try to read past the valid data */ + int buf_size;/**< Allocated size for buffer */ + int reserved1; /**< Reserved for future use */ + void *reserved2; /**< Reserved for future use */ +} SpeexBits; + +/** Initializes and allocates resources for a SpeexBits struct */ +void speex_bits_init(SpeexBits *bits); + +/** Initializes SpeexBits struct using a pre-allocated buffer*/ +void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size); + +/** Frees all resources associated to a SpeexBits struct. Right now this does nothing since no resources are allocated, but this could change in the future.*/ +void speex_bits_destroy(SpeexBits *bits); + +/** Resets bits to initial value (just after initialization, erasing content)*/ +void speex_bits_reset(SpeexBits *bits); + +/** Rewind the bit-stream to the beginning (ready for read) without erasing the content */ +void speex_bits_rewind(SpeexBits *bits); + +/** Initializes the bit-stream from the data in an area of memory */ +void speex_bits_read_from(SpeexBits *bits, char *bytes, int len); + +/** Append bytes to the bit-stream + * @param bits Bit-stream to operate on + * @param bytes pointer to the bytes what will be appended + * @param len Number of bytes of append + */ +void speex_bits_read_whole_bytes(SpeexBits *bits, char *bytes, int len); + +/** Write the content of a bit-stream to an area of memory */ +int speex_bits_write(SpeexBits *bits, char *bytes, int max_len); + +/** Like speex_bits_write, but writes only the complete bytes in the stream. Also removes the written bytes from the stream */ +int speex_bits_write_whole_bytes(SpeexBits *bits, char *bytes, int max_len); + +/** Append bits to the bit-stream + * @param bits Bit-stream to operate on + * @param data Value to append as integer + * @param nbBits number of bits to consider in "data" + */ +void speex_bits_pack(SpeexBits *bits, int data, int nbBits); + +/** Interpret the next bits in the bit-stream as a signed integer + * + * @param bits Bit-stream to operate on + * @param nbBits Number of bits to interpret + * @return A signed integer represented by the bits read + */ +int speex_bits_unpack_signed(SpeexBits *bits, int nbBits); + +/** Interpret the next bits in the bit-stream as an unsigned integer + * + * @param bits Bit-stream to operate on + * @param nbBits Number of bits to interpret + * @return An unsigned integer represented by the bits read + */ +unsigned int speex_bits_unpack_unsigned(SpeexBits *bits, int nbBits); + +/** Returns the number of bytes in the bit-stream, including the last one even if it is not "full" + * + * @param bits Bit-stream to operate on + * @return Number of bytes in the stream + */ +int speex_bits_nbytes(SpeexBits *bits); + +/** Same as speex_bits_unpack_unsigned, but without modifying the cursor position */ +unsigned int speex_bits_peek_unsigned(SpeexBits *bits, int nbBits); + +/** Get the value of the next bit in the stream, without modifying the + * "cursor" position + * + * @param bits Bit-stream to operate on + */ +int speex_bits_peek(SpeexBits *bits); + +/** Advances the position of the "bit cursor" in the stream + * + * @param bits Bit-stream to operate on + * @param n Number of bits to advance + */ +void speex_bits_advance(SpeexBits *bits, int n); + +/** Returns the number of bits remaining to be read in a stream + * + * @param bits Bit-stream to operate on + */ +int speex_bits_remaining(SpeexBits *bits); + +/** Insert a terminator so that the data can be sent as a packet while auto-detecting + * the number of frames in each packet + * + * @param bits Bit-stream to operate on + */ +void speex_bits_insert_terminator(SpeexBits *bits); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_callbacks.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_callbacks.h new file mode 100644 index 0000000..f6334f2 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_callbacks.h @@ -0,0 +1,128 @@ +/* Copyright (C) 2002 Jean-Marc Valin*/ +/** + @file speex_callbacks.h + @brief Describes callback handling and in-band signalling +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef SPEEX_CALLBACKS_H +#define SPEEX_CALLBACKS_H + +#include "speex.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/** Total number of callbacks */ +#define SPEEX_MAX_CALLBACKS 16 + +/* Describes all the in-band requests */ + +/*These are 1-bit requests*/ +/** Request for perceptual enhancement (1 for on, 0 for off) */ +#define SPEEX_INBAND_ENH_REQUEST 0 +/** Reserved */ +#define SPEEX_INBAND_RESERVED1 1 + +/*These are 4-bit requests*/ +/** Request for a mode change */ +#define SPEEX_INBAND_MODE_REQUEST 2 +/** Request for a low mode change */ +#define SPEEX_INBAND_LOW_MODE_REQUEST 3 +/** Request for a high mode change */ +#define SPEEX_INBAND_HIGH_MODE_REQUEST 4 +/** Request for VBR (1 on, 0 off) */ +#define SPEEX_INBAND_VBR_QUALITY_REQUEST 5 +/** Request to be sent acknowledge */ +#define SPEEX_INBAND_ACKNOWLEDGE_REQUEST 6 +/** Request for VBR (1 for on, 0 for off) */ +#define SPEEX_INBAND_VBR_REQUEST 7 + +/*These are 8-bit requests*/ +/** Send a character in-band */ +#define SPEEX_INBAND_CHAR 8 +/** Intensity stereo information */ +#define SPEEX_INBAND_STEREO 9 + +/*These are 16-bit requests*/ +/** Transmit max bit-rate allowed */ +#define SPEEX_INBAND_MAX_BITRATE 10 + +/*These are 32-bit requests*/ +/** Acknowledge packet reception */ +#define SPEEX_INBAND_ACKNOWLEDGE 12 + +/** Callback function type */ +typedef int (*speex_callback_func)(SpeexBits *bits, void *state, void *data); + +/** Callback information */ +typedef struct SpeexCallback { + int callback_id; /**< ID associated to the callback */ + speex_callback_func func; /**< Callback handler function */ + void *data; /**< Data that will be sent to the handler */ + void *reserved1; /**< Reserved for future use */ + int reserved2; /**< Reserved for future use */ +} SpeexCallback; + +/** Handle in-band request */ +int speex_inband_handler(SpeexBits *bits, SpeexCallback *callback_list, void *state); + +/** Standard handler for mode request (change mode, no questions asked) */ +int speex_std_mode_request_handler(SpeexBits *bits, void *state, void *data); + +/** Standard handler for high mode request (change high mode, no questions asked) */ +int speex_std_high_mode_request_handler(SpeexBits *bits, void *state, void *data); + +/** Standard handler for in-band characters (write to stderr) */ +int speex_std_char_handler(SpeexBits *bits, void *state, void *data); + +/** Default handler for user-defined requests: in this case, just ignore */ +int speex_default_user_handler(SpeexBits *bits, void *state, void *data); + + + + +int speex_std_low_mode_request_handler(SpeexBits *bits, void *state, void *data); + +int speex_std_vbr_request_handler(SpeexBits *bits, void *state, void *data); + +int speex_std_enh_request_handler(SpeexBits *bits, void *state, void *data); + +int speex_std_vbr_quality_request_handler(SpeexBits *bits, void *state, void *data); + + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_config_types.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_config_types.h new file mode 100644 index 0000000..bd54854 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_config_types.h @@ -0,0 +1,11 @@ +#ifndef __SPEEX_TYPES_H__ +#define __SPEEX_TYPES_H__ + +/* these are filled in by configure */ +typedef short spx_int16_t; +typedef unsigned short spx_uint16_t; +typedef int spx_int32_t; +typedef unsigned int spx_uint32_t; + +#endif + diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_echo.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_echo.h new file mode 100644 index 0000000..39a3c73 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_echo.h @@ -0,0 +1,98 @@ +/* Copyright (C) Jean-Marc Valin + + File: speex_echo.h + + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef SPEEX_ECHO_H +#define SPEEX_ECHO_H + +#ifdef __cplusplus +extern "C" { +#endif + +struct drft_lookup; + +typedef struct SpeexEchoState { + int frame_size; /**< Number of samples processed each time */ + int window_size; + int M; + int cancel_count; + int adapted; + float adapt_rate; + float sum_adapt; + float Sey; + float Syy; + float See; + + float *x; + float *X; + float *d; + float *D; + float *y; + float *y2; + float *last_y; + float *Yps; + float *Y; + float *Y2; + float *E; + float *PHI; + float * W; + float *power; + float *power_1; + float *grad; + float *Rf; + float *Yf; + float *Xf; + float *fratio; + float *regul; + + struct drft_lookup *fft_lookup; + + +} SpeexEchoState; + + +/** Creates a new echo canceller state */ +SpeexEchoState *speex_echo_state_init(int frame_size, int filter_length); + +/** Destroys an echo canceller state */ +void speex_echo_state_destroy(SpeexEchoState *st); + +/** Performs echo cancellation a frame */ +void speex_echo_cancel(SpeexEchoState *st, short *ref, short *echo, short *out, float *Y); + +/** Reset the echo canceller state */ +void speex_echo_state_reset(SpeexEchoState *st); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_header.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_header.h new file mode 100644 index 0000000..32fb81f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_header.h @@ -0,0 +1,86 @@ +/* Copyright (C) 2002 Jean-Marc Valin */ +/** + @file speex_header.h + @brief Describes the Speex header +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + + +#ifndef SPEEX_HEADER_H +#define SPEEX_HEADER_H + +#include "speex/speex_types.h" + +#ifdef __cplusplus +extern "C" { +#endif + +struct SpeexMode; + +#define SPEEX_HEADER_STRING_LENGTH 8 + +/** Maximum number of characters for encoding the Speex version number in the header */ +#define SPEEX_HEADER_VERSION_LENGTH 20 + +/** Speex header info for file-based formats */ +typedef struct SpeexHeader { + char speex_string[SPEEX_HEADER_STRING_LENGTH]; /**< Identifies a Speex bit-stream, always set to "Speex " */ + char speex_version[SPEEX_HEADER_VERSION_LENGTH]; /**< Speex version */ + spx_int32_t speex_version_id; /**< Version for Speex (for checking compatibility) */ + spx_int32_t header_size; /**< Total size of the header ( sizeof(SpeexHeader) ) */ + spx_int32_t rate; /**< Sampling rate used */ + spx_int32_t mode; /**< Mode used (0 for narrowband, 1 for wideband) */ + spx_int32_t mode_bitstream_version; /**< Version ID of the bit-stream */ + spx_int32_t nb_channels; /**< Number of channels encoded */ + spx_int32_t bitrate; /**< Bit-rate used */ + spx_int32_t frame_size; /**< Size of frames */ + spx_int32_t vbr; /**< 1 for a VBR encoding, 0 otherwise */ + spx_int32_t frames_per_packet; /**< Number of frames stored per Ogg packet */ + spx_int32_t extra_headers; /**< Number of additional headers after the comments */ + spx_int32_t reserved1; /**< Reserved for future use, must be zero */ + spx_int32_t reserved2; /**< Reserved for future use, must be zero */ +} SpeexHeader; + +/** Initializes a SpeexHeader using basic information */ +void speex_init_header(SpeexHeader *header, int rate, int nb_channels, const struct SpeexMode *m); + +/** Creates the header packet from the header itself (mostly involves endianness conversion) */ +char *speex_header_to_packet(SpeexHeader *header, int *size); + +/** Creates a SpeexHeader from a packet */ +SpeexHeader *speex_packet_to_header(char *packet, int size); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_jitter.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_jitter.h new file mode 100644 index 0000000..0099cc1 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_jitter.h @@ -0,0 +1,87 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: speex_jitter.h + + Adaptive jitter buffer for Speex + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef SPEEX_JITTER_H +#define SPEEX_JITTER_H + +#include "speex.h" +#include "speex_bits.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#define SPEEX_JITTER_MAX_PACKET_SIZE 1500 +#define SPEEX_JITTER_MAX_BUFFER_SIZE 20 + +#define MAX_MARGIN 12 + +typedef struct SpeexJitter { + int buffer_size; + int pointer_timestamp; + + SpeexBits current_packet; + int valid_bits; + + char buf[SPEEX_JITTER_MAX_BUFFER_SIZE][SPEEX_JITTER_MAX_PACKET_SIZE]; + int timestamp[SPEEX_JITTER_MAX_BUFFER_SIZE]; + int len[SPEEX_JITTER_MAX_BUFFER_SIZE]; + + void *dec; + int frame_size; + int frame_time; + int reset_state; + + int lost_count; + float shortterm_margin[MAX_MARGIN]; + float longterm_margin[MAX_MARGIN]; + float loss_rate; +} SpeexJitter; + +void speex_jitter_init(SpeexJitter *jitter, void *decoder, int sampling_rate); + +void speex_jitter_destroy(SpeexJitter *jitter); + +void speex_jitter_put(SpeexJitter *jitter, char *packet, int len, int time); + +void speex_jitter_get(SpeexJitter *jitter, short *out, int *current_timestamp); + +int speex_jitter_get_pointer_timestamp(SpeexJitter *jitter); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_noglobals.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_noglobals.h new file mode 100644 index 0000000..1d46993 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_noglobals.h @@ -0,0 +1,60 @@ +/* Copyright (C) 2004 CSIRO Australia */ +/* Copyright (C) 2002 Jean-Marc Valin*/ +/** + @file speex_noglobals.h + @brief Dynamically allocates the different modes of the codec +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef SPEEX_NOGLOBALS_H +#define SPEEX_NOGLOBALS_H + +/* See README.symbian in the Speex source distribution for information + * on using this API */ + +typedef struct SpeexMode SpeexMode; + +#ifdef __cplusplus +extern "C" { +#endif + +/** Instantiate a mode */ +const SpeexMode * speex_mode_new (int modeID); + +/** Destroy a mode */ +void speex_mode_destroy (const SpeexMode * mode); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_preprocess.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_preprocess.h new file mode 100644 index 0000000..391d156 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_preprocess.h @@ -0,0 +1,156 @@ +/* Copyright (C) 2003 Epic Games + Written by Jean-Marc Valin + + File: speex_preprocess.h + + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef SPEEX_PREPROCESS_H +#define SPEEX_PREPROCESS_H + +#include "speex/speex_types.h" + +#ifdef __cplusplus +extern "C" { +#endif + +struct drft_lookup; + +typedef struct SpeexPreprocessState { + int frame_size; /**< Number of samples processed each time */ + int ps_size; /**< Number of points in the power spectrum */ + int sampling_rate; /**< Sampling rate of the input/output */ + + /* parameters */ + int denoise_enabled; + int agc_enabled; + float agc_level; + int vad_enabled; + int dereverb_enabled; + float reverb_decay; + float reverb_level; + float speech_prob_start; + float speech_prob_continue; + + float *frame; /**< Processing frame (2*ps_size) */ + float *ps; /**< Current power spectrum */ + float *gain2; /**< Adjusted gains */ + float *window; /**< Analysis/Synthesis window */ + float *noise; /**< Noise estimate */ + float *reverb_estimate; /**< Estimate of reverb energy */ + float *old_ps; /**< Power spectrum for last frame */ + float *gain; /**< Ephraim Malah gain */ + float *prior; /**< A-priori SNR */ + float *post; /**< A-posteriori SNR */ + + float *S; /**< Smoothed power spectrum */ + float *Smin; /**< See Cohen paper */ + float *Stmp; /**< See Cohen paper */ + float *update_prob; /**< Propability of speech presence for noise update */ + + float *zeta; /**< Smoothed a priori SNR */ + float Zpeak; + float Zlast; + + float *loudness_weight; /**< Perceptual loudness curve */ + + float *echo_noise; + + float *noise_bands; + float *noise_bands2; + int noise_bandsN; + float *speech_bands; + float *speech_bands2; + int speech_bandsN; + + float *inbuf; /**< Input buffer (overlapped analysis) */ + float *outbuf; /**< Output buffer (for overlap and add) */ + + float speech_prob; + int last_speech; + float loudness; /**< loudness estimate */ + float loudness2; /**< loudness estimate */ + int nb_adapt; /**< Number of frames used for adaptation so far */ + int nb_loudness_adapt; /**< Number of frames used for loudness adaptation so far */ + int consec_noise; /**< Number of consecutive noise frames */ + int nb_preprocess; /**< Number of frames processed so far */ + struct drft_lookup *fft_lookup; /**< Lookup table for the FFT */ + +} SpeexPreprocessState; + +/** Creates a new preprocessing state */ +SpeexPreprocessState *speex_preprocess_state_init(int frame_size, int sampling_rate); + +/** Destroys a denoising state */ +void speex_preprocess_state_destroy(SpeexPreprocessState *st); + +/** Preprocess a frame */ +int speex_preprocess(SpeexPreprocessState *st, spx_int16_t *x, float *echo); + +/** Preprocess a frame */ +void speex_preprocess_estimate_update(SpeexPreprocessState *st, spx_int16_t *x, float *echo); + +/** Used like the ioctl function to control the preprocessor parameters */ +int speex_preprocess_ctl(SpeexPreprocessState *st, int request, void *ptr); + + + +#define SPEEX_PREPROCESS_SET_DENOISE 0 +#define SPEEX_PREPROCESS_GET_DENOISE 1 + +#define SPEEX_PREPROCESS_SET_AGC 2 +#define SPEEX_PREPROCESS_GET_AGC 3 + +#define SPEEX_PREPROCESS_SET_VAD 4 +#define SPEEX_PREPROCESS_GET_VAD 5 + +#define SPEEX_PREPROCESS_SET_AGC_LEVEL 6 +#define SPEEX_PREPROCESS_GET_AGC_LEVEL 7 + +#define SPEEX_PREPROCESS_SET_DEREVERB 8 +#define SPEEX_PREPROCESS_GET_DEREVERB 9 + +#define SPEEX_PREPROCESS_SET_DEREVERB_LEVEL 10 +#define SPEEX_PREPROCESS_GET_DEREVERB_LEVEL 11 + +#define SPEEX_PREPROCESS_SET_DEREVERB_DECAY 12 +#define SPEEX_PREPROCESS_GET_DEREVERB_DECAY 13 + +#define SPEEX_PREPROCESS_SET_PROB_START 14 +#define SPEEX_PREPROCESS_GET_PROB_START 15 + +#define SPEEX_PREPROCESS_SET_PROB_CONTINUE 16 +#define SPEEX_PREPROCESS_GET_PROB_CONTINUE 17 + + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_stereo.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_stereo.h new file mode 100644 index 0000000..0b70021 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_stereo.h @@ -0,0 +1,78 @@ +/* Copyright (C) 2002 Jean-Marc Valin*/ +/** + @file speex_stereo.h + @brief Describes the handling for intensity stereo +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef STEREO_H +#define STEREO_H + +#include "speex/speex_types.h" +#include "speex/speex_bits.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/** State used for decoding (intensity) stereo information */ +typedef struct SpeexStereoState { + float balance; /**< Left/right balance info */ + float e_ratio; /**< Ratio of energies: E(left+right)/[E(left)+E(right)] */ + float smooth_left; /**< Smoothed left channel gain */ + float smooth_right; /**< Smoothed right channel gain */ + float reserved1; /**< Reserved for future use */ + float reserved2; /**< Reserved for future use */ +} SpeexStereoState; + +/** Initialization value for a stereo state */ +#define SPEEX_STEREO_STATE_INIT {1,.5,1,1} + +/** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */ +void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits); + +/** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */ +void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits); + +/** Transforms a mono frame into a stereo frame using intensity stereo info */ +void speex_decode_stereo(float *data, int frame_size, SpeexStereoState *stereo); + +/** Transforms a mono frame into a stereo frame using intensity stereo info */ +void speex_decode_stereo_int(spx_int16_t *data, int frame_size, SpeexStereoState *stereo); + +/** Callback handler for intensity stereo info */ +int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_types.h b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_types.h new file mode 100644 index 0000000..86311b8 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/include/speex/speex_types.h @@ -0,0 +1,120 @@ +/* speex_types.h taken from libogg */ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2002 * + * by the Xiph.Org Foundation http://www.xiph.org/ * + * * + ******************************************************************** + + function: #ifdef jail to whip a few platforms into the UNIX ideal. + last mod: $Id: speex_types.h 529 2005-12-31 15:19:30Z coppice $ + + ********************************************************************/ +#ifndef _SPEEX_TYPES_H +#define _SPEEX_TYPES_H + +#if defined(WIN32) || defined(_WIN32_WCE) + +# if defined(__CYGWIN__) +# include <_G_config.h> + typedef _G_int64_t spx_int64_t; + typedef _G_int32_t spx_int32_t; + typedef _G_uint32_t spx_uint32_t; + typedef _G_int16_t spx_int16_t; + typedef _G_uint16_t spx_uint16_t; +# elif defined(__MINGW32__) + typedef short spx_int16_t; + typedef unsigned short spx_uint16_t; + typedef int spx_int32_t; + typedef unsigned int spx_uint32_t; + typedef long long spx_int64_t; + typedef unsigned long long spx_uint64_t; +# elif defined(__MWERKS__) + typedef long long spx_int64_t; + typedef int spx_int32_t; + typedef unsigned int spx_uint32_t; + typedef short spx_int16_t; + typedef unsigned short spx_uint16_t; +# else + /* MSVC/Borland */ + typedef __int64 spx_int64_t; + typedef __int32 spx_int32_t; + typedef unsigned __int32 spx_uint32_t; + typedef __int16 spx_int16_t; + typedef unsigned __int16 spx_uint16_t; +# endif + +#elif defined(__MACOS__) + +# include + typedef SInt16 spx_int16_t; + typedef UInt16 spx_uint16_t; + typedef SInt32 spx_int32_t; + typedef UInt32 spx_uint32_t; + typedef SInt64 spx_int64_t; + +#elif defined(__MACOSX__) /* MacOS X Framework build */ + +# include + typedef int16_t spx_int16_t; + typedef u_int16_t spx_uint16_t; + typedef int32_t spx_int32_t; + typedef u_int32_t spx_uint32_t; + typedef int64_t spx_int64_t; + +#elif defined(__BEOS__) + + /* Be */ +# include + typedef int16_t spx_int16_t; + typedef u_int16_t spx_uint16_t; + typedef int32_t spx_int32_t; + typedef u_int32_t spx_uint32_t; + typedef int64_t spx_int64_t; + +#elif defined (__EMX__) + + /* OS/2 GCC */ + typedef short spx_int16_t; + typedef unsigned short spx_uint16_t; + typedef int spx_int32_t; + typedef unsigned int spx_uint32_t; + typedef long long spx_int64_t; + +#elif defined (DJGPP) + + /* DJGPP */ + typedef short spx_int16_t; + typedef int spx_int32_t; + typedef unsigned int spx_uint32_t; + typedef long long spx_int64_t; + +#elif defined(R5900) + + /* PS2 EE */ + typedef long spx_int64_t; + typedef int spx_int32_t; + typedef unsigned spx_uint32_t; + typedef short spx_int16_t; + +#elif defined(__SYMBIAN32__) + + /* Symbian GCC */ + typedef signed short spx_int16_t; + typedef unsigned short spx_uint16_t; + typedef signed int spx_int32_t; + typedef unsigned int spx_uint32_t; + typedef long long int spx_int64_t; + +#else + +# include + +#endif + +#endif /* _SPEEX_TYPES_H */ diff --git a/3rdparty/iaxclient-2/lib/libspeex/jitter.c b/3rdparty/iaxclient-2/lib/libspeex/jitter.c new file mode 100644 index 0000000..acc5c1d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/jitter.c @@ -0,0 +1,315 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: speex_jitter.h + + Adaptive jitter buffer for Speex + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifndef NULL +#define NULL 0 +#endif + +#include "misc.h" +#include "speex/speex.h" +#include "speex/speex_bits.h" +#include "speex/speex_jitter.h" +#include + +#define LATE_BINS 4 + +void speex_jitter_init(SpeexJitter *jitter, void *decoder, int sampling_rate) +{ + int i; + for (i=0;ilen[i]=-1; + jitter->timestamp[i]=-1; + } + + jitter->dec = decoder; + speex_decoder_ctl(decoder, SPEEX_GET_FRAME_SIZE, &jitter->frame_size); + jitter->frame_time = 1000*jitter->frame_size / sampling_rate; + + speex_bits_init(&jitter->current_packet); + jitter->valid_bits = 0; + + jitter->buffer_size = 4; + + jitter->pointer_timestamp = -jitter->frame_time * jitter->buffer_size; + jitter->reset_state = 1; + jitter->lost_count = 0; + jitter->loss_rate = 0; +} + +void speex_jitter_destroy(SpeexJitter *jitter) +{ +} + + +void speex_jitter_put(SpeexJitter *jitter, char *packet, int len, int timestamp) +{ + int i,j; + int arrival_margin; + + if (jitter->reset_state) + { + jitter->reset_state=0; + jitter->pointer_timestamp = timestamp-jitter->frame_time * jitter->buffer_size; + for (i=0;ishortterm_margin[i] = 0; + jitter->longterm_margin[i] = 0; + } + for (i=0;ilen[i]=-1; + jitter->timestamp[i]=-1; + } + fprintf(stderr, "reset to %d\n", timestamp); + } + + /* Cleanup buffer (remove old packets that weren't played) */ + for (i=0;itimestamp[i]pointer_timestamp) + { + jitter->len[i]=-1; + /*if (jitter->timestamp[i] != -1) + fprintf (stderr, "discarding %d %d\n", jitter->timestamp[i], jitter->pointer_timestamp);*/ + } + } + + /*Find an empty slot in the buffer*/ + for (i=0;ilen[i]==-1) + break; + } + + /*fprintf(stderr, "%d %d %f\n", timestamp, jitter->pointer_timestamp, jitter->drift_average);*/ + if (i==SPEEX_JITTER_MAX_BUFFER_SIZE) + { + int earliest=jitter->timestamp[0]; + i=0; + for (j=1;jtimestamp[j]timestamp[j]; + i=j; + } + } + /*fprintf (stderr, "Buffer is full, discarding earliest frame %d (currently at %d)\n", timestamp, jitter->pointer_timestamp);*/ + /*No place left in the buffer*/ + + /*skip some frame(s) */ + /*return;*/ + } + + /* Copy packet in buffer */ + if (len>SPEEX_JITTER_MAX_PACKET_SIZE) + len=SPEEX_JITTER_MAX_PACKET_SIZE; + for (j=0;jbuf[i][j]=packet[j]; + jitter->timestamp[i]=timestamp; + jitter->len[i]=len; + + /* Don't count late packets when adjusting the synchro (we're taking care of them elsewhere) */ + /*if (timestamp <= jitter->pointer_timestamp) + { + fprintf (stderr, "frame for timestamp %d arrived too late (at time %d)\n", timestamp, jitter->pointer_timestamp); + }*/ + + /* Adjust the buffer size depending on network conditions */ + arrival_margin = (timestamp - jitter->pointer_timestamp - jitter->frame_time); + + if (arrival_margin >= -LATE_BINS*jitter->frame_time) + { + int int_margin; + for (i=0;ishortterm_margin[i] *= .98; + jitter->longterm_margin[i] *= .995; + } + int_margin = (arrival_margin + LATE_BINS*jitter->frame_time)/jitter->frame_time; + if (int_margin>MAX_MARGIN-1) + int_margin = MAX_MARGIN-1; + if (int_margin>=0) + { + jitter->shortterm_margin[int_margin] += .02; + jitter->longterm_margin[int_margin] += .005; + } + } + + /*fprintf (stderr, "margin : %d %d %f %f %f %f\n", arrival_margin, jitter->buffer_size, 100*jitter->loss_rate, 100*jitter->late_ratio, 100*jitter->ontime_ratio, 100*jitter->early_ratio);*/ +} + +void speex_jitter_get(SpeexJitter *jitter, short *out, int *current_timestamp) +{ + int i; + int ret; + float late_ratio_short; + float late_ratio_long; + float ontime_ratio_short; + float ontime_ratio_long; + float early_ratio_short; + float early_ratio_long; + + late_ratio_short = 0; + late_ratio_long = 0; + for (i=0;ishortterm_margin[i]; + late_ratio_long += jitter->longterm_margin[i]; + } + ontime_ratio_short = jitter->shortterm_margin[LATE_BINS]; + ontime_ratio_long = jitter->longterm_margin[LATE_BINS]; + early_ratio_short = early_ratio_long = 0; + for (i=LATE_BINS+1;ishortterm_margin[i]; + early_ratio_long += jitter->longterm_margin[i]; + } + if (0&&jitter->pointer_timestamp%1000==0) + { + fprintf (stderr, "%f %f %f %f %f %f\n", early_ratio_short, early_ratio_long, ontime_ratio_short, ontime_ratio_long, late_ratio_short, late_ratio_long); + /*fprintf (stderr, "%f %f\n", early_ratio_short + ontime_ratio_short + late_ratio_short, early_ratio_long + ontime_ratio_long + late_ratio_long);*/ + } + + if (late_ratio_short > .1 || late_ratio_long > .03) + { + jitter->shortterm_margin[MAX_MARGIN-1] += jitter->shortterm_margin[MAX_MARGIN-2]; + jitter->longterm_margin[MAX_MARGIN-1] += jitter->longterm_margin[MAX_MARGIN-2]; + for (i=MAX_MARGIN-2;i>=0;i--) + { + jitter->shortterm_margin[i+1] = jitter->shortterm_margin[i]; + jitter->longterm_margin[i+1] = jitter->longterm_margin[i]; + } + jitter->shortterm_margin[0] = 0; + jitter->longterm_margin[0] = 0; + /*fprintf (stderr, "interpolate frame\n");*/ + speex_decode_int(jitter->dec, NULL, out); + if (current_timestamp) + *current_timestamp = jitter->pointer_timestamp; + return; + } + + /* Increment timestamp */ + jitter->pointer_timestamp += jitter->frame_time; + + if (late_ratio_short + ontime_ratio_short < .005 && late_ratio_long + ontime_ratio_long < .01 && early_ratio_short > .8) + { + jitter->shortterm_margin[0] += jitter->shortterm_margin[1]; + jitter->longterm_margin[0] += jitter->longterm_margin[1]; + for (i=1;ishortterm_margin[i] = jitter->shortterm_margin[i+1]; + jitter->longterm_margin[i] = jitter->longterm_margin[i+1]; + } + jitter->shortterm_margin[MAX_MARGIN-1] = 0; + jitter->longterm_margin[MAX_MARGIN-1] = 0; + /*fprintf (stderr, "drop frame\n");*/ + jitter->pointer_timestamp += jitter->frame_time; + } + + if (current_timestamp) + *current_timestamp = jitter->pointer_timestamp; + + /* Send zeros while we fill in the buffer */ + if (jitter->pointer_timestamp<0) + { + for (i=0;iframe_size;i++) + out[i]=0; + return; + } + + /* Search the buffer for a packet with the right timestamp */ + for (i=0;ilen[i]!=-1 && jitter->timestamp[i]==jitter->pointer_timestamp) + break; + } + + if (i==SPEEX_JITTER_MAX_BUFFER_SIZE) + { + /* No packet found */ + if (jitter->valid_bits) + { + /* Try decoding last received packet */ + ret = speex_decode_int(jitter->dec, &jitter->current_packet, out); + if (ret == 0) + { + jitter->lost_count = 0; + return; + } else { + jitter->valid_bits = 0; + } + } + + /*fprintf (stderr, "lost/late frame %d\n", jitter->pointer_timestamp);*/ + /*Packet is late or lost*/ + speex_decode_int(jitter->dec, NULL, out); + jitter->lost_count++; + if (jitter->lost_count>=25) + { + jitter->lost_count = 0; + jitter->reset_state = 1; + speex_decoder_ctl(jitter->dec, SPEEX_RESET_STATE, NULL); + } + jitter->loss_rate = .999*jitter->loss_rate + .001; + } else { + jitter->lost_count = 0; + /* Found the right packet */ + speex_bits_read_from(&jitter->current_packet, jitter->buf[i], jitter->len[i]); + jitter->len[i]=-1; + /* Decode packet */ + ret = speex_decode_int(jitter->dec, &jitter->current_packet, out); + if (ret == 0) + { + jitter->valid_bits = 1; + } else { + /* Error while decoding */ + for (i=0;iframe_size;i++) + out[i]=0; + } + jitter->loss_rate = .999*jitter->loss_rate; + } + + +} + +int speex_jitter_get_pointer_timestamp(SpeexJitter *jitter) +{ + return jitter->pointer_timestamp; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/lbr_48k_tables.c b/3rdparty/iaxclient-2/lib/libspeex/lbr_48k_tables.c new file mode 100644 index 0000000..2e6db3f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/lbr_48k_tables.c @@ -0,0 +1,678 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: lbr_48k_tables.c + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + + +int dummy_epic_48k_variable=0; +#ifdef EPIC_48K + +const signed char gain_cdbk_ulbr[192] = { +-31, -48, -30, +-19, -10, -18, +-33, -22, -45, +-5, -56, -43, +-30, -56, -3, +-59, -17, -52, +-41, -60, -58, +-64, -47, -22, +-30, -31, -31, +-29, -14, -31, +-22, -37, -58, +-31, -44, 13, +-37, 0, 1, +-46, -55, -35, +-56, -14, -53, +-8, 1, -36, +-29, -15, -27, +-29, -39, -28, +-43, -5, 3, +-51, -27, -54, +10, -46, -36, +3, -3, -42, +-27, 16, -22, +-34, -52, 13, +-31, -21, -28, +-34, -45, -40, +-20, -48, 4, +-40, -27, 16, +-6, 11, -44, +-35, 12, -5, +19, -33, -37, +-29, 18, -32, +-29, -23, -19, +16, -47, -28, +-34, -30, 17, +-20, 2, -26, +-38, -40, -36, +15, -14, -40, +-39, 14, -9, +-15, 25, -39, +-26, 19, -32, +-39, 17, -14, +10, -36, -26, +14, -13, -40, +-29, -21, -12, +-8, 19, -39, +-36, -18, 15, +-32, -38, -38, +-19, 4, -23, +-38, -7, 11, +9, -10, -39, +-37, 24, -19, +-34, -5, -8, +-20, 23, -41, +-4, 17, -31, +-17, -26, -26, +-24, 28, -36, +-7, 15, -39, +-42, 16, -11, +-29, 14, -6, +-36, 28, -27, +-21, 5, -26, +11, -9, -39, +-38, -7, 13, +}; + + +const signed char exc_12_32_table[384] = { +34, 55, 9, 55, 4, 44, -2, 25, 4, -6, 13, -22, +20, 26, -13, -56, -37, 18, 5, 28, 4, 10, 6, -7, +37, -24, -31, 22, 12, -6, -4, -7, 2, 0, -3, -2, +-16, -13, -1, 9, -2, 4, 6, 5, -3, 3, 8, -1, +-1, -6, -2, -1, 8, 24, 19, 33, -73, -53, 6, -18, +14, 7, 11, 8, -33, -94, -5, 7, 0, 44, 1, 19, +-9, -7, -34, -16, 8, 2, 5, 0, 3, 1, -2, 3, +-22, 6, -2, 12, 16, 30, 39, 25, 25, 2, 10, -2, +-1, -40, -6, -51, -5, -48, -9, -33, -14, -1, -24, 15, +104, 39, 12, -9, -20, -12, -30, -10, -31, -7, -30, -8, +-71, -53, -4, -11, 9, -10, 7, -10, 10, -1, 11, 8, +24, 14, 6, -3, 10, 8, 8, 11, -6, 11, 0, -2, +-6, -2, 1, -1, -3, 8, -41, 27, 57, -7, 11, -16, +-61, 50, 10, -10, 4, -13, 14, -7, 1, 5, -4, 4, +0, 2, -1, -2, -1, 1, 1, 0, -1, -1, -2, -3, +-3, -15, 69, 60, 10, -10, -10, -29, -21, -7, -16, 2, +24, -32, 24, -18, -14, -2, -11, 11, -6, 10, 1, 3, +24, -10, 14, 18, -13, 17, -16, 4, -3, -21, -3, -11, +-19, 12, -14, 26, 20, -9, 24, -15, 18, 1, -32, -2, +-1, 8, -3, 4, 11, -47, 7, 46, -4, -10, -10, -2, +-24, 29, -33, 6, -20, -3, 0, -12, 5, -30, 8, -13, +28, 9, 5, -11, 0, -14, -13, -22, -12, -8, -4, 1, +-6, 28, 45, -18, -31, -5, 1, 2, 1, 5, 0, -3, +-19, -10, 10, 27, 8, -16, -28, -9, 2, -5, 8, -1, +100, -49, 4, -43, 25, -7, 1, 9, -13, 13, -18, 13, +-1, -1, 0, 2, -2, -8, 9, -46, -7, 70, 23, 7, +-103, 20, 8, 42, -5, 21, -4, 4, 1, -8, 16, -8, +3, 3, 8, 4, 7, -3, -3, -4, 9, 6, 2, 13, +6, 3, -15, 11, -43, 31, 40, -13, 12, -21, -2, -3, +-10, -9, 16, -35, 31, -3, -12, 8, -34, 7, 12, 22, +-3, -4, -7, -12, 24, 53, -19, -43, 4, -3, -4, 6, +-18, -30, -58, -17, -11, 17, 23, 34, 30, 28, 28, 15, +}; + + +const signed char cdbk_lsp_vlbr[5120]={ +23, 34, 108, 100, 102, 82, 69, 48, 52, 25, +0, -37, -55, -78, -111, -79, 58, 57, 45, 32, +27, -9, -12, -14, -41, -29, -17, -41, 44, 35, +-24, -68, -72, 61, 100, 73, 100, 80, 70, 37, +12, -5, 22, 11, -10, -40, -33, -17, 19, 12, +-20, -57, -94, -92, 56, 71, 48, 31, 22, -5, +41, 28, 6, -6, -12, -39, -18, -16, -30, -23, +65, 54, 41, 28, 23, 9, 26, 18, 22, 6, +17, -16, -33, -54, -87, -79, 8, -8, 44, 35, +-20, -62, -78, 22, 78, 47, 44, 33, 26, 14, +8, 1, 45, 47, 72, 68, 55, 31, 36, 17, +-27, -68, -86, -65, -10, 23, 8, -22, -31, 25, +-4, -38, -55, -68, -96, -118, -39, 30, 28, 31, +-21, -66, -47, 99, 91, 68, 78, 56, 64, 36, +33, 22, 13, -13, -36, -22, 44, 37, 54, 33, +-31, -76, -106, -100, -5, 21, 7, -17, 13, 48, +-26, -65, -84, -84, -46, 67, 97, 66, 58, 31, +-20, -52, -32, -20, 3, 16, 27, 40, 54, 29, +-6, -35, -56, -64, -8, -31, -36, 21, 26, -3, +32, 23, 1, -23, -19, -44, -45, -7, 10, -10, +-24, -55, 2, 67, 72, 85, 90, 74, 77, 45, +-21, -58, -45, -49, 16, 34, 13, -15, -16, 16, +8, -31, -34, -61, -83, 10, 24, 8, 56, 25, +-8, -49, -74, -95, -123, -77, 6, 40, 46, 42, +-21, -60, -59, -34, -12, 27, 8, -19, -48, -17, +-25, -66, -78, -73, -81, -16, 14, 0, -2, 33, +78, 79, 69, 49, 44, 32, 50, 44, 46, 22, +24, 9, -4, -18, -37, -56, 22, 34, 22, 11, +-19, -59, -85, -41, 46, 72, 60, 33, 29, -3, +-21, -66, -70, 65, 92, 57, 61, 41, 40, 23, +-4, -41, -60, -72, -102, -106, 4, 56, 57, 31, +-5, -48, -62, -91, -109, 1, 76, 54, 72, 39, +-21, -61, -86, -46, -34, -39, 42, 25, 15, 12, +5, -16, -36, -56, 5, 18, 11, 13, 52, 23, +12, -6, 30, 40, 59, 40, 27, 8, 19, 6, +25, 8, -9, -19, -25, -53, -40, -38, -46, -4, +-17, -59, -83, 2, 58, 29, 18, -2, -17, -5, +-35, -80, -111, -117, -41, -9, 14, 23, 36, 56, +48, 67, 93, 71, 77, 91, 110, 95, 83, 47, +-25, -62, -97, -93, 76, 96, 73, 52, 61, 28, +-9, -55, -46, 49, 33, 8, 1, -25, 28, 23, +-10, -47, -60, -45, -62, -58, 56, 57, 48, 28, +34, 12, -9, 0, 34, 4, 6, 11, 3, -18, +21, -9, -16, -13, -39, -41, 14, -8, 33, 28, +-7, -49, -61, 15, 34, 3, 2, -13, -28, -17, +-14, -50, -46, -65, -76, -13, -10, -29, -30, 22, +-28, -68, -97, -98, -8, 38, 36, 26, 25, 15, +6, -33, -9, 1, -28, -11, -19, -24, 61, 36, +-15, -60, -19, 81, 58, 52, 42, 28, 66, 36, +-15, -52, -71, -15, 11, -13, 38, 28, 11, -4, +34, 1, -9, -27, -57, -19, 36, 6, 14, 0, +-1, -43, -14, 16, -12, -5, -14, -29, -33, -32, +-13, -57, -75, -100, -111, 1, 2, 13, 48, 33, +12, 16, 100, 85, 69, 49, 40, 29, 46, 23, +-4, -26, -41, -44, -7, -26, -39, -27, 18, 0, +-4, -47, -51, 17, 7, -19, 13, -10, -16, 9, +-24, -63, -93, -53, 25, 14, 73, 51, 35, 8, +-34, -77, -106, -83, -51, -47, 2, 12, 41, 53, +-13, -47, -67, -44, 42, 20, 24, 33, 21, -3, +11, -15, -29, -51, -79, -88, 22, 56, 43, 20, +11, -22, -37, -1, 61, 40, 28, 24, 22, -6, +-3, -33, -50, -66, -93, -100, -16, -16, 3, 41, +-18, -58, -82, -5, 95, 78, 56, 39, 30, 1, +-6, -47, -28, -26, -36, 49, 55, 51, 71, 35, +-6, -50, -42, -4, -32, -1, -1, -18, 67, 40, +-23, -63, -56, -48, -32, 0, -14, -43, -46, 25, +-17, -61, -63, 13, -1, 28, 23, 10, 67, 36, +45, 92, 124, 111, 108, 86, 77, 56, 57, 28, +50, 35, 13, 3, -2, -32, 3, 14, 6, -8, +12, -17, -24, -42, -67, -23, 67, 49, 64, 38, +-21, -60, -90, -45, 32, 6, 7, -3, -15, 9, +-16, -62, -73, 50, 46, 18, 7, -13, 63, 39, +19, -16, -19, 20, 5, -15, 16, -9, 5, 8, +-11, -46, -42, -39, -55, -68, -62, -27, -18, 23, +-23, -61, -67, -71, -29, 44, 32, 10, -15, -12, +-6, -45, -43, -40, -67, -22, 42, 19, 61, 38, +9, -13, -38, -37, 40, 30, 15, 9, 11, -16, +0, -18, -29, -34, -17, -44, -50, -3, 47, 15, +-3, -46, -26, 20, -10, 16, 20, -2, 43, 18, +-23, -46, 46, 91, 99, 100, 99, 79, 72, 42, +-1, -44, -33, -36, -56, 22, 17, 4, 71, 37, +0, -38, -49, 0, -1, -30, -21, -35, -44, -6, +-32, -74, -101, -98, -14, -21, -23, 7, 26, 45, +8, -28, -44, -63, -96, -84, 34, 21, 13, 23, +10, -24, -38, -17, -29, -53, -16, -41, -14, 23, +-19, -61, -76, -12, 97, 99, 79, 60, 59, 25, +5, -11, -26, -54, -26, -8, -13, 3, 25, 4, +17, 16, 4, -24, -1, 42, 60, 63, 70, 37, +10, -27, -22, -43, -62, -7, -16, 10, 75, 40, +-26, -64, -96, -106, -3, 73, 73, 46, 55, 29, +-2, -45, -43, 45, 46, 17, 37, 10, 30, 32, +21, -2, -18, -28, -47, -63, -38, -56, -3, 27, +-17, -48, -9, 9, 3, 28, 50, 58, 73, 44, +8, -14, -32, -56, -81, -106, -35, 41, 53, 26, +1, -38, -51, -66, -100, -61, 32, 17, 66, 42, +17, 5, -6, -21, -26, -52, -36, 23, 56, 22, +6, -20, -31, -22, -19, -48, 16, 38, 22, -2, +-25, -67, -93, -51, 82, 62, 71, 69, 63, 35, +-12, -51, -71, -60, -76, -91, -14, 41, 35, 20, +-16, -31, 22, 32, 55, 80, 98, 91, 85, 49, +-21, -63, -92, -6, 57, 27, 36, 11, 60, 39, +-7, -45, -67, -81, -114, -110, 0, 24, 23, 45, +-18, -55, -61, -56, -60, -64, -32, -2, 58, 36, +-3, -33, -51, -24, 19, -10, -19, 4, 14, -15, +-19, -59, -81, -12, 7, -12, 36, 16, 48, 36, +17, -13, -32, -49, -78, -95, -1, -3, -10, 25, +15, 5, 41, 59, 108, 101, 103, 81, 70, 35, +-14, -52, -37, 15, 93, 83, 66, 50, 47, 15, +-3, -31, -49, -52, -9, -31, -10, 37, 62, 27, +-15, -56, -82, -17, 75, 56, 36, 22, 7, -16, +-24, -63, -93, -84, 25, 94, 98, 65, 60, 31, +-2, -45, -39, -61, -61, 48, 35, 32, 54, 18, +-19, -51, -45, -57, -28, -8, 10, 14, 38, 26, +-2, -46, -38, 45, 26, 22, 48, 21, 63, 40, +-22, -61, -73, -75, -67, -31, 13, 18, 51, 34, +-12, -2, -1, -17, -3, -27, -3, 6, -1, -15, +-16, -59, -78, 10, 36, 9, 4, -18, 33, 22, +-25, -62, -97, -107, 39, 87, 69, 46, 42, 12, +11, -7, -30, -36, 19, 2, -10, -7, -4, -24, +11, -8, 25, 28, 28, 5, -4, -10, 5, -2, +-10, -48, -37, -17, -38, -9, -2, -19, -30, -22, +-23, -61, -79, -81, -2, 15, -4, 17, 20, 2, +25, -14, -3, -10, -38, 1, 14, -14, -9, -27, +2, -18, -38, -36, -11, -39, -36, -28, -36, -11, +32, 59, 127, 124, 127, 108, 91, 68, 64, 34, +3, -32, -37, -10, -25, -46, 12, 1, -17, -24, +-29, -69, -102, -100, 2, -7, 11, 14, 1, 31, +30, -6, -4, -16, -44, -5, 3, -9, 66, 40, +-9, -45, -52, -5, 37, 19, 26, 6, 51, 32, +-31, -73, -96, -45, -25, -37, -15, -16, 32, 39, +3, -15, 18, 21, 28, 33, 58, 58, 69, 42, +-31, -73, -99, -99, -48, 14, 21, 5, 2, 39, +7, -35, -20, 29, 2, -8, -8, -28, 38, 26, +-5, -39, -64, -36, 15, -15, -11, -21, -23, 5, +-8, -51, -56, 15, -1, -14, -8, -31, 36, 22, +-8, -53, -68, -98, -101, 42, 49, 38, 41, 12, +10, -27, -22, 4, -23, -21, 30, -1, 22, 26, +-13, -56, -42, 31, 9, -1, -10, -2, 22, -4, +15, 8, 56, 57, 45, 55, 57, 46, 72, 44, +-7, -53, -26, 53, 21, 17, 0, 0, 74, 41, +3, -18, -2, 0, 19, 17, 42, 36, 47, 26, +24, -7, -23, -34, -62, -60, 6, -22, 18, 25, +-11, -42, -46, -61, -83, -99, -67, -11, 28, 39, +30, -3, -10, -1, -24, -30, -1, -28, 15, 18, +19, -15, -10, -6, -35, -26, 33, 10, 56, 39, +-13, -53, -82, -42, 53, 37, 18, 10, -3, -21, +-21, -60, -89, -46, 89, 94, 71, 46, 42, 9, +-2, -34, -44, -46, -64, -84, -1, 37, 16, 0, +-17, -51, -65, -64, -7, -17, -29, -11, 52, 27, +22, -15, -16, -39, -55, 26, 36, 21, 62, 28, +-2, -26, -38, -49, -55, -80, -75, 8, 20, 9, +-6, -47, -61, -82, -103, -17, -15, -25, 53, 40, +-8, -47, -66, -18, 56, 43, 25, 29, 39, 3, +-27, -66, -86, -69, -50, -59, -34, -1, 19, 42, +3, -20, 2, 21, 72, 57, 52, 36, 31, 7, +-12, -49, -61, -13, -1, -33, 5, 37, 26, 2, +-27, -69, -92, -62, 2, 43, 88, 67, 64, 36, +0, -40, -4, -6, -20, 43, 33, 25, 50, 20, +14, -20, -30, -44, -73, -37, -24, -47, 26, 20, +31, 53, 111, 118, 127, 126, 121, 99, 85, 46, +-14, -45, -51, -39, 24, 5, -6, 17, 46, 14, +-4, -43, -45, -70, -63, 8, 14, 58, 78, 39, +-8, -47, -66, -84, -114, -55, 10, -8, 32, 40, +28, 22, 42, 26, 8, -21, -16, -6, 22, 10, +24, 10, 34, 31, 35, 31, 46, 39, 59, 36, +-4, -43, -62, -10, 20, -14, 2, 14, -6, -19, +-21, -62, -89, -22, 62, 33, 30, 16, 15, 15, +0, -22, -31, -45, -58, -80, -66, 13, 68, 34, +-16, -45, -6, 7, -6, -17, -14, -15, 2, 2, +10, -5, -22, -38, -40, -70, -60, -15, -23, 0, +22, -11, -22, -39, -67, -25, 30, 5, 58, 37, +-21, -47, 6, 43, 37, 45, 65, 66, 73, 43, +2, -25, -40, -53, -72, -94, -35, 24, 9, 8, +-3, 0, -3, -9, 4, -23, -10, 20, 43, 14, +-2, -41, -60, -9, 57, 32, 17, 16, 6, -19, +1, -31, -36, -36, -54, -68, -77, -75, 21, 37, +-19, -32, 79, 90, 92, 81, 67, 47, 52, 28, +-6, -36, -57, -62, 27, 40, 21, 11, 9, -19, +-10, -47, -49, -59, -74, -18, -14, -30, 25, 18, +-23, -69, -82, 60, 66, 40, 75, 54, 65, 38, +-19, -57, -92, -68, 66, 58, 34, 18, 1, -16, +-29, -68, -99, -88, -37, -38, 13, 8, 5, 40, +-22, -63, -75, 14, 15, 7, 75, 58, 59, 34, +-23, -62, -82, -39, -31, -53, -27, 5, -3, 20, +13, -26, -20, 22, 2, -3, 35, 13, 54, 39, +32, 5, -13, -22, -45, -58, -1, -20, -19, 7, +30, 46, 70, 55, 89, 88, 91, 67, 56, 28, +-13, -50, -63, -25, -28, -50, -23, -32, -34, 19, +-13, -54, -65, -9, -20, -37, 29, 6, 11, 25, +0, -40, -55, -78, -107, -25, 47, 20, 34, 16, +-20, -58, -96, -103, 38, 43, 27, 30, 15, -1, +-16, -49, -52, -66, -80, -57, -44, -39, 6, 38, +0, -38, 5, 13, -8, 23, 24, 1, 7, -9, +-18, -56, -64, -7, 38, 13, 11, 32, 28, 0, +14, -3, -20, -17, 4, -26, -34, -8, 19, -9, +-23, -60, -83, -38, -8, -32, 11, 19, -1, -5, +-5, -47, -12, 56, 38, 22, 18, -8, -5, -8, +18, -4, -24, -16, 27, 2, -6, 5, 25, -5, +13, 0, -19, -35, -23, -45, -59, -30, 19, 3, +19, -12, -23, 1, -7, -35, -14, -32, -23, 4, +-23, -64, -67, -22, -27, -5, -5, -20, 20, 5, +20, 11, 83, 92, 85, 89, 69, 53, 80, 48, +15, -2, -21, -29, -18, -48, -52, -12, -11, -21, +-6, -38, -55, -68, -9, 33, 22, 19, 25, -1, +-8, -46, -49, -67, -64, 16, 8, -6, 32, 15, +3, -25, -46, -46, 39, 50, 34, 21, 46, 14, +8, -33, -37, -68, -82, 31, 34, 13, 19, -6, +33, 0, 5, -7, -32, 2, 22, -3, 35, 17, +-23, -62, -91, -64, 6, 3, 36, 26, 7, -3, +-12, -54, -60, 26, 46, 16, 30, 22, 8, -4, +-23, -61, -40, 31, 58, 73, 88, 77, 74, 41, +-2, -42, -49, 13, 5, -15, 22, -4, 26, 27, +-13, -54, -39, 18, 2, -8, -12, 34, 56, 23, +-20, -31, 27, 23, 24, 28, 39, 33, 47, 27, +36, 17, -4, -20, -30, -61, -8, 20, 0, -15, +-10, -51, -72, -82, -111, -73, 34, 25, 19, 38, +-10, -45, -63, -55, -46, -75, -45, 34, 34, 12, +6, -18, 29, 26, 7, -9, 0, 5, 38, 22, +-7, -52, -16, 69, 43, 26, 23, 2, 51, 34, +-12, -51, -59, -78, -88, 15, 20, 0, -14, 12, +-3, -36, -59, -45, 60, 49, 28, 20, 16, -13, +-28, -70, -90, 9, 67, 48, 90, 77, 70, 38, +-10, -39, -58, -54, 15, -12, 3, 35, 27, -3, +12, -1, 28, 29, 55, 53, 80, 65, 51, 23, +-17, -61, -39, 74, 56, 43, 75, 51, 58, 36, +-30, -71, -93, -43, -29, -26, 4, -19, -14, 37, +3, -13, -31, -38, 11, -5, -22, -11, 43, 14, +-25, -65, -80, -79, -71, 3, 37, 32, 20, 9, +-20, -60, -77, -26, 18, 43, 44, 24, 22, -3, +-4, -42, -22, -19, -45, -32, -35, -39, -46, 1, +-25, -59, -27, -10, -7, -4, 7, 13, 25, 12, +8, -25, -32, -47, -74, -32, 27, 6, 25, 7, +41, 40, 62, 64, 64, 50, 54, 42, 49, 25, +-21, -63, -88, -21, 16, -3, -4, -26, 57, 38, +8, -25, -34, 2, -8, -28, 2, -22, 12, 23, +-19, -49, 10, 71, 84, 71, 66, 48, 42, 22, +-20, -58, -89, -57, 62, 44, 33, 36, 25, -1, +-22, -55, -27, 1, 43, 37, 46, 50, 51, 26, +1, -38, -46, 22, 34, 4, 20, -2, 3, 9, +-4, -42, -49, -75, -89, -24, -25, 19, 71, 39, +5, -28, -45, -43, -63, -75, -17, -38, 14, 30, +-4, -36, -62, -59, -29, -43, -4, -16, 11, 23, +-19, -57, -82, -39, 26, 2, -2, 20, 11, -10, +-28, -68, -92, -70, 9, -1, -15, -30, 11, 31, +1, -22, -41, -49, -30, -58, -48, 8, 4, -9, +38, 41, 108, 115, 96, 98, 103, 84, 86, 51, +15, 1, 58, 46, 26, 6, 16, 18, 41, 24, +4, -34, -14, -27, -42, 20, 18, 2, 23, 1, +-22, -59, -83, -70, -22, -42, -26, 29, 29, 15, +-14, -34, 11, -1, -21, -35, -3, 1, 29, 16, +-16, -57, -78, -7, 17, -13, 8, -13, -6, 22, +-22, -32, -21, -20, 20, -4, 10, 13, 12, -4, +8, -30, -30, -46, -71, -4, 3, -11, 4, -11, +16, 5, -15, -21, 3, -23, -25, -19, -28, -32, +-28, -68, -98, -101, -34, 19, 71, 52, 49, 30, +-18, -57, -82, -56, -56, -66, 15, 12, 1, 29, +-21, -62, -76, -27, -33, -38, 18, 30, 54, 32, +3, -36, -10, -17, -34, -3, -8, 32, 63, 27, +1, -30, -44, -20, -13, -49, -25, 3, -14, -18, +-26, -68, -80, -46, -28, 17, 42, 37, 58, 34, +30, 26, 57, 55, 49, 25, 16, 3, 24, 11, +35, 35, 67, 57, 60, 82, 114, 103, 93, 55, +18, -8, -23, -32, -53, -68, 15, 11, -6, -7, +-2, -43, -29, 0, -28, -5, -5, -15, 25, -1, +4, -13, -35, -45, 14, -6, -2, 19, 16, -9, +-30, -72, -93, -93, -73, -10, -15, 6, 30, 45, +-23, -58, -50, -55, -74, -60, -23, 0, 6, 21, +-4, -40, -63, -24, 7, -19, 4, -18, 27, 28, +-12, 1, 88, 76, 74, 88, 93, 90, 80, 44, +-13, -59, -43, 52, 27, 21, 15, 12, 42, 11, +22, -14, -17, -33, -57, -4, 5, -18, 40, 18, +-3, -23, -43, -44, 8, -16, -14, -4, -20, -29, +35, 45, 75, 82, 111, 117, 125, 105, 89, 51, +-3, -38, -57, -30, 79, 71, 48, 33, 33, 0, +-17, -62, -57, 66, 67, 35, 29, 5, 22, 17, +3, -31, -34, -21, -44, -49, 42, 23, 24, 26, +-23, -62, -74, -49, -30, -30, -37, -50, 9, 35, +-17, -57, -71, -81, -45, 61, 58, 37, 31, 9, +3, -7, 28, 14, -2, 0, 40, 41, 58, 33, +-11, -51, -74, -17, 40, 12, 8, 13, -4, -22, +-16, -46, -31, -35, -49, -49, -26, -9, -7, -7, +17, -9, -24, -41, -68, -73, 38, 33, 19, 16, +-15, -50, -47, -16, -24, -21, 59, 56, 53, 30, +-14, -54, -57, 2, -17, -33, -34, -21, 4, -4, +-23, -62, -93, -72, 48, 31, 21, 6, 3, 17, +-18, -63, -79, 44, 68, 36, 45, 20, 57, 37, +-29, -72, -99, -111, -86, -31, 7, 25, 39, 55, +-14, -49, -53, -63, -80, -31, 24, 13, 1, -1, +-9, -45, -55, -27, -31, -63, -23, 25, 13, -5, +-20, -61, -80, 7, 44, 16, 54, 40, 32, 17, +24, 7, -8, -43, -62, -54, -11, 7, 35, 27, +-12, -55, -59, -48, -69, -4, -1, -12, 68, 39, +-12, -31, 52, 63, 53, 34, 29, 22, 36, 19, +-26, -66, -97, -79, 50, 41, 40, 48, 54, 28, +-2, -37, -41, -2, -11, -30, 29, 16, 4, -2, +40, 49, 56, 37, 39, 40, 64, 59, 67, 39, +11, -5, 20, 14, 25, 16, 25, 22, 37, 17, +-3, -43, -46, -10, -35, -38, -35, -39, 67, 43, +-7, -47, -33, -39, -60, -12, -18, 11, 43, 11, +-25, -65, -91, -76, -91, -81, 0, 13, 34, 50, +-9, -50, -52, 17, 0, -4, 43, 18, 63, 42, +-8, -15, 15, 41, 56, 35, 51, 45, 51, 29, +0, -14, -24, -36, -43, -70, -39, 27, 33, 5, +-25, -62, -81, -66, -12, -26, -16, -4, -13, 21, +-29, -68, -60, -24, -3, 11, 18, 19, 30, 20, +1, -35, -42, -30, -57, -51, 13, -17, 3, 22, +-8, -27, -12, -2, -7, -21, 36, 41, 34, 12, +-17, -56, -62, -72, -73, -17, -26, 9, 16, 13, +11, -21, -37, -3, 16, -17, 1, -3, -18, -19, +15, -20, -19, -22, -49, -30, -7, -29, 3, -2, +17, -4, 11, 6, 51, 40, 36, 34, 48, 22, +-19, -55, -29, 37, 68, 49, 45, 33, 42, 23, +7, -30, -22, 3, -22, -36, -36, -54, 20, 22, +20, 2, -15, -39, -59, -85, -10, 37, 21, 2, +-15, -54, -77, -54, 74, 70, 48, 32, 51, 20, +-25, -64, -70, -75, -52, 17, 6, -20, -30, 26, +-13, -55, -15, 39, 16, 42, 30, 33, 62, 28, +-21, -56, -30, -35, 6, 13, -4, -29, 33, 27, +-17, -55, -75, -31, 3, -28, -26, 16, 18, -4, +-13, -44, -60, -52, -9, -36, -38, 1, -9, -9, +-12, -50, -77, -70, 43, 47, 28, 13, 43, 16, +-13, -57, -80, -104, -113, -30, 43, 45, 52, 39, +3, -28, -42, -37, -58, -67, 23, 4, 38, 33, +-21, -64, -74, -22, 43, 83, 81, 56, 62, 32, +34, 26, 23, 9, 14, 17, 26, 16, 37, 19, +-5, -48, -49, -75, -65, 9, -6, 41, 45, 15, +32, 30, 63, 83, 90, 91, 100, 84, 85, 52, +-19, -54, -68, -71, 11, 30, 13, 1, 63, 37, +44, 76, 99, 87, 117, 113, 103, 77, 64, 32, +-16, -45, -12, 30, 27, 15, 57, 49, 42, 22, +9, -15, -31, -28, -36, -61, -13, -18, -33, -5, +-12, -55, -8, 82, 64, 47, 42, 21, 27, 9, +-15, -56, -74, -12, -19, -28, 7, -16, 53, 38, +-7, -45, -64, -55, -74, -80, 35, 45, 24, 15, +-25, -48, -34, -42, -6, -27, -9, 9, 13, -7, +-25, -65, -84, -35, 30, 14, 24, 39, 48, 28, +-22, -62, -86, -51, 64, 104, 94, 61, 62, 31, +16, -15, -25, -28, -55, -56, -10, -23, 52, 36, +10, -10, -22, -46, -71, -92, -45, -13, 16, 26, +-22, -65, -84, 17, 85, 55, 66, 48, 55, 31, +-1, -38, -33, -25, -49, -15, 18, -10, 41, 30, +-3, -24, -47, -60, -30, -46, -17, -13, -27, 1, +-7, -41, -61, -54, -50, -78, -28, 5, -2, 20, +17, -12, -27, -4, 8, -27, -5, 23, 14, -12, +-36, -81, -111, -75, -17, -9, 9, 9, 39, 49, +-13, -59, -54, 68, 51, 32, 35, 14, 64, 38, +-11, -44, -69, -57, 11, -11, -5, 3, -16, -15, +34, 36, 41, 16, -8, -24, 11, 23, 48, 28, +-17, -42, 8, 17, 45, 69, 71, 55, 49, 23, +3, -30, -46, -64, -95, -109, 2, 39, 19, 19, +25, -13, -7, 16, -11, -5, 8, -11, 52, 33, +-8, -37, -57, -60, 13, 7, -14, -4, 20, -7, +7, -31, 9, 44, 20, 22, 29, 10, 52, 31, +3, -22, -36, -53, -80, -77, -35, -41, 54, 41, +-21, -59, -87, -83, 12, 69, 57, 36, 32, 2, +6, -14, -34, -42, -4, -32, -27, 10, 4, -20, +-11, -56, -59, 25, 8, -5, -9, -26, 68, 43, +22, 13, 40, 39, 73, 81, 95, 88, 82, 45, +-18, -62, -79, 28, 60, 28, 29, 3, 23, 25, +6, -31, -39, -55, -85, -32, 7, -17, 48, 30, +7, -24, -42, -8, 39, 10, 7, 11, 1, -20, +-1, -36, -26, -30, -48, 2, 46, 26, 35, 14, +-17, -57, -56, -10, -4, 26, 22, 6, -4, -16, +-18, -55, -59, -67, -86, -50, 3, 29, 29, 16, +-25, -61, -33, 2, 26, 25, 23, 10, 24, 16, +26, 15, -8, -20, 6, -21, -16, 3, 0, -22, +13, -17, -26, -12, -31, -48, 15, -3, 1, 14, +4, -27, -33, -21, -29, -53, -52, -64, -42, 22, +-11, -41, -42, -40, -42, -64, 0, 48, 50, 19, +-13, -47, -42, -56, -50, 10, 3, -9, -30, -16, +-4, -47, -12, 14, -13, 21, 13, 6, 73, 40, +-15, -50, -63, -41, -31, -55, -60, -13, 28, 15, +-6, -50, -56, -81, -95, 30, 29, 21, 71, 35, +-14, -58, -65, 37, 40, 9, 18, -10, -4, 20, +31, 33, 79, 106, 119, 103, 100, 77, 64, 33, +14, 7, 56, 81, 97, 85, 85, 61, 45, 20, +-24, -66, -74, -51, -17, 16, 5, -21, 22, 26, +-1, -25, -38, -24, -2, -35, -26, 21, 34, 1, +20, 15, 75, 59, 39, 26, 48, 43, 50, 29, +26, 1, -15, -4, -9, -38, 9, 2, -9, -8, +20, 14, 19, 13, 2, -16, 24, 25, 19, 3, +-8, -41, -58, -78, -109, -106, -27, 9, 53, 46, +17, 5, -13, -25, -24, -54, -20, 2, -21, -25, +-11, -50, -48, 19, 10, -7, 46, 26, 24, 17, +-28, -68, -69, -50, -49, -33, -7, 10, 20, 21, +4, -36, -21, 38, 19, 1, 25, -3, 20, 22, +-18, -58, -87, -44, 82, 73, 49, 31, 19, -7, +-21, -61, -78, -44, -58, -66, -9, -23, 10, 40, +-25, -66, -76, -33, -33, 6, 16, -6, -21, 5, +-27, -69, -77, 5, -2, -7, 6, 9, 24, 6, +1, -41, -41, -58, -79, 25, 69, 43, 68, 36, +-28, -67, -85, -71, -34, 0, 14, 12, -2, 4, +-2, -33, -55, -37, 37, 25, 6, 6, 29, -4, +-8, -25, -11, -9, 40, 23, 17, 25, 37, 12, +-21, -27, 52, 60, 47, 58, 76, 70, 69, 38, +23, 15, 22, -8, -32, -50, -10, 3, 31, 21, +-10, -44, -67, -61, -29, -54, 8, 39, 21, 4, +31, 18, 30, 36, 46, 28, 50, 42, 35, 13, +-21, -57, -24, -16, -15, 14, 3, -25, -17, 20, +23, 6, 24, 35, 90, 72, 64, 55, 55, 23, +7, -28, -42, -19, -36, -50, -15, -40, 29, 28, +-21, -59, -66, -59, -6, 85, 83, 53, 54, 26, +2, -20, -42, -52, -27, -49, 5, 9, -9, -8, +-18, -56, -84, -72, 24, 51, 32, 20, 13, -10, +-13, -53, -64, -39, -63, -40, 24, 0, 34, 29, +0, -31, -45, -63, -90, -53, 3, -18, -9, 24, +-13, -57, -71, 27, 19, -3, 25, -3, 45, 35, +12, -9, -26, -40, -51, -78, -24, 11, -9, -6, +-12, -49, -45, -33, -50, -48, -46, -52, 2, 25, +-14, -56, -84, -108, -122, -50, 4, 22, 42, 53, +-6, -44, -54, -28, -41, -61, 19, 25, 6, 1, +-32, -75, -95, -38, -1, -15, 7, 14, 23, 23, +11, 12, 37, 30, 38, 51, 80, 80, 82, 47, +-19, -56, -69, -82, -98, -64, -29, 2, 28, 42, +-18, -49, 3, 34, 41, 39, 32, 18, 21, 7, +-8, 23, 39, 30, 30, 27, 41, 36, 44, 23, +-16, -49, -69, -46, 1, -27, 41, 48, 35, 15, +6, -32, -36, 5, -17, -30, 2, -16, 51, 35, +-23, -64, -91, -21, 71, 44, 52, 44, 40, 21, +-22, -55, -40, -20, 62, 52, 38, 29, 27, 5, +-27, -69, -75, -6, -8, 3, -2, -30, -42, 13, +2, -29, -42, -10, 29, 2, 15, 30, 26, 0, +-27, -69, -85, -75, -54, -8, -14, -31, 16, 42, +-2, -44, -54, -75, -101, -6, 4, -3, 32, 13, +7, -3, -22, -43, -14, -27, -24, -11, -14, -12, +-18, -57, -85, -66, 47, 86, 75, 45, 42, 10, +18, 3, 39, 76, 80, 48, 48, 41, 44, 21, +-13, -51, -73, -22, -15, -41, 3, -4, -22, 3, +-10, -50, -63, -9, -23, -42, -6, -30, 11, 28, +15, -11, -29, -39, -57, -71, -23, -40, -33, 20, +-2, -40, -48, -5, -21, -25, 31, 7, 53, 35, +-19, -63, -72, 39, 34, 16, 37, 17, 54, 31, +-18, -49, -28, -27, -40, -29, 4, 4, 19, 11, +-1, -43, -41, 24, 15, -12, -4, -31, -4, 23, +-11, -46, -79, -74, 34, 21, 9, 15, 3, -13, +-16, -51, -56, -55, 8, 62, 50, 30, 43, 14, +-1, -25, -27, -32, -46, -62, -66, -36, 53, 32, +-12, -49, -77, -50, 2, -21, 23, 6, 14, 21, +-5, -47, -58, -77, -105, -14, 30, 9, 73, 44, +-24, -52, -4, 10, 13, 13, 27, 27, 42, 24, +-10, -38, -27, -15, -24, -52, -53, 1, 14, -6, +-17, -45, -13, 2, 19, 53, 83, 79, 76, 43, +-21, -62, -86, -48, 40, 17, 14, -9, 40, 30, +-1, -32, -51, -33, -3, -35, 2, 17, -2, -12, +-21, -60, -85, -70, 33, 73, 58, 37, 67, 36, +-1, -45, -39, 37, 17, 3, 18, -8, 53, 35, +-8, -47, -65, -61, -87, -93, 9, 9, 2, 33, +-13, -55, -56, -19, -29, 14, 17, 6, 55, 28, +5, 1, -7, -23, -26, -56, -39, 14, 11, -13, +-28, -69, -89, -74, -83, -45, 1, 0, 16, 45, +-3, 5, 91, 104, 119, 111, 97, 76, 72, 39, +19, 5, -12, -34, -41, -72, -67, 14, 21, 1, +-17, -49, 15, 27, 13, 6, 2, 12, 27, 10, +-10, -30, 18, 36, 93, 87, 87, 69, 58, 26, +37, 32, 64, 54, 53, 67, 78, 73, 80, 48, +48, 46, 38, 9, -1, 8, 47, 44, 58, 33, +-23, -61, -88, -76, 27, 14, 9, 36, 36, 10, +-24, -66, -88, -97, -55, 20, 19, 16, 52, 31, +4, -16, -1, -8, 2, 0, 15, 13, 29, 14, +-9, -44, -66, -72, 8, 32, 37, 38, 46, 16, +-22, -65, -62, 30, 22, 51, 57, 45, 68, 38, +-4, -42, -53, -33, -54, -53, -4, -18, 62, 40, +-5, -37, -61, -41, 35, 15, -2, -3, -12, -28, +-18, -65, -55, 90, 80, 49, 44, 21, 59, 36, +5, -16, -31, -32, -37, -62, -19, -11, 9, 16, +-22, -60, -67, -51, -61, -35, -5, -18, -27, 24, +-18, -55, -39, -42, -40, 20, 25, 6, 6, 7, +0, -25, -42, -50, -59, -84, -31, -13, -22, 17, +-32, -73, -100, -89, -21, -10, 18, 38, 31, 23, +-15, -54, -57, -13, -18, -41, -32, 17, 50, 21, +-16, -57, -71, -10, -8, -26, -38, -47, 42, 25, +-17, -58, -82, -7, 33, 3, 30, 11, 13, 24, +-23, -61, -97, -83, 82, 81, 57, 39, 31, 2, +26, 32, 104, 86, 62, 55, 77, 70, 74, 43, +-8, -29, -33, -52, -74, -73, -17, 14, 39, 25, +-21, -60, -68, -22, 43, 37, 51, 54, 64, 36, +-5, -30, -50, -52, 22, 7, 10, 13, 0, -20, +-15, -53, -61, -34, -50, -25, 15, 6, 0, -14, +-10, -51, -60, 20, 77, 50, 34, 22, 8, -8, +-8, -45, -52, -59, -76, -35, -43, -49, 47, 40, +41, 44, 53, 40, 41, 30, 38, 31, 46, 24, +19, 3, -15, -26, -16, -45, -13, 24, 18, -5, +-3, -39, -54, -35, -49, -70, 2, -6, -19, 15, +-13, -53, -36, 6, -3, 45, 50, 30, 33, 10, +15, -25, -16, -4, -32, 7, 23, 6, 67, 36, +-21, -58, -87, -71, 10, -12, -16, 19, 10, 0, +9, -15, -6, 25, 31, 7, 30, 28, 20, 2, +2, -28, -42, -50, -67, -75, 12, 12, -4, 8, +-17, -63, -58, 56, 49, 36, 60, 38, 37, 14, +-13, -48, -38, -29, -44, -25, -20, -33, 38, 20, +2, -37, -42, -1, -18, -42, 3, -17, -19, 12, +-20, -60, -73, -7, 12, -13, -22, -38, 4, 10, +-8, -41, -63, -65, 42, 63, 45, 31, 31, 0, +-4, -46, -38, -9, -35, 15, 50, 27, 67, 39, +3, -7, -13, -34, -51, -47, 9, 39, 54, 29, +-29, -71, -89, -52, -39, -6, 3, 2, 38, 28, +-14, -42, -13, -15, -19, 0, 20, 12, 37, 25, +11, -26, -24, -40, -65, -11, -13, -27, 65, 37, +0, -31, -46, -17, -21, -45, 11, -2, 25, 24, +51, 91, 102, 87, 85, 63, 57, 42, 48, 23, +-4, -34, -56, -70, -10, -14, 4, 18, 3, -8, +-23, -59, -39, -44, -42, -14, -10, -23, -4, 17, +-2, 4, 35, 63, 69, 75, 82, 63, 78, 48, +-17, -55, -60, -3, -4, -19, 4, -4, -18, -29, +2, -20, -36, -50, -32, -59, -16, 30, 16, -6, +-12, -47, 24, 68, 45, 46, 41, 32, 65, 37, +-4, -40, -54, -67, -96, -66, -9, -25, 42, 38, +-15, 13, 58, 58, 84, 104, 119, 104, 89, 51, +-15, -24, -9, -24, -27, -50, -7, 28, 29, 6, +-7, -33, -35, -49, -65, -53, -37, -10, 33, 14, +31, 19, 46, 72, 67, 45, 83, 68, 63, 41, +-14, -53, -59, -17, 55, 79, 64, 39, 43, 10, +}; + +const signed char cdbk_lsp2_vlbr[160]={ +-20, -30, -24, 17, 7, -13, -21, 61, 56, 16, +12, 1, 10, 77, 32, 3, 7, 3, -25, -31, +-4, 2, -36, -83, 18, 5, -5, 5, 11, 23, +-2, -1, -11, -12, -20, -28, 68, 50, -17, -20, +5, 2, 1, 20, 17, 4, -52, -66, 36, 24, +-4, -10, 7, -15, -32, 80, 37, 8, -13, -29, +33, 37, 28, 15, 8, 14, 35, 18, 50, 36, +-4, -1, 4, -7, 3, 3, -11, -58, -75, 13, +13, 21, 24, -11, -12, -38, -72, 33, 15, -12, +-44, -17, 83, 21, 2, 7, 0, 4, 0, -1, +-25, -42, -51, 33, 20, 15, 30, -13, 9, 32, +6, 2, -8, 7, -38, -77, 6, -13, -7, 32, +48, 57, 32, -12, -10, -4, 2, -15, -29, -29, +2, 10, -9, -16, 79, 44, 7, 12, -5, -18, +-23, -29, -35, -3, -3, -18, -34, -3, -39, -50, +-5, -10, -8, -37, -76, 11, -4, -19, 30, 16, +}; + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/lpc.c b/3rdparty/iaxclient-2/lib/libspeex/lpc.c new file mode 100644 index 0000000..dd30183 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/lpc.c @@ -0,0 +1,197 @@ +/* + Copyright 1992, 1993, 1994 by Jutta Degener and Carsten Bormann, + Technische Universitaet Berlin + + Any use of this software is permitted provided that this notice is not + removed and that neither the authors nor the Technische Universitaet Berlin + are deemed to have made any representations as to the suitability of this + software for any purpose nor are held responsible for any defects of + this software. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE. + + As a matter of courtesy, the authors request to be informed about uses + this software has found, about bugs in this software, and about any + improvements that may be of general interest. + + Berlin, 28.11.1994 + Jutta Degener + Carsten Bormann + + + Code modified by Jean-Marc Valin + + Speex License: + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + + + +/* LPC analysis + * + * The next two functions calculate linear prediction coefficients + * and/or the related reflection coefficients from the first P_MAX+1 + * values of the autocorrelation function. + */ + +/* Invented by N. Levinson in 1947, modified by J. Durbin in 1959. + */ + +#include "lpc.h" + +/* returns minimum mean square error */ +spx_word32_t _spx_lpc( +spx_coef_t *lpc, /* out: [0...p-1] LPC coefficients */ +const spx_word16_t *ac, /* in: [0...p] autocorrelation values */ +int p +) +{ + int i, j; + spx_word16_t r; + spx_word16_t error = ac[0]; + + if (ac[0] == 0) + { + for (i = 0; i < p; i++) + lpc[i] = 0; + return 0; + } + + for (i = 0; i < p; i++) { + + /* Sum up this iteration's reflection coefficient */ + spx_word32_t rr = NEG32(SHL32(EXTEND32(ac[i + 1]),13)); + for (j = 0; j < i; j++) + rr = SUB32(rr,MULT16_16(lpc[j],ac[i - j])); +#ifdef FIXED_POINT + r = DIV32_16(rr,ADD16(error,16)); +#else + r = rr/(error+.003*ac[0]); +#endif + /* Update LPC coefficients and total error */ + lpc[i] = r; + for (j = 0; j < i>>1; j++) + { + spx_word16_t tmp = lpc[j]; + lpc[j] = MAC16_16_Q13(lpc[j],r,lpc[i-1-j]); + lpc[i-1-j] = MAC16_16_Q13(lpc[i-1-j],r,tmp); + } + if (i & 1) + lpc[j] = MAC16_16_Q13(lpc[j],lpc[j],r); + + error = SUB16(error,MULT16_16_Q13(r,MULT16_16_Q13(error,r))); + } + return error; +} + + +#ifdef FIXED_POINT + +/* Compute the autocorrelation + * ,--, + * ac(i) = > x(n) * x(n-i) for all n + * `--' + * for lags between 0 and lag-1, and x == 0 outside 0...n-1 + */ + +void _spx_autocorr( +const spx_word16_t *x, /* in: [0...n-1] samples x */ +spx_word16_t *ac, /* out: [0...lag-1] ac values */ +int lag, +int n +) +{ + spx_word32_t d; + int i, j; + spx_word32_t ac0=1; + int shift, ac_shift; + + for (j=0;j x(n) * x(n-i) for all n + * `--' + * for lags between 0 and lag-1, and x == 0 outside 0...n-1 + */ +void _spx_autocorr( +const spx_word16_t *x, /* in: [0...n-1] samples x */ +float *ac, /* out: [0...lag-1] ac values */ +int lag, +int n +) +{ + float d; + int i; + while (lag--) + { + for (i = lag, d = 0; i < n; i++) + d += x[i] * x[i-lag]; + ac[lag] = d; + } + ac[0] += 10; +} + +#endif + + diff --git a/3rdparty/iaxclient-2/lib/libspeex/lpc.h b/3rdparty/iaxclient-2/lib/libspeex/lpc.h new file mode 100644 index 0000000..6050447 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/lpc.h @@ -0,0 +1,51 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: lpc.h + Functions for LPC (Linear Prediction Coefficients) analysis + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef LPC_H +#define LPC_H + +#include "misc.h" + +void _spx_autocorr( + const spx_word16_t * x, /* in: [0...n-1] samples x */ + spx_word16_t *ac, /* out: [0...lag-1] ac values */ + int lag, int n); + +spx_word32_t /* returns minimum mean square error */ +_spx_lpc( + spx_coef_t * lpc, /* [0...p-1] LPC coefficients */ + const spx_word16_t * ac, /* in: [0...p] autocorrelation values */ + int p + ); + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/lsp.c b/3rdparty/iaxclient-2/lib/libspeex/lsp.c new file mode 100644 index 0000000..ecb9755 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/lsp.c @@ -0,0 +1,621 @@ +/*---------------------------------------------------------------------------*\ +Original copyright + FILE........: AKSLSPD.C + TYPE........: Turbo C + COMPANY.....: Voicetronix + AUTHOR......: David Rowe + DATE CREATED: 24/2/93 + +Heavily modified by Jean-Marc Valin (fixed-point, optimizations, + additional functions, ...) + + This file contains functions for converting Linear Prediction + Coefficients (LPC) to Line Spectral Pair (LSP) and back. Note that the + LSP coefficients are not in radians format but in the x domain of the + unit circle. + + Speex License: + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#ifdef _MSC_VER +#include "winpoop.h" +#endif +#include +#include "lsp.h" +#include "stack_alloc.h" +#include "math_approx.h" + +#ifndef M_PI +#define M_PI 3.14159265358979323846 /* pi */ +#endif + +#ifndef NULL +#define NULL 0 +#endif + +#ifdef FIXED_POINT + +#define C1 8192 +#define C2 -4096 +#define C3 340 +#define C4 -10 + +static spx_word16_t spx_cos(spx_word16_t x) +{ + spx_word16_t x2; + + if (x<12868) + { + x2 = MULT16_16_P13(x,x); + return ADD32(C1, MULT16_16_P13(x2, ADD32(C2, MULT16_16_P13(x2, ADD32(C3, MULT16_16_P13(C4, x2)))))); + } else { + x = SUB16(25736,x); + x2 = MULT16_16_P13(x,x); + return SUB32(-C1, MULT16_16_P13(x2, ADD32(C2, MULT16_16_P13(x2, ADD32(C3, MULT16_16_P13(C4, x2)))))); + /*return SUB32(-C1, MULT16_16_Q13(x2, ADD32(C2, MULT16_16_Q13(C3, x2))));*/ + } +} + + +#define FREQ_SCALE 16384 + +/*#define ANGLE2X(a) (32768*cos(((a)/8192.)))*/ +#define ANGLE2X(a) (SHL16(spx_cos(a),2)) + +/*#define X2ANGLE(x) (acos(.00006103515625*(x))*LSP_SCALING)*/ +#define X2ANGLE(x) (spx_acos(x)) + +#else + +/*#define C1 0.99940307 +#define C2 -0.49558072 +#define C3 0.03679168*/ + +#define C1 0.9999932946f +#define C2 -0.4999124376f +#define C3 0.0414877472f +#define C4 -0.0012712095f + + +#define SPX_PI_2 1.5707963268 +static inline spx_word16_t spx_cos(spx_word16_t x) +{ + if (x>1; + VARDECL(spx_word16_t *coefn); + + /*Prevents overflows*/ + if (x>16383) + x = 16383; + if (x<-16383) + x = -16383; + + /* Allocate memory for Chebyshev series formulation */ + ALLOC(T, m2+1, spx_word16_t); + ALLOC(coefn, m2+1, spx_word16_t); + + for (i=0;i>1; + + /* Allocate memory for Chebyshev series formulation */ + ALLOC(T, m2+1, float); + + /* Initialise values */ + T[0]=1; + T[1]=x; + + /* Evaluate Chebyshev series formulation using iterative approach */ + /* Evaluate polynomial and return value also free memory space */ + sum = coef[m2] + coef[m2-1]*x; + x *= 2; + for(i=2;i<=m2;i++) + { + T[i] = x*T[i-1] - T[i-2]; + sum += coef[m2-i] * T[i]; + } + + return sum; +} +#endif + +/*---------------------------------------------------------------------------*\ + + FUNCTION....: lpc_to_lsp() + + AUTHOR......: David Rowe + DATE CREATED: 24/2/93 + + This function converts LPC coefficients to LSP + coefficients. + +\*---------------------------------------------------------------------------*/ + +#ifdef FIXED_POINT +#define SIGN_CHANGE(a,b) (((a)&0x70000000)^((b)&0x70000000)||(b==0)) +#else +#define SIGN_CHANGE(a,b) (((a)*(b))<0.0) +#endif + + +int lpc_to_lsp (spx_coef_t *a,int lpcrdr,spx_lsp_t *freq,int nb,spx_word16_t delta, char *stack) +/* float *a lpc coefficients */ +/* int lpcrdr order of LPC coefficients (10) */ +/* float *freq LSP frequencies in the x domain */ +/* int nb number of sub-intervals (4) */ +/* float delta grid spacing interval (0.02) */ + + +{ + spx_word16_t temp_xr,xl,xr,xm=0; + spx_word32_t psuml,psumr,psumm,temp_psumr/*,temp_qsumr*/; + int i,j,m,flag,k; + VARDECL(spx_word32_t *Q); /* ptrs for memory allocation */ + VARDECL(spx_word32_t *P); + spx_word32_t *px; /* ptrs of respective P'(z) & Q'(z) */ + spx_word32_t *qx; + spx_word32_t *p; + spx_word32_t *q; + spx_word32_t *pt; /* ptr used for cheb_poly_eval() + whether P' or Q' */ + int roots=0; /* DR 8/2/94: number of roots found */ + flag = 1; /* program is searching for a root when, + 1 else has found one */ + m = lpcrdr/2; /* order of P'(z) & Q'(z) polynomials */ + + /* Allocate memory space for polynomials */ + ALLOC(Q, (m+1), spx_word32_t); + ALLOC(P, (m+1), spx_word32_t); + + /* determine P'(z)'s and Q'(z)'s coefficients where + P'(z) = P(z)/(1 + z^(-1)) and Q'(z) = Q(z)/(1-z^(-1)) */ + + px = P; /* initialise ptrs */ + qx = Q; + p = px; + q = qx; + +#ifdef FIXED_POINT + *px++ = LPC_SCALING; + *qx++ = LPC_SCALING; + for(i=1;i<=m;i++){ + *px++ = SUB32(ADD32(EXTEND32(a[i]),EXTEND32(a[lpcrdr+1-i])), *p++); + *qx++ = ADD32(SUB32(EXTEND32(a[i]),EXTEND32(a[lpcrdr+1-i])), *q++); + } + px = P; + qx = Q; + for(i=0;i=32768) + speex_warning_int("px", *px); + if (fabs(*qx)>=32768) + speex_warning_int("qx", *qx);*/ + *px = PSHR32(*px,2); + *qx = PSHR32(*qx,2); + px++; + qx++; + } + /* The reason for this lies in the way cheb_poly_eva() is implemented for fixed-point */ + P[m] = PSHR32(P[m],3); + Q[m] = PSHR32(Q[m],3); +#else + *px++ = LPC_SCALING; + *qx++ = LPC_SCALING; + for(i=1;i<=m;i++){ + *px++ = (a[i]+a[lpcrdr+1-i]) - *p++; + *qx++ = (a[i]-a[lpcrdr+1-i]) + *q++; + } + px = P; + qx = Q; + for(i=0;i= -FREQ_SCALE)){ + spx_word16_t dd; + /* Modified by JMV to provide smaller steps around x=+-1 */ +#ifdef FIXED_POINT + dd = MULT16_16_Q15(delta,SUB16(FREQ_SCALE, MULT16_16_Q14(MULT16_16_Q14(xl,xl),14000))); + if (psuml<512 && psuml>-512) + dd = PSHR16(dd,1); +#else + dd=delta*(1-.9*xl*xl); + if (fabs(psuml)<.2) + dd *= .5; +#endif + xr = SUB16(xl, dd); /* interval spacing */ + psumr = cheb_poly_eva(pt,xr,lpcrdr,stack);/* poly(xl-delta_x) */ + temp_psumr = psumr; + temp_xr = xr; + + /* if no sign change increment xr and re-evaluate poly(xr). Repeat til + sign change. + if a sign change has occurred the interval is bisected and then + checked again for a sign change which determines in which + interval the zero lies in. + If there is no sign change between poly(xm) and poly(xl) set interval + between xm and xr else set interval between xl and xr and repeat till + root is located within the specified limits */ + + if(SIGN_CHANGE(psumr,psuml)) + { + roots++; + + psumm=psuml; + for(k=0;k<=nb;k++){ +#ifdef FIXED_POINT + xm = ADD16(PSHR16(xl,1),PSHR16(xr,1)); /* bisect the interval */ +#else + xm = .5*(xl+xr); /* bisect the interval */ +#endif + psumm=cheb_poly_eva(pt,xm,lpcrdr,stack); + /*if(psumm*psuml>0.)*/ + if(!SIGN_CHANGE(psumm,psuml)) + { + psuml=psumm; + xl=xm; + } else { + psumr=psumm; + xr=xm; + } + } + + /* once zero is found, reset initial interval to xr */ + freq[j] = X2ANGLE(xm); + xl = xm; + flag = 0; /* reset flag for next search */ + } + else{ + psuml=temp_psumr; + xl=temp_xr; + } + } + } + return(roots); +} + + +/*---------------------------------------------------------------------------*\ + + FUNCTION....: lsp_to_lpc() + + AUTHOR......: David Rowe + DATE CREATED: 24/2/93 + + lsp_to_lpc: This function converts LSP coefficients to LPC + coefficients. + +\*---------------------------------------------------------------------------*/ + +#ifdef FIXED_POINT + +void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack) +/* float *freq array of LSP frequencies in the x domain */ +/* float *ak array of LPC coefficients */ +/* int lpcrdr order of LPC coefficients */ + + +{ + int i,j; + spx_word32_t xout1,xout2,xin1,xin2; + VARDECL(spx_word32_t *Wp); + spx_word32_t *pw,*n1,*n2,*n3,*n4=NULL; + VARDECL(spx_word16_t *freqn); + int m = lpcrdr>>1; + + ALLOC(freqn, lpcrdr, spx_word16_t); + for (i=0;iSHL(32766,8)) + ak[j] = 32767; + else if (xout1 + xout2 < -SHL(32766,8)) + ak[j] = -32767; + else + ak[j] = EXTRACT16(PSHR32(ADD32(xout1,xout2),8)); + *(n4+1) = xin1; + *(n4+2) = xin2; + + xin1 = 0; + xin2 = 0; + } +} +#else + +void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack) +/* float *freq array of LSP frequencies in the x domain */ +/* float *ak array of LPC coefficients */ +/* int lpcrdr order of LPC coefficients */ + + +{ + int i,j; + float xout1,xout2,xin1,xin2; + VARDECL(float *Wp); + float *pw,*n1,*n2,*n3,*n4=NULL; + VARDECL(float *x_freq); + int m = lpcrdr>>1; + + ALLOC(Wp, 4*m+2, float); + pw = Wp; + + /* initialise contents of array */ + + for(i=0;i<=4*m+1;i++){ /* set contents of buffer to 0 */ + *pw++ = 0.0; + } + + /* Set pointers up */ + + pw = Wp; + xin1 = 1.0; + xin2 = 1.0; + + ALLOC(x_freq, lpcrdr, float); + for (i=0;im2) + lsp[len-1]=m2; + for (i=1;ilsp[i+1]-m) + lsp[i]= SHR16(lsp[i],1) + SHR16(lsp[i+1]-m,1); + } +} + + +void lsp_interpolate(spx_lsp_t *old_lsp, spx_lsp_t *new_lsp, spx_lsp_t *interp_lsp, int len, int subframe, int nb_subframes) +{ + int i; + spx_word16_t tmp = DIV32_16(SHL32(1 + subframe,14),nb_subframes); + spx_word16_t tmp2 = 16384-tmp; + for (i=0;iLSP_SCALING*(M_PI-margin)) + lsp[len-1]=LSP_SCALING*(M_PI-margin); + for (i=1;ilsp[i+1]-LSP_SCALING*margin) + lsp[i]= .5f* (lsp[i] + lsp[i+1]-LSP_SCALING*margin); + } +} + + +void lsp_interpolate(spx_lsp_t *old_lsp, spx_lsp_t *new_lsp, spx_lsp_t *interp_lsp, int len, int subframe, int nb_subframes) +{ + int i; + float tmp = (1.0f + subframe)/nb_subframes; + for (i=0;i +#include "ltp.h" +#include "stack_alloc.h" +#include "filters.h" +#include +#include "math_approx.h" + +#ifndef NULL +#define NULL 0 +#endif + + +#ifdef _USE_SSE +#include "ltp_sse.h" +#elif defined (ARM4_ASM) || defined(ARM5E_ASM) +#include "ltp_arm4.h" +#else + +static spx_word32_t inner_prod(const spx_word16_t *x, const spx_word16_t *y, int len) +{ + spx_word32_t sum=0; + len >>= 2; + while(len--) + { + spx_word32_t part=0; + part = MAC16_16(part,*x++,*y++); + part = MAC16_16(part,*x++,*y++); + part = MAC16_16(part,*x++,*y++); + part = MAC16_16(part,*x++,*y++); + /* HINT: If you had a 40-bit accumulator, you could shift only at the end */ + sum = ADD32(sum,SHR32(part,6)); + } + return sum; +} + +#if 0 /* HINT: Enable this for machines with enough registers (i.e. not x86) */ +static void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack) +{ + int i,j; + for (i=0;i0) + { + if (SHR16(corr16[i-start],4)>ener16[i-start]) + tmp = SHL32(EXTEND32(ener16[i-start]),14); + else if (-SHR16(corr16[i-start],4)>ener16[i-start]) + tmp = -SHL32(EXTEND32(ener16[i-start]),14); + else + tmp = SHL32(tmp,10); + g = DIV32_16(tmp, 8+ener16[i-start]); + score[i-start] = MULT16_16(corr16[i-start],g); + } else + { + score[i-start] = 1; + } + } + } +#else + for (i=start;i<=end;i++) + { + float g = corr[i-start]/(1+energy[i-start]); + if (g>16) + g = 16; + else if (g<-16) + g = -16; + score[i-start] = g*corr[i-start]; + } +#endif + + /* Extract best scores */ + for (i=start;i<=end;i++) + { + if (score[i-start]>best_score[N-1]) + { + for (j=0;j best_score[j]) + { + for (k=N-1;k>j;k--) + { + best_score[k]=best_score[k-1]; + pitch[k]=pitch[k-1]; + } + best_score[j]=score[i-start]; + pitch[j]=i; + break; + } + } + } + } + + /* Compute open-loop gain */ + if (gain) + { + for (j=0;jgain_bits; + gain_cdbk = params->gain_cdbk + 3*gain_cdbk_size*cdbk_offset; + ALLOC(tmp1, 3*nsf, spx_sig_t); + ALLOC(tmp2, 3*nsf, spx_sig_t); + + x[0]=tmp1; + x[1]=tmp1+nsf; + x[2]=tmp1+2*nsf; + + e[0]=tmp2; + e[1]=tmp2+nsf; + e[2]=tmp2+2*nsf; + for (i=2;i>=0;i--) + { + int pp=pitch+1-i; + for (j=0;j max_val) + max_val = tmp; + } + } + for (i=0;i max_val) + max_val = tmp; + } + + sig_shift=0; + while (max_val>16384) + { + sig_shift++; + max_val >>= 1; + } + + for (j=0;j<3;j++) + { + for (i=0;i0) + gain_sum += g0; + if (g2>0) + gain_sum += g2; + if (gain_sum > 64) + { + gain_sum = SUB16(gain_sum, 64); + if (gain_sum > 127) + gain_sum = 127; +#ifdef FIXED_POINT + pitch_control = SUB16(64,EXTRACT16(PSHR32(MULT16_16(64,MULT16_16_16(plc_tuning, gain_sum)),10))); +#else + pitch_control = 64*(1.-.001*plc_tuning*gain_sum); +#endif + if (pitch_control < 0) + pitch_control = 0; + } + + sum = ADD32(sum,MULT16_32_Q14(MULT16_16_16(g0,pitch_control),C[0])); + sum = ADD32(sum,MULT16_32_Q14(MULT16_16_16(g1,pitch_control),C[1])); + sum = ADD32(sum,MULT16_32_Q14(MULT16_16_16(g2,pitch_control),C[2])); + sum = SUB32(sum,MULT16_32_Q14(MULT16_16_16(g0,g1),C[3])); + sum = SUB32(sum,MULT16_32_Q14(MULT16_16_16(g2,g1),C[4])); + sum = SUB32(sum,MULT16_32_Q14(MULT16_16_16(g2,g0),C[5])); + sum = SUB32(sum,MULT16_32_Q15(MULT16_16_16(g0,g0),C[6])); + sum = SUB32(sum,MULT16_32_Q15(MULT16_16_16(g1,g1),C[7])); + sum = SUB32(sum,MULT16_32_Q15(MULT16_16_16(g2,g2),C[8])); + /* We could force "safe" pitch values to handle packet loss better */ + + if (sum>best_sum || i==0) + { + best_sum=sum; + best_cdbk=i; + } + } +#ifdef FIXED_POINT + gain[0] = ADD16(32,(spx_word16_t)gain_cdbk[best_cdbk*3]); + gain[1] = ADD16(32,(spx_word16_t)gain_cdbk[best_cdbk*3+1]); + gain[2] = ADD16(32,(spx_word16_t)gain_cdbk[best_cdbk*3+2]); + /*printf ("%d %d %d %d\n",gain[0],gain[1],gain[2], best_cdbk);*/ +#else + gain[0] = 0.015625*gain_cdbk[best_cdbk*3] + .5; + gain[1] = 0.015625*gain_cdbk[best_cdbk*3+1]+ .5; + gain[2] = 0.015625*gain_cdbk[best_cdbk*3+2]+ .5; +#endif + *cdbk_index=best_cdbk; + } + +#ifdef FIXED_POINT + for (i=0;i10) + N=10; + if (N<1) + N=1; + + ALLOC(nbest, N, int); + params = (const ltp_params*) par; + + if (endpitch_bits); + speex_bits_pack(bits, 0, params->gain_bits); + for (i=0;iend-start+1) + N=end-start+1; + open_loop_nbest_pitch(sw, start, end, nsf, nbest, NULL, N, stack); + for (i=0;ipitch_bits); + speex_bits_pack(bits, best_gain_index, params->gain_bits); + /*printf ("encode pitch: %d %d\n", best_pitch, best_gain_index);*/ + for (i=0;igain_bits; + gain_cdbk = params->gain_cdbk + 3*gain_cdbk_size*cdbk_offset; + + pitch = speex_bits_unpack_unsigned(bits, params->pitch_bits); + pitch += start; + gain_index = speex_bits_unpack_unsigned(bits, params->gain_bits); + /*printf ("decode pitch: %d %d\n", pitch, gain_index);*/ +#ifdef FIXED_POINT + gain[0] = 32+(spx_word16_t)gain_cdbk[gain_index*3]; + gain[1] = 32+(spx_word16_t)gain_cdbk[gain_index*3+1]; + gain[2] = 32+(spx_word16_t)gain_cdbk[gain_index*3+2]; +#else + gain[0] = 0.015625*gain_cdbk[gain_index*3]+.5; + gain[1] = 0.015625*gain_cdbk[gain_index*3+1]+.5; + gain[2] = 0.015625*gain_cdbk[gain_index*3+2]+.5; +#endif + + if (count_lost && pitch > subframe_offset) + { + float gain_sum; + if (1) { + float tmp = count_lost < 4 ? GAIN_SCALING_1*last_pitch_gain : 0.4 * GAIN_SCALING_1 * last_pitch_gain; + if (tmp>.95) + tmp=.95; + gain_sum = GAIN_SCALING_1*gain_3tap_to_1tap(gain); + + if (gain_sum > tmp) { + float fact = tmp/gain_sum; + for (i=0;i<3;i++) + gain[i]*=fact; + + } + + } + + } + + *pitch_val = pitch; + gain_val[0]=gain[0]; + gain_val[1]=gain[1]; + gain_val[2]=gain[2]; + + { + spx_sig_t *e[3]; + VARDECL(spx_sig_t *tmp2); + ALLOC(tmp2, 3*nsf, spx_sig_t); + e[0]=tmp2; + e[1]=tmp2+nsf; + e[2]=tmp2+2*nsf; + + for (i=0;i<3;i++) + { + int j; + int pp=pitch+1-i; +#if 0 + for (j=0;jpp) + tmp1=pp; + for (j=0;jpp+pitch) + tmp3=pp+pitch; + for (j=tmp1;j.99) + coef=.99; + for (i=0;i.99) + coef=.99; + for (i=0;i +#include "misc.h" + +typedef struct ltp_params { + const signed char *gain_cdbk; + int gain_bits; + int pitch_bits; +} ltp_params; + +#ifdef FIXED_POINT +#define gain_3tap_to_1tap(g) (ABS(g[1]) + (g[0]>0 ? g[0] : -SHR16(g[0],1)) + (g[2]>0 ? g[2] : -SHR16(g[2],1))) +#else +#define gain_3tap_to_1tap(g) (ABS(g[1]) + (g[0]>0 ? g[0] : -.5*g[0]) + (g[2]>0 ? g[2] : -.5*g[2])) +#endif + +void open_loop_nbest_pitch(spx_sig_t *sw, int start, int end, int len, int *pitch, spx_word16_t *gain, int N, char *stack); + + +/** Finds the best quantized 3-tap pitch predictor by analysis by synthesis */ +int pitch_search_3tap( +spx_sig_t target[], /* Target vector */ +spx_sig_t *sw, +spx_coef_t ak[], /* LPCs for this subframe */ +spx_coef_t awk1[], /* Weighted LPCs #1 for this subframe */ +spx_coef_t awk2[], /* Weighted LPCs #2 for this subframe */ +spx_sig_t exc[], /* Overlapping codebook */ +const void *par, +int start, /* Smallest pitch value allowed */ +int end, /* Largest pitch value allowed */ +spx_word16_t pitch_coef, /* Voicing (pitch) coefficient */ +int p, /* Number of LPC coeffs */ +int nsf, /* Number of samples in subframe */ +SpeexBits *bits, +char *stack, +spx_sig_t *exc2, +spx_word16_t *r, +int complexity, +int cdbk_offset, +int plc_tuning +); + +/*Unquantize adaptive codebook and update pitch contribution*/ +void pitch_unquant_3tap( +spx_sig_t exc[], /* Excitation */ +int start, /* Smallest pitch value allowed */ +int end, /* Largest pitch value allowed */ +spx_word16_t pitch_coef, /* Voicing (pitch) coefficient */ +const void *par, +int nsf, /* Number of samples in subframe */ +int *pitch_val, +spx_word16_t *gain_val, +SpeexBits *bits, +char *stack, +int lost, +int subframe_offset, +spx_word16_t last_pitch_gain, +int cdbk_offset +); + +/** Forced pitch delay and gain */ +int forced_pitch_quant( +spx_sig_t target[], /* Target vector */ +spx_sig_t *sw, +spx_coef_t ak[], /* LPCs for this subframe */ +spx_coef_t awk1[], /* Weighted LPCs #1 for this subframe */ +spx_coef_t awk2[], /* Weighted LPCs #2 for this subframe */ +spx_sig_t exc[], /* Excitation */ +const void *par, +int start, /* Smallest pitch value allowed */ +int end, /* Largest pitch value allowed */ +spx_word16_t pitch_coef, /* Voicing (pitch) coefficient */ +int p, /* Number of LPC coeffs */ +int nsf, /* Number of samples in subframe */ +SpeexBits *bits, +char *stack, +spx_sig_t *exc2, +spx_word16_t *r, +int complexity, +int cdbk_offset, +int plc_tuning +); + +/** Unquantize forced pitch delay and gain */ +void forced_pitch_unquant( +spx_sig_t exc[], /* Excitation */ +int start, /* Smallest pitch value allowed */ +int end, /* Largest pitch value allowed */ +spx_word16_t pitch_coef, /* Voicing (pitch) coefficient */ +const void *par, +int nsf, /* Number of samples in subframe */ +int *pitch_val, +spx_word16_t *gain_val, +SpeexBits *bits, +char *stack, +int lost, +int subframe_offset, +spx_word16_t last_pitch_gain, +int cdbk_offset +); diff --git a/3rdparty/iaxclient-2/lib/libspeex/ltp_arm4.h b/3rdparty/iaxclient-2/lib/libspeex/ltp_arm4.h new file mode 100644 index 0000000..462ab95 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/ltp_arm4.h @@ -0,0 +1,183 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File: ltp.c + Lont-Term Prediction functions (SSE version) + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ +static spx_word32_t inner_prod(const spx_word16_t *x, const spx_word16_t *y, int len) +{ + spx_word32_t sum1=0,sum2=0; + spx_word16_t *deadx, *deady; + int deadlen, dead1, dead2, dead3, dead4, dead5, dead6; + __asm__ __volatile__ ( + "\tldrsh %5, [%0], #2 \n" + "\tldrsh %6, [%1], #2 \n" + ".inner_prod_loop%=:\n" + "\tsub %7, %7, %7\n" + "\tsub %10, %10, %10\n" + + "\tldrsh %8, [%0], #2 \n" + "\tldrsh %9, [%1], #2 \n" + "\tmla %7, %5, %6, %7\n" + "\tldrsh %5, [%0], #2 \n" + "\tldrsh %6, [%1], #2 \n" + "\tmla %10, %8, %9, %10\n" + "\tldrsh %8, [%0], #2 \n" + "\tldrsh %9, [%1], #2 \n" + "\tmla %7, %5, %6, %7\n" + "\tldrsh %5, [%0], #2 \n" + "\tldrsh %6, [%1], #2 \n" + "\tmla %10, %8, %9, %10\n" + + "\tldrsh %8, [%0], #2 \n" + "\tldrsh %9, [%1], #2 \n" + "\tmla %7, %5, %6, %7\n" + "\tldrsh %5, [%0], #2 \n" + "\tldrsh %6, [%1], #2 \n" + "\tmla %10, %8, %9, %10\n" + "\tldrsh %8, [%0], #2 \n" + "\tldrsh %9, [%1], #2 \n" + "\tmla %7, %5, %6, %7\n" + "\tldrsh %5, [%0], #2 \n" + "\tldrsh %6, [%1], #2 \n" + "\tmla %10, %8, %9, %10\n" + + "\tsubs %4, %4, #1\n" + "\tadd %2, %2, %7, asr #5\n" + "\tadd %3, %3, %10, asr #5\n" + "\tbne .inner_prod_loop%=\n" + : "=r" (deadx), "=r" (deady), "=r" (sum1), "=r" (sum2), "=r" (deadlen), + "=r" (dead1), "=r" (dead2), "=r" (dead3), "=r" (dead4), "=r" (dead5), "=r" (dead6) + : "0" (x), "1" (y), "2" (sum1), "3" (sum2), "4" (len>>3) + : "cc" + ); + return (sum1+sum2)>>1; +} + +static void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack) +{ + int i,j; + for (i=0;i + +static float inner_prod(const float *a, const float *b, int len) +{ + int i; + float ret; + __m128 sum = _mm_setzero_ps(); + for (i=0;i<(len>>2);i+=2) + { + sum = _mm_add_ps(sum, _mm_mul_ps(_mm_loadu_ps(a+0), _mm_loadu_ps(b+0))); + sum = _mm_add_ps(sum, _mm_mul_ps(_mm_loadu_ps(a+4), _mm_loadu_ps(b+4))); + a += 8; + b += 8; + } + sum = _mm_add_ps(sum, _mm_movehl_ps(sum, sum)); + sum = _mm_add_ss(sum, _mm_shuffle_ps(sum, sum, 0x55)); + _mm_store_ss(&ret, sum); + return ret; +} + +static void pitch_xcorr(const float *_x, const float *_y, float *corr, int len, int nb_pitch, char *stack) +{ + int i, offset; + VARDECL(__m128 *x); + VARDECL(__m128 *y); + int N, L; + N = len>>2; + L = nb_pitch>>2; + ALLOC(x, N, __m128); + ALLOC(y, N+L, __m128); + for (i=0;i16777216) + { + x>>=10; + k+=5; + } + if (x>1048576) + { + x>>=6; + k+=3; + } + if (x>262144) + { + x>>=4; + k+=2; + } + if (x>32768) + { + x>>=2; + k+=1; + } + if (x>16384) + { + x>>=2; + k+=1; + } +#else + while (x>16384) + { + x>>=2; + k++; + } +#endif + while (x<4096) + { + x<<=2; + k--; + } + rt = ADD16(C0, MULT16_16_Q14(x, ADD16(C1, MULT16_16_Q14(x, ADD16(C2, MULT16_16_Q14(x, (C3))))))); + if (k>0) + rt <<= k; + else + rt >>= -k; + rt >>=7; + return rt; +} + +/* log(x) ~= -2.18151 + 4.20592*x - 2.88938*x^2 + 0.86535*x^3 (for .5 < x < 1) */ + + +#define A1 16469 +#define A2 2242 +#define A3 1486 + +spx_word16_t spx_acos(spx_word16_t x) +{ + int s=0; + spx_word16_t ret; + spx_word16_t sq; + if (x<0) + { + s=1; + x = NEG16(x); + } + x = SUB16(16384,x); + + x = x >> 1; + sq = MULT16_16_Q13(x, ADD16(A1, MULT16_16_Q13(x, ADD16(A2, MULT16_16_Q13(x, (A3)))))); + ret = spx_sqrt(SHL32(EXTEND32(sq),13)); + + /*ret = spx_sqrt(67108864*(-1.6129e-04 + 2.0104e+00*f + 2.7373e-01*f*f + 1.8136e-01*f*f*f));*/ + if (s) + ret = SUB16(25736,ret); + return ret; +} + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/math_approx.h b/3rdparty/iaxclient-2/lib/libspeex/math_approx.h new file mode 100644 index 0000000..1c84f5c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/math_approx.h @@ -0,0 +1,46 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: math_approx.c + Various math approximation functions for Speex + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef MATH_APPROX_H +#define MATH_APPROX_H + +#include "misc.h" + +#ifdef FIXED_POINT +spx_word16_t spx_sqrt(spx_word32_t x); +spx_word16_t spx_acos(spx_word16_t x); +#else +#define spx_sqrt sqrt +#define spx_acos acos +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/mdf.c b/3rdparty/iaxclient-2/lib/libspeex/mdf.c new file mode 100644 index 0000000..7de5936 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/mdf.c @@ -0,0 +1,534 @@ +/* Copyright (C) Jean-Marc Valin + + File: speex_echo.c + Echo cancelling based on the MDF algorithm described in: + + J. S. Soo, K. K. Pang Multidelay block frequency adaptive filter, + IEEE Trans. Acoust. Speech Signal Process., Vol. ASSP-38, No. 2, + February 1990. + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#ifdef _MSC_VER +#include "winpoop.h" +#endif +#include "misc.h" +#include "speex/speex_echo.h" +#include "smallft.h" +#include + +#ifndef M_PI +#define M_PI 3.14159265358979323846 +#endif + +#define BETA .65 + +#ifndef min +#define min(a,b) ((a)<(b) ? (a) : (b)) +#define max(a,b) ((a)>(b) ? (a) : (b)) +#endif + +/** Compute inner product of two real vectors */ +static inline float inner_prod(float *x, float *y, int N) +{ + int i; + float ret=0; + for (i=0;iframe_size = frame_size; + st->window_size = 2*frame_size; + N = st->window_size; + M = st->M = (filter_length+st->frame_size-1)/frame_size; + st->cancel_count=0; + st->adapt_rate = .01f; + st->sum_adapt = 0; + st->Sey = 0; + st->Syy = 0; + st->See = 0; + + st->fft_lookup = (struct drft_lookup*)speex_alloc(sizeof(struct drft_lookup)); + spx_drft_init(st->fft_lookup, N); + + st->x = (float*)speex_alloc(N*sizeof(float)); + st->d = (float*)speex_alloc(N*sizeof(float)); + st->y = (float*)speex_alloc(N*sizeof(float)); + st->y2 = (float*)speex_alloc(N*sizeof(float)); + st->Yps = (float*)speex_alloc(N*sizeof(float)); + st->last_y = (float*)speex_alloc(N*sizeof(float)); + st->Yf = (float*)speex_alloc((st->frame_size+1)*sizeof(float)); + st->Rf = (float*)speex_alloc((st->frame_size+1)*sizeof(float)); + st->Xf = (float*)speex_alloc((st->frame_size+1)*sizeof(float)); + st->fratio = (float*)speex_alloc((st->frame_size+1)*sizeof(float)); + st->regul = (float*)speex_alloc(N*sizeof(float)); + + st->X = (float*)speex_alloc(M*N*sizeof(float)); + st->D = (float*)speex_alloc(N*sizeof(float)); + st->Y = (float*)speex_alloc(N*sizeof(float)); + st->Y2 = (float*)speex_alloc(N*sizeof(float)); + st->E = (float*)speex_alloc(N*sizeof(float)); + st->W = (float*)speex_alloc(M*N*sizeof(float)); + st->PHI = (float*)speex_alloc(M*N*sizeof(float)); + st->power = (float*)speex_alloc((frame_size+1)*sizeof(float)); + st->power_1 = (float*)speex_alloc((frame_size+1)*sizeof(float)); + st->grad = (float*)speex_alloc(N*M*sizeof(float)); + + for (i=0;iW[i] = st->PHI[i] = 0; + } + + st->regul[0] = (.01+(10.)/((4.)*(4.)))/M; + for (i=1,j=1;iregul[i] = .01+((10.)/((j+4.)*(j+4.)))/M; + st->regul[i+1] = .01+((10.)/((j+4.)*(j+4.)))/M; + } + st->regul[i] = .01+((10.)/((j+4.)*(j+4.)))/M; + + st->adapted = 0; + return st; +} + +/** Resets echo canceller state */ +void speex_echo_state_reset(SpeexEchoState *st) +{ + int i, M, N; + st->cancel_count=0; + st->adapt_rate = .01f; + N = st->window_size; + M = st->M; + for (i=0;iW[i] = 0; + st->X[i] = 0; + } + for (i=0;i<=st->frame_size;i++) + st->power[i] = 0; + + st->adapted = 0; + st->adapt_rate = .01f; + st->sum_adapt = 0; + st->Sey = 0; + st->Syy = 0; + st->See = 0; + +} + +/** Destroys an echo canceller state */ +void speex_echo_state_destroy(SpeexEchoState *st) +{ + spx_drft_clear(st->fft_lookup); + speex_free(st->fft_lookup); + speex_free(st->x); + speex_free(st->d); + speex_free(st->y); + speex_free(st->last_y); + speex_free(st->Yps); + speex_free(st->Yf); + speex_free(st->Rf); + speex_free(st->Xf); + speex_free(st->fratio); + speex_free(st->regul); + + speex_free(st->X); + speex_free(st->D); + speex_free(st->Y); + speex_free(st->E); + speex_free(st->W); + speex_free(st->PHI); + speex_free(st->power); + speex_free(st->power_1); + speex_free(st->grad); + + speex_free(st); +} + + +/** Performs echo cancellation on a frame */ +void speex_echo_cancel(SpeexEchoState *st, short *ref, short *echo, short *out, float *Yout) +{ + int i,j,m; + int N,M; + float scale; + float ESR; + float SER; + //float Sry=0 + float Srr=0,Syy=0,Sey=0,See=0,Sxx=0; + float leak_estimate; + + leak_estimate = .1+(.9/(1+2*st->sum_adapt)); + + N = st->window_size; + M = st->M; + scale = 1.0f/N; + st->cancel_count++; + + /* Copy input data to buffer */ + for (i=0;iframe_size;i++) + { + st->x[i] = st->x[i+st->frame_size]; + st->x[i+st->frame_size] = echo[i]; + + st->d[i] = st->d[i+st->frame_size]; + st->d[i+st->frame_size] = ref[i]; + } + + /* Shift memory: this could be optimized eventually*/ + for (i=0;iX[i]=st->X[i+N]; + + /* Copy new echo frame */ + for (i=0;iX[(M-1)*N+i]=st->x[i]; + + /* Convert x (echo input) to frequency domain */ + spx_drft_forward(st->fft_lookup, &st->X[(M-1)*N]); + + /* Compute filter response Y */ + for (i=0;iY[i] = 0; + for (j=0;jX[j*N], &st->W[j*N], st->Y, N); + + /* Convert Y (filter response) to time domain */ + for (i=0;iy[i] = st->Y[i]; + spx_drft_backward(st->fft_lookup, st->y); + for (i=0;iy[i] *= scale; + + /* Transform d (reference signal) to frequency domain */ + for (i=0;iD[i]=st->d[i]; + spx_drft_forward(st->fft_lookup, st->D); + + /* Compute error signal (signal with echo removed) */ + for (i=0;iframe_size;i++) + { + float tmp_out; + tmp_out = (float)ref[i] - st->y[i+st->frame_size]; + + st->E[i] = 0; + st->E[i+st->frame_size] = tmp_out; + + /* Saturation */ + if (tmp_out>32767) + tmp_out = 32767; + else if (tmp_out<-32768) + tmp_out = -32768; + out[i] = tmp_out; + } + + /* This bit of code provides faster adaptation by doing a projection of the previous gradient on the + "MMSE surface" */ + if (1) + { + float Sge, Sgg, Syy; + float gain; + Syy = inner_prod(st->y+st->frame_size, st->y+st->frame_size, st->frame_size); + for (i=0;iY2[i] = 0; + for (j=0;jX[j*N], &st->PHI[j*N], st->Y2, N); + for (i=0;iy2[i] = st->Y2[i]; + spx_drft_backward(st->fft_lookup, st->y2); + for (i=0;iy2[i] *= scale; + Sge = inner_prod(st->y2+st->frame_size, st->E+st->frame_size, st->frame_size); + Sgg = inner_prod(st->y2+st->frame_size, st->y2+st->frame_size, st->frame_size); + /* Compute projection gain */ + gain = Sge/(N+.03*Syy+Sgg); + if (gain>2) + gain = 2; + if (gain < -2) + gain = -2; + + /* Apply gain to weights, echo estimates, output */ + for (i=0;iY[i] += gain*st->Y2[i]; + for (i=0;iframe_size;i++) + { + st->y[i+st->frame_size] += gain*st->y2[i+st->frame_size]; + st->E[i+st->frame_size] -= gain*st->y2[i+st->frame_size]; + } + for (i=0;iW[i] += gain*st->PHI[i]; + } + + /* Compute power spectrum of output (D-Y) and filter response (Y) */ + for (i=0;iD[i] -= st->Y[i]; + power_spectrum(st->D, st->Rf, N); + power_spectrum(st->Y, st->Yf, N); + + /* Compute frequency-domain adaptation mask */ + for (j=0;j<=st->frame_size;j++) + { + float r; + r = leak_estimate*st->Yf[j] / (1+st->Rf[j]); + if (r>1) + r = 1; + st->fratio[j] = r; + } + + /* Compute a bunch of correlations */ + //Sry = inner_prod(st->y+st->frame_size, st->d+st->frame_size, st->frame_size); + Sey = inner_prod(st->y+st->frame_size, st->E+st->frame_size, st->frame_size); + See = inner_prod(st->E+st->frame_size, st->E+st->frame_size, st->frame_size); + Syy = inner_prod(st->y+st->frame_size, st->y+st->frame_size, st->frame_size); + Srr = inner_prod(st->d+st->frame_size, st->d+st->frame_size, st->frame_size); + Sxx = inner_prod(st->x+st->frame_size, st->x+st->frame_size, st->frame_size); + + /* Compute smoothed cross-correlation and energy */ + st->Sey = .98*st->Sey + .02*Sey; + st->Syy = .98*st->Syy + .02*Syy; + st->See = .98*st->See + .02*See; + + /* Check if filter is completely mis-adapted (if so, reset filter) */ + if (st->Sey/(1+st->Syy + .01*st->See) < -1) + { + /*fprintf (stderr, "reset at %d\n", st->cancel_count);*/ + speex_echo_state_reset(st); + return; + } + + SER = Srr / (1+Sxx); + ESR = leak_estimate*Syy / (1+See); + if (ESR>1) + ESR = 1; +#if 1 + /* If over-cancellation (creating echo with 180 phase) damp filter */ + if (st->Sey/(1+st->Syy) < -.1 && (ESR > .3)) + { + for (i=0;iW[i] *= .95; + st->Sey *= .5; + /*fprintf (stderr, "corrected down\n");*/ + } +#endif +#if 1 + /* If under-cancellation (leaving echo with 0 phase) scale filter up */ + if (st->Sey/(1+st->Syy) > .1 && (ESR > .1 || SER < 10)) + { + for (i=0;iW[i] *= 1.05; + st->Sey *= .5; + /*fprintf (stderr, "corrected up %d\n", st->cancel_count);*/ + } +#endif + + /* We consider that the filter is adapted if the following is true*/ + if (ESR>.6 && st->sum_adapt > 1) + { + /*if (!st->adapted) + fprintf(stderr, "Adapted at %d %f\n", st->cancel_count, st->sum_adapt);*/ + st->adapted = 1; + } + + /* Update frequency-dependent energy ratio with the total energy ratio */ + for (i=0;i<=st->frame_size;i++) + { + st->fratio[i] = (.2*ESR+.8*min(.005+ESR,st->fratio[i])); + } + + if (st->adapted) + { + st->adapt_rate = .95f/(2+M); + } else { + /* Temporary adaption rate if filter is not adapted correctly */ + if (SER<.1) + st->adapt_rate =.8/(2+M); + else if (SER<1) + st->adapt_rate =.4/(2+M); + else if (SER<10) + st->adapt_rate =.2/(2+M); + else if (SER<30) + st->adapt_rate =.08/(2+M); + else + st->adapt_rate = 0; + } + + /* How much have we adapted so far? */ + st->sum_adapt += st->adapt_rate; + + /* Compute echo power in each frequency bin */ + { + float ss = 1.0f/st->cancel_count; + if (ss < .3/M) + ss=.3/M; + power_spectrum(&st->X[(M-1)*N], st->Xf, N); + /* Smooth echo energy estimate over time */ + for (j=0;j<=st->frame_size;j++) + st->power[j] = (1-ss)*st->power[j] + ss*st->Xf[j]; + + + /* Combine adaptation rate to the the inverse energy estimate */ + if (st->adapted) + { + /* If filter is adapted, include the frequency-dependent ratio too */ + for (i=0;i<=st->frame_size;i++) + st->power_1[i] = st->adapt_rate*st->fratio[i] /(1.f+st->power[i]); + } else { + for (i=0;i<=st->frame_size;i++) + st->power_1[i] = st->adapt_rate/(1.f+st->power[i]); + } + } + + + /* Convert error to frequency domain */ + spx_drft_forward(st->fft_lookup, st->E); + + /* Do some regularization (prevents problems when system is ill-conditoned) */ + for (m=0;mW[m*N+i] *= 1-st->regul[i]*ESR; + + /* Compute weight gradient */ + for (j=0;jpower_1, &st->X[j*N], st->E, st->PHI+N*j, N); + } + + /* Gradient descent */ + for (i=0;iW[i] += st->PHI[i]; + + /* AUMDF weight constraint */ + for (j=0;jcancel_count%M == j) + { + spx_drft_backward(st->fft_lookup, &st->W[j*N]); + for (i=0;iW[j*N+i]*=scale; + for (i=st->frame_size;iW[j*N+i]=0; + } + spx_drft_forward(st->fft_lookup, &st->W[j*N]); + } + } + + /* Compute spectrum of estimated echo for use in an echo post-filter (if necessary)*/ + if (Yout) + { + if (st->adapted) + { + /* If the filter is adapted, take the filtered echo */ + for (i=0;iframe_size;i++) + st->last_y[i] = st->last_y[st->frame_size+i]; + for (i=0;iframe_size;i++) + st->last_y[st->frame_size+i] = st->y[st->frame_size+i]; + } else { + /* If filter isn't adapted yet, all we can do is take the echo signal directly */ + for (i=0;ilast_y[i] = st->x[i]; + } + + /* Apply hanning window (should pre-compute it)*/ + for (i=0;iYps[i] = (.5-.5*cos(2*M_PI*i/N))*st->last_y[i]; + + /* Compute power spectrum of the echo */ + spx_drft_forward(st->fft_lookup, st->Yps); + power_spectrum(st->Yps, st->Yps, N); + + /* Estimate residual echo */ + for (i=0;i<=st->frame_size;i++) + Yout[i] = 2*leak_estimate*st->Yps[i]; + } + +} + diff --git a/3rdparty/iaxclient-2/lib/libspeex/medfilter.c b/3rdparty/iaxclient-2/lib/libspeex/medfilter.c new file mode 100644 index 0000000..b562b3c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/medfilter.c @@ -0,0 +1,97 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File medfilter.c + Median filter + + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#include "medfilter.h" +#include "misc.h" + +MedianFilter *median_filter_new(int N) +{ + MedianFilter *f = speex_alloc(sizeof(MedianFilter)); + f->N = N; + f->ids = speex_alloc(sizeof(int)*N); + f->val = speex_alloc(sizeof(float)*N); + f->filled = 0; + return f; +} + +void median_filter_update(MedianFilter *f, float val) +{ + int i=0; + int insert = 0; + while (insertfilled && f->val[insert] < val) + { + insert++; + } + if (f->filled == f->N) + { + int remove; + for (remove=0;removeN;remove++) + if (f->ids[remove] == 0) + break; + if (insert>remove) + insert--; + if (insert > remove) + { + for (i=remove;ival[i] = f->val[i+1]; + f->ids[i] = f->ids[i+1]; + } + } else if (insert < remove) + { + for (i=remove;i>insert;i--) + { + f->val[i] = f->val[i-1]; + f->ids[i] = f->ids[i-1]; + } + } + for (i=0;ifilled;i++) + f->ids[i]--; + } else { + for (i=f->filled;i>insert;i--) + { + f->val[i] = f->val[i-1]; + f->ids[i] = f->ids[i-1]; + } + f->filled++; + } + f->val[insert]=val; + f->ids[insert]=f->filled-1; +} + +float median_filter_get(MedianFilter *f) +{ + return f->val[f->filled>>1]; +} + diff --git a/3rdparty/iaxclient-2/lib/libspeex/medfilter.h b/3rdparty/iaxclient-2/lib/libspeex/medfilter.h new file mode 100644 index 0000000..e34065b --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/medfilter.h @@ -0,0 +1,49 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File medfilter.h + Median filter + + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef MEDFILTER_H +#define MEDFILTER_H + +typedef struct { + int N; + int filled; + int *ids; + float *val; +} MedianFilter; + +MedianFilter *median_filter_new(int N); +void median_filter_update(MedianFilter *f, float val); +float median_filter_get(MedianFilter *f); + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/misc.c b/3rdparty/iaxclient-2/lib/libspeex/misc.c new file mode 100644 index 0000000..01c9495 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/misc.c @@ -0,0 +1,178 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: mics.c + Various utility routines for Speex + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "misc.h" +#include +#include +#include + +#ifndef RELEASE +void print_vec(float *vec, int len, char *name) +{ + int i; + printf ("%s ", name); + for (i=0;i>24; + ret += (i>>8)&0x0000ff00; + ret += (i<<8)&0x00ff0000; + ret += (i<<24); +#endif + return ret; +} + +spx_uint32_t le_int(spx_uint32_t i) +{ + spx_uint32_t ret=i; +#ifdef WORDS_BIGENDIAN + ret = i>>24; + ret += (i>>8)&0x0000ff00; + ret += (i<<8)&0x00ff0000; + ret += (i<<24); +#endif + return ret; +} + +#if BYTES_PER_CHAR == 2 +void speex_memcpy_bytes(char *dst, char *src, int nbytes) +{ + int i; + int nchars = nbytes/BYTES_PER_CHAR; + for (i=0;i + +#ifndef NULL +#define NULL 0 +#endif + +#define MAX_IN_SAMPLES 640 + +const SpeexMode * const speex_mode_list[SPEEX_NB_MODES] = {&speex_nb_mode, &speex_wb_mode, &speex_uwb_mode}; + +/* Extern declarations for all codebooks we use here */ +extern const signed char gain_cdbk_nb[]; +extern const signed char gain_cdbk_lbr[]; +extern const signed char hexc_table[]; +extern const signed char exc_5_256_table[]; +extern const signed char exc_5_64_table[]; +extern const signed char exc_8_128_table[]; +extern const signed char exc_10_32_table[]; +extern const signed char exc_10_16_table[]; +extern const signed char exc_20_32_table[]; +extern const signed char hexc_10_32_table[]; + + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params ltp_params_nb = { + gain_cdbk_nb, + 7, + 7 +}; + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params ltp_params_vlbr = { + gain_cdbk_lbr, + 5, + 0 +}; + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params ltp_params_lbr = { + gain_cdbk_lbr, + 5, + 7 +}; + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params ltp_params_med = { + gain_cdbk_lbr, + 5, + 7 +}; + +/* Split-VQ innovation parameters for very low bit-rate narrowband */ +static const split_cb_params split_cb_nb_vlbr = { + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + exc_10_16_table, /*shape_cb*/ + 4, /*shape_bits*/ + 0, +}; + +/* Split-VQ innovation parameters for very low bit-rate narrowband */ +static const split_cb_params split_cb_nb_ulbr = { + 20, /*subvect_size*/ + 2, /*nb_subvect*/ + exc_20_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0, +}; + +/* Split-VQ innovation parameters for low bit-rate narrowband */ +static const split_cb_params split_cb_nb_lbr = { + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + exc_10_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0, +}; + + +/* Split-VQ innovation parameters narrowband */ +static const split_cb_params split_cb_nb = { + 5, /*subvect_size*/ + 8, /*nb_subvect*/ + exc_5_64_table, /*shape_cb*/ + 6, /*shape_bits*/ + 0, +}; + +/* Split-VQ innovation parameters narrowband */ +static const split_cb_params split_cb_nb_med = { + 8, /*subvect_size*/ + 5, /*nb_subvect*/ + exc_8_128_table, /*shape_cb*/ + 7, /*shape_bits*/ + 0, +}; + +/* Split-VQ innovation for low-band wideband */ +static const split_cb_params split_cb_sb = { + 5, /*subvect_size*/ + 8, /*nb_subvect*/ + exc_5_256_table, /*shape_cb*/ + 8, /*shape_bits*/ + 0, +}; + +#ifndef DISABLE_WIDEBAND + +/* Split-VQ innovation for high-band wideband */ +static const split_cb_params split_cb_high = { + 8, /*subvect_size*/ + 5, /*nb_subvect*/ + hexc_table, /*shape_cb*/ + 7, /*shape_bits*/ + 1, +}; + + +/* Split-VQ innovation for high-band wideband */ +static const split_cb_params split_cb_high_lbr = { + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + hexc_10_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0, +}; + +#endif + +/* 2150 bps "vocoder-like" mode for comfort noise */ +static const SpeexSubmode nb_submode1 = { + 0, + 1, + 0, + 0, + /* LSP quantization */ + lsp_quant_lbr, + lsp_unquant_lbr, + /* No pitch quantization */ + forced_pitch_quant, + forced_pitch_unquant, + NULL, + /* No innovation quantization (noise only) */ + noise_codebook_quant, + noise_codebook_unquant, + NULL, +#ifdef FIXED_POINT + 22938, 22938, 0, -1, +#else + .7, .7, 0, -1, +#endif + 43 +}; + +/* 3.95 kbps very low bit-rate mode */ +static const SpeexSubmode nb_submode8 = { + 0, + 1, + 0, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*No pitch quantization*/ + forced_pitch_quant, + forced_pitch_unquant, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb_ulbr, +#ifdef FIXED_POINT + 22938, 16384, 11796, 21299, +#else + 0.7, 0.5, .36, .65, +#endif + 79 +}; + +/* 5.95 kbps very low bit-rate mode */ +static const SpeexSubmode nb_submode2 = { + 0, + 0, + 0, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*No pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_vlbr, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb_vlbr, +#ifdef FIXED_POINT + 22938, 16384, 11796, 18022, +#else + 0.7, 0.5, .36, .55, +#endif + 119 +}; + +/* 8 kbps low bit-rate mode */ +static const SpeexSubmode nb_submode3 = { + -1, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_lbr, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb_lbr, +#ifdef FIXED_POINT + 22938, 18022, 9830, 14746, +#else + 0.7, 0.55, .30, .45, +#endif + 160 +}; + +/* 11 kbps medium bit-rate mode */ +static const SpeexSubmode nb_submode4 = { + -1, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_med, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb_med, +#ifdef FIXED_POINT + 22938, 20644, 5243, 11469, +#else + 0.7, 0.63, .16, .35, +#endif + 220 +}; + +/* 15 kbps high bit-rate mode */ +static const SpeexSubmode nb_submode5 = { + -1, + 0, + 3, + 0, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_nb, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb, +#ifdef FIXED_POINT + 22938, 21299, 3932, 8192, +#else + 0.7, 0.65, .12, .25, +#endif + 300 +}; + +/* 18.2 high bit-rate mode */ +static const SpeexSubmode nb_submode6 = { + -1, + 0, + 3, + 0, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_nb, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_sb, +#ifdef FIXED_POINT + 22282, 21299, 2294, 3277, +#else + 0.68, 0.65, .07, .1, +#endif + 364 +}; + +/* 24.6 kbps high bit-rate mode */ +static const SpeexSubmode nb_submode7 = { + -1, + 0, + 3, + 1, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_nb, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb, +#ifdef FIXED_POINT + 21299, 21299, 0, -1, +#else + 0.65, 0.65, .0, -1, +#endif + 492 +}; + + +/* Default mode for narrowband */ +static const SpeexNBMode nb_mode = { + 160, /*frameSize*/ + 40, /*subframeSize*/ + 10, /*lpcSize*/ + 17, /*pitchStart*/ + 144, /*pitchEnd*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .012, /*lag_factor*/ + 1.0002, /*lpc_floor*/ +#ifdef EPIC_48K + 0, +#endif + {NULL, &nb_submode1, &nb_submode2, &nb_submode3, &nb_submode4, &nb_submode5, &nb_submode6, &nb_submode7, + &nb_submode8, NULL, NULL, NULL, NULL, NULL, NULL, NULL}, + 5, + {1, 8, 2, 3, 3, 4, 4, 5, 5, 6, 7} +}; + + +/* Default mode for narrowband */ +const SpeexMode speex_nb_mode = { + &nb_mode, + nb_mode_query, + "narrowband", + 0, + 4, + &nb_encoder_init, + &nb_encoder_destroy, + &nb_encode, + &nb_decoder_init, + &nb_decoder_destroy, + &nb_decode, + &nb_encoder_ctl, + &nb_decoder_ctl, +}; + + +/* Wideband part */ + +static const SpeexSubmode wb_submode1 = { + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*No innovation quantization*/ + NULL, + NULL, + NULL, +#ifdef FIXED_POINT + 24576, 24576, 0, -1, +#else + .75, .75, .0, -1, +#endif + 36 +}; + + +static const SpeexSubmode wb_submode2 = { + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, +#ifdef DISABLE_WIDEBAND + NULL, +#else + &split_cb_high_lbr, +#endif +#ifdef FIXED_POINT + 27853, 19661, 8192, -1, +#else + .85, .6, .25, -1, +#endif + 112 +}; + + +static const SpeexSubmode wb_submode3 = { + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, +#ifdef DISABLE_WIDEBAND + NULL, +#else + &split_cb_high, +#endif + +#ifdef FIXED_POINT + 24576, 22938, 1638, -1, +#else + .75, .7, .05, -1, +#endif + 192 +}; + +static const SpeexSubmode wb_submode4 = { + 0, + 0, + 1, + 1, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, +#ifdef DISABLE_WIDEBAND + NULL, +#else + &split_cb_high, +#endif +#ifdef FIXED_POINT + 24576, 24576, 0, -1, +#else + .75, .75, .0, -1, +#endif + 352 +}; + + +/* Split-band wideband CELP mode*/ +static const SpeexSBMode sb_wb_mode = { + &speex_nb_mode, + 160, /*frameSize*/ + 40, /*subframeSize*/ + 8, /*lpcSize*/ + 640, /*bufSize*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .001, /*lag_factor*/ + 1.0001, /*lpc_floor*/ + 0.9, + {NULL, &wb_submode1, &wb_submode2, &wb_submode3, &wb_submode4, NULL, NULL, NULL}, + 3, + {1, 8, 2, 3, 4, 5, 5, 6, 6, 7, 7}, + {1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4}, + vbr_hb_thresh, + 5 +}; + + +const SpeexMode speex_wb_mode = { + &sb_wb_mode, + wb_mode_query, + "wideband (sub-band CELP)", + 1, + 4, + &sb_encoder_init, + &sb_encoder_destroy, + &sb_encode, + &sb_decoder_init, + &sb_decoder_destroy, + &sb_decode, + &sb_encoder_ctl, + &sb_decoder_ctl, +}; + + + +/* "Ultra-wideband" mode stuff */ + + + +/* Split-band "ultra-wideband" (32 kbps) CELP mode*/ +static const SpeexSBMode sb_uwb_mode = { + &speex_wb_mode, + 320, /*frameSize*/ + 80, /*subframeSize*/ + 8, /*lpcSize*/ + 1280, /*bufSize*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .002, /*lag_factor*/ + 1.0001, /*lpc_floor*/ + 0.7, + {NULL, &wb_submode1, NULL, NULL, NULL, NULL, NULL, NULL}, + 1, + {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, + {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, + vbr_uhb_thresh, + 2 +}; + + +const SpeexMode speex_uwb_mode = { + &sb_uwb_mode, + wb_mode_query, + "ultra-wideband (sub-band CELP)", + 2, + 4, + &sb_encoder_init, + &sb_encoder_destroy, + &sb_encode, + &sb_decoder_init, + &sb_decoder_destroy, + &sb_decode, + &sb_encoder_ctl, + &sb_decoder_ctl, +}; + + + + +#ifdef EPIC_48K + +extern const signed char gain_cdbk_ulbr[]; +extern const signed char exc_12_32_table[]; + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params ltp_params_48k = { + gain_cdbk_ulbr, + 3, + 0 +}; + +static const split_cb_params split_cb_nb_48k = { + 12, /*subvect_size*/ + 4, /*nb_subvect*/ + exc_12_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0, +}; + + +/* 4.8 kbps very low bit-rate mode */ +static const SpeexSubmode nb_48k_submode = { + 0, + 0, + 0, + 0, + /*LSP quantization*/ + lsp_quant_48k, + lsp_unquant_48k, + /*No pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + <p_params_48k, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + &split_cb_nb_48k, +#ifdef FIXED_POINT + 22938, 16384, 11796, 18022, +#else + 0.7, 0.5, .36, .55, +#endif + 144 +}; + + +/* Special, non-standard 4.8 kbps mode */ +static const SpeexNBMode nb_48k_mode = { + 240, /*frameSize*/ + 48, /*subframeSize*/ + 10, /*lpcSize*/ + 640, /*bufSize*/ + 17, /*pitchStart*/ + 144, /*pitchEnd*/ + 0.9, /*gamma1*/ + 0.6, /*gamma2*/ + .01, /*lag_factor*/ + 1.0003, /*lpc_floor*/ + 1, + {NULL, NULL, &nb_48k_submode, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL}, + 2, + {2,2,2,2,2,2,2,2,2,2,2} +}; + + +/* Default mode for narrowband */ +const SpeexMode speex_nb_48k_mode = { + &nb_48k_mode, + nb_mode_query, + "narrowband 4.8 kbps", + 1000, + 4, + &nb_encoder_init, + &nb_encoder_destroy, + &nb_encode, + &nb_decoder_init, + &nb_decoder_destroy, + &nb_decode, + &nb_encoder_ctl, + &nb_decoder_ctl, +}; + + +#endif + +int speex_mode_query(const SpeexMode *mode, int request, void *ptr) +{ + return mode->query(mode->mode, request, ptr); +} + +const SpeexMode * speex_lib_get_mode (int mode) +{ +#ifdef EPIC_48K + if (mode == SPEEX_MODEID_NB_48K) return &speex_nb_48k_mode; +#endif + + if (mode < 0 || mode > SPEEX_NB_MODES) return NULL; + + return speex_mode_list[mode]; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/modes.h b/3rdparty/iaxclient-2/lib/libspeex/modes.h new file mode 100644 index 0000000..e1c9468 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/modes.h @@ -0,0 +1,153 @@ +/* Copyright (C) 2002 Jean-Marc Valin */ +/** + @file modes.h + @brief Describes the different modes of the codec +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef MODES_H +#define MODES_H + +#include +#include +#include "misc.h" + +#define NB_SUBMODES 16 +#define NB_SUBMODE_BITS 4 + +#define SB_SUBMODES 8 +#define SB_SUBMODE_BITS 3 + + +/** Quantizes LSPs */ +typedef void (*lsp_quant_func)(spx_lsp_t *, spx_lsp_t *, int, SpeexBits *); + +/** Decodes quantized LSPs */ +typedef void (*lsp_unquant_func)(spx_lsp_t *, int, SpeexBits *); + + +/** Long-term predictor quantization */ +typedef int (*ltp_quant_func)(spx_sig_t *, spx_sig_t *, spx_coef_t *, spx_coef_t *, + spx_coef_t *, spx_sig_t *, const void *, int, int, spx_word16_t, + int, int, SpeexBits*, char *, spx_sig_t *, spx_word16_t *, int, int, int); + +/** Long-term un-quantize */ +typedef void (*ltp_unquant_func)(spx_sig_t *, int, int, spx_word16_t, const void *, int, int *, + spx_word16_t *, SpeexBits*, char*, int, int, spx_word16_t, int); + + +/** Innovation quantization function */ +typedef void (*innovation_quant_func)(spx_sig_t *, spx_coef_t *, spx_coef_t *, spx_coef_t *, const void *, int, int, + spx_sig_t *, spx_word16_t *, SpeexBits *, char *, int, int); + +/** Innovation unquantization function */ +typedef void (*innovation_unquant_func)(spx_sig_t *, const void *, int, SpeexBits*, char *); + +/** Description of a Speex sub-mode (wither narrowband or wideband */ +typedef struct SpeexSubmode { + int lbr_pitch; /**< Set to -1 for "normal" modes, otherwise encode pitch using a global pitch and allowing a +- lbr_pitch variation (for low not-rates)*/ + int forced_pitch_gain; /**< Use the same (forced) pitch gain for all sub-frames */ + int have_subframe_gain; /**< Number of bits to use as sub-frame innovation gain */ + int double_codebook; /**< Apply innovation quantization twice for higher quality (and higher bit-rate)*/ + /*LSP functions*/ + lsp_quant_func lsp_quant; /**< LSP quantization function */ + lsp_unquant_func lsp_unquant; /**< LSP unquantization function */ + + /*Lont-term predictor functions*/ + ltp_quant_func ltp_quant; /**< Long-term predictor (pitch) quantizer */ + ltp_unquant_func ltp_unquant; /**< Long-term predictor (pitch) un-quantizer */ + const void *ltp_params; /**< Pitch parameters (options) */ + + /*Quantization of innovation*/ + innovation_quant_func innovation_quant; /**< Innovation quantization */ + innovation_unquant_func innovation_unquant; /**< Innovation un-quantization */ + const void *innovation_params; /**< Innovation quantization parameters*/ + + /*Synthesis filter enhancement*/ + spx_word16_t lpc_enh_k1; /**< Enhancer constant */ + spx_word16_t lpc_enh_k2; /**< Enhancer constant */ + spx_word16_t lpc_enh_k3; /**< Enhancer constant */ + spx_word16_t comb_gain; /**< Gain of enhancer comb filter */ + + int bits_per_frame; /**< Number of bits per frame after encoding*/ +} SpeexSubmode; + +/** Struct defining the encoding/decoding mode*/ +typedef struct SpeexNBMode { + int frameSize; /**< Size of frames used for encoding */ + int subframeSize; /**< Size of sub-frames used for encoding */ + int lpcSize; /**< Order of LPC filter */ + int pitchStart; /**< Smallest pitch value allowed */ + int pitchEnd; /**< Largest pitch value allowed */ + + spx_word16_t gamma1; /**< Perceptual filter parameter #1 */ + spx_word16_t gamma2; /**< Perceptual filter parameter #2 */ + float lag_factor; /**< Lag-windowing parameter */ + float lpc_floor; /**< Noise floor for LPC analysis */ + +#ifdef EPIC_48K + int lbr48k; /**< 1 for the special 4.8 kbps mode */ +#endif + + const SpeexSubmode *submodes[NB_SUBMODES]; /**< Sub-mode data for the mode */ + int defaultSubmode; /**< Default sub-mode to use when encoding */ + int quality_map[11]; /**< Mode corresponding to each quality setting */ +} SpeexNBMode; + + +/** Struct defining the encoding/decoding mode for SB-CELP (wideband) */ +typedef struct SpeexSBMode { + const SpeexMode *nb_mode; /**< Embedded narrowband mode */ + int frameSize; /**< Size of frames used for encoding */ + int subframeSize; /**< Size of sub-frames used for encoding */ + int lpcSize; /**< Order of LPC filter */ + int bufSize; /**< Signal buffer size in encoder */ + spx_word16_t gamma1; /**< Perceptual filter parameter #1 */ + spx_word16_t gamma2; /**< Perceptual filter parameter #1 */ + float lag_factor; /**< Lag-windowing parameter */ + float lpc_floor; /**< Noise floor for LPC analysis */ + float folding_gain; + + const SpeexSubmode *submodes[SB_SUBMODES]; /**< Sub-mode data for the mode */ + int defaultSubmode; /**< Default sub-mode to use when encoding */ + int low_quality_map[11]; /**< Mode corresponding to each quality setting */ + int quality_map[11]; /**< Mode corresponding to each quality setting */ + const float (*vbr_thresh)[11]; + int nb_modes; +} SpeexSBMode; + +int speex_encode_native(void *state, spx_word16_t *in, SpeexBits *bits); +int speex_decode_native(void *state, SpeexBits *bits, spx_word16_t *out); + +int nb_mode_query(const void *mode, int request, void *ptr); +int wb_mode_query(const void *mode, int request, void *ptr); + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/modes_noglobals.c b/3rdparty/iaxclient-2/lib/libspeex/modes_noglobals.c new file mode 100644 index 0000000..2126af1 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/modes_noglobals.c @@ -0,0 +1,1145 @@ +/* Copyright (C) 2004 CSIRO Australia + File: modes_noglobals.c + + Hacked by Conrad Parker, based on modes.c: + Copyright (C) 2002 Jean-Marc Valin + + Describes the different modes of the codec. This file differs from + modes.c in that SpeexMode structures are dynamically allocated, + rather than being statically defined. This introduces some minor + API changes which are described in the file README.symbian in the + top level of the Speex source distribution. + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "modes.h" +#include "ltp.h" +#include "quant_lsp.h" +#include "cb_search.h" +#include "sb_celp.h" +#include "nb_celp.h" +#include "vbr.h" +#include "misc.h" +#include +#include + +#ifndef NULL +#define NULL 0 +#endif + +/* Extern declarations for all codebooks we use here */ +extern const signed char gain_cdbk_nb[]; +extern const signed char gain_cdbk_lbr[]; +extern const signed char hexc_table[]; +extern const signed char exc_5_256_table[]; +extern const signed char exc_5_64_table[]; +extern const signed char exc_8_128_table[]; +extern const signed char exc_10_32_table[]; +extern const signed char exc_10_16_table[]; +extern const signed char exc_20_32_table[]; +extern const signed char hexc_10_32_table[]; + +static const ltp_params * +speex_ltp_params_new (const signed char * gain_cdbk, int gain_bits, + int pitch_bits) +{ + ltp_params * params; + + params = (ltp_params *) speex_alloc (sizeof (ltp_params)); + if (params == NULL) return NULL; + + params->gain_cdbk = gain_cdbk; + params->gain_bits = gain_bits; + params->pitch_bits = pitch_bits; + + return params; +} + +static void +speex_ltp_params_free (const ltp_params * params) +{ + speex_free ((void *)params); +} + +static const split_cb_params * +speex_split_cb_params_new (int subvect_size, int nb_subvect, + const signed char * shape_cb, int shape_bits, + int have_sign) +{ + split_cb_params * params; + + params = (split_cb_params *) speex_alloc (sizeof (split_cb_params)); + if (params == NULL) return NULL; + + params->subvect_size = subvect_size; + params->nb_subvect = nb_subvect; + params->shape_cb = shape_cb; + params->shape_bits = shape_bits; + params->have_sign = have_sign; + + return params; +} + +static void +speex_split_cb_params_free (const split_cb_params * params) +{ + speex_free ((void *)params); +} + +static SpeexSubmode * +speex_submode_new (int lbr_pitch, int forced_pitch_gain, + int have_subframe_gain, int double_codebook, + + lsp_quant_func lsp_quant, lsp_unquant_func lsp_unquant, + ltp_quant_func ltp_quant, ltp_unquant_func ltp_unquant, + const void * ltp_params, + + innovation_quant_func innovation_quant, + innovation_unquant_func innovation_unquant, + const void * innovation_params, + + /*Synthesis filter enhancement*/ + spx_word16_t lpc_enh_k1, /**< Enhancer constant */ + spx_word16_t lpc_enh_k2, /**< Enhancer constant */ + spx_word16_t lpc_enh_k3, /**< Enhancer constant */ + spx_word16_t comb_gain, /**< Gain of enhancer comb filter */ + + int bits_per_frame /**< Number of bits per frame after encoding*/ + + ) +{ + SpeexSubmode * submode; + + submode = (SpeexSubmode *) speex_alloc (sizeof (SpeexSubmode)); + if (submode == NULL) return NULL; + + submode->lbr_pitch = lbr_pitch; + submode->forced_pitch_gain = forced_pitch_gain; + submode->have_subframe_gain = have_subframe_gain; + submode->double_codebook = double_codebook; + submode->lsp_quant = lsp_quant; + submode->lsp_unquant = lsp_unquant; + submode->ltp_quant = ltp_quant; + submode->ltp_unquant = ltp_unquant; + submode->ltp_params = ltp_params; + submode->innovation_quant = innovation_quant; + submode->innovation_unquant = innovation_unquant; + submode->innovation_params = innovation_params; + submode->lpc_enh_k1 = lpc_enh_k1; + submode->lpc_enh_k2 = lpc_enh_k2; + submode->lpc_enh_k3 = lpc_enh_k3; + submode->comb_gain = comb_gain; + submode->bits_per_frame = bits_per_frame; + + return submode; +} + +static void +speex_submode_free (const SpeexSubmode * submode) +{ + if (submode->ltp_params) + speex_ltp_params_free (submode->ltp_params); + + if (submode->innovation_params) + speex_split_cb_params_free (submode->innovation_params); + + speex_free ((void *)submode); +} + +static SpeexNBMode * +nb_mode_new (int frameSize, int subframeSize, int lpcSize, int bufSize, + int pitchStart, int pitchEnd, spx_word16_t gamma1, + spx_word16_t gamma2, float lag_factor, float lpc_floor, +#ifdef EPIC_48K + int lbr48k, +#endif + const SpeexSubmode * submodes[], int defaultSubmode, + int quality_map[]) +{ + SpeexNBMode * nb_mode; + + nb_mode = (SpeexNBMode *) speex_alloc (sizeof (SpeexNBMode)); + if (nb_mode == NULL) return NULL; + + nb_mode->frameSize = frameSize; + nb_mode->subframeSize = subframeSize; + nb_mode->lpcSize = lpcSize; + nb_mode->bufSize = bufSize; + nb_mode->pitchStart = pitchStart; + nb_mode->pitchEnd = pitchEnd; + nb_mode->gamma1 = gamma1; + nb_mode->gamma2 = gamma2; + nb_mode->lag_factor = lag_factor; + nb_mode->lpc_floor = lpc_floor; +#ifdef EPIC_48K + nb_mode->lbr48k = lbr48k; +#endif + memcpy (nb_mode->submodes, submodes, sizeof (nb_mode->submodes)); + nb_mode->defaultSubmode = defaultSubmode; + memcpy (nb_mode->quality_map, quality_map, sizeof (nb_mode->quality_map)); + + return nb_mode; +} + +static void +nb_mode_free (const SpeexNBMode * nb_mode) +{ + speex_free ((void *)nb_mode); +} + +static SpeexSBMode * +sb_mode_new ( + const SpeexMode *nb_mode, /**< Embedded narrowband mode */ + int frameSize, /**< Size of frames used for encoding */ + int subframeSize, /**< Size of sub-frames used for encoding */ + int lpcSize, /**< Order of LPC filter */ + int bufSize, /**< Signal buffer size in encoder */ + spx_word16_t gamma1, /**< Perceptual filter parameter #1 */ + spx_word16_t gamma2, /**< Perceptual filter parameter #1 */ + float lag_factor, /**< Lag-windowing parameter */ + float lpc_floor, /**< Noise floor for LPC analysis */ + float folding_gain, + + const SpeexSubmode *submodes[], /**< Sub-mode data for the mode */ + int defaultSubmode, /**< Default sub-mode to use when encoding */ + int low_quality_map[], /**< Mode corresponding to each quality setting */ + int quality_map[], /**< Mode corresponding to each quality setting */ + const float (*vbr_thresh)[11], + int nb_modes + ) +{ + SpeexSBMode * sb_mode; + + sb_mode = (SpeexSBMode *) speex_alloc (sizeof (SpeexSBMode)); + if (sb_mode == NULL) return NULL; + + sb_mode->nb_mode = nb_mode; + sb_mode->frameSize = frameSize; + sb_mode->subframeSize = subframeSize; + sb_mode->lpcSize = lpcSize; + sb_mode->bufSize = bufSize; + sb_mode->gamma1 = gamma1; + sb_mode->gamma2 = gamma2; + sb_mode->lag_factor = lag_factor; + sb_mode->lpc_floor = lpc_floor; + sb_mode->folding_gain = folding_gain; + + memcpy (sb_mode->submodes, submodes, sizeof (sb_mode->submodes)); + sb_mode->defaultSubmode = defaultSubmode; + memcpy (sb_mode->low_quality_map, low_quality_map, sizeof (sb_mode->low_quality_map)); + memcpy (sb_mode->quality_map, quality_map, sizeof (sb_mode->quality_map)); + sb_mode->vbr_thresh = vbr_thresh; + sb_mode->nb_modes = nb_modes; + + return sb_mode; +} + +static void +sb_mode_free (const SpeexSBMode * sb_mode) +{ + int i; + + for (i = 0; i < SB_SUBMODES; i++) + if (sb_mode->submodes[i]) speex_submode_free (sb_mode->submodes[i]); + + speex_free ((void *)sb_mode); +} + +static SpeexMode * +mode_new (const void * b_mode, mode_query_func query, char * modeName, + int modeID, int bitstream_version, encoder_init_func enc_init, + encoder_destroy_func enc_destroy, encode_func enc, + decoder_init_func dec_init, decoder_destroy_func dec_destroy, + decode_func dec, encoder_ctl_func enc_ctl, + decoder_ctl_func dec_ctl) +{ + SpeexMode * mode; + + mode = (SpeexMode *) speex_alloc (sizeof (SpeexMode)); + if (mode == NULL) return NULL; + + mode->mode = b_mode; + mode->query = query; + mode->modeName = modeName; + mode->modeID = modeID; + mode->bitstream_version = bitstream_version; + mode->enc_init = enc_init; + mode->enc_destroy = enc_destroy; + mode->enc = enc; + mode->dec_init = dec_init; + mode->dec_destroy = dec_destroy; + mode->dec = dec; + mode->enc_ctl = enc_ctl; + mode->dec_ctl = dec_ctl; + + return mode; +} + +/* Freeing each kind of created (SpeexMode *) is done separately below */ + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params * ltp_params_nb (void) +{ + return speex_ltp_params_new ( + gain_cdbk_nb, + 7, + 7 + ); +} + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params * ltp_params_vlbr (void) +{ + return speex_ltp_params_new ( + gain_cdbk_lbr, + 5, + 0 + ); +} + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params * ltp_params_lbr (void) +{ + return speex_ltp_params_new ( + gain_cdbk_lbr, + 5, + 7 + ); +} + +/* Parameters for Long-Term Prediction (LTP)*/ +static const ltp_params * ltp_params_med (void) +{ + return speex_ltp_params_new ( + gain_cdbk_lbr, + 5, + 7 + ); +} + +/* Split-VQ innovation parameters for very low bit-rate narrowband */ +static const split_cb_params * split_cb_nb_vlbr (void) +{ + return speex_split_cb_params_new ( + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + exc_10_16_table, /*shape_cb*/ + 4, /*shape_bits*/ + 0 + ); +} + +/* Split-VQ innovation parameters for very low bit-rate narrowband */ +static const split_cb_params * split_cb_nb_ulbr (void) +{ + return speex_split_cb_params_new ( + 20, /*subvect_size*/ + 2, /*nb_subvect*/ + exc_20_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0 + ); +} + +/* Split-VQ innovation parameters for low bit-rate narrowband */ +static const split_cb_params * split_cb_nb_lbr (void) +{ + return speex_split_cb_params_new ( + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + exc_10_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0 + ); +} + + +/* Split-VQ innovation parameters narrowband */ +static const split_cb_params * split_cb_nb (void) +{ + return speex_split_cb_params_new ( + 5, /*subvect_size*/ + 8, /*nb_subvect*/ + exc_5_64_table, /*shape_cb*/ + 6, /*shape_bits*/ + 0 + ); +} + +/* Split-VQ innovation parameters narrowband */ +static const split_cb_params * split_cb_nb_med (void) +{ + return speex_split_cb_params_new ( + 8, /*subvect_size*/ + 5, /*nb_subvect*/ + exc_8_128_table, /*shape_cb*/ + 7, /*shape_bits*/ + 0 + ); +} + +/* Split-VQ innovation for low-band wideband */ +static const split_cb_params * split_cb_sb (void) +{ + return speex_split_cb_params_new ( + 5, /*subvect_size*/ + 8, /*nb_subvect*/ + exc_5_256_table, /*shape_cb*/ + 8, /*shape_bits*/ + 0 + ); +} + +/* Split-VQ innovation for high-band wideband */ +static const split_cb_params * split_cb_high (void) +{ + return speex_split_cb_params_new ( + 8, /*subvect_size*/ + 5, /*nb_subvect*/ + hexc_table, /*shape_cb*/ + 7, /*shape_bits*/ + 1 + ); +} + + +/* Split-VQ innovation for high-band wideband */ +static const split_cb_params * split_cb_high_lbr (void) +{ + return speex_split_cb_params_new ( + 10, /*subvect_size*/ + 4, /*nb_subvect*/ + hexc_10_32_table, /*shape_cb*/ + 5, /*shape_bits*/ + 0 + ); +} + +/* 2150 bps "vocoder-like" mode for comfort noise */ +static const SpeexSubmode * nb_submode1 (void) +{ + return speex_submode_new ( + 0, + 1, + 0, + 0, + /* LSP quantization */ + lsp_quant_lbr, + lsp_unquant_lbr, + /* No pitch quantization */ + forced_pitch_quant, + forced_pitch_unquant, + NULL, + /* No innovation quantization (noise only) */ + noise_codebook_quant, + noise_codebook_unquant, + NULL, +#ifdef FIXED_POINT + 22938, 22938, 0, -1, +#else + .7, .7, 0, -1, +#endif + 43 + ); +} + +/* 3.95 kbps very low bit-rate mode */ +static const SpeexSubmode * nb_submode8 (void) +{ + const split_cb_params * params; + + params = split_cb_nb_ulbr(); + if (params == NULL) return NULL; + + return speex_submode_new ( + 0, + 1, + 0, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*No pitch quantization*/ + forced_pitch_quant, + forced_pitch_unquant, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + params, +#ifdef FIXED_POINT + 22938, 16384, 11796, 21299, +#else + 0.7, 0.5, .36, .65, +#endif + 79 + ); +} + +/* 5.95 kbps very low bit-rate mode */ +static const SpeexSubmode * nb_submode2 (void) +{ + return speex_submode_new ( + 0, + 0, + 0, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*No pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_vlbr(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_nb_vlbr(), +#ifdef FIXED_POINT + 22938, 16384, 11796, 18022, +#else + 0.7, 0.5, .36, .55, +#endif + 119 + ); +} + +/* 8 kbps low bit-rate mode */ +static const SpeexSubmode * nb_submode3 (void) +{ + return speex_submode_new ( + -1, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_lbr(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_nb_lbr(), +#ifdef FIXED_POINT + 22938, 18022, 9830, 14746, +#else + 0.7, 0.55, .30, .45, +#endif + 160 + ); +} + +/* 11 kbps medium bit-rate mode */ +static const SpeexSubmode * nb_submode4 (void) +{ + return speex_submode_new ( + -1, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_lbr, + lsp_unquant_lbr, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_med(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_nb_med(), +#ifdef FIXED_POINT + 22938, 20644, 5243, 11469, +#else + 0.7, 0.63, .16, .35, +#endif + 220 + ); +} + +/* 15 kbps high bit-rate mode */ +static const SpeexSubmode * nb_submode5 (void) +{ + return speex_submode_new ( + -1, + 0, + 3, + 0, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_nb(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_nb(), +#ifdef FIXED_POINT + 22938, 21299, 3932, 8192, +#else + 0.7, 0.65, .12, .25, +#endif + 300 + ); +} + +/* 18.2 high bit-rate mode */ +static const SpeexSubmode * nb_submode6 (void) +{ + return speex_submode_new ( + -1, + 0, + 3, + 0, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_nb(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_sb(), +#ifdef FIXED_POINT + 22282, 21299, 2294, 3277, +#else + 0.68, 0.65, .07, .1, +#endif + 364 + ); +} + +/* 24.6 kbps high bit-rate mode */ +static const SpeexSubmode * nb_submode7 (void) +{ + return speex_submode_new ( + -1, + 0, + 3, + 1, + /*LSP quantization*/ + lsp_quant_nb, + lsp_unquant_nb, + /*Pitch quantization*/ + pitch_search_3tap, + pitch_unquant_3tap, + ltp_params_nb(), + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_nb(), +#ifdef FIXED_POINT + 21299, 21299, 0, -1, +#else + 0.65, 0.65, .0, -1, +#endif + 492 + ); +} + + +/* Default mode for narrowband */ +static const SpeexNBMode * nb_mode (void) +{ + const SpeexSubmode ** submodes; + int quality_map[11] = {1, 8, 2, 3, 3, 4, 4, 5, 5, 6, 7}; + const SpeexNBMode * ret; + + submodes = (const SpeexSubmode **) + speex_alloc (sizeof (SpeexSubmode *) * SB_SUBMODES); + if (submodes == NULL) return NULL; + memset (submodes, 0, sizeof (submodes)); + + if (!(submodes[1] = nb_submode1())) goto nb_1; + if (!(submodes[2] = nb_submode2())) goto nb_2; + if (!(submodes[3] = nb_submode3())) goto nb_3; + if (!(submodes[4] = nb_submode4())) goto nb_4; + if (!(submodes[5] = nb_submode5())) goto nb_5; + if (!(submodes[6] = nb_submode6())) goto nb_6; + if (!(submodes[7] = nb_submode7())) goto nb_7; + if (!(submodes[8] = nb_submode8())) goto nb_8; + + ret = nb_mode_new ( + 160, /*frameSize*/ + 40, /*subframeSize*/ + 10, /*lpcSize*/ + 640, /*bufSize*/ + 17, /*pitchStart*/ + 144, /*pitchEnd*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .012, /*lag_factor*/ + 1.0002, /*lpc_floor*/ +#ifdef EPIC_48K + 0, +#endif + submodes, + 5, + quality_map + ); + + if (ret == NULL) goto nb_8; + + /* If nb_mode_new() was successful, the references to submodes have been + * copied into ret->submodes[], and it's safe to free submodes. + */ + speex_free ((void *)submodes); + + return ret; + + /* Cleanup on memory allocation errors */ + nb_8: speex_submode_free (submodes[8]); + nb_7: speex_submode_free (submodes[7]); + nb_6: speex_submode_free (submodes[6]); + nb_5: speex_submode_free (submodes[5]); + nb_4: speex_submode_free (submodes[4]); + nb_3: speex_submode_free (submodes[3]); + nb_2: speex_submode_free (submodes[2]); + nb_1: speex_submode_free (submodes[1]); + + speex_free ((void *)submodes); + + return NULL; +} + + +/* Default mode for narrowband */ +static const SpeexMode * speex_nb_mode_new (void) +{ + const SpeexNBMode * _nb_mode; + + _nb_mode = nb_mode(); + if (_nb_mode == NULL) return NULL; + + return mode_new ( + _nb_mode, + nb_mode_query, + "narrowband", + 0, + 4, + &nb_encoder_init, + &nb_encoder_destroy, + &nb_encode, + &nb_decoder_init, + &nb_decoder_destroy, + &nb_decode, + &nb_encoder_ctl, + &nb_decoder_ctl + ); +} + +static void speex_nb_mode_free (const SpeexMode * mode) +{ + nb_mode_free ((SpeexNBMode *)mode->mode); + speex_free ((void *)mode); +} + +/* Wideband part */ + +static const SpeexSubmode * wb_submode1 (void) +{ + return speex_submode_new ( + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*No innovation quantization*/ + NULL, + NULL, + NULL, +#ifdef FIXED_POINT + 24576, 24576, 0, -1, +#else + .75, .75, .0, -1, +#endif + 36 + ); +} + + +static const SpeexSubmode * wb_submode2 (void) +{ + return speex_submode_new ( + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_high_lbr(), +#ifdef FIXED_POINT + 27853, 19661, 8192, -1, +#else + .85, .6, .25, -1, +#endif + 112 + ); +} + + +static const SpeexSubmode * wb_submode3 (void) +{ + return speex_submode_new ( + 0, + 0, + 1, + 0, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_high(), + +#ifdef FIXED_POINT + 24576, 22938, 1638, -1, +#else + .75, .7, .05, -1, +#endif + 192 + ); +} + +static const SpeexSubmode * wb_submode4 (void) +{ + return speex_submode_new ( + 0, + 0, + 1, + 1, + /*LSP quantization*/ + lsp_quant_high, + lsp_unquant_high, + /*Pitch quantization*/ + NULL, + NULL, + NULL, + /*Innovation quantization*/ + split_cb_search_shape_sign, + split_cb_shape_sign_unquant, + split_cb_high(), +#ifdef FIXED_POINT + 24576, 24576, 0, -1, +#else + .75, .75, .0, -1, +#endif + 352 + ); +} + + +/* Split-band wideband CELP mode*/ +static const SpeexSBMode * sb_wb_mode (void) +{ + const SpeexMode * nb_mode; + const SpeexSubmode ** submodes; + int low_quality_map[11] = {1, 8, 2, 3, 4, 5, 5, 6, 6, 7, 7}; + int quality_map[11] = {1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4}; + SpeexSBMode * ret; + + nb_mode = speex_nb_mode_new (); + if (nb_mode == NULL) return NULL; + + submodes = (const SpeexSubmode **) + speex_alloc (sizeof (SpeexSubmode *) * SB_SUBMODES); + if (submodes == NULL) return NULL; + memset (submodes, 0, sizeof (submodes)); + + if (!(submodes[1] = wb_submode1())) goto sb_1; + if (!(submodes[2] = wb_submode2())) goto sb_2; + if (!(submodes[3] = wb_submode3())) goto sb_3; + if (!(submodes[4] = wb_submode4())) goto sb_4; + + ret = sb_mode_new ( + nb_mode, + 160, /*frameSize*/ + 40, /*subframeSize*/ + 8, /*lpcSize*/ + 640, /*bufSize*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .001, /*lag_factor*/ + 1.0001, /*lpc_floor*/ + 0.9, + submodes, + 3, + low_quality_map, + quality_map, + vbr_hb_thresh, + 5 + ); + + if (ret == NULL) goto sb_4; + + /* If sb_mode_new() was successful, the references to submodes have been + * copied into ret->submodes[], and it's safe to free submodes. + */ + speex_free ((void *)submodes); + + return ret; + + /* Cleanup on memory allocation errors */ + sb_4: speex_submode_free (submodes[4]); + sb_3: speex_submode_free (submodes[3]); + sb_2: speex_submode_free (submodes[2]); + sb_1: speex_submode_free (submodes[1]); + + speex_free ((void *)submodes); + + return NULL; +} + +static void +sb_wb_mode_free (const SpeexSBMode * mode) +{ + speex_nb_mode_free (mode->nb_mode); +} + +static const SpeexMode * speex_wb_mode_new (void) +{ + const SpeexSBMode * sb_mode; + + sb_mode = sb_wb_mode (); + if (sb_mode == NULL) return NULL; + + return mode_new ( + (const SpeexNBMode *)sb_mode, + wb_mode_query, + "wideband (sub-band CELP)", + 1, + 4, + &sb_encoder_init, + &sb_encoder_destroy, + &sb_encode, + &sb_decoder_init, + &sb_decoder_destroy, + &sb_decode, + &sb_encoder_ctl, + &sb_decoder_ctl + ); +} + +static void speex_wb_mode_free (const SpeexMode * mode) +{ + sb_wb_mode_free (mode->mode); + speex_free ((void *)mode); +} + + +/* "Ultra-wideband" mode stuff */ + + + +/* Split-band "ultra-wideband" (32 kbps) CELP mode*/ +static const SpeexSBMode * sb_uwb_mode (void) +{ + const SpeexSBMode * nb_mode; + const SpeexSubmode ** submodes; + int low_quality_map[11] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; + int quality_map[11] = {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}; + SpeexSBMode * ret; + + nb_mode = sb_wb_mode (); + if (nb_mode == NULL) return NULL; + + submodes = (const SpeexSubmode **) + speex_alloc (sizeof (SpeexSubmode *) * SB_SUBMODES); + if (submodes == NULL) return NULL; + memset (submodes, 0, sizeof (submodes)); + + if (!(submodes[1] = wb_submode1())) goto uwb_1; + + ret = sb_mode_new ( + (const SpeexMode *)nb_mode, + 320, /*frameSize*/ + 80, /*subframeSize*/ + 8, /*lpcSize*/ + 1280, /*bufSize*/ +#ifdef FIXED_POINT + 29491, 19661, /* gamma1, gamma2 */ +#else + 0.9, 0.6, /* gamma1, gamma2 */ +#endif + .002, /*lag_factor*/ + 1.0001, /*lpc_floor*/ + 0.7, + submodes, + 1, + low_quality_map, + quality_map, + vbr_uhb_thresh, + 2 + ); + + if (ret == NULL) goto uwb_1; + + /* If sb_mode_new() was successful, the references to submodes have been + * copied into ret->submodes[], and it's safe to free submodes. + */ + speex_free ((void *)submodes); + + return ret; + + uwb_1: speex_submode_free (submodes[1]); + + speex_free ((void *)submodes); + + return NULL; +} + +static void sb_uwb_mode_free (const SpeexSBMode * mode) +{ + sb_wb_mode_free ((const SpeexSBMode *)mode->nb_mode); + sb_mode_free (mode); +} + +static const SpeexMode * speex_uwb_mode_new (void) +{ + const SpeexSBMode * sb_mode; + + sb_mode = sb_uwb_mode(); + if (sb_mode == NULL) return NULL; + + return mode_new ( + sb_mode, + wb_mode_query, + "ultra-wideband (sub-band CELP)", + 2, + 4, + &sb_encoder_init, + &sb_encoder_destroy, + &sb_encode, + &sb_decoder_init, + &sb_decoder_destroy, + &sb_decode, + &sb_encoder_ctl, + &sb_decoder_ctl + ); +} + +static void speex_uwb_mode_free (const SpeexMode * mode) +{ + sb_uwb_mode_free (mode->mode); + speex_free ((void *)mode); +} + +const SpeexMode * speex_mode_new (int modeID) +{ + switch (modeID) { + case 0: return speex_nb_mode_new(); break; + case 1: return speex_wb_mode_new(); break; + case 2: return speex_uwb_mode_new(); break; + default: return NULL; + } +} + +void speex_mode_destroy (const SpeexMode * mode) +{ + switch (mode->modeID) { + case 0: speex_nb_mode_free(mode); break; + case 1: speex_wb_mode_free(mode); break; + case 2: speex_uwb_mode_free(mode); break; + default: break; + } +} + +/** XXX: This is just a dummy global mode, as used by nb_celp.c */ +const SpeexMode speex_wb_mode = { + NULL, + NULL, + NULL, + 0, + 0, + NULL, + NULL, + NULL, + NULL, + NULL, + NULL, + NULL, + NULL +}; + +int speex_mode_query(const SpeexMode *mode, int request, void *ptr) +{ + if (mode == &speex_wb_mode && request == SPEEX_SUBMODE_BITS_PER_FRAME) { + int * p = (int*)ptr; + + switch (*p) { + case 0: *p = SB_SUBMODE_BITS+1; break; + case 1: *p = 36; break; + case 2: *p = 112; break; + case 3: *p = 192; break; + case 4: *p = 352; break; + default: *p = -1; break; + } + + return 0; + } + + return mode->query(mode->mode, request, ptr); +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/nb_celp.c b/3rdparty/iaxclient-2/lib/libspeex/nb_celp.c new file mode 100644 index 0000000..5298a65 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/nb_celp.c @@ -0,0 +1,1940 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: nb_celp.c + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "nb_celp.h" +#include "lpc.h" +#include "lsp.h" +#include "ltp.h" +#include "quant_lsp.h" +#include "cb_search.h" +#include "filters.h" +#include "stack_alloc.h" +#include "vq.h" +#include +#include "vbr.h" +#include "misc.h" +#include + +#ifndef M_PI +#define M_PI 3.14159265358979323846 /* pi */ +#endif + +#ifndef NULL +#define NULL 0 +#endif + +#define SUBMODE(x) st->submodes[st->submodeID]->x + + +#ifdef FIXED_POINT +const spx_word32_t ol_gain_table[32]={18900, 25150, 33468, 44536, 59265, 78865, 104946, 139653, 185838, 247297, 329081, 437913, 582736, 775454, 1031906, 1373169, 1827293, 2431601, 3235761, 4305867, 5729870, 7624808, 10146425, 13501971, 17967238, 23909222, 31816294, 42338330, 56340132, 74972501, 99766822, 132760927}; +const spx_word16_t exc_gain_quant_scal3_bound[7]={1841, 3883, 6051, 8062, 10444, 13580, 18560}; +const spx_word16_t exc_gain_quant_scal3[8]={1002, 2680, 5086, 7016, 9108, 11781, 15380, 21740}; +const spx_word16_t exc_gain_quant_scal1_bound[1]={14385}; +const spx_word16_t exc_gain_quant_scal1[2]={11546, 17224}; + +#define LSP_MARGIN 16 +#define LSP_DELTA1 6553 +#define LSP_DELTA2 1638 + +#else + +const float exc_gain_quant_scal3_bound[7]={0.112338, 0.236980, 0.369316, 0.492054, 0.637471, 0.828874, 1.132784}; +const float exc_gain_quant_scal3[8]={0.061130, 0.163546, 0.310413, 0.428220, 0.555887, 0.719055, 0.938694, 1.326874}; +const float exc_gain_quant_scal1_bound[1]={0.87798}; +const float exc_gain_quant_scal1[2]={0.70469, 1.05127}; + +#define LSP_MARGIN .002 +#define LSP_DELTA1 .2 +#define LSP_DELTA2 .05 + +#endif + + + + +#define sqr(x) ((x)*(x)) + +void *nb_encoder_init(const SpeexMode *m) +{ + EncState *st; + const SpeexNBMode *mode; + int i; + + mode=(const SpeexNBMode *)m->mode; +#if defined(VAR_ARRAYS) || defined (USE_ALLOCA) + st = (EncState*)speex_alloc(sizeof(EncState)); + st->stack = NULL; +#else + st = (EncState*)speex_alloc(sizeof(EncState)+8000*sizeof(spx_sig_t)); + st->stack = ((char*)st) + sizeof(EncState); +#endif + if (!st) + return NULL; + + st->mode=m; + + st->frameSize = mode->frameSize; + st->windowSize = st->frameSize*3/2; + st->nbSubframes=mode->frameSize/mode->subframeSize; + st->subframeSize=mode->subframeSize; + st->lpcSize = mode->lpcSize; + st->gamma1=mode->gamma1; + st->gamma2=mode->gamma2; + st->min_pitch=mode->pitchStart; + st->max_pitch=mode->pitchEnd; + st->lag_factor=mode->lag_factor; + st->lpc_floor = mode->lpc_floor; + + st->submodes=mode->submodes; + st->submodeID=st->submodeSelect=mode->defaultSubmode; + st->bounded_pitch = 1; + + st->encode_submode = 1; +#ifdef EPIC_48K + st->lbr_48k=mode->lbr48k; +#endif + + /* Allocating input buffer */ + st->inBuf = speex_alloc((st->windowSize)*sizeof(spx_sig_t)); + st->frame = st->inBuf; + /* Allocating excitation buffer */ + st->excBuf = speex_alloc((mode->frameSize+mode->pitchEnd+1)*sizeof(spx_sig_t)); + st->exc = st->excBuf + mode->pitchEnd + 1; + st->swBuf = speex_alloc((mode->frameSize+mode->pitchEnd+1)*sizeof(spx_sig_t)); + st->sw = st->swBuf + mode->pitchEnd + 1; + + st->innov = speex_alloc((st->frameSize)*sizeof(spx_sig_t)); + + /* Asymmetric "pseudo-Hamming" window */ + { + int part1, part2; + part1=st->frameSize - (st->subframeSize>>1); + part2=(st->frameSize>>1) + (st->subframeSize>>1); + st->window = speex_alloc((st->windowSize)*sizeof(spx_word16_t)); + for (i=0;iwindow[i]=(spx_word16_t)(SIG_SCALING*(.54-.46*cos(M_PI*i/part1))); + for (i=0;iwindow[part1+i]=(spx_word16_t)(SIG_SCALING*(.54+.46*cos(M_PI*i/part2))); + } + /* Create the window for autocorrelation (lag-windowing) */ + st->lagWindow = speex_alloc((st->lpcSize+1)*sizeof(spx_word16_t)); + for (i=0;ilpcSize+1;i++) + st->lagWindow[i]=16384*exp(-.5*sqr(2*M_PI*st->lag_factor*i)); + + st->autocorr = speex_alloc((st->lpcSize+1)*sizeof(spx_word16_t)); + + st->lpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->interp_lpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->interp_qlpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->bw_lpc1 = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->bw_lpc2 = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + + st->lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + + st->first = 1; + for (i=0;ilpcSize;i++) + { + st->lsp[i]=LSP_SCALING*(M_PI*((float)(i+1)))/(st->lpcSize+1); + } + + st->mem_sp = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + st->mem_sw = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + st->mem_sw_whole = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + st->mem_exc = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + + st->pi_gain = speex_alloc((st->nbSubframes)*sizeof(spx_word32_t)); + + st->pitch = speex_alloc((st->nbSubframes)*sizeof(int)); + + st->vbr = speex_alloc(sizeof(VBRState)); + vbr_init(st->vbr); + st->vbr_quality = 8; + st->vbr_enabled = 0; + st->vad_enabled = 0; + st->dtx_enabled = 0; + st->abr_enabled = 0; + st->abr_drift = 0; + + st->plc_tuning = 2; + st->complexity=2; + st->sampling_rate=8000; + st->dtx_count=0; + +#ifdef ENABLE_VALGRIND + VALGRIND_MAKE_READABLE(st, (st->stack-(char*)st)); +#endif + return st; +} + +void nb_encoder_destroy(void *state) +{ + EncState *st=(EncState *)state; + /* Free all allocated memory */ + + vbr_destroy(st->vbr); + + /*Free state memory... should be last*/ + speex_free(st); +} + +int nb_encode(void *state, void *vin, SpeexBits *bits) +{ + EncState *st; + int i, sub, roots; + int ol_pitch; + spx_word16_t ol_pitch_coef; + spx_word32_t ol_gain; + VARDECL(spx_sig_t *res); + VARDECL(spx_sig_t *target); + VARDECL(spx_mem_t *mem); + char *stack; + VARDECL(spx_word16_t *syn_resp); + VARDECL(spx_sig_t *real_exc); +#ifdef EPIC_48K + int pitch_half[2]; + int ol_pitch_id=0; +#endif + spx_word16_t *in = vin; + + st=(EncState *)state; + stack=st->stack; + + /* Copy new data in input buffer */ + speex_move(st->inBuf, st->inBuf+st->frameSize, (st->windowSize-st->frameSize)*sizeof(spx_sig_t)); + for (i=0;iframeSize;i++) + st->inBuf[st->windowSize-st->frameSize+i] = SHL32(EXTEND32(in[i]), SIG_SHIFT); + + /* Move signals 1 frame towards the past */ + speex_move(st->excBuf, st->excBuf+st->frameSize, (st->max_pitch+1)*sizeof(spx_sig_t)); + speex_move(st->swBuf, st->swBuf+st->frameSize, (st->max_pitch+1)*sizeof(spx_sig_t)); + + { + VARDECL(spx_word16_t *w_sig); + ALLOC(w_sig, st->windowSize, spx_word16_t); + /* Window for analysis */ + for (i=0;iwindowSize;i++) + w_sig[i] = EXTRACT16(SHR32(MULT16_16(EXTRACT16(SHR32(st->frame[i],SIG_SHIFT)),st->window[i]),SIG_SHIFT)); + + /* Compute auto-correlation */ + _spx_autocorr(w_sig, st->autocorr, st->lpcSize+1, st->windowSize); + } + st->autocorr[0] = (spx_word16_t) (st->autocorr[0]*st->lpc_floor); /* Noise floor in auto-correlation domain */ + + /* Lag windowing: equivalent to filtering in the power-spectrum domain */ + for (i=0;ilpcSize+1;i++) + st->autocorr[i] = MULT16_16_Q14(st->autocorr[i],st->lagWindow[i]); + + /* Levinson-Durbin */ + _spx_lpc(st->lpc+1, st->autocorr, st->lpcSize); + st->lpc[0]=(spx_coef_t)LPC_SCALING; + + /* LPC to LSPs (x-domain) transform */ + roots=lpc_to_lsp (st->lpc, st->lpcSize, st->lsp, 15, LSP_DELTA1, stack); + /* Check if we found all the roots */ + if (roots!=st->lpcSize) + { + /* Search again if we can afford it */ + if (st->complexity>1) + roots = lpc_to_lsp (st->lpc, st->lpcSize, st->lsp, 11, LSP_DELTA2, stack); + if (roots!=st->lpcSize) + { + /*If we can't find all LSP's, do some damage control and use previous filter*/ + for (i=0;ilpcSize;i++) + { + st->lsp[i]=st->old_lsp[i]; + } + } + } + + + + /* Whole frame analysis (open-loop estimation of pitch and excitation gain) */ + { + if (st->first) + for (i=0;ilpcSize;i++) + st->interp_lsp[i] = st->lsp[i]; + else + lsp_interpolate(st->old_lsp, st->lsp, st->interp_lsp, st->lpcSize, st->nbSubframes, st->nbSubframes<<1); + + lsp_enforce_margin(st->interp_lsp, st->lpcSize, LSP_MARGIN); + + /* Compute interpolated LPCs (unquantized) for whole frame*/ + lsp_to_lpc(st->interp_lsp, st->interp_lpc, st->lpcSize,stack); + + + /*Open-loop pitch*/ + if (!st->submodes[st->submodeID] || st->vbr_enabled || st->vad_enabled || SUBMODE(forced_pitch_gain) || + SUBMODE(lbr_pitch) != -1) + { + int nol_pitch[6]; + spx_word16_t nol_pitch_coef[6]; + + bw_lpc(st->gamma1, st->interp_lpc, st->bw_lpc1, st->lpcSize); + bw_lpc(st->gamma2, st->interp_lpc, st->bw_lpc2, st->lpcSize); + + filter_mem2(st->frame, st->bw_lpc1, st->bw_lpc2, st->sw, st->frameSize, st->lpcSize, st->mem_sw_whole); + + open_loop_nbest_pitch(st->sw, st->min_pitch, st->max_pitch, st->frameSize, + nol_pitch, nol_pitch_coef, 6, stack); + ol_pitch=nol_pitch[0]; + ol_pitch_coef = nol_pitch_coef[0]; + /*Try to remove pitch multiples*/ + for (i=1;i<6;i++) + { +#ifdef FIXED_POINT + if ((nol_pitch_coef[i]>MULT16_16_Q15(nol_pitch_coef[0],27853)) && +#else + if ((nol_pitch_coef[i]>.85*nol_pitch_coef[0]) && +#endif + (ABS(2*nol_pitch[i]-ol_pitch)<=2 || ABS(3*nol_pitch[i]-ol_pitch)<=3 || + ABS(4*nol_pitch[i]-ol_pitch)<=4 || ABS(5*nol_pitch[i]-ol_pitch)<=5)) + { + /*ol_pitch_coef=nol_pitch_coef[i];*/ + ol_pitch = nol_pitch[i]; + } + } + /*if (ol_pitch>50) + ol_pitch/=2;*/ + /*ol_pitch_coef = sqrt(ol_pitch_coef);*/ + +#ifdef EPIC_48K + if (st->lbr_48k) + { + if (ol_pitch < st->min_pitch+2) + ol_pitch = st->min_pitch+2; + if (ol_pitch > st->max_pitch-2) + ol_pitch = st->max_pitch-2; + open_loop_nbest_pitch(st->sw, ol_pitch-2, ol_pitch+2, st->frameSize>>1, + &pitch_half[0], nol_pitch_coef, 1, stack); + open_loop_nbest_pitch(st->sw+(st->frameSize>>1), pitch_half[0]-1, pitch_half[0]+2, st->frameSize>>1, + &pitch_half[1], nol_pitch_coef, 1, stack); + } +#endif + } else { + ol_pitch=0; + ol_pitch_coef=0; + } + /*Compute "real" excitation*/ + fir_mem2(st->frame, st->interp_lpc, st->exc, st->frameSize, st->lpcSize, st->mem_exc); + + /* Compute open-loop excitation gain */ +#ifdef EPIC_48K + if (st->lbr_48k) + { + float ol1=0,ol2=0; + float ol_gain2; + ol1 = compute_rms(st->exc, st->frameSize>>1); + ol2 = compute_rms(st->exc+(st->frameSize>>1), st->frameSize>>1); + ol1 *= ol1*(st->frameSize>>1); + ol2 *= ol2*(st->frameSize>>1); + + ol_gain2=ol1; + if (ol2>ol1) + ol_gain2=ol2; + ol_gain2 = sqrt(2*ol_gain2*(ol1+ol2))*1.3*(1-.5*GAIN_SCALING_1*GAIN_SCALING_1*ol_pitch_coef*ol_pitch_coef); + + ol_gain=SHR(sqrt(1+ol_gain2/st->frameSize),SIG_SHIFT); + + } else { +#endif + ol_gain = SHL32(EXTEND32(compute_rms(st->exc, st->frameSize)),SIG_SHIFT); +#ifdef EPIC_48K + } +#endif + } + + /*VBR stuff*/ + if (st->vbr && (st->vbr_enabled||st->vad_enabled)) + { + float lsp_dist=0; + for (i=0;ilpcSize;i++) + lsp_dist += (st->old_lsp[i] - st->lsp[i])*(st->old_lsp[i] - st->lsp[i]); + lsp_dist /= LSP_SCALING*LSP_SCALING; + + if (st->abr_enabled) + { + float qual_change=0; + if (st->abr_drift2 * st->abr_drift > 0) + { + /* Only adapt if long-term and short-term drift are the same sign */ + qual_change = -.00001*st->abr_drift/(1+st->abr_count); + if (qual_change>.05) + qual_change=.05; + if (qual_change<-.05) + qual_change=-.05; + } + st->vbr_quality += qual_change; + if (st->vbr_quality>10) + st->vbr_quality=10; + if (st->vbr_quality<0) + st->vbr_quality=0; + } + + st->relative_quality = vbr_analysis(st->vbr, in, st->frameSize, ol_pitch, GAIN_SCALING_1*ol_pitch_coef); + /*if (delta_qual<0)*/ + /* delta_qual*=.1*(3+st->vbr_quality);*/ + if (st->vbr_enabled) + { + int mode; + int choice=0; + float min_diff=100; + mode = 8; + while (mode) + { + int v1; + float thresh; + v1=(int)floor(st->vbr_quality); + if (v1==10) + thresh = vbr_nb_thresh[mode][v1]; + else + thresh = (st->vbr_quality-v1)*vbr_nb_thresh[mode][v1+1] + (1+v1-st->vbr_quality)*vbr_nb_thresh[mode][v1]; + if (st->relative_quality > thresh && + st->relative_quality-threshrelative_quality-thresh; + } + mode--; + } + mode=choice; + if (mode==0) + { + if (st->dtx_count==0 || lsp_dist>.05 || !st->dtx_enabled || st->dtx_count>20) + { + mode=1; + st->dtx_count=1; + } else { + mode=0; + st->dtx_count++; + } + } else { + st->dtx_count=0; + } + + speex_encoder_ctl(state, SPEEX_SET_MODE, &mode); + + if (st->abr_enabled) + { + int bitrate; + speex_encoder_ctl(state, SPEEX_GET_BITRATE, &bitrate); + st->abr_drift+=(bitrate-st->abr_enabled); + st->abr_drift2 = .95*st->abr_drift2 + .05*(bitrate-st->abr_enabled); + st->abr_count += 1.0; + } + + } else { + /*VAD only case*/ + int mode; + if (st->relative_quality<2) + { + if (st->dtx_count==0 || lsp_dist>.05 || !st->dtx_enabled || st->dtx_count>20) + { + st->dtx_count=1; + mode=1; + } else { + mode=0; + st->dtx_count++; + } + } else { + st->dtx_count = 0; + mode=st->submodeSelect; + } + /*speex_encoder_ctl(state, SPEEX_SET_MODE, &mode);*/ + st->submodeID=mode; + } + } else { + st->relative_quality = -1; + } + + if (st->encode_submode) + { +#ifdef EPIC_48K + if (!st->lbr_48k) { +#endif + + /* First, transmit a zero for narrowband */ + speex_bits_pack(bits, 0, 1); + + /* Transmit the sub-mode we use for this frame */ + speex_bits_pack(bits, st->submodeID, NB_SUBMODE_BITS); + +#ifdef EPIC_48K + } +#endif + } + + /* If null mode (no transmission), just set a couple things to zero*/ + if (st->submodes[st->submodeID] == NULL) + { + for (i=0;iframeSize;i++) + st->exc[i]=st->sw[i]=VERY_SMALL; + + for (i=0;ilpcSize;i++) + st->mem_sw[i]=0; + st->first=1; + st->bounded_pitch = 1; + + /* Final signal synthesis from excitation */ + iir_mem2(st->exc, st->interp_qlpc, st->frame, st->frameSize, st->lpcSize, st->mem_sp); + +#ifdef RESYNTH + for (i=0;iframeSize;i++) + in[i]=st->frame[i]; +#endif + return 0; + + } + + /* LSP Quantization */ + if (st->first) + { + for (i=0;ilpcSize;i++) + st->old_lsp[i] = st->lsp[i]; + } + + + /*Quantize LSPs*/ +#if 1 /*0 for unquantized*/ + SUBMODE(lsp_quant)(st->lsp, st->qlsp, st->lpcSize, bits); +#else + for (i=0;ilpcSize;i++) + st->qlsp[i]=st->lsp[i]; +#endif + +#ifdef EPIC_48K + if (st->lbr_48k) { + speex_bits_pack(bits, pitch_half[0]-st->min_pitch, 7); + speex_bits_pack(bits, pitch_half[1]-pitch_half[0]+1, 2); + + { + int quant = (int)floor(.5+7.4*GAIN_SCALING_1*ol_pitch_coef); + if (quant>7) + quant=7; + if (quant<0) + quant=0; + ol_pitch_id=quant; + speex_bits_pack(bits, quant, 3); + ol_pitch_coef=GAIN_SCALING*0.13514*quant; + + } + { + int qe = (int)(floor(.5+2.1*log(ol_gain*1.0/SIG_SCALING)))-2; + if (qe<0) + qe=0; + if (qe>15) + qe=15; + ol_gain = exp((qe+2)/2.1)*SIG_SCALING; + speex_bits_pack(bits, qe, 4); + } + + } else { +#endif + + /*If we use low bit-rate pitch mode, transmit open-loop pitch*/ + if (SUBMODE(lbr_pitch)!=-1) + { + speex_bits_pack(bits, ol_pitch-st->min_pitch, 7); + } + + if (SUBMODE(forced_pitch_gain)) + { + int quant; + quant = (int)floor(.5+15*ol_pitch_coef*GAIN_SCALING_1); + if (quant>15) + quant=15; + if (quant<0) + quant=0; + speex_bits_pack(bits, quant, 4); + ol_pitch_coef=GAIN_SCALING*0.066667*quant; + } + + + /*Quantize and transmit open-loop excitation gain*/ +#ifdef FIXED_POINT + { + int qe = scal_quant32(ol_gain, ol_gain_table, 32); + /*ol_gain = exp(qe/3.5)*SIG_SCALING;*/ + ol_gain = MULT16_32_Q15(28406,ol_gain_table[qe]); + speex_bits_pack(bits, qe, 5); + } +#else + { + int qe = (int)(floor(.5+3.5*log(ol_gain*1.0/SIG_SCALING))); + if (qe<0) + qe=0; + if (qe>31) + qe=31; + ol_gain = exp(qe/3.5)*SIG_SCALING; + speex_bits_pack(bits, qe, 5); + } +#endif + + +#ifdef EPIC_48K + } +#endif + + + /* Special case for first frame */ + if (st->first) + { + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + } + + /* Filter response */ + ALLOC(res, st->subframeSize, spx_sig_t); + /* Target signal */ + ALLOC(target, st->subframeSize, spx_sig_t); + ALLOC(syn_resp, st->subframeSize, spx_word16_t); + ALLOC(real_exc, st->subframeSize, spx_sig_t); + ALLOC(mem, st->lpcSize, spx_mem_t); + + /* Loop on sub-frames */ + for (sub=0;subnbSubframes;sub++) + { + int offset; + spx_sig_t *sp, *sw, *exc; + int pitch; + int response_bound = st->subframeSize; +#ifdef EPIC_48K + if (st->lbr_48k) + { + if (sub*2 < st->nbSubframes) + ol_pitch = pitch_half[0]; + else + ol_pitch = pitch_half[1]; + } +#endif + + /* Offset relative to start of frame */ + offset = st->subframeSize*sub; + /* Original signal */ + sp=st->frame+offset; + /* Excitation */ + exc=st->exc+offset; + /* Weighted signal */ + sw=st->sw+offset; + + /* LSP interpolation (quantized and unquantized) */ + lsp_interpolate(st->old_lsp, st->lsp, st->interp_lsp, st->lpcSize, sub, st->nbSubframes); + lsp_interpolate(st->old_qlsp, st->qlsp, st->interp_qlsp, st->lpcSize, sub, st->nbSubframes); + + /* Make sure the filters are stable */ + lsp_enforce_margin(st->interp_lsp, st->lpcSize, LSP_MARGIN); + lsp_enforce_margin(st->interp_qlsp, st->lpcSize, LSP_MARGIN); + + /* Compute interpolated LPCs (quantized and unquantized) */ + lsp_to_lpc(st->interp_lsp, st->interp_lpc, st->lpcSize,stack); + + lsp_to_lpc(st->interp_qlsp, st->interp_qlpc, st->lpcSize, stack); + + /* Compute analysis filter gain at w=pi (for use in SB-CELP) */ + { + spx_word32_t pi_g=st->interp_qlpc[0]; + for (i=1;i<=st->lpcSize;i+=2) + { + /*pi_g += -st->interp_qlpc[i] + st->interp_qlpc[i+1];*/ + pi_g = ADD32(pi_g, SUB32(st->interp_qlpc[i+1],st->interp_qlpc[i])); + } + st->pi_gain[sub] = pi_g; + } + + + /* Compute bandwidth-expanded (unquantized) LPCs for perceptual weighting */ + bw_lpc(st->gamma1, st->interp_lpc, st->bw_lpc1, st->lpcSize); + if (st->gamma2>=0) + bw_lpc(st->gamma2, st->interp_lpc, st->bw_lpc2, st->lpcSize); + else + { + st->bw_lpc2[0]=1; + for (i=1;i<=st->lpcSize;i++) + st->bw_lpc2[i]=0; + } + + for (i=0;isubframeSize;i++) + real_exc[i] = exc[i]; + + if (st->complexity==0) + response_bound >>= 1; + compute_impulse_response(st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, syn_resp, response_bound, st->lpcSize, stack); + for (i=response_bound;isubframeSize;i++) + syn_resp[i]=VERY_SMALL; + + /* Reset excitation */ + for (i=0;isubframeSize;i++) + exc[i]=VERY_SMALL; + + /* Compute zero response of A(z/g1) / ( A(z/g2) * A(z) ) */ + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sp[i]; +#ifdef SHORTCUTS2 + iir_mem2(exc, st->interp_qlpc, exc, response_bound, st->lpcSize, mem); + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sw[i]; + filter_mem2(exc, st->bw_lpc1, st->bw_lpc2, res, response_bound, st->lpcSize, mem); + for (i=response_bound;isubframeSize;i++) + res[i]=0; +#else + iir_mem2(exc, st->interp_qlpc, exc, st->subframeSize, st->lpcSize, mem); + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sw[i]; + filter_mem2(exc, st->bw_lpc1, st->bw_lpc2, res, st->subframeSize, st->lpcSize, mem); +#endif + + /* Compute weighted signal */ + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sw[i]; + filter_mem2(sp, st->bw_lpc1, st->bw_lpc2, sw, st->subframeSize, st->lpcSize, mem); + + if (st->complexity==0) + for (i=0;ilpcSize;i++) + st->mem_sw[i]=mem[i]; + + /* Compute target signal */ + for (i=0;isubframeSize;i++) + target[i]=sw[i]-res[i]; + + for (i=0;isubframeSize;i++) + exc[i]=0; + + /* If we have a long-term predictor (otherwise, something's wrong) */ + if (SUBMODE(ltp_quant)) + { + int pit_min, pit_max; + /* Long-term prediction */ + if (SUBMODE(lbr_pitch) != -1) + { + /* Low bit-rate pitch handling */ + int margin; + margin = SUBMODE(lbr_pitch); + if (margin) + { + if (ol_pitch < st->min_pitch+margin-1) + ol_pitch=st->min_pitch+margin-1; + if (ol_pitch > st->max_pitch-margin) + ol_pitch=st->max_pitch-margin; + pit_min = ol_pitch-margin+1; + pit_max = ol_pitch+margin; + } else { + pit_min=pit_max=ol_pitch; + } + } else { + pit_min = st->min_pitch; + pit_max = st->max_pitch; + } + + /* Force pitch to use only the current frame if needed */ + if (st->bounded_pitch && pit_max>offset) + pit_max=offset; + +#ifdef EPIC_48K + if (st->lbr_48k) + { + pitch = SUBMODE(ltp_quant)(target, sw, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + exc, SUBMODE(ltp_params), pit_min, pit_max, ol_pitch_coef, + st->lpcSize, st->subframeSize, bits, stack, + exc, syn_resp, st->complexity, ol_pitch_id, st->plc_tuning); + } else { +#endif + + /* Perform pitch search */ + pitch = SUBMODE(ltp_quant)(target, sw, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + exc, SUBMODE(ltp_params), pit_min, pit_max, ol_pitch_coef, + st->lpcSize, st->subframeSize, bits, stack, + exc, syn_resp, st->complexity, 0, st->plc_tuning); +#ifdef EPIC_48K + } +#endif + + st->pitch[sub]=pitch; + } else { + speex_error ("No pitch prediction, what's wrong"); + } + + /* Quantization of innovation */ + { + spx_sig_t *innov; + spx_word32_t ener=0; + spx_word16_t fine_gain; + + innov = st->innov+sub*st->subframeSize; + for (i=0;isubframeSize;i++) + innov[i]=0; + + for (i=0;isubframeSize;i++) + real_exc[i] = SUB32(real_exc[i], exc[i]); + + ener = SHL32(EXTEND32(compute_rms(real_exc, st->subframeSize)),SIG_SHIFT); + + /*FIXME: Should use DIV32_16 and make sure result fits in 16 bits */ +#ifdef FIXED_POINT + { + spx_word32_t f = DIV32(ener,PSHR32(ol_gain,SIG_SHIFT)); + if (f<32768) + fine_gain = f; + else + fine_gain = 32767; + } +#else + fine_gain = DIV32_16(ener,PSHR32(ol_gain,SIG_SHIFT)); +#endif + /* Calculate gain correction for the sub-frame (if any) */ + if (SUBMODE(have_subframe_gain)) + { + int qe; + if (SUBMODE(have_subframe_gain)==3) + { + qe = scal_quant(fine_gain, exc_gain_quant_scal3_bound, 8); + speex_bits_pack(bits, qe, 3); + ener=MULT16_32_Q14(exc_gain_quant_scal3[qe],ol_gain); + } else { + qe = scal_quant(fine_gain, exc_gain_quant_scal1_bound, 2); + speex_bits_pack(bits, qe, 1); + ener=MULT16_32_Q14(exc_gain_quant_scal1[qe],ol_gain); + } + } else { + ener=ol_gain; + } + + /*printf ("%f %f\n", ener, ol_gain);*/ + + /* Normalize innovation */ + signal_div(target, target, ener, st->subframeSize); + + /* Quantize innovation */ + if (SUBMODE(innovation_quant)) + { + /* Codebook search */ + SUBMODE(innovation_quant)(target, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + SUBMODE(innovation_params), st->lpcSize, st->subframeSize, + innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook)); + + /* De-normalize innovation and update excitation */ + signal_mul(innov, innov, ener, st->subframeSize); + + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i],innov[i]); + } else { + speex_error("No fixed codebook"); + } + + /* In some (rare) modes, we do a second search (more bits) to reduce noise even more */ + if (SUBMODE(double_codebook)) { + char *tmp_stack=stack; + VARDECL(spx_sig_t *innov2); + ALLOC(innov2, st->subframeSize, spx_sig_t); + for (i=0;isubframeSize;i++) + innov2[i]=0; + for (i=0;isubframeSize;i++) + target[i]*=2.2; + SUBMODE(innovation_quant)(target, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + SUBMODE(innovation_params), st->lpcSize, st->subframeSize, + innov2, syn_resp, bits, stack, st->complexity, 0); + signal_mul(innov2, innov2, (spx_word32_t) (ener*(1/2.2)), st->subframeSize); + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i],innov2[i]); + stack = tmp_stack; + } + + } + + /* Final signal synthesis from excitation */ + iir_mem2(exc, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, st->mem_sp); + + /* Compute weighted signal again, from synthesized speech (not sure it's the right thing) */ + if (st->complexity!=0) + filter_mem2(sp, st->bw_lpc1, st->bw_lpc2, sw, st->subframeSize, st->lpcSize, st->mem_sw); + + } + + /* Store the LSPs for interpolation in the next frame */ + if (st->submodeID>=1) + { + for (i=0;ilpcSize;i++) + st->old_lsp[i] = st->lsp[i]; + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + } + + if (st->submodeID==1) + { + if (st->dtx_count) + speex_bits_pack(bits, 15, 4); + else + speex_bits_pack(bits, 0, 4); + } + + /* The next frame will not be the first (Duh!) */ + st->first = 0; + +#ifdef RESYNTH + /* Replace input by synthesized speech */ + for (i=0;iframeSize;i++) + { + spx_word32_t sig = PSHR32(st->frame[i],SIG_SHIFT); + if (sig>32767) + sig = 32767; + if (sig<-32767) + sig = -32767; + in[i]=sig; + } +#endif + + if (SUBMODE(innovation_quant) == noise_codebook_quant || st->submodeID==0) + st->bounded_pitch = 1; + else + st->bounded_pitch = 0; + + return 1; +} + + +void *nb_decoder_init(const SpeexMode *m) +{ + DecState *st; + const SpeexNBMode *mode; + int i; + + mode=(const SpeexNBMode*)m->mode; +#if defined(VAR_ARRAYS) || defined (USE_ALLOCA) + st = (DecState *)speex_alloc(sizeof(DecState)); + st->stack = NULL; +#else + st = (DecState *)speex_alloc(sizeof(DecState)+4000*sizeof(spx_sig_t)); + st->stack = ((char*)st) + sizeof(DecState); +#endif + if (!st) + return NULL; + + st->mode=m; + + + st->encode_submode = 1; +#ifdef EPIC_48K + st->lbr_48k=mode->lbr48k; +#endif + + st->first=1; + /* Codec parameters, should eventually have several "modes"*/ + st->frameSize = mode->frameSize; + st->nbSubframes=mode->frameSize/mode->subframeSize; + st->subframeSize=mode->subframeSize; + st->lpcSize = mode->lpcSize; + st->min_pitch=mode->pitchStart; + st->max_pitch=mode->pitchEnd; + + st->submodes=mode->submodes; + st->submodeID=mode->defaultSubmode; + + st->lpc_enh_enabled=0; + + + st->inBuf = speex_alloc((st->frameSize)*sizeof(spx_sig_t)); + st->frame = st->inBuf; + st->excBuf = speex_alloc((st->frameSize + st->max_pitch + 1)*sizeof(spx_sig_t)); + st->exc = st->excBuf + st->max_pitch + 1; + for (i=0;iframeSize;i++) + st->inBuf[i]=0; + for (i=0;iframeSize + st->max_pitch + 1;i++) + st->excBuf[i]=0; + st->innov = speex_alloc((st->frameSize)*sizeof(spx_sig_t)); + + st->interp_qlpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->mem_sp = speex_alloc((5*st->lpcSize)*sizeof(spx_mem_t)); + st->comb_mem = speex_alloc(sizeof(CombFilterMem)); + comb_filter_mem_init (st->comb_mem); + + st->pi_gain = speex_alloc((st->nbSubframes)*sizeof(spx_word32_t)); + st->last_pitch = 40; + st->count_lost=0; + st->pitch_gain_buf[0] = st->pitch_gain_buf[1] = st->pitch_gain_buf[2] = 0; + st->pitch_gain_buf_idx = 0; + + st->sampling_rate=8000; + st->last_ol_gain = 0; + + st->user_callback.func = &speex_default_user_handler; + st->user_callback.data = NULL; + for (i=0;i<16;i++) + st->speex_callbacks[i].func = NULL; + + st->voc_m1=st->voc_m2=st->voc_mean=0; + st->voc_offset=0; + st->dtx_enabled=0; +#ifdef ENABLE_VALGRIND + VALGRIND_MAKE_READABLE(st, (st->stack-(char*)st)); +#endif + return st; +} + +void nb_decoder_destroy(void *state) +{ + //DecState *st; + //st=(DecState*)state; + + speex_free(state); +} + +#define median3(a, b, c) ((a) < (b) ? ((b) < (c) ? (b) : ((a) < (c) ? (c) : (a))) : ((c) < (b) ? (b) : ((c) < (a) ? (c) : (a)))) + +static void nb_decode_lost(DecState *st, spx_word16_t *out, char *stack) +{ + int i, sub; + VARDECL(spx_coef_t *awk1); + VARDECL(spx_coef_t *awk2); + VARDECL(spx_coef_t *awk3); + float pitch_gain, fact; + spx_word16_t gain_med; + + fact = exp(-.04*st->count_lost*st->count_lost); + gain_med = median3(st->pitch_gain_buf[0], st->pitch_gain_buf[1], st->pitch_gain_buf[2]); + if (gain_med < st->last_pitch_gain) + st->last_pitch_gain = gain_med; + + pitch_gain = GAIN_SCALING_1*st->last_pitch_gain; + if (pitch_gain>.95) + pitch_gain=.95; + + pitch_gain = fact*pitch_gain + VERY_SMALL; + + /* Shift all buffers by one frame */ + /*speex_move(st->inBuf, st->inBuf+st->frameSize, (st->bufSize-st->frameSize)*sizeof(spx_sig_t));*/ + speex_move(st->excBuf, st->excBuf+st->frameSize, (st->max_pitch + 1)*sizeof(spx_sig_t)); + + ALLOC(awk1, (st->lpcSize+1), spx_coef_t); + ALLOC(awk2, (st->lpcSize+1), spx_coef_t); + ALLOC(awk3, (st->lpcSize+1), spx_coef_t); + + for (sub=0;subnbSubframes;sub++) + { + int offset; + spx_sig_t *sp, *exc; + /* Offset relative to start of frame */ + offset = st->subframeSize*sub; + /* Original signal */ + sp=st->frame+offset; + /* Excitation */ + exc=st->exc+offset; + /* Excitation after post-filter*/ + + /* Calculate perceptually enhanced LPC filter */ + if (st->lpc_enh_enabled) + { + spx_word16_t k1,k2,k3; + if (st->submodes[st->submodeID] != NULL) + { + k1=SUBMODE(lpc_enh_k1); + k2=SUBMODE(lpc_enh_k2); + k3=SUBMODE(lpc_enh_k3); + } else { + k1=k2=.7*GAMMA_SCALING; + k3=.0; + } + bw_lpc(k1, st->interp_qlpc, awk1, st->lpcSize); + bw_lpc(k2, st->interp_qlpc, awk2, st->lpcSize); + bw_lpc(k3, st->interp_qlpc, awk3, st->lpcSize); + } + + /* Make up a plausible excitation */ + /* FIXME: THIS CAN BE IMPROVED */ + /*if (pitch_gain>.95) + pitch_gain=.95;*/ + { + float innov_gain=0; + innov_gain = compute_rms(st->innov, st->frameSize); + for (i=0;isubframeSize;i++) + { +#if 0 + exc[i] = pitch_gain * exc[i - st->last_pitch] + fact*sqrt(1-pitch_gain)*st->innov[i+offset]; + /*Just so it give the same lost packets as with if 0*/ + /*rand();*/ +#else + /*exc[i]=pitch_gain*exc[i-st->last_pitch] + fact*st->innov[i+offset];*/ + exc[i]=pitch_gain*(exc[i-st->last_pitch]+VERY_SMALL) + + fact*sqrt(1-pitch_gain)*speex_rand(innov_gain); +#endif + } + } + for (i=0;isubframeSize;i++) + sp[i]=exc[i]; + + /* Signal synthesis */ + if (st->lpc_enh_enabled) + { + filter_mem2(sp, awk2, awk1, sp, st->subframeSize, st->lpcSize, + st->mem_sp+st->lpcSize); + filter_mem2(sp, awk3, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } else { + for (i=0;ilpcSize;i++) + st->mem_sp[st->lpcSize+i] = 0; + iir_mem2(sp, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } + } + + for (i=0;iframeSize;i++) + { + spx_word32_t sig = PSHR32(st->frame[i],SIG_SHIFT); + if (sig>32767) + sig = 32767; + if (sig<-32767) + sig = -32767; + out[i]=sig; + } + + st->first = 0; + st->count_lost++; + st->pitch_gain_buf[st->pitch_gain_buf_idx++] = GAIN_SCALING*pitch_gain; + if (st->pitch_gain_buf_idx > 2) /* rollover */ + st->pitch_gain_buf_idx = 0; +} + +int nb_decode(void *state, SpeexBits *bits, void *vout) +{ + DecState *st; + int i, sub; + int pitch; + spx_word16_t pitch_gain[3]; + spx_word32_t ol_gain=0; + int ol_pitch=0; + spx_word16_t ol_pitch_coef=0; + int best_pitch=40; + spx_word16_t best_pitch_gain=0; + int wideband; + int m; + char *stack; + VARDECL(spx_coef_t *awk1); + VARDECL(spx_coef_t *awk2); + VARDECL(spx_coef_t *awk3); + spx_word16_t pitch_average=0; +#ifdef EPIC_48K + int pitch_half[2]; + int ol_pitch_id=0; +#endif + spx_word16_t *out = vout; + + st=(DecState*)state; + stack=st->stack; + + if (st->encode_submode) + { +#ifdef EPIC_48K + if (!st->lbr_48k) { +#endif + + /* Check if we're in DTX mode*/ + if (!bits && st->dtx_enabled) + { + st->submodeID=0; + } else + { + /* If bits is NULL, consider the packet to be lost (what could we do anyway) */ + if (!bits) + { + nb_decode_lost(st, out, stack); + return 0; + } + + /* Search for next narrowband block (handle requests, skip wideband blocks) */ + do { + if (speex_bits_remaining(bits)<5) + return -1; + wideband = speex_bits_unpack_unsigned(bits, 1); + if (wideband) /* Skip wideband block (for compatibility) */ + { + int submode; + int advance; + advance = submode = speex_bits_unpack_unsigned(bits, SB_SUBMODE_BITS); + speex_mode_query(&speex_wb_mode, SPEEX_SUBMODE_BITS_PER_FRAME, &advance); + if (advance < 0) + { + speex_warning ("Invalid wideband mode encountered. Corrupted stream?"); + return -2; + } + advance -= (SB_SUBMODE_BITS+1); + speex_bits_advance(bits, advance); + + if (speex_bits_remaining(bits)<5) + return -1; + wideband = speex_bits_unpack_unsigned(bits, 1); + if (wideband) + { + advance = submode = speex_bits_unpack_unsigned(bits, SB_SUBMODE_BITS); + speex_mode_query(&speex_wb_mode, SPEEX_SUBMODE_BITS_PER_FRAME, &advance); + if (advance < 0) + { + speex_warning ("Invalid wideband mode encountered: corrupted stream?"); + return -2; + } + advance -= (SB_SUBMODE_BITS+1); + speex_bits_advance(bits, advance); + wideband = speex_bits_unpack_unsigned(bits, 1); + if (wideband) + { + speex_warning ("More than two wideband layers found: corrupted stream?"); + return -2; + } + + } + } + if (speex_bits_remaining(bits)<4) + return -1; + /* FIXME: Check for overflow */ + m = speex_bits_unpack_unsigned(bits, 4); + if (m==15) /* We found a terminator */ + { + return -1; + } else if (m==14) /* Speex in-band request */ + { + int ret = speex_inband_handler(bits, st->speex_callbacks, state); + if (ret) + return ret; + } else if (m==13) /* User in-band request */ + { + int ret = st->user_callback.func(bits, state, st->user_callback.data); + if (ret) + return ret; + } else if (m>8) /* Invalid mode */ + { + speex_warning("Invalid mode encountered: corrupted stream?"); + return -2; + } + + } while (m>8); + + /* Get the sub-mode that was used */ + st->submodeID = m; + + } +#ifdef EPIC_48K + } +#endif + } + + /* Shift all buffers by one frame */ + speex_move(st->excBuf, st->excBuf+st->frameSize, (st->max_pitch + 1)*sizeof(spx_sig_t)); + + /* If null mode (no transmission), just set a couple things to zero*/ + if (st->submodes[st->submodeID] == NULL) + { + VARDECL(spx_coef_t *lpc); + ALLOC(lpc, 11, spx_coef_t); + bw_lpc(GAMMA_SCALING*.93, st->interp_qlpc, lpc, 10); + { + float innov_gain=0; + float pgain=GAIN_SCALING_1*st->last_pitch_gain; + if (pgain>.6) + pgain=.6; + innov_gain = compute_rms(st->innov, st->frameSize); + for (i=0;iframeSize;i++) + st->exc[i]=VERY_SMALL; + speex_rand_vec(innov_gain, st->exc, st->frameSize); + } + + + st->first=1; + + /* Final signal synthesis from excitation */ + iir_mem2(st->exc, lpc, st->frame, st->frameSize, st->lpcSize, st->mem_sp); + + for (i=0;iframeSize;i++) + { + spx_word32_t sig = PSHR32(st->frame[i],SIG_SHIFT); + if (sig>32767) + sig = 32767; + if (sig<-32767) + sig = -32767; + out[i]=sig; + } + + st->count_lost=0; + return 0; + } + + /* Unquantize LSPs */ + SUBMODE(lsp_unquant)(st->qlsp, st->lpcSize, bits); + + /*Damp memory if a frame was lost and the LSP changed too much*/ + if (st->count_lost) + { + float lsp_dist=0, fact; + for (i=0;ilpcSize;i++) + lsp_dist += fabs(st->old_qlsp[i] - st->qlsp[i]); + lsp_dist /= LSP_SCALING; + fact = .6*exp(-.2*lsp_dist); + for (i=0;i<2*st->lpcSize;i++) + st->mem_sp[i] = (spx_mem_t)(st->mem_sp[i]*fact); + } + + + /* Handle first frame and lost-packet case */ + if (st->first || st->count_lost) + { + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + } + +#ifdef EPIC_48K + if (st->lbr_48k) { + pitch_half[0] = st->min_pitch+speex_bits_unpack_unsigned(bits, 7); + pitch_half[1] = pitch_half[0]+speex_bits_unpack_unsigned(bits, 2)-1; + + ol_pitch_id = speex_bits_unpack_unsigned(bits, 3); + ol_pitch_coef=GAIN_SCALING*0.13514*ol_pitch_id; + + { + int qe; + qe = speex_bits_unpack_unsigned(bits, 4); + ol_gain = SIG_SCALING*exp((qe+2)/2.1),SIG_SHIFT; + } + + } else { +#endif + + /* Get open-loop pitch estimation for low bit-rate pitch coding */ + if (SUBMODE(lbr_pitch)!=-1) + { + ol_pitch = st->min_pitch+speex_bits_unpack_unsigned(bits, 7); + } + + if (SUBMODE(forced_pitch_gain)) + { + int quant; + quant = speex_bits_unpack_unsigned(bits, 4); + ol_pitch_coef=GAIN_SCALING*0.066667*quant; + } + + /* Get global excitation gain */ + { + int qe; + qe = speex_bits_unpack_unsigned(bits, 5); +#ifdef FIXED_POINT + ol_gain = MULT16_32_Q15(28406,ol_gain_table[qe]); +#else + ol_gain = SIG_SCALING*exp(qe/3.5); +#endif + } +#ifdef EPIC_48K + } +#endif + + ALLOC(awk1, st->lpcSize+1, spx_coef_t); + ALLOC(awk2, st->lpcSize+1, spx_coef_t); + ALLOC(awk3, st->lpcSize+1, spx_coef_t); + + if (st->submodeID==1) + { + int extra; + extra = speex_bits_unpack_unsigned(bits, 4); + + if (extra==15) + st->dtx_enabled=1; + else + st->dtx_enabled=0; + } + if (st->submodeID>1) + st->dtx_enabled=0; + + /*Loop on subframes */ + for (sub=0;subnbSubframes;sub++) + { + int offset; + spx_sig_t *sp, *exc; + spx_word16_t tmp; + +#ifdef EPIC_48K + if (st->lbr_48k) + { + if (sub*2 < st->nbSubframes) + ol_pitch = pitch_half[0]; + else + ol_pitch = pitch_half[1]; + } +#endif + + /* Offset relative to start of frame */ + offset = st->subframeSize*sub; + /* Original signal */ + sp=st->frame+offset; + /* Excitation */ + exc=st->exc+offset; + /* Excitation after post-filter*/ + + /* LSP interpolation (quantized and unquantized) */ + lsp_interpolate(st->old_qlsp, st->qlsp, st->interp_qlsp, st->lpcSize, sub, st->nbSubframes); + + /* Make sure the LSP's are stable */ + lsp_enforce_margin(st->interp_qlsp, st->lpcSize, LSP_MARGIN); + + + /* Compute interpolated LPCs (unquantized) */ + lsp_to_lpc(st->interp_qlsp, st->interp_qlpc, st->lpcSize, stack); + + /* Compute enhanced synthesis filter */ + if (st->lpc_enh_enabled) + { + bw_lpc(SUBMODE(lpc_enh_k1), st->interp_qlpc, awk1, st->lpcSize); + bw_lpc(SUBMODE(lpc_enh_k2), st->interp_qlpc, awk2, st->lpcSize); + bw_lpc(SUBMODE(lpc_enh_k3), st->interp_qlpc, awk3, st->lpcSize); + } + + /* Compute analysis filter at w=pi */ + { + spx_word32_t pi_g=st->interp_qlpc[0]; + for (i=1;i<=st->lpcSize;i+=2) + { + /*pi_g += -st->interp_qlpc[i] + st->interp_qlpc[i+1];*/ + pi_g = ADD32(pi_g, SUB32(st->interp_qlpc[i+1],st->interp_qlpc[i])); + } + st->pi_gain[sub] = pi_g; + } + + /* Reset excitation */ + for (i=0;isubframeSize;i++) + exc[i]=0; + + /*Adaptive codebook contribution*/ + if (SUBMODE(ltp_unquant)) + { + int pit_min, pit_max; + /* Handle pitch constraints if any */ + if (SUBMODE(lbr_pitch) != -1) + { + int margin; + margin = SUBMODE(lbr_pitch); + if (margin) + { +/* GT - need optimization? + if (ol_pitch < st->min_pitch+margin-1) + ol_pitch=st->min_pitch+margin-1; + if (ol_pitch > st->max_pitch-margin) + ol_pitch=st->max_pitch-margin; + pit_min = ol_pitch-margin+1; + pit_max = ol_pitch+margin; +*/ + pit_min = ol_pitch-margin+1; + if (pit_min < st->min_pitch) + pit_min = st->min_pitch; + pit_max = ol_pitch+margin; + if (pit_max > st->max_pitch) + pit_max = st->max_pitch; + } else { + pit_min = pit_max = ol_pitch; + } + } else { + pit_min = st->min_pitch; + pit_max = st->max_pitch; + } + + +#ifdef EPIC_48K + if (st->lbr_48k) + { + SUBMODE(ltp_unquant)(exc, pit_min, pit_max, ol_pitch_coef, SUBMODE(ltp_params), + st->subframeSize, &pitch, &pitch_gain[0], bits, stack, + st->count_lost, offset, st->last_pitch_gain, ol_pitch_id); + } else { +#endif + + SUBMODE(ltp_unquant)(exc, pit_min, pit_max, ol_pitch_coef, SUBMODE(ltp_params), + st->subframeSize, &pitch, &pitch_gain[0], bits, stack, + st->count_lost, offset, st->last_pitch_gain, 0); + +#ifdef EPIC_48K + } +#endif + + + /* If we had lost frames, check energy of last received frame */ + if (st->count_lost && ol_gain < st->last_ol_gain) + { + float fact = (float)ol_gain/(st->last_ol_gain+1); + for (i=0;isubframeSize;i++) + exc[i]*=fact; + } + + tmp = gain_3tap_to_1tap(pitch_gain); + + pitch_average += tmp; + if (tmp>best_pitch_gain) + { + best_pitch = pitch; + best_pitch_gain = tmp; + } + } else { + speex_error("No pitch prediction, what's wrong"); + } + + /* Unquantize the innovation */ + { + int q_energy; + spx_word32_t ener; + spx_sig_t *innov; + + innov = st->innov+sub*st->subframeSize; + for (i=0;isubframeSize;i++) + innov[i]=0; + + /* Decode sub-frame gain correction */ + if (SUBMODE(have_subframe_gain)==3) + { + q_energy = speex_bits_unpack_unsigned(bits, 3); + ener = MULT16_32_Q14(exc_gain_quant_scal3[q_energy],ol_gain); + } else if (SUBMODE(have_subframe_gain)==1) + { + q_energy = speex_bits_unpack_unsigned(bits, 1); + ener = MULT16_32_Q14(exc_gain_quant_scal1[q_energy],ol_gain); + } else { + ener = ol_gain; + } + + if (SUBMODE(innovation_unquant)) + { + /*Fixed codebook contribution*/ + SUBMODE(innovation_unquant)(innov, SUBMODE(innovation_params), st->subframeSize, bits, stack); + } else { + speex_error("No fixed codebook"); + } + + /* De-normalize innovation and update excitation */ +#ifdef FIXED_POINT + signal_mul(innov, innov, ener, st->subframeSize); +#else + signal_mul(innov, innov, ener, st->subframeSize); +#endif + /*Vocoder mode*/ + if (st->submodeID==1) + { + float g=ol_pitch_coef*GAIN_SCALING_1; + + + for (i=0;isubframeSize;i++) + exc[i]=0; + while (st->voc_offsetsubframeSize) + { + if (st->voc_offset>=0) + exc[st->voc_offset]=SIG_SCALING*sqrt(1.0*ol_pitch); + st->voc_offset+=ol_pitch; + } + st->voc_offset -= st->subframeSize; + + g=.5+2*(g-.6); + if (g<0) + g=0; + if (g>1) + g=1; + for (i=0;isubframeSize;i++) + { + float exci=exc[i]; + exc[i]=.8*g*exc[i]*ol_gain/SIG_SCALING + .6*g*st->voc_m1*ol_gain/SIG_SCALING + .5*g*innov[i] - .5*g*st->voc_m2 + (1-g)*innov[i]; + st->voc_m1 = exci; + st->voc_m2=innov[i]; + st->voc_mean = .95*st->voc_mean + .05*exc[i]; + exc[i]-=st->voc_mean; + } + } else { + for (i=0;isubframeSize;i++) + exc[i]=ADD32(exc[i],innov[i]); + /*print_vec(exc, 40, "innov");*/ + } + /* Decode second codebook (only for some modes) */ + if (SUBMODE(double_codebook)) + { + char *tmp_stack=stack; + VARDECL(spx_sig_t *innov2); + ALLOC(innov2, st->subframeSize, spx_sig_t); + for (i=0;isubframeSize;i++) + innov2[i]=0; + SUBMODE(innovation_unquant)(innov2, SUBMODE(innovation_params), st->subframeSize, bits, stack); + signal_mul(innov2, innov2, (spx_word32_t) (ener*(1/2.2)), st->subframeSize); + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i],innov2[i]); + stack = tmp_stack; + } + + } + + for (i=0;isubframeSize;i++) + sp[i]=exc[i]; + + /* Signal synthesis */ + if (st->lpc_enh_enabled && SUBMODE(comb_gain)>0) + comb_filter(exc, sp, st->interp_qlpc, st->lpcSize, st->subframeSize, + pitch, pitch_gain, SUBMODE(comb_gain), st->comb_mem); + + if (st->lpc_enh_enabled) + { + /* Use enhanced LPC filter */ + filter_mem2(sp, awk2, awk1, sp, st->subframeSize, st->lpcSize, + st->mem_sp+st->lpcSize); + filter_mem2(sp, awk3, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } else { + /* Use regular filter */ + for (i=0;ilpcSize;i++) + st->mem_sp[st->lpcSize+i] = 0; + iir_mem2(sp, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } + } + + /*Copy output signal*/ + for (i=0;iframeSize;i++) + { + spx_word32_t sig = PSHR32(st->frame[i],SIG_SHIFT); + if (sig>32767) + sig = 32767; + if (sig<-32767) + sig = -32767; + out[i]=sig; + } + + /*for (i=0;iframeSize;i++) + printf ("%d\n", (int)st->frame[i]);*/ + + /* Store the LSPs for interpolation in the next frame */ + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + + /* The next frame will not be the first (Duh!) */ + st->first = 0; + st->count_lost=0; + st->last_pitch = best_pitch; +#ifdef FIXED_POINT + st->last_pitch_gain = PSHR16(pitch_average,2); +#else + st->last_pitch_gain = .25*pitch_average; +#endif + st->pitch_gain_buf[st->pitch_gain_buf_idx++] = st->last_pitch_gain; + if (st->pitch_gain_buf_idx > 2) /* rollover */ + st->pitch_gain_buf_idx = 0; + + st->last_ol_gain = ol_gain; + + return 0; +} + +int nb_encoder_ctl(void *state, int request, void *ptr) +{ + EncState *st; + st=(EncState*)state; + switch(request) + { + case SPEEX_GET_FRAME_SIZE: + (*(int*)ptr) = st->frameSize; + break; + case SPEEX_SET_LOW_MODE: + case SPEEX_SET_MODE: + st->submodeSelect = st->submodeID = (*(int*)ptr); + break; + case SPEEX_GET_LOW_MODE: + case SPEEX_GET_MODE: + (*(int*)ptr) = st->submodeID; + break; + case SPEEX_SET_VBR: + st->vbr_enabled = (*(int*)ptr); + break; + case SPEEX_GET_VBR: + (*(int*)ptr) = st->vbr_enabled; + break; + case SPEEX_SET_VAD: + st->vad_enabled = (*(int*)ptr); + break; + case SPEEX_GET_VAD: + (*(int*)ptr) = st->vad_enabled; + break; + case SPEEX_SET_DTX: + st->dtx_enabled = (*(int*)ptr); + break; + case SPEEX_GET_DTX: + (*(int*)ptr) = st->dtx_enabled; + break; + case SPEEX_SET_ABR: + st->abr_enabled = (*(int*)ptr); + st->vbr_enabled = 1; + { + int i=10, rate, target; + float vbr_qual; + target = (*(int*)ptr); + while (i>=0) + { + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &i); + speex_encoder_ctl(st, SPEEX_GET_BITRATE, &rate); + if (rate <= target) + break; + i--; + } + vbr_qual=i; + if (vbr_qual<0) + vbr_qual=0; + speex_encoder_ctl(st, SPEEX_SET_VBR_QUALITY, &vbr_qual); + st->abr_count=0; + st->abr_drift=0; + st->abr_drift2=0; + } + + break; + case SPEEX_GET_ABR: + (*(int*)ptr) = st->abr_enabled; + break; + case SPEEX_SET_VBR_QUALITY: + st->vbr_quality = (*(float*)ptr); + break; + case SPEEX_GET_VBR_QUALITY: + (*(float*)ptr) = st->vbr_quality; + break; + case SPEEX_SET_QUALITY: + { + int quality = (*(int*)ptr); + if (quality < 0) + quality = 0; + if (quality > 10) + quality = 10; + st->submodeSelect = st->submodeID = ((const SpeexNBMode*)(st->mode->mode))->quality_map[quality]; + } + break; + case SPEEX_SET_COMPLEXITY: + st->complexity = (*(int*)ptr); + if (st->complexity<0) + st->complexity=0; + break; + case SPEEX_GET_COMPLEXITY: + (*(int*)ptr) = st->complexity; + break; + case SPEEX_SET_BITRATE: + { + int i=10, rate, target; + target = (*(int*)ptr); + while (i>=0) + { + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &i); + speex_encoder_ctl(st, SPEEX_GET_BITRATE, &rate); + if (rate <= target) + break; + i--; + } + } + break; + case SPEEX_GET_BITRATE: + if (st->submodes[st->submodeID]) + (*(int*)ptr) = st->sampling_rate*SUBMODE(bits_per_frame)/st->frameSize; + else + (*(int*)ptr) = st->sampling_rate*(NB_SUBMODE_BITS+1)/st->frameSize; + break; + case SPEEX_SET_SAMPLING_RATE: + st->sampling_rate = (*(int*)ptr); + break; + case SPEEX_GET_SAMPLING_RATE: + (*(int*)ptr)=st->sampling_rate; + break; + case SPEEX_RESET_STATE: + { + int i; + st->bounded_pitch = 1; + st->first = 1; + for (i=0;ilpcSize;i++) + st->lsp[i]=(M_PI*((float)(i+1)))/(st->lpcSize+1); + for (i=0;ilpcSize;i++) + st->mem_sw[i]=st->mem_sw_whole[i]=st->mem_sp[i]=st->mem_exc[i]=0; + for (i=0;iframeSize+st->max_pitch+1;i++) + st->excBuf[i]=st->swBuf[i]=0; + for (i=0;iwindowSize;i++) + st->inBuf[i]=0; + } + break; + case SPEEX_SET_SUBMODE_ENCODING: + st->encode_submode = (*(int*)ptr); + break; + case SPEEX_GET_SUBMODE_ENCODING: + (*(int*)ptr) = st->encode_submode; + break; + case SPEEX_GET_LOOKAHEAD: + (*(int*)ptr)=(st->windowSize-st->frameSize); + break; + case SPEEX_SET_PLC_TUNING: + st->plc_tuning = (*(int*)ptr); + if (st->plc_tuning>100) + st->plc_tuning=100; + break; + case SPEEX_GET_PLC_TUNING: + (*(int*)ptr)=(st->plc_tuning); + break; + case SPEEX_GET_PI_GAIN: + { + int i; + spx_word32_t *g = (spx_word32_t*)ptr; + for (i=0;inbSubframes;i++) + g[i]=st->pi_gain[i]; + } + break; + case SPEEX_GET_EXC: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;iframeSize;i++) + e[i]=st->exc[i]; + } + break; + case SPEEX_GET_INNOV: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;iframeSize;i++) + e[i]=st->innov[i]; + } + break; + case SPEEX_GET_RELATIVE_QUALITY: + (*(float*)ptr)=st->relative_quality; + break; + default: + speex_warning_int("Unknown nb_ctl request: ", request); + return -1; + } + return 0; +} + +int nb_decoder_ctl(void *state, int request, void *ptr) +{ + DecState *st; + st=(DecState*)state; + switch(request) + { + case SPEEX_SET_LOW_MODE: + case SPEEX_SET_MODE: + st->submodeID = (*(int*)ptr); + break; + case SPEEX_GET_LOW_MODE: + case SPEEX_GET_MODE: + (*(int*)ptr) = st->submodeID; + break; + case SPEEX_SET_ENH: + st->lpc_enh_enabled = *((int*)ptr); + break; + case SPEEX_GET_ENH: + *((int*)ptr) = st->lpc_enh_enabled; + break; + case SPEEX_GET_FRAME_SIZE: + (*(int*)ptr) = st->frameSize; + break; + case SPEEX_GET_BITRATE: + if (st->submodes[st->submodeID]) + (*(int*)ptr) = st->sampling_rate*SUBMODE(bits_per_frame)/st->frameSize; + else + (*(int*)ptr) = st->sampling_rate*(NB_SUBMODE_BITS+1)/st->frameSize; + break; + case SPEEX_SET_SAMPLING_RATE: + st->sampling_rate = (*(int*)ptr); + break; + case SPEEX_GET_SAMPLING_RATE: + (*(int*)ptr)=st->sampling_rate; + break; + case SPEEX_SET_HANDLER: + { + SpeexCallback *c = (SpeexCallback*)ptr; + st->speex_callbacks[c->callback_id].func=c->func; + st->speex_callbacks[c->callback_id].data=c->data; + st->speex_callbacks[c->callback_id].callback_id=c->callback_id; + } + break; + case SPEEX_SET_USER_HANDLER: + { + SpeexCallback *c = (SpeexCallback*)ptr; + st->user_callback.func=c->func; + st->user_callback.data=c->data; + st->user_callback.callback_id=c->callback_id; + } + break; + case SPEEX_RESET_STATE: + { + int i; + for (i=0;i<2*st->lpcSize;i++) + st->mem_sp[i]=0; + for (i=0;iframeSize + st->max_pitch + 1;i++) + st->excBuf[i]=0; + for (i=0;iframeSize;i++) + st->inBuf[i] = 0; + } + break; + case SPEEX_SET_SUBMODE_ENCODING: + st->encode_submode = (*(int*)ptr); + break; + case SPEEX_GET_SUBMODE_ENCODING: + (*(int*)ptr) = st->encode_submode; + break; + case SPEEX_GET_PI_GAIN: + { + int i; + spx_word32_t *g = (spx_word32_t*)ptr; + for (i=0;inbSubframes;i++) + g[i]=st->pi_gain[i]; + } + break; + case SPEEX_GET_EXC: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;iframeSize;i++) + e[i]=st->exc[i]; + } + break; + case SPEEX_GET_INNOV: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;iframeSize;i++) + e[i]=st->innov[i]; + } + break; + case SPEEX_GET_DTX_STATUS: + *((int*)ptr) = st->dtx_enabled; + break; + default: + speex_warning_int("Unknown nb_ctl request: ", request); + return -1; + } + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/nb_celp.h b/3rdparty/iaxclient-2/lib/libspeex/nb_celp.h new file mode 100644 index 0000000..5f2675f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/nb_celp.h @@ -0,0 +1,199 @@ +/* Copyright (C) 2002 Jean-Marc Valin */ +/** + @file nb_celp.h + @brief Narrowband CELP encoder/decoder +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef NB_CELP_H +#define NB_CELP_H + +#include "modes.h" +#include +#include +#include "vbr.h" +#include "filters.h" + +/**Structure representing the full state of the narrowband encoder*/ +typedef struct EncState { + const SpeexMode *mode; /**< Mode corresponding to the state */ + int first; /**< Is this the first frame? */ + int frameSize; /**< Size of frames */ + int subframeSize; /**< Size of sub-frames */ + int nbSubframes; /**< Number of sub-frames */ + int windowSize; /**< Analysis (LPC) window length */ + int lpcSize; /**< LPC order */ + int min_pitch; /**< Minimum pitch value allowed */ + int max_pitch; /**< Maximum pitch value allowed */ + + int safe_pitch; /**< Don't use too large values for pitch (in case we lose a packet) */ + int bounded_pitch; /**< Next frame should not rely on previous frames for pitch */ + int ol_pitch; /**< Open-loop pitch */ + int ol_voiced; /**< Open-loop voiced/non-voiced decision */ + int *pitch; + +#ifdef EPIC_48K + int lbr_48k; +#endif + + spx_word16_t gamma1; /**< Perceptual filter: A(z/gamma1) */ + spx_word16_t gamma2; /**< Perceptual filter: A(z/gamma2) */ + float lag_factor; /**< Lag windowing Gaussian width */ + float lpc_floor; /**< Noise floor multiplier for A[0] in LPC analysis*/ + char *stack; /**< Pseudo-stack allocation for temporary memory */ + spx_sig_t *inBuf; /**< Input buffer (original signal) */ + spx_sig_t *frame; /**< Start of original frame */ + spx_sig_t *excBuf; /**< Excitation buffer */ + spx_sig_t *exc; /**< Start of excitation frame */ + spx_sig_t *swBuf; /**< Weighted signal buffer */ + spx_sig_t *sw; /**< Start of weighted signal frame */ + spx_sig_t *innov; /**< Innovation for the frame */ + spx_word16_t *window; /**< Temporary (Hanning) window */ + spx_word16_t *autocorr; /**< auto-correlation */ + spx_word16_t *lagWindow; /**< Window applied to auto-correlation */ + spx_coef_t *lpc; /**< LPCs for current frame */ + spx_lsp_t *lsp; /**< LSPs for current frame */ + spx_lsp_t *qlsp; /**< Quantized LSPs for current frame */ + spx_lsp_t *old_lsp; /**< LSPs for previous frame */ + spx_lsp_t *old_qlsp; /**< Quantized LSPs for previous frame */ + spx_lsp_t *interp_lsp; /**< Interpolated LSPs */ + spx_lsp_t *interp_qlsp; /**< Interpolated quantized LSPs */ + spx_coef_t *interp_lpc; /**< Interpolated LPCs */ + spx_coef_t *interp_qlpc; /**< Interpolated quantized LPCs */ + spx_coef_t *bw_lpc1; /**< LPCs after bandwidth expansion by gamma1 for perceptual weighting*/ + spx_coef_t *bw_lpc2; /**< LPCs after bandwidth expansion by gamma2 for perceptual weighting*/ + spx_mem_t *mem_sp; /**< Filter memory for signal synthesis */ + spx_mem_t *mem_sw; /**< Filter memory for perceptually-weighted signal */ + spx_mem_t *mem_sw_whole; /**< Filter memory for perceptually-weighted signal (whole frame)*/ + spx_mem_t *mem_exc; /**< Filter memory for excitation (whole frame) */ + spx_word32_t *pi_gain; /**< Gain of LPC filter at theta=pi (fe/2) */ + + VBRState *vbr; /**< State of the VBR data */ + float vbr_quality; /**< Quality setting for VBR encoding */ + float relative_quality; /**< Relative quality that will be needed by VBR */ + int vbr_enabled; /**< 1 for enabling VBR, 0 otherwise */ + int vad_enabled; /**< 1 for enabling VAD, 0 otherwise */ + int dtx_enabled; /**< 1 for enabling DTX, 0 otherwise */ + int dtx_count; /**< Number of consecutive DTX frames */ + int abr_enabled; /**< ABR setting (in bps), 0 if off */ + float abr_drift; + float abr_drift2; + float abr_count; + int complexity; /**< Complexity setting (0-10 from least complex to most complex) */ + int sampling_rate; + int plc_tuning; + int encode_submode; + const SpeexSubmode * const *submodes; /**< Sub-mode data */ + int submodeID; /**< Activated sub-mode */ + int submodeSelect; /**< Mode chosen by the user (may differ from submodeID if VAD is on) */ +} EncState; + +/**Structure representing the full state of the narrowband decoder*/ +typedef struct DecState { + const SpeexMode *mode; /**< Mode corresponding to the state */ + int first; /**< Is this the first frame? */ + int count_lost; /**< Was the last frame lost? */ + int frameSize; /**< Size of frames */ + int subframeSize; /**< Size of sub-frames */ + int nbSubframes; /**< Number of sub-frames */ + int lpcSize; /**< LPC order */ + int min_pitch; /**< Minimum pitch value allowed */ + int max_pitch; /**< Maximum pitch value allowed */ + int sampling_rate; + +#ifdef EPIC_48K + int lbr_48k; +#endif + + spx_word16_t last_ol_gain; /**< Open-loop gain for previous frame */ + + char *stack; /**< Pseudo-stack allocation for temporary memory */ + spx_sig_t *inBuf; /**< Input buffer (original signal) */ + spx_sig_t *frame; /**< Start of original frame */ + spx_sig_t *excBuf; /**< Excitation buffer */ + spx_sig_t *exc; /**< Start of excitation frame */ + spx_sig_t *innov; /**< Innovation for the frame */ + spx_lsp_t *qlsp; /**< Quantized LSPs for current frame */ + spx_lsp_t *old_qlsp; /**< Quantized LSPs for previous frame */ + spx_lsp_t *interp_qlsp; /**< Interpolated quantized LSPs */ + spx_coef_t *interp_qlpc; /**< Interpolated quantized LPCs */ + spx_mem_t *mem_sp; /**< Filter memory for synthesis signal */ + spx_word32_t *pi_gain; /**< Gain of LPC filter at theta=pi (fe/2) */ + int last_pitch; /**< Pitch of last correctly decoded frame */ + spx_word16_t last_pitch_gain; /**< Pitch gain of last correctly decoded frame */ + spx_word16_t pitch_gain_buf[3]; /**< Pitch gain of last decoded frames */ + int pitch_gain_buf_idx; /**< Tail of the buffer */ + + int encode_submode; + const SpeexSubmode * const *submodes; /**< Sub-mode data */ + int submodeID; /**< Activated sub-mode */ + int lpc_enh_enabled; /**< 1 when LPC enhancer is on, 0 otherwise */ + CombFilterMem *comb_mem; + SpeexCallback speex_callbacks[SPEEX_MAX_CALLBACKS]; + + SpeexCallback user_callback; + + /*Vocoder data*/ + float voc_m1; + float voc_m2; + float voc_mean; + int voc_offset; + + int dtx_enabled; +} DecState; + +/** Initializes encoder state*/ +void *nb_encoder_init(const SpeexMode *m); + +/** De-allocates encoder state resources*/ +void nb_encoder_destroy(void *state); + +/** Encodes one frame*/ +int nb_encode(void *state, void *in, SpeexBits *bits); + + +/** Initializes decoder state*/ +void *nb_decoder_init(const SpeexMode *m); + +/** De-allocates decoder state resources*/ +void nb_decoder_destroy(void *state); + +/** Decodes one frame*/ +int nb_decode(void *state, SpeexBits *bits, void *out); + +/** ioctl-like function for controlling a narrowband encoder */ +int nb_encoder_ctl(void *state, int request, void *ptr); + +/** ioctl-like function for controlling a narrowband decoder */ +int nb_decoder_ctl(void *state, int request, void *ptr); + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/preprocess.c b/3rdparty/iaxclient-2/lib/libspeex/preprocess.c new file mode 100644 index 0000000..f643895 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/preprocess.c @@ -0,0 +1,1074 @@ +/* Copyright (C) 2003 Epic Games + Written by Jean-Marc Valin + + File: preprocess.c + Preprocessor with denoising based on the algorithm by Ephraim and Malah + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The name of the author may not be used to endorse or promote products + derived from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "speex/speex_preprocess.h" +#include "misc.h" +#include "smallft.h" + +#define max(a,b) ((a) > (b) ? (a) : (b)) +#define min(a,b) ((a) < (b) ? (a) : (b)) + +#ifndef M_PI +#define M_PI 3.14159263 +#endif + +#define SQRT_M_PI_2 0.88623 +#define LOUDNESS_EXP 2.5 + +#define SPEEX_PROB_START_DEFAULT 0.35f +#define SPEEX_PROB_CONTINUE_DEFAULT 0.20f + +#define NB_BANDS 8 + +#define ZMIN .1 +#define ZMAX .316 +#define ZMIN_1 10 +#define LOG_MIN_MAX_1 0.86859 + +static void conj_window(float *w, int len) +{ + int i; + for (i=0;i9.5) + return 1+.12/x; + + integer = floor(2*x); + frac = 2*x-integer; + ind = (int)integer; + /*if (ind > 20 || ind < 0) + fprintf (stderr, "error: %d %f\n", ind, x);*/ + return ((1-frac)*table[ind] + frac*table[ind+1])/sqrt(x+.0001f); +} + +SpeexPreprocessState *speex_preprocess_state_init(int frame_size, int sampling_rate) +{ + int i; + int N, N3, N4; + + SpeexPreprocessState *st = (SpeexPreprocessState *)speex_alloc(sizeof(SpeexPreprocessState)); + st->frame_size = frame_size; + + /* Round ps_size down to the nearest power of two */ +#if 0 + i=1; + st->ps_size = st->frame_size; + while(1) + { + if (st->ps_size & ~i) + { + st->ps_size &= ~i; + i<<=1; + } else { + break; + } + } + + + if (st->ps_size < 3*st->frame_size/4) + st->ps_size = st->ps_size * 3 / 2; +#else + st->ps_size = st->frame_size; +#endif + + N = st->ps_size; + N3 = 2*N - st->frame_size; + N4 = st->frame_size - N3; + + st->sampling_rate = sampling_rate; + st->denoise_enabled = 1; + st->agc_enabled = 0; + st->agc_level = 8000; + st->vad_enabled = 0; + st->dereverb_enabled = 0; + st->reverb_decay = .5; + st->reverb_level = .2; + + st->speech_prob_start = SPEEX_PROB_START_DEFAULT; + st->speech_prob_continue = SPEEX_PROB_CONTINUE_DEFAULT; + + st->frame = (float*)speex_alloc(2*N*sizeof(float)); + st->ps = (float*)speex_alloc(N*sizeof(float)); + st->gain2 = (float*)speex_alloc(N*sizeof(float)); + st->window = (float*)speex_alloc(2*N*sizeof(float)); + st->noise = (float*)speex_alloc(N*sizeof(float)); + st->reverb_estimate = (float*)speex_alloc(N*sizeof(float)); + st->old_ps = (float*)speex_alloc(N*sizeof(float)); + st->gain = (float*)speex_alloc(N*sizeof(float)); + st->prior = (float*)speex_alloc(N*sizeof(float)); + st->post = (float*)speex_alloc(N*sizeof(float)); + st->loudness_weight = (float*)speex_alloc(N*sizeof(float)); + st->inbuf = (float*)speex_alloc(N3*sizeof(float)); + st->outbuf = (float*)speex_alloc(N3*sizeof(float)); + st->echo_noise = (float*)speex_alloc(N*sizeof(float)); + + st->S = (float*)speex_alloc(N*sizeof(float)); + st->Smin = (float*)speex_alloc(N*sizeof(float)); + st->Stmp = (float*)speex_alloc(N*sizeof(float)); + st->update_prob = (float*)speex_alloc(N*sizeof(float)); + + st->zeta = (float*)speex_alloc(N*sizeof(float)); + st->Zpeak = 0; + st->Zlast = 0; + + st->noise_bands = (float*)speex_alloc(NB_BANDS*sizeof(float)); + st->noise_bands2 = (float*)speex_alloc(NB_BANDS*sizeof(float)); + st->speech_bands = (float*)speex_alloc(NB_BANDS*sizeof(float)); + st->speech_bands2 = (float*)speex_alloc(NB_BANDS*sizeof(float)); + st->noise_bandsN = st->speech_bandsN = 1; + + conj_window(st->window, 2*N3); + for (i=2*N3;i<2*st->ps_size;i++) + st->window[i]=1; + + if (N4>0) + { + for (i=N3-1;i>=0;i--) + { + st->window[i+N3+N4]=st->window[i+N3]; + st->window[i+N3]=1; + } + } + for (i=0;inoise[i]=1e4; + st->reverb_estimate[i]=0.; + st->old_ps[i]=1e4; + st->gain[i]=1; + st->post[i]=1; + st->prior[i]=1; + } + + for (i=0;iinbuf[i]=0; + st->outbuf[i]=0; + } + + for (i=0;iloudness_weight[i] = .35f-.35f*ff/16000.f+.73f*exp(-.5f*(ff-3800)*(ff-3800)/9e5f); + if (st->loudness_weight[i]<.01f) + st->loudness_weight[i]=.01f; + st->loudness_weight[i] *= st->loudness_weight[i]; + } + + st->speech_prob = 0; + st->last_speech = 1000; + st->loudness = pow(6000,LOUDNESS_EXP); + st->loudness2 = 6000; + st->nb_loudness_adapt = 0; + + st->fft_lookup = (struct drft_lookup*)speex_alloc(sizeof(struct drft_lookup)); + spx_drft_init(st->fft_lookup,2*N); + + st->nb_adapt=0; + st->consec_noise=0; + st->nb_preprocess=0; + return st; +} + +void speex_preprocess_state_destroy(SpeexPreprocessState *st) +{ + speex_free(st->frame); + speex_free(st->ps); + speex_free(st->gain2); + speex_free(st->window); + speex_free(st->noise); + speex_free(st->reverb_estimate); + speex_free(st->old_ps); + speex_free(st->gain); + speex_free(st->prior); + speex_free(st->post); + speex_free(st->loudness_weight); + speex_free(st->echo_noise); + + speex_free(st->S); + speex_free(st->Smin); + speex_free(st->Stmp); + speex_free(st->update_prob); + speex_free(st->zeta); + + speex_free(st->noise_bands); + speex_free(st->noise_bands2); + speex_free(st->speech_bands); + speex_free(st->speech_bands2); + + speex_free(st->inbuf); + speex_free(st->outbuf); + + spx_drft_clear(st->fft_lookup); + speex_free(st->fft_lookup); + + speex_free(st); +} + +static void update_noise(SpeexPreprocessState *st, float *ps, float *echo) +{ + int i; + float beta; + st->nb_adapt++; + beta=1.0f/st->nb_adapt; + if (beta < .05f) + beta=.05f; + + if (!echo) + { + for (i=0;ips_size;i++) + st->noise[i] = (1.f-beta)*st->noise[i] + beta*ps[i]; + } else { + for (i=0;ips_size;i++) + st->noise[i] = (1.f-beta)*st->noise[i] + beta*max(1.f,ps[i]-echo[i]); +#if 0 + for (i=0;ips_size;i++) + st->noise[i] = 0; +#endif + } +} + +static int speex_compute_vad(SpeexPreprocessState *st, float *ps, float mean_prior, float mean_post) +{ + int i, is_speech=0; + int N = st->ps_size; + float scale=.5f/N; + + /* FIXME: Clean this up a bit */ + { + float bands[NB_BANDS]; + int j; + float p0, p1; + float tot_loudness=0; + float x = sqrt(mean_post); + + for (i=5;ips[i] * st->loudness_weight[i]; + } + + for (i=0;ispeech_prob + .01*(1-st->speech_prob); + p1 *= .01*st->speech_prob + .99*(1-st->speech_prob); + + st->speech_prob = p0/(p1+p0); + */ + + if (st->noise_bandsN < 50 || st->speech_bandsN < 50) + { + if (mean_post > 5.f) + { + float adapt = 1./st->speech_bandsN++; + if (adapt<.005f) + adapt = .005f; + for (i=0;ispeech_bands[i] = (1.f-adapt)*st->speech_bands[i] + adapt*bands[i]; + /*st->speech_bands2[i] = (1-adapt)*st->speech_bands2[i] + adapt*bands[i]*bands[i];*/ + st->speech_bands2[i] = (1.f-adapt)*st->speech_bands2[i] + adapt*(bands[i]-st->speech_bands[i])*(bands[i]-st->speech_bands[i]); + } + } else { + float adapt = 1./st->noise_bandsN++; + if (adapt<.005f) + adapt = .005f; + for (i=0;inoise_bands[i] = (1.f-adapt)*st->noise_bands[i] + adapt*bands[i]; + /*st->noise_bands2[i] = (1-adapt)*st->noise_bands2[i] + adapt*bands[i]*bands[i];*/ + st->noise_bands2[i] = (1.f-adapt)*st->noise_bands2[i] + adapt*(bands[i]-st->noise_bands[i])*(bands[i]-st->noise_bands[i]); + } + } + } + p0=p1=1; + for (i=0;inoise_bands2[i] - st->noise_bands[i]*st->noise_bands[i]; + speech_var = 1.01*st->speech_bands2[i] - st->speech_bands[i]*st->speech_bands[i];*/ + noise_var = st->noise_bands2[i]; + speech_var = st->speech_bands2[i]; + if (noise_var < .1f) + noise_var = .1f; + if (speech_var < .1f) + speech_var = .1f; + + /*speech_var = sqrt(speech_var*noise_var); + noise_var = speech_var;*/ + if (speech_var < .05f*speech_var) + noise_var = .05f*speech_var; + if (speech_var < .05f*noise_var) + speech_var = .05f*noise_var; + + if (bands[i] < st->noise_bands[i]) + speech_var = noise_var; + if (bands[i] > st->speech_bands[i]) + noise_var = speech_var; + + speech_mean = st->speech_bands[i]; + noise_mean = st->noise_bands[i]; + if (noise_mean < speech_mean - 5.f) + noise_mean = speech_mean - 5.f; + + tmp1 = exp(-.5f*(bands[i]-speech_mean)*(bands[i]-speech_mean)/speech_var)/sqrt(2.f*M_PI*speech_var); + tmp2 = exp(-.5f*(bands[i]-noise_mean)*(bands[i]-noise_mean)/noise_var)/sqrt(2.f*M_PI*noise_var); + /*fprintf (stderr, "%f ", (float)(p0/(.01+p0+p1)));*/ + /*fprintf (stderr, "%f ", (float)(bands[i]));*/ + pr = tmp1/(1e-25+tmp1+tmp2); + /*if (bands[i] < st->noise_bands[i]) + pr=.01; + if (bands[i] > st->speech_bands[i] && pr < .995) + pr=.995;*/ + if (pr>.999f) + pr=.999f; + if (pr<.001f) + pr=.001f; + /*fprintf (stderr, "%f ", pr);*/ + p0 *= pr; + p1 *= (1-pr); + } + + p0 = pow(p0,.2); + p1 = pow(p1,.2); + +#if 1 + p0 *= 2.f; + p0=p0/(p1+p0); + if (st->last_speech>20) + { + float tmp = sqrt(tot_loudness)/st->loudness2; + tmp = 1.f-exp(-10.f*tmp); + if (p0>tmp) + p0=tmp; + } + p1=1-p0; +#else + if (sqrt(tot_loudness) < .6f*st->loudness2 && p0>15.f*p1) + p0=15.f*p1; + if (sqrt(tot_loudness) < .45f*st->loudness2 && p0>7.f*p1) + p0=7.f*p1; + if (sqrt(tot_loudness) < .3f*st->loudness2 && p0>3.f*p1) + p0=3.f*p1; + if (sqrt(tot_loudness) < .15f*st->loudness2 && p0>p1) + p0=p1; + /*fprintf (stderr, "%f %f ", (float)(sqrt(tot_loudness) /( .25*st->loudness2)), p0/(p1+p0));*/ +#endif + + p0 *= .99f*st->speech_prob + .01f*(1-st->speech_prob); + p1 *= .01f*st->speech_prob + .99f*(1-st->speech_prob); + + st->speech_prob = p0/(1e-25f+p1+p0); + /*fprintf (stderr, "%f %f %f ", tot_loudness, st->loudness2, st->speech_prob);*/ + + if (st->speech_prob > st->speech_prob_start + || (st->last_speech < 20 && st->speech_prob > st->speech_prob_continue)) + { + is_speech = 1; + st->last_speech = 0; + } else { + st->last_speech++; + if (st->last_speech<20) + is_speech = 1; + } + + if (st->noise_bandsN > 50 && st->speech_bandsN > 50) + { + if (mean_post > 5) + { + float adapt = 1./st->speech_bandsN++; + if (adapt<.005f) + adapt = .005f; + for (i=0;ispeech_bands[i] = (1-adapt)*st->speech_bands[i] + adapt*bands[i]; + /*st->speech_bands2[i] = (1-adapt)*st->speech_bands2[i] + adapt*bands[i]*bands[i];*/ + st->speech_bands2[i] = (1-adapt)*st->speech_bands2[i] + adapt*(bands[i]-st->speech_bands[i])*(bands[i]-st->speech_bands[i]); + } + } else { + float adapt = 1./st->noise_bandsN++; + if (adapt<.005f) + adapt = .005f; + for (i=0;inoise_bands[i] = (1-adapt)*st->noise_bands[i] + adapt*bands[i]; + /*st->noise_bands2[i] = (1-adapt)*st->noise_bands2[i] + adapt*bands[i]*bands[i];*/ + st->noise_bands2[i] = (1-adapt)*st->noise_bands2[i] + adapt*(bands[i]-st->noise_bands[i])*(bands[i]-st->noise_bands[i]); + } + } + } + + + } + + return is_speech; +} + +static void speex_compute_agc(SpeexPreprocessState *st, float mean_prior) +{ + int i; + int N = st->ps_size; + float scale=.5f/N; + float agc_gain; + int freq_start, freq_end; + float active_bands = 0; + + freq_start = (int)(300.0f*2*N/st->sampling_rate); + freq_end = (int)(2000.0f*2*N/st->sampling_rate); + for (i=freq_start;iS[i] > 20.f*st->Smin[i]+1000.f) + active_bands+=1; + } + active_bands /= (freq_end-freq_start+1); + + if (active_bands > .2f) + { + float loudness=0.f; + float rate, rate2=.2f; + st->nb_loudness_adapt++; + rate=2.0f/(1+st->nb_loudness_adapt); + if (rate < .05f) + rate = .05f; + if (rate < .1f && pow(loudness, LOUDNESS_EXP) > st->loudness) + rate = .1f; + if (rate < .2f && pow(loudness, LOUDNESS_EXP) > 3.f*st->loudness) + rate = .2f; + if (rate < .4f && pow(loudness, LOUDNESS_EXP) > 10.f*st->loudness) + rate = .4f; + + for (i=2;ips[i] * st->gain2[i] * st->gain2[i] * st->loudness_weight[i]; + } + loudness=sqrt(loudness); + /*if (loudness < 2*pow(st->loudness, 1.0/LOUDNESS_EXP) && + loudness*2 > pow(st->loudness, 1.0/LOUDNESS_EXP))*/ + st->loudness = (1-rate)*st->loudness + (rate)*pow(loudness, LOUDNESS_EXP); + + st->loudness2 = (1-rate2)*st->loudness2 + rate2*pow(st->loudness, 1.0f/LOUDNESS_EXP); + + loudness = pow(st->loudness, 1.0f/LOUDNESS_EXP); + + /*fprintf (stderr, "%f %f %f\n", loudness, st->loudness2, rate);*/ + } + + agc_gain = st->agc_level/st->loudness2; + /*fprintf (stderr, "%f %f %f %f\n", active_bands, st->loudness, st->loudness2, agc_gain);*/ + if (agc_gain>200) + agc_gain = 200; + + for (i=0;igain2[i] *= agc_gain; + +} + +static void preprocess_analysis(SpeexPreprocessState *st, spx_int16_t *x) +{ + int i; + int N = st->ps_size; + int N3 = 2*N - st->frame_size; + int N4 = st->frame_size - N3; + float *ps=st->ps; + + /* 'Build' input frame */ + for (i=0;iframe[i]=st->inbuf[i]; + for (i=0;iframe_size;i++) + st->frame[N3+i]=x[i]; + + /* Update inbuf */ + for (i=0;iinbuf[i]=x[N4+i]; + + /* Windowing */ + for (i=0;i<2*N;i++) + st->frame[i] *= st->window[i]; + + /* Perform FFT */ + spx_drft_forward(st->fft_lookup, st->frame); + + /* Power spectrum */ + ps[0]=1; + for (i=1;iframe[2*i-1]*st->frame[2*i-1] + st->frame[2*i]*st->frame[2*i]; + +} + +static void update_noise_prob(SpeexPreprocessState *st) +{ + int i; + int N = st->ps_size; + + for (i=1;iS[i] = 100.f+ .8f*st->S[i] + .05f*st->ps[i-1]+.1f*st->ps[i]+.05f*st->ps[i+1]; + + if (st->nb_preprocess<1) + { + for (i=1;iSmin[i] = st->Stmp[i] = st->S[i]+100.f; + } + + if (st->nb_preprocess%200==0) + { + for (i=1;iSmin[i] = min(st->Stmp[i], st->S[i]); + st->Stmp[i] = st->S[i]; + } + } else { + for (i=1;iSmin[i] = min(st->Smin[i], st->S[i]); + st->Stmp[i] = min(st->Stmp[i], st->S[i]); + } + } + for (i=1;iupdate_prob[i] *= .2f; + if (st->S[i] > 2.5*st->Smin[i]) + st->update_prob[i] += .8f; + /*fprintf (stderr, "%f ", st->S[i]/st->Smin[i]);*/ + /*fprintf (stderr, "%f ", st->update_prob[i]);*/ + } + +} + +#define NOISE_OVERCOMPENS 1.4 + +int speex_preprocess(SpeexPreprocessState *st, spx_int16_t *x, float *echo) +{ + int i; + int is_speech=1; + float mean_post=0; + float mean_prior=0; + int N = st->ps_size; + int N3 = 2*N - st->frame_size; + int N4 = st->frame_size - N3; + float scale=.5f/N; + float *ps=st->ps; + float Zframe=0, Pframe; + + preprocess_analysis(st, x); + + update_noise_prob(st); + + st->nb_preprocess++; + + /* Noise estimation always updated for the 20 first times */ + if (st->nb_adapt<10) + { + update_noise(st, ps, echo); + } + + /* Deal with residual echo if provided */ + if (echo) + for (i=1;iecho_noise[i] = (.3f*st->echo_noise[i] + echo[i]); + + /* Compute a posteriori SNR */ + for (i=1;ipost[i] = ps[i]/(1.f+NOISE_OVERCOMPENS*st->noise[i]+st->echo_noise[i]+st->reverb_estimate[i]) - 1.f; + if (st->post[i]>100.f) + st->post[i]=100.f; + /*if (st->post[i]<0) + st->post[i]=0;*/ + mean_post+=st->post[i]; + } + mean_post /= N; + if (mean_post<0.f) + mean_post=0.f; + + /* Special case for first frame */ + if (st->nb_adapt==1) + for (i=1;iold_ps[i] = ps[i]; + + /* Compute a priori SNR */ + { + /* A priori update rate */ + float gamma; + float min_gamma=0.12f; + gamma = 1.0f/st->nb_preprocess; + + /*Make update rate smaller when there's no speech*/ +#if 0 + if (mean_post<3.5 && mean_prior < 1) + min_gamma *= (mean_post+.5); + else + min_gamma *= 4.; +#else + min_gamma = .1f*fabs(mean_prior - mean_post)*fabs(mean_prior - mean_post); + if (min_gamma>.15f) + min_gamma = .15f; + if (min_gamma<.02f) + min_gamma = .02f; +#endif + /*min_gamma = .08;*/ + + /*if (gammaprior[i] = gamma*max(0.0f,st->post[i]) + + (1.f-gamma)*st->gain[i]*st->gain[i]*st->old_ps[i]/(1.f+NOISE_OVERCOMPENS*st->noise[i]+st->echo_noise[i]+st->reverb_estimate[i]); + + if (st->prior[i]>100.f) + st->prior[i]=100.f; + + mean_prior+=st->prior[i]; + } + } + mean_prior /= N; + +#if 0 + for (i=0;iprior[i]); + } + fprintf (stderr, "\n"); +#endif + /*fprintf (stderr, "%f %f\n", mean_prior,mean_post);*/ + + if (st->nb_preprocess>=20) + { + int do_update = 0; + float noise_ener=0, sig_ener=0; + /* If SNR is low (both a priori and a posteriori), update the noise estimate*/ + /*if (mean_prior<.23 && mean_post < .5)*/ + if (mean_prior<.23f && mean_post < .5f) + do_update = 1; + for (i=1;inoise[i]; + sig_ener += ps[i]; + } + if (noise_ener > 3.f*sig_ener) + do_update = 1; + /*do_update = 0;*/ + if (do_update) + { + st->consec_noise++; + } else { + st->consec_noise=0; + } + } + + if (st->vad_enabled) + is_speech = speex_compute_vad(st, ps, mean_prior, mean_post); + + + if (st->consec_noise>=3) + { + update_noise(st, st->old_ps, echo); + } else { + for (i=1;iupdate_prob[i]<.5f || st->ps[i] < st->noise[i]) + { + if (echo) + st->noise[i] = .90f*st->noise[i] + .1f*max(1.0f,st->ps[i]-echo[i]); + else + st->noise[i] = .90f*st->noise[i] + .1f*st->ps[i]; + } + } + } + + for (i=1;izeta[i] = .7f*st->zeta[i] + .3f*st->prior[i]; + } + + { + int freq_start = (int)(300.0f*2.f*N/st->sampling_rate); + int freq_end = (int)(2000.0f*2.f*N/st->sampling_rate); + for (i=freq_start;izeta[i]; + } + } + + Zframe /= N; + if (Zframe 1.5f*st->Zlast) + { + Pframe = 1.f; + st->Zpeak = Zframe; + if (st->Zpeak > 10.f) + st->Zpeak = 10.f; + if (st->Zpeak < 1.f) + st->Zpeak = 1.f; + } else { + if (Zframe < st->Zpeak*ZMIN) + { + Pframe = 0; + } else if (Zframe > st->Zpeak*ZMAX) + { + Pframe = 1; + } else { + Pframe = log(Zframe/(st->Zpeak*ZMIN)) / log(ZMAX/ZMIN); + } + } + } + st->Zlast = Zframe; + + /*fprintf (stderr, "%f\n", Pframe);*/ + /* Compute gain according to the Ephraim-Malah algorithm */ + for (i=1;iprior[i]/(1.0001f+st->prior[i]); + theta = (1.f+st->post[i])*prior_ratio; + + if (i==1 || i==N-1) + zeta1 = st->zeta[i]; + else + zeta1 = .25f*st->zeta[i-1] + .5f*st->zeta[i] + .25f*st->zeta[i+1]; + if (zeta1ZMAX) + P1 = 1.f; + else + P1 = LOG_MIN_MAX_1 * log(ZMIN_1*zeta1); + + /*P1 = log(zeta1/ZMIN)/log(ZMAX/ZMIN);*/ + + /* FIXME: add global prob (P2) */ + q = 1-Pframe*P1; + q = 1-P1; + if (q>.95f) + q=.95f; + p=1.f/(1.f + (q/(1.f-q))*(1.f+st->prior[i])*exp(-theta)); + /*p=1;*/ + +#if 0 + /* log-spectral magnitude estimator */ + if (theta<6) + MM = 0.74082*pow(theta+1,.61)/sqrt(.0001+theta); + else + MM=1; +#else + /* Optimal estimator for loudness domain */ + MM = hypergeom_gain(theta); +#endif + + st->gain[i] = prior_ratio * MM; + /*Put some (very arbitraty) limit on the gain*/ + if (st->gain[i]>2.f) + { + st->gain[i]=2.f; + } + + st->reverb_estimate[i] = st->reverb_decay*st->reverb_estimate[i] + st->reverb_decay*st->reverb_level*st->gain[i]*st->gain[i]*st->ps[i]; + if (st->denoise_enabled) + { + st->gain2[i]=p*p*st->gain[i]; + } else { + st->gain2[i]=1.f; + } + } + st->gain2[0]=st->gain[0]=0.f; + st->gain2[N-1]=st->gain[N-1]=0.f; + + if (st->agc_enabled) + speex_compute_agc(st, mean_prior); + +#if 0 + if (!is_speech) + { + for (i=0;igain2[i] = 0; + } +#if 0 + else { + for (i=0;igain2[i] = 1; + } +#endif +#endif + + /* Apply computed gain */ + for (i=1;iframe[2*i-1] *= st->gain2[i]; + st->frame[2*i] *= st->gain2[i]; + } + + /* Get rid of the DC and very low frequencies */ + st->frame[0]=0; + st->frame[1]=0; + st->frame[2]=0; + /* Nyquist frequency is mostly useless too */ + st->frame[2*N-1]=0; + + /* Inverse FFT with 1/N scaling */ + spx_drft_backward(st->fft_lookup, st->frame); + + for (i=0;i<2*N;i++) + st->frame[i] *= scale; + + { + float max_sample=0; + for (i=0;i<2*N;i++) + if (fabs(st->frame[i])>max_sample) + max_sample = fabs(st->frame[i]); + if (max_sample>28000.f) + { + float damp = 28000.f/max_sample; + for (i=0;i<2*N;i++) + st->frame[i] *= damp; + } + } + + for (i=0;i<2*N;i++) + st->frame[i] *= st->window[i]; + + /* Perform overlap and add */ + for (i=0;ioutbuf[i] + st->frame[i]; + for (i=0;iframe[N3+i]; + + /* Update outbuf */ + for (i=0;ioutbuf[i] = st->frame[st->frame_size+i]; + + /* Save old power spectrum */ + for (i=1;iold_ps[i] = ps[i]; + + return is_speech; +} + +void speex_preprocess_estimate_update(SpeexPreprocessState *st, spx_int16_t *x, float *echo) +{ + int i; + int N = st->ps_size; + int N3 = 2*N - st->frame_size; + + float *ps=st->ps; + + preprocess_analysis(st, x); + + update_noise_prob(st); + + st->nb_preprocess++; + + for (i=1;iupdate_prob[i]<.5f || st->ps[i] < st->noise[i]) + { + if (echo) + st->noise[i] = .90f*st->noise[i] + .1f*max(1.0f,st->ps[i]-echo[i]); + else + st->noise[i] = .90f*st->noise[i] + .1f*st->ps[i]; + } + } + + for (i=0;ioutbuf[i] = x[st->frame_size-N3+i]*st->window[st->frame_size+i]; + + /* Save old power spectrum */ + for (i=1;iold_ps[i] = ps[i]; + + for (i=1;ireverb_estimate[i] *= st->reverb_decay; +} + + +int speex_preprocess_ctl(SpeexPreprocessState *state, int request, void *ptr) +{ + int i; + SpeexPreprocessState *st; + st=(SpeexPreprocessState*)state; + switch(request) + { + case SPEEX_PREPROCESS_SET_DENOISE: + st->denoise_enabled = (*(int*)ptr); + break; + case SPEEX_PREPROCESS_GET_DENOISE: + (*(int*)ptr) = st->denoise_enabled; + break; + + case SPEEX_PREPROCESS_SET_AGC: + st->agc_enabled = (*(int*)ptr); + break; + case SPEEX_PREPROCESS_GET_AGC: + (*(int*)ptr) = st->agc_enabled; + break; + + case SPEEX_PREPROCESS_SET_AGC_LEVEL: + st->agc_level = (*(float*)ptr); + if (st->agc_level<1) + st->agc_level=1; + if (st->agc_level>32768) + st->agc_level=32768; + break; + case SPEEX_PREPROCESS_GET_AGC_LEVEL: + (*(float*)ptr) = st->agc_level; + break; + + case SPEEX_PREPROCESS_SET_VAD: + st->vad_enabled = (*(int*)ptr); + break; + case SPEEX_PREPROCESS_GET_VAD: + (*(int*)ptr) = st->vad_enabled; + break; + + case SPEEX_PREPROCESS_SET_DEREVERB: + st->dereverb_enabled = (*(int*)ptr); + for (i=0;ips_size;i++) + st->reverb_estimate[i]=0; + break; + case SPEEX_PREPROCESS_GET_DEREVERB: + (*(int*)ptr) = st->dereverb_enabled; + break; + + case SPEEX_PREPROCESS_SET_DEREVERB_LEVEL: + st->reverb_level = (*(float*)ptr); + break; + case SPEEX_PREPROCESS_GET_DEREVERB_LEVEL: + (*(float*)ptr) = st->reverb_level; + break; + + case SPEEX_PREPROCESS_SET_DEREVERB_DECAY: + st->reverb_decay = (*(float*)ptr); + break; + case SPEEX_PREPROCESS_GET_DEREVERB_DECAY: + (*(float*)ptr) = st->reverb_decay; + break; + + case SPEEX_PREPROCESS_SET_PROB_START: + st->speech_prob_start = (*(float*)ptr); + if ( st->speech_prob_start > 1 ) + st->speech_prob_start = st->speech_prob_start / 100; + if ( st->speech_prob_start > 1 || st->speech_prob_start < 0 ) + st->speech_prob_start = SPEEX_PROB_START_DEFAULT; + break; + case SPEEX_PREPROCESS_GET_PROB_START: + (*(float*)ptr) = st->speech_prob_start ; + break; + + case SPEEX_PREPROCESS_SET_PROB_CONTINUE: + st->speech_prob_continue = (*(float*)ptr); + if ( st->speech_prob_continue > 1 ) + st->speech_prob_continue = st->speech_prob_continue / 100; + if ( st->speech_prob_continue > 1 || st->speech_prob_continue < 0 ) + st->speech_prob_continue = SPEEX_PROB_CONTINUE_DEFAULT; + break; + case SPEEX_PREPROCESS_GET_PROB_CONTINUE: + (*(float*)ptr) = st->speech_prob_continue; + break; + + default: + speex_warning_int("Unknown speex_preprocess_ctl request: ", request); + return -1; + } + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/quant_lsp.c b/3rdparty/iaxclient-2/lib/libspeex/quant_lsp.c new file mode 100644 index 0000000..7bd0b91 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/quant_lsp.c @@ -0,0 +1,441 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: quant_lsp.c + LSP vector quantization + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "quant_lsp.h" +#include +#ifndef M_PI +#define M_PI 3.14159265358979323846 +#endif + + +#include "misc.h" + +#ifdef FIXED_POINT + +#define LSP_LINEAR(i) (SHL16(i+1,11)) +#define LSP_LINEAR_HIGH(i) (ADD16(MULT16_16_16(i,2560),6144)) +#define LSP_DIV_256(x) (SHL16((spx_word16_t)x, 5)) +#define LSP_DIV_512(x) (SHL16((spx_word16_t)x, 4)) +#define LSP_DIV_1024(x) (SHL16((spx_word16_t)x, 3)) +#define LSP_PI 25736 + +#else + +#define LSP_LINEAR(i) (.25*(i)+.25) +#define LSP_LINEAR_HIGH(i) (.3125*(i)+.75) +#define LSP_SCALE 256. +#define LSP_DIV_256(x) (0.0039062*(x)) +#define LSP_DIV_512(x) (0.0019531*(x)) +#define LSP_DIV_1024(x) (0.00097656*(x)) +#define LSP_PI M_PI + +#endif + +static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) +{ + int i; + spx_word16_t tmp1, tmp2; + for (i=0;i tmp2 ? tmp1 : tmp2; + }*/ + + for (i=0;i +#include "misc.h" + +#define MAX_LSP_SIZE 20 + +#define NB_CDBK_SIZE 64 +#define NB_CDBK_SIZE_LOW1 64 +#define NB_CDBK_SIZE_LOW2 64 +#define NB_CDBK_SIZE_HIGH1 64 +#define NB_CDBK_SIZE_HIGH2 64 + +/*Narrowband codebooks*/ +extern const signed char cdbk_nb[]; +extern const signed char cdbk_nb_low1[]; +extern const signed char cdbk_nb_low2[]; +extern const signed char cdbk_nb_high1[]; +extern const signed char cdbk_nb_high2[]; + +/* Quantizes narrowband LSPs with 30 bits */ +void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits); + +/* Decodes quantized narrowband LSPs */ +void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits); + +/* Quantizes low bit-rate narrowband LSPs with 18 bits */ +void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits); + +/* Decodes quantized low bit-rate narrowband LSPs */ +void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits); + +/* Quantizes high-band LSPs with 12 bits */ +void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits); + +/* Decodes high-band LSPs */ +void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits); + +#ifdef EPIC_48K +/* Quantizes narrowband LSPs with 14 bits */ +void lsp_quant_48k(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits); + +/* Decodes quantized narrowband LSPs (14 bits) */ +void lsp_unquant_48k(spx_lsp_t *lsp, int order, SpeexBits *bits); +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/sb_celp.c b/3rdparty/iaxclient-2/lib/libspeex/sb_celp.c new file mode 100644 index 0000000..337c09c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/sb_celp.c @@ -0,0 +1,1519 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: sb_celp.c + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "sb_celp.h" +#include "stdlib.h" +#include "filters.h" +#include "lpc.h" +#include "lsp.h" +#include "stack_alloc.h" +#include "cb_search.h" +#include "quant_lsp.h" +#include "vq.h" +#include "ltp.h" +#include "misc.h" + +#ifdef DISABLE_WIDEBAND +void *sb_encoder_init(const SpeexMode *m) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return NULL; +} +void sb_encoder_destroy(void *state) +{ + speex_error("Wideband and Ultra-wideband are disabled"); +} +int sb_encode(void *state, void *vin, SpeexBits *bits) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return -2; +} +void *sb_decoder_init(const SpeexMode *m) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return NULL; +} +void sb_decoder_destroy(void *state) +{ + speex_error("Wideband and Ultra-wideband are disabled"); +} +int sb_decode(void *state, SpeexBits *bits, void *vout) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return -2; +} +int sb_encoder_ctl(void *state, int request, void *ptr) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return -2; +} +int sb_decoder_ctl(void *state, int request, void *ptr) +{ + speex_error("Wideband and Ultra-wideband are disabled"); + return -2; +} +#else + + +#ifndef M_PI +#define M_PI 3.14159265358979323846 /* pi */ +#endif + +#define sqr(x) ((x)*(x)) + +#define SUBMODE(x) st->submodes[st->submodeID]->x + +#ifdef FIXED_POINT +static const spx_word16_t gc_quant_bound[16] = {125, 164, 215, 282, 370, 484, 635, 832, 1090, 1428, 1871, 2452, 3213, 4210, 5516, 7228}; +#define LSP_MARGIN 410 +#define LSP_DELTA1 6553 +#define LSP_DELTA2 1638 + +#else + +#define LSP_MARGIN .05 +#define LSP_DELTA1 .2 +#define LSP_DELTA2 .05 + +#endif + +#define QMF_ORDER 64 + +#ifdef FIXED_POINT +static const spx_word16_t h0[64] = {2, -7, -7, 18, 15, -39, -25, 75, 35, -130, -41, 212, 38, -327, -17, 483, -32, -689, 124, 956, -283, -1307, 543, 1780, -973, -2467, 1733, 3633, -3339, -6409, 9059, 30153, 30153, 9059, -6409, -3339, 3633, 1733, -2467, -973, 1780, 543, -1307, -283, 956, 124, -689, -32, 483, -17, -327, 38, 212, -41, -130, 35, 75, -25, -39, 15, 18, -7, -7, 2}; + +static const spx_word16_t h1[64] = {2, 7, -7, -18, 15, 39, -25, -75, 35, 130, -41, -212, 38, 327, -17, -483, -32, 689, 124, -956, -283, 1307, 543, -1780, -973, 2467, 1733, -3633, -3339, 6409, 9059, -30153, 30153, -9059, -6409, 3339, 3633, -1733, -2467, 973, 1780, -543, -1307, 283, 956, -124, -689, 32, 483, 17, -327, -38, 212, 41, -130, -35, 75, 25, -39, -15, 18, 7, -7, -2}; + + +#else +static const float h0[64] = { + 3.596189e-05, -0.0001123515, + -0.0001104587, 0.0002790277, + 0.0002298438, -0.0005953563, + -0.0003823631, 0.00113826, + 0.0005308539, -0.001986177, + -0.0006243724, 0.003235877, + 0.0005743159, -0.004989147, + -0.0002584767, 0.007367171, + -0.0004857935, -0.01050689, + 0.001894714, 0.01459396, + -0.004313674, -0.01994365, + 0.00828756, 0.02716055, + -0.01485397, -0.03764973, + 0.026447, 0.05543245, + -0.05095487, -0.09779096, + 0.1382363, 0.4600981, + 0.4600981, 0.1382363, + -0.09779096, -0.05095487, + 0.05543245, 0.026447, + -0.03764973, -0.01485397, + 0.02716055, 0.00828756, + -0.01994365, -0.004313674, + 0.01459396, 0.001894714, + -0.01050689, -0.0004857935, + 0.007367171, -0.0002584767, + -0.004989147, 0.0005743159, + 0.003235877, -0.0006243724, + -0.001986177, 0.0005308539, + 0.00113826, -0.0003823631, + -0.0005953563, 0.0002298438, + 0.0002790277, -0.0001104587, + -0.0001123515, 3.596189e-05 +}; + +static const float h1[64] = { + 3.596189e-05, 0.0001123515, + -0.0001104587, -0.0002790277, + 0.0002298438, 0.0005953563, + -0.0003823631, -0.00113826, + 0.0005308539, 0.001986177, + -0.0006243724, -0.003235877, + 0.0005743159, 0.004989147, + -0.0002584767, -0.007367171, + -0.0004857935, 0.01050689, + 0.001894714, -0.01459396, + -0.004313674, 0.01994365, + 0.00828756, -0.02716055, + -0.01485397, 0.03764973, + 0.026447, -0.05543245, + -0.05095487, 0.09779096, + 0.1382363, -0.4600981, + 0.4600981, -0.1382363, + -0.09779096, 0.05095487, + 0.05543245, -0.026447, + -0.03764973, 0.01485397, + 0.02716055, -0.00828756, + -0.01994365, 0.004313674, + 0.01459396, -0.001894714, + -0.01050689, 0.0004857935, + 0.007367171, 0.0002584767, + -0.004989147, -0.0005743159, + 0.003235877, 0.0006243724, + -0.001986177, -0.0005308539, + 0.00113826, 0.0003823631, + -0.0005953563, -0.0002298438, + 0.0002790277, 0.0001104587, + -0.0001123515, -3.596189e-05 +}; +#endif + +static void mix_and_saturate(spx_word32_t *x0, spx_word32_t *x1, spx_word16_t *out, int len) +{ + int i; + for (i=0;i32767) + out[i] = 32767; + else if (tmp<-32767) + out[i] = -32767; + else + out[i] = tmp; + } +} + +void *sb_encoder_init(const SpeexMode *m) +{ + int i; + SBEncState *st; + const SpeexSBMode *mode; + +#if defined(VAR_ARRAYS) || defined (USE_ALLOCA) + st = (SBEncState*)speex_alloc(sizeof(SBEncState)); + st->stack = NULL; +#else + st = (SBEncState*)speex_alloc(sizeof(SBEncState)+10000*sizeof(spx_sig_t)); + st->stack = ((char*)st) + sizeof(SBEncState); +#endif + if (!st) + return NULL; + st->mode = m; + mode = (const SpeexSBMode*)m->mode; + + + st->st_low = speex_encoder_init(mode->nb_mode); + st->full_frame_size = 2*mode->frameSize; + st->frame_size = mode->frameSize; + st->subframeSize = mode->subframeSize; + st->nbSubframes = mode->frameSize/mode->subframeSize; + st->windowSize = st->frame_size*3/2; + st->lpcSize=mode->lpcSize; + st->bufSize=mode->bufSize; + + st->encode_submode = 1; + st->submodes=mode->submodes; + st->submodeSelect = st->submodeID=mode->defaultSubmode; + + i=9; + speex_encoder_ctl(st->st_low, SPEEX_SET_QUALITY, &i); + + st->lag_factor = mode->lag_factor; + st->lpc_floor = mode->lpc_floor; + st->gamma1=mode->gamma1; + st->gamma2=mode->gamma2; + st->first=1; + + st->x0d=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->x1d=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->high=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + st->y0=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + st->y1=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + + st->h0_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word16_t)); + st->h1_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word16_t)); + st->g0_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word32_t)); + st->g1_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word32_t)); + + st->buf=speex_alloc((st->windowSize)*sizeof(spx_sig_t)); + st->excBuf=speex_alloc((st->bufSize)*sizeof(spx_sig_t)); + st->exc = st->excBuf + st->bufSize - st->windowSize; + + st->res=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->sw=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->target=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + /*Asymmetric "pseudo-Hamming" window*/ + { + int part1, part2; + part1 = st->subframeSize*7/2; + part2 = st->subframeSize*5/2; + st->window = speex_alloc((st->windowSize)*sizeof(spx_word16_t)); + for (i=0;iwindow[i]=(spx_word16_t)(SIG_SCALING*(.54-.46*cos(M_PI*i/part1))); + for (i=0;iwindow[part1+i]=(spx_word16_t)(SIG_SCALING*(.54+.46*cos(M_PI*i/part2))); + } + + st->lagWindow = speex_alloc((st->lpcSize+1)*sizeof(spx_word16_t)); + for (i=0;ilpcSize+1;i++) + st->lagWindow[i]=16384*exp(-.5*sqr(2*M_PI*st->lag_factor*i)); + + st->autocorr = speex_alloc((st->lpcSize+1)*sizeof(spx_word16_t)); + st->lpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->bw_lpc1 = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->bw_lpc2 = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_lsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_lpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->interp_qlpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + st->pi_gain = speex_alloc((st->nbSubframes)*sizeof(spx_word32_t)); + + st->mem_sp = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + st->mem_sp2 = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + st->mem_sw = speex_alloc((st->lpcSize)*sizeof(spx_mem_t)); + + st->vbr_quality = 8; + st->vbr_enabled = 0; + st->vad_enabled = 0; + st->abr_enabled = 0; + st->relative_quality=0; + + st->complexity=2; + speex_encoder_ctl(st->st_low, SPEEX_GET_SAMPLING_RATE, &st->sampling_rate); + st->sampling_rate*=2; + +#ifdef ENABLE_VALGRIND + VALGRIND_MAKE_READABLE(st, (st->stack-(char*)st)); +#endif + return st; +} + +void sb_encoder_destroy(void *state) +{ + SBEncState *st=(SBEncState*)state; + + speex_encoder_destroy(st->st_low); + + speex_free(st); +} + + +int sb_encode(void *state, void *vin, SpeexBits *bits) +{ + SBEncState *st; + int i, roots, sub; + char *stack; + VARDECL(spx_mem_t *mem); + VARDECL(spx_sig_t *innov); + VARDECL(spx_word16_t *syn_resp); + VARDECL(spx_word32_t *low_pi_gain); + VARDECL(spx_sig_t *low_exc); + VARDECL(spx_sig_t *low_innov); + const SpeexSBMode *mode; + int dtx; + spx_word16_t *in = vin; + + st = (SBEncState*)state; + stack=st->stack; + mode = (const SpeexSBMode*)(st->mode->mode); + + { + VARDECL(spx_word16_t *low); + ALLOC(low, st->frame_size, spx_word16_t); + + /* Compute the two sub-bands by filtering with h0 and h1*/ + qmf_decomp(in, h0, st->x0d, st->x1d, st->full_frame_size, QMF_ORDER, st->h0_mem, stack); + + for (i=0;iframe_size;i++) + low[i] = SATURATE(PSHR(st->x0d[i],SIG_SHIFT),32767); + + /* Encode the narrowband part*/ + speex_encode_native(st->st_low, low, bits); + + for (i=0;iframe_size;i++) + st->x0d[i] = SHL(low[i],SIG_SHIFT); + } + /* High-band buffering / sync with low band */ + for (i=0;iwindowSize-st->frame_size;i++) + st->high[i] = st->high[st->frame_size+i]; + for (i=0;iframe_size;i++) + st->high[st->windowSize-st->frame_size+i]=SATURATE(st->x1d[i],536854528); + + speex_move(st->excBuf, st->excBuf+st->frame_size, (st->bufSize-st->frame_size)*sizeof(spx_sig_t)); + + + ALLOC(low_pi_gain, st->nbSubframes, spx_word32_t); + ALLOC(low_exc, st->frame_size, spx_sig_t); + ALLOC(low_innov, st->frame_size, spx_sig_t); + speex_encoder_ctl(st->st_low, SPEEX_GET_PI_GAIN, low_pi_gain); + speex_encoder_ctl(st->st_low, SPEEX_GET_EXC, low_exc); + speex_encoder_ctl(st->st_low, SPEEX_GET_INNOV, low_innov); + + speex_encoder_ctl(st->st_low, SPEEX_GET_LOW_MODE, &dtx); + + if (dtx==0) + dtx=1; + else + dtx=0; + + { + VARDECL(spx_word16_t *w_sig); + ALLOC(w_sig, st->windowSize, spx_word16_t); + /* Window for analysis */ + for (i=0;iwindowSize;i++) + w_sig[i] = SHR(MULT16_16(SHR((spx_word32_t)(st->high[i]),SIG_SHIFT),st->window[i]),SIG_SHIFT); + + /* Compute auto-correlation */ + _spx_autocorr(w_sig, st->autocorr, st->lpcSize+1, st->windowSize); + } + + st->autocorr[0] = (spx_word16_t)(st->autocorr[0]*st->lpc_floor); /* Noise floor in auto-correlation domain */ + + /* Lag windowing: equivalent to filtering in the power-spectrum domain */ + for (i=0;ilpcSize+1;i++) + st->autocorr[i] = MULT16_16_Q14(st->autocorr[i],st->lagWindow[i]); + + /* Levinson-Durbin */ + _spx_lpc(st->lpc+1, st->autocorr, st->lpcSize); + st->lpc[0] = (spx_coef_t)LPC_SCALING; + + /* LPC to LSPs (x-domain) transform */ + roots=lpc_to_lsp (st->lpc, st->lpcSize, st->lsp, 15, LSP_DELTA1, stack); + if (roots!=st->lpcSize) + { + roots = lpc_to_lsp (st->lpc, st->lpcSize, st->lsp, 11, LSP_DELTA2, stack); + if (roots!=st->lpcSize) { + /*If we can't find all LSP's, do some damage control and use a flat filter*/ + for (i=0;ilpcSize;i++) + { + st->lsp[i]=M_PI*((float)(i+1))/(st->lpcSize+1); + } + } + } + + /* VBR code */ + if ((st->vbr_enabled || st->vad_enabled) && !dtx) + { + float e_low=0, e_high=0; + float ratio; + if (st->abr_enabled) + { + float qual_change=0; + if (st->abr_drift2 * st->abr_drift > 0) + { + /* Only adapt if long-term and short-term drift are the same sign */ + qual_change = -.00001*st->abr_drift/(1+st->abr_count); + if (qual_change>.1) + qual_change=.1; + if (qual_change<-.1) + qual_change=-.1; + } + st->vbr_quality += qual_change; + if (st->vbr_quality>10) + st->vbr_quality=10; + if (st->vbr_quality<0) + st->vbr_quality=0; + } + + + /*FIXME: Are the two signals (low, high) in sync? */ + e_low = compute_rms(st->x0d, st->frame_size); + e_high = compute_rms(st->high, st->frame_size); + ratio = 2*log((1+e_high)/(1+e_low)); + + speex_encoder_ctl(st->st_low, SPEEX_GET_RELATIVE_QUALITY, &st->relative_quality); + if (ratio<-4) + ratio=-4; + if (ratio>2) + ratio=2; + /*if (ratio>-2)*/ + if (st->vbr_enabled) + { + int modeid; + modeid = mode->nb_modes-1; + st->relative_quality+=1.0*(ratio+2); + if (st->relative_quality<-1) + st->relative_quality=-1; + while (modeid) + { + int v1; + float thresh; + v1=(int)floor(st->vbr_quality); + if (v1==10) + thresh = mode->vbr_thresh[modeid][v1]; + else + thresh = (st->vbr_quality-v1) * mode->vbr_thresh[modeid][v1+1] + + (1+v1-st->vbr_quality) * mode->vbr_thresh[modeid][v1]; + if (st->relative_quality >= thresh) + break; + modeid--; + } + speex_encoder_ctl(state, SPEEX_SET_HIGH_MODE, &modeid); + if (st->abr_enabled) + { + int bitrate; + speex_encoder_ctl(state, SPEEX_GET_BITRATE, &bitrate); + st->abr_drift+=(bitrate-st->abr_enabled); + st->abr_drift2 = .95*st->abr_drift2 + .05*(bitrate-st->abr_enabled); + st->abr_count += 1.0; + } + + } else { + /* VAD only */ + int modeid; + if (st->relative_quality<2.0) + modeid=1; + else + modeid=st->submodeSelect; + /*speex_encoder_ctl(state, SPEEX_SET_MODE, &mode);*/ + st->submodeID=modeid; + + } + /*fprintf (stderr, "%f %f\n", ratio, low_qual);*/ + } + + if (st->encode_submode) + { + speex_bits_pack(bits, 1, 1); + if (dtx) + speex_bits_pack(bits, 0, SB_SUBMODE_BITS); + else + speex_bits_pack(bits, st->submodeID, SB_SUBMODE_BITS); + } + + /* If null mode (no transmission), just set a couple things to zero*/ + if (dtx || st->submodes[st->submodeID] == NULL) + { + for (i=0;iframe_size;i++) + st->exc[i]=st->sw[i]=VERY_SMALL; + + for (i=0;ilpcSize;i++) + st->mem_sw[i]=0; + st->first=1; + + /* Final signal synthesis from excitation */ + iir_mem2(st->exc, st->interp_qlpc, st->high, st->frame_size, st->lpcSize, st->mem_sp); + +#ifdef RESYNTH + /* Reconstruct the original */ + fir_mem_up(st->x0d, h0, st->y0, st->full_frame_size, QMF_ORDER, st->g0_mem, stack); + fir_mem_up(st->high, h1, st->y1, st->full_frame_size, QMF_ORDER, st->g1_mem, stack); + + for (i=0;ifull_frame_size;i++) + in[i]=SHR(st->y0[i]-st->y1[i], SIG_SHIFT-1); +#endif + + if (dtx) + return 0; + else + return 1; + } + + + /* LSP quantization */ + SUBMODE(lsp_quant)(st->lsp, st->qlsp, st->lpcSize, bits); + + if (st->first) + { + for (i=0;ilpcSize;i++) + st->old_lsp[i] = st->lsp[i]; + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + } + + ALLOC(mem, st->lpcSize, spx_mem_t); + ALLOC(syn_resp, st->subframeSize, spx_word16_t); + ALLOC(innov, st->subframeSize, spx_sig_t); + + for (sub=0;subnbSubframes;sub++) + { + spx_sig_t *exc, *sp, *res, *target, *sw; + spx_word16_t filter_ratio; + int offset; + spx_word32_t rl, rh; + spx_word16_t eh=0; + + offset = st->subframeSize*sub; + sp=st->high+offset; + exc=st->exc+offset; + res=st->res+offset; + target=st->target+offset; + sw=st->sw+offset; + + /* LSP interpolation (quantized and unquantized) */ + lsp_interpolate(st->old_lsp, st->lsp, st->interp_lsp, st->lpcSize, sub, st->nbSubframes); + lsp_interpolate(st->old_qlsp, st->qlsp, st->interp_qlsp, st->lpcSize, sub, st->nbSubframes); + + lsp_enforce_margin(st->interp_lsp, st->lpcSize, LSP_MARGIN); + lsp_enforce_margin(st->interp_qlsp, st->lpcSize, LSP_MARGIN); + + lsp_to_lpc(st->interp_lsp, st->interp_lpc, st->lpcSize,stack); + lsp_to_lpc(st->interp_qlsp, st->interp_qlpc, st->lpcSize, stack); + + bw_lpc(st->gamma1, st->interp_lpc, st->bw_lpc1, st->lpcSize); + bw_lpc(st->gamma2, st->interp_lpc, st->bw_lpc2, st->lpcSize); + + /* Compute mid-band (4000 Hz for wideband) response of low-band and high-band + filters */ + st->pi_gain[sub]=LPC_SCALING; + rh = LPC_SCALING; + for (i=1;i<=st->lpcSize;i+=2) + { + rh += st->interp_qlpc[i+1] - st->interp_qlpc[i]; + st->pi_gain[sub] += st->interp_qlpc[i] + st->interp_qlpc[i+1]; + } + + rl = low_pi_gain[sub]; +#ifdef FIXED_POINT + filter_ratio=DIV32_16(SHL(rl+82,2),SHR(82+rh,5)); +#else + filter_ratio=(rl+.01)/(rh+.01); +#endif + + /* Compute "real excitation" */ + fir_mem2(sp, st->interp_qlpc, exc, st->subframeSize, st->lpcSize, st->mem_sp2); + /* Compute energy of low-band and high-band excitation */ + + eh = compute_rms(exc, st->subframeSize); + + if (!SUBMODE(innovation_quant)) {/* 1 for spectral folding excitation, 0 for stochastic */ + float g; + spx_word16_t el; + el = compute_rms(low_innov+offset, st->subframeSize); + + /* Gain to use if we want to use the low-band excitation for high-band */ + g=eh/(.01+el); + +#if 0 + { + char *tmp_stack=stack; + float *tmp_sig; + float g2; + ALLOC(tmp_sig, st->subframeSize, spx_sig_t); + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sp[i]; + iir_mem2(low_innov+offset, st->interp_qlpc, tmp_sig, st->subframeSize, st->lpcSize, mem); + g2 = compute_rms(sp, st->subframeSize)/(.01+compute_rms(tmp_sig, st->subframeSize)); + /*fprintf (stderr, "gains: %f %f\n", g, g2);*/ + g = g2; + stack = tmp_stack; + } +#endif + +#ifdef FIXED_POINT + g *= filter_ratio/128.; +#else + g *= filter_ratio; +#endif + /*print_vec(&g, 1, "gain factor");*/ + /* Gain quantization */ + { + int quant = (int) floor(.5 + 10 + 8.0 * log((g+.0001))); + /*speex_warning_int("tata", quant);*/ + if (quant<0) + quant=0; + if (quant>31) + quant=31; + speex_bits_pack(bits, quant, 5); + } + + } else { + spx_word16_t gc; + spx_word32_t scale; + spx_word16_t el; + el = compute_rms(low_exc+offset, st->subframeSize); + + gc = DIV32_16(MULT16_16(filter_ratio,1+eh),1+el); + + /* This is a kludge that cleans up a historical bug */ + if (st->subframeSize==80) + gc *= 0.70711; + /*printf ("%f %f %f %f\n", el, eh, filter_ratio, gc);*/ +#ifdef FIXED_POINT + { + int qgc = scal_quant(gc, gc_quant_bound, 16); + speex_bits_pack(bits, qgc, 4); + gc = MULT16_32_Q15(28626,gc_quant_bound[qgc]); + } +#else + { + int qgc = (int)floor(.5+3.7*(log(gc)+0.15556)); + if (qgc<0) + qgc=0; + if (qgc>15) + qgc=15; + speex_bits_pack(bits, qgc, 4); + gc = exp((1/3.7)*qgc-0.15556); + } +#endif + if (st->subframeSize==80) + gc *= 1.4142; + + scale = SHL(MULT16_16(DIV32_16(SHL(gc,SIG_SHIFT-4),filter_ratio),(1+el)),4); + + compute_impulse_response(st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, syn_resp, st->subframeSize, st->lpcSize, stack); + + + /* Reset excitation */ + for (i=0;isubframeSize;i++) + exc[i]=VERY_SMALL; + + /* Compute zero response (ringing) of A(z/g1) / ( A(z/g2) * Aq(z) ) */ + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sp[i]; + iir_mem2(exc, st->interp_qlpc, exc, st->subframeSize, st->lpcSize, mem); + + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sw[i]; + filter_mem2(exc, st->bw_lpc1, st->bw_lpc2, res, st->subframeSize, st->lpcSize, mem); + + /* Compute weighted signal */ + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sw[i]; + filter_mem2(sp, st->bw_lpc1, st->bw_lpc2, sw, st->subframeSize, st->lpcSize, mem); + + /* Compute target signal */ + for (i=0;isubframeSize;i++) + target[i]=sw[i]-res[i]; + + for (i=0;isubframeSize;i++) + exc[i]=0; + + signal_div(target, target, scale, st->subframeSize); + + /* Reset excitation */ + for (i=0;isubframeSize;i++) + innov[i]=0; + + /*print_vec(target, st->subframeSize, "\ntarget");*/ + SUBMODE(innovation_quant)(target, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + SUBMODE(innovation_params), st->lpcSize, st->subframeSize, + innov, syn_resp, bits, stack, (st->complexity+1)>>1, SUBMODE(double_codebook)); + /*print_vec(target, st->subframeSize, "after");*/ + + signal_mul(innov, innov, scale, st->subframeSize); + + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i], innov[i]); + + if (SUBMODE(double_codebook)) { + char *tmp_stack=stack; + VARDECL(spx_sig_t *innov2); + ALLOC(innov2, st->subframeSize, spx_sig_t); + for (i=0;isubframeSize;i++) + innov2[i]=0; + for (i=0;isubframeSize;i++) + target[i]*=2.5; + SUBMODE(innovation_quant)(target, st->interp_qlpc, st->bw_lpc1, st->bw_lpc2, + SUBMODE(innovation_params), st->lpcSize, st->subframeSize, + innov2, syn_resp, bits, stack, (st->complexity+1)>>1, 0); + for (i=0;isubframeSize;i++) + innov2[i]*=scale*(1/2.5)/SIG_SCALING; + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i],innov2[i]); + stack = tmp_stack; + } + + } + + /*Keep the previous memory*/ + for (i=0;ilpcSize;i++) + mem[i]=st->mem_sp[i]; + /* Final signal synthesis from excitation */ + iir_mem2(exc, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, st->mem_sp); + + /* Compute weighted signal again, from synthesized speech (not sure it's the right thing) */ + filter_mem2(sp, st->bw_lpc1, st->bw_lpc2, sw, st->subframeSize, st->lpcSize, st->mem_sw); + } + + +#ifdef RESYNTH + /* Reconstruct the original */ + fir_mem_up(st->x0d, h0, st->y0, st->full_frame_size, QMF_ORDER, st->g0_mem, stack); + fir_mem_up(st->high, h1, st->y1, st->full_frame_size, QMF_ORDER, st->g1_mem, stack); + + for (i=0;ifull_frame_size;i++) + in[i]=SHR(st->y0[i]-st->y1[i], SIG_SHIFT-1); +#endif + for (i=0;ilpcSize;i++) + st->old_lsp[i] = st->lsp[i]; + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + + st->first=0; + + return 1; +} + + + + + +void *sb_decoder_init(const SpeexMode *m) +{ + SBDecState *st; + const SpeexSBMode *mode; +#if defined(VAR_ARRAYS) || defined (USE_ALLOCA) + st = (SBDecState*)speex_alloc(sizeof(SBDecState)); + st->stack = NULL; +#else + st = (SBDecState*)speex_alloc(sizeof(SBDecState)+6000*sizeof(spx_sig_t)); + st->stack = ((char*)st) + sizeof(SBDecState); +#endif + if (!st) + return NULL; + st->mode = m; + mode=(const SpeexSBMode*)m->mode; + + st->encode_submode = 1; + + + + + st->st_low = speex_decoder_init(mode->nb_mode); + st->full_frame_size = 2*mode->frameSize; + st->frame_size = mode->frameSize; + st->subframeSize = mode->subframeSize; + st->nbSubframes = mode->frameSize/mode->subframeSize; + st->lpcSize=mode->lpcSize; + speex_decoder_ctl(st->st_low, SPEEX_GET_SAMPLING_RATE, &st->sampling_rate); + st->sampling_rate*=2; + + st->submodes=mode->submodes; + st->submodeID=mode->defaultSubmode; + + st->first=1; + + + st->x0d=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->x1d=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + st->high=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + st->y0=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + st->y1=speex_alloc((st->full_frame_size)*sizeof(spx_sig_t)); + + st->g0_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word32_t)); + st->g1_mem=speex_alloc((QMF_ORDER)*sizeof(spx_word32_t)); + + st->exc=speex_alloc((st->frame_size)*sizeof(spx_sig_t)); + + st->qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->old_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_qlsp = speex_alloc((st->lpcSize)*sizeof(spx_lsp_t)); + st->interp_qlpc = speex_alloc((st->lpcSize+1)*sizeof(spx_coef_t)); + + st->pi_gain = speex_alloc((st->nbSubframes)*sizeof(spx_word32_t)); + st->mem_sp = speex_alloc((2*st->lpcSize)*sizeof(spx_mem_t)); + + st->lpc_enh_enabled=0; + +#ifdef ENABLE_VALGRIND + VALGRIND_MAKE_READABLE(st, (st->stack-(char*)st)); +#endif + return st; +} + +void sb_decoder_destroy(void *state) +{ + SBDecState *st; + st = (SBDecState*)state; + speex_decoder_destroy(st->st_low); + + speex_free(state); +} + +static void sb_decode_lost(SBDecState *st, spx_word16_t *out, int dtx, char *stack) +{ + int i; + VARDECL(spx_coef_t *awk1); + VARDECL(spx_coef_t *awk2); + VARDECL(spx_coef_t *awk3); + int saved_modeid=0; + + if (dtx) + { + saved_modeid=st->submodeID; + st->submodeID=1; + } else { + bw_lpc(GAMMA_SCALING*0.99, st->interp_qlpc, st->interp_qlpc, st->lpcSize); + } + + st->first=1; + + ALLOC(awk1, st->lpcSize+1, spx_coef_t); + ALLOC(awk2, st->lpcSize+1, spx_coef_t); + ALLOC(awk3, st->lpcSize+1, spx_coef_t); + + if (st->lpc_enh_enabled) + { + spx_word16_t k1,k2,k3; + if (st->submodes[st->submodeID] != NULL) + { + k1=SUBMODE(lpc_enh_k1); + k2=SUBMODE(lpc_enh_k2); + k3=SUBMODE(lpc_enh_k3); + } else { + k1=k2=.7*GAMMA_SCALING; + k3 = 0; + } + bw_lpc(k1, st->interp_qlpc, awk1, st->lpcSize); + bw_lpc(k2, st->interp_qlpc, awk2, st->lpcSize); + bw_lpc(k3, st->interp_qlpc, awk3, st->lpcSize); + /*fprintf (stderr, "%f %f %f\n", k1, k2, k3);*/ + } + + + /* Final signal synthesis from excitation */ + if (!dtx) + { + for (i=0;iframe_size;i++) + st->exc[i] *= .9; + } + + for (i=0;iframe_size;i++) + st->high[i]=st->exc[i]; + + if (st->lpc_enh_enabled) + { + /* Use enhanced LPC filter */ + filter_mem2(st->high, awk2, awk1, st->high, st->frame_size, st->lpcSize, + st->mem_sp+st->lpcSize); + filter_mem2(st->high, awk3, st->interp_qlpc, st->high, st->frame_size, st->lpcSize, + st->mem_sp); + } else { + /* Use regular filter */ + for (i=0;ilpcSize;i++) + st->mem_sp[st->lpcSize+i] = 0; + iir_mem2(st->high, st->interp_qlpc, st->high, st->frame_size, st->lpcSize, + st->mem_sp); + } + + /*iir_mem2(st->exc, st->interp_qlpc, st->high, st->frame_size, st->lpcSize, st->mem_sp);*/ + + /* Reconstruct the original */ + fir_mem_up(st->x0d, h0, st->y0, st->full_frame_size, QMF_ORDER, st->g0_mem, stack); + fir_mem_up(st->high, h1, st->y1, st->full_frame_size, QMF_ORDER, st->g1_mem, stack); + + mix_and_saturate(st->y0, st->y1, out, st->full_frame_size); + + if (dtx) + { + st->submodeID=saved_modeid; + } + + return; +} + +int sb_decode(void *state, SpeexBits *bits, void *vout) +{ + int i, sub; + SBDecState *st; + int wideband; + int ret; + char *stack; + VARDECL(spx_word32_t *low_pi_gain); + VARDECL(spx_sig_t *low_exc); + VARDECL(spx_sig_t *low_innov); + VARDECL(spx_coef_t *awk1); + VARDECL(spx_coef_t *awk2); + VARDECL(spx_coef_t *awk3); + int dtx; + const SpeexSBMode *mode; + spx_word16_t *out = vout; + + st = (SBDecState*)state; + stack=st->stack; + mode = (const SpeexSBMode*)(st->mode->mode); + + { + VARDECL(spx_word16_t *low); + ALLOC(low, st->frame_size, spx_word16_t); + + /* Decode the low-band */ + ret = speex_decode_native(st->st_low, bits, low); + + for (i=0;iframe_size;i++) + st->x0d[i] = SHL((spx_sig_t)low[i], SIG_SHIFT); + } + + speex_decoder_ctl(st->st_low, SPEEX_GET_DTX_STATUS, &dtx); + + /* If error decoding the narrowband part, propagate error */ + if (ret!=0) + { + return ret; + } + + if (!bits) + { + sb_decode_lost(st, out, dtx, stack); + return 0; + } + + if (st->encode_submode) + { + + /*Check "wideband bit"*/ + if (speex_bits_remaining(bits)>0) + wideband = speex_bits_peek(bits); + else + wideband = 0; + if (wideband) + { + /*Regular wideband frame, read the submode*/ + wideband = speex_bits_unpack_unsigned(bits, 1); + st->submodeID = speex_bits_unpack_unsigned(bits, SB_SUBMODE_BITS); + } else + { + /*Was a narrowband frame, set "null submode"*/ + st->submodeID = 0; + } + if (st->submodeID != 0 && st->submodes[st->submodeID] == NULL) + { + speex_warning("Invalid mode encountered: corrupted stream?"); + return -2; + } + } + + /* If null mode (no transmission), just set a couple things to zero*/ + if (st->submodes[st->submodeID] == NULL) + { + if (dtx) + { + sb_decode_lost(st, out, 1, stack); + return 0; + } + + for (i=0;iframe_size;i++) + st->exc[i]=VERY_SMALL; + + st->first=1; + + /* Final signal synthesis from excitation */ + iir_mem2(st->exc, st->interp_qlpc, st->high, st->frame_size, st->lpcSize, st->mem_sp); + + fir_mem_up(st->x0d, h0, st->y0, st->full_frame_size, QMF_ORDER, st->g0_mem, stack); + fir_mem_up(st->high, h1, st->y1, st->full_frame_size, QMF_ORDER, st->g1_mem, stack); + + mix_and_saturate(st->y0, st->y1, out, st->full_frame_size); + + return 0; + + } + + for (i=0;iframe_size;i++) + st->exc[i]=0; + + ALLOC(low_pi_gain, st->nbSubframes, spx_word32_t); + ALLOC(low_exc, st->frame_size, spx_sig_t); + ALLOC(low_innov, st->frame_size, spx_sig_t); + speex_decoder_ctl(st->st_low, SPEEX_GET_PI_GAIN, low_pi_gain); + speex_decoder_ctl(st->st_low, SPEEX_GET_EXC, low_exc); + speex_decoder_ctl(st->st_low, SPEEX_GET_INNOV, low_innov); + + SUBMODE(lsp_unquant)(st->qlsp, st->lpcSize, bits); + + if (st->first) + { + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + } + + ALLOC(awk1, st->lpcSize+1, spx_coef_t); + ALLOC(awk2, st->lpcSize+1, spx_coef_t); + ALLOC(awk3, st->lpcSize+1, spx_coef_t); + + for (sub=0;subnbSubframes;sub++) + { + spx_sig_t *exc, *sp; + spx_word16_t filter_ratio; + spx_word16_t el=0; + int offset; + spx_word32_t rl=0,rh=0; + + offset = st->subframeSize*sub; + sp=st->high+offset; + exc=st->exc+offset; + + /* LSP interpolation */ + lsp_interpolate(st->old_qlsp, st->qlsp, st->interp_qlsp, st->lpcSize, sub, st->nbSubframes); + + lsp_enforce_margin(st->interp_qlsp, st->lpcSize, LSP_MARGIN); + + /* LSP to LPC */ + lsp_to_lpc(st->interp_qlsp, st->interp_qlpc, st->lpcSize, stack); + + + if (st->lpc_enh_enabled) + { + spx_word16_t k1,k2,k3; + k1=SUBMODE(lpc_enh_k1); + k2=SUBMODE(lpc_enh_k2); + k3=SUBMODE(lpc_enh_k3); + bw_lpc(k1, st->interp_qlpc, awk1, st->lpcSize); + bw_lpc(k2, st->interp_qlpc, awk2, st->lpcSize); + bw_lpc(k3, st->interp_qlpc, awk3, st->lpcSize); + /*fprintf (stderr, "%f %f %f\n", k1, k2, k3);*/ + } + + + /* Calculate reponse ratio between the low and high filter in the middle + of the band (4000 Hz) */ + + st->pi_gain[sub]=LPC_SCALING; + rh = LPC_SCALING; + for (i=1;i<=st->lpcSize;i+=2) + { + rh += st->interp_qlpc[i+1] - st->interp_qlpc[i]; + st->pi_gain[sub] += st->interp_qlpc[i] + st->interp_qlpc[i+1]; + } + + rl = low_pi_gain[sub]; +#ifdef FIXED_POINT + filter_ratio=DIV32_16(SHL(rl+82,2),SHR(82+rh,5)); +#else + filter_ratio=(rl+.01)/(rh+.01); +#endif + + for (i=0;isubframeSize;i++) + exc[i]=0; + if (!SUBMODE(innovation_unquant)) + { + float g; + int quant; + + quant = speex_bits_unpack_unsigned(bits, 5); + g= exp(((float)quant-10)/8.0); + +#ifdef FIXED_POINT + g /= filter_ratio/128.; +#else + g /= filter_ratio; +#endif + /* High-band excitation using the low-band excitation and a gain */ + for (i=0;isubframeSize;i++) + exc[i]=mode->folding_gain*g*low_innov[offset+i]; + /*speex_rand_vec(mode->folding_gain*g*sqrt(el/st->subframeSize), exc, st->subframeSize);*/ + } else { + spx_word16_t gc; + spx_word32_t scale; + int qgc = speex_bits_unpack_unsigned(bits, 4); + + el = compute_rms(low_exc+offset, st->subframeSize); + +#ifdef FIXED_POINT + gc = MULT16_32_Q15(28626,gc_quant_bound[qgc]); +#else + gc = exp((1/3.7)*qgc-0.15556); +#endif + + if (st->subframeSize==80) + gc *= 1.4142; + + scale = SHL(MULT16_16(DIV32_16(SHL(gc,SIG_SHIFT-4),filter_ratio),(1+el)),4); + + SUBMODE(innovation_unquant)(exc, SUBMODE(innovation_params), st->subframeSize, + bits, stack); + + signal_mul(exc,exc,scale,st->subframeSize); + + if (SUBMODE(double_codebook)) { + char *tmp_stack=stack; + VARDECL(spx_sig_t *innov2); + ALLOC(innov2, st->subframeSize, spx_sig_t); + for (i=0;isubframeSize;i++) + innov2[i]=0; + SUBMODE(innovation_unquant)(innov2, SUBMODE(innovation_params), st->subframeSize, + bits, stack); + for (i=0;isubframeSize;i++) + innov2[i]*=scale/(float)SIG_SCALING*(1/2.5); + for (i=0;isubframeSize;i++) + exc[i] = ADD32(exc[i],innov2[i]); + stack = tmp_stack; + } + + } + + for (i=0;isubframeSize;i++) + sp[i]=exc[i]; + if (st->lpc_enh_enabled) + { + /* Use enhanced LPC filter */ + filter_mem2(sp, awk2, awk1, sp, st->subframeSize, st->lpcSize, + st->mem_sp+st->lpcSize); + filter_mem2(sp, awk3, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } else { + /* Use regular filter */ + for (i=0;ilpcSize;i++) + st->mem_sp[st->lpcSize+i] = 0; + iir_mem2(sp, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, + st->mem_sp); + } + /*iir_mem2(exc, st->interp_qlpc, sp, st->subframeSize, st->lpcSize, st->mem_sp);*/ + + } + + fir_mem_up(st->x0d, h0, st->y0, st->full_frame_size, QMF_ORDER, st->g0_mem, stack); + fir_mem_up(st->high, h1, st->y1, st->full_frame_size, QMF_ORDER, st->g1_mem, stack); + + mix_and_saturate(st->y0, st->y1, out, st->full_frame_size); + + for (i=0;ilpcSize;i++) + st->old_qlsp[i] = st->qlsp[i]; + + st->first=0; + + return 0; +} + + +int sb_encoder_ctl(void *state, int request, void *ptr) +{ + SBEncState *st; + st=(SBEncState*)state; + switch(request) + { + case SPEEX_GET_FRAME_SIZE: + (*(int*)ptr) = st->full_frame_size; + break; + case SPEEX_SET_HIGH_MODE: + st->submodeSelect = st->submodeID = (*(int*)ptr); + break; + case SPEEX_SET_LOW_MODE: + speex_encoder_ctl(st->st_low, SPEEX_SET_LOW_MODE, ptr); + break; + case SPEEX_SET_DTX: + speex_encoder_ctl(st->st_low, SPEEX_SET_DTX, ptr); + break; + case SPEEX_GET_DTX: + speex_encoder_ctl(st->st_low, SPEEX_GET_DTX, ptr); + break; + case SPEEX_GET_LOW_MODE: + speex_encoder_ctl(st->st_low, SPEEX_GET_LOW_MODE, ptr); + break; + case SPEEX_SET_MODE: + speex_encoder_ctl(st, SPEEX_SET_QUALITY, ptr); + break; + case SPEEX_SET_VBR: + st->vbr_enabled = (*(int*)ptr); + speex_encoder_ctl(st->st_low, SPEEX_SET_VBR, ptr); + break; + case SPEEX_GET_VBR: + (*(int*)ptr) = st->vbr_enabled; + break; + case SPEEX_SET_VAD: + st->vad_enabled = (*(int*)ptr); + speex_encoder_ctl(st->st_low, SPEEX_SET_VAD, ptr); + break; + case SPEEX_GET_VAD: + (*(int*)ptr) = st->vad_enabled; + break; + case SPEEX_SET_VBR_QUALITY: + { + int q; + float qual = (*(float*)ptr)+.6; + st->vbr_quality = (*(float*)ptr); + if (qual>10) + qual=10; + q=(int)floor(.5+*(float*)ptr); + if (q>10) + q=10; + speex_encoder_ctl(st->st_low, SPEEX_SET_VBR_QUALITY, &qual); + speex_encoder_ctl(state, SPEEX_SET_QUALITY, &q); + break; + } + case SPEEX_SET_ABR: + st->abr_enabled = (*(int*)ptr); + st->vbr_enabled = 1; + speex_encoder_ctl(st->st_low, SPEEX_SET_VBR, &st->vbr_enabled); + { + int i=10, rate, target; + float vbr_qual; + target = (*(int*)ptr); + while (i>=0) + { + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &i); + speex_encoder_ctl(st, SPEEX_GET_BITRATE, &rate); + if (rate <= target) + break; + i--; + } + vbr_qual=i; + if (vbr_qual<0) + vbr_qual=0; + speex_encoder_ctl(st, SPEEX_SET_VBR_QUALITY, &vbr_qual); + st->abr_count=0; + st->abr_drift=0; + st->abr_drift2=0; + } + + break; + case SPEEX_GET_ABR: + (*(int*)ptr) = st->abr_enabled; + break; + case SPEEX_SET_QUALITY: + { + int nb_qual; + int quality = (*(int*)ptr); + if (quality < 0) + quality = 0; + if (quality > 10) + quality = 10; + st->submodeSelect = st->submodeID = ((const SpeexSBMode*)(st->mode->mode))->quality_map[quality]; + nb_qual = ((const SpeexSBMode*)(st->mode->mode))->low_quality_map[quality]; + speex_encoder_ctl(st->st_low, SPEEX_SET_MODE, &nb_qual); + } + break; + case SPEEX_SET_COMPLEXITY: + speex_encoder_ctl(st->st_low, SPEEX_SET_COMPLEXITY, ptr); + st->complexity = (*(int*)ptr); + if (st->complexity<1) + st->complexity=1; + break; + case SPEEX_GET_COMPLEXITY: + (*(int*)ptr) = st->complexity; + break; + case SPEEX_SET_BITRATE: + { + int i=10, rate, target; + target = (*(int*)ptr); + while (i>=0) + { + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &i); + speex_encoder_ctl(st, SPEEX_GET_BITRATE, &rate); + if (rate <= target) + break; + i--; + } + } + break; + case SPEEX_GET_BITRATE: + speex_encoder_ctl(st->st_low, request, ptr); + /*fprintf (stderr, "before: %d\n", (*(int*)ptr));*/ + if (st->submodes[st->submodeID]) + (*(int*)ptr) += st->sampling_rate*SUBMODE(bits_per_frame)/st->full_frame_size; + else + (*(int*)ptr) += st->sampling_rate*(SB_SUBMODE_BITS+1)/st->full_frame_size; + /*fprintf (stderr, "after: %d\n", (*(int*)ptr));*/ + break; + case SPEEX_SET_SAMPLING_RATE: + { + int tmp=(*(int*)ptr); + st->sampling_rate = tmp; + tmp>>=1; + speex_encoder_ctl(st->st_low, SPEEX_SET_SAMPLING_RATE, &tmp); + } + break; + case SPEEX_GET_SAMPLING_RATE: + (*(int*)ptr)=st->sampling_rate; + break; + case SPEEX_RESET_STATE: + { + int i; + st->first = 1; + for (i=0;ilpcSize;i++) + st->lsp[i]=(M_PI*((float)(i+1)))/(st->lpcSize+1); + for (i=0;ilpcSize;i++) + st->mem_sw[i]=st->mem_sp[i]=st->mem_sp2[i]=0; + for (i=0;ibufSize;i++) + st->excBuf[i]=0; + for (i=0;ih0_mem[i]=st->h1_mem[i]=st->g0_mem[i]=st->g1_mem[i]=0; + } + break; + case SPEEX_SET_SUBMODE_ENCODING: + st->encode_submode = (*(int*)ptr); + speex_encoder_ctl(st->st_low, SPEEX_SET_SUBMODE_ENCODING, &ptr); + break; + case SPEEX_GET_SUBMODE_ENCODING: + (*(int*)ptr) = st->encode_submode; + break; + case SPEEX_GET_LOOKAHEAD: + speex_encoder_ctl(st->st_low, SPEEX_GET_LOOKAHEAD, ptr); + (*(int*)ptr) = 2*(*(int*)ptr) + QMF_ORDER - 1; + break; + case SPEEX_GET_PI_GAIN: + { + int i; + spx_word32_t *g = (spx_word32_t*)ptr; + for (i=0;inbSubframes;i++) + g[i]=st->pi_gain[i]; + } + break; + case SPEEX_GET_EXC: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;ifull_frame_size;i++) + e[i]=0; + for (i=0;iframe_size;i++) + e[2*i]=2*st->exc[i]; + } + break; + case SPEEX_GET_INNOV: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;ifull_frame_size;i++) + e[i]=0; + for (i=0;iframe_size;i++) + e[2*i]=2*st->exc[i]; + } + break; + case SPEEX_GET_RELATIVE_QUALITY: + (*(float*)ptr)=st->relative_quality; + break; + default: + speex_warning_int("Unknown nb_ctl request: ", request); + return -1; + } + return 0; +} + +int sb_decoder_ctl(void *state, int request, void *ptr) +{ + SBDecState *st; + st=(SBDecState*)state; + switch(request) + { + case SPEEX_SET_HIGH_MODE: + st->submodeID = (*(int*)ptr); + break; + case SPEEX_SET_LOW_MODE: + speex_decoder_ctl(st->st_low, SPEEX_SET_LOW_MODE, ptr); + break; + case SPEEX_GET_LOW_MODE: + speex_decoder_ctl(st->st_low, SPEEX_GET_LOW_MODE, ptr); + break; + case SPEEX_GET_FRAME_SIZE: + (*(int*)ptr) = st->full_frame_size; + break; + case SPEEX_SET_ENH: + speex_decoder_ctl(st->st_low, request, ptr); + st->lpc_enh_enabled = *((int*)ptr); + break; + case SPEEX_SET_MODE: + case SPEEX_SET_QUALITY: + { + int nb_qual; + int quality = (*(int*)ptr); + if (quality < 0) + quality = 0; + if (quality > 10) + quality = 10; + st->submodeID = ((const SpeexSBMode*)(st->mode->mode))->quality_map[quality]; + nb_qual = ((const SpeexSBMode*)(st->mode->mode))->low_quality_map[quality]; + speex_decoder_ctl(st->st_low, SPEEX_SET_MODE, &nb_qual); + } + break; + case SPEEX_GET_BITRATE: + speex_decoder_ctl(st->st_low, request, ptr); + if (st->submodes[st->submodeID]) + (*(int*)ptr) += st->sampling_rate*SUBMODE(bits_per_frame)/st->full_frame_size; + else + (*(int*)ptr) += st->sampling_rate*(SB_SUBMODE_BITS+1)/st->full_frame_size; + break; + case SPEEX_SET_SAMPLING_RATE: + { + int tmp=(*(int*)ptr); + st->sampling_rate = tmp; + tmp>>=1; + speex_decoder_ctl(st->st_low, SPEEX_SET_SAMPLING_RATE, &tmp); + } + break; + case SPEEX_GET_SAMPLING_RATE: + (*(int*)ptr)=st->sampling_rate; + break; + case SPEEX_SET_HANDLER: + speex_decoder_ctl(st->st_low, SPEEX_SET_HANDLER, ptr); + break; + case SPEEX_SET_USER_HANDLER: + speex_decoder_ctl(st->st_low, SPEEX_SET_USER_HANDLER, ptr); + break; + case SPEEX_RESET_STATE: + { + int i; + for (i=0;i<2*st->lpcSize;i++) + st->mem_sp[i]=0; + for (i=0;ig0_mem[i]=st->g1_mem[i]=0; + } + break; + case SPEEX_SET_SUBMODE_ENCODING: + st->encode_submode = (*(int*)ptr); + speex_decoder_ctl(st->st_low, SPEEX_SET_SUBMODE_ENCODING, &ptr); + break; + case SPEEX_GET_SUBMODE_ENCODING: + (*(int*)ptr) = st->encode_submode; + break; + case SPEEX_GET_PI_GAIN: + { + int i; + spx_word32_t *g = (spx_word32_t*)ptr; + for (i=0;inbSubframes;i++) + g[i]=st->pi_gain[i]; + } + break; + case SPEEX_GET_EXC: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;ifull_frame_size;i++) + e[i]=0; + for (i=0;iframe_size;i++) + e[2*i]=2*st->exc[i]; + } + break; + case SPEEX_GET_INNOV: + { + int i; + spx_sig_t *e = (spx_sig_t*)ptr; + for (i=0;ifull_frame_size;i++) + e[i]=0; + for (i=0;iframe_size;i++) + e[2*i]=2*st->exc[i]; + } + break; + case SPEEX_GET_DTX_STATUS: + speex_decoder_ctl(st->st_low, SPEEX_GET_DTX_STATUS, ptr); + break; + default: + speex_warning_int("Unknown nb_ctl request: ", request); + return -1; + } + return 0; +} + +#endif + diff --git a/3rdparty/iaxclient-2/lib/libspeex/sb_celp.h b/3rdparty/iaxclient-2/lib/libspeex/sb_celp.h new file mode 100644 index 0000000..b812a2e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/sb_celp.h @@ -0,0 +1,169 @@ +/* Copyright (C) 2002 Jean-Marc Valin */ +/** + @file sb_celp.h + @brief Sub-band CELP mode used for wideband encoding +*/ +/* + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifndef SB_CELP_H +#define SB_CELP_H + +#include "modes.h" +#include +#include "nb_celp.h" + +/**Structure representing the full state of the sub-band encoder*/ +typedef struct SBEncState { + const SpeexMode *mode; /**< Pointer to the mode (containing for vtable info) */ + void *st_low; /**< State of the low-band (narrowband) encoder */ + int full_frame_size; /**< Length of full-band frames*/ + int frame_size; /**< Length of high-band frames*/ + int subframeSize; /**< Length of high-band sub-frames*/ + int nbSubframes; /**< Number of high-band sub-frames*/ + int windowSize; /**< Length of high-band LPC window*/ + int lpcSize; /**< Order of high-band LPC analysis */ + int bufSize; /**< Buffer size */ + int first; /**< First frame? */ + float lag_factor; /**< Lag-windowing control parameter */ + float lpc_floor; /**< Controls LPC analysis noise floor */ + spx_word16_t gamma1; /**< Perceptual weighting coef 1 */ + spx_word16_t gamma2; /**< Perceptual weighting coef 2 */ + + char *stack; /**< Temporary allocation stack */ + spx_sig_t *x0d, *x1d; /**< QMF filter signals*/ + spx_sig_t *high; /**< High-band signal (buffer) */ + spx_sig_t *y0, *y1; /**< QMF synthesis signals */ + spx_word16_t *h0_mem, *h1_mem; + spx_word32_t *g0_mem, *g1_mem; /**< QMF memories */ + + spx_sig_t *excBuf; /**< High-band excitation */ + spx_sig_t *exc; /**< High-band excitation (for QMF only)*/ + spx_sig_t *buf; /**< Temporary buffer */ + spx_sig_t *res; /**< Zero-input response (ringing) */ + spx_sig_t *sw; /**< Perceptually weighted signal */ + spx_sig_t *target; /**< Weighted target signal (analysis by synthesis) */ + spx_word16_t *window; /**< LPC analysis window */ + spx_word16_t *lagWindow; /**< Auto-correlation window */ + spx_word16_t *autocorr; /**< Auto-correlation (for LPC analysis) */ + spx_coef_t *lpc; /**< LPC coefficients */ + spx_lsp_t *lsp; /**< LSP coefficients */ + spx_lsp_t *qlsp; /**< Quantized LSPs */ + spx_lsp_t *old_lsp; /**< LSPs of previous frame */ + spx_lsp_t *old_qlsp; /**< Quantized LSPs of previous frame */ + spx_lsp_t *interp_lsp; /**< Interpolated LSPs for current sub-frame */ + spx_lsp_t *interp_qlsp; /**< Interpolated quantized LSPs for current sub-frame */ + spx_coef_t *interp_lpc; /**< Interpolated LPCs for current sub-frame */ + spx_coef_t *interp_qlpc; /**< Interpolated quantized LPCs for current sub-frame */ + spx_coef_t *bw_lpc1; /**< Bandwidth-expanded version of LPCs (#1) */ + spx_coef_t *bw_lpc2; /**< Bandwidth-expanded version of LPCs (#2) */ + + spx_mem_t *mem_sp; /**< Synthesis signal memory */ + spx_mem_t *mem_sp2; + spx_mem_t *mem_sw; /**< Perceptual signal memory */ + spx_word32_t *pi_gain; + + float vbr_quality; /**< Quality setting for VBR encoding */ + int vbr_enabled; /**< 1 for enabling VBR, 0 otherwise */ + int abr_enabled; /**< ABR setting (in bps), 0 if off */ + float abr_drift; + float abr_drift2; + float abr_count; + int vad_enabled; /**< 1 for enabling VAD, 0 otherwise */ + float relative_quality; + + int encode_submode; + const SpeexSubmode * const *submodes; + int submodeID; + int submodeSelect; + int complexity; + int sampling_rate; + +} SBEncState; + + +/**Structure representing the full state of the sub-band decoder*/ +typedef struct SBDecState { + const SpeexMode *mode; /**< Pointer to the mode (containing for vtable info) */ + void *st_low; /**< State of the low-band (narrowband) encoder */ + int full_frame_size; + int frame_size; + int subframeSize; + int nbSubframes; + int lpcSize; + int first; + int sampling_rate; + int lpc_enh_enabled; + + char *stack; + spx_sig_t *x0d, *x1d; + spx_sig_t *high; + spx_sig_t *y0, *y1; + spx_word32_t *g0_mem, *g1_mem; + + spx_sig_t *exc; + spx_lsp_t *qlsp; + spx_lsp_t *old_qlsp; + spx_lsp_t *interp_qlsp; + spx_coef_t *interp_qlpc; + + spx_mem_t *mem_sp; + spx_word32_t *pi_gain; + + int encode_submode; + const SpeexSubmode * const *submodes; + int submodeID; +} SBDecState; + + +/**Initializes encoder state*/ +void *sb_encoder_init(const SpeexMode *m); + +/**De-allocates encoder state resources*/ +void sb_encoder_destroy(void *state); + +/**Encodes one frame*/ +int sb_encode(void *state, void *in, SpeexBits *bits); + + +/**Initializes decoder state*/ +void *sb_decoder_init(const SpeexMode *m); + +/**De-allocates decoder state resources*/ +void sb_decoder_destroy(void *state); + +/**Decodes one frame*/ +int sb_decode(void *state, SpeexBits *bits, void *out); + +int sb_encoder_ctl(void *state, int request, void *ptr); + +int sb_decoder_ctl(void *state, int request, void *ptr); + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/smallft.c b/3rdparty/iaxclient-2/lib/libspeex/smallft.c new file mode 100644 index 0000000..197587d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/smallft.c @@ -0,0 +1,1260 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2001 * + * by the XIPHOPHORUS Company http://www.xiph.org/ * + * * + ******************************************************************** + + function: *unnormalized* fft transform + last mod: $Id: smallft.c 465 2005-05-13 19:19:47Z stevek $ + + ********************************************************************/ + +/* FFT implementation from OggSquish, minus cosine transforms, + * minus all but radix 2/4 case. In Vorbis we only need this + * cut-down version. + * + * To do more than just power-of-two sized vectors, see the full + * version I wrote for NetLib. + * + * Note that the packing is a little strange; rather than the FFT r/i + * packing following R_0, I_n, R_1, I_1, R_2, I_2 ... R_n-1, I_n-1, + * it follows R_0, R_1, I_1, R_2, I_2 ... R_n-1, I_n-1, I_n like the + * FORTRAN version + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "smallft.h" +#include "misc.h" + +static void drfti1(int n, float *wa, int *ifac){ + static int ntryh[4] = { 4,2,3,5 }; + static float tpi = 6.28318530717958648f; + float arg,argh,argld,fi; + int ntry=0,i,j=-1; + int k1, l1, l2, ib; + int ld, ii, ip, is, nq, nr; + int ido, ipm, nfm1; + int nl=n; + int nf=0; + + L101: + j++; + if (j < 4) + ntry=ntryh[j]; + else + ntry+=2; + + L104: + nq=nl/ntry; + nr=nl-ntry*nq; + if (nr!=0) goto L101; + + nf++; + ifac[nf+1]=ntry; + nl=nq; + if(ntry!=2)goto L107; + if(nf==1)goto L107; + + for (i=1;i>1; + ipp2=ip; + idp2=ido; + nbd=(ido-1)>>1; + t0=l1*ido; + t10=ip*ido; + + if(ido==1)goto L119; + for(ik=0;ikl1){ + for(j=1;j>1; + ipp2=ip; + ipph=(ip+1)>>1; + if(idol1)goto L139; + + is= -ido-1; + t1=0; + for(j=1;jn==1)return; + drftf1(l->n,data,l->trigcache,l->trigcache+l->n,l->splitcache); +} + +void spx_drft_backward(struct drft_lookup *l,float *data){ + if (l->n==1)return; + drftb1(l->n,data,l->trigcache,l->trigcache+l->n,l->splitcache); +} + +void spx_drft_init(struct drft_lookup *l,int n) +{ + l->n=n; + l->trigcache=(float*)speex_alloc(3*n*sizeof(*l->trigcache)); + l->splitcache=(int*)speex_alloc(32*sizeof(*l->splitcache)); + fdrffti(n, l->trigcache, l->splitcache); +} + +void spx_drft_clear(struct drft_lookup *l) +{ + if(l) + { + if(l->trigcache) + speex_free(l->trigcache); + if(l->splitcache) + speex_free(l->splitcache); + } +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/smallft.h b/3rdparty/iaxclient-2/lib/libspeex/smallft.h new file mode 100644 index 0000000..303bc87 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/smallft.h @@ -0,0 +1,42 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2001 * + * by the XIPHOPHORUS Company http://www.xiph.org/ * + * * + ******************************************************************** + + function: fft transform + last mod: $Id: smallft.h 465 2005-05-13 19:19:47Z stevek $ + + ********************************************************************/ + +#ifndef _V_SMFT_H_ +#define _V_SMFT_H_ + +/*#include "vorbis/codec.h"*/ + +#ifdef __cplusplus +extern "C" { +#endif + +struct drft_lookup{ + int n; + float *trigcache; + int *splitcache; +}; + +extern void spx_drft_forward(struct drft_lookup *l,float *data); +extern void spx_drft_backward(struct drft_lookup *l,float *data); +extern void spx_drft_init(struct drft_lookup *l,int n); +extern void spx_drft_clear(struct drft_lookup *l); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/speex.c b/3rdparty/iaxclient-2/lib/libspeex/speex.c new file mode 100644 index 0000000..94829e6 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/speex.c @@ -0,0 +1,268 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: speex.c + + Basic Speex functions + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "modes.h" +#include + +#ifndef NULL +#define NULL 0 +#endif + +#define MAX_IN_SAMPLES 640 + + + +void *speex_encoder_init(const SpeexMode *mode) +{ + return mode->enc_init(mode); +} + +void *speex_decoder_init(const SpeexMode *mode) +{ + return mode->dec_init(mode); +} + +void speex_encoder_destroy(void *state) +{ + (*((SpeexMode**)state))->enc_destroy(state); +} + +void speex_decoder_destroy(void *state) +{ + (*((SpeexMode**)state))->dec_destroy(state); +} + + + +int speex_encode_native(void *state, spx_word16_t *in, SpeexBits *bits) +{ + return (*((SpeexMode**)state))->enc(state, in, bits); +} + +int speex_decode_native(void *state, SpeexBits *bits, spx_word16_t *out) +{ + return (*((SpeexMode**)state))->dec(state, bits, out); +} + + + +#ifdef FIXED_POINT + +int speex_encode(void *state, float *in, SpeexBits *bits) +{ + int i; + int N; + spx_int16_t short_in[MAX_IN_SAMPLES]; + speex_encoder_ctl(state, SPEEX_GET_FRAME_SIZE, &N); + for (i=0;i32767.f) + short_in[i] = 32767; + else if (in[i]<-32768.f) + short_in[i] = -32768; + else + short_in[i] = (spx_int16_t)floor(.5+in[i]); + } + return (*((SpeexMode**)state))->enc(state, short_in, bits); +} + +int speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits) +{ + SpeexMode *mode; + mode = *(SpeexMode**)state; + return (mode)->enc(state, in, bits); +} + +int speex_decode(void *state, SpeexBits *bits, float *out) +{ + int i, ret; + int N; + spx_int16_t short_out[MAX_IN_SAMPLES]; + speex_decoder_ctl(state, SPEEX_GET_FRAME_SIZE, &N); + ret = (*((SpeexMode**)state))->dec(state, bits, short_out); + for (i=0;idec(state, bits, out); +} + +#else + +int speex_encode(void *state, float *in, SpeexBits *bits) +{ + return (*((SpeexMode**)state))->enc(state, in, bits); +} + +int speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits) +{ + int i; + int N; + float float_in[MAX_IN_SAMPLES]; + speex_encoder_ctl(state, SPEEX_GET_FRAME_SIZE, &N); + for (i=0;ienc(state, float_in, bits); +} + +int speex_decode(void *state, SpeexBits *bits, float *out) +{ + return (*((SpeexMode**)state))->dec(state, bits, out); +} + +int speex_decode_int(void *state, SpeexBits *bits, spx_int16_t *out) +{ + int i; + int N; + float float_out[MAX_IN_SAMPLES]; + int ret; + speex_decoder_ctl(state, SPEEX_GET_FRAME_SIZE, &N); + ret = (*((SpeexMode**)state))->dec(state, bits, float_out); + for (i=0;i32767.f) + out[i] = 32767; + else if (float_out[i]<-32768.f) + out[i] = -32768; + else + out[i] = (spx_int16_t)floor(.5+float_out[i]); + } + return ret; +} +#endif + + + +int speex_encoder_ctl(void *state, int request, void *ptr) +{ + return (*((SpeexMode**)state))->enc_ctl(state, request, ptr); +} + +int speex_decoder_ctl(void *state, int request, void *ptr) +{ + return (*((SpeexMode**)state))->dec_ctl(state, request, ptr); +} + + + +int nb_mode_query(const void *mode, int request, void *ptr) +{ + const SpeexNBMode *m = (const SpeexNBMode*)mode; + + switch (request) + { + case SPEEX_MODE_FRAME_SIZE: + *((int*)ptr)=m->frameSize; + break; + case SPEEX_SUBMODE_BITS_PER_FRAME: + if (*((int*)ptr)==0) + *((int*)ptr) = NB_SUBMODE_BITS+1; + else if (m->submodes[*((int*)ptr)]==NULL) + *((int*)ptr) = -1; + else + *((int*)ptr) = m->submodes[*((int*)ptr)]->bits_per_frame; + break; + default: + speex_warning_int("Unknown nb_mode_query request: ", request); + return -1; + } + return 0; +} + +int wb_mode_query(const void *mode, int request, void *ptr) +{ + const SpeexSBMode *m = (const SpeexSBMode*)mode; + + switch (request) + { + case SPEEX_MODE_FRAME_SIZE: + *((int*)ptr)=2*m->frameSize; + break; + case SPEEX_SUBMODE_BITS_PER_FRAME: + if (*((int*)ptr)==0) + *((int*)ptr) = SB_SUBMODE_BITS+1; + else if (m->submodes[*((int*)ptr)]==NULL) + *((int*)ptr) = -1; + else + *((int*)ptr) = m->submodes[*((int*)ptr)]->bits_per_frame; + break; + default: + speex_warning_int("Unknown wb_mode_query request: ", request); + return -1; + } + return 0; +} + + +int speex_lib_ctl(int request, void *ptr) +{ + switch (request) + { + case SPEEX_LIB_GET_MAJOR_VERSION: + *((int*)ptr) = SPEEX_MAJOR_VERSION; + break; + case SPEEX_LIB_GET_MINOR_VERSION: + *((int*)ptr) = SPEEX_MINOR_VERSION; + break; + case SPEEX_LIB_GET_MICRO_VERSION: + *((int*)ptr) = SPEEX_MICRO_VERSION; + break; + case SPEEX_LIB_GET_EXTRA_VERSION: + *((const char**)ptr) = SPEEX_EXTRA_VERSION; + break; + case SPEEX_LIB_GET_VERSION_STRING: + *((const char**)ptr) = SPEEX_VERSION; + break; + /*case SPEEX_LIB_SET_ALLOC_FUNC: + break; + case SPEEX_LIB_GET_ALLOC_FUNC: + break; + case SPEEX_LIB_SET_FREE_FUNC: + break; + case SPEEX_LIB_GET_FREE_FUNC: + break;*/ + default: + speex_warning_int("Unknown wb_mode_query request: ", request); + return -1; + } + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/speex_callbacks.c b/3rdparty/iaxclient-2/lib/libspeex/speex_callbacks.c new file mode 100644 index 0000000..0b99188 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/speex_callbacks.c @@ -0,0 +1,140 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File speex_callbacks.c + Callback handling and in-band signalling + + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include "misc.h" + +int speex_inband_handler(SpeexBits *bits, SpeexCallback *callback_list, void *state) +{ + int id; + SpeexCallback *callback; + /*speex_bits_advance(bits, 5);*/ + id=speex_bits_unpack_unsigned(bits, 4); + callback = callback_list+id; + + if (callback->func) + { + return callback->func(bits, state, callback->data); + } else + /*If callback is not registered, skip the right number of bits*/ + { + int adv; + if (id<2) + adv = 1; + else if (id<8) + adv = 4; + else if (id<10) + adv = 8; + else if (id<12) + adv = 16; + else if (id<14) + adv = 32; + else + adv = 64; + speex_bits_advance(bits, adv); + } + return 0; +} + +int speex_std_mode_request_handler(SpeexBits *bits, void *state, void *data) +{ + int m; + m = speex_bits_unpack_unsigned(bits, 4); + speex_encoder_ctl(data, SPEEX_SET_MODE, &m); + return 0; +} + +int speex_std_low_mode_request_handler(SpeexBits *bits, void *state, void *data) +{ + int m; + m = speex_bits_unpack_unsigned(bits, 4); + speex_encoder_ctl(data, SPEEX_SET_LOW_MODE, &m); + return 0; +} + +int speex_std_high_mode_request_handler(SpeexBits *bits, void *state, void *data) +{ + int m; + m = speex_bits_unpack_unsigned(bits, 4); + speex_encoder_ctl(data, SPEEX_SET_HIGH_MODE, &m); + return 0; +} + +int speex_std_vbr_request_handler(SpeexBits *bits, void *state, void *data) +{ + int vbr; + vbr = speex_bits_unpack_unsigned(bits, 1); + speex_encoder_ctl(data, SPEEX_SET_VBR, &vbr); + return 0; +} + +int speex_std_enh_request_handler(SpeexBits *bits, void *state, void *data) +{ + int enh; + enh = speex_bits_unpack_unsigned(bits, 1); + speex_decoder_ctl(data, SPEEX_SET_ENH, &enh); + return 0; +} + +int speex_std_vbr_quality_request_handler(SpeexBits *bits, void *state, void *data) +{ + int qual; + qual = speex_bits_unpack_unsigned(bits, 4); + speex_encoder_ctl(data, SPEEX_SET_VBR_QUALITY, &qual); + return 0; +} + + +int speex_std_char_handler(SpeexBits *bits, void *state, void *data) +{ + unsigned char ch; + ch = speex_bits_unpack_unsigned(bits, 8); + _speex_putc(ch, data); + /*printf("speex_std_char_handler ch=%x\n", ch);*/ + return 0; +} + + + +/* Default handler for user callbacks: skip it */ +int speex_default_user_handler(SpeexBits *bits, void *state, void *data) +{ + int req_size = speex_bits_unpack_unsigned(bits, 4); + speex_bits_advance(bits, 5+8*req_size); + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/speex_header.c b/3rdparty/iaxclient-2/lib/libspeex/speex_header.c new file mode 100644 index 0000000..93e2423 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/speex_header.c @@ -0,0 +1,166 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: speex_header.c + Describes the Speex header + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "misc.h" +#include +#include + +#ifndef NULL +#define NULL 0 +#endif + +#define ENDIAN_SWITCH(x) {x=le_int(x);} + + +/* +typedef struct SpeexHeader { + char speex_string[8]; + char speex_version[SPEEX_HEADER_VERSION_LENGTH]; + int speex_version_id; + int header_size; + int rate; + int mode; + int mode_bitstream_version; + int nb_channels; + int bitrate; + int frame_size; + int vbr; + int frames_per_packet; + int extra_headers; + int reserved1; + int reserved2; +} SpeexHeader; +*/ + +void speex_init_header(SpeexHeader *header, int rate, int nb_channels, const SpeexMode *m) +{ + int i; + const char *h="Speex "; + /* + strncpy(header->speex_string, "Speex ", 8); + strncpy(header->speex_version, SPEEX_VERSION, SPEEX_HEADER_VERSION_LENGTH-1); + header->speex_version[SPEEX_HEADER_VERSION_LENGTH-1]=0; + */ + for (i=0;i<8;i++) + header->speex_string[i]=h[i]; + for (i=0;ispeex_version[i]=SPEEX_VERSION[i]; + for (;ispeex_version[i]=0; + + header->speex_version_id = 1; + header->header_size = sizeof(SpeexHeader); + + header->rate = rate; + header->mode = m->modeID; + header->mode_bitstream_version = m->bitstream_version; + if (m->modeID<0) + speex_warning("This mode is meant to be used alone"); + header->nb_channels = nb_channels; + header->bitrate = -1; + speex_mode_query(m, SPEEX_MODE_FRAME_SIZE, &header->frame_size); + header->vbr = 0; + + header->frames_per_packet = 0; + header->extra_headers = 0; + header->reserved1 = 0; + header->reserved2 = 0; +} + +char *speex_header_to_packet(SpeexHeader *header, int *size) +{ + SpeexHeader *le_header; + le_header = (SpeexHeader*)speex_alloc(sizeof(SpeexHeader)); + + speex_move(le_header, header, sizeof(SpeexHeader)); + + /*Make sure everything is now little-endian*/ + ENDIAN_SWITCH(le_header->speex_version_id); + ENDIAN_SWITCH(le_header->header_size); + ENDIAN_SWITCH(le_header->rate); + ENDIAN_SWITCH(le_header->mode); + ENDIAN_SWITCH(le_header->mode_bitstream_version); + ENDIAN_SWITCH(le_header->nb_channels); + ENDIAN_SWITCH(le_header->bitrate); + ENDIAN_SWITCH(le_header->frame_size); + ENDIAN_SWITCH(le_header->vbr); + ENDIAN_SWITCH(le_header->frames_per_packet); + ENDIAN_SWITCH(le_header->extra_headers); + + *size = sizeof(SpeexHeader); + return (char *)le_header; +} + +SpeexHeader *speex_packet_to_header(char *packet, int size) +{ + int i; + SpeexHeader *le_header; + const char *h = "Speex "; + for (i=0;i<8;i++) + if (packet[i]!=h[i]) + { + speex_warning ("This doesn't look like a Speex file"); + return NULL; + } + + /*FIXME: Do we allow larger headers?*/ + if (size < sizeof(SpeexHeader)) + { + speex_warning("Speex header too small"); + return NULL; + } + + le_header = (SpeexHeader*)speex_alloc(sizeof(SpeexHeader)); + + speex_move(le_header, packet, sizeof(SpeexHeader)); + + /*Make sure everything is converted correctly from little-endian*/ + ENDIAN_SWITCH(le_header->speex_version_id); + ENDIAN_SWITCH(le_header->header_size); + ENDIAN_SWITCH(le_header->rate); + ENDIAN_SWITCH(le_header->mode); + ENDIAN_SWITCH(le_header->mode_bitstream_version); + ENDIAN_SWITCH(le_header->nb_channels); + ENDIAN_SWITCH(le_header->bitrate); + ENDIAN_SWITCH(le_header->frame_size); + ENDIAN_SWITCH(le_header->vbr); + ENDIAN_SWITCH(le_header->frames_per_packet); + ENDIAN_SWITCH(le_header->extra_headers); + + return le_header; + +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/stack_alloc.h b/3rdparty/iaxclient-2/lib/libspeex/stack_alloc.h new file mode 100644 index 0000000..9d18468 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/stack_alloc.h @@ -0,0 +1,79 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: stack_alloc.h + + Temporary memory allocation on stack + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef STACK_ALLOC_H +#define STACK_ALLOC_H + +#ifdef USE_ALLOCA +#include +#endif + +#ifdef ENABLE_VALGRIND + +#include +/*Aligns the stack to a 'size' boundary */ +#define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) + +/* Allocates 'size' elements of type 'type' on the stack */ +#define PUSH(stack, size, type) (VALGRIND_MAKE_NOACCESS(stack, 1000),ALIGN((stack),sizeof(type)),VALGRIND_MAKE_WRITABLE(stack, ((size)*sizeof(type))),(stack)+=((size)*sizeof(type)),(type*)((stack)-((size)*sizeof(type)))) + +/* Allocates a struct stack */ +#define PUSHS(stack, type) (VALGRIND_MAKE_NOACCESS(stack, 1000),ALIGN((stack),sizeof(long)),VALGRIND_MAKE_WRITABLE(stack, (sizeof(type))),(stack)+=(sizeof(type)),(type*)((stack)-(sizeof(type)))) + +#else + + +/*Aligns the stack to a 'size' boundary */ +#define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) + +/* Allocates 'size' elements of type 'type' on the stack */ +#define PUSH(stack, size, type) (ALIGN((stack),sizeof(type)),(stack)+=((size)*sizeof(type)),(type*)((stack)-((size)*sizeof(type)))) + +/* Allocates a struct stack */ +#define PUSHS(stack, type) (ALIGN((stack),sizeof(long)),(stack)+=(sizeof(type)),(type*)((stack)-(sizeof(type)))) + +#endif + +#if defined(VAR_ARRAYS) +#define VARDECL(var) +#define ALLOC(var, size, type) type var[size] +#elif defined(USE_ALLOCA) +#define VARDECL(var) var +#define ALLOC(var, size, type) var = alloca(sizeof(type)*size) +#else +#define VARDECL(var) var +#define ALLOC(var, size, type) var = PUSH(stack, size, type) +#endif + + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/stereo.c b/3rdparty/iaxclient-2/lib/libspeex/stereo.c new file mode 100644 index 0000000..f18387e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/stereo.c @@ -0,0 +1,192 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: stereo.c + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include +#include "vq.h" +#include + +/*float e_ratio_quant[4] = {1, 1.26, 1.587, 2};*/ +static const float e_ratio_quant[4] = {.25f, .315f, .397f, .5f}; + +void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits) +{ + int i, tmp; + float e_left=0, e_right=0, e_tot=0; + float balance, e_ratio; + for (i=0;i0) + speex_bits_pack(bits, 0, 1); + else + speex_bits_pack(bits, 1, 1); + balance=floor(.5+fabs(balance)); + if (balance>30) + balance=31; + + speex_bits_pack(bits, (int)balance, 5); + + /*Quantize energy ratio*/ + tmp=vq_index(&e_ratio, e_ratio_quant, 1, 4); + speex_bits_pack(bits, tmp, 2); +} + +void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits) +{ + int i, tmp; + float e_left=0, e_right=0, e_tot=0; + float balance, e_ratio; + for (i=0;i0) + speex_bits_pack(bits, 0, 1); + else + speex_bits_pack(bits, 1, 1); + balance=floor(.5+fabs(balance)); + if (balance>30) + balance=31; + + speex_bits_pack(bits, (int)balance, 5); + + /*Quantize energy ratio*/ + tmp=vq_index(&e_ratio, e_ratio_quant, 1, 4); + speex_bits_pack(bits, tmp, 2); +} + +void speex_decode_stereo(float *data, int frame_size, SpeexStereoState *stereo) +{ + float balance, e_ratio; + int i; + float e_tot=0, e_left, e_right, e_sum; + + balance=stereo->balance; + e_ratio=stereo->e_ratio; + for (i=frame_size-1;i>=0;i--) + { + e_tot += ((float)data[i])*data[i]; + } + e_sum=e_tot/e_ratio; + e_left = e_sum*balance / (1+balance); + e_right = e_sum-e_left; + + e_left = sqrt(e_left/(e_tot+.01)); + e_right = sqrt(e_right/(e_tot+.01)); + + for (i=frame_size-1;i>=0;i--) + { + float ftmp=data[i]; + stereo->smooth_left = .98*stereo->smooth_left + .02*e_left; + stereo->smooth_right = .98*stereo->smooth_right + .02*e_right; + data[2*i] = stereo->smooth_left*ftmp; + data[2*i+1] = stereo->smooth_right*ftmp; + } +} + +void speex_decode_stereo_int(spx_int16_t *data, int frame_size, SpeexStereoState *stereo) +{ + float balance, e_ratio; + int i; + float e_tot=0, e_left, e_right, e_sum; + + balance=stereo->balance; + e_ratio=stereo->e_ratio; + for (i=frame_size-1;i>=0;i--) + { + e_tot += ((float)data[i])*data[i]; + } + e_sum=e_tot/e_ratio; + e_left = e_sum*balance / (1+balance); + e_right = e_sum-e_left; + + e_left = sqrt(e_left/(e_tot+.01)); + e_right = sqrt(e_right/(e_tot+.01)); + + for (i=frame_size-1;i>=0;i--) + { + float ftmp=data[i]; + stereo->smooth_left = .98*stereo->smooth_left + .02*e_left; + stereo->smooth_right = .98*stereo->smooth_right + .02*e_right; + data[2*i] = stereo->smooth_left*ftmp; + data[2*i+1] = stereo->smooth_right*ftmp; + } +} + +int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data) +{ + SpeexStereoState *stereo; + float sign=1; + int tmp; + + stereo = (SpeexStereoState*)data; + if (speex_bits_unpack_unsigned(bits, 1)) + sign=-1; + tmp = speex_bits_unpack_unsigned(bits, 5); + stereo->balance = exp(sign*.25*tmp); + + tmp = speex_bits_unpack_unsigned(bits, 2); + stereo->e_ratio = e_ratio_quant[tmp]; + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/testdenoise.c b/3rdparty/iaxclient-2/lib/libspeex/testdenoise.c new file mode 100644 index 0000000..177227d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/testdenoise.c @@ -0,0 +1,44 @@ +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include + +#define NN 160 + +int main() +{ + short in[NN]; + int i; + SpeexPreprocessState *st; + int count=0; + float f; + + st = speex_preprocess_state_init(NN, 8000); + i=1; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_DENOISE, &i); + i=0; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_AGC, &i); + f=8000; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_AGC_LEVEL, &f); + i=0; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_DEREVERB, &i); + f=.4; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_DEREVERB_DECAY, &f); + f=.3; + speex_preprocess_ctl(st, SPEEX_PREPROCESS_SET_DEREVERB_LEVEL, &f); + while (1) + { + int vad; + fread(in, sizeof(short), NN, stdin); + if (feof(stdin)) + break; + vad = speex_preprocess(st, in, NULL); + /*fprintf (stderr, "%d\n", vad);*/ + fwrite(in, sizeof(short), NN, stdout); + count++; + } + speex_preprocess_state_destroy(st); + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/testecho.c b/3rdparty/iaxclient-2/lib/libspeex/testecho.c new file mode 100644 index 0000000..dd2aea8 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/testecho.c @@ -0,0 +1,45 @@ +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include +#include +#include +#include +#include +#include "speex/speex_echo.h" +#include "speex/speex_preprocess.h" + + +#define NN 160 + +int main() +{ + int echo_fd, ref_fd, e_fd; + float noise[NN+1]; + short echo_buf[NN], ref_buf[NN], e_buf[NN]; + SpeexEchoState *st; + SpeexPreprocessState *den; + + echo_fd = open ("play.sw", O_RDONLY); + ref_fd = open ("rec.sw", O_RDONLY); + e_fd = open ("echo.sw", O_WRONLY | O_CREAT | O_TRUNC, 0644); + + st = speex_echo_state_init(NN, 8*NN); + den = speex_preprocess_state_init(NN, 8000); + + while (read(ref_fd, ref_buf, NN*2)) + { + read(echo_fd, echo_buf, NN*2); + speex_echo_cancel(st, ref_buf, echo_buf, e_buf, noise); + speex_preprocess(den, e_buf, noise); + write(e_fd, e_buf, NN*2); + } + speex_echo_state_destroy(st); + speex_preprocess_state_destroy(den); + close(e_fd); + close(echo_fd); + close(ref_fd); + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/testenc.c b/3rdparty/iaxclient-2/lib/libspeex/testenc.c new file mode 100644 index 0000000..2d8c785 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/testenc.c @@ -0,0 +1,136 @@ +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include +#include +#include +#include + +#ifdef FIXED_DEBUG +extern long long spx_mips; +#endif + +#define FRAME_SIZE 160 +#include +int main(int argc, char **argv) +{ + char *inFile, *outFile, *bitsFile; + FILE *fin, *fout, *fbits=NULL; + short in_short[FRAME_SIZE]; + short out_short[FRAME_SIZE]; + float in_float[FRAME_SIZE]; + float sigpow,errpow,snr, seg_snr=0; + int snr_frames = 0; + char cbits[200]; + int nbBits; + int i; + void *st; + void *dec; + SpeexBits bits; + int tmp; + int bitCount=0; + int skip_group_delay; + SpeexCallback callback; + + sigpow = 0; + errpow = 0; + + st = speex_encoder_init(&speex_nb_mode); + dec = speex_decoder_init(&speex_nb_mode); + + callback.callback_id = SPEEX_INBAND_CHAR; + callback.func = speex_std_char_handler; + callback.data = stderr; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + callback.callback_id = SPEEX_INBAND_MODE_REQUEST; + callback.func = speex_std_mode_request_handler; + callback.data = st; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + tmp=0; + speex_decoder_ctl(dec, SPEEX_SET_ENH, &tmp); + tmp=0; + speex_encoder_ctl(st, SPEEX_SET_VBR, &tmp); + tmp=4; + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &tmp); + tmp=1; + speex_encoder_ctl(st, SPEEX_SET_COMPLEXITY, &tmp); + + speex_mode_query(&speex_nb_mode, SPEEX_MODE_FRAME_SIZE, &tmp); + fprintf (stderr, "frame size: %d\n", tmp); + skip_group_delay = tmp / 2; + + if (argc != 4 && argc != 3) + { + fprintf (stderr, "Usage: encode [in file] [out file] [bits file]\nargc = %d", argc); + exit(1); + } + inFile = argv[1]; + fin = fopen(inFile, "r"); + outFile = argv[2]; + fout = fopen(outFile, "w+"); + if (argc==4) + { + bitsFile = argv[3]; + fbits = fopen(bitsFile, "w"); + } + speex_bits_init(&bits); + while (!feof(fin)) + { + fread(in_short, sizeof(short), FRAME_SIZE, fin); + if (feof(fin)) + break; + for (i=0;i +#include +#include +#include + +#ifdef FIXED_DEBUG +extern long long spx_mips; +#endif + +#define FRAME_SIZE 640 +#include +int main(int argc, char **argv) +{ + char *inFile, *outFile, *bitsFile; + FILE *fin, *fout, *fbits=NULL; + short in_short[FRAME_SIZE]; + short out_short[FRAME_SIZE]; + float in_float[FRAME_SIZE]; + float sigpow,errpow,snr, seg_snr=0; + int snr_frames = 0; + char cbits[200]; + int nbBits; + int i; + void *st; + void *dec; + SpeexBits bits; + int tmp; + int bitCount=0; + int skip_group_delay; + SpeexCallback callback; + + sigpow = 0; + errpow = 0; + + st = speex_encoder_init(&speex_uwb_mode); + dec = speex_decoder_init(&speex_uwb_mode); + + callback.callback_id = SPEEX_INBAND_CHAR; + callback.func = speex_std_char_handler; + callback.data = stderr; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + callback.callback_id = SPEEX_INBAND_MODE_REQUEST; + callback.func = speex_std_mode_request_handler; + callback.data = st; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + tmp=0; + speex_decoder_ctl(dec, SPEEX_SET_ENH, &tmp); + tmp=0; + speex_encoder_ctl(st, SPEEX_SET_VBR, &tmp); + tmp=7; + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &tmp); + tmp=1; + speex_encoder_ctl(st, SPEEX_SET_COMPLEXITY, &tmp); + + speex_mode_query(&speex_nb_mode, SPEEX_MODE_FRAME_SIZE, &tmp); + fprintf (stderr, "frame size: %d\n", tmp); + skip_group_delay = 509; + + if (argc != 4 && argc != 3) + { + fprintf (stderr, "Usage: encode [in file] [out file] [bits file]\nargc = %d", argc); + exit(1); + } + inFile = argv[1]; + fin = fopen(inFile, "r"); + outFile = argv[2]; + fout = fopen(outFile, "w+"); + if (argc==4) + { + bitsFile = argv[3]; + fbits = fopen(bitsFile, "w"); + } + speex_bits_init(&bits); + while (!feof(fin)) + { + fread(in_short, sizeof(short), FRAME_SIZE, fin); + if (feof(fin)) + break; + for (i=0;i +#include +#include +#include + +#ifdef FIXED_DEBUG +extern long long spx_mips; +#endif + +#define FRAME_SIZE 320 +#include +int main(int argc, char **argv) +{ + char *inFile, *outFile, *bitsFile; + FILE *fin, *fout, *fbits=NULL; + short in_short[FRAME_SIZE]; + short out_short[FRAME_SIZE]; + float in_float[FRAME_SIZE]; + float sigpow,errpow,snr, seg_snr=0; + int snr_frames = 0; + char cbits[200]; + int nbBits; + int i; + void *st; + void *dec; + SpeexBits bits; + int tmp; + int bitCount=0; + int skip_group_delay; + SpeexCallback callback; + + sigpow = 0; + errpow = 0; + + st = speex_encoder_init(&speex_wb_mode); + dec = speex_decoder_init(&speex_wb_mode); + + callback.callback_id = SPEEX_INBAND_CHAR; + callback.func = speex_std_char_handler; + callback.data = stderr; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + callback.callback_id = SPEEX_INBAND_MODE_REQUEST; + callback.func = speex_std_mode_request_handler; + callback.data = st; + speex_decoder_ctl(dec, SPEEX_SET_HANDLER, &callback); + + tmp=0; + speex_decoder_ctl(dec, SPEEX_SET_ENH, &tmp); + tmp=0; + speex_encoder_ctl(st, SPEEX_SET_VBR, &tmp); + tmp=8; + speex_encoder_ctl(st, SPEEX_SET_QUALITY, &tmp); + tmp=2; + speex_encoder_ctl(st, SPEEX_SET_COMPLEXITY, &tmp); + tmp=3; + speex_encoder_ctl(st, SPEEX_SET_HIGH_MODE, &tmp); + tmp=6; + speex_encoder_ctl(st, SPEEX_SET_LOW_MODE, &tmp); + + + speex_mode_query(&speex_wb_mode, SPEEX_MODE_FRAME_SIZE, &tmp); + fprintf (stderr, "frame size: %d\n", tmp); + skip_group_delay = 223; + + if (argc != 4 && argc != 3) + { + fprintf (stderr, "Usage: encode [in file] [out file] [bits file]\nargc = %d", argc); + exit(1); + } + inFile = argv[1]; + fin = fopen(inFile, "r"); + outFile = argv[2]; + fout = fopen(outFile, "w+"); + if (argc==4) + { + bitsFile = argv[3]; + fbits = fopen(bitsFile, "w"); + } + speex_bits_init(&bits); + while (!feof(fin)) + { + fread(in_short, sizeof(short), FRAME_SIZE, fin); + if (feof(fin)) + break; + for (i=0;i + + +#define sqr(x) ((x)*(x)) + +#define MIN_ENERGY 6000 +#define NOISE_POW .3 + + +const float vbr_nb_thresh[9][11]={ + {-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0}, /* CNG */ + { 3.5, 2.5, 2.0, 1.2, 0.5, 0.0, -0.5, -0.7, -0.8, -0.9, -1.0}, /* 2 kbps */ + {10.0, 6.5, 5.2, 4.5, 3.9, 3.5, 3.0, 2.5, 2.3, 1.8, 1.0}, /* 6 kbps */ + {11.0, 8.8, 7.5, 6.5, 5.0, 3.9, 3.9, 3.9, 3.5, 3.0, 1.0}, /* 8 kbps */ + {11.0, 11.0, 9.9, 9.0, 8.0, 7.0, 6.5, 6.0, 5.0, 4.0, 2.0}, /* 11 kbps */ + {11.0, 11.0, 11.0, 11.0, 9.5, 9.0, 8.0, 7.0, 6.5, 5.0, 3.0}, /* 15 kbps */ + {11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 9.5, 8.5, 8.0, 6.5, 4.0}, /* 18 kbps */ + {11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 9.8, 7.5, 5.5}, /* 24 kbps */ + { 8.0, 5.0, 3.7, 3.0, 2.5, 2.0, 1.8, 1.5, 1.0, 0.0, 0.0} /* 4 kbps */ +}; + + +const float vbr_hb_thresh[5][11]={ + {-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0}, /* silence */ + {-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0}, /* 2 kbps */ + {11.0, 11.0, 9.5, 8.5, 7.5, 6.0, 5.0, 3.9, 3.0, 2.0, 1.0}, /* 6 kbps */ + {11.0, 11.0, 11.0, 11.0, 11.0, 9.5, 8.7, 7.8, 7.0, 6.5, 4.0}, /* 10 kbps */ + {11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 11.0, 9.8, 7.5, 5.5} /* 18 kbps */ +}; + +const float vbr_uhb_thresh[2][11]={ + {-1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0}, /* silence */ + { 3.9, 2.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0} /* 2 kbps */ +}; + +void vbr_init(VBRState *vbr) +{ + int i; + + vbr->average_energy=0; + vbr->last_energy=1; + vbr->accum_sum=0; + vbr->energy_alpha=.1; + vbr->soft_pitch=0; + vbr->last_pitch_coef=0; + vbr->last_quality=0; + + vbr->noise_accum = .05*pow(MIN_ENERGY, NOISE_POW); + vbr->noise_accum_count=.05; + vbr->noise_level=vbr->noise_accum/vbr->noise_accum_count; + vbr->consec_noise=0; + + + for (i=0;ilast_log_energy[i] = log(MIN_ENERGY); +} + + +/* + This function should analyse the signal and decide how critical the + coding error will be perceptually. The following factors should be + taken into account: + + -Attacks (positive energy derivative) should be coded with more bits + + -Stationary voiced segments should receive more bits + + -Segments with (very) low absolute energy should receive less bits (maybe + only shaped noise?) + + -DTX for near-zero energy? + + -Stationary fricative segments should have less bits + + -Temporal masking: when energy slope is decreasing, decrease the bit-rate + + -Decrease bit-rate for males (low pitch)? + + -(wideband only) less bits in the high-band when signal is very + non-stationary (harder to notice high-frequency noise)??? + +*/ + +float vbr_analysis(VBRState *vbr, spx_word16_t *sig, int len, int pitch, float pitch_coef) +{ + int i; + float ener=0, ener1=0, ener2=0; + float qual=7; + //int va; + float log_energy; + float non_st=0; + float voicing; + float pow_ener; + + for (i=0;i>1;i++) + ener1 += ((float)sig[i])*sig[i]; + + for (i=len>>1;ilast_log_energy[i]); + non_st = non_st/(30*VBR_MEMORY_SIZE); + if (non_st>1) + non_st=1; + + voicing = 3*(pitch_coef-.4)*fabs(pitch_coef-.4); + vbr->average_energy = (1-vbr->energy_alpha)*vbr->average_energy + vbr->energy_alpha*ener; + vbr->noise_level=vbr->noise_accum/vbr->noise_accum_count; + pow_ener = pow(ener,NOISE_POW); + if (vbr->noise_accum_count<.06 && ener>MIN_ENERGY) + vbr->noise_accum = .05*pow_ener; + + if ((voicing<.3 && non_st < .2 && pow_ener < 1.2*vbr->noise_level) + || (voicing<.3 && non_st < .05 && pow_ener < 1.5*vbr->noise_level) + || (voicing<.4 && non_st < .05 && pow_ener < 1.2*vbr->noise_level) + || (voicing<0 && non_st < .05)) + { + float tmp; + //va = 0; + vbr->consec_noise++; + if (pow_ener > 3*vbr->noise_level) + tmp = 3*vbr->noise_level; + else + tmp = pow_ener; + if (vbr->consec_noise>=4) + { + vbr->noise_accum = .95*vbr->noise_accum + .05*tmp; + vbr->noise_accum_count = .95*vbr->noise_accum_count + .05; + } + } else { + //va = 1; + vbr->consec_noise=0; + } + + if (pow_ener < vbr->noise_level && ener>MIN_ENERGY) + { + vbr->noise_accum = .95*vbr->noise_accum + .05*pow_ener; + vbr->noise_accum_count = .95*vbr->noise_accum_count + .05; + } + + /* Checking for very low absolute energy */ + if (ener < 30000) + { + qual -= .7; + if (ener < 10000) + qual-=.7; + if (ener < 3000) + qual-=.7; + } else { + float short_diff, long_diff; + short_diff = log((ener+1)/(1+vbr->last_energy)); + long_diff = log((ener+1)/(1+vbr->average_energy)); + /*fprintf (stderr, "%f %f\n", short_diff, long_diff);*/ + + if (long_diff<-5) + long_diff=-5; + if (long_diff>2) + long_diff=2; + + if (long_diff>0) + qual += .6*long_diff; + if (long_diff<0) + qual += .5*long_diff; + if (short_diff>0) + { + if (short_diff>5) + short_diff=5; + qual += .5*short_diff; + } + /* Checking for energy increases */ + if (ener2 > 1.6*ener1) + qual += .5; + } + vbr->last_energy = ener; + vbr->soft_pitch = .6*vbr->soft_pitch + .4*pitch_coef; + qual += 2.2*((pitch_coef-.4) + (vbr->soft_pitch-.4)); + + if (qual < vbr->last_quality) + qual = .5*qual + .5*vbr->last_quality; + if (qual<4) + qual=4; + if (qual>10) + qual=10; + + /* + if (vbr->consec_noise>=2) + qual-=1.3; + if (vbr->consec_noise>=5) + qual-=1.3; + if (vbr->consec_noise>=12) + qual-=1.3; + */ + if (vbr->consec_noise>=3) + qual=4; + + if (vbr->consec_noise) + qual -= 1.0 * (log(3.0 + vbr->consec_noise)-log(3)); + if (qual<0) + qual=0; + + if (ener<60000) + { + if (vbr->consec_noise>2) + qual-=0.5*(log(3.0 + vbr->consec_noise)-log(3)); + if (ener<10000&&vbr->consec_noise>2) + qual-=0.5*(log(3.0 + vbr->consec_noise)-log(3)); + if (qual<0) + qual=0; + qual += .3*log(ener/60000.0); + } + if (qual<-1) + qual=-1; + + /*printf ("%f %f %f %f %d\n", qual, voicing, non_st, pow_ener/(.01+vbr->noise_level), va);*/ + + vbr->last_pitch_coef = pitch_coef; + vbr->last_quality = qual; + + for (i=VBR_MEMORY_SIZE-1;i>0;i--) + vbr->last_log_energy[i] = vbr->last_log_energy[i-1]; + vbr->last_log_energy[0] = log_energy; + + /*printf ("VBR: %f %f %f %d %f\n", (float)(log_energy-log(vbr->average_energy+MIN_ENERGY)), non_st, voicing, va, vbr->noise_level);*/ + + return qual; +} + +void vbr_destroy(VBRState *vbr) +{ +} diff --git a/3rdparty/iaxclient-2/lib/libspeex/vbr.h b/3rdparty/iaxclient-2/lib/libspeex/vbr.h new file mode 100644 index 0000000..7a6abef --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/vbr.h @@ -0,0 +1,68 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: vbr.h + + VBR-related routines + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. + +*/ + + +#ifndef VBR_H +#define VBR_H + +#include "misc.h" + +#define VBR_MEMORY_SIZE 5 + +extern const float vbr_nb_thresh[9][11]; +extern const float vbr_hb_thresh[5][11]; +extern const float vbr_uhb_thresh[2][11]; + +typedef struct VBRState { + float energy_alpha; + float average_energy; + float last_energy; + float last_log_energy[VBR_MEMORY_SIZE]; + float accum_sum; + float last_pitch_coef; + float soft_pitch; + float last_quality; + float noise_level; + float noise_accum; + float noise_accum_count; + int consec_noise; +} VBRState; + +void vbr_init(VBRState *vbr); + +float vbr_analysis(VBRState *vbr, spx_word16_t *sig, int len, int pitch, float pitch_coef); + +void vbr_destroy(VBRState *vbr); + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/vq.c b/3rdparty/iaxclient-2/lib/libspeex/vq.c new file mode 100644 index 0000000..c89c741 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/vq.c @@ -0,0 +1,253 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: vq.c + Vector quantization + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "vq.h" +#include "stack_alloc.h" + +int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries) +{ + int i=0; + while (iboundary[0]) + { + boundary++; + i++; + } + return i; +} + +int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries) +{ + int i=0; + while (iboundary[0]) + { + boundary++; + i++; + } + return i; +} + +/*Finds the index of the entry in a codebook that best matches the input*/ +int vq_index(float *in, const float *codebook, int len, int entries) +{ + int i,j; + float min_dist=0; + int best_index=0; + for (i=0;i +#include "misc.h" +void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) +{ + int i,j,k,used; + VARDECL(float *dist); + VARDECL(__m128 *in); + __m128 half; + used = 0; + ALLOC(dist, entries, float); + half = _mm_set_ps1(.5f); + ALLOC(in, len, __m128); + for (i=0;i>2;i++) + { + __m128 d = _mm_mul_ps(E[i], half); + for (j=0;j= 1) && (k > used || dist[i] < best_dist[k-1]); k--) + { + best_dist[k]=best_dist[k-1]; + nbest[k] = nbest[k-1]; + } + best_dist[k]=dist[i]; + nbest[k]=i; + used++; + } + } +} + + +#else + +#if defined(SHORTCUTS) && (defined(ARM4_ASM) || defined(ARM5E_ASM)) +#include "vq_arm4.h" +#else + +/*Finds the indices of the n-best entries in a codebook*/ +void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) +{ + int i,j,k,used; + used = 0; + for (i=0;i= 1) && (k > used || dist < best_dist[k-1]); k--) + { + best_dist[k]=best_dist[k-1]; + nbest[k] = nbest[k-1]; + } + best_dist[k]=dist; + nbest[k]=i; + used++; + } + } +} +#endif + +#endif + + + +#ifdef _USE_SSE + +void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) +{ + int i,j,k,used; + VARDECL(float *dist); + VARDECL(__m128 *in); + __m128 half; + used = 0; + ALLOC(dist, entries, float); + half = _mm_set_ps1(.5f); + ALLOC(in, len, __m128); + for (i=0;i>2;i++) + { + __m128 d = _mm_setzero_ps(); + for (j=0;j0) + { + sign=0; + dist[i]=-dist[i]; + } else + { + sign=1; + } + dist[i] += .5f*((float*)E)[i]; + if (i= 1) && (k > used || dist[i] < best_dist[k-1]); k--) + { + best_dist[k]=best_dist[k-1]; + nbest[k] = nbest[k-1]; + } + best_dist[k]=dist[i]; + nbest[k]=i; + used++; + if (sign) + nbest[k]+=entries; + } + } +} + +#else + +/*Finds the indices of the n-best entries in a codebook with sign*/ +void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) +{ + int i,j,k, sign, used; + used=0; + for (i=0;i0) + { + sign=0; + dist=-dist; + } else + { + sign=1; + } +#ifdef FIXED_POINT + dist = ADD32(dist,SHR32(E[i],1)); +#else + dist = ADD32(dist,.5f*E[i]); +#endif + if (i= 1) && (k > used || dist < best_dist[k-1]); k--) + { + best_dist[k]=best_dist[k-1]; + nbest[k] = nbest[k-1]; + } + best_dist[k]=dist; + nbest[k]=i; + used++; + if (sign) + nbest[k]+=entries; + } + } +} +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/vq.h b/3rdparty/iaxclient-2/lib/libspeex/vq.h new file mode 100644 index 0000000..79bd9e9 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/vq.h @@ -0,0 +1,53 @@ +/* Copyright (C) 2002 Jean-Marc Valin + File: vq.h + Vector quantization + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +#ifndef VQ_H +#define VQ_H + +#include "misc.h" + +int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries); +int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries); + +int vq_index(float *in, const float *codebook, int len, int entries); +#ifdef _USE_SSE +#include +void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); + +void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); +#else +void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); + +void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/libspeex/vq_arm4.h b/3rdparty/iaxclient-2/lib/libspeex/vq_arm4.h new file mode 100644 index 0000000..cae3d06 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/libspeex/vq_arm4.h @@ -0,0 +1,112 @@ +/* Copyright (C) 2004 Jean-Marc Valin + File: vq_arm4.h + ARM4-optimized vq routine + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + - Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + - 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. + + - Neither the name of the Xiph.org Foundation nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION 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. +*/ + +void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) +{ + int i,j; + for (i=0;i Implementation + * + * + * + * + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ diff --git a/3rdparty/iaxclient-2/lib/portmixer/macproj/portmixer.mcp b/3rdparty/iaxclient-2/lib/portmixer/macproj/portmixer.mcp new file mode 100644 index 0000000..7775d72 Binary files /dev/null and b/3rdparty/iaxclient-2/lib/portmixer/macproj/portmixer.mcp differ diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_common/portmixer.h b/3rdparty/iaxclient-2/lib/portmixer/px_common/portmixer.h new file mode 100644 index 0000000..f85d29e --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_common/portmixer.h @@ -0,0 +1,154 @@ +#ifndef PORT_MIXER_H +#define PORT_MIXER_H + +#ifdef __cplusplus +extern "C" +{ +#endif /* __cplusplus */ + + +/* + * PortMixer + * PortMixer API Header File + * + * Copyright (c) 2002 + * + * Written by Dominic Mazzoni + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ + +#include "portaudio.h" + +typedef void PxMixer; + +typedef float PxVolume; /* 0.0 (min) --> 1.0 (max) */ +typedef float PxBalance; /* -1.0 (left) --> 1.0 (right) */ + +/* + Px_GetNumMixers returns the number of mixers which could be + used with the given PortAudio device. On most systems, there + will be only one mixer for each device; however there may be + multiple mixers for each device, or possibly multiple mixers + which are independent of any particular PortAudio device. +*/ + +int Px_GetNumMixers( void *pa_stream ); +const char *Px_GetMixerName( void *pa_stream, int i ); + +/* + Px_OpenMixer() returns a mixer which will work with the given PortAudio + audio device. Pass 0 as the index for the first (default) mixer. +*/ + +PxMixer *Px_OpenMixer( void *pa_stream, int i ); + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer); + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ); +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ); + +/* + Main output volume +*/ + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ); +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ); +int Px_SupportsPCMOutputVolume( PxMixer* mixer ) ; + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ); +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ); +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ); +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ); + +/* + Input source +*/ + +int Px_GetNumInputSources( PxMixer *mixer ); +const char *Px_GetInputSourceName( PxMixer *mixer, int i); +int Px_GetCurrentInputSource( PxMixer *mixer ); /* may return -1 == none */ +void Px_SetCurrentInputSource( PxMixer *mixer, int i ); + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ); +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ); + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ); +PxBalance Px_GetOutputBalance( PxMixer *mixer ); +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ); + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ); +PxVolume Px_GetPlaythrough( PxMixer *mixer ); +void Px_SetPlaythrough( PxMixer *mixer, PxVolume volume ); + +/* + toggle microphone boost function +*/ + +/* returns 0 on success, 1 on failure, -1 if not available */ +int Px_SetMicrophoneBoost( PxMixer* mixer, int enable ) ; +int Px_GetMicrophoneBoost( PxMixer* mixer ) ; + +/* + set input source by name +*/ + +/* returns 0 on sucess, 1 on failure */ +int Px_SetCurrentInputSourceByName( PxMixer* mixer, const char* line_name ) ; + + +#ifdef __cplusplus +} +#endif /* __cplusplus */ +#endif /* PORT_AUDIO_H */ diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_mac/px_mac.c b/3rdparty/iaxclient-2/lib/portmixer/px_mac/px_mac.c new file mode 100644 index 0000000..8d1f474 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_mac/px_mac.c @@ -0,0 +1,406 @@ +/* + * PortMixer + * Mac OS 9 implementation + * + * Copyright (c) 2002 + * + * Written by Dominic Mazzoni + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ + +#include +#include + +#include "portaudio.h" +#include "pa_host.h" +#include "portmixer.h" + +#define PA_MAX_NUM_HOST_BUFFERS (16) /* Do not exceed!! */ + +typedef struct MultiBuffer +{ + char *buffers[PA_MAX_NUM_HOST_BUFFERS]; + int numBuffers; + int nextWrite; + int nextRead; +} +MultiBuffer; + +/* Define structure to contain all Macintosh specific data. */ +typedef struct PaHostSoundControl +{ + UInt64 pahsc_EntryCount; + double pahsc_InverseMicrosPerHostBuffer; /* 1/Microseconds of real-time audio per user buffer. */ + + /* Use char instead of Boolean for atomic operation. */ + volatile char pahsc_IsRecording; /* Recording in progress. Set by foreground. Cleared by background. */ + volatile char pahsc_StopRecording; /* Signal sent to background. */ + volatile char pahsc_IfInsideCallback; + /* Input */ + SPB pahsc_InputParams; + SICompletionUPP pahsc_InputCompletionProc; + MultiBuffer pahsc_InputMultiBuffer; + int32 pahsc_BytesPerInputHostBuffer; + int32 pahsc_InputRefNum; + /* Output */ + CmpSoundHeader pahsc_SoundHeaders[PA_MAX_NUM_HOST_BUFFERS]; + int32 pahsc_BytesPerOutputHostBuffer; + SndChannelPtr pahsc_Channel; + SndCallBackUPP pahsc_OutputCompletionProc; + int32 pahsc_NumOutsQueued; + int32 pahsc_NumOutsPlayed; + PaTimestamp pahsc_NumFramesDone; + UInt64 pahsc_WhenFramesDoneIncremented; + /* Init Time -------------- */ + int32 pahsc_NumHostBuffers; + int32 pahsc_FramesPerHostBuffer; + int32 pahsc_UserBuffersPerHostBuffer; + int32 pahsc_MinFramesPerHostBuffer; /* Can vary depending on virtual memory usage. */ +} +PaHostSoundControl; + +typedef struct PxSource +{ + char name[256]; +} PxSource; + +typedef struct PxInfo +{ + SPB *input; + int32 inputRefNum; + SndChannelPtr output; + int32 numSources; + PxSource *sources; +} PxInfo; + +int Px_GetNumMixers( void *pa_stream ) +{ + return 0; +} + +const char *Px_GetMixerName( void *pa_stream, int index ) +{ + return "Mac Sound Manager"; +} + +PxMixer *Px_OpenMixer( void *pa_stream, int index ) +{ + PxInfo *info; + internalPortAudioStream *past; + PaHostSoundControl *macInfo; + OSErr err; + int i, j; + Handle h; + unsigned char *data; + + info = (PxInfo *)malloc(sizeof(PxInfo)); + past = (internalPortAudioStream *) pa_stream; + macInfo = (PaHostSoundControl *) past->past_DeviceData; + + info->input = &macInfo->pahsc_InputParams; + info->inputRefNum = macInfo->pahsc_InputRefNum; + info->output = macInfo->pahsc_Channel; + + info->numSources = 0; + info->sources = NULL; + + err = SPBGetDeviceInfo (info->inputRefNum, siInputSourceNames, &h); + if (err) + return (PxMixer *)info; + + HLock(h); + HNoPurge(h); + + data = (unsigned char *)*h; + info->numSources = ((short *)data)[0]; + if (info->numSources <= 0 || info->numSources > 50) { + HUnlock(h); + return (PxMixer *)info; + } + + info->sources = (PxSource *)malloc(info->numSources * sizeof(PxSource)); + data += 2; + for(i=0; inumSources; i++) { + int len = *data++; + + if (len > 63) { + info->numSources = 0; + free(info->sources); + info->sources = NULL; + HUnlock(h); + return (PxMixer *)info; + } + + for(j=0; jsources[i].name[j] = *data++; + + info->sources[i].name[len] = 0; + } + HUnlock(h); + + return (PxMixer *)info; +} + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer) +{ + PxInfo *info = (PxInfo *)mixer; + + if (info->sources) + free(info->sources); + free(info); +} + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0.0; +} + +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + PCM output volume +*/ + +int Px_SupportsPCMOutputVolume( PxMixer* mixer ) +{ + return 1 ; +} + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + OSErr err; + long packedVol; + SndCommand cmd; + + cmd.cmd = getVolumeCmd; + cmd.param1 = 0; + cmd.param2 = (long)&packedVol; + + err = SndDoImmediate(info->output, &cmd); + if (err) + return 0.0; + + return ((packedVol & 0xFFFF) + ((packedVol & 0xFFFF0000) >> 16) / 2.0) / 256.0; +} + +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + OSErr err; + long packedVol; + SndCommand cmd; + + packedVol = (unsigned long)volume * 256.0; + packedVol += (packedVol << 16); + + cmd.cmd = volumeCmd; + cmd.param1 = 0; + cmd.param2 = packedVol; + err = SndDoImmediate(info->output, &cmd); +} + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0; +} + +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + return NULL; +} + +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + return NULL; +} + +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + Input sources +*/ + +int Px_GetNumInputSources( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return info->numSources; +} + +const char *Px_GetInputSourceName( PxMixer *mixer, int i) +{ + PxInfo *info = (PxInfo *)mixer; + + if (i >= 0 && i < info->numSources) + return info->sources[i].name; + else + return ""; +} + +int Px_GetCurrentInputSource( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + short selected; + OSErr err; + + err = SPBGetDeviceInfo (info->inputRefNum, siInputSource, &selected); + if (err) + return 0; + + return selected - 1; +} + +void Px_SetCurrentInputSource( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + short selected = i+1; + OSErr err; + + err = SPBSetDeviceInfo (info->inputRefNum, siInputSource, &selected); +} + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + Fixed fixedGain; + PxVolume vol; + OSErr err; + + if (info->input) { + err = SPBGetDeviceInfo(info->inputRefNum, siInputGain, (Ptr)&fixedGain); + if (err) + return 0.0; + + vol = (fixedGain / 65536.0) - 0.5; + return vol; + } + + return 0.0; +} + +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + Fixed fixedGain; + OSErr err; + + if (info->input) { + fixedGain = (Fixed)((volume + 0.5) * 65536.0); + err = SPBSetDeviceInfo(info->inputRefNum, siInputGain, (Ptr)&fixedGain); + } +} + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetOutputBalance( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ) +{ +} + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return (info->input != NULL); +} + +PxVolume Px_GetPlaythrough( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + OSErr err; + short level; + + err = SPBGetDeviceInfo(info->inputRefNum, siPlayThruOnOff, (Ptr)&level); + if (err) + return 0.0; + + if (level < 0) + level = 0; + if (level > 7) + level = 7; + + return (PxVolume)(level / 7.0); +} + +void Px_SetPlaythrough( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + OSErr err; + short level = (int)(volume * 7.0 + 0.5); + + err = SPBSetDeviceInfo(info->inputRefNum, siPlayThruOnOff, (Ptr)&level); +} diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_mac_core/px_mac_core.c b/3rdparty/iaxclient-2/lib/portmixer/px_mac_core/px_mac_core.c new file mode 100644 index 0000000..402f670 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_mac_core/px_mac_core.c @@ -0,0 +1,349 @@ +/* + * PortMixer + * Mac OS X / CoreAudio implementation + * + * Copyright (c) 2002 + * + * Written by Dominic Mazzoni + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ + +#include +#include +#include +#include +#include +#include +#include + +#include +#if 0 +#include +#else +/* TODO: Fix this when portaudio gets their hostapi-specific stuff + * straightened up. + */ +#include +AudioDeviceID PaMacCore_GetStreamInputDevice( PaStream* s ); +AudioDeviceID PaMacCore_GetStreamOutputDevice( PaStream* s ); +#endif + +#include "portmixer.h" + +// define value of isInput passed to CoreAudio routines +#define IS_INPUT (true) +#define IS_OUTPUT (false) + +typedef struct PxInfo +{ + AudioDeviceID input; + AudioDeviceID output; +} PxInfo; + +int Px_GetNumMixers( void *pa_stream ) +{ + return 1; +} + +const char *Px_GetMixerName( void *pa_stream, int index ) +{ + return "CoreAudio"; +} + +PxMixer *Px_OpenMixer( void *pa_stream, int index ) +{ + PxInfo *info; + + info = (PxInfo *)malloc(sizeof(PxInfo)); + if (!info) { + return (PxMixer *)info; + } + + info->input = PaMacCore_GetStreamInputDevice(pa_stream); + info->output = PaMacCore_GetStreamOutputDevice(pa_stream); + + return (PxMixer *)info; +} + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer) +{ + PxInfo *info = (PxInfo *)mixer; + + free(info); +} + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ) +{ +} + +/* + PCM output volume +*/ + +static PxVolume Px_GetVolume(AudioDeviceID device, Boolean isInput) +{ + OSStatus err; + UInt32 outSize; + Float32 vol, maxvol=0.0; + UInt32 mute, anymuted=0; + int ch; + + for(ch=0; ch<=2; ch++) { + outSize = sizeof(Float32); + err = AudioDeviceGetProperty(device, ch, isInput, + kAudioDevicePropertyVolumeScalar, + &outSize, &vol); + if (!err) { + if (vol > maxvol) + maxvol = vol; + } + + outSize = sizeof(UInt32); + err = AudioDeviceGetProperty(device, ch, isInput, + kAudioDevicePropertyMute, + &outSize, &mute); + + if (!err) { + if (mute) + anymuted = 1; + } + } + + if (anymuted) + maxvol = 0.0; + + return maxvol; +} + +static void Px_SetVolume(AudioDeviceID device, Boolean isInput, + PxVolume volume) +{ + Float32 vol = volume; + UInt32 mute = 0; + int ch; + OSStatus err; + + /* Implement a passive attitude towards muting. If they + drag the volume above 0.05, unmute it. But if they + drag the volume down below that, just set the volume, + don't actually mute. + */ + + for(ch=0; ch<=2; ch++) { + err = AudioDeviceSetProperty(device, 0, ch, isInput, + kAudioDevicePropertyVolumeScalar, + sizeof(Float32), &vol); + if (vol > 0.05) { + err = AudioDeviceSetProperty(device, 0, ch, isInput, + kAudioDevicePropertyMute, + sizeof(UInt32), &mute); + } + } +} + +int Px_SupportsPCMOutputVolume( PxMixer* mixer ) +{ + return 1 ; +} + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return Px_GetVolume(info->output, IS_OUTPUT); +} + +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + Px_SetVolume(info->output, IS_OUTPUT, volume); +} + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ) +{ + return 1; +} + +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ) +{ + if (i == 0) + return "PCM"; + else + return ""; +} + +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ) +{ + return Px_GetPCMOutputVolume(mixer); +} + +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ) +{ + Px_SetPCMOutputVolume(mixer, volume); +} + +/* + Input sources +*/ + +int Px_GetNumInputSources( PxMixer *mixer ) +{ + return 1 ; +} + +const char *Px_GetInputSourceName( PxMixer *mixer, int i) +{ + return "Default Input Source" ; +} + +int Px_GetCurrentInputSource( PxMixer *mixer ) +{ + return -1; /* none */ +} + +void Px_SetCurrentInputSource( PxMixer *mixer, int i ) +{ +} + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return Px_GetVolume(info->input, IS_INPUT); +} + +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + Px_SetVolume(info->input, IS_INPUT, volume); +} + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetOutputBalance( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ) +{ +} + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ) +{ + return 1; +} + +PxVolume Px_GetPlaythrough( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + OSStatus err; + UInt32 outSize; + UInt32 flag; + + outSize = sizeof(UInt32); + err = AudioDeviceGetProperty(info->output, 0, IS_OUTPUT, + kAudioDevicePropertyPlayThru, + &outSize, &flag); + if (err) + return 0.0; + + if (flag) + return 1.0; + else + return 0.0; +} + +void Px_SetPlaythrough( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + UInt32 flag = (volume > 0.01); + OSStatus err; + + err = AudioDeviceSetProperty(info->output, 0, 0, IS_OUTPUT, + kAudioDevicePropertyPlayThru, + sizeof(UInt32), &flag); +} + +/* + unimplemented stubs +*/ + +int Px_SetMicrophoneBoost( PxMixer* mixer, int enable ) +{ + return 1 ; +} + +int Px_GetMicrophoneBoost( PxMixer* mixer ) +{ + return -1 ; +} + +int Px_SetCurrentInputSourceByName( PxMixer* mixer, const char* line_name ) +{ + return 1 ; +} + + diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_none/px_none.c b/3rdparty/iaxclient-2/lib/portmixer/px_none/px_none.c new file mode 100644 index 0000000..f2a48b0 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_none/px_none.c @@ -0,0 +1,216 @@ +/* + * PortMixer + * Empty implementation (as a placeholder on platforms where + * it hasn't been implemented yet) + * + * Copyright (c) 2002 + * + * Written by Dominic Mazzoni + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ + +#include + +#include "portaudio.h" +#include "portmixer.h" + +typedef struct PxInfo +{ + int dummy; +} PxInfo; + +int Px_GetNumMixers( void *pa_stream ) +{ + return 0; +} + +const char *Px_GetMixerName( void *pa_stream, int index ) +{ + return NULL; +} + +PxMixer *Px_OpenMixer( void *pa_stream, int index ) +{ + return NULL; +} + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer) +{ +} + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0.0; +} + +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + PCM output volume +*/ + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0.0; +} + +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0; +} + +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + return NULL; +} + +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + return NULL; +} + +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + Input sources +*/ + +int Px_GetNumInputSources( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0; +} + +const char *Px_GetInputSourceName( PxMixer *mixer, int i) +{ + PxInfo *info = (PxInfo *)mixer; + + return NULL; +} + +int Px_GetCurrentInputSource( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return -1; /* none */ +} + +void Px_SetCurrentInputSource( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 0.0; +} + +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; +} + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetOutputBalance( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ) +{ +} + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetPlaythrough( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetPlaythrough( PxMixer *mixer, PxBalance balance ) +{ +} + diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_tests/px_test.c b/3rdparty/iaxclient-2/lib/portmixer/px_tests/px_test.c new file mode 100644 index 0000000..ec391e9 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_tests/px_test.c @@ -0,0 +1,103 @@ +#include + +#include "portmixer.h" +#include "portaudio.h" + +static int DummyCallbackFunc(const void *inputBuffer, + void *outputBuffer, + unsigned long framesPerBuffer, + const PaStreamCallbackTimeInfo* timeInfo, + PaStreamCallbackFlags statusFlags, + void *userData ) +{ + return 0; +} +#define NUM_CHANNELS (2) +#define PA_SAMPLE_TYPE paFloat32 +#define SAMPLE_RATE (44100) +#define FRAMES_PER_BUFFER (1024) + +int main(int argc, char **argv) +{ + int num_mixers; + int i; + PaError error; + PaStream* stream; + PaStreamParameters inputParameters; + PaStreamParameters outputParameters; + + error = Pa_Initialize(); + if ( error != paNoError ) { + printf("PortAudio error %d: %s\n", error, Pa_GetErrorText(error)); + return -1; + } + inputParameters.device = Pa_GetDefaultInputDevice(); + inputParameters.channelCount = NUM_CHANNELS; + inputParameters.sampleFormat = PA_SAMPLE_TYPE; + inputParameters.suggestedLatency = + Pa_GetDeviceInfo(inputParameters.device )->defaultLowInputLatency; + inputParameters.hostApiSpecificStreamInfo = NULL; + + outputParameters.device = Pa_GetDefaultOutputDevice(); /* default output device */ + outputParameters.channelCount = 2; /* stereo output */ + outputParameters.sampleFormat = paFloat32; /* 32 bit floating point output */ + outputParameters.suggestedLatency = + Pa_GetDeviceInfo( outputParameters.device )->defaultLowOutputLatency; + outputParameters.hostApiSpecificStreamInfo = NULL; + + + + error = Pa_OpenStream(&stream, &inputParameters, &outputParameters, + SAMPLE_RATE,FRAMES_PER_BUFFER, + paClipOff | paDitherOff, + DummyCallbackFunc, NULL); + + if (error) { + printf("PortAudio error %d: %s\n", error, Pa_GetErrorText(error)); + return -1; + } + + num_mixers = Px_GetNumMixers(stream); + printf("Number of mixers: %d\n", num_mixers); + for(i=0; i +#elif defined(__FreeBSD__) +#include +#else +#include /* JH20010905 */ +#endif + +#include +#include +#include +#include +#include +#include +#include + +#include "portaudio.h" +#include "portmixer.h" + +typedef struct PxInfo +{ + int index; + int fd; + + int num_out; + int outs[SOUND_MIXER_NRDEVICES]; + int num_rec; + int recs[SOUND_MIXER_NRDEVICES]; +} PxInfo; + +char PxDevice[20] = "/dev/mixerX"; + +int PxNumDevices = 0; +int PxDevices[10]; + +int Px_GetNumMixers( void *pa_stream ) +{ + int i; + int fd; + + PxNumDevices = 0; + + for(i=0; i<11; i++) { + if (i==0) + PxDevice[10] = 0; + else + PxDevice[10] = '0'+(i-1); + fd = open(PxDevice, O_RDWR); + if (fd >= 0) { + PxDevices[PxNumDevices] = i; + PxNumDevices++; + close(fd); + } + } + + return PxNumDevices; +} + +const char *Px_GetMixerName( void *pa_stream, int index ) +{ + if (PxNumDevices <= 0) + Px_GetNumMixers(pa_stream); + + if (index < 0 || index >= PxNumDevices) + return NULL; + + if (PxDevices[index]==0) + PxDevice[10] = 0; + else + PxDevice[10] = '0'+(PxDevices[index]-1); + return PxDevice; +} + +PxMixer *Px_OpenMixer( void *pa_stream, int index ) +{ + PxInfo *info; + int devmask, recmask, outmask; + int i; + + if (PxNumDevices <= 0) + Px_GetNumMixers(pa_stream); + + if (index < 0 || index >= PxNumDevices) + return NULL; + + info = (PxInfo *)malloc(sizeof(PxInfo)); + info->index = PxDevice[index]; + + if (PxDevices[index]==0) + PxDevice[10] = 0; + else + PxDevice[10] = '0'+(PxDevices[index]-1); + info->fd = open(PxDevice, O_RDWR); + if (info->fd < 0) + goto bad; + + if (ioctl(info->fd, MIXER_READ(SOUND_MIXER_READ_DEVMASK), + &devmask) == -1) + goto bad; + if (ioctl(info->fd, MIXER_READ(SOUND_MIXER_READ_RECMASK), + &recmask) == -1) + goto bad; + outmask = devmask ^ recmask; + + info->num_out = 0; + info->num_rec = 0; + + for(i=0; irecs[info->num_rec++] = i; + else if (devmask & (1<outs[info->num_out++] = i; + + return (PxMixer *)info; + + bad: + free(info); + return NULL; +} + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer) +{ + PxInfo *info = (PxInfo *)mixer; + + close(info->fd); + + free(info); +} + +PxVolume GetVolume(int fd, int channel) +{ + int vol; + int stereo; + + if (ioctl(fd, SOUND_MIXER_READ_STEREODEVS, &stereo) == 0) + stereo = ((stereo & (1 << channel)) != 0); + else + stereo = 0; + + if (ioctl(fd, MIXER_READ(channel), &vol) == -1) + return 0.0; + + if (stereo) + return ((vol & 0xFF)/200.0) + (((vol>>8) & 0xFF)/200.0); + else + return (vol & 0xFF)/100.0; +} + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return GetVolume(info->fd, SOUND_MIXER_VOLUME); +} + +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + int vol = (int)((volume * 100.0) + 0.5); + vol = (vol | (vol<<8)); + ioctl(info->fd, MIXER_WRITE(SOUND_MIXER_VOLUME), &vol); +} + +/* + PCM output volume +*/ + +int Px_SupportsPCMOutputVolume( PxMixer* mixer ) +{ + return 1 ; +} + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return GetVolume(info->fd, SOUND_MIXER_PCM); +} + +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + int vol = (int)((volume * 100.0) + 0.5); + vol = (vol | (vol<<8)); + ioctl(info->fd, MIXER_WRITE(SOUND_MIXER_PCM), &vol); +} + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return info->num_out; +} + +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + const char *labels[] = SOUND_DEVICE_LABELS; + + return labels[info->outs[i]]; +} + +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + return GetVolume(info->fd, info->outs[i]); +} + +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + int vol = (int)((volume * 100.0) + 0.5); + vol = (vol | (vol<<8)); + ioctl(info->fd, MIXER_WRITE(info->outs[i]), &vol); +} + +/* + Input sources +*/ + +int Px_GetNumInputSources( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return info->num_rec; +} + +const char *Px_GetInputSourceName( PxMixer *mixer, int i) +{ + PxInfo *info = (PxInfo *)mixer; + + const char *labels[] = SOUND_DEVICE_LABELS; + return labels[info->recs[i]]; +} + +int Px_GetCurrentInputSource( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + int recmask; + int i; + + /* Note that there may be more than one in OSS; we pick + the first one */ + + if (ioctl(info->fd, MIXER_READ(SOUND_MIXER_READ_RECSRC), + &recmask) == -1) + return -1; /* none / error */ + + for(i=0; inum_rec; i++) + if (recmask & (1 << (info->recs[i]))) + return i; + + return -1; /* none */ +} + +void Px_SetCurrentInputSource( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + int newrecsrcmask = (1 << (info->recs[i])); + + ioctl(info->fd, MIXER_WRITE(SOUND_MIXER_READ_RECSRC), + &newrecsrcmask); +} + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + int i; + + i = Px_GetCurrentInputSource(mixer); + if (i < 0) + return 0.0; + + return GetVolume(info->fd, info->recs[i]); +} + +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + int vol; + int i; + + i = Px_GetCurrentInputSource(mixer); + if (i < 0) + return; + + vol = (int)((volume * 100.0) + 0.5); + vol = (vol | (vol<<8)); + ioctl(info->fd, MIXER_WRITE(info->recs[i]), &vol); +} + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetOutputBalance( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ) +{ +} + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ) +{ + return 0; +} + +PxVolume Px_GetPlaythrough( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetPlaythrough( PxMixer *mixer, PxVolume volume ) +{ +} + + +/* + unimplemented stubs +*/ + +int Px_SetMicrophoneBoost( PxMixer* mixer, int enable ) +{ + return 1 ; +} + +int Px_GetMicrophoneBoost( PxMixer* mixer ) +{ + return -1 ; +} + +int Px_SetCurrentInputSourceByName( PxMixer* mixer, const char* line_name ) +{ + return 1 ; +} diff --git a/3rdparty/iaxclient-2/lib/portmixer/px_win_wmme/px_win_wmme.c b/3rdparty/iaxclient-2/lib/portmixer/px_win_wmme/px_win_wmme.c new file mode 100644 index 0000000..4705476 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/px_win_wmme/px_win_wmme.c @@ -0,0 +1,983 @@ +/* + * PortMixer + * Windows WMME Implementation + * + * Copyright (c) 2002 + * + * Written by Dominic Mazzoni and Augustus Saunders + * + * PortMixer is intended to work side-by-side with PortAudio, + * the Portable Real-Time Audio Library by Ross Bencina and + * Phil Burk. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR + * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF + * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION + * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + * + */ + +#if defined(WIN32) || defined(_WIN32_WCE) +#include +#define strcasecmp _stricmp +#define strncasecmp _strnicmp +#else +#include +#endif + +#include + +#include "portaudio.h" +#include "portmixer.h" + +#include "pa_cpuload.h" +#include "pa_process.h" +#include "pa_stream.h" + +typedef struct +{ + HANDLE bufferEvent; + void *waveHandles; + unsigned int deviceCount; + /* unsigned int channelCount; */ + WAVEHDR **waveHeaders; /* waveHeaders[device][buffer] */ + unsigned int bufferCount; + unsigned int currentBufferIndex; + unsigned int framesPerBuffer; + unsigned int framesUsedInCurrentBuffer; +}PaWinMmeSingleDirectionHandlesAndBuffers; + +/* PaWinMmeStream - a stream data structure specifically for this implementation */ +/* note that struct PaWinMmeStream is typedeffed to PaWinMmeStream above. */ +struct PaWinMmeStream +{ + PaUtilStreamRepresentation streamRepresentation; + PaUtilCpuLoadMeasurer cpuLoadMeasurer; + PaUtilBufferProcessor bufferProcessor; + + int primeStreamUsingCallback; + + PaWinMmeSingleDirectionHandlesAndBuffers input; + PaWinMmeSingleDirectionHandlesAndBuffers output; + + /* Processing thread management -------------- */ + HANDLE abortEvent; + HANDLE processingThread; + DWORD processingThreadId; + + char throttleProcessingThreadOnOverload; /* 0 -> don't throtte, non-0 -> throttle */ + int processingThreadPriority; + int highThreadPriority; + int throttledThreadPriority; + unsigned long throttledSleepMsecs; + + int isStopped; + volatile int isActive; + volatile int stopProcessing; /* stop thread once existing buffers have been returned */ + volatile int abortProcessing; /* stop thread immediately */ + + DWORD allBuffersDurationMs; /* used to calculate timeouts */ +}; + +typedef struct PxSrcInfo +{ + char name[256]; + DWORD lineID; + DWORD controlID; +} PxSrcInfo; + +typedef struct PxInfo +{ + HMIXEROBJ hInputMixer; + HMIXEROBJ hOutputMixer; + int numInputs; + PxSrcInfo src[32]; + DWORD muxID; + DWORD speakerID; + DWORD waveID; +} PxInfo; + +int Px_GetNumMixers( void *pa_stream ) +{ + return 1; +} + +const char *Px_GetMixerName( void *pa_stream, int index ) +{ + return "Mixer"; +} + +PxMixer *Px_OpenMixer( void *pa_stream, int index ) +{ + struct PaWinMmeStream *past; + HWAVEIN hWaveIn; + HWAVEOUT hWaveOut; + PxInfo *mixer; + MMRESULT result; + + if (!pa_stream) + return NULL; + + mixer = (PxInfo *)malloc(sizeof(PxInfo)); + mixer->hInputMixer = NULL; + mixer->hOutputMixer = NULL; + + past = (struct PaWinMmeStream *) pa_stream; + + hWaveIn = 0; + if (past->input.waveHandles) { + hWaveIn = ((HWAVEIN *)past->input.waveHandles)[0]; + } + + hWaveOut = 0; + if (past->output.waveHandles) { + hWaveOut = ((HWAVEOUT *)past->output.waveHandles)[0]; + } + + if (hWaveIn) { + result = mixerOpen((HMIXER *)&mixer->hInputMixer, (UINT)hWaveIn, 0, 0, MIXER_OBJECTF_HWAVEIN); + if (result != MMSYSERR_NOERROR) { + free(mixer); + return NULL; + } + } + + if (hWaveOut) { + result = mixerOpen((HMIXER *)&mixer->hOutputMixer, (UINT)hWaveOut, 0, 0, MIXER_OBJECTF_HWAVEOUT); + if (result != MMSYSERR_NOERROR) { + free(mixer); + return NULL; + } + } + + mixer->numInputs = 0; + mixer->muxID = -1; + + if (mixer->hInputMixer) + { + MIXERLINE line; + line.cbStruct = sizeof(MIXERLINE); + line.dwComponentType = MIXERLINE_COMPONENTTYPE_DST_WAVEIN; + + result = mixerGetLineInfo(mixer->hInputMixer, + &line, + MIXER_GETLINEINFOF_COMPONENTTYPE); + if (result == MMSYSERR_NOERROR) + { + /* if the WaveInDestination has an InputSelectorControl (Mux or Mixer) + * get the names and IDs of all of the input sources + * make sure the name of the MicrophoneSource (if there is one) + * is "microphone" since pa_start() checks for it + */ + + MIXERLINECONTROLS controls; + MIXERCONTROL control; + + controls.cbStruct = sizeof(MIXERLINECONTROLS); + controls.cbmxctrl = sizeof(MIXERCONTROL); + controls.pamxctrl = &control; + + control.cbStruct = sizeof(MIXERCONTROL); + + controls.dwLineID = line.dwLineID; + controls.dwControlType = MIXERCONTROL_CONTROLTYPE_MUX; + result = mixerGetLineControls(mixer->hInputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + + if (result != MMSYSERR_NOERROR) + { + controls.dwControlType = MIXERCONTROL_CONTROLTYPE_MIXER; + result = mixerGetLineControls(mixer->hInputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + } + + if (result == MMSYSERR_NOERROR) + { + int j; + int exactMic = -1; + int startMic = -1; + int firstMic = -1; + MIXERCONTROLDETAILS details; + MIXERCONTROLDETAILS_LISTTEXT mixList[32]; + + mixer->numInputs = control.cMultipleItems; + mixer->muxID = control.dwControlID; + + details.cbStruct = sizeof(MIXERCONTROLDETAILS); + details.dwControlID = mixer->muxID; + details.cChannels = 1; + details.cbDetails = sizeof(MIXERCONTROLDETAILS_LISTTEXT); + details.paDetails = (LPMIXERCONTROLDETAILS_LISTTEXT)&mixList[0]; + details.cMultipleItems = mixer->numInputs; + + controls.dwControlType = MIXERCONTROL_CONTROLTYPE_VOLUME; + result = mixerGetControlDetails(mixer->hInputMixer, + (LPMIXERCONTROLDETAILS)&details, + MIXER_GETCONTROLDETAILSF_LISTTEXT); + + if (result != MMSYSERR_NOERROR) + mixer->numInputs = 0; + + for (j=0; j < mixer->numInputs; j++) + { + mixer->src[j].lineID = mixList[j].dwParam1; + + controls.dwLineID = mixer->src[j].lineID; + result = mixerGetLineControls(mixer->hInputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + if (result == MMSYSERR_NOERROR) + { + /* mark as volume control */ + mixer->src[j].controlID = control.dwControlID; + } + else + { + /* mark as NOT volume control */ + mixer->src[j].controlID = 0; + } + + line.dwLineID = mixer->src[j].lineID; + + result = mixerGetLineInfo(mixer->hInputMixer, &line, MIXER_GETLINEINFOF_LINEID); + if (result == MMSYSERR_NOERROR && + line.dwComponentType == MIXERLINE_COMPONENTTYPE_SRC_MICROPHONE) + { + if (exactMic == -1) + { + if (strcasecmp(mixList[j].szName, "microphone") == 0) + { + exactMic = j; + } + else if (startMic == -1) + { + if (strncasecmp(mixList[j].szName, "microphone", + strlen("microphone")) == 0) + { + startMic = j; + } + else if (firstMic == -1) + { + firstMic = j; + } + } + } + } + strcpy(mixer->src[j].name, mixList[j].szName); + } + + if (exactMic == -1) + { + if (startMic != -1) + { + strcpy(mixer->src[startMic].name, "microphone"); + } + else if (firstMic != -1) + { + strcpy(mixer->src[firstMic].name, "microphone"); + } + } + } + else + { + /* if the WaveInDestination does not have an InputSelector + * see if the WaveInDestination SourceLine has a VolumeControl + */ + controls.dwControlType = MIXERCONTROL_CONTROLTYPE_VOLUME; + result = mixerGetLineControls(mixer->hInputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + if (result == MMSYSERR_NOERROR) + { + mixer->src[0].lineID = line.dwLineID; + strcpy(mixer->src[0].name, line.szName); + mixer->src[0].controlID = control.dwControlID; + mixer->numInputs = 1; + } + else + { + line.dwSource = 0; + result = mixerGetLineInfo(mixer->hInputMixer, + &line, + MIXER_GETLINEINFOF_SOURCE); + if (result == MMSYSERR_NOERROR) + { + mixer->src[0].lineID = line.dwLineID; + strcpy(mixer->src[0].name, line.szName); + + controls.dwLineID = line.dwLineID; + result = mixerGetLineControls(mixer->hInputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + + if (result == MMSYSERR_NOERROR) + { + mixer->src[0].controlID = control.dwControlID; + } + else + { + mixer->src[0].controlID = 0; + } + + mixer->numInputs = 1; + } + } + } + } + } + + // mixer->speakerID = MIXERLINE_COMPONENTTYPE_DST_SPEAKERS/VolumeControl + // mixer->speakerID = MIXERLINE_COMPONENTTYPE_DST_HEADPHONES/VolumeControl + // mixer->speakerID = MIXERLINE_COMPONENTTYPE_DST_UNDEFINED/VolumeControl + + mixer->speakerID = -1; + mixer->waveID = -1; + + if (mixer->hOutputMixer) { + + const DWORD componentTypes [] = + { + MIXERLINE_COMPONENTTYPE_DST_SPEAKERS, + MIXERLINE_COMPONENTTYPE_DST_HEADPHONES, + MIXERLINE_COMPONENTTYPE_DST_UNDEFINED, + }; + const size_t componentTypeLen = sizeof(componentTypes) / sizeof(DWORD); + DWORD j; + + MIXERLINE line; + line.cbStruct = sizeof(MIXERLINE); + + for (j = 0; j < componentTypeLen; j++) + { + line.dwComponentType = componentTypes[j]; + result = mixerGetLineInfo(mixer->hOutputMixer, + &line, + MIXER_GETLINEINFOF_COMPONENTTYPE); + + if (result == MMSYSERR_NOERROR) + break; + } + + if (result == MMSYSERR_NOERROR) + { + MIXERLINECONTROLS controls; + MIXERCONTROL control; + + controls.cbStruct = sizeof(MIXERLINECONTROLS); + controls.dwLineID = line.dwLineID; + controls.dwControlType = MIXERCONTROL_CONTROLTYPE_VOLUME; + controls.cbmxctrl = sizeof(MIXERCONTROL); + controls.pamxctrl = &control; + + control.cbStruct = sizeof(MIXERCONTROL); + + result = mixerGetLineControls(mixer->hOutputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + + if (result == MMSYSERR_NOERROR) + mixer->speakerID = control.dwControlID; + + // mixer->waveID = MIXERLINE_COMPONENTTYPE_SRC_WAVEOUT/VolumeControl + + const DWORD numSources = line.cConnections; + + for (j = 0; j < numSources; j++) + { + line.dwSource = j; + result = mixerGetLineInfo(mixer->hOutputMixer, + &line, + MIXER_GETLINEINFOF_SOURCE); + if (result == MMSYSERR_NOERROR && + line.dwComponentType == MIXERLINE_COMPONENTTYPE_SRC_WAVEOUT) + { + controls.dwLineID = line.dwLineID; + result = mixerGetLineControls(mixer->hOutputMixer, + &controls, + MIXER_GETLINECONTROLSF_ONEBYTYPE); + if (result == MMSYSERR_NOERROR) + { + mixer->waveID = control.dwControlID; + break; + } + } + } + } + } + + return (PxMixer *)mixer; +} + +void VolumeFunction(HMIXEROBJ hMixer, DWORD controlID, PxVolume *volume) +{ + MIXERCONTROLDETAILS details; + MMRESULT result; + MIXERCONTROLDETAILS_UNSIGNED value; + + memset(&value, 0, sizeof(MIXERCONTROLDETAILS_UNSIGNED)); + + details.cbStruct = sizeof(MIXERCONTROLDETAILS); + details.dwControlID = controlID; + details.cChannels = 1; /* all channels */ + details.cMultipleItems = 0; + details.cbDetails = sizeof(MIXERCONTROLDETAILS_UNSIGNED); + details.paDetails = &value; + + result = mixerGetControlDetails(hMixer, &details, + MIXER_GETCONTROLDETAILSF_VALUE); + + if (*volume < 0.0) { + *volume = (PxVolume)(value.dwValue / 65535.0); + } + else { + if (result != MMSYSERR_NOERROR) + return; + value.dwValue = (unsigned short)(*volume * 65535.0); + mixerSetControlDetails(hMixer, &details, + MIXER_GETCONTROLDETAILSF_VALUE); + } +} + +/* + Px_CloseMixer() closes a mixer opened using Px_OpenMixer and frees any + memory associated with it. +*/ + +void Px_CloseMixer(PxMixer *mixer) +{ + PxInfo *info = (PxInfo *)mixer; + + if (info->hInputMixer) + mixerClose((HMIXER)info->hInputMixer); + if (info->hOutputMixer) + mixerClose((HMIXER)info->hOutputMixer); + free( mixer ); +} + +/* + Master (output) volume +*/ + +PxVolume Px_GetMasterVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + PxVolume vol; + + vol = -1.0; + VolumeFunction(info->hOutputMixer, info->speakerID, &vol); + return vol; +} + +void Px_SetMasterVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + VolumeFunction(info->hOutputMixer, info->speakerID, &volume); +} + +/* + PCM output volume +*/ + +int Px_SupportsPCMOutputVolume( PxMixer* mixer ) +{ + PxInfo* info = ( PxInfo* )( mixer ) ; + return ( info->waveID == -1 ) ? 0 : 1 ; +} + +PxVolume Px_GetPCMOutputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + PxVolume vol; + + vol = -1.0; + VolumeFunction(info->hOutputMixer, info->waveID, &vol); + return vol; +} + +void Px_SetPCMOutputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + VolumeFunction(info->hOutputMixer, info->waveID, &volume); +} + + +/* + All output volumes +*/ + +int Px_GetNumOutputVolumes( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return 2; +} + +const char *Px_GetOutputVolumeName( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + if (i==1) + return "Wave Out"; + else + return "Master Volume"; +} + +PxVolume Px_GetOutputVolume( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + + if (i==1) + return Px_GetPCMOutputVolume(mixer); + else + return Px_GetMasterVolume(mixer); +} + +void Px_SetOutputVolume( PxMixer *mixer, int i, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + + if (i==1) + Px_SetPCMOutputVolume(mixer, volume); + else + Px_SetMasterVolume(mixer, volume); +} + +/* + Input sources +*/ + +int Px_GetNumInputSources( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + + return info->numInputs; +} + +const char *Px_GetInputSourceName( PxMixer *mixer, int i) +{ + PxInfo *info = (PxInfo *)mixer; + + return info->src[i].name; +} + +int Px_GetCurrentInputSource( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + MIXERCONTROLDETAILS details; + MIXERCONTROLDETAILS_BOOLEAN flags[32]; + MMRESULT result; + int i; + + details.cbStruct = sizeof(MIXERCONTROLDETAILS); + details.dwControlID = info->muxID; + details.cMultipleItems = info->numInputs; + details.cChannels = 1; + details.cbDetails = sizeof(MIXERCONTROLDETAILS_BOOLEAN); + details.paDetails = (LPMIXERCONTROLDETAILS_BOOLEAN)&flags[0]; + + result = mixerGetControlDetails(info->hInputMixer, + (LPMIXERCONTROLDETAILS)&details, + MIXER_GETCONTROLDETAILSF_VALUE); + + if (result == MMSYSERR_NOERROR) { + for(i=0; inumInputs; i++) + if (flags[i].fValue) + return i; + } + + return 0; +} + +void Px_SetCurrentInputSource( PxMixer *mixer, int i ) +{ + PxInfo *info = (PxInfo *)mixer; + MIXERCONTROLDETAILS details; + MIXERCONTROLDETAILS_BOOLEAN flags[32]; + MMRESULT result; + int j; + + details.cbStruct = sizeof(MIXERCONTROLDETAILS); + details.dwControlID = info->muxID; + details.cMultipleItems = info->numInputs; + details.cChannels = 1; + details.cbDetails = sizeof(MIXERCONTROLDETAILS_BOOLEAN); + details.paDetails = (LPMIXERCONTROLDETAILS_BOOLEAN)&flags[0]; + + for(j=0; jnumInputs; j++) + flags[j].fValue = (i == j); + + result = mixerSetControlDetails(info->hInputMixer, + (LPMIXERCONTROLDETAILS)&details, + MIXER_SETCONTROLDETAILSF_VALUE); +} + +/* + Input volume +*/ + +PxVolume Px_GetInputVolume( PxMixer *mixer ) +{ + PxInfo *info = (PxInfo *)mixer; + PxVolume vol; + int src = Px_GetCurrentInputSource(mixer); + + vol = -1.0; + VolumeFunction(info->hInputMixer, info->src[src].controlID, &vol); + return vol; +} + +void Px_SetInputVolume( PxMixer *mixer, PxVolume volume ) +{ + PxInfo *info = (PxInfo *)mixer; + int src = Px_GetCurrentInputSource(mixer); + + VolumeFunction(info->hInputMixer, info->src[src].controlID, &volume); +} + +/* + Balance +*/ + +int Px_SupportsOutputBalance( PxMixer *mixer ) +{ + return 0; +} + +PxBalance Px_GetOutputBalance( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetOutputBalance( PxMixer *mixer, PxBalance balance ) +{ +} + +/* + Playthrough +*/ + +int Px_SupportsPlaythrough( PxMixer *mixer ) +{ + return 0; +} + +PxVolume Px_GetPlaythrough( PxMixer *mixer ) +{ + return 0.0; +} + +void Px_SetPlaythrough( PxMixer *mixer, PxVolume volume ) +{ +} + +int Px_SetMicrophoneBoost( PxMixer* mixer, int enable ) +{ + MIXERLINE mixerLine ; + LPMIXERCONTROL mixerControl ; + MIXERLINECONTROLS mixerLineControls ; + MIXERCONTROLDETAILS mixerControlDetails ; + MIXERCONTROLDETAILS_BOOLEAN value ; + MMRESULT mmr = MMSYSERR_ERROR ; + DWORD boost_id = -1 ; + DWORD x ; + + // cast void pointer + PxInfo* info = ( PxInfo* )( mixer ) ; + + if ( info == NULL ) + return MMSYSERR_ERROR ; + + // + // get line info + // + + mixerLine.cbStruct = sizeof( MIXERLINE ) ; + mixerLine.dwComponentType = MIXERLINE_COMPONENTTYPE_SRC_MICROPHONE ; + + mmr = mixerGetLineInfo( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerLine, + MIXER_GETLINEINFOF_COMPONENTTYPE + ) ; + + if ( mmr != MMSYSERR_NOERROR ) + return mmr ; + + // + // get all controls + // + + mixerControl = (MIXERCONTROL *)malloc( sizeof( MIXERCONTROL ) * mixerLine.cControls ) ; + + mixerLineControls.cbStruct = sizeof( MIXERLINECONTROLS ) ; + mixerLineControls.dwLineID = mixerLine.dwLineID ; + mixerLineControls.cControls = mixerLine.cControls ; + mixerLineControls.cbmxctrl = sizeof( MIXERCONTROL ) ; + mixerLineControls.pamxctrl = ( LPMIXERCONTROL )( mixerControl ) ; + + mmr = mixerGetLineControls( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerLineControls, + MIXER_GETLINECONTROLSF_ALL + ) ; + + if ( mmr != MMSYSERR_NOERROR ) + { + free(mixerControl); + + return mmr ; + } + + // + // find boost control + // + + for ( x = 0 ; x < mixerLineControls.cControls ; ++x ) + { + // check control type + if ( mixerControl[x].dwControlType & MIXERCONTROL_CONTROLTYPE_BOOLEAN ) + { + // normalize control name + char* name = _strupr( mixerControl[x].szName ) ; + + // check for 'mic' and 'boost' + if ( + ( strstr( name, "MIC" ) != NULL ) + && ( strstr( name, "BOOST" ) != NULL ) + ) + { + boost_id = mixerControl[x].dwControlID ; + break ; + } + } + } + + if ( boost_id == -1 ) + { + free(mixerControl); + + return MMSYSERR_ERROR ; + } + + // + // get control details + // + + mixerControlDetails.cbStruct = sizeof( MIXERCONTROLDETAILS ) ; + mixerControlDetails.dwControlID = boost_id ; + mixerControlDetails.cChannels = 1 ; + mixerControlDetails.cMultipleItems = 0 ; + mixerControlDetails.cbDetails = sizeof( MIXERCONTROLDETAILS_BOOLEAN ) ; + mixerControlDetails.paDetails = &value ; + + mmr = mixerGetControlDetails( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerControlDetails, + MIXER_GETCONTROLDETAILSF_VALUE + ) ; + + if ( mmr != MMSYSERR_NOERROR ) + { + free(mixerControl); + + return mmr ; + } + + // + // update value + // + + value.fValue = ( enable == 0 ) ? 0L : 1L ; + + // + // set control details + // + + mmr = mixerSetControlDetails( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerControlDetails, + MIXER_SETCONTROLDETAILSF_VALUE + ) ; + + free(mixerControl); + + if ( mmr != MMSYSERR_NOERROR ) + return mmr ; + + return mmr ; +} + +int Px_GetMicrophoneBoost( PxMixer* mixer ) +{ + MIXERLINE mixerLine ; + LPMIXERCONTROL mixerControl ; + MIXERLINECONTROLS mixerLineControls ; + MIXERCONTROLDETAILS mixerControlDetails ; + MIXERCONTROLDETAILS_BOOLEAN value ; + MMRESULT mmr = MMSYSERR_ERROR ; + DWORD boost_id = -1 ; + DWORD x ; + + // cast void pointer + PxInfo* info = ( PxInfo* )( mixer ) ; + + if ( info == NULL ) + return -1 ; + + // + // get line info + // + + mixerLine.cbStruct = sizeof( MIXERLINE ) ; + mixerLine.dwComponentType = MIXERLINE_COMPONENTTYPE_SRC_MICROPHONE ; + + mmr = mixerGetLineInfo( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerLine, + MIXER_GETLINEINFOF_COMPONENTTYPE + ) ; + + if ( mmr != MMSYSERR_NOERROR ) + return -1 ; + + // + // get all controls + // + + mixerControl = (MIXERCONTROL *)malloc( sizeof( MIXERCONTROL ) * mixerLine.cControls ) ; + + mixerLineControls.cbStruct = sizeof( MIXERLINECONTROLS ) ; + mixerLineControls.dwLineID = mixerLine.dwLineID ; + mixerLineControls.cControls = mixerLine.cControls ; + mixerLineControls.cbmxctrl = sizeof( MIXERCONTROL ) ; + mixerLineControls.pamxctrl = ( LPMIXERCONTROL )( mixerControl ) ; + + mmr = mixerGetLineControls( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerLineControls, + MIXER_GETLINECONTROLSF_ALL + ) ; + + if ( mmr != MMSYSERR_NOERROR ) + { + free(mixerControl); + + return -1 ; + } + + // + // find boost control + // + + for ( x = 0 ; x < mixerLineControls.cControls ; ++x ) + { + // check control type + if ( mixerControl[x].dwControlType & MIXERCONTROL_CONTROLTYPE_BOOLEAN ) + { + // normalize control name + char* name = _strupr( mixerControl[x].szName ) ; + + // check for 'mic' and 'boost' + if ( + ( strstr( name, "MIC" ) != NULL ) + && ( strstr( name, "BOOST" ) != NULL ) + ) + { + boost_id = mixerControl[x].dwControlID ; + break ; + } + } + } + + if ( boost_id == -1 ) + { + free(mixerControl); + + return -1 ; + } + + // + // get control details + // + + mixerControlDetails.cbStruct = sizeof( MIXERCONTROLDETAILS ) ; + mixerControlDetails.dwControlID = boost_id ; + mixerControlDetails.cChannels = 1 ; + mixerControlDetails.cMultipleItems = 0 ; + mixerControlDetails.cbDetails = sizeof( MIXERCONTROLDETAILS_BOOLEAN ) ; + mixerControlDetails.paDetails = &value ; + + mmr = mixerGetControlDetails( + ( HMIXEROBJ )( info->hInputMixer ), + &mixerControlDetails, + MIXER_GETCONTROLDETAILSF_VALUE + ) ; + + free(mixerControl); + + if ( mmr != MMSYSERR_NOERROR ) + return -1 ; + + return ( int )( value.fValue ) ; +} + +int Px_SetCurrentInputSourceByName( PxMixer* mixer, const char* name ) +{ + int x ; + + // cast void pointer + PxInfo* info = ( PxInfo* )( mixer ) ; + + // make sure we have a mixer + if ( info == NULL ) + return MMSYSERR_ERROR ; + + // make sure we have a search name + if ( name == NULL ) + return MMSYSERR_ERROR ; + + // + // set input source + // + + for ( x = 0 ; x < info->numInputs ; ++x ) + { + // compare passed name with control name + if ( strcasecmp( info->src[x].name, name ) == 0 ) + { + // set input source + Px_SetCurrentInputSource( mixer, x ) ; + + // make sure set'ing worked + if ( Px_GetCurrentInputSource( mixer ) == x ) + return MMSYSERR_NOERROR ; + else + return MMSYSERR_ERROR ; + } + } + + return MMSYSERR_ERROR ; +} + diff --git a/3rdparty/iaxclient-2/lib/portmixer/winproj/portmixer.vcproj b/3rdparty/iaxclient-2/lib/portmixer/winproj/portmixer.vcproj new file mode 100644 index 0000000..6891189 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/portmixer/winproj/portmixer.vcproj @@ -0,0 +1,303 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/sound2c.pl b/3rdparty/iaxclient-2/lib/sound2c.pl new file mode 100644 index 0000000..0ec00e0 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/sound2c.pl @@ -0,0 +1,37 @@ +#!/usr/bin/perl + +$IN = $ARGV[0]; +$OUT = $ARGV[1]; + +open (RAW, "sox $IN -t .sw -|"); + +open (OUTF, ">$OUT"); + +$var = $OUT; +$var =~ s/\.c$//; + +print OUTF < + +The code in resample.c/resample.h has been liberally yanked from the SoX +distribution, and reworked just a tiny bit to allow compilation outside +of SoX. + +Aside from some minor changes to the calling conventions (to use just +the private resample data structure, not the larget sox structures), and +generic code moves/defines that needed to be localized, the other +notable changes are: + +1) st_sample_t is here defined as a 16 bit integer, and not a 32 bit +integer, so this code will will be able to operate over 16 bit unsigned +samples (the resample effect works with floating point internally +anyway, so it was a small change in the code). + +2) The "getopts" call is not necessary (nor, at this point helpful, + since the options are set to their default now ad the beginning of + start). + +3) start now takes two additional parameters, "inrate" and "outrate" + +To use this, the basic idea is: + + +st_resample_t resampler; + +st_resample_start(&resampler, inrate, outrate); + +while(you have input data) +{ + iNum = (number of Input samples we have); + oNum = (size of Output buffer available) + iBuf = input buffer; + oBuf = output buffer; + if(st_resample_flow(&resampler, ibuf, obuf, &iNum, &oNum) != ST_SUCCESS) + { + handle error. + } + + (after calling, iNum, oNum will the the count of buffers + read/written) +} + +finally, you call st_sample_drain, to get the "last" output; + +if(st_sample_drain(&resampler, obuf, &oNum) != ST_SUCCESS) +{ + error +} + +Then, call st_sample_stop, to free resources: +st_sample_stop(&resampler); + +For a discussion on this and other resampling algorithms, see this page for a +great analysis by K. Bradley and Andreas Wilde at: + http://leute.server.de/wilde/resample.html + diff --git a/3rdparty/iaxclient-2/lib/sox/compand.c b/3rdparty/iaxclient-2/lib/sox/compand.c new file mode 100644 index 0000000..6ecdd83 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/sox/compand.c @@ -0,0 +1,397 @@ +/* + * Compander effect + * + * Written by Nick Bailey (nick@bailey-family.org.uk or + * n.bailey@elec.gla.ac.uk) + * + * Copyright 1999 Chris Bagwell And Nick Bailey + * This source code is freely redistributable and may be used for + * any purpose. This copyright notice must be maintained. + * Chris Bagwell And Nick Bailey are not responsible for + * the consequences of using this software. + */ + +#include +#include +#include +#include "sox.h" + +/* + * Compressor/expander effect for dsp. + * + * Flow diagram for one channel: + * + * ------------ --------------- + * | | | | --- + * ibuff ---+---| integrator |--->| transfer func |--->| | + * | | | | | | | + * | ------------ --------------- | | * gain + * | | * |----------->obuff + * | ------- | | + * | | | | | + * +----->| delay |-------------------------->| | + * | | --- + * ------- + * + * Usage: + * compand attack1,decay1[,attack2,decay2...] + * in-dB1,out-dB1[,in-dB2,out-dB2...] + * [ gain [ initial-volume [ delay ] ] ] + * + * Note: clipping can occur if the transfer function pushes things too + * close to 0 dB. In that case, use a negative gain, or reduce the + * output level of the transfer function. + */ + +/* + * Process options + * + * Don't do initialization now. + * The 'info' fields are not yet filled in. + */ +int st_compand_getopts(compand_t l, int n, char **argv) +{ + + if (n < 2 || n > 5) + { + st_fail("Wrong number of arguments for the compander effect\n" + "Use: {,}+ {,}+ " + "[ [ [attackRate = malloc(sizeof(double) * rates)) == NULL || + (l->decayRate = malloc(sizeof(double) * rates)) == NULL || + (l->volume = malloc(sizeof(double) * rates)) == NULL) + { + st_fail("Out of memory"); + return (ST_EOF); + } + l->expectedChannels = rates; + l->delay_buf = NULL; + + /* Now tokenise the rates string and set up these arrays. Keep + them in seconds at the moment: we don't know the sample rate yet. */ + + s = strtok(argv[0], ","); i = 0; + do { + l->attackRate[i] = atof(s); s = strtok(NULL, ","); + l->decayRate[i] = atof(s); s = strtok(NULL, ","); + ++i; + } while (s != NULL); + + /* Same business, but this time for the transfer function */ + + for (s = argv[1], commas = 0; *s; ++s) + if (*s == ',') ++commas; + + if (commas % 2 == 0) /* There must be an even number of + transfer parameters */ + { + st_fail("compander: Odd number of transfer function parameters\n" + "Each input value in dB must have a corresponding output value"); + return (ST_EOF); + } + + tfers = 3 + commas/2; /* 0, 0 at start; 1, 1 at end */ + if ((l->transferIns = malloc(sizeof(double) * tfers)) == NULL || + (l->transferOuts = malloc(sizeof(double) * tfers)) == NULL) + { + st_fail("Out of memory"); + return (ST_EOF); + } + l->transferPoints = tfers; + l->transferIns[0] = 0.0; l->transferOuts[0] = 0.0; + l->transferIns[tfers-1] = 1.0; l->transferOuts[tfers-1] = 1.0; + s = strtok(argv[1], ","); i = 1; + do { + if (!strcmp(s, "-inf")) + { + st_fail("Input signals of zero level must always generate zero output"); + return (ST_EOF); + } + l->transferIns[i] = pow(10.0, atof(s)/20.0); + if (l->transferIns[i] > 1.0) + { + st_fail("dB values are relative to maximum input, and, ipso facto, " + "cannot exceed 0"); + return (ST_EOF); + } + if (l->transferIns[i] == 1.0) /* Final point was explicit */ + --(l->transferPoints); + if (i > 0 && l->transferIns[i] <= l->transferIns[i-1]) + { + st_fail("Transfer function points don't have strictly ascending " + "input amplitude"); + return (ST_EOF); + } + s = strtok(NULL, ","); + l->transferOuts[i] = strcmp(s, "-inf") ? + pow(10.0, atof(s)/20.0) : 0; + s = strtok(NULL, ","); + ++i; + } while (s != NULL); + + /* If there is a postprocessor gain, store it */ + if (n >= 3) l->outgain = pow(10.0, atof(argv[2])/20.0); + else l->outgain = 1.0; + + /* Set the initial "volume" to be attibuted to the input channels. + Unless specified, choose 1.0 (maximum) otherwise clipping will + result if the user has seleced a long attack time */ + for (i = 0; i < l->expectedChannels; ++i) { + double v = n>=4 ? pow(10.0, atof(argv[3])/20) : 1.0; + l->volume[i] = v; + + /* If there is a delay, store it. */ + if (n >= 5) l->delay = atof(argv[4]); + else l->delay = 0.0; + } + } + return (ST_SUCCESS); +} + + +/* + * Prepare processing. + * Do all initializations. + */ +int st_compand_start(compand_t *lH, char **opts, int nopts) +{ + int i; + compand_t l; + + *lH = malloc(sizeof (struct compand)); + l = *lH; + + st_compand_getopts(l, nopts, opts); + +# ifdef DEBUG + { + fprintf(stderr, "Starting compand effect\n"); + fprintf(stderr, "\nRate %ld, size %d, encoding %d, output gain %g.\n", + ST_SAMPLE_RATE, effp->outinfo.size, effp->outinfo.encoding, + l->outgain); + fprintf(stderr, "%d input channel(s) expected: actually %d\n", + l->expectedChannels, ST_CHANNELS); + fprintf(stderr, "\nAttack and decay rates\n" + "======================\n"); + for (i = 0; i < l->expectedChannels; ++i) + fprintf(stderr, "Channel %d: attack = %-12g decay = %-12g\n", + i, l->attackRate[i], l->decayRate[i]); + fprintf(stderr, "\nTransfer function (linear values)\n" + "================= =============\n"); + for (i = 0; i < l->transferPoints; ++i) + fprintf(stderr, "%12g -> %-12g\n", + l->transferIns[i], l->transferOuts[i]); + } +# endif + + /* Convert attack and decay rates using number of samples */ + + for (i = 0; i < l->expectedChannels; ++i) { + if (l->attackRate[i] > 1.0/ST_SAMPLE_RATE) + l->attackRate[i] = 1.0 - + exp(-1.0/(ST_SAMPLE_RATE * l->attackRate[i])); + else + l->attackRate[i] = 1.0; + if (l->decayRate[i] > 1.0/ST_SAMPLE_RATE) + l->decayRate[i] = 1.0 - + exp(-1.0/(ST_SAMPLE_RATE * l->decayRate[i])); + else + l->decayRate[i] = 1.0; + } + + /* Allocate the delay buffer */ + l->delay_buf_size = (int) (l->delay * ST_SAMPLE_RATE * ST_CHANNELS); + if (l->delay_buf_size > 0 + && (l->delay_buf = malloc(sizeof(long) * l->delay_buf_size)) == NULL) { + st_fail("Out of memory"); + return (ST_EOF); + } + for (i = 0; i < l->delay_buf_size; i++) + l->delay_buf[i] = 0; + l->delay_buf_ptr = 0; + l->delay_buf_cnt = 0; + l->delay_buf_full= 0; + + return (ST_SUCCESS); +} + +/* + * Update a volume value using the given sample + * value, the attack rate and decay rate + */ + +static void doVolume(double *v, double samp, compand_t l, int chan) +{ + double s = samp/ST_SAMPLE_MAX; + double delta = s - *v; + + if (delta > 0.0) /* increase volume according to attack rate */ + *v += delta * l->attackRate[chan]; + else /* reduce volume according to decay rate */ + *v += delta * l->decayRate[chan]; +} + +/* + * Processed signed long samples from ibuf to obuf. + * Return number of samples processed. + */ +int st_compand_flow(compand_t l, st_sample_t *ibuf, st_sample_t *obuf, + st_size_t *isamp, st_size_t *osamp) +{ + int len = (*isamp > *osamp) ? *osamp : *isamp; + int filechans = ST_CHANNELS; + int idone,odone; + long checkbuf; //if st_sample_t of type int32_t + + for (idone = 0,odone = 0; idone < len; ibuf += filechans) { + int chan; + + /* Maintain the volume fields by simulating a leaky pump circuit */ + + for (chan = 0; chan < filechans; ++chan) { + if (l->expectedChannels == 1 && filechans > 1) { + /* User is expecting same compander for all channels */ + int i; + double maxsamp = 0.0; + for (i = 0; i < filechans; ++i) { + double rect = fabs(ibuf[i]); + if (rect > maxsamp) maxsamp = rect; + } + doVolume(&l->volume[0], maxsamp, l, 0); + break; + } else + doVolume(&l->volume[chan], fabs(ibuf[chan]), l, chan); + } + + /* Volume memory is updated: perform compand */ + + for (chan = 0; chan < filechans; ++chan) { + double v = l->expectedChannels > 1 ? + l->volume[chan] : l->volume[0]; + double outv; + int piece; + + for (piece = 1 /* yes, 1 */; + piece < l->transferPoints; + ++piece) + if (v >= l->transferIns[piece - 1] && + v < l->transferIns[piece]) + break; + + outv = l->transferOuts[piece-1] + + (l->transferOuts[piece] - l->transferOuts[piece-1]) * + (v - l->transferIns[piece-1]) / + (l->transferIns[piece] - l->transferIns[piece-1]); + + if (l->delay_buf_size <= 0) + { + checkbuf = (long int) (ibuf[chan]*(outv/v)*l->outgain); + if(checkbuf > ST_SAMPLE_MAX) + obuf[odone] = ST_SAMPLE_MAX; + else if(checkbuf < ST_SAMPLE_MIN) + obuf[odone] = ST_SAMPLE_MIN; + else + obuf[odone] = (st_sample_t) checkbuf; + + idone++; + odone++; + } + else + { + if (l->delay_buf_cnt >= l->delay_buf_size) + { + l->delay_buf_full=1; //delay buffer is now definetly full + checkbuf = (long int) (l->delay_buf[l->delay_buf_ptr]*(outv/v)*l->outgain); + if(checkbuf > ST_SAMPLE_MAX) + obuf[odone] = ST_SAMPLE_MAX; + else if(checkbuf < ST_SAMPLE_MIN) + obuf[odone] = ST_SAMPLE_MIN; + else + obuf[odone] = (st_sample_t) checkbuf; + + odone++; + idone++; + } + else + { + l->delay_buf_cnt++; + idone++; //no "odone++" because we did not fill obuf[...] + } + l->delay_buf[l->delay_buf_ptr++] = ibuf[chan]; + l->delay_buf_ptr %= l->delay_buf_size; + } + } + } + + *isamp = idone; *osamp = odone; + return (ST_SUCCESS); +} + +/* + * Drain out compander delay lines. + */ +int st_compand_drain(compand_t l, st_sample_t *obuf, st_size_t *osamp) +{ + int done; + + /* + * Drain out delay samples. Note that this loop does all channels. + */ + if(l->delay_buf_full==0) l->delay_buf_ptr=0; + for (done = 0; done < (int) *osamp && l->delay_buf_cnt > 0; done++) { + obuf[done] = l->delay_buf[l->delay_buf_ptr++]; + l->delay_buf_ptr %= l->delay_buf_size; + l->delay_buf_cnt--; + } + + /* tell caller number of samples played */ + *osamp = done; + return (ST_SUCCESS); +} + + +/* + * Clean up compander effect. + */ +int st_compand_stop(compand_t l) +{ + + free((char *) l->delay_buf); + free((char *) l->transferOuts); + free((char *) l->transferIns); + free((char *) l->volume); + free((char *) l->decayRate); + free((char *) l->attackRate); + + l->delay_buf = NULL; + l->transferOuts = NULL; + l->transferIns = NULL; + l->volume = NULL; + l->decayRate = NULL; + l->attackRate = NULL; + + return (ST_SUCCESS); +} diff --git a/3rdparty/iaxclient-2/lib/sox/resample.c b/3rdparty/iaxclient-2/lib/sox/resample.c new file mode 100644 index 0000000..a20e826 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/sox/resample.c @@ -0,0 +1,711 @@ +/* + * July 5, 1991 + * Copyright 1991 Lance Norskog And Sundry Contributors + * This source code is freely redistributable and may be used for + * any purpose. This copyright notice must be maintained. + * Lance Norskog And Sundry Contributors are not responsible for + * the consequences of using this software. + */ + +/* + * Sound Tools rate change effect file. + * Spiffy rate changer using Smith & Wesson Bandwidth-Limited Interpolation. + * The algorithm is described in "Bandlimited Interpolation - + * Introduction and Algorithm" by Julian O. Smith III. + * Available on ccrma-ftp.stanford.edu as + * pub/BandlimitedInterpolation.eps.Z or similar. + * + * The latest stand alone version of this algorithm can be found + * at ftp://ccrma-ftp.stanford.edu/pub/NeXT/ + * under the name of resample-version.number.tar.Z + * + * NOTE: There is a newer version of the resample routine then what + * this file was originally based on. Those adventurous might be + * interested in reviewing its improvesments and porting it to this + * version. + */ + +/* Fixed bug: roll off frequency was wrong, too high by 2 when upsampling, + * too low by 2 when downsampling. + * Andreas Wilde, 12. Feb. 1999, andreas@eakaw2.et.tu-dresden.de +*/ + +/* + * October 29, 1999 + * Various changes, bugfixes(?), increased precision, by Stan Brooks. + * + * This source code 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. + * + */ +/* + * SJB: [11/25/99] + * TODO: another idea for improvement... + * note that upsampling usually doesn't require interpolation, + * therefore is faster and more accurate than downsampling. + * Downsampling by an integer factor is also simple, since + * it just involves decimation if the input is already + * lowpass-filtered to the output Nyquist freqency. + * Get the idea? :) + */ + +/* Modified to compile outside of SoX by Steve Kann + * 14Apr2003 */ +#define _USE_MATH_DEFINES +#include +#include +#include + + + +/* sox includes */ +#include "sox.h" +#include "stdio.h" + +/* this Float MUST match that in filter.c */ +#define Float double/*float*/ +#define ISCALE 0x10000 + +/* largest factor for which exact-coefficients upsampling will be used */ +#define NQMAX 511 + +#define BUFFSIZE 8192 /*16384*/ /* Total I/O buffer size */ + + +static void LpFilter(double c[], + long N, + double frq, + double Beta, + long Num); + +/* makeFilter is used by filter.c */ +int makeFilter(Float Imp[], + long Nwing, + double Froll, + double Beta, + long Num, + int Normalize); + +static long SrcUD(resample_t r, long Nx); +static long SrcEX(resample_t r, long Nx); + +/* define some functions/types for compatibility SK */ +/* TODO: + st_sample_t was int32! (we prefer int16!) + Make sure that MAX/MIN work right now. +*/ + + +/* + * Process options + */ +int st_resample_getopts(resample_t r, int n, char **argv) +{ + + /* These defaults are conservative with respect to aliasing. */ + r->rolloff = 0.80; + r->beta = 16; /* anything <=2 means Nutall window */ + r->quadr = 0; + r->Nmult = 45; + + /* This used to fail, but with sox-12.15 it works. AW */ + if ((n >= 1)) { + if (!strcmp(argv[0], "-qs")) { + r->quadr = 1; + n--; argv++; + } + else if (!strcmp(argv[0], "-q")) { + r->rolloff = 0.875; + r->quadr = 1; + r->Nmult = 75; + n--; argv++; + } + else if (!strcmp(argv[0], "-ql")) { + r->rolloff = 0.94; + r->quadr = 1; + r->Nmult = 149; + n--; argv++; + } + } + + if ((n >= 1) && (sscanf(argv[0], "%lf", &r->rolloff) != 1)) + { + st_fail("Usage: resample [ rolloff [ beta ] ]"); + return (ST_EOF); + } + else if ((r->rolloff <= 0.01) || (r->rolloff >= 1.0)) + { + st_fail("resample: rolloff factor (%f) no good, should be 0.01rolloff); + return(ST_EOF); + } + + if ((n >= 2) && !sscanf(argv[1], "%lf", &r->beta)) + { + st_fail("Usage: resample [ rolloff [ beta ] ]"); + return (ST_EOF); + } + else if (r->beta <= 2.0) { + r->beta = 0; + st_report("resample opts: Nuttall window, cutoff %f\n", r->rolloff); + } else { + st_report("resample opts: Kaiser window, cutoff %f, beta %f\n", r->rolloff, r->beta); + } + return (ST_SUCCESS); +} + +/* + * Prepare processing. + */ +int st_resample_start(resample_t *rH, int inrate, int outrate) +{ + long Xoff, gcdrate; + int i; + resample_t r; + + *rH = malloc(sizeof (struct resamplestuff)); + r=*rH; + + if(!r) + { + st_fail("can't allocate memory"); + } + + /* just set defaults */ + st_resample_getopts(r,0,NULL); + + if (inrate == outrate) + { + st_fail("Input and Output rates must be different to use resample effect"); + return(ST_EOF); + } + + r->Factor = (double)outrate / (double)inrate; + + gcdrate = st_gcd((long)inrate, (long)outrate); + r->a = inrate / gcdrate; + r->b = outrate / gcdrate; + + if (r->a <= r->b && r->b <= NQMAX) { + r->quadr = -1; /* exact coeff's */ + r->Nq = r->b; /* MAX(r->a,r->b); */ + } else { + r->Nq = Nc; /* for now */ + } + + /* Check for illegal constants */ +# if 0 + if (Lp >= 16) st_fail("Error: Lp>=16"); + if (Nb+Nhg+NLpScl >= 32) st_fail("Error: Nb+Nhg+NLpScl>=32"); + if (Nh+Nb > 32) st_fail("Error: Nh+Nb>32"); +# endif + + /* Nwing: # of filter coeffs in right wing */ + r->Nwing = r->Nq * (r->Nmult/2+1) + 1; + + r->Imp = (Float *)malloc(sizeof(Float) * (r->Nwing+2)) + 1; + /* need Imp[-1] and Imp[Nwing] for quadratic interpolation */ + /* returns error # <=0, or adjusted wing-len > 0 */ + i = makeFilter(r->Imp, r->Nwing, r->rolloff, r->beta, r->Nq, 1); + if (i <= 0) + { + st_fail("resample: Unable to make filter\n"); + return (ST_EOF); + } + + /*st_report("Nmult: %ld, Nwing: %ld, Nq: %ld\n",r->Nmult,r->Nwing,r->Nq);*/ + + if (r->quadr < 0) { /* exact coeff's method */ + r->Xh = r->Nwing/r->b; + st_report("resample: rate ratio %ld:%ld, coeff interpolation not needed\n", r->a, r->b); + } else { + r->dhb = Np; /* Fixed-point Filter sampling-time-increment */ + if (r->Factor<1.0) r->dhb = r->Factor*Np + 0.5; + r->Xh = (r->Nwing<dhb; + /* (Xh * dhb)>>La is max index into Imp[] */ + } + + /* reach of LP filter wings + some creeping room */ + Xoff = r->Xh + 10; + r->Xoff = Xoff; + + /* Current "now"-sample pointer for input to filter */ + r->Xp = Xoff; + /* Position in input array to read into */ + r->Xread = Xoff; + /* Current-time pointer for converter */ + r->Time = Xoff; + if (r->quadr < 0) { /* exact coeff's method */ + r->t = Xoff*r->Nq; + } + i = BUFFSIZE - 2*Xoff; + if (i < r->Factor + 1.0/r->Factor) /* Check input buffer size */ + { + st_fail("Factor is too small or large for BUFFSIZE"); + return (ST_EOF); + } + + r->Xsize = 2*Xoff + i/(1.0+r->Factor); + r->Ysize = BUFFSIZE - r->Xsize; + /* st_report("Xsize %d, Ysize %d, Xoff %d",r->Xsize,r->Ysize,r->Xoff); */ + + r->X = (Float *) malloc(sizeof(Float) * (BUFFSIZE)); + r->Y = r->X + r->Xsize; + + /* Need Xoff zeros at beginning of sample */ + for (i=0; iX[i] = 0; + return (ST_SUCCESS); +} + +/* + * Processed signed long samples from ibuf to obuf. + * Return number of samples processed. + */ +int st_resample_flow(resample_t *rH, st_sample_t *ibuf, st_sample_t *obuf, + st_size_t *isamp, st_size_t *osamp) +{ + long i, last, Nout, Nx, Nproc; + resample_t r = *rH; + + /* constrain amount we actually process */ + /*fprintf(stderr,"Xp %d, Xread %d, isamp %d, ",r->Xp, r->Xread,*isamp);*/ + + Nproc = r->Xsize - r->Xp; + + i = (r->Ysize < *osamp)? r->Ysize : *osamp; + if (Nproc * r->Factor >= i) + Nproc = i / r->Factor; + + Nx = Nproc - r->Xread; /* space for right-wing future-data */ + if (Nx <= 0) + { + st_fail("resample: Can not handle this sample rate change. Nx not positive: %d", Nx); + return (ST_EOF); + } + if (Nx > *isamp) + Nx = *isamp; + /*fprintf(stderr,"Nx %d\n",Nx);*/ + + if (ibuf == NULL) { + for(i = r->Xread; i < Nx + r->Xread ; i++) + r->X[i] = 0; + } else { + for(i = r->Xread; i < Nx + r->Xread ; i++) + r->X[i] = (Float)(*ibuf++)/ISCALE; + } + last = i; + Nproc = last - r->Xoff - r->Xp; + + if (Nproc <= 0) { + /* fill in starting here next time */ + r->Xread = last; + /* leave *isamp alone, we consumed it */ + *osamp = 0; + return (ST_SUCCESS); + } + if (r->quadr < 0) { /* exact coeff's method */ + long creep; + Nout = SrcEX(r, Nproc); + /*fprintf(stderr,"Nproc %d --> %d\n",Nproc,Nout);*/ + /* Move converter Nproc samples back in time */ + r->t -= Nproc * r->b; + /* Advance by number of samples processed */ + r->Xp += Nproc; + /* Calc time accumulation in Time */ + creep = r->t/r->b - r->Xoff; + if (creep) + { + r->t -= creep * r->b; /* Remove time accumulation */ + r->Xp += creep; /* and add it to read pointer */ + /*fprintf(stderr,"Nproc %ld, creep %ld\n",Nproc,creep);*/ + } + } else { /* approx coeff's method */ + long creep; + Nout = SrcUD(r, Nproc); + /*fprintf(stderr,"Nproc %d --> %d\n",Nproc,Nout);*/ + /* Move converter Nproc samples back in time */ + r->Time -= Nproc; + /* Advance by number of samples processed */ + r->Xp += Nproc; + /* Calc time accumulation in Time */ + creep = r->Time - r->Xoff; + if (creep) + { + r->Time -= creep; /* Remove time accumulation */ + r->Xp += creep; /* and add it to read pointer */ + /* fprintf(stderr,"Nproc %ld, creep %ld\n",Nproc,creep); */ + } + } + + { + long i,k; + /* Copy back portion of input signal that must be re-used */ + k = r->Xp - r->Xoff; + /*fprintf(stderr,"k %d, last %d\n",k,last);*/ + for (i=0; iX[i] = r->X[i+k]; + + /* Pos in input buff to read new data into */ + r->Xread = i; + r->Xp = r->Xoff; + + for(i=0; i < Nout; i++) { + // orig: *obuf++ = r->Y[i] * ISCALE; + Float ftemp = r->Y[i] * ISCALE; + + if (ftemp >= ST_SAMPLE_MAX) + *obuf = ST_SAMPLE_MAX; + else if (ftemp <= ST_SAMPLE_MIN) + *obuf = ST_SAMPLE_MIN; + else + *obuf = ftemp; + obuf++; + } + + *isamp = Nx; + *osamp = Nout; + + } + return (ST_SUCCESS); +} + +/* + * Process tail of input samples. + */ +int st_resample_drain(resample_t *rH, st_sample_t *obuf, st_size_t *osamp) +{ + long isamp_res, osamp_res; + st_sample_t *Obuf; + int rc; + resample_t r = *rH; + + /* fprintf(stderr,"Xoff %d, Xt %d <--- DRAIN\n",r->Xoff, r->Xt); */ + + /* stuff end with Xoff zeros */ + isamp_res = r->Xoff; + osamp_res = *osamp; + Obuf = obuf; + while (isamp_res>0 && osamp_res>0) { + st_sample_t Isamp, Osamp; + Isamp = isamp_res; + Osamp = osamp_res; + rc = st_resample_flow(rH, NULL, Obuf, (st_size_t *)&Isamp, (st_size_t *)&Osamp); + if (rc) + return rc; + /* fprintf(stderr,"DRAIN isamp,osamp (%d,%d) -> (%d,%d)\n", + isamp_res,osamp_res,Isamp,Osamp); */ + Obuf += Osamp; + osamp_res -= Osamp; + isamp_res -= Isamp; + } + *osamp -= osamp_res; + /* fprintf(stderr,"DRAIN osamp %d\n", *osamp); */ + if (isamp_res) + st_warn("drain overran obuf by %d\n", isamp_res); + return (ST_SUCCESS); +} + +/* + * Do anything required when you stop reading samples. + * Don't close input file! + */ +int st_resample_stop(resample_t *rH) +{ + resample_t r = *rH; + + free(r->Imp - 1); + free(r->X); + free(r); + /* free(r->Y); Y is in same block starting at X */ + return (ST_SUCCESS); +} + +/* over 90% of CPU time spent in this iprodUD() function */ +/* quadratic interpolation */ +static double qprodUD(const Float Imp[], const Float *Xp, long Inc, double T0, + long dhb, long ct) +{ + const double f = 1.0/(1<>La; + coef = Imp[Hoh]; + { + Float dm,dp,t; + dm = coef - Imp[Hoh-1]; + dp = Imp[Hoh+1] - coef; + t =(Ho & Amask) * f; + coef += ((dp-dm)*t + (dp+dm))*t*0.5; + } + /* filter coef, lower La bits by quadratic interpolation */ + v += coef * *Xp; /* sum coeff * input sample */ + Xp -= Inc; /* Input signal step. NO CHECK ON ARRAY BOUNDS */ + Ho -= dhb; /* IR step */ + } while(--ct); + return v; +} + +/* linear interpolation */ +static double iprodUD(const Float Imp[], const Float *Xp, long Inc, + double T0, long dhb, long ct) +{ + const double f = 1.0/(1<>La; + /* if (Hoh >= End) break; */ + coef = Imp[Hoh] + (Imp[Hoh+1]-Imp[Hoh]) * (Ho & Amask) * f; + /* filter coef, lower La bits by linear interpolation */ + v += coef * *Xp; /* sum coeff * input sample */ + Xp -= Inc; /* Input signal step. NO CHECK ON ARRAY BOUNDS */ + Ho -= dhb; /* IR step */ + } while(--ct); + return v; +} + +/* From resample:filters.c */ +/* Sampling rate conversion subroutine */ + +static long SrcUD(resample_t r, long Nx) +{ + Float *Ystart, *Y; + double Factor; + double dt; /* Step through input signal */ + double time; + double (*prodUD)(); + int n; + + prodUD = (r->quadr)? qprodUD:iprodUD; /* quadratic or linear interp */ + Factor = r->Factor; + time = r->Time; + dt = 1.0/Factor; /* Output sampling period */ + /*fprintf(stderr,"Factor %f, dt %f, ",Factor,dt); */ + /*fprintf(stderr,"Time %f, ",r->Time);*/ + /* (Xh * dhb)>>La is max index into Imp[] */ + /*fprintf(stderr,"ct=%d\n",ct);*/ + /*fprintf(stderr,"ct=%.2f %d\n",(double)r->Nwing*Na/r->dhb, r->Xh);*/ + /*fprintf(stderr,"ct=%ld, T=%.6f, dhb=%6f, dt=%.6f\n", + r->Xh, time-floor(time),(double)r->dhb/Na,dt);*/ + Ystart = Y = r->Y; + n = (int)ceil((double)Nx/dt); + while(n--) + { + Float *Xp; + double v; + double T; + T = time-floor(time); /* fractional part of Time */ + Xp = r->X + (long)time; /* Ptr to current input sample */ + + /* Past inner product: */ + v = (*prodUD)(r->Imp, Xp, -1, T, r->dhb, r->Xh); /* needs Np*Nmult in 31 bits */ + /* Future inner product: */ + v += (*prodUD)(r->Imp, Xp+1, 1, (1.0-T), r->dhb, r->Xh); /* prefer even total */ + + if (Factor < 1) v *= Factor; + *Y++ = v; /* Deposit output */ + time += dt; /* Move to next sample by time increment */ + } + r->Time = time; + /*fprintf(stderr,"Time %f\n",r->Time);*/ + return (Y - Ystart); /* Return the number of output samples */ +} + +/* exact coeff's */ +static double prodEX(const Float Imp[], const Float *Xp, + long Inc, long T0, long dhb, long ct) +{ + double v; + const Float *Cp; + + Cp = Imp + (ct-1)*dhb + T0; /* so Float sum starts with smallest coef's */ + Xp += (ct-1)*Inc; + v = 0; + do { + v += *Cp * *Xp; /* sum coeff * input sample */ + Cp -= dhb; /* IR step */ + Xp -= Inc; /* Input signal step. */ + } while(--ct); + return v; +} + +static long SrcEX(resample_t r, long Nx) +{ + Float *Ystart, *Y; + double Factor; + long a,b; + long time; + int n; + + Factor = r->Factor; + time = r->t; + a = r->a; + b = r->b; + Ystart = Y = r->Y; + n = (Nx*b + (a-1))/a; + while(n--) + { + Float *Xp; + double v; + long T; + T = time % b; /* fractional part of Time */ + Xp = r->X + (time/b); /* Ptr to current input sample */ + + /* Past inner product: */ + v = prodEX(r->Imp, Xp, -1, T, b, r->Xh); + /* Future inner product: */ + v += prodEX(r->Imp, Xp+1, 1, b-T, b, r->Xh); + + if (Factor < 1) v *= Factor; + *Y++ = v; /* Deposit output */ + time += a; /* Move to next sample by time increment */ + } + r->t = time; + return (Y - Ystart); /* Return the number of output samples */ +} + +int makeFilter(Float Imp[], long Nwing, double Froll, double Beta, + long Num, int Normalize) +{ + double *ImpR; + long Mwing, i; + + if (Nwing > MAXNWING) /* Check for valid parameters */ + return(-1); + if ((Froll<=0) || (Froll>1)) + return(-2); + + /* it does help accuracy a bit to have the window stop at + * a zero-crossing of the sinc function */ + Mwing = floor((double)Nwing/(Num/Froll))*(Num/Froll) +0.5; + if (Mwing==0) + return(-4); + + ImpR = (double *) malloc(sizeof(double) * Mwing); + + /* Design a Nuttall or Kaiser windowed Sinc low-pass filter */ + LpFilter(ImpR, Mwing, Froll, Beta, Num); + + if (Normalize) { /* 'correct' the DC gain of the lowpass filter */ + long Dh; + double DCgain; + DCgain = 0; + Dh = Num; /* Filter sampling period for factors>=1 */ + for (i=Dh; i= IzeroEPSILON*sum); + return(sum); +} + +static void LpFilter(double *c, long N, double frq, double Beta, long Num) +{ + long i; + + /* Calculate filter coeffs: */ + c[0] = frq; + for (i=1; i2) { /* Apply Kaiser window to filter coeffs: */ + double IBeta = 1.0/Izero(Beta); + for (i=1; i + +#if defined(__STDC__) || defined(_MSC_VER) +#include +#include +#else +#include +#endif + +static int verbose = 0; +static char *myname="iaxclient-sox"; + +void st_report(const char *fmt, ...) +{ + va_list args; + + if (! verbose) + return; + + fprintf(stderr, "%s: ", myname); + va_start(args, fmt); + vfprintf(stderr, fmt, args); + va_end(args); + fprintf(stderr, "\n"); +} + +void st_warn(const char *fmt, ...) +{ + va_list args; + + fprintf(stderr, "%s: ", myname); + va_start(args, fmt); + + vfprintf(stderr, fmt, args); + va_end(args); + fprintf(stderr, "\n"); +} + +void st_fail(const char *fmt, ...) +{ + va_list args; + extern void cleanup(); + + fprintf(stderr, "%s: ", myname); + + va_start(args, fmt); + vfprintf(stderr, fmt, args); + va_end(args); + fprintf(stderr, "\n"); + exit(2); +} + +long st_gcd(long a, long b) +{ + if (b == 0) + return a; + else + return st_gcd(b, a % b); +} + + diff --git a/3rdparty/iaxclient-2/lib/spandsp/plc.c b/3rdparty/iaxclient-2/lib/spandsp/plc.c new file mode 100644 index 0000000..4edbb2d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/spandsp/plc.c @@ -0,0 +1,267 @@ +/* + * SpanDSP - a series of DSP components for telephony + * + * plc.c + * + * Written by Steve Underwood + * + * Copyright (C) 2004 Steve Underwood + * + * All rights reserved. + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * + * This version may be optionally licenced under the GNU LGPL licence. + * This version is disclaimed to DIGIUM for inclusion in the Asterisk project. + */ + +/*! \file */ +#ifdef HAVE_CONIG_H +#include "config.h" +#endif + +#include +#include +#include +#include +#include + +#include "plc.h" + +#if !defined(FALSE) +#define FALSE 0 +#endif +#if !defined(TRUE) +#define TRUE (!FALSE) +#endif + +#if !defined(INT16_MAX) +#define INT16_MAX (32767) +#define INT16_MIN (-32767-1) +#endif + +/* msvc doesn't know rint() */ +#if defined(WIN32) && defined(_MSC_VER) +#define rint(x) floor((x) + 0.5) +#undef inline +#define inline __inline +#ifndef int16_t +typedef short int16_t; +#endif +#endif + +/* We do a straight line fade to zero volume in 50ms when we are filling in for missing data. */ +#define ATTENUATION_INCREMENT 0.0025 /* Attenuation per sample */ + +#define ms_to_samples(t) (((t)*SAMPLE_RATE)/1000) + +static inline int16_t fsaturate(double damp) +{ + if (damp > 32767.0) + return INT16_MAX; + if (damp < -32768.0) + return INT16_MIN; + return (int16_t) rint(damp); +} + +static void save_history(plc_state_t *s, int16_t *buf, int len) +{ + if (len >= PLC_HISTORY_LEN) + { + /* Just keep the last part of the new data, starting at the beginning of the buffer */ + memcpy(s->history, buf + len - PLC_HISTORY_LEN, sizeof(int16_t)*PLC_HISTORY_LEN); + s->buf_ptr = 0; + return; + } + if (s->buf_ptr + len > PLC_HISTORY_LEN) + { + /* Wraps around - must break into two sections */ + memcpy(s->history + s->buf_ptr, buf, sizeof(int16_t)*(PLC_HISTORY_LEN - s->buf_ptr)); + len -= (PLC_HISTORY_LEN - s->buf_ptr); + memcpy(s->history, buf + (PLC_HISTORY_LEN - s->buf_ptr), sizeof(int16_t)*len); + s->buf_ptr = len; + return; + } + /* Can use just one section */ + memcpy(s->history + s->buf_ptr, buf, sizeof(int16_t)*len); + s->buf_ptr += len; +} +/*- End of function --------------------------------------------------------*/ + +static void normalise_history(plc_state_t *s) +{ + int16_t tmp[PLC_HISTORY_LEN]; + + if (s->buf_ptr == 0) + return; + memcpy(tmp, s->history, sizeof(int16_t)*s->buf_ptr); + memcpy(s->history, s->history + s->buf_ptr, sizeof(int16_t)*(PLC_HISTORY_LEN - s->buf_ptr)); + memcpy(s->history + PLC_HISTORY_LEN - s->buf_ptr, tmp, sizeof(int16_t)*s->buf_ptr); + s->buf_ptr = 0; +} +/*- End of function --------------------------------------------------------*/ + +static int inline amdf_pitch(int min_pitch, int max_pitch, int16_t amp[], int len) +{ + int i; + int j; + int acc; + int min_acc; + int pitch; + + pitch = min_pitch; + min_acc = INT_MAX; + for (i = max_pitch; i <= min_pitch; i++) + { + acc = 0; + for (j = 0; j < len; j++) + acc += abs(amp[i + j] - amp[j]); + if (acc < min_acc) + { + min_acc = acc; + pitch = i; + } + } + return pitch; +} +/*- End of function --------------------------------------------------------*/ + +int plc_rx(plc_state_t *s, int16_t amp[], int len) +{ + int i; + int pitch_overlap; + float old_step; + float new_step; + float old_weight; + float new_weight; + float gain; + + if (s->missing_samples) + { + /* Although we have a real signal, we need to smooth it to fit well + with the synthetic signal we used for the previous block */ + + /* The start of the real data is overlapped with the next 1/4 cycle + of the synthetic data. */ + pitch_overlap = s->pitch >> 2; + if (pitch_overlap > len) + pitch_overlap = len; + gain = 1.0 - s->missing_samples*ATTENUATION_INCREMENT; + if (gain < 0.0) + gain = 0.0; + new_step = 1.0/pitch_overlap; + old_step = new_step*gain; + new_weight = new_step; + old_weight = (1.0 - new_step)*gain; + for (i = 0; i < pitch_overlap; i++) + { + amp[i] = fsaturate(old_weight*s->pitchbuf[s->pitch_offset] + new_weight*amp[i]); + if (++s->pitch_offset >= s->pitch) + s->pitch_offset = 0; + new_weight += new_step; + old_weight -= old_step; + if (old_weight < 0.0) + old_weight = 0.0; + } + s->missing_samples = 0; + } + save_history(s, amp, len); + return len; +} +/*- End of function --------------------------------------------------------*/ + +int plc_fillin(plc_state_t *s, int16_t amp[], int len) +{ + int i; + int pitch_overlap; + float old_step; + float new_step; + float old_weight; + float new_weight; + float gain; + //int16_t *orig_amp; + int orig_len; + + //orig_amp = amp; + orig_len = len; + if (s->missing_samples == 0) + { + /* As the gap in real speech starts we need to assess the last known pitch, + and prepare the synthetic data we will use for fill-in */ + normalise_history(s); + s->pitch = amdf_pitch(PLC_PITCH_MIN, PLC_PITCH_MAX, s->history + PLC_HISTORY_LEN - CORRELATION_SPAN - PLC_PITCH_MIN, CORRELATION_SPAN); + /* We overlap a 1/4 wavelength */ + pitch_overlap = s->pitch >> 2; + /* Cook up a single cycle of pitch, using a single of the real signal with 1/4 + cycle OLA'ed to make the ends join up nicely */ + /* The first 3/4 of the cycle is a simple copy */ + for (i = 0; i < s->pitch - pitch_overlap; i++) + s->pitchbuf[i] = s->history[PLC_HISTORY_LEN - s->pitch + i]; + /* The last 1/4 of the cycle is overlapped with the end of the previous cycle */ + new_step = 1.0/pitch_overlap; + new_weight = new_step; + for ( ; i < s->pitch; i++) + { + s->pitchbuf[i] = s->history[PLC_HISTORY_LEN - s->pitch + i]*(1.0 - new_weight) + s->history[PLC_HISTORY_LEN - 2*s->pitch + i]*new_weight; + new_weight += new_step; + } + /* We should now be ready to fill in the gap with repeated, decaying cycles + of what is in pitchbuf */ + + /* We need to OLA the first 1/4 wavelength of the synthetic data, to smooth + it into the previous real data. To avoid the need to introduce a delay + in the stream, reverse the last 1/4 wavelength, and OLA with that. */ + gain = 1.0; + new_step = 1.0/pitch_overlap; + old_step = new_step; + new_weight = new_step; + old_weight = 1.0 - new_step; + for (i = 0; i < pitch_overlap && i < len; i++) + { + amp[i] = fsaturate(old_weight*s->history[PLC_HISTORY_LEN - 1 - i] + new_weight*s->pitchbuf[i]); + new_weight += new_step; + old_weight -= old_step; + if (old_weight < 0.0) + old_weight = 0.0; + } + s->pitch_offset = i; + } + else + { + gain = 1.0 - s->missing_samples*ATTENUATION_INCREMENT; + i = 0; + } + for ( ; gain > 0.0 && i < len; i++) + { + amp[i] = s->pitchbuf[s->pitch_offset]*gain; + gain -= ATTENUATION_INCREMENT; + if (++s->pitch_offset >= s->pitch) + s->pitch_offset = 0; + } + for ( ; i < len; i++) + amp[i] = 0; + s->missing_samples += orig_len; + save_history(s, amp, len); + return len; +} +/*- End of function --------------------------------------------------------*/ + +plc_state_t *plc_init(plc_state_t *s) +{ + memset(s, 0, sizeof(*s)); + return s; +} +/*- End of function --------------------------------------------------------*/ +/*- End of file ------------------------------------------------------------*/ diff --git a/3rdparty/iaxclient-2/lib/spandsp/plc.h b/3rdparty/iaxclient-2/lib/spandsp/plc.h new file mode 100644 index 0000000..1f8b8aa --- /dev/null +++ b/3rdparty/iaxclient-2/lib/spandsp/plc.h @@ -0,0 +1,164 @@ +/* + * SpanDSP - a series of DSP components for telephony + * + * plc.h + * + * Written by Steve Underwood + * + * Copyright (C) 2004 Steve Underwood + * + * All rights reserved. + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * + * This version may be optionally licenced under the GNU LGPL licence. + * This version is disclaimed to DIGIUM for inclusion in the Asterisk project. + */ + +/*! \file */ + +#if !defined(_PLC_H_) +#define _PLC_H_ + +#ifdef SOLARIS +#include +#else +#ifndef _MSC_VER +#include +#else +typedef short int16_t; +#endif +#endif + +/*! \page plc_page Packet loss concealment +\section plc_page_sec_1 What does it do? +The packet loss concealment module provides a suitable synthetic fill-in signal, +to minimise the audible effect of lost packets in VoIP applications. It is not +tied to any particular codec, and could be used with almost any codec which does not +specify its own procedure for packet loss concealment. + +Where a codec specific concealment procedure exists, the algorithm is usually built +around knowledge of the characteristics of the particular codec. It will, therefore, +generally give better results for that particular codec than this generic concealer will. + +\section plc_page_sec_2 How does it work? +While good packets are being received, the plc_rx() routine keeps a record of the trailing +section of the known speech signal. If a packet is missed, plc_fillin() is called to produce +a synthetic replacement for the real speech signal. The average mean difference function +(AMDF) is applied to the last known good signal, to determine its effective pitch. +Based on this, the last pitch period of signal is saved. Essentially, this cycle of speech +will be repeated over and over until the real speech resumes. However, several refinements +are needed to obtain smooth pleasant sounding results. + +- The two ends of the stored cycle of speech will not always fit together smoothly. This can + cause roughness, or even clicks, at the joins between cycles. To soften this, the + 1/4 pitch period of real speech preceeding the cycle to be repeated is blended with the last + 1/4 pitch period of the cycle to be repeated, using an overlap-add (OLA) technique (i.e. + in total, the last 5/4 pitch periods of real speech are used). + +- The start of the synthetic speech will not always fit together smoothly with the tail of + real speech passed on before the erasure was identified. Ideally, we would like to modify + the last 1/4 pitch period of the real speech, to blend it into the synthetic speech. However, + it is too late for that. We could have delayed the real speech a little, but that would + require more buffer manipulation, and hurt the efficiency of the no-lost-packets case + (which we hope is the dominant case). Instead we use a degenerate form of OLA to modify + the start of the synthetic data. The last 1/4 pitch period of real speech is time reversed, + and OLA is used to blend it with the first 1/4 pitch period of synthetic speech. The result + seems quite acceptable. + +- As we progress into the erasure, the chances of the synthetic signal being anything like + correct steadily fall. Therefore, the volume of the synthesized signal is made to decay + linearly, such that after 50ms of missing audio it is reduced to silence. + +- When real speech resumes, an extra 1/4 pitch period of sythetic speech is blended with the + start of the real speech. If the erasure is small, this smoothes the transition. If the erasure + is long, and the synthetic signal has faded to zero, the blending softens the start up of the + real signal, avoiding a kind of "click" or "pop" effect that might occur with a sudden onset. + +\section plc_page_sec_3 How do I use it? +Before audio is processed, call plc_init() to create an instance of the packet loss +concealer. For each received audio packet that is acceptable (i.e. not including those being +dropped for being too late) call plc_rx() to record the content of the packet. Note this may +modify the packet a little after a period of packet loss, to blend real synthetic data smoothly. +When a real packet is not available in time, call plc_fillin() to create a sythetic substitute. +That's it! +*/ + +#define SAMPLE_RATE 8000 + +/*! Minimum allowed pitch (66 Hz) */ +#define PLC_PITCH_MIN 120 +/*! Maximum allowed pitch (200 Hz) */ +#define PLC_PITCH_MAX 40 +/*! Maximum pitch OLA window */ +#define PLC_PITCH_OVERLAP_MAX (PLC_PITCH_MIN >> 2) +/*! The length over which the AMDF function looks for similarity (20 ms) */ +#define CORRELATION_SPAN 160 +/*! History buffer length. The buffer much also be at leat 1.25 times + PLC_PITCH_MIN, but that is much smaller than the buffer needs to be for + the pitch assessment. */ +#define PLC_HISTORY_LEN (CORRELATION_SPAN + PLC_PITCH_MIN) + +typedef struct +{ + /*! Consecutive erased samples */ + int missing_samples; + /*! Current offset into pitch period */ + int pitch_offset; + /*! Pitch estimate */ + int pitch; + /*! Buffer for a cycle of speech */ + float pitchbuf[PLC_PITCH_MIN]; + /*! History buffer */ + int16_t history[PLC_HISTORY_LEN]; + /*! Current pointer into the history buffer */ + int buf_ptr; +} plc_state_t; + + +#ifdef __cplusplus +extern "C" { +#endif + +/*! Process a block of received audio samples. + \brief Process a block of received audio samples. + \param s The packet loss concealer context. + \param amp The audio sample buffer. + \param len The number of samples in the buffer. + \return The number of samples in the buffer. */ +int plc_rx(plc_state_t *s, int16_t amp[], int len); + +/*! Fill-in a block of missing audio samples. + \brief Fill-in a block of missing audio samples. + \param s The packet loss concealer context. + \param amp The audio sample buffer. + \param len The number of samples to be synthesised. + \return The number of samples synthesized. */ +int plc_fillin(plc_state_t *s, int16_t amp[], int len); + +/*! Process a block of received V.29 modem audio samples. + \brief Process a block of received V.29 modem audio samples. + \param s The packet loss concealer context. + \param amp The audio sample buffer. + \param len The number of samples in the buffer. + \return A pointer to the he packet loss concealer context. */ +plc_state_t *plc_init(plc_state_t *s); + +#ifdef __cplusplus +} +#endif + +#endif +/*- End of file ------------------------------------------------------------*/ diff --git a/3rdparty/iaxclient-2/lib/unixfuncs.c b/3rdparty/iaxclient-2/lib/unixfuncs.c new file mode 100644 index 0000000..ad50b82 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/unixfuncs.c @@ -0,0 +1,409 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#define _BSD_SOURCE +#include +#ifndef __USE_POSIX199309 +#define __USE_POSIX199309 +#endif +#include +#include "iaxclient_lib.h" + +#ifdef HAVE_CONFIG_H +# include +#endif + +#if TIME_WITH_SYS_TIME +# include +# include +#else +# ifdef HAVE_SYS_TIME_H +# include +# else +# include +# endif +#endif + +#ifndef NULL +#define NULL (0) +#endif + +/* Unix-specific functions */ + +void os_init(void) +{ +} + +void iaxc_millisleep(long ms) +{ + struct timespec req; + + req.tv_nsec = (ms%1000)*1000*1000; + req.tv_sec = ms/1000; + + /* yes, it can return early. We don't care */ + nanosleep(&req,NULL); +} + + +/* TODO: Implement for X/MacOSX? */ +int iaxci_post_event_callback(iaxc_event ev) +{ +#if 0 + iaxc_event *e; + e = malloc(sizeof(ev)); + *e = ev; + + /* XXX Test return value? */ + PostMessage(post_event_handle,post_event_id,(WPARAM) NULL, (LPARAM) e); +#endif + return 0; +} + +#ifdef MACOSX + /* Presently, OSX allows user-level processes to request RT + * priority. The API is nice, but the scheduler presently ignores + * the parameters (but the API validates that you're not asking for + * too much). See + * http://lists.apple.com/archives/darwin-development/2004/Feb/msg00079.html + */ +/* include mach stuff for declaration of thread_policy stuff */ +#include + +int iaxci_prioboostbegin() +{ + struct thread_time_constraint_policy ttcpolicy; + int params [2] = {CTL_HW,HW_BUS_FREQ}; + int hzms; + size_t sz; + int ret; + + /* get hz */ + sz = sizeof (hzms); + sysctl (params, 2, &hzms, &sz, NULL, 0); + + /* make hzms actually hz per ms */ + hzms /= 1000; + + /* give us at least how much? 6-8ms every 10ms (we generally need less) */ + ttcpolicy.period = 10 * hzms; /* 10 ms */ + ttcpolicy.computation = 2 * hzms; + ttcpolicy.constraint = 3 * hzms; + ttcpolicy.preemptible = 1; + + if ( (ret = thread_policy_set(mach_thread_self(), + THREAD_TIME_CONSTRAINT_POLICY, (int *)&ttcpolicy, + THREAD_TIME_CONSTRAINT_POLICY_COUNT)) != KERN_SUCCESS ) + { + fprintf(stderr, "thread_policy_set failed: %d.\n", ret); + } + return 0; +} + +int iaxci_prioboostend() +{ + /* TODO */ + return 0; +} + +#else + + +/* Priority boosting/monitoring: Adapted from portaudio/pa_unix.c , + * which carries the following copyright notice: + * PortAudio Portable Real-Time Audio Library + * Latest Version at: http://www.portaudio.com + * Linux OSS Implementation by douglas repetto and Phil Burk + * + * Copyright (c) 1999-2000 Phil Burk + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files + * (the "Software"), to deal in the Software without restriction, + * including without limitation the rights to use, copy, modify, merge, + * publish, distribute, sublicense, and/or sell copies of the Software, + * and to permit persons to whom the Software is furnished to do so, + * subject to the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * Any person wishing to distribute modifications to the Software is + * requested to send the modifications to the original developer so that + * they can be incorporated into the canonical version. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + */ + +/* It has been clarified by the authors that the request to send modifications + is a request, and not a condition */ + +/* Theory: + * The main thread is boosted to a medium real-time priority. + * Two additional threads are created: + * Canary: Runs as normal priority, updates a timevalue every second. + * WatchDog: Runs as a higher real-time priority. Checks to see that + * Canary is running. If Canary isn't running, lowers + * priority of calling thread, which has presumably run away + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +//#define DBUG(...) fprintf(stderr, __VA_ARGS__) +#define DBUG(...) +#define ERR_RPT(...) fprintf(stderr, __VA_ARGS__) + +#define SCHEDULER_POLICY SCHED_RR +#define WATCHDOG_INTERVAL_USEC 1000000 +#define WATCHDOG_MAX_SECONDS 3 + +typedef void *(*pthread_function_t)(void *); + +typedef struct { + int priority; + pthread_t ThreadID; + + struct timeval CanaryTime; + int CanaryRun; + pthread_t CanaryThread; + int IsCanaryThreadValid; + + int WatchDogRun; + pthread_t WatchDogThread; + int IsWatchDogThreadValid; + +} prioboost; + +static prioboost *pb; + +static int CanaryProc( prioboost *b) +{ + int result = 0; + struct sched_param schat = { 0 }; + + /* set us up with normal priority, please */ + if( pthread_setschedparam(pthread_self(), SCHED_OTHER, &schat) != 0) + return 1; + + while( b->CanaryRun) + { + usleep( WATCHDOG_INTERVAL_USEC ); + gettimeofday( &b->CanaryTime, NULL ); + } + + return result; +} + +static int WatchDogProc( prioboost *b ) +{ + struct sched_param schp = { 0 }; + int maxPri; + + /* Run at a priority level above main thread so we can still run if it hangs. */ + /* Rise more than 1 because of rumored off-by-one scheduler bugs. */ + schp.sched_priority = b->priority + 4; + maxPri = sched_get_priority_max(SCHEDULER_POLICY); + if( schp.sched_priority > maxPri ) schp.sched_priority = maxPri; + + if (pthread_setschedparam(pthread_self(), SCHEDULER_POLICY, &schp) != 0) + { + ERR_RPT("WatchDogProc: cannot set watch dog priority!\n"); + goto killAudio; + } + + DBUG("prioboost: WatchDog priority set to level %d!\n", schp.sched_priority); + + /* Compare watchdog time with audio and canary thread times. */ + /* Sleep for a while or until thread cancelled. */ + while( b->WatchDogRun ) + { + + int delta; + struct timeval currentTime; + + usleep( WATCHDOG_INTERVAL_USEC ); + gettimeofday( ¤tTime, NULL ); + +#if 0 + /* If audio thread is not advancing, then it must be hung so kill it. */ + delta = currentTime.tv_sec - b->EntryTime.tv_sec; + DBUG(("WatchDogProc: audio delta = %d\n", delta )); + if( delta > WATCHDOG_MAX_SECONDS ) + { + goto killAudio; + } +#endif + + /* If canary died, then lower audio priority and halt canary. */ + delta = currentTime.tv_sec - b->CanaryTime.tv_sec; + DBUG("WatchDogProc: dogging, delta = %ld, mysec=%d\n", delta, currentTime.tv_sec); + if( delta > WATCHDOG_MAX_SECONDS ) + { + ERR_RPT("WatchDogProc: canary died!\n"); + goto lowerAudio; + } + } + + DBUG("WatchDogProc: exiting.\n"); + return 0; + +lowerAudio: + { + struct sched_param schat = { 0 }; + if( pthread_setschedparam(b->ThreadID, SCHED_OTHER, &schat) != 0) + { + ERR_RPT("WatchDogProc: failed to lower audio priority. errno = %d\n", errno ); + /* Fall through into killing audio thread. */ + } + else + { + ERR_RPT("WatchDogProc: lowered audio priority to prevent hogging of CPU.\n"); + goto cleanup; + } + } + +killAudio: + ERR_RPT("WatchDogProc: killing hung audio thread!\n"); + //pthread_cancel( b->ThreadID); + //pthread_join( b->ThreadID); + exit(1); + +cleanup: + b->CanaryRun = 0; + DBUG("WatchDogProc: cancel Canary\n"); + pthread_cancel( b->CanaryThread ); + DBUG("WatchDogProc: join Canary\n"); + pthread_join( b->CanaryThread, NULL ); + DBUG("WatchDogProc: forget Canary\n"); + b->IsCanaryThreadValid = 0; + +#ifdef GNUSTEP + GSUnregisterCurrentThread(); /* SB20010904 */ +#endif + return 0; +} + +static void StopWatchDog( prioboost *b ) +{ + /* Cancel WatchDog thread if there is one. */ + if( b->IsWatchDogThreadValid ) + { + b->WatchDogRun = 0; + DBUG("StopWatchDog: cancel WatchDog\n"); + pthread_cancel( b->WatchDogThread ); + pthread_join( b->WatchDogThread, NULL ); + b->IsWatchDogThreadValid = 0; + } + /* Cancel Canary thread if there is one. */ + if( b->IsCanaryThreadValid ) + { + b->CanaryRun = 0; + DBUG("StopWatchDog: cancel Canary\n"); + pthread_cancel( b->CanaryThread ); + DBUG("StopWatchDog: join Canary\n"); + pthread_join( b->CanaryThread, NULL ); + b->IsCanaryThreadValid = 0; + } +} + + +static int StartWatchDog( prioboost *b) +{ + int hres; + int result = 0; + + /* The watch dog watches for these timer updates */ + gettimeofday( &b->CanaryTime, NULL ); + + /* Launch a canary thread to detect priority abuse. */ + b->CanaryRun = 1; + hres = pthread_create(&(b->CanaryThread), + NULL /*pthread_attr_t * attr*/, + (pthread_function_t)CanaryProc, b); + if( hres != 0 ) + { + b->IsCanaryThreadValid = 0; + result = 1; + goto error; + } + b->IsCanaryThreadValid = 1; + + /* Launch a watchdog thread to prevent runaway audio thread. */ + b->WatchDogRun = 1; + hres = pthread_create(&(b->WatchDogThread), + NULL /*pthread_attr_t * attr*/, + (pthread_function_t)WatchDogProc, b); + if( hres != 0 ) { + b->IsWatchDogThreadValid = 0; + result = 1; + goto error; + } + b->IsWatchDogThreadValid = 1; + return result; + +error: + StopWatchDog( b ); + return result; +} + +int iaxci_prioboostbegin() +{ + struct sched_param schp = { 0 }; + prioboost *b = calloc(sizeof(*b),1); + + int result = 0; + + b->priority = (sched_get_priority_max(SCHEDULER_POLICY) - + sched_get_priority_min(SCHEDULER_POLICY)) / 2; + schp.sched_priority = b->priority; + + b->ThreadID = pthread_self(); + + if (pthread_setschedparam(b->ThreadID, SCHEDULER_POLICY, &schp) != 0) + { + DBUG("prioboost: only superuser can use real-time priority.\n"); + } + else + { + DBUG("prioboost: priority set to level %d!\n", schp.sched_priority); /* We are running at high priority so we should have a watchdog in case audio goes wild. */ + result = StartWatchDog( b ); + } + + if(result == 0) { + pb = b; + } else { + pb = NULL; + schp.sched_priority = 0; + pthread_setschedparam(b->ThreadID, SCHED_OTHER, &schp); + } + + return result; +} + +int iaxci_prioboostend() +{ + if(pb) StopWatchDog(pb); + return 0; +} + +#endif + diff --git a/3rdparty/iaxclient-2/lib/video.c b/3rdparty/iaxclient-2/lib/video.c new file mode 100644 index 0000000..f209edd --- /dev/null +++ b/3rdparty/iaxclient-2/lib/video.c @@ -0,0 +1,1852 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2005-2006, Horizon Wimba, inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * Mihai Balea + * Peter Grayson + * Erik Bunce + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include +#include + +#include +#include + +#include "video.h" +#include "slice.h" +#include "iaxclient_lib.h" +#include "iax-client.h" +#ifdef USE_FFMPEG +#include "codec_ffmpeg.h" +#endif +#ifdef USE_THEORA +#include "codec_theora.h" +#endif + +#if defined(WIN32) +#define strdup _strdup +#endif + +struct video_info +{ + vidcap_state * vc; + vidcap_sapi * sapi; + vidcap_src * src; + struct vidcap_sapi_info sapi_info; + struct vidcap_fmt_info fmt_info; + + /* these are the requested (post-scaling) dimensions */ + int width; + int height; + + MUTEX camera_lock; + int capturing; + + char * converted_i420_buf; + int converted_i420_buf_size; + int (*convert_to_i420)(int, int, const char *, char *); + + char * converted_rgb_buf; + int converted_rgb_buf_size; + int (*convert_to_rgb32)(int, int, const char *, char *); + + char * scaled_buf; + int scaled_buf_size; + void (*scale_image)(const unsigned char *, int, int, + unsigned char *, int, int); + + int prefs; + + struct slicer_context * sc; + + /* these two struct arrays are correlated by index */ + struct vidcap_src_info * vc_src_info; + struct iaxc_video_device * devices; + MUTEX dev_list_lock; + + int device_count; + int selected_device_id; + int next_id; +}; + +struct video_format_info +{ + int width; + int height; + int framerate; + int bitrate; + int fragsize; + + /* Note that here format really means codec (thoera, h264, etc) */ + int format_preferred; + int format_allowed; +}; + +static struct video_info vinfo; + +/* TODO: This vfinfo instance is ... funny. The current semantic of + * iaxc_video_format_set() requires it to be called _prior_ to + * iaxc_initialize() which of course is where video initialize is called. + * This means that no code in this video.c module is called prior to + * iaxc_video_format_set(). This is silly, wrong, and bad. + * + * What would be better would be if iaxc_video_format_set() was called + * by clients _after_ iaxc_initialize(). The TODO here is to do the + * analysis and restructure things so that iaxc_video_format_set() and + * probably several other iaxc_*() calls do not happen until after + * iaxc_initialize(). + * + * Once that happens, these members of video_format_info can be rolled + * back into video_info and we can initialize the members in + * video_initialize(). + */ +static struct video_format_info vfinfo = +{ + 320, /* width */ + 240, /* height */ + 15, /* fps */ + 150000, /* bitrate */ + 1500, /* fragsize */ + 0, /* format preferred */ + 0, /* format allowed */ +}; + +extern int selected_call; +extern int test_mode; +extern struct iaxc_call * calls; + +/* to prevent clearing a call while in capture callback */ +extern __inline int try_iaxc_lock(); +extern __inline void put_iaxc_lock(); + +EXPORT unsigned int iaxc_get_video_prefs(void) +{ + return vinfo.prefs; +} + +static void reset_codec_stats(struct iaxc_video_codec *vcodec) +{ + if ( !vcodec ) + return; + + memset(&vcodec->video_stats, 0, sizeof(struct iaxc_video_stats)); + vcodec->video_stats.start_time = iax_tvnow(); +} + +static void reset_video_stats(struct iaxc_call * call) +{ + if ( !call ) + return; + + reset_codec_stats(call->vdecoder); + reset_codec_stats(call->vencoder); +} + +/* Collect and return video statistics. Also reset statistics if required. + * Returns a pointer to the data. + * Right now we use two different codecs for encoding and decoding. We need + * to collate information from both and wrap it into one nice struct. + */ +static int get_stats(struct iaxc_call *call, struct iaxc_video_stats *stats, + int reset) +{ + if ( !call || !stats ) + return -1; + + memset(stats, 0, sizeof(*stats)); + + if ( call->vencoder ) + { + stats->sent_slices = call->vencoder->video_stats.sent_slices; + stats->acc_sent_size = call->vencoder->video_stats.acc_sent_size; + stats->outbound_frames = call->vencoder->video_stats.outbound_frames; + stats->avg_outbound_bps = call->vencoder->video_stats.avg_outbound_bps; + stats->avg_outbound_fps = call->vencoder->video_stats.avg_outbound_fps; + } + + if ( call->vdecoder ) + { + stats->received_slices = call->vdecoder->video_stats.received_slices; + stats->acc_recv_size = call->vdecoder->video_stats.acc_recv_size; + stats->inbound_frames = call->vdecoder->video_stats.inbound_frames; + stats->dropped_frames = call->vdecoder->video_stats.dropped_frames; + stats->avg_inbound_bps = call->vdecoder->video_stats.avg_inbound_bps; + stats->avg_inbound_fps = call->vdecoder->video_stats.avg_inbound_fps; + } + + if ( reset ) + reset_video_stats(call); + + return 0; +} + +static int maybe_send_stats(struct iaxc_call * call) +{ + const long video_stats_interval = 1000; /* milliseconds */ + static struct timeval video_stats_start = {0, 0}; + iaxc_event e; + struct timeval now; + + if ( !call ) + return -1; + + if ( video_stats_start.tv_sec == 0 && video_stats_start.tv_usec == 0 ) + video_stats_start = iax_tvnow(); + + now = iax_tvnow(); + + if ( iaxci_msecdiff(&now, &video_stats_start) > video_stats_interval ) + { + get_stats(call, &e.ev.videostats.stats, 1); + e.type = IAXC_EVENT_VIDEOSTATS; + e.ev.videostats.callNo = selected_call; + iaxci_post_event(e); + + video_stats_start = now; + } + + return 0; +} + +/* TODO: The encode parameter to this function is unused within this + * function. However, clients of this function still use this parameter. + * What ends up happening is we instantiate the codec encoder/decoder + * pairs multiple times. This seems not the best. For example, it is + * not clear that all codecs are idempotent to the extent that they can + * be initialized multiple times. Furthermore, within iaxclient itself, + * we have a nasty habit of using global statically allocated data. + * Multiple codec_video_*_new calls could easily result in race + * conditions or more blatantly bad problems. + * + * Splitting encoder and decoder creation has some merit. + * + * - Avoid allocating encoder or decoder resources when not needed. + * - Allows using different codecs for sending and receiving. + * - Allows different codec parameters for sending and receiving. + * + */ +static struct iaxc_video_codec *create_codec(int format, int encode) +{ + struct iaxc_video_codec * vcodec = 0; + + iaxci_usermsg(IAXC_TEXT_TYPE_NOTICE, "Creating codec format 0x%x", + format); + + switch ( format ) + { + case IAXC_FORMAT_H261: + case IAXC_FORMAT_H263: + case IAXC_FORMAT_H263_PLUS: + case IAXC_FORMAT_MPEG4: + case IAXC_FORMAT_H264: +#ifdef USE_FFMPEG + vcodec = codec_video_ffmpeg_new(format, + vfinfo.width, + vfinfo.height, + vfinfo.framerate, + vfinfo.bitrate, + vfinfo.fragsize); +#endif + break; + + case IAXC_FORMAT_THEORA: +#ifdef USE_THEORA + vcodec = codec_video_theora_new(format, + vfinfo.width, + vfinfo.height, + vfinfo.framerate, + vfinfo.bitrate, + vfinfo.fragsize); +#endif + break; + } + + reset_codec_stats(vcodec); + + return vcodec; +} + +/* + * Returns video data to the main application using the callback mechanism. + * This function creates a dynamic copy of the video data. The memory is freed + * in iaxci_post_event. This is because the event we post may be queued and the + * frame data must live until after it is dequeued. + + \todo For encoded data, set the event format to the calls video format. + For raw data, set the format to 0. + + \todo For encoded data, set the event format to the calls video format. For raw data, set the format to 0. + */ +int show_video_frame(const char * in_buf, int in_buf_size, + int call_number, int source, int encoded, + unsigned int timestamp_ms) +{ + iaxc_event e; + char * buf = malloc(in_buf_size); + + assert(buf); + assert(source == IAXC_SOURCE_REMOTE || source == IAXC_SOURCE_LOCAL); + + memcpy(buf, in_buf, in_buf_size); + + e.type = IAXC_EVENT_VIDEO; + e.ev.video.ts = timestamp_ms; + e.ev.video.data = buf; + e.ev.video.size = in_buf_size; + e.ev.video.format = vfinfo.format_preferred; + e.ev.video.width = vinfo.width; + e.ev.video.height = vinfo.height; + e.ev.video.callNo = call_number; + e.ev.video.encoded = encoded; + e.ev.video.source = source; + + iaxci_post_event(e); + + return 0; +} + +// Resize the buffer to 25% (half resolution on both w and h ) +// No checks are made to ensure that the source dimensions are even numbers +static void quarter_rgb32(const unsigned char *src, int src_w, int src_h, + unsigned char *dst) +{ + int i; + const unsigned char * src_even = src; + const unsigned char * src_odd = src + src_w * 4; + + for ( i = 0 ; i < src_h / 2 ; i++ ) + { + int j; + for ( j = 0 ; j < src_w / 2 ; j++ ) + { + short r, g, b; + b = *src_even++; + g = *src_even++; + r = *src_even++; + ++src_even; + + b += *src_even++; + g += *src_even++; + r += *src_even++; + ++src_even; + + b += *src_odd++; + g += *src_odd++; + r += *src_odd++; + ++src_odd; + + b += *src_odd++; + g += *src_odd++; + r += *src_odd++; + ++src_odd; + + *dst++ = (unsigned char)(b >> 2); + *dst++ = (unsigned char)(g >> 2); + *dst++ = (unsigned char)(r >> 2); + *dst++ = (unsigned char)0xff; + } + src_even = src_odd; + src_odd += src_w * 4; + } +} + +// Resize the buffer to 25% (half resolution on both w and h ) +// No checks are made to ensure that the source dimensions are even numbers +static void quarter_yuy2(const unsigned char *src, int src_w, int src_h, + unsigned char *dst) +{ + int i; + const unsigned char * src_even = src; + const unsigned char * src_odd = src + src_w * 2; + + for ( i = 0 ; i < src_h / 2 ; i++ ) + { + int j; + for ( j = 0 ; j < src_w / 4 ; j++ ) + { + short y1, u, y2, v; + y1 = *src_even++; + u = *src_even++; + y1 += *src_even++; + v = *src_even++; + + y1 += *src_odd++; + u += *src_odd++; + y1 += *src_odd++; + v += *src_odd++; + + y2 = *src_even++; + u += *src_even++; + y2 += *src_even++; + v += *src_even++; + + y2 += *src_odd++; + u += *src_odd++; + y2 += *src_odd++; + v += *src_odd++; + + *dst++ = (unsigned char)(y1 >> 2); + *dst++ = (unsigned char)(u >> 2); + *dst++ = (unsigned char)(y2 >> 2); + *dst++ = (unsigned char)(v >> 2); + } + src_even = src_odd; + src_odd += src_w * 2; + } +} + +// Resize the channel to 25% (half resolution on both w and h ) +// No checks are made to ensure that the source dimensions are even numbers +static void quarter_channel(const unsigned char *src, int src_w, int src_h, + unsigned char *dst) +{ + int i; + const unsigned char * evenl = src; + const unsigned char * oddl = src + src_w; + + for ( i = 0 ; i < src_h / 2 ; i++ ) + { + int j; + for ( j = 0 ; j < src_w / 2 ; j++ ) + { + int s = *(evenl++); + s += *(evenl++); + s += *(oddl++); + s += *(oddl++); + *(dst++) = (unsigned char)(s >> 2); + } + evenl = oddl; + oddl += src_w; + } +} + +// Resize an I420 image by resizing each of the three channels. +// Destination buffer must be sufficiently large to accommodate +// the resulting image +static void resize_i420(const unsigned char *src, int src_w, int src_h, + unsigned char *dst, int dst_w, int dst_h) +{ + const unsigned char *src_u = src + src_w * src_h; + const unsigned char *src_v = src_u + src_w * src_h / 4; + unsigned char *dst_u = dst + dst_w * dst_h; + unsigned char *dst_v = dst_u + dst_w * dst_h / 4; + + // Resize each channel separately + if ( dst_w * 2 == src_w && dst_h * 2 == src_h ) + { + quarter_channel(src, src_w, src_h, dst); + quarter_channel(src_u, src_w / 2, src_h / 2, dst_u); + quarter_channel(src_v, src_w / 2, src_h / 2, dst_v); + } +/* + else if ( dst_w * 4 == src_w && dst_h * 4 == src_h ) + { + double_quarter_channel(src, src_w, src_h, dst); + double_quarter_channel(src_u, src_w / 2, src_h / 2, dst_u); + double_quarter_channel(src_v, src_w / 2, src_h / 2, dst_v); + } + else + { + resize_channel(src, src_w, src_h, dst, dst_w, dst_h); + resize_channel(src_u, src_w / 2, src_h / 2, + dst_u, dst_w / 2, dst_h / 2); + resize_channel(src_v, src_w / 2, src_h / 2, + dst_v, dst_w / 2, dst_h / 2); + } +*/ +} + +// Resize an rgb32 image +// Destination buffer must be sufficiently large to accommodate +// the resulting image +static void resize_rgb32(const unsigned char *src, int src_w, int src_h, + unsigned char *dst, int dst_w, int dst_h) +{ + if ( dst_w * 2 == src_w && dst_h * 2 == src_h ) + { + quarter_rgb32(src, src_w, src_h, dst); + } +/* + else if ( dst_w * 4 == src_w && dst_h * 4 == src_h ) + { + double_quarter_rgb32(src, src_w, src_h, dst); + } + else + { + resize_rgb32_buffer(src, src_w, src_h, dst, dst_w, dst_h); + } +*/ +} + +// Resize a yuy2 image. +// Destination buffer must be sufficiently large to accommodate +// the resulting image +static void resize_yuy2(const unsigned char *src, int src_w, int src_h, + unsigned char *dst, int dst_w, int dst_h) +{ + if ( dst_w * 2 == src_w && dst_h * 2 == src_h ) + { + quarter_yuy2(src, src_w, src_h, dst); + } +/* + else if ( dst_w * 4 == src_w && dst_h * 4 == src_h ) + { + double_quarter_yuy2(src, src_w, src_h, dst); + } + else + { + resize_yuy2_buffer(src, src_w, src_h, dst, dst_w, dst_h); + } +*/ +} + +static int video_device_notification_callback(vidcap_sapi *sapi, + void * user_context) +{ + iaxc_event evt; + + if ( sapi != vinfo.sapi ) + { + fprintf(stderr, "ERROR: wrong sapi in device notification\n"); + return -1; + } + + /* notify application that device list has been updated */ + evt.type = IAXC_EVENT_VIDCAP_DEVICE; + iaxci_post_event(evt); + + return 0; +} + +static int capture_callback(vidcap_src * src, void * user_data, + struct vidcap_capture_info * cap_info) +{ + static struct slice_set_t slice_set; + + /* The prefs may change inbetween capture callbacks, so we cannot + * precompute any of this prior to starting capture. + */ + const int send_encoded = !(vinfo.prefs & IAXC_VIDEO_PREF_SEND_DISABLE); + const int recv_local_enc = vinfo.prefs & IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED; + const int recv_local_raw = vinfo.prefs & IAXC_VIDEO_PREF_RECV_LOCAL_RAW; + const int need_encode = send_encoded || recv_local_enc; + const int local_rgb = vinfo.prefs & IAXC_VIDEO_PREF_RECV_RGB32; + + struct iaxc_call * call; + struct timeval now; + long time_delta; + + const char * rgb_buf = 0; + int rgb_buf_size = 0; + const char * i420_buf = 0; + int i420_buf_size = 0; + const char * source_buf = 0; + int source_buf_size = 0; + + iaxc_event evt; + + int i; + + if ( cap_info->error_status ) + { + fprintf(stderr, "vidcap capture error %d\n", + cap_info->error_status); + vinfo.capturing = 0; + + /* NOTE: + * We want to release now, but we're in the capture callback thread. + * vidcap_src_release() fails during capture. + * + * We'll defer the release until the end-application's main thread + * requires the release - if either iaxc_set_video_prefs(), + * iaxc_video_device_set() or video_destroy() are called. + */ + + evt.type = IAXC_EVENT_VIDCAP_ERROR; + iaxci_post_event(evt); + return -1; + } + + if ( cap_info->video_data_size < 1 ) + { + fprintf(stderr, "FYI: callback with no data\n"); + return 0; + } + + if ( vinfo.prefs & IAXC_VIDEO_PREF_CAPTURE_DISABLE ) + return 0; + + if ( vinfo.width != vinfo.fmt_info.width ) + { + vinfo.scale_image((const unsigned char *)cap_info->video_data, + vinfo.fmt_info.width, + vinfo.fmt_info.height, + (unsigned char *)vinfo.scaled_buf, + vinfo.width, + vinfo.height); + + source_buf = vinfo.scaled_buf; + source_buf_size = vinfo.scaled_buf_size; + } + else + { + source_buf = cap_info->video_data; + source_buf_size = cap_info->video_data_size; + } + + if ( vinfo.convert_to_rgb32 && recv_local_raw && local_rgb ) + { + vinfo.convert_to_rgb32( + vinfo.width, + vinfo.height, + source_buf, + vinfo.converted_rgb_buf); + + rgb_buf = vinfo.converted_rgb_buf; + rgb_buf_size = vinfo.converted_rgb_buf_size; + } + else + { + rgb_buf = source_buf; + rgb_buf_size = source_buf_size; + } + + if ( vinfo.convert_to_i420 && (need_encode || + (recv_local_raw && !local_rgb)) ) + { + vinfo.convert_to_i420( + vinfo.width, + vinfo.height, + source_buf, + vinfo.converted_i420_buf); + + i420_buf = vinfo.converted_i420_buf; + i420_buf_size = vinfo.converted_i420_buf_size; + } + else + { + i420_buf = source_buf; + i420_buf_size = source_buf_size; + } + + if ( recv_local_raw ) + { + show_video_frame(local_rgb ? rgb_buf : i420_buf, + local_rgb ? rgb_buf_size : i420_buf_size, + -1, /* local call number */ + IAXC_SOURCE_LOCAL, + 0, /* not encoded */ + 0); /* timestamp (ms) */ + } + + /* Don't block waiting for this lock. If the main thread has the lock + * for the purpose of dumping the call, it may request that video + * capture stop - which would block until this callback returned. + */ + if ( try_iaxc_lock() ) + { + /* give it a second try */ + iaxc_millisleep(5); + if ( try_iaxc_lock() ) + { + fprintf(stderr, "skipping processing of a video frame\n"); + return 0; + } + } + + if ( selected_call < 0 ) + goto callback_done; + + call = &calls[selected_call]; + + if ( !call || !(call->state & (IAXC_CALL_STATE_COMPLETE | + IAXC_CALL_STATE_OUTGOING)) ) + { + goto callback_done; + } + + if ( call->vformat == 0 ) + { + goto callback_failed; + } + + if ( !need_encode ) + { + /* Since we are neither sending out encoded video on the + * network nor to the application, we no longer need the + * codec instance. + */ + if ( call->vencoder ) + { + fprintf(stderr, "destroying codec %s\n", + call->vencoder->name); + call->vencoder->destroy(call->vencoder); + call->vencoder = 0; + } + + goto callback_done; + } + else + { + if ( call->vencoder && + (call->vencoder->format != call->vformat || + call->vencoder->params_changed) ) + { + call->vencoder->destroy(call->vencoder); + call->vencoder = 0; + } + + if ( !call->vencoder ) + { + if ( !(call->vencoder = create_codec(call->vformat, 1)) ) + { + fprintf(stderr, "ERROR: failed to create codec " + "for format 0x%08x\n", + call->vformat); + + goto callback_failed; + } + + fprintf(stderr, "created encoder codec %s\n", + call->vencoder->name); + } + + if ( call->vencoder->encode(call->vencoder, + i420_buf_size, i420_buf, + &slice_set) ) + { + fprintf(stderr, "failed to encode captured video\n"); + goto callback_failed; + } + } + + /* Gather statistics */ + call->vencoder->video_stats.outbound_frames++; + + now = iax_tvnow(); + time_delta = + iaxci_msecdiff(&now, &call->vencoder->video_stats.start_time); + + if ( time_delta > 0 ) + call->vencoder->video_stats.avg_outbound_fps = + (float)call->vencoder->video_stats.outbound_frames * + 1000.0f / (float)time_delta; + + if ( !call->session ) + { + fprintf(stderr, "not sending video to sessionless call\n"); + goto callback_failed; + } + + for ( i = 0; i < slice_set.num_slices; ++i ) + { + //Pass the encoded frame to the main app + // \todo Fix the call number + if ( vinfo.prefs & IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED ) + { + show_video_frame(slice_set.data[i], + slice_set.size[i], + -1, /* local call number */ + IAXC_SOURCE_LOCAL, + 1, /* encoded */ + 0); /* timestamp */ + } + + if ( !(vinfo.prefs & IAXC_VIDEO_PREF_SEND_DISABLE) ) + { + if ( iax_send_video_trunk(call->session, call->vformat, + slice_set.data[i], + slice_set.size[i], + 0, /* not fullframe */ + i) == -1) + { + fprintf(stderr, "failed sending slice call %d " + "size %d\n", selected_call, + slice_set.size[i]); + goto callback_failed; + } + + /* More statistics */ + call->vencoder->video_stats.sent_slices++; + call->vencoder->video_stats.acc_sent_size += + slice_set.size[i]; + if ( time_delta > 0 ) + call->vencoder->video_stats.avg_outbound_bps = + call->vencoder->video_stats.acc_sent_size * + 8000 / time_delta; + } + } + + maybe_send_stats(call); + +callback_done: + put_iaxc_lock(); + return 0; + +callback_failed: + put_iaxc_lock(); + return -1; +} + +static int prepare_for_capture() +{ + static const int fourcc_list[] = + { + VIDCAP_FOURCC_I420, + VIDCAP_FOURCC_YUY2, + VIDCAP_FOURCC_RGB32 + }; + + static const int fourcc_list_len = sizeof(fourcc_list) / sizeof(int); + static const int max_factor = 2; + int scale_factor; + int i; + + vinfo.width = vfinfo.width; + vinfo.height = vfinfo.height; + vinfo.fmt_info.fps_numerator = vfinfo.framerate; + vinfo.fmt_info.fps_denominator = 1; + + for ( scale_factor = 1; scale_factor <= max_factor; scale_factor *= 2 ) + { + vinfo.fmt_info.width = vfinfo.width * scale_factor; + vinfo.fmt_info.height = vfinfo.height * scale_factor; + + for ( i = 0; i < fourcc_list_len; ++i ) + { + vinfo.fmt_info.fourcc = fourcc_list[i]; + + if ( !vidcap_format_bind(vinfo.src, &vinfo.fmt_info) ) + break; + } + + if ( i != fourcc_list_len ) + break; + } + + if ( i == fourcc_list_len ) + { + fprintf(stderr, "failed to bind format %dx%d %f fps\n", + vinfo.fmt_info.width, + vinfo.fmt_info.height, + (float)vinfo.fmt_info.fps_numerator / + (float)vinfo.fmt_info.fps_denominator); + return -1; + } + + /* Prepare various conversion buffers */ + + if ( vinfo.converted_i420_buf ) + { + free(vinfo.converted_i420_buf); + vinfo.converted_i420_buf = 0; + } + + if ( vinfo.converted_rgb_buf ) + { + free(vinfo.converted_rgb_buf); + vinfo.converted_rgb_buf = 0; + } + + vinfo.converted_i420_buf_size = + vinfo.width * vinfo.height * 3 / 2; + + vinfo.converted_rgb_buf_size = + vinfo.width * vinfo.height * 4; + + if ( vinfo.fmt_info.fourcc != VIDCAP_FOURCC_RGB32 ) + vinfo.converted_rgb_buf = malloc(vinfo.converted_rgb_buf_size); + + if ( vinfo.fmt_info.fourcc != VIDCAP_FOURCC_I420 ) + vinfo.converted_i420_buf = malloc(vinfo.converted_i420_buf_size); + + switch ( vinfo.fmt_info.fourcc ) + { + case VIDCAP_FOURCC_RGB32: + vinfo.convert_to_i420 = vidcap_rgb32_to_i420; + vinfo.convert_to_rgb32 = 0; + vinfo.scale_image = 0; + vinfo.scaled_buf = 0; + if ( vinfo.width != vinfo.fmt_info.width ) + { + vinfo.scale_image = resize_rgb32; + vinfo.scaled_buf_size = vinfo.converted_rgb_buf_size; + vinfo.scaled_buf = malloc(vinfo.scaled_buf_size); + fprintf(stderr, "scaling rgb32 images by 1/%d\n", + scale_factor); + } + if ( !vinfo.converted_i420_buf ) + return -1; + break; + case VIDCAP_FOURCC_I420: + vinfo.convert_to_i420 = 0; + vinfo.convert_to_rgb32 = vidcap_i420_to_rgb32; + vinfo.scale_image = 0; + vinfo.scaled_buf = 0; + if ( vinfo.width != vinfo.fmt_info.width ) + { + vinfo.scale_image = resize_i420; + vinfo.scaled_buf_size = vinfo.converted_i420_buf_size; + vinfo.scaled_buf = malloc(vinfo.scaled_buf_size); + fprintf(stderr, "scaling i420 images by 1/%d\n", + scale_factor); + } + if ( !vinfo.converted_rgb_buf ) + return -1; + break; + case VIDCAP_FOURCC_YUY2: + vinfo.convert_to_i420 = vidcap_yuy2_to_i420; + vinfo.convert_to_rgb32 = vidcap_yuy2_to_rgb32; + vinfo.scale_image = 0; + vinfo.scaled_buf = 0; + if ( vinfo.width != vinfo.fmt_info.width ) + { + vinfo.scale_image = resize_yuy2; + vinfo.scaled_buf_size = vinfo.width * + vinfo.height * 2; + vinfo.scaled_buf = malloc(vinfo.scaled_buf_size); + fprintf(stderr, "scaling yuy2 images by 1/%d\n", + scale_factor); + } + if ( !vinfo.converted_rgb_buf || !vinfo.converted_i420_buf ) + return -1; + break; + default: + fprintf(stderr, "do not know how to deal with vidcap " + "fourcc '%s'\n", + vidcap_fourcc_string_get(vinfo.fmt_info.fourcc)); + return -1; + } + + if ( vinfo.scale_image && !vinfo.scaled_buf ) + return -1; + + return 0; +} + +static int ensure_acquired(int dev_id) +{ + int dev_num; + + if ( !vinfo.src ) + { + MUTEXLOCK(&vinfo.dev_list_lock); + + for ( dev_num = 0; dev_num < vinfo.device_count; dev_num++ ) + { + if ( vinfo.devices[dev_num].id == dev_id ) + break; + } + + if ( dev_num == vinfo.device_count ) + { + MUTEXUNLOCK(&vinfo.dev_list_lock); + fprintf(stderr, "invalid vidcap dev id: %d\n", dev_id); + return -1; + } + + if ( !(vinfo.src = vidcap_src_acquire(vinfo.sapi, + &vinfo.vc_src_info[dev_num])) ) + { + vinfo.src = 0; + MUTEXUNLOCK(&vinfo.dev_list_lock); + fprintf(stderr, "failed to acquire video source\n"); + return -1; + } + + fprintf(stderr, "acquired vidcap source %s (%s)\n", + vinfo.vc_src_info[dev_num].description, + vinfo.vc_src_info[dev_num].identifier); + + MUTEXUNLOCK(&vinfo.dev_list_lock); + } + + return 0; +} + +EXPORT int iaxc_set_video_prefs(unsigned int prefs) +{ + const unsigned int prefs_mask = + IAXC_VIDEO_PREF_RECV_LOCAL_RAW | + IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED | + IAXC_VIDEO_PREF_RECV_REMOTE_RAW | + IAXC_VIDEO_PREF_RECV_REMOTE_ENCODED | + IAXC_VIDEO_PREF_SEND_DISABLE | + IAXC_VIDEO_PREF_RECV_RGB32 | + IAXC_VIDEO_PREF_CAPTURE_DISABLE; + int ret; + + if ( prefs & ~prefs_mask ) + { + fprintf(stderr, "ERROR: unexpected video preference: 0x%0x\n", + prefs); + return -1; + } + + vinfo.prefs = prefs; + + if ( test_mode ) + return 0; + + /* Not sending any video and not needing any form of + * local video implies that we do not need to capture + * video. + */ + if ( prefs & IAXC_VIDEO_PREF_CAPTURE_DISABLE || + ((prefs & IAXC_VIDEO_PREF_SEND_DISABLE) && + !(prefs & IAXC_VIDEO_PREF_RECV_LOCAL_RAW) && + !(prefs & IAXC_VIDEO_PREF_RECV_LOCAL_ENCODED)) ) + { + MUTEXLOCK(&vinfo.camera_lock); + if ( vinfo.capturing && vinfo.src && + vidcap_src_capture_stop(vinfo.src) ) + { + fprintf(stderr, "failed vidcap_src_capture_stop\n"); + } + + if ( vinfo.src && vidcap_src_release(vinfo.src) ) + { + fprintf(stderr, "failed to release a video source\n"); + } + + vinfo.src = 0; + vinfo.capturing = 0; + MUTEXUNLOCK(&vinfo.camera_lock); + } + else + { + MUTEXLOCK(&vinfo.camera_lock); + if ( !vinfo.capturing ) + { + if ( vinfo.selected_device_id < 0 ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return -1; + } + + if ( ensure_acquired(vinfo.selected_device_id) ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return -1; + } + + if ( prepare_for_capture() ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return -1; + } + + if ( (ret = vidcap_src_capture_start(vinfo.src, + capture_callback, 0)) ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + fprintf(stderr, "failed to start video capture: %d\n", + ret); + return -1; + } + + vinfo.capturing = 1; + } + MUTEXUNLOCK(&vinfo.camera_lock); + } + + return 0; +} + +EXPORT void iaxc_video_format_set_cap(int preferred, int allowed) +{ + vfinfo.format_preferred = preferred; + vfinfo.format_allowed = allowed; +} + +EXPORT void iaxc_video_format_get_cap(int *preferred, int *allowed) +{ + *preferred = vfinfo.format_preferred; + *allowed = vfinfo.format_allowed; +} + +EXPORT void iaxc_video_format_set(int preferred, int allowed, int framerate, + int bitrate, int width, int height, int fs) +{ + int real_pref = 0; + int real_allowed = 0; +#ifdef USE_FFMPEG + int tmp_allowed; + int i; +#endif + + // Make sure resolution is in range + if ( width < IAXC_VIDEO_MIN_WIDTH ) + width = IAXC_VIDEO_MIN_WIDTH; + else if ( width > IAXC_VIDEO_MAX_WIDTH ) + width = IAXC_VIDEO_MAX_WIDTH; + + if ( height < IAXC_VIDEO_MIN_HEIGHT ) + height = IAXC_VIDEO_MIN_HEIGHT; + else if ( height > IAXC_VIDEO_MAX_HEIGHT ) + height = IAXC_VIDEO_MAX_HEIGHT; + + vfinfo.framerate = framerate; + vfinfo.bitrate = bitrate; + vfinfo.width = width; + vfinfo.height = height; + vfinfo.fragsize = fs; + + vfinfo.format_allowed = 0; + vfinfo.format_preferred = 0; + + if ( preferred && (preferred & ~IAXC_VIDEO_FORMAT_MASK) ) + { + fprintf(stderr, "ERROR: Preferred video format invalid.\n"); + preferred = 0; + } + + /* This check: + * 1. Check if preferred is a supported and compiled in codec. If + * not, switch to the default preferred format. + * 2. Check if allowed contains a list of all supported and compiled + * in codec. If there are some unavailable codec, remove it from + * this list. + */ + + if ( preferred & IAXC_FORMAT_THEORA ) + real_pref = IAXC_FORMAT_THEORA; + +#ifdef USE_FFMPEG + if ( codec_video_ffmpeg_check_codec(preferred) ) + real_pref = preferred; +#endif + + if ( !real_pref ) + { + /* If preferred codec is not available switch to the + * supported default codec. + */ + fprintf(stderr, "Preferred codec (0x%08x) is not available. " + "Switching to default\n", preferred); + real_pref = IAXC_FORMAT_THEORA; + } + + /* Check on allowed codecs availability */ + + if ( allowed & IAXC_FORMAT_THEORA ) + real_allowed |= IAXC_FORMAT_THEORA; + +#ifdef USE_FFMPEG + /* TODO: This codec_video_ffmpeg_check_codec stuff is bogus. We + * need a standard interface in our codec wrappers that allows us to + * (1) test if a selected codec is valid and/or (2) return the set of + * available valid codecs. With that, we should be able to come up + * with a more elegant algorithm here for determining the video codec. + */ + for ( i = 0; i <= 24; i++) + { + tmp_allowed = 1 << i; + if ( (allowed & tmp_allowed) && + codec_video_ffmpeg_check_codec(tmp_allowed) ) + real_allowed |= tmp_allowed; + } +#endif + + if ( !real_pref ) + { + fprintf(stderr, "Audio-only client!\n"); + } else + { + vfinfo.format_preferred = real_pref; + + /* + * When a client use a 'preferred' format, it can force to + * use allowed formats using a non-zero value for 'allowed' + * parameter. If it is left 0, the client will use all + * capabilities set by default in this code. + */ + if ( real_allowed ) + { + vfinfo.format_allowed = real_allowed; + } + else + { +#ifdef USE_FFMPEG + vfinfo.format_allowed |= IAXC_FORMAT_H263_PLUS + | IAXC_FORMAT_H263 + | IAXC_FORMAT_MPEG4 + | IAXC_FORMAT_H264; +#endif + vfinfo.format_allowed |= IAXC_FORMAT_THEORA; + } + } +} + +void iaxc_video_params_change(int framerate, int bitrate, int width, + int height, int fs) +{ + struct iaxc_call *call; + + /* set default video params */ + if ( framerate > 0 ) + vfinfo.framerate = framerate; + if ( bitrate > 0 ) + vfinfo.bitrate = bitrate; + if ( width > 0 ) + vfinfo.width = width; + if ( height > 0 ) + vfinfo.height = height; + if ( fs > 0 ) + vfinfo.fragsize = fs; + + if ( selected_call < 0 ) + return; + + call = &calls[selected_call]; + + if ( !call || !call->vencoder ) + return; + + call->vencoder->params_changed = 1; + + if ( framerate > 0 ) + call->vencoder->framerate = framerate; + if ( bitrate > 0 ) + call->vencoder->bitrate = bitrate; + if ( width > 0 ) + call->vencoder->width = width; + if ( height > 0 ) + call->vencoder->height = height; + if ( fs > 0 ) + call->vencoder->fragsize = fs; +} + +/* process an incoming video frame */ +int video_recv_video(struct iaxc_call *call, int sel_call, + void *encoded_video, int encoded_video_len, + unsigned int ts, int format) +{ + enum + { + max_pixels = IAXC_VIDEO_MAX_WIDTH * IAXC_VIDEO_MAX_HEIGHT, + max_yuv_buf_size = max_pixels * 3 / 2, + max_rgb_buf_size = max_pixels * 4 + }; + + static char yuv_buf[max_yuv_buf_size]; + static char rgb_buf[max_rgb_buf_size]; + + const int pixels = vfinfo.width * vfinfo.height; + const int yuv_size = pixels * 3 / 2; + const int rgb_size = pixels * 4; + + int out_size = max_yuv_buf_size; + int ret; + struct timeval now; + long time; + + if ( !call ) + return 0; + + if ( format == 0 ) + { + fprintf(stderr, "video_recv_video: Format is zero (should't happen)!\n"); + return -1; + } + + // Send the encoded frame to the main app if necessary + if ( vinfo.prefs & IAXC_VIDEO_PREF_RECV_REMOTE_ENCODED ) + { + show_video_frame((char *)encoded_video, + encoded_video_len, + -1, /* TODO: why is the callnumber -1? */ + IAXC_SOURCE_REMOTE, + 1, /* encoded */ + ts); + } + + /* destroy vdecoder if it is incorrect type */ + if ( call->vdecoder && call->vdecoder->format != format ) + { + call->vdecoder->destroy(call->vdecoder); + call->vdecoder = NULL; + } + + /* If the user does not need decoded video, then do not decode. */ + if ( !(vinfo.prefs & IAXC_VIDEO_PREF_RECV_REMOTE_RAW) ) + return 0; + + /* create decoder if necessary */ + if ( !call->vdecoder ) + { + call->vdecoder = create_codec(format, 0); + fprintf(stderr,"**** Created decoder codec %s\n",call->vdecoder->name); + } + + if ( !call->vdecoder ) + { + fprintf(stderr, "ERROR: Video codec could not be created: %d\n", + format); + return -1; + } + + /* Statistics */ + now = iax_tvnow(); + time = iaxci_msecdiff(&now, &call->vdecoder->video_stats.start_time); + call->vdecoder->video_stats.received_slices++; + call->vdecoder->video_stats.acc_recv_size += encoded_video_len; + if ( time > 0 ) + call->vdecoder->video_stats.avg_inbound_bps = + call->vdecoder->video_stats.acc_recv_size * 8000 / time; + + ret = call->vdecoder->decode(call->vdecoder, encoded_video_len, + (char *)encoded_video, &out_size, yuv_buf); + + if ( ret < 0 ) + { + fprintf(stderr, "ERROR: decode error\n"); + return -1; + } + else if ( ret > 0 ) + { + /* This indicates that a complete frame cannot yet + * be decoded. This is okay. + */ + return 0; + } + else if ( out_size != yuv_size ) + { + fprintf(stderr, "ERROR: decoder returned unexpected sized " + "frame (expected %d got %d)\n", + yuv_size, out_size); + return -1; + } + + /* Statistics */ + call->vdecoder->video_stats.inbound_frames++; + if ( time > 0 ) + call->vdecoder->video_stats.avg_inbound_fps = + call->vdecoder->video_stats.inbound_frames * + 1000.0F / time; + + if ( vinfo.prefs & IAXC_VIDEO_PREF_RECV_RGB32 ) + { + vidcap_i420_to_rgb32(vfinfo.width, vfinfo.height, + yuv_buf, rgb_buf); + + show_video_frame(rgb_buf, rgb_size, sel_call, + IAXC_SOURCE_REMOTE, 0, ts); + } + else + { + show_video_frame(yuv_buf, yuv_size, sel_call, + IAXC_SOURCE_REMOTE, 0, ts); + } + + return 0; +} + +EXPORT int iaxc_video_devices_get(struct iaxc_video_device **devs, + int *num_devs, int *id_selected) +{ + int new_device_count; + int old_device_count; + struct vidcap_src_info *new_src_list; + struct vidcap_src_info *old_src_list; + struct iaxc_video_device *new_iaxc_dev_list; + struct iaxc_video_device *old_iaxc_dev_list; + int found_selected_device = 0; + int list_changed; + int i, n; + + if ( !vinfo.sapi ) + return -1; + + /* update libvidcap's device list */ + new_device_count = vidcap_src_list_update(vinfo.sapi); + list_changed = new_device_count != vinfo.device_count; + + if ( new_device_count < 0 ) + { + fprintf(stderr, "ERROR: failed getting updated vidcap device list: %d\n", + new_device_count); + return -1; + } + + new_src_list = calloc(new_device_count, sizeof(struct vidcap_src_info)); + + if ( !new_src_list ) + { + fprintf(stderr, "ERROR: failed updated source allocation\n"); + return -1; + } + + new_iaxc_dev_list = calloc(new_device_count, + sizeof(struct iaxc_video_device)); + + if ( !new_iaxc_dev_list ) + { + free(new_src_list); + fprintf(stderr, "ERROR: failed source allocation update\n"); + return -1; + } + + /* get an updated libvidcap device list */ + if ( vidcap_src_list_get(vinfo.sapi, new_device_count, new_src_list) ) + { + fprintf(stderr, "ERROR: failed vidcap_srcList_get().\n"); + + free(new_src_list); + free(new_iaxc_dev_list); + return -1; + } + + /* build a new iaxclient video source list */ + for ( n = 0; n < new_device_count; n++ ) + { + new_iaxc_dev_list[n].name = strdup(new_src_list[n].description); + new_iaxc_dev_list[n].id_string = strdup(new_src_list[n].identifier); + + /* This device may have been here all along. + * If it has, re-assign that device id + * else assign a new id + */ + for ( i = 0; i < vinfo.device_count; i++ ) + { + /* check both the device name and its unique identifier */ + if ( !strcmp(new_iaxc_dev_list[n].name, vinfo.devices[i].name) && + !strcmp(new_iaxc_dev_list[n].id_string, + vinfo.devices[i].id_string) ) + { + new_iaxc_dev_list[n].id = vinfo.devices[i].id; + + if ( vinfo.selected_device_id == new_iaxc_dev_list[n].id ) + found_selected_device = 1; + break; + } + } + if ( i == vinfo.device_count ) + { + new_iaxc_dev_list[n].id = vinfo.next_id++; + + list_changed = 1; + } + } + + if ( !list_changed ) + { + /* Free new lists. Nothing's really changed */ + free(new_src_list); + for ( i = 0; i < new_device_count; i++ ) + { + free((void *)new_iaxc_dev_list[i].name); + free((void *)new_iaxc_dev_list[i].id_string); + } + free(new_iaxc_dev_list); + } + else + { + old_device_count = vinfo.device_count; + old_src_list = vinfo.vc_src_info; + old_iaxc_dev_list = vinfo.devices; + + /* Update iaxclient's device list info */ + /* Lock since other iaxclient funcs use these fields */ + MUTEXLOCK(&vinfo.dev_list_lock); + + vinfo.device_count = new_device_count; + vinfo.vc_src_info = new_src_list; + vinfo.devices = new_iaxc_dev_list; + + MUTEXUNLOCK(&vinfo.dev_list_lock); + + /* free old lists */ + free(old_src_list); + for ( i = 0; i < old_device_count; i++ ) + { + free((void *)old_iaxc_dev_list[i].name); + free((void *)old_iaxc_dev_list[i].id_string); + } + free(old_iaxc_dev_list); + } + + /* If we can't find the selected device, defer releasing it. + * It'll happen when we set a new device, or shutdown + */ + + if ( !found_selected_device ) + vinfo.selected_device_id = -1; + + *devs = vinfo.devices; + *num_devs = vinfo.device_count; + *id_selected = vinfo.selected_device_id; + + return list_changed; +} + +EXPORT int iaxc_video_device_set(int capture_dev_id) +{ + int ret = 0; + int dev_num = 0; + + MUTEXLOCK(&vinfo.camera_lock); + + if ( capture_dev_id == vinfo.selected_device_id ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return 0; + } + + if ( capture_dev_id < 0 ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + fprintf(stderr, "invalid video device id ( < 0 )\n"); + return -1; + } + + MUTEXLOCK(&vinfo.dev_list_lock); + + for ( dev_num = 0; dev_num < vinfo.device_count; dev_num++ ) + { + if ( vinfo.devices[dev_num].id == capture_dev_id ) + break; + } + + if ( dev_num == vinfo.device_count ) + { + MUTEXUNLOCK(&vinfo.dev_list_lock); + MUTEXUNLOCK(&vinfo.camera_lock); + fprintf(stderr, "invalid video device id: %d\n", + capture_dev_id); + return -1; + } + + vinfo.selected_device_id = capture_dev_id; + + if ( vinfo.capturing && vinfo.src && + vidcap_src_capture_stop(vinfo.src) ) + { + fprintf(stderr, "failed to stop video capture\n"); + } + + if ( vinfo.src && vidcap_src_release(vinfo.src) ) + { + fprintf(stderr, "failed to release video source\n"); + } + + vinfo.src = 0; + + MUTEXUNLOCK(&vinfo.dev_list_lock); + + if ( vinfo.capturing ) + { + if ( ensure_acquired(capture_dev_id) ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return -1; + } + + if ( prepare_for_capture() ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + return -1; + } + + if ( (ret = vidcap_src_capture_start(vinfo.src, + capture_callback, 0)) ) + { + MUTEXUNLOCK(&vinfo.camera_lock); + fprintf(stderr, "failed to restart video capture: %d\n", ret); + return -1; + } + } + + MUTEXUNLOCK(&vinfo.camera_lock); + + return 0; +} + +int video_initialize(void) +{ + int i; + const int starting_id = 50; + + memset(&vinfo, 0, sizeof(vinfo)); + + vinfo.width = vfinfo.width; + vinfo.height = vfinfo.height; + vinfo.selected_device_id = -1; + vinfo.next_id = starting_id; + + MUTEXINIT(&vinfo.camera_lock); + MUTEXINIT(&vinfo.dev_list_lock); + + if ( !(vinfo.vc = vidcap_initialize()) ) + { + fprintf(stderr, "ERROR: failed vidcap_initialize\n"); + return -1; + } + + if ( !(vinfo.sapi = vidcap_sapi_acquire(vinfo.vc, 0)) ) + { + fprintf(stderr, "ERROR: failed vidcap_sapi_acquire\n"); + goto bail; + } + + if ( vidcap_sapi_info_get(vinfo.sapi, &vinfo.sapi_info) ) + { + fprintf(stderr, "ERROR: failed vidcap_sapi_info_get\n"); + goto bail; + } + + fprintf(stderr, "using vidcap sapi %s (%s)\n", + vinfo.sapi_info.description, + vinfo.sapi_info.identifier); + + vinfo.device_count = vidcap_src_list_update(vinfo.sapi); + if ( vinfo.device_count < 0 ) + { + fprintf(stderr, + "ERROR: failed updating video capture devices list\n"); + goto bail; + } + + vinfo.vc_src_info = calloc(vinfo.device_count, + sizeof(struct vidcap_src_info)); + + if ( !vinfo.vc_src_info ) + { + fprintf(stderr, "ERROR: failed vinfo field allocations\n"); + goto bail; + } + + vinfo.devices = calloc(vinfo.device_count, + sizeof(struct iaxc_video_device)); + + if ( !vinfo.devices ) + { + fprintf(stderr, "ERROR: failed vinfo field allocation\n"); + free(vinfo.vc_src_info); + goto bail; + } + + if ( vidcap_src_list_get(vinfo.sapi, vinfo.device_count, + vinfo.vc_src_info) ) + { + fprintf(stderr, "ERROR: failed vidcap_src_list_get()\n"); + free(vinfo.vc_src_info); + free(vinfo.devices); + goto bail; + } + + /* build initial iaxclient video source list */ + for ( i = 0; i < vinfo.device_count; i++ ) + { + vinfo.devices[i].name = strdup(vinfo.vc_src_info[i].description); + vinfo.devices[i].id_string = strdup(vinfo.vc_src_info[i].identifier); + /* Let's be clear that the device id is not some + * base-zero index. Once plug-n-play is implemented, + * these ids may diverge as devices are added + * and removed. + */ + vinfo.devices[i].id = vinfo.next_id++; + } + + if ( vinfo.device_count ) + { + /* set default source - the first device */ + iaxc_video_device_set(vinfo.devices[0].id); + } + + /* setup device notification callback + * for device insertion and removal + */ + if ( vidcap_srcs_notify(vinfo.sapi, &video_device_notification_callback, 0) ) + { + fprintf(stderr, "ERROR: failed vidcap_srcs_notify()\n"); + goto late_bail; + } + + vinfo.prefs = + IAXC_VIDEO_PREF_RECV_LOCAL_RAW | + IAXC_VIDEO_PREF_RECV_REMOTE_RAW | + IAXC_VIDEO_PREF_CAPTURE_DISABLE; + + return 0; + +late_bail: + free(vinfo.vc_src_info); + + for ( i = 0; i < vinfo.device_count; i++ ) + { + free((void *)vinfo.devices[i].name); + free((void *)vinfo.devices[i].id_string); + } + + free(vinfo.devices); + +bail: + if ( vinfo.sapi ) + { + vidcap_sapi_release(vinfo.sapi); + vinfo.sapi = 0; + } + vidcap_destroy(vinfo.vc); + vinfo.vc = 0; + return -1; +} + +int video_destroy(void) +{ + int i; + + if ( !vinfo.vc ) + return -1; + + free(vinfo.vc_src_info); + for ( i = 0; i < vinfo.device_count; i++ ) + { + free((void *)vinfo.devices[i].name); + free((void *)vinfo.devices[i].id_string); + } + free(vinfo.devices); + + if ( vinfo.capturing && vinfo.src ) + vidcap_src_capture_stop(vinfo.src); + + if ( vinfo.src ) + vidcap_src_release(vinfo.src); + + vidcap_destroy(vinfo.vc); + vinfo.vc = 0; + + MUTEXDESTROY(&vinfo.camera_lock); + MUTEXDESTROY(&vinfo.dev_list_lock); + + if ( vinfo.converted_i420_buf ) + { + free(vinfo.converted_i420_buf); + vinfo.converted_i420_buf = 0; + } + + if ( vinfo.converted_rgb_buf ) + { + free(vinfo.converted_rgb_buf); + vinfo.converted_rgb_buf = 0; + } + + if ( vinfo.scaled_buf ) + { + free(vinfo.scaled_buf); + vinfo.scaled_buf = 0; + } + + return 0; +} + +void iaxc_YUV420_to_RGB32(int width, int height, const char * src, char * dst) +{ + if ( vidcap_i420_to_rgb32(width, height, src, dst) ) + iaxci_usermsg(IAXC_TEXT_TYPE_ERROR, + "failed iaxc_YUV420_to_RGB32()"); +} + +int iaxc_is_camera_working() +{ + /* This tells us how many video sources are available, so + * we are saying that the "camera is working" if there exists + * more than zero cameras. + */ + return vinfo.sapi && vidcap_src_list_update(vinfo.sapi) > 0; +} + +int video_send_stats(struct iaxc_call * call) +{ + const long video_stats_interval = 1000; /* milliseconds */ + static struct timeval video_stats_start = {0, 0}; + iaxc_event e; + struct timeval now; + + if ( !call ) + return -1; + + if ( video_stats_start.tv_sec == 0 && video_stats_start.tv_usec == 0 ) + video_stats_start = iax_tvnow(); + + now = iax_tvnow(); + + if ( iaxci_msecdiff(&now, &video_stats_start) > video_stats_interval ) + { + get_stats(call, &e.ev.videostats.stats, 1); + e.type = IAXC_EVENT_VIDEOSTATS; + e.ev.videostats.callNo = selected_call; + iaxci_post_event(e); + + video_stats_start = now; + } + + return 0; +} + +EXPORT int iaxc_push_video(void *data, unsigned int size, int fragment) +{ + struct iaxc_call *call; + + if (selected_call < 0) + return -1; + + call = &calls[selected_call]; + + if ( vinfo.prefs & IAXC_VIDEO_PREF_SEND_DISABLE ) + return 0; + + //fprintf(stderr, "iaxc_push_video: sending video size %d\n", size); + + // Fragment if needed + if ( fragment ) + { + static struct slice_set_t slice_set; + int i; + + if ( !vinfo.sc ) + vinfo.sc = create_slicer_context((unsigned short)rand(), + vfinfo.fragsize); + + slice(data, size, &slice_set, vinfo.sc); + for ( i = 0 ; i < slice_set.num_slices ; i++ ) + { + if ( iax_send_video_trunk(call->session, + call->vformat, + slice_set.data[i], + slice_set.size[i], + 0, + i + ) == -1 + ) + { + fprintf(stderr, "Failed to send a slice, call %d, size %d: %s\n", + selected_call, slice_set.size[i], iax_errstr); + return -1; + } + + } + } else + { + if ( iax_send_video_trunk(call->session, call->vformat, data, + size, 0, 0) == -1 ) + { + fprintf(stderr, "iaxc_push_video: failed to send " + "video frame of size %d on call %d: %s\n", + size, selected_call, iax_errstr); + return -1; + } + } + + return 0; +} + diff --git a/3rdparty/iaxclient-2/lib/video_portvideo.cpp b/3rdparty/iaxclient-2/lib/video_portvideo.cpp new file mode 100644 index 0000000..d67a2a3 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/video_portvideo.cpp @@ -0,0 +1,106 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003 HorizonLive.com, (c) 2004, Horizon Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + * + * Module: video_portvideo + * Purpose: Video code to provide portvideo driver support for IAX library + * Developed by: Steve Kann + * Creation Date: April 7, 2005 + * + * + */ + +#include "iaxclient_lib.h" +#include "PortVideoSDL/common/cameraEngine.h" +#include "PortVideoSDL/common/cameraTool.h" + +static cameraEngine *engine; +int running; + + +int pv_start (struct iaxc_video_driver *d ) { + if(!running) { + if(!engine->startCamera()) { + fprintf(stderr, "pv: couldn't start camera\n"); + return -1; + } + running = 1; + } + return 0; +} + +int pv_stop (struct iaxc_video_driver *d ) { + return 0; +} + +void pv_shutdown() { +} + +int pv_input(struct iaxc_video_driver *d, unsigned char **in) { + unsigned char *data = NULL; + data = engine->getFrame(); + if(!data) { + if(!engine->stillRunning()) { + fprintf(stderr, "camera disconnected\n"); + running = 0; + } + fprintf(stderr, "pv_input: no frame\n"); + return 0; + } + *in = data; + return 0; +} + +int pv_output(struct iaxc_video_driver *d, unsigned char *data) { + return 0; +} + +int pv_select_devices (struct iaxc_video_driver *d, int input, int output) { + return 0; +} + +int pv_selected_devices (struct iaxc_video_driver *d, int *input, int *output) { + return 0; +} + +int pv_destroy (struct iaxc_video_driver *d ) { + //implementme + return 0; +} + + + +/* initialize video driver */ +int pv_initialize (struct iaxc_video_driver *d, int w, int h, int framerate) { + /* setup methods */ + d->initialize = pv_initialize; + d->destroy = pv_destroy; + d->select_devices = pv_select_devices; + d->selected_devices = pv_selected_devices; + d->start = pv_start; + d->stop = pv_stop; + d->output = pv_output; + d->input = pv_input; + + engine = cameraTool::findCamera(); + if(!engine) { + fprintf(stderr, "video_portvideo: can't find camera\n"); + return -1; + } + + if(!engine->initCamera(w,h,true)) { + fprintf(stderr, "can't initialize camera"); + return -1; + } + + + return 0; +} diff --git a/3rdparty/iaxclient-2/lib/video_portvideo.h b/3rdparty/iaxclient-2/lib/video_portvideo.h new file mode 100644 index 0000000..8dbd05c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/video_portvideo.h @@ -0,0 +1,29 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003 HorizonLive.com, (c) 2004, Horizon Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ +#ifndef _VIDEO_PORTVIDEO_H +#define _VIDEO_PORTVIDEO_H + +#include "iaxclient_lib.h" + +#ifdef __cplusplus +extern "C" { +#endif + + +int pv_initialize (struct iaxc_video_driver *d, int w, int h, int framerate); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/3rdparty/iaxclient-2/lib/win/devcpp/iaxclient.dev b/3rdparty/iaxclient-2/lib/win/devcpp/iaxclient.dev new file mode 100644 index 0000000..d57cfdf --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/devcpp/iaxclient.dev @@ -0,0 +1,1369 @@ +[Project] +FileName=iaxclient.dev +Name=iaxclient +UnitCount=132 +Type=2 +Ver=1 +ObjFiles= +Includes=.;../../portaudio/include;../../portaudio/src/common;../../portaudio/pablio;../../portmixer/px_common;../../libspeex/include;../../gsm/inc;../../libiax2/src +Libs= +PrivateResource= +ResourceIncludes= +MakeIncludes= +Compiler=-DSPEEX_PREPROCESS=1_@@_-DSPEEX_EC=1_@@_-DHAVE_NOT_RESTRICT_KEYWORD_@@_-DNEWJB_@@_-DLIBIAX_@@_-DLIBVER=\"SVN-20061010\"_@@_-DPA_NO_DS_@@_-DPA_NO_ASIO_@@_ +CppCompiler= +Linker= +IsCpp=0 +Icon= +ExeOutput= +ObjectOutput= +OverrideOutput=1 +OverrideOutputName=libiaxclient.a +HostApplication= +Folders=codecs,gsm,iax2,iaxclient,portaudio,sox,speex,win32 +CommandLine= +UseCustomMakefile=0 +CustomMakefile= +IncludeVersionInfo=0 +SupportXPThemes=0 +CompilerSet=0 +CompilerSettings=0000000000000000000000 + +[VersionInfo] +Major=0 +Minor=1 +Release=1 +Build=1 +LanguageID=1033 +CharsetID=1252 +CompanyName= +FileVersion= +FileDescription=Developed using the Dev-C++ IDE +InternalName= +LegalCopyright= +LegalTrademarks= +OriginalFilename= +ProductName= +ProductVersion= +AutoIncBuildNr=0 + +[Unit1] +FileName=..\..\gsm\src\table.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit2] +FileName=..\..\gsm\src\add.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit3] +FileName=..\..\gsm\src\code.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit4] +FileName=..\..\gsm\src\debug.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit5] +FileName=..\..\gsm\src\decode.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit6] +FileName=..\..\gsm\src\gsm_create.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit7] +FileName=..\..\gsm\src\gsm_decode.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit8] +FileName=..\..\gsm\src\gsm_destroy.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit9] +FileName=..\..\gsm\src\gsm_encode.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit10] +FileName=..\..\gsm\src\gsm_explode.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit11] +FileName=..\..\gsm\src\gsm_implode.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit12] +FileName=..\..\gsm\src\gsm_option.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit13] +FileName=..\..\gsm\src\gsm_print.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit14] +FileName=..\..\gsm\src\long_term.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit15] +FileName=..\..\gsm\src\lpc.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit16] +FileName=..\..\gsm\src\preprocess.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit17] +FileName=..\..\gsm\src\rpe.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit18] +FileName=..\..\gsm\src\short_term.c +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit20] +FileName=..\..\libspeex\misc.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit22] +FileName=..\..\libspeex\modes.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit23] +FileName=..\..\libspeex\modes.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit24] +FileName=..\..\libspeex\nb_celp.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit25] +FileName=..\..\libspeex\nb_celp.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit26] +FileName=..\..\libspeex\preprocess.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit27] +FileName=..\..\libspeex\quant_lsp.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit28] +FileName=..\..\libspeex\quant_lsp.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit29] +FileName=..\..\libspeex\sb_celp.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit30] +FileName=..\..\libspeex\sb_celp.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit31] +FileName=..\..\libspeex\smallft.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit32] +FileName=..\..\libspeex\smallft.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit33] +FileName=..\..\libspeex\speex.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit34] +FileName=..\..\libspeex\speex_callbacks.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit35] +FileName=..\..\libspeex\speex_header.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit36] +FileName=..\..\libspeex\stereo.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit37] +FileName=..\..\libspeex\vbr.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit38] +FileName=..\..\libspeex\vbr.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit39] +FileName=..\..\libspeex\vq.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit40] +FileName=..\..\libspeex\vq.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit41] +FileName=..\..\libspeex\bits.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit42] +FileName=..\..\libspeex\cb_search.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit43] +FileName=..\..\libspeex\cb_search.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit44] +FileName=..\..\libspeex\exc_5_64_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit45] +FileName=..\..\libspeex\exc_5_256_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit46] +FileName=..\..\libspeex\exc_8_128_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit47] +FileName=..\..\libspeex\exc_10_16_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit48] +FileName=..\..\libspeex\exc_10_32_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit49] +FileName=..\..\libspeex\exc_20_32_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit50] +FileName=..\..\libspeex\filters.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit51] +FileName=..\..\libspeex\filters.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit52] +FileName=..\..\libspeex\gain_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit53] +FileName=..\..\libspeex\gain_table_lbr.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit54] +FileName=..\..\libspeex\hexc_10_32_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit55] +FileName=..\..\libspeex\hexc_table.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit56] +FileName=..\..\libspeex\high_lsp_tables.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit57] +FileName=..\..\libspeex\jitter.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit58] +FileName=..\..\libspeex\lbr_48k_tables.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit59] +FileName=..\..\libspeex\lpc.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit60] +FileName=..\..\libspeex\lpc.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit61] +FileName=..\..\libspeex\lsp.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit62] +FileName=..\..\libspeex\lsp.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit63] +FileName=..\..\libspeex\lsp_tables_nb.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit64] +FileName=..\..\libspeex\ltp.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit65] +FileName=..\..\libspeex\ltp.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit66] +FileName=..\..\libspeex\math_approx.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit67] +FileName=..\..\libspeex\math_approx.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit68] +FileName=..\..\winfuncs.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit70] +FileName=..\..\spandsp\plc.c +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit71] +FileName=..\..\audio_file.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit72] +FileName=..\..\audio_portaudio.c +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit73] +FileName=..\..\audio_portaudio.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit74] +FileName=..\..\audio_encode.c +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit75] +FileName=..\..\audio_encode.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit76] +FileName=..\..\audio_file.c +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit77] +FileName=..\..\codec_speex.h +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit78] +FileName=..\..\codec_ulaw.c +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit79] +FileName=..\..\codec_ulaw.h +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit80] +FileName=..\..\codec_alaw.c +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit81] +FileName=..\..\codec_alaw.h +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit82] +FileName=..\..\codec_gsm.c +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit83] +FileName=..\..\codec_gsm.h +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit84] +FileName=..\..\codec_speex.c +CompileCpp=0 +Folder=codecs +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit85] +FileName=..\..\libiax2\src\iax2-parser.h +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit86] +FileName=..\..\libiax2\src\iax.c +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit87] +FileName=..\..\libiax2\src\md5.c +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit88] +FileName=..\..\libiax2\src\md5.h +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit89] +FileName=..\..\libiax2\src\iax2-parser.c +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit90] +FileName=..\..\sox\soxcompat.c +CompileCpp=0 +Folder=sox +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit91] +FileName=..\..\sox\compand.c +CompileCpp=0 +Folder=sox +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit93] +FileName=..\..\sox\sox.h +CompileCpp=0 +Folder=sox +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit94] +FileName=..\..\libiax2\src\winpoop.h +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit95] +FileName=..\..\iaxclient_lib.c +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit96] +FileName=..\..\iaxclient_lib.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit97] +FileName=..\..\gsm\inc\config.h +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit98] +FileName=..\..\gsm\inc\unproto.h +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit99] +FileName=..\..\gsm\inc\gsm.h +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit101] +FileName=..\..\gsm\inc\proto.h +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit102] +FileName=..\..\libiax2\src\iax2.h +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit103] +FileName=..\..\libiax2\src\iax-client.h +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit104] +FileName=..\..\libiax2\src\jitterbuf.h +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit105] +FileName=..\..\libiax2\src\jitterbuf.c +CompileCpp=0 +Folder=iax2 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit106] +FileName=..\..\iaxclient.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit107] +FileName=..\..\portaudio\src\common\pa_stream.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit108] +FileName=..\..\portaudio\src\common\pa_stream.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit92] +FileName=..\..\sox\resample.c +CompileCpp=0 +Folder=sox +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit109] +FileName=..\..\portaudio\src\common\pa_trace.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit110] +FileName=..\..\portaudio\src\common\pa_trace.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit111] +FileName=..\..\portaudio\src\common\pa_types.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit100] +FileName=..\..\gsm\inc\private.h +CompileCpp=0 +Folder=gsm +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit19] +FileName=..\..\libspeex\mdf.c +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit21] +FileName=..\..\libspeex\misc.h +CompileCpp=0 +Folder=speex +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit112] +FileName=..\..\portaudio\src\common\pa_util.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit113] +FileName=..\..\portaudio\src\common\pa_allocation.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit114] +FileName=..\..\portaudio\src\common\pa_allocation.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit115] +FileName=..\..\portaudio\src\common\pa_converters.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit116] +FileName=..\..\portaudio\src\common\pa_converters.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit117] +FileName=..\..\portaudio\src\common\pa_cpuload.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit118] +FileName=..\..\portaudio\src\common\pa_cpuload.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit119] +FileName=..\..\portaudio\src\common\pa_dither.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit120] +FileName=..\..\portaudio\src\common\pa_dither.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit121] +FileName=..\..\portaudio\src\common\pa_endianness.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit122] +FileName=..\..\portaudio\src\common\pa_front.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit123] +FileName=..\..\portaudio\src\common\pa_hostapi.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit124] +FileName=..\..\portaudio\src\common\pa_process.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit125] +FileName=..\..\portaudio\src\common\pa_process.h +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit126] +FileName=..\..\portaudio\src\common\pa_skeleton.c +CompileCpp=0 +Folder=portaudio +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit127] +FileName=..\..\portaudio\src\hostapi\wmme\pa_win_wmme.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit69] +FileName=..\..\spandsp\plc.h +CompileCpp=0 +Folder=iaxclient +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit128] +FileName=..\..\portaudio\src\os\win\pa_win_hostapis.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit129] +FileName=..\..\portaudio\src\os\win\pa_win_util.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit130] +FileName=..\..\portaudio\pablio\ringbuffer.h +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit131] +FileName=..\..\portaudio\pablio\ringbuffer.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + +[Unit132] +FileName=..\..\portmixer\px_win_wmme\px_win_wmme.c +CompileCpp=0 +Folder=win32 +Compile=1 +Link=1 +Priority=1000 +OverrideBuildCmd=0 +BuildCmd= + diff --git a/3rdparty/iaxclient-2/lib/win/iaxclient.def b/3rdparty/iaxclient-2/lib/win/iaxclient.def new file mode 100644 index 0000000..bac4049 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/iaxclient.def @@ -0,0 +1,107 @@ +EXPORTS + iaxc_answer_call = iaxc_answer_call@4 @1 + iaxc_answer_call@4 @2 + iaxc_audio_devices_get = iaxc_audio_devices_get@20 @3 + iaxc_audio_devices_get@20 @4 + iaxc_audio_devices_set = iaxc_audio_devices_set@12 @5 + iaxc_audio_devices_set@12 @6 + iaxc_blind_transfer_call = iaxc_blind_transfer_call@8 @7 + iaxc_blind_transfer_call@8 @8 + iaxc_call = iaxc_call@4 @9 + iaxc_call@4 @10 + iaxc_dump_all_calls = iaxc_dump_all_calls@0 @11 + iaxc_dump_all_calls@0 @12 + iaxc_dump_call = iaxc_dump_call@0 @13 + iaxc_dump_call@0 @14 + iaxc_first_free_call = iaxc_first_free_call@0 @15 + iaxc_first_free_call@0 @16 + iaxc_free_event = iaxc_free_event@4 @17 + iaxc_free_event@4 @18 + iaxc_get_event_levels = iaxc_get_event_levels@4 @19 + iaxc_get_event_levels@4 @20 + iaxc_get_event_state = iaxc_get_event_state@4 @21 + iaxc_get_event_state@4 @22 + iaxc_get_event_text = iaxc_get_event_text@4 @23 + iaxc_get_event_text@4 @24 + iaxc_get_filters = iaxc_get_filters@0 @25 + iaxc_get_filters@0 @26 + iaxc_get_netstats = iaxc_get_netstats@16 @27 + iaxc_get_netstats@16 @28 + iaxc_initialize = iaxc_initialize@8 @29 + iaxc_initialize@8 @30 + iaxc_input_level_get = iaxc_input_level_get@0 @31 + iaxc_input_level_get@0 @32 + iaxc_input_level_set = iaxc_input_level_set@8 @33 + iaxc_input_level_set@8 @34 + iaxc_mic_boost_get = iaxc_mic_boost_get@0 @35 + iaxc_mic_boost_get@0 @36 + iaxc_mic_boost_set = iaxc_mic_boost_set@4 @37 + iaxc_mic_boost_set@4 @38 + iaxc_millisleep = iaxc_millisleep@4 @39 + iaxc_millisleep@4 @40 + iaxc_output_level_get = iaxc_output_level_get@0 @41 + iaxc_output_level_get@0 @42 + iaxc_output_level_set = iaxc_output_level_set@8 @43 + iaxc_output_level_set@8 @44 + iaxc_play_sound = iaxc_play_sound@8 @45 + iaxc_play_sound@8 @46 + iaxc_process_calls = iaxc_process_calls@0 @47 + iaxc_process_calls@0 @48 + iaxc_quelch = iaxc_quelch@8 @49 + iaxc_quelch@8 @50 + iaxc_register = iaxc_register@12 @51 + iaxc_register@12 @52 + iaxc_reject_call = iaxc_reject_call@0 @53 + iaxc_reject_call@0 @54 + iaxc_reject_call_number = iaxc_reject_call_number@4 @55 + iaxc_reject_call_number@4 @56 + iaxc_select_call = iaxc_select_call@4 @57 + iaxc_select_call@4 @58 + iaxc_selected_call = iaxc_selected_call@0 @59 + iaxc_selected_call@0 @60 + iaxc_send_busy_on_incoming_call = iaxc_send_busy_on_incoming_call@4 @61 + iaxc_send_busy_on_incoming_call@4 @62 + iaxc_send_dtmf = iaxc_send_dtmf@4 @63 + iaxc_send_dtmf@4 @64 + iaxc_send_text = iaxc_send_text@4 @65 + iaxc_send_text@4 @66 + iaxc_send_url = iaxc_send_url@8 @67 + iaxc_send_url@8 @68 + iaxc_set_audio_output = iaxc_set_audio_output@4 @69 + iaxc_set_audio_output@4 @70 + iaxc_set_callerid = iaxc_set_callerid@8 @71 + iaxc_set_callerid@8 @72 + iaxc_set_event_callback = iaxc_set_event_callback@4 @73 + iaxc_set_event_callback@4 @74 + iaxc_set_event_callpost = iaxc_set_event_callpost@8 @75 + iaxc_set_event_callpost@8 @76 + iaxc_set_files = iaxc_set_files@8 @77 + iaxc_set_files@8 @78 + iaxc_set_filters = iaxc_set_filters@4 @79 + iaxc_set_filters@4 @80 + iaxc_set_formats = iaxc_set_formats@8 @81 + iaxc_set_formats@8 @82 + iaxc_set_min_outgoing_framesize = iaxc_set_min_outgoing_framesize@4 @83 + iaxc_set_min_outgoing_framesize@4 @84 + iaxc_set_networking = iaxc_set_networking@8 @85 + iaxc_set_networking@8 @86 + iaxc_set_preferred_source_udp_port = iaxc_set_preferred_source_udp_port@4 @87 + iaxc_set_preferred_source_udp_port@4 @88 + iaxc_set_silence_threshold = iaxc_set_silence_threshold@8 @89 + iaxc_set_silence_threshold@8 @90 + iaxc_set_speex_settings = iaxc_set_speex_settings@24 @91 + iaxc_set_speex_settings@24 @92 + iaxc_shutdown = iaxc_shutdown@0 @93 + iaxc_shutdown@0 @94 + iaxc_start_processing_thread = iaxc_start_processing_thread@0 @95 + iaxc_start_processing_thread@0 @96 + iaxc_stop_processing_thread = iaxc_stop_processing_thread@0 @97 + iaxc_stop_processing_thread@0 @98 + iaxc_stop_sound = iaxc_stop_sound@4 @99 + iaxc_stop_sound@4 @100 + iaxc_unquelch = iaxc_unquelch@4 @101 + iaxc_unquelch@4 @102 + iaxc_unregister = iaxc_unregister@4 @103 + iaxc_unregister@4 @104 + iaxc_version = iaxc_version@4 @105 + iaxc_version@4 @106 diff --git a/3rdparty/iaxclient-2/lib/win/iaxclient_dll.c b/3rdparty/iaxclient-2/lib/win/iaxclient_dll.c new file mode 100644 index 0000000..4823dfe --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/iaxclient_dll.c @@ -0,0 +1,27 @@ +/* + * Copyrights: + * Copyright (C) 2006 Gatherworks.com + * + * Contributors: + * Frik Strecker + * Bill Welch + * + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +//#define INITGUID +//#include +#include + +BOOL APIENTRY DllMain( + HANDLE hModule, + DWORD ul_reason_for_call, + LPVOID lpReserved) +{ + return TRUE; +} + +/* #EOF# */ + diff --git a/3rdparty/iaxclient-2/lib/win/iaxclient_dll.def b/3rdparty/iaxclient-2/lib/win/iaxclient_dll.def new file mode 100644 index 0000000..80a715d --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/iaxclient_dll.def @@ -0,0 +1,57 @@ +EXPORTS + iaxc_answer_call + iaxc_audio_devices_get + iaxc_audio_devices_set +; iaxc_auto_call + iaxc_blind_transfer_call + iaxc_call + iaxc_dump_all_calls + iaxc_dump_call + iaxc_first_free_call + iaxc_free_event + iaxc_get_event_levels + iaxc_get_event_state + iaxc_get_event_text + iaxc_get_filters + iaxc_get_netstats + iaxc_initialize +; iaxc_initialize_sock + iaxc_input_level_get + iaxc_input_level_set + iaxc_mic_boost_get + iaxc_mic_boost_set + iaxc_millisleep + iaxc_output_level_get + iaxc_output_level_set + iaxc_play_sound + iaxc_process_calls + iaxc_quelch + iaxc_register + iaxc_reject_call + iaxc_reject_call_number + iaxc_select_call + iaxc_selected_call + iaxc_send_busy_on_incoming_call + iaxc_send_dtmf + iaxc_send_text + iaxc_send_url + iaxc_set_audio_output + iaxc_set_callerid + iaxc_set_event_callback + iaxc_set_event_callpost + iaxc_set_files + iaxc_set_filters + iaxc_set_formats + iaxc_set_min_outgoing_framesize + iaxc_set_networking + iaxc_set_preferred_source_udp_port + iaxc_set_silence_threshold + iaxc_set_speex_settings + iaxc_shutdown + iaxc_start_processing_thread + iaxc_stop_processing_thread + iaxc_stop_sound + iaxc_unquelch + iaxc_unregister + iaxc_version +; setup_jb_output diff --git a/3rdparty/iaxclient-2/lib/win/vc6/all.dsp b/3rdparty/iaxclient-2/lib/win/vc6/all.dsp new file mode 100644 index 0000000..2358823 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vc6/all.dsp @@ -0,0 +1,63 @@ +# Microsoft Developer Studio Project File - Name="all" - Package Owner=<4> +# Microsoft Developer Studio Generated Build File, Format Version 6.00 +# ** DO NOT EDIT ** + +# TARGTYPE "Win32 (x86) Generic Project" 0x010a + +CFG=all - Win32 Debug +!MESSAGE This is not a valid makefile. To build this project using NMAKE, +!MESSAGE use the Export Makefile command and run +!MESSAGE +!MESSAGE NMAKE /f "all.mak". +!MESSAGE +!MESSAGE You can specify a configuration when running NMAKE +!MESSAGE by defining the macro CFG on the command line. For example: +!MESSAGE +!MESSAGE NMAKE /f "all.mak" CFG="all - Win32 Debug" +!MESSAGE +!MESSAGE Possible choices for configuration are: +!MESSAGE +!MESSAGE "all - Win32 Release" (based on "Win32 (x86) Generic Project") +!MESSAGE "all - Win32 Debug" (based on "Win32 (x86) Generic Project") +!MESSAGE + +# Begin Project +# PROP AllowPerConfigDependencies 0 +# PROP Scc_ProjName "" +# PROP Scc_LocalPath "" +MTL=midl.exe + +!IF "$(CFG)" == "all - Win32 Release" + +# PROP BASE Use_MFC 0 +# PROP BASE Use_Debug_Libraries 0 +# PROP BASE Output_Dir "Release" +# PROP BASE Intermediate_Dir "Release" +# PROP BASE Target_Dir "" +# PROP Use_MFC 0 +# PROP Use_Debug_Libraries 0 +# PROP Output_Dir "Release" +# PROP Intermediate_Dir "Release" +# PROP Target_Dir "" + +!ELSEIF "$(CFG)" == "all - Win32 Debug" + +# PROP BASE Use_MFC 0 +# PROP BASE Use_Debug_Libraries 1 +# PROP BASE Output_Dir "Debug" +# PROP BASE Intermediate_Dir "Debug" +# PROP BASE Target_Dir "" +# PROP Use_MFC 0 +# PROP Use_Debug_Libraries 1 +# PROP Output_Dir "Debug" +# PROP Intermediate_Dir "Debug" +# PROP Target_Dir "" + +!ENDIF + +# Begin Target + +# Name "all - Win32 Release" +# Name "all - Win32 Debug" +# End Target +# End Project diff --git a/3rdparty/iaxclient-2/lib/win/vc6/iaxclient_lib.dsw b/3rdparty/iaxclient-2/lib/win/vc6/iaxclient_lib.dsw new file mode 100644 index 0000000..6a94f6f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vc6/iaxclient_lib.dsw @@ -0,0 +1,59 @@ +Microsoft Developer Studio Workspace File, Format Version 6.00 +# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! + +############################################################################### + +Project: "all"=.\all.dsp - Package Owner=<4> + +Package=<5> +{{{ +}}} + +Package=<4> +{{{ + Begin Project Dependency + Project_Dep_Name iaxclient_dll + End Project Dependency + Begin Project Dependency + Project_Dep_Name iaxclient_lib + End Project Dependency +}}} + +############################################################################### + +Project: "iaxclient_dll"=.\iaxclient_dll.dsp - Package Owner=<4> + +Package=<5> +{{{ +}}} + +Package=<4> +{{{ +}}} + +############################################################################### + +Project: "iaxclient_lib"=.\iaxclient_lib.dsp - Package Owner=<4> + +Package=<5> +{{{ +}}} + +Package=<4> +{{{ +}}} + +############################################################################### + +Global: + +Package=<5> +{{{ +}}} + +Package=<3> +{{{ +}}} + +############################################################################### + diff --git a/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_dll.vcproj b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_dll.vcproj new file mode 100644 index 0000000..7e4eb3c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_dll.vcproj @@ -0,0 +1,678 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.sln b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.sln new file mode 100644 index 0000000..028446c --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.sln @@ -0,0 +1,29 @@ +Microsoft Visual Studio Solution File, Format Version 8.00 +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "iaxclient_dll", "iaxclient_dll.vcproj", "{00920B8E-2080-45AB-8742-6499B262FB7E}" + ProjectSection(ProjectDependencies) = postProject + EndProjectSection +EndProject +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "iaxclient_lib", "iaxclient_lib.vcproj", "{EA324E13-9C5F-4AF3-9DE8-9360628DB3B0}" + ProjectSection(ProjectDependencies) = postProject + EndProjectSection +EndProject +Global + GlobalSection(SolutionConfiguration) = preSolution + Debug = Debug + Release = Release + EndGlobalSection + GlobalSection(ProjectConfiguration) = postSolution + {00920B8E-2080-45AB-8742-6499B262FB7E}.Debug.ActiveCfg = Debug|Win32 + {00920B8E-2080-45AB-8742-6499B262FB7E}.Debug.Build.0 = Debug|Win32 + {00920B8E-2080-45AB-8742-6499B262FB7E}.Release.ActiveCfg = Release|Win32 + {00920B8E-2080-45AB-8742-6499B262FB7E}.Release.Build.0 = Release|Win32 + {EA324E13-9C5F-4AF3-9DE8-9360628DB3B0}.Debug.ActiveCfg = Debug|Win32 + {EA324E13-9C5F-4AF3-9DE8-9360628DB3B0}.Debug.Build.0 = Debug|Win32 + {EA324E13-9C5F-4AF3-9DE8-9360628DB3B0}.Release.ActiveCfg = Release|Win32 + {EA324E13-9C5F-4AF3-9DE8-9360628DB3B0}.Release.Build.0 = Release|Win32 + EndGlobalSection + GlobalSection(ExtensibilityGlobals) = postSolution + EndGlobalSection + GlobalSection(ExtensibilityAddIns) = postSolution + EndGlobalSection +EndGlobal diff --git a/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.vcproj b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.vcproj new file mode 100644 index 0000000..4ff881f --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2003/iaxclient_lib.vcproj @@ -0,0 +1,528 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_dll.vcproj b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_dll.vcproj new file mode 100644 index 0000000..74e0df5 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_dll.vcproj @@ -0,0 +1,744 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.sln b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.sln new file mode 100644 index 0000000..1d271e1 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.sln @@ -0,0 +1,26 @@ + +Microsoft Visual Studio Solution File, Format Version 9.00 +# Visual Studio 2005 +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "iaxclient_lib", "iaxclient_lib.vcproj", "{4AF56BD0-9FB7-435B-99F2-8582FEAC8137}" +EndProject +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "iaxclient_dll", "iaxclient_dll.vcproj", "{334F0D70-5086-4180-8325-2B77FA845C13}" +EndProject +Global + GlobalSection(SolutionConfigurationPlatforms) = preSolution + Debug|Win32 = Debug|Win32 + Release|Win32 = Release|Win32 + EndGlobalSection + GlobalSection(ProjectConfigurationPlatforms) = postSolution + {4AF56BD0-9FB7-435B-99F2-8582FEAC8137}.Debug|Win32.ActiveCfg = Debug|Win32 + {4AF56BD0-9FB7-435B-99F2-8582FEAC8137}.Debug|Win32.Build.0 = Debug|Win32 + {4AF56BD0-9FB7-435B-99F2-8582FEAC8137}.Release|Win32.ActiveCfg = Release|Win32 + {4AF56BD0-9FB7-435B-99F2-8582FEAC8137}.Release|Win32.Build.0 = Release|Win32 + {334F0D70-5086-4180-8325-2B77FA845C13}.Debug|Win32.ActiveCfg = Debug|Win32 + {334F0D70-5086-4180-8325-2B77FA845C13}.Debug|Win32.Build.0 = Debug|Win32 + {334F0D70-5086-4180-8325-2B77FA845C13}.Release|Win32.ActiveCfg = Release|Win32 + {334F0D70-5086-4180-8325-2B77FA845C13}.Release|Win32.Build.0 = Release|Win32 + EndGlobalSection + GlobalSection(SolutionProperties) = preSolution + HideSolutionNode = FALSE + EndGlobalSection +EndGlobal diff --git a/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.vcproj b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.vcproj new file mode 100644 index 0000000..579cdb8 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/win/vs2005/iaxclient_lib.vcproj @@ -0,0 +1,701 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/3rdparty/iaxclient-2/lib/wince/inttypes.h b/3rdparty/iaxclient-2/lib/wince/inttypes.h new file mode 100644 index 0000000..1aea1c0 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/wince/inttypes.h @@ -0,0 +1,208 @@ +/* A basic inttypes.h, for platforms which lack their own. Take care that it + suits the integer lengths of the tools with which it is used. */ + +#ifndef _INTTYPES_H +#define _INTTYPES_H + +/* + * ISO C99: 7.18 Integer types + */ +#ifndef __int8_t_defined +#define __int8_t_defined +typedef signed char int8_t; +typedef short int int16_t; +typedef long int int32_t; +#if defined(__GNUC__) +__extension__ typedef long long int int64_t; +#endif + +typedef unsigned char uint8_t; +typedef unsigned short int uint16_t; +typedef unsigned long int uint32_t; +#if defined(__GNUC__) +__extension__ typedef unsigned long long int uint64_t; +#endif +#endif + +/* Small types. */ + +/* Signed. */ +typedef signed char int_least8_t; +typedef short int int_least16_t; +typedef long int int_least32_t; +#if defined(__GNUC__) +__extension__ typedef long long int int_least64_t; +#endif + +/* Unsigned. */ +typedef unsigned char uint_least8_t; +typedef unsigned short int uint_least16_t; +typedef unsigned long int uint_least32_t; +#if defined(__GNUC__) +__extension__ typedef unsigned long long int uint_least64_t; +#endif + + +/* Fast types. */ + +/* Signed. */ +typedef signed char int_fast8_t; +typedef short int int_fast16_t; +typedef long int int_fast32_t; +#if defined(__GNUC__) +__extension__ typedef long long int int_fast64_t; +#endif + +/* Unsigned. */ +typedef unsigned char uint_fast8_t; +typedef unsigned int uint_fast16_t; +typedef unsigned long int uint_fast32_t; +#if defined(__GNUC__) +__extension__ typedef unsigned long long int uint_fast64_t; +#endif + + +/* Types for `void *' pointers. */ +#ifndef __intptr_t_defined +#define __intptr_t_defined +typedef int intptr_t; +typedef unsigned int uintptr_t; +#endif + + +/* Largest integral types. */ +#if defined(__GNUC__) +__extension__ typedef long long int intmax_t; +__extension__ typedef unsigned long long int uintmax_t; +#endif + + +/* The ISO C99 standard specifies that in C++ implementations these + macros should only be defined if explicitly requested. */ +#if !defined __cplusplus || defined __STDC_LIMIT_MACROS + +#define __INT64_C(c) c ## LL +#define __UINT64_C(c) c ## ULL + +/* Limits of integral types. */ + +/* Minimum of signed integral types. */ +#define INT8_MIN (-128) +#define INT16_MIN (-32767-1) +#define INT32_MIN (-2147483647-1) +#define INT64_MIN (-__INT64_C(9223372036854775807)-1) +/* Maximum of signed integral types. */ +#define INT8_MAX (127) +#define INT16_MAX (32767) +#define INT32_MAX (2147483647) +#define INT64_MAX (__INT64_C(9223372036854775807)) + +/* Maximum of unsigned integral types. */ +#define UINT8_MAX (255) +#define UINT16_MAX (65535) +#define UINT32_MAX (4294967295U) +#define UINT64_MAX (__UINT64_C(18446744073709551615)) + + +/* Minimum of signed integral types having a minimum size. */ +#define INT_LEAST8_MIN (-128) +#define INT_LEAST16_MIN (-32767-1) +#define INT_LEAST32_MIN (-2147483647-1) +#define INT_LEAST64_MIN (-__INT64_C(9223372036854775807)-1) +/* Maximum of signed integral types having a minimum size. */ +#define INT_LEAST8_MAX (127) +#define INT_LEAST16_MAX (32767) +#define INT_LEAST32_MAX (2147483647) +#define INT_LEAST64_MAX (__INT64_C(9223372036854775807)) + +/* Maximum of unsigned integral types having a minimum size. */ +#define UINT_LEAST8_MAX (255) +#define UINT_LEAST16_MAX (65535) +#define UINT_LEAST32_MAX (4294967295U) +#define UINT_LEAST64_MAX (__UINT64_C(18446744073709551615)) + + +/* Minimum of fast signed integral types having a minimum size. */ +#define INT_FAST8_MIN (-128) +#define INT_FAST16_MIN (-32768) +#define INT_FAST32_MIN (-2147483647-1) +#define INT_FAST64_MIN (-__INT64_C(9223372036854775807)-1) +/* Maximum of fast signed integral types having a minimum size. */ +#define INT_FAST8_MAX (127) +#define INT_FAST16_MAX (32767) +#define INT_FAST32_MAX (2147483647) +#define INT_FAST64_MAX (__INT64_C(9223372036854775807)) + +/* Maximum of fast unsigned integral types having a minimum size. */ +#define UINT_FAST8_MAX (255U) +#define UINT_FAST16_MAX (65535U) +#define UINT_FAST32_MAX (4294967295UL) +#define UINT_FAST64_MAX (__UINT64_C(18446744073709551615)) + + +/* Values to test for integral types holding `void *' pointer. */ +#define INTPTR_MIN (-32768) +#define INTPTR_MAX (32767) +#define UINTPTR_MAX (65535U) + + +/* Minimum for largest signed integral type. */ +#define INTMAX_MIN (-__INT64_C(9223372036854775807)-1) +/* Maximum for largest signed integral type. */ +#define INTMAX_MAX (__INT64_C(9223372036854775807)) + +/* Maximum for largest unsigned integral type. */ +#define UINTMAX_MAX (__UINT64_C(18446744073709551615)) + + +/* Limits of other integer types. */ + +/* Limits of `ptrdiff_t' type. */ +#define PTRDIFF_MIN (-32768) +#define PTRDIFF_MAX (32767) + +/* Limits of `sig_atomic_t'. */ +#define SIG_ATOMIC_MIN (-32768) +#define SIG_ATOMIC_MAX (32767) + +/* Limit of `size_t' type. */ +#ifndef SIZE_MAX +#define SIZE_MAX (65535U) +#endif + +/* Limits of `wchar_t'. */ +#ifndef WCHAR_MIN +/* These constants might also be defined in . */ +#define WCHAR_MIN __WCHAR_MIN +#define WCHAR_MAX __WCHAR_MAX +#endif + +/* Limits of `wint_t'. */ +#define WINT_MIN (0U) +#define WINT_MAX (65535U) + +#endif /* C++ && limit macros */ + + +/* The ISO C99 standard specifies that in C++ implementations these + should only be defined if explicitly requested. */ +#if !defined __cplusplus || defined __STDC_CONSTANT_MACROS + +/* Signed. */ +#define INT8_C(c) c +#define INT16_C(c) c +#define INT32_C(c) c +#define INT64_C(c) c ## LL + +/* Unsigned. */ +#define UINT8_C(c) c ## U +#define UINT16_C(c) c ## U +#define UINT32_C(c) c ## U +#define UINT64_C(c) c ## ULL + +/* Maximal type. */ +#define INTMAX_C(c) c ## LL +#define UINTMAX_C(c) c ## ULL + +#endif /* C++ && constant macros */ +#endif diff --git a/3rdparty/iaxclient-2/lib/winfuncs.c b/3rdparty/iaxclient-2/lib/winfuncs.c new file mode 100644 index 0000000..af15af7 --- /dev/null +++ b/3rdparty/iaxclient-2/lib/winfuncs.c @@ -0,0 +1,60 @@ +/* + * iaxclient: a cross-platform IAX softphone library + * + * Copyrights: + * Copyright (C) 2003-2006, Horizon Wimba, Inc. + * Copyright (C) 2007, Wimba, Inc. + * + * Contributors: + * Steve Kann + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License. + */ + +#include "winpoop.h" // include winsock2.h, windows.h, stdio.h, io.h +#include "iaxclient_lib.h" + +void os_init(void) +{ + WSADATA wsd; + + if(WSAStartup(0x0101,&wsd)) + { // Error message? + exit(1); + } +} + +/* yes, it could have just been a #define, but that makes linking trickier */ +EXPORT void iaxc_millisleep(long ms) +{ + Sleep(ms); +} + +int iaxci_post_event_callback(iaxc_event ev) { + iaxc_event *e; + e = (iaxc_event *)malloc(sizeof(ev)); + *e = ev; + + if (!PostMessage((HWND)post_event_handle,post_event_id,(WPARAM) NULL, (LPARAM) e)) + free(e); + return 0; +} + +/* Increasing the Thread Priority. See + * http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dllproc/base/scheduling_priorities.asp + * for discussion on Win32 scheduling priorities. + */ + +int iaxci_prioboostbegin() { + if ( !SetThreadPriority(GetCurrentThread(),THREAD_PRIORITY_TIME_CRITICAL) ) { + fprintf(stderr, "SetThreadPriority failed: %ld.\n", GetLastError()); + } + return 0; +} + +int iaxci_prioboostend() { + /* TODO */ + return 0; +} + diff --git a/3rdparty/iaxclient-2/simpleclient/Makefile b/3rdparty/iaxclient-2/simpleclient/Makefile new file mode 100644 index 0000000..45a1f86 --- /dev/null +++ b/3rdparty/iaxclient-2/simpleclient/Makefile @@ -0,0 +1,5 @@ +CC=gcc +CFLAGS=-Wall -I ../lib + +iaxvoipclient: iaxvoipclient.c + $(CC) $(CFLAGS) iaxvoipclient.c ../build/libiaxclient_lib.a -lm -pthread -lasound -o iaxvoipclient diff --git a/3rdparty/iaxclient-2/simpleclient/iaxvoipclient.c b/3rdparty/iaxclient-2/simpleclient/iaxvoipclient.c new file mode 100644 index 0000000..38c256c --- /dev/null +++ b/3rdparty/iaxclient-2/simpleclient/iaxvoipclient.c @@ -0,0 +1,334 @@ +/* + * testcall: make a single test call with IAXCLIENT + * + * IAX Support for talking to Asterisk and other Gnophone clients + * + * Copyright (C) 1999, Linux Support Services, Inc. + * + * Mark Spencer + * + * This program is free software, distributed under the terms of + * the GNU Lesser (Library) General Public License + */ + +/* #define PRINTCHUCK /\* enable this to indicate chucked incomming packets *\/ */ + +#include +#include +#include +#include +#include +#include +#include +#ifndef _MSC_VER +#include +#endif +#include + +#include "iaxclient.h" + +#define LEVEL_INCREMENT 0.10f + +/* static int answered_call; */ +static char *output_filename = NULL; +static char *username = NULL; +static char *password = NULL; +static char *host = NULL; +int do_levels = 0; +int intercom = 0; +int initialized = 0; +int reg_id = 0; + +/* routine called at exit to shutdown audio I/O and close nicely. +NOTE: If all this isnt done, the system doesnt not handle this +cleanly and has to be rebooted. What a pile of doo doo!! */ +void killem(void) +{ + if (initialized) + iaxc_shutdown(); + if (reg_id){ + iaxc_unregister(reg_id); + } + return; +} + +void signal_handler(int signum) +{ + if ( signum == SIGTERM || signum == SIGINT ) + { + killem(); + exit(0); + } +} + +void fatal_error(char *err) { + killem(); + fprintf(stderr, "FATAL ERROR: %s\n", err); + exit(1); +} + +void mysleep(void) +{ + iaxc_millisleep(10); +} + +int state_event_callback(struct iaxc_ev_call_state call){ + if((call.state & IAXC_CALL_STATE_RINGING)) + { + printf("Receiving Incoming Call Request...\n"); + if ( intercom ) + { + printf("Intercom mode, answer automatically\n"); + return iaxc_select_call(call.callNo); + } + } + return 0; +} +int levels_callback(float input, float output) { + if(do_levels) fprintf(stderr, "IN: %f OUT: %f\n", input, output); + return 0; +} + +int netstat_callback(struct iaxc_ev_netstats n) { + static int i; + if(i++%25 == 0) + fprintf(stderr, "RTT\t" + "Rjit\tRlos%%\tRlosC\tRpkts\tRdel\tRdrop\tRooo\t" + "Ljit\tLlos%%\tLlosC\tLpkts\tLdel\tLdrop\tLooo\n" + ); + + fprintf(stderr, "%d\t" + "%d\t%d\t%d\t%d\t%d\t%d\t%d\t" + "%d\t%d\t%d\t%d\t%d\t%d\t%d\n", + + n.rtt, + + n.remote.jitter, + n.remote.losspct, + n.remote.losscnt, + n.remote.packets, + n.remote.delay, + n.remote.dropped, + n.remote.ooo, + + n.local.jitter, + n.local.losspct, + n.local.losscnt, + n.local.packets, + n.local.delay, + n.local.dropped, + n.local.ooo + ); + + return 0; +} + +int iaxc_callback(iaxc_event e) +{ + switch(e.type) { + case IAXC_EVENT_LEVELS: + return levels_callback(e.ev.levels.input, e.ev.levels.output); + case IAXC_EVENT_NETSTAT: + return netstat_callback(e.ev.netstats); + case IAXC_EVENT_TEXT: + return 0; // don't handle + case IAXC_EVENT_STATE: + return state_event_callback(e.ev.call); + default: + return 0; // not handled + } +} + +void list_devices() +{ + struct iaxc_audio_device *devs; + int nDevs, input, output, ring; + int i; + + iaxc_audio_devices_get(&devs,&nDevs, &input, &output, &ring); + for(i=0;i= argc) usage(); + silence_threshold = (float)atof(argv[++i]); + break; + case 'u': + if(i+1 >= argc) usage(); + username = argv[++i]; + break; + case 'p': + if(i+1 >= argc) usage(); + password = argv[++i]; + break; + case 'h': + if(i+1 >= argc) usage(); + host = argv[++i]; + break; + + default: + usage(); + } + } else { + dest=argv[i]; + } + } + + + printf("settings: \n"); + printf("\tsilence threshold: %f\n", silence_threshold); + printf("\tlevel output: %s\n", do_levels ? "on" : "off"); + + /* activate the exit handler */ + atexit(killem); + + /* install signal handler to catch CRTL-Cs */ + signal(SIGINT, signal_handler); + signal(SIGTERM, signal_handler); + + if ( iaxc_initialize(1) ) fatal_error("cannot initialize iaxclient!"); + initialized = 1; + +// iaxc_set_formats(IAXC_FORMAT_SPEEX,IAXC_FORMAT_ULAW|IAXC_FORMAT_GSM|IAXC_FORMAT_SPEEX); +// iaxc_set_formats(IAXC_FORMAT_SPEEX,IAXC_FORMAT_SPEEX); +// iaxc_set_formats(IAXC_FORMAT_GSM,IAXC_FORMAT_GSM); +// iaxc_set_formats(IAXC_FORMAT_ULAW,IAXC_FORMAT_ULAW); + iaxc_set_formats(IAXC_FORMAT_ULAW,IAXC_FORMAT_ULAW|IAXC_FORMAT_GSM|IAXC_FORMAT_SPEEX); + iaxc_set_silence_threshold(silence_threshold); + + list_devices(); + + //if(do_levels) + iaxc_set_event_callback(iaxc_callback); + + + fprintf(f, "\n\ + TestCall accept some keyboard input while it's running.\n\ + You must hit 'enter' for your keypresses to be recognized,\n\ + although you can type more than one key on a line\n\ +\n\ + q: hangup and exit.\n\ + a: answer incoming call\n\ + t: terminate call\n\ + 0-9 * or #: dial those DTMF digits.\n\ + g: increase input level\n\ + b: decrease input level\n\ + h: increase output level\n\ + n: decrease output level\n\ + Enter: display current audio levels\n"); + if(dest) { + fprintf(f, "Calling %s\n", dest); + + iaxc_call(dest); + } + + iaxc_start_processing_thread(); + + if (username && password && host) + reg_id = iaxc_register(username, password, host); + + printf("ready for keyboard input\n"); + + if(output_filename) { + for(;;) + iaxc_millisleep(10*1000); + } + while((c = getc(stdin))) + { + switch (tolower(c)) + { + case 'a': + printf("Answering call 0\n"); + iaxc_select_call(0); + break; + case 'g': + level = iaxc_input_level_get(); + level += LEVEL_INCREMENT; + if ( level > 1.00 ) level = 1.00; + printf("Increasing input level to %f\n", level); + iaxc_input_level_set(level); + break; + case 'b': + level = iaxc_input_level_get(); + level -= LEVEL_INCREMENT; + if ( level < 0 ) level = 0.00; + printf("Decreasing input level to %f\n", level); + iaxc_input_level_set(level); + break; + case 'h': + level = iaxc_output_level_get(); + level += LEVEL_INCREMENT; + if ( level > 1.00 ) level = 1.00; + printf("Increasing output level to %f\n", level); + iaxc_output_level_set(level); + break; + case 'n': + level = iaxc_output_level_get(); + level -= LEVEL_INCREMENT; + if ( level < 0 ) level = 0.00; + printf("Decreasing output level to %f\n", level); + iaxc_output_level_set(level); + break; + case 'q': + printf("Hanging up and exiting\n"); + iaxc_dump_call(); + iaxc_millisleep(1000); + iaxc_stop_processing_thread(); + exit(0); + break; + case 't': + printf("Terminating call 0\n"); + iaxc_dump_call(); + break; + case '1': case '2': case '3': case '4': case '5': + case '6': case '7': case '8': case '9': case '0': + case '#': case '*': + printf ("sending %c\n", c); + iaxc_send_dtmf(c); + break; + case '\r': + break; + case '\n': + printf("Input level = %f -- Output level = %f\n", iaxc_input_level_get(), iaxc_output_level_get()); + break; + default: + printf("Unknown command '%c'\n", c); + } + } + + return 0; +}