d64cfe86cccf9c219bcfcd6f410ab6268d7cc237
[reactos.git] / modules / rostests / winetests / msvcrt / misc.c
1 /*
2 * Unit tests for miscellaneous msvcrt functions
3 *
4 * Copyright 2010 Andrew Nguyen
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
19 */
20
21 #include "precomp.h"
22
23 #include <msvcrt.h>
24
25 static inline float __port_infinity(void)
26 {
27 static const unsigned __inf_bytes = 0x7f800000;
28 return *(const float *)&__inf_bytes;
29 }
30 #define INFINITY __port_infinity()
31
32 static inline float __port_nan(void)
33 {
34 static const unsigned __nan_bytes = 0x7fc00000;
35 return *(const float *)&__nan_bytes;
36 }
37 #define NAN __port_nan()
38
39 static inline BOOL almost_equal(double d1, double d2) {
40 if(d1-d2>-1e-30 && d1-d2<1e-30)
41 return TRUE;
42 return FALSE;
43 }
44
45 static int (__cdecl *prand_s)(unsigned int *);
46 static int (__cdecl *pI10_OUTPUT)(long double, int, int, void*);
47 static int (__cdecl *pstrerror_s)(char *, MSVCRT_size_t, int);
48 static int (__cdecl *p_get_doserrno)(int *);
49 static int (__cdecl *p_get_errno)(int *);
50 static int (__cdecl *p_set_doserrno)(int);
51 static int (__cdecl *p_set_errno)(int);
52 static void (__cdecl *p__invalid_parameter)(const wchar_t*,
53 const wchar_t*, const wchar_t*, unsigned int, uintptr_t);
54 static void (__cdecl *p_qsort_s)(void*, MSVCRT_size_t, MSVCRT_size_t,
55 int (__cdecl*)(void*, const void*, const void*), void*);
56 static double (__cdecl *p_atan)(double);
57 static double (__cdecl *p_exp)(double);
58 static double (__cdecl *p_tanh)(double);
59 static void *(__cdecl *p_lfind_s)(const void*, const void*, unsigned int*,
60 size_t, int (__cdecl *)(void*, const void*, const void*), void*);
61
62 static void init(void)
63 {
64 HMODULE hmod = GetModuleHandleA("msvcrt.dll");
65
66 prand_s = (void *)GetProcAddress(hmod, "rand_s");
67 pI10_OUTPUT = (void*)GetProcAddress(hmod, "$I10_OUTPUT");
68 pstrerror_s = (void *)GetProcAddress(hmod, "strerror_s");
69 p_get_doserrno = (void *)GetProcAddress(hmod, "_get_doserrno");
70 p_get_errno = (void *)GetProcAddress(hmod, "_get_errno");
71 p_set_doserrno = (void *)GetProcAddress(hmod, "_set_doserrno");
72 p_set_errno = (void *)GetProcAddress(hmod, "_set_errno");
73 p__invalid_parameter = (void *)GetProcAddress(hmod, "_invalid_parameter");
74 p_qsort_s = (void *)GetProcAddress(hmod, "qsort_s");
75 p_atan = (void *)GetProcAddress(hmod, "atan");
76 p_exp = (void *)GetProcAddress(hmod, "exp");
77 p_tanh = (void *)GetProcAddress(hmod, "tanh");
78 p_lfind_s = (void *)GetProcAddress(hmod, "_lfind_s");
79 }
80
81 static void test_rand_s(void)
82 {
83 int ret;
84 unsigned int rand;
85
86 if (!prand_s)
87 {
88 win_skip("rand_s is not available\n");
89 return;
90 }
91
92 errno = EBADF;
93 ret = prand_s(NULL);
94 ok(ret == EINVAL, "Expected rand_s to return EINVAL, got %d\n", ret);
95 ok(errno == EINVAL, "Expected errno to return EINVAL, got %d\n", errno);
96
97 ret = prand_s(&rand);
98 ok(ret == 0, "Expected rand_s to return 0, got %d\n", ret);
99 }
100
101 typedef struct _I10_OUTPUT_data {
102 short pos;
103 char sign;
104 BYTE len;
105 char str[100];
106 } I10_OUTPUT_data;
107
108 typedef struct _I10_OUTPUT_test {
109 long double d;
110 int size;
111 int flags;
112
113 I10_OUTPUT_data out;
114 int ret;
115 const char *remain;
116 } I10_OUTPUT_test;
117
118 static const I10_OUTPUT_test I10_OUTPUT_tests[] = {
119 /* arg3 = 0 */
120 { 0.0, 10, 0, {0, ' ', 1, "0"}, 1, "" },
121 { 1.0, 10, 0, {1, ' ', 1, "1"}, 1, "000000009" },
122 { -1.0, 10, 0, {1, '-', 1, "1"}, 1, "000000009" },
123 { 1.23, 10, 0, {1, ' ', 3, "123"}, 1, "0000009" },
124 { 1e13, 10, 0, {14, ' ', 1, "1"}, 1, "000000009" },
125 { 1e30, 30, 0, {31, ' ', 21, "100000000000000001988"}, 1, "" },
126 { 1e-13, 10, 0, {-12, ' ', 1, "1"}, 1, "000000000" },
127 { 0.25, 10, 0, {0, ' ', 2, "25"}, 1, "00000000" },
128 { 1.0000001, 10, 0, {1, ' ', 8, "10000001"}, 1, "00" },
129 /* arg3 = 1 */
130 { 0.0, 10, 1, {0, ' ', 1, "0"}, 1, "" },
131 { 1.0, 10, 1, {1, ' ', 1, "1"}, 1, "0000000009" },
132 { -1.0, 10, 1, {1, '-', 1, "1"}, 1, "0000000009" },
133 { 1.23, 10, 1, {1, ' ', 3, "123"}, 1, "00000009" },
134 { 1e13, 10, 1, {14, ' ', 1, "1"}, 1, "00000000000000000009" },
135 { 1e30, 30, 1, {31, ' ', 21, "100000000000000001988"}, 1, "" },
136 { 1e-13, 10, 1, {0, ' ', 1, "0"}, 1, "" },
137 { 1e-7, 10, 1, {-6, ' ', 1, "1"}, 1, "09" },
138 { 0.25, 10, 1, {0, ' ', 2, "25"}, 1, "00000000" },
139 { 1.0000001, 10, 1, {1, ' ', 8, "10000001"}, 1, "000" },
140 /* too small buffer */
141 { 0.0, 0, 0, {0, ' ', 1, "0"}, 1, "" },
142 { 0.0, 0, 1, {0, ' ', 1, "0"}, 1, "" },
143 { 123.0, 2, 0, {3, ' ', 2, "12"}, 1, "" },
144 { 123.0, 0, 0, {0, ' ', 1, "0"}, 1, "" },
145 { 123.0, 2, 1, {3, ' ', 3, "123"}, 1, "09" },
146 { 0.99, 1, 0, {1, ' ', 1, "1"}, 1, "" },
147 { 1264567.0, 2, 0, {7, ' ', 2, "13"}, 1, "" },
148 { 1264567.0, 2, 1, {7, ' ', 7, "1264567"}, 1, "00" },
149 { 1234567891.0, 2, 1, {10, ' ', 10, "1234567891"}, 1, "09" }
150 };
151
152 static void test_I10_OUTPUT(void)
153 {
154 I10_OUTPUT_data out;
155 int i, j = sizeof(long double), ret;
156
157 if(!pI10_OUTPUT) {
158 win_skip("I10_OUTPUT not available\n");
159 return;
160 }
161 if (j != 12)
162 trace("sizeof(long double) = %d on this machine\n", j);
163
164 for(i=0; i<sizeof(I10_OUTPUT_tests)/sizeof(I10_OUTPUT_test); i++) {
165 memset(out.str, '#', sizeof(out.str));
166
167 if (sizeof(long double) == 12)
168 ret = pI10_OUTPUT(I10_OUTPUT_tests[i].d, I10_OUTPUT_tests[i].size, I10_OUTPUT_tests[i].flags, &out);
169 else {
170 /* MS' "long double" is an 80 bit FP that takes 12 bytes*/
171 typedef struct { ULONG x80[3]; } uld; /* same calling convention */
172 union { long double ld; uld ld12; } fp80;
173 int (__cdecl *pI10_OUTPUT12)(uld, int, int, void*) = (void*)pI10_OUTPUT;
174 fp80.ld = I10_OUTPUT_tests[i].d;
175 ret = pI10_OUTPUT12(fp80.ld12, I10_OUTPUT_tests[i].size, I10_OUTPUT_tests[i].flags, &out);
176 }
177 ok(ret == I10_OUTPUT_tests[i].ret, "%d: ret = %d\n", i, ret);
178 ok(out.pos == I10_OUTPUT_tests[i].out.pos, "%d: out.pos = %hd\n", i, out.pos);
179 ok(out.sign == I10_OUTPUT_tests[i].out.sign, "%d: out.size = %c\n", i, out.sign);
180 ok(out.len == I10_OUTPUT_tests[i].out.len, "%d: out.len = %d\n", i, (int)out.len);
181 ok(!strcmp(out.str, I10_OUTPUT_tests[i].out.str), "%d: out.str = %s\n", i, out.str);
182
183 j = strlen(I10_OUTPUT_tests[i].remain);
184 todo_wine_if(j && I10_OUTPUT_tests[i].remain[j-1]=='9')
185 ok(!strncmp(out.str+out.len+1, I10_OUTPUT_tests[i].remain, j),
186 "%d: &out.str[%d] = %.25s...\n", i, out.len+1, out.str+out.len+1);
187
188 for(j=out.len+strlen(I10_OUTPUT_tests[i].remain)+1; j<sizeof(out.str); j++)
189 if(out.str[j] != '#')
190 ok(0, "%d: out.str[%d] = %c (expected \'#\')\n", i, j, out.str[j]);
191 }
192 }
193
194 static void test_strerror_s(void)
195 {
196 int ret;
197 char buf[256];
198
199 if (!pstrerror_s)
200 {
201 win_skip("strerror_s is not available\n");
202 return;
203 }
204
205 errno = EBADF;
206 ret = pstrerror_s(NULL, 0, 0);
207 ok(ret == EINVAL, "Expected strerror_s to return EINVAL, got %d\n", ret);
208 ok(errno == EINVAL, "Expected errno to be EINVAL, got %d\n", errno);
209
210 errno = EBADF;
211 ret = pstrerror_s(NULL, sizeof(buf), 0);
212 ok(ret == EINVAL, "Expected strerror_s to return EINVAL, got %d\n", ret);
213 ok(errno == EINVAL, "Expected errno to be EINVAL, got %d\n", errno);
214
215 memset(buf, 'X', sizeof(buf));
216 errno = EBADF;
217 ret = pstrerror_s(buf, 0, 0);
218 ok(ret == EINVAL, "Expected strerror_s to return EINVAL, got %d\n", ret);
219 ok(errno == EINVAL, "Expected errno to be EINVAL, got %d\n", errno);
220 ok(buf[0] == 'X', "Expected output buffer to be untouched\n");
221
222 memset(buf, 'X', sizeof(buf));
223 ret = pstrerror_s(buf, 1, 0);
224 ok(ret == 0, "Expected strerror_s to return 0, got %d\n", ret);
225 ok(strlen(buf) == 0, "Expected output buffer to be null terminated\n");
226
227 memset(buf, 'X', sizeof(buf));
228 ret = pstrerror_s(buf, 2, 0);
229 ok(ret == 0, "Expected strerror_s to return 0, got %d\n", ret);
230 ok(strlen(buf) == 1, "Expected output buffer to be truncated\n");
231
232 memset(buf, 'X', sizeof(buf));
233 ret = pstrerror_s(buf, sizeof(buf), 0);
234 ok(ret == 0, "Expected strerror_s to return 0, got %d\n", ret);
235
236 memset(buf, 'X', sizeof(buf));
237 ret = pstrerror_s(buf, sizeof(buf), -1);
238 ok(ret == 0, "Expected strerror_s to return 0, got %d\n", ret);
239 }
240
241 static void test__get_doserrno(void)
242 {
243 int ret, out;
244
245 if (!p_get_doserrno)
246 {
247 win_skip("_get_doserrno is not available\n");
248 return;
249 }
250
251 _doserrno = ERROR_INVALID_CMM;
252 errno = EBADF;
253 ret = p_get_doserrno(NULL);
254 ok(ret == EINVAL, "Expected _get_doserrno to return EINVAL, got %d\n", ret);
255 ok(_doserrno == ERROR_INVALID_CMM, "Expected _doserrno to be ERROR_INVALID_CMM, got %d\n", _doserrno);
256 ok(errno == EBADF, "Expected errno to be EBADF, got %d\n", errno);
257
258 _doserrno = ERROR_INVALID_CMM;
259 errno = EBADF;
260 out = 0xdeadbeef;
261 ret = p_get_doserrno(&out);
262 ok(ret == 0, "Expected _get_doserrno to return 0, got %d\n", ret);
263 ok(out == ERROR_INVALID_CMM, "Expected output variable to be ERROR_INVALID_CMM, got %d\n", out);
264 }
265
266 static void test__get_errno(void)
267 {
268 int ret, out;
269
270 if (!p_get_errno)
271 {
272 win_skip("_get_errno is not available\n");
273 return;
274 }
275
276 errno = EBADF;
277 ret = p_get_errno(NULL);
278 ok(ret == EINVAL, "Expected _get_errno to return EINVAL, got %d\n", ret);
279 ok(errno == EBADF, "Expected errno to be EBADF, got %d\n", errno);
280
281 errno = EBADF;
282 out = 0xdeadbeef;
283 ret = p_get_errno(&out);
284 ok(ret == 0, "Expected _get_errno to return 0, got %d\n", ret);
285 ok(out == EBADF, "Expected output variable to be EBADF, got %d\n", out);
286 }
287
288 static void test__set_doserrno(void)
289 {
290 int ret;
291
292 if (!p_set_doserrno)
293 {
294 win_skip("_set_doserrno is not available\n");
295 return;
296 }
297
298 _doserrno = ERROR_INVALID_CMM;
299 ret = p_set_doserrno(ERROR_FILE_NOT_FOUND);
300 ok(ret == 0, "Expected _set_doserrno to return 0, got %d\n", ret);
301 ok(_doserrno == ERROR_FILE_NOT_FOUND,
302 "Expected _doserrno to be ERROR_FILE_NOT_FOUND, got %d\n", _doserrno);
303
304 _doserrno = ERROR_INVALID_CMM;
305 ret = p_set_doserrno(-1);
306 ok(ret == 0, "Expected _set_doserrno to return 0, got %d\n", ret);
307 ok(_doserrno == -1,
308 "Expected _doserrno to be -1, got %d\n", _doserrno);
309
310 _doserrno = ERROR_INVALID_CMM;
311 ret = p_set_doserrno(0xdeadbeef);
312 ok(ret == 0, "Expected _set_doserrno to return 0, got %d\n", ret);
313 ok(_doserrno == 0xdeadbeef,
314 "Expected _doserrno to be 0xdeadbeef, got %d\n", _doserrno);
315 }
316
317 static void test__set_errno(void)
318 {
319 int ret;
320
321 if (!p_set_errno)
322 {
323 win_skip("_set_errno is not available\n");
324 return;
325 }
326
327 errno = EBADF;
328 ret = p_set_errno(EINVAL);
329 ok(ret == 0, "Expected _set_errno to return 0, got %d\n", ret);
330 ok(errno == EINVAL, "Expected errno to be EINVAL, got %d\n", errno);
331
332 errno = EBADF;
333 ret = p_set_errno(-1);
334 ok(ret == 0, "Expected _set_errno to return 0, got %d\n", ret);
335 ok(errno == -1, "Expected errno to be -1, got %d\n", errno);
336
337 errno = EBADF;
338 ret = p_set_errno(0xdeadbeef);
339 ok(ret == 0, "Expected _set_errno to return 0, got %d\n", ret);
340 ok(errno == 0xdeadbeef, "Expected errno to be 0xdeadbeef, got %d\n", errno);
341 }
342
343 static void test__popen_child(void)
344 {
345 /* don't execute any tests here */
346 /* ExitProcess is used to set return code of _pclose */
347 printf("child output\n");
348 ExitProcess(0x37);
349 }
350
351 static void test__popen(const char *name)
352 {
353 FILE *pipe;
354 char buf[1024];
355 int ret;
356
357 sprintf(buf, "\"%s\" misc popen", name);
358 pipe = _popen(buf, "r");
359 ok(pipe != NULL, "_popen failed with error: %d\n", errno);
360
361 fgets(buf, sizeof(buf), pipe);
362 ok(!strcmp(buf, "child output\n"), "buf = %s\n", buf);
363
364 ret = _pclose(pipe);
365 ok(ret == 0x37, "_pclose returned %x, expected 0x37\n", ret);
366
367 errno = 0xdeadbeef;
368 ret = _pclose((FILE*)0xdeadbeef);
369 ok(ret == -1, "_pclose returned %x, expected -1\n", ret);
370 if(p_set_errno)
371 ok(errno == EBADF, "errno = %d\n", errno);
372 }
373
374 static void test__invalid_parameter(void)
375 {
376 if(!p__invalid_parameter) {
377 win_skip("_invalid_parameter not available\n");
378 return;
379 }
380
381 p__invalid_parameter(NULL, NULL, NULL, 0, 0);
382 }
383
384 struct qsort_test
385 {
386 int pos;
387 int *base;
388
389 struct {
390 int l;
391 int r;
392 } cmp[64];
393 };
394
395 static int __cdecl qsort_comp(void *ctx, const void *l, const void *r)
396 {
397 struct qsort_test *qt = ctx;
398
399 if(qt) {
400 ok(qt->pos < 64, "qt->pos = %d\n", qt->pos);
401 ok(qt->cmp[qt->pos].l == (int*)l-qt->base,
402 "%d) l on %ld position\n", qt->pos, (long)((int*)l - qt->base));
403 ok(qt->cmp[qt->pos].r == (int*)r-qt->base,
404 "%d) r on %ld position\n", qt->pos, (long)((int*)r - qt->base));
405 qt->pos++;
406 }
407
408 return *(int*)l%1000 - *(int*)r%1000;
409 }
410
411 static void test_qsort_s(void)
412 {
413 static const int nonstable_test[] = {9000, 8001, 7002, 6003, 1003, 5004, 4005, 3006, 2007};
414 int tab[100], i;
415
416 struct qsort_test small_sort = {
417 0, tab, {
418 {1, 0}, {2, 1}, {3, 2}, {4, 3}, {5, 4}, {6, 5}, {7, 6},
419 {1, 0}, {2, 1}, {3, 2}, {4, 3}, {5, 4}, {6, 5},
420 {1, 0}, {2, 1}, {3, 2}, {4, 3}, {5, 4},
421 {1, 0}, {2, 1}, {3, 2}, {4, 3},
422 {1, 0}, {2, 1}, {3, 2},
423 {1, 0}, {2, 1},
424 {1, 0}
425 }
426 }, small_sort2 = {
427 0, tab, {
428 {1, 0}, {2, 0}, {3, 0}, {4, 0}, {5, 0}, {6, 0}, {7, 0},
429 {1, 0}, {2, 1}, {3, 1}, {4, 1}, {5, 1}, {6, 1},
430 {1, 0}, {2, 1}, {3, 2}, {4, 2}, {5, 2},
431 {1, 0}, {2, 1}, {3, 2}, {4, 3},
432 {1, 0}, {2, 1}, {3, 2},
433 {1, 0}, {2, 1},
434 {1, 0}
435 }
436 }, quick_sort = {
437 0, tab, {
438 {0, 4}, {0, 8}, {4, 8},
439 {1, 4}, {2, 4}, {3, 4}, {5, 4}, {6, 4}, {7, 4}, {7, 4}, {6, 4},
440 {6, 4},
441 {8, 7},
442 {1, 0}, {2, 1}, {3, 2}, {4, 3}, {5, 4}, {6, 4},
443 {1, 0}, {2, 1}, {3, 2}, {4, 3}, {5, 3},
444 {1, 0}, {2, 1}, {3, 2}, {4, 2},
445 {1, 0}, {2, 1}, {3, 2},
446 {1, 0}, {2, 1},
447 {1, 0}
448 }
449 };
450
451 if(!p_qsort_s) {
452 win_skip("qsort_s not available\n");
453 return;
454 }
455
456 for(i=0; i<8; i++) tab[i] = i;
457 p_qsort_s(tab, 8, sizeof(int), qsort_comp, &small_sort);
458 ok(small_sort.pos == 28, "small_sort.pos = %d\n", small_sort.pos);
459 for(i=0; i<8; i++)
460 ok(tab[i] == i, "tab[%d] = %d\n", i, tab[i]);
461
462 for(i=0; i<8; i++) tab[i] = 7-i;
463 p_qsort_s(tab, 8, sizeof(int), qsort_comp, &small_sort2);
464 ok(small_sort2.pos == 28, "small_sort2.pos = %d\n", small_sort2.pos);
465 for(i=0; i<8; i++)
466 ok(tab[i] == i, "tab[%d] = %d\n", i, tab[i]);
467
468 for(i=0; i<9; i++) tab[i] = i;
469 tab[5] = 1;
470 tab[6] = 2;
471 p_qsort_s(tab, 9, sizeof(int), qsort_comp, &quick_sort);
472 ok(quick_sort.pos == 34, "quick_sort.pos = %d\n", quick_sort.pos);
473
474 /* show that qsort is not stable */
475 for(i=0; i<9; i++) tab[i] = 8-i + 1000*(i+1);
476 tab[0] = 1003;
477 p_qsort_s(tab, 9, sizeof(int), qsort_comp, NULL);
478 for(i=0; i<9; i++)
479 ok(tab[i] == nonstable_test[i], "tab[%d] = %d, expected %d\n", i, tab[i], nonstable_test[i]);
480
481 /* check if random data is sorted */
482 srand(0);
483 for(i=0; i<100; i++) tab[i] = rand()%1000;
484 p_qsort_s(tab, 100, sizeof(int), qsort_comp, NULL);
485 for(i=1; i<100; i++)
486 ok(tab[i-1] <= tab[i], "data sorted incorrectly on position %d: %d <= %d\n", i, tab[i-1], tab[i]);
487
488 /* test if random permutation is sorted correctly */
489 for(i=0; i<100; i++) tab[i] = i;
490 for(i=0; i<100; i++) {
491 int b = rand()%100;
492 int e = rand()%100;
493
494 if(b == e) continue;
495 tab[b] ^= tab[e];
496 tab[e] ^= tab[b];
497 tab[b] ^= tab[e];
498 }
499 p_qsort_s(tab, 100, sizeof(int), qsort_comp, NULL);
500 for(i=0; i<100; i++)
501 ok(tab[i] == i, "data sorted incorrectly on position %d: %d\n", i, tab[i]);
502 }
503
504 static void test_math_functions(void)
505 {
506 double ret;
507
508 errno = 0xdeadbeef;
509 p_atan(NAN);
510 ok(errno == EDOM, "errno = %d\n", errno);
511
512 errno = 0xdeadbeef;
513 ret = p_atan(INFINITY);
514 ok(almost_equal(ret, 1.57079632679489661923), "ret = %lf\n", ret);
515 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
516
517 errno = 0xdeadbeef;
518 ret = p_atan(-INFINITY);
519 ok(almost_equal(ret, -1.57079632679489661923), "ret = %lf\n", ret);
520 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
521
522 errno = 0xdeadbeef;
523 p_tanh(NAN);
524 ok(errno == EDOM, "errno = %d\n", errno);
525
526 errno = 0xdeadbeef;
527 ret = p_tanh(INFINITY);
528 ok(almost_equal(ret, 1.0), "ret = %lf\n", ret);
529 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
530
531 errno = 0xdeadbeef;
532 p_exp(NAN);
533 ok(errno == EDOM, "errno = %d\n", errno);
534
535 errno = 0xdeadbeef;
536 p_exp(INFINITY);
537 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
538 }
539
540 static void __cdecl test_thread_func(void *end_thread_type)
541 {
542 if (end_thread_type == (void*)1)
543 _endthread();
544 else if (end_thread_type == (void*)2)
545 ExitThread(0);
546 else if (end_thread_type == (void*)3)
547 _endthreadex(0);
548 }
549
550 static unsigned __stdcall test_thread_func_ex(void *arg)
551 {
552 _endthread();
553 return 0;
554 }
555
556 static void test_thread_handle_close(void)
557 {
558 HANDLE hThread;
559 DWORD ret;
560
561 /* _beginthread: handle is not closed on ExitThread and _endthreadex */
562 hThread = (HANDLE)_beginthread(test_thread_func, 0, NULL);
563 ok(hThread != INVALID_HANDLE_VALUE, "_beginthread failed (%d)\n", errno);
564 WaitForSingleObject(hThread, INFINITE);
565 ret = CloseHandle(hThread);
566 ok(!ret, "ret = %d\n", ret);
567
568 hThread = (HANDLE)_beginthread(test_thread_func, 0, (void*)1);
569 ok(hThread != INVALID_HANDLE_VALUE, "_beginthread failed (%d)\n", errno);
570 WaitForSingleObject(hThread, INFINITE);
571 ret = CloseHandle(hThread);
572 ok(!ret, "ret = %d\n", ret);
573
574 hThread = (HANDLE)_beginthread(test_thread_func, 0, (void*)2);
575 ok(hThread != INVALID_HANDLE_VALUE, "_beginthread failed (%d)\n", errno);
576 Sleep(150);
577 ret = WaitForSingleObject(hThread, INFINITE);
578 ok(ret == WAIT_OBJECT_0, "ret = %d\n", ret);
579 ret = CloseHandle(hThread);
580 ok(ret, "ret = %d\n", ret);
581
582 hThread = (HANDLE)_beginthread(test_thread_func, 0, (void*)3);
583 ok(hThread != INVALID_HANDLE_VALUE, "_beginthread failed (%d)\n", errno);
584 Sleep(150);
585 ret = WaitForSingleObject(hThread, INFINITE);
586 ok(ret == WAIT_OBJECT_0, "ret = %d\n", ret);
587 ret = CloseHandle(hThread);
588 ok(ret, "ret = %d\n", ret);
589
590 /* _beginthreadex: handle is not closed on _endthread */
591 hThread = (HANDLE)_beginthreadex(NULL,0, test_thread_func_ex, NULL, 0, NULL);
592 ok(hThread != NULL, "_beginthreadex failed (%d)\n", errno);
593 Sleep(150);
594 ret = WaitForSingleObject(hThread, INFINITE);
595 ok(ret == WAIT_OBJECT_0, "ret = %d\n", ret);
596 ret = CloseHandle(hThread);
597 ok(ret, "ret = %d\n", ret);
598 }
599
600 static int __cdecl _lfind_s_comp(void *ctx, const void *l, const void *r)
601 {
602 *(int *)ctx = 0xdeadc0de;
603 return *(int *)l - *(int *)r;
604 }
605
606 static void test__lfind_s(void)
607 {
608 static const int tests[] = {9000, 8001, 7002, 6003, 1003, 5004, 4005, 3006, 2007};
609 unsigned int num;
610 void *found;
611 int ctx;
612 int key;
613
614 if (!p_lfind_s)
615 {
616 win_skip("_lfind_s is not available\n");
617 return;
618 }
619
620 key = 1234;
621 num = sizeof(tests)/sizeof(tests[0]);
622
623 errno = 0xdeadbeef;
624 found = p_lfind_s(NULL, tests, &num, sizeof(int), _lfind_s_comp, NULL);
625 ok(errno == EINVAL, "errno = %d\n", errno);
626 ok(!found, "Expected NULL, got %p\n", found);
627
628 errno = 0xdeadbeef;
629 found = p_lfind_s(&key, NULL, &num, sizeof(int), _lfind_s_comp, NULL);
630 ok(errno == EINVAL, "errno = %d\n", errno);
631 ok(!found, "Expected NULL, got %p\n", found);
632
633 errno = 0xdeadbeef;
634 found = p_lfind_s(&key, tests, &num, 0, _lfind_s_comp, NULL);
635 ok(errno == EINVAL, "errno = %d\n", errno);
636 ok(!found, "Expected NULL, got %p\n", found);
637
638 errno = 0xdeadbeef;
639 found = p_lfind_s(&key, tests, &num, sizeof(int), NULL, NULL);
640 ok(errno == EINVAL, "errno = %d\n", errno);
641 ok(!found, "Expected NULL, got %p\n", found);
642
643 ctx = -1;
644 key = 9000;
645 errno = 0xdeadbeef;
646 found = p_lfind_s(&key, tests, &num, sizeof(int), _lfind_s_comp, &ctx);
647 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
648 ok(found == tests, "Expected %p, got %p\n", tests, found);
649 ok(ctx == 0xdeadc0de, "Expected 0xdeadc0de, got %x\n", ctx);
650
651 ctx = -1;
652 key = 2007;
653 errno = 0xdeadbeef;
654 found = p_lfind_s(&key, tests, &num, sizeof(int), _lfind_s_comp, &ctx);
655 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
656 ok(found == tests+8, "Expected %p, got %p\n", tests+8, found);
657 ok(ctx == 0xdeadc0de, "Expected 0xdeadc0de, got %x\n", ctx);
658
659 ctx = -1;
660 key = 1234;
661 errno = 0xdeadbeef;
662 found = p_lfind_s(&key, tests, &num, sizeof(int), _lfind_s_comp, &ctx);
663 ok(errno == 0xdeadbeef, "errno = %d\n", errno);
664 ok(!found, "Expected NULL, got %p\n", found);
665 ok(ctx == 0xdeadc0de, "Expected 0xdeadc0de, got %x\n", ctx);
666 }
667
668 START_TEST(misc)
669 {
670 int arg_c;
671 char** arg_v;
672
673 init();
674
675 arg_c = winetest_get_mainargs(&arg_v);
676 if(arg_c >= 3) {
677 if(!strcmp(arg_v[2], "popen"))
678 test__popen_child();
679 else
680 ok(0, "invalid argument '%s'\n", arg_v[2]);
681
682 return;
683 }
684
685 test_rand_s();
686 test_I10_OUTPUT();
687 test_strerror_s();
688 test__get_doserrno();
689 test__get_errno();
690 test__set_doserrno();
691 test__set_errno();
692 test__popen(arg_v[0]);
693 test__invalid_parameter();
694 test_qsort_s();
695 test_math_functions();
696 test_thread_handle_close();
697 test__lfind_s();
698 }