131 lines
4.2 KiB
C
131 lines
4.2 KiB
C
/*
|
|
* Copyright (c) 2002 Dieter Shirley
|
|
*
|
|
* dct_unquantize_h263_altivec:
|
|
* Copyright (c) 2003 Romain Dolbeau <romain@dolbeau.org>
|
|
*
|
|
* This file is part of FFmpeg.
|
|
*
|
|
* FFmpeg is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with FFmpeg; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
|
|
#include "config.h"
|
|
|
|
#include "libavutil/attributes.h"
|
|
#include "libavutil/cpu.h"
|
|
#include "libavutil/ppc/cpu.h"
|
|
#include "libavutil/ppc/util_altivec.h"
|
|
|
|
#include "libavcodec/mpegvideo.h"
|
|
|
|
#if HAVE_ALTIVEC
|
|
|
|
/* AltiVec version of dct_unquantize_h263
|
|
this code assumes `block' is 16 bytes-aligned */
|
|
static void dct_unquantize_h263_altivec(MpegEncContext *s,
|
|
int16_t *block, int n, int qscale)
|
|
{
|
|
int i, level, qmul, qadd;
|
|
int nCoeffs;
|
|
|
|
qadd = (qscale - 1) | 1;
|
|
qmul = qscale << 1;
|
|
|
|
if (s->mb_intra) {
|
|
if (!s->h263_aic) {
|
|
if (n < 4)
|
|
block[0] = block[0] * s->y_dc_scale;
|
|
else
|
|
block[0] = block[0] * s->c_dc_scale;
|
|
}else
|
|
qadd = 0;
|
|
i = 1;
|
|
nCoeffs= 63; //does not always use zigzag table
|
|
} else {
|
|
i = 0;
|
|
av_assert2(s->block_last_index[n]>=0);
|
|
nCoeffs= s->intra_scantable.raster_end[ s->block_last_index[n] ];
|
|
}
|
|
|
|
{
|
|
register const vector signed short vczero = (const vector signed short)vec_splat_s16(0);
|
|
DECLARE_ALIGNED(16, short, qmul8) = qmul;
|
|
DECLARE_ALIGNED(16, short, qadd8) = qadd;
|
|
register vector signed short blockv, qmulv, qaddv, nqaddv, temp1;
|
|
register vector bool short blockv_null, blockv_neg;
|
|
register short backup_0 = block[0];
|
|
register int j = 0;
|
|
|
|
qmulv = vec_splat((vec_s16)vec_lde(0, &qmul8), 0);
|
|
qaddv = vec_splat((vec_s16)vec_lde(0, &qadd8), 0);
|
|
nqaddv = vec_sub(vczero, qaddv);
|
|
|
|
// vectorize all the 16 bytes-aligned blocks
|
|
// of 8 elements
|
|
for(; (j + 7) <= nCoeffs ; j+=8) {
|
|
blockv = vec_ld(j << 1, block);
|
|
blockv_neg = vec_cmplt(blockv, vczero);
|
|
blockv_null = vec_cmpeq(blockv, vczero);
|
|
// choose between +qadd or -qadd as the third operand
|
|
temp1 = vec_sel(qaddv, nqaddv, blockv_neg);
|
|
// multiply & add (block{i,i+7} * qmul [+-] qadd)
|
|
temp1 = vec_mladd(blockv, qmulv, temp1);
|
|
// put 0 where block[{i,i+7} used to have 0
|
|
blockv = vec_sel(temp1, blockv, blockv_null);
|
|
vec_st(blockv, j << 1, block);
|
|
}
|
|
|
|
// if nCoeffs isn't a multiple of 8, finish the job
|
|
// using good old scalar units.
|
|
// (we could do it using a truncated vector,
|
|
// but I'm not sure it's worth the hassle)
|
|
for(; j <= nCoeffs ; j++) {
|
|
level = block[j];
|
|
if (level) {
|
|
if (level < 0) {
|
|
level = level * qmul - qadd;
|
|
} else {
|
|
level = level * qmul + qadd;
|
|
}
|
|
block[j] = level;
|
|
}
|
|
}
|
|
|
|
if (i == 1) {
|
|
// cheat. this avoid special-casing the first iteration
|
|
block[0] = backup_0;
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif /* HAVE_ALTIVEC */
|
|
|
|
av_cold void ff_mpv_common_init_ppc(MpegEncContext *s)
|
|
{
|
|
#if HAVE_ALTIVEC
|
|
if (!PPC_ALTIVEC(av_get_cpu_flags()))
|
|
return;
|
|
|
|
if ((s->avctx->dct_algo == FF_DCT_AUTO) ||
|
|
(s->avctx->dct_algo == FF_DCT_ALTIVEC)) {
|
|
s->dct_unquantize_h263_intra = dct_unquantize_h263_altivec;
|
|
s->dct_unquantize_h263_inter = dct_unquantize_h263_altivec;
|
|
}
|
|
#endif /* HAVE_ALTIVEC */
|
|
}
|