我的代码为何如此之慢！？请大家帮我看看！

roline 2006-06-21 11:17:14

我写了一工程来加密和解密文件，并把加密和解密后生成的文件分别存放在不同的文件之中以便查看。我试过了，对比较小点的文件还可以，可是一旦遇到稍微大一点的就犯病，运行速度奇慢，一个接近十兆的可执行文件居然光是加密就花了整整两分钟，这还是电脑的速度么？我百思不得其解，只好求助各位大虾了。主要代码如下：

// initial permutation IP
const static char IP_Table[64] = {
58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4,
62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8,
57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3,
61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7
};
// final permutation IP^-1
const static char IPR_Table[64] = {
40, 8, 48, 16, 56, 24, 64, 32, 39, 7, 47, 15, 55, 23, 63, 31,
38, 6, 46, 14, 54, 22, 62, 30, 37, 5, 45, 13, 53, 21, 61, 29,
36, 4, 44, 12, 52, 20, 60, 28, 35, 3, 43, 11, 51, 19, 59, 27,
34, 2, 42, 10, 50, 18, 58, 26, 33, 1, 41, 9, 49, 17, 57, 25
};
// expansion operation matrix
static const char E_Table[48] = {
32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9,
8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17,
16, 17, 18, 19, 20, 21, 20, 21, 22, 23, 24, 25,
24, 25, 26, 27, 28, 29, 28, 29, 30, 31, 32, 1
};
// 32-bit permutation function P used on the output of the S-boxes
const static char P_Table[32] = {
16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10,
2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25
};
// permuted choice table (key)
const static char PC1_Table[56] = {
57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18,
10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36,
63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22,
14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4
};
// permuted choice key (table)
const static char PC2_Table[48] = {
14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10,
23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2,
41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48,
44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32
};
// number left rotations of pc1
const static char LOOP_Table[16] = {
1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1
};
// The (in)famous S-boxes
const static char S_Box[8][4][16] = {
// S1
14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13,
// S2
15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9,
// S3
10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12,
// S4
7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14,
// S5
2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3,
// S6
12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13,
// S7
4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12,
// S8
13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11
};

void CEcfileDlg::OnE()
{
UpdateData(TRUE);
if(m_path == "")
{
AfxMessageBox("请选择要加密的文件!");
return;
}

UpdateData(TRUE);
if(ecfile(m_path))
{
MessageBox("加密成功!");
}
else
{
MessageBox("加密失败!");
}
}

void CEcfileDlg::OnD()
{
UpdateData(TRUE);
if(m_path == "")
{
AfxMessageBox("请选择要解密的文件!");
return;
}

UpdateData(TRUE);
if(dcfile(m_path))
{
MessageBox("解密成功!");
}
else
{
MessageBox("解密失败!");
}
}

void CEcfileDlg::OnBrow()
{
CFileDialog dlg(TRUE);
if(dlg.DoModal() == IDOK)
{
m_path = dlg.GetPathName();
UpdateData(FALSE);
}
else
{
return;
}
}

...全文

71 1 打赏收藏转发到动态举报

写回复

用AI写文章

1 条回复

切换为时间正序

请发表友善的回复…

发表回复

roline 2006-06-21

打赏
举报

关键代码如下：
//encrypt
BOOL CEcfileDlg::ecfile(LPCTSTR fpath)
{
int fh = _open(fpath, _O_RDONLY|_O_BINARY);
FILE *pEn = fopen("加密后.bin", "ab");

unsigned long flen = filelength(fh);
const long Max_Len = 1024*1024;
char *data;
data = new char[Max_Len];

if ((flen>Max_Len))
{
int counter = flen/Max_Len;
for (int i=0; i<counter; i++)
{
_read(fh, data, Max_Len-1);
Des_Go(data, data, Max_Len-1, key, sizeof(key), ENCRYPT);
fwrite(data, 1, Max_Len-1, pEn);
memset(data, 0, Max_Len);
}
flen -=(counter*(Max_Len-1));
_read(fh, data, flen);
Des_Go(data, data, flen, key, sizeof(key), ENCRYPT);
fwrite(data, 1, flen, pEn);
memset(data, 0, Max_Len);
_close(fh);
fclose(pEn);
}
else{
_read(fh, data, flen);
Des_Go(data, data, flen, key, sizeof(key), ENCRYPT);
fwrite(data, 1, flen, pEn);
memset(data, 0, Max_Len);
_close(fh);
fclose(pEn);
}
delete[] data;
return TRUE;
}

