dlls/rpcrt4/tests/server.c

   1 /*
   2  * Tests for WIDL and RPC server/clients.
   3  *
   4  * Copyright (C) Google 2007 (Dan Hipschman)
   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 <windows.h>
  22 #include "wine/test.h"
  23 #include "server.h"
  24 #include "server_defines.h"
  25
  26 #include <stddef.h>
  27 #include <stdio.h>
  28 #include <stdlib.h>
  29
  30 #define PORT "4114"
  31 #define PIPE "\\pipe\\wine_rpcrt4_test"
  32
  33 #define INT_CODE 4198
  34
  35 static const char *progname;
  36
  37 static HANDLE stop_event;
  38
  39 void __RPC_FAR *__RPC_USER
  40 midl_user_allocate(size_t n)
  41 {
  42   return malloc(n);
  43 }
  44
  45 void __RPC_USER
  46 midl_user_free(void __RPC_FAR *p)
  47 {
  48   free(p);
  49 }
  50
  51 static char *
  52 xstrdup(const char *s)
  53 {
  54   char *d = HeapAlloc(GetProcessHeap(), 0, strlen(s) + 1);
  55   strcpy(d, s);
  56   return d;
  57 }
  58
  59 int
  60 s_int_return(void)
  61 {
  62   return INT_CODE;
  63 }
  64
  65 int
  66 s_square(int x)
  67 {
  68   return x * x;
  69 }
  70
  71 int
  72 s_sum(int x, int y)
  73 {
  74   return x + y;
  75 }
  76
  77 void
  78 s_square_out(int x, int *y)
  79 {
  80   *y = s_square(x);
  81 }
  82
  83 void
  84 s_square_ref(int *x)
  85 {
  86   *x = s_square(*x);
  87 }
  88
  89 int
  90 s_str_length(const char *s)
  91 {
  92   return strlen(s);
  93 }
  94
  95 int
  96 s_cstr_length(const char *s, int n)
  97 {
  98   int len = 0;
  99   while (0 < n-- && *s++)
 100     ++len;
 101   return len;
 102 }
 103
 104 int
 105 s_dot_self(vector_t *v)
 106 {
 107   return s_square(v->x) + s_square(v->y) + s_square(v->z);
 108 }
 109
 110 double
 111 s_square_half(double x, double *y)
 112 {
 113   *y = x / 2.0;
 114   return x * x;
 115 }
 116
 117 float
 118 s_square_half_float(float x, float *y)
 119 {
 120   *y = x / 2.0f;
 121   return x * x;
 122 }
 123
 124 long
 125 s_square_half_long(long x, long *y)
 126 {
 127   *y = x / 2;
 128   return x * x;
 129 }
 130
 131 int
 132 s_sum_fixed_array(int a[5])
 133 {
 134   return a[0] + a[1] + a[2] + a[3] + a[4];
 135 }
 136
 137 int
 138 s_pints_sum(pints_t *pints)
 139 {
 140   return *pints->pi + **pints->ppi + ***pints->pppi;
 141 }
 142
 143 double
 144 s_ptypes_sum(ptypes_t *pt)
 145 {
 146   return *pt->pc + *pt->ps + *pt->pl + *pt->pf + *pt->pd;
 147 }
 148
 149 int
 150 s_dot_pvectors(pvectors_t *p)
 151 {
 152   return p->pu->x * (*p->pv)->x + p->pu->y * (*p->pv)->y + p->pu->z * (*p->pv)->z;
 153 }
 154
 155 int
 156 s_sum_sp(sp_t *sp)
 157 {
 158   return sp->x + sp->s->x;
 159 }
 160
 161 double
 162 s_square_sun(sun_t *su)
 163 {
 164   switch (su->s)
 165   {
 166   case SUN_I: return su->u.i * su->u.i;
 167   case SUN_F1:
 168   case SUN_F2: return su->u.f * su->u.f;
 169   case SUN_PI: return (*su->u.pi) * (*su->u.pi);
 170   default:
 171     return 0.0;
 172   }
 173 }
 174
 175 int
 176 s_test_list_length(test_list_t *list)
 177 {
 178   return (list->t == TL_LIST
 179           ? 1 + s_test_list_length(list->u.tail)
 180           : 0);
 181 }
 182
 183 int
 184 s_sum_fixed_int_3d(int m[2][3][4])
 185 {
 186   int i, j, k;
 187   int sum = 0;
 188
 189   for (i = 0; i < 2; ++i)
 190     for (j = 0; j < 3; ++j)
 191       for (k = 0; k < 4; ++k)
 192         sum += m[i][j][k];
 193
 194   return sum;
 195 }
 196
 197 int
 198 s_sum_conf_array(int x[], int n)
 199 {
 200   int *p = x, *end = p + n;
 201   int sum = 0;
 202
 203   while (p < end)
 204     sum += *p++;
 205
 206   return sum;
 207 }
 208
 209 int
 210 s_sum_unique_conf_array(int x[], int n)
 211 {
 212   return s_sum_conf_array(x, n);
 213 }
 214
 215 int
 216 s_sum_unique_conf_ptr(int *x, int n)
 217 {
 218   return x ? s_sum_conf_array(x, n) : 0;
 219 }
 220
 221 int
 222 s_sum_var_array(int x[20], int n)
 223 {
 224   ok(0 <= n, "RPC sum_var_array\n");
 225   ok(n <= 20, "RPC sum_var_array\n");
 226
 227   return s_sum_conf_array(x, n);
 228 }
 229
 230 int
 231 s_dot_two_vectors(vector_t vs[2])
 232 {
 233   return vs[0].x * vs[1].x + vs[0].y * vs[1].y + vs[0].z * vs[1].z;
 234 }
 235
 236 int
 237 s_sum_cs(cs_t *cs)
 238 {
 239   return s_sum_conf_array(cs->ca, cs->n);
 240 }
 241
 242 int
 243 s_sum_cps(cps_t *cps)
 244 {
 245   int sum = 0;
 246   int i;
 247
 248   for (i = 0; i < *cps->pn; ++i)
 249     sum += cps->ca1[i];
 250
 251   for (i = 0; i < 2 * cps->n; ++i)
 252     sum += cps->ca2[i];
 253
 254   return sum;
 255 }
 256
 257 int
 258 s_sum_cpsc(cpsc_t *cpsc)
 259 {
 260   int sum = 0;
 261   int i;
 262   for (i = 0; i < (cpsc->c ? cpsc->a : cpsc->b); ++i)
 263     sum += cpsc->ca[i];
 264   return sum;
 265 }
 266
 267 int
 268 s_square_puint(puint_t p)
 269 {
 270   int n = atoi(p);
 271   return n * n;
 272 }
 273
 274 int
 275 s_sum_puints(puints_t *p)
 276 {
 277   int sum = 0;
 278   int i;
 279   for (i = 0; i < p->n; ++i)
 280     sum += atoi(p->ps[i]);
 281   return sum;
 282 }
 283
 284 int
 285 s_sum_cpuints(cpuints_t *p)
 286 {
 287   int sum = 0;
 288   int i;
 289   for (i = 0; i < p->n; ++i)
 290     sum += atoi(p->ps[i]);
 291   return sum;
 292 }
 293
 294 int
 295 s_dot_copy_vectors(vector_t u, vector_t v)
 296 {
 297   return u.x * v.x + u.y * v.y + u.z * v.z;
 298 }
 299
 300 int
 301 s_square_test_us(test_us_t *tus)
 302 {
 303   int n = atoi(tus->us.x);
 304   return n * n;
 305 }
 306
 307 double
 308 s_square_encu(encu_t *eu)
 309 {
 310   switch (eu->t)
 311   {
 312   case ENCU_I: return eu->tagged_union.i * eu->tagged_union.i;
 313   case ENCU_F: return eu->tagged_union.f * eu->tagged_union.f;
 314   default:
 315     return 0.0;
 316   }
 317 }
 318
 319 int
 320 s_sum_parr(int *a[3])
 321 {
 322   return s_sum_pcarr(a, 3);
 323 }
 324
 325 int
 326 s_sum_pcarr(int *a[], int n)
 327 {
 328   int i, s = 0;
 329   for (i = 0; i < n; ++i)
 330     s += *a[i];
 331   return s;
 332 }
 333
 334 int
 335 s_enum_ord(e_t e)
 336 {
 337   switch (e)
 338   {
 339   case E1: return 1;
 340   case E2: return 2;
 341   case E3: return 3;
 342   case E4: return 4;
 343   default:
 344     return 0;
 345   }
 346 }
 347
 348 double
 349 s_square_encue(encue_t *eue)
 350 {
 351   switch (eue->t)
 352   {
 353   case E1: return eue->tagged_union.i1 * eue->tagged_union.i1;
 354   case E2: return eue->tagged_union.f2 * eue->tagged_union.f2;
 355   default:
 356     return 0.0;
 357   }
 358 }
 359
 360 int
 361 s_sum_toplev_conf_2n(int *x, int n)
 362 {
 363   int sum = 0;
 364   int i;
 365   for (i = 0; i < 2 * n; ++i)
 366     sum += x[i];
 367   return sum;
 368 }
 369
 370 int
 371 s_sum_toplev_conf_cond(int *x, int a, int b, int c)
 372 {
 373   int sum = 0;
 374   int n = c ? a : b;
 375   int i;
 376   for (i = 0; i < n; ++i)
 377     sum += x[i];
 378   return sum;
 379 }
 380
 381 double
 382 s_sum_aligns(aligns_t *a)
 383 {
 384   return a->c + a->i + a->s + a->d;
 385 }
 386
 387 int
 388 s_sum_padded(padded_t *p)
 389 {
 390   return p->i + p->c;
 391 }
 392
 393 int
 394 s_sum_padded2(padded_t ps[2])
 395 {
 396   return s_sum_padded(&ps[0]) + s_sum_padded(&ps[1]);
 397 }
 398
 399 int
 400 s_sum_padded_conf(padded_t *ps, int n)
 401 {
 402   int sum = 0;
 403   int i;
 404   for (i = 0; i < n; ++i)
 405     sum += s_sum_padded(&ps[i]);
 406   return sum;
 407 }
 408
 409 int
 410 s_sum_bogus(bogus_t *b)
 411 {
 412   return *b->h.p1 + *b->p2 + *b->p3 + b->c;
 413 }
 414
 415 void
 416 s_check_null(int *null)
 417 {
 418   ok(!null, "RPC check_null\n");
 419 }
 420
 421 int
 422 s_str_struct_len(str_struct_t *s)
 423 {
 424   return lstrlenA(s->s);
 425 }
 426
 427 int
 428 s_wstr_struct_len(wstr_struct_t *s)
 429 {
 430   return lstrlenW(s->s);
 431 }
 432
 433 int
 434 s_sum_doub_carr(doub_carr_t *dc)
 435 {
 436   int i, j;
 437   int sum = 0;
 438   for (i = 0; i < dc->n; ++i)
 439     for (j = 0; j < dc->a[i]->n; ++j)
 440       sum += dc->a[i]->a[j];
 441   return sum;
 442 }
 443
 444 void
 445 s_make_pyramid_doub_carr(unsigned char n, doub_carr_t **dc)
 446 {
 447   doub_carr_t *t;
 448   int i, j;
 449   t = MIDL_user_allocate(FIELD_OFFSET(doub_carr_t, a[n]));
 450   t->n = n;
 451   for (i = 0; i < n; ++i)
 452   {
 453     int v = i + 1;
 454     t->a[i] = MIDL_user_allocate(FIELD_OFFSET(doub_carr_1_t, a[v]));
 455     t->a[i]->n = v;
 456     for (j = 0; j < v; ++j)
 457       t->a[i]->a[j] = j + 1;
 458   }
 459   *dc = t;
 460 }
 461
 462 unsigned
 463 s_hash_bstr(bstr_t b)
 464 {
 465   short n = b[-1];
 466   short *s = b;
 467   unsigned hash = 0;
 468   short i;
 469   for (i = 0; i < n; ++i)
 470     hash = 5 * hash + (unsigned) s[i];
 471   return hash;
 472 }
 473
 474 void
 475 s_get_name(name_t *name)
 476 {
 477   const char bossman[] = "Jeremy White";
 478   memcpy(name->name, bossman, min(name->size, sizeof(bossman)));
 479   /* ensure nul-termination */
 480   if (name->size < sizeof(bossman))
 481     name->name[name->size - 1] = 0;
 482 }
 483
 484 void
 485 s_stop(void)
 486 {
 487   ok(RPC_S_OK == RpcMgmtStopServerListening(NULL), "RpcMgmtStopServerListening\n");
 488   ok(RPC_S_OK == RpcServerUnregisterIf(NULL, NULL, FALSE), "RpcServerUnregisterIf\n");
 489   ok(SetEvent(stop_event), "SetEvent\n");
 490 }
 491
 492 static void
 493 make_cmdline(char buffer[MAX_PATH], const char *test)
 494 {
 495   sprintf(buffer, "%s server %s", progname, test);
 496 }
 497
 498 static int
 499 run_client(const char *test)
 500 {
 501   char cmdline[MAX_PATH];
 502   PROCESS_INFORMATION info;
 503   STARTUPINFOA startup;
 504   DWORD exitcode;
 505
 506   memset(&startup, 0, sizeof startup);
 507   startup.cb = sizeof startup;
 508
 509   make_cmdline(cmdline, test);
 510   ok(CreateProcessA(NULL, cmdline, NULL, NULL, FALSE, 0L, NULL, NULL, &startup, &info), "CreateProcess\n");
 511   ok(WaitForSingleObject(info.hProcess, 30000) == WAIT_OBJECT_0, "Child process termination\n");
 512   ok(GetExitCodeProcess(info.hProcess, &exitcode), "GetExitCodeProcess\n");
 513   ok(CloseHandle(info.hProcess), "CloseHandle\n");
 514   ok(CloseHandle(info.hThread), "CloseHandle\n");
 515
 516   return exitcode == 0;
 517 }
 518
 519 static void
 520 basic_tests(void)
 521 {
 522   char string[] = "I am a string";
 523   WCHAR wstring[] = {'I',' ','a','m',' ','a',' ','w','s','t','r','i','n','g', 0};
 524   int f[5] = {1, 3, 0, -2, -4};
 525   vector_t a = {1, 3, 7};
 526   vector_t vec1 = {4, -2, 1}, vec2 = {-5, 2, 3}, *pvec2 = &vec2;
 527   pvectors_t pvecs = {&vec1, &pvec2};
 528   sp_inner_t spi = {42};
 529   sp_t sp = {-13, &spi};
 530   aligns_t aligns = {3, 4, 5, 6.0};
 531   pints_t pints;
 532   ptypes_t ptypes;
 533   padded_t padded;
 534   padded_t padded2[2];
 535   bogus_t bogus;
 536   int i1, i2, i3, *pi2, *pi3, **ppi3;
 537   double u, v;
 538   float s, t;
 539   long q, r;
 540   short h;
 541   char c;
 542   int x;
 543   str_struct_t ss = {string};
 544   wstr_struct_t ws = {wstring};
 545
 546   ok(int_return() == INT_CODE, "RPC int_return\n");
 547
 548   ok(square(7) == 49, "RPC square\n");
 549   ok(sum(23, -4) == 19, "RPC sum\n");
 550
 551   x = 0;
 552   square_out(11, &x);
 553   ok(x == 121, "RPC square_out\n");
 554
 555   x = 5;
 556   square_ref(&x);
 557   ok(x == 25, "RPC square_ref\n");
 558
 559   ok(str_length(string) == strlen(string), "RPC str_length\n");
 560   ok(dot_self(&a) == 59, "RPC dot_self\n");
 561
 562   ok(str_struct_len(&ss) == lstrlenA(string), "RPC str_struct_len\n");
 563   ok(wstr_struct_len(&ws) == lstrlenW(wstring), "RPC str_struct_len\n");
 564
 565   v = 0.0;
 566   u = square_half(3.0, &v);
 567   ok(u == 9.0, "RPC square_half\n");
 568   ok(v == 1.5, "RPC square_half\n");
 569
 570   t = 0.0f;
 571   s = square_half_float(3.0f, &t);
 572   ok(s == 9.0f, "RPC square_half_float\n");
 573   ok(t == 1.5f, "RPC square_half_float\n");
 574
 575   r = 0;
 576   q = square_half_long(3, &r);
 577   ok(q == 9, "RPC square_half_long\n");
 578   ok(r == 1, "RPC square_half_long\n");
 579
 580   i1 = 19;
 581   i2 = -3;
 582   i3 = -29;
 583   pi2 = &i2;
 584   pi3 = &i3;
 585   ppi3 = &pi3;
 586   pints.pi = &i1;
 587   pints.ppi = &pi2;
 588   pints.pppi = &ppi3;
 589   ok(pints_sum(&pints) == -13, "RPC pints_sum\n");
 590
 591   c = 10;
 592   h = 3;
 593   q = 14;
 594   s = -5.0f;
 595   u = 11.0;
 596   ptypes.pc = &c;
 597   ptypes.ps = &h;
 598   ptypes.pl = &q;
 599   ptypes.pf = &s;
 600   ptypes.pd = &u;
 601   ok(ptypes_sum(&ptypes) == 33.0, "RPC ptypes_sum\n");
 602
 603   ok(dot_pvectors(&pvecs) == -21, "RPC dot_pvectors\n");
 604   ok(dot_copy_vectors(vec1, vec2) == -21, "RPC dot_copy_vectors\n");
 605   ok(sum_fixed_array(f) == -2, "RPC sum_fixed_array\n");
 606   ok(sum_sp(&sp) == 29, "RPC sum_sp\n");
 607
 608   ok(enum_ord(E1) == 1, "RPC enum_ord\n");
 609   ok(enum_ord(E2) == 2, "RPC enum_ord\n");
 610   ok(enum_ord(E3) == 3, "RPC enum_ord\n");
 611   ok(enum_ord(E4) == 4, "RPC enum_ord\n");
 612
 613   ok(sum_aligns(&aligns) == 18.0, "RPC sum_aligns\n");
 614
 615   padded.i = -3;
 616   padded.c = 8;
 617   ok(sum_padded(&padded) == 5, "RPC sum_padded\n");
 618   padded2[0].i = -5;
 619   padded2[0].c = 1;
 620   padded2[1].i = 3;
 621   padded2[1].c = 7;
 622   ok(sum_padded2(padded2) == 6, "RPC sum_padded2\n");
 623   padded2[0].i = -5;
 624   padded2[0].c = 1;
 625   padded2[1].i = 3;
 626   padded2[1].c = 7;
 627   ok(sum_padded_conf(padded2, 2) == 6, "RPC sum_padded_conf\n");
 628
 629   i1 = 14;
 630   i2 = -7;
 631   i3 = -4;
 632   bogus.h.p1 = &i1;
 633   bogus.p2 = &i2;
 634   bogus.p3 = &i3;
 635   bogus.c = 9;
 636   ok(sum_bogus(&bogus) == 12, "RPC sum_bogus\n");
 637
 638   check_null(NULL);
 639 }
 640
 641 static void
 642 union_tests(void)
 643 {
 644   encue_t eue;
 645   encu_t eu;
 646   sun_t su;
 647   int i;
 648
 649   su.s = SUN_I;
 650   su.u.i = 9;
 651   ok(square_sun(&su) == 81.0, "RPC square_sun\n");
 652
 653   su.s = SUN_F1;
 654   su.u.f = 5.0;
 655   ok(square_sun(&su) == 25.0, "RPC square_sun\n");
 656
 657   su.s = SUN_F2;
 658   su.u.f = -2.0;
 659   ok(square_sun(&su) == 4.0, "RPC square_sun\n");
 660
 661   su.s = SUN_PI;
 662   su.u.pi = &i;
 663   i = 11;
 664   ok(square_sun(&su) == 121.0, "RPC square_sun\n");
 665
 666   eu.t = ENCU_I;
 667   eu.tagged_union.i = 7;
 668   ok(square_encu(&eu) == 49.0, "RPC square_encu\n");
 669
 670   eu.t = ENCU_F;
 671   eu.tagged_union.f = 3.0;
 672   ok(square_encu(&eu) == 9.0, "RPC square_encu\n");
 673
 674   eue.t = E1;
 675   eue.tagged_union.i1 = 8;
 676   ok(square_encue(&eue) == 64.0, "RPC square_encue\n");
 677
 678   eue.t = E2;
 679   eue.tagged_union.f2 = 10.0;
 680   ok(square_encue(&eue) == 100.0, "RPC square_encue\n");
 681 }
 682
 683 static test_list_t *
 684 null_list(void)
 685 {
 686   test_list_t *n = HeapAlloc(GetProcessHeap(), 0, sizeof *n);
 687   n->t = TL_NULL;
 688   return n;
 689 }
 690
 691 static test_list_t *
 692 make_list(test_list_t *tail)
 693 {
 694   test_list_t *n = HeapAlloc(GetProcessHeap(), 0, sizeof *n);
 695   n->t = TL_LIST;
 696   n->u.tail = tail;
 697   return n;
 698 }
 699
 700 static void
 701 free_list(test_list_t *list)
 702 {
 703   if (list->t == TL_LIST)
 704     free_list(list->u.tail);
 705   HeapFree(GetProcessHeap(), 0, list);
 706 }
 707
 708 ULONG __RPC_USER
 709 puint_t_UserSize(ULONG *flags, ULONG start, puint_t *p)
 710 {
 711   return start + sizeof(int);
 712 }
 713
 714 unsigned char * __RPC_USER
 715 puint_t_UserMarshal(ULONG *flags, unsigned char *buffer, puint_t *p)
 716 {
 717   int n = atoi(*p);
 718   memcpy(buffer, &n, sizeof n);
 719   return buffer + sizeof n;
 720 }
 721
 722 unsigned char * __RPC_USER
 723 puint_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, puint_t *p)
 724 {
 725   int n;
 726   memcpy(&n, buffer, sizeof n);
 727   *p = HeapAlloc(GetProcessHeap(), 0, 10);
 728   sprintf(*p, "%d", n);
 729   return buffer + sizeof n;
 730 }
 731
 732 void __RPC_USER
 733 puint_t_UserFree(ULONG *flags, puint_t *p)
 734 {
 735   HeapFree(GetProcessHeap(), 0, *p);
 736 }
 737
 738 ULONG __RPC_USER
 739 us_t_UserSize(ULONG *flags, ULONG start, us_t *pus)
 740 {
 741   return start + sizeof(struct wire_us);
 742 }
 743
 744 unsigned char * __RPC_USER
 745 us_t_UserMarshal(ULONG *flags, unsigned char *buffer, us_t *pus)
 746 {
 747   struct wire_us wus;
 748   wus.x = atoi(pus->x);
 749   memcpy(buffer, &wus, sizeof wus);
 750   return buffer + sizeof wus;
 751 }
 752
 753 unsigned char * __RPC_USER
 754 us_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, us_t *pus)
 755 {
 756   struct wire_us wus;
 757   memcpy(&wus, buffer, sizeof wus);
 758   pus->x = HeapAlloc(GetProcessHeap(), 0, 10);
 759   sprintf(pus->x, "%d", wus.x);
 760   return buffer + sizeof wus;
 761 }
 762
 763 void __RPC_USER
 764 us_t_UserFree(ULONG *flags, us_t *pus)
 765 {
 766   HeapFree(GetProcessHeap(), 0, pus->x);
 767 }
 768
 769 ULONG __RPC_USER
 770 bstr_t_UserSize(ULONG *flags, ULONG start, bstr_t *b)
 771 {
 772   return start + FIELD_OFFSET(wire_bstr_t, data[(*b)[-1]]);
 773 }
 774
 775 unsigned char * __RPC_USER
 776 bstr_t_UserMarshal(ULONG *flags, unsigned char *buffer, bstr_t *b)
 777 {
 778   wire_bstr_t *wb = (wire_bstr_t *) buffer;
 779   wb->n = (*b)[-1];
 780   memcpy(&wb->data, *b, wb->n * sizeof wb->data[0]);
 781   return buffer + FIELD_OFFSET(wire_bstr_t, data[wb->n]);
 782 }
 783
 784 unsigned char * __RPC_USER
 785 bstr_t_UserUnmarshal(ULONG *flags, unsigned char *buffer, bstr_t *b)
 786 {
 787   wire_bstr_t *wb = (wire_bstr_t *) buffer;
 788   short *data = HeapAlloc(GetProcessHeap(), 0, (wb->n + 1) * sizeof *data);
 789   data[0] = wb->n;
 790   memcpy(&data[1], wb->data, wb->n * sizeof data[1]);
 791   *b = &data[1];
 792   return buffer + FIELD_OFFSET(wire_bstr_t, data[wb->n]);
 793 }
 794
 795 void __RPC_USER
 796 bstr_t_UserFree(ULONG *flags, bstr_t *b)
 797 {
 798   HeapFree(GetProcessHeap(), 0, &((*b)[-1]));
 799 }
 800
 801 static void
 802 pointer_tests(void)
 803 {
 804   int a[] = {1, 2, 3, 4};
 805   char p1[] = "11";
 806   test_list_t *list = make_list(make_list(make_list(null_list())));
 807   test_us_t tus = {{p1}};
 808   int *pa[4];
 809   puints_t pus;
 810   cpuints_t cpus;
 811   short bstr_data[] = { 5, 'H', 'e', 'l', 'l', 'o' };
 812   bstr_t bstr = &bstr_data[1];
 813   name_t name;
 814   void *buffer;
 815
 816   ok(test_list_length(list) == 3, "RPC test_list_length\n");
 817   ok(square_puint(p1) == 121, "RPC square_puint\n");
 818   pus.n = 4;
 819   pus.ps = HeapAlloc(GetProcessHeap(), 0, pus.n * sizeof pus.ps[0]);
 820   pus.ps[0] = xstrdup("5");
 821   pus.ps[1] = xstrdup("6");
 822   pus.ps[2] = xstrdup("7");
 823   pus.ps[3] = xstrdup("8");
 824   ok(sum_puints(&pus) == 26, "RPC sum_puints\n");
 825   HeapFree(GetProcessHeap(), 0, pus.ps[0]);
 826   HeapFree(GetProcessHeap(), 0, pus.ps[1]);
 827   HeapFree(GetProcessHeap(), 0, pus.ps[2]);
 828   HeapFree(GetProcessHeap(), 0, pus.ps[3]);
 829   HeapFree(GetProcessHeap(), 0, pus.ps);
 830   cpus.n = 4;
 831   cpus.ps = HeapAlloc(GetProcessHeap(), 0, cpus.n * sizeof cpus.ps[0]);
 832   cpus.ps[0] = xstrdup("5");
 833   cpus.ps[1] = xstrdup("6");
 834   cpus.ps[2] = xstrdup("7");
 835   cpus.ps[3] = xstrdup("8");
 836   ok(sum_cpuints(&cpus) == 26, "RPC sum_puints\n");
 837   HeapFree(GetProcessHeap(), 0, cpus.ps[0]);
 838   HeapFree(GetProcessHeap(), 0, cpus.ps[1]);
 839   HeapFree(GetProcessHeap(), 0, cpus.ps[2]);
 840   HeapFree(GetProcessHeap(), 0, cpus.ps[3]);
 841   HeapFree(GetProcessHeap(), 0, cpus.ps);
 842   ok(square_test_us(&tus) == 121, "RPC square_test_us\n");
 843
 844   pa[0] = &a[0];
 845   pa[1] = &a[1];
 846   pa[2] = &a[2];
 847   ok(sum_parr(pa) == 6, "RPC sum_parr\n");
 848
 849   pa[0] = &a[0];
 850   pa[1] = &a[1];
 851   pa[2] = &a[2];
 852   pa[3] = &a[3];
 853   ok(sum_pcarr(pa, 4) == 10, "RPC sum_pcarr\n");
 854
 855   ok(hash_bstr(bstr) == s_hash_bstr(bstr), "RPC hash_bstr_data\n");
 856
 857   free_list(list);
 858
 859   name.size = 10;
 860   name.name = buffer = HeapAlloc(GetProcessHeap(), 0, name.size);
 861   get_name(&name);
 862   todo_wine
 863   ok(name.name == buffer, "[in,out] pointer should have stayed as %p but instead changed to %p\n", name.name, buffer);
 864   HeapFree(GetProcessHeap(), 0, name.name);
 865 }
 866
 867 static int
 868 check_pyramid_doub_carr(doub_carr_t *dc)
 869 {
 870   int i, j;
 871   for (i = 0; i < dc->n; ++i)
 872     for (j = 0; j < dc->a[i]->n; ++j)
 873       if (dc->a[i]->a[j] != j + 1)
 874         return FALSE;
 875   return TRUE;
 876 }
 877
 878 static void
 879 free_pyramid_doub_carr(doub_carr_t *dc)
 880 {
 881   int i;
 882   for (i = 0; i < dc->n; ++i)
 883     MIDL_user_free(dc->a[i]);
 884   MIDL_user_free(dc);
 885 }
 886
 887 static void
 888 array_tests(void)
 889 {
 890   const char str1[25] = "Hello";
 891   int m[2][3][4] =
 892   {
 893     {{1, 2, 3, 4}, {-1, -3, -5, -7}, {0, 2, 4, 6}},
 894     {{1, -2, 3, -4}, {2, 3, 5, 7}, {-4, -1, -14, 4114}}
 895   };
 896   int c[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
 897   vector_t vs[2] = {{1, -2, 3}, {4, -5, -6}};
 898   cps_t cps;
 899   cpsc_t cpsc;
 900   cs_t *cs;
 901   int n;
 902   int ca[5] = {1, -2, 3, -4, 5};
 903   doub_carr_t *dc;
 904
 905   ok(cstr_length(str1, sizeof str1) == strlen(str1), "RPC cstr_length\n");
 906
 907   ok(sum_fixed_int_3d(m) == 4116, "RPC sum_fixed_int_3d\n");
 908
 909   ok(sum_conf_array(c, 10) == 45, "RPC sum_conf_array\n");
 910   ok(sum_conf_array(&c[5], 2) == 11, "RPC sum_conf_array\n");
 911   ok(sum_conf_array(&c[7], 1) == 7, "RPC sum_conf_array\n");
 912   ok(sum_conf_array(&c[2], 0) == 0, "RPC sum_conf_array\n");
 913
 914   ok(sum_unique_conf_array(ca, 4) == -2, "RPC sum_unique_conf_array\n");
 915   ok(sum_unique_conf_ptr(ca, 5) == 3, "RPC sum_unique_conf_array\n");
 916   ok(sum_unique_conf_ptr(NULL, 10) == 0, "RPC sum_unique_conf_array\n");
 917
 918   ok(sum_var_array(c, 10) == 45, "RPC sum_conf_array\n");
 919   ok(sum_var_array(&c[5], 2) == 11, "RPC sum_conf_array\n");
 920   ok(sum_var_array(&c[7], 1) == 7, "RPC sum_conf_array\n");
 921   ok(sum_var_array(&c[2], 0) == 0, "RPC sum_conf_array\n");
 922
 923   ok(dot_two_vectors(vs) == -4, "RPC dot_two_vectors\n");
 924   cs = HeapAlloc(GetProcessHeap(), 0, FIELD_OFFSET(cs_t, ca[5]));
 925   cs->n = 5;
 926   cs->ca[0] = 3;
 927   cs->ca[1] = 5;
 928   cs->ca[2] = -2;
 929   cs->ca[3] = -1;
 930   cs->ca[4] = -4;
 931   ok(sum_cs(cs) == 1, "RPC sum_cs\n");
 932   HeapFree(GetProcessHeap(), 0, cs);
 933
 934   n = 5;
 935   cps.pn = &n;
 936   cps.ca1 = &c[2];
 937   cps.n = 3;
 938   cps.ca2 = &c[3];
 939   ok(sum_cps(&cps) == 53, "RPC sum_cps\n");
 940
 941   cpsc.a = 4;
 942   cpsc.b = 5;
 943   cpsc.c = 1;
 944   cpsc.ca = c;
 945   ok(sum_cpsc(&cpsc) == 6, "RPC sum_cpsc\n");
 946   cpsc.a = 4;
 947   cpsc.b = 5;
 948   cpsc.c = 0;
 949   cpsc.ca = c;
 950   ok(sum_cpsc(&cpsc) == 10, "RPC sum_cpsc\n");
 951
 952   ok(sum_toplev_conf_2n(c, 3) == 15, "RPC sum_toplev_conf_2n\n");
 953   ok(sum_toplev_conf_cond(c, 5, 6, 1) == 10, "RPC sum_toplev_conf_cond\n");
 954   ok(sum_toplev_conf_cond(c, 5, 6, 0) == 15, "RPC sum_toplev_conf_cond\n");
 955
 956   dc = malloc(FIELD_OFFSET(doub_carr_t, a[2]));
 957   dc->n = 2;
 958   dc->a[0] = malloc(FIELD_OFFSET(doub_carr_1_t, a[3]));
 959   dc->a[0]->n = 3;
 960   dc->a[0]->a[0] = 5;
 961   dc->a[0]->a[1] = 1;
 962   dc->a[0]->a[2] = 8;
 963   dc->a[1] = malloc(FIELD_OFFSET(doub_carr_1_t, a[2]));
 964   dc->a[1]->n = 2;
 965   dc->a[1]->a[0] = 2;
 966   dc->a[1]->a[1] = 3;
 967   ok(sum_doub_carr(dc) == 19, "RPC sum_doub_carr\n");
 968   free(dc->a[0]);
 969   free(dc->a[1]);
 970   free(dc);
 971
 972   dc = NULL;
 973   make_pyramid_doub_carr(4, &dc);
 974   ok(check_pyramid_doub_carr(dc), "RPC make_pyramid_doub_carr\n");
 975   free_pyramid_doub_carr(dc);
 976 }
 977
 978 static void
 979 run_tests(void)
 980 {
 981   basic_tests();
 982   union_tests();
 983   pointer_tests();
 984   array_tests();
 985 }
 986
 987 static void
 988 client(const char *test)
 989 {
 990   if (strcmp(test, "tcp_basic") == 0)
 991   {
 992     static unsigned char iptcp[] = "ncacn_ip_tcp";
 993     static unsigned char address[] = "127.0.0.1";
 994     static unsigned char port[] = PORT;
 995     unsigned char *binding;
 996
 997     ok(RPC_S_OK == RpcStringBindingCompose(NULL, iptcp, address, port, NULL, &binding), "RpcStringBindingCompose\n");
 998     ok(RPC_S_OK == RpcBindingFromStringBinding(binding, &IServer_IfHandle), "RpcBindingFromStringBinding\n");
 999
1000     run_tests();
1001
1002     ok(RPC_S_OK == RpcStringFree(&binding), "RpcStringFree\n");
1003     ok(RPC_S_OK == RpcBindingFree(&IServer_IfHandle), "RpcBindingFree\n");
1004   }
1005   else if (strcmp(test, "np_basic") == 0)
1006   {
1007     static unsigned char np[] = "ncacn_np";
1008     static unsigned char address[] = "\\\\.";
1009     static unsigned char pipe[] = PIPE;
1010     unsigned char *binding;
1011
1012     ok(RPC_S_OK == RpcStringBindingCompose(NULL, np, address, pipe, NULL, &binding), "RpcStringBindingCompose\n");
1013     ok(RPC_S_OK == RpcBindingFromStringBinding(binding, &IServer_IfHandle), "RpcBindingFromStringBinding\n");
1014
1015     run_tests();
1016     stop();
1017
1018     ok(RPC_S_OK == RpcStringFree(&binding), "RpcStringFree\n");
1019     ok(RPC_S_OK == RpcBindingFree(&IServer_IfHandle), "RpcBindingFree\n");
1020   }
1021 }
1022
1023 static void
1024 server(void)
1025 {
1026   static unsigned char iptcp[] = "ncacn_ip_tcp";
1027   static unsigned char port[] = PORT;
1028   static unsigned char np[] = "ncacn_np";
1029   static unsigned char pipe[] = PIPE;
1030
1031   ok(RPC_S_OK == RpcServerUseProtseqEp(iptcp, 20, port, NULL), "RpcServerUseProtseqEp\n");
1032   ok(RPC_S_OK == RpcServerRegisterIf(s_IServer_v0_0_s_ifspec, NULL, NULL), "RpcServerRegisterIf\n");
1033   ok(RPC_S_OK == RpcServerListen(1, 20, TRUE), "RpcServerListen\n");
1034
1035   stop_event = CreateEvent(NULL, FALSE, FALSE, NULL);
1036   ok(stop_event != NULL, "CreateEvent failed\n");
1037
1038   ok(run_client("tcp_basic"), "tcp_basic client test failed\n");
1039
1040   ok(RPC_S_OK == RpcServerUseProtseqEp(np, 0, pipe, NULL), "RpcServerUseProtseqEp\n");
1041   ok(run_client("np_basic"), "np_basic client test failed\n");
1042
1043   ok(WAIT_OBJECT_0 == WaitForSingleObject(stop_event, 60000), "WaitForSingleObject\n");
1044   todo_wine {
1045     ok(RPC_S_OK == RpcMgmtWaitServerListen(), "RpcMgmtWaitServerListening\n");
1046   }
1047 }
1048
1049 START_TEST(server)
1050 {
1051   int argc;
1052   char **argv;
1053
1054   argc = winetest_get_mainargs(&argv);
1055   progname = argv[0];
1056
1057   if (argc == 3)
1058   {
1059     RpcTryExcept
1060     {
1061       client(argv[2]);
1062     }
1063     RpcExcept(TRUE)
1064     {
1065       trace("Exception %d\n", RpcExceptionCode());
1066     }
1067     RpcEndExcept
1068   }
1069   else
1070     server();
1071 }