|
SASC
DVBSoftCAM
|
00001 /* FFdecsa -- fast decsa algorithm 00002 * 00003 * Copyright (C) 2007 Dark Avenger 00004 * 2003-2004 fatih89r 00005 * 00006 * This program is free software; you can redistribute it and/or modify 00007 * it under the terms of the GNU General Public License as published by 00008 * the Free Software Foundation; either version 2 of the License, or 00009 * (at your option) any later version. 00010 * 00011 * This program is distributed in the hope that it will be useful, 00012 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 * GNU General Public License for more details. 00015 * 00016 * You should have received a copy of the GNU General Public License 00017 * along with this program; if not, write to the Free Software 00018 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 00019 */ 00020 00021 #include <mmintrin.h> 00022 00023 #define MEMALIGN_VAL 16 00024 00025 union __u64 { 00026 unsigned int u[2]; 00027 __m64 v; 00028 }; 00029 00030 static const union __u64 ff0 = {{0x00000000U, 0x00000000U}}; 00031 static const union __u64 ff1 = {{0xffffffffU, 0xffffffffU}}; 00032 00033 typedef __m64 group; 00034 #define GROUP_PARALLELISM 64 00035 #define FF0() ff0.v 00036 #define FF1() ff1.v 00037 #define FFAND(a,b) _mm_and_si64((a),(b)) 00038 #define FFOR(a,b) _mm_or_si64((a),(b)) 00039 #define FFXOR(a,b) _mm_xor_si64((a),(b)) 00040 #define FFNOT(a) _mm_xor_si64((a),FF1()) 00041 00042 /* 64 rows of 64 bits */ 00043 00044 static const union __u64 ff29 = {{0x29292929U, 0x29292929U}}; 00045 static const union __u64 ff02 = {{0x02020202U, 0x02020202U}}; 00046 static const union __u64 ff04 = {{0x04040404U, 0x04040404U}}; 00047 static const union __u64 ff10 = {{0x10101010U, 0x10101010U}}; 00048 static const union __u64 ff40 = {{0x40404040U, 0x40404040U}}; 00049 static const union __u64 ff80 = {{0x80808080U, 0x80808080U}}; 00050 00051 typedef __m64 batch; 00052 #define BYTES_PER_BATCH 8 00053 #define B_FFAND(a,b) FFAND((a),(b)) 00054 #define B_FFOR(a,b) FFOR((a),(b)) 00055 #define B_FFXOR(a,b) FFXOR((a),(b)) 00056 #define B_FFN_ALL_29() ff29.v 00057 #define B_FFN_ALL_02() ff02.v 00058 #define B_FFN_ALL_04() ff04.v 00059 #define B_FFN_ALL_10() ff10.v 00060 #define B_FFN_ALL_40() ff40.v 00061 #define B_FFN_ALL_80() ff80.v 00062 #define B_FFSH8L(a,n) _mm_slli_si64((a),(n)) 00063 #define B_FFSH8R(a,n) _mm_srli_si64((a),(n)) 00064 00065 #define M_EMPTY() _mm_empty() 00066 00067 00068 #undef XOR_8_BY 00069 #define XOR_8_BY(d,s1,s2) do { *(__m64*)d = _mm_xor_si64(*(__m64*)(s1), *(__m64*)(s2)); } while(0) 00070 00071 #undef XOREQ_8_BY 00072 #define XOREQ_8_BY(d,s) XOR_8_BY(d, d, s) 00073 00074 #undef COPY_8_BY 00075 #define COPY_8_BY(d,s) do { *(__m64 *)(d) = *(__m64 *)(s); } while(0) 00076 00077 #undef BEST_SPAN 00078 #define BEST_SPAN 8 00079 00080 #undef XOR_BEST_BY 00081 #define XOR_BEST_BY(d,s1,s2) XOR_8_BY(d,s1,s2) 00082 00083 #include "fftable.h"