1 /* Unit test suite for Rtl* API functions
3 * Copyright 2003 Thomas Mertes
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 * We use function pointers here as there is no import library for NTDLL on
26 #include "ntdll_test.h"
28 #ifndef __WINE_WINTERNL_H
30 typedef struct _RTL_HANDLE
32 struct _RTL_HANDLE
* Next
;
35 typedef struct _RTL_HANDLE_TABLE
48 /* Function ptrs for ntdll calls */
49 static HMODULE hntdll
= 0;
50 static SIZE_T (WINAPI
*pRtlCompareMemory
)(LPCVOID
,LPCVOID
,SIZE_T
);
51 static SIZE_T (WINAPI
*pRtlCompareMemoryUlong
)(PULONG
, SIZE_T
, ULONG
);
52 static VOID (WINAPI
*pRtlMoveMemory
)(LPVOID
,LPCVOID
,SIZE_T
);
53 static VOID (WINAPI
*pRtlFillMemory
)(LPVOID
,SIZE_T
,BYTE
);
54 static VOID (WINAPI
*pRtlFillMemoryUlong
)(LPVOID
,SIZE_T
,ULONG
);
55 static VOID (WINAPI
*pRtlZeroMemory
)(LPVOID
,SIZE_T
);
56 static ULONGLONG (WINAPIV
*pRtlUlonglongByteSwap
)(ULONGLONG source
);
57 static ULONG (WINAPI
*pRtlUniform
)(PULONG
);
58 static ULONG (WINAPI
*pRtlRandom
)(PULONG
);
59 static BOOLEAN (WINAPI
*pRtlAreAllAccessesGranted
)(ACCESS_MASK
, ACCESS_MASK
);
60 static BOOLEAN (WINAPI
*pRtlAreAnyAccessesGranted
)(ACCESS_MASK
, ACCESS_MASK
);
61 static DWORD (WINAPI
*pRtlComputeCrc32
)(DWORD
,const BYTE
*,INT
);
62 static void (WINAPI
* pRtlInitializeHandleTable
)(ULONG
, ULONG
, RTL_HANDLE_TABLE
*);
63 static BOOLEAN (WINAPI
* pRtlIsValidIndexHandle
)(const RTL_HANDLE_TABLE
*, ULONG
, RTL_HANDLE
**);
64 static NTSTATUS (WINAPI
* pRtlDestroyHandleTable
)(RTL_HANDLE_TABLE
*);
65 static RTL_HANDLE
* (WINAPI
* pRtlAllocateHandle
)(RTL_HANDLE_TABLE
*, ULONG
*);
66 static BOOLEAN (WINAPI
* pRtlFreeHandle
)(RTL_HANDLE_TABLE
*, RTL_HANDLE
*);
67 static NTSTATUS (WINAPI
*pRtlAllocateAndInitializeSid
)(PSID_IDENTIFIER_AUTHORITY
,BYTE
,DWORD
,DWORD
,DWORD
,DWORD
,DWORD
,DWORD
,DWORD
,DWORD
,PSID
*);
68 static NTSTATUS (WINAPI
*pRtlFreeSid
)(PSID
);
70 static const char* src_src
= "This is a test!"; /* 16 bytes long, incl NUL */
71 static ULONG src_aligned_block
[4];
72 static ULONG dest_aligned_block
[32];
73 static const char *src
= (const char*)src_aligned_block
;
74 static char* dest
= (char*)dest_aligned_block
;
76 static void InitFunctionPtrs(void)
78 hntdll
= LoadLibraryA("ntdll.dll");
79 ok(hntdll
!= 0, "LoadLibrary failed\n");
81 pRtlCompareMemory
= (void *)GetProcAddress(hntdll
, "RtlCompareMemory");
82 pRtlCompareMemoryUlong
= (void *)GetProcAddress(hntdll
, "RtlCompareMemoryUlong");
83 pRtlMoveMemory
= (void *)GetProcAddress(hntdll
, "RtlMoveMemory");
84 pRtlFillMemory
= (void *)GetProcAddress(hntdll
, "RtlFillMemory");
85 pRtlFillMemoryUlong
= (void *)GetProcAddress(hntdll
, "RtlFillMemoryUlong");
86 pRtlZeroMemory
= (void *)GetProcAddress(hntdll
, "RtlZeroMemory");
87 pRtlUlonglongByteSwap
= (void *)GetProcAddress(hntdll
, "RtlUlonglongByteSwap");
88 pRtlUniform
= (void *)GetProcAddress(hntdll
, "RtlUniform");
89 pRtlRandom
= (void *)GetProcAddress(hntdll
, "RtlRandom");
90 pRtlAreAllAccessesGranted
= (void *)GetProcAddress(hntdll
, "RtlAreAllAccessesGranted");
91 pRtlAreAnyAccessesGranted
= (void *)GetProcAddress(hntdll
, "RtlAreAnyAccessesGranted");
92 pRtlComputeCrc32
= (void *)GetProcAddress(hntdll
, "RtlComputeCrc32");
93 pRtlInitializeHandleTable
= (void *)GetProcAddress(hntdll
, "RtlInitializeHandleTable");
94 pRtlIsValidIndexHandle
= (void *)GetProcAddress(hntdll
, "RtlIsValidIndexHandle");
95 pRtlDestroyHandleTable
= (void *)GetProcAddress(hntdll
, "RtlDestroyHandleTable");
96 pRtlAllocateHandle
= (void *)GetProcAddress(hntdll
, "RtlAllocateHandle");
97 pRtlFreeHandle
= (void *)GetProcAddress(hntdll
, "RtlFreeHandle");
98 pRtlAllocateAndInitializeSid
= (void *)GetProcAddress(hntdll
, "RtlAllocateAndInitializeSid");
99 pRtlFreeSid
= (void *)GetProcAddress(hntdll
, "RtlFreeSid");
101 strcpy((char*)src_aligned_block
, src_src
);
102 ok(strlen(src
) == 15, "Source must be 16 bytes long!\n");
105 #define COMP(str1,str2,cmplen,len) size = pRtlCompareMemory(str1, str2, cmplen); \
106 ok(size == len, "Expected %ld, got %ld\n", size, (SIZE_T)len)
108 static void test_RtlCompareMemory(void)
112 if (!pRtlCompareMemory
)
118 COMP(src
,src
,LEN
,LEN
);
120 COMP(src
,dest
,LEN
,0);
123 static void test_RtlCompareMemoryUlong(void)
132 result
= pRtlCompareMemoryUlong(a
, 0, 0x0123);
133 ok(result
== 0, "RtlCompareMemoryUlong(%p, 0, 0x0123) returns %lu, expected 0\n", a
, result
);
134 result
= pRtlCompareMemoryUlong(a
, 3, 0x0123);
135 ok(result
== 0, "RtlCompareMemoryUlong(%p, 3, 0x0123) returns %lu, expected 0\n", a
, result
);
136 result
= pRtlCompareMemoryUlong(a
, 4, 0x0123);
137 ok(result
== 4, "RtlCompareMemoryUlong(%p, 4, 0x0123) returns %lu, expected 4\n", a
, result
);
138 result
= pRtlCompareMemoryUlong(a
, 5, 0x0123);
139 ok(result
== 4, "RtlCompareMemoryUlong(%p, 5, 0x0123) returns %lu, expected 4\n", a
, result
);
140 result
= pRtlCompareMemoryUlong(a
, 7, 0x0123);
141 ok(result
== 4, "RtlCompareMemoryUlong(%p, 7, 0x0123) returns %lu, expected 4\n", a
, result
);
142 result
= pRtlCompareMemoryUlong(a
, 8, 0x0123);
143 ok(result
== 4, "RtlCompareMemoryUlong(%p, 8, 0x0123) returns %lu, expected 4\n", a
, result
);
144 result
= pRtlCompareMemoryUlong(a
, 9, 0x0123);
145 ok(result
== 4, "RtlCompareMemoryUlong(%p, 9, 0x0123) returns %lu, expected 4\n", a
, result
);
146 result
= pRtlCompareMemoryUlong(a
, 4, 0x0127);
147 ok(result
== 0, "RtlCompareMemoryUlong(%p, 4, 0x0127) returns %lu, expected 0\n", a
, result
);
148 result
= pRtlCompareMemoryUlong(a
, 4, 0x7123);
149 ok(result
== 0, "RtlCompareMemoryUlong(%p, 4, 0x7123) returns %lu, expected 0\n", a
, result
);
150 result
= pRtlCompareMemoryUlong(a
, 16, 0x4567);
151 ok(result
== 0, "RtlCompareMemoryUlong(%p, 16, 0x4567) returns %lu, expected 0\n", a
, result
);
154 result
= pRtlCompareMemoryUlong(a
, 3, 0x0123);
155 ok(result
== 0, "RtlCompareMemoryUlong(%p, 3, 0x0123) returns %lu, expected 0\n", a
, result
);
156 result
= pRtlCompareMemoryUlong(a
, 4, 0x0123);
157 ok(result
== 4, "RtlCompareMemoryUlong(%p, 4, 0x0123) returns %lu, expected 4\n", a
, result
);
158 result
= pRtlCompareMemoryUlong(a
, 5, 0x0123);
159 ok(result
== 4, "RtlCompareMemoryUlong(%p, 5, 0x0123) returns %lu, expected 4\n", a
, result
);
160 result
= pRtlCompareMemoryUlong(a
, 7, 0x0123);
161 ok(result
== 4, "RtlCompareMemoryUlong(%p, 7, 0x0123) returns %lu, expected 4\n", a
, result
);
162 result
= pRtlCompareMemoryUlong(a
, 8, 0x0123);
163 ok(result
== 8, "RtlCompareMemoryUlong(%p, 8, 0x0123) returns %lu, expected 8\n", a
, result
);
164 result
= pRtlCompareMemoryUlong(a
, 9, 0x0123);
165 ok(result
== 8, "RtlCompareMemoryUlong(%p, 9, 0x0123) returns %lu, expected 8\n", a
, result
);
168 #define COPY(len) memset(dest,0,sizeof(dest_aligned_block)); pRtlMoveMemory(dest, src, len)
169 #define CMP(str) ok(strcmp(dest,str) == 0, "Expected '%s', got '%s'\n", str, dest)
171 static void test_RtlMoveMemory(void)
176 /* Length should be in bytes and not rounded. Use strcmp to ensure we
177 * didn't write past the end (it checks for the final NUL left by memset)
183 COPY(4); CMP("This");
184 COPY(5); CMP("This ");
185 COPY(6); CMP("This i");
186 COPY(7); CMP("This is");
187 COPY(8); CMP("This is ");
188 COPY(9); CMP("This is a");
191 strcpy(dest
, src
); pRtlMoveMemory(dest
, dest
+ 1, strlen(src
) - 1);
192 CMP("his is a test!!");
193 strcpy(dest
, src
); pRtlMoveMemory(dest
+ 1, dest
, strlen(src
));
194 CMP("TThis is a test!");
197 #define FILL(len) memset(dest,0,sizeof(dest_aligned_block)); strcpy(dest, src); pRtlFillMemory(dest,len,'x')
199 static void test_RtlFillMemory(void)
204 /* Length should be in bytes and not rounded. Use strcmp to ensure we
205 * didn't write past the end (the remainder of the string should match)
207 FILL(0); CMP("This is a test!");
208 FILL(1); CMP("xhis is a test!");
209 FILL(2); CMP("xxis is a test!");
210 FILL(3); CMP("xxxs is a test!");
211 FILL(4); CMP("xxxx is a test!");
212 FILL(5); CMP("xxxxxis a test!");
213 FILL(6); CMP("xxxxxxs a test!");
214 FILL(7); CMP("xxxxxxx a test!");
215 FILL(8); CMP("xxxxxxxxa test!");
216 FILL(9); CMP("xxxxxxxxx test!");
219 #define LFILL(len) memset(dest,0,sizeof(dest_aligned_block)); strcpy(dest, src); pRtlFillMemoryUlong(dest,len,val)
221 static void test_RtlFillMemoryUlong(void)
223 ULONG val
= ('x' << 24) | ('x' << 16) | ('x' << 8) | 'x';
224 if (!pRtlFillMemoryUlong
)
227 /* Length should be in bytes and not rounded. Use strcmp to ensure we
228 * didn't write past the end (the remainder of the string should match)
230 LFILL(0); CMP("This is a test!");
231 LFILL(1); CMP("This is a test!");
232 LFILL(2); CMP("This is a test!");
233 LFILL(3); CMP("This is a test!");
234 LFILL(4); CMP("xxxx is a test!");
235 LFILL(5); CMP("xxxx is a test!");
236 LFILL(6); CMP("xxxx is a test!");
237 LFILL(7); CMP("xxxx is a test!");
238 LFILL(8); CMP("xxxxxxxxa test!");
239 LFILL(9); CMP("xxxxxxxxa test!");
242 #define ZERO(len) memset(dest,0,sizeof(dest_aligned_block)); strcpy(dest, src); pRtlZeroMemory(dest,len)
243 #define MCMP(str) ok(memcmp(dest,str,LEN) == 0, "Memcmp failed\n")
245 static void test_RtlZeroMemory(void)
250 /* Length should be in bytes and not rounded. */
251 ZERO(0); MCMP("This is a test!");
252 ZERO(1); MCMP("\0his is a test!");
253 ZERO(2); MCMP("\0\0is is a test!");
254 ZERO(3); MCMP("\0\0\0s is a test!");
255 ZERO(4); MCMP("\0\0\0\0 is a test!");
256 ZERO(5); MCMP("\0\0\0\0\0is a test!");
257 ZERO(6); MCMP("\0\0\0\0\0\0s a test!");
258 ZERO(7); MCMP("\0\0\0\0\0\0\0 a test!");
259 ZERO(8); MCMP("\0\0\0\0\0\0\0\0a test!");
260 ZERO(9); MCMP("\0\0\0\0\0\0\0\0\0 test!");
263 static void test_RtlUlonglongByteSwap(void)
267 result
= pRtlUlonglongByteSwap( ((ULONGLONG
)0x76543210 << 32) | 0x87654321 );
268 ok( (((ULONGLONG
)0x21436587 << 32) | 0x10325476) == result
,
269 "RtlUlonglongByteSwap(0x7654321087654321) returns 0x%llx, expected 0x2143658710325476\n",
274 static void test_RtlUniform(void)
283 * According to the documentation RtlUniform is using D.H. Lehmer's 1948
284 * algorithm. This algorithm is:
286 * seed = (seed * const_1 + const_2) % const_3;
288 * According to the documentation the random number is distributed over
289 * [0..MAXLONG]. Therefore const_3 is MAXLONG + 1:
291 * seed = (seed * const_1 + const_2) % (MAXLONG + 1);
293 * Because MAXLONG is 0x7fffffff (and MAXLONG + 1 is 0x80000000) the
294 * algorithm can be expressed without division as:
296 * seed = (seed * const_1 + const_2) & MAXLONG;
298 * To find out const_2 we just call RtlUniform with seed set to 0:
301 expected
= 0x7fffffc3;
302 result
= pRtlUniform(&seed
);
303 ok(result
== expected
,
304 "RtlUniform(&seed (seed == 0)) returns %lx, expected %lx\n",
307 * The algorithm is now:
309 * seed = (seed * const_1 + 0x7fffffc3) & MAXLONG;
311 * To find out const_1 we can use:
313 * const_1 = RtlUniform(1) - 0x7fffffc3;
315 * If that does not work a search loop can try all possible values of
316 * const_1 and compare to the result to RtlUniform(1).
317 * This way we find out that const_1 is 0xffffffed.
319 * For seed = 1 the const_2 is 0x7fffffc4:
322 expected
= seed
* 0xffffffed + 0x7fffffc3 + 1;
323 result
= pRtlUniform(&seed
);
324 ok(result
== expected
,
325 "RtlUniform(&seed (seed == 1)) returns %lx, expected %lx\n",
328 * For seed = 2 the const_2 is 0x7fffffc3:
331 expected
= seed
* 0xffffffed + 0x7fffffc3;
332 result
= pRtlUniform(&seed
);
333 ok(result
== expected
,
334 "RtlUniform(&seed (seed == 2)) returns %lx, expected %lx\n",
337 * More tests show that if seed is odd the result must be incremented by 1:
340 expected
= seed
* 0xffffffed + 0x7fffffc3 + (seed
& 1);
341 result
= pRtlUniform(&seed
);
342 ok(result
== expected
,
343 "RtlUniform(&seed (seed == 2)) returns %lx, expected %lx\n",
347 expected
= seed
* 0xffffffed + 0x7fffffc3;
348 result
= pRtlUniform(&seed
);
349 ok(result
== expected
,
350 "RtlUniform(&seed (seed == 0x6bca1aa)) returns %lx, expected %lx\n",
354 expected
= seed
* 0xffffffed + 0x7fffffc3 + 1;
355 result
= pRtlUniform(&seed
);
356 ok(result
== expected
,
357 "RtlUniform(&seed (seed == 0x6bca1ab)) returns %lx, expected %lx\n",
360 * When seed is 0x6bca1ac there is an exception:
363 expected
= seed
* 0xffffffed + 0x7fffffc3 + 2;
364 result
= pRtlUniform(&seed
);
365 ok(result
== expected
,
366 "RtlUniform(&seed (seed == 0x6bca1ac)) returns %lx, expected %lx\n",
369 * Note that up to here const_3 is not used
370 * (the highest bit of the result is not set).
372 * Starting with 0x6bca1ad: If seed is even the result must be incremented by 1:
375 expected
= (seed
* 0xffffffed + 0x7fffffc3) & MAXLONG
;
376 result
= pRtlUniform(&seed
);
377 ok(result
== expected
,
378 "RtlUniform(&seed (seed == 0x6bca1ad)) returns %lx, expected %lx\n",
382 expected
= (seed
* 0xffffffed + 0x7fffffc3 + 1) & MAXLONG
;
383 result
= pRtlUniform(&seed
);
384 ok(result
== expected
,
385 "RtlUniform(&seed (seed == 0x6bca1ae)) returns %lx, expected %lx\n",
388 * There are several ranges where for odd or even seed the result must be
389 * incremented by 1. You can see this ranges in the following test.
391 * For a full test use one of the following loop heads:
393 * for (num = 0; num <= 0xffffffff; num++) {
398 * for (num = 0; num <= 0xffffffff; num++) {
402 for (num
= 0; num
<= 100000; num
++) {
404 expected
= seed
* 0xffffffed + 0x7fffffc3;
405 if (seed
< 0x6bca1ac) {
406 expected
= expected
+ (seed
& 1);
407 } else if (seed
== 0x6bca1ac) {
408 expected
= (expected
+ 2) & MAXLONG
;
409 } else if (seed
< 0xd79435c) {
410 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
411 } else if (seed
< 0x1435e50b) {
412 expected
= expected
+ (seed
& 1);
413 } else if (seed
< 0x1af286ba) {
414 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
415 } else if (seed
< 0x21af2869) {
416 expected
= expected
+ (seed
& 1);
417 } else if (seed
< 0x286bca18) {
418 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
419 } else if (seed
< 0x2f286bc7) {
420 expected
= expected
+ (seed
& 1);
421 } else if (seed
< 0x35e50d77) {
422 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
423 } else if (seed
< 0x3ca1af26) {
424 expected
= expected
+ (seed
& 1);
425 } else if (seed
< 0x435e50d5) {
426 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
427 } else if (seed
< 0x4a1af284) {
428 expected
= expected
+ (seed
& 1);
429 } else if (seed
< 0x50d79433) {
430 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
431 } else if (seed
< 0x579435e2) {
432 expected
= expected
+ (seed
& 1);
433 } else if (seed
< 0x5e50d792) {
434 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
435 } else if (seed
< 0x650d7941) {
436 expected
= expected
+ (seed
& 1);
437 } else if (seed
< 0x6bca1af0) {
438 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
439 } else if (seed
< 0x7286bc9f) {
440 expected
= expected
+ (seed
& 1);
441 } else if (seed
< 0x79435e4e) {
442 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
443 } else if (seed
< 0x7ffffffd) {
444 expected
= expected
+ (seed
& 1);
445 } else if (seed
< 0x86bca1ac) {
446 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
447 } else if (seed
== 0x86bca1ac) {
448 expected
= (expected
+ 1) & MAXLONG
;
449 } else if (seed
< 0x8d79435c) {
450 expected
= expected
+ (seed
& 1);
451 } else if (seed
< 0x9435e50b) {
452 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
453 } else if (seed
< 0x9af286ba) {
454 expected
= expected
+ (seed
& 1);
455 } else if (seed
< 0xa1af2869) {
456 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
457 } else if (seed
< 0xa86bca18) {
458 expected
= expected
+ (seed
& 1);
459 } else if (seed
< 0xaf286bc7) {
460 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
461 } else if (seed
== 0xaf286bc7) {
462 expected
= (expected
+ 2) & MAXLONG
;
463 } else if (seed
< 0xb5e50d77) {
464 expected
= expected
+ (seed
& 1);
465 } else if (seed
< 0xbca1af26) {
466 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
467 } else if (seed
< 0xc35e50d5) {
468 expected
= expected
+ (seed
& 1);
469 } else if (seed
< 0xca1af284) {
470 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
471 } else if (seed
< 0xd0d79433) {
472 expected
= expected
+ (seed
& 1);
473 } else if (seed
< 0xd79435e2) {
474 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
475 } else if (seed
< 0xde50d792) {
476 expected
= expected
+ (seed
& 1);
477 } else if (seed
< 0xe50d7941) {
478 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
479 } else if (seed
< 0xebca1af0) {
480 expected
= expected
+ (seed
& 1);
481 } else if (seed
< 0xf286bc9f) {
482 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
483 } else if (seed
< 0xf9435e4e) {
484 expected
= expected
+ (seed
& 1);
485 } else if (seed
< 0xfffffffd) {
486 expected
= (expected
+ (~seed
& 1)) & MAXLONG
;
488 expected
= expected
+ (seed
& 1);
491 result
= pRtlUniform(&seed
);
492 ok(result
== expected
,
493 "test: %llu RtlUniform(&seed (seed == %lx)) returns %lx, expected %lx\n",
494 num
, seed_bak
, result
, expected
);
496 "test: %llu RtlUniform(&seed (seed == %lx)) sets seed to %lx, expected %lx\n",
497 num
, seed_bak
, seed
, expected
);
500 * Further investigation shows: In the different regions the highest bit
501 * is set or cleared when even or odd seeds need an increment by 1.
502 * This leads to a simplified algorithm:
504 * seed = seed * 0xffffffed + 0x7fffffc3;
505 * if (seed == 0xffffffff || seed == 0x7ffffffe) {
506 * seed = (seed + 2) & MAXLONG;
507 * } else if (seed == 0x7fffffff) {
509 * } else if ((seed & 0x80000000) == 0) {
510 * seed = seed + (~seed & 1);
512 * seed = (seed + (seed & 1)) & MAXLONG;
515 * This is also the algorithm used for RtlUniform of wine (see dlls/ntdll/rtl.c).
517 * Now comes the funny part:
518 * It took me one weekend, to find the complicated algorithm and one day more,
519 * to find the simplified algorithm. Several weeks later I found out: The value
520 * MAXLONG (=0x7fffffff) is never returned, neither with the native function
521 * nor with the simplified algorithm. In reality the native function and our
522 * function return a random number distributed over [0..MAXLONG-1]. Note
523 * that this is different from what native documentation states [0..MAXLONG].
524 * Expressed with D.H. Lehmer's 1948 algorithm it looks like:
526 * seed = (seed * const_1 + const_2) % MAXLONG;
528 * Further investigations show that the real algorithm is:
530 * seed = (seed * 0x7fffffed + 0x7fffffc3) % MAXLONG;
532 * This is checked with the test below:
535 for (num
= 0; num
<= 100000; num
++) {
536 expected
= (seed
* 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
538 result
= pRtlUniform(&seed
);
539 ok(result
== expected
,
540 "test: %llu RtlUniform(&seed (seed == %lx)) returns %lx, expected %lx\n",
541 num
, seed_bak
, result
, expected
);
543 "test: %llu RtlUniform(&seed (seed == %lx)) sets seed to %lx, expected %lx\n",
544 num
, seed_bak
, seed
, expected
);
547 * More tests show that RtlUniform does not return 0x7ffffffd for seed values
548 * in the range [0..MAXLONG-1]. Additionally 2 is returned twice. This shows
549 * that there is more than one cycle of generated randon numbers ...
554 static ULONG WINAPI
my_RtlRandom(PULONG seed
)
556 static ULONG saved_value
[128] =
557 { /* 0 */ 0x4c8bc0aa, 0x4c022957, 0x2232827a, 0x2f1e7626, 0x7f8bdafb, 0x5c37d02a, 0x0ab48f72, 0x2f0c4ffa,
558 /* 8 */ 0x290e1954, 0x6b635f23, 0x5d3885c0, 0x74b49ff8, 0x5155fa54, 0x6214ad3f, 0x111e9c29, 0x242a3a09,
559 /* 16 */ 0x75932ae1, 0x40ac432e, 0x54f7ba7a, 0x585ccbd5, 0x6df5c727, 0x0374dad1, 0x7112b3f1, 0x735fc311,
560 /* 24 */ 0x404331a9, 0x74d97781, 0x64495118, 0x323e04be, 0x5974b425, 0x4862e393, 0x62389c1d, 0x28a68b82,
561 /* 32 */ 0x0f95da37, 0x7a50bbc6, 0x09b0091c, 0x22cdb7b4, 0x4faaed26, 0x66417ccd, 0x189e4bfa, 0x1ce4e8dd,
562 /* 40 */ 0x5274c742, 0x3bdcf4dc, 0x2d94e907, 0x32eac016, 0x26d33ca3, 0x60415a8a, 0x31f57880, 0x68c8aa52,
563 /* 48 */ 0x23eb16da, 0x6204f4a1, 0x373927c1, 0x0d24eb7c, 0x06dd7379, 0x2b3be507, 0x0f9c55b1, 0x2c7925eb,
564 /* 56 */ 0x36d67c9a, 0x42f831d9, 0x5e3961cb, 0x65d637a8, 0x24bb3820, 0x4d08e33d, 0x2188754f, 0x147e409e,
565 /* 64 */ 0x6a9620a0, 0x62e26657, 0x7bd8ce81, 0x11da0abb, 0x5f9e7b50, 0x23e444b6, 0x25920c78, 0x5fc894f0,
566 /* 72 */ 0x5e338cbb, 0x404237fd, 0x1d60f80f, 0x320a1743, 0x76013d2b, 0x070294ee, 0x695e243b, 0x56b177fd,
567 /* 80 */ 0x752492e1, 0x6decd52f, 0x125f5219, 0x139d2e78, 0x1898d11e, 0x2f7ee785, 0x4db405d8, 0x1a028a35,
568 /* 88 */ 0x63f6f323, 0x1f6d0078, 0x307cfd67, 0x3f32a78a, 0x6980796c, 0x462b3d83, 0x34b639f2, 0x53fce379,
569 /* 96 */ 0x74ba50f4, 0x1abc2c4b, 0x5eeaeb8d, 0x335a7a0d, 0x3973dd20, 0x0462d66b, 0x159813ff, 0x1e4643fd,
570 /* 104 */ 0x06bc5c62, 0x3115e3fc, 0x09101613, 0x47af2515, 0x4f11ec54, 0x78b99911, 0x3db8dd44, 0x1ec10b9b,
571 /* 112 */ 0x5b5506ca, 0x773ce092, 0x567be81a, 0x5475b975, 0x7a2cde1a, 0x494536f5, 0x34737bb4, 0x76d9750b,
572 /* 120 */ 0x2a1f6232, 0x2e49644d, 0x7dddcbe7, 0x500cebdb, 0x619dab9e, 0x48c626fe, 0x1cda3193, 0x52dabe9d };
577 rand
= (*seed
* 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
578 *seed
= (rand
* 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
580 result
= saved_value
[pos
];
581 saved_value
[pos
] = rand
;
586 static void test_RtlRandom(void)
593 ULONG result_expected
;
596 * Unlike RtlUniform, RtlRandom is not documented. We guess that for
597 * RtlRandom D.H. Lehmer's 1948 algorithm is used like stated in
598 * the documentation of the RtlUniform function. This algorithm is:
600 * seed = (seed * const_1 + const_2) % const_3;
602 * According to the RtlUniform documentation the random number is
603 * distributed over [0..MAXLONG], but in reality it is distributed
604 * over [0..MAXLONG-1]. Therefore const_3 might be MAXLONG + 1 or
607 * seed = (seed * const_1 + const_2) % (MAXLONG + 1);
611 * seed = (seed * const_1 + const_2) % MAXLONG;
613 * To find out const_2 we just call RtlRandom with seed set to 0:
616 result_expected
= 0x320a1743;
617 seed_expected
=0x44b;
618 result
= pRtlRandom(&seed
);
619 ok(result
== result_expected
,
620 "pRtlRandom(&seed (seed == 0)) returns %lx, expected %lx\n",
621 result
, result_expected
);
622 ok(seed
== seed_expected
,
623 "pRtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx\n",
624 seed
, seed_expected
);
626 * Seed is not equal to result as with RtlUniform. To see more we
627 * call RtlRandom aggain with seed set to 0:
630 result_expected
= 0x7fffffc3;
631 seed_expected
=0x44b;
632 result
= pRtlRandom(&seed
);
633 ok(result
== result_expected
,
634 "RtlRandom(&seed (seed == 0)) returns %lx, expected %lx\n",
635 result
, result_expected
);
636 ok(seed
== seed_expected
,
637 "RtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx\n",
638 seed
, seed_expected
);
640 * Seed is set to the same value as before but the result is different.
641 * To see more we call RtlRandom aggain with seed set to 0:
644 result_expected
= 0x7fffffc3;
645 seed_expected
=0x44b;
646 result
= pRtlRandom(&seed
);
647 ok(result
== result_expected
,
648 "RtlRandom(&seed (seed == 0)) returns %lx, expected %lx\n",
649 result
, result_expected
);
650 ok(seed
== seed_expected
,
651 "RtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx\n",
652 seed
, seed_expected
);
654 * Seed is aggain set to the same value as before. This time we also
655 * have the same result as before. Interestingly the value of the
656 * result is 0x7fffffc3 which is the same value used in RtlUniform
657 * as const_2. If we do
660 * result = RtlUniform(&seed);
662 * we get the same result (0x7fffffc3) as with
667 * result = RtlRandom(&seed);
669 * And there is another interesting thing. If we do
675 * seed is set to the value 0x44b which ist the same value that
680 * assigns to seed. Putting these two findings together leads to
681 * the concluson that RtlRandom saves the value in some variable,
682 * like in the following algorithm:
684 * result = saved_value;
685 * saved_value = RtlUniform(&seed);
689 * Now we do further tests with seed set to 1:
692 result_expected
= 0x7a50bbc6;
693 seed_expected
=0x5a1;
694 result
= pRtlRandom(&seed
);
695 ok(result
== result_expected
,
696 "RtlRandom(&seed (seed == 1)) returns %lx, expected %lx\n",
697 result
, result_expected
);
698 ok(seed
== seed_expected
,
699 "RtlRandom(&seed (seed == 1)) sets seed to %lx, expected %lx\n",
700 seed
, seed_expected
);
702 * If there is just one saved_value the result now would be
703 * 0x7fffffc3. From this test we can see that there is more than
704 * one saved_value, like with this algorithm:
706 * result = saved_value[pos];
707 * saved_value[pos] = RtlUniform(&seed);
711 * But how is the value of pos determined? The calls to RtlUniform
712 * create a sequence of random numbers. Every second random number
713 * is put into the saved_value array and is used in some later call
714 * of RtlRandom as result. The only reasonable source to determine
715 * pos are the random numbers generated by RtlUniform which are not
716 * put into the saved_value array. This are the values of seed
717 * between the two calls of RtlUniform as in this algorithm:
719 * rand = RtlUniform(&seed);
721 * pos = position(seed);
722 * result = saved_value[pos];
723 * saved_value[pos] = rand;
726 * What remains to be determined is: The size of the saved_value array,
727 * the initial values of the saved_value array and the function
728 * position(seed). These tests are not shown here.
729 * The result of these tests is: The size of the saved_value array
730 * is 128, the initial values can be seen in the my_RtlRandom
731 * function and the position(seed) function is (seed & 0x7f).
733 * For a full test of RtlRandom use one of the following loop heads:
735 * for (num = 0; num <= 0xffffffff; num++) {
740 * for (num = 0; num <= 0xffffffff; num++) {
744 for (num
= 0; num
<= 100000; num
++) {
746 seed_expected
= seed
;
747 result_expected
= my_RtlRandom(&seed_expected
);
748 /* The following corrections are necessary because the */
749 /* previous tests changed the saved_value array */
751 result_expected
= 0x7fffffc3;
752 } else if (num
== 81) {
753 result_expected
= 0x7fffffb1;
755 result
= pRtlRandom(&seed
);
756 ok(result
== result_expected
,
757 "test: %llu RtlUniform(&seed (seed == %lx)) returns %lx, expected %lx\n",
758 num
, seed_bak
, result
, result_expected
);
759 ok(seed
== seed_expected
,
760 "test: %llu RtlUniform(&seed (seed == %lx)) sets seed to %lx, expected %lx\n",
761 num
, seed_bak
, seed
, seed_expected
);
767 ACCESS_MASK GrantedAccess
;
768 ACCESS_MASK DesiredAccess
;
772 static const all_accesses_t all_accesses
[] = {
773 {0xFEDCBA76, 0xFEDCBA76, 1},
774 {0x00000000, 0xFEDCBA76, 0},
775 {0xFEDCBA76, 0x00000000, 1},
776 {0x00000000, 0x00000000, 1},
777 {0xFEDCBA76, 0xFEDCBA70, 1},
778 {0xFEDCBA70, 0xFEDCBA76, 0},
779 {0xFEDCBA76, 0xFEDC8A76, 1},
780 {0xFEDC8A76, 0xFEDCBA76, 0},
781 {0xFEDCBA76, 0xC8C4B242, 1},
782 {0xC8C4B242, 0xFEDCBA76, 0},
784 #define NB_ALL_ACCESSES (sizeof(all_accesses)/sizeof(*all_accesses))
787 static void test_RtlAreAllAccessesGranted(void)
792 for (test_num
= 0; test_num
< NB_ALL_ACCESSES
; test_num
++) {
793 result
= pRtlAreAllAccessesGranted(all_accesses
[test_num
].GrantedAccess
,
794 all_accesses
[test_num
].DesiredAccess
);
795 ok(all_accesses
[test_num
].result
== result
,
796 "(test %d): RtlAreAllAccessesGranted(%08lx, %08lx) returns %d, expected %d\n",
797 test_num
, all_accesses
[test_num
].GrantedAccess
,
798 all_accesses
[test_num
].DesiredAccess
,
799 result
, all_accesses
[test_num
].result
);
805 ACCESS_MASK GrantedAccess
;
806 ACCESS_MASK DesiredAccess
;
810 static const any_accesses_t any_accesses
[] = {
811 {0xFEDCBA76, 0xFEDCBA76, 1},
812 {0x00000000, 0xFEDCBA76, 0},
813 {0xFEDCBA76, 0x00000000, 0},
814 {0x00000000, 0x00000000, 0},
815 {0xFEDCBA76, 0x01234589, 0},
816 {0x00040000, 0xFEDCBA76, 1},
817 {0x00040000, 0xFED8BA76, 0},
818 {0xFEDCBA76, 0x00040000, 1},
819 {0xFED8BA76, 0x00040000, 0},
821 #define NB_ANY_ACCESSES (sizeof(any_accesses)/sizeof(*any_accesses))
824 static void test_RtlAreAnyAccessesGranted(void)
829 for (test_num
= 0; test_num
< NB_ANY_ACCESSES
; test_num
++) {
830 result
= pRtlAreAnyAccessesGranted(any_accesses
[test_num
].GrantedAccess
,
831 any_accesses
[test_num
].DesiredAccess
);
832 ok(any_accesses
[test_num
].result
== result
,
833 "(test %d): RtlAreAnyAccessesGranted(%08lx, %08lx) returns %d, expected %d\n",
834 test_num
, any_accesses
[test_num
].GrantedAccess
,
835 any_accesses
[test_num
].DesiredAccess
,
836 result
, any_accesses
[test_num
].result
);
840 static void test_RtlComputeCrc32(void)
844 if (!pRtlComputeCrc32
)
847 crc
= pRtlComputeCrc32(crc
, (LPBYTE
)src
, LEN
);
848 ok(crc
== 0x40861dc2,"Expected 0x40861dc2, got %8lx\n", crc
);
852 typedef struct MY_HANDLE
854 RTL_HANDLE RtlHandle
;
858 static inline void RtlpMakeHandleAllocated(RTL_HANDLE
* Handle
)
860 ULONG_PTR
*AllocatedBit
= (ULONG_PTR
*)(&Handle
->Next
);
861 *AllocatedBit
= *AllocatedBit
| 1;
864 static void test_HandleTables(void)
869 MY_HANDLE
* MyHandle
;
870 RTL_HANDLE_TABLE HandleTable
;
872 pRtlInitializeHandleTable(0x3FFF, sizeof(MY_HANDLE
), &HandleTable
);
873 MyHandle
= (MY_HANDLE
*)pRtlAllocateHandle(&HandleTable
, &Index
);
874 ok(MyHandle
!= NULL
, "RtlAllocateHandle failed\n");
875 RtlpMakeHandleAllocated(&MyHandle
->RtlHandle
);
877 result
= pRtlIsValidIndexHandle(&HandleTable
, Index
, (RTL_HANDLE
**)&MyHandle
);
878 ok(result
, "Handle %p wasn't valid\n", MyHandle
);
879 result
= pRtlFreeHandle(&HandleTable
, &MyHandle
->RtlHandle
);
880 ok(result
, "Couldn't free handle %p\n", MyHandle
);
881 status
= pRtlDestroyHandleTable(&HandleTable
);
882 ok(status
== STATUS_SUCCESS
, "RtlDestroyHandleTable failed with error 0x%08lx\n", status
);
885 static void test_RtlAllocateAndInitializeSid(void)
888 SID_IDENTIFIER_AUTHORITY sia
= {{ 1, 2, 3, 4, 5, 6 }};
891 ret
= pRtlAllocateAndInitializeSid(&sia
, 0, 1, 2, 3, 4, 5, 6, 7, 8, &psid
);
892 ok(!ret
, "RtlAllocateAndInitializeSid error %08lx\n", ret
);
893 ret
= pRtlFreeSid(psid
);
894 ok(!ret
, "RtlFreeSid error %08lx\n", ret
);
896 /* these tests crash on XP
897 ret = pRtlAllocateAndInitializeSid(NULL, 0, 1, 2, 3, 4, 5, 6, 7, 8, &psid);
898 ret = pRtlAllocateAndInitializeSid(&sia, 0, 1, 2, 3, 4, 5, 6, 7, 8, NULL);*/
900 ret
= pRtlAllocateAndInitializeSid(&sia
, 9, 1, 2, 3, 4, 5, 6, 7, 8, &psid
);
901 ok(ret
== STATUS_INVALID_SID
, "wrong error %08lx\n", ret
);
908 if (pRtlCompareMemory
)
909 test_RtlCompareMemory();
910 if (pRtlCompareMemoryUlong
)
911 test_RtlCompareMemoryUlong();
913 test_RtlMoveMemory();
915 test_RtlFillMemory();
916 if (pRtlFillMemoryUlong
)
917 test_RtlFillMemoryUlong();
919 test_RtlZeroMemory();
920 if (pRtlUlonglongByteSwap
)
921 test_RtlUlonglongByteSwap();
926 if (pRtlAreAllAccessesGranted
)
927 test_RtlAreAllAccessesGranted();
928 if (pRtlAreAnyAccessesGranted
)
929 test_RtlAreAnyAccessesGranted();
930 if (pRtlComputeCrc32
)
931 test_RtlComputeCrc32();
932 if (pRtlInitializeHandleTable
)
934 if (pRtlAllocateAndInitializeSid
)
935 test_RtlAllocateAndInitializeSid();