-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdsum.cpp
More file actions
397 lines (308 loc) · 7.66 KB
/
dsum.cpp
File metadata and controls
397 lines (308 loc) · 7.66 KB
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
/*
* dsum.cpp
* Hash blocks of disk.
*
* Usage: dsum [opts]
*
* + /disk: Physical disk path.
* + /out: Output file.
* + /align: Alignment/size of contiguous disk to hash.
* + /hashsz: Size of output hash, in bytes; 1-20 (SHA1)
* /bytes: Amount of data to actually process, in bytes.
* /iosize: I/O (DMA) transfer size.
* /iodepth: I/O queue depth; hw queue depths: SATA=~32; NVMe=~256
* /threads: Thread count; SHA1 impl. is bad @ ~250MB/s; do the math for device bandwidth.
*
* + = required arg.
*
*/
#define _CRT_SECURE_NO_WARNINGS
#include <windows.h>
#include <stdio.h>
#include "sha1.h"
// Constants
#define MAX_QUEUE 1024
#define MAX_THREADS 64
// Round integer up to multiple.
#define ROUND_UP(n, m) ((((n) + (m) - 1) / m) * m)
// Hex-to-integer
#define hxi(c) (c & 0x40 ? (c & 0x0F) + 9 : (c & 0x0F))
// Out
#define LOG(fmt, ...) printf("\r\n" fmt, __VA_ARGS__)
// Parameters
UINT IO_BLOCK_SZ = 0x10000;
UINT QUEUE_DEPTH = 256;
UINT CHUNK_ALIGN = 0;
UINT HASH_SZ = 0;
UINT THREAD_COUNT = 0;
UINT64 DISK_BYTES = 0;
SIZE_T BLOCK_CHUNKS = 0;
// Globals
__declspec(align(64)) struct IRP
{
OVERLAPPED ov;
void* pData;
} IoRequest[MAX_QUEUE];
HANDLE hDisk;
HANDLE hIOCP;
UINT64 QpcFreq;
UINT64 BlockCount;
UINT64 BlockPtr;
BYTE* pOut;
CRITICAL_SECTION cs;
UINT64 HPC()
{
UINT64 qpc;
QueryPerformanceCounter((LARGE_INTEGER*) &qpc);
return qpc;
}
DWORD HPCus(UINT64 hpc)
{
hpc *= 1000000;
hpc /= QpcFreq;
return (UINT32) hpc;
}
bool GetArg(const char* pName, void* p, bool bInteger)
{
if(!(pName = strstr(GetCommandLine(), pName)))
return false;
while(*pName != ':')
pName++;
while(*++pName == ' ')
pName++;
char delim = ' ';
if(*pName == '"')
{
delim = '"';
pName++;
}
union
{
char* ps;
SIZE_T* pi;
};
ps = (char*) p;
pi = (SIZE_T*) p;
SIZE_T Base = 10;
if(bInteger)
{
*pi = 0;
if(pName[0] == '0' && pName[1] == 'x')
{
Base = 16;
pName += 2;
}
}
while(*pName && *pName != delim)
{
if(bInteger)
{
*pi *= Base;
*pi += hxi(*pName);
}
else
*ps++ = *pName;
pName++;
}
if(!bInteger)
*ps = '\0';
return true;
}
ULONG_PTR GetCoreMask()
{
SYSTEM_LOGICAL_PROCESSOR_INFORMATION pi[128];
DWORD Result = sizeof(pi);
ULONG_PTR Mask = 0;
if(!GetLogicalProcessorInformation(pi, &Result))
return 0;
Result /= sizeof(SYSTEM_LOGICAL_PROCESSOR_INFORMATION);
for(SYSTEM_LOGICAL_PROCESSOR_INFORMATION* p = pi; Result; p++, Result--)
{
if(p->Relationship == RelationProcessorCore)
Mask |= p->ProcessorMask;
}
return Mask;
}
bool SubmitIo(IRP* pIRP)
{
ULARGE_INTEGER DiskAddr;
DWORD Result;
DiskAddr.QuadPart = InterlockedExchangeAdd64((volatile LONGLONG*) &BlockPtr, 1);
if(DiskAddr.QuadPart >= BlockCount)
{
LOG("Thread#%u complete", GetCurrentThreadId());
return false;
}
DiskAddr.QuadPart *= IO_BLOCK_SZ;
pIRP->ov.Offset = DiskAddr.LowPart;
pIRP->ov.OffsetHigh = DiskAddr.HighPart;
if(!ReadFile(hDisk, pIRP->pData, IO_BLOCK_SZ, &Result, &pIRP->ov) && GetLastError() != ERROR_IO_PENDING)
return false;
return true;
}
DWORD WINAPI WorkerEntry(VOID*)
{
ULONG_PTR Key;
DWORD Result;
ULARGE_INTEGER Chunk;
IRP* pIRP;
char Digest[20];
for(;;)
{
if(!GetQueuedCompletionStatus(hIOCP, &Result, &Key, (LPOVERLAPPED*) &pIRP, INFINITE))
{
LOG("Failed to wait on IOCP");
return 0;
}
Chunk.LowPart = pIRP->ov.Offset;
Chunk.HighPart = pIRP->ov.OffsetHigh;
Chunk.QuadPart /= CHUNK_ALIGN;
BYTE* pHash = pOut + (Chunk.QuadPart * HASH_SZ);
BYTE* pData = (BYTE*) pIRP->pData;
for(DWORD i = 0; i < BLOCK_CHUNKS; i++)
{
SHA1((char*) Digest, (const char*) pData, CHUNK_ALIGN);
memcpy(pHash, Digest, HASH_SZ);
pHash += HASH_SZ;
pData += CHUNK_ALIGN;
}
if(!SubmitIo(pIRP))
break;
}
return 0;
}
int Entry()
{
HANDLE hOut;
HANDLE hScn;
DWORD Result;
UINT64 TrueDiskSize;
DISK_GEOMETRY_EX DiskGeometry;
QueryPerformanceFrequency((LARGE_INTEGER*) &QpcFreq);
char TmpPath[MAX_PATH];
char DiskPath[MAX_PATH]; //\\\\.\\PhysicalDrive0"
char OutPath[MAX_PATH];
if(!GetArg("/disk:", TmpPath, false))
{
LOG("Missing /disk");
return -1;
}
GetFullPathName(TmpPath, sizeof(DiskPath), DiskPath, NULL);
if(!GetArg("/out:", TmpPath, false))
{
LOG("Missing /out");
return -1;
}
GetFullPathName(TmpPath, sizeof(OutPath), OutPath, NULL);
if(!GetArg("/align:", &CHUNK_ALIGN, true))
{
LOG("Missing /align");
return -1;
}
if(!GetArg("/hashsz:", &HASH_SZ, true))
{
LOG("Missing /hashsz");
return -1;
}
if(!HASH_SZ || HASH_SZ > 20)
{
LOG("Invalid hash size; valid: 1-20");
return -1;
}
GetArg("/threads:", &THREAD_COUNT, true);
GetArg("/iosize:", &IO_BLOCK_SZ, true);
GetArg("/iodepth:", &QUEUE_DEPTH, true);
GetArg("/bytes:", &DISK_BYTES, true);
if(CHUNK_ALIGN > IO_BLOCK_SZ)
{
LOG("Invalid alignment; must be smaller than I/O size. %u > %u == true", CHUNK_ALIGN, IO_BLOCK_SZ);
return -1;
}
if(IO_BLOCK_SZ % CHUNK_ALIGN)
{
LOG("Invalid I/O size; must be divisible by alignment. %u %% %u != false", IO_BLOCK_SZ, CHUNK_ALIGN);
return -1;
}
BLOCK_CHUNKS = IO_BLOCK_SZ / CHUNK_ALIGN;
DWORD CoreCount = (DWORD) __popcnt64(GetCoreMask());
if(THREAD_COUNT > CoreCount)
{
THREAD_COUNT = CoreCount;
LOG("WARNING: Desired thread count greater than available cores.");
}
if(!THREAD_COUNT)
THREAD_COUNT = CoreCount;
if((hDisk = CreateFile(DiskPath, GENERIC_READ, FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE, NULL, OPEN_EXISTING, FILE_FLAG_OVERLAPPED | FILE_FLAG_NO_BUFFERING, NULL)) == INVALID_HANDLE_VALUE)
{
LOG("Failed to open disk device '%s' -- %u", DiskPath, GetLastError());
return -1;
}
if(!DeviceIoControl(hDisk, IOCTL_DISK_GET_DRIVE_GEOMETRY_EX, NULL, NULL, &DiskGeometry, sizeof(DiskGeometry), &Result, NULL))
{
LOG("Failed to fetch disk geometry.");
return -1;
}
TrueDiskSize = DiskGeometry.DiskSize.QuadPart;
if(DISK_BYTES > TrueDiskSize)
{
DISK_BYTES = TrueDiskSize;
LOG("WARNING: Desired size greater than actual disk size.");
}
if(!DISK_BYTES)
DISK_BYTES = TrueDiskSize;
DISK_BYTES = ROUND_UP(DISK_BYTES, IO_BLOCK_SZ);
BlockCount = DISK_BYTES / IO_BLOCK_SZ;
ULARGE_INTEGER ChunkTotal;
ChunkTotal.QuadPart = (DISK_BYTES / CHUNK_ALIGN) * HASH_SZ;
LOG("-------------------------------");
LOG("Disk path: '%s'", DiskPath);
LOG("Out path: '%s'", OutPath);
LOG("Disk read: %I64u bytes", DISK_BYTES);
LOG("I/O block size: %u bytes", IO_BLOCK_SZ);
LOG("Chunk align: %u bytes", CHUNK_ALIGN);
LOG("Thread count: %u", THREAD_COUNT);
LOG("Output file size: %I64u bytes", ChunkTotal.QuadPart);
if((hOut = CreateFile(OutPath, GENERIC_ALL, NULL, NULL, CREATE_ALWAYS, NULL, NULL)) == INVALID_HANDLE_VALUE)
{
LOG("Failed to open output file -- %u", GetLastError());
return -1;
}
if(!(hScn = CreateFileMapping(hOut, NULL, PAGE_READWRITE, ChunkTotal.HighPart, ChunkTotal.LowPart, NULL)) || !(pOut = (BYTE*) MapViewOfFile(hScn, FILE_MAP_ALL_ACCESS, 0, 0, 0)))
{
LOG("Failed to map output file -- %u", GetLastError());
return -1;
}
if(!(hIOCP = CreateIoCompletionPort(hDisk, NULL, NULL, NULL)))
{
LOG("Failed to create IOCP");
return -1;
}
for(DWORD i = 0; i < QUEUE_DEPTH; i++)
{
if(!(IoRequest[i].pData = VirtualAlloc(NULL, IO_BLOCK_SZ, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE)))
{
LOG("Failed to allocate I/O buffer");
return -1;
}
if(!SubmitIo(&IoRequest[i]))
{
LOG("Failed to begin I/O");
return -1;
}
}
HANDLE hThread[64];
for(DWORD i = 0; i < THREAD_COUNT; i++)
{
if(!(hThread[i] = CreateThread(NULL, 0x1000, &WorkerEntry, NULL, NULL, NULL)))
{
LOG("Failed to create thread.");
return -1;
}
}
WaitForMultipleObjects(THREAD_COUNT, hThread, TRUE, INFINITE);
LOG("Done.");
}
int main()
{
Entry();
}