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

lang: update bluelib api usage

Browse Source
This commit is contained in:
max 🍓
2025-11-06 10:38:32 +00:00
parent b26c37c349
commit 4386965cd9
40 changed files with 351 additions and 271 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
lang/ast/iterate.c
View File

@@ -63,12 +63,11 @@ enum ivy_status iterate_postorder(
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
node->n_it.it_depth = 0;
b_queue_iterator q_it;
b_queue_iterator_begin(&it->it_queue, &q_it);
b_queue_entry *entry = b_queue_first(&it->it_queue);
while (b_queue_iterator_is_valid(&q_it)) {
while (entry) {
struct ivy_ast_node_iterator_entry *it_entry = b_unbox(
struct ivy_ast_node_iterator_entry, q_it.entry, it_entry);
struct ivy_ast_node_iterator_entry, entry, it_entry);
node = b_unbox(struct ivy_ast_node, it_entry, n_it);
if (!node) {
@@ -78,11 +77,11 @@ enum ivy_status iterate_postorder(
const struct ast_node_type *type = get_ast_node_type(node->n_type);
if (type->n_collect_children) {
it->it_insert_after = q_it.entry;
it->it_insert_after = entry;
type->n_collect_children(node, it);
}
b_queue_iterator_next(&q_it);
entry = b_queue_next(entry);
}
while (!b_queue_empty(&it->it_queue)) {
@@ -111,12 +110,11 @@ enum ivy_status ivy_ast_node_iterate(
b_queue_push_back(&it->it_queue, &node->n_it.it_entry);
node->n_it.it_depth = 0;
b_queue_iterator q_it;
b_queue_iterator_begin(&it->it_queue, &q_it);
b_queue_entry *entry = b_queue_first(&it->it_queue);
while (b_queue_iterator_is_valid(&q_it)) {
while (entry) {
struct ivy_ast_node_iterator_entry *it_entry = b_unbox(
struct ivy_ast_node_iterator_entry, q_it.entry, it_entry);
struct ivy_ast_node_iterator_entry, entry, it_entry);
node = b_unbox(struct ivy_ast_node, it_entry, n_it);
if (!node) {
@@ -132,11 +130,11 @@ enum ivy_status ivy_ast_node_iterate(
const struct ast_node_type *type = get_ast_node_type(node->n_type);
if (type->n_collect_children) {
it->it_insert_after = q_it.entry;
it->it_insert_after = entry;
type->n_collect_children(node, it);
}
b_queue_iterator_next(&q_it);
entry = b_queue_next(entry);
}
while (!b_queue_empty(&it->it_queue)) {