📄 parallel_128_4int.h
字号:
/* FFdecsa -- fast decsa algorithm * * Copyright (C) 2003-2004 fatih89r * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */struct group_t{ unsigned int s1,s2,s3,s4;};typedef struct group_t group;#define GROUP_PARALLELISM 128group static inline FF0(){ group res; res.s1=0x0; res.s2=0x0; res.s3=0x0; res.s4=0x0; return res;}group static inline FF1(){ group res; res.s1=0xffffffff; res.s2=0xffffffff; res.s3=0xffffffff; res.s4=0xffffffff; return res;}group static inline FFAND(group a,group b){ group res; res.s1=a.s1&b.s1; res.s2=a.s2&b.s2; res.s3=a.s3&b.s3; res.s4=a.s4&b.s4; return res;}group static inline FFOR(group a,group b){ group res; res.s1=a.s1|b.s1; res.s2=a.s2|b.s2; res.s3=a.s3|b.s3; res.s4=a.s4|b.s4; return res;}group static inline FFXOR(group a,group b){ group res; res.s1=a.s1^b.s1; res.s2=a.s2^b.s2; res.s3=a.s3^b.s3; res.s4=a.s4^b.s4; return res;}group static inline FFNOT(group a){ group res; res.s1=~a.s1; res.s2=~a.s2; res.s3=~a.s3; res.s4=~a.s4; return res;}/* 64 rows of 128 bits */void static inline FFTABLEIN(unsigned char *tab, int g, unsigned char *data){ *(((int *)tab)+2*g)=*((int *)data); *(((int *)tab)+2*g+1)=*(((int *)data)+1);}void static inline FFTABLEOUT(unsigned char *data, unsigned char *tab, int g){ *((int *)data)=*(((int *)tab)+2*g); *(((int *)data)+1)=*(((int *)tab)+2*g+1);}void static inline FFTABLEOUTXORNBY(int n, unsigned char *data, unsigned char *tab, int g){ int j; for(j=0;j<n;j++){ *(data+j)^=*(tab+8*g+j); }}struct batch_t{ unsigned int s1,s2,s3,s4;};typedef struct batch_t batch;#define BYTES_PER_BATCH 16batch static inline B_FFAND(batch a,batch b){ batch res; res.s1=a.s1&b.s1; res.s2=a.s2&b.s2; res.s3=a.s3&b.s3; res.s4=a.s4&b.s4; return res;}batch static inline B_FFOR(batch a,batch b){ batch res; res.s1=a.s1|b.s1; res.s2=a.s2|b.s2; res.s3=a.s3|b.s3; res.s4=a.s4|b.s4; return res;}batch static inline B_FFXOR(batch a,batch b){ batch res; res.s1=a.s1^b.s1; res.s2=a.s2^b.s2; res.s3=a.s3^b.s3; res.s4=a.s4^b.s4; return res;}batch static inline B_FFN_ALL_29(){ batch res; res.s1=0x29292929; res.s2=0x29292929; res.s3=0x29292929; res.s4=0x29292929; return res;}batch static inline B_FFN_ALL_02(){ batch res; res.s1=0x02020202; res.s2=0x02020202; res.s3=0x02020202; res.s4=0x02020202; return res;}batch static inline B_FFN_ALL_04(){ batch res; res.s1=0x04040404; res.s2=0x04040404; res.s3=0x04040404; res.s4=0x04040404; return res;}batch static inline B_FFN_ALL_10(){ batch res; res.s1=0x10101010; res.s2=0x10101010; res.s3=0x10101010; res.s4=0x10101010; return res;}batch static inline B_FFN_ALL_40(){ batch res; res.s1=0x40404040; res.s2=0x40404040; res.s3=0x40404040; res.s4=0x40404040; return res;}batch static inline B_FFN_ALL_80(){ batch res; res.s1=0x80808080; res.s2=0x80808080; res.s3=0x80808080; res.s4=0x80808080; return res;}batch static inline B_FFSH8L(batch a,int n){ batch res; res.s1=a.s1<<n; res.s2=a.s2<<n; res.s3=a.s3<<n; res.s4=a.s4<<n; return res;}batch static inline B_FFSH8R(batch a,int n){ batch res; res.s1=a.s1>>n; res.s2=a.s2>>n; res.s3=a.s3>>n; res.s4=a.s4>>n; return res;}void static inline M_EMPTY(void){}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -