2 * A simple interface to test the RPC server.
4 * Copyright (C) Google 2007 (Dan Hipschman)
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.
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.
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
21 #include "server_defines.h"
23 typedef struct tag_vector
30 typedef int fnprintf(const char *format, ...);
33 uuid(00000000-4114-0704-2301-000000000000),
34 implicit_handle(handle_t IServer_IfHandle)
39 typedef wchar_t WCHAR;
42 typedef [string] char *str_t;
43 typedef [string] WCHAR *wstr_t;
72 [case(SUN_F1, SUN_F2)] float f;
73 [case(SUN_PI)] int *pi;
81 int sum(int x, int y);
82 signed char sum_char(signed char x, signed char y);
83 short sum_short(short x, short y);
84 int sum_float(float x, float y);
85 int sum_double_int(int x, double y);
86 hyper sum_hyper(hyper x, hyper y);
87 int sum_hyper_int(hyper x, hyper y);
88 int sum_char_hyper(signed char x, hyper y);
89 void square_out(int x, [out] int *y);
90 void square_ref([in, out] int *x);
91 int str_length([string] const char *s);
92 int str_t_length(str_t s);
93 int cstr_length([string, size_is(n)] const char *s, int n);
94 int dot_self(vector_t *v);
95 double square_half(double x, [out] double *y);
96 float square_half_float(float x, [out] float *y);
97 long square_half_long(long x, [out] long *y);
98 int sum_fixed_array(int a[5]);
99 int pints_sum(pints_t *pints);
100 double ptypes_sum(ptypes_t *ptypes);
101 int dot_pvectors(pvectors_t *pvectors);
103 /* don't use this anywhere except in sp_t */
115 int sum_sp(sp_t *sp);
116 double square_sun(sun_t *su);
118 typedef struct test_list
123 [case(TL_NULL)] char x; /* end of list */
124 [case(TL_LIST)] struct test_list *tail;
128 typedef [ref] int *refpint_t;
130 int test_list_length(test_list_t *ls);
131 int sum_fixed_int_3d(int m[2][3][4]);
132 int sum_conf_array([size_is(n)] int x[], int n);
133 int sum_conf_ptr_by_conf_ptr(int n1, [size_is(n1)] int *n2_then_x1, [size_is(*n2_then_x1)] int *x2);
134 int sum_unique_conf_array([size_is(n), unique] int x[], int n);
135 int sum_unique_conf_ptr([size_is(n), unique] int *x, int n);
136 int sum_var_array([length_is(n)] int x[20], int n);
137 int dot_two_vectors(vector_t vs[2]);
138 void get_number_array([out, length_is(*n)] int x[20], [out] int *n);
143 [size_is(n)] int ca[];
149 [size_is(*pn)] int *ca1;
150 [size_is(n * 2)] int *ca2;
156 [size_is(c ? a : b)] int *ca;
162 int sum_cs(cs_t *cs);
163 int sum_cps(cps_t *cps);
164 int sum_cpsc(cpsc_t *cpsc);
165 int get_cpsc(int n, [out] cpsc_t *cpsc );
166 int sum_complex_array(int n, [size_is(n)] refpint_t pi[]);
168 typedef [wire_marshal(int)] void *puint_t;
169 int square_puint(puint_t p);
173 [size_is(n)] puint_t *ps;
177 /* Same thing as puints_t, but make it complex (needs padding). */
180 [size_is(n)] puint_t *ps;
184 int sum_puints(puints_t *p);
185 int sum_cpuints(cpuints_t *p);
186 int dot_copy_vectors(vector_t u, vector_t v);
188 typedef struct wire_us *wire_us_t;
189 typedef [wire_marshal(wire_us_t)] struct us us_t;
203 int square_test_us(test_us_t *tus);
205 typedef union encu switch (int t)
208 case ENCU_F: float f;
211 typedef [switch_type(int)] union unencu
213 [case (ENCU_I)] int i;
214 [case (ENCU_F)] float f;
225 typedef union encue switch (e_t t)
236 double square_encu(encu_t *eu);
237 double square_unencu(int t, [switch_is(t)] unencu_t *eu);
238 int sum_parr(int *a[3]);
239 int sum_pcarr([size_is(n)] int *a[], int n);
241 double square_encue(encue_t *eue);
242 void check_se2(se_t *s);
244 int sum_toplev_conf_2n([size_is(n * 2)] int *x, int n);
245 int sum_toplev_conf_cond([size_is(c ? a : b)] int *x, int a, int b, int c);
255 double sum_aligns(aligns_t *a);
263 int sum_padded(padded_t *p);
264 int sum_padded2(padded_t ps[2]);
265 int sum_padded_conf([size_is(n)] padded_t *ps, int n);
280 int sum_bogus(bogus_t *b);
281 void check_null([unique] int *null);
293 int str_struct_len(str_struct_t *s);
294 int wstr_struct_len(wstr_struct_t *s);
299 [size_is(n)] byte a[];
305 [size_is(n)] doub_carr_1_t *a[];
308 int sum_doub_carr(doub_carr_t *dc);
309 void make_pyramid_doub_carr(unsigned char n, [out] doub_carr_t **dc);
314 [size_is(n)] short data[];
317 typedef [unique] user_bstr_t *wire_bstr_t;
318 typedef [wire_marshal(wire_bstr_t)] short *bstr_t;
319 unsigned hash_bstr(bstr_t s);
320 void get_a_bstr([out]bstr_t *s);
323 [string, size_is(size)] char *name;
326 void get_name([in,out] name_t *name);
328 int sum_pcarr2(int n, [size_is(, n)] int **pa);
329 int sum_L1_norms(int n, [size_is(n)] vector_t *vs);
331 /* Don't use this except in the get_s123 test. */
339 /* Make sure WIDL generates a type format string for a previously unseen
340 type as a return value. */
341 s123_t *get_s123(void);
347 [size_is(size), length_is(length)] pints_t numbers[];
350 void get_numbers([in] int length, [in] int size, [out, length_is(length), size_is(size)] pints_t pn[]);
351 void get_numbers_struct([out] numbers_struct_t **ns);
353 str_t get_filename(void);
362 const int RE_MIN = RE0;
363 const int RE_MAX = RE3;
364 typedef [range(RE_MIN, RE_MAX)] enum renum renum_t;
365 typedef [range(0, 100)] int rint_t;
366 rint_t echo_ranged_int([range(0, 10)] int i, [range(0, 20)] int j, [range(0, 100)] int k);
367 rint_t echo_ranged_int2([range(0, 40)] int i);
368 void get_ranged_enum([out] renum_t *re);
370 void context_handle_test(void);
372 void full_pointer_test([in, ptr] int *a, [in, ptr] int *b);
373 void full_pointer_null_test([in, ptr] int *a, [in, ptr] int *b);
375 void authinfo_test(unsigned int protseq, int secure);