/modules/softcam/FFdecsa/parallel_generic.h

  1/* FFdecsa -- fast decsa algorithm
  2 *
  3 * Copyright (C) 2003-2004  fatih89r
  4 *
  5 * This program is free software; you can redistribute it and/or modify
  6 * it under the terms of the GNU General Public License as published by
  7 * the Free Software Foundation; either version 2 of the License, or
  8 * (at your option) any later version.
  9 *
 10 * This program is distributed in the hope that it will be useful,
 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 13 * GNU General Public License for more details.
 14 *
 15 * You should have received a copy of the GNU General Public License
 16 * along with this program; if not, write to the Free Software
 17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 18 */
 19
 20
 21
 22#if 0
 23//// generics
 24#define COPY4BY(d,s)     do{ int *pd=(int *)(d), *ps=(int *)(s); \
 25                             *pd = *ps; }while(0)
 26#define COPY8BY(d,s)     do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 27                             *pd = *ps; }while(0)
 28#define COPY16BY(d,s)    do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 29                             *pd = *ps; \
 30			     *(pd+1) = *(ps+1); }while(0)
 31#define COPY32BY(d,s)    do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 32                             *pd = *ps; \
 33			     *(pd+1) = *(ps+1) \
 34			     *(pd+2) = *(ps+2) \
 35			     *(pd+3) = *(ps+3); }while(0)
 36#define XOR4BY(d,s1,s2)  do{ int *pd=(int *)(d), *ps1=(int *)(s1), *ps2=(int *)(s2); \
 37                             *pd = *ps1  ^ *ps2; }while(0)
 38#define XOR8BY(d,s1,s2)  do{ long long int *pd=(long long int *)(d), *ps1=(long long int *)(s1), *ps2=(long long int *)(s2); \
 39                             *pd = *ps1  ^ *ps2; }while(0)
 40#define XOR16BY(d,s1,s2) do{ long long int *pd=(long long int *)(d), *ps1=(long long int *)(s1), *ps2=(long long int *)(s2); \
 41                             *pd = *ps1  ^ *ps2; \
 42                             *(pd+8) = *(ps1+8)  ^ *(ps2+8); }while(0)
 43#define XOR32BY(d,s1,s2) do{ long long int *pd=(long long int *)(d), *ps1=(long long int *)(s1), *ps2=(long long int *)(s2); \
 44                             *pd = *ps1  ^ *ps2; \
 45                             *(pd+1) = *(ps1+1)  ^ *(ps2+1); \
 46                             *(pd+2) = *(ps1+2)  ^ *(ps2+2); \
 47                             *(pd+3) = *(ps1+3)  ^ *(ps2+3); }while(0)
 48#define XOR32BV(d,s1,s2) do{ int *const pd=(int *const)(d), *ps1=(const int *const)(s1), *ps2=(const int *const)(s2); \
 49                             int z; \
 50			     for(z=0;z<8;z++){ \
 51                               pd[z]=ps1[z]^ps2[z]; \
 52			     } \
 53                           }while(0)
 54#define XOREQ4BY(d,s)    do{ int *pd=(int *)(d), *ps=(int *)(s); \
 55                             *pd ^= *ps; }while(0)
 56#define XOREQ8BY(d,s)    do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 57                             *pd ^= *ps; }while(0)
 58#define XOREQ16BY(d,s)   do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 59                             *pd ^= *ps; \
 60			     *(pd+1) ^=*(ps+1); }while(0)
 61#define XOREQ32BY(d,s)   do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 62                             *pd ^= *ps; \
 63			     *(pd+1) ^=*(ps+1); \
 64			     *(pd+2) ^=*(ps+2); \
 65			     *(pd+3) ^=*(ps+3); }while(0)
 66#define XOREQ32BY4(d,s)  do{ int *pd=(int *)(d), *ps=(int *)(s); \
 67                             *pd ^= *ps; \
 68			     *(pd+1) ^=*(ps+1); \
 69			     *(pd+2) ^=*(ps+2); \
 70			     *(pd+3) ^=*(ps+3); \
 71			     *(pd+4) ^=*(ps+4); \
 72			     *(pd+5) ^=*(ps+5); \
 73			     *(pd+6) ^=*(ps+6); \
 74			     *(pd+7) ^=*(ps+7); }while(0)
 75#define XOREQ32BV(d,s)   do{ unsigned char *pd=(unsigned char *)(d), *ps=(unsigned char *)(s); \
 76                             int z; \
 77			     for(z=0;z<32;z++){ \
 78                               pd[z]^=ps[z]; \
 79			     } \
 80                           }while(0)
 81
 82#else
 83#define XOR_4_BY(d,s1,s2)    do{ int *pd=(int *)(d), *ps1=(int *)(s1), *ps2=(int *)(s2); \
 84                               *pd = *ps1  ^ *ps2; }while(0)
 85#define XOR_8_BY(d,s1,s2)    do{ long long int *pd=(long long int *)(d), *ps1=(long long int *)(s1), *ps2=(long long int *)(s2); \
 86                               *pd = *ps1  ^ *ps2; }while(0)
 87#define XOREQ_4_BY(d,s)      do{ int *pd=(int *)(d), *ps=(int *)(s); \
 88                               *pd ^= *ps; }while(0)
 89#define XOREQ_8_BY(d,s)      do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 90                               *pd ^= *ps; }while(0)
 91#define COPY_4_BY(d,s)       do{ int *pd=(int *)(d), *ps=(int *)(s); \
 92                               *pd = *ps; }while(0)
 93#define COPY_8_BY(d,s)       do{ long long int *pd=(long long int *)(d), *ps=(long long int *)(s); \
 94                               *pd = *ps; }while(0)
 95
 96#define BEST_SPAN            8
 97#define XOR_BEST_BY(d,s1,s2) do{ XOR_8_BY(d,s1,s2); }while(0);
 98#define XOREQ_BEST_BY(d,s)   do{ XOREQ_8_BY(d,s); }while(0);
 99#define COPY_BEST_BY(d,s)    do{ COPY_8_BY(d,s); }while(0);
100
101#define END_MM             do{ }while(0);
102#endif