Mercurial > pub > dyncall > dyncall

comparison test/call_suite_aggrs/cases.c @ 492:29d09d10ecd9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
- added unsigned types to call_suite_aggrs
author Tassilo Philipp
date Mon, 21 Mar 2022 10:04:10 +0100
parents 0c68b3f91367
children f0080b53635d
comparison
equal deleted inserted replaced
491:e3bf15207d93 492:29d09d10ecd9
28 #define ret_c(X) return(K_c[X]); 28 #define ret_c(X) return(K_c[X]);
29 #define ret_s(X) return(K_s[X]); 29 #define ret_s(X) return(K_s[X]);
30 #define ret_i(X) return(K_i[X]); 30 #define ret_i(X) return(K_i[X]);
31 #define ret_j(X) return(K_j[X]); 31 #define ret_j(X) return(K_j[X]);
32 #define ret_l(X) return(K_l[X]); 32 #define ret_l(X) return(K_l[X]);
33 #define ret_C(X) return(K_C[X]);
34 #define ret_S(X) return(K_S[X]);
35 #define ret_I(X) return(K_I[X]);
36 #define ret_J(X) return(K_J[X]);
37 #define ret_L(X) return(K_L[X]);
33 #define ret_p(X) return(K_p[X]); 38 #define ret_p(X) return(K_p[X]);
34 #define ret_f(X) return(K_f[X]); 39 #define ret_f(X) return(K_f[X]);
35 #define ret_d(X) return(K_d[X]); 40 #define ret_d(X) return(K_d[X]);
36 #define ret_a(X,t) return(*(t*)K_a[X]); 41 #define ret_a(X,t) return(*(t*)K_a[X]);
37 42
38 #define v void 43 #define v void
39 #define c char 44 #define X(CH,T) typedef T CH;
40 #define s short 45 DEF_TYPES
41 #define i int 46 #undef X
42 #define j long 47
43 #define l long long
44 #define p void*
45 #define f float
46 #define d double
47 #define a void* /* all generated aggregates */
48 48
49 #define AF(c,t,i,n) dcAggrField(at,c,offsetof(t,i),n); 49 #define AF(c,t,i,n) dcAggrField(at,c,offsetof(t,i),n);
50 #define AFa(t,i,n,f) dcAggrField(at,DC_SIGCHAR_AGGREGATE,offsetof(t,i),n,f_touchdcst##f()); 50 #define AFa(t,i,n,f) dcAggrField(at,DC_SIGCHAR_AGGREGATE,offsetof(t,i),n,f_touchdcst##f());
51 51
52 #include "dyncall.h" 52 #include "dyncall.h"