Hash :
6160bff2
Author :
Thomas de Grivel
Date :
2025-07-21T13:03:11
tests pass: refactor p_*
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
/* kc3
* Copyright from 2022 to 2025 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 "assert.h"
#include "block.h"
#include "env.h"
#include "io.h"
#include "tag.h"
s_block * block_init (s_block *block, const s_sym *name)
{
s_env *env;
s_block tmp = {0};
assert(block);
env = env_global();
assert(env);
tmp.name = name;
tmp.next = env->block;
*block = tmp;
env->block = block;
return block;
}
void block_clean (s_block *block)
{
s_env *env;
assert(block);
env = env_global();
assert(env);
assert(env->block == block);
env->block = block->next;
}
s_block ** block_find (const s_sym *name)
{
s_block **block;
block = &env_global()->block;
if (! name)
return block;
while (*block && (*block)->name != name)
block = &(*block)->next;
return block;
}
void block_jump (s_block *block)
{
env_longjmp(env_global(), &block->buf);
abort();
}
void block_return (s_block *block, s_tag *value)
{
block->tag = *value;
block_jump(block);
abort();
}
void block_return_from (const s_sym *name, s_tag *value)
{
s_block **block;
block = block_find(name);
if (! block || ! *block) {
err_write_1("block_return_from: ");
if (name)
err_inspect_sym(name);
else
err_write_1("void");
err_puts(": no matching block found");
err_stacktrace();
abort();
}
block_return(*block, value);
abort();
}