Hash :
d04f9d06
Author :
Thomas de Grivel
Date :
2022-12-30T19:17:02
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 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115
/* c3
* Copyright 2022 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software excepted
* on Apple computers 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 <assert.h>
#include <stdlib.h>
#include "buf.h"
#include "buf_inspect.h"
#include "buf_parse.h"
#include "tuple.h"
#include "tag.h"
void tuple_clean (s_tuple *tuple)
{
uw i;
assert(tuple);
i = tuple->count;
while (i--)
tag_clean(tuple->tag + i);
free(tuple->tag);
}
s_tuple * tuple_copy (const s_tuple *src, s_tuple *dest)
{
uw i = 0;
assert(src);
assert(dest);
tuple_init(dest, src->count);
while (i < src->count) {
tag_copy(src->tag + i, dest->tag + i);
i++;
}
return dest;
}
void tuple_delete (s_tuple *tuple)
{
tuple_clean(tuple);
free(tuple);
}
s_tuple * tuple_init (s_tuple *tuple, uw count)
{
uw i;
assert(tuple);
assert(2 <= count);
tuple->count = count;
tuple->tag = calloc(count, sizeof(s_tag));
if (! tuple->tag)
err(1, "tuple_init: out of memory");
i = count;
while (i--)
tag_init_void(tuple->tag + i);
return tuple;
}
s_tuple * tuple_init_1 (s_tuple *tuple, const s8 *p)
{
s_buf buf;
assert(tuple);
assert(p);
buf_init_1(&buf, p);
if (buf_parse_tuple(&buf, tuple) <= 0) {
assert(! "invalid tuple");
buf_clean(&buf);
return NULL;
}
buf_clean(&buf);
return tuple;
}
s_str * tuple_inspect (const s_tuple *x, s_str *dest)
{
s_buf buf;
sw r;
sw size;
size = buf_inspect_tuple_size(x);
buf_init_alloc(&buf, size);
if ((r = buf_inspect_tuple(&buf, x)) < 0)
goto error;
assert(r == size);
if (r != size)
goto error;
return buf_to_str(&buf, dest);
error:
buf_clean(&buf);
return NULL;
}
s_tuple * tuple_new (uw count)
{
s_tuple *t;
t = malloc(sizeof(s_tuple));
if (! t)
errx(1, "tuple_new: out of memory");
return tuple_init(t, count);
}
s_tuple * tuple_new_1 (const s8 *p)
{
s_tuple *t;
t = malloc(sizeof(s_tuple));
if (! t)
errx(1, "tuple_new_1: out of memory");
return tuple_init_1(t, p);
}