| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * Common code for AAC cube-root table | ||
| 3 | * | ||
| 4 | * Copyright (c) 2010 Reimar Döffinger <Reimar.Doeffinger@gmx.de> | ||
| 5 | * | ||
| 6 | * This file is part of FFmpeg. | ||
| 7 | * | ||
| 8 | * FFmpeg is free software; you can redistribute it and/or | ||
| 9 | * modify it under the terms of the GNU Lesser General Public | ||
| 10 | * License as published by the Free Software Foundation; either | ||
| 11 | * version 2.1 of the License, or (at your option) any later version. | ||
| 12 | * | ||
| 13 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 16 | * Lesser General Public License for more details. | ||
| 17 | * | ||
| 18 | * You should have received a copy of the GNU Lesser General Public | ||
| 19 | * License along with FFmpeg; if not, write to the Free Software | ||
| 20 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 21 | */ | ||
| 22 | |||
| 23 | #include <math.h> | ||
| 24 | |||
| 25 | #include "cbrt_data.h" | ||
| 26 | #include "libavutil/attributes.h" | ||
| 27 | |||
| 28 | 256 | av_cold void ff_cbrt_dbl_tableinit(double tmp_lut[TMP_LUT_SIZE]) | |
| 29 | { | ||
| 30 |
2/2✓ Branch 0 taken 1048576 times.
✓ Branch 1 taken 256 times.
|
1048832 | for (int idx = 0; idx < TMP_LUT_SIZE; ++idx) |
| 31 | 1048576 | tmp_lut[idx] = 1; | |
| 32 | |||
| 33 | /* have to take care of non-squarefree numbers; notice that sqrt(LUT_SIZE) = 90; | ||
| 34 | * idx == 44 corresponds to 89. */ | ||
| 35 |
2/2✓ Branch 0 taken 11264 times.
✓ Branch 1 taken 256 times.
|
11520 | for (int idx = 1; idx < 45; ++idx) { |
| 36 |
2/2✓ Branch 0 taken 5888 times.
✓ Branch 1 taken 5376 times.
|
11264 | if (tmp_lut[idx] == 1) { |
| 37 | 5888 | int i = 2 * idx + 1; | |
| 38 | 5888 | double cbrt_val = i * cbrt(i); | |
| 39 |
2/2✓ Branch 0 taken 15616 times.
✓ Branch 1 taken 5888 times.
|
21504 | for (int k = i; k < LUT_SIZE; k *= i) { |
| 40 | // We only have to handle k, 3 * k, 5 * k,..., | ||
| 41 | // because only these are odd. The corresponding indices are | ||
| 42 | // k >> 1, (k >> 1) + k, (k >> 1) + 2 * k,... | ||
| 43 |
2/2✓ Branch 0 taken 1639424 times.
✓ Branch 1 taken 15616 times.
|
1655040 | for (int idx2 = k >> 1; idx2 < TMP_LUT_SIZE; idx2 += k) |
| 44 | 1639424 | tmp_lut[idx2] *= cbrt_val; | |
| 45 | } | ||
| 46 | } | ||
| 47 | } | ||
| 48 | |||
| 49 |
2/2✓ Branch 0 taken 1037056 times.
✓ Branch 1 taken 256 times.
|
1037312 | for (int idx = 45; idx < TMP_LUT_SIZE; ++idx) { |
| 50 |
2/2✓ Branch 0 taken 257024 times.
✓ Branch 1 taken 780032 times.
|
1037056 | if (tmp_lut[idx] == 1) { |
| 51 | 257024 | int i = 2 * idx + 1; | |
| 52 | 257024 | double cbrt_val = i * cbrt(i); | |
| 53 |
2/2✓ Branch 0 taken 732928 times.
✓ Branch 1 taken 257024 times.
|
989952 | for (int idx2 = idx; idx2 < TMP_LUT_SIZE; idx2 += i) |
| 54 | 732928 | tmp_lut[idx2] *= cbrt_val; | |
| 55 | } | ||
| 56 | } | ||
| 57 | 256 | } | |
| 58 |