Hash :
f990b98e
Author :
Thomas de Grivel
Date :
2022-12-06T13:37:43
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
/* 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.
*/
/* Gen from set_item.c.in NAME=fact TYPE=s_fact */
#include <assert.h>
#include <err.h>
#include <stdlib.h>
#include "set_item__fact.h"
#include "fact.h"
s_set_item__fact *
set_item_new__fact (const s_fact *data, uw hash, s_set_item__fact *next)
{
s_set_item__fact *item;
if (! (item = malloc(sizeof(s_set_item__fact))))
errx(1, "set_item_new__fact: out of memory");
fact_copy(data, &item->data);
item->hash = hash;
item->next = next;
item->usage = 0;
return item;
}
void set_item_delete__fact (s_set_item__fact *x)
{
assert(x);
fact_clean(&x->data);
free(x);
}
void set_item_delete_all__fact (s_set_item__fact *x)
{
s_set_item__fact *y;
while (x) {
y = x;
x = x->next;
set_item_delete__fact(y);
}
}