Mercurial > pub > dyncall > dyncall

comparison test/suite_aggrs/globals.c @ 432:167faab0c0be

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
first usable version of test suite for aggregates, handling only non-nested struct params, at the moment; still missing: - unions - arrays - aggregates as return values
author Tassilo Philipp
date Fri, 21 Jan 2022 15:42:29 +0100
parents
children b4ddad459690
comparison
equal deleted inserted replaced
431:1cb8a65ea27f 432:167faab0c0be
1 /*
2
3 Package: dyncall
4 Library: test
5 File: test/call_aggrs/globals.c
6 Description:
7 License:
8
9 Copyright (c) 2022 Tassilo Philipp <tphilipp@potion-studios.com>
10
11 Permission to use, copy, modify, and distribute this software for any
12 purpose with or without fee is hereby granted, provided that the above
13 copyright notice and this permission notice appear in all copies.
14
15 THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
16 WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
17 MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
18 ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
19 WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
20 ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
21 OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
22
23 */
24
25 #include <stdlib.h>
26 #include "globals.h"
27 #include <float.h>
28
29 #define X(CH,T) T *V_##CH; T *K_##CH;
30 DEF_TYPES
31 #undef X
32
33 static double rand_d() { return ( ( (double) rand() ) / ( (double) RAND_MAX ) ); }
34 static void rand_mem(void* p, size_t s) { for(int i=0; i<s; ++i) ((char*)p)[i] = (char)rand(); }
35
36 static int calc_max_aggr_size()
37 {
38 int i, s = 0;
39 for(i=0; i<G_naggs; ++i)
40 if(G_agg_sizes[i] > s)
41 s = G_agg_sizes[i];
42 return s;
43 }
44
45 void init_K()
46 {
47 int i;
48 int maxaggrsize = calc_max_aggr_size();
49 #define X(CH,T) V_##CH = (T*) malloc(sizeof(T)*(G_maxargs+1)); K_##CH = (T*) malloc(sizeof(T)*(G_maxargs+1));
50 DEF_TYPES
51 #undef X
52
53
54 for(i=0;i<G_maxargs+1;++i) {
55 K_c[i] = (char) (((rand_d()-0.5)*2) * (1<<7));
56 K_s[i] = (short) (((rand_d()-0.5)*2) * (1<<(sizeof(short)*8-1)));
57 K_i[i] = (int) (((rand_d()-0.5)*2) * (1<<(sizeof(int)*8-2)));
58 K_j[i] = (long) (((rand_d()-0.5)*2) * (1L<<(sizeof(long)*8-2)));
59 K_l[i] = (long long) (((rand_d()-0.5)*2) * (1LL<<(sizeof(long long)*8-2)));
60 K_p[i] = (void*) (long) (((rand_d()-0.5)*2) * (1LL<<(sizeof(void*)*8-1)));
61 K_f[i] = (float) (rand_d() * FLT_MAX);
62 K_d[i] = (double) (((rand_d()-0.5)*2) * 1.7976931348623157E+308/*__DBL_MAX__*/); /* Plan9 doesn't know the macro. */
63 K_a[i] = malloc(maxaggrsize); rand_mem(K_a[i], maxaggrsize);
64 }
65 }
66
67 void clear_V()
68 {
69 static int aggr_init = 0;
70 int maxaggrsize = calc_max_aggr_size();
71
72 int i;
73 for(i=0;i<G_maxargs+1;++i) {
74 if(aggr_init)
75 free(V_a[i]);
76 #define X(CH,T) V_##CH[i] = (T) 0;
77 DEF_TYPES
78 #undef X
79 V_a[i] = malloc(maxaggrsize);
80 }
81 aggr_init = 1;
82 }
83