This file is indexed.

/usr/include/sipxtapi/mp/MpDspUtilsSumVect.h is in libsipxtapi-dev 3.3.0~test17-2.1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
//
// Copyright (C) 2007-2012 SIPez LLC. All rights reserved.
//
// Copyright (C) 2007 SIPfoundry Inc.
// Licensed by SIPfoundry under the LGPL license.
//
// $$
//////////////////////////////////////////////////////////////////////////////

// Author: Alexander Chemeris <Alexander DOT Chemeris AT SIPez DOT com>

#ifndef _MpDspUtilsSumVect_h_
#define _MpDspUtilsSumVect_h_

/**
*  @file
*
*  DO NOT INCLUDE THIS FILE DIRECTLY! This files is designed to be included
*  to <mp/MpDspUtils.h> and should not be used outside of it.
*/

/* ============================ INLINE METHODS ============================ */

#ifdef MP_FIXED_POINT // [

OsStatus MpDspUtils::add_I(const int16_t *pSrc1, int32_t *pSrc2Dst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      add_I(pSrc2Dst[i], (int32_t)pSrc1[i]);
   }
   return OS_SUCCESS;
}

OsStatus MpDspUtils::add_IGain(const int16_t *pSrc1, int32_t *pSrc2Dst, int dataLength, unsigned src1ScaleFactor)
{
   for (int i=0; i<dataLength; i++)
   {
      add_I(pSrc2Dst[i], ((int32_t)pSrc1[i])<<src1ScaleFactor);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::add_IAtt(const int16_t *pSrc1, int32_t *pSrc2Dst, int dataLength, unsigned src1ScaleFactor)
{
   for (int i=0; i<dataLength; i++)
   {
      add_I(pSrc2Dst[i], (int32_t)pSrc1[i]>>src1ScaleFactor);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::add(const int32_t *pSrc1, const int32_t *pSrc2, int32_t *pDst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      pDst[i] = add(pSrc1[i], pSrc2[i]);
   }
   return OS_SUCCESS;
}

OsStatus MpDspUtils::addMul_I(const int16_t *pSrc1, int16_t val, int32_t *pSrc2Dst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      addMul_I(pSrc2Dst[i], pSrc1[i], val);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::addMulLinear_I(const int16_t *pSrc1, int16_t valStart, int16_t valEnd,
                                    int32_t *pSrc2Dst, int dataLength)
{
   // TODO:: This works fine only when (dataLength << (valStart - valEnd)).
   //        In other case we need smarter step value calculation, e.g.
   //        http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
   //        Or at least we need to distinguish the case when
   //        (valStart - valEnd) < dataLength.
   int16_t step = (valEnd - valStart) / dataLength;
   int16_t val = valStart;

   for (int i=0; i<dataLength; i++, val += step)
   {
      addMul_I(pSrc2Dst[i], pSrc1[i], val);
   }
   return OS_SUCCESS;
}

OsStatus MpDspUtils::mul(const int16_t *pSrc, const int16_t val, int32_t *pDst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      pDst[i] = pSrc[i]*val;
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::mul_I(int16_t *pSrcDst, const int16_t val, int dataLength)
{
   const int16_t thresold = INT16_MAX/val;
   for (int i=0; i<dataLength; i++)
   {
      if (pSrcDst[i] > thresold)
      {
         pSrcDst[i] = INT16_MAX;
      }
      else if (pSrcDst[i] < -thresold)
      {
         pSrcDst[i] = -INT16_MAX;
      }
      else
      {
         pSrcDst[i] *= val;
      }
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::mulLinear(const int16_t *pSrc, int16_t valStart, int16_t valEnd,
                               int32_t *pDst, int dataLength)
{
   // TODO:: This works fine only when (dataLength << (valStart - valEnd)).
   //        In other case we need smarter step value calculation, e.g.
   //        http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
   //        Or at least we need to distinguish the case when
   //        (valStart - valEnd) < dataLength.
   int16_t step = (valEnd - valStart) / dataLength;
   int16_t val = valStart;

   for (int i=0; i<dataLength; i++, val += step)
   {
      pDst[i] = pSrc[i] * val;
   }
   return OS_SUCCESS;
}

#else  // MP_FIXED_POINT ][

OsStatus MpDspUtils::add_I(const int16_t *pSrc1, float *pSrc2Dst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      add_I(pSrc2Dst[i], pSrc1[i]);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::add(const float *pSrc1, const float *pSrc2, float *pDst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      pDst[i] = add(pSrc1[i], pSrc2[i]);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::addMul_I(const int16_t *pSrc1, float val, float *pSrc2Dst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      add_I(pSrc2Dst[i], pSrc1[i]*val);
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::addMulLinear_I(const int16_t *pSrc1, float valStart, float valEnd,
                                    float *pSrc2Dst, int dataLength)
{
   float step = (valEnd - valStart) / dataLength;
   float val = valStart;

   for (int i=0; i<dataLength; i++, val += step)
   {
      addMul_I(pSrc2Dst[i], pSrc1[i], val);
   }
   return OS_SUCCESS;
}

OsStatus MpDspUtils::mul(const int16_t *pSrc, const float val, float *pDst, int dataLength)
{
   for (int i=0; i<dataLength; i++)
   {
      pDst[i] = pSrc[i]*val;
   }

   return OS_SUCCESS;
}

OsStatus MpDspUtils::mulLinear(const int16_t *pSrc, float valStart, float valEnd,
                               float *pDst, int dataLength)
{
   // TODO:: This works fine only when (dataLength << (valStart - valEnd)).
   //        In other case we need smarter step value calculation, e.g.
   //        http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
   //        Or at least we need to distinguish the case when
   //        (valStart - valEnd) < dataLength.
   float step = (valEnd - valStart) / dataLength;
   float val = valStart;

   for (int i=0; i<dataLength; i++, val += step)
   {
      pDst[i] = pSrc[i] * val;
   }
   return OS_SUCCESS;
}

#endif // MP_FIXED_POINT ]

int MpDspUtils::maxAbs(const int16_t *pSrc, int dataLength)
{
   int16_t startValue = pSrc[0];
   if (startValue < 0)
      startValue = -startValue;

   for (int i = 1; i < dataLength; i++)
   {
      startValue = maximum(startValue, 
         (int16_t)( (pSrc[i] > 0) ? pSrc[i] : -(pSrc[i]) ));
   }
   return startValue;
}

int16_t MpDspUtils::maximum(const int16_t *pSrc, int dataLength)
{
   int16_t val = pSrc[0];
   for (int i = 0; i < dataLength; i++)
      if (pSrc[i] > val) 
         val = pSrc[i];

   return val;
}

int32_t MpDspUtils::maximum(const int32_t *pSrc, int dataLength)
{
   int32_t val = pSrc[0];
   for (int i = 0; i < dataLength; i++)
      if (pSrc[i] > val) 
         val = pSrc[i];

   return val;
}

int16_t MpDspUtils::minimum(const int16_t *pSrc, int dataLength)
{
   int16_t val = pSrc[0];
   for (int16_t i = 0; i < dataLength; i++)
      if (pSrc[i] < val) 
         val = pSrc[i];

   return val;
}

int32_t MpDspUtils::minimum(const int32_t *pSrc, int dataLength)
{
   int32_t val = pSrc[0];
   for (int32_t i = 0; i < dataLength; i++)
      if (pSrc[i] < val) 
         val = pSrc[i];

   return val;
}

int32_t MpDspUtils::countClippedValues(const int16_t *pSrc, int dataLength)
{
   int32_t clippedCount = 0;
   for (int32_t i = 0; i < dataLength; i++)
   {
      if(pSrc[i] >= INT16_MAX || pSrc[i] <= -INT16_MAX)
      {
         clippedCount++;
      }
   }

   return(clippedCount);
}

#endif  // _MpDspUtilsSumVect_h_