some ntdll functions (4) - part 2: tests
thomas.mertes at gmx.at
thomas.mertes at gmx.at
Mon Apr 7 02:24:36 CDT 2003
Hello
Here are the tests for some ntdll functions.
These tests require the functions implemented in
part 1 of this patch (see part 1: functions).
Changelog:
* dlls/ntdll/tests/rtl.c dlls_ntdll/tests/rtlstr.c:
Thomas Mertes <thomas.mertes at gmx.at>
Tests for RtlUlonglongByteSwap, RtlRandom,
RtlAreAllAccessesGranted, RtlAreAnyAccessesGranted,
RtlUnicodeStringToAnsiString,
RtlAppendAsciizToString, RtlAppendStringToString,
RtlAppendUnicodeToString and
RtlAppendUnicodeStringToString.
Greetings
Thomas Mertes
--
+++ GMX - Mail, Messaging & more http://www.gmx.net +++
Bitte lächeln! Fotogalerie online mit GMX ohne eigene Homepage!
-------------- next part --------------
diff -urN wine_cvs_from_20030404/dlls/ntdll/tests/rtl.c new_wine-20030318/dlls/ntdll/tests/rtl.c
--- wine_cvs_from_20030404/dlls/ntdll/tests/rtl.c Thu Apr 3 01:25:58 2003
+++ new_wine-20030318/dlls/ntdll/tests/rtl.c Sun Apr 6 22:47:01 2003
@@ -31,8 +31,12 @@
/* Function ptrs for ntdll calls */
static HMODULE hntdll = 0;
-static SIZE_T (WINAPI *pRtlCompareMemoryUlong)(PULONG, SIZE_T, ULONG);
-static ULONG (WINAPI *pRtlUniform)(PULONG);
+static SIZE_T (WINAPI *pRtlCompareMemoryUlong)(PULONG, SIZE_T, ULONG);
+static ULONGLONG (WINAPIV *pRtlUlonglongByteSwap)(ULONGLONG source);
+static ULONG (WINAPI *pRtlUniform)(PULONG);
+static ULONG (WINAPI *pRtlRandom)(PULONG);
+static BOOLEAN (WINAPI *pRtlAreAllAccessesGranted)(ACCESS_MASK, ACCESS_MASK);
+static BOOLEAN (WINAPI *pRtlAreAnyAccessesGranted)(ACCESS_MASK, ACCESS_MASK);
static void InitFunctionPtrs(void)
@@ -41,7 +45,11 @@
ok(hntdll != 0, "LoadLibrary failed");
if (hntdll) {
pRtlCompareMemoryUlong = (void *)GetProcAddress(hntdll, "RtlCompareMemoryUlong");
+ pRtlUlonglongByteSwap = (void *)GetProcAddress(hntdll, "RtlUlonglongByteSwap");
pRtlUniform = (void *)GetProcAddress(hntdll, "RtlUniform");
+ pRtlRandom = (void *)GetProcAddress(hntdll, "RtlRandom");
+ pRtlAreAllAccessesGranted = (void *)GetProcAddress(hntdll, "RtlAreAllAccessesGranted");
+ pRtlAreAnyAccessesGranted = (void *)GetProcAddress(hntdll, "RtlAreAnyAccessesGranted");
} /* if */
}
@@ -92,6 +100,17 @@
}
+static void test_RtlUlonglongByteSwap(void)
+{
+ ULONGLONG result;
+
+ result = pRtlUlonglongByteSwap(0x7654321087654321);
+ ok(0x2143658710325476 == result,
+ "RtlUlonglongByteSwap(0x7654321087654321) returns 0x%llx, expected 0x2143658710325476",
+ result);
+}
+
+
static void test_RtlUniform(void)
{
ULONGLONG num;
@@ -111,8 +130,8 @@
*
* seed = (seed * const_1 + const_2) % (MAXLONG + 1);
*
- * Because MAXLONG is 0xfffffff (which is 0x10000000 - 1) the algorithm
- * can be expressed as:
+ * Because MAXLONG is 0x7fffffff (and MAXLONG + 1 is 0x80000000) the
+ * algorithm can be expressed without division as:
*
* seed = (seed * const_1 + const_2) & MAXLONG;
*
@@ -320,16 +339,356 @@
/*
* Further investigation shows: In the different regions the highest bit
* is set or cleared when even or odd seeds need an increment by 1.
- * This leads to the simplified RtlUniform of wine (see dlls/ntdll/rtl.c).
+ * This leads to a simplified algorithm:
+ *
+ * seed = seed * 0xffffffed + 0x7fffffc3;
+ * if (seed == 0xffffffff || seed == 0x7ffffffe) {
+ * seed = (seed + 2) & MAXLONG;
+ * } else if (seed == 0x7fffffff) {
+ * seed = 0;
+ * } else if ((seed & 0x80000000) == 0) {
+ * seed = seed + (~seed & 1);
+ * } else {
+ * seed = (seed + (seed & 1)) & MAXLONG;
+ * }
+ *
+ * This is also the algorithm used for RtlUniform of wine (see dlls/ntdll/rtl.c).
+ *
+ * Now comes the funny part:
+ * It took me one weekend, to find the complicated algorithm and one day more,
+ * to find the simplified algorithm. Several weeks later I found out: The value
+ * MAXLONG (=0x7fffffff) is never returned, neighter with the native function
+ * nor with the simplified algorithm. In reality the native function and our
+ * function return a random number distributed over [0..MAXLONG-1]. Note
+ * that this is different to what native documentation states [0..MAXLONG].
+ * Expressed with D.H. Lehmer's 1948 algorithm it looks like:
+ *
+ * seed = (seed * const_1 + const_2) % MAXLONG;
+ *
+ * Further investigations show that the real algorithm is:
+ *
+ * seed = (seed * 0x7fffffed + 0x7fffffc3) % MAXLONG;
+ *
+ * This is checked with the test below:
+ */
+ seed = 0;
+ for (num = 0; num <= 100000; num++) {
+ expected = (seed * 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
+ seed_bak = seed;
+ result = pRtlUniform(&seed);
+ ok(result == expected,
+ "test: %llu RtlUniform(&seed (seed == %lx)) returns %lx, expected %lx",
+ num, seed_bak, result, expected);
+ ok(seed == expected,
+ "test: %llu RtlUniform(&seed (seed == %lx)) sets seed to %lx, expected %lx",
+ num, seed_bak, seed, expected);
+ } /* for */
+/*
+ * More tests show that RtlUniform does not return 0x7ffffffd for seed values
+ * in the range [0..MAXLONG-1]. Additionally 2 is returned twice. This shows
+ * that there is more than one cycle of generated randon numbers ...
*/
}
+ULONG WINAPI my_RtlRandom(PULONG seed)
+{
+ static ULONG saved_value[128] =
+ { /* 0 */ 0x4c8bc0aa, 0x4c022957, 0x2232827a, 0x2f1e7626, 0x7f8bdafb, 0x5c37d02a, 0x0ab48f72, 0x2f0c4ffa,
+ /* 8 */ 0x290e1954, 0x6b635f23, 0x5d3885c0, 0x74b49ff8, 0x5155fa54, 0x6214ad3f, 0x111e9c29, 0x242a3a09,
+ /* 16 */ 0x75932ae1, 0x40ac432e, 0x54f7ba7a, 0x585ccbd5, 0x6df5c727, 0x0374dad1, 0x7112b3f1, 0x735fc311,
+ /* 24 */ 0x404331a9, 0x74d97781, 0x64495118, 0x323e04be, 0x5974b425, 0x4862e393, 0x62389c1d, 0x28a68b82,
+ /* 32 */ 0x0f95da37, 0x7a50bbc6, 0x09b0091c, 0x22cdb7b4, 0x4faaed26, 0x66417ccd, 0x189e4bfa, 0x1ce4e8dd,
+ /* 40 */ 0x5274c742, 0x3bdcf4dc, 0x2d94e907, 0x32eac016, 0x26d33ca3, 0x60415a8a, 0x31f57880, 0x68c8aa52,
+ /* 48 */ 0x23eb16da, 0x6204f4a1, 0x373927c1, 0x0d24eb7c, 0x06dd7379, 0x2b3be507, 0x0f9c55b1, 0x2c7925eb,
+ /* 56 */ 0x36d67c9a, 0x42f831d9, 0x5e3961cb, 0x65d637a8, 0x24bb3820, 0x4d08e33d, 0x2188754f, 0x147e409e,
+ /* 64 */ 0x6a9620a0, 0x62e26657, 0x7bd8ce81, 0x11da0abb, 0x5f9e7b50, 0x23e444b6, 0x25920c78, 0x5fc894f0,
+ /* 72 */ 0x5e338cbb, 0x404237fd, 0x1d60f80f, 0x320a1743, 0x76013d2b, 0x070294ee, 0x695e243b, 0x56b177fd,
+ /* 80 */ 0x752492e1, 0x6decd52f, 0x125f5219, 0x139d2e78, 0x1898d11e, 0x2f7ee785, 0x4db405d8, 0x1a028a35,
+ /* 88 */ 0x63f6f323, 0x1f6d0078, 0x307cfd67, 0x3f32a78a, 0x6980796c, 0x462b3d83, 0x34b639f2, 0x53fce379,
+ /* 96 */ 0x74ba50f4, 0x1abc2c4b, 0x5eeaeb8d, 0x335a7a0d, 0x3973dd20, 0x0462d66b, 0x159813ff, 0x1e4643fd,
+ /* 104 */ 0x06bc5c62, 0x3115e3fc, 0x09101613, 0x47af2515, 0x4f11ec54, 0x78b99911, 0x3db8dd44, 0x1ec10b9b,
+ /* 112 */ 0x5b5506ca, 0x773ce092, 0x567be81a, 0x5475b975, 0x7a2cde1a, 0x494536f5, 0x34737bb4, 0x76d9750b,
+ /* 120 */ 0x2a1f6232, 0x2e49644d, 0x7dddcbe7, 0x500cebdb, 0x619dab9e, 0x48c626fe, 0x1cda3193, 0x52dabe9d };
+ ULONG rand;
+ int pos;
+ ULONG result;
+
+ rand = (*seed * 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
+ *seed = (rand * 0x7fffffed + 0x7fffffc3) % 0x7fffffff;
+ pos = *seed & 0x7f;
+ result = saved_value[pos];
+ saved_value[pos] = rand;
+ return(result);
+}
+
+
+static void test_RtlRandom(void)
+{
+ ULONGLONG num;
+ ULONG seed;
+ ULONG seed_bak;
+ ULONG seed_expected;
+ ULONG result;
+ ULONG result_expected;
+
+/*
+ * Unlike RtlUniform, RtlRandom is not documented. We guess that for
+ * RtlRandom D.H. Lehmer's 1948 algorithm is used like stated in
+ * the documentation of the RtlUniform function. This algorithm is:
+ *
+ * seed = (seed * const_1 + const_2) % const_3;
+ *
+ * According to the RtlUniform documentation the random number is
+ * distributed over [0..MAXLONG], but in reality it is distributed
+ * over [0..MAXLONG-1]. Therefore const_3 might be MAXLONG + 1 or
+ * MAXLONG:
+ *
+ * seed = (seed * const_1 + const_2) % (MAXLONG + 1);
+ *
+ * or
+ *
+ * seed = (seed * const_1 + const_2) % MAXLONG;
+ *
+ * To find out const_2 we just call RtlRandom with seed set to 0:
+ */
+ seed = 0;
+ result_expected = 0x320a1743;
+ seed_expected =0x44b;
+ result = pRtlRandom(&seed);
+ ok(result == result_expected,
+ "pRtlRandom(&seed (seed == 0)) returns %lx, expected %lx",
+ result, result_expected);
+ ok(seed == seed_expected,
+ "pRtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx",
+ seed, seed_expected);
+/*
+ * Seed is not equal to result as with RtlUniform. To see more we
+ * call RtlRandom aggain with seed set to 0:
+ */
+ seed = 0;
+ result_expected = 0x7fffffc3;
+ seed_expected =0x44b;
+ result = pRtlRandom(&seed);
+ ok(result == result_expected,
+ "RtlRandom(&seed (seed == 0)) returns %lx, expected %lx",
+ result, result_expected);
+ ok(seed == seed_expected,
+ "RtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx",
+ seed, seed_expected);
+/*
+ * Seed is set to the same value as before but the result is different.
+ * To see more we call RtlRandom aggain with seed set to 0:
+ */
+ seed = 0;
+ result_expected = 0x7fffffc3;
+ seed_expected =0x44b;
+ result = pRtlRandom(&seed);
+ ok(result == result_expected,
+ "RtlRandom(&seed (seed == 0)) returns %lx, expected %lx",
+ result, result_expected);
+ ok(seed == seed_expected,
+ "RtlRandom(&seed (seed == 0)) sets seed to %lx, expected %lx",
+ seed, seed_expected);
+/*
+ * Seed is aggain set to the same value as before. This time we also
+ * have the same result as before. Interestingly the value of the
+ * result is 0x7fffffc3 which is the same value used in RtlUniform
+ * as const_2. If we do
+ *
+ * seed = 0;
+ * result = RtlUniform(&seed);
+ *
+ * we get the same result (0x7fffffc3) as with
+ *
+ * seed = 0;
+ * RtlRandom(&seed);
+ * seed = 0;
+ * result = RtlRandom(&seed);
+ *
+ * And there is another interesting thing. If we do
+ *
+ * seed = 0;
+ * RtlUniform(&seed);
+ * RtlUniform(&seed);
+ *
+ * seed is set to the value 0x44b which ist the same value that
+ *
+ * seed = 0;
+ * RtlRandom(&seed);
+ *
+ * assigns to seed. Putting this two findings together leads to
+ * the concluson that RtlRandom saves the value in some variable,
+ * like in the following algorithm:
+ *
+ * result = saved_value;
+ * saved_value = RtlUniform(&seed);
+ * RtlUniform(&seed);
+ * return(result);
+ *
+ * Now we do further tests with seed set to 1:
+ */
+ seed = 1;
+ result_expected = 0x7a50bbc6;
+ seed_expected =0x5a1;
+ result = pRtlRandom(&seed);
+ ok(result == result_expected,
+ "RtlRandom(&seed (seed == 1)) returns %lx, expected %lx",
+ result, result_expected);
+ ok(seed == seed_expected,
+ "RtlRandom(&seed (seed == 1)) sets seed to %lx, expected %lx",
+ seed, seed_expected);
+/*
+ * If there is just one saved_value the result now would be
+ * 0x7fffffc3. From this test we can see that there is more than
+ * one saved_value, like with this algorithm:
+ *
+ * result = saved_value[pos];
+ * saved_value[pos] = RtlUniform(&seed);
+ * RtlUniform(&seed);
+ * return(result);
+ *
+ * But how the value of pos is determined? The calls to RtlUniform
+ * create a sequence of random numbers. Every second random number
+ * is put into the saved_value array and is used in some later call
+ * of RtlRandom as result. The only reasonable source to determine
+ * pos are the random numbers generated by RtlUniform which are not
+ * put into the saved_value array. This are the values of seed
+ * between the two calls of RtlUniform as in this altorithm:
+ *
+ * rand = RtlUniform(&seed);
+ * RtlUniform(&seed);
+ * pos = position(seed);
+ * result = saved_value[pos];
+ * saved_value[pos] = rand;
+ * return(result);
+ *
+ * What remains to determine is: The size of the saved_value array,
+ * the initial values of the saved_value array and the function
+ * position(seed). This tests are not shown here.
+ * The result of this tests ist: The size of the saved_value array
+ * is 128, the initial values can be seen in the my_RtlRandom
+ * function and the position(seed) function is (seed & 0x7f).
+ *
+ * For a full test of RtlRandom use one of the following loop heads:
+ *
+ * for (num = 0; num <= 0xffffffff; num++) {
+ * seed = num;
+ * ...
+ *
+ * seed = 0;
+ * for (num = 0; num <= 0xffffffff; num++) {
+ * ...
+ */
+ seed = 0;
+ for (num = 0; num <= 100000; num++) {
+ seed_bak = seed;
+ seed_expected = seed;
+ result_expected = my_RtlRandom(&seed_expected);
+ /* The following corrections are necessary because the */
+ /* previous tests changed the saved_value array */
+ if (num == 0) {
+ result_expected = 0x7fffffc3;
+ } else if (num == 81) {
+ result_expected = 0x7fffffb1;
+ } /* if */
+ result = pRtlRandom(&seed);
+ ok(result == result_expected,
+ "test: %llu RtlUniform(&seed (seed == %lx)) returns %lx, expected %lx",
+ num, seed_bak, result, result_expected);
+ ok(seed == seed_expected,
+ "test: %llu RtlUniform(&seed (seed == %lx)) sets seed to %lx, expected %lx",
+ num, seed_bak, seed, seed_expected);
+ } /* for */
+}
+
+
+typedef struct {
+ ACCESS_MASK GrantedAccess;
+ ACCESS_MASK DesiredAccess;
+ BOOLEAN result;
+} all_accesses_t;
+
+static const all_accesses_t all_accesses[] = {
+ {0xFEDCBA76, 0xFEDCBA76, 1},
+ {0x00000000, 0xFEDCBA76, 0},
+ {0xFEDCBA76, 0x00000000, 1},
+ {0x00000000, 0x00000000, 1},
+ {0xFEDCBA76, 0xFEDCBA70, 1},
+ {0xFEDCBA70, 0xFEDCBA76, 0},
+ {0xFEDCBA76, 0xFEDC8A76, 1},
+ {0xFEDC8A76, 0xFEDCBA76, 0},
+ {0xFEDCBA76, 0xC8C4B242, 1},
+ {0xC8C4B242, 0xFEDCBA76, 0},
+};
+#define NB_ALL_ACCESSES (sizeof(all_accesses)/sizeof(*all_accesses))
+
+
+static void test_RtlAreAllAccessesGranted(void)
+{
+ int test_num;
+ BOOLEAN result;
+
+ for (test_num = 0; test_num < NB_ALL_ACCESSES; test_num++) {
+ result = pRtlAreAllAccessesGranted(all_accesses[test_num].GrantedAccess,
+ all_accesses[test_num].DesiredAccess);
+ ok(all_accesses[test_num].result == result,
+ "(test %d): RtlAreAllAccessesGranted(%08lx, %08lx) returns %d, expected %d",
+ test_num, all_accesses[test_num].GrantedAccess,
+ all_accesses[test_num].DesiredAccess,
+ result, all_accesses[test_num].result);
+ } /* for */
+}
+
+
+typedef struct {
+ ACCESS_MASK GrantedAccess;
+ ACCESS_MASK DesiredAccess;
+ BOOLEAN result;
+} any_accesses_t;
+
+static const any_accesses_t any_accesses[] = {
+ {0xFEDCBA76, 0xFEDCBA76, 1},
+ {0x00000000, 0xFEDCBA76, 0},
+ {0xFEDCBA76, 0x00000000, 0},
+ {0x00000000, 0x00000000, 0},
+ {0xFEDCBA76, 0x01234589, 0},
+ {0x00040000, 0xFEDCBA76, 1},
+ {0x00040000, 0xFED8BA76, 0},
+ {0xFEDCBA76, 0x00040000, 1},
+ {0xFED8BA76, 0x00040000, 0},
+};
+#define NB_ANY_ACCESSES (sizeof(any_accesses)/sizeof(*any_accesses))
+
+
+static void test_RtlAreAnyAccessesGranted(void)
+{
+ int test_num;
+ BOOLEAN result;
+
+ for (test_num = 0; test_num < NB_ANY_ACCESSES; test_num++) {
+ result = pRtlAreAnyAccessesGranted(any_accesses[test_num].GrantedAccess,
+ any_accesses[test_num].DesiredAccess);
+ ok(any_accesses[test_num].result == result,
+ "(test %d): RtlAreAnyAccessesGranted(%08lx, %08lx) returns %d, expected %d",
+ test_num, any_accesses[test_num].GrantedAccess,
+ any_accesses[test_num].DesiredAccess,
+ result, any_accesses[test_num].result);
+ } /* for */
+}
+
+
START_TEST(rtl)
{
InitFunctionPtrs();
test_RtlCompareMemoryUlong();
+ if (pRtlUlonglongByteSwap) {
+ test_RtlUlonglongByteSwap();
+ } /* if */
test_RtlUniform();
+ test_RtlRandom();
+ test_RtlAreAllAccessesGranted();
+ test_RtlAreAnyAccessesGranted();
}
diff -urN wine_cvs_from_20030404/dlls/ntdll/tests/rtlstr.c new_wine-20030318/dlls/ntdll/tests/rtlstr.c
--- wine_cvs_from_20030404/dlls/ntdll/tests/rtlstr.c Fri Apr 4 23:31:32 2003
+++ new_wine-20030318/dlls/ntdll/tests/rtlstr.c Sun Apr 6 22:49:04 2003
@@ -30,12 +30,13 @@
#include "winnls.h"
#include "winternl.h"
-static UNICODE_STRING uni;
-static STRING str;
-
/* Function ptrs for ntdll calls */
static HMODULE hntdll = 0;
+static NTSTATUS (WINAPI *pRtlAppendAsciizToString)(STRING *, LPCSTR);
+static NTSTATUS (WINAPI *pRtlAppendStringToString)(STRING *, const STRING *);
+static NTSTATUS (WINAPI *pRtlAppendUnicodeToString)(UNICODE_STRING *, LPCWSTR);
static NTSTATUS (WINAPI *pRtlAppendUnicodeStringToString)(UNICODE_STRING *, const UNICODE_STRING *);
+static NTSTATUS (WINAPI *pRtlFindCharInUnicodeString)(UNICODE_STRING *, WCHAR, UNICODE_STRING **, long);
static NTSTATUS (WINAPI *pRtlCharToInteger)(char *, ULONG, int *);
static VOID (WINAPI *pRtlCopyString)(STRING *, const STRING *);
static BOOLEAN (WINAPI *pRtlCreateUnicodeString)(PUNICODE_STRING, LPCWSTR);
@@ -93,7 +94,11 @@
hntdll = LoadLibraryA("ntdll.dll");
ok(hntdll != 0, "LoadLibrary failed");
if (hntdll) {
+ pRtlAppendAsciizToString = (void *)GetProcAddress(hntdll, "RtlAppendAsciizToString");
+ pRtlAppendStringToString = (void *)GetProcAddress(hntdll, "RtlAppendStringToString");
+ pRtlAppendUnicodeToString = (void *)GetProcAddress(hntdll, "RtlAppendUnicodeToString");
pRtlAppendUnicodeStringToString = (void *)GetProcAddress(hntdll, "RtlAppendUnicodeStringToString");
+ pRtlFindCharInUnicodeString = (void *)GetProcAddress(hntdll, "RtlFindCharInUnicodeString");
pRtlCharToInteger = (void *)GetProcAddress(hntdll, "RtlCharToInteger");
pRtlCopyString = (void *)GetProcAddress(hntdll, "RtlCopyString");
pRtlCreateUnicodeString = (void *)GetProcAddress(hntdll, "RtlCreateUnicodeString");
@@ -117,20 +122,22 @@
static void test_RtlInitString(void)
{
- static const char teststring[] = "Some Wild String";
- str.Length = 0;
- str.MaximumLength = 0;
- str.Buffer = (void *)0xdeadbeef;
- pRtlInitString(&str, teststring);
- ok(str.Length == sizeof(teststring) - sizeof(char), "Length uninitialized");
- ok(str.MaximumLength == sizeof(teststring), "MaximumLength uninitialized");
- ok(str.Buffer == teststring, "Buffer not equal to teststring");
- ok(strcmp(str.Buffer, "Some Wild String") == 0, "Buffer written to");
- pRtlInitString(&str, NULL);
- ok(str.Length == 0, "Length uninitialized");
- ok(str.MaximumLength == 0, "MaximumLength uninitialized");
- ok(str.Buffer == NULL, "Buffer not equal to NULL");
-/* pRtlInitString(NULL, teststring); */
+ static const char teststring[] = "Some Wild String";
+ STRING str;
+
+ str.Length = 0;
+ str.MaximumLength = 0;
+ str.Buffer = (void *)0xdeadbeef;
+ pRtlInitString(&str, teststring);
+ ok(str.Length == sizeof(teststring) - sizeof(char), "Length uninitialized");
+ ok(str.MaximumLength == sizeof(teststring), "MaximumLength uninitialized");
+ ok(str.Buffer == teststring, "Buffer not equal to teststring");
+ ok(strcmp(str.Buffer, "Some Wild String") == 0, "Buffer written to");
+ pRtlInitString(&str, NULL);
+ ok(str.Length == 0, "Length uninitialized");
+ ok(str.MaximumLength == 0, "MaximumLength uninitialized");
+ ok(str.Buffer == NULL, "Buffer not equal to NULL");
+/* pRtlInitString(NULL, teststring); */
}
@@ -138,33 +145,37 @@
{
#define STRINGW {'S','o','m','e',' ','W','i','l','d',' ','S','t','r','i','n','g',0}
static const WCHAR teststring[] = STRINGW;
- static const WCHAR originalstring[] = STRINGW;
+ static const WCHAR originalstring[] = STRINGW;
#undef STRINGW
- uni.Length = 0;
- uni.MaximumLength = 0;
- uni.Buffer = (void *)0xdeadbeef;
- pRtlInitUnicodeString(&uni, teststring);
- ok(uni.Length == sizeof(teststring) - sizeof(WCHAR), "Length uninitialized");
- ok(uni.MaximumLength == sizeof(teststring), "MaximumLength uninitialized");
- ok(uni.Buffer == teststring, "Buffer not equal to teststring");
- ok(lstrcmpW(uni.Buffer, originalstring) == 0, "Buffer written to");
- pRtlInitUnicodeString(&uni, NULL);
- ok(uni.Length == 0, "Length uninitialized");
- ok(uni.MaximumLength == 0, "MaximumLength uninitialized");
- ok(uni.Buffer == NULL, "Buffer not equal to NULL");
-/* pRtlInitUnicodeString(NULL, teststring); */
+ UNICODE_STRING uni;
+
+ uni.Length = 0;
+ uni.MaximumLength = 0;
+ uni.Buffer = (void *)0xdeadbeef;
+ pRtlInitUnicodeString(&uni, teststring);
+ ok(uni.Length == sizeof(teststring) - sizeof(WCHAR), "Length uninitialized");
+ ok(uni.MaximumLength == sizeof(teststring), "MaximumLength uninitialized");
+ ok(uni.Buffer == teststring, "Buffer not equal to teststring");
+ ok(lstrcmpW(uni.Buffer, originalstring) == 0, "Buffer written to");
+ pRtlInitUnicodeString(&uni, NULL);
+ ok(uni.Length == 0, "Length uninitialized");
+ ok(uni.MaximumLength == 0, "MaximumLength uninitialized");
+ ok(uni.Buffer == NULL, "Buffer not equal to NULL");
+/* pRtlInitUnicodeString(NULL, teststring); */
}
static void test_RtlCopyString(void)
{
- static const char teststring[] = "Some Wild String";
- static char deststring[] = " ";
- STRING deststr;
- pRtlInitString(&str, teststring);
- pRtlInitString(&deststr, deststring);
- pRtlCopyString(&deststr, &str);
- ok(strncmp(str.Buffer, deststring, str.Length) == 0, "String not copied");
+ static const char teststring[] = "Some Wild String";
+ static char deststring[] = " ";
+ STRING str;
+ STRING deststr;
+
+ pRtlInitString(&str, teststring);
+ pRtlInitString(&deststr, deststring);
+ pRtlCopyString(&deststr, &str);
+ ok(strncmp(str.Buffer, deststring, str.Length) == 0, "String not copied");
}
@@ -394,102 +405,388 @@
}
-static void test_RtlAppendUnicodeStringToString(void)
+typedef struct {
+ int ansi_Length;
+ int ansi_MaximumLength;
+ int ansi_buf_size;
+ char *ansi_buf;
+ int uni_Length;
+ int uni_MaximumLength;
+ int uni_buf_size;
+ char *uni_buf;
+ BOOLEAN doalloc;
+ int res_Length;
+ int res_MaximumLength;
+ int res_buf_size;
+ char *res_buf;
+ NTSTATUS result;
+} ustr2astr_t;
+
+static const ustr2astr_t ustr2astr[] = {
+ { 10, 12, 12, "------------", 0, 0, 0, "", TRUE, 0, 1, 1, "", STATUS_SUCCESS},
+ { 10, 12, 12, "------------", 12, 12, 12, "abcdef", TRUE, 6, 7, 7, "abcdef", STATUS_SUCCESS},
+ { 0, 2, 12, "------------", 12, 12, 12, "abcdef", TRUE, 6, 7, 7, "abcdef", STATUS_SUCCESS},
+ { 10, 12, 12, NULL, 12, 12, 12, "abcdef", TRUE, 6, 7, 7, "abcdef", STATUS_SUCCESS},
+ { 0, 0, 12, "------------", 12, 12, 12, "abcdef", FALSE, 6, 0, 0, "", STATUS_BUFFER_OVERFLOW},
+ { 0, 1, 12, "------------", 12, 12, 12, "abcdef", FALSE, 0, 1, 1, "", STATUS_BUFFER_OVERFLOW},
+ { 0, 2, 12, "------------", 12, 12, 12, "abcdef", FALSE, 1, 2, 2, "a", STATUS_BUFFER_OVERFLOW},
+ { 0, 3, 12, "------------", 12, 12, 12, "abcdef", FALSE, 2, 3, 3, "ab", STATUS_BUFFER_OVERFLOW},
+ { 0, 5, 12, "------------", 12, 12, 12, "abcdef", FALSE, 4, 5, 5, "abcd", STATUS_BUFFER_OVERFLOW},
+ { 8, 5, 12, "------------", 12, 12, 12, "abcdef", FALSE, 4, 5, 5, "abcd", STATUS_BUFFER_OVERFLOW},
+ { 8, 6, 12, "------------", 12, 12, 12, "abcdef", FALSE, 5, 6, 6, "abcde", STATUS_BUFFER_OVERFLOW},
+ { 8, 7, 12, "------------", 12, 12, 12, "abcdef", FALSE, 6, 7, 7, "abcdef", STATUS_SUCCESS},
+ { 8, 7, 12, "------------", 0, 12, 12, NULL, FALSE, 0, 7, 0, "", STATUS_SUCCESS},
+ { 0, 0, 12, NULL, 10, 10, 12, NULL, FALSE, 5, 0, 0, NULL, STATUS_BUFFER_OVERFLOW},
+};
+#define NB_USTR2ASTR (sizeof(ustr2astr)/sizeof(*ustr2astr))
+
+static void test_RtlUnicodeStringToAnsiString(void)
+{
+ int pos;
+ CHAR ansi_buf[257];
+ WCHAR uni_buf[257];
+ STRING ansi_str;
+ UNICODE_STRING uni_str;
+ NTSTATUS result;
+ int test_num;
+
+ for (test_num = 0; test_num < NB_USTR2ASTR; test_num++) {
+ ansi_str.Length = ustr2astr[test_num].ansi_Length;
+ ansi_str.MaximumLength = ustr2astr[test_num].ansi_MaximumLength;
+ if (ustr2astr[test_num].ansi_buf != NULL) {
+ memcpy(ansi_buf, ustr2astr[test_num].ansi_buf, ustr2astr[test_num].ansi_buf_size);
+ ansi_buf[ustr2astr[test_num].ansi_buf_size] = '\0';
+ ansi_str.Buffer = ansi_buf;
+ } else {
+ ansi_str.Buffer = NULL;
+ } /* if */
+ uni_str.Length = ustr2astr[test_num].uni_Length;
+ uni_str.MaximumLength = ustr2astr[test_num].uni_MaximumLength;
+ if (ustr2astr[test_num].uni_buf != NULL) {
+// memcpy(uni_buf, ustr2astr[test_num].uni_buf, ustr2astr[test_num].uni_buf_size);
+ for (pos = 0; pos < ustr2astr[test_num].uni_buf_size/sizeof(WCHAR); pos++) {
+ uni_buf[pos] = ustr2astr[test_num].uni_buf[pos];
+ } /* for */
+// uni_buf[ustr2astr[test_num].uni_buf_size/sizeof(WCHAR)] = '\0';
+ uni_str.Buffer = uni_buf;
+ } else {
+ uni_str.Buffer = NULL;
+ } /* if */
+ result = pRtlUnicodeStringToAnsiString(&ansi_str, &uni_str, ustr2astr[test_num].doalloc);
+ ok(result == ustr2astr[test_num].result,
+ "(test %d): RtlUnicodeStringToAnsiString(ansi, uni, %d) has result %lx, expected %lx",
+ test_num, ustr2astr[test_num].doalloc, result, ustr2astr[test_num].result);
+ ok(ansi_str.Length == ustr2astr[test_num].res_Length,
+ "(test %d): RtlUnicodeStringToAnsiString(ansi, uni, %d) ansi has Length %d, expected %d",
+ test_num, ustr2astr[test_num].doalloc, ansi_str.Length, ustr2astr[test_num].res_Length);
+ ok(ansi_str.MaximumLength == ustr2astr[test_num].res_MaximumLength,
+ "(test %d): RtlUnicodeStringToAnsiString(ansi, uni, %d) ansi has MaximumLength %d, expected %d",
+ test_num, ustr2astr[test_num].doalloc, ansi_str.MaximumLength, ustr2astr[test_num].res_MaximumLength);
+ ok(memcmp(ansi_str.Buffer, ustr2astr[test_num].res_buf, ustr2astr[test_num].res_buf_size) == 0,
+ "(test %d): RtlUnicodeStringToAnsiString(ansi, uni, %d) has ansi \"%s\" expected \"%s\"",
+ test_num, ustr2astr[test_num].doalloc, ansi_str.Buffer, ustr2astr[test_num].res_buf);
+ } /* for */
+}
+
+
+typedef struct {
+ int dest_Length;
+ int dest_MaximumLength;
+ int dest_buf_size;
+ char *dest_buf;
+ char *src;
+ int res_Length;
+ int res_MaximumLength;
+ int res_buf_size;
+ char *res_buf;
+ NTSTATUS result;
+} app_asc2str_t;
+
+static const app_asc2str_t app_asc2str[] = {
+ { 5, 12, 15, "TestS01234abcde", "tring", 10, 12, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 11, 15, "TestS01234abcde", "tring", 10, 11, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 10, 15, "TestS01234abcde", "tring", 10, 10, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 9, 15, "TestS01234abcde", "tring", 5, 9, 15, "TestS01234abcde", STATUS_BUFFER_TOO_SMALL},
+ { 5, 0, 15, "TestS01234abcde", "tring", 5, 0, 15, "TestS01234abcde", STATUS_BUFFER_TOO_SMALL},
+ { 5, 14, 15, "TestS01234abcde", "tring", 10, 14, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 14, 15, "TestS01234abcde", NULL, 5, 14, 15, "TestS01234abcde", STATUS_SUCCESS},
+ { 5, 14, 15, NULL, NULL, 5, 14, 15, NULL, STATUS_SUCCESS},
+ { 5, 12, 15, "Tst\0S01234abcde", "tr\0i", 7, 12, 15, "Tst\0Str234abcde", STATUS_SUCCESS},
+};
+#define NB_APP_ASC2STR (sizeof(app_asc2str)/sizeof(*app_asc2str))
+
+static void test_RtlAppendAsciizToString(void)
+{
+ CHAR dest_buf[257];
+ STRING dest_str;
+ NTSTATUS result;
+ int test_num;
+
+ for (test_num = 0; test_num < NB_APP_ASC2STR; test_num++) {
+ dest_str.Length = app_asc2str[test_num].dest_Length;
+ dest_str.MaximumLength = app_asc2str[test_num].dest_MaximumLength;
+ if (app_asc2str[test_num].dest_buf != NULL) {
+ memcpy(dest_buf, app_asc2str[test_num].dest_buf, app_asc2str[test_num].dest_buf_size);
+ dest_buf[app_asc2str[test_num].dest_buf_size] = '\0';
+ dest_str.Buffer = dest_buf;
+ } else {
+ dest_str.Buffer = NULL;
+ } /* if */
+ result = pRtlAppendAsciizToString(&dest_str, app_asc2str[test_num].src);
+ ok(result == app_asc2str[test_num].result,
+ "(test %d): RtlAppendAsciizToString(dest, src) has result %lx, expected %lx",
+ test_num, result, app_asc2str[test_num].result);
+ ok(dest_str.Length == app_asc2str[test_num].res_Length,
+ "(test %d): RtlAppendAsciizToString(dest, src) dest has Length %d, expected %d",
+ test_num, dest_str.Length, app_asc2str[test_num].res_Length);
+ ok(dest_str.MaximumLength == app_asc2str[test_num].res_MaximumLength,
+ "(test %d): RtlAppendAsciizToString(dest, src) dest has MaximumLength %d, expected %d",
+ test_num, dest_str.MaximumLength, app_asc2str[test_num].res_MaximumLength);
+ if (dest_str.Buffer == dest_buf) {
+ ok(memcmp(dest_buf, app_asc2str[test_num].res_buf, app_asc2str[test_num].res_buf_size) == 0,
+ "(test %d): RtlAppendAsciizToString(dest, src) has dest \"%s\" expected \"%s\"",
+ test_num, dest_buf, app_asc2str[test_num].res_buf);
+ } else {
+ ok(dest_str.Buffer == app_asc2str[test_num].res_buf,
+ "(test %d): RtlAppendAsciizToString(dest, src) dest has Buffer %p expected %p",
+ test_num, dest_str.Buffer, app_asc2str[test_num].res_buf);
+ } /* if */
+ } /* for */
+}
+
+
+typedef struct {
+ int dest_Length;
+ int dest_MaximumLength;
+ int dest_buf_size;
+ char *dest_buf;
+ int src_Length;
+ int src_MaximumLength;
+ int src_buf_size;
+ char *src_buf;
+ int res_Length;
+ int res_MaximumLength;
+ int res_buf_size;
+ char *res_buf;
+ NTSTATUS result;
+} app_str2str_t;
+
+static const app_str2str_t app_str2str[] = {
+ { 5, 12, 15, "TestS01234abcde", 5, 5, 7, "tringZY", 10, 12, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 11, 15, "TestS01234abcde", 5, 5, 7, "tringZY", 10, 11, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 10, 15, "TestS01234abcde", 5, 5, 7, "tringZY", 10, 10, 15, "TestStringabcde", STATUS_SUCCESS},
+ { 5, 9, 15, "TestS01234abcde", 5, 5, 7, "tringZY", 5, 9, 15, "TestS01234abcde", STATUS_BUFFER_TOO_SMALL},
+ { 5, 0, 15, "TestS01234abcde", 0, 0, 7, "tringZY", 5, 0, 15, "TestS01234abcde", STATUS_SUCCESS},
+ { 5, 14, 15, "TestS01234abcde", 0, 0, 7, "tringZY", 5, 14, 15, "TestS01234abcde", STATUS_SUCCESS},
+ { 5, 14, 15, "TestS01234abcde", 0, 0, 7, NULL, 5, 14, 15, "TestS01234abcde", STATUS_SUCCESS},
+ { 5, 14, 15, NULL, 0, 0, 7, NULL, 5, 14, 15, NULL, STATUS_SUCCESS},
+ { 5, 12, 15, "Tst\0S01234abcde", 4, 4, 7, "tr\0iZY", 9, 12, 15, "Tst\0Str\0i4abcde", STATUS_SUCCESS},
+};
+#define NB_APP_STR2STR (sizeof(app_str2str)/sizeof(*app_str2str))
+
+static void test_RtlAppendStringToString(void)
{
CHAR dest_buf[257];
CHAR src_buf[257];
+ STRING dest_str;
+ STRING src_str;
+ NTSTATUS result;
+ int test_num;
+
+ for (test_num = 0; test_num < NB_APP_STR2STR; test_num++) {
+ dest_str.Length = app_str2str[test_num].dest_Length;
+ dest_str.MaximumLength = app_str2str[test_num].dest_MaximumLength;
+ if (app_str2str[test_num].dest_buf != NULL) {
+ memcpy(dest_buf, app_str2str[test_num].dest_buf, app_str2str[test_num].dest_buf_size);
+ dest_buf[app_str2str[test_num].dest_buf_size] = '\0';
+ dest_str.Buffer = dest_buf;
+ } else {
+ dest_str.Buffer = NULL;
+ } /* if */
+ src_str.Length = app_str2str[test_num].src_Length;
+ src_str.MaximumLength = app_str2str[test_num].src_MaximumLength;
+ if (app_str2str[test_num].src_buf != NULL) {
+ memcpy(src_buf, app_str2str[test_num].src_buf, app_str2str[test_num].src_buf_size);
+ src_buf[app_str2str[test_num].src_buf_size] = '\0';
+ src_str.Buffer = src_buf;
+ } else {
+ src_str.Buffer = NULL;
+ } /* if */
+ result = pRtlAppendStringToString(&dest_str, &src_str);
+ ok(result == app_str2str[test_num].result,
+ "(test %d): RtlAppendStringToString(dest, src) has result %lx, expected %lx",
+ test_num, result, app_str2str[test_num].result);
+ ok(dest_str.Length == app_str2str[test_num].res_Length,
+ "(test %d): RtlAppendStringToString(dest, src) dest has Length %d, expected %d",
+ test_num, dest_str.Length, app_str2str[test_num].res_Length);
+ ok(dest_str.MaximumLength == app_str2str[test_num].res_MaximumLength,
+ "(test %d): RtlAppendStringToString(dest, src) dest has MaximumLength %d, expected %d",
+ test_num, dest_str.MaximumLength, app_str2str[test_num].res_MaximumLength);
+ if (dest_str.Buffer == dest_buf) {
+ ok(memcmp(dest_buf, app_str2str[test_num].res_buf, app_str2str[test_num].res_buf_size) == 0,
+ "(test %d): RtlAppendStringToString(dest, src) has dest \"%s\" expected \"%s\"",
+ test_num, dest_buf, app_str2str[test_num].res_buf);
+ } else {
+ ok(dest_str.Buffer == app_str2str[test_num].res_buf,
+ "(test %d): RtlAppendStringToString(dest, src) dest has Buffer %p expected %p",
+ test_num, dest_str.Buffer, app_str2str[test_num].res_buf);
+ } /* if */
+ } /* for */
+}
+
+
+typedef struct {
+ int dest_Length;
+ int dest_MaximumLength;
+ int dest_buf_size;
+ char *dest_buf;
+ char *src;
+ int res_Length;
+ int res_MaximumLength;
+ int res_buf_size;
+ char *res_buf;
+ NTSTATUS result;
+} app_uni2str_t;
+
+static const app_uni2str_t app_uni2str[] = {
+ { 4, 12, 14, "Fake0123abcdef", "Ustr\0", 8, 12, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+ { 4, 11, 14, "Fake0123abcdef", "Ustr\0", 8, 11, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+ { 4, 10, 14, "Fake0123abcdef", "Ustr\0", 8, 10, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+/* In the following test the native function writes beyond MaximumLength
+ * { 4, 9, 14, "Fake0123abcdef", "Ustr\0", 8, 9, 14, "FakeUstrabcdef", STATUS_SUCCESS},
+ */
+ { 4, 8, 14, "Fake0123abcdef", "Ustr\0", 8, 8, 14, "FakeUstrabcdef", STATUS_SUCCESS},
+ { 4, 7, 14, "Fake0123abcdef", "Ustr\0", 4, 7, 14, "Fake0123abcdef", STATUS_BUFFER_TOO_SMALL},
+ { 4, 0, 14, "Fake0123abcdef", "Ustr\0", 4, 0, 14, "Fake0123abcdef", STATUS_BUFFER_TOO_SMALL},
+ { 4, 14, 14, "Fake0123abcdef", "Ustr\0", 8, 14, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+ { 4, 14, 14, "Fake0123abcdef", NULL, 4, 14, 14, "Fake0123abcdef", STATUS_SUCCESS},
+ { 4, 14, 14, NULL, NULL, 4, 14, 14, NULL, STATUS_SUCCESS},
+ { 4, 14, 14, "Fake0123abcdef", "U\0stri\0", 10, 14, 14, "FakeU\0stri\0\0ef", STATUS_SUCCESS},
+ { 6, 14, 16, "Te\0\0stabcdefghij", "St\0\0ri", 8, 14, 16, "Te\0\0stSt\0\0efghij", STATUS_SUCCESS},
+};
+#define NB_APP_UNI2STR (sizeof(app_uni2str)/sizeof(*app_uni2str))
+
+static void test_RtlAppendUnicodeToString(void)
+{
+ WCHAR dest_buf[257];
+ UNICODE_STRING dest_str;
+ NTSTATUS result;
+ int test_num;
+
+ for (test_num = 0; test_num < NB_APP_UNI2STR; test_num++) {
+ dest_str.Length = app_uni2str[test_num].dest_Length;
+ dest_str.MaximumLength = app_uni2str[test_num].dest_MaximumLength;
+ if (app_uni2str[test_num].dest_buf != NULL) {
+ memcpy(dest_buf, app_uni2str[test_num].dest_buf, app_uni2str[test_num].dest_buf_size);
+ dest_buf[app_uni2str[test_num].dest_buf_size/sizeof(WCHAR)] = '\0';
+ dest_str.Buffer = dest_buf;
+ } else {
+ dest_str.Buffer = NULL;
+ } /* if */
+ result = pRtlAppendUnicodeToString(&dest_str, (LPCWSTR) app_uni2str[test_num].src);
+ ok(result == app_uni2str[test_num].result,
+ "(test %d): RtlAppendUnicodeToString(dest, src) has result %lx, expected %lx",
+ test_num, result, app_uni2str[test_num].result);
+ ok(dest_str.Length == app_uni2str[test_num].res_Length,
+ "(test %d): RtlAppendUnicodeToString(dest, src) dest has Length %d, expected %d",
+ test_num, dest_str.Length, app_uni2str[test_num].res_Length);
+ ok(dest_str.MaximumLength == app_uni2str[test_num].res_MaximumLength,
+ "(test %d): RtlAppendUnicodeToString(dest, src) dest has MaximumLength %d, expected %d",
+ test_num, dest_str.MaximumLength, app_uni2str[test_num].res_MaximumLength);
+ if (dest_str.Buffer == dest_buf) {
+ ok(memcmp(dest_buf, app_uni2str[test_num].res_buf, app_uni2str[test_num].res_buf_size) == 0,
+ "(test %d): RtlAppendUnicodeToString(dest, src) has dest \"%s\" expected \"%s\"",
+ test_num, (char *) dest_buf, app_uni2str[test_num].res_buf);
+ } else {
+ ok(dest_str.Buffer == (WCHAR *) app_uni2str[test_num].res_buf,
+ "(test %d): RtlAppendUnicodeToString(dest, src) dest has Buffer %p expected %p",
+ test_num, dest_str.Buffer, app_uni2str[test_num].res_buf);
+ } /* if */
+ } /* for */
+}
+
+
+typedef struct {
+ int dest_Length;
+ int dest_MaximumLength;
+ int dest_buf_size;
+ char *dest_buf;
+ int src_Length;
+ int src_MaximumLength;
+ int src_buf_size;
+ char *src_buf;
+ int res_Length;
+ int res_MaximumLength;
+ int res_buf_size;
+ char *res_buf;
+ NTSTATUS result;
+} app_ustr2str_t;
+
+static const app_ustr2str_t app_ustr2str[] = {
+ { 4, 12, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 8, 12, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+ { 4, 11, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 8, 11, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+ { 4, 10, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 8, 10, 14, "FakeUstr\0\0cdef", STATUS_SUCCESS},
+/* In the following test the native function writes beyond MaximumLength
+ * { 4, 9, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 8, 9, 14, "FakeUstrabcdef", STATUS_SUCCESS},
+ */
+ { 4, 8, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 8, 8, 14, "FakeUstrabcdef", STATUS_SUCCESS},
+ { 4, 7, 14, "Fake0123abcdef", 4, 6, 8, "UstrZYXW", 4, 7, 14, "Fake0123abcdef", STATUS_BUFFER_TOO_SMALL},
+ { 4, 0, 14, "Fake0123abcdef", 0, 0, 8, "UstrZYXW", 4, 0, 14, "Fake0123abcdef", STATUS_SUCCESS},
+ { 4, 14, 14, "Fake0123abcdef", 0, 0, 8, "UstrZYXW", 4, 14, 14, "Fake0123abcdef", STATUS_SUCCESS},
+ { 4, 14, 14, "Fake0123abcdef", 0, 0, 8, NULL, 4, 14, 14, "Fake0123abcdef", STATUS_SUCCESS},
+ { 4, 14, 14, NULL, 0, 0, 8, NULL, 4, 14, 14, NULL, STATUS_SUCCESS},
+ { 6, 14, 16, "Te\0\0stabcdefghij", 6, 8, 8, "St\0\0riZY", 12, 14, 16, "Te\0\0stSt\0\0ri\0\0ij", STATUS_SUCCESS},
+};
+#define NB_APP_USTR2STR (sizeof(app_ustr2str)/sizeof(*app_ustr2str))
+
+static void test_RtlAppendUnicodeStringToString(void)
+{
+ WCHAR dest_buf[257];
+ WCHAR src_buf[257];
UNICODE_STRING dest_str;
UNICODE_STRING src_str;
NTSTATUS result;
+ int test_num;
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- strcpy(src_buf, "nicodeStringZYXWVUTS");
- dest_str.Length = 12;
- dest_str.MaximumLength = 26;
- dest_str.Buffer = (WCHAR *) dest_buf;
- src_str.Length = 12;
- src_str.MaximumLength = 12;
- src_str.Buffer = (WCHAR *) src_buf;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeUnicodeString\0\0efghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 25;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeUnicodeString\0\0efghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 24;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeUnicodeStringcdefghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 23;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_BUFFER_TOO_SMALL,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeU0123456789abcdefghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 0;
- src_str.Length = 0;
- src_str.MaximumLength = 0;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeU0123456789abcdefghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 22;
- src_str.Length = 0;
- src_str.MaximumLength = 0;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeU0123456789abcdefghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
-
- strcpy(dest_buf, "ThisisafakeU0123456789abcdefghij");
- dest_str.Length = 12;
- dest_str.MaximumLength = 22;
- src_str.Length = 0;
- src_str.MaximumLength = 0;
- src_str.Buffer = NULL;
- result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
- ok(result == STATUS_SUCCESS,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has result %lx",
- result);
- ok(memcmp(dest_buf, "ThisisafakeU0123456789abcdefghij", 32) == 0,
- "call failed: RtlAppendUnicodeStringToString(dest, src) has dest \"%s\"",
- dest_buf);
+ for (test_num = 0; test_num < NB_APP_USTR2STR; test_num++) {
+ dest_str.Length = app_ustr2str[test_num].dest_Length;
+ dest_str.MaximumLength = app_ustr2str[test_num].dest_MaximumLength;
+ if (app_ustr2str[test_num].dest_buf != NULL) {
+ memcpy(dest_buf, app_ustr2str[test_num].dest_buf, app_ustr2str[test_num].dest_buf_size);
+ dest_buf[app_ustr2str[test_num].dest_buf_size/sizeof(WCHAR)] = '\0';
+ dest_str.Buffer = dest_buf;
+ } else {
+ dest_str.Buffer = NULL;
+ } /* if */
+ src_str.Length = app_ustr2str[test_num].src_Length;
+ src_str.MaximumLength = app_ustr2str[test_num].src_MaximumLength;
+ if (app_ustr2str[test_num].src_buf != NULL) {
+ memcpy(src_buf, app_ustr2str[test_num].src_buf, app_ustr2str[test_num].src_buf_size);
+ src_buf[app_ustr2str[test_num].src_buf_size/sizeof(WCHAR)] = '\0';
+ src_str.Buffer = src_buf;
+ } else {
+ src_str.Buffer = NULL;
+ } /* if */
+ result = pRtlAppendUnicodeStringToString(&dest_str, &src_str);
+ ok(result == app_ustr2str[test_num].result,
+ "(test %d): RtlAppendStringToString(dest, src) has result %lx, expected %lx",
+ test_num, result, app_ustr2str[test_num].result);
+ ok(dest_str.Length == app_ustr2str[test_num].res_Length,
+ "(test %d): RtlAppendStringToString(dest, src) dest has Length %d, expected %d",
+ test_num, dest_str.Length, app_ustr2str[test_num].res_Length);
+ ok(dest_str.MaximumLength == app_ustr2str[test_num].res_MaximumLength,
+ "(test %d): RtlAppendStringToString(dest, src) dest has MaximumLength %d, expected %d",
+ test_num, dest_str.MaximumLength, app_ustr2str[test_num].res_MaximumLength);
+ if (dest_str.Buffer == dest_buf) {
+ ok(memcmp(dest_buf, app_ustr2str[test_num].res_buf, app_ustr2str[test_num].res_buf_size) == 0,
+ "(test %d): RtlAppendStringToString(dest, src) has dest \"%s\" expected \"%s\"",
+ test_num, (char *) dest_buf, app_ustr2str[test_num].res_buf);
+ } else {
+ ok(dest_str.Buffer == (WCHAR *) app_ustr2str[test_num].res_buf,
+ "(test %d): RtlAppendStringToString(dest, src) dest has Buffer %p expected %p",
+ test_num, dest_str.Buffer, app_ustr2str[test_num].res_buf);
+ } /* if */
+ } /* for */
}
@@ -623,6 +920,7 @@
int value;
NTSTATUS result;
WCHAR *wstr;
+ UNICODE_STRING uni;
for (test_num = 0; test_num < NB_STR2INT; test_num++) {
wstr = AtoW(str2int[test_num].str);
@@ -968,6 +1266,10 @@
test_RtlIntegerToChar();
test_RtlUpperChar();
test_RtlUpperString();
+ test_RtlUnicodeStringToAnsiString();
+ test_RtlAppendAsciizToString();
+ test_RtlAppendStringToString();
+ test_RtlAppendUnicodeToString();
test_RtlAppendUnicodeStringToString();
} /* if */
/*
More information about the wine-patches
mailing list