wash/ivy
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

meta: replace bluelib with fx

Browse Source
This commit is contained in:
max 🍓
2026-03-16 14:07:33 +00:00
parent d2abb6faa3
commit e5546f97c2
105 changed files with 1668 additions and 1668 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
lang/ast/iterate.c
View File

@@ -7,14 +7,14 @@ enum ivy_status iterate_regular(
ivy_ast_node_iteration_callback callback)
{
#if 0
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
fx_queue_push_back(&it->it_queue, &node->n_it.it_entry);
node->n_it.it_depth = 0;
while (!b_queue_empty(&it->it_queue)) {
b_queue_entry *entry = b_queue_first(&it->it_queue);
struct ivy_ast_node_iterator_entry *it_entry = b_unbox(
while (!fx_queue_empty(&it->it_queue)) {
fx_queue_entry *entry = fx_queue_first(&it->it_queue);
struct ivy_ast_node_iterator_entry *it_entry = fx_unbox(
struct ivy_ast_node_iterator_entry, entry, it_entry);
node = b_unbox(struct ivy_ast_node, it_entry, n_it);
node = fx_unbox(struct ivy_ast_node, it_entry, n_it);
if (!node) {
/* this should never happen. */
@@ -32,7 +32,7 @@ enum ivy_status iterate_regular(
type->n_collect_children(node, it);
}
b_queue_delete(&it->it_queue, entry);
fx_queue_delete(&it->it_queue, entry);
}
#endif
@@ -60,15 +60,15 @@ enum ivy_status iterate_postorder(
* - should probably use this just for the executable parts of the AST,
* not for nodes defining classes, function metadata, etc.
*/
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
fx_queue_push_back(&it->it_queue, &node->n_it.it_entry);
node->n_it.it_depth = 0;
b_queue_entry *entry = b_queue_first(&it->it_queue);
fx_queue_entry *entry = fx_queue_first(&it->it_queue);
while (entry) {
struct ivy_ast_node_iterator_entry *it_entry = b_unbox(
struct ivy_ast_node_iterator_entry *it_entry = fx_unbox(
struct ivy_ast_node_iterator_entry, entry, it_entry);
node = b_unbox(struct ivy_ast_node, it_entry, n_it);
node = fx_unbox(struct ivy_ast_node, it_entry, n_it);
if (!node) {
/* this should never happen. */
@@ -81,16 +81,16 @@ enum ivy_status iterate_postorder(
type->n_collect_children(node, it);
}
entry = b_queue_next(entry);
entry = fx_queue_next(entry);
}
while (!b_queue_empty(&it->it_queue)) {
b_queue_entry *entry = b_queue_pop_back(&it->it_queue);
while (!fx_queue_empty(&it->it_queue)) {
fx_queue_entry *entry = fx_queue_pop_back(&it->it_queue);
if (!entry) {
break;
}
node = b_unbox(struct ivy_ast_node, entry, n_it);
node = fx_unbox(struct ivy_ast_node, entry, n_it);
if (!node) {
/* this should never happen. */
@@ -107,15 +107,15 @@ enum ivy_status ivy_ast_node_iterate(
struct ivy_ast_node *node, struct ivy_ast_node_iterator *it,
ivy_ast_node_iteration_callback callback, void *arg)
{
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
fx_queue_push_back(&it->it_queue, &node->n_it.it_entry);
node->n_it.it_depth = 0;
b_queue_entry *entry = b_queue_first(&it->it_queue);
fx_queue_entry *entry = fx_queue_first(&it->it_queue);
while (entry) {
struct ivy_ast_node_iterator_entry *it_entry = b_unbox(
struct ivy_ast_node_iterator_entry *it_entry = fx_unbox(
struct ivy_ast_node_iterator_entry, entry, it_entry);
node = b_unbox(struct ivy_ast_node, it_entry, n_it);
node = fx_unbox(struct ivy_ast_node, it_entry, n_it);
if (!node) {
/* this should never happen. */
@@ -134,16 +134,16 @@ enum ivy_status ivy_ast_node_iterate(
type->n_collect_children(node, it);
}
entry = b_queue_next(entry);
entry = fx_queue_next(entry);
}
while (!b_queue_empty(&it->it_queue)) {
b_queue_entry *entry = b_queue_pop_back(&it->it_queue);
while (!fx_queue_empty(&it->it_queue)) {
fx_queue_entry *entry = fx_queue_pop_back(&it->it_queue);
if (!entry) {
break;
}
node = b_unbox(struct ivy_ast_node, entry, n_it);
node = fx_unbox(struct ivy_ast_node, entry, n_it);
if (!node) {
/* this should never happen. */
@@ -165,10 +165,10 @@ void ast_node_iterator_enqueue_node(
struct ivy_ast_node *node)
{
if (it->it_insert_after) {
b_queue_insert_after(
fx_queue_insert_after(
&it->it_queue, &node->n_it.it_entry, it->it_insert_after);
} else {
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
fx_queue_push_back(&it->it_queue, &node->n_it.it_entry);
}
node->n_it.it_depth = parent->n_it.it_depth + 1;