mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-13 13:50:40 +01:00
3111783aa1
Prior to this commit, most .c files in modules/audio_coding/codecs/ilbc don't include their corresponding headers, nor do they order #includes as per the Google Style Guide [1]. The former is especially harmful, since in C it can silently allow the function signature to diverge from its prototype, thus causing disaster at runtime. This CL fixes both issues. In effect, this allows the common_audio and modules/audio_coding:ilbc targets to be compiled with Clang's -Wmissing-prototypes, though this CL does not add that change. [1]: https://google.github.io/styleguide/cppguide.html#Names_and_Order_of_Includes Bug: webrtc:12314 Change-Id: I8299968ed3cc86ff35d9de045072b846298043af Reviewed-on: https://webrtc-review.googlesource.com/c/src/+/198362 Reviewed-by: Henrik Lundin <henrik.lundin@webrtc.org> Commit-Queue: Timothy Gu <timothygu@chromium.org> Cr-Commit-Position: refs/heads/master@{#32896}
46 lines
1.4 KiB
C
46 lines
1.4 KiB
C
/*
|
|
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
/******************************************************************
|
|
|
|
iLBC Speech Coder ANSI-C Source Code
|
|
|
|
WebRtcIlbcfix_GetLspPoly.h
|
|
|
|
******************************************************************/
|
|
|
|
#ifndef MODULES_AUDIO_CODING_CODECS_ILBC_MAIN_SOURCE_GET_LSP_POLY_H_
|
|
#define MODULES_AUDIO_CODING_CODECS_ILBC_MAIN_SOURCE_GET_LSP_POLY_H_
|
|
|
|
#include <stdint.h>
|
|
|
|
/*----------------------------------------------------------------*
|
|
* Construct the polynomials F1(z) and F2(z) from the LSP
|
|
* (Computations are done in Q24)
|
|
*
|
|
* The expansion is performed using the following recursion:
|
|
*
|
|
* f[0] = 1;
|
|
* tmp = -2.0 * lsp[0];
|
|
* f[1] = tmp;
|
|
* for (i=2; i<=5; i++) {
|
|
* b = -2.0 * lsp[2*i-2];
|
|
* f[i] = tmp*f[i-1] + 2.0*f[i-2];
|
|
* for (j=i; j>=2; j--) {
|
|
* f[j] = f[j] + tmp*f[j-1] + f[j-2];
|
|
* }
|
|
* f[i] = f[i] + tmp;
|
|
* }
|
|
*---------------------------------------------------------------*/
|
|
|
|
void WebRtcIlbcfix_GetLspPoly(int16_t* lsp, /* (i) LSP in Q15 */
|
|
int32_t* f); /* (o) polonymial in Q24 */
|
|
|
|
#endif
|