Topic: How to improve the computing speed of MD5

[d2010]

syz-md5.fas is implemented by calling the system api with pure lsp.

and this is great news, baitang36
well done
i think it brings lisp to a new level

Do you CormanLisp is more-fast than Visual-Lisp?
How to calculate the speed  of "CormanLisp"?

[It's Alive!]

syz-md5.fas is implemented by calling the system api with pure lsp.

and this is great news, baitang36
well done
i think it brings lisp to a new level

Do you CormanLisp is more-fast than Visual-Lisp?
How to calculate the speed  of "CormanLisp"?

Extending Autolisp with ObjextARX, in a general sense, is flawed because AutoCAD tries to translate some data structures.
For example, if you send  '(220 float float float)  from Autolisp to Arx, AutoCAD will crash with a LsAdsInvoke Internal Error.
'(10 float float float)  and you just a get a point on the arx side, so there's overhead of converting data structures back

However, like in this case, a MD5 routine, where the arguments are predetermined, Extending Autolisp with ObjextARX can be useful

[It's Alive!]

Someone can test the performance of this. compiled for BricsCADv22 and autocad 2021-23 and the source is included

it's not optimal because I'm using all 8 bytes for each element, this list would only need 2 bytes for each.
it should generate a hash for any list. 

[It's Alive!]

this one is slightly better, I didn't include NIL or T.. is it needed?

Code - C: [Select]

1.     union uINT16Data
2.     {
3.         int16_t val;
4.         BYTE buf[2];
5.     };
6.     union uINT32Data
7.     {
8.         int32_t val;
9.         BYTE buf[4];
10.     };
11.     union uINT64Data
12.     {
13.         int64_t val;
14.         BYTE buf[8];
15.     };
16.     union uDOUBLEData
17.     {
18.         double_t val;
19.         BYTE buf[8];
20.     };
21.  
22.     //(ads_md5 '(39 50 50 5 33 36 37 37 25 29 31 32 32 1 19 24 24 25 28 29 13 14 14 17 18 21 21 23 12))
23.     static int ads_ads_md5(void)
24.     {
25.         constexpr size_t MD5LEN = 16;
26.         constexpr CHAR rgbDigits[] = "0123456789abcdef";
27.  
28.         HCRYPTPROV hProv = 0;
29.         HCRYPTHASH hHash = 0;
30.         BYTE rgbHash[MD5LEN];
31.         DWORD cbHash = 0, dwStatus = 0;
32.         std::vector<BYTE> bytes;
33.  
34.         unique_resbuf_ptr pArgs(acedGetArgs());
35.  
36.         for (resbuf* pTail = pArgs.get(); pTail != nullptr; pTail = pTail->rbnext)
37.         {
38.             switch (pTail->restype)
39.             {
40.                 case RTSHORT:
41.                 {
42.                     uINT16Data dbl{ pTail->resval.rint };
43.                     for (size_t idx = 0; idx < 2; idx++)
44.                         bytes.push_back(dbl.buf[idx]);
45.                 }
46.                 break;
47.                 case RTLONG:
48.                 {
49.                     uINT32Data dbl{ pTail->resval.rlong };
50.                     for (size_t idx = 0; idx < 4; idx++)
51.                         bytes.push_back(dbl.buf[idx]);
52.                 }
53.                 break;
54.                 case RTREAL:
55.                 {
56.                     uDOUBLEData dbl{ pTail->resval.rreal };
57.                     for (size_t idx = 0; idx < 8; idx++)
58.                         bytes.push_back(dbl.buf[idx]);
59.                 }
60.                 break;
61.                 case RTPOINT:
62.                 {
63.                     {
64.                         uDOUBLEData dbl{ pTail->resval.rpoint[0] };
65.                         for (size_t idx = 0; idx < 8; idx++)
66.                             bytes.push_back(dbl.buf[idx]);
67.                     }
68.                     {
69.                         uDOUBLEData dbl{ pTail->resval.rpoint[1] };
70.                         for (size_t idx = 0; idx < 8; idx++)
71.                             bytes.push_back(dbl.buf[idx]);
72.                     }
73.                 }
74.                 break;
75.                 case RT3DPOINT:
76.                 {
77.                     {
78.                         uDOUBLEData dbl{ pTail->resval.rpoint[0] };
79.                         for (size_t idx = 0; idx < 8; idx++)
80.                             bytes.push_back(dbl.buf[idx]);
81.                     }
82.                     {
83.                         uDOUBLEData dbl{ pTail->resval.rpoint[1] };
84.                         for (size_t idx = 0; idx < 8; idx++)
85.                             bytes.push_back(dbl.buf[idx]);
86.                     }
87.                     {
88.                         uDOUBLEData dbl{ pTail->resval.rpoint[2] };
89.                         for (size_t idx = 0; idx < 8; idx++)
90.                             bytes.push_back(dbl.buf[idx]);
91.                     }
92.                 }
93.                 break;
94.                 case RTSTR:
95.                 {
96.                     std::string str = wstr_to_utf8(pTail->resval.rstring);
97.                     for (auto ch : str)
98.                         bytes.push_back(ch);
99.                 }
100.                 break;
101.                 default:
102.                     break;
103.             }
104.         }
105.         if (!CryptAcquireContext(&hProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
106.         {
107.             dwStatus = GetLastError();
108.             acutPrintf(L"CryptAcquireContext failed: %d\n", dwStatus);
109.             acedRetNil();
110.             return (RSRSLT);
111.         }
112.  
113.         if (!CryptCreateHash(hProv, CALG_MD5, 0, 0, &hHash))
114.         {
115.             dwStatus = GetLastError();
116.             acutPrintf(L"CryptAcquireContext failed: %d\n", dwStatus);
117.             acedRetNil();
118.             return (RSRSLT);
119.         }
120.  
121.         if (!CryptHashData(hHash, bytes.data(), bytes.size(), 0))
122.         {
123.             dwStatus = GetLastError();
124.             acutPrintf(L"CryptHashData failed: %d\n", dwStatus);
125.             CryptReleaseContext(hProv, 0);
126.             CryptDestroyHash(hHash);
127.             acedRetNil();
128.             return dwStatus;
129.         }
130.  
131.         CString hash;
132.         cbHash = MD5LEN;
133.         if (CryptGetHashParam(hHash, HP_HASHVAL, rgbHash, &cbHash, 0))
134.         {
135.             for (DWORD i = 0; i < cbHash; i++)
136.             {
137.                 hash += (wchar_t(rgbDigits[rgbHash[i] >> 4]));
138.                 hash += (wchar_t(rgbDigits[rgbHash[i] & 0xf]));
139.             }
140.             acedRetStr(hash);
141.         }
142.         else
143.         {
144.             dwStatus = GetLastError();
145.             acutPrintf(L"CryptGetHashParam failed: %d\n", dwStatus);
146.         }
147.         CryptDestroyHash(hHash);
148.         CryptReleaseContext(hProv, 0);
149.         return (RSRSLT);
150.     }
151.  

[It's Alive!]

Actually, this could be handy for creating a hash map of lists... maybe

Code - Text: [Select]

1. (map of lists
2.   '("bada286cb105994eb4b2426308dee64d" 39 50 50 5 33 36 37 37 25 29 31 32 32 1 19 24 24 25 28 29 13 14 14 17 18 21 21 23 12)
3.   '("100d9e9bc0ef4990807d95c7faebaba0" 39 50 50 5 33 36 37 37 25 29 31 32 32 1 19 24 24 25 28 29 13 14 14 17 18 21 21 23 32)
4.    ...
5. )

[Lee Mac]

Here's an incredibly slow one... mostly due to the fact that I had to represent 32-bit unsigned integers as lists of binary digits (as AutoLISP only has signed 32-bit integers), and then recreate list equivalents to the lsh & boole functions (which can only operate on 32-bit signed integers) to perform the various bitwise operations... 

[It's Alive!]

Awesome code LM!

[Lee Mac]

Thanks Daniel 

[xdcad]

syz-md5.fas is implemented by calling the system api with pure lsp

when this possibility will be available for the normal people ?

(xdrx-file-md5hash fn)
(xdrx-string-md5hash "abcdefg")

Command: (xdrx-string-md5hash "abcdefg")
"7ac66c0f148de9519b8bd264312c4d64"