BOOL CEcfileDlg::dcfile(LPCTSTR fpath)
{
char *data;
int fh1 = _open("加密后.bin", _O_RDONLY|_O_BINARY);
FILE *pDe = fopen("解密后.bin", "wb");
unsigned long flen = filelength(fh1);
const long Max_Len = 1024*1024;
data = new char[Max_Len];
if ((flen>Max_Len))
{
int counter = flen/Max_Len;
for (int i=0; i<counter; i++)
{
_read(fh1, data, Max_Len-1);
Des_Go(data, data, Max_Len-1, key, sizeof(key), DECRYPT);
fwrite(data, 1, Max_Len-1, pDe);
memset(data, 0, Max_Len);
}
flen -=(counter*(Max_Len-1));
_read(fh1, data, flen);
Des_Go(data, data, flen, key, sizeof(key), DECRYPT);
fwrite(data, 1, flen, pDe);
memset(data, 0, Max_Len);
_close(fh1);
fclose(pDe);
}
else{
_read(fh1, data, flen);
Des_Go(data, data, flen, key, sizeof(key), DECRYPT);
fwrite(data, 1, flen, pDe);
memset(data, 0, Max_Len);
_close(fh1);
fclose(pDe);
}
delete[] data;
return TRUE;
}

bool CEcfileDlg::Des_Go(char *Out, char *In, long datalen, const char *Key, int keylen, bool Type)
{
if( !( Out && In && Key && (datalen=(datalen+7)&0xfffffff8) ) )
return false;
SetKey(Key, keylen);
if( !Is3DES ) {
for(long i=0,j=datalen>>3; i<j; ++i,Out+=8,In+=8)
DES(Out, In, &SubKey[0], Type);
} else{
for(long i=0,j=datalen>>3; i<j; ++i,Out+=8,In+=8) {
DES(Out, In, &SubKey[0], Type);
DES(Out, Out, &SubKey[1], !Type);
DES(Out, Out, &SubKey[0], Type);
}
}
return true;
}

void CEcfileDlg::SetKey(const char *Key, int len)
{
memset(deskey, 0, 16);
memcpy(deskey, Key, len>16?16:len);
SetSubKey(&SubKey[0], &deskey[0]);
Is3DES = len>8 ? (SetSubKey(&SubKey[1], &deskey[8]), true) : false;
}

void CEcfileDlg::SetSubKey(PSubKey pSubKey, const char Key[])
{
static bool K[64], *KL=&K[0], *KR=&K[28];
ByteToBit(K, Key, 64);
Transform(K, K, PC1_Table, 56);
for(int i=0; i<16; ++i) {
RotateL(KL, 28, LOOP_Table[i]);
RotateL(KR, 28, LOOP_Table[i]);
Transform((*pSubKey)[i], K, PC2_Table, 48);
}
}

void CEcfileDlg::DES(char Out[], char In[], const PSubKey pSubKey, bool Type)
{
static bool M[64], tmp[32], *Li=&M[0], *Ri=&M[32];
ByteToBit(M, In, 64);
Transform(M, M, IP_Table, 64);
if( Type == ENCRYPT ){
for(int i=0; i<16; ++i) {
memcpy(tmp, Ri, 32);
F_func(Ri, (*pSubKey)[i]);
Xor(Ri, Li, 32);
memcpy(Li, tmp, 32);
}
}else{
for(int i=15; i>=0; --i) {
memcpy(tmp, Li, 32);
F_func(Li, (*pSubKey)[i]);
Xor(Li, Ri, 32);
memcpy(Ri, tmp, 32);
}
}
Transform(M, M, IPR_Table, 64);
BitToByte(Out, M, 64);
}

void CEcfileDlg::ByteToBit(bool *Out, const char *In, int bits)
{
for(int i=0; i<bits; ++i)
Out[i] = (In[i>>3]>>(i&7)) & 1;
}

void CEcfileDlg::BitToByte(char *Out, const bool *In, int bits)
{
memset(Out, 0, bits>>3);
for(int i=0; i<bits; ++i)
Out[i>>3] |= In[i]<<(i&7);
}

void CEcfileDlg::Transform(bool *Out, bool *In, const char *Table, int len)
{
for(int i=0; i<len; ++i)
Tmp[i] = In[ Table[i]-1 ];
memcpy(Out, Tmp, len);
}

