Hash :
516d1a0f
Author :
Thomas de Grivel
Date :
2024-12-25T16:07:10
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
/* 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 "fact_list.h"
s_fact_list * fact_list_delete (s_fact_list *fl)
{
s_fact_list *next;
assert(fl);
next = fl->next;
alloc_unmap(fl, sizeof(s_fact_list));
return next;
}
void fact_list_delete_all (s_fact_list *fl)
{
s_fact_list *list;
assert(fl);
list = fl;
while (list)
list = fact_list_delete(list);
}
s_fact_list * fact_list_init (s_fact_list *fl, s_fact *fact,
s_fact_list *next)
{
assert(fl);
fl->fact = fact;
fl->next = next;
return fl;
}
s_fact_list * fact_list_new (s_fact *fact, s_fact_list *next)
{
s_fact_list *fl;
fl = alloc_map(sizeof(s_fact_list));
if (! fl)
return NULL;
if (! fact_list_init(fl, fact, next)) {
alloc_unmap(fl, sizeof(s_fact_list));
return NULL;
}
return fl;
}