Hash :
1ae6ad0e
Author :
Thomas de Grivel
Date :
2024-07-15T19:59:52
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
/* kc3
* Copyright 2022,2023,2024 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software granted the above
* copyright notice and this permission paragraph are included in all
* copies and substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
#include "alloc.h"
#include "assert.h"
#include "complex.h"
#include "sym.h"
#include "tag.h"
s_tag * tag_addi (const s_tag *a, const s_tag *b, s_tag *dest)
{
s_complex *c;
s_complex ca = {0};
s_complex cb = {0};
const s_sym *type;
assert(a);
assert(b);
assert(dest);
c = alloc(sizeof(s_complex));
if (! c)
return NULL;
type = &g_sym_Complex;
if (! complex_init_cast(&ca, &type, a)) {
free(c);
return NULL;
}
if (! complex_init_cast(&cb, &type, b)) {
complex_clean(&ca);
free(c);
return NULL;
}
if (! tag_sub(&ca.x, &cb.y, &c->x)) {
complex_clean(&cb);
complex_clean(&ca);
free(c);
return NULL;
}
if (! tag_add(&ca.y, &cb.x, &c->y)) {
tag_clean(&c->x);
complex_clean(&cb);
complex_clean(&ca);
free(c);
return NULL;
}
complex_clean(&cb);
complex_clean(&ca);
return tag_init_complex(dest, c);
}