void CEcfileDlg::RotateL(bool *In, int len, int loop)
{
memcpy(Tmp, In, loop);
memcpy(In, In+loop, len-loop);
memcpy(In+len-loop, Tmp, loop);
}

void CEcfileDlg::F_func(bool In[], const bool Ki[])
{
static bool MR[48];
Transform(MR, In, E_Table, 48);
Xor(MR, Ki, 48);
S_func(In, MR);
Transform(In, In, P_Table, 32);
}

void CEcfileDlg::S_func(bool Out[], const bool In[])
{
for(char i=0,j,k; i<8; ++i,In+=6,Out+=4)
{
j = (In[0]<<1) + In[5];
k = (In[1]<<3) + (In[2]<<2) + (In[3]<<1) + In[4];
ByteToBit(Out, &S_Box[i][j][k], 4);
}
}

void CEcfileDlg::Xor(bool *InA, const bool *InB, int len)
{
for(int i=0; i<len; ++i)
InA[i] ^= InB[i];
}

void CEcfileDlg::OnCancel()
{
OnOK();
}

我在BOOL CEcfileDlg::ecfile(LPCTSTR fpath)这个函数中下断点调试运行，发现每次循环到
Des_Go(data, data, Max_Len-1, key, sizeof(key), ENCRYPT);这条语句就有点卡，明显的慢很多。而且这个时候的CPU使用达到了100%，郁闷啊~~~

安装 # 安装playwright库 pip install playwright # 安装浏览器驱动文件 python -m playwright install #再安装 playwright install 要求：python版本3.7+ 使用Playwright无需写一行代码，我们只需手动操作浏览器，它会录制我们的操作，然后自动生成代码脚本。下面就是录制的命令codegen，仅仅一行。 python -m playwright codegen codegen的用法可以使用–help查看，如

【CSDN 编者按】相比一个人一种风格的代码，几乎人人都想编写一套“整洁”的代码，然而，遵循条条框框规则写出来的代码，在性能上能否可以达到理想状态？来自 Molly Rocket 公司的首席程序员 Casey Muratori 给出了否定的答案，与此同时，他也以教科书中的示例进行了测试，最终得出“遵循编写整洁代码的这些规则，你的代码运行速度会放慢 15 倍”的结论。不过，对于这样的结论也引发了巨大...

如果您精心设计的应用程序在部署后运行缓慢，则有五个常见原因，使其在开发计算机上运行良好，但在生产中却完全陷入了困境。当然，还有其他原因导致您的软件在生产中无法正常运行，但这是当开发人员说“它在我的机器上运行良好”然后发现大量生产对软件的重大责任时，我看到的最主要的原因。规模问题。 [InfoWorld的要点： CI / CD入门：使用CI / CD管道自动执行应用程序交付。 • C...

《极客时间：代码精进之路》学习笔记认知明确作为一名 Code Reviewer 的职责使用最直观的编码方式“好”代码与“坏”代码优秀的代码是“经济”的代码好的代码服务于整个软件生命周期优秀程序员的六个关键特质规范什么是编码规范？为什么需要编码规范？如何给代码起好名字？为什么需要一个好名字为什么需要命名规范？常见的命名方法如何取好名字？小结代码整理的关键逻辑给代码分块使用空白空间一行一个行为写好注释写好声明的八项原则处理好捕获异常经济为什么需要经济的代码？怎样避免过度设计？为什么写代码需要简单直观？如何让写代

程序员的代码行数越少越好？

VC/MFC

16,472

社区成员

421,731

社区内容

发帖

与我相关

我的任务

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

VC/MFC社区版块或许是CSDN最“古老”的版块了，记忆之中，与CSDN的年龄几乎差不多。随着时间的推移，MFC技术渐渐的偏离了开发主流，若干年之后的今天，当我们面对着微软的这个经典之笔，内心充满着敬意，那些曾经的记忆，可以说代表着二十年前曾经的辉煌……
向经典致敬，或许是老一代程序员内心里面难以释怀的感受。互联网大行其道的今天，我们期待着MFC技术能够恢复其曾经的辉煌，或许这个期待会永远成为一种“梦想”，或许一切皆有可能……
我们希望这个版块可以很好的适配Web时代，期待更好的互联网技术能够使得MFC技术框架得以重现活力，……

试试用AI创作助手写篇文章吧

+ 用AI写文章