diff options
| author | Jesper Jensen <jesper@jnsn.dev> | 2025-03-29 23:28:17 +0100 |
|---|---|---|
| committer | Jesper Jensen <jesper@jnsn.dev> | 2025-03-29 23:28:17 +0100 |
| commit | e5a5469c5ea0df72c5e0bb6f742923ba692ea7f8 (patch) | |
| tree | 35b05814fa6ad8cff9ab5792f0200eec2928607a /src | |
| parent | 3040f7881accffd187b2defdc32d69543f73206d (diff) | |
Diffstat (limited to 'src')
| -rw-r--r-- | src/tree.c | 77 | ||||
| -rw-r--r-- | src/tree.h | 23 |
2 files changed, 100 insertions, 0 deletions
diff --git a/src/tree.c b/src/tree.c new file mode 100644 index 0000000..3bb2737 --- /dev/null +++ b/src/tree.c @@ -0,0 +1,77 @@ +#include "tree.h" + +#include <stdlib.h> + +void expand_alignment(struct Tree a_tree, struct Tree b_tree, uint32_t *alignment, enum Action *emit_actions) { + size_t current_action = 0; + size_t a_cursor = 0; + size_t b_cursor = 0; + size_t alignment_cursor = 0; + + size_t *a_close = malloc(a_tree.len * sizeof(size_t)); + size_t a_close_top = 0; + size_t *b_close = malloc(b_tree.len * sizeof(size_t)); + size_t b_close_top = 0; + + while(a_cursor < a_tree.len && b_cursor < b_tree.len) { + if(alignment[alignment_cursor] == 0) { + alignment_cursor++; + emit_actions[current_action++] = ACTION_ADD_B; + + b_close[b_close_top] = 0; + while(b_close[b_close_top] < b_tree.adj.stride && *imat_nid(b_tree.adj, b_close[b_close_top], b_cursor) != 0) + b_close[b_close_top]++; + b_close_top++; + + b_cursor++; + } else if(a_cursor + 1 < alignment[alignment_cursor]) { + emit_actions[current_action++] = ACTION_DEL_A; + + a_close[a_close_top] = 0; + while(a_close[a_close_top] < a_tree.adj.stride && *imat_nid(a_tree.adj, a_close[a_close_top], a_cursor) != 0) + a_close[a_close_top]++; + a_close_top++; + + a_cursor++; + } else { + alignment_cursor++; + emit_actions[current_action++] = ACTION_MATCH; + + b_close[b_close_top] = 0; + while(b_close[b_close_top] < b_tree.adj.stride && *imat_nid(b_tree.adj, b_close[b_close_top], b_cursor) != 0) + b_close[b_close_top]++; + b_close_top++; + + a_close[a_close_top] = 0; + while(a_close[a_close_top] < a_tree.adj.stride && *imat_nid(a_tree.adj, a_close[a_close_top], a_cursor) != 0) + a_close[a_close_top]++; + a_close_top++; + + a_cursor++; + b_cursor++; + } + + while(a_close[a_close_top-1] == 0 || b_close[b_close_top-1] == 0) { + if(a_close[a_close_top-1] == 0 && b_close[b_close_top-1] == 0) { + a_close_top--; + a_close[a_close_top-1]--; + b_close_top--; + b_close[b_close_top-1]--; + + emit_actions[current_action++] = ACTION_MATCH; + } else if(a_close[a_close_top-1] == 0) { + a_close_top--; + a_close[a_close_top-1]--; + + emit_actions[current_action++] = ACTION_DEL_A; + } else if(b_close[b_close_top-1] == 0) { + b_close_top--; + b_close[b_close_top-1]--; + + emit_actions[current_action++] = ACTION_ADD_B; + } + } + } + + emit_actions[current_action] = ACTION_END; +} diff --git a/src/tree.h b/src/tree.h new file mode 100644 index 0000000..e1dd424 --- /dev/null +++ b/src/tree.h @@ -0,0 +1,23 @@ +#pragma once + +#include "parse.h" +#include <stddef.h> + +#define ACTIONS(X) \ + X(ACTION_MATCH) \ + X(ACTION_DEL_A) \ + X(ACTION_ADD_B) \ + X(ACTION_END) \ + +#define ENUM_VALUE(NAME) NAME, +#define STRING_ARRAY_VALUE(NAME) #NAME, + +enum Action { + ACTIONS(ENUM_VALUE) +}; + +static const char *ActionNames[] = { + ACTIONS(STRING_ARRAY_VALUE) +}; + +void expand_alignment(struct Tree a_tree, struct Tree b_tree, uint32_t *alignment, enum Action *emit_actions); |
