Hash :
fadc8073
Author :
Thomas de Grivel
Date :
2023-01-25T10:24:29
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
/* c3
* Copyright 2022,2023 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 <err.h>
#include <stdlib.h>
#include "binding.h"
#include "frame.h"
#include "list.h"
s_frame * frame_clean (s_frame *frame)
{
s_frame *next;
assert(frame);
next = frame->next;
binding_delete_all(frame->bindings);
return next;
}
void frame_delete (s_frame *frame)
{
if (frame) {
frame_clean(frame);
free(frame);
}
}
void frame_delete_all (s_frame *frame)
{
s_frame *next;
while (frame) {
next = frame->next;
frame_delete(frame);
frame = next;
}
}
const s_tag * frame_get (s_frame *frame, const s_sym *sym)
{
const s_tag *tag;
while (frame) {
if ((tag = binding_get(frame->bindings, sym)))
return tag;
frame = frame->next;
}
return NULL;
}
s_frame * frame_init (s_frame *frame, s_frame *next)
{
assert(frame);
frame->bindings = NULL;
frame->next = next;
return frame;
}
s_frame * frame_new (s_frame *next)
{
s_frame *frame;
if (! (frame = malloc(sizeof(s_frame))))
errx(1, "frame_new: out of memory");
return frame_init(frame, next);
}