1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * Copyright (c) 2012 3cabdff1aSopenharmony_ci * MIPS Technologies, Inc., California. 4cabdff1aSopenharmony_ci * 5cabdff1aSopenharmony_ci * Redistribution and use in source and binary forms, with or without 6cabdff1aSopenharmony_ci * modification, are permitted provided that the following conditions 7cabdff1aSopenharmony_ci * are met: 8cabdff1aSopenharmony_ci * 1. Redistributions of source code must retain the above copyright 9cabdff1aSopenharmony_ci * notice, this list of conditions and the following disclaimer. 10cabdff1aSopenharmony_ci * 2. Redistributions in binary form must reproduce the above copyright 11cabdff1aSopenharmony_ci * notice, this list of conditions and the following disclaimer in the 12cabdff1aSopenharmony_ci * documentation and/or other materials provided with the distribution. 13cabdff1aSopenharmony_ci * 3. Neither the name of the MIPS Technologies, Inc., nor the names of its 14cabdff1aSopenharmony_ci * contributors may be used to endorse or promote products derived from 15cabdff1aSopenharmony_ci * this software without specific prior written permission. 16cabdff1aSopenharmony_ci * 17cabdff1aSopenharmony_ci * THIS SOFTWARE IS PROVIDED BY THE MIPS TECHNOLOGIES, INC. ``AS IS'' AND 18cabdff1aSopenharmony_ci * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19cabdff1aSopenharmony_ci * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20cabdff1aSopenharmony_ci * ARE DISCLAIMED. IN NO EVENT SHALL THE MIPS TECHNOLOGIES, INC. BE LIABLE 21cabdff1aSopenharmony_ci * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22cabdff1aSopenharmony_ci * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23cabdff1aSopenharmony_ci * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24cabdff1aSopenharmony_ci * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25cabdff1aSopenharmony_ci * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26cabdff1aSopenharmony_ci * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27cabdff1aSopenharmony_ci * SUCH DAMAGE. 28cabdff1aSopenharmony_ci * 29cabdff1aSopenharmony_ci * Author: Nedeljko Babic (nbabic@mips.com) 30cabdff1aSopenharmony_ci * 31cabdff1aSopenharmony_ci * This file is part of FFmpeg. 32cabdff1aSopenharmony_ci * 33cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 34cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 35cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 36cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 37cabdff1aSopenharmony_ci * 38cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 39cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 40cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 41cabdff1aSopenharmony_ci * Lesser General Public License for more details. 42cabdff1aSopenharmony_ci * 43cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 44cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 45cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 46cabdff1aSopenharmony_ci */ 47cabdff1aSopenharmony_ci 48cabdff1aSopenharmony_ci#ifndef AVUTIL_FIXED_DSP_H 49cabdff1aSopenharmony_ci#define AVUTIL_FIXED_DSP_H 50cabdff1aSopenharmony_ci 51cabdff1aSopenharmony_ci#include <stdint.h> 52cabdff1aSopenharmony_ci#include "config.h" 53cabdff1aSopenharmony_ci#include "attributes.h" 54cabdff1aSopenharmony_ci#include "libavcodec/mathops.h" 55cabdff1aSopenharmony_ci 56cabdff1aSopenharmony_citypedef struct AVFixedDSPContext { 57cabdff1aSopenharmony_ci /* Assume len is a multiple of 16, and arrays are 32-byte aligned */ 58cabdff1aSopenharmony_ci /* Results of multiplications are scaled down by 31 bit (and rounded) if not 59cabdff1aSopenharmony_ci * stated otherwise */ 60cabdff1aSopenharmony_ci 61cabdff1aSopenharmony_ci /** 62cabdff1aSopenharmony_ci * Overlap/add with window function. 63cabdff1aSopenharmony_ci * Result is scaled down by "bits" bits. 64cabdff1aSopenharmony_ci * Used primarily by MDCT-based audio codecs. 65cabdff1aSopenharmony_ci * Source and destination vectors must overlap exactly or not at all. 66cabdff1aSopenharmony_ci * 67cabdff1aSopenharmony_ci * @param dst result vector 68cabdff1aSopenharmony_ci * constraints: 16-byte aligned 69cabdff1aSopenharmony_ci * @param src0 first source vector 70cabdff1aSopenharmony_ci * constraints: 16-byte aligned 71cabdff1aSopenharmony_ci * @param src1 second source vector 72cabdff1aSopenharmony_ci * constraints: 16-byte aligned 73cabdff1aSopenharmony_ci * @param win half-window vector 74cabdff1aSopenharmony_ci * constraints: 16-byte aligned 75cabdff1aSopenharmony_ci * @param len length of vector 76cabdff1aSopenharmony_ci * constraints: multiple of 4 77cabdff1aSopenharmony_ci * @param bits scaling parameter 78cabdff1aSopenharmony_ci * 79cabdff1aSopenharmony_ci */ 80cabdff1aSopenharmony_ci void (*vector_fmul_window_scaled)(int16_t *dst, const int32_t *src0, const int32_t *src1, const int32_t *win, int len, uint8_t bits); 81cabdff1aSopenharmony_ci 82cabdff1aSopenharmony_ci /** 83cabdff1aSopenharmony_ci * Overlap/add with window function. 84cabdff1aSopenharmony_ci * Used primarily by MDCT-based audio codecs. 85cabdff1aSopenharmony_ci * Source and destination vectors must overlap exactly or not at all. 86cabdff1aSopenharmony_ci * 87cabdff1aSopenharmony_ci * @param dst result vector 88cabdff1aSopenharmony_ci * constraints: 32-byte aligned 89cabdff1aSopenharmony_ci * @param src0 first source vector 90cabdff1aSopenharmony_ci * constraints: 16-byte aligned 91cabdff1aSopenharmony_ci * @param src1 second source vector 92cabdff1aSopenharmony_ci * constraints: 16-byte aligned 93cabdff1aSopenharmony_ci * @param win half-window vector 94cabdff1aSopenharmony_ci * constraints: 16-byte aligned 95cabdff1aSopenharmony_ci * @param len length of vector 96cabdff1aSopenharmony_ci * constraints: multiple of 4 97cabdff1aSopenharmony_ci */ 98cabdff1aSopenharmony_ci void (*vector_fmul_window)(int32_t *dst, const int32_t *src0, const int32_t *src1, const int32_t *win, int len); 99cabdff1aSopenharmony_ci 100cabdff1aSopenharmony_ci /** 101cabdff1aSopenharmony_ci * Fixed-point multiplication that calculates the entry wise product of two 102cabdff1aSopenharmony_ci * vectors of integers and stores the result in a vector of integers. 103cabdff1aSopenharmony_ci * 104cabdff1aSopenharmony_ci * @param dst output vector 105cabdff1aSopenharmony_ci * constraints: 32-byte aligned 106cabdff1aSopenharmony_ci * @param src0 first input vector 107cabdff1aSopenharmony_ci * constraints: 32-byte aligned 108cabdff1aSopenharmony_ci * @param src1 second input vector 109cabdff1aSopenharmony_ci * constraints: 32-byte aligned 110cabdff1aSopenharmony_ci * @param len number of elements in the input 111cabdff1aSopenharmony_ci * constraints: multiple of 16 112cabdff1aSopenharmony_ci */ 113cabdff1aSopenharmony_ci void (*vector_fmul)(int *dst, const int *src0, const int *src1, 114cabdff1aSopenharmony_ci int len); 115cabdff1aSopenharmony_ci 116cabdff1aSopenharmony_ci void (*vector_fmul_reverse)(int *dst, const int *src0, const int *src1, int len); 117cabdff1aSopenharmony_ci /** 118cabdff1aSopenharmony_ci * Calculate the entry wise product of two vectors of integers, add a third vector of 119cabdff1aSopenharmony_ci * integers and store the result in a vector of integers. 120cabdff1aSopenharmony_ci * 121cabdff1aSopenharmony_ci * @param dst output vector 122cabdff1aSopenharmony_ci * constraints: 32-byte aligned 123cabdff1aSopenharmony_ci * @param src0 first input vector 124cabdff1aSopenharmony_ci * constraints: 32-byte aligned 125cabdff1aSopenharmony_ci * @param src1 second input vector 126cabdff1aSopenharmony_ci * constraints: 32-byte aligned 127cabdff1aSopenharmony_ci * @param src2 third input vector 128cabdff1aSopenharmony_ci * constraints: 32-byte aligned 129cabdff1aSopenharmony_ci * @param len number of elements in the input 130cabdff1aSopenharmony_ci * constraints: multiple of 16 131cabdff1aSopenharmony_ci */ 132cabdff1aSopenharmony_ci void (*vector_fmul_add)(int *dst, const int *src0, const int *src1, 133cabdff1aSopenharmony_ci const int *src2, int len); 134cabdff1aSopenharmony_ci 135cabdff1aSopenharmony_ci /** 136cabdff1aSopenharmony_ci * Calculate the scalar product of two vectors of integers. 137cabdff1aSopenharmony_ci * 138cabdff1aSopenharmony_ci * @param v1 first vector, 16-byte aligned 139cabdff1aSopenharmony_ci * @param v2 second vector, 16-byte aligned 140cabdff1aSopenharmony_ci * @param len length of vectors, multiple of 4 141cabdff1aSopenharmony_ci * 142cabdff1aSopenharmony_ci * @return sum of elementwise products 143cabdff1aSopenharmony_ci */ 144cabdff1aSopenharmony_ci int (*scalarproduct_fixed)(const int *v1, const int *v2, int len); 145cabdff1aSopenharmony_ci 146cabdff1aSopenharmony_ci /** 147cabdff1aSopenharmony_ci * Calculate the sum and difference of two vectors of integers. 148cabdff1aSopenharmony_ci * 149cabdff1aSopenharmony_ci * @param v1 first input vector, sum output, 16-byte aligned 150cabdff1aSopenharmony_ci * @param v2 second input vector, difference output, 16-byte aligned 151cabdff1aSopenharmony_ci * @param len length of vectors, multiple of 4 152cabdff1aSopenharmony_ci */ 153cabdff1aSopenharmony_ci void (*butterflies_fixed)(int *av_restrict v1, int *av_restrict v2, int len); 154cabdff1aSopenharmony_ci} AVFixedDSPContext; 155cabdff1aSopenharmony_ci 156cabdff1aSopenharmony_ci/** 157cabdff1aSopenharmony_ci * Allocate and initialize a fixed DSP context. 158cabdff1aSopenharmony_ci * note: should be freed with a av_free call when no longer needed. 159cabdff1aSopenharmony_ci * 160cabdff1aSopenharmony_ci * @param strict setting to non-zero avoids using functions which may not be IEEE-754 compliant 161cabdff1aSopenharmony_ci */ 162cabdff1aSopenharmony_ciAVFixedDSPContext * avpriv_alloc_fixed_dsp(int strict); 163cabdff1aSopenharmony_ci 164cabdff1aSopenharmony_civoid ff_fixed_dsp_init_x86(AVFixedDSPContext *fdsp); 165cabdff1aSopenharmony_ci 166cabdff1aSopenharmony_ci/** 167cabdff1aSopenharmony_ci * Calculate the square root 168cabdff1aSopenharmony_ci * 169cabdff1aSopenharmony_ci * @param x input fixed point number 170cabdff1aSopenharmony_ci * 171cabdff1aSopenharmony_ci * @param bits format of fixed point number (32 - bits).bits 172cabdff1aSopenharmony_ci * 173cabdff1aSopenharmony_ci * note: input is normalized to (0, 1) fixed point value 174cabdff1aSopenharmony_ci */ 175cabdff1aSopenharmony_ci 176cabdff1aSopenharmony_cistatic av_always_inline int fixed_sqrt(int x, int bits) 177cabdff1aSopenharmony_ci{ 178cabdff1aSopenharmony_ci int retval, bit_mask, guess, square, i; 179cabdff1aSopenharmony_ci int64_t accu; 180cabdff1aSopenharmony_ci int shift1 = 30 - bits; 181cabdff1aSopenharmony_ci int shift2 = bits - 15; 182cabdff1aSopenharmony_ci 183cabdff1aSopenharmony_ci if (shift1 > 0) retval = ff_sqrt(x << shift1); 184cabdff1aSopenharmony_ci else retval = ff_sqrt(x >> -shift1); 185cabdff1aSopenharmony_ci 186cabdff1aSopenharmony_ci if (shift2 > 0) { 187cabdff1aSopenharmony_ci retval = retval << shift2; 188cabdff1aSopenharmony_ci bit_mask = (1 << (shift2 - 1)); 189cabdff1aSopenharmony_ci 190cabdff1aSopenharmony_ci for (i=0; i<shift2; i++){ 191cabdff1aSopenharmony_ci guess = retval + bit_mask; 192cabdff1aSopenharmony_ci accu = (int64_t)guess * guess; 193cabdff1aSopenharmony_ci square = (int)((accu + bit_mask) >> bits); 194cabdff1aSopenharmony_ci if (x >= square) 195cabdff1aSopenharmony_ci retval += bit_mask; 196cabdff1aSopenharmony_ci bit_mask >>= 1; 197cabdff1aSopenharmony_ci } 198cabdff1aSopenharmony_ci 199cabdff1aSopenharmony_ci } 200cabdff1aSopenharmony_ci else retval >>= (-shift2); 201cabdff1aSopenharmony_ci 202cabdff1aSopenharmony_ci return retval; 203cabdff1aSopenharmony_ci} 204cabdff1aSopenharmony_ci 205cabdff1aSopenharmony_ci#endif /* AVUTIL_FIXED_DSP_H */ 206