| /* |
| * Tests for WIDL and RPC server/clients. |
| * |
| * Copyright (C) Google 2007 (Dan Hipschman) |
| * |
| * This library is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Lesser General Public |
| * License as published by the Free Software Foundation; either |
| * version 2.1 of the License, or (at your option) any later version. |
| * |
| * This library is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Lesser General Public License for more details. |
| * |
| * You should have received a copy of the GNU Lesser General Public |
| * License along with this library; if not, write to the Free Software |
| * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA |
| */ |
| |
| #include <windows.h> |
| #include "wine/test.h" |
| #include "server.h" |
| #include "server_defines.h" |
| |
| #include <stddef.h> |
| #include <stdio.h> |
| #include <stdlib.h> |
| |
| #define PORT "4114" |
| #define PIPE "\\pipe\\wine_rpcrt4_test" |
| |
| #define INT_CODE 4198 |
| |
| static const char *progname; |
| |
| static HANDLE stop_event; |
| |
| void __RPC_FAR *__RPC_USER |
| midl_user_allocate(size_t n) |
| { |
| return malloc(n); |
| } |
| |
| void __RPC_USER |
| midl_user_free(void __RPC_FAR *p) |
| { |
| free(p); |
| } |
| |
| static char * |
| xstrdup(const char *s) |
| { |
| char *d = HeapAlloc(GetProcessHeap(), 0, strlen(s) + 1); |
| strcpy(d, s); |
| return d; |
| } |
| |
| int |
| s_int_return(void) |
| { |
| return INT_CODE; |
| } |
| |
| int |
| s_square(int x) |
| { |
| return x * x; |
| } |
| |
| int |
| s_sum(int x, int y) |
| { |
| return x + y; |
| } |
| |
| void |
| s_square_out(int x, int *y) |
| { |
| *y = s_square(x); |
| } |
| |
| void |
| s_square_ref(int *x) |
| { |
| *x = s_square(*x); |
| } |
| |
| int |
| s_str_length(const char *s) |
| { |
| return strlen(s); |
| } |
| |
| int |
| s_cstr_length(const char *s, int n) |
| { |
| int len = 0; |
| while (0 < n-- && *s++) |
| ++len; |
| return len; |
| } |
| |
| int |
| s_dot_self(vector_t *v) |
| { |
| return s_square(v->x) + s_square(v->y) + s_square(v->z); |
| } |
| |
| double |
| s_square_half(double x, double *y) |
| { |
| *y = x / 2.0; |
| return x * x; |
| } |
| |
| float |
| s_square_half_float(float x, float *y) |
| { |
| *y = x / 2.0f; |
| return x * x; |
| } |
| |
| long |
| s_square_half_long(long x, long *y) |
| { |
| *y = x / 2; |
| return x * x; |
| } |
| |
| int |
| s_sum_fixed_array(int a[5]) |
| { |
| return a[0] + a[1] + a[2] + a[3] + a[4]; |
| } |
| |
| int |
| s_pints_sum(pints_t *pints) |
| { |
| return *pints->pi + **pints->ppi + ***pints->pppi; |
| } |
| |
| double |
| s_ptypes_sum(ptypes_t *pt) |
| { |
| return *pt->pc + *pt->ps + *pt->pl + *pt->pf + *pt->pd; |
| } |
| |
| int |
| s_dot_pvectors(pvectors_t *p) |
| { |
| return p->pu->x * (*p->pv)->x + p->pu->y * (*p->pv)->y + p->pu->z * (*p->pv)->z; |
| } |
| |
| int |
| s_sum_sp(sp_t *sp) |
| { |
| return sp->x + sp->s->x; |
| } |
| |
| double |
| s_square_sun(sun_t *su) |
| { |
| switch (su->s) |
| { |
| case SUN_I: return su->u.i * su->u.i; |
| case SUN_F1: |
| case SUN_F2: return su->u.f * su->u.f; |
| case SUN_PI: return (*su->u.pi) * (*su->u.pi); |
| default: |
| return 0.0; |
| } |
| } |
| |
| int |
| s_test_list_length(test_list_t *list) |
| { |
| return (list->t == TL_LIST |
| ? 1 + s_test_list_length(list->u.tail) |
| : 0); |
| } |
| |
| int |
| s_sum_fixed_int_3d(int m[2][3][4]) |
| { |
| int i, j, k; |
| int sum = 0; |
| |
| for (i = 0; i < 2; ++i) |
| for (j = 0; j < 3; ++j) |
| for (k = 0; k < 4; ++k) |
| sum += m[i][j][k]; |
| |
| return sum; |
| } |
| |
| int |
| s_sum_conf_array(int x[], int n) |
| { |
| int *p = x, *end = p + n; |
| int sum = 0; |
| |
| while (p < end) |
| sum += *p++; |
| |
| return sum; |
| } |
| |
| int |
| s_sum_unique_conf_array(int x[], int n) |
| { |
| return s_sum_conf_array(x, n); |
| } |
| |
| int |
| s_sum_unique_conf_ptr(int *x, int n) |
| { |
| return x ? s_sum_conf_array(x, n) : 0; |
| } |
| |
| int |
| s_sum_var_array(int x[20], int n) |
| { |
| ok(0 <= n, "RPC sum_var_array\n"); |
| ok(n <= 20, "RPC sum_var_array\n"); |
| |
| return s_sum_conf_array(x, n); |
| } |
| |
| int |
| s_dot_two_vectors(vector_t vs[2]) |
| { |
| return vs[0].x * vs[1].x + vs[0].y * vs[1].y + vs[0].z * vs[1].z; |
| } |
| |
| int |
| s_sum_cs(cs_t *cs) |
| { |
| return s_sum_conf_array(cs->ca, cs->n); |
| } |
| |
| int |
| s_sum_cps(cps_t *cps) |
| { |
| int sum = 0; |
| int i; |
| |
| for (i = 0; i < *cps->pn; ++i) |
| sum += cps->ca1[i]; |
| |
| for (i = 0; i < 2 * cps->n; ++i) |
| sum += cps->ca2[i]; |
| |
| return sum; |
| } |
| |
| int |
| s_sum_cpsc(cpsc_t *cpsc) |
| { |
| int sum = 0; |
| int i; |
| for (i = 0; i < (cpsc->c ? cpsc->a : cpsc->b); ++i) |
| sum += cpsc->ca[i]; |
| return sum; |
| } |
| |
| int |
| s_square_puint(puint_t p) |
| { |
| int n = atoi(p); |
| return n * n; |
| } |
| |
| int |
| s_sum_puints(puints_t *p) |
| { |
| int sum = 0; |
| int i; |
| for (i = 0; i < p->n; ++i) |
| sum += atoi(p->ps[i]); |
| return sum; |
| } |
| |
| int |
| s_sum_cpuints(cpuints_t *p) |
| { |
| int sum = 0; |
| int i; |
| for (i = 0; i < p->n; ++i) |
| sum += atoi(p->ps[i]); |
| return sum; |
| } |
| |
| int |
| s_dot_copy_vectors(vector_t u, vector_t v) |
| { |
| return u.x * v.x + u.y * v.y + u.z * v.z; |
| } |
| |
| int |
| s_square_test_us(test_us_t *tus) |
| { |
| int n = atoi(tus->us.x); |
| return n * n; |
| } |
| |
| double |
| s_square_encu(encu_t *eu) |
| { |
| switch (eu->t) |
| { |
| case ENCU_I: return eu->tagged_union.i * eu->tagged_union.i; |
| case ENCU_F: return eu->tagged_union.f * eu->tagged_union.f; |
| default: |
| return 0.0; |
| } |
| } |
| |
| int |
| s_sum_parr(int *a[3]) |
| { |
| return s_sum_pcarr(a, 3); |
| } |
| |
| int |
| s_sum_pcarr(int *a[], int n) |
| { |
| int i, s = 0; |
| for (i = 0; i < n; ++i) |
| s += *a[i]; |
| return s; |
| } |
| |
| int |
| s_enum_ord(e_t e) |
| { |
| switch (e) |
| { |
| case E1: return 1; |
| case E2: return 2; |
| case E3: return 3; |
| case E4: return 4; |
| default: |
| return 0; |
| } |
| } |
| |
| double |
| s_square_encue(encue_t *eue) |
| { |
| switch (eue->t) |
| { |
| case E1: return eue->tagged_union.i1 * eue->tagged_union.i1; |
| case E2: return eue->tagged_union.f2 * eue->tagged_union.f2; |
| default: |
| return 0.0; |
| } |
| } |
| |
| int |
| s_sum_toplev_conf_2n(int *x, int n) |
| { |
| int sum = 0; |
| int i; |
| for (i = 0; i < 2 * n; ++i) |
| sum += x[i]; |
| return sum; |
| } |
| |
| int |
| s_sum_toplev_conf_cond(int *x, int a, int b, int c) |
| { |
| int sum = 0; |
| int n = c ? a : b; |
| int i; |
| for (i = 0; i < n; ++i) |
| sum += x[i]; |
| return sum; |
| } |
| |
| double |
| s_sum_aligns(aligns_t *a) |
| { |
| return a->c + a->i + a->s + a->d; |
| } |
| |
| int |
| s_sum_padded(padded_t *p) |
| { |
| return p->i + p->c; |
| } |
| |
| int |
| s_sum_padded2(padded_t ps[2]) |
| { |
| return s_sum_padded(&ps[0]) + s_sum_padded(&ps[1]); |
| } |
| |
| int |
| s_sum_padded_conf(padded_t *ps, int n) |
| { |
| int sum = 0; |
| int i; |
| for (i = 0; i < n; ++i) |
| sum += s_sum_padded(&ps[i]); |
| return sum; |
| } |
| |
| int |
| s_sum_bogus(bogus_t *b) |
| { |
| return *b->h.p1 + *b->p2 + *b->p3 + b->c; |
| } |
| |
| void |
| s_check_null(int *null) |
| { |
| ok(!null, "RPC check_null\n"); |
| } |
| |
| int |
| s_str_struct_len(str_struct_t *s) |
| { |
| return lstrlenA(s->s); |
| } |
| |
| int |
| s_wstr_struct_len(wstr_struct_t *s) |
| { |
| return lstrlenW(s->s); |
| } |
| |
| int |
| s_sum_doub_carr(doub_carr_t *dc) |
| { |
| int i, j; |
| int sum = 0; |
| for (i = 0; i < dc->n; ++i) |
| for (j = 0; j < dc->a[i]->n; ++j) |
| sum += dc->a[i]->a[j]; |
| return sum; |
| } |
| |
| void |
| s_make_pyramid_doub_carr(unsigned char n, doub_carr_t **dc) |
| { |
| doub_carr_t *t; |
| int i, j; |
| t = MIDL_user_allocate(FIELD_OFFSET(doub_carr_t, a[n])); |
| t->n = n; |
| for (i = 0; i < n; ++i) |
| { |
| int v = i + 1; |
| t->a[i] = MIDL_user_allocate(FIELD_OFFSET(doub_carr_1_t, a[v])); |
| t->a[i]->n = v; |
| for (j = 0; j < v; ++j) |
| t->a[i]->a[j] = j + 1; |
| } |
| *dc = t; |
| } |
| |
| unsigned |
| s_hash_bstr(bstr_t b) |
| { |
| short n = b[-1]; |
| short *s = b; |
| unsigned hash = 0; |
| short i; |
| for (i = 0; i < n; ++i) |
| hash = 5 * hash + (unsigned) s[i]; |
| return hash; |
| } |
| |
| void |
| s_get_name(name_t *name) |
| { |
| const char bossman[] = "Jeremy White"; |
| memcpy(name->name, bossman, min(name->size, sizeof(bossman))); |
| /* ensure nul-termination */ |
| if (name->size < sizeof(bossman)) |
| name->name[name->size - 1] = 0; |
| } |
| |
| int |
| s_sum_pcarr2(int n, int **pa) |
| { |
| return s_sum_conf_array(*pa, n); |
| } |
| |
| int |
| s_sum_L1_norms(int n, vector_t *vs) |
| { |
| int i; |
| int sum = 0; |
| for (i = 0; i < n; ++i) |
| sum += abs(vs[i].x) + abs(vs[i].y) + abs(vs[i].z); |
| return sum; |
| } |
| |
| str_t |
| s_get_filename(void) |
| { |
| return (char *)__FILE__; |
| } |
| |
| void |
| s_stop(void) |
| { |
| ok(RPC_S_OK == RpcMgmtStopServerListening(NULL), "RpcMgmtStopServerListening\n"); |
| ok(RPC_S_OK == RpcServerUnregisterIf(NULL, NULL, FALSE), "RpcServerUnregisterIf\n"); |
| ok(SetEvent(stop_event), "SetEvent\n"); |
| } |
| |
| static void |
| make_cmdline(char buffer[MAX_PATH], const char *test) |
| { |
| sprintf(buffer, "%s server %s", progname, test); |
| } |
| |
| static int |
| run_client(const char *test) |
| { |
| char cmdline[MAX_PATH]; |
| PROCESS_INFORMATION info; |
| STARTUPINFOA startup; |
| DWORD exitcode; |
| |
| memset(&startup, 0, sizeof startup); |
| startup.cb = sizeof startup; |
| |
| make_cmdline(cmdline, test); |
| ok(CreateProcessA(NULL, cmdline, NULL, NULL, FALSE, 0L, NULL, NULL, &startup, &info), "CreateProcess\n"); |
| ok(WaitForSingleObject(info.hProcess, 30000) == WAIT_OBJECT_0, "Child process termination\n"); |
| ok(GetExitCodeProcess(info.hProcess, &exitcode), "GetExitCodeProcess\n"); |
| ok(CloseHandle(info.hProcess), "CloseHandle\n"); |
| ok(CloseHandle(info.hThread), "CloseHandle\n"); |
| |
| return exitcode == 0; |
| } |
| |
| static void |
| basic_tests(void) |
| { |
| char string[] = "I am a string"; |
| WCHAR wstring[] = {'I',' ','a','m',' ','a',' ','w','s','t','r','i','n','g', 0}; |
| int f[5] = {1, 3, 0, -2, -4}; |
| vector_t a = {1, 3, 7}; |
| vector_t vec1 = {4, -2, 1}, vec2 = {-5, 2, 3}, *pvec2 = &vec2; |
| pvectors_t pvecs = {&vec1, &pvec2}; |
| sp_inner_t spi = {42}; |
| sp_t sp = {-13, &spi}; |
| aligns_t aligns = {3, 4, 5, 6.0}; |
| pints_t pints; |
| ptypes_t ptypes; |
| padded_t padded; |
| padded_t padded2[2]; |
| bogus_t bogus; |
| int i1, i2, i3, *pi2, *pi3, **ppi3; |
| double u, v; |
| float s, t; |
| long q, r; |
| short h; |
| char c; |
| int x; |
| str_struct_t ss = {string}; |
| wstr_struct_t ws = {wstring}; |
| str_t str; |
| |
| ok(int_return() == INT_CODE, "RPC int_return\n"); |
| |
| ok(square(7) == 49, "RPC square\n"); |
| ok(sum(23, -4) == 19, "RPC sum\n"); |
| |
| x = 0; |
| square_out(11, &x); |
| ok(x == 121, "RPC square_out\n"); |
| |
| x = 5; |
| square_ref(&x); |
| ok(x == 25, "RPC square_ref\n"); |
| |
| ok(str_length(string) == strlen(string), "RPC str_length\n"); |
| ok(dot_self(&a) == 59, "RPC dot_self\n"); |
| |
| ok(str_struct_len(&ss) == lstrlenA(string), "RPC str_struct_len\n"); |
| ok(wstr_struct_len(&ws) == lstrlenW(wstring), "RPC str_struct_len\n"); |
| |
| v = 0.0; |
| u = square_half(3.0, &v); |
| ok(u == 9.0, "RPC square_half\n"); |
| ok(v == 1.5, "RPC square_half\n"); |
| |
| t = 0.0f; |
| s = square_half_float(3.0f, &t); |
| ok(s == 9.0f, "RPC square_half_float\n"); |
| ok(t == 1.5f, "RPC square_half_float\n"); |
| |
| r = 0; |
| q = square_half_long(3, &r); |
| ok(q == 9, "RPC square_half_long\n"); |
| ok(r == 1, "RPC square_half_long\n"); |
| |
| i1 = 19; |
| i2 = -3; |
| i3 = -29; |
| pi2 = &i2; |
| pi3 = &i3; |
| ppi3 = &pi3; |
| pints.pi = &i1; |
| pints.ppi = &pi2; |
| pints.pppi = &ppi3; |
| ok(pints_sum(&pints) == -13, "RPC pints_sum\n"); |
| |
| c = 10; |
| h = 3; |
| q = 14; |
| s = -5.0f; |
| u = 11.0; |
| ptypes.pc = &c; |
| ptypes.ps = &h; |
| ptypes.pl = &q; |
| ptypes.pf = &s; |
| ptypes.pd = &u; |
| ok(ptypes_sum(&ptypes) == 33.0, "RPC ptypes_sum\n"); |
| |
| ok(dot_pvectors(&pvecs) == -21, "RPC dot_pvectors\n"); |
| ok(dot_copy_vectors(vec1, vec2) == -21, "RPC dot_copy_vectors\n"); |
| ok(sum_fixed_array(f) == -2, "RPC sum_fixed_array\n"); |
| ok(sum_sp(&sp) == 29, "RPC sum_sp\n"); |
| |
| ok(enum_ord(E1) == 1, "RPC enum_ord\n"); |
| ok(enum_ord(E2) == 2, "RPC enum_ord\n"); |
| ok(enum_ord(E3) == 3, "RPC enum_ord\n"); |
| ok(enum_ord(E4) == 4, "RPC enum_ord\n"); |
| |
| ok(sum_aligns(&aligns) == 18.0, "RPC sum_aligns\n"); |
| |
| padded.i = -3; |
| padded.c = 8; |
| ok(sum_padded(&padded) == 5, "RPC sum_padded\n"); |
| padded2[0].i = -5; |
| padded2[0].c = 1; |
| padded2[1].i = 3; |
| padded2[1].c = 7; |
| ok(sum_padded2(padded2) == 6, "RPC sum_padded2\n"); |
| padded2[0].i = -5; |
| padded2[0].c = 1; |
| padded2[1].i = 3; |
| padded2[1].c = 7; |
| ok(sum_padded_conf(padded2, 2) == 6, "RPC sum_padded_conf\n"); |
| |
| i1 = 14; |
| i2 = -7; |
| i3 = -4; |
| bogus.h.p1 = &i1; |
| bogus.p2 = &i2; |
| bogus.p3 = &i3; |
| bogus.c = 9; |
| ok(sum_bogus(&bogus) == 12, "RPC sum_bogus\n"); |
| |
| check_null(NULL); |
| |
| str = get_filename(); |
| ok(!strcmp(str, __FILE__), "get_filename() returned %s instead of %s\n", str, __FILE__); |
| } |
| |
| static void |
| union_tests(void) |
| { |
| encue_t eue; |
| encu_t eu; |
| sun_t su; |
| int i; |
| |
| su.s = SUN_I; |
| su.u.i = 9; |
| ok(square_sun(&su) == 81.0, "RPC square_sun\n"); |
| |
| su.s = SUN_F1; |
| su.u.f = 5.0; |
| ok(square_sun(&su) == 25.0, "RPC square_sun\n"); |
| |
| su.s = SUN_F2; |
| su.u.f = -2.0; |
| ok(square_sun(&su) == 4.0, "RPC square_sun\n"); |
| |
| su.s = SUN_PI; |
| su.u.pi = &i; |
| i = 11; |
| ok(square_sun(&su) == 121.0, "RPC square_sun\n"); |
| |
| eu.t = ENCU_I; |
| eu.tagged_union.i = 7; |
| ok(square_encu(&eu) == 49.0, "RPC square_encu\n"); |
| |
| eu.t = ENCU_F; |
| eu.tagged_union.f = 3.0; |
| ok(square_encu(&eu) == 9.0, "RPC square_encu\n"); |
| |
| eue.t = E1; |
| eue.tagged_union.i1 = 8; |
| ok(square_encue(&eue) == 64.0, "RPC square_encue\n"); |
| |
| eue.t = E2; |
| eue.tagged_union.f2 = 10.0; |
| ok(square_encue(&eue) == 100.0, "RPC square_encue\n"); |
| } |
| |
| static test_list_t * |
| null_list(void) |
| { |
| test_list_t *n = HeapAlloc(GetProcessHeap(), 0, sizeof *n); |
| n->t = TL_NULL; |
| return n; |
| } |
| |
| static test_list_t * |
| make_list(test_list_t *tail) |
| { |
| test_list_t *n = HeapAlloc(GetProcessHeap(), 0, sizeof *n); |
| n->t = TL_LIST; |
| n->u.tail = tail; |
| return n; |
| } |
| |
| static void |
| free_list(test_list_t *list) |
| { |
| if (list->t == TL_LIST) |
| free_list(list->u.tail); |
| HeapFree(GetProcessHeap(), 0, list); |
| } |
| |
| ULONG __RPC_USER |
| puint_t_UserSize(ULONG *flags, ULONG start, puint_t *p) |
| { |
| return start + sizeof(int); |
| } |
| |
| unsigned char * __RPC_USER |
| puint_t_UserMarshal(ULONG *flags, unsigned char *buffer, puint_t *p) |
| { |
| int n = atoi(*p); |
| memcpy(buffer, &n, sizeof n); |
| return buffer + sizeof n; |
| } |
| |
| unsigned char * __RPC_USER |
| puint_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, puint_t *p) |
| { |
| int n; |
| memcpy(&n, buffer, sizeof n); |
| *p = HeapAlloc(GetProcessHeap(), 0, 10); |
| sprintf(*p, "%d", n); |
| return buffer + sizeof n; |
| } |
| |
| void __RPC_USER |
| puint_t_UserFree(ULONG *flags, puint_t *p) |
| { |
| HeapFree(GetProcessHeap(), 0, *p); |
| } |
| |
| ULONG __RPC_USER |
| us_t_UserSize(ULONG *flags, ULONG start, us_t *pus) |
| { |
| return start + sizeof(struct wire_us); |
| } |
| |
| unsigned char * __RPC_USER |
| us_t_UserMarshal(ULONG *flags, unsigned char *buffer, us_t *pus) |
| { |
| struct wire_us wus; |
| wus.x = atoi(pus->x); |
| memcpy(buffer, &wus, sizeof wus); |
| return buffer + sizeof wus; |
| } |
| |
| unsigned char * __RPC_USER |
| us_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, us_t *pus) |
| { |
| struct wire_us wus; |
| memcpy(&wus, buffer, sizeof wus); |
| pus->x = HeapAlloc(GetProcessHeap(), 0, 10); |
| sprintf(pus->x, "%d", wus.x); |
| return buffer + sizeof wus; |
| } |
| |
| void __RPC_USER |
| us_t_UserFree(ULONG *flags, us_t *pus) |
| { |
| HeapFree(GetProcessHeap(), 0, pus->x); |
| } |
| |
| ULONG __RPC_USER |
| bstr_t_UserSize(ULONG *flags, ULONG start, bstr_t *b) |
| { |
| return start + FIELD_OFFSET(wire_bstr_t, data[(*b)[-1]]); |
| } |
| |
| unsigned char * __RPC_USER |
| bstr_t_UserMarshal(ULONG *flags, unsigned char *buffer, bstr_t *b) |
| { |
| wire_bstr_t *wb = (wire_bstr_t *) buffer; |
| wb->n = (*b)[-1]; |
| memcpy(&wb->data, *b, wb->n * sizeof wb->data[0]); |
| return buffer + FIELD_OFFSET(wire_bstr_t, data[wb->n]); |
| } |
| |
| unsigned char * __RPC_USER |
| bstr_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, bstr_t *b) |
| { |
| wire_bstr_t *wb = (wire_bstr_t *) buffer; |
| short *data = HeapAlloc(GetProcessHeap(), 0, (wb->n + 1) * sizeof *data); |
| data[0] = wb->n; |
| memcpy(&data[1], wb->data, wb->n * sizeof data[1]); |
| *b = &data[1]; |
| return buffer + FIELD_OFFSET(wire_bstr_t, data[wb->n]); |
| } |
| |
| void __RPC_USER |
| bstr_t_UserFree(ULONG *flags, bstr_t *b) |
| { |
| HeapFree(GetProcessHeap(), 0, &((*b)[-1])); |
| } |
| |
| static void |
| pointer_tests(void) |
| { |
| int a[] = {1, 2, 3, 4}; |
| char p1[] = "11"; |
| test_list_t *list = make_list(make_list(make_list(null_list()))); |
| test_us_t tus = {{p1}}; |
| int *pa[4]; |
| puints_t pus; |
| cpuints_t cpus; |
| short bstr_data[] = { 5, 'H', 'e', 'l', 'l', 'o' }; |
| bstr_t bstr = &bstr_data[1]; |
| name_t name; |
| void *buffer; |
| int *pa2; |
| |
| ok(test_list_length(list) == 3, "RPC test_list_length\n"); |
| ok(square_puint(p1) == 121, "RPC square_puint\n"); |
| pus.n = 4; |
| pus.ps = HeapAlloc(GetProcessHeap(), 0, pus.n * sizeof pus.ps[0]); |
| pus.ps[0] = xstrdup("5"); |
| pus.ps[1] = xstrdup("6"); |
| pus.ps[2] = xstrdup("7"); |
| pus.ps[3] = xstrdup("8"); |
| ok(sum_puints(&pus) == 26, "RPC sum_puints\n"); |
| HeapFree(GetProcessHeap(), 0, pus.ps[0]); |
| HeapFree(GetProcessHeap(), 0, pus.ps[1]); |
| HeapFree(GetProcessHeap(), 0, pus.ps[2]); |
| HeapFree(GetProcessHeap(), 0, pus.ps[3]); |
| HeapFree(GetProcessHeap(), 0, pus.ps); |
| cpus.n = 4; |
| cpus.ps = HeapAlloc(GetProcessHeap(), 0, cpus.n * sizeof cpus.ps[0]); |
| cpus.ps[0] = xstrdup("5"); |
| cpus.ps[1] = xstrdup("6"); |
| cpus.ps[2] = xstrdup("7"); |
| cpus.ps[3] = xstrdup("8"); |
| ok(sum_cpuints(&cpus) == 26, "RPC sum_puints\n"); |
| HeapFree(GetProcessHeap(), 0, cpus.ps[0]); |
| HeapFree(GetProcessHeap(), 0, cpus.ps[1]); |
| HeapFree(GetProcessHeap(), 0, cpus.ps[2]); |
| HeapFree(GetProcessHeap(), 0, cpus.ps[3]); |
| HeapFree(GetProcessHeap(), 0, cpus.ps); |
| ok(square_test_us(&tus) == 121, "RPC square_test_us\n"); |
| |
| pa[0] = &a[0]; |
| pa[1] = &a[1]; |
| pa[2] = &a[2]; |
| ok(sum_parr(pa) == 6, "RPC sum_parr\n"); |
| |
| pa[0] = &a[0]; |
| pa[1] = &a[1]; |
| pa[2] = &a[2]; |
| pa[3] = &a[3]; |
| ok(sum_pcarr(pa, 4) == 10, "RPC sum_pcarr\n"); |
| |
| ok(hash_bstr(bstr) == s_hash_bstr(bstr), "RPC hash_bstr_data\n"); |
| |
| free_list(list); |
| |
| name.size = 10; |
| name.name = buffer = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, name.size); |
| get_name(&name); |
| ok(name.name == buffer, "[in,out] pointer should have stayed as %p but instead changed to %p\n", name.name, buffer); |
| ok(!strcmp(name.name, "Jeremy Wh"), "name didn't unmarshall properly, expected \"Jeremy Wh\", but got \"%s\"\n", name.name); |
| HeapFree(GetProcessHeap(), 0, name.name); |
| |
| pa2 = a; |
| ok(sum_pcarr2(4, &pa2) == 10, "RPC sum_pcarr2\n"); |
| } |
| |
| static int |
| check_pyramid_doub_carr(doub_carr_t *dc) |
| { |
| int i, j; |
| for (i = 0; i < dc->n; ++i) |
| for (j = 0; j < dc->a[i]->n; ++j) |
| if (dc->a[i]->a[j] != j + 1) |
| return FALSE; |
| return TRUE; |
| } |
| |
| static void |
| free_pyramid_doub_carr(doub_carr_t *dc) |
| { |
| int i; |
| for (i = 0; i < dc->n; ++i) |
| MIDL_user_free(dc->a[i]); |
| MIDL_user_free(dc); |
| } |
| |
| static void |
| array_tests(void) |
| { |
| const char str1[25] = "Hello"; |
| int m[2][3][4] = |
| { |
| {{1, 2, 3, 4}, {-1, -3, -5, -7}, {0, 2, 4, 6}}, |
| {{1, -2, 3, -4}, {2, 3, 5, 7}, {-4, -1, -14, 4114}} |
| }; |
| int c[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; |
| vector_t vs[2] = {{1, -2, 3}, {4, -5, -6}}; |
| cps_t cps; |
| cpsc_t cpsc; |
| cs_t *cs; |
| int n; |
| int ca[5] = {1, -2, 3, -4, 5}; |
| doub_carr_t *dc; |
| |
| ok(cstr_length(str1, sizeof str1) == strlen(str1), "RPC cstr_length\n"); |
| |
| ok(sum_fixed_int_3d(m) == 4116, "RPC sum_fixed_int_3d\n"); |
| |
| ok(sum_conf_array(c, 10) == 45, "RPC sum_conf_array\n"); |
| ok(sum_conf_array(&c[5], 2) == 11, "RPC sum_conf_array\n"); |
| ok(sum_conf_array(&c[7], 1) == 7, "RPC sum_conf_array\n"); |
| ok(sum_conf_array(&c[2], 0) == 0, "RPC sum_conf_array\n"); |
| |
| ok(sum_unique_conf_array(ca, 4) == -2, "RPC sum_unique_conf_array\n"); |
| ok(sum_unique_conf_ptr(ca, 5) == 3, "RPC sum_unique_conf_array\n"); |
| ok(sum_unique_conf_ptr(NULL, 10) == 0, "RPC sum_unique_conf_array\n"); |
| |
| ok(sum_var_array(c, 10) == 45, "RPC sum_conf_array\n"); |
| ok(sum_var_array(&c[5], 2) == 11, "RPC sum_conf_array\n"); |
| ok(sum_var_array(&c[7], 1) == 7, "RPC sum_conf_array\n"); |
| ok(sum_var_array(&c[2], 0) == 0, "RPC sum_conf_array\n"); |
| |
| ok(dot_two_vectors(vs) == -4, "RPC dot_two_vectors\n"); |
| cs = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(cs_t, ca[5])); |
| cs->n = 5; |
| cs->ca[0] = 3; |
| cs->ca[1] = 5; |
| cs->ca[2] = -2; |
| cs->ca[3] = -1; |
| cs->ca[4] = -4; |
| ok(sum_cs(cs) == 1, "RPC sum_cs\n"); |
| HeapFree(GetProcessHeap(), 0, cs); |
| |
| n = 5; |
| cps.pn = &n; |
| cps.ca1 = &c[2]; |
| cps.n = 3; |
| cps.ca2 = &c[3]; |
| ok(sum_cps(&cps) == 53, "RPC sum_cps\n"); |
| |
| cpsc.a = 4; |
| cpsc.b = 5; |
| cpsc.c = 1; |
| cpsc.ca = c; |
| ok(sum_cpsc(&cpsc) == 6, "RPC sum_cpsc\n"); |
| cpsc.a = 4; |
| cpsc.b = 5; |
| cpsc.c = 0; |
| cpsc.ca = c; |
| ok(sum_cpsc(&cpsc) == 10, "RPC sum_cpsc\n"); |
| |
| ok(sum_toplev_conf_2n(c, 3) == 15, "RPC sum_toplev_conf_2n\n"); |
| ok(sum_toplev_conf_cond(c, 5, 6, 1) == 10, "RPC sum_toplev_conf_cond\n"); |
| ok(sum_toplev_conf_cond(c, 5, 6, 0) == 15, "RPC sum_toplev_conf_cond\n"); |
| |
| dc = malloc(FIELD_OFFSET(doub_carr_t, a[2])); |
| dc->n = 2; |
| dc->a[0] = malloc(FIELD_OFFSET(doub_carr_1_t, a[3])); |
| dc->a[0]->n = 3; |
| dc->a[0]->a[0] = 5; |
| dc->a[0]->a[1] = 1; |
| dc->a[0]->a[2] = 8; |
| dc->a[1] = malloc(FIELD_OFFSET(doub_carr_1_t, a[2])); |
| dc->a[1]->n = 2; |
| dc->a[1]->a[0] = 2; |
| dc->a[1]->a[1] = 3; |
| ok(sum_doub_carr(dc) == 19, "RPC sum_doub_carr\n"); |
| free(dc->a[0]); |
| free(dc->a[1]); |
| free(dc); |
| |
| dc = NULL; |
| make_pyramid_doub_carr(4, &dc); |
| ok(check_pyramid_doub_carr(dc), "RPC make_pyramid_doub_carr\n"); |
| free_pyramid_doub_carr(dc); |
| |
| ok(sum_L1_norms(2, vs) == 21, "RPC sum_L1_norms\n"); |
| } |
| |
| static void |
| run_tests(void) |
| { |
| basic_tests(); |
| union_tests(); |
| pointer_tests(); |
| array_tests(); |
| } |
| |
| static void |
| client(const char *test) |
| { |
| if (strcmp(test, "tcp_basic") == 0) |
| { |
| static unsigned char iptcp[] = "ncacn_ip_tcp"; |
| static unsigned char address[] = "127.0.0.1"; |
| static unsigned char port[] = PORT; |
| unsigned char *binding; |
| |
| ok(RPC_S_OK == RpcStringBindingCompose(NULL, iptcp, address, port, NULL, &binding), "RpcStringBindingCompose\n"); |
| ok(RPC_S_OK == RpcBindingFromStringBinding(binding, &IServer_IfHandle), "RpcBindingFromStringBinding\n"); |
| |
| run_tests(); |
| |
| ok(RPC_S_OK == RpcStringFree(&binding), "RpcStringFree\n"); |
| ok(RPC_S_OK == RpcBindingFree(&IServer_IfHandle), "RpcBindingFree\n"); |
| } |
| else if (strcmp(test, "np_basic") == 0) |
| { |
| static unsigned char np[] = "ncacn_np"; |
| static unsigned char address[] = "\\\\."; |
| static unsigned char pipe[] = PIPE; |
| unsigned char *binding; |
| |
| ok(RPC_S_OK == RpcStringBindingCompose(NULL, np, address, pipe, NULL, &binding), "RpcStringBindingCompose\n"); |
| ok(RPC_S_OK == RpcBindingFromStringBinding(binding, &IServer_IfHandle), "RpcBindingFromStringBinding\n"); |
| |
| run_tests(); |
| stop(); |
| |
| ok(RPC_S_OK == RpcStringFree(&binding), "RpcStringFree\n"); |
| ok(RPC_S_OK == RpcBindingFree(&IServer_IfHandle), "RpcBindingFree\n"); |
| } |
| } |
| |
| static void |
| server(void) |
| { |
| static unsigned char iptcp[] = "ncacn_ip_tcp"; |
| static unsigned char port[] = PORT; |
| static unsigned char np[] = "ncacn_np"; |
| static unsigned char pipe[] = PIPE; |
| |
| ok(RPC_S_OK == RpcServerUseProtseqEp(iptcp, 20, port, NULL), "RpcServerUseProtseqEp\n"); |
| ok(RPC_S_OK == RpcServerRegisterIf(s_IServer_v0_0_s_ifspec, NULL, NULL), "RpcServerRegisterIf\n"); |
| ok(RPC_S_OK == RpcServerListen(1, 20, TRUE), "RpcServerListen\n"); |
| |
| stop_event = CreateEvent(NULL, FALSE, FALSE, NULL); |
| ok(stop_event != NULL, "CreateEvent failed\n"); |
| |
| ok(run_client("tcp_basic"), "tcp_basic client test failed\n"); |
| |
| ok(RPC_S_OK == RpcServerUseProtseqEp(np, 0, pipe, NULL), "RpcServerUseProtseqEp\n"); |
| ok(run_client("np_basic"), "np_basic client test failed\n"); |
| |
| ok(WAIT_OBJECT_0 == WaitForSingleObject(stop_event, 60000), "WaitForSingleObject\n"); |
| todo_wine { |
| ok(RPC_S_OK == RpcMgmtWaitServerListen(), "RpcMgmtWaitServerListening\n"); |
| } |
| } |
| |
| START_TEST(server) |
| { |
| int argc; |
| char **argv; |
| |
| argc = winetest_get_mainargs(&argv); |
| progname = argv[0]; |
| |
| if (argc == 3) |
| { |
| RpcTryExcept |
| { |
| client(argv[2]); |
| } |
| RpcExcept(TRUE) |
| { |
| trace("Exception %d\n", RpcExceptionCode()); |
| } |
| RpcEndExcept |
| } |
| else |
| server(); |
| } |