1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*
Miranda IM: the free IM client for Microsoft* Windows*
Copyright 2000-12 Miranda IM, 2012-13 Miranda NG project,
all portions of this codebase are copyrighted to the people
listed in contributors.txt.
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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "..\..\core\commonheaders.h"
//VERY VERY VERY BASIC ENCRYPTION FUNCTION
void Encrypt(char*msg, BOOL up)
{
int jump;
if (up)
jump = 5;
else
jump = -5;
for (int i = 0; msg[i]; i++)
msg[i] = msg[i] + jump;
}
static INT_PTR EncodeString(WPARAM wParam, LPARAM lParam)
{
Encrypt((char*)lParam, TRUE);
return 0;
}
static INT_PTR DecodeString(WPARAM wParam, LPARAM lParam)
{
Encrypt((char*)lParam, FALSE);
return 0;
}
/////////////////////////////////////////////////////////////////////////////////////////
static int CompareFunc(const CRYPTO_PROVIDER *p1, const CRYPTO_PROVIDER *p2)
{
return strcmp(p1->pszName, p2->pszName);
}
static LIST<CRYPTO_PROVIDER> arProviders(5, CompareFunc);
static INT_PTR srvRegister(WPARAM wParam, LPARAM lParam)
{
CRYPTO_PROVIDER *p = (CRYPTO_PROVIDER*)lParam;
if (p == NULL || p->dwSize != sizeof(CRYPTO_PROVIDER))
return 1;
CRYPTO_PROVIDER *pNew = new CRYPTO_PROVIDER(*p);
pNew->pszName = mir_strdup(p->pszName);
if (pNew->dwFlags & CPF_UNICODE)
pNew->ptszDescr = mir_u2t(TranslateW_LP(p->pwszDescr, wParam));
else
pNew->ptszDescr = mir_a2t(TranslateA_LP(p->pszDescr, wParam));
arProviders.insert(pNew);
return 0;
}
static INT_PTR srvEnumProviders(WPARAM wParam, LPARAM lParam)
{
if (wParam && lParam) {
*(int*)wParam = arProviders.getCount();
*(CRYPTO_PROVIDER***)lParam = arProviders.getArray();
}
return 0;
}
/////////////////////////////////////////////////////////////////////////////////////////
int InitCrypt(void)
{
CreateServiceFunction(MS_DB_CRYPT_ENCODESTRING, EncodeString);
CreateServiceFunction(MS_DB_CRYPT_DECODESTRING, DecodeString);
CreateServiceFunction(MS_CRYPTO_REGISTER_ENGINE, srvRegister);
CreateServiceFunction(MS_CRYPTO_ENUM_PROVIDERS, srvEnumProviders);
return 0;
}
void UninitCrypt(void)
{
for (int i = 0; i < arProviders.getCount(); i++) {
CRYPTO_PROVIDER *p = arProviders[i];
mir_free(p->pszName);
mir_free(p->pszDescr);
delete p;
}
arDbPlugins.destroy();
}
|