Fraunhofer AAC codec.

License boilerplate update to follow.

Change-Id: I2810460c11a58b6d148d84673cc031f3685e79b5

1 files changed, 214 insertions, 0 deletions

diff --git a/libSBRenc/src/sbr_misc.cpp b/libSBRenc/src/sbr_misc.cpp
new file mode 100644
index 0000000..b602e99
--- /dev/null
+++ b/libSBRenc/src/sbr_misc.cpp
@@ -0,0 +1,214 @@
+/****************************************************************************
+
+                     (C) Copyright Fraunhofer IIS (2004)
+                               All Rights Reserved
+
+    Please be advised that this software and/or program delivery is
+    Confidential Information of Fraunhofer and subject to and covered by the
+
+    Fraunhofer IIS Software Evaluation Agreement
+    between Google Inc. and  Fraunhofer
+    effective and in full force since March 1, 2012.
+
+    You may use this software and/or program only under the terms and
+    conditions described in the above mentioned Fraunhofer IIS Software
+    Evaluation Agreement. Any other and/or further use requires a separate agreement.
+
+
+   This software and/or program is protected by copyright law and international
+   treaties. Any reproduction or distribution of this software and/or program,
+   or any portion of it, may result in severe civil and criminal penalties, and
+   will be prosecuted to the maximum extent possible under law.
+
+ $Id$
+
+*******************************************************************************/
+/*!
+  \file
+  \brief  Sbr miscellaneous helper functions $Revision: 36847 $
+*/
+#include "sbr_misc.h"
+
+
+void FDKsbrEnc_Shellsort_fract (FIXP_DBL *in, INT n)
+{
+  FIXP_DBL v;
+  INT i, j;
+  INT inc = 1;
+
+  do
+    inc = 3 * inc + 1;
+  while (inc <= n);
+
+  do {
+    inc = inc / 3;
+    for (i = inc + 1; i <= n; i++) {
+      v = in[i-1];
+      j = i;
+      while (in[j-inc-1] > v) {
+        in[j-1] = in[j-inc-1];
+        j -= inc;
+        if (j <= inc)
+          break;
+      }
+      in[j-1] = v;
+    }
+  } while (inc > 1);
+
+}
+
+/* Sorting routine */
+void FDKsbrEnc_Shellsort_int (INT *in, INT n)
+{
+
+  INT i, j, v;
+  INT inc = 1;
+
+  do
+    inc = 3 * inc + 1;
+  while (inc <= n);
+
+  do {
+    inc = inc / 3;
+    for (i = inc + 1; i <= n; i++) {
+      v = in[i-1];
+      j = i;
+      while (in[j-inc-1] > v) {
+        in[j-1] = in[j-inc-1];
+        j -= inc;
+        if (j <= inc)
+          break;
+      }
+      in[j-1] = v;
+    }
+  } while (inc > 1);
+
+}
+
+
+
+/*******************************************************************************
+ Functionname:  FDKsbrEnc_AddVecLeft
+ *******************************************************************************
+
+ Description:
+
+ Arguments:   INT* dst, INT* length_dst, INT* src, INT length_src
+
+ Return:      none
+
+*******************************************************************************/
+void
+FDKsbrEnc_AddVecLeft (INT *dst, INT *length_dst, INT *src, INT length_src)
+{
+  INT i;
+
+  for (i = length_src - 1; i >= 0; i--)
+    FDKsbrEnc_AddLeft (dst, length_dst, src[i]);
+}
+
+
+/*******************************************************************************
+ Functionname:  FDKsbrEnc_AddLeft
+ *******************************************************************************
+
+ Description:
+
+ Arguments:   INT* vector, INT* length_vector, INT value
+
+ Return:      none
+
+*******************************************************************************/
+void
+FDKsbrEnc_AddLeft (INT *vector, INT *length_vector, INT value)
+{
+  INT i;
+
+  for (i = *length_vector; i > 0; i--)
+    vector[i] = vector[i - 1];
+  vector[0] = value;
+  (*length_vector)++;
+}
+
+
+/*******************************************************************************
+ Functionname:  FDKsbrEnc_AddRight
+ *******************************************************************************
+
+ Description:
+
+ Arguments:   INT* vector, INT* length_vector, INT value
+
+ Return:      none
+
+*******************************************************************************/
+void
+FDKsbrEnc_AddRight (INT *vector, INT *length_vector, INT value)
+{
+  vector[*length_vector] = value;
+  (*length_vector)++;
+}
+
+
+
+/*******************************************************************************
+ Functionname:  FDKsbrEnc_AddVecRight
+ *******************************************************************************
+
+ Description:
+
+ Arguments:   INT* dst, INT* length_dst, INT* src, INT length_src)
+
+ Return:      none
+
+*******************************************************************************/
+void
+FDKsbrEnc_AddVecRight (INT *dst, INT *length_dst, INT *src, INT length_src)
+{
+  INT i;
+  for (i = 0; i < length_src; i++)
+    FDKsbrEnc_AddRight (dst, length_dst, src[i]);
+}
+
+
+/*****************************************************************************
+
+  functionname: FDKsbrEnc_LSI_divide_scale_fract
+
+  description:  Calculates division with best precision and scales the result.
+
+  return:       num*scale/denom
+
+*****************************************************************************/
+FIXP_DBL FDKsbrEnc_LSI_divide_scale_fract(FIXP_DBL num, FIXP_DBL denom, FIXP_DBL scale)
+{
+  FIXP_DBL tmp = FL2FXCONST_DBL(0.0f);
+  if (num != FL2FXCONST_DBL(0.0f)) {
+
+    INT shiftCommon;
+    INT shiftNum   = CountLeadingBits(num);
+    INT shiftDenom = CountLeadingBits(denom);
+    INT shiftScale = CountLeadingBits(scale);
+
+    num   = num   << shiftNum;
+    scale = scale << shiftScale;
+
+    tmp = fMultDiv2(num,scale);
+
+    if ( denom > (tmp >> fixMin(shiftNum+shiftScale-1,(DFRACT_BITS-1))) ) {
+      denom = denom << shiftDenom;
+      tmp = schur_div(tmp,denom,15);
+      shiftCommon = fixMin((shiftNum-shiftDenom+shiftScale-1),(DFRACT_BITS-1));
+      if (shiftCommon < 0)
+        tmp <<= -shiftCommon;
+      else
+        tmp >>=  shiftCommon;
+    }
+    else {
+      tmp = /*FL2FXCONST_DBL(1.0)*/ (FIXP_DBL)MAXVAL_DBL;
+    }
+  }
+
+  return (tmp);
+}
+