view test/suite_aggrs/cases.c @ 433:45662241d9cd

suite_aggrs now handling struct by value return types, also still missing: nesting, unions, arrays note: this doesn't compile against this same checked in revision of dyncall, but only my working copy; a future checkin will catch up
author Tassilo Philipp
date Sat, 22 Jan 2022 16:07:57 +0100
parents 167faab0c0be
children e4ae6753a276
line wrap: on
line source

/*

 Package: dyncall
 Library: test
 File: test/call_aggrs/cases.c
 Description: 
 License:

   Copyright (c) 2022 Tassilo Philipp <tphilipp@potion-studios.com>

   Permission to use, copy, modify, and distribute this software for any
   purpose with or without fee is hereby granted, provided that the above
   copyright notice and this permission notice appear in all copies.

   THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
   WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
   MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
   ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
   WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
   ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
   OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

*/

#include "globals.h"

#define ret_v(X) 
#define ret_c(X)   return(K_c[X]);
#define ret_s(X)   return(K_s[X]);
#define ret_i(X)   return(K_i[X]);
#define ret_j(X)   return(K_j[X]);
#define ret_l(X)   return(K_l[X]);
#define ret_p(X)   return(K_p[X]);
#define ret_f(X)   return(K_f[X]);
#define ret_d(X)   return(K_d[X]);
#define ret_a(X,t) return(*(t*)K_a[X]);

#define v void
#define c char
#define s short
#define i int
#define j long
#define l long long
#define p void*
#define f float
#define d double
#define a void*  /* all generated aggregates */

#include "dyncall_struct.h"
#include "cases.h"

int G_ncases = sizeof(G_sigtab)/sizeof(G_sigtab[0]);
int G_naggs  = sizeof(G_agg_sigs)/sizeof(G_agg_sigs[0]);