2002-11-02 12:28:08 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2002 Brian Foley
|
|
|
|
* Copyright (c) 2002 Dieter Shirley
|
2004-04-20 19:05:12 +02:00
|
|
|
* Copyright (c) 2003-2004 Romain Dolbeau <romain@dolbeau.org>
|
2002-11-02 12:28:08 +01:00
|
|
|
*
|
2006-10-07 17:30:46 +02:00
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
2002-11-02 12:28:08 +01:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 17:30:46 +02:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2002-11-02 12:28:08 +01:00
|
|
|
*
|
2006-10-07 17:30:46 +02:00
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
2002-11-02 12:28:08 +01:00
|
|
|
* 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
|
2006-10-07 17:30:46 +02:00
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
2006-01-12 23:43:26 +01:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2002-11-02 12:28:08 +01:00
|
|
|
*/
|
2002-11-20 00:22:29 +01:00
|
|
|
|
2003-01-19 20:00:45 +01:00
|
|
|
#ifndef _DSPUTIL_ALTIVEC_
|
|
|
|
#define _DSPUTIL_ALTIVEC_
|
|
|
|
|
|
|
|
#include "dsputil_ppc.h"
|
|
|
|
|
|
|
|
#ifdef HAVE_ALTIVEC
|
|
|
|
|
2003-01-16 22:54:55 +01:00
|
|
|
extern int has_altivec(void);
|
2003-01-08 19:47:49 +01:00
|
|
|
|
2006-10-07 13:46:35 +02:00
|
|
|
void put_pixels16_altivec(uint8_t *block, const uint8_t *pixels, int line_size, int h);
|
|
|
|
|
|
|
|
void avg_pixels16_altivec(uint8_t *block, const uint8_t *pixels, int line_size, int h);
|
|
|
|
|
2003-01-08 19:47:49 +01:00
|
|
|
// used to build registers permutation vectors (vcprm)
|
|
|
|
// the 's' are for words in the _s_econd vector
|
|
|
|
#define WORD_0 0x00,0x01,0x02,0x03
|
|
|
|
#define WORD_1 0x04,0x05,0x06,0x07
|
|
|
|
#define WORD_2 0x08,0x09,0x0a,0x0b
|
|
|
|
#define WORD_3 0x0c,0x0d,0x0e,0x0f
|
|
|
|
#define WORD_s0 0x10,0x11,0x12,0x13
|
|
|
|
#define WORD_s1 0x14,0x15,0x16,0x17
|
|
|
|
#define WORD_s2 0x18,0x19,0x1a,0x1b
|
|
|
|
#define WORD_s3 0x1c,0x1d,0x1e,0x1f
|
|
|
|
|
2003-01-26 23:29:47 +01:00
|
|
|
#ifdef CONFIG_DARWIN
|
2003-01-08 19:47:49 +01:00
|
|
|
#define vcprm(a,b,c,d) (const vector unsigned char)(WORD_ ## a, WORD_ ## b, WORD_ ## c, WORD_ ## d)
|
2003-01-26 23:29:47 +01:00
|
|
|
#else
|
|
|
|
#define vcprm(a,b,c,d) (const vector unsigned char){WORD_ ## a, WORD_ ## b, WORD_ ## c, WORD_ ## d}
|
|
|
|
#endif
|
2003-01-08 19:47:49 +01:00
|
|
|
|
|
|
|
// vcprmle is used to keep the same index as in the SSE version.
|
|
|
|
// it's the same as vcprm, with the index inversed
|
|
|
|
// ('le' is Little Endian)
|
|
|
|
#define vcprmle(a,b,c,d) vcprm(d,c,b,a)
|
|
|
|
|
|
|
|
// used to build inverse/identity vectors (vcii)
|
|
|
|
// n is _n_egative, p is _p_ositive
|
|
|
|
#define FLOAT_n -1.
|
|
|
|
#define FLOAT_p 1.
|
|
|
|
|
2003-01-26 23:29:47 +01:00
|
|
|
|
|
|
|
#ifdef CONFIG_DARWIN
|
2003-01-08 19:47:49 +01:00
|
|
|
#define vcii(a,b,c,d) (const vector float)(FLOAT_ ## a, FLOAT_ ## b, FLOAT_ ## c, FLOAT_ ## d)
|
2003-01-26 23:29:47 +01:00
|
|
|
#else
|
|
|
|
#define vcii(a,b,c,d) (const vector float){FLOAT_ ## a, FLOAT_ ## b, FLOAT_ ## c, FLOAT_ ## d}
|
|
|
|
#endif
|
2003-01-16 22:54:55 +01:00
|
|
|
|
2006-10-10 10:01:19 +02:00
|
|
|
// Transpose 8x8 matrix of 16-bit elements (in-place)
|
|
|
|
#define TRANSPOSE8(a,b,c,d,e,f,g,h) \
|
|
|
|
do { \
|
|
|
|
vector signed short A1, B1, C1, D1, E1, F1, G1, H1; \
|
|
|
|
vector signed short A2, B2, C2, D2, E2, F2, G2, H2; \
|
|
|
|
\
|
|
|
|
A1 = vec_mergeh (a, e); \
|
|
|
|
B1 = vec_mergel (a, e); \
|
|
|
|
C1 = vec_mergeh (b, f); \
|
|
|
|
D1 = vec_mergel (b, f); \
|
|
|
|
E1 = vec_mergeh (c, g); \
|
|
|
|
F1 = vec_mergel (c, g); \
|
|
|
|
G1 = vec_mergeh (d, h); \
|
|
|
|
H1 = vec_mergel (d, h); \
|
|
|
|
\
|
|
|
|
A2 = vec_mergeh (A1, E1); \
|
|
|
|
B2 = vec_mergel (A1, E1); \
|
|
|
|
C2 = vec_mergeh (B1, F1); \
|
|
|
|
D2 = vec_mergel (B1, F1); \
|
|
|
|
E2 = vec_mergeh (C1, G1); \
|
|
|
|
F2 = vec_mergel (C1, G1); \
|
|
|
|
G2 = vec_mergeh (D1, H1); \
|
|
|
|
H2 = vec_mergel (D1, H1); \
|
|
|
|
\
|
|
|
|
a = vec_mergeh (A2, E2); \
|
|
|
|
b = vec_mergel (A2, E2); \
|
|
|
|
c = vec_mergeh (B2, F2); \
|
|
|
|
d = vec_mergel (B2, F2); \
|
|
|
|
e = vec_mergeh (C2, G2); \
|
|
|
|
f = vec_mergel (C2, G2); \
|
|
|
|
g = vec_mergeh (D2, H2); \
|
|
|
|
h = vec_mergel (D2, H2); \
|
|
|
|
} while (0)
|
|
|
|
|
2003-01-16 22:54:55 +01:00
|
|
|
#endif /* HAVE_ALTIVEC */
|
2003-01-19 20:00:45 +01:00
|
|
|
|
|
|
|
#endif /* _DSPUTIL_ALTIVEC_ */
|